vlt 0.0.0-3 → 0.0.0-4

package/chunk-JMGSFQ32.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../../src/dep-id/src/index.ts", "../../../src/workspaces/src/index.ts", "../../../node_modules/.pnpm/graph-run@1.0.4/node_modules/graph-run/src/index.ts", "../../../node_modules/.pnpm/walk-up-path@4.0.0/node_modules/walk-up-path/src/index.ts"],
-  "sourcesContent": ["import { error } from '@vltpkg/error-cause'\nimport { Spec } from '@vltpkg/spec'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport type { Manifest } from '@vltpkg/types'\n\nexport const delimiter: Delimiter = '\u00B7'\nexport type Delimiter = '\u00B7'\n\n/**\n * Dependency IDs are a URI-encoded set of strings, separated\n * by the {@link Delimiter} character (`'\u00B7'`).\n *\n * The first entry is always the specifier type. The rest depend on the\n * type. `git`, `registry`, and `workspace` entries have 3 fields, the rest\n * have 2.\n *\n * - `registry`: `'registry\u00B7<registry>\u00B7name@specifier'`\n *   The `<registry>` portion can be a known named registry name, or a\n *   url to a registry. If empty, it is the default registry. Examples:\n *   - `\u00B7\u00B7some-package@2.0.1`\n *   - `\u00B7npm\u00B7whatever@1.2.3`\n *   - `\u00B7http%3A%2F%2Fvlt.sh%2F\u00B7x@1.2.3`\n * - `git`: `'git\u00B7<git remote>\u00B7<git selector>'`. For example:\n *   - `git\u00B7github:user/project\u00B7branchname`\n *   - `git\u00B7git%2Bssh%3A%2F%2Fuser%40host%3Aproject.git\u00B7semver:1.x`\n * - `workspace`: `'workspace\u00B7<path>'`. For example:\n *   - `workspace\u00B7src/mything`\n * - `remote`: `'remote\u00B7<url>'`\n * - `file`: `'file\u00B7<path>'`\n *\n * Lastly, the final portion can contain arbitrary string data, and is\n * used to store peer dep resolutions to maintain the peerDep contract.\n */\nexport type DepID =\n  | `${'' | 'git'}${Delimiter}${string}${Delimiter}${string}${Delimiter}${string}`\n  | `${'' | 'git'}${Delimiter}${string}${Delimiter}${string}`\n  | `${'file' | 'remote' | 'workspace'}${Delimiter}${string}${Delimiter}${string}`\n  | `${'file' | 'remote' | 'workspace'}${Delimiter}${string}`\n\n/**\n * A {@link DepID}, split apart and URI-decoded\n */\nexport type DepIDTuple =\n  | [\n      type: 'git',\n      gitRemote: string,\n      gitSelector: string,\n      extra?: string,\n    ]\n  | [\n      type: 'registry',\n      registry: string,\n      registrySpec: string,\n      extra?: string,\n    ]\n  | [type: 'file', path: string, extra?: string]\n  | [type: 'remote', url: string, extra?: string]\n  | [type: 'workspace', workspace: string, extra?: string]\n\nconst depIDRegExp = new RegExp(\n  `^((git)?${delimiter}[^${delimiter}]*${delimiter}[^${delimiter}]*(${\n    delimiter\n  }[^${delimiter}]*)?$` +\n    `|` +\n    `^(file|remote|workspace)${delimiter}[^${\n      delimiter\n    }]*)(${delimiter}[^${delimiter}]*)?$`,\n)\n\nexport const isDepID = (str: unknown): str is DepID =>\n  typeof str === 'string' && depIDRegExp.test(str)\n\nexport const asDepID = (str: string): DepID => {\n  if (!isDepID(str)) {\n    throw error('Expected dep id', {\n      found: str,\n    })\n  }\n  return str\n}\n\n/**\n * turn a {@link DepIDTuple} into a {@link DepID}\n */\nexport const joinDepIDTuple = (list: DepIDTuple): DepID => {\n  const [type, first, second, extra] = list\n  const f = encode(first)\n  switch (type) {\n    case 'registry':\n      return `${delimiter}${f}${delimiter}${encode(second)}${extra ? `${delimiter}${encode(extra)}` : ''}`\n    case 'git':\n      return `${type}${delimiter}${f}${delimiter}${encode(second)}${extra ? `${delimiter}${encode(extra)}` : ''}`\n    default:\n      return `${type}${delimiter}${f}${second ? `${delimiter}${encode(second)}` : ''}`\n  }\n}\n\n// allow @, but otherwise, escape everything urls do\nconst encode = (s: string): string =>\n  encodeURIComponent(s)\n    .replaceAll('%40', '@')\n    .replaceAll('%2f', '\u00A7')\n    .replaceAll('%2F', '\u00A7')\n\n/**\n * turn a {@link DepID} into a {@link DepIDTuple}\n */\nexport const splitDepID = (id: string): DepIDTuple => {\n  const [type, first = '', second, extra] = id\n    .replaceAll('\u00A7', '/')\n    .split(delimiter, 4)\n  const f = decodeURIComponent(first)\n  switch (type) {\n    case 'git':\n    case '': {\n      if (second === undefined) {\n        throw error(`invalid ${type} id`, { found: id })\n      }\n      const t: DepIDTuple = [\n        type || 'registry',\n        f,\n        decodeURIComponent(second),\n      ]\n      if (extra) t.push(decodeURIComponent(extra))\n      return t\n    }\n    case 'file':\n    case 'remote':\n    case 'workspace': {\n      const t: DepIDTuple = [type, f]\n      if (second) t.push(decodeURIComponent(second))\n      return t\n    }\n    default: {\n      throw error('invalid DepID type', {\n        found: type,\n        validOptions: ['git', 'file', 'workspace', 'remote', ''],\n      })\n    }\n  }\n}\n\n/**\n * Turn a {@link DepID} into a {@link Spec} object\n */\nexport const hydrate = (\n  id: DepID,\n  name?: string,\n  options: SpecOptions = {},\n): Spec => hydrateTuple(splitDepID(id), name, options)\n\n/**\n * Turn a {@link DepIDTuple} into a {@link Spec} object\n */\nexport const hydrateTuple = (\n  tuple: DepIDTuple,\n  name?: string,\n  options: SpecOptions = {},\n) => {\n  const [type, first, second] = tuple\n  switch (type) {\n    case 'remote': {\n      if (!first)\n        throw error('no remoteURL found on remote id', {\n          found: tuple,\n        })\n      return Spec.parse(name ?? '(unknown)', first)\n    }\n    case 'file': {\n      if (!first) {\n        throw error('no file path found on remote id', {\n          found: tuple,\n        })\n      }\n      return Spec.parse(name ?? '(unknown)', `file:${first}`, options)\n    }\n    case 'registry': {\n      if (typeof first !== 'string') {\n        throw error('no registry url or name in registry ID', {\n          found: tuple,\n        })\n      }\n      if (!second) {\n        throw error('no name/specifier in registry ID', {\n          found: tuple,\n        })\n      }\n      if (!first) {\n        // just a normal name@version on the default registry\n        const s = Spec.parse(second)\n        if (name && s.name !== name) {\n          return Spec.parse(`${name}@npm:${second}`)\n        } else {\n          return s\n        }\n      }\n      if (!/^https?:\\/\\//.test(first)) {\n        const reg = options.registries?.[first]\n        if (first !== 'npm' && !reg) {\n          throw error('named registry not found in options', {\n            name: first,\n            found: tuple,\n          })\n        }\n        return Spec.parse(\n          name ?? '(unknown)',\n          `${first}:${second}`,\n          options,\n        )\n      }\n      const s = Spec.parse(\n        name ?? '(unknown)',\n        `registry:${first}#${second}`,\n        options,\n      )\n      return name && s.final.name !== name ?\n          Spec.parse(s.final.name + '@' + s.bareSpec)\n        : s\n    }\n    case 'git': {\n      if (!first) {\n        throw error('no git remote in git ID', {\n          found: tuple,\n        })\n      }\n      return Spec.parse(\n        name ?? '(unknown)',\n        first + '#' + second,\n        options,\n      )\n    }\n    case 'workspace': {\n      if (!first) {\n        throw error('no name/path on workspace id', { found: tuple })\n      }\n      return name && name !== first ?\n          Spec.parse(name, `workspace:${first}@*`, options)\n        : Spec.parse(first, `workspace:*`, options)\n    }\n  }\n}\n\n// Strip out the default registry, there's no need to store that\nconst omitDefReg = (s?: string): string =>\n  (\n    !s ||\n    s === 'https://registry.npmjs.org' ||\n    s === 'https://registry.npmjs.org/'\n  ) ?\n    ''\n  : s\n\n/**\n * Get the {@link DepIDTuple} for a given {@link Spec} and {@link Manifest}.\n * The Manifest is used to get the name and version, if possible. If not found\n * in the manifest, registry ID types will use the name or bareSpec from the\n * specifier, so at least there's something to use later.\n */\nexport const getTuple = (spec: Spec, mani: Manifest): DepIDTuple => {\n  const f = spec.final\n  switch (f.type) {\n    case 'registry': {\n      // try to shorten to a known name if we can.\n      const reg = omitDefReg(f.registry)\n      if (!f.namedRegistry && reg) {\n        for (const [alias, host] of Object.entries(\n          spec.options.registries,\n        )) {\n          if (reg === host) {\n            f.namedRegistry = alias\n            break\n          }\n        }\n      }\n      return [\n        f.type,\n        f.namedRegistry ?? reg,\n        `${mani.name ?? spec.name}@${mani.version ?? spec.bareSpec}`,\n      ]\n    }\n    case 'git': {\n      const {\n        namedGitHost,\n        namedGitHostPath,\n        gitRemote,\n        gitSelector = '',\n      } = f\n      if (!gitRemote)\n        throw error('no host on git specifier', { spec })\n      if (namedGitHost) {\n        if (!namedGitHostPath) {\n          throw error('named git host without path portion', {\n            spec,\n          })\n        }\n        return [\n          f.type,\n          `${namedGitHost}:${namedGitHostPath}`,\n          gitSelector,\n        ]\n      } else {\n        return [f.type, gitRemote, gitSelector]\n      }\n    }\n    case 'remote': {\n      const { remoteURL } = f\n      if (!remoteURL)\n        throw error('no URL on remote specifier', { spec })\n      return [f.type, remoteURL]\n    }\n    case 'file':\n    case 'workspace':\n      throw error('Path-based dep ids are not supported', { spec })\n  }\n}\n\n/**\n * Get the {@link DepID} for a given {@link Spec} and {@link Manifest}. The\n * Manifest is used to get the name and version, if possible. If not found in\n * the manifest, registry ID types will use the name or bareSpec from the\n * specifier, so at least there's something to use later.\n */\nexport const getId = (spec: Spec, mani: Manifest): DepID =>\n  joinDepIDTuple(getTuple(spec, mani))\n", "import { joinDepIDTuple } from '@vltpkg/dep-id'\nimport type { DepID } from '@vltpkg/dep-id'\nimport { error } from '@vltpkg/error-cause'\nimport { PackageJson } from '@vltpkg/package-json'\nimport type { Manifest } from '@vltpkg/types'\nimport { readFileSync, statSync } from 'fs'\nimport { globSync } from 'glob'\nimport type { GlobOptionsWithFileTypesFalse } from 'glob'\nimport { graphRun, graphRunSync } from 'graph-run'\nimport type { DepResults } from 'graph-run'\nimport { basename, resolve, posix } from 'path'\nimport { PathScurry } from 'path-scurry'\nimport type { Path } from 'path-scurry'\nimport { parse } from 'polite-json'\nimport { minimatch } from 'minimatch'\n\nexport type WorkspacesLoadedConfig = {\n  workspace?: string[]\n  'workspace-group'?: string[]\n}\n\n/**\n * The object passed to the constructor or {@link Monorepo#load} to limit which\n * {@link Workspace Workspaces} get loaded.\n */\nexport type LoadQuery = {\n  /**\n   * A glob pattern string, or an array of them. Only workspaces found\n   * in paths matched will be loaded.\n   */\n  paths?: string[] | string\n  /**\n   * A string, or an array of strings. If set, only workspaces in the\n   * specified groups named will be included, if set.\n   */\n  groups?: string[] | string\n}\n\n/**\n * Canonical form of the {@link WorkspaceConfig}, used\n * internally for consistency.\n */\nexport type WorkspaceConfigObject = Record<string, string[]>\n\n/**\n * Allowed datatype in the `vlt-workspaces.json` file.\n */\nexport type WorkspaceConfig =\n  | string[]\n  | WorkspaceConfigObject\n  | string\n\n/**\n * Turn a {@link WorkspaceConfig} into a\n * {@link WorkspaceConfigObject}, or throw if it's not valid.\n */\nexport const asWSConfig = (\n  conf: unknown,\n  path?: string,\n): WorkspaceConfigObject => {\n  assertWSConfig(conf, path)\n  return (\n    typeof conf === 'string' ? { packages: [conf] }\n    : Array.isArray(conf) ? { packages: conf }\n    : conf\n  )\n}\n\n/**\n * Throw if the provided value is not a valid {@link WorkspaceConfig}\n */\nexport const assertWSConfig: (\n  conf: unknown,\n  path?: string,\n) => asserts conf is WorkspaceConfig = (\n  conf: unknown,\n  path?: string,\n) => {\n  if (typeof conf === 'string') return conf\n\n  if (Array.isArray(conf)) {\n    for (const c of conf) {\n      if (typeof c !== 'string') {\n        throw error('Invalid workspace definition', {\n          path,\n          found: c as unknown,\n          wanted: 'string',\n        })\n      }\n    }\n    return\n  }\n\n  if (conf && typeof conf === 'object') {\n    for (const [group, value] of Object.entries(conf)) {\n      if (typeof value === 'string') continue\n      if (Array.isArray(value)) {\n        for (const c of value) {\n          if (typeof c !== 'string') {\n            throw error('Invalid workspace definition', {\n              path,\n              name: group,\n              found: c as unknown,\n              wanted: 'string',\n            })\n          }\n        }\n        continue\n      }\n      throw error('Invalid workspace definition', {\n        path,\n        name: group,\n        found: value as unknown,\n        wanted: 'string | string[]',\n      })\n    }\n    return\n  }\n\n  throw error('Invalid workspace definition', {\n    path,\n    found: conf,\n    wanted:\n      'string | string[] | { [group: string]: string | string[] }',\n  })\n}\n\nexport type MonorepoOptions = {\n  /**\n   * A {@link PackageJson} object, for sharing manifest caches\n   */\n  packageJson?: PackageJson\n  /**\n   * A {@link PathScurry} object, for use in globs\n   */\n  scurry?: PathScurry\n  /** Parsed normalized contents of a `vlt-workspaces.json` file */\n  config?: WorkspaceConfigObject\n  /**\n   * If set, then {@link Monorepo#load} will be called immediately with\n   * this argument.\n   */\n  load?: LoadQuery\n}\n\n/**\n * Class representing a Monorepo containing multiple workspaces.\n *\n * Does not automatically look up the root, but that can be provided by\n * running `Config.load()`, since it stops seeking the route when a\n * `vlt-workspaces.json` file is encountered.\n */\nexport class Monorepo {\n  /** The project root where vlt-workspaces.json is found */\n  projectRoot: string\n  /** Scurry object to cache all filesystem calls (mostly globs) */\n  scurry: PathScurry\n\n  // maps both name and path to the workspace objects\n  #workspaces = new Map<string, Workspace>()\n  #groups = new Map<string, Set<Workspace>>()\n  #config?: WorkspaceConfigObject\n  packageJson: PackageJson\n\n  /**\n   * Number of {@link Workspace} objects loaded in this Monorepo\n   */\n  get size(): number {\n    return [...this.values()].length\n  }\n\n  constructor(projectRoot: string, options: MonorepoOptions = {}) {\n    this.projectRoot = resolve(projectRoot)\n    this.scurry = options.scurry ?? new PathScurry(projectRoot)\n    this.packageJson = options.packageJson ?? new PackageJson()\n    this.#config = options.config\n    if (options.load) this.load(options.load)\n  }\n\n  /**\n   * Load the workspace definitions from vlt-workspaces.json,\n   * canonicalizing the result into the effective `{[group:string]:string[]}`\n   * form.\n   *\n   * Eg:\n   * - `\"src/*\"` => `{packages:[\"src/*\"]}`\n   * - `{\"apps\": \"src/*\"}` => `{apps: [\"src/*\"]}`\n   */\n  get config(): WorkspaceConfigObject {\n    if (this.#config) return this.#config\n    const file = resolve(this.projectRoot, 'vlt-workspaces.json')\n    let confData: string\n    try {\n      confData = readFileSync(file, 'utf8')\n    } catch (er) {\n      throw error('Not in a monorepo, no vlt-workspaces.json found', {\n        path: this.projectRoot,\n        cause: er,\n      })\n    }\n    let parsed: unknown\n    try {\n      parsed = parse(confData)\n    } catch (er) {\n      throw error('Invalid vlt-workspaces.json file', {\n        path: this.projectRoot,\n        cause: er,\n      })\n    }\n    this.#config = asWSConfig(parsed, file)\n    return this.#config\n  }\n\n  /**\n   * Iterating the Monorepo object yields the workspace objects, in as close to\n   * topological dependency order as possible.\n   */\n  *[Symbol.iterator](): Generator<Workspace, void, void> {\n    const [ws] = [...this.values()]\n    if (!ws) return\n    // leverage the fact that graphRun returns results in\n    // as close to topological order as possible.\n    for (const workspace of this.runSync(() => {}).keys()) {\n      yield workspace\n    }\n  }\n\n  /**\n   * Iterating the Monorepo object yields the workspace objects, in as close to\n   * topological dependency order as possible.\n   */\n  async *[Symbol.asyncIterator](): AsyncGenerator<\n    Workspace,\n    void,\n    void\n  > {\n    const [ws] = [...this.values()]\n    if (!ws) return\n    for (const workspace of (await this.run(() => {})).keys()) {\n      yield workspace\n    }\n  }\n\n  /**\n   * By default, loads all workspaces reachable in the Monorepo.\n   *\n   * If provided with one (`string`)or more (`string[]`) group names in\n   * the {@link LoadQuery#groups} field, then only Workspaces in the named\n   * group(s) will be considered. Note that group names are unique string\n   * matches, not globs.\n   *\n   * If provided with a set of arbitrary path arguments, then only paths\n   * patching the provided pattern(s) will be included.\n   *\n   * These two options intersect, so\n   * `load({groups:'foo', paths:'./foo/[xy]*'})` will only load the workspaces\n   * in the group `foo` that match the paths glob.\n   */\n  load(query: LoadQuery = {}): this {\n    const paths = new Set(\n      typeof query.paths === 'string' ?\n        [query.paths]\n      : (query.paths ?? []),\n    )\n    const groups = new Set(\n      typeof query.groups === 'string' ?\n        [query.groups]\n      : (query.groups ?? []),\n    )\n\n    const groupsExpanded: Record<string, Set<string>> = {}\n    for (const [group, pattern] of Object.entries(this.config)) {\n      if (groups.size && !groups.has(group)) continue\n      groupsExpanded[group] = this.#glob(pattern)\n    }\n    const filter = paths.size ? this.#glob([...paths]) : paths\n\n    // if we specified paths, but none matched, nothing to do\n    if (paths.size && !filter.size) return this\n\n    for (const [group, matches] of Object.entries(groupsExpanded)) {\n      for (const path of matches) {\n        if (filter.size && !filter.has(path)) continue\n        this.#loadWS(path, group)\n      }\n    }\n\n    return this\n  }\n\n  // Either load a workspace from disk, or from our internal set,\n  // and assign it to the named group\n  #loadWS(path: string, group?: string): Workspace {\n    const fullpath = resolve(this.projectRoot, path)\n    const loaded = this.#workspaces.get(fullpath)\n    if (loaded) return loaded\n    const fromCache = workspaceCache.get(fullpath)\n    const manifest =\n      fromCache?.manifest ?? this.packageJson.read(fullpath)\n    const ws = fromCache ?? new Workspace(path, manifest, fullpath)\n    if (group) ws.groups.push(group)\n    this.#workspaces.set(ws.fullpath, ws)\n    this.#workspaces.set(ws.path, ws)\n    this.#workspaces.set(ws.name, ws)\n    for (const name of ws.groups) {\n      const group = this.#groups.get(name) ?? new Set()\n      group.add(ws)\n      this.#groups.set(name, group)\n    }\n    return ws\n  }\n\n  // can't be cached, because it's dependent on the matches set\n  // but still worthwhile to have it defined in one place\n  #globOptions(matches: Set<string>): GlobOptionsWithFileTypesFalse {\n    // if the entry or any of its parent dirs are already matched,\n    // then we should not explore further down that directory tree.\n    // if we hit the projectRoot then stop searching.\n    const inMatches = (p?: Path): boolean => {\n      return (\n        !!p?.relativePosix() &&\n        (matches.has(p.relativePosix()) || inMatches(p.parent))\n      )\n    }\n\n    return {\n      root: this.projectRoot,\n      cwd: this.projectRoot,\n      posix: true,\n      scurry: this.scurry,\n      withFileTypes: false,\n      ignore: {\n        childrenIgnored: p =>\n          basename(p.relativePosix()) === 'node_modules' ||\n          inMatches(p),\n        // ignore if fails to load package.json\n        ignored: p => {\n          p.lstatSync()\n          const rel = p.relativePosix()\n          if (!rel) return true\n          const maybeDelete: string[] = []\n          for (const m of matches) {\n            if (rel.startsWith(m + '/')) return true\n            if (m.startsWith(rel + '/')) {\n              maybeDelete.push(m)\n            }\n          }\n          if (!p.isDirectory()) return true\n          const pj = p.resolve('package.json').lstatSync()\n          if (!pj?.isFile()) return true\n          try {\n            this.packageJson.read(p.fullpath())\n          } catch {\n            return true\n          }\n          for (const m of maybeDelete) {\n            matches.delete(m)\n          }\n          matches.add(rel)\n          return false\n        },\n      },\n    }\n  }\n\n  #glob(pattern: string[] | string) {\n    const matches = new Set<string>()\n    globSync(pattern, this.#globOptions(matches))\n    return matches\n  }\n\n  /**\n   * Return the array of workspace dependencies that are found in\n   * the loaded set, for use in calculating dependency graph order for\n   * build operations.\n   *\n   * This does *not* get the full set of dependencies, or expand any\n   * `workspace:` dependencies that are not loaded.\n   *\n   * Call with the `forceLoad` param set to `true` to attempt a full\n   * load if any deps are not currently loaded.\n   */\n  getDeps(ws: Workspace, forceLoad = false): Workspace[] {\n    // load manifest and find workspace: deps\n    // filter by those loaded\n    const { manifest } = ws\n    const depWorkspaces: Workspace[] = []\n    let didForceLoad = false\n    for (const depType of [\n      'dependencies',\n      'devDependencies',\n      'optionalDependencies',\n      'peerDependencies',\n    ] as const) {\n      const deps = manifest[depType]\n      if (!deps) continue\n      for (const [dep, spec] of Object.entries(deps)) {\n        if (spec.startsWith('workspace:')) {\n          let depWS = this.#workspaces.get(dep)\n          if (!depWS) {\n            if (!forceLoad) continue\n            if (didForceLoad) continue\n            didForceLoad = true\n            this.load()\n            depWS = this.#workspaces.get(dep)\n            if (!depWS) continue\n          }\n          depWorkspaces.push(depWS)\n        }\n      }\n    }\n    return depWorkspaces\n  }\n\n  onCycle(\n    _ws: Workspace,\n    _cycle: Workspace[],\n    _depPath: Workspace[],\n  ) {\n    // XXX - process logging? Need to say something like:\n    // Cyclical workspace dependency warning!\n    // When evaluating dependency ${ws.name} via ${\n    //   path.map(ws => ws.name).join(' -> ')\n    // }, a dependency cycle was detected: ${\n    //   cycle.map(ws => ws.name).join(' -> ')\n    // }. Operation will continue, but dependency order not guaranteed.`\n  }\n\n  /**\n   * Return the set of workspaces in the named group.\n   * If the group is not one we know about, then undefined is returned.\n   */\n  group(group: string) {\n    return this.#groups.get(group)\n  }\n\n  /**\n   * Get a loaded workspace by path or name.\n   *\n   * Note that this can only return workspaces that were ingested via a\n   * previous call to {@link Monorepo#load}.\n   */\n  get(nameOrPath: string) {\n    return this.#workspaces.get(nameOrPath)\n  }\n\n  /**\n   * get the list of all loaded workspace names used as keys\n   */\n  *names() {\n    for (const [key, ws] of this.#workspaces) {\n      if (key === ws.name) yield key\n    }\n  }\n\n  /**\n   * get the list of all loaded workspace paths used as keys\n   */\n  *paths() {\n    for (const [key, ws] of this.#workspaces) {\n      if (key === ws.path) yield key\n    }\n  }\n\n  /**\n   * get the workspace objects in no particular order.\n   * this is ever so slightly faster than iterating, because it doesn't\n   * explore the graph to yield results in topological dependency order,\n   * and should be used instead when order doesn't matter.\n   */\n  *values() {\n    const seen = new Set<string>()\n    for (const ws of this.#workspaces.values()) {\n      if (seen.has(ws.fullpath)) continue\n      seen.add(ws.fullpath)\n      yield ws\n    }\n  }\n\n  /**\n   * Get all the keys (package names and paths) for loaded workspaces.\n   * Union of {@link Monorepo#names} and {@link Monorepo#paths}\n   */\n  *keys() {\n    for (const ws of this.values()) {\n      yield ws.path\n      if (ws.name !== ws.path) yield ws.name\n    }\n  }\n\n  /**\n   * Filter the monorepo object yielding the workspace objects that matches\n   * either of the {@link WorkspacesLoadedConfig} options provided, in as close\n   * to topological dependency order as possible.\n   */\n  *filter({\n    workspace: namesOrPaths,\n    'workspace-group': groupName,\n  }: WorkspacesLoadedConfig) {\n    const globPatternChecks = namesOrPaths?.map(glob =>\n      minimatch.filter(posix.join(glob)),\n    )\n    for (const ws of this) {\n      // check if any group has any of the provided group names\n      if (groupName?.some(i => ws.groups.includes(i))) {\n        yield ws\n        continue\n      }\n      // check if any workspace-provided name directly matches any of the\n      // configured workspaces by either name or file path\n      if (\n        namesOrPaths\n          ?.map(i => posix.join(i))\n          .some(i => ws.keys.includes(i))\n      ) {\n        yield ws\n        continue\n      }\n      // check if one of the workspace values are matching glob patterns\n      if (\n        ws.keys.some(key => globPatternChecks?.some(fn => fn(key)))\n      ) {\n        yield ws\n      }\n    }\n  }\n\n  /**\n   * Run an operation asynchronously over all loaded workspaces\n   *\n   * If the `forceLoad` param is true, then it will attempt to do a full load\n   * when encountering a `workspace:` dependency that isn't loaded.\n   *\n   * Note that because the return type appears in the parameters of the\n   * operation function, it must be set explicitly either in the operation\n   * function signature or by calling `run<MyType>` or it'll fall back to\n   * `unknown`, similar to `Array.reduce()`, and for the same reason.\n   */\n  async run<R>(\n    operation: (\n      s: Workspace,\n      signal: AbortSignal,\n      depResults: DepResults<Workspace, R>,\n    ) => Promise<R> | R,\n    forceLoad = false,\n  ) {\n    const [ws, ...rest] = [...this.#workspaces.values()]\n    if (!ws) {\n      throw error('No workspaces loaded', undefined, this.run)\n    }\n\n    return graphRun<Workspace, R>({\n      graph: [ws, ...rest],\n      getDeps: ws => this.getDeps(ws, forceLoad),\n      visit: async (ws, signal, _, depResults) =>\n        await operation(ws, signal, depResults),\n      onCycle: (ws, cycle, path) => this.onCycle(ws, cycle, path),\n    })\n  }\n\n  /**\n   * Run an operation synchronously over all loaded workspaces\n   *\n   * If the `forceLoad` param is true, then it will attempt to do a full load\n   * when encountering a `workspace:` dependency that isn't loaded.\n   *\n   * Note that because the return type appears in the parameters of the\n   * operation function, it must be set explicitly either in the operation\n   * function signature or by calling `runSync<MyType>` or it'll fall back to\n   * `unknown`, similar to `Array.reduce()`, and for the same reason.\n   */\n  runSync<R>(\n    operation: (\n      s: Workspace,\n      signal: AbortSignal,\n      depResults: DepResults<Workspace, R>,\n    ) => R,\n    forceLoad = false,\n  ) {\n    const [ws, ...rest] = [...this.#workspaces.values()]\n    if (!ws) {\n      throw error('No workspaces loaded', undefined, this.run)\n    }\n\n    return graphRunSync<Workspace, R>({\n      graph: [ws, ...rest],\n      getDeps: ws => this.getDeps(ws, forceLoad),\n      visit: (ws, signal, _, depResults) =>\n        operation(ws, signal, depResults),\n      onCycle: (ws, cycle, path) => this.onCycle(ws, cycle, path),\n    })\n  }\n\n  /**\n   * Convenience method to instantiate and load in one call.\n   * Returns undefined if the project is not a monorepo workspaces\n   * root, otherwise returns the loaded Monorepo.\n   */\n  static maybeLoad(\n    projectRoot: string,\n    options: MonorepoOptions = { load: {} },\n  ) {\n    try {\n      if (\n        !statSync(\n          resolve(projectRoot, 'vlt-workspaces.json'),\n        ).isFile()\n      ) {\n        return\n      }\n    } catch {\n      return\n    }\n    const { load = {} } = options\n    return new Monorepo(projectRoot, { ...options, load })\n  }\n\n  /**\n   * Convenience method to instantiate and load in one call.\n   * Throws if called on a directory that is not a workspaces root.\n   */\n  static load(\n    projectRoot: string,\n    options: MonorepoOptions = { load: {} },\n  ) {\n    const { load = {} } = options\n    return new Monorepo(projectRoot, { ...options, load })\n  }\n}\n\nexport const workspaceCache = new Map<string, Workspace>()\n\n/**\n * Class representing a single Workspace in a {@link Monorepo}\n */\nexport class Workspace {\n  id: DepID\n  path: string\n  fullpath: string\n  manifest: Manifest\n  groups: string[] = []\n  name: string\n  #keys?: string[]\n\n  constructor(path: string, manifest: Manifest, fullpath: string) {\n    this.id = joinDepIDTuple(['workspace', path])\n    workspaceCache.set(fullpath, this)\n    this.path = path\n    this.fullpath = fullpath\n    this.manifest = manifest\n    this.name = manifest.name ?? path\n  }\n\n  get keys(): string[] {\n    if (this.#keys) {\n      return this.#keys\n    }\n    this.#keys = [this.name, this.path, this.fullpath]\n    return this.#keys\n  }\n}\n", "import { setMaxListeners } from 'node:events'\n\n/**\n * Options that define the graph and how to traverse it\n */\nexport interface RunnerOptions<Node, Result = void> {\n  /** Array of one or more entry nodes. */\n  graph: [node: Node, ...rest: Node[]]\n\n  /** get the dependencies of a given node */\n  getDeps: (node: Node) => Node[] | Promise<Node[]>\n\n  /** action to take on each node */\n  visit: (\n    node: Node,\n    signal: AbortSignal,\n    path: Node[],\n    depResults: DepResults<Node, Result>,\n  ) => Result | Promise<Result>\n\n  /**\n   * Called when a cycle is encountered.\n   * Throw in this method to enforce a DAG graph.\n   * If left undefined, then cycles are silently ignored and skipped.\n   *\n   * `node` parameter is the dependency that is being skipped.\n   *\n   * `cycle` is the route from the dependent back to itself via\n   * the parent.\n   *\n   * `path` is the path to the dependent who wanted this dep to be\n   * loaded.\n   */\n  onCycle?: (\n    node: Node,\n    cycle: Node[],\n    path: Node[],\n  ) => void | Promise<void>\n\n  /**\n   * Set to `false` to continue operations even if errors occur.\n   * If set to false, then an AggregateError will be raised on failure\n   * containing all failures (even if only one). If true, then a normal\n   * Error will be raised on failure.\n   *\n   * @default true\n   */\n  failFast?: boolean\n\n  /** a signal that will trigger the graph traversal to end prematurely */\n  signal?: AbortSignal\n}\n\nexport type DepResults<Node, Result> = Map<Node, Result | undefined>\n\n/**\n * Options that can define a synchronous graph traversal.\n *\n * Note that if the visit() method is async, then the *promises themselves*\n * will be used as the `Result` type, which is likely not what you want!\n */\nexport interface RunnerOptionsSync<Node, Result = void>\n  extends RunnerOptions<Node, Result> {\n  /** Get a set of dependency nodes synchronously */\n  getDeps: (node: Node) => Node[]\n\n  /** Visit a node synchronously */\n  visit: (\n    node: Node,\n    signal: AbortSignal,\n    path: Node[],\n    depResults: DepResults<Node, Result>,\n  ) => Result\n\n  /** Handle cycles synchronously */\n  onCycle?: (node: Node, cycle: Node[], path: Node[]) => void\n}\n\n/**  A map of nodes to their PromiseSettledResult value */\nexport type SettledMap<Node, Result = void> = Map<\n  Node,\n  PromiseSettledResult<Result>\n>\n\n/** Any function or class. Used for Error.captureStackTrace */\nexport type Callable =\n  | Function\n  | ((...a: unknown[]) => unknown)\n  | {\n      new (...a: unknown[]): unknown\n    }\n\n/** Base class of Runner and RunnerSync */\nexport abstract class RunnerBase<\n  /** The type of thing to be found in this graph */\n  Node,\n  /** Type returned by the visit() method */\n  Result = void,\n  Sync extends boolean = false,\n  O extends Sync extends true ? RunnerOptionsSync<Node, Result>\n  : RunnerOptions<Node, Result> = Sync extends true ?\n    RunnerOptionsSync<Node, Result>\n  : RunnerOptions<Node, Result>,\n> {\n  /** The map of traversal results */\n  readonly results: Map<Node, Result> = new Map()\n\n  /** The map of PromiseSettledResult objects */\n  readonly settled: SettledMap<Node, Result> = new Map()\n\n  /** Set of dependents (direct & transitive) on each node */\n  readonly dependents: Map<Node, Set<Node>> = new Map()\n\n  /** Set of direct dependents on each node */\n  readonly directDependents: Map<Node, Set<Node>> = new Map()\n\n  /** Options provided to constructor */\n  readonly options: O\n\n  /**\n   * AbortController used internally to abort the process.\n   *\n   * This is internal only, and triggering it at the wrong time may cause\n   * undefined and unsupported behavior. Do not use!\n   *\n   * Instead, if you want to be able to abort the walk at any time, provide\n   * your own AbortSignal in the opions.\n   *\n   * @internal\n   */\n  readonly abortController: AbortController\n\n  /** True if we are in failFast mode */\n  readonly failFast: boolean\n\n  /** Rejections and Errors encountered in the traversal */\n  readonly errors: unknown[] = []\n\n  /**\n   * Function defining the callsite where the traversal was initiated,\n   * used for Error.captureStackTrace.\n   */\n  readonly from: Callable\n\n  constructor(options: O, from?: Callable) {\n    const ac = new AbortController()\n    this.from = from ?? this.constructor\n    this.abortController = ac\n    setMaxListeners(Infinity, ac.signal)\n    this.options = options\n    if (!options.graph.length) {\n      const er = new Error('no nodes provided to graph traversal', {\n        cause: {\n          found: options.graph,\n          wanted: '[first: Node, ...rest: Node[]]',\n        },\n      })\n      Error.captureStackTrace(er, from)\n      throw er\n    }\n    this.failFast = options.failFast !== false\n    const { signal } = options\n    if (signal !== undefined) {\n      signal.addEventListener('abort', reason => ac.abort(reason), {\n        once: true,\n        signal: ac.signal,\n      })\n    }\n  }\n\n  /** Initiate the graph traversal, resolving/returning when complete */\n  abstract run(): Sync extends true ? void : Promise<void>\n\n  /** Get the dependencies of a given node */\n  abstract getDeps(\n    n: Node,\n  ): Sync extends true ? Node[] : Promise<Node[]>\n\n  /** Visit a node. Calls `options.visit()` */\n  abstract visit(\n    n: Node,\n    path: Node[],\n    depResults: DepResults<Node, Result>,\n  ): Sync extends true ? Result : Promise<Result>\n\n  /**\n   * Calls the `options.onCycle()` method when a cycle is detected.\n   */\n  abstract onCycle(\n    n: Node,\n    cycle: Node[],\n    path: Node[],\n  ): Sync extends true ? void : void | Promise<void>\n\n  /**\n   * For a Node `n` that depends directly or transitively on Node `d`, find the\n   * shortest known dependency path from `n` to `d`. This is done by walking\n   * backwards breadth-first up the dependency relations from `d` until `n` is\n   * found.\n   *\n   * If no known path can be found, then `undefined` is returned. Otherwise,\n   * a path array is returned that starts with `n` and ends with `d`.\n   *\n   * Note that self-referential links are never considered, since they're\n   * by definition cyclical.\n   */\n  route(n: Node, d: Node): undefined | [n: Node, ...path: Node[]] {\n    const dependents = this.dependents.get(d)\n    if (!dependents?.has(n)) return undefined\n    const directDependents = this.directDependents.get(d)\n    /* c8 ignore next */\n    if (!directDependents) return undefined\n    if (directDependents.has(n)) {\n      return [n, d]\n    }\n    const queue: [n: Node, ...r: Node[]][] = [\n      ...directDependents,\n    ].map(dd => [dd, d])\n    let step: undefined | [n: Node, ...r: Node[]] = undefined\n    while (undefined !== (step = queue.shift())) {\n      /* c8 ignore next */\n      if (!dependents.has(step[0])) continue\n      if (step[0] === n) {\n        return step\n      }\n      const ddd = this.directDependents.get(step[0])\n      if (ddd) {\n        for (const d of ddd) {\n          queue.push([d, ...step])\n        }\n      }\n    }\n  }\n\n  /**\n   * If the dependency from `n -> d` at the specified path would\n   * cause a cycle, then call the onCycle method and return true.\n   * Oherwise, assign the appropriate entries in the dependency\n   * tracking sets, and return false.\n   *\n   * @internal\n   */\n  cycleCheck(n: Node, path: Node[], d: Node) {\n    /* c8 ignore next */\n    const dependents = this.dependents.get(n) ?? new Set()\n    this.dependents.set(n, dependents)\n    const isCycle = dependents.has(d)\n    if (isCycle) {\n      const cycle = this.route(d, n)\n      /* c8 ignore start - impossible */\n      if (!cycle) {\n        throw new Error('cycle detected, but cycle route not found')\n      }\n      /* c8 ignore stop */\n      cycle.unshift(n)\n      this.onCycle(d, cycle, path)\n      return true\n    }\n\n    const depDD = this.directDependents.get(d) ?? new Set()\n    this.directDependents.set(d, depDD)\n    depDD.add(n)\n\n    const depDependents = this.dependents.get(d) ?? new Set()\n    this.dependents.set(d, depDependents)\n    for (const n of dependents) {\n      depDependents.add(n)\n    }\n    depDependents.add(n)\n    return false\n  }\n\n  /**\n   * Method that handles errors raised by visits.\n   *\n   * @internal\n   */\n  handleError(er: unknown, n: Node, path: Node[]) {\n    this.errors.push(er)\n    this.settled.set(n, {\n      status: 'rejected',\n      reason: er,\n    })\n    if (this.failFast) {\n      this.abortController.abort(er)\n      const e = new Error('failed graph traversal', {\n        cause: {\n          node: n,\n          path,\n          cause: er as Error,\n        },\n      })\n      Error.captureStackTrace(e, this.from)\n      throw e\n    }\n  }\n\n  /**\n   * Method that handles successful visit results\n   *\n   * @internal\n   */\n  handleValue(value: Result, n: Node) {\n    this.results.set(n, value)\n    this.settled.set(n, {\n      status: 'fulfilled',\n      value,\n    })\n  }\n}\n\n/** Asynchronous graph runner */\nexport class Runner<Node, Result> extends RunnerBase<\n  Node,\n  Result,\n  false,\n  RunnerOptions<Node, Result>\n> {\n  /** Map of nodes currently awaiting completion */\n  readonly running = new Map<Node, Promise<void>>()\n\n  async getDeps(n: Node) {\n    /* c8 ignore next */\n    if (this.abortController.signal.aborted) return []\n    const deps = await this.options.getDeps(n);\n    for (const d of deps) {\n      const dependents = this.dependents.get(d) ?? new Set()\n      this.dependents.set(d, dependents)\n      dependents.add(n)\n      const depDD = this.directDependents.get(d) ?? new Set()\n      this.directDependents.set(d, depDD)\n      depDD.add(n)\n    }\n    return deps\n  }\n\n  async visit(\n    n: Node,\n    path: Node[],\n    depResults: DepResults<Node, Result>,\n  ) {\n    const { signal } = this.abortController\n    return this.options.visit(n, signal, path, depResults)\n  }\n\n  async onCycle(n: Node, cycle: Node[], path: Node[]) {\n    /* c8 ignore next */\n    if (this.abortController.signal.aborted) return\n    await this.options.onCycle?.(n, cycle, path)\n  }\n\n  async #walk(n: Node, path: Node[]) {\n    const r = this.running.get(n)\n    /* c8 ignore next */\n    if (r) return r\n    /* c8 ignore start */\n    if (this.settled.get(n)) return\n    /* c8 ignore stop */\n    const p = this.#step(n, path).then(\n      () => {\n        this.running.delete(n)\n      },\n      /* c8 ignore start - handled deeper in the chain */\n      er => {\n        this.running.delete(n)\n        throw er\n      },\n      /* c8 ignore stop */\n    )\n    this.running.set(n, p)\n    return p\n  }\n\n  async #step(n: Node, path: Node[]) {\n    const dependents = this.dependents.get(n) ?? new Set()\n    this.dependents.set(n, dependents)\n\n    const deps = await this.getDeps(n)\n    const awaiting: Promise<void>[] = []\n    const depPath = [...path, n]\n\n    for (const d of deps) {\n      /* c8 ignore next */\n      if (this.abortController.signal.aborted) return\n      // self-link, skip\n      if (d === n) continue\n      if (this.cycleCheck(n, depPath, d)) continue\n      /* c8 ignore next */\n      if (this.settled.get(d)) continue\n      awaiting.push(this.running.get(d) ?? this.#walk(d, depPath))\n    }\n\n    /* c8 ignore next */\n    if (this.abortController.signal.aborted) return\n    await Promise.all(awaiting)\n    if (this.abortController.signal.aborted) return\n    const depRes = new Map<Node, Result | undefined>(\n      deps.map(d => [d, this.results.get(d)]),\n    )\n    try {\n      this.handleValue(await this.visit(n, path, depRes), n)\n    } catch (er) {\n      this.handleError(er, n, path)\n    }\n  }\n\n  async run(): Promise<void> {\n    const promises: Promise<void>[] = []\n    for (const n of this.options.graph) {\n      promises.push(this.#walk(n, []))\n    }\n    await Promise.all(promises)\n  }\n}\n\n/** Synchronous graph runner */\nexport class RunnerSync<Node, Result> extends RunnerBase<\n  Node,\n  Result,\n  true,\n  RunnerOptionsSync<Node, Result>\n> {\n  getDeps(n: Node) {\n    if (this.abortController.signal.aborted) return []\n    return this.options.getDeps(n)\n  }\n\n  visit(n: Node, path: Node[], depResults: DepResults<Node, Result>) {\n    const { signal } = this.abortController\n    return this.options.visit(n, signal, path, depResults)\n  }\n\n  onCycle(n: Node, cycle: Node[], path: Node[]) {\n    /* c8 ignore next */\n    if (this.abortController.signal.aborted) return\n    this.options.onCycle?.(n, cycle, path)\n  }\n\n  #walk(n: Node, path: Node[]) {\n    /* c8 ignore start */\n    if (this.settled.get(n)) return\n    /* c8 ignore stop */\n    this.#step(n, path)\n  }\n\n  #step(n: Node, path: Node[]) {\n    const dependents = this.dependents.get(n) ?? new Set()\n    this.dependents.set(n, dependents)\n\n    const deps = this.getDeps(n)\n    const depPath = [...path, n]\n    for (const d of deps) {\n      if (this.abortController.signal.aborted) return\n      /* c8 ignore next */\n      if (d === n) continue\n      if (this.cycleCheck(n, depPath, d)) continue\n      if (!this.settled.get(d)) this.#walk(d, depPath)\n    }\n\n    if (this.abortController.signal.aborted) return\n    const depRes = new Map<Node, Result | undefined>(\n      deps.map(d => [d, this.results.get(d)]),\n    )\n    try {\n      this.handleValue(this.visit(n, path, depRes), n)\n    } catch (er) {\n      this.handleError(er, n, path)\n    }\n  }\n\n  run(): Map<Node, Result> {\n    for (const n of this.options.graph) {\n      this.#walk(n, [])\n    }\n    return this.results\n  }\n}\n\n/**\n * Asynchronous graph traversal method\n *\n * If `failFast:false` is set in the options, then an AggregateError\n * will be raised if there were any failures. Otherwise, a normal Error\n * is raised on failure.\n */\nexport const graphRun = async <Node, Result>(\n  options: RunnerOptions<Node, Result>,\n): Promise<Map<Node, Result>> => {\n  const runner = new Runner(options, graphRun)\n  await runner.run()\n  if (runner.errors.length) {\n    const e = new AggregateError(\n      runner.errors,\n      'failed graph traversal',\n    )\n    Error.captureStackTrace(e, graphRun)\n    throw e\n  }\n  return runner.results\n}\n\n/**\n * Synchronous graph traversal method\n *\n * If `failFast:false` is set in the options, then an AggregateError\n * will be thrown if there were any failures. Otherwise, a normal Error\n * is thrown on failure.\n */\nexport const graphRunSync = <Node, Result>(\n  options: RunnerOptionsSync<Node, Result>,\n): Map<Node, Result> => {\n  const runner = new RunnerSync(options, graphRunSync)\n  runner.run()\n  if (runner.errors.length) {\n    const e = new AggregateError(\n      runner.errors,\n      'failed graph traversal',\n    )\n    Error.captureStackTrace(e, graphRunSync)\n    throw e\n  }\n  return runner.results\n}\n\n/**\n * Asynchronous graph traversal, capturing all error/result\n * statuses.\n */\nexport const allSettled = async <Node, Result>(\n  options: RunnerOptions<Node, Result>,\n): Promise<SettledMap<Node, Result>> => {\n  const runner = new Runner(\n    { ...options, failFast: false },\n    allSettled,\n  )\n  await runner.run()\n  return runner.settled\n}\n\n/**\n * Synchronous graph traversal, capturing all error/result\n * statuses.\n */\nexport const allSettledSync = <Node, Result>(\n  options: RunnerOptionsSync<Node, Result>,\n): SettledMap<Node, Result> => {\n  const runner = new RunnerSync(\n    { ...options, failFast: false },\n    allSettledSync,\n  )\n  runner.run()\n  return runner.settled\n}\n\n/**\n * Asynchronous graph traversal, returning the first successful visit.\n * If all visits fail, then an AggregateError is raised with all errors\n * encountered.\n */\nexport const any = async <Node, Result>(\n  options: RunnerOptions<Node, Result>,\n): Promise<Result> => {\n  const ac = new AbortController()\n  let result!: Result\n  let found: boolean = false\n  const runner = new Runner<Node, Result>(\n    {\n      ...options,\n      failFast: false,\n      signal: ac.signal,\n      visit: async (node, signal, path, depResults) => {\n        try {\n          result = await options.visit(node, signal, path, depResults)\n          found = true\n          ac.abort('found')\n        } finally {\n          return result\n        }\n      },\n    },\n    any,\n  )\n  await runner.run()\n  if (!found) {\n    const e = new AggregateError(\n      runner.errors,\n      'failed graph traversal',\n    )\n    Error.captureStackTrace(e, any)\n    throw e\n  }\n  return result\n}\n\n/**\n * Synchronous graph traversal, returning the first successful visit.\n * If all visits fail, then an AggregateError is thrown with all errors\n * encountered.\n */\nexport const anySync = <Node, Result>(\n  options: RunnerOptionsSync<Node, Result>,\n): Result => {\n  const ac = new AbortController()\n  let result!: Result\n  let found: boolean = false\n  const runner = new RunnerSync<Node, Result>(\n    {\n      ...options,\n      failFast: false,\n      signal: ac.signal,\n      visit: (node, signal, path, depResults) => {\n        try {\n          result = options.visit(node, signal, path, depResults)\n          found = true\n          ac.abort('found')\n        } finally {\n          return result\n        }\n      },\n    },\n    anySync,\n  )\n  runner.run()\n  if (!found) {\n    const e = new AggregateError(\n      runner.errors,\n      'failed graph traversal',\n    )\n    Error.captureStackTrace(e, anySync)\n    throw e\n  }\n  return result\n}\n\n/**\n * Asynchronous graph traversal, resolving or rejecting when the first visit\n * resolves or rejects.\n */\nexport const race = async <Node, Result>(\n  options: RunnerOptions<Node, Result>,\n): Promise<Result> => {\n  const ac = new AbortController()\n  let result!: Result\n  const runner = new Runner<Node, Result>(\n    {\n      ...options,\n      failFast: true,\n      signal: ac.signal,\n      visit: async (node, signal, path, depResults) => {\n        try {\n          result = await options.visit(node, signal, path, depResults)\n          ac.abort('found')\n        } finally {\n          return result\n        }\n      },\n    },\n    race,\n  )\n  await runner.run()\n  return result\n}\n\n/**\n * Synchronous graph traversal, returning or throwing when the first visit\n * is completed.\n */\nexport const raceSync = <Node, Result>(\n  options: RunnerOptionsSync<Node, Result>,\n): Result => {\n  const ac = new AbortController()\n  let result!: Result\n  const runner = new RunnerSync<Node, Result>(\n    {\n      ...options,\n      failFast: true,\n      signal: ac.signal,\n      visit: (node, signal, path, depResults) => {\n        try {\n          result = options.visit(node, signal, path, depResults)\n          ac.abort('found')\n        } finally {\n          return result\n        }\n      },\n    },\n    race,\n  )\n  runner.run()\n  return result\n}\n", "import { dirname, resolve } from 'path'\nexport const walkUp = function* (path: string) {\n  for (path = resolve(path); path;) {\n    yield path\n    const pp = dirname(path)\n    if (pp === path) {\n      break\n    } else {\n      path = pp\n    }\n  }\n}\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;AAKO,IAAM,YAAuB;AAsDpC,IAAM,cAAc,IAAI;AAAA,EACtB,WAAW,SAAS,KAAK,SAAS,KAAK,SAAS,KAAK,SAAS,MAC5D,SACF,KAAK,SAAS,iCAEe,SAAS,KAClC,SACF,OAAO,SAAS,KAAK,SAAS;AAClC;AAEO,IAAM,UAAU,CAAC,QACtB,OAAO,QAAQ,YAAY,YAAY,KAAK,GAAG;AAE1C,IAAM,UAAU,CAAC,QAAuB;AAC7C,MAAI,CAAC,QAAQ,GAAG,GAAG;AACjB,UAAM,MAAM,mBAAmB;AAAA,MAC7B,OAAO;AAAA,IACT,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAKO,IAAM,iBAAiB,CAAC,SAA4B;AACzD,QAAM,CAAC,MAAM,OAAO,QAAQ,KAAK,IAAI;AACrC,QAAM,IAAI,OAAO,KAAK;AACtB,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,GAAG,OAAO,MAAM,CAAC,GAAG,QAAQ,GAAG,SAAS,GAAG,OAAO,KAAK,CAAC,KAAK,EAAE;AAAA,IACpG,KAAK;AACH,aAAO,GAAG,IAAI,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,GAAG,OAAO,MAAM,CAAC,GAAG,QAAQ,GAAG,SAAS,GAAG,OAAO,KAAK,CAAC,KAAK,EAAE;AAAA,IAC3G;AACE,aAAO,GAAG,IAAI,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,GAAG,SAAS,GAAG,OAAO,MAAM,CAAC,KAAK,EAAE;AAAA,EAClF;AACF;AAGA,IAAM,SAAS,CAAC,MACd,mBAAmB,CAAC,EACjB,WAAW,OAAO,GAAG,EACrB,WAAW,OAAO,MAAG,EACrB,WAAW,OAAO,MAAG;AAKnB,IAAM,aAAa,CAAC,OAA2B;AACpD,QAAM,CAAC,MAAM,QAAQ,IAAI,QAAQ,KAAK,IAAI,GACvC,WAAW,QAAK,GAAG,EACnB,MAAM,WAAW,CAAC;AACrB,QAAM,IAAI,mBAAmB,KAAK;AAClC,UAAQ,MAAM;AAAA,IACZ,KAAK;AAAA,IACL,KAAK,IAAI;AACP,UAAI,WAAW,QAAW;AACxB,cAAM,MAAM,WAAW,IAAI,OAAO,EAAE,OAAO,GAAG,CAAC;AAAA,MACjD;AACA,YAAM,IAAgB;AAAA,QACpB,QAAQ;AAAA,QACR;AAAA,QACA,mBAAmB,MAAM;AAAA,MAC3B;AACA,UAAI,MAAO,GAAE,KAAK,mBAAmB,KAAK,CAAC;AAC3C,aAAO;AAAA,IACT;AAAA,IACA,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK,aAAa;AAChB,YAAM,IAAgB,CAAC,MAAM,CAAC;AAC9B,UAAI,OAAQ,GAAE,KAAK,mBAAmB,MAAM,CAAC;AAC7C,aAAO;AAAA,IACT;AAAA,IACA,SAAS;AACP,YAAM,MAAM,sBAAsB;AAAA,QAChC,OAAO;AAAA,QACP,cAAc,CAAC,OAAO,QAAQ,aAAa,UAAU,EAAE;AAAA,MACzD,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAKO,IAAM,UAAU,CACrB,IACA,MACA,UAAuB,CAAC,MACf,aAAa,WAAW,EAAE,GAAG,MAAM,OAAO;AAK9C,IAAM,eAAe,CAC1B,OACA,MACA,UAAuB,CAAC,MACrB;AACH,QAAM,CAAC,MAAM,OAAO,MAAM,IAAI;AAC9B,UAAQ,MAAM;AAAA,IACZ,KAAK,UAAU;AACb,UAAI,CAAC;AACH,cAAM,MAAM,mCAAmC;AAAA,UAC7C,OAAO;AAAA,QACT,CAAC;AACH,aAAO,KAAK,MAAM,QAAQ,aAAa,KAAK;AAAA,IAC9C;AAAA,IACA,KAAK,QAAQ;AACX,UAAI,CAAC,OAAO;AACV,cAAM,MAAM,mCAAmC;AAAA,UAC7C,OAAO;AAAA,QACT,CAAC;AAAA,MACH;AACA,aAAO,KAAK,MAAM,QAAQ,aAAa,QAAQ,KAAK,IAAI,OAAO;AAAA,IACjE;AAAA,IACA,KAAK,YAAY;AACf,UAAI,OAAO,UAAU,UAAU;AAC7B,cAAM,MAAM,0CAA0C;AAAA,UACpD,OAAO;AAAA,QACT,CAAC;AAAA,MACH;AACA,UAAI,CAAC,QAAQ;AACX,cAAM,MAAM,oCAAoC;AAAA,UAC9C,OAAO;AAAA,QACT,CAAC;AAAA,MACH;AACA,UAAI,CAAC,OAAO;AAEV,cAAMA,KAAI,KAAK,MAAM,MAAM;AAC3B,YAAI,QAAQA,GAAE,SAAS,MAAM;AAC3B,iBAAO,KAAK,MAAM,GAAG,IAAI,QAAQ,MAAM,EAAE;AAAA,QAC3C,OAAO;AACL,iBAAOA;AAAA,QACT;AAAA,MACF;AACA,UAAI,CAAC,eAAe,KAAK,KAAK,GAAG;AAC/B,cAAM,MAAM,QAAQ,aAAa,KAAK;AACtC,YAAI,UAAU,SAAS,CAAC,KAAK;AAC3B,gBAAM,MAAM,uCAAuC;AAAA,YACjD,MAAM;AAAA,YACN,OAAO;AAAA,UACT,CAAC;AAAA,QACH;AACA,eAAO,KAAK;AAAA,UACV,QAAQ;AAAA,UACR,GAAG,KAAK,IAAI,MAAM;AAAA,UAClB;AAAA,QACF;AAAA,MACF;AACA,YAAM,IAAI,KAAK;AAAA,QACb,QAAQ;AAAA,QACR,YAAY,KAAK,IAAI,MAAM;AAAA,QAC3B;AAAA,MACF;AACA,aAAO,QAAQ,EAAE,MAAM,SAAS,OAC5B,KAAK,MAAM,EAAE,MAAM,OAAO,MAAM,EAAE,QAAQ,IAC1C;AAAA,IACN;AAAA,IACA,KAAK,OAAO;AACV,UAAI,CAAC,OAAO;AACV,cAAM,MAAM,2BAA2B;AAAA,UACrC,OAAO;AAAA,QACT,CAAC;AAAA,MACH;AACA,aAAO,KAAK;AAAA,QACV,QAAQ;AAAA,QACR,QAAQ,MAAM;AAAA,QACd;AAAA,MACF;AAAA,IACF;AAAA,IACA,KAAK,aAAa;AAChB,UAAI,CAAC,OAAO;AACV,cAAM,MAAM,gCAAgC,EAAE,OAAO,MAAM,CAAC;AAAA,MAC9D;AACA,aAAO,QAAQ,SAAS,QACpB,KAAK,MAAM,MAAM,aAAa,KAAK,MAAM,OAAO,IAChD,KAAK,MAAM,OAAO,eAAe,OAAO;AAAA,IAC9C;AAAA,EACF;AACF;AAGA,IAAM,aAAa,CAAC,MAEhB,CAAC,KACD,MAAM,gCACN,MAAM,gCAEN,KACA;AAQG,IAAM,WAAW,CAAC,MAAY,SAA+B;AAClE,QAAM,IAAI,KAAK;AACf,UAAQ,EAAE,MAAM;AAAA,IACd,KAAK,YAAY;AAEf,YAAM,MAAM,WAAW,EAAE,QAAQ;AACjC,UAAI,CAAC,EAAE,iBAAiB,KAAK;AAC3B,mBAAW,CAAC,OAAO,IAAI,KAAK,OAAO;AAAA,UACjC,KAAK,QAAQ;AAAA,QACf,GAAG;AACD,cAAI,QAAQ,MAAM;AAChB,cAAE,gBAAgB;AAClB;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,QACL,EAAE;AAAA,QACF,EAAE,iBAAiB;AAAA,QACnB,GAAG,KAAK,QAAQ,KAAK,IAAI,IAAI,KAAK,WAAW,KAAK,QAAQ;AAAA,MAC5D;AAAA,IACF;AAAA,IACA,KAAK,OAAO;AACV,YAAM;AAAA,QACJ;AAAA,QACA;AAAA,QACA;AAAA,QACA,cAAc;AAAA,MAChB,IAAI;AACJ,UAAI,CAAC;AACH,cAAM,MAAM,4BAA4B,EAAE,KAAK,CAAC;AAClD,UAAI,cAAc;AAChB,YAAI,CAAC,kBAAkB;AACrB,gBAAM,MAAM,uCAAuC;AAAA,YACjD;AAAA,UACF,CAAC;AAAA,QACH;AACA,eAAO;AAAA,UACL,EAAE;AAAA,UACF,GAAG,YAAY,IAAI,gBAAgB;AAAA,UACnC;AAAA,QACF;AAAA,MACF,OAAO;AACL,eAAO,CAAC,EAAE,MAAM,WAAW,WAAW;AAAA,MACxC;AAAA,IACF;AAAA,IACA,KAAK,UAAU;AACb,YAAM,EAAE,UAAU,IAAI;AACtB,UAAI,CAAC;AACH,cAAM,MAAM,8BAA8B,EAAE,KAAK,CAAC;AACpD,aAAO,CAAC,EAAE,MAAM,SAAS;AAAA,IAC3B;AAAA,IACA,KAAK;AAAA,IACL,KAAK;AACH,YAAM,MAAM,wCAAwC,EAAE,KAAK,CAAC;AAAA,EAChE;AACF;AAQO,IAAM,QAAQ,CAAC,MAAY,SAChC,eAAe,SAAS,MAAM,IAAI,CAAC;;;AC9TrC,SAAS,cAAc,gBAAgB;;;ACLvC,SAAS,uBAAuB;AA6F1B,IAAgB,aAAhB,MAA0B;EAYrB,UAA6B,oBAAI,IAAG;EAGpC,UAAoC,oBAAI,IAAG;EAG3C,aAAmC,oBAAI,IAAG;EAG1C,mBAAyC,oBAAI,IAAG;EAGhD;EAaA;EAGA;EAGA,SAAoB,CAAA;EAMpB;EAET,YAAY,SAAY,MAAe;AACrC,UAAM,KAAK,IAAI,gBAAe;AAC9B,SAAK,OAAO,QAAQ,KAAK;AACzB,SAAK,kBAAkB;AACvB,oBAAgB,UAAU,GAAG,MAAM;AACnC,SAAK,UAAU;AACf,QAAI,CAAC,QAAQ,MAAM,QAAQ;AACzB,YAAM,KAAK,IAAI,MAAM,wCAAwC;QAC3D,OAAO;UACL,OAAO,QAAQ;UACf,QAAQ;;OAEX;AACD,YAAM,kBAAkB,IAAI,IAAI;AAChC,YAAM;IACR;AACA,SAAK,WAAW,QAAQ,aAAa;AACrC,UAAM,EAAE,OAAM,IAAK;AACnB,QAAI,WAAW,QAAW;AACxB,aAAO,iBAAiB,SAAS,YAAU,GAAG,MAAM,MAAM,GAAG;QAC3D,MAAM;QACN,QAAQ,GAAG;OACZ;IACH;EACF;EAsCA,MAAM,GAAS,GAAO;AACpB,UAAM,aAAa,KAAK,WAAW,IAAI,CAAC;AACxC,QAAI,CAAC,YAAY,IAAI,CAAC;AAAG,aAAO;AAChC,UAAM,mBAAmB,KAAK,iBAAiB,IAAI,CAAC;AAEpD,QAAI,CAAC;AAAkB,aAAO;AAC9B,QAAI,iBAAiB,IAAI,CAAC,GAAG;AAC3B,aAAO,CAAC,GAAG,CAAC;IACd;AACA,UAAM,QAAmC;MACvC,GAAG;MACH,IAAI,QAAM,CAAC,IAAI,CAAC,CAAC;AACnB,QAAI,OAA4C;AAChD,WAAO,YAAe,OAAO,MAAM,MAAK,IAAK;AAE3C,UAAI,CAAC,WAAW,IAAI,KAAK,CAAC,CAAC;AAAG;AAC9B,UAAI,KAAK,CAAC,MAAM,GAAG;AACjB,eAAO;MACT;AACA,YAAM,MAAM,KAAK,iBAAiB,IAAI,KAAK,CAAC,CAAC;AAC7C,UAAI,KAAK;AACP,mBAAWC,MAAK,KAAK;AACnB,gBAAM,KAAK,CAACA,IAAG,GAAG,IAAI,CAAC;QACzB;MACF;IACF;EACF;EAUA,WAAW,GAAS,MAAc,GAAO;AAEvC,UAAM,aAAa,KAAK,WAAW,IAAI,CAAC,KAAK,oBAAI,IAAG;AACpD,SAAK,WAAW,IAAI,GAAG,UAAU;AACjC,UAAM,UAAU,WAAW,IAAI,CAAC;AAChC,QAAI,SAAS;AACX,YAAM,QAAQ,KAAK,MAAM,GAAG,CAAC;AAE7B,UAAI,CAAC,OAAO;AACV,cAAM,IAAI,MAAM,2CAA2C;MAC7D;AAEA,YAAM,QAAQ,CAAC;AACf,WAAK,QAAQ,GAAG,OAAO,IAAI;AAC3B,aAAO;IACT;AAEA,UAAM,QAAQ,KAAK,iBAAiB,IAAI,CAAC,KAAK,oBAAI,IAAG;AACrD,SAAK,iBAAiB,IAAI,GAAG,KAAK;AAClC,UAAM,IAAI,CAAC;AAEX,UAAM,gBAAgB,KAAK,WAAW,IAAI,CAAC,KAAK,oBAAI,IAAG;AACvD,SAAK,WAAW,IAAI,GAAG,aAAa;AACpC,eAAWC,MAAK,YAAY;AAC1B,oBAAc,IAAIA,EAAC;IACrB;AACA,kBAAc,IAAI,CAAC;AACnB,WAAO;EACT;EAOA,YAAY,IAAa,GAAS,MAAY;AAC5C,SAAK,OAAO,KAAK,EAAE;AACnB,SAAK,QAAQ,IAAI,GAAG;MAClB,QAAQ;MACR,QAAQ;KACT;AACD,QAAI,KAAK,UAAU;AACjB,WAAK,gBAAgB,MAAM,EAAE;AAC7B,YAAM,IAAI,IAAI,MAAM,0BAA0B;QAC5C,OAAO;UACL,MAAM;UACN;UACA,OAAO;;OAEV;AACD,YAAM,kBAAkB,GAAG,KAAK,IAAI;AACpC,YAAM;IACR;EACF;EAOA,YAAY,OAAe,GAAO;AAChC,SAAK,QAAQ,IAAI,GAAG,KAAK;AACzB,SAAK,QAAQ,IAAI,GAAG;MAClB,QAAQ;MACR;KACD;EACH;;AAII,IAAO,SAAP,cAAoC,WAKzC;EAEU,UAAU,oBAAI,IAAG;EAE1B,MAAM,QAAQ,GAAO;AAEnB,QAAI,KAAK,gBAAgB,OAAO;AAAS,aAAO,CAAA;AAChD,UAAM,OAAO,MAAM,KAAK,QAAQ,QAAQ,CAAC;AACzC,eAAW,KAAK,MAAM;AACpB,YAAM,aAAa,KAAK,WAAW,IAAI,CAAC,KAAK,oBAAI,IAAG;AACpD,WAAK,WAAW,IAAI,GAAG,UAAU;AACjC,iBAAW,IAAI,CAAC;AAChB,YAAM,QAAQ,KAAK,iBAAiB,IAAI,CAAC,KAAK,oBAAI,IAAG;AACrD,WAAK,iBAAiB,IAAI,GAAG,KAAK;AAClC,YAAM,IAAI,CAAC;IACb;AACA,WAAO;EACT;EAEA,MAAM,MACJ,GACA,MACA,YAAoC;AAEpC,UAAM,EAAE,OAAM,IAAK,KAAK;AACxB,WAAO,KAAK,QAAQ,MAAM,GAAG,QAAQ,MAAM,UAAU;EACvD;EAEA,MAAM,QAAQ,GAAS,OAAe,MAAY;AAEhD,QAAI,KAAK,gBAAgB,OAAO;AAAS;AACzC,UAAM,KAAK,QAAQ,UAAU,GAAG,OAAO,IAAI;EAC7C;EAEA,MAAM,MAAM,GAAS,MAAY;AAC/B,UAAM,IAAI,KAAK,QAAQ,IAAI,CAAC;AAE5B,QAAI;AAAG,aAAO;AAEd,QAAI,KAAK,QAAQ,IAAI,CAAC;AAAG;AAEzB,UAAM,IAAI,KAAK,MAAM,GAAG,IAAI,EAAE,KAC5B,MAAK;AACH,WAAK,QAAQ,OAAO,CAAC;IACvB,GAEA,QAAK;AACH,WAAK,QAAQ,OAAO,CAAC;AACrB,YAAM;IACR,CAAC;AAGH,SAAK,QAAQ,IAAI,GAAG,CAAC;AACrB,WAAO;EACT;EAEA,MAAM,MAAM,GAAS,MAAY;AAC/B,UAAM,aAAa,KAAK,WAAW,IAAI,CAAC,KAAK,oBAAI,IAAG;AACpD,SAAK,WAAW,IAAI,GAAG,UAAU;AAEjC,UAAM,OAAO,MAAM,KAAK,QAAQ,CAAC;AACjC,UAAM,WAA4B,CAAA;AAClC,UAAM,UAAU,CAAC,GAAG,MAAM,CAAC;AAE3B,eAAW,KAAK,MAAM;AAEpB,UAAI,KAAK,gBAAgB,OAAO;AAAS;AAEzC,UAAI,MAAM;AAAG;AACb,UAAI,KAAK,WAAW,GAAG,SAAS,CAAC;AAAG;AAEpC,UAAI,KAAK,QAAQ,IAAI,CAAC;AAAG;AACzB,eAAS,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,KAAK,MAAM,GAAG,OAAO,CAAC;IAC7D;AAGA,QAAI,KAAK,gBAAgB,OAAO;AAAS;AACzC,UAAM,QAAQ,IAAI,QAAQ;AAC1B,QAAI,KAAK,gBAAgB,OAAO;AAAS;AACzC,UAAM,SAAS,IAAI,IACjB,KAAK,IAAI,OAAK,CAAC,GAAG,KAAK,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC;AAEzC,QAAI;AACF,WAAK,YAAY,MAAM,KAAK,MAAM,GAAG,MAAM,MAAM,GAAG,CAAC;IACvD,SAAS,IAAI;AACX,WAAK,YAAY,IAAI,GAAG,IAAI;IAC9B;EACF;EAEA,MAAM,MAAG;AACP,UAAM,WAA4B,CAAA;AAClC,eAAW,KAAK,KAAK,QAAQ,OAAO;AAClC,eAAS,KAAK,KAAK,MAAM,GAAG,CAAA,CAAE,CAAC;IACjC;AACA,UAAM,QAAQ,IAAI,QAAQ;EAC5B;;AAII,IAAO,aAAP,cAAwC,WAK7C;EACC,QAAQ,GAAO;AACb,QAAI,KAAK,gBAAgB,OAAO;AAAS,aAAO,CAAA;AAChD,WAAO,KAAK,QAAQ,QAAQ,CAAC;EAC/B;EAEA,MAAM,GAAS,MAAc,YAAoC;AAC/D,UAAM,EAAE,OAAM,IAAK,KAAK;AACxB,WAAO,KAAK,QAAQ,MAAM,GAAG,QAAQ,MAAM,UAAU;EACvD;EAEA,QAAQ,GAAS,OAAe,MAAY;AAE1C,QAAI,KAAK,gBAAgB,OAAO;AAAS;AACzC,SAAK,QAAQ,UAAU,GAAG,OAAO,IAAI;EACvC;EAEA,MAAM,GAAS,MAAY;AAEzB,QAAI,KAAK,QAAQ,IAAI,CAAC;AAAG;AAEzB,SAAK,MAAM,GAAG,IAAI;EACpB;EAEA,MAAM,GAAS,MAAY;AACzB,UAAM,aAAa,KAAK,WAAW,IAAI,CAAC,KAAK,oBAAI,IAAG;AACpD,SAAK,WAAW,IAAI,GAAG,UAAU;AAEjC,UAAM,OAAO,KAAK,QAAQ,CAAC;AAC3B,UAAM,UAAU,CAAC,GAAG,MAAM,CAAC;AAC3B,eAAW,KAAK,MAAM;AACpB,UAAI,KAAK,gBAAgB,OAAO;AAAS;AAEzC,UAAI,MAAM;AAAG;AACb,UAAI,KAAK,WAAW,GAAG,SAAS,CAAC;AAAG;AACpC,UAAI,CAAC,KAAK,QAAQ,IAAI,CAAC;AAAG,aAAK,MAAM,GAAG,OAAO;IACjD;AAEA,QAAI,KAAK,gBAAgB,OAAO;AAAS;AACzC,UAAM,SAAS,IAAI,IACjB,KAAK,IAAI,OAAK,CAAC,GAAG,KAAK,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC;AAEzC,QAAI;AACF,WAAK,YAAY,KAAK,MAAM,GAAG,MAAM,MAAM,GAAG,CAAC;IACjD,SAAS,IAAI;AACX,WAAK,YAAY,IAAI,GAAG,IAAI;IAC9B;EACF;EAEA,MAAG;AACD,eAAW,KAAK,KAAK,QAAQ,OAAO;AAClC,WAAK,MAAM,GAAG,CAAA,CAAE;IAClB;AACA,WAAO,KAAK;EACd;;AAUK,IAAM,WAAW,OACtB,YAC8B;AAC9B,QAAM,SAAS,IAAI,OAAO,SAAS,QAAQ;AAC3C,QAAM,OAAO,IAAG;AAChB,MAAI,OAAO,OAAO,QAAQ;AACxB,UAAM,IAAI,IAAI,eACZ,OAAO,QACP,wBAAwB;AAE1B,UAAM,kBAAkB,GAAG,QAAQ;AACnC,UAAM;EACR;AACA,SAAO,OAAO;AAChB;AASO,IAAM,eAAe,CAC1B,YACqB;AACrB,QAAM,SAAS,IAAI,WAAW,SAAS,YAAY;AACnD,SAAO,IAAG;AACV,MAAI,OAAO,OAAO,QAAQ;AACxB,UAAM,IAAI,IAAI,eACZ,OAAO,QACP,wBAAwB;AAE1B,UAAM,kBAAkB,GAAG,YAAY;AACvC,UAAM;EACR;AACA,SAAO,OAAO;AAChB;;;ADhgBA,SAAS,UAAU,SAAS,aAAa;AA8ClC,IAAM,aAAa,CACxB,MACA,SAC0B;AAC1B,iBAAe,MAAM,IAAI;AACzB,SACE,OAAO,SAAS,WAAW,EAAE,UAAU,CAAC,IAAI,EAAE,IAC5C,MAAM,QAAQ,IAAI,IAAI,EAAE,UAAU,KAAK,IACvC;AAEN;AAKO,IAAM,iBAG0B,CACrC,MACA,SACG;AACH,MAAI,OAAO,SAAS,SAAU,QAAO;AAErC,MAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,eAAW,KAAK,MAAM;AACpB,UAAI,OAAO,MAAM,UAAU;AACzB,cAAM,MAAM,gCAAgC;AAAA,UAC1C;AAAA,UACA,OAAO;AAAA,UACP,QAAQ;AAAA,QACV,CAAC;AAAA,MACH;AAAA,IACF;AACA;AAAA,EACF;AAEA,MAAI,QAAQ,OAAO,SAAS,UAAU;AACpC,eAAW,CAAC,OAAO,KAAK,KAAK,OAAO,QAAQ,IAAI,GAAG;AACjD,UAAI,OAAO,UAAU,SAAU;AAC/B,UAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,mBAAW,KAAK,OAAO;AACrB,cAAI,OAAO,MAAM,UAAU;AACzB,kBAAM,MAAM,gCAAgC;AAAA,cAC1C;AAAA,cACA,MAAM;AAAA,cACN,OAAO;AAAA,cACP,QAAQ;AAAA,YACV,CAAC;AAAA,UACH;AAAA,QACF;AACA;AAAA,MACF;AACA,YAAM,MAAM,gCAAgC;AAAA,QAC1C;AAAA,QACA,MAAM;AAAA,QACN,OAAO;AAAA,QACP,QAAQ;AAAA,MACV,CAAC;AAAA,IACH;AACA;AAAA,EACF;AAEA,QAAM,MAAM,gCAAgC;AAAA,IAC1C;AAAA,IACA,OAAO;AAAA,IACP,QACE;AAAA,EACJ,CAAC;AACH;AA2BO,IAAM,WAAN,MAAM,UAAS;AAAA;AAAA,EAEpB;AAAA;AAAA,EAEA;AAAA;AAAA,EAGA,cAAc,oBAAI,IAAuB;AAAA,EACzC,UAAU,oBAAI,IAA4B;AAAA,EAC1C;AAAA,EACA;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,OAAe;AACjB,WAAO,CAAC,GAAG,KAAK,OAAO,CAAC,EAAE;AAAA,EAC5B;AAAA,EAEA,YAAY,aAAqB,UAA2B,CAAC,GAAG;AAC9D,SAAK,cAAc,QAAQ,WAAW;AACtC,SAAK,SAAS,QAAQ,UAAU,IAAI,WAAW,WAAW;AAC1D,SAAK,cAAc,QAAQ,eAAe,IAAI,YAAY;AAC1D,SAAK,UAAU,QAAQ;AACvB,QAAI,QAAQ,KAAM,MAAK,KAAK,QAAQ,IAAI;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,IAAI,SAAgC;AAClC,QAAI,KAAK,QAAS,QAAO,KAAK;AAC9B,UAAM,OAAO,QAAQ,KAAK,aAAa,qBAAqB;AAC5D,QAAI;AACJ,QAAI;AACF,iBAAW,aAAa,MAAM,MAAM;AAAA,IACtC,SAAS,IAAI;AACX,YAAM,MAAM,mDAAmD;AAAA,QAC7D,MAAM,KAAK;AAAA,QACX,OAAO;AAAA,MACT,CAAC;AAAA,IACH;AACA,QAAI;AACJ,QAAI;AACF,eAAS,MAAM,QAAQ;AAAA,IACzB,SAAS,IAAI;AACX,YAAM,MAAM,oCAAoC;AAAA,QAC9C,MAAM,KAAK;AAAA,QACX,OAAO;AAAA,MACT,CAAC;AAAA,IACH;AACA,SAAK,UAAU,WAAW,QAAQ,IAAI;AACtC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,EAAE,OAAO,QAAQ,IAAsC;AACrD,UAAM,CAAC,EAAE,IAAI,CAAC,GAAG,KAAK,OAAO,CAAC;AAC9B,QAAI,CAAC,GAAI;AAGT,eAAW,aAAa,KAAK,QAAQ,MAAM;AAAA,IAAC,CAAC,EAAE,KAAK,GAAG;AACrD,YAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,OAAO,aAAa,IAI1B;AACA,UAAM,CAAC,EAAE,IAAI,CAAC,GAAG,KAAK,OAAO,CAAC;AAC9B,QAAI,CAAC,GAAI;AACT,eAAW,cAAc,MAAM,KAAK,IAAI,MAAM;AAAA,IAAC,CAAC,GAAG,KAAK,GAAG;AACzD,YAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,KAAK,QAAmB,CAAC,GAAS;AAChC,UAAM,QAAQ,IAAI;AAAA,MAChB,OAAO,MAAM,UAAU,WACrB,CAAC,MAAM,KAAK,IACX,MAAM,SAAS,CAAC;AAAA,IACrB;AACA,UAAM,SAAS,IAAI;AAAA,MACjB,OAAO,MAAM,WAAW,WACtB,CAAC,MAAM,MAAM,IACZ,MAAM,UAAU,CAAC;AAAA,IACtB;AAEA,UAAM,iBAA8C,CAAC;AACrD,eAAW,CAAC,OAAO,OAAO,KAAK,OAAO,QAAQ,KAAK,MAAM,GAAG;AAC1D,UAAI,OAAO,QAAQ,CAAC,OAAO,IAAI,KAAK,EAAG;AACvC,qBAAe,KAAK,IAAI,KAAK,MAAM,OAAO;AAAA,IAC5C;AACA,UAAM,SAAS,MAAM,OAAO,KAAK,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI;AAGrD,QAAI,MAAM,QAAQ,CAAC,OAAO,KAAM,QAAO;AAEvC,eAAW,CAAC,OAAO,OAAO,KAAK,OAAO,QAAQ,cAAc,GAAG;AAC7D,iBAAW,QAAQ,SAAS;AAC1B,YAAI,OAAO,QAAQ,CAAC,OAAO,IAAI,IAAI,EAAG;AACtC,aAAK,QAAQ,MAAM,KAAK;AAAA,MAC1B;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA,EAIA,QAAQ,MAAc,OAA2B;AAC/C,UAAM,WAAW,QAAQ,KAAK,aAAa,IAAI;AAC/C,UAAM,SAAS,KAAK,YAAY,IAAI,QAAQ;AAC5C,QAAI,OAAQ,QAAO;AACnB,UAAM,YAAY,eAAe,IAAI,QAAQ;AAC7C,UAAM,WACJ,WAAW,YAAY,KAAK,YAAY,KAAK,QAAQ;AACvD,UAAM,KAAK,aAAa,IAAI,UAAU,MAAM,UAAU,QAAQ;AAC9D,QAAI,MAAO,IAAG,OAAO,KAAK,KAAK;AAC/B,SAAK,YAAY,IAAI,GAAG,UAAU,EAAE;AACpC,SAAK,YAAY,IAAI,GAAG,MAAM,EAAE;AAChC,SAAK,YAAY,IAAI,GAAG,MAAM,EAAE;AAChC,eAAW,QAAQ,GAAG,QAAQ;AAC5B,YAAMC,SAAQ,KAAK,QAAQ,IAAI,IAAI,KAAK,oBAAI,IAAI;AAChD,MAAAA,OAAM,IAAI,EAAE;AACZ,WAAK,QAAQ,IAAI,MAAMA,MAAK;AAAA,IAC9B;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA,EAIA,aAAa,SAAqD;AAIhE,UAAM,YAAY,CAAC,MAAsB;AACvC,aACE,CAAC,CAAC,GAAG,cAAc,MAClB,QAAQ,IAAI,EAAE,cAAc,CAAC,KAAK,UAAU,EAAE,MAAM;AAAA,IAEzD;AAEA,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,KAAK,KAAK;AAAA,MACV,OAAO;AAAA,MACP,QAAQ,KAAK;AAAA,MACb,eAAe;AAAA,MACf,QAAQ;AAAA,QACN,iBAAiB,OACf,SAAS,EAAE,cAAc,CAAC,MAAM,kBAChC,UAAU,CAAC;AAAA;AAAA,QAEb,SAAS,OAAK;AACZ,YAAE,UAAU;AACZ,gBAAM,MAAM,EAAE,cAAc;AAC5B,cAAI,CAAC,IAAK,QAAO;AACjB,gBAAM,cAAwB,CAAC;AAC/B,qBAAW,KAAK,SAAS;AACvB,gBAAI,IAAI,WAAW,IAAI,GAAG,EAAG,QAAO;AACpC,gBAAI,EAAE,WAAW,MAAM,GAAG,GAAG;AAC3B,0BAAY,KAAK,CAAC;AAAA,YACpB;AAAA,UACF;AACA,cAAI,CAAC,EAAE,YAAY,EAAG,QAAO;AAC7B,gBAAM,KAAK,EAAE,QAAQ,cAAc,EAAE,UAAU;AAC/C,cAAI,CAAC,IAAI,OAAO,EAAG,QAAO;AAC1B,cAAI;AACF,iBAAK,YAAY,KAAK,EAAE,SAAS,CAAC;AAAA,UACpC,QAAQ;AACN,mBAAO;AAAA,UACT;AACA,qBAAW,KAAK,aAAa;AAC3B,oBAAQ,OAAO,CAAC;AAAA,UAClB;AACA,kBAAQ,IAAI,GAAG;AACf,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAM,SAA4B;AAChC,UAAM,UAAU,oBAAI,IAAY;AAChC,aAAS,SAAS,KAAK,aAAa,OAAO,CAAC;AAC5C,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,QAAQ,IAAe,YAAY,OAAoB;AAGrD,UAAM,EAAE,SAAS,IAAI;AACrB,UAAM,gBAA6B,CAAC;AACpC,QAAI,eAAe;AACnB,eAAW,WAAW;AAAA,MACpB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,GAAY;AACV,YAAM,OAAO,SAAS,OAAO;AAC7B,UAAI,CAAC,KAAM;AACX,iBAAW,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,IAAI,GAAG;AAC9C,YAAI,KAAK,WAAW,YAAY,GAAG;AACjC,cAAI,QAAQ,KAAK,YAAY,IAAI,GAAG;AACpC,cAAI,CAAC,OAAO;AACV,gBAAI,CAAC,UAAW;AAChB,gBAAI,aAAc;AAClB,2BAAe;AACf,iBAAK,KAAK;AACV,oBAAQ,KAAK,YAAY,IAAI,GAAG;AAChC,gBAAI,CAAC,MAAO;AAAA,UACd;AACA,wBAAc,KAAK,KAAK;AAAA,QAC1B;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,QACE,KACA,QACA,UACA;AAAA,EAQF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,OAAe;AACnB,WAAO,KAAK,QAAQ,IAAI,KAAK;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,YAAoB;AACtB,WAAO,KAAK,YAAY,IAAI,UAAU;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA,EAKA,CAAC,QAAQ;AACP,eAAW,CAAC,KAAK,EAAE,KAAK,KAAK,aAAa;AACxC,UAAI,QAAQ,GAAG,KAAM,OAAM;AAAA,IAC7B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,CAAC,QAAQ;AACP,eAAW,CAAC,KAAK,EAAE,KAAK,KAAK,aAAa;AACxC,UAAI,QAAQ,GAAG,KAAM,OAAM;AAAA,IAC7B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,CAAC,SAAS;AACR,UAAM,OAAO,oBAAI,IAAY;AAC7B,eAAW,MAAM,KAAK,YAAY,OAAO,GAAG;AAC1C,UAAI,KAAK,IAAI,GAAG,QAAQ,EAAG;AAC3B,WAAK,IAAI,GAAG,QAAQ;AACpB,YAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,CAAC,OAAO;AACN,eAAW,MAAM,KAAK,OAAO,GAAG;AAC9B,YAAM,GAAG;AACT,UAAI,GAAG,SAAS,GAAG,KAAM,OAAM,GAAG;AAAA,IACpC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,CAAC,OAAO;AAAA,IACN,WAAW;AAAA,IACX,mBAAmB;AAAA,EACrB,GAA2B;AACzB,UAAM,oBAAoB,cAAc;AAAA,MAAI,UAC1C,UAAU,OAAO,MAAM,KAAK,IAAI,CAAC;AAAA,IACnC;AACA,eAAW,MAAM,MAAM;AAErB,UAAI,WAAW,KAAK,OAAK,GAAG,OAAO,SAAS,CAAC,CAAC,GAAG;AAC/C,cAAM;AACN;AAAA,MACF;AAGA,UACE,cACI,IAAI,OAAK,MAAM,KAAK,CAAC,CAAC,EACvB,KAAK,OAAK,GAAG,KAAK,SAAS,CAAC,CAAC,GAChC;AACA,cAAM;AACN;AAAA,MACF;AAEA,UACE,GAAG,KAAK,KAAK,SAAO,mBAAmB,KAAK,QAAM,GAAG,GAAG,CAAC,CAAC,GAC1D;AACA,cAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAM,IACJ,WAKA,YAAY,OACZ;AACA,UAAM,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,KAAK,YAAY,OAAO,CAAC;AACnD,QAAI,CAAC,IAAI;AACP,YAAM,MAAM,wBAAwB,QAAW,KAAK,GAAG;AAAA,IACzD;AAEA,WAAO,SAAuB;AAAA,MAC5B,OAAO,CAAC,IAAI,GAAG,IAAI;AAAA,MACnB,SAAS,CAAAC,QAAM,KAAK,QAAQA,KAAI,SAAS;AAAA,MACzC,OAAO,OAAOA,KAAI,QAAQ,GAAG,eAC3B,MAAM,UAAUA,KAAI,QAAQ,UAAU;AAAA,MACxC,SAAS,CAACA,KAAI,OAAO,SAAS,KAAK,QAAQA,KAAI,OAAO,IAAI;AAAA,IAC5D,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,QACE,WAKA,YAAY,OACZ;AACA,UAAM,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,KAAK,YAAY,OAAO,CAAC;AACnD,QAAI,CAAC,IAAI;AACP,YAAM,MAAM,wBAAwB,QAAW,KAAK,GAAG;AAAA,IACzD;AAEA,WAAO,aAA2B;AAAA,MAChC,OAAO,CAAC,IAAI,GAAG,IAAI;AAAA,MACnB,SAAS,CAAAA,QAAM,KAAK,QAAQA,KAAI,SAAS;AAAA,MACzC,OAAO,CAACA,KAAI,QAAQ,GAAG,eACrB,UAAUA,KAAI,QAAQ,UAAU;AAAA,MAClC,SAAS,CAACA,KAAI,OAAO,SAAS,KAAK,QAAQA,KAAI,OAAO,IAAI;AAAA,IAC5D,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,UACL,aACA,UAA2B,EAAE,MAAM,CAAC,EAAE,GACtC;AACA,QAAI;AACF,UACE,CAAC;AAAA,QACC,QAAQ,aAAa,qBAAqB;AAAA,MAC5C,EAAE,OAAO,GACT;AACA;AAAA,MACF;AAAA,IACF,QAAQ;AACN;AAAA,IACF;AACA,UAAM,EAAE,OAAO,CAAC,EAAE,IAAI;AACtB,WAAO,IAAI,UAAS,aAAa,EAAE,GAAG,SAAS,KAAK,CAAC;AAAA,EACvD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,KACL,aACA,UAA2B,EAAE,MAAM,CAAC,EAAE,GACtC;AACA,UAAM,EAAE,OAAO,CAAC,EAAE,IAAI;AACtB,WAAO,IAAI,UAAS,aAAa,EAAE,GAAG,SAAS,KAAK,CAAC;AAAA,EACvD;AACF;AAEO,IAAM,iBAAiB,oBAAI,IAAuB;AAKlD,IAAM,YAAN,MAAgB;AAAA,EACrB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,SAAmB,CAAC;AAAA,EACpB;AAAA,EACA;AAAA,EAEA,YAAY,MAAc,UAAoB,UAAkB;AAC9D,SAAK,KAAK,eAAe,CAAC,aAAa,IAAI,CAAC;AAC5C,mBAAe,IAAI,UAAU,IAAI;AACjC,SAAK,OAAO;AACZ,SAAK,WAAW;AAChB,SAAK,WAAW;AAChB,SAAK,OAAO,SAAS,QAAQ;AAAA,EAC/B;AAAA,EAEA,IAAI,OAAiB;AACnB,QAAI,KAAK,OAAO;AACd,aAAO,KAAK;AAAA,IACd;AACA,SAAK,QAAQ,CAAC,KAAK,MAAM,KAAK,MAAM,KAAK,QAAQ;AACjD,WAAO,KAAK;AAAA,EACd;AACF;;;AEppBA,SAAS,SAAS,WAAAC,gBAAe;AAC1B,IAAM,SAAS,WAAW,MAAY;AAC3C,OAAK,OAAOA,SAAQ,IAAI,GAAG,QAAO;AAChC,UAAM;AACN,UAAM,KAAK,QAAQ,IAAI;AACvB,QAAI,OAAO,MAAM;AACf;IACF,OAAO;AACL,aAAO;IACT;EACF;AACF;",
-  "names": ["s", "d", "n", "group", "ws", "resolve"]
-}

package/chunk-JQRUGUZ3.js

@@ -1,512 +0,0 @@
-var global = globalThis;
-import {Buffer} from "node:buffer";
-import {setImmediate, clearImmediate} from "node:timers";
-import {createRequire as _vlt_createRequire} from 'node:module';
-var require = _vlt_createRequire(import.meta.filename);
-
-// ../../node_modules/.pnpm/chalk@5.3.0/node_modules/chalk/source/vendor/ansi-styles/index.js
-var ANSI_BACKGROUND_OFFSET = 10;
-var wrapAnsi16 = (offset = 0) => (code) => `\x1B[${code + offset}m`;
-var wrapAnsi256 = (offset = 0) => (code) => `\x1B[${38 + offset};5;${code}m`;
-var wrapAnsi16m = (offset = 0) => (red, green, blue) => `\x1B[${38 + offset};2;${red};${green};${blue}m`;
-var styles = {
-  modifier: {
-    reset: [0, 0],
-    // 21 isn't widely supported and 22 does the same thing
-    bold: [1, 22],
-    dim: [2, 22],
-    italic: [3, 23],
-    underline: [4, 24],
-    overline: [53, 55],
-    inverse: [7, 27],
-    hidden: [8, 28],
-    strikethrough: [9, 29]
-  },
-  color: {
-    black: [30, 39],
-    red: [31, 39],
-    green: [32, 39],
-    yellow: [33, 39],
-    blue: [34, 39],
-    magenta: [35, 39],
-    cyan: [36, 39],
-    white: [37, 39],
-    // Bright color
-    blackBright: [90, 39],
-    gray: [90, 39],
-    // Alias of `blackBright`
-    grey: [90, 39],
-    // Alias of `blackBright`
-    redBright: [91, 39],
-    greenBright: [92, 39],
-    yellowBright: [93, 39],
-    blueBright: [94, 39],
-    magentaBright: [95, 39],
-    cyanBright: [96, 39],
-    whiteBright: [97, 39]
-  },
-  bgColor: {
-    bgBlack: [40, 49],
-    bgRed: [41, 49],
-    bgGreen: [42, 49],
-    bgYellow: [43, 49],
-    bgBlue: [44, 49],
-    bgMagenta: [45, 49],
-    bgCyan: [46, 49],
-    bgWhite: [47, 49],
-    // Bright color
-    bgBlackBright: [100, 49],
-    bgGray: [100, 49],
-    // Alias of `bgBlackBright`
-    bgGrey: [100, 49],
-    // Alias of `bgBlackBright`
-    bgRedBright: [101, 49],
-    bgGreenBright: [102, 49],
-    bgYellowBright: [103, 49],
-    bgBlueBright: [104, 49],
-    bgMagentaBright: [105, 49],
-    bgCyanBright: [106, 49],
-    bgWhiteBright: [107, 49]
-  }
-};
-var modifierNames = Object.keys(styles.modifier);
-var foregroundColorNames = Object.keys(styles.color);
-var backgroundColorNames = Object.keys(styles.bgColor);
-var colorNames = [...foregroundColorNames, ...backgroundColorNames];
-function assembleStyles() {
-  const codes = /* @__PURE__ */ new Map();
-  for (const [groupName, group] of Object.entries(styles)) {
-    for (const [styleName, style] of Object.entries(group)) {
-      styles[styleName] = {
-        open: `\x1B[${style[0]}m`,
-        close: `\x1B[${style[1]}m`
-      };
-      group[styleName] = styles[styleName];
-      codes.set(style[0], style[1]);
-    }
-    Object.defineProperty(styles, groupName, {
-      value: group,
-      enumerable: false
-    });
-  }
-  Object.defineProperty(styles, "codes", {
-    value: codes,
-    enumerable: false
-  });
-  styles.color.close = "\x1B[39m";
-  styles.bgColor.close = "\x1B[49m";
-  styles.color.ansi = wrapAnsi16();
-  styles.color.ansi256 = wrapAnsi256();
-  styles.color.ansi16m = wrapAnsi16m();
-  styles.bgColor.ansi = wrapAnsi16(ANSI_BACKGROUND_OFFSET);
-  styles.bgColor.ansi256 = wrapAnsi256(ANSI_BACKGROUND_OFFSET);
-  styles.bgColor.ansi16m = wrapAnsi16m(ANSI_BACKGROUND_OFFSET);
-  Object.defineProperties(styles, {
-    rgbToAnsi256: {
-      value(red, green, blue) {
-        if (red === green && green === blue) {
-          if (red < 8) {
-            return 16;
-          }
-          if (red > 248) {
-            return 231;
-          }
-          return Math.round((red - 8) / 247 * 24) + 232;
-        }
-        return 16 + 36 * Math.round(red / 255 * 5) + 6 * Math.round(green / 255 * 5) + Math.round(blue / 255 * 5);
-      },
-      enumerable: false
-    },
-    hexToRgb: {
-      value(hex) {
-        const matches = /[a-f\d]{6}|[a-f\d]{3}/i.exec(hex.toString(16));
-        if (!matches) {
-          return [0, 0, 0];
-        }
-        let [colorString] = matches;
-        if (colorString.length === 3) {
-          colorString = [...colorString].map((character) => character + character).join("");
-        }
-        const integer = Number.parseInt(colorString, 16);
-        return [
-          /* eslint-disable no-bitwise */
-          integer >> 16 & 255,
-          integer >> 8 & 255,
-          integer & 255
-          /* eslint-enable no-bitwise */
-        ];
-      },
-      enumerable: false
-    },
-    hexToAnsi256: {
-      value: (hex) => styles.rgbToAnsi256(...styles.hexToRgb(hex)),
-      enumerable: false
-    },
-    ansi256ToAnsi: {
-      value(code) {
-        if (code < 8) {
-          return 30 + code;
-        }
-        if (code < 16) {
-          return 90 + (code - 8);
-        }
-        let red;
-        let green;
-        let blue;
-        if (code >= 232) {
-          red = ((code - 232) * 10 + 8) / 255;
-          green = red;
-          blue = red;
-        } else {
-          code -= 16;
-          const remainder = code % 36;
-          red = Math.floor(code / 36) / 5;
-          green = Math.floor(remainder / 6) / 5;
-          blue = remainder % 6 / 5;
-        }
-        const value = Math.max(red, green, blue) * 2;
-        if (value === 0) {
-          return 30;
-        }
-        let result = 30 + (Math.round(blue) << 2 | Math.round(green) << 1 | Math.round(red));
-        if (value === 2) {
-          result += 60;
-        }
-        return result;
-      },
-      enumerable: false
-    },
-    rgbToAnsi: {
-      value: (red, green, blue) => styles.ansi256ToAnsi(styles.rgbToAnsi256(red, green, blue)),
-      enumerable: false
-    },
-    hexToAnsi: {
-      value: (hex) => styles.ansi256ToAnsi(styles.hexToAnsi256(hex)),
-      enumerable: false
-    }
-  });
-  return styles;
-}
-var ansiStyles = assembleStyles();
-var ansi_styles_default = ansiStyles;
-
-// ../../node_modules/.pnpm/chalk@5.3.0/node_modules/chalk/source/vendor/supports-color/index.js
-import process from "node:process";
-import os from "node:os";
-import tty from "node:tty";
-function hasFlag(flag, argv = globalThis.Deno ? globalThis.Deno.args : process.argv) {
-  const prefix = flag.startsWith("-") ? "" : flag.length === 1 ? "-" : "--";
-  const position = argv.indexOf(prefix + flag);
-  const terminatorPosition = argv.indexOf("--");
-  return position !== -1 && (terminatorPosition === -1 || position < terminatorPosition);
-}
-var { env } = process;
-var flagForceColor;
-if (hasFlag("no-color") || hasFlag("no-colors") || hasFlag("color=false") || hasFlag("color=never")) {
-  flagForceColor = 0;
-} else if (hasFlag("color") || hasFlag("colors") || hasFlag("color=true") || hasFlag("color=always")) {
-  flagForceColor = 1;
-}
-function envForceColor() {
-  if ("FORCE_COLOR" in env) {
-    if (env.FORCE_COLOR === "true") {
-      return 1;
-    }
-    if (env.FORCE_COLOR === "false") {
-      return 0;
-    }
-    return env.FORCE_COLOR.length === 0 ? 1 : Math.min(Number.parseInt(env.FORCE_COLOR, 10), 3);
-  }
-}
-function translateLevel(level) {
-  if (level === 0) {
-    return false;
-  }
-  return {
-    level,
-    hasBasic: true,
-    has256: level >= 2,
-    has16m: level >= 3
-  };
-}
-function _supportsColor(haveStream, { streamIsTTY, sniffFlags = true } = {}) {
-  const noFlagForceColor = envForceColor();
-  if (noFlagForceColor !== void 0) {
-    flagForceColor = noFlagForceColor;
-  }
-  const forceColor = sniffFlags ? flagForceColor : noFlagForceColor;
-  if (forceColor === 0) {
-    return 0;
-  }
-  if (sniffFlags) {
-    if (hasFlag("color=16m") || hasFlag("color=full") || hasFlag("color=truecolor")) {
-      return 3;
-    }
-    if (hasFlag("color=256")) {
-      return 2;
-    }
-  }
-  if ("TF_BUILD" in env && "AGENT_NAME" in env) {
-    return 1;
-  }
-  if (haveStream && !streamIsTTY && forceColor === void 0) {
-    return 0;
-  }
-  const min = forceColor || 0;
-  if (env.TERM === "dumb") {
-    return min;
-  }
-  if (process.platform === "win32") {
-    const osRelease = os.release().split(".");
-    if (Number(osRelease[0]) >= 10 && Number(osRelease[2]) >= 10586) {
-      return Number(osRelease[2]) >= 14931 ? 3 : 2;
-    }
-    return 1;
-  }
-  if ("CI" in env) {
-    if ("GITHUB_ACTIONS" in env || "GITEA_ACTIONS" in env) {
-      return 3;
-    }
-    if (["TRAVIS", "CIRCLECI", "APPVEYOR", "GITLAB_CI", "BUILDKITE", "DRONE"].some((sign) => sign in env) || env.CI_NAME === "codeship") {
-      return 1;
-    }
-    return min;
-  }
-  if ("TEAMCITY_VERSION" in env) {
-    return /^(9\.(0*[1-9]\d*)\.|\d{2,}\.)/.test(env.TEAMCITY_VERSION) ? 1 : 0;
-  }
-  if (env.COLORTERM === "truecolor") {
-    return 3;
-  }
-  if (env.TERM === "xterm-kitty") {
-    return 3;
-  }
-  if ("TERM_PROGRAM" in env) {
-    const version = Number.parseInt((env.TERM_PROGRAM_VERSION || "").split(".")[0], 10);
-    switch (env.TERM_PROGRAM) {
-      case "iTerm.app": {
-        return version >= 3 ? 3 : 2;
-      }
-      case "Apple_Terminal": {
-        return 2;
-      }
-    }
-  }
-  if (/-256(color)?$/i.test(env.TERM)) {
-    return 2;
-  }
-  if (/^screen|^xterm|^vt100|^vt220|^rxvt|color|ansi|cygwin|linux/i.test(env.TERM)) {
-    return 1;
-  }
-  if ("COLORTERM" in env) {
-    return 1;
-  }
-  return min;
-}
-function createSupportsColor(stream, options = {}) {
-  const level = _supportsColor(stream, {
-    streamIsTTY: stream && stream.isTTY,
-    ...options
-  });
-  return translateLevel(level);
-}
-var supportsColor = {
-  stdout: createSupportsColor({ isTTY: tty.isatty(1) }),
-  stderr: createSupportsColor({ isTTY: tty.isatty(2) })
-};
-var supports_color_default = supportsColor;
-
-// ../../node_modules/.pnpm/chalk@5.3.0/node_modules/chalk/source/utilities.js
-function stringReplaceAll(string, substring, replacer) {
-  let index = string.indexOf(substring);
-  if (index === -1) {
-    return string;
-  }
-  const substringLength = substring.length;
-  let endIndex = 0;
-  let returnValue = "";
-  do {
-    returnValue += string.slice(endIndex, index) + substring + replacer;
-    endIndex = index + substringLength;
-    index = string.indexOf(substring, endIndex);
-  } while (index !== -1);
-  returnValue += string.slice(endIndex);
-  return returnValue;
-}
-function stringEncaseCRLFWithFirstIndex(string, prefix, postfix, index) {
-  let endIndex = 0;
-  let returnValue = "";
-  do {
-    const gotCR = string[index - 1] === "\r";
-    returnValue += string.slice(endIndex, gotCR ? index - 1 : index) + prefix + (gotCR ? "\r\n" : "\n") + postfix;
-    endIndex = index + 1;
-    index = string.indexOf("\n", endIndex);
-  } while (index !== -1);
-  returnValue += string.slice(endIndex);
-  return returnValue;
-}
-
-// ../../node_modules/.pnpm/chalk@5.3.0/node_modules/chalk/source/index.js
-var { stdout: stdoutColor, stderr: stderrColor } = supports_color_default;
-var GENERATOR = Symbol("GENERATOR");
-var STYLER = Symbol("STYLER");
-var IS_EMPTY = Symbol("IS_EMPTY");
-var levelMapping = [
-  "ansi",
-  "ansi",
-  "ansi256",
-  "ansi16m"
-];
-var styles2 = /* @__PURE__ */ Object.create(null);
-var applyOptions = (object, options = {}) => {
-  if (options.level && !(Number.isInteger(options.level) && options.level >= 0 && options.level <= 3)) {
-    throw new Error("The `level` option should be an integer from 0 to 3");
-  }
-  const colorLevel = stdoutColor ? stdoutColor.level : 0;
-  object.level = options.level === void 0 ? colorLevel : options.level;
-};
-var Chalk = class {
-  constructor(options) {
-    return chalkFactory(options);
-  }
-};
-var chalkFactory = (options) => {
-  const chalk2 = (...strings) => strings.join(" ");
-  applyOptions(chalk2, options);
-  Object.setPrototypeOf(chalk2, createChalk.prototype);
-  return chalk2;
-};
-function createChalk(options) {
-  return chalkFactory(options);
-}
-Object.setPrototypeOf(createChalk.prototype, Function.prototype);
-for (const [styleName, style] of Object.entries(ansi_styles_default)) {
-  styles2[styleName] = {
-    get() {
-      const builder = createBuilder(this, createStyler(style.open, style.close, this[STYLER]), this[IS_EMPTY]);
-      Object.defineProperty(this, styleName, { value: builder });
-      return builder;
-    }
-  };
-}
-styles2.visible = {
-  get() {
-    const builder = createBuilder(this, this[STYLER], true);
-    Object.defineProperty(this, "visible", { value: builder });
-    return builder;
-  }
-};
-var getModelAnsi = (model, level, type, ...arguments_) => {
-  if (model === "rgb") {
-    if (level === "ansi16m") {
-      return ansi_styles_default[type].ansi16m(...arguments_);
-    }
-    if (level === "ansi256") {
-      return ansi_styles_default[type].ansi256(ansi_styles_default.rgbToAnsi256(...arguments_));
-    }
-    return ansi_styles_default[type].ansi(ansi_styles_default.rgbToAnsi(...arguments_));
-  }
-  if (model === "hex") {
-    return getModelAnsi("rgb", level, type, ...ansi_styles_default.hexToRgb(...arguments_));
-  }
-  return ansi_styles_default[type][model](...arguments_);
-};
-var usedModels = ["rgb", "hex", "ansi256"];
-for (const model of usedModels) {
-  styles2[model] = {
-    get() {
-      const { level } = this;
-      return function(...arguments_) {
-        const styler = createStyler(getModelAnsi(model, levelMapping[level], "color", ...arguments_), ansi_styles_default.color.close, this[STYLER]);
-        return createBuilder(this, styler, this[IS_EMPTY]);
-      };
-    }
-  };
-  const bgModel = "bg" + model[0].toUpperCase() + model.slice(1);
-  styles2[bgModel] = {
-    get() {
-      const { level } = this;
-      return function(...arguments_) {
-        const styler = createStyler(getModelAnsi(model, levelMapping[level], "bgColor", ...arguments_), ansi_styles_default.bgColor.close, this[STYLER]);
-        return createBuilder(this, styler, this[IS_EMPTY]);
-      };
-    }
-  };
-}
-var proto = Object.defineProperties(() => {
-}, {
-  ...styles2,
-  level: {
-    enumerable: true,
-    get() {
-      return this[GENERATOR].level;
-    },
-    set(level) {
-      this[GENERATOR].level = level;
-    }
-  }
-});
-var createStyler = (open, close, parent) => {
-  let openAll;
-  let closeAll;
-  if (parent === void 0) {
-    openAll = open;
-    closeAll = close;
-  } else {
-    openAll = parent.openAll + open;
-    closeAll = close + parent.closeAll;
-  }
-  return {
-    open,
-    close,
-    openAll,
-    closeAll,
-    parent
-  };
-};
-var createBuilder = (self, _styler, _isEmpty) => {
-  const builder = (...arguments_) => applyStyle(builder, arguments_.length === 1 ? "" + arguments_[0] : arguments_.join(" "));
-  Object.setPrototypeOf(builder, proto);
-  builder[GENERATOR] = self;
-  builder[STYLER] = _styler;
-  builder[IS_EMPTY] = _isEmpty;
-  return builder;
-};
-var applyStyle = (self, string) => {
-  if (self.level <= 0 || !string) {
-    return self[IS_EMPTY] ? "" : string;
-  }
-  let styler = self[STYLER];
-  if (styler === void 0) {
-    return string;
-  }
-  const { openAll, closeAll } = styler;
-  if (string.includes("\x1B")) {
-    while (styler !== void 0) {
-      string = stringReplaceAll(string, styler.close, styler.open);
-      styler = styler.parent;
-    }
-  }
-  const lfIndex = string.indexOf("\n");
-  if (lfIndex !== -1) {
-    string = stringEncaseCRLFWithFirstIndex(string, closeAll, openAll, lfIndex);
-  }
-  return openAll + string + closeAll;
-};
-Object.defineProperties(createChalk.prototype, styles2);
-var chalk = createChalk();
-var chalkStderr = createChalk({ level: stderrColor ? stderrColor.level : 0 });
-var source_default = chalk;
-
-export {
-  modifierNames,
-  foregroundColorNames,
-  backgroundColorNames,
-  colorNames,
-  stdoutColor,
-  stderrColor,
-  Chalk,
-  chalkStderr,
-  source_default
-};
-//# sourceMappingURL=chunk-JQRUGUZ3.js.map