@clo4/cli 1.0.0 → 3.0.0

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":["closest","builtinUsageAction","maybeProcess"],"sources":["../src/util.ts","../src/analyze.ts","../src/errors.ts","../node_modules/.pnpm/fastest-levenshtein@1.0.16/node_modules/fastest-levenshtein/mod.js","../src/help.ts","../src/parse.ts","../src/completion.ts","../src/run.ts","../src/index.ts"],"sourcesContent":["import type { NonEmptyArray } from \"./types.js\";\n\nexport function isArray<T>(o: T | readonly T[]): o is readonly T[] {\n  return Array.isArray(o);\n}\n\n/** Convert the value, if any, to an array with 0 or more elements */\nexport function makeArray<T>(thing: T | readonly T[] | undefined): T[] {\n  if (thing === undefined) return [];\n  if (isArray(thing)) {\n    return thing.slice();\n  }\n  return [thing];\n}\n\n/**\n * Like {@link makeArray}, but without copying when the input is already an\n * array. Only safe when the caller treats the result as read-only — use it on\n * the hot path to avoid slicing read-only spec metadata.\n */\nexport function asArray<T>(thing: T | readonly T[] | undefined): readonly T[] {\n  if (thing === undefined) return [];\n  if (isArray(thing)) return thing;\n  return [thing];\n}\n\n/** Convert the value to an array with at least one element */\nexport function makeArray1<T>(thing: T | NonEmptyArray<T>): [T, ...T[]] {\n  if (isArray(thing)) {\n    // We know that this array has at least one element in it\n    return thing.slice() as [T, ...T[]];\n  }\n  return [thing];\n}\n\n/** Set many keys in a Map to the same value */\nexport function setEach<K, V>(map: Map<K, V>, keys: K | readonly K[], value: V): void {\n  if (isArray(keys)) {\n    for (const key of keys) {\n      map.set(key, value);\n    }\n  } else {\n    map.set(keys, value);\n  }\n}\n\nexport function assert(expr: unknown, msg = \"\"): asserts expr {\n  if (!expr) {\n    throw new Error(msg);\n  }\n}\n\nexport function error(...strings: unknown[]): void {\n  console.error(\"%cError:\", \"color: red\", ...strings);\n}\n\n/** Print a message to stdout, trimming trailing whitespace. */\nexport function print(text: string): void {\n  console.log(text.trimEnd());\n}\n\n/** Print an error message to stderr with the shared `Error:` prefix. */\nexport function printActionError(message: string): void {\n  console.error(\"Error:\", message);\n}\n","import { asArray, setEach } from \"./util.js\";\n\ninterface MinOption {\n  name: string | readonly string[];\n  args?: unknown;\n  isPersistent?: boolean;\n  isRequired?: boolean;\n}\n\ninterface MinSubcommand<Option extends MinOption> {\n  name: string | readonly string[];\n  args?: unknown;\n  options?: readonly Option[];\n  subcommands?: readonly this[];\n  parserDirectives?: {\n    optionArgSeparators?: string | readonly string[];\n    flagsArePosixNoncompliant?: boolean;\n    optionsMustPrecedeArguments?: boolean;\n    subcommandsMatchUniquePrefix?: boolean;\n  };\n}\n\n// Token helpers {{{\n\nexport type BaseToken = {\n  /** The index in the input that that contains this token */\n  index: number;\n  /** Inclusive start index */\n  start: number;\n  /** Non-inclusive (exclusive) end index */\n  end: number;\n  /** The literal text value */\n  literal: string;\n};\n\n/** Something that looks like an option but isn't one */\nexport type TokenUnknownOption = BaseToken & {\n  kind: \"unknown-option\";\n  validOptions: string[];\n};\n\n/** A value that belongs to either an option or the current command */\nexport type TokenArg = BaseToken & {\n  kind: \"arg\";\n};\n\n/** A token that denotes that all following tokens are arguments */\nexport type TokenArgSeparator = BaseToken & {\n  kind: \"arg-separator\";\n};\n\n/** Some text that is guaranteed to belong to the preceding option (eg. -I%, --config=file.json) */\nexport type TokenOptionArg = BaseToken & {\n  kind: \"option-arg\";\n  option: string;\n  separator: string;\n};\n\n/** A subcommand, and all the relevant information */\nexport type TokenSubcommand<Subcommand> = BaseToken & {\n  kind: \"subcommand\";\n  subcommand: Subcommand;\n};\n\n/** An option */\nexport type TokenOption<Option> = BaseToken & {\n  kind: \"option\";\n  option: Option;\n};\n\n/** Any kind of token */\nexport type Token<Subcommand, Option> =\n  | TokenArg\n  | TokenArgSeparator\n  | TokenSubcommand<Subcommand>\n  | TokenOption<Option>\n  | TokenUnknownOption\n  | TokenOptionArg;\n\nexport const $optionArg = (\n  index: number,\n  start: number,\n  end: number,\n  literal: string,\n  option: string,\n  separator: string,\n): TokenOptionArg => ({\n  kind: \"option-arg\",\n  index,\n  literal,\n  start,\n  end,\n  option,\n  separator,\n});\n\nexport const $unknownOption = (\n  index: number,\n  start: number,\n  end: number,\n  literal: string,\n  validOptions: string[],\n): TokenUnknownOption => ({\n  kind: \"unknown-option\",\n  index,\n  start,\n  end,\n  literal,\n  validOptions,\n});\n\nexport const $arg = (index: number, start: number, end: number, literal: string): TokenArg => ({\n  kind: \"arg\",\n  index,\n  start,\n  end,\n  literal,\n});\n\nexport const $argSeparator = (\n  index: number,\n  start: number,\n  end: number,\n  literal: string,\n): TokenArgSeparator => ({\n  kind: \"arg-separator\",\n  index,\n  start,\n  end,\n  literal,\n});\n\nexport const $subcommand = <Subcommand extends MinSubcommand<Option>, Option extends MinOption>(\n  index: number,\n  start: number,\n  end: number,\n  literal: string,\n  subcommand: Subcommand,\n): TokenSubcommand<Subcommand> => {\n  return {\n    kind: \"subcommand\",\n    index,\n    start,\n    end,\n    literal,\n    subcommand,\n  };\n};\n\nexport const $option = <Option extends MinOption>(\n  index: number,\n  start: number,\n  end: number,\n  literal: string,\n  option: Option,\n): TokenOption<Option> => {\n  return {\n    kind: \"option\",\n    index,\n    start,\n    end,\n    literal,\n    option,\n  };\n};\n\n// }}}\n\nexport interface AnalyzeResult<Subcommand, Option> {\n  /** The state after the final token has been processed */\n  finalState: {\n    localOptions: Map<string, Option>;\n    persistentOptions: Map<string, Option>;\n    localRequiredOptions: Map<string, Option>;\n    persistentRequiredOptions: Map<string, Option>;\n  };\n\n  /** The list of tokens and their data */\n  tokens: Token<Subcommand, Option>[];\n}\n\n/**\n * Lex the input, output some tokens\n *\n * This generator uses the options and subcommands to categorize the\n * input tokens. It will not track or reject arguments - tokens that\n * don't match an option or subcommand are yielded as arguments.\n */\nexport function analyze<Subcommand extends MinSubcommand<Option>, Option extends MinOption>(\n  input: readonly string[],\n  spec: Subcommand,\n): AnalyzeResult<Subcommand, Option> {\n  const tokens = [] as Token<Subcommand, Option>[];\n\n  if (input.length === 0) {\n    const localOptions = new Map();\n    const localRequiredOptions = new Map();\n    const persistentOptions = new Map();\n    const persistentRequiredOptions = new Map();\n    if (spec.options) {\n      for (const option of spec.options) {\n        if (option.isPersistent) {\n          setEach(persistentOptions, option.name, option);\n          if (option.isRequired) {\n            setEach(persistentRequiredOptions, option.name, option);\n          }\n        } else {\n          setEach(localOptions, option.name, option);\n          if (option.isRequired) {\n            setEach(localRequiredOptions, option.name, option);\n          }\n        }\n      }\n    }\n    return {\n      finalState: {\n        localOptions,\n        persistentOptions,\n        localRequiredOptions,\n        persistentRequiredOptions,\n      },\n      tokens,\n    };\n  }\n\n  // This is initialized by the call to `updateCurrentCommand`\n  let localSubcommands: readonly Subcommand[] | undefined;\n\n  const localOptions: Map<string, Option> = new Map();\n  const persistentOptions: Map<string, Option> = new Map();\n  const localRequiredOptions: Map<string, Option> = new Map();\n  const persistentRequiredOptions: Map<string, Option> = new Map();\n  let separators: readonly string[] = [\"=\"];\n  let hasFoundArg = false;\n  let posixCompliantOptions = true;\n  let subcommandsMatchUniquePrefix = false;\n  let optionsMustPrecedeArguments = false;\n  let hasUsedNonPersistentOption = false;\n\n  const getOption = (name: string) => localOptions.get(name) ?? persistentOptions.get(name) ?? null;\n\n  const hasOption = (name: string) => localOptions.has(name) || persistentOptions.has(name);\n\n  const getSubcommand = (name: string) => {\n    if (!localSubcommands) {\n      return null;\n    }\n\n    // A literal match always wins, so every command has to be checked even in\n    // prefix mode. Track the prefix matches as we go (counting each command at\n    // most once) and only commit to one if it's unambiguous.\n    let prefixMatch: Subcommand | null = null;\n    let prefixCount = 0;\n\n    for (const command of localSubcommands) {\n      const names = typeof command.name === \"string\" ? [command.name] : command.name;\n      for (const cmdName of names) {\n        if (cmdName === name) {\n          return command;\n        }\n        if (subcommandsMatchUniquePrefix && cmdName.startsWith(name)) {\n          prefixMatch = command;\n          prefixCount += 1;\n          // One matching name is enough; checking the rest would double-count.\n          break;\n        }\n      }\n    }\n\n    return prefixCount === 1 ? prefixMatch : null;\n  };\n\n  // Update state to a new subcommand (without clearing maps).\n  // Returns the new \"internal state\" which is a byproduct of processing\n  // the subcommand.\n  const updateCurrentCommand = (command: Subcommand) => {\n    if (command.options) {\n      for (const option of command.options) {\n        if (option.isPersistent) {\n          setEach(persistentOptions, option.name, option);\n          if (option.isRequired) {\n            setEach(persistentRequiredOptions, option.name, option);\n          }\n        } else {\n          setEach(localOptions, option.name, option);\n          if (option.isRequired) {\n            setEach(localRequiredOptions, option.name, option);\n          }\n        }\n      }\n    }\n\n    localSubcommands = command.subcommands;\n\n    const directives = command.parserDirectives;\n\n    if (directives?.optionArgSeparators) {\n      separators = asArray(directives.optionArgSeparators);\n    }\n\n    if (directives?.subcommandsMatchUniquePrefix) {\n      subcommandsMatchUniquePrefix = directives.subcommandsMatchUniquePrefix;\n    }\n\n    if (directives?.optionsMustPrecedeArguments) {\n      optionsMustPrecedeArguments = directives.optionsMustPrecedeArguments;\n    }\n\n    if (typeof directives?.flagsArePosixNoncompliant === \"boolean\") {\n      posixCompliantOptions = !directives.flagsArePosixNoncompliant;\n    }\n  };\n\n  // The maps are already empty, no reason to clear them.\n  updateCurrentCommand(spec);\n\n  tokens: for (let index = 0; index < input.length; index++) {\n    const token = input[index];\n\n    // \"--\" as a token disables option & subcommand parsing, so this needs\n    // to be checked first.\n    if (token === \"--\") {\n      tokens.push($argSeparator(index, 0, token.length, token));\n      index += 1;\n      for (; index < input.length; index++) {\n        const tok = input[index];\n        tokens.push($arg(index, 0, tok.length, tok));\n      }\n      break tokens;\n    }\n\n    // 1. Try to parse as a subcommand\n    // A common case is for the first argument to be a subcommand,\n    // so we can exit early instead of building the whole map if the\n    // argument is a subcommand.\n    if (!hasFoundArg && !hasUsedNonPersistentOption && localSubcommands) {\n      const command = getSubcommand(token);\n      if (command) {\n        localOptions.clear();\n        updateCurrentCommand(command);\n        tokens.push($subcommand(index, 0, token.length, token, command));\n        continue tokens;\n      }\n    }\n\n    // 2. Try to parse as an option\n    if (!(optionsMustPrecedeArguments && hasFoundArg)) {\n      if (\n        posixCompliantOptions &&\n        token.length > 1 &&\n        (token.startsWith(\"-\") || token.startsWith(\"+\")) &&\n        !token.startsWith(\"--\")\n      ) {\n        const leadingChar = token[0];\n\n        // 2.a. Parse as a single dash or plus with an arg\n        // Try dash and plus options first if:\n        // - the options exist\n        // - the options take args\n        // - the first non-leading character isn't an option\n        const dashOption = getOption(leadingChar);\n        if (dashOption?.args && !hasOption(token.slice(0, 2))) {\n          tokens.push($option(index, 0, 1, leadingChar, dashOption));\n          tokens.push($optionArg(index, 1, token.length, token.slice(1), leadingChar, \"\"));\n          continue tokens;\n        }\n\n        // 2.b. Parse as a chainable short option\n        // If we fell through, the option wasn't `-` or `+`\n        chars: for (let char = 1; char < token.length; char++) {\n          const optionName = `${leadingChar}${token[char]}`;\n          const option = getOption(optionName);\n          if (!option) {\n            tokens.push(\n              $unknownOption(index, char, char + 1, optionName, [\n                ...localOptions.keys(),\n                ...persistentOptions.keys(),\n              ]),\n            );\n            continue chars;\n          }\n\n          if (!hasUsedNonPersistentOption && !option.isPersistent) {\n            hasUsedNonPersistentOption = true;\n          }\n\n          tokens.push($option(index, char, char + 1, optionName, option));\n\n          if (option.args && char < token.length - 1) {\n            const remainingChars = token.slice(char + 1);\n            const sep = separators.find((sep) => remainingChars.startsWith(sep)) || \"\";\n            const argStartOffset = char + sep.length;\n            tokens.push(\n              $optionArg(\n                index,\n                argStartOffset + 1,\n                token.length,\n                token.slice(argStartOffset + 1),\n                optionName,\n                sep,\n              ),\n            );\n            break;\n          }\n        }\n        continue tokens;\n      }\n\n      if (!posixCompliantOptions || (token.length > 2 && token.startsWith(\"--\"))) {\n        // 2.c. Parse as a long option or posix-noncompliant option\n\n        // POSIX-noncompliant option means that there's nothing \"option-like\".\n        // Any token can be an option if it matches an option name, and if it's\n        // not an option then it's just a regular argument.\n\n        let foundSep = null;\n        let foundSepIndex = -1;\n\n        separators: for (const sep of separators) {\n          const index = token.indexOf(sep);\n          if (index === -1) {\n            continue separators;\n          }\n          foundSep = sep;\n          foundSepIndex = index;\n        }\n\n        if (foundSep) {\n          const optionName = token.slice(0, foundSepIndex);\n          const option = getOption(optionName);\n          if (option) {\n            if (!hasUsedNonPersistentOption && !option.isPersistent) {\n              hasUsedNonPersistentOption = true;\n            }\n            tokens.push($option(index, 0, foundSepIndex, token.slice(0, foundSepIndex), option));\n            tokens.push(\n              $optionArg(\n                index,\n                foundSepIndex + foundSep.length,\n                token.length,\n                token.slice(foundSepIndex + foundSep.length),\n                optionName,\n                foundSep,\n              ),\n            );\n            continue tokens;\n          } else if (posixCompliantOptions) {\n            // If we're here, we know the option is invalid and we're parsing a\n            // posix-compliant option, so that's an \"unknown option\" instead of arg.\n            const optionName = token.slice(0, foundSepIndex);\n            tokens.push(\n              $unknownOption(index, 0, foundSepIndex, optionName, [\n                ...localOptions.keys(),\n                ...persistentOptions.keys(),\n              ]),\n            );\n            tokens.push(\n              $optionArg(\n                index,\n                foundSepIndex + foundSep.length,\n                token.length,\n                token.slice(foundSepIndex + foundSep.length),\n                optionName,\n                foundSep,\n              ),\n            );\n            continue tokens;\n          }\n          // Posix noncompliant options should fall through\n        } else {\n          const option = getOption(token);\n          if (option) {\n            if (!hasUsedNonPersistentOption && !option.isPersistent) {\n              hasUsedNonPersistentOption = true;\n            }\n            tokens.push($option(index, 0, token.length, token, option));\n            continue tokens;\n          } else if (posixCompliantOptions) {\n            // If we're here, we know the option is invalid and we're parsing a\n            // posix-compliant option, so that's an \"unknown option\" instead of arg.\n            tokens.push(\n              $unknownOption(index, 0, token.length, token, [\n                ...localOptions.keys(),\n                ...persistentOptions.keys(),\n              ]),\n            );\n            continue tokens;\n          }\n        }\n      }\n    }\n\n    if (!hasFoundArg) {\n      hasFoundArg = true;\n    }\n    tokens.push($arg(index, 0, token.length, token));\n  }\n\n  return {\n    finalState: {\n      localOptions,\n      persistentOptions,\n      localRequiredOptions,\n      persistentRequiredOptions,\n    },\n    tokens,\n  };\n}\n","import type { BaseToken, TokenOptionArg, TokenUnknownOption } from \"./analyze.js\";\nimport type { CommandPath } from \"./types.js\";\n\nconst repr = JSON.stringify as (str: string) => string;\n\nexport interface ErrorContext {\n  path: CommandPath;\n}\n\nexport class ParseError extends Error {\n  readonly context: ErrorContext;\n  constructor(context: ErrorContext, ...args: ConstructorParameters<ErrorConstructor>) {\n    super(...args);\n    this.context = context;\n    this.name = this.constructor.name;\n  }\n}\n\nexport class UnknownOption extends ParseError {\n  readonly index: number;\n  readonly start: number;\n  readonly end: number;\n  readonly option: string;\n  readonly validOptions: string[];\n  constructor(token: TokenUnknownOption, context: ErrorContext) {\n    const msg = `${repr(token.literal)} looks like a flag, but is unknown in this context`;\n    super(context, msg);\n    this.option = token.literal;\n    this.validOptions = token.validOptions;\n    this.index = token.index;\n    this.start = token.start;\n    this.end = token.end;\n  }\n}\n\nexport class InvalidOptionArg extends ParseError {\n  readonly index: number;\n  readonly start: number;\n  readonly end: number;\n  readonly arg: string;\n  readonly option: string;\n  constructor(token: TokenOptionArg, context: ErrorContext) {\n    const msg = `Option ${token.option} doesn't take arguments`;\n    super(context, msg);\n    this.index = token.index;\n    this.start = token.start;\n    this.end = token.end;\n    this.option = token.option;\n    this.arg = token.literal;\n  }\n}\n\nexport class TooManyArguments extends ParseError {\n  readonly index: number;\n  readonly value: string;\n  constructor(token: BaseToken, context: ErrorContext) {\n    const msg = `Too many arguments, ${repr(token.literal)} was unexpected`;\n    super(context, msg);\n    this.index = token.index;\n    this.value = token.literal;\n  }\n}\n\nexport class TooFewOptionArguments extends ParseError {\n  constructor(min: number, max: number, context: ErrorContext) {\n    const msg =\n      min === max\n        ? `Option needs ${min} argument${min === 1 ? \"\" : \"s\"}`\n        : !Number.isFinite(max)\n          ? `Option needs at least ${min} argument${min === 1 ? \"\" : \"s\"}`\n          : `Option needs between ${min} and ${max} arguments`;\n    super(context, msg);\n  }\n}\n\nexport class TooFewArguments extends ParseError {\n  constructor(min: number, max: number, context: ErrorContext) {\n    const msg =\n      min === max\n        ? `Expected ${min} argument${min === 1 ? \"\" : \"s\"}`\n        : !Number.isFinite(max)\n          ? `Expected at least ${min} argument${min === 1 ? \"\" : \"s\"}`\n          : `Expected between ${min} and ${max} arguments`;\n    super(context, msg);\n  }\n}\n\nexport class MissingRequiredOption extends ParseError {\n  constructor(name: string, context: ErrorContext) {\n    const msg = `Option ${name} is required, but wasn't found`;\n    super(context, msg);\n  }\n}\n","\"use strict\";\nexports.__esModule = true;\nexports.distance = exports.closest = void 0;\nvar peq = new Uint32Array(0x10000);\nvar myers_32 = function (a, b) {\n    var n = a.length;\n    var m = b.length;\n    var lst = 1 << (n - 1);\n    var pv = -1;\n    var mv = 0;\n    var sc = n;\n    var i = n;\n    while (i--) {\n        peq[a.charCodeAt(i)] |= 1 << i;\n    }\n    for (i = 0; i < m; i++) {\n        var eq = peq[b.charCodeAt(i)];\n        var xv = eq | mv;\n        eq |= ((eq & pv) + pv) ^ pv;\n        mv |= ~(eq | pv);\n        pv &= eq;\n        if (mv & lst) {\n            sc++;\n        }\n        if (pv & lst) {\n            sc--;\n        }\n        mv = (mv << 1) | 1;\n        pv = (pv << 1) | ~(xv | mv);\n        mv &= xv;\n    }\n    i = n;\n    while (i--) {\n        peq[a.charCodeAt(i)] = 0;\n    }\n    return sc;\n};\nvar myers_x = function (b, a) {\n    var n = a.length;\n    var m = b.length;\n    var mhc = [];\n    var phc = [];\n    var hsize = Math.ceil(n / 32);\n    var vsize = Math.ceil(m / 32);\n    for (var i = 0; i < hsize; i++) {\n        phc[i] = -1;\n        mhc[i] = 0;\n    }\n    var j = 0;\n    for (; j < vsize - 1; j++) {\n        var mv_1 = 0;\n        var pv_1 = -1;\n        var start_1 = j * 32;\n        var vlen_1 = Math.min(32, m) + start_1;\n        for (var k = start_1; k < vlen_1; k++) {\n            peq[b.charCodeAt(k)] |= 1 << k;\n        }\n        for (var i = 0; i < n; i++) {\n            var eq = peq[a.charCodeAt(i)];\n            var pb = (phc[(i / 32) | 0] >>> i) & 1;\n            var mb = (mhc[(i / 32) | 0] >>> i) & 1;\n            var xv = eq | mv_1;\n            var xh = ((((eq | mb) & pv_1) + pv_1) ^ pv_1) | eq | mb;\n            var ph = mv_1 | ~(xh | pv_1);\n            var mh = pv_1 & xh;\n            if ((ph >>> 31) ^ pb) {\n                phc[(i / 32) | 0] ^= 1 << i;\n            }\n            if ((mh >>> 31) ^ mb) {\n                mhc[(i / 32) | 0] ^= 1 << i;\n            }\n            ph = (ph << 1) | pb;\n            mh = (mh << 1) | mb;\n            pv_1 = mh | ~(xv | ph);\n            mv_1 = ph & xv;\n        }\n        for (var k = start_1; k < vlen_1; k++) {\n            peq[b.charCodeAt(k)] = 0;\n        }\n    }\n    var mv = 0;\n    var pv = -1;\n    var start = j * 32;\n    var vlen = Math.min(32, m - start) + start;\n    for (var k = start; k < vlen; k++) {\n        peq[b.charCodeAt(k)] |= 1 << k;\n    }\n    var score = m;\n    for (var i = 0; i < n; i++) {\n        var eq = peq[a.charCodeAt(i)];\n        var pb = (phc[(i / 32) | 0] >>> i) & 1;\n        var mb = (mhc[(i / 32) | 0] >>> i) & 1;\n        var xv = eq | mv;\n        var xh = ((((eq | mb) & pv) + pv) ^ pv) | eq | mb;\n        var ph = mv | ~(xh | pv);\n        var mh = pv & xh;\n        score += (ph >>> (m - 1)) & 1;\n        score -= (mh >>> (m - 1)) & 1;\n        if ((ph >>> 31) ^ pb) {\n            phc[(i / 32) | 0] ^= 1 << i;\n        }\n        if ((mh >>> 31) ^ mb) {\n            mhc[(i / 32) | 0] ^= 1 << i;\n        }\n        ph = (ph << 1) | pb;\n        mh = (mh << 1) | mb;\n        pv = mh | ~(xv | ph);\n        mv = ph & xv;\n    }\n    for (var k = start; k < vlen; k++) {\n        peq[b.charCodeAt(k)] = 0;\n    }\n    return score;\n};\nvar distance = function (a, b) {\n    if (a.length < b.length) {\n        var tmp = b;\n        b = a;\n        a = tmp;\n    }\n    if (b.length === 0) {\n        return a.length;\n    }\n    if (a.length <= 32) {\n        return myers_32(a, b);\n    }\n    return myers_x(a, b);\n};\nexports.distance = distance;\nvar closest = function (str, arr) {\n    var min_distance = Infinity;\n    var min_index = 0;\n    for (var i = 0; i < arr.length; i++) {\n        var dist = distance(str, arr[i]);\n        if (dist < min_distance) {\n            min_distance = dist;\n            min_index = i;\n        }\n    }\n    return arr[min_index];\n};\nexports.closest = closest;\n","import { closest } from \"fastest-levenshtein\";\n\nimport type { Action, Arg, Option, NonEmptyArray, SingleOrArray, Subcommand } from \"./types.js\";\nimport { makeArray, makeArray1, print, printActionError } from \"./util.js\";\n\nfunction getNamed<T extends { name: SingleOrArray<string> }>(\n  named: readonly T[],\n  name: string,\n): T | null {\n  return named.find((obj) => makeArray(obj.name).includes(name)) ?? null;\n}\n\nfunction getParserDirective<Key extends keyof NonNullable<Subcommand[\"parserDirectives\"]>>(\n  path: readonly Subcommand[],\n  key: Key,\n): NonNullable<Subcommand[\"parserDirectives\"]>[Key] | undefined {\n  for (let index = path.length - 1; index >= 0; index -= 1) {\n    const command = path[index];\n    if (command?.parserDirectives && key in command.parserDirectives) {\n      return command.parserDirectives[key];\n    }\n  }\n  return undefined;\n}\n\nfunction dedent(str: string) {\n  if (str[0] !== \"\\n\") return str;\n  const lines = str.split(\"\\n\").slice(1, -1);\n  const margin = lines[0].length - lines[0].trimStart().length;\n  return lines.map((line) => line.slice(margin)).join(\"\\n\");\n}\n\nexport interface HelpConfig {\n  /** Include the command description? Default: true. */\n  description?: boolean;\n\n  /** Include the usage summary? Default: true. */\n  usage?: boolean;\n\n  /** Ask if the user intended the input to be one of these choices. */\n  didYouMean?: {\n    input: string;\n    choices: readonly string[];\n  };\n}\n\n/** Get the help message used by the built-in help option and command. */\nexport function getHelp(path: NonEmptyArray<Subcommand>, config: HelpConfig = {}): string {\n  const { description = true, usage = true, didYouMean } = config;\n  const sections = getSections(path);\n  if (didYouMean) {\n    sections.didYouMean = closest(didYouMean.input, didYouMean.choices as string[]);\n  }\n  if (!description) {\n    sections.description = undefined;\n  }\n  if (!usage) {\n    sections.usage = undefined;\n  }\n  return formatHelpSections(sections);\n}\n\n/**\n * Action that prints usage for commands where a subcommand must be provided.\n */\nexport const usage: Action = ({ path, args: [command], help }) => {\n  if (command === undefined) {\n    print(help());\n    return 0;\n  }\n\n  if (command === \"\") {\n    printActionError(\n      `Expected a command, but the value was empty\\n\\n${help({ description: false })}`,\n    );\n    return 1;\n  }\n\n  const subcommands = path\n    .at(-1)\n    ?.subcommands?.filter((cmd) => !cmd.hidden)\n    .flatMap((cmd) => cmd.name);\n\n  if (subcommands && subcommands.length > 0) {\n    const matchPrefix = getParserDirective(path, \"subcommandsMatchUniquePrefix\");\n    if (matchPrefix) {\n      const possible = subcommands.filter((name) => name.startsWith(command));\n      if (possible.length > 0) {\n        printActionError(\n          `Ambiguous command '${command}', could be: ${possible.join(\", \")}\\n\\n${help({\n            description: false,\n          })}`,\n        );\n        return 1;\n      }\n    }\n\n    printActionError(\n      `Unknown command '${command}'\\n\\n${help({\n        description: false,\n        didYouMean: {\n          input: command,\n          choices: subcommands,\n        },\n      })}`,\n    );\n    return 1;\n  }\n\n  printActionError(`Unknown command '${command}'\\n\\n${help({ description: false })}`);\n\n  return 1;\n};\n\n/** A subcommand that prints help for its parent or a sibling command. */\nexport const helpCommand: Subcommand = {\n  name: \"help\",\n  description: \"Print a help message\",\n  args: {\n    name: \"command\",\n    isOptional: true,\n  },\n  action({ path, args: [commandName], help }) {\n    const helpRoot = path.slice(0, -1) as unknown as NonEmptyArray<Subcommand>;\n\n    if (!commandName) {\n      print(help({ path: helpRoot }));\n      return 0;\n    }\n\n    const parent = path[path.length - 2];\n\n    if (!parent.subcommands) {\n      printActionError(\n        `No subcommands, try using 'help' with nothing after it\\n\\n${help({\n          description: false,\n          path: helpRoot,\n        })}`,\n      );\n      return 1;\n    }\n\n    const command = getNamed(parent.subcommands, commandName);\n    if (!command) {\n      const subcommands = parent.subcommands\n        .filter((cmd) => !cmd.hidden)\n        .flatMap((cmd) => cmd.name);\n\n      if (subcommands.length > 0) {\n        printActionError(\n          `There is no subcommand named '${commandName}'\\n\\n${help({\n            path: helpRoot,\n            didYouMean: {\n              input: commandName,\n              choices: subcommands,\n            },\n          })}`,\n        );\n        return 1;\n      }\n\n      printActionError(\n        `There is no subcommand named '${commandName}'\\n\\n${help({\n          description: false,\n          path: helpRoot,\n        })}`,\n      );\n      return 1;\n    }\n\n    print(help({ path: [...helpRoot, command] }));\n  },\n};\n\n/** A persistent help option that prints help for the selected command. */\nexport const help: Option = {\n  name: [\"-h\", \"--help\"],\n  description: \"Print a help message\",\n  isPersistent: true,\n  action({ path }) {\n    print(formatHelpSections(getSections(path)));\n    return 0;\n  },\n};\n\ntype HelpSections = {\n  description?: string;\n  usage?: string;\n  didYouMean?: string;\n  options: [formattedName: string, description: string][];\n  persistentOptions: [formattedName: string, description: string][];\n  subcommands: [formattedName: string, description: string][];\n};\n\nfunction getSubcommandPathString(commands: NonEmptyArray<Subcommand>): string {\n  return commands.map((command) => getLongestString(makeArray1(command.name))).join(\" \");\n}\n\nfunction nonNullable<T>(value: T): value is NonNullable<T> {\n  return value !== null && value !== undefined;\n}\n\nfunction getSections(commands: NonEmptyArray<Subcommand>): HelpSections {\n  const command = commands[commands.length - 1];\n\n  const description = command.description;\n  const defaultDesc = \"No description\";\n\n  const subcommands: HelpSections[\"subcommands\"] = command.subcommands\n    ? command.subcommands\n        .filter((subcommand) => !subcommand.hidden)\n        .map((subcommand) => [\n          makeArray1(subcommand.name)\n            .sort((a, b) => a.length - b.length)\n            .join(\", \"),\n          subcommand.description ?? defaultDesc,\n        ])\n    : [];\n\n  let persistentOptionObjects: Option[] = [];\n  let optionObjects: Option[] = [];\n\n  let persistentOptions: HelpSections[\"persistentOptions\"] = [];\n  let options: HelpSections[\"options\"] = [];\n\n  if (commands.length === 1 && subcommands.length === 0) {\n    optionObjects = command.options ? command.options.filter((option) => !option.hidden) : [];\n    options = optionObjects.map((option) => [\n      optionToString(option),\n      option.description ?? defaultDesc,\n    ]);\n  } else {\n    persistentOptionObjects = commands\n      .map((command) => command.options)\n      .filter(nonNullable)\n      .flat()\n      .filter((option) => option.isPersistent && !option.hidden);\n\n    persistentOptions = persistentOptionObjects.map((option) => [\n      optionToString(option),\n      option.description ?? defaultDesc,\n    ]);\n\n    optionObjects = (command.options ?? []).filter(\n      (option) => !option.hidden && !option.isPersistent,\n    );\n\n    options = optionObjects.map((option) => [\n      optionToString(option),\n      option.description ?? defaultDesc,\n    ]);\n  }\n\n  const usage = (() => {\n    const parts = [getSubcommandPathString(commands)];\n    const required = [\n      ...optionObjects.filter((option) => option.isRequired),\n      ...persistentOptionObjects.filter((option) => option.isRequired),\n    ];\n    for (const option of required) {\n      parts.push(optionToString(option));\n    }\n    if (options.length || persistentOptions.length) {\n      parts.push(\"[flags]\");\n    }\n    if (command.requiresSubcommand) {\n      parts.push(\"<command>\");\n    } else {\n      const args = makeArray(command.args);\n      if (args.length > 0) {\n        parts.push(summarizeArguments(args));\n      }\n    }\n    return parts.join(\" \");\n  })();\n\n  return {\n    usage,\n    description,\n    persistentOptions,\n    options,\n    subcommands,\n  };\n}\n\nexport function formatHelpSections(sections: HelpSections): string {\n  const parts = [];\n\n  const indent = \"  \";\n\n  if (sections.didYouMean) {\n    parts.push(`    Did you mean '${sections.didYouMean}'?`);\n  }\n\n  if (sections.description) {\n    parts.push(dedent(sections.description));\n  }\n\n  if (sections.usage) {\n    parts.push(`Usage:\\n${indent}${sections.usage}`);\n  }\n\n  const longestOptionName = Math.max(\n    0,\n    ...sections.options.map(([name]) => name.length),\n    ...sections.persistentOptions.map(([name]) => name.length),\n  );\n  const minSpacingBetweenNameAndDesc = 2;\n\n  const formatOptions = (options: [string, string][]) => {\n    const lines = [];\n    const newline = indent + \" \".repeat(longestOptionName + minSpacingBetweenNameAndDesc);\n    for (const [name, desc] of options) {\n      const spaces = \" \".repeat(longestOptionName - name.length + minSpacingBetweenNameAndDesc);\n      const [head, ...tail] = desc.split(\"\\n\");\n      const description = [head, ...tail.map((line) => newline + line)].join(\"\\n\");\n      lines.push(`${indent}${name}${spaces}${description}`);\n    }\n    return lines;\n  };\n\n  if (sections.subcommands.length > 0) {\n    const lines = [\"Commands:\"];\n    const longestName = Math.max(...sections.subcommands.map(([name]) => name.length));\n    const newline = indent + \" \".repeat(longestName + minSpacingBetweenNameAndDesc);\n    for (const [name, desc] of sections.subcommands) {\n      const spaces = \" \".repeat(longestName - name.length + minSpacingBetweenNameAndDesc);\n      const [head, ...tail] = desc.split(\"\\n\\n\")[0].split(\"\\n\");\n      const description = [head, ...tail.map((line) => newline + line)].join(\"\\n\");\n      lines.push(`${indent}${name}${spaces}${description}`);\n    }\n    parts.push(lines.join(\"\\n\"));\n  }\n\n  if (sections.options.length > 0) {\n    const lines = [\"Flags:\", ...formatOptions(sections.options)];\n    parts.push(lines.join(\"\\n\"));\n  }\n\n  if (sections.persistentOptions.length > 0) {\n    const lines = [\"Global flags:\", ...formatOptions(sections.persistentOptions)];\n    parts.push(lines.join(\"\\n\"));\n  }\n  return parts.join(\"\\n\\n\") + \"\\n\";\n}\n\nexport function getLongestString(strings: NonEmptyArray<string>): string {\n  let longest = strings[0];\n  for (let i = 1; i < strings.length; i++) {\n    const string = strings[i];\n    if (string.length > longest.length) {\n      longest = string;\n    }\n  }\n  return longest;\n}\n\nexport function optionToString(option: Option): string {\n  const name = makeArray1(option.name)\n    .sort((a, b) => a.length - b.length)\n    .join(\", \");\n\n  const optionArgs = makeArray(option.args);\n\n  if (optionArgs.length === 0) {\n    return name;\n  }\n\n  if (option.requiresSeparator) {\n    const separator = option.requiresSeparator === true ? \"=\" : option.requiresSeparator;\n    if (optionArgs[0].isOptional) {\n      return `${name}[${separator}${optionArgs[0].name || \"argument\"}]`;\n    }\n    return `${name}${separator}<${optionArgs[0].name || \"argument\"}>`;\n  }\n  return `${name} ${summarizeArguments(optionArgs)}`;\n}\n\nexport function summarizeArguments(args: Arg[]) {\n  return args.map((arg) => argToString(arg)).join(\" \");\n}\n\nexport function argToString(arg: Arg): string {\n  const name = arg.name || \"argument\";\n  let lhs = \"<\";\n  let rhs = \">\";\n  let suffix = \"\";\n  if (arg.isOptional) {\n    lhs = \"[\";\n    rhs = \"]\";\n  }\n  if (arg.isVariadic) {\n    suffix = \"...\";\n  }\n  return `${lhs}${name}${rhs}${suffix}`;\n}\n","import type { Action, CommandPath, NonEmptyArray, Option, Spec, Subcommand } from \"./types.js\";\nimport { analyze } from \"./analyze.js\";\nimport type { BaseToken, TokenOption, TokenSubcommand } from \"./analyze.js\";\nimport { assert, isArray, setEach } from \"./util.js\";\nimport {\n  InvalidOptionArg,\n  MissingRequiredOption,\n  ParseError,\n  TooFewArguments,\n  TooFewOptionArguments,\n  TooManyArguments,\n  UnknownOption,\n} from \"./errors.js\";\nimport type { ErrorContext } from \"./errors.js\";\nimport { usage as builtinUsageAction } from \"./help.js\";\n\nexport interface ParseResult {\n  args: string[];\n  argSeparatorIndex: number;\n  options: Map<string, string[]>;\n  path: CommandPath;\n  actions: Action[];\n  optionActions: Action[];\n}\n\nconst enum State {\n  ParseArgs,\n  ParseOptionArgs,\n  ParseOptionArgRequireSeparator,\n}\n\n/**\n * Returns the minimum number of arguments that satisfies the args.\n *\n * Accepts the raw spec value (a single arg, an array, or `undefined`) so the\n * hot path doesn't have to copy it into an array first.\n */\nexport function getMinArgs(\n  args: { isOptional?: boolean } | readonly { isOptional?: boolean }[] | undefined,\n): number {\n  if (args === undefined) return 0;\n  if (!isArray(args)) return args.isOptional ? 0 : 1;\n  let count = 0;\n  for (let i = 0; i < args.length; i++) {\n    if (args[i].isOptional) {\n      break;\n    }\n    count++;\n  }\n  return count;\n}\n\n/** Returns the maximum number of arguments that satisfies the args. */\nexport function getMaxArgs(\n  args: { isVariadic?: boolean } | readonly { isVariadic?: boolean }[] | undefined,\n): number {\n  if (args === undefined) return 0;\n  if (!isArray(args)) return args.isVariadic ? Infinity : 1;\n  // Loop over the array backwards because variadic arguments are\n  // more likely to be at the end of the array. They don't _need_\n  // to be, but it's more idiomatic.\n  for (let i = 0; i < args.length; i++) {\n    if (args[args.length - 1 - i].isVariadic) {\n      return Infinity;\n    }\n  }\n  // None of the arguments are variadic, max is the number of args\n  return args.length;\n}\n\n/** Check if a map has a key or any key from an array */\nfunction has<K>(map: Map<K, unknown>, key: K | NonEmptyArray<K>): boolean {\n  if (isArray(key)) {\n    return map.has(key[0]);\n  }\n  return map.has(key);\n}\n\n/** Get a value from a map by a key or any key from an array */\nfunction get<K, V>(map: Map<K, V>, key: K | NonEmptyArray<K>): V | undefined {\n  if (isArray(key)) {\n    return map.get(key[0]);\n  }\n  return map.get(key);\n}\n\n// TODO: Replace all instances of ParseError with a bespoke error type\n\n/**\n * Parse the input tokens using the given CLI spec.\n *\n * This returns a `ParseResult`, which contains the array of\n * subcommands used, the provided options, and the arguments.\n *\n * If parsing fails, this function throws.\n *\n * This function is exposed to make it easier to build a custom runner.\n */\nexport function parse(input: readonly string[], spec: Spec): ParseResult {\n  const path: [Spec, ...Subcommand[]] = [spec];\n  const actions: Action[] = [];\n  const optionActions: Action[] = [];\n\n  if (spec.action) {\n    actions.push(spec.action);\n  } else if (spec.requiresSubcommand) {\n    actions.push(builtinUsageAction);\n  }\n\n  let commandArgsMin: number = getMinArgs(spec.args);\n  let commandArgsMax: number = getMaxArgs(spec.args);\n\n  const foundArgs: string[] = [];\n  const foundOptions: Map<string, string[]> = new Map();\n\n  // These have to be type assertions otherwise TS will incorrectly\n  // infer that the variables are never reassigned\n  let state = State.ParseArgs as State;\n  let optionArgs = null as string[] | null;\n  let optionArgsMin = 0;\n  let optionArgsMax = 0;\n  let requiredSeparator = false as string | boolean;\n  let argSeparatorIndex = -1;\n\n  // Each item in this set must be provided\n  const dependsOnOptions = [] as Option[];\n  // Each item in this set cannot be provided\n  const exclusiveOnOptions = [] as Option[];\n\n  const parseOption = (token: TokenOption<Option>) => {\n    const option = token.option;\n\n    // Don't allow repeating non-repeatable options\n    if (!option.isRepeatable && has(foundOptions, option.name)) {\n      throw new ParseError(ctx(), \"Repeated option\");\n    }\n\n    if (option.exclusiveOn) {\n      exclusiveOnOptions.push(option);\n    }\n\n    if (option.dependsOn) {\n      dependsOnOptions.push(option);\n    }\n\n    if (option.action) {\n      optionActions.push(option.action);\n    }\n\n    // Repeatable options are treated differently so we\n    // *have* to branch on this.\n    if (option.isRepeatable) {\n      const maxRepeat = option.isRepeatable === true ? Infinity : option.isRepeatable;\n      let arr = get(foundOptions, option.name);\n      if (!arr) {\n        arr = [];\n        setEach(foundOptions, option.name, arr);\n      }\n      if (arr.length >= maxRepeat) {\n        throw new ParseError(ctx(), \"Too many repetitions\");\n      }\n      arr.push(\"\");\n      return;\n    }\n\n    optionArgsMin = getMinArgs(option.args);\n    optionArgsMax = getMaxArgs(option.args);\n\n    optionArgs = [];\n    setEach(foundOptions, option.name, optionArgs);\n\n    if (optionArgsMax === 0) {\n      optionArgs = null;\n      state = State.ParseArgs;\n      return;\n    }\n\n    if (option.requiresSeparator) {\n      state = State.ParseOptionArgRequireSeparator;\n      requiredSeparator = option.requiresSeparator;\n    } else {\n      state = State.ParseOptionArgs;\n    }\n    return;\n  };\n\n  const parseArg = (token: BaseToken) => {\n    // If the final command requires a subcommand, providing too\n    // many arguments is allowed because the user has made a typo\n    // (they were intending to use a subcommand)\n    if (!path[path.length - 1].requiresSubcommand && foundArgs.length >= commandArgsMax) {\n      throw new TooManyArguments(token, ctx());\n    }\n    foundArgs.push(token.literal);\n  };\n\n  const parseArgSeparator = () => {\n    if (foundArgs.length >= commandArgsMax) {\n      throw new ParseError(\n        ctx(),\n        \"Unexpected argument '--', did you mean to use an option instead?\",\n      );\n    }\n    argSeparatorIndex = foundArgs.length;\n    state = State.ParseArgs;\n  };\n\n  const parseSubcommand = (token: TokenSubcommand<Subcommand>) => {\n    path.push(token.subcommand);\n    commandArgsMin = getMinArgs(token.subcommand.args);\n    commandArgsMax = getMaxArgs(token.subcommand.args);\n    if (token.subcommand.action) {\n      actions.push(token.subcommand.action);\n    } else if (token.subcommand.requiresSubcommand) {\n      actions.push(builtinUsageAction);\n    }\n  };\n\n  const ctx = () => ({ path }) as ErrorContext;\n\n  const { finalState, tokens } = analyze<Subcommand, Option>(input, spec);\n\n  for (const token of tokens) {\n    switch (state) {\n      case State.ParseArgs: {\n        switch (token.kind) {\n          case \"subcommand\": {\n            parseSubcommand(token);\n            break;\n          }\n          case \"arg\": {\n            parseArg(token);\n            break;\n          }\n          case \"option\": {\n            parseOption(token);\n            break;\n          }\n          case \"unknown-option\": {\n            throw new UnknownOption(token, ctx());\n          }\n          case \"option-arg\": {\n            throw new InvalidOptionArg(token, ctx());\n          }\n          case \"arg-separator\": {\n            parseArgSeparator();\n            break;\n          }\n          default: {\n            throw new ParseError(ctx(), \"Unreachable\");\n          }\n        }\n        break;\n      }\n      case State.ParseOptionArgs: {\n        assert(\n          Array.isArray(optionArgs),\n          \"Invalid state, must have an array to store option arguments\",\n        );\n        switch (token.kind) {\n          case \"option-arg\":\n          case \"arg\": {\n            if (optionArgs.length < optionArgsMax) {\n              optionArgs.push(token.literal);\n            } else {\n              optionArgs = null;\n              state = State.ParseArgs;\n              parseArg(token);\n            }\n            break;\n          }\n          case \"option\": {\n            if (optionArgs.length < optionArgsMin) {\n              throw new TooFewOptionArguments(optionArgsMin, optionArgsMax, ctx());\n            }\n            parseOption(token);\n            break;\n          }\n          case \"unknown-option\": {\n            if (optionArgs.length < optionArgsMax) {\n              optionArgs.push(token.literal);\n            } else {\n              throw new UnknownOption(token, ctx());\n            }\n            break;\n          }\n          case \"arg-separator\": {\n            if (optionArgs.length < optionArgsMin) {\n              throw new TooFewOptionArguments(optionArgsMin, optionArgsMax, ctx());\n            }\n            parseArgSeparator();\n            break;\n          }\n          case \"subcommand\": {\n            throw new ParseError(ctx(), \"Unexpected token\");\n          }\n          // The analyzer can't output a subcommand here, and if it does\n          // then that's an error anyway\n          default: {\n            throw new ParseError(ctx(), \"Unreachable\");\n          }\n        }\n        break;\n      }\n      case State.ParseOptionArgRequireSeparator: {\n        assert(\n          Array.isArray(optionArgs),\n          \"Invalid state, must have an array to store option arguments\",\n        );\n        assert(requiredSeparator, \"Invalid state, a separator must be set\");\n        switch (token.kind) {\n          case \"option-arg\": {\n            if (typeof requiredSeparator === \"string\" && token.separator !== requiredSeparator) {\n              throw new ParseError(\n                ctx(),\n                `Incorrect separator, use '${requiredSeparator}' instead of '${token.separator}'`,\n              );\n            }\n            // If this is true, we know thanks to the test suite that\n            // the option takes a minimum of one argument\n            optionArgs.push(token.literal);\n            state = State.ParseArgs;\n            break;\n          }\n          case \"arg\": {\n            if (optionArgsMin > 0) {\n              throw new TooFewOptionArguments(optionArgsMin, optionArgsMax, ctx());\n            }\n            optionArgs = null;\n            state = State.ParseArgs;\n            parseArg(token);\n            break;\n          }\n          case \"option\": {\n            if (optionArgsMin > 0) {\n              throw new TooFewOptionArguments(optionArgsMin, optionArgsMax, ctx());\n            }\n            parseOption(token);\n            break;\n          }\n          case \"unknown-option\": {\n            throw new UnknownOption(token, ctx());\n          }\n          case \"arg-separator\": {\n            throw new ParseError(ctx(), \"Unexpected token\");\n          }\n          case \"subcommand\": {\n            if (optionArgsMin > 0) {\n              throw new TooFewOptionArguments(optionArgsMin, optionArgsMax, ctx());\n            }\n            parseSubcommand(token);\n            state = State.ParseArgs;\n            break;\n          }\n          default: {\n            throw new ParseError(ctx(), \"Unreachable\");\n          }\n        }\n        break;\n      }\n    }\n  }\n\n  const hasOptionAction = optionActions.length > 0;\n\n  if (!hasOptionAction && foundArgs.length < commandArgsMin) {\n    throw new TooFewArguments(commandArgsMin, commandArgsMax, ctx());\n  }\n  if (optionArgs && optionArgs.length < optionArgsMin) {\n    throw new TooFewOptionArguments(optionArgsMin, optionArgsMax, ctx());\n  }\n\n  // Options in the `{depends,exclusive}On` arrays definitely have the\n  // corresponding array, so it's safe to assert non-null in this situation.\n  for (const option of dependsOnOptions) {\n    for (const name of option.dependsOn!) {\n      if (!foundOptions.has(name)) {\n        throw new ParseError(ctx(), `${option.name} requires ${name}, add it to fix this error`);\n      }\n    }\n  }\n  for (const option of exclusiveOnOptions) {\n    for (const name of option.exclusiveOn!) {\n      if (foundOptions.has(name)) {\n        throw new ParseError(ctx(), `${option.name} can't be used together with ${name}`);\n      }\n    }\n  }\n  if (!hasOptionAction) {\n    for (const name of finalState.localRequiredOptions.keys()) {\n      if (!foundOptions.has(name)) {\n        throw new MissingRequiredOption(name, ctx());\n      }\n    }\n    for (const name of finalState.persistentRequiredOptions.keys()) {\n      if (!foundOptions.has(name)) {\n        throw new MissingRequiredOption(name, ctx());\n      }\n    }\n  }\n\n  return {\n    path,\n    actions,\n    optionActions,\n    argSeparatorIndex,\n    args: foundArgs,\n    options: foundOptions,\n  };\n}\n","/**\n * Shell completion script generation.\n *\n * `getCompletion` walks a spec and renders a static completion script for a\n * supported shell. The `completion` subcommand wires this into a CLI the same\n * way `helpCommand` wires in help: drop it into `subcommands` and users get\n * `mycli completion <shell>`.\n *\n * Every renderer uses the same shape: descend through the typed subcommand\n * tokens to a stable \"node key\", then offer that node's candidate tokens\n * (subcommands + options). Options and subcommands inherited from ancestors\n * (persistent options) are resolved during the walk.\n *\n * Argument values are completed from the Fig-style metadata on a option's first\n * argument: `template` (file/folder paths), static `suggestions`, and dynamic\n * `generators`. A dynamic generator is run by re-invoking the CLI's hidden\n * `completion generate-suggestions <location>` command, where `<location>` is a\n * base64-encoded pointer to the generator inside the spec.\n *\n * @module\n */\n\nimport type { Arg, Option, Generator, Spec, Subcommand, Template } from \"./types.js\";\nimport { asArray, makeArray, print, printActionError } from \"./util.js\";\nimport { analyze } from \"./analyze.js\";\nimport { getMaxArgs } from \"./parse.js\";\n\n/** Shells that {@link getCompletion} can generate scripts for. */\nexport type Shell = \"bash\" | \"zsh\" | \"fish\";\n\n/** How a completion script resolves candidates. */\nexport type Mode = \"runtime\" | \"shell\";\n\nexport const SHELLS: readonly Shell[] = [\"bash\", \"zsh\", \"fish\"];\n\nfunction isShell(value: string): value is Shell {\n  return (SHELLS as readonly string[]).includes(value);\n}\n\n/** A pointer to a generator inside the spec, carried through base64. */\ninterface Location {\n  /** Subcommand tokens (primary names) from the root to the command. */\n  path: string[];\n  /** Owning option's name, or omitted for a positional argument. */\n  option?: string;\n  /** Index into the option's (or command's) args. */\n  argIndex: number;\n  /** Index into that argument's generators. */\n  genIndex: number;\n}\n\n/** Completion behavior derived from an argument's Fig-style metadata. */\ninterface ArgComplete {\n  template?: Template;\n  /** Static suggestion values (already flattened to insertable strings). */\n  staticValues: string[];\n  /** base64 location of the first `custom` generator, if any. */\n  customLocation?: string;\n}\n\ninterface OptionInfo {\n  /** Every alias of the option, e.g. `[\"-v\", \"--verbose\"]`. */\n  tokens: string[];\n  description: string;\n  takesArg: boolean;\n  argComplete?: ArgComplete;\n}\n\ninterface SubInfo {\n  /** Every alias of the child subcommand. */\n  tokens: string[];\n  description: string;\n}\n\ninterface Node {\n  /** Stable key identifying this command's position in the tree. */\n  key: string;\n  /** Subcommand tokens (primary names) from the root to this command. */\n  path: string[];\n  subcommands: SubInfo[];\n  options: OptionInfo[];\n  /** Completion for the command's positional argument, if any. */\n  positional?: ArgComplete;\n  /** One entry per child alias, mapping a typed token to the child's key. */\n  transitions: { token: string; childKey: string }[];\n}\n\nconst firstLine = (description: string | undefined): string =>\n  description ? description.split(\"\\n\", 1)[0].trim() : \"\";\n\n/** Turn an arbitrary name into a safe shell identifier fragment. */\nconst sanitize = (value: string): string => value.replace(/[^A-Za-z0-9]+/g, \"_\");\n\n// base64(JSON) location encoding {{{\n\nfunction encodeLocation(location: Location): string {\n  const bytes = new TextEncoder().encode(JSON.stringify(location));\n  let binary = \"\";\n  for (const byte of bytes) binary += String.fromCharCode(byte);\n  return btoa(binary);\n}\n\nfunction decodeLocation(encoded: string): Location {\n  const binary = atob(encoded);\n  const bytes = Uint8Array.from(binary, (char) => char.charCodeAt(0));\n  return JSON.parse(new TextDecoder().decode(bytes)) as Location;\n}\n\n// }}}\n\n/** Build {@link ArgComplete} for one argument at a known spec location. */\nfunction argCompleteFor(arg: Arg, location: Omit<Location, \"genIndex\">): ArgComplete | undefined {\n  const staticValues = (arg.suggestions ?? []).map((suggestion) =>\n    typeof suggestion === \"string\" ? suggestion : makeArray(suggestion.name)[0],\n  );\n\n  const generators = makeArray(arg.generators);\n  const genIndex = generators.findIndex((generator) => generator.custom);\n  const customLocation = genIndex >= 0 ? encodeLocation({ ...location, genIndex }) : undefined;\n\n  if (!arg.template && staticValues.length === 0 && !customLocation) {\n    return undefined;\n  }\n  return { template: arg.template, staticValues, customLocation };\n}\n\n/** Completion for a option's first argument, if it has any metadata. */\nfunction optionArgComplete(option: Option, path: string[]): ArgComplete | undefined {\n  const arg = asArray(option.args)[0] as Arg | undefined;\n  if (!arg) return undefined;\n  return argCompleteFor(arg, { path, option: makeArray(option.name)[0], argIndex: 0 });\n}\n\n/** Completion for a command's first positional arg that has metadata. */\nfunction positionalComplete(command: Subcommand, path: string[]): ArgComplete | undefined {\n  const args = asArray(command.args) as Arg[];\n  for (let index = 0; index < args.length; index += 1) {\n    const ac = argCompleteFor(args[index], { path, argIndex: index });\n    if (ac) return ac;\n  }\n  return undefined;\n}\n\nfunction toOptionInfo(option: Option, path: string[]): OptionInfo {\n  return {\n    tokens: makeArray(option.name),\n    description: firstLine(option.description),\n    takesArg: asArray(option.args).length > 0,\n    argComplete: optionArgComplete(option, path),\n  };\n}\n\n/**\n * Flatten the spec into a list of command nodes. Hidden options and subcommands\n * are excluded; persistent options are propagated to descendants.\n */\nfunction walk(spec: Spec): Node[] {\n  const nodes: Node[] = [];\n\n  const recurse = (\n    command: Subcommand,\n    key: string,\n    path: string[],\n    inheritedPersistent: Option[],\n  ): void => {\n    const ownOptions = (command.options ?? []).filter((option) => !option.hidden);\n    const children = (command.subcommands ?? []).filter((sub) => !sub.hidden);\n\n    const node: Node = {\n      key,\n      path,\n      subcommands: [],\n      options: [...inheritedPersistent, ...ownOptions].map((option) => toOptionInfo(option, path)),\n      positional: positionalComplete(command, path),\n      transitions: [],\n    };\n\n    const childPersistent = [\n      ...inheritedPersistent,\n      ...ownOptions.filter((option) => option.isPersistent),\n    ];\n\n    for (const child of children) {\n      const tokens = makeArray(child.name);\n      const childKey = `${key}_${sanitize(tokens[0])}`;\n      node.subcommands.push({\n        tokens,\n        description: firstLine(child.description),\n      });\n      for (const token of tokens) {\n        node.transitions.push({ token, childKey });\n      }\n      recurse(child, childKey, [...path, tokens[0]], childPersistent);\n    }\n\n    nodes.push(node);\n  };\n\n  recurse(spec as unknown as Subcommand, \"cmd\", [], []);\n  return nodes;\n}\n\n/** Single-quote a string for bash/zsh. */\nfunction shQuote(value: string): string {\n  return `'${value.replaceAll(\"'\", \"'\\\\''\")}'`;\n}\n\n/** Single-quote a string for fish (only `\\` and `'` are special). */\nfunction fishQuote(value: string): string {\n  return `'${value.replaceAll(\"\\\\\", \"\\\\\\\\\").replaceAll(\"'\", \"\\\\'\")}'`;\n}\n\n/** Every candidate token offered at a node (subcommand aliases + option aliases). */\nfunction candidateTokens(node: Node): string[] {\n  const tokens: string[] = [];\n  for (const sub of node.subcommands) tokens.push(...sub.tokens);\n  for (const option of node.options) tokens.push(...option.tokens);\n  return tokens;\n}\n\nfunction renderTransitionCases(nodes: Node[], indent: string): string[] {\n  const lines: string[] = [];\n  for (const node of nodes) {\n    for (const { token, childKey } of node.transitions) {\n      lines.push(`${indent}${shQuote(`${node.key}::${token}`)}) cmd=${shQuote(childKey)} ;;`);\n    }\n  }\n  return lines;\n}\n\n// bash {{{\n\n/**\n * bash candidate lines for an arg. `append` keeps existing COMPREPLY (for a\n * positional, which coexists with subcommands/options); otherwise it replaces.\n * The generator callback uses the typed command and is guarded for resilience.\n */\nfunction bashArgLines(ac: ArgComplete, indent: string, append: boolean): string[] {\n  const lines: string[] = [];\n  const op = append ? \"COMPREPLY+=\" : \"COMPREPLY=\";\n  const hasWords = ac.staticValues.length > 0 || ac.customLocation !== undefined;\n\n  if (hasWords) {\n    lines.push(\n      `${indent}local words=${\n        ac.staticValues.length > 0 ? shQuote(ac.staticValues.join(\" \")) : '\"\"'\n      }`,\n    );\n    if (ac.customLocation) {\n      lines.push(`${indent}if command -v \"\\${COMP_WORDS[0]}\" >/dev/null 2>&1; then`);\n      lines.push(\n        `${indent}  words=\"$words $(\"\\${COMP_WORDS[0]}\" completion generate-suggestions ${shQuote(ac.customLocation)} -- \"\\${COMP_WORDS[@]:1}\" 2>/dev/null)\"`,\n      );\n      lines.push(`${indent}fi`);\n    }\n    lines.push(`${indent}${op}( $(compgen -W \"$words\" -- \"$cur\") )`);\n  }\n  if (ac.template) {\n    const option = ac.template === \"folders\" ? \"-d\" : \"-f\";\n    const fileOp = hasWords || append ? \"COMPREPLY+=\" : \"COMPREPLY=\";\n    lines.push(`${indent}${fileOp}( $(compgen ${option} -- \"$cur\") )`);\n  }\n  return lines;\n}\n\nfunction renderBash(spec: Spec, nodes: Node[]): string {\n  const id = sanitize(spec.name);\n  const lines: string[] = [];\n\n  lines.push(`_${id}() {`);\n  lines.push(`  local cur=\"\\${COMP_WORDS[COMP_CWORD]}\"`);\n  lines.push(`  local prev=\"\\${COMP_WORDS[COMP_CWORD-1]}\"`);\n  lines.push(`  local cmd=\"cmd\" i w`);\n  lines.push(`  for (( i=1; i < COMP_CWORD; i++ )); do`);\n  lines.push(`    w=\"\\${COMP_WORDS[i]}\"`);\n  lines.push(`    case \"$w\" in -* ) continue ;; esac`);\n  lines.push(`    case \"\\${cmd}::\\${w}\" in`);\n  lines.push(...renderTransitionCases(nodes, \"      \"));\n  lines.push(`    esac`);\n  lines.push(`  done`);\n\n  // Option-argument completion, scoped to the command context + option token.\n  const argCases: string[] = [];\n  for (const node of nodes) {\n    for (const option of node.options) {\n      if (!option.argComplete) continue;\n      for (const token of option.tokens) {\n        argCases.push(`    ${shQuote(`${node.key}::${token}`)})`);\n        argCases.push(...bashArgLines(option.argComplete, \"      \", false));\n        argCases.push(`      return ;;`);\n      }\n    }\n  }\n  if (argCases.length > 0) {\n    lines.push(`  case \"\\${cmd}::\\${prev}\" in`);\n    lines.push(...argCases);\n    lines.push(`  esac`);\n  }\n\n  lines.push(`  local opts=\"\"`);\n  lines.push(`  case \"$cmd\" in`);\n  for (const node of nodes) {\n    lines.push(`    ${shQuote(node.key)}) opts=${shQuote(candidateTokens(node).join(\" \"))} ;;`);\n  }\n  lines.push(`  esac`);\n  lines.push(`  COMPREPLY=( $(compgen -W \"$opts\" -- \"$cur\") )`);\n\n  // Positional values are offered alongside subcommands/options.\n  const posCases: string[] = [];\n  for (const node of nodes) {\n    if (!node.positional) continue;\n    posCases.push(`    ${shQuote(node.key)})`);\n    posCases.push(...bashArgLines(node.positional, \"      \", true));\n    posCases.push(`      ;;`);\n  }\n  if (posCases.length > 0) {\n    lines.push(`  case \"$cmd\" in`);\n    lines.push(...posCases);\n    lines.push(`  esac`);\n  }\n\n  lines.push(`}`);\n  lines.push(`complete -F _${id} ${shQuote(spec.name)}`);\n  return lines.join(\"\\n\");\n}\n\n// }}}\n\n// zsh {{{\n\n/** zsh candidate lines for an arg (used for both option values and positionals). */\nfunction zshArgLines(ac: ArgComplete, indent: string): string[] {\n  const lines: string[] = [];\n  const hasVals = ac.staticValues.length > 0 || ac.customLocation !== undefined;\n\n  if (hasVals) {\n    lines.push(`${indent}local -a vals`);\n    lines.push(`${indent}vals=( ${ac.staticValues.map(shQuote).join(\" \")} )`);\n    if (ac.customLocation) {\n      // Typed command, guarded so a missing binary doesn't error.\n      lines.push(`${indent}if command -v \"$words[1]\" >/dev/null 2>&1; then`);\n      lines.push(\n        `${indent}  vals+=( \\${(f)\"$(\"$words[1]\" completion generate-suggestions ${shQuote(ac.customLocation)} -- \\${words[2,-1]} 2>/dev/null)\"} )`,\n      );\n      lines.push(`${indent}fi`);\n    }\n    lines.push(`${indent}compadd -a vals`);\n  }\n  if (ac.template) {\n    lines.push(`${indent}${ac.template === \"folders\" ? \"_files -/\" : \"_files\"}`);\n  }\n  return lines;\n}\n\nfunction renderZsh(spec: Spec, nodes: Node[]): string {\n  const id = sanitize(spec.name);\n  const lines: string[] = [];\n\n  lines.push(`#compdef ${spec.name}`);\n  lines.push(`_${id}() {`);\n  lines.push(`  local cmd=cmd i w prev`);\n  lines.push(`  for (( i=2; i < CURRENT; i++ )); do`);\n  lines.push(`    w=\"\\${words[i]}\"`);\n  lines.push(`    case \"$w\" in -* ) continue ;; esac`);\n  lines.push(`    case \"\\${cmd}::\\${w}\" in`);\n  lines.push(...renderTransitionCases(nodes, \"      \"));\n  lines.push(`    esac`);\n  lines.push(`  done`);\n  lines.push(`  prev=\"\\${words[CURRENT-1]}\"`);\n\n  const argCases: string[] = [];\n  for (const node of nodes) {\n    for (const option of node.options) {\n      if (!option.argComplete) continue;\n      for (const token of option.tokens) {\n        argCases.push(`    ${shQuote(`${node.key}::${token}`)})`);\n        argCases.push(...zshArgLines(option.argComplete, \"      \"));\n        argCases.push(`      return ;;`);\n      }\n    }\n  }\n  if (argCases.length > 0) {\n    lines.push(`  case \"\\${cmd}::\\${prev}\" in`);\n    lines.push(...argCases);\n    lines.push(`  esac`);\n  }\n\n  lines.push(`  local -a opts`);\n  lines.push(`  case \"$cmd\" in`);\n  for (const node of nodes) {\n    const entries: string[] = [];\n    for (const sub of node.subcommands) {\n      for (const token of sub.tokens) {\n        entries.push(shQuote(`${token}:${sub.description}`));\n      }\n    }\n    for (const option of node.options) {\n      for (const token of option.tokens) {\n        entries.push(shQuote(`${token}:${option.description}`));\n      }\n    }\n    lines.push(`    ${shQuote(node.key)}) opts=( ${entries.join(\" \")} ) ;;`);\n  }\n  lines.push(`  esac`);\n  lines.push(`  _describe -t values ${shQuote(spec.name)} opts`);\n\n  // Positional values, offered after the subcommand/option list.\n  const posCases: string[] = [];\n  for (const node of nodes) {\n    if (!node.positional) continue;\n    posCases.push(`    ${shQuote(node.key)})`);\n    posCases.push(...zshArgLines(node.positional, \"      \"));\n    posCases.push(`      ;;`);\n  }\n  if (posCases.length > 0) {\n    lines.push(`  case \"$cmd\" in`);\n    lines.push(...posCases);\n    lines.push(`  esac`);\n  }\n\n  lines.push(`}`);\n  lines.push(`_${id} \"$@\"`);\n  return lines.join(\"\\n\");\n}\n\n// }}}\n\n// fish {{{\n\n/** Build the fish `complete` option selectors (`-s x`, `-l long`, `-o old`). */\nfunction fishOptionSelectors(tokens: string[]): string {\n  const parts: string[] = [];\n  for (const token of tokens) {\n    if (token.startsWith(\"--\")) {\n      parts.push(`-l ${fishQuote(token.slice(2))}`);\n    } else if (token.startsWith(\"-\") && token.length === 2) {\n      parts.push(`-s ${fishQuote(token.slice(1))}`);\n    } else if (token.startsWith(\"-\") && token.length > 2) {\n      parts.push(`-o ${fishQuote(token.slice(1))}`);\n    } else {\n      // POSIX-noncompliant option (no leading dash): offer it as a plain value.\n      parts.push(`-a ${fishQuote(token)}`);\n    }\n  }\n  return parts.join(\" \");\n}\n\n/** A guarded fish command substitution that runs a generator by location. */\nfunction fishGuardedCallback(location: string): string {\n  // `command -q` only searches PATH, so also accept a runnable path (./cli).\n  return `(set -l c (commandline -opc)[1]; if command -q -- $c; or test -x \"$c\"; $c completion generate-suggestions ${location} -- (commandline -opc) 2>/dev/null; end)`;\n}\n\n/** The `-a` candidate bits and whether the shell's file completion is wanted. */\nfunction fishValueBits(ac: ArgComplete): { aBits: string; wantsFiles: boolean } {\n  const parts: string[] = [...ac.staticValues];\n  if (ac.template === \"folders\" || Array.isArray(ac.template)) {\n    parts.push(\"(__fish_complete_directories)\");\n  }\n  if (ac.customLocation) parts.push(fishGuardedCallback(ac.customLocation));\n  const aBits = parts.length > 0 ? ` -a ${fishQuote(parts.join(\" \"))}` : \"\";\n  const wantsFiles = ac.template === \"filepaths\" || Array.isArray(ac.template);\n  return { aBits, wantsFiles };\n}\n\n/**\n * The suffix after a option's selectors. Uses `-x` (exclusive: requires a value\n * and suppresses fish's file fallback) when the arg has its own candidates and\n * isn't a filepaths template; `-r` lets files through when they're wanted.\n */\nfunction fishOptionArgSuffix(option: OptionInfo): string {\n  if (!option.takesArg) return \"\";\n  if (!option.argComplete) return \" -r\"; // takes a value, no metadata: native files\n  const { aBits, wantsFiles } = fishValueBits(option.argComplete);\n  return `${wantsFiles ? \" -r\" : \" -x\"}${aBits}`;\n}\n\nfunction renderFish(spec: Spec, nodes: Node[]): string {\n  const id = sanitize(spec.name);\n  const name = spec.name;\n  const lines: string[] = [];\n\n  lines.push(`function __fish_${id}_at`);\n  lines.push(`  set -l cmd cmd`);\n  lines.push(`  set -l toks (commandline -opc)`);\n  lines.push(`  for w in $toks[2..-1]`);\n  lines.push(`    if string match -qr '^-' -- $w`);\n  lines.push(`      continue`);\n  lines.push(`    end`);\n  lines.push(`    switch \"$cmd $w\"`);\n  for (const node of nodes) {\n    for (const { token, childKey } of node.transitions) {\n      lines.push(`      case ${fishQuote(`${node.key} ${token}`)}`);\n      lines.push(`        set cmd ${fishQuote(childKey)}`);\n    }\n  }\n  lines.push(`    end`);\n  lines.push(`  end`);\n  lines.push(`  test \"$cmd\" = \"$argv[1]\"`);\n  lines.push(`end`);\n  lines.push(\"\");\n  // Disable fallback filename completion; commands re-enable it per arg later.\n  lines.push(`complete -c ${fishQuote(name)} -f`);\n  for (const node of nodes) {\n    const guard = `-n ${fishQuote(`__fish_${id}_at ${node.key}`)}`;\n    for (const sub of node.subcommands) {\n      for (const token of sub.tokens) {\n        const desc = sub.description ? ` -d ${fishQuote(sub.description)}` : \"\";\n        lines.push(`complete -c ${fishQuote(name)} ${guard} -a ${fishQuote(token)}${desc}`);\n      }\n    }\n    for (const option of node.options) {\n      const desc = option.description ? ` -d ${fishQuote(option.description)}` : \"\";\n      const suffix = fishOptionArgSuffix(option);\n      lines.push(\n        `complete -c ${fishQuote(name)} ${guard} ${fishOptionSelectors(option.tokens)}${suffix}${desc}`,\n      );\n    }\n    // Positional value completion (global `-f` keeps files out unless -F).\n    if (node.positional) {\n      const { aBits, wantsFiles } = fishValueBits(node.positional);\n      lines.push(`complete -c ${fishQuote(name)} ${guard}${aBits}${wantsFiles ? \" -F\" : \"\"}`);\n    }\n  }\n  return lines.join(\"\\n\");\n}\n\n// }}}\n\n// Runtime resolver {{{\n\n/** A single completion candidate. */\ninterface Candidate {\n  value: string;\n  description?: string;\n}\n\n/**\n * The completion-relevant state of a partial command line, derived by reusing\n * `analyze` (which already handles `--`, separators, prefix-matching, and\n * posix-noncompliance) plus a small non-throwing pass for option-arg consumption\n * and positional counting.\n */\ninterface CompletionState {\n  /** Commands from the root to the current one. */\n  path: Subcommand[];\n  current: Subcommand;\n  /** Options usable at the current command (own + inherited persistent). */\n  availableOptions: Option[];\n  /** A option still expecting a separate-token value, or null. */\n  pending: { option: Option; argIndex: number } | null;\n  /** Positional args already consumed by the current command. */\n  positionalIndex: number;\n  /** Option names already present on the line. */\n  presentNames: Set<string>;\n  /** Times each option object has appeared. */\n  countByOption: Map<Option, number>;\n  /** A `--` separator was seen; only positionals follow. */\n  forceArgs: boolean;\n  /** A positional has been consumed by the current command. */\n  sawPositional: boolean;\n  /** A non-persistent option has been used (blocks subcommand matching). */\n  usedNonPersistentOption: boolean;\n}\n\nfunction analyzeState(spec: Spec, before: readonly string[]): CompletionState {\n  const { tokens, finalState } = analyze<Subcommand, Option>(before, spec);\n\n  const path: Subcommand[] = [spec as unknown as Subcommand];\n  let current: Subcommand = spec as unknown as Subcommand;\n  let pending: CompletionState[\"pending\"] = null;\n  let pendingFilled = 0;\n  let pendingMax = 0;\n  let positionalIndex = 0;\n  let forceArgs = false;\n  let sawPositional = false;\n  let usedNonPersistentOption = false;\n  const presentNames = new Set<string>();\n  const countByOption = new Map<Option, number>();\n\n  for (const token of tokens) {\n    switch (token.kind) {\n      case \"subcommand\": {\n        current = token.subcommand;\n        path.push(current);\n        positionalIndex = 0;\n        sawPositional = false;\n        pending = null;\n        break;\n      }\n      case \"option\": {\n        const option = token.option;\n        for (const name of makeArray(option.name)) presentNames.add(name);\n        countByOption.set(option, (countByOption.get(option) ?? 0) + 1);\n        if (!option.isPersistent) usedNonPersistentOption = true;\n        const max = getMaxArgs(option.args);\n        // requiresSeparator options only take an attached value, never a\n        // following separate token, so they never leave a pending value.\n        if (max > 0 && !option.requiresSeparator) {\n          pending = { option, argIndex: 0 };\n          pendingFilled = 0;\n          pendingMax = max;\n        } else {\n          pending = null;\n        }\n        break;\n      }\n      case \"option-arg\": {\n        // An attached value (`--option=v`, `-fv`) satisfies the preceding option.\n        pending = null;\n        break;\n      }\n      case \"arg\": {\n        if (pending && pendingFilled < pendingMax) {\n          pendingFilled += 1;\n          pending = { option: pending.option, argIndex: pendingFilled };\n          if (pendingFilled >= pendingMax) pending = null;\n        } else {\n          positionalIndex += 1;\n          sawPositional = true;\n          pending = null;\n        }\n        break;\n      }\n      case \"arg-separator\": {\n        forceArgs = true;\n        pending = null;\n        break;\n      }\n      case \"unknown-option\": {\n        pending = null;\n        break;\n      }\n    }\n  }\n\n  const availableOptions: Option[] = [];\n  const seen = new Set<Option>();\n  for (const map of [finalState.localOptions, finalState.persistentOptions]) {\n    for (const option of map.values()) {\n      if (!seen.has(option)) {\n        seen.add(option);\n        availableOptions.push(option);\n      }\n    }\n  }\n\n  return {\n    path,\n    current,\n    availableOptions,\n    pending,\n    positionalIndex,\n    presentNames,\n    countByOption,\n    forceArgs,\n    sawPositional,\n    usedNonPersistentOption,\n  };\n}\n\n/** Does any command on the path enable a sticky parser directive? */\nfunction directiveOnPath(\n  path: readonly Subcommand[],\n  key: \"optionsMustPrecedeArguments\" | \"flagsArePosixNoncompliant\",\n): boolean {\n  return path.some((command) => command.parserDirectives?.[key]);\n}\n\n/** The option-arg separators in effect (the deepest command that sets them). */\nfunction separatorsOnPath(path: readonly Subcommand[]): string[] {\n  let separators = [\"=\"];\n  for (const command of path) {\n    const configured = command.parserDirectives?.optionArgSeparators;\n    if (configured) separators = makeArray(configured);\n  }\n  return separators;\n}\n\n/** Enumerate filesystem entries matching `partial` for a path template. */\nasync function enumeratePaths(partial: string, template: Template): Promise<Candidate[]> {\n  // Imported through a variable so the Node-free `src` build doesn't need\n  // @types/node; this only runs inside the (Node-only) completion runtime.\n  const specifier = \"node:fs\";\n  const { readdirSync } = (await import(specifier)) as {\n    readdirSync(\n      path: string,\n      options: { withFileTypes: true },\n    ): { name: string; isDirectory(): boolean }[];\n  };\n  const slash = partial.lastIndexOf(\"/\");\n  const dir = slash >= 0 ? partial.slice(0, slash + 1) : \"\";\n  const base = slash >= 0 ? partial.slice(slash + 1) : partial;\n  const foldersOnly = template === \"folders\";\n  let entries: { name: string; isDirectory(): boolean }[];\n  try {\n    entries = readdirSync(dir || \".\", { withFileTypes: true });\n  } catch {\n    return [];\n  }\n  const candidates: Candidate[] = [];\n  for (const entry of entries as { name: string; isDirectory(): boolean }[]) {\n    if (!entry.name.startsWith(base)) continue;\n    const isDir = entry.isDirectory();\n    if (foldersOnly && !isDir) continue;\n    candidates.push({ value: `${dir}${entry.name}${isDir ? \"/\" : \"\"}` });\n  }\n  return candidates;\n}\n\n/** All candidate values for a single argument (suggestions/generators/template). */\nasync function argValues(arg: Arg, tokens: string[], partial: string): Promise<Candidate[]> {\n  const candidates: Candidate[] = [];\n\n  for (const suggestion of arg.suggestions ?? []) {\n    candidates.push(\n      typeof suggestion === \"string\"\n        ? { value: suggestion }\n        : { value: makeArray(suggestion.name)[0], description: suggestion.description },\n    );\n  }\n\n  for (const generator of makeArray(arg.generators)) {\n    if (!generator.custom) continue;\n    const produced = await generator.custom([...tokens, partial]);\n    for (const suggestion of produced) {\n      candidates.push(\n        typeof suggestion === \"string\"\n          ? { value: suggestion }\n          : { value: makeArray(suggestion.name)[0], description: suggestion.description },\n      );\n    }\n  }\n\n  if (arg.template) {\n    candidates.push(...(await enumeratePaths(partial, arg.template)));\n  }\n\n  return candidates;\n}\n\n/** Pick the argument being completed at a positional index (honors variadic). */\nfunction positionalArg(command: Subcommand, index: number): Arg | undefined {\n  const args = asArray(command.args) as readonly Arg[];\n  if (args.length === 0) return undefined;\n  if (index < args.length) return args[index];\n  const last = args[args.length - 1];\n  return last?.isVariadic ? last : undefined;\n}\n\n/** Inputs for the runtime completion resolver. */\nexport interface CompletionRequest {\n  spec: Spec;\n  /** Tokens after the program name, excluding the word being completed. */\n  before: readonly string[];\n  /** The word being completed. */\n  partial: string;\n  /** Only offer options once the word being completed starts with a dash. */\n  gateOptions?: boolean;\n}\n\n/**\n * Resolve completion candidates for a partial command line, reusing the parser\n * (`analyze`) for context. Dispatches between completing a option's value and\n * completing a fresh token (subcommand / positional / option).\n */\nexport async function completeRuntime(req: CompletionRequest): Promise<Candidate[]> {\n  const state = analyzeState(req.spec, req.before);\n  const separators = separatorsOnPath(state.path);\n\n  const optionValue = await resolveOptionValue(state, req, separators);\n  if (optionValue) return optionValue;\n\n  return freshTokenCandidates(state, req, separators);\n}\n\n/**\n * Candidates when the word being completed is a option's value — either attached\n * (`--option=value`) or the separate token after a option that expects one. Returns\n * null when no option value is being completed.\n */\nasync function resolveOptionValue(\n  state: CompletionState,\n  req: CompletionRequest,\n  separators: string[],\n): Promise<Candidate[] | null> {\n  const tokens = [...req.before];\n\n  // `--option<sep>value`: the partial already carries a separator.\n  for (const separator of separators) {\n    const at = req.partial.indexOf(separator);\n    if (at <= 0) continue;\n    const optionName = req.partial.slice(0, at);\n    const option = state.availableOptions.find((candidate) =>\n      makeArray(candidate.name).includes(optionName),\n    );\n    const arg = option && (asArray(option.args) as Arg[])[0];\n    if (option && arg) {\n      const valuePrefix = req.partial.slice(at + separator.length);\n      const values = await argValues(arg, tokens, valuePrefix);\n      return values.map((candidate) => ({\n        value: `${optionName}${separator}${candidate.value}`,\n        description: candidate.description,\n      }));\n    }\n  }\n\n  // The separate-token value of a option that expects one.\n  if (state.pending) {\n    const arg = (asArray(state.pending.option.args) as Arg[])[state.pending.argIndex];\n    return arg ? argValues(arg, tokens, req.partial) : [];\n  }\n\n  return null;\n}\n\n/** Candidates when completing a fresh token: subcommand / positional / option. */\nasync function freshTokenCandidates(\n  state: CompletionState,\n  req: CompletionRequest,\n  separators: string[],\n): Promise<Candidate[]> {\n  const candidates: Candidate[] = [];\n  const tokens = [...req.before];\n\n  const posixNoncompliant = directiveOnPath(state.path, \"flagsArePosixNoncompliant\");\n  const partialIsOption =\n    !posixNoncompliant && (req.partial.startsWith(\"-\") || req.partial.startsWith(\"+\"));\n  // When gating, a dashed word completes options only; everything else completes\n  // commands/positionals. Posix-noncompliant options have no dash, so they're\n  // exempt and always offered alongside the other candidates.\n  const wantValues = !(req.gateOptions && partialIsOption);\n  const wantOptions = !req.gateOptions || partialIsOption || posixNoncompliant;\n\n  if (wantValues) {\n    const positional = positionalArg(state.current, state.positionalIndex);\n    if (positional) {\n      candidates.push(...(await argValues(positional, tokens, req.partial)));\n    }\n    // After `--`, only positionals are valid.\n    if (state.forceArgs) return candidates;\n\n    // Subcommands — only while the parser would still match one.\n    if (!state.sawPositional && !state.usedNonPersistentOption) {\n      for (const sub of state.current.subcommands ?? []) {\n        if (sub.hidden) continue;\n        const description = firstLine(sub.description);\n        for (const token of makeArray(sub.name)) {\n          candidates.push({ value: token, description });\n        }\n      }\n    }\n  } else if (state.forceArgs) {\n    // A dashed token after `--` is a literal argument, not a option.\n    return candidates;\n  }\n\n  // Options — unless they must precede arguments and one was already seen.\n  const optionsBlocked =\n    state.sawPositional && directiveOnPath(state.path, \"optionsMustPrecedeArguments\");\n  if (wantOptions && !optionsBlocked) {\n    candidates.push(...optionCandidates(state, separators));\n  }\n\n  return candidates;\n}\n\n/** Eligible option candidates after relationship filtering. */\nfunction optionCandidates(state: CompletionState, separators: string[]): Candidate[] {\n  const required: Candidate[] = [];\n  const optional: Candidate[] = [];\n\n  for (const option of state.availableOptions) {\n    if (option.hidden) continue;\n\n    // Repeatable limits: drop a option that can't appear again.\n    const count = state.countByOption.get(option) ?? 0;\n    if (count > 0) {\n      if (!option.isRepeatable) continue;\n      if (typeof option.isRepeatable === \"number\" && count >= option.isRepeatable) {\n        continue;\n      }\n    }\n\n    // Mutual exclusion, both directions.\n    if (option.exclusiveOn?.some((name) => state.presentNames.has(name))) continue;\n    const conflicts = state.availableOptions.some(\n      (other) =>\n        other !== option &&\n        makeArray(other.name).some((name) => state.presentNames.has(name)) &&\n        other.exclusiveOn?.some((name) => makeArray(option.name).includes(name)),\n    );\n    if (conflicts) continue;\n\n    let description = firstLine(option.description);\n    if (option.dependsOn) {\n      const needs = option.dependsOn.join(\", \");\n      description = description ? `${description} (requires ${needs})` : `requires ${needs}`;\n    }\n    if (option.isRequired) {\n      description = description ? `${description} [required]` : \"[required]\";\n    }\n\n    // requiresSeparator options can only take an attached value, so offer the\n    // separator form so the next Tab completes the value.\n    const sep =\n      option.requiresSeparator === true\n        ? separators[0]\n        : typeof option.requiresSeparator === \"string\"\n          ? option.requiresSeparator\n          : undefined;\n\n    const bucket = option.isRequired ? required : optional;\n    for (const token of makeArray(option.name)) {\n      bucket.push({ value: sep ? `${token}${sep}` : token, description });\n    }\n  }\n\n  return [...required, ...optional];\n}\n\n/**\n * Render the thin shim that forwards the line to `completion complete`. The\n * binary is invoked as typed (so `./pack` works) and guarded so a missing\n * command degrades to no completion instead of an error.\n */\nfunction renderRuntimeShim(spec: Spec, shell: Shell): string {\n  const id = sanitize(spec.name);\n  const name = spec.name;\n  if (shell === \"bash\") {\n    return [\n      `_${id}_complete() {`,\n      `  local bin=\"\\${COMP_WORDS[0]}\"`,\n      `  command -v \"$bin\" >/dev/null 2>&1 || return`,\n      `  local cur=\"\\${COMP_WORDS[COMP_CWORD]}\"`,\n      `  local out`,\n      `  out=\"$(\"$bin\" completion complete --gate-options -- \"\\${COMP_WORDS[@]:1:COMP_CWORD-1}\" \"$cur\" 2>/dev/null | cut -f1)\"`,\n      `  local IFS=$'\\\\n'`,\n      `  COMPREPLY=( $(compgen -W \"$out\" -- \"$cur\") )`,\n      `}`,\n      `complete -F _${id}_complete ${shQuote(name)}`,\n    ].join(\"\\n\");\n  }\n  if (shell === \"zsh\") {\n    return [\n      `#compdef ${name}`,\n      `_${id}_complete() {`,\n      `  local bin=\"$words[1]\"`,\n      `  command -v \"$bin\" >/dev/null 2>&1 || return`,\n      `  local -a lines`,\n      `  lines=( \"\\${(@f)$(\"$bin\" completion complete -- \"\\${words[2,CURRENT-1]}\" \"\\${words[CURRENT]}\" 2>/dev/null)}\" )`,\n      `  local -a disp`,\n      `  local line`,\n      `  for line in $lines; do disp+=( \"\\${line//$'\\\\t'/:}\" ); done`,\n      `  _describe -t values ${shQuote(name)} disp`,\n      `}`,\n      `_${id}_complete \"$@\"`,\n    ].join(\"\\n\");\n  }\n  // fish\n  return [\n    `function __${id}_complete`,\n    `  set -l toks (commandline -opc)`,\n    `  set -l cur (commandline -ct)`,\n    `  set -l bin $toks[1]`,\n    `  command -q -- $bin; or test -x \"$bin\"; or return`,\n    `  $bin completion complete --gate-options -- $toks[2..-1] $cur 2>/dev/null`,\n    `end`,\n    `complete -c ${fishQuote(name)} -f -a '(__${id}_complete)'`,\n  ].join(\"\\n\");\n}\n\n// }}}\n\n/** Generate a completion script for `shell` from a CLI spec. */\nexport function getCompletion(spec: Spec, shell: Shell, mode: Mode = \"runtime\"): string {\n  if (mode === \"runtime\") return renderRuntimeShim(spec, shell);\n  const nodes = walk(spec);\n  switch (shell) {\n    case \"bash\":\n      return renderBash(spec, nodes);\n    case \"zsh\":\n      return renderZsh(spec, nodes);\n    case \"fish\":\n      return renderFish(spec, nodes);\n  }\n}\n\n// Dynamic suggestion runtime {{{\n\n/** Resolve the argument a {@link Location} points at, or null if it's stale. */\nfunction resolveArg(spec: Spec, location: Location): Arg | null {\n  let command = spec as unknown as Subcommand;\n  let ancestorPersistent: Option[] = [];\n\n  for (const segment of location.path) {\n    ancestorPersistent = [\n      ...ancestorPersistent,\n      ...(command.options ?? []).filter((option) => option.isPersistent),\n    ];\n    const child = (command.subcommands ?? []).find((sub) => makeArray(sub.name).includes(segment));\n    if (!child) return null;\n    command = child;\n  }\n\n  let args: readonly Arg[];\n  if (location.option !== undefined) {\n    const available = [...ancestorPersistent, ...(command.options ?? [])];\n    const option = available.find((candidate) =>\n      makeArray(candidate.name).includes(location.option!),\n    );\n    if (!option) return null;\n    args = asArray(option.args);\n  } else {\n    args = asArray(command.args);\n  }\n\n  return args[location.argIndex] ?? null;\n}\n\n/**\n * Run the generator a base64 location points at and return its suggestions as\n * insertable strings, or null if the location is invalid.\n */\nasync function generateSuggestions(\n  spec: Spec,\n  encoded: string,\n  tokens: string[],\n): Promise<string[] | null> {\n  let location: Location;\n  try {\n    location = decodeLocation(encoded);\n  } catch {\n    return null;\n  }\n\n  const arg = resolveArg(spec, location);\n  if (!arg) return null;\n\n  const generator: Generator | undefined = makeArray(arg.generators)[location.genIndex];\n  if (!generator?.custom) return null;\n\n  const suggestions = await generator.custom(tokens);\n  return suggestions.map((suggestion) =>\n    typeof suggestion === \"string\" ? suggestion : makeArray(suggestion.name)[0],\n  );\n}\n\n/**\n * Hidden machine-facing subcommand that generated scripts call back into to\n * run a `custom` generator. Not shown in help.\n */\nconst generateSuggestionsCommand: Subcommand = {\n  name: \"generate-suggestions\",\n  description: \"Print dynamic suggestions for a completion generator\",\n  hidden: true,\n  args: [{ name: \"location\" }, { name: \"tokens\", isVariadic: true, isOptional: true }],\n  async action({ path, args: [encoded, ...tokens] }) {\n    const spec = path[0] as Spec;\n    if (encoded === undefined) {\n      printActionError(\"Missing generator location\");\n      return 1;\n    }\n    const suggestions = await generateSuggestions(spec, encoded, tokens);\n    if (suggestions === null) {\n      printActionError(`Unknown generator location '${encoded}'`);\n      return 1;\n    }\n    if (suggestions.length > 0) {\n      print(suggestions.join(\"\\n\"));\n    }\n    return 0;\n  },\n};\n\n/**\n * Hidden machine-facing subcommand the `--runtime` shim calls on every Tab.\n * The tokens after `--` are the command line; the last is the word being\n * completed. Prints `value\\tdescription` lines.\n */\nconst completeCommand: Subcommand = {\n  name: \"complete\",\n  description: \"Resolve completion candidates for a partial command line\",\n  hidden: true,\n  options: [\n    {\n      name: \"--gate-options\",\n      description: \"Only suggest options after a leading dash\",\n    },\n  ],\n  args: { name: \"tokens\", isVariadic: true, isOptional: true },\n  async action({ path, args, options }) {\n    const spec = path[0] as Spec;\n    const partial = args.length > 0 ? args[args.length - 1] : \"\";\n    const before = args.slice(0, -1);\n    const candidates = await completeRuntime({\n      spec,\n      before,\n      partial,\n      gateOptions: options.has(\"--gate-options\"),\n    });\n    const lines = candidates.map((candidate) =>\n      candidate.description ? `${candidate.value}\\t${candidate.description}` : candidate.value,\n    );\n    if (lines.length > 0) print(lines.join(\"\\n\"));\n    return 0;\n  },\n};\n\n// }}}\n\n/** A subcommand that prints a shell completion script for the whole CLI. */\nexport const completion: Subcommand = {\n  name: \"completion\",\n  description: \"Print a shell completion script\",\n  args: {\n    name: \"shell\",\n    isOptional: true,\n    suggestions: SHELLS,\n  },\n  options: [\n    {\n      name: \"--runtime\",\n      description: \"Resolve candidates by invoking the CLI (default)\",\n      exclusiveOn: [\"--shell\"],\n    },\n    {\n      name: \"--shell\",\n      description: \"Emit a self-contained script with no per-Tab CLI call\",\n      exclusiveOn: [\"--runtime\"],\n    },\n  ],\n  subcommands: [completeCommand, generateSuggestionsCommand],\n  action({ path: [spec], args: [shell], options, help }) {\n    if (shell === undefined) {\n      print(`Supported shells: ${SHELLS.join(\", \")}`);\n      return 0;\n    }\n\n    if (!isShell(shell)) {\n      printActionError(\n        `Unsupported shell '${shell}'\\n\\n${help({\n          description: false,\n          didYouMean: { input: shell, choices: SHELLS as string[] },\n        })}`,\n      );\n      return 1;\n    }\n\n    const mode: Mode = options.has(\"--shell\") ? \"shell\" : \"runtime\";\n    print(getCompletion(spec, shell, mode));\n    return 0;\n  },\n};\n","import type { ActionInit, Spec } from \"./types.js\";\nimport { getHelp } from \"./help.js\";\nimport { ParseError, UnknownOption } from \"./errors.js\";\nimport { parse } from \"./parse.js\";\nimport type { ParseResult } from \"./parse.js\";\n\n/**\n * Parse argv and execute the selected action.\n *\n * The final command action runs unless a parsed option has an action. Option\n * actions take precedence so helpers like `--help` can run without satisfying\n * the selected command's required arguments.\n */\nexport async function run(spec: Spec, args: readonly string[] = defaultArgs()): Promise<number> {\n  let result: ParseResult;\n\n  try {\n    result = parse(args, spec);\n  } catch (error: unknown) {\n    if (error instanceof UnknownOption) {\n      const helpMessage = getHelp(error.context.path, {\n        description: false,\n        didYouMean: {\n          input: error.option,\n          choices: error.validOptions,\n        },\n      });\n      printError(`${error.message}\\n\\n${helpMessage}`);\n    } else if (error instanceof ParseError) {\n      printError(`${error.message}\\n\\n${getHelp(error.context.path, { description: false })}`);\n    } else {\n      printError(`${error}`);\n    }\n    return 1;\n  }\n\n  const action = result.optionActions.at(-1) ?? result.actions.at(-1);\n  if (!action) {\n    return 1;\n  }\n\n  const options = result.options;\n  const actionInit: ActionInit = {\n    help: (helpOptions) => getHelp(helpOptions?.path ?? result.path, helpOptions),\n    args: result.args,\n    path: result.path,\n    argSeparatorIndex: result.argSeparatorIndex,\n    options: {\n      options,\n      has: (name) => options.has(name),\n      get: (name) => options.get(name)?.[0],\n      all: (name) => options.get(name),\n      count: (name) => options.get(name)?.length ?? 0,\n    },\n  };\n\n  let exitCode: number | void;\n  try {\n    const actionResult = action(actionInit);\n    exitCode = typeof actionResult === \"object\" ? await actionResult : actionResult;\n  } catch (error) {\n    printError(error instanceof Error ? error.message : String(error));\n    return 1;\n  }\n\n  return Math.min(Math.max(exitCode ?? 0, 0), 255);\n}\n\nexport function printError(...strings: unknown[]): void {\n  console.error(\"Error:\", ...strings);\n}\n\nfunction defaultArgs(): readonly string[] {\n  const maybeProcess = globalThis as typeof globalThis & {\n    process?: { argv?: readonly string[] };\n  };\n  return maybeProcess.process?.argv?.slice(2) ?? [];\n}\n","export type {\n  Action,\n  ActionInit,\n  Arg,\n  CommandPath,\n  Generator,\n  NonEmptyArray,\n  Option,\n  OptionArgs,\n  SingleOrArray,\n  SingleOrArrayOrEmpty,\n  Spec,\n  Subcommand,\n  Suggestion,\n  Template,\n} from \"./types.js\";\n\nexport { completion } from \"./completion.js\";\nexport type { Shell } from \"./completion.js\";\nexport { help, helpCommand } from \"./help.js\";\nexport { printError, run } from \"./run.js\";\n\nimport { completion } from \"./completion.js\";\nimport { help, helpCommand } from \"./help.js\";\nimport { printError, run } from \"./run.js\";\n\nexport default {\n  completion,\n  help,\n  helpCommand,\n  printError,\n  run,\n};\n"],"ignoreList":[3],"mappings":";;;AAEA,SAAgB,QAAW,GAAwC;CACjE,OAAO,MAAM,QAAQ,CAAC;AACxB;;AAGA,SAAgB,UAAa,OAA0C;CACrE,IAAI,UAAU,KAAA,GAAW,OAAO,CAAC;CACjC,IAAI,QAAQ,KAAK,GACf,OAAO,MAAM,MAAM;CAErB,OAAO,CAAC,KAAK;AACf;;;;;;AAOA,SAAgB,QAAW,OAAmD;CAC5E,IAAI,UAAU,KAAA,GAAW,OAAO,CAAC;CACjC,IAAI,QAAQ,KAAK,GAAG,OAAO;CAC3B,OAAO,CAAC,KAAK;AACf;;AAGA,SAAgB,WAAc,OAA0C;CACtE,IAAI,QAAQ,KAAK,GAEf,OAAO,MAAM,MAAM;CAErB,OAAO,CAAC,KAAK;AACf;;AAGA,SAAgB,QAAc,KAAgB,MAAwB,OAAgB;CACpF,IAAI,QAAQ,IAAI,GACd,KAAK,MAAM,OAAO,MAChB,IAAI,IAAI,KAAK,KAAK;MAGpB,IAAI,IAAI,MAAM,KAAK;AAEvB;AAEA,SAAgB,OAAO,MAAe,MAAM,IAAkB;CAC5D,IAAI,CAAC,MACH,MAAM,IAAI,MAAM,GAAG;AAEvB;;AAOA,SAAgB,MAAM,MAAoB;CACxC,QAAQ,IAAI,KAAK,QAAQ,CAAC;AAC5B;;AAGA,SAAgB,iBAAiB,SAAuB;CACtD,QAAQ,MAAM,UAAU,OAAO;AACjC;;ACeA,MAAa,cACX,OACA,OACA,KACA,SACA,QACA,eACoB;CACpB,MAAM;CACN;CACA;CACA;CACA;CACA;CACA;AACF;AAEA,MAAa,kBACX,OACA,OACA,KACA,SACA,kBACwB;CACxB,MAAM;CACN;CACA;CACA;CACA;CACA;AACF;AAEA,MAAa,QAAQ,OAAe,OAAe,KAAa,aAA+B;CAC7F,MAAM;CACN;CACA;CACA;CACA;AACF;AAEA,MAAa,iBACX,OACA,OACA,KACA,aACuB;CACvB,MAAM;CACN;CACA;CACA;CACA;AACF;AAEA,MAAa,eACX,OACA,OACA,KACA,SACA,eACgC;CAChC,OAAO;EACL,MAAM;EACN;EACA;EACA;EACA;EACA;CACF;AACF;AAEA,MAAa,WACX,OACA,OACA,KACA,SACA,WACwB;CACxB,OAAO;EACL,MAAM;EACN;EACA;EACA;EACA;EACA;CACF;AACF;;;;;;;;AAwBA,SAAgB,QACd,OACA,MACmC;CACnC,MAAM,SAAS,CAAC;CAEhB,IAAI,MAAM,WAAW,GAAG;EACtB,MAAM,+BAAe,IAAI,IAAI;EAC7B,MAAM,uCAAuB,IAAI,IAAI;EACrC,MAAM,oCAAoB,IAAI,IAAI;EAClC,MAAM,4CAA4B,IAAI,IAAI;EAC1C,IAAI,KAAK,SACP,KAAK,MAAM,UAAU,KAAK,SACxB,IAAI,OAAO,cAAc;GACvB,QAAQ,mBAAmB,OAAO,MAAM,MAAM;GAC9C,IAAI,OAAO,YACT,QAAQ,2BAA2B,OAAO,MAAM,MAAM;EAE1D,OAAO;GACL,QAAQ,cAAc,OAAO,MAAM,MAAM;GACzC,IAAI,OAAO,YACT,QAAQ,sBAAsB,OAAO,MAAM,MAAM;EAErD;EAGJ,OAAO;GACL,YAAY;IACV;IACA;IACA;IACA;GACF;GACA;EACF;CACF;CAGA,IAAI;CAEJ,MAAM,+BAAoC,IAAI,IAAI;CAClD,MAAM,oCAAyC,IAAI,IAAI;CACvD,MAAM,uCAA4C,IAAI,IAAI;CAC1D,MAAM,4CAAiD,IAAI,IAAI;CAC/D,IAAI,aAAgC,CAAC,GAAG;CACxC,IAAI,cAAc;CAClB,IAAI,wBAAwB;CAC5B,IAAI,+BAA+B;CACnC,IAAI,8BAA8B;CAClC,IAAI,6BAA6B;CAEjC,MAAM,aAAa,SAAiB,aAAa,IAAI,IAAI,KAAK,kBAAkB,IAAI,IAAI,KAAK;CAE7F,MAAM,aAAa,SAAiB,aAAa,IAAI,IAAI,KAAK,kBAAkB,IAAI,IAAI;CAExF,MAAM,iBAAiB,SAAiB;EACtC,IAAI,CAAC,kBACH,OAAO;EAMT,IAAI,cAAiC;EACrC,IAAI,cAAc;EAElB,KAAK,MAAM,WAAW,kBAAkB;GACtC,MAAM,QAAQ,OAAO,QAAQ,SAAS,WAAW,CAAC,QAAQ,IAAI,IAAI,QAAQ;GAC1E,KAAK,MAAM,WAAW,OAAO;IAC3B,IAAI,YAAY,MACd,OAAO;IAET,IAAI,gCAAgC,QAAQ,WAAW,IAAI,GAAG;KAC5D,cAAc;KACd,eAAe;KAEf;IACF;GACF;EACF;EAEA,OAAO,gBAAgB,IAAI,cAAc;CAC3C;CAKA,MAAM,wBAAwB,YAAwB;EACpD,IAAI,QAAQ,SACV,KAAK,MAAM,UAAU,QAAQ,SAC3B,IAAI,OAAO,cAAc;GACvB,QAAQ,mBAAmB,OAAO,MAAM,MAAM;GAC9C,IAAI,OAAO,YACT,QAAQ,2BAA2B,OAAO,MAAM,MAAM;EAE1D,OAAO;GACL,QAAQ,cAAc,OAAO,MAAM,MAAM;GACzC,IAAI,OAAO,YACT,QAAQ,sBAAsB,OAAO,MAAM,MAAM;EAErD;EAIJ,mBAAmB,QAAQ;EAE3B,MAAM,aAAa,QAAQ;EAE3B,IAAI,YAAY,qBACd,aAAa,QAAQ,WAAW,mBAAmB;EAGrD,IAAI,YAAY,8BACd,+BAA+B,WAAW;EAG5C,IAAI,YAAY,6BACd,8BAA8B,WAAW;EAG3C,IAAI,OAAO,YAAY,8BAA8B,WACnD,wBAAwB,CAAC,WAAW;CAExC;CAGA,qBAAqB,IAAI;CAEzB,QAAQ,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;EACzD,MAAM,QAAQ,MAAM;EAIpB,IAAI,UAAU,MAAM;GAClB,OAAO,KAAK,cAAc,OAAO,GAAG,MAAM,QAAQ,KAAK,CAAC;GACxD,SAAS;GACT,OAAO,QAAQ,MAAM,QAAQ,SAAS;IACpC,MAAM,MAAM,MAAM;IAClB,OAAO,KAAK,KAAK,OAAO,GAAG,IAAI,QAAQ,GAAG,CAAC;GAC7C;GACA,MAAM;EACR;EAMA,IAAI,CAAC,eAAe,CAAC,8BAA8B,kBAAkB;GACnE,MAAM,UAAU,cAAc,KAAK;GACnC,IAAI,SAAS;IACX,aAAa,MAAM;IACnB,qBAAqB,OAAO;IAC5B,OAAO,KAAK,YAAY,OAAO,GAAG,MAAM,QAAQ,OAAO,OAAO,CAAC;IAC/D,SAAS;GACX;EACF;EAGA,IAAI,EAAE,+BAA+B,cAAc;GACjD,IACE,yBACA,MAAM,SAAS,MACd,MAAM,WAAW,GAAG,KAAK,MAAM,WAAW,GAAG,MAC9C,CAAC,MAAM,WAAW,IAAI,GACtB;IACA,MAAM,cAAc,MAAM;IAO1B,MAAM,aAAa,UAAU,WAAW;IACxC,IAAI,YAAY,QAAQ,CAAC,UAAU,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG;KACrD,OAAO,KAAK,QAAQ,OAAO,GAAG,GAAG,aAAa,UAAU,CAAC;KACzD,OAAO,KAAK,WAAW,OAAO,GAAG,MAAM,QAAQ,MAAM,MAAM,CAAC,GAAG,aAAa,EAAE,CAAC;KAC/E,SAAS;IACX;IAIA,OAAO,KAAK,IAAI,OAAO,GAAG,OAAO,MAAM,QAAQ,QAAQ;KACrD,MAAM,aAAa,GAAG,cAAc,MAAM;KAC1C,MAAM,SAAS,UAAU,UAAU;KACnC,IAAI,CAAC,QAAQ;MACX,OAAO,KACL,eAAe,OAAO,MAAM,OAAO,GAAG,YAAY,CAChD,GAAG,aAAa,KAAK,GACrB,GAAG,kBAAkB,KAAK,CAC5B,CAAC,CACH;MACA,SAAS;KACX;KAEA,IAAI,CAAC,8BAA8B,CAAC,OAAO,cACzC,6BAA6B;KAG/B,OAAO,KAAK,QAAQ,OAAO,MAAM,OAAO,GAAG,YAAY,MAAM,CAAC;KAE9D,IAAI,OAAO,QAAQ,OAAO,MAAM,SAAS,GAAG;MAC1C,MAAM,iBAAiB,MAAM,MAAM,OAAO,CAAC;MAC3C,MAAM,MAAM,WAAW,MAAM,QAAQ,eAAe,WAAW,GAAG,CAAC,KAAK;MACxE,MAAM,iBAAiB,OAAO,IAAI;MAClC,OAAO,KACL,WACE,OACA,iBAAiB,GACjB,MAAM,QACN,MAAM,MAAM,iBAAiB,CAAC,GAC9B,YACA,GACF,CACF;MACA;KACF;IACF;IACA,SAAS;GACX;GAEA,IAAI,CAAC,yBAA0B,MAAM,SAAS,KAAK,MAAM,WAAW,IAAI,GAAI;IAO1E,IAAI,WAAW;IACf,IAAI,gBAAgB;IAEpB,YAAY,KAAK,MAAM,OAAO,YAAY;KACxC,MAAM,QAAQ,MAAM,QAAQ,GAAG;KAC/B,IAAI,UAAU,IACZ,SAAS;KAEX,WAAW;KACX,gBAAgB;IAClB;IAEA,IAAI,UAAU;KACZ,MAAM,aAAa,MAAM,MAAM,GAAG,aAAa;KAC/C,MAAM,SAAS,UAAU,UAAU;KACnC,IAAI,QAAQ;MACV,IAAI,CAAC,8BAA8B,CAAC,OAAO,cACzC,6BAA6B;MAE/B,OAAO,KAAK,QAAQ,OAAO,GAAG,eAAe,MAAM,MAAM,GAAG,aAAa,GAAG,MAAM,CAAC;MACnF,OAAO,KACL,WACE,OACA,gBAAgB,SAAS,QACzB,MAAM,QACN,MAAM,MAAM,gBAAgB,SAAS,MAAM,GAC3C,YACA,QACF,CACF;MACA,SAAS;KACX,OAAO,IAAI,uBAAuB;MAGhC,MAAM,aAAa,MAAM,MAAM,GAAG,aAAa;MAC/C,OAAO,KACL,eAAe,OAAO,GAAG,eAAe,YAAY,CAClD,GAAG,aAAa,KAAK,GACrB,GAAG,kBAAkB,KAAK,CAC5B,CAAC,CACH;MACA,OAAO,KACL,WACE,OACA,gBAAgB,SAAS,QACzB,MAAM,QACN,MAAM,MAAM,gBAAgB,SAAS,MAAM,GAC3C,YACA,QACF,CACF;MACA,SAAS;KACX;IAEF,OAAO;KACL,MAAM,SAAS,UAAU,KAAK;KAC9B,IAAI,QAAQ;MACV,IAAI,CAAC,8BAA8B,CAAC,OAAO,cACzC,6BAA6B;MAE/B,OAAO,KAAK,QAAQ,OAAO,GAAG,MAAM,QAAQ,OAAO,MAAM,CAAC;MAC1D,SAAS;KACX,OAAO,IAAI,uBAAuB;MAGhC,OAAO,KACL,eAAe,OAAO,GAAG,MAAM,QAAQ,OAAO,CAC5C,GAAG,aAAa,KAAK,GACrB,GAAG,kBAAkB,KAAK,CAC5B,CAAC,CACH;MACA,SAAS;KACX;IACF;GACF;EACF;EAEA,IAAI,CAAC,aACH,cAAc;EAEhB,OAAO,KAAK,KAAK,OAAO,GAAG,MAAM,QAAQ,KAAK,CAAC;CACjD;CAEA,OAAO;EACL,YAAY;GACV;GACA;GACA;GACA;EACF;EACA;CACF;AACF;;ACxfA,MAAM,OAAO,KAAK;AAMlB,IAAa,aAAb,cAAgC,MAAM;CACpC;CACA,YAAY,SAAuB,GAAG,MAA+C;EACnF,MAAM,GAAG,IAAI;EACb,KAAK,UAAU;EACf,KAAK,OAAO,KAAK,YAAY;CAC/B;AACF;AAEA,IAAa,gBAAb,cAAmC,WAAW;CAC5C;CACA;CACA;CACA;CACA;CACA,YAAY,OAA2B,SAAuB;EAC5D,MAAM,MAAM,GAAG,KAAK,MAAM,OAAO,EAAE;EACnC,MAAM,SAAS,GAAG;EAClB,KAAK,SAAS,MAAM;EACpB,KAAK,eAAe,MAAM;EAC1B,KAAK,QAAQ,MAAM;EACnB,KAAK,QAAQ,MAAM;EACnB,KAAK,MAAM,MAAM;CACnB;AACF;AAEA,IAAa,mBAAb,cAAsC,WAAW;CAC/C;CACA;CACA;CACA;CACA;CACA,YAAY,OAAuB,SAAuB;EACxD,MAAM,MAAM,UAAU,MAAM,OAAO;EACnC,MAAM,SAAS,GAAG;EAClB,KAAK,QAAQ,MAAM;EACnB,KAAK,QAAQ,MAAM;EACnB,KAAK,MAAM,MAAM;EACjB,KAAK,SAAS,MAAM;EACpB,KAAK,MAAM,MAAM;CACnB;AACF;AAEA,IAAa,mBAAb,cAAsC,WAAW;CAC/C;CACA;CACA,YAAY,OAAkB,SAAuB;EACnD,MAAM,MAAM,uBAAuB,KAAK,MAAM,OAAO,EAAE;EACvD,MAAM,SAAS,GAAG;EAClB,KAAK,QAAQ,MAAM;EACnB,KAAK,QAAQ,MAAM;CACrB;AACF;AAEA,IAAa,wBAAb,cAA2C,WAAW;CACpD,YAAY,KAAa,KAAa,SAAuB;EAC3D,MAAM,MACJ,QAAQ,MACJ,gBAAgB,IAAI,WAAW,QAAQ,IAAI,KAAK,QAChD,CAAC,OAAO,SAAS,GAAG,IAClB,yBAAyB,IAAI,WAAW,QAAQ,IAAI,KAAK,QACzD,wBAAwB,IAAI,OAAO,IAAI;EAC/C,MAAM,SAAS,GAAG;CACpB;AACF;AAEA,IAAa,kBAAb,cAAqC,WAAW;CAC9C,YAAY,KAAa,KAAa,SAAuB;EAC3D,MAAM,MACJ,QAAQ,MACJ,YAAY,IAAI,WAAW,QAAQ,IAAI,KAAK,QAC5C,CAAC,OAAO,SAAS,GAAG,IAClB,qBAAqB,IAAI,WAAW,QAAQ,IAAI,KAAK,QACrD,oBAAoB,IAAI,OAAO,IAAI;EAC3C,MAAM,SAAS,GAAG;CACpB;AACF;AAEA,IAAa,wBAAb,cAA2C,WAAW;CACpD,YAAY,MAAc,SAAuB;EAC/C,MAAM,MAAM,UAAU,KAAK;EAC3B,MAAM,SAAS,GAAG;CACpB;AACF;;;CC3FA,QAAQ,aAAa;CACrB,QAAQ,WAAW,QAAQ,UAAU,KAAK;CAC1C,IAAI,sBAAM,IAAI,YAAY,KAAO;CACjC,IAAI,WAAW,SAAU,GAAG,GAAG;EAC3B,IAAI,IAAI,EAAE;EACV,IAAI,IAAI,EAAE;EACV,IAAI,MAAM,KAAM,IAAI;EACpB,IAAI,KAAK;EACT,IAAI,KAAK;EACT,IAAI,KAAK;EACT,IAAI,IAAI;EACR,OAAO,KACH,IAAI,EAAE,WAAW,CAAC,MAAM,KAAK;EAEjC,KAAK,IAAI,GAAG,IAAI,GAAG,KAAK;GACpB,IAAI,KAAK,IAAI,EAAE,WAAW,CAAC;GAC3B,IAAI,KAAK,KAAK;GACd,OAAQ,KAAK,MAAM,KAAM;GACzB,MAAM,EAAE,KAAK;GACb,MAAM;GACN,IAAI,KAAK,KACL;GAEJ,IAAI,KAAK,KACL;GAEJ,KAAM,MAAM,IAAK;GACjB,KAAM,MAAM,IAAK,EAAE,KAAK;GACxB,MAAM;EACV;EACA,IAAI;EACJ,OAAO,KACH,IAAI,EAAE,WAAW,CAAC,KAAK;EAE3B,OAAO;CACX;CACA,IAAI,UAAU,SAAU,GAAG,GAAG;EAC1B,IAAI,IAAI,EAAE;EACV,IAAI,IAAI,EAAE;EACV,IAAI,MAAM,CAAC;EACX,IAAI,MAAM,CAAC;EACX,IAAI,QAAQ,KAAK,KAAK,IAAI,EAAE;EAC5B,IAAI,QAAQ,KAAK,KAAK,IAAI,EAAE;EAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC5B,IAAI,KAAK;GACT,IAAI,KAAK;EACb;EACA,IAAI,IAAI;EACR,OAAO,IAAI,QAAQ,GAAG,KAAK;GACvB,IAAI,OAAO;GACX,IAAI,OAAO;GACX,IAAI,UAAU,IAAI;GAClB,IAAI,SAAS,KAAK,IAAI,IAAI,CAAC,IAAI;GAC/B,KAAK,IAAI,IAAI,SAAS,IAAI,QAAQ,KAC9B,IAAI,EAAE,WAAW,CAAC,MAAM,KAAK;GAEjC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;IACxB,IAAI,KAAK,IAAI,EAAE,WAAW,CAAC;IAC3B,IAAI,KAAM,IAAK,IAAI,KAAM,OAAO,IAAK;IACrC,IAAI,KAAM,IAAK,IAAI,KAAM,OAAO,IAAK;IACrC,IAAI,KAAK,KAAK;IACd,IAAI,OAAS,KAAK,MAAM,QAAQ,OAAQ,OAAQ,KAAK;IACrD,IAAI,KAAK,OAAO,EAAE,KAAK;IACvB,IAAI,KAAK,OAAO;IAChB,IAAK,OAAO,KAAM,IACd,IAAK,IAAI,KAAM,MAAM,KAAK;IAE9B,IAAK,OAAO,KAAM,IACd,IAAK,IAAI,KAAM,MAAM,KAAK;IAE9B,KAAM,MAAM,IAAK;IACjB,KAAM,MAAM,IAAK;IACjB,OAAO,KAAK,EAAE,KAAK;IACnB,OAAO,KAAK;GAChB;GACA,KAAK,IAAI,IAAI,SAAS,IAAI,QAAQ,KAC9B,IAAI,EAAE,WAAW,CAAC,KAAK;EAE/B;EACA,IAAI,KAAK;EACT,IAAI,KAAK;EACT,IAAI,QAAQ,IAAI;EAChB,IAAI,OAAO,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI;EACrC,KAAK,IAAI,IAAI,OAAO,IAAI,MAAM,KAC1B,IAAI,EAAE,WAAW,CAAC,MAAM,KAAK;EAEjC,IAAI,QAAQ;EACZ,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;GACxB,IAAI,KAAK,IAAI,EAAE,WAAW,CAAC;GAC3B,IAAI,KAAM,IAAK,IAAI,KAAM,OAAO,IAAK;GACrC,IAAI,KAAM,IAAK,IAAI,KAAM,OAAO,IAAK;GACrC,IAAI,KAAK,KAAK;GACd,IAAI,OAAS,KAAK,MAAM,MAAM,KAAM,KAAM,KAAK;GAC/C,IAAI,KAAK,KAAK,EAAE,KAAK;GACrB,IAAI,KAAK,KAAK;GACd,SAAU,OAAQ,IAAI,IAAM;GAC5B,SAAU,OAAQ,IAAI,IAAM;GAC5B,IAAK,OAAO,KAAM,IACd,IAAK,IAAI,KAAM,MAAM,KAAK;GAE9B,IAAK,OAAO,KAAM,IACd,IAAK,IAAI,KAAM,MAAM,KAAK;GAE9B,KAAM,MAAM,IAAK;GACjB,KAAM,MAAM,IAAK;GACjB,KAAK,KAAK,EAAE,KAAK;GACjB,KAAK,KAAK;EACd;EACA,KAAK,IAAI,IAAI,OAAO,IAAI,MAAM,KAC1B,IAAI,EAAE,WAAW,CAAC,KAAK;EAE3B,OAAO;CACX;CACA,IAAI,WAAW,SAAU,GAAG,GAAG;EAC3B,IAAI,EAAE,SAAS,EAAE,QAAQ;GACrB,IAAI,MAAM;GACV,IAAI;GACJ,IAAI;EACR;EACA,IAAI,EAAE,WAAW,GACb,OAAO,EAAE;EAEb,IAAI,EAAE,UAAU,IACZ,OAAO,SAAS,GAAG,CAAC;EAExB,OAAO,QAAQ,GAAG,CAAC;CACvB;CACA,QAAQ,WAAW;CACnB,IAAI,UAAU,SAAU,KAAK,KAAK;EAC9B,IAAI,eAAe;EACnB,IAAI,YAAY;EAChB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;GACjC,IAAI,OAAO,SAAS,KAAK,IAAI,EAAE;GAC/B,IAAI,OAAO,cAAc;IACrB,eAAe;IACf,YAAY;GAChB;EACJ;EACA,OAAO,IAAI;CACf;CACA,QAAQ,UAAU;;ACxIlB,SAAS,SACP,OACA,MACU;CACV,OAAO,MAAM,MAAM,QAAQ,UAAU,IAAI,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,KAAK;AACpE;AAEA,SAAS,mBACP,MACA,KAC8D;CAC9D,KAAK,IAAI,QAAQ,KAAK,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG;EACxD,MAAM,UAAU,KAAK;EACrB,IAAI,SAAS,oBAAoB,OAAO,QAAQ,kBAC9C,OAAO,QAAQ,iBAAiB;CAEpC;AAEF;AAEA,SAAS,OAAO,KAAa;CAC3B,IAAI,IAAI,OAAO,MAAM,OAAO;CAC5B,MAAM,QAAQ,IAAI,MAAM,IAAI,CAAC,CAAC,MAAM,GAAG,EAAE;CACzC,MAAM,SAAS,MAAM,EAAE,CAAC,SAAS,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC;CACtD,OAAO,MAAM,KAAK,SAAS,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI;AAC1D;;AAiBA,SAAgB,QAAQ,MAAiC,SAAqB,CAAC,GAAW;CACxF,MAAM,EAAE,cAAc,MAAM,QAAQ,MAAM,eAAe;CACzD,MAAM,WAAW,YAAY,IAAI;CACjC,IAAI,YACF,SAAS,cAAA,GAAaA,2BAAAA,QAAAA,CAAQ,WAAW,OAAO,WAAW,OAAmB;CAEhF,IAAI,CAAC,aACH,SAAS,cAAc,KAAA;CAEzB,IAAI,CAAC,OACH,SAAS,QAAQ,KAAA;CAEnB,OAAO,mBAAmB,QAAQ;AACpC;;;;AAKA,MAAa,SAAiB,EAAE,MAAM,MAAM,CAAC,UAAU,WAAW;CAChE,IAAI,YAAY,KAAA,GAAW;EACzB,MAAM,KAAK,CAAC;EACZ,OAAO;CACT;CAEA,IAAI,YAAY,IAAI;EAClB,iBACE,kDAAkD,KAAK,EAAE,aAAa,MAAM,CAAC,GAC/E;EACA,OAAO;CACT;CAEA,MAAM,cAAc,KACjB,GAAG,EAAE,CAAC,EACL,aAAa,QAAQ,QAAQ,CAAC,IAAI,MAAM,CAAC,CAC1C,SAAS,QAAQ,IAAI,IAAI;CAE5B,IAAI,eAAe,YAAY,SAAS,GAAG;EAEzC,IADoB,mBAAmB,MAAM,8BAC/B,GAAG;GACf,MAAM,WAAW,YAAY,QAAQ,SAAS,KAAK,WAAW,OAAO,CAAC;GACtE,IAAI,SAAS,SAAS,GAAG;IACvB,iBACE,sBAAsB,QAAQ,eAAe,SAAS,KAAK,IAAI,EAAE,MAAM,KAAK,EAC1E,aAAa,MACf,CAAC,GACH;IACA,OAAO;GACT;EACF;EAEA,iBACE,oBAAoB,QAAQ,OAAO,KAAK;GACtC,aAAa;GACb,YAAY;IACV,OAAO;IACP,SAAS;GACX;EACF,CAAC,GACH;EACA,OAAO;CACT;CAEA,iBAAiB,oBAAoB,QAAQ,OAAO,KAAK,EAAE,aAAa,MAAM,CAAC,GAAG;CAElF,OAAO;AACT;;AAGA,MAAa,cAA0B;CACrC,MAAM;CACN,aAAa;CACb,MAAM;EACJ,MAAM;EACN,YAAY;CACd;CACA,OAAO,EAAE,MAAM,MAAM,CAAC,cAAc,QAAQ;EAC1C,MAAM,WAAW,KAAK,MAAM,GAAG,EAAE;EAEjC,IAAI,CAAC,aAAa;GAChB,MAAM,KAAK,EAAE,MAAM,SAAS,CAAC,CAAC;GAC9B,OAAO;EACT;EAEA,MAAM,SAAS,KAAK,KAAK,SAAS;EAElC,IAAI,CAAC,OAAO,aAAa;GACvB,iBACE,6DAA6D,KAAK;IAChE,aAAa;IACb,MAAM;GACR,CAAC,GACH;GACA,OAAO;EACT;EAEA,MAAM,UAAU,SAAS,OAAO,aAAa,WAAW;EACxD,IAAI,CAAC,SAAS;GACZ,MAAM,cAAc,OAAO,YACxB,QAAQ,QAAQ,CAAC,IAAI,MAAM,CAAC,CAC5B,SAAS,QAAQ,IAAI,IAAI;GAE5B,IAAI,YAAY,SAAS,GAAG;IAC1B,iBACE,iCAAiC,YAAY,OAAO,KAAK;KACvD,MAAM;KACN,YAAY;MACV,OAAO;MACP,SAAS;KACX;IACF,CAAC,GACH;IACA,OAAO;GACT;GAEA,iBACE,iCAAiC,YAAY,OAAO,KAAK;IACvD,aAAa;IACb,MAAM;GACR,CAAC,GACH;GACA,OAAO;EACT;EAEA,MAAM,KAAK,EAAE,MAAM,CAAC,GAAG,UAAU,OAAO,EAAE,CAAC,CAAC;CAC9C;AACF;;AAGA,MAAa,OAAe;CAC1B,MAAM,CAAC,MAAM,QAAQ;CACrB,aAAa;CACb,cAAc;CACd,OAAO,EAAE,QAAQ;EACf,MAAM,mBAAmB,YAAY,IAAI,CAAC,CAAC;EAC3C,OAAO;CACT;AACF;AAWA,SAAS,wBAAwB,UAA6C;CAC5E,OAAO,SAAS,KAAK,YAAY,iBAAiB,WAAW,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG;AACvF;AAEA,SAAS,YAAe,OAAmC;CACzD,OAAO,UAAU,QAAQ,UAAU,KAAA;AACrC;AAEA,SAAS,YAAY,UAAmD;CACtE,MAAM,UAAU,SAAS,SAAS,SAAS;CAE3C,MAAM,cAAc,QAAQ;CAC5B,MAAM,cAAc;CAEpB,MAAM,cAA2C,QAAQ,cACrD,QAAQ,YACL,QAAQ,eAAe,CAAC,WAAW,MAAM,CAAC,CAC1C,KAAK,eAAe,CACnB,WAAW,WAAW,IAAI,CAAC,CACxB,MAAM,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,CACnC,KAAK,IAAI,GACZ,WAAW,eAAe,WAC5B,CAAC,IACH,CAAC;CAEL,IAAI,0BAAoC,CAAC;CACzC,IAAI,gBAA0B,CAAC;CAE/B,IAAI,oBAAuD,CAAC;CAC5D,IAAI,UAAmC,CAAC;CAExC,IAAI,SAAS,WAAW,KAAK,YAAY,WAAW,GAAG;EACrD,gBAAgB,QAAQ,UAAU,QAAQ,QAAQ,QAAQ,WAAW,CAAC,OAAO,MAAM,IAAI,CAAC;EACxF,UAAU,cAAc,KAAK,WAAW,CACtC,eAAe,MAAM,GACrB,OAAO,eAAe,WACxB,CAAC;CACH,OAAO;EACL,0BAA0B,SACvB,KAAK,YAAY,QAAQ,OAAO,CAAC,CACjC,OAAO,WAAW,CAAC,CACnB,KAAK,CAAC,CACN,QAAQ,WAAW,OAAO,gBAAgB,CAAC,OAAO,MAAM;EAE3D,oBAAoB,wBAAwB,KAAK,WAAW,CAC1D,eAAe,MAAM,GACrB,OAAO,eAAe,WACxB,CAAC;EAED,iBAAiB,QAAQ,WAAW,CAAC,EAAA,CAAG,QACrC,WAAW,CAAC,OAAO,UAAU,CAAC,OAAO,YACxC;EAEA,UAAU,cAAc,KAAK,WAAW,CACtC,eAAe,MAAM,GACrB,OAAO,eAAe,WACxB,CAAC;CACH;CAyBA,OAAO;EACL,cAxBmB;GACnB,MAAM,QAAQ,CAAC,wBAAwB,QAAQ,CAAC;GAChD,MAAM,WAAW,CACf,GAAG,cAAc,QAAQ,WAAW,OAAO,UAAU,GACrD,GAAG,wBAAwB,QAAQ,WAAW,OAAO,UAAU,CACjE;GACA,KAAK,MAAM,UAAU,UACnB,MAAM,KAAK,eAAe,MAAM,CAAC;GAEnC,IAAI,QAAQ,UAAU,kBAAkB,QACtC,MAAM,KAAK,SAAS;GAEtB,IAAI,QAAQ,oBACV,MAAM,KAAK,WAAW;QACjB;IACL,MAAM,OAAO,UAAU,QAAQ,IAAI;IACnC,IAAI,KAAK,SAAS,GAChB,MAAM,KAAK,mBAAmB,IAAI,CAAC;GAEvC;GACA,OAAO,MAAM,KAAK,GAAG;EACvB,EAAA,CAGM;EACJ;EACA;EACA;EACA;CACF;AACF;AAEA,SAAgB,mBAAmB,UAAgC;CACjE,MAAM,QAAQ,CAAC;CAEf,MAAM,SAAS;CAEf,IAAI,SAAS,YACX,MAAM,KAAK,qBAAqB,SAAS,WAAW,GAAG;CAGzD,IAAI,SAAS,aACX,MAAM,KAAK,OAAO,SAAS,WAAW,CAAC;CAGzC,IAAI,SAAS,OACX,MAAM,KAAK,WAAW,SAAS,SAAS,OAAO;CAGjD,MAAM,oBAAoB,KAAK,IAC7B,GACA,GAAG,SAAS,QAAQ,KAAK,CAAC,UAAU,KAAK,MAAM,GAC/C,GAAG,SAAS,kBAAkB,KAAK,CAAC,UAAU,KAAK,MAAM,CAC3D;CACA,MAAM,+BAA+B;CAErC,MAAM,iBAAiB,YAAgC;EACrD,MAAM,QAAQ,CAAC;EACf,MAAM,UAAU,SAAS,IAAI,OAAO,oBAAoB,4BAA4B;EACpF,KAAK,MAAM,CAAC,MAAM,SAAS,SAAS;GAClC,MAAM,SAAS,IAAI,OAAO,oBAAoB,KAAK,SAAS,4BAA4B;GACxF,MAAM,CAAC,MAAM,GAAG,QAAQ,KAAK,MAAM,IAAI;GACvC,MAAM,cAAc,CAAC,MAAM,GAAG,KAAK,KAAK,SAAS,UAAU,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;GAC3E,MAAM,KAAK,GAAG,SAAS,OAAO,SAAS,aAAa;EACtD;EACA,OAAO;CACT;CAEA,IAAI,SAAS,YAAY,SAAS,GAAG;EACnC,MAAM,QAAQ,CAAC,WAAW;EAC1B,MAAM,cAAc,KAAK,IAAI,GAAG,SAAS,YAAY,KAAK,CAAC,UAAU,KAAK,MAAM,CAAC;EACjF,MAAM,UAAU,SAAS,IAAI,OAAO,cAAc,4BAA4B;EAC9E,KAAK,MAAM,CAAC,MAAM,SAAS,SAAS,aAAa;GAC/C,MAAM,SAAS,IAAI,OAAO,cAAc,KAAK,SAAS,4BAA4B;GAClF,MAAM,CAAC,MAAM,GAAG,QAAQ,KAAK,MAAM,MAAM,CAAC,CAAC,EAAE,CAAC,MAAM,IAAI;GACxD,MAAM,cAAc,CAAC,MAAM,GAAG,KAAK,KAAK,SAAS,UAAU,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;GAC3E,MAAM,KAAK,GAAG,SAAS,OAAO,SAAS,aAAa;EACtD;EACA,MAAM,KAAK,MAAM,KAAK,IAAI,CAAC;CAC7B;CAEA,IAAI,SAAS,QAAQ,SAAS,GAAG;EAC/B,MAAM,QAAQ,CAAC,UAAU,GAAG,cAAc,SAAS,OAAO,CAAC;EAC3D,MAAM,KAAK,MAAM,KAAK,IAAI,CAAC;CAC7B;CAEA,IAAI,SAAS,kBAAkB,SAAS,GAAG;EACzC,MAAM,QAAQ,CAAC,iBAAiB,GAAG,cAAc,SAAS,iBAAiB,CAAC;EAC5E,MAAM,KAAK,MAAM,KAAK,IAAI,CAAC;CAC7B;CACA,OAAO,MAAM,KAAK,MAAM,IAAI;AAC9B;AAEA,SAAgB,iBAAiB,SAAwC;CACvE,IAAI,UAAU,QAAQ;CACtB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;EACvC,MAAM,SAAS,QAAQ;EACvB,IAAI,OAAO,SAAS,QAAQ,QAC1B,UAAU;CAEd;CACA,OAAO;AACT;AAEA,SAAgB,eAAe,QAAwB;CACrD,MAAM,OAAO,WAAW,OAAO,IAAI,CAAC,CACjC,MAAM,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,CACnC,KAAK,IAAI;CAEZ,MAAM,aAAa,UAAU,OAAO,IAAI;CAExC,IAAI,WAAW,WAAW,GACxB,OAAO;CAGT,IAAI,OAAO,mBAAmB;EAC5B,MAAM,YAAY,OAAO,sBAAsB,OAAO,MAAM,OAAO;EACnE,IAAI,WAAW,EAAE,CAAC,YAChB,OAAO,GAAG,KAAK,GAAG,YAAY,WAAW,EAAE,CAAC,QAAQ,WAAW;EAEjE,OAAO,GAAG,OAAO,UAAU,GAAG,WAAW,EAAE,CAAC,QAAQ,WAAW;CACjE;CACA,OAAO,GAAG,KAAK,GAAG,mBAAmB,UAAU;AACjD;AAEA,SAAgB,mBAAmB,MAAa;CAC9C,OAAO,KAAK,KAAK,QAAQ,YAAY,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG;AACrD;AAEA,SAAgB,YAAY,KAAkB;CAC5C,MAAM,OAAO,IAAI,QAAQ;CACzB,IAAI,MAAM;CACV,IAAI,MAAM;CACV,IAAI,SAAS;CACb,IAAI,IAAI,YAAY;EAClB,MAAM;EACN,MAAM;CACR;CACA,IAAI,IAAI,YACN,SAAS;CAEX,OAAO,GAAG,MAAM,OAAO,MAAM;AAC/B;;;;;;;;ACtWA,SAAgB,WACd,MACQ;CACR,IAAI,SAAS,KAAA,GAAW,OAAO;CAC/B,IAAI,CAAC,QAAQ,IAAI,GAAG,OAAO,KAAK,aAAa,IAAI;CACjD,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,IAAI,KAAK,EAAE,CAAC,YACV;EAEF;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,WACd,MACQ;CACR,IAAI,SAAS,KAAA,GAAW,OAAO;CAC/B,IAAI,CAAC,QAAQ,IAAI,GAAG,OAAO,KAAK,aAAa,WAAW;CAIxD,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,IAAI,KAAK,KAAK,SAAS,IAAI,EAAE,CAAC,YAC5B,OAAO;CAIX,OAAO,KAAK;AACd;;AAGA,SAAS,IAAO,KAAsB,KAAoC;CACxE,IAAI,QAAQ,GAAG,GACb,OAAO,IAAI,IAAI,IAAI,EAAE;CAEvB,OAAO,IAAI,IAAI,GAAG;AACpB;;AAGA,SAAS,IAAU,KAAgB,KAA0C;CAC3E,IAAI,QAAQ,GAAG,GACb,OAAO,IAAI,IAAI,IAAI,EAAE;CAEvB,OAAO,IAAI,IAAI,GAAG;AACpB;;;;;;;;;;;AAcA,SAAgB,MAAM,OAA0B,MAAyB;CACvE,MAAM,OAAgC,CAAC,IAAI;CAC3C,MAAM,UAAoB,CAAC;CAC3B,MAAM,gBAA0B,CAAC;CAEjC,IAAI,KAAK,QACP,QAAQ,KAAK,KAAK,MAAM;MACnB,IAAI,KAAK,oBACd,QAAQ,KAAKC,KAAkB;CAGjC,IAAI,iBAAyB,WAAW,KAAK,IAAI;CACjD,IAAI,iBAAyB,WAAW,KAAK,IAAI;CAEjD,MAAM,YAAsB,CAAC;CAC7B,MAAM,+BAAsC,IAAI,IAAI;CAIpD,IAAI,QAAA;CACJ,IAAI,aAAa;CACjB,IAAI,gBAAgB;CACpB,IAAI,gBAAgB;CACpB,IAAI,oBAAoB;CACxB,IAAI,oBAAoB;CAGxB,MAAM,mBAAmB,CAAC;CAE1B,MAAM,qBAAqB,CAAC;CAE5B,MAAM,eAAe,UAA+B;EAClD,MAAM,SAAS,MAAM;EAGrB,IAAI,CAAC,OAAO,gBAAgB,IAAI,cAAc,OAAO,IAAI,GACvD,MAAM,IAAI,WAAW,IAAI,GAAG,iBAAiB;EAG/C,IAAI,OAAO,aACT,mBAAmB,KAAK,MAAM;EAGhC,IAAI,OAAO,WACT,iBAAiB,KAAK,MAAM;EAG9B,IAAI,OAAO,QACT,cAAc,KAAK,OAAO,MAAM;EAKlC,IAAI,OAAO,cAAc;GACvB,MAAM,YAAY,OAAO,iBAAiB,OAAO,WAAW,OAAO;GACnE,IAAI,MAAM,IAAI,cAAc,OAAO,IAAI;GACvC,IAAI,CAAC,KAAK;IACR,MAAM,CAAC;IACP,QAAQ,cAAc,OAAO,MAAM,GAAG;GACxC;GACA,IAAI,IAAI,UAAU,WAChB,MAAM,IAAI,WAAW,IAAI,GAAG,sBAAsB;GAEpD,IAAI,KAAK,EAAE;GACX;EACF;EAEA,gBAAgB,WAAW,OAAO,IAAI;EACtC,gBAAgB,WAAW,OAAO,IAAI;EAEtC,aAAa,CAAC;EACd,QAAQ,cAAc,OAAO,MAAM,UAAU;EAE7C,IAAI,kBAAkB,GAAG;GACvB,aAAa;GACb,QAAA;GACA;EACF;EAEA,IAAI,OAAO,mBAAmB;GAC5B,QAAA;GACA,oBAAoB,OAAO;EAC7B,OACE,QAAA;CAGJ;CAEA,MAAM,YAAY,UAAqB;EAIrC,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC,sBAAsB,UAAU,UAAU,gBACnE,MAAM,IAAI,iBAAiB,OAAO,IAAI,CAAC;EAEzC,UAAU,KAAK,MAAM,OAAO;CAC9B;CAEA,MAAM,0BAA0B;EAC9B,IAAI,UAAU,UAAU,gBACtB,MAAM,IAAI,WACR,IAAI,GACJ,kEACF;EAEF,oBAAoB,UAAU;EAC9B,QAAA;CACF;CAEA,MAAM,mBAAmB,UAAuC;EAC9D,KAAK,KAAK,MAAM,UAAU;EAC1B,iBAAiB,WAAW,MAAM,WAAW,IAAI;EACjD,iBAAiB,WAAW,MAAM,WAAW,IAAI;EACjD,IAAI,MAAM,WAAW,QACnB,QAAQ,KAAK,MAAM,WAAW,MAAM;OAC/B,IAAI,MAAM,WAAW,oBAC1B,QAAQ,KAAKA,KAAkB;CAEnC;CAEA,MAAM,aAAa,EAAE,KAAK;CAE1B,MAAM,EAAE,YAAY,WAAW,QAA4B,OAAO,IAAI;CAEtE,KAAK,MAAM,SAAS,QAClB,QAAQ,OAAR;EACE,KAAA;GACE,QAAQ,MAAM,MAAd;IACE,KAAK;KACH,gBAAgB,KAAK;KACrB;IAEF,KAAK;KACH,SAAS,KAAK;KACd;IAEF,KAAK;KACH,YAAY,KAAK;KACjB;IAEF,KAAK,kBACH,MAAM,IAAI,cAAc,OAAO,IAAI,CAAC;IAEtC,KAAK,cACH,MAAM,IAAI,iBAAiB,OAAO,IAAI,CAAC;IAEzC,KAAK;KACH,kBAAkB;KAClB;IAEF,SACE,MAAM,IAAI,WAAW,IAAI,GAAG,aAAa;GAE7C;GACA;EAEF,KAAA;GACE,OACE,MAAM,QAAQ,UAAU,GACxB,6DACF;GACA,QAAQ,MAAM,MAAd;IACE,KAAK;IACL,KAAK;KACH,IAAI,WAAW,SAAS,eACtB,WAAW,KAAK,MAAM,OAAO;UACxB;MACL,aAAa;MACb,QAAA;MACA,SAAS,KAAK;KAChB;KACA;IAEF,KAAK;KACH,IAAI,WAAW,SAAS,eACtB,MAAM,IAAI,sBAAsB,eAAe,eAAe,IAAI,CAAC;KAErE,YAAY,KAAK;KACjB;IAEF,KAAK;KACH,IAAI,WAAW,SAAS,eACtB,WAAW,KAAK,MAAM,OAAO;UAE7B,MAAM,IAAI,cAAc,OAAO,IAAI,CAAC;KAEtC;IAEF,KAAK;KACH,IAAI,WAAW,SAAS,eACtB,MAAM,IAAI,sBAAsB,eAAe,eAAe,IAAI,CAAC;KAErE,kBAAkB;KAClB;IAEF,KAAK,cACH,MAAM,IAAI,WAAW,IAAI,GAAG,kBAAkB;IAIhD,SACE,MAAM,IAAI,WAAW,IAAI,GAAG,aAAa;GAE7C;GACA;EAEF,KAAA;GACE,OACE,MAAM,QAAQ,UAAU,GACxB,6DACF;GACA,OAAO,mBAAmB,wCAAwC;GAClE,QAAQ,MAAM,MAAd;IACE,KAAK;KACH,IAAI,OAAO,sBAAsB,YAAY,MAAM,cAAc,mBAC/D,MAAM,IAAI,WACR,IAAI,GACJ,6BAA6B,kBAAkB,gBAAgB,MAAM,UAAU,EACjF;KAIF,WAAW,KAAK,MAAM,OAAO;KAC7B,QAAA;KACA;IAEF,KAAK;KACH,IAAI,gBAAgB,GAClB,MAAM,IAAI,sBAAsB,eAAe,eAAe,IAAI,CAAC;KAErE,aAAa;KACb,QAAA;KACA,SAAS,KAAK;KACd;IAEF,KAAK;KACH,IAAI,gBAAgB,GAClB,MAAM,IAAI,sBAAsB,eAAe,eAAe,IAAI,CAAC;KAErE,YAAY,KAAK;KACjB;IAEF,KAAK,kBACH,MAAM,IAAI,cAAc,OAAO,IAAI,CAAC;IAEtC,KAAK,iBACH,MAAM,IAAI,WAAW,IAAI,GAAG,kBAAkB;IAEhD,KAAK;KACH,IAAI,gBAAgB,GAClB,MAAM,IAAI,sBAAsB,eAAe,eAAe,IAAI,CAAC;KAErE,gBAAgB,KAAK;KACrB,QAAA;KACA;IAEF,SACE,MAAM,IAAI,WAAW,IAAI,GAAG,aAAa;GAE7C;CAGJ;CAGF,MAAM,kBAAkB,cAAc,SAAS;CAE/C,IAAI,CAAC,mBAAmB,UAAU,SAAS,gBACzC,MAAM,IAAI,gBAAgB,gBAAgB,gBAAgB,IAAI,CAAC;CAEjE,IAAI,cAAc,WAAW,SAAS,eACpC,MAAM,IAAI,sBAAsB,eAAe,eAAe,IAAI,CAAC;CAKrE,KAAK,MAAM,UAAU,kBACnB,KAAK,MAAM,QAAQ,OAAO,WACxB,IAAI,CAAC,aAAa,IAAI,IAAI,GACxB,MAAM,IAAI,WAAW,IAAI,GAAG,GAAG,OAAO,KAAK,YAAY,KAAK,2BAA2B;CAI7F,KAAK,MAAM,UAAU,oBACnB,KAAK,MAAM,QAAQ,OAAO,aACxB,IAAI,aAAa,IAAI,IAAI,GACvB,MAAM,IAAI,WAAW,IAAI,GAAG,GAAG,OAAO,KAAK,+BAA+B,MAAM;CAItF,IAAI,CAAC,iBAAiB;EACpB,KAAK,MAAM,QAAQ,WAAW,qBAAqB,KAAK,GACtD,IAAI,CAAC,aAAa,IAAI,IAAI,GACxB,MAAM,IAAI,sBAAsB,MAAM,IAAI,CAAC;EAG/C,KAAK,MAAM,QAAQ,WAAW,0BAA0B,KAAK,GAC3D,IAAI,CAAC,aAAa,IAAI,IAAI,GACxB,MAAM,IAAI,sBAAsB,MAAM,IAAI,CAAC;CAGjD;CAEA,OAAO;EACL;EACA;EACA;EACA;EACA,MAAM;EACN,SAAS;CACX;AACF;;ACxXA,MAAa,SAA2B;CAAC;CAAQ;CAAO;AAAM;AAE9D,SAAS,QAAQ,OAA+B;CAC9C,OAAQ,OAA6B,SAAS,KAAK;AACrD;AAkDA,MAAM,aAAa,gBACjB,cAAc,YAAY,MAAM,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,IAAI;;AAGvD,MAAM,YAAY,UAA0B,MAAM,QAAQ,kBAAkB,GAAG;AAI/E,SAAS,eAAe,UAA4B;CAClD,MAAM,QAAQ,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,UAAU,QAAQ,CAAC;CAC/D,IAAI,SAAS;CACb,KAAK,MAAM,QAAQ,OAAO,UAAU,OAAO,aAAa,IAAI;CAC5D,OAAO,KAAK,MAAM;AACpB;AAEA,SAAS,eAAe,SAA2B;CACjD,MAAM,SAAS,KAAK,OAAO;CAC3B,MAAM,QAAQ,WAAW,KAAK,SAAS,SAAS,KAAK,WAAW,CAAC,CAAC;CAClE,OAAO,KAAK,MAAM,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,CAAC;AACnD;;AAKA,SAAS,eAAe,KAAU,UAA+D;CAC/F,MAAM,gBAAgB,IAAI,eAAe,CAAC,EAAA,CAAG,KAAK,eAChD,OAAO,eAAe,WAAW,aAAa,UAAU,WAAW,IAAI,CAAC,CAAC,EAC3E;CAGA,MAAM,WADa,UAAU,IAAI,UACP,CAAC,CAAC,WAAW,cAAc,UAAU,MAAM;CACrE,MAAM,iBAAiB,YAAY,IAAI,eAAe;EAAE,GAAG;EAAU;CAAS,CAAC,IAAI,KAAA;CAEnF,IAAI,CAAC,IAAI,YAAY,aAAa,WAAW,KAAK,CAAC,gBACjD;CAEF,OAAO;EAAE,UAAU,IAAI;EAAU;EAAc;CAAe;AAChE;;AAGA,SAAS,kBAAkB,QAAgB,MAAyC;CAClF,MAAM,MAAM,QAAQ,OAAO,IAAI,CAAC,CAAC;CACjC,IAAI,CAAC,KAAK,OAAO,KAAA;CACjB,OAAO,eAAe,KAAK;EAAE;EAAM,QAAQ,UAAU,OAAO,IAAI,CAAC,CAAC;EAAI,UAAU;CAAE,CAAC;AACrF;;AAGA,SAAS,mBAAmB,SAAqB,MAAyC;CACxF,MAAM,OAAO,QAAQ,QAAQ,IAAI;CACjC,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS,GAAG;EACnD,MAAM,KAAK,eAAe,KAAK,QAAQ;GAAE;GAAM,UAAU;EAAM,CAAC;EAChE,IAAI,IAAI,OAAO;CACjB;AAEF;AAEA,SAAS,aAAa,QAAgB,MAA4B;CAChE,OAAO;EACL,QAAQ,UAAU,OAAO,IAAI;EAC7B,aAAa,UAAU,OAAO,WAAW;EACzC,UAAU,QAAQ,OAAO,IAAI,CAAC,CAAC,SAAS;EACxC,aAAa,kBAAkB,QAAQ,IAAI;CAC7C;AACF;;;;;AAMA,SAAS,KAAK,MAAoB;CAChC,MAAM,QAAgB,CAAC;CAEvB,MAAM,WACJ,SACA,KACA,MACA,wBACS;EACT,MAAM,cAAc,QAAQ,WAAW,CAAC,EAAA,CAAG,QAAQ,WAAW,CAAC,OAAO,MAAM;EAC5E,MAAM,YAAY,QAAQ,eAAe,CAAC,EAAA,CAAG,QAAQ,QAAQ,CAAC,IAAI,MAAM;EAExE,MAAM,OAAa;GACjB;GACA;GACA,aAAa,CAAC;GACd,SAAS,CAAC,GAAG,qBAAqB,GAAG,UAAU,CAAC,CAAC,KAAK,WAAW,aAAa,QAAQ,IAAI,CAAC;GAC3F,YAAY,mBAAmB,SAAS,IAAI;GAC5C,aAAa,CAAC;EAChB;EAEA,MAAM,kBAAkB,CACtB,GAAG,qBACH,GAAG,WAAW,QAAQ,WAAW,OAAO,YAAY,CACtD;EAEA,KAAK,MAAM,SAAS,UAAU;GAC5B,MAAM,SAAS,UAAU,MAAM,IAAI;GACnC,MAAM,WAAW,GAAG,IAAI,GAAG,SAAS,OAAO,EAAE;GAC7C,KAAK,YAAY,KAAK;IACpB;IACA,aAAa,UAAU,MAAM,WAAW;GAC1C,CAAC;GACD,KAAK,MAAM,SAAS,QAClB,KAAK,YAAY,KAAK;IAAE;IAAO;GAAS,CAAC;GAE3C,QAAQ,OAAO,UAAU,CAAC,GAAG,MAAM,OAAO,EAAE,GAAG,eAAe;EAChE;EAEA,MAAM,KAAK,IAAI;CACjB;CAEA,QAAQ,MAA+B,OAAO,CAAC,GAAG,CAAC,CAAC;CACpD,OAAO;AACT;;AAGA,SAAS,QAAQ,OAAuB;CACtC,OAAO,IAAI,MAAM,WAAW,KAAK,OAAO,EAAE;AAC5C;;AAGA,SAAS,UAAU,OAAuB;CACxC,OAAO,IAAI,MAAM,WAAW,MAAM,MAAM,CAAC,CAAC,WAAW,KAAK,KAAK,EAAE;AACnE;;AAGA,SAAS,gBAAgB,MAAsB;CAC7C,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,OAAO,KAAK,aAAa,OAAO,KAAK,GAAG,IAAI,MAAM;CAC7D,KAAK,MAAM,UAAU,KAAK,SAAS,OAAO,KAAK,GAAG,OAAO,MAAM;CAC/D,OAAO;AACT;AAEA,SAAS,sBAAsB,OAAe,QAA0B;CACtE,MAAM,QAAkB,CAAC;CACzB,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,EAAE,OAAO,cAAc,KAAK,aACrC,MAAM,KAAK,GAAG,SAAS,QAAQ,GAAG,KAAK,IAAI,IAAI,OAAO,EAAE,QAAQ,QAAQ,QAAQ,EAAE,IAAI;CAG1F,OAAO;AACT;;;;;;AASA,SAAS,aAAa,IAAiB,QAAgB,QAA2B;CAChF,MAAM,QAAkB,CAAC;CACzB,MAAM,KAAK,SAAS,gBAAgB;CACpC,MAAM,WAAW,GAAG,aAAa,SAAS,KAAK,GAAG,mBAAmB,KAAA;CAErE,IAAI,UAAU;EACZ,MAAM,KACJ,GAAG,OAAO,cACR,GAAG,aAAa,SAAS,IAAI,QAAQ,GAAG,aAAa,KAAK,GAAG,CAAC,IAAI,QAEtE;EACA,IAAI,GAAG,gBAAgB;GACrB,MAAM,KAAK,GAAG,OAAO,wDAAwD;GAC7E,MAAM,KACJ,GAAG,OAAO,wEAAwE,QAAQ,GAAG,cAAc,EAAE,wCAC/G;GACA,MAAM,KAAK,GAAG,OAAO,GAAG;EAC1B;EACA,MAAM,KAAK,GAAG,SAAS,GAAG,qCAAqC;CACjE;CACA,IAAI,GAAG,UAAU;EACf,MAAM,SAAS,GAAG,aAAa,YAAY,OAAO;EAClD,MAAM,SAAS,YAAY,SAAS,gBAAgB;EACpD,MAAM,KAAK,GAAG,SAAS,OAAO,cAAc,OAAO,cAAc;CACnE;CACA,OAAO;AACT;AAEA,SAAS,WAAW,MAAY,OAAuB;CACrD,MAAM,KAAK,SAAS,KAAK,IAAI;CAC7B,MAAM,QAAkB,CAAC;CAEzB,MAAM,KAAK,IAAI,GAAG,KAAK;CACvB,MAAM,KAAK,0CAA0C;CACrD,MAAM,KAAK,6CAA6C;CACxD,MAAM,KAAK,uBAAuB;CAClC,MAAM,KAAK,0CAA0C;CACrD,MAAM,KAAK,2BAA2B;CACtC,MAAM,KAAK,wCAAwC;CACnD,MAAM,KAAK,8BAA8B;CACzC,MAAM,KAAK,GAAG,sBAAsB,OAAO,QAAQ,CAAC;CACpD,MAAM,KAAK,UAAU;CACrB,MAAM,KAAK,QAAQ;CAGnB,MAAM,WAAqB,CAAC;CAC5B,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,UAAU,KAAK,SAAS;EACjC,IAAI,CAAC,OAAO,aAAa;EACzB,KAAK,MAAM,SAAS,OAAO,QAAQ;GACjC,SAAS,KAAK,OAAO,QAAQ,GAAG,KAAK,IAAI,IAAI,OAAO,EAAE,EAAE;GACxD,SAAS,KAAK,GAAG,aAAa,OAAO,aAAa,UAAU,KAAK,CAAC;GAClE,SAAS,KAAK,iBAAiB;EACjC;CACF;CAEF,IAAI,SAAS,SAAS,GAAG;EACvB,MAAM,KAAK,+BAA+B;EAC1C,MAAM,KAAK,GAAG,QAAQ;EACtB,MAAM,KAAK,QAAQ;CACrB;CAEA,MAAM,KAAK,iBAAiB;CAC5B,MAAM,KAAK,kBAAkB;CAC7B,KAAK,MAAM,QAAQ,OACjB,MAAM,KAAK,OAAO,QAAQ,KAAK,GAAG,EAAE,SAAS,QAAQ,gBAAgB,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI;CAE5F,MAAM,KAAK,QAAQ;CACnB,MAAM,KAAK,iDAAiD;CAG5D,MAAM,WAAqB,CAAC;CAC5B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,CAAC,KAAK,YAAY;EACtB,SAAS,KAAK,OAAO,QAAQ,KAAK,GAAG,EAAE,EAAE;EACzC,SAAS,KAAK,GAAG,aAAa,KAAK,YAAY,UAAU,IAAI,CAAC;EAC9D,SAAS,KAAK,UAAU;CAC1B;CACA,IAAI,SAAS,SAAS,GAAG;EACvB,MAAM,KAAK,kBAAkB;EAC7B,MAAM,KAAK,GAAG,QAAQ;EACtB,MAAM,KAAK,QAAQ;CACrB;CAEA,MAAM,KAAK,GAAG;CACd,MAAM,KAAK,gBAAgB,GAAG,GAAG,QAAQ,KAAK,IAAI,GAAG;CACrD,OAAO,MAAM,KAAK,IAAI;AACxB;;AAOA,SAAS,YAAY,IAAiB,QAA0B;CAC9D,MAAM,QAAkB,CAAC;CAGzB,IAFgB,GAAG,aAAa,SAAS,KAAK,GAAG,mBAAmB,KAAA,GAEvD;EACX,MAAM,KAAK,GAAG,OAAO,cAAc;EACnC,MAAM,KAAK,GAAG,OAAO,SAAS,GAAG,aAAa,IAAI,OAAO,CAAC,CAAC,KAAK,GAAG,EAAE,GAAG;EACxE,IAAI,GAAG,gBAAgB;GAErB,MAAM,KAAK,GAAG,OAAO,gDAAgD;GACrE,MAAM,KACJ,GAAG,OAAO,iEAAiE,QAAQ,GAAG,cAAc,EAAE,qCACxG;GACA,MAAM,KAAK,GAAG,OAAO,GAAG;EAC1B;EACA,MAAM,KAAK,GAAG,OAAO,gBAAgB;CACvC;CACA,IAAI,GAAG,UACL,MAAM,KAAK,GAAG,SAAS,GAAG,aAAa,YAAY,cAAc,UAAU;CAE7E,OAAO;AACT;AAEA,SAAS,UAAU,MAAY,OAAuB;CACpD,MAAM,KAAK,SAAS,KAAK,IAAI;CAC7B,MAAM,QAAkB,CAAC;CAEzB,MAAM,KAAK,YAAY,KAAK,MAAM;CAClC,MAAM,KAAK,IAAI,GAAG,KAAK;CACvB,MAAM,KAAK,0BAA0B;CACrC,MAAM,KAAK,uCAAuC;CAClD,MAAM,KAAK,sBAAsB;CACjC,MAAM,KAAK,wCAAwC;CACnD,MAAM,KAAK,8BAA8B;CACzC,MAAM,KAAK,GAAG,sBAAsB,OAAO,QAAQ,CAAC;CACpD,MAAM,KAAK,UAAU;CACrB,MAAM,KAAK,QAAQ;CACnB,MAAM,KAAK,+BAA+B;CAE1C,MAAM,WAAqB,CAAC;CAC5B,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,UAAU,KAAK,SAAS;EACjC,IAAI,CAAC,OAAO,aAAa;EACzB,KAAK,MAAM,SAAS,OAAO,QAAQ;GACjC,SAAS,KAAK,OAAO,QAAQ,GAAG,KAAK,IAAI,IAAI,OAAO,EAAE,EAAE;GACxD,SAAS,KAAK,GAAG,YAAY,OAAO,aAAa,QAAQ,CAAC;GAC1D,SAAS,KAAK,iBAAiB;EACjC;CACF;CAEF,IAAI,SAAS,SAAS,GAAG;EACvB,MAAM,KAAK,+BAA+B;EAC1C,MAAM,KAAK,GAAG,QAAQ;EACtB,MAAM,KAAK,QAAQ;CACrB;CAEA,MAAM,KAAK,iBAAiB;CAC5B,MAAM,KAAK,kBAAkB;CAC7B,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,UAAoB,CAAC;EAC3B,KAAK,MAAM,OAAO,KAAK,aACrB,KAAK,MAAM,SAAS,IAAI,QACtB,QAAQ,KAAK,QAAQ,GAAG,MAAM,GAAG,IAAI,aAAa,CAAC;EAGvD,KAAK,MAAM,UAAU,KAAK,SACxB,KAAK,MAAM,SAAS,OAAO,QACzB,QAAQ,KAAK,QAAQ,GAAG,MAAM,GAAG,OAAO,aAAa,CAAC;EAG1D,MAAM,KAAK,OAAO,QAAQ,KAAK,GAAG,EAAE,WAAW,QAAQ,KAAK,GAAG,EAAE,MAAM;CACzE;CACA,MAAM,KAAK,QAAQ;CACnB,MAAM,KAAK,yBAAyB,QAAQ,KAAK,IAAI,EAAE,MAAM;CAG7D,MAAM,WAAqB,CAAC;CAC5B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,CAAC,KAAK,YAAY;EACtB,SAAS,KAAK,OAAO,QAAQ,KAAK,GAAG,EAAE,EAAE;EACzC,SAAS,KAAK,GAAG,YAAY,KAAK,YAAY,QAAQ,CAAC;EACvD,SAAS,KAAK,UAAU;CAC1B;CACA,IAAI,SAAS,SAAS,GAAG;EACvB,MAAM,KAAK,kBAAkB;EAC7B,MAAM,KAAK,GAAG,QAAQ;EACtB,MAAM,KAAK,QAAQ;CACrB;CAEA,MAAM,KAAK,GAAG;CACd,MAAM,KAAK,IAAI,GAAG,MAAM;CACxB,OAAO,MAAM,KAAK,IAAI;AACxB;;AAOA,SAAS,oBAAoB,QAA0B;CACrD,MAAM,QAAkB,CAAC;CACzB,KAAK,MAAM,SAAS,QAClB,IAAI,MAAM,WAAW,IAAI,GACvB,MAAM,KAAK,MAAM,UAAU,MAAM,MAAM,CAAC,CAAC,GAAG;MACvC,IAAI,MAAM,WAAW,GAAG,KAAK,MAAM,WAAW,GACnD,MAAM,KAAK,MAAM,UAAU,MAAM,MAAM,CAAC,CAAC,GAAG;MACvC,IAAI,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GACjD,MAAM,KAAK,MAAM,UAAU,MAAM,MAAM,CAAC,CAAC,GAAG;MAG5C,MAAM,KAAK,MAAM,UAAU,KAAK,GAAG;CAGvC,OAAO,MAAM,KAAK,GAAG;AACvB;;AAGA,SAAS,oBAAoB,UAA0B;CAErD,OAAO,6GAA6G,SAAS;AAC/H;;AAGA,SAAS,cAAc,IAAyD;CAC9E,MAAM,QAAkB,CAAC,GAAG,GAAG,YAAY;CAC3C,IAAI,GAAG,aAAa,aAAa,MAAM,QAAQ,GAAG,QAAQ,GACxD,MAAM,KAAK,+BAA+B;CAE5C,IAAI,GAAG,gBAAgB,MAAM,KAAK,oBAAoB,GAAG,cAAc,CAAC;CAGxE,OAAO;EAAE,OAFK,MAAM,SAAS,IAAI,OAAO,UAAU,MAAM,KAAK,GAAG,CAAC,MAAM;EAEvD,YADG,GAAG,aAAa,eAAe,MAAM,QAAQ,GAAG,QAAQ;CAChD;AAC7B;;;;;;AAOA,SAAS,oBAAoB,QAA4B;CACvD,IAAI,CAAC,OAAO,UAAU,OAAO;CAC7B,IAAI,CAAC,OAAO,aAAa,OAAO;CAChC,MAAM,EAAE,OAAO,eAAe,cAAc,OAAO,WAAW;CAC9D,OAAO,GAAG,aAAa,QAAQ,QAAQ;AACzC;AAEA,SAAS,WAAW,MAAY,OAAuB;CACrD,MAAM,KAAK,SAAS,KAAK,IAAI;CAC7B,MAAM,OAAO,KAAK;CAClB,MAAM,QAAkB,CAAC;CAEzB,MAAM,KAAK,mBAAmB,GAAG,IAAI;CACrC,MAAM,KAAK,kBAAkB;CAC7B,MAAM,KAAK,kCAAkC;CAC7C,MAAM,KAAK,yBAAyB;CACpC,MAAM,KAAK,oCAAoC;CAC/C,MAAM,KAAK,gBAAgB;CAC3B,MAAM,KAAK,SAAS;CACpB,MAAM,KAAK,sBAAsB;CACjC,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,EAAE,OAAO,cAAc,KAAK,aAAa;EAClD,MAAM,KAAK,cAAc,UAAU,GAAG,KAAK,IAAI,GAAG,OAAO,GAAG;EAC5D,MAAM,KAAK,mBAAmB,UAAU,QAAQ,GAAG;CACrD;CAEF,MAAM,KAAK,SAAS;CACpB,MAAM,KAAK,OAAO;CAClB,MAAM,KAAK,4BAA4B;CACvC,MAAM,KAAK,KAAK;CAChB,MAAM,KAAK,EAAE;CAEb,MAAM,KAAK,eAAe,UAAU,IAAI,EAAE,IAAI;CAC9C,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,QAAQ,MAAM,UAAU,UAAU,GAAG,MAAM,KAAK,KAAK;EAC3D,KAAK,MAAM,OAAO,KAAK,aACrB,KAAK,MAAM,SAAS,IAAI,QAAQ;GAC9B,MAAM,OAAO,IAAI,cAAc,OAAO,UAAU,IAAI,WAAW,MAAM;GACrE,MAAM,KAAK,eAAe,UAAU,IAAI,EAAE,GAAG,MAAM,MAAM,UAAU,KAAK,IAAI,MAAM;EACpF;EAEF,KAAK,MAAM,UAAU,KAAK,SAAS;GACjC,MAAM,OAAO,OAAO,cAAc,OAAO,UAAU,OAAO,WAAW,MAAM;GAC3E,MAAM,SAAS,oBAAoB,MAAM;GACzC,MAAM,KACJ,eAAe,UAAU,IAAI,EAAE,GAAG,MAAM,GAAG,oBAAoB,OAAO,MAAM,IAAI,SAAS,MAC3F;EACF;EAEA,IAAI,KAAK,YAAY;GACnB,MAAM,EAAE,OAAO,eAAe,cAAc,KAAK,UAAU;GAC3D,MAAM,KAAK,eAAe,UAAU,IAAI,EAAE,GAAG,QAAQ,QAAQ,aAAa,QAAQ,IAAI;EACxF;CACF;CACA,OAAO,MAAM,KAAK,IAAI;AACxB;AAwCA,SAAS,aAAa,MAAY,QAA4C;CAC5E,MAAM,EAAE,QAAQ,eAAe,QAA4B,QAAQ,IAAI;CAEvE,MAAM,OAAqB,CAAC,IAA6B;CACzD,IAAI,UAAsB;CAC1B,IAAI,UAAsC;CAC1C,IAAI,gBAAgB;CACpB,IAAI,aAAa;CACjB,IAAI,kBAAkB;CACtB,IAAI,YAAY;CAChB,IAAI,gBAAgB;CACpB,IAAI,0BAA0B;CAC9B,MAAM,+BAAe,IAAI,IAAY;CACrC,MAAM,gCAAgB,IAAI,IAAoB;CAE9C,KAAK,MAAM,SAAS,QAClB,QAAQ,MAAM,MAAd;EACE,KAAK;GACH,UAAU,MAAM;GAChB,KAAK,KAAK,OAAO;GACjB,kBAAkB;GAClB,gBAAgB;GAChB,UAAU;GACV;EAEF,KAAK,UAAU;GACb,MAAM,SAAS,MAAM;GACrB,KAAK,MAAM,QAAQ,UAAU,OAAO,IAAI,GAAG,aAAa,IAAI,IAAI;GAChE,cAAc,IAAI,SAAS,cAAc,IAAI,MAAM,KAAK,KAAK,CAAC;GAC9D,IAAI,CAAC,OAAO,cAAc,0BAA0B;GACpD,MAAM,MAAM,WAAW,OAAO,IAAI;GAGlC,IAAI,MAAM,KAAK,CAAC,OAAO,mBAAmB;IACxC,UAAU;KAAE;KAAQ,UAAU;IAAE;IAChC,gBAAgB;IAChB,aAAa;GACf,OACE,UAAU;GAEZ;EACF;EACA,KAAK;GAEH,UAAU;GACV;EAEF,KAAK;GACH,IAAI,WAAW,gBAAgB,YAAY;IACzC,iBAAiB;IACjB,UAAU;KAAE,QAAQ,QAAQ;KAAQ,UAAU;IAAc;IAC5D,IAAI,iBAAiB,YAAY,UAAU;GAC7C,OAAO;IACL,mBAAmB;IACnB,gBAAgB;IAChB,UAAU;GACZ;GACA;EAEF,KAAK;GACH,YAAY;GACZ,UAAU;GACV;EAEF,KAAK,kBACH,UAAU;CAGd;CAGF,MAAM,mBAA6B,CAAC;CACpC,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,OAAO,CAAC,WAAW,cAAc,WAAW,iBAAiB,GACtE,KAAK,MAAM,UAAU,IAAI,OAAO,GAC9B,IAAI,CAAC,KAAK,IAAI,MAAM,GAAG;EACrB,KAAK,IAAI,MAAM;EACf,iBAAiB,KAAK,MAAM;CAC9B;CAIJ,OAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF;AACF;;AAGA,SAAS,gBACP,MACA,KACS;CACT,OAAO,KAAK,MAAM,YAAY,QAAQ,mBAAmB,IAAI;AAC/D;;AAGA,SAAS,iBAAiB,MAAuC;CAC/D,IAAI,aAAa,CAAC,GAAG;CACrB,KAAK,MAAM,WAAW,MAAM;EAC1B,MAAM,aAAa,QAAQ,kBAAkB;EAC7C,IAAI,YAAY,aAAa,UAAU,UAAU;CACnD;CACA,OAAO;AACT;;AAGA,eAAe,eAAe,SAAiB,UAA0C;CAIvF,MAAM,EAAE,gBAAiB,MAAM,OAAO;CAMtC,MAAM,QAAQ,QAAQ,YAAY,GAAG;CACrC,MAAM,MAAM,SAAS,IAAI,QAAQ,MAAM,GAAG,QAAQ,CAAC,IAAI;CACvD,MAAM,OAAO,SAAS,IAAI,QAAQ,MAAM,QAAQ,CAAC,IAAI;CACrD,MAAM,cAAc,aAAa;CACjC,IAAI;CACJ,IAAI;EACF,UAAU,YAAY,OAAO,KAAK,EAAE,eAAe,KAAK,CAAC;CAC3D,QAAQ;EACN,OAAO,CAAC;CACV;CACA,MAAM,aAA0B,CAAC;CACjC,KAAK,MAAM,SAAS,SAAuD;EACzE,IAAI,CAAC,MAAM,KAAK,WAAW,IAAI,GAAG;EAClC,MAAM,QAAQ,MAAM,YAAY;EAChC,IAAI,eAAe,CAAC,OAAO;EAC3B,WAAW,KAAK,EAAE,OAAO,GAAG,MAAM,MAAM,OAAO,QAAQ,MAAM,KAAK,CAAC;CACrE;CACA,OAAO;AACT;;AAGA,eAAe,UAAU,KAAU,QAAkB,SAAuC;CAC1F,MAAM,aAA0B,CAAC;CAEjC,KAAK,MAAM,cAAc,IAAI,eAAe,CAAC,GAC3C,WAAW,KACT,OAAO,eAAe,WAClB,EAAE,OAAO,WAAW,IACpB;EAAE,OAAO,UAAU,WAAW,IAAI,CAAC,CAAC;EAAI,aAAa,WAAW;CAAY,CAClF;CAGF,KAAK,MAAM,aAAa,UAAU,IAAI,UAAU,GAAG;EACjD,IAAI,CAAC,UAAU,QAAQ;EACvB,MAAM,WAAW,MAAM,UAAU,OAAO,CAAC,GAAG,QAAQ,OAAO,CAAC;EAC5D,KAAK,MAAM,cAAc,UACvB,WAAW,KACT,OAAO,eAAe,WAClB,EAAE,OAAO,WAAW,IACpB;GAAE,OAAO,UAAU,WAAW,IAAI,CAAC,CAAC;GAAI,aAAa,WAAW;EAAY,CAClF;CAEJ;CAEA,IAAI,IAAI,UACN,WAAW,KAAK,GAAI,MAAM,eAAe,SAAS,IAAI,QAAQ,CAAE;CAGlE,OAAO;AACT;;AAGA,SAAS,cAAc,SAAqB,OAAgC;CAC1E,MAAM,OAAO,QAAQ,QAAQ,IAAI;CACjC,IAAI,KAAK,WAAW,GAAG,OAAO,KAAA;CAC9B,IAAI,QAAQ,KAAK,QAAQ,OAAO,KAAK;CACrC,MAAM,OAAO,KAAK,KAAK,SAAS;CAChC,OAAO,MAAM,aAAa,OAAO,KAAA;AACnC;;;;;;AAkBA,eAAsB,gBAAgB,KAA8C;CAClF,MAAM,QAAQ,aAAa,IAAI,MAAM,IAAI,MAAM;CAC/C,MAAM,aAAa,iBAAiB,MAAM,IAAI;CAE9C,MAAM,cAAc,MAAM,mBAAmB,OAAO,KAAK,UAAU;CACnE,IAAI,aAAa,OAAO;CAExB,OAAO,qBAAqB,OAAO,KAAK,UAAU;AACpD;;;;;;AAOA,eAAe,mBACb,OACA,KACA,YAC6B;CAC7B,MAAM,SAAS,CAAC,GAAG,IAAI,MAAM;CAG7B,KAAK,MAAM,aAAa,YAAY;EAClC,MAAM,KAAK,IAAI,QAAQ,QAAQ,SAAS;EACxC,IAAI,MAAM,GAAG;EACb,MAAM,aAAa,IAAI,QAAQ,MAAM,GAAG,EAAE;EAC1C,MAAM,SAAS,MAAM,iBAAiB,MAAM,cAC1C,UAAU,UAAU,IAAI,CAAC,CAAC,SAAS,UAAU,CAC/C;EACA,MAAM,MAAM,UAAW,QAAQ,OAAO,IAAI,CAAC,CAAW;EACtD,IAAI,UAAU,KAGZ,QAAO,MADc,UAAU,KAAK,QADhB,IAAI,QAAQ,MAAM,KAAK,UAAU,MACC,CAAC,EAAA,CACzC,KAAK,eAAe;GAChC,OAAO,GAAG,aAAa,YAAY,UAAU;GAC7C,aAAa,UAAU;EACzB,EAAE;CAEN;CAGA,IAAI,MAAM,SAAS;EACjB,MAAM,MAAO,QAAQ,MAAM,QAAQ,OAAO,IAAI,CAAC,CAAW,MAAM,QAAQ;EACxE,OAAO,MAAM,UAAU,KAAK,QAAQ,IAAI,OAAO,IAAI,CAAC;CACtD;CAEA,OAAO;AACT;;AAGA,eAAe,qBACb,OACA,KACA,YACsB;CACtB,MAAM,aAA0B,CAAC;CACjC,MAAM,SAAS,CAAC,GAAG,IAAI,MAAM;CAE7B,MAAM,oBAAoB,gBAAgB,MAAM,MAAM,2BAA2B;CACjF,MAAM,kBACJ,CAAC,sBAAsB,IAAI,QAAQ,WAAW,GAAG,KAAK,IAAI,QAAQ,WAAW,GAAG;CAIlF,MAAM,aAAa,EAAE,IAAI,eAAe;CACxC,MAAM,cAAc,CAAC,IAAI,eAAe,mBAAmB;CAE3D,IAAI,YAAY;EACd,MAAM,aAAa,cAAc,MAAM,SAAS,MAAM,eAAe;EACrE,IAAI,YACF,WAAW,KAAK,GAAI,MAAM,UAAU,YAAY,QAAQ,IAAI,OAAO,CAAE;EAGvE,IAAI,MAAM,WAAW,OAAO;EAG5B,IAAI,CAAC,MAAM,iBAAiB,CAAC,MAAM,yBACjC,KAAK,MAAM,OAAO,MAAM,QAAQ,eAAe,CAAC,GAAG;GACjD,IAAI,IAAI,QAAQ;GAChB,MAAM,cAAc,UAAU,IAAI,WAAW;GAC7C,KAAK,MAAM,SAAS,UAAU,IAAI,IAAI,GACpC,WAAW,KAAK;IAAE,OAAO;IAAO;GAAY,CAAC;EAEjD;CAEJ,OAAO,IAAI,MAAM,WAEf,OAAO;CAIT,MAAM,iBACJ,MAAM,iBAAiB,gBAAgB,MAAM,MAAM,6BAA6B;CAClF,IAAI,eAAe,CAAC,gBAClB,WAAW,KAAK,GAAG,iBAAiB,OAAO,UAAU,CAAC;CAGxD,OAAO;AACT;;AAGA,SAAS,iBAAiB,OAAwB,YAAmC;CACnF,MAAM,WAAwB,CAAC;CAC/B,MAAM,WAAwB,CAAC;CAE/B,KAAK,MAAM,UAAU,MAAM,kBAAkB;EAC3C,IAAI,OAAO,QAAQ;EAGnB,MAAM,QAAQ,MAAM,cAAc,IAAI,MAAM,KAAK;EACjD,IAAI,QAAQ,GAAG;GACb,IAAI,CAAC,OAAO,cAAc;GAC1B,IAAI,OAAO,OAAO,iBAAiB,YAAY,SAAS,OAAO,cAC7D;EAEJ;EAGA,IAAI,OAAO,aAAa,MAAM,SAAS,MAAM,aAAa,IAAI,IAAI,CAAC,GAAG;EAOtE,IANkB,MAAM,iBAAiB,MACtC,UACC,UAAU,UACV,UAAU,MAAM,IAAI,CAAC,CAAC,MAAM,SAAS,MAAM,aAAa,IAAI,IAAI,CAAC,KACjE,MAAM,aAAa,MAAM,SAAS,UAAU,OAAO,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAE/D,GAAG;EAEf,IAAI,cAAc,UAAU,OAAO,WAAW;EAC9C,IAAI,OAAO,WAAW;GACpB,MAAM,QAAQ,OAAO,UAAU,KAAK,IAAI;GACxC,cAAc,cAAc,GAAG,YAAY,aAAa,MAAM,KAAK,YAAY;EACjF;EACA,IAAI,OAAO,YACT,cAAc,cAAc,GAAG,YAAY,eAAe;EAK5D,MAAM,MACJ,OAAO,sBAAsB,OACzB,WAAW,KACX,OAAO,OAAO,sBAAsB,WAClC,OAAO,oBACP,KAAA;EAER,MAAM,SAAS,OAAO,aAAa,WAAW;EAC9C,KAAK,MAAM,SAAS,UAAU,OAAO,IAAI,GACvC,OAAO,KAAK;GAAE,OAAO,MAAM,GAAG,QAAQ,QAAQ;GAAO;EAAY,CAAC;CAEtE;CAEA,OAAO,CAAC,GAAG,UAAU,GAAG,QAAQ;AAClC;;;;;;AAOA,SAAS,kBAAkB,MAAY,OAAsB;CAC3D,MAAM,KAAK,SAAS,KAAK,IAAI;CAC7B,MAAM,OAAO,KAAK;CAClB,IAAI,UAAU,QACZ,OAAO;EACL,IAAI,GAAG;EACP;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,gBAAgB,GAAG,YAAY,QAAQ,IAAI;CAC7C,CAAC,CAAC,KAAK,IAAI;CAEb,IAAI,UAAU,OACZ,OAAO;EACL,YAAY;EACZ,IAAI,GAAG;EACP;EACA;EACA;EACA;EACA;EACA;EACA;EACA,yBAAyB,QAAQ,IAAI,EAAE;EACvC;EACA,IAAI,GAAG;CACT,CAAC,CAAC,KAAK,IAAI;CAGb,OAAO;EACL,cAAc,GAAG;EACjB;EACA;EACA;EACA;EACA;EACA;EACA,eAAe,UAAU,IAAI,EAAE,aAAa,GAAG;CACjD,CAAC,CAAC,KAAK,IAAI;AACb;;AAKA,SAAgB,cAAc,MAAY,OAAc,OAAa,WAAmB;CACtF,IAAI,SAAS,WAAW,OAAO,kBAAkB,MAAM,KAAK;CAC5D,MAAM,QAAQ,KAAK,IAAI;CACvB,QAAQ,OAAR;EACE,KAAK,QACH,OAAO,WAAW,MAAM,KAAK;EAC/B,KAAK,OACH,OAAO,UAAU,MAAM,KAAK;EAC9B,KAAK,QACH,OAAO,WAAW,MAAM,KAAK;CACjC;AACF;;AAKA,SAAS,WAAW,MAAY,UAAgC;CAC9D,IAAI,UAAU;CACd,IAAI,qBAA+B,CAAC;CAEpC,KAAK,MAAM,WAAW,SAAS,MAAM;EACnC,qBAAqB,CACnB,GAAG,oBACH,IAAI,QAAQ,WAAW,CAAC,EAAA,CAAG,QAAQ,WAAW,OAAO,YAAY,CACnE;EACA,MAAM,SAAS,QAAQ,eAAe,CAAC,EAAA,CAAG,MAAM,QAAQ,UAAU,IAAI,IAAI,CAAC,CAAC,SAAS,OAAO,CAAC;EAC7F,IAAI,CAAC,OAAO,OAAO;EACnB,UAAU;CACZ;CAEA,IAAI;CACJ,IAAI,SAAS,WAAW,KAAA,GAAW;EAEjC,MAAM,SAAS,CADI,GAAG,oBAAoB,GAAI,QAAQ,WAAW,CAAC,CAC3C,CAAC,CAAC,MAAM,cAC7B,UAAU,UAAU,IAAI,CAAC,CAAC,SAAS,SAAS,MAAO,CACrD;EACA,IAAI,CAAC,QAAQ,OAAO;EACpB,OAAO,QAAQ,OAAO,IAAI;CAC5B,OACE,OAAO,QAAQ,QAAQ,IAAI;CAG7B,OAAO,KAAK,SAAS,aAAa;AACpC;;;;;AAMA,eAAe,oBACb,MACA,SACA,QAC0B;CAC1B,IAAI;CACJ,IAAI;EACF,WAAW,eAAe,OAAO;CACnC,QAAQ;EACN,OAAO;CACT;CAEA,MAAM,MAAM,WAAW,MAAM,QAAQ;CACrC,IAAI,CAAC,KAAK,OAAO;CAEjB,MAAM,YAAmC,UAAU,IAAI,UAAU,CAAC,CAAC,SAAS;CAC5E,IAAI,CAAC,WAAW,QAAQ,OAAO;CAG/B,QAAO,MADmB,UAAU,OAAO,MAAM,EAAA,CAC9B,KAAK,eACtB,OAAO,eAAe,WAAW,aAAa,UAAU,WAAW,IAAI,CAAC,CAAC,EAC3E;AACF;;AAkEA,MAAa,aAAyB;CACpC,MAAM;CACN,aAAa;CACb,MAAM;EACJ,MAAM;EACN,YAAY;EACZ,aAAa;CACf;CACA,SAAS,CACP;EACE,MAAM;EACN,aAAa;EACb,aAAa,CAAC,SAAS;CACzB,GACA;EACE,MAAM;EACN,aAAa;EACb,aAAa,CAAC,WAAW;CAC3B,CACF;CACA,aAAa,CAAC;EAnDd,MAAM;EACN,aAAa;EACb,QAAQ;EACR,SAAS,CACP;GACE,MAAM;GACN,aAAa;EACf,CACF;EACA,MAAM;GAAE,MAAM;GAAU,YAAY;GAAM,YAAY;EAAK;EAC3D,MAAM,OAAO,EAAE,MAAM,MAAM,WAAW;GACpC,MAAM,OAAO,KAAK;GAClB,MAAM,UAAU,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,KAAK;GAQ1D,MAAM,SAAQ,MANW,gBAAgB;IACvC;IACA,QAHa,KAAK,MAAM,GAAG,EAGtB;IACL;IACA,aAAa,QAAQ,IAAI,gBAAgB;GAC3C,CAAC,EAAA,CACwB,KAAK,cAC5B,UAAU,cAAc,GAAG,UAAU,MAAM,IAAI,UAAU,gBAAgB,UAAU,KACrF;GACA,IAAI,MAAM,SAAS,GAAG,MAAM,MAAM,KAAK,IAAI,CAAC;GAC5C,OAAO;EACT;CA0Bc,GAAiB;EA/E/B,MAAM;EACN,aAAa;EACb,QAAQ;EACR,MAAM,CAAC,EAAE,MAAM,WAAW,GAAG;GAAE,MAAM;GAAU,YAAY;GAAM,YAAY;EAAK,CAAC;EACnF,MAAM,OAAO,EAAE,MAAM,MAAM,CAAC,SAAS,GAAG,WAAW;GACjD,MAAM,OAAO,KAAK;GAClB,IAAI,YAAY,KAAA,GAAW;IACzB,iBAAiB,4BAA4B;IAC7C,OAAO;GACT;GACA,MAAM,cAAc,MAAM,oBAAoB,MAAM,SAAS,MAAM;GACnE,IAAI,gBAAgB,MAAM;IACxB,iBAAiB,+BAA+B,QAAQ,EAAE;IAC1D,OAAO;GACT;GACA,IAAI,YAAY,SAAS,GACvB,MAAM,YAAY,KAAK,IAAI,CAAC;GAE9B,OAAO;EACT;CA4D+B,CAA0B;CACzD,OAAO,EAAE,MAAM,CAAC,OAAO,MAAM,CAAC,QAAQ,SAAS,QAAQ;EACrD,IAAI,UAAU,KAAA,GAAW;GACvB,MAAM,qBAAqB,OAAO,KAAK,IAAI,GAAG;GAC9C,OAAO;EACT;EAEA,IAAI,CAAC,QAAQ,KAAK,GAAG;GACnB,iBACE,sBAAsB,MAAM,OAAO,KAAK;IACtC,aAAa;IACb,YAAY;KAAE,OAAO;KAAO,SAAS;IAAmB;GAC1D,CAAC,GACH;GACA,OAAO;EACT;EAGA,MAAM,cAAc,MAAM,OADP,QAAQ,IAAI,SAAS,IAAI,UAAU,SACjB,CAAC;EACtC,OAAO;CACT;AACF;;;;;;;;;ACpnCA,eAAsB,IAAI,MAAY,OAA0B,YAAY,GAAoB;CAC9F,IAAI;CAEJ,IAAI;EACF,SAAS,MAAM,MAAM,IAAI;CAC3B,SAAS,OAAgB;EACvB,IAAI,iBAAiB,eAAe;GAClC,MAAM,cAAc,QAAQ,MAAM,QAAQ,MAAM;IAC9C,aAAa;IACb,YAAY;KACV,OAAO,MAAM;KACb,SAAS,MAAM;IACjB;GACF,CAAC;GACD,WAAW,GAAG,MAAM,QAAQ,MAAM,aAAa;EACjD,OAAO,IAAI,iBAAiB,YAC1B,WAAW,GAAG,MAAM,QAAQ,MAAM,QAAQ,MAAM,QAAQ,MAAM,EAAE,aAAa,MAAM,CAAC,GAAG;OAEvF,WAAW,GAAG,OAAO;EAEvB,OAAO;CACT;CAEA,MAAM,SAAS,OAAO,cAAc,GAAG,EAAE,KAAK,OAAO,QAAQ,GAAG,EAAE;CAClE,IAAI,CAAC,QACH,OAAO;CAGT,MAAM,UAAU,OAAO;CACvB,MAAM,aAAyB;EAC7B,OAAO,gBAAgB,QAAQ,aAAa,QAAQ,OAAO,MAAM,WAAW;EAC5E,MAAM,OAAO;EACb,MAAM,OAAO;EACb,mBAAmB,OAAO;EAC1B,SAAS;GACP;GACA,MAAM,SAAS,QAAQ,IAAI,IAAI;GAC/B,MAAM,SAAS,QAAQ,IAAI,IAAI,CAAC,GAAG;GACnC,MAAM,SAAS,QAAQ,IAAI,IAAI;GAC/B,QAAQ,SAAS,QAAQ,IAAI,IAAI,CAAC,EAAE,UAAU;EAChD;CACF;CAEA,IAAI;CACJ,IAAI;EACF,MAAM,eAAe,OAAO,UAAU;EACtC,WAAW,OAAO,iBAAiB,WAAW,MAAM,eAAe;CACrE,SAAS,OAAO;EACd,WAAW,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;EACjE,OAAO;CACT;CAEA,OAAO,KAAK,IAAI,KAAK,IAAI,YAAY,GAAG,CAAC,GAAG,GAAG;AACjD;AAEA,SAAgB,WAAW,GAAG,SAA0B;CACtD,QAAQ,MAAM,UAAU,GAAG,OAAO;AACpC;AAEA,SAAS,cAAiC;CAIxC,OAAOC,WAAa,SAAS,MAAM,MAAM,CAAC,KAAK,CAAC;AAClD;;ACnDA,IAAA,cAAe;CACb;CACA;CACA;CACA;CACA;AACF"}
+{"version":3,"file":"index.js","names":["hasName","builtinUsageAction","maybeProcess"],"sources":["../src/util.ts","../src/suggest.ts","../src/subcommands.ts","../src/directives.ts","../src/scope.ts","../src/help.ts","../src/errors.ts","../src/parse.ts","../src/completion.ts","../src/run.ts","../src/index.ts"],"sourcesContent":["import type { Arg, NonEmptyArray } from \"./types.js\";\n\nexport function isArray<T>(o: T | readonly T[]): o is readonly T[] {\n  return Array.isArray(o);\n}\n\n/** Convert the value, if any, to an array with 0 or more elements */\nexport function makeArray<T>(thing: T | readonly T[] | undefined): T[] {\n  if (thing === undefined) {\n    return [];\n  }\n  if (isArray(thing)) {\n    return thing.slice();\n  }\n  return [thing];\n}\n\n/**\n * Like {@link makeArray}, but without copying when the input is already an\n * array. Only safe when the caller treats the result as read-only — use it on\n * the hot path to avoid slicing read-only spec metadata.\n */\nexport function asArray<T>(thing: T | readonly T[] | undefined): readonly T[] {\n  if (thing === undefined) {\n    return [];\n  }\n  if (isArray(thing)) {\n    return thing;\n  }\n  return [thing];\n}\n\n/** Convert the value to an array with at least one element */\nexport function makeArray1<T>(thing: T | NonEmptyArray<T>): [T, ...T[]] {\n  if (isArray(thing)) {\n    // We know that this array has at least one element in it\n    return thing.slice() as [T, ...T[]];\n  }\n  return [thing];\n}\n\nexport function assert(expr: unknown, msg = \"\"): asserts expr {\n  if (!expr) {\n    throw new Error(msg);\n  }\n}\n\n// Output {{{\n\ninterface WriteSyncFs {\n  writeSync(fd: number, buffer: Uint8Array, offset: number, length: number): number;\n}\n\ninterface NodeProcess {\n  getBuiltinModule?(id: \"node:fs\"): WriteSyncFs;\n  stdout?: { write(data: Uint8Array): unknown };\n  stderr?: { write(data: Uint8Array): unknown };\n}\n\nconst nodeProcess = (globalThis as { process?: NodeProcess }).process;\n\n/**\n * Write text to stdout (1) or stderr (2) with a synchronous `write` on the file\n * descriptor.\n *\n * The first `console.log` in a Node process builds the stdout stream, which\n * costs 1-3 ms. That's more than parsing takes, so all of this library's output\n * goes through here instead. Without `node:fs` it falls back to `console`.\n */\nfunction writeFd(fd: 1 | 2, text: string): void {\n  const fs = nodeProcess?.getBuiltinModule?.(\"node:fs\");\n  if (!fs) {\n    (fd === 1 ? console.log : console.error)(text.endsWith(\"\\n\") ? text.slice(0, -1) : text);\n    return;\n  }\n  const bytes = new TextEncoder().encode(text);\n  let offset = 0;\n  try {\n    while (offset < bytes.length) {\n      offset += fs.writeSync(fd, bytes, offset, bytes.length - offset);\n    }\n  } catch (error) {\n    const code = (error as { code?: string }).code;\n    // A non-blocking pipe that's full: let Node's stream queue the rest.\n    if (code === \"EAGAIN\") {\n      (fd === 1 ? nodeProcess?.stdout : nodeProcess?.stderr)?.write(bytes.subarray(offset));\n    }\n    // Anything else, like EPIPE from `cli --help | head -1`, is dropped, the\n    // same as `console` does.\n  }\n}\n\n/**\n * Where this library's output goes. Tests replace `write` to capture output.\n *\n * @internal\n */\nexport const output: { write: (fd: 1 | 2, text: string) => void } = { write: writeFd };\n\n/** Print a message to stdout, trimming trailing whitespace. */\nexport function print(text: string): void {\n  output.write(1, `${text.trimEnd()}\\n`);\n}\n\n/** Print `Error:` and the given values to stderr, separated by spaces. */\nexport function printError(...strings: unknown[]): void {\n  output.write(2, `${[\"Error:\", ...strings].map(String).join(\" \")}\\n`);\n}\n\n// }}}\n\n/**\n * Add the defaults of the arguments from index `from` on to `values`, stopping\n * at the first argument without one. The parser and help both use this, so\n * help only shows the defaults the parser uses.\n */\nexport function addDefaults(values: string[], args: readonly Arg[], from = 0): void {\n  for (let i = from; i < args.length; i++) {\n    const value = args[i].default;\n    if (value === undefined) {\n      return;\n    }\n    values.push(value);\n  }\n}\n\n/**\n * Returns the minimum number of arguments that satisfies the args.\n *\n * Accepts the raw spec value (a single arg, an array, or `undefined`) so the\n * hot path doesn't have to copy it into an array first.\n */\nexport function getMinArgs(\n  args: { isOptional?: boolean } | readonly { isOptional?: boolean }[] | undefined,\n): number {\n  if (args === undefined) {\n    return 0;\n  }\n  if (!isArray(args)) {\n    return args.isOptional ? 0 : 1;\n  }\n  let count = 0;\n  for (let i = 0; i < args.length; i++) {\n    if (args[i].isOptional) {\n      break;\n    }\n    count++;\n  }\n  return count;\n}\n\n/** Returns the maximum number of arguments that satisfies the args. */\nexport function getMaxArgs(\n  args: { isVariadic?: boolean } | readonly { isVariadic?: boolean }[] | undefined,\n): number {\n  if (args === undefined) {\n    return 0;\n  }\n  if (!isArray(args)) {\n    return args.isVariadic ? Infinity : 1;\n  }\n  // Loop over the array backwards because variadic arguments are\n  // more likely to be at the end of the array. They don't _need_\n  // to be, but it's more idiomatic.\n  for (let i = 0; i < args.length; i++) {\n    if (args[args.length - 1 - i].isVariadic) {\n      return Infinity;\n    }\n  }\n  // None of the arguments are variadic, max is the number of args\n  return args.length;\n}\n","/**\n * \"Did you mean\" suggestions for unknown commands and options.\n *\n * This only runs after a mistake, but it's loaded on every run, so it's kept\n * small and does nothing until it's called.\n *\n * @module\n */\n\n/** How many `-` or `+` characters `name` starts with. */\nfunction dashCount(name: string): number {\n  let i = 0;\n  while (i < name.length && (name[i] === \"-\" || name[i] === \"+\")) {\n    i++;\n  }\n  return i;\n}\n\n/** Whether every character of `short` appears in `long`, in order. */\nfunction isAbbreviation(short: string, long: string): boolean {\n  let i = 0;\n  for (let j = 0; j < long.length && i < short.length; j++) {\n    if (long[j] === short[i]) {\n      i++;\n    }\n  }\n  return i === short.length;\n}\n\n/**\n * Levenshtein distance where swapping two adjacent characters also counts as\n * one edit (optimal string alignment). Returns `limit + 1` as soon as the\n * distance must be larger than `limit`.\n */\nfunction editDistance(a: string, b: string, limit: number): number {\n  // Three rows of the usual table: two rows back, the previous row and this one.\n  let before = new Uint32Array(b.length + 1);\n  let previous = new Uint32Array(b.length + 1);\n  let current = new Uint32Array(b.length + 1);\n  for (let j = 0; j <= b.length; j++) {\n    previous[j] = j;\n  }\n\n  for (let i = 1; i <= a.length; i++) {\n    current[0] = i;\n    let rowMin = i;\n    for (let j = 1; j <= b.length; j++) {\n      const substitution = previous[j - 1] + (a[i - 1] === b[j - 1] ? 0 : 1);\n      let d = Math.min(previous[j] + 1, current[j - 1] + 1, substitution);\n      if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {\n        d = Math.min(d, before[j - 2] + 1);\n      }\n      current[j] = d;\n      if (d < rowMin) {\n        rowMin = d;\n      }\n    }\n    // Every later row is at least this row's minimum.\n    if (rowMin > limit) {\n      return limit + 1;\n    }\n    const recycled = before;\n    before = previous;\n    previous = current;\n    current = recycled;\n  }\n  return previous[b.length];\n}\n\n/**\n * A name to suggest, or every name of one command or option. The names of one\n * command or option count as one choice, so an alias can't make a match\n * ambiguous.\n */\nexport type Choice = string | readonly string[];\n\n/** The first name of the only choice with a name that `matches`, if exactly one has one. */\nfunction onlyMatch(choices: readonly Choice[], matches: (name: string) => boolean): string | undefined {\n  let match: string | undefined;\n  for (const choice of choices) {\n    const name = (typeof choice === \"string\" ? [choice] : choice).find(matches);\n    if (name === undefined) {\n      continue;\n    }\n    if (match !== undefined) {\n      return undefined;\n    }\n    match = name;\n  }\n  return match;\n}\n\n/**\n * The name the user most likely meant by `input`, or `undefined` if none is\n * close enough to be worth suggesting. In order:\n *\n * 1. The only choice that starts with the input (`--verb` for `--verbose`).\n * 2. The only choice that contains every character of the input in order, for\n *    inputs of 3 or more characters (`bld` for `build`).\n * 3. The name with the fewest edits, allowing one edit per three characters\n *    of the input. Leading dashes don't count toward the length or the edits.\n */\nexport function closestChoice(input: string, choices: readonly Choice[]): string | undefined {\n  const inputDashes = dashCount(input);\n  const bare = input.slice(inputDashes);\n\n  if (bare.length >= 2) {\n    const match = onlyMatch(choices, (name) => name.startsWith(input));\n    if (match !== undefined) {\n      return match;\n    }\n  }\n\n  if (bare.length >= 3) {\n    const match = onlyMatch(choices, (name) => isAbbreviation(bare, name.slice(dashCount(name))));\n    if (match !== undefined) {\n      return match;\n    }\n  }\n\n  let best: string | undefined;\n  let limit = Math.floor(bare.length / 3);\n  for (const name of choices.flat()) {\n    const other = name.slice(dashCount(name));\n    // The length difference is a lower bound on the number of edits.\n    if (Math.abs(other.length - bare.length) > limit) {\n      continue;\n    }\n    const distance = editDistance(bare, other, limit);\n    if (distance <= limit && (best === undefined || distance < limit)) {\n      best = name;\n      // Later names have to be strictly closer to replace this one.\n      limit = distance;\n      if (distance === 0) {\n        break;\n      }\n    }\n  }\n  return best;\n}\n","import type { Action, Subcommand } from \"./types.js\";\nimport type { Directives } from \"./directives.js\";\nimport type { DidYouMean } from \"./errors.js\";\nimport { asArray, print } from \"./util.js\";\n\n/** The subcommand a token names, or why it names none. See {@link matchSubcommand}. */\nexport type SubcommandMatch = { command: Subcommand } | NoSubcommand;\n\n/**\n * Find the subcommand `token` names among `subcommands`, in a command where\n * `directives` are in effect, or else among the persistent subcommands the\n * command `inherited`. An exact name always wins. With\n * `subcommandsMatchUniquePrefix`, a token that's a prefix of exactly one\n * of the command's own names matches that command, unless `exactOnly`. A\n * hidden or inherited command only matches its exact name, so it can't make a\n * visible command's prefix ambiguous or take a prefix meant as an argument,\n * and an empty token is no command's prefix.\n */\nexport function matchSubcommand(\n  subcommands: readonly Subcommand[],\n  token: string,\n  directives: Readonly<Directives>,\n  exactOnly = false,\n  inherited: readonly Subcommand[] = [],\n): SubcommandMatch {\n  for (const candidate of subcommands) {\n    if (hasName(candidate, token)) {\n      return { command: candidate };\n    }\n  }\n  for (const candidate of inherited) {\n    if (hasName(candidate, token)) {\n      return { command: candidate };\n    }\n  }\n  const allowPrefix = directives.subcommandsMatchUniquePrefix && !exactOnly;\n  const matches = allowPrefix ? prefixMatches(subcommands, token) : [];\n  if (matches.length === 1) {\n    return { command: matches[0] };\n  }\n  return new NoSubcommand(withInherited(subcommands, inherited), token, matches);\n}\n\n/**\n * A command's own `subcommands` followed by the `inherited` ones it can use,\n * leaving out each inherited one that an earlier command shadows a name of.\n */\nexport function withInherited(\n  subcommands: readonly Subcommand[],\n  inherited: readonly Subcommand[],\n): readonly Subcommand[] {\n  if (inherited.length === 0) {\n    return subcommands;\n  }\n  const all = [...subcommands];\n  for (const candidate of inherited) {\n    if (!asArray(candidate.name).some((name) => all.some((earlier) => hasName(earlier, name)))) {\n      all.push(candidate);\n    }\n  }\n  return all;\n}\n\nfunction hasName(command: Subcommand, token: string): boolean {\n  const names = command.name;\n  return typeof names === \"string\" ? names === token : names.includes(token);\n}\n\n/** The visible commands that `token` is a prefix of a name of, each listed once. */\nfunction prefixMatches(subcommands: readonly Subcommand[], token: string): Subcommand[] {\n  if (token === \"\") {\n    return [];\n  }\n  return subcommands.filter(\n    (candidate) => !candidate.hidden && asArray(candidate.name).some((name) => name.startsWith(token)),\n  );\n}\n\n/**\n * A token that names no subcommand. The reason is only worked out when asked\n * for, since most tokens the parser tries aren't subcommands.\n */\nexport class NoSubcommand {\n  readonly command = null;\n\n  /**\n   * `prefixOf` are the commands `token` is a prefix of a name of, where\n   * prefixes match. There is never exactly one of them.\n   */\n  constructor(\n    private readonly subcommands: readonly Subcommand[],\n    private readonly token: string,\n    private readonly prefixOf: readonly Subcommand[],\n  ) {}\n\n  /** Why the token names none of the subcommands, as an error message and suggestions. */\n  reason(): { message: string; didYouMean?: DidYouMean } {\n    const token = this.token;\n    if (token === \"\") {\n      return { message: \"Expected a command, but the value was empty\" };\n    }\n    if (this.prefixOf.length > 0) {\n      const possible = this.prefixOf.flatMap((command) =>\n        asArray(command.name).filter((name) => name.startsWith(token)),\n      );\n      return { message: `Ambiguous command '${token}', could be: ${possible.join(\", \")}` };\n    }\n    const choices = visibleSubcommands(this.subcommands).map((command) => asArray(command.name));\n    return { message: `Unknown command '${token}'`, didYouMean: { input: token, choices } };\n  }\n}\n\n/** The subcommands that help, completion and suggestions show. */\nexport function visibleSubcommands(subcommands: readonly Subcommand[] | undefined): Subcommand[] {\n  return subcommands?.filter((subcommand) => !subcommand.hidden) ?? [];\n}\n\n/** The action of a command that has none of its own: print the command's help. */\nexport const usage: Action = ({ help }) => {\n  print(help());\n  return 0;\n};\n","import type { Spec, Subcommand } from \"./types.js\";\nimport { asArray } from \"./util.js\";\n\n/** The parser directives in effect for a command, with defaults filled in. */\nexport interface Directives {\n  optionArgSeparators: readonly string[];\n  flagsArePosixNoncompliant: boolean;\n  optionsMustPrecedeArguments: boolean;\n  subcommandsMatchUniquePrefix: boolean;\n}\n\n/** The directives in effect when no command sets any. */\nexport function defaultDirectives(): Directives {\n  return {\n    optionArgSeparators: [\"=\"],\n    flagsArePosixNoncompliant: false,\n    optionsMustPrecedeArguments: false,\n    subcommandsMatchUniquePrefix: false,\n  };\n}\n\n/**\n * Update `directives` for entering `command`. A subcommand inherits each\n * directive until it sets its own.\n */\nexport function applyDirectives(directives: Directives, command: Spec | Subcommand): void {\n  const configured = command.parserDirectives;\n  if (!configured) {\n    return;\n  }\n  if (configured.optionArgSeparators) {\n    directives.optionArgSeparators = asArray(configured.optionArgSeparators);\n  }\n  if (typeof configured.subcommandsMatchUniquePrefix === \"boolean\") {\n    directives.subcommandsMatchUniquePrefix = configured.subcommandsMatchUniquePrefix;\n  }\n  if (typeof configured.optionsMustPrecedeArguments === \"boolean\") {\n    directives.optionsMustPrecedeArguments = configured.optionsMustPrecedeArguments;\n  }\n  if (typeof configured.flagsArePosixNoncompliant === \"boolean\") {\n    directives.flagsArePosixNoncompliant = configured.flagsArePosixNoncompliant;\n  }\n}\n","import type { Option, Spec, Subcommand } from \"./types.js\";\nimport { applyDirectives, defaultDirectives } from \"./directives.js\";\nimport type { Directives } from \"./directives.js\";\nimport { asArray, getMaxArgs } from \"./util.js\";\n\n/** An option that can be used here, and the names that still refer to it. */\nexport interface VisibleOption {\n  option: Option;\n  names: string[];\n}\n\n/** How one name of an option is written with its value, at one command. */\nexport interface OptionForm {\n  name: string;\n  /**\n   * What joins the name to the option's first value in the same token, or null\n   * if the value is the next token. It's the required separator for an option\n   * that requires one, and \"\" for an option named \"-\" or \"+\", which reads its\n   * value straight after the name, like `-5`. It's null for an option without\n   * arguments.\n   */\n  join: string | null;\n}\n\n/**\n * The options and directives in effect at one command on a path.\n *\n * Moving to a subcommand replaces the local options and adds its persistent\n * options to the inherited ones. A name refers to one option: a local option\n * wins over a persistent one, and a later option wins over an earlier one in\n * the same list. The parser, help, completion and the spec checker all ask\n * this module which option a name refers to, so they can't disagree. It also\n * holds the persistent subcommands the current command inherits.\n */\nexport class OptionScope {\n  /** Non-persistent options of the current command, in definition order. */\n  readonly local: Option[] = [];\n  /** Persistent options from every command on the path, in definition order. */\n  readonly persistent: Option[] = [];\n  /**\n   * Persistent subcommands of the commands above the current one, nearest\n   * command first, so a nearer one wins a name.\n   */\n  readonly inheritedSubcommands: Subcommand[] = [];\n  /** The directives in effect. A subcommand inherits each until it sets its own. */\n  readonly directives: Directives = defaultDirectives();\n  private command: Spec | Subcommand | null = null;\n\n  /** The scope at the last command on `path`. */\n  static at(path: readonly (Spec | Subcommand)[]): OptionScope {\n    const scope = new OptionScope();\n    for (const command of path) {\n      scope.enter(command);\n    }\n    return scope;\n  }\n\n  /** Move to `command`, a subcommand of the current one. */\n  enter(command: Spec | Subcommand): void {\n    const parentSubcommands = this.command?.subcommands;\n    if (parentSubcommands) {\n      const persistent = parentSubcommands.filter((subcommand) => subcommand.isPersistent);\n      if (persistent.length > 0) {\n        this.inheritedSubcommands.unshift(...persistent);\n      }\n    }\n    this.command = command;\n    this.local.length = 0;\n    if (command.options) {\n      for (const option of command.options) {\n        (option.isPersistent ? this.persistent : this.local).push(option);\n      }\n    }\n    applyDirectives(this.directives, command);\n  }\n\n  /** The option `name` refers to, if any. */\n  resolve(name: string): Option | null {\n    const { local, persistent } = this;\n    for (let i = local.length - 1; i >= 0; i--) {\n      if (hasName(local[i].name, name)) {\n        return local[i];\n      }\n    }\n    for (let i = persistent.length - 1; i >= 0; i--) {\n      if (hasName(persistent[i].name, name)) {\n        return persistent[i];\n      }\n    }\n    return null;\n  }\n\n  /**\n   * The options that can be used here, in definition order, each with only\n   * its live names: the names that still refer to it. Options with every name\n   * shadowed are left out.\n   */\n  live(): { local: VisibleOption[]; persistent: VisibleOption[] } {\n    // Which option each name refers to, built in one pass so the later and the\n    // local options overwrite the ones they shadow. Same answer as `resolve`.\n    const owner = new Map<string, Option>();\n    for (const options of [this.persistent, this.local]) {\n      for (const option of options) {\n        for (const name of asArray(option.name)) {\n          owner.set(name, option);\n        }\n      }\n    }\n    const pick = (options: readonly Option[]) => {\n      const picked: VisibleOption[] = [];\n      for (const option of options) {\n        const names = asArray(option.name).filter((name) => owner.get(name) === option);\n        if (names.length > 0) {\n          picked.push({ option, names });\n        }\n      }\n      return picked;\n    };\n    return { local: pick(this.local), persistent: pick(this.persistent) };\n  }\n\n  /** The options a user can see here: the {@link live} ones that aren't hidden. */\n  visible(): { local: VisibleOption[]; persistent: VisibleOption[] } {\n    const { local, persistent } = this.live();\n    const shown = (visible: VisibleOption) => !visible.option.hidden;\n    return { local: local.filter(shown), persistent: persistent.filter(shown) };\n  }\n\n  /** The live names of each option a user could have meant, for \"did you mean\" suggestions. */\n  suggestionNames(): string[][] {\n    const { local, persistent } = this.visible();\n    return [...local, ...persistent].map((visible) => visible.names);\n  }\n\n  /** The options that must be used, local first. */\n  required(): Option[] {\n    return [...this.local, ...this.persistent].filter((option) => option.isRequired);\n  }\n\n  /**\n   * How each of `names` is written with `option`'s value here. Help shows\n   * these, completion offers them, and the spec checker reads each one back\n   * through the parser.\n   */\n  forms(option: Option, names: readonly string[] = asArray(option.name)): OptionForm[] {\n    const join = (name: string): string | null => {\n      if (getMaxArgs(option.args) === 0) {\n        return null;\n      }\n      if (option.requiresSeparator) {\n        return this.requiredSeparator(option);\n      }\n      const glued = !this.directives.flagsArePosixNoncompliant && (name === \"-\" || name === \"+\");\n      return glued ? \"\" : null;\n    };\n    return names.map((name) => ({ name, join: join(name) }));\n  }\n\n  /**\n   * The separator that must come between `option` and its value, or null if\n   * it can take a value as a separate token.\n   */\n  requiredSeparator(option: Option): string | null {\n    const required = option.requiresSeparator;\n    if (typeof required === \"string\") {\n      return required;\n    }\n    return required ? (this.directives.optionArgSeparators[0] ?? \"=\") : null;\n  }\n}\n\nconst optionKeys = new WeakMap<Option, string>();\n\n/**\n * A key for the set of `option`'s names. Options with the same names, in any\n * order, get the same key and are one option: the parser continues a\n * repeatable option's uses across them, counts one as used when the other was,\n * and stores their values under the same names, which is how they're read.\n * Options that share only some names are different options, and each shared\n * name refers to whichever one `resolve` picks.\n */\nexport function optionKey(option: Option): string {\n  let key = optionKeys.get(option);\n  if (key === undefined) {\n    key = typeof option.name === \"string\" ? option.name : [...option.name].sort().join(\"\\0\");\n    optionKeys.set(option, key);\n  }\n  return key;\n}\n\nfunction hasName(names: string | readonly string[], name: string): boolean {\n  return typeof names === \"string\" ? names === name : names.includes(name);\n}\n","import type { Arg, Option, NonEmptyArray, Subcommand } from \"./types.js\";\nimport { closestChoice } from \"./suggest.js\";\nimport { matchSubcommand, visibleSubcommands } from \"./subcommands.js\";\nimport { OptionScope } from \"./scope.js\";\nimport type { OptionForm, VisibleOption } from \"./scope.js\";\nimport type { DidYouMean } from \"./errors.js\";\nimport { addDefaults, asArray, getMaxArgs, makeArray, makeArray1, print, printError } from \"./util.js\";\n\nfunction dedent(str: string) {\n  if (str[0] !== \"\\n\") {\n    return str;\n  }\n  const lines = str.split(\"\\n\").slice(1, -1);\n  const margin = lines[0].length - lines[0].trimStart().length;\n  return lines.map((line) => line.slice(margin)).join(\"\\n\");\n}\n\nexport interface HelpConfig {\n  /** Include the command description? Default: true. */\n  description?: boolean;\n\n  /** Include the usage summary? Default: true. */\n  usage?: boolean;\n\n  /** Ask if the user intended the input to be one of these choices. */\n  didYouMean?: DidYouMean;\n}\n\n/** Get the help message used by the built-in help option and command. */\nexport function getHelp(path: NonEmptyArray<Subcommand>, config: HelpConfig = {}): string {\n  const { description = true, usage = true, didYouMean } = config;\n  const sections = getSections(path);\n  if (didYouMean) {\n    sections.didYouMean = closestChoice(didYouMean.input, didYouMean.choices);\n  }\n  if (!description) {\n    sections.description = undefined;\n  }\n  if (!usage) {\n    sections.usage = undefined;\n  }\n  return formatHelpSections(sections);\n}\n\n/**\n * Print `message` as an error, then the usage and flags of the last command on\n * `path`, suggesting the closest of `didYouMean.choices` if one is close.\n */\nexport function printUsageError(\n  path: NonEmptyArray<Subcommand>,\n  message: string,\n  didYouMean?: DidYouMean,\n): void {\n  printError(`${message}\\n\\n${getHelp(path, { description: false, didYouMean })}`);\n}\n\n/**\n * A subcommand that prints help for its parent, or for the command the names\n * after it lead to from there, so `cli help a b` prints the help of `cli a b`.\n * It reads names until one isn't a subcommand. A token where the command takes\n * arguments, or where it has no subcommands, ends the names, so\n * `cli help completion zsh` prints the help of `completion`. Any other token\n * is an unknown command. Add `{ ...helpCommand, isPersistent: true }` instead\n * to make `cli a b help` work too.\n */\nexport const helpCommand: Subcommand = {\n  name: \"help\",\n  description: \"Print a help message\",\n  args: {\n    name: \"command\",\n    isOptional: true,\n    isVariadic: true,\n  },\n  action({ path, args, help }) {\n    const self = path[path.length - 1];\n    const helpPath = path.slice(0, -1) as unknown as [Subcommand, ...Subcommand[]];\n\n    for (const name of args) {\n      const command = helpPath[helpPath.length - 1];\n      if (!command.subcommands) {\n        break;\n      }\n      // Match the name the way the parser would have matched it in place of `help`.\n      const scope = OptionScope.at(helpPath);\n      const match = matchSubcommand(\n        command.subcommands,\n        name,\n        scope.directives,\n        false,\n        scope.inheritedSubcommands,\n      );\n      // With a persistent help command, `cli help a help` is `cli a help`.\n      if (match.command === self && !command.subcommands.includes(self)) {\n        break;\n      }\n      if (match.command) {\n        helpPath.push(match.command);\n        continue;\n      }\n      if (!command.requiresSubcommand && getMaxArgs(command.args) > 0) {\n        break;\n      }\n      const { message, didYouMean } = match.reason();\n      printUsageError(helpPath, message, didYouMean);\n      return 1;\n    }\n\n    print(help({ path: helpPath }));\n    return 0;\n  },\n};\n\n/** A persistent help option that prints help for the selected command. */\nexport const help: Option = {\n  name: [\"-h\", \"--help\"],\n  description: \"Print a help message\",\n  isPersistent: true,\n  action({ path }) {\n    print(formatHelpSections(getSections(path)));\n    return 0;\n  },\n};\n\ntype HelpSections = {\n  description?: string;\n  usage?: string;\n  didYouMean?: string;\n  args: [name: string, description: string][];\n  options: [formattedName: string, description: string][];\n  persistentOptions: [formattedName: string, description: string][];\n  subcommands: [formattedName: string, description: string][];\n};\n\nfunction getSubcommandPathString(commands: NonEmptyArray<Subcommand>): string {\n  return commands.map((command) => getLongestString(makeArray1(command.name))).join(\" \");\n}\n\nfunction getSections(commands: NonEmptyArray<Subcommand>): HelpSections {\n  const command = commands[commands.length - 1];\n  const scope = OptionScope.at(commands);\n  const show = ({ option, names }: VisibleOption) => optionToString(option, scope.forms(option, names));\n\n  const description = command.description;\n  const defaultDesc = \"No description\";\n\n  const subcommands: HelpSections[\"subcommands\"] = visibleSubcommands(command.subcommands).map(\n    (subcommand) => [\n      makeArray1(subcommand.name)\n        .sort((a, b) => a.length - b.length)\n        .join(\", \"),\n      subcommand.description ?? defaultDesc,\n    ],\n  );\n\n  const visible = scope.visible();\n  let optionObjects = visible.local;\n  let persistentOptionObjects = visible.persistent;\n  // A command without parents or subcommands has no global flags to set apart.\n  if (commands.length === 1 && subcommands.length === 0) {\n    const byOption = new Map([...optionObjects, ...persistentOptionObjects].map((v) => [v.option, v]));\n    optionObjects = (command.options ?? []).flatMap((option) => byOption.get(option) ?? []);\n    persistentOptionObjects = [];\n  }\n  const row = (visible: VisibleOption): [string, string] => {\n    const defaults: string[] = [];\n    addDefaults(defaults, asArray(visible.option.args));\n    return [show(visible), withDefaults(visible.option.description, defaults, defaultDesc)];\n  };\n  const options = optionObjects.map(row);\n  const persistentOptions = persistentOptionObjects.map(row);\n\n  const usage = (() => {\n    const parts = [getSubcommandPathString(commands)];\n    for (const visible of [...optionObjects, ...persistentOptionObjects]) {\n      if (visible.option.isRequired) {\n        parts.push(show(visible));\n      }\n    }\n    if (options.length || persistentOptions.length) {\n      parts.push(\"[flags]\");\n    }\n    if (command.requiresSubcommand) {\n      parts.push(\"<command>\");\n    } else {\n      const args = makeArray(command.args);\n      if (args.length > 0) {\n        parts.push(summarizeArguments(args));\n      }\n    }\n    return parts.join(\" \");\n  })();\n\n  // The positional arguments are only listed when there's more to say about\n  // them than the usage line does. An argument's name is often description\n  // enough, so one without a description is listed by name alone.\n  const positionals = command.requiresSubcommand ? [] : asArray(command.args);\n  const described = positionals.some((arg) => arg.description !== undefined || arg.default !== undefined);\n  const args: HelpSections[\"args\"] = described\n    ? positionals.map((arg) => [\n        (arg.name || \"argument\") + (arg.isVariadic ? \"...\" : \"\"),\n        withDefaults(arg.description, arg.default === undefined ? [] : [arg.default], \"\"),\n      ])\n    : [];\n\n  return {\n    usage,\n    description,\n    args,\n    persistentOptions,\n    options,\n    subcommands,\n  };\n}\n\n/**\n * A description ending with the defaults the parser uses. They go on a line of\n * their own when the last line would be too long for the 68 characters the\n * spec checks allow.\n */\nfunction withDefaults(\n  description: string | undefined,\n  defaults: readonly string[],\n  defaultDesc: string,\n): string {\n  if (defaults.length === 0) {\n    return description ?? defaultDesc;\n  }\n  const shown = `(default: ${defaults.join(\" \")})`;\n  if (description === undefined) {\n    return shown;\n  }\n  const lastLine = description.slice(description.lastIndexOf(\"\\n\") + 1);\n  return `${description}${lastLine.length + 1 + shown.length <= 68 ? \" \" : \"\\n\"}${shown}`;\n}\n\nexport function formatHelpSections(sections: HelpSections): string {\n  const parts = [];\n\n  const indent = \"  \";\n\n  if (sections.didYouMean) {\n    parts.push(`    Did you mean '${sections.didYouMean}'?`);\n  }\n\n  if (sections.description) {\n    parts.push(dedent(sections.description));\n  }\n\n  if (sections.usage) {\n    parts.push(`Usage:\\n${indent}${sections.usage}`);\n  }\n\n  const longestOptionName = Math.max(\n    0,\n    ...sections.options.map(([name]) => name.length),\n    ...sections.persistentOptions.map(([name]) => name.length),\n  );\n  const minSpacingBetweenNameAndDesc = 2;\n\n  // Each name, then its description in a column `width` wide names leave.\n  const formatRows = (rows: [string, string][], width: number) => {\n    const lines = [];\n    const newline = indent + \" \".repeat(width + minSpacingBetweenNameAndDesc);\n    for (const [name, desc] of rows) {\n      if (desc === \"\") {\n        lines.push(`${indent}${name}`);\n        continue;\n      }\n      const spaces = \" \".repeat(width - name.length + minSpacingBetweenNameAndDesc);\n      const [head, ...tail] = desc.split(\"\\n\");\n      const description = [head, ...tail.map((line) => newline + line)].join(\"\\n\");\n      lines.push(`${indent}${name}${spaces}${description}`);\n    }\n    return lines;\n  };\n  const formatOptions = (options: [string, string][]) => formatRows(options, longestOptionName);\n\n  if (sections.args.length > 0) {\n    const longestArgName = Math.max(...sections.args.map(([name]) => name.length));\n    parts.push([\"Arguments:\", ...formatRows(sections.args, longestArgName)].join(\"\\n\"));\n  }\n\n  if (sections.subcommands.length > 0) {\n    const lines = [\"Commands:\"];\n    const longestName = Math.max(...sections.subcommands.map(([name]) => name.length));\n    const newline = indent + \" \".repeat(longestName + minSpacingBetweenNameAndDesc);\n    for (const [name, desc] of sections.subcommands) {\n      const spaces = \" \".repeat(longestName - name.length + minSpacingBetweenNameAndDesc);\n      const [head, ...tail] = desc.split(\"\\n\\n\")[0].split(\"\\n\");\n      const description = [head, ...tail.map((line) => newline + line)].join(\"\\n\");\n      lines.push(`${indent}${name}${spaces}${description}`);\n    }\n    parts.push(lines.join(\"\\n\"));\n  }\n\n  if (sections.options.length > 0) {\n    const lines = [\"Flags:\", ...formatOptions(sections.options)];\n    parts.push(lines.join(\"\\n\"));\n  }\n\n  if (sections.persistentOptions.length > 0) {\n    const lines = [\"Global flags:\", ...formatOptions(sections.persistentOptions)];\n    parts.push(lines.join(\"\\n\"));\n  }\n  return parts.join(\"\\n\\n\") + \"\\n\";\n}\n\nexport function getLongestString(strings: NonEmptyArray<string>): string {\n  let longest = strings[0];\n  for (let i = 1; i < strings.length; i++) {\n    const string = strings[i];\n    if (string.length > longest.length) {\n      longest = string;\n    }\n  }\n  return longest;\n}\n\n/**\n * Show an option's names, each written with its arguments the way `forms`\n * says. Names written the same way share one copy of the arguments.\n */\nexport function optionToString(option: Option, forms: readonly OptionForm[]): string {\n  const optionArgs = makeArray(option.args);\n  const sorted = [...forms].sort((a, b) => a.name.length - b.name.length);\n  const joins = [...new Set(sorted.map((form) => form.join))];\n  return joins\n    .map((join) => {\n      const names = sorted.filter((form) => form.join === join).map((form) => form.name);\n      return names.join(\", \") + argumentsAfterName(optionArgs, join);\n    })\n    .join(\", \");\n}\n\n/** The text after an option's name that shows its arguments, joined to the name by `join`. */\nfunction argumentsAfterName(args: Arg[], join: string | null): string {\n  if (args.length === 0) {\n    return \"\";\n  }\n  if (join === null) {\n    return ` ${summarizeArguments(args)}`;\n  }\n  const [first, ...rest] = args;\n  const name = first.name || \"argument\";\n  const joined =\n    (first.isOptional ? `[${join}${name}]` : `${join}<${name}>`) + (first.isVariadic ? \"...\" : \"\");\n  return rest.length > 0 ? `${joined} ${summarizeArguments(rest)}` : joined;\n}\n\nexport function summarizeArguments(args: Arg[]) {\n  return args.map((arg) => argToString(arg)).join(\" \");\n}\n\nexport function argToString(arg: Arg): string {\n  const name = arg.name || \"argument\";\n  let lhs = \"<\";\n  let rhs = \">\";\n  let suffix = \"\";\n  if (arg.isOptional) {\n    lhs = \"[\";\n    rhs = \"]\";\n  }\n  if (arg.isVariadic) {\n    suffix = \"...\";\n  }\n  return `${lhs}${name}${rhs}${suffix}`;\n}\n","import type { CommandPath } from \"./types.js\";\nimport type { Choice } from \"./suggest.js\";\n\nconst repr = JSON.stringify as (str: string) => string;\n\nexport interface ErrorContext {\n  path: CommandPath;\n}\n\n/** What the user typed, and the names they could have meant. */\nexport interface DidYouMean {\n  input: string;\n  choices: readonly Choice[];\n}\n\n/**\n * A command line the parser can't accept. `run` prints the message with the\n * help for the command at `context.path`, and suggests the closest of\n * `didYouMean.choices` if there is one.\n */\nexport class ParseError extends Error {\n  readonly context: ErrorContext;\n  readonly didYouMean: DidYouMean | undefined;\n  constructor(context: ErrorContext, message: string, didYouMean?: DidYouMean) {\n    super(message);\n    this.context = context;\n    this.didYouMean = didYouMean;\n    this.name = this.constructor.name;\n  }\n}\n\nexport class UnknownOption extends ParseError {\n  readonly option: string;\n  constructor(option: string, validOptions: readonly Choice[], context: ErrorContext) {\n    const msg = `${repr(option)} looks like a flag, but is unknown in this context`;\n    super(context, msg, { input: option, choices: validOptions });\n    this.option = option;\n  }\n}\n\nexport class InvalidOptionArg extends ParseError {\n  readonly option: string;\n  constructor(option: string, context: ErrorContext) {\n    super(context, `Option ${option} doesn't take arguments`);\n    this.option = option;\n  }\n}\n\nexport class TooManyArguments extends ParseError {\n  constructor(value: string, context: ErrorContext) {\n    super(context, `Too many arguments, ${repr(value)} was unexpected`);\n  }\n}\n\nexport class TooFewOptionArguments extends ParseError {\n  constructor(option: string, min: number, max: number, context: ErrorContext) {\n    const msg =\n      min === max\n        ? `Option ${option} needs ${min} argument${min === 1 ? \"\" : \"s\"}`\n        : !Number.isFinite(max)\n          ? `Option ${option} needs at least ${min} argument${min === 1 ? \"\" : \"s\"}`\n          : `Option ${option} needs between ${min} and ${max} arguments`;\n    super(context, msg);\n  }\n}\n\nexport class TooFewArguments extends ParseError {\n  constructor(min: number, max: number, context: ErrorContext) {\n    const msg =\n      min === max\n        ? `Expected ${min} argument${min === 1 ? \"\" : \"s\"}`\n        : !Number.isFinite(max)\n          ? `Expected at least ${min} argument${min === 1 ? \"\" : \"s\"}`\n          : `Expected between ${min} and ${max} arguments`;\n    super(context, msg);\n  }\n}\n\nexport class MissingRequiredOption extends ParseError {\n  constructor(name: string, context: ErrorContext) {\n    const msg = `Option ${name} is required, but wasn't found`;\n    super(context, msg);\n  }\n}\n","import type { Action, Arg, CommandPath, Option, Spec, Subcommand } from \"./types.js\";\nimport { addDefaults, asArray, getMaxArgs, getMinArgs } from \"./util.js\";\nimport {\n  InvalidOptionArg,\n  MissingRequiredOption,\n  ParseError,\n  TooFewArguments,\n  TooFewOptionArguments,\n  TooManyArguments,\n  UnknownOption,\n} from \"./errors.js\";\nimport type { ErrorContext } from \"./errors.js\";\nimport type { Directives } from \"./directives.js\";\nimport { OptionScope, optionKey } from \"./scope.js\";\nimport type { OptionForm } from \"./scope.js\";\nimport { matchSubcommand, usage as builtinUsageAction, withInherited } from \"./subcommands.js\";\nimport type { NoSubcommand, SubcommandMatch } from \"./subcommands.js\";\n\nexport interface ParseResult {\n  args: string[];\n  argSeparatorIndex: number;\n  options: Map<string, string[]>;\n  /**\n   * The defaults of the arguments of the option `name` refers to, for an\n   * option that wasn't used. Undefined if it was used, or if its first\n   * argument is optional or has no default.\n   */\n  defaults(name: string): string[] | undefined;\n  path: CommandPath;\n  /**\n   * The action to run: the last option action used, or else the selected\n   * command's action. A command without an action prints its help.\n   */\n  action: Action;\n}\n\n/** What the token after a command line can be, as the parser would read it. */\nexport interface NextToken {\n  /** The commands from the root to the current one. */\n  path: CommandPath;\n  /** The directives in effect. */\n  directives: Readonly<Directives>;\n  /** Whether the token can be an option. */\n  optionsAllowed: boolean;\n  /**\n   * The subcommands the token can name, hidden ones included. While the open\n   * option can still take a value, only an exact name matches.\n   */\n  subcommands: readonly Subcommand[];\n  /**\n   * The options the token can use, hidden ones included, local options first.\n   * Empty when the token can't be an option.\n   */\n  options: readonly UsableOption[];\n  /** The open option, if the token can be its value, and whether it must be. */\n  value: { option: Option; arg: Arg | undefined; required: boolean } | null;\n  /** The argument the token fills if it isn't an option, subcommand or value. */\n  arg: Arg | undefined;\n  /**\n   * The partial token, if the parser reads it as an option with a value\n   * attached. `prefix` is everything before the value.\n   */\n  attached: { option: Option; arg: Arg; prefix: string; value: string } | null;\n}\n\n/**\n * An option the next token can use without going over its repeat limit or\n * breaking an `exclusiveOn` rule.\n */\nexport interface UsableOption {\n  option: Option;\n  /**\n   * How each name the parser reads as this option here is written. A name\n   * that another option shadows, or that a subcommand matches, isn't one of\n   * them.\n   */\n  forms: readonly OptionForm[];\n  /**\n   * Whether the option was used earlier on the line. Options with the same\n   * names count as the same option, like a subcommand's copy of a parent's.\n   */\n  used: boolean;\n}\n\n/** What the parser read one token as. See {@link readToken}. */\nexport type TokenReading =\n  /** `--`, the end of options. */\n  | { kind: \"separator\" }\n  | { kind: \"subcommand\"; command: Subcommand }\n  /**\n   * One option, or several chained short options, in the order used. If the\n   * token also carries a value the option accepts, `attached` says where it starts.\n   */\n  | { kind: \"options\"; options: readonly Option[]; attached: { option: Option; start: number } | null }\n  /** A value of the option before it. */\n  | { kind: \"value\"; option: Option }\n  | { kind: \"argument\" }\n  /** An option that doesn't exist. */\n  | { kind: \"unknown\" };\n\n/** The first of `separators` that `text` starts with, or \"\" if none. */\nfunction leadingSeparator(text: string, separators: readonly string[]): string {\n  for (const sep of separators) {\n    if (text.startsWith(sep)) {\n      return sep;\n    }\n  }\n  return \"\";\n}\n\n/**\n * Find the separator that appears first in `token`, so the value after it can\n * contain the other separators. When two separators start at the same place,\n * the longer one wins. Returns null if there's no separator, or if the one\n * found is empty.\n */\nfunction firstSeparator(token: string, separators: readonly string[]): { index: number; sep: string } | null {\n  let sep = \"\";\n  let index = -1;\n  for (const candidate of separators) {\n    const at = token.indexOf(candidate);\n    if (at === -1) {\n      continue;\n    }\n    if (index === -1 || at < index || (at === index && candidate.length > sep.length)) {\n      sep = candidate;\n      index = at;\n    }\n  }\n  return sep ? { index, sep } : null;\n}\n\n/** The values a repeatable option has collected, and how many times it's been used. */\ninterface RepeatedUses {\n  values: string[];\n  count: number;\n}\n\n/**\n * Throw if the options used break a `dependsOn` or `exclusiveOn` rule, or if\n * any of `required` is missing.\n */\nfunction checkOptionRules(\n  options: ReadonlyMap<string, string[]>,\n  seenOptions: readonly Option[],\n  required: readonly Option[],\n  context: ErrorContext,\n): void {\n  for (const option of seenOptions) {\n    if (!option.dependsOn) {\n      continue;\n    }\n    for (const name of option.dependsOn) {\n      if (!options.has(name)) {\n        throw new ParseError(\n          context,\n          `${asArray(option.name).join(\"/\")} requires ${name}, add it to fix this error`,\n        );\n      }\n    }\n  }\n  for (const option of seenOptions) {\n    if (!option.exclusiveOn) {\n      continue;\n    }\n    for (const name of option.exclusiveOn) {\n      if (options.has(name)) {\n        throw new ParseError(\n          context,\n          `${asArray(option.name).join(\"/\")} can't be used together with ${name}`,\n        );\n      }\n    }\n  }\n  for (const option of required) {\n    for (const name of asArray(option.name)) {\n      if (!options.has(name)) {\n        throw new MissingRequiredOption(name, context);\n      }\n    }\n  }\n}\n\n/**\n * The state of reading one command line in a single pass. This is the only\n * code that decides what each input token is. When `strict`, it throws on the\n * first problem, which is what {@link parse} needs. Otherwise it never throws:\n * it skips whatever is invalid and keeps going, so {@link readNext} can still\n * read a line that's wrong at the moment. Each method handles one kind of\n * token.\n */\nclass Scanner {\n  readonly path: [Spec, ...Subcommand[]];\n  // The last option action used.\n  private optionAction: Action | undefined = undefined;\n  readonly args: string[] = [];\n  readonly options: Map<string, string[]> = new Map();\n  readonly seenOptions: Option[] = [];\n  argSeparatorIndex = -1;\n\n  // What the current command allows.\n  readonly scope: OptionScope = new OptionScope();\n  private subcommands: readonly Subcommand[] | undefined = undefined;\n  private commandArgsMin = 0;\n  private commandArgsMax = 0;\n  readonly directives: Directives = this.scope.directives;\n\n  hasFoundArg = false;\n\n  // The last option used, and how many more separate tokens it can take as\n  // values. While it has room, a token that isn't an option or `--` becomes its\n  // value. A subcommand's exact name ends it unless a value is required.\n  // `useOption` sets all of these and `closeOption` clears them.\n  openOption: Option | null = null;\n  private openOptionName = \"\";\n  valueCount = 0;\n  private valueMin = 0;\n  private separateValueMax = 0;\n\n  // The values of the last option, checked against its arity when it ends.\n  // Unlike the counts above, this includes values attached with a separator.\n  // A repeatable option keeps adding to the same array, so this use's values\n  // start at `valuesStart`.\n  private values: string[] | null = null;\n  private valuesStart = 0;\n  private valuesMin = 0;\n  private valuesMax = 0;\n  private valueArgs: readonly Arg[] = [];\n  private requiredSeparator: string | boolean = false;\n\n  // The first argument past the command's limit, or a subcommand that didn't\n  // match. It's only an error once the whole line is read, because an option\n  // action like --help allows it.\n  private tooManyArgs: ParseError | null = null;\n\n  // The uses of each repeatable option, keyed by `optionKey`.\n  // A subcommand's copy of a parent's option has the same names, so it\n  // continues the parent's uses. An option with other names, even a subset,\n  // has uses of its own.\n  private readonly repeatedUses: Map<string, RepeatedUses> = new Map();\n\n  // The last value attached to an option's own token, and where it starts.\n  private attached: { option: Option; index: number; start: number } | null = null;\n\n  constructor(\n    spec: Spec,\n    private readonly strict: boolean,\n  ) {\n    this.path = [spec];\n    this.enterCommand(spec);\n  }\n\n  private ctx(): ErrorContext {\n    return { path: this.path };\n  }\n\n  /** Whether the open option can take the next token as a value. */\n  get hasRoomForValue(): boolean {\n    return this.valueCount < this.separateValueMax;\n  }\n\n  // Make `command` the current command.\n  private enterCommand(command: Spec | Subcommand): void {\n    this.scope.enter(command);\n    this.subcommands = command.subcommands;\n    this.commandArgsMin = getMinArgs(command.args);\n    this.commandArgsMax = getMaxArgs(command.args);\n  }\n\n  private findOption(name: string): Option | null {\n    return this.scope.resolve(name);\n  }\n\n  private unknownOption(option: string): UnknownOption {\n    return new UnknownOption(option, this.scope.suggestionNames(), this.ctx());\n  }\n\n  // Every token except an option's value, or an unknown option, ends the\n  // previous option. A strict read then adds the defaults of the optional\n  // arguments that weren't given, so a bare `--inspect` gets its port.\n  private endOption(): void {\n    const values = this.values;\n    if (this.strict && values) {\n      const given = values.length - this.valuesStart;\n      if (given < this.valuesMin) {\n        throw new TooFewOptionArguments(this.openOptionName, this.valuesMin, this.valuesMax, this.ctx());\n      }\n      addDefaults(values, this.valueArgs, given);\n    }\n    this.values = null;\n  }\n\n  /** End the open option, so no later token can be its value. */\n  private closeOption(): void {\n    this.endOption();\n    this.openOption = null;\n    this.valueCount = this.valueMin = this.separateValueMax = 0;\n  }\n\n  private useOption(option: Option, name: string): void {\n    this.endOption();\n    this.openOption = option;\n    this.openOptionName = name;\n    this.valueCount = 0;\n    this.valueMin = getMinArgs(option.args);\n    // Options that require a separator only take attached values.\n    this.separateValueMax = option.requiresSeparator ? 0 : getMaxArgs(option.args);\n    this.seenOptions.push(option);\n    if (option.action) {\n      this.optionAction = option.action;\n    }\n    const names = asArray(option.name);\n    const options = this.options;\n\n    let optionValues: string[];\n    if (option.isRepeatable) {\n      // A repeatable option collects the values from every use. Without\n      // arguments, each use adds an empty string, so the values count the uses.\n      const maxRepeat = option.isRepeatable === true ? Infinity : option.isRepeatable;\n      const key = optionKey(option);\n      let uses = this.repeatedUses.get(key);\n      if (!uses) {\n        uses = { values: [], count: 0 };\n        this.repeatedUses.set(key, uses);\n      }\n      if (this.strict && uses.count >= maxRepeat) {\n        throw new ParseError(this.ctx(), \"Too many repetitions\");\n      }\n      uses.count += 1;\n      // Another option may have taken one of the names since the last use.\n      for (const other of names) {\n        options.set(other, uses.values);\n      }\n      if (!option.args) {\n        uses.values.push(\"\");\n        return;\n      }\n      optionValues = uses.values;\n    } else {\n      // The last use of an option wins, so a user can override a flag that a\n      // shell alias already sets.\n      optionValues = [];\n      for (const other of names) {\n        options.set(other, optionValues);\n      }\n    }\n\n    this.valuesMin = this.valueMin;\n    this.valuesMax = getMaxArgs(option.args);\n    this.requiredSeparator = option.requiresSeparator ?? false;\n    if (this.valuesMax > 0) {\n      this.values = optionValues;\n      this.valuesStart = optionValues.length;\n      this.valueArgs = asArray(option.args);\n    }\n  }\n\n  /**\n   * Add a value to the open option. Returns whether it's a value the option\n   * accepts. A lenient read keeps going either way.\n   */\n  private addValue(value: string, separator: string): boolean {\n    this.valueCount += 1;\n    if (!this.values) {\n      if (this.strict) {\n        throw new InvalidOptionArg(this.openOptionName, this.ctx());\n      }\n      return false;\n    }\n    const requiredSeparator = this.requiredSeparator;\n    let accepted = true;\n    if (typeof requiredSeparator === \"string\" && separator !== requiredSeparator) {\n      if (this.strict) {\n        throw new ParseError(\n          this.ctx(),\n          `Incorrect separator, use '${requiredSeparator}' instead of '${separator}'`,\n        );\n      }\n      accepted = false;\n    }\n    if (requiredSeparator === true && separator === \"\") {\n      if (this.strict) {\n        const suggested = this.scope.requiredSeparator(this.openOption!);\n        throw new ParseError(\n          this.ctx(),\n          `Missing separator, use '${suggested}' between ${this.openOptionName} and its value`,\n        );\n      }\n      accepted = false;\n    }\n    this.values.push(value);\n    return accepted;\n  }\n\n  /**\n   * Add a value attached to the option's own token, the token at `index`,\n   * starting at `start`. It's the option's only value, so no later token can be\n   * one.\n   */\n  private addAttachedValue(index: number, start: number, value: string, separator: string): void {\n    if (this.addValue(value, separator)) {\n      this.attached = { option: this.openOption!, index, start };\n    }\n    this.valueMin = this.separateValueMax = 0;\n  }\n\n  /**\n   * Whether the command already has all the arguments it takes. A command that\n   * requires a subcommand takes none.\n   */\n  private get argsAreFull(): boolean {\n    const path = this.path;\n    return path[path.length - 1].requiresSubcommand === true || this.args.length >= this.commandArgsMax;\n  }\n\n  private addArg(value: string): void {\n    this.endOption();\n    if (this.strict && this.argsAreFull) {\n      this.tooManyArgs ??= new TooManyArguments(value, this.ctx());\n    }\n    this.args.push(value);\n  }\n\n  /** Read `--` and every token after it as arguments. */\n  argSeparator(input: readonly string[], index: number): void {\n    this.closeOption();\n    // A command that requires a subcommand allows `--` alone, and reports\n    // any argument after it.\n    const command = this.path[this.path.length - 1];\n    if (this.strict && this.argsAreFull && !command.requiresSubcommand) {\n      this.tooManyArgs ??= new ParseError(\n        this.ctx(),\n        \"Unexpected argument '--', did you mean to use an option instead?\",\n      );\n    }\n    this.argSeparatorIndex = this.args.length;\n    for (index += 1; index < input.length; index++) {\n      this.addArg(input[index]);\n    }\n  }\n\n  /**\n   * Whether the next token can name a subcommand, its own or an inherited\n   * one. It can't once an argument is found, or while the open option needs\n   * the next token as its value. A required or variadic option value takes\n   * priority over a subcommand.\n   */\n  private get canMatchSubcommand(): boolean {\n    if (this.hasFoundArg) {\n      return false;\n    }\n    if (!this.subcommands && this.scope.inheritedSubcommands.length === 0) {\n      return false;\n    }\n    return !(this.valueCount < this.valueMin || (this.hasRoomForValue && this.separateValueMax === Infinity));\n  }\n\n  /**\n   * The subcommand the next token enters if it's `token`, or why it enters\n   * none. Null if the next token can't be a subcommand at all.\n   */\n  private subcommandFor(token: string): SubcommandMatch | null {\n    if (!this.canMatchSubcommand) {\n      return null;\n    }\n    // A short optional value could be a prefix of a subcommand's name, so only\n    // an exact match can end an option that still has room.\n    return matchSubcommand(\n      this.subcommands ?? [],\n      token,\n      this.directives,\n      this.hasRoomForValue,\n      this.scope.inheritedSubcommands,\n    );\n  }\n\n  private enterSubcommand(command: Subcommand): void {\n    this.closeOption();\n    this.path.push(command);\n    this.enterCommand(command);\n  }\n\n  /** Read a token like `-abc`, `+x` or `-ovalue`. */\n  shortOptions(token: string, index: number): void {\n    const leadingChar = token[0];\n\n    // Parse as a single dash or plus with an arg. Try dash and plus options\n    // first if:\n    // - the options exist\n    // - the options take args\n    // - the first non-leading character isn't an option\n    const dashOption = this.findOption(leadingChar);\n    if (dashOption?.args && !this.findOption(token.slice(0, 2))) {\n      this.useOption(dashOption, leadingChar);\n      this.addAttachedValue(index, 1, token.slice(1), \"\");\n      return;\n    }\n\n    // Parse as chained short options. If we got here, the option wasn't `-` or `+`.\n    for (let char = 1; char < token.length; char++) {\n      const optionName = leadingChar + token[char];\n      const option = this.findOption(optionName);\n      if (!option) {\n        // An open option takes anything unknown as a value, like `-5`.\n        if (char === 1 && this.hasRoomForValue) {\n          this.addValue(token, \"\");\n          return;\n        }\n        if (this.strict) {\n          throw this.unknownOption(optionName);\n        }\n        continue;\n      }\n\n      this.useOption(option, optionName);\n      if (char === token.length - 1) {\n        return;\n      }\n\n      const sep = leadingSeparator(token.slice(char + 1), this.directives.optionArgSeparators);\n      // An option without args still takes a separated value, so that `-v=1`\n      // fails like `--verbose=1`, unless the next character is an option.\n      if (option.args || (sep && !this.findOption(leadingChar + token[char + 1]))) {\n        const argStart = char + sep.length + 1;\n        this.addAttachedValue(index, argStart, token.slice(argStart), sep);\n        return;\n      }\n    }\n  }\n\n  /**\n   * Read a token like `--name` or `--name=value`, or any token when options\n   * aren't POSIX compliant. Returns false if the token should be an argument.\n   */\n  longOption(token: string, index: number): boolean {\n    const found = firstSeparator(token, this.directives.optionArgSeparators);\n    const optionName = found ? token.slice(0, found.index) : token;\n    const option = this.findOption(optionName);\n    if (option) {\n      this.useOption(option, optionName);\n      if (found) {\n        const valueStart = found.index + found.sep.length;\n        this.addAttachedValue(index, valueStart, token.slice(valueStart), found.sep);\n      }\n      return true;\n    }\n    // POSIX-noncompliant option means that there's nothing \"option-like\". Any\n    // token can be an option if it matches an option name, and if it's not an\n    // option then it's just a regular argument.\n    if (this.directives.flagsArePosixNoncompliant) {\n      return false;\n    }\n    if (this.hasRoomForValue) {\n      this.addValue(token, \"\");\n      return true;\n    }\n    // The option is unknown and looks like a POSIX-compliant option, so\n    // it's an unknown option instead of an arg.\n    if (this.strict) {\n      throw this.unknownOption(optionName);\n    }\n    return true;\n  }\n\n  /**\n   * Read a token that isn't `--`, a subcommand or an option. It's a value of\n   * the open option if that has room, and otherwise an argument, which stops\n   * later tokens from being subcommands. `unmatched` is why the token isn't a\n   * subcommand, if it could have been one.\n   */\n  valueOrArg(token: string, unmatched: NoSubcommand | null): void {\n    if (this.hasRoomForValue) {\n      this.addValue(token, \"\");\n      return;\n    }\n    // Where a subcommand could be, a token the command has no room for is a\n    // subcommand that didn't match.\n    if (this.strict && unmatched && this.argsAreFull) {\n      const command = this.path[this.path.length - 1];\n      if (command.subcommands?.length || command.requiresSubcommand) {\n        const { message, didYouMean } = unmatched.reason();\n        this.tooManyArgs ??= new ParseError(this.ctx(), message, didYouMean);\n      }\n    }\n    this.hasFoundArg = true;\n    this.addArg(token);\n  }\n\n  /**\n   * Throw if the finished command line is missing anything. Returns the action\n   * to run.\n   */\n  finish(): Action {\n    // An option with an action, like --help, works however the rest of the\n    // command line is wrong, as long as every token could be read. So does the\n    // usage a command shows when no subcommand is named.\n    const command = this.path[this.path.length - 1];\n    const showsUsage = command.requiresSubcommand && !command.action && this.args.length === 0;\n    const skipsChecks = this.optionAction !== undefined || showsUsage;\n    if (!skipsChecks && this.tooManyArgs) {\n      throw this.tooManyArgs;\n    }\n    if (!skipsChecks && this.args.length < this.commandArgsMin) {\n      throw new TooFewArguments(this.commandArgsMin, this.commandArgsMax, this.ctx());\n    }\n    this.endOption();\n    if (!skipsChecks) {\n      checkOptionRules(this.options, this.seenOptions, this.scope.required(), this.ctx());\n    }\n    // Defaults are added after the checks, so they never count as typed. An\n    // option action can run with required arguments missing, and then the\n    // first default would fill a required argument's place.\n    if (!command.requiresSubcommand && this.args.length >= this.commandArgsMin) {\n      addDefaults(this.args, asArray(command.args), this.args.length);\n    }\n    return this.optionAction ?? command.action ?? builtinUsageAction;\n  }\n\n  /** See {@link ParseResult.defaults}. */\n  defaults(name: string): string[] | undefined {\n    if (this.options.has(name)) {\n      return undefined;\n    }\n    const args = asArray(this.scope.resolve(name)?.args);\n    // An option whose first argument is optional, like `--inspect[=port]`,\n    // means something different when it's left out than when it's bare, so\n    // its defaults are only for the bare option.\n    if (args.length === 0 || args[0].isOptional) {\n      return undefined;\n    }\n    const values: string[] = [];\n    addDefaults(values, args);\n    return values.length > 0 ? values : undefined;\n  }\n\n  /** Whether using `option` next would go over its repeat limit or break an `exclusiveOn` rule. */\n  private conflicts(option: Option): boolean {\n    const names = asArray(option.name);\n    const options = this.options;\n    if (typeof option.isRepeatable === \"number\") {\n      if ((this.repeatedUses.get(optionKey(option))?.count ?? 0) >= option.isRepeatable) {\n        return true;\n      }\n    }\n    if (option.exclusiveOn?.some((name) => options.has(name))) {\n      return true;\n    }\n    return this.seenOptions.some((seen) => seen.exclusiveOn?.some((name) => names.includes(name)));\n  }\n\n  /** The options the next token can use. See {@link NextToken.options}. */\n  private usableOptions(): UsableOption[] {\n    const used = new Set(this.seenOptions.map(optionKey));\n    const { local, persistent } = this.scope.live();\n    const usable: UsableOption[] = [];\n    for (const { option, names } of [...local, ...persistent]) {\n      if (this.conflicts(option)) {\n        continue;\n      }\n      // The parser reads a name that a subcommand matches as that subcommand.\n      const typeable = names.filter((name) => !this.subcommandFor(name)?.command);\n      if (typeable.length === 0) {\n        continue;\n      }\n      usable.push({ option, forms: this.scope.forms(option, typeable), used: used.has(optionKey(option)) });\n    }\n    return usable;\n  }\n\n  /** What the next token can be. See {@link readNext}. */\n  next(): Omit<NextToken, \"attached\"> {\n    const open = this.openOption && this.hasRoomForValue ? this.openOption : null;\n    const command = this.path[this.path.length - 1];\n    // Every token after `--` is an argument.\n    const afterSeparator = this.argSeparatorIndex !== -1;\n    const optionsAllowed = !afterSeparator && this.optionsAllowed;\n    return {\n      path: this.path,\n      directives: this.directives,\n      optionsAllowed,\n      subcommands:\n        !afterSeparator && this.canMatchSubcommand\n          ? withInherited(this.subcommands ?? [], this.scope.inheritedSubcommands)\n          : [],\n      options: optionsAllowed ? this.usableOptions() : [],\n      value: open && {\n        option: open,\n        arg: argAt(asArray(open.args), this.valueCount),\n        required: this.valueCount < this.valueMin,\n      },\n      arg: open ? undefined : argAt(asArray(command.args), this.args.length),\n    };\n  }\n\n  /** Read the token at `index`, the next one, and say what it was read as. */\n  readAndClassify(input: readonly string[], index: number): TokenReading {\n    // Every token after `--` is an argument.\n    if (this.argSeparatorIndex !== -1) {\n      return { kind: \"argument\" };\n    }\n    const depth = this.path.length;\n    const seen = this.seenOptions.length;\n    const args = this.args.length;\n    const values = this.valueCount;\n    if (this.readAt(input, index)) {\n      return { kind: \"separator\" };\n    }\n    if (this.path.length > depth) {\n      return { kind: \"subcommand\", command: this.path[depth] as Subcommand };\n    }\n    if (this.seenOptions.length > seen) {\n      const found = this.attachedAt(index);\n      const attached = found && { option: found.option, start: found.start };\n      return { kind: \"options\", options: this.seenOptions.slice(seen), attached };\n    }\n    if (this.args.length > args) {\n      return { kind: \"argument\" };\n    }\n    if (this.valueCount > values) {\n      return { kind: \"value\", option: this.openOption! };\n    }\n    return { kind: \"unknown\" };\n  }\n\n  /** The value attached to the token at `index`, if it has one the option accepts. */\n  attachedAt(index: number): { option: Option; start: number } | null {\n    return this.attached?.index === index ? this.attached : null;\n  }\n\n  /** Whether the next token can be an option. Once options must stop, every token is an argument. */\n  get optionsAllowed(): boolean {\n    return !(this.directives.optionsMustPrecedeArguments && this.hasFoundArg);\n  }\n\n  /** Read every token of `input`. */\n  read(input: readonly string[]): void {\n    for (let index = 0; index < input.length; index++) {\n      if (this.readAt(input, index)) {\n        return;\n      }\n    }\n  }\n\n  /**\n   * Read the token at `index`. Returns true if it was `--`, which reads every\n   * token after it too.\n   */\n  private readAt(input: readonly string[], index: number): boolean {\n    const token = input[index];\n    const optionsAllowed = this.optionsAllowed;\n\n    // \"--\" disables option & subcommand parsing, so it's checked first.\n    if (token === \"--\" && optionsAllowed) {\n      this.argSeparator(input, index);\n      return true;\n    }\n\n    const subcommand = this.subcommandFor(token);\n    if (subcommand?.command) {\n      this.enterSubcommand(subcommand.command);\n      return false;\n    }\n\n    if (optionsAllowed) {\n      const flagsArePosixNoncompliant = this.directives.flagsArePosixNoncompliant;\n      const first = token.charCodeAt(0);\n      const isDoubleDash = first === 45 /* - */ && token.charCodeAt(1) === 45;\n      if (\n        !flagsArePosixNoncompliant &&\n        token.length > 1 &&\n        (first === 45 || first === 43) /* + */ &&\n        !isDoubleDash\n      ) {\n        this.shortOptions(token, index);\n        return false;\n      }\n      if (flagsArePosixNoncompliant || (token.length > 2 && isDoubleDash)) {\n        if (this.longOption(token, index)) {\n          return false;\n        }\n      }\n    }\n\n    this.valueOrArg(token, subcommand);\n    return false;\n  }\n}\n\n/** The argument at `index`, reusing a final variadic argument. */\nfunction argAt(args: readonly Arg[], index: number): Arg | undefined {\n  if (index < args.length) {\n    return args[index];\n  }\n  const last = args[args.length - 1];\n  return last?.isVariadic ? last : undefined;\n}\n\n/**\n * Work out what the token after `before` can be, and how the parser reads\n * `partial` if it's an option with a value attached. Reads leniently, so a\n * line that's wrong at the moment still has an answer. Completion is built on\n * this.\n */\nexport function readNext(spec: Spec, before: readonly string[], partial: string): NextToken {\n  const s = new Scanner(spec, false);\n  s.read(before);\n  const next = s.next();\n  let attached: NextToken[\"attached\"] = null;\n  if (partial !== \"\" && next.optionsAllowed) {\n    // Read the line again with the partial token, so `next` stays as it was.\n    const reading = readToken(spec, before, partial);\n    const found = reading.kind === \"options\" ? reading.attached : null;\n    const arg = found && asArray(found.option.args)[0];\n    if (found && arg) {\n      attached = {\n        option: found.option,\n        arg,\n        prefix: partial.slice(0, found.start),\n        value: partial.slice(found.start),\n      };\n    }\n  }\n  return { ...next, attached };\n}\n\n/**\n * Say what the parser reads `token` as when it comes after `before`. Reads\n * leniently, like {@link readNext}.\n */\nexport function readToken(spec: Spec, before: readonly string[], token: string): TokenReading {\n  const s = new Scanner(spec, false);\n  s.read(before);\n  return s.readAndClassify([...before, token], before.length);\n}\n\n/**\n * Parse the input tokens using the given CLI spec.\n *\n * This returns a `ParseResult`, which contains the array of\n * subcommands used, the provided options, the arguments, and the action to\n * run.\n *\n * If parsing fails, this function throws.\n */\nexport function parse(input: readonly string[], spec: Spec): ParseResult {\n  const s = new Scanner(spec, true);\n  s.read(input);\n  const action = s.finish();\n  return {\n    path: s.path,\n    action,\n    args: s.args,\n    argSeparatorIndex: s.argSeparatorIndex,\n    options: s.options,\n    defaults: (name) => s.defaults(name),\n  };\n}\n","/**\n * Shell completion.\n *\n * The `completion` subcommand prints a short script for a supported shell. On\n * every Tab, that script runs the CLI's hidden `completion complete` command\n * with the command line typed so far. The CLI then works out the candidates\n * with the parser's own `readNext`, so completion always matches what the parser\n * accepts at that position: subcommands, options with their\n * relationship rules, and argument values from `template`, `suggestions` and\n * `generators`.\n *\n * @module\n */\n\nimport type { Arg, Spec, Subcommand, Template } from \"./types.js\";\nimport { makeArray, print } from \"./util.js\";\nimport { printUsageError } from \"./help.js\";\nimport { visibleSubcommands } from \"./subcommands.js\";\nimport { readNext } from \"./parse.js\";\nimport type { NextToken } from \"./parse.js\";\n\n/** Shells that {@link getCompletion} can generate scripts for. */\nexport type Shell = \"bash\" | \"zsh\" | \"fish\" | \"powershell\" | \"nushell\";\n\nexport const SHELLS: readonly Shell[] = [\"bash\", \"zsh\", \"fish\", \"powershell\", \"nushell\"];\n\nfunction isShell(value: string): value is Shell {\n  return (SHELLS as readonly string[]).includes(value);\n}\n\nconst firstLine = (description: string | undefined): string =>\n  description ? description.split(\"\\n\", 1)[0].trim() : \"\";\n\n/** Turn an arbitrary name into a safe shell identifier fragment. */\nconst sanitize = (value: string): string => value.replace(/[^A-Za-z0-9]+/g, \"_\");\n\n/** Single-quote a string for bash/zsh. */\nfunction shQuote(value: string): string {\n  return `'${value.replaceAll(\"'\", \"'\\\\''\")}'`;\n}\n\n/** Single-quote a string for fish (only `\\` and `'` are special). */\nfunction fishQuote(value: string): string {\n  return `'${value.replaceAll(\"\\\\\", \"\\\\\\\\\").replaceAll(\"'\", \"\\\\'\")}'`;\n}\n\n/** Single-quote a string for PowerShell (a quote is written twice). */\nfunction psQuote(value: string): string {\n  return `'${value.replaceAll(\"'\", \"''\")}'`;\n}\n\n/**\n * Quote a string for Nushell. A single-quoted string has no escapes, so a name\n * with a quote in it is written as a double-quoted string instead.\n */\nfunction nuQuote(value: string): string {\n  if (!value.includes(\"'\")) {\n    return `'${value}'`;\n  }\n  return `\"${value.replaceAll(\"\\\\\", \"\\\\\\\\\").replaceAll('\"', '\\\\\"')}\"`;\n}\n\n// Runtime resolver {{{\n\n/** A single completion candidate. */\ninterface Candidate {\n  value: string;\n  description?: string;\n}\n\n/** Enumerate filesystem entries matching `partial` for a path template. */\nasync function enumeratePaths(partial: string, template: Template): Promise<Candidate[]> {\n  // Imported through a variable so the Node-free `src` build doesn't need\n  // @types/node; this only runs inside the (Node-only) completion runtime.\n  const specifier = \"node:fs\";\n  const { readdirSync } = (await import(specifier)) as {\n    readdirSync(path: string, options: { withFileTypes: true }): { name: string; isDirectory(): boolean }[];\n  };\n  // Windows paths can use either separator. Elsewhere `\\` is part of a name.\n  const isWindows = (globalThis as { process?: { platform?: string } }).process?.platform === \"win32\";\n  const slash = Math.max(partial.lastIndexOf(\"/\"), isWindows ? partial.lastIndexOf(\"\\\\\") : -1);\n  const dir = slash >= 0 ? partial.slice(0, slash + 1) : \"\";\n  const base = slash >= 0 ? partial.slice(slash + 1) : partial;\n  // A folder ends with the separator the user typed last.\n  const separator = slash >= 0 ? partial[slash] : \"/\";\n  const foldersOnly = template === \"folders\";\n  let entries: { name: string; isDirectory(): boolean }[];\n  try {\n    entries = readdirSync((isWindows ? dir.replaceAll(\"\\\\\", \"/\") : dir) || \".\", { withFileTypes: true });\n  } catch {\n    return [];\n  }\n  const candidates: Candidate[] = [];\n  for (const entry of entries as { name: string; isDirectory(): boolean }[]) {\n    if (!entry.name.startsWith(base)) {\n      continue;\n    }\n    const isDir = entry.isDirectory();\n    if (foldersOnly && !isDir) {\n      continue;\n    }\n    candidates.push({ value: `${dir}${entry.name}${isDir ? separator : \"\"}` });\n  }\n  return candidates;\n}\n\n/** All candidate values for a single argument (suggestions/generators/template). */\nasync function argValues(arg: Arg, tokens: string[], partial: string): Promise<Candidate[]> {\n  const candidates: Candidate[] = [];\n\n  for (const suggestion of arg.suggestions ?? []) {\n    candidates.push(\n      typeof suggestion === \"string\"\n        ? { value: suggestion }\n        : { value: makeArray(suggestion.name)[0], description: suggestion.description },\n    );\n  }\n\n  for (const generator of makeArray(arg.generators)) {\n    if (!generator.custom) {\n      continue;\n    }\n    const produced = await generator.custom([...tokens, partial]);\n    for (const suggestion of produced) {\n      candidates.push(\n        typeof suggestion === \"string\"\n          ? { value: suggestion }\n          : { value: makeArray(suggestion.name)[0], description: suggestion.description },\n      );\n    }\n  }\n\n  if (arg.template) {\n    candidates.push(...(await enumeratePaths(partial, arg.template)));\n  }\n\n  return candidates;\n}\n\n/** Decide which kinds of candidate the word being completed can use. */\nfunction wantedCandidates(next: NextToken, req: CompletionRequest) {\n  const posixNoncompliant = next.directives.flagsArePosixNoncompliant;\n  // After `--`, or once options must stop, a dashed word is an argument.\n  const partialIsOption =\n    next.optionsAllowed && !posixNoncompliant && (req.partial.startsWith(\"-\") || req.partial.startsWith(\"+\"));\n  // When gating, a dashed word completes options only; everything else completes\n  // commands/positionals. Posix-noncompliant options have no dash, so they're\n  // exempt and always offered alongside the other candidates.\n  return {\n    wantValues: !(req.gateOptions && partialIsOption),\n    wantOptions: !req.gateOptions || partialIsOption || posixNoncompliant,\n  };\n}\n\n/** Inputs for the runtime completion resolver. */\nexport interface CompletionRequest {\n  spec: Spec;\n  /** Tokens after the program name, excluding the word being completed. */\n  before: readonly string[];\n  /** The word being completed. */\n  partial: string;\n  /** Only offer options once the word being completed starts with a dash. */\n  gateOptions?: boolean;\n}\n\n/**\n * Resolve completion candidates for a partial command line. The parser works\n * out what the word can be with {@link readNext}, and this offers candidates\n * for each of those.\n */\nexport async function completeRuntime(req: CompletionRequest): Promise<Candidate[]> {\n  const next = readNext(req.spec, req.before, req.partial);\n  const tokens = [...req.before];\n\n  // The word is an option with a value attached, like `--mode=fa`.\n  if (next.attached) {\n    const { prefix, arg, value } = next.attached;\n    const values = await argValues(arg, tokens, value);\n    return values.map((candidate) => ({\n      value: prefix + candidate.value,\n      description: candidate.description,\n    }));\n  }\n\n  // The open option needs this word as its value.\n  if (next.value?.required) {\n    return next.value.arg ? argValues(next.value.arg, tokens, req.partial) : [];\n  }\n\n  const candidates: Candidate[] = [];\n  const { wantValues, wantOptions } = wantedCandidates(next, req);\n  if (wantValues) {\n    // While an option can take another value, a word that isn't an option or\n    // subcommand is its value instead of an argument.\n    const arg = next.value ? next.value.arg : next.arg;\n    if (arg) {\n      candidates.push(...(await argValues(arg, tokens, req.partial)));\n    }\n    for (const sub of visibleSubcommands(next.subcommands)) {\n      const description = firstLine(sub.description);\n      for (const token of makeArray(sub.name)) {\n        candidates.push({ value: token, description });\n      }\n    }\n  }\n  if (wantOptions) {\n    candidates.push(...optionCandidates(next));\n  }\n  return candidates;\n}\n\n/** The options a user can use next, required ones first. */\nfunction optionCandidates(next: NextToken): Candidate[] {\n  const required: Candidate[] = [];\n  const optional: Candidate[] = [];\n\n  for (const { option, forms, used } of next.options) {\n    if (option.hidden) {\n      continue;\n    }\n    // The parser lets a later use of an option override an earlier one, but\n    // that's rarely what someone wants, so an option that isn't repeatable is\n    // offered once.\n    if (used && !option.isRepeatable) {\n      continue;\n    }\n\n    let description = firstLine(option.description);\n    if (option.dependsOn) {\n      const needs = option.dependsOn.join(\", \");\n      description = description ? `${description} (requires ${needs})` : `requires ${needs}`;\n    }\n    if (option.isRequired) {\n      description = description ? `${description} [required]` : \"[required]\";\n    }\n\n    // A name joined to its value by a separator is offered with the separator,\n    // so the next Tab completes the value. A name joined with nothing between,\n    // like `-` in `-5`, is only the option once the value is typed, so it isn't\n    // offered.\n    const bucket = option.isRequired ? required : optional;\n    for (const { name, join } of forms) {\n      if (join === \"\") {\n        continue;\n      }\n      bucket.push({ value: name + (join ?? \"\"), description });\n    }\n  }\n\n  return [...required, ...optional];\n}\n\n/**\n * Render the thin shim that forwards the line to `completion complete`. The\n * binary is invoked as typed (so `./pack` works) and guarded so a missing\n * command degrades to no completion instead of an error.\n */\nfunction renderRuntimeShim(spec: Spec, shell: Shell): string {\n  const id = sanitize(spec.name);\n  const name = spec.name;\n  if (shell === \"bash\") {\n    return [\n      `_${id}_complete() {`,\n      `  local bin=\"\\${COMP_WORDS[0]}\"`,\n      `  command -v \"$bin\" >/dev/null 2>&1 || return`,\n      `  local cur=\"\\${COMP_WORDS[COMP_CWORD]}\"`,\n      `  local out`,\n      `  out=\"$(\"$bin\" completion complete --gate-options -- \"\\${COMP_WORDS[@]:1:COMP_CWORD-1}\" \"$cur\" 2>/dev/null | cut -f1)\"`,\n      `  local IFS=$'\\\\n'`,\n      `  COMPREPLY=( $(compgen -W \"$out\" -- \"$cur\") )`,\n      `}`,\n      `complete -F _${id}_complete ${shQuote(name)}`,\n    ].join(\"\\n\");\n  }\n  if (shell === \"zsh\") {\n    return [\n      `#compdef ${name}`,\n      `_${id}_complete() {`,\n      `  local bin=\"$words[1]\"`,\n      `  command -v \"$bin\" >/dev/null 2>&1 || return`,\n      `  local -a lines`,\n      `  lines=( \"\\${(@f)$(\"$bin\" completion complete -- \"\\${words[2,CURRENT-1]}\" \"\\${words[CURRENT]}\" 2>/dev/null)}\" )`,\n      `  local -a disp`,\n      `  local line`,\n      `  for line in $lines; do disp+=( \"\\${line//$'\\\\t'/:}\" ); done`,\n      `  _describe -t values ${shQuote(name)} disp`,\n      `}`,\n      `_${id}_complete \"$@\"`,\n    ].join(\"\\n\");\n  }\n  if (shell === \"powershell\") {\n    // PowerShell doesn't filter or quote a native command's candidates, so the\n    // script does both. The arguments go through an array so that PowerShell\n    // passes `--` on to the CLI. Windows PowerShell drops an empty argument,\n    // so an empty word is passed as --empty-word. The word is passed and\n    // matched without the quote it was opened with.\n    const stringAst = \"[System.Management.Automation.Language.StringConstantExpressionAst]\";\n    return [\n      `Register-ArgumentCompleter -Native -CommandName ${psQuote(name)} -ScriptBlock {`,\n      `  param($wordToComplete, $commandAst, $cursorPosition)`,\n      `  $elements = $commandAst.CommandElements`,\n      `  $first = $elements[0]`,\n      `  $bin = if ($first -is ${stringAst}) { $first.Value } else { $first.Extent.Text }`,\n      `  if (-not (Get-Command $bin -ErrorAction SilentlyContinue)) { return }`,\n      `  $partial = $wordToComplete`,\n      `  if ($partial.StartsWith(\"'\")) { $partial = $partial.Substring(1).TrimEnd(\"'\").Replace(\"''\", \"'\") }`,\n      `  elseif ($partial.StartsWith('\"')) { $partial = $partial.Substring(1).TrimEnd('\"') }`,\n      `  $arguments = @('completion', 'complete', '--gate-options')`,\n      `  if ($partial -eq '') { $arguments += '--empty-word' }`,\n      `  $arguments += '--'`,\n      `  for ($i = 1; $i -lt $elements.Count; $i++) {`,\n      `    $element = $elements[$i]`,\n      `    if ($element.Extent.EndOffset -ge $cursorPosition) { break }`,\n      `    if ($element -is ${stringAst}) {`,\n      `      $arguments += $element.Value`,\n      `    } else {`,\n      `      $arguments += $element.Extent.Text`,\n      `    }`,\n      `  }`,\n      `  if ($partial -ne '') { $arguments += $partial }`,\n      `  & $bin @arguments 2>$null | ForEach-Object {`,\n      '    $value, $description = $_ -split \"`t\", 2',\n      `    if (-not $value.StartsWith($partial, [System.StringComparison]::OrdinalIgnoreCase)) { return }`,\n      \"    $text = if ($value -match '[\\\\s''\\\"`$&|;,(){}<>@#]') { \\\"'$($value.Replace(\\\"'\\\", \\\"''\\\"))'\\\" } else { $value }\",\n      `    if (-not $description) { $description = $value }`,\n      `    [System.Management.Automation.CompletionResult]::new($text, $value, 'ParameterValue', $description)`,\n      `  }`,\n      `}`,\n    ].join(\"\\n\");\n  }\n  if (shell === \"nushell\") {\n    // Nushell has one completer for every external command, so the script\n    // keeps the completer that was set before and hands it other commands.\n    // The spans keep the quotes they were typed with, the command's included,\n    // so the script removes them. A command on Windows can be typed with its\n    // extension. Nushell doesn't filter or quote what an external completer\n    // returns, so the script does both.\n    const previous = `$__${id}_previous_completer`;\n    const names = [\"\", \".exe\", \".cmd\", \".bat\"].map((extension) => nuQuote(name + extension)).join(\" \");\n    return [\n      `let __${id}_previous_completer = $env.config.completions.external.completer?`,\n      `$env.config.completions.external.completer = {|spans|`,\n      `  let words = $spans | each {|span|`,\n      `    let quote = $span | str substring 0..0`,\n      `    if $quote in [\"'\", '\"', '\\`'] { $span | str substring 1.. | str trim --right --char $quote } else { $span }`,\n      `  }`,\n      `  let command = $words.0`,\n      `  if ($command | path basename) not-in [${names}] {`,\n      `    return (if ${previous} != null { do ${previous} $spans })`,\n      `  }`,\n      `  if (which $command | is-empty) { return }`,\n      `  let args = $words | skip 1`,\n      `  let partial = $args | last | default \"\"`,\n      `  ^$command completion complete --gate-options -- ...$args`,\n      `    | complete`,\n      `    | get stdout`,\n      `    | lines`,\n      `    | each {|line|`,\n      `      let parts = $line | split row \"\\\\t\"`,\n      `      { value: $parts.0, description: ($parts | get 1? | default \"\") }`,\n      `    }`,\n      `    | where { $in.value | str starts-with --ignore-case $partial }`,\n      \"    | update value {|candidate|\",\n      \"      let value = $candidate.value\",\n      '      if ($value !~ \"[\\\\\\\\s\\'\\\\\"`$|;#()\\\\\\\\[\\\\\\\\]{}]\") {',\n      \"        $value\",\n      '      } else if ($value | str contains \"\\'\") {',\n      \"        $value | to json\",\n      \"      } else {\",\n      \"        $\\\"'($value)'\\\"\",\n      \"      }\",\n      \"    }\",\n      `}`,\n    ].join(\"\\n\");\n  }\n  // fish\n  return [\n    `function __${id}_complete`,\n    `  set -l toks (commandline -opc)`,\n    `  set -l cur (commandline -ct)`,\n    `  set -l bin $toks[1]`,\n    `  command -q -- $bin; or test -x \"$bin\"; or return`,\n    `  $bin completion complete --gate-options -- $toks[2..-1] $cur 2>/dev/null`,\n    `end`,\n    `complete -c ${fishQuote(name)} -f -a '(__${id}_complete)'`,\n  ].join(\"\\n\");\n}\n\n// }}}\n\n/** Generate a completion script for `shell` from a CLI spec. */\nexport function getCompletion(spec: Spec, shell: Shell): string {\n  return renderRuntimeShim(spec, shell);\n}\n\n// Completion commands {{{\n\n/**\n * Hidden machine-facing subcommand the `--runtime` shim calls on every Tab.\n * The tokens after `--` are the command line; the last is the word being\n * completed. Prints `value\\tdescription` lines.\n */\nconst completeCommand: Subcommand = {\n  name: \"complete\",\n  description: \"Resolve completion candidates for a partial command line\",\n  hidden: true,\n  options: [\n    {\n      name: \"--gate-options\",\n      description: \"Only suggest options after a leading dash\",\n    },\n    {\n      name: \"--empty-word\",\n      description: \"The word being completed is empty, so every token is before it\",\n    },\n  ],\n  args: { name: \"tokens\", isVariadic: true, isOptional: true },\n  async action({ path, args, options }) {\n    const spec = path[0] as Spec;\n    // Windows PowerShell drops an empty argument, so its script says the word\n    // is empty with --empty-word instead of passing \"\".\n    const emptyWord = options.has(\"--empty-word\");\n    const partial = emptyWord || args.length === 0 ? \"\" : args[args.length - 1];\n    const before = emptyWord ? args : args.slice(0, -1);\n    const candidates = await completeRuntime({\n      spec,\n      before,\n      partial,\n      gateOptions: options.has(\"--gate-options\"),\n    });\n    const lines = candidates.map((candidate) =>\n      candidate.description ? `${candidate.value}\\t${candidate.description}` : candidate.value,\n    );\n    if (lines.length > 0) {\n      print(lines.join(\"\\n\"));\n    }\n    return 0;\n  },\n};\n\n// }}}\n\n/** A subcommand that prints a shell completion script for the whole CLI. */\nexport const completion: Subcommand = {\n  name: \"completion\",\n  description: \"Print a shell completion script\",\n  args: {\n    name: \"shell\",\n    isOptional: true,\n    suggestions: SHELLS,\n    description: `One of: ${SHELLS.join(\", \")}`,\n  },\n  subcommands: [completeCommand],\n  action({ path, args: [shell] }) {\n    const spec = path[0] as Spec;\n    if (shell === undefined) {\n      print(`Supported shells: ${SHELLS.join(\", \")}`);\n      return 0;\n    }\n\n    if (!isShell(shell)) {\n      printUsageError(path, `Unsupported shell '${shell}'`, { input: shell, choices: SHELLS });\n      return 1;\n    }\n\n    print(getCompletion(spec, shell));\n    return 0;\n  },\n};\n","import type { ActionInit, Spec } from \"./types.js\";\nimport { getHelp, printUsageError } from \"./help.js\";\nimport { ParseError } from \"./errors.js\";\nimport { parse } from \"./parse.js\";\nimport { printError } from \"./util.js\";\nimport type { ParseResult } from \"./parse.js\";\n\nexport { printError };\n\n/**\n * Parse argv and execute the selected action.\n *\n * The selected command's action runs unless a parsed option has an action.\n * Option actions take precedence so helpers like `--help` can run without\n * satisfying the selected command's required arguments. A command without an\n * action prints its help.\n */\nexport async function run(spec: Spec, args: readonly string[] = defaultArgs()): Promise<number> {\n  let result: ParseResult;\n\n  try {\n    result = parse(args, spec);\n  } catch (error: unknown) {\n    if (error instanceof ParseError) {\n      printUsageError(error.context.path, error.message, error.didYouMean);\n    } else {\n      printError(`${error}`);\n    }\n    return 1;\n  }\n\n  const { action, options } = result;\n  const actionInit: ActionInit = {\n    help: (helpOptions) => getHelp(helpOptions?.path ?? result.path, helpOptions),\n    args: result.args,\n    path: result.path,\n    argSeparatorIndex: result.argSeparatorIndex,\n    options: {\n      options,\n      has: (name) => options.has(name),\n      get: (name) => (options.get(name) ?? result.defaults(name))?.[0],\n      all: (name) => options.get(name) ?? result.defaults(name),\n      count: (name) => options.get(name)?.length ?? 0,\n    },\n  };\n\n  let exitCode: number | void;\n  try {\n    const actionResult = action(actionInit);\n    exitCode = typeof actionResult === \"object\" ? await actionResult : actionResult;\n  } catch (error) {\n    printError(describeThrown(error));\n    return 1;\n  }\n\n  return Math.min(Math.max(exitCode ?? 0, 0), 255);\n}\n\n/**\n * The message for a value an action threw. A value that isn't an Error is shown\n * as JSON where it can be, since `String` turns an object into\n * \"[object Object]\".\n */\nfunction describeThrown(value: unknown): string {\n  if (value instanceof Error) {\n    return value.message;\n  }\n  if (typeof value === \"object\" && value !== null) {\n    try {\n      return JSON.stringify(value);\n    } catch {\n      // A cycle or a BigInt, which JSON can't show.\n    }\n  }\n  return String(value);\n}\n\nfunction defaultArgs(): readonly string[] {\n  const maybeProcess = globalThis as typeof globalThis & {\n    process?: { argv?: readonly string[] };\n  };\n  return maybeProcess.process?.argv?.slice(2) ?? [];\n}\n","export type {\n  Action,\n  ActionInit,\n  Arg,\n  CommandPath,\n  Generator,\n  NonEmptyArray,\n  Option,\n  OptionArgs,\n  SingleOrArray,\n  SingleOrArrayOrEmpty,\n  Spec,\n  Subcommand,\n  Suggestion,\n  Template,\n} from \"./types.js\";\n\nexport { completion } from \"./completion.js\";\nexport type { Shell } from \"./completion.js\";\nexport { help, helpCommand } from \"./help.js\";\nexport { printError, run } from \"./run.js\";\n\nimport { completion } from \"./completion.js\";\nimport { help, helpCommand } from \"./help.js\";\nimport { printError, run } from \"./run.js\";\n\nexport default {\n  completion,\n  help,\n  helpCommand,\n  printError,\n  run,\n};\n"],"mappings":";AAEA,SAAgB,QAAW,GAAwC;CACjE,OAAO,MAAM,QAAQ,CAAC;AACxB;;AAGA,SAAgB,UAAa,OAA0C;CACrE,IAAI,UAAU,KAAA,GACZ,OAAO,CAAC;CAEV,IAAI,QAAQ,KAAK,GACf,OAAO,MAAM,MAAM;CAErB,OAAO,CAAC,KAAK;AACf;;;;;;AAOA,SAAgB,QAAW,OAAmD;CAC5E,IAAI,UAAU,KAAA,GACZ,OAAO,CAAC;CAEV,IAAI,QAAQ,KAAK,GACf,OAAO;CAET,OAAO,CAAC,KAAK;AACf;;AAGA,SAAgB,WAAc,OAA0C;CACtE,IAAI,QAAQ,KAAK,GAEf,OAAO,MAAM,MAAM;CAErB,OAAO,CAAC,KAAK;AACf;AAoBA,MAAM,cAAe,WAAyC;;;;;;;;;AAU9D,SAAS,QAAQ,IAAW,MAAoB;CAC9C,MAAM,KAAK,aAAa,mBAAmB,SAAS;CACpD,IAAI,CAAC,IAAI;EACP,CAAC,OAAO,IAAI,QAAQ,MAAM,QAAQ,MAAA,CAAO,KAAK,SAAS,IAAI,IAAI,KAAK,MAAM,GAAG,EAAE,IAAI,IAAI;EACvF;CACF;CACA,MAAM,QAAQ,IAAI,YAAY,CAAC,CAAC,OAAO,IAAI;CAC3C,IAAI,SAAS;CACb,IAAI;EACF,OAAO,SAAS,MAAM,QACpB,UAAU,GAAG,UAAU,IAAI,OAAO,QAAQ,MAAM,SAAS,MAAM;CAEnE,SAAS,OAAO;EAGd,IAFc,MAA4B,SAE7B,UACX,CAAC,OAAO,IAAI,aAAa,SAAS,aAAa,OAAA,EAAS,MAAM,MAAM,SAAS,MAAM,CAAC;CAIxF;AACF;;;;;;AAOA,MAAa,SAAuD,EAAE,OAAO,QAAQ;;AAGrF,SAAgB,MAAM,MAAoB;CACxC,OAAO,MAAM,GAAG,GAAG,KAAK,QAAQ,EAAE,GAAG;AACvC;;AAGA,SAAgB,WAAW,GAAG,SAA0B;CACtD,OAAO,MAAM,GAAG,GAAG,CAAC,UAAU,GAAG,OAAO,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,KAAK,GAAG,EAAE,GAAG;AACrE;;;;;;AASA,SAAgB,YAAY,QAAkB,MAAsB,OAAO,GAAS;CAClF,KAAK,IAAI,IAAI,MAAM,IAAI,KAAK,QAAQ,KAAK;EACvC,MAAM,QAAQ,KAAK,EAAE,CAAC;EACtB,IAAI,UAAU,KAAA,GACZ;EAEF,OAAO,KAAK,KAAK;CACnB;AACF;;;;;;;AAQA,SAAgB,WACd,MACQ;CACR,IAAI,SAAS,KAAA,GACX,OAAO;CAET,IAAI,CAAC,QAAQ,IAAI,GACf,OAAO,KAAK,aAAa,IAAI;CAE/B,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,IAAI,KAAK,EAAE,CAAC,YACV;EAEF;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,WACd,MACQ;CACR,IAAI,SAAS,KAAA,GACX,OAAO;CAET,IAAI,CAAC,QAAQ,IAAI,GACf,OAAO,KAAK,aAAa,WAAW;CAKtC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,IAAI,KAAK,KAAK,SAAS,IAAI,EAAE,CAAC,YAC5B,OAAO;CAIX,OAAO,KAAK;AACd;;;;;;;;;;;ACjKA,SAAS,UAAU,MAAsB;CACvC,IAAI,IAAI;CACR,OAAO,IAAI,KAAK,WAAW,KAAK,OAAO,OAAO,KAAK,OAAO,MACxD;CAEF,OAAO;AACT;;AAGA,SAAS,eAAe,OAAe,MAAuB;CAC5D,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,UAAU,IAAI,MAAM,QAAQ,KACnD,IAAI,KAAK,OAAO,MAAM,IACpB;CAGJ,OAAO,MAAM,MAAM;AACrB;;;;;;AAOA,SAAS,aAAa,GAAW,GAAW,OAAuB;CAEjE,IAAI,SAAS,IAAI,YAAY,EAAE,SAAS,CAAC;CACzC,IAAI,WAAW,IAAI,YAAY,EAAE,SAAS,CAAC;CAC3C,IAAI,UAAU,IAAI,YAAY,EAAE,SAAS,CAAC;CAC1C,KAAK,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,KAC7B,SAAS,KAAK;CAGhB,KAAK,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,KAAK;EAClC,QAAQ,KAAK;EACb,IAAI,SAAS;EACb,KAAK,IAAI,IAAI,GAAG,KAAK,EAAE,QAAQ,KAAK;GAClC,MAAM,eAAe,SAAS,IAAI,MAAM,EAAE,IAAI,OAAO,EAAE,IAAI,KAAK,IAAI;GACpE,IAAI,IAAI,KAAK,IAAI,SAAS,KAAK,GAAG,QAAQ,IAAI,KAAK,GAAG,YAAY;GAClE,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,OAAO,EAAE,IAAI,MAAM,EAAE,IAAI,OAAO,EAAE,IAAI,IAChE,IAAI,KAAK,IAAI,GAAG,OAAO,IAAI,KAAK,CAAC;GAEnC,QAAQ,KAAK;GACb,IAAI,IAAI,QACN,SAAS;EAEb;EAEA,IAAI,SAAS,OACX,OAAO,QAAQ;EAEjB,MAAM,WAAW;EACjB,SAAS;EACT,WAAW;EACX,UAAU;CACZ;CACA,OAAO,SAAS,EAAE;AACpB;;AAUA,SAAS,UAAU,SAA4B,SAAwD;CACrG,IAAI;CACJ,KAAK,MAAM,UAAU,SAAS;EAC5B,MAAM,QAAQ,OAAO,WAAW,WAAW,CAAC,MAAM,IAAI,OAAA,CAAQ,KAAK,OAAO;EAC1E,IAAI,SAAS,KAAA,GACX;EAEF,IAAI,UAAU,KAAA,GACZ;EAEF,QAAQ;CACV;CACA,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,cAAc,OAAe,SAAgD;CAC3F,MAAM,cAAc,UAAU,KAAK;CACnC,MAAM,OAAO,MAAM,MAAM,WAAW;CAEpC,IAAI,KAAK,UAAU,GAAG;EACpB,MAAM,QAAQ,UAAU,UAAU,SAAS,KAAK,WAAW,KAAK,CAAC;EACjE,IAAI,UAAU,KAAA,GACZ,OAAO;CAEX;CAEA,IAAI,KAAK,UAAU,GAAG;EACpB,MAAM,QAAQ,UAAU,UAAU,SAAS,eAAe,MAAM,KAAK,MAAM,UAAU,IAAI,CAAC,CAAC,CAAC;EAC5F,IAAI,UAAU,KAAA,GACZ,OAAO;CAEX;CAEA,IAAI;CACJ,IAAI,QAAQ,KAAK,MAAM,KAAK,SAAS,CAAC;CACtC,KAAK,MAAM,QAAQ,QAAQ,KAAK,GAAG;EACjC,MAAM,QAAQ,KAAK,MAAM,UAAU,IAAI,CAAC;EAExC,IAAI,KAAK,IAAI,MAAM,SAAS,KAAK,MAAM,IAAI,OACzC;EAEF,MAAM,WAAW,aAAa,MAAM,OAAO,KAAK;EAChD,IAAI,YAAY,UAAU,SAAS,KAAA,KAAa,WAAW,QAAQ;GACjE,OAAO;GAEP,QAAQ;GACR,IAAI,aAAa,GACf;EAEJ;CACF;CACA,OAAO;AACT;;;;;;;;;;;;ACzHA,SAAgB,gBACd,aACA,OACA,YACA,YAAY,OACZ,YAAmC,CAAC,GACnB;CACjB,KAAK,MAAM,aAAa,aACtB,IAAIA,UAAQ,WAAW,KAAK,GAC1B,OAAO,EAAE,SAAS,UAAU;CAGhC,KAAK,MAAM,aAAa,WACtB,IAAIA,UAAQ,WAAW,KAAK,GAC1B,OAAO,EAAE,SAAS,UAAU;CAIhC,MAAM,UADc,WAAW,gCAAgC,CAAC,YAClC,cAAc,aAAa,KAAK,IAAI,CAAC;CACnE,IAAI,QAAQ,WAAW,GACrB,OAAO,EAAE,SAAS,QAAQ,GAAG;CAE/B,OAAO,IAAI,aAAa,cAAc,aAAa,SAAS,GAAG,OAAO,OAAO;AAC/E;;;;;AAMA,SAAgB,cACd,aACA,WACuB;CACvB,IAAI,UAAU,WAAW,GACvB,OAAO;CAET,MAAM,MAAM,CAAC,GAAG,WAAW;CAC3B,KAAK,MAAM,aAAa,WACtB,IAAI,CAAC,QAAQ,UAAU,IAAI,CAAC,CAAC,MAAM,SAAS,IAAI,MAAM,YAAYA,UAAQ,SAAS,IAAI,CAAC,CAAC,GACvF,IAAI,KAAK,SAAS;CAGtB,OAAO;AACT;AAEA,SAASA,UAAQ,SAAqB,OAAwB;CAC5D,MAAM,QAAQ,QAAQ;CACtB,OAAO,OAAO,UAAU,WAAW,UAAU,QAAQ,MAAM,SAAS,KAAK;AAC3E;;AAGA,SAAS,cAAc,aAAoC,OAA6B;CACtF,IAAI,UAAU,IACZ,OAAO,CAAC;CAEV,OAAO,YAAY,QAChB,cAAc,CAAC,UAAU,UAAU,QAAQ,UAAU,IAAI,CAAC,CAAC,MAAM,SAAS,KAAK,WAAW,KAAK,CAAC,CACnG;AACF;;;;;AAMA,IAAa,eAAb,MAA0B;CAQL;CACA;CACA;CATnB,UAAmB;;;;;CAMnB,YACE,aACA,OACA,UACA;EAHiB,KAAA,cAAA;EACA,KAAA,QAAA;EACA,KAAA,WAAA;CAChB;;CAGH,SAAuD;EACrD,MAAM,QAAQ,KAAK;EACnB,IAAI,UAAU,IACZ,OAAO,EAAE,SAAS,8CAA8C;EAElE,IAAI,KAAK,SAAS,SAAS,GAIzB,OAAO,EAAE,SAAS,sBAAsB,MAAM,eAH7B,KAAK,SAAS,SAAS,YACtC,QAAQ,QAAQ,IAAI,CAAC,CAAC,QAAQ,SAAS,KAAK,WAAW,KAAK,CAAC,CAEK,CAAC,CAAC,KAAK,IAAI,IAAI;EAErF,MAAM,UAAU,mBAAmB,KAAK,WAAW,CAAC,CAAC,KAAK,YAAY,QAAQ,QAAQ,IAAI,CAAC;EAC3F,OAAO;GAAE,SAAS,oBAAoB,MAAM;GAAI,YAAY;IAAE,OAAO;IAAO;GAAQ;EAAE;CACxF;AACF;;AAGA,SAAgB,mBAAmB,aAA8D;CAC/F,OAAO,aAAa,QAAQ,eAAe,CAAC,WAAW,MAAM,KAAK,CAAC;AACrE;;AAGA,MAAa,SAAiB,EAAE,WAAW;CACzC,MAAM,KAAK,CAAC;CACZ,OAAO;AACT;;;AC7GA,SAAgB,oBAAgC;CAC9C,OAAO;EACL,qBAAqB,CAAC,GAAG;EACzB,2BAA2B;EAC3B,6BAA6B;EAC7B,8BAA8B;CAChC;AACF;;;;;AAMA,SAAgB,gBAAgB,YAAwB,SAAkC;CACxF,MAAM,aAAa,QAAQ;CAC3B,IAAI,CAAC,YACH;CAEF,IAAI,WAAW,qBACb,WAAW,sBAAsB,QAAQ,WAAW,mBAAmB;CAEzE,IAAI,OAAO,WAAW,iCAAiC,WACrD,WAAW,+BAA+B,WAAW;CAEvD,IAAI,OAAO,WAAW,gCAAgC,WACpD,WAAW,8BAA8B,WAAW;CAEtD,IAAI,OAAO,WAAW,8BAA8B,WAClD,WAAW,4BAA4B,WAAW;AAEtD;;;;;;;;;;;;ACRA,IAAa,cAAb,MAAa,YAAY;;CAEvB,QAA2B,CAAC;;CAE5B,aAAgC,CAAC;;;;;CAKjC,uBAA8C,CAAC;;CAE/C,aAAkC,kBAAkB;CACpD,UAA4C;;CAG5C,OAAO,GAAG,MAAmD;EAC3D,MAAM,QAAQ,IAAI,YAAY;EAC9B,KAAK,MAAM,WAAW,MACpB,MAAM,MAAM,OAAO;EAErB,OAAO;CACT;;CAGA,MAAM,SAAkC;EACtC,MAAM,oBAAoB,KAAK,SAAS;EACxC,IAAI,mBAAmB;GACrB,MAAM,aAAa,kBAAkB,QAAQ,eAAe,WAAW,YAAY;GACnF,IAAI,WAAW,SAAS,GACtB,KAAK,qBAAqB,QAAQ,GAAG,UAAU;EAEnD;EACA,KAAK,UAAU;EACf,KAAK,MAAM,SAAS;EACpB,IAAI,QAAQ,SACV,KAAK,MAAM,UAAU,QAAQ,SAC3B,CAAC,OAAO,eAAe,KAAK,aAAa,KAAK,MAAA,CAAO,KAAK,MAAM;EAGpE,gBAAgB,KAAK,YAAY,OAAO;CAC1C;;CAGA,QAAQ,MAA6B;EACnC,MAAM,EAAE,OAAO,eAAe;EAC9B,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KACrC,IAAI,QAAQ,MAAM,EAAE,CAAC,MAAM,IAAI,GAC7B,OAAO,MAAM;EAGjB,KAAK,IAAI,IAAI,WAAW,SAAS,GAAG,KAAK,GAAG,KAC1C,IAAI,QAAQ,WAAW,EAAE,CAAC,MAAM,IAAI,GAClC,OAAO,WAAW;EAGtB,OAAO;CACT;;;;;;CAOA,OAAgE;EAG9D,MAAM,wBAAQ,IAAI,IAAoB;EACtC,KAAK,MAAM,WAAW,CAAC,KAAK,YAAY,KAAK,KAAK,GAChD,KAAK,MAAM,UAAU,SACnB,KAAK,MAAM,QAAQ,QAAQ,OAAO,IAAI,GACpC,MAAM,IAAI,MAAM,MAAM;EAI5B,MAAM,QAAQ,YAA+B;GAC3C,MAAM,SAA0B,CAAC;GACjC,KAAK,MAAM,UAAU,SAAS;IAC5B,MAAM,QAAQ,QAAQ,OAAO,IAAI,CAAC,CAAC,QAAQ,SAAS,MAAM,IAAI,IAAI,MAAM,MAAM;IAC9E,IAAI,MAAM,SAAS,GACjB,OAAO,KAAK;KAAE;KAAQ;IAAM,CAAC;GAEjC;GACA,OAAO;EACT;EACA,OAAO;GAAE,OAAO,KAAK,KAAK,KAAK;GAAG,YAAY,KAAK,KAAK,UAAU;EAAE;CACtE;;CAGA,UAAmE;EACjE,MAAM,EAAE,OAAO,eAAe,KAAK,KAAK;EACxC,MAAM,SAAS,YAA2B,CAAC,QAAQ,OAAO;EAC1D,OAAO;GAAE,OAAO,MAAM,OAAO,KAAK;GAAG,YAAY,WAAW,OAAO,KAAK;EAAE;CAC5E;;CAGA,kBAA8B;EAC5B,MAAM,EAAE,OAAO,eAAe,KAAK,QAAQ;EAC3C,OAAO,CAAC,GAAG,OAAO,GAAG,UAAU,CAAC,CAAC,KAAK,YAAY,QAAQ,KAAK;CACjE;;CAGA,WAAqB;EACnB,OAAO,CAAC,GAAG,KAAK,OAAO,GAAG,KAAK,UAAU,CAAC,CAAC,QAAQ,WAAW,OAAO,UAAU;CACjF;;;;;;CAOA,MAAM,QAAgB,QAA2B,QAAQ,OAAO,IAAI,GAAiB;EACnF,MAAM,QAAQ,SAAgC;GAC5C,IAAI,WAAW,OAAO,IAAI,MAAM,GAC9B,OAAO;GAET,IAAI,OAAO,mBACT,OAAO,KAAK,kBAAkB,MAAM;GAGtC,OADc,CAAC,KAAK,WAAW,8BAA8B,SAAS,OAAO,SAAS,OACvE,KAAK;EACtB;EACA,OAAO,MAAM,KAAK,UAAU;GAAE;GAAM,MAAM,KAAK,IAAI;EAAE,EAAE;CACzD;;;;;CAMA,kBAAkB,QAA+B;EAC/C,MAAM,WAAW,OAAO;EACxB,IAAI,OAAO,aAAa,UACtB,OAAO;EAET,OAAO,WAAY,KAAK,WAAW,oBAAoB,MAAM,MAAO;CACtE;AACF;AAEA,MAAM,6BAAa,IAAI,QAAwB;;;;;;;;;AAU/C,SAAgB,UAAU,QAAwB;CAChD,IAAI,MAAM,WAAW,IAAI,MAAM;CAC/B,IAAI,QAAQ,KAAA,GAAW;EACrB,MAAM,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI;EACvF,WAAW,IAAI,QAAQ,GAAG;CAC5B;CACA,OAAO;AACT;AAEA,SAAS,QAAQ,OAAmC,MAAuB;CACzE,OAAO,OAAO,UAAU,WAAW,UAAU,OAAO,MAAM,SAAS,IAAI;AACzE;;ACxLA,SAAS,OAAO,KAAa;CAC3B,IAAI,IAAI,OAAO,MACb,OAAO;CAET,MAAM,QAAQ,IAAI,MAAM,IAAI,CAAC,CAAC,MAAM,GAAG,EAAE;CACzC,MAAM,SAAS,MAAM,EAAE,CAAC,SAAS,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC;CACtD,OAAO,MAAM,KAAK,SAAS,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI;AAC1D;;AAcA,SAAgB,QAAQ,MAAiC,SAAqB,CAAC,GAAW;CACxF,MAAM,EAAE,cAAc,MAAM,QAAQ,MAAM,eAAe;CACzD,MAAM,WAAW,YAAY,IAAI;CACjC,IAAI,YACF,SAAS,aAAa,cAAc,WAAW,OAAO,WAAW,OAAO;CAE1E,IAAI,CAAC,aACH,SAAS,cAAc,KAAA;CAEzB,IAAI,CAAC,OACH,SAAS,QAAQ,KAAA;CAEnB,OAAO,mBAAmB,QAAQ;AACpC;;;;;AAMA,SAAgB,gBACd,MACA,SACA,YACM;CACN,WAAW,GAAG,QAAQ,MAAM,QAAQ,MAAM;EAAE,aAAa;EAAO;CAAW,CAAC,GAAG;AACjF;;;;;;;;;;AAWA,MAAa,cAA0B;CACrC,MAAM;CACN,aAAa;CACb,MAAM;EACJ,MAAM;EACN,YAAY;EACZ,YAAY;CACd;CACA,OAAO,EAAE,MAAM,MAAM,QAAQ;EAC3B,MAAM,OAAO,KAAK,KAAK,SAAS;EAChC,MAAM,WAAW,KAAK,MAAM,GAAG,EAAE;EAEjC,KAAK,MAAM,QAAQ,MAAM;GACvB,MAAM,UAAU,SAAS,SAAS,SAAS;GAC3C,IAAI,CAAC,QAAQ,aACX;GAGF,MAAM,QAAQ,YAAY,GAAG,QAAQ;GACrC,MAAM,QAAQ,gBACZ,QAAQ,aACR,MACA,MAAM,YACN,OACA,MAAM,oBACR;GAEA,IAAI,MAAM,YAAY,QAAQ,CAAC,QAAQ,YAAY,SAAS,IAAI,GAC9D;GAEF,IAAI,MAAM,SAAS;IACjB,SAAS,KAAK,MAAM,OAAO;IAC3B;GACF;GACA,IAAI,CAAC,QAAQ,sBAAsB,WAAW,QAAQ,IAAI,IAAI,GAC5D;GAEF,MAAM,EAAE,SAAS,eAAe,MAAM,OAAO;GAC7C,gBAAgB,UAAU,SAAS,UAAU;GAC7C,OAAO;EACT;EAEA,MAAM,KAAK,EAAE,MAAM,SAAS,CAAC,CAAC;EAC9B,OAAO;CACT;AACF;;AAGA,MAAa,OAAe;CAC1B,MAAM,CAAC,MAAM,QAAQ;CACrB,aAAa;CACb,cAAc;CACd,OAAO,EAAE,QAAQ;EACf,MAAM,mBAAmB,YAAY,IAAI,CAAC,CAAC;EAC3C,OAAO;CACT;AACF;AAYA,SAAS,wBAAwB,UAA6C;CAC5E,OAAO,SAAS,KAAK,YAAY,iBAAiB,WAAW,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG;AACvF;AAEA,SAAS,YAAY,UAAmD;CACtE,MAAM,UAAU,SAAS,SAAS,SAAS;CAC3C,MAAM,QAAQ,YAAY,GAAG,QAAQ;CACrC,MAAM,QAAQ,EAAE,QAAQ,YAA2B,eAAe,QAAQ,MAAM,MAAM,QAAQ,KAAK,CAAC;CAEpG,MAAM,cAAc,QAAQ;CAC5B,MAAM,cAAc;CAEpB,MAAM,cAA2C,mBAAmB,QAAQ,WAAW,CAAC,CAAC,KACtF,eAAe,CACd,WAAW,WAAW,IAAI,CAAC,CACxB,MAAM,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,CACnC,KAAK,IAAI,GACZ,WAAW,eAAe,WAC5B,CACF;CAEA,MAAM,UAAU,MAAM,QAAQ;CAC9B,IAAI,gBAAgB,QAAQ;CAC5B,IAAI,0BAA0B,QAAQ;CAEtC,IAAI,SAAS,WAAW,KAAK,YAAY,WAAW,GAAG;EACrD,MAAM,WAAW,IAAI,IAAI,CAAC,GAAG,eAAe,GAAG,uBAAuB,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;EACjG,iBAAiB,QAAQ,WAAW,CAAC,EAAA,CAAG,SAAS,WAAW,SAAS,IAAI,MAAM,KAAK,CAAC,CAAC;EACtF,0BAA0B,CAAC;CAC7B;CACA,MAAM,OAAO,YAA6C;EACxD,MAAM,WAAqB,CAAC;EAC5B,YAAY,UAAU,QAAQ,QAAQ,OAAO,IAAI,CAAC;EAClD,OAAO,CAAC,KAAK,OAAO,GAAG,aAAa,QAAQ,OAAO,aAAa,UAAU,WAAW,CAAC;CACxF;CACA,MAAM,UAAU,cAAc,IAAI,GAAG;CACrC,MAAM,oBAAoB,wBAAwB,IAAI,GAAG;CAEzD,MAAM,eAAe;EACnB,MAAM,QAAQ,CAAC,wBAAwB,QAAQ,CAAC;EAChD,KAAK,MAAM,WAAW,CAAC,GAAG,eAAe,GAAG,uBAAuB,GACjE,IAAI,QAAQ,OAAO,YACjB,MAAM,KAAK,KAAK,OAAO,CAAC;EAG5B,IAAI,QAAQ,UAAU,kBAAkB,QACtC,MAAM,KAAK,SAAS;EAEtB,IAAI,QAAQ,oBACV,MAAM,KAAK,WAAW;OACjB;GACL,MAAM,OAAO,UAAU,QAAQ,IAAI;GACnC,IAAI,KAAK,SAAS,GAChB,MAAM,KAAK,mBAAmB,IAAI,CAAC;EAEvC;EACA,OAAO,MAAM,KAAK,GAAG;CACvB,EAAA,CAAG;CAKH,MAAM,cAAc,QAAQ,qBAAqB,CAAC,IAAI,QAAQ,QAAQ,IAAI;CAS1E,OAAO;EACL;EACA;EACA,MAXgB,YAAY,MAAM,QAAQ,IAAI,gBAAgB,KAAA,KAAa,IAAI,YAAY,KAAA,CAClD,IACvC,YAAY,KAAK,QAAQ,EACtB,IAAI,QAAQ,eAAe,IAAI,aAAa,QAAQ,KACrD,aAAa,IAAI,aAAa,IAAI,YAAY,KAAA,IAAY,CAAC,IAAI,CAAC,IAAI,OAAO,GAAG,EAAE,CAClF,CAAC,IACD,CAAC;EAMH;EACA;EACA;CACF;AACF;;;;;;AAOA,SAAS,aACP,aACA,UACA,aACQ;CACR,IAAI,SAAS,WAAW,GACtB,OAAO,eAAe;CAExB,MAAM,QAAQ,aAAa,SAAS,KAAK,GAAG,EAAE;CAC9C,IAAI,gBAAgB,KAAA,GAClB,OAAO;CAGT,OAAO,GAAG,cADO,YAAY,MAAM,YAAY,YAAY,IAAI,IAAI,CACpC,CAAC,CAAC,SAAS,IAAI,MAAM,UAAU,KAAK,MAAM,OAAO;AAClF;AAEA,SAAgB,mBAAmB,UAAgC;CACjE,MAAM,QAAQ,CAAC;CAEf,MAAM,SAAS;CAEf,IAAI,SAAS,YACX,MAAM,KAAK,qBAAqB,SAAS,WAAW,GAAG;CAGzD,IAAI,SAAS,aACX,MAAM,KAAK,OAAO,SAAS,WAAW,CAAC;CAGzC,IAAI,SAAS,OACX,MAAM,KAAK,WAAW,SAAS,SAAS,OAAO;CAGjD,MAAM,oBAAoB,KAAK,IAC7B,GACA,GAAG,SAAS,QAAQ,KAAK,CAAC,UAAU,KAAK,MAAM,GAC/C,GAAG,SAAS,kBAAkB,KAAK,CAAC,UAAU,KAAK,MAAM,CAC3D;CACA,MAAM,+BAA+B;CAGrC,MAAM,cAAc,MAA0B,UAAkB;EAC9D,MAAM,QAAQ,CAAC;EACf,MAAM,UAAU,SAAS,IAAI,OAAO,QAAQ,4BAA4B;EACxE,KAAK,MAAM,CAAC,MAAM,SAAS,MAAM;GAC/B,IAAI,SAAS,IAAI;IACf,MAAM,KAAK,GAAG,SAAS,MAAM;IAC7B;GACF;GACA,MAAM,SAAS,IAAI,OAAO,QAAQ,KAAK,SAAS,4BAA4B;GAC5E,MAAM,CAAC,MAAM,GAAG,QAAQ,KAAK,MAAM,IAAI;GACvC,MAAM,cAAc,CAAC,MAAM,GAAG,KAAK,KAAK,SAAS,UAAU,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;GAC3E,MAAM,KAAK,GAAG,SAAS,OAAO,SAAS,aAAa;EACtD;EACA,OAAO;CACT;CACA,MAAM,iBAAiB,YAAgC,WAAW,SAAS,iBAAiB;CAE5F,IAAI,SAAS,KAAK,SAAS,GAAG;EAC5B,MAAM,iBAAiB,KAAK,IAAI,GAAG,SAAS,KAAK,KAAK,CAAC,UAAU,KAAK,MAAM,CAAC;EAC7E,MAAM,KAAK,CAAC,cAAc,GAAG,WAAW,SAAS,MAAM,cAAc,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;CACpF;CAEA,IAAI,SAAS,YAAY,SAAS,GAAG;EACnC,MAAM,QAAQ,CAAC,WAAW;EAC1B,MAAM,cAAc,KAAK,IAAI,GAAG,SAAS,YAAY,KAAK,CAAC,UAAU,KAAK,MAAM,CAAC;EACjF,MAAM,UAAU,SAAS,IAAI,OAAO,cAAc,4BAA4B;EAC9E,KAAK,MAAM,CAAC,MAAM,SAAS,SAAS,aAAa;GAC/C,MAAM,SAAS,IAAI,OAAO,cAAc,KAAK,SAAS,4BAA4B;GAClF,MAAM,CAAC,MAAM,GAAG,QAAQ,KAAK,MAAM,MAAM,CAAC,CAAC,EAAE,CAAC,MAAM,IAAI;GACxD,MAAM,cAAc,CAAC,MAAM,GAAG,KAAK,KAAK,SAAS,UAAU,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;GAC3E,MAAM,KAAK,GAAG,SAAS,OAAO,SAAS,aAAa;EACtD;EACA,MAAM,KAAK,MAAM,KAAK,IAAI,CAAC;CAC7B;CAEA,IAAI,SAAS,QAAQ,SAAS,GAAG;EAC/B,MAAM,QAAQ,CAAC,UAAU,GAAG,cAAc,SAAS,OAAO,CAAC;EAC3D,MAAM,KAAK,MAAM,KAAK,IAAI,CAAC;CAC7B;CAEA,IAAI,SAAS,kBAAkB,SAAS,GAAG;EACzC,MAAM,QAAQ,CAAC,iBAAiB,GAAG,cAAc,SAAS,iBAAiB,CAAC;EAC5E,MAAM,KAAK,MAAM,KAAK,IAAI,CAAC;CAC7B;CACA,OAAO,MAAM,KAAK,MAAM,IAAI;AAC9B;AAEA,SAAgB,iBAAiB,SAAwC;CACvE,IAAI,UAAU,QAAQ;CACtB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;EACvC,MAAM,SAAS,QAAQ;EACvB,IAAI,OAAO,SAAS,QAAQ,QAC1B,UAAU;CAEd;CACA,OAAO;AACT;;;;;AAMA,SAAgB,eAAe,QAAgB,OAAsC;CACnF,MAAM,aAAa,UAAU,OAAO,IAAI;CACxC,MAAM,SAAS,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,KAAK,SAAS,EAAE,KAAK,MAAM;CAEtE,OAAO,CADQ,GAAG,IAAI,IAAI,OAAO,KAAK,SAAS,KAAK,IAAI,CAAC,CAC9C,CAAC,CACT,KAAK,SAAS;EAEb,OADc,OAAO,QAAQ,SAAS,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,SAAS,KAAK,IAClE,CAAC,CAAC,KAAK,IAAI,IAAI,mBAAmB,YAAY,IAAI;CAC/D,CAAC,CAAC,CACD,KAAK,IAAI;AACd;;AAGA,SAAS,mBAAmB,MAAa,MAA6B;CACpE,IAAI,KAAK,WAAW,GAClB,OAAO;CAET,IAAI,SAAS,MACX,OAAO,IAAI,mBAAmB,IAAI;CAEpC,MAAM,CAAC,OAAO,GAAG,QAAQ;CACzB,MAAM,OAAO,MAAM,QAAQ;CAC3B,MAAM,UACH,MAAM,aAAa,IAAI,OAAO,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,OAAO,MAAM,aAAa,QAAQ;CAC7F,OAAO,KAAK,SAAS,IAAI,GAAG,OAAO,GAAG,mBAAmB,IAAI,MAAM;AACrE;AAEA,SAAgB,mBAAmB,MAAa;CAC9C,OAAO,KAAK,KAAK,QAAQ,YAAY,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG;AACrD;AAEA,SAAgB,YAAY,KAAkB;CAC5C,MAAM,OAAO,IAAI,QAAQ;CACzB,IAAI,MAAM;CACV,IAAI,MAAM;CACV,IAAI,SAAS;CACb,IAAI,IAAI,YAAY;EAClB,MAAM;EACN,MAAM;CACR;CACA,IAAI,IAAI,YACN,SAAS;CAEX,OAAO,GAAG,MAAM,OAAO,MAAM;AAC/B;;AC3WA,MAAM,OAAO,KAAK;;;;;;AAiBlB,IAAa,aAAb,cAAgC,MAAM;CACpC;CACA;CACA,YAAY,SAAuB,SAAiB,YAAyB;EAC3E,MAAM,OAAO;EACb,KAAK,UAAU;EACf,KAAK,aAAa;EAClB,KAAK,OAAO,KAAK,YAAY;CAC/B;AACF;AAEA,IAAa,gBAAb,cAAmC,WAAW;CAC5C;CACA,YAAY,QAAgB,cAAiC,SAAuB;EAClF,MAAM,MAAM,GAAG,KAAK,MAAM,EAAE;EAC5B,MAAM,SAAS,KAAK;GAAE,OAAO;GAAQ,SAAS;EAAa,CAAC;EAC5D,KAAK,SAAS;CAChB;AACF;AAEA,IAAa,mBAAb,cAAsC,WAAW;CAC/C;CACA,YAAY,QAAgB,SAAuB;EACjD,MAAM,SAAS,UAAU,OAAO,wBAAwB;EACxD,KAAK,SAAS;CAChB;AACF;AAEA,IAAa,mBAAb,cAAsC,WAAW;CAC/C,YAAY,OAAe,SAAuB;EAChD,MAAM,SAAS,uBAAuB,KAAK,KAAK,EAAE,gBAAgB;CACpE;AACF;AAEA,IAAa,wBAAb,cAA2C,WAAW;CACpD,YAAY,QAAgB,KAAa,KAAa,SAAuB;EAC3E,MAAM,MACJ,QAAQ,MACJ,UAAU,OAAO,SAAS,IAAI,WAAW,QAAQ,IAAI,KAAK,QAC1D,CAAC,OAAO,SAAS,GAAG,IAClB,UAAU,OAAO,kBAAkB,IAAI,WAAW,QAAQ,IAAI,KAAK,QACnE,UAAU,OAAO,iBAAiB,IAAI,OAAO,IAAI;EACzD,MAAM,SAAS,GAAG;CACpB;AACF;AAEA,IAAa,kBAAb,cAAqC,WAAW;CAC9C,YAAY,KAAa,KAAa,SAAuB;EAC3D,MAAM,MACJ,QAAQ,MACJ,YAAY,IAAI,WAAW,QAAQ,IAAI,KAAK,QAC5C,CAAC,OAAO,SAAS,GAAG,IAClB,qBAAqB,IAAI,WAAW,QAAQ,IAAI,KAAK,QACrD,oBAAoB,IAAI,OAAO,IAAI;EAC3C,MAAM,SAAS,GAAG;CACpB;AACF;AAEA,IAAa,wBAAb,cAA2C,WAAW;CACpD,YAAY,MAAc,SAAuB;EAC/C,MAAM,MAAM,UAAU,KAAK;EAC3B,MAAM,SAAS,GAAG;CACpB;AACF;;;ACkBA,SAAS,iBAAiB,MAAc,YAAuC;CAC7E,KAAK,MAAM,OAAO,YAChB,IAAI,KAAK,WAAW,GAAG,GACrB,OAAO;CAGX,OAAO;AACT;;;;;;;AAQA,SAAS,eAAe,OAAe,YAAsE;CAC3G,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,KAAK,MAAM,aAAa,YAAY;EAClC,MAAM,KAAK,MAAM,QAAQ,SAAS;EAClC,IAAI,OAAO,IACT;EAEF,IAAI,UAAU,MAAM,KAAK,SAAU,OAAO,SAAS,UAAU,SAAS,IAAI,QAAS;GACjF,MAAM;GACN,QAAQ;EACV;CACF;CACA,OAAO,MAAM;EAAE;EAAO;CAAI,IAAI;AAChC;;;;;AAYA,SAAS,iBACP,SACA,aACA,UACA,SACM;CACN,KAAK,MAAM,UAAU,aAAa;EAChC,IAAI,CAAC,OAAO,WACV;EAEF,KAAK,MAAM,QAAQ,OAAO,WACxB,IAAI,CAAC,QAAQ,IAAI,IAAI,GACnB,MAAM,IAAI,WACR,SACA,GAAG,QAAQ,OAAO,IAAI,CAAC,CAAC,KAAK,GAAG,EAAE,YAAY,KAAK,2BACrD;CAGN;CACA,KAAK,MAAM,UAAU,aAAa;EAChC,IAAI,CAAC,OAAO,aACV;EAEF,KAAK,MAAM,QAAQ,OAAO,aACxB,IAAI,QAAQ,IAAI,IAAI,GAClB,MAAM,IAAI,WACR,SACA,GAAG,QAAQ,OAAO,IAAI,CAAC,CAAC,KAAK,GAAG,EAAE,+BAA+B,MACnE;CAGN;CACA,KAAK,MAAM,UAAU,UACnB,KAAK,MAAM,QAAQ,QAAQ,OAAO,IAAI,GACpC,IAAI,CAAC,QAAQ,IAAI,IAAI,GACnB,MAAM,IAAI,sBAAsB,MAAM,OAAO;AAIrD;;;;;;;;;AAUA,IAAM,UAAN,MAAc;CAuDO;CAtDnB;CAEA,eAA2C,KAAA;CAC3C,OAA0B,CAAC;CAC3B,0BAA0C,IAAI,IAAI;CAClD,cAAiC,CAAC;CAClC,oBAAoB;CAGpB,QAA8B,IAAI,YAAY;CAC9C,cAAyD,KAAA;CACzD,iBAAyB;CACzB,iBAAyB;CACzB,aAAkC,KAAK,MAAM;CAE7C,cAAc;CAMd,aAA4B;CAC5B,iBAAyB;CACzB,aAAa;CACb,WAAmB;CACnB,mBAA2B;CAM3B,SAAkC;CAClC,cAAsB;CACtB,YAAoB;CACpB,YAAoB;CACpB,YAAoC,CAAC;CACrC,oBAA8C;CAK9C,cAAyC;CAMzC,+BAA2D,IAAI,IAAI;CAGnE,WAA4E;CAE5E,YACE,MACA,QACA;EADiB,KAAA,SAAA;EAEjB,KAAK,OAAO,CAAC,IAAI;EACjB,KAAK,aAAa,IAAI;CACxB;CAEA,MAA4B;EAC1B,OAAO,EAAE,MAAM,KAAK,KAAK;CAC3B;;CAGA,IAAI,kBAA2B;EAC7B,OAAO,KAAK,aAAa,KAAK;CAChC;CAGA,aAAqB,SAAkC;EACrD,KAAK,MAAM,MAAM,OAAO;EACxB,KAAK,cAAc,QAAQ;EAC3B,KAAK,iBAAiB,WAAW,QAAQ,IAAI;EAC7C,KAAK,iBAAiB,WAAW,QAAQ,IAAI;CAC/C;CAEA,WAAmB,MAA6B;EAC9C,OAAO,KAAK,MAAM,QAAQ,IAAI;CAChC;CAEA,cAAsB,QAA+B;EACnD,OAAO,IAAI,cAAc,QAAQ,KAAK,MAAM,gBAAgB,GAAG,KAAK,IAAI,CAAC;CAC3E;CAKA,YAA0B;EACxB,MAAM,SAAS,KAAK;EACpB,IAAI,KAAK,UAAU,QAAQ;GACzB,MAAM,QAAQ,OAAO,SAAS,KAAK;GACnC,IAAI,QAAQ,KAAK,WACf,MAAM,IAAI,sBAAsB,KAAK,gBAAgB,KAAK,WAAW,KAAK,WAAW,KAAK,IAAI,CAAC;GAEjG,YAAY,QAAQ,KAAK,WAAW,KAAK;EAC3C;EACA,KAAK,SAAS;CAChB;;CAGA,cAA4B;EAC1B,KAAK,UAAU;EACf,KAAK,aAAa;EAClB,KAAK,aAAa,KAAK,WAAW,KAAK,mBAAmB;CAC5D;CAEA,UAAkB,QAAgB,MAAoB;EACpD,KAAK,UAAU;EACf,KAAK,aAAa;EAClB,KAAK,iBAAiB;EACtB,KAAK,aAAa;EAClB,KAAK,WAAW,WAAW,OAAO,IAAI;EAEtC,KAAK,mBAAmB,OAAO,oBAAoB,IAAI,WAAW,OAAO,IAAI;EAC7E,KAAK,YAAY,KAAK,MAAM;EAC5B,IAAI,OAAO,QACT,KAAK,eAAe,OAAO;EAE7B,MAAM,QAAQ,QAAQ,OAAO,IAAI;EACjC,MAAM,UAAU,KAAK;EAErB,IAAI;EACJ,IAAI,OAAO,cAAc;GAGvB,MAAM,YAAY,OAAO,iBAAiB,OAAO,WAAW,OAAO;GACnE,MAAM,MAAM,UAAU,MAAM;GAC5B,IAAI,OAAO,KAAK,aAAa,IAAI,GAAG;GACpC,IAAI,CAAC,MAAM;IACT,OAAO;KAAE,QAAQ,CAAC;KAAG,OAAO;IAAE;IAC9B,KAAK,aAAa,IAAI,KAAK,IAAI;GACjC;GACA,IAAI,KAAK,UAAU,KAAK,SAAS,WAC/B,MAAM,IAAI,WAAW,KAAK,IAAI,GAAG,sBAAsB;GAEzD,KAAK,SAAS;GAEd,KAAK,MAAM,SAAS,OAClB,QAAQ,IAAI,OAAO,KAAK,MAAM;GAEhC,IAAI,CAAC,OAAO,MAAM;IAChB,KAAK,OAAO,KAAK,EAAE;IACnB;GACF;GACA,eAAe,KAAK;EACtB,OAAO;GAGL,eAAe,CAAC;GAChB,KAAK,MAAM,SAAS,OAClB,QAAQ,IAAI,OAAO,YAAY;EAEnC;EAEA,KAAK,YAAY,KAAK;EACtB,KAAK,YAAY,WAAW,OAAO,IAAI;EACvC,KAAK,oBAAoB,OAAO,qBAAqB;EACrD,IAAI,KAAK,YAAY,GAAG;GACtB,KAAK,SAAS;GACd,KAAK,cAAc,aAAa;GAChC,KAAK,YAAY,QAAQ,OAAO,IAAI;EACtC;CACF;;;;;CAMA,SAAiB,OAAe,WAA4B;EAC1D,KAAK,cAAc;EACnB,IAAI,CAAC,KAAK,QAAQ;GAChB,IAAI,KAAK,QACP,MAAM,IAAI,iBAAiB,KAAK,gBAAgB,KAAK,IAAI,CAAC;GAE5D,OAAO;EACT;EACA,MAAM,oBAAoB,KAAK;EAC/B,IAAI,WAAW;EACf,IAAI,OAAO,sBAAsB,YAAY,cAAc,mBAAmB;GAC5E,IAAI,KAAK,QACP,MAAM,IAAI,WACR,KAAK,IAAI,GACT,6BAA6B,kBAAkB,gBAAgB,UAAU,EAC3E;GAEF,WAAW;EACb;EACA,IAAI,sBAAsB,QAAQ,cAAc,IAAI;GAClD,IAAI,KAAK,QAAQ;IACf,MAAM,YAAY,KAAK,MAAM,kBAAkB,KAAK,UAAW;IAC/D,MAAM,IAAI,WACR,KAAK,IAAI,GACT,2BAA2B,UAAU,YAAY,KAAK,eAAe,eACvE;GACF;GACA,WAAW;EACb;EACA,KAAK,OAAO,KAAK,KAAK;EACtB,OAAO;CACT;;;;;;CAOA,iBAAyB,OAAe,OAAe,OAAe,WAAyB;EAC7F,IAAI,KAAK,SAAS,OAAO,SAAS,GAChC,KAAK,WAAW;GAAE,QAAQ,KAAK;GAAa;GAAO;EAAM;EAE3D,KAAK,WAAW,KAAK,mBAAmB;CAC1C;;;;;CAMA,IAAY,cAAuB;EACjC,MAAM,OAAO,KAAK;EAClB,OAAO,KAAK,KAAK,SAAS,EAAE,CAAC,uBAAuB,QAAQ,KAAK,KAAK,UAAU,KAAK;CACvF;CAEA,OAAe,OAAqB;EAClC,KAAK,UAAU;EACf,IAAI,KAAK,UAAU,KAAK,aACtB,KAAK,gBAAgB,IAAI,iBAAiB,OAAO,KAAK,IAAI,CAAC;EAE7D,KAAK,KAAK,KAAK,KAAK;CACtB;;CAGA,aAAa,OAA0B,OAAqB;EAC1D,KAAK,YAAY;EAGjB,MAAM,UAAU,KAAK,KAAK,KAAK,KAAK,SAAS;EAC7C,IAAI,KAAK,UAAU,KAAK,eAAe,CAAC,QAAQ,oBAC9C,KAAK,gBAAgB,IAAI,WACvB,KAAK,IAAI,GACT,kEACF;EAEF,KAAK,oBAAoB,KAAK,KAAK;EACnC,KAAK,SAAS,GAAG,QAAQ,MAAM,QAAQ,SACrC,KAAK,OAAO,MAAM,MAAM;CAE5B;;;;;;;CAQA,IAAY,qBAA8B;EACxC,IAAI,KAAK,aACP,OAAO;EAET,IAAI,CAAC,KAAK,eAAe,KAAK,MAAM,qBAAqB,WAAW,GAClE,OAAO;EAET,OAAO,EAAE,KAAK,aAAa,KAAK,YAAa,KAAK,mBAAmB,KAAK,qBAAqB;CACjG;;;;;CAMA,cAAsB,OAAuC;EAC3D,IAAI,CAAC,KAAK,oBACR,OAAO;EAIT,OAAO,gBACL,KAAK,eAAe,CAAC,GACrB,OACA,KAAK,YACL,KAAK,iBACL,KAAK,MAAM,oBACb;CACF;CAEA,gBAAwB,SAA2B;EACjD,KAAK,YAAY;EACjB,KAAK,KAAK,KAAK,OAAO;EACtB,KAAK,aAAa,OAAO;CAC3B;;CAGA,aAAa,OAAe,OAAqB;EAC/C,MAAM,cAAc,MAAM;EAO1B,MAAM,aAAa,KAAK,WAAW,WAAW;EAC9C,IAAI,YAAY,QAAQ,CAAC,KAAK,WAAW,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG;GAC3D,KAAK,UAAU,YAAY,WAAW;GACtC,KAAK,iBAAiB,OAAO,GAAG,MAAM,MAAM,CAAC,GAAG,EAAE;GAClD;EACF;EAGA,KAAK,IAAI,OAAO,GAAG,OAAO,MAAM,QAAQ,QAAQ;GAC9C,MAAM,aAAa,cAAc,MAAM;GACvC,MAAM,SAAS,KAAK,WAAW,UAAU;GACzC,IAAI,CAAC,QAAQ;IAEX,IAAI,SAAS,KAAK,KAAK,iBAAiB;KACtC,KAAK,SAAS,OAAO,EAAE;KACvB;IACF;IACA,IAAI,KAAK,QACP,MAAM,KAAK,cAAc,UAAU;IAErC;GACF;GAEA,KAAK,UAAU,QAAQ,UAAU;GACjC,IAAI,SAAS,MAAM,SAAS,GAC1B;GAGF,MAAM,MAAM,iBAAiB,MAAM,MAAM,OAAO,CAAC,GAAG,KAAK,WAAW,mBAAmB;GAGvF,IAAI,OAAO,QAAS,OAAO,CAAC,KAAK,WAAW,cAAc,MAAM,OAAO,EAAE,GAAI;IAC3E,MAAM,WAAW,OAAO,IAAI,SAAS;IACrC,KAAK,iBAAiB,OAAO,UAAU,MAAM,MAAM,QAAQ,GAAG,GAAG;IACjE;GACF;EACF;CACF;;;;;CAMA,WAAW,OAAe,OAAwB;EAChD,MAAM,QAAQ,eAAe,OAAO,KAAK,WAAW,mBAAmB;EACvE,MAAM,aAAa,QAAQ,MAAM,MAAM,GAAG,MAAM,KAAK,IAAI;EACzD,MAAM,SAAS,KAAK,WAAW,UAAU;EACzC,IAAI,QAAQ;GACV,KAAK,UAAU,QAAQ,UAAU;GACjC,IAAI,OAAO;IACT,MAAM,aAAa,MAAM,QAAQ,MAAM,IAAI;IAC3C,KAAK,iBAAiB,OAAO,YAAY,MAAM,MAAM,UAAU,GAAG,MAAM,GAAG;GAC7E;GACA,OAAO;EACT;EAIA,IAAI,KAAK,WAAW,2BAClB,OAAO;EAET,IAAI,KAAK,iBAAiB;GACxB,KAAK,SAAS,OAAO,EAAE;GACvB,OAAO;EACT;EAGA,IAAI,KAAK,QACP,MAAM,KAAK,cAAc,UAAU;EAErC,OAAO;CACT;;;;;;;CAQA,WAAW,OAAe,WAAsC;EAC9D,IAAI,KAAK,iBAAiB;GACxB,KAAK,SAAS,OAAO,EAAE;GACvB;EACF;EAGA,IAAI,KAAK,UAAU,aAAa,KAAK,aAAa;GAChD,MAAM,UAAU,KAAK,KAAK,KAAK,KAAK,SAAS;GAC7C,IAAI,QAAQ,aAAa,UAAU,QAAQ,oBAAoB;IAC7D,MAAM,EAAE,SAAS,eAAe,UAAU,OAAO;IACjD,KAAK,gBAAgB,IAAI,WAAW,KAAK,IAAI,GAAG,SAAS,UAAU;GACrE;EACF;EACA,KAAK,cAAc;EACnB,KAAK,OAAO,KAAK;CACnB;;;;;CAMA,SAAiB;EAIf,MAAM,UAAU,KAAK,KAAK,KAAK,KAAK,SAAS;EAC7C,MAAM,aAAa,QAAQ,sBAAsB,CAAC,QAAQ,UAAU,KAAK,KAAK,WAAW;EACzF,MAAM,cAAc,KAAK,iBAAiB,KAAA,KAAa;EACvD,IAAI,CAAC,eAAe,KAAK,aACvB,MAAM,KAAK;EAEb,IAAI,CAAC,eAAe,KAAK,KAAK,SAAS,KAAK,gBAC1C,MAAM,IAAI,gBAAgB,KAAK,gBAAgB,KAAK,gBAAgB,KAAK,IAAI,CAAC;EAEhF,KAAK,UAAU;EACf,IAAI,CAAC,aACH,iBAAiB,KAAK,SAAS,KAAK,aAAa,KAAK,MAAM,SAAS,GAAG,KAAK,IAAI,CAAC;EAKpF,IAAI,CAAC,QAAQ,sBAAsB,KAAK,KAAK,UAAU,KAAK,gBAC1D,YAAY,KAAK,MAAM,QAAQ,QAAQ,IAAI,GAAG,KAAK,KAAK,MAAM;EAEhE,OAAO,KAAK,gBAAgB,QAAQ,UAAUC;CAChD;;CAGA,SAAS,MAAoC;EAC3C,IAAI,KAAK,QAAQ,IAAI,IAAI,GACvB;EAEF,MAAM,OAAO,QAAQ,KAAK,MAAM,QAAQ,IAAI,CAAC,EAAE,IAAI;EAInD,IAAI,KAAK,WAAW,KAAK,KAAK,EAAE,CAAC,YAC/B;EAEF,MAAM,SAAmB,CAAC;EAC1B,YAAY,QAAQ,IAAI;EACxB,OAAO,OAAO,SAAS,IAAI,SAAS,KAAA;CACtC;;CAGA,UAAkB,QAAyB;EACzC,MAAM,QAAQ,QAAQ,OAAO,IAAI;EACjC,MAAM,UAAU,KAAK;EACrB,IAAI,OAAO,OAAO,iBAAiB,UAC5B;QAAA,KAAK,aAAa,IAAI,UAAU,MAAM,CAAC,CAAC,EAAE,SAAS,MAAM,OAAO,cACnE,OAAO;EAAA;EAGX,IAAI,OAAO,aAAa,MAAM,SAAS,QAAQ,IAAI,IAAI,CAAC,GACtD,OAAO;EAET,OAAO,KAAK,YAAY,MAAM,SAAS,KAAK,aAAa,MAAM,SAAS,MAAM,SAAS,IAAI,CAAC,CAAC;CAC/F;;CAGA,gBAAwC;EACtC,MAAM,OAAO,IAAI,IAAI,KAAK,YAAY,IAAI,SAAS,CAAC;EACpD,MAAM,EAAE,OAAO,eAAe,KAAK,MAAM,KAAK;EAC9C,MAAM,SAAyB,CAAC;EAChC,KAAK,MAAM,EAAE,QAAQ,WAAW,CAAC,GAAG,OAAO,GAAG,UAAU,GAAG;GACzD,IAAI,KAAK,UAAU,MAAM,GACvB;GAGF,MAAM,WAAW,MAAM,QAAQ,SAAS,CAAC,KAAK,cAAc,IAAI,CAAC,EAAE,OAAO;GAC1E,IAAI,SAAS,WAAW,GACtB;GAEF,OAAO,KAAK;IAAE;IAAQ,OAAO,KAAK,MAAM,MAAM,QAAQ,QAAQ;IAAG,MAAM,KAAK,IAAI,UAAU,MAAM,CAAC;GAAE,CAAC;EACtG;EACA,OAAO;CACT;;CAGA,OAAoC;EAClC,MAAM,OAAO,KAAK,cAAc,KAAK,kBAAkB,KAAK,aAAa;EACzE,MAAM,UAAU,KAAK,KAAK,KAAK,KAAK,SAAS;EAE7C,MAAM,iBAAiB,KAAK,sBAAsB;EAClD,MAAM,iBAAiB,CAAC,kBAAkB,KAAK;EAC/C,OAAO;GACL,MAAM,KAAK;GACX,YAAY,KAAK;GACjB;GACA,aACE,CAAC,kBAAkB,KAAK,qBACpB,cAAc,KAAK,eAAe,CAAC,GAAG,KAAK,MAAM,oBAAoB,IACrE,CAAC;GACP,SAAS,iBAAiB,KAAK,cAAc,IAAI,CAAC;GAClD,OAAO,QAAQ;IACb,QAAQ;IACR,KAAK,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,UAAU;IAC9C,UAAU,KAAK,aAAa,KAAK;GACnC;GACA,KAAK,OAAO,KAAA,IAAY,MAAM,QAAQ,QAAQ,IAAI,GAAG,KAAK,KAAK,MAAM;EACvE;CACF;;CAGA,gBAAgB,OAA0B,OAA6B;EAErE,IAAI,KAAK,sBAAsB,IAC7B,OAAO,EAAE,MAAM,WAAW;EAE5B,MAAM,QAAQ,KAAK,KAAK;EACxB,MAAM,OAAO,KAAK,YAAY;EAC9B,MAAM,OAAO,KAAK,KAAK;EACvB,MAAM,SAAS,KAAK;EACpB,IAAI,KAAK,OAAO,OAAO,KAAK,GAC1B,OAAO,EAAE,MAAM,YAAY;EAE7B,IAAI,KAAK,KAAK,SAAS,OACrB,OAAO;GAAE,MAAM;GAAc,SAAS,KAAK,KAAK;EAAqB;EAEvE,IAAI,KAAK,YAAY,SAAS,MAAM;GAClC,MAAM,QAAQ,KAAK,WAAW,KAAK;GACnC,MAAM,WAAW,SAAS;IAAE,QAAQ,MAAM;IAAQ,OAAO,MAAM;GAAM;GACrE,OAAO;IAAE,MAAM;IAAW,SAAS,KAAK,YAAY,MAAM,IAAI;IAAG;GAAS;EAC5E;EACA,IAAI,KAAK,KAAK,SAAS,MACrB,OAAO,EAAE,MAAM,WAAW;EAE5B,IAAI,KAAK,aAAa,QACpB,OAAO;GAAE,MAAM;GAAS,QAAQ,KAAK;EAAY;EAEnD,OAAO,EAAE,MAAM,UAAU;CAC3B;;CAGA,WAAW,OAAyD;EAClE,OAAO,KAAK,UAAU,UAAU,QAAQ,KAAK,WAAW;CAC1D;;CAGA,IAAI,iBAA0B;EAC5B,OAAO,EAAE,KAAK,WAAW,+BAA+B,KAAK;CAC/D;;CAGA,KAAK,OAAgC;EACnC,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SACxC,IAAI,KAAK,OAAO,OAAO,KAAK,GAC1B;CAGN;;;;;CAMA,OAAe,OAA0B,OAAwB;EAC/D,MAAM,QAAQ,MAAM;EACpB,MAAM,iBAAiB,KAAK;EAG5B,IAAI,UAAU,QAAQ,gBAAgB;GACpC,KAAK,aAAa,OAAO,KAAK;GAC9B,OAAO;EACT;EAEA,MAAM,aAAa,KAAK,cAAc,KAAK;EAC3C,IAAI,YAAY,SAAS;GACvB,KAAK,gBAAgB,WAAW,OAAO;GACvC,OAAO;EACT;EAEA,IAAI,gBAAgB;GAClB,MAAM,4BAA4B,KAAK,WAAW;GAClD,MAAM,QAAQ,MAAM,WAAW,CAAC;GAChC,MAAM,eAAe,UAAU,MAAc,MAAM,WAAW,CAAC,MAAM;GACrE,IACE,CAAC,6BACD,MAAM,SAAS,MACd,UAAU,MAAM,UAAU,OAC3B,CAAC,cACD;IACA,KAAK,aAAa,OAAO,KAAK;IAC9B,OAAO;GACT;GACA,IAAI,6BAA8B,MAAM,SAAS,KAAK,cAChD;QAAA,KAAK,WAAW,OAAO,KAAK,GAC9B,OAAO;GAAA;EAGb;EAEA,KAAK,WAAW,OAAO,UAAU;EACjC,OAAO;CACT;AACF;;AAGA,SAAS,MAAM,MAAsB,OAAgC;CACnE,IAAI,QAAQ,KAAK,QACf,OAAO,KAAK;CAEd,MAAM,OAAO,KAAK,KAAK,SAAS;CAChC,OAAO,MAAM,aAAa,OAAO,KAAA;AACnC;;;;;;;AAQA,SAAgB,SAAS,MAAY,QAA2B,SAA4B;CAC1F,MAAM,IAAI,IAAI,QAAQ,MAAM,KAAK;CACjC,EAAE,KAAK,MAAM;CACb,MAAM,OAAO,EAAE,KAAK;CACpB,IAAI,WAAkC;CACtC,IAAI,YAAY,MAAM,KAAK,gBAAgB;EAEzC,MAAM,UAAU,UAAU,MAAM,QAAQ,OAAO;EAC/C,MAAM,QAAQ,QAAQ,SAAS,YAAY,QAAQ,WAAW;EAC9D,MAAM,MAAM,SAAS,QAAQ,MAAM,OAAO,IAAI,CAAC,CAAC;EAChD,IAAI,SAAS,KACX,WAAW;GACT,QAAQ,MAAM;GACd;GACA,QAAQ,QAAQ,MAAM,GAAG,MAAM,KAAK;GACpC,OAAO,QAAQ,MAAM,MAAM,KAAK;EAClC;CAEJ;CACA,OAAO;EAAE,GAAG;EAAM;CAAS;AAC7B;;;;;AAMA,SAAgB,UAAU,MAAY,QAA2B,OAA6B;CAC5F,MAAM,IAAI,IAAI,QAAQ,MAAM,KAAK;CACjC,EAAE,KAAK,MAAM;CACb,OAAO,EAAE,gBAAgB,CAAC,GAAG,QAAQ,KAAK,GAAG,OAAO,MAAM;AAC5D;;;;;;;;;;AAWA,SAAgB,MAAM,OAA0B,MAAyB;CACvE,MAAM,IAAI,IAAI,QAAQ,MAAM,IAAI;CAChC,EAAE,KAAK,KAAK;CACZ,MAAM,SAAS,EAAE,OAAO;CACxB,OAAO;EACL,MAAM,EAAE;EACR;EACA,MAAM,EAAE;EACR,mBAAmB,EAAE;EACrB,SAAS,EAAE;EACX,WAAW,SAAS,EAAE,SAAS,IAAI;CACrC;AACF;;ACh0BA,MAAa,SAA2B;CAAC;CAAQ;CAAO;CAAQ;CAAc;AAAS;AAEvF,SAAS,QAAQ,OAA+B;CAC9C,OAAQ,OAA6B,SAAS,KAAK;AACrD;AAEA,MAAM,aAAa,gBACjB,cAAc,YAAY,MAAM,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,IAAI;;AAGvD,MAAM,YAAY,UAA0B,MAAM,QAAQ,kBAAkB,GAAG;;AAG/E,SAAS,QAAQ,OAAuB;CACtC,OAAO,IAAI,MAAM,WAAW,KAAK,OAAO,EAAE;AAC5C;;AAGA,SAAS,UAAU,OAAuB;CACxC,OAAO,IAAI,MAAM,WAAW,MAAM,MAAM,CAAC,CAAC,WAAW,KAAK,KAAK,EAAE;AACnE;;AAGA,SAAS,QAAQ,OAAuB;CACtC,OAAO,IAAI,MAAM,WAAW,KAAK,IAAI,EAAE;AACzC;;;;;AAMA,SAAS,QAAQ,OAAuB;CACtC,IAAI,CAAC,MAAM,SAAS,GAAG,GACrB,OAAO,IAAI,MAAM;CAEnB,OAAO,IAAI,MAAM,WAAW,MAAM,MAAM,CAAC,CAAC,WAAW,MAAK,MAAK,EAAE;AACnE;;AAWA,eAAe,eAAe,SAAiB,UAA0C;CAIvF,MAAM,EAAE,gBAAiB,MAAM,OAAO;CAItC,MAAM,YAAa,WAAmD,SAAS,aAAa;CAC5F,MAAM,QAAQ,KAAK,IAAI,QAAQ,YAAY,GAAG,GAAG,YAAY,QAAQ,YAAY,IAAI,IAAI,EAAE;CAC3F,MAAM,MAAM,SAAS,IAAI,QAAQ,MAAM,GAAG,QAAQ,CAAC,IAAI;CACvD,MAAM,OAAO,SAAS,IAAI,QAAQ,MAAM,QAAQ,CAAC,IAAI;CAErD,MAAM,YAAY,SAAS,IAAI,QAAQ,SAAS;CAChD,MAAM,cAAc,aAAa;CACjC,IAAI;CACJ,IAAI;EACF,UAAU,aAAa,YAAY,IAAI,WAAW,MAAM,GAAG,IAAI,QAAQ,KAAK,EAAE,eAAe,KAAK,CAAC;CACrG,QAAQ;EACN,OAAO,CAAC;CACV;CACA,MAAM,aAA0B,CAAC;CACjC,KAAK,MAAM,SAAS,SAAuD;EACzE,IAAI,CAAC,MAAM,KAAK,WAAW,IAAI,GAC7B;EAEF,MAAM,QAAQ,MAAM,YAAY;EAChC,IAAI,eAAe,CAAC,OAClB;EAEF,WAAW,KAAK,EAAE,OAAO,GAAG,MAAM,MAAM,OAAO,QAAQ,YAAY,KAAK,CAAC;CAC3E;CACA,OAAO;AACT;;AAGA,eAAe,UAAU,KAAU,QAAkB,SAAuC;CAC1F,MAAM,aAA0B,CAAC;CAEjC,KAAK,MAAM,cAAc,IAAI,eAAe,CAAC,GAC3C,WAAW,KACT,OAAO,eAAe,WAClB,EAAE,OAAO,WAAW,IACpB;EAAE,OAAO,UAAU,WAAW,IAAI,CAAC,CAAC;EAAI,aAAa,WAAW;CAAY,CAClF;CAGF,KAAK,MAAM,aAAa,UAAU,IAAI,UAAU,GAAG;EACjD,IAAI,CAAC,UAAU,QACb;EAEF,MAAM,WAAW,MAAM,UAAU,OAAO,CAAC,GAAG,QAAQ,OAAO,CAAC;EAC5D,KAAK,MAAM,cAAc,UACvB,WAAW,KACT,OAAO,eAAe,WAClB,EAAE,OAAO,WAAW,IACpB;GAAE,OAAO,UAAU,WAAW,IAAI,CAAC,CAAC;GAAI,aAAa,WAAW;EAAY,CAClF;CAEJ;CAEA,IAAI,IAAI,UACN,WAAW,KAAK,GAAI,MAAM,eAAe,SAAS,IAAI,QAAQ,CAAE;CAGlE,OAAO;AACT;;AAGA,SAAS,iBAAiB,MAAiB,KAAwB;CACjE,MAAM,oBAAoB,KAAK,WAAW;CAE1C,MAAM,kBACJ,KAAK,kBAAkB,CAAC,sBAAsB,IAAI,QAAQ,WAAW,GAAG,KAAK,IAAI,QAAQ,WAAW,GAAG;CAIzG,OAAO;EACL,YAAY,EAAE,IAAI,eAAe;EACjC,aAAa,CAAC,IAAI,eAAe,mBAAmB;CACtD;AACF;;;;;;AAkBA,eAAsB,gBAAgB,KAA8C;CAClF,MAAM,OAAO,SAAS,IAAI,MAAM,IAAI,QAAQ,IAAI,OAAO;CACvD,MAAM,SAAS,CAAC,GAAG,IAAI,MAAM;CAG7B,IAAI,KAAK,UAAU;EACjB,MAAM,EAAE,QAAQ,KAAK,UAAU,KAAK;EAEpC,QAAO,MADc,UAAU,KAAK,QAAQ,KAAK,EAAA,CACnC,KAAK,eAAe;GAChC,OAAO,SAAS,UAAU;GAC1B,aAAa,UAAU;EACzB,EAAE;CACJ;CAGA,IAAI,KAAK,OAAO,UACd,OAAO,KAAK,MAAM,MAAM,UAAU,KAAK,MAAM,KAAK,QAAQ,IAAI,OAAO,IAAI,CAAC;CAG5E,MAAM,aAA0B,CAAC;CACjC,MAAM,EAAE,YAAY,gBAAgB,iBAAiB,MAAM,GAAG;CAC9D,IAAI,YAAY;EAGd,MAAM,MAAM,KAAK,QAAQ,KAAK,MAAM,MAAM,KAAK;EAC/C,IAAI,KACF,WAAW,KAAK,GAAI,MAAM,UAAU,KAAK,QAAQ,IAAI,OAAO,CAAE;EAEhE,KAAK,MAAM,OAAO,mBAAmB,KAAK,WAAW,GAAG;GACtD,MAAM,cAAc,UAAU,IAAI,WAAW;GAC7C,KAAK,MAAM,SAAS,UAAU,IAAI,IAAI,GACpC,WAAW,KAAK;IAAE,OAAO;IAAO;GAAY,CAAC;EAEjD;CACF;CACA,IAAI,aACF,WAAW,KAAK,GAAG,iBAAiB,IAAI,CAAC;CAE3C,OAAO;AACT;;AAGA,SAAS,iBAAiB,MAA8B;CACtD,MAAM,WAAwB,CAAC;CAC/B,MAAM,WAAwB,CAAC;CAE/B,KAAK,MAAM,EAAE,QAAQ,OAAO,UAAU,KAAK,SAAS;EAClD,IAAI,OAAO,QACT;EAKF,IAAI,QAAQ,CAAC,OAAO,cAClB;EAGF,IAAI,cAAc,UAAU,OAAO,WAAW;EAC9C,IAAI,OAAO,WAAW;GACpB,MAAM,QAAQ,OAAO,UAAU,KAAK,IAAI;GACxC,cAAc,cAAc,GAAG,YAAY,aAAa,MAAM,KAAK,YAAY;EACjF;EACA,IAAI,OAAO,YACT,cAAc,cAAc,GAAG,YAAY,eAAe;EAO5D,MAAM,SAAS,OAAO,aAAa,WAAW;EAC9C,KAAK,MAAM,EAAE,MAAM,UAAU,OAAO;GAClC,IAAI,SAAS,IACX;GAEF,OAAO,KAAK;IAAE,OAAO,QAAQ,QAAQ;IAAK;GAAY,CAAC;EACzD;CACF;CAEA,OAAO,CAAC,GAAG,UAAU,GAAG,QAAQ;AAClC;;;;;;AAOA,SAAS,kBAAkB,MAAY,OAAsB;CAC3D,MAAM,KAAK,SAAS,KAAK,IAAI;CAC7B,MAAM,OAAO,KAAK;CAClB,IAAI,UAAU,QACZ,OAAO;EACL,IAAI,GAAG;EACP;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,gBAAgB,GAAG,YAAY,QAAQ,IAAI;CAC7C,CAAC,CAAC,KAAK,IAAI;CAEb,IAAI,UAAU,OACZ,OAAO;EACL,YAAY;EACZ,IAAI,GAAG;EACP;EACA;EACA;EACA;EACA;EACA;EACA;EACA,yBAAyB,QAAQ,IAAI,EAAE;EACvC;EACA,IAAI,GAAG;CACT,CAAC,CAAC,KAAK,IAAI;CAEb,IAAI,UAAU,cAAc;EAM1B,MAAM,YAAY;EAClB,OAAO;GACL,mDAAmD,QAAQ,IAAI,EAAE;GACjE;GACA;GACA;GACA,2BAA2B,UAAU;GACrC;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA,wBAAwB,UAAU;GAClC;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EACF,CAAC,CAAC,KAAK,IAAI;CACb;CACA,IAAI,UAAU,WAAW;EAOvB,MAAM,WAAW,MAAM,GAAG;EAC1B,MAAM,QAAQ;GAAC;GAAI;GAAQ;GAAQ;EAAM,CAAC,CAAC,KAAK,cAAc,QAAQ,OAAO,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG;EACjG,OAAO;GACL,SAAS,GAAG;GACZ;GACA;GACA;GACA;GACA;GACA;GACA,2CAA2C,MAAM;GACjD,kBAAkB,SAAS,gBAAgB,SAAS;GACpD;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EACF,CAAC,CAAC,KAAK,IAAI;CACb;CAEA,OAAO;EACL,cAAc,GAAG;EACjB;EACA;EACA;EACA;EACA;EACA;EACA,eAAe,UAAU,IAAI,EAAE,aAAa,GAAG;CACjD,CAAC,CAAC,KAAK,IAAI;AACb;;AAKA,SAAgB,cAAc,MAAY,OAAsB;CAC9D,OAAO,kBAAkB,MAAM,KAAK;AACtC;;AAkDA,MAAa,aAAyB;CACpC,MAAM;CACN,aAAa;CACb,MAAM;EACJ,MAAM;EACN,YAAY;EACZ,aAAa;EACb,aAAa,WAAW,OAAO,KAAK,IAAI;CAC1C;CACA,aAAa,CAAC;EAjDd,MAAM;EACN,aAAa;EACb,QAAQ;EACR,SAAS,CACP;GACE,MAAM;GACN,aAAa;EACf,GACA;GACE,MAAM;GACN,aAAa;EACf,CACF;EACA,MAAM;GAAE,MAAM;GAAU,YAAY;GAAM,YAAY;EAAK;EAC3D,MAAM,OAAO,EAAE,MAAM,MAAM,WAAW;GACpC,MAAM,OAAO,KAAK;GAGlB,MAAM,YAAY,QAAQ,IAAI,cAAc;GAC5C,MAAM,UAAU,aAAa,KAAK,WAAW,IAAI,KAAK,KAAK,KAAK,SAAS;GAQzE,MAAM,SAAQ,MANW,gBAAgB;IACvC;IACA,QAHa,YAAY,OAAO,KAAK,MAAM,GAAG,EAAE;IAIhD;IACA,aAAa,QAAQ,IAAI,gBAAgB;GAC3C,CAAC,EAAA,CACwB,KAAK,cAC5B,UAAU,cAAc,GAAG,UAAU,MAAM,IAAI,UAAU,gBAAgB,UAAU,KACrF;GACA,IAAI,MAAM,SAAS,GACjB,MAAM,MAAM,KAAK,IAAI,CAAC;GAExB,OAAO;EACT;CAec,CAAe;CAC7B,OAAO,EAAE,MAAM,MAAM,CAAC,UAAU;EAC9B,MAAM,OAAO,KAAK;EAClB,IAAI,UAAU,KAAA,GAAW;GACvB,MAAM,qBAAqB,OAAO,KAAK,IAAI,GAAG;GAC9C,OAAO;EACT;EAEA,IAAI,CAAC,QAAQ,KAAK,GAAG;GACnB,gBAAgB,MAAM,sBAAsB,MAAM,IAAI;IAAE,OAAO;IAAO,SAAS;GAAO,CAAC;GACvF,OAAO;EACT;EAEA,MAAM,cAAc,MAAM,KAAK,CAAC;EAChC,OAAO;CACT;AACF;;;;;;;;;;ACncA,eAAsB,IAAI,MAAY,OAA0B,YAAY,GAAoB;CAC9F,IAAI;CAEJ,IAAI;EACF,SAAS,MAAM,MAAM,IAAI;CAC3B,SAAS,OAAgB;EACvB,IAAI,iBAAiB,YACnB,gBAAgB,MAAM,QAAQ,MAAM,MAAM,SAAS,MAAM,UAAU;OAEnE,WAAW,GAAG,OAAO;EAEvB,OAAO;CACT;CAEA,MAAM,EAAE,QAAQ,YAAY;CAC5B,MAAM,aAAyB;EAC7B,OAAO,gBAAgB,QAAQ,aAAa,QAAQ,OAAO,MAAM,WAAW;EAC5E,MAAM,OAAO;EACb,MAAM,OAAO;EACb,mBAAmB,OAAO;EAC1B,SAAS;GACP;GACA,MAAM,SAAS,QAAQ,IAAI,IAAI;GAC/B,MAAM,UAAU,QAAQ,IAAI,IAAI,KAAK,OAAO,SAAS,IAAI,EAAA,GAAK;GAC9D,MAAM,SAAS,QAAQ,IAAI,IAAI,KAAK,OAAO,SAAS,IAAI;GACxD,QAAQ,SAAS,QAAQ,IAAI,IAAI,CAAC,EAAE,UAAU;EAChD;CACF;CAEA,IAAI;CACJ,IAAI;EACF,MAAM,eAAe,OAAO,UAAU;EACtC,WAAW,OAAO,iBAAiB,WAAW,MAAM,eAAe;CACrE,SAAS,OAAO;EACd,WAAW,eAAe,KAAK,CAAC;EAChC,OAAO;CACT;CAEA,OAAO,KAAK,IAAI,KAAK,IAAI,YAAY,GAAG,CAAC,GAAG,GAAG;AACjD;;;;;;AAOA,SAAS,eAAe,OAAwB;CAC9C,IAAI,iBAAiB,OACnB,OAAO,MAAM;CAEf,IAAI,OAAO,UAAU,YAAY,UAAU,MACzC,IAAI;EACF,OAAO,KAAK,UAAU,KAAK;CAC7B,QAAQ,CAER;CAEF,OAAO,OAAO,KAAK;AACrB;AAEA,SAAS,cAAiC;CAIxC,OAAOC,WAAa,SAAS,MAAM,MAAM,CAAC,KAAK,CAAC;AAClD;;ACxDA,IAAA,cAAe;CACb;CACA;CACA;CACA;CACA;AACF"}