@graphrefly/graphrefly 0.25.0 → 0.27.0

package/dist/chunk-RNHBMHKA.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/extra/backoff.ts","../src/extra/operators.ts","../src/extra/composite.ts"],"sourcesContent":["/**\n * Backoff strategies for {@link retry} (roadmap §3.1). Delays are in **nanoseconds**.\n *\n * Convention: all graphrefly-ts timestamps and durations use nanoseconds (`_ns` suffix).\n * 1 second = 1_000_000_000 ns, 1 ms = 1_000_000 ns.\n */\n\nexport const NS_PER_MS = 1_000_000;\nexport const NS_PER_SEC = 1_000_000_000;\n\nexport type JitterMode = \"none\" | \"full\" | \"equal\";\n\nexport type BackoffPreset =\n\t| \"constant\"\n\t| \"linear\"\n\t| \"exponential\"\n\t| \"fibonacci\"\n\t| \"decorrelatedJitter\";\n\n/** `(attempt, error?, previousDelayNs?) => delayNs | null` — `null` means zero delay. */\nexport type BackoffStrategy = (\n\tattempt: number,\n\terror?: unknown,\n\tprevDelayNs?: number | null,\n) => number | null;\n\nfunction clampNonNegative(value: number): number {\n\treturn value < 0 ? 0 : value;\n}\n\nfunction applyJitter(delay: number, jitter: JitterMode): number {\n\tif (jitter === \"none\") return delay;\n\tif (jitter === \"full\") return Math.random() * delay;\n\treturn delay / 2 + Math.random() * (delay / 2);\n}\n\nfunction randomBetween(min: number, max: number): number {\n\treturn min + Math.random() * (max - min);\n}\n\n/**\n * Builds a strategy that always returns the same delay in nanoseconds.\n *\n * @param delayNs - Non-negative delay in nanoseconds; values below zero are clamped to zero.\n * @returns `BackoffStrategy` for use with {@link retry} or custom timers.\n *\n * @example\n * ```ts\n * import { constant, retry, NS_PER_SEC } from \"@graphrefly/graphrefly-ts\";\n *\n * const out = retry(source, { count: 3, backoff: constant(0.25 * NS_PER_SEC) });\n * ```\n *\n * @category extra\n */\nexport function constant(delayNs: number): BackoffStrategy {\n\tconst safe = clampNonNegative(delayNs);\n\treturn () => safe;\n}\n\n/**\n * Builds linear backoff: `baseNs + stepNs * attempt` (`stepNs` defaults to `baseNs`).\n *\n * @param baseNs - Base delay in nanoseconds (clamped non-negative).\n * @param stepNs - Added per retry attempt in nanoseconds (clamped non-negative).\n * @returns `BackoffStrategy` for {@link retry}.\n *\n * @example\n * ```ts\n * import { linear, retry, NS_PER_SEC } from \"@graphrefly/graphrefly-ts\";\n *\n * // Attempt 0 → 1 s, attempt 1 → 2 s, attempt 2 → 3 s …\n * const out = retry(source, { count: 4, backoff: linear(NS_PER_SEC) });\n * ```\n *\n * @category extra\n */\nexport function linear(baseNs: number, stepNs?: number): BackoffStrategy {\n\tconst safeBase = clampNonNegative(baseNs);\n\tconst safeStep = stepNs === undefined ? safeBase : clampNonNegative(stepNs);\n\treturn (attempt: number) => safeBase + safeStep * Math.max(0, attempt);\n}\n\nexport type ExponentialBackoffOptions = {\n\tbaseNs?: number;\n\tfactor?: number;\n\tmaxDelayNs?: number;\n\tjitter?: JitterMode;\n};\n\n/**\n * Builds exponential backoff in nanoseconds, capped by `maxDelayNs`, with optional jitter.\n *\n * @param options - Base, factor, cap, and jitter mode.\n * @returns `BackoffStrategy` for {@link retry}.\n *\n * @remarks\n * **Jitter:** `\"full\"` spreads delay across `[0, delay]`; `\"equal\"` uses `[delay/2, delay]`.\n *\n * @example\n * ```ts\n * import { exponential, retry, NS_PER_SEC } from \"@graphrefly/graphrefly-ts\";\n *\n * // 100 ms → 200 ms → 400 ms … capped at 30 s, with full jitter\n * const out = retry(source, {\n *   count: 5,\n *   backoff: exponential({ baseNs: 100 * NS_PER_SEC / 1000, jitter: \"full\" }),\n * });\n * ```\n *\n * @category extra\n */\nexport function exponential(options?: ExponentialBackoffOptions): BackoffStrategy {\n\tconst baseNs = clampNonNegative(options?.baseNs ?? 100 * NS_PER_MS);\n\tconst factor = options?.factor !== undefined && options.factor < 1 ? 1 : (options?.factor ?? 2);\n\tconst maxDelayNs = clampNonNegative(options?.maxDelayNs ?? 30 * NS_PER_SEC);\n\tconst jitter = options?.jitter ?? \"none\";\n\n\treturn (attempt: number) => {\n\t\tlet delay: number;\n\t\tif (baseNs === 0) {\n\t\t\tdelay = 0;\n\t\t} else if (factor === 1) {\n\t\t\tdelay = baseNs;\n\t\t} else {\n\t\t\tconst capRatio = maxDelayNs / baseNs;\n\t\t\tlet growth = 1;\n\t\t\tfor (let i = 0; i < Math.max(0, attempt); i++) {\n\t\t\t\tif (growth >= capRatio) {\n\t\t\t\t\tgrowth = capRatio;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tgrowth *= factor;\n\t\t\t}\n\t\t\tdelay = baseNs * growth;\n\t\t\tif (delay > maxDelayNs) delay = maxDelayNs;\n\t\t}\n\t\treturn applyJitter(delay, jitter);\n\t};\n}\n\n/**\n * Builds Fibonacci-scaled delays: `1, 2, 3, 5, … × baseNs`, capped at `maxDelayNs`.\n *\n * @param baseNs - Multiplier applied to the Fibonacci unit (default `100ms` in nanoseconds).\n * @param maxDelayNs - Upper bound in nanoseconds (default `30s`).\n * @returns `BackoffStrategy` for {@link retry}.\n *\n * @example\n * ```ts\n * import { fibonacci, retry, NS_PER_MS } from \"@graphrefly/graphrefly-ts\";\n *\n * // Delays: 100 ms, 200 ms, 300 ms, 500 ms, 800 ms … (× 100 ms base)\n * const out = retry(source, { count: 5, backoff: fibonacci(100 * NS_PER_MS) });\n * ```\n *\n * @category extra\n */\nexport function fibonacci(baseNs = 100 * NS_PER_MS, maxDelayNs = 30 * NS_PER_SEC): BackoffStrategy {\n\tconst safeBase = clampNonNegative(baseNs);\n\tconst safeMax = clampNonNegative(maxDelayNs);\n\n\tfunction fibUnit(attempt: number): number {\n\t\tif (attempt <= 0) return 1;\n\t\tlet prev = 1;\n\t\tlet cur = 2;\n\t\tfor (let i = 1; i < attempt; i++) {\n\t\t\tconst next = prev + cur;\n\t\t\tprev = cur;\n\t\t\tcur = next;\n\t\t}\n\t\treturn cur;\n\t}\n\n\treturn (attempt: number) => {\n\t\tconst raw = fibUnit(attempt) * safeBase;\n\t\treturn raw <= safeMax ? raw : safeMax;\n\t};\n}\n\n/**\n * Decorrelated jitter (AWS-recommended): `random(baseNs, min(maxNs, lastDelay * 3))`.\n *\n * Stateless — uses `prevDelayNs` (passed by the consumer) instead of closure state.\n * Safe to share across concurrent retry sequences.\n *\n * @param baseNs - Floor of the random range (default `100ms` in nanoseconds).\n * @param maxNs - Ceiling cap (default `30s` in nanoseconds).\n * @returns `BackoffStrategy` for {@link retry}.\n *\n * @example\n * ```ts\n * import { decorrelatedJitter, retry, NS_PER_MS, NS_PER_SEC } from \"@graphrefly/graphrefly-ts\";\n *\n * const out = retry(source, {\n *   count: 6,\n *   backoff: decorrelatedJitter(100 * NS_PER_MS, 10 * NS_PER_SEC),\n * });\n * ```\n *\n * @category extra\n */\nexport function decorrelatedJitter(\n\tbaseNs = 100 * NS_PER_MS,\n\tmaxNs = 30 * NS_PER_SEC,\n): BackoffStrategy {\n\treturn (_attempt, _error, prevDelayNs) => {\n\t\tconst last = prevDelayNs ?? baseNs;\n\t\tconst ceiling = Math.min(maxNs, last * 3);\n\t\treturn randomBetween(baseNs, ceiling);\n\t};\n}\n\n/**\n * Decorator that caps any strategy at `maxAttempts`. Returns `null` (stop retrying) after the cap.\n *\n * @param strategy - Inner strategy to wrap.\n * @param maxAttempts - Maximum number of attempts (inclusive).\n * @returns Wrapped `BackoffStrategy`.\n *\n * @example\n * ```ts\n * import { withMaxAttempts, exponential } from \"@graphrefly/graphrefly-ts\";\n *\n * const capped = withMaxAttempts(exponential(), 3);\n * capped(3); // null — no more retries beyond attempt 3\n * ```\n *\n * @category extra\n */\nexport function withMaxAttempts(strategy: BackoffStrategy, maxAttempts: number): BackoffStrategy {\n\treturn (attempt, error, prevDelayNs) => {\n\t\tif (attempt >= maxAttempts) return null;\n\t\treturn strategy(attempt, error, prevDelayNs);\n\t};\n}\n\n/**\n * Maps a preset name to a concrete {@link BackoffStrategy} with library-default parameters.\n *\n * @param name - One of `constant`, `linear`, `exponential`, `fibonacci`, or `decorrelatedJitter`.\n * @returns Configured strategy with default parameters.\n * @throws Error when `name` is not a known preset.\n *\n * @example\n * ```ts\n * import { resolveBackoffPreset, retry } from \"@graphrefly/graphrefly-ts\";\n *\n * const out = retry(source, { count: 3, backoff: resolveBackoffPreset(\"exponential\") });\n * // Equivalent to retry(source, { count: 3, backoff: exponential() })\n * ```\n *\n * @category extra\n */\nexport function resolveBackoffPreset(name: BackoffPreset): BackoffStrategy {\n\tif (name === \"constant\") return constant(1 * NS_PER_SEC);\n\tif (name === \"linear\") return linear(1 * NS_PER_SEC);\n\tif (name === \"exponential\") return exponential();\n\tif (name === \"fibonacci\") return fibonacci();\n\tif (name === \"decorrelatedJitter\") return decorrelatedJitter();\n\tthrow new Error(\n\t\t`Unknown backoff preset: \"${String(name)}\". Use one of: constant, linear, exponential, fibonacci, decorrelatedJitter`,\n\t);\n}\n","/**\n * Tier 1 sync operators (roadmap §2.1) and Tier 2 async/dynamic operators (roadmap §2.2) —\n * each returns a {@link Node} built with {@link node} (or {@link producer} for cold sources).\n *\n * v5 foundation redesign: all operators use `actions.emit()` for value emission,\n * `ctx.store` for persistent state, `ctx.terminalDeps` for terminal handling,\n * and `data[i]` batch shape for DATA vs RESOLVED discrimination. `onMessage`\n * and `onResubscribe` are removed.\n */\n\nimport { monotonicNs } from \"../core/clock.js\";\nimport type { NodeActions } from \"../core/config.js\";\nimport {\n\tCOMPLETE,\n\tDATA,\n\tDIRTY,\n\tERROR,\n\ttype Message,\n\ttype Messages,\n\tRESOLVED,\n\tSTART,\n} from \"../core/messages.js\";\nimport { type Node, type NodeOptions, node } from \"../core/node.js\";\nimport { derived, producer } from \"../core/sugar.js\";\nimport { NS_PER_MS } from \"./backoff.js\";\nimport { fromAny, type NodeInput } from \"./sources.js\";\n\ntype ExtraOpts = Omit<NodeOptions<unknown>, \"describeKind\">;\n\nfunction operatorOpts<T = unknown>(opts?: ExtraOpts): NodeOptions<T> {\n\treturn { describeKind: \"derived\", ...opts } as NodeOptions<T>;\n}\n\n/**\n * Maps each settled value from `source` through `project`.\n *\n * @param source - Upstream node.\n * @param project - Transform for each value.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<R>` - Derived node emitting mapped values.\n *\n * @example\n * ```ts\n * import { map, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = map(state(2), (x) => x * 3);\n * ```\n *\n * @category extra\n */\nexport function map<T, R>(source: Node<T>, project: (value: T) => R, opts?: ExtraOpts): Node<R> {\n\treturn node<R>(\n\t\t[source as Node],\n\t\t(data, a) => {\n\t\t\tconst batch0 = data[0];\n\t\t\tif (batch0 == null || batch0.length === 0) {\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfor (const v of batch0) {\n\t\t\t\ta.emit(project(v as T));\n\t\t\t}\n\t\t},\n\t\toperatorOpts<R>(opts),\n\t);\n}\n\n/**\n * Forwards values that satisfy `predicate`; otherwise emits `RESOLVED` with no `DATA` (two-phase semantics).\n *\n * @param source - Upstream node.\n * @param predicate - Inclusion test.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Filtered node.\n *\n * @example\n * ```ts\n * import { filter, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = filter(state(1), (x) => x > 0);\n * ```\n *\n * @category extra\n */\nexport function filter<T>(\n\tsource: Node<T>,\n\tpredicate: (value: T) => boolean,\n\topts?: ExtraOpts,\n): Node<T> {\n\treturn node<T>(\n\t\t[source as Node],\n\t\t(data, a) => {\n\t\t\tconst batch0 = data[0];\n\t\t\tif (batch0 == null || batch0.length === 0) {\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tlet emitted = false;\n\t\t\tfor (const v of batch0) {\n\t\t\t\tif (predicate(v as T)) {\n\t\t\t\t\ta.emit(v as T);\n\t\t\t\t\temitted = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!emitted) a.down([[RESOLVED]]);\n\t\t},\n\t\toperatorOpts(opts),\n\t);\n}\n\n/**\n * Folds each upstream value into an accumulator; emits the new accumulator every time.\n *\n * Unlike RxJS, `seed` is always required — there is no seedless mode where the first\n * value silently becomes the accumulator.\n *\n * @param source - Upstream node.\n * @param reducer - `(acc, value) => nextAcc`.\n * @param seed - Initial accumulator (required).\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<R>` - Scan node.\n *\n * @example\n * ```ts\n * import { scan, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = scan(state(1), (a, x) => a + x, 0);\n * ```\n *\n * @category extra\n */\nexport function scan<T, R>(\n\tsource: Node<T>,\n\treducer: (acc: R, value: T) => R,\n\tseed: R,\n\topts?: ExtraOpts,\n): Node<R> {\n\treturn node<R>(\n\t\t[source as Node],\n\t\t(data, a, ctx) => {\n\t\t\tif (!(\"acc\" in ctx.store)) ctx.store.acc = seed;\n\t\t\tconst batch0 = data[0];\n\t\t\tif (batch0 == null || batch0.length === 0) {\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfor (const v of batch0) {\n\t\t\t\tctx.store.acc = reducer(ctx.store.acc as R, v as T);\n\t\t\t\ta.emit(ctx.store.acc as R);\n\t\t\t}\n\t\t},\n\t\t{ ...operatorOpts(opts), initial: seed, resetOnTeardown: true },\n\t);\n}\n\n/**\n * Reduces to one value emitted when `source` completes; if no `DATA` arrived, emits `seed`.\n *\n * Unlike RxJS, `seed` is always required. If the source completes without emitting\n * DATA, the seed value is emitted (RxJS would throw without a seed).\n *\n * @param source - Upstream node.\n * @param reducer - `(acc, value) => nextAcc`.\n * @param seed - Empty-completion default and initial accumulator (required).\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<R>` - Node that emits once on completion.\n *\n * @example\n * ```ts\n * import { reduce, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = reduce(state(1), (a, x) => a + x, 0);\n * ```\n *\n * @category extra\n */\nexport function reduce<T, R>(\n\tsource: Node<T>,\n\treducer: (acc: R, value: T) => R,\n\tseed: R,\n\topts?: ExtraOpts,\n): Node<R> {\n\treturn node<R>(\n\t\t[source as Node],\n\t\t(data, a, ctx) => {\n\t\t\tif (!(\"acc\" in ctx.store)) ctx.store.acc = seed;\n\t\t\t// COMPLETE: emit accumulated value then COMPLETE.\n\t\t\t// ERROR: autoError propagates automatically; nothing to emit.\n\t\t\tif (ctx.terminalDeps[0] === true) {\n\t\t\t\ta.emit(ctx.store.acc as R);\n\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst batch0 = data[0];\n\t\t\t// RESOLVED wave (empty batch): propagate RESOLVED. After fn has run once\n\t\t\t// the pre-fn skip handles this; this guard covers the first-wave case.\n\t\t\tif (batch0 == null || batch0.length === 0) {\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// DATA: accumulate silently — emit nothing until COMPLETE.\n\t\t\tfor (const v of batch0) {\n\t\t\t\tctx.store.acc = reducer(ctx.store.acc as R, v as T);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\t...operatorOpts(opts),\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t},\n\t);\n}\n\n/**\n * Emits at most `count` **`DATA`** values, then **`COMPLETE`**. `RESOLVED` does not advance the counter.\n *\n * @param source - Upstream node.\n * @param count - Maximum `DATA` emissions (≤0 completes immediately).\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Limited stream.\n *\n * @example\n * ```ts\n * import { take, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = take(state(0), 3);\n * ```\n *\n * @category extra\n */\nexport function take<T>(source: Node<T>, count: number, opts?: ExtraOpts): Node<T> {\n\tif (count <= 0) {\n\t\treturn node<T>(\n\t\t\t[source as Node],\n\t\t\t(_d, a, ctx) => {\n\t\t\t\tif (ctx.store.completed) return;\n\t\t\t\tctx.store.completed = true;\n\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t},\n\t\t\t{\n\t\t\t\t...operatorOpts(opts),\n\t\t\t\tcompleteWhenDepsComplete: false,\n\t\t\t},\n\t\t);\n\t}\n\treturn node<T>(\n\t\t[source as Node],\n\t\t(data, a, ctx) => {\n\t\t\tif (!(\"taken\" in ctx.store)) ctx.store.taken = 0;\n\t\t\tif (ctx.store.done) {\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Upstream COMPLETE before count reached → forward COMPLETE.\n\t\t\tif (ctx.terminalDeps[0] === true) {\n\t\t\t\tctx.store.done = true;\n\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst batch0 = data[0];\n\t\t\tif (batch0 == null || batch0.length === 0) {\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// DATA wave: iterate full batch, stop at count\n\t\t\tfor (const v of batch0) {\n\t\t\t\t(ctx.store.taken as number)++;\n\t\t\t\ta.emit(v as T);\n\t\t\t\tif ((ctx.store.taken as number) >= count) {\n\t\t\t\t\tctx.store.done = true;\n\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\t...operatorOpts(opts),\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t},\n\t);\n}\n\n/**\n * Skips the first `count` **`DATA`** emissions. `RESOLVED` does not advance the counter.\n *\n * @param source - Upstream node.\n * @param count - Number of `DATA` values to drop.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Skipped stream.\n *\n * @example\n * ```ts\n * import { skip, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = skip(state(0), 2);\n * ```\n *\n * @category extra\n */\nexport function skip<T>(source: Node<T>, count: number, opts?: ExtraOpts): Node<T> {\n\treturn node<T>(\n\t\t[source as Node],\n\t\t(data, a, ctx) => {\n\t\t\tif (!(\"skipped\" in ctx.store)) ctx.store.skipped = 0;\n\t\t\tconst batch0 = data[0];\n\t\t\tif (batch0 == null || batch0.length === 0) {\n\t\t\t\t// RESOLVED wave — pass through\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tlet emitted = false;\n\t\t\tfor (const v of batch0) {\n\t\t\t\t(ctx.store.skipped as number)++;\n\t\t\t\tif ((ctx.store.skipped as number) <= count) {\n\t\t\t\t\t// Still in skip window\n\t\t\t\t} else {\n\t\t\t\t\ta.emit(v as T);\n\t\t\t\t\temitted = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!emitted) a.down([[RESOLVED]]);\n\t\t},\n\t\toperatorOpts(opts),\n\t);\n}\n\n/**\n * Emits while `predicate` holds; on first false, sends **`COMPLETE`**.\n *\n * @param source - Upstream node.\n * @param predicate - Continuation test.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Truncated stream.\n *\n * @example\n * ```ts\n * import { takeWhile, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = takeWhile(state(1), (x) => x < 10);\n * ```\n *\n * @category extra\n */\nexport function takeWhile<T>(\n\tsource: Node<T>,\n\tpredicate: (value: T) => boolean,\n\topts?: ExtraOpts,\n): Node<T> {\n\treturn node<T>(\n\t\t[source as Node],\n\t\t(data, a, ctx) => {\n\t\t\tif (ctx.store.done) {\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst batch0 = data[0];\n\t\t\tif (batch0 == null || batch0.length === 0) {\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfor (const v of batch0) {\n\t\t\t\tif (!predicate(v as T)) {\n\t\t\t\t\tctx.store.done = true;\n\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\ta.emit(v as T);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\t...operatorOpts(opts),\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t},\n\t);\n}\n\n/**\n * Forwards `source` until `notifier` matches `predicate` (default: notifier **`DATA`**), then **`COMPLETE`**.\n *\n * @param source - Main upstream.\n * @param notifier - Triggers completion when `predicate(msg)` is true.\n * @param opts - Optional {@link NodeOptions}, plus `predicate` for custom notifier matching.\n * @returns `Node<T>` - Truncated stream.\n *\n * @example\n * ```ts\n * import { producer, takeUntil, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const src = state(1);\n * const stop = producer((_d, a) => a.emit(undefined));\n * const n = takeUntil(src, stop);\n * ```\n *\n * @category extra\n */\nexport function takeUntil<T>(\n\tsource: Node<T>,\n\tnotifier: Node,\n\topts?: ExtraOpts & { predicate?: (msg: Message) => boolean },\n): Node<T> {\n\tconst pred = opts?.predicate ?? ((m: Message) => m[0] === DATA);\n\tconst { predicate: _, ...restOpts } = opts ?? {};\n\t// Use producer pattern — subscribe to both manually for message-level control.\n\treturn producer<T>(\n\t\t(a) => {\n\t\t\tlet stopped = false;\n\t\t\tconst srcUnsub = source.subscribe((msgs) => {\n\t\t\t\tif (stopped) return;\n\t\t\t\tfor (const m of msgs) {\n\t\t\t\t\tif (stopped) return;\n\t\t\t\t\tif (m[0] === DATA) a.emit(m[1] as T);\n\t\t\t\t\telse if (m[0] === COMPLETE || m[0] === ERROR) {\n\t\t\t\t\t\tstopped = true;\n\t\t\t\t\t\ta.down([m]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\t\tconst notUnsub = notifier.subscribe((msgs) => {\n\t\t\t\tif (stopped) return;\n\t\t\t\tfor (const m of msgs) {\n\t\t\t\t\tif (stopped) return;\n\t\t\t\t\tif (pred(m)) {\n\t\t\t\t\t\tstopped = true;\n\t\t\t\t\t\ta.down([[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\treturn () => {\n\t\t\t\tsrcUnsub();\n\t\t\t\tnotUnsub();\n\t\t\t};\n\t\t},\n\t\toperatorOpts(restOpts as ExtraOpts),\n\t);\n}\n\n/**\n * Emits the first **`DATA`** then **`COMPLETE`** (same as `take(source, 1)`).\n *\n * @param source - Upstream node.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Single-value stream.\n *\n * @example\n * ```ts\n * import { first, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = first(state(42));\n * ```\n *\n * @category extra\n */\nexport function first<T>(source: Node<T>, opts?: ExtraOpts): Node<T> {\n\treturn take(source, 1, opts);\n}\n\n/**\n * Buffers values and emits the last **`DATA`** on **`COMPLETE`**; optional `defaultValue` if none arrived.\n *\n * @param source - Upstream node.\n * @param options - Optional {@link NodeOptions} and `defaultValue` when empty.\n * @returns `Node<T>` - Last-or-default node.\n *\n * @example\n * ```ts\n * import { last, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = last(state(1), { defaultValue: 0 });\n * ```\n *\n * @category extra\n */\nexport function last<T>(source: Node<T>, options?: ExtraOpts & { defaultValue?: T }): Node<T> {\n\tconst { defaultValue, ...rest } = options ?? {};\n\tconst useDefault = options != null && Object.hasOwn(options, \"defaultValue\");\n\treturn node<T>(\n\t\t[source as Node],\n\t\t(data, a, ctx) => {\n\t\t\t// COMPLETE (terminal === true): emit latest or default, then COMPLETE.\n\t\t\t// ERROR: autoError propagates automatically.\n\t\t\tif (ctx.terminalDeps[0] === true) {\n\t\t\t\tif (ctx.store.has) {\n\t\t\t\t\ta.emit(ctx.store.latest as T);\n\t\t\t\t} else if (useDefault) {\n\t\t\t\t\ta.emit(defaultValue as T);\n\t\t\t\t}\n\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst batch0 = data[0];\n\t\t\t// RESOLVED wave: propagate RESOLVED. Covers first-wave case; after first\n\t\t\t// call the pre-fn skip handles this automatically.\n\t\t\tif (batch0 == null || batch0.length === 0) {\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// DATA: accumulate latest — emit nothing until COMPLETE.\n\t\t\tctx.store.latest = batch0.at(-1) as T;\n\t\t\tctx.store.has = true;\n\t\t},\n\t\t{\n\t\t\t...operatorOpts(rest),\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t},\n\t);\n}\n\n/**\n * Emits the first value matching `predicate`, then **`COMPLETE`**.\n *\n * @param source - Upstream node.\n * @param predicate - Match test.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - First-match stream.\n *\n * @example\n * ```ts\n * import { find, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = find(state(1), (x) => x > 0);\n * ```\n *\n * @category extra\n */\nexport function find<T>(\n\tsource: Node<T>,\n\tpredicate: (value: T) => boolean,\n\topts?: ExtraOpts,\n): Node<T> {\n\treturn take(filter(source, predicate, opts), 1, opts);\n}\n\n/**\n * Emits the `index`th **`DATA`** (zero-based), then **`COMPLETE`**.\n *\n * @param source - Upstream node.\n * @param index - Zero-based emission index.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Single indexed value.\n *\n * @example\n * ```ts\n * import { elementAt, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = elementAt(state(0), 2);\n * ```\n *\n * @category extra\n */\nexport function elementAt<T>(source: Node<T>, index: number, opts?: ExtraOpts): Node<T> {\n\treturn take(skip(source, index, opts), 1, opts);\n}\n\n/**\n * Observer shape for {@link tap} — side effects for data, error, and/or complete.\n */\nexport type TapObserver<T> = {\n\tdata?: (value: T) => void;\n\terror?: (err: unknown) => void;\n\tcomplete?: () => void;\n};\n\n/**\n * Invokes side effects; values pass through unchanged.\n *\n * Accepts either a function (called on each DATA) or an observer object\n * `{ data?, error?, complete? }` for lifecycle-aware side effects.\n *\n * @param source - Upstream node.\n * @param fnOrObserver - Side effect function or observer object.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Passthrough node.\n *\n * @example\n * ```ts\n * import { tap, state } from \"@graphrefly/graphrefly-ts\";\n *\n * // Function form (DATA only)\n * tap(state(1), (x) => console.log(x));\n *\n * // Observer form (DATA + ERROR + COMPLETE)\n * tap(state(1), { data: console.log, error: console.error, complete: () => console.log(\"done\") });\n * ```\n *\n * @category extra\n */\nexport function tap<T>(\n\tsource: Node<T>,\n\tfnOrObserver: ((value: T) => void) | TapObserver<T>,\n\topts?: ExtraOpts,\n): Node<T> {\n\tif (typeof fnOrObserver === \"function\") {\n\t\treturn node<T>(\n\t\t\t[source as Node],\n\t\t\t(data, a) => {\n\t\t\t\tconst batch0 = data[0];\n\t\t\t\tif (batch0 == null || batch0.length === 0) {\n\t\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tfor (const v of batch0) {\n\t\t\t\t\tfnOrObserver(v as T);\n\t\t\t\t\ta.emit(v as T);\n\t\t\t\t}\n\t\t\t},\n\t\t\toperatorOpts(opts),\n\t\t);\n\t}\n\tconst obs = fnOrObserver;\n\treturn node<T>(\n\t\t[source as Node],\n\t\t(data, a, ctx) => {\n\t\t\t// Check for terminal events\n\t\t\tif (ctx.terminalDeps[0] !== undefined) {\n\t\t\t\tif (ctx.terminalDeps[0] === true) {\n\t\t\t\t\tobs.complete?.();\n\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t} else {\n\t\t\t\t\tobs.error?.(ctx.terminalDeps[0]);\n\t\t\t\t\ta.down([[ERROR, ctx.terminalDeps[0]]]);\n\t\t\t\t}\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst batch0 = data[0];\n\t\t\tif (batch0 == null || batch0.length === 0) {\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfor (const v of batch0) {\n\t\t\t\tobs.data?.(v as T);\n\t\t\t\ta.emit(v as T);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\t...operatorOpts(opts),\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t},\n\t);\n}\n\n/**\n * Suppresses adjacent duplicates using `equals` (default `Object.is`).\n *\n * @param source - Upstream node.\n * @param equals - Optional equality for consecutive values.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Deduped stream.\n *\n * @example\n * ```ts\n * import { distinctUntilChanged, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = distinctUntilChanged(state(1));\n * ```\n *\n * @category extra\n */\nexport function distinctUntilChanged<T>(\n\tsource: Node<T>,\n\tequals: (a: T, b: T) => boolean = Object.is,\n\topts?: ExtraOpts,\n): Node<T> {\n\treturn node<T>(\n\t\t[source as Node],\n\t\t(data, a, ctx) => {\n\t\t\tconst batch0 = data[0];\n\t\t\tif (batch0 == null || batch0.length === 0) {\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tlet emitted = false;\n\t\t\tfor (const val of batch0 as T[]) {\n\t\t\t\tif (ctx.store.hasPrev && equals(ctx.store.prev as T, val)) {\n\t\t\t\t\t// Suppressed — same as previous\n\t\t\t\t} else {\n\t\t\t\t\tctx.store.prev = val;\n\t\t\t\t\tctx.store.hasPrev = true;\n\t\t\t\t\ta.emit(val);\n\t\t\t\t\temitted = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!emitted) a.down([[RESOLVED]]);\n\t\t},\n\t\toperatorOpts(opts),\n\t);\n}\n\n/**\n * Emits `[previous, current]` pairs starting after the second value (first pair uses `RESOLVED` only).\n *\n * @param source - Upstream node.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<readonly [T, T]>` - Pair stream.\n *\n * @example\n * ```ts\n * import { pairwise, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = pairwise(state(0));\n * ```\n *\n * @category extra\n */\nexport function pairwise<T>(source: Node<T>, opts?: ExtraOpts): Node<readonly [T, T]> {\n\treturn node<readonly [T, T]>(\n\t\t[source as Node],\n\t\t(data, a, ctx) => {\n\t\t\tconst batch0 = data[0];\n\t\t\tif (batch0 == null || batch0.length === 0) {\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tlet emitted = false;\n\t\t\tfor (const x of batch0 as T[]) {\n\t\t\t\tif (!ctx.store.hasPrev) {\n\t\t\t\t\tctx.store.prev = x;\n\t\t\t\t\tctx.store.hasPrev = true;\n\t\t\t\t\t// First value — no pair yet\n\t\t\t\t} else {\n\t\t\t\t\tconst pair = [ctx.store.prev as T, x] as const;\n\t\t\t\t\tctx.store.prev = x;\n\t\t\t\t\ta.emit(pair);\n\t\t\t\t\temitted = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!emitted) a.down([[RESOLVED]]);\n\t\t},\n\t\toperatorOpts(opts),\n\t);\n}\n\n/**\n * Combines the latest value from each dependency whenever any dep settles (combineLatest).\n *\n * @param sources - Nodes to combine (variadic).\n * @returns `Node<T>` - Tuple of latest values.\n *\n * @example\n * ```ts\n * import { combine, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = combine(state(1), state(\"a\"));\n * ```\n *\n * @remarks\n * Unlike RxJS `combineLatest`, this is named `combine`. Use the {@link combineLatest} alias\n * if you prefer the RxJS name. Seed is always required for `scan`/`reduce` (no seedless mode).\n *\n * @category extra\n */\nexport function combine<const T extends readonly unknown[]>(\n\t...sources: { [K in keyof T]: Node<T[K]> }\n): Node<T> {\n\tconst deps = [...sources] as unknown as Node[];\n\treturn derived(deps, (vals) => vals as unknown as T, {\n\t\t...operatorOpts<T>(),\n\t\tequals: (a, b) => {\n\t\t\tif (a.length !== b.length) return false;\n\t\t\tfor (let i = 0; i < a.length; i++) {\n\t\t\t\tif (!Object.is(a[i], b[i])) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t},\n\t});\n}\n\n/**\n * When `primary` settles, emits `[primary, latestSecondary]`. `secondary` alone updates cache only.\n *\n * @param primary - Main stream.\n * @param secondary - Latest value is paired on each primary emission.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<readonly [A, B]>` - Paired stream.\n *\n * @example\n * ```ts\n * import { state, withLatestFrom } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = withLatestFrom(state(1), state(\"x\"));\n * ```\n *\n * @category extra\n */\nexport function withLatestFrom<A, B>(\n\tprimary: Node<A>,\n\tsecondary: Node<B>,\n\topts?: ExtraOpts,\n): Node<readonly [A, B]> {\n\t// Known semantic (documented): on initial activation when BOTH deps are\n\t// `state()` nodes with cached values, the paired emission is dropped.\n\t// `_activate` (src/core/node.ts:1002) subscribes deps sequentially in\n\t// declaration order; primary's push-on-subscribe fires before secondary\n\t// has subscribed, so the first-run gate (§2.7) forces RESOLVED. Secondary\n\t// then fires in a separate wave with primary silent, and the fn's\n\t// \"emit only when primary fired this wave\" rule takes the else branch.\n\t// Use the factory-time seed pattern for initial-value pairing (see\n\t// stratify, budgetGate, distill for examples; COMPOSITION-GUIDE §21).\n\t// A naïve `[secondary, primary]` flip breaks topology-sensitive diamond\n\t// callers like `harness/loop.ts` — the fix needs a deeper design pass.\n\treturn node<readonly [A, B]>(\n\t\t[primary as Node, secondary as Node],\n\t\t(data, a, ctx) => {\n\t\t\tconst batch0 = data[0];\n\t\t\tconst batch1 = data[1];\n\t\t\t// Current secondary value: this wave's last DATA if secondary fired,\n\t\t\t// otherwise last known value from ctx.prevData (previous wave).\n\t\t\tconst secondaryVal = (\n\t\t\t\tbatch1 != null && batch1.length > 0 ? batch1.at(-1) : ctx.prevData[1]\n\t\t\t) as B | undefined;\n\n\t\t\t// Only emit when primary (dep 0) sent DATA this wave.\n\t\t\tif (batch0 != null && batch0.length > 0) {\n\t\t\t\t// secondary has never produced DATA — undefined is the protocol\n\t\t\t\t// sentinel for \"never sent DATA\"; null is a valid DATA value.\n\t\t\t\tif (!(batch1 != null && batch1.length > 0) && ctx.prevData[1] === undefined) {\n\t\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tfor (const v of batch0 as A[]) {\n\t\t\t\t\ta.emit([v, secondaryVal]);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// Secondary update only (or both RESOLVED) — no downstream DATA.\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t}\n\t\t},\n\t\toperatorOpts(opts),\n\t);\n}\n\n/**\n * Merges **`DATA`** from any source with correct two-phase dirty tracking. **`COMPLETE`** after **all** sources complete (spec §1.3.5).\n *\n * @param sources - Nodes to merge (variadic; empty completes immediately).\n * @returns `Node<T>` - Merged stream.\n *\n * @remarks\n * **Ordering:** DIRTY/RESOLVED rules follow multi-source semantics in `~/src/graphrefly/GRAPHREFLY-SPEC.md`.\n *\n * @example\n * ```ts\n * import { merge, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = merge(state(1), state(2));\n * ```\n *\n * @category extra\n */\nexport function merge<T>(...sources: readonly Node<T>[]): Node<T> {\n\tif (sources.length === 0) {\n\t\treturn producer<T>((a) => {\n\t\t\ta.down([[COMPLETE]]);\n\t\t}, operatorOpts());\n\t}\n\t// producer pattern: node() cannot be used here because the sentinel gate\n\t// would block the fn until ALL sources have sent their first DATA, which\n\t// defeats the purpose of merge (forward whichever source fires first).\n\treturn producer<T>((a) => {\n\t\tconst n = sources.length;\n\t\tlet completed = 0;\n\t\tconst unsubs: (() => void)[] = [];\n\t\tfor (const src of sources) {\n\t\t\tconst u = src.subscribe((msgs) => {\n\t\t\t\tfor (const m of msgs) {\n\t\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\t\ta.emit(m[1] as T);\n\t\t\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\t\t\tcompleted += 1;\n\t\t\t\t\t\tif (completed >= n) {\n\t\t\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\t\t\ta.down([m]);\n\t\t\t\t\t}\n\t\t\t\t\t// DIRTY, RESOLVED, START silently absorbed\n\t\t\t\t}\n\t\t\t});\n\t\t\tunsubs.push(u);\n\t\t}\n\t\treturn () => {\n\t\t\tfor (const u of unsubs) u();\n\t\t};\n\t}, operatorOpts());\n}\n\n/**\n * Zips one **`DATA`** from each source per cycle into a tuple. Only **`DATA`** enqueues (spec §1.3.3).\n *\n * @param sources - Nodes to zip (variadic).\n * @returns `Node<T>` - Zipped tuples.\n *\n * @example\n * ```ts\n * import { state, zip } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = zip(state(1), state(2));\n * ```\n *\n * @category extra\n */\nexport function zip<const T extends readonly unknown[]>(\n\t...sources: { [K in keyof T]: Node<T[K]> }\n): Node<T> {\n\tconst n = sources.length;\n\tif (n === 0) {\n\t\treturn producer<T>((a) => {\n\t\t\ta.emit([] as unknown as T);\n\t\t\ta.down([[COMPLETE]]);\n\t\t}, operatorOpts());\n\t}\n\t// Producer pattern: manage queues internally.\n\treturn producer<T>((a) => {\n\t\tconst queues: unknown[][] = Array.from({ length: n }, () => []);\n\t\tlet active = n;\n\n\t\tfunction tryEmit(): void {\n\t\t\twhile (queues.every((q) => q.length > 0)) {\n\t\t\t\tconst tuple = queues.map((q) => q.shift()!) as unknown as T;\n\t\t\t\ta.emit(tuple);\n\t\t\t}\n\t\t}\n\n\t\tconst unsubs: (() => void)[] = [];\n\t\tfor (let i = 0; i < n; i++) {\n\t\t\tconst idx = i;\n\t\t\tconst u = (sources[i] as Node).subscribe((msgs) => {\n\t\t\t\tfor (const m of msgs) {\n\t\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\t\tqueues[idx].push(m[1]);\n\t\t\t\t\t\ttryEmit();\n\t\t\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\t\t\tactive -= 1;\n\t\t\t\t\t\tif (active === 0 || queues[idx].length === 0) {\n\t\t\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\t\t\ta.down([m]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\t\tunsubs.push(u);\n\t\t}\n\t\treturn () => {\n\t\t\tfor (const u of unsubs) u();\n\t\t};\n\t}, operatorOpts());\n}\n\n/**\n * Plays all of `firstSrc`, then all of `secondSrc`. **`DATA`** from `secondSrc` during phase one is buffered until handoff.\n *\n * @param firstSrc - First segment.\n * @param secondSrc - Second segment.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Concatenated stream.\n *\n * @example\n * ```ts\n * import { concat, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = concat(state(1), state(2));\n * ```\n *\n * @category extra\n */\nexport function concat<T>(firstSrc: Node<T>, secondSrc: Node<T>, opts?: ExtraOpts): Node<T> {\n\t// producer pattern: node() cannot be used here because the sentinel gate\n\t// would block the fn until ALL sources have sent their first DATA, which\n\t// defeats the purpose of concat (start forwarding firstSrc immediately,\n\t// regardless of secondSrc state).\n\treturn producer<T>((a) => {\n\t\tlet phase: 0 | 1 = 0;\n\t\tconst pending: unknown[] = [];\n\t\tlet firstUnsub: (() => void) | undefined;\n\t\tlet secondUnsub: (() => void) | undefined;\n\n\t\tsecondUnsub = secondSrc.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (phase === 0) {\n\t\t\t\t\tif (m[0] === DATA) pending.push(m[1]);\n\t\t\t\t\telse if (m[0] === ERROR) a.down([m]);\n\t\t\t\t} else {\n\t\t\t\t\t// phase 1 — forward everything from second\n\t\t\t\t\tif (m[0] === DATA) a.emit(m[1] as T);\n\t\t\t\t\telse if (m[0] === COMPLETE || m[0] === ERROR) a.down([m]);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\tfirstUnsub = firstSrc.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (phase === 0) {\n\t\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\t\ta.emit(m[1] as T);\n\t\t\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\t\t\tphase = 1;\n\t\t\t\t\t\t// Flush buffered second-source DATA\n\t\t\t\t\t\tfor (const v of pending) {\n\t\t\t\t\t\t\ta.emit(v as T);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tpending.length = 0;\n\t\t\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\t\t\ta.down([m]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// phase 1: ignore further first-source messages\n\t\t\t}\n\t\t});\n\n\t\treturn () => {\n\t\t\tfirstUnsub?.();\n\t\t\tsecondUnsub?.();\n\t\t};\n\t}, operatorOpts(opts));\n}\n\n/**\n * First source to emit **`DATA`** wins; later traffic follows only the winner (Rx-style `race`).\n *\n * @param sources - Contestants (variadic; empty completes immediately; one node is identity).\n * @returns `Node<T>` - Winning stream.\n *\n * @example\n * ```ts\n * import { race, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = race(state(1), state(2));\n * ```\n *\n * @category extra\n */\nexport function race<T>(...sources: readonly Node<T>[]): Node<T> {\n\tif (sources.length === 0) {\n\t\treturn producer<T>((a) => {\n\t\t\ta.down([[COMPLETE]]);\n\t\t}, operatorOpts());\n\t}\n\tif (sources.length === 1) {\n\t\t// Identity passthrough — full batch iteration, not derived's .at(-1).\n\t\treturn node<T>(\n\t\t\t[sources[0] as Node],\n\t\t\t(data, a) => {\n\t\t\t\tconst batch0 = data[0];\n\t\t\t\tif (batch0 == null || batch0.length === 0) {\n\t\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tfor (const v of batch0) a.emit(v as T);\n\t\t\t},\n\t\t\toperatorOpts<T>(),\n\t\t);\n\t}\n\t// Producer pattern: first DATA wins.\n\treturn producer<T>((a) => {\n\t\tlet winner: number | null = null;\n\t\tconst unsubs: (() => void)[] = [];\n\t\tfor (let i = 0; i < sources.length; i++) {\n\t\t\tconst idx = i;\n\t\t\tconst u = (sources[i] as Node).subscribe((msgs) => {\n\t\t\t\tfor (const m of msgs) {\n\t\t\t\t\tif (winner !== null && idx !== winner) return;\n\t\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\t\tif (winner === null) winner = idx;\n\t\t\t\t\t\ta.emit(m[1] as T);\n\t\t\t\t\t} else if (m[0] === COMPLETE || m[0] === ERROR) {\n\t\t\t\t\t\tif (winner === null || idx === winner) {\n\t\t\t\t\t\t\ta.down([m]);\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\tunsubs.push(u);\n\t\t}\n\t\treturn () => {\n\t\t\tfor (const u of unsubs) u();\n\t\t};\n\t}, operatorOpts());\n}\n\n// --- Tier 2: async / dynamic (roadmap §2.2), all on `node` / `producer` ---\n\nfunction forwardInner<R>(inner: Node<R>, a: NodeActions, onInnerComplete: () => void): () => void {\n\tlet unsub: (() => void) | undefined;\n\tlet finished = false;\n\tconst finish = (): void => {\n\t\tif (finished) return;\n\t\tfinished = true;\n\t\tonInnerComplete();\n\t};\n\tunsub = inner.subscribe((msgs) => {\n\t\tlet sawComplete = false;\n\t\tlet sawError = false;\n\t\tfor (const m of msgs) {\n\t\t\tif (m[0] === START) continue;\n\t\t\tif (m[0] === DATA) {\n\t\t\t\ta.emit(m[1] as R);\n\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\tsawComplete = true;\n\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\tsawError = true;\n\t\t\t\ta.down([m]);\n\t\t\t} else if (m[0] === DIRTY || m[0] === RESOLVED) {\n\t\t\t\t// Reactive wave signals forwarded to outer output.\n\t\t\t\ta.down([m]);\n\t\t\t}\n\t\t\t// INVALIDATE, PAUSE, RESUME, TEARDOWN from inner are intentionally\n\t\t\t// dropped. Inner lifecycle and flow-control signals are internal to\n\t\t\t// the *Map operator. INVALIDATE is dropped because the inner will\n\t\t\t// follow up with DIRTY+DATA when it recomputes — forwarding\n\t\t\t// INVALIDATE to the outer output's sinks is redundant and wrong for\n\t\t\t// mergeMap (one inner's cache state must not invalidate the whole\n\t\t\t// merged output). PAUSE/RESUME/TEARDOWN: RxJS/callbag precedent —\n\t\t\t// no backpressure forwarding in merge-style operators.\n\t\t}\n\t\tif (sawError) {\n\t\t\tunsub?.();\n\t\t\tunsub = undefined;\n\t\t\tfinish();\n\t\t} else if (sawComplete) {\n\t\t\tfinish();\n\t\t}\n\t});\n\t// P4 START handshake guarantees: subscribe delivers [[START], [DATA, cache]]\n\t// synchronously for settled nodes. Any relevant state is already handled by\n\t// the callback above — no post-subscribe .status/.cache reads needed.\n\treturn () => {\n\t\tunsub?.();\n\t\tunsub = undefined;\n\t};\n}\n\n/**\n * Maps each settled value to an inner node; unsubscribes the previous inner (Rx-style `switchMap`).\n *\n * @param source - Upstream node.\n * @param project - Maps each outer value to an inner source shape (`Node`, scalar, `PromiseLike`, `Iterable`, or `AsyncIterable`) coerced via {@link fromAny}.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<R>` - Emissions from the active inner subscription.\n * @example\n * ```ts\n * import { switchMap, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const src = state(0);\n * switchMap(src, (n) => state((n as number) * 2));\n * ```\n *\n * @category extra\n */\nexport function switchMap<T, R>(\n\tsource: Node<T>,\n\tproject: (value: T) => NodeInput<R>,\n\topts?: ExtraOpts,\n): Node<R> {\n\tlet innerUnsub: (() => void) | undefined;\n\tlet sourceDone = false;\n\n\tfunction clearInner(): void {\n\t\tinnerUnsub?.();\n\t\tinnerUnsub = undefined;\n\t}\n\n\treturn node<R>(\n\t\t[source as Node],\n\t\t(data, a, ctx) => {\n\t\t\t// Source ERROR: cleanup inner, autoError forwards\n\t\t\tif (ctx.terminalDeps[0] != null && ctx.terminalDeps[0] !== true) {\n\t\t\t\tclearInner();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Source COMPLETE\n\t\t\tif (ctx.terminalDeps[0] === true) {\n\t\t\t\tsourceDone = true;\n\t\t\t\tif (!innerUnsub) a.down([[COMPLETE]]);\n\t\t\t\t// inner active: onInnerComplete will fire COMPLETE later\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst batch0 = data[0];\n\t\t\tif (batch0 == null || batch0.length === 0) return;\n\n\t\t\t// Switch: only the latest value matters; skip to the last in the\n\t\t\t// batch to avoid creating and immediately discarding N-1 inners.\n\t\t\t// clearInner() runs once to cancel any prior-wave inner.\n\t\t\tclearInner();\n\t\t\tinnerUnsub = forwardInner(fromAny(project(batch0[batch0.length - 1] as T)), a, () => {\n\t\t\t\tclearInner();\n\t\t\t\tif (sourceDone) a.down([[COMPLETE]]);\n\t\t\t});\n\n\t\t\t// Deactivation-only cleanup: must NOT fire before fn reruns\n\t\t\t// because the terminal wave needs to see innerUnsub intact.\n\t\t\treturn {\n\t\t\t\tdeactivation: () => {\n\t\t\t\t\tclearInner();\n\t\t\t\t\tsourceDone = false;\n\t\t\t\t},\n\t\t\t};\n\t\t},\n\t\t{ ...operatorOpts(opts), completeWhenDepsComplete: false },\n\t);\n}\n\n/**\n * Like {@link switchMap}, but ignores outer `DATA` while an inner subscription is active (`exhaustMap`).\n *\n * @param source - Upstream node.\n * @param project - Maps each outer value to an inner source shape (`Node`, scalar, `PromiseLike`, `Iterable`, or `AsyncIterable`) coerced via {@link fromAny}.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<R>` - Emissions from the active inner while it runs.\n * @example\n * ```ts\n * import { exhaustMap, state } from \"@graphrefly/graphrefly-ts\";\n *\n * exhaustMap(state(0), () => state(1));\n * ```\n *\n * @category extra\n */\nexport function exhaustMap<T, R>(\n\tsource: Node<T>,\n\tproject: (value: T) => NodeInput<R>,\n\topts?: ExtraOpts,\n): Node<R> {\n\tlet innerUnsub: (() => void) | undefined;\n\tlet sourceDone = false;\n\n\tfunction clearInner(): void {\n\t\tinnerUnsub?.();\n\t\tinnerUnsub = undefined;\n\t}\n\n\treturn node<R>(\n\t\t[source as Node],\n\t\t(data, a, ctx) => {\n\t\t\tif (ctx.terminalDeps[0] != null && ctx.terminalDeps[0] !== true) {\n\t\t\t\tclearInner();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (ctx.terminalDeps[0] === true) {\n\t\t\t\tsourceDone = true;\n\t\t\t\tif (!innerUnsub) a.down([[COMPLETE]]);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst batch0 = data[0];\n\t\t\tif (batch0 == null || batch0.length === 0) return;\n\n\t\t\tif (innerUnsub === undefined) {\n\t\t\t\t// First value in batch wins (FIFO exhaustMap gate)\n\t\t\t\tinnerUnsub = forwardInner(fromAny(project(batch0[0] as T)), a, () => {\n\t\t\t\t\tclearInner();\n\t\t\t\t\tif (sourceDone) a.down([[COMPLETE]]);\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\t// Inner active — drop, settle the dep-wave\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t}\n\n\t\t\treturn {\n\t\t\t\tdeactivation: () => {\n\t\t\t\t\tclearInner();\n\t\t\t\t\tsourceDone = false;\n\t\t\t\t},\n\t\t\t};\n\t\t},\n\t\t{ ...operatorOpts(opts), completeWhenDepsComplete: false },\n\t);\n}\n\n/**\n * Enqueues each outer value and subscribes to inners one at a time (`concatMap`).\n *\n * @param source - Upstream node.\n * @param project - Maps each outer value to an inner source shape (`Node`, scalar, `PromiseLike`, `Iterable`, or `AsyncIterable`) coerced via {@link fromAny}.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<R>` - Sequential concatenation of inner streams.\n * @example\n * ```ts\n * import { concatMap, state } from \"@graphrefly/graphrefly-ts\";\n *\n * concatMap(state(0), (n) => state((n as number) + 1));\n * ```\n *\n * @category extra\n */\nexport function concatMap<T, R>(\n\tsource: Node<T>,\n\tproject: (value: T) => NodeInput<R>,\n\topts?: ExtraOpts & { maxBuffer?: number },\n): Node<R> {\n\tconst { maxBuffer: maxBuf, ...concatNodeOpts } = opts ?? {};\n\tconst queue: T[] = [];\n\tlet innerUnsub: (() => void) | undefined;\n\tlet sourceDone = false;\n\tlet actions: NodeActions | undefined;\n\n\tfunction clearInner(): void {\n\t\tinnerUnsub?.();\n\t\tinnerUnsub = undefined;\n\t}\n\n\tfunction tryPump(): void {\n\t\tif (!actions || innerUnsub !== undefined) return;\n\t\tif (queue.length === 0) {\n\t\t\tif (sourceDone) actions.down([[COMPLETE]]);\n\t\t\treturn;\n\t\t}\n\t\tconst v = queue.shift()!;\n\t\tinnerUnsub = forwardInner(fromAny(project(v)), actions, () => {\n\t\t\tclearInner();\n\t\t\ttryPump();\n\t\t});\n\t}\n\n\tfunction enqueue(v: T): void {\n\t\tif (maxBuf && maxBuf > 0 && queue.length >= maxBuf) queue.shift();\n\t\tqueue.push(v);\n\t\ttryPump();\n\t}\n\n\treturn node<R>(\n\t\t[source as Node],\n\t\t(data, a, ctx) => {\n\t\t\tactions = a;\n\n\t\t\tif (ctx.terminalDeps[0] != null && ctx.terminalDeps[0] !== true) {\n\t\t\t\tclearInner();\n\t\t\t\tqueue.length = 0;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (ctx.terminalDeps[0] === true) {\n\t\t\t\tsourceDone = true;\n\t\t\t\ttryPump();\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst batch0 = data[0];\n\t\t\tif (batch0 == null || batch0.length === 0) return;\n\n\t\t\tfor (const v of batch0 as T[]) {\n\t\t\t\tenqueue(v as T);\n\t\t\t}\n\n\t\t\treturn {\n\t\t\t\tdeactivation: () => {\n\t\t\t\t\tclearInner();\n\t\t\t\t\tqueue.length = 0;\n\t\t\t\t\tsourceDone = false;\n\t\t\t\t},\n\t\t\t};\n\t\t},\n\t\t{ ...operatorOpts(concatNodeOpts), completeWhenDepsComplete: false },\n\t);\n}\n\n/** Options for {@link mergeMap}. */\nexport type MergeMapOptions = ExtraOpts & {\n\t/** Maximum number of concurrent inner subscriptions. Default: `Infinity` (unbounded). */\n\tconcurrent?: number;\n};\n\n/**\n * Subscribes to inner nodes in parallel (up to `concurrent`) and merges outputs (`mergeMap` / `flatMap`).\n *\n * @param source - Upstream node.\n * @param project - Maps each outer value to an inner source shape (`Node`, scalar, `PromiseLike`, `Iterable`, or `AsyncIterable`) coerced via {@link fromAny}.\n * @param opts - Optional options including `concurrent` limit.\n * @returns `Node<R>` - Merged output of all active inners; completes when the outer and every inner complete.\n *\n * @remarks\n * **ERROR handling:** An `ERROR` from the outer source cancels all active inner\n * subscriptions and propagates the error downstream. An `ERROR` from an inner\n * subscription propagates downstream immediately but does **not** cancel sibling\n * inner subscriptions — other active inners continue until they complete or the\n * outer errors/completes. This is intentional: for parallel work, isolating\n * failures per-inner is more useful than Rx-style \"first error cancels all.\"\n *\n * @example\n * ```ts\n * import { mergeMap, state } from \"@graphrefly/graphrefly-ts\";\n *\n * // Unbounded (default)\n * mergeMap(state(0), (n) => state((n as number) + 1));\n *\n * // Limited concurrency\n * mergeMap(state(0), (n) => state((n as number) + 1), { concurrent: 3 });\n * ```\n *\n * @category extra\n */\nexport function mergeMap<T, R>(\n\tsource: Node<T>,\n\tproject: (value: T) => NodeInput<R>,\n\topts?: MergeMapOptions,\n): Node<R> {\n\tconst { concurrent: concurrentOpt, ...mergeNodeOpts } = opts ?? {};\n\tconst maxConcurrent =\n\t\tconcurrentOpt != null && concurrentOpt > 0 ? concurrentOpt : Number.POSITIVE_INFINITY;\n\n\tlet active = 0;\n\tlet sourceDone = false;\n\tconst innerStops = new Set<() => void>();\n\tconst buffer: T[] = [];\n\tlet actions: NodeActions | undefined;\n\n\tfunction tryComplete(): void {\n\t\tif (sourceDone && active === 0 && buffer.length === 0 && actions) {\n\t\t\tactions.down([[COMPLETE]]);\n\t\t}\n\t}\n\n\tfunction spawn(v: T): void {\n\t\tif (!actions) return;\n\t\tactive++;\n\t\t// Use `let` (not `const`) so the closure can reference `stop` safely even\n\t\t// if onInnerComplete fires synchronously (e.g. already-completed inner node).\n\t\tlet stop: (() => void) | undefined;\n\t\tstop = forwardInner(fromAny(project(v)), actions, () => {\n\t\t\tif (stop) innerStops.delete(stop);\n\t\t\tactive--;\n\t\t\tdrainBuffer();\n\t\t\ttryComplete();\n\t\t});\n\t\tinnerStops.add(stop);\n\t}\n\n\tfunction drainBuffer(): void {\n\t\twhile (buffer.length > 0 && active < maxConcurrent) {\n\t\t\tspawn(buffer.shift()!);\n\t\t}\n\t}\n\n\tfunction enqueue(v: T): void {\n\t\tif (active < maxConcurrent) spawn(v);\n\t\telse buffer.push(v);\n\t}\n\n\tfunction clearAll(): void {\n\t\tfor (const u of innerStops) u();\n\t\tinnerStops.clear();\n\t\tactive = 0;\n\t\tbuffer.length = 0;\n\t}\n\n\treturn node<R>(\n\t\t[source as Node],\n\t\t(data, a, ctx) => {\n\t\t\tactions = a;\n\n\t\t\tif (ctx.terminalDeps[0] != null && ctx.terminalDeps[0] !== true) {\n\t\t\t\tclearAll();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (ctx.terminalDeps[0] === true) {\n\t\t\t\tsourceDone = true;\n\t\t\t\ttryComplete();\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst batch0 = data[0];\n\t\t\tif (batch0 == null || batch0.length === 0) return;\n\n\t\t\tfor (const v of batch0 as T[]) {\n\t\t\t\tenqueue(v as T);\n\t\t\t}\n\n\t\t\treturn {\n\t\t\t\tdeactivation: () => {\n\t\t\t\t\tclearAll();\n\t\t\t\t\tsourceDone = false;\n\t\t\t\t},\n\t\t\t};\n\t\t},\n\t\t{ ...operatorOpts(mergeNodeOpts), completeWhenDepsComplete: false },\n\t);\n}\n\n/**\n * RxJS-named alias for {@link mergeMap} — projects each `DATA` to an inner node and merges outputs.\n *\n * @param source - Upstream node.\n * @param project - Returns an inner `Node<R>` per value.\n * @param opts - Optional concurrency cap and node options (excluding `describeKind`).\n * @returns Merged projection; behavior matches `mergeMap`.\n *\n * @example\n * ```ts\n * import { flatMap, state } from \"@graphrefly/graphrefly-ts\";\n *\n * flatMap(state(0), (n) => state(n));\n * ```\n *\n * @category extra\n */\nexport const flatMap = mergeMap;\n\n/**\n * Delays phase-2 emissions by `ms` (timers). `DIRTY` still forwards immediately.\n *\n * @param source - Upstream node.\n * @param ms - Delay in milliseconds.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Same values, shifted in time.\n * @example\n * ```ts\n * import { delay, state } from \"@graphrefly/graphrefly-ts\";\n *\n * delay(state(1), 100);\n * ```\n *\n * @category extra\n */\nexport function delay<T>(source: Node<T>, ms: number, opts?: ExtraOpts): Node<T> {\n\treturn producer<T>((a) => {\n\t\tconst timers = new Set<ReturnType<typeof setTimeout>>();\n\t\tfunction clearAll(): void {\n\t\t\tfor (const id of timers) clearTimeout(id);\n\t\t\ttimers.clear();\n\t\t}\n\n\t\tconst srcUnsub = source.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\tconst id = setTimeout(() => {\n\t\t\t\t\t\ttimers.delete(id);\n\t\t\t\t\t\ta.emit(m[1] as T);\n\t\t\t\t\t}, ms);\n\t\t\t\t\ttimers.add(id);\n\t\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\t\t// Wait for all pending timers, then complete\n\t\t\t\t\tconst id = setTimeout(() => {\n\t\t\t\t\t\ttimers.delete(id);\n\t\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t\t}, ms);\n\t\t\t\t\ttimers.add(id);\n\t\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\t\tclearAll();\n\t\t\t\t\ta.down([m]);\n\t\t\t\t}\n\t\t\t\t// DIRTY from source is NOT forwarded — delay transforms the\n\t\t\t\t// timeline. a.emit(v) in the timer callback handles full\n\t\t\t\t// DIRTY+DATA framing atomically at the delayed time.\n\t\t\t}\n\t\t});\n\n\t\treturn () => {\n\t\t\tsrcUnsub();\n\t\t\tclearAll();\n\t\t};\n\t}, operatorOpts(opts));\n}\n\n/**\n * Emits the latest value only after `ms` quiet time since the last trigger (`debounce`).\n *\n * @param source - Upstream node.\n * @param ms - Quiet window in milliseconds.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Debounced stream.\n * @example\n * ```ts\n * import { debounce, state } from \"@graphrefly/graphrefly-ts\";\n *\n * debounce(state(0), 50);\n * ```\n *\n * @category extra\n */\nexport function debounce<T>(source: Node<T>, ms: number, opts?: ExtraOpts): Node<T> {\n\treturn producer<T>((a) => {\n\t\tlet timer: ReturnType<typeof setTimeout> | undefined;\n\t\tlet pending: T | undefined;\n\n\t\tfunction clearTimer(): void {\n\t\t\tif (timer !== undefined) {\n\t\t\t\tclearTimeout(timer);\n\t\t\t\ttimer = undefined;\n\t\t\t}\n\t\t}\n\n\t\tconst srcUnsub = source.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\tclearTimer();\n\t\t\t\t\tpending = m[1] as T;\n\t\t\t\t\ttimer = setTimeout(() => {\n\t\t\t\t\t\ttimer = undefined;\n\t\t\t\t\t\ta.emit(pending as T);\n\t\t\t\t\t}, ms);\n\t\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\t\tif (timer !== undefined) {\n\t\t\t\t\t\tclearTimer();\n\t\t\t\t\t\ta.emit(pending as T);\n\t\t\t\t\t}\n\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\t\tclearTimer();\n\t\t\t\t\ta.down([m]);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\treturn () => {\n\t\t\tsrcUnsub();\n\t\t\tclearTimer();\n\t\t};\n\t}, operatorOpts(opts));\n}\n\nexport type ThrottleOptions = { leading?: boolean; trailing?: boolean };\n\n/**\n * Rate-limits emissions to at most once per `ms` window (`throttleTime`).\n *\n * @param source - Upstream node.\n * @param ms - Minimum spacing in milliseconds.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`) plus `leading` / `trailing`.\n * @returns `Node<T>` - Throttled stream.\n * @example\n * ```ts\n * import { throttle, state } from \"@graphrefly/graphrefly-ts\";\n *\n * throttle(state(0), 1_000, { trailing: false });\n * ```\n *\n * @category extra\n */\nexport function throttle<T>(\n\tsource: Node<T>,\n\tms: number,\n\topts?: ExtraOpts & ThrottleOptions,\n): Node<T> {\n\tconst { leading: leadingOpt, trailing: trailingOpt, ...throttleNodeOpts } = opts ?? {};\n\tconst leading = leadingOpt !== false;\n\tconst trailing = trailingOpt === true;\n\tconst windowNs = ms * NS_PER_MS;\n\n\treturn producer<T>((a) => {\n\t\tlet timer: ReturnType<typeof setTimeout> | undefined;\n\t\tlet lastEmitNs = -Infinity;\n\t\tlet pending: T | undefined;\n\t\tlet hasPending = false;\n\n\t\tfunction clearTimer(): void {\n\t\t\tif (timer !== undefined) {\n\t\t\t\tclearTimeout(timer);\n\t\t\t\ttimer = undefined;\n\t\t\t}\n\t\t}\n\n\t\tconst srcUnsub = source.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\tconst v = m[1] as T;\n\t\t\t\t\tconst nowNs = monotonicNs();\n\t\t\t\t\tif (leading && nowNs - lastEmitNs >= windowNs) {\n\t\t\t\t\t\tlastEmitNs = nowNs;\n\t\t\t\t\t\ta.emit(v);\n\t\t\t\t\t\tclearTimer();\n\t\t\t\t\t\tif (trailing) {\n\t\t\t\t\t\t\ttimer = setTimeout(() => {\n\t\t\t\t\t\t\t\ttimer = undefined;\n\t\t\t\t\t\t\t\tif (hasPending) {\n\t\t\t\t\t\t\t\t\tlastEmitNs = monotonicNs();\n\t\t\t\t\t\t\t\t\ta.emit(pending as T);\n\t\t\t\t\t\t\t\t\thasPending = false;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}, ms);\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (trailing) {\n\t\t\t\t\t\tpending = v;\n\t\t\t\t\t\thasPending = true;\n\t\t\t\t\t\tif (timer === undefined) {\n\t\t\t\t\t\t\tconst elapsedMs = (nowNs - lastEmitNs) / NS_PER_MS;\n\t\t\t\t\t\t\ttimer = setTimeout(\n\t\t\t\t\t\t\t\t() => {\n\t\t\t\t\t\t\t\t\ttimer = undefined;\n\t\t\t\t\t\t\t\t\tif (hasPending) {\n\t\t\t\t\t\t\t\t\t\tlastEmitNs = monotonicNs();\n\t\t\t\t\t\t\t\t\t\ta.emit(pending as T);\n\t\t\t\t\t\t\t\t\t\thasPending = false;\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\tMath.max(0, ms - elapsedMs),\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 (m[0] === COMPLETE || m[0] === ERROR) {\n\t\t\t\t\tclearTimer();\n\t\t\t\t\ta.down([m]);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\treturn () => {\n\t\t\tsrcUnsub();\n\t\t\tclearTimer();\n\t\t};\n\t}, operatorOpts(throttleNodeOpts));\n}\n\n/**\n * Emits the most recent source value whenever `notifier` emits `DATA` (`sample`).\n *\n * Source `COMPLETE` stops sampling (clears held value); notifier `COMPLETE` terminates the\n * operator. `ERROR` from either dep terminates immediately. At most one terminal message is\n * emitted downstream (latch). Supports `resubscribable` — `ctx.store` resets automatically.\n *\n * @param source - Node whose latest value is sampled.\n * @param notifier - When this node emits `DATA`, a sample is taken.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Sampled snapshots of `source`.\n * @example\n * ```ts\n * import { sample, state } from \"@graphrefly/graphrefly-ts\";\n *\n * sample(state(1), state(0));\n * ```\n *\n * @category extra\n */\nexport function sample<T>(source: Node<T>, notifier: Node<unknown>, opts?: ExtraOpts): Node<T> {\n\treturn producer<T>((a) => {\n\t\tlet lastSourceValue: { v: T } | undefined;\n\t\tlet terminated = false;\n\t\tlet sourceCompleted = false;\n\n\t\tconst srcUnsub = source.subscribe((msgs) => {\n\t\t\tif (terminated) return;\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (terminated) return;\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\tlastSourceValue = { v: m[1] as T };\n\t\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\t\tterminated = true;\n\t\t\t\t\ta.down([m]);\n\t\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\t\tsourceCompleted = true;\n\t\t\t\t\tlastSourceValue = undefined;\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\tconst notUnsub = notifier.subscribe((msgs) => {\n\t\t\tif (terminated) return;\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (terminated) return;\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\tif (lastSourceValue !== undefined && !sourceCompleted) {\n\t\t\t\t\t\ta.emit(lastSourceValue.v);\n\t\t\t\t\t}\n\t\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\t\tterminated = true;\n\t\t\t\t\ta.down([m]);\n\t\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\t\tterminated = true;\n\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\treturn () => {\n\t\t\tsrcUnsub();\n\t\t\tnotUnsub();\n\t\t};\n\t}, operatorOpts(opts));\n}\n\n/**\n * After each source `DATA`, waits `ms` then emits the latest value if another `DATA` has not arrived (`auditTime` / trailing window).\n *\n * @param source - Upstream node.\n * @param ms - Window in milliseconds after each `DATA`.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Trailing-edge sampled stream.\n * @example\n * ```ts\n * import { audit, state } from \"@graphrefly/graphrefly-ts\";\n *\n * audit(state(0), 100);\n * ```\n *\n * @category extra\n */\nexport function audit<T>(source: Node<T>, ms: number, opts?: ExtraOpts): Node<T> {\n\treturn producer<T>((a) => {\n\t\tlet timer: ReturnType<typeof setTimeout> | undefined;\n\t\tlet latest: T | undefined;\n\t\tlet has = false;\n\n\t\tfunction clearTimer(): void {\n\t\t\tif (timer !== undefined) {\n\t\t\t\tclearTimeout(timer);\n\t\t\t\ttimer = undefined;\n\t\t\t}\n\t\t}\n\n\t\tconst srcUnsub = source.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\tlatest = m[1] as T;\n\t\t\t\t\thas = true;\n\t\t\t\t\tclearTimer();\n\t\t\t\t\ttimer = setTimeout(() => {\n\t\t\t\t\t\ttimer = undefined;\n\t\t\t\t\t\tif (has) {\n\t\t\t\t\t\t\thas = false;\n\t\t\t\t\t\t\ta.emit(latest as T);\n\t\t\t\t\t\t}\n\t\t\t\t\t}, ms);\n\t\t\t\t} else if (m[0] === COMPLETE || m[0] === ERROR) {\n\t\t\t\t\tclearTimer();\n\t\t\t\t\ta.down([m]);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\treturn () => {\n\t\t\tsrcUnsub();\n\t\t\tclearTimer();\n\t\t};\n\t}, operatorOpts(opts));\n}\n\n/**\n * Errors if no `DATA` arrives within `ms` after subscribe or after the previous `DATA`.\n *\n * @param source - Upstream node.\n * @param ms - Idle budget in milliseconds.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`) and `with` for a custom error payload.\n * @returns `Node<T>` - Pass-through with idle watchdog.\n * @example\n * ```ts\n * import { timeout, state } from \"@graphrefly/graphrefly-ts\";\n *\n * timeout(state(0), 5_000);\n * ```\n *\n * @category extra\n */\nexport function timeout<T>(\n\tsource: Node<T>,\n\tms: number,\n\topts?: ExtraOpts & { with?: unknown },\n): Node<T> {\n\tconst { with: withPayload, ...timeoutNodeOpts } = opts ?? {};\n\tconst err = withPayload ?? new Error(\"timeout\");\n\n\treturn producer<T>((a) => {\n\t\tlet timer: ReturnType<typeof setTimeout> | undefined;\n\n\t\tfunction arm(): void {\n\t\t\tclearTimeout(timer);\n\t\t\ttimer = setTimeout(() => {\n\t\t\t\ttimer = undefined;\n\t\t\t\ta.down([[ERROR, err]]);\n\t\t\t}, ms);\n\t\t}\n\n\t\t// Arm immediately on subscribe\n\t\tarm();\n\n\t\tconst srcUnsub = source.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\tarm();\n\t\t\t\t\ta.emit(m[1] as T);\n\t\t\t\t} else if (m[0] === COMPLETE || m[0] === ERROR) {\n\t\t\t\t\tclearTimeout(timer);\n\t\t\t\t\ta.down([m]);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\treturn () => {\n\t\t\tsrcUnsub();\n\t\t\tclearTimeout(timer);\n\t\t};\n\t}, operatorOpts(timeoutNodeOpts));\n}\n\n/**\n * Buffers source `DATA` values; flushes an array when `notifier` settles (`buffer`).\n *\n * @param source - Upstream node.\n * @param notifier - Flush trigger on each settlement.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T[]>` - Emits buffered arrays (may be empty-handled via `RESOLVED` when nothing buffered).\n * @example\n * ```ts\n * import { buffer, state } from \"@graphrefly/graphrefly-ts\";\n *\n * buffer(state(0), state(0));\n * ```\n *\n * @category extra\n */\nexport function buffer<T>(source: Node<T>, notifier: Node<unknown>, opts?: ExtraOpts): Node<T[]> {\n\treturn producer<T[]>((a) => {\n\t\tconst buf: T[] = [];\n\n\t\tconst srcUnsub = source.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\tbuf.push(m[1] as T);\n\t\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\t\tif (buf.length > 0) a.emit([...buf]);\n\t\t\t\t\tbuf.length = 0;\n\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\t\ta.down([m]);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\tconst notUnsub = notifier.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\tif (buf.length > 0) {\n\t\t\t\t\t\ta.emit([...buf]);\n\t\t\t\t\t\tbuf.length = 0;\n\t\t\t\t\t}\n\t\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\t\t// Notifier complete — forward\n\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\t\ta.down([m]);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\treturn () => {\n\t\t\tsrcUnsub();\n\t\t\tnotUnsub();\n\t\t\tbuf.length = 0;\n\t\t};\n\t}, operatorOpts(opts));\n}\n\n/**\n * Batches consecutive `DATA` values into arrays of length `count` (`bufferCount` / `windowCount`).\n *\n * @param source - Upstream node.\n * @param count - Buffer size before emit; must be > 0.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T[]>` - Emits fixed-size arrays; remainder flushes on `COMPLETE`.\n * @example\n * ```ts\n * import { bufferCount, state } from \"@graphrefly/graphrefly-ts\";\n *\n * bufferCount(state(0), 3);\n * ```\n *\n * @category extra\n */\nexport function bufferCount<T>(source: Node<T>, count: number, opts?: ExtraOpts): Node<T[]> {\n\tif (count <= 0) throw new RangeError(\"bufferCount expects count > 0\");\n\treturn producer<T[]>((a) => {\n\t\tconst buf: T[] = [];\n\n\t\tconst srcUnsub = source.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\tbuf.push(m[1] as T);\n\t\t\t\t\tif (buf.length >= count) {\n\t\t\t\t\t\ta.emit(buf.splice(0, buf.length));\n\t\t\t\t\t}\n\t\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\t\tif (buf.length > 0) a.emit([...buf]);\n\t\t\t\t\tbuf.length = 0;\n\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\t\ta.down([m]);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\treturn () => {\n\t\t\tsrcUnsub();\n\t\t\tbuf.length = 0;\n\t\t};\n\t}, operatorOpts(opts));\n}\n\n/**\n * Splits source `DATA` into sub-nodes of `count` values each. Each sub-node completes after `count` items or when source completes.\n *\n * @param source - Upstream node.\n * @param count - Items per window.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<Node<T>>` - Each emission is a sub-node carrying that window's values.\n *\n * @example\n * ```ts\n * import { windowCount, state } from \"@graphrefly/graphrefly-ts\";\n *\n * windowCount(state(0), 3);\n * ```\n *\n * @category extra\n */\nexport function windowCount<T>(source: Node<T>, count: number, opts?: ExtraOpts): Node<Node<T>> {\n\tif (count <= 0) throw new RangeError(\"windowCount expects count > 0\");\n\n\treturn producer<Node<T>>((a) => {\n\t\tlet winDown: ((msgs: Messages) => void) | undefined;\n\t\tlet n = 0;\n\n\t\tfunction openWindow(): void {\n\t\t\tconst s = producer<T>((actions) => {\n\t\t\t\twinDown = actions.down.bind(actions);\n\t\t\t\treturn () => {\n\t\t\t\t\twinDown = undefined;\n\t\t\t\t};\n\t\t\t}, operatorOpts());\n\t\t\tn = 0;\n\t\t\ta.emit(s);\n\t\t}\n\n\t\tconst srcUnsub = source.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\tif (!winDown) openWindow();\n\t\t\t\t\twinDown?.([[DATA, m[1]]]);\n\t\t\t\t\tn += 1;\n\t\t\t\t\tif (n >= count) {\n\t\t\t\t\t\twinDown?.([[COMPLETE]]);\n\t\t\t\t\t\twinDown = undefined;\n\t\t\t\t\t}\n\t\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\t\twinDown?.([[COMPLETE]]);\n\t\t\t\t\twinDown = undefined;\n\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\t\twinDown?.([m]);\n\t\t\t\t\twinDown = undefined;\n\t\t\t\t\ta.down([m]);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\treturn () => {\n\t\t\tsrcUnsub();\n\t\t\twinDown?.([[COMPLETE]]);\n\t\t\twinDown = undefined;\n\t\t};\n\t}, operatorOpts(opts));\n}\n\n/**\n * Flushes buffered `DATA` values every `ms` (`bufferTime` / `windowTime`).\n *\n * @param source - Upstream node.\n * @param ms - Flush interval in milliseconds.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T[]>` - Time-windowed batches.\n * @example\n * ```ts\n * import { bufferTime, state } from \"@graphrefly/graphrefly-ts\";\n *\n * bufferTime(state(0), 250);\n * ```\n *\n * @category extra\n */\nexport function bufferTime<T>(source: Node<T>, ms: number, opts?: ExtraOpts): Node<T[]> {\n\treturn producer<T[]>((a) => {\n\t\tconst buf: T[] = [];\n\n\t\tconst iv = setInterval(() => {\n\t\t\tif (buf.length > 0) {\n\t\t\t\ta.emit([...buf]);\n\t\t\t\tbuf.length = 0;\n\t\t\t}\n\t\t}, ms);\n\n\t\tconst srcUnsub = source.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\tbuf.push(m[1] as T);\n\t\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\t\tclearInterval(iv);\n\t\t\t\t\tif (buf.length > 0) a.emit([...buf]);\n\t\t\t\t\tbuf.length = 0;\n\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\t\tclearInterval(iv);\n\t\t\t\t\ta.down([m]);\n\t\t\t\t}\n\t\t\t\t// DIRTY from source is NOT forwarded — bufferTime\n\t\t\t\t// transforms the timeline. a.emit(buf) handles full\n\t\t\t\t// DIRTY+DATA framing when the interval fires.\n\t\t\t}\n\t\t});\n\n\t\treturn () => {\n\t\t\tsrcUnsub();\n\t\t\tclearInterval(iv);\n\t\t\tbuf.length = 0;\n\t\t};\n\t}, operatorOpts(opts));\n}\n\n/**\n * Splits source `DATA` into time-windowed sub-nodes; each window lasts `ms`.\n *\n * @param source - Upstream node.\n * @param ms - Window duration in milliseconds.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<Node<T>>` - Each emission is a sub-node carrying that window's values.\n *\n * @example\n * ```ts\n * import { windowTime, state } from \"@graphrefly/graphrefly-ts\";\n *\n * windowTime(state(0), 500);\n * ```\n *\n * @category extra\n */\nexport function windowTime<T>(source: Node<T>, ms: number, opts?: ExtraOpts): Node<Node<T>> {\n\treturn producer<Node<T>>((a) => {\n\t\tlet winDown: ((msgs: Messages) => void) | undefined;\n\n\t\tfunction closeWindow(): void {\n\t\t\twinDown?.([[COMPLETE]]);\n\t\t\twinDown = undefined;\n\t\t}\n\n\t\tfunction openWindow(): void {\n\t\t\tconst s = producer<T>((actions) => {\n\t\t\t\twinDown = actions.down.bind(actions);\n\t\t\t\treturn () => {\n\t\t\t\t\twinDown = undefined;\n\t\t\t\t};\n\t\t\t}, operatorOpts());\n\t\t\ta.emit(s);\n\t\t}\n\n\t\topenWindow();\n\t\tconst iv = setInterval(() => {\n\t\t\tcloseWindow();\n\t\t\topenWindow();\n\t\t}, ms);\n\n\t\tconst srcUnsub = source.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\twinDown?.([[DATA, m[1]]]);\n\t\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\t\tclearInterval(iv);\n\t\t\t\t\tcloseWindow();\n\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\t\tclearInterval(iv);\n\t\t\t\t\twinDown?.([m]);\n\t\t\t\t\tcloseWindow();\n\t\t\t\t\ta.down([m]);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\treturn () => {\n\t\t\tsrcUnsub();\n\t\t\tclearInterval(iv);\n\t\t\tcloseWindow();\n\t\t};\n\t}, operatorOpts(opts));\n}\n\n/**\n * Splits source `DATA` into sub-nodes, opening a new window each time `notifier` emits `DATA`.\n *\n * @param source - Upstream node.\n * @param notifier - Each `DATA` from `notifier` closes the current window and opens a new one.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<Node<T>>` - Each emission is a sub-node carrying that window's values.\n *\n * @example\n * ```ts\n * import { state, window } from \"@graphrefly/graphrefly-ts\";\n *\n * window(state(0), state(0));\n * ```\n *\n * @category extra\n */\nexport function window<T>(\n\tsource: Node<T>,\n\tnotifier: Node<unknown>,\n\topts?: ExtraOpts,\n): Node<Node<T>> {\n\treturn producer<Node<T>>((a) => {\n\t\tlet winDown: ((msgs: Messages) => void) | undefined;\n\n\t\tfunction closeWindow(): void {\n\t\t\twinDown?.([[COMPLETE]]);\n\t\t\twinDown = undefined;\n\t\t}\n\n\t\tfunction openWindow(): void {\n\t\t\tconst s = producer<T>((actions) => {\n\t\t\t\twinDown = actions.down.bind(actions);\n\t\t\t\treturn () => {\n\t\t\t\t\twinDown = undefined;\n\t\t\t\t};\n\t\t\t}, operatorOpts());\n\t\t\ta.emit(s);\n\t\t}\n\n\t\tconst srcUnsub = source.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\tif (!winDown) openWindow();\n\t\t\t\t\twinDown?.([[DATA, m[1]]]);\n\t\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\t\tcloseWindow();\n\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\t\twinDown?.([m]);\n\t\t\t\t\twinDown = undefined;\n\t\t\t\t\ta.down([m]);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\tconst notUnsub = notifier.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\tcloseWindow();\n\t\t\t\t\topenWindow();\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\treturn () => {\n\t\t\tsrcUnsub();\n\t\t\tnotUnsub();\n\t\t\tcloseWindow();\n\t\t};\n\t}, operatorOpts(opts));\n}\n\n/**\n * Increments on each tick (`interval`); uses `setInterval` via {@link producer}.\n *\n * @param periodMs - Time between ticks.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<number>` - Emits `0`, `1`, `2`, … while subscribed.\n * @example\n * ```ts\n * import { interval } from \"@graphrefly/graphrefly-ts\";\n *\n * interval(1_000);\n * ```\n *\n * @category extra\n */\nexport function interval(periodMs: number, opts?: ExtraOpts): Node<number> {\n\treturn producer<number>((a, ctx) => {\n\t\tif (!(\"n\" in ctx.store)) ctx.store.n = 0;\n\t\tconst id = setInterval(() => {\n\t\t\ta.emit(ctx.store.n as number);\n\t\t\tctx.store.n = (ctx.store.n as number) + 1;\n\t\t}, periodMs);\n\t\treturn () => clearInterval(id);\n\t}, operatorOpts(opts));\n}\n\n/**\n * Subscribes to `source` repeatedly (`count` times, sequentially). Best with a fresh or `resubscribable` source.\n *\n * @param source - Upstream node to replay.\n * @param count - Number of subscription rounds.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Forwards each round then completes after the last inner `COMPLETE`.\n * @example\n * ```ts\n * import { repeat, state } from \"@graphrefly/graphrefly-ts\";\n *\n * repeat(state(1, { resubscribable: true }), 2);\n * ```\n *\n * @category extra\n */\nexport function repeat<T>(source: Node<T>, count: number, opts?: ExtraOpts): Node<T> {\n\tif (count <= 0) throw new RangeError(\"repeat expects count > 0\");\n\treturn producer<T>((a) => {\n\t\tlet remaining = count;\n\t\tlet innerU: (() => void) | undefined;\n\n\t\tconst start = (): void => {\n\t\t\tinnerU?.();\n\t\t\tinnerU = source.subscribe((msgs) => {\n\t\t\t\tlet completed = false;\n\t\t\t\tconst fwd: Message[] = [];\n\t\t\t\tfor (const m of msgs) {\n\t\t\t\t\tif (m[0] === COMPLETE) completed = true;\n\t\t\t\t\telse fwd.push(m);\n\t\t\t\t}\n\t\t\t\tif (fwd.length > 0) a.down(fwd as unknown as Messages);\n\t\t\t\tif (completed) {\n\t\t\t\t\tinnerU?.();\n\t\t\t\t\tinnerU = undefined;\n\t\t\t\t\tremaining -= 1;\n\t\t\t\t\tif (remaining > 0) start();\n\t\t\t\t\telse a.down([[COMPLETE]]);\n\t\t\t\t}\n\t\t\t});\n\t\t};\n\n\t\tstart();\n\t\treturn () => {\n\t\t\tinnerU?.();\n\t\t};\n\t}, operatorOpts(opts));\n}\n\n/**\n * Identity passthrough — `pausable()` has been promoted to default node behavior in v5 (§4).\n *\n * @deprecated Default node behavior now handles PAUSE/RESUME. This operator is a no-op\n * identity passthrough kept only for migration compatibility.\n *\n * @param source - Upstream node.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Pass-through (identity).\n * @example\n * ```ts\n * import { pausable, state } from \"@graphrefly/graphrefly-ts\";\n *\n * // No longer needed — default nodes handle PAUSE/RESUME.\n * const s = state(0);\n * pausable(s); // identity passthrough\n * ```\n *\n * @category extra\n */\nexport function pausable<T>(source: Node<T>, opts?: ExtraOpts): Node<T> {\n\treturn node<T>(\n\t\t[source as Node],\n\t\t(data, a) => {\n\t\t\tconst batch0 = data[0];\n\t\t\tif (batch0 == null || batch0.length === 0) {\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfor (const v of batch0) a.emit(v as T);\n\t\t},\n\t\toperatorOpts<T>(opts),\n\t);\n}\n\n/**\n * Replaces an upstream `ERROR` with a recovered value (`catchError`-style).\n *\n * @param source - Upstream node.\n * @param recover - Maps the error payload to a replacement value; if it throws, `ERROR` is forwarded.\n * @param opts - Optional {@link NodeOptions} (excluding `describeKind`).\n * @returns `Node<T>` - Recovered stream.\n * @example\n * ```ts\n * import { rescue, state } from \"@graphrefly/graphrefly-ts\";\n *\n * rescue(state(0), () => 0);\n * ```\n *\n * @category extra\n */\nexport function rescue<T>(\n\tsource: Node<T>,\n\trecover: (err: unknown) => T,\n\topts?: ExtraOpts,\n): Node<T> {\n\treturn producer<T>((a) => {\n\t\tconst srcUnsub = source.subscribe((msgs) => {\n\t\t\tfor (const m of msgs) {\n\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\ta.emit(m[1] as T);\n\t\t\t\t} else if (m[0] === ERROR) {\n\t\t\t\t\ttry {\n\t\t\t\t\t\ta.emit(recover(m[1]));\n\t\t\t\t\t} catch (recoverErr) {\n\t\t\t\t\t\ta.down([[ERROR, recoverErr]]);\n\t\t\t\t\t}\n\t\t\t\t} else if (m[0] === COMPLETE) {\n\t\t\t\t\ta.down([[COMPLETE]]);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\treturn () => {\n\t\t\tsrcUnsub();\n\t\t};\n\t}, operatorOpts(opts));\n}\n\n/**\n * Forwards upstream `DATA` only while `control.get()` is truthy; when closed, emits `RESOLVED`\n * instead of repeating the last value (value-level valve). For protocol pause/resume, use default\n * node PAUSE/RESUME behavior.\n *\n * @param source - Upstream value node.\n * @param control - Boolean node; when falsy, output stays \"closed\" for that tick.\n * @param opts - Optional node options (excluding `describeKind`).\n * @returns `Node<T>` gated by `control`.\n *\n * @example\n * ```ts\n * import { valve, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const data = state(1);\n * const open = state(true);\n * valve(data, open);\n * ```\n *\n * @category extra\n */\nexport function valve<T>(source: Node<T>, control: Node<boolean>, opts?: ExtraOpts): Node<T> {\n\treturn node<T>(\n\t\t[source as Node, control as Node],\n\t\t(data, a, ctx) => {\n\t\t\tconst batch1 = data[1];\n\t\t\t// undefined = control never sent DATA (gate closed); falsy = explicitly closed.\n\t\t\tconst controlValue = batch1 != null && batch1.length > 0 ? batch1.at(-1) : ctx.prevData[1];\n\t\t\tif (!controlValue) {\n\t\t\t\ta.down([[RESOLVED]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst batch0 = data[0];\n\t\t\tif (batch0 != null && batch0.length > 0) {\n\t\t\t\t// Source data this wave: forward it.\n\t\t\t\tfor (const v of batch0) a.emit(v as T);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Control just opened this wave but source didn't fire this wave.\n\t\t\t// Re-emit the last known source value so downstream sees the current\n\t\t\t// value when the gate opens (only when source has a prior value).\n\t\t\tif (batch1 != null && batch1.length > 0 && ctx.prevData[0] !== undefined) {\n\t\t\t\ta.emit(ctx.prevData[0] as T);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\ta.down([[RESOLVED]]);\n\t\t},\n\t\toperatorOpts(opts),\n\t);\n}\n\n// ——————————————————————————————————————————————————————————————\n//  RxJS-compatible aliases — improve AI code-generation accuracy\n// ——————————————————————————————————————————————————————————————\n\n/**\n * RxJS-named alias for {@link combine} — emits when any dep updates with latest tuple of values.\n *\n * @param sources - Upstream nodes as separate arguments (same calling shape as `combine`).\n * @returns Combined node; signature matches `combine`.\n *\n * @example\n * ```ts\n * import { combineLatest, state } from \"@graphrefly/graphrefly-ts\";\n *\n * const n = combineLatest(state(1), state(\"a\"));\n * ```\n *\n * @category extra\n */\nexport const combineLatest = combine;\n\n/**\n * RxJS-named alias for {@link debounce} — drops rapid `DATA` until `ms` of quiet.\n *\n * @param source - Upstream node.\n * @param ms - Quiet period in milliseconds.\n * @param opts - Optional node options (excluding `describeKind`).\n * @returns Debounced node; behavior matches `debounce`.\n *\n * @example\n * ```ts\n * import { debounceTime, state } from \"@graphrefly/graphrefly-ts\";\n *\n * debounceTime(state(0), 100);\n * ```\n *\n * @category extra\n */\nexport const debounceTime = debounce;\n\n/**\n * RxJS-named alias for {@link throttle} — emits on leading/trailing edges within `ms`.\n *\n * @param source - Upstream node.\n * @param ms - Minimum spacing in milliseconds.\n * @param opts - Optional throttle shape (`leading` / `trailing`) and node options.\n * @returns Throttled node; behavior matches `throttle`.\n *\n * @example\n * ```ts\n * import { throttleTime, state } from \"@graphrefly/graphrefly-ts\";\n *\n * throttleTime(state(0), 100);\n * ```\n *\n * @category extra\n */\nexport const throttleTime = throttle;\n\n/**\n * RxJS-named alias for {@link rescue} — replaces upstream `ERROR` with a recovered value.\n *\n * @param source - Upstream node.\n * @param recover - Maps error payload to replacement value.\n * @param opts - Optional node options (excluding `describeKind`).\n * @returns Recovered stream; behavior matches `rescue`.\n *\n * @example\n * ```ts\n * import { catchError, state } from \"@graphrefly/graphrefly-ts\";\n *\n * catchError(state(0), () => 0);\n * ```\n *\n * @category extra\n */\nexport const catchError = rescue;\n","/**\n * Composite data patterns (roadmap §3.2b).\n *\n * These helpers compose existing primitives (`node`, `switchMap`, `reactiveMap`,\n * `dynamicNode`, `fromAny`) without introducing new protocol semantics.\n */\n\nimport { batch } from \"../core/batch.js\";\nimport { DATA } from \"../core/messages.js\";\nimport type { Node, NodeOptions } from \"../core/node.js\";\nimport { derived, state } from \"../core/sugar.js\";\nimport { merge, switchMap } from \"./operators.js\";\nimport { type ReactiveMapBundle, type ReactiveMapOptions, reactiveMap } from \"./reactive-map.js\";\nimport { forEach, fromAny, type NodeInput } from \"./sources.js\";\n\nfunction isNodeLike<T>(value: unknown): value is Node<T> {\n\treturn (\n\t\ttypeof value === \"object\" &&\n\t\tvalue !== null &&\n\t\t\"cache\" in (value as Node<T>) &&\n\t\ttypeof (value as Node<T>).subscribe === \"function\"\n\t);\n}\n\n/**\n * Verification payload shape is intentionally user-defined.\n */\nexport type VerifyValue = unknown;\n\nexport type VerifiableOptions<TVerify = VerifyValue> = Omit<\n\tNodeOptions,\n\t\"describeKind\" | \"initial\"\n> & {\n\t/** Reactive re-verification trigger. */\n\ttrigger?: NodeInput<unknown>;\n\t/** Re-run verification whenever `source` settles. */\n\tautoVerify?: boolean;\n\t/** Initial verification companion value. */\n\tinitialVerified?: TVerify | null;\n};\n\nexport type VerifiableBundle<T, TVerify = VerifyValue> = {\n\t/** Coerced source node. */\n\tnode: Node<T>;\n\t/** Latest verification result (`null` before first verification). */\n\tverified: Node<TVerify | null>;\n\t/** Effective trigger node used for verification, if any. */\n\ttrigger: Node<unknown> | null;\n};\n\n/**\n * Composes a value node with a reactive verification companion.\n *\n * Uses `switchMap` so newer triggers cancel stale in-flight verification work.\n */\nexport function verifiable<T, TVerify = VerifyValue>(\n\tsource: NodeInput<T>,\n\tverifyFn: (value: T) => NodeInput<TVerify>,\n\topts?: VerifiableOptions<TVerify>,\n): VerifiableBundle<T, TVerify> {\n\tconst sourceNode = fromAny(source);\n\tconst hasSourceVersioning = sourceNode.v != null;\n\tconst verified = state<TVerify | null>(opts?.initialVerified ?? null, {\n\t\t...(hasSourceVersioning ? { meta: { sourceVersion: null } } : {}),\n\t});\n\tconst hasTrigger = opts?.trigger !== undefined && opts.trigger !== null;\n\n\tlet triggerNode: Node<unknown> | null = null;\n\tif (hasTrigger && opts?.autoVerify) {\n\t\ttriggerNode = merge(fromAny(opts.trigger) as Node<unknown>, sourceNode as Node<unknown>);\n\t} else if (hasTrigger) {\n\t\ttriggerNode = fromAny(opts.trigger);\n\t} else if (opts?.autoVerify) {\n\t\ttriggerNode = sourceNode as Node<unknown>;\n\t}\n\n\tif (triggerNode !== null) {\n\t\t// Closes P3 audit #2. Two patterns used depending on trigger shape:\n\t\t//  - autoVerify-only (triggerNode === sourceNode): the projected\n\t\t//    switchMap value IS the source DATA, pass it directly.\n\t\t//  - explicit trigger: capture the source value into a closure\n\t\t//    (`latestSource`) seeded from `sourceNode.cache` at wiring time\n\t\t//    (§3.6 boundary read) and kept current via a subscribe handler.\n\t\t//    The switchMap fn reads the closure, never `sourceNode.cache`\n\t\t//    from a reactive context.\n\t\tlet verifyStream: Node<TVerify>;\n\t\tif (triggerNode === (sourceNode as Node<unknown>)) {\n\t\t\tverifyStream = switchMap(sourceNode, (src) => verifyFn(src as T));\n\t\t} else {\n\t\t\tlet latestSource: T | undefined = sourceNode.cache as T | undefined;\n\t\t\tsourceNode.subscribe((msgs) => {\n\t\t\t\tfor (const m of msgs) {\n\t\t\t\t\tif (m[0] === DATA) latestSource = m[1] as T;\n\t\t\t\t}\n\t\t\t});\n\t\t\tverifyStream = switchMap(triggerNode, () => verifyFn(latestSource as T));\n\t\t}\n\t\tforEach(verifyStream, (value) => {\n\t\t\tbatch(() => {\n\t\t\t\tverified.down([[DATA, value]]);\n\t\t\t\t// V0 backfill: stamp which source version was verified (§6.0b).\n\t\t\t\tif (hasSourceVersioning) {\n\t\t\t\t\tconst sv = sourceNode.v;\n\t\t\t\t\tif (sv != null) {\n\t\t\t\t\t\tverified.meta.sourceVersion.down([[DATA, { id: sv.id, version: sv.version }]]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\t});\n\t}\n\n\treturn { node: sourceNode, verified, trigger: triggerNode };\n}\n\nexport type Extraction<TMem> = {\n\tupsert: Array<{ key: string; value: TMem }>;\n\tremove?: string[];\n};\n\nexport type DistillOptions<TMem> = {\n\tscore: (mem: TMem, context: unknown) => number;\n\tcost: (mem: TMem) => number;\n\tbudget?: number;\n\tevict?: (key: string, mem: TMem) => boolean | Node<boolean>;\n\tconsolidate?: (entries: ReadonlyMap<string, TMem>) => NodeInput<Extraction<TMem>>;\n\tconsolidateTrigger?: NodeInput<unknown>;\n\tcontext?: NodeInput<unknown>;\n\tmapOptions?: ReactiveMapOptions<string, TMem>;\n};\n\nexport type DistillBundle<TMem> = {\n\tstore: ReactiveMapBundle<string, TMem>;\n\tcompact: Node<Array<{ key: string; value: TMem; score: number }>>;\n\tsize: Node<number>;\n};\n\nfunction keepalive(node: Node): void {\n\tnode.subscribe(() => undefined);\n}\n\nfunction mapFromSnapshot<TMem>(snapshot: unknown): ReadonlyMap<string, TMem> {\n\tif (snapshot instanceof Map) return snapshot as ReadonlyMap<string, TMem>;\n\treturn new Map<string, TMem>();\n}\n\nfunction applyExtraction<TMem>(\n\tstore: ReactiveMapBundle<string, TMem>,\n\textraction: Extraction<TMem>,\n): void {\n\tif (!Array.isArray(extraction.upsert)) {\n\t\tthrow new TypeError(\"distill extraction requires upsert: Array<{ key, value }>\");\n\t}\n\tbatch(() => {\n\t\tfor (const { key, value } of extraction.upsert) {\n\t\t\tstore.set(key, value);\n\t\t}\n\t\tfor (const key of extraction.remove ?? []) {\n\t\t\tstore.delete(key);\n\t\t}\n\t});\n}\n\n/**\n * Budget-constrained reactive memory composition.\n */\nexport function distill<TRaw, TMem>(\n\tsource: NodeInput<TRaw>,\n\textractFn: (raw: TRaw, existing: ReadonlyMap<string, TMem>) => NodeInput<Extraction<TMem>>,\n\topts: DistillOptions<TMem>,\n): DistillBundle<TMem> {\n\tconst sourceNode = fromAny(source);\n\tconst store = reactiveMap<string, TMem>(opts.mapOptions ?? {});\n\tconst budget = opts.budget ?? 2000;\n\tconst hasContext = opts.context !== undefined && opts.context !== null;\n\tconst contextNode = hasContext ? fromAny(opts.context) : state<unknown>(null);\n\n\t// Closes P3 audit #7. `latestStore` is seeded at wiring time (§3.6\n\t// boundary read) and kept current via a subscribe handler. `extractFn`\n\t// and `consolidate` read the closure, never `store.entries.cache` from\n\t// inside a reactive callback. `withLatestFrom` would swallow the initial\n\t// source emission because primary's push-on-subscribe fires before\n\t// secondary subscribes — same reason stratify/budgetGate use this pattern.\n\tlet latestStore: ReadonlyMap<string, TMem> = mapFromSnapshot<TMem>(store.entries.cache);\n\tstore.entries.subscribe((msgs) => {\n\t\tfor (const m of msgs) {\n\t\t\tif (m[0] === DATA) latestStore = mapFromSnapshot<TMem>(m[1]);\n\t\t}\n\t});\n\n\tconst extractionStream = switchMap(sourceNode, (raw) => extractFn(raw as TRaw, latestStore));\n\tforEach(extractionStream, (extraction) => {\n\t\tapplyExtraction(store, extraction);\n\t});\n\n\tif (opts.evict) {\n\t\t// Track active verdict-node subscriptions so we can react to Node<boolean> changes.\n\t\tconst verdictUnsubs = new Map<string, () => void>();\n\n\t\tconst evictionKeys = derived([store.entries], ([snapshot]) => {\n\t\t\tconst out: string[] = [];\n\t\t\tconst entries = mapFromSnapshot<TMem>(snapshot);\n\t\t\t// Clean up verdict subscriptions for removed keys.\n\t\t\tfor (const key of verdictUnsubs.keys()) {\n\t\t\t\tif (!entries.has(key)) {\n\t\t\t\t\tverdictUnsubs.get(key)!();\n\t\t\t\t\tverdictUnsubs.delete(key);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (const [key, mem] of entries) {\n\t\t\t\tconst verdict = opts.evict!(key, mem);\n\t\t\t\tif (isNodeLike<boolean>(verdict)) {\n\t\t\t\t\t// Subscribe if not already — push-on-subscribe fires with\n\t\t\t\t\t// the verdict's current value on first subscribe, so an\n\t\t\t\t\t// already-true verdict deletes via the callback without\n\t\t\t\t\t// needing a `verdict.cache` read (closes P3 audit #3).\n\t\t\t\t\t// Future transitions to `true` flow through the same path.\n\t\t\t\t\tif (!verdictUnsubs.has(key)) {\n\t\t\t\t\t\tconst unsub = forEach(verdict, (val) => {\n\t\t\t\t\t\t\tif (val === true && store.has(key)) {\n\t\t\t\t\t\t\t\tstore.delete(key);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t});\n\t\t\t\t\t\tverdictUnsubs.set(key, unsub);\n\t\t\t\t\t}\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (typeof verdict === \"boolean\") {\n\t\t\t\t\tif (verdict) out.push(key);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tthrow new TypeError(\"distill evict() must return boolean or Node<boolean>\");\n\t\t\t}\n\t\t\treturn out;\n\t\t});\n\t\tforEach(evictionKeys, (keys) => {\n\t\t\tfor (const key of keys) store.delete(key);\n\t\t});\n\t}\n\n\tconst hasConsolidateTrigger =\n\t\topts.consolidateTrigger !== undefined && opts.consolidateTrigger !== null;\n\tif (opts.consolidate && hasConsolidateTrigger) {\n\t\tconst consolidateTriggerNode = fromAny(opts.consolidateTrigger);\n\t\tconst consolidationStream = switchMap(consolidateTriggerNode, () =>\n\t\t\topts.consolidate!(latestStore),\n\t\t);\n\t\tforEach(consolidationStream, (extraction) => {\n\t\t\tapplyExtraction(store, extraction);\n\t\t});\n\t}\n\n\tconst compact = derived([store.entries, contextNode], ([snapshot, context]) => {\n\t\tconst entries = [...mapFromSnapshot<TMem>(snapshot).entries()].map(([key, value]) => ({\n\t\t\tkey,\n\t\t\tvalue,\n\t\t\tscore: opts.score(value, context),\n\t\t\tcost: opts.cost(value),\n\t\t}));\n\t\tentries.sort((a, b) => b.score - a.score);\n\n\t\tconst packed: Array<{ key: string; value: TMem; score: number }> = [];\n\t\tlet remaining = budget;\n\t\tfor (const item of entries) {\n\t\t\tif (item.cost <= remaining) {\n\t\t\t\tpacked.push({ key: item.key, value: item.value, score: item.score });\n\t\t\t\tremaining -= item.cost;\n\t\t\t}\n\t\t}\n\t\treturn packed;\n\t});\n\n\tconst size = derived([store.entries], ([snapshot]) => mapFromSnapshot<TMem>(snapshot).size);\n\tkeepalive(compact);\n\tkeepalive(size);\n\n\treturn { store, compact, size };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAOO,IAAM,YAAY;AAClB,IAAM,aAAa;AAkB1B,SAAS,iBAAiB,OAAuB;AAChD,SAAO,QAAQ,IAAI,IAAI;AACxB;AAEA,SAAS,YAAYA,QAAe,QAA4B;AAC/D,MAAI,WAAW,OAAQ,QAAOA;AAC9B,MAAI,WAAW,OAAQ,QAAO,KAAK,OAAO,IAAIA;AAC9C,SAAOA,SAAQ,IAAI,KAAK,OAAO,KAAKA,SAAQ;AAC7C;AAEA,SAAS,cAAc,KAAa,KAAqB;AACxD,SAAO,MAAM,KAAK,OAAO,KAAK,MAAM;AACrC;AAiBO,SAAS,SAAS,SAAkC;AAC1D,QAAM,OAAO,iBAAiB,OAAO;AACrC,SAAO,MAAM;AACd;AAmBO,SAAS,OAAO,QAAgB,QAAkC;AACxE,QAAM,WAAW,iBAAiB,MAAM;AACxC,QAAM,WAAW,WAAW,SAAY,WAAW,iBAAiB,MAAM;AAC1E,SAAO,CAAC,YAAoB,WAAW,WAAW,KAAK,IAAI,GAAG,OAAO;AACtE;AA+BO,SAAS,YAAY,SAAsD;AACjF,QAAM,SAAS,iBAAiB,SAAS,UAAU,MAAM,SAAS;AAClE,QAAM,SAAS,SAAS,WAAW,UAAa,QAAQ,SAAS,IAAI,IAAK,SAAS,UAAU;AAC7F,QAAM,aAAa,iBAAiB,SAAS,cAAc,KAAK,UAAU;AAC1E,QAAM,SAAS,SAAS,UAAU;AAElC,SAAO,CAAC,YAAoB;AAC3B,QAAIA;AACJ,QAAI,WAAW,GAAG;AACjB,MAAAA,SAAQ;AAAA,IACT,WAAW,WAAW,GAAG;AACxB,MAAAA,SAAQ;AAAA,IACT,OAAO;AACN,YAAM,WAAW,aAAa;AAC9B,UAAI,SAAS;AACb,eAAS,IAAI,GAAG,IAAI,KAAK,IAAI,GAAG,OAAO,GAAG,KAAK;AAC9C,YAAI,UAAU,UAAU;AACvB,mBAAS;AACT;AAAA,QACD;AACA,kBAAU;AAAA,MACX;AACA,MAAAA,SAAQ,SAAS;AACjB,UAAIA,SAAQ,WAAY,CAAAA,SAAQ;AAAA,IACjC;AACA,WAAO,YAAYA,QAAO,MAAM;AAAA,EACjC;AACD;AAmBO,SAAS,UAAU,SAAS,MAAM,WAAW,aAAa,KAAK,YAA6B;AAClG,QAAM,WAAW,iBAAiB,MAAM;AACxC,QAAM,UAAU,iBAAiB,UAAU;AAE3C,WAAS,QAAQ,SAAyB;AACzC,QAAI,WAAW,EAAG,QAAO;AACzB,QAAI,OAAO;AACX,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AACjC,YAAM,OAAO,OAAO;AACpB,aAAO;AACP,YAAM;AAAA,IACP;AACA,WAAO;AAAA,EACR;AAEA,SAAO,CAAC,YAAoB;AAC3B,UAAM,MAAM,QAAQ,OAAO,IAAI;AAC/B,WAAO,OAAO,UAAU,MAAM;AAAA,EAC/B;AACD;AAwBO,SAAS,mBACf,SAAS,MAAM,WACf,QAAQ,KAAK,YACK;AAClB,SAAO,CAAC,UAAU,QAAQ,gBAAgB;AACzC,UAAMC,QAAO,eAAe;AAC5B,UAAM,UAAU,KAAK,IAAI,OAAOA,QAAO,CAAC;AACxC,WAAO,cAAc,QAAQ,OAAO;AAAA,EACrC;AACD;AAmBO,SAAS,gBAAgB,UAA2B,aAAsC;AAChG,SAAO,CAAC,SAAS,OAAO,gBAAgB;AACvC,QAAI,WAAW,YAAa,QAAO;AACnC,WAAO,SAAS,SAAS,OAAO,WAAW;AAAA,EAC5C;AACD;AAmBO,SAAS,qBAAqB,MAAsC;AAC1E,MAAI,SAAS,WAAY,QAAO,SAAS,IAAI,UAAU;AACvD,MAAI,SAAS,SAAU,QAAO,OAAO,IAAI,UAAU;AACnD,MAAI,SAAS,cAAe,QAAO,YAAY;AAC/C,MAAI,SAAS,YAAa,QAAO,UAAU;AAC3C,MAAI,SAAS,qBAAsB,QAAO,mBAAmB;AAC7D,QAAM,IAAI;AAAA,IACT,4BAA4B,OAAO,IAAI,CAAC;AAAA,EACzC;AACD;;;AC1OA,SAAS,aAA0B,MAAkC;AACpE,SAAO,EAAE,cAAc,WAAW,GAAG,KAAK;AAC3C;AAmBO,SAAS,IAAU,QAAiB,SAA0B,MAA2B;AAC/F,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,MAAM;AACZ,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,QAAQ,OAAO,WAAW,GAAG;AAC1C,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AACA,iBAAW,KAAK,QAAQ;AACvB,UAAE,KAAK,QAAQ,CAAM,CAAC;AAAA,MACvB;AAAA,IACD;AAAA,IACA,aAAgB,IAAI;AAAA,EACrB;AACD;AAmBO,SAAS,OACf,QACA,WACA,MACU;AACV,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,MAAM;AACZ,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,QAAQ,OAAO,WAAW,GAAG;AAC1C,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AACA,UAAI,UAAU;AACd,iBAAW,KAAK,QAAQ;AACvB,YAAI,UAAU,CAAM,GAAG;AACtB,YAAE,KAAK,CAAM;AACb,oBAAU;AAAA,QACX;AAAA,MACD;AACA,UAAI,CAAC,QAAS,GAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,IAClC;AAAA,IACA,aAAa,IAAI;AAAA,EAClB;AACD;AAuBO,SAAS,KACf,QACA,SACA,MACA,MACU;AACV,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,GAAG,QAAQ;AACjB,UAAI,EAAE,SAAS,IAAI,OAAQ,KAAI,MAAM,MAAM;AAC3C,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,QAAQ,OAAO,WAAW,GAAG;AAC1C,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AACA,iBAAW,KAAK,QAAQ;AACvB,YAAI,MAAM,MAAM,QAAQ,IAAI,MAAM,KAAU,CAAM;AAClD,UAAE,KAAK,IAAI,MAAM,GAAQ;AAAA,MAC1B;AAAA,IACD;AAAA,IACA,EAAE,GAAG,aAAa,IAAI,GAAG,SAAS,MAAM,iBAAiB,KAAK;AAAA,EAC/D;AACD;AAuBO,SAAS,OACf,QACA,SACA,MACA,MACU;AACV,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,GAAG,QAAQ;AACjB,UAAI,EAAE,SAAS,IAAI,OAAQ,KAAI,MAAM,MAAM;AAG3C,UAAI,IAAI,aAAa,CAAC,MAAM,MAAM;AACjC,UAAE,KAAK,IAAI,MAAM,GAAQ;AACzB,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AACA,YAAM,SAAS,KAAK,CAAC;AAGrB,UAAI,UAAU,QAAQ,OAAO,WAAW,GAAG;AAC1C,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AAEA,iBAAW,KAAK,QAAQ;AACvB,YAAI,MAAM,MAAM,QAAQ,IAAI,MAAM,KAAU,CAAM;AAAA,MACnD;AAAA,IACD;AAAA,IACA;AAAA,MACC,GAAG,aAAa,IAAI;AAAA,MACpB,0BAA0B;AAAA,IAC3B;AAAA,EACD;AACD;AAmBO,SAAS,KAAQ,QAAiB,OAAe,MAA2B;AAClF,MAAI,SAAS,GAAG;AACf,WAAO;AAAA,MACN,CAAC,MAAc;AAAA,MACf,CAAC,IAAI,GAAG,QAAQ;AACf,YAAI,IAAI,MAAM,UAAW;AACzB,YAAI,MAAM,YAAY;AACtB,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,MACpB;AAAA,MACA;AAAA,QACC,GAAG,aAAa,IAAI;AAAA,QACpB,0BAA0B;AAAA,MAC3B;AAAA,IACD;AAAA,EACD;AACA,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,GAAG,QAAQ;AACjB,UAAI,EAAE,WAAW,IAAI,OAAQ,KAAI,MAAM,QAAQ;AAC/C,UAAI,IAAI,MAAM,MAAM;AACnB,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AAEA,UAAI,IAAI,aAAa,CAAC,MAAM,MAAM;AACjC,YAAI,MAAM,OAAO;AACjB,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AACA,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,QAAQ,OAAO,WAAW,GAAG;AAC1C,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AAEA,iBAAW,KAAK,QAAQ;AACvB,QAAC,IAAI,MAAM;AACX,UAAE,KAAK,CAAM;AACb,YAAK,IAAI,MAAM,SAAoB,OAAO;AACzC,cAAI,MAAM,OAAO;AACjB,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,QACD;AAAA,MACD;AAAA,IACD;AAAA,IACA;AAAA,MACC,GAAG,aAAa,IAAI;AAAA,MACpB,0BAA0B;AAAA,IAC3B;AAAA,EACD;AACD;AAmBO,SAAS,KAAQ,QAAiB,OAAe,MAA2B;AAClF,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,GAAG,QAAQ;AACjB,UAAI,EAAE,aAAa,IAAI,OAAQ,KAAI,MAAM,UAAU;AACnD,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,QAAQ,OAAO,WAAW,GAAG;AAE1C,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AACA,UAAI,UAAU;AACd,iBAAW,KAAK,QAAQ;AACvB,QAAC,IAAI,MAAM;AACX,YAAK,IAAI,MAAM,WAAsB,OAAO;AAAA,QAE5C,OAAO;AACN,YAAE,KAAK,CAAM;AACb,oBAAU;AAAA,QACX;AAAA,MACD;AACA,UAAI,CAAC,QAAS,GAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,IAClC;AAAA,IACA,aAAa,IAAI;AAAA,EAClB;AACD;AAmBO,SAAS,UACf,QACA,WACA,MACU;AACV,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,GAAG,QAAQ;AACjB,UAAI,IAAI,MAAM,MAAM;AACnB,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AACA,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,QAAQ,OAAO,WAAW,GAAG;AAC1C,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AACA,iBAAW,KAAK,QAAQ;AACvB,YAAI,CAAC,UAAU,CAAM,GAAG;AACvB,cAAI,MAAM,OAAO;AACjB,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,QACD;AACA,UAAE,KAAK,CAAM;AAAA,MACd;AAAA,IACD;AAAA,IACA;AAAA,MACC,GAAG,aAAa,IAAI;AAAA,MACpB,0BAA0B;AAAA,IAC3B;AAAA,EACD;AACD;AAqBO,SAAS,UACf,QACA,UACA,MACU;AACV,QAAM,OAAO,MAAM,cAAc,CAAC,MAAe,EAAE,CAAC,MAAM;AAC1D,QAAM,EAAE,WAAW,GAAG,GAAG,SAAS,IAAI,QAAQ,CAAC;AAE/C,SAAO;AAAA,IACN,CAAC,MAAM;AACN,UAAI,UAAU;AACd,YAAM,WAAW,OAAO,UAAU,CAAC,SAAS;AAC3C,YAAI,QAAS;AACb,mBAAW,KAAK,MAAM;AACrB,cAAI,QAAS;AACb,cAAI,EAAE,CAAC,MAAM,KAAM,GAAE,KAAK,EAAE,CAAC,CAAM;AAAA,mBAC1B,EAAE,CAAC,MAAM,YAAY,EAAE,CAAC,MAAM,OAAO;AAC7C,sBAAU;AACV,cAAE,KAAK,CAAC,CAAC,CAAC;AAAA,UACX;AAAA,QACD;AAAA,MACD,CAAC;AACD,YAAM,WAAW,SAAS,UAAU,CAAC,SAAS;AAC7C,YAAI,QAAS;AACb,mBAAW,KAAK,MAAM;AACrB,cAAI,QAAS;AACb,cAAI,KAAK,CAAC,GAAG;AACZ,sBAAU;AACV,cAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,UACD;AAAA,QACD;AAAA,MACD,CAAC;AACD,aAAO,MAAM;AACZ,iBAAS;AACT,iBAAS;AAAA,MACV;AAAA,IACD;AAAA,IACA,aAAa,QAAqB;AAAA,EACnC;AACD;AAkBO,SAAS,MAAS,QAAiB,MAA2B;AACpE,SAAO,KAAK,QAAQ,GAAG,IAAI;AAC5B;AAkBO,SAAS,KAAQ,QAAiB,SAAqD;AAC7F,QAAM,EAAE,cAAc,GAAG,KAAK,IAAI,WAAW,CAAC;AAC9C,QAAM,aAAa,WAAW,QAAQ,OAAO,OAAO,SAAS,cAAc;AAC3E,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,GAAG,QAAQ;AAGjB,UAAI,IAAI,aAAa,CAAC,MAAM,MAAM;AACjC,YAAI,IAAI,MAAM,KAAK;AAClB,YAAE,KAAK,IAAI,MAAM,MAAW;AAAA,QAC7B,WAAW,YAAY;AACtB,YAAE,KAAK,YAAiB;AAAA,QACzB;AACA,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AACA,YAAM,SAAS,KAAK,CAAC;AAGrB,UAAI,UAAU,QAAQ,OAAO,WAAW,GAAG;AAC1C,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AAEA,UAAI,MAAM,SAAS,OAAO,GAAG,EAAE;AAC/B,UAAI,MAAM,MAAM;AAAA,IACjB;AAAA,IACA;AAAA,MACC,GAAG,aAAa,IAAI;AAAA,MACpB,0BAA0B;AAAA,IAC3B;AAAA,EACD;AACD;AAmBO,SAAS,KACf,QACA,WACA,MACU;AACV,SAAO,KAAK,OAAO,QAAQ,WAAW,IAAI,GAAG,GAAG,IAAI;AACrD;AAmBO,SAAS,UAAa,QAAiB,OAAe,MAA2B;AACvF,SAAO,KAAK,KAAK,QAAQ,OAAO,IAAI,GAAG,GAAG,IAAI;AAC/C;AAmCO,SAAS,IACf,QACA,cACA,MACU;AACV,MAAI,OAAO,iBAAiB,YAAY;AACvC,WAAO;AAAA,MACN,CAAC,MAAc;AAAA,MACf,CAAC,MAAM,MAAM;AACZ,cAAM,SAAS,KAAK,CAAC;AACrB,YAAI,UAAU,QAAQ,OAAO,WAAW,GAAG;AAC1C,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,QACD;AACA,mBAAW,KAAK,QAAQ;AACvB,uBAAa,CAAM;AACnB,YAAE,KAAK,CAAM;AAAA,QACd;AAAA,MACD;AAAA,MACA,aAAa,IAAI;AAAA,IAClB;AAAA,EACD;AACA,QAAM,MAAM;AACZ,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,GAAG,QAAQ;AAEjB,UAAI,IAAI,aAAa,CAAC,MAAM,QAAW;AACtC,YAAI,IAAI,aAAa,CAAC,MAAM,MAAM;AACjC,cAAI,WAAW;AACf,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,QACpB,OAAO;AACN,cAAI,QAAQ,IAAI,aAAa,CAAC,CAAC;AAC/B,YAAE,KAAK,CAAC,CAAC,OAAO,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC;AAAA,QACtC;AACA;AAAA,MACD;AACA,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,QAAQ,OAAO,WAAW,GAAG;AAC1C,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AACA,iBAAW,KAAK,QAAQ;AACvB,YAAI,OAAO,CAAM;AACjB,UAAE,KAAK,CAAM;AAAA,MACd;AAAA,IACD;AAAA,IACA;AAAA,MACC,GAAG,aAAa,IAAI;AAAA,MACpB,0BAA0B;AAAA,IAC3B;AAAA,EACD;AACD;AAmBO,SAAS,qBACf,QACA,SAAkC,OAAO,IACzC,MACU;AACV,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,GAAG,QAAQ;AACjB,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,QAAQ,OAAO,WAAW,GAAG;AAC1C,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AACA,UAAI,UAAU;AACd,iBAAW,OAAO,QAAe;AAChC,YAAI,IAAI,MAAM,WAAW,OAAO,IAAI,MAAM,MAAW,GAAG,GAAG;AAAA,QAE3D,OAAO;AACN,cAAI,MAAM,OAAO;AACjB,cAAI,MAAM,UAAU;AACpB,YAAE,KAAK,GAAG;AACV,oBAAU;AAAA,QACX;AAAA,MACD;AACA,UAAI,CAAC,QAAS,GAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,IAClC;AAAA,IACA,aAAa,IAAI;AAAA,EAClB;AACD;AAkBO,SAAS,SAAY,QAAiB,MAAyC;AACrF,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,GAAG,QAAQ;AACjB,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,QAAQ,OAAO,WAAW,GAAG;AAC1C,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AACA,UAAI,UAAU;AACd,iBAAW,KAAK,QAAe;AAC9B,YAAI,CAAC,IAAI,MAAM,SAAS;AACvB,cAAI,MAAM,OAAO;AACjB,cAAI,MAAM,UAAU;AAAA,QAErB,OAAO;AACN,gBAAM,OAAO,CAAC,IAAI,MAAM,MAAW,CAAC;AACpC,cAAI,MAAM,OAAO;AACjB,YAAE,KAAK,IAAI;AACX,oBAAU;AAAA,QACX;AAAA,MACD;AACA,UAAI,CAAC,QAAS,GAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,IAClC;AAAA,IACA,aAAa,IAAI;AAAA,EAClB;AACD;AAqBO,SAAS,WACZ,SACO;AACV,QAAM,OAAO,CAAC,GAAG,OAAO;AACxB,SAAO,QAAQ,MAAM,CAAC,SAAS,MAAsB;AAAA,IACpD,GAAG,aAAgB;AAAA,IACnB,QAAQ,CAAC,GAAG,MAAM;AACjB,UAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,eAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AAClC,YAAI,CAAC,OAAO,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAG,QAAO;AAAA,MACpC;AACA,aAAO;AAAA,IACR;AAAA,EACD,CAAC;AACF;AAmBO,SAAS,eACf,SACA,WACA,MACwB;AAYxB,SAAO;AAAA,IACN,CAAC,SAAiB,SAAiB;AAAA,IACnC,CAAC,MAAM,GAAG,QAAQ;AACjB,YAAM,SAAS,KAAK,CAAC;AACrB,YAAM,SAAS,KAAK,CAAC;AAGrB,YAAM,eACL,UAAU,QAAQ,OAAO,SAAS,IAAI,OAAO,GAAG,EAAE,IAAI,IAAI,SAAS,CAAC;AAIrE,UAAI,UAAU,QAAQ,OAAO,SAAS,GAAG;AAGxC,YAAI,EAAE,UAAU,QAAQ,OAAO,SAAS,MAAM,IAAI,SAAS,CAAC,MAAM,QAAW;AAC5E,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,QACD;AACA,mBAAW,KAAK,QAAe;AAC9B,YAAE,KAAK,CAAC,GAAG,YAAY,CAAC;AAAA,QACzB;AAAA,MACD,OAAO;AAEN,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,MACpB;AAAA,IACD;AAAA,IACA,aAAa,IAAI;AAAA,EAClB;AACD;AAoBO,SAAS,SAAY,SAAsC;AACjE,MAAI,QAAQ,WAAW,GAAG;AACzB,WAAO,SAAY,CAAC,MAAM;AACzB,QAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,IACpB,GAAG,aAAa,CAAC;AAAA,EAClB;AAIA,SAAO,SAAY,CAAC,MAAM;AACzB,UAAM,IAAI,QAAQ;AAClB,QAAI,YAAY;AAChB,UAAM,SAAyB,CAAC;AAChC,eAAW,OAAO,SAAS;AAC1B,YAAM,IAAI,IAAI,UAAU,CAAC,SAAS;AACjC,mBAAW,KAAK,MAAM;AACrB,cAAI,EAAE,CAAC,MAAM,MAAM;AAClB,cAAE,KAAK,EAAE,CAAC,CAAM;AAAA,UACjB,WAAW,EAAE,CAAC,MAAM,UAAU;AAC7B,yBAAa;AACb,gBAAI,aAAa,GAAG;AACnB,gBAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,YACpB;AAAA,UACD,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,cAAE,KAAK,CAAC,CAAC,CAAC;AAAA,UACX;AAAA,QAED;AAAA,MACD,CAAC;AACD,aAAO,KAAK,CAAC;AAAA,IACd;AACA,WAAO,MAAM;AACZ,iBAAW,KAAK,OAAQ,GAAE;AAAA,IAC3B;AAAA,EACD,GAAG,aAAa,CAAC;AAClB;AAiBO,SAAS,OACZ,SACO;AACV,QAAM,IAAI,QAAQ;AAClB,MAAI,MAAM,GAAG;AACZ,WAAO,SAAY,CAAC,MAAM;AACzB,QAAE,KAAK,CAAC,CAAiB;AACzB,QAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,IACpB,GAAG,aAAa,CAAC;AAAA,EAClB;AAEA,SAAO,SAAY,CAAC,MAAM;AACzB,UAAM,SAAsB,MAAM,KAAK,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC,CAAC;AAC9D,QAAI,SAAS;AAEb,aAAS,UAAgB;AACxB,aAAO,OAAO,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG;AACzC,cAAM,QAAQ,OAAO,IAAI,CAAC,MAAM,EAAE,MAAM,CAAE;AAC1C,UAAE,KAAK,KAAK;AAAA,MACb;AAAA,IACD;AAEA,UAAM,SAAyB,CAAC;AAChC,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,YAAM,MAAM;AACZ,YAAM,IAAK,QAAQ,CAAC,EAAW,UAAU,CAAC,SAAS;AAClD,mBAAW,KAAK,MAAM;AACrB,cAAI,EAAE,CAAC,MAAM,MAAM;AAClB,mBAAO,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;AACrB,oBAAQ;AAAA,UACT,WAAW,EAAE,CAAC,MAAM,UAAU;AAC7B,sBAAU;AACV,gBAAI,WAAW,KAAK,OAAO,GAAG,EAAE,WAAW,GAAG;AAC7C,gBAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,YACpB;AAAA,UACD,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,cAAE,KAAK,CAAC,CAAC,CAAC;AAAA,UACX;AAAA,QACD;AAAA,MACD,CAAC;AACD,aAAO,KAAK,CAAC;AAAA,IACd;AACA,WAAO,MAAM;AACZ,iBAAW,KAAK,OAAQ,GAAE;AAAA,IAC3B;AAAA,EACD,GAAG,aAAa,CAAC;AAClB;AAmBO,SAAS,OAAU,UAAmB,WAAoB,MAA2B;AAK3F,SAAO,SAAY,CAAC,MAAM;AACzB,QAAI,QAAe;AACnB,UAAM,UAAqB,CAAC;AAC5B,QAAI;AACJ,QAAI;AAEJ,kBAAc,UAAU,UAAU,CAAC,SAAS;AAC3C,iBAAW,KAAK,MAAM;AACrB,YAAI,UAAU,GAAG;AAChB,cAAI,EAAE,CAAC,MAAM,KAAM,SAAQ,KAAK,EAAE,CAAC,CAAC;AAAA,mBAC3B,EAAE,CAAC,MAAM,MAAO,GAAE,KAAK,CAAC,CAAC,CAAC;AAAA,QACpC,OAAO;AAEN,cAAI,EAAE,CAAC,MAAM,KAAM,GAAE,KAAK,EAAE,CAAC,CAAM;AAAA,mBAC1B,EAAE,CAAC,MAAM,YAAY,EAAE,CAAC,MAAM,MAAO,GAAE,KAAK,CAAC,CAAC,CAAC;AAAA,QACzD;AAAA,MACD;AAAA,IACD,CAAC;AAED,iBAAa,SAAS,UAAU,CAAC,SAAS;AACzC,iBAAW,KAAK,MAAM;AACrB,YAAI,UAAU,GAAG;AAChB,cAAI,EAAE,CAAC,MAAM,MAAM;AAClB,cAAE,KAAK,EAAE,CAAC,CAAM;AAAA,UACjB,WAAW,EAAE,CAAC,MAAM,UAAU;AAC7B,oBAAQ;AAER,uBAAW,KAAK,SAAS;AACxB,gBAAE,KAAK,CAAM;AAAA,YACd;AACA,oBAAQ,SAAS;AAAA,UAClB,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,cAAE,KAAK,CAAC,CAAC,CAAC;AAAA,UACX;AAAA,QACD;AAAA,MAED;AAAA,IACD,CAAC;AAED,WAAO,MAAM;AACZ,mBAAa;AACb,oBAAc;AAAA,IACf;AAAA,EACD,GAAG,aAAa,IAAI,CAAC;AACtB;AAiBO,SAAS,QAAW,SAAsC;AAChE,MAAI,QAAQ,WAAW,GAAG;AACzB,WAAO,SAAY,CAAC,MAAM;AACzB,QAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,IACpB,GAAG,aAAa,CAAC;AAAA,EAClB;AACA,MAAI,QAAQ,WAAW,GAAG;AAEzB,WAAO;AAAA,MACN,CAAC,QAAQ,CAAC,CAAS;AAAA,MACnB,CAAC,MAAM,MAAM;AACZ,cAAM,SAAS,KAAK,CAAC;AACrB,YAAI,UAAU,QAAQ,OAAO,WAAW,GAAG;AAC1C,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,QACD;AACA,mBAAW,KAAK,OAAQ,GAAE,KAAK,CAAM;AAAA,MACtC;AAAA,MACA,aAAgB;AAAA,IACjB;AAAA,EACD;AAEA,SAAO,SAAY,CAAC,MAAM;AACzB,QAAI,SAAwB;AAC5B,UAAM,SAAyB,CAAC;AAChC,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACxC,YAAM,MAAM;AACZ,YAAM,IAAK,QAAQ,CAAC,EAAW,UAAU,CAAC,SAAS;AAClD,mBAAW,KAAK,MAAM;AACrB,cAAI,WAAW,QAAQ,QAAQ,OAAQ;AACvC,cAAI,EAAE,CAAC,MAAM,MAAM;AAClB,gBAAI,WAAW,KAAM,UAAS;AAC9B,cAAE,KAAK,EAAE,CAAC,CAAM;AAAA,UACjB,WAAW,EAAE,CAAC,MAAM,YAAY,EAAE,CAAC,MAAM,OAAO;AAC/C,gBAAI,WAAW,QAAQ,QAAQ,QAAQ;AACtC,gBAAE,KAAK,CAAC,CAAC,CAAC;AAAA,YACX;AAAA,UACD;AAAA,QACD;AAAA,MACD,CAAC;AACD,aAAO,KAAK,CAAC;AAAA,IACd;AACA,WAAO,MAAM;AACZ,iBAAW,KAAK,OAAQ,GAAE;AAAA,IAC3B;AAAA,EACD,GAAG,aAAa,CAAC;AAClB;AAIA,SAAS,aAAgB,OAAgB,GAAgB,iBAAyC;AACjG,MAAI;AACJ,MAAI,WAAW;AACf,QAAM,SAAS,MAAY;AAC1B,QAAI,SAAU;AACd,eAAW;AACX,oBAAgB;AAAA,EACjB;AACA,UAAQ,MAAM,UAAU,CAAC,SAAS;AACjC,QAAI,cAAc;AAClB,QAAI,WAAW;AACf,eAAW,KAAK,MAAM;AACrB,UAAI,EAAE,CAAC,MAAM,MAAO;AACpB,UAAI,EAAE,CAAC,MAAM,MAAM;AAClB,UAAE,KAAK,EAAE,CAAC,CAAM;AAAA,MACjB,WAAW,EAAE,CAAC,MAAM,UAAU;AAC7B,sBAAc;AAAA,MACf,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,mBAAW;AACX,UAAE,KAAK,CAAC,CAAC,CAAC;AAAA,MACX,WAAW,EAAE,CAAC,MAAM,SAAS,EAAE,CAAC,MAAM,UAAU;AAE/C,UAAE,KAAK,CAAC,CAAC,CAAC;AAAA,MACX;AAAA,IASD;AACA,QAAI,UAAU;AACb,cAAQ;AACR,cAAQ;AACR,aAAO;AAAA,IACR,WAAW,aAAa;AACvB,aAAO;AAAA,IACR;AAAA,EACD,CAAC;AAID,SAAO,MAAM;AACZ,YAAQ;AACR,YAAQ;AAAA,EACT;AACD;AAmBO,SAAS,UACf,QACA,SACA,MACU;AACV,MAAI;AACJ,MAAI,aAAa;AAEjB,WAAS,aAAmB;AAC3B,iBAAa;AACb,iBAAa;AAAA,EACd;AAEA,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,GAAG,QAAQ;AAEjB,UAAI,IAAI,aAAa,CAAC,KAAK,QAAQ,IAAI,aAAa,CAAC,MAAM,MAAM;AAChE,mBAAW;AACX;AAAA,MACD;AAEA,UAAI,IAAI,aAAa,CAAC,MAAM,MAAM;AACjC,qBAAa;AACb,YAAI,CAAC,WAAY,GAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAEpC;AAAA,MACD;AAEA,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,QAAQ,OAAO,WAAW,EAAG;AAK3C,iBAAW;AACX,mBAAa,aAAa,QAAQ,QAAQ,OAAO,OAAO,SAAS,CAAC,CAAM,CAAC,GAAG,GAAG,MAAM;AACpF,mBAAW;AACX,YAAI,WAAY,GAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,MACpC,CAAC;AAID,aAAO;AAAA,QACN,cAAc,MAAM;AACnB,qBAAW;AACX,uBAAa;AAAA,QACd;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,GAAG,aAAa,IAAI,GAAG,0BAA0B,MAAM;AAAA,EAC1D;AACD;AAkBO,SAAS,WACf,QACA,SACA,MACU;AACV,MAAI;AACJ,MAAI,aAAa;AAEjB,WAAS,aAAmB;AAC3B,iBAAa;AACb,iBAAa;AAAA,EACd;AAEA,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,GAAG,QAAQ;AACjB,UAAI,IAAI,aAAa,CAAC,KAAK,QAAQ,IAAI,aAAa,CAAC,MAAM,MAAM;AAChE,mBAAW;AACX;AAAA,MACD;AACA,UAAI,IAAI,aAAa,CAAC,MAAM,MAAM;AACjC,qBAAa;AACb,YAAI,CAAC,WAAY,GAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACpC;AAAA,MACD;AAEA,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,QAAQ,OAAO,WAAW,EAAG;AAE3C,UAAI,eAAe,QAAW;AAE7B,qBAAa,aAAa,QAAQ,QAAQ,OAAO,CAAC,CAAM,CAAC,GAAG,GAAG,MAAM;AACpE,qBAAW;AACX,cAAI,WAAY,GAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,QACpC,CAAC;AAAA,MACF,OAAO;AAEN,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,MACpB;AAEA,aAAO;AAAA,QACN,cAAc,MAAM;AACnB,qBAAW;AACX,uBAAa;AAAA,QACd;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,GAAG,aAAa,IAAI,GAAG,0BAA0B,MAAM;AAAA,EAC1D;AACD;AAkBO,SAAS,UACf,QACA,SACA,MACU;AACV,QAAM,EAAE,WAAW,QAAQ,GAAG,eAAe,IAAI,QAAQ,CAAC;AAC1D,QAAM,QAAa,CAAC;AACpB,MAAI;AACJ,MAAI,aAAa;AACjB,MAAI;AAEJ,WAAS,aAAmB;AAC3B,iBAAa;AACb,iBAAa;AAAA,EACd;AAEA,WAAS,UAAgB;AACxB,QAAI,CAAC,WAAW,eAAe,OAAW;AAC1C,QAAI,MAAM,WAAW,GAAG;AACvB,UAAI,WAAY,SAAQ,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACzC;AAAA,IACD;AACA,UAAM,IAAI,MAAM,MAAM;AACtB,iBAAa,aAAa,QAAQ,QAAQ,CAAC,CAAC,GAAG,SAAS,MAAM;AAC7D,iBAAW;AACX,cAAQ;AAAA,IACT,CAAC;AAAA,EACF;AAEA,WAAS,QAAQ,GAAY;AAC5B,QAAI,UAAU,SAAS,KAAK,MAAM,UAAU,OAAQ,OAAM,MAAM;AAChE,UAAM,KAAK,CAAC;AACZ,YAAQ;AAAA,EACT;AAEA,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,GAAG,QAAQ;AACjB,gBAAU;AAEV,UAAI,IAAI,aAAa,CAAC,KAAK,QAAQ,IAAI,aAAa,CAAC,MAAM,MAAM;AAChE,mBAAW;AACX,cAAM,SAAS;AACf;AAAA,MACD;AACA,UAAI,IAAI,aAAa,CAAC,MAAM,MAAM;AACjC,qBAAa;AACb,gBAAQ;AACR;AAAA,MACD;AAEA,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,QAAQ,OAAO,WAAW,EAAG;AAE3C,iBAAW,KAAK,QAAe;AAC9B,gBAAQ,CAAM;AAAA,MACf;AAEA,aAAO;AAAA,QACN,cAAc,MAAM;AACnB,qBAAW;AACX,gBAAM,SAAS;AACf,uBAAa;AAAA,QACd;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,GAAG,aAAa,cAAc,GAAG,0BAA0B,MAAM;AAAA,EACpE;AACD;AAqCO,SAAS,SACf,QACA,SACA,MACU;AACV,QAAM,EAAE,YAAY,eAAe,GAAG,cAAc,IAAI,QAAQ,CAAC;AACjE,QAAM,gBACL,iBAAiB,QAAQ,gBAAgB,IAAI,gBAAgB,OAAO;AAErE,MAAI,SAAS;AACb,MAAI,aAAa;AACjB,QAAM,aAAa,oBAAI,IAAgB;AACvC,QAAMC,UAAc,CAAC;AACrB,MAAI;AAEJ,WAAS,cAAoB;AAC5B,QAAI,cAAc,WAAW,KAAKA,QAAO,WAAW,KAAK,SAAS;AACjE,cAAQ,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,IAC1B;AAAA,EACD;AAEA,WAAS,MAAM,GAAY;AAC1B,QAAI,CAAC,QAAS;AACd;AAGA,QAAI;AACJ,WAAO,aAAa,QAAQ,QAAQ,CAAC,CAAC,GAAG,SAAS,MAAM;AACvD,UAAI,KAAM,YAAW,OAAO,IAAI;AAChC;AACA,kBAAY;AACZ,kBAAY;AAAA,IACb,CAAC;AACD,eAAW,IAAI,IAAI;AAAA,EACpB;AAEA,WAAS,cAAoB;AAC5B,WAAOA,QAAO,SAAS,KAAK,SAAS,eAAe;AACnD,YAAMA,QAAO,MAAM,CAAE;AAAA,IACtB;AAAA,EACD;AAEA,WAAS,QAAQ,GAAY;AAC5B,QAAI,SAAS,cAAe,OAAM,CAAC;AAAA,QAC9B,CAAAA,QAAO,KAAK,CAAC;AAAA,EACnB;AAEA,WAAS,WAAiB;AACzB,eAAW,KAAK,WAAY,GAAE;AAC9B,eAAW,MAAM;AACjB,aAAS;AACT,IAAAA,QAAO,SAAS;AAAA,EACjB;AAEA,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,GAAG,QAAQ;AACjB,gBAAU;AAEV,UAAI,IAAI,aAAa,CAAC,KAAK,QAAQ,IAAI,aAAa,CAAC,MAAM,MAAM;AAChE,iBAAS;AACT;AAAA,MACD;AACA,UAAI,IAAI,aAAa,CAAC,MAAM,MAAM;AACjC,qBAAa;AACb,oBAAY;AACZ;AAAA,MACD;AAEA,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,QAAQ,OAAO,WAAW,EAAG;AAE3C,iBAAW,KAAK,QAAe;AAC9B,gBAAQ,CAAM;AAAA,MACf;AAEA,aAAO;AAAA,QACN,cAAc,MAAM;AACnB,mBAAS;AACT,uBAAa;AAAA,QACd;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,GAAG,aAAa,aAAa,GAAG,0BAA0B,MAAM;AAAA,EACnE;AACD;AAmBO,IAAM,UAAU;AAkBhB,SAAS,MAAS,QAAiB,IAAY,MAA2B;AAChF,SAAO,SAAY,CAAC,MAAM;AACzB,UAAM,SAAS,oBAAI,IAAmC;AACtD,aAAS,WAAiB;AACzB,iBAAW,MAAM,OAAQ,cAAa,EAAE;AACxC,aAAO,MAAM;AAAA,IACd;AAEA,UAAM,WAAW,OAAO,UAAU,CAAC,SAAS;AAC3C,iBAAW,KAAK,MAAM;AACrB,YAAI,EAAE,CAAC,MAAM,MAAM;AAClB,gBAAM,KAAK,WAAW,MAAM;AAC3B,mBAAO,OAAO,EAAE;AAChB,cAAE,KAAK,EAAE,CAAC,CAAM;AAAA,UACjB,GAAG,EAAE;AACL,iBAAO,IAAI,EAAE;AAAA,QACd,WAAW,EAAE,CAAC,MAAM,UAAU;AAE7B,gBAAM,KAAK,WAAW,MAAM;AAC3B,mBAAO,OAAO,EAAE;AAChB,cAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,UACpB,GAAG,EAAE;AACL,iBAAO,IAAI,EAAE;AAAA,QACd,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,mBAAS;AACT,YAAE,KAAK,CAAC,CAAC,CAAC;AAAA,QACX;AAAA,MAID;AAAA,IACD,CAAC;AAED,WAAO,MAAM;AACZ,eAAS;AACT,eAAS;AAAA,IACV;AAAA,EACD,GAAG,aAAa,IAAI,CAAC;AACtB;AAkBO,SAAS,SAAY,QAAiB,IAAY,MAA2B;AACnF,SAAO,SAAY,CAAC,MAAM;AACzB,QAAI;AACJ,QAAI;AAEJ,aAAS,aAAmB;AAC3B,UAAI,UAAU,QAAW;AACxB,qBAAa,KAAK;AAClB,gBAAQ;AAAA,MACT;AAAA,IACD;AAEA,UAAM,WAAW,OAAO,UAAU,CAAC,SAAS;AAC3C,iBAAW,KAAK,MAAM;AACrB,YAAI,EAAE,CAAC,MAAM,MAAM;AAClB,qBAAW;AACX,oBAAU,EAAE,CAAC;AACb,kBAAQ,WAAW,MAAM;AACxB,oBAAQ;AACR,cAAE,KAAK,OAAY;AAAA,UACpB,GAAG,EAAE;AAAA,QACN,WAAW,EAAE,CAAC,MAAM,UAAU;AAC7B,cAAI,UAAU,QAAW;AACxB,uBAAW;AACX,cAAE,KAAK,OAAY;AAAA,UACpB;AACA,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,QACpB,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,qBAAW;AACX,YAAE,KAAK,CAAC,CAAC,CAAC;AAAA,QACX;AAAA,MACD;AAAA,IACD,CAAC;AAED,WAAO,MAAM;AACZ,eAAS;AACT,iBAAW;AAAA,IACZ;AAAA,EACD,GAAG,aAAa,IAAI,CAAC;AACtB;AAoBO,SAAS,SACf,QACA,IACA,MACU;AACV,QAAM,EAAE,SAAS,YAAY,UAAU,aAAa,GAAG,iBAAiB,IAAI,QAAQ,CAAC;AACrF,QAAM,UAAU,eAAe;AAC/B,QAAM,WAAW,gBAAgB;AACjC,QAAM,WAAW,KAAK;AAEtB,SAAO,SAAY,CAAC,MAAM;AACzB,QAAI;AACJ,QAAI,aAAa;AACjB,QAAI;AACJ,QAAI,aAAa;AAEjB,aAAS,aAAmB;AAC3B,UAAI,UAAU,QAAW;AACxB,qBAAa,KAAK;AAClB,gBAAQ;AAAA,MACT;AAAA,IACD;AAEA,UAAM,WAAW,OAAO,UAAU,CAAC,SAAS;AAC3C,iBAAW,KAAK,MAAM;AACrB,YAAI,EAAE,CAAC,MAAM,MAAM;AAClB,gBAAM,IAAI,EAAE,CAAC;AACb,gBAAM,QAAQ,YAAY;AAC1B,cAAI,WAAW,QAAQ,cAAc,UAAU;AAC9C,yBAAa;AACb,cAAE,KAAK,CAAC;AACR,uBAAW;AACX,gBAAI,UAAU;AACb,sBAAQ,WAAW,MAAM;AACxB,wBAAQ;AACR,oBAAI,YAAY;AACf,+BAAa,YAAY;AACzB,oBAAE,KAAK,OAAY;AACnB,+BAAa;AAAA,gBACd;AAAA,cACD,GAAG,EAAE;AAAA,YACN;AAAA,UACD,WAAW,UAAU;AACpB,sBAAU;AACV,yBAAa;AACb,gBAAI,UAAU,QAAW;AACxB,oBAAM,aAAa,QAAQ,cAAc;AACzC,sBAAQ;AAAA,gBACP,MAAM;AACL,0BAAQ;AACR,sBAAI,YAAY;AACf,iCAAa,YAAY;AACzB,sBAAE,KAAK,OAAY;AACnB,iCAAa;AAAA,kBACd;AAAA,gBACD;AAAA,gBACA,KAAK,IAAI,GAAG,KAAK,SAAS;AAAA,cAC3B;AAAA,YACD;AAAA,UACD;AAAA,QACD,WAAW,EAAE,CAAC,MAAM,YAAY,EAAE,CAAC,MAAM,OAAO;AAC/C,qBAAW;AACX,YAAE,KAAK,CAAC,CAAC,CAAC;AAAA,QACX;AAAA,MACD;AAAA,IACD,CAAC;AAED,WAAO,MAAM;AACZ,eAAS;AACT,iBAAW;AAAA,IACZ;AAAA,EACD,GAAG,aAAa,gBAAgB,CAAC;AAClC;AAsBO,SAAS,OAAU,QAAiB,UAAyB,MAA2B;AAC9F,SAAO,SAAY,CAAC,MAAM;AACzB,QAAI;AACJ,QAAI,aAAa;AACjB,QAAI,kBAAkB;AAEtB,UAAM,WAAW,OAAO,UAAU,CAAC,SAAS;AAC3C,UAAI,WAAY;AAChB,iBAAW,KAAK,MAAM;AACrB,YAAI,WAAY;AAChB,YAAI,EAAE,CAAC,MAAM,MAAM;AAClB,4BAAkB,EAAE,GAAG,EAAE,CAAC,EAAO;AAAA,QAClC,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,uBAAa;AACb,YAAE,KAAK,CAAC,CAAC,CAAC;AAAA,QACX,WAAW,EAAE,CAAC,MAAM,UAAU;AAC7B,4BAAkB;AAClB,4BAAkB;AAAA,QACnB;AAAA,MACD;AAAA,IACD,CAAC;AAED,UAAM,WAAW,SAAS,UAAU,CAAC,SAAS;AAC7C,UAAI,WAAY;AAChB,iBAAW,KAAK,MAAM;AACrB,YAAI,WAAY;AAChB,YAAI,EAAE,CAAC,MAAM,MAAM;AAClB,cAAI,oBAAoB,UAAa,CAAC,iBAAiB;AACtD,cAAE,KAAK,gBAAgB,CAAC;AAAA,UACzB;AAAA,QACD,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,uBAAa;AACb,YAAE,KAAK,CAAC,CAAC,CAAC;AAAA,QACX,WAAW,EAAE,CAAC,MAAM,UAAU;AAC7B,uBAAa;AACb,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,QACpB;AAAA,MACD;AAAA,IACD,CAAC;AAED,WAAO,MAAM;AACZ,eAAS;AACT,eAAS;AAAA,IACV;AAAA,EACD,GAAG,aAAa,IAAI,CAAC;AACtB;AAkBO,SAAS,MAAS,QAAiB,IAAY,MAA2B;AAChF,SAAO,SAAY,CAAC,MAAM;AACzB,QAAI;AACJ,QAAI;AACJ,QAAI,MAAM;AAEV,aAAS,aAAmB;AAC3B,UAAI,UAAU,QAAW;AACxB,qBAAa,KAAK;AAClB,gBAAQ;AAAA,MACT;AAAA,IACD;AAEA,UAAM,WAAW,OAAO,UAAU,CAAC,SAAS;AAC3C,iBAAW,KAAK,MAAM;AACrB,YAAI,EAAE,CAAC,MAAM,MAAM;AAClB,mBAAS,EAAE,CAAC;AACZ,gBAAM;AACN,qBAAW;AACX,kBAAQ,WAAW,MAAM;AACxB,oBAAQ;AACR,gBAAI,KAAK;AACR,oBAAM;AACN,gBAAE,KAAK,MAAW;AAAA,YACnB;AAAA,UACD,GAAG,EAAE;AAAA,QACN,WAAW,EAAE,CAAC,MAAM,YAAY,EAAE,CAAC,MAAM,OAAO;AAC/C,qBAAW;AACX,YAAE,KAAK,CAAC,CAAC,CAAC;AAAA,QACX;AAAA,MACD;AAAA,IACD,CAAC;AAED,WAAO,MAAM;AACZ,eAAS;AACT,iBAAW;AAAA,IACZ;AAAA,EACD,GAAG,aAAa,IAAI,CAAC;AACtB;AA2EO,SAAS,OAAU,QAAiB,UAAyB,MAA6B;AAChG,SAAO,SAAc,CAAC,MAAM;AAC3B,UAAM,MAAW,CAAC;AAElB,UAAM,WAAW,OAAO,UAAU,CAAC,SAAS;AAC3C,iBAAW,KAAK,MAAM;AACrB,YAAI,EAAE,CAAC,MAAM,MAAM;AAClB,cAAI,KAAK,EAAE,CAAC,CAAM;AAAA,QACnB,WAAW,EAAE,CAAC,MAAM,UAAU;AAC7B,cAAI,IAAI,SAAS,EAAG,GAAE,KAAK,CAAC,GAAG,GAAG,CAAC;AACnC,cAAI,SAAS;AACb,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,QACpB,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,YAAE,KAAK,CAAC,CAAC,CAAC;AAAA,QACX;AAAA,MACD;AAAA,IACD,CAAC;AAED,UAAM,WAAW,SAAS,UAAU,CAAC,SAAS;AAC7C,iBAAW,KAAK,MAAM;AACrB,YAAI,EAAE,CAAC,MAAM,MAAM;AAClB,cAAI,IAAI,SAAS,GAAG;AACnB,cAAE,KAAK,CAAC,GAAG,GAAG,CAAC;AACf,gBAAI,SAAS;AAAA,UACd;AAAA,QACD,WAAW,EAAE,CAAC,MAAM,UAAU;AAE7B,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,QACpB,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,YAAE,KAAK,CAAC,CAAC,CAAC;AAAA,QACX;AAAA,MACD;AAAA,IACD,CAAC;AAED,WAAO,MAAM;AACZ,eAAS;AACT,eAAS;AACT,UAAI,SAAS;AAAA,IACd;AAAA,EACD,GAAG,aAAa,IAAI,CAAC;AACtB;AAkBO,SAAS,YAAe,QAAiB,OAAe,MAA6B;AAC3F,MAAI,SAAS,EAAG,OAAM,IAAI,WAAW,+BAA+B;AACpE,SAAO,SAAc,CAAC,MAAM;AAC3B,UAAM,MAAW,CAAC;AAElB,UAAM,WAAW,OAAO,UAAU,CAAC,SAAS;AAC3C,iBAAW,KAAK,MAAM;AACrB,YAAI,EAAE,CAAC,MAAM,MAAM;AAClB,cAAI,KAAK,EAAE,CAAC,CAAM;AAClB,cAAI,IAAI,UAAU,OAAO;AACxB,cAAE,KAAK,IAAI,OAAO,GAAG,IAAI,MAAM,CAAC;AAAA,UACjC;AAAA,QACD,WAAW,EAAE,CAAC,MAAM,UAAU;AAC7B,cAAI,IAAI,SAAS,EAAG,GAAE,KAAK,CAAC,GAAG,GAAG,CAAC;AACnC,cAAI,SAAS;AACb,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,QACpB,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,YAAE,KAAK,CAAC,CAAC,CAAC;AAAA,QACX;AAAA,MACD;AAAA,IACD,CAAC;AAED,WAAO,MAAM;AACZ,eAAS;AACT,UAAI,SAAS;AAAA,IACd;AAAA,EACD,GAAG,aAAa,IAAI,CAAC;AACtB;AAmBO,SAAS,YAAe,QAAiB,OAAe,MAAiC;AAC/F,MAAI,SAAS,EAAG,OAAM,IAAI,WAAW,+BAA+B;AAEpE,SAAO,SAAkB,CAAC,MAAM;AAC/B,QAAI;AACJ,QAAI,IAAI;AAER,aAAS,aAAmB;AAC3B,YAAM,IAAI,SAAY,CAAC,YAAY;AAClC,kBAAU,QAAQ,KAAK,KAAK,OAAO;AACnC,eAAO,MAAM;AACZ,oBAAU;AAAA,QACX;AAAA,MACD,GAAG,aAAa,CAAC;AACjB,UAAI;AACJ,QAAE,KAAK,CAAC;AAAA,IACT;AAEA,UAAM,WAAW,OAAO,UAAU,CAAC,SAAS;AAC3C,iBAAW,KAAK,MAAM;AACrB,YAAI,EAAE,CAAC,MAAM,MAAM;AAClB,cAAI,CAAC,QAAS,YAAW;AACzB,oBAAU,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;AACxB,eAAK;AACL,cAAI,KAAK,OAAO;AACf,sBAAU,CAAC,CAAC,QAAQ,CAAC,CAAC;AACtB,sBAAU;AAAA,UACX;AAAA,QACD,WAAW,EAAE,CAAC,MAAM,UAAU;AAC7B,oBAAU,CAAC,CAAC,QAAQ,CAAC,CAAC;AACtB,oBAAU;AACV,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,QACpB,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,oBAAU,CAAC,CAAC,CAAC;AACb,oBAAU;AACV,YAAE,KAAK,CAAC,CAAC,CAAC;AAAA,QACX;AAAA,MACD;AAAA,IACD,CAAC;AAED,WAAO,MAAM;AACZ,eAAS;AACT,gBAAU,CAAC,CAAC,QAAQ,CAAC,CAAC;AACtB,gBAAU;AAAA,IACX;AAAA,EACD,GAAG,aAAa,IAAI,CAAC;AACtB;AAkBO,SAAS,WAAc,QAAiB,IAAY,MAA6B;AACvF,SAAO,SAAc,CAAC,MAAM;AAC3B,UAAM,MAAW,CAAC;AAElB,UAAM,KAAK,YAAY,MAAM;AAC5B,UAAI,IAAI,SAAS,GAAG;AACnB,UAAE,KAAK,CAAC,GAAG,GAAG,CAAC;AACf,YAAI,SAAS;AAAA,MACd;AAAA,IACD,GAAG,EAAE;AAEL,UAAM,WAAW,OAAO,UAAU,CAAC,SAAS;AAC3C,iBAAW,KAAK,MAAM;AACrB,YAAI,EAAE,CAAC,MAAM,MAAM;AAClB,cAAI,KAAK,EAAE,CAAC,CAAM;AAAA,QACnB,WAAW,EAAE,CAAC,MAAM,UAAU;AAC7B,wBAAc,EAAE;AAChB,cAAI,IAAI,SAAS,EAAG,GAAE,KAAK,CAAC,GAAG,GAAG,CAAC;AACnC,cAAI,SAAS;AACb,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,QACpB,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,wBAAc,EAAE;AAChB,YAAE,KAAK,CAAC,CAAC,CAAC;AAAA,QACX;AAAA,MAID;AAAA,IACD,CAAC;AAED,WAAO,MAAM;AACZ,eAAS;AACT,oBAAc,EAAE;AAChB,UAAI,SAAS;AAAA,IACd;AAAA,EACD,GAAG,aAAa,IAAI,CAAC;AACtB;AAmBO,SAAS,WAAc,QAAiB,IAAY,MAAiC;AAC3F,SAAO,SAAkB,CAAC,MAAM;AAC/B,QAAI;AAEJ,aAAS,cAAoB;AAC5B,gBAAU,CAAC,CAAC,QAAQ,CAAC,CAAC;AACtB,gBAAU;AAAA,IACX;AAEA,aAAS,aAAmB;AAC3B,YAAM,IAAI,SAAY,CAAC,YAAY;AAClC,kBAAU,QAAQ,KAAK,KAAK,OAAO;AACnC,eAAO,MAAM;AACZ,oBAAU;AAAA,QACX;AAAA,MACD,GAAG,aAAa,CAAC;AACjB,QAAE,KAAK,CAAC;AAAA,IACT;AAEA,eAAW;AACX,UAAM,KAAK,YAAY,MAAM;AAC5B,kBAAY;AACZ,iBAAW;AAAA,IACZ,GAAG,EAAE;AAEL,UAAM,WAAW,OAAO,UAAU,CAAC,SAAS;AAC3C,iBAAW,KAAK,MAAM;AACrB,YAAI,EAAE,CAAC,MAAM,MAAM;AAClB,oBAAU,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;AAAA,QACzB,WAAW,EAAE,CAAC,MAAM,UAAU;AAC7B,wBAAc,EAAE;AAChB,sBAAY;AACZ,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,QACpB,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,wBAAc,EAAE;AAChB,oBAAU,CAAC,CAAC,CAAC;AACb,sBAAY;AACZ,YAAE,KAAK,CAAC,CAAC,CAAC;AAAA,QACX;AAAA,MACD;AAAA,IACD,CAAC;AAED,WAAO,MAAM;AACZ,eAAS;AACT,oBAAc,EAAE;AAChB,kBAAY;AAAA,IACb;AAAA,EACD,GAAG,aAAa,IAAI,CAAC;AACtB;AAmBO,SAAS,OACf,QACA,UACA,MACgB;AAChB,SAAO,SAAkB,CAAC,MAAM;AAC/B,QAAI;AAEJ,aAAS,cAAoB;AAC5B,gBAAU,CAAC,CAAC,QAAQ,CAAC,CAAC;AACtB,gBAAU;AAAA,IACX;AAEA,aAAS,aAAmB;AAC3B,YAAM,IAAI,SAAY,CAAC,YAAY;AAClC,kBAAU,QAAQ,KAAK,KAAK,OAAO;AACnC,eAAO,MAAM;AACZ,oBAAU;AAAA,QACX;AAAA,MACD,GAAG,aAAa,CAAC;AACjB,QAAE,KAAK,CAAC;AAAA,IACT;AAEA,UAAM,WAAW,OAAO,UAAU,CAAC,SAAS;AAC3C,iBAAW,KAAK,MAAM;AACrB,YAAI,EAAE,CAAC,MAAM,MAAM;AAClB,cAAI,CAAC,QAAS,YAAW;AACzB,oBAAU,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;AAAA,QACzB,WAAW,EAAE,CAAC,MAAM,UAAU;AAC7B,sBAAY;AACZ,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,QACpB,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,oBAAU,CAAC,CAAC,CAAC;AACb,oBAAU;AACV,YAAE,KAAK,CAAC,CAAC,CAAC;AAAA,QACX;AAAA,MACD;AAAA,IACD,CAAC;AAED,UAAM,WAAW,SAAS,UAAU,CAAC,SAAS;AAC7C,iBAAW,KAAK,MAAM;AACrB,YAAI,EAAE,CAAC,MAAM,MAAM;AAClB,sBAAY;AACZ,qBAAW;AAAA,QACZ;AAAA,MACD;AAAA,IACD,CAAC;AAED,WAAO,MAAM;AACZ,eAAS;AACT,eAAS;AACT,kBAAY;AAAA,IACb;AAAA,EACD,GAAG,aAAa,IAAI,CAAC;AACtB;AAiBO,SAAS,SAAS,UAAkB,MAAgC;AAC1E,SAAO,SAAiB,CAAC,GAAG,QAAQ;AACnC,QAAI,EAAE,OAAO,IAAI,OAAQ,KAAI,MAAM,IAAI;AACvC,UAAM,KAAK,YAAY,MAAM;AAC5B,QAAE,KAAK,IAAI,MAAM,CAAW;AAC5B,UAAI,MAAM,IAAK,IAAI,MAAM,IAAe;AAAA,IACzC,GAAG,QAAQ;AACX,WAAO,MAAM,cAAc,EAAE;AAAA,EAC9B,GAAG,aAAa,IAAI,CAAC;AACtB;AAkBO,SAAS,OAAU,QAAiB,OAAe,MAA2B;AACpF,MAAI,SAAS,EAAG,OAAM,IAAI,WAAW,0BAA0B;AAC/D,SAAO,SAAY,CAAC,MAAM;AACzB,QAAI,YAAY;AAChB,QAAI;AAEJ,UAAM,QAAQ,MAAY;AACzB,eAAS;AACT,eAAS,OAAO,UAAU,CAAC,SAAS;AACnC,YAAI,YAAY;AAChB,cAAM,MAAiB,CAAC;AACxB,mBAAW,KAAK,MAAM;AACrB,cAAI,EAAE,CAAC,MAAM,SAAU,aAAY;AAAA,cAC9B,KAAI,KAAK,CAAC;AAAA,QAChB;AACA,YAAI,IAAI,SAAS,EAAG,GAAE,KAAK,GAA0B;AACrD,YAAI,WAAW;AACd,mBAAS;AACT,mBAAS;AACT,uBAAa;AACb,cAAI,YAAY,EAAG,OAAM;AAAA,cACpB,GAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,QACzB;AAAA,MACD,CAAC;AAAA,IACF;AAEA,UAAM;AACN,WAAO,MAAM;AACZ,eAAS;AAAA,IACV;AAAA,EACD,GAAG,aAAa,IAAI,CAAC;AACtB;AAsBO,SAAS,SAAY,QAAiB,MAA2B;AACvE,SAAO;AAAA,IACN,CAAC,MAAc;AAAA,IACf,CAAC,MAAM,MAAM;AACZ,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,QAAQ,OAAO,WAAW,GAAG;AAC1C,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AACA,iBAAW,KAAK,OAAQ,GAAE,KAAK,CAAM;AAAA,IACtC;AAAA,IACA,aAAgB,IAAI;AAAA,EACrB;AACD;AAkBO,SAAS,OACf,QACA,SACA,MACU;AACV,SAAO,SAAY,CAAC,MAAM;AACzB,UAAM,WAAW,OAAO,UAAU,CAAC,SAAS;AAC3C,iBAAW,KAAK,MAAM;AACrB,YAAI,EAAE,CAAC,MAAM,MAAM;AAClB,YAAE,KAAK,EAAE,CAAC,CAAM;AAAA,QACjB,WAAW,EAAE,CAAC,MAAM,OAAO;AAC1B,cAAI;AACH,cAAE,KAAK,QAAQ,EAAE,CAAC,CAAC,CAAC;AAAA,UACrB,SAAS,YAAY;AACpB,cAAE,KAAK,CAAC,CAAC,OAAO,UAAU,CAAC,CAAC;AAAA,UAC7B;AAAA,QACD,WAAW,EAAE,CAAC,MAAM,UAAU;AAC7B,YAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,QACpB;AAAA,MACD;AAAA,IACD,CAAC;AACD,WAAO,MAAM;AACZ,eAAS;AAAA,IACV;AAAA,EACD,GAAG,aAAa,IAAI,CAAC;AACtB;AAuBO,SAAS,MAAS,QAAiB,SAAwB,MAA2B;AAC5F,SAAO;AAAA,IACN,CAAC,QAAgB,OAAe;AAAA,IAChC,CAAC,MAAM,GAAG,QAAQ;AACjB,YAAM,SAAS,KAAK,CAAC;AAErB,YAAM,eAAe,UAAU,QAAQ,OAAO,SAAS,IAAI,OAAO,GAAG,EAAE,IAAI,IAAI,SAAS,CAAC;AACzF,UAAI,CAAC,cAAc;AAClB,UAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AACnB;AAAA,MACD;AACA,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,QAAQ,OAAO,SAAS,GAAG;AAExC,mBAAW,KAAK,OAAQ,GAAE,KAAK,CAAM;AACrC;AAAA,MACD;AAIA,UAAI,UAAU,QAAQ,OAAO,SAAS,KAAK,IAAI,SAAS,CAAC,MAAM,QAAW;AACzE,UAAE,KAAK,IAAI,SAAS,CAAC,CAAM;AAC3B;AAAA,MACD;AACA,QAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,IACpB;AAAA,IACA,aAAa,IAAI;AAAA,EAClB;AACD;AAqBO,IAAM,gBAAgB;AAmBtB,IAAM,eAAe;AAmBrB,IAAM,eAAe;AAmBrB,IAAM,aAAa;;;AC58E1B,SAAS,WAAc,OAAkC;AACxD,SACC,OAAO,UAAU,YACjB,UAAU,QACV,WAAY,SACZ,OAAQ,MAAkB,cAAc;AAE1C;AAiCO,SAAS,WACf,QACA,UACA,MAC+B;AAC/B,QAAM,aAAa,QAAQ,MAAM;AACjC,QAAM,sBAAsB,WAAW,KAAK;AAC5C,QAAM,WAAW,MAAsB,MAAM,mBAAmB,MAAM;AAAA,IACrE,GAAI,sBAAsB,EAAE,MAAM,EAAE,eAAe,KAAK,EAAE,IAAI,CAAC;AAAA,EAChE,CAAC;AACD,QAAM,aAAa,MAAM,YAAY,UAAa,KAAK,YAAY;AAEnE,MAAI,cAAoC;AACxC,MAAI,cAAc,MAAM,YAAY;AACnC,kBAAc,MAAM,QAAQ,KAAK,OAAO,GAAoB,UAA2B;AAAA,EACxF,WAAW,YAAY;AACtB,kBAAc,QAAQ,KAAK,OAAO;AAAA,EACnC,WAAW,MAAM,YAAY;AAC5B,kBAAc;AAAA,EACf;AAEA,MAAI,gBAAgB,MAAM;AASzB,QAAI;AACJ,QAAI,gBAAiB,YAA8B;AAClD,qBAAe,UAAU,YAAY,CAAC,QAAQ,SAAS,GAAQ,CAAC;AAAA,IACjE,OAAO;AACN,UAAI,eAA8B,WAAW;AAC7C,iBAAW,UAAU,CAAC,SAAS;AAC9B,mBAAW,KAAK,MAAM;AACrB,cAAI,EAAE,CAAC,MAAM,KAAM,gBAAe,EAAE,CAAC;AAAA,QACtC;AAAA,MACD,CAAC;AACD,qBAAe,UAAU,aAAa,MAAM,SAAS,YAAiB,CAAC;AAAA,IACxE;AACA,YAAQ,cAAc,CAAC,UAAU;AAChC,YAAM,MAAM;AACX,iBAAS,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC;AAE7B,YAAI,qBAAqB;AACxB,gBAAM,KAAK,WAAW;AACtB,cAAI,MAAM,MAAM;AACf,qBAAS,KAAK,cAAc,KAAK,CAAC,CAAC,MAAM,EAAE,IAAI,GAAG,IAAI,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC;AAAA,UAC9E;AAAA,QACD;AAAA,MACD,CAAC;AAAA,IACF,CAAC;AAAA,EACF;AAEA,SAAO,EAAE,MAAM,YAAY,UAAU,SAAS,YAAY;AAC3D;AAwBA,SAAS,UAAUC,OAAkB;AACpC,EAAAA,MAAK,UAAU,MAAM,MAAS;AAC/B;AAEA,SAAS,gBAAsB,UAA8C;AAC5E,MAAI,oBAAoB,IAAK,QAAO;AACpC,SAAO,oBAAI,IAAkB;AAC9B;AAEA,SAAS,gBACR,OACA,YACO;AACP,MAAI,CAAC,MAAM,QAAQ,WAAW,MAAM,GAAG;AACtC,UAAM,IAAI,UAAU,2DAA2D;AAAA,EAChF;AACA,QAAM,MAAM;AACX,eAAW,EAAE,KAAK,MAAM,KAAK,WAAW,QAAQ;AAC/C,YAAM,IAAI,KAAK,KAAK;AAAA,IACrB;AACA,eAAW,OAAO,WAAW,UAAU,CAAC,GAAG;AAC1C,YAAM,OAAO,GAAG;AAAA,IACjB;AAAA,EACD,CAAC;AACF;AAKO,SAAS,QACf,QACA,WACA,MACsB;AACtB,QAAM,aAAa,QAAQ,MAAM;AACjC,QAAM,QAAQ,YAA0B,KAAK,cAAc,CAAC,CAAC;AAC7D,QAAM,SAAS,KAAK,UAAU;AAC9B,QAAM,aAAa,KAAK,YAAY,UAAa,KAAK,YAAY;AAClE,QAAM,cAAc,aAAa,QAAQ,KAAK,OAAO,IAAI,MAAe,IAAI;AAQ5E,MAAI,cAAyC,gBAAsB,MAAM,QAAQ,KAAK;AACtF,QAAM,QAAQ,UAAU,CAAC,SAAS;AACjC,eAAW,KAAK,MAAM;AACrB,UAAI,EAAE,CAAC,MAAM,KAAM,eAAc,gBAAsB,EAAE,CAAC,CAAC;AAAA,IAC5D;AAAA,EACD,CAAC;AAED,QAAM,mBAAmB,UAAU,YAAY,CAAC,QAAQ,UAAU,KAAa,WAAW,CAAC;AAC3F,UAAQ,kBAAkB,CAAC,eAAe;AACzC,oBAAgB,OAAO,UAAU;AAAA,EAClC,CAAC;AAED,MAAI,KAAK,OAAO;AAEf,UAAM,gBAAgB,oBAAI,IAAwB;AAElD,UAAM,eAAe,QAAQ,CAAC,MAAM,OAAO,GAAG,CAAC,CAAC,QAAQ,MAAM;AAC7D,YAAM,MAAgB,CAAC;AACvB,YAAM,UAAU,gBAAsB,QAAQ;AAE9C,iBAAW,OAAO,cAAc,KAAK,GAAG;AACvC,YAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACtB,wBAAc,IAAI,GAAG,EAAG;AACxB,wBAAc,OAAO,GAAG;AAAA,QACzB;AAAA,MACD;AACA,iBAAW,CAAC,KAAK,GAAG,KAAK,SAAS;AACjC,cAAM,UAAU,KAAK,MAAO,KAAK,GAAG;AACpC,YAAI,WAAoB,OAAO,GAAG;AAMjC,cAAI,CAAC,cAAc,IAAI,GAAG,GAAG;AAC5B,kBAAM,QAAQ,QAAQ,SAAS,CAAC,QAAQ;AACvC,kBAAI,QAAQ,QAAQ,MAAM,IAAI,GAAG,GAAG;AACnC,sBAAM,OAAO,GAAG;AAAA,cACjB;AAAA,YACD,CAAC;AACD,0BAAc,IAAI,KAAK,KAAK;AAAA,UAC7B;AACA;AAAA,QACD;AACA,YAAI,OAAO,YAAY,WAAW;AACjC,cAAI,QAAS,KAAI,KAAK,GAAG;AACzB;AAAA,QACD;AACA,cAAM,IAAI,UAAU,sDAAsD;AAAA,MAC3E;AACA,aAAO;AAAA,IACR,CAAC;AACD,YAAQ,cAAc,CAAC,SAAS;AAC/B,iBAAW,OAAO,KAAM,OAAM,OAAO,GAAG;AAAA,IACzC,CAAC;AAAA,EACF;AAEA,QAAM,wBACL,KAAK,uBAAuB,UAAa,KAAK,uBAAuB;AACtE,MAAI,KAAK,eAAe,uBAAuB;AAC9C,UAAM,yBAAyB,QAAQ,KAAK,kBAAkB;AAC9D,UAAM,sBAAsB;AAAA,MAAU;AAAA,MAAwB,MAC7D,KAAK,YAAa,WAAW;AAAA,IAC9B;AACA,YAAQ,qBAAqB,CAAC,eAAe;AAC5C,sBAAgB,OAAO,UAAU;AAAA,IAClC,CAAC;AAAA,EACF;AAEA,QAAM,UAAU,QAAQ,CAAC,MAAM,SAAS,WAAW,GAAG,CAAC,CAAC,UAAU,OAAO,MAAM;AAC9E,UAAM,UAAU,CAAC,GAAG,gBAAsB,QAAQ,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,OAAO;AAAA,MACrF;AAAA,MACA;AAAA,MACA,OAAO,KAAK,MAAM,OAAO,OAAO;AAAA,MAChC,MAAM,KAAK,KAAK,KAAK;AAAA,IACtB,EAAE;AACF,YAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAExC,UAAM,SAA6D,CAAC;AACpE,QAAI,YAAY;AAChB,eAAW,QAAQ,SAAS;AAC3B,UAAI,KAAK,QAAQ,WAAW;AAC3B,eAAO,KAAK,EAAE,KAAK,KAAK,KAAK,OAAO,KAAK,OAAO,OAAO,KAAK,MAAM,CAAC;AACnE,qBAAa,KAAK;AAAA,MACnB;AAAA,IACD;AACA,WAAO;AAAA,EACR,CAAC;AAED,QAAM,OAAO,QAAQ,CAAC,MAAM,OAAO,GAAG,CAAC,CAAC,QAAQ,MAAM,gBAAsB,QAAQ,EAAE,IAAI;AAC1F,YAAU,OAAO;AACjB,YAAU,IAAI;AAEd,SAAO,EAAE,OAAO,SAAS,KAAK;AAC/B;","names":["delay","last","buffer","node"]}

package/dist/chunk-SX52TAR4.js

@@ -0,0 +1,110 @@
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __knownSymbol = (name, symbol) => (symbol = Symbol[name]) ? symbol : /* @__PURE__ */ Symbol.for("Symbol." + name);
+var __typeError = (msg) => {
+  throw TypeError(msg);
+};
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+var __require = /* @__PURE__ */ ((x) => typeof require !== "undefined" ? require : typeof Proxy !== "undefined" ? new Proxy(x, {
+  get: (a, b) => (typeof require !== "undefined" ? require : a)[b]
+}) : x)(function(x) {
+  if (typeof require !== "undefined") return require.apply(this, arguments);
+  throw Error('Dynamic require of "' + x + '" is not supported');
+});
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __decoratorStart = (base) => [, , , __create(base?.[__knownSymbol("metadata")] ?? null)];
+var __decoratorStrings = ["class", "method", "getter", "setter", "accessor", "field", "value", "get", "set"];
+var __expectFn = (fn) => fn !== void 0 && typeof fn !== "function" ? __typeError("Function expected") : fn;
+var __decoratorContext = (kind, name, done, metadata, fns) => ({ kind: __decoratorStrings[kind], name, metadata, addInitializer: (fn) => done._ ? __typeError("Already initialized") : fns.push(__expectFn(fn || null)) });
+var __decoratorMetadata = (array, target) => __defNormalProp(target, __knownSymbol("metadata"), array[3]);
+var __runInitializers = (array, flags, self, value) => {
+  for (var i = 0, fns = array[flags >> 1], n = fns && fns.length; i < n; i++) flags & 1 ? fns[i].call(self) : value = fns[i].call(self, value);
+  return value;
+};
+var __decorateElement = (array, flags, name, decorators, target, extra) => {
+  var fn, it, done, ctx, access, k = flags & 7, s = !!(flags & 8), p = !!(flags & 16);
+  var j = k > 3 ? array.length + 1 : k ? s ? 1 : 2 : 0, key = __decoratorStrings[k + 5];
+  var initializers = k > 3 && (array[j - 1] = []), extraInitializers = array[j] || (array[j] = []);
+  var desc = k && (!p && !s && (target = target.prototype), k < 5 && (k > 3 || !p) && __getOwnPropDesc(k < 4 ? target : { get [name]() {
+    return __privateGet(this, extra);
+  }, set [name](x) {
+    return __privateSet(this, extra, x);
+  } }, name));
+  k ? p && k < 4 && __name(extra, (k > 2 ? "set " : k > 1 ? "get " : "") + name) : __name(target, name);
+  for (var i = decorators.length - 1; i >= 0; i--) {
+    ctx = __decoratorContext(k, name, done = {}, array[3], extraInitializers);
+    if (k) {
+      ctx.static = s, ctx.private = p, access = ctx.access = { has: p ? (x) => __privateIn(target, x) : (x) => name in x };
+      if (k ^ 3) access.get = p ? (x) => (k ^ 1 ? __privateGet : __privateMethod)(x, target, k ^ 4 ? extra : desc.get) : (x) => x[name];
+      if (k > 2) access.set = p ? (x, y) => __privateSet(x, target, y, k ^ 4 ? extra : desc.set) : (x, y) => x[name] = y;
+    }
+    it = (0, decorators[i])(k ? k < 4 ? p ? extra : desc[key] : k > 4 ? void 0 : { get: desc.get, set: desc.set } : target, ctx), done._ = 1;
+    if (k ^ 4 || it === void 0) __expectFn(it) && (k > 4 ? initializers.unshift(it) : k ? p ? extra = it : desc[key] = it : target = it);
+    else if (typeof it !== "object" || it === null) __typeError("Object expected");
+    else __expectFn(fn = it.get) && (desc.get = fn), __expectFn(fn = it.set) && (desc.set = fn), __expectFn(fn = it.init) && initializers.unshift(fn);
+  }
+  return k || __decoratorMetadata(array, target), desc && __defProp(target, name, desc), p ? k ^ 4 ? extra : desc : target;
+};
+var __accessCheck = (obj, member, msg) => member.has(obj) || __typeError("Cannot " + msg);
+var __privateIn = (member, obj) => Object(obj) !== obj ? __typeError('Cannot use the "in" operator on this value') : member.has(obj);
+var __privateGet = (obj, member, getter) => (__accessCheck(obj, member, "read from private field"), getter ? getter.call(obj) : member.get(obj));
+var __privateSet = (obj, member, value, setter) => (__accessCheck(obj, member, "write to private field"), setter ? setter.call(obj, value) : member.set(obj, value), value);
+var __privateMethod = (obj, member, method) => (__accessCheck(obj, member, "access private method"), method);
+
+// src/core/messages.ts
+var START = /* @__PURE__ */ Symbol.for("graphrefly/START");
+var DATA = /* @__PURE__ */ Symbol.for("graphrefly/DATA");
+var DIRTY = /* @__PURE__ */ Symbol.for("graphrefly/DIRTY");
+var RESOLVED = /* @__PURE__ */ Symbol.for("graphrefly/RESOLVED");
+var INVALIDATE = /* @__PURE__ */ Symbol.for("graphrefly/INVALIDATE");
+var PAUSE = /* @__PURE__ */ Symbol.for("graphrefly/PAUSE");
+var RESUME = /* @__PURE__ */ Symbol.for("graphrefly/RESUME");
+var TEARDOWN = /* @__PURE__ */ Symbol.for("graphrefly/TEARDOWN");
+var COMPLETE = /* @__PURE__ */ Symbol.for("graphrefly/COMPLETE");
+var ERROR = /* @__PURE__ */ Symbol.for("graphrefly/ERROR");
+var DIRTY_MSG = Object.freeze([DIRTY]);
+var RESOLVED_MSG = Object.freeze([RESOLVED]);
+var INVALIDATE_MSG = Object.freeze([INVALIDATE]);
+var START_MSG = Object.freeze([START]);
+var COMPLETE_MSG = Object.freeze([COMPLETE]);
+var TEARDOWN_MSG = Object.freeze([TEARDOWN]);
+var DIRTY_ONLY_BATCH = Object.freeze([DIRTY_MSG]);
+var RESOLVED_ONLY_BATCH = Object.freeze([RESOLVED_MSG]);
+var INVALIDATE_ONLY_BATCH = Object.freeze([INVALIDATE_MSG]);
+var COMPLETE_ONLY_BATCH = Object.freeze([COMPLETE_MSG]);
+var TEARDOWN_ONLY_BATCH = Object.freeze([TEARDOWN_MSG]);
+
+export {
+  __require,
+  __export,
+  __decoratorStart,
+  __runInitializers,
+  __decorateElement,
+  START,
+  DATA,
+  DIRTY,
+  RESOLVED,
+  INVALIDATE,
+  PAUSE,
+  RESUME,
+  TEARDOWN,
+  COMPLETE,
+  ERROR,
+  DIRTY_MSG,
+  RESOLVED_MSG,
+  INVALIDATE_MSG,
+  START_MSG,
+  COMPLETE_MSG,
+  TEARDOWN_MSG,
+  DIRTY_ONLY_BATCH,
+  RESOLVED_ONLY_BATCH,
+  INVALIDATE_ONLY_BATCH,
+  COMPLETE_ONLY_BATCH,
+  TEARDOWN_ONLY_BATCH
+};
+//# sourceMappingURL=chunk-SX52TAR4.js.map

package/dist/chunk-SX52TAR4.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/core/messages.ts"],"sourcesContent":["/**\n * GraphReFly message protocol — §1 `~/src/graphrefly/GRAPHREFLY-SPEC.md`.\n * Emissions are always `[[Type, Data?], ...]` (no single-tuple shorthand).\n *\n * This file is protocol-pure:\n * - Message type symbols (10 built-ins).\n * - `Message` / `Messages` tuple types.\n * - `MessageTypeRegistration` interface (shape of a registry entry).\n *\n * It does NOT own the registry, tier lookups, or any cross-cutting singleton\n * state — that lives in `GraphReFlyConfig` (see `config.ts`) so custom\n * protocols can build isolated instances. Import this module when you need\n * the symbol constants or the tuple types; import `config.ts` when you need\n * tier / wire-crossing / registry lookups.\n */\n\n/** Subscribe-time handshake. Delivered to each new sink at the top of `subscribe()`. Tier 0. */\nexport const START = Symbol.for(\"graphrefly/START\");\n/** Value delivery (`DATA`, value). Tier 3 — deferred inside `batch()`. */\nexport const DATA = Symbol.for(\"graphrefly/DATA\");\n/** Phase 1: value about to change. Tier 1 — immediate. */\nexport const DIRTY = Symbol.for(\"graphrefly/DIRTY\");\n/** Phase 2: dirty pass completed, value unchanged. Tier 3 — deferred inside `batch()`. */\nexport const RESOLVED = Symbol.for(\"graphrefly/RESOLVED\");\n/** Clear cached state; do not auto-emit. Tier 1 — immediate. */\nexport const INVALIDATE = Symbol.for(\"graphrefly/INVALIDATE\");\n/** Suspend activity. Tier 2 — immediate. */\nexport const PAUSE = Symbol.for(\"graphrefly/PAUSE\");\n/** Resume after pause. Tier 2 — immediate. */\nexport const RESUME = Symbol.for(\"graphrefly/RESUME\");\n/** Permanent cleanup. Tier 5 — deferred to batch phase 4. */\nexport const TEARDOWN = Symbol.for(\"graphrefly/TEARDOWN\");\n/** Clean termination. Tier 4 — deferred to batch phase 3. */\nexport const COMPLETE = Symbol.for(\"graphrefly/COMPLETE\");\n/** Error termination. Tier 4 — deferred to batch phase 3. */\nexport const ERROR = Symbol.for(\"graphrefly/ERROR\");\n\n/** One protocol tuple: `[Type, optional payload]`. */\nexport type Message = readonly [symbol, unknown?];\n\n/** A batch of tuples — the wire shape for `node.down()` / `node.up()`. */\nexport type Messages = readonly Message[];\n\n// ---------------------------------------------------------------------------\n// Interned singletons for payload-free tuples\n// ---------------------------------------------------------------------------\n//\n// Every emission path used to allocate fresh `[[DIRTY]]`, `[[RESOLVED]]`,\n// etc. — two arrays per emit in the hot path. Since none of these tuples\n// carry a payload, one frozen instance is indistinguishable from a\n// fresh one. We intern them at module load and reuse forever. Only\n// `[DATA, v]`, `[ERROR, e]`, `[PAUSE, lockId]`, `[RESUME, lockId]` still\n// allocate per-call because they carry payloads.\n//\n// Downstream code MUST treat these as immutable. `Object.freeze` makes\n// accidental mutation throw in strict mode. Do not `push`, splice, or\n// otherwise mutate a Messages array that came from one of these.\n\n/** Singleton `[DIRTY]` tuple — payload-free, interned. */\nexport const DIRTY_MSG: Message = Object.freeze([DIRTY]) as Message;\n/** Singleton `[RESOLVED]` tuple — payload-free, interned. */\nexport const RESOLVED_MSG: Message = Object.freeze([RESOLVED]) as Message;\n/** Singleton `[INVALIDATE]` tuple — payload-free, interned. */\nexport const INVALIDATE_MSG: Message = Object.freeze([INVALIDATE]) as Message;\n/** Singleton `[START]` tuple — payload-free, interned. */\nexport const START_MSG: Message = Object.freeze([START]) as Message;\n/** Singleton `[COMPLETE]` tuple — payload-free, interned. */\nexport const COMPLETE_MSG: Message = Object.freeze([COMPLETE]) as Message;\n/** Singleton `[TEARDOWN]` tuple — payload-free, interned. */\nexport const TEARDOWN_MSG: Message = Object.freeze([TEARDOWN]) as Message;\n\n/** Pre-wrapped `[[DIRTY]]` for `_emit([DIRTY_ONLY_BATCH])`-style callers. */\nexport const DIRTY_ONLY_BATCH: Messages = Object.freeze([DIRTY_MSG]) as Messages;\n/** Pre-wrapped `[[RESOLVED]]`. */\nexport const RESOLVED_ONLY_BATCH: Messages = Object.freeze([RESOLVED_MSG]) as Messages;\n/** Pre-wrapped `[[INVALIDATE]]`. */\nexport const INVALIDATE_ONLY_BATCH: Messages = Object.freeze([INVALIDATE_MSG]) as Messages;\n/** Pre-wrapped `[[COMPLETE]]`. */\nexport const COMPLETE_ONLY_BATCH: Messages = Object.freeze([COMPLETE_MSG]) as Messages;\n/** Pre-wrapped `[[TEARDOWN]]`. */\nexport const TEARDOWN_ONLY_BATCH: Messages = Object.freeze([TEARDOWN_MSG]) as Messages;\n\n// ---------------------------------------------------------------------------\n// Registry entry shape\n// ---------------------------------------------------------------------------\n\n/**\n * Per-type record stored in a {@link GraphReFlyConfig}'s registry.\n *\n * - `tier` — signal tier (0–5 built-in; custom tiers allowed but should fit\n *   the phase model used by `batch.ts`).\n * - `wireCrossing` — when `true`, forwarded across SSE/WebSocket/worker\n *   adapters. Defaults to `tier >= 3` if omitted in registration input.\n * - `metaPassthrough` — when `false`, this message type is filtered out of\n *   `Graph.signal` deliveries to meta companion nodes (spec §2.3). Meta\n *   companions still receive everything via their primary's own cascade.\n *   Defaults to `true` (meta receives the message).\n */\nexport interface MessageTypeRegistration {\n\ttier: number;\n\twireCrossing: boolean;\n\tmetaPassthrough: boolean;\n}\n\n/**\n * Input accepted by {@link GraphReFlyConfig.registerMessageType}. Only `tier`\n * is required; `wireCrossing` defaults to `tier >= 3`; `metaPassthrough`\n * defaults to `true`.\n */\nexport interface MessageTypeRegistrationInput {\n\ttier: number;\n\twireCrossing?: boolean;\n\tmetaPassthrough?: boolean;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiBO,IAAM,QAAQ,uBAAO,IAAI,kBAAkB;AAE3C,IAAM,OAAO,uBAAO,IAAI,iBAAiB;AAEzC,IAAM,QAAQ,uBAAO,IAAI,kBAAkB;AAE3C,IAAM,WAAW,uBAAO,IAAI,qBAAqB;AAEjD,IAAM,aAAa,uBAAO,IAAI,uBAAuB;AAErD,IAAM,QAAQ,uBAAO,IAAI,kBAAkB;AAE3C,IAAM,SAAS,uBAAO,IAAI,mBAAmB;AAE7C,IAAM,WAAW,uBAAO,IAAI,qBAAqB;AAEjD,IAAM,WAAW,uBAAO,IAAI,qBAAqB;AAEjD,IAAM,QAAQ,uBAAO,IAAI,kBAAkB;AAwB3C,IAAM,YAAqB,OAAO,OAAO,CAAC,KAAK,CAAC;AAEhD,IAAM,eAAwB,OAAO,OAAO,CAAC,QAAQ,CAAC;AAEtD,IAAM,iBAA0B,OAAO,OAAO,CAAC,UAAU,CAAC;AAE1D,IAAM,YAAqB,OAAO,OAAO,CAAC,KAAK,CAAC;AAEhD,IAAM,eAAwB,OAAO,OAAO,CAAC,QAAQ,CAAC;AAEtD,IAAM,eAAwB,OAAO,OAAO,CAAC,QAAQ,CAAC;AAGtD,IAAM,mBAA6B,OAAO,OAAO,CAAC,SAAS,CAAC;AAE5D,IAAM,sBAAgC,OAAO,OAAO,CAAC,YAAY,CAAC;AAElE,IAAM,wBAAkC,OAAO,OAAO,CAAC,cAAc,CAAC;AAEtE,IAAM,sBAAgC,OAAO,OAAO,CAAC,YAAY,CAAC;AAElE,IAAM,sBAAgC,OAAO,OAAO,CAAC,YAAY,CAAC;","names":[]}

package/dist/{chunk-H4RVA4VE.js → chunk-VYPWMZ6H.js}

@@ -1,7 +1,7 @@
 import {
   NodeImpl,
   accessHintForGuard
-} from "./chunk-5DJTTKX3.js";
+} from "./chunk-PHOUUNK7.js";
 
 // src/core/meta.ts
 function resolveDescribeFields(detail, fields) {
@@ -95,4 +95,4 @@ export {
   resolveDescribeFields,
   describeNode
 };
-//# sourceMappingURL=chunk-H4RVA4VE.js.map
+//# sourceMappingURL=chunk-VYPWMZ6H.js.map

package/dist/chunk-WBZOVTYK.js

@@ -0,0 +1,171 @@
+import {
+  vue_exports
+} from "./chunk-MJ2NKQQL.js";
+import {
+  zustand_exports
+} from "./chunk-APFNLIRG.js";
+import {
+  jotai_exports
+} from "./chunk-XGPU467M.js";
+import {
+  nanostores_exports
+} from "./chunk-N6UR7YVY.js";
+import {
+  nestjs_exports
+} from "./chunk-DST5DKZS.js";
+import {
+  react_exports
+} from "./chunk-J22W6HV3.js";
+import {
+  solid_exports
+} from "./chunk-HXZEYDUR.js";
+import {
+  svelte_exports
+} from "./chunk-OHISZPOJ.js";
+import {
+  autoTrackNode,
+  batch,
+  state
+} from "./chunk-PHOUUNK7.js";
+import {
+  COMPLETE,
+  DATA,
+  DIRTY,
+  ERROR,
+  __export
+} from "./chunk-SX52TAR4.js";
+
+// src/compat/index.ts
+var compat_exports = {};
+__export(compat_exports, {
+  jotai: () => jotai_exports,
+  nanostores: () => nanostores_exports,
+  nestjs: () => nestjs_exports,
+  react: () => react_exports,
+  signals: () => signals_exports,
+  solid: () => solid_exports,
+  svelte: () => svelte_exports,
+  vue: () => vue_exports,
+  zustand: () => zustand_exports
+});
+
+// src/compat/signals/index.ts
+var signals_exports = {};
+__export(signals_exports, {
+  Signal: () => Signal
+});
+var trackingStack = [];
+function pull(n) {
+  let val = n.cache;
+  const unsub = n.subscribe((msgs) => {
+    for (const [t, v] of msgs) {
+      if (t === DATA) val = v;
+    }
+  });
+  unsub();
+  return val;
+}
+var SignalState = class {
+  /** @internal */
+  _node;
+  _equals;
+  constructor(initial, opts) {
+    this._equals = opts?.equals ?? Object.is;
+    this._node = state(initial, {
+      ...opts,
+      resubscribable: true,
+      resetOnTeardown: true
+    });
+  }
+  get() {
+    const tracker = trackingStack[trackingStack.length - 1];
+    if (tracker) {
+      if (this._node.status === "sentinel") {
+        pull(this._node);
+      }
+      return tracker(this._node);
+    }
+    if (this._node.status === "sentinel") {
+      return pull(this._node);
+    }
+    return this._node.cache;
+  }
+  set(value) {
+    if (this._equals(this.get(), value)) return;
+    batch(() => {
+      this._node.down([[DIRTY], [DATA, value]]);
+    });
+  }
+};
+var SignalComputed = class {
+  /** @internal */
+  _node;
+  constructor(computation, opts) {
+    this._node = autoTrackNode(
+      (track) => {
+        trackingStack.push(track);
+        try {
+          return computation();
+        } finally {
+          trackingStack.pop();
+        }
+      },
+      {
+        ...opts,
+        describeKind: "derived",
+        resubscribable: true,
+        resetOnTeardown: true
+      }
+    );
+  }
+  get() {
+    const tracker = trackingStack[trackingStack.length - 1];
+    if (tracker) {
+      if (this._node.status === "sentinel") {
+        pull(this._node);
+      }
+      return tracker(this._node);
+    }
+    if (this._node.status === "sentinel") {
+      return pull(this._node);
+    }
+    return this._node.cache;
+  }
+};
+var Signal = {
+  State: SignalState,
+  Computed: SignalComputed,
+  /**
+   * Subscribes to changes on a signal.
+   * Returns an unsubscribe callback.
+   *
+   * @example
+   * ```ts
+   * const count = new Signal.State(0);
+   * const unsub = Signal.sub(count, v => console.log(v));
+   * ```
+   */
+  sub: (signal, callback) => {
+    const handlers = typeof callback === "function" ? { data: callback, error: void 0, complete: void 0 } : callback;
+    let initial = true;
+    return signal._node.subscribe((msgs) => {
+      for (const [t, v] of msgs) {
+        if (t === DATA) {
+          if (initial) {
+            initial = false;
+            continue;
+          }
+          handlers.data?.(v);
+        }
+        if (t === ERROR) handlers.error?.(v);
+        if (t === COMPLETE) handlers.complete?.();
+      }
+    });
+  }
+};
+
+export {
+  signals_exports,
+  compat_exports
+};
+//# sourceMappingURL=chunk-WBZOVTYK.js.map