@zaly/tui 0.0.6 → 0.0.8

package/dist/node-BZ7f6HzU.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"node-BZ7f6HzU.mjs","names":["#children","#state","#mountAc","#ctx","#id","#parent","#actionTargets","#cache","#invalidations","#rendering","#render","#registerActionMeta"],"sources":["../src/core/node.ts"],"sourcesContent":["import type { MaybePromise } from \"@zaly/shared\"\nimport type { TryResult } from \"@zaly/shared/logger\"\nimport type { ActionCtx, ActionDef, NodeActionMap } from \"../input/actions.ts\"\nimport type { RoutedKey, RoutedPaste } from \"../input/router.ts\"\nimport type { SurfaceType } from \"../renderer/renderer.ts\"\nimport type { MountCtx, RenderCtx } from \"./ctx.ts\"\nimport type { Ref, SignalStore } from \"./reactive.ts\"\nimport type { Layout, State } from \"./state.ts\"\n\nimport { Emitter } from \"@zaly/shared\"\nimport { createStore, inRenderContextOf, unwrap, withActiveNode } from \"./reactive.ts\"\n\n/** Minimum event map every node carries. Custom event maps intersect\n *  this with their own events via `&`. */\nexport type BaseEvents = {\n  invalidate: {}\n  mount: {}\n  unmount: {}\n  focus: {}\n  blur: {}\n  show: {}\n  hide: {}\n  key: { key: RoutedKey }\n  paste: { paste: RoutedPaste }\n  childadded: { child: Node }\n  childremoved: { child: Node }\n}\n\n/**\n * Public Node handle. Calling `render(ctx)` returns the node's rows from the\n * per-node cache, recomputing only if state read inside `_render` has changed\n * since the last call.\n *\n * Concrete subclasses implement the protected `_render(ctx)` hook; the public\n * `render` is the caching wrapper around it.\n *\n * State is a `createStore` proxy: reads inside `_render` track per-field;\n * mutating a read field invalidates this node. Three write forms:\n *\n *   - `n.state.field = value`               (direct assignment)\n *   - `n.state.set({ field: value, ... })`  (patch — partial merge)\n *   - `n.state.set(current => ({ ... }))`   (updater — receives untracked current)\n *\n * Writes through nested objects/arrays (`n.state.padding[0] = 1`) do NOT —\n * reassign the whole field instead.\n */\nexport abstract class Node<T extends object = object, E extends {} = {}> extends Emitter<\n  BaseEvents,\n  E\n> {\n  #cache?: { rows: string[]; version: number; width: number }\n  #parent?: Node\n  #rendering: Promise<string[]> | undefined\n  /** Bumped on every `invalidate()`. Captured at the start of a render\n   *  and re-checked after `_render` resolves: if the count moved, an\n   *  external mutation landed during the render and the rows we just\n   *  produced reflect pre-mutation state. We skip writing the cache in\n   *  that case so the surface's already-scheduled re-paint sees a\n   *  cache miss and re-renders against the latest state. */\n  #invalidations = 0\n  readonly #children: Node[] = []\n  #state: SignalStore<T>\n  #ctx?: MountCtx\n  #id?: string\n  #actionTargets = new Set<Node>()\n  #mountAc?: AbortController\n  actions?: NodeActionMap\n  type?: string\n  protected layout?(ctx: RenderCtx): MaybePromise<Layout | undefined>\n\n  constructor(state: State<T>, ...children: Node[]) {\n    super()\n    this.onEmitError = (err) => {\n      const logger = this.logger\n      if (logger) logger.error(err)\n      // oxlint-disable-next-line no-console\n      else console.error(\"Uncaught node event error (node is unmounted, no ctx):\", err)\n    }\n    // `createStore` gives us per-field reactivity for free: reads\n    // inside `_render` subscribe via the rendering Node's tracking\n    // ctx, so mutating a read field invalidates exactly this node.\n    // Fields nobody reads never allocate a signal — mutation is just\n    // a state update with no cascade. Finer-grained than the old\n    // \"any write invalidates everything\" Proxy.\n    this.#state = createStore(state)\n    children.forEach((c) => this.add(c))\n  }\n\n  withEvents<Events extends {}>(): this & Emitter<Events> {\n    return this as unknown as this & Emitter<Events>\n  }\n\n  withActions<A extends NodeActionMap>(actions: A): this & { actions: A } {\n    this.actions = { ...this.actions, ...actions }\n    return this as this & { actions: A }\n  }\n\n  action(id: keyof NonNullable<this[\"actions\"]> & string, opts?: Partial<ActionCtx>): boolean {\n    const entry = this.actions?.[id]\n    const fn = typeof entry === \"function\" ? entry : entry?.fn\n    if (!fn) return false\n    fn({ source: \"programmatic\", target: this, ...opts, id, node: this })\n    return true\n  }\n\n  get mountSignal(): AbortSignal {\n    this.#mountAc ??= new AbortController()\n    return this.#mountAc.signal\n  }\n\n  get state(): SignalStore<T> & State<T> {\n    return this.#state\n  }\n\n  get children(): readonly Node[] {\n    return this.#children\n  }\n\n  protected get logger() {\n    return this.#ctx?.logger.child({\n      id: this.#id,\n      name: \"node\",\n      node: this.type ?? \"unknown\",\n    })\n  }\n\n  protected try<R>(fn: () => R): TryResult<R> {\n    const logger = this.logger\n    if (!logger) return fn() as TryResult<R>\n    return logger.try(fn) as TryResult<R>\n  }\n\n  /** Fragment protocol — opt-in. When defined, layout containers\n   *  (Box's row/column allocator) treat this node as a transparent\n   *  fragment and substitute the returned children for `this` during\n   *  flex allocation and rendering. The fragment Node still exists in\n   *  the tree (it's mounted; it bubbles invalidates from its\n   *  descendants), but layout sees through it.\n   *\n   *  Used by `show`, `errorBoundary`, `suspense`: their children carry\n   *  their own flex props through to the parent box, can share its\n   *  `gap`, and a row containing a `show` with multiple flex children\n   *  allocates per-leaf-slot rather than collapsing into one. */\n  protected layoutChildren?(): readonly Node[]\n\n  // Make parent readonly\n  get parent(): Node | undefined {\n    return this.#parent\n  }\n\n  /** Mount context when this node is attached to a surface — surface\n   *  identifier plus scoped handles to router / overlay / tree lookups.\n   *  `undefined` before mount and after unmount. Exposed so widget\n   *  authors can reach renderer services without closing over a ref. */\n  get ctx(): MountCtx | undefined {\n    return this.#ctx\n  }\n\n  get surface(): SurfaceType | undefined {\n    return this.#ctx?.surface\n  }\n\n  get mounted(): boolean {\n    return this.#ctx !== undefined\n  }\n\n  /**\n   * Read or set the node's `id`. Called without args, returns the\n   * current id. Called with a string, sets it and returns `this` for\n   * chaining — useful when building trees inline:\n   *\n   * ```ts\n   * input({...}).id(\"chat-input\").focus().on(\"submit\", ...)\n   * ```\n   *\n   * The id is used by `ctx.getNode(id)` / `Renderer.getNode(id)` for\n   * tree lookups, and by the input router as a per-instance scope for\n   * keymap bindings (alongside the class-level `type`).\n   */\n  id(): string | undefined\n  id(value: string): this\n  id(value?: string): string | undefined | this {\n    if (value === undefined) return this.#id\n    this.#id = value\n    return this\n  }\n\n  async getLayout(ctx: RenderCtx): Promise<Layout | undefined> {\n    if (!this.layout) return\n    return this.layout(ctx)\n  }\n\n  get layoutNodes(): readonly Node[] {\n    if (this.layoutChildren === undefined) return [this]\n    const ret: Node[] = []\n    for (const c of this.with(() => this.layoutChildren?.()) ?? []) ret.push(...c.layoutNodes)\n    return ret\n  }\n\n  addActionTarget(node: Node): this {\n    this.#actionTargets.add(node)\n    return this\n  }\n\n  removeActionTarget(node: Node): this {\n    this.#actionTargets.delete(node)\n    return this\n  }\n\n  get actionTargets(): Iterable<Node> {\n    return this.#actionTargets\n  }\n\n  invalidate(): this {\n    this.#cache = undefined\n    // Suppress only when this invalidate originates from *inside this\n    // node's own render call stack* — e.g. Markdown mutating its child\n    // Text inside its own `_render`. The active render observes the\n    // mutation as part of its own logic and produces rows that already\n    // reflect it, so we skip the cascade *and* the generation bump:\n    // the cache writeback at the end of the render is valid.\n    //\n    // External mutations (network callbacks, event handlers) and\n    // mutations cascading up from a *deeper* render's own call stack\n    // (e.g. Text._render mutating something that bubbles to Markdown\n    // mid-Markdown-render) run outside *this* node's ALS scope, so\n    // `inRenderContextOf(this)` returns `false` and they emit + bump\n    // normally — the in-flight render's rows are stale, the cache\n    // writeback gets skipped, and the surface schedules a fresh paint.\n    if (inRenderContextOf(this)) return this\n    this.#invalidations++\n    // Always emit and always cascade — surfaces (stream, UI) dedupe\n    // via their own `scheduled` flag, and the parent's cache always\n    // includes whatever rows we returned last render, so a child\n    // mutation always implies a stale parent cache. (We previously\n    // skipped the cascade when `hadCache` was false, which was buggy:\n    // a node that intentionally doesn't cache — e.g. one whose\n    // `_render` mutates a child mid-render and skips the writeback —\n    // would silently fail to dirty its parent on the next mutation,\n    // pinning the surface to the first render's output.)\n    void this.emit(\"invalidate\")\n    this.parent?.invalidate()\n    return this\n  }\n\n  with<R>(fn: () => R): R {\n    return withActiveNode(this, () => fn())\n  }\n\n  async render(ctx: RenderCtx): Promise<string[]> {\n    // `visible: false` on the state suppresses the render entirely —\n    // no `_render` call, no cached rows, zero layout footprint. Opt-in\n    // via `state.visible`; absence or `true` is the default shown path.\n    // Resolve inside the tracking ctx so a signal accessor read\n    // subscribes this node. Async work registered via `createAsync` is\n    // fire-and-forget here; surfaces that need a \"wait until settled\"\n    // commit (Stream) install a `SuspenseContext` boundary at their\n    // append boundary and await it before painting.\n    this.#rendering ??= this.with(() => this.#render(ctx))\n\n    try {\n      return await this.#rendering\n    } finally {\n      this.#rendering = undefined\n    }\n  }\n\n  async #render(ctx: RenderCtx): Promise<string[]> {\n    // Cache the hidden result too, so a later `invalidate()` sees\n    // `hadCache === true` and cascades up — otherwise a toggleable\n    // panel (autocomplete, modal) whose first paint happened while\n    // hidden would swallow the flip-to-visible invalidate.\n    if (!(unwrap(this.state.visible) ?? true)) {\n      this.#cache = { rows: [], version: ctx.version, width: ctx.width }\n      return this.#cache.rows\n    }\n    // Cache key includes `ctx.width` because rendered output is\n    // width-dependent. `version` alone catches state/theme mutations\n    // (top-level bumps version on theme change), but a parent passing\n    // a different `width` to the same node — common in flex\n    // measure-then-allocate passes — needs a fresh render.\n    if (this.#cache?.version === ctx.version && this.#cache.width === ctx.width) {\n      return this.#cache.rows\n    }\n    // Capture the invalidation count *before* awaiting `_render`. If\n    // it bumps mid-render, the rows we get back are based on stale\n    // state — the external mutation that bumped it has already emitted\n    // and re-scheduled the surface, so skip caching. The re-paint will\n    // run a fresh `_render` against the latest state.\n    const stamp = this.#invalidations\n    try {\n      const rows = await this._render(ctx)\n      if (this.#invalidations === stamp) {\n        this.#cache = { rows, version: ctx.version, width: ctx.width }\n      }\n      return rows\n    } catch (error) {\n      this.logger?.error(error)\n      // Don't cache the error result — a later invalidate should\n      // re-render and give the user a chance to recover.\n      this.#cache = undefined\n      return [\n        ctx.style.error(\n          `[Node render error: ${error instanceof Error ? error.message : String(error)}]`\n        ),\n      ]\n    }\n  }\n\n  protected abstract _render(ctx: RenderCtx): Promise<string[]> | string[]\n\n  add(child: Node): this {\n    this.splice(this.#children.length, 0, child)\n    return this\n  }\n\n  remove(child: Node): this {\n    const i = this.#children.indexOf(child)\n    if (i === -1) return this\n    this.splice(i, 1)\n    return this\n  }\n\n  splice(start: number, deleteCount: number, ...items: Node[]): this {\n    // Reject self-insertion — a node in its own children list would\n    // create a cycle and stack-overflow on traversal.\n    const filtered: Node[] = []\n    for (const c of items) {\n      if (c === this) continue\n      filtered.push(c)\n    }\n\n    // If any item is already a child of this container, pull it out\n    // first so we don't end up with duplicates. Adjust `start` when a\n    // removal falls before it so the caller-relative index is preserved.\n    let adjustedStart = Math.max(0, Math.min(start, this.#children.length))\n    for (const c of filtered) {\n      if (c.parent !== this) continue\n      const i = this.#children.indexOf(c)\n      if (i === -1) continue\n      this.#children.splice(i, 1)\n      if (i < adjustedStart) adjustedStart--\n    }\n\n    const removed = this.#children.splice(adjustedStart, deleteCount, ...filtered)\n    for (const c of removed) {\n      void this.emit(\"childremoved\", { child: c })\n      if (c.mounted) c.unmount()\n      if (c.parent === this) c.#parent = undefined\n    }\n    for (const c of filtered) {\n      // Detach from old parent before rewriting `#parent`, so the old\n      // parent's `remove()` path observes a consistent `c.parent === old`\n      // and cleans up its own bookkeeping.\n      if (c.parent && c.parent !== this) {\n        c.unmount()\n        c.parent.remove(c)\n      }\n      c.#parent = this\n      void this.emit(\"childadded\", { child: c })\n      if (this.#ctx !== undefined) c.mount(this.#ctx)\n    }\n    this.invalidate()\n    return this\n  }\n\n  clear(): this {\n    this.splice(0, this.#children.length)\n    return this\n  }\n\n  mount(ctx: MountCtx): this {\n    if (this.#ctx?.surface === ctx.surface) return this\n    if (this.#ctx) {\n      throw new Error(\n        `Node is already mounted on \"${this.#ctx.surface}\" (requested \"${ctx.surface}\"). Unmount first if you meant to move it.`\n      )\n    }\n    // Make sure state.visible is tracked and will trigger invalidate\n    withActiveNode(this, () => unwrap(this.state.visible))\n    this.#ctx = ctx\n    this.#registerActionMeta(ctx)\n    void this.emit(\"mount\")\n    for (const c of this.#children) c.mount(ctx)\n    return this\n  }\n\n  /** Contribute any `ActionInfo`-shaped entries in `this.actions` to\n   *  the catalog. The instance `fn` stays on the node (dispatch finds\n   *  it via the focus-chain walk); only metadata lands in the registry.\n   *  Uses `extend: false` so defaults don't clobber user overrides\n   *  that were registered before the widget mounted. */\n  #registerActionMeta(ctx: MountCtx): void {\n    if (!this.actions) return\n    const metas: Record<string, ActionDef> = {}\n    let any = false\n    for (const [id, entry] of Object.entries(this.actions)) {\n      if (typeof entry === \"function\") continue\n      const { fn: _fn, ...info } = entry\n      metas[id] = info\n      any = true\n    }\n    if (any) ctx.actions.register(metas, { default: true })\n  }\n\n  unmount(): this {\n    if (!this.#ctx) return this\n    this.#mountAc?.abort()\n    this.#mountAc = undefined\n    for (const c of this.#children) c.unmount()\n    void this.emit(\"unmount\")\n    this.#ctx.input.blur(this)\n    this.#ctx = undefined\n    return this\n  }\n\n  /** Become the focused node. Routes through the MountCtx, which emits\n   *  `blur` on the previous focus and `focus` on this node.\n   *\n   *  When called before the node is mounted (the common case for\n   *  `input({ focus: true }).on(...)` style setup), the focus is\n   *  deferred until the next `mount` event. That keeps the API\n   *  synchronous and side-effect-free at build time — callers don't\n   *  have to think about ordering. */\n  focus(): this {\n    if (!this.#ctx) {\n      this.once(\"mount\", () => this.focus())\n      return this\n    }\n    this.#ctx.input.focus(this)\n    return this\n  }\n\n  /** Release focus. No-op when not mounted. */\n  blur(): this {\n    this.#ctx?.input.blur(this)\n    return this\n  }\n\n  get visible() {\n    return unwrap(this.state.visible) ?? true\n  }\n\n  show(): this {\n    if (this.visible) return this\n    this.state.visible = true\n    void this.emit(\"show\")\n    return this\n  }\n\n  hide(): this {\n    if (!this.visible) return this\n    this.state.visible = false\n    void this.emit(\"hide\")\n    return this\n  }\n\n  toggle(): this {\n    this.state.visible = !this.visible\n    return this\n  }\n\n  ref<N extends Node>(ref?: Ref<this extends N ? N : never>): this {\n    if (ref) ref.value = this as unknown as Exclude<typeof ref.value, undefined>\n    return this\n  }\n\n  isVisible(): boolean {\n    return this.visible && (this.parent ? this.parent.isVisible() : true)\n  }\n}\n\n/** Runtime type guard for Node.\n *\n * @internal*/\nexport function isNode(x: unknown): x is Node {\n  return x instanceof Node\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AA8CA,IAAsB,OAAtB,cAAiF,QAG/E;CACA;CACA;CACA;;;;;;;CAOA,iBAAiB;CACjB,YAA6B,CAAC;CAC9B;CACA;CACA;CACA,iCAAiB,IAAI,IAAU;CAC/B;CACA;CACA;CAGA,YAAY,OAAiB,GAAG,UAAkB;EAChD,MAAM;EACN,KAAK,eAAe,QAAQ;GAC1B,MAAM,SAAS,KAAK;GACpB,IAAI,QAAQ,OAAO,MAAM,GAAG;QAEvB,QAAQ,MAAM,0DAA0D,GAAG;EAClF;EAOA,KAAKC,SAAS,YAAY,KAAK;EAC/B,SAAS,SAAS,MAAM,KAAK,IAAI,CAAC,CAAC;CACrC;CAEA,aAAwD;EACtD,OAAO;CACT;CAEA,YAAqC,SAAmC;EACtE,KAAK,UAAU;GAAE,GAAG,KAAK;GAAS,GAAG;EAAQ;EAC7C,OAAO;CACT;CAEA,OAAO,IAAiD,MAAoC;EAC1F,MAAM,QAAQ,KAAK,UAAU;EAC7B,MAAM,KAAK,OAAO,UAAU,aAAa,QAAQ,OAAO;EACxD,IAAI,CAAC,IAAI,OAAO;EAChB,GAAG;GAAE,QAAQ;GAAgB,QAAQ;GAAM,GAAG;GAAM;GAAI,MAAM;EAAK,CAAC;EACpE,OAAO;CACT;CAEA,IAAI,cAA2B;EAC7B,KAAKC,aAAa,IAAI,gBAAgB;EACtC,OAAO,KAAKA,SAAS;CACvB;CAEA,IAAI,QAAmC;EACrC,OAAO,KAAKD;CACd;CAEA,IAAI,WAA4B;EAC9B,OAAO,KAAKD;CACd;CAEA,IAAc,SAAS;EACrB,OAAO,KAAKG,MAAM,OAAO,MAAM;GAC7B,IAAI,KAAKC;GACT,MAAM;GACN,MAAM,KAAK,QAAQ;EACrB,CAAC;CACH;CAEA,IAAiB,IAA2B;EAC1C,MAAM,SAAS,KAAK;EACpB,IAAI,CAAC,QAAQ,OAAO,GAAG;EACvB,OAAO,OAAO,IAAI,EAAE;CACtB;CAgBA,IAAI,SAA2B;EAC7B,OAAO,KAAKC;CACd;;;;;CAMA,IAAI,MAA4B;EAC9B,OAAO,KAAKF;CACd;CAEA,IAAI,UAAmC;EACrC,OAAO,KAAKA,MAAM;CACpB;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAKA,SAAS,KAAA;CACvB;CAiBA,GAAG,OAA2C;EAC5C,IAAI,UAAU,KAAA,GAAW,OAAO,KAAKC;EACrC,KAAKA,MAAM;EACX,OAAO;CACT;CAEA,MAAM,UAAU,KAA6C;EAC3D,IAAI,CAAC,KAAK,QAAQ;EAClB,OAAO,KAAK,OAAO,GAAG;CACxB;CAEA,IAAI,cAA+B;EACjC,IAAI,KAAK,mBAAmB,KAAA,GAAW,OAAO,CAAC,IAAI;EACnD,MAAM,MAAc,CAAC;EACrB,KAAK,MAAM,KAAK,KAAK,WAAW,KAAK,iBAAiB,CAAC,KAAK,CAAC,GAAG,IAAI,KAAK,GAAG,EAAE,WAAW;EACzF,OAAO;CACT;CAEA,gBAAgB,MAAkB;EAChC,KAAKE,eAAe,IAAI,IAAI;EAC5B,OAAO;CACT;CAEA,mBAAmB,MAAkB;EACnC,KAAKA,eAAe,OAAO,IAAI;EAC/B,OAAO;CACT;CAEA,IAAI,gBAAgC;EAClC,OAAO,KAAKA;CACd;CAEA,aAAmB;EACjB,KAAKC,SAAS,KAAA;EAed,IAAI,kBAAkB,IAAI,GAAG,OAAO;EACpC,KAAKC;EAUL,KAAU,KAAK,YAAY;EAC3B,KAAK,QAAQ,WAAW;EACxB,OAAO;CACT;CAEA,KAAQ,IAAgB;EACtB,OAAO,eAAe,YAAY,GAAG,CAAC;CACxC;CAEA,MAAM,OAAO,KAAmC;EAS9C,KAAKC,eAAe,KAAK,WAAW,KAAKC,QAAQ,GAAG,CAAC;EAErD,IAAI;GACF,OAAO,MAAM,KAAKD;EACpB,UAAU;GACR,KAAKA,aAAa,KAAA;EACpB;CACF;CAEA,MAAMC,QAAQ,KAAmC;EAK/C,IAAI,EAAE,OAAO,KAAK,MAAM,OAAO,KAAK,OAAO;GACzC,KAAKH,SAAS;IAAE,MAAM,CAAC;IAAG,SAAS,IAAI;IAAS,OAAO,IAAI;GAAM;GACjE,OAAO,KAAKA,OAAO;EACrB;EAMA,IAAI,KAAKA,QAAQ,YAAY,IAAI,WAAW,KAAKA,OAAO,UAAU,IAAI,OACpE,OAAO,KAAKA,OAAO;EAOrB,MAAM,QAAQ,KAAKC;EACnB,IAAI;GACF,MAAM,OAAO,MAAM,KAAK,QAAQ,GAAG;GACnC,IAAI,KAAKA,mBAAmB,OAC1B,KAAKD,SAAS;IAAE;IAAM,SAAS,IAAI;IAAS,OAAO,IAAI;GAAM;GAE/D,OAAO;EACT,SAAS,OAAO;GACd,KAAK,QAAQ,MAAM,KAAK;GAGxB,KAAKA,SAAS,KAAA;GACd,OAAO,CACL,IAAI,MAAM,MACR,uBAAuB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,EAAE,EAChF,CACF;EACF;CACF;CAIA,IAAI,OAAmB;EACrB,KAAK,OAAO,KAAKP,UAAU,QAAQ,GAAG,KAAK;EAC3C,OAAO;CACT;CAEA,OAAO,OAAmB;EACxB,MAAM,IAAI,KAAKA,UAAU,QAAQ,KAAK;EACtC,IAAI,MAAM,IAAI,OAAO;EACrB,KAAK,OAAO,GAAG,CAAC;EAChB,OAAO;CACT;CAEA,OAAO,OAAe,aAAqB,GAAG,OAAqB;EAGjE,MAAM,WAAmB,CAAC;EAC1B,KAAK,MAAM,KAAK,OAAO;GACrB,IAAI,MAAM,MAAM;GAChB,SAAS,KAAK,CAAC;EACjB;EAKA,IAAI,gBAAgB,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,KAAKA,UAAU,MAAM,CAAC;EACtE,KAAK,MAAM,KAAK,UAAU;GACxB,IAAI,EAAE,WAAW,MAAM;GACvB,MAAM,IAAI,KAAKA,UAAU,QAAQ,CAAC;GAClC,IAAI,MAAM,IAAI;GACd,KAAKA,UAAU,OAAO,GAAG,CAAC;GAC1B,IAAI,IAAI,eAAe;EACzB;EAEA,MAAM,UAAU,KAAKA,UAAU,OAAO,eAAe,aAAa,GAAG,QAAQ;EAC7E,KAAK,MAAM,KAAK,SAAS;GACvB,KAAU,KAAK,gBAAgB,EAAE,OAAO,EAAE,CAAC;GAC3C,IAAI,EAAE,SAAS,EAAE,QAAQ;GACzB,IAAI,EAAE,WAAW,MAAM,EAAEK,UAAU,KAAA;EACrC;EACA,KAAK,MAAM,KAAK,UAAU;GAIxB,IAAI,EAAE,UAAU,EAAE,WAAW,MAAM;IACjC,EAAE,QAAQ;IACV,EAAE,OAAO,OAAO,CAAC;GACnB;GACA,EAAEA,UAAU;GACZ,KAAU,KAAK,cAAc,EAAE,OAAO,EAAE,CAAC;GACzC,IAAI,KAAKF,SAAS,KAAA,GAAW,EAAE,MAAM,KAAKA,IAAI;EAChD;EACA,KAAK,WAAW;EAChB,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,OAAO,GAAG,KAAKH,UAAU,MAAM;EACpC,OAAO;CACT;CAEA,MAAM,KAAqB;EACzB,IAAI,KAAKG,MAAM,YAAY,IAAI,SAAS,OAAO;EAC/C,IAAI,KAAKA,MACP,MAAM,IAAI,MACR,+BAA+B,KAAKA,KAAK,QAAQ,gBAAgB,IAAI,QAAQ,2CAC/E;EAGF,eAAe,YAAY,OAAO,KAAK,MAAM,OAAO,CAAC;EACrD,KAAKA,OAAO;EACZ,KAAKQ,oBAAoB,GAAG;EAC5B,KAAU,KAAK,OAAO;EACtB,KAAK,MAAM,KAAK,KAAKX,WAAW,EAAE,MAAM,GAAG;EAC3C,OAAO;CACT;;;;;;CAOA,oBAAoB,KAAqB;EACvC,IAAI,CAAC,KAAK,SAAS;EACnB,MAAM,QAAmC,CAAC;EAC1C,IAAI,MAAM;EACV,KAAK,MAAM,CAAC,IAAI,UAAU,OAAO,QAAQ,KAAK,OAAO,GAAG;GACtD,IAAI,OAAO,UAAU,YAAY;GACjC,MAAM,EAAE,IAAI,KAAK,GAAG,SAAS;GAC7B,MAAM,MAAM;GACZ,MAAM;EACR;EACA,IAAI,KAAK,IAAI,QAAQ,SAAS,OAAO,EAAE,SAAS,KAAK,CAAC;CACxD;CAEA,UAAgB;EACd,IAAI,CAAC,KAAKG,MAAM,OAAO;EACvB,KAAKD,UAAU,MAAM;EACrB,KAAKA,WAAW,KAAA;EAChB,KAAK,MAAM,KAAK,KAAKF,WAAW,EAAE,QAAQ;EAC1C,KAAU,KAAK,SAAS;EACxB,KAAKG,KAAK,MAAM,KAAK,IAAI;EACzB,KAAKA,OAAO,KAAA;EACZ,OAAO;CACT;;;;;;;;;CAUA,QAAc;EACZ,IAAI,CAAC,KAAKA,MAAM;GACd,KAAK,KAAK,eAAe,KAAK,MAAM,CAAC;GACrC,OAAO;EACT;EACA,KAAKA,KAAK,MAAM,MAAM,IAAI;EAC1B,OAAO;CACT;;CAGA,OAAa;EACX,KAAKA,MAAM,MAAM,KAAK,IAAI;EAC1B,OAAO;CACT;CAEA,IAAI,UAAU;EACZ,OAAO,OAAO,KAAK,MAAM,OAAO,KAAK;CACvC;CAEA,OAAa;EACX,IAAI,KAAK,SAAS,OAAO;EACzB,KAAK,MAAM,UAAU;EACrB,KAAU,KAAK,MAAM;EACrB,OAAO;CACT;CAEA,OAAa;EACX,IAAI,CAAC,KAAK,SAAS,OAAO;EAC1B,KAAK,MAAM,UAAU;EACrB,KAAU,KAAK,MAAM;EACrB,OAAO;CACT;CAEA,SAAe;EACb,KAAK,MAAM,UAAU,CAAC,KAAK;EAC3B,OAAO;CACT;CAEA,IAAoB,KAA6C;EAC/D,IAAI,KAAK,IAAI,QAAQ;EACrB,OAAO;CACT;CAEA,YAAqB;EACnB,OAAO,KAAK,YAAY,KAAK,SAAS,KAAK,OAAO,UAAU,IAAI;CAClE;AACF"}
+{"version":3,"file":"node-BZ7f6HzU.mjs","names":[],"sources":["../src/core/node.ts"],"sourcesContent":["import type { MaybePromise } from \"@zaly/shared\"\nimport type { TryResult } from \"@zaly/shared/logger\"\nimport type { ActionCtx, ActionDef, NodeActionMap } from \"../input/actions.ts\"\nimport type { RoutedKey, RoutedPaste } from \"../input/router.ts\"\nimport type { SurfaceType } from \"../renderer/renderer.ts\"\nimport type { MountCtx, RenderCtx } from \"./ctx.ts\"\nimport type { Ref, SignalStore } from \"./reactive.ts\"\nimport type { Layout, State } from \"./state.ts\"\n\nimport { Emitter } from \"@zaly/shared\"\nimport { createStore, inRenderContextOf, unwrap, withActiveNode } from \"./reactive.ts\"\n\n/** Minimum event map every node carries. Custom event maps intersect\n *  this with their own events via `&`. */\nexport type BaseEvents = {\n  invalidate: {}\n  mount: {}\n  unmount: {}\n  focus: {}\n  blur: {}\n  show: {}\n  hide: {}\n  key: { key: RoutedKey }\n  paste: { paste: RoutedPaste }\n  childadded: { child: Node }\n  childremoved: { child: Node }\n}\n\n/**\n * Public Node handle. Calling `render(ctx)` returns the node's rows from the\n * per-node cache, recomputing only if state read inside `_render` has changed\n * since the last call.\n *\n * Concrete subclasses implement the protected `_render(ctx)` hook; the public\n * `render` is the caching wrapper around it.\n *\n * State is a `createStore` proxy: reads inside `_render` track per-field;\n * mutating a read field invalidates this node. Three write forms:\n *\n *   - `n.state.field = value`               (direct assignment)\n *   - `n.state.set({ field: value, ... })`  (patch — partial merge)\n *   - `n.state.set(current => ({ ... }))`   (updater — receives untracked current)\n *\n * Writes through nested objects/arrays (`n.state.padding[0] = 1`) do NOT —\n * reassign the whole field instead.\n */\nexport abstract class Node<T extends object = object, E extends {} = {}> extends Emitter<\n  BaseEvents,\n  E\n> {\n  #cache?: { rows: string[]; version: number; width: number }\n  #parent?: Node\n  #rendering: Promise<string[]> | undefined\n  /** Bumped on every `invalidate()`. Captured at the start of a render\n   *  and re-checked after `_render` resolves: if the count moved, an\n   *  external mutation landed during the render and the rows we just\n   *  produced reflect pre-mutation state. We skip writing the cache in\n   *  that case so the surface's already-scheduled re-paint sees a\n   *  cache miss and re-renders against the latest state. */\n  #invalidations = 0\n  readonly #children: Node[] = []\n  #state: SignalStore<T>\n  #ctx?: MountCtx\n  #id?: string\n  #actionTargets = new Set<Node>()\n  #mountAc?: AbortController\n  actions?: NodeActionMap\n  type?: string\n  protected layout?(ctx: RenderCtx): MaybePromise<Layout | undefined>\n\n  constructor(state: State<T>, ...children: Node[]) {\n    super()\n    this.onEmitError = (err) => {\n      const logger = this.logger\n      if (logger) logger.error(err)\n      // oxlint-disable-next-line no-console\n      else console.error(\"Uncaught node event error (node is unmounted, no ctx):\", err)\n    }\n    // `createStore` gives us per-field reactivity for free: reads\n    // inside `_render` subscribe via the rendering Node's tracking\n    // ctx, so mutating a read field invalidates exactly this node.\n    // Fields nobody reads never allocate a signal — mutation is just\n    // a state update with no cascade. Finer-grained than the old\n    // \"any write invalidates everything\" Proxy.\n    this.#state = createStore(state)\n    children.forEach((c) => this.add(c))\n  }\n\n  withEvents<Events extends {}>(): this & Emitter<Events> {\n    return this as unknown as this & Emitter<Events>\n  }\n\n  withActions<A extends NodeActionMap>(actions: A): this & { actions: A } {\n    this.actions = { ...this.actions, ...actions }\n    return this as this & { actions: A }\n  }\n\n  action(id: keyof NonNullable<this[\"actions\"]> & string, opts?: Partial<ActionCtx>): boolean {\n    const entry = this.actions?.[id]\n    const fn = typeof entry === \"function\" ? entry : entry?.fn\n    if (!fn) return false\n    fn({ source: \"programmatic\", target: this, ...opts, id, node: this })\n    return true\n  }\n\n  get mountSignal(): AbortSignal {\n    this.#mountAc ??= new AbortController()\n    return this.#mountAc.signal\n  }\n\n  get state(): SignalStore<T> & State<T> {\n    return this.#state\n  }\n\n  get children(): readonly Node[] {\n    return this.#children\n  }\n\n  protected get logger() {\n    return this.#ctx?.logger.child({\n      id: this.#id,\n      name: \"node\",\n      node: this.type ?? \"unknown\",\n    })\n  }\n\n  protected try<R>(fn: () => R): TryResult<R> {\n    const logger = this.logger\n    if (!logger) return fn() as TryResult<R>\n    return logger.try(fn) as TryResult<R>\n  }\n\n  /** Fragment protocol — opt-in. When defined, layout containers\n   *  (Box's row/column allocator) treat this node as a transparent\n   *  fragment and substitute the returned children for `this` during\n   *  flex allocation and rendering. The fragment Node still exists in\n   *  the tree (it's mounted; it bubbles invalidates from its\n   *  descendants), but layout sees through it.\n   *\n   *  Used by `show`, `errorBoundary`, `suspense`: their children carry\n   *  their own flex props through to the parent box, can share its\n   *  `gap`, and a row containing a `show` with multiple flex children\n   *  allocates per-leaf-slot rather than collapsing into one. */\n  protected layoutChildren?(): readonly Node[]\n\n  // Make parent readonly\n  get parent(): Node | undefined {\n    return this.#parent\n  }\n\n  /** Mount context when this node is attached to a surface — surface\n   *  identifier plus scoped handles to router / overlay / tree lookups.\n   *  `undefined` before mount and after unmount. Exposed so widget\n   *  authors can reach renderer services without closing over a ref. */\n  get ctx(): MountCtx | undefined {\n    return this.#ctx\n  }\n\n  get surface(): SurfaceType | undefined {\n    return this.#ctx?.surface\n  }\n\n  get mounted(): boolean {\n    return this.#ctx !== undefined\n  }\n\n  /**\n   * Read or set the node's `id`. Called without args, returns the\n   * current id. Called with a string, sets it and returns `this` for\n   * chaining — useful when building trees inline:\n   *\n   * ```ts\n   * input({...}).id(\"chat-input\").focus().on(\"submit\", ...)\n   * ```\n   *\n   * The id is used by `ctx.getNode(id)` / `Renderer.getNode(id)` for\n   * tree lookups, and by the input router as a per-instance scope for\n   * keymap bindings (alongside the class-level `type`).\n   */\n  id(): string | undefined\n  id(value: string): this\n  id(value?: string): string | undefined | this {\n    if (value === undefined) return this.#id\n    this.#id = value\n    return this\n  }\n\n  async getLayout(ctx: RenderCtx): Promise<Layout | undefined> {\n    if (!this.layout) return\n    return this.layout(ctx)\n  }\n\n  get layoutNodes(): readonly Node[] {\n    if (this.layoutChildren === undefined) return [this]\n    const ret: Node[] = []\n    for (const c of this.with(() => this.layoutChildren?.()) ?? []) ret.push(...c.layoutNodes)\n    return ret\n  }\n\n  addActionTarget(node: Node): this {\n    this.#actionTargets.add(node)\n    return this\n  }\n\n  removeActionTarget(node: Node): this {\n    this.#actionTargets.delete(node)\n    return this\n  }\n\n  get actionTargets(): Iterable<Node> {\n    return this.#actionTargets\n  }\n\n  invalidate(): this {\n    this.#cache = undefined\n    // Suppress only when this invalidate originates from *inside this\n    // node's own render call stack* — e.g. Markdown mutating its child\n    // Text inside its own `_render`. The active render observes the\n    // mutation as part of its own logic and produces rows that already\n    // reflect it, so we skip the cascade *and* the generation bump:\n    // the cache writeback at the end of the render is valid.\n    //\n    // External mutations (network callbacks, event handlers) and\n    // mutations cascading up from a *deeper* render's own call stack\n    // (e.g. Text._render mutating something that bubbles to Markdown\n    // mid-Markdown-render) run outside *this* node's ALS scope, so\n    // `inRenderContextOf(this)` returns `false` and they emit + bump\n    // normally — the in-flight render's rows are stale, the cache\n    // writeback gets skipped, and the surface schedules a fresh paint.\n    if (inRenderContextOf(this)) return this\n    this.#invalidations++\n    // Always emit and always cascade — surfaces (stream, UI) dedupe\n    // via their own `scheduled` flag, and the parent's cache always\n    // includes whatever rows we returned last render, so a child\n    // mutation always implies a stale parent cache. (We previously\n    // skipped the cascade when `hadCache` was false, which was buggy:\n    // a node that intentionally doesn't cache — e.g. one whose\n    // `_render` mutates a child mid-render and skips the writeback —\n    // would silently fail to dirty its parent on the next mutation,\n    // pinning the surface to the first render's output.)\n    void this.emit(\"invalidate\")\n    this.parent?.invalidate()\n    return this\n  }\n\n  with<R>(fn: () => R): R {\n    return withActiveNode(this, () => fn())\n  }\n\n  async render(ctx: RenderCtx): Promise<string[]> {\n    // `visible: false` on the state suppresses the render entirely —\n    // no `_render` call, no cached rows, zero layout footprint. Opt-in\n    // via `state.visible`; absence or `true` is the default shown path.\n    // Resolve inside the tracking ctx so a signal accessor read\n    // subscribes this node. Async work registered via `createAsync` is\n    // fire-and-forget here; surfaces that need a \"wait until settled\"\n    // commit (Stream) install a `SuspenseContext` boundary at their\n    // append boundary and await it before painting.\n    this.#rendering ??= this.with(() => this.#render(ctx))\n\n    try {\n      return await this.#rendering\n    } finally {\n      this.#rendering = undefined\n    }\n  }\n\n  async #render(ctx: RenderCtx): Promise<string[]> {\n    // Cache the hidden result too, so a later `invalidate()` sees\n    // `hadCache === true` and cascades up — otherwise a toggleable\n    // panel (autocomplete, modal) whose first paint happened while\n    // hidden would swallow the flip-to-visible invalidate.\n    if (!(unwrap(this.state.visible) ?? true)) {\n      this.#cache = { rows: [], version: ctx.version, width: ctx.width }\n      return this.#cache.rows\n    }\n    // Cache key includes `ctx.width` because rendered output is\n    // width-dependent. `version` alone catches state/theme mutations\n    // (top-level bumps version on theme change), but a parent passing\n    // a different `width` to the same node — common in flex\n    // measure-then-allocate passes — needs a fresh render.\n    if (this.#cache?.version === ctx.version && this.#cache.width === ctx.width) {\n      return this.#cache.rows\n    }\n    // Capture the invalidation count *before* awaiting `_render`. If\n    // it bumps mid-render, the rows we get back are based on stale\n    // state — the external mutation that bumped it has already emitted\n    // and re-scheduled the surface, so skip caching. The re-paint will\n    // run a fresh `_render` against the latest state.\n    const stamp = this.#invalidations\n    try {\n      const rows = await this._render(ctx)\n      if (this.#invalidations === stamp) {\n        this.#cache = { rows, version: ctx.version, width: ctx.width }\n      }\n      return rows\n    } catch (error) {\n      this.logger?.error(error)\n      // Don't cache the error result — a later invalidate should\n      // re-render and give the user a chance to recover.\n      this.#cache = undefined\n      return [\n        ctx.style.error(\n          `[Node render error: ${error instanceof Error ? error.message : String(error)}]`\n        ),\n      ]\n    }\n  }\n\n  protected abstract _render(ctx: RenderCtx): Promise<string[]> | string[]\n\n  add(child: Node): this {\n    this.splice(this.#children.length, 0, child)\n    return this\n  }\n\n  remove(child: Node): this {\n    const i = this.#children.indexOf(child)\n    if (i === -1) return this\n    this.splice(i, 1)\n    return this\n  }\n\n  splice(start: number, deleteCount: number, ...items: Node[]): this {\n    // Reject self-insertion — a node in its own children list would\n    // create a cycle and stack-overflow on traversal.\n    const filtered: Node[] = []\n    for (const c of items) {\n      if (c === this) continue\n      filtered.push(c)\n    }\n\n    // If any item is already a child of this container, pull it out\n    // first so we don't end up with duplicates. Adjust `start` when a\n    // removal falls before it so the caller-relative index is preserved.\n    let adjustedStart = Math.max(0, Math.min(start, this.#children.length))\n    for (const c of filtered) {\n      if (c.parent !== this) continue\n      const i = this.#children.indexOf(c)\n      if (i === -1) continue\n      this.#children.splice(i, 1)\n      if (i < adjustedStart) adjustedStart--\n    }\n\n    const removed = this.#children.splice(adjustedStart, deleteCount, ...filtered)\n    for (const c of removed) {\n      void this.emit(\"childremoved\", { child: c })\n      if (c.mounted) c.unmount()\n      if (c.parent === this) c.#parent = undefined\n    }\n    for (const c of filtered) {\n      // Detach from old parent before rewriting `#parent`, so the old\n      // parent's `remove()` path observes a consistent `c.parent === old`\n      // and cleans up its own bookkeeping.\n      if (c.parent && c.parent !== this) {\n        c.unmount()\n        c.parent.remove(c)\n      }\n      c.#parent = this\n      void this.emit(\"childadded\", { child: c })\n      if (this.#ctx !== undefined) c.mount(this.#ctx)\n    }\n    this.invalidate()\n    return this\n  }\n\n  clear(): this {\n    this.splice(0, this.#children.length)\n    return this\n  }\n\n  mount(ctx: MountCtx): this {\n    if (this.#ctx?.surface === ctx.surface) return this\n    if (this.#ctx) {\n      throw new Error(\n        `Node is already mounted on \"${this.#ctx.surface}\" (requested \"${ctx.surface}\"). Unmount first if you meant to move it.`\n      )\n    }\n    // Make sure state.visible is tracked and will trigger invalidate\n    withActiveNode(this, () => unwrap(this.state.visible))\n    this.#ctx = ctx\n    this.#registerActionMeta(ctx)\n    void this.emit(\"mount\")\n    for (const c of this.#children) c.mount(ctx)\n    return this\n  }\n\n  /** Contribute any `ActionInfo`-shaped entries in `this.actions` to\n   *  the catalog. The instance `fn` stays on the node (dispatch finds\n   *  it via the focus-chain walk); only metadata lands in the registry.\n   *  Uses `extend: false` so defaults don't clobber user overrides\n   *  that were registered before the widget mounted. */\n  #registerActionMeta(ctx: MountCtx): void {\n    if (!this.actions) return\n    const metas: Record<string, ActionDef> = {}\n    let any = false\n    for (const [id, entry] of Object.entries(this.actions)) {\n      if (typeof entry === \"function\") continue\n      const { fn: _fn, ...info } = entry\n      metas[id] = info\n      any = true\n    }\n    if (any) ctx.actions.register(metas, { default: true })\n  }\n\n  unmount(): this {\n    if (!this.#ctx) return this\n    this.#mountAc?.abort()\n    this.#mountAc = undefined\n    for (const c of this.#children) c.unmount()\n    void this.emit(\"unmount\")\n    this.#ctx.input.blur(this)\n    this.#ctx = undefined\n    return this\n  }\n\n  /** Become the focused node. Routes through the MountCtx, which emits\n   *  `blur` on the previous focus and `focus` on this node.\n   *\n   *  When called before the node is mounted (the common case for\n   *  `input({ focus: true }).on(...)` style setup), the focus is\n   *  deferred until the next `mount` event. That keeps the API\n   *  synchronous and side-effect-free at build time — callers don't\n   *  have to think about ordering. */\n  focus(): this {\n    if (!this.#ctx) {\n      this.once(\"mount\", () => this.focus())\n      return this\n    }\n    this.#ctx.input.focus(this)\n    return this\n  }\n\n  /** Release focus. No-op when not mounted. */\n  blur(): this {\n    this.#ctx?.input.blur(this)\n    return this\n  }\n\n  get visible() {\n    return unwrap(this.state.visible) ?? true\n  }\n\n  show(): this {\n    if (this.visible) return this\n    this.state.visible = true\n    void this.emit(\"show\")\n    return this\n  }\n\n  hide(): this {\n    if (!this.visible) return this\n    this.state.visible = false\n    void this.emit(\"hide\")\n    return this\n  }\n\n  toggle(): this {\n    this.state.visible = !this.visible\n    return this\n  }\n\n  ref<N extends Node>(ref?: Ref<this extends N ? N : never>): this {\n    if (ref) ref.value = this as unknown as Exclude<typeof ref.value, undefined>\n    return this\n  }\n\n  isVisible(): boolean {\n    return this.visible && (this.parent ? this.parent.isVisible() : true)\n  }\n}\n\n/** Runtime type guard for Node.\n *\n * @internal*/\nexport function isNode(x: unknown): x is Node {\n  return x instanceof Node\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AA8CA,IAAsB,OAAtB,cAAiF,QAG/E;CACA;CACA;CACA;;;;;;;CAOA,iBAAiB;CACjB,YAA6B,CAAC;CAC9B;CACA;CACA;CACA,iCAAiB,IAAI,IAAU;CAC/B;CACA;CACA;CAGA,YAAY,OAAiB,GAAG,UAAkB;EAChD,MAAM;EACN,KAAK,eAAe,QAAQ;GAC1B,MAAM,SAAS,KAAK;GACpB,IAAI,QAAQ,OAAO,MAAM,GAAG;QAEvB,QAAQ,MAAM,0DAA0D,GAAG;EAClF;EAOA,KAAK,SAAS,YAAY,KAAK;EAC/B,SAAS,SAAS,MAAM,KAAK,IAAI,CAAC,CAAC;CACrC;CAEA,aAAwD;EACtD,OAAO;CACT;CAEA,YAAqC,SAAmC;EACtE,KAAK,UAAU;GAAE,GAAG,KAAK;GAAS,GAAG;EAAQ;EAC7C,OAAO;CACT;CAEA,OAAO,IAAiD,MAAoC;EAC1F,MAAM,QAAQ,KAAK,UAAU;EAC7B,MAAM,KAAK,OAAO,UAAU,aAAa,QAAQ,OAAO;EACxD,IAAI,CAAC,IAAI,OAAO;EAChB,GAAG;GAAE,QAAQ;GAAgB,QAAQ;GAAM,GAAG;GAAM;GAAI,MAAM;EAAK,CAAC;EACpE,OAAO;CACT;CAEA,IAAI,cAA2B;EAC7B,KAAK,aAAa,IAAI,gBAAgB;EACtC,OAAO,KAAK,SAAS;CACvB;CAEA,IAAI,QAAmC;EACrC,OAAO,KAAK;CACd;CAEA,IAAI,WAA4B;EAC9B,OAAO,KAAK;CACd;CAEA,IAAc,SAAS;EACrB,OAAO,KAAK,MAAM,OAAO,MAAM;GAC7B,IAAI,KAAK;GACT,MAAM;GACN,MAAM,KAAK,QAAQ;EACrB,CAAC;CACH;CAEA,IAAiB,IAA2B;EAC1C,MAAM,SAAS,KAAK;EACpB,IAAI,CAAC,QAAQ,OAAO,GAAG;EACvB,OAAO,OAAO,IAAI,EAAE;CACtB;CAgBA,IAAI,SAA2B;EAC7B,OAAO,KAAK;CACd;;;;;CAMA,IAAI,MAA4B;EAC9B,OAAO,KAAK;CACd;CAEA,IAAI,UAAmC;EACrC,OAAO,KAAK,MAAM;CACpB;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,SAAS,KAAA;CACvB;CAiBA,GAAG,OAA2C;EAC5C,IAAI,UAAU,KAAA,GAAW,OAAO,KAAK;EACrC,KAAK,MAAM;EACX,OAAO;CACT;CAEA,MAAM,UAAU,KAA6C;EAC3D,IAAI,CAAC,KAAK,QAAQ;EAClB,OAAO,KAAK,OAAO,GAAG;CACxB;CAEA,IAAI,cAA+B;EACjC,IAAI,KAAK,mBAAmB,KAAA,GAAW,OAAO,CAAC,IAAI;EACnD,MAAM,MAAc,CAAC;EACrB,KAAK,MAAM,KAAK,KAAK,WAAW,KAAK,iBAAiB,CAAC,KAAK,CAAC,GAAG,IAAI,KAAK,GAAG,EAAE,WAAW;EACzF,OAAO;CACT;CAEA,gBAAgB,MAAkB;EAChC,KAAK,eAAe,IAAI,IAAI;EAC5B,OAAO;CACT;CAEA,mBAAmB,MAAkB;EACnC,KAAK,eAAe,OAAO,IAAI;EAC/B,OAAO;CACT;CAEA,IAAI,gBAAgC;EAClC,OAAO,KAAK;CACd;CAEA,aAAmB;EACjB,KAAK,SAAS,KAAA;EAed,IAAI,kBAAkB,IAAI,GAAG,OAAO;EACpC,KAAK;EAUL,KAAU,KAAK,YAAY;EAC3B,KAAK,QAAQ,WAAW;EACxB,OAAO;CACT;CAEA,KAAQ,IAAgB;EACtB,OAAO,eAAe,YAAY,GAAG,CAAC;CACxC;CAEA,MAAM,OAAO,KAAmC;EAS9C,KAAK,eAAe,KAAK,WAAW,KAAK,QAAQ,GAAG,CAAC;EAErD,IAAI;GACF,OAAO,MAAM,KAAK;EACpB,UAAU;GACR,KAAK,aAAa,KAAA;EACpB;CACF;CAEA,MAAM,QAAQ,KAAmC;EAK/C,IAAI,EAAE,OAAO,KAAK,MAAM,OAAO,KAAK,OAAO;GACzC,KAAK,SAAS;IAAE,MAAM,CAAC;IAAG,SAAS,IAAI;IAAS,OAAO,IAAI;GAAM;GACjE,OAAO,KAAK,OAAO;EACrB;EAMA,IAAI,KAAK,QAAQ,YAAY,IAAI,WAAW,KAAK,OAAO,UAAU,IAAI,OACpE,OAAO,KAAK,OAAO;EAOrB,MAAM,QAAQ,KAAK;EACnB,IAAI;GACF,MAAM,OAAO,MAAM,KAAK,QAAQ,GAAG;GACnC,IAAI,KAAK,mBAAmB,OAC1B,KAAK,SAAS;IAAE;IAAM,SAAS,IAAI;IAAS,OAAO,IAAI;GAAM;GAE/D,OAAO;EACT,SAAS,OAAO;GACd,KAAK,QAAQ,MAAM,KAAK;GAGxB,KAAK,SAAS,KAAA;GACd,OAAO,CACL,IAAI,MAAM,MACR,uBAAuB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,EAAE,EAChF,CACF;EACF;CACF;CAIA,IAAI,OAAmB;EACrB,KAAK,OAAO,KAAK,UAAU,QAAQ,GAAG,KAAK;EAC3C,OAAO;CACT;CAEA,OAAO,OAAmB;EACxB,MAAM,IAAI,KAAK,UAAU,QAAQ,KAAK;EACtC,IAAI,MAAM,IAAI,OAAO;EACrB,KAAK,OAAO,GAAG,CAAC;EAChB,OAAO;CACT;CAEA,OAAO,OAAe,aAAqB,GAAG,OAAqB;EAGjE,MAAM,WAAmB,CAAC;EAC1B,KAAK,MAAM,KAAK,OAAO;GACrB,IAAI,MAAM,MAAM;GAChB,SAAS,KAAK,CAAC;EACjB;EAKA,IAAI,gBAAgB,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,KAAK,UAAU,MAAM,CAAC;EACtE,KAAK,MAAM,KAAK,UAAU;GACxB,IAAI,EAAE,WAAW,MAAM;GACvB,MAAM,IAAI,KAAK,UAAU,QAAQ,CAAC;GAClC,IAAI,MAAM,IAAI;GACd,KAAK,UAAU,OAAO,GAAG,CAAC;GAC1B,IAAI,IAAI,eAAe;EACzB;EAEA,MAAM,UAAU,KAAK,UAAU,OAAO,eAAe,aAAa,GAAG,QAAQ;EAC7E,KAAK,MAAM,KAAK,SAAS;GACvB,KAAU,KAAK,gBAAgB,EAAE,OAAO,EAAE,CAAC;GAC3C,IAAI,EAAE,SAAS,EAAE,QAAQ;GACzB,IAAI,EAAE,WAAW,MAAM,EAAE,UAAU,KAAA;EACrC;EACA,KAAK,MAAM,KAAK,UAAU;GAIxB,IAAI,EAAE,UAAU,EAAE,WAAW,MAAM;IACjC,EAAE,QAAQ;IACV,EAAE,OAAO,OAAO,CAAC;GACnB;GACA,EAAE,UAAU;GACZ,KAAU,KAAK,cAAc,EAAE,OAAO,EAAE,CAAC;GACzC,IAAI,KAAK,SAAS,KAAA,GAAW,EAAE,MAAM,KAAK,IAAI;EAChD;EACA,KAAK,WAAW;EAChB,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,OAAO,GAAG,KAAK,UAAU,MAAM;EACpC,OAAO;CACT;CAEA,MAAM,KAAqB;EACzB,IAAI,KAAK,MAAM,YAAY,IAAI,SAAS,OAAO;EAC/C,IAAI,KAAK,MACP,MAAM,IAAI,MACR,+BAA+B,KAAK,KAAK,QAAQ,gBAAgB,IAAI,QAAQ,2CAC/E;EAGF,eAAe,YAAY,OAAO,KAAK,MAAM,OAAO,CAAC;EACrD,KAAK,OAAO;EACZ,KAAK,oBAAoB,GAAG;EAC5B,KAAU,KAAK,OAAO;EACtB,KAAK,MAAM,KAAK,KAAK,WAAW,EAAE,MAAM,GAAG;EAC3C,OAAO;CACT;;;;;;CAOA,oBAAoB,KAAqB;EACvC,IAAI,CAAC,KAAK,SAAS;EACnB,MAAM,QAAmC,CAAC;EAC1C,IAAI,MAAM;EACV,KAAK,MAAM,CAAC,IAAI,UAAU,OAAO,QAAQ,KAAK,OAAO,GAAG;GACtD,IAAI,OAAO,UAAU,YAAY;GACjC,MAAM,EAAE,IAAI,KAAK,GAAG,SAAS;GAC7B,MAAM,MAAM;GACZ,MAAM;EACR;EACA,IAAI,KAAK,IAAI,QAAQ,SAAS,OAAO,EAAE,SAAS,KAAK,CAAC;CACxD;CAEA,UAAgB;EACd,IAAI,CAAC,KAAK,MAAM,OAAO;EACvB,KAAK,UAAU,MAAM;EACrB,KAAK,WAAW,KAAA;EAChB,KAAK,MAAM,KAAK,KAAK,WAAW,EAAE,QAAQ;EAC1C,KAAU,KAAK,SAAS;EACxB,KAAK,KAAK,MAAM,KAAK,IAAI;EACzB,KAAK,OAAO,KAAA;EACZ,OAAO;CACT;;;;;;;;;CAUA,QAAc;EACZ,IAAI,CAAC,KAAK,MAAM;GACd,KAAK,KAAK,eAAe,KAAK,MAAM,CAAC;GACrC,OAAO;EACT;EACA,KAAK,KAAK,MAAM,MAAM,IAAI;EAC1B,OAAO;CACT;;CAGA,OAAa;EACX,KAAK,MAAM,MAAM,KAAK,IAAI;EAC1B,OAAO;CACT;CAEA,IAAI,UAAU;EACZ,OAAO,OAAO,KAAK,MAAM,OAAO,KAAK;CACvC;CAEA,OAAa;EACX,IAAI,KAAK,SAAS,OAAO;EACzB,KAAK,MAAM,UAAU;EACrB,KAAU,KAAK,MAAM;EACrB,OAAO;CACT;CAEA,OAAa;EACX,IAAI,CAAC,KAAK,SAAS,OAAO;EAC1B,KAAK,MAAM,UAAU;EACrB,KAAU,KAAK,MAAM;EACrB,OAAO;CACT;CAEA,SAAe;EACb,KAAK,MAAM,UAAU,CAAC,KAAK;EAC3B,OAAO;CACT;CAEA,IAAoB,KAA6C;EAC/D,IAAI,KAAK,IAAI,QAAQ;EACrB,OAAO;CACT;CAEA,YAAqB;EACnB,OAAO,KAAK,YAAY,KAAK,SAAS,KAAK,OAAO,UAAU,IAAI;CAClE;AACF"}

package/dist/{overlay-9xNgsuuy.mjs → overlay-9WXYiGgW.mjs}

@@ -1,4 +1,4 @@
-import { n as box } from "./box-DepqUtuo.mjs";
+import { n as box } from "./box-DLEcEvDH.mjs";
 //#region src/widgets/overlay.ts
 function overlay(state, ...children) {
 	const node = box({
@@ -15,4 +15,4 @@ function overlay(state, ...children) {
 //#endregion
 export { overlay as t };
 
-//# sourceMappingURL=overlay-9xNgsuuy.mjs.map
+//# sourceMappingURL=overlay-9WXYiGgW.mjs.map

package/dist/{overlay-9xNgsuuy.mjs.map → overlay-9WXYiGgW.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"overlay-9xNgsuuy.mjs","names":[],"sources":["../src/widgets/overlay.ts"],"sourcesContent":["import type { Emitter } from \"@zaly/shared\"\nimport type { Node } from \"../core/node.ts\"\nimport type { State } from \"../core/state.ts\"\nimport type { Box, BoxStyle } from \"./box.ts\"\n\nimport { box } from \"./box.ts\"\n\nexport interface OverlayState {\n  /** Absolute column (1-based) of the overlay's left edge. */\n  x: number\n  /** Absolute row (1-based) of the overlay's top edge. */\n  y: number\n  /** Higher zIndex paints on top. Default: 0. */\n  zIndex?: number\n  verticalAnchor?: \"top\" | \"center\" | \"bottom\"\n  horizontalAnchor?: \"left\" | \"center\" | \"right\"\n  relative?: \"screen\" | \"ui\" | \"stream\"\n  /** If true, the overlay will be automatically removed from the renderer when closed.\n   * When false, the overlay will remain in the renderer but will be hidden.\n   * Default: true. */\n  removeOnClose?: boolean\n}\n\ntype OverlayEvents = {\n  close: {}\n}\n\nexport type Overlay<T extends Node[] = Node[]> = Box<OverlayState> & {\n  children: T\n} & Emitter<OverlayEvents>\n\nexport function overlay<T extends Node[] = Node[]>(\n  state: State<OverlayState & BoxStyle>,\n  ...children: T\n): Overlay<T> {\n  const node = box({ visible: false, ...state }, ...children) as Overlay<T>\n  node.withActions({\n    \"overlay.close\": {\n      desc: \"Close overlay\",\n      fn: () => ((node.state.removeOnClose ?? true) ? node.ctx?.overlay.remove(node) : node.hide()),\n      keys: [\"esc\", \"ctrl-c\"],\n    },\n  })\n  return node\n}\n"],"mappings":";;AA+BA,SAAgB,QACd,OACA,GAAG,UACS;CACZ,MAAM,OAAO,IAAI;EAAE,SAAS;EAAO,GAAG;CAAM,GAAG,GAAG,QAAQ;CAC1D,KAAK,YAAY,EACf,iBAAiB;EACf,MAAM;EACN,UAAY,KAAK,MAAM,iBAAiB,OAAQ,KAAK,KAAK,QAAQ,OAAO,IAAI,IAAI,KAAK,KAAK;EAC3F,MAAM,CAAC,OAAO,QAAQ;CACxB,EACF,CAAC;CACD,OAAO;AACT"}
+{"version":3,"file":"overlay-9WXYiGgW.mjs","names":[],"sources":["../src/widgets/overlay.ts"],"sourcesContent":["import type { Emitter } from \"@zaly/shared\"\nimport type { Node } from \"../core/node.ts\"\nimport type { State } from \"../core/state.ts\"\nimport type { Box, BoxStyle } from \"./box.ts\"\n\nimport { box } from \"./box.ts\"\n\nexport interface OverlayState {\n  /** Absolute column (1-based) of the overlay's left edge. */\n  x: number\n  /** Absolute row (1-based) of the overlay's top edge. */\n  y: number\n  /** Higher zIndex paints on top. Default: 0. */\n  zIndex?: number\n  verticalAnchor?: \"top\" | \"center\" | \"bottom\"\n  horizontalAnchor?: \"left\" | \"center\" | \"right\"\n  relative?: \"screen\" | \"ui\" | \"stream\"\n  /** If true, the overlay will be automatically removed from the renderer when closed.\n   * When false, the overlay will remain in the renderer but will be hidden.\n   * Default: true. */\n  removeOnClose?: boolean\n}\n\ntype OverlayEvents = {\n  close: {}\n}\n\nexport type Overlay<T extends Node[] = Node[]> = Box<OverlayState> & {\n  children: T\n} & Emitter<OverlayEvents>\n\nexport function overlay<T extends Node[] = Node[]>(\n  state: State<OverlayState & BoxStyle>,\n  ...children: T\n): Overlay<T> {\n  const node = box({ visible: false, ...state }, ...children) as Overlay<T>\n  node.withActions({\n    \"overlay.close\": {\n      desc: \"Close overlay\",\n      fn: () => ((node.state.removeOnClose ?? true) ? node.ctx?.overlay.remove(node) : node.hide()),\n      keys: [\"esc\", \"ctrl-c\"],\n    },\n  })\n  return node\n}\n"],"mappings":";;AA+BA,SAAgB,QACd,OACA,GAAG,UACS;CACZ,MAAM,OAAO,IAAI;EAAE,SAAS;EAAO,GAAG;CAAM,GAAG,GAAG,QAAQ;CAC1D,KAAK,YAAY,EACf,iBAAiB;EACf,MAAM;EACN,UAAY,KAAK,MAAM,iBAAiB,OAAQ,KAAK,KAAK,QAAQ,OAAO,IAAI,IAAI,KAAK,KAAK;EAC3F,MAAM,CAAC,OAAO,QAAQ;CACxB,EACF,CAAC;CACD,OAAO;AACT"}

package/dist/{picker-cH-rc7-X.mjs → picker-BqHINl_a.mjs}

@@ -1,6 +1,6 @@
 import { S as unwrap, f as effect, h as memo, s as createProgressive, x as untrack } from "./reactive-f7NpAi69.mjs";
 import { t as widget } from "./widget-BkMwhY2p.mjs";
-import { t as Input } from "./input-CRBuTrsL.mjs";
+import { t as Input } from "./input-D7fQEUdt.mjs";
 import { n as select } from "./select-m7NE6Rwa.mjs";
 import { t as tree } from "./tree-Bo1afYhe.mjs";
 import { sliceAnsi, stripAnsi } from "@zaly/shared/ansi";
@@ -11,10 +11,10 @@ const SCORE_GAP_START = -3;
 const SCORE_GAP_EXTENSION = -1;
 const BONUS_BOUNDARY = SCORE_MATCH / 2;
 const BONUS_NONWORD = SCORE_MATCH / 2;
-const BONUS_CAMEL_123 = BONUS_BOUNDARY - 1;
+const BONUS_CAMEL_123 = 7;
 const BONUS_CONSECUTIVE = 4;
 const BONUS_FIRST_CHAR_MULTIPLIER = 2;
-const BONUS_NO_PATH_SEP = BONUS_BOUNDARY - 2;
+const BONUS_NO_PATH_SEP = 6;
 const CHAR_WHITE = 0;
 const CHAR_NONWORD = 1;
 const CHAR_DELIMITER = 2;
@@ -618,4 +618,4 @@ const picker = widget((props) => {
 //#endregion
 export { picker as t };
 
-//# sourceMappingURL=picker-cH-rc7-X.mjs.map
+//# sourceMappingURL=picker-BqHINl_a.mjs.map

package/dist/picker-BqHINl_a.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"picker-BqHINl_a.mjs","names":[],"sources":["../src/search/score.ts","../src/search/matcher.ts","../src/search/sort.ts","../src/search/search.ts","../src/widgets/picker.ts"],"sourcesContent":["export type ScoreOptions = {\n  filenameBonus?: boolean\n  historyBonus?: boolean\n}\n\nconst SCORE_MATCH = 16\nconst SCORE_GAP_START = -3\nconst SCORE_GAP_EXTENSION = -1\n\nconst BONUS_BOUNDARY = SCORE_MATCH / 2\nconst BONUS_NONWORD = SCORE_MATCH / 2\nconst BONUS_CAMEL_123 = BONUS_BOUNDARY - 1\nconst BONUS_CONSECUTIVE = -(SCORE_GAP_START + SCORE_GAP_EXTENSION)\nconst BONUS_FIRST_CHAR_MULTIPLIER = 2\nconst BONUS_NO_PATH_SEP = BONUS_BOUNDARY - 2\n\nconst CHAR_WHITE = 0\nconst CHAR_NONWORD = 1\nconst CHAR_DELIMITER = 2\nconst CHAR_LOWER = 3\nconst CHAR_UPPER = 4\nconst CHAR_LETTER = 5\nconst CHAR_NUMBER = 6\n\nconst PATH_SEPS = new Set([\"/\", \"\\\\\"])\n\nconst CHAR_CLASS = Array.from({ length: 256 }, (_, b) => {\n  const ch = String.fromCharCode(b)\n  if (/\\s/.test(ch)) return CHAR_WHITE\n  if (String.raw`/\\,:;|`.includes(ch)) return CHAR_DELIMITER\n  if (b >= 48 && b <= 57) return CHAR_NUMBER\n  if (b >= 65 && b <= 90) return CHAR_UPPER\n  if (b >= 97 && b <= 122) return CHAR_LOWER\n  return CHAR_NONWORD\n})\n\nfunction charClass(str: string, pos: number): number {\n  const code = str.charCodeAt(pos)\n  return code <= 255 ? (CHAR_CLASS[code] ?? CHAR_NONWORD) : CHAR_LETTER\n}\n\nexport class Score {\n  readonly #opts: ScoreOptions\n  readonly #bonusMatrix: number[][] = []\n  readonly #bonusBoundaryWhite: number\n  readonly #bonusBoundaryDelimiter: number\n\n  #consecutive = 0\n  #firstBonus = 0\n  #prev: number | undefined\n  #prevClass = CHAR_WHITE\n  #score = 0\n  #str = \"\"\n\n  isFile = false\n\n  constructor(opts: ScoreOptions = {}) {\n    this.#opts = opts\n    this.#bonusBoundaryWhite = opts.historyBonus ? BONUS_BOUNDARY : BONUS_BOUNDARY + 2\n    this.#bonusBoundaryDelimiter = opts.historyBonus ? BONUS_BOUNDARY : BONUS_BOUNDARY + 1\n    for (let prev = 0; prev <= 6; prev++) {\n      this.#bonusMatrix[prev] = []\n      for (let curr = 0; curr <= 6; curr++) {\n        this.#bonusMatrix[prev][curr] = this.#computeBonus(prev, curr)\n      }\n    }\n  }\n\n  get score(): number {\n    return this.#score\n  }\n\n  isLeftBoundary(str: string, pos: number): boolean {\n    return pos === 0 || charClass(str, pos - 1) < CHAR_LOWER\n  }\n\n  isRightBoundary(str: string, pos: number): boolean {\n    return pos === str.length - 1 || charClass(str, pos + 1) < CHAR_LOWER\n  }\n\n  init(str: string, first: number): void {\n    this.#str = str\n    this.#score = 0\n    this.#consecutive = 0\n    this.#prevClass = first > 0 ? charClass(str, first - 1) : CHAR_WHITE\n    this.#prev = undefined\n    this.#firstBonus = 0\n\n    if (this.isFile && this.#opts.filenameBonus && !hasPathSepAfter(str, first)) {\n      this.#score += BONUS_NO_PATH_SEP\n    }\n    this.update(first)\n  }\n\n  update(pos: number): void {\n    const cls = charClass(this.#str, pos)\n    const gap = this.#prev === undefined ? 0 : pos - this.#prev - 1\n    let bonus = 0\n\n    if (gap > 0) {\n      this.#prevClass = charClass(this.#str, pos - 1)\n      bonus = this.#bonusMatrix[this.#prevClass]?.[cls] ?? 0\n      this.#score += SCORE_GAP_START + (gap - 1) * SCORE_GAP_EXTENSION\n      this.#consecutive = 0\n      this.#firstBonus = 0\n    } else {\n      bonus = this.#bonusMatrix[this.#prevClass]?.[cls] ?? 0\n      if (this.#consecutive === 0) {\n        this.#firstBonus = bonus\n      } else {\n        if (bonus >= BONUS_BOUNDARY && bonus > this.#firstBonus) this.#firstBonus = bonus\n        bonus = Math.max(bonus, this.#firstBonus, BONUS_CONSECUTIVE)\n      }\n      this.#consecutive++\n    }\n\n    if (this.#prev === undefined) bonus *= BONUS_FIRST_CHAR_MULTIPLIER\n    this.#score += SCORE_MATCH + bonus\n    this.#prevClass = cls\n    this.#prev = pos\n  }\n\n  get(str: string, from: number, to: number): number {\n    this.init(str, from)\n    for (let i = from + 1; i <= to; i++) this.update(i)\n    return this.#score\n  }\n\n  #computeBonus(prev: number, curr: number): number {\n    if (curr > CHAR_NONWORD) {\n      if (prev === CHAR_WHITE) return this.#bonusBoundaryWhite\n      if (prev === CHAR_DELIMITER) return this.#bonusBoundaryDelimiter\n      if (prev === CHAR_NONWORD) return BONUS_BOUNDARY\n    }\n    if (\n      (prev === CHAR_LOWER && curr === CHAR_UPPER) ||\n      (prev !== CHAR_NUMBER && curr === CHAR_NUMBER)\n    ) {\n      return BONUS_CAMEL_123\n    }\n    if (curr === CHAR_NONWORD || curr === CHAR_DELIMITER) return BONUS_NONWORD\n    if (curr === CHAR_WHITE) return BONUS_BOUNDARY + 2\n    return 0\n  }\n}\n\nfunction hasPathSepAfter(str: string, first: number): boolean {\n  for (let i = first + 1; i < str.length; i++) if (PATH_SEPS.has(str[i])) return true\n  return false\n}\n","import type { ScoreOptions } from \"./score.ts\"\n\nimport { Score } from \"./score.ts\"\n\nexport type SearchItem = {\n  idx?: number\n  score?: number\n  file?: string\n  text: string\n}\n\nexport type ScoredItem<T extends SearchItem = SearchItem> = T & {\n  score: number\n  topk?: boolean\n}\n\nexport type MatcherOptions = ScoreOptions & {\n  fuzzy?: boolean\n  ignorecase?: boolean\n  regex?: boolean\n  smartcase?: boolean\n}\n\ntype Mod = {\n  chars: string[]\n  entropy: number\n  exactPrefix?: boolean\n  exactSuffix?: boolean\n  field?: string\n  fuzzy?: boolean\n  ignorecase?: boolean\n  inverse?: boolean\n  pattern: string\n  re?: RegExp\n  regex?: boolean\n  word?: boolean\n}\n\ntype Match = {\n  from: number\n  score: number\n  search: string\n  str: string\n  to: number\n}\n\nexport class Matcher<T extends SearchItem = SearchItem> {\n  readonly opts: Required<Pick<MatcherOptions, \"fuzzy\" | \"ignorecase\" | \"smartcase\">> &\n    MatcherOptions\n  readonly score: Score\n  mods: Mod[][] = []\n  one: Mod | undefined\n  pattern = \"\"\n  tick = 0\n\n  constructor(opts: MatcherOptions = {}) {\n    this.opts = {\n      fuzzy: true,\n      ignorecase: true,\n      smartcase: true,\n      ...opts,\n    }\n    this.score = new Score(opts)\n  }\n\n  empty(): boolean {\n    return this.mods.length === 0\n  }\n\n  init(pattern: string): boolean {\n    pattern = pattern.trim()\n    if (pattern === this.pattern) return false\n\n    this.pattern = pattern\n    this.tick++\n    this.mods = []\n    this.one = undefined\n    if (pattern === \"\") return true\n\n    if (this.opts.regex) {\n      this.mods = [[this.#prepare(pattern)]]\n    } else {\n      let isOr = false\n      for (const part of pattern.split(/ +/)) {\n        if (part === \"|\") {\n          isOr = true\n          continue\n        }\n        const mod = this.#prepare(part)\n        if (mod.pattern === \"\") continue\n        if (isOr && this.mods.length > 0) this.mods.at(-1)?.push(mod)\n        else this.mods.push([mod])\n        isOr = false\n      }\n    }\n\n    this.mods = this.mods.map((ors) => ors.toSorted((a, b) => a.entropy - b.entropy))\n    this.mods = this.mods.toSorted((a, b) => (b[0]?.entropy ?? 0) - (a[0]?.entropy ?? 0))\n    if (this.mods.length === 1 && this.mods[0]?.length === 1) this.one = this.mods[0][0]\n    return true\n  }\n\n  match(input: T | string): number {\n    if (this.empty()) return 1000\n    const item = typeof input === \"string\" ? { text: input } : input\n    if (this.one) return this.#match(item, this.one)?.score ?? 0\n\n    let score = 0\n    for (const any of this.mods) {\n      let match: Match | undefined\n      for (const mod of any) {\n        match = this.#match(item, mod)\n        if (match) break\n      }\n      if (!match) return 0\n      score += match.score\n    }\n    return score\n  }\n\n  update(item: T): ScoredItem<T> {\n    const score = this.match(item)\n    const it = item as ScoredItem<T>\n    it.score = score\n    return it\n  }\n\n  positions(input: T | string): number[] {\n    if (this.empty()) return []\n    const item = typeof input === \"string\" ? { text: input } : input\n    const ret: number[] = []\n    const all = this.mods.flat()\n    for (const mod of all) {\n      const match = this.#match(item, mod)\n      if (!match) continue\n      if (mod.fuzzy) ret.push(...this.#fuzzyPositions(match.search, mod.chars, match.from))\n      else for (let i = match.from; i <= match.to; i++) ret.push(i)\n    }\n    return [...new Set(ret)].toSorted((a, b) => a - b)\n  }\n\n  fields(): string[] {\n    const ret = new Set<string>()\n    for (const mod of this.mods.flat()) ret.add(mod.field ?? \"text\")\n    return [...ret]\n  }\n\n  #prepare(pattern: string): Mod {\n    const mod: Mod = { chars: [], entropy: 0, pattern }\n\n    if (this.opts.regex) {\n      mod.regex = true\n      const isLower = mod.pattern.toLowerCase() === mod.pattern\n      mod.ignorecase = this.opts.smartcase ? isLower : this.opts.ignorecase\n      try {\n        mod.re = new RegExp(mod.pattern, mod.ignorecase ? \"i\" : undefined)\n      } catch {\n        mod.re = undefined\n      }\n    } else {\n      const file = parseFilePattern(pattern)\n      if (file) {\n        mod.field = \"file\"\n        mod.pattern = `${file}$`\n      }\n\n      const field = mod.pattern.match(/^([\\w_][\\w_]+):(.*)$/)\n      if (field) {\n        mod.field = field[1]\n        mod.pattern = field[2]\n      }\n\n      mod.ignorecase = this.opts.ignorecase\n      const isLower = mod.pattern.toLowerCase() === mod.pattern\n      if (this.opts.smartcase) mod.ignorecase = isLower\n      mod.fuzzy = this.opts.fuzzy\n      if (!mod.fuzzy) mod.entropy += 10\n\n      if (mod.pattern.startsWith(\"!\")) {\n        mod.fuzzy = false\n        mod.inverse = true\n        mod.pattern = mod.pattern.slice(1)\n        mod.entropy -= 1\n      }\n      if (mod.pattern.startsWith(\"'\")) {\n        mod.fuzzy = false\n        mod.pattern = mod.pattern.slice(1)\n        mod.entropy += 10\n        if (mod.pattern.endsWith(\"'\")) {\n          mod.word = true\n          mod.pattern = mod.pattern.slice(0, -1)\n          mod.entropy += 10\n        }\n      } else if (mod.pattern.startsWith(\"^\")) {\n        mod.fuzzy = false\n        mod.exactPrefix = true\n        mod.pattern = mod.pattern.slice(1)\n        mod.entropy += 20\n      }\n      if (mod.pattern.endsWith(\"$\")) {\n        mod.fuzzy = false\n        mod.exactSuffix = true\n        mod.pattern = mod.pattern.slice(0, -1)\n        mod.entropy += 20\n      }\n\n      const rareChars = (mod.pattern.match(/[^\\w\\s]/g) ?? []).length\n      mod.entropy += Math.min(mod.pattern.length, 20) + rareChars * 2\n      if (!mod.ignorecase && !isLower) mod.entropy *= 2\n      if (mod.ignorecase) mod.pattern = mod.pattern.toLowerCase()\n    }\n\n    // oxlint-disable-next-line typescript/no-misused-spread\n    mod.chars = [...mod.pattern]\n    return mod\n  }\n\n  #match(item: SearchItem, mod: Mod): Match | undefined {\n    this.score.isFile = itemField(item, \"file\") !== undefined\n    let str = item.text\n\n    if (mod.field) {\n      const value = itemField(item, mod.field)\n      if (value === undefined)\n        return mod.inverse ? { from: 0, score: 1000, search: str, str, to: 0 } : undefined\n      str = value\n    }\n\n    const original = str\n    if (mod.ignorecase) str = str.toLowerCase()\n\n    if (mod.regex) return this.#regex(original, mod)\n    if (mod.fuzzy) return this.#fuzzy(str, original, mod.chars)\n\n    let from = -1\n    let to = -1\n    if (mod.exactPrefix) {\n      if (str.startsWith(mod.pattern)) {\n        from = 0\n        to = mod.pattern.length - 1\n      }\n    } else if (mod.exactSuffix) {\n      if (str.endsWith(mod.pattern)) {\n        from = str.length - mod.pattern.length\n        to = str.length - 1\n      }\n    } else {\n      from = str.indexOf(mod.pattern)\n      to = from + mod.pattern.length - 1\n      while (mod.word && from >= 0) {\n        if (this.score.isLeftBoundary(str, from) && this.score.isRightBoundary(str, to)) break\n        from = str.indexOf(mod.pattern, to + 1)\n        to = from + mod.pattern.length - 1\n      }\n    }\n\n    if (mod.inverse)\n      return from === -1 ? { from: 0, score: 1000, search: str, str: original, to: 0 } : undefined\n    if (from >= 0)\n      return { from, score: this.score.get(original, from, to), search: str, str: original, to }\n    return undefined\n  }\n\n  #regex(str: string, mod: Mod): Match | undefined {\n    const match = mod.re?.exec(str)\n    if (!match?.[0]) return undefined\n    const from = match.index\n    const to = from + match[0].length - 1\n    return { from, score: this.score.get(str, from, to), search: str, str, to }\n  }\n\n  #fuzzyFind(\n    str: string,\n    original: string,\n    pattern: string[],\n    init = 0\n  ): Pick<Match, \"from\" | \"to\" | \"score\"> | undefined {\n    const from = str.indexOf(pattern[0] ?? \"\", init)\n    if (from === -1) return undefined\n    this.score.init(original, from)\n    let last = from\n    for (let i = 1; i < pattern.length; i++) {\n      last = str.indexOf(pattern[i], last + 1)\n      // Bail before reading the score: a partial accumulation never\n      // escapes this method, so `#fuzzy` only ever sees a score that\n      // corresponds to a fully-matched window.\n      if (last === -1) return undefined\n      this.score.update(last)\n    }\n    return { from, score: this.score.score, to: last }\n  }\n\n  #fuzzy(str: string, original: string, pattern: string[]): Match | undefined {\n    // Anchor on every occurrence of the first char and keep the\n    // highest-scoring window. The score rides in the return value rather\n    // than being read off the shared `this.score`, so there's no\n    // \"is the accumulator aligned with `best` right now?\" invariant.\n    let best = this.#fuzzyFind(str, original, pattern)\n    if (!best) return undefined\n    for (\n      let next = this.#fuzzyFind(str, original, pattern, best.from + 1);\n      next;\n      next = this.#fuzzyFind(str, original, pattern, next.from + 1)\n    ) {\n      if (next.score > best.score) best = next\n    }\n    return { from: best.from, score: best.score, search: str, str: original, to: best.to }\n  }\n\n  #fuzzyPositions(str: string, pattern: string[], from: number): number[] {\n    const ret = [from]\n    let last = from\n    for (let i = 1; i < pattern.length; i++) {\n      last = str.indexOf(pattern[i], last + 1)\n      if (last === -1) break\n      ret.push(last)\n    }\n    return ret\n  }\n}\n\nfunction itemField(item: SearchItem, field: string): string | undefined {\n  const value = item[field as keyof SearchItem] as unknown\n  if (value === undefined || value === null) return undefined\n  if (typeof value === \"string\") return value\n  if (typeof value === \"number\" || typeof value === \"boolean\" || typeof value === \"bigint\")\n    return String(value)\n  if (Array.isArray(value)) return value.join(\" \")\n  return\n}\n\nfunction parseFilePattern(pattern: string): string | undefined {\n  return (\n    pattern.match(/^(.*[/\\\\].*):\\d*:?:?\\d*$/)?.[1] ??\n    pattern.match(/^(.+\\.[a-z_]+):\\d*:?:?\\d*$/)?.[1]\n  )\n}\n","import type { ScoredItem, SearchItem } from \"./matcher.ts\"\n\ntype SortKey<T extends SearchItem> = Extract<keyof (ScoredItem<T> & SearchItem), string>\n\nexport type SortField<T extends SearchItem = SearchItem> =\n  | SortKey<T>\n  | `#${SortKey<T>}`\n  | `${SortKey<T>}:desc`\n\nexport type ParsedField<T extends SearchItem = SearchItem> = {\n  desc?: boolean\n  len?: boolean\n  name: SortKey<T>\n}\n\nexport type Sorter<T extends SearchItem = SearchItem> = (\n  a: ScoredItem<T>,\n  b: ScoredItem<T>\n) => number\n\nfunction parse<T extends SearchItem>(field: SortField<T>): ParsedField<T> {\n  const len = field.startsWith(\"#\")\n  const desc = field.endsWith(\":desc\")\n  const name = field.replace(/^#/, \"\").replace(/:desc$/, \"\") as SortKey<T>\n  return { desc, len, name }\n}\n\nexport function sorter<T extends SearchItem>(\n  fields: readonly SortField<T>[] = [\"score:desc\", \"#text\", \"idx\"]\n): Sorter<T> {\n  const parsed: ParsedField<T>[] = fields.map(parse)\n  return (a, b) => {\n    for (const field of parsed) {\n      let av: unknown = a[field.name]\n      let bv: unknown = b[field.name]\n      if (av === undefined || bv === undefined) continue\n      if (field.len) {\n        av = typeof av === \"string\" || Array.isArray(av) ? av.length : 0\n        bv = typeof bv === \"string\" || Array.isArray(bv) ? bv.length : 0\n      }\n      if (av === bv) continue\n      if (typeof av === \"boolean\" && typeof bv === \"boolean\") {\n        av = av ? 0 : 1\n        bv = bv ? 0 : 1\n      }\n      return compare(av, bv) * (field.desc ? -1 : 1)\n    }\n    return 0\n  }\n}\n\nfunction compare(a: unknown, b: unknown): number {\n  if (typeof a === \"number\" && typeof b === \"number\") return a - b\n  if (typeof a === \"string\" && typeof b === \"string\") return a.localeCompare(b)\n  return String(a).localeCompare(String(b))\n}\n","// oxlint-disable no-await-in-loop\nimport type { MaybePromise } from \"@zaly/shared\"\nimport type { MatcherOptions, ScoredItem, SearchItem } from \"./matcher.ts\"\nimport type { Sorter, SortField } from \"./sort.ts\"\n\nimport { TopK } from \"@zaly/shared/minheap\"\nimport { Matcher } from \"./matcher.ts\"\nimport { sorter } from \"./sort.ts\"\n\nexport type SearchOptions<T extends SearchItem = SearchItem> = MatcherOptions & {\n  sort?: boolean | readonly SortField<T>[]\n  filter?: boolean\n  sortEmpty?: boolean\n  frecency?: () => (file: string) => number\n  limit?: number\n  throttle?: number\n}\n\nexport type SearchFn<T extends SearchItem = SearchItem> = (\n  query: string,\n  match: Match<T>\n) => MaybePromise<ScoredItem<T>[]>\n\nexport type SearchItems<T extends SearchItem = SearchItem> = readonly T[] | SearchFn<T>\n\n/** Match function handed to `complete`. Returns `0` for no match,\n *  positive integer otherwise — so both `match(s) > 0` and the\n *  idiomatic `.filter(match(s))` work (0 is falsy). The magnitude is a\n *  score the source can use to rank its own candidates when it cares\n *  about order. */\nexport type Match<T extends SearchItem = SearchItem> = (s: string | T) => number\n\nconst BONUS_FRECENCY = 8\nconst SEARCH_LIMIT = 1000\nconst aborted = Symbol(\"search.aborted\")\n\nexport class Searcher<T extends SearchItem = SearchItem> {\n  #opts: SearchOptions<T>\n  #sorter?: Sorter<T>\n  #matcher: Matcher<T>\n  #ac?: AbortController\n\n  constructor(opts: SearchOptions<T>) {\n    this.#opts = opts\n    const sortOpts = opts.sort === true ? undefined : opts.sort\n    this.#sorter = sortOpts === false ? undefined : sorter(sortOpts)\n    this.#matcher = new Matcher(opts)\n  }\n\n  /** Create a match function bound to the current pattern. If the\n   * matcher has been updated since the search started, match will\n   * return `0` to indicate no match, to prevent stale results */\n  createMatch(opts: { signal: AbortSignal }): Match<T> {\n    const m = this.#matcher\n    return (s: string | T) => (opts.signal.aborted ? 0 : m.match(s))\n  }\n\n  async search(\n    items: SearchItems<T>,\n    query = \"\",\n    opts: { progress?: (results: ScoredItem<T>[]) => MaybePromise } = {}\n  ): Promise<ScoredItem<T>[]> {\n    try {\n      return await this.#search(items, query, opts)\n    } catch (error) {\n      if (error === aborted) return []\n      throw error\n    }\n  }\n\n  get limit(): number {\n    return this.#opts.limit ?? (this.#sorter ? SEARCH_LIMIT : Infinity)\n  }\n\n  async #search(\n    items: SearchItems<T>,\n    query = \"\",\n    opts: { progress?: (results: ScoredItem<T>[]) => MaybePromise } = {}\n  ): Promise<ScoredItem<T>[]> {\n    this.#ac?.abort(aborted)\n    // oxlint-disable-next-line no-multi-assign\n    const ac = (this.#ac = new AbortController())\n\n    const m = this.#matcher\n    m.init(query)\n    const f = this.#opts.frecency?.()\n    const s = this.#sorter\n    const limit = this.limit\n    const ret: ScoredItem<T>[] = []\n    let match = (item: T) => this.#matcher.update(item)\n    const topk =\n      s && (this.#opts.sortEmpty || !m.empty())\n        ? new TopK<ScoredItem<T>>(limit, (a, b) => -s(a, b))\n        : undefined\n\n    if (typeof items === \"function\") {\n      match = (item: T) => item as ScoredItem<T>\n      items = await items(query, this.createMatch({ signal: ac.signal }))\n      ac.signal.throwIfAborted()\n    }\n\n    if (items.length === 0) return []\n\n    const results = () => topk?.sorted() ?? ret\n\n    // Process items in three phases, so that the results in the UI stabilize faster:\n    // - previous topk results (topk)\n    // - scored items (score)\n    // - unscored items (rest)\n    const todo: [T[], T[], T[]] = [[], [], []]\n    let idx = 0\n    if (!topk) todo[0] = items as T[]\n    else {\n      for (const item of items) {\n        item.idx = idx++\n        const it = item as ScoredItem<T>\n        if (it.topk) todo[0].push(item)\n        else if (it.score) todo[1].push(item)\n        else todo[2].push(item)\n      }\n    }\n\n    const doFilter = !m.empty() && (this.#opts.filter ?? true)\n\n    let lastYield = performance.now()\n    let dirty = false\n    let count = 0\n\n    loop: for (const todos of todo) {\n      for (const item of todos) {\n        ac.signal.throwIfAborted()\n        if (count++ % 256 === 0) {\n          const now = performance.now()\n          if (now - lastYield >= (this.#opts.throttle ?? 16)) {\n            lastYield = now\n            await new Promise((r) => setImmediate(r))\n            if (opts.progress && dirty) {\n              dirty = false\n              await opts.progress(results())\n            }\n          }\n        }\n        const si = match(item)\n        if (si.file && si.score && f) {\n          const frecency = f(si.file)\n          si.score += (1 - 1 / (1 + frecency)) * BONUS_FRECENCY\n        }\n        if (doFilter && si.score === 0) continue\n        if (topk) {\n          si.topk = false\n          const ta = topk.add(si)\n          if (ta.added) {\n            si.topk = true\n            dirty = true\n            if (ta.evicted) ta.evicted.topk = false\n          }\n        } else {\n          ret.push(si)\n          dirty = true\n          if (ret.length >= limit) break loop\n        }\n      }\n    }\n\n    return results()\n  }\n\n  positions(s: string | T): number[] {\n    return this.#matcher.positions(s)\n  }\n}\n","import type { Reactive, Ref } from \"../core/reactive.ts\"\nimport type { State } from \"../core/state.ts\"\nimport type { NodeActionMap } from \"../input/actions.ts\"\nimport type { ScoredItem, SearchItem } from \"../search/matcher.ts\"\nimport type { SearchItems, SearchOptions } from \"../search/search.ts\"\nimport type { Option, Select, SelectState } from \"./select.ts\"\nimport type { TreeItem, TreeProps } from \"./tree.ts\"\n\nimport { sliceAnsi, stripAnsi } from \"@zaly/shared/ansi\"\nimport { createProgressive, effect, memo, untrack, unwrap } from \"../core/reactive.ts\"\nimport { Searcher } from \"../search/search.ts\"\nimport { Input } from \"./input.ts\"\nimport { select } from \"./select.ts\"\nimport { tree } from \"./tree.ts\"\nimport { widget } from \"./widget.ts\"\n\nexport type PickerItem = Option & SearchItem\nexport type PickerActions = keyof ReturnType<typeof picker>[\"actions\"]\n\ntype PickerBaseProps<T extends PickerItem = PickerItem> = SearchOptions<T> & {\n  /** The `Input` to watch. Pass the node directly, or a `Ref<Input>`\n   *  populated by `node.ref(ref)` elsewhere in the tree — the latter\n   *  enables fully inline composition where the input doesn't need a\n   *  local binding. The ref is dereferenced on mount, so wiring is\n   *  type-safe and ordering-flexible (autocomplete can be constructed\n   *  before the Input is). */\n  input?: Input | Ref<Input>\n  pattern?: Reactive<string>\n  reverse?: boolean\n  actions?: NodeActionMap<Select<T>>\n}\n\nexport type PickerSelectProps<T extends PickerItem = PickerItem> = PickerBaseProps<T> &\n  Omit<SelectState<T>, \"items\"> & {\n    items: Reactive<SearchItems<T>>\n    tree?: never\n  }\n\nexport type PickerTreeProps<T extends TreeItem = TreeItem> = PickerBaseProps<T> &\n  TreeProps<T> & {\n    items?: never\n  }\n\nfunction isTree<T extends Option = Option>(\n  props: PickerTreeProps<T> | PickerSelectProps<T>\n): props is PickerTreeProps<T> {\n  return \"tree\" in props\n}\n\nexport const picker = widget(\n  <T extends PickerItem = PickerItem>(props: State<PickerSelectProps<T> | PickerTreeProps<T>>) => {\n    const pattern = memo(() => {\n      if (props.pattern !== undefined) return unwrap(props.pattern)\n      const inp = props.input instanceof Input ? props.input : props.input?.()\n      return inp?.state.value ?? \"\"\n    })\n\n    let node: Select<T>\n    let items: Reactive<SearchItems<T>>\n    if (isTree(props)) {\n      props = { filter: false, fuzzy: false, sort: false, ...props }\n      const t = tree(props)\n      node = t\n      items = t.items\n    } else {\n      node = select({ ...props, items: [] })\n      items = props.items\n    }\n    const searcher = new Searcher<T>(props)\n\n    node.extendRenderer((prev) => (item, ctx) => {\n      let row = prev(item, ctx)\n      if (!item.score) return row\n      const stripped = stripAnsi(row)\n      const positions = searcher.positions(stripped).toSorted((a, b) => b - a)\n      while (positions.length > 0) {\n        const from = positions.pop()!\n        let to = from\n        while (positions.length && positions.at(-1) === to + 1) to = positions.pop()!\n        row =\n          sliceAnsi(row, 0, from) +\n          ctx.style.accent(stripped.slice(from, to + 1)) +\n          sliceAnsi(row, to + 1)\n      }\n      return row\n    })\n\n    const results = createProgressive<ScoredItem<T>[]>(\n      async ({ set }) =>\n        await searcher.search(unwrap(items), pattern(), { progress: (r) => set(r) }),\n      {\n        initialValue: [],\n      }\n    )\n    node.state.items = results\n    if (props.input) node.bind(props.input)\n\n    const matches = () =>\n      unwrap(node.state.items)\n        .map((item, i) => [item, i] as const)\n        .filter(([item]) => item.score)\n        .map(([, i]) => i)\n\n    effect(() => {\n      const m = matches()\n      node.state.more = m.length >= searcher.limit\n      if (m.length === 0 || pattern() === \"\") return\n      untrack(() => {\n        // When filtering, go to the first (best) match.\n        // When not filtering, go to the first match that is at or after the current active index, or the first match if none are after.\n        if (props.filter === false) {\n          const active = node.active\n          node.active = m.find((i) => i >= active) ?? m[0]\n        } else node.active = 0\n      })\n    })\n\n    return node.withActions({\n      ...props.actions,\n      \"picker.next\": () => {\n        const active = node.active\n        const m = matches()\n        if (m.length === 0) return node.action(\"select.next\")\n        node.active = node.state.reverse\n          ? (m.toReversed().find((i) => i < active) ?? m.at(-1)!)\n          : (m.find((i) => i > active) ?? m[0])\n      },\n      \"picker.prev\": () => {\n        const active = node.active\n        const m = matches()\n        if (m.length === 0) return node.action(\"select.prev\")\n        node.active = node.state.reverse\n          ? (m.find((i) => i > active) ?? m[0])\n          : (m.toReversed().find((i) => i < active) ?? m.at(-1)!)\n      },\n    })\n  }\n)\n"],"mappings":";;;;;;;;AAKA,MAAM,cAAc;AACpB,MAAM,kBAAkB;AACxB,MAAM,sBAAsB;AAE5B,MAAM,iBAAiB,cAAc;AACrC,MAAM,gBAAgB,cAAc;AACpC,MAAM,kBAAkB;AACxB,MAAM,oBAAoB;AAC1B,MAAM,8BAA8B;AACpC,MAAM,oBAAoB;AAE1B,MAAM,aAAa;AACnB,MAAM,eAAe;AACrB,MAAM,iBAAiB;AACvB,MAAM,aAAa;AACnB,MAAM,aAAa;AACnB,MAAM,cAAc;AACpB,MAAM,cAAc;AAEpB,MAAM,4BAAY,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC;AAErC,MAAM,aAAa,MAAM,KAAK,EAAE,QAAQ,IAAI,IAAI,GAAG,MAAM;CACvD,MAAM,KAAK,OAAO,aAAa,CAAC;CAChC,IAAI,KAAK,KAAK,EAAE,GAAG,OAAO;CAC1B,IAAI,OAAO,GAAG,SAAS,SAAS,EAAE,GAAG,OAAO;CAC5C,IAAI,KAAK,MAAM,KAAK,IAAI,OAAO;CAC/B,IAAI,KAAK,MAAM,KAAK,IAAI,OAAO;CAC/B,IAAI,KAAK,MAAM,KAAK,KAAK,OAAO;CAChC,OAAO;AACT,CAAC;AAED,SAAS,UAAU,KAAa,KAAqB;CACnD,MAAM,OAAO,IAAI,WAAW,GAAG;CAC/B,OAAO,QAAQ,MAAO,WAAW,SAAS,eAAgB;AAC5D;AAEA,IAAa,QAAb,MAAmB;CACjB;CACA,eAAoC,CAAC;CACrC;CACA;CAEA,eAAe;CACf,cAAc;CACd;CACA,aAAa;CACb,SAAS;CACT,OAAO;CAEP,SAAS;CAET,YAAY,OAAqB,CAAC,GAAG;EACnC,KAAK,QAAQ;EACb,KAAK,sBAAsB,KAAK,eAAe,iBAAiB;EAChE,KAAK,0BAA0B,KAAK,eAAe,iBAAiB;EACpE,KAAK,IAAI,OAAO,GAAG,QAAQ,GAAG,QAAQ;GACpC,KAAK,aAAa,QAAQ,CAAC;GAC3B,KAAK,IAAI,OAAO,GAAG,QAAQ,GAAG,QAC5B,KAAK,aAAa,KAAK,CAAC,QAAQ,KAAK,cAAc,MAAM,IAAI;EAEjE;CACF;CAEA,IAAI,QAAgB;EAClB,OAAO,KAAK;CACd;CAEA,eAAe,KAAa,KAAsB;EAChD,OAAO,QAAQ,KAAK,UAAU,KAAK,MAAM,CAAC,IAAI;CAChD;CAEA,gBAAgB,KAAa,KAAsB;EACjD,OAAO,QAAQ,IAAI,SAAS,KAAK,UAAU,KAAK,MAAM,CAAC,IAAI;CAC7D;CAEA,KAAK,KAAa,OAAqB;EACrC,KAAK,OAAO;EACZ,KAAK,SAAS;EACd,KAAK,eAAe;EACpB,KAAK,aAAa,QAAQ,IAAI,UAAU,KAAK,QAAQ,CAAC,IAAI;EAC1D,KAAK,QAAQ,KAAA;EACb,KAAK,cAAc;EAEnB,IAAI,KAAK,UAAU,KAAK,MAAM,iBAAiB,CAAC,gBAAgB,KAAK,KAAK,GACxE,KAAK,UAAU;EAEjB,KAAK,OAAO,KAAK;CACnB;CAEA,OAAO,KAAmB;EACxB,MAAM,MAAM,UAAU,KAAK,MAAM,GAAG;EACpC,MAAM,MAAM,KAAK,UAAU,KAAA,IAAY,IAAI,MAAM,KAAK,QAAQ;EAC9D,IAAI,QAAQ;EAEZ,IAAI,MAAM,GAAG;GACX,KAAK,aAAa,UAAU,KAAK,MAAM,MAAM,CAAC;GAC9C,QAAQ,KAAK,aAAa,KAAK,WAAW,GAAG,QAAQ;GACrD,KAAK,UAAU,mBAAmB,MAAM,KAAK;GAC7C,KAAK,eAAe;GACpB,KAAK,cAAc;EACrB,OAAO;GACL,QAAQ,KAAK,aAAa,KAAK,WAAW,GAAG,QAAQ;GACrD,IAAI,KAAK,iBAAiB,GACxB,KAAK,cAAc;QACd;IACL,IAAI,SAAS,kBAAkB,QAAQ,KAAK,aAAa,KAAK,cAAc;IAC5E,QAAQ,KAAK,IAAI,OAAO,KAAK,aAAa,iBAAiB;GAC7D;GACA,KAAK;EACP;EAEA,IAAI,KAAK,UAAU,KAAA,GAAW,SAAS;EACvC,KAAK,UAAU,cAAc;EAC7B,KAAK,aAAa;EAClB,KAAK,QAAQ;CACf;CAEA,IAAI,KAAa,MAAc,IAAoB;EACjD,KAAK,KAAK,KAAK,IAAI;EACnB,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,IAAI,KAAK,KAAK,OAAO,CAAC;EAClD,OAAO,KAAK;CACd;CAEA,cAAc,MAAc,MAAsB;EAChD,IAAI,OAAO,cAAc;GACvB,IAAI,SAAS,YAAY,OAAO,KAAK;GACrC,IAAI,SAAS,gBAAgB,OAAO,KAAK;GACzC,IAAI,SAAS,cAAc,OAAO;EACpC;EACA,IACG,SAAS,cAAc,SAAS,cAChC,SAAS,eAAe,SAAS,aAElC,OAAO;EAET,IAAI,SAAS,gBAAgB,SAAS,gBAAgB,OAAO;EAC7D,IAAI,SAAS,YAAY,OAAO;EAChC,OAAO;CACT;AACF;AAEA,SAAS,gBAAgB,KAAa,OAAwB;CAC5D,KAAK,IAAI,IAAI,QAAQ,GAAG,IAAI,IAAI,QAAQ,KAAK,IAAI,UAAU,IAAI,IAAI,EAAE,GAAG,OAAO;CAC/E,OAAO;AACT;;;ACvGA,IAAa,UAAb,MAAwD;CACtD;CAEA;CACA,OAAgB,CAAC;CACjB;CACA,UAAU;CACV,OAAO;CAEP,YAAY,OAAuB,CAAC,GAAG;EACrC,KAAK,OAAO;GACV,OAAO;GACP,YAAY;GACZ,WAAW;GACX,GAAG;EACL;EACA,KAAK,QAAQ,IAAI,MAAM,IAAI;CAC7B;CAEA,QAAiB;EACf,OAAO,KAAK,KAAK,WAAW;CAC9B;CAEA,KAAK,SAA0B;EAC7B,UAAU,QAAQ,KAAK;EACvB,IAAI,YAAY,KAAK,SAAS,OAAO;EAErC,KAAK,UAAU;EACf,KAAK;EACL,KAAK,OAAO,CAAC;EACb,KAAK,MAAM,KAAA;EACX,IAAI,YAAY,IAAI,OAAO;EAE3B,IAAI,KAAK,KAAK,OACZ,KAAK,OAAO,CAAC,CAAC,KAAK,SAAS,OAAO,CAAC,CAAC;OAChC;GACL,IAAI,OAAO;GACX,KAAK,MAAM,QAAQ,QAAQ,MAAM,IAAI,GAAG;IACtC,IAAI,SAAS,KAAK;KAChB,OAAO;KACP;IACF;IACA,MAAM,MAAM,KAAK,SAAS,IAAI;IAC9B,IAAI,IAAI,YAAY,IAAI;IACxB,IAAI,QAAQ,KAAK,KAAK,SAAS,GAAG,KAAK,KAAK,GAAG,EAAE,CAAC,EAAE,KAAK,GAAG;SACvD,KAAK,KAAK,KAAK,CAAC,GAAG,CAAC;IACzB,OAAO;GACT;EACF;EAEA,KAAK,OAAO,KAAK,KAAK,KAAK,QAAQ,IAAI,UAAU,GAAG,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC;EAChF,KAAK,OAAO,KAAK,KAAK,UAAU,GAAG,OAAO,EAAE,EAAE,EAAE,WAAW,MAAM,EAAE,EAAE,EAAE,WAAW,EAAE;EACpF,IAAI,KAAK,KAAK,WAAW,KAAK,KAAK,KAAK,EAAE,EAAE,WAAW,GAAG,KAAK,MAAM,KAAK,KAAK,EAAE,CAAC;EAClF,OAAO;CACT;CAEA,MAAM,OAA2B;EAC/B,IAAI,KAAK,MAAM,GAAG,OAAO;EACzB,MAAM,OAAO,OAAO,UAAU,WAAW,EAAE,MAAM,MAAM,IAAI;EAC3D,IAAI,KAAK,KAAK,OAAO,KAAK,OAAO,MAAM,KAAK,GAAG,CAAC,EAAE,SAAS;EAE3D,IAAI,QAAQ;EACZ,KAAK,MAAM,OAAO,KAAK,MAAM;GAC3B,IAAI;GACJ,KAAK,MAAM,OAAO,KAAK;IACrB,QAAQ,KAAK,OAAO,MAAM,GAAG;IAC7B,IAAI,OAAO;GACb;GACA,IAAI,CAAC,OAAO,OAAO;GACnB,SAAS,MAAM;EACjB;EACA,OAAO;CACT;CAEA,OAAO,MAAwB;EAC7B,MAAM,QAAQ,KAAK,MAAM,IAAI;EAC7B,MAAM,KAAK;EACX,GAAG,QAAQ;EACX,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,IAAI,KAAK,MAAM,GAAG,OAAO,CAAC;EAC1B,MAAM,OAAO,OAAO,UAAU,WAAW,EAAE,MAAM,MAAM,IAAI;EAC3D,MAAM,MAAgB,CAAC;EACvB,MAAM,MAAM,KAAK,KAAK,KAAK;EAC3B,KAAK,MAAM,OAAO,KAAK;GACrB,MAAM,QAAQ,KAAK,OAAO,MAAM,GAAG;GACnC,IAAI,CAAC,OAAO;GACZ,IAAI,IAAI,OAAO,IAAI,KAAK,GAAG,KAAK,gBAAgB,MAAM,QAAQ,IAAI,OAAO,MAAM,IAAI,CAAC;QAC/E,KAAK,IAAI,IAAI,MAAM,MAAM,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK,CAAC;EAC9D;EACA,OAAO,CAAC,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,UAAU,GAAG,MAAM,IAAI,CAAC;CACnD;CAEA,SAAmB;EACjB,MAAM,sBAAM,IAAI,IAAY;EAC5B,KAAK,MAAM,OAAO,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI,IAAI,SAAS,MAAM;EAC/D,OAAO,CAAC,GAAG,GAAG;CAChB;CAEA,SAAS,SAAsB;EAC7B,MAAM,MAAW;GAAE,OAAO,CAAC;GAAG,SAAS;GAAG;EAAQ;EAElD,IAAI,KAAK,KAAK,OAAO;GACnB,IAAI,QAAQ;GACZ,MAAM,UAAU,IAAI,QAAQ,YAAY,MAAM,IAAI;GAClD,IAAI,aAAa,KAAK,KAAK,YAAY,UAAU,KAAK,KAAK;GAC3D,IAAI;IACF,IAAI,KAAK,IAAI,OAAO,IAAI,SAAS,IAAI,aAAa,MAAM,KAAA,CAAS;GACnE,QAAQ;IACN,IAAI,KAAK,KAAA;GACX;EACF,OAAO;GACL,MAAM,OAAO,iBAAiB,OAAO;GACrC,IAAI,MAAM;IACR,IAAI,QAAQ;IACZ,IAAI,UAAU,GAAG,KAAK;GACxB;GAEA,MAAM,QAAQ,IAAI,QAAQ,MAAM,sBAAsB;GACtD,IAAI,OAAO;IACT,IAAI,QAAQ,MAAM;IAClB,IAAI,UAAU,MAAM;GACtB;GAEA,IAAI,aAAa,KAAK,KAAK;GAC3B,MAAM,UAAU,IAAI,QAAQ,YAAY,MAAM,IAAI;GAClD,IAAI,KAAK,KAAK,WAAW,IAAI,aAAa;GAC1C,IAAI,QAAQ,KAAK,KAAK;GACtB,IAAI,CAAC,IAAI,OAAO,IAAI,WAAW;GAE/B,IAAI,IAAI,QAAQ,WAAW,GAAG,GAAG;IAC/B,IAAI,QAAQ;IACZ,IAAI,UAAU;IACd,IAAI,UAAU,IAAI,QAAQ,MAAM,CAAC;IACjC,IAAI,WAAW;GACjB;GACA,IAAI,IAAI,QAAQ,WAAW,GAAG,GAAG;IAC/B,IAAI,QAAQ;IACZ,IAAI,UAAU,IAAI,QAAQ,MAAM,CAAC;IACjC,IAAI,WAAW;IACf,IAAI,IAAI,QAAQ,SAAS,GAAG,GAAG;KAC7B,IAAI,OAAO;KACX,IAAI,UAAU,IAAI,QAAQ,MAAM,GAAG,EAAE;KACrC,IAAI,WAAW;IACjB;GACF,OAAO,IAAI,IAAI,QAAQ,WAAW,GAAG,GAAG;IACtC,IAAI,QAAQ;IACZ,IAAI,cAAc;IAClB,IAAI,UAAU,IAAI,QAAQ,MAAM,CAAC;IACjC,IAAI,WAAW;GACjB;GACA,IAAI,IAAI,QAAQ,SAAS,GAAG,GAAG;IAC7B,IAAI,QAAQ;IACZ,IAAI,cAAc;IAClB,IAAI,UAAU,IAAI,QAAQ,MAAM,GAAG,EAAE;IACrC,IAAI,WAAW;GACjB;GAEA,MAAM,aAAa,IAAI,QAAQ,MAAM,UAAU,KAAK,CAAC,EAAA,CAAG;GACxD,IAAI,WAAW,KAAK,IAAI,IAAI,QAAQ,QAAQ,EAAE,IAAI,YAAY;GAC9D,IAAI,CAAC,IAAI,cAAc,CAAC,SAAS,IAAI,WAAW;GAChD,IAAI,IAAI,YAAY,IAAI,UAAU,IAAI,QAAQ,YAAY;EAC5D;EAGA,IAAI,QAAQ,CAAC,GAAG,IAAI,OAAO;EAC3B,OAAO;CACT;CAEA,OAAO,MAAkB,KAA6B;EACpD,KAAK,MAAM,SAAS,UAAU,MAAM,MAAM,MAAM,KAAA;EAChD,IAAI,MAAM,KAAK;EAEf,IAAI,IAAI,OAAO;GACb,MAAM,QAAQ,UAAU,MAAM,IAAI,KAAK;GACvC,IAAI,UAAU,KAAA,GACZ,OAAO,IAAI,UAAU;IAAE,MAAM;IAAG,OAAO;IAAM,QAAQ;IAAK;IAAK,IAAI;GAAE,IAAI,KAAA;GAC3E,MAAM;EACR;EAEA,MAAM,WAAW;EACjB,IAAI,IAAI,YAAY,MAAM,IAAI,YAAY;EAE1C,IAAI,IAAI,OAAO,OAAO,KAAK,OAAO,UAAU,GAAG;EAC/C,IAAI,IAAI,OAAO,OAAO,KAAK,OAAO,KAAK,UAAU,IAAI,KAAK;EAE1D,IAAI,OAAO;EACX,IAAI,KAAK;EACT,IAAI,IAAI,aACF;OAAA,IAAI,WAAW,IAAI,OAAO,GAAG;IAC/B,OAAO;IACP,KAAK,IAAI,QAAQ,SAAS;GAC5B;SACK,IAAI,IAAI,aACT;OAAA,IAAI,SAAS,IAAI,OAAO,GAAG;IAC7B,OAAO,IAAI,SAAS,IAAI,QAAQ;IAChC,KAAK,IAAI,SAAS;GACpB;SACK;GACL,OAAO,IAAI,QAAQ,IAAI,OAAO;GAC9B,KAAK,OAAO,IAAI,QAAQ,SAAS;GACjC,OAAO,IAAI,QAAQ,QAAQ,GAAG;IAC5B,IAAI,KAAK,MAAM,eAAe,KAAK,IAAI,KAAK,KAAK,MAAM,gBAAgB,KAAK,EAAE,GAAG;IACjF,OAAO,IAAI,QAAQ,IAAI,SAAS,KAAK,CAAC;IACtC,KAAK,OAAO,IAAI,QAAQ,SAAS;GACnC;EACF;EAEA,IAAI,IAAI,SACN,OAAO,SAAS,KAAK;GAAE,MAAM;GAAG,OAAO;GAAM,QAAQ;GAAK,KAAK;GAAU,IAAI;EAAE,IAAI,KAAA;EACrF,IAAI,QAAQ,GACV,OAAO;GAAE;GAAM,OAAO,KAAK,MAAM,IAAI,UAAU,MAAM,EAAE;GAAG,QAAQ;GAAK,KAAK;GAAU;EAAG;CAE7F;CAEA,OAAO,KAAa,KAA6B;EAC/C,MAAM,QAAQ,IAAI,IAAI,KAAK,GAAG;EAC9B,IAAI,CAAC,QAAQ,IAAI,OAAO,KAAA;EACxB,MAAM,OAAO,MAAM;EACnB,MAAM,KAAK,OAAO,MAAM,EAAE,CAAC,SAAS;EACpC,OAAO;GAAE;GAAM,OAAO,KAAK,MAAM,IAAI,KAAK,MAAM,EAAE;GAAG,QAAQ;GAAK;GAAK;EAAG;CAC5E;CAEA,WACE,KACA,UACA,SACA,OAAO,GAC2C;EAClD,MAAM,OAAO,IAAI,QAAQ,QAAQ,MAAM,IAAI,IAAI;EAC/C,IAAI,SAAS,IAAI,OAAO,KAAA;EACxB,KAAK,MAAM,KAAK,UAAU,IAAI;EAC9B,IAAI,OAAO;EACX,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvC,OAAO,IAAI,QAAQ,QAAQ,IAAI,OAAO,CAAC;GAIvC,IAAI,SAAS,IAAI,OAAO,KAAA;GACxB,KAAK,MAAM,OAAO,IAAI;EACxB;EACA,OAAO;GAAE;GAAM,OAAO,KAAK,MAAM;GAAO,IAAI;EAAK;CACnD;CAEA,OAAO,KAAa,UAAkB,SAAsC;EAK1E,IAAI,OAAO,KAAK,WAAW,KAAK,UAAU,OAAO;EACjD,IAAI,CAAC,MAAM,OAAO,KAAA;EAClB,KACE,IAAI,OAAO,KAAK,WAAW,KAAK,UAAU,SAAS,KAAK,OAAO,CAAC,GAChE,MACA,OAAO,KAAK,WAAW,KAAK,UAAU,SAAS,KAAK,OAAO,CAAC,GAE5D,IAAI,KAAK,QAAQ,KAAK,OAAO,OAAO;EAEtC,OAAO;GAAE,MAAM,KAAK;GAAM,OAAO,KAAK;GAAO,QAAQ;GAAK,KAAK;GAAU,IAAI,KAAK;EAAG;CACvF;CAEA,gBAAgB,KAAa,SAAmB,MAAwB;EACtE,MAAM,MAAM,CAAC,IAAI;EACjB,IAAI,OAAO;EACX,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvC,OAAO,IAAI,QAAQ,QAAQ,IAAI,OAAO,CAAC;GACvC,IAAI,SAAS,IAAI;GACjB,IAAI,KAAK,IAAI;EACf;EACA,OAAO;CACT;AACF;AAEA,SAAS,UAAU,MAAkB,OAAmC;CACtE,MAAM,QAAQ,KAAK;CACnB,IAAI,UAAU,KAAA,KAAa,UAAU,MAAM,OAAO,KAAA;CAClD,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,aAAa,OAAO,UAAU,UAC9E,OAAO,OAAO,KAAK;CACrB,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,MAAM,KAAK,GAAG;AAEjD;AAEA,SAAS,iBAAiB,SAAqC;CAC7D,OACE,QAAQ,MAAM,0BAA0B,CAAC,GAAG,MAC5C,QAAQ,MAAM,4BAA4B,CAAC,GAAG;AAElD;;;AC5TA,SAAS,MAA4B,OAAqC;CACxE,MAAM,MAAM,MAAM,WAAW,GAAG;CAGhC,OAAO;EAAE,MAFI,MAAM,SAAS,OAEhB;EAAG;EAAK,MADP,MAAM,QAAQ,MAAM,EAAE,CAAC,CAAC,QAAQ,UAAU,EAChC;CAAE;AAC3B;AAEA,SAAgB,OACd,SAAkC;CAAC;CAAc;CAAS;AAAK,GACpD;CACX,MAAM,SAA2B,OAAO,IAAI,KAAK;CACjD,QAAQ,GAAG,MAAM;EACf,KAAK,MAAM,SAAS,QAAQ;GAC1B,IAAI,KAAc,EAAE,MAAM;GAC1B,IAAI,KAAc,EAAE,MAAM;GAC1B,IAAI,OAAO,KAAA,KAAa,OAAO,KAAA,GAAW;GAC1C,IAAI,MAAM,KAAK;IACb,KAAK,OAAO,OAAO,YAAY,MAAM,QAAQ,EAAE,IAAI,GAAG,SAAS;IAC/D,KAAK,OAAO,OAAO,YAAY,MAAM,QAAQ,EAAE,IAAI,GAAG,SAAS;GACjE;GACA,IAAI,OAAO,IAAI;GACf,IAAI,OAAO,OAAO,aAAa,OAAO,OAAO,WAAW;IACtD,KAAK,KAAK,IAAI;IACd,KAAK,KAAK,IAAI;GAChB;GACA,OAAO,QAAQ,IAAI,EAAE,KAAK,MAAM,OAAO,KAAK;EAC9C;EACA,OAAO;CACT;AACF;AAEA,SAAS,QAAQ,GAAY,GAAoB;CAC/C,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU,OAAO,IAAI;CAC/D,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU,OAAO,EAAE,cAAc,CAAC;CAC5E,OAAO,OAAO,CAAC,CAAC,CAAC,cAAc,OAAO,CAAC,CAAC;AAC1C;;;ACvBA,MAAM,iBAAiB;AACvB,MAAM,eAAe;AACrB,MAAM,UAAU,OAAO,gBAAgB;AAEvC,IAAa,WAAb,MAAyD;CACvD;CACA;CACA;CACA;CAEA,YAAY,MAAwB;EAClC,KAAK,QAAQ;EACb,MAAM,WAAW,KAAK,SAAS,OAAO,KAAA,IAAY,KAAK;EACvD,KAAK,UAAU,aAAa,QAAQ,KAAA,IAAY,OAAO,QAAQ;EAC/D,KAAK,WAAW,IAAI,QAAQ,IAAI;CAClC;;;;CAKA,YAAY,MAAyC;EACnD,MAAM,IAAI,KAAK;EACf,QAAQ,MAAmB,KAAK,OAAO,UAAU,IAAI,EAAE,MAAM,CAAC;CAChE;CAEA,MAAM,OACJ,OACA,QAAQ,IACR,OAAkE,CAAC,GACzC;EAC1B,IAAI;GACF,OAAO,MAAM,KAAK,QAAQ,OAAO,OAAO,IAAI;EAC9C,SAAS,OAAO;GACd,IAAI,UAAU,SAAS,OAAO,CAAC;GAC/B,MAAM;EACR;CACF;CAEA,IAAI,QAAgB;EAClB,OAAO,KAAK,MAAM,UAAU,KAAK,UAAU,eAAe;CAC5D;CAEA,MAAM,QACJ,OACA,QAAQ,IACR,OAAkE,CAAC,GACzC;EAC1B,KAAK,KAAK,MAAM,OAAO;EAEvB,MAAM,KAAM,KAAK,MAAM,IAAI,gBAAgB;EAE3C,MAAM,IAAI,KAAK;EACf,EAAE,KAAK,KAAK;EACZ,MAAM,IAAI,KAAK,MAAM,WAAW;EAChC,MAAM,IAAI,KAAK;EACf,MAAM,QAAQ,KAAK;EACnB,MAAM,MAAuB,CAAC;EAC9B,IAAI,SAAS,SAAY,KAAK,SAAS,OAAO,IAAI;EAClD,MAAM,OACJ,MAAM,KAAK,MAAM,aAAa,CAAC,EAAE,MAAM,KACnC,IAAI,KAAoB,QAAQ,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,IACjD,KAAA;EAEN,IAAI,OAAO,UAAU,YAAY;GAC/B,SAAS,SAAY;GACrB,QAAQ,MAAM,MAAM,OAAO,KAAK,YAAY,EAAE,QAAQ,GAAG,OAAO,CAAC,CAAC;GAClE,GAAG,OAAO,eAAe;EAC3B;EAEA,IAAI,MAAM,WAAW,GAAG,OAAO,CAAC;EAEhC,MAAM,gBAAgB,MAAM,OAAO,KAAK;EAMxC,MAAM,OAAwB;GAAC,CAAC;GAAG,CAAC;GAAG,CAAC;EAAC;EACzC,IAAI,MAAM;EACV,IAAI,CAAC,MAAM,KAAK,KAAK;OAEnB,KAAK,MAAM,QAAQ,OAAO;GACxB,KAAK,MAAM;GACX,MAAM,KAAK;GACX,IAAI,GAAG,MAAM,KAAK,EAAE,CAAC,KAAK,IAAI;QACzB,IAAI,GAAG,OAAO,KAAK,EAAE,CAAC,KAAK,IAAI;QAC/B,KAAK,EAAE,CAAC,KAAK,IAAI;EACxB;EAGF,MAAM,WAAW,CAAC,EAAE,MAAM,MAAM,KAAK,MAAM,UAAU;EAErD,IAAI,YAAY,YAAY,IAAI;EAChC,IAAI,QAAQ;EACZ,IAAI,QAAQ;EAEZ,MAAM,KAAK,MAAM,SAAS,MACxB,KAAK,MAAM,QAAQ,OAAO;GACxB,GAAG,OAAO,eAAe;GACzB,IAAI,UAAU,QAAQ,GAAG;IACvB,MAAM,MAAM,YAAY,IAAI;IAC5B,IAAI,MAAM,cAAc,KAAK,MAAM,YAAY,KAAK;KAClD,YAAY;KACZ,MAAM,IAAI,SAAS,MAAM,aAAa,CAAC,CAAC;KACxC,IAAI,KAAK,YAAY,OAAO;MAC1B,QAAQ;MACR,MAAM,KAAK,SAAS,QAAQ,CAAC;KAC/B;IACF;GACF;GACA,MAAM,KAAK,MAAM,IAAI;GACrB,IAAI,GAAG,QAAQ,GAAG,SAAS,GAAG;IAC5B,MAAM,WAAW,EAAE,GAAG,IAAI;IAC1B,GAAG,UAAU,IAAI,KAAK,IAAI,aAAa;GACzC;GACA,IAAI,YAAY,GAAG,UAAU,GAAG;GAChC,IAAI,MAAM;IACR,GAAG,OAAO;IACV,MAAM,KAAK,KAAK,IAAI,EAAE;IACtB,IAAI,GAAG,OAAO;KACZ,GAAG,OAAO;KACV,QAAQ;KACR,IAAI,GAAG,SAAS,GAAG,QAAQ,OAAO;IACpC;GACF,OAAO;IACL,IAAI,KAAK,EAAE;IACX,QAAQ;IACR,IAAI,IAAI,UAAU,OAAO,MAAM;GACjC;EACF;EAGF,OAAO,QAAQ;CACjB;CAEA,UAAU,GAAyB;EACjC,OAAO,KAAK,SAAS,UAAU,CAAC;CAClC;AACF;;;AC/HA,SAAS,OACP,OAC6B;CAC7B,OAAO,UAAU;AACnB;AAEA,MAAa,SAAS,QACgB,UAA4D;CAC9F,MAAM,UAAU,WAAW;EACzB,IAAI,MAAM,YAAY,KAAA,GAAW,OAAO,OAAO,MAAM,OAAO;EAE5D,QADY,MAAM,iBAAiB,QAAQ,MAAM,QAAQ,MAAM,QAAQ,EAAA,EAC3D,MAAM,SAAS;CAC7B,CAAC;CAED,IAAI;CACJ,IAAI;CACJ,IAAI,OAAO,KAAK,GAAG;EACjB,QAAQ;GAAE,QAAQ;GAAO,OAAO;GAAO,MAAM;GAAO,GAAG;EAAM;EAC7D,MAAM,IAAI,KAAK,KAAK;EACpB,OAAO;EACP,QAAQ,EAAE;CACZ,OAAO;EACL,OAAO,OAAO;GAAE,GAAG;GAAO,OAAO,CAAC;EAAE,CAAC;EACrC,QAAQ,MAAM;CAChB;CACA,MAAM,WAAW,IAAI,SAAY,KAAK;CAEtC,KAAK,gBAAgB,UAAU,MAAM,QAAQ;EAC3C,IAAI,MAAM,KAAK,MAAM,GAAG;EACxB,IAAI,CAAC,KAAK,OAAO,OAAO;EACxB,MAAM,WAAW,UAAU,GAAG;EAC9B,MAAM,YAAY,SAAS,UAAU,QAAQ,CAAC,CAAC,UAAU,GAAG,MAAM,IAAI,CAAC;EACvE,OAAO,UAAU,SAAS,GAAG;GAC3B,MAAM,OAAO,UAAU,IAAI;GAC3B,IAAI,KAAK;GACT,OAAO,UAAU,UAAU,UAAU,GAAG,EAAE,MAAM,KAAK,GAAG,KAAK,UAAU,IAAI;GAC3E,MACE,UAAU,KAAK,GAAG,IAAI,IACtB,IAAI,MAAM,OAAO,SAAS,MAAM,MAAM,KAAK,CAAC,CAAC,IAC7C,UAAU,KAAK,KAAK,CAAC;EACzB;EACA,OAAO;CACT,CAAC;CAED,MAAM,UAAU,kBACd,OAAO,EAAE,UACP,MAAM,SAAS,OAAO,OAAO,KAAK,GAAG,QAAQ,GAAG,EAAE,WAAW,MAAM,IAAI,CAAC,EAAE,CAAC,GAC7E,EACE,cAAc,CAAC,EACjB,CACF;CACA,KAAK,MAAM,QAAQ;CACnB,IAAI,MAAM,OAAO,KAAK,KAAK,MAAM,KAAK;CAEtC,MAAM,gBACJ,OAAO,KAAK,MAAM,KAAK,CAAC,CACrB,KAAK,MAAM,MAAM,CAAC,MAAM,CAAC,CAAU,CAAC,CACpC,QAAQ,CAAC,UAAU,KAAK,KAAK,CAAC,CAC9B,KAAK,GAAG,OAAO,CAAC;CAErB,aAAa;EACX,MAAM,IAAI,QAAQ;EAClB,KAAK,MAAM,OAAO,EAAE,UAAU,SAAS;EACvC,IAAI,EAAE,WAAW,KAAK,QAAQ,MAAM,IAAI;EACxC,cAAc;GAGZ,IAAI,MAAM,WAAW,OAAO;IAC1B,MAAM,SAAS,KAAK;IACpB,KAAK,SAAS,EAAE,MAAM,MAAM,KAAK,MAAM,KAAK,EAAE;GAChD,OAAO,KAAK,SAAS;EACvB,CAAC;CACH,CAAC;CAED,OAAO,KAAK,YAAY;EACtB,GAAG,MAAM;EACT,qBAAqB;GACnB,MAAM,SAAS,KAAK;GACpB,MAAM,IAAI,QAAQ;GAClB,IAAI,EAAE,WAAW,GAAG,OAAO,KAAK,OAAO,aAAa;GACpD,KAAK,SAAS,KAAK,MAAM,UACpB,EAAE,WAAW,CAAC,CAAC,MAAM,MAAM,IAAI,MAAM,KAAK,EAAE,GAAG,EAAE,IACjD,EAAE,MAAM,MAAM,IAAI,MAAM,KAAK,EAAE;EACtC;EACA,qBAAqB;GACnB,MAAM,SAAS,KAAK;GACpB,MAAM,IAAI,QAAQ;GAClB,IAAI,EAAE,WAAW,GAAG,OAAO,KAAK,OAAO,aAAa;GACpD,KAAK,SAAS,KAAK,MAAM,UACpB,EAAE,MAAM,MAAM,IAAI,MAAM,KAAK,EAAE,KAC/B,EAAE,WAAW,CAAC,CAAC,MAAM,MAAM,IAAI,MAAM,KAAK,EAAE,GAAG,EAAE;EACxD;CACF,CAAC;AACH,CACF"}

package/dist/{picker-D8OLb6kZ.d.mts → picker-JL8lZfRH.d.mts}

@@ -1,8 +1,8 @@
-import { Ut as NodeActionMap, X as State, nt as Reactive, rt as Ref } from "./queries-DH3bj74K.mjs";
-import { t as Input } from "./input-B5Vy-iaa.mjs";
+import { Ut as NodeActionMap, X as State, nt as Reactive, rt as Ref } from "./queries-Cvalgu6P.mjs";
+import { t as Input } from "./input-Dylds_sI.mjs";
 import { n as SearchOptions, r as SearchItem, t as SearchItems } from "./search-FvGnswRl.mjs";
-import { i as Select, o as SelectState, t as Option } from "./select-CbmAZdpt.mjs";
-import { r as TreeProps, t as TreeItem } from "./tree-C28QOVIK.mjs";
+import { i as Select, o as SelectState, t as Option } from "./select-zGd5pbiB.mjs";
+import { r as TreeProps, t as TreeItem } from "./tree-CArtDRec.mjs";
 //#region src/widgets/picker.d.ts
 type PickerItem = Option & SearchItem;
 type PickerActions = keyof ReturnType<typeof picker>["actions"];
@@ -33,4 +33,4 @@ declare const picker: <T extends PickerItem = PickerItem>(props: State<PickerSel
 };
 //#endregion
 export { picker as a, PickerTreeProps as i, PickerItem as n, PickerSelectProps as r, PickerActions as t };
-//# sourceMappingURL=picker-D8OLb6kZ.d.mts.map
+//# sourceMappingURL=picker-JL8lZfRH.d.mts.map

package/dist/{picker-D8OLb6kZ.d.mts.map → picker-JL8lZfRH.d.mts.map}

@@ -1 +1 @@
-{"version":3,"file":"picker-D8OLb6kZ.d.mts","names":[],"sources":["../src/widgets/picker.ts"],"mappings":";;;;;;KAgBY,aAAa,SAAS;KACtB,sBAAsB,kBAAkB;KAE/C,gBAAgB,UAAU,aAAa,cAAc,cAAc;;;;;;;EAOtE,QAAQ,QAAQ,IAAI;EACpB,UAAU;EACV;EACA,UAAU,cAAc,OAAO;;KAGrB,kBAAkB,UAAU,aAAa,cAAc,gBAAgB,KACjF,KAAK,YAAY;EACf,OAAO,SAAS,YAAY;EAC5B;;KAGQ,gBAAgB,UAAU,WAAW,YAAY,gBAAgB,KAC3E,UAAU;EACR;;cASS,SACV,UAAU,aAAU,YAAA,OAAsB,MAAM,kBAAkB,KAAK,gBAAgB,QAAG,OAAA"}
+{"version":3,"file":"picker-JL8lZfRH.d.mts","names":[],"sources":["../src/widgets/picker.ts"],"mappings":";;;;;;KAgBY,aAAa,SAAS;KACtB,sBAAsB,kBAAkB;KAE/C,gBAAgB,UAAU,aAAa,cAAc,cAAc;;;;;;;EAOtE,QAAQ,QAAQ,IAAI;EACpB,UAAU;EACV;EACA,UAAU,cAAc,OAAO;;KAGrB,kBAAkB,UAAU,aAAa,cAAc,gBAAgB,KACjF,KAAK,YAAY;EACf,OAAO,SAAS,YAAY;EAC5B;;KAGQ,gBAAgB,UAAU,WAAW,YAAY,gBAAgB,KAC3E,UAAU;EACR;;cASS,SACV,UAAU,aAAU,YAAA,OAAsB,MAAM,kBAAkB,KAAK,gBAAgB,QAAG,OAAA"}

package/dist/queries-B_lOwEiE.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"queries-B_lOwEiE.mjs","names":["#router","#terminal"],"sources":["../src/input/keys.ts","../src/input/queries.ts"],"sourcesContent":["/**\n * Keyboard event shape + pattern-based matcher.\n *\n * `KeyEvent.name` is a canonical name:\n *   - Single characters for printable keys: `\"a\"`, `\"A\"`, `\" \"`, `\"!\"`. The\n *     `name` reflects the raw character the decoder produced — so `Shift+A`\n *     arrives as `{ name: \"A\", shift: true }` (terminals already fold\n *     shift into the uppercase byte for letters).\n *   - Named constants for non-printing keys: `\"enter\"`, `\"tab\"`, `\"esc\"`,\n *     `\"backspace\"`, `\"delete\"`, `\"space\"`, arrows `\"up\"/\"down\"/\"left\"/\n *     \"right\"`, navigation `\"home\"/\"end\"/\"pageup\"/\"pagedown\"/\"insert\"`,\n *     function keys `\"f1\"` .. `\"f12\"`.\n *\n * Patterns for `keyMatches` are dash-separated modifier prefixes plus the\n * name: `\"a\"`, `\"ctrl-c\"`, `\"shift-tab\"`, `\"ctrl-shift-x\"`. Unknown\n * prefixes are treated as literal characters in the name, so\n * `\"something-foo\"` is interpreted as the name `\"something-foo\"` rather\n * than a missing-modifier error.\n *\n * Modifier prefixes (order-independent):\n *   - `ctrl-`\n *   - `alt-`\n *   - `shift-`\n *   - `meta-`  (a.k.a. super / cmd)\n */\n\nexport interface KeyEvent {\n  /** Canonical key name — raw character or one of the named constants above. */\n  name: string\n  /**\n   * The literal text the keystroke would insert, when that makes sense.\n   * For printable chars this is the char itself; for Enter, Tab, etc. it's\n   * undefined. Widgets use this to decide whether to insert content vs.\n   * treat the key as a command.\n   */\n  text?: string\n  ctrl: boolean\n  alt: boolean\n  shift: boolean\n  meta: boolean\n}\n\n/** Canonical modifier names used in `KeyPattern`. */\nexport type KeyModifier = \"ctrl\" | \"alt\" | \"shift\" | \"meta\"\n\n/**\n * Named keys the decoder emits for non-printable keystrokes. Bindings\n * reference these directly (`\"enter\"`, `\"f5\"`, `\"pageup\"`, …).\n */\nexport type SpecialKeyName = (typeof specialKeys)[number]\n\ndeclare const KeyPatternBrand: unique symbol\n\n/** A validated, canonical key binding string. */\nexport type KeyPattern = string & { readonly [KeyPatternBrand]: true }\n\nconst MOD_NAMES = new Set<string>([\"ctrl\", \"alt\", \"shift\", \"meta\"])\nconst specialKeys = [\n  \"enter\",\n  \"tab\",\n  \"backspace\",\n  \"delete\",\n  \"space\",\n  \"esc\",\n  \"up\",\n  \"down\",\n  \"left\",\n  \"right\",\n  \"home\",\n  \"end\",\n  \"pageup\",\n  \"pagedown\",\n  \"insert\",\n  \"f1\",\n  \"f2\",\n  \"f3\",\n  \"f4\",\n  \"f5\",\n  \"f6\",\n  \"f7\",\n  \"f8\",\n  \"f9\",\n  \"f10\",\n  \"f11\",\n  \"f12\",\n] as const\nconst SPECIAL_KEY_NAMES = new Set<string>(specialKeys)\n\ninterface ParsedPattern {\n  name: string\n  ctrl: boolean\n  alt: boolean\n  shift: boolean\n  meta: boolean\n}\n\nexport class KeyPatternError extends Error {\n  constructor(pattern: string, reason: string) {\n    super(`invalid key pattern ${JSON.stringify(pattern)}: ${reason}`)\n    this.name = \"KeyPatternError\"\n  }\n}\n\nfunction parsePattern(pattern: string): ParsedPattern {\n  const mods = { alt: false, ctrl: false, meta: false, shift: false }\n  let name = pattern\n  while (name.length > 0) {\n    const dash = name.indexOf(\"-\")\n    if (dash <= 0) break\n    const mod = name.slice(0, dash)\n    if (!MOD_NAMES.has(mod)) throw new KeyPatternError(pattern, `unknown modifier: ${mod}`)\n    if (mods[mod as KeyModifier]) throw new KeyPatternError(pattern, `duplicate modifier: ${mod}`)\n    mods[mod as KeyModifier] = true\n    name = name.slice(dash + 1)\n  }\n\n  const ret = normalizeKey({ ...mods, name })\n  name = ret.name\n  if (name === \"\") throw new KeyPatternError(pattern, \"missing key name\")\n  if (name.includes(\"-\") && name !== \"-\") throw new KeyPatternError(pattern, \"too many keys\")\n  if (!isPrintableKeyName(name)) throw new KeyPatternError(pattern, `unknown key name: ${name}`)\n  if (mods.shift && !canUseShiftModifier(name)) {\n    throw new KeyPatternError(\n      pattern,\n      `shift-${name} will not trigger; bind the shifted character instead`\n    )\n  }\n  return ret\n}\n\nfunction normalizeKey(p: ParsedPattern): ParsedPattern {\n  if (/^[A-Z]$/.test(p.name)) return { ...p, name: p.name.toLowerCase(), shift: true }\n  if (p.name === \" \") return { ...p, name: \"space\" }\n  return p\n}\n\nfunction isPrintableKeyName(s: string): boolean {\n  // oxlint-disable-next-line typescript/no-misused-spread\n  return SPECIAL_KEY_NAMES.has(s) || ([...s].length === 1 && !/[\\p{C}]/u.test(s))\n}\n\nfunction canUseShiftModifier(name: string): boolean {\n  return /^[a-zA-Z]$/.test(name) || SPECIAL_KEY_NAMES.has(name)\n}\n\nexport function isKeyPattern(s: string): s is KeyPattern {\n  try {\n    canonical(s)\n    return true\n  } catch {\n    return false\n  }\n}\n\n/**\n * Canonical string form of a pattern or event — modifiers in a fixed\n * alphabetical order, then the key name, joined by `-`. Used by the\n * router to build a pattern index whose keys match regardless of how\n * the user spelled the modifier order (`\"ctrl-shift-a\"` and\n * `\"shift-ctrl-a\"` both canonicalize to `\"ctrl-shift-a\"`).\n */\nexport function canonical(patternOrEvent: string | KeyEvent): KeyPattern {\n  const p =\n    typeof patternOrEvent === \"string\" ? parsePattern(patternOrEvent) : normalizeKey(patternOrEvent)\n  const parts: string[] = []\n  if (p.alt) parts.push(\"alt\")\n  if (p.ctrl) parts.push(\"ctrl\")\n  if (p.meta) parts.push(\"meta\")\n  if (p.shift) parts.push(\"shift\")\n  parts.push(p.name)\n  return parts.join(\"-\") as KeyPattern\n}\n\n/**\n * Test whether an event matches a pattern (or any of a list of patterns).\n * Unspecified modifiers in the pattern must be *absent* on the event —\n * matching is strict, not inclusive, so `\"a\"` only matches a bare `a`\n * (no ctrl/alt/etc.).\n */\nexport function keyMatches(ev: KeyEvent, pattern: string | readonly string[]): boolean {\n  if (Array.isArray(pattern)) {\n    for (const p of pattern) if (keyMatches(ev, p)) return true\n    return false\n  }\n  const p = parsePattern(pattern as string)\n  const e = normalizeKey(ev)\n  return (\n    e.name === p.name &&\n    e.ctrl === p.ctrl &&\n    e.alt === p.alt &&\n    e.shift === p.shift &&\n    e.meta === p.meta\n  )\n}\n","import type { TerminalResponseEvent } from \"./decoder.ts\"\nimport type { InputRouter } from \"./router.ts\"\n\nexport type TerminalQuery<T = TerminalResponseEvent> = TerminalQueryOpts & {\n  request: string\n  match: (event: TerminalResponseEvent) => T | undefined\n}\n\nexport type TerminalQueryOpts = {\n  timeout?: number\n  wrap?: (seq: string) => string\n}\n\ntype TerminalQueryWriter = {\n  write: (seq: string) => void\n}\n\nexport class TerminalQueries {\n  readonly #router: InputRouter\n  readonly #terminal: TerminalQueryWriter\n\n  constructor(router: InputRouter, terminal: TerminalQueryWriter) {\n    this.#router = router\n    this.#terminal = terminal\n  }\n\n  query<T>(query: TerminalQuery<T>): Promise<T | undefined> {\n    const timeout = query.timeout ?? 200\n    const ac = new AbortController()\n    return new Promise((resolve) => {\n      const finish = (value?: T) => {\n        if (ac.signal.aborted) return\n        ac.abort()\n        clearTimeout(timer)\n        resolve(value)\n      }\n      const timer = setTimeout(() => finish(), timeout)\n      timer.unref()\n      this.#router.on(\n        \"term-response\",\n        ({ event }) => {\n          const value = query.match(event)\n          if (value !== undefined) finish(value)\n        },\n        { signal: ac.signal }\n      )\n      this.#terminal.write(query.wrap?.(query.request) ?? query.request)\n    })\n  }\n\n  primaryDeviceAttributes(opts: TerminalQueryOpts = {}) {\n    return this.query<TerminalResponseEvent & { attrs: number[] }>({\n      match: (ev) =>\n        ev.kind === \"csi\" && ev.final === \"c\" && ev.params.startsWith(\"?\")\n          ? { ...ev, attrs: parseAttrs(ev.params) }\n          : undefined,\n      request: \"\\x1b[c\",\n      ...opts,\n    })\n  }\n\n  secondaryDeviceAttributes(opts: TerminalQueryOpts = {}) {\n    return this.query<TerminalResponseEvent & { attrs: number[] }>({\n      match: (ev) =>\n        ev.kind === \"csi\" && ev.final === \"c\" && ev.params.startsWith(\">\")\n          ? { ...ev, attrs: parseAttrs(ev.params) }\n          : undefined,\n      request: \"\\x1b[>c\",\n      ...opts,\n    })\n  }\n\n  xtVersion(opts: TerminalQueryOpts = {}) {\n    return this.query<TerminalResponseEvent & { name: string; version?: string }>({\n      match: (ev) => {\n        if (ev.kind !== \"dcs\" || !ev.payload.startsWith(\">|\")) return\n        const payload = ev.payload.slice(2)\n        const m = payload.match(/^([^\\s]+)\\(([^\\s]+)\\)$/) ?? payload.match(/^([^\\s]+)\\s+([^\\s]+)$/)\n        return { ...ev, name: m?.[1] ?? payload, version: m?.[2] }\n      },\n      request: \"\\x1b[>q\",\n      ...opts,\n    })\n  }\n}\n\nexport function parseAttrs(params: string): number[] {\n  return params\n    .slice(1)\n    .split(\";\")\n    .map((n) => Number.parseInt(n, 10))\n    .filter(Number.isFinite)\n}\n"],"mappings":";AAwDA,MAAM,4BAAY,IAAI,IAAY;CAAC;CAAQ;CAAO;CAAS;AAAM,CAAC;AA8BlE,MAAM,oCAAoB,IAAI,IAAY;CA5BxC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AAEkD,CAAC;AAUrD,IAAa,kBAAb,cAAqC,MAAM;CACzC,YAAY,SAAiB,QAAgB;EAC3C,MAAM,uBAAuB,KAAK,UAAU,OAAO,EAAE,IAAI,QAAQ;EACjE,KAAK,OAAO;CACd;AACF;AAEA,SAAS,aAAa,SAAgC;CACpD,MAAM,OAAO;EAAE,KAAK;EAAO,MAAM;EAAO,MAAM;EAAO,OAAO;CAAM;CAClE,IAAI,OAAO;CACX,OAAO,KAAK,SAAS,GAAG;EACtB,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,QAAQ,GAAG;EACf,MAAM,MAAM,KAAK,MAAM,GAAG,IAAI;EAC9B,IAAI,CAAC,UAAU,IAAI,GAAG,GAAG,MAAM,IAAI,gBAAgB,SAAS,qBAAqB,KAAK;EACtF,IAAI,KAAK,MAAqB,MAAM,IAAI,gBAAgB,SAAS,uBAAuB,KAAK;EAC7F,KAAK,OAAsB;EAC3B,OAAO,KAAK,MAAM,OAAO,CAAC;CAC5B;CAEA,MAAM,MAAM,aAAa;EAAE,GAAG;EAAM;CAAK,CAAC;CAC1C,OAAO,IAAI;CACX,IAAI,SAAS,IAAI,MAAM,IAAI,gBAAgB,SAAS,kBAAkB;CACtE,IAAI,KAAK,SAAS,GAAG,KAAK,SAAS,KAAK,MAAM,IAAI,gBAAgB,SAAS,eAAe;CAC1F,IAAI,CAAC,mBAAmB,IAAI,GAAG,MAAM,IAAI,gBAAgB,SAAS,qBAAqB,MAAM;CAC7F,IAAI,KAAK,SAAS,CAAC,oBAAoB,IAAI,GACzC,MAAM,IAAI,gBACR,SACA,SAAS,KAAK,sDAChB;CAEF,OAAO;AACT;AAEA,SAAS,aAAa,GAAiC;CACrD,IAAI,UAAU,KAAK,EAAE,IAAI,GAAG,OAAO;EAAE,GAAG;EAAG,MAAM,EAAE,KAAK,YAAY;EAAG,OAAO;CAAK;CACnF,IAAI,EAAE,SAAS,KAAK,OAAO;EAAE,GAAG;EAAG,MAAM;CAAQ;CACjD,OAAO;AACT;AAEA,SAAS,mBAAmB,GAAoB;CAE9C,OAAO,kBAAkB,IAAI,CAAC,KAAM,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,KAAK,CAAC,WAAW,KAAK,CAAC;AAC/E;AAEA,SAAS,oBAAoB,MAAuB;CAClD,OAAO,aAAa,KAAK,IAAI,KAAK,kBAAkB,IAAI,IAAI;AAC9D;AAEA,SAAgB,aAAa,GAA4B;CACvD,IAAI;EACF,UAAU,CAAC;EACX,OAAO;CACT,QAAQ;EACN,OAAO;CACT;AACF;;;;;;;;AASA,SAAgB,UAAU,gBAA+C;CACvE,MAAM,IACJ,OAAO,mBAAmB,WAAW,aAAa,cAAc,IAAI,aAAa,cAAc;CACjG,MAAM,QAAkB,CAAC;CACzB,IAAI,EAAE,KAAK,MAAM,KAAK,KAAK;CAC3B,IAAI,EAAE,MAAM,MAAM,KAAK,MAAM;CAC7B,IAAI,EAAE,MAAM,MAAM,KAAK,MAAM;CAC7B,IAAI,EAAE,OAAO,MAAM,KAAK,OAAO;CAC/B,MAAM,KAAK,EAAE,IAAI;CACjB,OAAO,MAAM,KAAK,GAAG;AACvB;;;;;;;AAQA,SAAgB,WAAW,IAAc,SAA8C;CACrF,IAAI,MAAM,QAAQ,OAAO,GAAG;EAC1B,KAAK,MAAM,KAAK,SAAS,IAAI,WAAW,IAAI,CAAC,GAAG,OAAO;EACvD,OAAO;CACT;CACA,MAAM,IAAI,aAAa,OAAiB;CACxC,MAAM,IAAI,aAAa,EAAE;CACzB,OACE,EAAE,SAAS,EAAE,QACb,EAAE,SAAS,EAAE,QACb,EAAE,QAAQ,EAAE,OACZ,EAAE,UAAU,EAAE,SACd,EAAE,SAAS,EAAE;AAEjB;;;AChLA,IAAa,kBAAb,MAA6B;CAC3B;CACA;CAEA,YAAY,QAAqB,UAA+B;EAC9D,KAAKA,UAAU;EACf,KAAKC,YAAY;CACnB;CAEA,MAAS,OAAiD;EACxD,MAAM,UAAU,MAAM,WAAW;EACjC,MAAM,KAAK,IAAI,gBAAgB;EAC/B,OAAO,IAAI,SAAS,YAAY;GAC9B,MAAM,UAAU,UAAc;IAC5B,IAAI,GAAG,OAAO,SAAS;IACvB,GAAG,MAAM;IACT,aAAa,KAAK;IAClB,QAAQ,KAAK;GACf;GACA,MAAM,QAAQ,iBAAiB,OAAO,GAAG,OAAO;GAChD,MAAM,MAAM;GACZ,KAAKD,QAAQ,GACX,kBACC,EAAE,YAAY;IACb,MAAM,QAAQ,MAAM,MAAM,KAAK;IAC/B,IAAI,UAAU,KAAA,GAAW,OAAO,KAAK;GACvC,GACA,EAAE,QAAQ,GAAG,OAAO,CACtB;GACA,KAAKC,UAAU,MAAM,MAAM,OAAO,MAAM,OAAO,KAAK,MAAM,OAAO;EACnE,CAAC;CACH;CAEA,wBAAwB,OAA0B,CAAC,GAAG;EACpD,OAAO,KAAK,MAAmD;GAC7D,QAAQ,OACN,GAAG,SAAS,SAAS,GAAG,UAAU,OAAO,GAAG,OAAO,WAAW,GAAG,IAC7D;IAAE,GAAG;IAAI,OAAO,WAAW,GAAG,MAAM;GAAE,IACtC,KAAA;GACN,SAAS;GACT,GAAG;EACL,CAAC;CACH;CAEA,0BAA0B,OAA0B,CAAC,GAAG;EACtD,OAAO,KAAK,MAAmD;GAC7D,QAAQ,OACN,GAAG,SAAS,SAAS,GAAG,UAAU,OAAO,GAAG,OAAO,WAAW,GAAG,IAC7D;IAAE,GAAG;IAAI,OAAO,WAAW,GAAG,MAAM;GAAE,IACtC,KAAA;GACN,SAAS;GACT,GAAG;EACL,CAAC;CACH;CAEA,UAAU,OAA0B,CAAC,GAAG;EACtC,OAAO,KAAK,MAAkE;GAC5E,QAAQ,OAAO;IACb,IAAI,GAAG,SAAS,SAAS,CAAC,GAAG,QAAQ,WAAW,IAAI,GAAG;IACvD,MAAM,UAAU,GAAG,QAAQ,MAAM,CAAC;IAClC,MAAM,IAAI,QAAQ,MAAM,wBAAwB,KAAK,QAAQ,MAAM,uBAAuB;IAC1F,OAAO;KAAE,GAAG;KAAI,MAAM,IAAI,MAAM;KAAS,SAAS,IAAI;IAAG;GAC3D;GACA,SAAS;GACT,GAAG;EACL,CAAC;CACH;AACF;AAEA,SAAgB,WAAW,QAA0B;CACnD,OAAO,OACJ,MAAM,CAAC,CAAC,CACR,MAAM,GAAG,CAAC,CACV,KAAK,MAAM,OAAO,SAAS,GAAG,EAAE,CAAC,CAAC,CAClC,OAAO,OAAO,QAAQ;AAC3B"}
+{"version":3,"file":"queries-B_lOwEiE.mjs","names":[],"sources":["../src/input/keys.ts","../src/input/queries.ts"],"sourcesContent":["/**\n * Keyboard event shape + pattern-based matcher.\n *\n * `KeyEvent.name` is a canonical name:\n *   - Single characters for printable keys: `\"a\"`, `\"A\"`, `\" \"`, `\"!\"`. The\n *     `name` reflects the raw character the decoder produced — so `Shift+A`\n *     arrives as `{ name: \"A\", shift: true }` (terminals already fold\n *     shift into the uppercase byte for letters).\n *   - Named constants for non-printing keys: `\"enter\"`, `\"tab\"`, `\"esc\"`,\n *     `\"backspace\"`, `\"delete\"`, `\"space\"`, arrows `\"up\"/\"down\"/\"left\"/\n *     \"right\"`, navigation `\"home\"/\"end\"/\"pageup\"/\"pagedown\"/\"insert\"`,\n *     function keys `\"f1\"` .. `\"f12\"`.\n *\n * Patterns for `keyMatches` are dash-separated modifier prefixes plus the\n * name: `\"a\"`, `\"ctrl-c\"`, `\"shift-tab\"`, `\"ctrl-shift-x\"`. Unknown\n * prefixes are treated as literal characters in the name, so\n * `\"something-foo\"` is interpreted as the name `\"something-foo\"` rather\n * than a missing-modifier error.\n *\n * Modifier prefixes (order-independent):\n *   - `ctrl-`\n *   - `alt-`\n *   - `shift-`\n *   - `meta-`  (a.k.a. super / cmd)\n */\n\nexport interface KeyEvent {\n  /** Canonical key name — raw character or one of the named constants above. */\n  name: string\n  /**\n   * The literal text the keystroke would insert, when that makes sense.\n   * For printable chars this is the char itself; for Enter, Tab, etc. it's\n   * undefined. Widgets use this to decide whether to insert content vs.\n   * treat the key as a command.\n   */\n  text?: string\n  ctrl: boolean\n  alt: boolean\n  shift: boolean\n  meta: boolean\n}\n\n/** Canonical modifier names used in `KeyPattern`. */\nexport type KeyModifier = \"ctrl\" | \"alt\" | \"shift\" | \"meta\"\n\n/**\n * Named keys the decoder emits for non-printable keystrokes. Bindings\n * reference these directly (`\"enter\"`, `\"f5\"`, `\"pageup\"`, …).\n */\nexport type SpecialKeyName = (typeof specialKeys)[number]\n\ndeclare const KeyPatternBrand: unique symbol\n\n/** A validated, canonical key binding string. */\nexport type KeyPattern = string & { readonly [KeyPatternBrand]: true }\n\nconst MOD_NAMES = new Set<string>([\"ctrl\", \"alt\", \"shift\", \"meta\"])\nconst specialKeys = [\n  \"enter\",\n  \"tab\",\n  \"backspace\",\n  \"delete\",\n  \"space\",\n  \"esc\",\n  \"up\",\n  \"down\",\n  \"left\",\n  \"right\",\n  \"home\",\n  \"end\",\n  \"pageup\",\n  \"pagedown\",\n  \"insert\",\n  \"f1\",\n  \"f2\",\n  \"f3\",\n  \"f4\",\n  \"f5\",\n  \"f6\",\n  \"f7\",\n  \"f8\",\n  \"f9\",\n  \"f10\",\n  \"f11\",\n  \"f12\",\n] as const\nconst SPECIAL_KEY_NAMES = new Set<string>(specialKeys)\n\ninterface ParsedPattern {\n  name: string\n  ctrl: boolean\n  alt: boolean\n  shift: boolean\n  meta: boolean\n}\n\nexport class KeyPatternError extends Error {\n  constructor(pattern: string, reason: string) {\n    super(`invalid key pattern ${JSON.stringify(pattern)}: ${reason}`)\n    this.name = \"KeyPatternError\"\n  }\n}\n\nfunction parsePattern(pattern: string): ParsedPattern {\n  const mods = { alt: false, ctrl: false, meta: false, shift: false }\n  let name = pattern\n  while (name.length > 0) {\n    const dash = name.indexOf(\"-\")\n    if (dash <= 0) break\n    const mod = name.slice(0, dash)\n    if (!MOD_NAMES.has(mod)) throw new KeyPatternError(pattern, `unknown modifier: ${mod}`)\n    if (mods[mod as KeyModifier]) throw new KeyPatternError(pattern, `duplicate modifier: ${mod}`)\n    mods[mod as KeyModifier] = true\n    name = name.slice(dash + 1)\n  }\n\n  const ret = normalizeKey({ ...mods, name })\n  name = ret.name\n  if (name === \"\") throw new KeyPatternError(pattern, \"missing key name\")\n  if (name.includes(\"-\") && name !== \"-\") throw new KeyPatternError(pattern, \"too many keys\")\n  if (!isPrintableKeyName(name)) throw new KeyPatternError(pattern, `unknown key name: ${name}`)\n  if (mods.shift && !canUseShiftModifier(name)) {\n    throw new KeyPatternError(\n      pattern,\n      `shift-${name} will not trigger; bind the shifted character instead`\n    )\n  }\n  return ret\n}\n\nfunction normalizeKey(p: ParsedPattern): ParsedPattern {\n  if (/^[A-Z]$/.test(p.name)) return { ...p, name: p.name.toLowerCase(), shift: true }\n  if (p.name === \" \") return { ...p, name: \"space\" }\n  return p\n}\n\nfunction isPrintableKeyName(s: string): boolean {\n  // oxlint-disable-next-line typescript/no-misused-spread\n  return SPECIAL_KEY_NAMES.has(s) || ([...s].length === 1 && !/[\\p{C}]/u.test(s))\n}\n\nfunction canUseShiftModifier(name: string): boolean {\n  return /^[a-zA-Z]$/.test(name) || SPECIAL_KEY_NAMES.has(name)\n}\n\nexport function isKeyPattern(s: string): s is KeyPattern {\n  try {\n    canonical(s)\n    return true\n  } catch {\n    return false\n  }\n}\n\n/**\n * Canonical string form of a pattern or event — modifiers in a fixed\n * alphabetical order, then the key name, joined by `-`. Used by the\n * router to build a pattern index whose keys match regardless of how\n * the user spelled the modifier order (`\"ctrl-shift-a\"` and\n * `\"shift-ctrl-a\"` both canonicalize to `\"ctrl-shift-a\"`).\n */\nexport function canonical(patternOrEvent: string | KeyEvent): KeyPattern {\n  const p =\n    typeof patternOrEvent === \"string\" ? parsePattern(patternOrEvent) : normalizeKey(patternOrEvent)\n  const parts: string[] = []\n  if (p.alt) parts.push(\"alt\")\n  if (p.ctrl) parts.push(\"ctrl\")\n  if (p.meta) parts.push(\"meta\")\n  if (p.shift) parts.push(\"shift\")\n  parts.push(p.name)\n  return parts.join(\"-\") as KeyPattern\n}\n\n/**\n * Test whether an event matches a pattern (or any of a list of patterns).\n * Unspecified modifiers in the pattern must be *absent* on the event —\n * matching is strict, not inclusive, so `\"a\"` only matches a bare `a`\n * (no ctrl/alt/etc.).\n */\nexport function keyMatches(ev: KeyEvent, pattern: string | readonly string[]): boolean {\n  if (Array.isArray(pattern)) {\n    for (const p of pattern) if (keyMatches(ev, p)) return true\n    return false\n  }\n  const p = parsePattern(pattern as string)\n  const e = normalizeKey(ev)\n  return (\n    e.name === p.name &&\n    e.ctrl === p.ctrl &&\n    e.alt === p.alt &&\n    e.shift === p.shift &&\n    e.meta === p.meta\n  )\n}\n","import type { TerminalResponseEvent } from \"./decoder.ts\"\nimport type { InputRouter } from \"./router.ts\"\n\nexport type TerminalQuery<T = TerminalResponseEvent> = TerminalQueryOpts & {\n  request: string\n  match: (event: TerminalResponseEvent) => T | undefined\n}\n\nexport type TerminalQueryOpts = {\n  timeout?: number\n  wrap?: (seq: string) => string\n}\n\ntype TerminalQueryWriter = {\n  write: (seq: string) => void\n}\n\nexport class TerminalQueries {\n  readonly #router: InputRouter\n  readonly #terminal: TerminalQueryWriter\n\n  constructor(router: InputRouter, terminal: TerminalQueryWriter) {\n    this.#router = router\n    this.#terminal = terminal\n  }\n\n  query<T>(query: TerminalQuery<T>): Promise<T | undefined> {\n    const timeout = query.timeout ?? 200\n    const ac = new AbortController()\n    return new Promise((resolve) => {\n      const finish = (value?: T) => {\n        if (ac.signal.aborted) return\n        ac.abort()\n        clearTimeout(timer)\n        resolve(value)\n      }\n      const timer = setTimeout(() => finish(), timeout)\n      timer.unref()\n      this.#router.on(\n        \"term-response\",\n        ({ event }) => {\n          const value = query.match(event)\n          if (value !== undefined) finish(value)\n        },\n        { signal: ac.signal }\n      )\n      this.#terminal.write(query.wrap?.(query.request) ?? query.request)\n    })\n  }\n\n  primaryDeviceAttributes(opts: TerminalQueryOpts = {}) {\n    return this.query<TerminalResponseEvent & { attrs: number[] }>({\n      match: (ev) =>\n        ev.kind === \"csi\" && ev.final === \"c\" && ev.params.startsWith(\"?\")\n          ? { ...ev, attrs: parseAttrs(ev.params) }\n          : undefined,\n      request: \"\\x1b[c\",\n      ...opts,\n    })\n  }\n\n  secondaryDeviceAttributes(opts: TerminalQueryOpts = {}) {\n    return this.query<TerminalResponseEvent & { attrs: number[] }>({\n      match: (ev) =>\n        ev.kind === \"csi\" && ev.final === \"c\" && ev.params.startsWith(\">\")\n          ? { ...ev, attrs: parseAttrs(ev.params) }\n          : undefined,\n      request: \"\\x1b[>c\",\n      ...opts,\n    })\n  }\n\n  xtVersion(opts: TerminalQueryOpts = {}) {\n    return this.query<TerminalResponseEvent & { name: string; version?: string }>({\n      match: (ev) => {\n        if (ev.kind !== \"dcs\" || !ev.payload.startsWith(\">|\")) return\n        const payload = ev.payload.slice(2)\n        const m = payload.match(/^([^\\s]+)\\(([^\\s]+)\\)$/) ?? payload.match(/^([^\\s]+)\\s+([^\\s]+)$/)\n        return { ...ev, name: m?.[1] ?? payload, version: m?.[2] }\n      },\n      request: \"\\x1b[>q\",\n      ...opts,\n    })\n  }\n}\n\nexport function parseAttrs(params: string): number[] {\n  return params\n    .slice(1)\n    .split(\";\")\n    .map((n) => Number.parseInt(n, 10))\n    .filter(Number.isFinite)\n}\n"],"mappings":";AAwDA,MAAM,4BAAY,IAAI,IAAY;CAAC;CAAQ;CAAO;CAAS;AAAM,CAAC;AA8BlE,MAAM,oCAAoB,IAAI,IAAY;CA5BxC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AAEkD,CAAC;AAUrD,IAAa,kBAAb,cAAqC,MAAM;CACzC,YAAY,SAAiB,QAAgB;EAC3C,MAAM,uBAAuB,KAAK,UAAU,OAAO,EAAE,IAAI,QAAQ;EACjE,KAAK,OAAO;CACd;AACF;AAEA,SAAS,aAAa,SAAgC;CACpD,MAAM,OAAO;EAAE,KAAK;EAAO,MAAM;EAAO,MAAM;EAAO,OAAO;CAAM;CAClE,IAAI,OAAO;CACX,OAAO,KAAK,SAAS,GAAG;EACtB,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,QAAQ,GAAG;EACf,MAAM,MAAM,KAAK,MAAM,GAAG,IAAI;EAC9B,IAAI,CAAC,UAAU,IAAI,GAAG,GAAG,MAAM,IAAI,gBAAgB,SAAS,qBAAqB,KAAK;EACtF,IAAI,KAAK,MAAqB,MAAM,IAAI,gBAAgB,SAAS,uBAAuB,KAAK;EAC7F,KAAK,OAAsB;EAC3B,OAAO,KAAK,MAAM,OAAO,CAAC;CAC5B;CAEA,MAAM,MAAM,aAAa;EAAE,GAAG;EAAM;CAAK,CAAC;CAC1C,OAAO,IAAI;CACX,IAAI,SAAS,IAAI,MAAM,IAAI,gBAAgB,SAAS,kBAAkB;CACtE,IAAI,KAAK,SAAS,GAAG,KAAK,SAAS,KAAK,MAAM,IAAI,gBAAgB,SAAS,eAAe;CAC1F,IAAI,CAAC,mBAAmB,IAAI,GAAG,MAAM,IAAI,gBAAgB,SAAS,qBAAqB,MAAM;CAC7F,IAAI,KAAK,SAAS,CAAC,oBAAoB,IAAI,GACzC,MAAM,IAAI,gBACR,SACA,SAAS,KAAK,sDAChB;CAEF,OAAO;AACT;AAEA,SAAS,aAAa,GAAiC;CACrD,IAAI,UAAU,KAAK,EAAE,IAAI,GAAG,OAAO;EAAE,GAAG;EAAG,MAAM,EAAE,KAAK,YAAY;EAAG,OAAO;CAAK;CACnF,IAAI,EAAE,SAAS,KAAK,OAAO;EAAE,GAAG;EAAG,MAAM;CAAQ;CACjD,OAAO;AACT;AAEA,SAAS,mBAAmB,GAAoB;CAE9C,OAAO,kBAAkB,IAAI,CAAC,KAAM,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,KAAK,CAAC,WAAW,KAAK,CAAC;AAC/E;AAEA,SAAS,oBAAoB,MAAuB;CAClD,OAAO,aAAa,KAAK,IAAI,KAAK,kBAAkB,IAAI,IAAI;AAC9D;AAEA,SAAgB,aAAa,GAA4B;CACvD,IAAI;EACF,UAAU,CAAC;EACX,OAAO;CACT,QAAQ;EACN,OAAO;CACT;AACF;;;;;;;;AASA,SAAgB,UAAU,gBAA+C;CACvE,MAAM,IACJ,OAAO,mBAAmB,WAAW,aAAa,cAAc,IAAI,aAAa,cAAc;CACjG,MAAM,QAAkB,CAAC;CACzB,IAAI,EAAE,KAAK,MAAM,KAAK,KAAK;CAC3B,IAAI,EAAE,MAAM,MAAM,KAAK,MAAM;CAC7B,IAAI,EAAE,MAAM,MAAM,KAAK,MAAM;CAC7B,IAAI,EAAE,OAAO,MAAM,KAAK,OAAO;CAC/B,MAAM,KAAK,EAAE,IAAI;CACjB,OAAO,MAAM,KAAK,GAAG;AACvB;;;;;;;AAQA,SAAgB,WAAW,IAAc,SAA8C;CACrF,IAAI,MAAM,QAAQ,OAAO,GAAG;EAC1B,KAAK,MAAM,KAAK,SAAS,IAAI,WAAW,IAAI,CAAC,GAAG,OAAO;EACvD,OAAO;CACT;CACA,MAAM,IAAI,aAAa,OAAiB;CACxC,MAAM,IAAI,aAAa,EAAE;CACzB,OACE,EAAE,SAAS,EAAE,QACb,EAAE,SAAS,EAAE,QACb,EAAE,QAAQ,EAAE,OACZ,EAAE,UAAU,EAAE,SACd,EAAE,SAAS,EAAE;AAEjB;;;AChLA,IAAa,kBAAb,MAA6B;CAC3B;CACA;CAEA,YAAY,QAAqB,UAA+B;EAC9D,KAAK,UAAU;EACf,KAAK,YAAY;CACnB;CAEA,MAAS,OAAiD;EACxD,MAAM,UAAU,MAAM,WAAW;EACjC,MAAM,KAAK,IAAI,gBAAgB;EAC/B,OAAO,IAAI,SAAS,YAAY;GAC9B,MAAM,UAAU,UAAc;IAC5B,IAAI,GAAG,OAAO,SAAS;IACvB,GAAG,MAAM;IACT,aAAa,KAAK;IAClB,QAAQ,KAAK;GACf;GACA,MAAM,QAAQ,iBAAiB,OAAO,GAAG,OAAO;GAChD,MAAM,MAAM;GACZ,KAAK,QAAQ,GACX,kBACC,EAAE,YAAY;IACb,MAAM,QAAQ,MAAM,MAAM,KAAK;IAC/B,IAAI,UAAU,KAAA,GAAW,OAAO,KAAK;GACvC,GACA,EAAE,QAAQ,GAAG,OAAO,CACtB;GACA,KAAK,UAAU,MAAM,MAAM,OAAO,MAAM,OAAO,KAAK,MAAM,OAAO;EACnE,CAAC;CACH;CAEA,wBAAwB,OAA0B,CAAC,GAAG;EACpD,OAAO,KAAK,MAAmD;GAC7D,QAAQ,OACN,GAAG,SAAS,SAAS,GAAG,UAAU,OAAO,GAAG,OAAO,WAAW,GAAG,IAC7D;IAAE,GAAG;IAAI,OAAO,WAAW,GAAG,MAAM;GAAE,IACtC,KAAA;GACN,SAAS;GACT,GAAG;EACL,CAAC;CACH;CAEA,0BAA0B,OAA0B,CAAC,GAAG;EACtD,OAAO,KAAK,MAAmD;GAC7D,QAAQ,OACN,GAAG,SAAS,SAAS,GAAG,UAAU,OAAO,GAAG,OAAO,WAAW,GAAG,IAC7D;IAAE,GAAG;IAAI,OAAO,WAAW,GAAG,MAAM;GAAE,IACtC,KAAA;GACN,SAAS;GACT,GAAG;EACL,CAAC;CACH;CAEA,UAAU,OAA0B,CAAC,GAAG;EACtC,OAAO,KAAK,MAAkE;GAC5E,QAAQ,OAAO;IACb,IAAI,GAAG,SAAS,SAAS,CAAC,GAAG,QAAQ,WAAW,IAAI,GAAG;IACvD,MAAM,UAAU,GAAG,QAAQ,MAAM,CAAC;IAClC,MAAM,IAAI,QAAQ,MAAM,wBAAwB,KAAK,QAAQ,MAAM,uBAAuB;IAC1F,OAAO;KAAE,GAAG;KAAI,MAAM,IAAI,MAAM;KAAS,SAAS,IAAI;IAAG;GAC3D;GACA,SAAS;GACT,GAAG;EACL,CAAC;CACH;AACF;AAEA,SAAgB,WAAW,QAA0B;CACnD,OAAO,OACJ,MAAM,CAAC,CAAC,CACR,MAAM,GAAG,CAAC,CACV,KAAK,MAAM,OAAO,SAAS,GAAG,EAAE,CAAC,CAAC,CAClC,OAAO,OAAO,QAAQ;AAC3B"}

package/dist/{queries-DH3bj74K.d.mts → queries-Cvalgu6P.d.mts}

@@ -1,5 +1,5 @@
-import { c as Color, f as Style, t as Theme } from "./types-B9Eh7k2v.mjs";
-import { a as StyleBuilder, t as InspectOpts } from "./inspect-D6FW_QUo.mjs";
+import { c as Color, f as Style, t as Theme } from "./types-C0EOLZDc.mjs";
+import { a as StyleBuilder, t as InspectOpts } from "./inspect-DPLRum7L.mjs";
 import { Emitter, MaybePromise } from "@zaly/shared";
 import { LogEntry, LogLevel, LogReporter, Logger, TryResult } from "@zaly/shared/logger";
 import { ArgsOpts, ArgsResult } from "@zaly/shared/args";
@@ -1960,4 +1960,4 @@ declare class TerminalQueries {
 declare function parseAttrs(params: string): number[];
 //#endregion
 export { Context as $, LogState as A, useContext as At, Padding as B, Actions as Bt, OverlaySurface as C, peek as Ct, LoggerStream as D, untrack as Dt, LogStyleOverride as E, toAccessor as Et, Overlay as F, ActionCtx as Ft, text as G, KeyModifier as Gt, Text as H, NodeAction as Ht, OverlayState as I, ActionDef as It, Layout as J, SpecialKeyName as Jt, textContent as K, KeyPattern as Kt, overlay as L, ActionFilter as Lt, log as M, withOwner as Mt, MountCtx as N, Size as Nt, TuiReporter as O, unwrap as Ot, RenderCtx as P, Action as Pt, Accessor as Q, Box as R, ActionFn as Rt, Stream as S, onCleanup as St, LogEntryFactory as T, signal as Tt, TextContent as U, NodeActionMap as Ut, box as V, KeyBinding as Vt, TextStyle as W, KeyEvent as Wt, State as X, isKeyPattern as Xt, LayoutState as Y, canonical as Yt, StyleState as Z, keyMatches as Zt, RenderStats as _, createSuspenseBoundary as _t, InputRouter as a, Signal as at, SurfaceType as b, isAccessor as bt, KeyPatterns as c, SuspenseContext as ct, RoutedPaste as d, createIterable as dt, Owner as et, BaseEvents as f, createNode as ft, RenderEvents as g, createStore as gt, NodeVisitor as h, createRoot as ht, parseAttrs as i, Setter as it, LogStyle as j, withActiveNode as jt, TuiReporterOpts as k, useActiveOwner as kt, KeymapEntry as l, createAsync as lt, isNode as m, createRef as mt, TerminalQuery as n, Reactive as nt, InputRouterEvents as o, SignalStore as ot, Node as p, createProgressive as pt, FlexState as q, KeyPatternError as qt, TerminalQueryOpts as r, Ref as rt, KeyHandler as s, SuspenseBoundary as st, TerminalQueries as t, Progressive as tt, RoutedKey as u, createContext as ut, Renderer as v, effect as vt, Terminal as w, provideContext as wt, UI as x, memo as xt, RendererOptions as y, inRenderContextOf as yt, BoxStyle as z, ActionMap as zt };
-//# sourceMappingURL=queries-DH3bj74K.d.mts.map
+//# sourceMappingURL=queries-Cvalgu6P.d.mts.map

package/dist/queries-Cvalgu6P.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"queries-Cvalgu6P.d.mts","names":["_$___core_state_ts0.Layout","_$__box_ts0.Box","_$__terminal_ts0.Terminal"],"sources":["../src/input/keys.ts","../src/input/decoder.ts","../src/input/actions.ts","../src/layout/size.ts","../src/core/reactive.ts","../src/core/state.ts","../src/layout/border.ts","../src/widgets/text.ts","../src/widgets/box.ts","../src/widgets/overlay.ts","../src/core/ctx.ts","../src/widgets/log.ts","../src/services/logger.ts","../src/renderer/terminal.ts","../src/renderer/frame.ts","../src/renderer/surface.ts","../src/renderer/overlay.ts","../src/renderer/selection.ts","../src/renderer/stream.ts","../src/renderer/ui.ts","../src/renderer/renderer.ts","../src/core/node.ts","../src/input/router.ts","../src/input/queries.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;UA0BiB;;EAEf;;;;;;;EAOA;EACA;EACA;EACA;EACA;;;KAIU;;;;;KAMA,yBAAyB;cAEvB;;KAGF;YAAkC;;cAGxC;cAuCO,wBAAwB;EACnC,YAAY,iBAAiB;;iBAgDf,aAAa,YAAY,KAAK;;;;;;;;iBAgB9B,UAAU,yBAAyB,WAAW;;;;;;;iBAkB9C,WAAW,IAAI,UAAU;;;;;;;;;;;;KCvK7B;KAEA;EACV;EACA;EACA;EACA;EACA;EACA;EACA;;EAEI;EAAgB;;EAChB;EAA8B,QAAQ;EAAa;;KAG7C;EACN;EAAuB;EAAa;EAAkB;EAAgB;;EACtE;EAAuB;EAA6B;EAAkB;;KAEhE;EACN;EAAa,OAAO;;EACpB;EAAe;;EACf;EAAe;IACjB,wBACA;;;;;;;;KCrBQ,UAAU,UAAU,WAAW,UAAU;;WAE1C;WACA,OAAO;;;;WAIP,SAAS;;WAET;;WAEA,MAAM;EACf,OAAO,WAAW;KACf,UAAU;;;;WAKA,MAAM;;KAIT,SAAS,UAAU,WAAW,UAAU,aAClD,KAAK,UAAU,GAAG,OACf;KAEO,aAAa,KAAK;EAC5B;EACA,IAAI;EACJ;;;;;;;;;;;;;;;UAgBe,UAAU,UAAU,WAAW,UAAU;EACxD;EACA;EACA;EACA;EACA,OAAO;EACP;EACA,KAAK,SAAS,GAAG;;;EAGjB;;KAGU,OAAO,UAAU,WAAW,UAAU,YAAY,UAAU,GAAG;EAAO;;KAEtE,YAAY,eAAe;KAE3B;EACV;EACA,cAAc;EACd;EACA;EACA,UAAU,MAAM;;;;;;;;;;;KA0BN,WAAW,UAAU,OAAO,QACpC,SAAS,UAAU,MAClB,UAAU,UAAU;EAAO,IAAI,SAAS,UAAU;;;KAG3C,cAAc,UAAU,OAAO,QAAQ,eAAe,WAAW;KAExE;EACH;;;;;;;;;;;;;;;;;;;;cAqBW,gBAAgB,QAAQ;;EASnC,YAAY,SAAS;;EAOrB,kBAAkB,UAAU;EAI5B,KAAK,SAAS;;;;;;;;;;;;;EAsBd,SAAS,SAAS,YAAY,UAAU;IAAQ;;;EAyBhD,OAAO,mBAAmB;EAS1B,IAAI,aAAa;EAIjB,KAAK,OAAO,eAAe;EAM3B,KAAK,OAAO,eAAe;;;;;;;;;;EAa3B,SAAS,YAAY,MAAM,QAAQ;EAEnC,SAAS,QAAQ,QAAQ,MAAM,QAAQ;EAyBvC,YAAY,QAAQ,WAAW;IAAQ;IAAgB;;EA+CvD,SAAS,MAAM,MAAM;IAAQ,SAAS;OAAuB;IAAW;;;;;;KCrT9D;;;;;;;;;;KAWA,gBAAgB;;;;;;;;;;;;;;;;;;;;;;iBCuDZ,QAAQ,GAAG,UAAU,IAAI;;;iBAMzB,KAAK,GAAG,GAAG,SAAS,KAAK;;;;;;;;;;;;;;;;;;;;;;;;;;UA+BxB,QAAQ;WACd;WACA,cAAc;;iBAGT,cAAc,MAAM,QAAQ;iBAC5B,cAAc,GAAG,cAAc,IAAI,QAAQ;;;;iBAQ3C,eAAe,GAAG,KAAK,QAAQ,IAAI,OAAO;;;;iBAW1C,WAAW,GAAG,KAAK,QAAQ,KAAK;;;;cAa1C;KAEM,OAAO,eAAe,KAAK,SAAS,IAAI,KAAK,OAAO;WACrD,KAAK,SAAS;WACd,KAAK,OAAO;;;;KAKX,SAAS,YAAY;YAAiB;;;;KAItC,OAAO,OAAO,MAAM,MAAM,MAAM,MAAM;YAA2B;;;KAGjE,SAAS,KAAK,IAAI,SAAS;;;;;iBAMvB,WAAW,GAAG,aAAa,KAAK,SAAS;;;;;;iBASzC,OAAO,GAAG,GAAG,SAAS,KAAK;;;;;;;;;;;;;;;;;;;;;;cAuC9B;;EACX,SAAS;EAKT,YAAY,SAAS;MAIjB;;;MAMA,YAAY;EAIhB,WAAW,YAAY;;EAKvB,WAAW;;EASX;;;;;;;;;;;;;;iBA+Bc,eAAe,GAAG,MAAM,MAAM,UAAU,IAAI;;;;;;;iBAU5C,UAAU,GAAG,OAAO,OAAO,UAAU,IAAI;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBA+CzC,WAAW,GAAG,KAAK,wBAAwB,IAAI;;;;;;;;;;;;;;;;;;;iBAwB/C,WAAW,UAAU,MAAM,UAAU,IAAI;;;;;;;;;;;;;;;iBAkBzC,UAAU;;;;;iBAYV,kBAAkB;;;;;;;;;;;;iBAelB,kBAAkB,MAAM;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBA2CxB,OAAO,GACrB,SAAS,GACT;EAAQ,mBAAmB,MAAM,GAAG,MAAM;IACzC,OAAO;;;;;;;;;;;;;;;iBAwCM,WAAW,GAAG,UAAU,IAAI,SAAS;;;;;;;;;;;;;;;;;;;iBAwBrC,OAAO;;;;;;;;;;;;;;;;iBAgEP,KAAK,GAAG,UAAU,IAAI,SAAS;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KA8CnC,YAAY,oBAAoB;;;;;EAK1C,MAAM,OAAO,QAAQ,OAAO,SAAS,MAAM,QAAQ;;iBAGrC,YAAY,kBAAkB,SAAS,IAAI,YAAY;;;;;;;;;;;;;;;;;KAmE3D;EACV;EACA;EACA;EACA,gBAAgB;;;;;cAML,iBAAe,QAAA;;;;;;;;;iBAUZ,uBAAuB,SAAS,mBAAmB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBA4DnD,YAAY,GAC1B,KAAK,MAAM,kBAAkB,QAAQ,IACrC;EAAQ,cAAc;IACrB,SAAS;iBACI,YAAY,GAC1B,KAAK,MAAM,kBAAkB,QAAQ,IACrC;EAAS,eAAe;IACvB,SAAS;KAgCA,YAAY,KAAK,SAAS;WAC3B,SAAS;EAClB,gBAAgB;;iBAGF,kBAAkB,GAChC,KAAK;EAAO,QAAQ;EAAa,MAAM,OAAO;MAAiB,aAAa,IAC5E;EAAQ;EAAmB,cAAc;IACxC,YAAY;iBACC,kBAAkB,GAChC,KAAK;EAAO,QAAQ;EAAa,MAAM,OAAO;MAAiB,aAAa,IAC5E;EAAQ;EAAmB,eAAe;IACzC,YAAY;iBAmEC,eAAe,GAC7B,KAAK;EAAO,QAAQ;MAAkB,cAAc,aAAa,MACjE;EAAQ;EAAmB,wBAAwB;IAClD,qBAAqB;UAeP,IAAI;MACf;MACA,SAAS;MACT,MAAM,OAAO;;iBAGH,UAAU,GACxB,QAAQ,GACR;EAAQ,SAAS,OAAO,GAAG,MAAM;IAChC,IAAI;;;;;;;;;;;;;UC74BG,kBAAkB,WAAW;;EAErC;;KAGU,MAAM,6BAA6B,IAAI;;;;;;KAOvC,aAAa;UAER;EACf,UAAU;;;;;;;;;;;;UAaK;;;EAGf,QAAQ;;;EAGR,WAAW;;EAEX,WAAW;;;EAGX;;;;EAIA;;UAGe;EACf;EACA;;;;;;;;UCtDe;EACf;EACA;EACA;EACA;EACA;EACA;;KAGU,yDAAyD;KAmBzD;;;;;;;;;;;;;;;;;;;;;KCRA,cAAc,qBAAqB,KAAK,cAAc,aAAa;UAE9D,kBAAkB;EACjC,SAAS;EACT;;cAGW,aAAa,KAAK;YACb,QAAQ,KAAK,YAAY;EAS1B,OAAO,KAAK,YAAS,QAATA;;iBAKb,YAAY,SAAS,aAAa,KAAK,YAAY;iBACnD,YAAY,SAAS,yBAAyB,KAAK,YAAY;;;;;;;;;;;;;iBAsB/D,KAAK,SAAS,aAAa,QAAQ,KAAK,MAAM,yBAAyB;iBACvE,KAAK,OAAO,MAAM,aAAa;;;KC3DnC,6BAEE,WAAW,uBACX,WAAW,WAAW,WAAW;UAE9B,iBAAiB;EAChC;EACA;;;;;;EAMA;;;;;;EAMA;EACA,UAAU;EACV,SAAS;EACT,cAAc;;EAEd,mBAAmB;;;;;;EAMnB,uBAAuB;;;;;EAKvB,4BAA4B;;cAGjB,IAAI,+BAA+B,KAAK,WAAW;;YAC9C,QAAQ,KAAK,YAAY;;;;;;;;;;;;;;;;;;;EAuG1B,OAAO,KAAK,YAAS;;;;;KAgLjC,QAAQ;;;;;;;;;;iBAWG,IAAI,OAAO,MAAM,cAAc,UAAU,UAAU;;;UCjVlD;;EAEf;;EAEA;;EAEA;EACA;EACA;EACA;;;;EAIA;;KAGG;EACH;;KAGU,QAAQ,UAAU,SAAS,UAAU,IAAI;EACnD,UAAU;IACR,QAAQ;iBAEI,QAAQ,UAAU,SAAS,QACzC,OAAO,MAAM,eAAe,cACzB,UAAU,IACZ,QAAQ;;;;;;;;;;;;;;UCTM;EACf;EACA,OAAO;EACP;;;;;;WAMS,WAAW;;;;;;;;;;;;;UAcL;;WAEN,SAAS;;;WAIT;aACE,MAAM,SAAS;aACf,SAAS,GAAG;;;;;;WAOd;aACE;aACA,QAAQ,QAAQ;aAChB,MAAM;;aAEN,QAAQ,MAAM;;aAEd,OAAO,MAAM;aACb,SAAS;;;;;;WAOX,SAAS;;;;WAKT,UAAU,eAAe;;;;WAIzB,WAAW,kBAAkB,GAAG,sBAAsB;EAE/D,QAAQ;;;;KC3EE;UAEK;EACf,OAAO;EACP,SAAS;EACT;;EAEA,QAAQ;;EAER;;EAEA,QAAQ;;EAER;;EAEA,YAAY;EACZ;;;;;;;;;;;;cAyEW,MAAG,OAAkB,MAAM,cAAS,UAAe,WAAAC;;;;UC9F/C;EACf,SAAS,YAAY;;KAGX,mBAAmB,OAAO,UAAU,mBAAmB;KAEvD,mBAAmB,KAAK;UAEnB,wBAAwB;;;EAGvC;;EAEA,SAAS,QAAQ,OAAO,UAAU;;EAElC,UAAU;EACV,QAAQ,MAAM,SAAS;;;EAGvB,SAAS,cAAc;;cAWZ,uBAAuB;;EAKlC,YAAY,OAAM;EAKlB,OAAO,QAAQ;EAKf;EAKA,OAAO,OAAO,OAAO;;;;;;;;;;;;UChDN;WACN;WACA;WACA;EACT,QAAQ;;UAGO;WACN;EACT,cAAc;EACd;EACA;EACA,KAAK,eAAe,cAAc;EAClC,MAAM,eAAe,cAAc;EACnC;EACA;;UAiBe;EACf,QAAQ;EACR,SAAS;;EAET;;EAEA;;EAEA;;EAEA;;KAGG,kBAAkB,cAAc;;cAOxB;;EAmBX,YAAY,OAAM;;MAUd;;MAKA;;MAKA;;MAKA;;MAKA;MAIA;MAIA;MAIA,MAAM;;;;;EAeV;EA8DA,aAAa;IAAQ;;;EASrB;;;;;;;;EAyCA,YAAY,mBAAmB;EAC/B,YAAY,2BAA2B;EACvC,YAAY;;EAmCZ,iBAAiB;;EAYjB,MAAM;;;EA4BN,gBAAgB;;;EAMhB;;EAOA,OAAO,aAAa;;EAKpB;;EAKA;;EAKA,SAAS;;;;;;;EAUT,WAAW;;EAKX,YAAY;;EAKZ,gBAAgB,aAAa;;EAK7B;;;;;;;EAUA,KAAK;EAYL,SAAS,IAAI;;;;KC7YH,WAAW,UAAU;KAErB;EACV;EACA;EACA;;cAkBW;;WAIU,UAAU;EAA/B,YAAqB,UAAU;EAE/B,MAAM;EAKN,SAAS;EAMT,MACE,aACA,0BACA,wBACA,iBACC;;cAKQ;;WAKA,UAAU;WACV;WACA;EAHX,YACW,UAAU,UACV,iCACA;EAKX,IAAI;EAIJ,IAAI,aAAa;EAKjB,MAAM;EAIN,QAAQ,aAAa,aAAa;EAUlC,MACE,aACA,0BACA,wBACA,iBACC;EAKH,UACE,aACA,0BACA,wBACA,KAAK,YACJ;EAWH,MAAM,IAAI;EAIV;EAIA;EAYA,SAAS,aAAa,gBAAgB,eAAe,IAAI;EAezD,WAAW,aAAa,gBAAgB,eAAe,IAAI;EAe3D;IAAW;IAAc;;;;;;;;;;;;KCxJf;KAEA;EACV;EACA;;;;;;;;;;;;;;;;;uBAkBoB,QAAQ,8BAA8B,QAAQ,eAAe;;oBAC/D,MAAM;EAIxB,IAAI;;WAGK;IAAU;IAAa;;EAEhC,YAAY,UAAU;;EAkBtB,SAAS,OAAO;MAKZ;EAIJ,MAAM,YAAY;;EAKlB;;;gBAQc;;;;gBAOA,YAAY;;;qBAMP,SAAS,KAAK;;;qBAId;;eAGN,kBAAkB;;;WAItB,QAAQ,OAAO,cAAc;EAEhC,OAAO,QAAQ,cAAc;;;;KCvGzB;EACV;EACA;EACA;EACA;EACA;EACA,MAAM;;KAGI;EACV,eAAe;;;;;;;;;;;;;;;;;;;cAoBJ,uBAAuB,QAAQ;;WACjC;MAKL,kBAAkB;MAIlB;IAAY;IAAa;;MAIhB;;MAKT,mBAAmB;;EAKvB,KAAK,KAAK,OAAO,QAAQ;EAQhB,SAAS,OAAO;;;EAMzB,IAAI,UAAU,SAAS,eAAe,IAAI;EAa1C,OAAO,SAAS;EAWhB,KAAK,UAAU,UAAU,SAAS,eAAe,IAAI;EAIrD,MAAM,SAAS;;MAOX,kBAAkB;YAIZ,SAAS,KAAK;YAId;;;;;;;EAYJ,QAAQ,OAAO,cAAc;;;;KC1HzB;KAEA;EACV;EACA,MAAM;EACN,SAAS;EACT,IAAI;;KAQM;EACV;IAAU,YAAY;IAAW,OAAO;;EACxC;IAAa;IAAc,WAAW;;;cAG3B,uBAAuB,QAAQ;;EAK1C,IAAI;EAEJ,YAAY,UAAU;MAKlB,aAAa;MAIb,UAAU,OAAO;MAcjB;MAIA,KAAK;EAaT;EAKA,MAAM,OAAO;EAiCb;EAKA,OAAO,QAAQ,OAAO;EAetB,aAAa,OAAO,aAAa,KAAK;EAItC,aAAa,OAAO,aAAa,KAAK;EAItC,OAAO,OAAO,aAAa,KAAK;;;;KC5HtB;EACV;EACA;IAAU;IAAgB;IAAe;;;KAyC/B;EACV;;;;;;;;;;;;EAYA;;cAqCW,eAAe,QAAQ;;WACzB;EAiBT,YAAY,UAAU,UAAU,OAAM,QAAQ;MAS1C;IAAY;IAAa;;MAIzB,YAAY;;;;;;;;;;EAahB,OAAO,UAAU,MAAM,YAAY,IAAI;;MA4CnC;;MAKA,kBAAkB;EAIhB,YAAY;;;;;;MAUd;EAIJ,OAAO;EAIP,WAAW,OAAO,QAAQ;EAM1B,SAAS,OAAO,QAAQ;EAUxB;EAWA,OAAO,iBAAc;EAoDf,gBAAgB;EAUtB,aAAa;EAIb,SAAS,iBAAc;EAIvB,WAAW,iBAAc;EAgDnB,QAAQ,OAAO,cAAc;MA4L/B;MAIA;;;;;;;;;;;EAcJ;EAIA;EAcA,MAAM;IAAQ;;YAYJ,SAAS,KAAK;YAId;;;;;;;;;;;;;;;;;cC7kBC,WAAW;;WACb;EAIT,YAAY,UAAU;;MAQlB,QAAQ;MAIR,YAJQC;;;;;;;;EAeZ,IAAI,UAAU,MAAM,aAAa,IAAI;;MAOjC;;;;;;;MAUA;;;;;;;;;;EAaE,QAAQ,OAAO,cAAc;;;;;;;;EAkCnC;;MAMI,kBAAkB;YAIZ,SAAS,KAAK;YAId;MAIN;IAAY;IAAa;;;;;UC7Fd;EACf,QAAQ;EACR,SAAS;EACT,SAAS;EACT,QAAQ;;;;;;;;;EASR;;;EAGA;;EAEA;EACA,SAAS;;EAET;EACA,WAAW;;KAGD;EACV;EACA;EACA;;KAGU;;KAGA,eAAe,MAAM;cAEpB;;;EAIX,IAAI,cAAc;EAIlB,IAAI,cAAc;EAIlB,OAAO;;;;;;;;;;;;;;;;cAmBI,iBAAiB,QAAQ;;WAC3B,QAAQ;WACR,IAAI;WACJ,SAAS;WACT,WAAW;WACX,UAAU;WACV,OAAO;WACP,OAAO;;;;WAIP,QAAQ;EAqBjB,SAAS;;;;WAKA,SAAS;EAClB,OAAK;;;;;;EAOL;;MAEI;;;EAOJ,YAAY,OAAM;;;;;;;MAsHd,OAAO;MAgBP,aAAa;MAIb;MAIA,MAAM;MAIN;MAIA,MAAM;;;;MASN;;;;EAOJ,MAAM;;;;;MAMF,MAAM,OAAO;;MAUb,SAAS;EAIb;EAuBA;;EAiBA,QAAQ,aAAa;;;;;;EAerB,SAAS,kBAAkB,MAAM,oBAAoB;;;;;EAarD,KAAK,OAAO;;;;EAsBZ,SAAS,SAAS,cAAc;;;;;EA0E1B,UAAU;;;;;;KCjfN;EACV;EACA;EACA;EACA;EACA;EACA;EACA;EACA;IAAO,KAAK;;EACZ;IAAS,OAAO;;EAChB;IAAc,OAAO;;EACrB;IAAgB,OAAO;;;;;;;;;;;;;;;;;;;;;uBAqBH,KAAK,2BAA2B,2BAA2B,QAC/E,YACA;;EAkBA,UAAU;EACV;YACU,QAAQ,KAAK,YAAY,aAAa;EAEhD,YAAY,OAAO,MAAM,OAAO,UAAU;EAkB1C,WAAW,6BAA6B,QAAQ;EAIhD,YAAY,UAAU,eAAe,SAAS;IAAa,SAAS;;EAKpE,OAAO,UAAU,uCAAuC,OAAO,QAAQ;MAQnE,eAAe;MAKf,SAAS,YAAY,KAAK,MAAM;MAIhC,qBAAqB;gBAIX,wCAAM;;;;;;;YAQV,IAAI,GAAG,UAAU,IAAI,UAAU;;;;;;;;;;;;YAiB/B,4BAA4B;MAGlC,UAAU;;;;;MAQV,OAAO;MAIP,WAAW;MAIX;;;;;;;;;;;;;;EAiBJ;EACA,GAAG;EAOG,UAAU,KAAK,YAAY,QAAQ;MAKrC,wBAAwB;EAO5B,gBAAgB,MAAM;EAKtB,mBAAmB,MAAM;MAKrB,iBAAiB,SAAS;EAI9B;EAgCA,KAAK,GAAG,UAAU,IAAI;EAIhB,OAAO,KAAK,YAAY;qBA4DX,QAAQ,KAAK,YAAY;EAE5C,IAAI,OAAO;EAKX,OAAO,OAAO;EAOd,OAAO,eAAe,wBAAwB,OAAO;EA2CrD;EAKA,MAAM,KAAK;EAkCX;;;;;;;;;EAmBA;;EAUA;MAKI;EAIJ;EAOA;EAOA;EAKA,IAAI,UAAU,MAAM,MAAM,iBAAiB,IAAI;EAK/C;;;;;iBAQc,OAAO,aAAa,KAAK;;;KCld7B,cAAc,sBAAsB;KACpC,cAAc,IAAI;;;;;KAMlB,uBAAuB;;;;;;;UAQlB;EACf;EACA;EACA;EACA;EACA;EACA;;;EAGA;EACA;EACA;;;UAIe;EACf;EACA;EACA;;KAGU;EACV;IAAoB;;EACpB;IAAO,OAAO;;EACd;IAAS,OAAO;;EAChB;IAAmB,OAAO;;EAC1B;IAAS,MAAM;;EACf;IAAQ,MAAM;;;;;;;;;;;;;;;;;;;;;cAqBH,oBAAoB,QAAQ;;EASvC,YAAY,SAAS;;EAMrB,WAAW,SAAS;;MAKhB,WAAW;;;;;;EAUf,MAAM,MAAM;;;EAqBZ,KAAK,MAAM;MAoBP;;;;EAOJ,SAAS,IAAI;;;;KCnJH,cAAc,IAAI,yBAAyB;EACrD;EACA,QAAQ,OAAO,0BAA0B;;KAG/B;EACV;EACA,QAAQ;;KAGL;EACH,QAAQ;;cAGG;;EAIX,YAAY,QAAQ,aAAa,UAAU;EAK3C,MAAM,GAAG,OAAO,cAAc,KAAK,QAAQ;EAwB3C,wBAAwB,OAAM,oBAAsB,SAAA;IACC;;EAUrD,0BAA0B,OAAM,oBAAsB,SAAA;IACD;;EAUrD,UAAU,OAAM,oBAAsB,SAAA;IACc;IAAkB;;;iBAaxD,WAAW"}