@kontsedal/olas-core 0.0.5 → 0.1.0

package/dist/root-CPSL5kpR.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"root-CPSL5kpR.cjs","names":["internal","standaloneEffect","factoryOpts"],"sources":["../src/controller/define.ts","../src/devtools.ts","../src/errors.ts","../src/signals/readonly.ts","../src/signals/runtime.ts","../src/utils.ts","../src/query/focus-online.ts","../src/query/structural-share.ts","../src/query/entry.ts","../src/query/infinite.ts","../src/query/keys.ts","../src/query/plugin.ts","../src/query/client.ts","../src/emitter.ts","../src/forms/field.ts","../src/forms/form.ts","../src/query/local.ts","../src/query/mutation.ts","../src/query/use.ts","../src/controller/instance.ts","../src/controller/root.ts"],"sourcesContent":["import type { ControllerDef, Ctx } from './types'\n\ntype InternalControllerDef<Props, Api> = ControllerDef<Props, Api> & {\n  readonly __factory: (ctx: Ctx, props: Props) => Api\n  readonly __name?: string\n}\n\n/** Optional configuration for `defineController`. */\nexport type DefineControllerOptions = {\n  /**\n   * A short, human-readable name for this controller — used in the devtools\n   * tree, `controller:*` events, and error contexts (e.g. `[\"root\",\"board[0]\"]`).\n   *\n   * When omitted, the runtime falls back to `factory.name` (the JS-inferred\n   * function name) or `\"anonymous\"` for arrow-function factories defined\n   * inline. Naming is strongly recommended in app code.\n   */\n  name?: string\n}\n\n/**\n * Create a controller definition. The factory is stored on the returned object\n * and invoked during `createRoot` / `ctx.child` to build instances.\n *\n * `Props` defaults to `void` so a factory written as `(ctx) => ...` is typed\n * as `ControllerDef<void, Api>` — the form `createRoot` requires.\n */\nexport function defineController<Props = void, Api = unknown>(\n  factory: (ctx: Ctx, props: Props) => Api,\n  options?: DefineControllerOptions,\n): ControllerDef<Props, Api> {\n  const def: InternalControllerDef<Props, Api> = {\n    __olas: 'controller',\n    __factory: factory,\n    ...(options?.name !== undefined ? { __name: options.name } : {}),\n  } as InternalControllerDef<Props, Api>\n  return def\n}\n\n/** Internal — extracts the factory from a ControllerDef. */\nexport function getFactory<Props, Api>(\n  def: ControllerDef<Props, Api>,\n): (ctx: Ctx, props: Props) => Api {\n  return (def as InternalControllerDef<Props, Api>).__factory\n}\n\n/** Internal — extracts the explicit `name` option from a ControllerDef, if any. */\nexport function getName<Props, Api>(def: ControllerDef<Props, Api>): string | undefined {\n  return (def as InternalControllerDef<Props, Api>).__name\n}\n","/**\n * Discriminated union of devtools events emitted by a root via\n * `root.__debug.subscribe(handler)`. Spec §20.9. Adding new variants is\n * non-breaking — consumers `switch` on `type` and ignore unknowns.\n */\nexport type DebugEvent =\n  | { type: 'controller:constructed'; path: readonly string[]; props: unknown }\n  | { type: 'controller:suspended'; path: readonly string[] }\n  | { type: 'controller:resumed'; path: readonly string[] }\n  | { type: 'controller:disposed'; path: readonly string[] }\n  | {\n      type: 'cache:subscribed'\n      queryKey: readonly unknown[]\n      subscriberPath: readonly string[]\n    }\n  | { type: 'cache:fetch-start'; queryKey: readonly unknown[] }\n  | { type: 'cache:fetch-success'; queryKey: readonly unknown[]; durationMs: number }\n  | {\n      type: 'cache:fetch-error'\n      queryKey: readonly unknown[]\n      error: unknown\n      durationMs: number\n    }\n  | { type: 'cache:invalidated'; queryKey: readonly unknown[] }\n  | { type: 'cache:gc'; queryKey: readonly unknown[] }\n  | { type: 'mutation:run'; path: readonly string[]; name?: string; vars: unknown }\n  | { type: 'mutation:success'; path: readonly string[]; name?: string; result: unknown }\n  | { type: 'mutation:error'; path: readonly string[]; name?: string; error: unknown }\n  | { type: 'mutation:rollback'; path: readonly string[]; name?: string }\n  | {\n      type: 'field:validated'\n      path: readonly string[]\n      field: string\n      valid: boolean\n      errors: string[]\n    }\n\n/**\n * Snapshot of one live cache entry — produced by `root.__debug.queryEntries()`\n * so devtools panels can show *current data*, not just past fetch events.\n */\nexport type DebugCacheEntry = {\n  key: readonly unknown[]\n  status: 'idle' | 'pending' | 'success' | 'error'\n  data: unknown\n  error: unknown\n  lastUpdatedAt: number | undefined\n  isStale: boolean\n  isFetching: boolean\n  hasPendingMutations: boolean\n}\n\n/**\n * The shape of `root.__debug`. Subscribe to receive every `DebugEvent` until\n * the returned unsubscribe is called.\n *\n * The bus replays a snapshot of the *live controller tree* to every new\n * subscriber synchronously inside `subscribe(...)` — so a panel that mounts\n * after `createRoot()` sees the existing tree immediately, not just future\n * events. Event types other than `controller:*` are not buffered.\n *\n * `queryEntries()` returns a fresh inspector snapshot — current state of\n * every cached entry. Useful for \"what's in the cache right now?\" views.\n */\nexport type DebugBus = {\n  subscribe(handler: (event: DebugEvent) => void): () => void\n  queryEntries(): DebugCacheEntry[]\n}\n\ntype LiveControllerEntry = {\n  path: readonly string[]\n  props: unknown\n  state: 'active' | 'suspended'\n}\n\nfunction pathKey(path: readonly string[]): string {\n  return path.join('\u0000')\n}\n\n/**\n * Per-root devtools event multiplexer. Emit is a no-op when no one is\n * subscribed (one Set size check), so leaving the bus in production has\n * effectively zero cost until a consumer attaches.\n *\n * Internal — exposed to consumers via `root.__debug`.\n *\n * Tracks a snapshot of every live controller (constructed but not yet\n * disposed) and replays construction events to new subscribers, so the\n * devtools tree populates on mount instead of staying blank until the\n * next event.\n */\nexport class DevtoolsEmitter {\n  private handlers = new Set<(event: DebugEvent) => void>()\n  /** Path → entry for every live (constructed, not disposed) controller. */\n  private liveControllers = new Map<string, LiveControllerEntry>()\n\n  subscribe(handler: (event: DebugEvent) => void): () => void {\n    // Replay the snapshot of the current tree, in insertion order. Insertion\n    // order matches construction order, which is parent-before-child (parents\n    // construct their children inside their factories). The replayed handler\n    // gets the same event shape it would have seen live.\n    for (const entry of this.liveControllers.values()) {\n      try {\n        handler({\n          type: 'controller:constructed',\n          path: entry.path,\n          props: entry.props,\n        })\n        if (entry.state === 'suspended') {\n          handler({ type: 'controller:suspended', path: entry.path })\n        }\n      } catch {\n        // Devtools handlers must not break replay for other handlers.\n      }\n    }\n    this.handlers.add(handler)\n    return () => {\n      this.handlers.delete(handler)\n    }\n  }\n\n  emit(event: DebugEvent): void {\n    // Track live controllers regardless of subscriber count — the snapshot\n    // must be accurate even when no one was watching.\n    this.recordLifecycle(event)\n    if (this.handlers.size === 0) return\n    // Snapshot — handlers may unsubscribe.\n    const snapshot = Array.from(this.handlers)\n    for (const handler of snapshot) {\n      try {\n        handler(event)\n      } catch {\n        // Devtools handlers must not break the program.\n      }\n    }\n  }\n\n  get hasSubscribers(): boolean {\n    return this.handlers.size > 0\n  }\n\n  private recordLifecycle(event: DebugEvent): void {\n    if (event.type === 'controller:constructed') {\n      this.liveControllers.set(pathKey(event.path), {\n        path: event.path,\n        props: event.props,\n        state: 'active',\n      })\n      return\n    }\n    if (event.type === 'controller:suspended') {\n      const key = pathKey(event.path)\n      const cur = this.liveControllers.get(key)\n      if (cur !== undefined) cur.state = 'suspended'\n      return\n    }\n    if (event.type === 'controller:resumed') {\n      const key = pathKey(event.path)\n      const cur = this.liveControllers.get(key)\n      if (cur !== undefined) cur.state = 'active'\n      return\n    }\n    if (event.type === 'controller:disposed') {\n      this.liveControllers.delete(pathKey(event.path))\n      return\n    }\n  }\n}\n","/**\n * Context passed to a root's `onError` handler. `kind` identifies where in\n * the controller's surface the throw originated; `controllerPath` is the\n * path from root to the controller that owned the failing code; `queryKey`\n * is set for `cache` kinds. Spec §12, §20.9.\n *\n * `'plugin'` is used for exceptions raised by `QueryClientPlugin` callbacks\n * (`@kontsedal/olas-cross-tab` and friends); SPEC §13.2.\n *\n * The remaining fields are correlation hooks for telemetry adapters\n * (Sentry / OpenTelemetry breadcrumbs / Datadog RUM): `eventId` is a stable\n * per-dispatch UUID, `timestamp` is wall-clock ms, `attempt` is the\n * 0-based retry attempt for cache/mutation paths, `cause` is the\n * `Error.cause`-style underlying error if the surfaced error wrapped it,\n * `pluginName` identifies the throwing plugin (set only when `kind ==\n * 'plugin'`).\n */\nexport type ErrorContext = {\n  kind: 'effect' | 'cache' | 'mutation' | 'emitter' | 'construction' | 'plugin'\n  controllerPath: readonly string[]\n  queryKey?: readonly unknown[]\n  eventId: string\n  timestamp: number\n  attempt?: number\n  cause?: unknown\n  pluginName?: string\n}\n\n/** Signature of `RootOptions.onError`. */\nexport type ErrorHandler = (err: unknown, context: ErrorContext) => void\n\n/**\n * Partial context — `dispatchError` fills in `eventId` + `timestamp`. Call\n * sites pass the diagnostic fields they know about; the dispatcher stamps\n * the per-dispatch correlation data.\n */\nexport type ErrorContextInput = Omit<ErrorContext, 'eventId' | 'timestamp'>\n\nconst defaultHandler: ErrorHandler = (err, context) => {\n  // eslint-disable-next-line no-console\n  console.error('[olas]', context, err)\n}\n\nlet eventCounter = 0\nfunction nextEventId(): string {\n  // 24 bits of randomness + a monotonic counter. Cheap (no crypto) and\n  // unique-per-process. Adapters that need stronger guarantees can\n  // re-stamp inside their own handler.\n  eventCounter = (eventCounter + 1) >>> 0\n  const r = ((Math.random() * 0x1000000) | 0).toString(16).padStart(6, '0')\n  const c = eventCounter.toString(16).padStart(6, '0')\n  return `e_${r}${c}`\n}\n\n/**\n * Dispatch an error to a user-provided handler, falling back to console.error.\n * The handler itself is wrapped — if it throws, the throw is swallowed and\n * logged so an `onError` bug never tears down the tree.\n *\n * Internal — used by the controller container and query client.\n */\nexport function dispatchError(\n  handler: ErrorHandler | undefined,\n  err: unknown,\n  context: ErrorContextInput,\n): void {\n  const fn = handler ?? defaultHandler\n  const full: ErrorContext = {\n    ...context,\n    eventId: nextEventId(),\n    timestamp: Date.now(),\n  }\n  try {\n    fn(err, full)\n  } catch (handlerErr) {\n    try {\n      // eslint-disable-next-line no-console\n      console.error('[olas] onError handler threw:', handlerErr)\n      // eslint-disable-next-line no-console\n      console.error('[olas] original error:', err, full)\n    } catch {\n      // Console itself failed — give up silently.\n    }\n  }\n}\n","import type { ReadSignal } from './types'\n\n/**\n * Project a Signal (or any object with a reactive `value` + `peek` + `subscribe`)\n * as a `ReadSignal`. The returned object does not expose `set` / `update` /\n * settable `value`, so it can be returned from APIs without callers mutating it.\n *\n * Internal helper — not exported from the package's public surface.\n */\nexport function readOnly<T>(source: ReadSignal<T>): ReadSignal<T> {\n  return Object.freeze({\n    get value() {\n      return source.value\n    },\n    peek() {\n      return source.peek()\n    },\n    subscribe(handler: (value: T) => void) {\n      return source.subscribe(handler)\n    },\n    subscribeChanges(handler: (value: T) => void) {\n      return source.subscribeChanges(handler)\n    },\n  })\n}\n","import {\n  batch as _batch,\n  computed as _computed,\n  effect as _effect,\n  signal as _signal,\n  untracked as _untracked,\n  type ReadonlySignal as PreactReadonlySignal,\n  type Signal as PreactSignal,\n} from '@preact/signals-core'\n\nimport type { Computed, Signal } from './types'\n\nclass SignalImpl<T> implements Signal<T> {\n  private readonly inner: PreactSignal<T>\n\n  constructor(initial: T) {\n    this.inner = _signal<T>(initial)\n  }\n\n  get value(): T {\n    return this.inner.value\n  }\n\n  set value(next: T) {\n    this.inner.value = next\n  }\n\n  peek(): T {\n    return this.inner.peek()\n  }\n\n  subscribe(handler: (value: T) => void): () => void {\n    return this.inner.subscribe(handler)\n  }\n\n  subscribeChanges(handler: (value: T) => void): () => void {\n    return subscribeChangesImpl(this.inner, handler)\n  }\n\n  set(value: T): void {\n    this.inner.value = value\n  }\n\n  update(fn: (prev: T) => T): void {\n    this.inner.value = fn(this.inner.peek())\n  }\n}\n\nclass ComputedImpl<T> implements Computed<T> {\n  private readonly inner: PreactReadonlySignal<T>\n\n  constructor(fn: () => T) {\n    this.inner = _computed<T>(fn)\n  }\n\n  get value(): T {\n    return this.inner.value\n  }\n\n  peek(): T {\n    return this.inner.peek()\n  }\n\n  subscribe(handler: (value: T) => void): () => void {\n    return this.inner.subscribe(handler)\n  }\n\n  subscribeChanges(handler: (value: T) => void): () => void {\n    return subscribeChangesImpl(this.inner, handler)\n  }\n}\n\n/**\n * Shared skip-initial wrapper around `signal.subscribe`. Preact fires the\n * subscribe callback synchronously with the current value (the \"initial\n * fire\"); the wrapper swallows it and forwards every subsequent change.\n */\nfunction subscribeChangesImpl<T>(\n  inner: PreactSignal<T> | PreactReadonlySignal<T>,\n  handler: (value: T) => void,\n): () => void {\n  let initial = true\n  return inner.subscribe((value) => {\n    if (initial) {\n      initial = false\n      return\n    }\n    handler(value)\n  })\n}\n\n/**\n * Create a writable `Signal<T>`. Reads track the current auto-tracking scope\n * (effect / computed); writes notify all subscribers (deduped via `Object.is`).\n *\n * Spec §20.1. For a single-pass non-tracked read use `signal.peek()`.\n */\nexport function signal<T>(initial: T): Signal<T> {\n  return new SignalImpl(initial)\n}\n\n/**\n * Create a `Computed<T>` — a read-only derived signal. The provided `fn` is\n * re-evaluated whenever a signal it read during its last run changes; the\n * resulting value is cached until then.\n *\n * Spec §20.1. The graph is glitch-free: a `computed` re-runs at most once per\n * batched-write cycle.\n */\nexport function computed<T>(fn: () => T): Computed<T> {\n  return new ComputedImpl(fn)\n}\n\n/**\n * Run `fn` immediately and again whenever any signal it reads changes. If\n * `fn` returns a function, that function is called as a cleanup before the\n * next re-run and on dispose.\n *\n * Returns a `dispose` function. Inside a controller use `ctx.effect(...)`\n * instead — that variant is auto-disposed with the controller.\n */\nexport function effect(fn: () => void | (() => void)): () => void {\n  return _effect(fn)\n}\n\n/**\n * Batch synchronous signal writes so subscribers see one notification at the\n * end of the batch rather than one per write. Returns whatever `fn` returns.\n */\nexport function batch<T>(fn: () => T): T {\n  return _batch(fn)\n}\n\n/**\n * Run `fn` with auto-tracking suppressed — signals read inside don't become\n * dependencies of the surrounding `computed` / `effect`. Useful for \"read\n * these signals once to log them\" or for snapshotting state inside an effect\n * without subscribing to it. For a single-signal peek, prefer `signal.peek()`.\n */\nexport function untracked<T>(fn: () => T): T {\n  return _untracked(fn)\n}\n","/**\n * True iff `err` looks like an AbortError. Matches the standard `DOMException`\n * shape thrown by `AbortController` AND any object whose `name === 'AbortError'`\n * — that covers axios / msw / user-thrown plain Errors that signal abort.\n *\n * Spec: §20.12. Node 17+ exposes a global DOMException, so the instanceof\n * branch works server-side; the name-based branch is the portable fallback.\n */\nexport function isAbortError(err: unknown): boolean {\n  if (typeof DOMException !== 'undefined' && err instanceof DOMException) {\n    return err.name === 'AbortError'\n  }\n  if (err != null && typeof err === 'object' && 'name' in err) {\n    return (err as { name: unknown }).name === 'AbortError'\n  }\n  return false\n}\n\n/**\n * `setTimeout` wrapped in a promise that rejects with `AbortError` if the\n * passed signal fires. Internal — used by the retry loops in `Entry`,\n * `InfiniteEntry`, and `Mutation` so a slow backoff never blocks a supersede.\n */\nexport function abortableSleep(ms: number, signal: AbortSignal): Promise<void> {\n  return new Promise((resolve, reject) => {\n    if (signal.aborted) {\n      reject(abortReason(signal))\n      return\n    }\n    const timer = setTimeout(() => {\n      signal.removeEventListener('abort', onAbort)\n      resolve()\n    }, ms)\n    const onAbort = () => {\n      clearTimeout(timer)\n      signal.removeEventListener('abort', onAbort)\n      reject(abortReason(signal))\n    }\n    signal.addEventListener('abort', onAbort, { once: true })\n  })\n}\n\n/**\n * Read the caller-supplied abort reason if present, falling back to the\n * canonical `DOMException('Aborted', 'AbortError')`. `signal.reason` lets\n * users propagate context (e.g. \"supersededByLatestWins\") through abort\n * chains — discarding it would force every caller to wrap with custom\n * cancellation tokens.\n */\nfunction abortReason(signal: AbortSignal): unknown {\n  const reason: unknown = (signal as { reason?: unknown }).reason\n  if (reason !== undefined) return reason\n  return new DOMException('Aborted', 'AbortError')\n}\n","/**\n * Lazy pub/sub for window-focus and reconnect events.\n *\n * Each `ClientEntry` with `refetchOnWindowFocus` or `refetchOnReconnect` set\n * subscribes here on its first subscriber and unsubscribes when it has none.\n * We install a single window/document listener for each event the first time\n * anyone subscribes; after that, we fan out to all subscribers ourselves.\n *\n * SSR-safe: no-ops when `window` is undefined. Spec §5.9.\n */\n\ntype Sub = () => void\n\nconst focusSubs = new Set<Sub>()\nconst onlineSubs = new Set<Sub>()\n\nfunction fireFocus(): void {\n  for (const fn of focusSubs) {\n    try {\n      fn()\n    } catch {\n      // Subscriber failures must not break the fan-out.\n    }\n  }\n}\n\nfunction fireOnline(): void {\n  for (const fn of onlineSubs) {\n    try {\n      fn()\n    } catch {\n      // ditto\n    }\n  }\n}\n\n// A tab-return commonly fires BOTH `focus` and `visibilitychange` in the same\n// tick. Coalesce them into a single `fireFocus` via a microtask flag so\n// subscribers refetch once, not twice (T3.9).\nlet focusScheduled = false\nfunction scheduleFocus(): void {\n  if (focusScheduled) return\n  focusScheduled = true\n  queueMicrotask(() => {\n    focusScheduled = false\n    fireFocus()\n  })\n}\n\nfunction onVisibilityChange(): void {\n  if (document.visibilityState === 'visible') scheduleFocus()\n}\n\nlet focusInstalled = false\nlet onlineInstalled = false\n\nfunction installFocus(): void {\n  if (focusInstalled) return\n  if (typeof window === 'undefined') return\n  window.addEventListener('focus', scheduleFocus)\n  if (typeof document !== 'undefined') {\n    document.addEventListener('visibilitychange', onVisibilityChange)\n  }\n  focusInstalled = true\n}\n\nfunction uninstallFocus(): void {\n  if (!focusInstalled) return\n  if (typeof window === 'undefined') return\n  window.removeEventListener('focus', scheduleFocus)\n  if (typeof document !== 'undefined') {\n    document.removeEventListener('visibilitychange', onVisibilityChange)\n  }\n  focusInstalled = false\n}\n\nfunction installOnline(): void {\n  if (onlineInstalled) return\n  if (typeof window === 'undefined') return\n  window.addEventListener('online', fireOnline)\n  onlineInstalled = true\n}\n\nfunction uninstallOnline(): void {\n  if (!onlineInstalled) return\n  if (typeof window === 'undefined') return\n  window.removeEventListener('online', fireOnline)\n  onlineInstalled = false\n}\n\nexport function subscribeWindowFocus(fn: Sub): () => void {\n  installFocus()\n  focusSubs.add(fn)\n  return () => {\n    focusSubs.delete(fn)\n    if (focusSubs.size === 0) uninstallFocus()\n  }\n}\n\nexport function subscribeReconnect(fn: Sub): () => void {\n  installOnline()\n  onlineSubs.add(fn)\n  return () => {\n    onlineSubs.delete(fn)\n    if (onlineSubs.size === 0) uninstallOnline()\n  }\n}\n\n/** Test-only — force-detach global listeners regardless of subscriber state. */\nexport function __resetFocusOnlineForTests(): void {\n  focusSubs.clear()\n  onlineSubs.clear()\n  uninstallFocus()\n  uninstallOnline()\n}\n","/**\n * Walk `prev` and `next` in parallel. Wherever a sub-tree in `next` is\n * structurally equal to the corresponding sub-tree in `prev`, return `prev`'s\n * reference for that sub-tree. Otherwise return `next`'s.\n *\n * Result: a value that is `===` to `prev` on every refetch where the payload\n * didn't actually change, and shares maximum ref-identity on partial changes.\n * Downstream `computed`s and React `useSyncExternalStore` snapshots stop\n * thrashing because reference equality holds where content equality holds.\n *\n * Bails (returns the `next` ref unchanged, no recursion) on:\n *   - Mismatched constructors / different `typeof` between `prev` and `next`\n *   - `Map`, `Set`, `Date`, `RegExp`, class instances (anything where the\n *     plain-object / array fast path isn't safe)\n *   - Functions, symbols, promises\n *\n * Handles cycles via a `WeakSet` of in-progress objects — a self-referential\n * payload that compares structurally identical against itself won't loop.\n */\nexport function structuralShare<T>(prev: T, next: T): T {\n  // Identity short-circuit — both branches see the exact same allocation.\n  if (Object.is(prev, next)) return prev\n  return walk(prev, next, new WeakSet<object>()) as T\n}\n\nfunction walk(prev: unknown, next: unknown, seen: WeakSet<object>): unknown {\n  if (Object.is(prev, next)) return prev\n  if (prev === null || next === null) return next\n  if (typeof prev !== 'object' || typeof next !== 'object') return next\n\n  // Cycle guard. If either side is already on the in-flight stack, we can't\n  // safely recurse — fall back to `next`'s ref. Real cyclic payloads are\n  // exceedingly rare in HTTP responses; defensive bail.\n  if (seen.has(prev as object) || seen.has(next as object)) return next\n\n  // Arrays — only matched against arrays.\n  if (Array.isArray(prev) && Array.isArray(next)) {\n    return walkArray(prev, next, seen)\n  }\n  if (Array.isArray(prev) !== Array.isArray(next)) return next\n\n  // Constructor / prototype check. Plain objects have `Object.prototype`\n  // (and a Map/Set/Date/RegExp/class instance does not). We require an exact\n  // prototype match on both sides AND `Object.prototype` so we never deep-\n  // walk into class instances whose identity might encode hidden state.\n  const prevProto = Object.getPrototypeOf(prev)\n  if (prevProto !== Object.getPrototypeOf(next)) return next\n  if (prevProto !== Object.prototype && prevProto !== null) return next\n\n  return walkPlainObject(prev as Record<string, unknown>, next as Record<string, unknown>, seen)\n}\n\nfunction walkArray(\n  prev: ReadonlyArray<unknown>,\n  next: ReadonlyArray<unknown>,\n  seen: WeakSet<object>,\n): ReadonlyArray<unknown> {\n  if (prev.length !== next.length) {\n    // Length changed — we can still preserve refs for matching prefixes via\n    // index-aligned walking. That's the right trade-off for tables / lists:\n    // appending an item keeps the head's refs stable, prepending invalidates\n    // everything (which it does anyway — items shifted).\n  }\n  seen.add(prev)\n  seen.add(next)\n  try {\n    const out: unknown[] = new Array(next.length)\n    let changed = next.length !== prev.length\n    for (let i = 0; i < next.length; i++) {\n      const prevItem = i < prev.length ? prev[i] : undefined\n      const shared = walk(prevItem, next[i], seen)\n      out[i] = shared\n      if (shared !== prev[i]) changed = true\n    }\n    if (!changed) return prev\n    return out\n  } finally {\n    seen.delete(prev)\n    seen.delete(next)\n  }\n}\n\nfunction walkPlainObject(\n  prev: Record<string, unknown>,\n  next: Record<string, unknown>,\n  seen: WeakSet<object>,\n): Record<string, unknown> {\n  const prevKeys = Object.keys(prev)\n  const nextKeys = Object.keys(next)\n  let changed = prevKeys.length !== nextKeys.length\n\n  seen.add(prev)\n  seen.add(next)\n  try {\n    const out: Record<string, unknown> = {}\n    // Iterate `next`'s keys in order so the output preserves payload's\n    // key ordering (matters for downstream `JSON.stringify` callers and\n    // for predictable React reconciliation when an object is rendered).\n    for (const key of nextKeys) {\n      const shared = walk(prev[key], next[key], seen)\n      out[key] = shared\n      if (shared !== prev[key]) changed = true\n      else if (!(key in prev)) changed = true\n    }\n    // Keys present in `prev` but not in `next` are dropped — that's already\n    // expressed by `next.keys`. But the length-mismatch flag above catches\n    // the changed shape.\n    if (!changed) return prev\n    return out\n  } finally {\n    seen.delete(prev)\n    seen.delete(next)\n  }\n}\n","import { batch, type Signal, signal } from '../signals'\nimport { abortableSleep, isAbortError } from '../utils'\nimport { subscribeReconnect } from './focus-online'\nimport { structuralShare } from './structural-share'\nimport type { AsyncStatus, NetworkMode, RetryDelay, RetryPolicy, Snapshot } from './types'\n\nexport type EntryEvents = {\n  onFetchStart?: () => void\n  onFetchSuccess?: (durationMs: number) => void\n  onFetchError?: (durationMs: number, error: unknown) => void\n}\n\nexport type EntryOptions<T> = {\n  fetcher: () => (signal: AbortSignal) => Promise<T>\n  staleTime?: number\n  initialData?: T | undefined\n  initialUpdatedAt?: number | undefined\n  retry?: RetryPolicy\n  retryDelay?: RetryDelay\n  networkMode?: NetworkMode\n  structuralShare?: boolean\n  events?: EntryEvents\n  /**\n   * Fired after a successful fetch result is written to `data`. Used by the\n   * `QueryClient` to emit a plugin-visible `SetDataEvent` with\n   * `source: 'fetch'` (devtools events live on `events` above). Distinct\n   * from `events.onFetchSuccess`, which carries timing info for the\n   * devtools bus.\n   *\n   * Privileged closure — set up by `ClientEntry` to call\n   * `client.emitSetData(...)`, which already individually try/catches every\n   * plugin via `callPlugin` and routes thrown exceptions through `onError`\n   * with `kind: 'plugin'`. Not wrapped here; an exception escaping this\n   * callback is a programming error in core (not a plugin) and SHOULD\n   * surface so the bug is visible.\n   */\n  onSuccessData?: (data: T) => void\n}\n\ntype SnapshotRecord<T> = {\n  id: number\n  prev: T | undefined\n  live: boolean\n}\n\n/**\n * One cache entry's state machine. Owns the AsyncState signals, race\n * protection, retry loop, optimistic-update snapshot stack.\n *\n * Internal — not exported from the public surface.\n */\nexport class Entry<T> {\n  readonly data: Signal<T | undefined>\n  readonly error: Signal<unknown | undefined> = signal(undefined)\n  readonly status: Signal<AsyncStatus>\n  readonly isLoading: Signal<boolean> = signal(false)\n  readonly isFetching: Signal<boolean> = signal(false)\n  readonly lastUpdatedAt: Signal<number | undefined>\n  readonly hasPendingMutations: Signal<boolean> = signal(false)\n  readonly isStale: Signal<boolean> = signal(true)\n  /** True while a fetch is parked waiting for reconnect (online-mode defer or\n   *  offlineFirst network-error park). See spec §5.5, T3.5. */\n  readonly isPaused: Signal<boolean> = signal(false)\n\n  fetcherProvider: () => (signal: AbortSignal) => Promise<T>\n  private staleTime: number\n  private retry: RetryPolicy\n  private retryDelay: RetryDelay | undefined\n  private networkMode: NetworkMode\n  private structuralShareEnabled: boolean\n  private currentFetchId = 0\n  private currentAbort: AbortController | null = null\n  private staleTimer: ReturnType<typeof setTimeout> | null = null\n  /** Set by `markStale()` (invalidate without fetch); forces `isStaleNow()`\n   *  true until the next successful fetch clears it. Spec §5.7, T3.9. */\n  private forcedStale = false\n  private snapshots: Array<SnapshotRecord<T>> = []\n  private nextSnapshotId = 0\n  private disposed = false\n  /** Subscribers to reconnect — installed lazily when a deferred fetch lands. */\n  private reconnectUnsub: (() => void) | null = null\n  /**\n   * Set of deferred-fetch resolvers waiting for reconnect (online mode).\n   * Stored at `unknown` to keep `Entry<T>` covariant in `T` — same trick as\n   * `onSuccessData`. Each resolver is fed the same value from\n   * `applySuccess`, which is `T`, then cast at the fan-out call site.\n   */\n  private deferredResolvers: Array<{\n    resolve: (value: unknown) => void\n    reject: (reason?: unknown) => void\n  }> = []\n  private readonly events: EntryEvents\n  // Stored at `unknown` (not `T`) to keep `Entry<T>` covariant in `T`. The\n  // callback only forwards the value through; Entry never inspects it.\n  private readonly onSuccessData: ((data: unknown) => void) | undefined\n  private fetchStartTime = 0\n  /**\n   * Promises returned by `firstValue()` that haven't settled. Rejected on\n   * `dispose()` so awaiters (most notably `prefetch` and `subscription.firstValue`)\n   * don't hang when the controller tree is torn down mid-fetch.\n   */\n  private pendingFirstValueRejects: Array<(err: unknown) => void> = []\n\n  constructor(options: EntryOptions<T>) {\n    this.fetcherProvider = options.fetcher\n    this.staleTime = options.staleTime ?? 0\n    this.retry = options.retry ?? 0\n    // Left undefined when not given so `computeDelay` can pick the exponential\n    // default only when retries are actually enabled (T3.9).\n    this.retryDelay = options.retryDelay\n    this.networkMode = options.networkMode ?? 'online'\n    this.structuralShareEnabled = options.structuralShare ?? true\n    this.events = options.events ?? {}\n    this.onSuccessData = options.onSuccessData as ((data: unknown) => void) | undefined\n    this.data = signal<T | undefined>(options.initialData)\n    if (options.initialData !== undefined) {\n      this.status = signal<AsyncStatus>('success')\n      // For hydrated data, derive `isStale` from the *actual* age of the\n      // payload, not the timer alone — otherwise a payload older than\n      // `staleTime` would read `isStale === false` until the (fresh, full-\n      // length) timer fires. `isStaleNow()` already does this correctly for\n      // the subscribe-time refetch check; mirror that here for the signal.\n      if (this.staleTime === 0) {\n        this.isStale.set(true)\n      } else {\n        const last = options.initialUpdatedAt\n        const alreadyStale = last === undefined || Date.now() - last >= this.staleTime\n        this.isStale.set(alreadyStale)\n        // Only schedule a timer if the data isn't already stale. If it is,\n        // there's nothing to wait for.\n        if (!alreadyStale) {\n          const remaining = this.staleTime - (Date.now() - (last as number))\n          this.staleTimer = setTimeout(() => {\n            this.staleTimer = null\n            if (!this.disposed) this.isStale.set(true)\n          }, remaining)\n        }\n      }\n    } else {\n      this.status = signal<AsyncStatus>('idle')\n    }\n    this.lastUpdatedAt = signal<number | undefined>(options.initialUpdatedAt)\n  }\n\n  startFetch(): Promise<T> {\n    if (this.disposed) {\n      return Promise.reject(new Error('Entry disposed'))\n    }\n    // `online` mode: defer until reconnect when the browser thinks we're\n    // offline. Don't touch status — the UI keeps showing last-known data.\n    // `always` / `offlineFirst` proceed to the fetcher; `offlineFirst` will\n    // re-handle a network rejection inside the catch path.\n    if (this.networkMode === 'online' && this.isOffline()) {\n      return this.scheduleDeferredFetch()\n    }\n    const myId = ++this.currentFetchId\n    this.currentAbort?.abort()\n    const abort = new AbortController()\n    this.currentAbort = abort\n\n    const previouslyHadData = this.data.peek() !== undefined\n    batch(() => {\n      this.status.set('pending')\n      this.isFetching.set(true)\n      this.isLoading.set(!previouslyHadData)\n      this.isPaused.set(false)\n    })\n\n    this.fetchStartTime = Date.now()\n    try {\n      this.events.onFetchStart?.()\n    } catch {\n      // devtools handlers must not break the program.\n    }\n\n    return this.runWithRetry(myId, abort)\n  }\n\n  private isOffline(): boolean {\n    return typeof navigator !== 'undefined' && navigator.onLine === false\n  }\n\n  private scheduleDeferredFetch(): Promise<T> {\n    // Parked waiting for reconnect — surface it so the UI can show \"waiting\n    // for network\" instead of a silent `idle` (T3.5). Cleared when the fetch\n    // actually starts (`startFetch` batch) or settles.\n    this.isPaused.set(true)\n    // Lazy-install one reconnect listener for the entry. Cleared on dispose\n    // and on the first successful drain. Each call appends a fresh resolver.\n    if (this.reconnectUnsub === null) {\n      this.reconnectUnsub = subscribeReconnect(() => this.drainDeferred())\n    }\n    return new Promise<T>((resolve, reject) => {\n      this.deferredResolvers.push({\n        resolve: resolve as (value: unknown) => void,\n        reject,\n      })\n    })\n  }\n\n  private drainDeferred(): void {\n    if (this.deferredResolvers.length === 0) return\n    if (this.disposed) return\n    const pending = this.deferredResolvers\n    this.deferredResolvers = []\n    // One real fetch fans out to every pending resolver. Tearing down the\n    // reconnect listener avoids accumulating listeners across many deferrals.\n    if (this.reconnectUnsub !== null) {\n      this.reconnectUnsub()\n      this.reconnectUnsub = null\n    }\n    this.startFetch().then(\n      (value) => {\n        for (const p of pending) p.resolve(value)\n      },\n      (err) => {\n        for (const p of pending) p.reject(err)\n      },\n    )\n  }\n\n  private async runWithRetry(myId: number, abort: AbortController): Promise<T> {\n    let attempt = 0\n    while (true) {\n      if (myId !== this.currentFetchId || this.disposed) {\n        throw new DOMException('Superseded', 'AbortError')\n      }\n      try {\n        const fetcher = this.fetcherProvider()\n        const result = await fetcher(abort.signal)\n        if (myId !== this.currentFetchId || this.disposed) {\n          throw new DOMException('Superseded', 'AbortError')\n        }\n        return this.applySuccess(result)\n      } catch (err) {\n        if (myId !== this.currentFetchId || this.disposed || isAbortError(err)) {\n          throw err\n        }\n        // offlineFirst: a network-shaped failure while offline parks the entry\n        // (wait for reconnect, then retry) instead of surfacing the error. A\n        // `fetch()` network failure surfaces as a `TypeError`; `AbortError` is\n        // already handled above. Spec §5.5, T3.5.\n        if (this.networkMode === 'offlineFirst' && this.isOffline() && err instanceof TypeError) {\n          batch(() => {\n            this.isFetching.set(false)\n            this.isLoading.set(false)\n            this.status.set(this.data.peek() !== undefined ? 'success' : 'idle')\n          })\n          return this.scheduleDeferredFetch()\n        }\n        if (!this.shouldRetry(attempt, err)) {\n          return this.applyFailure(err)\n        }\n        const delay = this.computeDelay(attempt)\n        await abortableSleep(delay, abort.signal)\n        attempt += 1\n      }\n    }\n  }\n\n  private shouldRetry(attempt: number, err: unknown): boolean {\n    const retry = this.retry\n    if (retry === 0) return false\n    if (typeof retry === 'number') return attempt < retry\n    return retry(attempt, err)\n  }\n\n  private computeDelay(attempt: number): number {\n    const d = this.retryDelay\n    // Default to exponential backoff (capped at 30s) when `retry > 0` but no\n    // `retryDelay` was given — a constant 1s default hammered a flapping\n    // backend on every attempt (T3.9). Explicit number/function still wins.\n    if (d === undefined) return Math.min(1000 * 2 ** attempt, 30_000)\n    return typeof d === 'function' ? d(attempt) : d\n  }\n\n  private applySuccess(result: T): T {\n    // Structurally share with the previous value so unchanged sub-trees\n    // keep their `===` identity. Downstream `computed`s and React snapshots\n    // stop thrashing on no-op refetches. Bails on Maps/Sets/class instances\n    // — see `structural-share.ts`. Disabled per-query via `structuralShare:\n    // false` for large payloads where the O(payload) walk costs more than\n    // the re-render savings.\n    const prev = this.data.peek() as T | undefined\n    const shared =\n      prev === undefined || !this.structuralShareEnabled ? result : structuralShare(prev, result)\n    // Rebase live optimistic snapshots onto the fresh server truth: a\n    // subsequent rollback should restore to THIS value, not the pre-fetch\n    // baseline the snapshot captured before the fetch resolved. Without this,\n    // a fetch landing during an optimistic mutation, then that mutation\n    // failing, resurrects pre-fetch data (spec §6.4, T3.4).\n    if (this.snapshots.length > 0) {\n      for (const s of this.snapshots) s.prev = shared\n    }\n    batch(() => {\n      this.data.set(shared)\n      this.error.set(undefined)\n      this.status.set('success')\n      this.isLoading.set(false)\n      this.isFetching.set(false)\n      this.lastUpdatedAt.set(Date.now())\n      this.isStale.set(this.staleTime === 0)\n    })\n    this.forcedStale = false // fresh data clears a prior markStale() (T3.9)\n    if (this.staleTime > 0) this.scheduleStaleness()\n    try {\n      this.events.onFetchSuccess?.(Date.now() - this.fetchStartTime)\n    } catch {\n      // devtools handlers must not break the program.\n    }\n    this.onSuccessData?.(shared)\n    return shared\n  }\n\n  private applyFailure(err: unknown): never {\n    batch(() => {\n      this.error.set(err)\n      this.status.set('error')\n      this.isLoading.set(false)\n      this.isFetching.set(false)\n    })\n    try {\n      this.events.onFetchError?.(Date.now() - this.fetchStartTime, err)\n    } catch {\n      // devtools handlers must not break the program.\n    }\n    throw err\n  }\n\n  private scheduleStaleness(): void {\n    if (this.staleTimer != null) clearTimeout(this.staleTimer)\n    if (this.staleTime > 0) {\n      this.staleTimer = setTimeout(() => {\n        this.staleTimer = null\n        if (!this.disposed) this.isStale.set(true)\n      }, this.staleTime)\n    }\n  }\n\n  refetch(): Promise<T> {\n    return this.startFetch()\n  }\n\n  /**\n   * Apply a server-supplied data + timestamp without going through the\n   * fetcher path. Used by streaming SSR hydration: each `<Suspense>` boundary\n   * that resolves on the server pushes its entry's data to the client, and\n   * the client routes it through here so the entry transitions to `success`\n   * without burning the user's fetcher.\n   *\n   * Distinct from `setData`: no Snapshot returned (no rollback semantics —\n   * this is canonical data, not an optimistic patch), no\n   * `hasPendingMutations` flip, and `lastUpdatedAt` honors the supplied\n   * server timestamp instead of `Date.now()`. Also bumps `currentFetchId`\n   * so any in-flight fetch supersedes itself rather than overwriting the\n   * fresher hydrated value.\n   */\n  applyHydration(data: T, lastUpdatedAt: number): void {\n    if (this.disposed) return\n    // Bump fetch id: an inflight fetcher will now lose the supersede check\n    // in `runWithRetry` and won't write its (likely-stale) result.\n    this.currentFetchId += 1\n    this.currentAbort?.abort()\n    this.currentAbort = null\n    if (this.staleTimer !== null) {\n      clearTimeout(this.staleTimer)\n      this.staleTimer = null\n    }\n    const alreadyStale = this.staleTime === 0 || Date.now() - lastUpdatedAt >= this.staleTime\n    batch(() => {\n      this.data.set(data)\n      this.error.set(undefined)\n      this.status.set('success')\n      this.isLoading.set(false)\n      this.isFetching.set(false)\n      this.lastUpdatedAt.set(lastUpdatedAt)\n      this.isStale.set(alreadyStale)\n    })\n    if (!alreadyStale && this.staleTime > 0) {\n      const remaining = this.staleTime - (Date.now() - lastUpdatedAt)\n      this.staleTimer = setTimeout(() => {\n        this.staleTimer = null\n        if (!this.disposed) this.isStale.set(true)\n      }, remaining)\n    }\n    this.onSuccessData?.(data)\n    // Resolve any awaiters parked in firstValue / promise.\n    if (this.pendingFirstValueRejects.length > 0) {\n      // First-value awaiters are subscribed to `this.status`; the batched\n      // `status.set('success')` above wakes them through the normal\n      // subscribe path. We don't need to do anything else here.\n    }\n  }\n\n  /**\n   * Force this entry stale WITHOUT fetching. `isStaleNow()` returns true until\n   * the next successful fetch clears the flag, so the next subscriber refetches.\n   * Used by `client.invalidate` for subscriber-less entries — spec §5.7 says\n   * invalidate refetches only IF subscribed (T3.9).\n   */\n  markStale(): void {\n    if (this.disposed) return\n    if (this.staleTimer != null) {\n      clearTimeout(this.staleTimer)\n      this.staleTimer = null\n    }\n    this.forcedStale = true\n    this.isStale.set(true)\n  }\n\n  invalidate(): Promise<T> {\n    this.markStale()\n    return this.startFetch()\n  }\n\n  reset(): void {\n    if (this.disposed) return\n    batch(() => {\n      this.error.set(undefined)\n      this.status.set(this.data.peek() !== undefined ? 'success' : 'idle')\n    })\n  }\n\n  /**\n   * Cancel an in-flight fetch without touching `data`. Aborts the current\n   * request and supersedes it (bumps `currentFetchId` so its result can never\n   * land), then restores a settled status: `'success'` if data exists, else\n   * `'idle'`. No-op when nothing is fetching. This is the primitive behind\n   * `query.cancel(...)` / `subscription.cancel()`: the canonical optimistic\n   * recipe cancels outgoing refetches before an optimistic `setData` so a\n   * stale response can't clobber the optimistic value (spec §5, §6.4). T3.4.\n   */\n  cancel(): void {\n    if (this.disposed || !this.isFetching.peek()) return\n    this.currentFetchId += 1\n    this.currentAbort?.abort()\n    this.currentAbort = null\n    batch(() => {\n      this.isFetching.set(false)\n      this.isLoading.set(false)\n      this.status.set(this.data.peek() !== undefined ? 'success' : 'idle')\n    })\n  }\n\n  /**\n   * Write data into the entry.\n   *\n   * `track` (default `true`) is the optimistic-update path: it pushes a\n   * snapshot record and flips `hasPendingMutations`, so the returned\n   * `Snapshot.rollback()` can restore the pre-write baseline and\n   * `finalize()` commits it. This is what `query.setData(...)` inside a\n   * mutation's `onMutate` uses (spec §6.4).\n   *\n   * `track: false` is a canonical cache write — cross-tab receive, entities\n   * backprop, realtime patches (spec §13.2). It updates the data signal but\n   * pushes NO snapshot and does NOT flip `hasPendingMutations`, so a\n   * fire-and-forget plugin write can't wedge the pending flag at `true`\n   * forever. Returns a no-op `Snapshot`.\n   */\n  setData(updater: (prev: T | undefined) => T, opts?: { track?: boolean }): Snapshot {\n    if (this.disposed) {\n      return { rollback: () => {}, finalize: () => {} }\n    }\n    const prev = this.data.peek()\n    const next = updater(prev)\n    const track = opts?.track ?? true\n    const record: SnapshotRecord<T> | null = track\n      ? { id: this.nextSnapshotId++, prev, live: true }\n      : null\n    if (record) this.snapshots.push(record)\n\n    batch(() => {\n      this.data.set(next)\n      if (this.status.peek() === 'idle' || this.status.peek() === 'pending') {\n        this.status.set('success')\n      }\n      this.lastUpdatedAt.set(Date.now())\n      if (record) this.hasPendingMutations.set(true)\n    })\n\n    if (!record) {\n      return { rollback: () => {}, finalize: () => {} }\n    }\n    const id = record.id\n    return {\n      rollback: () => {\n        if (!record.live || this.disposed) return\n        record.live = false\n        batch(() => {\n          const i = this.snapshots.indexOf(record)\n          if (i !== -1) {\n            if (i === this.snapshots.length - 1) {\n              // Top of the stack: restore this layer's captured baseline as\n              // the current data.\n              this.data.set(record.prev as T)\n            } else {\n              // Not the top: leave the currently-displayed value alone and\n              // thread this layer's baseline down onto the next layer, so a\n              // later top-rollback lands on the correct pre-everything value\n              // instead of resurrecting this layer's delta (chain-splice —\n              // T3.1, spec §6.4). Out-of-order rollback of all layers now\n              // returns to the original pre-mutation value.\n              const below = this.snapshots[i + 1] as SnapshotRecord<T>\n              below.prev = record.prev\n            }\n            this.snapshots.splice(i, 1)\n          }\n          this.hasPendingMutations.set(this.snapshots.some((s) => s.live))\n        })\n      },\n      finalize: () => {\n        if (!record.live || this.disposed) return\n        record.live = false\n        this.snapshots = this.snapshots.filter((s) => s.id !== id)\n        if (!this.snapshots.some((s) => s.live)) {\n          this.hasPendingMutations.set(false)\n        }\n      },\n    }\n  }\n\n  firstValue(): Promise<T> {\n    if (this.disposed) {\n      return Promise.reject(new DOMException('Entry disposed', 'AbortError'))\n    }\n    if (this.status.peek() === 'success') {\n      return Promise.resolve(this.data.peek() as T)\n    }\n    if (this.status.peek() === 'error') {\n      return Promise.reject(this.error.peek())\n    }\n    return new Promise<T>((resolve, reject) => {\n      const tracked = (err: unknown): void => {\n        this.pendingFirstValueRejects = this.pendingFirstValueRejects.filter((f) => f !== tracked)\n        reject(err)\n      }\n      this.pendingFirstValueRejects.push(tracked)\n      const unsub = this.status.subscribe((s) => {\n        if (s === 'success') {\n          unsub()\n          this.pendingFirstValueRejects = this.pendingFirstValueRejects.filter((f) => f !== tracked)\n          resolve(this.data.peek() as T)\n        } else if (s === 'error') {\n          unsub()\n          tracked(this.error.peek())\n        }\n      })\n    })\n  }\n\n  /**\n   * True iff data is older than `staleTime` (or no data has been fetched yet).\n   * Used by the query client to decide whether to refetch on subscribe.\n   */\n  isStaleNow(): boolean {\n    if (this.forcedStale) return true\n    const last = this.lastUpdatedAt.peek()\n    if (last === undefined) return true\n    return Date.now() - last >= this.staleTime\n  }\n\n  dispose(): void {\n    if (this.disposed) return\n    this.disposed = true\n    if (this.staleTimer != null) {\n      clearTimeout(this.staleTimer)\n      this.staleTimer = null\n    }\n    this.currentAbort?.abort()\n    this.currentAbort = null\n    // A disposed entry is idle. Reset the in-flight flags so `waitForIdle`\n    // (which waits on `isFetching`) can't hang when a fetch races dispose — the\n    // aborted fetcher's applySuccess/applyFailure never runs to clear them (T3.9).\n    batch(() => {\n      this.isFetching.set(false)\n      this.isLoading.set(false)\n    })\n    if (this.reconnectUnsub !== null) {\n      this.reconnectUnsub()\n      this.reconnectUnsub = null\n    }\n    if (this.deferredResolvers.length > 0) {\n      const disposed = new DOMException('Entry disposed', 'AbortError')\n      const pending = this.deferredResolvers\n      this.deferredResolvers = []\n      for (const p of pending) p.reject(disposed)\n    }\n    if (this.pendingFirstValueRejects.length > 0) {\n      const disposed = new DOMException('Entry disposed', 'AbortError')\n      const rejects = this.pendingFirstValueRejects\n      this.pendingFirstValueRejects = []\n      for (const fn of rejects) fn(disposed)\n    }\n  }\n}\n","import { batch, computed, type Signal, signal } from '../signals'\nimport type { ReadSignal } from '../signals/types'\nimport { abortableSleep, isAbortError } from '../utils'\nimport { subscribeReconnect } from './focus-online'\nimport { structuralShare } from './structural-share'\nimport type {\n  AsyncState,\n  AsyncStatus,\n  NetworkMode,\n  RetryDelay,\n  RetryPolicy,\n  Snapshot,\n} from './types'\n\n/**\n * Configuration for `defineInfiniteQuery({ ... })`. Spec §5.7, §20.4.\n *\n * - `getNextPageParam(lastPage, allPages)` returns the param for the next\n *   page, or `null` when there's no more.\n * - `getPreviousPageParam` (optional) enables bidirectional infinite lists.\n * - `itemsOf(page)` (optional) flattens pages into items for the\n *   `subscription.flat` convenience signal.\n */\nexport type InfiniteFetchCtx<PageParam> = {\n  pageParam: PageParam\n  signal: AbortSignal\n  deps: import('../controller/types').AmbientDeps\n}\n\nexport type InfiniteQuerySpec<Args extends unknown[], PageParam, TPage, TItem = TPage> = {\n  key: (...args: Args) => unknown[]\n  /**\n   * Fetcher receives an `InfiniteFetchCtx` (pageParam + signal + deps) as\n   * the first arg and positional cache args after. See `FetchCtx` for the\n   * regular-query analogue.\n   */\n  fetcher: (ctx: InfiniteFetchCtx<PageParam>, ...args: Args) => Promise<TPage>\n  initialPageParam: PageParam\n  getNextPageParam: (lastPage: TPage, allPages: TPage[]) => PageParam | null\n  getPreviousPageParam?: (firstPage: TPage, allPages: TPage[]) => PageParam | null\n  itemsOf?: (page: TPage) => TItem[]\n  staleTime?: number\n  gcTime?: number\n  refetchInterval?: number\n  keepPreviousData?: boolean\n  retry?: RetryPolicy\n  retryDelay?: RetryDelay\n  /** See `QuerySpec.networkMode`. Defaults to `'online'`. */\n  networkMode?: NetworkMode\n  /** See `QuerySpec.structuralShare`. Applies to the head-page refresh. */\n  structuralShare?: boolean\n  /**\n   * Stable identifier used by `QueryClientPlugin`s (`@kontsedal/olas-cross-tab`,\n   * etc.). Infinite queries do NOT propagate cross-tab in v1 — the\n   * page-array payload is too heavy to be a safe default — but the field is\n   * accepted for forward compatibility. SPEC §13.2.\n   */\n  queryId?: string\n  /**\n   * Accepted for API symmetry, but infinite queries do NOT propagate\n   * cross-tab: peers can't apply page-array payloads (core's remote-apply\n   * paths early-return for infinite defs). The `'infinite'` / `'both'` values\n   * were removed in T6.4; infinite cross-tab is tracked in `BACKLOG.md`.\n   */\n  crossTab?: boolean | 'data'\n}\n\n/**\n * Module-scoped handle for a paginated query. Mirrors `Query<Args, TPage[]>`\n * with paginated `setData` semantics.\n */\nexport type InfiniteQuery<Args extends unknown[], TPage, _TItem> = {\n  readonly __olas: 'infiniteQuery'\n  invalidate(...args: Args): void\n  invalidateAll(): void\n  setData(...args: [...Args, updater: (prev: TPage[] | undefined) => TPage[]]): Snapshot\n  /** Cancel the in-flight fetch (initial/refetch or paging) for a key. See\n   *  `Query.cancel` (spec §5, §6.4). */\n  cancel(...args: Args): void\n  /** Cancel in-flight fetches for every keyed entry of this infinite query. */\n  cancelAll(): void\n  prefetch(...args: Args): Promise<TPage>\n}\n\n/**\n * What `ctx.use(infiniteQuery, ...)` returns. Extends `AsyncState<TPage[]>`\n * with paginated controls: `fetchNextPage` / `fetchPreviousPage`,\n * `hasNextPage` / `hasPreviousPage`, and per-direction `isFetching` signals.\n *\n * `flat` is a convenience: present when the query spec provides `itemsOf` —\n * otherwise it's an empty array.\n */\nexport type InfiniteQuerySubscription<TPage, TItem> = AsyncState<TPage[]> & {\n  pages: ReadSignal<TPage[]>\n  flat: ReadSignal<TItem[]>\n  hasNextPage: ReadSignal<boolean>\n  hasPreviousPage: ReadSignal<boolean>\n  isFetchingNextPage: ReadSignal<boolean>\n  isFetchingPreviousPage: ReadSignal<boolean>\n  fetchNextPage: () => Promise<void>\n  fetchPreviousPage: () => Promise<void>\n  /** Cancel this subscription's in-flight fetch (if any). See `Query.cancel`. */\n  cancel: () => void\n}\n\n/**\n * Holds an array of pages plus their pageParams. Supports fetchNextPage /\n * fetchPreviousPage / invalidate (drops all pages). Race-protected.\n *\n * Internal.\n */\nexport class InfiniteEntry<TPage, TItem, PageParam> {\n  readonly pages: Signal<TPage[]> = signal<TPage[]>([])\n  readonly pageParams: Signal<PageParam[]>\n  readonly data: ReadSignal<TPage[] | undefined>\n  readonly error: Signal<unknown | undefined> = signal(undefined)\n  readonly status: Signal<AsyncStatus> = signal<AsyncStatus>('idle')\n  readonly isLoading: Signal<boolean> = signal(false)\n  readonly isFetching: Signal<boolean> = signal(false)\n  readonly isStale: Signal<boolean> = signal(true)\n  readonly lastUpdatedAt: Signal<number | undefined> = signal(undefined)\n  readonly hasPendingMutations: Signal<boolean> = signal(false)\n  /** True while a fetch is parked waiting for reconnect (online-mode defer).\n   *  See spec §5.5, T3.5. Mirrors `Entry.isPaused`. */\n  readonly isPaused: Signal<boolean> = signal(false)\n\n  readonly isFetchingNextPage: Signal<boolean> = signal(false)\n  readonly isFetchingPreviousPage: Signal<boolean> = signal(false)\n\n  readonly hasNextPage: ReadSignal<boolean>\n  readonly hasPreviousPage: ReadSignal<boolean>\n  readonly flat: ReadSignal<TItem[]>\n\n  private currentFetchId = 0\n  private currentAbort: AbortController | null = null\n  private staleTimer: ReturnType<typeof setTimeout> | null = null\n  /** Set by `markStale()` (invalidate without fetch). See `Entry.forcedStale`. */\n  private forcedStale = false\n  private snapshots: Array<{\n    id: number\n    prev: TPage[]\n    prevParams: PageParam[]\n    live: boolean\n  }> = []\n  private nextSnapshotId = 0\n  private disposed = false\n  /** Mirrors `Entry.pendingFirstValueRejects` — see that field for context. */\n  private pendingFirstValueRejects: Array<(err: unknown) => void> = []\n\n  private readonly fetcher: (pageCtx: {\n    pageParam: PageParam\n    signal: AbortSignal\n  }) => Promise<TPage>\n  private readonly initialPageParam: PageParam\n  private readonly getNextPageParam: (lastPage: TPage, allPages: TPage[]) => PageParam | null\n  private readonly getPreviousPageParam:\n    | ((firstPage: TPage, allPages: TPage[]) => PageParam | null)\n    | undefined\n  private readonly staleTime: number\n  private readonly retry: RetryPolicy\n  private readonly retryDelay: RetryDelay | undefined\n  private readonly networkMode: NetworkMode\n  private readonly structuralShareEnabled: boolean\n  private reconnectUnsub: (() => void) | null = null\n  private deferredResolvers: Array<{\n    direction: 'initial' | 'next' | 'prev'\n    resolve: () => void\n    reject: (err: unknown) => void\n  }> = []\n  private readonly itemsOf?: (page: TPage) => TItem[]\n  /**\n   * Mirrors `Entry.onSuccessData`. Fires from `applyFetchSuccess`-equivalent\n   * branches AFTER `pages.set(...)` settles. Used by `InfiniteClientEntry`\n   * to emit `SetDataEvent { kind: 'infinite', source: 'fetch' }` for\n   * `QueryClientPlugin`s (e.g. entity normalization).\n   */\n  private readonly onSuccessData?: (pages: TPage[]) => void\n\n  constructor(opts: {\n    fetcher: (pageCtx: { pageParam: PageParam; signal: AbortSignal }) => Promise<TPage>\n    initialPageParam: PageParam\n    getNextPageParam: (lastPage: TPage, allPages: TPage[]) => PageParam | null\n    getPreviousPageParam?: (firstPage: TPage, allPages: TPage[]) => PageParam | null\n    itemsOf?: (page: TPage) => TItem[]\n    staleTime?: number\n    retry?: RetryPolicy\n    retryDelay?: RetryDelay\n    networkMode?: NetworkMode\n    structuralShare?: boolean\n    onSuccessData?: (pages: TPage[]) => void\n  }) {\n    this.fetcher = opts.fetcher\n    this.initialPageParam = opts.initialPageParam\n    this.getNextPageParam = opts.getNextPageParam\n    this.getPreviousPageParam = opts.getPreviousPageParam\n    this.itemsOf = opts.itemsOf\n    this.staleTime = opts.staleTime ?? 0\n    this.retry = opts.retry ?? 0\n    this.retryDelay = opts.retryDelay\n    this.networkMode = opts.networkMode ?? 'online'\n    this.structuralShareEnabled = opts.structuralShare ?? true\n    this.onSuccessData = opts.onSuccessData\n    this.pageParams = signal<PageParam[]>([])\n    this.data = computed(() => {\n      const ps = this.pages.value\n      return ps.length === 0 ? undefined : ps\n    })\n    this.flat = computed<TItem[]>(() => {\n      const ps = this.pages.value\n      if (!this.itemsOf) return ps as unknown as TItem[]\n      const out: TItem[] = []\n      for (const p of ps) {\n        for (const item of this.itemsOf(p)) out.push(item)\n      }\n      return out\n    })\n    this.hasNextPage = computed(() => {\n      const ps = this.pages.value\n      if (ps.length === 0) return false\n      return this.getNextPageParam(ps[ps.length - 1] as TPage, ps) !== null\n    })\n    this.hasPreviousPage = computed(() => {\n      const ps = this.pages.value\n      if (ps.length === 0) return false\n      const fn = this.getPreviousPageParam\n      if (!fn) return false\n      return fn(ps[0] as TPage, ps) !== null\n    })\n  }\n\n  /**\n   * Initial load / refetch. On the initial load (no pages yet) this fetches\n   * the first page. On a refetch of an already-loaded entry (interval,\n   * invalidate, focus/reconnect) it **refetches every currently-loaded page**\n   * sequentially, re-deriving each page's param from the freshly-fetched data\n   * via `getNextPageParam` — matching TanStack and avoiding the old\n   * \"collapse to page one\" truncation that dropped every loaded page but the\n   * first on each refetch (T3.7). Pages/params update atomically at the end,\n   * so subscribers never observe a mid-refetch truncation flash.\n   */\n  startFetch(): Promise<TPage> {\n    if (this.disposed) return Promise.reject(new Error('Entry disposed'))\n    if (this.networkMode === 'online' && this.isOffline()) {\n      return this.scheduleDeferredFetch('initial') as Promise<TPage>\n    }\n    const myId = ++this.currentFetchId\n    this.currentAbort?.abort()\n    const abort = new AbortController()\n    this.currentAbort = abort\n\n    const previousPages = this.pages.peek()\n    batch(() => {\n      this.status.set('pending')\n      this.isFetching.set(true)\n      this.isLoading.set(previousPages.length === 0)\n      this.isPaused.set(false)\n    })\n\n    return this.runRefetchAll(myId, abort.signal, Math.max(1, previousPages.length), previousPages)\n  }\n\n  /**\n   * Fetch `targetCount` pages from `initialPageParam`, chaining each next param\n   * via `getNextPageParam` from the freshly-fetched pages. Applies the query's\n   * retry policy per page. Stops early if the dataset shrank (a page yields\n   * `getNextPageParam === null`). Writes pages/params in ONE batch at the end;\n   * a per-page failure keeps the existing pages and surfaces the error; a\n   * supersede/dispose throws `AbortError` without writing.\n   */\n  private async runRefetchAll(\n    myId: number,\n    signal: AbortSignal,\n    targetCount: number,\n    previousPages: TPage[],\n  ): Promise<TPage> {\n    const newPages: TPage[] = []\n    const newParams: PageParam[] = []\n    let pageParam: PageParam = this.initialPageParam\n    try {\n      for (let i = 0; i < targetCount; i++) {\n        let attempt = 0\n        while (true) {\n          if (myId !== this.currentFetchId || this.disposed) {\n            throw new DOMException('Superseded', 'AbortError')\n          }\n          try {\n            const page = await this.fetcher({ pageParam, signal })\n            if (myId !== this.currentFetchId || this.disposed) {\n              throw new DOMException('Superseded', 'AbortError')\n            }\n            newPages.push(page)\n            newParams.push(pageParam)\n            break\n          } catch (err) {\n            if (myId !== this.currentFetchId || this.disposed || isAbortError(err)) throw err\n            const shouldRetry =\n              typeof this.retry === 'number' ? attempt < this.retry : this.retry(attempt, err)\n            if (!shouldRetry) {\n              batch(() => {\n                this.error.set(err)\n                this.status.set('error')\n                this.isLoading.set(false)\n                this.isFetching.set(false)\n              })\n              throw err\n            }\n            const delay = this.computeRetryDelay(attempt)\n            await abortableSleep(delay, signal)\n            attempt += 1\n          }\n        }\n        const next = this.getNextPageParam(newPages[newPages.length - 1] as TPage, newPages)\n        if (next === null) break\n        pageParam = next\n      }\n      if (myId !== this.currentFetchId || this.disposed) {\n        throw new DOMException('Superseded', 'AbortError')\n      }\n      // Structurally share the head page so an unchanged first page keeps its\n      // ref (downstream `computed`s / React snapshots don't thrash).\n      const finalPages =\n        previousPages.length > 0 && this.structuralShareEnabled && newPages.length > 0\n          ? [structuralShare(previousPages[0] as TPage, newPages[0] as TPage), ...newPages.slice(1)]\n          : newPages\n      batch(() => {\n        this.pages.set(finalPages)\n        this.pageParams.set(newParams)\n        this.error.set(undefined)\n        this.status.set('success')\n        this.isLoading.set(false)\n        this.isFetching.set(false)\n        this.lastUpdatedAt.set(Date.now())\n        this.isStale.set(this.staleTime === 0)\n      })\n      this.forcedStale = false // fresh pages clear a prior markStale() (T3.9)\n      if (this.staleTime > 0) this.scheduleStaleness()\n      this.onSuccessData?.(this.pages.peek())\n      return finalPages[0] as TPage\n    } finally {\n      // Status repair (T3.3): a superseded refetch must never leave the entry\n      // wedged at 'pending' when data is present and nothing is fetching. The\n      // superseder owns the final status; this only fires for the terminal\n      // fetch of a supersede chain. Never clobbers a real 'error'.\n      if (\n        !this.disposed &&\n        this.status.peek() === 'pending' &&\n        !this.isFetching.peek() &&\n        this.pages.peek().length > 0\n      ) {\n        this.status.set('success')\n      }\n    }\n  }\n\n  fetchNextPage(): Promise<void> {\n    if (this.disposed) return Promise.reject(new Error('Entry disposed'))\n    if (this.isFetchingNextPage.peek()) return Promise.resolve()\n    if (this.networkMode === 'online' && this.isOffline()) {\n      return this.scheduleDeferredFetch('next') as Promise<void>\n    }\n    const ps = this.pages.peek()\n    if (ps.length === 0) {\n      return this.startFetch().then(() => {})\n    }\n    const nextParam = this.getNextPageParam(ps[ps.length - 1] as TPage, ps)\n    if (nextParam === null) return Promise.resolve()\n\n    const myId = ++this.currentFetchId\n    const abort = new AbortController()\n    this.currentAbort?.abort()\n    this.currentAbort = abort\n    batch(() => {\n      this.isFetchingNextPage.set(true)\n      this.isFetching.set(true)\n    })\n\n    return this.runFetch(\n      myId,\n      abort.signal,\n      nextParam,\n      (page, param) => {\n        if (myId !== this.currentFetchId || this.disposed) return\n        batch(() => {\n          this.pages.set([...this.pages.peek(), page])\n          this.pageParams.set([...this.pageParams.peek(), param])\n          this.error.set(undefined)\n          // A successful page op owns the terminal status: restore 'success'\n          // so paging that superseded a mid-flight full refetch (which left\n          // status at 'pending') can't wedge the entry / Suspense (T3.3).\n          this.status.set('success')\n          this.isFetchingNextPage.set(false)\n          this.isFetching.set(false)\n          this.lastUpdatedAt.set(Date.now())\n        })\n        this.onSuccessData?.(this.pages.peek())\n      },\n      'next',\n    ).then(() => {})\n  }\n\n  fetchPreviousPage(): Promise<void> {\n    if (this.disposed) return Promise.reject(new Error('Entry disposed'))\n    if (this.isFetchingPreviousPage.peek()) return Promise.resolve()\n    if (!this.getPreviousPageParam) return Promise.resolve()\n    if (this.networkMode === 'online' && this.isOffline()) {\n      return this.scheduleDeferredFetch('prev') as Promise<void>\n    }\n    const ps = this.pages.peek()\n    if (ps.length === 0) {\n      return this.startFetch().then(() => {})\n    }\n    const prevParam = this.getPreviousPageParam(ps[0] as TPage, ps)\n    if (prevParam === null) return Promise.resolve()\n\n    const myId = ++this.currentFetchId\n    const abort = new AbortController()\n    this.currentAbort?.abort()\n    this.currentAbort = abort\n    batch(() => {\n      this.isFetchingPreviousPage.set(true)\n      this.isFetching.set(true)\n    })\n\n    return this.runFetch(\n      myId,\n      abort.signal,\n      prevParam,\n      (page, param) => {\n        if (myId !== this.currentFetchId || this.disposed) return\n        batch(() => {\n          this.pages.set([page, ...this.pages.peek()])\n          this.pageParams.set([param, ...this.pageParams.peek()])\n          this.error.set(undefined)\n          // A successful page op owns the terminal status — see fetchNextPage\n          // (T3.3).\n          this.status.set('success')\n          this.isFetchingPreviousPage.set(false)\n          this.isFetching.set(false)\n          this.lastUpdatedAt.set(Date.now())\n        })\n        this.onSuccessData?.(this.pages.peek())\n      },\n      'prev',\n    ).then(() => {})\n  }\n\n  private async runFetch(\n    myId: number,\n    signal: AbortSignal,\n    pageParam: PageParam,\n    onSuccess: (page: TPage, param: PageParam) => void,\n    direction: 'initial' | 'next' | 'prev',\n  ): Promise<TPage> {\n    let attempt = 0\n    let succeeded = false\n    try {\n      while (true) {\n        if (myId !== this.currentFetchId || this.disposed) {\n          throw new DOMException('Superseded', 'AbortError')\n        }\n        try {\n          const page = await this.fetcher({ pageParam, signal })\n          if (myId !== this.currentFetchId || this.disposed) {\n            throw new DOMException('Superseded', 'AbortError')\n          }\n          onSuccess(page, pageParam)\n          succeeded = true\n          return page\n        } catch (err) {\n          if (myId !== this.currentFetchId || this.disposed || isAbortError(err)) {\n            throw err\n          }\n          const shouldRetry =\n            typeof this.retry === 'number' ? attempt < this.retry : this.retry(attempt, err)\n          if (!shouldRetry) {\n            batch(() => {\n              this.error.set(err)\n              this.status.set('error')\n              this.isLoading.set(false)\n              this.isFetching.set(false)\n              if (direction === 'next') this.isFetchingNextPage.set(false)\n              if (direction === 'prev') this.isFetchingPreviousPage.set(false)\n            })\n            throw err\n          }\n          const delay = this.computeRetryDelay(attempt)\n          await abortableSleep(delay, signal)\n          attempt += 1\n        }\n      }\n    } finally {\n      // Catch-all reset for the supersede/abort path. The success and explicit\n      // failure paths already reset these via `onSuccess` and the\n      // `applyFailure`-equivalent branch above; this guarantees that an\n      // aborted-mid-flight `fetchNextPage` (e.g., user calls `invalidate()`\n      // while paging) doesn't wedge the spinner.\n      if (!succeeded) {\n        batch(() => {\n          if (direction === 'next') this.isFetchingNextPage.set(false)\n          if (direction === 'prev') this.isFetchingPreviousPage.set(false)\n          // Status repair (T3.3): a superseded fetch must never leave the\n          // entry wedged at 'pending' when data is present and nothing is\n          // fetching. The superseding fetch normally owns the final status\n          // (its onSuccess sets 'success'); this is the safety net for the\n          // terminal fetch of a supersede chain. Only repair 'pending' — never\n          // clobber a real 'error' — and only when no fetch is still running.\n          if (\n            !this.disposed &&\n            this.status.peek() === 'pending' &&\n            !this.isFetching.peek() &&\n            this.pages.peek().length > 0\n          ) {\n            this.status.set('success')\n          }\n        })\n      }\n    }\n  }\n\n  refetch(): Promise<TPage> {\n    return this.startFetch()\n  }\n\n  /** Force stale without fetching — see `Entry.markStale` (spec §5.7, T3.9). */\n  markStale(): void {\n    if (this.disposed) return\n    if (this.staleTimer != null) {\n      clearTimeout(this.staleTimer)\n      this.staleTimer = null\n    }\n    this.forcedStale = true\n    this.isStale.set(true)\n  }\n\n  invalidate(): Promise<TPage> {\n    this.markStale()\n    return this.startFetch()\n  }\n\n  reset(): void {\n    if (this.disposed) return\n    batch(() => {\n      this.error.set(undefined)\n      this.status.set(this.pages.peek().length > 0 ? 'success' : 'idle')\n    })\n  }\n\n  /** Cancel an in-flight fetch (initial/refetch or paging) without touching\n   *  pages. Supersedes + aborts the current request, then restores a settled\n   *  status. No-op when idle. Mirrors `Entry.cancel` (spec §5, §6.4, T3.4). */\n  cancel(): void {\n    if (this.disposed || !this.isFetching.peek()) return\n    this.currentFetchId += 1\n    this.currentAbort?.abort()\n    this.currentAbort = null\n    batch(() => {\n      this.isFetching.set(false)\n      this.isLoading.set(false)\n      this.isFetchingNextPage.set(false)\n      this.isFetchingPreviousPage.set(false)\n      this.status.set(this.pages.peek().length > 0 ? 'success' : 'idle')\n    })\n  }\n\n  setData(updater: (prev: TPage[] | undefined) => TPage[], opts?: { track?: boolean }): Snapshot {\n    if (this.disposed) {\n      return { rollback: () => {}, finalize: () => {} }\n    }\n    const prev = this.pages.peek()\n    const prevParams = this.pageParams.peek()\n    const next = updater(prev.length === 0 ? undefined : prev)\n    // `track: false` is a canonical cache write (plugin/remote/entities\n    // backprop) — no optimistic snapshot, no `hasPendingMutations` flip. See\n    // `Entry.setData` for the full rationale. Default `true` keeps the\n    // optimistic-update path (`query.setData` in `onMutate`).\n    const track = opts?.track ?? true\n    // Snapshot BOTH pages and pageParams so rollback restores a consistent\n    // pair. Without `prevParams`, an optimistic insert would shift `pages`\n    // permanently out of sync with `pageParams` on rollback — and any\n    // subsequent `fetchNextPage`/`getNextPageParam` would operate on the\n    // wrong head.\n    const record = track ? { id: this.nextSnapshotId++, prev, prevParams, live: true } : null\n    if (record) this.snapshots.push(record)\n\n    // If the updater changed the page count, trim or pad pageParams so the\n    // two arrays stay length-aligned. Padding uses the last known param,\n    // which is the safest neutral choice — the caller of `setData` should\n    // re-key via a real fetch (or use a future param-aware overload) if\n    // the new page needs a fresh param.\n    let nextParams: PageParam[] = prevParams\n    if (next.length !== prevParams.length) {\n      if (next.length < prevParams.length) {\n        nextParams = prevParams.slice(0, next.length)\n      } else {\n        const pad = prevParams[prevParams.length - 1]\n        nextParams = prevParams.slice()\n        for (let i = prevParams.length; i < next.length; i++) {\n          nextParams.push(pad as PageParam)\n        }\n      }\n    }\n\n    batch(() => {\n      this.pages.set(next)\n      if (nextParams !== prevParams) this.pageParams.set(nextParams)\n      if (this.status.peek() === 'idle' || this.status.peek() === 'pending') {\n        this.status.set('success')\n      }\n      this.lastUpdatedAt.set(Date.now())\n      if (record) this.hasPendingMutations.set(true)\n    })\n\n    if (!record) {\n      return { rollback: () => {}, finalize: () => {} }\n    }\n    const id = record.id\n    return {\n      rollback: () => {\n        if (!record.live || this.disposed) return\n        record.live = false\n        batch(() => {\n          const i = this.snapshots.indexOf(record)\n          if (i !== -1) {\n            if (i === this.snapshots.length - 1) {\n              // Top of the stack: restore this layer's captured baseline pair\n              // (pages + params stay length-aligned — see the snapshot note).\n              this.pages.set(record.prev)\n              this.pageParams.set(record.prevParams)\n            } else {\n              // Not the top: leave current pages/params alone and thread this\n              // layer's baseline down onto the next layer, so a later\n              // top-rollback lands on the correct pre-everything pages instead\n              // of resurrecting this layer's delta (chain-splice — T3.1, spec\n              // §6.4). Mirrors `Entry.setData`.\n              const below = this.snapshots[i + 1] as (typeof this.snapshots)[number]\n              below.prev = record.prev\n              below.prevParams = record.prevParams\n            }\n            this.snapshots.splice(i, 1)\n          }\n          this.hasPendingMutations.set(this.snapshots.some((s) => s.live))\n        })\n      },\n      finalize: () => {\n        if (!record.live || this.disposed) return\n        record.live = false\n        this.snapshots = this.snapshots.filter((s) => s.id !== id)\n        if (!this.snapshots.some((s) => s.live)) {\n          this.hasPendingMutations.set(false)\n        }\n      },\n    }\n  }\n\n  firstValue(): Promise<TPage[]> {\n    if (this.disposed) {\n      return Promise.reject(new DOMException('Entry disposed', 'AbortError'))\n    }\n    if (this.status.peek() === 'success') {\n      return Promise.resolve(this.pages.peek())\n    }\n    if (this.status.peek() === 'error') {\n      return Promise.reject(this.error.peek())\n    }\n    return new Promise<TPage[]>((resolve, reject) => {\n      const tracked = (err: unknown): void => {\n        this.pendingFirstValueRejects = this.pendingFirstValueRejects.filter((f) => f !== tracked)\n        reject(err)\n      }\n      this.pendingFirstValueRejects.push(tracked)\n      const unsub = this.status.subscribe((s) => {\n        if (s === 'success') {\n          unsub()\n          this.pendingFirstValueRejects = this.pendingFirstValueRejects.filter((f) => f !== tracked)\n          resolve(this.pages.peek())\n        } else if (s === 'error') {\n          unsub()\n          tracked(this.error.peek())\n        }\n      })\n    })\n  }\n\n  isStaleNow(): boolean {\n    if (this.forcedStale) return true\n    const last = this.lastUpdatedAt.peek()\n    if (last === undefined) return true\n    return Date.now() - last >= this.staleTime\n  }\n\n  private computeRetryDelay(attempt: number): number {\n    const d = this.retryDelay\n    // Exponential backoff default when retries are on but no retryDelay given\n    // (mirrors Entry.computeDelay — T3.9).\n    if (d === undefined) return Math.min(1000 * 2 ** attempt, 30_000)\n    return typeof d === 'function' ? d(attempt) : d\n  }\n\n  private isOffline(): boolean {\n    return typeof navigator !== 'undefined' && navigator.onLine === false\n  }\n\n  private scheduleDeferredFetch(direction: 'initial' | 'next' | 'prev'): Promise<unknown> {\n    // Parked waiting for reconnect (T3.5). Cleared when a fetch actually\n    // starts (`startFetch` batch) or on drain.\n    this.isPaused.set(true)\n    if (this.reconnectUnsub === null) {\n      this.reconnectUnsub = subscribeReconnect(() => this.drainDeferred())\n    }\n    return new Promise<void>((resolve, reject) => {\n      this.deferredResolvers.push({ direction, resolve, reject })\n    })\n  }\n\n  private drainDeferred(): void {\n    if (this.deferredResolvers.length === 0) return\n    if (this.disposed) return\n    this.isPaused.set(false)\n    const pending = this.deferredResolvers\n    this.deferredResolvers = []\n    if (this.reconnectUnsub !== null) {\n      this.reconnectUnsub()\n      this.reconnectUnsub = null\n    }\n    // Collapse multiple deferrals of the same direction into one real fetch.\n    // Order matters: initial first (it may produce data the others need),\n    // then prev / next.\n    const seen = new Set<'initial' | 'next' | 'prev'>()\n    const order: Array<'initial' | 'next' | 'prev'> = ['initial', 'prev', 'next']\n    for (const d of pending) {\n      seen.add(d.direction)\n    }\n    const run = async () => {\n      for (const dir of order) {\n        if (!seen.has(dir)) continue\n        if (dir === 'initial') await this.startFetch()\n        else if (dir === 'next') await this.fetchNextPage()\n        else await this.fetchPreviousPage()\n      }\n    }\n    run().then(\n      () => {\n        for (const p of pending) p.resolve()\n      },\n      (err) => {\n        for (const p of pending) p.reject(err)\n      },\n    )\n  }\n\n  private scheduleStaleness(): void {\n    if (this.staleTimer != null) clearTimeout(this.staleTimer)\n    if (this.staleTime > 0) {\n      this.staleTimer = setTimeout(() => {\n        this.staleTimer = null\n        if (!this.disposed) this.isStale.set(true)\n      }, this.staleTime)\n    }\n  }\n\n  dispose(): void {\n    if (this.disposed) return\n    this.disposed = true\n    if (this.staleTimer != null) {\n      clearTimeout(this.staleTimer)\n      this.staleTimer = null\n    }\n    this.currentAbort?.abort()\n    this.currentAbort = null\n    // A disposed entry is idle — reset the in-flight flags so `waitForIdle`\n    // can't hang on a fetch racing dispose (T3.9). Mirrors `Entry.dispose`.\n    batch(() => {\n      this.isFetching.set(false)\n      this.isLoading.set(false)\n      this.isFetchingNextPage.set(false)\n      this.isFetchingPreviousPage.set(false)\n    })\n    if (this.reconnectUnsub !== null) {\n      this.reconnectUnsub()\n      this.reconnectUnsub = null\n    }\n    if (this.deferredResolvers.length > 0) {\n      const disposed = new DOMException('Entry disposed', 'AbortError')\n      const pending = this.deferredResolvers\n      this.deferredResolvers = []\n      for (const p of pending) p.reject(disposed)\n    }\n    if (this.pendingFirstValueRejects.length > 0) {\n      const disposed = new DOMException('Entry disposed', 'AbortError')\n      const rejects = this.pendingFirstValueRejects\n      this.pendingFirstValueRejects = []\n      for (const fn of rejects) fn(disposed)\n    }\n  }\n}\n","/**\n * Stable string hash of a key tuple. Two equal-by-content args produce the\n * same string regardless of property iteration order. Handles primitives,\n * arrays, plain objects, Date, BigInt, NaN, ±Infinity.\n *\n * Functions and symbols throw — keys must be serializable so distinct\n * subscribers can share entries.\n */\nexport function stableHash(args: readonly unknown[]): string {\n  return JSON.stringify(args, replacer)\n}\n\n// A regular `function` (not an arrow) so `this` is bound to the holder object\n// by `JSON.stringify`. Critical: `JSON.stringify` applies `toJSON()` to a value\n// BEFORE calling the replacer, so the `value` argument for a `Date` is already\n// its ISO string and a class instance with a `toJSON` is already its serialized\n// form — inspecting `value` would miss both (the old arrow did, making the Date\n// tag and the class-instance throw dead code: `stableHash([date])` collided\n// with `stableHash([date.toISOString()])`). Reading the RAW property off the\n// holder (`this[key]`) recovers the true pre-`toJSON` value. Spec §5.4; T3.8.\nconst replacer = function (this: unknown, key: string, _value: unknown): unknown {\n  const value = (this as Record<string, unknown>)[key]\n  if (typeof value === 'function') {\n    throw new Error('[olas] query keys cannot contain functions')\n  }\n  if (typeof value === 'symbol') {\n    throw new Error('[olas] query keys cannot contain symbols')\n  }\n  if (typeof value === 'bigint') {\n    // JSON has no bigint; serialize as a tagged string so `1n` and `'1'`\n    // don't collide. The tag survives round-trips for debugging.\n    return { __bigint: value.toString() }\n  }\n  if (typeof value === 'number') {\n    // `JSON.stringify(NaN)` → `'null'` and likewise for Infinity, which\n    // would collide with a literal `null` key. Tag them explicitly.\n    if (Number.isNaN(value)) return '__nan__'\n    if (value === Number.POSITIVE_INFINITY) return '__+inf__'\n    if (value === Number.NEGATIVE_INFINITY) return '__-inf__'\n    return value\n  }\n  if (value === undefined) return '__undefined__'\n  if (value instanceof Date) return { __date: value.toISOString() }\n  if (value instanceof Map || value instanceof Set) {\n    throw new Error('[olas] query keys cannot contain Map/Set — use arrays/objects')\n  }\n  if (value && typeof value === 'object' && !Array.isArray(value)) {\n    // Reject class instances (proto !== Object.prototype): two `new MyKey(1)`\n    // calls would serialize identically to `{}` and collide. Plain objects\n    // pass through with sorted keys.\n    const proto = Object.getPrototypeOf(value)\n    if (proto !== null && proto !== Object.prototype) {\n      throw new Error(\n        `[olas] query keys cannot contain class instances (got ${proto.constructor?.name ?? 'unknown'}) — pass plain object/array data`,\n      )\n    }\n    const sorted: Record<string, unknown> = {}\n    for (const k of Object.keys(value).sort()) {\n      sorted[k] = (value as Record<string, unknown>)[k]\n    }\n    return sorted\n  }\n  return value\n}\n","/**\n * `QueryClientPlugin` — a slot for layered cache concerns (cross-tab sync,\n * server-push patches, persistence-like layers) that need to observe\n * `setData` / `invalidate` / `gc` and apply remote writes back into the\n * cache without re-triggering their own outbound side-effects.\n *\n * Plugins are installed via `RootOptions.plugins[]`; lifecycle is bound to\n * the root's `QueryClient` (`init` is called once after construction;\n * `dispose` is called from `QueryClient.dispose`).\n *\n * SPEC §13.2.\n */\n\n/**\n * Surface the plugin gets at `init` time. Used to push remote-originated\n * cache writes through the normal `setData`/`invalidate` paths without\n * triggering the plugin's own outbound hooks for those writes (the inbound\n * writes are marked `isRemote: true` and rebroadcast must be skipped).\n *\n * `subscribedKeys(queryId)` walks the per-root entry registry for the\n * matching query and returns every bound entry's `keyArgs`. Cross-tab\n * plugins use this to scope outbound traffic (e.g. only echo invalidations\n * for queries the local tab actually has entries for).\n */\nexport type QueryClientPluginApi = {\n  /**\n   * Apply a remote snapshot. The plugin's own `onSetData` IS fired for the\n   * resulting cache write, but the event carries `isRemote: true` — plugins\n   * MUST skip rebroadcast in that case.\n   */\n  applyRemoteSetData(queryId: string, keyArgs: readonly unknown[], data: unknown): void\n  applyRemoteInvalidate(queryId: string, keyArgs: readonly unknown[]): void\n  /**\n   * Apply a local-originated `setData` to the entry identified by\n   * `(queryId, keyArgs)`. The resulting plugin events fire with\n   * `isRemote: false` and `source: 'set'` — cross-tab plugins WILL\n   * rebroadcast (the write is treated as if a controller called\n   * `client.setData(...)` directly).\n   *\n   * Drops silently when the queryId is unknown, the registered query is\n   * infinite, or no local entry exists for that key. The `updater`\n   * receives the previous data (typed as `unknown` because plugins are\n   * type-erased) and returns the next.\n   *\n   * Use case: entity-normalization plugins that want to backpropagate an\n   * `entity.update(...)` patch into every query holding that entity.\n   * Mutations / optimistic updates already go through the public\n   * `client.setData` and don't need this API.\n   */\n  setEntryData(\n    queryId: string,\n    keyArgs: readonly unknown[],\n    updater: (prev: unknown) => unknown,\n  ): void\n  /**\n   * Snapshot of currently bound entry keys for a query (by `queryId`). Empty\n   * array when the query isn't registered, has no client entries, or the\n   * `queryId` doesn't match any registered query.\n   *\n   * @example\n   * ```ts\n   * // Plugin sees an incoming invalidate; only echo it outward if any local\n   * // controller is actually subscribed to that key — otherwise the message\n   * // is unilateral noise.\n   * const plugin: QueryClientPlugin = {\n   *   init(api) { this.api = api },\n   *   onInvalidate(ev) {\n   *     if (ev.isRemote) return\n   *     const subscribed = this.api.subscribedKeys(ev.queryId)\n   *     if (subscribed.length === 0) return // no local subscribers → don't send\n   *     transport.send({ type: 'invalidate', queryId: ev.queryId, keyArgs: ev.keyArgs })\n   *   },\n   * }\n   * ```\n   */\n  subscribedKeys(queryId: string): readonly (readonly unknown[])[]\n}\n\nexport type SetDataEvent = {\n  queryId: string\n  keyArgs: readonly unknown[]\n  data: unknown\n  /**\n   * `'data'` for regular queries, `'infinite'` for paginated queries.\n   * Cross-tab plugins skip `'infinite'` in v1 — page-array payloads are\n   * too heavy to be a safe default.\n   */\n  kind: 'data' | 'infinite'\n  /**\n   * True iff this write originated from `applyRemoteSetData`. Plugins MUST\n   * skip rebroadcast in that case — otherwise the message would echo back.\n   */\n  isRemote: boolean\n  /**\n   * Origin of the write. `'set'` covers explicit `client.setData` (mutations,\n   * optimistic updates AND their `snapshot.rollback()`, plugin-initiated\n   * patches) — a rollback re-broadcasts the restored value so peers drop the\n   * failed optimistic state (T3.6). `'fetch'` fires when the\n   * query fetcher resolved successfully and wrote the result into the entry\n   * — emitted after the data signal is settled. `'remote'` is the\n   * `applyRemoteSetData` path (cross-tab / server-push); equivalent to\n   * `isRemote === true`.\n   *\n   * Layered plugins use this to decide whether to react: cross-tab broadcasts\n   * only on `'set'`, an entity-normalization plugin observes all sources.\n   */\n  source: 'set' | 'fetch' | 'remote'\n}\n\nexport type InvalidateEvent = {\n  queryId: string\n  keyArgs: readonly unknown[]\n  kind: 'data' | 'infinite'\n  isRemote: boolean\n}\n\nexport type GcEvent = {\n  queryId: string\n  keyArgs: readonly unknown[]\n  kind: 'data' | 'infinite'\n}\n\n/**\n * Emitted when a persistable mutation (`spec.persist === true`) starts\n * executing — before the user's `mutate` is invoked. Plugins use this to\n * persist the variables to durable storage; if the page reloads mid-run,\n * the queue replays from these entries.\n *\n * `runId` is unique per execution (a single `mutation.run(...)` call OR a\n * replay attempt). `attempt` counts retry passes within a single runId.\n */\nexport type MutationEnqueueEvent = {\n  mutationId: string\n  runId: string\n  variables: unknown\n  attempt: number\n}\n\n/**\n * Emitted after a persistable mutation settles. Plugins use this to drop\n * the run from the durable queue (on `'success'` or `'error'` after retries\n * exhaust), or to leave it pending (on `'cancelled'` — e.g. parent dispose\n * mid-flight).\n */\nexport type MutationSettleEvent = {\n  mutationId: string\n  runId: string\n  outcome: 'success' | 'error' | 'cancelled'\n  /** Only present on `'error'` — the final thrown value after retries. */\n  error?: unknown\n}\n\n/**\n * Plugin contract. Every hook is optional. Hooks are wrapped in try/catch\n * by `QueryClient`; thrown exceptions are routed through the root's\n * `onError` handler with `kind: 'plugin'`.\n */\nexport type QueryClientPlugin = {\n  /**\n   * Optional human-readable identifier surfaced in `ErrorContext.pluginName`\n   * when this plugin's callback throws. Without it, `pluginName` is left\n   * `undefined`. Recommended for shipped plugins so Sentry/OTel adapters\n   * can attribute errors back to the right package.\n   */\n  readonly name?: string\n  /**\n   * Called once after the `QueryClient` is constructed. Use it to wire up\n   * transport listeners and capture the `QueryClientPluginApi`. SPEC §13.2.\n   *\n   * Persistable-mutation replay typically happens HERE — module-scope\n   * `defineMutation(...)` calls have already registered their handlers by\n   * the time `createRoot(...)` runs, so `init` can walk durable storage\n   * and re-invoke registered mutates for any pending entries.\n   */\n  init?(api: QueryClientPluginApi): void\n  onSetData?(event: SetDataEvent): void\n  onInvalidate?(event: InvalidateEvent): void\n  onGc?(event: GcEvent): void\n  /**\n   * Fired when a persistable mutation (`spec.persist === true`) starts\n   * executing. SPEC §13.3.\n   */\n  onMutationEnqueue?(event: MutationEnqueueEvent): void\n  /** Fired after a persistable mutation settles. SPEC §13.3. */\n  onMutationSettle?(event: MutationSettleEvent): void\n  /** Called from `QueryClient.dispose`. Tear down transports / listeners here. */\n  dispose?(): void\n}\n\n/**\n * Internal helper — fetch the `queryId` from a query's spec without\n * peeking into private types. Returns `undefined` for queries that didn't\n * declare a `queryId`; plugin events are then skipped (a plugin can't route\n * by name without one).\n */\nexport function readQueryId(query: { readonly __spec: { queryId?: string } }): string | undefined {\n  return query.__spec.queryId\n}\n\n/**\n * Shape of values stored in the `queryId → Query` registry. Either a\n * regular `Query` or an `InfiniteQuery`, both branded by `__olas`.\n */\nexport type RegisteredQuery = {\n  readonly __olas: 'query' | 'infiniteQuery'\n  readonly __spec: { queryId?: string; crossTab?: boolean }\n}\n\n/**\n * Back a module-level registry on `globalThis` under a shared `Symbol.for`\n * key. Guards the dual-package hazard: if a consumer ends up with both the ESM\n * and CJS build of `@kontsedal/olas-core` (common with mixed bundler configs),\n * each copy would otherwise own a SEPARATE registry `Map` — a mutation\n * registered via the ESM copy would be invisible to the mutation-queue plugin\n * loaded against the CJS copy, and cross-tab query lookups would miss. Sharing\n * one Map on `globalThis` makes both copies agree. T3.9.\n */\nfunction globalRegistry<V>(key: symbol): Map<string, V> {\n  const store = globalThis as unknown as Record<symbol, Map<string, V> | undefined>\n  const existing = store[key]\n  if (existing) return existing\n  const created = new Map<string, V>()\n  store[key] = created\n  return created\n}\n\nconst queryRegistry = globalRegistry<RegisteredQuery>(Symbol.for('olas.queryRegistry'))\n\n/**\n * Register a query by its `queryId`. Internal — called from `defineQuery` /\n * `defineInfiniteQuery`. Replaces any previous registration with the same\n * id (matches Olas's \"full root rebuild\" HMR story; a mid-flight remote\n * message routed against the old `Query` simply misses). Dev-warns when a\n * *different* query overwrites an existing id — a genuine collision, since\n * cross-tab / persistence route by `queryId` (expected during HMR).\n */\nexport function registerQueryById(queryId: string, query: RegisteredQuery): void {\n  if (__DEV__) {\n    const existing = queryRegistry.get(queryId)\n    if (existing !== undefined && existing !== query) {\n      console.warn(\n        `[olas] duplicate queryId \"${queryId}\": a different query is replacing an existing ` +\n          'registration. `queryId` must be unique per query (cross-tab / persistence route by it). ' +\n          'Expected during HMR; a collision bug otherwise.',\n      )\n    }\n  }\n  queryRegistry.set(queryId, query)\n}\n\n/**\n * Look up a query by its declared `queryId`. Returns `undefined` when no\n * query with that id has been defined yet (e.g. the module isn't imported\n * in the receiving tab).\n */\nexport function lookupRegisteredQuery(queryId: string): RegisteredQuery | undefined {\n  return queryRegistry.get(queryId)\n}\n\n/**\n * Test-only — drop a registered entry. Lets tests defining the same\n * `queryId` across cases avoid bleed. Not exported from `@kontsedal/olas-core`.\n */\nexport function _unregisterQueryById(queryId: string): void {\n  queryRegistry.delete(queryId)\n}\n\n// ────────────────────────────────────────────────────────────────────────────\n// Mutation registry — parallel to query registry. Persistable mutations\n// (`spec.persist === true`) register themselves at module-import time via\n// `defineMutation(...)` so the mutation-queue plugin can replay pending\n// runs at `init` time, BEFORE controllers reconstruct.\n// ────────────────────────────────────────────────────────────────────────────\n\n/**\n * Shape stored in the `mutationId → handler` registry. Only the `mutate`\n * function and the id are needed for replay — lifecycle hooks like\n * `onSuccess` / `onError` are per-controller and can't be safely replayed\n * across page reloads (the controller doesn't exist yet).\n */\nexport type RegisteredMutation = {\n  readonly mutationId: string\n  /**\n   * Replay-safe `mutate`. Matches `MutationSpec.mutate` 1:1 — receives the\n   * variables and an `AbortSignal`. The mutation-queue plugin invokes this\n   * directly on replay, so the implementation MUST NOT close over\n   * controller-instance state. Module-level deps (a shared `api` client,\n   * etc.) are fine.\n   */\n  readonly mutate: (vars: unknown, signal: AbortSignal) => Promise<unknown>\n}\n\nconst mutationRegistry = globalRegistry<RegisteredMutation>(Symbol.for('olas.mutationRegistry'))\n\n/** Register a mutation by its `mutationId`. Internal — called from `defineMutation`. */\nexport function registerMutationById(mutationId: string, entry: RegisteredMutation): void {\n  mutationRegistry.set(mutationId, entry)\n}\n\n/**\n * Look up a registered mutation by id. Returns `undefined` when no\n * mutation with that id has been defined — typical when a queue entry\n * references a mutation whose module hasn't been imported (e.g. a\n * code-split route boundary). The plugin should leave such entries in\n * place and retry once the module loads.\n */\nexport function lookupRegisteredMutation(mutationId: string): RegisteredMutation | undefined {\n  return mutationRegistry.get(mutationId)\n}\n\n/** Test-only — drop a registered mutation. Not exported from the package. */\nexport function _unregisterMutationById(mutationId: string): void {\n  mutationRegistry.delete(mutationId)\n}\n","import type { DevtoolsEmitter } from '../devtools'\nimport { dispatchError, type ErrorHandler } from '../errors'\nimport { type Signal, signal } from '../signals'\nimport { isAbortError } from '../utils'\nimport { Entry } from './entry'\nimport { subscribeReconnect, subscribeWindowFocus } from './focus-online'\nimport { InfiniteEntry, type InfiniteQuery, type InfiniteQuerySpec } from './infinite'\nimport { stableHash } from './keys'\nimport {\n  type GcEvent,\n  type InvalidateEvent,\n  lookupRegisteredQuery,\n  type QueryClientPlugin,\n  type QueryClientPluginApi,\n  type SetDataEvent,\n} from './plugin'\nimport type { DehydratedState, Query, QuerySpec, RetryDelay, RetryPolicy, Snapshot } from './types'\n\nconst DEFAULT_GC_TIME = 5 * 60_000\n\ntype AnyQuery = Query<any, any> & {\n  readonly __spec: QuerySpec<any, any>\n  readonly __id: string\n  __clients: Set<QueryClient>\n}\n\ntype AnyInfiniteQuery = InfiniteQuery<any, any, any> & {\n  readonly __spec: InfiniteQuerySpec<any, any, any, any>\n  readonly __id: string\n  __clients: Set<QueryClient>\n}\n\n/**\n * Composite hydration-buffer key: query identity + key hash. Namespacing by\n * identity stops a dehydrated entry for query A being adopted by query B that\n * merely hashes to the same key (spec §15, T1.2). `JSON.stringify` of the pair\n * is used rather than string concatenation so no separator char is ambiguous —\n * both `id` (an arbitrary user `queryId`) and `hash` are unbounded strings.\n */\nconst hydrationKey = (id: string, hash: string): string => JSON.stringify([id, hash])\n\nexport class ClientEntry<T> {\n  readonly entry: Entry<T>\n  /** The result of `spec.key(...args)` — used for hashing/identity. */\n  readonly keyArgs: readonly unknown[]\n  /** The original args the consumer passed — what the fetcher receives. */\n  readonly callArgs: readonly unknown[]\n  readonly client: QueryClient\n  readonly query: AnyQuery\n  private subscriberCount = 0\n  private gcTimer: ReturnType<typeof setTimeout> | null = null\n  private intervalTimer: ReturnType<typeof setInterval> | null = null\n  private unsubFocus: (() => void) | null = null\n  private unsubOnline: (() => void) | null = null\n  private gcTime: number\n  private refetchInterval: number | undefined\n  private refetchOnWindowFocus: boolean\n  private refetchOnReconnect: boolean\n\n  constructor(\n    client: QueryClient,\n    query: AnyQuery,\n    callArgs: readonly unknown[],\n    keyArgs: readonly unknown[],\n    spec: QuerySpec<any, T>,\n    hydrated: { data: T; lastUpdatedAt: number } | undefined,\n    /**\n     * Prepared by `QueryClient.bindEntry` (which is the only construction\n     * site). When the query has a `queryId`, the closure calls back into\n     * `QueryClient.emitSetData` with `source: 'fetch'` after every\n     * successful fetch. We accept it pre-built rather than reach into the\n     * client from here because `emitSetData` is `private` on `QueryClient`\n     * — restricting the access path is the whole point.\n     */\n    onFetchSuccess: ((data: T) => void) | undefined,\n  ) {\n    this.client = client\n    this.query = query\n    this.callArgs = callArgs\n    this.keyArgs = keyArgs\n    this.gcTime = spec.gcTime ?? DEFAULT_GC_TIME\n    this.refetchInterval = spec.refetchInterval\n    this.refetchOnWindowFocus = spec.refetchOnWindowFocus ?? client.refetchOnWindowFocus\n    this.refetchOnReconnect = spec.refetchOnReconnect ?? client.refetchOnReconnect\n    const fetcherFn = spec.fetcher\n    const deps = client.deps as import('../controller/types').AmbientDeps\n    const devtools = client.devtools\n    const queryKey = this.keyArgs\n    this.entry = new Entry<T>({\n      fetcher: () => (signal) => fetcherFn({ signal, deps }, ...(callArgs as never[])),\n      staleTime: spec.staleTime,\n      retry: spec.retry as RetryPolicy | undefined,\n      retryDelay: spec.retryDelay as RetryDelay | undefined,\n      networkMode: spec.networkMode,\n      structuralShare: spec.structuralShare,\n      initialData: hydrated?.data,\n      initialUpdatedAt: hydrated?.lastUpdatedAt,\n      events:\n        __DEV__ && devtools !== undefined\n          ? {\n              onFetchStart: () => devtools.emit({ type: 'cache:fetch-start', queryKey }),\n              onFetchSuccess: (durationMs) =>\n                devtools.emit({ type: 'cache:fetch-success', queryKey, durationMs }),\n              onFetchError: (durationMs, error) =>\n                devtools.emit({\n                  type: 'cache:fetch-error',\n                  queryKey,\n                  durationMs,\n                  error,\n                }),\n            }\n          : undefined,\n      onSuccessData: onFetchSuccess,\n    })\n  }\n\n  acquire(): void {\n    this.subscriberCount += 1\n    if (this.gcTimer != null) {\n      clearTimeout(this.gcTimer)\n      this.gcTimer = null\n    }\n    if (this.subscriberCount === 1) {\n      if (this.refetchInterval != null) this.startIntervalTimer()\n      if (this.refetchOnWindowFocus) {\n        this.unsubFocus = subscribeWindowFocus(() => this.triggerEventRefetch())\n      }\n      if (this.refetchOnReconnect) {\n        this.unsubOnline = subscribeReconnect(() => this.triggerEventRefetch())\n      }\n    }\n  }\n\n  release(): void {\n    this.subscriberCount -= 1\n    if (this.subscriberCount <= 0) {\n      this.stopIntervalTimer()\n      this.stopEventSubscriptions()\n      if (this.gcTime === 0) {\n        this.client.dropEntry(this)\n      } else {\n        this.gcTimer = setTimeout(() => {\n          this.gcTimer = null\n          this.client.dropEntry(this)\n        }, this.gcTime)\n      }\n    }\n  }\n\n  hasSubscribers(): boolean {\n    return this.subscriberCount > 0\n  }\n\n  startIntervalTimer(): void {\n    if (this.refetchInterval == null) return\n    if (this.intervalTimer != null) return\n    this.intervalTimer = setInterval(() => {\n      // Skip when the tab is hidden — refetching while in background wastes\n      // battery and network. `refetchOnWindowFocus` (when enabled) will\n      // catch the entry up on visibility return; pure-interval users without\n      // focus-refetch get the catch-up via `acquire()` re-arming the timer\n      // when they next mount.\n      if (typeof document !== 'undefined' && document.visibilityState === 'hidden') {\n        return\n      }\n      // Join an in-flight fetch instead of aborting it. `startFetch()` aborts\n      // the current request, so a fetch slower than the interval would\n      // livelock — abort→restart every tick, never completing, hammering one\n      // aborted request per interval (T3.2). Skip the tick; the running fetch\n      // will finish and the next tick re-arms once it's idle.\n      if (this.entry.isFetching.peek()) return\n      this.entry.startFetch().catch(() => {\n        /* error already captured on entry */\n      })\n    }, this.refetchInterval)\n  }\n\n  stopIntervalTimer(): void {\n    if (this.intervalTimer != null) {\n      clearInterval(this.intervalTimer)\n      this.intervalTimer = null\n    }\n  }\n\n  stopEventSubscriptions(): void {\n    if (this.unsubFocus != null) {\n      this.unsubFocus()\n      this.unsubFocus = null\n    }\n    if (this.unsubOnline != null) {\n      this.unsubOnline()\n      this.unsubOnline = null\n    }\n  }\n\n  /**\n   * Schedule a gc timer for an entry that was just created via a non-subscribing\n   * path (`prefetch`, `setData`, `invalidate`). Without this, those entries\n   * never trigger `release()` and would live until root dispose. Called by\n   * `QueryClient.bindEntry` right after creating a fresh entry; `acquire()`\n   * (e.g., from a subscriber that arrives shortly after a prefetch) clears it.\n   * No-op if the entry already has subscribers or a gc timer pending.\n   */\n  scheduleGcIfOrphan(): void {\n    if (this.subscriberCount > 0 || this.gcTimer != null) return\n    if (this.gcTime === 0) {\n      // Defer one microtask so the current caller (e.g. a `setData` that\n      // writes then expects to read back in the same tick) sees the entry.\n      queueMicrotask(() => {\n        if (this.subscriberCount === 0 && this.gcTimer == null) {\n          this.client.dropEntry(this)\n        }\n      })\n      return\n    }\n    this.gcTimer = setTimeout(() => {\n      this.gcTimer = null\n      this.client.dropEntry(this)\n    }, this.gcTime)\n  }\n\n  /** Refetch on focus / reconnect, but only if the data is actually stale. */\n  private triggerEventRefetch(): void {\n    if (!this.entry.isStaleNow()) return\n    // Join an in-flight fetch instead of aborting + restarting it — a focus /\n    // reconnect landing mid-fetch shouldn't cancel it (T3.9, cf. T3.2 interval).\n    if (this.entry.isFetching.peek()) return\n    this.entry.startFetch().catch(() => {\n      /* error already captured on entry */\n    })\n  }\n\n  dispose(): void {\n    if (this.gcTimer != null) {\n      clearTimeout(this.gcTimer)\n      this.gcTimer = null\n    }\n    this.stopIntervalTimer()\n    this.stopEventSubscriptions()\n    this.entry.dispose()\n  }\n}\n\nexport class InfiniteClientEntry<TPage, TItem, PageParam> {\n  readonly entry: InfiniteEntry<TPage, TItem, PageParam>\n  readonly keyArgs: readonly unknown[]\n  readonly callArgs: readonly unknown[]\n  readonly client: QueryClient\n  readonly query: AnyInfiniteQuery\n  private subscriberCount = 0\n  private gcTimer: ReturnType<typeof setTimeout> | null = null\n  private intervalTimer: ReturnType<typeof setInterval> | null = null\n  private gcTime: number\n  private refetchInterval: number | undefined\n\n  constructor(\n    client: QueryClient,\n    query: AnyInfiniteQuery,\n    callArgs: readonly unknown[],\n    keyArgs: readonly unknown[],\n    spec: InfiniteQuerySpec<any, PageParam, TPage, TItem>,\n    /**\n     * Prepared by `QueryClient.bindInfiniteEntry`. When the infinite query\n     * has a `queryId`, the closure calls back into `QueryClient.emitSetData`\n     * with `kind: 'infinite', source: 'fetch'` after every successful page\n     * write (initial, next, prev). Mirrors `ClientEntry.onFetchSuccess`.\n     */\n    onFetchSuccess: ((pages: TPage[]) => void) | undefined,\n  ) {\n    this.client = client\n    this.query = query\n    this.callArgs = callArgs\n    this.keyArgs = keyArgs\n    this.gcTime = spec.gcTime ?? DEFAULT_GC_TIME\n    this.refetchInterval = spec.refetchInterval\n    const fetcherFn = spec.fetcher\n    const deps = client.deps as import('../controller/types').AmbientDeps\n    this.entry = new InfiniteEntry<TPage, TItem, PageParam>({\n      fetcher: ({ pageParam, signal }) =>\n        fetcherFn({ pageParam, signal, deps }, ...(callArgs as never[])),\n      initialPageParam: spec.initialPageParam,\n      getNextPageParam: spec.getNextPageParam,\n      getPreviousPageParam: spec.getPreviousPageParam,\n      itemsOf: spec.itemsOf,\n      staleTime: spec.staleTime,\n      retry: spec.retry as RetryPolicy | undefined,\n      retryDelay: spec.retryDelay as RetryDelay | undefined,\n      networkMode: spec.networkMode,\n      structuralShare: spec.structuralShare,\n      // Fire SetDataEvent { kind: 'infinite', source: 'fetch' } whenever a\n      // fetch settles successfully. Plugins (e.g. entity normalization) use\n      // this to walk the pages and update their normalized stores. Mirrors\n      // the regular `ClientEntry`'s `onFetchSuccess` closure plumbing.\n      onSuccessData: onFetchSuccess,\n    })\n  }\n\n  acquire(): void {\n    this.subscriberCount += 1\n    if (this.gcTimer != null) {\n      clearTimeout(this.gcTimer)\n      this.gcTimer = null\n    }\n    if (this.subscriberCount === 1 && this.refetchInterval != null) {\n      this.startIntervalTimer()\n    }\n  }\n\n  hasSubscribers(): boolean {\n    return this.subscriberCount > 0\n  }\n\n  release(): void {\n    this.subscriberCount -= 1\n    if (this.subscriberCount <= 0) {\n      this.stopIntervalTimer()\n      if (this.gcTime === 0) {\n        this.client.dropInfiniteEntry(\n          this as unknown as InfiniteClientEntry<unknown, unknown, unknown>,\n        )\n      } else {\n        this.gcTimer = setTimeout(() => {\n          this.gcTimer = null\n          this.client.dropInfiniteEntry(\n            this as unknown as InfiniteClientEntry<unknown, unknown, unknown>,\n          )\n        }, this.gcTime)\n      }\n    }\n  }\n\n  private startIntervalTimer(): void {\n    if (this.refetchInterval == null || this.intervalTimer != null) return\n    this.intervalTimer = setInterval(() => {\n      // Same visibility-gate as the regular `ClientEntry.startIntervalTimer`.\n      if (typeof document !== 'undefined' && document.visibilityState === 'hidden') {\n        return\n      }\n      // Join an in-flight fetch instead of aborting it (T3.2) — see the\n      // regular `ClientEntry.startIntervalTimer` for the livelock rationale.\n      if (this.entry.isFetching.peek()) return\n      this.entry.startFetch().catch(() => {\n        /* error captured on entry */\n      })\n    }, this.refetchInterval)\n  }\n\n  private stopIntervalTimer(): void {\n    if (this.intervalTimer != null) {\n      clearInterval(this.intervalTimer)\n      this.intervalTimer = null\n    }\n  }\n\n  /** See `ClientEntry.scheduleGcIfOrphan`. */\n  scheduleGcIfOrphan(): void {\n    if (this.subscriberCount > 0 || this.gcTimer != null) return\n    if (this.gcTime === 0) {\n      queueMicrotask(() => {\n        if (this.subscriberCount === 0 && this.gcTimer == null) {\n          this.client.dropInfiniteEntry(\n            this as unknown as InfiniteClientEntry<unknown, unknown, unknown>,\n          )\n        }\n      })\n      return\n    }\n    this.gcTimer = setTimeout(() => {\n      this.gcTimer = null\n      this.client.dropInfiniteEntry(\n        this as unknown as InfiniteClientEntry<unknown, unknown, unknown>,\n      )\n    }, this.gcTime)\n  }\n\n  dispose(): void {\n    if (this.gcTimer != null) {\n      clearTimeout(this.gcTimer)\n      this.gcTimer = null\n    }\n    this.stopIntervalTimer()\n    this.entry.dispose()\n  }\n}\n\n/**\n * Per-root entry registry. Owns the keyed `Map<hash, ClientEntry>` per query,\n * GC timers, refetch-interval timers. Subscribers are routed in/out via\n * `acquire` / `release`.\n */\nexport class QueryClient {\n  private readonly maps = new Map<AnyQuery, Map<string, ClientEntry<unknown>>>()\n  private readonly infiniteMaps = new Map<\n    AnyInfiniteQuery,\n    Map<string, InfiniteClientEntry<unknown, unknown, unknown>>\n  >()\n  private readonly touchedQueries = new Set<AnyQuery>()\n  private readonly touchedInfiniteQueries = new Set<AnyInfiniteQuery>()\n  private readonly hydratedData = new Map<string, { data: unknown; lastUpdatedAt: number }>()\n  /** Mutations inflight across the whole root — used by `waitForIdle`. */\n  readonly mutationsInflight$: Signal<number> = signal(0)\n  private onError: ErrorHandler | undefined\n  private disposed = false\n  /** Devtools bus, if any — passed by `createRoot`. Used to emit cache events. */\n  readonly devtools: DevtoolsEmitter | undefined\n\n  /** Root-level deps; passed to every `QuerySpec.fetcher` via `FetchCtx`. */\n  readonly deps: Record<string, unknown>\n\n  /** Root-wide defaults for refetch triggers; per-query spec overrides win. Spec §5.9. */\n  readonly refetchOnWindowFocus: boolean\n  readonly refetchOnReconnect: boolean\n\n  /**\n   * Installed plugins. Fired on every `setData` / `invalidate` / `gc` so\n   * cross-tab / persistence-like layers can observe and react. SPEC §13.2.\n   */\n  private readonly plugins: QueryClientPlugin[]\n  /**\n   * Flipped to `true` while a remote-originated write (via\n   * `applyRemoteSetData` / `applyRemoteInvalidate`) is being applied. The\n   * resulting plugin events carry `isRemote: true` so plugins know to skip\n   * rebroadcast.\n   */\n  private applyingRemote = false\n\n  constructor(opts?: {\n    onError?: ErrorHandler\n    hydrate?: DehydratedState\n    devtools?: DevtoolsEmitter\n    deps?: Record<string, unknown>\n    refetchOnWindowFocus?: boolean\n    refetchOnReconnect?: boolean\n    plugins?: QueryClientPlugin[]\n  }) {\n    this.onError = opts?.onError\n    this.devtools = opts?.devtools\n    this.deps = opts?.deps ?? {}\n    this.refetchOnWindowFocus = opts?.refetchOnWindowFocus ?? false\n    this.refetchOnReconnect = opts?.refetchOnReconnect ?? false\n    this.plugins = opts?.plugins ?? []\n    if (opts?.hydrate) this.hydrate(opts.hydrate)\n    const api = this.makePluginApi()\n    for (const plugin of this.plugins) {\n      this.callPlugin(plugin, () => plugin.init?.(api))\n    }\n  }\n\n  /**\n   * Build the `QueryClientPluginApi` view that plugins receive at `init`\n   * time. Closes over `this`; safe to hand out — plugins call back through\n   * these methods to push remote-originated writes into the local cache.\n   */\n  private makePluginApi(): QueryClientPluginApi {\n    const self = this\n    return {\n      applyRemoteSetData(queryId, keyArgs, data) {\n        self.applyRemoteSetData(queryId, keyArgs, data)\n      },\n      applyRemoteInvalidate(queryId, keyArgs) {\n        self.applyRemoteInvalidate(queryId, keyArgs)\n      },\n      setEntryData(queryId, keyArgs, updater) {\n        self.setEntryData(queryId, keyArgs, updater)\n      },\n      subscribedKeys(queryId) {\n        return self.subscribedKeysFor(queryId)\n      },\n    }\n  }\n\n  /** Invoke a plugin callback; route exceptions through `onError`. */\n  private callPlugin(plugin: QueryClientPlugin, fn: () => void): void {\n    try {\n      fn()\n    } catch (err) {\n      dispatchError(this.onError, err, {\n        kind: 'plugin',\n        controllerPath: [],\n        pluginName: plugin.name,\n      })\n    }\n  }\n\n  /**\n   * Emit a `SetDataEvent` to every installed plugin. The `source` field\n   * tells layered plugins where the write originated:\n   * - `'set'`: explicit `client.setData`, including mutations and plugin-\n   *   initiated `setEntryData` calls (e.g. entity backpropagation).\n   * - `'fetch'`: a query fetcher resolved successfully (`Entry.applySuccess`\n   *   reaches this through `onSuccessData`), or hydrated data was first\n   *   bound (a per-tab arrival of pre-fetched data; cross-tab skips\n   *   `'fetch'` so this stays a per-tab concern).\n   * - `'remote'`: `applyRemoteSetData` — cross-tab / server-push. Mirrors\n   *   `isRemote === true`.\n   *\n   * Private — fetcher-success emission goes through the `onFetchSuccess`\n   * closure that `bindEntry` builds and hands to each new `ClientEntry`.\n   * Hydrated emission goes through this method directly from `bindEntry`.\n   * Mutation / remote paths call it from within QueryClient methods.\n   */\n  private emitSetData(\n    query: AnyQuery | AnyInfiniteQuery,\n    keyArgs: readonly unknown[],\n    data: unknown,\n    kind: 'data' | 'infinite',\n    source: 'set' | 'fetch' | 'remote',\n  ): void {\n    if (this.plugins.length === 0) return\n    const queryId = query.__spec.queryId\n    if (queryId == null) return\n    const event: SetDataEvent = {\n      queryId,\n      keyArgs,\n      data,\n      kind,\n      isRemote: this.applyingRemote,\n      source,\n    }\n    for (const plugin of this.plugins) {\n      if (plugin.onSetData) {\n        const cb = plugin.onSetData\n        this.callPlugin(plugin, () => cb.call(plugin, event))\n      }\n    }\n  }\n\n  private emitInvalidate(\n    query: AnyQuery | AnyInfiniteQuery,\n    keyArgs: readonly unknown[],\n    kind: 'data' | 'infinite',\n  ): void {\n    if (this.plugins.length === 0) return\n    const queryId = query.__spec.queryId\n    if (queryId == null) return\n    const event: InvalidateEvent = {\n      queryId,\n      keyArgs,\n      kind,\n      isRemote: this.applyingRemote,\n    }\n    for (const plugin of this.plugins) {\n      if (plugin.onInvalidate) {\n        const cb = plugin.onInvalidate\n        this.callPlugin(plugin, () => cb.call(plugin, event))\n      }\n    }\n  }\n\n  private emitGc(\n    query: AnyQuery | AnyInfiniteQuery,\n    keyArgs: readonly unknown[],\n    kind: 'data' | 'infinite',\n  ): void {\n    if (this.plugins.length === 0) return\n    const queryId = query.__spec.queryId\n    if (queryId == null) return\n    const event: GcEvent = { queryId, keyArgs, kind }\n    for (const plugin of this.plugins) {\n      if (plugin.onGc) {\n        const cb = plugin.onGc\n        this.callPlugin(plugin, () => cb.call(plugin, event))\n      }\n    }\n  }\n\n  /**\n   * Fan out a `MutationEnqueueEvent` to every installed plugin. Called from\n   * `MutationImpl.executeRun` when `spec.persist === true`. Plugins use this\n   * to write the run to durable storage; the queue replays on reload. SPEC §13.3.\n   */\n  emitMutationEnqueue(event: {\n    mutationId: string\n    runId: string\n    variables: unknown\n    attempt: number\n  }): void {\n    if (this.plugins.length === 0) return\n    for (const plugin of this.plugins) {\n      if (plugin.onMutationEnqueue) {\n        const cb = plugin.onMutationEnqueue\n        this.callPlugin(plugin, () => cb.call(plugin, event))\n      }\n    }\n  }\n\n  /** Fan out a `MutationSettleEvent` to every installed plugin. SPEC §13.3. */\n  emitMutationSettle(event: {\n    mutationId: string\n    runId: string\n    outcome: 'success' | 'error' | 'cancelled'\n    error?: unknown\n  }): void {\n    if (this.plugins.length === 0) return\n    for (const plugin of this.plugins) {\n      if (plugin.onMutationSettle) {\n        const cb = plugin.onMutationSettle\n        this.callPlugin(plugin, () => cb.call(plugin, event))\n      }\n    }\n  }\n\n  /** Resolve `queryId → live entry-map keys`. Empty array when unknown. */\n  private subscribedKeysFor(queryId: string): readonly (readonly unknown[])[] {\n    // Defer the registry lookup to avoid an eager circular import — `define.ts`\n    // imports `QueryClient` as a type, and we import the registry helper here\n    // for runtime use only.\n    const query = lookupRegisteredQuery(queryId)\n    if (!query) return []\n    const out: (readonly unknown[])[] = []\n    if (query.__olas === 'query') {\n      const map = this.maps.get(query as unknown as AnyQuery)\n      if (map) for (const ce of map.values()) out.push(ce.keyArgs)\n    } else {\n      const map = this.infiniteMaps.get(query as unknown as AnyInfiniteQuery)\n      if (map) for (const ce of map.values()) out.push(ce.keyArgs)\n    }\n    return out\n  }\n\n  /**\n   * Apply a remote-originated `setData` for the query identified by\n   * `queryId`, scoped to the entry already keyed by `keyArgs` in this\n   * client. Goes through the underlying `Entry.setData` so subscribers see\n   * the write; plugin `onSetData` fires with `isRemote: true`.\n   *\n   * Drops silently when:\n   * - No query with that id is registered (the receiving tab hasn't\n   *   imported the module that defined it).\n   * - The registered query is an infinite query (cross-tab infinite sync\n   *   is deferred — see `plugin.ts` `SetDataEvent.kind`).\n   * - No local entry exists for that key (the receiving tab isn't\n   *   subscribed; nothing useful to write to without callArgs for a\n   *   future refetch).\n   */\n  applyRemoteSetData(queryId: string, keyArgs: readonly unknown[], data: unknown): void {\n    const query = lookupRegisteredQuery(queryId)\n    if (!query) return\n    if (query.__olas !== 'query') return // infinite — deferred for v1\n    const internal = query as unknown as AnyQuery\n    const map = this.maps.get(internal)\n    if (!map) return\n    const hash = stableHash(keyArgs)\n    const entry = map.get(hash)\n    if (!entry) return\n    this.applyingRemote = true\n    try {\n      entry.entry.setData(() => data as never, { track: false })\n      this.emitSetData(internal, entry.keyArgs, data, 'data', 'remote')\n    } finally {\n      this.applyingRemote = false\n    }\n  }\n\n  /**\n   * Apply a single dehydrated entry to the cache. Idempotent across\n   * pre-bind / post-bind:\n   *\n   * - If the matching `ClientEntry` already exists (a subscriber has\n   *   bound this key), `Entry.applyHydration(data, lastUpdatedAt)` writes\n   *   through with the server's timestamp + supersedes any inflight\n   *   fetch. Plugins see a `SetDataEvent` with `source: 'remote'`.\n   * - If no `ClientEntry` exists yet (the subscribing component hasn't\n   *   mounted), the entry is buffered in `hydratedData` so the next\n   *   `bindEntry` for that hash picks it up — same path the constructor\n   *   `hydrate(state)` uses.\n   *\n   * Designed for streaming SSR: each `<Suspense>` boundary that resolves\n   * on the server pushes its dehydrated entry through this method on the\n   * client as the bootstrap script executes.\n   */\n  applyDehydratedEntry(\n    queryId: string,\n    keyArgs: readonly unknown[],\n    data: unknown,\n    lastUpdatedAt: number,\n  ): void {\n    const query = lookupRegisteredQuery(queryId)\n    const hash = stableHash(keyArgs)\n    if (query && query.__olas === 'query') {\n      const internal = query as unknown as AnyQuery\n      const map = this.maps.get(internal)\n      const entry = map?.get(hash)\n      if (entry !== undefined) {\n        this.applyingRemote = true\n        try {\n          entry.entry.applyHydration(data, lastUpdatedAt)\n          this.emitSetData(internal, entry.keyArgs, data, 'data', 'remote')\n        } finally {\n          this.applyingRemote = false\n        }\n        return\n      }\n    }\n    // No local entry yet — buffer in the same map the constructor uses.\n    // The next bindEntry for this query + key will adopt the buffered payload\n    // and clear the slot. Namespaced by queryId so a colliding-key query can't\n    // steal it (spec §15, T1.2).\n    this.hydratedData.set(hydrationKey(queryId, hash), { data, lastUpdatedAt })\n  }\n\n  /**\n   * Local-originated `setData` keyed by `queryId + keyArgs`. Plugin-facing\n   * (exposed via `QueryClientPluginApi.setEntryData`); used by the\n   * `@kontsedal/olas-entities` plugin to backpropagate entity patches into\n   * every query holding the entity, without forcing the plugin to recover\n   * the original `callArgs`.\n   *\n   * Drops silently in the same cases as `applyRemoteSetData` (unknown\n   * queryId / infinite query / no local entry). Emits `SetDataEvent` with\n   * `isRemote: false`, `source: 'set'` — cross-tab WILL rebroadcast.\n   */\n  setEntryData(\n    queryId: string,\n    keyArgs: readonly unknown[],\n    updater: (prev: unknown) => unknown,\n  ): void {\n    const query = lookupRegisteredQuery(queryId)\n    if (!query) return\n    const hash = stableHash(keyArgs)\n    if (query.__olas === 'query') {\n      const internal = query as unknown as AnyQuery\n      const map = this.maps.get(internal)\n      if (!map) return\n      const entry = map.get(hash)\n      if (!entry) return\n      entry.entry.setData(updater as (prev: unknown) => never, { track: false })\n      this.emitSetData(internal, entry.keyArgs, entry.entry.data.peek(), 'data', 'set')\n      return\n    }\n    // Infinite query. The plugin's `SetDataEvent.data` for `kind: 'infinite'`\n    // is `TPage[]` (the pages array), so the same path-based walk + write\n    // mechanics apply — we just route through `InfiniteEntry.setData` and\n    // re-emit with `kind: 'infinite'`.\n    const internal = query as unknown as AnyInfiniteQuery\n    const map = this.infiniteMaps.get(internal)\n    if (!map) return\n    const entry = map.get(hash)\n    if (!entry) return\n    entry.entry.setData(updater as (prev: unknown[] | undefined) => unknown[], { track: false })\n    this.emitSetData(internal, entry.keyArgs, entry.entry.pages.peek(), 'infinite', 'set')\n  }\n\n  applyRemoteInvalidate(queryId: string, keyArgs: readonly unknown[]): void {\n    const query = lookupRegisteredQuery(queryId)\n    if (!query) return\n    if (query.__olas !== 'query') return // infinite — deferred for v1\n    const internal = query as unknown as AnyQuery\n    const map = this.maps.get(internal)\n    if (!map) return\n    const hash = stableHash(keyArgs)\n    const entry = map.get(hash)\n    if (!entry) return\n    this.applyingRemote = true\n    try {\n      // Emit AFTER kicking off invalidate so plugins reading entry state see\n      // post-invalidation values, mirroring setData's emit-after-write order.\n      entry.entry.invalidate().catch((err) => {\n        // Two rapid invalidates on the same key supersede each other, which\n        // raises AbortError. That's not a cache error — swallow.\n        if (isAbortError(err)) return\n        dispatchError(this.onError, err, {\n          kind: 'cache',\n          controllerPath: [],\n          queryKey: entry.keyArgs,\n        })\n      })\n      this.emitInvalidate(internal, entry.keyArgs, 'data')\n    } finally {\n      this.applyingRemote = false\n    }\n  }\n\n  hydrate(state: DehydratedState): void {\n    if (state.version !== 1) {\n      // Silent drop hid schema-bumped payloads. Warn so a future spec bump is\n      // detectable from the client side without code archaeology.\n      if (__DEV__) {\n        // eslint-disable-next-line no-console\n        console.warn(\n          '[olas] hydrate(): unsupported state.version =',\n          state.version,\n          '— expected 1. Dropping payload; cache will fetch fresh.',\n        )\n      }\n      return\n    }\n    for (const entry of state.entries) {\n      const hash = stableHash(entry.key)\n      this.hydratedData.set(hydrationKey(entry.id, hash), {\n        data: entry.data,\n        lastUpdatedAt: entry.lastUpdatedAt,\n      })\n    }\n  }\n\n  /**\n   * Snapshot every live cache entry (regular + infinite) as a flat list of\n   * `DebugCacheEntry`. Exposed via `root.__debug.queryEntries()` for the\n   * devtools cache inspector — shows current data and state, not past\n   * fetch events. Spec §20.9.\n   */\n  queryEntriesSnapshot(): import('../devtools').DebugCacheEntry[] {\n    const out: import('../devtools').DebugCacheEntry[] = []\n    for (const map of this.maps.values()) {\n      for (const ce of map.values()) {\n        out.push({\n          key: ce.keyArgs as readonly unknown[],\n          status: ce.entry.status.peek(),\n          data: ce.entry.data.peek(),\n          error: ce.entry.error.peek(),\n          lastUpdatedAt: ce.entry.lastUpdatedAt.peek(),\n          isStale: ce.entry.isStale.peek(),\n          isFetching: ce.entry.isFetching.peek(),\n          hasPendingMutations: ce.entry.hasPendingMutations.peek(),\n        })\n      }\n    }\n    for (const map of this.infiniteMaps.values()) {\n      for (const ce of map.values()) {\n        out.push({\n          key: ce.keyArgs as readonly unknown[],\n          status: ce.entry.status.peek(),\n          // Infinite entries carry an array of pages; expose them verbatim.\n          data: ce.entry.pages.peek(),\n          error: ce.entry.error.peek(),\n          lastUpdatedAt: ce.entry.lastUpdatedAt.peek(),\n          isStale: ce.entry.isStale.peek(),\n          isFetching: ce.entry.isFetching.peek(),\n          hasPendingMutations: ce.entry.hasPendingMutations.peek(),\n        })\n      }\n    }\n    return out\n  }\n\n  dehydrate(): DehydratedState {\n    const entries: DehydratedState['entries'] = []\n    for (const [query, map] of this.maps) {\n      for (const ce of map.values()) {\n        if (ce.entry.status.peek() === 'success') {\n          entries.push({\n            id: query.__id,\n            key: ce.keyArgs,\n            data: ce.entry.data.peek(),\n            lastUpdatedAt: ce.entry.lastUpdatedAt.peek() ?? Date.now(),\n          })\n        }\n      }\n    }\n    return { version: 1, entries }\n  }\n\n  async waitForIdle(): Promise<void> {\n    for (let safety = 0; safety < 100; safety++) {\n      const tasks: Promise<void>[] = []\n      for (const map of this.maps.values()) {\n        for (const ce of map.values()) {\n          if (ce.entry.isFetching.peek()) {\n            tasks.push(waitUntilFalse(ce.entry.isFetching))\n          }\n        }\n      }\n      for (const map of this.infiniteMaps.values()) {\n        for (const ce of map.values()) {\n          if (ce.entry.isFetching.peek()) {\n            tasks.push(waitUntilFalse(ce.entry.isFetching))\n          }\n        }\n      }\n      if (this.mutationsInflight$.peek() > 0) {\n        tasks.push(\n          new Promise<void>((resolve) => {\n            const unsub = this.mutationsInflight$.subscribe((v) => {\n              if (v === 0) {\n                unsub()\n                resolve()\n              }\n            })\n          }),\n        )\n      }\n      if (tasks.length === 0) return\n      await Promise.all(tasks)\n    }\n    // The 100-iteration safety bound exists so a pathological setup that\n    // keeps starting new fetches doesn't lock the dehydrate path. This is\n    // a correctness failure for SSR: silently returning would let\n    // `dehydrate()` ship an incomplete payload that looks clean. Throw so\n    // the SSR boundary surfaces it instead of pretending success.\n    const unsettled: Array<{ key: readonly unknown[]; kind: 'data' | 'infinite' }> = []\n    for (const map of this.maps.values()) {\n      for (const ce of map.values()) {\n        if (ce.entry.isFetching.peek()) unsettled.push({ key: ce.keyArgs, kind: 'data' })\n      }\n    }\n    for (const map of this.infiniteMaps.values()) {\n      for (const ce of map.values()) {\n        if (ce.entry.isFetching.peek()) unsettled.push({ key: ce.keyArgs, kind: 'infinite' })\n      }\n    }\n    const err = new Error(\n      '[olas] waitForIdle: exceeded 100-iteration safety bound — cache or mutations keep restarting',\n    ) as Error & { unsettled: typeof unsettled; mutationsInflight: number }\n    err.unsettled = unsettled\n    err.mutationsInflight = this.mutationsInflight$.peek()\n    throw err\n  }\n\n  bindEntry<Args extends unknown[], T>(query: Query<Args, T>, args: Args): ClientEntry<T> {\n    const internal = query as AnyQuery\n    let map = this.maps.get(internal)\n    if (!map) {\n      map = new Map()\n      this.maps.set(internal, map)\n      this.touchedQueries.add(internal)\n      internal.__clients.add(this)\n    }\n    const keyArgs = internal.__spec.key(...args)\n    const hash = stableHash(keyArgs)\n    let entry = map.get(hash) as ClientEntry<T> | undefined\n    if (!entry) {\n      const hkey = hydrationKey(internal.__id, hash)\n      const hydrated = this.hydratedData.get(hkey) as { data: T; lastUpdatedAt: number } | undefined\n      if (hydrated) this.hydratedData.delete(hkey)\n      // Build the fetcher-success emitter here so `emitSetData` can stay\n      // `private` — `ClientEntry` doesn't reach back into the client to call\n      // it; the closure captures (query, keyArgs, this) in this scope and\n      // is consumed by `Entry.onSuccessData` from inside `applySuccess`.\n      const onFetchSuccess: ((data: T) => void) | undefined =\n        internal.__spec.queryId != null\n          ? (data) => this.emitSetData(internal, keyArgs, data, 'data', 'fetch')\n          : undefined\n      entry = new ClientEntry<T>(\n        this,\n        internal,\n        args,\n        keyArgs,\n        internal.__spec,\n        hydrated,\n        onFetchSuccess,\n      )\n      map.set(hash, entry as ClientEntry<unknown>)\n      // The entry is created without an immediate subscriber (callers like\n      // `prefetch`/`setData`/`invalidate` reach `bindEntry` first; subscribing\n      // callers then call `acquire()` right after, which clears the gc timer).\n      entry.scheduleGcIfOrphan()\n      // Hydrated data lands in `initialData` on the new Entry — `applySuccess`\n      // is never called, so plugins observing fetch results (entities, ...)\n      // would otherwise miss every hydrated row. Emit a SetDataEvent with\n      // `source: 'fetch'` here once the entry is registered (and the plugin\n      // is already init'd, since the QueryClient constructor runs hydrate →\n      // plugin init before any subscriber can reach bindEntry). The fetch\n      // source is correct for layered consumers: each tab hydrates\n      // independently, so cross-tab's \"skip 'fetch'\" gate continues to do\n      // the right thing.\n      if (hydrated !== undefined) {\n        this.emitSetData(internal, keyArgs, hydrated.data, 'data', 'fetch')\n      }\n    } else if (__DEV__) {\n      // The fetcher closure is captured on first `bindEntry`. If a later\n      // subscriber binds the SAME `keyArgs` (same hash) but DIFFERENT\n      // `callArgs`, the next refetch will still use the first caller's\n      // arguments — a silent staleness footgun when a `key()` function\n      // collapses non-key args (e.g. headers, abort tokens). Warn so the\n      // mismatch is surfaced; the consumer should either include the diff\n      // in the key or accept the documented \"first wins\" behavior.\n      const prev = entry.callArgs\n      const len = Math.max(prev.length, args.length)\n      let mismatch = prev.length !== args.length\n      for (let i = 0; i < len && !mismatch; i++) {\n        if (!Object.is(prev[i], args[i])) mismatch = true\n      }\n      if (mismatch) {\n        // eslint-disable-next-line no-console\n        console.warn(\n          `[olas] bindEntry: hash collision with diverging callArgs for query` +\n            ` ${internal.__spec.queryId ?? '<anonymous>'} key=${JSON.stringify(keyArgs)}.` +\n            ` First bind's args are used by the fetcher; later args ignored.` +\n            ` Either include the difference in spec.key(...) or pass identical args.`,\n        )\n      }\n    }\n    return entry\n  }\n\n  dropEntry(entry: ClientEntry<unknown>): void {\n    const map = this.maps.get(entry.query)\n    if (!map) return\n    const hash = stableHash(entry.keyArgs)\n    if (map.get(hash) !== entry) return\n    map.delete(hash)\n    entry.dispose()\n    if (map.size === 0) {\n      this.maps.delete(entry.query)\n    }\n    if (__DEV__) {\n      this.devtools?.emit({ type: 'cache:gc', queryKey: entry.keyArgs })\n    }\n    this.emitGc(entry.query, entry.keyArgs, 'data')\n  }\n\n  /**\n   * Invalidate one entry: if it has subscribers, mark stale AND refetch; if\n   * not, mark stale only — the next subscriber refetches. Spec §5.7 says\n   * invalidate refetches only IF subscribed; the old always-fetch behavior woke\n   * orphaned entries that no one was watching (T3.9). Works for both\n   * `ClientEntry` and `InfiniteClientEntry`.\n   */\n  private invalidateEntry(entry: {\n    hasSubscribers(): boolean\n    keyArgs: readonly unknown[]\n    entry: { invalidate(): Promise<unknown>; markStale(): void }\n  }): void {\n    if (entry.hasSubscribers()) {\n      entry.entry.invalidate().catch((err) => {\n        if (isAbortError(err)) return\n        dispatchError(this.onError, err, {\n          kind: 'cache',\n          controllerPath: [],\n          queryKey: entry.keyArgs,\n        })\n      })\n    } else {\n      entry.entry.markStale()\n    }\n  }\n\n  invalidate<Args extends unknown[]>(query: Query<Args, any>, args: Args): void {\n    const internal = query as AnyQuery\n    const map = this.maps.get(internal)\n    if (!map) return\n    const keyArgs = internal.__spec.key(...args)\n    const hash = stableHash(keyArgs)\n    const entry = map.get(hash)\n    if (!entry) return\n    if (__DEV__) {\n      this.devtools?.emit({ type: 'cache:invalidated', queryKey: keyArgs })\n    }\n    this.invalidateEntry(entry)\n    this.emitInvalidate(internal, keyArgs, 'data')\n  }\n\n  invalidateAll(query: Query<any, any>): void {\n    const internal = query as AnyQuery\n    const map = this.maps.get(internal)\n    if (!map) return\n    for (const [hash, entry] of map) {\n      void hash\n      if (__DEV__) {\n        this.devtools?.emit({ type: 'cache:invalidated', queryKey: entry.keyArgs })\n      }\n      this.invalidateEntry(entry)\n      this.emitInvalidate(internal, entry.keyArgs, 'data')\n    }\n  }\n\n  cancel<Args extends unknown[]>(query: Query<Args, any>, args: Args): void {\n    const internal = query as AnyQuery\n    const map = this.maps.get(internal)\n    if (!map) return\n    const hash = stableHash(internal.__spec.key(...args))\n    map.get(hash)?.entry.cancel()\n  }\n\n  cancelAll(query: Query<any, any>): void {\n    const map = this.maps.get(query as AnyQuery)\n    if (!map) return\n    for (const entry of map.values()) entry.entry.cancel()\n  }\n\n  setData<Args extends unknown[], T>(\n    query: Query<Args, T>,\n    args: Args,\n    updater: (prev: T | undefined) => T,\n  ): Snapshot {\n    const entry = this.bindEntry(query, args)\n    const snapshot = entry.entry.setData(updater)\n    // Read the post-update value to broadcast — plugins want the new state,\n    // not the updater function (which would be uncloneable across\n    // BroadcastChannel).\n    this.emitSetData(entry.query, entry.keyArgs, entry.entry.data.peek(), 'data', 'set')\n    // Re-broadcast on rollback so cross-tab / entity plugins drop the failed\n    // optimistic value instead of keeping it (T3.6). Guard on an actual data\n    // change: a non-top chain-splice rollback (§6.4) leaves current data\n    // untouched, so there is nothing new to broadcast.\n    return {\n      rollback: () => {\n        const before = entry.entry.data.peek()\n        snapshot.rollback()\n        const after = entry.entry.data.peek()\n        if (!Object.is(before, after)) {\n          this.emitSetData(entry.query, entry.keyArgs, after, 'data', 'set')\n        }\n      },\n      finalize: () => snapshot.finalize(),\n    }\n  }\n\n  bindInfiniteEntry<Args extends unknown[], TPage, TItem>(\n    query: InfiniteQuery<Args, TPage, TItem>,\n    args: Args,\n  ): InfiniteClientEntry<TPage, TItem, unknown> {\n    const internal = query as AnyInfiniteQuery\n    let map = this.infiniteMaps.get(internal)\n    if (!map) {\n      map = new Map()\n      this.infiniteMaps.set(internal, map)\n      this.touchedInfiniteQueries.add(internal)\n      internal.__clients.add(this)\n    }\n    const keyArgs = internal.__spec.key(...args)\n    const hash = stableHash(keyArgs)\n    let entry = map.get(hash) as InfiniteClientEntry<TPage, TItem, unknown> | undefined\n    if (!entry) {\n      // Mirror the regular-query plumbing in `bindEntry`: build the\n      // SetDataEvent emitter here so `emitSetData` stays private. The\n      // closure captures (query, keyArgs, this) and is consumed by\n      // `InfiniteEntry.onSuccessData` from inside each successful page\n      // batch (initial, next, prev).\n      const onFetchSuccess: ((pages: TPage[]) => void) | undefined =\n        internal.__spec.queryId != null\n          ? (pages) => this.emitSetData(internal, keyArgs, pages, 'infinite', 'fetch')\n          : undefined\n      entry = new InfiniteClientEntry<TPage, TItem, unknown>(\n        this,\n        internal,\n        args,\n        keyArgs,\n        internal.__spec,\n        onFetchSuccess,\n      )\n      map.set(hash, entry as InfiniteClientEntry<unknown, unknown, unknown>)\n      entry.scheduleGcIfOrphan()\n    }\n    return entry\n  }\n\n  dropInfiniteEntry(entry: InfiniteClientEntry<unknown, unknown, unknown>): void {\n    const map = this.infiniteMaps.get(entry.query)\n    if (!map) return\n    const hash = stableHash(entry.keyArgs)\n    if (map.get(hash) !== entry) return\n    map.delete(hash)\n    entry.dispose()\n    if (map.size === 0) {\n      this.infiniteMaps.delete(entry.query)\n    }\n    this.emitGc(entry.query, entry.keyArgs, 'infinite')\n  }\n\n  invalidateInfinite<Args extends unknown[]>(\n    query: InfiniteQuery<Args, any, any>,\n    args: Args,\n  ): void {\n    const internal = query as AnyInfiniteQuery\n    const map = this.infiniteMaps.get(internal)\n    if (!map) return\n    const keyArgs = internal.__spec.key(...args)\n    const hash = stableHash(keyArgs)\n    const entry = map.get(hash)\n    if (!entry) return\n    this.invalidateEntry(entry)\n    this.emitInvalidate(internal, keyArgs, 'infinite')\n  }\n\n  invalidateAllInfinite(query: InfiniteQuery<any, any, any>): void {\n    const internal = query as AnyInfiniteQuery\n    const map = this.infiniteMaps.get(internal)\n    if (!map) return\n    for (const entry of map.values()) {\n      this.invalidateEntry(entry)\n      this.emitInvalidate(internal, entry.keyArgs, 'infinite')\n    }\n  }\n\n  cancelInfinite<Args extends unknown[]>(query: InfiniteQuery<Args, any, any>, args: Args): void {\n    const internal = query as AnyInfiniteQuery\n    const map = this.infiniteMaps.get(internal)\n    if (!map) return\n    const hash = stableHash(internal.__spec.key(...args))\n    map.get(hash)?.entry.cancel()\n  }\n\n  cancelAllInfinite(query: InfiniteQuery<any, any, any>): void {\n    const map = this.infiniteMaps.get(query as AnyInfiniteQuery)\n    if (!map) return\n    for (const entry of map.values()) entry.entry.cancel()\n  }\n\n  setInfiniteData<Args extends unknown[], TPage>(\n    query: InfiniteQuery<Args, TPage, any>,\n    args: Args,\n    updater: (prev: TPage[] | undefined) => TPage[],\n  ): Snapshot {\n    const entry = this.bindInfiniteEntry(query, args)\n    const snapshot = entry.entry.setData(updater)\n    this.emitSetData(entry.query, entry.keyArgs, entry.entry.pages.peek(), 'infinite', 'set')\n    // Re-broadcast on rollback so peers drop the failed optimistic pages\n    // (T3.6); guard on an actual change (non-top chain-splice is a no-op).\n    return {\n      rollback: () => {\n        const before = entry.entry.pages.peek()\n        snapshot.rollback()\n        const after = entry.entry.pages.peek()\n        if (!Object.is(before, after)) {\n          this.emitSetData(entry.query, entry.keyArgs, after, 'infinite', 'set')\n        }\n      },\n      finalize: () => snapshot.finalize(),\n    }\n  }\n\n  prefetchInfinite<Args extends unknown[], TPage>(\n    query: InfiniteQuery<Args, TPage, any>,\n    args: Args,\n  ): Promise<TPage> {\n    const entry = this.bindInfiniteEntry(query, args)\n    // Acquire/release wraps the fetch so the entry isn't gc'd mid-flight by\n    // the orphan-gc timer scheduled in `bindInfiniteEntry`.\n    entry.acquire()\n    const promise = (async () => {\n      const status = entry.entry.status.peek()\n      if (status === 'success' && !entry.entry.isStaleNow()) {\n        return entry.entry.pages.peek()[0] as TPage\n      }\n      return entry.entry.startFetch()\n    })()\n    return promise.finally(() => entry.release())\n  }\n\n  prefetch<Args extends unknown[], T>(query: Query<Args, T>, args: Args): Promise<T> {\n    const entry = this.bindEntry(query, args)\n    entry.acquire()\n    const promise = (async () => {\n      const status = entry.entry.status.peek()\n      if (status === 'success' && !entry.entry.isStaleNow()) {\n        return entry.entry.data.peek() as T\n      }\n      if (entry.entry.isFetching.peek()) {\n        return entry.entry.firstValue()\n      }\n      return entry.entry.startFetch()\n    })()\n    return promise.finally(() => entry.release())\n  }\n\n  inflightCount(): number {\n    let count = 0\n    for (const [, map] of this.maps) {\n      for (const [, entry] of map) {\n        if (entry.entry.isFetching.peek()) count++\n      }\n    }\n    return count\n  }\n\n  dispose(): void {\n    if (this.disposed) return\n    this.disposed = true\n    for (const map of this.maps.values()) {\n      for (const entry of map.values()) {\n        entry.dispose()\n      }\n    }\n    this.maps.clear()\n    for (const map of this.infiniteMaps.values()) {\n      for (const entry of map.values()) {\n        entry.dispose()\n      }\n    }\n    this.infiniteMaps.clear()\n    for (const q of this.touchedQueries) {\n      q.__clients.delete(this)\n    }\n    this.touchedQueries.clear()\n    for (const q of this.touchedInfiniteQueries) {\n      q.__clients.delete(this)\n    }\n    this.touchedInfiniteQueries.clear()\n    this.hydratedData.clear()\n    for (const plugin of this.plugins) {\n      if (plugin.dispose) {\n        const cb = plugin.dispose\n        this.callPlugin(plugin, () => cb.call(plugin))\n      }\n    }\n  }\n}\n\nfunction waitUntilFalse(sig: {\n  peek(): boolean\n  subscribe(h: (v: boolean) => void): () => void\n}): Promise<void> {\n  if (!sig.peek()) return Promise.resolve()\n  return new Promise<void>((resolve) => {\n    const unsub = sig.subscribe((v) => {\n      if (!v) {\n        unsub()\n        resolve()\n      }\n    })\n  })\n}\n","/**\n * Synchronous fan-out event bus. Handlers run in the order they subscribed.\n *\n * Emission iterates a SNAPSHOT of the handler set taken at the start of\n * `emit()`. So within one emission: a handler added during emit does NOT fire\n * for the current emission, and a handler removed during emit STILL fires for\n * the current emission (it was captured in the snapshot).\n *\n * Handlers are stored in a `Set` keyed by reference — calling `on(h)` twice\n * with the same `h` registers it ONCE; a single unsubscribe then removes it.\n *\n * `Emitter<void>` exposes `emit()` (no argument); other shapes expose\n * `emit(value: T)`.\n *\n * Spec §7, §20.6.\n */\nexport type Emitter<T> = {\n  emit: [T] extends [void] ? () => void : (value: T) => void\n  /** Subscribe to every emission. Returns the unsubscribe function. */\n  on(handler: (value: T) => void): () => void\n  /** Subscribe to the next emission only. Auto-unsubscribes after firing. */\n  once(handler: (value: T) => void): () => void\n  /** Tear down the emitter. Subsequent `emit` / `on` / `once` are no-ops. */\n  dispose(): void\n}\n\ntype AnyHandler = (value: unknown) => void\n\n/**\n * Optional escape hatch for emit-time handler throws. If supplied, a thrown\n * handler is reported here and emission continues with the remaining handlers\n * (spec §20.6 — one throwing handler must not block the rest). If absent,\n * the throw is logged via `console.error`.\n */\nexport type EmitterErrorReporter = (err: unknown) => void\n\nclass EmitterImpl<T> {\n  private handlers = new Set<AnyHandler>()\n  private disposed = false\n\n  constructor(private onError?: EmitterErrorReporter) {}\n\n  emit(value: T): void {\n    if (this.disposed) return\n    // Snapshot so a handler that unsubscribes itself (or another) doesn't\n    // mutate the set mid-iteration.\n    const snapshot = Array.from(this.handlers)\n    for (const handler of snapshot) {\n      try {\n        handler(value as unknown)\n      } catch (err) {\n        // Spec §20.6: isolate handler throws so siblings still fire.\n        if (this.onError) {\n          try {\n            this.onError(err)\n          } catch {\n            // Reporter itself threw — last resort.\n            // eslint-disable-next-line no-console\n            console.error('[olas] emitter handler threw and reporter threw:', err)\n          }\n        } else {\n          // eslint-disable-next-line no-console\n          console.error('[olas] emitter handler threw:', err)\n        }\n      }\n    }\n  }\n\n  on(handler: (value: T) => void): () => void {\n    if (this.disposed) return () => {}\n    const wrapped = handler as AnyHandler\n    this.handlers.add(wrapped)\n    return () => {\n      this.handlers.delete(wrapped)\n    }\n  }\n\n  once(handler: (value: T) => void): () => void {\n    if (this.disposed) return () => {}\n    const wrapped: AnyHandler = (value) => {\n      this.handlers.delete(wrapped)\n      handler(value as T)\n    }\n    this.handlers.add(wrapped)\n    return () => {\n      this.handlers.delete(wrapped)\n    }\n  }\n\n  dispose(): void {\n    if (this.disposed) return\n    this.disposed = true\n    this.handlers.clear()\n  }\n}\n\n/**\n * Create a standalone emitter. Handlers persist until explicitly unsubscribed\n * (or the emitter is disposed). Use this for emitters that live outside any\n * single controller — typically in deps. Use `ctx.emitter()` for emitters that\n * should auto-clean with a controller.\n *\n * Pass `onError` to receive emit-time handler throws (spec §20.6 — one\n * throwing handler must not block the rest of the fan-out). `ctx.emitter()`\n * wires this to the root's `onError` so deps-level emitters get isolation\n * by default when constructed via `ctx`.\n */\nexport function createEmitter<T = void>(options?: { onError?: EmitterErrorReporter }): Emitter<T> {\n  const impl = new EmitterImpl<T>(options?.onError)\n  return {\n    emit: ((value?: T) => impl.emit(value as T)) as Emitter<T>['emit'],\n    on: (handler) => impl.on(handler),\n    once: (handler) => impl.once(handler),\n    dispose: () => impl.dispose(),\n  }\n}\n","import type { Field } from '../controller/types'\nimport type { DevtoolsEmitter } from '../devtools'\nimport {\n  batch,\n  type Computed,\n  computed,\n  effect,\n  type ReadSignal,\n  type Signal,\n  signal,\n} from '../signals'\nimport { isAbortError } from '../utils'\nimport type { Validator, ValidatorResult } from './types'\n\n/**\n * Flatten a single validator result to plain message strings for a leaf field.\n * A leaf has no descendants, so a `FormIssue[]`'s paths don't route anywhere —\n * every issue's `message` applies to this field. `null` → no messages.\n */\nfunction messagesFromResult(result: ValidatorResult): string[] {\n  if (result == null) return []\n  if (typeof result === 'string') return [result]\n  return result.map((issue) => issue.message)\n}\n\n/**\n * Structural equality used by `Field.set` to decide whether a write returns\n * the field to its initial value (clearing `isDirty`). Cheap path for\n * primitives + `Object.is`; deep walk for arrays and plain objects. Class\n * instances, Map, Set, Date fall back to reference identity — same trade-off\n * `structural-share.ts` makes for cache data.\n */\nfunction isStructurallyEqual(a: unknown, b: unknown): boolean {\n  if (Object.is(a, b)) return true\n  if (a === null || b === null || typeof a !== 'object' || typeof b !== 'object') return false\n  if (Array.isArray(a)) {\n    if (!Array.isArray(b) || a.length !== b.length) return false\n    for (let i = 0; i < a.length; i++) {\n      if (!isStructurallyEqual(a[i], b[i])) return false\n    }\n    return true\n  }\n  if (Array.isArray(b)) return false\n  const protoA = Object.getPrototypeOf(a)\n  const protoB = Object.getPrototypeOf(b)\n  // Plain-object guard only — class instances aren't safe to walk by keys.\n  if (protoA !== Object.prototype && protoA !== null) return false\n  if (protoB !== Object.prototype && protoB !== null) return false\n  const keysA = Object.keys(a as Record<string, unknown>)\n  const keysB = Object.keys(b as Record<string, unknown>)\n  if (keysA.length !== keysB.length) return false\n  for (const k of keysA) {\n    if (!Object.hasOwn(b as object, k)) return false\n    if (\n      !isStructurallyEqual((a as Record<string, unknown>)[k], (b as Record<string, unknown>)[k])\n    ) {\n      return false\n    }\n  }\n  return true\n}\n\n/**\n * Hook attached by `ctx.form` (or `createForm`) so a Field can publish\n * `field:validated` devtools events with its owning controller path + the\n * field's name within the form schema. See devtools §20.9 and FieldImpl.bind.\n */\nexport type FieldDevtoolsOwner = {\n  controllerPath: readonly string[]\n  fieldName: string\n  emitter: DevtoolsEmitter\n}\n\n/**\n * Optional reporter for synchronous validator throws — wired in by `ctx.field`\n * (and `createForm` for leaf fields inside a form) so a thrown validator\n * doesn't escape the signal effect silently. Without this, a buggy validator\n * just stops contributing to `errors` and the field reads as \"valid\" while\n * silently broken. With it, the throw is routed through `root.onError` as\n * `kind: 'effect'` AND the throw's message lands in the field's `errors`\n * array so the UI surfaces the problem.\n */\nexport type ValidatorErrorReporter = (err: unknown) => void\n\n/**\n * When a field's validators are first allowed to run.\n *\n * - `'change'` (default) — validators run on every `set()`. Matches the\n *   current behavior, ideal for \"type and see errors live.\"\n * - `'blur'` — first run is gated on `markTouched()`. After that, subsequent\n *   value changes do trigger re-validation. UI binding should call\n *   `markTouched()` on `onBlur`.\n * - `'submit'` — first run is gated on `revalidate()` / `Form.submit()`.\n *   After that, subsequent value changes re-validate. Use when you want\n *   \"show errors only after the user explicitly tried to submit.\"\n *\n * `revalidate()` always unlocks the field regardless of mode.\n */\nexport type ValidateOn = 'change' | 'blur' | 'submit'\n\nexport type FieldOptions = {\n  onValidatorError?: ValidatorErrorReporter\n  validateOn?: ValidateOn\n}\n\nclass FieldImpl<T> implements Field<T> {\n  private readonly value$: Signal<T>\n  /**\n   * Validator-produced errors. The public `errors` getter merges this with\n   * `serverErrors$` and `formErrors$` so consumers see a single flat array.\n   * Kept separate so a re-run of validators (after a new value) doesn't clobber\n   * the other two channels.\n   */\n  private readonly validatorErrors$: Signal<string[]>\n  /**\n   * Externally-injected errors — see `setErrors`. Cleared on the next user\n   * `set()`, on `reset()`, or via an explicit `setErrors([])`.\n   */\n  private readonly serverErrors$: Signal<string[]>\n  /**\n   * Errors routed here by a parent (or ancestor) form-level validator that\n   * targeted this field via a `FormIssue` path — the third error channel\n   * beside validator + server errors (T5.2). Owned by the routing form: cleared\n   * and re-applied on every form-level validation run, so it does NOT clear on\n   * the field's own `set()` (a stale cross-field error survives until the next\n   * form-level run recomputes it). Cleared by `reset()` / `setAsInitial()`.\n   */\n  private readonly formErrors$: Signal<string[]>\n  private readonly errors$: Computed<string[]>\n  private readonly touched$: Signal<boolean>\n  private readonly dirty$: Signal<boolean>\n  private readonly validating$: Signal<boolean>\n  private readonly isValid$: Computed<boolean>\n  /**\n   * Validity as of the last *settled* validation pass. While a pass is in\n   * flight (`validating$`), `isValid` reads this instead of the live `errors`\n   * — otherwise a `debouncedValidator` would flip `isValid` to `false` on every\n   * keystroke (the async-start clears `validatorErrors$`), strobing a submit\n   * button. Updated only when a pass completes (T5.3). Defaults `true` (an\n   * untouched field with a pending first run reads valid, not invalid).\n   */\n  private readonly lastValid$: Signal<boolean>\n  private readonly revalidateTrigger$: Signal<number>\n\n  private readonly validators: ReadonlyArray<Validator<T>>\n  /** The value `reset()` returns to. Mutated by `setAsInitial()` so a form\n   * initialized from server data resets to *that* data, not the empty seed. */\n  private initial: T\n  private validatorDispose: (() => void) | null = null\n  private currentAbort: AbortController | null = null\n  private runId = 0\n  private disposed = false\n  private devtoolsOwner: FieldDevtoolsOwner | null = null\n  private onValidatorError: ValidatorErrorReporter | null = null\n  private readonly validateOn: ValidateOn\n  /** Reactive gate — when false, the validator effect skips its run. Flipped\n   * on by the relevant trigger for the field's `validateOn` mode. Once on,\n   * stays on for the lifetime of the field (matches RHF's `mode + reValidateMode`\n   * default semantics: after the first activation, subsequent changes\n   * re-validate). `reset()` flips it back to false. */\n  private readonly validateUnlocked$: Signal<boolean>\n\n  constructor(initial: T, validators: ReadonlyArray<Validator<T>> = [], options?: FieldOptions) {\n    this.initial = initial\n    this.validators = validators\n    // Capture the reporter BEFORE the validator effect kicks off so a sync\n    // throw on the very first pass routes through `onError` instead of\n    // disappearing into the effect (`bindValidatorErrorReporter` is a\n    // post-construct hook so it can't catch the first run).\n    this.onValidatorError = options?.onValidatorError ?? null\n    this.validateOn = options?.validateOn ?? 'change'\n    this.value$ = signal(initial)\n    this.validatorErrors$ = signal<string[]>([])\n    this.serverErrors$ = signal<string[]>([])\n    this.formErrors$ = signal<string[]>([])\n    this.touched$ = signal(false)\n    this.dirty$ = signal(false)\n    this.validating$ = signal(false)\n    this.lastValid$ = signal(true)\n    this.revalidateTrigger$ = signal(0)\n    // 'change' mode is unlocked from construction; 'blur' / 'submit' wait\n    // for their trigger so initial typing doesn't surface errors.\n    this.validateUnlocked$ = signal(this.validateOn === 'change')\n    this.errors$ = computed(() => {\n      const v = this.validatorErrors$.value\n      const s = this.serverErrors$.value\n      const f = this.formErrors$.value\n      if (s.length === 0 && f.length === 0) return v\n      if (v.length === 0 && f.length === 0) return s\n      if (v.length === 0 && s.length === 0) return f\n      return [...v, ...s, ...f]\n    })\n    this.isValid$ = computed(() =>\n      // While a validation pass is in flight, hold the last settled validity so\n      // the field doesn't strobe invalid mid-check (T5.3). Otherwise it's live.\n      this.validating$.value ? this.lastValid$.value : this.errors$.value.length === 0,\n    )\n\n    if (validators.length > 0) {\n      this.validatorDispose = effect(() => {\n        this.runValidators()\n      })\n    }\n  }\n\n  /**\n   * Internal hook for `ctx.field` / `createForm` to route synchronous\n   * validator throws through `root.onError`. See `ValidatorErrorReporter`.\n   */\n  bindValidatorErrorReporter(reporter: ValidatorErrorReporter | null): void {\n    this.onValidatorError = reporter\n  }\n\n  // --- ReadSignal<T> ---\n  get value(): T {\n    return this.value$.value\n  }\n\n  peek(): T {\n    return this.value$.peek()\n  }\n\n  subscribe(handler: (value: T) => void): () => void {\n    return this.value$.subscribe(handler)\n  }\n\n  subscribeChanges(handler: (value: T) => void): () => void {\n    return this.value$.subscribeChanges(handler)\n  }\n\n  // --- Field-only signals ---\n  get errors(): ReadSignal<string[]> {\n    return this.errors$\n  }\n\n  get isValid(): ReadSignal<boolean> {\n    return this.isValid$\n  }\n\n  get isDirty(): ReadSignal<boolean> {\n    return this.dirty$\n  }\n\n  get touched(): ReadSignal<boolean> {\n    return this.touched$\n  }\n\n  get isValidating(): ReadSignal<boolean> {\n    return this.validating$\n  }\n\n  // --- mutating methods ---\n  set(value: T): void {\n    if (this.disposed) return\n    batch(() => {\n      this.value$.set(value)\n      // Equality-aware dirty: setting back to initial clears dirty, so\n      // \"Disable Save when unchanged\" UIs work without consumer code. Uses\n      // a structural comparison for primitive / shallow-object / array\n      // payloads; falls back to reference identity for class instances.\n      this.dirty$.set(!isStructurallyEqual(value, this.initial))\n      // Server errors are pinned externally and survive validator re-runs,\n      // but they MUST clear when the user edits the field — otherwise a\n      // server error like \"username taken\" would persist after the user\n      // typed a different username.\n      if (this.serverErrors$.peek().length > 0) this.serverErrors$.set([])\n    })\n  }\n\n  setErrors(errors: ReadonlyArray<string>): void {\n    if (this.disposed) return\n    const next = errors.length === 0 ? [] : [...errors]\n    this.serverErrors$.set(next)\n  }\n\n  /**\n   * Internal — set the parent-form-validator error channel (`formErrors$`).\n   * Called by the owning form's issue router when a `FormIssue` path resolves\n   * to this field. Guards against churning the signal when nothing changes so\n   * a whole-tree clear pass doesn't wake unrelated subscribers. See T5.2 /\n   * `routeFormIssues` in `form.ts`.\n   */\n  setFormErrors(errors: ReadonlyArray<string>): void {\n    if (this.disposed) return\n    if (this.formErrors$.peek().length === 0 && errors.length === 0) return\n    this.formErrors$.set(errors.length === 0 ? [] : [...errors])\n  }\n\n  /**\n   * Reseat the field as if this value had been its constructor `initial`.\n   * Sets the value, re-anchors `reset()`'s target, and does NOT mark dirty.\n   * Used by `Form` when applying its own `initial` (in the constructor and\n   * on `reset()`), so server-loaded forms don't start dirty. Internal-ish —\n   * exposed for `Form`'s use, not for user code that just wants to write.\n   */\n  setAsInitial(value: T): void {\n    if (this.disposed) return\n    this.initial = value\n    batch(() => {\n      this.value$.set(value)\n      this.dirty$.set(false)\n      // Re-seating from a fresh server payload means the previous server\n      // response is no longer relevant. Without clearing, errors like\n      // \"username taken\" persist across a successful re-hydrate.\n      if (this.serverErrors$.peek().length > 0) this.serverErrors$.set([])\n      // A stale cross-field error from the old value is likewise irrelevant;\n      // the next form-level run recomputes it against the fresh value.\n      if (this.formErrors$.peek().length > 0) this.formErrors$.set([])\n    })\n  }\n\n  reset(): void {\n    if (this.disposed) return\n    this.currentAbort?.abort()\n    this.currentAbort = null\n    batch(() => {\n      this.value$.set(this.initial)\n      this.dirty$.set(false)\n      this.touched$.set(false)\n      this.validatorErrors$.set([])\n      this.serverErrors$.set([])\n      this.formErrors$.set([])\n      this.validating$.set(false)\n      // Re-lock validation if the field was in blur/submit mode — a reset\n      // means we're back to a clean slate, so the user shouldn't immediately\n      // see errors again until they re-trigger.\n      if (this.validateOn !== 'change') this.validateUnlocked$.set(false)\n    })\n  }\n\n  markTouched(): void {\n    if (this.disposed) return\n    this.touched$.set(true)\n    // 'blur' mode unlocks validation on first blur. Subsequent set() calls\n    // then re-validate live (matches RHF `reValidateMode: onChange` default).\n    if (this.validateOn === 'blur' && !this.validateUnlocked$.peek()) {\n      this.validateUnlocked$.set(true)\n    }\n  }\n\n  async revalidate(): Promise<boolean> {\n    if (this.disposed) return this.isValid$.peek()\n    // `revalidate()` always unlocks the field — same trigger as a successful\n    // submit attempt. 'submit' mode uses this as its first activation.\n    if (!this.validateUnlocked$.peek()) this.validateUnlocked$.set(true)\n    // Bump the trigger to force re-run.\n    this.revalidateTrigger$.update((n) => n + 1)\n    await this.waitUntilSettled()\n    return this.isValid$.peek()\n  }\n\n  dispose(): void {\n    if (this.disposed) return\n    this.disposed = true\n    this.validatorDispose?.()\n    this.validatorDispose = null\n    this.currentAbort?.abort()\n    this.currentAbort = null\n    this.devtoolsOwner = null\n  }\n\n  /**\n   * Bind this field to a devtools owner. Each subsequent validation pass\n   * publishes a `field:validated` event with the supplied path + name.\n   * Idempotent — calling again replaces the owner. Internal: called by\n   * `createForm` / `createFieldArray` so the form's keys reach the panel.\n   */\n  bindDevtoolsOwner(owner: FieldDevtoolsOwner | null): void {\n    this.devtoolsOwner = owner\n  }\n\n  private emitValidated(valid: boolean, errors: readonly string[]): void {\n    if (!__DEV__) return\n    const owner = this.devtoolsOwner\n    if (owner === null) return\n    owner.emitter.emit({\n      type: 'field:validated',\n      path: owner.controllerPath,\n      field: owner.fieldName,\n      valid,\n      errors: [...errors],\n    })\n  }\n\n  // --- internal ---\n  private async waitUntilSettled(): Promise<void> {\n    // If a validation pass is in progress, wait for validating$ to become false.\n    if (!this.validating$.peek()) return\n    await new Promise<void>((resolve) => {\n      const unsub = this.validating$.subscribe((v) => {\n        if (!v) {\n          unsub()\n          resolve()\n        }\n      })\n    })\n  }\n\n  private runValidators(): void {\n    if (this.disposed) return\n\n    // Track value and revalidate trigger.\n    const value = this.value$.value\n    void this.revalidateTrigger$.value\n    // Track the gate so the effect re-runs when the field becomes unlocked.\n    // While locked, skip the pass entirely — errors stay empty, the field\n    // reads as valid, no async work starts.\n    if (!this.validateUnlocked$.value) {\n      batch(() => {\n        if (this.validatorErrors$.peek().length > 0) this.validatorErrors$.set([])\n        if (this.validating$.peek()) this.validating$.set(false)\n        this.lastValid$.set(this.errors$.peek().length === 0)\n      })\n      return\n    }\n\n    // Abort previous in-flight run.\n    this.currentAbort?.abort()\n    const abort = new AbortController()\n    this.currentAbort = abort\n    const myId = ++this.runId\n\n    const syncErrors: string[] = []\n    const asyncPromises: Promise<ValidatorResult>[] = []\n\n    for (const validator of this.validators) {\n      try {\n        const result = validator(value, abort.signal)\n        if (result instanceof Promise) {\n          // Defend against the validator promise rejecting *synchronously*\n          // with a thrown error (rare but legal) — the catch-handler in\n          // `Promise.allSettled` covers true async rejection.\n          asyncPromises.push(result)\n        } else {\n          // A Standard-Schema validator returns `FormIssue[]`; a stdlib one\n          // returns `string | null`. Flatten both to messages (a leaf field\n          // has no descendants to route issue paths to).\n          const msgs = messagesFromResult(result)\n          if (msgs.length > 0) syncErrors.push(...msgs)\n        }\n      } catch (err) {\n        // A buggy validator that throws synchronously: surface it twice.\n        // (1) Route through `onError` so the developer knows something is wrong.\n        // (2) Mark the field invalid until the bug is fixed (don't pretend OK).\n        // In prod the user-visible message is generic — leaking an internal\n        // error's text into form errors is a footgun; the real error still\n        // reaches `onValidatorError` (T5.3). Dev keeps the message for DX.\n        try {\n          this.onValidatorError?.(err)\n        } catch {\n          // The reporter must not propagate.\n        }\n        syncErrors.push(\n          __DEV__ ? (err instanceof Error ? err.message : String(err)) : 'Validation failed',\n        )\n      }\n    }\n\n    if (syncErrors.length > 0) {\n      batch(() => {\n        this.validatorErrors$.set(syncErrors)\n        this.validating$.set(false)\n        this.lastValid$.set(this.errors$.peek().length === 0)\n      })\n      this.emitValidated(false, syncErrors)\n      return\n    }\n\n    if (asyncPromises.length === 0) {\n      batch(() => {\n        this.validatorErrors$.set([])\n        this.validating$.set(false)\n        this.lastValid$.set(this.errors$.peek().length === 0)\n      })\n      this.emitValidated(true, [])\n      return\n    }\n\n    batch(() => {\n      this.validatorErrors$.set([])\n      this.validating$.set(true)\n    })\n\n    Promise.allSettled(asyncPromises).then((results) => {\n      if (myId !== this.runId || this.disposed) return\n      const asyncErrors: string[] = []\n      for (const r of results) {\n        if (r.status === 'fulfilled') {\n          asyncErrors.push(...messagesFromResult(r.value))\n        } else if (!isAbortError(r.reason)) {\n          const msg = r.reason instanceof Error ? r.reason.message : String(r.reason)\n          asyncErrors.push(msg)\n        }\n      }\n      batch(() => {\n        this.validatorErrors$.set(asyncErrors)\n        this.validating$.set(false)\n        this.lastValid$.set(this.errors$.peek().length === 0)\n      })\n      this.emitValidated(asyncErrors.length === 0, asyncErrors)\n    })\n  }\n}\n\n/**\n * Internal — type guard / accessor for the binding hook. Avoids exposing\n * `bindDevtoolsOwner` on the public `Field<T>` type while letting `createForm`\n * call it via a structural check.\n */\nexport function bindFieldDevtoolsOwner<T>(field: Field<T>, owner: FieldDevtoolsOwner | null): void {\n  const impl = field as { bindDevtoolsOwner?: (o: FieldDevtoolsOwner | null) => void }\n  if (typeof impl.bindDevtoolsOwner === 'function') {\n    impl.bindDevtoolsOwner(owner)\n  }\n}\n\n/**\n * Internal — install a synchronous-validator-throw reporter on a `Field`\n * (matched structurally to keep the public `Field<T>` surface stable).\n * Called by `ctx.field` and `bindTreeToDevtools` so leaves inside a form/\n * field-array tree get the same reporting as a standalone field.\n */\nexport function bindFieldValidatorErrorReporter<T>(\n  field: Field<T>,\n  reporter: ValidatorErrorReporter | null,\n): void {\n  const impl = field as { bindValidatorErrorReporter?: (r: ValidatorErrorReporter | null) => void }\n  if (typeof impl.bindValidatorErrorReporter === 'function') {\n    impl.bindValidatorErrorReporter(reporter)\n  }\n}\n\nexport function createField<T>(\n  initial: T,\n  validators?: ReadonlyArray<Validator<T>>,\n  options?: FieldOptions,\n): Field<T> {\n  return new FieldImpl(initial, validators, options)\n}\n\n/**\n * A bidirectional `T ↔ string` transform, suitable for HTML input bindings\n * where DOM values are always strings.\n *\n * `parse(raw)` converts the input's string value into the field's type;\n * `format(value)` converts the field's typed value back into a string for\n * the input. Both must be pure — `useFieldInput` calls them on every\n * render and every input event respectively.\n *\n * ```ts\n * const numberTransform: FieldTransform<number> = {\n *   parse: (raw) => Number(raw),\n *   format: (v) => String(v),\n * }\n * ```\n */\nexport type FieldTransform<T> = {\n  parse: (raw: string) => T\n  format: (value: T) => string\n}\n\n/**\n * Wrap an async validator with a debounce. The debounce timer resets on every\n * value change. While debouncing or the request is in flight, the field's\n * `isValidating` is true and `isValid` HOLDS its last settled value (T5.3) — so\n * editing an already-valid field doesn't strobe a submit button to disabled on\n * every keystroke. A field with no prior settled validation defaults to valid.\n */\nexport function debouncedValidator<T>(\n  fn: (value: T, signal: AbortSignal) => Promise<string | null>,\n  ms: number,\n): (value: T, signal: AbortSignal) => Promise<string | null> {\n  // Precise return (not the wide `Validator<T>`): the wrapped `fn` only ever\n  // yields `string | null`, so callers that invoke the debounced validator\n  // directly — e.g. surfacing its result in a signal — keep that narrow type\n  // after `Validator<T>` was widened to allow `FormIssue[]` (T5.2). Still\n  // assignable wherever a `Validator<T>` is expected.\n  return (value, signal) =>\n    new Promise<string | null>((resolve, reject) => {\n      if (signal.aborted) {\n        reject(new DOMException('Aborted', 'AbortError'))\n        return\n      }\n      const timer = setTimeout(() => {\n        signal.removeEventListener('abort', onAbort)\n        fn(value, signal).then(resolve, reject)\n      }, ms)\n      const onAbort = () => {\n        clearTimeout(timer)\n        signal.removeEventListener('abort', onAbort)\n        reject(new DOMException('Aborted', 'AbortError'))\n      }\n      signal.addEventListener('abort', onAbort, { once: true })\n    })\n}\n","import type { Field } from '../controller/types'\nimport { batch, computed, effect, type Signal, signal, untracked } from '../signals'\nimport type { ReadSignal } from '../signals/types'\nimport {\n  bindFieldDevtoolsOwner,\n  bindFieldValidatorErrorReporter,\n  createField,\n  type ValidatorErrorReporter,\n} from './field'\nimport type {\n  DeepPartial,\n  FieldArray,\n  FieldArrayItemErrors,\n  FieldArrayOptions,\n  FieldArrayValidator,\n  FieldArrayValue,\n  Form,\n  FormErrors,\n  FormOptions,\n  FormSchema,\n  FormValidator,\n  FormValue,\n  ItemInitial,\n} from './form-types'\nimport type { FormIssue, ValidatorResult } from './types'\n\nconst FORM_BRAND = Symbol.for('olas.form')\nconst FIELD_ARRAY_BRAND = Symbol.for('olas.fieldArray')\n\nconst isForm = (x: unknown): x is Form<FormSchema> =>\n  typeof x === 'object' && x !== null && (x as Record<symbol, unknown>)[FORM_BRAND] === true\n\nconst isFieldArray = (x: unknown): x is FieldArray<Field<unknown> | Form<FormSchema>> =>\n  typeof x === 'object' && x !== null && (x as Record<symbol, unknown>)[FIELD_ARRAY_BRAND] === true\n\nconst isField = (x: unknown): x is Field<unknown> =>\n  typeof x === 'object' && x !== null && !isForm(x) && !isFieldArray(x)\n\n/** Any node that can receive parent-form-validator-routed errors (T5.2). */\ntype FormErrorTarget = { setFormErrors?: (msgs: ReadonlyArray<string>) => void }\n\n/**\n * Walk a form tree from `root` following `FormIssue.path` segments. Forms walk\n * keys; field-arrays walk numeric indices. Returns the resolved node, or\n * `undefined` if the path runs off the tree (bad index, or a leaf reached with\n * an unconsumed path segment). Reads are untracked (`fields` is a static object;\n * `at()` peeks) so calling this inside a validator effect adds no dependencies.\n */\nfunction resolveNode(root: unknown, segments: ReadonlyArray<string | number>): unknown {\n  let cursor: unknown = root\n  for (const seg of segments) {\n    if (cursor === undefined || cursor === null) return undefined\n    if (isForm(cursor)) {\n      cursor = (cursor.fields as Record<string, unknown>)[String(seg)]\n    } else if (isFieldArray(cursor)) {\n      const idx = Number(seg)\n      if (!Number.isInteger(idx) || idx < 0) return undefined\n      cursor = (cursor as { at(i: number): unknown }).at(idx)\n    } else {\n      return undefined\n    }\n  }\n  return cursor\n}\n\n/**\n * Normalize one validator result into the shared `FormIssue[]` shape. A plain\n * string is a message on the node itself (empty path); `null` contributes\n * nothing; a `FormIssue[]` is appended verbatim.\n */\nfunction appendIssues(out: FormIssue[], result: ValidatorResult): void {\n  if (result == null) return\n  if (typeof result === 'string') {\n    out.push({ path: [], message: result })\n    return\n  }\n  for (const issue of result) out.push(issue)\n}\n\n/**\n * Route a fully-collected issue set for one form-level validation run:\n *  - empty-path (and unresolvable) issues → `topLevelErrors$` on the owning node\n *  - path issues → the resolved descendant's `setFormErrors`\n *\n * Targets that received an error last run but not this one are cleared, so a\n * fixed cross-field rule removes its message from the field it landed on.\n * Returns the new target set for the caller to retain. MUST run inside a batch.\n */\nfunction routeFormIssues(\n  root: unknown,\n  issues: FormIssue[],\n  topLevelErrors$: Signal<string[]>,\n  lastTargets: Set<FormErrorTarget>,\n): Set<FormErrorTarget> {\n  const topLevel: string[] = []\n  const byTarget = new Map<FormErrorTarget, string[]>()\n  for (const issue of issues) {\n    if (issue.path.length === 0) {\n      topLevel.push(issue.message)\n      continue\n    }\n    const target = resolveNode(root, issue.path) as FormErrorTarget | undefined\n    if (target === undefined || typeof target.setFormErrors !== 'function') {\n      // Unresolvable path — surface at the top level rather than dropping it.\n      topLevel.push(issue.message)\n      continue\n    }\n    const list = byTarget.get(target)\n    if (list) list.push(issue.message)\n    else byTarget.set(target, [issue.message])\n  }\n  topLevelErrors$.set(topLevel)\n  for (const t of lastTargets) {\n    if (!byTarget.has(t)) t.setFormErrors?.([])\n  }\n  for (const [t, msgs] of byTarget) t.setFormErrors?.(msgs)\n  return new Set(byTarget.keys())\n}\n\nclass FormImpl<S extends FormSchema> implements Form<S> {\n  readonly [FORM_BRAND] = true\n\n  readonly fields: S\n  readonly value: ReadSignal<FormValue<S>>\n  readonly errors: ReadSignal<FormErrors<S>>\n  readonly isValid: ReadSignal<boolean>\n  readonly isDirty: ReadSignal<boolean>\n  readonly touched: ReadSignal<boolean>\n  readonly isValidating: ReadSignal<boolean>\n  readonly flatErrors: ReadSignal<Array<{ path: string; errors: string[] }>>\n  /**\n   * Dotted paths of every leaf whose `isDirty` is `true`. Recomputes when\n   * any child's dirty state flips; ordered by depth-first traversal so two\n   * snapshots of a stable tree compare with `===`-friendly references on\n   * unchanged subsets. Useful for partial-update PATCH payloads and\n   * \"highlight the changed inputs\" UIs.\n   */\n  readonly dirtyFields: ReadSignal<string[]>\n\n  private readonly topLevelErrors$: Signal<string[]> = signal([])\n  /**\n   * Errors routed to THIS form by an ancestor form-level validator (a\n   * `FormIssue` whose path resolves to this node). Merged into `topLevelErrors`\n   * beside this form's own validator output, so `topLevelErrors` means \"errors\n   * attached to this node itself, whatever their source\". Owned by the ancestor\n   * router (T5.2) — see `setFormErrors`.\n   */\n  private readonly parentFormErrors$: Signal<string[]> = signal([])\n  readonly topLevelErrors: ReadSignal<string[]> = computed(() => {\n    const own = this.topLevelErrors$.value\n    const parent = this.parentFormErrors$.value\n    if (parent.length === 0) return own\n    if (own.length === 0) return parent\n    return [...own, ...parent]\n  })\n  private readonly topLevelValidating$: Signal<boolean> = signal(false)\n  /** Targets written by the last form-level run — cleared next run if absent. */\n  private lastFormErrorTargets: Set<FormErrorTarget> = new Set()\n\n  // Submission lifecycle.\n  private readonly isSubmitting$: Signal<boolean> = signal(false)\n  private readonly submitCount$: Signal<number> = signal(0)\n  private readonly submitError$: Signal<unknown> = signal(undefined)\n  readonly isSubmitting: ReadSignal<boolean> = this.isSubmitting$\n  readonly submitCount: ReadSignal<number> = this.submitCount$\n  readonly submitError: ReadSignal<unknown> = this.submitError$\n\n  private readonly validators: ReadonlyArray<FormValidator<S>>\n  private readonly options: FormOptions<S> | undefined\n  private validatorDispose: (() => void) | null = null\n  private initialDispose: (() => void) | null = null\n  private currentValidatorRun = 0\n  private currentValidatorAbort: AbortController | null = null\n  private disposed = false\n  private onValidatorError: ((err: unknown) => void) | null = null\n\n  /** Internal — wire a sync-throw reporter for the top-level validators. */\n  bindValidatorErrorReporter(reporter: ((err: unknown) => void) | null): void {\n    this.onValidatorError = reporter\n  }\n\n  constructor(\n    schema: S,\n    options?: FormOptions<S>,\n    internalOptions?: { onValidatorError?: (err: unknown) => void },\n  ) {\n    this.fields = schema\n    this.options = options\n    this.validators = options?.validators ?? []\n    // Capture reporter BEFORE the top-level validator effect kicks off in\n    // this constructor — mirrors the FieldImpl fix.\n    this.onValidatorError = internalOptions?.onValidatorError ?? null\n\n    // Initial values — supports both the static shape and the tracked-function\n    // shape from spec §8.4. For the function form, wrap in an effect so a\n    // change to any tracked signal re-seats the form (subject to the dirty\n    // guard from `resetOnInitialChange`).\n    if (options?.initial !== undefined) {\n      if (typeof options.initial === 'function') {\n        const initialFn = options.initial\n        const mode = options.resetOnInitialChange ?? 'when-clean'\n        let firstRun = true\n        this.initialDispose = effect(() => {\n          // Track signals read by `initialFn`. The dirty-guard MUST run\n          // untracked — otherwise `isDirty` would become a dep and re-seating\n          // on user input would cascade.\n          const ini = initialFn()\n          if (ini === undefined) return\n          untracked(() => {\n            if (this.disposed) return\n            if (firstRun) {\n              firstRun = false\n              this.applyPartial(ini as DeepPartial<FormValue<S>>, true)\n              return\n            }\n            if (mode === 'never') return\n            if (mode === 'when-clean' && this.isDirty.peek()) return\n            this.applyPartial(ini as DeepPartial<FormValue<S>>, true)\n          })\n        })\n      } else {\n        this.applyPartial(options.initial as DeepPartial<FormValue<S>>, true)\n      }\n    }\n\n    this.value = computed(() => this.computeValue())\n    this.errors = computed(() => this.computeErrors())\n    this.isDirty = computed(() => this.computeBool('isDirty'))\n    this.touched = computed(() => this.computeBool('touched'))\n    this.isValidating = computed(() => {\n      if (this.topLevelValidating$.value) return true\n      for (const child of Object.values(this.fields)) {\n        if ((child as { isValidating: ReadSignal<boolean> }).isValidating.value) return true\n      }\n      return false\n    })\n    this.isValid = computed(() => {\n      // Merged view: this form's own top-level validators AND any errors an\n      // ancestor form-level validator routed onto this node (T5.2).\n      if (this.topLevelErrors.value.length > 0) return false\n      if (this.isValidating.value) return false\n      for (const child of Object.values(this.fields)) {\n        if (!(child as { isValid: ReadSignal<boolean> }).isValid.value) return false\n      }\n      return true\n    })\n    this.flatErrors = computed(() => this.computeFlatErrors())\n    this.dirtyFields = computed(() => {\n      const out: string[] = []\n      collectDirtyFields(this.fields, '', out)\n      return out\n    })\n\n    if (this.validators.length > 0) {\n      this.validatorDispose = effect(() => this.runTopLevelValidators())\n    }\n  }\n\n  private computeValue(): FormValue<S> {\n    const out: Record<string, unknown> = {}\n    for (const [k, child] of Object.entries(this.fields)) {\n      if (isForm(child) || isFieldArray(child)) {\n        out[k] = (child as { value: ReadSignal<unknown> }).value.value\n      } else {\n        // Field<T> is itself a ReadSignal<T>; .value returns T (tracked).\n        out[k] = (child as Field<unknown>).value\n      }\n    }\n    return out as FormValue<S>\n  }\n\n  private computeErrors(): FormErrors<S> {\n    const out: Record<string, unknown> = {}\n    for (const [k, child] of Object.entries(this.fields)) {\n      if (isForm(child)) {\n        out[k] = child.errors.value\n      } else if (isFieldArray(child)) {\n        out[k] = child.errors.value\n      } else {\n        const errs = (child as Field<unknown>).errors.value\n        out[k] = errs.length > 0 ? errs : undefined\n      }\n    }\n    return out as FormErrors<S>\n  }\n\n  private computeBool(key: 'isDirty' | 'touched'): boolean {\n    for (const child of Object.values(this.fields)) {\n      const sig = (child as unknown as Record<string, ReadSignal<boolean>>)[key]\n      if (sig?.value) return true\n    }\n    return false\n  }\n\n  private computeFlatErrors(): Array<{ path: string; errors: string[] }> {\n    const out: Array<{ path: string; errors: string[] }> = []\n    const tle = this.topLevelErrors.value\n    if (tle.length > 0) out.push({ path: '', errors: tle })\n    walkErrors(this.fields, '', out)\n    return out\n  }\n\n  set(partial: DeepPartial<FormValue<S>>): void {\n    if (this.disposed) return\n    batch(() => this.applyPartial(partial, false))\n  }\n\n  private applyPartial(partial: DeepPartial<FormValue<S>>, asInitial: boolean): void {\n    for (const [k, val] of Object.entries(partial)) {\n      const child = (this.fields as Record<string, unknown>)[k]\n      if (!child) continue\n      // `partial.someNestedForm === undefined` means \"leave this subtree\n      // alone\", not \"reset it with undefined\" — which would crash on\n      // `Object.entries(undefined)`.\n      if (val === undefined) continue\n      if (isForm(child)) {\n        // Nested form: recurse via its own `set` (user) or rebuild via reset\n        // through the same `applyPartial`-with-`asInitial` flag (initial).\n        if (asInitial) {\n          ;(child as Form<FormSchema>).resetWithInitial(val as DeepPartial<FormValue<FormSchema>>)\n        } else {\n          child.set(val as DeepPartial<FormValue<FormSchema>>)\n        }\n      } else if (isFieldArray(child)) {\n        const arr = child\n        const newValues = val as unknown[]\n        if (asInitial) {\n          // Reset-style application: replace items wholesale and re-anchor\n          // them as the new initial so a later `reset()` returns here.\n          arr.clear()\n          for (const itemVal of newValues) {\n            arr.add(itemVal as ItemInitial<Field<unknown>>)\n          }\n          // Internal: re-anchor the initialItems list. `replaceInitialItems`\n          // is only exposed for this exact use case.\n          ;(\n            arr as unknown as {\n              replaceInitialItems: (items: ReadonlyArray<unknown>) => void\n            }\n          ).replaceInitialItems(newValues)\n        } else {\n          // User-driven patch: preserve item identity where the lengths\n          // overlap so touched / dirty / in-flight validators on existing\n          // items survive. Tail diff handles grow / shrink.\n          const current = arr.items.peek() as ReadonlyArray<Field<unknown> | Form<FormSchema>>\n          const overlap = Math.min(current.length, newValues.length)\n          for (let i = 0; i < overlap; i++) {\n            const item = current[i]\n            const v = newValues[i]\n            if (isForm(item)) {\n              item.set(v as DeepPartial<FormValue<FormSchema>>)\n            } else {\n              ;(item as Field<unknown>).set(v)\n            }\n          }\n          for (let i = current.length; i < newValues.length; i++) {\n            arr.add(newValues[i] as ItemInitial<Field<unknown>>)\n          }\n          for (let i = current.length - 1; i >= newValues.length; i--) {\n            arr.remove(i)\n          }\n        }\n      } else {\n        const f = child as Field<unknown>\n        if (asInitial) f.setAsInitial(val)\n        else f.set(val)\n      }\n    }\n  }\n\n  /** Internal: re-seat this form's leaves from `partial` as their new initial. */\n  resetWithInitial(partial: DeepPartial<FormValue<S>>): void {\n    if (this.disposed) return\n    batch(() => this.applyPartial(partial, true))\n  }\n\n  reset(): void {\n    if (this.disposed) return\n    batch(() => {\n      for (const child of Object.values(this.fields)) {\n        if (isForm(child) || isFieldArray(child)) {\n          ;(child as { reset: () => void }).reset()\n        } else {\n          ;(child as Field<unknown>).reset()\n        }\n      }\n      this.topLevelErrors$.set([])\n      this.parentFormErrors$.set([])\n      // Submission lifecycle is conceptually part of \"form state\"; resetting\n      // a form means the user is starting over. Without these clears, a UI\n      // bound to `submitCount`/`submitError` would show stale state after\n      // `reset()`. `isSubmitting` is deliberately NOT cleared — only the\n      // owning submit() flow can flip it back.\n      this.submitCount$.set(0)\n      this.submitError$.set(undefined)\n      // Re-apply initial (as initial, no dirty bump) INSIDE the batch — a\n      // separate pass would fire a second notification and briefly expose the\n      // \"reset to construction seed, then re-seat to current initial\" tearing\n      // (visible with a reactive `initial: () => …` whose deps changed) (T5.3).\n      if (this.options?.initial !== undefined) {\n        const ini =\n          typeof this.options.initial === 'function' ? this.options.initial() : this.options.initial\n        if (ini !== undefined) this.applyPartial(ini as DeepPartial<FormValue<S>>, true)\n      }\n    })\n  }\n\n  markAllTouched(): void {\n    if (this.disposed) return\n    for (const child of Object.values(this.fields)) {\n      if (isForm(child)) child.markAllTouched()\n      else if (isFieldArray(child)) child.markAllTouched()\n      else (child as Field<unknown>).markTouched()\n    }\n  }\n\n  async validate(): Promise<boolean> {\n    if (this.disposed) return this.isValid.peek()\n    const tasks: Promise<unknown>[] = []\n    for (const child of Object.values(this.fields)) {\n      if (isForm(child) || isFieldArray(child)) {\n        tasks.push((child as { validate: () => Promise<boolean> }).validate())\n      } else {\n        tasks.push((child as Field<unknown>).revalidate())\n      }\n    }\n    await Promise.all(tasks)\n    // Kick a fresh top-level run so the surface matches \"re-run every\n    // validator\" — without this, `validate()` would skip top-level if it\n    // settled before the call and the value hasn't tracked-changed since.\n    if (this.validators.length > 0) {\n      this.runTopLevelValidators()\n    }\n    // Wait for top-level validators to finish.\n    if (this.topLevelValidating$.peek()) {\n      await new Promise<void>((resolve) => {\n        const unsub = this.topLevelValidating$.subscribe((v) => {\n          if (!v) {\n            unsub()\n            resolve()\n          }\n        })\n      })\n    }\n    return this.isValid.peek()\n  }\n\n  /**\n   * Run a submission against this form. Wraps `handler(value)` with:\n   * - `isSubmitting` set true while the handler is in flight.\n   * - `submitCount` incremented before the handler runs.\n   * - `submitError` set to the throw, if any.\n   * - Optional pre-submit `validate()` (default true). When invalid every\n   *   field is marked touched and the handler is skipped — the returned\n   *   promise resolves with `{ ok: false }` and `submitError` is left\n   *   untouched (validation failure is not a thrown error).\n   *\n   * The handler may return a value (synchronously or via Promise); it's\n   * captured in the resolved object's `data` field. Throws are captured\n   * unless `onError: 'rethrow'`. A `resetOnSuccess: true` option calls\n   * `reset()` after the handler resolves successfully.\n   */\n  async submit<R = unknown>(\n    handler: (value: FormValue<S>) => R | Promise<R>,\n    options?: {\n      validateBeforeSubmit?: boolean\n      resetOnSuccess?: boolean\n      onError?: 'rethrow' | 'capture'\n    },\n  ): Promise<{ ok: boolean; data?: Awaited<R>; error?: unknown }> {\n    if (this.disposed) return { ok: false, error: new Error('form is disposed') }\n\n    // Double-submit guard — refusing to start a second submission while one\n    // is in flight matches RHF / TanStack-Form. Consumers wanting parallel\n    // submits should run them off the form directly.\n    if (this.isSubmitting$.peek()) {\n      return { ok: false, error: new Error('submit already in progress') }\n    }\n\n    const validateFirst = options?.validateBeforeSubmit ?? true\n    const onErrorMode = options?.onError ?? 'capture'\n\n    batch(() => {\n      this.submitCount$.update((n) => n + 1)\n      this.submitError$.set(undefined)\n      this.isSubmitting$.set(true)\n    })\n\n    try {\n      if (validateFirst) {\n        const ok = await this.validate()\n        if (!ok) {\n          this.markAllTouched()\n          this.isSubmitting$.set(false)\n          return { ok: false }\n        }\n      }\n      const result = (await handler(this.value.peek())) as Awaited<R>\n      if (options?.resetOnSuccess) this.reset()\n      this.isSubmitting$.set(false)\n      return { ok: true, data: result }\n    } catch (err) {\n      batch(() => {\n        this.submitError$.set(err)\n        this.isSubmitting$.set(false)\n      })\n      if (onErrorMode === 'rethrow') throw err\n      return { ok: false, error: err }\n    }\n  }\n\n  /**\n   * Pin externally-sourced errors on specific fields — typically server-side\n   * validation results from a failed submit. Paths are dot-separated and\n   * traverse nested `Form` / `FieldArray` children (numeric segments are\n   * array indices). Errors land in the field's `serverErrors` channel and\n   * clear automatically on the next user write to that field. Passing an\n   * empty array for a path clears that field's server errors immediately.\n   */\n  setErrors(errors: Record<string, ReadonlyArray<string>>): void {\n    if (this.disposed) return\n    batch(() => {\n      for (const [path, msgs] of Object.entries(errors)) {\n        const target = this.resolvePath(path)\n        if (target === undefined) continue\n        if ((target as { setErrors?: unknown }).setErrors === undefined) continue\n        ;(target as { setErrors: (e: ReadonlyArray<string>) => void }).setErrors(msgs)\n      }\n    })\n  }\n\n  /**\n   * Internal — receive errors routed here by an ancestor form-level validator\n   * (a `FormIssue` whose path resolved to this nested form). Guards against\n   * spurious writes so a whole-tree clear pass doesn't wake subscribers. See\n   * `routeFormIssues`.\n   */\n  setFormErrors(errors: ReadonlyArray<string>): void {\n    if (this.disposed) return\n    if (this.parentFormErrors$.peek().length === 0 && errors.length === 0) return\n    this.parentFormErrors$.set(errors.length === 0 ? [] : [...errors])\n  }\n\n  /**\n   * Reset a named subtree to its initial. `path` uses the same dotted /\n   * bracket notation as `setErrors` / `flatErrors`. Useful when\n   * `Form.set({foo: undefined})` would be ambiguous (\"clear\" vs \"leave\n   * alone\" — the latter is what `set` does today).\n   *\n   * Walks via `resolvePath`; the resolved target must expose `reset()`\n   * (Field, Form, or FieldArray all do). Unknown paths are silently\n   * ignored — `flatErrors`-shaped paths from upstream code shouldn't\n   * crash this. Pass an empty string to reset the whole form (same as\n   * `form.reset()`).\n   */\n  clearSubtree(path: string): void {\n    if (this.disposed) return\n    if (path === '') {\n      this.reset()\n      return\n    }\n    const target = this.resolvePath(path) as { reset?: () => void } | undefined\n    if (target === undefined) return\n    if (typeof target.reset === 'function') target.reset()\n  }\n\n  private resolvePath(path: string): unknown {\n    if (path === '') return undefined\n    const segments = splitPath(path)\n    if (segments === null) return undefined\n    let cursor: unknown = this\n    for (const seg of segments) {\n      if (cursor === undefined || cursor === null) return undefined\n      if (isForm(cursor)) {\n        cursor = (cursor.fields as Record<string, unknown>)[seg]\n        continue\n      }\n      if (isFieldArray(cursor)) {\n        const idx = Number(seg)\n        if (!Number.isInteger(idx) || idx < 0) return undefined\n        cursor = (cursor as { at(i: number): unknown }).at(idx)\n        continue\n      }\n      // Top-level dispatch — `this` is the FormImpl; walk via `fields`.\n      if (cursor === this) {\n        cursor = (this.fields as Record<string, unknown>)[seg]\n        continue\n      }\n      return undefined\n    }\n    return cursor\n  }\n\n  dispose(): void {\n    if (this.disposed) return\n    this.disposed = true\n    this.validatorDispose?.()\n    this.initialDispose?.()\n    this.currentValidatorAbort?.abort()\n    for (const child of Object.values(this.fields)) {\n      ;(child as { dispose?: () => void }).dispose?.()\n    }\n  }\n\n  private runTopLevelValidators(): void {\n    if (this.disposed) return\n    const value = this.value.value\n    this.currentValidatorAbort?.abort()\n    const abort = new AbortController()\n    this.currentValidatorAbort = abort\n    const myId = ++this.currentValidatorRun\n\n    const syncIssues: FormIssue[] = []\n    const asyncPromises: Promise<ValidatorResult>[] = []\n    for (const v of this.validators) {\n      try {\n        const r = v(value, abort.signal)\n        if (r instanceof Promise) asyncPromises.push(r)\n        else appendIssues(syncIssues, r)\n      } catch (err) {\n        try {\n          this.onValidatorError?.(err)\n        } catch {\n          // The reporter must not propagate.\n        }\n        // Prod shows a generic message (don't leak internal error text into\n        // form errors); the real error still reaches `onValidatorError` (T5.3).\n        syncIssues.push({\n          path: [],\n          message: __DEV__\n            ? err instanceof Error\n              ? err.message\n              : String(err)\n            : 'Validation failed',\n        })\n      }\n    }\n\n    if (syncIssues.length > 0) {\n      batch(() => {\n        this.lastFormErrorTargets = routeFormIssues(\n          this,\n          syncIssues,\n          this.topLevelErrors$,\n          this.lastFormErrorTargets,\n        )\n        this.topLevelValidating$.set(false)\n      })\n      return\n    }\n\n    if (asyncPromises.length === 0) {\n      batch(() => {\n        this.lastFormErrorTargets = routeFormIssues(\n          this,\n          [],\n          this.topLevelErrors$,\n          this.lastFormErrorTargets,\n        )\n        this.topLevelValidating$.set(false)\n      })\n      return\n    }\n\n    batch(() => {\n      this.lastFormErrorTargets = routeFormIssues(\n        this,\n        [],\n        this.topLevelErrors$,\n        this.lastFormErrorTargets,\n      )\n      this.topLevelValidating$.set(true)\n    })\n\n    Promise.allSettled(asyncPromises).then((results) => {\n      if (myId !== this.currentValidatorRun || this.disposed) return\n      const issues: FormIssue[] = []\n      for (const r of results) {\n        if (r.status === 'fulfilled') appendIssues(issues, r.value)\n      }\n      batch(() => {\n        this.lastFormErrorTargets = routeFormIssues(\n          this,\n          issues,\n          this.topLevelErrors$,\n          this.lastFormErrorTargets,\n        )\n        this.topLevelValidating$.set(false)\n      })\n    })\n  }\n}\n\n/**\n * Split a path string into segments, accepting both dot syntax (`users.0.name`)\n * and the bracket syntax `walkErrors` emits for array items (`users[0].name`).\n * Returns `null` if the path is malformed (unclosed bracket, empty bracket,\n * non-numeric bracket index).\n */\nfunction splitPath(path: string): string[] | null {\n  const out: string[] = []\n  let current = ''\n  for (let i = 0; i < path.length; i++) {\n    const ch = path[i]\n    if (ch === '.') {\n      if (current !== '') {\n        out.push(current)\n        current = ''\n      }\n      continue\n    }\n    if (ch === '[') {\n      if (current !== '') {\n        out.push(current)\n        current = ''\n      }\n      const close = path.indexOf(']', i + 1)\n      if (close === -1) return null\n      const idx = path.slice(i + 1, close)\n      if (idx === '' || !/^\\d+$/.test(idx)) return null\n      out.push(idx)\n      i = close\n      continue\n    }\n    if (ch === ']') return null\n    current += ch\n  }\n  if (current !== '') out.push(current)\n  return out\n}\n\nfunction collectDirtyFields(fields: FormSchema, prefix: string, out: string[]): void {\n  for (const [k, child] of Object.entries(fields)) {\n    const path = prefix ? `${prefix}.${k}` : k\n    if (isForm(child)) {\n      collectDirtyFields(child.fields, path, out)\n    } else if (isFieldArray(child)) {\n      const items = child.items.value\n      items.forEach((item, idx) => {\n        const itemPath = `${path}[${idx}]`\n        if (isForm(item)) {\n          collectDirtyFields(item.fields, itemPath, out)\n        } else if ((item as Field<unknown>).isDirty.value) {\n          out.push(itemPath)\n        }\n      })\n    } else if ((child as Field<unknown>).isDirty.value) {\n      out.push(path)\n    }\n  }\n}\n\nfunction walkErrors(\n  fields: FormSchema,\n  prefix: string,\n  out: Array<{ path: string; errors: string[] }>,\n): void {\n  for (const [k, child] of Object.entries(fields)) {\n    const path = prefix ? `${prefix}.${k}` : k\n    if (isForm(child)) {\n      const tle = child.topLevelErrors.value\n      if (tle.length > 0) out.push({ path, errors: tle })\n      walkErrors(child.fields, path, out)\n    } else if (isFieldArray(child)) {\n      const tle = child.topLevelErrors.value\n      if (tle.length > 0) out.push({ path, errors: tle })\n      const items = child.items.value\n      items.forEach((item, idx) => {\n        const itemPath = `${path}[${idx}]`\n        if (isForm(item)) {\n          const itle = item.topLevelErrors.value\n          if (itle.length > 0) out.push({ path: itemPath, errors: itle })\n          walkErrors(item.fields, itemPath, out)\n        } else {\n          const errs = (item as Field<unknown>).errors.value\n          if (errs.length > 0) out.push({ path: itemPath, errors: errs })\n        }\n      })\n    } else {\n      const errs = (child as Field<unknown>).errors.value\n      if (errs.length > 0) out.push({ path, errors: errs })\n    }\n  }\n}\n\nclass FieldArrayImpl<I extends Field<any> | Form<any>> implements FieldArray<I> {\n  readonly [FIELD_ARRAY_BRAND] = true\n\n  readonly items: ReadSignal<ReadonlyArray<I>>\n  readonly value: ReadSignal<FieldArrayValue<I>>\n  readonly errors: ReadSignal<Array<FieldArrayItemErrors<I> | undefined>>\n  readonly size: ReadSignal<number>\n  readonly isValid: ReadSignal<boolean>\n  readonly isDirty: ReadSignal<boolean>\n  readonly touched: ReadSignal<boolean>\n  readonly isValidating: ReadSignal<boolean>\n\n  private readonly items$: Signal<I[]>\n  /**\n   * Structural dirtiness — flipped by `add`/`insert`/`remove`/`move`/`clear`.\n   * Item-level `isDirty` alone misses these, so a reactive `initial` + the\n   * default `resetOnInitialChange: 'when-clean'` would re-seat the array on a\n   * background refetch and delete rows the user just added (T5.1). Reset by\n   * `reset()` and by an initial-driven re-anchor (`replaceInitialItems`).\n   */\n  private readonly structurallyDirty$: Signal<boolean> = signal(false)\n  private readonly topLevelErrors$: Signal<string[]> = signal([])\n  /** Errors routed to this array by an ancestor form-level validator (T5.2) —\n   *  merged into `topLevelErrors` beside the array's own validator output. */\n  private readonly parentFormErrors$: Signal<string[]> = signal([])\n  readonly topLevelErrors: ReadSignal<string[]> = computed(() => {\n    const own = this.topLevelErrors$.value\n    const parent = this.parentFormErrors$.value\n    if (parent.length === 0) return own\n    if (own.length === 0) return parent\n    return [...own, ...parent]\n  })\n  private readonly topLevelValidating$: Signal<boolean> = signal(false)\n  /** Targets written by the last array-level run — cleared next run if absent. */\n  private lastFormErrorTargets: Set<FormErrorTarget> = new Set()\n\n  private readonly itemFactory: (initial?: ItemInitial<I>) => I\n  private initialItems: Array<ItemInitial<I>> = []\n  private readonly validators: ReadonlyArray<FieldArrayValidator<I>>\n  private currentValidatorRun = 0\n  private currentValidatorAbort: AbortController | null = null\n  private validatorDispose: (() => void) | null = null\n  private disposed = false\n  private onValidatorError: ((err: unknown) => void) | null = null\n\n  /** Internal — see `FormImpl.bindValidatorErrorReporter`. */\n  bindValidatorErrorReporter(reporter: ((err: unknown) => void) | null): void {\n    this.onValidatorError = reporter\n  }\n\n  constructor(\n    itemFactory: (initial?: ItemInitial<I>) => I,\n    options?: FieldArrayOptions<I>,\n    internalOptions?: { onValidatorError?: (err: unknown) => void },\n  ) {\n    this.itemFactory = itemFactory\n    this.validators = options?.validators ?? []\n    this.onValidatorError = internalOptions?.onValidatorError ?? null\n    this.items$ = signal<I[]>([])\n    if (options?.initial) {\n      this.initialItems = options.initial\n      for (const ini of options.initial) {\n        this.items$.peek().push(itemFactory(ini))\n      }\n      // re-set to trigger subscribers\n      this.items$.set([...this.items$.peek()])\n    }\n\n    this.items = this.items$\n    this.size = computed(() => this.items$.value.length)\n    this.value = computed(\n      () =>\n        this.items$.value.map((item) => {\n          if (isForm(item)) return item.value.value\n          // Field is a ReadSignal — `.value` is the actual value.\n          return (item as Field<unknown>).value\n        }) as FieldArrayValue<I>,\n    )\n    this.errors = computed(() =>\n      this.items$.value.map((item) => {\n        if (isForm(item)) return item.errors.value as FieldArrayItemErrors<I>\n        const errs = (item as Field<unknown>).errors.value\n        return (errs.length > 0 ? errs : undefined) as FieldArrayItemErrors<I> | undefined\n      }),\n    )\n    this.isDirty = computed(() => {\n      if (this.structurallyDirty$.value) return true // add/remove/move/clear\n      for (const item of this.items$.value) {\n        if ((item as { isDirty: ReadSignal<boolean> }).isDirty.value) return true\n      }\n      return false\n    })\n    this.touched = computed(() => {\n      for (const item of this.items$.value) {\n        if ((item as { touched: ReadSignal<boolean> }).touched.value) return true\n      }\n      return false\n    })\n    this.isValidating = computed(() => {\n      if (this.topLevelValidating$.value) return true\n      for (const item of this.items$.value) {\n        if ((item as { isValidating: ReadSignal<boolean> }).isValidating.value) return true\n      }\n      return false\n    })\n    this.isValid = computed(() => {\n      // Merged view: the array's own top-level validators AND any errors an\n      // ancestor form-level validator routed onto this node (T5.2).\n      if (this.topLevelErrors.value.length > 0) return false\n      if (this.isValidating.value) return false\n      for (const item of this.items$.value) {\n        if (!(item as { isValid: ReadSignal<boolean> }).isValid.value) return false\n      }\n      return true\n    })\n\n    if (this.validators.length > 0) {\n      this.validatorDispose = effect(() => this.runTopLevelValidators())\n    }\n  }\n\n  at(index: number): I | undefined {\n    return this.items$.peek()[index]\n  }\n\n  /**\n   * Internal — receive errors routed here by an ancestor form-level validator\n   * (a `FormIssue` whose path resolved to this array). See `routeFormIssues`.\n   */\n  setFormErrors(errors: ReadonlyArray<string>): void {\n    if (this.disposed) return\n    if (this.parentFormErrors$.peek().length === 0 && errors.length === 0) return\n    this.parentFormErrors$.set(errors.length === 0 ? [] : [...errors])\n  }\n\n  add(initial?: ItemInitial<I>): void {\n    if (this.disposed) return\n    const item = this.itemFactory(initial)\n    this.items$.set([...this.items$.peek(), item])\n    this.structurallyDirty$.set(true)\n  }\n\n  insert(index: number, initial?: ItemInitial<I>): void {\n    if (this.disposed) return\n    const item = this.itemFactory(initial)\n    const next = [...this.items$.peek()]\n    next.splice(index, 0, item)\n    this.items$.set(next)\n    this.structurallyDirty$.set(true)\n  }\n\n  remove(index: number): void {\n    if (this.disposed) return\n    const next = [...this.items$.peek()]\n    const [removed] = next.splice(index, 1)\n    if (removed) {\n      ;(removed as { dispose?: () => void }).dispose?.()\n    }\n    this.items$.set(next)\n    this.structurallyDirty$.set(true)\n  }\n\n  move(from: number, to: number): void {\n    if (this.disposed) return\n    const next = [...this.items$.peek()]\n    const [item] = next.splice(from, 1)\n    if (item) next.splice(to, 0, item)\n    this.items$.set(next)\n    this.structurallyDirty$.set(true)\n  }\n\n  clear(): void {\n    if (this.disposed) return\n    for (const item of this.items$.peek()) {\n      ;(item as { dispose?: () => void }).dispose?.()\n    }\n    this.items$.set([])\n    this.structurallyDirty$.set(true)\n  }\n\n  /**\n   * Internal — used by `Form.resetWithInitial` to re-anchor the array's\n   * initial items after a parent-driven `applyPartial(..., asInitial: true)`.\n   * Without this, a subsequent `reset()` would revert to the construction-\n   * time initials rather than the most-recently-applied ones.\n   */\n  replaceInitialItems(items: ReadonlyArray<ItemInitial<I>>): void {\n    this.initialItems = [...items]\n    // The array was just re-seated from `initial` (reactive-initial re-apply or\n    // `resetWithInitial`) — this is the new clean baseline, so the clear()/add()\n    // that drove it must not leave the array structurally dirty (T5.1).\n    this.structurallyDirty$.set(false)\n  }\n\n  reset(): void {\n    if (this.disposed) return\n    batch(() => {\n      this.clear()\n      for (const ini of this.initialItems) {\n        this.add(ini)\n      }\n      this.topLevelErrors$.set([])\n      this.parentFormErrors$.set([])\n      // clear()/add() above flipped structural dirt; reset() lands on the\n      // clean initial baseline (T5.1).\n      this.structurallyDirty$.set(false)\n    })\n  }\n\n  markAllTouched(): void {\n    for (const item of this.items$.peek()) {\n      if (isForm(item)) item.markAllTouched()\n      else (item as Field<unknown>).markTouched()\n    }\n  }\n\n  async validate(): Promise<boolean> {\n    if (this.disposed) return this.isValid.peek()\n    const tasks: Promise<unknown>[] = []\n    for (const item of this.items$.peek()) {\n      if (isForm(item)) tasks.push(item.validate())\n      else tasks.push((item as Field<unknown>).revalidate())\n    }\n    await Promise.all(tasks)\n    // Fresh top-level run — see `FormImpl.validate` for the rationale.\n    if (this.validators.length > 0) {\n      this.runTopLevelValidators()\n    }\n    if (this.topLevelValidating$.peek()) {\n      await new Promise<void>((resolve) => {\n        const unsub = this.topLevelValidating$.subscribe((v) => {\n          if (!v) {\n            unsub()\n            resolve()\n          }\n        })\n      })\n    }\n    return this.isValid.peek()\n  }\n\n  dispose(): void {\n    if (this.disposed) return\n    this.disposed = true\n    this.validatorDispose?.()\n    this.currentValidatorAbort?.abort()\n    for (const item of this.items$.peek()) {\n      ;(item as { dispose?: () => void }).dispose?.()\n    }\n  }\n\n  private runTopLevelValidators(): void {\n    if (this.disposed) return\n    const value = this.value.value\n    this.currentValidatorAbort?.abort()\n    const abort = new AbortController()\n    this.currentValidatorAbort = abort\n    const myId = ++this.currentValidatorRun\n\n    const syncIssues: FormIssue[] = []\n    const asyncPromises: Promise<ValidatorResult>[] = []\n    for (const v of this.validators) {\n      try {\n        const r = v(value, abort.signal)\n        if (r instanceof Promise) asyncPromises.push(r)\n        else appendIssues(syncIssues, r)\n      } catch (err) {\n        try {\n          this.onValidatorError?.(err)\n        } catch {\n          // The reporter must not propagate.\n        }\n        // Prod shows a generic message (don't leak internal error text into\n        // form errors); the real error still reaches `onValidatorError` (T5.3).\n        syncIssues.push({\n          path: [],\n          message: __DEV__\n            ? err instanceof Error\n              ? err.message\n              : String(err)\n            : 'Validation failed',\n        })\n      }\n    }\n\n    if (syncIssues.length > 0) {\n      batch(() => {\n        this.lastFormErrorTargets = routeFormIssues(\n          this,\n          syncIssues,\n          this.topLevelErrors$,\n          this.lastFormErrorTargets,\n        )\n        this.topLevelValidating$.set(false)\n      })\n      return\n    }\n\n    if (asyncPromises.length === 0) {\n      batch(() => {\n        this.lastFormErrorTargets = routeFormIssues(\n          this,\n          [],\n          this.topLevelErrors$,\n          this.lastFormErrorTargets,\n        )\n        this.topLevelValidating$.set(false)\n      })\n      return\n    }\n\n    batch(() => {\n      this.lastFormErrorTargets = routeFormIssues(\n        this,\n        [],\n        this.topLevelErrors$,\n        this.lastFormErrorTargets,\n      )\n      this.topLevelValidating$.set(true)\n    })\n\n    Promise.allSettled(asyncPromises).then((results) => {\n      if (myId !== this.currentValidatorRun || this.disposed) return\n      const issues: FormIssue[] = []\n      for (const r of results) {\n        if (r.status === 'fulfilled') appendIssues(issues, r.value)\n      }\n      batch(() => {\n        this.lastFormErrorTargets = routeFormIssues(\n          this,\n          issues,\n          this.topLevelErrors$,\n          this.lastFormErrorTargets,\n        )\n        this.topLevelValidating$.set(false)\n      })\n    })\n  }\n}\n\nexport function createForm<S extends FormSchema>(\n  schema: S,\n  options?: FormOptions<S>,\n  internalOptions?: { onValidatorError?: (err: unknown) => void },\n): Form<S> {\n  return new FormImpl(schema, options, internalOptions)\n}\n\nexport function createFieldArray<I extends Field<any> | Form<any>>(\n  itemFactory: (initial?: ItemInitial<I>) => I,\n  options?: FieldArrayOptions<I>,\n  internalOptions?: { onValidatorError?: (err: unknown) => void },\n): FieldArray<I> {\n  return new FieldArrayImpl<I>(itemFactory, options, internalOptions)\n}\n\n/**\n * Recursively wire every leaf `Field` in a form / field-array tree to a\n * devtools emitter. Returns a single disposer that tears down every standalone\n * `effect()` registered along the way (used for FieldArray watching), so the\n * caller — `ctx.form` / `ctx.fieldArray` in the controller — can register one\n * cleanup entry and have the whole subtree's reactive work die with the\n * controller. Spec §20.9.\n */\nexport function bindTreeToDevtools(\n  node: Field<unknown> | Form<FormSchema> | FieldArray<Field<unknown> | Form<FormSchema>>,\n  prefix: string,\n  controllerPath: readonly string[],\n  emitter: import('../devtools').DevtoolsEmitter,\n): () => void {\n  const disposers: Array<() => void> = []\n  bindTreeToDevtoolsInto(node, prefix, controllerPath, emitter, disposers)\n  return () => {\n    for (const d of disposers) {\n      try {\n        d()\n      } catch {\n        // Disposer failures must not break sibling cleanup.\n      }\n    }\n    disposers.length = 0\n  }\n}\n\nfunction bindTreeToDevtoolsInto(\n  node: Field<unknown> | Form<FormSchema> | FieldArray<Field<unknown> | Form<FormSchema>>,\n  prefix: string,\n  controllerPath: readonly string[],\n  emitter: import('../devtools').DevtoolsEmitter,\n  disposers: Array<() => void>,\n): void {\n  if (isForm(node)) {\n    for (const [key, child] of Object.entries(node.fields)) {\n      bindTreeToDevtoolsInto(\n        child,\n        prefix === '' ? key : `${prefix}.${key}`,\n        controllerPath,\n        emitter,\n        disposers,\n      )\n    }\n    return\n  }\n  if (isFieldArray(node)) {\n    // Re-bind on every items change so dynamically-added entries get tracked.\n    // Each re-bind has its own disposer set scoped to that pass; on the next\n    // items change we flush the previous pass's disposers BEFORE creating the\n    // new effects, so a churning array doesn't accumulate reactive work.\n    // (Pre-fix, every items mutation appended fresh effects to the outer\n    // `disposers` array and never released the old ones.)\n    const arr = node as FieldArray<Field<unknown> | Form<FormSchema>>\n    let perPass: Array<() => void> = []\n    const stop = effect(() => {\n      const items = arr.items.value\n      // Flush previous pass before rebinding the new item set.\n      for (const d of perPass) {\n        try {\n          d()\n        } catch {\n          // Disposer failures must not break sibling cleanup.\n        }\n      }\n      perPass = []\n      items.forEach((item, idx) => {\n        bindTreeToDevtoolsInto(item, `${prefix}[${idx}]`, controllerPath, emitter, perPass)\n      })\n    })\n    disposers.push(stop)\n    // On final dispose, drain the per-pass disposers too.\n    disposers.push(() => {\n      for (const d of perPass) {\n        try {\n          d()\n        } catch {\n          // Ignore.\n        }\n      }\n      perPass = []\n    })\n    return\n  }\n  // Leaf Field.\n  bindFieldDevtoolsOwner(node as Field<unknown>, {\n    controllerPath,\n    fieldName: prefix,\n    emitter,\n  })\n}\n\n/**\n * Walk a Form/FieldArray subtree and install `reporter` on every level —\n * leaf fields, nested forms' top-level validators, and field-arrays' top-level\n * validators. Called by `ctx.form` / `ctx.fieldArray` so synchronous validator\n * throws anywhere in the tree route through `root.onError`. See\n * `ValidatorErrorReporter` in `./field.ts`.\n */\nexport function bindTreeValidatorErrorReporter(\n  node: Field<unknown> | Form<FormSchema> | FieldArray<Field<unknown> | Form<FormSchema>>,\n  reporter: ValidatorErrorReporter | null,\n): void {\n  if (isForm(node)) {\n    const impl = node as { bindValidatorErrorReporter?: (r: ValidatorErrorReporter | null) => void }\n    impl.bindValidatorErrorReporter?.(reporter)\n    for (const child of Object.values(node.fields)) {\n      bindTreeValidatorErrorReporter(child, reporter)\n    }\n    return\n  }\n  if (isFieldArray(node)) {\n    const impl = node as { bindValidatorErrorReporter?: (r: ValidatorErrorReporter | null) => void }\n    impl.bindValidatorErrorReporter?.(reporter)\n    // Items currently in the array. (Items added later won't get the reporter\n    // unless `ctx.fieldArray` is wrapped to rebind — but the leaf items in the\n    // typical pattern come from a user factory that constructs through\n    // `createField` and is bound here by the parent traversal.)\n    for (const item of node.items.value) {\n      bindTreeValidatorErrorReporter(item, reporter)\n    }\n    return\n  }\n  bindFieldValidatorErrorReporter(node as Field<unknown>, reporter)\n}\n\n// Quiet unused-import linter without exporting these symbols publicly.\nvoid createField\nvoid untracked\nvoid isField\n","import { effect, untracked } from '../signals'\nimport type { ReadSignal } from '../signals/types'\nimport { Entry } from './entry'\nimport type { LocalCache, Snapshot } from './types'\n\nexport type LocalCacheOptions<T> = {\n  key?: () => readonly unknown[]\n  staleTime?: number\n  keepPreviousData?: boolean\n  initialData?: T | undefined\n}\n\nclass LocalCacheImpl<T> implements LocalCache<T> {\n  private readonly entry: Entry<T>\n  private keyEffectDispose: (() => void) | null = null\n  private disposed = false\n  private readonly keepPreviousData: boolean\n  private lastSucceededFor: unknown[] | null = null\n\n  constructor(fetcher: (signal: AbortSignal) => Promise<T>, options: LocalCacheOptions<T>) {\n    this.keepPreviousData = options.keepPreviousData ?? false\n    this.entry = new Entry<T>({\n      fetcher: () => fetcher,\n      staleTime: options.staleTime ?? 0,\n      initialData: options.initialData,\n    })\n\n    if (options.key) {\n      const keyFn = options.key\n      this.keyEffectDispose = effect(() => {\n        // Track keys.\n        const keyArgs = keyFn() as unknown[]\n        untracked(() => {\n          if (!this.keepPreviousData) {\n            // Reset data on key change so consumers see \"loading\" rather than\n            // the previous key's stale value.\n            if (this.lastSucceededFor != null && !arraysEqual(this.lastSucceededFor, keyArgs)) {\n              this.entry.data.set(undefined)\n            }\n          }\n          this.entry.startFetch().then(\n            () => {\n              this.lastSucceededFor = [...keyArgs]\n            },\n            () => {\n              /* error already captured on entry */\n            },\n          )\n        })\n      })\n    } else {\n      this.entry.startFetch().catch(() => {\n        /* error already captured on entry */\n      })\n    }\n  }\n\n  get data(): ReadSignal<T | undefined> {\n    return this.entry.data\n  }\n  get error(): ReadSignal<unknown | undefined> {\n    return this.entry.error\n  }\n  get status(): ReadSignal<'idle' | 'pending' | 'success' | 'error'> {\n    return this.entry.status\n  }\n  get isLoading(): ReadSignal<boolean> {\n    return this.entry.isLoading\n  }\n  get isFetching(): ReadSignal<boolean> {\n    return this.entry.isFetching\n  }\n  get isStale(): ReadSignal<boolean> {\n    return this.entry.isStale\n  }\n  get lastUpdatedAt(): ReadSignal<number | undefined> {\n    return this.entry.lastUpdatedAt\n  }\n  get hasPendingMutations(): ReadSignal<boolean> {\n    return this.entry.hasPendingMutations\n  }\n  get isPaused(): ReadSignal<boolean> {\n    return this.entry.isPaused\n  }\n\n  refetch = (): Promise<T> => this.entry.refetch()\n  reset = (): void => this.entry.reset()\n  firstValue = (): Promise<T> => this.entry.firstValue()\n  promise = (): Promise<T> => this.entry.firstValue()\n  invalidate = (): void => {\n    this.entry.invalidate().catch(() => {})\n  }\n  setData = (updater: (prev: T | undefined) => T): Snapshot => this.entry.setData(updater)\n\n  dispose(): void {\n    if (this.disposed) return\n    this.disposed = true\n    this.keyEffectDispose?.()\n    this.keyEffectDispose = null\n    this.entry.dispose()\n  }\n}\n\nexport function createLocalCache<T>(\n  fetcher: (signal: AbortSignal) => Promise<T>,\n  options?: LocalCacheOptions<T>,\n): LocalCache<T> {\n  return new LocalCacheImpl(fetcher, options ?? {})\n}\n\nfunction arraysEqual(a: readonly unknown[], b: readonly unknown[]): boolean {\n  if (a.length !== b.length) return false\n  for (let i = 0; i < a.length; i++) {\n    if (!Object.is(a[i], b[i])) return false\n  }\n  return true\n}\n","import type { DevtoolsEmitter } from '../devtools'\nimport { dispatchError, type ErrorHandler } from '../errors'\nimport { batch, type Signal, signal } from '../signals'\nimport type { ReadSignal } from '../signals/types'\nimport { abortableSleep, isAbortError } from '../utils'\nimport { registerMutationById } from './plugin'\nimport type { AsyncStatus, RetryDelay, RetryPolicy, Snapshot } from './types'\n\n/**\n * How concurrent calls to `mutation.run(...)` interact:\n * - `parallel` (default): every call runs concurrently.\n * - `latest-wins`: a new call aborts any in-flight previous call (`AbortSignal` fires).\n * - `serial`: calls queue and run one at a time in order.\n *\n * Spec §6.3.\n */\nexport type MutationConcurrency = 'parallel' | 'latest-wins' | 'serial'\n\n/**\n * The configuration object passed to `ctx.mutation(spec)`. See spec §20.5 for\n * the full lifecycle semantics. `onMutate` may return a `Snapshot` (from\n * `query.setData(...)`) to enable automatic rollback on error.\n */\nexport type MutationSpec<V, R> = {\n  /**\n   * A short human-readable name. Surfaces in the devtools mutation log so the\n   * user sees `moveCard` instead of just the controller path. Strongly\n   * recommended in app code; cosmetic only — no runtime semantics depend on it.\n   */\n  name?: string\n  /** The actual write. Receives the user-supplied vars and an `AbortSignal`. */\n  mutate: (vars: V, signal: AbortSignal) => Promise<R>\n  /**\n   * Runs before `mutate`. Return a `Snapshot` from `query.setData(...)` to\n   * apply an optimistic update; the snapshot is rolled back on error.\n   */\n  onMutate?: (vars: V) => Snapshot | void\n  onSuccess?: (result: R, vars: V) => void\n  onError?: (err: unknown, vars: V, snapshot: Snapshot | undefined) => void\n  onSettled?: (result: R | undefined, err: unknown | undefined, vars: V) => void\n  concurrency?: MutationConcurrency\n  retry?: RetryPolicy\n  retryDelay?: RetryDelay\n  /**\n   * Stable identifier used by the mutation-queue plugin\n   * (`@kontsedal/olas-mutation-queue`) to route persistable runs across a\n   * page reload. REQUIRED when `persist: true`. Recommended even without\n   * `persist` if you want devtools to group runs across mutation instances\n   * — same shape as `defineQuery({ queryId })`.\n   *\n   * Don't auto-derive from `name` or function identity; both are fragile\n   * under minification.\n   */\n  mutationId?: string\n  /**\n   * Opt this mutation into durable persistence. When `true`, the runner\n   * emits `onMutationEnqueue` to plugins before the user's `mutate` runs\n   * and `onMutationSettle` after retries exhaust. Requires `mutationId`.\n   * SPEC §13.3.\n   */\n  persist?: boolean\n}\n\n/**\n * Module-scope handle for a persistable mutation. Returned by\n * `defineMutation(...)`. Pass it to `ctx.mutation(...)` (spread or as-is)\n * so per-controller lifecycle hooks (`onSuccess` / `onError` / ...) can be\n * layered on top.\n *\n * Registering at module import time means the mutation-queue plugin can\n * replay pending runs from durable storage during `init` — before any\n * controller reconstructs.\n */\nexport type MutationDef<V, R> = MutationSpec<V, R> & {\n  readonly __olas: 'mutation'\n  readonly mutationId: string\n}\n\n/**\n * Register a persistable mutation at module scope. Returns the spec\n * unchanged (with a `__olas: 'mutation'` brand) so consumers can pass it\n * to `ctx.mutation(...)`, optionally spreading per-controller hooks on\n * top:\n *\n * ```ts\n * // module-scope\n * export const createOrder = defineMutation({\n *   mutationId: 'order/create',\n *   mutate: async (vars: OrderInput, { signal }) => api.createOrder(vars, { signal }),\n * })\n *\n * // controller\n * const m = ctx.mutation({\n *   ...createOrder,\n *   onSuccess: () => toast('Order placed'),\n * })\n * ```\n *\n * The `mutate` function MUST NOT close over controller-instance state — on\n * replay there is no controller. Module-level dependencies (a shared `api`\n * client, etc.) are fine.\n */\nexport function defineMutation<V, R>(\n  spec: MutationSpec<V, R> & { mutationId: string; persist?: boolean },\n): MutationDef<V, R> {\n  if (typeof spec.mutationId !== 'string' || spec.mutationId.length === 0) {\n    throw new Error('[olas] defineMutation requires a non-empty `mutationId`.')\n  }\n  // Default `persist: true` for defined mutations — that's the whole point\n  // of using the module-scope helper. Consumers who want a non-persistable\n  // module-scope handle can override with `persist: false`.\n  const persistSpec: MutationSpec<V, R> = { ...spec, persist: spec.persist ?? true }\n  registerMutationById(spec.mutationId, {\n    mutationId: spec.mutationId,\n    mutate: spec.mutate as (vars: unknown, signal: AbortSignal) => Promise<unknown>,\n  })\n  return Object.assign(persistSpec, {\n    __olas: 'mutation' as const,\n    mutationId: spec.mutationId,\n  })\n}\n\n/**\n * A running mutation. Created via `ctx.mutation(spec)` — the controller owns\n * its lifetime. Each `run(vars)` returns a Promise; the four signals reflect\n * the last-resolved run for UI binding.\n *\n * Spec §6, §20.5.\n */\n/**\n * Call signature for `mutation.run`:\n *  - When `V` is `void` → no args. (`mutation.run()`)\n *  - When `V` was not constrained (default-inferred as `unknown`) → optional\n *    arg. Lets `ctx.mutation({ mutate: async () => 1 })` call `run()` *or*\n *    `run(anything)` without a type error.\n *  - Otherwise → arg required. (`mutation.run(vars)`)\n *\n * Defined as a variadic-tuple conditional so consumers see the right shape\n * without writing `run(undefined as unknown as void)`.\n */\nexport type MutationRun<V, R> = (\n  ...args: unknown extends V ? [V?] : [V] extends [void] ? [] : [V]\n) => Promise<R>\n\nexport type Mutation<V, R> = {\n  /** Trigger a run. Returns a Promise that resolves with the mutate result. */\n  run: MutationRun<V, R>\n  data: ReadSignal<R | undefined>\n  error: ReadSignal<unknown | undefined>\n  isPending: ReadSignal<boolean>\n  /**\n   * Outcome of the latest run: `'idle'` (never run / reset), `'pending'`\n   * (in flight), `'success'`, `'error'`. Distinct from `isPending` (which\n   * stays true while ANY run is in flight, for parallel mode) and from `data`\n   * — a `void` mutation still reports `status: 'success'` after it resolves.\n   * A superseded `latest-wins` run does NOT flip status to `'error'`; the\n   * superseder owns the final status.\n   */\n  status: ReadSignal<AsyncStatus>\n  lastVariables: ReadSignal<V | undefined>\n  /** Clear `data` / `error` / `lastVariables` / `status` without aborting in-flight runs. */\n  reset(): void\n  /** Abort in-flight runs and tear down. Idempotent. Called by the parent controller's dispose. */\n  dispose(): void\n}\n\ntype RunHandle = {\n  abort: AbortController\n  snapshot: Snapshot | undefined\n}\n\ntype SerialEntry<V, R> = {\n  vars: V\n  resolve: (value: R) => void\n  reject: (err: unknown) => void\n}\n\n/**\n * Hooks for emitting persistable-mutation lifecycle events back to the\n * `QueryClient`. Wired from `createMutation` when `spec.persist === true`.\n * Internal — not part of any public surface.\n */\nexport type MutationLifecycleHooks = {\n  emitEnqueue(event: {\n    mutationId: string\n    runId: string\n    variables: unknown\n    attempt: number\n  }): void\n  emitSettle(event: {\n    mutationId: string\n    runId: string\n    outcome: 'success' | 'error' | 'cancelled'\n    error?: unknown\n  }): void\n}\n\nclass MutationImpl<V, R> implements Mutation<V, R> {\n  readonly data: Signal<R | undefined> = signal(undefined)\n  readonly error: Signal<unknown | undefined> = signal(undefined)\n  readonly isPending: Signal<boolean> = signal(false)\n  readonly status: Signal<AsyncStatus> = signal<AsyncStatus>('idle')\n  readonly lastVariables: Signal<V | undefined> = signal(undefined)\n\n  private inflight = new Set<RunHandle>()\n  private serialQueue: Array<SerialEntry<V, R>> = []\n  private serialActive = false\n  private disposed = false\n\n  constructor(\n    private readonly spec: MutationSpec<V, R>,\n    private readonly onError: ErrorHandler | undefined,\n    private readonly controllerPath: readonly string[],\n    private readonly inflightCounter?: {\n      update(fn: (n: number) => number): void\n    },\n    private readonly devtools?: DevtoolsEmitter,\n    private readonly lifecycle?: MutationLifecycleHooks,\n  ) {}\n\n  /**\n   * True iff this mutation should emit persistable-lifecycle events.\n   * Validated at construction time (in `createMutation`) so any malformed\n   * `persist: true`-without-`mutationId` config surfaces early.\n   */\n  private get isPersistable(): boolean {\n    return this.spec.persist === true && this.lifecycle !== undefined\n  }\n\n  private emit(event: { type: 'mutation:run'; vars: unknown }): void\n  private emit(event: { type: 'mutation:success'; result: unknown }): void\n  private emit(event: { type: 'mutation:error'; error: unknown }): void\n  private emit(event: { type: 'mutation:rollback' }): void\n  private emit(\n    event:\n      | { type: 'mutation:run'; vars: unknown }\n      | { type: 'mutation:success'; result: unknown }\n      | { type: 'mutation:error'; error: unknown }\n      | { type: 'mutation:rollback' },\n  ): void {\n    if (!__DEV__) return\n    if (this.devtools === undefined) return\n    const out: Record<string, unknown> = { ...event, path: this.controllerPath }\n    if (this.spec.name !== undefined) out.name = this.spec.name\n    this.devtools.emit(out as Parameters<DevtoolsEmitter['emit']>[0])\n  }\n\n  // Implementation-side signature accepts an optional `vars` (defaults to\n  // `undefined`) so call sites for `Mutation<void, R>` can call `.run()` with\n  // no args. The public type forces the right shape per `V`.\n  run = ((vars: V = undefined as V): Promise<R> => {\n    if (this.disposed) {\n      return Promise.reject(new Error('Mutation disposed'))\n    }\n    const mode = this.spec.concurrency ?? 'parallel'\n    switch (mode) {\n      case 'parallel':\n        return this.executeRun(vars)\n      case 'latest-wins':\n        // Spec §6.1: rollback the superseded run's snapshot BEFORE the new\n        // run's onMutate runs, so the new optimistic update doesn't stack on\n        // top of the obsolete one.\n        for (const handle of this.inflight) {\n          handle.abort.abort()\n          handle.snapshot?.rollback()\n          handle.snapshot = undefined\n        }\n        return this.executeRun(vars)\n      case 'serial':\n        return this.enqueueSerial(vars)\n    }\n  }) as MutationRun<V, R>\n\n  private enqueueSerial(vars: V): Promise<R> {\n    if (this.serialActive) {\n      return new Promise<R>((resolve, reject) => {\n        this.serialQueue.push({ vars, resolve, reject })\n      })\n    }\n    this.serialActive = true\n    return this.executeRun(vars).finally(() => this.advanceSerialQueue())\n  }\n\n  private advanceSerialQueue(): void {\n    const next = this.serialQueue.shift()\n    if (!next) {\n      this.serialActive = false\n      return\n    }\n    this.executeRun(next.vars).then(\n      (result) => {\n        next.resolve(result)\n        this.advanceSerialQueue()\n      },\n      (err) => {\n        next.reject(err)\n        this.advanceSerialQueue()\n      },\n    )\n  }\n\n  private async executeRun(vars: V): Promise<R> {\n    const abort = new AbortController()\n    let snapshot: Snapshot | undefined\n    try {\n      const raw = this.spec.onMutate?.(vars) ?? undefined\n      snapshot = raw === undefined ? undefined : this.wrapSnapshot(raw)\n    } catch (err) {\n      // onMutate threw — the optimistic setup failed, so running `mutate`\n      // against a half-applied state is unsafe. Abort the whole run: surface\n      // via the error signal, the mutation's onError/onSettled, and the\n      // rejected run promise (mirrors the mutate-failure path). No snapshot\n      // exists yet, so nothing to roll back; `mutate` is never called. T3.9.\n      this.error.set(err)\n      this.status.set('error')\n      if (__DEV__) this.emit({ type: 'mutation:error', error: err })\n      this.safeCall(() => this.spec.onError?.(err, vars, undefined), 'mutation')\n      this.safeCall(() => this.spec.onSettled?.(undefined, err, vars), 'mutation')\n      throw err\n    }\n\n    const handle: RunHandle = { abort, snapshot }\n    this.inflight.add(handle)\n    this.inflightCounter?.update((n) => n + 1)\n    batch(() => {\n      this.isPending.set(true)\n      this.status.set('pending')\n      this.lastVariables.set(vars)\n    })\n\n    if (__DEV__) this.emit({ type: 'mutation:run', vars })\n\n    // Persistable mutations emit an enqueue event BEFORE the user's `mutate`\n    // runs. If the page reloads mid-mutation, the queue plugin replays from\n    // this entry. `runId` is unique per `executeRun` invocation; retries\n    // within `runWithRetry` reuse it via `attempt` bumps inside that loop.\n    const runId = this.isPersistable ? makeRunId() : ''\n    const mutationId = this.spec.mutationId\n    if (this.isPersistable && mutationId !== undefined) {\n      try {\n        this.lifecycle?.emitEnqueue({ mutationId, runId, variables: vars, attempt: 0 })\n      } catch (err) {\n        dispatchError(this.onError, err, {\n          kind: 'plugin',\n          controllerPath: this.controllerPath,\n        })\n      }\n    }\n\n    try {\n      const result = await raceAbort(this.runWithRetry(vars, abort.signal), abort.signal)\n      if (abort.signal.aborted || this.disposed) {\n        snapshot?.rollback()\n        if (this.isPersistable && mutationId !== undefined) {\n          this.safeEmitSettle({ mutationId, runId, outcome: 'cancelled' })\n        }\n        throw new DOMException('Superseded', 'AbortError')\n      }\n      batch(() => {\n        this.data.set(result)\n        this.error.set(undefined)\n        this.status.set('success')\n      })\n      if (__DEV__) this.emit({ type: 'mutation:success', result })\n      this.safeCall(() => this.spec.onSuccess?.(result, vars), 'mutation')\n      // Commit the optimistic snapshot so `hasPendingMutations` clears on the\n      // affected entry. Symmetric to the auto-rollback in the error path.\n      // Spec §6.4.\n      snapshot?.finalize()\n      this.safeCall(() => this.spec.onSettled?.(result, undefined, vars), 'mutation')\n      if (this.isPersistable && mutationId !== undefined) {\n        this.safeEmitSettle({ mutationId, runId, outcome: 'success' })\n      }\n      return result\n    } catch (err) {\n      if (isAbortError(err) || abort.signal.aborted) {\n        snapshot?.rollback()\n        if (this.isPersistable && mutationId !== undefined) {\n          this.safeEmitSettle({ mutationId, runId, outcome: 'cancelled' })\n        }\n        // Reserve `error` signal for genuine failures.\n        throw err\n      }\n      this.error.set(err)\n      this.status.set('error')\n      if (__DEV__) this.emit({ type: 'mutation:error', error: err })\n      this.safeCall(() => this.spec.onError?.(err, vars, snapshot), 'mutation')\n      // Auto-rollback after the user's onError. The wrapped snapshot is\n      // single-consume, so an `onError` that already called `snapshot.rollback()`\n      // turns the auto-call into a no-op. Spec §6.4.\n      snapshot?.rollback()\n      this.safeCall(() => this.spec.onSettled?.(undefined, err, vars), 'mutation')\n      if (this.isPersistable && mutationId !== undefined) {\n        this.safeEmitSettle({ mutationId, runId, outcome: 'error', error: err })\n      }\n      throw err\n    } finally {\n      this.inflight.delete(handle)\n      this.inflightCounter?.update((n) => Math.max(0, n - 1))\n      if (this.inflight.size === 0) {\n        this.isPending.set(false)\n      }\n    }\n  }\n\n  private safeEmitSettle(event: {\n    mutationId: string\n    runId: string\n    outcome: 'success' | 'error' | 'cancelled'\n    error?: unknown\n  }): void {\n    try {\n      this.lifecycle?.emitSettle(event)\n    } catch (err) {\n      dispatchError(this.onError, err, {\n        kind: 'plugin',\n        controllerPath: this.controllerPath,\n      })\n    }\n  }\n\n  // Wrap so any rollback / finalize path runs the raw operation at most\n  // once. The mutation auto-finalizes on success and auto-rolls-back on\n  // error; user code may also call rollback() from onError. Whichever\n  // happens first wins; subsequent calls (including the auto-call) no-op.\n  private wrapSnapshot(raw: Snapshot): Snapshot {\n    let consumed = false\n    return {\n      rollback: () => {\n        if (consumed) return\n        consumed = true\n        raw.rollback()\n        if (__DEV__) this.emit({ type: 'mutation:rollback' })\n      },\n      finalize: () => {\n        if (consumed) return\n        consumed = true\n        raw.finalize()\n      },\n    }\n  }\n\n  private async runWithRetry(vars: V, signal: AbortSignal): Promise<R> {\n    const retry = this.spec.retry ?? 0\n    const retryDelay = this.spec.retryDelay ?? 1000\n    let attempt = 0\n    while (true) {\n      try {\n        return await this.spec.mutate(vars, signal)\n      } catch (err) {\n        if (signal.aborted || isAbortError(err)) throw err\n        const shouldRetry = typeof retry === 'number' ? attempt < retry : retry(attempt, err)\n        if (!shouldRetry) throw err\n        const delay = typeof retryDelay === 'function' ? retryDelay(attempt) : retryDelay\n        await abortableSleep(delay, signal)\n        attempt += 1\n      }\n    }\n  }\n\n  private safeCall(fn: () => void, kind: 'mutation'): void {\n    try {\n      fn()\n    } catch (err) {\n      dispatchError(this.onError, err, {\n        kind,\n        controllerPath: this.controllerPath,\n      })\n    }\n  }\n\n  reset(): void {\n    if (this.disposed) return\n    for (const handle of this.inflight) handle.abort.abort()\n    // Reject queued serial runs so their awaiters don't hang — symmetric with\n    // `dispose()`. Without this, callers of `mutation.run(...)` on a serial\n    // mutation that get reset mid-queue wait forever.\n    if (this.serialQueue.length > 0) {\n      const aborted = new DOMException('Aborted', 'AbortError')\n      const queue = this.serialQueue\n      this.serialQueue = []\n      for (const queued of queue) queued.reject(aborted)\n    }\n    this.serialActive = false\n    batch(() => {\n      this.data.set(undefined)\n      this.error.set(undefined)\n      this.lastVariables.set(undefined)\n      this.isPending.set(false)\n      this.status.set('idle')\n    })\n  }\n\n  dispose(): void {\n    if (this.disposed) return\n    this.disposed = true\n    for (const handle of this.inflight) handle.abort.abort()\n    for (const queued of this.serialQueue) {\n      queued.reject(new DOMException('Disposed', 'AbortError'))\n    }\n    this.serialQueue.length = 0\n  }\n}\n\nexport function createMutation<V, R>(\n  spec: MutationSpec<V, R>,\n  onError: ErrorHandler | undefined,\n  controllerPath: readonly string[],\n  inflightCounter?: { update(fn: (n: number) => number): void },\n  devtools?: DevtoolsEmitter,\n  lifecycle?: MutationLifecycleHooks,\n): Mutation<V, R> {\n  // Validate persistable-mutation config at construction time so misconfig\n  // surfaces synchronously rather than on first `run()`.\n  if (spec.persist === true) {\n    if (typeof spec.mutationId !== 'string' || spec.mutationId.length === 0) {\n      throw new Error(\n        '[olas] ctx.mutation({ persist: true, ... }) requires a non-empty `mutationId`.',\n      )\n    }\n  }\n  return new MutationImpl<V, R>(spec, onError, controllerPath, inflightCounter, devtools, lifecycle)\n}\n\n/**\n * Generate a unique-enough run id for the persistable-mutation lifecycle.\n * Uses `crypto.randomUUID` where available (Node 19+, modern browsers),\n * with a timestamp+random fallback for older runtimes. Collisions only\n * affect dedup at the plugin layer, not correctness, so the fallback's\n * weakness is acceptable.\n */\nfunction makeRunId(): string {\n  const g = globalThis as { crypto?: { randomUUID?: () => string } }\n  if (typeof g.crypto?.randomUUID === 'function') return g.crypto.randomUUID()\n  const rand = Math.random().toString(36).slice(2, 12)\n  return `${Date.now().toString(36)}-${rand}`\n}\n\n/**\n * Race a promise against an AbortSignal. If the signal fires before the\n * promise settles, the returned promise rejects with AbortError — regardless\n * of whether the underlying promise ever resolves. Protects against\n * misbehaving mutate fns that ignore their signal.\n */\nfunction raceAbort<T>(promise: Promise<T>, signal: AbortSignal): Promise<T> {\n  if (signal.aborted) {\n    return Promise.reject(new DOMException('Aborted', 'AbortError'))\n  }\n  return new Promise<T>((resolve, reject) => {\n    let settled = false\n    const onAbort = () => {\n      if (settled) return\n      settled = true\n      reject(new DOMException('Aborted', 'AbortError'))\n    }\n    signal.addEventListener('abort', onAbort, { once: true })\n    promise.then(\n      (v) => {\n        if (settled) return\n        settled = true\n        signal.removeEventListener('abort', onAbort)\n        resolve(v)\n      },\n      (e) => {\n        if (settled) return\n        settled = true\n        signal.removeEventListener('abort', onAbort)\n        reject(e)\n      },\n    )\n  })\n}\n","import { computed, effect, type Signal, signal, untracked } from '../signals'\nimport type { ReadSignal } from '../signals/types'\nimport { isAbortError } from '../utils'\nimport type { ClientEntry, InfiniteClientEntry, QueryClient } from './client'\nimport type { InfiniteQuery, InfiniteQuerySpec, InfiniteQuerySubscription } from './infinite'\nimport type {\n  AsyncStatus,\n  Query,\n  QuerySpec,\n  QuerySubscription,\n  UseInternalOptions,\n  UseOptions,\n} from './types'\n\ntype QueryInternal<Args extends unknown[], T> = Query<Args, T> & {\n  readonly __spec: QuerySpec<Args, T>\n}\n\nclass SubscriptionImpl<T, U = T> implements QuerySubscription<U> {\n  private readonly current$: Signal<ClientEntry<T> | null> = signal(null)\n  private readonly previousData$: Signal<T | undefined> = signal(undefined)\n\n  readonly data: ReadSignal<U | undefined>\n  readonly error: ReadSignal<unknown | undefined>\n  readonly status: ReadSignal<AsyncStatus>\n  readonly isLoading: ReadSignal<boolean>\n  readonly isFetching: ReadSignal<boolean>\n  readonly isStale: ReadSignal<boolean>\n  readonly lastUpdatedAt: ReadSignal<number | undefined>\n  readonly hasPendingMutations: ReadSignal<boolean>\n  readonly isPaused: ReadSignal<boolean>\n\n  constructor(\n    private readonly keepPreviousData: boolean,\n    private readonly select?: (data: T) => U,\n  ) {\n    // The underlying entry stores `T`. The subscription's `data` is `U`\n    // (or `T` when no projection). We compute the raw `T` once, then layer\n    // `select` in a second computed so the projection's `Object.is` dedup\n    // applies BEFORE downstream subscribers run — combined with structural\n    // sharing on the entry, an unchanged payload + a stable `select`\n    // outputs the same `U` reference and doesn't churn the React tree.\n    const rawData = computed(() => {\n      const cur = this.current$.value\n      const curData = cur?.entry.data.value\n      if (curData !== undefined) return curData\n      if (keepPreviousData) return this.previousData$.value\n      return undefined\n    })\n    this.data =\n      select === undefined\n        ? (rawData as unknown as ReadSignal<U | undefined>)\n        : computed<U | undefined>(() => {\n            const raw = rawData.value\n            return raw === undefined ? undefined : select(raw)\n          })\n    this.error = computed(() => this.current$.value?.entry.error.value)\n    this.status = computed<AsyncStatus>(() => this.current$.value?.entry.status.value ?? 'idle')\n    this.isLoading = computed(() => {\n      const cur = this.current$.value\n      if (!cur) return false\n      if (keepPreviousData && this.previousData$.value !== undefined) return false\n      return cur.entry.isLoading.value\n    })\n    this.isFetching = computed(() => this.current$.value?.entry.isFetching.value ?? false)\n    this.isStale = computed(() => this.current$.value?.entry.isStale.value ?? true)\n    this.lastUpdatedAt = computed(() => this.current$.value?.entry.lastUpdatedAt.value)\n    this.hasPendingMutations = computed(\n      () => this.current$.value?.entry.hasPendingMutations.value ?? false,\n    )\n    this.isPaused = computed(() => this.current$.value?.entry.isPaused.value ?? false)\n  }\n\n  attach(entry: ClientEntry<T>): void {\n    const prev = this.current$.peek()\n    if (prev === entry) return\n    if (prev && this.keepPreviousData) {\n      const prevData = prev.entry.data.peek()\n      if (prevData !== undefined) this.previousData$.set(prevData)\n    }\n    this.current$.set(entry)\n  }\n\n  detach(): void {\n    this.current$.set(null)\n  }\n\n  refetch = (): Promise<U> => {\n    const cur = this.current$.peek()\n    if (!cur) return Promise.reject(new Error('[olas] no active subscription'))\n    return cur.entry.refetch().then(\n      (v) => this.project(v),\n      (err) => {\n        // A supersede (newer refetch / key change) aborts this fetch. Don't\n        // surface the spurious AbortError — resolve with the superseding\n        // fetch's eventual outcome instead (T3.9). Real errors still reject.\n        if (isAbortError(err)) return this.firstValue()\n        throw err\n      },\n    )\n  }\n\n  reset = (): void => {\n    this.current$.peek()?.entry.reset()\n  }\n\n  cancel = (): void => {\n    this.current$.peek()?.entry.cancel()\n  }\n\n  firstValue = (): Promise<U> => {\n    const cur = this.current$.peek()\n    if (!cur) return Promise.reject(new Error('[olas] no active subscription'))\n    return cur.entry.firstValue().then((v) => this.project(v))\n  }\n\n  // Alias surfaced on `AsyncState` for Suspense / React 19 `use(...)`.\n  promise = (): Promise<U> => this.firstValue()\n\n  private project(v: T): U {\n    return this.select === undefined ? (v as unknown as U) : this.select(v)\n  }\n}\n\n/**\n * Build a subscription + the effect that keeps it bound to the right entry.\n * The controller container wires the disposer into the lifecycle.\n *\n * `keyOrOptions` may carry an optional `select` projection that maps the\n * underlying `T` to a view `U`; the returned subscription's data shape\n * widens accordingly. Without `select`, `U = T` and the projection\n * computed is skipped.\n */\nexport function createUse<Args extends unknown[], T, U = T>(\n  client: QueryClient,\n  query: Query<Args, T>,\n  keyOrOptions?: (() => Args) | UseInternalOptions<Args, T, U>,\n): {\n  subscription: QuerySubscription<U>\n  dispose: () => void\n  /** Suspend the subscription — release the entry (its refetchInterval +\n   *  focus/online listeners pause) without disposing it. Spec §4.1. */\n  suspend: () => void\n  /** Resume after `suspend`. Re-acquires the entry and refetches if stale. */\n  resume: () => void\n} {\n  const internal = query as unknown as QueryInternal<Args, T>\n  const spec = internal.__spec\n  const keepPreviousData = spec.keepPreviousData ?? false\n\n  const keyFn = typeof keyOrOptions === 'function' ? keyOrOptions : keyOrOptions?.key\n  const enabledFn =\n    typeof keyOrOptions === 'object' && keyOrOptions !== null ? keyOrOptions.enabled : undefined\n  const select =\n    typeof keyOrOptions === 'object' && keyOrOptions !== null ? keyOrOptions.select : undefined\n\n  const sub = new SubscriptionImpl<T, U>(keepPreviousData, select)\n  let currentEntry: ClientEntry<T> | null = null\n  let suspended = false\n\n  const effectDispose = effect(() => {\n    // Read tracked signals (enabled, then key when enabled) BEFORE the\n    // `suspended` early-return, so the effect keeps its dependency set while\n    // suspended. Otherwise a key/enabled change during suspension re-runs the\n    // effect, it reads nothing, its deps go empty, and it stays inert forever\n    // — resume() then only rebinds to the key as of suspend time, silently\n    // dropping every later change (T2.1). Key is read only when enabled,\n    // preserving the `enabled`-guards-`key` pattern (the key thunk may deref\n    // state that only exists once enabled).\n    const isEnabled = enabledFn ? enabledFn() : true\n    const args = isEnabled ? ((keyFn ? keyFn() : ([] as unknown as Args)) as Args) : undefined\n\n    if (suspended) return\n\n    if (!isEnabled) {\n      untracked(() => {\n        if (currentEntry) {\n          currentEntry.release()\n          currentEntry = null\n        }\n        sub.detach()\n      })\n      return\n    }\n\n    untracked(() => {\n      const entry = client.bindEntry<Args, T>(query, args as Args)\n      if (currentEntry === entry) return\n      if (currentEntry) currentEntry.release()\n      entry.acquire()\n      currentEntry = entry\n      sub.attach(entry)\n\n      const status = entry.entry.status.peek()\n      const fetching = entry.entry.isFetching.peek()\n      if (!fetching && (status === 'idle' || entry.entry.isStaleNow() || status === 'error')) {\n        entry.entry.startFetch().catch(() => {\n          /* error captured on entry */\n        })\n      }\n    })\n  })\n\n  const dispose = () => {\n    effectDispose()\n    if (currentEntry) {\n      currentEntry.release()\n      currentEntry = null\n    }\n    sub.detach()\n  }\n\n  const suspend = (): void => {\n    if (suspended) return\n    suspended = true\n    if (currentEntry) {\n      currentEntry.release()\n      currentEntry = null\n    }\n    // Keep subscription detached so reads return the last committed values\n    // via the entry's signals if still alive (the entry may be gc'd after\n    // its gcTime; that's fine — resume re-binds).\n  }\n\n  const resume = (): void => {\n    if (!suspended) return\n    suspended = false\n    // Re-evaluate the keyFn + enabled flag and rebind. The effect's deps\n    // didn't change while suspended, so toggling `suspended` here doesn't\n    // re-fire the effect on its own — force a sync rebind through the same\n    // code path.\n    const isEnabled = enabledFn ? enabledFn() : true\n    if (!isEnabled) return\n    const args = (keyFn ? keyFn() : ([] as unknown as Args)) as Args\n    const entry = client.bindEntry<Args, T>(query, args)\n    entry.acquire()\n    currentEntry = entry\n    sub.attach(entry)\n    // On resume, refetch if stale (matches the spec §4.1 \"stale-on-resume\"\n    // requirement). Non-stale data stays as-is.\n    const status = entry.entry.status.peek()\n    if (status === 'idle' || entry.entry.isStaleNow() || status === 'error') {\n      entry.entry.startFetch().catch(() => {\n        /* error captured on entry */\n      })\n    }\n  }\n\n  return { subscription: sub, dispose, suspend, resume }\n}\n\ntype InfiniteQueryInternal<Args extends unknown[], TPage, TItem> = InfiniteQuery<\n  Args,\n  TPage,\n  TItem\n> & {\n  readonly __spec: InfiniteQuerySpec<Args, any, TPage, TItem>\n}\n\nclass InfiniteSubscriptionImpl<TPage, TItem> implements InfiniteQuerySubscription<TPage, TItem> {\n  private readonly current$: Signal<InfiniteClientEntry<TPage, TItem, unknown> | null> =\n    signal(null)\n  private readonly previousPages$: Signal<TPage[] | undefined> = signal(undefined)\n\n  readonly data: ReadSignal<TPage[] | undefined>\n  readonly pages: ReadSignal<TPage[]>\n  readonly flat: ReadSignal<TItem[]>\n  readonly error: ReadSignal<unknown | undefined>\n  readonly status: ReadSignal<AsyncStatus>\n  readonly isLoading: ReadSignal<boolean>\n  readonly isFetching: ReadSignal<boolean>\n  readonly isStale: ReadSignal<boolean>\n  readonly lastUpdatedAt: ReadSignal<number | undefined>\n  readonly hasPendingMutations: ReadSignal<boolean>\n  readonly isPaused: ReadSignal<boolean>\n  readonly hasNextPage: ReadSignal<boolean>\n  readonly hasPreviousPage: ReadSignal<boolean>\n  readonly isFetchingNextPage: ReadSignal<boolean>\n  readonly isFetchingPreviousPage: ReadSignal<boolean>\n\n  constructor(private readonly keepPreviousData: boolean) {\n    this.pages = computed(() => {\n      const cur = this.current$.value\n      const ps = cur?.entry.pages.value\n      if (ps && ps.length > 0) return ps\n      if (keepPreviousData) return this.previousPages$.value ?? []\n      return ps ?? []\n    })\n    this.data = computed(() => {\n      const cur = this.current$.value\n      const ps = cur?.entry.pages.value\n      if (ps && ps.length > 0) return ps\n      if (keepPreviousData) {\n        const prev = this.previousPages$.value\n        if (prev && prev.length > 0) return prev\n      }\n      return undefined\n    })\n    this.flat = computed(() => this.current$.value?.entry.flat.value ?? [])\n    this.error = computed(() => this.current$.value?.entry.error.value)\n    this.status = computed<AsyncStatus>(() => this.current$.value?.entry.status.value ?? 'idle')\n    this.isLoading = computed(() => {\n      const cur = this.current$.value\n      if (!cur) return false\n      if (keepPreviousData) {\n        const prev = this.previousPages$.value\n        if (prev && prev.length > 0) return false\n      }\n      return cur.entry.isLoading.value\n    })\n    this.isFetching = computed(() => this.current$.value?.entry.isFetching.value ?? false)\n    this.isStale = computed(() => this.current$.value?.entry.isStale.value ?? true)\n    this.lastUpdatedAt = computed(() => this.current$.value?.entry.lastUpdatedAt.value)\n    this.hasPendingMutations = computed(\n      () => this.current$.value?.entry.hasPendingMutations.value ?? false,\n    )\n    this.isPaused = computed(() => this.current$.value?.entry.isPaused.value ?? false)\n    this.hasNextPage = computed(() => this.current$.value?.entry.hasNextPage.value ?? false)\n    this.hasPreviousPage = computed(() => this.current$.value?.entry.hasPreviousPage.value ?? false)\n    this.isFetchingNextPage = computed(\n      () => this.current$.value?.entry.isFetchingNextPage.value ?? false,\n    )\n    this.isFetchingPreviousPage = computed(\n      () => this.current$.value?.entry.isFetchingPreviousPage.value ?? false,\n    )\n  }\n\n  attach(entry: InfiniteClientEntry<TPage, TItem, unknown>): void {\n    const prev = this.current$.peek()\n    if (prev === entry) return\n    if (prev && this.keepPreviousData) {\n      const prevPages = prev.entry.pages.peek()\n      if (prevPages.length > 0) this.previousPages$.set(prevPages)\n    }\n    this.current$.set(entry)\n  }\n\n  detach(): void {\n    this.current$.set(null)\n  }\n\n  refetch = (): Promise<TPage[]> => {\n    const cur = this.current$.peek()\n    if (!cur) return Promise.reject(new Error('[olas] no active subscription'))\n    return cur.entry.refetch().then(\n      () => cur.entry.pages.peek(),\n      (err) => {\n        // Supersede → resolve with the superseder's outcome, not AbortError (T3.9).\n        if (isAbortError(err)) return this.firstValue()\n        throw err\n      },\n    )\n  }\n\n  reset = (): void => {\n    this.current$.peek()?.entry.reset()\n  }\n\n  cancel = (): void => {\n    this.current$.peek()?.entry.cancel()\n  }\n\n  firstValue = (): Promise<TPage[]> => {\n    const cur = this.current$.peek()\n    if (!cur) return Promise.reject(new Error('[olas] no active subscription'))\n    return cur.entry.firstValue()\n  }\n\n  // Alias of firstValue() for Suspense / React 19 `use(...)` ergonomics.\n  promise = (): Promise<TPage[]> => this.firstValue()\n\n  fetchNextPage = (): Promise<void> => {\n    const cur = this.current$.peek()\n    if (!cur) return Promise.resolve()\n    return cur.entry.fetchNextPage()\n  }\n\n  fetchPreviousPage = (): Promise<void> => {\n    const cur = this.current$.peek()\n    if (!cur) return Promise.resolve()\n    return cur.entry.fetchPreviousPage()\n  }\n}\n\nexport function createInfiniteUse<Args extends unknown[], TPage, TItem>(\n  client: QueryClient,\n  query: InfiniteQuery<Args, TPage, TItem>,\n  keyOrOptions?: (() => Args) | UseOptions<Args>,\n): {\n  subscription: InfiniteQuerySubscription<TPage, TItem>\n  dispose: () => void\n  suspend: () => void\n  resume: () => void\n} {\n  const spec = (query as unknown as InfiniteQueryInternal<Args, TPage, TItem>).__spec\n  const keepPreviousData = spec.keepPreviousData ?? false\n  const keyFn = typeof keyOrOptions === 'function' ? keyOrOptions : keyOrOptions?.key\n  const enabledFn =\n    typeof keyOrOptions === 'object' && keyOrOptions !== null ? keyOrOptions.enabled : undefined\n\n  const sub = new InfiniteSubscriptionImpl<TPage, TItem>(keepPreviousData)\n  let currentEntry: InfiniteClientEntry<TPage, TItem, unknown> | null = null\n  let suspended = false\n\n  const effectDispose = effect(() => {\n    // See the regular-query variant above: read enabled + key (when enabled)\n    // BEFORE the `suspended` early-return so the effect keeps its deps through\n    // suspension; otherwise a key change during suspend empties them and the\n    // subscription goes inert after resume (T2.1).\n    const isEnabled = enabledFn ? enabledFn() : true\n    const args = isEnabled ? ((keyFn ? keyFn() : ([] as unknown as Args)) as Args) : undefined\n\n    if (suspended) return\n\n    if (!isEnabled) {\n      untracked(() => {\n        if (currentEntry) {\n          currentEntry.release()\n          currentEntry = null\n        }\n        sub.detach()\n      })\n      return\n    }\n\n    untracked(() => {\n      const entry = client.bindInfiniteEntry<Args, TPage, TItem>(query, args as Args)\n      if (currentEntry === entry) return\n      if (currentEntry) currentEntry.release()\n      entry.acquire()\n      currentEntry = entry\n      sub.attach(entry)\n\n      const status = entry.entry.status.peek()\n      const fetching = entry.entry.isFetching.peek()\n      if (!fetching && (status === 'idle' || entry.entry.isStaleNow() || status === 'error')) {\n        entry.entry.startFetch().catch(() => {\n          /* error captured on entry */\n        })\n      }\n    })\n  })\n\n  const dispose = () => {\n    effectDispose()\n    if (currentEntry) {\n      currentEntry.release()\n      currentEntry = null\n    }\n    sub.detach()\n  }\n\n  const suspend = (): void => {\n    if (suspended) return\n    suspended = true\n    if (currentEntry) {\n      currentEntry.release()\n      currentEntry = null\n    }\n  }\n\n  const resume = (): void => {\n    if (!suspended) return\n    suspended = false\n    const isEnabled = enabledFn ? enabledFn() : true\n    if (!isEnabled) return\n    const args = (keyFn ? keyFn() : ([] as unknown as Args)) as Args\n    const entry = client.bindInfiniteEntry<Args, TPage, TItem>(query, args)\n    entry.acquire()\n    currentEntry = entry\n    sub.attach(entry)\n    const status = entry.entry.status.peek()\n    if (status === 'idle' || entry.entry.isStaleNow() || status === 'error') {\n      entry.entry.startFetch().catch(() => {\n        /* error captured on entry */\n      })\n    }\n  }\n\n  return { subscription: sub, dispose, suspend, resume }\n}\n","import type { DevtoolsEmitter } from '../devtools'\nimport { createEmitter, type Emitter } from '../emitter'\nimport { dispatchError, type ErrorHandler } from '../errors'\nimport { bindFieldDevtoolsOwner, createField } from '../forms/field'\nimport {\n  bindTreeToDevtools,\n  bindTreeValidatorErrorReporter,\n  createFieldArray,\n  createForm,\n} from '../forms/form'\nimport type {\n  FieldArray,\n  FieldArrayOptions,\n  Form,\n  FormOptions,\n  FormSchema,\n  ItemInitial,\n} from '../forms/form-types'\nimport type { Validator } from '../forms/types'\nimport type { QueryClient } from '../query/client'\nimport type { InfiniteQuery } from '../query/infinite'\nimport { createLocalCache, type LocalCacheOptions } from '../query/local'\nimport { createMutation, type Mutation, type MutationSpec } from '../query/mutation'\nimport type { LocalCache, Query } from '../query/types'\nimport { createInfiniteUse, createUse } from '../query/use'\nimport type { Scope } from '../scope'\nimport { computed, signal, effect as standaloneEffect, untracked } from '../signals'\nimport { readOnly } from '../signals/readonly'\nimport { getFactory, getName } from './define'\nimport type {\n  Collection,\n  CollectionFactoryApi,\n  CollectionFactoryOptions,\n  CollectionFactoryResult,\n  CollectionHomogeneousOptions,\n  ControllerDef,\n  Ctx,\n  Field,\n  LazyChild,\n} from './types'\n\nexport type RootShared = {\n  readonly devtools: DevtoolsEmitter\n  readonly onError: ErrorHandler | undefined\n  readonly queryClient: QueryClient\n  /**\n   * Monotonic counter bumped by every `ctx.provide(...)` call inside this\n   * root's tree. `ctx.inject(...)` caches its scope-walk result alongside\n   * the version it was computed at; a mismatch forces a re-walk. Cheap\n   * compared to the linear ancestor walk (most controllers never call\n   * provide, so cache hits dominate).\n   */\n  readonly scopesVersion: { value: number }\n}\n\ntype LifecycleEntry =\n  | {\n      kind: 'effect'\n      factory: () => void | (() => void)\n      dispose: (() => void) | null\n    }\n  | { kind: 'cleanup'; dispose: () => void }\n  | {\n      /**\n       * Cache subscription via `ctx.use`. Suspend/resume call the\n       * `suspend`/`resume` hooks so the underlying entry's `refetchInterval`\n       * and event listeners pause for the duration. Spec §4.1.\n       */\n      kind: 'subscription-cache'\n      dispose: () => void\n      suspend: () => void\n      resume: () => void\n    }\n  | { kind: 'child'; instance: ControllerInstance; explicitlySuspended?: boolean }\n  | { kind: 'onDispose'; fn: () => void }\n  | { kind: 'onSuspend'; fn: () => void }\n  | { kind: 'onResume'; fn: () => void }\n  | { kind: 'subscription'; unsubscribe: () => void }\n\ntype State = 'constructing' | 'active' | 'suspended' | 'disposed'\n\n/**\n * Doubly-linked-list node wrapping a `LifecycleEntry`. Holding a reference\n * to the node lets call sites unlink in O(1) instead of the old\n * `entries.indexOf(...) + splice(...)` which was quadratic for long-lived\n * collections / lazyChildren / attach-style children.\n *\n * `unlinked: true` is a defensive flag — re-unlinking a node should be a\n * no-op (the parent's dispose cascade may race with an explicit unlink\n * from a `dispose()` returned to user code).\n */\ntype LifecycleNode = {\n  entry: LifecycleEntry\n  prev: LifecycleNode | null\n  next: LifecycleNode | null\n  unlinked: boolean\n}\n\n/**\n * Append-and-unlink container for `LifecycleEntry`s. Replaces the historical\n * `LifecycleEntry[]` to make per-entry removal O(1) — important for\n * controllers that churn entries (`ctx.collection` reconcile, `lazyChild`\n * loop, `attach` short-lived children).\n *\n * Iteration order is insertion order for `forward()` and reverse-insertion\n * for `reverse()`. Iteration is safe against `push` during traversal (the\n * generator captures `next`/`prev` *before* yielding) but not against\n * unlinking the current node from inside the visitor — visitors must not\n * call `unlink` on the entry they're currently inspecting.\n */\nclass LifecycleList {\n  private head: LifecycleNode | null = null\n  private tail: LifecycleNode | null = null\n  private _size = 0\n\n  get size(): number {\n    return this._size\n  }\n\n  push(entry: LifecycleEntry): LifecycleNode {\n    const node: LifecycleNode = { entry, prev: this.tail, next: null, unlinked: false }\n    if (this.tail !== null) this.tail.next = node\n    else this.head = node\n    this.tail = node\n    this._size += 1\n    return node\n  }\n\n  unlink(node: LifecycleNode): void {\n    if (node.unlinked) return\n    node.unlinked = true\n    if (node.prev !== null) node.prev.next = node.next\n    else this.head = node.next\n    if (node.next !== null) node.next.prev = node.prev\n    else this.tail = node.prev\n    this._size -= 1\n  }\n\n  clear(): void {\n    this.head = null\n    this.tail = null\n    this._size = 0\n  }\n\n  /** Yield entries in insertion order. */\n  *forward(): Generator<LifecycleEntry> {\n    let n = this.head\n    while (n !== null) {\n      const next = n.next\n      yield n.entry\n      n = next\n    }\n  }\n\n  /** Yield entries in reverse-insertion order — used by dispose / suspend. */\n  *reverse(): Generator<LifecycleEntry> {\n    let n = this.tail\n    while (n !== null) {\n      const prev = n.prev\n      yield n.entry\n      n = prev\n    }\n  }\n}\n\nexport class ControllerInstance {\n  readonly path: readonly string[]\n  readonly deps: Record<string, unknown>\n\n  private state: State = 'constructing'\n  private readonly entries: LifecycleList = new LifecycleList()\n  private readonly rootShared: RootShared\n  private readonly parent: ControllerInstance | null\n  private childCounter = 0\n  /** Scope values provided on this instance, keyed by `Scope.__id`. */\n  private scopes: Map<symbol, unknown> | null = null\n  /**\n   * Memoized result of `ctx.inject(scope)` per scope id, stamped with the\n   * `scopesVersion` the lookup observed. A bump invalidates every cache\n   * entry implicitly — the next `inject(scope)` finds a stale version\n   * stamp and re-walks. Provide is rare; reads dominate.\n   */\n  private injectCache: Map<symbol, { value: unknown; version: number }> | null = null\n\n  /**\n   * Pre-seed scopes from outside the factory — used by `createRoot`'s\n   * `scopes:` option so an adapter (e.g. `@kontsedal/olas-router-tanstack`)\n   * can publish cross-cutting values without forcing the user to call\n   * `ctx.provide(...)` in their root controller. Idempotent per scope id:\n   * later calls override.\n   */\n  seedScopes(bindings: ReadonlyArray<readonly [{ __id: symbol }, unknown]>): void {\n    if (bindings.length === 0) return\n    if (this.scopes === null) this.scopes = new Map()\n    for (const [scope, value] of bindings) {\n      this.scopes.set(scope.__id, value)\n    }\n  }\n\n  constructor(\n    parent: ControllerInstance | null,\n    rootShared: RootShared,\n    pathSegment: string,\n    deps: Record<string, unknown>,\n  ) {\n    this.parent = parent\n    this.rootShared = rootShared\n    this.path = parent ? [...parent.path, pathSegment] : [pathSegment]\n    this.deps = deps\n  }\n\n  /**\n   * Run the factory and produce an api. On throw, the partially-constructed\n   * state is rolled back (entries disposed in reverse) and the error is rethrown.\n   */\n  construct<Props, Api>(factory: (ctx: Ctx, props: Props) => Api, props: Props): Api {\n    const ctx = this.buildCtx()\n    let api: Api\n    try {\n      api = factory(ctx, props)\n    } catch (err) {\n      this.rollbackPartialConstruction()\n      throw err\n    }\n    this.state = 'active'\n    if (__DEV__) {\n      this.rootShared.devtools.emit({\n        type: 'controller:constructed',\n        path: this.path,\n        props: props as unknown,\n      })\n    }\n    return api\n  }\n\n  private rollbackPartialConstruction(): void {\n    // Tear down what was built before the throw, in reverse order.\n    for (const entry of this.entries.reverse()) {\n      try {\n        this.disposeEntry(entry)\n      } catch (err) {\n        // A teardown error during rollback must not mask the original\n        // construction throw or abort the rest of the rollback — route it to\n        // onError, same as dispose(). (T2.8)\n        dispatchError(this.rootShared.onError, err, {\n          kind: 'effect',\n          controllerPath: this.path,\n        })\n      }\n    }\n    this.entries.clear()\n    this.state = 'disposed'\n  }\n\n  dispose(): void {\n    if (this.state === 'disposed') return\n    this.state = 'disposed'\n\n    for (const entry of this.entries.reverse()) {\n      try {\n        this.disposeEntry(entry)\n      } catch (err) {\n        dispatchError(this.rootShared.onError, err, {\n          kind: 'effect',\n          controllerPath: this.path,\n        })\n      }\n    }\n    this.entries.clear()\n    this.scopes = null\n    this.injectCache = null\n\n    if (__DEV__) {\n      this.rootShared.devtools.emit({ type: 'controller:disposed', path: this.path })\n    }\n  }\n\n  private disposeEntry(entry: LifecycleEntry): void {\n    switch (entry.kind) {\n      case 'effect':\n        entry.dispose?.()\n        entry.dispose = null\n        break\n      case 'cleanup':\n        entry.dispose()\n        break\n      case 'subscription-cache':\n        entry.dispose()\n        break\n      case 'child':\n        entry.instance.dispose()\n        break\n      case 'subscription':\n        entry.unsubscribe()\n        break\n      case 'onDispose':\n        entry.fn()\n        break\n      case 'onSuspend':\n      case 'onResume':\n        // No work on dispose.\n        break\n    }\n  }\n\n  isSuspended(): boolean {\n    return this.state === 'suspended'\n  }\n\n  suspend(): void {\n    if (this.state !== 'active') return\n    this.state = 'suspended'\n\n    for (const entry of this.entries.reverse()) {\n      try {\n        switch (entry.kind) {\n          case 'effect':\n            entry.dispose?.()\n            entry.dispose = null\n            break\n          case 'subscription-cache':\n            // Pause `refetchInterval` + focus/online listeners + release the\n            // entry from this subscriber. Spec §4.1.\n            entry.suspend()\n            break\n          case 'child':\n            entry.instance.suspend()\n            break\n          case 'onSuspend':\n            entry.fn()\n            break\n          default:\n            break\n        }\n      } catch (err) {\n        dispatchError(this.rootShared.onError, err, {\n          kind: 'effect',\n          controllerPath: this.path,\n        })\n      }\n    }\n\n    if (__DEV__) {\n      this.rootShared.devtools.emit({ type: 'controller:suspended', path: this.path })\n    }\n  }\n\n  resume(): void {\n    if (this.state !== 'suspended') return\n    this.state = 'active'\n\n    for (const entry of this.entries.forward()) {\n      try {\n        switch (entry.kind) {\n          case 'effect':\n            // Skip effects that are already live. An effect registered DURING\n            // this resume (e.g. from an onResume handler) was activated\n            // immediately by `ctx.effect` while state is 'active'; the forward\n            // loop then reaches its freshly-pushed node. Re-activating would\n            // overwrite the live `dispose` ref without calling it — the effect\n            // would run twice per change and one copy would survive dispose().\n            // Only re-activate effects that `suspend()` cleared (dispose null).\n            // (T2.2)\n            if (entry.dispose === null) {\n              entry.dispose = standaloneEffect(entry.factory)\n            }\n            break\n          case 'subscription-cache':\n            // Re-acquire the entry, restart `refetchInterval`, and re-check\n            // staleness (a stale entry refetches on resume — spec §4.1).\n            entry.resume()\n            break\n          case 'child':\n            // Skip children explicitly suspended via attach.suspend() or\n            // collection suspendItem() — a whole-tree resume (KeepAlive) must\n            // not wake them. They resume only via their own attach.resume() /\n            // resumeItem(). (T2.6)\n            if (entry.explicitlySuspended) break\n            entry.instance.resume()\n            break\n          case 'onResume':\n            entry.fn()\n            break\n          default:\n            break\n        }\n      } catch (err) {\n        dispatchError(this.rootShared.onError, err, {\n          kind: 'effect',\n          controllerPath: this.path,\n        })\n      }\n    }\n\n    if (__DEV__) {\n      this.rootShared.devtools.emit({ type: 'controller:resumed', path: this.path })\n    }\n  }\n\n  // --- Ctx surface --------------------------------------------------------\n\n  private buildCtx(): Ctx {\n    const self = this\n    // A ctx.* factory called after the controller was disposed would push into\n    // a cleared lifecycle list — a live child / subscription / effect that\n    // never gets torn down. It is always a programming error (a captured `ctx`\n    // used past its owner's lifetime), so throw rather than leak or no-op. Not\n    // routed through dispatchError — this is a bug in the caller, not a runtime\n    // condition. (T2.4, spec §4)\n    const assertLive = (method: string): void => {\n      if (self.isTerminal()) {\n        throw new Error(`[olas] ctx.${method}() called after the controller was disposed`)\n      }\n    }\n    const ctx: Ctx = {\n      get deps() {\n        return self.deps\n      },\n\n      effect(fn) {\n        assertLive('effect')\n        const entry: LifecycleEntry = {\n          kind: 'effect',\n          factory: () => fn(),\n          dispose: null,\n        }\n        // Wrap with error reporting so an effect throw goes through onError.\n        const wrapped = (): void | (() => void) => {\n          try {\n            const cleanup = fn()\n            // The effect body may return a cleanup fn that the signals runtime\n            // calls on re-run / dispose — OUTSIDE this try. Wrap it so a throw\n            // there also routes to onError instead of escaping. (T2.8)\n            if (typeof cleanup === 'function') {\n              return () => {\n                try {\n                  cleanup()\n                } catch (err) {\n                  dispatchError(self.rootShared.onError, err, {\n                    kind: 'effect',\n                    controllerPath: self.path,\n                  })\n                }\n              }\n            }\n            return cleanup\n          } catch (err) {\n            dispatchError(self.rootShared.onError, err, {\n              kind: 'effect',\n              controllerPath: self.path,\n            })\n            return undefined\n          }\n        }\n        entry.factory = wrapped\n        // If we're suspended, register the entry but defer activation to\n        // `resume()` — otherwise the resume loop would overwrite a live\n        // `dispose` ref (the just-activated effect), leaking it.\n        if (self.state !== 'suspended') {\n          entry.dispose = standaloneEffect(wrapped)\n        }\n        self.entries.push(entry)\n      },\n\n      cache<T>(\n        fetcher: (signal: AbortSignal) => Promise<T>,\n        options?: LocalCacheOptions<T>,\n      ): LocalCache<T> {\n        assertLive('cache')\n        const cache = createLocalCache<T>(fetcher, options)\n        self.entries.push({ kind: 'cleanup', dispose: () => cache.dispose() })\n        return cache\n      },\n\n      use(query: any, keyOrOptions?: any): any {\n        assertLive('use')\n        const brand = (query as { __olas?: string }).__olas\n        if (brand === 'infiniteQuery') {\n          const handle = createInfiniteUse(\n            self.rootShared.queryClient,\n            query as InfiniteQuery<unknown[], unknown, unknown>,\n            keyOrOptions,\n          )\n          self.entries.push({\n            kind: 'subscription-cache',\n            dispose: handle.dispose,\n            suspend: handle.suspend,\n            resume: handle.resume,\n          })\n          return handle.subscription\n        }\n        const handle = createUse(\n          self.rootShared.queryClient,\n          query as Query<unknown[], unknown>,\n          keyOrOptions,\n        )\n        self.entries.push({\n          kind: 'subscription-cache',\n          dispose: handle.dispose,\n          suspend: handle.suspend,\n          resume: handle.resume,\n        })\n        return handle.subscription\n      },\n\n      mutation<V, R>(spec: MutationSpec<V, R>): Mutation<V, R> {\n        assertLive('mutation')\n        const queryClient = self.rootShared.queryClient\n        const m = createMutation<V, R>(\n          spec,\n          self.rootShared.onError,\n          self.path,\n          queryClient.mutationsInflight$,\n          self.rootShared.devtools,\n          // Lifecycle hooks for persistable mutations — only wired when\n          // `spec.persist === true`. `createMutation` validates the\n          // `mutationId` requirement before construction.\n          spec.persist === true\n            ? {\n                emitEnqueue: (ev) => queryClient.emitMutationEnqueue(ev),\n                emitSettle: (ev) => queryClient.emitMutationSettle(ev),\n              }\n            : undefined,\n        )\n        self.entries.push({ kind: 'cleanup', dispose: () => m.dispose() })\n        return m\n      },\n\n      emitter<T>(): Emitter<T> {\n        assertLive('emitter')\n        const e = createEmitter<T>({\n          // Spec §20.6: emit-time handler throws must not block sibling\n          // handlers. Route to the root's onError with kind: 'emitter' and\n          // this controller's path.\n          onError: (err) => {\n            dispatchError(self.rootShared.onError, err, {\n              kind: 'emitter',\n              controllerPath: self.path,\n            })\n          },\n        })\n        self.entries.push({ kind: 'cleanup', dispose: () => e.dispose() })\n        return e\n      },\n\n      signal,\n      computed,\n\n      field<T>(\n        initial: T,\n        validators?: ReadonlyArray<Validator<T>>,\n        options?: { validateOn?: 'change' | 'blur' | 'submit' },\n      ): Field<T> {\n        assertLive('field')\n        // Pass the reporter at construct time so the FIRST validator pass\n        // (which runs synchronously in the FieldImpl constructor's\n        // validator-effect) is covered.\n        const f = createField(initial, validators, {\n          onValidatorError: (err) => {\n            dispatchError(self.rootShared.onError, err, {\n              kind: 'effect',\n              controllerPath: self.path,\n            })\n          },\n          validateOn: options?.validateOn,\n        })\n        self.entries.push({ kind: 'cleanup', dispose: () => f.dispose() })\n        // Standalone fields (not inside a form) still publish field:validated\n        // events. Use the controller path with field name \"(field)\" — the\n        // devtools panel groups by path so this is fine.\n        bindFieldDevtoolsOwner(f, {\n          controllerPath: self.path,\n          fieldName: '(field)',\n          emitter: self.rootShared.devtools,\n        })\n        return f\n      },\n\n      form<S extends FormSchema>(schema: S, options?: FormOptions<S>): Form<S> {\n        assertLive('form')\n        const reporter = (err: unknown): void => {\n          dispatchError(self.rootShared.onError, err, {\n            kind: 'effect',\n            controllerPath: self.path,\n          })\n        }\n        const f = createForm(schema, options, { onValidatorError: reporter })\n        self.entries.push({ kind: 'cleanup', dispose: () => f.dispose() })\n        // Make every leaf field publish `field:validated` to the devtools bus\n        // with its key path inside the form. See spec §20.9.\n        const stop = bindTreeToDevtools(\n          f as unknown as Form<FormSchema>,\n          '',\n          self.path,\n          self.rootShared.devtools,\n        )\n        self.entries.push({ kind: 'cleanup', dispose: stop })\n        // Bind the reporter onto every leaf in the tree too (the form itself\n        // got it via the constructor option; nested forms/arrays inside the\n        // schema didn't, since they were constructed by the caller before\n        // ctx.form ran). Idempotent — leaves that already got the reporter\n        // via ctx.field get the same one set again.\n        bindTreeValidatorErrorReporter(f as unknown as Form<FormSchema>, reporter)\n        return f\n      },\n\n      fieldArray<I extends Field<any> | Form<any>>(\n        itemFactory: (initial?: ItemInitial<I>) => I,\n        options?: FieldArrayOptions<I>,\n      ): FieldArray<I> {\n        assertLive('fieldArray')\n        const reporter = (err: unknown): void => {\n          dispatchError(self.rootShared.onError, err, {\n            kind: 'effect',\n            controllerPath: self.path,\n          })\n        }\n        const fa = createFieldArray<I>(itemFactory, options, { onValidatorError: reporter })\n        self.entries.push({ kind: 'cleanup', dispose: () => fa.dispose() })\n        const stop = bindTreeToDevtools(\n          fa as unknown as FieldArray<Field<unknown> | Form<FormSchema>>,\n          '',\n          self.path,\n          self.rootShared.devtools,\n        )\n        self.entries.push({ kind: 'cleanup', dispose: stop })\n        bindTreeValidatorErrorReporter(\n          fa as unknown as FieldArray<Field<unknown> | Form<FormSchema>>,\n          reporter,\n        )\n        return fa\n      },\n\n      provide<T>(scope: Scope<T>, value: T): void {\n        if (self.scopes === null) self.scopes = new Map()\n        self.scopes.set(scope.__id, value)\n        // Invalidate every cached inject lookup tree-wide. A descendant\n        // that resolved this scope from a higher ancestor (or from a\n        // default) would now resolve to the new value, but its cache\n        // still holds the old value. Cheap: just bump the counter; cache\n        // entries check against it on next read.\n        self.rootShared.scopesVersion.value += 1\n      },\n\n      inject<T>(scope: Scope<T>): T {\n        const version = self.rootShared.scopesVersion.value\n        const cache = self.injectCache\n        if (cache !== null) {\n          const cached = cache.get(scope.__id)\n          if (cached !== undefined && cached.version === version) {\n            return cached.value as T\n          }\n        }\n        const ensureMemo = (): Map<symbol, { value: unknown; version: number }> => {\n          if (self.injectCache === null) self.injectCache = new Map()\n          return self.injectCache\n        }\n        let node: ControllerInstance | null = self\n        while (node !== null) {\n          const map = node.scopes\n          if (map?.has(scope.__id)) {\n            const value = map.get(scope.__id) as T\n            ensureMemo().set(scope.__id, { value, version })\n            return value\n          }\n          node = node.parent\n        }\n        if (scope.hasDefault) {\n          ensureMemo().set(scope.__id, { value: scope.default, version })\n          return scope.default as T\n        }\n        const label = scope.name ?? scope.__id.description ?? 'unnamed'\n        throw new Error(\n          `[olas] ctx.inject(): no provider for scope '${label}' and no default. Provide it on an ancestor via ctx.provide(${label}, ...) or pass a default to defineScope.`,\n        )\n      },\n\n      on<T>(emitter: Emitter<T>, handler: (value: T) => void): void {\n        assertLive('on')\n        const wrapped = (value: T) => {\n          try {\n            handler(value)\n          } catch (err) {\n            dispatchError(self.rootShared.onError, err, {\n              kind: 'emitter',\n              controllerPath: self.path,\n            })\n          }\n        }\n        const unsubscribe = emitter.on(wrapped)\n        self.entries.push({ kind: 'subscription', unsubscribe })\n      },\n\n      child<Props, Api>(\n        def: ControllerDef<Props, Api>,\n        props: Props,\n        options?: { deps?: Partial<Record<string, unknown>> },\n      ): Api {\n        assertLive('child')\n        const segment = self.makeChildSegment(getFactory(def), getName(def))\n        const override = options?.deps\n        const childDeps = override !== undefined ? { ...self.deps, ...override } : self.deps\n        const childInstance = new ControllerInstance(self, self.rootShared, segment, childDeps)\n        // child.construct() rolls back its own partial state on throw; we let\n        // the throw propagate so the parent's rollback handles cleanup.\n        const api = childInstance.construct(getFactory(def), props)\n        self.entries.push({ kind: 'child', instance: childInstance })\n        return api\n      },\n\n      attach<Props, Api>(\n        def: ControllerDef<Props, Api>,\n        props: Props,\n        options?: { deps?: Partial<Record<string, unknown>> },\n      ): { api: Api; dispose: () => void; suspend: () => void; resume: () => void } {\n        assertLive('attach')\n        const segment = self.makeChildSegment(getFactory(def), getName(def))\n        const override = options?.deps\n        const childDeps = override !== undefined ? { ...self.deps, ...override } : self.deps\n        const childInstance = new ControllerInstance(self, self.rootShared, segment, childDeps)\n        const api = childInstance.construct(getFactory(def), props)\n        const entry = {\n          kind: 'child' as const,\n          instance: childInstance,\n          explicitlySuspended: false,\n        }\n        const node = self.entries.push(entry)\n        let disposed = false\n        return {\n          api,\n          dispose: () => {\n            if (disposed) return\n            disposed = true\n            self.entries.unlink(node)\n            try {\n              childInstance.dispose()\n            } catch (err) {\n              dispatchError(self.rootShared.onError, err, {\n                kind: 'effect',\n                controllerPath: self.path,\n              })\n            }\n          },\n          // Suspend / resume cascade through the child instance's lifecycle\n          // entries (same code path as `root.suspend()`); the child's state\n          // machine handles the no-op cases (suspending a disposed child,\n          // resuming an active child) on its own — no need to track an\n          // extra flag here.\n          suspend: () => {\n            if (disposed) return\n            entry.explicitlySuspended = true\n            try {\n              childInstance.suspend()\n            } catch (err) {\n              dispatchError(self.rootShared.onError, err, {\n                kind: 'effect',\n                controllerPath: self.path,\n              })\n            }\n          },\n          resume: () => {\n            if (disposed) return\n            // Clear the explicit-suspend mark. Under a still-suspended parent,\n            // DON'T activate now — a child must not run inside a frozen tree; it\n            // rejoins the parent's next resume cascade (which no longer skips it\n            // now the mark is clear). (T2.6)\n            entry.explicitlySuspended = false\n            if (self.isSuspended()) return\n            try {\n              childInstance.resume()\n            } catch (err) {\n              dispatchError(self.rootShared.onError, err, {\n                kind: 'effect',\n                controllerPath: self.path,\n              })\n            }\n          },\n        }\n      },\n\n      session<Props, Api>(\n        def: ControllerDef<Props, Api>,\n        props: Props,\n        options?: { deps?: Partial<Record<string, unknown>> },\n      ): readonly [Api, () => void] {\n        assertLive('session')\n        const segment = self.makeChildSegment(getFactory(def), getName(def))\n        const override = options?.deps\n        const childDeps = override !== undefined ? { ...self.deps, ...override } : self.deps\n        const childInstance = new ControllerInstance(self, self.rootShared, segment, childDeps)\n        const api = childInstance.construct(getFactory(def), props)\n        const entry: LifecycleEntry = { kind: 'child', instance: childInstance }\n        const node = self.entries.push(entry)\n        let disposed = false\n        const dispose = (): void => {\n          if (disposed) return\n          disposed = true\n          self.entries.unlink(node)\n          try {\n            childInstance.dispose()\n          } catch (err) {\n            dispatchError(self.rootShared.onError, err, {\n              kind: 'effect',\n              controllerPath: self.path,\n            })\n          }\n        }\n        return [api, dispose] as const\n      },\n\n      collection<Item, K, Props, Api, R extends CollectionFactoryResult>(\n        options:\n          | CollectionHomogeneousOptions<Item, K, Props, Api>\n          | CollectionFactoryOptions<Item, K, R>,\n      ): Collection<K, Api> | Collection<K, CollectionFactoryApi<R>> {\n        assertLive('collection')\n        type ChildInfo = {\n          instance: ControllerInstance\n          api: Api\n          node: LifecycleNode\n          // For factory form: the controller def used to construct this child.\n          // A different def on a future render means \"rebuild with new type\".\n          def: ControllerDef<unknown, unknown>\n        }\n        const childMap = new Map<K, ChildInfo>()\n        const items$ = signal<ReadonlyArray<{ key: K; api: Api }>>([])\n        const size$ = computed(() => items$.value.length)\n\n        const isFactoryForm =\n          (options as CollectionFactoryOptions<Item, K, R>).factory !== undefined\n\n        const buildChild = (\n          item: Item,\n        ): {\n          instance: ControllerInstance\n          api: Api\n          def: ControllerDef<unknown, unknown>\n        } | null => {\n          let def: ControllerDef<unknown, unknown>\n          let childProps: unknown\n          if (isFactoryForm) {\n            const factoryOpts = options as CollectionFactoryOptions<Item, K, R>\n            const result = factoryOpts.factory(item) as CollectionFactoryResult\n            def = result.controller as ControllerDef<unknown, unknown>\n            childProps = result.props\n          } else {\n            const homoOpts = options as CollectionHomogeneousOptions<Item, K, Props, Api>\n            def = homoOpts.controller as unknown as ControllerDef<unknown, unknown>\n            childProps = homoOpts.propsOf(item)\n          }\n          const segment = self.makeChildSegment(getFactory(def), getName(def))\n          const childDeps =\n            options.deps !== undefined ? { ...self.deps, ...options.deps } : self.deps\n          const instance = new ControllerInstance(self, self.rootShared, segment, childDeps)\n          try {\n            const api = instance.construct(\n              getFactory(def) as (ctx: Ctx, props: unknown) => Api,\n              childProps,\n            )\n            return { instance, api, def }\n          } catch (err) {\n            // SPEC §12.1.6: runtime construction errors in collection items\n            // route to onError; the bad item is skipped.\n            dispatchError(self.rootShared.onError, err, {\n              kind: 'construction',\n              controllerPath: self.path,\n            })\n            return null\n          }\n        }\n\n        const removeKey = (key: K): void => {\n          const info = childMap.get(key)\n          if (info === undefined) return\n          childMap.delete(key)\n          self.entries.unlink(info.node)\n          try {\n            info.instance.dispose()\n          } catch (err) {\n            dispatchError(self.rootShared.onError, err, {\n              kind: 'effect',\n              controllerPath: self.path,\n            })\n          }\n        }\n\n        const reconcile = (): void => {\n          // Only `source` is a tracked dependency — everything else (keyOf, the\n          // item factory, child construct/dispose) runs untracked so a child\n          // factory reading an unrelated signal can't force the whole\n          // collection to re-reconcile on every write to it (T2.3). Mirrors the\n          // untracked bind in ctx.use.\n          const source = options.source.value\n          untracked(() => {\n            const itemByKey = new Map<K, Item>()\n            for (const item of source) {\n              const key = options.keyOf(item)\n              if (itemByKey.has(key)) {\n                if (__DEV__) {\n                  // eslint-disable-next-line no-console\n                  console.warn(\n                    `[olas] ctx.collection: duplicate key ${String(key)} in source — only the` +\n                      ' first occurrence is kept. This is usually a bug in `keyOf(item)`;' +\n                      ' return a unique identifier per item.',\n                  )\n                }\n                continue\n              }\n              itemByKey.set(key, item)\n            }\n\n            // Drop removed keys.\n            for (const key of [...childMap.keys()]) {\n              if (!itemByKey.has(key)) removeKey(key)\n            }\n\n            // Add new keys + rebuild factory-form type changes.\n            for (const [key, item] of itemByKey) {\n              const existing = childMap.get(key)\n              if (existing !== undefined) {\n                if (isFactoryForm) {\n                  const result = (options as CollectionFactoryOptions<Item, K, R>).factory(\n                    item,\n                  ) as CollectionFactoryResult\n                  if ((result.controller as unknown) !== existing.def) {\n                    removeKey(key)\n                    const built = buildChild(item)\n                    if (built !== null) {\n                      const entry: LifecycleEntry = { kind: 'child', instance: built.instance }\n                      const node = self.entries.push(entry)\n                      childMap.set(key, { ...built, node })\n                    }\n                  }\n                }\n                continue\n              }\n              const built = buildChild(item)\n              if (built !== null) {\n                const entry: LifecycleEntry = { kind: 'child', instance: built.instance }\n                const node = self.entries.push(entry)\n                childMap.set(key, { ...built, node })\n              }\n            }\n\n            // Project to items signal in source order, deduped, skipping failures.\n            const next: Array<{ key: K; api: Api }> = []\n            const seen = new Set<K>()\n            for (const item of source) {\n              const key = options.keyOf(item)\n              if (seen.has(key)) continue\n              seen.add(key)\n              const info = childMap.get(key)\n              if (info !== undefined) next.push({ key, api: info.api })\n            }\n            items$.set(next)\n          })\n        }\n\n        // Register the diff loop as an 'effect' entry so it pauses on suspend\n        // and re-runs on resume — mirrors how `ctx.effect` is wired.\n        const wrapped = (): void => {\n          try {\n            reconcile()\n          } catch (err) {\n            dispatchError(self.rootShared.onError, err, {\n              kind: 'effect',\n              controllerPath: self.path,\n            })\n          }\n        }\n        const effectEntry: LifecycleEntry = {\n          kind: 'effect',\n          factory: wrapped,\n          dispose: null,\n        }\n        if (self.state !== 'suspended') {\n          effectEntry.dispose = standaloneEffect(wrapped)\n        }\n        self.entries.push(effectEntry)\n\n        return {\n          // readOnly so the writable backing signals can't be mutated through\n          // the ReadSignal-typed public surface. (T2.8)\n          items: readOnly(items$),\n          size: readOnly(size$),\n          get: (key: K) => childMap.get(key)?.api,\n          has: (key: K) => childMap.has(key),\n          suspendItem: (key: K) => {\n            const info = childMap.get(key)\n            if (info === undefined) return\n            // Mark the child entry so a whole-tree resume cascade skips it. (T2.6)\n            if (info.node.entry.kind === 'child') info.node.entry.explicitlySuspended = true\n            info.instance.suspend()\n          },\n          resumeItem: (key: K) => {\n            const info = childMap.get(key)\n            if (info === undefined) return\n            if (info.node.entry.kind === 'child') info.node.entry.explicitlySuspended = false\n            // Under a suspended parent, defer to the parent's next resume\n            // cascade (which no longer skips the cleared entry). (T2.6)\n            if (self.isSuspended()) return\n            info.instance.resume()\n          },\n          isItemSuspended: (key: K) => {\n            const info = childMap.get(key)\n            if (info === undefined) return false\n            return info.instance.isSuspended()\n          },\n        }\n      },\n\n      lazyChild<Props, Api>(\n        loader: () => Promise<ControllerDef<Props, Api>>,\n        props: Props,\n        options?: { deps?: Partial<Record<string, unknown>> },\n      ): LazyChild<Api> {\n        assertLive('lazyChild')\n        const status$ = signal<'idle' | 'loading' | 'ready' | 'error'>('idle')\n        const api$ = signal<Api | undefined>(undefined)\n        const error$ = signal<unknown | undefined>(undefined)\n\n        let childInstance: ControllerInstance | null = null\n        let childNode: LifecycleNode | null = null\n        let pendingLoad: Promise<Api> | null = null\n        let disposed = false\n\n        // Parent dispose flag; the child entry (when present) is disposed\n        // via the parent's normal cascade, so we don't double-tear-down.\n        const flagEntry: LifecycleEntry = {\n          kind: 'onDispose',\n          fn: () => {\n            disposed = true\n          },\n        }\n        const flagNode = self.entries.push(flagEntry)\n\n        const handleFailure = (err: unknown): void => {\n          status$.set('error')\n          error$.set(err)\n          dispatchError(self.rootShared.onError, err, {\n            kind: 'construction',\n            controllerPath: self.path,\n          })\n        }\n\n        const load = (): Promise<Api> => {\n          if (disposed) {\n            return Promise.reject(new Error('[olas] ctx.lazyChild: cannot load after dispose'))\n          }\n          // Cached fulfilled or in-flight loads share a promise. A previously\n          // *rejected* load doesn't — we clear `pendingLoad` in the catch\n          // branch so the next `load()` reattempts the loader. Sticky\n          // rejections trap consumers on a transient import-failure.\n          if (pendingLoad !== null) return pendingLoad\n          status$.set('loading')\n          const attempt = loader().then(\n            (def) => {\n              if (disposed) {\n                throw new Error('[olas] ctx.lazyChild: disposed during load')\n              }\n              const segment = self.makeChildSegment(getFactory(def), getName(def))\n              const childDeps =\n                options?.deps !== undefined ? { ...self.deps, ...options.deps } : self.deps\n              const instance = new ControllerInstance(self, self.rootShared, segment, childDeps)\n              try {\n                const api = instance.construct(getFactory(def), props)\n                childInstance = instance\n                childNode = self.entries.push({ kind: 'child', instance })\n                api$.set(api)\n                status$.set('ready')\n                return api\n              } catch (err) {\n                handleFailure(err)\n                throw err\n              }\n            },\n            (err) => {\n              if (disposed) throw err\n              handleFailure(err)\n              throw err\n            },\n          )\n          pendingLoad = attempt\n          attempt.catch(() => {\n            // Allow retry: drop the cached rejection if this is still the\n            // current attempt. A successful load leaves `pendingLoad` in\n            // place so repeat `load()` calls return the same fulfilled api.\n            if (pendingLoad === attempt) pendingLoad = null\n          })\n          return attempt\n        }\n\n        const dispose = (): void => {\n          if (disposed) return\n          disposed = true\n          if (childNode !== null && childInstance !== null) {\n            self.entries.unlink(childNode)\n            try {\n              childInstance.dispose()\n            } catch (err) {\n              dispatchError(self.rootShared.onError, err, {\n                kind: 'effect',\n                controllerPath: self.path,\n              })\n            }\n            childInstance = null\n            childNode = null\n          }\n          // Unlink the parent-dispose flag entry too — its only job was to\n          // signal disposal to an in-flight loader, and `disposed` is now\n          // already true. Leaving it behind leaks one closure per ever-\n          // disposed lazyChild for the parent's remaining lifetime.\n          self.entries.unlink(flagNode)\n        }\n\n        return {\n          status: readOnly(status$),\n          api: readOnly(api$),\n          error: readOnly(error$),\n          load,\n          dispose,\n        }\n      },\n\n      onDispose(fn) {\n        assertLive('onDispose')\n        self.entries.push({\n          kind: 'onDispose',\n          fn: () => {\n            try {\n              fn()\n            } catch (err) {\n              dispatchError(self.rootShared.onError, err, {\n                kind: 'effect',\n                controllerPath: self.path,\n              })\n            }\n          },\n        })\n      },\n\n      onSuspend(fn) {\n        assertLive('onSuspend')\n        self.entries.push({\n          kind: 'onSuspend',\n          fn: () => {\n            try {\n              fn()\n            } catch (err) {\n              dispatchError(self.rootShared.onError, err, {\n                kind: 'effect',\n                controllerPath: self.path,\n              })\n            }\n          },\n        })\n      },\n\n      onResume(fn) {\n        assertLive('onResume')\n        self.entries.push({\n          kind: 'onResume',\n          fn: () => {\n            try {\n              fn()\n            } catch (err) {\n              dispatchError(self.rootShared.onError, err, {\n                kind: 'effect',\n                controllerPath: self.path,\n              })\n            }\n          },\n        })\n      },\n    }\n    return ctx\n  }\n\n  private isTerminal(): boolean {\n    return this.state === 'disposed'\n  }\n\n  // biome-ignore lint/complexity/noBannedTypes: Function is the precise type for \"any function with a .name\"\n  private makeChildSegment(factory: Function, explicitName: string | undefined): string {\n    const idx = this.childCounter++\n    const base = explicitName ?? factory.name ?? ''\n    return `${base !== '' ? base : 'anonymous'}[${idx}]`\n  }\n}\n","import { DevtoolsEmitter } from '../devtools'\nimport { QueryClient } from '../query/client'\nimport { getFactory } from './define'\nimport { ControllerInstance, type RootShared } from './instance'\nimport type { AmbientDeps, ControllerDef, Root, RootOptions } from './types'\n\nconst ROOT_METHODS = [\n  'dispose',\n  'suspend',\n  'resume',\n  'dehydrate',\n  'waitForIdle',\n  'applyDehydratedEntry',\n  '__debug',\n] as const\n\n/**\n * Construct a root controller.\n *\n * Internal: this is the shared engine. The public `createRoot` (props-less)\n * and `createTestController` (props-allowing) both call through here.\n */\nexport function createRootWithProps<Props, Api, TDeps extends Record<string, unknown>>(\n  def: ControllerDef<Props, Api>,\n  props: Props,\n  options: RootOptions<TDeps>,\n): Root<Api> {\n  const devtools = new DevtoolsEmitter()\n  const queryClient = new QueryClient({\n    onError: options.onError,\n    hydrate: options.hydrate,\n    devtools,\n    deps: options.deps as Record<string, unknown>,\n    refetchOnWindowFocus: options.refetchOnWindowFocus,\n    refetchOnReconnect: options.refetchOnReconnect,\n    plugins: options.plugins,\n  })\n  const rootShared: RootShared = {\n    devtools,\n    onError: options.onError,\n    queryClient,\n    scopesVersion: { value: 0 },\n  }\n\n  const instance = new ControllerInstance(\n    null,\n    rootShared,\n    'root',\n    options.deps as Record<string, unknown>,\n  )\n\n  // Pre-seed scopes from RootOptions before the factory runs so\n  // ctx.inject() resolves them from any descendant. SPEC §10.3.\n  if (options.scopes !== undefined && options.scopes.length > 0) {\n    instance.seedScopes(options.scopes)\n  }\n\n  // Bootstrap failure throws straight out of createRoot. Spec §12.1.5.\n  // Tear down the QueryClient and any plugins it spawned (window/storage\n  // listeners, transports) before re-throwing so the failure doesn't leak.\n  let api: Api\n  try {\n    api = instance.construct(getFactory(def), props)\n  } catch (err) {\n    queryClient.dispose()\n    throw err\n  }\n\n  // Non-object apis get wrapped so root controls have somewhere to live.\n  let target = api\n  if (typeof api !== 'object' || api === null) {\n    // Allow primitive APIs in principle but root controls must live somewhere.\n    // Wrap in a holder. The declared `Root<Api>` type intersection lies in\n    // this branch — `(holder as Api).dispose` won't be present on the\n    // primitive itself. Dev-warn so the footgun is visible at first run\n    // instead of as a confusing \"undefined.value\" later.\n    if (__DEV__) {\n      // eslint-disable-next-line no-console\n      console.warn(\n        '[olas] createRoot: controller returned a non-object api ' +\n          `(${api === null ? 'null' : typeof api}). ` +\n          'Wrapping as { value: api } so root controls (dispose / suspend / ...) ' +\n          \"can be attached. Prefer returning an object from a root controller's factory.\",\n      )\n    }\n    target = { value: api } as unknown as Api\n  }\n\n  // attachRootControls throws on a root-controls NAME CONFLICT (the api defines\n  // `dispose`/`suspend`/...) — AFTER the tree is fully constructed. Tear down\n  // the live instance + queryClient (effects, focus/online listeners, plugin\n  // transports) before rethrowing so the conflict doesn't leak the whole tree.\n  // The construct-throw path above rolls back via queryClient.dispose(); this\n  // is the symmetric guard for the post-construction failure. (T2.5)\n  try {\n    return attachRootControls(target, instance, devtools, queryClient)\n  } catch (err) {\n    instance.dispose()\n    queryClient.dispose()\n    throw err\n  }\n}\n\nfunction attachRootControls<Api>(\n  api: Api,\n  instance: ControllerInstance,\n  devtools: DevtoolsEmitter,\n  queryClient: QueryClient,\n): Root<Api> {\n  let suspendTimer: ReturnType<typeof setTimeout> | null = null\n\n  const dispose = () => {\n    if (suspendTimer != null) {\n      clearTimeout(suspendTimer)\n      suspendTimer = null\n    }\n    instance.dispose()\n    queryClient.dispose()\n  }\n\n  const suspend = (opts?: { maxIdle?: number }) => {\n    instance.suspend()\n    if (suspendTimer != null) {\n      clearTimeout(suspendTimer)\n      suspendTimer = null\n    }\n    const maxIdle = opts?.maxIdle\n    if (maxIdle != null && maxIdle !== Number.POSITIVE_INFINITY) {\n      suspendTimer = setTimeout(() => {\n        suspendTimer = null\n        dispose()\n      }, maxIdle)\n    }\n  }\n\n  const resume = () => {\n    if (suspendTimer != null) {\n      clearTimeout(suspendTimer)\n      suspendTimer = null\n    }\n    instance.resume()\n  }\n\n  const debug = {\n    subscribe: (handler: Parameters<DevtoolsEmitter['subscribe']>[0]) =>\n      devtools.subscribe(handler),\n    queryEntries: () => queryClient.queryEntriesSnapshot(),\n  }\n\n  const target = api as Record<string, unknown>\n  for (const method of ROOT_METHODS) {\n    // Use `in` rather than `Object.hasOwn` so class-based apis with\n    // prototype methods like `dispose()` still trigger the conflict\n    // detection instead of being silently overwritten by defineProperty.\n    if (method in target) {\n      throw new Error(\n        `[olas] Root controller api defines '${method}' which conflicts with the root controls.`,\n      )\n    }\n  }\n  // Lock root controls: writable:false + configurable:false so user code\n  // can't `delete api.dispose` (orphaning the root) or shadow them with a\n  // typo. The `in`-check above is the friendly preflight; this is the\n  // hard fence in case a consumer mutates the api after construction.\n  const lock = { enumerable: false, writable: false, configurable: false }\n  Object.defineProperty(target, 'dispose', { value: dispose, ...lock })\n  Object.defineProperty(target, 'suspend', { value: suspend, ...lock })\n  Object.defineProperty(target, 'resume', { value: resume, ...lock })\n  Object.defineProperty(target, '__debug', { value: debug, ...lock })\n  Object.defineProperty(target, 'dehydrate', {\n    value: () => queryClient.dehydrate(),\n    ...lock,\n  })\n  Object.defineProperty(target, 'waitForIdle', {\n    value: () => queryClient.waitForIdle(),\n    ...lock,\n  })\n  Object.defineProperty(target, 'applyDehydratedEntry', {\n    value: (queryId: string, keyArgs: readonly unknown[], data: unknown, lastUpdatedAt: number) =>\n      queryClient.applyDehydratedEntry(queryId, keyArgs, data, lastUpdatedAt),\n    ...lock,\n  })\n\n  return api as Root<Api>\n}\n\n/**\n * Construct a root controller. Root factories take no props — startup config\n * goes in `deps`.\n */\nexport function createRoot<Api extends object, TDeps extends Record<string, unknown> = AmbientDeps>(\n  def: ControllerDef<void, Api>,\n  options: RootOptions<TDeps>,\n): Root<Api> {\n  return createRootWithProps<void, Api, TDeps>(def, undefined as void, options)\n}\n"],"mappings":";;;;;;;;;AA2BA,SAAgB,iBACd,SACA,SAC2B;CAM3B,OAAO;EAJL,QAAQ;EACR,WAAW;EACX,GAAI,SAAS,SAAS,KAAA,IAAY,EAAE,QAAQ,QAAQ,KAAK,IAAI,CAAC;CAEvD;AACX;;AAGA,SAAgB,WACd,KACiC;CACjC,OAAQ,IAA0C;AACpD;;AAGA,SAAgB,QAAoB,KAAoD;CACtF,OAAQ,IAA0C;AACpD;;;AC0BA,SAAS,QAAQ,MAAiC;CAChD,OAAO,KAAK,KAAK,IAAG;AACtB;;;;;;;;;;;;;AAcA,IAAa,kBAAb,MAA6B;CAC3B,2BAAmB,IAAI,IAAiC;;CAExD,kCAA0B,IAAI,IAAiC;CAE/D,UAAU,SAAkD;EAK1D,KAAK,MAAM,SAAS,KAAK,gBAAgB,OAAO,GAC9C,IAAI;GACF,QAAQ;IACN,MAAM;IACN,MAAM,MAAM;IACZ,OAAO,MAAM;GACf,CAAC;GACD,IAAI,MAAM,UAAU,aAClB,QAAQ;IAAE,MAAM;IAAwB,MAAM,MAAM;GAAK,CAAC;EAE9D,QAAQ,CAER;EAEF,KAAK,SAAS,IAAI,OAAO;EACzB,aAAa;GACX,KAAK,SAAS,OAAO,OAAO;EAC9B;CACF;CAEA,KAAK,OAAyB;EAG5B,KAAK,gBAAgB,KAAK;EAC1B,IAAI,KAAK,SAAS,SAAS,GAAG;EAE9B,MAAM,WAAW,MAAM,KAAK,KAAK,QAAQ;EACzC,KAAK,MAAM,WAAW,UACpB,IAAI;GACF,QAAQ,KAAK;EACf,QAAQ,CAER;CAEJ;CAEA,IAAI,iBAA0B;EAC5B,OAAO,KAAK,SAAS,OAAO;CAC9B;CAEA,gBAAwB,OAAyB;EAC/C,IAAI,MAAM,SAAS,0BAA0B;GAC3C,KAAK,gBAAgB,IAAI,QAAQ,MAAM,IAAI,GAAG;IAC5C,MAAM,MAAM;IACZ,OAAO,MAAM;IACb,OAAO;GACT,CAAC;GACD;EACF;EACA,IAAI,MAAM,SAAS,wBAAwB;GACzC,MAAM,MAAM,QAAQ,MAAM,IAAI;GAC9B,MAAM,MAAM,KAAK,gBAAgB,IAAI,GAAG;GACxC,IAAI,QAAQ,KAAA,GAAW,IAAI,QAAQ;GACnC;EACF;EACA,IAAI,MAAM,SAAS,sBAAsB;GACvC,MAAM,MAAM,QAAQ,MAAM,IAAI;GAC9B,MAAM,MAAM,KAAK,gBAAgB,IAAI,GAAG;GACxC,IAAI,QAAQ,KAAA,GAAW,IAAI,QAAQ;GACnC;EACF;EACA,IAAI,MAAM,SAAS,uBAAuB;GACxC,KAAK,gBAAgB,OAAO,QAAQ,MAAM,IAAI,CAAC;GAC/C;EACF;CACF;AACF;;;ACjIA,MAAM,kBAAgC,KAAK,YAAY;CAErD,QAAQ,MAAM,UAAU,SAAS,GAAG;AACtC;AAEA,IAAI,eAAe;AACnB,SAAS,cAAsB;CAI7B,eAAgB,eAAe,MAAO;CAGtC,OAAO,MAFK,KAAK,OAAO,IAAI,WAAa,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAEzD,IADF,aAAa,SAAS,EAAE,EAAE,SAAS,GAAG,GAChC;AAClB;;;;;;;;AASA,SAAgB,cACd,SACA,KACA,SACM;CACN,MAAM,KAAK,WAAW;CACtB,MAAM,OAAqB;EACzB,GAAG;EACH,SAAS,YAAY;EACrB,WAAW,KAAK,IAAI;CACtB;CACA,IAAI;EACF,GAAG,KAAK,IAAI;CACd,SAAS,YAAY;EACnB,IAAI;GAEF,QAAQ,MAAM,iCAAiC,UAAU;GAEzD,QAAQ,MAAM,0BAA0B,KAAK,IAAI;EACnD,QAAQ,CAER;CACF;AACF;;;;;;;;;;AC3EA,SAAgB,SAAY,QAAsC;CAChE,OAAO,OAAO,OAAO;EACnB,IAAI,QAAQ;GACV,OAAO,OAAO;EAChB;EACA,OAAO;GACL,OAAO,OAAO,KAAK;EACrB;EACA,UAAU,SAA6B;GACrC,OAAO,OAAO,UAAU,OAAO;EACjC;EACA,iBAAiB,SAA6B;GAC5C,OAAO,OAAO,iBAAiB,OAAO;EACxC;CACF,CAAC;AACH;;;ACZA,IAAM,aAAN,MAAyC;CACvC;CAEA,YAAY,SAAY;EACtB,KAAK,SAAA,GAAA,qBAAA,QAAmB,OAAO;CACjC;CAEA,IAAI,QAAW;EACb,OAAO,KAAK,MAAM;CACpB;CAEA,IAAI,MAAM,MAAS;EACjB,KAAK,MAAM,QAAQ;CACrB;CAEA,OAAU;EACR,OAAO,KAAK,MAAM,KAAK;CACzB;CAEA,UAAU,SAAyC;EACjD,OAAO,KAAK,MAAM,UAAU,OAAO;CACrC;CAEA,iBAAiB,SAAyC;EACxD,OAAO,qBAAqB,KAAK,OAAO,OAAO;CACjD;CAEA,IAAI,OAAgB;EAClB,KAAK,MAAM,QAAQ;CACrB;CAEA,OAAO,IAA0B;EAC/B,KAAK,MAAM,QAAQ,GAAG,KAAK,MAAM,KAAK,CAAC;CACzC;AACF;AAEA,IAAM,eAAN,MAA6C;CAC3C;CAEA,YAAY,IAAa;EACvB,KAAK,SAAA,GAAA,qBAAA,UAAqB,EAAE;CAC9B;CAEA,IAAI,QAAW;EACb,OAAO,KAAK,MAAM;CACpB;CAEA,OAAU;EACR,OAAO,KAAK,MAAM,KAAK;CACzB;CAEA,UAAU,SAAyC;EACjD,OAAO,KAAK,MAAM,UAAU,OAAO;CACrC;CAEA,iBAAiB,SAAyC;EACxD,OAAO,qBAAqB,KAAK,OAAO,OAAO;CACjD;AACF;;;;;;AAOA,SAAS,qBACP,OACA,SACY;CACZ,IAAI,UAAU;CACd,OAAO,MAAM,WAAW,UAAU;EAChC,IAAI,SAAS;GACX,UAAU;GACV;EACF;EACA,QAAQ,KAAK;CACf,CAAC;AACH;;;;;;;AAQA,SAAgB,OAAU,SAAuB;CAC/C,OAAO,IAAI,WAAW,OAAO;AAC/B;;;;;;;;;AAUA,SAAgB,SAAY,IAA0B;CACpD,OAAO,IAAI,aAAa,EAAE;AAC5B;;;;;;;;;AAUA,SAAgB,OAAO,IAA2C;CAChE,QAAA,GAAA,qBAAA,QAAe,EAAE;AACnB;;;;;AAMA,SAAgB,MAAS,IAAgB;CACvC,QAAA,GAAA,qBAAA,OAAc,EAAE;AAClB;;;;;;;AAQA,SAAgB,UAAa,IAAgB;CAC3C,QAAA,GAAA,qBAAA,WAAkB,EAAE;AACtB;;;;;;;;;;;ACrIA,SAAgB,aAAa,KAAuB;CAClD,IAAI,OAAO,iBAAiB,eAAe,eAAe,cACxD,OAAO,IAAI,SAAS;CAEtB,IAAI,OAAO,QAAQ,OAAO,QAAQ,YAAY,UAAU,KACtD,OAAQ,IAA0B,SAAS;CAE7C,OAAO;AACT;;;;;;AAOA,SAAgB,eAAe,IAAY,QAAoC;CAC7E,OAAO,IAAI,SAAS,SAAS,WAAW;EACtC,IAAI,OAAO,SAAS;GAClB,OAAO,YAAY,MAAM,CAAC;GAC1B;EACF;EACA,MAAM,QAAQ,iBAAiB;GAC7B,OAAO,oBAAoB,SAAS,OAAO;GAC3C,QAAQ;EACV,GAAG,EAAE;EACL,MAAM,gBAAgB;GACpB,aAAa,KAAK;GAClB,OAAO,oBAAoB,SAAS,OAAO;GAC3C,OAAO,YAAY,MAAM,CAAC;EAC5B;EACA,OAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;CAC1D,CAAC;AACH;;;;;;;;AASA,SAAS,YAAY,QAA8B;CACjD,MAAM,SAAmB,OAAgC;CACzD,IAAI,WAAW,KAAA,GAAW,OAAO;CACjC,OAAO,IAAI,aAAa,WAAW,YAAY;AACjD;;;ACxCA,MAAM,4BAAY,IAAI,IAAS;AAC/B,MAAM,6BAAa,IAAI,IAAS;AAEhC,SAAS,YAAkB;CACzB,KAAK,MAAM,MAAM,WACf,IAAI;EACF,GAAG;CACL,QAAQ,CAER;AAEJ;AAEA,SAAS,aAAmB;CAC1B,KAAK,MAAM,MAAM,YACf,IAAI;EACF,GAAG;CACL,QAAQ,CAER;AAEJ;AAKA,IAAI,iBAAiB;AACrB,SAAS,gBAAsB;CAC7B,IAAI,gBAAgB;CACpB,iBAAiB;CACjB,qBAAqB;EACnB,iBAAiB;EACjB,UAAU;CACZ,CAAC;AACH;AAEA,SAAS,qBAA2B;CAClC,IAAI,SAAS,oBAAoB,WAAW,cAAc;AAC5D;AAEA,IAAI,iBAAiB;AACrB,IAAI,kBAAkB;AAEtB,SAAS,eAAqB;CAC5B,IAAI,gBAAgB;CACpB,IAAI,OAAO,WAAW,aAAa;CACnC,OAAO,iBAAiB,SAAS,aAAa;CAC9C,IAAI,OAAO,aAAa,aACtB,SAAS,iBAAiB,oBAAoB,kBAAkB;CAElE,iBAAiB;AACnB;AAEA,SAAS,iBAAuB;CAC9B,IAAI,CAAC,gBAAgB;CACrB,IAAI,OAAO,WAAW,aAAa;CACnC,OAAO,oBAAoB,SAAS,aAAa;CACjD,IAAI,OAAO,aAAa,aACtB,SAAS,oBAAoB,oBAAoB,kBAAkB;CAErE,iBAAiB;AACnB;AAEA,SAAS,gBAAsB;CAC7B,IAAI,iBAAiB;CACrB,IAAI,OAAO,WAAW,aAAa;CACnC,OAAO,iBAAiB,UAAU,UAAU;CAC5C,kBAAkB;AACpB;AAEA,SAAS,kBAAwB;CAC/B,IAAI,CAAC,iBAAiB;CACtB,IAAI,OAAO,WAAW,aAAa;CACnC,OAAO,oBAAoB,UAAU,UAAU;CAC/C,kBAAkB;AACpB;AAEA,SAAgB,qBAAqB,IAAqB;CACxD,aAAa;CACb,UAAU,IAAI,EAAE;CAChB,aAAa;EACX,UAAU,OAAO,EAAE;EACnB,IAAI,UAAU,SAAS,GAAG,eAAe;CAC3C;AACF;AAEA,SAAgB,mBAAmB,IAAqB;CACtD,cAAc;CACd,WAAW,IAAI,EAAE;CACjB,aAAa;EACX,WAAW,OAAO,EAAE;EACpB,IAAI,WAAW,SAAS,GAAG,gBAAgB;CAC7C;AACF;;;;;;;;;;;;;;;;;;;;;;ACvFA,SAAgB,gBAAmB,MAAS,MAAY;CAEtD,IAAI,OAAO,GAAG,MAAM,IAAI,GAAG,OAAO;CAClC,OAAO,KAAK,MAAM,sBAAM,IAAI,QAAgB,CAAC;AAC/C;AAEA,SAAS,KAAK,MAAe,MAAe,MAAgC;CAC1E,IAAI,OAAO,GAAG,MAAM,IAAI,GAAG,OAAO;CAClC,IAAI,SAAS,QAAQ,SAAS,MAAM,OAAO;CAC3C,IAAI,OAAO,SAAS,YAAY,OAAO,SAAS,UAAU,OAAO;CAKjE,IAAI,KAAK,IAAI,IAAc,KAAK,KAAK,IAAI,IAAc,GAAG,OAAO;CAGjE,IAAI,MAAM,QAAQ,IAAI,KAAK,MAAM,QAAQ,IAAI,GAC3C,OAAO,UAAU,MAAM,MAAM,IAAI;CAEnC,IAAI,MAAM,QAAQ,IAAI,MAAM,MAAM,QAAQ,IAAI,GAAG,OAAO;CAMxD,MAAM,YAAY,OAAO,eAAe,IAAI;CAC5C,IAAI,cAAc,OAAO,eAAe,IAAI,GAAG,OAAO;CACtD,IAAI,cAAc,OAAO,aAAa,cAAc,MAAM,OAAO;CAEjE,OAAO,gBAAgB,MAAiC,MAAiC,IAAI;AAC/F;AAEA,SAAS,UACP,MACA,MACA,MACwB;CACxB,IAAI,KAAK,WAAW,KAAK,QAAQ,CAKjC;CACA,KAAK,IAAI,IAAI;CACb,KAAK,IAAI,IAAI;CACb,IAAI;EACF,MAAM,MAAiB,IAAI,MAAM,KAAK,MAAM;EAC5C,IAAI,UAAU,KAAK,WAAW,KAAK;EACnC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;GAEpC,MAAM,SAAS,KADE,IAAI,KAAK,SAAS,KAAK,KAAK,KAAA,GACf,KAAK,IAAI,IAAI;GAC3C,IAAI,KAAK;GACT,IAAI,WAAW,KAAK,IAAI,UAAU;EACpC;EACA,IAAI,CAAC,SAAS,OAAO;EACrB,OAAO;CACT,UAAU;EACR,KAAK,OAAO,IAAI;EAChB,KAAK,OAAO,IAAI;CAClB;AACF;AAEA,SAAS,gBACP,MACA,MACA,MACyB;CACzB,MAAM,WAAW,OAAO,KAAK,IAAI;CACjC,MAAM,WAAW,OAAO,KAAK,IAAI;CACjC,IAAI,UAAU,SAAS,WAAW,SAAS;CAE3C,KAAK,IAAI,IAAI;CACb,KAAK,IAAI,IAAI;CACb,IAAI;EACF,MAAM,MAA+B,CAAC;EAItC,KAAK,MAAM,OAAO,UAAU;GAC1B,MAAM,SAAS,KAAK,KAAK,MAAM,KAAK,MAAM,IAAI;GAC9C,IAAI,OAAO;GACX,IAAI,WAAW,KAAK,MAAM,UAAU;QAC/B,IAAI,EAAE,OAAO,OAAO,UAAU;EACrC;EAIA,IAAI,CAAC,SAAS,OAAO;EACrB,OAAO;CACT,UAAU;EACR,KAAK,OAAO,IAAI;EAChB,KAAK,OAAO,IAAI;CAClB;AACF;;;;;;;;;AC9DA,IAAa,QAAb,MAAsB;CACpB;CACA,QAA8C,OAAO,KAAA,CAAS;CAC9D;CACA,YAAsC,OAAO,KAAK;CAClD,aAAuC,OAAO,KAAK;CACnD;CACA,sBAAgD,OAAO,KAAK;CAC5D,UAAoC,OAAO,IAAI;;;CAG/C,WAAqC,OAAO,KAAK;CAEjD;CACA;CACA;CACA;CACA;CACA;CACA,iBAAyB;CACzB,eAA+C;CAC/C,aAA2D;;;CAG3D,cAAsB;CACtB,YAA8C,CAAC;CAC/C,iBAAyB;CACzB,WAAmB;;CAEnB,iBAA8C;;;;;;;CAO9C,oBAGK,CAAC;CACN;CAGA;CACA,iBAAyB;;;;;;CAMzB,2BAAkE,CAAC;CAEnE,YAAY,SAA0B;EACpC,KAAK,kBAAkB,QAAQ;EAC/B,KAAK,YAAY,QAAQ,aAAa;EACtC,KAAK,QAAQ,QAAQ,SAAS;EAG9B,KAAK,aAAa,QAAQ;EAC1B,KAAK,cAAc,QAAQ,eAAe;EAC1C,KAAK,yBAAyB,QAAQ,mBAAmB;EACzD,KAAK,SAAS,QAAQ,UAAU,CAAC;EACjC,KAAK,gBAAgB,QAAQ;EAC7B,KAAK,OAAO,OAAsB,QAAQ,WAAW;EACrD,IAAI,QAAQ,gBAAgB,KAAA,GAAW;GACrC,KAAK,SAAS,OAAoB,SAAS;GAM3C,IAAI,KAAK,cAAc,GACrB,KAAK,QAAQ,IAAI,IAAI;QAChB;IACL,MAAM,OAAO,QAAQ;IACrB,MAAM,eAAe,SAAS,KAAA,KAAa,KAAK,IAAI,IAAI,QAAQ,KAAK;IACrE,KAAK,QAAQ,IAAI,YAAY;IAG7B,IAAI,CAAC,cAAc;KACjB,MAAM,YAAY,KAAK,aAAa,KAAK,IAAI,IAAK;KAClD,KAAK,aAAa,iBAAiB;MACjC,KAAK,aAAa;MAClB,IAAI,CAAC,KAAK,UAAU,KAAK,QAAQ,IAAI,IAAI;KAC3C,GAAG,SAAS;IACd;GACF;EACF,OACE,KAAK,SAAS,OAAoB,MAAM;EAE1C,KAAK,gBAAgB,OAA2B,QAAQ,gBAAgB;CAC1E;CAEA,aAAyB;EACvB,IAAI,KAAK,UACP,OAAO,QAAQ,uBAAO,IAAI,MAAM,gBAAgB,CAAC;EAMnD,IAAI,KAAK,gBAAgB,YAAY,KAAK,UAAU,GAClD,OAAO,KAAK,sBAAsB;EAEpC,MAAM,OAAO,EAAE,KAAK;EACpB,KAAK,cAAc,MAAM;EACzB,MAAM,QAAQ,IAAI,gBAAgB;EAClC,KAAK,eAAe;EAEpB,MAAM,oBAAoB,KAAK,KAAK,KAAK,MAAM,KAAA;EAC/C,YAAY;GACV,KAAK,OAAO,IAAI,SAAS;GACzB,KAAK,WAAW,IAAI,IAAI;GACxB,KAAK,UAAU,IAAI,CAAC,iBAAiB;GACrC,KAAK,SAAS,IAAI,KAAK;EACzB,CAAC;EAED,KAAK,iBAAiB,KAAK,IAAI;EAC/B,IAAI;GACF,KAAK,OAAO,eAAe;EAC7B,QAAQ,CAER;EAEA,OAAO,KAAK,aAAa,MAAM,KAAK;CACtC;CAEA,YAA6B;EAC3B,OAAO,OAAO,cAAc,eAAe,UAAU,WAAW;CAClE;CAEA,wBAA4C;EAI1C,KAAK,SAAS,IAAI,IAAI;EAGtB,IAAI,KAAK,mBAAmB,MAC1B,KAAK,iBAAiB,yBAAyB,KAAK,cAAc,CAAC;EAErE,OAAO,IAAI,SAAY,SAAS,WAAW;GACzC,KAAK,kBAAkB,KAAK;IACjB;IACT;GACF,CAAC;EACH,CAAC;CACH;CAEA,gBAA8B;EAC5B,IAAI,KAAK,kBAAkB,WAAW,GAAG;EACzC,IAAI,KAAK,UAAU;EACnB,MAAM,UAAU,KAAK;EACrB,KAAK,oBAAoB,CAAC;EAG1B,IAAI,KAAK,mBAAmB,MAAM;GAChC,KAAK,eAAe;GACpB,KAAK,iBAAiB;EACxB;EACA,KAAK,WAAW,EAAE,MACf,UAAU;GACT,KAAK,MAAM,KAAK,SAAS,EAAE,QAAQ,KAAK;EAC1C,IACC,QAAQ;GACP,KAAK,MAAM,KAAK,SAAS,EAAE,OAAO,GAAG;EACvC,CACF;CACF;CAEA,MAAc,aAAa,MAAc,OAAoC;EAC3E,IAAI,UAAU;EACd,OAAO,MAAM;GACX,IAAI,SAAS,KAAK,kBAAkB,KAAK,UACvC,MAAM,IAAI,aAAa,cAAc,YAAY;GAEnD,IAAI;IAEF,MAAM,SAAS,MADC,KAAK,gBACM,EAAE,MAAM,MAAM;IACzC,IAAI,SAAS,KAAK,kBAAkB,KAAK,UACvC,MAAM,IAAI,aAAa,cAAc,YAAY;IAEnD,OAAO,KAAK,aAAa,MAAM;GACjC,SAAS,KAAK;IACZ,IAAI,SAAS,KAAK,kBAAkB,KAAK,YAAY,aAAa,GAAG,GACnE,MAAM;IAMR,IAAI,KAAK,gBAAgB,kBAAkB,KAAK,UAAU,KAAK,eAAe,WAAW;KACvF,YAAY;MACV,KAAK,WAAW,IAAI,KAAK;MACzB,KAAK,UAAU,IAAI,KAAK;MACxB,KAAK,OAAO,IAAI,KAAK,KAAK,KAAK,MAAM,KAAA,IAAY,YAAY,MAAM;KACrE,CAAC;KACD,OAAO,KAAK,sBAAsB;IACpC;IACA,IAAI,CAAC,KAAK,YAAY,SAAS,GAAG,GAChC,OAAO,KAAK,aAAa,GAAG;IAG9B,MAAM,eADQ,KAAK,aAAa,OACP,GAAG,MAAM,MAAM;IACxC,WAAW;GACb;EACF;CACF;CAEA,YAAoB,SAAiB,KAAuB;EAC1D,MAAM,QAAQ,KAAK;EACnB,IAAI,UAAU,GAAG,OAAO;EACxB,IAAI,OAAO,UAAU,UAAU,OAAO,UAAU;EAChD,OAAO,MAAM,SAAS,GAAG;CAC3B;CAEA,aAAqB,SAAyB;EAC5C,MAAM,IAAI,KAAK;EAIf,IAAI,MAAM,KAAA,GAAW,OAAO,KAAK,IAAI,MAAO,KAAK,SAAS,GAAM;EAChE,OAAO,OAAO,MAAM,aAAa,EAAE,OAAO,IAAI;CAChD;CAEA,aAAqB,QAAc;EAOjC,MAAM,OAAO,KAAK,KAAK,KAAK;EAC5B,MAAM,SACJ,SAAS,KAAA,KAAa,CAAC,KAAK,yBAAyB,SAAS,gBAAgB,MAAM,MAAM;EAM5F,IAAI,KAAK,UAAU,SAAS,GAC1B,KAAK,MAAM,KAAK,KAAK,WAAW,EAAE,OAAO;EAE3C,YAAY;GACV,KAAK,KAAK,IAAI,MAAM;GACpB,KAAK,MAAM,IAAI,KAAA,CAAS;GACxB,KAAK,OAAO,IAAI,SAAS;GACzB,KAAK,UAAU,IAAI,KAAK;GACxB,KAAK,WAAW,IAAI,KAAK;GACzB,KAAK,cAAc,IAAI,KAAK,IAAI,CAAC;GACjC,KAAK,QAAQ,IAAI,KAAK,cAAc,CAAC;EACvC,CAAC;EACD,KAAK,cAAc;EACnB,IAAI,KAAK,YAAY,GAAG,KAAK,kBAAkB;EAC/C,IAAI;GACF,KAAK,OAAO,iBAAiB,KAAK,IAAI,IAAI,KAAK,cAAc;EAC/D,QAAQ,CAER;EACA,KAAK,gBAAgB,MAAM;EAC3B,OAAO;CACT;CAEA,aAAqB,KAAqB;EACxC,YAAY;GACV,KAAK,MAAM,IAAI,GAAG;GAClB,KAAK,OAAO,IAAI,OAAO;GACvB,KAAK,UAAU,IAAI,KAAK;GACxB,KAAK,WAAW,IAAI,KAAK;EAC3B,CAAC;EACD,IAAI;GACF,KAAK,OAAO,eAAe,KAAK,IAAI,IAAI,KAAK,gBAAgB,GAAG;EAClE,QAAQ,CAER;EACA,MAAM;CACR;CAEA,oBAAkC;EAChC,IAAI,KAAK,cAAc,MAAM,aAAa,KAAK,UAAU;EACzD,IAAI,KAAK,YAAY,GACnB,KAAK,aAAa,iBAAiB;GACjC,KAAK,aAAa;GAClB,IAAI,CAAC,KAAK,UAAU,KAAK,QAAQ,IAAI,IAAI;EAC3C,GAAG,KAAK,SAAS;CAErB;CAEA,UAAsB;EACpB,OAAO,KAAK,WAAW;CACzB;;;;;;;;;;;;;;;CAgBA,eAAe,MAAS,eAA6B;EACnD,IAAI,KAAK,UAAU;EAGnB,KAAK,kBAAkB;EACvB,KAAK,cAAc,MAAM;EACzB,KAAK,eAAe;EACpB,IAAI,KAAK,eAAe,MAAM;GAC5B,aAAa,KAAK,UAAU;GAC5B,KAAK,aAAa;EACpB;EACA,MAAM,eAAe,KAAK,cAAc,KAAK,KAAK,IAAI,IAAI,iBAAiB,KAAK;EAChF,YAAY;GACV,KAAK,KAAK,IAAI,IAAI;GAClB,KAAK,MAAM,IAAI,KAAA,CAAS;GACxB,KAAK,OAAO,IAAI,SAAS;GACzB,KAAK,UAAU,IAAI,KAAK;GACxB,KAAK,WAAW,IAAI,KAAK;GACzB,KAAK,cAAc,IAAI,aAAa;GACpC,KAAK,QAAQ,IAAI,YAAY;EAC/B,CAAC;EACD,IAAI,CAAC,gBAAgB,KAAK,YAAY,GAAG;GACvC,MAAM,YAAY,KAAK,aAAa,KAAK,IAAI,IAAI;GACjD,KAAK,aAAa,iBAAiB;IACjC,KAAK,aAAa;IAClB,IAAI,CAAC,KAAK,UAAU,KAAK,QAAQ,IAAI,IAAI;GAC3C,GAAG,SAAS;EACd;EACA,KAAK,gBAAgB,IAAI;EAEzB,IAAI,KAAK,yBAAyB,SAAS,GAAG,CAI9C;CACF;;;;;;;CAQA,YAAkB;EAChB,IAAI,KAAK,UAAU;EACnB,IAAI,KAAK,cAAc,MAAM;GAC3B,aAAa,KAAK,UAAU;GAC5B,KAAK,aAAa;EACpB;EACA,KAAK,cAAc;EACnB,KAAK,QAAQ,IAAI,IAAI;CACvB;CAEA,aAAyB;EACvB,KAAK,UAAU;EACf,OAAO,KAAK,WAAW;CACzB;CAEA,QAAc;EACZ,IAAI,KAAK,UAAU;EACnB,YAAY;GACV,KAAK,MAAM,IAAI,KAAA,CAAS;GACxB,KAAK,OAAO,IAAI,KAAK,KAAK,KAAK,MAAM,KAAA,IAAY,YAAY,MAAM;EACrE,CAAC;CACH;;;;;;;;;;CAWA,SAAe;EACb,IAAI,KAAK,YAAY,CAAC,KAAK,WAAW,KAAK,GAAG;EAC9C,KAAK,kBAAkB;EACvB,KAAK,cAAc,MAAM;EACzB,KAAK,eAAe;EACpB,YAAY;GACV,KAAK,WAAW,IAAI,KAAK;GACzB,KAAK,UAAU,IAAI,KAAK;GACxB,KAAK,OAAO,IAAI,KAAK,KAAK,KAAK,MAAM,KAAA,IAAY,YAAY,MAAM;EACrE,CAAC;CACH;;;;;;;;;;;;;;;;CAiBA,QAAQ,SAAqC,MAAsC;EACjF,IAAI,KAAK,UACP,OAAO;GAAE,gBAAgB,CAAC;GAAG,gBAAgB,CAAC;EAAE;EAElD,MAAM,OAAO,KAAK,KAAK,KAAK;EAC5B,MAAM,OAAO,QAAQ,IAAI;EAEzB,MAAM,SADQ,MAAM,SAAS,OAEzB;GAAE,IAAI,KAAK;GAAkB;GAAM,MAAM;EAAK,IAC9C;EACJ,IAAI,QAAQ,KAAK,UAAU,KAAK,MAAM;EAEtC,YAAY;GACV,KAAK,KAAK,IAAI,IAAI;GAClB,IAAI,KAAK,OAAO,KAAK,MAAM,UAAU,KAAK,OAAO,KAAK,MAAM,WAC1D,KAAK,OAAO,IAAI,SAAS;GAE3B,KAAK,cAAc,IAAI,KAAK,IAAI,CAAC;GACjC,IAAI,QAAQ,KAAK,oBAAoB,IAAI,IAAI;EAC/C,CAAC;EAED,IAAI,CAAC,QACH,OAAO;GAAE,gBAAgB,CAAC;GAAG,gBAAgB,CAAC;EAAE;EAElD,MAAM,KAAK,OAAO;EAClB,OAAO;GACL,gBAAgB;IACd,IAAI,CAAC,OAAO,QAAQ,KAAK,UAAU;IACnC,OAAO,OAAO;IACd,YAAY;KACV,MAAM,IAAI,KAAK,UAAU,QAAQ,MAAM;KACvC,IAAI,MAAM,IAAI;MACZ,IAAI,MAAM,KAAK,UAAU,SAAS,GAGhC,KAAK,KAAK,IAAI,OAAO,IAAS;WACzB;OAOL,MAAM,QAAQ,KAAK,UAAU,IAAI;OACjC,MAAM,OAAO,OAAO;MACtB;MACA,KAAK,UAAU,OAAO,GAAG,CAAC;KAC5B;KACA,KAAK,oBAAoB,IAAI,KAAK,UAAU,MAAM,MAAM,EAAE,IAAI,CAAC;IACjE,CAAC;GACH;GACA,gBAAgB;IACd,IAAI,CAAC,OAAO,QAAQ,KAAK,UAAU;IACnC,OAAO,OAAO;IACd,KAAK,YAAY,KAAK,UAAU,QAAQ,MAAM,EAAE,OAAO,EAAE;IACzD,IAAI,CAAC,KAAK,UAAU,MAAM,MAAM,EAAE,IAAI,GACpC,KAAK,oBAAoB,IAAI,KAAK;GAEtC;EACF;CACF;CAEA,aAAyB;EACvB,IAAI,KAAK,UACP,OAAO,QAAQ,OAAO,IAAI,aAAa,kBAAkB,YAAY,CAAC;EAExE,IAAI,KAAK,OAAO,KAAK,MAAM,WACzB,OAAO,QAAQ,QAAQ,KAAK,KAAK,KAAK,CAAM;EAE9C,IAAI,KAAK,OAAO,KAAK,MAAM,SACzB,OAAO,QAAQ,OAAO,KAAK,MAAM,KAAK,CAAC;EAEzC,OAAO,IAAI,SAAY,SAAS,WAAW;GACzC,MAAM,WAAW,QAAuB;IACtC,KAAK,2BAA2B,KAAK,yBAAyB,QAAQ,MAAM,MAAM,OAAO;IACzF,OAAO,GAAG;GACZ;GACA,KAAK,yBAAyB,KAAK,OAAO;GAC1C,MAAM,QAAQ,KAAK,OAAO,WAAW,MAAM;IACzC,IAAI,MAAM,WAAW;KACnB,MAAM;KACN,KAAK,2BAA2B,KAAK,yBAAyB,QAAQ,MAAM,MAAM,OAAO;KACzF,QAAQ,KAAK,KAAK,KAAK,CAAM;IAC/B,OAAO,IAAI,MAAM,SAAS;KACxB,MAAM;KACN,QAAQ,KAAK,MAAM,KAAK,CAAC;IAC3B;GACF,CAAC;EACH,CAAC;CACH;;;;;CAMA,aAAsB;EACpB,IAAI,KAAK,aAAa,OAAO;EAC7B,MAAM,OAAO,KAAK,cAAc,KAAK;EACrC,IAAI,SAAS,KAAA,GAAW,OAAO;EAC/B,OAAO,KAAK,IAAI,IAAI,QAAQ,KAAK;CACnC;CAEA,UAAgB;EACd,IAAI,KAAK,UAAU;EACnB,KAAK,WAAW;EAChB,IAAI,KAAK,cAAc,MAAM;GAC3B,aAAa,KAAK,UAAU;GAC5B,KAAK,aAAa;EACpB;EACA,KAAK,cAAc,MAAM;EACzB,KAAK,eAAe;EAIpB,YAAY;GACV,KAAK,WAAW,IAAI,KAAK;GACzB,KAAK,UAAU,IAAI,KAAK;EAC1B,CAAC;EACD,IAAI,KAAK,mBAAmB,MAAM;GAChC,KAAK,eAAe;GACpB,KAAK,iBAAiB;EACxB;EACA,IAAI,KAAK,kBAAkB,SAAS,GAAG;GACrC,MAAM,WAAW,IAAI,aAAa,kBAAkB,YAAY;GAChE,MAAM,UAAU,KAAK;GACrB,KAAK,oBAAoB,CAAC;GAC1B,KAAK,MAAM,KAAK,SAAS,EAAE,OAAO,QAAQ;EAC5C;EACA,IAAI,KAAK,yBAAyB,SAAS,GAAG;GAC5C,MAAM,WAAW,IAAI,aAAa,kBAAkB,YAAY;GAChE,MAAM,UAAU,KAAK;GACrB,KAAK,2BAA2B,CAAC;GACjC,KAAK,MAAM,MAAM,SAAS,GAAG,QAAQ;EACvC;CACF;AACF;;;;;;;;;ACneA,IAAa,gBAAb,MAAoD;CAClD,QAAkC,OAAgB,CAAC,CAAC;CACpD;CACA;CACA,QAA8C,OAAO,KAAA,CAAS;CAC9D,SAAuC,OAAoB,MAAM;CACjE,YAAsC,OAAO,KAAK;CAClD,aAAuC,OAAO,KAAK;CACnD,UAAoC,OAAO,IAAI;CAC/C,gBAAqD,OAAO,KAAA,CAAS;CACrE,sBAAgD,OAAO,KAAK;;;CAG5D,WAAqC,OAAO,KAAK;CAEjD,qBAA+C,OAAO,KAAK;CAC3D,yBAAmD,OAAO,KAAK;CAE/D;CACA;CACA;CAEA,iBAAyB;CACzB,eAA+C;CAC/C,aAA2D;;CAE3D,cAAsB;CACtB,YAKK,CAAC;CACN,iBAAyB;CACzB,WAAmB;;CAEnB,2BAAkE,CAAC;CAEnE;CAIA;CACA;CACA;CAGA;CACA;CACA;CACA;CACA;CACA,iBAA8C;CAC9C,oBAIK,CAAC;CACN;;;;;;;CAOA;CAEA,YAAY,MAYT;EACD,KAAK,UAAU,KAAK;EACpB,KAAK,mBAAmB,KAAK;EAC7B,KAAK,mBAAmB,KAAK;EAC7B,KAAK,uBAAuB,KAAK;EACjC,KAAK,UAAU,KAAK;EACpB,KAAK,YAAY,KAAK,aAAa;EACnC,KAAK,QAAQ,KAAK,SAAS;EAC3B,KAAK,aAAa,KAAK;EACvB,KAAK,cAAc,KAAK,eAAe;EACvC,KAAK,yBAAyB,KAAK,mBAAmB;EACtD,KAAK,gBAAgB,KAAK;EAC1B,KAAK,aAAa,OAAoB,CAAC,CAAC;EACxC,KAAK,OAAO,eAAe;GACzB,MAAM,KAAK,KAAK,MAAM;GACtB,OAAO,GAAG,WAAW,IAAI,KAAA,IAAY;EACvC,CAAC;EACD,KAAK,OAAO,eAAwB;GAClC,MAAM,KAAK,KAAK,MAAM;GACtB,IAAI,CAAC,KAAK,SAAS,OAAO;GAC1B,MAAM,MAAe,CAAC;GACtB,KAAK,MAAM,KAAK,IACd,KAAK,MAAM,QAAQ,KAAK,QAAQ,CAAC,GAAG,IAAI,KAAK,IAAI;GAEnD,OAAO;EACT,CAAC;EACD,KAAK,cAAc,eAAe;GAChC,MAAM,KAAK,KAAK,MAAM;GACtB,IAAI,GAAG,WAAW,GAAG,OAAO;GAC5B,OAAO,KAAK,iBAAiB,GAAG,GAAG,SAAS,IAAa,EAAE,MAAM;EACnE,CAAC;EACD,KAAK,kBAAkB,eAAe;GACpC,MAAM,KAAK,KAAK,MAAM;GACtB,IAAI,GAAG,WAAW,GAAG,OAAO;GAC5B,MAAM,KAAK,KAAK;GAChB,IAAI,CAAC,IAAI,OAAO;GAChB,OAAO,GAAG,GAAG,IAAa,EAAE,MAAM;EACpC,CAAC;CACH;;;;;;;;;;;CAYA,aAA6B;EAC3B,IAAI,KAAK,UAAU,OAAO,QAAQ,uBAAO,IAAI,MAAM,gBAAgB,CAAC;EACpE,IAAI,KAAK,gBAAgB,YAAY,KAAK,UAAU,GAClD,OAAO,KAAK,sBAAsB,SAAS;EAE7C,MAAM,OAAO,EAAE,KAAK;EACpB,KAAK,cAAc,MAAM;EACzB,MAAM,QAAQ,IAAI,gBAAgB;EAClC,KAAK,eAAe;EAEpB,MAAM,gBAAgB,KAAK,MAAM,KAAK;EACtC,YAAY;GACV,KAAK,OAAO,IAAI,SAAS;GACzB,KAAK,WAAW,IAAI,IAAI;GACxB,KAAK,UAAU,IAAI,cAAc,WAAW,CAAC;GAC7C,KAAK,SAAS,IAAI,KAAK;EACzB,CAAC;EAED,OAAO,KAAK,cAAc,MAAM,MAAM,QAAQ,KAAK,IAAI,GAAG,cAAc,MAAM,GAAG,aAAa;CAChG;;;;;;;;;CAUA,MAAc,cACZ,MACA,QACA,aACA,eACgB;EAChB,MAAM,WAAoB,CAAC;EAC3B,MAAM,YAAyB,CAAC;EAChC,IAAI,YAAuB,KAAK;EAChC,IAAI;GACF,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,KAAK;IACpC,IAAI,UAAU;IACd,OAAO,MAAM;KACX,IAAI,SAAS,KAAK,kBAAkB,KAAK,UACvC,MAAM,IAAI,aAAa,cAAc,YAAY;KAEnD,IAAI;MACF,MAAM,OAAO,MAAM,KAAK,QAAQ;OAAE;OAAW;MAAO,CAAC;MACrD,IAAI,SAAS,KAAK,kBAAkB,KAAK,UACvC,MAAM,IAAI,aAAa,cAAc,YAAY;MAEnD,SAAS,KAAK,IAAI;MAClB,UAAU,KAAK,SAAS;MACxB;KACF,SAAS,KAAK;MACZ,IAAI,SAAS,KAAK,kBAAkB,KAAK,YAAY,aAAa,GAAG,GAAG,MAAM;MAG9E,IAAI,EADF,OAAO,KAAK,UAAU,WAAW,UAAU,KAAK,QAAQ,KAAK,MAAM,SAAS,GAAG,IAC/D;OAChB,YAAY;QACV,KAAK,MAAM,IAAI,GAAG;QAClB,KAAK,OAAO,IAAI,OAAO;QACvB,KAAK,UAAU,IAAI,KAAK;QACxB,KAAK,WAAW,IAAI,KAAK;OAC3B,CAAC;OACD,MAAM;MACR;MAEA,MAAM,eADQ,KAAK,kBAAkB,OACZ,GAAG,MAAM;MAClC,WAAW;KACb;IACF;IACA,MAAM,OAAO,KAAK,iBAAiB,SAAS,SAAS,SAAS,IAAa,QAAQ;IACnF,IAAI,SAAS,MAAM;IACnB,YAAY;GACd;GACA,IAAI,SAAS,KAAK,kBAAkB,KAAK,UACvC,MAAM,IAAI,aAAa,cAAc,YAAY;GAInD,MAAM,aACJ,cAAc,SAAS,KAAK,KAAK,0BAA0B,SAAS,SAAS,IACzE,CAAC,gBAAgB,cAAc,IAAa,SAAS,EAAW,GAAG,GAAG,SAAS,MAAM,CAAC,CAAC,IACvF;GACN,YAAY;IACV,KAAK,MAAM,IAAI,UAAU;IACzB,KAAK,WAAW,IAAI,SAAS;IAC7B,KAAK,MAAM,IAAI,KAAA,CAAS;IACxB,KAAK,OAAO,IAAI,SAAS;IACzB,KAAK,UAAU,IAAI,KAAK;IACxB,KAAK,WAAW,IAAI,KAAK;IACzB,KAAK,cAAc,IAAI,KAAK,IAAI,CAAC;IACjC,KAAK,QAAQ,IAAI,KAAK,cAAc,CAAC;GACvC,CAAC;GACD,KAAK,cAAc;GACnB,IAAI,KAAK,YAAY,GAAG,KAAK,kBAAkB;GAC/C,KAAK,gBAAgB,KAAK,MAAM,KAAK,CAAC;GACtC,OAAO,WAAW;EACpB,UAAU;GAKR,IACE,CAAC,KAAK,YACN,KAAK,OAAO,KAAK,MAAM,aACvB,CAAC,KAAK,WAAW,KAAK,KACtB,KAAK,MAAM,KAAK,EAAE,SAAS,GAE3B,KAAK,OAAO,IAAI,SAAS;EAE7B;CACF;CAEA,gBAA+B;EAC7B,IAAI,KAAK,UAAU,OAAO,QAAQ,uBAAO,IAAI,MAAM,gBAAgB,CAAC;EACpE,IAAI,KAAK,mBAAmB,KAAK,GAAG,OAAO,QAAQ,QAAQ;EAC3D,IAAI,KAAK,gBAAgB,YAAY,KAAK,UAAU,GAClD,OAAO,KAAK,sBAAsB,MAAM;EAE1C,MAAM,KAAK,KAAK,MAAM,KAAK;EAC3B,IAAI,GAAG,WAAW,GAChB,OAAO,KAAK,WAAW,EAAE,WAAW,CAAC,CAAC;EAExC,MAAM,YAAY,KAAK,iBAAiB,GAAG,GAAG,SAAS,IAAa,EAAE;EACtE,IAAI,cAAc,MAAM,OAAO,QAAQ,QAAQ;EAE/C,MAAM,OAAO,EAAE,KAAK;EACpB,MAAM,QAAQ,IAAI,gBAAgB;EAClC,KAAK,cAAc,MAAM;EACzB,KAAK,eAAe;EACpB,YAAY;GACV,KAAK,mBAAmB,IAAI,IAAI;GAChC,KAAK,WAAW,IAAI,IAAI;EAC1B,CAAC;EAED,OAAO,KAAK,SACV,MACA,MAAM,QACN,YACC,MAAM,UAAU;GACf,IAAI,SAAS,KAAK,kBAAkB,KAAK,UAAU;GACnD,YAAY;IACV,KAAK,MAAM,IAAI,CAAC,GAAG,KAAK,MAAM,KAAK,GAAG,IAAI,CAAC;IAC3C,KAAK,WAAW,IAAI,CAAC,GAAG,KAAK,WAAW,KAAK,GAAG,KAAK,CAAC;IACtD,KAAK,MAAM,IAAI,KAAA,CAAS;IAIxB,KAAK,OAAO,IAAI,SAAS;IACzB,KAAK,mBAAmB,IAAI,KAAK;IACjC,KAAK,WAAW,IAAI,KAAK;IACzB,KAAK,cAAc,IAAI,KAAK,IAAI,CAAC;GACnC,CAAC;GACD,KAAK,gBAAgB,KAAK,MAAM,KAAK,CAAC;EACxC,GACA,MACF,EAAE,WAAW,CAAC,CAAC;CACjB;CAEA,oBAAmC;EACjC,IAAI,KAAK,UAAU,OAAO,QAAQ,uBAAO,IAAI,MAAM,gBAAgB,CAAC;EACpE,IAAI,KAAK,uBAAuB,KAAK,GAAG,OAAO,QAAQ,QAAQ;EAC/D,IAAI,CAAC,KAAK,sBAAsB,OAAO,QAAQ,QAAQ;EACvD,IAAI,KAAK,gBAAgB,YAAY,KAAK,UAAU,GAClD,OAAO,KAAK,sBAAsB,MAAM;EAE1C,MAAM,KAAK,KAAK,MAAM,KAAK;EAC3B,IAAI,GAAG,WAAW,GAChB,OAAO,KAAK,WAAW,EAAE,WAAW,CAAC,CAAC;EAExC,MAAM,YAAY,KAAK,qBAAqB,GAAG,IAAa,EAAE;EAC9D,IAAI,cAAc,MAAM,OAAO,QAAQ,QAAQ;EAE/C,MAAM,OAAO,EAAE,KAAK;EACpB,MAAM,QAAQ,IAAI,gBAAgB;EAClC,KAAK,cAAc,MAAM;EACzB,KAAK,eAAe;EACpB,YAAY;GACV,KAAK,uBAAuB,IAAI,IAAI;GACpC,KAAK,WAAW,IAAI,IAAI;EAC1B,CAAC;EAED,OAAO,KAAK,SACV,MACA,MAAM,QACN,YACC,MAAM,UAAU;GACf,IAAI,SAAS,KAAK,kBAAkB,KAAK,UAAU;GACnD,YAAY;IACV,KAAK,MAAM,IAAI,CAAC,MAAM,GAAG,KAAK,MAAM,KAAK,CAAC,CAAC;IAC3C,KAAK,WAAW,IAAI,CAAC,OAAO,GAAG,KAAK,WAAW,KAAK,CAAC,CAAC;IACtD,KAAK,MAAM,IAAI,KAAA,CAAS;IAGxB,KAAK,OAAO,IAAI,SAAS;IACzB,KAAK,uBAAuB,IAAI,KAAK;IACrC,KAAK,WAAW,IAAI,KAAK;IACzB,KAAK,cAAc,IAAI,KAAK,IAAI,CAAC;GACnC,CAAC;GACD,KAAK,gBAAgB,KAAK,MAAM,KAAK,CAAC;EACxC,GACA,MACF,EAAE,WAAW,CAAC,CAAC;CACjB;CAEA,MAAc,SACZ,MACA,QACA,WACA,WACA,WACgB;EAChB,IAAI,UAAU;EACd,IAAI,YAAY;EAChB,IAAI;GACF,OAAO,MAAM;IACX,IAAI,SAAS,KAAK,kBAAkB,KAAK,UACvC,MAAM,IAAI,aAAa,cAAc,YAAY;IAEnD,IAAI;KACF,MAAM,OAAO,MAAM,KAAK,QAAQ;MAAE;MAAW;KAAO,CAAC;KACrD,IAAI,SAAS,KAAK,kBAAkB,KAAK,UACvC,MAAM,IAAI,aAAa,cAAc,YAAY;KAEnD,UAAU,MAAM,SAAS;KACzB,YAAY;KACZ,OAAO;IACT,SAAS,KAAK;KACZ,IAAI,SAAS,KAAK,kBAAkB,KAAK,YAAY,aAAa,GAAG,GACnE,MAAM;KAIR,IAAI,EADF,OAAO,KAAK,UAAU,WAAW,UAAU,KAAK,QAAQ,KAAK,MAAM,SAAS,GAAG,IAC/D;MAChB,YAAY;OACV,KAAK,MAAM,IAAI,GAAG;OAClB,KAAK,OAAO,IAAI,OAAO;OACvB,KAAK,UAAU,IAAI,KAAK;OACxB,KAAK,WAAW,IAAI,KAAK;OACzB,IAAI,cAAc,QAAQ,KAAK,mBAAmB,IAAI,KAAK;OAC3D,IAAI,cAAc,QAAQ,KAAK,uBAAuB,IAAI,KAAK;MACjE,CAAC;MACD,MAAM;KACR;KAEA,MAAM,eADQ,KAAK,kBAAkB,OACZ,GAAG,MAAM;KAClC,WAAW;IACb;GACF;EACF,UAAU;GAMR,IAAI,CAAC,WACH,YAAY;IACV,IAAI,cAAc,QAAQ,KAAK,mBAAmB,IAAI,KAAK;IAC3D,IAAI,cAAc,QAAQ,KAAK,uBAAuB,IAAI,KAAK;IAO/D,IACE,CAAC,KAAK,YACN,KAAK,OAAO,KAAK,MAAM,aACvB,CAAC,KAAK,WAAW,KAAK,KACtB,KAAK,MAAM,KAAK,EAAE,SAAS,GAE3B,KAAK,OAAO,IAAI,SAAS;GAE7B,CAAC;EAEL;CACF;CAEA,UAA0B;EACxB,OAAO,KAAK,WAAW;CACzB;;CAGA,YAAkB;EAChB,IAAI,KAAK,UAAU;EACnB,IAAI,KAAK,cAAc,MAAM;GAC3B,aAAa,KAAK,UAAU;GAC5B,KAAK,aAAa;EACpB;EACA,KAAK,cAAc;EACnB,KAAK,QAAQ,IAAI,IAAI;CACvB;CAEA,aAA6B;EAC3B,KAAK,UAAU;EACf,OAAO,KAAK,WAAW;CACzB;CAEA,QAAc;EACZ,IAAI,KAAK,UAAU;EACnB,YAAY;GACV,KAAK,MAAM,IAAI,KAAA,CAAS;GACxB,KAAK,OAAO,IAAI,KAAK,MAAM,KAAK,EAAE,SAAS,IAAI,YAAY,MAAM;EACnE,CAAC;CACH;;;;CAKA,SAAe;EACb,IAAI,KAAK,YAAY,CAAC,KAAK,WAAW,KAAK,GAAG;EAC9C,KAAK,kBAAkB;EACvB,KAAK,cAAc,MAAM;EACzB,KAAK,eAAe;EACpB,YAAY;GACV,KAAK,WAAW,IAAI,KAAK;GACzB,KAAK,UAAU,IAAI,KAAK;GACxB,KAAK,mBAAmB,IAAI,KAAK;GACjC,KAAK,uBAAuB,IAAI,KAAK;GACrC,KAAK,OAAO,IAAI,KAAK,MAAM,KAAK,EAAE,SAAS,IAAI,YAAY,MAAM;EACnE,CAAC;CACH;CAEA,QAAQ,SAAiD,MAAsC;EAC7F,IAAI,KAAK,UACP,OAAO;GAAE,gBAAgB,CAAC;GAAG,gBAAgB,CAAC;EAAE;EAElD,MAAM,OAAO,KAAK,MAAM,KAAK;EAC7B,MAAM,aAAa,KAAK,WAAW,KAAK;EACxC,MAAM,OAAO,QAAQ,KAAK,WAAW,IAAI,KAAA,IAAY,IAAI;EAWzD,MAAM,SANQ,MAAM,SAAS,OAMN;GAAE,IAAI,KAAK;GAAkB;GAAM;GAAY,MAAM;EAAK,IAAI;EACrF,IAAI,QAAQ,KAAK,UAAU,KAAK,MAAM;EAOtC,IAAI,aAA0B;EAC9B,IAAI,KAAK,WAAW,WAAW,QAC7B,IAAI,KAAK,SAAS,WAAW,QAC3B,aAAa,WAAW,MAAM,GAAG,KAAK,MAAM;OACvC;GACL,MAAM,MAAM,WAAW,WAAW,SAAS;GAC3C,aAAa,WAAW,MAAM;GAC9B,KAAK,IAAI,IAAI,WAAW,QAAQ,IAAI,KAAK,QAAQ,KAC/C,WAAW,KAAK,GAAgB;EAEpC;EAGF,YAAY;GACV,KAAK,MAAM,IAAI,IAAI;GACnB,IAAI,eAAe,YAAY,KAAK,WAAW,IAAI,UAAU;GAC7D,IAAI,KAAK,OAAO,KAAK,MAAM,UAAU,KAAK,OAAO,KAAK,MAAM,WAC1D,KAAK,OAAO,IAAI,SAAS;GAE3B,KAAK,cAAc,IAAI,KAAK,IAAI,CAAC;GACjC,IAAI,QAAQ,KAAK,oBAAoB,IAAI,IAAI;EAC/C,CAAC;EAED,IAAI,CAAC,QACH,OAAO;GAAE,gBAAgB,CAAC;GAAG,gBAAgB,CAAC;EAAE;EAElD,MAAM,KAAK,OAAO;EAClB,OAAO;GACL,gBAAgB;IACd,IAAI,CAAC,OAAO,QAAQ,KAAK,UAAU;IACnC,OAAO,OAAO;IACd,YAAY;KACV,MAAM,IAAI,KAAK,UAAU,QAAQ,MAAM;KACvC,IAAI,MAAM,IAAI;MACZ,IAAI,MAAM,KAAK,UAAU,SAAS,GAAG;OAGnC,KAAK,MAAM,IAAI,OAAO,IAAI;OAC1B,KAAK,WAAW,IAAI,OAAO,UAAU;MACvC,OAAO;OAML,MAAM,QAAQ,KAAK,UAAU,IAAI;OACjC,MAAM,OAAO,OAAO;OACpB,MAAM,aAAa,OAAO;MAC5B;MACA,KAAK,UAAU,OAAO,GAAG,CAAC;KAC5B;KACA,KAAK,oBAAoB,IAAI,KAAK,UAAU,MAAM,MAAM,EAAE,IAAI,CAAC;IACjE,CAAC;GACH;GACA,gBAAgB;IACd,IAAI,CAAC,OAAO,QAAQ,KAAK,UAAU;IACnC,OAAO,OAAO;IACd,KAAK,YAAY,KAAK,UAAU,QAAQ,MAAM,EAAE,OAAO,EAAE;IACzD,IAAI,CAAC,KAAK,UAAU,MAAM,MAAM,EAAE,IAAI,GACpC,KAAK,oBAAoB,IAAI,KAAK;GAEtC;EACF;CACF;CAEA,aAA+B;EAC7B,IAAI,KAAK,UACP,OAAO,QAAQ,OAAO,IAAI,aAAa,kBAAkB,YAAY,CAAC;EAExE,IAAI,KAAK,OAAO,KAAK,MAAM,WACzB,OAAO,QAAQ,QAAQ,KAAK,MAAM,KAAK,CAAC;EAE1C,IAAI,KAAK,OAAO,KAAK,MAAM,SACzB,OAAO,QAAQ,OAAO,KAAK,MAAM,KAAK,CAAC;EAEzC,OAAO,IAAI,SAAkB,SAAS,WAAW;GAC/C,MAAM,WAAW,QAAuB;IACtC,KAAK,2BAA2B,KAAK,yBAAyB,QAAQ,MAAM,MAAM,OAAO;IACzF,OAAO,GAAG;GACZ;GACA,KAAK,yBAAyB,KAAK,OAAO;GAC1C,MAAM,QAAQ,KAAK,OAAO,WAAW,MAAM;IACzC,IAAI,MAAM,WAAW;KACnB,MAAM;KACN,KAAK,2BAA2B,KAAK,yBAAyB,QAAQ,MAAM,MAAM,OAAO;KACzF,QAAQ,KAAK,MAAM,KAAK,CAAC;IAC3B,OAAO,IAAI,MAAM,SAAS;KACxB,MAAM;KACN,QAAQ,KAAK,MAAM,KAAK,CAAC;IAC3B;GACF,CAAC;EACH,CAAC;CACH;CAEA,aAAsB;EACpB,IAAI,KAAK,aAAa,OAAO;EAC7B,MAAM,OAAO,KAAK,cAAc,KAAK;EACrC,IAAI,SAAS,KAAA,GAAW,OAAO;EAC/B,OAAO,KAAK,IAAI,IAAI,QAAQ,KAAK;CACnC;CAEA,kBAA0B,SAAyB;EACjD,MAAM,IAAI,KAAK;EAGf,IAAI,MAAM,KAAA,GAAW,OAAO,KAAK,IAAI,MAAO,KAAK,SAAS,GAAM;EAChE,OAAO,OAAO,MAAM,aAAa,EAAE,OAAO,IAAI;CAChD;CAEA,YAA6B;EAC3B,OAAO,OAAO,cAAc,eAAe,UAAU,WAAW;CAClE;CAEA,sBAA8B,WAA0D;EAGtF,KAAK,SAAS,IAAI,IAAI;EACtB,IAAI,KAAK,mBAAmB,MAC1B,KAAK,iBAAiB,yBAAyB,KAAK,cAAc,CAAC;EAErE,OAAO,IAAI,SAAe,SAAS,WAAW;GAC5C,KAAK,kBAAkB,KAAK;IAAE;IAAW;IAAS;GAAO,CAAC;EAC5D,CAAC;CACH;CAEA,gBAA8B;EAC5B,IAAI,KAAK,kBAAkB,WAAW,GAAG;EACzC,IAAI,KAAK,UAAU;EACnB,KAAK,SAAS,IAAI,KAAK;EACvB,MAAM,UAAU,KAAK;EACrB,KAAK,oBAAoB,CAAC;EAC1B,IAAI,KAAK,mBAAmB,MAAM;GAChC,KAAK,eAAe;GACpB,KAAK,iBAAiB;EACxB;EAIA,MAAM,uBAAO,IAAI,IAAiC;EAClD,MAAM,QAA4C;GAAC;GAAW;GAAQ;EAAM;EAC5E,KAAK,MAAM,KAAK,SACd,KAAK,IAAI,EAAE,SAAS;EAEtB,MAAM,MAAM,YAAY;GACtB,KAAK,MAAM,OAAO,OAAO;IACvB,IAAI,CAAC,KAAK,IAAI,GAAG,GAAG;IACpB,IAAI,QAAQ,WAAW,MAAM,KAAK,WAAW;SACxC,IAAI,QAAQ,QAAQ,MAAM,KAAK,cAAc;SAC7C,MAAM,KAAK,kBAAkB;GACpC;EACF;EACA,IAAI,EAAE,WACE;GACJ,KAAK,MAAM,KAAK,SAAS,EAAE,QAAQ;EACrC,IACC,QAAQ;GACP,KAAK,MAAM,KAAK,SAAS,EAAE,OAAO,GAAG;EACvC,CACF;CACF;CAEA,oBAAkC;EAChC,IAAI,KAAK,cAAc,MAAM,aAAa,KAAK,UAAU;EACzD,IAAI,KAAK,YAAY,GACnB,KAAK,aAAa,iBAAiB;GACjC,KAAK,aAAa;GAClB,IAAI,CAAC,KAAK,UAAU,KAAK,QAAQ,IAAI,IAAI;EAC3C,GAAG,KAAK,SAAS;CAErB;CAEA,UAAgB;EACd,IAAI,KAAK,UAAU;EACnB,KAAK,WAAW;EAChB,IAAI,KAAK,cAAc,MAAM;GAC3B,aAAa,KAAK,UAAU;GAC5B,KAAK,aAAa;EACpB;EACA,KAAK,cAAc,MAAM;EACzB,KAAK,eAAe;EAGpB,YAAY;GACV,KAAK,WAAW,IAAI,KAAK;GACzB,KAAK,UAAU,IAAI,KAAK;GACxB,KAAK,mBAAmB,IAAI,KAAK;GACjC,KAAK,uBAAuB,IAAI,KAAK;EACvC,CAAC;EACD,IAAI,KAAK,mBAAmB,MAAM;GAChC,KAAK,eAAe;GACpB,KAAK,iBAAiB;EACxB;EACA,IAAI,KAAK,kBAAkB,SAAS,GAAG;GACrC,MAAM,WAAW,IAAI,aAAa,kBAAkB,YAAY;GAChE,MAAM,UAAU,KAAK;GACrB,KAAK,oBAAoB,CAAC;GAC1B,KAAK,MAAM,KAAK,SAAS,EAAE,OAAO,QAAQ;EAC5C;EACA,IAAI,KAAK,yBAAyB,SAAS,GAAG;GAC5C,MAAM,WAAW,IAAI,aAAa,kBAAkB,YAAY;GAChE,MAAM,UAAU,KAAK;GACrB,KAAK,2BAA2B,CAAC;GACjC,KAAK,MAAM,MAAM,SAAS,GAAG,QAAQ;EACvC;CACF;AACF;;;;;;;;;;;AClxBA,SAAgB,WAAW,MAAkC;CAC3D,OAAO,KAAK,UAAU,MAAM,QAAQ;AACtC;AAUA,MAAM,WAAW,SAAyB,KAAa,QAA0B;CAC/E,MAAM,QAAS,KAAiC;CAChD,IAAI,OAAO,UAAU,YACnB,MAAM,IAAI,MAAM,4CAA4C;CAE9D,IAAI,OAAO,UAAU,UACnB,MAAM,IAAI,MAAM,0CAA0C;CAE5D,IAAI,OAAO,UAAU,UAGnB,OAAO,EAAE,UAAU,MAAM,SAAS,EAAE;CAEtC,IAAI,OAAO,UAAU,UAAU;EAG7B,IAAI,OAAO,MAAM,KAAK,GAAG,OAAO;EAChC,IAAI,UAAU,OAAO,mBAAmB,OAAO;EAC/C,IAAI,UAAU,OAAO,mBAAmB,OAAO;EAC/C,OAAO;CACT;CACA,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,IAAI,iBAAiB,MAAM,OAAO,EAAE,QAAQ,MAAM,YAAY,EAAE;CAChE,IAAI,iBAAiB,OAAO,iBAAiB,KAC3C,MAAM,IAAI,MAAM,+DAA+D;CAEjF,IAAI,SAAS,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK,GAAG;EAI/D,MAAM,QAAQ,OAAO,eAAe,KAAK;EACzC,IAAI,UAAU,QAAQ,UAAU,OAAO,WACrC,MAAM,IAAI,MACR,yDAAyD,MAAM,aAAa,QAAQ,UAAU,iCAChG;EAEF,MAAM,SAAkC,CAAC;EACzC,KAAK,MAAM,KAAK,OAAO,KAAK,KAAK,EAAE,KAAK,GACtC,OAAO,KAAM,MAAkC;EAEjD,OAAO;CACT;CACA,OAAO;AACT;;;;;;;;;;;;AC0JA,SAAS,eAAkB,KAA6B;CACtD,MAAM,QAAQ;CACd,MAAM,WAAW,MAAM;CACvB,IAAI,UAAU,OAAO;CACrB,MAAM,0BAAU,IAAI,IAAe;CACnC,MAAM,OAAO;CACb,OAAO;AACT;AAEA,MAAM,gBAAgB,eAAgC,OAAO,IAAI,oBAAoB,CAAC;;;;;;;;;AAUtF,SAAgB,kBAAkB,SAAiB,OAA8B;CAW/E,cAAc,IAAI,SAAS,KAAK;AAClC;;;;;;AAOA,SAAgB,sBAAsB,SAA8C;CAClF,OAAO,cAAc,IAAI,OAAO;AAClC;AAmCA,MAAM,mBAAmB,eAAmC,OAAO,IAAI,uBAAuB,CAAC;;AAG/F,SAAgB,qBAAqB,YAAoB,OAAiC;CACxF,iBAAiB,IAAI,YAAY,KAAK;AACxC;;;;;;;;AASA,SAAgB,yBAAyB,YAAoD;CAC3F,OAAO,iBAAiB,IAAI,UAAU;AACxC;;AAGA,SAAgB,wBAAwB,YAA0B;CAChE,iBAAiB,OAAO,UAAU;AACpC;;;ACvSA,MAAM,kBAAkB,IAAI;;;;;;;;AAqB5B,MAAM,gBAAgB,IAAY,SAAyB,KAAK,UAAU,CAAC,IAAI,IAAI,CAAC;AAEpF,IAAa,cAAb,MAA4B;CAC1B;;CAEA;;CAEA;CACA;CACA;CACA,kBAA0B;CAC1B,UAAwD;CACxD,gBAA+D;CAC/D,aAA0C;CAC1C,cAA2C;CAC3C;CACA;CACA;CACA;CAEA,YACE,QACA,OACA,UACA,SACA,MACA,UASA,gBACA;EACA,KAAK,SAAS;EACd,KAAK,QAAQ;EACb,KAAK,WAAW;EAChB,KAAK,UAAU;EACf,KAAK,SAAS,KAAK,UAAU;EAC7B,KAAK,kBAAkB,KAAK;EAC5B,KAAK,uBAAuB,KAAK,wBAAwB,OAAO;EAChE,KAAK,qBAAqB,KAAK,sBAAsB,OAAO;EAC5D,MAAM,YAAY,KAAK;EACvB,MAAM,OAAO,OAAO;EACH,OAAO;EACP,KAAK;EACtB,KAAK,QAAQ,IAAI,MAAS;GACxB,gBAAgB,WAAW,UAAU;IAAE;IAAQ;GAAK,GAAG,GAAI,QAAoB;GAC/E,WAAW,KAAK;GAChB,OAAO,KAAK;GACZ,YAAY,KAAK;GACjB,aAAa,KAAK;GAClB,iBAAiB,KAAK;GACtB,aAAa,UAAU;GACvB,kBAAkB,UAAU;GAC5B,QAcM,KAAA;GACN,eAAe;EACjB,CAAC;CACH;CAEA,UAAgB;EACd,KAAK,mBAAmB;EACxB,IAAI,KAAK,WAAW,MAAM;GACxB,aAAa,KAAK,OAAO;GACzB,KAAK,UAAU;EACjB;EACA,IAAI,KAAK,oBAAoB,GAAG;GAC9B,IAAI,KAAK,mBAAmB,MAAM,KAAK,mBAAmB;GAC1D,IAAI,KAAK,sBACP,KAAK,aAAa,2BAA2B,KAAK,oBAAoB,CAAC;GAEzE,IAAI,KAAK,oBACP,KAAK,cAAc,yBAAyB,KAAK,oBAAoB,CAAC;EAE1E;CACF;CAEA,UAAgB;EACd,KAAK,mBAAmB;EACxB,IAAI,KAAK,mBAAmB,GAAG;GAC7B,KAAK,kBAAkB;GACvB,KAAK,uBAAuB;GAC5B,IAAI,KAAK,WAAW,GAClB,KAAK,OAAO,UAAU,IAAI;QAE1B,KAAK,UAAU,iBAAiB;IAC9B,KAAK,UAAU;IACf,KAAK,OAAO,UAAU,IAAI;GAC5B,GAAG,KAAK,MAAM;EAElB;CACF;CAEA,iBAA0B;EACxB,OAAO,KAAK,kBAAkB;CAChC;CAEA,qBAA2B;EACzB,IAAI,KAAK,mBAAmB,MAAM;EAClC,IAAI,KAAK,iBAAiB,MAAM;EAChC,KAAK,gBAAgB,kBAAkB;GAMrC,IAAI,OAAO,aAAa,eAAe,SAAS,oBAAoB,UAClE;GAOF,IAAI,KAAK,MAAM,WAAW,KAAK,GAAG;GAClC,KAAK,MAAM,WAAW,EAAE,YAAY,CAEpC,CAAC;EACH,GAAG,KAAK,eAAe;CACzB;CAEA,oBAA0B;EACxB,IAAI,KAAK,iBAAiB,MAAM;GAC9B,cAAc,KAAK,aAAa;GAChC,KAAK,gBAAgB;EACvB;CACF;CAEA,yBAA+B;EAC7B,IAAI,KAAK,cAAc,MAAM;GAC3B,KAAK,WAAW;GAChB,KAAK,aAAa;EACpB;EACA,IAAI,KAAK,eAAe,MAAM;GAC5B,KAAK,YAAY;GACjB,KAAK,cAAc;EACrB;CACF;;;;;;;;;CAUA,qBAA2B;EACzB,IAAI,KAAK,kBAAkB,KAAK,KAAK,WAAW,MAAM;EACtD,IAAI,KAAK,WAAW,GAAG;GAGrB,qBAAqB;IACnB,IAAI,KAAK,oBAAoB,KAAK,KAAK,WAAW,MAChD,KAAK,OAAO,UAAU,IAAI;GAE9B,CAAC;GACD;EACF;EACA,KAAK,UAAU,iBAAiB;GAC9B,KAAK,UAAU;GACf,KAAK,OAAO,UAAU,IAAI;EAC5B,GAAG,KAAK,MAAM;CAChB;;CAGA,sBAAoC;EAClC,IAAI,CAAC,KAAK,MAAM,WAAW,GAAG;EAG9B,IAAI,KAAK,MAAM,WAAW,KAAK,GAAG;EAClC,KAAK,MAAM,WAAW,EAAE,YAAY,CAEpC,CAAC;CACH;CAEA,UAAgB;EACd,IAAI,KAAK,WAAW,MAAM;GACxB,aAAa,KAAK,OAAO;GACzB,KAAK,UAAU;EACjB;EACA,KAAK,kBAAkB;EACvB,KAAK,uBAAuB;EAC5B,KAAK,MAAM,QAAQ;CACrB;AACF;AAEA,IAAa,sBAAb,MAA0D;CACxD;CACA;CACA;CACA;CACA;CACA,kBAA0B;CAC1B,UAAwD;CACxD,gBAA+D;CAC/D;CACA;CAEA,YACE,QACA,OACA,UACA,SACA,MAOA,gBACA;EACA,KAAK,SAAS;EACd,KAAK,QAAQ;EACb,KAAK,WAAW;EAChB,KAAK,UAAU;EACf,KAAK,SAAS,KAAK,UAAU;EAC7B,KAAK,kBAAkB,KAAK;EAC5B,MAAM,YAAY,KAAK;EACvB,MAAM,OAAO,OAAO;EACpB,KAAK,QAAQ,IAAI,cAAuC;GACtD,UAAU,EAAE,WAAW,aACrB,UAAU;IAAE;IAAW;IAAQ;GAAK,GAAG,GAAI,QAAoB;GACjE,kBAAkB,KAAK;GACvB,kBAAkB,KAAK;GACvB,sBAAsB,KAAK;GAC3B,SAAS,KAAK;GACd,WAAW,KAAK;GAChB,OAAO,KAAK;GACZ,YAAY,KAAK;GACjB,aAAa,KAAK;GAClB,iBAAiB,KAAK;GAKtB,eAAe;EACjB,CAAC;CACH;CAEA,UAAgB;EACd,KAAK,mBAAmB;EACxB,IAAI,KAAK,WAAW,MAAM;GACxB,aAAa,KAAK,OAAO;GACzB,KAAK,UAAU;EACjB;EACA,IAAI,KAAK,oBAAoB,KAAK,KAAK,mBAAmB,MACxD,KAAK,mBAAmB;CAE5B;CAEA,iBAA0B;EACxB,OAAO,KAAK,kBAAkB;CAChC;CAEA,UAAgB;EACd,KAAK,mBAAmB;EACxB,IAAI,KAAK,mBAAmB,GAAG;GAC7B,KAAK,kBAAkB;GACvB,IAAI,KAAK,WAAW,GAClB,KAAK,OAAO,kBACV,IACF;QAEA,KAAK,UAAU,iBAAiB;IAC9B,KAAK,UAAU;IACf,KAAK,OAAO,kBACV,IACF;GACF,GAAG,KAAK,MAAM;EAElB;CACF;CAEA,qBAAmC;EACjC,IAAI,KAAK,mBAAmB,QAAQ,KAAK,iBAAiB,MAAM;EAChE,KAAK,gBAAgB,kBAAkB;GAErC,IAAI,OAAO,aAAa,eAAe,SAAS,oBAAoB,UAClE;GAIF,IAAI,KAAK,MAAM,WAAW,KAAK,GAAG;GAClC,KAAK,MAAM,WAAW,EAAE,YAAY,CAEpC,CAAC;EACH,GAAG,KAAK,eAAe;CACzB;CAEA,oBAAkC;EAChC,IAAI,KAAK,iBAAiB,MAAM;GAC9B,cAAc,KAAK,aAAa;GAChC,KAAK,gBAAgB;EACvB;CACF;;CAGA,qBAA2B;EACzB,IAAI,KAAK,kBAAkB,KAAK,KAAK,WAAW,MAAM;EACtD,IAAI,KAAK,WAAW,GAAG;GACrB,qBAAqB;IACnB,IAAI,KAAK,oBAAoB,KAAK,KAAK,WAAW,MAChD,KAAK,OAAO,kBACV,IACF;GAEJ,CAAC;GACD;EACF;EACA,KAAK,UAAU,iBAAiB;GAC9B,KAAK,UAAU;GACf,KAAK,OAAO,kBACV,IACF;EACF,GAAG,KAAK,MAAM;CAChB;CAEA,UAAgB;EACd,IAAI,KAAK,WAAW,MAAM;GACxB,aAAa,KAAK,OAAO;GACzB,KAAK,UAAU;EACjB;EACA,KAAK,kBAAkB;EACvB,KAAK,MAAM,QAAQ;CACrB;AACF;;;;;;AAOA,IAAa,cAAb,MAAyB;CACvB,uBAAwB,IAAI,IAAiD;CAC7E,+BAAgC,IAAI,IAGlC;CACF,iCAAkC,IAAI,IAAc;CACpD,yCAA0C,IAAI,IAAsB;CACpE,+BAAgC,IAAI,IAAsD;;CAE1F,qBAA8C,OAAO,CAAC;CACtD;CACA,WAAmB;;CAEnB;;CAGA;;CAGA;CACA;;;;;CAMA;;;;;;;CAOA,iBAAyB;CAEzB,YAAY,MAQT;EACD,KAAK,UAAU,MAAM;EACrB,KAAK,WAAW,MAAM;EACtB,KAAK,OAAO,MAAM,QAAQ,CAAC;EAC3B,KAAK,uBAAuB,MAAM,wBAAwB;EAC1D,KAAK,qBAAqB,MAAM,sBAAsB;EACtD,KAAK,UAAU,MAAM,WAAW,CAAC;EACjC,IAAI,MAAM,SAAS,KAAK,QAAQ,KAAK,OAAO;EAC5C,MAAM,MAAM,KAAK,cAAc;EAC/B,KAAK,MAAM,UAAU,KAAK,SACxB,KAAK,WAAW,cAAc,OAAO,OAAO,GAAG,CAAC;CAEpD;;;;;;CAOA,gBAA8C;EAC5C,MAAM,OAAO;EACb,OAAO;GACL,mBAAmB,SAAS,SAAS,MAAM;IACzC,KAAK,mBAAmB,SAAS,SAAS,IAAI;GAChD;GACA,sBAAsB,SAAS,SAAS;IACtC,KAAK,sBAAsB,SAAS,OAAO;GAC7C;GACA,aAAa,SAAS,SAAS,SAAS;IACtC,KAAK,aAAa,SAAS,SAAS,OAAO;GAC7C;GACA,eAAe,SAAS;IACtB,OAAO,KAAK,kBAAkB,OAAO;GACvC;EACF;CACF;;CAGA,WAAmB,QAA2B,IAAsB;EAClE,IAAI;GACF,GAAG;EACL,SAAS,KAAK;GACZ,cAAc,KAAK,SAAS,KAAK;IAC/B,MAAM;IACN,gBAAgB,CAAC;IACjB,YAAY,OAAO;GACrB,CAAC;EACH;CACF;;;;;;;;;;;;;;;;;;CAmBA,YACE,OACA,SACA,MACA,MACA,QACM;EACN,IAAI,KAAK,QAAQ,WAAW,GAAG;EAC/B,MAAM,UAAU,MAAM,OAAO;EAC7B,IAAI,WAAW,MAAM;EACrB,MAAM,QAAsB;GAC1B;GACA;GACA;GACA;GACA,UAAU,KAAK;GACf;EACF;EACA,KAAK,MAAM,UAAU,KAAK,SACxB,IAAI,OAAO,WAAW;GACpB,MAAM,KAAK,OAAO;GAClB,KAAK,WAAW,cAAc,GAAG,KAAK,QAAQ,KAAK,CAAC;EACtD;CAEJ;CAEA,eACE,OACA,SACA,MACM;EACN,IAAI,KAAK,QAAQ,WAAW,GAAG;EAC/B,MAAM,UAAU,MAAM,OAAO;EAC7B,IAAI,WAAW,MAAM;EACrB,MAAM,QAAyB;GAC7B;GACA;GACA;GACA,UAAU,KAAK;EACjB;EACA,KAAK,MAAM,UAAU,KAAK,SACxB,IAAI,OAAO,cAAc;GACvB,MAAM,KAAK,OAAO;GAClB,KAAK,WAAW,cAAc,GAAG,KAAK,QAAQ,KAAK,CAAC;EACtD;CAEJ;CAEA,OACE,OACA,SACA,MACM;EACN,IAAI,KAAK,QAAQ,WAAW,GAAG;EAC/B,MAAM,UAAU,MAAM,OAAO;EAC7B,IAAI,WAAW,MAAM;EACrB,MAAM,QAAiB;GAAE;GAAS;GAAS;EAAK;EAChD,KAAK,MAAM,UAAU,KAAK,SACxB,IAAI,OAAO,MAAM;GACf,MAAM,KAAK,OAAO;GAClB,KAAK,WAAW,cAAc,GAAG,KAAK,QAAQ,KAAK,CAAC;EACtD;CAEJ;;;;;;CAOA,oBAAoB,OAKX;EACP,IAAI,KAAK,QAAQ,WAAW,GAAG;EAC/B,KAAK,MAAM,UAAU,KAAK,SACxB,IAAI,OAAO,mBAAmB;GAC5B,MAAM,KAAK,OAAO;GAClB,KAAK,WAAW,cAAc,GAAG,KAAK,QAAQ,KAAK,CAAC;EACtD;CAEJ;;CAGA,mBAAmB,OAKV;EACP,IAAI,KAAK,QAAQ,WAAW,GAAG;EAC/B,KAAK,MAAM,UAAU,KAAK,SACxB,IAAI,OAAO,kBAAkB;GAC3B,MAAM,KAAK,OAAO;GAClB,KAAK,WAAW,cAAc,GAAG,KAAK,QAAQ,KAAK,CAAC;EACtD;CAEJ;;CAGA,kBAA0B,SAAkD;EAI1E,MAAM,QAAQ,sBAAsB,OAAO;EAC3C,IAAI,CAAC,OAAO,OAAO,CAAC;EACpB,MAAM,MAA8B,CAAC;EACrC,IAAI,MAAM,WAAW,SAAS;GAC5B,MAAM,MAAM,KAAK,KAAK,IAAI,KAA4B;GACtD,IAAI,KAAK,KAAK,MAAM,MAAM,IAAI,OAAO,GAAG,IAAI,KAAK,GAAG,OAAO;EAC7D,OAAO;GACL,MAAM,MAAM,KAAK,aAAa,IAAI,KAAoC;GACtE,IAAI,KAAK,KAAK,MAAM,MAAM,IAAI,OAAO,GAAG,IAAI,KAAK,GAAG,OAAO;EAC7D;EACA,OAAO;CACT;;;;;;;;;;;;;;;;CAiBA,mBAAmB,SAAiB,SAA6B,MAAqB;EACpF,MAAM,QAAQ,sBAAsB,OAAO;EAC3C,IAAI,CAAC,OAAO;EACZ,IAAI,MAAM,WAAW,SAAS;EAC9B,MAAM,WAAW;EACjB,MAAM,MAAM,KAAK,KAAK,IAAI,QAAQ;EAClC,IAAI,CAAC,KAAK;EACV,MAAM,OAAO,WAAW,OAAO;EAC/B,MAAM,QAAQ,IAAI,IAAI,IAAI;EAC1B,IAAI,CAAC,OAAO;EACZ,KAAK,iBAAiB;EACtB,IAAI;GACF,MAAM,MAAM,cAAc,MAAe,EAAE,OAAO,MAAM,CAAC;GACzD,KAAK,YAAY,UAAU,MAAM,SAAS,MAAM,QAAQ,QAAQ;EAClE,UAAU;GACR,KAAK,iBAAiB;EACxB;CACF;;;;;;;;;;;;;;;;;;CAmBA,qBACE,SACA,SACA,MACA,eACM;EACN,MAAM,QAAQ,sBAAsB,OAAO;EAC3C,MAAM,OAAO,WAAW,OAAO;EAC/B,IAAI,SAAS,MAAM,WAAW,SAAS;GACrC,MAAM,WAAW;GAEjB,MAAM,QADM,KAAK,KAAK,IAAI,QACV,GAAG,IAAI,IAAI;GAC3B,IAAI,UAAU,KAAA,GAAW;IACvB,KAAK,iBAAiB;IACtB,IAAI;KACF,MAAM,MAAM,eAAe,MAAM,aAAa;KAC9C,KAAK,YAAY,UAAU,MAAM,SAAS,MAAM,QAAQ,QAAQ;IAClE,UAAU;KACR,KAAK,iBAAiB;IACxB;IACA;GACF;EACF;EAKA,KAAK,aAAa,IAAI,aAAa,SAAS,IAAI,GAAG;GAAE;GAAM;EAAc,CAAC;CAC5E;;;;;;;;;;;;CAaA,aACE,SACA,SACA,SACM;EACN,MAAM,QAAQ,sBAAsB,OAAO;EAC3C,IAAI,CAAC,OAAO;EACZ,MAAM,OAAO,WAAW,OAAO;EAC/B,IAAI,MAAM,WAAW,SAAS;GAC5B,MAAM,WAAW;GACjB,MAAM,MAAM,KAAK,KAAK,IAAI,QAAQ;GAClC,IAAI,CAAC,KAAK;GACV,MAAM,QAAQ,IAAI,IAAI,IAAI;GAC1B,IAAI,CAAC,OAAO;GACZ,MAAM,MAAM,QAAQ,SAAqC,EAAE,OAAO,MAAM,CAAC;GACzE,KAAK,YAAY,UAAU,MAAM,SAAS,MAAM,MAAM,KAAK,KAAK,GAAG,QAAQ,KAAK;GAChF;EACF;EAKA,MAAM,WAAW;EACjB,MAAM,MAAM,KAAK,aAAa,IAAI,QAAQ;EAC1C,IAAI,CAAC,KAAK;EACV,MAAM,QAAQ,IAAI,IAAI,IAAI;EAC1B,IAAI,CAAC,OAAO;EACZ,MAAM,MAAM,QAAQ,SAAuD,EAAE,OAAO,MAAM,CAAC;EAC3F,KAAK,YAAY,UAAU,MAAM,SAAS,MAAM,MAAM,MAAM,KAAK,GAAG,YAAY,KAAK;CACvF;CAEA,sBAAsB,SAAiB,SAAmC;EACxE,MAAM,QAAQ,sBAAsB,OAAO;EAC3C,IAAI,CAAC,OAAO;EACZ,IAAI,MAAM,WAAW,SAAS;EAC9B,MAAM,WAAW;EACjB,MAAM,MAAM,KAAK,KAAK,IAAI,QAAQ;EAClC,IAAI,CAAC,KAAK;EACV,MAAM,OAAO,WAAW,OAAO;EAC/B,MAAM,QAAQ,IAAI,IAAI,IAAI;EAC1B,IAAI,CAAC,OAAO;EACZ,KAAK,iBAAiB;EACtB,IAAI;GAGF,MAAM,MAAM,WAAW,EAAE,OAAO,QAAQ;IAGtC,IAAI,aAAa,GAAG,GAAG;IACvB,cAAc,KAAK,SAAS,KAAK;KAC/B,MAAM;KACN,gBAAgB,CAAC;KACjB,UAAU,MAAM;IAClB,CAAC;GACH,CAAC;GACD,KAAK,eAAe,UAAU,MAAM,SAAS,MAAM;EACrD,UAAU;GACR,KAAK,iBAAiB;EACxB;CACF;CAEA,QAAQ,OAA8B;EACpC,IAAI,MAAM,YAAY,GAWpB;EAEF,KAAK,MAAM,SAAS,MAAM,SAAS;GACjC,MAAM,OAAO,WAAW,MAAM,GAAG;GACjC,KAAK,aAAa,IAAI,aAAa,MAAM,IAAI,IAAI,GAAG;IAClD,MAAM,MAAM;IACZ,eAAe,MAAM;GACvB,CAAC;EACH;CACF;;;;;;;CAQA,uBAAgE;EAC9D,MAAM,MAA+C,CAAC;EACtD,KAAK,MAAM,OAAO,KAAK,KAAK,OAAO,GACjC,KAAK,MAAM,MAAM,IAAI,OAAO,GAC1B,IAAI,KAAK;GACP,KAAK,GAAG;GACR,QAAQ,GAAG,MAAM,OAAO,KAAK;GAC7B,MAAM,GAAG,MAAM,KAAK,KAAK;GACzB,OAAO,GAAG,MAAM,MAAM,KAAK;GAC3B,eAAe,GAAG,MAAM,cAAc,KAAK;GAC3C,SAAS,GAAG,MAAM,QAAQ,KAAK;GAC/B,YAAY,GAAG,MAAM,WAAW,KAAK;GACrC,qBAAqB,GAAG,MAAM,oBAAoB,KAAK;EACzD,CAAC;EAGL,KAAK,MAAM,OAAO,KAAK,aAAa,OAAO,GACzC,KAAK,MAAM,MAAM,IAAI,OAAO,GAC1B,IAAI,KAAK;GACP,KAAK,GAAG;GACR,QAAQ,GAAG,MAAM,OAAO,KAAK;GAE7B,MAAM,GAAG,MAAM,MAAM,KAAK;GAC1B,OAAO,GAAG,MAAM,MAAM,KAAK;GAC3B,eAAe,GAAG,MAAM,cAAc,KAAK;GAC3C,SAAS,GAAG,MAAM,QAAQ,KAAK;GAC/B,YAAY,GAAG,MAAM,WAAW,KAAK;GACrC,qBAAqB,GAAG,MAAM,oBAAoB,KAAK;EACzD,CAAC;EAGL,OAAO;CACT;CAEA,YAA6B;EAC3B,MAAM,UAAsC,CAAC;EAC7C,KAAK,MAAM,CAAC,OAAO,QAAQ,KAAK,MAC9B,KAAK,MAAM,MAAM,IAAI,OAAO,GAC1B,IAAI,GAAG,MAAM,OAAO,KAAK,MAAM,WAC7B,QAAQ,KAAK;GACX,IAAI,MAAM;GACV,KAAK,GAAG;GACR,MAAM,GAAG,MAAM,KAAK,KAAK;GACzB,eAAe,GAAG,MAAM,cAAc,KAAK,KAAK,KAAK,IAAI;EAC3D,CAAC;EAIP,OAAO;GAAE,SAAS;GAAG;EAAQ;CAC/B;CAEA,MAAM,cAA6B;EACjC,KAAK,IAAI,SAAS,GAAG,SAAS,KAAK,UAAU;GAC3C,MAAM,QAAyB,CAAC;GAChC,KAAK,MAAM,OAAO,KAAK,KAAK,OAAO,GACjC,KAAK,MAAM,MAAM,IAAI,OAAO,GAC1B,IAAI,GAAG,MAAM,WAAW,KAAK,GAC3B,MAAM,KAAK,eAAe,GAAG,MAAM,UAAU,CAAC;GAIpD,KAAK,MAAM,OAAO,KAAK,aAAa,OAAO,GACzC,KAAK,MAAM,MAAM,IAAI,OAAO,GAC1B,IAAI,GAAG,MAAM,WAAW,KAAK,GAC3B,MAAM,KAAK,eAAe,GAAG,MAAM,UAAU,CAAC;GAIpD,IAAI,KAAK,mBAAmB,KAAK,IAAI,GACnC,MAAM,KACJ,IAAI,SAAe,YAAY;IAC7B,MAAM,QAAQ,KAAK,mBAAmB,WAAW,MAAM;KACrD,IAAI,MAAM,GAAG;MACX,MAAM;MACN,QAAQ;KACV;IACF,CAAC;GACH,CAAC,CACH;GAEF,IAAI,MAAM,WAAW,GAAG;GACxB,MAAM,QAAQ,IAAI,KAAK;EACzB;EAMA,MAAM,YAA2E,CAAC;EAClF,KAAK,MAAM,OAAO,KAAK,KAAK,OAAO,GACjC,KAAK,MAAM,MAAM,IAAI,OAAO,GAC1B,IAAI,GAAG,MAAM,WAAW,KAAK,GAAG,UAAU,KAAK;GAAE,KAAK,GAAG;GAAS,MAAM;EAAO,CAAC;EAGpF,KAAK,MAAM,OAAO,KAAK,aAAa,OAAO,GACzC,KAAK,MAAM,MAAM,IAAI,OAAO,GAC1B,IAAI,GAAG,MAAM,WAAW,KAAK,GAAG,UAAU,KAAK;GAAE,KAAK,GAAG;GAAS,MAAM;EAAW,CAAC;EAGxF,MAAM,sBAAM,IAAI,MACd,8FACF;EACA,IAAI,YAAY;EAChB,IAAI,oBAAoB,KAAK,mBAAmB,KAAK;EACrD,MAAM;CACR;CAEA,UAAqC,OAAuB,MAA4B;EACtF,MAAM,WAAW;EACjB,IAAI,MAAM,KAAK,KAAK,IAAI,QAAQ;EAChC,IAAI,CAAC,KAAK;GACR,sBAAM,IAAI,IAAI;GACd,KAAK,KAAK,IAAI,UAAU,GAAG;GAC3B,KAAK,eAAe,IAAI,QAAQ;GAChC,SAAS,UAAU,IAAI,IAAI;EAC7B;EACA,MAAM,UAAU,SAAS,OAAO,IAAI,GAAG,IAAI;EAC3C,MAAM,OAAO,WAAW,OAAO;EAC/B,IAAI,QAAQ,IAAI,IAAI,IAAI;EACxB,IAAI,CAAC,OAAO;GACV,MAAM,OAAO,aAAa,SAAS,MAAM,IAAI;GAC7C,MAAM,WAAW,KAAK,aAAa,IAAI,IAAI;GAC3C,IAAI,UAAU,KAAK,aAAa,OAAO,IAAI;GAK3C,MAAM,iBACJ,SAAS,OAAO,WAAW,QACtB,SAAS,KAAK,YAAY,UAAU,SAAS,MAAM,QAAQ,OAAO,IACnE,KAAA;GACN,QAAQ,IAAI,YACV,MACA,UACA,MACA,SACA,SAAS,QACT,UACA,cACF;GACA,IAAI,IAAI,MAAM,KAA6B;GAI3C,MAAM,mBAAmB;GAUzB,IAAI,aAAa,KAAA,GACf,KAAK,YAAY,UAAU,SAAS,SAAS,MAAM,QAAQ,OAAO;EAEtE;EAwBA,OAAO;CACT;CAEA,UAAU,OAAmC;EAC3C,MAAM,MAAM,KAAK,KAAK,IAAI,MAAM,KAAK;EACrC,IAAI,CAAC,KAAK;EACV,MAAM,OAAO,WAAW,MAAM,OAAO;EACrC,IAAI,IAAI,IAAI,IAAI,MAAM,OAAO;EAC7B,IAAI,OAAO,IAAI;EACf,MAAM,QAAQ;EACd,IAAI,IAAI,SAAS,GACf,KAAK,KAAK,OAAO,MAAM,KAAK;EAK9B,KAAK,OAAO,MAAM,OAAO,MAAM,SAAS,MAAM;CAChD;;;;;;;;CASA,gBAAwB,OAIf;EACP,IAAI,MAAM,eAAe,GACvB,MAAM,MAAM,WAAW,EAAE,OAAO,QAAQ;GACtC,IAAI,aAAa,GAAG,GAAG;GACvB,cAAc,KAAK,SAAS,KAAK;IAC/B,MAAM;IACN,gBAAgB,CAAC;IACjB,UAAU,MAAM;GAClB,CAAC;EACH,CAAC;OAED,MAAM,MAAM,UAAU;CAE1B;CAEA,WAAmC,OAAyB,MAAkB;EAC5E,MAAM,WAAW;EACjB,MAAM,MAAM,KAAK,KAAK,IAAI,QAAQ;EAClC,IAAI,CAAC,KAAK;EACV,MAAM,UAAU,SAAS,OAAO,IAAI,GAAG,IAAI;EAC3C,MAAM,OAAO,WAAW,OAAO;EAC/B,MAAM,QAAQ,IAAI,IAAI,IAAI;EAC1B,IAAI,CAAC,OAAO;EAIZ,KAAK,gBAAgB,KAAK;EAC1B,KAAK,eAAe,UAAU,SAAS,MAAM;CAC/C;CAEA,cAAc,OAA8B;EAC1C,MAAM,WAAW;EACjB,MAAM,MAAM,KAAK,KAAK,IAAI,QAAQ;EAClC,IAAI,CAAC,KAAK;EACV,KAAK,MAAM,CAAC,MAAM,UAAU,KAAK;GAK/B,KAAK,gBAAgB,KAAK;GAC1B,KAAK,eAAe,UAAU,MAAM,SAAS,MAAM;EACrD;CACF;CAEA,OAA+B,OAAyB,MAAkB;EACxE,MAAM,WAAW;EACjB,MAAM,MAAM,KAAK,KAAK,IAAI,QAAQ;EAClC,IAAI,CAAC,KAAK;EACV,MAAM,OAAO,WAAW,SAAS,OAAO,IAAI,GAAG,IAAI,CAAC;EACpD,IAAI,IAAI,IAAI,GAAG,MAAM,OAAO;CAC9B;CAEA,UAAU,OAA8B;EACtC,MAAM,MAAM,KAAK,KAAK,IAAI,KAAiB;EAC3C,IAAI,CAAC,KAAK;EACV,KAAK,MAAM,SAAS,IAAI,OAAO,GAAG,MAAM,MAAM,OAAO;CACvD;CAEA,QACE,OACA,MACA,SACU;EACV,MAAM,QAAQ,KAAK,UAAU,OAAO,IAAI;EACxC,MAAM,WAAW,MAAM,MAAM,QAAQ,OAAO;EAI5C,KAAK,YAAY,MAAM,OAAO,MAAM,SAAS,MAAM,MAAM,KAAK,KAAK,GAAG,QAAQ,KAAK;EAKnF,OAAO;GACL,gBAAgB;IACd,MAAM,SAAS,MAAM,MAAM,KAAK,KAAK;IACrC,SAAS,SAAS;IAClB,MAAM,QAAQ,MAAM,MAAM,KAAK,KAAK;IACpC,IAAI,CAAC,OAAO,GAAG,QAAQ,KAAK,GAC1B,KAAK,YAAY,MAAM,OAAO,MAAM,SAAS,OAAO,QAAQ,KAAK;GAErE;GACA,gBAAgB,SAAS,SAAS;EACpC;CACF;CAEA,kBACE,OACA,MAC4C;EAC5C,MAAM,WAAW;EACjB,IAAI,MAAM,KAAK,aAAa,IAAI,QAAQ;EACxC,IAAI,CAAC,KAAK;GACR,sBAAM,IAAI,IAAI;GACd,KAAK,aAAa,IAAI,UAAU,GAAG;GACnC,KAAK,uBAAuB,IAAI,QAAQ;GACxC,SAAS,UAAU,IAAI,IAAI;EAC7B;EACA,MAAM,UAAU,SAAS,OAAO,IAAI,GAAG,IAAI;EAC3C,MAAM,OAAO,WAAW,OAAO;EAC/B,IAAI,QAAQ,IAAI,IAAI,IAAI;EACxB,IAAI,CAAC,OAAO;GAMV,MAAM,iBACJ,SAAS,OAAO,WAAW,QACtB,UAAU,KAAK,YAAY,UAAU,SAAS,OAAO,YAAY,OAAO,IACzE,KAAA;GACN,QAAQ,IAAI,oBACV,MACA,UACA,MACA,SACA,SAAS,QACT,cACF;GACA,IAAI,IAAI,MAAM,KAAuD;GACrE,MAAM,mBAAmB;EAC3B;EACA,OAAO;CACT;CAEA,kBAAkB,OAA6D;EAC7E,MAAM,MAAM,KAAK,aAAa,IAAI,MAAM,KAAK;EAC7C,IAAI,CAAC,KAAK;EACV,MAAM,OAAO,WAAW,MAAM,OAAO;EACrC,IAAI,IAAI,IAAI,IAAI,MAAM,OAAO;EAC7B,IAAI,OAAO,IAAI;EACf,MAAM,QAAQ;EACd,IAAI,IAAI,SAAS,GACf,KAAK,aAAa,OAAO,MAAM,KAAK;EAEtC,KAAK,OAAO,MAAM,OAAO,MAAM,SAAS,UAAU;CACpD;CAEA,mBACE,OACA,MACM;EACN,MAAM,WAAW;EACjB,MAAM,MAAM,KAAK,aAAa,IAAI,QAAQ;EAC1C,IAAI,CAAC,KAAK;EACV,MAAM,UAAU,SAAS,OAAO,IAAI,GAAG,IAAI;EAC3C,MAAM,OAAO,WAAW,OAAO;EAC/B,MAAM,QAAQ,IAAI,IAAI,IAAI;EAC1B,IAAI,CAAC,OAAO;EACZ,KAAK,gBAAgB,KAAK;EAC1B,KAAK,eAAe,UAAU,SAAS,UAAU;CACnD;CAEA,sBAAsB,OAA2C;EAC/D,MAAM,WAAW;EACjB,MAAM,MAAM,KAAK,aAAa,IAAI,QAAQ;EAC1C,IAAI,CAAC,KAAK;EACV,KAAK,MAAM,SAAS,IAAI,OAAO,GAAG;GAChC,KAAK,gBAAgB,KAAK;GAC1B,KAAK,eAAe,UAAU,MAAM,SAAS,UAAU;EACzD;CACF;CAEA,eAAuC,OAAsC,MAAkB;EAC7F,MAAM,WAAW;EACjB,MAAM,MAAM,KAAK,aAAa,IAAI,QAAQ;EAC1C,IAAI,CAAC,KAAK;EACV,MAAM,OAAO,WAAW,SAAS,OAAO,IAAI,GAAG,IAAI,CAAC;EACpD,IAAI,IAAI,IAAI,GAAG,MAAM,OAAO;CAC9B;CAEA,kBAAkB,OAA2C;EAC3D,MAAM,MAAM,KAAK,aAAa,IAAI,KAAyB;EAC3D,IAAI,CAAC,KAAK;EACV,KAAK,MAAM,SAAS,IAAI,OAAO,GAAG,MAAM,MAAM,OAAO;CACvD;CAEA,gBACE,OACA,MACA,SACU;EACV,MAAM,QAAQ,KAAK,kBAAkB,OAAO,IAAI;EAChD,MAAM,WAAW,MAAM,MAAM,QAAQ,OAAO;EAC5C,KAAK,YAAY,MAAM,OAAO,MAAM,SAAS,MAAM,MAAM,MAAM,KAAK,GAAG,YAAY,KAAK;EAGxF,OAAO;GACL,gBAAgB;IACd,MAAM,SAAS,MAAM,MAAM,MAAM,KAAK;IACtC,SAAS,SAAS;IAClB,MAAM,QAAQ,MAAM,MAAM,MAAM,KAAK;IACrC,IAAI,CAAC,OAAO,GAAG,QAAQ,KAAK,GAC1B,KAAK,YAAY,MAAM,OAAO,MAAM,SAAS,OAAO,YAAY,KAAK;GAEzE;GACA,gBAAgB,SAAS,SAAS;EACpC;CACF;CAEA,iBACE,OACA,MACgB;EAChB,MAAM,QAAQ,KAAK,kBAAkB,OAAO,IAAI;EAGhD,MAAM,QAAQ;EAQd,QAPiB,YAAY;GAE3B,IADe,MAAM,MAAM,OAAO,KACzB,MAAM,aAAa,CAAC,MAAM,MAAM,WAAW,GAClD,OAAO,MAAM,MAAM,MAAM,KAAK,EAAE;GAElC,OAAO,MAAM,MAAM,WAAW;EAChC,GACa,EAAE,cAAc,MAAM,QAAQ,CAAC;CAC9C;CAEA,SAAoC,OAAuB,MAAwB;EACjF,MAAM,QAAQ,KAAK,UAAU,OAAO,IAAI;EACxC,MAAM,QAAQ;EAWd,QAViB,YAAY;GAE3B,IADe,MAAM,MAAM,OAAO,KACzB,MAAM,aAAa,CAAC,MAAM,MAAM,WAAW,GAClD,OAAO,MAAM,MAAM,KAAK,KAAK;GAE/B,IAAI,MAAM,MAAM,WAAW,KAAK,GAC9B,OAAO,MAAM,MAAM,WAAW;GAEhC,OAAO,MAAM,MAAM,WAAW;EAChC,GACa,EAAE,cAAc,MAAM,QAAQ,CAAC;CAC9C;CAEA,gBAAwB;EACtB,IAAI,QAAQ;EACZ,KAAK,MAAM,GAAG,QAAQ,KAAK,MACzB,KAAK,MAAM,GAAG,UAAU,KACtB,IAAI,MAAM,MAAM,WAAW,KAAK,GAAG;EAGvC,OAAO;CACT;CAEA,UAAgB;EACd,IAAI,KAAK,UAAU;EACnB,KAAK,WAAW;EAChB,KAAK,MAAM,OAAO,KAAK,KAAK,OAAO,GACjC,KAAK,MAAM,SAAS,IAAI,OAAO,GAC7B,MAAM,QAAQ;EAGlB,KAAK,KAAK,MAAM;EAChB,KAAK,MAAM,OAAO,KAAK,aAAa,OAAO,GACzC,KAAK,MAAM,SAAS,IAAI,OAAO,GAC7B,MAAM,QAAQ;EAGlB,KAAK,aAAa,MAAM;EACxB,KAAK,MAAM,KAAK,KAAK,gBACnB,EAAE,UAAU,OAAO,IAAI;EAEzB,KAAK,eAAe,MAAM;EAC1B,KAAK,MAAM,KAAK,KAAK,wBACnB,EAAE,UAAU,OAAO,IAAI;EAEzB,KAAK,uBAAuB,MAAM;EAClC,KAAK,aAAa,MAAM;EACxB,KAAK,MAAM,UAAU,KAAK,SACxB,IAAI,OAAO,SAAS;GAClB,MAAM,KAAK,OAAO;GAClB,KAAK,WAAW,cAAc,GAAG,KAAK,MAAM,CAAC;EAC/C;CAEJ;AACF;AAEA,SAAS,eAAe,KAGN;CAChB,IAAI,CAAC,IAAI,KAAK,GAAG,OAAO,QAAQ,QAAQ;CACxC,OAAO,IAAI,SAAe,YAAY;EACpC,MAAM,QAAQ,IAAI,WAAW,MAAM;GACjC,IAAI,CAAC,GAAG;IACN,MAAM;IACN,QAAQ;GACV;EACF,CAAC;CACH,CAAC;AACH;;;ACnvCA,IAAM,cAAN,MAAqB;CAIC;CAHpB,2BAAmB,IAAI,IAAgB;CACvC,WAAmB;CAEnB,YAAY,SAAwC;EAAhC,KAAA,UAAA;CAAiC;CAErD,KAAK,OAAgB;EACnB,IAAI,KAAK,UAAU;EAGnB,MAAM,WAAW,MAAM,KAAK,KAAK,QAAQ;EACzC,KAAK,MAAM,WAAW,UACpB,IAAI;GACF,QAAQ,KAAgB;EAC1B,SAAS,KAAK;GAEZ,IAAI,KAAK,SACP,IAAI;IACF,KAAK,QAAQ,GAAG;GAClB,QAAQ;IAGN,QAAQ,MAAM,oDAAoD,GAAG;GACvE;QAGA,QAAQ,MAAM,iCAAiC,GAAG;EAEtD;CAEJ;CAEA,GAAG,SAAyC;EAC1C,IAAI,KAAK,UAAU,aAAa,CAAC;EACjC,MAAM,UAAU;EAChB,KAAK,SAAS,IAAI,OAAO;EACzB,aAAa;GACX,KAAK,SAAS,OAAO,OAAO;EAC9B;CACF;CAEA,KAAK,SAAyC;EAC5C,IAAI,KAAK,UAAU,aAAa,CAAC;EACjC,MAAM,WAAuB,UAAU;GACrC,KAAK,SAAS,OAAO,OAAO;GAC5B,QAAQ,KAAU;EACpB;EACA,KAAK,SAAS,IAAI,OAAO;EACzB,aAAa;GACX,KAAK,SAAS,OAAO,OAAO;EAC9B;CACF;CAEA,UAAgB;EACd,IAAI,KAAK,UAAU;EACnB,KAAK,WAAW;EAChB,KAAK,SAAS,MAAM;CACtB;AACF;;;;;;;;;;;;AAaA,SAAgB,cAAwB,SAA0D;CAChG,MAAM,OAAO,IAAI,YAAe,SAAS,OAAO;CAChD,OAAO;EACL,QAAQ,UAAc,KAAK,KAAK,KAAU;EAC1C,KAAK,YAAY,KAAK,GAAG,OAAO;EAChC,OAAO,YAAY,KAAK,KAAK,OAAO;EACpC,eAAe,KAAK,QAAQ;CAC9B;AACF;;;;;;;;AChGA,SAAS,mBAAmB,QAAmC;CAC7D,IAAI,UAAU,MAAM,OAAO,CAAC;CAC5B,IAAI,OAAO,WAAW,UAAU,OAAO,CAAC,MAAM;CAC9C,OAAO,OAAO,KAAK,UAAU,MAAM,OAAO;AAC5C;;;;;;;;AASA,SAAS,oBAAoB,GAAY,GAAqB;CAC5D,IAAI,OAAO,GAAG,GAAG,CAAC,GAAG,OAAO;CAC5B,IAAI,MAAM,QAAQ,MAAM,QAAQ,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU,OAAO;CACvF,IAAI,MAAM,QAAQ,CAAC,GAAG;EACpB,IAAI,CAAC,MAAM,QAAQ,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,OAAO;EACvD,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,IAAI,CAAC,oBAAoB,EAAE,IAAI,EAAE,EAAE,GAAG,OAAO;EAE/C,OAAO;CACT;CACA,IAAI,MAAM,QAAQ,CAAC,GAAG,OAAO;CAC7B,MAAM,SAAS,OAAO,eAAe,CAAC;CACtC,MAAM,SAAS,OAAO,eAAe,CAAC;CAEtC,IAAI,WAAW,OAAO,aAAa,WAAW,MAAM,OAAO;CAC3D,IAAI,WAAW,OAAO,aAAa,WAAW,MAAM,OAAO;CAC3D,MAAM,QAAQ,OAAO,KAAK,CAA4B;CACtD,MAAM,QAAQ,OAAO,KAAK,CAA4B;CACtD,IAAI,MAAM,WAAW,MAAM,QAAQ,OAAO;CAC1C,KAAK,MAAM,KAAK,OAAO;EACrB,IAAI,CAAC,OAAO,OAAO,GAAa,CAAC,GAAG,OAAO;EAC3C,IACE,CAAC,oBAAqB,EAA8B,IAAK,EAA8B,EAAE,GAEzF,OAAO;CAEX;CACA,OAAO;AACT;AA6CA,IAAM,YAAN,MAAuC;CACrC;;;;;;;CAOA;;;;;CAKA;;;;;;;;;CASA;CACA;CACA;CACA;CACA;CACA;;;;;;;;;CASA;CACA;CAEA;;;CAGA;CACA,mBAAgD;CAChD,eAA+C;CAC/C,QAAgB;CAChB,WAAmB;CACnB,gBAAmD;CACnD,mBAA0D;CAC1D;;;;;;CAMA;CAEA,YAAY,SAAY,aAA0C,CAAC,GAAG,SAAwB;EAC5F,KAAK,UAAU;EACf,KAAK,aAAa;EAKlB,KAAK,mBAAmB,SAAS,oBAAoB;EACrD,KAAK,aAAa,SAAS,cAAc;EACzC,KAAK,SAAS,OAAO,OAAO;EAC5B,KAAK,mBAAmB,OAAiB,CAAC,CAAC;EAC3C,KAAK,gBAAgB,OAAiB,CAAC,CAAC;EACxC,KAAK,cAAc,OAAiB,CAAC,CAAC;EACtC,KAAK,WAAW,OAAO,KAAK;EAC5B,KAAK,SAAS,OAAO,KAAK;EAC1B,KAAK,cAAc,OAAO,KAAK;EAC/B,KAAK,aAAa,OAAO,IAAI;EAC7B,KAAK,qBAAqB,OAAO,CAAC;EAGlC,KAAK,oBAAoB,OAAO,KAAK,eAAe,QAAQ;EAC5D,KAAK,UAAU,eAAe;GAC5B,MAAM,IAAI,KAAK,iBAAiB;GAChC,MAAM,IAAI,KAAK,cAAc;GAC7B,MAAM,IAAI,KAAK,YAAY;GAC3B,IAAI,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG,OAAO;GAC7C,IAAI,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG,OAAO;GAC7C,IAAI,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG,OAAO;GAC7C,OAAO;IAAC,GAAG;IAAG,GAAG;IAAG,GAAG;GAAC;EAC1B,CAAC;EACD,KAAK,WAAW,eAGd,KAAK,YAAY,QAAQ,KAAK,WAAW,QAAQ,KAAK,QAAQ,MAAM,WAAW,CACjF;EAEA,IAAI,WAAW,SAAS,GACtB,KAAK,mBAAmB,aAAa;GACnC,KAAK,cAAc;EACrB,CAAC;CAEL;;;;;CAMA,2BAA2B,UAA+C;EACxE,KAAK,mBAAmB;CAC1B;CAGA,IAAI,QAAW;EACb,OAAO,KAAK,OAAO;CACrB;CAEA,OAAU;EACR,OAAO,KAAK,OAAO,KAAK;CAC1B;CAEA,UAAU,SAAyC;EACjD,OAAO,KAAK,OAAO,UAAU,OAAO;CACtC;CAEA,iBAAiB,SAAyC;EACxD,OAAO,KAAK,OAAO,iBAAiB,OAAO;CAC7C;CAGA,IAAI,SAA+B;EACjC,OAAO,KAAK;CACd;CAEA,IAAI,UAA+B;EACjC,OAAO,KAAK;CACd;CAEA,IAAI,UAA+B;EACjC,OAAO,KAAK;CACd;CAEA,IAAI,UAA+B;EACjC,OAAO,KAAK;CACd;CAEA,IAAI,eAAoC;EACtC,OAAO,KAAK;CACd;CAGA,IAAI,OAAgB;EAClB,IAAI,KAAK,UAAU;EACnB,YAAY;GACV,KAAK,OAAO,IAAI,KAAK;GAKrB,KAAK,OAAO,IAAI,CAAC,oBAAoB,OAAO,KAAK,OAAO,CAAC;GAKzD,IAAI,KAAK,cAAc,KAAK,EAAE,SAAS,GAAG,KAAK,cAAc,IAAI,CAAC,CAAC;EACrE,CAAC;CACH;CAEA,UAAU,QAAqC;EAC7C,IAAI,KAAK,UAAU;EACnB,MAAM,OAAO,OAAO,WAAW,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM;EAClD,KAAK,cAAc,IAAI,IAAI;CAC7B;;;;;;;;CASA,cAAc,QAAqC;EACjD,IAAI,KAAK,UAAU;EACnB,IAAI,KAAK,YAAY,KAAK,EAAE,WAAW,KAAK,OAAO,WAAW,GAAG;EACjE,KAAK,YAAY,IAAI,OAAO,WAAW,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;CAC7D;;;;;;;;CASA,aAAa,OAAgB;EAC3B,IAAI,KAAK,UAAU;EACnB,KAAK,UAAU;EACf,YAAY;GACV,KAAK,OAAO,IAAI,KAAK;GACrB,KAAK,OAAO,IAAI,KAAK;GAIrB,IAAI,KAAK,cAAc,KAAK,EAAE,SAAS,GAAG,KAAK,cAAc,IAAI,CAAC,CAAC;GAGnE,IAAI,KAAK,YAAY,KAAK,EAAE,SAAS,GAAG,KAAK,YAAY,IAAI,CAAC,CAAC;EACjE,CAAC;CACH;CAEA,QAAc;EACZ,IAAI,KAAK,UAAU;EACnB,KAAK,cAAc,MAAM;EACzB,KAAK,eAAe;EACpB,YAAY;GACV,KAAK,OAAO,IAAI,KAAK,OAAO;GAC5B,KAAK,OAAO,IAAI,KAAK;GACrB,KAAK,SAAS,IAAI,KAAK;GACvB,KAAK,iBAAiB,IAAI,CAAC,CAAC;GAC5B,KAAK,cAAc,IAAI,CAAC,CAAC;GACzB,KAAK,YAAY,IAAI,CAAC,CAAC;GACvB,KAAK,YAAY,IAAI,KAAK;GAI1B,IAAI,KAAK,eAAe,UAAU,KAAK,kBAAkB,IAAI,KAAK;EACpE,CAAC;CACH;CAEA,cAAoB;EAClB,IAAI,KAAK,UAAU;EACnB,KAAK,SAAS,IAAI,IAAI;EAGtB,IAAI,KAAK,eAAe,UAAU,CAAC,KAAK,kBAAkB,KAAK,GAC7D,KAAK,kBAAkB,IAAI,IAAI;CAEnC;CAEA,MAAM,aAA+B;EACnC,IAAI,KAAK,UAAU,OAAO,KAAK,SAAS,KAAK;EAG7C,IAAI,CAAC,KAAK,kBAAkB,KAAK,GAAG,KAAK,kBAAkB,IAAI,IAAI;EAEnE,KAAK,mBAAmB,QAAQ,MAAM,IAAI,CAAC;EAC3C,MAAM,KAAK,iBAAiB;EAC5B,OAAO,KAAK,SAAS,KAAK;CAC5B;CAEA,UAAgB;EACd,IAAI,KAAK,UAAU;EACnB,KAAK,WAAW;EAChB,KAAK,mBAAmB;EACxB,KAAK,mBAAmB;EACxB,KAAK,cAAc,MAAM;EACzB,KAAK,eAAe;EACpB,KAAK,gBAAgB;CACvB;;;;;;;CAQA,kBAAkB,OAAwC;EACxD,KAAK,gBAAgB;CACvB;CAEA,cAAsB,OAAgB,QAAiC,CAWvE;CAGA,MAAc,mBAAkC;EAE9C,IAAI,CAAC,KAAK,YAAY,KAAK,GAAG;EAC9B,MAAM,IAAI,SAAe,YAAY;GACnC,MAAM,QAAQ,KAAK,YAAY,WAAW,MAAM;IAC9C,IAAI,CAAC,GAAG;KACN,MAAM;KACN,QAAQ;IACV;GACF,CAAC;EACH,CAAC;CACH;CAEA,gBAA8B;EAC5B,IAAI,KAAK,UAAU;EAGnB,MAAM,QAAQ,KAAK,OAAO;EAC1B,KAAU,mBAAmB;EAI7B,IAAI,CAAC,KAAK,kBAAkB,OAAO;GACjC,YAAY;IACV,IAAI,KAAK,iBAAiB,KAAK,EAAE,SAAS,GAAG,KAAK,iBAAiB,IAAI,CAAC,CAAC;IACzE,IAAI,KAAK,YAAY,KAAK,GAAG,KAAK,YAAY,IAAI,KAAK;IACvD,KAAK,WAAW,IAAI,KAAK,QAAQ,KAAK,EAAE,WAAW,CAAC;GACtD,CAAC;GACD;EACF;EAGA,KAAK,cAAc,MAAM;EACzB,MAAM,QAAQ,IAAI,gBAAgB;EAClC,KAAK,eAAe;EACpB,MAAM,OAAO,EAAE,KAAK;EAEpB,MAAM,aAAuB,CAAC;EAC9B,MAAM,gBAA4C,CAAC;EAEnD,KAAK,MAAM,aAAa,KAAK,YAC3B,IAAI;GACF,MAAM,SAAS,UAAU,OAAO,MAAM,MAAM;GAC5C,IAAI,kBAAkB,SAIpB,cAAc,KAAK,MAAM;QACpB;IAIL,MAAM,OAAO,mBAAmB,MAAM;IACtC,IAAI,KAAK,SAAS,GAAG,WAAW,KAAK,GAAG,IAAI;GAC9C;EACF,SAAS,KAAK;GAOZ,IAAI;IACF,KAAK,mBAAmB,GAAG;GAC7B,QAAQ,CAER;GACA,WAAW,KACsD,mBACjE;EACF;EAGF,IAAI,WAAW,SAAS,GAAG;GACzB,YAAY;IACV,KAAK,iBAAiB,IAAI,UAAU;IACpC,KAAK,YAAY,IAAI,KAAK;IAC1B,KAAK,WAAW,IAAI,KAAK,QAAQ,KAAK,EAAE,WAAW,CAAC;GACtD,CAAC;GACD,KAAK,cAAc,OAAO,UAAU;GACpC;EACF;EAEA,IAAI,cAAc,WAAW,GAAG;GAC9B,YAAY;IACV,KAAK,iBAAiB,IAAI,CAAC,CAAC;IAC5B,KAAK,YAAY,IAAI,KAAK;IAC1B,KAAK,WAAW,IAAI,KAAK,QAAQ,KAAK,EAAE,WAAW,CAAC;GACtD,CAAC;GACD,KAAK,cAAc,MAAM,CAAC,CAAC;GAC3B;EACF;EAEA,YAAY;GACV,KAAK,iBAAiB,IAAI,CAAC,CAAC;GAC5B,KAAK,YAAY,IAAI,IAAI;EAC3B,CAAC;EAED,QAAQ,WAAW,aAAa,EAAE,MAAM,YAAY;GAClD,IAAI,SAAS,KAAK,SAAS,KAAK,UAAU;GAC1C,MAAM,cAAwB,CAAC;GAC/B,KAAK,MAAM,KAAK,SACd,IAAI,EAAE,WAAW,aACf,YAAY,KAAK,GAAG,mBAAmB,EAAE,KAAK,CAAC;QAC1C,IAAI,CAAC,aAAa,EAAE,MAAM,GAAG;IAClC,MAAM,MAAM,EAAE,kBAAkB,QAAQ,EAAE,OAAO,UAAU,OAAO,EAAE,MAAM;IAC1E,YAAY,KAAK,GAAG;GACtB;GAEF,YAAY;IACV,KAAK,iBAAiB,IAAI,WAAW;IACrC,KAAK,YAAY,IAAI,KAAK;IAC1B,KAAK,WAAW,IAAI,KAAK,QAAQ,KAAK,EAAE,WAAW,CAAC;GACtD,CAAC;GACD,KAAK,cAAc,YAAY,WAAW,GAAG,WAAW;EAC1D,CAAC;CACH;AACF;;;;;;AAOA,SAAgB,uBAA0B,OAAiB,OAAwC;CACjG,MAAM,OAAO;CACb,IAAI,OAAO,KAAK,sBAAsB,YACpC,KAAK,kBAAkB,KAAK;AAEhC;;;;;;;AAQA,SAAgB,gCACd,OACA,UACM;CACN,MAAM,OAAO;CACb,IAAI,OAAO,KAAK,+BAA+B,YAC7C,KAAK,2BAA2B,QAAQ;AAE5C;AAEA,SAAgB,YACd,SACA,YACA,SACU;CACV,OAAO,IAAI,UAAU,SAAS,YAAY,OAAO;AACnD;;;;;;;;AA8BA,SAAgB,mBACd,IACA,IAC2D;CAM3D,QAAQ,OAAO,WACb,IAAI,SAAwB,SAAS,WAAW;EAC9C,IAAI,OAAO,SAAS;GAClB,OAAO,IAAI,aAAa,WAAW,YAAY,CAAC;GAChD;EACF;EACA,MAAM,QAAQ,iBAAiB;GAC7B,OAAO,oBAAoB,SAAS,OAAO;GAC3C,GAAG,OAAO,MAAM,EAAE,KAAK,SAAS,MAAM;EACxC,GAAG,EAAE;EACL,MAAM,gBAAgB;GACpB,aAAa,KAAK;GAClB,OAAO,oBAAoB,SAAS,OAAO;GAC3C,OAAO,IAAI,aAAa,WAAW,YAAY,CAAC;EAClD;EACA,OAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;CAC1D,CAAC;AACL;;;ACxjBA,MAAM,aAAa,OAAO,IAAI,WAAW;AACzC,MAAM,oBAAoB,OAAO,IAAI,iBAAiB;AAEtD,MAAM,UAAU,MACd,OAAO,MAAM,YAAY,MAAM,QAAS,EAA8B,gBAAgB;AAExF,MAAM,gBAAgB,MACpB,OAAO,MAAM,YAAY,MAAM,QAAS,EAA8B,uBAAuB;;;;;;;;AAe/F,SAAS,YAAY,MAAe,UAAmD;CACrF,IAAI,SAAkB;CACtB,KAAK,MAAM,OAAO,UAAU;EAC1B,IAAI,WAAW,KAAA,KAAa,WAAW,MAAM,OAAO,KAAA;EACpD,IAAI,OAAO,MAAM,GACf,SAAU,OAAO,OAAmC,OAAO,GAAG;OACzD,IAAI,aAAa,MAAM,GAAG;GAC/B,MAAM,MAAM,OAAO,GAAG;GACtB,IAAI,CAAC,OAAO,UAAU,GAAG,KAAK,MAAM,GAAG,OAAO,KAAA;GAC9C,SAAU,OAAsC,GAAG,GAAG;EACxD,OACE;CAEJ;CACA,OAAO;AACT;;;;;;AAOA,SAAS,aAAa,KAAkB,QAA+B;CACrE,IAAI,UAAU,MAAM;CACpB,IAAI,OAAO,WAAW,UAAU;EAC9B,IAAI,KAAK;GAAE,MAAM,CAAC;GAAG,SAAS;EAAO,CAAC;EACtC;CACF;CACA,KAAK,MAAM,SAAS,QAAQ,IAAI,KAAK,KAAK;AAC5C;;;;;;;;;;AAWA,SAAS,gBACP,MACA,QACA,iBACA,aACsB;CACtB,MAAM,WAAqB,CAAC;CAC5B,MAAM,2BAAW,IAAI,IAA+B;CACpD,KAAK,MAAM,SAAS,QAAQ;EAC1B,IAAI,MAAM,KAAK,WAAW,GAAG;GAC3B,SAAS,KAAK,MAAM,OAAO;GAC3B;EACF;EACA,MAAM,SAAS,YAAY,MAAM,MAAM,IAAI;EAC3C,IAAI,WAAW,KAAA,KAAa,OAAO,OAAO,kBAAkB,YAAY;GAEtE,SAAS,KAAK,MAAM,OAAO;GAC3B;EACF;EACA,MAAM,OAAO,SAAS,IAAI,MAAM;EAChC,IAAI,MAAM,KAAK,KAAK,MAAM,OAAO;OAC5B,SAAS,IAAI,QAAQ,CAAC,MAAM,OAAO,CAAC;CAC3C;CACA,gBAAgB,IAAI,QAAQ;CAC5B,KAAK,MAAM,KAAK,aACd,IAAI,CAAC,SAAS,IAAI,CAAC,GAAG,EAAE,gBAAgB,CAAC,CAAC;CAE5C,KAAK,MAAM,CAAC,GAAG,SAAS,UAAU,EAAE,gBAAgB,IAAI;CACxD,OAAO,IAAI,IAAI,SAAS,KAAK,CAAC;AAChC;AAEA,IAAM,WAAN,MAAwD;CACtD,CAAU,cAAc;CAExB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;;;;;;;;CAQA;CAEA,kBAAqD,OAAO,CAAC,CAAC;;;;;;;;CAQ9D,oBAAuD,OAAO,CAAC,CAAC;CAChE,iBAAgD,eAAe;EAC7D,MAAM,MAAM,KAAK,gBAAgB;EACjC,MAAM,SAAS,KAAK,kBAAkB;EACtC,IAAI,OAAO,WAAW,GAAG,OAAO;EAChC,IAAI,IAAI,WAAW,GAAG,OAAO;EAC7B,OAAO,CAAC,GAAG,KAAK,GAAG,MAAM;CAC3B,CAAC;CACD,sBAAwD,OAAO,KAAK;;CAEpE,uCAAqD,IAAI,IAAI;CAG7D,gBAAkD,OAAO,KAAK;CAC9D,eAAgD,OAAO,CAAC;CACxD,eAAiD,OAAO,KAAA,CAAS;CACjE,eAA6C,KAAK;CAClD,cAA2C,KAAK;CAChD,cAA4C,KAAK;CAEjD;CACA;CACA,mBAAgD;CAChD,iBAA8C;CAC9C,sBAA8B;CAC9B,wBAAwD;CACxD,WAAmB;CACnB,mBAA4D;;CAG5D,2BAA2B,UAAiD;EAC1E,KAAK,mBAAmB;CAC1B;CAEA,YACE,QACA,SACA,iBACA;EACA,KAAK,SAAS;EACd,KAAK,UAAU;EACf,KAAK,aAAa,SAAS,cAAc,CAAC;EAG1C,KAAK,mBAAmB,iBAAiB,oBAAoB;EAM7D,IAAI,SAAS,YAAY,KAAA,GACvB,IAAI,OAAO,QAAQ,YAAY,YAAY;GACzC,MAAM,YAAY,QAAQ;GAC1B,MAAM,OAAO,QAAQ,wBAAwB;GAC7C,IAAI,WAAW;GACf,KAAK,iBAAiB,aAAa;IAIjC,MAAM,MAAM,UAAU;IACtB,IAAI,QAAQ,KAAA,GAAW;IACvB,gBAAgB;KACd,IAAI,KAAK,UAAU;KACnB,IAAI,UAAU;MACZ,WAAW;MACX,KAAK,aAAa,KAAkC,IAAI;MACxD;KACF;KACA,IAAI,SAAS,SAAS;KACtB,IAAI,SAAS,gBAAgB,KAAK,QAAQ,KAAK,GAAG;KAClD,KAAK,aAAa,KAAkC,IAAI;IAC1D,CAAC;GACH,CAAC;EACH,OACE,KAAK,aAAa,QAAQ,SAAsC,IAAI;EAIxE,KAAK,QAAQ,eAAe,KAAK,aAAa,CAAC;EAC/C,KAAK,SAAS,eAAe,KAAK,cAAc,CAAC;EACjD,KAAK,UAAU,eAAe,KAAK,YAAY,SAAS,CAAC;EACzD,KAAK,UAAU,eAAe,KAAK,YAAY,SAAS,CAAC;EACzD,KAAK,eAAe,eAAe;GACjC,IAAI,KAAK,oBAAoB,OAAO,OAAO;GAC3C,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,MAAM,GAC3C,IAAK,MAAgD,aAAa,OAAO,OAAO;GAElF,OAAO;EACT,CAAC;EACD,KAAK,UAAU,eAAe;GAG5B,IAAI,KAAK,eAAe,MAAM,SAAS,GAAG,OAAO;GACjD,IAAI,KAAK,aAAa,OAAO,OAAO;GACpC,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,MAAM,GAC3C,IAAI,CAAE,MAA2C,QAAQ,OAAO,OAAO;GAEzE,OAAO;EACT,CAAC;EACD,KAAK,aAAa,eAAe,KAAK,kBAAkB,CAAC;EACzD,KAAK,cAAc,eAAe;GAChC,MAAM,MAAgB,CAAC;GACvB,mBAAmB,KAAK,QAAQ,IAAI,GAAG;GACvC,OAAO;EACT,CAAC;EAED,IAAI,KAAK,WAAW,SAAS,GAC3B,KAAK,mBAAmB,aAAa,KAAK,sBAAsB,CAAC;CAErE;CAEA,eAAqC;EACnC,MAAM,MAA+B,CAAC;EACtC,KAAK,MAAM,CAAC,GAAG,UAAU,OAAO,QAAQ,KAAK,MAAM,GACjD,IAAI,OAAO,KAAK,KAAK,aAAa,KAAK,GACrC,IAAI,KAAM,MAAyC,MAAM;OAGzD,IAAI,KAAM,MAAyB;EAGvC,OAAO;CACT;CAEA,gBAAuC;EACrC,MAAM,MAA+B,CAAC;EACtC,KAAK,MAAM,CAAC,GAAG,UAAU,OAAO,QAAQ,KAAK,MAAM,GACjD,IAAI,OAAO,KAAK,GACd,IAAI,KAAK,MAAM,OAAO;OACjB,IAAI,aAAa,KAAK,GAC3B,IAAI,KAAK,MAAM,OAAO;OACjB;GACL,MAAM,OAAQ,MAAyB,OAAO;GAC9C,IAAI,KAAK,KAAK,SAAS,IAAI,OAAO,KAAA;EACpC;EAEF,OAAO;CACT;CAEA,YAAoB,KAAqC;EACvD,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,MAAM,GAE3C,IADa,MAAyD,MAC7D,OAAO,OAAO;EAEzB,OAAO;CACT;CAEA,oBAAuE;EACrE,MAAM,MAAiD,CAAC;EACxD,MAAM,MAAM,KAAK,eAAe;EAChC,IAAI,IAAI,SAAS,GAAG,IAAI,KAAK;GAAE,MAAM;GAAI,QAAQ;EAAI,CAAC;EACtD,WAAW,KAAK,QAAQ,IAAI,GAAG;EAC/B,OAAO;CACT;CAEA,IAAI,SAA0C;EAC5C,IAAI,KAAK,UAAU;EACnB,YAAY,KAAK,aAAa,SAAS,KAAK,CAAC;CAC/C;CAEA,aAAqB,SAAoC,WAA0B;EACjF,KAAK,MAAM,CAAC,GAAG,QAAQ,OAAO,QAAQ,OAAO,GAAG;GAC9C,MAAM,QAAS,KAAK,OAAmC;GACvD,IAAI,CAAC,OAAO;GAIZ,IAAI,QAAQ,KAAA,GAAW;GACvB,IAAI,OAAO,KAAK,GAGd,IAAI,WACD,MAA4B,iBAAiB,GAAyC;QAEvF,MAAM,IAAI,GAAyC;QAEhD,IAAI,aAAa,KAAK,GAAG;IAC9B,MAAM,MAAM;IACZ,MAAM,YAAY;IAClB,IAAI,WAAW;KAGb,IAAI,MAAM;KACV,KAAK,MAAM,WAAW,WACpB,IAAI,IAAI,OAAsC;KAI/C,IAIC,oBAAoB,SAAS;IACjC,OAAO;KAIL,MAAM,UAAU,IAAI,MAAM,KAAK;KAC/B,MAAM,UAAU,KAAK,IAAI,QAAQ,QAAQ,UAAU,MAAM;KACzD,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;MAChC,MAAM,OAAO,QAAQ;MACrB,MAAM,IAAI,UAAU;MACpB,IAAI,OAAO,IAAI,GACb,KAAK,IAAI,CAAuC;WAE/C,KAAyB,IAAI,CAAC;KAEnC;KACA,KAAK,IAAI,IAAI,QAAQ,QAAQ,IAAI,UAAU,QAAQ,KACjD,IAAI,IAAI,UAAU,EAAiC;KAErD,KAAK,IAAI,IAAI,QAAQ,SAAS,GAAG,KAAK,UAAU,QAAQ,KACtD,IAAI,OAAO,CAAC;IAEhB;GACF,OAAO;IACL,MAAM,IAAI;IACV,IAAI,WAAW,EAAE,aAAa,GAAG;SAC5B,EAAE,IAAI,GAAG;GAChB;EACF;CACF;;CAGA,iBAAiB,SAA0C;EACzD,IAAI,KAAK,UAAU;EACnB,YAAY,KAAK,aAAa,SAAS,IAAI,CAAC;CAC9C;CAEA,QAAc;EACZ,IAAI,KAAK,UAAU;EACnB,YAAY;GACV,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,MAAM,GAC3C,IAAI,OAAO,KAAK,KAAK,aAAa,KAAK,GACpC,MAAiC,MAAM;QAEvC,MAA0B,MAAM;GAGrC,KAAK,gBAAgB,IAAI,CAAC,CAAC;GAC3B,KAAK,kBAAkB,IAAI,CAAC,CAAC;GAM7B,KAAK,aAAa,IAAI,CAAC;GACvB,KAAK,aAAa,IAAI,KAAA,CAAS;GAK/B,IAAI,KAAK,SAAS,YAAY,KAAA,GAAW;IACvC,MAAM,MACJ,OAAO,KAAK,QAAQ,YAAY,aAAa,KAAK,QAAQ,QAAQ,IAAI,KAAK,QAAQ;IACrF,IAAI,QAAQ,KAAA,GAAW,KAAK,aAAa,KAAkC,IAAI;GACjF;EACF,CAAC;CACH;CAEA,iBAAuB;EACrB,IAAI,KAAK,UAAU;EACnB,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,MAAM,GAC3C,IAAI,OAAO,KAAK,GAAG,MAAM,eAAe;OACnC,IAAI,aAAa,KAAK,GAAG,MAAM,eAAe;OAC9C,MAA0B,YAAY;CAE/C;CAEA,MAAM,WAA6B;EACjC,IAAI,KAAK,UAAU,OAAO,KAAK,QAAQ,KAAK;EAC5C,MAAM,QAA4B,CAAC;EACnC,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,MAAM,GAC3C,IAAI,OAAO,KAAK,KAAK,aAAa,KAAK,GACrC,MAAM,KAAM,MAA+C,SAAS,CAAC;OAErE,MAAM,KAAM,MAAyB,WAAW,CAAC;EAGrD,MAAM,QAAQ,IAAI,KAAK;EAIvB,IAAI,KAAK,WAAW,SAAS,GAC3B,KAAK,sBAAsB;EAG7B,IAAI,KAAK,oBAAoB,KAAK,GAChC,MAAM,IAAI,SAAe,YAAY;GACnC,MAAM,QAAQ,KAAK,oBAAoB,WAAW,MAAM;IACtD,IAAI,CAAC,GAAG;KACN,MAAM;KACN,QAAQ;IACV;GACF,CAAC;EACH,CAAC;EAEH,OAAO,KAAK,QAAQ,KAAK;CAC3B;;;;;;;;;;;;;;;;CAiBA,MAAM,OACJ,SACA,SAK8D;EAC9D,IAAI,KAAK,UAAU,OAAO;GAAE,IAAI;GAAO,uBAAO,IAAI,MAAM,kBAAkB;EAAE;EAK5E,IAAI,KAAK,cAAc,KAAK,GAC1B,OAAO;GAAE,IAAI;GAAO,uBAAO,IAAI,MAAM,4BAA4B;EAAE;EAGrE,MAAM,gBAAgB,SAAS,wBAAwB;EACvD,MAAM,cAAc,SAAS,WAAW;EAExC,YAAY;GACV,KAAK,aAAa,QAAQ,MAAM,IAAI,CAAC;GACrC,KAAK,aAAa,IAAI,KAAA,CAAS;GAC/B,KAAK,cAAc,IAAI,IAAI;EAC7B,CAAC;EAED,IAAI;GACF,IAAI;QAEE,CAAC,MADY,KAAK,SAAS,GACtB;KACP,KAAK,eAAe;KACpB,KAAK,cAAc,IAAI,KAAK;KAC5B,OAAO,EAAE,IAAI,MAAM;IACrB;;GAEF,MAAM,SAAU,MAAM,QAAQ,KAAK,MAAM,KAAK,CAAC;GAC/C,IAAI,SAAS,gBAAgB,KAAK,MAAM;GACxC,KAAK,cAAc,IAAI,KAAK;GAC5B,OAAO;IAAE,IAAI;IAAM,MAAM;GAAO;EAClC,SAAS,KAAK;GACZ,YAAY;IACV,KAAK,aAAa,IAAI,GAAG;IACzB,KAAK,cAAc,IAAI,KAAK;GAC9B,CAAC;GACD,IAAI,gBAAgB,WAAW,MAAM;GACrC,OAAO;IAAE,IAAI;IAAO,OAAO;GAAI;EACjC;CACF;;;;;;;;;CAUA,UAAU,QAAqD;EAC7D,IAAI,KAAK,UAAU;EACnB,YAAY;GACV,KAAK,MAAM,CAAC,MAAM,SAAS,OAAO,QAAQ,MAAM,GAAG;IACjD,MAAM,SAAS,KAAK,YAAY,IAAI;IACpC,IAAI,WAAW,KAAA,GAAW;IAC1B,IAAK,OAAmC,cAAc,KAAA,GAAW;IAChE,OAA8D,UAAU,IAAI;GAC/E;EACF,CAAC;CACH;;;;;;;CAQA,cAAc,QAAqC;EACjD,IAAI,KAAK,UAAU;EACnB,IAAI,KAAK,kBAAkB,KAAK,EAAE,WAAW,KAAK,OAAO,WAAW,GAAG;EACvE,KAAK,kBAAkB,IAAI,OAAO,WAAW,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;CACnE;;;;;;;;;;;;;CAcA,aAAa,MAAoB;EAC/B,IAAI,KAAK,UAAU;EACnB,IAAI,SAAS,IAAI;GACf,KAAK,MAAM;GACX;EACF;EACA,MAAM,SAAS,KAAK,YAAY,IAAI;EACpC,IAAI,WAAW,KAAA,GAAW;EAC1B,IAAI,OAAO,OAAO,UAAU,YAAY,OAAO,MAAM;CACvD;CAEA,YAAoB,MAAuB;EACzC,IAAI,SAAS,IAAI,OAAO,KAAA;EACxB,MAAM,WAAW,UAAU,IAAI;EAC/B,IAAI,aAAa,MAAM,OAAO,KAAA;EAC9B,IAAI,SAAkB;EACtB,KAAK,MAAM,OAAO,UAAU;GAC1B,IAAI,WAAW,KAAA,KAAa,WAAW,MAAM,OAAO,KAAA;GACpD,IAAI,OAAO,MAAM,GAAG;IAClB,SAAU,OAAO,OAAmC;IACpD;GACF;GACA,IAAI,aAAa,MAAM,GAAG;IACxB,MAAM,MAAM,OAAO,GAAG;IACtB,IAAI,CAAC,OAAO,UAAU,GAAG,KAAK,MAAM,GAAG,OAAO,KAAA;IAC9C,SAAU,OAAsC,GAAG,GAAG;IACtD;GACF;GAEA,IAAI,WAAW,MAAM;IACnB,SAAU,KAAK,OAAmC;IAClD;GACF;GACA;EACF;EACA,OAAO;CACT;CAEA,UAAgB;EACd,IAAI,KAAK,UAAU;EACnB,KAAK,WAAW;EAChB,KAAK,mBAAmB;EACxB,KAAK,iBAAiB;EACtB,KAAK,uBAAuB,MAAM;EAClC,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,MAAM,GAC1C,MAAoC,UAAU;CAEnD;CAEA,wBAAsC;EACpC,IAAI,KAAK,UAAU;EACnB,MAAM,QAAQ,KAAK,MAAM;EACzB,KAAK,uBAAuB,MAAM;EAClC,MAAM,QAAQ,IAAI,gBAAgB;EAClC,KAAK,wBAAwB;EAC7B,MAAM,OAAO,EAAE,KAAK;EAEpB,MAAM,aAA0B,CAAC;EACjC,MAAM,gBAA4C,CAAC;EACnD,KAAK,MAAM,KAAK,KAAK,YACnB,IAAI;GACF,MAAM,IAAI,EAAE,OAAO,MAAM,MAAM;GAC/B,IAAI,aAAa,SAAS,cAAc,KAAK,CAAC;QACzC,aAAa,YAAY,CAAC;EACjC,SAAS,KAAK;GACZ,IAAI;IACF,KAAK,mBAAmB,GAAG;GAC7B,QAAQ,CAER;GAGA,WAAW,KAAK;IACd,MAAM,CAAC;IACP,SAII;GACN,CAAC;EACH;EAGF,IAAI,WAAW,SAAS,GAAG;GACzB,YAAY;IACV,KAAK,uBAAuB,gBAC1B,MACA,YACA,KAAK,iBACL,KAAK,oBACP;IACA,KAAK,oBAAoB,IAAI,KAAK;GACpC,CAAC;GACD;EACF;EAEA,IAAI,cAAc,WAAW,GAAG;GAC9B,YAAY;IACV,KAAK,uBAAuB,gBAC1B,MACA,CAAC,GACD,KAAK,iBACL,KAAK,oBACP;IACA,KAAK,oBAAoB,IAAI,KAAK;GACpC,CAAC;GACD;EACF;EAEA,YAAY;GACV,KAAK,uBAAuB,gBAC1B,MACA,CAAC,GACD,KAAK,iBACL,KAAK,oBACP;GACA,KAAK,oBAAoB,IAAI,IAAI;EACnC,CAAC;EAED,QAAQ,WAAW,aAAa,EAAE,MAAM,YAAY;GAClD,IAAI,SAAS,KAAK,uBAAuB,KAAK,UAAU;GACxD,MAAM,SAAsB,CAAC;GAC7B,KAAK,MAAM,KAAK,SACd,IAAI,EAAE,WAAW,aAAa,aAAa,QAAQ,EAAE,KAAK;GAE5D,YAAY;IACV,KAAK,uBAAuB,gBAC1B,MACA,QACA,KAAK,iBACL,KAAK,oBACP;IACA,KAAK,oBAAoB,IAAI,KAAK;GACpC,CAAC;EACH,CAAC;CACH;AACF;;;;;;;AAQA,SAAS,UAAU,MAA+B;CAChD,MAAM,MAAgB,CAAC;CACvB,IAAI,UAAU;CACd,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,KAAK,KAAK;EAChB,IAAI,OAAO,KAAK;GACd,IAAI,YAAY,IAAI;IAClB,IAAI,KAAK,OAAO;IAChB,UAAU;GACZ;GACA;EACF;EACA,IAAI,OAAO,KAAK;GACd,IAAI,YAAY,IAAI;IAClB,IAAI,KAAK,OAAO;IAChB,UAAU;GACZ;GACA,MAAM,QAAQ,KAAK,QAAQ,KAAK,IAAI,CAAC;GACrC,IAAI,UAAU,IAAI,OAAO;GACzB,MAAM,MAAM,KAAK,MAAM,IAAI,GAAG,KAAK;GACnC,IAAI,QAAQ,MAAM,CAAC,QAAQ,KAAK,GAAG,GAAG,OAAO;GAC7C,IAAI,KAAK,GAAG;GACZ,IAAI;GACJ;EACF;EACA,IAAI,OAAO,KAAK,OAAO;EACvB,WAAW;CACb;CACA,IAAI,YAAY,IAAI,IAAI,KAAK,OAAO;CACpC,OAAO;AACT;AAEA,SAAS,mBAAmB,QAAoB,QAAgB,KAAqB;CACnF,KAAK,MAAM,CAAC,GAAG,UAAU,OAAO,QAAQ,MAAM,GAAG;EAC/C,MAAM,OAAO,SAAS,GAAG,OAAO,GAAG,MAAM;EACzC,IAAI,OAAO,KAAK,GACd,mBAAmB,MAAM,QAAQ,MAAM,GAAG;OACrC,IAAI,aAAa,KAAK,GAE3B,MADoB,MAAM,MACpB,SAAS,MAAM,QAAQ;GAC3B,MAAM,WAAW,GAAG,KAAK,GAAG,IAAI;GAChC,IAAI,OAAO,IAAI,GACb,mBAAmB,KAAK,QAAQ,UAAU,GAAG;QACxC,IAAK,KAAwB,QAAQ,OAC1C,IAAI,KAAK,QAAQ;EAErB,CAAC;OACI,IAAK,MAAyB,QAAQ,OAC3C,IAAI,KAAK,IAAI;CAEjB;AACF;AAEA,SAAS,WACP,QACA,QACA,KACM;CACN,KAAK,MAAM,CAAC,GAAG,UAAU,OAAO,QAAQ,MAAM,GAAG;EAC/C,MAAM,OAAO,SAAS,GAAG,OAAO,GAAG,MAAM;EACzC,IAAI,OAAO,KAAK,GAAG;GACjB,MAAM,MAAM,MAAM,eAAe;GACjC,IAAI,IAAI,SAAS,GAAG,IAAI,KAAK;IAAE;IAAM,QAAQ;GAAI,CAAC;GAClD,WAAW,MAAM,QAAQ,MAAM,GAAG;EACpC,OAAO,IAAI,aAAa,KAAK,GAAG;GAC9B,MAAM,MAAM,MAAM,eAAe;GACjC,IAAI,IAAI,SAAS,GAAG,IAAI,KAAK;IAAE;IAAM,QAAQ;GAAI,CAAC;GAElD,MADoB,MAAM,MACpB,SAAS,MAAM,QAAQ;IAC3B,MAAM,WAAW,GAAG,KAAK,GAAG,IAAI;IAChC,IAAI,OAAO,IAAI,GAAG;KAChB,MAAM,OAAO,KAAK,eAAe;KACjC,IAAI,KAAK,SAAS,GAAG,IAAI,KAAK;MAAE,MAAM;MAAU,QAAQ;KAAK,CAAC;KAC9D,WAAW,KAAK,QAAQ,UAAU,GAAG;IACvC,OAAO;KACL,MAAM,OAAQ,KAAwB,OAAO;KAC7C,IAAI,KAAK,SAAS,GAAG,IAAI,KAAK;MAAE,MAAM;MAAU,QAAQ;KAAK,CAAC;IAChE;GACF,CAAC;EACH,OAAO;GACL,MAAM,OAAQ,MAAyB,OAAO;GAC9C,IAAI,KAAK,SAAS,GAAG,IAAI,KAAK;IAAE;IAAM,QAAQ;GAAK,CAAC;EACtD;CACF;AACF;AAEA,IAAM,iBAAN,MAAgF;CAC9E,CAAU,qBAAqB;CAE/B;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA;;;;;;;;CAQA,qBAAuD,OAAO,KAAK;CACnE,kBAAqD,OAAO,CAAC,CAAC;;;CAG9D,oBAAuD,OAAO,CAAC,CAAC;CAChE,iBAAgD,eAAe;EAC7D,MAAM,MAAM,KAAK,gBAAgB;EACjC,MAAM,SAAS,KAAK,kBAAkB;EACtC,IAAI,OAAO,WAAW,GAAG,OAAO;EAChC,IAAI,IAAI,WAAW,GAAG,OAAO;EAC7B,OAAO,CAAC,GAAG,KAAK,GAAG,MAAM;CAC3B,CAAC;CACD,sBAAwD,OAAO,KAAK;;CAEpE,uCAAqD,IAAI,IAAI;CAE7D;CACA,eAA8C,CAAC;CAC/C;CACA,sBAA8B;CAC9B,wBAAwD;CACxD,mBAAgD;CAChD,WAAmB;CACnB,mBAA4D;;CAG5D,2BAA2B,UAAiD;EAC1E,KAAK,mBAAmB;CAC1B;CAEA,YACE,aACA,SACA,iBACA;EACA,KAAK,cAAc;EACnB,KAAK,aAAa,SAAS,cAAc,CAAC;EAC1C,KAAK,mBAAmB,iBAAiB,oBAAoB;EAC7D,KAAK,SAAS,OAAY,CAAC,CAAC;EAC5B,IAAI,SAAS,SAAS;GACpB,KAAK,eAAe,QAAQ;GAC5B,KAAK,MAAM,OAAO,QAAQ,SACxB,KAAK,OAAO,KAAK,EAAE,KAAK,YAAY,GAAG,CAAC;GAG1C,KAAK,OAAO,IAAI,CAAC,GAAG,KAAK,OAAO,KAAK,CAAC,CAAC;EACzC;EAEA,KAAK,QAAQ,KAAK;EAClB,KAAK,OAAO,eAAe,KAAK,OAAO,MAAM,MAAM;EACnD,KAAK,QAAQ,eAET,KAAK,OAAO,MAAM,KAAK,SAAS;GAC9B,IAAI,OAAO,IAAI,GAAG,OAAO,KAAK,MAAM;GAEpC,OAAQ,KAAwB;EAClC,CAAC,CACL;EACA,KAAK,SAAS,eACZ,KAAK,OAAO,MAAM,KAAK,SAAS;GAC9B,IAAI,OAAO,IAAI,GAAG,OAAO,KAAK,OAAO;GACrC,MAAM,OAAQ,KAAwB,OAAO;GAC7C,OAAQ,KAAK,SAAS,IAAI,OAAO,KAAA;EACnC,CAAC,CACH;EACA,KAAK,UAAU,eAAe;GAC5B,IAAI,KAAK,mBAAmB,OAAO,OAAO;GAC1C,KAAK,MAAM,QAAQ,KAAK,OAAO,OAC7B,IAAK,KAA0C,QAAQ,OAAO,OAAO;GAEvE,OAAO;EACT,CAAC;EACD,KAAK,UAAU,eAAe;GAC5B,KAAK,MAAM,QAAQ,KAAK,OAAO,OAC7B,IAAK,KAA0C,QAAQ,OAAO,OAAO;GAEvE,OAAO;EACT,CAAC;EACD,KAAK,eAAe,eAAe;GACjC,IAAI,KAAK,oBAAoB,OAAO,OAAO;GAC3C,KAAK,MAAM,QAAQ,KAAK,OAAO,OAC7B,IAAK,KAA+C,aAAa,OAAO,OAAO;GAEjF,OAAO;EACT,CAAC;EACD,KAAK,UAAU,eAAe;GAG5B,IAAI,KAAK,eAAe,MAAM,SAAS,GAAG,OAAO;GACjD,IAAI,KAAK,aAAa,OAAO,OAAO;GACpC,KAAK,MAAM,QAAQ,KAAK,OAAO,OAC7B,IAAI,CAAE,KAA0C,QAAQ,OAAO,OAAO;GAExE,OAAO;EACT,CAAC;EAED,IAAI,KAAK,WAAW,SAAS,GAC3B,KAAK,mBAAmB,aAAa,KAAK,sBAAsB,CAAC;CAErE;CAEA,GAAG,OAA8B;EAC/B,OAAO,KAAK,OAAO,KAAK,EAAE;CAC5B;;;;;CAMA,cAAc,QAAqC;EACjD,IAAI,KAAK,UAAU;EACnB,IAAI,KAAK,kBAAkB,KAAK,EAAE,WAAW,KAAK,OAAO,WAAW,GAAG;EACvE,KAAK,kBAAkB,IAAI,OAAO,WAAW,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;CACnE;CAEA,IAAI,SAAgC;EAClC,IAAI,KAAK,UAAU;EACnB,MAAM,OAAO,KAAK,YAAY,OAAO;EACrC,KAAK,OAAO,IAAI,CAAC,GAAG,KAAK,OAAO,KAAK,GAAG,IAAI,CAAC;EAC7C,KAAK,mBAAmB,IAAI,IAAI;CAClC;CAEA,OAAO,OAAe,SAAgC;EACpD,IAAI,KAAK,UAAU;EACnB,MAAM,OAAO,KAAK,YAAY,OAAO;EACrC,MAAM,OAAO,CAAC,GAAG,KAAK,OAAO,KAAK,CAAC;EACnC,KAAK,OAAO,OAAO,GAAG,IAAI;EAC1B,KAAK,OAAO,IAAI,IAAI;EACpB,KAAK,mBAAmB,IAAI,IAAI;CAClC;CAEA,OAAO,OAAqB;EAC1B,IAAI,KAAK,UAAU;EACnB,MAAM,OAAO,CAAC,GAAG,KAAK,OAAO,KAAK,CAAC;EACnC,MAAM,CAAC,WAAW,KAAK,OAAO,OAAO,CAAC;EACtC,IAAI,SACD,QAAsC,UAAU;EAEnD,KAAK,OAAO,IAAI,IAAI;EACpB,KAAK,mBAAmB,IAAI,IAAI;CAClC;CAEA,KAAK,MAAc,IAAkB;EACnC,IAAI,KAAK,UAAU;EACnB,MAAM,OAAO,CAAC,GAAG,KAAK,OAAO,KAAK,CAAC;EACnC,MAAM,CAAC,QAAQ,KAAK,OAAO,MAAM,CAAC;EAClC,IAAI,MAAM,KAAK,OAAO,IAAI,GAAG,IAAI;EACjC,KAAK,OAAO,IAAI,IAAI;EACpB,KAAK,mBAAmB,IAAI,IAAI;CAClC;CAEA,QAAc;EACZ,IAAI,KAAK,UAAU;EACnB,KAAK,MAAM,QAAQ,KAAK,OAAO,KAAK,GACjC,KAAmC,UAAU;EAEhD,KAAK,OAAO,IAAI,CAAC,CAAC;EAClB,KAAK,mBAAmB,IAAI,IAAI;CAClC;;;;;;;CAQA,oBAAoB,OAA4C;EAC9D,KAAK,eAAe,CAAC,GAAG,KAAK;EAI7B,KAAK,mBAAmB,IAAI,KAAK;CACnC;CAEA,QAAc;EACZ,IAAI,KAAK,UAAU;EACnB,YAAY;GACV,KAAK,MAAM;GACX,KAAK,MAAM,OAAO,KAAK,cACrB,KAAK,IAAI,GAAG;GAEd,KAAK,gBAAgB,IAAI,CAAC,CAAC;GAC3B,KAAK,kBAAkB,IAAI,CAAC,CAAC;GAG7B,KAAK,mBAAmB,IAAI,KAAK;EACnC,CAAC;CACH;CAEA,iBAAuB;EACrB,KAAK,MAAM,QAAQ,KAAK,OAAO,KAAK,GAClC,IAAI,OAAO,IAAI,GAAG,KAAK,eAAe;OACjC,KAAyB,YAAY;CAE9C;CAEA,MAAM,WAA6B;EACjC,IAAI,KAAK,UAAU,OAAO,KAAK,QAAQ,KAAK;EAC5C,MAAM,QAA4B,CAAC;EACnC,KAAK,MAAM,QAAQ,KAAK,OAAO,KAAK,GAClC,IAAI,OAAO,IAAI,GAAG,MAAM,KAAK,KAAK,SAAS,CAAC;OACvC,MAAM,KAAM,KAAwB,WAAW,CAAC;EAEvD,MAAM,QAAQ,IAAI,KAAK;EAEvB,IAAI,KAAK,WAAW,SAAS,GAC3B,KAAK,sBAAsB;EAE7B,IAAI,KAAK,oBAAoB,KAAK,GAChC,MAAM,IAAI,SAAe,YAAY;GACnC,MAAM,QAAQ,KAAK,oBAAoB,WAAW,MAAM;IACtD,IAAI,CAAC,GAAG;KACN,MAAM;KACN,QAAQ;IACV;GACF,CAAC;EACH,CAAC;EAEH,OAAO,KAAK,QAAQ,KAAK;CAC3B;CAEA,UAAgB;EACd,IAAI,KAAK,UAAU;EACnB,KAAK,WAAW;EAChB,KAAK,mBAAmB;EACxB,KAAK,uBAAuB,MAAM;EAClC,KAAK,MAAM,QAAQ,KAAK,OAAO,KAAK,GACjC,KAAmC,UAAU;CAElD;CAEA,wBAAsC;EACpC,IAAI,KAAK,UAAU;EACnB,MAAM,QAAQ,KAAK,MAAM;EACzB,KAAK,uBAAuB,MAAM;EAClC,MAAM,QAAQ,IAAI,gBAAgB;EAClC,KAAK,wBAAwB;EAC7B,MAAM,OAAO,EAAE,KAAK;EAEpB,MAAM,aAA0B,CAAC;EACjC,MAAM,gBAA4C,CAAC;EACnD,KAAK,MAAM,KAAK,KAAK,YACnB,IAAI;GACF,MAAM,IAAI,EAAE,OAAO,MAAM,MAAM;GAC/B,IAAI,aAAa,SAAS,cAAc,KAAK,CAAC;QACzC,aAAa,YAAY,CAAC;EACjC,SAAS,KAAK;GACZ,IAAI;IACF,KAAK,mBAAmB,GAAG;GAC7B,QAAQ,CAER;GAGA,WAAW,KAAK;IACd,MAAM,CAAC;IACP,SAII;GACN,CAAC;EACH;EAGF,IAAI,WAAW,SAAS,GAAG;GACzB,YAAY;IACV,KAAK,uBAAuB,gBAC1B,MACA,YACA,KAAK,iBACL,KAAK,oBACP;IACA,KAAK,oBAAoB,IAAI,KAAK;GACpC,CAAC;GACD;EACF;EAEA,IAAI,cAAc,WAAW,GAAG;GAC9B,YAAY;IACV,KAAK,uBAAuB,gBAC1B,MACA,CAAC,GACD,KAAK,iBACL,KAAK,oBACP;IACA,KAAK,oBAAoB,IAAI,KAAK;GACpC,CAAC;GACD;EACF;EAEA,YAAY;GACV,KAAK,uBAAuB,gBAC1B,MACA,CAAC,GACD,KAAK,iBACL,KAAK,oBACP;GACA,KAAK,oBAAoB,IAAI,IAAI;EACnC,CAAC;EAED,QAAQ,WAAW,aAAa,EAAE,MAAM,YAAY;GAClD,IAAI,SAAS,KAAK,uBAAuB,KAAK,UAAU;GACxD,MAAM,SAAsB,CAAC;GAC7B,KAAK,MAAM,KAAK,SACd,IAAI,EAAE,WAAW,aAAa,aAAa,QAAQ,EAAE,KAAK;GAE5D,YAAY;IACV,KAAK,uBAAuB,gBAC1B,MACA,QACA,KAAK,iBACL,KAAK,oBACP;IACA,KAAK,oBAAoB,IAAI,KAAK;GACpC,CAAC;EACH,CAAC;CACH;AACF;AAEA,SAAgB,WACd,QACA,SACA,iBACS;CACT,OAAO,IAAI,SAAS,QAAQ,SAAS,eAAe;AACtD;AAEA,SAAgB,iBACd,aACA,SACA,iBACe;CACf,OAAO,IAAI,eAAkB,aAAa,SAAS,eAAe;AACpE;;;;;;;;;AAUA,SAAgB,mBACd,MACA,QACA,gBACA,SACY;CACZ,MAAM,YAA+B,CAAC;CACtC,uBAAuB,MAAM,QAAQ,gBAAgB,SAAS,SAAS;CACvE,aAAa;EACX,KAAK,MAAM,KAAK,WACd,IAAI;GACF,EAAE;EACJ,QAAQ,CAER;EAEF,UAAU,SAAS;CACrB;AACF;AAEA,SAAS,uBACP,MACA,QACA,gBACA,SACA,WACM;CACN,IAAI,OAAO,IAAI,GAAG;EAChB,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,MAAM,GACnD,uBACE,OACA,WAAW,KAAK,MAAM,GAAG,OAAO,GAAG,OACnC,gBACA,SACA,SACF;EAEF;CACF;CACA,IAAI,aAAa,IAAI,GAAG;EAOtB,MAAM,MAAM;EACZ,IAAI,UAA6B,CAAC;EAClC,MAAM,OAAO,aAAa;GACxB,MAAM,QAAQ,IAAI,MAAM;GAExB,KAAK,MAAM,KAAK,SACd,IAAI;IACF,EAAE;GACJ,QAAQ,CAER;GAEF,UAAU,CAAC;GACX,MAAM,SAAS,MAAM,QAAQ;IAC3B,uBAAuB,MAAM,GAAG,OAAO,GAAG,IAAI,IAAI,gBAAgB,SAAS,OAAO;GACpF,CAAC;EACH,CAAC;EACD,UAAU,KAAK,IAAI;EAEnB,UAAU,WAAW;GACnB,KAAK,MAAM,KAAK,SACd,IAAI;IACF,EAAE;GACJ,QAAQ,CAER;GAEF,UAAU,CAAC;EACb,CAAC;EACD;CACF;CAEA,uBAAuB,MAAwB;EAC7C;EACA,WAAW;EACX;CACF,CAAC;AACH;;;;;;;;AASA,SAAgB,+BACd,MACA,UACM;CACN,IAAI,OAAO,IAAI,GAAG;EAEhB,KAAK,6BAA6B,QAAQ;EAC1C,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,MAAM,GAC3C,+BAA+B,OAAO,QAAQ;EAEhD;CACF;CACA,IAAI,aAAa,IAAI,GAAG;EAEtB,KAAK,6BAA6B,QAAQ;EAK1C,KAAK,MAAM,QAAQ,KAAK,MAAM,OAC5B,+BAA+B,MAAM,QAAQ;EAE/C;CACF;CACA,gCAAgC,MAAwB,QAAQ;AAClE;;;ACtuCA,IAAM,iBAAN,MAAiD;CAC/C;CACA,mBAAgD;CAChD,WAAmB;CACnB;CACA,mBAA6C;CAE7C,YAAY,SAA8C,SAA+B;EACvF,KAAK,mBAAmB,QAAQ,oBAAoB;EACpD,KAAK,QAAQ,IAAI,MAAS;GACxB,eAAe;GACf,WAAW,QAAQ,aAAa;GAChC,aAAa,QAAQ;EACvB,CAAC;EAED,IAAI,QAAQ,KAAK;GACf,MAAM,QAAQ,QAAQ;GACtB,KAAK,mBAAmB,aAAa;IAEnC,MAAM,UAAU,MAAM;IACtB,gBAAgB;KACd,IAAI,CAAC,KAAK;UAGJ,KAAK,oBAAoB,QAAQ,CAAC,YAAY,KAAK,kBAAkB,OAAO,GAC9E,KAAK,MAAM,KAAK,IAAI,KAAA,CAAS;KAAA;KAGjC,KAAK,MAAM,WAAW,EAAE,WAChB;MACJ,KAAK,mBAAmB,CAAC,GAAG,OAAO;KACrC,SACM,CAEN,CACF;IACF,CAAC;GACH,CAAC;EACH,OACE,KAAK,MAAM,WAAW,EAAE,YAAY,CAEpC,CAAC;CAEL;CAEA,IAAI,OAAkC;EACpC,OAAO,KAAK,MAAM;CACpB;CACA,IAAI,QAAyC;EAC3C,OAAO,KAAK,MAAM;CACpB;CACA,IAAI,SAA+D;EACjE,OAAO,KAAK,MAAM;CACpB;CACA,IAAI,YAAiC;EACnC,OAAO,KAAK,MAAM;CACpB;CACA,IAAI,aAAkC;EACpC,OAAO,KAAK,MAAM;CACpB;CACA,IAAI,UAA+B;EACjC,OAAO,KAAK,MAAM;CACpB;CACA,IAAI,gBAAgD;EAClD,OAAO,KAAK,MAAM;CACpB;CACA,IAAI,sBAA2C;EAC7C,OAAO,KAAK,MAAM;CACpB;CACA,IAAI,WAAgC;EAClC,OAAO,KAAK,MAAM;CACpB;CAEA,gBAA4B,KAAK,MAAM,QAAQ;CAC/C,cAAoB,KAAK,MAAM,MAAM;CACrC,mBAA+B,KAAK,MAAM,WAAW;CACrD,gBAA4B,KAAK,MAAM,WAAW;CAClD,mBAAyB;EACvB,KAAK,MAAM,WAAW,EAAE,YAAY,CAAC,CAAC;CACxC;CACA,WAAW,YAAkD,KAAK,MAAM,QAAQ,OAAO;CAEvF,UAAgB;EACd,IAAI,KAAK,UAAU;EACnB,KAAK,WAAW;EAChB,KAAK,mBAAmB;EACxB,KAAK,mBAAmB;EACxB,KAAK,MAAM,QAAQ;CACrB;AACF;AAEA,SAAgB,iBACd,SACA,SACe;CACf,OAAO,IAAI,eAAe,SAAS,WAAW,CAAC,CAAC;AAClD;AAEA,SAAS,YAAY,GAAuB,GAAgC;CAC1E,IAAI,EAAE,WAAW,EAAE,QAAQ,OAAO;CAClC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,IAAI,CAAC,OAAO,GAAG,EAAE,IAAI,EAAE,EAAE,GAAG,OAAO;CAErC,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;ACdA,SAAgB,eACd,MACmB;CACnB,IAAI,OAAO,KAAK,eAAe,YAAY,KAAK,WAAW,WAAW,GACpE,MAAM,IAAI,MAAM,0DAA0D;CAK5E,MAAM,cAAkC;EAAE,GAAG;EAAM,SAAS,KAAK,WAAW;CAAK;CACjF,qBAAqB,KAAK,YAAY;EACpC,YAAY,KAAK;EACjB,QAAQ,KAAK;CACf,CAAC;CACD,OAAO,OAAO,OAAO,aAAa;EAChC,QAAQ;EACR,YAAY,KAAK;CACnB,CAAC;AACH;AA6EA,IAAM,eAAN,MAAmD;CAa9B;CACA;CACA;CACA;CAGA;CACA;CAnBnB,OAAuC,OAAO,KAAA,CAAS;CACvD,QAA8C,OAAO,KAAA,CAAS;CAC9D,YAAsC,OAAO,KAAK;CAClD,SAAuC,OAAoB,MAAM;CACjE,gBAAgD,OAAO,KAAA,CAAS;CAEhE,2BAAmB,IAAI,IAAe;CACtC,cAAgD,CAAC;CACjD,eAAuB;CACvB,WAAmB;CAEnB,YACE,MACA,SACA,gBACA,iBAGA,UACA,WACA;EARiB,KAAA,OAAA;EACA,KAAA,UAAA;EACA,KAAA,iBAAA;EACA,KAAA,kBAAA;EAGA,KAAA,WAAA;EACA,KAAA,YAAA;CAChB;;;;;;CAOH,IAAY,gBAAyB;EACnC,OAAO,KAAK,KAAK,YAAY,QAAQ,KAAK,cAAc,KAAA;CAC1D;CAMA,KACE,OAKM,CAMR;CAKA,QAAQ,OAAU,KAAA,MAA+B;EAC/C,IAAI,KAAK,UACP,OAAO,QAAQ,uBAAO,IAAI,MAAM,mBAAmB,CAAC;EAGtD,QADa,KAAK,KAAK,eAAe,YACtC;GACE,KAAK,YACH,OAAO,KAAK,WAAW,IAAI;GAC7B,KAAK;IAIH,KAAK,MAAM,UAAU,KAAK,UAAU;KAClC,OAAO,MAAM,MAAM;KACnB,OAAO,UAAU,SAAS;KAC1B,OAAO,WAAW,KAAA;IACpB;IACA,OAAO,KAAK,WAAW,IAAI;GAC7B,KAAK,UACH,OAAO,KAAK,cAAc,IAAI;EAClC;CACF;CAEA,cAAsB,MAAqB;EACzC,IAAI,KAAK,cACP,OAAO,IAAI,SAAY,SAAS,WAAW;GACzC,KAAK,YAAY,KAAK;IAAE;IAAM;IAAS;GAAO,CAAC;EACjD,CAAC;EAEH,KAAK,eAAe;EACpB,OAAO,KAAK,WAAW,IAAI,EAAE,cAAc,KAAK,mBAAmB,CAAC;CACtE;CAEA,qBAAmC;EACjC,MAAM,OAAO,KAAK,YAAY,MAAM;EACpC,IAAI,CAAC,MAAM;GACT,KAAK,eAAe;GACpB;EACF;EACA,KAAK,WAAW,KAAK,IAAI,EAAE,MACxB,WAAW;GACV,KAAK,QAAQ,MAAM;GACnB,KAAK,mBAAmB;EAC1B,IACC,QAAQ;GACP,KAAK,OAAO,GAAG;GACf,KAAK,mBAAmB;EAC1B,CACF;CACF;CAEA,MAAc,WAAW,MAAqB;EAC5C,MAAM,QAAQ,IAAI,gBAAgB;EAClC,IAAI;EACJ,IAAI;GACF,MAAM,MAAM,KAAK,KAAK,WAAW,IAAI,KAAK,KAAA;GAC1C,WAAW,QAAQ,KAAA,IAAY,KAAA,IAAY,KAAK,aAAa,GAAG;EAClE,SAAS,KAAK;GAMZ,KAAK,MAAM,IAAI,GAAG;GAClB,KAAK,OAAO,IAAI,OAAO;GAEvB,KAAK,eAAe,KAAK,KAAK,UAAU,KAAK,MAAM,KAAA,CAAS,GAAG,UAAU;GACzE,KAAK,eAAe,KAAK,KAAK,YAAY,KAAA,GAAW,KAAK,IAAI,GAAG,UAAU;GAC3E,MAAM;EACR;EAEA,MAAM,SAAoB;GAAE;GAAO;EAAS;EAC5C,KAAK,SAAS,IAAI,MAAM;EACxB,KAAK,iBAAiB,QAAQ,MAAM,IAAI,CAAC;EACzC,YAAY;GACV,KAAK,UAAU,IAAI,IAAI;GACvB,KAAK,OAAO,IAAI,SAAS;GACzB,KAAK,cAAc,IAAI,IAAI;EAC7B,CAAC;EAQD,MAAM,QAAQ,KAAK,gBAAgB,UAAU,IAAI;EACjD,MAAM,aAAa,KAAK,KAAK;EAC7B,IAAI,KAAK,iBAAiB,eAAe,KAAA,GACvC,IAAI;GACF,KAAK,WAAW,YAAY;IAAE;IAAY;IAAO,WAAW;IAAM,SAAS;GAAE,CAAC;EAChF,SAAS,KAAK;GACZ,cAAc,KAAK,SAAS,KAAK;IAC/B,MAAM;IACN,gBAAgB,KAAK;GACvB,CAAC;EACH;EAGF,IAAI;GACF,MAAM,SAAS,MAAM,UAAU,KAAK,aAAa,MAAM,MAAM,MAAM,GAAG,MAAM,MAAM;GAClF,IAAI,MAAM,OAAO,WAAW,KAAK,UAAU;IACzC,UAAU,SAAS;IACnB,IAAI,KAAK,iBAAiB,eAAe,KAAA,GACvC,KAAK,eAAe;KAAE;KAAY;KAAO,SAAS;IAAY,CAAC;IAEjE,MAAM,IAAI,aAAa,cAAc,YAAY;GACnD;GACA,YAAY;IACV,KAAK,KAAK,IAAI,MAAM;IACpB,KAAK,MAAM,IAAI,KAAA,CAAS;IACxB,KAAK,OAAO,IAAI,SAAS;GAC3B,CAAC;GAED,KAAK,eAAe,KAAK,KAAK,YAAY,QAAQ,IAAI,GAAG,UAAU;GAInE,UAAU,SAAS;GACnB,KAAK,eAAe,KAAK,KAAK,YAAY,QAAQ,KAAA,GAAW,IAAI,GAAG,UAAU;GAC9E,IAAI,KAAK,iBAAiB,eAAe,KAAA,GACvC,KAAK,eAAe;IAAE;IAAY;IAAO,SAAS;GAAU,CAAC;GAE/D,OAAO;EACT,SAAS,KAAK;GACZ,IAAI,aAAa,GAAG,KAAK,MAAM,OAAO,SAAS;IAC7C,UAAU,SAAS;IACnB,IAAI,KAAK,iBAAiB,eAAe,KAAA,GACvC,KAAK,eAAe;KAAE;KAAY;KAAO,SAAS;IAAY,CAAC;IAGjE,MAAM;GACR;GACA,KAAK,MAAM,IAAI,GAAG;GAClB,KAAK,OAAO,IAAI,OAAO;GAEvB,KAAK,eAAe,KAAK,KAAK,UAAU,KAAK,MAAM,QAAQ,GAAG,UAAU;GAIxE,UAAU,SAAS;GACnB,KAAK,eAAe,KAAK,KAAK,YAAY,KAAA,GAAW,KAAK,IAAI,GAAG,UAAU;GAC3E,IAAI,KAAK,iBAAiB,eAAe,KAAA,GACvC,KAAK,eAAe;IAAE;IAAY;IAAO,SAAS;IAAS,OAAO;GAAI,CAAC;GAEzE,MAAM;EACR,UAAU;GACR,KAAK,SAAS,OAAO,MAAM;GAC3B,KAAK,iBAAiB,QAAQ,MAAM,KAAK,IAAI,GAAG,IAAI,CAAC,CAAC;GACtD,IAAI,KAAK,SAAS,SAAS,GACzB,KAAK,UAAU,IAAI,KAAK;EAE5B;CACF;CAEA,eAAuB,OAKd;EACP,IAAI;GACF,KAAK,WAAW,WAAW,KAAK;EAClC,SAAS,KAAK;GACZ,cAAc,KAAK,SAAS,KAAK;IAC/B,MAAM;IACN,gBAAgB,KAAK;GACvB,CAAC;EACH;CACF;CAMA,aAAqB,KAAyB;EAC5C,IAAI,WAAW;EACf,OAAO;GACL,gBAAgB;IACd,IAAI,UAAU;IACd,WAAW;IACX,IAAI,SAAS;GAEf;GACA,gBAAgB;IACd,IAAI,UAAU;IACd,WAAW;IACX,IAAI,SAAS;GACf;EACF;CACF;CAEA,MAAc,aAAa,MAAS,QAAiC;EACnE,MAAM,QAAQ,KAAK,KAAK,SAAS;EACjC,MAAM,aAAa,KAAK,KAAK,cAAc;EAC3C,IAAI,UAAU;EACd,OAAO,MACL,IAAI;GACF,OAAO,MAAM,KAAK,KAAK,OAAO,MAAM,MAAM;EAC5C,SAAS,KAAK;GACZ,IAAI,OAAO,WAAW,aAAa,GAAG,GAAG,MAAM;GAE/C,IAAI,EADgB,OAAO,UAAU,WAAW,UAAU,QAAQ,MAAM,SAAS,GAAG,IAClE,MAAM;GAExB,MAAM,eADQ,OAAO,eAAe,aAAa,WAAW,OAAO,IAAI,YAC3C,MAAM;GAClC,WAAW;EACb;CAEJ;CAEA,SAAiB,IAAgB,MAAwB;EACvD,IAAI;GACF,GAAG;EACL,SAAS,KAAK;GACZ,cAAc,KAAK,SAAS,KAAK;IAC/B;IACA,gBAAgB,KAAK;GACvB,CAAC;EACH;CACF;CAEA,QAAc;EACZ,IAAI,KAAK,UAAU;EACnB,KAAK,MAAM,UAAU,KAAK,UAAU,OAAO,MAAM,MAAM;EAIvD,IAAI,KAAK,YAAY,SAAS,GAAG;GAC/B,MAAM,UAAU,IAAI,aAAa,WAAW,YAAY;GACxD,MAAM,QAAQ,KAAK;GACnB,KAAK,cAAc,CAAC;GACpB,KAAK,MAAM,UAAU,OAAO,OAAO,OAAO,OAAO;EACnD;EACA,KAAK,eAAe;EACpB,YAAY;GACV,KAAK,KAAK,IAAI,KAAA,CAAS;GACvB,KAAK,MAAM,IAAI,KAAA,CAAS;GACxB,KAAK,cAAc,IAAI,KAAA,CAAS;GAChC,KAAK,UAAU,IAAI,KAAK;GACxB,KAAK,OAAO,IAAI,MAAM;EACxB,CAAC;CACH;CAEA,UAAgB;EACd,IAAI,KAAK,UAAU;EACnB,KAAK,WAAW;EAChB,KAAK,MAAM,UAAU,KAAK,UAAU,OAAO,MAAM,MAAM;EACvD,KAAK,MAAM,UAAU,KAAK,aACxB,OAAO,OAAO,IAAI,aAAa,YAAY,YAAY,CAAC;EAE1D,KAAK,YAAY,SAAS;CAC5B;AACF;AAEA,SAAgB,eACd,MACA,SACA,gBACA,iBACA,UACA,WACgB;CAGhB,IAAI,KAAK,YAAY;MACf,OAAO,KAAK,eAAe,YAAY,KAAK,WAAW,WAAW,GACpE,MAAM,IAAI,MACR,gFACF;CAAA;CAGJ,OAAO,IAAI,aAAmB,MAAM,SAAS,gBAAgB,iBAAiB,UAAU,SAAS;AACnG;;;;;;;;AASA,SAAS,YAAoB;CAC3B,MAAM,IAAI;CACV,IAAI,OAAO,EAAE,QAAQ,eAAe,YAAY,OAAO,EAAE,OAAO,WAAW;CAC3E,MAAM,OAAO,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,EAAE;CACnD,OAAO,GAAG,KAAK,IAAI,EAAE,SAAS,EAAE,EAAE,GAAG;AACvC;;;;;;;AAQA,SAAS,UAAa,SAAqB,QAAiC;CAC1E,IAAI,OAAO,SACT,OAAO,QAAQ,OAAO,IAAI,aAAa,WAAW,YAAY,CAAC;CAEjE,OAAO,IAAI,SAAY,SAAS,WAAW;EACzC,IAAI,UAAU;EACd,MAAM,gBAAgB;GACpB,IAAI,SAAS;GACb,UAAU;GACV,OAAO,IAAI,aAAa,WAAW,YAAY,CAAC;EAClD;EACA,OAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;EACxD,QAAQ,MACL,MAAM;GACL,IAAI,SAAS;GACb,UAAU;GACV,OAAO,oBAAoB,SAAS,OAAO;GAC3C,QAAQ,CAAC;EACX,IACC,MAAM;GACL,IAAI,SAAS;GACb,UAAU;GACV,OAAO,oBAAoB,SAAS,OAAO;GAC3C,OAAO,CAAC;EACV,CACF;CACF,CAAC;AACH;;;ACziBA,IAAM,mBAAN,MAAiE;CAe5C;CACA;CAfnB,WAA2D,OAAO,IAAI;CACtE,gBAAwD,OAAO,KAAA,CAAS;CAExE;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA,YACE,kBACA,QACA;EAFiB,KAAA,mBAAA;EACA,KAAA,SAAA;EAQjB,MAAM,UAAU,eAAe;GAE7B,MAAM,UADM,KAAK,SAAS,OACL,MAAM,KAAK;GAChC,IAAI,YAAY,KAAA,GAAW,OAAO;GAClC,IAAI,kBAAkB,OAAO,KAAK,cAAc;EAElD,CAAC;EACD,KAAK,OACH,WAAW,KAAA,IACN,UACD,eAA8B;GAC5B,MAAM,MAAM,QAAQ;GACpB,OAAO,QAAQ,KAAA,IAAY,KAAA,IAAY,OAAO,GAAG;EACnD,CAAC;EACP,KAAK,QAAQ,eAAe,KAAK,SAAS,OAAO,MAAM,MAAM,KAAK;EAClE,KAAK,SAAS,eAA4B,KAAK,SAAS,OAAO,MAAM,OAAO,SAAS,MAAM;EAC3F,KAAK,YAAY,eAAe;GAC9B,MAAM,MAAM,KAAK,SAAS;GAC1B,IAAI,CAAC,KAAK,OAAO;GACjB,IAAI,oBAAoB,KAAK,cAAc,UAAU,KAAA,GAAW,OAAO;GACvE,OAAO,IAAI,MAAM,UAAU;EAC7B,CAAC;EACD,KAAK,aAAa,eAAe,KAAK,SAAS,OAAO,MAAM,WAAW,SAAS,KAAK;EACrF,KAAK,UAAU,eAAe,KAAK,SAAS,OAAO,MAAM,QAAQ,SAAS,IAAI;EAC9E,KAAK,gBAAgB,eAAe,KAAK,SAAS,OAAO,MAAM,cAAc,KAAK;EAClF,KAAK,sBAAsB,eACnB,KAAK,SAAS,OAAO,MAAM,oBAAoB,SAAS,KAChE;EACA,KAAK,WAAW,eAAe,KAAK,SAAS,OAAO,MAAM,SAAS,SAAS,KAAK;CACnF;CAEA,OAAO,OAA6B;EAClC,MAAM,OAAO,KAAK,SAAS,KAAK;EAChC,IAAI,SAAS,OAAO;EACpB,IAAI,QAAQ,KAAK,kBAAkB;GACjC,MAAM,WAAW,KAAK,MAAM,KAAK,KAAK;GACtC,IAAI,aAAa,KAAA,GAAW,KAAK,cAAc,IAAI,QAAQ;EAC7D;EACA,KAAK,SAAS,IAAI,KAAK;CACzB;CAEA,SAAe;EACb,KAAK,SAAS,IAAI,IAAI;CACxB;CAEA,gBAA4B;EAC1B,MAAM,MAAM,KAAK,SAAS,KAAK;EAC/B,IAAI,CAAC,KAAK,OAAO,QAAQ,uBAAO,IAAI,MAAM,+BAA+B,CAAC;EAC1E,OAAO,IAAI,MAAM,QAAQ,EAAE,MACxB,MAAM,KAAK,QAAQ,CAAC,IACpB,QAAQ;GAIP,IAAI,aAAa,GAAG,GAAG,OAAO,KAAK,WAAW;GAC9C,MAAM;EACR,CACF;CACF;CAEA,cAAoB;EAClB,KAAK,SAAS,KAAK,GAAG,MAAM,MAAM;CACpC;CAEA,eAAqB;EACnB,KAAK,SAAS,KAAK,GAAG,MAAM,OAAO;CACrC;CAEA,mBAA+B;EAC7B,MAAM,MAAM,KAAK,SAAS,KAAK;EAC/B,IAAI,CAAC,KAAK,OAAO,QAAQ,uBAAO,IAAI,MAAM,+BAA+B,CAAC;EAC1E,OAAO,IAAI,MAAM,WAAW,EAAE,MAAM,MAAM,KAAK,QAAQ,CAAC,CAAC;CAC3D;CAGA,gBAA4B,KAAK,WAAW;CAE5C,QAAgB,GAAS;EACvB,OAAO,KAAK,WAAW,KAAA,IAAa,IAAqB,KAAK,OAAO,CAAC;CACxE;AACF;;;;;;;;;;AAWA,SAAgB,UACd,QACA,OACA,cASA;CAGA,MAAM,mBADOA,MAAS,OACQ,oBAAoB;CAElD,MAAM,QAAQ,OAAO,iBAAiB,aAAa,eAAe,cAAc;CAChF,MAAM,YACJ,OAAO,iBAAiB,YAAY,iBAAiB,OAAO,aAAa,UAAU,KAAA;CAIrF,MAAM,MAAM,IAAI,iBAAuB,kBAFrC,OAAO,iBAAiB,YAAY,iBAAiB,OAAO,aAAa,SAAS,KAAA,CAErB;CAC/D,IAAI,eAAsC;CAC1C,IAAI,YAAY;CAEhB,MAAM,gBAAgB,aAAa;EASjC,MAAM,YAAY,YAAY,UAAU,IAAI;EAC5C,MAAM,OAAO,YAAc,QAAQ,MAAM,IAAK,CAAC,IAAkC,KAAA;EAEjF,IAAI,WAAW;EAEf,IAAI,CAAC,WAAW;GACd,gBAAgB;IACd,IAAI,cAAc;KAChB,aAAa,QAAQ;KACrB,eAAe;IACjB;IACA,IAAI,OAAO;GACb,CAAC;GACD;EACF;EAEA,gBAAgB;GACd,MAAM,QAAQ,OAAO,UAAmB,OAAO,IAAY;GAC3D,IAAI,iBAAiB,OAAO;GAC5B,IAAI,cAAc,aAAa,QAAQ;GACvC,MAAM,QAAQ;GACd,eAAe;GACf,IAAI,OAAO,KAAK;GAEhB,MAAM,SAAS,MAAM,MAAM,OAAO,KAAK;GAEvC,IAAI,CADa,MAAM,MAAM,WAAW,KAC5B,MAAM,WAAW,UAAU,MAAM,MAAM,WAAW,KAAK,WAAW,UAC5E,MAAM,MAAM,WAAW,EAAE,YAAY,CAErC,CAAC;EAEL,CAAC;CACH,CAAC;CAED,MAAM,gBAAgB;EACpB,cAAc;EACd,IAAI,cAAc;GAChB,aAAa,QAAQ;GACrB,eAAe;EACjB;EACA,IAAI,OAAO;CACb;CAEA,MAAM,gBAAsB;EAC1B,IAAI,WAAW;EACf,YAAY;EACZ,IAAI,cAAc;GAChB,aAAa,QAAQ;GACrB,eAAe;EACjB;CAIF;CAEA,MAAM,eAAqB;EACzB,IAAI,CAAC,WAAW;EAChB,YAAY;EAMZ,IAAI,EADc,YAAY,UAAU,IAAI,OAC5B;EAChB,MAAM,OAAQ,QAAQ,MAAM,IAAK,CAAC;EAClC,MAAM,QAAQ,OAAO,UAAmB,OAAO,IAAI;EACnD,MAAM,QAAQ;EACd,eAAe;EACf,IAAI,OAAO,KAAK;EAGhB,MAAM,SAAS,MAAM,MAAM,OAAO,KAAK;EACvC,IAAI,WAAW,UAAU,MAAM,MAAM,WAAW,KAAK,WAAW,SAC9D,MAAM,MAAM,WAAW,EAAE,YAAY,CAErC,CAAC;CAEL;CAEA,OAAO;EAAE,cAAc;EAAK;EAAS;EAAS;CAAO;AACvD;AAUA,IAAM,2BAAN,MAAgG;CAqBjE;CApB7B,WACE,OAAO,IAAI;CACb,iBAA+D,OAAO,KAAA,CAAS;CAE/E;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA,YAAY,kBAA4C;EAA3B,KAAA,mBAAA;EAC3B,KAAK,QAAQ,eAAe;GAE1B,MAAM,KADM,KAAK,SAAS,OACV,MAAM,MAAM;GAC5B,IAAI,MAAM,GAAG,SAAS,GAAG,OAAO;GAChC,IAAI,kBAAkB,OAAO,KAAK,eAAe,SAAS,CAAC;GAC3D,OAAO,MAAM,CAAC;EAChB,CAAC;EACD,KAAK,OAAO,eAAe;GAEzB,MAAM,KADM,KAAK,SAAS,OACV,MAAM,MAAM;GAC5B,IAAI,MAAM,GAAG,SAAS,GAAG,OAAO;GAChC,IAAI,kBAAkB;IACpB,MAAM,OAAO,KAAK,eAAe;IACjC,IAAI,QAAQ,KAAK,SAAS,GAAG,OAAO;GACtC;EAEF,CAAC;EACD,KAAK,OAAO,eAAe,KAAK,SAAS,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC;EACtE,KAAK,QAAQ,eAAe,KAAK,SAAS,OAAO,MAAM,MAAM,KAAK;EAClE,KAAK,SAAS,eAA4B,KAAK,SAAS,OAAO,MAAM,OAAO,SAAS,MAAM;EAC3F,KAAK,YAAY,eAAe;GAC9B,MAAM,MAAM,KAAK,SAAS;GAC1B,IAAI,CAAC,KAAK,OAAO;GACjB,IAAI,kBAAkB;IACpB,MAAM,OAAO,KAAK,eAAe;IACjC,IAAI,QAAQ,KAAK,SAAS,GAAG,OAAO;GACtC;GACA,OAAO,IAAI,MAAM,UAAU;EAC7B,CAAC;EACD,KAAK,aAAa,eAAe,KAAK,SAAS,OAAO,MAAM,WAAW,SAAS,KAAK;EACrF,KAAK,UAAU,eAAe,KAAK,SAAS,OAAO,MAAM,QAAQ,SAAS,IAAI;EAC9E,KAAK,gBAAgB,eAAe,KAAK,SAAS,OAAO,MAAM,cAAc,KAAK;EAClF,KAAK,sBAAsB,eACnB,KAAK,SAAS,OAAO,MAAM,oBAAoB,SAAS,KAChE;EACA,KAAK,WAAW,eAAe,KAAK,SAAS,OAAO,MAAM,SAAS,SAAS,KAAK;EACjF,KAAK,cAAc,eAAe,KAAK,SAAS,OAAO,MAAM,YAAY,SAAS,KAAK;EACvF,KAAK,kBAAkB,eAAe,KAAK,SAAS,OAAO,MAAM,gBAAgB,SAAS,KAAK;EAC/F,KAAK,qBAAqB,eAClB,KAAK,SAAS,OAAO,MAAM,mBAAmB,SAAS,KAC/D;EACA,KAAK,yBAAyB,eACtB,KAAK,SAAS,OAAO,MAAM,uBAAuB,SAAS,KACnE;CACF;CAEA,OAAO,OAAyD;EAC9D,MAAM,OAAO,KAAK,SAAS,KAAK;EAChC,IAAI,SAAS,OAAO;EACpB,IAAI,QAAQ,KAAK,kBAAkB;GACjC,MAAM,YAAY,KAAK,MAAM,MAAM,KAAK;GACxC,IAAI,UAAU,SAAS,GAAG,KAAK,eAAe,IAAI,SAAS;EAC7D;EACA,KAAK,SAAS,IAAI,KAAK;CACzB;CAEA,SAAe;EACb,KAAK,SAAS,IAAI,IAAI;CACxB;CAEA,gBAAkC;EAChC,MAAM,MAAM,KAAK,SAAS,KAAK;EAC/B,IAAI,CAAC,KAAK,OAAO,QAAQ,uBAAO,IAAI,MAAM,+BAA+B,CAAC;EAC1E,OAAO,IAAI,MAAM,QAAQ,EAAE,WACnB,IAAI,MAAM,MAAM,KAAK,IAC1B,QAAQ;GAEP,IAAI,aAAa,GAAG,GAAG,OAAO,KAAK,WAAW;GAC9C,MAAM;EACR,CACF;CACF;CAEA,cAAoB;EAClB,KAAK,SAAS,KAAK,GAAG,MAAM,MAAM;CACpC;CAEA,eAAqB;EACnB,KAAK,SAAS,KAAK,GAAG,MAAM,OAAO;CACrC;CAEA,mBAAqC;EACnC,MAAM,MAAM,KAAK,SAAS,KAAK;EAC/B,IAAI,CAAC,KAAK,OAAO,QAAQ,uBAAO,IAAI,MAAM,+BAA+B,CAAC;EAC1E,OAAO,IAAI,MAAM,WAAW;CAC9B;CAGA,gBAAkC,KAAK,WAAW;CAElD,sBAAqC;EACnC,MAAM,MAAM,KAAK,SAAS,KAAK;EAC/B,IAAI,CAAC,KAAK,OAAO,QAAQ,QAAQ;EACjC,OAAO,IAAI,MAAM,cAAc;CACjC;CAEA,0BAAyC;EACvC,MAAM,MAAM,KAAK,SAAS,KAAK;EAC/B,IAAI,CAAC,KAAK,OAAO,QAAQ,QAAQ;EACjC,OAAO,IAAI,MAAM,kBAAkB;CACrC;AACF;AAEA,SAAgB,kBACd,QACA,OACA,cAMA;CAEA,MAAM,mBADQ,MAA+D,OAC/C,oBAAoB;CAClD,MAAM,QAAQ,OAAO,iBAAiB,aAAa,eAAe,cAAc;CAChF,MAAM,YACJ,OAAO,iBAAiB,YAAY,iBAAiB,OAAO,aAAa,UAAU,KAAA;CAErF,MAAM,MAAM,IAAI,yBAAuC,gBAAgB;CACvE,IAAI,eAAkE;CACtE,IAAI,YAAY;CAEhB,MAAM,gBAAgB,aAAa;EAKjC,MAAM,YAAY,YAAY,UAAU,IAAI;EAC5C,MAAM,OAAO,YAAc,QAAQ,MAAM,IAAK,CAAC,IAAkC,KAAA;EAEjF,IAAI,WAAW;EAEf,IAAI,CAAC,WAAW;GACd,gBAAgB;IACd,IAAI,cAAc;KAChB,aAAa,QAAQ;KACrB,eAAe;IACjB;IACA,IAAI,OAAO;GACb,CAAC;GACD;EACF;EAEA,gBAAgB;GACd,MAAM,QAAQ,OAAO,kBAAsC,OAAO,IAAY;GAC9E,IAAI,iBAAiB,OAAO;GAC5B,IAAI,cAAc,aAAa,QAAQ;GACvC,MAAM,QAAQ;GACd,eAAe;GACf,IAAI,OAAO,KAAK;GAEhB,MAAM,SAAS,MAAM,MAAM,OAAO,KAAK;GAEvC,IAAI,CADa,MAAM,MAAM,WAAW,KAC5B,MAAM,WAAW,UAAU,MAAM,MAAM,WAAW,KAAK,WAAW,UAC5E,MAAM,MAAM,WAAW,EAAE,YAAY,CAErC,CAAC;EAEL,CAAC;CACH,CAAC;CAED,MAAM,gBAAgB;EACpB,cAAc;EACd,IAAI,cAAc;GAChB,aAAa,QAAQ;GACrB,eAAe;EACjB;EACA,IAAI,OAAO;CACb;CAEA,MAAM,gBAAsB;EAC1B,IAAI,WAAW;EACf,YAAY;EACZ,IAAI,cAAc;GAChB,aAAa,QAAQ;GACrB,eAAe;EACjB;CACF;CAEA,MAAM,eAAqB;EACzB,IAAI,CAAC,WAAW;EAChB,YAAY;EAEZ,IAAI,EADc,YAAY,UAAU,IAAI,OAC5B;EAChB,MAAM,OAAQ,QAAQ,MAAM,IAAK,CAAC;EAClC,MAAM,QAAQ,OAAO,kBAAsC,OAAO,IAAI;EACtE,MAAM,QAAQ;EACd,eAAe;EACf,IAAI,OAAO,KAAK;EAChB,MAAM,SAAS,MAAM,MAAM,OAAO,KAAK;EACvC,IAAI,WAAW,UAAU,MAAM,MAAM,WAAW,KAAK,WAAW,SAC9D,MAAM,MAAM,WAAW,EAAE,YAAY,CAErC,CAAC;CAEL;CAEA,OAAO;EAAE,cAAc;EAAK;EAAS;EAAS;CAAO;AACvD;;;;;;;;;;;;;;;AClXA,IAAM,gBAAN,MAAoB;CAClB,OAAqC;CACrC,OAAqC;CACrC,QAAgB;CAEhB,IAAI,OAAe;EACjB,OAAO,KAAK;CACd;CAEA,KAAK,OAAsC;EACzC,MAAM,OAAsB;GAAE;GAAO,MAAM,KAAK;GAAM,MAAM;GAAM,UAAU;EAAM;EAClF,IAAI,KAAK,SAAS,MAAM,KAAK,KAAK,OAAO;OACpC,KAAK,OAAO;EACjB,KAAK,OAAO;EACZ,KAAK,SAAS;EACd,OAAO;CACT;CAEA,OAAO,MAA2B;EAChC,IAAI,KAAK,UAAU;EACnB,KAAK,WAAW;EAChB,IAAI,KAAK,SAAS,MAAM,KAAK,KAAK,OAAO,KAAK;OACzC,KAAK,OAAO,KAAK;EACtB,IAAI,KAAK,SAAS,MAAM,KAAK,KAAK,OAAO,KAAK;OACzC,KAAK,OAAO,KAAK;EACtB,KAAK,SAAS;CAChB;CAEA,QAAc;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,QAAQ;CACf;;CAGA,CAAC,UAAqC;EACpC,IAAI,IAAI,KAAK;EACb,OAAO,MAAM,MAAM;GACjB,MAAM,OAAO,EAAE;GACf,MAAM,EAAE;GACR,IAAI;EACN;CACF;;CAGA,CAAC,UAAqC;EACpC,IAAI,IAAI,KAAK;EACb,OAAO,MAAM,MAAM;GACjB,MAAM,OAAO,EAAE;GACf,MAAM,EAAE;GACR,IAAI;EACN;CACF;AACF;AAEA,IAAa,qBAAb,MAAa,mBAAmB;CAC9B;CACA;CAEA,QAAuB;CACvB,UAA0C,IAAI,cAAc;CAC5D;CACA;CACA,eAAuB;;CAEvB,SAA8C;;;;;;;CAO9C,cAA+E;;;;;;;;CAS/E,WAAW,UAAqE;EAC9E,IAAI,SAAS,WAAW,GAAG;EAC3B,IAAI,KAAK,WAAW,MAAM,KAAK,yBAAS,IAAI,IAAI;EAChD,KAAK,MAAM,CAAC,OAAO,UAAU,UAC3B,KAAK,OAAO,IAAI,MAAM,MAAM,KAAK;CAErC;CAEA,YACE,QACA,YACA,aACA,MACA;EACA,KAAK,SAAS;EACd,KAAK,aAAa;EAClB,KAAK,OAAO,SAAS,CAAC,GAAG,OAAO,MAAM,WAAW,IAAI,CAAC,WAAW;EACjE,KAAK,OAAO;CACd;;;;;CAMA,UAAsB,SAA0C,OAAmB;EACjF,MAAM,MAAM,KAAK,SAAS;EAC1B,IAAI;EACJ,IAAI;GACF,MAAM,QAAQ,KAAK,KAAK;EAC1B,SAAS,KAAK;GACZ,KAAK,4BAA4B;GACjC,MAAM;EACR;EACA,KAAK,QAAQ;EAQb,OAAO;CACT;CAEA,8BAA4C;EAE1C,KAAK,MAAM,SAAS,KAAK,QAAQ,QAAQ,GACvC,IAAI;GACF,KAAK,aAAa,KAAK;EACzB,SAAS,KAAK;GAIZ,cAAc,KAAK,WAAW,SAAS,KAAK;IAC1C,MAAM;IACN,gBAAgB,KAAK;GACvB,CAAC;EACH;EAEF,KAAK,QAAQ,MAAM;EACnB,KAAK,QAAQ;CACf;CAEA,UAAgB;EACd,IAAI,KAAK,UAAU,YAAY;EAC/B,KAAK,QAAQ;EAEb,KAAK,MAAM,SAAS,KAAK,QAAQ,QAAQ,GACvC,IAAI;GACF,KAAK,aAAa,KAAK;EACzB,SAAS,KAAK;GACZ,cAAc,KAAK,WAAW,SAAS,KAAK;IAC1C,MAAM;IACN,gBAAgB,KAAK;GACvB,CAAC;EACH;EAEF,KAAK,QAAQ,MAAM;EACnB,KAAK,SAAS;EACd,KAAK,cAAc;CAKrB;CAEA,aAAqB,OAA6B;EAChD,QAAQ,MAAM,MAAd;GACE,KAAK;IACH,MAAM,UAAU;IAChB,MAAM,UAAU;IAChB;GACF,KAAK;IACH,MAAM,QAAQ;IACd;GACF,KAAK;IACH,MAAM,QAAQ;IACd;GACF,KAAK;IACH,MAAM,SAAS,QAAQ;IACvB;GACF,KAAK;IACH,MAAM,YAAY;IAClB;GACF,KAAK;IACH,MAAM,GAAG;IACT;GACF,KAAK;GACL,KAAK,YAEH;EACJ;CACF;CAEA,cAAuB;EACrB,OAAO,KAAK,UAAU;CACxB;CAEA,UAAgB;EACd,IAAI,KAAK,UAAU,UAAU;EAC7B,KAAK,QAAQ;EAEb,KAAK,MAAM,SAAS,KAAK,QAAQ,QAAQ,GACvC,IAAI;GACF,QAAQ,MAAM,MAAd;IACE,KAAK;KACH,MAAM,UAAU;KAChB,MAAM,UAAU;KAChB;IACF,KAAK;KAGH,MAAM,QAAQ;KACd;IACF,KAAK;KACH,MAAM,SAAS,QAAQ;KACvB;IACF,KAAK;KACH,MAAM,GAAG;KACT;IACF,SACE;GACJ;EACF,SAAS,KAAK;GACZ,cAAc,KAAK,WAAW,SAAS,KAAK;IAC1C,MAAM;IACN,gBAAgB,KAAK;GACvB,CAAC;EACH;CAMJ;CAEA,SAAe;EACb,IAAI,KAAK,UAAU,aAAa;EAChC,KAAK,QAAQ;EAEb,KAAK,MAAM,SAAS,KAAK,QAAQ,QAAQ,GACvC,IAAI;GACF,QAAQ,MAAM,MAAd;IACE,KAAK;KASH,IAAI,MAAM,YAAY,MACpB,MAAM,UAAUC,OAAiB,MAAM,OAAO;KAEhD;IACF,KAAK;KAGH,MAAM,OAAO;KACb;IACF,KAAK;KAKH,IAAI,MAAM,qBAAqB;KAC/B,MAAM,SAAS,OAAO;KACtB;IACF,KAAK;KACH,MAAM,GAAG;KACT;IACF,SACE;GACJ;EACF,SAAS,KAAK;GACZ,cAAc,KAAK,WAAW,SAAS,KAAK;IAC1C,MAAM;IACN,gBAAgB,KAAK;GACvB,CAAC;EACH;CAMJ;CAIA,WAAwB;EACtB,MAAM,OAAO;EAOb,MAAM,cAAc,WAAyB;GAC3C,IAAI,KAAK,WAAW,GAClB,MAAM,IAAI,MAAM,cAAc,OAAO,4CAA4C;EAErF;EA0vBA,OAAO;GAxvBL,IAAI,OAAO;IACT,OAAO,KAAK;GACd;GAEA,OAAO,IAAI;IACT,WAAW,QAAQ;IACnB,MAAM,QAAwB;KAC5B,MAAM;KACN,eAAe,GAAG;KAClB,SAAS;IACX;IAEA,MAAM,gBAAqC;KACzC,IAAI;MACF,MAAM,UAAU,GAAG;MAInB,IAAI,OAAO,YAAY,YACrB,aAAa;OACX,IAAI;QACF,QAAQ;OACV,SAAS,KAAK;QACZ,cAAc,KAAK,WAAW,SAAS,KAAK;SAC1C,MAAM;SACN,gBAAgB,KAAK;QACvB,CAAC;OACH;MACF;MAEF,OAAO;KACT,SAAS,KAAK;MACZ,cAAc,KAAK,WAAW,SAAS,KAAK;OAC1C,MAAM;OACN,gBAAgB,KAAK;MACvB,CAAC;MACD;KACF;IACF;IACA,MAAM,UAAU;IAIhB,IAAI,KAAK,UAAU,aACjB,MAAM,UAAUA,OAAiB,OAAO;IAE1C,KAAK,QAAQ,KAAK,KAAK;GACzB;GAEA,MACE,SACA,SACe;IACf,WAAW,OAAO;IAClB,MAAM,QAAQ,iBAAoB,SAAS,OAAO;IAClD,KAAK,QAAQ,KAAK;KAAE,MAAM;KAAW,eAAe,MAAM,QAAQ;IAAE,CAAC;IACrE,OAAO;GACT;GAEA,IAAI,OAAY,cAAyB;IACvC,WAAW,KAAK;IAEhB,IADe,MAA8B,WAC/B,iBAAiB;KAC7B,MAAM,SAAS,kBACb,KAAK,WAAW,aAChB,OACA,YACF;KACA,KAAK,QAAQ,KAAK;MAChB,MAAM;MACN,SAAS,OAAO;MAChB,SAAS,OAAO;MAChB,QAAQ,OAAO;KACjB,CAAC;KACD,OAAO,OAAO;IAChB;IACA,MAAM,SAAS,UACb,KAAK,WAAW,aAChB,OACA,YACF;IACA,KAAK,QAAQ,KAAK;KAChB,MAAM;KACN,SAAS,OAAO;KAChB,SAAS,OAAO;KAChB,QAAQ,OAAO;IACjB,CAAC;IACD,OAAO,OAAO;GAChB;GAEA,SAAe,MAA0C;IACvD,WAAW,UAAU;IACrB,MAAM,cAAc,KAAK,WAAW;IACpC,MAAM,IAAI,eACR,MACA,KAAK,WAAW,SAChB,KAAK,MACL,YAAY,oBACZ,KAAK,WAAW,UAIhB,KAAK,YAAY,OACb;KACE,cAAc,OAAO,YAAY,oBAAoB,EAAE;KACvD,aAAa,OAAO,YAAY,mBAAmB,EAAE;IACvD,IACA,KAAA,CACN;IACA,KAAK,QAAQ,KAAK;KAAE,MAAM;KAAW,eAAe,EAAE,QAAQ;IAAE,CAAC;IACjE,OAAO;GACT;GAEA,UAAyB;IACvB,WAAW,SAAS;IACpB,MAAM,IAAI,cAAiB,EAIzB,UAAU,QAAQ;KAChB,cAAc,KAAK,WAAW,SAAS,KAAK;MAC1C,MAAM;MACN,gBAAgB,KAAK;KACvB,CAAC;IACH,EACF,CAAC;IACD,KAAK,QAAQ,KAAK;KAAE,MAAM;KAAW,eAAe,EAAE,QAAQ;IAAE,CAAC;IACjE,OAAO;GACT;GAEA;GACA;GAEA,MACE,SACA,YACA,SACU;IACV,WAAW,OAAO;IAIlB,MAAM,IAAI,YAAY,SAAS,YAAY;KACzC,mBAAmB,QAAQ;MACzB,cAAc,KAAK,WAAW,SAAS,KAAK;OAC1C,MAAM;OACN,gBAAgB,KAAK;MACvB,CAAC;KACH;KACA,YAAY,SAAS;IACvB,CAAC;IACD,KAAK,QAAQ,KAAK;KAAE,MAAM;KAAW,eAAe,EAAE,QAAQ;IAAE,CAAC;IAIjE,uBAAuB,GAAG;KACxB,gBAAgB,KAAK;KACrB,WAAW;KACX,SAAS,KAAK,WAAW;IAC3B,CAAC;IACD,OAAO;GACT;GAEA,KAA2B,QAAW,SAAmC;IACvE,WAAW,MAAM;IACjB,MAAM,YAAY,QAAuB;KACvC,cAAc,KAAK,WAAW,SAAS,KAAK;MAC1C,MAAM;MACN,gBAAgB,KAAK;KACvB,CAAC;IACH;IACA,MAAM,IAAI,WAAW,QAAQ,SAAS,EAAE,kBAAkB,SAAS,CAAC;IACpE,KAAK,QAAQ,KAAK;KAAE,MAAM;KAAW,eAAe,EAAE,QAAQ;IAAE,CAAC;IAGjE,MAAM,OAAO,mBACX,GACA,IACA,KAAK,MACL,KAAK,WAAW,QAClB;IACA,KAAK,QAAQ,KAAK;KAAE,MAAM;KAAW,SAAS;IAAK,CAAC;IAMpD,+BAA+B,GAAkC,QAAQ;IACzE,OAAO;GACT;GAEA,WACE,aACA,SACe;IACf,WAAW,YAAY;IACvB,MAAM,YAAY,QAAuB;KACvC,cAAc,KAAK,WAAW,SAAS,KAAK;MAC1C,MAAM;MACN,gBAAgB,KAAK;KACvB,CAAC;IACH;IACA,MAAM,KAAK,iBAAoB,aAAa,SAAS,EAAE,kBAAkB,SAAS,CAAC;IACnF,KAAK,QAAQ,KAAK;KAAE,MAAM;KAAW,eAAe,GAAG,QAAQ;IAAE,CAAC;IAClE,MAAM,OAAO,mBACX,IACA,IACA,KAAK,MACL,KAAK,WAAW,QAClB;IACA,KAAK,QAAQ,KAAK;KAAE,MAAM;KAAW,SAAS;IAAK,CAAC;IACpD,+BACE,IACA,QACF;IACA,OAAO;GACT;GAEA,QAAW,OAAiB,OAAgB;IAC1C,IAAI,KAAK,WAAW,MAAM,KAAK,yBAAS,IAAI,IAAI;IAChD,KAAK,OAAO,IAAI,MAAM,MAAM,KAAK;IAMjC,KAAK,WAAW,cAAc,SAAS;GACzC;GAEA,OAAU,OAAoB;IAC5B,MAAM,UAAU,KAAK,WAAW,cAAc;IAC9C,MAAM,QAAQ,KAAK;IACnB,IAAI,UAAU,MAAM;KAClB,MAAM,SAAS,MAAM,IAAI,MAAM,IAAI;KACnC,IAAI,WAAW,KAAA,KAAa,OAAO,YAAY,SAC7C,OAAO,OAAO;IAElB;IACA,MAAM,mBAAqE;KACzE,IAAI,KAAK,gBAAgB,MAAM,KAAK,8BAAc,IAAI,IAAI;KAC1D,OAAO,KAAK;IACd;IACA,IAAI,OAAkC;IACtC,OAAO,SAAS,MAAM;KACpB,MAAM,MAAM,KAAK;KACjB,IAAI,KAAK,IAAI,MAAM,IAAI,GAAG;MACxB,MAAM,QAAQ,IAAI,IAAI,MAAM,IAAI;MAChC,WAAW,EAAE,IAAI,MAAM,MAAM;OAAE;OAAO;MAAQ,CAAC;MAC/C,OAAO;KACT;KACA,OAAO,KAAK;IACd;IACA,IAAI,MAAM,YAAY;KACpB,WAAW,EAAE,IAAI,MAAM,MAAM;MAAE,OAAO,MAAM;MAAS;KAAQ,CAAC;KAC9D,OAAO,MAAM;IACf;IACA,MAAM,QAAQ,MAAM,QAAQ,MAAM,KAAK,eAAe;IACtD,MAAM,IAAI,MACR,+CAA+C,MAAM,8DAA8D,MAAM,yCAC3H;GACF;GAEA,GAAM,SAAqB,SAAmC;IAC5D,WAAW,IAAI;IACf,MAAM,WAAW,UAAa;KAC5B,IAAI;MACF,QAAQ,KAAK;KACf,SAAS,KAAK;MACZ,cAAc,KAAK,WAAW,SAAS,KAAK;OAC1C,MAAM;OACN,gBAAgB,KAAK;MACvB,CAAC;KACH;IACF;IACA,MAAM,cAAc,QAAQ,GAAG,OAAO;IACtC,KAAK,QAAQ,KAAK;KAAE,MAAM;KAAgB;IAAY,CAAC;GACzD;GAEA,MACE,KACA,OACA,SACK;IACL,WAAW,OAAO;IAClB,MAAM,UAAU,KAAK,iBAAiB,WAAW,GAAG,GAAG,QAAQ,GAAG,CAAC;IACnE,MAAM,WAAW,SAAS;IAC1B,MAAM,YAAY,aAAa,KAAA,IAAY;KAAE,GAAG,KAAK;KAAM,GAAG;IAAS,IAAI,KAAK;IAChF,MAAM,gBAAgB,IAAI,mBAAmB,MAAM,KAAK,YAAY,SAAS,SAAS;IAGtF,MAAM,MAAM,cAAc,UAAU,WAAW,GAAG,GAAG,KAAK;IAC1D,KAAK,QAAQ,KAAK;KAAE,MAAM;KAAS,UAAU;IAAc,CAAC;IAC5D,OAAO;GACT;GAEA,OACE,KACA,OACA,SAC4E;IAC5E,WAAW,QAAQ;IACnB,MAAM,UAAU,KAAK,iBAAiB,WAAW,GAAG,GAAG,QAAQ,GAAG,CAAC;IACnE,MAAM,WAAW,SAAS;IAC1B,MAAM,YAAY,aAAa,KAAA,IAAY;KAAE,GAAG,KAAK;KAAM,GAAG;IAAS,IAAI,KAAK;IAChF,MAAM,gBAAgB,IAAI,mBAAmB,MAAM,KAAK,YAAY,SAAS,SAAS;IACtF,MAAM,MAAM,cAAc,UAAU,WAAW,GAAG,GAAG,KAAK;IAC1D,MAAM,QAAQ;KACZ,MAAM;KACN,UAAU;KACV,qBAAqB;IACvB;IACA,MAAM,OAAO,KAAK,QAAQ,KAAK,KAAK;IACpC,IAAI,WAAW;IACf,OAAO;KACL;KACA,eAAe;MACb,IAAI,UAAU;MACd,WAAW;MACX,KAAK,QAAQ,OAAO,IAAI;MACxB,IAAI;OACF,cAAc,QAAQ;MACxB,SAAS,KAAK;OACZ,cAAc,KAAK,WAAW,SAAS,KAAK;QAC1C,MAAM;QACN,gBAAgB,KAAK;OACvB,CAAC;MACH;KACF;KAMA,eAAe;MACb,IAAI,UAAU;MACd,MAAM,sBAAsB;MAC5B,IAAI;OACF,cAAc,QAAQ;MACxB,SAAS,KAAK;OACZ,cAAc,KAAK,WAAW,SAAS,KAAK;QAC1C,MAAM;QACN,gBAAgB,KAAK;OACvB,CAAC;MACH;KACF;KACA,cAAc;MACZ,IAAI,UAAU;MAKd,MAAM,sBAAsB;MAC5B,IAAI,KAAK,YAAY,GAAG;MACxB,IAAI;OACF,cAAc,OAAO;MACvB,SAAS,KAAK;OACZ,cAAc,KAAK,WAAW,SAAS,KAAK;QAC1C,MAAM;QACN,gBAAgB,KAAK;OACvB,CAAC;MACH;KACF;IACF;GACF;GAEA,QACE,KACA,OACA,SAC4B;IAC5B,WAAW,SAAS;IACpB,MAAM,UAAU,KAAK,iBAAiB,WAAW,GAAG,GAAG,QAAQ,GAAG,CAAC;IACnE,MAAM,WAAW,SAAS;IAC1B,MAAM,YAAY,aAAa,KAAA,IAAY;KAAE,GAAG,KAAK;KAAM,GAAG;IAAS,IAAI,KAAK;IAChF,MAAM,gBAAgB,IAAI,mBAAmB,MAAM,KAAK,YAAY,SAAS,SAAS;IACtF,MAAM,MAAM,cAAc,UAAU,WAAW,GAAG,GAAG,KAAK;IAC1D,MAAM,QAAwB;KAAE,MAAM;KAAS,UAAU;IAAc;IACvE,MAAM,OAAO,KAAK,QAAQ,KAAK,KAAK;IACpC,IAAI,WAAW;IACf,MAAM,gBAAsB;KAC1B,IAAI,UAAU;KACd,WAAW;KACX,KAAK,QAAQ,OAAO,IAAI;KACxB,IAAI;MACF,cAAc,QAAQ;KACxB,SAAS,KAAK;MACZ,cAAc,KAAK,WAAW,SAAS,KAAK;OAC1C,MAAM;OACN,gBAAgB,KAAK;MACvB,CAAC;KACH;IACF;IACA,OAAO,CAAC,KAAK,OAAO;GACtB;GAEA,WACE,SAG6D;IAC7D,WAAW,YAAY;IASvB,MAAM,2BAAW,IAAI,IAAkB;IACvC,MAAM,SAAS,OAA4C,CAAC,CAAC;IAC7D,MAAM,QAAQ,eAAe,OAAO,MAAM,MAAM;IAEhD,MAAM,gBACH,QAAiD,YAAY,KAAA;IAEhE,MAAM,cACJ,SAKU;KACV,IAAI;KACJ,IAAI;KACJ,IAAI,eAAe;MAEjB,MAAM,SAASC,QAAY,QAAQ,IAAI;MACvC,MAAM,OAAO;MACb,aAAa,OAAO;KACtB,OAAO;MACL,MAAM,WAAW;MACjB,MAAM,SAAS;MACf,aAAa,SAAS,QAAQ,IAAI;KACpC;KACA,MAAM,UAAU,KAAK,iBAAiB,WAAW,GAAG,GAAG,QAAQ,GAAG,CAAC;KACnE,MAAM,YACJ,QAAQ,SAAS,KAAA,IAAY;MAAE,GAAG,KAAK;MAAM,GAAG,QAAQ;KAAK,IAAI,KAAK;KACxE,MAAM,WAAW,IAAI,mBAAmB,MAAM,KAAK,YAAY,SAAS,SAAS;KACjF,IAAI;MAKF,OAAO;OAAE;OAAU,KAJP,SAAS,UACnB,WAAW,GAAG,GACd,UAEmB;OAAG;MAAI;KAC9B,SAAS,KAAK;MAGZ,cAAc,KAAK,WAAW,SAAS,KAAK;OAC1C,MAAM;OACN,gBAAgB,KAAK;MACvB,CAAC;MACD,OAAO;KACT;IACF;IAEA,MAAM,aAAa,QAAiB;KAClC,MAAM,OAAO,SAAS,IAAI,GAAG;KAC7B,IAAI,SAAS,KAAA,GAAW;KACxB,SAAS,OAAO,GAAG;KACnB,KAAK,QAAQ,OAAO,KAAK,IAAI;KAC7B,IAAI;MACF,KAAK,SAAS,QAAQ;KACxB,SAAS,KAAK;MACZ,cAAc,KAAK,WAAW,SAAS,KAAK;OAC1C,MAAM;OACN,gBAAgB,KAAK;MACvB,CAAC;KACH;IACF;IAEA,MAAM,kBAAwB;KAM5B,MAAM,SAAS,QAAQ,OAAO;KAC9B,gBAAgB;MACd,MAAM,4BAAY,IAAI,IAAa;MACnC,KAAK,MAAM,QAAQ,QAAQ;OACzB,MAAM,MAAM,QAAQ,MAAM,IAAI;OAC9B,IAAI,UAAU,IAAI,GAAG,GASnB;OAEF,UAAU,IAAI,KAAK,IAAI;MACzB;MAGA,KAAK,MAAM,OAAO,CAAC,GAAG,SAAS,KAAK,CAAC,GACnC,IAAI,CAAC,UAAU,IAAI,GAAG,GAAG,UAAU,GAAG;MAIxC,KAAK,MAAM,CAAC,KAAK,SAAS,WAAW;OACnC,MAAM,WAAW,SAAS,IAAI,GAAG;OACjC,IAAI,aAAa,KAAA,GAAW;QAC1B,IAAI;aACc,QAAiD,QAC/D,IAEQ,EAAE,eAA2B,SAAS,KAAK;UACnD,UAAU,GAAG;UACb,MAAM,QAAQ,WAAW,IAAI;UAC7B,IAAI,UAAU,MAAM;WAClB,MAAM,QAAwB;YAAE,MAAM;YAAS,UAAU,MAAM;WAAS;WACxE,MAAM,OAAO,KAAK,QAAQ,KAAK,KAAK;WACpC,SAAS,IAAI,KAAK;YAAE,GAAG;YAAO;WAAK,CAAC;UACtC;SACF;;QAEF;OACF;OACA,MAAM,QAAQ,WAAW,IAAI;OAC7B,IAAI,UAAU,MAAM;QAClB,MAAM,QAAwB;SAAE,MAAM;SAAS,UAAU,MAAM;QAAS;QACxE,MAAM,OAAO,KAAK,QAAQ,KAAK,KAAK;QACpC,SAAS,IAAI,KAAK;SAAE,GAAG;SAAO;QAAK,CAAC;OACtC;MACF;MAGA,MAAM,OAAoC,CAAC;MAC3C,MAAM,uBAAO,IAAI,IAAO;MACxB,KAAK,MAAM,QAAQ,QAAQ;OACzB,MAAM,MAAM,QAAQ,MAAM,IAAI;OAC9B,IAAI,KAAK,IAAI,GAAG,GAAG;OACnB,KAAK,IAAI,GAAG;OACZ,MAAM,OAAO,SAAS,IAAI,GAAG;OAC7B,IAAI,SAAS,KAAA,GAAW,KAAK,KAAK;QAAE;QAAK,KAAK,KAAK;OAAI,CAAC;MAC1D;MACA,OAAO,IAAI,IAAI;KACjB,CAAC;IACH;IAIA,MAAM,gBAAsB;KAC1B,IAAI;MACF,UAAU;KACZ,SAAS,KAAK;MACZ,cAAc,KAAK,WAAW,SAAS,KAAK;OAC1C,MAAM;OACN,gBAAgB,KAAK;MACvB,CAAC;KACH;IACF;IACA,MAAM,cAA8B;KAClC,MAAM;KACN,SAAS;KACT,SAAS;IACX;IACA,IAAI,KAAK,UAAU,aACjB,YAAY,UAAUD,OAAiB,OAAO;IAEhD,KAAK,QAAQ,KAAK,WAAW;IAE7B,OAAO;KAGL,OAAO,SAAS,MAAM;KACtB,MAAM,SAAS,KAAK;KACpB,MAAM,QAAW,SAAS,IAAI,GAAG,GAAG;KACpC,MAAM,QAAW,SAAS,IAAI,GAAG;KACjC,cAAc,QAAW;MACvB,MAAM,OAAO,SAAS,IAAI,GAAG;MAC7B,IAAI,SAAS,KAAA,GAAW;MAExB,IAAI,KAAK,KAAK,MAAM,SAAS,SAAS,KAAK,KAAK,MAAM,sBAAsB;MAC5E,KAAK,SAAS,QAAQ;KACxB;KACA,aAAa,QAAW;MACtB,MAAM,OAAO,SAAS,IAAI,GAAG;MAC7B,IAAI,SAAS,KAAA,GAAW;MACxB,IAAI,KAAK,KAAK,MAAM,SAAS,SAAS,KAAK,KAAK,MAAM,sBAAsB;MAG5E,IAAI,KAAK,YAAY,GAAG;MACxB,KAAK,SAAS,OAAO;KACvB;KACA,kBAAkB,QAAW;MAC3B,MAAM,OAAO,SAAS,IAAI,GAAG;MAC7B,IAAI,SAAS,KAAA,GAAW,OAAO;MAC/B,OAAO,KAAK,SAAS,YAAY;KACnC;IACF;GACF;GAEA,UACE,QACA,OACA,SACgB;IAChB,WAAW,WAAW;IACtB,MAAM,UAAU,OAA+C,MAAM;IACrE,MAAM,OAAO,OAAwB,KAAA,CAAS;IAC9C,MAAM,SAAS,OAA4B,KAAA,CAAS;IAEpD,IAAI,gBAA2C;IAC/C,IAAI,YAAkC;IACtC,IAAI,cAAmC;IACvC,IAAI,WAAW;IAUf,MAAM,WAAW,KAAK,QAAQ,KAAK;KALjC,MAAM;KACN,UAAU;MACR,WAAW;KACb;IAEyC,CAAC;IAE5C,MAAM,iBAAiB,QAAuB;KAC5C,QAAQ,IAAI,OAAO;KACnB,OAAO,IAAI,GAAG;KACd,cAAc,KAAK,WAAW,SAAS,KAAK;MAC1C,MAAM;MACN,gBAAgB,KAAK;KACvB,CAAC;IACH;IAEA,MAAM,aAA2B;KAC/B,IAAI,UACF,OAAO,QAAQ,uBAAO,IAAI,MAAM,iDAAiD,CAAC;KAMpF,IAAI,gBAAgB,MAAM,OAAO;KACjC,QAAQ,IAAI,SAAS;KACrB,MAAM,UAAU,OAAO,EAAE,MACtB,QAAQ;MACP,IAAI,UACF,MAAM,IAAI,MAAM,4CAA4C;MAE9D,MAAM,UAAU,KAAK,iBAAiB,WAAW,GAAG,GAAG,QAAQ,GAAG,CAAC;MACnE,MAAM,YACJ,SAAS,SAAS,KAAA,IAAY;OAAE,GAAG,KAAK;OAAM,GAAG,QAAQ;MAAK,IAAI,KAAK;MACzE,MAAM,WAAW,IAAI,mBAAmB,MAAM,KAAK,YAAY,SAAS,SAAS;MACjF,IAAI;OACF,MAAM,MAAM,SAAS,UAAU,WAAW,GAAG,GAAG,KAAK;OACrD,gBAAgB;OAChB,YAAY,KAAK,QAAQ,KAAK;QAAE,MAAM;QAAS;OAAS,CAAC;OACzD,KAAK,IAAI,GAAG;OACZ,QAAQ,IAAI,OAAO;OACnB,OAAO;MACT,SAAS,KAAK;OACZ,cAAc,GAAG;OACjB,MAAM;MACR;KACF,IACC,QAAQ;MACP,IAAI,UAAU,MAAM;MACpB,cAAc,GAAG;MACjB,MAAM;KACR,CACF;KACA,cAAc;KACd,QAAQ,YAAY;MAIlB,IAAI,gBAAgB,SAAS,cAAc;KAC7C,CAAC;KACD,OAAO;IACT;IAEA,MAAM,gBAAsB;KAC1B,IAAI,UAAU;KACd,WAAW;KACX,IAAI,cAAc,QAAQ,kBAAkB,MAAM;MAChD,KAAK,QAAQ,OAAO,SAAS;MAC7B,IAAI;OACF,cAAc,QAAQ;MACxB,SAAS,KAAK;OACZ,cAAc,KAAK,WAAW,SAAS,KAAK;QAC1C,MAAM;QACN,gBAAgB,KAAK;OACvB,CAAC;MACH;MACA,gBAAgB;MAChB,YAAY;KACd;KAKA,KAAK,QAAQ,OAAO,QAAQ;IAC9B;IAEA,OAAO;KACL,QAAQ,SAAS,OAAO;KACxB,KAAK,SAAS,IAAI;KAClB,OAAO,SAAS,MAAM;KACtB;KACA;IACF;GACF;GAEA,UAAU,IAAI;IACZ,WAAW,WAAW;IACtB,KAAK,QAAQ,KAAK;KAChB,MAAM;KACN,UAAU;MACR,IAAI;OACF,GAAG;MACL,SAAS,KAAK;OACZ,cAAc,KAAK,WAAW,SAAS,KAAK;QAC1C,MAAM;QACN,gBAAgB,KAAK;OACvB,CAAC;MACH;KACF;IACF,CAAC;GACH;GAEA,UAAU,IAAI;IACZ,WAAW,WAAW;IACtB,KAAK,QAAQ,KAAK;KAChB,MAAM;KACN,UAAU;MACR,IAAI;OACF,GAAG;MACL,SAAS,KAAK;OACZ,cAAc,KAAK,WAAW,SAAS,KAAK;QAC1C,MAAM;QACN,gBAAgB,KAAK;OACvB,CAAC;MACH;KACF;IACF,CAAC;GACH;GAEA,SAAS,IAAI;IACX,WAAW,UAAU;IACrB,KAAK,QAAQ,KAAK;KAChB,MAAM;KACN,UAAU;MACR,IAAI;OACF,GAAG;MACL,SAAS,KAAK;OACZ,cAAc,KAAK,WAAW,SAAS,KAAK;QAC1C,MAAM;QACN,gBAAgB,KAAK;OACvB,CAAC;MACH;KACF;IACF,CAAC;GACH;EAEO;CACX;CAEA,aAA8B;EAC5B,OAAO,KAAK,UAAU;CACxB;CAGA,iBAAyB,SAAmB,cAA0C;EACpF,MAAM,MAAM,KAAK;EACjB,MAAM,OAAO,gBAAgB,QAAQ,QAAQ;EAC7C,OAAO,GAAG,SAAS,KAAK,OAAO,YAAY,GAAG,IAAI;CACpD;AACF;;;AC9pCA,MAAM,eAAe;CACnB;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;AAQA,SAAgB,oBACd,KACA,OACA,SACW;CACX,MAAM,WAAW,IAAI,gBAAgB;CACrC,MAAM,cAAc,IAAI,YAAY;EAClC,SAAS,QAAQ;EACjB,SAAS,QAAQ;EACjB;EACA,MAAM,QAAQ;EACd,sBAAsB,QAAQ;EAC9B,oBAAoB,QAAQ;EAC5B,SAAS,QAAQ;CACnB,CAAC;CAQD,MAAM,WAAW,IAAI,mBACnB,MACA;EARA;EACA,SAAS,QAAQ;EACjB;EACA,eAAe,EAAE,OAAO,EAAE;CAKjB,GACT,QACA,QAAQ,IACV;CAIA,IAAI,QAAQ,WAAW,KAAA,KAAa,QAAQ,OAAO,SAAS,GAC1D,SAAS,WAAW,QAAQ,MAAM;CAMpC,IAAI;CACJ,IAAI;EACF,MAAM,SAAS,UAAU,WAAW,GAAG,GAAG,KAAK;CACjD,SAAS,KAAK;EACZ,YAAY,QAAQ;EACpB,MAAM;CACR;CAGA,IAAI,SAAS;CACb,IAAI,OAAO,QAAQ,YAAY,QAAQ,MAerC,SAAS,EAAE,OAAO,IAAI;CASxB,IAAI;EACF,OAAO,mBAAmB,QAAQ,UAAU,UAAU,WAAW;CACnE,SAAS,KAAK;EACZ,SAAS,QAAQ;EACjB,YAAY,QAAQ;EACpB,MAAM;CACR;AACF;AAEA,SAAS,mBACP,KACA,UACA,UACA,aACW;CACX,IAAI,eAAqD;CAEzD,MAAM,gBAAgB;EACpB,IAAI,gBAAgB,MAAM;GACxB,aAAa,YAAY;GACzB,eAAe;EACjB;EACA,SAAS,QAAQ;EACjB,YAAY,QAAQ;CACtB;CAEA,MAAM,WAAW,SAAgC;EAC/C,SAAS,QAAQ;EACjB,IAAI,gBAAgB,MAAM;GACxB,aAAa,YAAY;GACzB,eAAe;EACjB;EACA,MAAM,UAAU,MAAM;EACtB,IAAI,WAAW,QAAQ,YAAY,OAAO,mBACxC,eAAe,iBAAiB;GAC9B,eAAe;GACf,QAAQ;EACV,GAAG,OAAO;CAEd;CAEA,MAAM,eAAe;EACnB,IAAI,gBAAgB,MAAM;GACxB,aAAa,YAAY;GACzB,eAAe;EACjB;EACA,SAAS,OAAO;CAClB;CAEA,MAAM,QAAQ;EACZ,YAAY,YACV,SAAS,UAAU,OAAO;EAC5B,oBAAoB,YAAY,qBAAqB;CACvD;CAEA,MAAM,SAAS;CACf,KAAK,MAAM,UAAU,cAInB,IAAI,UAAU,QACZ,MAAM,IAAI,MACR,uCAAuC,OAAO,0CAChD;CAOJ,MAAM,OAAO;EAAE,YAAY;EAAO,UAAU;EAAO,cAAc;CAAM;CACvE,OAAO,eAAe,QAAQ,WAAW;EAAE,OAAO;EAAS,GAAG;CAAK,CAAC;CACpE,OAAO,eAAe,QAAQ,WAAW;EAAE,OAAO;EAAS,GAAG;CAAK,CAAC;CACpE,OAAO,eAAe,QAAQ,UAAU;EAAE,OAAO;EAAQ,GAAG;CAAK,CAAC;CAClE,OAAO,eAAe,QAAQ,WAAW;EAAE,OAAO;EAAO,GAAG;CAAK,CAAC;CAClE,OAAO,eAAe,QAAQ,aAAa;EACzC,aAAa,YAAY,UAAU;EACnC,GAAG;CACL,CAAC;CACD,OAAO,eAAe,QAAQ,eAAe;EAC3C,aAAa,YAAY,YAAY;EACrC,GAAG;CACL,CAAC;CACD,OAAO,eAAe,QAAQ,wBAAwB;EACpD,QAAQ,SAAiB,SAA6B,MAAe,kBACnE,YAAY,qBAAqB,SAAS,SAAS,MAAM,aAAa;EACxE,GAAG;CACL,CAAC;CAED,OAAO;AACT;;;;;AAMA,SAAgB,WACd,KACA,SACW;CACX,OAAO,oBAAsC,KAAK,KAAA,GAAmB,OAAO;AAC9E"}