@zaly/tui 0.0.4 → 0.0.6

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

@@ -1 +1 @@
-{"version":3,"file":"picker-ndVVt6qF.mjs","names":["#opts","#bonusMatrix","#bonusBoundaryWhite","#bonusBoundaryDelimiter","#computeBonus","#score","#str","#consecutive","#prevClass","#prev","#firstBonus","#prepare","#match","#fuzzyPositions","#regex","#fuzzy","#fuzzyFind","#opts","#sorter","#matcher","#search","#ac"],"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    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,iBAAiB;AACzC,MAAM,oBAAoB;AAC1B,MAAM,8BAA8B;AACpC,MAAM,oBAAoB,iBAAiB;AAE3C,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,KAAKA,QAAQ;EACb,KAAKE,sBAAsB,KAAK,eAAe,iBAAiB;EAChE,KAAKC,0BAA0B,KAAK,eAAe,iBAAiB;EACpE,KAAK,IAAI,OAAO,GAAG,QAAQ,GAAG,QAAQ;GACpC,KAAKF,aAAa,QAAQ,CAAC;GAC3B,KAAK,IAAI,OAAO,GAAG,QAAQ,GAAG,QAC5B,KAAKA,aAAa,KAAK,CAAC,QAAQ,KAAKG,cAAc,MAAM,IAAI;EAEjE;CACF;CAEA,IAAI,QAAgB;EAClB,OAAO,KAAKC;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,KAAKC,OAAO;EACZ,KAAKD,SAAS;EACd,KAAKE,eAAe;EACpB,KAAKC,aAAa,QAAQ,IAAI,UAAU,KAAK,QAAQ,CAAC,IAAI;EAC1D,KAAKC,QAAQ,KAAA;EACb,KAAKC,cAAc;EAEnB,IAAI,KAAK,UAAU,KAAKV,MAAM,iBAAiB,CAAC,gBAAgB,KAAK,KAAK,GACxE,KAAKK,UAAU;EAEjB,KAAK,OAAO,KAAK;CACnB;CAEA,OAAO,KAAmB;EACxB,MAAM,MAAM,UAAU,KAAKC,MAAM,GAAG;EACpC,MAAM,MAAM,KAAKG,UAAU,KAAA,IAAY,IAAI,MAAM,KAAKA,QAAQ;EAC9D,IAAI,QAAQ;EAEZ,IAAI,MAAM,GAAG;GACX,KAAKD,aAAa,UAAU,KAAKF,MAAM,MAAM,CAAC;GAC9C,QAAQ,KAAKL,aAAa,KAAKO,WAAW,GAAG,QAAQ;GACrD,KAAKH,UAAU,mBAAmB,MAAM,KAAK;GAC7C,KAAKE,eAAe;GACpB,KAAKG,cAAc;EACrB,OAAO;GACL,QAAQ,KAAKT,aAAa,KAAKO,WAAW,GAAG,QAAQ;GACrD,IAAI,KAAKD,iBAAiB,GACxB,KAAKG,cAAc;QACd;IACL,IAAI,SAAS,kBAAkB,QAAQ,KAAKA,aAAa,KAAKA,cAAc;IAC5E,QAAQ,KAAK,IAAI,OAAO,KAAKA,aAAa,iBAAiB;GAC7D;GACA,KAAKH;EACP;EAEA,IAAI,KAAKE,UAAU,KAAA,GAAW,SAAS;EACvC,KAAKJ,UAAU,cAAc;EAC7B,KAAKG,aAAa;EAClB,KAAKC,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,KAAKJ;CACd;CAEA,cAAc,MAAc,MAAsB;EAChD,IAAI,OAAO,cAAc;GACvB,IAAI,SAAS,YAAY,OAAO,KAAKH;GACrC,IAAI,SAAS,gBAAgB,OAAO,KAAKC;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,KAAKQ,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,KAAKA,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,KAAKC,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,KAAKA,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,KAAKA,OAAO,MAAM,GAAG;GACnC,IAAI,CAAC,OAAO;GACZ,IAAI,IAAI,OAAO,IAAI,KAAK,GAAG,KAAKC,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,KAAKC,OAAO,UAAU,GAAG;EAC/C,IAAI,IAAI,OAAO,OAAO,KAAKC,OAAO,KAAK,UAAU,IAAI,KAAK;EAE1D,IAAI,OAAO;EACX,IAAI,KAAK;EACT,IAAI,IAAI;OACF,IAAI,WAAW,IAAI,OAAO,GAAG;IAC/B,OAAO;IACP,KAAK,IAAI,QAAQ,SAAS;GAC5B;SACK,IAAI,IAAI;OACT,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,KAAKC,WAAW,KAAK,UAAU,OAAO;EACjD,IAAI,CAAC,MAAM,OAAO,KAAA;EAClB,KACE,IAAI,OAAO,KAAKA,WAAW,KAAK,UAAU,SAAS,KAAK,OAAO,CAAC,GAChE,MACA,OAAO,KAAKA,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,KAAKC,QAAQ;EACb,MAAM,WAAW,KAAK,SAAS,OAAO,KAAA,IAAY,KAAK;EACvD,KAAKC,UAAU,aAAa,QAAQ,KAAA,IAAY,OAAO,QAAQ;EAC/D,KAAKC,WAAW,IAAI,QAAQ,IAAI;CAClC;;;;CAKA,YAAY,MAAyC;EACnD,MAAM,IAAI,KAAKA;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,KAAKC,QAAQ,OAAO,OAAO,IAAI;EAC9C,SAAS,OAAO;GACd,IAAI,UAAU,SAAS,OAAO,CAAC;GAC/B,MAAM;EACR;CACF;CAEA,IAAI,QAAgB;EAClB,OAAO,KAAKH,MAAM,UAAU,KAAKC,UAAU,eAAe;CAC5D;CAEA,MAAME,QACJ,OACA,QAAQ,IACR,OAAkE,CAAC,GACzC;EAC1B,KAAKC,KAAK,MAAM,OAAO;EACvB,MAAM,KAAM,KAAKA,MAAM,IAAI,gBAAgB;EAE3C,MAAM,IAAI,KAAKF;EACf,EAAE,KAAK,KAAK;EACZ,MAAM,IAAI,KAAKF,MAAM,WAAW;EAChC,MAAM,IAAI,KAAKC;EACf,MAAM,QAAQ,KAAK;EACnB,MAAM,MAAuB,CAAC;EAC9B,IAAI,SAAS,SAAY,KAAKC,SAAS,OAAO,IAAI;EAClD,MAAM,OACJ,MAAM,KAAKF,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,KAAKA,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,KAAKA,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,KAAKE,SAAS,UAAU,CAAC;CAClC;AACF;;;AC9HA,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-cH-rc7-X.mjs","names":["#opts","#bonusMatrix","#bonusBoundaryWhite","#bonusBoundaryDelimiter","#computeBonus","#score","#str","#consecutive","#prevClass","#prev","#firstBonus","#prepare","#match","#fuzzyPositions","#regex","#fuzzy","#fuzzyFind","#opts","#sorter","#matcher","#search","#ac"],"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    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,iBAAiB;AACzC,MAAM,oBAAoB;AAC1B,MAAM,8BAA8B;AACpC,MAAM,oBAAoB,iBAAiB;AAE3C,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,KAAKA,QAAQ;EACb,KAAKE,sBAAsB,KAAK,eAAe,iBAAiB;EAChE,KAAKC,0BAA0B,KAAK,eAAe,iBAAiB;EACpE,KAAK,IAAI,OAAO,GAAG,QAAQ,GAAG,QAAQ;GACpC,KAAKF,aAAa,QAAQ,CAAC;GAC3B,KAAK,IAAI,OAAO,GAAG,QAAQ,GAAG,QAC5B,KAAKA,aAAa,KAAK,CAAC,QAAQ,KAAKG,cAAc,MAAM,IAAI;EAEjE;CACF;CAEA,IAAI,QAAgB;EAClB,OAAO,KAAKC;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,KAAKC,OAAO;EACZ,KAAKD,SAAS;EACd,KAAKE,eAAe;EACpB,KAAKC,aAAa,QAAQ,IAAI,UAAU,KAAK,QAAQ,CAAC,IAAI;EAC1D,KAAKC,QAAQ,KAAA;EACb,KAAKC,cAAc;EAEnB,IAAI,KAAK,UAAU,KAAKV,MAAM,iBAAiB,CAAC,gBAAgB,KAAK,KAAK,GACxE,KAAKK,UAAU;EAEjB,KAAK,OAAO,KAAK;CACnB;CAEA,OAAO,KAAmB;EACxB,MAAM,MAAM,UAAU,KAAKC,MAAM,GAAG;EACpC,MAAM,MAAM,KAAKG,UAAU,KAAA,IAAY,IAAI,MAAM,KAAKA,QAAQ;EAC9D,IAAI,QAAQ;EAEZ,IAAI,MAAM,GAAG;GACX,KAAKD,aAAa,UAAU,KAAKF,MAAM,MAAM,CAAC;GAC9C,QAAQ,KAAKL,aAAa,KAAKO,WAAW,GAAG,QAAQ;GACrD,KAAKH,UAAU,mBAAmB,MAAM,KAAK;GAC7C,KAAKE,eAAe;GACpB,KAAKG,cAAc;EACrB,OAAO;GACL,QAAQ,KAAKT,aAAa,KAAKO,WAAW,GAAG,QAAQ;GACrD,IAAI,KAAKD,iBAAiB,GACxB,KAAKG,cAAc;QACd;IACL,IAAI,SAAS,kBAAkB,QAAQ,KAAKA,aAAa,KAAKA,cAAc;IAC5E,QAAQ,KAAK,IAAI,OAAO,KAAKA,aAAa,iBAAiB;GAC7D;GACA,KAAKH;EACP;EAEA,IAAI,KAAKE,UAAU,KAAA,GAAW,SAAS;EACvC,KAAKJ,UAAU,cAAc;EAC7B,KAAKG,aAAa;EAClB,KAAKC,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,KAAKJ;CACd;CAEA,cAAc,MAAc,MAAsB;EAChD,IAAI,OAAO,cAAc;GACvB,IAAI,SAAS,YAAY,OAAO,KAAKH;GACrC,IAAI,SAAS,gBAAgB,OAAO,KAAKC;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,KAAKQ,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,KAAKA,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,KAAKC,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,KAAKA,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,KAAKA,OAAO,MAAM,GAAG;GACnC,IAAI,CAAC,OAAO;GACZ,IAAI,IAAI,OAAO,IAAI,KAAK,GAAG,KAAKC,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,KAAKC,OAAO,UAAU,GAAG;EAC/C,IAAI,IAAI,OAAO,OAAO,KAAKC,OAAO,KAAK,UAAU,IAAI,KAAK;EAE1D,IAAI,OAAO;EACX,IAAI,KAAK;EACT,IAAI,IAAI;OACF,IAAI,WAAW,IAAI,OAAO,GAAG;IAC/B,OAAO;IACP,KAAK,IAAI,QAAQ,SAAS;GAC5B;SACK,IAAI,IAAI;OACT,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,KAAKC,WAAW,KAAK,UAAU,OAAO;EACjD,IAAI,CAAC,MAAM,OAAO,KAAA;EAClB,KACE,IAAI,OAAO,KAAKA,WAAW,KAAK,UAAU,SAAS,KAAK,OAAO,CAAC,GAChE,MACA,OAAO,KAAKA,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,KAAKC,QAAQ;EACb,MAAM,WAAW,KAAK,SAAS,OAAO,KAAA,IAAY,KAAK;EACvD,KAAKC,UAAU,aAAa,QAAQ,KAAA,IAAY,OAAO,QAAQ;EAC/D,KAAKC,WAAW,IAAI,QAAQ,IAAI;CAClC;;;;CAKA,YAAY,MAAyC;EACnD,MAAM,IAAI,KAAKA;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,KAAKC,QAAQ,OAAO,OAAO,IAAI;EAC9C,SAAS,OAAO;GACd,IAAI,UAAU,SAAS,OAAO,CAAC;GAC/B,MAAM;EACR;CACF;CAEA,IAAI,QAAgB;EAClB,OAAO,KAAKH,MAAM,UAAU,KAAKC,UAAU,eAAe;CAC5D;CAEA,MAAME,QACJ,OACA,QAAQ,IACR,OAAkE,CAAC,GACzC;EAC1B,KAAKC,KAAK,MAAM,OAAO;EACvB,MAAM,KAAM,KAAKA,MAAM,IAAI,gBAAgB;EAE3C,MAAM,IAAI,KAAKF;EACf,EAAE,KAAK,KAAK;EACZ,MAAM,IAAI,KAAKF,MAAM,WAAW;EAChC,MAAM,IAAI,KAAKC;EACf,MAAM,QAAQ,KAAK;EACnB,MAAM,MAAuB,CAAC;EAC9B,IAAI,SAAS,SAAY,KAAKC,SAAS,OAAO,IAAI;EAClD,MAAM,OACJ,MAAM,KAAKF,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,KAAKA,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,KAAKA,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,KAAKE,SAAS,UAAU,CAAC;CAClC;AACF;;;AC9HA,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/queries-B_lOwEiE.mjs

@@ -0,0 +1,200 @@
+//#region src/input/keys.ts
+const MOD_NAMES = /* @__PURE__ */ new Set([
+	"ctrl",
+	"alt",
+	"shift",
+	"meta"
+]);
+const SPECIAL_KEY_NAMES = /* @__PURE__ */ new Set([
+	"enter",
+	"tab",
+	"backspace",
+	"delete",
+	"space",
+	"esc",
+	"up",
+	"down",
+	"left",
+	"right",
+	"home",
+	"end",
+	"pageup",
+	"pagedown",
+	"insert",
+	"f1",
+	"f2",
+	"f3",
+	"f4",
+	"f5",
+	"f6",
+	"f7",
+	"f8",
+	"f9",
+	"f10",
+	"f11",
+	"f12"
+]);
+var KeyPatternError = class extends Error {
+	constructor(pattern, reason) {
+		super(`invalid key pattern ${JSON.stringify(pattern)}: ${reason}`);
+		this.name = "KeyPatternError";
+	}
+};
+function parsePattern(pattern) {
+	const mods = {
+		alt: false,
+		ctrl: false,
+		meta: false,
+		shift: false
+	};
+	let name = pattern;
+	while (name.length > 0) {
+		const dash = name.indexOf("-");
+		if (dash <= 0) break;
+		const mod = name.slice(0, dash);
+		if (!MOD_NAMES.has(mod)) throw new KeyPatternError(pattern, `unknown modifier: ${mod}`);
+		if (mods[mod]) throw new KeyPatternError(pattern, `duplicate modifier: ${mod}`);
+		mods[mod] = true;
+		name = name.slice(dash + 1);
+	}
+	const ret = normalizeKey({
+		...mods,
+		name
+	});
+	name = ret.name;
+	if (name === "") throw new KeyPatternError(pattern, "missing key name");
+	if (name.includes("-") && name !== "-") throw new KeyPatternError(pattern, "too many keys");
+	if (!isPrintableKeyName(name)) throw new KeyPatternError(pattern, `unknown key name: ${name}`);
+	if (mods.shift && !canUseShiftModifier(name)) throw new KeyPatternError(pattern, `shift-${name} will not trigger; bind the shifted character instead`);
+	return ret;
+}
+function normalizeKey(p) {
+	if (/^[A-Z]$/.test(p.name)) return {
+		...p,
+		name: p.name.toLowerCase(),
+		shift: true
+	};
+	if (p.name === " ") return {
+		...p,
+		name: "space"
+	};
+	return p;
+}
+function isPrintableKeyName(s) {
+	return SPECIAL_KEY_NAMES.has(s) || [...s].length === 1 && !/[\p{C}]/u.test(s);
+}
+function canUseShiftModifier(name) {
+	return /^[a-zA-Z]$/.test(name) || SPECIAL_KEY_NAMES.has(name);
+}
+function isKeyPattern(s) {
+	try {
+		canonical(s);
+		return true;
+	} catch {
+		return false;
+	}
+}
+/**
+* Canonical string form of a pattern or event — modifiers in a fixed
+* alphabetical order, then the key name, joined by `-`. Used by the
+* router to build a pattern index whose keys match regardless of how
+* the user spelled the modifier order (`"ctrl-shift-a"` and
+* `"shift-ctrl-a"` both canonicalize to `"ctrl-shift-a"`).
+*/
+function canonical(patternOrEvent) {
+	const p = typeof patternOrEvent === "string" ? parsePattern(patternOrEvent) : normalizeKey(patternOrEvent);
+	const parts = [];
+	if (p.alt) parts.push("alt");
+	if (p.ctrl) parts.push("ctrl");
+	if (p.meta) parts.push("meta");
+	if (p.shift) parts.push("shift");
+	parts.push(p.name);
+	return parts.join("-");
+}
+/**
+* Test whether an event matches a pattern (or any of a list of patterns).
+* Unspecified modifiers in the pattern must be *absent* on the event —
+* matching is strict, not inclusive, so `"a"` only matches a bare `a`
+* (no ctrl/alt/etc.).
+*/
+function keyMatches(ev, pattern) {
+	if (Array.isArray(pattern)) {
+		for (const p of pattern) if (keyMatches(ev, p)) return true;
+		return false;
+	}
+	const p = parsePattern(pattern);
+	const e = normalizeKey(ev);
+	return e.name === p.name && e.ctrl === p.ctrl && e.alt === p.alt && e.shift === p.shift && e.meta === p.meta;
+}
+//#endregion
+//#region src/input/queries.ts
+var TerminalQueries = class {
+	#router;
+	#terminal;
+	constructor(router, terminal) {
+		this.#router = router;
+		this.#terminal = terminal;
+	}
+	query(query) {
+		const timeout = query.timeout ?? 200;
+		const ac = new AbortController();
+		return new Promise((resolve) => {
+			const finish = (value) => {
+				if (ac.signal.aborted) return;
+				ac.abort();
+				clearTimeout(timer);
+				resolve(value);
+			};
+			const timer = setTimeout(() => finish(), timeout);
+			timer.unref();
+			this.#router.on("term-response", ({ event }) => {
+				const value = query.match(event);
+				if (value !== void 0) finish(value);
+			}, { signal: ac.signal });
+			this.#terminal.write(query.wrap?.(query.request) ?? query.request);
+		});
+	}
+	primaryDeviceAttributes(opts = {}) {
+		return this.query({
+			match: (ev) => ev.kind === "csi" && ev.final === "c" && ev.params.startsWith("?") ? {
+				...ev,
+				attrs: parseAttrs(ev.params)
+			} : void 0,
+			request: "\x1B[c",
+			...opts
+		});
+	}
+	secondaryDeviceAttributes(opts = {}) {
+		return this.query({
+			match: (ev) => ev.kind === "csi" && ev.final === "c" && ev.params.startsWith(">") ? {
+				...ev,
+				attrs: parseAttrs(ev.params)
+			} : void 0,
+			request: "\x1B[>c",
+			...opts
+		});
+	}
+	xtVersion(opts = {}) {
+		return this.query({
+			match: (ev) => {
+				if (ev.kind !== "dcs" || !ev.payload.startsWith(">|")) return;
+				const payload = ev.payload.slice(2);
+				const m = payload.match(/^([^\s]+)\(([^\s]+)\)$/) ?? payload.match(/^([^\s]+)\s+([^\s]+)$/);
+				return {
+					...ev,
+					name: m?.[1] ?? payload,
+					version: m?.[2]
+				};
+			},
+			request: "\x1B[>q",
+			...opts
+		});
+	}
+};
+function parseAttrs(params) {
+	return params.slice(1).split(";").map((n) => Number.parseInt(n, 10)).filter(Number.isFinite);
+}
+//#endregion
+export { isKeyPattern as a, canonical as i, parseAttrs as n, keyMatches as o, KeyPatternError as r, TerminalQueries as t };
+
+//# sourceMappingURL=queries-B_lOwEiE.mjs.map

package/dist/queries-B_lOwEiE.mjs.map

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

package/dist/{registry-U654j61Y.mjs → registry-w_w7gZr_.mjs}

@@ -126,9 +126,7 @@ var tokyonight_moon_default = {
 };
 //#endregion
 //#region src/themes/builtin.ts
-function importTheme(path) {
-	return import(new URL(`../../assets/themes/${path}.json`, import.meta.url).href, { with: { type: "json" } }).then((m) => m.default);
-}
+const importTheme = (path) => import(`#assets/themes/${path}.json`, { with: { type: "json" } }).then((m) => m.default);
 /**
 * Async loader map for every built-in theme. Each entry returns the
 * raw JSON; `themes/index.ts` wraps these with `resolveTheme` to
@@ -345,7 +343,7 @@ function resolveTheme(theme, id) {
 async function loadThemeFile(path) {
 	const raw = withError(() => readFileSync(path, "utf8"), `Failed to read theme file at ${path}`);
 	const data = withError(() => JSON.parse(raw), `Failed to parse theme JSON at ${path}`);
-	const { validateTheme } = await import("./theme.config-CU3B50HN.mjs");
+	const { validateTheme } = await import("./theme.config-BptYUq4K.mjs");
 	return resolveTheme(validateTheme(data), basename(path, ".json"));
 }
 /** TokyoNight Moon — the default. Sourced from `assets/themes/tokyonight-moon.json`. */
@@ -353,4 +351,4 @@ const defaultTheme = resolveTheme(tokyonight_moon_default, "tokyonight-moon");
 //#endregion
 export { loadTheme as n, themeRegistry as r, defaultTheme as t };
 
-//# sourceMappingURL=registry-U654j61Y.mjs.map
+//# sourceMappingURL=registry-w_w7gZr_.mjs.map

package/dist/registry-w_w7gZr_.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"registry-w_w7gZr_.mjs","names":["moonJson"],"sources":["../assets/themes/tokyonight-moon.json","../src/themes/builtin.ts","../src/themes/default.ts","../src/themes/registry.ts"],"sourcesContent":["","// AUTO-GENERATED by `scripts/gen-themes.ts`. DO NOT EDIT.\n// Re-run `bun scripts/gen-themes.ts` after adding/renaming a theme.\n\nimport type { ThemeLoader } from \"./registry.ts\"\nimport type { Theme } from \"./types.ts\"\n\nconst importTheme = (path: string): Promise<Partial<Theme>> =>\n  import(`#assets/themes/${path}.json`, { with: { type: \"json\" } }).then(\n    (m) => m.default as Partial<Theme>\n  )\n\n/**\n * Async loader map for every built-in theme. Each entry returns the\n * raw JSON; `themes/index.ts` wraps these with `resolveTheme` to\n * produce a fully-resolved `Theme` from the registry. Bundlers\n * code-split each `import(\"…json\")` into its own chunk, so apps only\n * pull the theme they actually load.\n *\n * `as const satisfies Record<string, ThemeLoader>` keeps the keys\n * narrow (so `BuiltinThemeName` is a literal union) but lets the\n * value type widen to `Partial<Theme>` — themes have no per-key\n * narrow types worth preserving, and the satisfies clause means\n * `themes/index.ts` can pass this map straight to `themeRegistry`\n * with no cast.\n */\nexport const builtin = {\n  \"ayu-dark\": () => importTheme(\"ayu-dark\"),\n  \"catppuccin-frappe\": () => importTheme(\"catppuccin-frappe\"),\n  \"catppuccin-latte\": () => importTheme(\"catppuccin-latte\"),\n  \"catppuccin-macchiato\": () => importTheme(\"catppuccin-macchiato\"),\n  \"catppuccin-mocha\": () => importTheme(\"catppuccin-mocha\"),\n  dracula: () => importTheme(\"dracula\"),\n  \"dracula-soft\": () => importTheme(\"dracula-soft\"),\n  \"everforest-dark\": () => importTheme(\"everforest-dark\"),\n  \"everforest-light\": () => importTheme(\"everforest-light\"),\n  \"github-dark\": () => importTheme(\"github-dark\"),\n  \"github-light\": () => importTheme(\"github-light\"),\n  \"gruvbox-dark-medium\": () => importTheme(\"gruvbox-dark-medium\"),\n  \"kanagawa-dragon\": () => importTheme(\"kanagawa-dragon\"),\n  \"kanagawa-wave\": () => importTheme(\"kanagawa-wave\"),\n  \"material-theme-palenight\": () => importTheme(\"material-theme-palenight\"),\n  \"min-dark\": () => importTheme(\"min-dark\"),\n  \"min-light\": () => importTheme(\"min-light\"),\n  monokai: () => importTheme(\"monokai\"),\n  \"night-owl\": () => importTheme(\"night-owl\"),\n  nord: () => importTheme(\"nord\"),\n  \"one-dark-pro\": () => importTheme(\"one-dark-pro\"),\n  \"one-light\": () => importTheme(\"one-light\"),\n  poimandres: () => importTheme(\"poimandres\"),\n  \"rose-pine\": () => importTheme(\"rose-pine\"),\n  \"solarized-dark\": () => importTheme(\"solarized-dark\"),\n  \"solarized-light\": () => importTheme(\"solarized-light\"),\n  \"synthwave-84\": () => importTheme(\"synthwave-84\"),\n  \"tokyonight-day\": () => importTheme(\"tokyonight-day\"),\n  \"tokyonight-moon\": () => importTheme(\"tokyonight-moon\"),\n  \"tokyonight-night\": () => importTheme(\"tokyonight-night\"),\n  \"tokyonight-storm\": () => importTheme(\"tokyonight-storm\"),\n  vesper: () => importTheme(\"vesper\"),\n  \"vitesse-dark\": () => importTheme(\"vitesse-dark\"),\n  \"vitesse-light\": () => importTheme(\"vitesse-light\"),\n} as const satisfies Record<string, ThemeLoader>\n","// oxlint-disable typescript/no-deprecated\nimport type { Theme } from \"./types.ts\"\n\n/**\n * Slot-level fallbacks. Every Theme value is shallow-merged on top of\n * this record by `resolveTheme`, so partial JSON themes only need to\n * declare slots that diverge from these defaults.\n *\n * Distinct from `defaultTheme` — that's the precomputed `tokyonight-moon`\n * Theme bundled as the default palette for `createCtx()` etc.\n */\n// oxlint-disable-next-line sort-keys\nexport const defaults: Omit<Theme, \"id\"> = {\n  // base colors\n  primary: \"blue\",\n  accent: \"brightMagenta\",\n\n  // text\n  text: \"inherit\",\n  muted: { dim: true },\n  quiet: { dim: true, fg: \"muted\", italic: true },\n  comment: { fg: \"muted\", italic: true },\n  title: { bold: true, fg: \"primary\" },\n  delim: \"muted\",\n\n  // surface & structure\n  subtle: \"brightBlack\",\n  ui: { bg: \"subtle\" },\n  overlay: { bg: \"subtle\" },\n  highlight: { bg: \"subtle\" },\n\n  // ui primitives\n  divider: \"subtle\",\n  selection: { bg: \"brightBlue\", fg: \"black\" },\n  gutter: \"subtle\",\n  prompt: \"inherit\",\n  border: \"black\",\n  borderTitle: \"title\",\n\n  // code\n  code: { bg: \"subtle\" },\n  codeTitle: \"title\",\n\n  // log levels\n  success: \"green\",\n  info: \"cyan\",\n  warn: \"yellow\",\n  error: \"red\",\n\n  // syntax\n  syntaxNumber: \"brightBlue\",\n  syntaxString: \"green\",\n  syntaxBoolean: \"yellow\",\n  syntaxFunction: \"blue\",\n  syntaxField: \"white\",\n  syntaxConstant: \"magenta\",\n  syntaxSpecial: \"red\",\n  syntaxDelimiter: \"delim\",\n  syntaxBracket: \"delim\",\n\n  // markdown\n  mdBold: { bold: true },\n  mdCode: { bg: \"primary+10\", fg: \"black\" },\n  mdCodeBlock: { bg: \"highlight\", fg: \"primary\" },\n  mdCodeBlockTitle: \"title\",\n  mdHeading1: \"mdHeading\",\n  mdHeading2: { bold: true, fg: \"accent\" },\n  mdHeading3: \"mdHeading2\",\n  mdHeading4: \"mdHeading2\",\n  mdHeading5: \"mdHeading2\",\n  mdHeading6: \"mdHeading2\",\n  mdHeading: \"title\",\n  mdHr: \"accent\",\n  mdItalic: { italic: true },\n  mdLink: { fg: \"primary\", underline: true },\n  mdListBullet: \"accent\",\n  mdListChecked: \"primary\",\n  mdListUnchecked: \"primary\",\n  mdQuote: \"muted\",\n  mdStrikethrough: { strikethrough: true },\n  mdTable: \"accent\",\n  mdTableHeader: \"title\",\n\n  // menu\n  optionActive: \"selection\",\n  optionDesc: \"muted\",\n  optionName: \"primary\",\n\n  // diff\n  diffAdd: { bg: \"success-50\", fg: \"success\" },\n  diffContext: \"muted\",\n  diffDel: { bg: \"error-50\", fg: \"error\" },\n  diffLine: \"gutter\",\n  diffTitle: \"title\",\n}\n\n// oxlint-disable-next-line sort-keys\nexport const ansi: Theme = {\n  id: \"ansi\",\n  name: \"ANSI\",\n  ...defaults,\n  subtle: \"inherit\",\n  divider: \"brightBlue\",\n  border: \"brightBlue\",\n  highlight: { bg: \"brightBlack\" },\n  ui: { bg: \"brightBlack\" },\n  selection: { inverse: true },\n  diffAdd: { fg: \"success\" },\n  diffDel: { fg: \"error\" },\n}\n","import type { Theme } from \"./types.ts\"\n\nimport { withError } from \"@zaly/shared\"\nimport { createRegistry } from \"@zaly/shared/registry\"\nimport { readFileSync } from \"node:fs\"\nimport { basename } from \"pathe\"\nimport moonJson from \"../../assets/themes/tokyonight-moon.json\" with { type: \"json\" }\nimport { builtin } from \"./builtin.ts\"\nimport { defaults, ansi } from \"./default.ts\"\n\n/** Built-in theme names plus the synthetic `\"ansi\"` palette (no JSON\n *  — falls back to `defaults` only). */\nexport type BuiltinTheme = keyof typeof builtin | \"ansi\"\nexport type AnyTheme = BuiltinTheme | (string & {})\nexport type ThemeLoader = () => Promise<Partial<Theme>>\n\nconst DEFAULT_THEME: BuiltinTheme = \"tokyonight-moon\"\n\n/**\n * Registry of built-in themes plus any registered at runtime. The\n * registry never awaits — loaders return `Promise<Partial<Theme>>` so\n * callers `await` explicitly.\n */\nexport const themeRegistry = createRegistry<ThemeLoader>(\"theme\").from(builtin)\n// NOTE: remove the ansi theme for now, since it looks kinda broken and not really possible\n// to fix properly\nthemeRegistry.register(\"ansi\", async () => ({ ...ansi }))\n\n/**\n * Load a theme by name or path.\n */\nexport async function loadTheme(name?: string): Promise<Theme>\nexport async function loadTheme(opts: { name?: string; path?: string }): Promise<Theme>\nexport async function loadTheme(o?: string | { name?: string; path?: string }): Promise<Theme> {\n  o ??= DEFAULT_THEME\n  const opts = typeof o === \"string\" ? { name: o } : o\n\n  if (opts.name?.endsWith(\".json\")) return loadTheme({ path: opts.name })\n  if (opts.path) return loadThemeFile(opts.path)\n  if (opts.name) {\n    if (opts.name === DEFAULT_THEME) return defaultTheme\n    if (themeRegistry.has(opts.name))\n      return resolveTheme(await themeRegistry.load(opts.name), opts.name)\n    throw new Error(`Theme \"${opts.name}\" not found.`)\n  }\n\n  return defaultTheme\n}\n\n/**\n * Fill defaults on a raw theme object. Built-in JSON is dev-controlled\n * so we don't pay typia's ~3MB of generated assertions at startup;\n * user-supplied JSON goes through `loadThemeFile` which validates.\n */\nfunction resolveTheme(theme: unknown, id: string): Theme {\n  const { $schema: _, ...rest } = theme as Partial<Theme> & { $schema?: unknown }\n  return { ...defaults, id, name: id, ...rest }\n}\n\n/**\n * Load a theme directly from a file path. No directory search happens —\n * this is the escape hatch for CLIs that accept an explicit `--theme\n * /path/to/theme.json` argument.\n *\n * Async because typia's generated `validateTheme` (a few thousand\n * unrolled assertions) is dynamically imported here — it's only needed\n * for user-supplied JSON and should stay off the main startup path.\n */\nasync function loadThemeFile(path: string): Promise<Theme> {\n  const raw = withError(() => readFileSync(path, \"utf8\"), `Failed to read theme file at ${path}`)\n  const data = withError(() => JSON.parse(raw), `Failed to parse theme JSON at ${path}`)\n  const { validateTheme } = await import(\"../schemas/gen/theme.config.ts\")\n  return resolveTheme(validateTheme(data), basename(path, \".json\"))\n}\n\n/** TokyoNight Moon — the default. Sourced from `assets/themes/tokyonight-moon.json`. */\nexport const defaultTheme = resolveTheme(moonJson, \"tokyonight-moon\")\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACMA,MAAM,eAAe,SACnB,OAAO,kBAAkB,KAAK,QAAQ,EAAE,MAAM,EAAE,MAAM,OAAO,EAAE,EAAE,CAAC,MAC/D,MAAM,EAAE,OACX;;;;;;;;;;;;;;;AAgBF,MAAa,UAAU;CACrB,kBAAkB,YAAY,UAAU;CACxC,2BAA2B,YAAY,mBAAmB;CAC1D,0BAA0B,YAAY,kBAAkB;CACxD,8BAA8B,YAAY,sBAAsB;CAChE,0BAA0B,YAAY,kBAAkB;CACxD,eAAe,YAAY,SAAS;CACpC,sBAAsB,YAAY,cAAc;CAChD,yBAAyB,YAAY,iBAAiB;CACtD,0BAA0B,YAAY,kBAAkB;CACxD,qBAAqB,YAAY,aAAa;CAC9C,sBAAsB,YAAY,cAAc;CAChD,6BAA6B,YAAY,qBAAqB;CAC9D,yBAAyB,YAAY,iBAAiB;CACtD,uBAAuB,YAAY,eAAe;CAClD,kCAAkC,YAAY,0BAA0B;CACxE,kBAAkB,YAAY,UAAU;CACxC,mBAAmB,YAAY,WAAW;CAC1C,eAAe,YAAY,SAAS;CACpC,mBAAmB,YAAY,WAAW;CAC1C,YAAY,YAAY,MAAM;CAC9B,sBAAsB,YAAY,cAAc;CAChD,mBAAmB,YAAY,WAAW;CAC1C,kBAAkB,YAAY,YAAY;CAC1C,mBAAmB,YAAY,WAAW;CAC1C,wBAAwB,YAAY,gBAAgB;CACpD,yBAAyB,YAAY,iBAAiB;CACtD,sBAAsB,YAAY,cAAc;CAChD,wBAAwB,YAAY,gBAAgB;CACpD,yBAAyB,YAAY,iBAAiB;CACtD,0BAA0B,YAAY,kBAAkB;CACxD,0BAA0B,YAAY,kBAAkB;CACxD,cAAc,YAAY,QAAQ;CAClC,sBAAsB,YAAY,cAAc;CAChD,uBAAuB,YAAY,eAAe;AACpD;;;;;;;;;;;AChDA,MAAa,WAA8B;CAEzC,SAAS;CACT,QAAQ;CAGR,MAAM;CACN,OAAO,EAAE,KAAK,KAAK;CACnB,OAAO;EAAE,KAAK;EAAM,IAAI;EAAS,QAAQ;CAAK;CAC9C,SAAS;EAAE,IAAI;EAAS,QAAQ;CAAK;CACrC,OAAO;EAAE,MAAM;EAAM,IAAI;CAAU;CACnC,OAAO;CAGP,QAAQ;CACR,IAAI,EAAE,IAAI,SAAS;CACnB,SAAS,EAAE,IAAI,SAAS;CACxB,WAAW,EAAE,IAAI,SAAS;CAG1B,SAAS;CACT,WAAW;EAAE,IAAI;EAAc,IAAI;CAAQ;CAC3C,QAAQ;CACR,QAAQ;CACR,QAAQ;CACR,aAAa;CAGb,MAAM,EAAE,IAAI,SAAS;CACrB,WAAW;CAGX,SAAS;CACT,MAAM;CACN,MAAM;CACN,OAAO;CAGP,cAAc;CACd,cAAc;CACd,eAAe;CACf,gBAAgB;CAChB,aAAa;CACb,gBAAgB;CAChB,eAAe;CACf,iBAAiB;CACjB,eAAe;CAGf,QAAQ,EAAE,MAAM,KAAK;CACrB,QAAQ;EAAE,IAAI;EAAc,IAAI;CAAQ;CACxC,aAAa;EAAE,IAAI;EAAa,IAAI;CAAU;CAC9C,kBAAkB;CAClB,YAAY;CACZ,YAAY;EAAE,MAAM;EAAM,IAAI;CAAS;CACvC,YAAY;CACZ,YAAY;CACZ,YAAY;CACZ,YAAY;CACZ,WAAW;CACX,MAAM;CACN,UAAU,EAAE,QAAQ,KAAK;CACzB,QAAQ;EAAE,IAAI;EAAW,WAAW;CAAK;CACzC,cAAc;CACd,eAAe;CACf,iBAAiB;CACjB,SAAS;CACT,iBAAiB,EAAE,eAAe,KAAK;CACvC,SAAS;CACT,eAAe;CAGf,cAAc;CACd,YAAY;CACZ,YAAY;CAGZ,SAAS;EAAE,IAAI;EAAc,IAAI;CAAU;CAC3C,aAAa;CACb,SAAS;EAAE,IAAI;EAAY,IAAI;CAAQ;CACvC,UAAU;CACV,WAAW;AACb;AAGA,MAAa,OAAc;CACzB,IAAI;CACJ,MAAM;CACN,GAAG;CACH,QAAQ;CACR,SAAS;CACT,QAAQ;CACR,WAAW,EAAE,IAAI,cAAc;CAC/B,IAAI,EAAE,IAAI,cAAc;CACxB,WAAW,EAAE,SAAS,KAAK;CAC3B,SAAS,EAAE,IAAI,UAAU;CACzB,SAAS,EAAE,IAAI,QAAQ;AACzB;;;AC7FA,MAAM,gBAA8B;;;;;;AAOpC,MAAa,gBAAgB,eAA4B,OAAO,CAAC,CAAC,KAAK,OAAO;AAG9E,cAAc,SAAS,QAAQ,aAAa,EAAE,GAAG,KAAK,EAAE;AAOxD,eAAsB,UAAU,GAA+D;CAC7F,MAAM;CACN,MAAM,OAAO,OAAO,MAAM,WAAW,EAAE,MAAM,EAAE,IAAI;CAEnD,IAAI,KAAK,MAAM,SAAS,OAAO,GAAG,OAAO,UAAU,EAAE,MAAM,KAAK,KAAK,CAAC;CACtE,IAAI,KAAK,MAAM,OAAO,cAAc,KAAK,IAAI;CAC7C,IAAI,KAAK,MAAM;EACb,IAAI,KAAK,SAAS,eAAe,OAAO;EACxC,IAAI,cAAc,IAAI,KAAK,IAAI,GAC7B,OAAO,aAAa,MAAM,cAAc,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI;EACpE,MAAM,IAAI,MAAM,UAAU,KAAK,KAAK,aAAa;CACnD;CAEA,OAAO;AACT;;;;;;AAOA,SAAS,aAAa,OAAgB,IAAmB;CACvD,MAAM,EAAE,SAAS,GAAG,GAAG,SAAS;CAChC,OAAO;EAAE,GAAG;EAAU;EAAI,MAAM;EAAI,GAAG;CAAK;AAC9C;;;;;;;;;;AAWA,eAAe,cAAc,MAA8B;CACzD,MAAM,MAAM,gBAAgB,aAAa,MAAM,MAAM,GAAG,gCAAgC,MAAM;CAC9F,MAAM,OAAO,gBAAgB,KAAK,MAAM,GAAG,GAAG,iCAAiC,MAAM;CACrF,MAAM,EAAE,kBAAkB,MAAM,OAAO;CACvC,OAAO,aAAa,cAAc,IAAI,GAAG,SAAS,MAAM,OAAO,CAAC;AAClE;;AAGA,MAAa,eAAe,aAAaA,yBAAU,iBAAiB"}

package/dist/render-F8pVXN7h.mjs

@@ -0,0 +1,33 @@
+import { d as createSuspenseBoundary, i as createContext, l as createRoot, n as SuspenseContext, v as provideContext } from "./reactive-f7NpAi69.mjs";
+import { t as createCtx } from "./ctx-DjJ1zSbs.mjs";
+//#region src/core/render.ts
+const RenderContext = createContext();
+async function createRender(node, ctx = createCtx()) {
+	if (ctx.boundary) return renderWithDrain(node, ctx.boundary, ctx);
+	const boundary = createSuspenseBoundary();
+	const nodeFn = node;
+	return createRoot(async () => {
+		provideContext(SuspenseContext, boundary);
+		return renderWithDrain(nodeFn(), boundary, ctx);
+	});
+}
+/** Wait for any pending work first, then render. On warm caches the
+*  initial `whenIdle` resolves on the same microtask tick — no real
+*  wait — and we render exactly once with final values. On cold the
+*  wait blocks until `createAsync` settles. The follow-up `while`
+*  catches the in-render case: a `_render` that fires a fresh
+*  `createAsync` (signal write subscribes a new effect) bumps the
+*  boundary back above zero, requiring another pass. */
+async function renderWithDrain(node, boundary, ctx) {
+	if (boundary.active()) await boundary.whenIdle();
+	let rows = await node.render(ctx);
+	while (boundary.active()) {
+		await boundary.whenIdle();
+		rows = await node.render(ctx);
+	}
+	return rows;
+}
+//#endregion
+export { createRender as n, RenderContext as t };
+
+//# sourceMappingURL=render-F8pVXN7h.mjs.map

package/dist/render-F8pVXN7h.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"render-F8pVXN7h.mjs","names":[],"sources":["../src/core/render.ts"],"sourcesContent":["import type { TerminalQueries } from \"../input/queries.ts\"\nimport type { StyleBuilder } from \"../style/builder.ts\"\nimport type { Theme } from \"../themes/types.ts\"\nimport type { RenderCtx } from \"./ctx.ts\"\n// oxlint-disable no-await-in-loop\nimport type { Node } from \"./node.ts\"\nimport type { Accessor, SuspenseBoundary } from \"./reactive.ts\"\n\nimport { createCtx } from \"./ctx.ts\"\nimport {\n  createContext,\n  createRoot,\n  createSuspenseBoundary,\n  provideContext,\n  SuspenseContext,\n} from \"./reactive.ts\"\n\n/** Components-facing slice of the render environment — reactive\n *  accessors a widget body reads via `useContext(RenderContext)`. Use\n *  this when a widget needs ambient theme/style outside an `_render`\n *  call (the place where `RenderCtx` is threaded in). Width is\n *  deliberately omitted — that's a per-render allotted-size concept,\n *  not an ambient one. */\nexport type RenderContextValue = {\n  /** Active theme. Tracked — widgets that read it re-fire on swap. */\n  theme: Accessor<Theme>\n  /** Theme-bound chainable style builder. Derived memo over `theme`. */\n  style: Accessor<StyleBuilder>\n  /** Whether to render images (when supported) */\n  images: Accessor<boolean>\n  queries: TerminalQueries\n}\nexport const RenderContext = createContext<RenderContextValue>()\n\n/**\n * Render a Node, draining `createAsync` work in its subtree before\n * returning final rows. Two shapes:\n *\n *   - `createRender(() => node, ctx?)` — factory form. Creates a fresh\n *     `SuspenseBoundary` inside a new `createRoot` and runs the\n *     factory in that scope so descendants find the boundary via\n *     `useContext(SuspenseContext)`. For tests, benches, REPL.\n *\n *   - `createRender(node, { ...ctx, boundary })` — pre-built Node\n *     with a caller-provided boundary. Used by `Stream.render`: the\n *     boundary was installed at `append` time, so we just render +\n *     drain without a new root scope.\n *\n * `ctx` defaults to `createCtx()` in the factory form.\n *\n * ```ts\n * const rows = await createRender(() => markdown(\"**hi**\"))\n * ```\n */\nexport async function createRender(\n  node: Node,\n  ctx: RenderCtx & { boundary: SuspenseBoundary }\n): Promise<string[]>\nexport async function createRender(node: () => Node, ctx?: RenderCtx): Promise<string[]>\nexport async function createRender(\n  node: Node | (() => Node),\n  ctx: RenderCtx & { boundary?: SuspenseBoundary } = createCtx()\n): Promise<string[]> {\n  if (ctx.boundary) return renderWithDrain(node as Node, ctx.boundary, ctx)\n  const boundary = createSuspenseBoundary()\n  const nodeFn = node as () => Node\n  return createRoot(async () => {\n    provideContext(SuspenseContext, boundary)\n    return renderWithDrain(nodeFn(), boundary, ctx)\n  })\n}\n\n/** Wait for any pending work first, then render. On warm caches the\n *  initial `whenIdle` resolves on the same microtask tick — no real\n *  wait — and we render exactly once with final values. On cold the\n *  wait blocks until `createAsync` settles. The follow-up `while`\n *  catches the in-render case: a `_render` that fires a fresh\n *  `createAsync` (signal write subscribes a new effect) bumps the\n *  boundary back above zero, requiring another pass. */\nasync function renderWithDrain(\n  node: Node,\n  boundary: SuspenseBoundary,\n  ctx: RenderCtx\n): Promise<string[]> {\n  if (boundary.active()) await boundary.whenIdle()\n  let rows = await node.render(ctx)\n  while (boundary.active()) {\n    await boundary.whenIdle()\n    rows = await node.render(ctx)\n  }\n  return rows\n}\n"],"mappings":";;;AAgCA,MAAa,gBAAgB,cAAkC;AA2B/D,eAAsB,aACpB,MACA,MAAmD,UAAU,GAC1C;CACnB,IAAI,IAAI,UAAU,OAAO,gBAAgB,MAAc,IAAI,UAAU,GAAG;CACxE,MAAM,WAAW,uBAAuB;CACxC,MAAM,SAAS;CACf,OAAO,WAAW,YAAY;EAC5B,eAAe,iBAAiB,QAAQ;EACxC,OAAO,gBAAgB,OAAO,GAAG,UAAU,GAAG;CAChD,CAAC;AACH;;;;;;;;AASA,eAAe,gBACb,MACA,UACA,KACmB;CACnB,IAAI,SAAS,OAAO,GAAG,MAAM,SAAS,SAAS;CAC/C,IAAI,OAAO,MAAM,KAAK,OAAO,GAAG;CAChC,OAAO,SAAS,OAAO,GAAG;EACxB,MAAM,SAAS,SAAS;EACxB,OAAO,MAAM,KAAK,OAAO,GAAG;CAC9B;CACA,OAAO;AACT"}

package/dist/renderer-Dgj_qEOA.mjs

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

package/dist/{renderer-CdLCkJB-.mjs → renderer-qSMVeNSV.mjs}

@@ -1,6 +1,4 @@
-import { t as __exportAll } from "./rolldown-runtime-D7D4PA-g.mjs";
 //#region src/markdown/renderer.ts
-var renderer_exports = /* @__PURE__ */ __exportAll({ MarkdownRenderer: () => MarkdownRenderer });
 var MarkdownRenderer = class {
 	#render;
 	#images = /* @__PURE__ */ new Map();
@@ -12,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-CNjGNxVw.mjs"), import("./image-Cm5T-uw-.mjs")]);
+		const [{ createCallbacks }, { createImageCallback }] = await Promise.all([import("./callbacks-DcMBGQEO.mjs"), import("./image-Cm5T-uw-.mjs")]);
 		const callbacks = createCallbacks(ctx);
 		const image = ctx.images ?? true ? createImageCallback({
 			add: (child) => this.#parent?.add(child),
@@ -37,6 +35,6 @@ var MarkdownRenderer = class {
 	}
 };
 //#endregion
-export { renderer_exports as n, MarkdownRenderer as t };
+export { MarkdownRenderer as t };
 
-//# sourceMappingURL=renderer-CdLCkJB-.mjs.map
+//# sourceMappingURL=renderer-qSMVeNSV.mjs.map

package/dist/{renderer-CdLCkJB-.mjs.map → renderer-qSMVeNSV.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"renderer-CdLCkJB-.mjs","names":["#opts","#parent","#render","#images"],"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 =\n      (ctx.images ?? true)\n        ? createImageCallback({\n            add: (child) => this.#parent?.add(child),\n            images: this.#images,\n            remove: (child) => this.#parent?.remove(child) ?? child.unmount(),\n          })\n        : undefined\n\n    if (image) callbacks.image = image.cb\n\n    let rendered = this.#render(source, callbacks, this.#opts)\n    if (image) 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,KAAKA,QAAQ;EACb,KAAKC,UAAU,KAAK;CACtB;CAEA,MAAM,OAAO,QAAgB,KAAmC;EAE9D,KAAKC,YAAY,KAAKF,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,QACH,IAAI,UAAU,OACX,oBAAoB;GAClB,MAAM,UAAU,KAAKC,SAAS,IAAI,KAAK;GACvC,QAAQ,KAAKE;GACb,SAAS,UAAU,KAAKF,SAAS,OAAO,KAAK,KAAK,MAAM,QAAQ;EAClE,CAAC,IACD,KAAA;EAEN,IAAI,OAAO,UAAU,QAAQ,MAAM;EAEnC,IAAI,WAAW,KAAKC,QAAQ,QAAQ,WAAW,KAAKF,KAAK;EACzD,IAAI,OAAO,WAAW,MAAM,MAAM,QAAQ,KAAK,QAAQ;EACvD,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-qSMVeNSV.mjs","names":["#opts","#parent","#render","#images"],"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 =\n      (ctx.images ?? true)\n        ? createImageCallback({\n            add: (child) => this.#parent?.add(child),\n            images: this.#images,\n            remove: (child) => this.#parent?.remove(child) ?? child.unmount(),\n          })\n        : undefined\n\n    if (image) callbacks.image = image.cb\n\n    let rendered = this.#render(source, callbacks, this.#opts)\n    if (image) 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,KAAKA,QAAQ;EACb,KAAKC,UAAU,KAAK;CACtB;CAEA,MAAM,OAAO,QAAgB,KAAmC;EAE9D,KAAKC,YAAY,KAAKF,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,QACH,IAAI,UAAU,OACX,oBAAoB;GAClB,MAAM,UAAU,KAAKC,SAAS,IAAI,KAAK;GACvC,QAAQ,KAAKE;GACb,SAAS,UAAU,KAAKF,SAAS,OAAO,KAAK,KAAK,MAAM,QAAQ;EAClE,CAAC,IACD,KAAA;EAEN,IAAI,OAAO,UAAU,QAAQ,MAAM;EAEnC,IAAI,WAAW,KAAKC,QAAQ,QAAQ,WAAW,KAAKF,KAAK;EACzD,IAAI,OAAO,WAAW,MAAM,MAAM,QAAQ,KAAK,QAAQ;EACvD,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-CxL4xbkl.mjs → renderer-uMeDzF9B.mjs}

@@ -1,12 +1,13 @@
 import { C as useActiveOwner, E as withOwner, S as unwrap, _ as peek, d as createSuspenseBoundary, h as memo, l as createRoot, n as SuspenseContext, o as createNode, v as provideContext, x as untrack, y as signal } from "./reactive-f7NpAi69.mjs";
-import { t as defaultTheme } from "./registry-U654j61Y.mjs";
+import { t as defaultTheme } from "./registry-w_w7gZr_.mjs";
 import { s as stripAnsiBg } from "./ansi-Clq0ozyA.mjs";
-import { t as styleBuilder } from "./builder-D49ECBEf.mjs";
-import { n as box } from "./box-DyaByEiG.mjs";
-import { r as createCtx, t as RenderContext } from "./render-DxVLqqB9.mjs";
-import { TuiReporter } from "./services/logger.mjs";
+import { t as styleBuilder } from "./builder-DTz5mppV.mjs";
+import { n as box } from "./box-DepqUtuo.mjs";
+import { t as createCtx } from "./ctx-DjJ1zSbs.mjs";
+import { t as RenderContext } from "./render-F8pVXN7h.mjs";
+import { t as TuiReporter } from "./logger-DDrt03So.mjs";
 import { o as bumpPlacements } from "./kitty-JbCJC0iQ.mjs";
-import { TerminalQueries, canonical } from "./index.mjs";
+import { i as canonical, t as TerminalQueries } from "./queries-B_lOwEiE.mjs";
 import { Emitter } from "@zaly/shared";
 import { sliceAnsi, stringWidth, stripAnsi } from "@zaly/shared/ansi";
 import { inspect, isDeepStrictEqual } from "node:util";
@@ -2641,4 +2642,4 @@ var Renderer = class extends Emitter {
 //#endregion
 export { Renderer };
 
-//# sourceMappingURL=renderer-CxL4xbkl.mjs.map
+//# sourceMappingURL=renderer-uMeDzF9B.mjs.map