@zaly/tui 0.1.1 → 0.2.0

package/dist/{markdown-CgRZBhIX.mjs → markdown-DvDIPT5L.mjs}

@@ -1,7 +1,7 @@
 import { S as unwrap, r as createAsync, w as useContext, y as signal } from "./reactive-DkP75TPk.mjs";
 import { t as Node } from "./node-CXNobGaP.mjs";
-import { i as expandTabs, o as formatText, t as calcLayout } from "./text-4arC3odI.mjs";
-import { r as textContent } from "./text-BArwVVkg.mjs";
+import { i as expandTabs, o as formatText, t as calcLayout } from "./text-BEuhhxr7.mjs";
+import { r as textContent } from "./text-H_2kzwaz.mjs";
 import { t as RenderContext } from "./render-Bp2N2i6J.mjs";
 import { n as shikiWorker } from "./client-BWm6dNZF.mjs";
 import { t as codeToAnsi } from "./shiki-BAf9PdIc.mjs";
@@ -74,7 +74,7 @@ var Markdown = class extends Node {
 	}
 	async _render(ctx) {
 		if (!this.#renderer) {
-			const { MarkdownRenderer } = await import("./renderer-Ctz0hv5o.mjs");
+			const { MarkdownRenderer } = await import("./renderer-Dv5fIuIk.mjs");
 			this.#renderer = new MarkdownRenderer({
 				...this.state.options,
 				parent: this
@@ -121,4 +121,4 @@ function markdown(first, style) {
 }
 export { markdown as n, Markdown as t };
 
-//# sourceMappingURL=markdown-CgRZBhIX.mjs.map
+//# sourceMappingURL=markdown-DvDIPT5L.mjs.map

package/dist/{markdown-CgRZBhIX.mjs.map → markdown-DvDIPT5L.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"markdown-CgRZBhIX.mjs","names":[],"sources":["../src/widgets/markdown.ts"],"sourcesContent":["import type { RenderCtx } from \"../core/ctx.ts\"\nimport type { Accessor } from \"../core/reactive.ts\"\nimport type { State } from \"../core/state.ts\"\nimport type { WrapMode } from \"../layout/text.ts\"\nimport type { MarkdownRenderer } from \"../markdown/renderer.ts\"\nimport type { MdOptions } from \"../markdown/types.ts\"\nimport type { ShikiThemeInput } from \"../shiki/types.ts\"\nimport type { AnyStyle } from \"../style/types.ts\"\nimport type { Image } from \"./image.ts\"\nimport type { TextContent } from \"./text.ts\"\n\nimport { hasColors } from \"@zaly/shared/env\"\nimport { Node } from \"../core/node.ts\"\nimport { createAsync, signal, unwrap, useContext } from \"../core/reactive.ts\"\nimport { RenderContext } from \"../core/render.ts\"\nimport { calcLayout, expandTabs, formatText } from \"../layout/text.ts\"\nimport { shikiWorker } from \"../shiki/client.ts\"\nimport { codeToAnsi } from \"../shiki/shiki.ts\"\nimport { shikiTheme } from \"../shiki/theme.ts\"\nimport { textContent } from \"./text.ts\"\n\nexport interface MarkdownState {\n  /** Markdown source. Accepts a plain string or a reactive accessor —\n   *  pass `signal()` / `memo()` for streaming content that re-parses on\n   *  each render and subscribes the node to the signal. */\n  content: TextContent\n  /** Options forwarded to `renderMarkdown`. */\n  options?: MdOptions\n  /**\n   * Enable shiki-backed syntax highlighting for fenced code blocks. Defaults\n   * to `true` — code blocks get per-token colors from the shiki theme, with\n   * `mdCodeBlock`'s bg applied as a backdrop. Unknown languages fall through\n   * as plain text.\n   */\n  syntax?: boolean\n  wrap?: WrapMode\n  style?: AnyStyle\n}\n\ntype ShikiCode = {\n  key: string\n  code: string\n  lang: string\n  theme?: ShikiThemeInput\n  inflight?: Promise<string>\n  ac?: AbortController\n  result?: string\n  gen: number\n}\n\nexport class Markdown extends Node<MarkdownState> {\n  // Image nodes cached per-src per-Markdown-instance. Re-rendering the\n  // same markdown (streaming updates) reuses the same `Image` — same\n  // `placementId`, which the KGP spec guarantees is a flicker-free\n  // move/resize of the existing placement.\n  readonly images = new Map<string, Image>()\n\n  #renderer?: MarkdownRenderer\n  #code = new Map<string, ShikiCode>()\n  #update = signal(0)\n  #gen = 0\n  #worker: Accessor<number>\n  #images?: Accessor<boolean>\n\n  constructor(state: State<MarkdownState>) {\n    super(state)\n\n    const context = useContext(RenderContext)\n    this.#images = context?.images\n\n    this.#worker = createAsync(\n      async () => {\n        const update = this.#update.get() // track\n        const todo = [...this.#code.values()].filter((c) => c.gen === this.#gen && !c.result)\n        if (!todo.length) return update // nothing to do, skip\n        await Promise.all(\n          todo.map(async (req) => {\n            req.ac ??= new AbortController()\n            req.inflight ??= codeToAnsi(req.code, req.lang, {\n              signal: req.ac.signal,\n              theme: req.theme,\n            })\n            try {\n              req.result = await req.inflight\n            } catch (error) {\n              if (req.ac.signal.aborted) {\n                if (this.#code.get(req.key) === req) this.#code.delete(req.key)\n              } else throw error\n            }\n          })\n        )\n        return update + 1\n      },\n      { initialValue: 0 }\n    )\n  }\n\n  /** Find a highlighted result for a prefix of `code` in the cache. This\n   * handles streaming updates where the full code block isn't available yet\n   * and prevents flashing un-highlighted text on each update. */\n  #streamingHighlight(code: string, lang: string, theme?: ShikiThemeInput) {\n    let ret: ShikiCode | undefined\n    for (const c of this.#code.values()) {\n      if (!c.result || c.lang !== lang || c.theme !== theme) continue\n      if (code.startsWith(c.code) && c.code.length > (ret?.code.length ?? 0)) ret = c\n    }\n    if (ret) ret.gen = this.#gen // bump gen to keep it alive in cache\n    return ret?.result ? ret.result + code.slice(ret.code.length) : code\n  }\n\n  #highlight(code: string, lang?: string, theme?: ShikiThemeInput): string {\n    if (!lang) return code\n    const key = shikiWorker.key({ code, lang, theme })\n    const ret = this.#code.get(key)\n    if (ret) ret.gen = this.#gen // bump gen to keep it alive in cache\n    if (ret?.result) return ret.result\n    else if (!ret) this.#code.set(key, { code, gen: this.#gen, key, lang, theme })\n    return this.#streamingHighlight(code, lang, theme)\n  }\n\n  protected async _render(ctx: RenderCtx): Promise<string[]> {\n    if (!this.#renderer) {\n      const { MarkdownRenderer } = await import(\"../markdown/renderer.ts\")\n      this.#renderer = new MarkdownRenderer({ ...this.state.options, parent: this })\n    }\n    let source = await textContent(this.state.content, ctx)\n    source = expandTabs(source)\n    let formatted: string\n\n    if (!hasColors) formatted = this.#renderer.normalizeEol(source, source)\n    else {\n      this.#gen++ // bump generation to track what is still used\n\n      formatted = await this.#renderer.render(source, {\n        ...ctx,\n        highlight: (code, lang) => this.#highlight(code, lang, shikiTheme(ctx.style.theme)),\n        images: unwrap(this.#images) ?? true,\n      })\n\n      // prune old entries\n      for (const [k, c] of this.#code.entries())\n        if (c.gen !== this.#gen) {\n          c.ac?.abort()\n          if (c.result !== undefined) this.#code.delete(k)\n        }\n\n      // Trigger the worker if needed\n      if (this.#code.values().some((c) => !c.inflight)) {\n        this.#update.set(this.#gen) // trigger worker\n        this.#worker() // tracked\n      }\n    }\n\n    return formatText(formatted, {\n      indent: true,\n      style: this.state.style ? ctx.style.add(this.state.style) : undefined,\n      width: ctx.width,\n      wrap: this.state.wrap,\n      wrapBg: true,\n    })\n  }\n\n  override async layout(ctx: RenderCtx) {\n    return calcLayout(await textContent(this.state.content, ctx))\n  }\n}\n\n/**\n * Render a markdown string as a TUI node. Produces ANSI-styled text that\n * resolves per-element styling through theme slots (`mdHeading1`, `mdCode`,\n * `mdLink`, …). Links become clickable in terminals that support OSC 8.\n *\n * ```ts\n * markdown(\"# Hello\\n\\nThis is **bold** and *italic*.\")\n * markdown({ content, wrap: \"word\", fg: \"fg\" })\n * ```\n */\nexport function markdown(\n  content: TextContent,\n  style?: Omit<State<MarkdownState>, \"content\">\n): Markdown\nexport function markdown(state: State<MarkdownState>): Markdown\nexport function markdown(\n  first: TextContent | MarkdownState,\n  style?: Omit<State<MarkdownState>, \"content\">\n): Markdown {\n  // Plain strings and accessor functions go through the content path;\n  // a non-function object is the full state form.\n  if (typeof first === \"string\" || typeof first === \"function\") {\n    return new Markdown({ content: first, ...style })\n  }\n  return new Markdown(first)\n}\n"],"mappings":";;;;;;;;;;AAkDA,IAAa,WAAb,cAA8B,KAAoB;CAKhD,yBAAkB,IAAI,IAAmB;CAEzC;CACA,wBAAQ,IAAI,IAAuB;CACnC,UAAU,OAAO,CAAC;CAClB,OAAO;CACP;CACA;CAEA,YAAY,OAA6B;EACvC,MAAM,KAAK;EAEX,MAAM,UAAU,WAAW,aAAa;EACxC,KAAK,UAAU,SAAS;EAExB,KAAK,UAAU,YACb,YAAY;GACV,MAAM,SAAS,KAAK,QAAQ,IAAI;GAChC,MAAM,OAAO,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC,CAAC,CAAC,QAAQ,MAAM,EAAE,QAAQ,KAAK,QAAQ,CAAC,EAAE,MAAM;GACpF,IAAI,CAAC,KAAK,QAAQ,OAAO;GACzB,MAAM,QAAQ,IACZ,KAAK,IAAI,OAAO,QAAQ;IACtB,IAAI,OAAO,IAAI,gBAAgB;IAC/B,IAAI,aAAa,WAAW,IAAI,MAAM,IAAI,MAAM;KAC9C,QAAQ,IAAI,GAAG;KACf,OAAO,IAAI;IACb,CAAC;IACD,IAAI;KACF,IAAI,SAAS,MAAM,IAAI;IACzB,SAAS,OAAO;KACd,IAAI,IAAI,GAAG,OAAO,SACZ;UAAA,KAAK,MAAM,IAAI,IAAI,GAAG,MAAM,KAAK,KAAK,MAAM,OAAO,IAAI,GAAG;KAAA,OACzD,MAAM;IACf;GACF,CAAC,CACH;GACA,OAAO,SAAS;EAClB,GACA,EAAE,cAAc,EAAE,CACpB;CACF;;;;CAKA,oBAAoB,MAAc,MAAc,OAAyB;EACvE,IAAI;EACJ,KAAK,MAAM,KAAK,KAAK,MAAM,OAAO,GAAG;GACnC,IAAI,CAAC,EAAE,UAAU,EAAE,SAAS,QAAQ,EAAE,UAAU,OAAO;GACvD,IAAI,KAAK,WAAW,EAAE,IAAI,KAAK,EAAE,KAAK,UAAU,KAAK,KAAK,UAAU,IAAI,MAAM;EAChF;EACA,IAAI,KAAK,IAAI,MAAM,KAAK;EACxB,OAAO,KAAK,SAAS,IAAI,SAAS,KAAK,MAAM,IAAI,KAAK,MAAM,IAAI;CAClE;CAEA,WAAW,MAAc,MAAe,OAAiC;EACvE,IAAI,CAAC,MAAM,OAAO;EAClB,MAAM,MAAM,YAAY,IAAI;GAAE;GAAM;GAAM;EAAM,CAAC;EACjD,MAAM,MAAM,KAAK,MAAM,IAAI,GAAG;EAC9B,IAAI,KAAK,IAAI,MAAM,KAAK;EACxB,IAAI,KAAK,QAAQ,OAAO,IAAI;OACvB,IAAI,CAAC,KAAK,KAAK,MAAM,IAAI,KAAK;GAAE;GAAM,KAAK,KAAK;GAAM;GAAK;GAAM;EAAM,CAAC;EAC7E,OAAO,KAAK,oBAAoB,MAAM,MAAM,KAAK;CACnD;CAEA,MAAgB,QAAQ,KAAmC;EACzD,IAAI,CAAC,KAAK,WAAW;GACnB,MAAM,EAAE,qBAAqB,MAAM,OAAO;GAC1C,KAAK,YAAY,IAAI,iBAAiB;IAAE,GAAG,KAAK,MAAM;IAAS,QAAQ;GAAK,CAAC;EAC/E;EACA,IAAI,SAAS,MAAM,YAAY,KAAK,MAAM,SAAS,GAAG;EACtD,SAAS,WAAW,MAAM;EAC1B,IAAI;EAEJ,IAAI,CAAC,WAAW,YAAY,KAAK,UAAU,aAAa,QAAQ,MAAM;OACjE;GACH,KAAK;GAEL,YAAY,MAAM,KAAK,UAAU,OAAO,QAAQ;IAC9C,GAAG;IACH,YAAY,MAAM,SAAS,KAAK,WAAW,MAAM,MAAM,WAAW,IAAI,MAAM,KAAK,CAAC;IAClF,QAAQ,OAAO,KAAK,OAAO,KAAK;GAClC,CAAC;GAGD,KAAK,MAAM,CAAC,GAAG,MAAM,KAAK,MAAM,QAAQ,GACtC,IAAI,EAAE,QAAQ,KAAK,MAAM;IACvB,EAAE,IAAI,MAAM;IACZ,IAAI,EAAE,WAAW,KAAA,GAAW,KAAK,MAAM,OAAO,CAAC;GACjD;GAGF,IAAI,KAAK,MAAM,OAAO,CAAC,CAAC,MAAM,MAAM,CAAC,EAAE,QAAQ,GAAG;IAChD,KAAK,QAAQ,IAAI,KAAK,IAAI;IAC1B,KAAK,QAAQ;GACf;EACF;EAEA,OAAO,WAAW,WAAW;GAC3B,QAAQ;GACR,OAAO,KAAK,MAAM,QAAQ,IAAI,MAAM,IAAI,KAAK,MAAM,KAAK,IAAI,KAAA;GAC5D,OAAO,IAAI;GACX,MAAM,KAAK,MAAM;GACjB,QAAQ;EACV,CAAC;CACH;CAEA,MAAe,OAAO,KAAgB;EACpC,OAAO,WAAW,MAAM,YAAY,KAAK,MAAM,SAAS,GAAG,CAAC;CAC9D;AACF;AAiBA,SAAgB,SACd,OACA,OACU;CAGV,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,YAChD,OAAO,IAAI,SAAS;EAAE,SAAS;EAAO,GAAG;CAAM,CAAC;CAElD,OAAO,IAAI,SAAS,KAAK;AAC3B"}
+{"version":3,"file":"markdown-DvDIPT5L.mjs","names":[],"sources":["../src/widgets/markdown.ts"],"sourcesContent":["import type { RenderCtx } from \"../core/ctx.ts\"\nimport type { Accessor } from \"../core/reactive.ts\"\nimport type { State } from \"../core/state.ts\"\nimport type { WrapMode } from \"../layout/text.ts\"\nimport type { MarkdownRenderer } from \"../markdown/renderer.ts\"\nimport type { MdOptions } from \"../markdown/types.ts\"\nimport type { ShikiThemeInput } from \"../shiki/types.ts\"\nimport type { AnyStyle } from \"../style/types.ts\"\nimport type { Image } from \"./image.ts\"\nimport type { TextContent } from \"./text.ts\"\n\nimport { hasColors } from \"@zaly/shared/env\"\nimport { Node } from \"../core/node.ts\"\nimport { createAsync, signal, unwrap, useContext } from \"../core/reactive.ts\"\nimport { RenderContext } from \"../core/render.ts\"\nimport { calcLayout, expandTabs, formatText } from \"../layout/text.ts\"\nimport { shikiWorker } from \"../shiki/client.ts\"\nimport { codeToAnsi } from \"../shiki/shiki.ts\"\nimport { shikiTheme } from \"../shiki/theme.ts\"\nimport { textContent } from \"./text.ts\"\n\nexport interface MarkdownState {\n  /** Markdown source. Accepts a plain string or a reactive accessor —\n   *  pass `signal()` / `memo()` for streaming content that re-parses on\n   *  each render and subscribes the node to the signal. */\n  content: TextContent\n  /** Options forwarded to `renderMarkdown`. */\n  options?: MdOptions\n  /**\n   * Enable shiki-backed syntax highlighting for fenced code blocks. Defaults\n   * to `true` — code blocks get per-token colors from the shiki theme, with\n   * `mdCodeBlock`'s bg applied as a backdrop. Unknown languages fall through\n   * as plain text.\n   */\n  syntax?: boolean\n  wrap?: WrapMode\n  style?: AnyStyle\n}\n\ntype ShikiCode = {\n  key: string\n  code: string\n  lang: string\n  theme?: ShikiThemeInput\n  inflight?: Promise<string>\n  ac?: AbortController\n  result?: string\n  gen: number\n}\n\nexport class Markdown extends Node<MarkdownState> {\n  // Image nodes cached per-src per-Markdown-instance. Re-rendering the\n  // same markdown (streaming updates) reuses the same `Image` — same\n  // `placementId`, which the KGP spec guarantees is a flicker-free\n  // move/resize of the existing placement.\n  readonly images = new Map<string, Image>()\n\n  #renderer?: MarkdownRenderer\n  #code = new Map<string, ShikiCode>()\n  #update = signal(0)\n  #gen = 0\n  #worker: Accessor<number>\n  #images?: Accessor<boolean>\n\n  constructor(state: State<MarkdownState>) {\n    super(state)\n\n    const context = useContext(RenderContext)\n    this.#images = context?.images\n\n    this.#worker = createAsync(\n      async () => {\n        const update = this.#update.get() // track\n        const todo = [...this.#code.values()].filter((c) => c.gen === this.#gen && !c.result)\n        if (!todo.length) return update // nothing to do, skip\n        await Promise.all(\n          todo.map(async (req) => {\n            req.ac ??= new AbortController()\n            req.inflight ??= codeToAnsi(req.code, req.lang, {\n              signal: req.ac.signal,\n              theme: req.theme,\n            })\n            try {\n              req.result = await req.inflight\n            } catch (error) {\n              if (req.ac.signal.aborted) {\n                if (this.#code.get(req.key) === req) this.#code.delete(req.key)\n              } else throw error\n            }\n          })\n        )\n        return update + 1\n      },\n      { initialValue: 0 }\n    )\n  }\n\n  /** Find a highlighted result for a prefix of `code` in the cache. This\n   * handles streaming updates where the full code block isn't available yet\n   * and prevents flashing un-highlighted text on each update. */\n  #streamingHighlight(code: string, lang: string, theme?: ShikiThemeInput) {\n    let ret: ShikiCode | undefined\n    for (const c of this.#code.values()) {\n      if (!c.result || c.lang !== lang || c.theme !== theme) continue\n      if (code.startsWith(c.code) && c.code.length > (ret?.code.length ?? 0)) ret = c\n    }\n    if (ret) ret.gen = this.#gen // bump gen to keep it alive in cache\n    return ret?.result ? ret.result + code.slice(ret.code.length) : code\n  }\n\n  #highlight(code: string, lang?: string, theme?: ShikiThemeInput): string {\n    if (!lang) return code\n    const key = shikiWorker.key({ code, lang, theme })\n    const ret = this.#code.get(key)\n    if (ret) ret.gen = this.#gen // bump gen to keep it alive in cache\n    if (ret?.result) return ret.result\n    else if (!ret) this.#code.set(key, { code, gen: this.#gen, key, lang, theme })\n    return this.#streamingHighlight(code, lang, theme)\n  }\n\n  protected async _render(ctx: RenderCtx): Promise<string[]> {\n    if (!this.#renderer) {\n      const { MarkdownRenderer } = await import(\"../markdown/renderer.ts\")\n      this.#renderer = new MarkdownRenderer({ ...this.state.options, parent: this })\n    }\n    let source = await textContent(this.state.content, ctx)\n    source = expandTabs(source)\n    let formatted: string\n\n    if (!hasColors) formatted = this.#renderer.normalizeEol(source, source)\n    else {\n      this.#gen++ // bump generation to track what is still used\n\n      formatted = await this.#renderer.render(source, {\n        ...ctx,\n        highlight: (code, lang) => this.#highlight(code, lang, shikiTheme(ctx.style.theme)),\n        images: unwrap(this.#images) ?? true,\n      })\n\n      // prune old entries\n      for (const [k, c] of this.#code.entries())\n        if (c.gen !== this.#gen) {\n          c.ac?.abort()\n          if (c.result !== undefined) this.#code.delete(k)\n        }\n\n      // Trigger the worker if needed\n      if (this.#code.values().some((c) => !c.inflight)) {\n        this.#update.set(this.#gen) // trigger worker\n        this.#worker() // tracked\n      }\n    }\n\n    return formatText(formatted, {\n      indent: true,\n      style: this.state.style ? ctx.style.add(this.state.style) : undefined,\n      width: ctx.width,\n      wrap: this.state.wrap,\n      wrapBg: true,\n    })\n  }\n\n  override async layout(ctx: RenderCtx) {\n    return calcLayout(await textContent(this.state.content, ctx))\n  }\n}\n\n/**\n * Render a markdown string as a TUI node. Produces ANSI-styled text that\n * resolves per-element styling through theme slots (`mdHeading1`, `mdCode`,\n * `mdLink`, …). Links become clickable in terminals that support OSC 8.\n *\n * ```ts\n * markdown(\"# Hello\\n\\nThis is **bold** and *italic*.\")\n * markdown({ content, wrap: \"word\", fg: \"fg\" })\n * ```\n */\nexport function markdown(\n  content: TextContent,\n  style?: Omit<State<MarkdownState>, \"content\">\n): Markdown\nexport function markdown(state: State<MarkdownState>): Markdown\nexport function markdown(\n  first: TextContent | MarkdownState,\n  style?: Omit<State<MarkdownState>, \"content\">\n): Markdown {\n  // Plain strings and accessor functions go through the content path;\n  // a non-function object is the full state form.\n  if (typeof first === \"string\" || typeof first === \"function\") {\n    return new Markdown({ content: first, ...style })\n  }\n  return new Markdown(first)\n}\n"],"mappings":";;;;;;;;;;AAkDA,IAAa,WAAb,cAA8B,KAAoB;CAKhD,yBAAkB,IAAI,IAAmB;CAEzC;CACA,wBAAQ,IAAI,IAAuB;CACnC,UAAU,OAAO,CAAC;CAClB,OAAO;CACP;CACA;CAEA,YAAY,OAA6B;EACvC,MAAM,KAAK;EAEX,MAAM,UAAU,WAAW,aAAa;EACxC,KAAK,UAAU,SAAS;EAExB,KAAK,UAAU,YACb,YAAY;GACV,MAAM,SAAS,KAAK,QAAQ,IAAI;GAChC,MAAM,OAAO,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC,CAAC,CAAC,QAAQ,MAAM,EAAE,QAAQ,KAAK,QAAQ,CAAC,EAAE,MAAM;GACpF,IAAI,CAAC,KAAK,QAAQ,OAAO;GACzB,MAAM,QAAQ,IACZ,KAAK,IAAI,OAAO,QAAQ;IACtB,IAAI,OAAO,IAAI,gBAAgB;IAC/B,IAAI,aAAa,WAAW,IAAI,MAAM,IAAI,MAAM;KAC9C,QAAQ,IAAI,GAAG;KACf,OAAO,IAAI;IACb,CAAC;IACD,IAAI;KACF,IAAI,SAAS,MAAM,IAAI;IACzB,SAAS,OAAO;KACd,IAAI,IAAI,GAAG,OAAO,SACZ;UAAA,KAAK,MAAM,IAAI,IAAI,GAAG,MAAM,KAAK,KAAK,MAAM,OAAO,IAAI,GAAG;KAAA,OACzD,MAAM;IACf;GACF,CAAC,CACH;GACA,OAAO,SAAS;EAClB,GACA,EAAE,cAAc,EAAE,CACpB;CACF;;;;CAKA,oBAAoB,MAAc,MAAc,OAAyB;EACvE,IAAI;EACJ,KAAK,MAAM,KAAK,KAAK,MAAM,OAAO,GAAG;GACnC,IAAI,CAAC,EAAE,UAAU,EAAE,SAAS,QAAQ,EAAE,UAAU,OAAO;GACvD,IAAI,KAAK,WAAW,EAAE,IAAI,KAAK,EAAE,KAAK,UAAU,KAAK,KAAK,UAAU,IAAI,MAAM;EAChF;EACA,IAAI,KAAK,IAAI,MAAM,KAAK;EACxB,OAAO,KAAK,SAAS,IAAI,SAAS,KAAK,MAAM,IAAI,KAAK,MAAM,IAAI;CAClE;CAEA,WAAW,MAAc,MAAe,OAAiC;EACvE,IAAI,CAAC,MAAM,OAAO;EAClB,MAAM,MAAM,YAAY,IAAI;GAAE;GAAM;GAAM;EAAM,CAAC;EACjD,MAAM,MAAM,KAAK,MAAM,IAAI,GAAG;EAC9B,IAAI,KAAK,IAAI,MAAM,KAAK;EACxB,IAAI,KAAK,QAAQ,OAAO,IAAI;OACvB,IAAI,CAAC,KAAK,KAAK,MAAM,IAAI,KAAK;GAAE;GAAM,KAAK,KAAK;GAAM;GAAK;GAAM;EAAM,CAAC;EAC7E,OAAO,KAAK,oBAAoB,MAAM,MAAM,KAAK;CACnD;CAEA,MAAgB,QAAQ,KAAmC;EACzD,IAAI,CAAC,KAAK,WAAW;GACnB,MAAM,EAAE,qBAAqB,MAAM,OAAO;GAC1C,KAAK,YAAY,IAAI,iBAAiB;IAAE,GAAG,KAAK,MAAM;IAAS,QAAQ;GAAK,CAAC;EAC/E;EACA,IAAI,SAAS,MAAM,YAAY,KAAK,MAAM,SAAS,GAAG;EACtD,SAAS,WAAW,MAAM;EAC1B,IAAI;EAEJ,IAAI,CAAC,WAAW,YAAY,KAAK,UAAU,aAAa,QAAQ,MAAM;OACjE;GACH,KAAK;GAEL,YAAY,MAAM,KAAK,UAAU,OAAO,QAAQ;IAC9C,GAAG;IACH,YAAY,MAAM,SAAS,KAAK,WAAW,MAAM,MAAM,WAAW,IAAI,MAAM,KAAK,CAAC;IAClF,QAAQ,OAAO,KAAK,OAAO,KAAK;GAClC,CAAC;GAGD,KAAK,MAAM,CAAC,GAAG,MAAM,KAAK,MAAM,QAAQ,GACtC,IAAI,EAAE,QAAQ,KAAK,MAAM;IACvB,EAAE,IAAI,MAAM;IACZ,IAAI,EAAE,WAAW,KAAA,GAAW,KAAK,MAAM,OAAO,CAAC;GACjD;GAGF,IAAI,KAAK,MAAM,OAAO,CAAC,CAAC,MAAM,MAAM,CAAC,EAAE,QAAQ,GAAG;IAChD,KAAK,QAAQ,IAAI,KAAK,IAAI;IAC1B,KAAK,QAAQ;GACf;EACF;EAEA,OAAO,WAAW,WAAW;GAC3B,QAAQ;GACR,OAAO,KAAK,MAAM,QAAQ,IAAI,MAAM,IAAI,KAAK,MAAM,KAAK,IAAI,KAAA;GAC5D,OAAO,IAAI;GACX,MAAM,KAAK,MAAM;GACjB,QAAQ;EACV,CAAC;CACH;CAEA,MAAe,OAAO,KAAgB;EACpC,OAAO,WAAW,MAAM,YAAY,KAAK,MAAM,SAAS,GAAG,CAAC;CAC9D;AACF;AAiBA,SAAgB,SACd,OACA,OACU;CAGV,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,YAChD,OAAO,IAAI,SAAS;EAAE,SAAS;EAAO,GAAG;CAAM,CAAC;CAElD,OAAO,IAAI,SAAS,KAAK;AAC3B"}

package/dist/markdown.mjs

@@ -1 +1 @@
-export { t as MarkdownRenderer } from "./renderer-BYl2pbdx.mjs";
+export { t as MarkdownRenderer } from "./renderer-Ksfkfv5X.mjs";

package/dist/{overlay-CevDWgSF.mjs → overlay-zDNpwKu0.mjs}

@@ -1,4 +1,4 @@
-import { n as box } from "./box-DToDoXlU.mjs";
+import { n as box } from "./box-DbIjxh39.mjs";
 // src/widgets/overlay.ts
 function overlay(state, ...children) {
 	const node = box({
@@ -14,4 +14,4 @@ function overlay(state, ...children) {
 }
 export { overlay as t };
 
-//# sourceMappingURL=overlay-CevDWgSF.mjs.map
+//# sourceMappingURL=overlay-zDNpwKu0.mjs.map

package/dist/{overlay-CevDWgSF.mjs.map → overlay-zDNpwKu0.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"overlay-CevDWgSF.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-zDNpwKu0.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-D9WrE3zF.mjs → picker-DV_oxKEv.mjs}

@@ -1,6 +1,6 @@
 import { S as unwrap, f as effect, h as memo, s as createProgressive, x as untrack } from "./reactive-DkP75TPk.mjs";
 import { t as widget } from "./widget-sFveyrZE.mjs";
-import { t as Input } from "./input-BkE4EpBw.mjs";
+import { t as Input } from "./input-CtGmVrKa.mjs";
 import { n as select } from "./select-CUmAFKJh.mjs";
 import { t as tree } from "./tree-D6NvMQx8.mjs";
 import { sliceAnsi, stripAnsi } from "@zaly/shared/ansi";
@@ -613,4 +613,4 @@ const picker = widget((props) => {
 });
 export { picker as t };
 
-//# sourceMappingURL=picker-D9WrE3zF.mjs.map
+//# sourceMappingURL=picker-DV_oxKEv.mjs.map

package/dist/{picker-D9WrE3zF.mjs.map → picker-DV_oxKEv.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"picker-D9WrE3zF.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"}
+{"version":3,"file":"picker-DV_oxKEv.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/renderer-Dv5fIuIk.mjs

@@ -0,0 +1 @@
+export { t as MarkdownRenderer } from "./renderer-Ksfkfv5X.mjs";

package/dist/{renderer-BYl2pbdx.mjs → renderer-Ksfkfv5X.mjs}

@@ -10,7 +10,7 @@ var MarkdownRenderer = class {
 	}
 	async render(source, ctx) {
 		this.#render ??= this.#opts.render ?? (await import("#md")).renderMarkdown;
-		const [{ createCallbacks }, { createImageCallback }] = await Promise.all([import("./callbacks-DW8XKYKy.mjs"), import("./image-M--Bw4bs.mjs")]);
+		const [{ createCallbacks }, { createImageCallback }] = await Promise.all([import("./callbacks-UaBfDStQ.mjs"), import("./image-M--Bw4bs.mjs")]);
 		const callbacks = createCallbacks(ctx);
 		const image = createImageCallback({
 			add: (child) => this.#parent?.add(child),
@@ -37,4 +37,4 @@ var MarkdownRenderer = class {
 };
 export { MarkdownRenderer as t };
 
-//# sourceMappingURL=renderer-BYl2pbdx.mjs.map
+//# sourceMappingURL=renderer-Ksfkfv5X.mjs.map

package/dist/{renderer-BYl2pbdx.mjs.map → renderer-Ksfkfv5X.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"renderer-BYl2pbdx.mjs","names":[],"sources":["../src/markdown/renderer.ts"],"sourcesContent":["import type { RenderCtx } from \"../core/ctx.ts\"\nimport type { Node } from \"../core/node.ts\"\nimport type { Image } from \"../widgets/image.ts\"\nimport type { MdOptions, RenderMarkdown } from \"./types.ts\"\n\nexport type MarkdownOptions = MdOptions & {\n  parent?: Node\n}\n\nexport type MarkdownCtx = RenderCtx & {\n  images?: boolean\n  highlight?: (code: string, lang?: string) => string\n}\n\nexport class MarkdownRenderer {\n  #render?: RenderMarkdown\n  #images = new Map<string, Image>()\n  #parent?: Node\n  #opts: MarkdownOptions\n\n  constructor(opts: MarkdownOptions = {}) {\n    this.#opts = opts\n    this.#parent = opts.parent\n  }\n\n  async render(source: string, ctx: MarkdownCtx): Promise<string> {\n    // oxlint-disable-next-line unicorn/no-await-expression-member\n    this.#render ??= this.#opts.render ?? (await import(\"#md\")).renderMarkdown\n\n    const [{ createCallbacks }, { createImageCallback }] = await Promise.all([\n      import(\"./callbacks.ts\"),\n      import(\"./image.ts\"),\n    ])\n\n    const callbacks = createCallbacks(ctx)\n\n    // Image handling: the callback emits `<img id=N>` markers during\n    // rendering; a post-processing resolver then renders the referenced\n    // images concurrently and splices their rows back in. Keeps the\n    // markdown callback surface synchronous while supporting async\n    // image preparation.\n    const image = createImageCallback({\n      add: (child) => this.#parent?.add(child),\n      images: this.#images,\n      queries: ctx.images === false ? undefined : this.#parent?.ctx?.input.queries,\n      remove: (child) => this.#parent?.remove(child) ?? child.unmount(),\n    })\n\n    if (ctx.images ?? true) callbacks.image = image.cb\n\n    let rendered = this.#render(image.prepare(source), callbacks, this.#opts)\n    rendered = await image.resolve(ctx, rendered)\n    return this.normalizeEol(source, rendered)\n  }\n\n  /** Mirror the source's trailing newlines: the renderer adds its own\n  /* padding after blocks (`\\n\\n` after paragraphs, etc.) which would\n  /* leave stray blank rows. Normalizing to what the caller typed keeps\n  /* single-line inputs compact and preserves explicit spacing when\n  /* they asked for it. */\n  normalizeEol(source: string, rendered: string): string {\n    // Collapse multiple blank lines to a maximum of one\n    rendered = rendered.replace(/\\n\\n+/g, \"\\n\\n\")\n    // Trim leading blank lines\n    rendered = rendered.replace(/^\\s*\\n/, \"\")\n    const trailing = /\\n*$/.exec(source)?.[0] ?? \"\"\n    return rendered.replace(/\\n+$/, trailing)\n  }\n}\n"],"mappings":";AAcA,IAAa,mBAAb,MAA8B;CAC5B;CACA,0BAAU,IAAI,IAAmB;CACjC;CACA;CAEA,YAAY,OAAwB,CAAC,GAAG;EACtC,KAAK,QAAQ;EACb,KAAK,UAAU,KAAK;CACtB;CAEA,MAAM,OAAO,QAAgB,KAAmC;EAE9D,KAAK,YAAY,KAAK,MAAM,WAAW,MAAM,OAAO,OAAA,CAAQ;EAE5D,MAAM,CAAC,EAAE,mBAAmB,EAAE,yBAAyB,MAAM,QAAQ,IAAI,CACvE,OAAO,6BACP,OAAO,uBACT,CAAC;EAED,MAAM,YAAY,gBAAgB,GAAG;EAOrC,MAAM,QAAQ,oBAAoB;GAChC,MAAM,UAAU,KAAK,SAAS,IAAI,KAAK;GACvC,QAAQ,KAAK;GACb,SAAS,IAAI,WAAW,QAAQ,KAAA,IAAY,KAAK,SAAS,KAAK,MAAM;GACrE,SAAS,UAAU,KAAK,SAAS,OAAO,KAAK,KAAK,MAAM,QAAQ;EAClE,CAAC;EAED,IAAI,IAAI,UAAU,MAAM,UAAU,QAAQ,MAAM;EAEhD,IAAI,WAAW,KAAK,QAAQ,MAAM,QAAQ,MAAM,GAAG,WAAW,KAAK,KAAK;EACxE,WAAW,MAAM,MAAM,QAAQ,KAAK,QAAQ;EAC5C,OAAO,KAAK,aAAa,QAAQ,QAAQ;CAC3C;;;;;;CAOA,aAAa,QAAgB,UAA0B;EAErD,WAAW,SAAS,QAAQ,UAAU,MAAM;EAE5C,WAAW,SAAS,QAAQ,UAAU,EAAE;EACxC,MAAM,WAAW,OAAO,KAAK,MAAM,CAAC,GAAG,MAAM;EAC7C,OAAO,SAAS,QAAQ,QAAQ,QAAQ;CAC1C;AACF"}
+{"version":3,"file":"renderer-Ksfkfv5X.mjs","names":[],"sources":["../src/markdown/renderer.ts"],"sourcesContent":["import type { RenderCtx } from \"../core/ctx.ts\"\nimport type { Node } from \"../core/node.ts\"\nimport type { Image } from \"../widgets/image.ts\"\nimport type { MdOptions, RenderMarkdown } from \"./types.ts\"\n\nexport type MarkdownOptions = MdOptions & {\n  parent?: Node\n}\n\nexport type MarkdownCtx = RenderCtx & {\n  images?: boolean\n  highlight?: (code: string, lang?: string) => string\n}\n\nexport class MarkdownRenderer {\n  #render?: RenderMarkdown\n  #images = new Map<string, Image>()\n  #parent?: Node\n  #opts: MarkdownOptions\n\n  constructor(opts: MarkdownOptions = {}) {\n    this.#opts = opts\n    this.#parent = opts.parent\n  }\n\n  async render(source: string, ctx: MarkdownCtx): Promise<string> {\n    // oxlint-disable-next-line unicorn/no-await-expression-member\n    this.#render ??= this.#opts.render ?? (await import(\"#md\")).renderMarkdown\n\n    const [{ createCallbacks }, { createImageCallback }] = await Promise.all([\n      import(\"./callbacks.ts\"),\n      import(\"./image.ts\"),\n    ])\n\n    const callbacks = createCallbacks(ctx)\n\n    // Image handling: the callback emits `<img id=N>` markers during\n    // rendering; a post-processing resolver then renders the referenced\n    // images concurrently and splices their rows back in. Keeps the\n    // markdown callback surface synchronous while supporting async\n    // image preparation.\n    const image = createImageCallback({\n      add: (child) => this.#parent?.add(child),\n      images: this.#images,\n      queries: ctx.images === false ? undefined : this.#parent?.ctx?.input.queries,\n      remove: (child) => this.#parent?.remove(child) ?? child.unmount(),\n    })\n\n    if (ctx.images ?? true) callbacks.image = image.cb\n\n    let rendered = this.#render(image.prepare(source), callbacks, this.#opts)\n    rendered = await image.resolve(ctx, rendered)\n    return this.normalizeEol(source, rendered)\n  }\n\n  /** Mirror the source's trailing newlines: the renderer adds its own\n  /* padding after blocks (`\\n\\n` after paragraphs, etc.) which would\n  /* leave stray blank rows. Normalizing to what the caller typed keeps\n  /* single-line inputs compact and preserves explicit spacing when\n  /* they asked for it. */\n  normalizeEol(source: string, rendered: string): string {\n    // Collapse multiple blank lines to a maximum of one\n    rendered = rendered.replace(/\\n\\n+/g, \"\\n\\n\")\n    // Trim leading blank lines\n    rendered = rendered.replace(/^\\s*\\n/, \"\")\n    const trailing = /\\n*$/.exec(source)?.[0] ?? \"\"\n    return rendered.replace(/\\n+$/, trailing)\n  }\n}\n"],"mappings":";AAcA,IAAa,mBAAb,MAA8B;CAC5B;CACA,0BAAU,IAAI,IAAmB;CACjC;CACA;CAEA,YAAY,OAAwB,CAAC,GAAG;EACtC,KAAK,QAAQ;EACb,KAAK,UAAU,KAAK;CACtB;CAEA,MAAM,OAAO,QAAgB,KAAmC;EAE9D,KAAK,YAAY,KAAK,MAAM,WAAW,MAAM,OAAO,OAAA,CAAQ;EAE5D,MAAM,CAAC,EAAE,mBAAmB,EAAE,yBAAyB,MAAM,QAAQ,IAAI,CACvE,OAAO,6BACP,OAAO,uBACT,CAAC;EAED,MAAM,YAAY,gBAAgB,GAAG;EAOrC,MAAM,QAAQ,oBAAoB;GAChC,MAAM,UAAU,KAAK,SAAS,IAAI,KAAK;GACvC,QAAQ,KAAK;GACb,SAAS,IAAI,WAAW,QAAQ,KAAA,IAAY,KAAK,SAAS,KAAK,MAAM;GACrE,SAAS,UAAU,KAAK,SAAS,OAAO,KAAK,KAAK,MAAM,QAAQ;EAClE,CAAC;EAED,IAAI,IAAI,UAAU,MAAM,UAAU,QAAQ,MAAM;EAEhD,IAAI,WAAW,KAAK,QAAQ,MAAM,QAAQ,MAAM,GAAG,WAAW,KAAK,KAAK;EACxE,WAAW,MAAM,MAAM,QAAQ,KAAK,QAAQ;EAC5C,OAAO,KAAK,aAAa,QAAQ,QAAQ;CAC3C;;;;;;CAOA,aAAa,QAAgB,UAA0B;EAErD,WAAW,SAAS,QAAQ,UAAU,MAAM;EAE5C,WAAW,SAAS,QAAQ,UAAU,EAAE;EACxC,MAAM,WAAW,OAAO,KAAK,MAAM,CAAC,GAAG,MAAM;EAC7C,OAAO,SAAS,QAAQ,QAAQ,QAAQ;CAC1C;AACF"}

package/dist/{renderer-B9sAMA10.mjs → renderer-OplFCBMq.mjs}

@@ -3,10 +3,10 @@ import { i as systemTheme, t as defaultTheme } from "./registry-CQU0VwpM.mjs";
 import { c as stripAnsiBg, i as applyDefaultColors, t as RESET } from "./ansi-CxgRPLA2.mjs";
 import { t as openStyle } from "./style-Cw_EuszU.mjs";
 import { t as styleBuilder } from "./builder-BdYlK1Ew.mjs";
-import { n as box } from "./box-DToDoXlU.mjs";
+import { n as box } from "./box-DbIjxh39.mjs";
 import { t as createCtx } from "./ctx-DBeFcZt6.mjs";
 import { t as RenderContext } from "./render-Bp2N2i6J.mjs";
-import { t as TuiReporter } from "./logger-DwfXp8LF.mjs";
+import { t as TuiReporter } from "./logger-C0WuIlAh.mjs";
 import { o as bumpPlacements } from "./kitty-BH_eK6lz.mjs";
 import { a as canonical, t as TerminalQueries } from "./queries-BIniKnLL.mjs";
 import { Emitter } from "@zaly/shared";
@@ -2776,4 +2776,4 @@ var Renderer = class extends Emitter {
 };
 export { Renderer };
 
-//# sourceMappingURL=renderer-B9sAMA10.mjs.map
+//# sourceMappingURL=renderer-OplFCBMq.mjs.map