{
  "version": 3,
  "sources": ["../../node_modules/chalk/source/vendor/ansi-styles/index.js", "../../node_modules/chalk/source/vendor/supports-color/index.js", "../../node_modules/chalk/source/utilities.js", "../../node_modules/chalk/source/index.js", "../../node_modules/balanced-match/src/index.ts", "../../node_modules/brace-expansion/src/index.ts", "../../node_modules/minimatch/src/assert-valid-pattern.ts", "../../node_modules/minimatch/src/brace-expressions.ts", "../../node_modules/minimatch/src/unescape.ts", "../../node_modules/minimatch/src/ast.ts", "../../node_modules/minimatch/src/escape.ts", "../../node_modules/minimatch/src/index.ts", "../../src/console.ts", "../../src/fail.ts", "../../src/package.ts", "../../node_modules/polite-json/src/index.ts", "../../src/sources.ts", "../../src/valid-dialects.ts", "../../src/valid-exclude.ts", "../../src/add-dot.ts", "../../src/valid-external-export.ts", "../../src/resolve-export.ts", "../../src/valid-exports.ts", "../../src/valid-extra-dialects.ts", "../../src/valid-imports.ts", "../../src/valid-project.ts", "../../src/valid-compiler.ts", "../../src/config.ts", "../../node_modules/glob/node_modules/balanced-match/src/index.ts", "../../node_modules/glob/node_modules/brace-expansion/src/index.ts", "../../node_modules/glob/node_modules/minimatch/src/assert-valid-pattern.ts", "../../node_modules/glob/node_modules/minimatch/src/brace-expressions.ts", "../../node_modules/glob/node_modules/minimatch/src/unescape.ts", "../../node_modules/glob/node_modules/minimatch/src/ast.ts", "../../node_modules/glob/node_modules/minimatch/src/escape.ts", "../../node_modules/glob/node_modules/minimatch/src/index.ts", "../../node_modules/glob/src/glob.ts", "../../node_modules/glob/node_modules/lru-cache/src/index.ts", "../../node_modules/glob/node_modules/path-scurry/src/index.ts", "../../node_modules/glob/node_modules/minipass/src/index.ts", "../../node_modules/glob/src/pattern.ts", "../../node_modules/glob/src/ignore.ts", "../../node_modules/glob/src/processor.ts", "../../node_modules/glob/src/walker.ts", "../../node_modules/glob/src/has-magic.ts", "../../node_modules/glob/src/index.ts", "../../node_modules/mkdirp/src/mkdirp-manual.ts", "../../node_modules/mkdirp/src/opts-arg.ts", "../../node_modules/mkdirp/src/mkdirp-native.ts", "../../node_modules/mkdirp/src/find-made.ts", "../../node_modules/mkdirp/src/path-arg.ts", "../../node_modules/mkdirp/src/use-native.ts", "../../node_modules/mkdirp/src/index.ts", "../../node_modules/sync-content/src/index.ts", "../../node_modules/lru-cache/src/index.ts", "../../node_modules/path-scurry/src/index.ts", "../../node_modules/minipass/src/index.ts", "../../node_modules/rimraf/src/opt-arg.ts", "../../node_modules/rimraf/src/path-arg.ts", "../../node_modules/rimraf/src/fs.ts", "../../node_modules/rimraf/src/rimraf-posix.ts", "../../node_modules/rimraf/src/readdir-or-error.ts", "../../node_modules/rimraf/src/error.ts", "../../node_modules/rimraf/src/ignore-enoent.ts", "../../node_modules/rimraf/src/rimraf-windows.ts", "../../node_modules/rimraf/src/fix-eperm.ts", "../../node_modules/rimraf/src/retry-busy.ts", "../../node_modules/rimraf/src/rimraf-move-remove.ts", "../../node_modules/rimraf/src/default-tmp.ts", "../../node_modules/rimraf/src/rimraf-manual.ts", "../../node_modules/rimraf/src/rimraf-native.ts", "../../node_modules/rimraf/src/use-native.ts", "../../node_modules/rimraf/src/index.ts", "../../src/bins.ts", "../../src/build-commonjs.ts", "../../src/set-folder-dialect.ts", "../../src/built-imports.ts", "../../src/tsconfig.ts", "../../src/polyfills.ts", "../../src/read-typescript-config.ts", "../../node_modules/walk-up-path/src/index.ts", "../../node_modules/jsonc-simple-parser/dist/detokenize.js", "../../node_modules/jsonc-simple-parser/dist/tokenize/context.js", "../../node_modules/reghex/src/codegen.js", "../../node_modules/reghex/src/parser.js", "../../node_modules/reghex/src/core.js", "../../node_modules/jsonc-simple-parser/dist/utils.js", "../../node_modules/jsonc-simple-parser/dist/tokenize/grammar.js", "../../node_modules/jsonc-simple-parser/dist/tokenize/tokens.js", "../../node_modules/jsonc-simple-parser/dist/strip/tokens.js", "../../node_modules/jsonc-simple-parser/dist/strip/parser.js", "../../node_modules/jsonc-simple-parser/dist/strip/index.js", "../../node_modules/jsonc-simple-parser/dist/parse.js", "../../node_modules/jsonc-simple-parser/dist/tokenize/parser.js", "../../node_modules/jsonc-simple-parser/dist/tokenize/index.js", "../../node_modules/jsonc-simple-parser/dist/lookup.js", "../../node_modules/jsonc-simple-parser/dist/stringify.js", "../../node_modules/jsonc-simple-parser/dist/validate.js", "../../node_modules/jsonc-simple-parser/dist/index.js", "../../src/prevent-verbatim-module-syntax.ts", "../../src/unbuilt-imports.ts", "../../node_modules/resolve-import/src/get-conditional-values-list.ts", "../../node_modules/resolve-import/src/get-all-conditional-values.ts", "../../node_modules/resolve-import/src/get-unique-condition-sets.ts", "../../node_modules/resolve-import/src/resolve-all-local-imports.ts", "../../node_modules/resolve-import/src/resolve-import-sync.ts", "../../node_modules/resolve-import/src/file-exists.ts", "../../node_modules/resolve-import/src/is-windows.ts", "../../node_modules/resolve-import/src/is-relative-require.ts", "../../node_modules/resolve-import/src/find-dep-package.ts", "../../node_modules/resolve-import/src/read-json.ts", "../../node_modules/resolve-import/src/read-pkg.ts", "../../node_modules/resolve-import/src/find-star-match.ts", "../../node_modules/resolve-import/src/resolve-conditional-value.ts", "../../node_modules/resolve-import/src/resolve-export.ts", "../../node_modules/resolve-import/src/to-file-url.ts", "../../node_modules/resolve-import/src/to-path.ts", "../../node_modules/resolve-import/src/resolve-import-async.ts", "../../node_modules/resolve-import/src/resolve-dependency-export.ts", "../../node_modules/resolve-import/src/resolve-package-import.ts", "../../node_modules/resolve-import/src/errors.ts", "../../node_modules/resolve-import/src/resolve-all-exports.ts", "../../node_modules/resolve-import/src/get-named-exports-list.ts", "../../node_modules/resolve-import/src/star-glob.ts", "../../src/self-link.ts", "../../src/build-fail.ts", "../../src/if-exist.ts", "../../node_modules/resolve-import/src/resolve-import-async.ts", "../../node_modules/resolve-import/src/resolve-import-sync.ts", "../../node_modules/resolve-import/src/file-exists.ts", "../../node_modules/resolve-import/src/is-windows.ts", "../../node_modules/resolve-import/src/is-relative-require.ts", "../../node_modules/resolve-import/src/resolve-dependency-export-sync.ts", "../../node_modules/resolve-import/src/find-dep-package.ts", "../../node_modules/resolve-import/node_modules/walk-up-path/src/index.ts", "../../node_modules/resolve-import/src/read-json.ts", "../../node_modules/resolve-import/src/read-pkg.ts", "../../node_modules/resolve-import/src/find-star-match.ts", "../../node_modules/resolve-import/src/resolve-conditional-value.ts", "../../node_modules/resolve-import/src/resolve-export.ts", "../../node_modules/resolve-import/src/resolve-package-import-sync.ts", "../../node_modules/resolve-import/src/to-file-url.ts", "../../node_modules/resolve-import/src/to-path.ts", "../../node_modules/resolve-import/src/errors.ts", "../../node_modules/resolve-import/src/resolve-dependency-export.ts", "../../node_modules/resolve-import/src/resolve-package-import.ts", "../../src/which-tsc.ts", "../../src/build-esm.ts", "../../src/clean-build-tmp.ts", "../../src/dialects.ts", "../../src/write-package.ts", "../../src/build-live-esm.ts", "../../src/build-live-commonjs.ts", "../../src/build.ts", "../../src/exports.ts", "../../src/usage.ts", "../../src/watch.ts", "../../node_modules/chokidar/esm/index.js", "../../node_modules/readdirp/esm/index.js", "../../node_modules/chokidar/esm/handler.js", "../../src/index.ts"],
  "sourcesContent": ["const ANSI_BACKGROUND_OFFSET = 10;\n\nconst wrapAnsi16 = (offset = 0) => code => `\\u001B[${code + offset}m`;\n\nconst wrapAnsi256 = (offset = 0) => code => `\\u001B[${38 + offset};5;${code}m`;\n\nconst wrapAnsi16m = (offset = 0) => (red, green, blue) => `\\u001B[${38 + offset};2;${red};${green};${blue}m`;\n\nconst styles = {\n\tmodifier: {\n\t\treset: [0, 0],\n\t\t// 21 isn't widely supported and 22 does the same thing\n\t\tbold: [1, 22],\n\t\tdim: [2, 22],\n\t\titalic: [3, 23],\n\t\tunderline: [4, 24],\n\t\toverline: [53, 55],\n\t\tinverse: [7, 27],\n\t\thidden: [8, 28],\n\t\tstrikethrough: [9, 29],\n\t},\n\tcolor: {\n\t\tblack: [30, 39],\n\t\tred: [31, 39],\n\t\tgreen: [32, 39],\n\t\tyellow: [33, 39],\n\t\tblue: [34, 39],\n\t\tmagenta: [35, 39],\n\t\tcyan: [36, 39],\n\t\twhite: [37, 39],\n\n\t\t// Bright color\n\t\tblackBright: [90, 39],\n\t\tgray: [90, 39], // Alias of `blackBright`\n\t\tgrey: [90, 39], // Alias of `blackBright`\n\t\tredBright: [91, 39],\n\t\tgreenBright: [92, 39],\n\t\tyellowBright: [93, 39],\n\t\tblueBright: [94, 39],\n\t\tmagentaBright: [95, 39],\n\t\tcyanBright: [96, 39],\n\t\twhiteBright: [97, 39],\n\t},\n\tbgColor: {\n\t\tbgBlack: [40, 49],\n\t\tbgRed: [41, 49],\n\t\tbgGreen: [42, 49],\n\t\tbgYellow: [43, 49],\n\t\tbgBlue: [44, 49],\n\t\tbgMagenta: [45, 49],\n\t\tbgCyan: [46, 49],\n\t\tbgWhite: [47, 49],\n\n\t\t// Bright color\n\t\tbgBlackBright: [100, 49],\n\t\tbgGray: [100, 49], // Alias of `bgBlackBright`\n\t\tbgGrey: [100, 49], // Alias of `bgBlackBright`\n\t\tbgRedBright: [101, 49],\n\t\tbgGreenBright: [102, 49],\n\t\tbgYellowBright: [103, 49],\n\t\tbgBlueBright: [104, 49],\n\t\tbgMagentaBright: [105, 49],\n\t\tbgCyanBright: [106, 49],\n\t\tbgWhiteBright: [107, 49],\n\t},\n};\n\nexport const modifierNames = Object.keys(styles.modifier);\nexport const foregroundColorNames = Object.keys(styles.color);\nexport const backgroundColorNames = Object.keys(styles.bgColor);\nexport const colorNames = [...foregroundColorNames, ...backgroundColorNames];\n\nfunction assembleStyles() {\n\tconst codes = new Map();\n\n\tfor (const [groupName, group] of Object.entries(styles)) {\n\t\tfor (const [styleName, style] of Object.entries(group)) {\n\t\t\tstyles[styleName] = {\n\t\t\t\topen: `\\u001B[${style[0]}m`,\n\t\t\t\tclose: `\\u001B[${style[1]}m`,\n\t\t\t};\n\n\t\t\tgroup[styleName] = styles[styleName];\n\n\t\t\tcodes.set(style[0], style[1]);\n\t\t}\n\n\t\tObject.defineProperty(styles, groupName, {\n\t\t\tvalue: group,\n\t\t\tenumerable: false,\n\t\t});\n\t}\n\n\tObject.defineProperty(styles, 'codes', {\n\t\tvalue: codes,\n\t\tenumerable: false,\n\t});\n\n\tstyles.color.close = '\\u001B[39m';\n\tstyles.bgColor.close = '\\u001B[49m';\n\n\tstyles.color.ansi = wrapAnsi16();\n\tstyles.color.ansi256 = wrapAnsi256();\n\tstyles.color.ansi16m = wrapAnsi16m();\n\tstyles.bgColor.ansi = wrapAnsi16(ANSI_BACKGROUND_OFFSET);\n\tstyles.bgColor.ansi256 = wrapAnsi256(ANSI_BACKGROUND_OFFSET);\n\tstyles.bgColor.ansi16m = wrapAnsi16m(ANSI_BACKGROUND_OFFSET);\n\n\t// From https://github.com/Qix-/color-convert/blob/3f0e0d4e92e235796ccb17f6e85c72094a651f49/conversions.js\n\tObject.defineProperties(styles, {\n\t\trgbToAnsi256: {\n\t\t\tvalue(red, green, blue) {\n\t\t\t\t// We use the extended greyscale palette here, with the exception of\n\t\t\t\t// black and white. normal palette only has 4 greyscale shades.\n\t\t\t\tif (red === green && green === blue) {\n\t\t\t\t\tif (red < 8) {\n\t\t\t\t\t\treturn 16;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (red > 248) {\n\t\t\t\t\t\treturn 231;\n\t\t\t\t\t}\n\n\t\t\t\t\treturn Math.round(((red - 8) / 247) * 24) + 232;\n\t\t\t\t}\n\n\t\t\t\treturn 16\n\t\t\t\t\t+ (36 * Math.round(red / 255 * 5))\n\t\t\t\t\t+ (6 * Math.round(green / 255 * 5))\n\t\t\t\t\t+ Math.round(blue / 255 * 5);\n\t\t\t},\n\t\t\tenumerable: false,\n\t\t},\n\t\thexToRgb: {\n\t\t\tvalue(hex) {\n\t\t\t\tconst matches = /[a-f\\d]{6}|[a-f\\d]{3}/i.exec(hex.toString(16));\n\t\t\t\tif (!matches) {\n\t\t\t\t\treturn [0, 0, 0];\n\t\t\t\t}\n\n\t\t\t\tlet [colorString] = matches;\n\n\t\t\t\tif (colorString.length === 3) {\n\t\t\t\t\tcolorString = [...colorString].map(character => character + character).join('');\n\t\t\t\t}\n\n\t\t\t\tconst integer = Number.parseInt(colorString, 16);\n\n\t\t\t\treturn [\n\t\t\t\t\t/* eslint-disable no-bitwise */\n\t\t\t\t\t(integer >> 16) & 0xFF,\n\t\t\t\t\t(integer >> 8) & 0xFF,\n\t\t\t\t\tinteger & 0xFF,\n\t\t\t\t\t/* eslint-enable no-bitwise */\n\t\t\t\t];\n\t\t\t},\n\t\t\tenumerable: false,\n\t\t},\n\t\thexToAnsi256: {\n\t\t\tvalue: hex => styles.rgbToAnsi256(...styles.hexToRgb(hex)),\n\t\t\tenumerable: false,\n\t\t},\n\t\tansi256ToAnsi: {\n\t\t\tvalue(code) {\n\t\t\t\tif (code < 8) {\n\t\t\t\t\treturn 30 + code;\n\t\t\t\t}\n\n\t\t\t\tif (code < 16) {\n\t\t\t\t\treturn 90 + (code - 8);\n\t\t\t\t}\n\n\t\t\t\tlet red;\n\t\t\t\tlet green;\n\t\t\t\tlet blue;\n\n\t\t\t\tif (code >= 232) {\n\t\t\t\t\tred = (((code - 232) * 10) + 8) / 255;\n\t\t\t\t\tgreen = red;\n\t\t\t\t\tblue = red;\n\t\t\t\t} else {\n\t\t\t\t\tcode -= 16;\n\n\t\t\t\t\tconst remainder = code % 36;\n\n\t\t\t\t\tred = Math.floor(code / 36) / 5;\n\t\t\t\t\tgreen = Math.floor(remainder / 6) / 5;\n\t\t\t\t\tblue = (remainder % 6) / 5;\n\t\t\t\t}\n\n\t\t\t\tconst value = Math.max(red, green, blue) * 2;\n\n\t\t\t\tif (value === 0) {\n\t\t\t\t\treturn 30;\n\t\t\t\t}\n\n\t\t\t\t// eslint-disable-next-line no-bitwise\n\t\t\t\tlet result = 30 + ((Math.round(blue) << 2) | (Math.round(green) << 1) | Math.round(red));\n\n\t\t\t\tif (value === 2) {\n\t\t\t\t\tresult += 60;\n\t\t\t\t}\n\n\t\t\t\treturn result;\n\t\t\t},\n\t\t\tenumerable: false,\n\t\t},\n\t\trgbToAnsi: {\n\t\t\tvalue: (red, green, blue) => styles.ansi256ToAnsi(styles.rgbToAnsi256(red, green, blue)),\n\t\t\tenumerable: false,\n\t\t},\n\t\thexToAnsi: {\n\t\t\tvalue: hex => styles.ansi256ToAnsi(styles.hexToAnsi256(hex)),\n\t\t\tenumerable: false,\n\t\t},\n\t});\n\n\treturn styles;\n}\n\nconst ansiStyles = assembleStyles();\n\nexport default ansiStyles;\n", "import process from 'node:process';\nimport os from 'node:os';\nimport tty from 'node:tty';\n\n// From: https://github.com/sindresorhus/has-flag/blob/main/index.js\n/// function hasFlag(flag, argv = globalThis.Deno?.args ?? process.argv) {\nfunction hasFlag(flag, argv = globalThis.Deno ? globalThis.Deno.args : process.argv) {\n\tconst prefix = flag.startsWith('-') ? '' : (flag.length === 1 ? '-' : '--');\n\tconst position = argv.indexOf(prefix + flag);\n\tconst terminatorPosition = argv.indexOf('--');\n\treturn position !== -1 && (terminatorPosition === -1 || position < terminatorPosition);\n}\n\nconst {env} = process;\n\nlet flagForceColor;\nif (\n\thasFlag('no-color')\n\t|| hasFlag('no-colors')\n\t|| hasFlag('color=false')\n\t|| hasFlag('color=never')\n) {\n\tflagForceColor = 0;\n} else if (\n\thasFlag('color')\n\t|| hasFlag('colors')\n\t|| hasFlag('color=true')\n\t|| hasFlag('color=always')\n) {\n\tflagForceColor = 1;\n}\n\nfunction envForceColor() {\n\tif ('FORCE_COLOR' in env) {\n\t\tif (env.FORCE_COLOR === 'true') {\n\t\t\treturn 1;\n\t\t}\n\n\t\tif (env.FORCE_COLOR === 'false') {\n\t\t\treturn 0;\n\t\t}\n\n\t\treturn env.FORCE_COLOR.length === 0 ? 1 : Math.min(Number.parseInt(env.FORCE_COLOR, 10), 3);\n\t}\n}\n\nfunction translateLevel(level) {\n\tif (level === 0) {\n\t\treturn false;\n\t}\n\n\treturn {\n\t\tlevel,\n\t\thasBasic: true,\n\t\thas256: level >= 2,\n\t\thas16m: level >= 3,\n\t};\n}\n\nfunction _supportsColor(haveStream, {streamIsTTY, sniffFlags = true} = {}) {\n\tconst noFlagForceColor = envForceColor();\n\tif (noFlagForceColor !== undefined) {\n\t\tflagForceColor = noFlagForceColor;\n\t}\n\n\tconst forceColor = sniffFlags ? flagForceColor : noFlagForceColor;\n\n\tif (forceColor === 0) {\n\t\treturn 0;\n\t}\n\n\tif (sniffFlags) {\n\t\tif (hasFlag('color=16m')\n\t\t\t|| hasFlag('color=full')\n\t\t\t|| hasFlag('color=truecolor')) {\n\t\t\treturn 3;\n\t\t}\n\n\t\tif (hasFlag('color=256')) {\n\t\t\treturn 2;\n\t\t}\n\t}\n\n\t// Check for Azure DevOps pipelines.\n\t// Has to be above the `!streamIsTTY` check.\n\tif ('TF_BUILD' in env && 'AGENT_NAME' in env) {\n\t\treturn 1;\n\t}\n\n\tif (haveStream && !streamIsTTY && forceColor === undefined) {\n\t\treturn 0;\n\t}\n\n\tconst min = forceColor || 0;\n\n\tif (env.TERM === 'dumb') {\n\t\treturn min;\n\t}\n\n\tif (process.platform === 'win32') {\n\t\t// Windows 10 build 10586 is the first Windows release that supports 256 colors.\n\t\t// Windows 10 build 14931 is the first release that supports 16m/TrueColor.\n\t\tconst osRelease = os.release().split('.');\n\t\tif (\n\t\t\tNumber(osRelease[0]) >= 10\n\t\t\t&& Number(osRelease[2]) >= 10_586\n\t\t) {\n\t\t\treturn Number(osRelease[2]) >= 14_931 ? 3 : 2;\n\t\t}\n\n\t\treturn 1;\n\t}\n\n\tif ('CI' in env) {\n\t\tif (['GITHUB_ACTIONS', 'GITEA_ACTIONS', 'CIRCLECI'].some(key => key in env)) {\n\t\t\treturn 3;\n\t\t}\n\n\t\tif (['TRAVIS', 'APPVEYOR', 'GITLAB_CI', 'BUILDKITE', 'DRONE'].some(sign => sign in env) || env.CI_NAME === 'codeship') {\n\t\t\treturn 1;\n\t\t}\n\n\t\treturn min;\n\t}\n\n\tif ('TEAMCITY_VERSION' in env) {\n\t\treturn /^(9\\.(0*[1-9]\\d*)\\.|\\d{2,}\\.)/.test(env.TEAMCITY_VERSION) ? 1 : 0;\n\t}\n\n\tif (env.COLORTERM === 'truecolor') {\n\t\treturn 3;\n\t}\n\n\tif (env.TERM === 'xterm-kitty') {\n\t\treturn 3;\n\t}\n\n\tif (env.TERM === 'xterm-ghostty') {\n\t\treturn 3;\n\t}\n\n\tif (env.TERM === 'wezterm') {\n\t\treturn 3;\n\t}\n\n\tif ('TERM_PROGRAM' in env) {\n\t\tconst version = Number.parseInt((env.TERM_PROGRAM_VERSION || '').split('.')[0], 10);\n\n\t\tswitch (env.TERM_PROGRAM) {\n\t\t\tcase 'iTerm.app': {\n\t\t\t\treturn version >= 3 ? 3 : 2;\n\t\t\t}\n\n\t\t\tcase 'Apple_Terminal': {\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\t// No default\n\t\t}\n\t}\n\n\tif (/-256(color)?$/i.test(env.TERM)) {\n\t\treturn 2;\n\t}\n\n\tif (/^screen|^xterm|^vt100|^vt220|^rxvt|color|ansi|cygwin|linux/i.test(env.TERM)) {\n\t\treturn 1;\n\t}\n\n\tif ('COLORTERM' in env) {\n\t\treturn 1;\n\t}\n\n\treturn min;\n}\n\nexport function createSupportsColor(stream, options = {}) {\n\tconst level = _supportsColor(stream, {\n\t\tstreamIsTTY: stream && stream.isTTY,\n\t\t...options,\n\t});\n\n\treturn translateLevel(level);\n}\n\nconst supportsColor = {\n\tstdout: createSupportsColor({isTTY: tty.isatty(1)}),\n\tstderr: createSupportsColor({isTTY: tty.isatty(2)}),\n};\n\nexport default supportsColor;\n", "// TODO: When targeting Node.js 16, use `String.prototype.replaceAll`.\nexport function stringReplaceAll(string, substring, replacer) {\n\tlet index = string.indexOf(substring);\n\tif (index === -1) {\n\t\treturn string;\n\t}\n\n\tconst substringLength = substring.length;\n\tlet endIndex = 0;\n\tlet returnValue = '';\n\tdo {\n\t\treturnValue += string.slice(endIndex, index) + substring + replacer;\n\t\tendIndex = index + substringLength;\n\t\tindex = string.indexOf(substring, endIndex);\n\t} while (index !== -1);\n\n\treturnValue += string.slice(endIndex);\n\treturn returnValue;\n}\n\nexport function stringEncaseCRLFWithFirstIndex(string, prefix, postfix, index) {\n\tlet endIndex = 0;\n\tlet returnValue = '';\n\tdo {\n\t\tconst gotCR = string[index - 1] === '\\r';\n\t\treturnValue += string.slice(endIndex, (gotCR ? index - 1 : index)) + prefix + (gotCR ? '\\r\\n' : '\\n') + postfix;\n\t\tendIndex = index + 1;\n\t\tindex = string.indexOf('\\n', endIndex);\n\t} while (index !== -1);\n\n\treturnValue += string.slice(endIndex);\n\treturn returnValue;\n}\n", "import ansiStyles from '#ansi-styles';\nimport supportsColor from '#supports-color';\nimport { // eslint-disable-line import/order\n\tstringReplaceAll,\n\tstringEncaseCRLFWithFirstIndex,\n} from './utilities.js';\n\nconst {stdout: stdoutColor, stderr: stderrColor} = supportsColor;\n\nconst GENERATOR = Symbol('GENERATOR');\nconst STYLER = Symbol('STYLER');\nconst IS_EMPTY = Symbol('IS_EMPTY');\n\n// `supportsColor.level` \u2192 `ansiStyles.color[name]` mapping\nconst levelMapping = [\n\t'ansi',\n\t'ansi',\n\t'ansi256',\n\t'ansi16m',\n];\n\nconst styles = Object.create(null);\n\nconst applyOptions = (object, options = {}) => {\n\tif (options.level && !(Number.isInteger(options.level) && options.level >= 0 && options.level <= 3)) {\n\t\tthrow new Error('The `level` option should be an integer from 0 to 3');\n\t}\n\n\t// Detect level if not set manually\n\tconst colorLevel = stdoutColor ? stdoutColor.level : 0;\n\tobject.level = options.level === undefined ? colorLevel : options.level;\n};\n\nexport class Chalk {\n\tconstructor(options) {\n\t\t// eslint-disable-next-line no-constructor-return\n\t\treturn chalkFactory(options);\n\t}\n}\n\nconst chalkFactory = options => {\n\tconst chalk = (...strings) => strings.join(' ');\n\tapplyOptions(chalk, options);\n\n\tObject.setPrototypeOf(chalk, createChalk.prototype);\n\n\treturn chalk;\n};\n\nfunction createChalk(options) {\n\treturn chalkFactory(options);\n}\n\nObject.setPrototypeOf(createChalk.prototype, Function.prototype);\n\nfor (const [styleName, style] of Object.entries(ansiStyles)) {\n\tstyles[styleName] = {\n\t\tget() {\n\t\t\tconst builder = createBuilder(this, createStyler(style.open, style.close, this[STYLER]), this[IS_EMPTY]);\n\t\t\tObject.defineProperty(this, styleName, {value: builder});\n\t\t\treturn builder;\n\t\t},\n\t};\n}\n\nstyles.visible = {\n\tget() {\n\t\tconst builder = createBuilder(this, this[STYLER], true);\n\t\tObject.defineProperty(this, 'visible', {value: builder});\n\t\treturn builder;\n\t},\n};\n\nconst getModelAnsi = (model, level, type, ...arguments_) => {\n\tif (model === 'rgb') {\n\t\tif (level === 'ansi16m') {\n\t\t\treturn ansiStyles[type].ansi16m(...arguments_);\n\t\t}\n\n\t\tif (level === 'ansi256') {\n\t\t\treturn ansiStyles[type].ansi256(ansiStyles.rgbToAnsi256(...arguments_));\n\t\t}\n\n\t\treturn ansiStyles[type].ansi(ansiStyles.rgbToAnsi(...arguments_));\n\t}\n\n\tif (model === 'hex') {\n\t\treturn getModelAnsi('rgb', level, type, ...ansiStyles.hexToRgb(...arguments_));\n\t}\n\n\treturn ansiStyles[type][model](...arguments_);\n};\n\nconst usedModels = ['rgb', 'hex', 'ansi256'];\n\nfor (const model of usedModels) {\n\tstyles[model] = {\n\t\tget() {\n\t\t\tconst {level} = this;\n\t\t\treturn function (...arguments_) {\n\t\t\t\tconst styler = createStyler(getModelAnsi(model, levelMapping[level], 'color', ...arguments_), ansiStyles.color.close, this[STYLER]);\n\t\t\t\treturn createBuilder(this, styler, this[IS_EMPTY]);\n\t\t\t};\n\t\t},\n\t};\n\n\tconst bgModel = 'bg' + model[0].toUpperCase() + model.slice(1);\n\tstyles[bgModel] = {\n\t\tget() {\n\t\t\tconst {level} = this;\n\t\t\treturn function (...arguments_) {\n\t\t\t\tconst styler = createStyler(getModelAnsi(model, levelMapping[level], 'bgColor', ...arguments_), ansiStyles.bgColor.close, this[STYLER]);\n\t\t\t\treturn createBuilder(this, styler, this[IS_EMPTY]);\n\t\t\t};\n\t\t},\n\t};\n}\n\nconst proto = Object.defineProperties(() => {}, {\n\t...styles,\n\tlevel: {\n\t\tenumerable: true,\n\t\tget() {\n\t\t\treturn this[GENERATOR].level;\n\t\t},\n\t\tset(level) {\n\t\t\tthis[GENERATOR].level = level;\n\t\t},\n\t},\n});\n\nconst createStyler = (open, close, parent) => {\n\tlet openAll;\n\tlet closeAll;\n\tif (parent === undefined) {\n\t\topenAll = open;\n\t\tcloseAll = close;\n\t} else {\n\t\topenAll = parent.openAll + open;\n\t\tcloseAll = close + parent.closeAll;\n\t}\n\n\treturn {\n\t\topen,\n\t\tclose,\n\t\topenAll,\n\t\tcloseAll,\n\t\tparent,\n\t};\n};\n\nconst createBuilder = (self, _styler, _isEmpty) => {\n\t// Single argument is hot path, implicit coercion is faster than anything\n\t// eslint-disable-next-line no-implicit-coercion\n\tconst builder = (...arguments_) => applyStyle(builder, (arguments_.length === 1) ? ('' + arguments_[0]) : arguments_.join(' '));\n\n\t// We alter the prototype because we must return a function, but there is\n\t// no way to create a function with a different prototype\n\tObject.setPrototypeOf(builder, proto);\n\n\tbuilder[GENERATOR] = self;\n\tbuilder[STYLER] = _styler;\n\tbuilder[IS_EMPTY] = _isEmpty;\n\n\treturn builder;\n};\n\nconst applyStyle = (self, string) => {\n\tif (self.level <= 0 || !string) {\n\t\treturn self[IS_EMPTY] ? '' : string;\n\t}\n\n\tlet styler = self[STYLER];\n\n\tif (styler === undefined) {\n\t\treturn string;\n\t}\n\n\tconst {openAll, closeAll} = styler;\n\tif (string.includes('\\u001B')) {\n\t\twhile (styler !== undefined) {\n\t\t\t// Replace any instances already present with a re-opening code\n\t\t\t// otherwise only the part of the string until said closing code\n\t\t\t// will be colored, and the rest will simply be 'plain'.\n\t\t\tstring = stringReplaceAll(string, styler.close, styler.open);\n\n\t\t\tstyler = styler.parent;\n\t\t}\n\t}\n\n\t// We can move both next actions out of loop, because remaining actions in loop won't have\n\t// any/visible effect on parts we add here. Close the styling before a linebreak and reopen\n\t// after next line to fix a bleed issue on macOS: https://github.com/chalk/chalk/pull/92\n\tconst lfIndex = string.indexOf('\\n');\n\tif (lfIndex !== -1) {\n\t\tstring = stringEncaseCRLFWithFirstIndex(string, closeAll, openAll, lfIndex);\n\t}\n\n\treturn openAll + string + closeAll;\n};\n\nObject.defineProperties(createChalk.prototype, styles);\n\nconst chalk = createChalk();\nexport const chalkStderr = createChalk({level: stderrColor ? stderrColor.level : 0});\n\nexport {\n\tmodifierNames,\n\tforegroundColorNames,\n\tbackgroundColorNames,\n\tcolorNames,\n\n\t// TODO: Remove these aliases in the next major version\n\tmodifierNames as modifiers,\n\tforegroundColorNames as foregroundColors,\n\tbackgroundColorNames as backgroundColors,\n\tcolorNames as colors,\n} from './vendor/ansi-styles/index.js';\n\nexport {\n\tstdoutColor as supportsColor,\n\tstderrColor as supportsColorStderr,\n};\n\nexport default chalk;\n", "export const balanced = (\n  a: string | RegExp,\n  b: string | RegExp,\n  str: string,\n) => {\n  const ma = a instanceof RegExp ? maybeMatch(a, str) : a\n  const mb = b instanceof RegExp ? maybeMatch(b, str) : b\n\n  const r = ma !== null && mb != null && range(ma, mb, str)\n\n  return (\n    r && {\n      start: r[0],\n      end: r[1],\n      pre: str.slice(0, r[0]),\n      body: str.slice(r[0] + ma.length, r[1]),\n      post: str.slice(r[1] + mb.length),\n    }\n  )\n}\n\nconst maybeMatch = (reg: RegExp, str: string) => {\n  const m = str.match(reg)\n  return m ? m[0] : null\n}\n\nexport const range = (\n  a: string,\n  b: string,\n  str: string,\n): undefined | [number, number] => {\n  let begs: number[],\n    beg: number | undefined,\n    left: number,\n    right: number | undefined = undefined,\n    result: undefined | [number, number]\n  let ai = str.indexOf(a)\n  let bi = str.indexOf(b, ai + 1)\n  let i = ai\n\n  if (ai >= 0 && bi > 0) {\n    if (a === b) {\n      return [ai, bi]\n    }\n    begs = []\n    left = str.length\n\n    while (i >= 0 && !result) {\n      if (i === ai) {\n        begs.push(i)\n        ai = str.indexOf(a, i + 1)\n      } else if (begs.length === 1) {\n        const r = begs.pop()\n        if (r !== undefined) result = [r, bi]\n      } else {\n        beg = begs.pop()\n        if (beg !== undefined && beg < left) {\n          left = beg\n          right = bi\n        }\n\n        bi = str.indexOf(b, i + 1)\n      }\n\n      i = ai < bi && ai >= 0 ? ai : bi\n    }\n\n    if (begs.length && right !== undefined) {\n      result = [left, right]\n    }\n  }\n\n  return result\n}\n", "import { balanced } from 'balanced-match'\n\nconst escSlash = '\\0SLASH' + Math.random() + '\\0'\nconst escOpen = '\\0OPEN' + Math.random() + '\\0'\nconst escClose = '\\0CLOSE' + Math.random() + '\\0'\nconst escComma = '\\0COMMA' + Math.random() + '\\0'\nconst escPeriod = '\\0PERIOD' + Math.random() + '\\0'\nconst escSlashPattern = new RegExp(escSlash, 'g')\nconst escOpenPattern = new RegExp(escOpen, 'g')\nconst escClosePattern = new RegExp(escClose, 'g')\nconst escCommaPattern = new RegExp(escComma, 'g')\nconst escPeriodPattern = new RegExp(escPeriod, 'g')\nconst slashPattern = /\\\\\\\\/g\nconst openPattern = /\\\\{/g\nconst closePattern = /\\\\}/g\nconst commaPattern = /\\\\,/g\nconst periodPattern = /\\\\./g\n\nexport const EXPANSION_MAX = 100_000\n\nfunction numeric(str: string) {\n  return !isNaN(str as any) ? parseInt(str, 10) : str.charCodeAt(0)\n}\n\nfunction escapeBraces(str: string) {\n  return str\n    .replace(slashPattern, escSlash)\n    .replace(openPattern, escOpen)\n    .replace(closePattern, escClose)\n    .replace(commaPattern, escComma)\n    .replace(periodPattern, escPeriod)\n}\n\nfunction unescapeBraces(str: string) {\n  return str\n    .replace(escSlashPattern, '\\\\')\n    .replace(escOpenPattern, '{')\n    .replace(escClosePattern, '}')\n    .replace(escCommaPattern, ',')\n    .replace(escPeriodPattern, '.')\n}\n\n/**\n * Basically just str.split(\",\"), but handling cases\n * where we have nested braced sections, which should be\n * treated as individual members, like {a,{b,c},d}\n */\nfunction parseCommaParts(str: string) {\n  if (!str) {\n    return ['']\n  }\n\n  const parts: string[] = []\n  const m = balanced('{', '}', str)\n\n  if (!m) {\n    return str.split(',')\n  }\n\n  const { pre, body, post } = m\n  const p = pre.split(',')\n\n  p[p.length - 1] += '{' + body + '}'\n  const postParts = parseCommaParts(post)\n  if (post.length) {\n    ;(p[p.length - 1] as string) += postParts.shift()\n    p.push.apply(p, postParts)\n  }\n\n  parts.push.apply(parts, p)\n\n  return parts\n}\n\nexport type BraceExpansionOptions = {\n  max?: number\n}\n\nexport function expand(str: string, options: BraceExpansionOptions = {}) {\n  if (!str) {\n    return []\n  }\n\n  const { max = EXPANSION_MAX } = options\n\n  // I don't know why Bash 4.3 does this, but it does.\n  // Anything starting with {} will have the first two bytes preserved\n  // but *only* at the top level, so {},a}b will not expand to anything,\n  // but a{},b}c will be expanded to [a}c,abc].\n  // One could argue that this is a bug in Bash, but since the goal of\n  // this module is to match Bash's rules, we escape a leading {}\n  if (str.slice(0, 2) === '{}') {\n    str = '\\\\{\\\\}' + str.slice(2)\n  }\n\n  return expand_(escapeBraces(str), max, true).map(unescapeBraces)\n}\n\nfunction embrace(str: string) {\n  return '{' + str + '}'\n}\n\nfunction isPadded(el: string) {\n  return /^-?0\\d/.test(el)\n}\n\nfunction lte(i: number, y: number) {\n  return i <= y\n}\n\nfunction gte(i: number, y: number) {\n  return i >= y\n}\n\nfunction expand_(str: string, max: number, isTop: boolean): string[] {\n  /** @type {string[]} */\n  const expansions: string[] = []\n\n  const m = balanced('{', '}', str)\n  if (!m) return [str]\n\n  // no need to expand pre, since it is guaranteed to be free of brace-sets\n  const pre = m.pre\n  const post: string[] = m.post.length ? expand_(m.post, max, false) : ['']\n\n  if (/\\$$/.test(m.pre)) {\n    for (let k = 0; k < post.length && k < max; k++) {\n      const expansion = pre + '{' + m.body + '}' + post[k]\n      expansions.push(expansion)\n    }\n  } else {\n    const isNumericSequence = /^-?\\d+\\.\\.-?\\d+(?:\\.\\.-?\\d+)?$/.test(m.body)\n    const isAlphaSequence = /^[a-zA-Z]\\.\\.[a-zA-Z](?:\\.\\.-?\\d+)?$/.test(\n      m.body,\n    )\n    const isSequence = isNumericSequence || isAlphaSequence\n    const isOptions = m.body.indexOf(',') >= 0\n    if (!isSequence && !isOptions) {\n      // {a},b}\n      if (m.post.match(/,(?!,).*\\}/)) {\n        str = m.pre + '{' + m.body + escClose + m.post\n        return expand_(str, max, true)\n      }\n      return [str]\n    }\n\n    let n: string[]\n    if (isSequence) {\n      n = m.body.split(/\\.\\./)\n    } else {\n      n = parseCommaParts(m.body)\n      if (n.length === 1 && n[0] !== undefined) {\n        // x{{a,b}}y ==> x{a}y x{b}y\n        n = expand_(n[0], max, false).map(embrace)\n        //XXX is this necessary? Can't seem to hit it in tests.\n        /* c8 ignore start */\n        if (n.length === 1) {\n          return post.map(p => m.pre + n[0] + p)\n        }\n        /* c8 ignore stop */\n      }\n    }\n\n    // at this point, n is the parts, and we know it's not a comma set\n    // with a single entry.\n    let N: string[]\n\n    if (isSequence && n[0] !== undefined && n[1] !== undefined) {\n      const x = numeric(n[0])\n      const y = numeric(n[1])\n      const width = Math.max(n[0].length, n[1].length)\n      let incr =\n        n.length === 3 && n[2] !== undefined ? Math.abs(numeric(n[2])) : 1\n      let test = lte\n      const reverse = y < x\n      if (reverse) {\n        incr *= -1\n        test = gte\n      }\n      const pad = n.some(isPadded)\n\n      N = []\n\n      for (let i = x; test(i, y); i += incr) {\n        let c\n        if (isAlphaSequence) {\n          c = String.fromCharCode(i)\n          if (c === '\\\\') {\n            c = ''\n          }\n        } else {\n          c = String(i)\n          if (pad) {\n            const need = width - c.length\n            if (need > 0) {\n              const z = new Array(need + 1).join('0')\n              if (i < 0) {\n                c = '-' + z + c.slice(1)\n              } else {\n                c = z + c\n              }\n            }\n          }\n        }\n        N.push(c)\n      }\n    } else {\n      N = []\n\n      for (let j = 0; j < n.length; j++) {\n        N.push.apply(N, expand_(n[j] as string, max, false))\n      }\n    }\n\n    for (let j = 0; j < N.length; j++) {\n      for (let k = 0; k < post.length && expansions.length < max; k++) {\n        const expansion = pre + N[j] + post[k]\n        if (!isTop || isSequence || expansion) {\n          expansions.push(expansion)\n        }\n      }\n    }\n  }\n\n  return expansions\n}\n", "const MAX_PATTERN_LENGTH = 1024 * 64\nexport const assertValidPattern: (pattern: any) => void = (\n  pattern: any,\n): asserts pattern is string => {\n  if (typeof pattern !== 'string') {\n    throw new TypeError('invalid pattern')\n  }\n\n  if (pattern.length > MAX_PATTERN_LENGTH) {\n    throw new TypeError('pattern is too long')\n  }\n}\n", "// translate the various posix character classes into unicode properties\n// this works across all unicode locales\n\n// { <posix class>: [<translation>, /u flag required, negated]\nconst posixClasses: { [k: string]: [e: string, u: boolean, n?: boolean] } =\n  {\n    '[:alnum:]': ['\\\\p{L}\\\\p{Nl}\\\\p{Nd}', true],\n    '[:alpha:]': ['\\\\p{L}\\\\p{Nl}', true],\n    '[:ascii:]': ['\\\\x' + '00-\\\\x' + '7f', false],\n    '[:blank:]': ['\\\\p{Zs}\\\\t', true],\n    '[:cntrl:]': ['\\\\p{Cc}', true],\n    '[:digit:]': ['\\\\p{Nd}', true],\n    '[:graph:]': ['\\\\p{Z}\\\\p{C}', true, true],\n    '[:lower:]': ['\\\\p{Ll}', true],\n    '[:print:]': ['\\\\p{C}', true],\n    '[:punct:]': ['\\\\p{P}', true],\n    '[:space:]': ['\\\\p{Z}\\\\t\\\\r\\\\n\\\\v\\\\f', true],\n    '[:upper:]': ['\\\\p{Lu}', true],\n    '[:word:]': ['\\\\p{L}\\\\p{Nl}\\\\p{Nd}\\\\p{Pc}', true],\n    '[:xdigit:]': ['A-Fa-f0-9', false],\n  }\n\n// only need to escape a few things inside of brace expressions\n// escapes: [ \\ ] -\nconst braceEscape = (s: string) => s.replace(/[[\\]\\\\-]/g, '\\\\$&')\n// escape all regexp magic characters\nconst regexpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\n// everything has already been escaped, we just have to join\nconst rangesToString = (ranges: string[]): string => ranges.join('')\n\nexport type ParseClassResult = [\n  src: string,\n  uFlag: boolean,\n  consumed: number,\n  hasMagic: boolean,\n]\n\n// takes a glob string at a posix brace expression, and returns\n// an equivalent regular expression source, and boolean indicating\n// whether the /u flag needs to be applied, and the number of chars\n// consumed to parse the character class.\n// This also removes out of order ranges, and returns ($.) if the\n// entire class just no good.\nexport const parseClass = (\n  glob: string,\n  position: number,\n): ParseClassResult => {\n  const pos = position\n  /* c8 ignore start */\n  if (glob.charAt(pos) !== '[') {\n    throw new Error('not in a brace expression')\n  }\n  /* c8 ignore stop */\n  const ranges: string[] = []\n  const negs: string[] = []\n\n  let i = pos + 1\n  let sawStart = false\n  let uflag = false\n  let escaping = false\n  let negate = false\n  let endPos = pos\n  let rangeStart = ''\n  WHILE: while (i < glob.length) {\n    const c = glob.charAt(i)\n    if ((c === '!' || c === '^') && i === pos + 1) {\n      negate = true\n      i++\n      continue\n    }\n\n    if (c === ']' && sawStart && !escaping) {\n      endPos = i + 1\n      break\n    }\n\n    sawStart = true\n    if (c === '\\\\') {\n      if (!escaping) {\n        escaping = true\n        i++\n        continue\n      }\n      // escaped \\ char, fall through and treat like normal char\n    }\n    if (c === '[' && !escaping) {\n      // either a posix class, a collation equivalent, or just a [\n      for (const [cls, [unip, u, neg]] of Object.entries(posixClasses)) {\n        if (glob.startsWith(cls, i)) {\n          // invalid, [a-[] is fine, but not [a-[:alpha]]\n          if (rangeStart) {\n            return ['$.', false, glob.length - pos, true]\n          }\n          i += cls.length\n          if (neg) negs.push(unip)\n          else ranges.push(unip)\n          uflag = uflag || u\n          continue WHILE\n        }\n      }\n    }\n\n    // now it's just a normal character, effectively\n    escaping = false\n    if (rangeStart) {\n      // throw this range away if it's not valid, but others\n      // can still match.\n      if (c > rangeStart) {\n        ranges.push(braceEscape(rangeStart) + '-' + braceEscape(c))\n      } else if (c === rangeStart) {\n        ranges.push(braceEscape(c))\n      }\n      rangeStart = ''\n      i++\n      continue\n    }\n\n    // now might be the start of a range.\n    // can be either c-d or c-] or c<more...>] or c] at this point\n    if (glob.startsWith('-]', i + 1)) {\n      ranges.push(braceEscape(c + '-'))\n      i += 2\n      continue\n    }\n    if (glob.startsWith('-', i + 1)) {\n      rangeStart = c\n      i += 2\n      continue\n    }\n\n    // not the start of a range, just a single character\n    ranges.push(braceEscape(c))\n    i++\n  }\n\n  if (endPos < i) {\n    // didn't see the end of the class, not a valid class,\n    // but might still be valid as a literal match.\n    return ['', false, 0, false]\n  }\n\n  // if we got no ranges and no negates, then we have a range that\n  // cannot possibly match anything, and that poisons the whole glob\n  if (!ranges.length && !negs.length) {\n    return ['$.', false, glob.length - pos, true]\n  }\n\n  // if we got one positive range, and it's a single character, then that's\n  // not actually a magic pattern, it's just that one literal character.\n  // we should not treat that as \"magic\", we should just return the literal\n  // character. [_] is a perfectly valid way to escape glob magic chars.\n  if (\n    negs.length === 0 &&\n    ranges.length === 1 &&\n    /^\\\\?.$/.test(ranges[0]) &&\n    !negate\n  ) {\n    const r = ranges[0].length === 2 ? ranges[0].slice(-1) : ranges[0]\n    return [regexpEscape(r), false, endPos - pos, false]\n  }\n\n  const sranges = '[' + (negate ? '^' : '') + rangesToString(ranges) + ']'\n  const snegs = '[' + (negate ? '' : '^') + rangesToString(negs) + ']'\n  const comb =\n    ranges.length && negs.length ? '(' + sranges + '|' + snegs + ')'\n    : ranges.length ? sranges\n    : snegs\n\n  return [comb, uflag, endPos - pos, true]\n}\n", "import { MinimatchOptions } from './index.js'\n\n/**\n * Un-escape a string that has been escaped with {@link escape}.\n *\n * If the {@link MinimatchOptions.windowsPathsNoEscape} option is used, then\n * square-bracket escapes are removed, but not backslash escapes.\n *\n * For example, it will turn the string `'[*]'` into `*`, but it will not\n * turn `'\\\\*'` into `'*'`, because `\\` is a path separator in\n * `windowsPathsNoEscape` mode.\n *\n * When `windowsPathsNoEscape` is not set, then both square-bracket escapes and\n * backslash escapes are removed.\n *\n * Slashes (and backslashes in `windowsPathsNoEscape` mode) cannot be escaped\n * or unescaped.\n *\n * When `magicalBraces` is not set, escapes of braces (`{` and `}`) will not be\n * unescaped.\n */\n\nexport const unescape = (\n  s: string,\n  {\n    windowsPathsNoEscape = false,\n    magicalBraces = true,\n  }: Pick<MinimatchOptions, 'windowsPathsNoEscape' | 'magicalBraces'> = {},\n) => {\n  if (magicalBraces) {\n    return windowsPathsNoEscape ?\n        s.replace(/\\[([^\\/\\\\])\\]/g, '$1')\n      : s\n          .replace(/((?!\\\\).|^)\\[([^\\/\\\\])\\]/g, '$1$2')\n          .replace(/\\\\([^\\/])/g, '$1')\n  }\n  return windowsPathsNoEscape ?\n      s.replace(/\\[([^\\/\\\\{}])\\]/g, '$1')\n    : s\n        .replace(/((?!\\\\).|^)\\[([^\\/\\\\{}])\\]/g, '$1$2')\n        .replace(/\\\\([^\\/{}])/g, '$1')\n}\n", "// parse a single path portion\n\nimport { parseClass } from './brace-expressions.js'\nimport { MinimatchOptions, MMRegExp } from './index.js'\nimport { unescape } from './unescape.js'\n\n// classes [] are handled by the parseClass method\n// for positive extglobs, we sub-parse the contents, and combine,\n// with the appropriate regexp close.\n// for negative extglobs, we sub-parse the contents, but then\n// have to include the rest of the pattern, then the parent, etc.,\n// as the thing that cannot be because RegExp negative lookaheads\n// are different from globs.\n//\n// So for example:\n// a@(i|w!(x|y)z|j)b => ^a(i|w((!?(x|y)zb).*)z|j)b$\n//   1   2 3   4 5 6      1   2    3   46      5 6\n//\n// Assembling the extglob requires not just the negated patterns themselves,\n// but also anything following the negative patterns up to the boundary\n// of the current pattern, plus anything following in the parent pattern.\n//\n//\n// So, first, we parse the string into an AST of extglobs, without turning\n// anything into regexps yet.\n//\n// ['a', {@ [['i'], ['w', {!['x', 'y']}, 'z'], ['j']]}, 'b']\n//\n// Then, for all the negative extglobs, we append whatever comes after in\n// each parent as their tail\n//\n// ['a', {@ [['i'], ['w', {!['x', 'y'], 'z', 'b'}, 'z'], ['j']]}, 'b']\n//\n// Lastly, we turn each of these pieces into a regexp, and join\n//\n//                                 v----- .* because there's more following,\n//                                 v    v  otherwise, .+ because it must be\n//                                 v    v  *something* there.\n// ['^a', {@ ['i', 'w(?:(!?(?:x|y).*zb$).*)z', 'j' ]}, 'b$']\n//   copy what follows into here--^^^^^\n// ['^a', '(?:i|w(?:(?!(?:x|y).*zb$).*)z|j)', 'b$']\n// ['^a(?:i|w(?:(?!(?:x|y).*zb$).*)z|j)b$']\n\nexport type ExtglobType = '!' | '?' | '+' | '*' | '@'\nconst types = new Set<ExtglobType>(['!', '?', '+', '*', '@'])\nconst isExtglobType = (c: string): c is ExtglobType =>\n  types.has(c as ExtglobType)\n\n// Patterns that get prepended to bind to the start of either the\n// entire string, or just a single path portion, to prevent dots\n// and/or traversal patterns, when needed.\n// Exts don't need the ^ or / bit, because the root binds that already.\nconst startNoTraversal = '(?!(?:^|/)\\\\.\\\\.?(?:$|/))'\nconst startNoDot = '(?!\\\\.)'\n\n// characters that indicate a start of pattern needs the \"no dots\" bit,\n// because a dot *might* be matched. ( is not in the list, because in\n// the case of a child extglob, it will handle the prevention itself.\nconst addPatternStart = new Set(['[', '.'])\n// cases where traversal is A-OK, no dot prevention needed\nconst justDots = new Set(['..', '.'])\nconst reSpecials = new Set('().*{}+?[]^$\\\\!')\nconst regExpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\n// any single thing other than /\nconst qmark = '[^/]'\n\n// * => any number of characters\nconst star = qmark + '*?'\n// use + when we need to ensure that *something* matches, because the * is\n// the only thing in the path portion.\nconst starNoEmpty = qmark + '+?'\n\n// remove the \\ chars that we added if we end up doing a nonmagic compare\n// const deslash = (s: string) => s.replace(/\\\\(.)/g, '$1')\n\nexport class AST {\n  type: ExtglobType | null\n  readonly #root: AST\n\n  #hasMagic?: boolean\n  #uflag: boolean = false\n  #parts: (string | AST)[] = []\n  readonly #parent?: AST\n  readonly #parentIndex: number\n  #negs: AST[]\n  #filledNegs: boolean = false\n  #options: MinimatchOptions\n  #toString?: string\n  // set to true if it's an extglob with no children\n  // (which really means one child of '')\n  #emptyExt: boolean = false\n\n  constructor(\n    type: ExtglobType | null,\n    parent?: AST,\n    options: MinimatchOptions = {},\n  ) {\n    this.type = type\n    // extglobs are inherently magical\n    if (type) this.#hasMagic = true\n    this.#parent = parent\n    this.#root = this.#parent ? this.#parent.#root : this\n    this.#options = this.#root === this ? options : this.#root.#options\n    this.#negs = this.#root === this ? [] : this.#root.#negs\n    if (type === '!' && !this.#root.#filledNegs) this.#negs.push(this)\n    this.#parentIndex = this.#parent ? this.#parent.#parts.length : 0\n  }\n\n  get hasMagic(): boolean | undefined {\n    /* c8 ignore start */\n    if (this.#hasMagic !== undefined) return this.#hasMagic\n    /* c8 ignore stop */\n    for (const p of this.#parts) {\n      if (typeof p === 'string') continue\n      if (p.type || p.hasMagic) return (this.#hasMagic = true)\n    }\n    // note: will be undefined until we generate the regexp src and find out\n    return this.#hasMagic\n  }\n\n  // reconstructs the pattern\n  toString(): string {\n    if (this.#toString !== undefined) return this.#toString\n    if (!this.type) {\n      return (this.#toString = this.#parts.map(p => String(p)).join(''))\n    } else {\n      return (this.#toString =\n        this.type + '(' + this.#parts.map(p => String(p)).join('|') + ')')\n    }\n  }\n\n  #fillNegs() {\n    /* c8 ignore start */\n    if (this !== this.#root) throw new Error('should only call on root')\n    if (this.#filledNegs) return this\n    /* c8 ignore stop */\n\n    // call toString() once to fill this out\n    this.toString()\n    this.#filledNegs = true\n    let n: AST | undefined\n    while ((n = this.#negs.pop())) {\n      if (n.type !== '!') continue\n      // walk up the tree, appending everthing that comes AFTER parentIndex\n      let p: AST | undefined = n\n      let pp = p.#parent\n      while (pp) {\n        for (\n          let i = p.#parentIndex + 1;\n          !pp.type && i < pp.#parts.length;\n          i++\n        ) {\n          for (const part of n.#parts) {\n            /* c8 ignore start */\n            if (typeof part === 'string') {\n              throw new Error('string part in extglob AST??')\n            }\n            /* c8 ignore stop */\n            part.copyIn(pp.#parts[i])\n          }\n        }\n        p = pp\n        pp = p.#parent\n      }\n    }\n    return this\n  }\n\n  push(...parts: (string | AST)[]) {\n    for (const p of parts) {\n      if (p === '') continue\n      /* c8 ignore start */\n      if (\n        typeof p !== 'string' &&\n        !(p instanceof AST && p.#parent === this)\n      ) {\n        throw new Error('invalid part: ' + p)\n      }\n      /* c8 ignore stop */\n      this.#parts.push(p)\n    }\n  }\n\n  toJSON() {\n    const ret: any[] =\n      this.type === null ?\n        this.#parts\n          .slice()\n          .map(p => (typeof p === 'string' ? p : p.toJSON()))\n      : [this.type, ...this.#parts.map(p => (p as AST).toJSON())]\n    if (this.isStart() && !this.type) ret.unshift([])\n    if (\n      this.isEnd() &&\n      (this === this.#root ||\n        (this.#root.#filledNegs && this.#parent?.type === '!'))\n    ) {\n      ret.push({})\n    }\n    return ret\n  }\n\n  isStart(): boolean {\n    if (this.#root === this) return true\n    // if (this.type) return !!this.#parent?.isStart()\n    if (!this.#parent?.isStart()) return false\n    if (this.#parentIndex === 0) return true\n    // if everything AHEAD of this is a negation, then it's still the \"start\"\n    const p = this.#parent\n    for (let i = 0; i < this.#parentIndex; i++) {\n      const pp = p.#parts[i]\n      if (!(pp instanceof AST && pp.type === '!')) {\n        return false\n      }\n    }\n    return true\n  }\n\n  isEnd(): boolean {\n    if (this.#root === this) return true\n    if (this.#parent?.type === '!') return true\n    if (!this.#parent?.isEnd()) return false\n    if (!this.type) return this.#parent?.isEnd()\n    // if not root, it'll always have a parent\n    /* c8 ignore start */\n    const pl = this.#parent ? this.#parent.#parts.length : 0\n    /* c8 ignore stop */\n    return this.#parentIndex === pl - 1\n  }\n\n  copyIn(part: AST | string) {\n    if (typeof part === 'string') this.push(part)\n    else this.push(part.clone(this))\n  }\n\n  clone(parent: AST) {\n    const c = new AST(this.type, parent)\n    for (const p of this.#parts) {\n      c.copyIn(p)\n    }\n    return c\n  }\n\n  static #parseAST(\n    str: string,\n    ast: AST,\n    pos: number,\n    opt: MinimatchOptions,\n  ): number {\n    let escaping = false\n    let inBrace = false\n    let braceStart = -1\n    let braceNeg = false\n    if (ast.type === null) {\n      // outside of a extglob, append until we find a start\n      let i = pos\n      let acc = ''\n      while (i < str.length) {\n        const c = str.charAt(i++)\n        // still accumulate escapes at this point, but we do ignore\n        // starts that are escaped\n        if (escaping || c === '\\\\') {\n          escaping = !escaping\n          acc += c\n          continue\n        }\n\n        if (inBrace) {\n          if (i === braceStart + 1) {\n            if (c === '^' || c === '!') {\n              braceNeg = true\n            }\n          } else if (c === ']' && !(i === braceStart + 2 && braceNeg)) {\n            inBrace = false\n          }\n          acc += c\n          continue\n        } else if (c === '[') {\n          inBrace = true\n          braceStart = i\n          braceNeg = false\n          acc += c\n          continue\n        }\n\n        if (!opt.noext && isExtglobType(c) && str.charAt(i) === '(') {\n          ast.push(acc)\n          acc = ''\n          const ext = new AST(c, ast)\n          i = AST.#parseAST(str, ext, i, opt)\n          ast.push(ext)\n          continue\n        }\n        acc += c\n      }\n      ast.push(acc)\n      return i\n    }\n\n    // some kind of extglob, pos is at the (\n    // find the next | or )\n    let i = pos + 1\n    let part = new AST(null, ast)\n    const parts: AST[] = []\n    let acc = ''\n    while (i < str.length) {\n      const c = str.charAt(i++)\n      // still accumulate escapes at this point, but we do ignore\n      // starts that are escaped\n      if (escaping || c === '\\\\') {\n        escaping = !escaping\n        acc += c\n        continue\n      }\n\n      if (inBrace) {\n        if (i === braceStart + 1) {\n          if (c === '^' || c === '!') {\n            braceNeg = true\n          }\n        } else if (c === ']' && !(i === braceStart + 2 && braceNeg)) {\n          inBrace = false\n        }\n        acc += c\n        continue\n      } else if (c === '[') {\n        inBrace = true\n        braceStart = i\n        braceNeg = false\n        acc += c\n        continue\n      }\n\n      if (isExtglobType(c) && str.charAt(i) === '(') {\n        part.push(acc)\n        acc = ''\n        const ext = new AST(c, part)\n        part.push(ext)\n        i = AST.#parseAST(str, ext, i, opt)\n        continue\n      }\n      if (c === '|') {\n        part.push(acc)\n        acc = ''\n        parts.push(part)\n        part = new AST(null, ast)\n        continue\n      }\n      if (c === ')') {\n        if (acc === '' && ast.#parts.length === 0) {\n          ast.#emptyExt = true\n        }\n        part.push(acc)\n        acc = ''\n        ast.push(...parts, part)\n        return i\n      }\n      acc += c\n    }\n\n    // unfinished extglob\n    // if we got here, it was a malformed extglob! not an extglob, but\n    // maybe something else in there.\n    ast.type = null\n    ast.#hasMagic = undefined\n    ast.#parts = [str.substring(pos - 1)]\n    return i\n  }\n\n  static fromGlob(pattern: string, options: MinimatchOptions = {}) {\n    const ast = new AST(null, undefined, options)\n    AST.#parseAST(pattern, ast, 0, options)\n    return ast\n  }\n\n  // returns the regular expression if there's magic, or the unescaped\n  // string if not.\n  toMMPattern(): MMRegExp | string {\n    // should only be called on root\n    /* c8 ignore start */\n    if (this !== this.#root) return this.#root.toMMPattern()\n    /* c8 ignore stop */\n    const glob = this.toString()\n    const [re, body, hasMagic, uflag] = this.toRegExpSource()\n    // if we're in nocase mode, and not nocaseMagicOnly, then we do\n    // still need a regular expression if we have to case-insensitively\n    // match capital/lowercase characters.\n    const anyMagic =\n      hasMagic ||\n      this.#hasMagic ||\n      (this.#options.nocase &&\n        !this.#options.nocaseMagicOnly &&\n        glob.toUpperCase() !== glob.toLowerCase())\n    if (!anyMagic) {\n      return body\n    }\n\n    const flags = (this.#options.nocase ? 'i' : '') + (uflag ? 'u' : '')\n    return Object.assign(new RegExp(`^${re}$`, flags), {\n      _src: re,\n      _glob: glob,\n    })\n  }\n\n  get options() {\n    return this.#options\n  }\n\n  // returns the string match, the regexp source, whether there's magic\n  // in the regexp (so a regular expression is required) and whether or\n  // not the uflag is needed for the regular expression (for posix classes)\n  // TODO: instead of injecting the start/end at this point, just return\n  // the BODY of the regexp, along with the start/end portions suitable\n  // for binding the start/end in either a joined full-path makeRe context\n  // (where we bind to (^|/), or a standalone matchPart context (where\n  // we bind to ^, and not /).  Otherwise slashes get duped!\n  //\n  // In part-matching mode, the start is:\n  // - if not isStart: nothing\n  // - if traversal possible, but not allowed: ^(?!\\.\\.?$)\n  // - if dots allowed or not possible: ^\n  // - if dots possible and not allowed: ^(?!\\.)\n  // end is:\n  // - if not isEnd(): nothing\n  // - else: $\n  //\n  // In full-path matching mode, we put the slash at the START of the\n  // pattern, so start is:\n  // - if first pattern: same as part-matching mode\n  // - if not isStart(): nothing\n  // - if traversal possible, but not allowed: /(?!\\.\\.?(?:$|/))\n  // - if dots allowed or not possible: /\n  // - if dots possible and not allowed: /(?!\\.)\n  // end is:\n  // - if last pattern, same as part-matching mode\n  // - else nothing\n  //\n  // Always put the (?:$|/) on negated tails, though, because that has to be\n  // there to bind the end of the negated pattern portion, and it's easier to\n  // just stick it in now rather than try to inject it later in the middle of\n  // the pattern.\n  //\n  // We can just always return the same end, and leave it up to the caller\n  // to know whether it's going to be used joined or in parts.\n  // And, if the start is adjusted slightly, can do the same there:\n  // - if not isStart: nothing\n  // - if traversal possible, but not allowed: (?:/|^)(?!\\.\\.?$)\n  // - if dots allowed or not possible: (?:/|^)\n  // - if dots possible and not allowed: (?:/|^)(?!\\.)\n  //\n  // But it's better to have a simpler binding without a conditional, for\n  // performance, so probably better to return both start options.\n  //\n  // Then the caller just ignores the end if it's not the first pattern,\n  // and the start always gets applied.\n  //\n  // But that's always going to be $ if it's the ending pattern, or nothing,\n  // so the caller can just attach $ at the end of the pattern when building.\n  //\n  // So the todo is:\n  // - better detect what kind of start is needed\n  // - return both flavors of starting pattern\n  // - attach $ at the end of the pattern when creating the actual RegExp\n  //\n  // Ah, but wait, no, that all only applies to the root when the first pattern\n  // is not an extglob. If the first pattern IS an extglob, then we need all\n  // that dot prevention biz to live in the extglob portions, because eg\n  // +(*|.x*) can match .xy but not .yx.\n  //\n  // So, return the two flavors if it's #root and the first child is not an\n  // AST, otherwise leave it to the child AST to handle it, and there,\n  // use the (?:^|/) style of start binding.\n  //\n  // Even simplified further:\n  // - Since the start for a join is eg /(?!\\.) and the start for a part\n  // is ^(?!\\.), we can just prepend (?!\\.) to the pattern (either root\n  // or start or whatever) and prepend ^ or / at the Regexp construction.\n  toRegExpSource(\n    allowDot?: boolean,\n  ): [re: string, body: string, hasMagic: boolean, uflag: boolean] {\n    const dot = allowDot ?? !!this.#options.dot\n    if (this.#root === this) this.#fillNegs()\n    if (!this.type) {\n      const noEmpty =\n        this.isStart() &&\n        this.isEnd() &&\n        !this.#parts.some(s => typeof s !== 'string')\n      const src = this.#parts\n        .map(p => {\n          const [re, _, hasMagic, uflag] =\n            typeof p === 'string' ?\n              AST.#parseGlob(p, this.#hasMagic, noEmpty)\n            : p.toRegExpSource(allowDot)\n          this.#hasMagic = this.#hasMagic || hasMagic\n          this.#uflag = this.#uflag || uflag\n          return re\n        })\n        .join('')\n\n      let start = ''\n      if (this.isStart()) {\n        if (typeof this.#parts[0] === 'string') {\n          // this is the string that will match the start of the pattern,\n          // so we need to protect against dots and such.\n\n          // '.' and '..' cannot match unless the pattern is that exactly,\n          // even if it starts with . or dot:true is set.\n          const dotTravAllowed =\n            this.#parts.length === 1 && justDots.has(this.#parts[0])\n          if (!dotTravAllowed) {\n            const aps = addPatternStart\n            // check if we have a possibility of matching . or ..,\n            // and prevent that.\n            const needNoTrav =\n              // dots are allowed, and the pattern starts with [ or .\n              (dot && aps.has(src.charAt(0))) ||\n              // the pattern starts with \\., and then [ or .\n              (src.startsWith('\\\\.') && aps.has(src.charAt(2))) ||\n              // the pattern starts with \\.\\., and then [ or .\n              (src.startsWith('\\\\.\\\\.') && aps.has(src.charAt(4)))\n            // no need to prevent dots if it can't match a dot, or if a\n            // sub-pattern will be preventing it anyway.\n            const needNoDot = !dot && !allowDot && aps.has(src.charAt(0))\n\n            start =\n              needNoTrav ? startNoTraversal\n              : needNoDot ? startNoDot\n              : ''\n          }\n        }\n      }\n\n      // append the \"end of path portion\" pattern to negation tails\n      let end = ''\n      if (\n        this.isEnd() &&\n        this.#root.#filledNegs &&\n        this.#parent?.type === '!'\n      ) {\n        end = '(?:$|\\\\/)'\n      }\n      const final = start + src + end\n      return [\n        final,\n        unescape(src),\n        (this.#hasMagic = !!this.#hasMagic),\n        this.#uflag,\n      ]\n    }\n\n    // We need to calculate the body *twice* if it's a repeat pattern\n    // at the start, once in nodot mode, then again in dot mode, so a\n    // pattern like *(?) can match 'x.y'\n\n    const repeated = this.type === '*' || this.type === '+'\n    // some kind of extglob\n    const start = this.type === '!' ? '(?:(?!(?:' : '(?:'\n    let body = this.#partsToRegExp(dot)\n\n    if (this.isStart() && this.isEnd() && !body && this.type !== '!') {\n      // invalid extglob, has to at least be *something* present, if it's\n      // the entire path portion.\n      const s = this.toString()\n      this.#parts = [s]\n      this.type = null\n      this.#hasMagic = undefined\n      return [s, unescape(this.toString()), false, false]\n    }\n\n    // XXX abstract out this map method\n    let bodyDotAllowed =\n      !repeated || allowDot || dot || !startNoDot ?\n        ''\n      : this.#partsToRegExp(true)\n    if (bodyDotAllowed === body) {\n      bodyDotAllowed = ''\n    }\n    if (bodyDotAllowed) {\n      body = `(?:${body})(?:${bodyDotAllowed})*?`\n    }\n\n    // an empty !() is exactly equivalent to a starNoEmpty\n    let final = ''\n    if (this.type === '!' && this.#emptyExt) {\n      final = (this.isStart() && !dot ? startNoDot : '') + starNoEmpty\n    } else {\n      const close =\n        this.type === '!' ?\n          // !() must match something,but !(x) can match ''\n          '))' +\n          (this.isStart() && !dot && !allowDot ? startNoDot : '') +\n          star +\n          ')'\n        : this.type === '@' ? ')'\n        : this.type === '?' ? ')?'\n        : this.type === '+' && bodyDotAllowed ? ')'\n        : this.type === '*' && bodyDotAllowed ? `)?`\n        : `)${this.type}`\n      final = start + body + close\n    }\n    return [\n      final,\n      unescape(body),\n      (this.#hasMagic = !!this.#hasMagic),\n      this.#uflag,\n    ]\n  }\n\n  #partsToRegExp(dot: boolean) {\n    return this.#parts\n      .map(p => {\n        // extglob ASTs should only contain parent ASTs\n        /* c8 ignore start */\n        if (typeof p === 'string') {\n          throw new Error('string type in extglob ast??')\n        }\n        /* c8 ignore stop */\n        // can ignore hasMagic, because extglobs are already always magic\n        const [re, _, _hasMagic, uflag] = p.toRegExpSource(dot)\n        this.#uflag = this.#uflag || uflag\n        return re\n      })\n      .filter(p => !(this.isStart() && this.isEnd()) || !!p)\n      .join('|')\n  }\n\n  static #parseGlob(\n    glob: string,\n    hasMagic: boolean | undefined,\n    noEmpty: boolean = false,\n  ): [re: string, body: string, hasMagic: boolean, uflag: boolean] {\n    let escaping = false\n    let re = ''\n    let uflag = false\n    // multiple stars that aren't globstars coalesce into one *\n    let inStar = false\n    for (let i = 0; i < glob.length; i++) {\n      const c = glob.charAt(i)\n      if (escaping) {\n        escaping = false\n        re += (reSpecials.has(c) ? '\\\\' : '') + c\n        continue\n      }\n      if (c === '*') {\n        if (inStar) continue\n        inStar = true\n        re += noEmpty && /^[*]+$/.test(glob) ? starNoEmpty : star\n        hasMagic = true\n        continue\n      } else {\n        inStar = false\n      }\n      if (c === '\\\\') {\n        if (i === glob.length - 1) {\n          re += '\\\\\\\\'\n        } else {\n          escaping = true\n        }\n        continue\n      }\n      if (c === '[') {\n        const [src, needUflag, consumed, magic] = parseClass(glob, i)\n        if (consumed) {\n          re += src\n          uflag = uflag || needUflag\n          i += consumed - 1\n          hasMagic = hasMagic || magic\n          continue\n        }\n      }\n      if (c === '?') {\n        re += qmark\n        hasMagic = true\n        continue\n      }\n      re += regExpEscape(c)\n    }\n    return [re, unescape(glob), !!hasMagic, uflag]\n  }\n}\n", "import { MinimatchOptions } from './index.js'\n\n/**\n * Escape all magic characters in a glob pattern.\n *\n * If the {@link MinimatchOptions.windowsPathsNoEscape}\n * option is used, then characters are escaped by wrapping in `[]`, because\n * a magic character wrapped in a character class can only be satisfied by\n * that exact character.  In this mode, `\\` is _not_ escaped, because it is\n * not interpreted as a magic character, but instead as a path separator.\n *\n * If the {@link MinimatchOptions.magicalBraces} option is used,\n * then braces (`{` and `}`) will be escaped.\n */\nexport const escape = (\n  s: string,\n  {\n    windowsPathsNoEscape = false,\n    magicalBraces = false,\n  }: Pick<MinimatchOptions, 'windowsPathsNoEscape' | 'magicalBraces'> = {},\n) => {\n  // don't need to escape +@! because we escape the parens\n  // that make those magic, and escaping ! as [!] isn't valid,\n  // because [!]] is a valid glob class meaning not ']'.\n  if (magicalBraces) {\n    return windowsPathsNoEscape ?\n        s.replace(/[?*()[\\]{}]/g, '[$&]')\n      : s.replace(/[?*()[\\]\\\\{}]/g, '\\\\$&')\n  }\n  return windowsPathsNoEscape ?\n      s.replace(/[?*()[\\]]/g, '[$&]')\n    : s.replace(/[?*()[\\]\\\\]/g, '\\\\$&')\n}\n", "import { expand } from 'brace-expansion'\nimport { assertValidPattern } from './assert-valid-pattern.js'\nimport { AST, ExtglobType } from './ast.js'\nimport { escape } from './escape.js'\nimport { unescape } from './unescape.js'\n\nexport type Platform =\n  | 'aix'\n  | 'android'\n  | 'darwin'\n  | 'freebsd'\n  | 'haiku'\n  | 'linux'\n  | 'openbsd'\n  | 'sunos'\n  | 'win32'\n  | 'cygwin'\n  | 'netbsd'\n\nexport interface MinimatchOptions {\n  /** do not expand `{x,y}` style braces */\n  nobrace?: boolean\n  /** do not treat patterns starting with `#` as a comment */\n  nocomment?: boolean\n  /** do not treat patterns starting with `!` as a negation */\n  nonegate?: boolean\n  /** print LOTS of debugging output */\n  debug?: boolean\n  /** treat `**` the same as `*` */\n  noglobstar?: boolean\n  /** do not expand extglobs like `+(a|b)` */\n  noext?: boolean\n  /** return the pattern if nothing matches */\n  nonull?: boolean\n  /** treat `\\\\` as a path separator, not an escape character */\n  windowsPathsNoEscape?: boolean\n  /**\n   * inverse of {@link MinimatchOptions.windowsPathsNoEscape}\n   * @deprecated\n   */\n  allowWindowsEscape?: boolean\n  /**\n   * Compare a partial path to a pattern. As long as the parts\n   * of the path that are present are not contradicted by the\n   * pattern, it will be treated as a match. This is useful in\n   * applications where you're walking through a folder structure,\n   * and don't yet have the full path, but want to ensure that you\n   * do not walk down paths that can never be a match.\n   */\n  partial?: boolean\n  /** allow matches that start with `.` even if the pattern does not */\n  dot?: boolean\n  /** ignore case */\n  nocase?: boolean\n  /** ignore case only in wildcard patterns */\n  nocaseMagicOnly?: boolean\n  /** consider braces to be \"magic\" for the purpose of `hasMagic` */\n  magicalBraces?: boolean\n  /**\n   * If set, then patterns without slashes will be matched\n   * against the basename of the path if it contains slashes.\n   * For example, `a?b` would match the path `/xyz/123/acb`, but\n   * not `/xyz/acb/123`.\n   */\n  matchBase?: boolean\n  /** invert the results of negated matches */\n  flipNegate?: boolean\n  /** do not collapse multiple `/` into a single `/` */\n  preserveMultipleSlashes?: boolean\n  /**\n   * A number indicating the level of optimization that should be done\n   * to the pattern prior to parsing and using it for matches.\n   */\n  optimizationLevel?: number\n  /** operating system platform */\n  platform?: Platform\n  /**\n   * When a pattern starts with a UNC path or drive letter, and in\n   * `nocase:true` mode, do not convert the root portions of the\n   * pattern into a case-insensitive regular expression, and instead\n   * leave them as strings.\n   *\n   * This is the default when the platform is `win32` and\n   * `nocase:true` is set.\n   */\n  windowsNoMagicRoot?: boolean\n  /**\n   * max number of `{...}` patterns to expand. Default 100_000.\n   */\n  braceExpandMax?: number\n}\n\nexport const minimatch = (\n  p: string,\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  assertValidPattern(pattern)\n\n  // shortcut: comments match nothing.\n  if (!options.nocomment && pattern.charAt(0) === '#') {\n    return false\n  }\n\n  return new Minimatch(pattern, options).match(p)\n}\n\n// Optimized checking for the most common glob patterns.\nconst starDotExtRE = /^\\*+([^+@!?\\*\\[\\(]*)$/\nconst starDotExtTest = (ext: string) => (f: string) =>\n  !f.startsWith('.') && f.endsWith(ext)\nconst starDotExtTestDot = (ext: string) => (f: string) => f.endsWith(ext)\nconst starDotExtTestNocase = (ext: string) => {\n  ext = ext.toLowerCase()\n  return (f: string) => !f.startsWith('.') && f.toLowerCase().endsWith(ext)\n}\nconst starDotExtTestNocaseDot = (ext: string) => {\n  ext = ext.toLowerCase()\n  return (f: string) => f.toLowerCase().endsWith(ext)\n}\nconst starDotStarRE = /^\\*+\\.\\*+$/\nconst starDotStarTest = (f: string) =>\n  !f.startsWith('.') && f.includes('.')\nconst starDotStarTestDot = (f: string) =>\n  f !== '.' && f !== '..' && f.includes('.')\nconst dotStarRE = /^\\.\\*+$/\nconst dotStarTest = (f: string) =>\n  f !== '.' && f !== '..' && f.startsWith('.')\nconst starRE = /^\\*+$/\nconst starTest = (f: string) => f.length !== 0 && !f.startsWith('.')\nconst starTestDot = (f: string) =>\n  f.length !== 0 && f !== '.' && f !== '..'\nconst qmarksRE = /^\\?+([^+@!?\\*\\[\\(]*)?$/\nconst qmarksTestNocase = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExt([$0])\n  if (!ext) return noext\n  ext = ext.toLowerCase()\n  return (f: string) => noext(f) && f.toLowerCase().endsWith(ext)\n}\nconst qmarksTestNocaseDot = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExtDot([$0])\n  if (!ext) return noext\n  ext = ext.toLowerCase()\n  return (f: string) => noext(f) && f.toLowerCase().endsWith(ext)\n}\nconst qmarksTestDot = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExtDot([$0])\n  return !ext ? noext : (f: string) => noext(f) && f.endsWith(ext)\n}\nconst qmarksTest = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExt([$0])\n  return !ext ? noext : (f: string) => noext(f) && f.endsWith(ext)\n}\nconst qmarksTestNoExt = ([$0]: RegExpMatchArray) => {\n  const len = $0.length\n  return (f: string) => f.length === len && !f.startsWith('.')\n}\nconst qmarksTestNoExtDot = ([$0]: RegExpMatchArray) => {\n  const len = $0.length\n  return (f: string) => f.length === len && f !== '.' && f !== '..'\n}\n\n/* c8 ignore start */\nconst defaultPlatform: Platform = (\n  typeof process === 'object' && process ?\n    (typeof process.env === 'object' &&\n      process.env &&\n      process.env.__MINIMATCH_TESTING_PLATFORM__) ||\n    process.platform\n  : 'posix') as Platform\n\nexport type Sep = '\\\\' | '/'\n\nconst path: { [k: string]: { sep: Sep } } = {\n  win32: { sep: '\\\\' },\n  posix: { sep: '/' },\n}\n/* c8 ignore stop */\n\nexport const sep =\n  defaultPlatform === 'win32' ? path.win32.sep : path.posix.sep\nminimatch.sep = sep\n\nexport const GLOBSTAR = Symbol('globstar **')\nminimatch.GLOBSTAR = GLOBSTAR\n\n// any single thing other than /\n// don't need to escape / when using new RegExp()\nconst qmark = '[^/]'\n\n// * => any number of characters\nconst star = qmark + '*?'\n\n// ** when dots are allowed.  Anything goes, except .. and .\n// not (^ or / followed by one or two dots followed by $ or /),\n// followed by anything, any number of times.\nconst twoStarDot = '(?:(?!(?:\\\\/|^)(?:\\\\.{1,2})($|\\\\/)).)*?'\n\n// not a ^ or / followed by a dot,\n// followed by anything, any number of times.\nconst twoStarNoDot = '(?:(?!(?:\\\\/|^)\\\\.).)*?'\n\nexport const filter =\n  (pattern: string, options: MinimatchOptions = {}) =>\n  (p: string) =>\n    minimatch(p, pattern, options)\nminimatch.filter = filter\n\nconst ext = (a: MinimatchOptions, b: MinimatchOptions = {}) =>\n  Object.assign({}, a, b)\n\nexport const defaults = (def: MinimatchOptions): typeof minimatch => {\n  if (!def || typeof def !== 'object' || !Object.keys(def).length) {\n    return minimatch\n  }\n\n  const orig = minimatch\n\n  const m = (p: string, pattern: string, options: MinimatchOptions = {}) =>\n    orig(p, pattern, ext(def, options))\n\n  return Object.assign(m, {\n    Minimatch: class Minimatch extends orig.Minimatch {\n      constructor(pattern: string, options: MinimatchOptions = {}) {\n        super(pattern, ext(def, options))\n      }\n      static defaults(options: MinimatchOptions) {\n        return orig.defaults(ext(def, options)).Minimatch\n      }\n    },\n\n    AST: class AST extends orig.AST {\n      /* c8 ignore start */\n      constructor(\n        type: ExtglobType | null,\n        parent?: AST,\n        options: MinimatchOptions = {},\n      ) {\n        super(type, parent, ext(def, options))\n      }\n      /* c8 ignore stop */\n\n      static fromGlob(pattern: string, options: MinimatchOptions = {}) {\n        return orig.AST.fromGlob(pattern, ext(def, options))\n      }\n    },\n\n    unescape: (\n      s: string,\n      options: Pick<\n        MinimatchOptions,\n        'windowsPathsNoEscape' | 'magicalBraces'\n      > = {},\n    ) => orig.unescape(s, ext(def, options)),\n\n    escape: (\n      s: string,\n      options: Pick<\n        MinimatchOptions,\n        'windowsPathsNoEscape' | 'magicalBraces'\n      > = {},\n    ) => orig.escape(s, ext(def, options)),\n\n    filter: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.filter(pattern, ext(def, options)),\n\n    defaults: (options: MinimatchOptions) =>\n      orig.defaults(ext(def, options)),\n\n    makeRe: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.makeRe(pattern, ext(def, options)),\n\n    braceExpand: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.braceExpand(pattern, ext(def, options)),\n\n    match: (\n      list: string[],\n      pattern: string,\n      options: MinimatchOptions = {},\n    ) => orig.match(list, pattern, ext(def, options)),\n\n    sep: orig.sep,\n    GLOBSTAR: GLOBSTAR as typeof GLOBSTAR,\n  })\n}\nminimatch.defaults = defaults\n\n// Brace expansion:\n// a{b,c}d -> abd acd\n// a{b,}c -> abc ac\n// a{0..3}d -> a0d a1d a2d a3d\n// a{b,c{d,e}f}g -> abg acdfg acefg\n// a{b,c}d{e,f}g -> abdeg acdeg abdeg abdfg\n//\n// Invalid sets are not expanded.\n// a{2..}b -> a{2..}b\n// a{b}c -> a{b}c\nexport const braceExpand = (\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  assertValidPattern(pattern)\n\n  // Thanks to Yeting Li <https://github.com/yetingli> for\n  // improving this regexp to avoid a ReDOS vulnerability.\n  if (options.nobrace || !/\\{(?:(?!\\{).)*\\}/.test(pattern)) {\n    // shortcut. no need to expand.\n    return [pattern]\n  }\n\n  return expand(pattern, { max: options.braceExpandMax })\n}\nminimatch.braceExpand = braceExpand\n\n// parse a component of the expanded set.\n// At this point, no pattern may contain \"/\" in it\n// so we're going to return a 2d array, where each entry is the full\n// pattern, split on '/', and then turned into a regular expression.\n// A regexp is made at the end which joins each array with an\n// escaped /, and another full one which joins each regexp with |.\n//\n// Following the lead of Bash 4.1, note that \"**\" only has special meaning\n// when it is the *only* thing in a path portion.  Otherwise, any series\n// of * is equivalent to a single *.  Globstar behavior is enabled by\n// default, and can be disabled by setting options.noglobstar.\n\nexport const makeRe = (pattern: string, options: MinimatchOptions = {}) =>\n  new Minimatch(pattern, options).makeRe()\nminimatch.makeRe = makeRe\n\nexport const match = (\n  list: string[],\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  const mm = new Minimatch(pattern, options)\n  list = list.filter(f => mm.match(f))\n  if (mm.options.nonull && !list.length) {\n    list.push(pattern)\n  }\n  return list\n}\nminimatch.match = match\n\n// replace stuff like \\* with *\nconst globMagic = /[?*]|[+@!]\\(.*?\\)|\\[|\\]/\nconst regExpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\nexport type MMRegExp = RegExp & {\n  _src?: string\n  _glob?: string\n}\n\nexport type ParseReturnFiltered = string | MMRegExp | typeof GLOBSTAR\nexport type ParseReturn = ParseReturnFiltered | false\n\nexport class Minimatch {\n  options: MinimatchOptions\n  set: ParseReturnFiltered[][]\n  pattern: string\n\n  windowsPathsNoEscape: boolean\n  nonegate: boolean\n  negate: boolean\n  comment: boolean\n  empty: boolean\n  preserveMultipleSlashes: boolean\n  partial: boolean\n  globSet: string[]\n  globParts: string[][]\n  nocase: boolean\n\n  isWindows: boolean\n  platform: Platform\n  windowsNoMagicRoot: boolean\n\n  regexp: false | null | MMRegExp\n  constructor(pattern: string, options: MinimatchOptions = {}) {\n    assertValidPattern(pattern)\n\n    options = options || {}\n    this.options = options\n    this.pattern = pattern\n    this.platform = options.platform || defaultPlatform\n    this.isWindows = this.platform === 'win32'\n    // avoid the annoying deprecation flag lol\n    const awe = ('allowWindow' + 'sEscape') as keyof MinimatchOptions\n    this.windowsPathsNoEscape =\n      !!options.windowsPathsNoEscape || options[awe] === false\n    if (this.windowsPathsNoEscape) {\n      this.pattern = this.pattern.replace(/\\\\/g, '/')\n    }\n    this.preserveMultipleSlashes = !!options.preserveMultipleSlashes\n    this.regexp = null\n    this.negate = false\n    this.nonegate = !!options.nonegate\n    this.comment = false\n    this.empty = false\n    this.partial = !!options.partial\n    this.nocase = !!this.options.nocase\n    this.windowsNoMagicRoot =\n      options.windowsNoMagicRoot !== undefined ?\n        options.windowsNoMagicRoot\n      : !!(this.isWindows && this.nocase)\n\n    this.globSet = []\n    this.globParts = []\n    this.set = []\n\n    // make the set of regexps etc.\n    this.make()\n  }\n\n  hasMagic(): boolean {\n    if (this.options.magicalBraces && this.set.length > 1) {\n      return true\n    }\n    for (const pattern of this.set) {\n      for (const part of pattern) {\n        if (typeof part !== 'string') return true\n      }\n    }\n    return false\n  }\n\n  debug(..._: any[]) {}\n\n  make() {\n    const pattern = this.pattern\n    const options = this.options\n\n    // empty patterns and comments match nothing.\n    if (!options.nocomment && pattern.charAt(0) === '#') {\n      this.comment = true\n      return\n    }\n\n    if (!pattern) {\n      this.empty = true\n      return\n    }\n\n    // step 1: figure out negation, etc.\n    this.parseNegate()\n\n    // step 2: expand braces\n    this.globSet = [...new Set(this.braceExpand())]\n\n    if (options.debug) {\n      this.debug = (...args: any[]) => console.error(...args)\n    }\n\n    this.debug(this.pattern, this.globSet)\n\n    // step 3: now we have a set, so turn each one into a series of\n    // path-portion matching patterns.\n    // These will be regexps, except in the case of \"**\", which is\n    // set to the GLOBSTAR object for globstar behavior,\n    // and will not contain any / characters\n    //\n    // First, we preprocess to make the glob pattern sets a bit simpler\n    // and deduped.  There are some perf-killing patterns that can cause\n    // problems with a glob walk, but we can simplify them down a bit.\n    const rawGlobParts = this.globSet.map(s => this.slashSplit(s))\n    this.globParts = this.preprocess(rawGlobParts)\n    this.debug(this.pattern, this.globParts)\n\n    // glob --> regexps\n    let set = this.globParts.map((s, _, __) => {\n      if (this.isWindows && this.windowsNoMagicRoot) {\n        // check if it's a drive or unc path.\n        const isUNC =\n          s[0] === '' &&\n          s[1] === '' &&\n          (s[2] === '?' || !globMagic.test(s[2])) &&\n          !globMagic.test(s[3])\n        const isDrive = /^[a-z]:/i.test(s[0])\n        if (isUNC) {\n          return [\n            ...s.slice(0, 4),\n            ...s.slice(4).map(ss => this.parse(ss)),\n          ]\n        } else if (isDrive) {\n          return [s[0], ...s.slice(1).map(ss => this.parse(ss))]\n        }\n      }\n      return s.map(ss => this.parse(ss))\n    })\n\n    this.debug(this.pattern, set)\n\n    // filter out everything that didn't compile properly.\n    this.set = set.filter(\n      s => s.indexOf(false) === -1,\n    ) as ParseReturnFiltered[][]\n\n    // do not treat the ? in UNC paths as magic\n    if (this.isWindows) {\n      for (let i = 0; i < this.set.length; i++) {\n        const p = this.set[i]\n        if (\n          p[0] === '' &&\n          p[1] === '' &&\n          this.globParts[i][2] === '?' &&\n          typeof p[3] === 'string' &&\n          /^[a-z]:$/i.test(p[3])\n        ) {\n          p[2] = '?'\n        }\n      }\n    }\n\n    this.debug(this.pattern, this.set)\n  }\n\n  // various transforms to equivalent pattern sets that are\n  // faster to process in a filesystem walk.  The goal is to\n  // eliminate what we can, and push all ** patterns as far\n  // to the right as possible, even if it increases the number\n  // of patterns that we have to process.\n  preprocess(globParts: string[][]) {\n    // if we're not in globstar mode, then turn ** into *\n    if (this.options.noglobstar) {\n      for (let i = 0; i < globParts.length; i++) {\n        for (let j = 0; j < globParts[i].length; j++) {\n          if (globParts[i][j] === '**') {\n            globParts[i][j] = '*'\n          }\n        }\n      }\n    }\n\n    const { optimizationLevel = 1 } = this.options\n\n    if (optimizationLevel >= 2) {\n      // aggressive optimization for the purpose of fs walking\n      globParts = this.firstPhasePreProcess(globParts)\n      globParts = this.secondPhasePreProcess(globParts)\n    } else if (optimizationLevel >= 1) {\n      // just basic optimizations to remove some .. parts\n      globParts = this.levelOneOptimize(globParts)\n    } else {\n      // just collapse multiple ** portions into one\n      globParts = this.adjascentGlobstarOptimize(globParts)\n    }\n\n    return globParts\n  }\n\n  // just get rid of adjascent ** portions\n  adjascentGlobstarOptimize(globParts: string[][]) {\n    return globParts.map(parts => {\n      let gs: number = -1\n      while (-1 !== (gs = parts.indexOf('**', gs + 1))) {\n        let i = gs\n        while (parts[i + 1] === '**') {\n          i++\n        }\n        if (i !== gs) {\n          parts.splice(gs, i - gs)\n        }\n      }\n      return parts\n    })\n  }\n\n  // get rid of adjascent ** and resolve .. portions\n  levelOneOptimize(globParts: string[][]) {\n    return globParts.map(parts => {\n      parts = parts.reduce((set: string[], part) => {\n        const prev = set[set.length - 1]\n        if (part === '**' && prev === '**') {\n          return set\n        }\n        if (part === '..') {\n          if (prev && prev !== '..' && prev !== '.' && prev !== '**') {\n            set.pop()\n            return set\n          }\n        }\n        set.push(part)\n        return set\n      }, [])\n      return parts.length === 0 ? [''] : parts\n    })\n  }\n\n  levelTwoFileOptimize(parts: string | string[]) {\n    if (!Array.isArray(parts)) {\n      parts = this.slashSplit(parts)\n    }\n    let didSomething: boolean = false\n    do {\n      didSomething = false\n      // <pre>/<e>/<rest> -> <pre>/<rest>\n      if (!this.preserveMultipleSlashes) {\n        for (let i = 1; i < parts.length - 1; i++) {\n          const p = parts[i]\n          // don't squeeze out UNC patterns\n          if (i === 1 && p === '' && parts[0] === '') continue\n          if (p === '.' || p === '') {\n            didSomething = true\n            parts.splice(i, 1)\n            i--\n          }\n        }\n        if (\n          parts[0] === '.' &&\n          parts.length === 2 &&\n          (parts[1] === '.' || parts[1] === '')\n        ) {\n          didSomething = true\n          parts.pop()\n        }\n      }\n\n      // <pre>/<p>/../<rest> -> <pre>/<rest>\n      let dd: number = 0\n      while (-1 !== (dd = parts.indexOf('..', dd + 1))) {\n        const p = parts[dd - 1]\n        if (p && p !== '.' && p !== '..' && p !== '**') {\n          didSomething = true\n          parts.splice(dd - 1, 2)\n          dd -= 2\n        }\n      }\n    } while (didSomething)\n    return parts.length === 0 ? [''] : parts\n  }\n\n  // First phase: single-pattern processing\n  // <pre> is 1 or more portions\n  // <rest> is 1 or more portions\n  // <p> is any portion other than ., .., '', or **\n  // <e> is . or ''\n  //\n  // **/.. is *brutal* for filesystem walking performance, because\n  // it effectively resets the recursive walk each time it occurs,\n  // and ** cannot be reduced out by a .. pattern part like a regexp\n  // or most strings (other than .., ., and '') can be.\n  //\n  // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n  // <pre>/<e>/<rest> -> <pre>/<rest>\n  // <pre>/<p>/../<rest> -> <pre>/<rest>\n  // **/**/<rest> -> **/<rest>\n  //\n  // **/*/<rest> -> */**/<rest> <== not valid because ** doesn't follow\n  // this WOULD be allowed if ** did follow symlinks, or * didn't\n  firstPhasePreProcess(globParts: string[][]) {\n    let didSomething = false\n    do {\n      didSomething = false\n      // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n      for (let parts of globParts) {\n        let gs: number = -1\n        while (-1 !== (gs = parts.indexOf('**', gs + 1))) {\n          let gss: number = gs\n          while (parts[gss + 1] === '**') {\n            // <pre>/**/**/<rest> -> <pre>/**/<rest>\n            gss++\n          }\n          // eg, if gs is 2 and gss is 4, that means we have 3 **\n          // parts, and can remove 2 of them.\n          if (gss > gs) {\n            parts.splice(gs + 1, gss - gs)\n          }\n\n          let next = parts[gs + 1]\n          const p = parts[gs + 2]\n          const p2 = parts[gs + 3]\n          if (next !== '..') continue\n          if (\n            !p ||\n            p === '.' ||\n            p === '..' ||\n            !p2 ||\n            p2 === '.' ||\n            p2 === '..'\n          ) {\n            continue\n          }\n          didSomething = true\n          // edit parts in place, and push the new one\n          parts.splice(gs, 1)\n          const other = parts.slice(0)\n          other[gs] = '**'\n          globParts.push(other)\n          gs--\n        }\n\n        // <pre>/<e>/<rest> -> <pre>/<rest>\n        if (!this.preserveMultipleSlashes) {\n          for (let i = 1; i < parts.length - 1; i++) {\n            const p = parts[i]\n            // don't squeeze out UNC patterns\n            if (i === 1 && p === '' && parts[0] === '') continue\n            if (p === '.' || p === '') {\n              didSomething = true\n              parts.splice(i, 1)\n              i--\n            }\n          }\n          if (\n            parts[0] === '.' &&\n            parts.length === 2 &&\n            (parts[1] === '.' || parts[1] === '')\n          ) {\n            didSomething = true\n            parts.pop()\n          }\n        }\n\n        // <pre>/<p>/../<rest> -> <pre>/<rest>\n        let dd: number = 0\n        while (-1 !== (dd = parts.indexOf('..', dd + 1))) {\n          const p = parts[dd - 1]\n          if (p && p !== '.' && p !== '..' && p !== '**') {\n            didSomething = true\n            const needDot = dd === 1 && parts[dd + 1] === '**'\n            const splin = needDot ? ['.'] : []\n            parts.splice(dd - 1, 2, ...splin)\n            if (parts.length === 0) parts.push('')\n            dd -= 2\n          }\n        }\n      }\n    } while (didSomething)\n\n    return globParts\n  }\n\n  // second phase: multi-pattern dedupes\n  // {<pre>/*/<rest>,<pre>/<p>/<rest>} -> <pre>/*/<rest>\n  // {<pre>/<rest>,<pre>/<rest>} -> <pre>/<rest>\n  // {<pre>/**/<rest>,<pre>/<rest>} -> <pre>/**/<rest>\n  //\n  // {<pre>/**/<rest>,<pre>/**/<p>/<rest>} -> <pre>/**/<rest>\n  // ^-- not valid because ** doens't follow symlinks\n  secondPhasePreProcess(globParts: string[][]): string[][] {\n    for (let i = 0; i < globParts.length - 1; i++) {\n      for (let j = i + 1; j < globParts.length; j++) {\n        const matched = this.partsMatch(\n          globParts[i],\n          globParts[j],\n          !this.preserveMultipleSlashes,\n        )\n        if (matched) {\n          globParts[i] = []\n          globParts[j] = matched\n          break\n        }\n      }\n    }\n    return globParts.filter(gs => gs.length)\n  }\n\n  partsMatch(\n    a: string[],\n    b: string[],\n    emptyGSMatch: boolean = false,\n  ): false | string[] {\n    let ai = 0\n    let bi = 0\n    let result: string[] = []\n    let which: string = ''\n    while (ai < a.length && bi < b.length) {\n      if (a[ai] === b[bi]) {\n        result.push(which === 'b' ? b[bi] : a[ai])\n        ai++\n        bi++\n      } else if (emptyGSMatch && a[ai] === '**' && b[bi] === a[ai + 1]) {\n        result.push(a[ai])\n        ai++\n      } else if (emptyGSMatch && b[bi] === '**' && a[ai] === b[bi + 1]) {\n        result.push(b[bi])\n        bi++\n      } else if (\n        a[ai] === '*' &&\n        b[bi] &&\n        (this.options.dot || !b[bi].startsWith('.')) &&\n        b[bi] !== '**'\n      ) {\n        if (which === 'b') return false\n        which = 'a'\n        result.push(a[ai])\n        ai++\n        bi++\n      } else if (\n        b[bi] === '*' &&\n        a[ai] &&\n        (this.options.dot || !a[ai].startsWith('.')) &&\n        a[ai] !== '**'\n      ) {\n        if (which === 'a') return false\n        which = 'b'\n        result.push(b[bi])\n        ai++\n        bi++\n      } else {\n        return false\n      }\n    }\n    // if we fall out of the loop, it means they two are identical\n    // as long as their lengths match\n    return a.length === b.length && result\n  }\n\n  parseNegate() {\n    if (this.nonegate) return\n\n    const pattern = this.pattern\n    let negate = false\n    let negateOffset = 0\n\n    for (let i = 0; i < pattern.length && pattern.charAt(i) === '!'; i++) {\n      negate = !negate\n      negateOffset++\n    }\n\n    if (negateOffset) this.pattern = pattern.slice(negateOffset)\n    this.negate = negate\n  }\n\n  // set partial to true to test if, for example,\n  // \"/a/b\" matches the start of \"/*/b/*/d\"\n  // Partial means, if you run out of file before you run\n  // out of pattern, then that's fine, as long as all\n  // the parts match.\n  matchOne(\n    file: string[],\n    pattern: ParseReturn[],\n    partial: boolean = false,\n  ) {\n    const options = this.options\n\n    // UNC paths like //?/X:/... can match X:/... and vice versa\n    // Drive letters in absolute drive or unc paths are always compared\n    // case-insensitively.\n    if (this.isWindows) {\n      const fileDrive =\n        typeof file[0] === 'string' && /^[a-z]:$/i.test(file[0])\n      const fileUNC =\n        !fileDrive &&\n        file[0] === '' &&\n        file[1] === '' &&\n        file[2] === '?' &&\n        /^[a-z]:$/i.test(file[3])\n\n      const patternDrive =\n        typeof pattern[0] === 'string' && /^[a-z]:$/i.test(pattern[0])\n      const patternUNC =\n        !patternDrive &&\n        pattern[0] === '' &&\n        pattern[1] === '' &&\n        pattern[2] === '?' &&\n        typeof pattern[3] === 'string' &&\n        /^[a-z]:$/i.test(pattern[3])\n\n      const fdi =\n        fileUNC ? 3\n        : fileDrive ? 0\n        : undefined\n      const pdi =\n        patternUNC ? 3\n        : patternDrive ? 0\n        : undefined\n      if (typeof fdi === 'number' && typeof pdi === 'number') {\n        const [fd, pd]: [string, string] = [\n          file[fdi],\n          pattern[pdi] as string,\n        ]\n        if (fd.toLowerCase() === pd.toLowerCase()) {\n          pattern[pdi] = fd\n          if (pdi > fdi) {\n            pattern = pattern.slice(pdi)\n          } else if (fdi > pdi) {\n            file = file.slice(fdi)\n          }\n        }\n      }\n    }\n\n    // resolve and reduce . and .. portions in the file as well.\n    // don't need to do the second phase, because it's only one string[]\n    const { optimizationLevel = 1 } = this.options\n    if (optimizationLevel >= 2) {\n      file = this.levelTwoFileOptimize(file)\n    }\n\n    this.debug('matchOne', this, { file, pattern })\n    this.debug('matchOne', file.length, pattern.length)\n\n    for (\n      var fi = 0, pi = 0, fl = file.length, pl = pattern.length;\n      fi < fl && pi < pl;\n      fi++, pi++\n    ) {\n      this.debug('matchOne loop')\n      var p = pattern[pi]\n      var f = file[fi]\n\n      this.debug(pattern, p, f)\n\n      // should be impossible.\n      // some invalid regexp stuff in the set.\n      /* c8 ignore start */\n      if (p === false) {\n        return false\n      }\n      /* c8 ignore stop */\n\n      if (p === GLOBSTAR) {\n        this.debug('GLOBSTAR', [pattern, p, f])\n\n        // \"**\"\n        // a/**/b/**/c would match the following:\n        // a/b/x/y/z/c\n        // a/x/y/z/b/c\n        // a/b/x/b/x/c\n        // a/b/c\n        // To do this, take the rest of the pattern after\n        // the **, and see if it would match the file remainder.\n        // If so, return success.\n        // If not, the ** \"swallows\" a segment, and try again.\n        // This is recursively awful.\n        //\n        // a/**/b/**/c matching a/b/x/y/z/c\n        // - a matches a\n        // - doublestar\n        //   - matchOne(b/x/y/z/c, b/**/c)\n        //     - b matches b\n        //     - doublestar\n        //       - matchOne(x/y/z/c, c) -> no\n        //       - matchOne(y/z/c, c) -> no\n        //       - matchOne(z/c, c) -> no\n        //       - matchOne(c, c) yes, hit\n        var fr = fi\n        var pr = pi + 1\n        if (pr === pl) {\n          this.debug('** at the end')\n          // a ** at the end will just swallow the rest.\n          // We have found a match.\n          // however, it will not swallow /.x, unless\n          // options.dot is set.\n          // . and .. are *never* matched by **, for explosively\n          // exponential reasons.\n          for (; fi < fl; fi++) {\n            if (\n              file[fi] === '.' ||\n              file[fi] === '..' ||\n              (!options.dot && file[fi].charAt(0) === '.')\n            )\n              return false\n          }\n          return true\n        }\n\n        // ok, let's see if we can swallow whatever we can.\n        while (fr < fl) {\n          var swallowee = file[fr]\n\n          this.debug('\\nglobstar while', file, fr, pattern, pr, swallowee)\n\n          // XXX remove this slice.  Just pass the start index.\n          if (this.matchOne(file.slice(fr), pattern.slice(pr), partial)) {\n            this.debug('globstar found match!', fr, fl, swallowee)\n            // found a match.\n            return true\n          } else {\n            // can't swallow \".\" or \"..\" ever.\n            // can only swallow \".foo\" when explicitly asked.\n            if (\n              swallowee === '.' ||\n              swallowee === '..' ||\n              (!options.dot && swallowee.charAt(0) === '.')\n            ) {\n              this.debug('dot detected!', file, fr, pattern, pr)\n              break\n            }\n\n            // ** swallows a segment, and continue.\n            this.debug('globstar swallow a segment, and continue')\n            fr++\n          }\n        }\n\n        // no match was found.\n        // However, in partial mode, we can't say this is necessarily over.\n        /* c8 ignore start */\n        if (partial) {\n          // ran out of file\n          this.debug('\\n>>> no match, partial?', file, fr, pattern, pr)\n          if (fr === fl) {\n            return true\n          }\n        }\n        /* c8 ignore stop */\n        return false\n      }\n\n      // something other than **\n      // non-magic patterns just have to match exactly\n      // patterns with magic have been turned into regexps.\n      let hit: boolean\n      if (typeof p === 'string') {\n        hit = f === p\n        this.debug('string match', p, f, hit)\n      } else {\n        hit = p.test(f)\n        this.debug('pattern match', p, f, hit)\n      }\n\n      if (!hit) return false\n    }\n\n    // Note: ending in / means that we'll get a final \"\"\n    // at the end of the pattern.  This can only match a\n    // corresponding \"\" at the end of the file.\n    // If the file ends in /, then it can only match a\n    // a pattern that ends in /, unless the pattern just\n    // doesn't have any more for it. But, a/b/ should *not*\n    // match \"a/b/*\", even though \"\" matches against the\n    // [^/]*? pattern, except in partial mode, where it might\n    // simply not be reached yet.\n    // However, a/b/ should still satisfy a/*\n\n    // now either we fell off the end of the pattern, or we're done.\n    if (fi === fl && pi === pl) {\n      // ran out of pattern and filename at the same time.\n      // an exact hit!\n      return true\n    } else if (fi === fl) {\n      // ran out of file, but still had pattern left.\n      // this is ok if we're doing the match as part of\n      // a glob fs traversal.\n      return partial\n    } else if (pi === pl) {\n      // ran out of pattern, still have file left.\n      // this is only acceptable if we're on the very last\n      // empty segment of a file with a trailing slash.\n      // a/* should match a/b/\n      return fi === fl - 1 && file[fi] === ''\n\n      /* c8 ignore start */\n    } else {\n      // should be unreachable.\n      throw new Error('wtf?')\n    }\n    /* c8 ignore stop */\n  }\n\n  braceExpand() {\n    return braceExpand(this.pattern, this.options)\n  }\n\n  parse(pattern: string): ParseReturn {\n    assertValidPattern(pattern)\n\n    const options = this.options\n\n    // shortcuts\n    if (pattern === '**') return GLOBSTAR\n    if (pattern === '') return ''\n\n    // far and away, the most common glob pattern parts are\n    // *, *.*, and *.<ext>  Add a fast check method for those.\n    let m: RegExpMatchArray | null\n    let fastTest: null | ((f: string) => boolean) = null\n    if ((m = pattern.match(starRE))) {\n      fastTest = options.dot ? starTestDot : starTest\n    } else if ((m = pattern.match(starDotExtRE))) {\n      fastTest = (\n        options.nocase ?\n          options.dot ?\n            starDotExtTestNocaseDot\n          : starDotExtTestNocase\n        : options.dot ? starDotExtTestDot\n        : starDotExtTest)(m[1])\n    } else if ((m = pattern.match(qmarksRE))) {\n      fastTest = (\n        options.nocase ?\n          options.dot ?\n            qmarksTestNocaseDot\n          : qmarksTestNocase\n        : options.dot ? qmarksTestDot\n        : qmarksTest)(m)\n    } else if ((m = pattern.match(starDotStarRE))) {\n      fastTest = options.dot ? starDotStarTestDot : starDotStarTest\n    } else if ((m = pattern.match(dotStarRE))) {\n      fastTest = dotStarTest\n    }\n\n    const re = AST.fromGlob(pattern, this.options).toMMPattern()\n    if (fastTest && typeof re === 'object') {\n      // Avoids overriding in frozen environments\n      Reflect.defineProperty(re, 'test', { value: fastTest })\n    }\n    return re\n  }\n\n  makeRe() {\n    if (this.regexp || this.regexp === false) return this.regexp\n\n    // at this point, this.set is a 2d array of partial\n    // pattern strings, or \"**\".\n    //\n    // It's better to use .match().  This function shouldn't\n    // be used, really, but it's pretty convenient sometimes,\n    // when you just want to work with a regex.\n    const set = this.set\n\n    if (!set.length) {\n      this.regexp = false\n      return this.regexp\n    }\n    const options = this.options\n\n    const twoStar =\n      options.noglobstar ? star\n      : options.dot ? twoStarDot\n      : twoStarNoDot\n    const flags = new Set(options.nocase ? ['i'] : [])\n\n    // regexpify non-globstar patterns\n    // if ** is only item, then we just do one twoStar\n    // if ** is first, and there are more, prepend (\\/|twoStar\\/)? to next\n    // if ** is last, append (\\/twoStar|) to previous\n    // if ** is in the middle, append (\\/|\\/twoStar\\/) to previous\n    // then filter out GLOBSTAR symbols\n    let re = set\n      .map(pattern => {\n        const pp: (string | typeof GLOBSTAR)[] = pattern.map(p => {\n          if (p instanceof RegExp) {\n            for (const f of p.flags.split('')) flags.add(f)\n          }\n          return (\n            typeof p === 'string' ? regExpEscape(p)\n            : p === GLOBSTAR ? GLOBSTAR\n            : p._src\n          )\n        }) as (string | typeof GLOBSTAR)[]\n        pp.forEach((p, i) => {\n          const next = pp[i + 1]\n          const prev = pp[i - 1]\n          if (p !== GLOBSTAR || prev === GLOBSTAR) {\n            return\n          }\n          if (prev === undefined) {\n            if (next !== undefined && next !== GLOBSTAR) {\n              pp[i + 1] = '(?:\\\\/|' + twoStar + '\\\\/)?' + next\n            } else {\n              pp[i] = twoStar\n            }\n          } else if (next === undefined) {\n            pp[i - 1] = prev + '(?:\\\\/|\\\\/' + twoStar + ')?'\n          } else if (next !== GLOBSTAR) {\n            pp[i - 1] = prev + '(?:\\\\/|\\\\/' + twoStar + '\\\\/)' + next\n            pp[i + 1] = GLOBSTAR\n          }\n        })\n        const filtered = pp.filter(p => p !== GLOBSTAR)\n\n        // For partial matches, we need to make the pattern match\n        // any prefix of the full path. We do this by generating\n        // alternative patterns that match progressively longer prefixes.\n        if (this.partial && filtered.length >= 1) {\n          const prefixes: string[] = []\n          for (let i = 1; i <= filtered.length; i++) {\n            prefixes.push(filtered.slice(0, i).join('/'))\n          }\n          return '(?:' + prefixes.join('|') + ')'\n        }\n\n        return filtered.join('/')\n      })\n      .join('|')\n\n    // need to wrap in parens if we had more than one thing with |,\n    // otherwise only the first will be anchored to ^ and the last to $\n    const [open, close] = set.length > 1 ? ['(?:', ')'] : ['', '']\n    // must match entire pattern\n    // ending in a * or ** will make it less strict.\n    re = '^' + open + re + close + '$'\n\n    // In partial mode, '/' should always match as it's a valid prefix for any pattern\n    if (this.partial) {\n      re = '^(?:\\\\/|' + open + re.slice(1, -1) + close + ')$'\n    }\n\n    // can match anything, as long as it's not this.\n    if (this.negate) re = '^(?!' + re + ').+$'\n\n    try {\n      this.regexp = new RegExp(re, [...flags].join(''))\n      /* c8 ignore start */\n    } catch (ex) {\n      // should be impossible\n      this.regexp = false\n    }\n    /* c8 ignore stop */\n    return this.regexp\n  }\n\n  slashSplit(p: string) {\n    // if p starts with // on windows, we preserve that\n    // so that UNC paths aren't broken.  Otherwise, any number of\n    // / characters are coalesced into one, unless\n    // preserveMultipleSlashes is set to true.\n    if (this.preserveMultipleSlashes) {\n      return p.split('/')\n    } else if (this.isWindows && /^\\/\\/[^\\/]+/.test(p)) {\n      // add an extra '' for the one we lose\n      return ['', ...p.split(/\\/+/)]\n    } else {\n      return p.split(/\\/+/)\n    }\n  }\n\n  match(f: string, partial = this.partial) {\n    this.debug('match', f, this.pattern)\n    // short-circuit in the case of busted things.\n    // comments, etc.\n    if (this.comment) {\n      return false\n    }\n    if (this.empty) {\n      return f === ''\n    }\n\n    if (f === '/' && partial) {\n      return true\n    }\n\n    const options = this.options\n\n    // windows: need to use /, not \\\n    if (this.isWindows) {\n      f = f.split('\\\\').join('/')\n    }\n\n    // treat the test path as a set of pathparts.\n    const ff = this.slashSplit(f)\n    this.debug(this.pattern, 'split', ff)\n\n    // just ONE of the pattern sets in this.set needs to match\n    // in order for it to be valid.  If negating, then just one\n    // match means that we have failed.\n    // Either way, return on the first hit.\n\n    const set = this.set\n    this.debug(this.pattern, 'set', set)\n\n    // Find the basename of the path by looking for the last non-empty segment\n    let filename: string = ff[ff.length - 1]\n    if (!filename) {\n      for (let i = ff.length - 2; !filename && i >= 0; i--) {\n        filename = ff[i]\n      }\n    }\n\n    for (let i = 0; i < set.length; i++) {\n      const pattern = set[i]\n      let file = ff\n      if (options.matchBase && pattern.length === 1) {\n        file = [filename]\n      }\n      const hit = this.matchOne(file, pattern, partial)\n      if (hit) {\n        if (options.flipNegate) {\n          return true\n        }\n        return !this.negate\n      }\n    }\n\n    // didn't get any hits.  this is success if it's a negative\n    // pattern, failure otherwise.\n    if (options.flipNegate) {\n      return false\n    }\n    return this.negate\n  }\n\n  static defaults(def: MinimatchOptions) {\n    return minimatch.defaults(def).Minimatch\n  }\n}\n/* c8 ignore start */\nexport { AST } from './ast.js'\nexport { escape } from './escape.js'\nexport { unescape } from './unescape.js'\n/* c8 ignore stop */\nminimatch.AST = AST\nminimatch.Minimatch = Minimatch\nminimatch.escape = escape\nminimatch.unescape = unescape\n", "// only print the logs if it fails, or if TSHY_VERBOSE is set\n\nlet verbose = parseInt(process.env.TSHY_VERBOSE || '0')\n\nconst errors: any[][] = []\nexport const error = (...a: any[]) => {\n  if (verbose >= 1) console.error(...a)\n  else errors.push(a)\n}\nexport const debug = (...a: any[]) => {\n  if (verbose >= 2) console.error(...a)\n  else errors.push(a)\n}\n\n// we only print stdout on success anyway\nexport const log = (...a: any[]) => {\n  if (verbose >= 1) console.log(...a)\n}\n\nexport const print = () => {\n  for (const a of errors) {\n    console.error(...a)\n  }\n  errors.length = 0\n}\n", "import chalk from 'chalk'\nimport * as console from './console.js'\nexport default (message: string, er?: Error) => {\n  console.error(chalk.red.bold(message))\n  if (er) console.error(er.message)\n  console.print()\n}\n", "// get the package.json data for the cwd\n\nimport { readFileSync } from 'fs'\nimport { JSONResult, parse, stringify } from 'polite-json'\nimport fail from './fail.js'\nimport { Package } from './types.js'\n\nconst isPackage = (pkg: JSONResult): pkg is Package =>\n  !!pkg && typeof pkg === 'object' && !Array.isArray(pkg)\n\nconst readPkg = (): Package & { type: 'commonjs' | 'module' } => {\n  try {\n    const res = parse(readFileSync('package.json', 'utf8'))\n    if (isPackage(res)) {\n      return Object.assign(res, {\n        type: res.type === 'commonjs' ? 'commonjs' : 'module',\n      })\n    }\n    throw new Error('Invalid package.json contents: ' + stringify(res))\n  } catch (er) {\n    fail('failed to read package.json', er as Error)\n    process.exit(1)\n  }\n}\n\nexport default readPkg()\n", "/**\n * Copyright 2017 Kat Marchán\n * Copyright npm, Inc.\n * Copyright 2023 Isaac Z. Schlueter\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n * DEALINGS IN THE SOFTWARE.\n *\n * ---\n *\n * 'polite-json' is a fork of 'json-parse-even-better-errors',\n * extended and distributed under the terms of the MIT license\n * above.\n *\n * 'json-parse-even-better-errors' is a fork of\n * 'json-parse-better-errors' by Kat Marchán, extended and\n * distributed under the terms of the MIT license above.\n */\n\n// version specific\n/* c8 ignore start */\nconst hexify = (s: string) =>\n  Array.from(s)\n    .map(\n      c => '0x' + c.charCodeAt(0).toString(16).toUpperCase().padStart(2, '0')\n    )\n    .join('')\n/* c8 ignore stop */\n\ntype ParseErrorMeta = {\n  message: string\n  position: number\n}\nconst parseError = (e: Error, txt: string, context: number): ParseErrorMeta => {\n  if (!txt) {\n    return {\n      message: e.message + ' while parsing empty string',\n      position: 0,\n    }\n  }\n  const badToken = e.message.match(/^Unexpected (?:token (.*?))?/i)\n  const atPos = e.message.match(/at positions? (\\d+)/)\n\n  // version specific\n  /* c8 ignore start */\n  const errIdx = /^Unexpected end of JSON|Unterminated string in JSON/i.test(\n    e.message\n  )\n    ? txt.length - 1\n    : atPos && atPos[1]\n    ? +atPos[1]\n    : /is not valid JSON$/.test(e.message)\n    ? 0\n    : null\n\n  const msg =\n    badToken && badToken[1]\n      ? e.message.replace(\n          /^Unexpected token ./,\n          `Unexpected token ${JSON.stringify(badToken[1])} (${hexify(\n            badToken[1]\n          )})`\n        )\n      : e.message\n  /* c8 ignore stop */\n\n  if (errIdx !== null && errIdx !== undefined) {\n    const start = errIdx <= context ? 0 : errIdx - context\n\n    const end = errIdx + context >= txt.length ? txt.length : errIdx + context\n\n    const slice =\n      (start === 0 ? '' : '...') +\n      txt.slice(start, end) +\n      (end === txt.length ? '' : '...')\n\n    const near = txt === slice ? '' : 'near '\n\n    return {\n      message: msg + ` while parsing ${near}${JSON.stringify(slice)}`,\n      position: errIdx,\n    }\n  } else {\n    return {\n      message: msg + ` while parsing '${txt.slice(0, context * 2)}'`,\n      position: 0,\n    }\n  }\n}\n\nexport class JSONParseError extends SyntaxError {\n  code: 'EJSONPARSE'\n  cause: Error\n  position: number\n  constructor(\n    er: Error,\n    txt: string,\n    context: number = 20,\n    caller?: Function | ((...a: any[]) => any)\n  ) {\n    const { message, position } = parseError(er, txt, context)\n    super(message)\n    this.cause = er\n    this.position = position\n    this.code = 'EJSONPARSE'\n    Error.captureStackTrace(this, caller || this.constructor)\n  }\n  get name() {\n    return this.constructor.name\n  }\n  set name(_) {}\n  get [Symbol.toStringTag]() {\n    return this.constructor.name\n  }\n}\n\nexport const kIndent = Symbol.for('indent')\nexport const kNewline = Symbol.for('newline')\n// only respect indentation if we got a line break, otherwise squash it\n// things other than objects and arrays aren't indented, so ignore those\n// Important: in both of these regexps, the $1 capture group is the newline\n// or undefined, and the $2 capture group is the indent, or undefined.\nconst formatRE = /^\\s*[{\\[]((?:\\r?\\n)+)([\\s\\t]*)/\nconst emptyRE = /^(?:\\{\\}|\\[\\])((?:\\r?\\n)+)?$/\n\nexport type Reviver = (this: any, key: string, value: any) => any\nexport type Replacer =\n  | ((this: any, key: string, value: any) => any)\n  | (string | number)[]\n  | null\nexport type Scalar = string | number | null\nexport type JSONResult =\n  | {\n      [k: string]: JSONResult\n      [kIndent]?: string\n      [kNewline]?: string\n    }\n  | (JSONResult[] & { [kIndent]?: string; [kNewline]?: string })\n  | Scalar\n\nexport const parse = (\n  txt: string | Buffer,\n  reviver?: Reviver | null,\n  context?: number\n): JSONResult => {\n  const parseText = stripBOM(String(txt))\n  if (!reviver) reviver = undefined\n  context = context || 20\n  try {\n    // get the indentation so that we can save it back nicely\n    // if the file starts with {\" then we have an indent of '', ie, none\n    // otherwise, pick the indentation of the next line after the first \\n\n    // If the pattern doesn't match, then it means no indentation.\n    // JSON.stringify ignores symbols, so this is reasonably safe.\n    // if the string is '{}' or '[]', then use the default 2-space indent.\n    const [, newline = '\\n', indent = '  '] = parseText.match(emptyRE) ||\n      parseText.match(formatRE) || [, '', '']\n\n    const result = JSON.parse(parseText, reviver)\n    if (result && typeof result === 'object') {\n      result[kNewline] = newline\n      result[kIndent] = indent\n    }\n    return result\n  } catch (e) {\n    if (typeof txt !== 'string' && !Buffer.isBuffer(txt)) {\n      const isEmptyArray =\n        Array.isArray(txt) && (txt as Array<any>).length === 0\n      throw Object.assign(\n        new TypeError(\n          `Cannot parse ${isEmptyArray ? 'an empty array' : String(txt)}`\n        ),\n        {\n          code: 'EJSONPARSE',\n          systemError: e,\n        }\n      )\n    }\n\n    throw new JSONParseError(e as Error, parseText, context, parse)\n  }\n}\n\nexport const parseNoExceptions = (txt: string | Buffer, reviver?: Reviver) => {\n  try {\n    return JSON.parse(stripBOM(String(txt)), reviver)\n  } catch (e) {}\n}\n\n// Remove byte order marker. This catches EF BB BF (the UTF-8 BOM)\n// because the buffer-to-string conversion in `fs.readFileSync()`\n// translates it to FEFF, the UTF-16 BOM.\nconst stripBOM = (txt: string) => String(txt).replace(/^\\uFEFF/, '')\n\nexport const stringify = (\n  obj: any,\n  replacer?: Replacer,\n  indent?: string | number\n) => {\n  const space = indent === undefined ? obj[kIndent] : indent\n  // TS is so weird with parameter overloads\n  const res =\n    /* c8 ignore start */\n    typeof replacer === 'function'\n      ? JSON.stringify(obj, replacer, space)\n      : JSON.stringify(obj, replacer, space)\n  /* c8 ignore stop */\n  const nl = obj[kNewline] || '\\n'\n  return space ? (nl === '\\n' ? res : res.split('\\n').join(nl)) + nl : res\n}\n", "// get the list of sources in ./src\n\nimport { readdirSync } from 'fs'\nimport { join } from 'path/posix'\n\nconst getSources = (dir = 'src'): string[] => {\n  const sources: string[] = []\n  const entries = readdirSync(dir, { withFileTypes: true })\n  for (const e of entries) {\n    const j = `./${join(dir, e.name)}`\n    if (e.isFile()) sources.push(j)\n    else if (e.isDirectory()) {\n      sources.push(...getSources(j))\n    }\n  }\n  return sources\n}\n\nconst sources = new Set(getSources())\nexport default sources\n", "import fail from './fail.js'\nimport { Dialect, TshyConfig } from './types.js'\n\nexport const isDialect = (d: any): d is Dialect =>\n  d === 'commonjs' || d === 'esm'\n\nexport default (\n  d: any,\n): d is Exclude<TshyConfig['dialects'], undefined> => {\n  if (!!d && Array.isArray(d) && d.length && !d.some(d => !isDialect(d))) {\n    return true\n  }\n\n  fail(\n    `tshy.dialects must be an array including \"esm\" and/or \"commonjs\", ` +\n      `got: ${JSON.stringify(d)}`,\n  )\n  return process.exit(1)\n}\n", "import fail from './fail.js'\nimport { TshyConfig } from './types.js'\nexport default (\n  d: any,\n): d is Exclude<TshyConfig['exclude'], undefined> => {\n  if (\n    !!d &&\n    Array.isArray(d) &&\n    d.length &&\n    !d.some(d => typeof d !== 'string')\n  ) {\n    return true\n  }\n  fail(\n    `tshy.exclude must be an array of string glob patterns if defined, ` +\n      `got: ${JSON.stringify(d)}`,\n  )\n  return process.exit(1)\n}\n", "import { join } from 'node:path/posix'\nexport default (s: string) => `./${join(s)}`\n", "import { join } from 'path/posix'\nimport type { ConditionalValueObject } from 'resolve-import'\nimport { resolveExport } from './resolve-export.js'\n\nexport default (exp: any): exp is ConditionalValueObject => {\n  const i = resolveExport(exp, ['import'])\n  const r = resolveExport(exp, ['require'])\n  if (i && join(i).startsWith('src/')) return false\n  if (r && join(r).startsWith('src/')) return false\n  return true\n}\n", "export const resolveExport = (\n  exp: any,\n  conditions: string[],\n): string | undefined | null => {\n  if (typeof exp === 'string') return exp\n  if (typeof exp !== 'object') return undefined\n  if (exp === null) return exp\n  if (Array.isArray(exp)) {\n    for (const e of exp) {\n      const u = resolveExport(e, conditions)\n      if (u || u === null) return u\n    }\n    return undefined\n  }\n  const conds = [...conditions, 'node', 'default']\n  for (const [c, e] of Object.entries(exp)) {\n    if (conds.includes(c)) {\n      const u = resolveExport(e, conditions)\n      if (u || u === null) return u\n    }\n  }\n}\n", "import addDot from './add-dot.js'\nimport fail from './fail.js'\nimport { TshyConfig } from './types.js'\nimport validExternalExport from './valid-external-export.js'\n\nexport default (\n  e: any,\n): e is Exclude<TshyConfig['exports'], undefined> => {\n  if (!e || typeof e !== 'object' || Array.isArray(e)) return false\n  for (const [sub, exp] of Object.entries(e)) {\n    if (sub !== '.' && !sub.startsWith('./')) {\n      fail(`tshy.exports key must be \".\" or start with \"./\", got: ${sub}`)\n      return process.exit(1)\n    }\n\n    // just a module. either a built export, or a simple unbuilt export\n    if (typeof exp === 'string') {\n      e[sub] = addDot(exp)\n      continue\n    }\n\n    if (typeof exp !== 'object') {\n      fail(\n        `tshy.exports ${sub} value must be valid package.json exports ` +\n          `value, got: ${JSON.stringify(exp)}`,\n      )\n      return process.exit(1)\n    }\n\n    // can be any valid external export, but the resolution of\n    // import and require must NOT be in ./src\n    if (!validExternalExport(exp)) {\n      fail(\n        `tshy.exports ${sub} unbuilt exports must not be in ./src, ` +\n          `and exports in src must be string values. ` +\n          `got: ${JSON.stringify(exp)}`,\n      )\n      return process.exit(1)\n    }\n\n    e[sub] = exp\n  }\n  return true\n}\n", "// validate esmDialects and commonjsDialects\nimport fail from './fail.js'\nimport { TshyConfig } from './types.js'\n\nconst arrayOverlap = (\n  a: string[] | undefined,\n  b: string[] | undefined,\n): string | false => {\n  if (!a || !b) return false\n  for (const av of a) {\n    if (b.includes(av)) return av\n  }\n  return false\n}\n\nconst validExtraDialectSet = (\n  e: string[],\n  which: 'commonjs' | 'esm' | 'source',\n) => {\n  for (const d of e) {\n    if (typeof d !== 'string') {\n      fail(`${which} must be an array of strings, got: ${d}`)\n      return process.exit(1)\n    }\n    if (\n      d === 'commonjs' ||\n      d === 'cjs' ||\n      d === 'esm' ||\n      d === 'require' ||\n      d === 'import' ||\n      d === 'node' ||\n      d === 'source' ||\n      d === 'default'\n    ) {\n      fail(`tshy.${which}Dialects must not contain ${JSON.stringify(d)}`)\n      return process.exit(1)\n    }\n  }\n  return true\n}\n\nexport default ({\n  commonjsDialects,\n  esmDialects,\n  sourceDialects,\n}: TshyConfig) => {\n  if (\n    commonjsDialects === undefined &&\n    esmDialects === undefined &&\n    sourceDialects === undefined\n  ) {\n    return true\n  }\n  if (\n    commonjsDialects &&\n    !validExtraDialectSet(commonjsDialects, 'commonjs')\n  ) {\n    return false\n  }\n  if (esmDialects && !validExtraDialectSet(esmDialects, 'esm')) {\n    return false\n  }\n  if (sourceDialects && !validExtraDialectSet(sourceDialects, 'source')) {\n    return false\n  }\n  for (const [aname, bname, a, b] of [\n    ['commonjsDialects', 'esmDialects', commonjsDialects, esmDialects],\n    [\n      'commonjsDialects',\n      'sourceDialects',\n      commonjsDialects,\n      sourceDialects,\n    ],\n    ['esmDialects', 'sourceDialects', esmDialects, sourceDialects],\n  ] as const) {\n    const overlap = arrayOverlap(a, b)\n    if (!overlap) continue\n    fail(\n      `${aname} and ${bname} must be unique, found ${overlap} in both lists`,\n    )\n    return process.exit(1)\n  }\n  return true\n}\n", "import fail from './fail.js'\nimport { Package } from './types.js'\nimport validExternalExport from './valid-external-export.js'\n\n// validate the package.imports field\nexport default (pkg: Package) => {\n  const { imports } = pkg\n  if (imports === undefined) return true\n  if (Array.isArray(imports) || typeof imports !== 'object') {\n    fail(\n      'invalid imports object, must be Record<string, Import>, ' +\n        `got: ${JSON.stringify(imports)}`,\n    )\n    return process.exit(1)\n  }\n\n  for (const [i, v] of Object.entries(imports)) {\n    if (!i.startsWith('#') || i === '#' || i.startsWith('#/')) {\n      fail('invalid imports module specifier: ' + i)\n      return process.exit(1)\n    }\n    if (typeof v === 'string') continue\n    if (!validExternalExport(v)) {\n      fail(\n        `unbuilt package.imports ${i} must not be in ./src, ` +\n          'and imports in ./src must be string values. got: ' +\n          JSON.stringify(v),\n      )\n      return process.exit(1)\n    }\n  }\n  return true\n}\n", "import { resolve } from 'path'\nimport { readFileSync } from 'node:fs'\nimport fail from './fail.js'\nimport { TshyConfig } from './types.js'\n\nexport default (p: unknown): p is TshyConfig['project'] => {\n  if (typeof p === 'string') {\n    try {\n      readFileSync(resolve(p), 'utf8')\n      return true\n    } catch (_) {}\n  }\n\n  fail(\n    `tshy.project must point to a tsconfig file on disk, ` +\n      `got: ${JSON.stringify(p)}`,\n  )\n  return process.exit(1)\n}\n", "import type { TshyConfig } from './types.js'\n\nexport default (compiler?: unknown): compiler is TshyConfig['compiler'] =>\n  compiler === undefined || compiler === 'tsc' || compiler === 'tsgo'\n", "// get the config and package and stuff\n\nimport chalk from 'chalk'\nimport { Minimatch } from 'minimatch'\nimport * as console from './console.js'\nimport fail from './fail.js'\nimport pkg from './package.js'\nimport sources from './sources.js'\nimport {\n  Package,\n  TshyConfig,\n  TshyConfigMaybeGlobExports,\n} from './types.js'\nimport validDialects from './valid-dialects.js'\nimport validExclude from './valid-exclude.js'\nimport validExports from './valid-exports.js'\nimport validExtraDialects from './valid-extra-dialects.js'\nimport validImports from './valid-imports.js'\nimport validProject from './valid-project.js'\nimport validCompiler from './valid-compiler.js'\n\nconst validBoolean = (e: Record<string, any>, name: string) => {\n  const v = e[name]\n  if (v === undefined || typeof v === 'boolean') return true\n  fail(`tshy.${name} must be a boolean value if specified, got: ` + v)\n  return process.exit(1)\n}\n\nconst isStringArray = (e: any): e is string[] =>\n  !!e && Array.isArray(e) && !e.some(e => typeof e !== 'string')\n\nconst validConfig = (e: any): e is TshyConfigMaybeGlobExports =>\n  !!e &&\n  typeof e === 'object' &&\n  (e.exports === undefined ||\n    typeof e.exports === 'string' ||\n    isStringArray(e.exports) ||\n    validExports(e.exports)) &&\n  (e.dialects === undefined || validDialects(e.dialects)) &&\n  (e.project === undefined || validProject(e.project)) &&\n  (e.exclude === undefined || validExclude(e.exclude)) &&\n  validExtraDialects(e) &&\n  validCompiler(e.compiler) &&\n  validBoolean(e, 'selfLink') &&\n  validBoolean(e, 'main') &&\n  validBoolean(e, 'liveDev')\n\nconst match = (e: string, pattern: Minimatch[]): boolean =>\n  pattern.some(m => m.match(e))\n\nconst parsePattern = (p: string | string[]): Minimatch[] =>\n  Array.isArray(p) ?\n    p.map(p => new Minimatch(p.replace(/^\\.\\//, '')))\n  : parsePattern([p])\n\nconst getConfig = (pkg: Package, sources: Set<string>): TshyConfig => {\n  const tshy: TshyConfigMaybeGlobExports =\n    validConfig(pkg.tshy) ? pkg.tshy : {}\n  let exportsConfig = tshy.exports\n  if (typeof exportsConfig === 'string' || Array.isArray(exportsConfig)) {\n    // Strip off the `./src` prefix and the extension\n    // exports: \"src/**/*.ts\" => exports: {\"./foo\": \"./src/foo.ts\"}\n    const exp: Exclude<TshyConfig['exports'], undefined> = {}\n    const pattern: string | string[] = exportsConfig\n    const m = parsePattern(pattern)\n    for (const e of sources) {\n      if (!match(e.replace(/^\\.\\//, ''), m)) continue\n      // index is main, anything else is a subpath\n      const sp =\n        /^\\.\\/src\\/index.([mc]?[jt]s|[jt]sx)$/.test(e) ? '.' : (\n          './' +\n          e.replace(/^\\.\\/src\\//, '').replace(/\\.([mc]?[tj]s|[jt]sx)$/, '')\n        )\n      exp[sp] = `./${e}`\n    }\n    /* c8 ignore start - should be impossible */\n    if (!validExports(exp)) {\n      console.error('invalid exports pattern, using default exports')\n      delete tshy.exports\n      exportsConfig = undefined\n    } else {\n      /* c8 ignore stop */\n      exp['./package.json'] = './package.json'\n      tshy.exports = exp\n    }\n  }\n  const config = { ...tshy } as TshyConfig\n  const ti = config as TshyConfig & { imports?: any }\n  if (ti.imports) {\n    console.debug(\n      chalk.cyan.dim('imports') + ' moving from tshy config to top level',\n    )\n    pkg.imports = {\n      ...pkg.imports,\n      ...ti.imports,\n    }\n    delete ti.imports\n  }\n  validImports(pkg)\n  if (!exportsConfig) {\n    const e: Exclude<TshyConfig['exports'], undefined> = {\n      './package.json': './package.json',\n    }\n    for (const i of sources) {\n      if (/^\\.\\/src\\/index\\.[^\\.]+$/.test(i)) {\n        e['.'] = i\n        break\n      }\n    }\n    config.exports = e\n    tshy.exports = e\n    exportsConfig = e\n  }\n  // return the filled out config, but leave the package.json\n  // exports as they were, as long as they turned out to be valid.\n  pkg.tshy = { ...tshy, exports: exportsConfig }\n  return config\n}\n\nconst config: TshyConfig = getConfig(pkg, sources)\nexport default config\n", "export const balanced = (\n  a: string | RegExp,\n  b: string | RegExp,\n  str: string,\n) => {\n  const ma = a instanceof RegExp ? maybeMatch(a, str) : a\n  const mb = b instanceof RegExp ? maybeMatch(b, str) : b\n\n  const r = ma !== null && mb != null && range(ma, mb, str)\n\n  return (\n    r && {\n      start: r[0],\n      end: r[1],\n      pre: str.slice(0, r[0]),\n      body: str.slice(r[0] + ma.length, r[1]),\n      post: str.slice(r[1] + mb.length),\n    }\n  )\n}\n\nconst maybeMatch = (reg: RegExp, str: string) => {\n  const m = str.match(reg)\n  return m ? m[0] : null\n}\n\nexport const range = (\n  a: string,\n  b: string,\n  str: string,\n): undefined | [number, number] => {\n  let begs: number[],\n    beg: number | undefined,\n    left: number,\n    right: number | undefined = undefined,\n    result: undefined | [number, number]\n  let ai = str.indexOf(a)\n  let bi = str.indexOf(b, ai + 1)\n  let i = ai\n\n  if (ai >= 0 && bi > 0) {\n    if (a === b) {\n      return [ai, bi]\n    }\n    begs = []\n    left = str.length\n\n    while (i >= 0 && !result) {\n      if (i === ai) {\n        begs.push(i)\n        ai = str.indexOf(a, i + 1)\n      } else if (begs.length === 1) {\n        const r = begs.pop()\n        if (r !== undefined) result = [r, bi]\n      } else {\n        beg = begs.pop()\n        if (beg !== undefined && beg < left) {\n          left = beg\n          right = bi\n        }\n\n        bi = str.indexOf(b, i + 1)\n      }\n\n      i = ai < bi && ai >= 0 ? ai : bi\n    }\n\n    if (begs.length && right !== undefined) {\n      result = [left, right]\n    }\n  }\n\n  return result\n}\n", "import { balanced } from 'balanced-match'\n\nconst escSlash = '\\0SLASH' + Math.random() + '\\0'\nconst escOpen = '\\0OPEN' + Math.random() + '\\0'\nconst escClose = '\\0CLOSE' + Math.random() + '\\0'\nconst escComma = '\\0COMMA' + Math.random() + '\\0'\nconst escPeriod = '\\0PERIOD' + Math.random() + '\\0'\nconst escSlashPattern = new RegExp(escSlash, 'g')\nconst escOpenPattern = new RegExp(escOpen, 'g')\nconst escClosePattern = new RegExp(escClose, 'g')\nconst escCommaPattern = new RegExp(escComma, 'g')\nconst escPeriodPattern = new RegExp(escPeriod, 'g')\nconst slashPattern = /\\\\\\\\/g\nconst openPattern = /\\\\{/g\nconst closePattern = /\\\\}/g\nconst commaPattern = /\\\\,/g\nconst periodPattern = /\\\\./g\n\nexport const EXPANSION_MAX = 100_000\n\nfunction numeric(str: string) {\n  return !isNaN(str as any) ? parseInt(str, 10) : str.charCodeAt(0)\n}\n\nfunction escapeBraces(str: string) {\n  return str\n    .replace(slashPattern, escSlash)\n    .replace(openPattern, escOpen)\n    .replace(closePattern, escClose)\n    .replace(commaPattern, escComma)\n    .replace(periodPattern, escPeriod)\n}\n\nfunction unescapeBraces(str: string) {\n  return str\n    .replace(escSlashPattern, '\\\\')\n    .replace(escOpenPattern, '{')\n    .replace(escClosePattern, '}')\n    .replace(escCommaPattern, ',')\n    .replace(escPeriodPattern, '.')\n}\n\n/**\n * Basically just str.split(\",\"), but handling cases\n * where we have nested braced sections, which should be\n * treated as individual members, like {a,{b,c},d}\n */\nfunction parseCommaParts(str: string) {\n  if (!str) {\n    return ['']\n  }\n\n  const parts: string[] = []\n  const m = balanced('{', '}', str)\n\n  if (!m) {\n    return str.split(',')\n  }\n\n  const { pre, body, post } = m\n  const p = pre.split(',')\n\n  p[p.length - 1] += '{' + body + '}'\n  const postParts = parseCommaParts(post)\n  if (post.length) {\n    ;(p[p.length - 1] as string) += postParts.shift()\n    p.push.apply(p, postParts)\n  }\n\n  parts.push.apply(parts, p)\n\n  return parts\n}\n\nexport type BraceExpansionOptions = {\n  max?: number\n}\n\nexport function expand(str: string, options: BraceExpansionOptions = {}) {\n  if (!str) {\n    return []\n  }\n\n  const { max = EXPANSION_MAX } = options\n\n  // I don't know why Bash 4.3 does this, but it does.\n  // Anything starting with {} will have the first two bytes preserved\n  // but *only* at the top level, so {},a}b will not expand to anything,\n  // but a{},b}c will be expanded to [a}c,abc].\n  // One could argue that this is a bug in Bash, but since the goal of\n  // this module is to match Bash's rules, we escape a leading {}\n  if (str.slice(0, 2) === '{}') {\n    str = '\\\\{\\\\}' + str.slice(2)\n  }\n\n  return expand_(escapeBraces(str), max, true).map(unescapeBraces)\n}\n\nfunction embrace(str: string) {\n  return '{' + str + '}'\n}\n\nfunction isPadded(el: string) {\n  return /^-?0\\d/.test(el)\n}\n\nfunction lte(i: number, y: number) {\n  return i <= y\n}\n\nfunction gte(i: number, y: number) {\n  return i >= y\n}\n\nfunction expand_(str: string, max: number, isTop: boolean): string[] {\n  /** @type {string[]} */\n  const expansions: string[] = []\n\n  const m = balanced('{', '}', str)\n  if (!m) return [str]\n\n  // no need to expand pre, since it is guaranteed to be free of brace-sets\n  const pre = m.pre\n  const post: string[] = m.post.length ? expand_(m.post, max, false) : ['']\n\n  if (/\\$$/.test(m.pre)) {\n    for (let k = 0; k < post.length && k < max; k++) {\n      const expansion = pre + '{' + m.body + '}' + post[k]\n      expansions.push(expansion)\n    }\n  } else {\n    const isNumericSequence = /^-?\\d+\\.\\.-?\\d+(?:\\.\\.-?\\d+)?$/.test(m.body)\n    const isAlphaSequence = /^[a-zA-Z]\\.\\.[a-zA-Z](?:\\.\\.-?\\d+)?$/.test(\n      m.body,\n    )\n    const isSequence = isNumericSequence || isAlphaSequence\n    const isOptions = m.body.indexOf(',') >= 0\n    if (!isSequence && !isOptions) {\n      // {a},b}\n      if (m.post.match(/,(?!,).*\\}/)) {\n        str = m.pre + '{' + m.body + escClose + m.post\n        return expand_(str, max, true)\n      }\n      return [str]\n    }\n\n    let n: string[]\n    if (isSequence) {\n      n = m.body.split(/\\.\\./)\n    } else {\n      n = parseCommaParts(m.body)\n      if (n.length === 1 && n[0] !== undefined) {\n        // x{{a,b}}y ==> x{a}y x{b}y\n        n = expand_(n[0], max, false).map(embrace)\n        //XXX is this necessary? Can't seem to hit it in tests.\n        /* c8 ignore start */\n        if (n.length === 1) {\n          return post.map(p => m.pre + n[0] + p)\n        }\n        /* c8 ignore stop */\n      }\n    }\n\n    // at this point, n is the parts, and we know it's not a comma set\n    // with a single entry.\n    let N: string[]\n\n    if (isSequence && n[0] !== undefined && n[1] !== undefined) {\n      const x = numeric(n[0])\n      const y = numeric(n[1])\n      const width = Math.max(n[0].length, n[1].length)\n      let incr =\n        n.length === 3 && n[2] !== undefined ? Math.abs(numeric(n[2])) : 1\n      let test = lte\n      const reverse = y < x\n      if (reverse) {\n        incr *= -1\n        test = gte\n      }\n      const pad = n.some(isPadded)\n\n      N = []\n\n      for (let i = x; test(i, y); i += incr) {\n        let c\n        if (isAlphaSequence) {\n          c = String.fromCharCode(i)\n          if (c === '\\\\') {\n            c = ''\n          }\n        } else {\n          c = String(i)\n          if (pad) {\n            const need = width - c.length\n            if (need > 0) {\n              const z = new Array(need + 1).join('0')\n              if (i < 0) {\n                c = '-' + z + c.slice(1)\n              } else {\n                c = z + c\n              }\n            }\n          }\n        }\n        N.push(c)\n      }\n    } else {\n      N = []\n\n      for (let j = 0; j < n.length; j++) {\n        N.push.apply(N, expand_(n[j] as string, max, false))\n      }\n    }\n\n    for (let j = 0; j < N.length; j++) {\n      for (let k = 0; k < post.length && expansions.length < max; k++) {\n        const expansion = pre + N[j] + post[k]\n        if (!isTop || isSequence || expansion) {\n          expansions.push(expansion)\n        }\n      }\n    }\n  }\n\n  return expansions\n}\n", "const MAX_PATTERN_LENGTH = 1024 * 64\nexport const assertValidPattern: (pattern: any) => void = (\n  pattern: any,\n): asserts pattern is string => {\n  if (typeof pattern !== 'string') {\n    throw new TypeError('invalid pattern')\n  }\n\n  if (pattern.length > MAX_PATTERN_LENGTH) {\n    throw new TypeError('pattern is too long')\n  }\n}\n", "// translate the various posix character classes into unicode properties\n// this works across all unicode locales\n\n// { <posix class>: [<translation>, /u flag required, negated]\nconst posixClasses: { [k: string]: [e: string, u: boolean, n?: boolean] } =\n  {\n    '[:alnum:]': ['\\\\p{L}\\\\p{Nl}\\\\p{Nd}', true],\n    '[:alpha:]': ['\\\\p{L}\\\\p{Nl}', true],\n    '[:ascii:]': ['\\\\x' + '00-\\\\x' + '7f', false],\n    '[:blank:]': ['\\\\p{Zs}\\\\t', true],\n    '[:cntrl:]': ['\\\\p{Cc}', true],\n    '[:digit:]': ['\\\\p{Nd}', true],\n    '[:graph:]': ['\\\\p{Z}\\\\p{C}', true, true],\n    '[:lower:]': ['\\\\p{Ll}', true],\n    '[:print:]': ['\\\\p{C}', true],\n    '[:punct:]': ['\\\\p{P}', true],\n    '[:space:]': ['\\\\p{Z}\\\\t\\\\r\\\\n\\\\v\\\\f', true],\n    '[:upper:]': ['\\\\p{Lu}', true],\n    '[:word:]': ['\\\\p{L}\\\\p{Nl}\\\\p{Nd}\\\\p{Pc}', true],\n    '[:xdigit:]': ['A-Fa-f0-9', false],\n  }\n\n// only need to escape a few things inside of brace expressions\n// escapes: [ \\ ] -\nconst braceEscape = (s: string) => s.replace(/[[\\]\\\\-]/g, '\\\\$&')\n// escape all regexp magic characters\nconst regexpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\n// everything has already been escaped, we just have to join\nconst rangesToString = (ranges: string[]): string => ranges.join('')\n\nexport type ParseClassResult = [\n  src: string,\n  uFlag: boolean,\n  consumed: number,\n  hasMagic: boolean,\n]\n\n// takes a glob string at a posix brace expression, and returns\n// an equivalent regular expression source, and boolean indicating\n// whether the /u flag needs to be applied, and the number of chars\n// consumed to parse the character class.\n// This also removes out of order ranges, and returns ($.) if the\n// entire class just no good.\nexport const parseClass = (\n  glob: string,\n  position: number,\n): ParseClassResult => {\n  const pos = position\n  /* c8 ignore start */\n  if (glob.charAt(pos) !== '[') {\n    throw new Error('not in a brace expression')\n  }\n  /* c8 ignore stop */\n  const ranges: string[] = []\n  const negs: string[] = []\n\n  let i = pos + 1\n  let sawStart = false\n  let uflag = false\n  let escaping = false\n  let negate = false\n  let endPos = pos\n  let rangeStart = ''\n  WHILE: while (i < glob.length) {\n    const c = glob.charAt(i)\n    if ((c === '!' || c === '^') && i === pos + 1) {\n      negate = true\n      i++\n      continue\n    }\n\n    if (c === ']' && sawStart && !escaping) {\n      endPos = i + 1\n      break\n    }\n\n    sawStart = true\n    if (c === '\\\\') {\n      if (!escaping) {\n        escaping = true\n        i++\n        continue\n      }\n      // escaped \\ char, fall through and treat like normal char\n    }\n    if (c === '[' && !escaping) {\n      // either a posix class, a collation equivalent, or just a [\n      for (const [cls, [unip, u, neg]] of Object.entries(posixClasses)) {\n        if (glob.startsWith(cls, i)) {\n          // invalid, [a-[] is fine, but not [a-[:alpha]]\n          if (rangeStart) {\n            return ['$.', false, glob.length - pos, true]\n          }\n          i += cls.length\n          if (neg) negs.push(unip)\n          else ranges.push(unip)\n          uflag = uflag || u\n          continue WHILE\n        }\n      }\n    }\n\n    // now it's just a normal character, effectively\n    escaping = false\n    if (rangeStart) {\n      // throw this range away if it's not valid, but others\n      // can still match.\n      if (c > rangeStart) {\n        ranges.push(braceEscape(rangeStart) + '-' + braceEscape(c))\n      } else if (c === rangeStart) {\n        ranges.push(braceEscape(c))\n      }\n      rangeStart = ''\n      i++\n      continue\n    }\n\n    // now might be the start of a range.\n    // can be either c-d or c-] or c<more...>] or c] at this point\n    if (glob.startsWith('-]', i + 1)) {\n      ranges.push(braceEscape(c + '-'))\n      i += 2\n      continue\n    }\n    if (glob.startsWith('-', i + 1)) {\n      rangeStart = c\n      i += 2\n      continue\n    }\n\n    // not the start of a range, just a single character\n    ranges.push(braceEscape(c))\n    i++\n  }\n\n  if (endPos < i) {\n    // didn't see the end of the class, not a valid class,\n    // but might still be valid as a literal match.\n    return ['', false, 0, false]\n  }\n\n  // if we got no ranges and no negates, then we have a range that\n  // cannot possibly match anything, and that poisons the whole glob\n  if (!ranges.length && !negs.length) {\n    return ['$.', false, glob.length - pos, true]\n  }\n\n  // if we got one positive range, and it's a single character, then that's\n  // not actually a magic pattern, it's just that one literal character.\n  // we should not treat that as \"magic\", we should just return the literal\n  // character. [_] is a perfectly valid way to escape glob magic chars.\n  if (\n    negs.length === 0 &&\n    ranges.length === 1 &&\n    /^\\\\?.$/.test(ranges[0]) &&\n    !negate\n  ) {\n    const r = ranges[0].length === 2 ? ranges[0].slice(-1) : ranges[0]\n    return [regexpEscape(r), false, endPos - pos, false]\n  }\n\n  const sranges = '[' + (negate ? '^' : '') + rangesToString(ranges) + ']'\n  const snegs = '[' + (negate ? '' : '^') + rangesToString(negs) + ']'\n  const comb =\n    ranges.length && negs.length ? '(' + sranges + '|' + snegs + ')'\n    : ranges.length ? sranges\n    : snegs\n\n  return [comb, uflag, endPos - pos, true]\n}\n", "import { MinimatchOptions } from './index.js'\n\n/**\n * Un-escape a string that has been escaped with {@link escape}.\n *\n * If the {@link MinimatchOptions.windowsPathsNoEscape} option is used, then\n * square-bracket escapes are removed, but not backslash escapes.\n *\n * For example, it will turn the string `'[*]'` into `*`, but it will not\n * turn `'\\\\*'` into `'*'`, because `\\` is a path separator in\n * `windowsPathsNoEscape` mode.\n *\n * When `windowsPathsNoEscape` is not set, then both square-bracket escapes and\n * backslash escapes are removed.\n *\n * Slashes (and backslashes in `windowsPathsNoEscape` mode) cannot be escaped\n * or unescaped.\n *\n * When `magicalBraces` is not set, escapes of braces (`{` and `}`) will not be\n * unescaped.\n */\n\nexport const unescape = (\n  s: string,\n  {\n    windowsPathsNoEscape = false,\n    magicalBraces = true,\n  }: Pick<MinimatchOptions, 'windowsPathsNoEscape' | 'magicalBraces'> = {},\n) => {\n  if (magicalBraces) {\n    return windowsPathsNoEscape ?\n        s.replace(/\\[([^\\/\\\\])\\]/g, '$1')\n      : s\n          .replace(/((?!\\\\).|^)\\[([^\\/\\\\])\\]/g, '$1$2')\n          .replace(/\\\\([^\\/])/g, '$1')\n  }\n  return windowsPathsNoEscape ?\n      s.replace(/\\[([^\\/\\\\{}])\\]/g, '$1')\n    : s\n        .replace(/((?!\\\\).|^)\\[([^\\/\\\\{}])\\]/g, '$1$2')\n        .replace(/\\\\([^\\/{}])/g, '$1')\n}\n", "// parse a single path portion\n\nimport { parseClass } from './brace-expressions.js'\nimport { MinimatchOptions, MMRegExp } from './index.js'\nimport { unescape } from './unescape.js'\n\n// classes [] are handled by the parseClass method\n// for positive extglobs, we sub-parse the contents, and combine,\n// with the appropriate regexp close.\n// for negative extglobs, we sub-parse the contents, but then\n// have to include the rest of the pattern, then the parent, etc.,\n// as the thing that cannot be because RegExp negative lookaheads\n// are different from globs.\n//\n// So for example:\n// a@(i|w!(x|y)z|j)b => ^a(i|w((!?(x|y)zb).*)z|j)b$\n//   1   2 3   4 5 6      1   2    3   46      5 6\n//\n// Assembling the extglob requires not just the negated patterns themselves,\n// but also anything following the negative patterns up to the boundary\n// of the current pattern, plus anything following in the parent pattern.\n//\n//\n// So, first, we parse the string into an AST of extglobs, without turning\n// anything into regexps yet.\n//\n// ['a', {@ [['i'], ['w', {!['x', 'y']}, 'z'], ['j']]}, 'b']\n//\n// Then, for all the negative extglobs, we append whatever comes after in\n// each parent as their tail\n//\n// ['a', {@ [['i'], ['w', {!['x', 'y'], 'z', 'b'}, 'z'], ['j']]}, 'b']\n//\n// Lastly, we turn each of these pieces into a regexp, and join\n//\n//                                 v----- .* because there's more following,\n//                                 v    v  otherwise, .+ because it must be\n//                                 v    v  *something* there.\n// ['^a', {@ ['i', 'w(?:(!?(?:x|y).*zb$).*)z', 'j' ]}, 'b$']\n//   copy what follows into here--^^^^^\n// ['^a', '(?:i|w(?:(?!(?:x|y).*zb$).*)z|j)', 'b$']\n// ['^a(?:i|w(?:(?!(?:x|y).*zb$).*)z|j)b$']\n\nexport type ExtglobType = '!' | '?' | '+' | '*' | '@'\nconst types = new Set<ExtglobType>(['!', '?', '+', '*', '@'])\nconst isExtglobType = (c: string): c is ExtglobType =>\n  types.has(c as ExtglobType)\n\n// Patterns that get prepended to bind to the start of either the\n// entire string, or just a single path portion, to prevent dots\n// and/or traversal patterns, when needed.\n// Exts don't need the ^ or / bit, because the root binds that already.\nconst startNoTraversal = '(?!(?:^|/)\\\\.\\\\.?(?:$|/))'\nconst startNoDot = '(?!\\\\.)'\n\n// characters that indicate a start of pattern needs the \"no dots\" bit,\n// because a dot *might* be matched. ( is not in the list, because in\n// the case of a child extglob, it will handle the prevention itself.\nconst addPatternStart = new Set(['[', '.'])\n// cases where traversal is A-OK, no dot prevention needed\nconst justDots = new Set(['..', '.'])\nconst reSpecials = new Set('().*{}+?[]^$\\\\!')\nconst regExpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\n// any single thing other than /\nconst qmark = '[^/]'\n\n// * => any number of characters\nconst star = qmark + '*?'\n// use + when we need to ensure that *something* matches, because the * is\n// the only thing in the path portion.\nconst starNoEmpty = qmark + '+?'\n\n// remove the \\ chars that we added if we end up doing a nonmagic compare\n// const deslash = (s: string) => s.replace(/\\\\(.)/g, '$1')\n\nexport class AST {\n  type: ExtglobType | null\n  readonly #root: AST\n\n  #hasMagic?: boolean\n  #uflag: boolean = false\n  #parts: (string | AST)[] = []\n  readonly #parent?: AST\n  readonly #parentIndex: number\n  #negs: AST[]\n  #filledNegs: boolean = false\n  #options: MinimatchOptions\n  #toString?: string\n  // set to true if it's an extglob with no children\n  // (which really means one child of '')\n  #emptyExt: boolean = false\n\n  constructor(\n    type: ExtglobType | null,\n    parent?: AST,\n    options: MinimatchOptions = {},\n  ) {\n    this.type = type\n    // extglobs are inherently magical\n    if (type) this.#hasMagic = true\n    this.#parent = parent\n    this.#root = this.#parent ? this.#parent.#root : this\n    this.#options = this.#root === this ? options : this.#root.#options\n    this.#negs = this.#root === this ? [] : this.#root.#negs\n    if (type === '!' && !this.#root.#filledNegs) this.#negs.push(this)\n    this.#parentIndex = this.#parent ? this.#parent.#parts.length : 0\n  }\n\n  get hasMagic(): boolean | undefined {\n    /* c8 ignore start */\n    if (this.#hasMagic !== undefined) return this.#hasMagic\n    /* c8 ignore stop */\n    for (const p of this.#parts) {\n      if (typeof p === 'string') continue\n      if (p.type || p.hasMagic) return (this.#hasMagic = true)\n    }\n    // note: will be undefined until we generate the regexp src and find out\n    return this.#hasMagic\n  }\n\n  // reconstructs the pattern\n  toString(): string {\n    if (this.#toString !== undefined) return this.#toString\n    if (!this.type) {\n      return (this.#toString = this.#parts.map(p => String(p)).join(''))\n    } else {\n      return (this.#toString =\n        this.type + '(' + this.#parts.map(p => String(p)).join('|') + ')')\n    }\n  }\n\n  #fillNegs() {\n    /* c8 ignore start */\n    if (this !== this.#root) throw new Error('should only call on root')\n    if (this.#filledNegs) return this\n    /* c8 ignore stop */\n\n    // call toString() once to fill this out\n    this.toString()\n    this.#filledNegs = true\n    let n: AST | undefined\n    while ((n = this.#negs.pop())) {\n      if (n.type !== '!') continue\n      // walk up the tree, appending everthing that comes AFTER parentIndex\n      let p: AST | undefined = n\n      let pp = p.#parent\n      while (pp) {\n        for (\n          let i = p.#parentIndex + 1;\n          !pp.type && i < pp.#parts.length;\n          i++\n        ) {\n          for (const part of n.#parts) {\n            /* c8 ignore start */\n            if (typeof part === 'string') {\n              throw new Error('string part in extglob AST??')\n            }\n            /* c8 ignore stop */\n            part.copyIn(pp.#parts[i])\n          }\n        }\n        p = pp\n        pp = p.#parent\n      }\n    }\n    return this\n  }\n\n  push(...parts: (string | AST)[]) {\n    for (const p of parts) {\n      if (p === '') continue\n      /* c8 ignore start */\n      if (\n        typeof p !== 'string' &&\n        !(p instanceof AST && p.#parent === this)\n      ) {\n        throw new Error('invalid part: ' + p)\n      }\n      /* c8 ignore stop */\n      this.#parts.push(p)\n    }\n  }\n\n  toJSON() {\n    const ret: any[] =\n      this.type === null ?\n        this.#parts\n          .slice()\n          .map(p => (typeof p === 'string' ? p : p.toJSON()))\n      : [this.type, ...this.#parts.map(p => (p as AST).toJSON())]\n    if (this.isStart() && !this.type) ret.unshift([])\n    if (\n      this.isEnd() &&\n      (this === this.#root ||\n        (this.#root.#filledNegs && this.#parent?.type === '!'))\n    ) {\n      ret.push({})\n    }\n    return ret\n  }\n\n  isStart(): boolean {\n    if (this.#root === this) return true\n    // if (this.type) return !!this.#parent?.isStart()\n    if (!this.#parent?.isStart()) return false\n    if (this.#parentIndex === 0) return true\n    // if everything AHEAD of this is a negation, then it's still the \"start\"\n    const p = this.#parent\n    for (let i = 0; i < this.#parentIndex; i++) {\n      const pp = p.#parts[i]\n      if (!(pp instanceof AST && pp.type === '!')) {\n        return false\n      }\n    }\n    return true\n  }\n\n  isEnd(): boolean {\n    if (this.#root === this) return true\n    if (this.#parent?.type === '!') return true\n    if (!this.#parent?.isEnd()) return false\n    if (!this.type) return this.#parent?.isEnd()\n    // if not root, it'll always have a parent\n    /* c8 ignore start */\n    const pl = this.#parent ? this.#parent.#parts.length : 0\n    /* c8 ignore stop */\n    return this.#parentIndex === pl - 1\n  }\n\n  copyIn(part: AST | string) {\n    if (typeof part === 'string') this.push(part)\n    else this.push(part.clone(this))\n  }\n\n  clone(parent: AST) {\n    const c = new AST(this.type, parent)\n    for (const p of this.#parts) {\n      c.copyIn(p)\n    }\n    return c\n  }\n\n  static #parseAST(\n    str: string,\n    ast: AST,\n    pos: number,\n    opt: MinimatchOptions,\n  ): number {\n    let escaping = false\n    let inBrace = false\n    let braceStart = -1\n    let braceNeg = false\n    if (ast.type === null) {\n      // outside of a extglob, append until we find a start\n      let i = pos\n      let acc = ''\n      while (i < str.length) {\n        const c = str.charAt(i++)\n        // still accumulate escapes at this point, but we do ignore\n        // starts that are escaped\n        if (escaping || c === '\\\\') {\n          escaping = !escaping\n          acc += c\n          continue\n        }\n\n        if (inBrace) {\n          if (i === braceStart + 1) {\n            if (c === '^' || c === '!') {\n              braceNeg = true\n            }\n          } else if (c === ']' && !(i === braceStart + 2 && braceNeg)) {\n            inBrace = false\n          }\n          acc += c\n          continue\n        } else if (c === '[') {\n          inBrace = true\n          braceStart = i\n          braceNeg = false\n          acc += c\n          continue\n        }\n\n        if (!opt.noext && isExtglobType(c) && str.charAt(i) === '(') {\n          ast.push(acc)\n          acc = ''\n          const ext = new AST(c, ast)\n          i = AST.#parseAST(str, ext, i, opt)\n          ast.push(ext)\n          continue\n        }\n        acc += c\n      }\n      ast.push(acc)\n      return i\n    }\n\n    // some kind of extglob, pos is at the (\n    // find the next | or )\n    let i = pos + 1\n    let part = new AST(null, ast)\n    const parts: AST[] = []\n    let acc = ''\n    while (i < str.length) {\n      const c = str.charAt(i++)\n      // still accumulate escapes at this point, but we do ignore\n      // starts that are escaped\n      if (escaping || c === '\\\\') {\n        escaping = !escaping\n        acc += c\n        continue\n      }\n\n      if (inBrace) {\n        if (i === braceStart + 1) {\n          if (c === '^' || c === '!') {\n            braceNeg = true\n          }\n        } else if (c === ']' && !(i === braceStart + 2 && braceNeg)) {\n          inBrace = false\n        }\n        acc += c\n        continue\n      } else if (c === '[') {\n        inBrace = true\n        braceStart = i\n        braceNeg = false\n        acc += c\n        continue\n      }\n\n      if (isExtglobType(c) && str.charAt(i) === '(') {\n        part.push(acc)\n        acc = ''\n        const ext = new AST(c, part)\n        part.push(ext)\n        i = AST.#parseAST(str, ext, i, opt)\n        continue\n      }\n      if (c === '|') {\n        part.push(acc)\n        acc = ''\n        parts.push(part)\n        part = new AST(null, ast)\n        continue\n      }\n      if (c === ')') {\n        if (acc === '' && ast.#parts.length === 0) {\n          ast.#emptyExt = true\n        }\n        part.push(acc)\n        acc = ''\n        ast.push(...parts, part)\n        return i\n      }\n      acc += c\n    }\n\n    // unfinished extglob\n    // if we got here, it was a malformed extglob! not an extglob, but\n    // maybe something else in there.\n    ast.type = null\n    ast.#hasMagic = undefined\n    ast.#parts = [str.substring(pos - 1)]\n    return i\n  }\n\n  static fromGlob(pattern: string, options: MinimatchOptions = {}) {\n    const ast = new AST(null, undefined, options)\n    AST.#parseAST(pattern, ast, 0, options)\n    return ast\n  }\n\n  // returns the regular expression if there's magic, or the unescaped\n  // string if not.\n  toMMPattern(): MMRegExp | string {\n    // should only be called on root\n    /* c8 ignore start */\n    if (this !== this.#root) return this.#root.toMMPattern()\n    /* c8 ignore stop */\n    const glob = this.toString()\n    const [re, body, hasMagic, uflag] = this.toRegExpSource()\n    // if we're in nocase mode, and not nocaseMagicOnly, then we do\n    // still need a regular expression if we have to case-insensitively\n    // match capital/lowercase characters.\n    const anyMagic =\n      hasMagic ||\n      this.#hasMagic ||\n      (this.#options.nocase &&\n        !this.#options.nocaseMagicOnly &&\n        glob.toUpperCase() !== glob.toLowerCase())\n    if (!anyMagic) {\n      return body\n    }\n\n    const flags = (this.#options.nocase ? 'i' : '') + (uflag ? 'u' : '')\n    return Object.assign(new RegExp(`^${re}$`, flags), {\n      _src: re,\n      _glob: glob,\n    })\n  }\n\n  get options() {\n    return this.#options\n  }\n\n  // returns the string match, the regexp source, whether there's magic\n  // in the regexp (so a regular expression is required) and whether or\n  // not the uflag is needed for the regular expression (for posix classes)\n  // TODO: instead of injecting the start/end at this point, just return\n  // the BODY of the regexp, along with the start/end portions suitable\n  // for binding the start/end in either a joined full-path makeRe context\n  // (where we bind to (^|/), or a standalone matchPart context (where\n  // we bind to ^, and not /).  Otherwise slashes get duped!\n  //\n  // In part-matching mode, the start is:\n  // - if not isStart: nothing\n  // - if traversal possible, but not allowed: ^(?!\\.\\.?$)\n  // - if dots allowed or not possible: ^\n  // - if dots possible and not allowed: ^(?!\\.)\n  // end is:\n  // - if not isEnd(): nothing\n  // - else: $\n  //\n  // In full-path matching mode, we put the slash at the START of the\n  // pattern, so start is:\n  // - if first pattern: same as part-matching mode\n  // - if not isStart(): nothing\n  // - if traversal possible, but not allowed: /(?!\\.\\.?(?:$|/))\n  // - if dots allowed or not possible: /\n  // - if dots possible and not allowed: /(?!\\.)\n  // end is:\n  // - if last pattern, same as part-matching mode\n  // - else nothing\n  //\n  // Always put the (?:$|/) on negated tails, though, because that has to be\n  // there to bind the end of the negated pattern portion, and it's easier to\n  // just stick it in now rather than try to inject it later in the middle of\n  // the pattern.\n  //\n  // We can just always return the same end, and leave it up to the caller\n  // to know whether it's going to be used joined or in parts.\n  // And, if the start is adjusted slightly, can do the same there:\n  // - if not isStart: nothing\n  // - if traversal possible, but not allowed: (?:/|^)(?!\\.\\.?$)\n  // - if dots allowed or not possible: (?:/|^)\n  // - if dots possible and not allowed: (?:/|^)(?!\\.)\n  //\n  // But it's better to have a simpler binding without a conditional, for\n  // performance, so probably better to return both start options.\n  //\n  // Then the caller just ignores the end if it's not the first pattern,\n  // and the start always gets applied.\n  //\n  // But that's always going to be $ if it's the ending pattern, or nothing,\n  // so the caller can just attach $ at the end of the pattern when building.\n  //\n  // So the todo is:\n  // - better detect what kind of start is needed\n  // - return both flavors of starting pattern\n  // - attach $ at the end of the pattern when creating the actual RegExp\n  //\n  // Ah, but wait, no, that all only applies to the root when the first pattern\n  // is not an extglob. If the first pattern IS an extglob, then we need all\n  // that dot prevention biz to live in the extglob portions, because eg\n  // +(*|.x*) can match .xy but not .yx.\n  //\n  // So, return the two flavors if it's #root and the first child is not an\n  // AST, otherwise leave it to the child AST to handle it, and there,\n  // use the (?:^|/) style of start binding.\n  //\n  // Even simplified further:\n  // - Since the start for a join is eg /(?!\\.) and the start for a part\n  // is ^(?!\\.), we can just prepend (?!\\.) to the pattern (either root\n  // or start or whatever) and prepend ^ or / at the Regexp construction.\n  toRegExpSource(\n    allowDot?: boolean,\n  ): [re: string, body: string, hasMagic: boolean, uflag: boolean] {\n    const dot = allowDot ?? !!this.#options.dot\n    if (this.#root === this) this.#fillNegs()\n    if (!this.type) {\n      const noEmpty =\n        this.isStart() &&\n        this.isEnd() &&\n        !this.#parts.some(s => typeof s !== 'string')\n      const src = this.#parts\n        .map(p => {\n          const [re, _, hasMagic, uflag] =\n            typeof p === 'string' ?\n              AST.#parseGlob(p, this.#hasMagic, noEmpty)\n            : p.toRegExpSource(allowDot)\n          this.#hasMagic = this.#hasMagic || hasMagic\n          this.#uflag = this.#uflag || uflag\n          return re\n        })\n        .join('')\n\n      let start = ''\n      if (this.isStart()) {\n        if (typeof this.#parts[0] === 'string') {\n          // this is the string that will match the start of the pattern,\n          // so we need to protect against dots and such.\n\n          // '.' and '..' cannot match unless the pattern is that exactly,\n          // even if it starts with . or dot:true is set.\n          const dotTravAllowed =\n            this.#parts.length === 1 && justDots.has(this.#parts[0])\n          if (!dotTravAllowed) {\n            const aps = addPatternStart\n            // check if we have a possibility of matching . or ..,\n            // and prevent that.\n            const needNoTrav =\n              // dots are allowed, and the pattern starts with [ or .\n              (dot && aps.has(src.charAt(0))) ||\n              // the pattern starts with \\., and then [ or .\n              (src.startsWith('\\\\.') && aps.has(src.charAt(2))) ||\n              // the pattern starts with \\.\\., and then [ or .\n              (src.startsWith('\\\\.\\\\.') && aps.has(src.charAt(4)))\n            // no need to prevent dots if it can't match a dot, or if a\n            // sub-pattern will be preventing it anyway.\n            const needNoDot = !dot && !allowDot && aps.has(src.charAt(0))\n\n            start =\n              needNoTrav ? startNoTraversal\n              : needNoDot ? startNoDot\n              : ''\n          }\n        }\n      }\n\n      // append the \"end of path portion\" pattern to negation tails\n      let end = ''\n      if (\n        this.isEnd() &&\n        this.#root.#filledNegs &&\n        this.#parent?.type === '!'\n      ) {\n        end = '(?:$|\\\\/)'\n      }\n      const final = start + src + end\n      return [\n        final,\n        unescape(src),\n        (this.#hasMagic = !!this.#hasMagic),\n        this.#uflag,\n      ]\n    }\n\n    // We need to calculate the body *twice* if it's a repeat pattern\n    // at the start, once in nodot mode, then again in dot mode, so a\n    // pattern like *(?) can match 'x.y'\n\n    const repeated = this.type === '*' || this.type === '+'\n    // some kind of extglob\n    const start = this.type === '!' ? '(?:(?!(?:' : '(?:'\n    let body = this.#partsToRegExp(dot)\n\n    if (this.isStart() && this.isEnd() && !body && this.type !== '!') {\n      // invalid extglob, has to at least be *something* present, if it's\n      // the entire path portion.\n      const s = this.toString()\n      this.#parts = [s]\n      this.type = null\n      this.#hasMagic = undefined\n      return [s, unescape(this.toString()), false, false]\n    }\n\n    // XXX abstract out this map method\n    let bodyDotAllowed =\n      !repeated || allowDot || dot || !startNoDot ?\n        ''\n      : this.#partsToRegExp(true)\n    if (bodyDotAllowed === body) {\n      bodyDotAllowed = ''\n    }\n    if (bodyDotAllowed) {\n      body = `(?:${body})(?:${bodyDotAllowed})*?`\n    }\n\n    // an empty !() is exactly equivalent to a starNoEmpty\n    let final = ''\n    if (this.type === '!' && this.#emptyExt) {\n      final = (this.isStart() && !dot ? startNoDot : '') + starNoEmpty\n    } else {\n      const close =\n        this.type === '!' ?\n          // !() must match something,but !(x) can match ''\n          '))' +\n          (this.isStart() && !dot && !allowDot ? startNoDot : '') +\n          star +\n          ')'\n        : this.type === '@' ? ')'\n        : this.type === '?' ? ')?'\n        : this.type === '+' && bodyDotAllowed ? ')'\n        : this.type === '*' && bodyDotAllowed ? `)?`\n        : `)${this.type}`\n      final = start + body + close\n    }\n    return [\n      final,\n      unescape(body),\n      (this.#hasMagic = !!this.#hasMagic),\n      this.#uflag,\n    ]\n  }\n\n  #partsToRegExp(dot: boolean) {\n    return this.#parts\n      .map(p => {\n        // extglob ASTs should only contain parent ASTs\n        /* c8 ignore start */\n        if (typeof p === 'string') {\n          throw new Error('string type in extglob ast??')\n        }\n        /* c8 ignore stop */\n        // can ignore hasMagic, because extglobs are already always magic\n        const [re, _, _hasMagic, uflag] = p.toRegExpSource(dot)\n        this.#uflag = this.#uflag || uflag\n        return re\n      })\n      .filter(p => !(this.isStart() && this.isEnd()) || !!p)\n      .join('|')\n  }\n\n  static #parseGlob(\n    glob: string,\n    hasMagic: boolean | undefined,\n    noEmpty: boolean = false,\n  ): [re: string, body: string, hasMagic: boolean, uflag: boolean] {\n    let escaping = false\n    let re = ''\n    let uflag = false\n    // multiple stars that aren't globstars coalesce into one *\n    let inStar = false\n    for (let i = 0; i < glob.length; i++) {\n      const c = glob.charAt(i)\n      if (escaping) {\n        escaping = false\n        re += (reSpecials.has(c) ? '\\\\' : '') + c\n        continue\n      }\n      if (c === '*') {\n        if (inStar) continue\n        inStar = true\n        re += noEmpty && /^[*]+$/.test(glob) ? starNoEmpty : star\n        hasMagic = true\n        continue\n      } else {\n        inStar = false\n      }\n      if (c === '\\\\') {\n        if (i === glob.length - 1) {\n          re += '\\\\\\\\'\n        } else {\n          escaping = true\n        }\n        continue\n      }\n      if (c === '[') {\n        const [src, needUflag, consumed, magic] = parseClass(glob, i)\n        if (consumed) {\n          re += src\n          uflag = uflag || needUflag\n          i += consumed - 1\n          hasMagic = hasMagic || magic\n          continue\n        }\n      }\n      if (c === '?') {\n        re += qmark\n        hasMagic = true\n        continue\n      }\n      re += regExpEscape(c)\n    }\n    return [re, unescape(glob), !!hasMagic, uflag]\n  }\n}\n", "import { MinimatchOptions } from './index.js'\n\n/**\n * Escape all magic characters in a glob pattern.\n *\n * If the {@link MinimatchOptions.windowsPathsNoEscape}\n * option is used, then characters are escaped by wrapping in `[]`, because\n * a magic character wrapped in a character class can only be satisfied by\n * that exact character.  In this mode, `\\` is _not_ escaped, because it is\n * not interpreted as a magic character, but instead as a path separator.\n *\n * If the {@link MinimatchOptions.magicalBraces} option is used,\n * then braces (`{` and `}`) will be escaped.\n */\nexport const escape = (\n  s: string,\n  {\n    windowsPathsNoEscape = false,\n    magicalBraces = false,\n  }: Pick<MinimatchOptions, 'windowsPathsNoEscape' | 'magicalBraces'> = {},\n) => {\n  // don't need to escape +@! because we escape the parens\n  // that make those magic, and escaping ! as [!] isn't valid,\n  // because [!]] is a valid glob class meaning not ']'.\n  if (magicalBraces) {\n    return windowsPathsNoEscape ?\n        s.replace(/[?*()[\\]{}]/g, '[$&]')\n      : s.replace(/[?*()[\\]\\\\{}]/g, '\\\\$&')\n  }\n  return windowsPathsNoEscape ?\n      s.replace(/[?*()[\\]]/g, '[$&]')\n    : s.replace(/[?*()[\\]\\\\]/g, '\\\\$&')\n}\n", "import { expand } from 'brace-expansion'\nimport { assertValidPattern } from './assert-valid-pattern.js'\nimport { AST, ExtglobType } from './ast.js'\nimport { escape } from './escape.js'\nimport { unescape } from './unescape.js'\n\nexport type Platform =\n  | 'aix'\n  | 'android'\n  | 'darwin'\n  | 'freebsd'\n  | 'haiku'\n  | 'linux'\n  | 'openbsd'\n  | 'sunos'\n  | 'win32'\n  | 'cygwin'\n  | 'netbsd'\n\nexport interface MinimatchOptions {\n  /** do not expand `{x,y}` style braces */\n  nobrace?: boolean\n  /** do not treat patterns starting with `#` as a comment */\n  nocomment?: boolean\n  /** do not treat patterns starting with `!` as a negation */\n  nonegate?: boolean\n  /** print LOTS of debugging output */\n  debug?: boolean\n  /** treat `**` the same as `*` */\n  noglobstar?: boolean\n  /** do not expand extglobs like `+(a|b)` */\n  noext?: boolean\n  /** return the pattern if nothing matches */\n  nonull?: boolean\n  /** treat `\\\\` as a path separator, not an escape character */\n  windowsPathsNoEscape?: boolean\n  /**\n   * inverse of {@link MinimatchOptions.windowsPathsNoEscape}\n   * @deprecated\n   */\n  allowWindowsEscape?: boolean\n  /**\n   * Compare a partial path to a pattern. As long as the parts\n   * of the path that are present are not contradicted by the\n   * pattern, it will be treated as a match. This is useful in\n   * applications where you're walking through a folder structure,\n   * and don't yet have the full path, but want to ensure that you\n   * do not walk down paths that can never be a match.\n   */\n  partial?: boolean\n  /** allow matches that start with `.` even if the pattern does not */\n  dot?: boolean\n  /** ignore case */\n  nocase?: boolean\n  /** ignore case only in wildcard patterns */\n  nocaseMagicOnly?: boolean\n  /** consider braces to be \"magic\" for the purpose of `hasMagic` */\n  magicalBraces?: boolean\n  /**\n   * If set, then patterns without slashes will be matched\n   * against the basename of the path if it contains slashes.\n   * For example, `a?b` would match the path `/xyz/123/acb`, but\n   * not `/xyz/acb/123`.\n   */\n  matchBase?: boolean\n  /** invert the results of negated matches */\n  flipNegate?: boolean\n  /** do not collapse multiple `/` into a single `/` */\n  preserveMultipleSlashes?: boolean\n  /**\n   * A number indicating the level of optimization that should be done\n   * to the pattern prior to parsing and using it for matches.\n   */\n  optimizationLevel?: number\n  /** operating system platform */\n  platform?: Platform\n  /**\n   * When a pattern starts with a UNC path or drive letter, and in\n   * `nocase:true` mode, do not convert the root portions of the\n   * pattern into a case-insensitive regular expression, and instead\n   * leave them as strings.\n   *\n   * This is the default when the platform is `win32` and\n   * `nocase:true` is set.\n   */\n  windowsNoMagicRoot?: boolean\n  /**\n   * max number of `{...}` patterns to expand. Default 100_000.\n   */\n  braceExpandMax?: number\n}\n\nexport const minimatch = (\n  p: string,\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  assertValidPattern(pattern)\n\n  // shortcut: comments match nothing.\n  if (!options.nocomment && pattern.charAt(0) === '#') {\n    return false\n  }\n\n  return new Minimatch(pattern, options).match(p)\n}\n\n// Optimized checking for the most common glob patterns.\nconst starDotExtRE = /^\\*+([^+@!?\\*\\[\\(]*)$/\nconst starDotExtTest = (ext: string) => (f: string) =>\n  !f.startsWith('.') && f.endsWith(ext)\nconst starDotExtTestDot = (ext: string) => (f: string) => f.endsWith(ext)\nconst starDotExtTestNocase = (ext: string) => {\n  ext = ext.toLowerCase()\n  return (f: string) => !f.startsWith('.') && f.toLowerCase().endsWith(ext)\n}\nconst starDotExtTestNocaseDot = (ext: string) => {\n  ext = ext.toLowerCase()\n  return (f: string) => f.toLowerCase().endsWith(ext)\n}\nconst starDotStarRE = /^\\*+\\.\\*+$/\nconst starDotStarTest = (f: string) =>\n  !f.startsWith('.') && f.includes('.')\nconst starDotStarTestDot = (f: string) =>\n  f !== '.' && f !== '..' && f.includes('.')\nconst dotStarRE = /^\\.\\*+$/\nconst dotStarTest = (f: string) =>\n  f !== '.' && f !== '..' && f.startsWith('.')\nconst starRE = /^\\*+$/\nconst starTest = (f: string) => f.length !== 0 && !f.startsWith('.')\nconst starTestDot = (f: string) =>\n  f.length !== 0 && f !== '.' && f !== '..'\nconst qmarksRE = /^\\?+([^+@!?\\*\\[\\(]*)?$/\nconst qmarksTestNocase = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExt([$0])\n  if (!ext) return noext\n  ext = ext.toLowerCase()\n  return (f: string) => noext(f) && f.toLowerCase().endsWith(ext)\n}\nconst qmarksTestNocaseDot = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExtDot([$0])\n  if (!ext) return noext\n  ext = ext.toLowerCase()\n  return (f: string) => noext(f) && f.toLowerCase().endsWith(ext)\n}\nconst qmarksTestDot = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExtDot([$0])\n  return !ext ? noext : (f: string) => noext(f) && f.endsWith(ext)\n}\nconst qmarksTest = ([$0, ext = '']: RegExpMatchArray) => {\n  const noext = qmarksTestNoExt([$0])\n  return !ext ? noext : (f: string) => noext(f) && f.endsWith(ext)\n}\nconst qmarksTestNoExt = ([$0]: RegExpMatchArray) => {\n  const len = $0.length\n  return (f: string) => f.length === len && !f.startsWith('.')\n}\nconst qmarksTestNoExtDot = ([$0]: RegExpMatchArray) => {\n  const len = $0.length\n  return (f: string) => f.length === len && f !== '.' && f !== '..'\n}\n\n/* c8 ignore start */\nconst defaultPlatform: Platform = (\n  typeof process === 'object' && process ?\n    (typeof process.env === 'object' &&\n      process.env &&\n      process.env.__MINIMATCH_TESTING_PLATFORM__) ||\n    process.platform\n  : 'posix') as Platform\n\nexport type Sep = '\\\\' | '/'\n\nconst path: { [k: string]: { sep: Sep } } = {\n  win32: { sep: '\\\\' },\n  posix: { sep: '/' },\n}\n/* c8 ignore stop */\n\nexport const sep =\n  defaultPlatform === 'win32' ? path.win32.sep : path.posix.sep\nminimatch.sep = sep\n\nexport const GLOBSTAR = Symbol('globstar **')\nminimatch.GLOBSTAR = GLOBSTAR\n\n// any single thing other than /\n// don't need to escape / when using new RegExp()\nconst qmark = '[^/]'\n\n// * => any number of characters\nconst star = qmark + '*?'\n\n// ** when dots are allowed.  Anything goes, except .. and .\n// not (^ or / followed by one or two dots followed by $ or /),\n// followed by anything, any number of times.\nconst twoStarDot = '(?:(?!(?:\\\\/|^)(?:\\\\.{1,2})($|\\\\/)).)*?'\n\n// not a ^ or / followed by a dot,\n// followed by anything, any number of times.\nconst twoStarNoDot = '(?:(?!(?:\\\\/|^)\\\\.).)*?'\n\nexport const filter =\n  (pattern: string, options: MinimatchOptions = {}) =>\n  (p: string) =>\n    minimatch(p, pattern, options)\nminimatch.filter = filter\n\nconst ext = (a: MinimatchOptions, b: MinimatchOptions = {}) =>\n  Object.assign({}, a, b)\n\nexport const defaults = (def: MinimatchOptions): typeof minimatch => {\n  if (!def || typeof def !== 'object' || !Object.keys(def).length) {\n    return minimatch\n  }\n\n  const orig = minimatch\n\n  const m = (p: string, pattern: string, options: MinimatchOptions = {}) =>\n    orig(p, pattern, ext(def, options))\n\n  return Object.assign(m, {\n    Minimatch: class Minimatch extends orig.Minimatch {\n      constructor(pattern: string, options: MinimatchOptions = {}) {\n        super(pattern, ext(def, options))\n      }\n      static defaults(options: MinimatchOptions) {\n        return orig.defaults(ext(def, options)).Minimatch\n      }\n    },\n\n    AST: class AST extends orig.AST {\n      /* c8 ignore start */\n      constructor(\n        type: ExtglobType | null,\n        parent?: AST,\n        options: MinimatchOptions = {},\n      ) {\n        super(type, parent, ext(def, options))\n      }\n      /* c8 ignore stop */\n\n      static fromGlob(pattern: string, options: MinimatchOptions = {}) {\n        return orig.AST.fromGlob(pattern, ext(def, options))\n      }\n    },\n\n    unescape: (\n      s: string,\n      options: Pick<\n        MinimatchOptions,\n        'windowsPathsNoEscape' | 'magicalBraces'\n      > = {},\n    ) => orig.unescape(s, ext(def, options)),\n\n    escape: (\n      s: string,\n      options: Pick<\n        MinimatchOptions,\n        'windowsPathsNoEscape' | 'magicalBraces'\n      > = {},\n    ) => orig.escape(s, ext(def, options)),\n\n    filter: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.filter(pattern, ext(def, options)),\n\n    defaults: (options: MinimatchOptions) =>\n      orig.defaults(ext(def, options)),\n\n    makeRe: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.makeRe(pattern, ext(def, options)),\n\n    braceExpand: (pattern: string, options: MinimatchOptions = {}) =>\n      orig.braceExpand(pattern, ext(def, options)),\n\n    match: (\n      list: string[],\n      pattern: string,\n      options: MinimatchOptions = {},\n    ) => orig.match(list, pattern, ext(def, options)),\n\n    sep: orig.sep,\n    GLOBSTAR: GLOBSTAR as typeof GLOBSTAR,\n  })\n}\nminimatch.defaults = defaults\n\n// Brace expansion:\n// a{b,c}d -> abd acd\n// a{b,}c -> abc ac\n// a{0..3}d -> a0d a1d a2d a3d\n// a{b,c{d,e}f}g -> abg acdfg acefg\n// a{b,c}d{e,f}g -> abdeg acdeg abdeg abdfg\n//\n// Invalid sets are not expanded.\n// a{2..}b -> a{2..}b\n// a{b}c -> a{b}c\nexport const braceExpand = (\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  assertValidPattern(pattern)\n\n  // Thanks to Yeting Li <https://github.com/yetingli> for\n  // improving this regexp to avoid a ReDOS vulnerability.\n  if (options.nobrace || !/\\{(?:(?!\\{).)*\\}/.test(pattern)) {\n    // shortcut. no need to expand.\n    return [pattern]\n  }\n\n  return expand(pattern, { max: options.braceExpandMax })\n}\nminimatch.braceExpand = braceExpand\n\n// parse a component of the expanded set.\n// At this point, no pattern may contain \"/\" in it\n// so we're going to return a 2d array, where each entry is the full\n// pattern, split on '/', and then turned into a regular expression.\n// A regexp is made at the end which joins each array with an\n// escaped /, and another full one which joins each regexp with |.\n//\n// Following the lead of Bash 4.1, note that \"**\" only has special meaning\n// when it is the *only* thing in a path portion.  Otherwise, any series\n// of * is equivalent to a single *.  Globstar behavior is enabled by\n// default, and can be disabled by setting options.noglobstar.\n\nexport const makeRe = (pattern: string, options: MinimatchOptions = {}) =>\n  new Minimatch(pattern, options).makeRe()\nminimatch.makeRe = makeRe\n\nexport const match = (\n  list: string[],\n  pattern: string,\n  options: MinimatchOptions = {},\n) => {\n  const mm = new Minimatch(pattern, options)\n  list = list.filter(f => mm.match(f))\n  if (mm.options.nonull && !list.length) {\n    list.push(pattern)\n  }\n  return list\n}\nminimatch.match = match\n\n// replace stuff like \\* with *\nconst globMagic = /[?*]|[+@!]\\(.*?\\)|\\[|\\]/\nconst regExpEscape = (s: string) =>\n  s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n\nexport type MMRegExp = RegExp & {\n  _src?: string\n  _glob?: string\n}\n\nexport type ParseReturnFiltered = string | MMRegExp | typeof GLOBSTAR\nexport type ParseReturn = ParseReturnFiltered | false\n\nexport class Minimatch {\n  options: MinimatchOptions\n  set: ParseReturnFiltered[][]\n  pattern: string\n\n  windowsPathsNoEscape: boolean\n  nonegate: boolean\n  negate: boolean\n  comment: boolean\n  empty: boolean\n  preserveMultipleSlashes: boolean\n  partial: boolean\n  globSet: string[]\n  globParts: string[][]\n  nocase: boolean\n\n  isWindows: boolean\n  platform: Platform\n  windowsNoMagicRoot: boolean\n\n  regexp: false | null | MMRegExp\n  constructor(pattern: string, options: MinimatchOptions = {}) {\n    assertValidPattern(pattern)\n\n    options = options || {}\n    this.options = options\n    this.pattern = pattern\n    this.platform = options.platform || defaultPlatform\n    this.isWindows = this.platform === 'win32'\n    // avoid the annoying deprecation flag lol\n    const awe = ('allowWindow' + 'sEscape') as keyof MinimatchOptions\n    this.windowsPathsNoEscape =\n      !!options.windowsPathsNoEscape || options[awe] === false\n    if (this.windowsPathsNoEscape) {\n      this.pattern = this.pattern.replace(/\\\\/g, '/')\n    }\n    this.preserveMultipleSlashes = !!options.preserveMultipleSlashes\n    this.regexp = null\n    this.negate = false\n    this.nonegate = !!options.nonegate\n    this.comment = false\n    this.empty = false\n    this.partial = !!options.partial\n    this.nocase = !!this.options.nocase\n    this.windowsNoMagicRoot =\n      options.windowsNoMagicRoot !== undefined ?\n        options.windowsNoMagicRoot\n      : !!(this.isWindows && this.nocase)\n\n    this.globSet = []\n    this.globParts = []\n    this.set = []\n\n    // make the set of regexps etc.\n    this.make()\n  }\n\n  hasMagic(): boolean {\n    if (this.options.magicalBraces && this.set.length > 1) {\n      return true\n    }\n    for (const pattern of this.set) {\n      for (const part of pattern) {\n        if (typeof part !== 'string') return true\n      }\n    }\n    return false\n  }\n\n  debug(..._: any[]) {}\n\n  make() {\n    const pattern = this.pattern\n    const options = this.options\n\n    // empty patterns and comments match nothing.\n    if (!options.nocomment && pattern.charAt(0) === '#') {\n      this.comment = true\n      return\n    }\n\n    if (!pattern) {\n      this.empty = true\n      return\n    }\n\n    // step 1: figure out negation, etc.\n    this.parseNegate()\n\n    // step 2: expand braces\n    this.globSet = [...new Set(this.braceExpand())]\n\n    if (options.debug) {\n      this.debug = (...args: any[]) => console.error(...args)\n    }\n\n    this.debug(this.pattern, this.globSet)\n\n    // step 3: now we have a set, so turn each one into a series of\n    // path-portion matching patterns.\n    // These will be regexps, except in the case of \"**\", which is\n    // set to the GLOBSTAR object for globstar behavior,\n    // and will not contain any / characters\n    //\n    // First, we preprocess to make the glob pattern sets a bit simpler\n    // and deduped.  There are some perf-killing patterns that can cause\n    // problems with a glob walk, but we can simplify them down a bit.\n    const rawGlobParts = this.globSet.map(s => this.slashSplit(s))\n    this.globParts = this.preprocess(rawGlobParts)\n    this.debug(this.pattern, this.globParts)\n\n    // glob --> regexps\n    let set = this.globParts.map((s, _, __) => {\n      if (this.isWindows && this.windowsNoMagicRoot) {\n        // check if it's a drive or unc path.\n        const isUNC =\n          s[0] === '' &&\n          s[1] === '' &&\n          (s[2] === '?' || !globMagic.test(s[2])) &&\n          !globMagic.test(s[3])\n        const isDrive = /^[a-z]:/i.test(s[0])\n        if (isUNC) {\n          return [\n            ...s.slice(0, 4),\n            ...s.slice(4).map(ss => this.parse(ss)),\n          ]\n        } else if (isDrive) {\n          return [s[0], ...s.slice(1).map(ss => this.parse(ss))]\n        }\n      }\n      return s.map(ss => this.parse(ss))\n    })\n\n    this.debug(this.pattern, set)\n\n    // filter out everything that didn't compile properly.\n    this.set = set.filter(\n      s => s.indexOf(false) === -1,\n    ) as ParseReturnFiltered[][]\n\n    // do not treat the ? in UNC paths as magic\n    if (this.isWindows) {\n      for (let i = 0; i < this.set.length; i++) {\n        const p = this.set[i]\n        if (\n          p[0] === '' &&\n          p[1] === '' &&\n          this.globParts[i][2] === '?' &&\n          typeof p[3] === 'string' &&\n          /^[a-z]:$/i.test(p[3])\n        ) {\n          p[2] = '?'\n        }\n      }\n    }\n\n    this.debug(this.pattern, this.set)\n  }\n\n  // various transforms to equivalent pattern sets that are\n  // faster to process in a filesystem walk.  The goal is to\n  // eliminate what we can, and push all ** patterns as far\n  // to the right as possible, even if it increases the number\n  // of patterns that we have to process.\n  preprocess(globParts: string[][]) {\n    // if we're not in globstar mode, then turn ** into *\n    if (this.options.noglobstar) {\n      for (let i = 0; i < globParts.length; i++) {\n        for (let j = 0; j < globParts[i].length; j++) {\n          if (globParts[i][j] === '**') {\n            globParts[i][j] = '*'\n          }\n        }\n      }\n    }\n\n    const { optimizationLevel = 1 } = this.options\n\n    if (optimizationLevel >= 2) {\n      // aggressive optimization for the purpose of fs walking\n      globParts = this.firstPhasePreProcess(globParts)\n      globParts = this.secondPhasePreProcess(globParts)\n    } else if (optimizationLevel >= 1) {\n      // just basic optimizations to remove some .. parts\n      globParts = this.levelOneOptimize(globParts)\n    } else {\n      // just collapse multiple ** portions into one\n      globParts = this.adjascentGlobstarOptimize(globParts)\n    }\n\n    return globParts\n  }\n\n  // just get rid of adjascent ** portions\n  adjascentGlobstarOptimize(globParts: string[][]) {\n    return globParts.map(parts => {\n      let gs: number = -1\n      while (-1 !== (gs = parts.indexOf('**', gs + 1))) {\n        let i = gs\n        while (parts[i + 1] === '**') {\n          i++\n        }\n        if (i !== gs) {\n          parts.splice(gs, i - gs)\n        }\n      }\n      return parts\n    })\n  }\n\n  // get rid of adjascent ** and resolve .. portions\n  levelOneOptimize(globParts: string[][]) {\n    return globParts.map(parts => {\n      parts = parts.reduce((set: string[], part) => {\n        const prev = set[set.length - 1]\n        if (part === '**' && prev === '**') {\n          return set\n        }\n        if (part === '..') {\n          if (prev && prev !== '..' && prev !== '.' && prev !== '**') {\n            set.pop()\n            return set\n          }\n        }\n        set.push(part)\n        return set\n      }, [])\n      return parts.length === 0 ? [''] : parts\n    })\n  }\n\n  levelTwoFileOptimize(parts: string | string[]) {\n    if (!Array.isArray(parts)) {\n      parts = this.slashSplit(parts)\n    }\n    let didSomething: boolean = false\n    do {\n      didSomething = false\n      // <pre>/<e>/<rest> -> <pre>/<rest>\n      if (!this.preserveMultipleSlashes) {\n        for (let i = 1; i < parts.length - 1; i++) {\n          const p = parts[i]\n          // don't squeeze out UNC patterns\n          if (i === 1 && p === '' && parts[0] === '') continue\n          if (p === '.' || p === '') {\n            didSomething = true\n            parts.splice(i, 1)\n            i--\n          }\n        }\n        if (\n          parts[0] === '.' &&\n          parts.length === 2 &&\n          (parts[1] === '.' || parts[1] === '')\n        ) {\n          didSomething = true\n          parts.pop()\n        }\n      }\n\n      // <pre>/<p>/../<rest> -> <pre>/<rest>\n      let dd: number = 0\n      while (-1 !== (dd = parts.indexOf('..', dd + 1))) {\n        const p = parts[dd - 1]\n        if (p && p !== '.' && p !== '..' && p !== '**') {\n          didSomething = true\n          parts.splice(dd - 1, 2)\n          dd -= 2\n        }\n      }\n    } while (didSomething)\n    return parts.length === 0 ? [''] : parts\n  }\n\n  // First phase: single-pattern processing\n  // <pre> is 1 or more portions\n  // <rest> is 1 or more portions\n  // <p> is any portion other than ., .., '', or **\n  // <e> is . or ''\n  //\n  // **/.. is *brutal* for filesystem walking performance, because\n  // it effectively resets the recursive walk each time it occurs,\n  // and ** cannot be reduced out by a .. pattern part like a regexp\n  // or most strings (other than .., ., and '') can be.\n  //\n  // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n  // <pre>/<e>/<rest> -> <pre>/<rest>\n  // <pre>/<p>/../<rest> -> <pre>/<rest>\n  // **/**/<rest> -> **/<rest>\n  //\n  // **/*/<rest> -> */**/<rest> <== not valid because ** doesn't follow\n  // this WOULD be allowed if ** did follow symlinks, or * didn't\n  firstPhasePreProcess(globParts: string[][]) {\n    let didSomething = false\n    do {\n      didSomething = false\n      // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n      for (let parts of globParts) {\n        let gs: number = -1\n        while (-1 !== (gs = parts.indexOf('**', gs + 1))) {\n          let gss: number = gs\n          while (parts[gss + 1] === '**') {\n            // <pre>/**/**/<rest> -> <pre>/**/<rest>\n            gss++\n          }\n          // eg, if gs is 2 and gss is 4, that means we have 3 **\n          // parts, and can remove 2 of them.\n          if (gss > gs) {\n            parts.splice(gs + 1, gss - gs)\n          }\n\n          let next = parts[gs + 1]\n          const p = parts[gs + 2]\n          const p2 = parts[gs + 3]\n          if (next !== '..') continue\n          if (\n            !p ||\n            p === '.' ||\n            p === '..' ||\n            !p2 ||\n            p2 === '.' ||\n            p2 === '..'\n          ) {\n            continue\n          }\n          didSomething = true\n          // edit parts in place, and push the new one\n          parts.splice(gs, 1)\n          const other = parts.slice(0)\n          other[gs] = '**'\n          globParts.push(other)\n          gs--\n        }\n\n        // <pre>/<e>/<rest> -> <pre>/<rest>\n        if (!this.preserveMultipleSlashes) {\n          for (let i = 1; i < parts.length - 1; i++) {\n            const p = parts[i]\n            // don't squeeze out UNC patterns\n            if (i === 1 && p === '' && parts[0] === '') continue\n            if (p === '.' || p === '') {\n              didSomething = true\n              parts.splice(i, 1)\n              i--\n            }\n          }\n          if (\n            parts[0] === '.' &&\n            parts.length === 2 &&\n            (parts[1] === '.' || parts[1] === '')\n          ) {\n            didSomething = true\n            parts.pop()\n          }\n        }\n\n        // <pre>/<p>/../<rest> -> <pre>/<rest>\n        let dd: number = 0\n        while (-1 !== (dd = parts.indexOf('..', dd + 1))) {\n          const p = parts[dd - 1]\n          if (p && p !== '.' && p !== '..' && p !== '**') {\n            didSomething = true\n            const needDot = dd === 1 && parts[dd + 1] === '**'\n            const splin = needDot ? ['.'] : []\n            parts.splice(dd - 1, 2, ...splin)\n            if (parts.length === 0) parts.push('')\n            dd -= 2\n          }\n        }\n      }\n    } while (didSomething)\n\n    return globParts\n  }\n\n  // second phase: multi-pattern dedupes\n  // {<pre>/*/<rest>,<pre>/<p>/<rest>} -> <pre>/*/<rest>\n  // {<pre>/<rest>,<pre>/<rest>} -> <pre>/<rest>\n  // {<pre>/**/<rest>,<pre>/<rest>} -> <pre>/**/<rest>\n  //\n  // {<pre>/**/<rest>,<pre>/**/<p>/<rest>} -> <pre>/**/<rest>\n  // ^-- not valid because ** doens't follow symlinks\n  secondPhasePreProcess(globParts: string[][]): string[][] {\n    for (let i = 0; i < globParts.length - 1; i++) {\n      for (let j = i + 1; j < globParts.length; j++) {\n        const matched = this.partsMatch(\n          globParts[i],\n          globParts[j],\n          !this.preserveMultipleSlashes,\n        )\n        if (matched) {\n          globParts[i] = []\n          globParts[j] = matched\n          break\n        }\n      }\n    }\n    return globParts.filter(gs => gs.length)\n  }\n\n  partsMatch(\n    a: string[],\n    b: string[],\n    emptyGSMatch: boolean = false,\n  ): false | string[] {\n    let ai = 0\n    let bi = 0\n    let result: string[] = []\n    let which: string = ''\n    while (ai < a.length && bi < b.length) {\n      if (a[ai] === b[bi]) {\n        result.push(which === 'b' ? b[bi] : a[ai])\n        ai++\n        bi++\n      } else if (emptyGSMatch && a[ai] === '**' && b[bi] === a[ai + 1]) {\n        result.push(a[ai])\n        ai++\n      } else if (emptyGSMatch && b[bi] === '**' && a[ai] === b[bi + 1]) {\n        result.push(b[bi])\n        bi++\n      } else if (\n        a[ai] === '*' &&\n        b[bi] &&\n        (this.options.dot || !b[bi].startsWith('.')) &&\n        b[bi] !== '**'\n      ) {\n        if (which === 'b') return false\n        which = 'a'\n        result.push(a[ai])\n        ai++\n        bi++\n      } else if (\n        b[bi] === '*' &&\n        a[ai] &&\n        (this.options.dot || !a[ai].startsWith('.')) &&\n        a[ai] !== '**'\n      ) {\n        if (which === 'a') return false\n        which = 'b'\n        result.push(b[bi])\n        ai++\n        bi++\n      } else {\n        return false\n      }\n    }\n    // if we fall out of the loop, it means they two are identical\n    // as long as their lengths match\n    return a.length === b.length && result\n  }\n\n  parseNegate() {\n    if (this.nonegate) return\n\n    const pattern = this.pattern\n    let negate = false\n    let negateOffset = 0\n\n    for (let i = 0; i < pattern.length && pattern.charAt(i) === '!'; i++) {\n      negate = !negate\n      negateOffset++\n    }\n\n    if (negateOffset) this.pattern = pattern.slice(negateOffset)\n    this.negate = negate\n  }\n\n  // set partial to true to test if, for example,\n  // \"/a/b\" matches the start of \"/*/b/*/d\"\n  // Partial means, if you run out of file before you run\n  // out of pattern, then that's fine, as long as all\n  // the parts match.\n  matchOne(\n    file: string[],\n    pattern: ParseReturn[],\n    partial: boolean = false,\n  ) {\n    const options = this.options\n\n    // UNC paths like //?/X:/... can match X:/... and vice versa\n    // Drive letters in absolute drive or unc paths are always compared\n    // case-insensitively.\n    if (this.isWindows) {\n      const fileDrive =\n        typeof file[0] === 'string' && /^[a-z]:$/i.test(file[0])\n      const fileUNC =\n        !fileDrive &&\n        file[0] === '' &&\n        file[1] === '' &&\n        file[2] === '?' &&\n        /^[a-z]:$/i.test(file[3])\n\n      const patternDrive =\n        typeof pattern[0] === 'string' && /^[a-z]:$/i.test(pattern[0])\n      const patternUNC =\n        !patternDrive &&\n        pattern[0] === '' &&\n        pattern[1] === '' &&\n        pattern[2] === '?' &&\n        typeof pattern[3] === 'string' &&\n        /^[a-z]:$/i.test(pattern[3])\n\n      const fdi =\n        fileUNC ? 3\n        : fileDrive ? 0\n        : undefined\n      const pdi =\n        patternUNC ? 3\n        : patternDrive ? 0\n        : undefined\n      if (typeof fdi === 'number' && typeof pdi === 'number') {\n        const [fd, pd]: [string, string] = [\n          file[fdi],\n          pattern[pdi] as string,\n        ]\n        if (fd.toLowerCase() === pd.toLowerCase()) {\n          pattern[pdi] = fd\n          if (pdi > fdi) {\n            pattern = pattern.slice(pdi)\n          } else if (fdi > pdi) {\n            file = file.slice(fdi)\n          }\n        }\n      }\n    }\n\n    // resolve and reduce . and .. portions in the file as well.\n    // don't need to do the second phase, because it's only one string[]\n    const { optimizationLevel = 1 } = this.options\n    if (optimizationLevel >= 2) {\n      file = this.levelTwoFileOptimize(file)\n    }\n\n    this.debug('matchOne', this, { file, pattern })\n    this.debug('matchOne', file.length, pattern.length)\n\n    for (\n      var fi = 0, pi = 0, fl = file.length, pl = pattern.length;\n      fi < fl && pi < pl;\n      fi++, pi++\n    ) {\n      this.debug('matchOne loop')\n      var p = pattern[pi]\n      var f = file[fi]\n\n      this.debug(pattern, p, f)\n\n      // should be impossible.\n      // some invalid regexp stuff in the set.\n      /* c8 ignore start */\n      if (p === false) {\n        return false\n      }\n      /* c8 ignore stop */\n\n      if (p === GLOBSTAR) {\n        this.debug('GLOBSTAR', [pattern, p, f])\n\n        // \"**\"\n        // a/**/b/**/c would match the following:\n        // a/b/x/y/z/c\n        // a/x/y/z/b/c\n        // a/b/x/b/x/c\n        // a/b/c\n        // To do this, take the rest of the pattern after\n        // the **, and see if it would match the file remainder.\n        // If so, return success.\n        // If not, the ** \"swallows\" a segment, and try again.\n        // This is recursively awful.\n        //\n        // a/**/b/**/c matching a/b/x/y/z/c\n        // - a matches a\n        // - doublestar\n        //   - matchOne(b/x/y/z/c, b/**/c)\n        //     - b matches b\n        //     - doublestar\n        //       - matchOne(x/y/z/c, c) -> no\n        //       - matchOne(y/z/c, c) -> no\n        //       - matchOne(z/c, c) -> no\n        //       - matchOne(c, c) yes, hit\n        var fr = fi\n        var pr = pi + 1\n        if (pr === pl) {\n          this.debug('** at the end')\n          // a ** at the end will just swallow the rest.\n          // We have found a match.\n          // however, it will not swallow /.x, unless\n          // options.dot is set.\n          // . and .. are *never* matched by **, for explosively\n          // exponential reasons.\n          for (; fi < fl; fi++) {\n            if (\n              file[fi] === '.' ||\n              file[fi] === '..' ||\n              (!options.dot && file[fi].charAt(0) === '.')\n            )\n              return false\n          }\n          return true\n        }\n\n        // ok, let's see if we can swallow whatever we can.\n        while (fr < fl) {\n          var swallowee = file[fr]\n\n          this.debug('\\nglobstar while', file, fr, pattern, pr, swallowee)\n\n          // XXX remove this slice.  Just pass the start index.\n          if (this.matchOne(file.slice(fr), pattern.slice(pr), partial)) {\n            this.debug('globstar found match!', fr, fl, swallowee)\n            // found a match.\n            return true\n          } else {\n            // can't swallow \".\" or \"..\" ever.\n            // can only swallow \".foo\" when explicitly asked.\n            if (\n              swallowee === '.' ||\n              swallowee === '..' ||\n              (!options.dot && swallowee.charAt(0) === '.')\n            ) {\n              this.debug('dot detected!', file, fr, pattern, pr)\n              break\n            }\n\n            // ** swallows a segment, and continue.\n            this.debug('globstar swallow a segment, and continue')\n            fr++\n          }\n        }\n\n        // no match was found.\n        // However, in partial mode, we can't say this is necessarily over.\n        /* c8 ignore start */\n        if (partial) {\n          // ran out of file\n          this.debug('\\n>>> no match, partial?', file, fr, pattern, pr)\n          if (fr === fl) {\n            return true\n          }\n        }\n        /* c8 ignore stop */\n        return false\n      }\n\n      // something other than **\n      // non-magic patterns just have to match exactly\n      // patterns with magic have been turned into regexps.\n      let hit: boolean\n      if (typeof p === 'string') {\n        hit = f === p\n        this.debug('string match', p, f, hit)\n      } else {\n        hit = p.test(f)\n        this.debug('pattern match', p, f, hit)\n      }\n\n      if (!hit) return false\n    }\n\n    // Note: ending in / means that we'll get a final \"\"\n    // at the end of the pattern.  This can only match a\n    // corresponding \"\" at the end of the file.\n    // If the file ends in /, then it can only match a\n    // a pattern that ends in /, unless the pattern just\n    // doesn't have any more for it. But, a/b/ should *not*\n    // match \"a/b/*\", even though \"\" matches against the\n    // [^/]*? pattern, except in partial mode, where it might\n    // simply not be reached yet.\n    // However, a/b/ should still satisfy a/*\n\n    // now either we fell off the end of the pattern, or we're done.\n    if (fi === fl && pi === pl) {\n      // ran out of pattern and filename at the same time.\n      // an exact hit!\n      return true\n    } else if (fi === fl) {\n      // ran out of file, but still had pattern left.\n      // this is ok if we're doing the match as part of\n      // a glob fs traversal.\n      return partial\n    } else if (pi === pl) {\n      // ran out of pattern, still have file left.\n      // this is only acceptable if we're on the very last\n      // empty segment of a file with a trailing slash.\n      // a/* should match a/b/\n      return fi === fl - 1 && file[fi] === ''\n\n      /* c8 ignore start */\n    } else {\n      // should be unreachable.\n      throw new Error('wtf?')\n    }\n    /* c8 ignore stop */\n  }\n\n  braceExpand() {\n    return braceExpand(this.pattern, this.options)\n  }\n\n  parse(pattern: string): ParseReturn {\n    assertValidPattern(pattern)\n\n    const options = this.options\n\n    // shortcuts\n    if (pattern === '**') return GLOBSTAR\n    if (pattern === '') return ''\n\n    // far and away, the most common glob pattern parts are\n    // *, *.*, and *.<ext>  Add a fast check method for those.\n    let m: RegExpMatchArray | null\n    let fastTest: null | ((f: string) => boolean) = null\n    if ((m = pattern.match(starRE))) {\n      fastTest = options.dot ? starTestDot : starTest\n    } else if ((m = pattern.match(starDotExtRE))) {\n      fastTest = (\n        options.nocase ?\n          options.dot ?\n            starDotExtTestNocaseDot\n          : starDotExtTestNocase\n        : options.dot ? starDotExtTestDot\n        : starDotExtTest)(m[1])\n    } else if ((m = pattern.match(qmarksRE))) {\n      fastTest = (\n        options.nocase ?\n          options.dot ?\n            qmarksTestNocaseDot\n          : qmarksTestNocase\n        : options.dot ? qmarksTestDot\n        : qmarksTest)(m)\n    } else if ((m = pattern.match(starDotStarRE))) {\n      fastTest = options.dot ? starDotStarTestDot : starDotStarTest\n    } else if ((m = pattern.match(dotStarRE))) {\n      fastTest = dotStarTest\n    }\n\n    const re = AST.fromGlob(pattern, this.options).toMMPattern()\n    if (fastTest && typeof re === 'object') {\n      // Avoids overriding in frozen environments\n      Reflect.defineProperty(re, 'test', { value: fastTest })\n    }\n    return re\n  }\n\n  makeRe() {\n    if (this.regexp || this.regexp === false) return this.regexp\n\n    // at this point, this.set is a 2d array of partial\n    // pattern strings, or \"**\".\n    //\n    // It's better to use .match().  This function shouldn't\n    // be used, really, but it's pretty convenient sometimes,\n    // when you just want to work with a regex.\n    const set = this.set\n\n    if (!set.length) {\n      this.regexp = false\n      return this.regexp\n    }\n    const options = this.options\n\n    const twoStar =\n      options.noglobstar ? star\n      : options.dot ? twoStarDot\n      : twoStarNoDot\n    const flags = new Set(options.nocase ? ['i'] : [])\n\n    // regexpify non-globstar patterns\n    // if ** is only item, then we just do one twoStar\n    // if ** is first, and there are more, prepend (\\/|twoStar\\/)? to next\n    // if ** is last, append (\\/twoStar|) to previous\n    // if ** is in the middle, append (\\/|\\/twoStar\\/) to previous\n    // then filter out GLOBSTAR symbols\n    let re = set\n      .map(pattern => {\n        const pp: (string | typeof GLOBSTAR)[] = pattern.map(p => {\n          if (p instanceof RegExp) {\n            for (const f of p.flags.split('')) flags.add(f)\n          }\n          return (\n            typeof p === 'string' ? regExpEscape(p)\n            : p === GLOBSTAR ? GLOBSTAR\n            : p._src\n          )\n        }) as (string | typeof GLOBSTAR)[]\n        pp.forEach((p, i) => {\n          const next = pp[i + 1]\n          const prev = pp[i - 1]\n          if (p !== GLOBSTAR || prev === GLOBSTAR) {\n            return\n          }\n          if (prev === undefined) {\n            if (next !== undefined && next !== GLOBSTAR) {\n              pp[i + 1] = '(?:\\\\/|' + twoStar + '\\\\/)?' + next\n            } else {\n              pp[i] = twoStar\n            }\n          } else if (next === undefined) {\n            pp[i - 1] = prev + '(?:\\\\/|\\\\/' + twoStar + ')?'\n          } else if (next !== GLOBSTAR) {\n            pp[i - 1] = prev + '(?:\\\\/|\\\\/' + twoStar + '\\\\/)' + next\n            pp[i + 1] = GLOBSTAR\n          }\n        })\n        const filtered = pp.filter(p => p !== GLOBSTAR)\n\n        // For partial matches, we need to make the pattern match\n        // any prefix of the full path. We do this by generating\n        // alternative patterns that match progressively longer prefixes.\n        if (this.partial && filtered.length >= 1) {\n          const prefixes: string[] = []\n          for (let i = 1; i <= filtered.length; i++) {\n            prefixes.push(filtered.slice(0, i).join('/'))\n          }\n          return '(?:' + prefixes.join('|') + ')'\n        }\n\n        return filtered.join('/')\n      })\n      .join('|')\n\n    // need to wrap in parens if we had more than one thing with |,\n    // otherwise only the first will be anchored to ^ and the last to $\n    const [open, close] = set.length > 1 ? ['(?:', ')'] : ['', '']\n    // must match entire pattern\n    // ending in a * or ** will make it less strict.\n    re = '^' + open + re + close + '$'\n\n    // In partial mode, '/' should always match as it's a valid prefix for any pattern\n    if (this.partial) {\n      re = '^(?:\\\\/|' + open + re.slice(1, -1) + close + ')$'\n    }\n\n    // can match anything, as long as it's not this.\n    if (this.negate) re = '^(?!' + re + ').+$'\n\n    try {\n      this.regexp = new RegExp(re, [...flags].join(''))\n      /* c8 ignore start */\n    } catch (ex) {\n      // should be impossible\n      this.regexp = false\n    }\n    /* c8 ignore stop */\n    return this.regexp\n  }\n\n  slashSplit(p: string) {\n    // if p starts with // on windows, we preserve that\n    // so that UNC paths aren't broken.  Otherwise, any number of\n    // / characters are coalesced into one, unless\n    // preserveMultipleSlashes is set to true.\n    if (this.preserveMultipleSlashes) {\n      return p.split('/')\n    } else if (this.isWindows && /^\\/\\/[^\\/]+/.test(p)) {\n      // add an extra '' for the one we lose\n      return ['', ...p.split(/\\/+/)]\n    } else {\n      return p.split(/\\/+/)\n    }\n  }\n\n  match(f: string, partial = this.partial) {\n    this.debug('match', f, this.pattern)\n    // short-circuit in the case of busted things.\n    // comments, etc.\n    if (this.comment) {\n      return false\n    }\n    if (this.empty) {\n      return f === ''\n    }\n\n    if (f === '/' && partial) {\n      return true\n    }\n\n    const options = this.options\n\n    // windows: need to use /, not \\\n    if (this.isWindows) {\n      f = f.split('\\\\').join('/')\n    }\n\n    // treat the test path as a set of pathparts.\n    const ff = this.slashSplit(f)\n    this.debug(this.pattern, 'split', ff)\n\n    // just ONE of the pattern sets in this.set needs to match\n    // in order for it to be valid.  If negating, then just one\n    // match means that we have failed.\n    // Either way, return on the first hit.\n\n    const set = this.set\n    this.debug(this.pattern, 'set', set)\n\n    // Find the basename of the path by looking for the last non-empty segment\n    let filename: string = ff[ff.length - 1]\n    if (!filename) {\n      for (let i = ff.length - 2; !filename && i >= 0; i--) {\n        filename = ff[i]\n      }\n    }\n\n    for (let i = 0; i < set.length; i++) {\n      const pattern = set[i]\n      let file = ff\n      if (options.matchBase && pattern.length === 1) {\n        file = [filename]\n      }\n      const hit = this.matchOne(file, pattern, partial)\n      if (hit) {\n        if (options.flipNegate) {\n          return true\n        }\n        return !this.negate\n      }\n    }\n\n    // didn't get any hits.  this is success if it's a negative\n    // pattern, failure otherwise.\n    if (options.flipNegate) {\n      return false\n    }\n    return this.negate\n  }\n\n  static defaults(def: MinimatchOptions) {\n    return minimatch.defaults(def).Minimatch\n  }\n}\n/* c8 ignore start */\nexport { AST } from './ast.js'\nexport { escape } from './escape.js'\nexport { unescape } from './unescape.js'\n/* c8 ignore stop */\nminimatch.AST = AST\nminimatch.Minimatch = Minimatch\nminimatch.escape = escape\nminimatch.unescape = unescape\n", "import { Minimatch, MinimatchOptions } from 'minimatch'\nimport { Minipass } from 'minipass'\nimport { fileURLToPath } from 'node:url'\nimport {\n  FSOption,\n  Path,\n  PathScurry,\n  PathScurryDarwin,\n  PathScurryPosix,\n  PathScurryWin32,\n} from 'path-scurry'\nimport { IgnoreLike } from './ignore.js'\nimport { Pattern } from './pattern.js'\nimport { GlobStream, GlobWalker } from './walker.js'\n\nexport type MatchSet = Minimatch['set']\nexport type GlobParts = Exclude<Minimatch['globParts'], undefined>\n\n// if no process global, just call it linux.\n// so we default to case-sensitive, / separators\nconst defaultPlatform: NodeJS.Platform =\n  (\n    typeof process === 'object' &&\n    process &&\n    typeof process.platform === 'string'\n  ) ?\n    process.platform\n  : 'linux'\n\n/**\n * A `GlobOptions` object may be provided to any of the exported methods, and\n * must be provided to the `Glob` constructor.\n *\n * All options are optional, boolean, and false by default, unless otherwise\n * noted.\n *\n * All resolved options are added to the Glob object as properties.\n *\n * If you are running many `glob` operations, you can pass a Glob object as the\n * `options` argument to a subsequent operation to share the previously loaded\n * cache.\n */\nexport interface GlobOptions {\n  /**\n   * Set to `true` to always receive absolute paths for\n   * matched files. Set to `false` to always return relative paths.\n   *\n   * When this option is not set, absolute paths are returned for patterns\n   * that are absolute, and otherwise paths are returned that are relative\n   * to the `cwd` setting.\n   *\n   * This does _not_ make an extra system call to get\n   * the realpath, it only does string path resolution.\n   *\n   * Conflicts with {@link withFileTypes}\n   */\n  absolute?: boolean\n\n  /**\n   * Set to false to enable {@link windowsPathsNoEscape}\n   *\n   * @deprecated\n   */\n  allowWindowsEscape?: boolean\n\n  /**\n   * The current working directory in which to search. Defaults to\n   * `process.cwd()`.\n   *\n   * May be eiher a string path or a `file://` URL object or string.\n   */\n  cwd?: string | URL\n\n  /**\n   * Include `.dot` files in normal matches and `globstar`\n   * matches. Note that an explicit dot in a portion of the pattern\n   * will always match dot files.\n   */\n  dot?: boolean\n\n  /**\n   * Prepend all relative path strings with `./` (or `.\\` on Windows).\n   *\n   * Without this option, returned relative paths are \"bare\", so instead of\n   * returning `'./foo/bar'`, they are returned as `'foo/bar'`.\n   *\n   * Relative patterns starting with `'../'` are not prepended with `./`, even\n   * if this option is set.\n   */\n  dotRelative?: boolean\n\n  /**\n   * Follow symlinked directories when expanding `**`\n   * patterns. This can result in a lot of duplicate references in\n   * the presence of cyclic links, and make performance quite bad.\n   *\n   * By default, a `**` in a pattern will follow 1 symbolic link if\n   * it is not the first item in the pattern, or none if it is the\n   * first item in the pattern, following the same behavior as Bash.\n   */\n  follow?: boolean\n\n  /**\n   * string or string[], or an object with `ignored` and `childrenIgnored`\n   * methods.\n   *\n   * If a string or string[] is provided, then this is treated as a glob\n   * pattern or array of glob patterns to exclude from matches. To ignore all\n   * children within a directory, as well as the entry itself, append `'/**'`\n   * to the ignore pattern.\n   *\n   * **Note** `ignore` patterns are _always_ in `dot:true` mode, regardless of\n   * any other settings.\n   *\n   * If an object is provided that has `ignored(path)` and/or\n   * `childrenIgnored(path)` methods, then these methods will be called to\n   * determine whether any Path is a match or if its children should be\n   * traversed, respectively.\n   */\n  ignore?: string | string[] | IgnoreLike\n\n  /**\n   * Treat brace expansion like `{a,b}` as a \"magic\" pattern. Has no\n   * effect if {@link nobrace} is set.\n   *\n   * Only has effect on the {@link hasMagic} function.\n   */\n  magicalBraces?: boolean\n\n  /**\n   * Add a `/` character to directory matches. Note that this requires\n   * additional stat calls in some cases.\n   */\n  mark?: boolean\n\n  /**\n   * Perform a basename-only match if the pattern does not contain any slash\n   * characters. That is, `*.js` would be treated as equivalent to\n   * `**\\/*.js`, matching all js files in all directories.\n   */\n  matchBase?: boolean\n\n  /**\n   * Limit the directory traversal to a given depth below the cwd.\n   * Note that this does NOT prevent traversal to sibling folders,\n   * root patterns, and so on. It only limits the maximum folder depth\n   * that the walk will descend, relative to the cwd.\n   */\n  maxDepth?: number\n\n  /**\n   * Do not expand `{a,b}` and `{1..3}` brace sets.\n   */\n  nobrace?: boolean\n\n  /**\n   * Perform a case-insensitive match. This defaults to `true` on macOS and\n   * Windows systems, and `false` on all others.\n   *\n   * **Note** `nocase` should only be explicitly set when it is\n   * known that the filesystem's case sensitivity differs from the\n   * platform default. If set `true` on case-sensitive file\n   * systems, or `false` on case-insensitive file systems, then the\n   * walk may return more or less results than expected.\n   */\n  nocase?: boolean\n\n  /**\n   * Do not match directories, only files. (Note: to match\n   * _only_ directories, put a `/` at the end of the pattern.)\n   */\n  nodir?: boolean\n\n  /**\n   * Do not match \"extglob\" patterns such as `+(a|b)`.\n   */\n  noext?: boolean\n\n  /**\n   * Do not match `**` against multiple filenames. (Ie, treat it as a normal\n   * `*` instead.)\n   *\n   * Conflicts with {@link matchBase}\n   */\n  noglobstar?: boolean\n\n  /**\n   * Defaults to value of `process.platform` if available, or `'linux'` if\n   * not. Setting `platform:'win32'` on non-Windows systems may cause strange\n   * behavior.\n   */\n  platform?: NodeJS.Platform\n\n  /**\n   * Set to true to call `fs.realpath` on all of the\n   * results. In the case of an entry that cannot be resolved, the\n   * entry is omitted. This incurs a slight performance penalty, of\n   * course, because of the added system calls.\n   */\n  realpath?: boolean\n\n  /**\n   *\n   * A string path resolved against the `cwd` option, which\n   * is used as the starting point for absolute patterns that start\n   * with `/`, (but not drive letters or UNC paths on Windows).\n   *\n   * Note that this _doesn't_ necessarily limit the walk to the\n   * `root` directory, and doesn't affect the cwd starting point for\n   * non-absolute patterns. A pattern containing `..` will still be\n   * able to traverse out of the root directory, if it is not an\n   * actual root directory on the filesystem, and any non-absolute\n   * patterns will be matched in the `cwd`. For example, the\n   * pattern `/../*` with `{root:'/some/path'}` will return all\n   * files in `/some`, not all files in `/some/path`. The pattern\n   * `*` with `{root:'/some/path'}` will return all the entries in\n   * the cwd, not the entries in `/some/path`.\n   *\n   * To start absolute and non-absolute patterns in the same\n   * path, you can use `{root:''}`. However, be aware that on\n   * Windows systems, a pattern like `x:/*` or `//host/share/*` will\n   * _always_ start in the `x:/` or `//host/share` directory,\n   * regardless of the `root` setting.\n   */\n  root?: string\n\n  /**\n   * A [PathScurry](http://npm.im/path-scurry) object used\n   * to traverse the file system. If the `nocase` option is set\n   * explicitly, then any provided `scurry` object must match this\n   * setting.\n   */\n  scurry?: PathScurry\n\n  /**\n   * Call `lstat()` on all entries, whether required or not to determine\n   * if it's a valid match. When used with {@link withFileTypes}, this means\n   * that matches will include data such as modified time, permissions, and\n   * so on.  Note that this will incur a performance cost due to the added\n   * system calls.\n   */\n  stat?: boolean\n\n  /**\n   * An AbortSignal which will cancel the Glob walk when\n   * triggered.\n   */\n  signal?: AbortSignal\n\n  /**\n   * Use `\\\\` as a path separator _only_, and\n   *  _never_ as an escape character. If set, all `\\\\` characters are\n   *  replaced with `/` in the pattern.\n   *\n   *  Note that this makes it **impossible** to match against paths\n   *  containing literal glob pattern characters, but allows matching\n   *  with patterns constructed using `path.join()` and\n   *  `path.resolve()` on Windows platforms, mimicking the (buggy!)\n   *  behavior of Glob v7 and before on Windows. Please use with\n   *  caution, and be mindful of [the caveat below about Windows\n   *  paths](#windows). (For legacy reasons, this is also set if\n   *  `allowWindowsEscape` is set to the exact value `false`.)\n   */\n  windowsPathsNoEscape?: boolean\n\n  /**\n   * Return [PathScurry](http://npm.im/path-scurry)\n   * `Path` objects instead of strings. These are similar to a\n   * NodeJS `Dirent` object, but with additional methods and\n   * properties.\n   *\n   * Conflicts with {@link absolute}\n   */\n  withFileTypes?: boolean\n\n  /**\n   * An fs implementation to override some or all of the defaults.  See\n   * http://npm.im/path-scurry for details about what can be overridden.\n   */\n  fs?: FSOption\n\n  /**\n   * Just passed along to Minimatch.  Note that this makes all pattern\n   * matching operations slower and *extremely* noisy.\n   */\n  debug?: boolean\n\n  /**\n   * Return `/` delimited paths, even on Windows.\n   *\n   * On posix systems, this has no effect.  But, on Windows, it means that\n   * paths will be `/` delimited, and absolute paths will be their full\n   * resolved UNC forms, eg instead of `'C:\\\\foo\\\\bar'`, it would return\n   * `'//?/C:/foo/bar'`\n   */\n  posix?: boolean\n\n  /**\n   * Do not match any children of any matches. For example, the pattern\n   * `**\\/foo` would match `a/foo`, but not `a/foo/b/foo` in this mode.\n   *\n   * This is especially useful for cases like \"find all `node_modules`\n   * folders, but not the ones in `node_modules`\".\n   *\n   * In order to support this, the `Ignore` implementation must support an\n   * `add(pattern: string)` method. If using the default `Ignore` class, then\n   * this is fine, but if this is set to `false`, and a custom `Ignore` is\n   * provided that does not have an `add()` method, then it will throw an\n   * error.\n   *\n   * **Caveat** It *only* ignores matches that would be a descendant of a\n   * previous match, and only if that descendant is matched *after* the\n   * ancestor is encountered. Since the file system walk happens in\n   * indeterminate order, it's possible that a match will already be added\n   * before its ancestor, if multiple or braced patterns are used.\n   *\n   * For example:\n   *\n   * ```ts\n   * const results = await glob([\n   *   // likely to match first, since it's just a stat\n   *   'a/b/c/d/e/f',\n   *\n   *   // this pattern is more complicated! It must to various readdir()\n   *   // calls and test the results against a regular expression, and that\n   *   // is certainly going to take a little bit longer.\n   *   //\n   *   // So, later on, it encounters a match at 'a/b/c/d/e', but it's too\n   *   // late to ignore a/b/c/d/e/f, because it's already been emitted.\n   *   'a/[bdf]/?/[a-z]/*',\n   * ], { includeChildMatches: false })\n   * ```\n   *\n   * It's best to only set this to `false` if you can be reasonably sure that\n   * no components of the pattern will potentially match one another's file\n   * system descendants, or if the occasional included child entry will not\n   * cause problems.\n   *\n   * @default true\n   */\n  includeChildMatches?: boolean\n\n  /**\n   * max number of `{...}` patterns to expand. Default `1_000`.\n   *\n   * Note: this is much less than minimatch's default of `100_000`,\n   * because Glob has higher memory requirements due to walking\n   * the file system tree.\n   */\n  braceExpandMax?: number\n}\n\nexport type GlobOptionsWithFileTypesTrue = GlobOptions & {\n  withFileTypes: true\n  // string options not relevant if returning Path objects.\n  absolute?: undefined\n  mark?: undefined\n  posix?: undefined\n}\n\nexport type GlobOptionsWithFileTypesFalse = GlobOptions & {\n  withFileTypes?: false\n}\n\nexport type GlobOptionsWithFileTypesUnset = GlobOptions & {\n  withFileTypes?: undefined\n}\n\nexport type Result<Opts> =\n  Opts extends GlobOptionsWithFileTypesTrue ? Path\n  : Opts extends GlobOptionsWithFileTypesFalse ? string\n  : Opts extends GlobOptionsWithFileTypesUnset ? string\n  : string | Path\nexport type Results<Opts> = Result<Opts>[]\n\nexport type FileTypes<Opts> =\n  Opts extends GlobOptionsWithFileTypesTrue ? true\n  : Opts extends GlobOptionsWithFileTypesFalse ? false\n  : Opts extends GlobOptionsWithFileTypesUnset ? false\n  : boolean\n\n/**\n * An object that can perform glob pattern traversals.\n */\nexport class Glob<Opts extends GlobOptions> implements GlobOptions {\n  absolute?: boolean\n  cwd: string\n  root?: string\n  dot: boolean\n  dotRelative: boolean\n  follow: boolean\n  ignore?: string | string[] | IgnoreLike\n  magicalBraces: boolean\n  mark?: boolean\n  matchBase: boolean\n  maxDepth: number\n  nobrace: boolean\n  nocase: boolean\n  nodir: boolean\n  noext: boolean\n  noglobstar: boolean\n  pattern: string[]\n  platform: NodeJS.Platform\n  realpath: boolean\n  scurry: PathScurry\n  stat: boolean\n  signal?: AbortSignal\n  windowsPathsNoEscape: boolean\n  withFileTypes: FileTypes<Opts>\n  includeChildMatches: boolean\n\n  /**\n   * The options provided to the constructor.\n   */\n  opts: Opts\n\n  /**\n   * An array of parsed immutable {@link Pattern} objects.\n   */\n  patterns: Pattern[]\n\n  /**\n   * All options are stored as properties on the `Glob` object.\n   *\n   * See {@link GlobOptions} for full options descriptions.\n   *\n   * Note that a previous `Glob` object can be passed as the\n   * `GlobOptions` to another `Glob` instantiation to re-use settings\n   * and caches with a new pattern.\n   *\n   * Traversal functions can be called multiple times to run the walk\n   * again.\n   */\n  constructor(pattern: string | string[], opts: Opts) {\n    /* c8 ignore start */\n    if (!opts) throw new TypeError('glob options required')\n    /* c8 ignore stop */\n    this.withFileTypes = !!opts.withFileTypes as FileTypes<Opts>\n    this.signal = opts.signal\n    this.follow = !!opts.follow\n    this.dot = !!opts.dot\n    this.dotRelative = !!opts.dotRelative\n    this.nodir = !!opts.nodir\n    this.mark = !!opts.mark\n    if (!opts.cwd) {\n      this.cwd = ''\n    } else if (opts.cwd instanceof URL || opts.cwd.startsWith('file://')) {\n      opts.cwd = fileURLToPath(opts.cwd)\n    }\n    this.cwd = opts.cwd || ''\n    this.root = opts.root\n    this.magicalBraces = !!opts.magicalBraces\n    this.nobrace = !!opts.nobrace\n    this.noext = !!opts.noext\n    this.realpath = !!opts.realpath\n    this.absolute = opts.absolute\n    this.includeChildMatches = opts.includeChildMatches !== false\n\n    this.noglobstar = !!opts.noglobstar\n    this.matchBase = !!opts.matchBase\n    this.maxDepth =\n      typeof opts.maxDepth === 'number' ? opts.maxDepth : Infinity\n    this.stat = !!opts.stat\n    this.ignore = opts.ignore\n\n    if (this.withFileTypes && this.absolute !== undefined) {\n      throw new Error('cannot set absolute and withFileTypes:true')\n    }\n\n    if (typeof pattern === 'string') {\n      pattern = [pattern]\n    }\n\n    this.windowsPathsNoEscape =\n      !!opts.windowsPathsNoEscape ||\n      (opts as { allowWindowsEscape?: boolean }).allowWindowsEscape ===\n        false\n\n    if (this.windowsPathsNoEscape) {\n      pattern = pattern.map(p => p.replace(/\\\\/g, '/'))\n    }\n\n    if (this.matchBase) {\n      if (opts.noglobstar) {\n        throw new TypeError('base matching requires globstar')\n      }\n      pattern = pattern.map(p => (p.includes('/') ? p : `./**/${p}`))\n    }\n\n    this.pattern = pattern\n\n    this.platform = opts.platform || defaultPlatform\n    this.opts = { ...opts, platform: this.platform }\n    if (opts.scurry) {\n      this.scurry = opts.scurry\n      if (\n        opts.nocase !== undefined &&\n        opts.nocase !== opts.scurry.nocase\n      ) {\n        throw new Error('nocase option contradicts provided scurry option')\n      }\n    } else {\n      const Scurry =\n        opts.platform === 'win32' ? PathScurryWin32\n        : opts.platform === 'darwin' ? PathScurryDarwin\n        : opts.platform ? PathScurryPosix\n        : PathScurry\n      this.scurry = new Scurry(this.cwd, {\n        nocase: opts.nocase,\n        fs: opts.fs,\n      })\n    }\n    this.nocase = this.scurry.nocase\n\n    // If you do nocase:true on a case-sensitive file system, then\n    // we need to use regexps instead of strings for non-magic\n    // path portions, because statting `aBc` won't return results\n    // for the file `AbC` for example.\n    const nocaseMagicOnly =\n      this.platform === 'darwin' || this.platform === 'win32'\n\n    const mmo: MinimatchOptions = {\n      braceExpandMax: 10_000,\n      ...opts,\n      dot: this.dot,\n      matchBase: this.matchBase,\n      nobrace: this.nobrace,\n      // default nocase based on platform\n      nocase: this.nocase,\n      nocaseMagicOnly,\n      nocomment: true,\n      noext: this.noext,\n      nonegate: true,\n      optimizationLevel: 2,\n      platform: this.platform,\n      windowsPathsNoEscape: this.windowsPathsNoEscape,\n      debug: !!this.opts.debug,\n    }\n\n    const mms = this.pattern.map(p => new Minimatch(p, mmo))\n    const [matchSet, globParts] = mms.reduce(\n      (set: [MatchSet, GlobParts], m) => {\n        set[0].push(...m.set)\n        set[1].push(...m.globParts)\n        return set\n      },\n      [[], []],\n    )\n    this.patterns = matchSet.map((set, i) => {\n      const g = globParts[i]\n      /* c8 ignore start */\n      if (!g) throw new Error('invalid pattern object')\n      /* c8 ignore stop */\n      return new Pattern(set, g, 0, this.platform)\n    })\n  }\n\n  /**\n   * Returns a Promise that resolves to the results array.\n   */\n  async walk(): Promise<Results<Opts>>\n  async walk(): Promise<(string | Path)[]> {\n    // Walkers always return array of Path objects, so we just have to\n    // coerce them into the right shape.  It will have already called\n    // realpath() if the option was set to do so, so we know that's cached.\n    // start out knowing the cwd, at least\n    return [\n      ...(await new GlobWalker(this.patterns, this.scurry.cwd, {\n        ...this.opts,\n        maxDepth:\n          this.maxDepth !== Infinity ?\n            this.maxDepth + this.scurry.cwd.depth()\n          : Infinity,\n        platform: this.platform,\n        nocase: this.nocase,\n        includeChildMatches: this.includeChildMatches,\n      }).walk()),\n    ]\n  }\n\n  /**\n   * synchronous {@link Glob.walk}\n   */\n  walkSync(): Results<Opts>\n  walkSync(): (string | Path)[] {\n    return [\n      ...new GlobWalker(this.patterns, this.scurry.cwd, {\n        ...this.opts,\n        maxDepth:\n          this.maxDepth !== Infinity ?\n            this.maxDepth + this.scurry.cwd.depth()\n          : Infinity,\n        platform: this.platform,\n        nocase: this.nocase,\n        includeChildMatches: this.includeChildMatches,\n      }).walkSync(),\n    ]\n  }\n\n  /**\n   * Stream results asynchronously.\n   */\n  stream(): Minipass<Result<Opts>, Result<Opts>>\n  stream(): Minipass<string | Path, string | Path> {\n    return new GlobStream(this.patterns, this.scurry.cwd, {\n      ...this.opts,\n      maxDepth:\n        this.maxDepth !== Infinity ?\n          this.maxDepth + this.scurry.cwd.depth()\n        : Infinity,\n      platform: this.platform,\n      nocase: this.nocase,\n      includeChildMatches: this.includeChildMatches,\n    }).stream()\n  }\n\n  /**\n   * Stream results synchronously.\n   */\n  streamSync(): Minipass<Result<Opts>, Result<Opts>>\n  streamSync(): Minipass<string | Path, string | Path> {\n    return new GlobStream(this.patterns, this.scurry.cwd, {\n      ...this.opts,\n      maxDepth:\n        this.maxDepth !== Infinity ?\n          this.maxDepth + this.scurry.cwd.depth()\n        : Infinity,\n      platform: this.platform,\n      nocase: this.nocase,\n      includeChildMatches: this.includeChildMatches,\n    }).streamSync()\n  }\n\n  /**\n   * Default sync iteration function. Returns a Generator that\n   * iterates over the results.\n   */\n  iterateSync(): Generator<Result<Opts>, void, void> {\n    return this.streamSync()[Symbol.iterator]()\n  }\n  [Symbol.iterator]() {\n    return this.iterateSync()\n  }\n\n  /**\n   * Default async iteration function. Returns an AsyncGenerator that\n   * iterates over the results.\n   */\n  iterate(): AsyncGenerator<Result<Opts>, void, void> {\n    return this.stream()[Symbol.asyncIterator]()\n  }\n  [Symbol.asyncIterator]() {\n    return this.iterate()\n  }\n}\n", "/**\n * @module LRUCache\n */\n\n// module-private names and types\n// this provides the default Perf object source.\n// it can be passed in via configuration to override it\n// for a single LRU object.\nexport type Perf = { now: () => number }\nconst defaultPerf: Perf =\n  (\n    typeof performance === 'object' &&\n    performance &&\n    typeof performance.now === 'function'\n  ) ?\n    performance\n  : Date\n\nconst warned = new Set<string>()\n\n// either a function or a class\ntype ForC = ((...a: any[]) => any) | { new (...a: any[]): any }\n\n/* c8 ignore start */\nconst PROCESS = (\n  typeof process === 'object' && !!process ?\n    process\n  : {}) as { [k: string]: any }\n/* c8 ignore start */\n\nconst emitWarning = (\n  msg: string,\n  type: string,\n  code: string,\n  fn: ForC,\n) => {\n  typeof PROCESS.emitWarning === 'function' ?\n    PROCESS.emitWarning(msg, type, code, fn)\n  : console.error(`[${code}] ${type}: ${msg}`)\n}\n\nlet AC = globalThis.AbortController\nlet AS = globalThis.AbortSignal\n\n/* c8 ignore start */\nif (typeof AC === 'undefined') {\n  //@ts-ignore\n  AS = class AbortSignal {\n    onabort?: (...a: any[]) => any\n    _onabort: ((...a: any[]) => any)[] = []\n    reason?: any\n    aborted: boolean = false\n    addEventListener(_: string, fn: (...a: any[]) => any) {\n      this._onabort.push(fn)\n    }\n  }\n  //@ts-ignore\n  AC = class AbortController {\n    constructor() {\n      warnACPolyfill()\n    }\n    signal = new AS()\n    abort(reason: any) {\n      if (this.signal.aborted) return\n      //@ts-ignore\n      this.signal.reason = reason\n      //@ts-ignore\n      this.signal.aborted = true\n      //@ts-ignore\n      for (const fn of this.signal._onabort) {\n        fn(reason)\n      }\n      this.signal.onabort?.(reason)\n    }\n  }\n  let printACPolyfillWarning =\n    PROCESS.env?.LRU_CACHE_IGNORE_AC_WARNING !== '1'\n  const warnACPolyfill = () => {\n    if (!printACPolyfillWarning) return\n    printACPolyfillWarning = false\n    emitWarning(\n      'AbortController is not defined. If using lru-cache in ' +\n        'node 14, load an AbortController polyfill from the ' +\n        '`node-abort-controller` package. A minimal polyfill is ' +\n        'provided for use by LRUCache.fetch(), but it should not be ' +\n        'relied upon in other contexts (eg, passing it to other APIs that ' +\n        'use AbortController/AbortSignal might have undesirable effects). ' +\n        'You may disable this with LRU_CACHE_IGNORE_AC_WARNING=1 in the env.',\n      'NO_ABORT_CONTROLLER',\n      'ENOTSUP',\n      warnACPolyfill,\n    )\n  }\n}\n/* c8 ignore stop */\n\nconst shouldWarn = (code: string) => !warned.has(code)\n\nconst TYPE = Symbol('type')\nexport type PosInt = number & { [TYPE]: 'Positive Integer' }\nexport type Index = number & { [TYPE]: 'LRUCache Index' }\n\nconst isPosInt = (n: any): n is PosInt =>\n  n && n === Math.floor(n) && n > 0 && isFinite(n)\n\nexport type UintArray = Uint8Array | Uint16Array | Uint32Array\nexport type NumberArray = UintArray | number[]\n\n/* c8 ignore start */\n// This is a little bit ridiculous, tbh.\n// The maximum array length is 2^32-1 or thereabouts on most JS impls.\n// And well before that point, you're caching the entire world, I mean,\n// that's ~32GB of just integers for the next/prev links, plus whatever\n// else to hold that many keys and values.  Just filling the memory with\n// zeroes at init time is brutal when you get that big.\n// But why not be complete?\n// Maybe in the future, these limits will have expanded.\nconst getUintArray = (max: number) =>\n  !isPosInt(max) ? null\n  : max <= Math.pow(2, 8) ? Uint8Array\n  : max <= Math.pow(2, 16) ? Uint16Array\n  : max <= Math.pow(2, 32) ? Uint32Array\n  : max <= Number.MAX_SAFE_INTEGER ? ZeroArray\n  : null\n/* c8 ignore stop */\n\nclass ZeroArray extends Array<number> {\n  constructor(size: number) {\n    super(size)\n    this.fill(0)\n  }\n}\nexport type { ZeroArray }\nexport type { Stack }\n\nexport type StackLike = Stack | Index[]\nclass Stack {\n  heap: NumberArray\n  length: number\n  // private constructor\n  static #constructing: boolean = false\n  static create(max: number): StackLike {\n    const HeapCls = getUintArray(max)\n    if (!HeapCls) return []\n    Stack.#constructing = true\n    const s = new Stack(max, HeapCls)\n    Stack.#constructing = false\n    return s\n  }\n  constructor(max: number, HeapCls: { new (n: number): NumberArray }) {\n    /* c8 ignore start */\n    if (!Stack.#constructing) {\n      throw new TypeError('instantiate Stack using Stack.create(n)')\n    }\n    /* c8 ignore stop */\n    this.heap = new HeapCls(max)\n    this.length = 0\n  }\n  push(n: Index) {\n    this.heap[this.length++] = n\n  }\n  pop(): Index {\n    return this.heap[--this.length] as Index\n  }\n}\n\n/**\n * Promise representing an in-progress {@link LRUCache#fetch} call\n */\nexport type BackgroundFetch<V> = Promise<V | undefined> & {\n  __returned: BackgroundFetch<V> | undefined\n  __abortController: AbortController\n  __staleWhileFetching: V | undefined\n}\n\nexport type DisposeTask<K, V> = [\n  value: V,\n  key: K,\n  reason: LRUCache.DisposeReason,\n]\n\nexport namespace LRUCache {\n  /**\n   * An integer greater than 0, reflecting the calculated size of items\n   */\n  export type Size = number\n\n  /**\n   * Integer greater than 0, representing some number of milliseconds, or the\n   * time at which a TTL started counting from.\n   */\n  export type Milliseconds = number\n\n  /**\n   * An integer greater than 0, reflecting a number of items\n   */\n  export type Count = number\n\n  /**\n   * The reason why an item was removed from the cache, passed\n   * to the {@link Disposer} methods.\n   *\n   * - `evict`: The item was evicted because it is the least recently used,\n   *   and the cache is full.\n   * - `set`: A new value was set, overwriting the old value being disposed.\n   * - `delete`: The item was explicitly deleted, either by calling\n   *   {@link LRUCache#delete}, {@link LRUCache#clear}, or\n   *   {@link LRUCache#set} with an undefined value.\n   * - `expire`: The item was removed due to exceeding its TTL.\n   * - `fetch`: A {@link OptionsBase#fetchMethod} operation returned\n   *   `undefined` or was aborted, causing the item to be deleted.\n   */\n  export type DisposeReason =\n    | 'evict'\n    | 'set'\n    | 'delete'\n    | 'expire'\n    | 'fetch'\n  /**\n   * A method called upon item removal, passed as the\n   * {@link OptionsBase.dispose} and/or\n   * {@link OptionsBase.disposeAfter} options.\n   */\n  export type Disposer<K, V> = (\n    value: V,\n    key: K,\n    reason: DisposeReason,\n  ) => void\n\n  /**\n   * The reason why an item was added to the cache, passed\n   * to the {@link Inserter} methods.\n   *\n   * - `add`: the item was not found in the cache, and was added\n   * - `update`: the item was in the cache, with the same value provided\n   * - `replace`: the item was in the cache, and replaced\n   */\n  export type InsertReason = 'add' | 'update' | 'replace'\n\n  /**\n   * A method called upon item insertion, passed as the\n   * {@link OptionsBase.insert}\n   */\n  export type Inserter<K, V> = (\n    value: V,\n    key: K,\n    reason: InsertReason,\n  ) => void\n\n  /**\n   * A function that returns the effective calculated size\n   * of an entry in the cache.\n   */\n  export type SizeCalculator<K, V> = (value: V, key: K) => Size\n\n  /**\n   * Options provided to the\n   * {@link OptionsBase.fetchMethod} function.\n   */\n  export interface FetcherOptions<K, V, FC = unknown> {\n    signal: AbortSignal\n    options: FetcherFetchOptions<K, V, FC>\n    /**\n     * Object provided in the {@link FetchOptions.context} option to\n     * {@link LRUCache#fetch}\n     */\n    context: FC\n  }\n\n  /**\n   * Occasionally, it may be useful to track the internal behavior of the\n   * cache, particularly for logging, debugging, or for behavior within the\n   * `fetchMethod`. To do this, you can pass a `status` object to the\n   * {@link LRUCache#fetch}, {@link LRUCache#get}, {@link LRUCache#set},\n   * {@link LRUCache#memo}, and {@link LRUCache#has} methods.\n   *\n   * The `status` option should be a plain JavaScript object. The following\n   * fields will be set on it appropriately, depending on the situation.\n   */\n  export interface Status<V> {\n    /**\n     * The status of a set() operation.\n     *\n     * - add: the item was not found in the cache, and was added\n     * - update: the item was in the cache, with the same value provided\n     * - replace: the item was in the cache, and replaced\n     * - miss: the item was not added to the cache for some reason\n     */\n    set?: 'add' | 'update' | 'replace' | 'miss'\n\n    /**\n     * the ttl stored for the item, or undefined if ttls are not used.\n     */\n    ttl?: Milliseconds\n\n    /**\n     * the start time for the item, or undefined if ttls are not used.\n     */\n    start?: Milliseconds\n\n    /**\n     * The timestamp used for TTL calculation\n     */\n    now?: Milliseconds\n\n    /**\n     * the remaining ttl for the item, or undefined if ttls are not used.\n     */\n    remainingTTL?: Milliseconds\n\n    /**\n     * The calculated size for the item, if sizes are used.\n     */\n    entrySize?: Size\n\n    /**\n     * The total calculated size of the cache, if sizes are used.\n     */\n    totalCalculatedSize?: Size\n\n    /**\n     * A flag indicating that the item was not stored, due to exceeding the\n     * {@link OptionsBase.maxEntrySize}\n     */\n    maxEntrySizeExceeded?: true\n\n    /**\n     * The old value, specified in the case of `set:'update'` or\n     * `set:'replace'`\n     */\n    oldValue?: V\n\n    /**\n     * The results of a {@link LRUCache#has} operation\n     *\n     * - hit: the item was found in the cache\n     * - stale: the item was found in the cache, but is stale\n     * - miss: the item was not found in the cache\n     */\n    has?: 'hit' | 'stale' | 'miss'\n\n    /**\n     * The status of a {@link LRUCache#fetch} operation.\n     * Note that this can change as the underlying fetch() moves through\n     * various states.\n     *\n     * - inflight: there is another fetch() for this key which is in process\n     * - get: there is no {@link OptionsBase.fetchMethod}, so\n     *   {@link LRUCache#get} was called.\n     * - miss: the item is not in cache, and will be fetched.\n     * - hit: the item is in the cache, and was resolved immediately.\n     * - stale: the item is in the cache, but stale.\n     * - refresh: the item is in the cache, and not stale, but\n     *   {@link FetchOptions.forceRefresh} was specified.\n     */\n    fetch?: 'get' | 'inflight' | 'miss' | 'hit' | 'stale' | 'refresh'\n\n    /**\n     * The {@link OptionsBase.fetchMethod} was called\n     */\n    fetchDispatched?: true\n\n    /**\n     * The cached value was updated after a successful call to\n     * {@link OptionsBase.fetchMethod}\n     */\n    fetchUpdated?: true\n\n    /**\n     * The reason for a fetch() rejection.  Either the error raised by the\n     * {@link OptionsBase.fetchMethod}, or the reason for an\n     * AbortSignal.\n     */\n    fetchError?: Error\n\n    /**\n     * The fetch received an abort signal\n     */\n    fetchAborted?: true\n\n    /**\n     * The abort signal received was ignored, and the fetch was allowed to\n     * continue.\n     */\n    fetchAbortIgnored?: true\n\n    /**\n     * The fetchMethod promise resolved successfully\n     */\n    fetchResolved?: true\n\n    /**\n     * The fetchMethod promise was rejected\n     */\n    fetchRejected?: true\n\n    /**\n     * The status of a {@link LRUCache#get} operation.\n     *\n     * - fetching: The item is currently being fetched.  If a previous value\n     *   is present and allowed, that will be returned.\n     * - stale: The item is in the cache, and is stale.\n     * - hit: the item is in the cache\n     * - miss: the item is not in the cache\n     */\n    get?: 'stale' | 'hit' | 'miss'\n\n    /**\n     * A fetch or get operation returned a stale value.\n     */\n    returnedStale?: true\n  }\n\n  /**\n   * options which override the options set in the LRUCache constructor\n   * when calling {@link LRUCache#fetch}.\n   *\n   * This is the union of {@link GetOptions} and {@link SetOptions}, plus\n   * {@link OptionsBase.noDeleteOnFetchRejection},\n   * {@link OptionsBase.allowStaleOnFetchRejection},\n   * {@link FetchOptions.forceRefresh}, and\n   * {@link FetcherOptions.context}\n   *\n   * Any of these may be modified in the {@link OptionsBase.fetchMethod}\n   * function, but the {@link GetOptions} fields will of course have no\n   * effect, as the {@link LRUCache#get} call already happened by the time\n   * the fetchMethod is called.\n   */\n  export interface FetcherFetchOptions<K, V, FC = unknown>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      | 'allowStale'\n      | 'updateAgeOnGet'\n      | 'noDeleteOnStaleGet'\n      | 'sizeCalculation'\n      | 'ttl'\n      | 'noDisposeOnSet'\n      | 'noUpdateTTL'\n      | 'noDeleteOnFetchRejection'\n      | 'allowStaleOnFetchRejection'\n      | 'ignoreFetchAbort'\n      | 'allowStaleOnFetchAbort'\n    > {\n    status?: Status<V>\n    size?: Size\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#fetch} method.\n   */\n  export interface FetchOptions<K, V, FC>\n    extends FetcherFetchOptions<K, V, FC> {\n    /**\n     * Set to true to force a re-load of the existing data, even if it\n     * is not yet stale.\n     */\n    forceRefresh?: boolean\n    /**\n     * Context provided to the {@link OptionsBase.fetchMethod} as\n     * the {@link FetcherOptions.context} param.\n     *\n     * If the FC type is specified as unknown (the default),\n     * undefined or void, then this is optional.  Otherwise, it will\n     * be required.\n     */\n    context?: FC\n    signal?: AbortSignal\n    status?: Status<V>\n  }\n  /**\n   * Options provided to {@link LRUCache#fetch} when the FC type is something\n   * other than `unknown`, `undefined`, or `void`\n   */\n  export interface FetchOptionsWithContext<K, V, FC>\n    extends FetchOptions<K, V, FC> {\n    context: FC\n  }\n  /**\n   * Options provided to {@link LRUCache#fetch} when the FC type is\n   * `undefined` or `void`\n   */\n  export interface FetchOptionsNoContext<K, V>\n    extends FetchOptions<K, V, undefined> {\n    context?: undefined\n  }\n\n  export interface MemoOptions<K, V, FC = unknown>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      | 'allowStale'\n      | 'updateAgeOnGet'\n      | 'noDeleteOnStaleGet'\n      | 'sizeCalculation'\n      | 'ttl'\n      | 'noDisposeOnSet'\n      | 'noUpdateTTL'\n      | 'noDeleteOnFetchRejection'\n      | 'allowStaleOnFetchRejection'\n      | 'ignoreFetchAbort'\n      | 'allowStaleOnFetchAbort'\n    > {\n    /**\n     * Set to true to force a re-load of the existing data, even if it\n     * is not yet stale.\n     */\n    forceRefresh?: boolean\n    /**\n     * Context provided to the {@link OptionsBase.memoMethod} as\n     * the {@link MemoizerOptions.context} param.\n     *\n     * If the FC type is specified as unknown (the default),\n     * undefined or void, then this is optional.  Otherwise, it will\n     * be required.\n     */\n    context?: FC\n    status?: Status<V>\n  }\n  /**\n   * Options provided to {@link LRUCache#memo} when the FC type is something\n   * other than `unknown`, `undefined`, or `void`\n   */\n  export interface MemoOptionsWithContext<K, V, FC>\n    extends MemoOptions<K, V, FC> {\n    context: FC\n  }\n  /**\n   * Options provided to {@link LRUCache#memo} when the FC type is\n   * `undefined` or `void`\n   */\n  export interface MemoOptionsNoContext<K, V>\n    extends MemoOptions<K, V, undefined> {\n    context?: undefined\n  }\n\n  /**\n   * Options provided to the\n   * {@link OptionsBase.memoMethod} function.\n   */\n  export interface MemoizerOptions<K, V, FC = unknown> {\n    options: MemoizerMemoOptions<K, V, FC>\n    /**\n     * Object provided in the {@link MemoOptions.context} option to\n     * {@link LRUCache#memo}\n     */\n    context: FC\n  }\n\n  /**\n   * options which override the options set in the LRUCache constructor\n   * when calling {@link LRUCache#memo}.\n   *\n   * This is the union of {@link GetOptions} and {@link SetOptions}, plus\n   * {@link MemoOptions.forceRefresh}, and\n   * {@link MemoOptions.context}\n   *\n   * Any of these may be modified in the {@link OptionsBase.memoMethod}\n   * function, but the {@link GetOptions} fields will of course have no\n   * effect, as the {@link LRUCache#get} call already happened by the time\n   * the memoMethod is called.\n   */\n  export interface MemoizerMemoOptions<K, V, FC = unknown>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      | 'allowStale'\n      | 'updateAgeOnGet'\n      | 'noDeleteOnStaleGet'\n      | 'sizeCalculation'\n      | 'ttl'\n      | 'noDisposeOnSet'\n      | 'noUpdateTTL'\n    > {\n    status?: Status<V>\n    size?: Size\n    start?: Milliseconds\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#has} method.\n   */\n  export interface HasOptions<K, V, FC>\n    extends Pick<OptionsBase<K, V, FC>, 'updateAgeOnHas'> {\n    status?: Status<V>\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#get} method.\n   */\n  export interface GetOptions<K, V, FC>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      'allowStale' | 'updateAgeOnGet' | 'noDeleteOnStaleGet'\n    > {\n    status?: Status<V>\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#peek} method.\n   */\n  export interface PeekOptions<K, V, FC>\n    extends Pick<OptionsBase<K, V, FC>, 'allowStale'> {}\n\n  /**\n   * Options that may be passed to the {@link LRUCache#set} method.\n   */\n  export interface SetOptions<K, V, FC>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      'sizeCalculation' | 'ttl' | 'noDisposeOnSet' | 'noUpdateTTL'\n    > {\n    /**\n     * If size tracking is enabled, then setting an explicit size\n     * in the {@link LRUCache#set} call will prevent calling the\n     * {@link OptionsBase.sizeCalculation} function.\n     */\n    size?: Size\n    /**\n     * If TTL tracking is enabled, then setting an explicit start\n     * time in the {@link LRUCache#set} call will override the\n     * default time from `performance.now()` or `Date.now()`.\n     *\n     * Note that it must be a valid value for whichever time-tracking\n     * method is in use.\n     */\n    start?: Milliseconds\n    status?: Status<V>\n  }\n\n  /**\n   * The type signature for the {@link OptionsBase.fetchMethod} option.\n   */\n  export type Fetcher<K, V, FC = unknown> = (\n    key: K,\n    staleValue: V | undefined,\n    options: FetcherOptions<K, V, FC>,\n  ) => Promise<V | undefined | void> | V | undefined | void\n\n  /**\n   * the type signature for the {@link OptionsBase.memoMethod} option.\n   */\n  export type Memoizer<K, V, FC = unknown> = (\n    key: K,\n    staleValue: V | undefined,\n    options: MemoizerOptions<K, V, FC>,\n  ) => V\n\n  /**\n   * Options which may be passed to the {@link LRUCache} constructor.\n   *\n   * Most of these may be overridden in the various options that use\n   * them.\n   *\n   * Despite all being technically optional, the constructor requires that\n   * a cache is at minimum limited by one or more of {@link OptionsBase.max},\n   * {@link OptionsBase.ttl}, or {@link OptionsBase.maxSize}.\n   *\n   * If {@link OptionsBase.ttl} is used alone, then it is strongly advised\n   * (and in fact required by the type definitions here) that the cache\n   * also set {@link OptionsBase.ttlAutopurge}, to prevent potentially\n   * unbounded storage.\n   *\n   * All options are also available on the {@link LRUCache} instance, making\n   * it safe to pass an LRUCache instance as the options argumemnt to\n   * make another empty cache of the same type.\n   *\n   * Some options are marked as read-only, because changing them after\n   * instantiation is not safe. Changing any of the other options will of\n   * course only have an effect on subsequent method calls.\n   */\n  export interface OptionsBase<K, V, FC> {\n    /**\n     * The maximum number of items to store in the cache before evicting\n     * old entries. This is read-only on the {@link LRUCache} instance,\n     * and may not be overridden.\n     *\n     * If set, then storage space will be pre-allocated at construction\n     * time, and the cache will perform significantly faster.\n     *\n     * Note that significantly fewer items may be stored, if\n     * {@link OptionsBase.maxSize} and/or {@link OptionsBase.ttl} are also\n     * set.\n     *\n     * **It is strongly recommended to set a `max` to prevent unbounded growth\n     * of the cache.**\n     */\n    max?: Count\n\n    /**\n     * Max time in milliseconds for items to live in cache before they are\n     * considered stale.  Note that stale items are NOT preemptively removed by\n     * default, and MAY live in the cache, contributing to its LRU max, long\n     * after they have expired, unless {@link OptionsBase.ttlAutopurge} is\n     * set.\n     *\n     * If set to `0` (the default value), then that means \"do not track\n     * TTL\", not \"expire immediately\".\n     *\n     * Also, as this cache is optimized for LRU/MRU operations, some of\n     * the staleness/TTL checks will reduce performance, as they will incur\n     * overhead by deleting items.\n     *\n     * This is not primarily a TTL cache, and does not make strong TTL\n     * guarantees. There is no pre-emptive pruning of expired items, but you\n     * _may_ set a TTL on the cache, and it will treat expired items as missing\n     * when they are fetched, and delete them.\n     *\n     * Optional, but must be a non-negative integer in ms if specified.\n     *\n     * This may be overridden by passing an options object to `cache.set()`.\n     *\n     * At least one of `max`, `maxSize`, or `TTL` is required. This must be a\n     * positive integer if set.\n     *\n     * Even if ttl tracking is enabled, **it is strongly recommended to set a\n     * `max` to prevent unbounded growth of the cache.**\n     *\n     * If ttl tracking is enabled, and `max` and `maxSize` are not set,\n     * and `ttlAutopurge` is not set, then a warning will be emitted\n     * cautioning about the potential for unbounded memory consumption.\n     * (The TypeScript definitions will also discourage this.)\n     */\n    ttl?: Milliseconds\n\n    /**\n     * Minimum amount of time in ms in which to check for staleness.\n     * Defaults to 1, which means that the current time is checked\n     * at most once per millisecond.\n     *\n     * Set to 0 to check the current time every time staleness is tested.\n     * (This reduces performance, and is theoretically unnecessary.)\n     *\n     * Setting this to a higher value will improve performance somewhat\n     * while using ttl tracking, albeit at the expense of keeping stale\n     * items around a bit longer than their TTLs would indicate.\n     *\n     * @default 1\n     */\n    ttlResolution?: Milliseconds\n\n    /**\n     * Preemptively remove stale items from the cache.\n     *\n     * Note that this may *significantly* degrade performance, especially if\n     * the cache is storing a large number of items. It is almost always best\n     * to just leave the stale items in the cache, and let them fall out as new\n     * items are added.\n     *\n     * Note that this means that {@link OptionsBase.allowStale} is a bit\n     * pointless, as stale items will be deleted almost as soon as they\n     * expire.\n     *\n     * Use with caution!\n     */\n    ttlAutopurge?: boolean\n\n    /**\n     * When using time-expiring entries with `ttl`, setting this to `true` will\n     * make each item's age reset to 0 whenever it is retrieved from cache with\n     * {@link LRUCache#get}, causing it to not expire. (It can still fall out\n     * of cache based on recency of use, of course.)\n     *\n     * Has no effect if {@link OptionsBase.ttl} is not set.\n     *\n     * This may be overridden by passing an options object to `cache.get()`.\n     */\n    updateAgeOnGet?: boolean\n\n    /**\n     * When using time-expiring entries with `ttl`, setting this to `true` will\n     * make each item's age reset to 0 whenever its presence in the cache is\n     * checked with {@link LRUCache#has}, causing it to not expire. (It can\n     * still fall out of cache based on recency of use, of course.)\n     *\n     * Has no effect if {@link OptionsBase.ttl} is not set.\n     */\n    updateAgeOnHas?: boolean\n\n    /**\n     * Allow {@link LRUCache#get} and {@link LRUCache#fetch} calls to return\n     * stale data, if available.\n     *\n     * By default, if you set `ttl`, stale items will only be deleted from the\n     * cache when you `get(key)`. That is, it's not preemptively pruning items,\n     * unless {@link OptionsBase.ttlAutopurge} is set.\n     *\n     * If you set `allowStale:true`, it'll return the stale value *as well as*\n     * deleting it. If you don't set this, then it'll return `undefined` when\n     * you try to get a stale entry.\n     *\n     * Note that when a stale entry is fetched, _even if it is returned due to\n     * `allowStale` being set_, it is removed from the cache immediately. You\n     * can suppress this behavior by setting\n     * {@link OptionsBase.noDeleteOnStaleGet}, either in the constructor, or in\n     * the options provided to {@link LRUCache#get}.\n     *\n     * This may be overridden by passing an options object to `cache.get()`.\n     * The `cache.has()` method will always return `false` for stale items.\n     *\n     * Only relevant if a ttl is set.\n     */\n    allowStale?: boolean\n\n    /**\n     * Function that is called on items when they are dropped from the\n     * cache, as `dispose(value, key, reason)`.\n     *\n     * This can be handy if you want to close file descriptors or do\n     * other cleanup tasks when items are no longer stored in the cache.\n     *\n     * **NOTE**: It is called _before_ the item has been fully removed\n     * from the cache, so if you want to put it right back in, you need\n     * to wait until the next tick. If you try to add it back in during\n     * the `dispose()` function call, it will break things in subtle and\n     * weird ways.\n     *\n     * Unlike several other options, this may _not_ be overridden by\n     * passing an option to `set()`, for performance reasons.\n     *\n     * The `reason` will be one of the following strings, corresponding\n     * to the reason for the item's deletion:\n     *\n     * - `evict` Item was evicted to make space for a new addition\n     * - `set` Item was overwritten by a new value\n     * - `expire` Item expired its TTL\n     * - `fetch` Item was deleted due to a failed or aborted fetch, or a\n     *   fetchMethod returning `undefined.\n     * - `delete` Item was removed by explicit `cache.delete(key)`,\n     *   `cache.clear()`, or `cache.set(key, undefined)`.\n     */\n    dispose?: Disposer<K, V>\n\n    /**\n     * Function that is called when new items are inserted into the cache,\n     * as `onInsert(value, key, reason)`.\n     *\n     * This can be useful if you need to perform actions when an item is\n     * added, such as logging or tracking insertions.\n     *\n     * Unlike some other options, this may _not_ be overridden by passing\n     * an option to `set()`, for performance and consistency reasons.\n     */\n    onInsert?: Inserter<K, V>\n\n    /**\n     * The same as {@link OptionsBase.dispose}, but called *after* the entry\n     * is completely removed and the cache is once again in a clean state.\n     *\n     * It is safe to add an item right back into the cache at this point.\n     * However, note that it is *very* easy to inadvertently create infinite\n     * recursion this way.\n     */\n    disposeAfter?: Disposer<K, V>\n\n    /**\n     * Set to true to suppress calling the\n     * {@link OptionsBase.dispose} function if the entry key is\n     * still accessible within the cache.\n     *\n     * This may be overridden by passing an options object to\n     * {@link LRUCache#set}.\n     *\n     * Only relevant if `dispose` or `disposeAfter` are set.\n     */\n    noDisposeOnSet?: boolean\n\n    /**\n     * Boolean flag to tell the cache to not update the TTL when setting a new\n     * value for an existing key (ie, when updating a value rather than\n     * inserting a new value).  Note that the TTL value is _always_ set (if\n     * provided) when adding a new entry into the cache.\n     *\n     * Has no effect if a {@link OptionsBase.ttl} is not set.\n     *\n     * May be passed as an option to {@link LRUCache#set}.\n     */\n    noUpdateTTL?: boolean\n\n    /**\n     * Set to a positive integer to track the sizes of items added to the\n     * cache, and automatically evict items in order to stay below this size.\n     * Note that this may result in fewer than `max` items being stored.\n     *\n     * Attempting to add an item to the cache whose calculated size is greater\n     * that this amount will be a no-op. The item will not be cached, and no\n     * other items will be evicted.\n     *\n     * Optional, must be a positive integer if provided.\n     *\n     * Sets `maxEntrySize` to the same value, unless a different value is\n     * provided for `maxEntrySize`.\n     *\n     * At least one of `max`, `maxSize`, or `TTL` is required. This must be a\n     * positive integer if set.\n     *\n     * Even if size tracking is enabled, **it is strongly recommended to set a\n     * `max` to prevent unbounded growth of the cache.**\n     *\n     * Note also that size tracking can negatively impact performance,\n     * though for most cases, only minimally.\n     */\n    maxSize?: Size\n\n    /**\n     * The maximum allowed size for any single item in the cache.\n     *\n     * If a larger item is passed to {@link LRUCache#set} or returned by a\n     * {@link OptionsBase.fetchMethod} or {@link OptionsBase.memoMethod}, then\n     * it will not be stored in the cache.\n     *\n     * Attempting to add an item whose calculated size is greater than\n     * this amount will not cache the item or evict any old items, but\n     * WILL delete an existing value if one is already present.\n     *\n     * Optional, must be a positive integer if provided. Defaults to\n     * the value of `maxSize` if provided.\n     */\n    maxEntrySize?: Size\n\n    /**\n     * A function that returns a number indicating the item's size.\n     *\n     * Requires {@link OptionsBase.maxSize} to be set.\n     *\n     * If not provided, and {@link OptionsBase.maxSize} or\n     * {@link OptionsBase.maxEntrySize} are set, then all\n     * {@link LRUCache#set} calls **must** provide an explicit\n     * {@link SetOptions.size} or sizeCalculation param.\n     */\n    sizeCalculation?: SizeCalculator<K, V>\n\n    /**\n     * Method that provides the implementation for {@link LRUCache#fetch}\n     *\n     * ```ts\n     * fetchMethod(key, staleValue, { signal, options, context })\n     * ```\n     *\n     * If `fetchMethod` is not provided, then `cache.fetch(key)` is equivalent\n     * to `Promise.resolve(cache.get(key))`.\n     *\n     * If at any time, `signal.aborted` is set to `true`, or if the\n     * `signal.onabort` method is called, or if it emits an `'abort'` event\n     * which you can listen to with `addEventListener`, then that means that\n     * the fetch should be abandoned. This may be passed along to async\n     * functions aware of AbortController/AbortSignal behavior.\n     *\n     * The `fetchMethod` should **only** return `undefined` or a Promise\n     * resolving to `undefined` if the AbortController signaled an `abort`\n     * event. In all other cases, it should return or resolve to a value\n     * suitable for adding to the cache.\n     *\n     * The `options` object is a union of the options that may be provided to\n     * `set()` and `get()`. If they are modified, then that will result in\n     * modifying the settings to `cache.set()` when the value is resolved, and\n     * in the case of\n     * {@link OptionsBase.noDeleteOnFetchRejection} and\n     * {@link OptionsBase.allowStaleOnFetchRejection}, the handling of\n     * `fetchMethod` failures.\n     *\n     * For example, a DNS cache may update the TTL based on the value returned\n     * from a remote DNS server by changing `options.ttl` in the `fetchMethod`.\n     */\n    fetchMethod?: Fetcher<K, V, FC>\n\n    /**\n     * Method that provides the implementation for {@link LRUCache#memo}\n     */\n    memoMethod?: Memoizer<K, V, FC>\n\n    /**\n     * Set to true to suppress the deletion of stale data when a\n     * {@link OptionsBase.fetchMethod} returns a rejected promise.\n     */\n    noDeleteOnFetchRejection?: boolean\n\n    /**\n     * Do not delete stale items when they are retrieved with\n     * {@link LRUCache#get}.\n     *\n     * Note that the `get` return value will still be `undefined`\n     * unless {@link OptionsBase.allowStale} is true.\n     *\n     * When using time-expiring entries with `ttl`, by default stale\n     * items will be removed from the cache when the key is accessed\n     * with `cache.get()`.\n     *\n     * Setting this option will cause stale items to remain in the cache, until\n     * they are explicitly deleted with `cache.delete(key)`, or retrieved with\n     * `noDeleteOnStaleGet` set to `false`.\n     *\n     * This may be overridden by passing an options object to `cache.get()`.\n     *\n     * Only relevant if a ttl is used.\n     */\n    noDeleteOnStaleGet?: boolean\n\n    /**\n     * Set to true to allow returning stale data when a\n     * {@link OptionsBase.fetchMethod} throws an error or returns a rejected\n     * promise.\n     *\n     * This differs from using {@link OptionsBase.allowStale} in that stale\n     * data will ONLY be returned in the case that the {@link LRUCache#fetch}\n     * fails, not any other times.\n     *\n     * If a `fetchMethod` fails, and there is no stale value available, the\n     * `fetch()` will resolve to `undefined`. Ie, all `fetchMethod` errors are\n     * suppressed.\n     *\n     * Implies `noDeleteOnFetchRejection`.\n     *\n     * This may be set in calls to `fetch()`, or defaulted on the constructor,\n     * or overridden by modifying the options object in the `fetchMethod`.\n     */\n    allowStaleOnFetchRejection?: boolean\n\n    /**\n     * Set to true to return a stale value from the cache when the\n     * `AbortSignal` passed to the {@link OptionsBase.fetchMethod} dispatches\n     * an `'abort'` event, whether user-triggered, or due to internal cache\n     * behavior.\n     *\n     * Unless {@link OptionsBase.ignoreFetchAbort} is also set, the underlying\n     * {@link OptionsBase.fetchMethod} will still be considered canceled, and\n     * any value it returns will be ignored and not cached.\n     *\n     * Caveat: since fetches are aborted when a new value is explicitly\n     * set in the cache, this can lead to fetch returning a stale value,\n     * since that was the fallback value _at the moment the `fetch()` was\n     * initiated_, even though the new updated value is now present in\n     * the cache.\n     *\n     * For example:\n     *\n     * ```ts\n     * const cache = new LRUCache<string, any>({\n     *   ttl: 100,\n     *   fetchMethod: async (url, oldValue, { signal }) =>  {\n     *     const res = await fetch(url, { signal })\n     *     return await res.json()\n     *   }\n     * })\n     * cache.set('https://example.com/', { some: 'data' })\n     * // 100ms go by...\n     * const result = cache.fetch('https://example.com/')\n     * cache.set('https://example.com/', { other: 'thing' })\n     * console.log(await result) // { some: 'data' }\n     * console.log(cache.get('https://example.com/')) // { other: 'thing' }\n     * ```\n     */\n    allowStaleOnFetchAbort?: boolean\n\n    /**\n     * Set to true to ignore the `abort` event emitted by the `AbortSignal`\n     * object passed to {@link OptionsBase.fetchMethod}, and still cache the\n     * resulting resolution value, as long as it is not `undefined`.\n     *\n     * When used on its own, this means aborted {@link LRUCache#fetch} calls\n     * are not immediately resolved or rejected when they are aborted, and\n     * instead take the full time to await.\n     *\n     * When used with {@link OptionsBase.allowStaleOnFetchAbort}, aborted\n     * {@link LRUCache#fetch} calls will resolve immediately to their stale\n     * cached value or `undefined`, and will continue to process and eventually\n     * update the cache when they resolve, as long as the resulting value is\n     * not `undefined`, thus supporting a \"return stale on timeout while\n     * refreshing\" mechanism by passing `AbortSignal.timeout(n)` as the signal.\n     *\n     * For example:\n     *\n     * ```ts\n     * const c = new LRUCache({\n     *   ttl: 100,\n     *   ignoreFetchAbort: true,\n     *   allowStaleOnFetchAbort: true,\n     *   fetchMethod: async (key, oldValue, { signal }) => {\n     *     // note: do NOT pass the signal to fetch()!\n     *     // let's say this fetch can take a long time.\n     *     const res = await fetch(`https://slow-backend-server/${key}`)\n     *     return await res.json()\n     *   },\n     * })\n     *\n     * // this will return the stale value after 100ms, while still\n     * // updating in the background for next time.\n     * const val = await c.fetch('key', { signal: AbortSignal.timeout(100) })\n     * ```\n     *\n     * **Note**: regardless of this setting, an `abort` event _is still\n     * emitted on the `AbortSignal` object_, so may result in invalid results\n     * when passed to other underlying APIs that use AbortSignals.\n     *\n     * This may be overridden in the {@link OptionsBase.fetchMethod} or the\n     * call to {@link LRUCache#fetch}.\n     */\n    ignoreFetchAbort?: boolean\n\n    /**\n     * In some cases, you may want to swap out the performance/Date object\n     * used for TTL tracking. This should almost certainly NOT be done in\n     * production environments!\n     *\n     * This value defaults to `global.performance` if it has a `now()` method,\n     * or the `global.Date` object otherwise.\n     */\n    perf?: Perf\n  }\n\n  export interface OptionsMaxLimit<K, V, FC>\n    extends OptionsBase<K, V, FC> {\n    max: Count\n  }\n  export interface OptionsTTLLimit<K, V, FC>\n    extends OptionsBase<K, V, FC> {\n    ttl: Milliseconds\n    ttlAutopurge: boolean\n  }\n  export interface OptionsSizeLimit<K, V, FC>\n    extends OptionsBase<K, V, FC> {\n    maxSize: Size\n  }\n\n  /**\n   * The valid safe options for the {@link LRUCache} constructor\n   */\n  export type Options<K, V, FC> =\n    | OptionsMaxLimit<K, V, FC>\n    | OptionsSizeLimit<K, V, FC>\n    | OptionsTTLLimit<K, V, FC>\n\n  /**\n   * Entry objects used by {@link LRUCache#load} and {@link LRUCache#dump},\n   * and returned by {@link LRUCache#info}.\n   */\n  export interface Entry<V> {\n    value: V\n    ttl?: Milliseconds\n    size?: Size\n    start?: Milliseconds\n  }\n}\n\n/**\n * Default export, the thing you're using this module to get.\n *\n * The `K` and `V` types define the key and value types, respectively. The\n * optional `FC` type defines the type of the `context` object passed to\n * `cache.fetch()` and `cache.memo()`.\n *\n * Keys and values **must not** be `null` or `undefined`.\n *\n * All properties from the options object (with the exception of `max`,\n * `maxSize`, `fetchMethod`, `memoMethod`, `dispose` and `disposeAfter`) are\n * added as normal public members. (The listed options are read-only getters.)\n *\n * Changing any of these will alter the defaults for subsequent method calls.\n */\nexport class LRUCache<K extends {}, V extends {}, FC = unknown> {\n  // options that cannot be changed without disaster\n  readonly #max: LRUCache.Count\n  readonly #maxSize: LRUCache.Size\n  readonly #dispose?: LRUCache.Disposer<K, V>\n  readonly #onInsert?: LRUCache.Inserter<K, V>\n  readonly #disposeAfter?: LRUCache.Disposer<K, V>\n  readonly #fetchMethod?: LRUCache.Fetcher<K, V, FC>\n  readonly #memoMethod?: LRUCache.Memoizer<K, V, FC>\n  readonly #perf: Perf\n\n  /**\n   * {@link LRUCache.OptionsBase.perf}\n   */\n  get perf() {\n    return this.#perf\n  }\n\n  /**\n   * {@link LRUCache.OptionsBase.ttl}\n   */\n  ttl: LRUCache.Milliseconds\n\n  /**\n   * {@link LRUCache.OptionsBase.ttlResolution}\n   */\n  ttlResolution: LRUCache.Milliseconds\n  /**\n   * {@link LRUCache.OptionsBase.ttlAutopurge}\n   */\n  ttlAutopurge: boolean\n  /**\n   * {@link LRUCache.OptionsBase.updateAgeOnGet}\n   */\n  updateAgeOnGet: boolean\n  /**\n   * {@link LRUCache.OptionsBase.updateAgeOnHas}\n   */\n  updateAgeOnHas: boolean\n  /**\n   * {@link LRUCache.OptionsBase.allowStale}\n   */\n  allowStale: boolean\n\n  /**\n   * {@link LRUCache.OptionsBase.noDisposeOnSet}\n   */\n  noDisposeOnSet: boolean\n  /**\n   * {@link LRUCache.OptionsBase.noUpdateTTL}\n   */\n  noUpdateTTL: boolean\n  /**\n   * {@link LRUCache.OptionsBase.maxEntrySize}\n   */\n  maxEntrySize: LRUCache.Size\n  /**\n   * {@link LRUCache.OptionsBase.sizeCalculation}\n   */\n  sizeCalculation?: LRUCache.SizeCalculator<K, V>\n  /**\n   * {@link LRUCache.OptionsBase.noDeleteOnFetchRejection}\n   */\n  noDeleteOnFetchRejection: boolean\n  /**\n   * {@link LRUCache.OptionsBase.noDeleteOnStaleGet}\n   */\n  noDeleteOnStaleGet: boolean\n  /**\n   * {@link LRUCache.OptionsBase.allowStaleOnFetchAbort}\n   */\n  allowStaleOnFetchAbort: boolean\n  /**\n   * {@link LRUCache.OptionsBase.allowStaleOnFetchRejection}\n   */\n  allowStaleOnFetchRejection: boolean\n  /**\n   * {@link LRUCache.OptionsBase.ignoreFetchAbort}\n   */\n  ignoreFetchAbort: boolean\n\n  // computed properties\n  #size: LRUCache.Count\n  #calculatedSize: LRUCache.Size\n  #keyMap: Map<K, Index>\n  #keyList: (K | undefined)[]\n  #valList: (V | BackgroundFetch<V> | undefined)[]\n  #next: NumberArray\n  #prev: NumberArray\n  #head: Index\n  #tail: Index\n  #free: StackLike\n  #disposed?: DisposeTask<K, V>[]\n  #sizes?: ZeroArray\n  #starts?: ZeroArray\n  #ttls?: ZeroArray\n  #autopurgeTimers?: (undefined | ReturnType<typeof setTimeout>)[]\n\n  #hasDispose: boolean\n  #hasFetchMethod: boolean\n  #hasDisposeAfter: boolean\n  #hasOnInsert: boolean\n\n  /**\n   * Do not call this method unless you need to inspect the\n   * inner workings of the cache.  If anything returned by this\n   * object is modified in any way, strange breakage may occur.\n   *\n   * These fields are private for a reason!\n   *\n   * @internal\n   */\n  static unsafeExposeInternals<\n    K extends {},\n    V extends {},\n    FC extends unknown = unknown,\n  >(c: LRUCache<K, V, FC>) {\n    return {\n      // properties\n      starts: c.#starts,\n      ttls: c.#ttls,\n      autopurgeTimers: c.#autopurgeTimers,\n      sizes: c.#sizes,\n      keyMap: c.#keyMap as Map<K, number>,\n      keyList: c.#keyList,\n      valList: c.#valList,\n      next: c.#next,\n      prev: c.#prev,\n      get head() {\n        return c.#head\n      },\n      get tail() {\n        return c.#tail\n      },\n      free: c.#free,\n      // methods\n      isBackgroundFetch: (p: any) => c.#isBackgroundFetch(p),\n      backgroundFetch: (\n        k: K,\n        index: number | undefined,\n        options: LRUCache.FetchOptions<K, V, FC>,\n        context: any,\n      ): BackgroundFetch<V> =>\n        c.#backgroundFetch(\n          k,\n          index as Index | undefined,\n          options,\n          context,\n        ),\n      moveToTail: (index: number): void => c.#moveToTail(index as Index),\n      indexes: (options?: { allowStale: boolean }) => c.#indexes(options),\n      rindexes: (options?: { allowStale: boolean }) =>\n        c.#rindexes(options),\n      isStale: (index: number | undefined) => c.#isStale(index as Index),\n    }\n  }\n\n  // Protected read-only members\n\n  /**\n   * {@link LRUCache.OptionsBase.max} (read-only)\n   */\n  get max(): LRUCache.Count {\n    return this.#max\n  }\n  /**\n   * {@link LRUCache.OptionsBase.maxSize} (read-only)\n   */\n  get maxSize(): LRUCache.Count {\n    return this.#maxSize\n  }\n  /**\n   * The total computed size of items in the cache (read-only)\n   */\n  get calculatedSize(): LRUCache.Size {\n    return this.#calculatedSize\n  }\n  /**\n   * The number of items stored in the cache (read-only)\n   */\n  get size(): LRUCache.Count {\n    return this.#size\n  }\n  /**\n   * {@link LRUCache.OptionsBase.fetchMethod} (read-only)\n   */\n  get fetchMethod(): LRUCache.Fetcher<K, V, FC> | undefined {\n    return this.#fetchMethod\n  }\n  get memoMethod(): LRUCache.Memoizer<K, V, FC> | undefined {\n    return this.#memoMethod\n  }\n  /**\n   * {@link LRUCache.OptionsBase.dispose} (read-only)\n   */\n  get dispose() {\n    return this.#dispose\n  }\n  /**\n   * {@link LRUCache.OptionsBase.onInsert} (read-only)\n   */\n  get onInsert() {\n    return this.#onInsert\n  }\n  /**\n   * {@link LRUCache.OptionsBase.disposeAfter} (read-only)\n   */\n  get disposeAfter() {\n    return this.#disposeAfter\n  }\n\n  constructor(options: LRUCache.Options<K, V, FC> | LRUCache<K, V, FC>) {\n    const {\n      max = 0,\n      ttl,\n      ttlResolution = 1,\n      ttlAutopurge,\n      updateAgeOnGet,\n      updateAgeOnHas,\n      allowStale,\n      dispose,\n      onInsert,\n      disposeAfter,\n      noDisposeOnSet,\n      noUpdateTTL,\n      maxSize = 0,\n      maxEntrySize = 0,\n      sizeCalculation,\n      fetchMethod,\n      memoMethod,\n      noDeleteOnFetchRejection,\n      noDeleteOnStaleGet,\n      allowStaleOnFetchRejection,\n      allowStaleOnFetchAbort,\n      ignoreFetchAbort,\n      perf,\n    } = options\n\n    if (perf !== undefined) {\n      if (typeof perf?.now !== 'function') {\n        throw new TypeError(\n          'perf option must have a now() method if specified',\n        )\n      }\n    }\n\n    this.#perf = perf ?? defaultPerf\n\n    if (max !== 0 && !isPosInt(max)) {\n      throw new TypeError('max option must be a nonnegative integer')\n    }\n\n    const UintArray = max ? getUintArray(max) : Array\n    if (!UintArray) {\n      throw new Error('invalid max value: ' + max)\n    }\n\n    this.#max = max\n    this.#maxSize = maxSize\n    this.maxEntrySize = maxEntrySize || this.#maxSize\n    this.sizeCalculation = sizeCalculation\n    if (this.sizeCalculation) {\n      if (!this.#maxSize && !this.maxEntrySize) {\n        throw new TypeError(\n          'cannot set sizeCalculation without setting maxSize or maxEntrySize',\n        )\n      }\n      if (typeof this.sizeCalculation !== 'function') {\n        throw new TypeError('sizeCalculation set to non-function')\n      }\n    }\n\n    if (memoMethod !== undefined && typeof memoMethod !== 'function') {\n      throw new TypeError('memoMethod must be a function if defined')\n    }\n    this.#memoMethod = memoMethod\n\n    if (fetchMethod !== undefined && typeof fetchMethod !== 'function') {\n      throw new TypeError('fetchMethod must be a function if specified')\n    }\n    this.#fetchMethod = fetchMethod\n    this.#hasFetchMethod = !!fetchMethod\n\n    this.#keyMap = new Map()\n    this.#keyList = new Array(max).fill(undefined)\n    this.#valList = new Array(max).fill(undefined)\n    this.#next = new UintArray(max)\n    this.#prev = new UintArray(max)\n    this.#head = 0 as Index\n    this.#tail = 0 as Index\n    this.#free = Stack.create(max)\n    this.#size = 0\n    this.#calculatedSize = 0\n\n    if (typeof dispose === 'function') {\n      this.#dispose = dispose\n    }\n    if (typeof onInsert === 'function') {\n      this.#onInsert = onInsert\n    }\n    if (typeof disposeAfter === 'function') {\n      this.#disposeAfter = disposeAfter\n      this.#disposed = []\n    } else {\n      this.#disposeAfter = undefined\n      this.#disposed = undefined\n    }\n    this.#hasDispose = !!this.#dispose\n    this.#hasOnInsert = !!this.#onInsert\n    this.#hasDisposeAfter = !!this.#disposeAfter\n\n    this.noDisposeOnSet = !!noDisposeOnSet\n    this.noUpdateTTL = !!noUpdateTTL\n    this.noDeleteOnFetchRejection = !!noDeleteOnFetchRejection\n    this.allowStaleOnFetchRejection = !!allowStaleOnFetchRejection\n    this.allowStaleOnFetchAbort = !!allowStaleOnFetchAbort\n    this.ignoreFetchAbort = !!ignoreFetchAbort\n\n    // NB: maxEntrySize is set to maxSize if it's set\n    if (this.maxEntrySize !== 0) {\n      if (this.#maxSize !== 0) {\n        if (!isPosInt(this.#maxSize)) {\n          throw new TypeError(\n            'maxSize must be a positive integer if specified',\n          )\n        }\n      }\n      if (!isPosInt(this.maxEntrySize)) {\n        throw new TypeError(\n          'maxEntrySize must be a positive integer if specified',\n        )\n      }\n      this.#initializeSizeTracking()\n    }\n\n    this.allowStale = !!allowStale\n    this.noDeleteOnStaleGet = !!noDeleteOnStaleGet\n    this.updateAgeOnGet = !!updateAgeOnGet\n    this.updateAgeOnHas = !!updateAgeOnHas\n    this.ttlResolution =\n      isPosInt(ttlResolution) || ttlResolution === 0 ? ttlResolution : 1\n    this.ttlAutopurge = !!ttlAutopurge\n    this.ttl = ttl || 0\n    if (this.ttl) {\n      if (!isPosInt(this.ttl)) {\n        throw new TypeError('ttl must be a positive integer if specified')\n      }\n      this.#initializeTTLTracking()\n    }\n\n    // do not allow completely unbounded caches\n    if (this.#max === 0 && this.ttl === 0 && this.#maxSize === 0) {\n      throw new TypeError(\n        'At least one of max, maxSize, or ttl is required',\n      )\n    }\n    if (!this.ttlAutopurge && !this.#max && !this.#maxSize) {\n      const code = 'LRU_CACHE_UNBOUNDED'\n      if (shouldWarn(code)) {\n        warned.add(code)\n        const msg =\n          'TTL caching without ttlAutopurge, max, or maxSize can ' +\n          'result in unbounded memory consumption.'\n        emitWarning(msg, 'UnboundedCacheWarning', code, LRUCache)\n      }\n    }\n  }\n\n  /**\n   * Return the number of ms left in the item's TTL. If item is not in cache,\n   * returns `0`. Returns `Infinity` if item is in cache without a defined TTL.\n   */\n  getRemainingTTL(key: K) {\n    return this.#keyMap.has(key) ? Infinity : 0\n  }\n\n  #initializeTTLTracking() {\n    const ttls = new ZeroArray(this.#max)\n    const starts = new ZeroArray(this.#max)\n    this.#ttls = ttls\n    this.#starts = starts\n    const purgeTimers =\n      this.ttlAutopurge ?\n        new Array<undefined | ReturnType<typeof setTimeout>>(this.#max)\n      : undefined\n    this.#autopurgeTimers = purgeTimers\n\n    this.#setItemTTL = (index, ttl, start = this.#perf.now()) => {\n      starts[index] = ttl !== 0 ? start : 0\n      ttls[index] = ttl\n      // clear out the purge timer if we're setting TTL to 0, and\n      // previously had a ttl purge timer running, so it doesn't\n      // fire unnecessarily.\n      if (purgeTimers?.[index]) {\n        clearTimeout(purgeTimers[index])\n        purgeTimers[index] = undefined\n      }\n      if (ttl !== 0 && purgeTimers) {\n        const t = setTimeout(() => {\n          if (this.#isStale(index)) {\n            this.#delete(this.#keyList[index] as K, 'expire')\n          }\n        }, ttl + 1)\n        // unref() not supported on all platforms\n        /* c8 ignore start */\n        if (t.unref) {\n          t.unref()\n        }\n        /* c8 ignore stop */\n        purgeTimers[index] = t\n      }\n    }\n\n    this.#updateItemAge = index => {\n      starts[index] = ttls[index] !== 0 ? this.#perf.now() : 0\n    }\n\n    this.#statusTTL = (status, index) => {\n      if (ttls[index]) {\n        const ttl = ttls[index]\n        const start = starts[index]\n        /* c8 ignore next */\n        if (!ttl || !start) return\n        status.ttl = ttl\n        status.start = start\n        status.now = cachedNow || getNow()\n        const age = status.now - start\n        status.remainingTTL = ttl - age\n      }\n    }\n\n    // debounce calls to perf.now() to 1s so we're not hitting\n    // that costly call repeatedly.\n    let cachedNow = 0\n    const getNow = () => {\n      const n = this.#perf.now()\n      if (this.ttlResolution > 0) {\n        cachedNow = n\n        const t = setTimeout(() => (cachedNow = 0), this.ttlResolution)\n        // not available on all platforms\n        /* c8 ignore start */\n        if (t.unref) {\n          t.unref()\n        }\n        /* c8 ignore stop */\n      }\n      return n\n    }\n\n    this.getRemainingTTL = key => {\n      const index = this.#keyMap.get(key)\n      if (index === undefined) {\n        return 0\n      }\n      const ttl = ttls[index]\n      const start = starts[index]\n      if (!ttl || !start) {\n        return Infinity\n      }\n      const age = (cachedNow || getNow()) - start\n      return ttl - age\n    }\n\n    this.#isStale = index => {\n      const s = starts[index]\n      const t = ttls[index]\n      return !!t && !!s && (cachedNow || getNow()) - s > t\n    }\n  }\n\n  // conditionally set private methods related to TTL\n  #updateItemAge: (index: Index) => void = () => {}\n  #statusTTL: (status: LRUCache.Status<V>, index: Index) => void = () => {}\n  #setItemTTL: (\n    index: Index,\n    ttl: LRUCache.Milliseconds,\n    start?: LRUCache.Milliseconds,\n    // ignore because we never call this if we're not already in TTL mode\n    /* c8 ignore start */\n  ) => void = () => {}\n  /* c8 ignore stop */\n\n  #isStale: (index: Index) => boolean = () => false\n\n  #initializeSizeTracking() {\n    const sizes = new ZeroArray(this.#max)\n    this.#calculatedSize = 0\n    this.#sizes = sizes\n    this.#removeItemSize = index => {\n      this.#calculatedSize -= sizes[index] as number\n      sizes[index] = 0\n    }\n    this.#requireSize = (k, v, size, sizeCalculation) => {\n      // provisionally accept background fetches.\n      // actual value size will be checked when they return.\n      if (this.#isBackgroundFetch(v)) {\n        return 0\n      }\n      if (!isPosInt(size)) {\n        if (sizeCalculation) {\n          if (typeof sizeCalculation !== 'function') {\n            throw new TypeError('sizeCalculation must be a function')\n          }\n          size = sizeCalculation(v, k)\n          if (!isPosInt(size)) {\n            throw new TypeError(\n              'sizeCalculation return invalid (expect positive integer)',\n            )\n          }\n        } else {\n          throw new TypeError(\n            'invalid size value (must be positive integer). ' +\n              'When maxSize or maxEntrySize is used, sizeCalculation ' +\n              'or size must be set.',\n          )\n        }\n      }\n      return size\n    }\n    this.#addItemSize = (\n      index: Index,\n      size: LRUCache.Size,\n      status?: LRUCache.Status<V>,\n    ) => {\n      sizes[index] = size\n      if (this.#maxSize) {\n        const maxSize = this.#maxSize - (sizes[index] as number)\n        while (this.#calculatedSize > maxSize) {\n          this.#evict(true)\n        }\n      }\n      this.#calculatedSize += sizes[index] as number\n      if (status) {\n        status.entrySize = size\n        status.totalCalculatedSize = this.#calculatedSize\n      }\n    }\n  }\n\n  #removeItemSize: (index: Index) => void = _i => {}\n  #addItemSize: (\n    index: Index,\n    size: LRUCache.Size,\n    status?: LRUCache.Status<V>,\n  ) => void = (_i, _s, _st) => {}\n  #requireSize: (\n    k: K,\n    v: V | BackgroundFetch<V>,\n    size?: LRUCache.Size,\n    sizeCalculation?: LRUCache.SizeCalculator<K, V>,\n  ) => LRUCache.Size = (\n    _k: K,\n    _v: V | BackgroundFetch<V>,\n    size?: LRUCache.Size,\n    sizeCalculation?: LRUCache.SizeCalculator<K, V>,\n  ) => {\n    if (size || sizeCalculation) {\n      throw new TypeError(\n        'cannot set size without setting maxSize or maxEntrySize on cache',\n      )\n    }\n    return 0\n  };\n\n  *#indexes({ allowStale = this.allowStale } = {}) {\n    if (this.#size) {\n      for (let i = this.#tail; true; ) {\n        if (!this.#isValidIndex(i)) {\n          break\n        }\n        if (allowStale || !this.#isStale(i)) {\n          yield i\n        }\n        if (i === this.#head) {\n          break\n        } else {\n          i = this.#prev[i] as Index\n        }\n      }\n    }\n  }\n\n  *#rindexes({ allowStale = this.allowStale } = {}) {\n    if (this.#size) {\n      for (let i = this.#head; true; ) {\n        if (!this.#isValidIndex(i)) {\n          break\n        }\n        if (allowStale || !this.#isStale(i)) {\n          yield i\n        }\n        if (i === this.#tail) {\n          break\n        } else {\n          i = this.#next[i] as Index\n        }\n      }\n    }\n  }\n\n  #isValidIndex(index: Index) {\n    return (\n      index !== undefined &&\n      this.#keyMap.get(this.#keyList[index] as K) === index\n    )\n  }\n\n  /**\n   * Return a generator yielding `[key, value]` pairs,\n   * in order from most recently used to least recently used.\n   */\n  *entries() {\n    for (const i of this.#indexes()) {\n      if (\n        this.#valList[i] !== undefined &&\n        this.#keyList[i] !== undefined &&\n        !this.#isBackgroundFetch(this.#valList[i])\n      ) {\n        yield [this.#keyList[i], this.#valList[i]] as [K, V]\n      }\n    }\n  }\n\n  /**\n   * Inverse order version of {@link LRUCache.entries}\n   *\n   * Return a generator yielding `[key, value]` pairs,\n   * in order from least recently used to most recently used.\n   */\n  *rentries() {\n    for (const i of this.#rindexes()) {\n      if (\n        this.#valList[i] !== undefined &&\n        this.#keyList[i] !== undefined &&\n        !this.#isBackgroundFetch(this.#valList[i])\n      ) {\n        yield [this.#keyList[i], this.#valList[i]]\n      }\n    }\n  }\n\n  /**\n   * Return a generator yielding the keys in the cache,\n   * in order from most recently used to least recently used.\n   */\n  *keys() {\n    for (const i of this.#indexes()) {\n      const k = this.#keyList[i]\n      if (k !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield k\n      }\n    }\n  }\n\n  /**\n   * Inverse order version of {@link LRUCache.keys}\n   *\n   * Return a generator yielding the keys in the cache,\n   * in order from least recently used to most recently used.\n   */\n  *rkeys() {\n    for (const i of this.#rindexes()) {\n      const k = this.#keyList[i]\n      if (k !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield k\n      }\n    }\n  }\n\n  /**\n   * Return a generator yielding the values in the cache,\n   * in order from most recently used to least recently used.\n   */\n  *values() {\n    for (const i of this.#indexes()) {\n      const v = this.#valList[i]\n      if (v !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield this.#valList[i] as V\n      }\n    }\n  }\n\n  /**\n   * Inverse order version of {@link LRUCache.values}\n   *\n   * Return a generator yielding the values in the cache,\n   * in order from least recently used to most recently used.\n   */\n  *rvalues() {\n    for (const i of this.#rindexes()) {\n      const v = this.#valList[i]\n      if (v !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield this.#valList[i]\n      }\n    }\n  }\n\n  /**\n   * Iterating over the cache itself yields the same results as\n   * {@link LRUCache.entries}\n   */\n  [Symbol.iterator]() {\n    return this.entries()\n  }\n\n  /**\n   * A String value that is used in the creation of the default string\n   * description of an object. Called by the built-in method\n   * `Object.prototype.toString`.\n   */\n  [Symbol.toStringTag] = 'LRUCache'\n\n  /**\n   * Find a value for which the supplied fn method returns a truthy value,\n   * similar to `Array.find()`. fn is called as `fn(value, key, cache)`.\n   */\n  find(\n    fn: (v: V, k: K, self: LRUCache<K, V, FC>) => boolean,\n    getOptions: LRUCache.GetOptions<K, V, FC> = {},\n  ) {\n    for (const i of this.#indexes()) {\n      const v = this.#valList[i]\n      const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined) continue\n      if (fn(value, this.#keyList[i] as K, this)) {\n        return this.get(this.#keyList[i] as K, getOptions)\n      }\n    }\n  }\n\n  /**\n   * Call the supplied function on each item in the cache, in order from most\n   * recently used to least recently used.\n   *\n   * `fn` is called as `fn(value, key, cache)`.\n   *\n   * If `thisp` is provided, function will be called in the `this`-context of\n   * the provided object, or the cache if no `thisp` object is provided.\n   *\n   * Does not update age or recenty of use, or iterate over stale values.\n   */\n  forEach(\n    fn: (v: V, k: K, self: LRUCache<K, V, FC>) => any,\n    thisp: any = this,\n  ) {\n    for (const i of this.#indexes()) {\n      const v = this.#valList[i]\n      const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined) continue\n      fn.call(thisp, value, this.#keyList[i] as K, this)\n    }\n  }\n\n  /**\n   * The same as {@link LRUCache.forEach} but items are iterated over in\n   * reverse order.  (ie, less recently used items are iterated over first.)\n   */\n  rforEach(\n    fn: (v: V, k: K, self: LRUCache<K, V, FC>) => any,\n    thisp: any = this,\n  ) {\n    for (const i of this.#rindexes()) {\n      const v = this.#valList[i]\n      const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined) continue\n      fn.call(thisp, value, this.#keyList[i] as K, this)\n    }\n  }\n\n  /**\n   * Delete any stale entries. Returns true if anything was removed,\n   * false otherwise.\n   */\n  purgeStale() {\n    let deleted = false\n    for (const i of this.#rindexes({ allowStale: true })) {\n      if (this.#isStale(i)) {\n        this.#delete(this.#keyList[i] as K, 'expire')\n        deleted = true\n      }\n    }\n    return deleted\n  }\n\n  /**\n   * Get the extended info about a given entry, to get its value, size, and\n   * TTL info simultaneously. Returns `undefined` if the key is not present.\n   *\n   * Unlike {@link LRUCache#dump}, which is designed to be portable and survive\n   * serialization, the `start` value is always the current timestamp, and the\n   * `ttl` is a calculated remaining time to live (negative if expired).\n   *\n   * Always returns stale values, if their info is found in the cache, so be\n   * sure to check for expirations (ie, a negative {@link LRUCache.Entry#ttl})\n   * if relevant.\n   */\n  info(key: K): LRUCache.Entry<V> | undefined {\n    const i = this.#keyMap.get(key)\n    if (i === undefined) return undefined\n    const v = this.#valList[i]\n    /* c8 ignore start - this isn't tested for the info function,\n     * but it's the same logic as found in other places. */\n    const value: V | undefined =\n      this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n    if (value === undefined) return undefined\n    /* c8 ignore end */\n    const entry: LRUCache.Entry<V> = { value }\n    if (this.#ttls && this.#starts) {\n      const ttl = this.#ttls[i]\n      const start = this.#starts[i]\n      if (ttl && start) {\n        const remain = ttl - (this.#perf.now() - start)\n        entry.ttl = remain\n        entry.start = Date.now()\n      }\n    }\n    if (this.#sizes) {\n      entry.size = this.#sizes[i]\n    }\n    return entry\n  }\n\n  /**\n   * Return an array of [key, {@link LRUCache.Entry}] tuples which can be\n   * passed to {@link LRUCache#load}.\n   *\n   * The `start` fields are calculated relative to a portable `Date.now()`\n   * timestamp, even if `performance.now()` is available.\n   *\n   * Stale entries are always included in the `dump`, even if\n   * {@link LRUCache.OptionsBase.allowStale} is false.\n   *\n   * Note: this returns an actual array, not a generator, so it can be more\n   * easily passed around.\n   */\n  dump() {\n    const arr: [K, LRUCache.Entry<V>][] = []\n    for (const i of this.#indexes({ allowStale: true })) {\n      const key = this.#keyList[i]\n      const v = this.#valList[i]\n      const value: V | undefined =\n        this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined || key === undefined) continue\n      const entry: LRUCache.Entry<V> = { value }\n      if (this.#ttls && this.#starts) {\n        entry.ttl = this.#ttls[i]\n        // always dump the start relative to a portable timestamp\n        // it's ok for this to be a bit slow, it's a rare operation.\n        const age = this.#perf.now() - (this.#starts[i] as number)\n        entry.start = Math.floor(Date.now() - age)\n      }\n      if (this.#sizes) {\n        entry.size = this.#sizes[i]\n      }\n      arr.unshift([key, entry])\n    }\n    return arr\n  }\n\n  /**\n   * Reset the cache and load in the items in entries in the order listed.\n   *\n   * The shape of the resulting cache may be different if the same options are\n   * not used in both caches.\n   *\n   * The `start` fields are assumed to be calculated relative to a portable\n   * `Date.now()` timestamp, even if `performance.now()` is available.\n   */\n  load(arr: [K, LRUCache.Entry<V>][]) {\n    this.clear()\n    for (const [key, entry] of arr) {\n      if (entry.start) {\n        // entry.start is a portable timestamp, but we may be using\n        // node's performance.now(), so calculate the offset, so that\n        // we get the intended remaining TTL, no matter how long it's\n        // been on ice.\n        //\n        // it's ok for this to be a bit slow, it's a rare operation.\n        const age = Date.now() - entry.start\n        entry.start = this.#perf.now() - age\n      }\n      this.set(key, entry.value, entry)\n    }\n  }\n\n  /**\n   * Add a value to the cache.\n   *\n   * Note: if `undefined` is specified as a value, this is an alias for\n   * {@link LRUCache#delete}\n   *\n   * Fields on the {@link LRUCache.SetOptions} options param will override\n   * their corresponding values in the constructor options for the scope\n   * of this single `set()` operation.\n   *\n   * If `start` is provided, then that will set the effective start\n   * time for the TTL calculation. Note that this must be a previous\n   * value of `performance.now()` if supported, or a previous value of\n   * `Date.now()` if not.\n   *\n   * Options object may also include `size`, which will prevent\n   * calling the `sizeCalculation` function and just use the specified\n   * number if it is a positive integer, and `noDisposeOnSet` which\n   * will prevent calling a `dispose` function in the case of\n   * overwrites.\n   *\n   * If the `size` (or return value of `sizeCalculation`) for a given\n   * entry is greater than `maxEntrySize`, then the item will not be\n   * added to the cache.\n   *\n   * Will update the recency of the entry.\n   *\n   * If the value is `undefined`, then this is an alias for\n   * `cache.delete(key)`. `undefined` is never stored in the cache.\n   */\n  set(\n    k: K,\n    v: V | BackgroundFetch<V> | undefined,\n    setOptions: LRUCache.SetOptions<K, V, FC> = {},\n  ) {\n    if (v === undefined) {\n      this.delete(k)\n      return this\n    }\n    const {\n      ttl = this.ttl,\n      start,\n      noDisposeOnSet = this.noDisposeOnSet,\n      sizeCalculation = this.sizeCalculation,\n      status,\n    } = setOptions\n    let { noUpdateTTL = this.noUpdateTTL } = setOptions\n\n    const size = this.#requireSize(\n      k,\n      v,\n      setOptions.size || 0,\n      sizeCalculation,\n    )\n    // if the item doesn't fit, don't do anything\n    // NB: maxEntrySize set to maxSize by default\n    if (this.maxEntrySize && size > this.maxEntrySize) {\n      if (status) {\n        status.set = 'miss'\n        status.maxEntrySizeExceeded = true\n      }\n      // have to delete, in case something is there already.\n      this.#delete(k, 'set')\n      return this\n    }\n    let index = this.#size === 0 ? undefined : this.#keyMap.get(k)\n    if (index === undefined) {\n      // addition\n      index = (\n        this.#size === 0 ? this.#tail\n        : this.#free.length !== 0 ? this.#free.pop()\n        : this.#size === this.#max ? this.#evict(false)\n        : this.#size) as Index\n      this.#keyList[index] = k\n      this.#valList[index] = v\n      this.#keyMap.set(k, index)\n      this.#next[this.#tail] = index\n      this.#prev[index] = this.#tail\n      this.#tail = index\n      this.#size++\n      this.#addItemSize(index, size, status)\n      if (status) status.set = 'add'\n      noUpdateTTL = false\n      if (this.#hasOnInsert) {\n        this.#onInsert?.(v as V, k, 'add')\n      }\n    } else {\n      // update\n      this.#moveToTail(index)\n      const oldVal = this.#valList[index] as V | BackgroundFetch<V>\n      if (v !== oldVal) {\n        if (this.#hasFetchMethod && this.#isBackgroundFetch(oldVal)) {\n          oldVal.__abortController.abort(new Error('replaced'))\n          const { __staleWhileFetching: s } = oldVal\n          if (s !== undefined && !noDisposeOnSet) {\n            if (this.#hasDispose) {\n              this.#dispose?.(s as V, k, 'set')\n            }\n            if (this.#hasDisposeAfter) {\n              this.#disposed?.push([s as V, k, 'set'])\n            }\n          }\n        } else if (!noDisposeOnSet) {\n          if (this.#hasDispose) {\n            this.#dispose?.(oldVal as V, k, 'set')\n          }\n          if (this.#hasDisposeAfter) {\n            this.#disposed?.push([oldVal as V, k, 'set'])\n          }\n        }\n        this.#removeItemSize(index)\n        this.#addItemSize(index, size, status)\n        this.#valList[index] = v\n        if (status) {\n          status.set = 'replace'\n          const oldValue =\n            oldVal && this.#isBackgroundFetch(oldVal) ?\n              oldVal.__staleWhileFetching\n            : oldVal\n          if (oldValue !== undefined) status.oldValue = oldValue\n        }\n      } else if (status) {\n        status.set = 'update'\n      }\n\n      if (this.#hasOnInsert) {\n        this.onInsert?.(v as V, k, v === oldVal ? 'update' : 'replace')\n      }\n    }\n    if (ttl !== 0 && !this.#ttls) {\n      this.#initializeTTLTracking()\n    }\n    if (this.#ttls) {\n      if (!noUpdateTTL) {\n        this.#setItemTTL(index, ttl, start)\n      }\n      if (status) this.#statusTTL(status, index)\n    }\n    if (!noDisposeOnSet && this.#hasDisposeAfter && this.#disposed) {\n      const dt = this.#disposed\n      let task: DisposeTask<K, V> | undefined\n      while ((task = dt?.shift())) {\n        this.#disposeAfter?.(...task)\n      }\n    }\n    return this\n  }\n\n  /**\n   * Evict the least recently used item, returning its value or\n   * `undefined` if cache is empty.\n   */\n  pop(): V | undefined {\n    try {\n      while (this.#size) {\n        const val = this.#valList[this.#head]\n        this.#evict(true)\n        if (this.#isBackgroundFetch(val)) {\n          if (val.__staleWhileFetching) {\n            return val.__staleWhileFetching\n          }\n        } else if (val !== undefined) {\n          return val\n        }\n      }\n    } finally {\n      if (this.#hasDisposeAfter && this.#disposed) {\n        const dt = this.#disposed\n        let task: DisposeTask<K, V> | undefined\n        while ((task = dt?.shift())) {\n          this.#disposeAfter?.(...task)\n        }\n      }\n    }\n  }\n\n  #evict(free: boolean) {\n    const head = this.#head\n    const k = this.#keyList[head] as K\n    const v = this.#valList[head] as V\n    if (this.#hasFetchMethod && this.#isBackgroundFetch(v)) {\n      v.__abortController.abort(new Error('evicted'))\n    } else if (this.#hasDispose || this.#hasDisposeAfter) {\n      if (this.#hasDispose) {\n        this.#dispose?.(v, k, 'evict')\n      }\n      if (this.#hasDisposeAfter) {\n        this.#disposed?.push([v, k, 'evict'])\n      }\n    }\n    this.#removeItemSize(head)\n    if (this.#autopurgeTimers?.[head]) {\n      clearTimeout(this.#autopurgeTimers[head])\n      this.#autopurgeTimers[head] = undefined\n    }\n    // if we aren't about to use the index, then null these out\n    if (free) {\n      this.#keyList[head] = undefined\n      this.#valList[head] = undefined\n      this.#free.push(head)\n    }\n    if (this.#size === 1) {\n      this.#head = this.#tail = 0 as Index\n      this.#free.length = 0\n    } else {\n      this.#head = this.#next[head] as Index\n    }\n    this.#keyMap.delete(k)\n    this.#size--\n    return head\n  }\n\n  /**\n   * Check if a key is in the cache, without updating the recency of use.\n   * Will return false if the item is stale, even though it is technically\n   * in the cache.\n   *\n   * Check if a key is in the cache, without updating the recency of\n   * use. Age is updated if {@link LRUCache.OptionsBase.updateAgeOnHas} is set\n   * to `true` in either the options or the constructor.\n   *\n   * Will return `false` if the item is stale, even though it is technically in\n   * the cache. The difference can be determined (if it matters) by using a\n   * `status` argument, and inspecting the `has` field.\n   *\n   * Will not update item age unless\n   * {@link LRUCache.OptionsBase.updateAgeOnHas} is set.\n   */\n  has(k: K, hasOptions: LRUCache.HasOptions<K, V, FC> = {}) {\n    const { updateAgeOnHas = this.updateAgeOnHas, status } = hasOptions\n    const index = this.#keyMap.get(k)\n    if (index !== undefined) {\n      const v = this.#valList[index]\n      if (\n        this.#isBackgroundFetch(v) &&\n        v.__staleWhileFetching === undefined\n      ) {\n        return false\n      }\n      if (!this.#isStale(index)) {\n        if (updateAgeOnHas) {\n          this.#updateItemAge(index)\n        }\n        if (status) {\n          status.has = 'hit'\n          this.#statusTTL(status, index)\n        }\n        return true\n      } else if (status) {\n        status.has = 'stale'\n        this.#statusTTL(status, index)\n      }\n    } else if (status) {\n      status.has = 'miss'\n    }\n    return false\n  }\n\n  /**\n   * Like {@link LRUCache#get} but doesn't update recency or delete stale\n   * items.\n   *\n   * Returns `undefined` if the item is stale, unless\n   * {@link LRUCache.OptionsBase.allowStale} is set.\n   */\n  peek(k: K, peekOptions: LRUCache.PeekOptions<K, V, FC> = {}) {\n    const { allowStale = this.allowStale } = peekOptions\n    const index = this.#keyMap.get(k)\n    if (index === undefined || (!allowStale && this.#isStale(index))) {\n      return\n    }\n    const v = this.#valList[index]\n    // either stale and allowed, or forcing a refresh of non-stale value\n    return this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n  }\n\n  #backgroundFetch(\n    k: K,\n    index: Index | undefined,\n    options: LRUCache.FetchOptions<K, V, FC>,\n    context: any,\n  ): BackgroundFetch<V> {\n    const v = index === undefined ? undefined : this.#valList[index]\n    if (this.#isBackgroundFetch(v)) {\n      return v\n    }\n\n    const ac = new AC()\n    const { signal } = options\n    // when/if our AC signals, then stop listening to theirs.\n    signal?.addEventListener('abort', () => ac.abort(signal.reason), {\n      signal: ac.signal,\n    })\n\n    const fetchOpts = {\n      signal: ac.signal,\n      options,\n      context,\n    }\n\n    const cb = (v: V | undefined, updateCache = false): V | undefined => {\n      const { aborted } = ac.signal\n      const ignoreAbort = options.ignoreFetchAbort && v !== undefined\n      const proceed = options.ignoreFetchAbort ||\n        !!(options.allowStaleOnFetchAbort && v !== undefined)\n      if (options.status) {\n        if (aborted && !updateCache) {\n          options.status.fetchAborted = true\n          options.status.fetchError = ac.signal.reason\n          if (ignoreAbort) options.status.fetchAbortIgnored = true\n        } else {\n          options.status.fetchResolved = true\n        }\n      }\n      if (aborted && !ignoreAbort && !updateCache) {\n        return fetchFail(ac.signal.reason, proceed)\n      }\n      // either we didn't abort, and are still here, or we did, and ignored\n      const bf = p as BackgroundFetch<V>\n      // if nothing else has been written there but we're set to update the\n      // cache and ignore the abort, or if it's still pending on this specific\n      // background request, then write it to the cache.\n      const vl = this.#valList[index as Index]\n      if (vl === p || (ignoreAbort && updateCache && vl === undefined)) {\n        if (v === undefined) {\n          if (bf.__staleWhileFetching !== undefined) {\n            this.#valList[index as Index] = bf.__staleWhileFetching\n          } else {\n            this.#delete(k, 'fetch')\n          }\n        } else {\n          if (options.status) options.status.fetchUpdated = true\n          this.set(k, v, fetchOpts.options)\n        }\n      }\n      return v\n    }\n\n    const eb = (er: any) => {\n      if (options.status) {\n        options.status.fetchRejected = true\n        options.status.fetchError = er\n      }\n      // do not pass go, do not collect $200\n      return fetchFail(er, false)\n    }\n\n    const fetchFail = (er: any, proceed: boolean): V | undefined => {\n      const { aborted } = ac.signal\n      const allowStaleAborted = aborted && options.allowStaleOnFetchAbort\n      const allowStale =\n        allowStaleAborted || options.allowStaleOnFetchRejection\n      const noDelete = allowStale || options.noDeleteOnFetchRejection\n      const bf = p as BackgroundFetch<V>\n      if (this.#valList[index as Index] === p) {\n        // if we allow stale on fetch rejections, then we need to ensure that\n        // the stale value is not removed from the cache when the fetch fails.\n        const del = !noDelete ||\n          !proceed && bf.__staleWhileFetching === undefined\n        if (del) {\n          this.#delete(k, 'fetch')\n        } else if (!allowStaleAborted) {\n          // still replace the *promise* with the stale value,\n          // since we are done with the promise at this point.\n          // leave it untouched if we're still waiting for an\n          // aborted background fetch that hasn't yet returned.\n          this.#valList[index as Index] = bf.__staleWhileFetching\n        }\n      }\n      if (allowStale) {\n        if (options.status && bf.__staleWhileFetching !== undefined) {\n          options.status.returnedStale = true\n        }\n        return bf.__staleWhileFetching\n      } else if (bf.__returned === bf) {\n        throw er\n      }\n    }\n\n    const pcall = (\n      res: (v: V | undefined) => void,\n      rej: (e: any) => void,\n    ) => {\n      const fmp = this.#fetchMethod?.(k, v, fetchOpts)\n      if (fmp && fmp instanceof Promise) {\n        fmp.then(v => res(v === undefined ? undefined : v), rej)\n      }\n      // ignored, we go until we finish, regardless.\n      // defer check until we are actually aborting,\n      // so fetchMethod can override.\n      ac.signal.addEventListener('abort', () => {\n        if (!options.ignoreFetchAbort || options.allowStaleOnFetchAbort) {\n          res(undefined)\n          // when it eventually resolves, update the cache.\n          if (options.allowStaleOnFetchAbort) {\n            res = v => cb(v, true)\n          }\n        }\n      })\n    }\n\n    if (options.status) options.status.fetchDispatched = true\n    const p = new Promise(pcall).then(cb, eb)\n    const bf: BackgroundFetch<V> = Object.assign(p, {\n      __abortController: ac,\n      __staleWhileFetching: v,\n      __returned: undefined,\n    })\n\n    if (index === undefined) {\n      // internal, don't expose status.\n      this.set(k, bf, { ...fetchOpts.options, status: undefined })\n      index = this.#keyMap.get(k)\n    } else {\n      this.#valList[index] = bf\n    }\n    return bf\n  }\n\n  #isBackgroundFetch(p: any): p is BackgroundFetch<V> {\n    if (!this.#hasFetchMethod) return false\n    const b = p as BackgroundFetch<V>\n    return (\n      !!b &&\n      b instanceof Promise &&\n      b.hasOwnProperty('__staleWhileFetching') &&\n      b.__abortController instanceof AC\n    )\n  }\n\n  /**\n   * Make an asynchronous cached fetch using the\n   * {@link LRUCache.OptionsBase.fetchMethod} function.\n   *\n   * If the value is in the cache and not stale, then the returned\n   * Promise resolves to the value.\n   *\n   * If not in the cache, or beyond its TTL staleness, then\n   * `fetchMethod(key, staleValue, { options, signal, context })` is\n   * called, and the value returned will be added to the cache once\n   * resolved.\n   *\n   * If called with `allowStale`, and an asynchronous fetch is\n   * currently in progress to reload a stale value, then the former\n   * stale value will be returned.\n   *\n   * If called with `forceRefresh`, then the cached item will be\n   * re-fetched, even if it is not stale. However, if `allowStale` is also\n   * set, then the old value will still be returned. This is useful\n   * in cases where you want to force a reload of a cached value. If\n   * a background fetch is already in progress, then `forceRefresh`\n   * has no effect.\n   *\n   * If multiple fetches for the same key are issued, then they will all be\n   * coalesced into a single call to fetchMethod.\n   *\n   * Note that this means that handling options such as\n   * {@link LRUCache.OptionsBase.allowStaleOnFetchAbort},\n   * {@link LRUCache.FetchOptions.signal},\n   * and {@link LRUCache.OptionsBase.allowStaleOnFetchRejection} will be\n   * determined by the FIRST fetch() call for a given key.\n   *\n   * This is a known (fixable) shortcoming which will be addresed on when\n   * someone complains about it, as the fix would involve added complexity and\n   * may not be worth the costs for this edge case.\n   *\n   * If {@link LRUCache.OptionsBase.fetchMethod} is not specified, then this is\n   * effectively an alias for `Promise.resolve(cache.get(key))`.\n   *\n   * When the fetch method resolves to a value, if the fetch has not\n   * been aborted due to deletion, eviction, or being overwritten,\n   * then it is added to the cache using the options provided.\n   *\n   * If the key is evicted or deleted before the `fetchMethod`\n   * resolves, then the AbortSignal passed to the `fetchMethod` will\n   * receive an `abort` event, and the promise returned by `fetch()`\n   * will reject with the reason for the abort.\n   *\n   * If a `signal` is passed to the `fetch()` call, then aborting the\n   * signal will abort the fetch and cause the `fetch()` promise to\n   * reject with the reason provided.\n   *\n   * **Setting `context`**\n   *\n   * If an `FC` type is set to a type other than `unknown`, `void`, or\n   * `undefined` in the {@link LRUCache} constructor, then all\n   * calls to `cache.fetch()` _must_ provide a `context` option. If\n   * set to `undefined` or `void`, then calls to fetch _must not_\n   * provide a `context` option.\n   *\n   * The `context` param allows you to provide arbitrary data that\n   * might be relevant in the course of fetching the data. It is only\n   * relevant for the course of a single `fetch()` operation, and\n   * discarded afterwards.\n   *\n   * **Note: `fetch()` calls are inflight-unique**\n   *\n   * If you call `fetch()` multiple times with the same key value,\n   * then every call after the first will resolve on the same\n   * promise<sup>1</sup>,\n   * _even if they have different settings that would otherwise change\n   * the behavior of the fetch_, such as `noDeleteOnFetchRejection`\n   * or `ignoreFetchAbort`.\n   *\n   * In most cases, this is not a problem (in fact, only fetching\n   * something once is what you probably want, if you're caching in\n   * the first place). If you are changing the fetch() options\n   * dramatically between runs, there's a good chance that you might\n   * be trying to fit divergent semantics into a single object, and\n   * would be better off with multiple cache instances.\n   *\n   * **1**: Ie, they're not the \"same Promise\", but they resolve at\n   * the same time, because they're both waiting on the same\n   * underlying fetchMethod response.\n   */\n\n  fetch(\n    k: K,\n    fetchOptions: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : LRUCache.FetchOptionsWithContext<K, V, FC>,\n  ): Promise<undefined | V>\n\n  // this overload not allowed if context is required\n  fetch(\n    k: unknown extends FC ? K\n    : FC extends undefined | void ? K\n    : never,\n    fetchOptions?: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : never,\n  ): Promise<undefined | V>\n\n  async fetch(\n    k: K,\n    fetchOptions: LRUCache.FetchOptions<K, V, FC> = {},\n  ): Promise<undefined | V> {\n    const {\n      // get options\n      allowStale = this.allowStale,\n      updateAgeOnGet = this.updateAgeOnGet,\n      noDeleteOnStaleGet = this.noDeleteOnStaleGet,\n      // set options\n      ttl = this.ttl,\n      noDisposeOnSet = this.noDisposeOnSet,\n      size = 0,\n      sizeCalculation = this.sizeCalculation,\n      noUpdateTTL = this.noUpdateTTL,\n      // fetch exclusive options\n      noDeleteOnFetchRejection = this.noDeleteOnFetchRejection,\n      allowStaleOnFetchRejection = this.allowStaleOnFetchRejection,\n      ignoreFetchAbort = this.ignoreFetchAbort,\n      allowStaleOnFetchAbort = this.allowStaleOnFetchAbort,\n      context,\n      forceRefresh = false,\n      status,\n      signal,\n    } = fetchOptions\n\n    if (!this.#hasFetchMethod) {\n      if (status) status.fetch = 'get'\n      return this.get(k, {\n        allowStale,\n        updateAgeOnGet,\n        noDeleteOnStaleGet,\n        status,\n      })\n    }\n\n    const options = {\n      allowStale,\n      updateAgeOnGet,\n      noDeleteOnStaleGet,\n      ttl,\n      noDisposeOnSet,\n      size,\n      sizeCalculation,\n      noUpdateTTL,\n      noDeleteOnFetchRejection,\n      allowStaleOnFetchRejection,\n      allowStaleOnFetchAbort,\n      ignoreFetchAbort,\n      status,\n      signal,\n    }\n\n    let index = this.#keyMap.get(k)\n    if (index === undefined) {\n      if (status) status.fetch = 'miss'\n      const p = this.#backgroundFetch(k, index, options, context)\n      return (p.__returned = p)\n    } else {\n      // in cache, maybe already fetching\n      const v = this.#valList[index]\n      if (this.#isBackgroundFetch(v)) {\n        const stale = allowStale && v.__staleWhileFetching !== undefined\n        if (status) {\n          status.fetch = 'inflight'\n          if (stale) status.returnedStale = true\n        }\n        return stale ? v.__staleWhileFetching : (v.__returned = v)\n      }\n\n      // if we force a refresh, that means do NOT serve the cached value,\n      // unless we are already in the process of refreshing the cache.\n      const isStale = this.#isStale(index)\n      if (!forceRefresh && !isStale) {\n        if (status) status.fetch = 'hit'\n        this.#moveToTail(index)\n        if (updateAgeOnGet) {\n          this.#updateItemAge(index)\n        }\n        if (status) this.#statusTTL(status, index)\n        return v\n      }\n\n      // ok, it is stale or a forced refresh, and not already fetching.\n      // refresh the cache.\n      const p = this.#backgroundFetch(k, index, options, context)\n      const hasStale = p.__staleWhileFetching !== undefined\n      const staleVal = hasStale && allowStale\n      if (status) {\n        status.fetch = isStale ? 'stale' : 'refresh'\n        if (staleVal && isStale) status.returnedStale = true\n      }\n      return staleVal ? p.__staleWhileFetching : (p.__returned = p)\n    }\n  }\n\n  /**\n   * In some cases, `cache.fetch()` may resolve to `undefined`, either because\n   * a {@link LRUCache.OptionsBase#fetchMethod} was not provided (turning\n   * `cache.fetch(k)` into just an async wrapper around `cache.get(k)`) or\n   * because `ignoreFetchAbort` was specified (either to the constructor or\n   * in the {@link LRUCache.FetchOptions}). Also, the\n   * {@link LRUCache.OptionsBase.fetchMethod} may return `undefined` or `void`, making\n   * the test even more complicated.\n   *\n   * Because inferring the cases where `undefined` might be returned are so\n   * cumbersome, but testing for `undefined` can also be annoying, this method\n   * can be used, which will reject if `this.fetch()` resolves to undefined.\n   */\n  forceFetch(\n    k: K,\n    fetchOptions: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : LRUCache.FetchOptionsWithContext<K, V, FC>,\n  ): Promise<V>\n  // this overload not allowed if context is required\n  forceFetch(\n    k: unknown extends FC ? K\n    : FC extends undefined | void ? K\n    : never,\n    fetchOptions?: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : never,\n  ): Promise<V>\n  async forceFetch(\n    k: K,\n    fetchOptions: LRUCache.FetchOptions<K, V, FC> = {},\n  ): Promise<V> {\n    const v = await this.fetch(\n      k,\n      fetchOptions as unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n      : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n      : LRUCache.FetchOptionsWithContext<K, V, FC>,\n    )\n    if (v === undefined) throw new Error('fetch() returned undefined')\n    return v\n  }\n\n  /**\n   * If the key is found in the cache, then this is equivalent to\n   * {@link LRUCache#get}. If not, in the cache, then calculate the value using\n   * the {@link LRUCache.OptionsBase.memoMethod}, and add it to the cache.\n   *\n   * If an `FC` type is set to a type other than `unknown`, `void`, or\n   * `undefined` in the LRUCache constructor, then all calls to `cache.memo()`\n   * _must_ provide a `context` option. If set to `undefined` or `void`, then\n   * calls to memo _must not_ provide a `context` option.\n   *\n   * The `context` param allows you to provide arbitrary data that might be\n   * relevant in the course of fetching the data. It is only relevant for the\n   * course of a single `memo()` operation, and discarded afterwards.\n   */\n  memo(\n    k: K,\n    memoOptions: unknown extends FC ? LRUCache.MemoOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.MemoOptionsNoContext<K, V>\n    : LRUCache.MemoOptionsWithContext<K, V, FC>,\n  ): V\n  // this overload not allowed if context is required\n  memo(\n    k: unknown extends FC ? K\n    : FC extends undefined | void ? K\n    : never,\n    memoOptions?: unknown extends FC ? LRUCache.MemoOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.MemoOptionsNoContext<K, V>\n    : never,\n  ): V\n  memo(k: K, memoOptions: LRUCache.MemoOptions<K, V, FC> = {}) {\n    const memoMethod = this.#memoMethod\n    if (!memoMethod) {\n      throw new Error('no memoMethod provided to constructor')\n    }\n    const { context, forceRefresh, ...options } = memoOptions\n    const v = this.get(k, options)\n    if (!forceRefresh && v !== undefined) return v\n    const vv = memoMethod(k, v, {\n      options,\n      context,\n    } as LRUCache.MemoizerOptions<K, V, FC>)\n    this.set(k, vv, options)\n    return vv\n  }\n\n  /**\n   * Return a value from the cache. Will update the recency of the cache\n   * entry found.\n   *\n   * If the key is not found, get() will return `undefined`.\n   */\n  get(k: K, getOptions: LRUCache.GetOptions<K, V, FC> = {}) {\n    const {\n      allowStale = this.allowStale,\n      updateAgeOnGet = this.updateAgeOnGet,\n      noDeleteOnStaleGet = this.noDeleteOnStaleGet,\n      status,\n    } = getOptions\n    const index = this.#keyMap.get(k)\n    if (index !== undefined) {\n      const value = this.#valList[index]\n      const fetching = this.#isBackgroundFetch(value)\n      if (status) this.#statusTTL(status, index)\n      if (this.#isStale(index)) {\n        if (status) status.get = 'stale'\n        // delete only if not an in-flight background fetch\n        if (!fetching) {\n          if (!noDeleteOnStaleGet) {\n            this.#delete(k, 'expire')\n          }\n          if (status && allowStale) status.returnedStale = true\n          return allowStale ? value : undefined\n        } else {\n          if (\n            status &&\n            allowStale &&\n            value.__staleWhileFetching !== undefined\n          ) {\n            status.returnedStale = true\n          }\n          return allowStale ? value.__staleWhileFetching : undefined\n        }\n      } else {\n        if (status) status.get = 'hit'\n        // if we're currently fetching it, we don't actually have it yet\n        // it's not stale, which means this isn't a staleWhileRefetching.\n        // If it's not stale, and fetching, AND has a __staleWhileFetching\n        // value, then that means the user fetched with {forceRefresh:true},\n        // so it's safe to return that value.\n        if (fetching) {\n          return value.__staleWhileFetching\n        }\n        this.#moveToTail(index)\n        if (updateAgeOnGet) {\n          this.#updateItemAge(index)\n        }\n        return value\n      }\n    } else if (status) {\n      status.get = 'miss'\n    }\n  }\n\n  #connect(p: Index, n: Index) {\n    this.#prev[n] = p\n    this.#next[p] = n\n  }\n\n  #moveToTail(index: Index): void {\n    // if tail already, nothing to do\n    // if head, move head to next[index]\n    // else\n    //   move next[prev[index]] to next[index] (head has no prev)\n    //   move prev[next[index]] to prev[index]\n    // prev[index] = tail\n    // next[tail] = index\n    // tail = index\n    if (index !== this.#tail) {\n      if (index === this.#head) {\n        this.#head = this.#next[index] as Index\n      } else {\n        this.#connect(\n          this.#prev[index] as Index,\n          this.#next[index] as Index,\n        )\n      }\n      this.#connect(this.#tail, index)\n      this.#tail = index\n    }\n  }\n\n  /**\n   * Deletes a key out of the cache.\n   *\n   * Returns true if the key was deleted, false otherwise.\n   */\n  delete(k: K) {\n    return this.#delete(k, 'delete')\n  }\n\n  #delete(k: K, reason: LRUCache.DisposeReason) {\n    let deleted = false\n    if (this.#size !== 0) {\n      const index = this.#keyMap.get(k)\n      if (index !== undefined) {\n        if (this.#autopurgeTimers?.[index]) {\n          clearTimeout(this.#autopurgeTimers?.[index])\n          this.#autopurgeTimers[index] = undefined\n        }\n        deleted = true\n        if (this.#size === 1) {\n          this.#clear(reason)\n        } else {\n          this.#removeItemSize(index)\n          const v = this.#valList[index]\n          if (this.#isBackgroundFetch(v)) {\n            v.__abortController.abort(new Error('deleted'))\n          } else if (this.#hasDispose || this.#hasDisposeAfter) {\n            if (this.#hasDispose) {\n              this.#dispose?.(v as V, k, reason)\n            }\n            if (this.#hasDisposeAfter) {\n              this.#disposed?.push([v as V, k, reason])\n            }\n          }\n          this.#keyMap.delete(k)\n          this.#keyList[index] = undefined\n          this.#valList[index] = undefined\n          if (index === this.#tail) {\n            this.#tail = this.#prev[index] as Index\n          } else if (index === this.#head) {\n            this.#head = this.#next[index] as Index\n          } else {\n            const pi = this.#prev[index] as number\n            this.#next[pi] = this.#next[index] as number\n            const ni = this.#next[index] as number\n            this.#prev[ni] = this.#prev[index] as number\n          }\n          this.#size--\n          this.#free.push(index)\n        }\n      }\n    }\n    if (this.#hasDisposeAfter && this.#disposed?.length) {\n      const dt = this.#disposed\n      let task: DisposeTask<K, V> | undefined\n      while ((task = dt?.shift())) {\n        this.#disposeAfter?.(...task)\n      }\n    }\n    return deleted\n  }\n\n  /**\n   * Clear the cache entirely, throwing away all values.\n   */\n  clear() {\n    return this.#clear('delete')\n  }\n  #clear(reason: LRUCache.DisposeReason) {\n    for (const index of this.#rindexes({ allowStale: true })) {\n      const v = this.#valList[index]\n      if (this.#isBackgroundFetch(v)) {\n        v.__abortController.abort(new Error('deleted'))\n      } else {\n        const k = this.#keyList[index]\n        if (this.#hasDispose) {\n          this.#dispose?.(v as V, k as K, reason)\n        }\n        if (this.#hasDisposeAfter) {\n          this.#disposed?.push([v as V, k as K, reason])\n        }\n      }\n    }\n\n    this.#keyMap.clear()\n    this.#valList.fill(undefined)\n    this.#keyList.fill(undefined)\n    if (this.#ttls && this.#starts) {\n      this.#ttls.fill(0)\n      this.#starts.fill(0)\n      for (const t of this.#autopurgeTimers ?? []) {\n        if (t !== undefined) clearTimeout(t)\n      }\n      this.#autopurgeTimers?.fill(undefined)\n    }\n    if (this.#sizes) {\n      this.#sizes.fill(0)\n    }\n    this.#head = 0 as Index\n    this.#tail = 0 as Index\n    this.#free.length = 0\n    this.#calculatedSize = 0\n    this.#size = 0\n    if (this.#hasDisposeAfter && this.#disposed) {\n      const dt = this.#disposed\n      let task: DisposeTask<K, V> | undefined\n      while ((task = dt?.shift())) {\n        this.#disposeAfter?.(...task)\n      }\n    }\n  }\n}\n", "import { LRUCache } from 'lru-cache'\nimport { posix, win32 } from 'node:path'\n\nimport { fileURLToPath } from 'node:url'\n\nimport {\n  lstatSync,\n  readdir as readdirCB,\n  readdirSync,\n  readlinkSync,\n  realpathSync as rps,\n} from 'fs'\nimport * as actualFS from 'node:fs'\n\nconst realpathSync = rps.native\n// TODO: test perf of fs/promises realpath vs realpathCB,\n// since the promises one uses realpath.native\n\nimport { lstat, readdir, readlink, realpath } from 'node:fs/promises'\n\nimport { Minipass } from 'minipass'\nimport type { Dirent, Stats } from 'node:fs'\n\n/**\n * An object that will be used to override the default `fs`\n * methods.  Any methods that are not overridden will use Node's\n * built-in implementations.\n *\n * - lstatSync\n * - readdir (callback `withFileTypes` Dirent variant, used for\n *   readdirCB and most walks)\n * - readdirSync\n * - readlinkSync\n * - realpathSync\n * - promises: Object containing the following async methods:\n *   - lstat\n *   - readdir (Dirent variant only)\n *   - readlink\n *   - realpath\n */\nexport interface FSOption {\n  lstatSync?: (path: string) => Stats\n  readdir?: (\n    path: string,\n    options: { withFileTypes: true },\n    cb: (er: NodeJS.ErrnoException | null, entries?: Dirent[]) => any,\n  ) => void\n  readdirSync?: (\n    path: string,\n    options: { withFileTypes: true },\n  ) => Dirent[]\n  readlinkSync?: (path: string) => string\n  realpathSync?: (path: string) => string\n  promises?: {\n    lstat?: (path: string) => Promise<Stats>\n    readdir?: (\n      path: string,\n      options: { withFileTypes: true },\n    ) => Promise<Dirent[]>\n    readlink?: (path: string) => Promise<string>\n    realpath?: (path: string) => Promise<string>\n    [k: string]: any\n  }\n  [k: string]: any\n}\n\ninterface FSValue {\n  lstatSync: (path: string) => Stats\n  readdir: (\n    path: string,\n    options: { withFileTypes: true },\n    cb: (er: NodeJS.ErrnoException | null, entries?: Dirent[]) => any,\n  ) => void\n  readdirSync: (path: string, options: { withFileTypes: true }) => Dirent[]\n  readlinkSync: (path: string) => string\n  realpathSync: (path: string) => string\n  promises: {\n    lstat: (path: string) => Promise<Stats>\n    readdir: (\n      path: string,\n      options: { withFileTypes: true },\n    ) => Promise<Dirent[]>\n    readlink: (path: string) => Promise<string>\n    realpath: (path: string) => Promise<string>\n    [k: string]: any\n  }\n  [k: string]: any\n}\n\nconst defaultFS: FSValue = {\n  lstatSync,\n  readdir: readdirCB,\n  readdirSync,\n  readlinkSync,\n  realpathSync,\n  promises: {\n    lstat,\n    readdir,\n    readlink,\n    realpath,\n  },\n}\n\n// if they just gave us require('fs') then use our default\nconst fsFromOption = (fsOption?: FSOption): FSValue =>\n  !fsOption || fsOption === defaultFS || fsOption === actualFS ?\n    defaultFS\n  : {\n      ...defaultFS,\n      ...fsOption,\n      promises: {\n        ...defaultFS.promises,\n        ...(fsOption.promises || {}),\n      },\n    }\n\n// turn something like //?/c:/ into c:\\\nconst uncDriveRegexp = /^\\\\\\\\\\?\\\\([a-z]:)\\\\?$/i\nconst uncToDrive = (rootPath: string): string =>\n  rootPath.replace(/\\//g, '\\\\').replace(uncDriveRegexp, '$1\\\\')\n\n// windows paths are separated by either / or \\\nconst eitherSep = /[\\\\\\/]/\n\nconst UNKNOWN = 0 // may not even exist, for all we know\nconst IFIFO = 0b0001\nconst IFCHR = 0b0010\nconst IFDIR = 0b0100\nconst IFBLK = 0b0110\nconst IFREG = 0b1000\nconst IFLNK = 0b1010\nconst IFSOCK = 0b1100\nconst IFMT = 0b1111\n\nexport type Type =\n  | 'Unknown'\n  | 'FIFO'\n  | 'CharacterDevice'\n  | 'Directory'\n  | 'BlockDevice'\n  | 'File'\n  | 'SymbolicLink'\n  | 'Socket'\n\n// mask to unset low 4 bits\nconst IFMT_UNKNOWN = ~IFMT\n\n// set after successfully calling readdir() and getting entries.\nconst READDIR_CALLED = 0b0000_0001_0000\n// set after a successful lstat()\nconst LSTAT_CALLED = 0b0000_0010_0000\n// set if an entry (or one of its parents) is definitely not a dir\nconst ENOTDIR = 0b0000_0100_0000\n// set if an entry (or one of its parents) does not exist\n// (can also be set on lstat errors like EACCES or ENAMETOOLONG)\nconst ENOENT = 0b0000_1000_0000\n// cannot have child entries -- also verify &IFMT is either IFDIR or IFLNK\n// set if we fail to readlink\nconst ENOREADLINK = 0b0001_0000_0000\n// set if we know realpath() will fail\nconst ENOREALPATH = 0b0010_0000_0000\n\nconst ENOCHILD = ENOTDIR | ENOENT | ENOREALPATH\nconst TYPEMASK = 0b0011_1111_1111\n\nconst entToType = (s: Dirent | Stats) =>\n  s.isFile() ? IFREG\n  : s.isDirectory() ? IFDIR\n  : s.isSymbolicLink() ? IFLNK\n  : s.isCharacterDevice() ? IFCHR\n  : s.isBlockDevice() ? IFBLK\n  : s.isSocket() ? IFSOCK\n  : s.isFIFO() ? IFIFO\n  : UNKNOWN\n\n// normalize unicode path names\nconst normalizeCache = new LRUCache<string, string>({ max: 2 ** 12 })\nconst normalize = (s: string) => {\n  const c = normalizeCache.get(s)\n  if (c) return c\n  const n = s.normalize('NFKD')\n  normalizeCache.set(s, n)\n  return n\n}\n\nconst normalizeNocaseCache = new LRUCache<string, string>({ max: 2 ** 12 })\nconst normalizeNocase = (s: string) => {\n  const c = normalizeNocaseCache.get(s)\n  if (c) return c\n  const n = normalize(s.toLowerCase())\n  normalizeNocaseCache.set(s, n)\n  return n\n}\n\n/**\n * Options that may be provided to the Path constructor\n */\nexport interface PathOpts {\n  fullpath?: string\n  relative?: string\n  relativePosix?: string\n  parent?: PathBase\n  /**\n   * See {@link FSOption}\n   */\n  fs?: FSOption\n}\n\n/**\n * An LRUCache for storing resolved path strings or Path objects.\n * @internal\n */\nexport class ResolveCache extends LRUCache<string, string> {\n  constructor() {\n    super({ max: 256 })\n  }\n}\n\n// In order to prevent blowing out the js heap by allocating hundreds of\n// thousands of Path entries when walking extremely large trees, the \"children\"\n// in this tree are represented by storing an array of Path entries in an\n// LRUCache, indexed by the parent.  At any time, Path.children() may return an\n// empty array, indicating that it doesn't know about any of its children, and\n// thus has to rebuild that cache.  This is fine, it just means that we don't\n// benefit as much from having the cached entries, but huge directory walks\n// don't blow out the stack, and smaller ones are still as fast as possible.\n//\n//It does impose some complexity when building up the readdir data, because we\n//need to pass a reference to the children array that we started with.\n\n/**\n * an LRUCache for storing child entries.\n * @internal\n */\nexport class ChildrenCache extends LRUCache<PathBase, Children> {\n  constructor(maxSize: number = 16 * 1024) {\n    super({\n      maxSize,\n      // parent + children\n      sizeCalculation: a => a.length + 1,\n    })\n  }\n}\n\n/**\n * Array of Path objects, plus a marker indicating the first provisional entry\n *\n * @internal\n */\nexport type Children = PathBase[] & { provisional: number }\n\nconst setAsCwd = Symbol('PathScurry setAsCwd')\n\n/**\n * Path objects are sort of like a super-powered\n * {@link https://nodejs.org/docs/latest/api/fs.html#class-fsdirent fs.Dirent}\n *\n * Each one represents a single filesystem entry on disk, which may or may not\n * exist. It includes methods for reading various types of information via\n * lstat, readlink, and readdir, and caches all information to the greatest\n * degree possible.\n *\n * Note that fs operations that would normally throw will instead return an\n * \"empty\" value. This is in order to prevent excessive overhead from error\n * stack traces.\n */\nexport abstract class PathBase implements Dirent {\n  /**\n   * the basename of this path\n   *\n   * **Important**: *always* test the path name against any test string\n   * usingthe {@link isNamed} method, and not by directly comparing this\n   * string. Otherwise, unicode path strings that the system sees as identical\n   * will not be properly treated as the same path, leading to incorrect\n   * behavior and possible security issues.\n   */\n  name: string\n  /**\n   * the Path entry corresponding to the path root.\n   *\n   * @internal\n   */\n  root: PathBase\n  /**\n   * All roots found within the current PathScurry family\n   *\n   * @internal\n   */\n  roots: { [k: string]: PathBase }\n  /**\n   * a reference to the parent path, or undefined in the case of root entries\n   *\n   * @internal\n   */\n  parent?: PathBase\n  /**\n   * boolean indicating whether paths are compared case-insensitively\n   * @internal\n   */\n  nocase: boolean\n\n  /**\n   * boolean indicating that this path is the current working directory\n   * of the PathScurry collection that contains it.\n   */\n  isCWD: boolean = false\n\n  /**\n   * the string or regexp used to split paths. On posix, it is `'/'`, and on\n   * windows it is a RegExp matching either `'/'` or `'\\\\'`\n   */\n  abstract splitSep: string | RegExp\n  /**\n   * The path separator string to use when joining paths\n   */\n  abstract sep: string\n\n  // potential default fs override\n  #fs: FSValue\n\n  // Stats fields\n  #dev?: number\n  get dev() {\n    return this.#dev\n  }\n  #mode?: number\n  get mode() {\n    return this.#mode\n  }\n  #nlink?: number\n  get nlink() {\n    return this.#nlink\n  }\n  #uid?: number\n  get uid() {\n    return this.#uid\n  }\n  #gid?: number\n  get gid() {\n    return this.#gid\n  }\n  #rdev?: number\n  get rdev() {\n    return this.#rdev\n  }\n  #blksize?: number\n  get blksize() {\n    return this.#blksize\n  }\n  #ino?: number\n  get ino() {\n    return this.#ino\n  }\n  #size?: number\n  get size() {\n    return this.#size\n  }\n  #blocks?: number\n  get blocks() {\n    return this.#blocks\n  }\n  #atimeMs?: number\n  get atimeMs() {\n    return this.#atimeMs\n  }\n  #mtimeMs?: number\n  get mtimeMs() {\n    return this.#mtimeMs\n  }\n  #ctimeMs?: number\n  get ctimeMs() {\n    return this.#ctimeMs\n  }\n  #birthtimeMs?: number\n  get birthtimeMs() {\n    return this.#birthtimeMs\n  }\n  #atime?: Date\n  get atime() {\n    return this.#atime\n  }\n  #mtime?: Date\n  get mtime() {\n    return this.#mtime\n  }\n  #ctime?: Date\n  get ctime() {\n    return this.#ctime\n  }\n  #birthtime?: Date\n  get birthtime() {\n    return this.#birthtime\n  }\n\n  #matchName: string\n  #depth?: number\n  #fullpath?: string\n  #fullpathPosix?: string\n  #relative?: string\n  #relativePosix?: string\n  #type: number\n  #children: ChildrenCache\n  #linkTarget?: PathBase\n  #realpath?: PathBase\n\n  /**\n   * This property is for compatibility with the Dirent class as of\n   * Node v20, where Dirent['parentPath'] refers to the path of the\n   * directory that was passed to readdir. For root entries, it's the path\n   * to the entry itself.\n   */\n  get parentPath(): string {\n    return (this.parent || this).fullpath()\n  }\n\n  /* c8 ignore start */\n  /**\n   * Deprecated alias for Dirent['parentPath'] Somewhat counterintuitively,\n   * this property refers to the *parent* path, not the path object itself.\n   *\n   * @deprecated\n   */\n  get path(): string {\n    return this.parentPath\n  }\n  /* c8 ignore stop */\n\n  /**\n   * Do not create new Path objects directly.  They should always be accessed\n   * via the PathScurry class or other methods on the Path class.\n   *\n   * @internal\n   */\n  constructor(\n    name: string,\n    type: number = UNKNOWN,\n    root: PathBase | undefined,\n    roots: { [k: string]: PathBase },\n    nocase: boolean,\n    children: ChildrenCache,\n    opts: PathOpts,\n  ) {\n    this.name = name\n    this.#matchName = nocase ? normalizeNocase(name) : normalize(name)\n    this.#type = type & TYPEMASK\n    this.nocase = nocase\n    this.roots = roots\n    this.root = root || this\n    this.#children = children\n    this.#fullpath = opts.fullpath\n    this.#relative = opts.relative\n    this.#relativePosix = opts.relativePosix\n    this.parent = opts.parent\n    if (this.parent) {\n      this.#fs = this.parent.#fs\n    } else {\n      this.#fs = fsFromOption(opts.fs)\n    }\n  }\n\n  /**\n   * Returns the depth of the Path object from its root.\n   *\n   * For example, a path at `/foo/bar` would have a depth of 2.\n   */\n  depth(): number {\n    if (this.#depth !== undefined) return this.#depth\n    if (!this.parent) return (this.#depth = 0)\n    return (this.#depth = this.parent.depth() + 1)\n  }\n\n  /**\n   * @internal\n   */\n  abstract getRootString(path: string): string\n  /**\n   * @internal\n   */\n  abstract getRoot(rootPath: string): PathBase\n  /**\n   * @internal\n   */\n  abstract newChild(name: string, type?: number, opts?: PathOpts): PathBase\n\n  /**\n   * @internal\n   */\n  childrenCache() {\n    return this.#children\n  }\n\n  /**\n   * Get the Path object referenced by the string path, resolved from this Path\n   */\n  resolve(path?: string): PathBase {\n    if (!path) {\n      return this\n    }\n    const rootPath = this.getRootString(path)\n    const dir = path.substring(rootPath.length)\n    const dirParts = dir.split(this.splitSep)\n    const result: PathBase =\n      rootPath ?\n        this.getRoot(rootPath).#resolveParts(dirParts)\n      : this.#resolveParts(dirParts)\n    return result\n  }\n\n  #resolveParts(dirParts: string[]) {\n    let p: PathBase = this\n    for (const part of dirParts) {\n      p = p.child(part)\n    }\n    return p\n  }\n\n  /**\n   * Returns the cached children Path objects, if still available.  If they\n   * have fallen out of the cache, then returns an empty array, and resets the\n   * READDIR_CALLED bit, so that future calls to readdir() will require an fs\n   * lookup.\n   *\n   * @internal\n   */\n  children(): Children {\n    const cached = this.#children.get(this)\n    if (cached) {\n      return cached\n    }\n    const children: Children = Object.assign([], { provisional: 0 })\n    this.#children.set(this, children)\n    this.#type &= ~READDIR_CALLED\n    return children\n  }\n\n  /**\n   * Resolves a path portion and returns or creates the child Path.\n   *\n   * Returns `this` if pathPart is `''` or `'.'`, or `parent` if pathPart is\n   * `'..'`.\n   *\n   * This should not be called directly.  If `pathPart` contains any path\n   * separators, it will lead to unsafe undefined behavior.\n   *\n   * Use `Path.resolve()` instead.\n   *\n   * @internal\n   */\n  child(pathPart: string, opts?: PathOpts): PathBase {\n    if (pathPart === '' || pathPart === '.') {\n      return this\n    }\n    if (pathPart === '..') {\n      return this.parent || this\n    }\n\n    // find the child\n    const children = this.children()\n    const name =\n      this.nocase ? normalizeNocase(pathPart) : normalize(pathPart)\n    for (const p of children) {\n      if (p.#matchName === name) {\n        return p\n      }\n    }\n\n    // didn't find it, create provisional child, since it might not\n    // actually exist.  If we know the parent isn't a dir, then\n    // in fact it CAN'T exist.\n    const s = this.parent ? this.sep : ''\n    const fullpath =\n      this.#fullpath ? this.#fullpath + s + pathPart : undefined\n    const pchild = this.newChild(pathPart, UNKNOWN, {\n      ...opts,\n      parent: this,\n      fullpath,\n    })\n\n    if (!this.canReaddir()) {\n      pchild.#type |= ENOENT\n    }\n\n    // don't have to update provisional, because if we have real children,\n    // then provisional is set to children.length, otherwise a lower number\n    children.push(pchild)\n    return pchild\n  }\n\n  /**\n   * The relative path from the cwd. If it does not share an ancestor with\n   * the cwd, then this ends up being equivalent to the fullpath()\n   */\n  relative(): string {\n    if (this.isCWD) return ''\n    if (this.#relative !== undefined) {\n      return this.#relative\n    }\n    const name = this.name\n    const p = this.parent\n    if (!p) {\n      return (this.#relative = this.name)\n    }\n    const pv = p.relative()\n    return pv + (!pv || !p.parent ? '' : this.sep) + name\n  }\n\n  /**\n   * The relative path from the cwd, using / as the path separator.\n   * If it does not share an ancestor with\n   * the cwd, then this ends up being equivalent to the fullpathPosix()\n   * On posix systems, this is identical to relative().\n   */\n  relativePosix(): string {\n    if (this.sep === '/') return this.relative()\n    if (this.isCWD) return ''\n    if (this.#relativePosix !== undefined) return this.#relativePosix\n    const name = this.name\n    const p = this.parent\n    if (!p) {\n      return (this.#relativePosix = this.fullpathPosix())\n    }\n    const pv = p.relativePosix()\n    return pv + (!pv || !p.parent ? '' : '/') + name\n  }\n\n  /**\n   * The fully resolved path string for this Path entry\n   */\n  fullpath(): string {\n    if (this.#fullpath !== undefined) {\n      return this.#fullpath\n    }\n    const name = this.name\n    const p = this.parent\n    if (!p) {\n      return (this.#fullpath = this.name)\n    }\n    const pv = p.fullpath()\n    const fp = pv + (!p.parent ? '' : this.sep) + name\n    return (this.#fullpath = fp)\n  }\n\n  /**\n   * On platforms other than windows, this is identical to fullpath.\n   *\n   * On windows, this is overridden to return the forward-slash form of the\n   * full UNC path.\n   */\n  fullpathPosix(): string {\n    if (this.#fullpathPosix !== undefined) return this.#fullpathPosix\n    if (this.sep === '/') return (this.#fullpathPosix = this.fullpath())\n    if (!this.parent) {\n      const p = this.fullpath().replace(/\\\\/g, '/')\n      if (/^[a-z]:\\//i.test(p)) {\n        return (this.#fullpathPosix = `//?/${p}`)\n      } else {\n        return (this.#fullpathPosix = p)\n      }\n    }\n    const p = this.parent\n    const pfpp = p.fullpathPosix()\n    const fpp = pfpp + (!pfpp || !p.parent ? '' : '/') + this.name\n    return (this.#fullpathPosix = fpp)\n  }\n\n  /**\n   * Is the Path of an unknown type?\n   *\n   * Note that we might know *something* about it if there has been a previous\n   * filesystem operation, for example that it does not exist, or is not a\n   * link, or whether it has child entries.\n   */\n  isUnknown(): boolean {\n    return (this.#type & IFMT) === UNKNOWN\n  }\n\n  isType(type: Type): boolean {\n    return this[`is${type}`]()\n  }\n\n  getType(): Type {\n    return (\n      this.isUnknown() ? 'Unknown'\n      : this.isDirectory() ? 'Directory'\n      : this.isFile() ? 'File'\n      : this.isSymbolicLink() ? 'SymbolicLink'\n      : this.isFIFO() ? 'FIFO'\n      : this.isCharacterDevice() ? 'CharacterDevice'\n      : this.isBlockDevice() ? 'BlockDevice'\n      : /* c8 ignore start */ this.isSocket() ? 'Socket'\n      : 'Unknown'\n    )\n    /* c8 ignore stop */\n  }\n\n  /**\n   * Is the Path a regular file?\n   */\n  isFile(): boolean {\n    return (this.#type & IFMT) === IFREG\n  }\n\n  /**\n   * Is the Path a directory?\n   */\n  isDirectory(): boolean {\n    return (this.#type & IFMT) === IFDIR\n  }\n\n  /**\n   * Is the path a character device?\n   */\n  isCharacterDevice(): boolean {\n    return (this.#type & IFMT) === IFCHR\n  }\n\n  /**\n   * Is the path a block device?\n   */\n  isBlockDevice(): boolean {\n    return (this.#type & IFMT) === IFBLK\n  }\n\n  /**\n   * Is the path a FIFO pipe?\n   */\n  isFIFO(): boolean {\n    return (this.#type & IFMT) === IFIFO\n  }\n\n  /**\n   * Is the path a socket?\n   */\n  isSocket(): boolean {\n    return (this.#type & IFMT) === IFSOCK\n  }\n\n  /**\n   * Is the path a symbolic link?\n   */\n  isSymbolicLink(): boolean {\n    return (this.#type & IFLNK) === IFLNK\n  }\n\n  /**\n   * Return the entry if it has been subject of a successful lstat, or\n   * undefined otherwise.\n   *\n   * Does not read the filesystem, so an undefined result *could* simply\n   * mean that we haven't called lstat on it.\n   */\n  lstatCached(): PathBase | undefined {\n    return this.#type & LSTAT_CALLED ? this : undefined\n  }\n\n  /**\n   * Return the cached link target if the entry has been the subject of a\n   * successful readlink, or undefined otherwise.\n   *\n   * Does not read the filesystem, so an undefined result *could* just mean we\n   * don't have any cached data. Only use it if you are very sure that a\n   * readlink() has been called at some point.\n   */\n  readlinkCached(): PathBase | undefined {\n    return this.#linkTarget\n  }\n\n  /**\n   * Returns the cached realpath target if the entry has been the subject\n   * of a successful realpath, or undefined otherwise.\n   *\n   * Does not read the filesystem, so an undefined result *could* just mean we\n   * don't have any cached data. Only use it if you are very sure that a\n   * realpath() has been called at some point.\n   */\n  realpathCached(): PathBase | undefined {\n    return this.#realpath\n  }\n\n  /**\n   * Returns the cached child Path entries array if the entry has been the\n   * subject of a successful readdir(), or [] otherwise.\n   *\n   * Does not read the filesystem, so an empty array *could* just mean we\n   * don't have any cached data. Only use it if you are very sure that a\n   * readdir() has been called recently enough to still be valid.\n   */\n  readdirCached(): PathBase[] {\n    const children = this.children()\n    return children.slice(0, children.provisional)\n  }\n\n  /**\n   * Return true if it's worth trying to readlink.  Ie, we don't (yet) have\n   * any indication that readlink will definitely fail.\n   *\n   * Returns false if the path is known to not be a symlink, if a previous\n   * readlink failed, or if the entry does not exist.\n   */\n  canReadlink(): boolean {\n    if (this.#linkTarget) return true\n    if (!this.parent) return false\n    // cases where it cannot possibly succeed\n    const ifmt = this.#type & IFMT\n    return !(\n      (ifmt !== UNKNOWN && ifmt !== IFLNK) ||\n      this.#type & ENOREADLINK ||\n      this.#type & ENOENT\n    )\n  }\n\n  /**\n   * Return true if readdir has previously been successfully called on this\n   * path, indicating that cachedReaddir() is likely valid.\n   */\n  calledReaddir(): boolean {\n    return !!(this.#type & READDIR_CALLED)\n  }\n\n  /**\n   * Returns true if the path is known to not exist. That is, a previous lstat\n   * or readdir failed to verify its existence when that would have been\n   * expected, or a parent entry was marked either enoent or enotdir.\n   */\n  isENOENT(): boolean {\n    return !!(this.#type & ENOENT)\n  }\n\n  /**\n   * Return true if the path is a match for the given path name.  This handles\n   * case sensitivity and unicode normalization.\n   *\n   * Note: even on case-sensitive systems, it is **not** safe to test the\n   * equality of the `.name` property to determine whether a given pathname\n   * matches, due to unicode normalization mismatches.\n   *\n   * Always use this method instead of testing the `path.name` property\n   * directly.\n   */\n  isNamed(n: string): boolean {\n    return !this.nocase ?\n        this.#matchName === normalize(n)\n      : this.#matchName === normalizeNocase(n)\n  }\n\n  /**\n   * Return the Path object corresponding to the target of a symbolic link.\n   *\n   * If the Path is not a symbolic link, or if the readlink call fails for any\n   * reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   */\n  async readlink(): Promise<PathBase | undefined> {\n    const target = this.#linkTarget\n    if (target) {\n      return target\n    }\n    if (!this.canReadlink()) {\n      return undefined\n    }\n    /* c8 ignore start */\n    // already covered by the canReadlink test, here for ts grumples\n    if (!this.parent) {\n      return undefined\n    }\n    /* c8 ignore stop */\n    try {\n      const read = await this.#fs.promises.readlink(this.fullpath())\n      const linkTarget = (await this.parent.realpath())?.resolve(read)\n      if (linkTarget) {\n        return (this.#linkTarget = linkTarget)\n      }\n    } catch (er) {\n      this.#readlinkFail((er as NodeJS.ErrnoException).code)\n      return undefined\n    }\n  }\n\n  /**\n   * Synchronous {@link PathBase.readlink}\n   */\n  readlinkSync(): PathBase | undefined {\n    const target = this.#linkTarget\n    if (target) {\n      return target\n    }\n    if (!this.canReadlink()) {\n      return undefined\n    }\n    /* c8 ignore start */\n    // already covered by the canReadlink test, here for ts grumples\n    if (!this.parent) {\n      return undefined\n    }\n    /* c8 ignore stop */\n    try {\n      const read = this.#fs.readlinkSync(this.fullpath())\n      const linkTarget = this.parent.realpathSync()?.resolve(read)\n      if (linkTarget) {\n        return (this.#linkTarget = linkTarget)\n      }\n    } catch (er) {\n      this.#readlinkFail((er as NodeJS.ErrnoException).code)\n      return undefined\n    }\n  }\n\n  #readdirSuccess(children: Children) {\n    // succeeded, mark readdir called bit\n    this.#type |= READDIR_CALLED\n    // mark all remaining provisional children as ENOENT\n    for (let p = children.provisional; p < children.length; p++) {\n      const c = children[p]\n      if (c) c.#markENOENT()\n    }\n  }\n\n  #markENOENT() {\n    // mark as UNKNOWN and ENOENT\n    if (this.#type & ENOENT) return\n    this.#type = (this.#type | ENOENT) & IFMT_UNKNOWN\n    this.#markChildrenENOENT()\n  }\n\n  #markChildrenENOENT() {\n    // all children are provisional and do not exist\n    const children = this.children()\n    children.provisional = 0\n    for (const p of children) {\n      p.#markENOENT()\n    }\n  }\n\n  #markENOREALPATH() {\n    this.#type |= ENOREALPATH\n    this.#markENOTDIR()\n  }\n\n  // save the information when we know the entry is not a dir\n  #markENOTDIR() {\n    // entry is not a directory, so any children can't exist.\n    // this *should* be impossible, since any children created\n    // after it's been marked ENOTDIR should be marked ENOENT,\n    // so it won't even get to this point.\n    /* c8 ignore start */\n    if (this.#type & ENOTDIR) return\n    /* c8 ignore stop */\n    let t = this.#type\n    // this could happen if we stat a dir, then delete it,\n    // then try to read it or one of its children.\n    if ((t & IFMT) === IFDIR) t &= IFMT_UNKNOWN\n    this.#type = t | ENOTDIR\n    this.#markChildrenENOENT()\n  }\n\n  #readdirFail(code: string = '') {\n    // markENOTDIR and markENOENT also set provisional=0\n    if (code === 'ENOTDIR' || code === 'EPERM') {\n      this.#markENOTDIR()\n    } else if (code === 'ENOENT') {\n      this.#markENOENT()\n    } else {\n      this.children().provisional = 0\n    }\n  }\n\n  #lstatFail(code: string = '') {\n    // Windows just raises ENOENT in this case, disable for win CI\n    /* c8 ignore start */\n    if (code === 'ENOTDIR') {\n      // already know it has a parent by this point\n      const p = this.parent as PathBase\n      p.#markENOTDIR()\n    } else if (code === 'ENOENT') {\n      /* c8 ignore stop */\n      this.#markENOENT()\n    }\n  }\n\n  #readlinkFail(code: string = '') {\n    let ter = this.#type\n    ter |= ENOREADLINK\n    if (code === 'ENOENT') ter |= ENOENT\n    // windows gets a weird error when you try to readlink a file\n    if (code === 'EINVAL' || code === 'UNKNOWN') {\n      // exists, but not a symlink, we don't know WHAT it is, so remove\n      // all IFMT bits.\n      ter &= IFMT_UNKNOWN\n    }\n    this.#type = ter\n    // windows just gets ENOENT in this case.  We do cover the case,\n    // just disabled because it's impossible on Windows CI\n    /* c8 ignore start */\n    if (code === 'ENOTDIR' && this.parent) {\n      this.parent.#markENOTDIR()\n    }\n    /* c8 ignore stop */\n  }\n\n  #readdirAddChild(e: Dirent, c: Children) {\n    return (\n      this.#readdirMaybePromoteChild(e, c) ||\n      this.#readdirAddNewChild(e, c)\n    )\n  }\n\n  #readdirAddNewChild(e: Dirent, c: Children): PathBase {\n    // alloc new entry at head, so it's never provisional\n    const type = entToType(e)\n    const child = this.newChild(e.name, type, { parent: this })\n    const ifmt = child.#type & IFMT\n    if (ifmt !== IFDIR && ifmt !== IFLNK && ifmt !== UNKNOWN) {\n      child.#type |= ENOTDIR\n    }\n    c.unshift(child)\n    c.provisional++\n    return child\n  }\n\n  #readdirMaybePromoteChild(e: Dirent, c: Children): PathBase | undefined {\n    for (let p = c.provisional; p < c.length; p++) {\n      const pchild = c[p]\n      const name =\n        this.nocase ? normalizeNocase(e.name) : normalize(e.name)\n      if (name !== pchild!.#matchName) {\n        continue\n      }\n\n      return this.#readdirPromoteChild(e, pchild!, p, c)\n    }\n  }\n\n  #readdirPromoteChild(\n    e: Dirent,\n    p: PathBase,\n    index: number,\n    c: Children,\n  ): PathBase {\n    const v = p.name\n    // retain any other flags, but set ifmt from dirent\n    p.#type = (p.#type & IFMT_UNKNOWN) | entToType(e)\n    // case sensitivity fixing when we learn the true name.\n    if (v !== e.name) p.name = e.name\n\n    // just advance provisional index (potentially off the list),\n    // otherwise we have to splice/pop it out and re-insert at head\n    if (index !== c.provisional) {\n      if (index === c.length - 1) c.pop()\n      else c.splice(index, 1)\n      c.unshift(p)\n    }\n    c.provisional++\n    return p\n  }\n\n  /**\n   * Call lstat() on this Path, and update all known information that can be\n   * determined.\n   *\n   * Note that unlike `fs.lstat()`, the returned value does not contain some\n   * information, such as `mode`, `dev`, `nlink`, and `ino`.  If that\n   * information is required, you will need to call `fs.lstat` yourself.\n   *\n   * If the Path refers to a nonexistent file, or if the lstat call fails for\n   * any reason, `undefined` is returned.  Otherwise the updated Path object is\n   * returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   */\n  async lstat(): Promise<PathBase | undefined> {\n    if ((this.#type & ENOENT) === 0) {\n      try {\n        this.#applyStat(await this.#fs.promises.lstat(this.fullpath()))\n        return this\n      } catch (er) {\n        this.#lstatFail((er as NodeJS.ErrnoException).code)\n      }\n    }\n  }\n\n  /**\n   * synchronous {@link PathBase.lstat}\n   */\n  lstatSync(): PathBase | undefined {\n    if ((this.#type & ENOENT) === 0) {\n      try {\n        this.#applyStat(this.#fs.lstatSync(this.fullpath()))\n        return this\n      } catch (er) {\n        this.#lstatFail((er as NodeJS.ErrnoException).code)\n      }\n    }\n  }\n\n  #applyStat(st: Stats) {\n    const {\n      atime,\n      atimeMs,\n      birthtime,\n      birthtimeMs,\n      blksize,\n      blocks,\n      ctime,\n      ctimeMs,\n      dev,\n      gid,\n      ino,\n      mode,\n      mtime,\n      mtimeMs,\n      nlink,\n      rdev,\n      size,\n      uid,\n    } = st\n    this.#atime = atime\n    this.#atimeMs = atimeMs\n    this.#birthtime = birthtime\n    this.#birthtimeMs = birthtimeMs\n    this.#blksize = blksize\n    this.#blocks = blocks\n    this.#ctime = ctime\n    this.#ctimeMs = ctimeMs\n    this.#dev = dev\n    this.#gid = gid\n    this.#ino = ino\n    this.#mode = mode\n    this.#mtime = mtime\n    this.#mtimeMs = mtimeMs\n    this.#nlink = nlink\n    this.#rdev = rdev\n    this.#size = size\n    this.#uid = uid\n    const ifmt = entToType(st)\n    // retain any other flags, but set the ifmt\n    this.#type = (this.#type & IFMT_UNKNOWN) | ifmt | LSTAT_CALLED\n    if (ifmt !== UNKNOWN && ifmt !== IFDIR && ifmt !== IFLNK) {\n      this.#type |= ENOTDIR\n    }\n  }\n\n  #onReaddirCB: ((\n    er: NodeJS.ErrnoException | null,\n    entries: Path[],\n  ) => any)[] = []\n  #readdirCBInFlight: boolean = false\n  #callOnReaddirCB(children: Path[]) {\n    this.#readdirCBInFlight = false\n    const cbs = this.#onReaddirCB.slice()\n    this.#onReaddirCB.length = 0\n    cbs.forEach(cb => cb(null, children))\n  }\n\n  /**\n   * Standard node-style callback interface to get list of directory entries.\n   *\n   * If the Path cannot or does not contain any children, then an empty array\n   * is returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   *\n   * @param cb The callback called with (er, entries).  Note that the `er`\n   * param is somewhat extraneous, as all readdir() errors are handled and\n   * simply result in an empty set of entries being returned.\n   * @param allowZalgo Boolean indicating that immediately known results should\n   * *not* be deferred with `queueMicrotask`. Defaults to `false`. Release\n   * zalgo at your peril, the dark pony lord is devious and unforgiving.\n   */\n  readdirCB(\n    cb: (er: NodeJS.ErrnoException | null, entries: PathBase[]) => any,\n    allowZalgo: boolean = false,\n  ): void {\n    if (!this.canReaddir()) {\n      if (allowZalgo) cb(null, [])\n      else queueMicrotask(() => cb(null, []))\n      return\n    }\n\n    const children = this.children()\n    if (this.calledReaddir()) {\n      const c = children.slice(0, children.provisional)\n      if (allowZalgo) cb(null, c)\n      else queueMicrotask(() => cb(null, c))\n      return\n    }\n\n    // don't have to worry about zalgo at this point.\n    this.#onReaddirCB.push(cb)\n    if (this.#readdirCBInFlight) {\n      return\n    }\n    this.#readdirCBInFlight = true\n\n    // else read the directory, fill up children\n    // de-provisionalize any provisional children.\n    const fullpath = this.fullpath()\n    this.#fs.readdir(fullpath, { withFileTypes: true }, (er, entries) => {\n      if (er) {\n        this.#readdirFail((er as NodeJS.ErrnoException).code)\n        children.provisional = 0\n      } else {\n        // if we didn't get an error, we always get entries.\n        //@ts-ignore\n        for (const e of entries) {\n          this.#readdirAddChild(e, children)\n        }\n        this.#readdirSuccess(children)\n      }\n      this.#callOnReaddirCB(children.slice(0, children.provisional))\n      return\n    })\n  }\n\n  #asyncReaddirInFlight?: Promise<void>\n\n  /**\n   * Return an array of known child entries.\n   *\n   * If the Path cannot or does not contain any children, then an empty array\n   * is returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   */\n  async readdir(): Promise<PathBase[]> {\n    if (!this.canReaddir()) {\n      return []\n    }\n\n    const children = this.children()\n    if (this.calledReaddir()) {\n      return children.slice(0, children.provisional)\n    }\n\n    // else read the directory, fill up children\n    // de-provisionalize any provisional children.\n    const fullpath = this.fullpath()\n    if (this.#asyncReaddirInFlight) {\n      await this.#asyncReaddirInFlight\n    } else {\n      /* c8 ignore start */\n      let resolve: () => void = () => {}\n      /* c8 ignore stop */\n      this.#asyncReaddirInFlight = new Promise<void>(\n        res => (resolve = res),\n      )\n      try {\n        for (const e of await this.#fs.promises.readdir(fullpath, {\n          withFileTypes: true,\n        })) {\n          this.#readdirAddChild(e, children)\n        }\n        this.#readdirSuccess(children)\n      } catch (er) {\n        this.#readdirFail((er as NodeJS.ErrnoException).code)\n        children.provisional = 0\n      }\n      this.#asyncReaddirInFlight = undefined\n      resolve()\n    }\n    return children.slice(0, children.provisional)\n  }\n\n  /**\n   * synchronous {@link PathBase.readdir}\n   */\n  readdirSync(): PathBase[] {\n    if (!this.canReaddir()) {\n      return []\n    }\n\n    const children = this.children()\n    if (this.calledReaddir()) {\n      return children.slice(0, children.provisional)\n    }\n\n    // else read the directory, fill up children\n    // de-provisionalize any provisional children.\n    const fullpath = this.fullpath()\n    try {\n      for (const e of this.#fs.readdirSync(fullpath, {\n        withFileTypes: true,\n      })) {\n        this.#readdirAddChild(e, children)\n      }\n      this.#readdirSuccess(children)\n    } catch (er) {\n      this.#readdirFail((er as NodeJS.ErrnoException).code)\n      children.provisional = 0\n    }\n    return children.slice(0, children.provisional)\n  }\n\n  canReaddir() {\n    if (this.#type & ENOCHILD) return false\n    const ifmt = IFMT & this.#type\n    // we always set ENOTDIR when setting IFMT, so should be impossible\n    /* c8 ignore start */\n    if (!(ifmt === UNKNOWN || ifmt === IFDIR || ifmt === IFLNK)) {\n      return false\n    }\n    /* c8 ignore stop */\n    return true\n  }\n\n  shouldWalk(\n    dirs: Set<PathBase | undefined>,\n    walkFilter?: (e: PathBase) => boolean,\n  ): boolean {\n    return (\n      (this.#type & IFDIR) === IFDIR &&\n      !(this.#type & ENOCHILD) &&\n      !dirs.has(this) &&\n      (!walkFilter || walkFilter(this))\n    )\n  }\n\n  /**\n   * Return the Path object corresponding to path as resolved\n   * by realpath(3).\n   *\n   * If the realpath call fails for any reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   * On success, returns a Path object.\n   */\n  async realpath(): Promise<PathBase | undefined> {\n    if (this.#realpath) return this.#realpath\n    if ((ENOREALPATH | ENOREADLINK | ENOENT) & this.#type) return undefined\n    try {\n      const rp = await this.#fs.promises.realpath(this.fullpath())\n      return (this.#realpath = this.resolve(rp))\n    } catch (_) {\n      this.#markENOREALPATH()\n    }\n  }\n\n  /**\n   * Synchronous {@link realpath}\n   */\n  realpathSync(): PathBase | undefined {\n    if (this.#realpath) return this.#realpath\n    if ((ENOREALPATH | ENOREADLINK | ENOENT) & this.#type) return undefined\n    try {\n      const rp = this.#fs.realpathSync(this.fullpath())\n      return (this.#realpath = this.resolve(rp))\n    } catch (_) {\n      this.#markENOREALPATH()\n    }\n  }\n\n  /**\n   * Internal method to mark this Path object as the scurry cwd,\n   * called by {@link PathScurry#chdir}\n   *\n   * @internal\n   */\n  [setAsCwd](oldCwd: PathBase): void {\n    if (oldCwd === this) return\n    oldCwd.isCWD = false\n    this.isCWD = true\n\n    const changed = new Set<PathBase>([])\n    let rp = []\n    let p: PathBase = this\n    while (p && p.parent) {\n      changed.add(p)\n      p.#relative = rp.join(this.sep)\n      p.#relativePosix = rp.join('/')\n      p = p.parent\n      rp.push('..')\n    }\n    // now un-memoize parents of old cwd\n    p = oldCwd\n    while (p && p.parent && !changed.has(p)) {\n      p.#relative = undefined\n      p.#relativePosix = undefined\n      p = p.parent\n    }\n  }\n}\n\n/**\n * Path class used on win32 systems\n *\n * Uses `'\\\\'` as the path separator for returned paths, either `'\\\\'` or `'/'`\n * as the path separator for parsing paths.\n */\nexport class PathWin32 extends PathBase {\n  /**\n   * Separator for generating path strings.\n   */\n  sep: '\\\\' = '\\\\'\n  /**\n   * Separator for parsing path strings.\n   */\n  splitSep: RegExp = eitherSep\n\n  /**\n   * Do not create new Path objects directly.  They should always be accessed\n   * via the PathScurry class or other methods on the Path class.\n   *\n   * @internal\n   */\n  constructor(\n    name: string,\n    type: number = UNKNOWN,\n    root: PathBase | undefined,\n    roots: { [k: string]: PathBase },\n    nocase: boolean,\n    children: ChildrenCache,\n    opts: PathOpts,\n  ) {\n    super(name, type, root, roots, nocase, children, opts)\n  }\n\n  /**\n   * @internal\n   */\n  newChild(name: string, type: number = UNKNOWN, opts: PathOpts = {}) {\n    return new PathWin32(\n      name,\n      type,\n      this.root,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      opts,\n    )\n  }\n\n  /**\n   * @internal\n   */\n  getRootString(path: string): string {\n    return win32.parse(path).root\n  }\n\n  /**\n   * @internal\n   */\n  getRoot(rootPath: string): PathBase {\n    rootPath = uncToDrive(rootPath.toUpperCase())\n    if (rootPath === this.root.name) {\n      return this.root\n    }\n    // ok, not that one, check if it matches another we know about\n    for (const [compare, root] of Object.entries(this.roots)) {\n      if (this.sameRoot(rootPath, compare)) {\n        return (this.roots[rootPath] = root)\n      }\n    }\n    // otherwise, have to create a new one.\n    return (this.roots[rootPath] = new PathScurryWin32(\n      rootPath,\n      this,\n    ).root)\n  }\n\n  /**\n   * @internal\n   */\n  sameRoot(rootPath: string, compare: string = this.root.name): boolean {\n    // windows can (rarely) have case-sensitive filesystem, but\n    // UNC and drive letters are always case-insensitive, and canonically\n    // represented uppercase.\n    rootPath = rootPath\n      .toUpperCase()\n      .replace(/\\//g, '\\\\')\n      .replace(uncDriveRegexp, '$1\\\\')\n    return rootPath === compare\n  }\n}\n\n/**\n * Path class used on all posix systems.\n *\n * Uses `'/'` as the path separator.\n */\nexport class PathPosix extends PathBase {\n  /**\n   * separator for parsing path strings\n   */\n  splitSep: '/' = '/'\n  /**\n   * separator for generating path strings\n   */\n  sep: '/' = '/'\n\n  /**\n   * Do not create new Path objects directly.  They should always be accessed\n   * via the PathScurry class or other methods on the Path class.\n   *\n   * @internal\n   */\n  constructor(\n    name: string,\n    type: number = UNKNOWN,\n    root: PathBase | undefined,\n    roots: { [k: string]: PathBase },\n    nocase: boolean,\n    children: ChildrenCache,\n    opts: PathOpts,\n  ) {\n    super(name, type, root, roots, nocase, children, opts)\n  }\n\n  /**\n   * @internal\n   */\n  getRootString(path: string): string {\n    return path.startsWith('/') ? '/' : ''\n  }\n\n  /**\n   * @internal\n   */\n  getRoot(_rootPath: string): PathBase {\n    return this.root\n  }\n\n  /**\n   * @internal\n   */\n  newChild(name: string, type: number = UNKNOWN, opts: PathOpts = {}) {\n    return new PathPosix(\n      name,\n      type,\n      this.root,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      opts,\n    )\n  }\n}\n\n/**\n * Options that may be provided to the PathScurry constructor\n */\nexport interface PathScurryOpts {\n  /**\n   * perform case-insensitive path matching. Default based on platform\n   * subclass.\n   */\n  nocase?: boolean\n  /**\n   * Number of Path entries to keep in the cache of Path child references.\n   *\n   * Setting this higher than 65536 will dramatically increase the data\n   * consumption and construction time overhead of each PathScurry.\n   *\n   * Setting this value to 256 or lower will significantly reduce the data\n   * consumption and construction time overhead, but may also reduce resolve()\n   * and readdir() performance on large filesystems.\n   *\n   * Default `16384`.\n   */\n  childrenCacheSize?: number\n  /**\n   * An object that overrides the built-in functions from the fs and\n   * fs/promises modules.\n   *\n   * See {@link FSOption}\n   */\n  fs?: FSOption\n}\n\n/**\n * The base class for all PathScurry classes, providing the interface for path\n * resolution and filesystem operations.\n *\n * Typically, you should *not* instantiate this class directly, but rather one\n * of the platform-specific classes, or the exported {@link PathScurry} which\n * defaults to the current platform.\n */\nexport abstract class PathScurryBase {\n  /**\n   * The root Path entry for the current working directory of this Scurry\n   */\n  root: PathBase\n  /**\n   * The string path for the root of this Scurry's current working directory\n   */\n  rootPath: string\n  /**\n   * A collection of all roots encountered, referenced by rootPath\n   */\n  roots: { [k: string]: PathBase }\n  /**\n   * The Path entry corresponding to this PathScurry's current working directory.\n   */\n  cwd: PathBase\n  #resolveCache: ResolveCache\n  #resolvePosixCache: ResolveCache\n  #children: ChildrenCache\n  /**\n   * Perform path comparisons case-insensitively.\n   *\n   * Defaults true on Darwin and Windows systems, false elsewhere.\n   */\n  nocase: boolean\n\n  /**\n   * The path separator used for parsing paths\n   *\n   * `'/'` on Posix systems, either `'/'` or `'\\\\'` on Windows\n   */\n  abstract sep: string | RegExp\n\n  #fs: FSValue\n\n  /**\n   * This class should not be instantiated directly.\n   *\n   * Use PathScurryWin32, PathScurryDarwin, PathScurryPosix, or PathScurry\n   *\n   * @internal\n   */\n  constructor(\n    cwd: URL | string = process.cwd(),\n    pathImpl: typeof win32 | typeof posix,\n    sep: string | RegExp,\n    {\n      nocase,\n      childrenCacheSize = 16 * 1024,\n      fs = defaultFS,\n    }: PathScurryOpts = {},\n  ) {\n    this.#fs = fsFromOption(fs)\n    if (cwd instanceof URL || cwd.startsWith('file://')) {\n      cwd = fileURLToPath(cwd)\n    }\n    // resolve and split root, and then add to the store.\n    // this is the only time we call path.resolve()\n    const cwdPath = pathImpl.resolve(cwd)\n    this.roots = Object.create(null)\n    this.rootPath = this.parseRootPath(cwdPath)\n    this.#resolveCache = new ResolveCache()\n    this.#resolvePosixCache = new ResolveCache()\n    this.#children = new ChildrenCache(childrenCacheSize)\n\n    const split = cwdPath.substring(this.rootPath.length).split(sep)\n    // resolve('/') leaves '', splits to [''], we don't want that.\n    if (split.length === 1 && !split[0]) {\n      split.pop()\n    }\n    /* c8 ignore start */\n    if (nocase === undefined) {\n      throw new TypeError(\n        'must provide nocase setting to PathScurryBase ctor',\n      )\n    }\n    /* c8 ignore stop */\n    this.nocase = nocase\n    this.root = this.newRoot(this.#fs)\n    this.roots[this.rootPath] = this.root\n    let prev: PathBase = this.root\n    let len = split.length - 1\n    const joinSep = pathImpl.sep\n    let abs = this.rootPath\n    let sawFirst = false\n    for (const part of split) {\n      const l = len--\n      prev = prev.child(part, {\n        relative: new Array(l).fill('..').join(joinSep),\n        relativePosix: new Array(l).fill('..').join('/'),\n        fullpath: (abs += (sawFirst ? '' : joinSep) + part),\n      })\n      sawFirst = true\n    }\n    this.cwd = prev\n  }\n\n  /**\n   * Get the depth of a provided path, string, or the cwd\n   */\n  depth(path: Path | string = this.cwd): number {\n    if (typeof path === 'string') {\n      path = this.cwd.resolve(path)\n    }\n    return path.depth()\n  }\n\n  /**\n   * Parse the root portion of a path string\n   *\n   * @internal\n   */\n  abstract parseRootPath(dir: string): string\n  /**\n   * create a new Path to use as root during construction.\n   *\n   * @internal\n   */\n  abstract newRoot(fs: FSValue): PathBase\n  /**\n   * Determine whether a given path string is absolute\n   */\n  abstract isAbsolute(p: string): boolean\n\n  /**\n   * Return the cache of child entries.  Exposed so subclasses can create\n   * child Path objects in a platform-specific way.\n   *\n   * @internal\n   */\n  childrenCache() {\n    return this.#children\n  }\n\n  /**\n   * Resolve one or more path strings to a resolved string\n   *\n   * Same interface as require('path').resolve.\n   *\n   * Much faster than path.resolve() when called multiple times for the same\n   * path, because the resolved Path objects are cached.  Much slower\n   * otherwise.\n   */\n  resolve(...paths: string[]): string {\n    // first figure out the minimum number of paths we have to test\n    // we always start at cwd, but any absolutes will bump the start\n    let r = ''\n    for (let i = paths.length - 1; i >= 0; i--) {\n      const p = paths[i]\n      if (!p || p === '.') continue\n      r = r ? `${p}/${r}` : p\n      if (this.isAbsolute(p)) {\n        break\n      }\n    }\n    const cached = this.#resolveCache.get(r)\n    if (cached !== undefined) {\n      return cached\n    }\n    const result = this.cwd.resolve(r).fullpath()\n    this.#resolveCache.set(r, result)\n    return result\n  }\n\n  /**\n   * Resolve one or more path strings to a resolved string, returning\n   * the posix path.  Identical to .resolve() on posix systems, but on\n   * windows will return a forward-slash separated UNC path.\n   *\n   * Same interface as require('path').resolve.\n   *\n   * Much faster than path.resolve() when called multiple times for the same\n   * path, because the resolved Path objects are cached.  Much slower\n   * otherwise.\n   */\n  resolvePosix(...paths: string[]): string {\n    // first figure out the minimum number of paths we have to test\n    // we always start at cwd, but any absolutes will bump the start\n    let r = ''\n    for (let i = paths.length - 1; i >= 0; i--) {\n      const p = paths[i]\n      if (!p || p === '.') continue\n      r = r ? `${p}/${r}` : p\n      if (this.isAbsolute(p)) {\n        break\n      }\n    }\n    const cached = this.#resolvePosixCache.get(r)\n    if (cached !== undefined) {\n      return cached\n    }\n    const result = this.cwd.resolve(r).fullpathPosix()\n    this.#resolvePosixCache.set(r, result)\n    return result\n  }\n\n  /**\n   * find the relative path from the cwd to the supplied path string or entry\n   */\n  relative(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.relative()\n  }\n\n  /**\n   * find the relative path from the cwd to the supplied path string or\n   * entry, using / as the path delimiter, even on Windows.\n   */\n  relativePosix(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.relativePosix()\n  }\n\n  /**\n   * Return the basename for the provided string or Path object\n   */\n  basename(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.name\n  }\n\n  /**\n   * Return the dirname for the provided string or Path object\n   */\n  dirname(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return (entry.parent || entry).fullpath()\n  }\n\n  /**\n   * Return an array of known child entries.\n   *\n   * First argument may be either a string, or a Path object.\n   *\n   * If the Path cannot or does not contain any children, then an empty array\n   * is returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   *\n   * Unlike `fs.readdir()`, the `withFileTypes` option defaults to `true`. Set\n   * `{ withFileTypes: false }` to return strings.\n   */\n\n  readdir(): Promise<PathBase[]>\n  readdir(opts: { withFileTypes: true }): Promise<PathBase[]>\n  readdir(opts: { withFileTypes: false }): Promise<string[]>\n  readdir(opts: { withFileTypes: boolean }): Promise<PathBase[] | string[]>\n  readdir(entry: PathBase | string): Promise<PathBase[]>\n  readdir(\n    entry: PathBase | string,\n    opts: { withFileTypes: true },\n  ): Promise<PathBase[]>\n  readdir(\n    entry: PathBase | string,\n    opts: { withFileTypes: false },\n  ): Promise<string[]>\n  readdir(\n    entry: PathBase | string,\n    opts: { withFileTypes: boolean },\n  ): Promise<PathBase[] | string[]>\n  async readdir(\n    entry: PathBase | string | { withFileTypes: boolean } = this.cwd,\n    opts: { withFileTypes: boolean } = {\n      withFileTypes: true,\n    },\n  ): Promise<PathBase[] | string[]> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const { withFileTypes } = opts\n    if (!entry.canReaddir()) {\n      return []\n    } else {\n      const p = await entry.readdir()\n      return withFileTypes ? p : p.map(e => e.name)\n    }\n  }\n\n  /**\n   * synchronous {@link PathScurryBase.readdir}\n   */\n  readdirSync(): PathBase[]\n  readdirSync(opts: { withFileTypes: true }): PathBase[]\n  readdirSync(opts: { withFileTypes: false }): string[]\n  readdirSync(opts: { withFileTypes: boolean }): PathBase[] | string[]\n  readdirSync(entry: PathBase | string): PathBase[]\n  readdirSync(\n    entry: PathBase | string,\n    opts: { withFileTypes: true },\n  ): PathBase[]\n  readdirSync(\n    entry: PathBase | string,\n    opts: { withFileTypes: false },\n  ): string[]\n  readdirSync(\n    entry: PathBase | string,\n    opts: { withFileTypes: boolean },\n  ): PathBase[] | string[]\n  readdirSync(\n    entry: PathBase | string | { withFileTypes: boolean } = this.cwd,\n    opts: { withFileTypes: boolean } = {\n      withFileTypes: true,\n    },\n  ): PathBase[] | string[] {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const { withFileTypes = true } = opts\n    if (!entry.canReaddir()) {\n      return []\n    } else if (withFileTypes) {\n      return entry.readdirSync()\n    } else {\n      return entry.readdirSync().map(e => e.name)\n    }\n  }\n\n  /**\n   * Call lstat() on the string or Path object, and update all known\n   * information that can be determined.\n   *\n   * Note that unlike `fs.lstat()`, the returned value does not contain some\n   * information, such as `mode`, `dev`, `nlink`, and `ino`.  If that\n   * information is required, you will need to call `fs.lstat` yourself.\n   *\n   * If the Path refers to a nonexistent file, or if the lstat call fails for\n   * any reason, `undefined` is returned.  Otherwise the updated Path object is\n   * returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   */\n  async lstat(\n    entry: string | PathBase = this.cwd,\n  ): Promise<PathBase | undefined> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.lstat()\n  }\n\n  /**\n   * synchronous {@link PathScurryBase.lstat}\n   */\n  lstatSync(entry: string | PathBase = this.cwd): PathBase | undefined {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.lstatSync()\n  }\n\n  /**\n   * Return the Path object or string path corresponding to the target of a\n   * symbolic link.\n   *\n   * If the path is not a symbolic link, or if the readlink call fails for any\n   * reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   *\n   * `{withFileTypes}` option defaults to `false`.\n   *\n   * On success, returns a Path object if `withFileTypes` option is true,\n   * otherwise a string.\n   */\n  readlink(): Promise<string | undefined>\n  readlink(opt: { withFileTypes: false }): Promise<string | undefined>\n  readlink(opt: { withFileTypes: true }): Promise<PathBase | undefined>\n  readlink(opt: {\n    withFileTypes: boolean\n  }): Promise<PathBase | string | undefined>\n  readlink(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): Promise<string | undefined>\n  readlink(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): Promise<PathBase | undefined>\n  readlink(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): Promise<string | PathBase | undefined>\n  async readlink(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): Promise<string | PathBase | undefined> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = await entry.readlink()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  /**\n   * synchronous {@link PathScurryBase.readlink}\n   */\n  readlinkSync(): string | undefined\n  readlinkSync(opt: { withFileTypes: false }): string | undefined\n  readlinkSync(opt: { withFileTypes: true }): PathBase | undefined\n  readlinkSync(opt: {\n    withFileTypes: boolean\n  }): PathBase | string | undefined\n  readlinkSync(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): string | undefined\n  readlinkSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): PathBase | undefined\n  readlinkSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): string | PathBase | undefined\n  readlinkSync(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): string | PathBase | undefined {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = entry.readlinkSync()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  /**\n   * Return the Path object or string path corresponding to path as resolved\n   * by realpath(3).\n   *\n   * If the realpath call fails for any reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   *\n   * `{withFileTypes}` option defaults to `false`.\n   *\n   * On success, returns a Path object if `withFileTypes` option is true,\n   * otherwise a string.\n   */\n  realpath(): Promise<string | undefined>\n  realpath(opt: { withFileTypes: false }): Promise<string | undefined>\n  realpath(opt: { withFileTypes: true }): Promise<PathBase | undefined>\n  realpath(opt: {\n    withFileTypes: boolean\n  }): Promise<PathBase | string | undefined>\n  realpath(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): Promise<string | undefined>\n  realpath(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): Promise<PathBase | undefined>\n  realpath(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): Promise<string | PathBase | undefined>\n  async realpath(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): Promise<string | PathBase | undefined> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = await entry.realpath()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  realpathSync(): string | undefined\n  realpathSync(opt: { withFileTypes: false }): string | undefined\n  realpathSync(opt: { withFileTypes: true }): PathBase | undefined\n  realpathSync(opt: {\n    withFileTypes: boolean\n  }): PathBase | string | undefined\n  realpathSync(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): string | undefined\n  realpathSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): PathBase | undefined\n  realpathSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): string | PathBase | undefined\n  realpathSync(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): string | PathBase | undefined {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = entry.realpathSync()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  /**\n   * Asynchronously walk the directory tree, returning an array of\n   * all path strings or Path objects found.\n   *\n   * Note that this will be extremely memory-hungry on large filesystems.\n   * In such cases, it may be better to use the stream or async iterator\n   * walk implementation.\n   */\n  walk(): Promise<PathBase[]>\n  walk(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Promise<PathBase[]>\n  walk(opts: WalkOptionsWithFileTypesFalse): Promise<string[]>\n  walk(opts: WalkOptions): Promise<string[] | PathBase[]>\n  walk(entry: string | PathBase): Promise<PathBase[]>\n  walk(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Promise<PathBase[]>\n  walk(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Promise<string[]>\n  walk(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Promise<PathBase[] | string[]>\n  async walk(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Promise<PathBase[] | string[]> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results: (string | PathBase)[] = []\n    if (!filter || filter(entry)) {\n      results.push(withFileTypes ? entry : entry.fullpath())\n    }\n    const dirs = new Set<PathBase>()\n    const walk = (\n      dir: PathBase,\n      cb: (er?: NodeJS.ErrnoException) => void,\n    ) => {\n      dirs.add(dir)\n      dir.readdirCB((er, entries) => {\n        /* c8 ignore start */\n        if (er) {\n          return cb(er)\n        }\n        /* c8 ignore stop */\n        let len = entries.length\n        if (!len) return cb()\n        const next = () => {\n          if (--len === 0) {\n            cb()\n          }\n        }\n        for (const e of entries) {\n          if (!filter || filter(e)) {\n            results.push(withFileTypes ? e : e.fullpath())\n          }\n          if (follow && e.isSymbolicLink()) {\n            e.realpath()\n              .then(r => (r?.isUnknown() ? r.lstat() : r))\n              .then(r =>\n                r?.shouldWalk(dirs, walkFilter) ? walk(r, next) : next(),\n              )\n          } else {\n            if (e.shouldWalk(dirs, walkFilter)) {\n              walk(e, next)\n            } else {\n              next()\n            }\n          }\n        }\n      }, true) // zalgooooooo\n    }\n\n    const start = entry\n    return new Promise<PathBase[] | string[]>((res, rej) => {\n      walk(start, er => {\n        /* c8 ignore start */\n        if (er) return rej(er)\n        /* c8 ignore stop */\n        res(results as PathBase[] | string[])\n      })\n    })\n  }\n\n  /**\n   * Synchronously walk the directory tree, returning an array of\n   * all path strings or Path objects found.\n   *\n   * Note that this will be extremely memory-hungry on large filesystems.\n   * In such cases, it may be better to use the stream or async iterator\n   * walk implementation.\n   */\n  walkSync(): PathBase[]\n  walkSync(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): PathBase[]\n  walkSync(opts: WalkOptionsWithFileTypesFalse): string[]\n  walkSync(opts: WalkOptions): string[] | PathBase[]\n  walkSync(entry: string | PathBase): PathBase[]\n  walkSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesUnset | WalkOptionsWithFileTypesTrue,\n  ): PathBase[]\n  walkSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): string[]\n  walkSync(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): PathBase[] | string[]\n  walkSync(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): PathBase[] | string[] {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results: (string | PathBase)[] = []\n    if (!filter || filter(entry)) {\n      results.push(withFileTypes ? entry : entry.fullpath())\n    }\n    const dirs = new Set<PathBase>([entry])\n    for (const dir of dirs) {\n      const entries = dir.readdirSync()\n      for (const e of entries) {\n        if (!filter || filter(e)) {\n          results.push(withFileTypes ? e : e.fullpath())\n        }\n        let r: PathBase | undefined = e\n        if (e.isSymbolicLink()) {\n          if (!(follow && (r = e.realpathSync()))) continue\n          if (r.isUnknown()) r.lstatSync()\n        }\n        if (r.shouldWalk(dirs, walkFilter)) {\n          dirs.add(r)\n        }\n      }\n    }\n    return results as string[] | PathBase[]\n  }\n\n  /**\n   * Support for `for await`\n   *\n   * Alias for {@link PathScurryBase.iterate}\n   *\n   * Note: As of Node 19, this is very slow, compared to other methods of\n   * walking.  Consider using {@link PathScurryBase.stream} if memory overhead\n   * and backpressure are concerns, or {@link PathScurryBase.walk} if not.\n   */\n  [Symbol.asyncIterator]() {\n    return this.iterate()\n  }\n\n  /**\n   * Async generator form of {@link PathScurryBase.walk}\n   *\n   * Note: As of Node 19, this is very slow, compared to other methods of\n   * walking, especially if most/all of the directory tree has been previously\n   * walked.  Consider using {@link PathScurryBase.stream} if memory overhead\n   * and backpressure are concerns, or {@link PathScurryBase.walk} if not.\n   */\n  iterate(): AsyncGenerator<PathBase, void, void>\n  iterate(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): AsyncGenerator<PathBase, void, void>\n  iterate(\n    opts: WalkOptionsWithFileTypesFalse,\n  ): AsyncGenerator<string, void, void>\n  iterate(opts: WalkOptions): AsyncGenerator<string | PathBase, void, void>\n  iterate(entry: string | PathBase): AsyncGenerator<PathBase, void, void>\n  iterate(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): AsyncGenerator<PathBase, void, void>\n  iterate(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): AsyncGenerator<string, void, void>\n  iterate(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): AsyncGenerator<PathBase | string, void, void>\n  iterate(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    options: WalkOptions = {},\n  ): AsyncGenerator<PathBase | string, void, void> {\n    // iterating async over the stream is significantly more performant,\n    // especially in the warm-cache scenario, because it buffers up directory\n    // entries in the background instead of waiting for a yield for each one.\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      options = entry\n      entry = this.cwd\n    }\n    return this.stream(entry, options)[Symbol.asyncIterator]()\n  }\n\n  /**\n   * Iterating over a PathScurry performs a synchronous walk.\n   *\n   * Alias for {@link PathScurryBase.iterateSync}\n   */\n  [Symbol.iterator]() {\n    return this.iterateSync()\n  }\n\n  iterateSync(): Generator<PathBase, void, void>\n  iterateSync(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Generator<PathBase, void, void>\n  iterateSync(\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Generator<string, void, void>\n  iterateSync(opts: WalkOptions): Generator<string | PathBase, void, void>\n  iterateSync(entry: string | PathBase): Generator<PathBase, void, void>\n  iterateSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Generator<PathBase, void, void>\n  iterateSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Generator<string, void, void>\n  iterateSync(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Generator<PathBase | string, void, void>\n  *iterateSync(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Generator<PathBase | string, void, void> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    if (!filter || filter(entry)) {\n      yield withFileTypes ? entry : entry.fullpath()\n    }\n    const dirs = new Set<PathBase>([entry])\n    for (const dir of dirs) {\n      const entries = dir.readdirSync()\n      for (const e of entries) {\n        if (!filter || filter(e)) {\n          yield withFileTypes ? e : e.fullpath()\n        }\n        let r: PathBase | undefined = e\n        if (e.isSymbolicLink()) {\n          if (!(follow && (r = e.realpathSync()))) continue\n          if (r.isUnknown()) r.lstatSync()\n        }\n        if (r.shouldWalk(dirs, walkFilter)) {\n          dirs.add(r)\n        }\n      }\n    }\n  }\n\n  /**\n   * Stream form of {@link PathScurryBase.walk}\n   *\n   * Returns a Minipass stream that emits {@link PathBase} objects by default,\n   * or strings if `{ withFileTypes: false }` is set in the options.\n   */\n  stream(): Minipass<PathBase>\n  stream(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Minipass<PathBase>\n  stream(opts: WalkOptionsWithFileTypesFalse): Minipass<string>\n  stream(opts: WalkOptions): Minipass<string | PathBase>\n  stream(entry: string | PathBase): Minipass<PathBase>\n  stream(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesUnset | WalkOptionsWithFileTypesTrue,\n  ): Minipass<PathBase>\n  stream(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Minipass<string>\n  stream(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Minipass<string> | Minipass<PathBase>\n  stream(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Minipass<string> | Minipass<PathBase> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results = new Minipass<string | PathBase>({ objectMode: true })\n    if (!filter || filter(entry)) {\n      results.write(withFileTypes ? entry : entry.fullpath())\n    }\n    const dirs = new Set<PathBase>()\n    const queue: PathBase[] = [entry]\n    let processing = 0\n    const process = () => {\n      let paused = false\n      while (!paused) {\n        const dir = queue.shift()\n        if (!dir) {\n          if (processing === 0) results.end()\n          return\n        }\n\n        processing++\n        dirs.add(dir)\n\n        const onReaddir = (\n          er: null | NodeJS.ErrnoException,\n          entries: PathBase[],\n          didRealpaths: boolean = false,\n        ) => {\n          /* c8 ignore start */\n          if (er) return results.emit('error', er)\n          /* c8 ignore stop */\n          if (follow && !didRealpaths) {\n            const promises: Promise<PathBase | undefined>[] = []\n            for (const e of entries) {\n              if (e.isSymbolicLink()) {\n                promises.push(\n                  e\n                    .realpath()\n                    .then((r: PathBase | undefined) =>\n                      r?.isUnknown() ? r.lstat() : r,\n                    ),\n                )\n              }\n            }\n            if (promises.length) {\n              Promise.all(promises).then(() =>\n                onReaddir(null, entries, true),\n              )\n              return\n            }\n          }\n\n          for (const e of entries) {\n            if (e && (!filter || filter(e))) {\n              if (!results.write(withFileTypes ? e : e.fullpath())) {\n                paused = true\n              }\n            }\n          }\n\n          processing--\n          for (const e of entries) {\n            const r = e.realpathCached() || e\n            if (r.shouldWalk(dirs, walkFilter)) {\n              queue.push(r)\n            }\n          }\n          if (paused && !results.flowing) {\n            results.once('drain', process)\n          } else if (!sync) {\n            process()\n          }\n        }\n\n        // zalgo containment\n        let sync = true\n        dir.readdirCB(onReaddir, true)\n        sync = false\n      }\n    }\n    process()\n    return results as Minipass<string> | Minipass<PathBase>\n  }\n\n  /**\n   * Synchronous form of {@link PathScurryBase.stream}\n   *\n   * Returns a Minipass stream that emits {@link PathBase} objects by default,\n   * or strings if `{ withFileTypes: false }` is set in the options.\n   *\n   * Will complete the walk in a single tick if the stream is consumed fully.\n   * Otherwise, will pause as needed for stream backpressure.\n   */\n  streamSync(): Minipass<PathBase>\n  streamSync(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Minipass<PathBase>\n  streamSync(opts: WalkOptionsWithFileTypesFalse): Minipass<string>\n  streamSync(opts: WalkOptions): Minipass<string | PathBase>\n  streamSync(entry: string | PathBase): Minipass<PathBase>\n  streamSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesUnset | WalkOptionsWithFileTypesTrue,\n  ): Minipass<PathBase>\n  streamSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Minipass<string>\n  streamSync(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Minipass<string> | Minipass<PathBase>\n  streamSync(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Minipass<string> | Minipass<PathBase> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results = new Minipass<string | PathBase>({ objectMode: true })\n    const dirs = new Set<PathBase>()\n    if (!filter || filter(entry)) {\n      results.write(withFileTypes ? entry : entry.fullpath())\n    }\n    const queue: PathBase[] = [entry]\n    let processing = 0\n    const process = () => {\n      let paused = false\n      while (!paused) {\n        const dir = queue.shift()\n        if (!dir) {\n          if (processing === 0) results.end()\n          return\n        }\n        processing++\n        dirs.add(dir)\n\n        const entries = dir.readdirSync()\n        for (const e of entries) {\n          if (!filter || filter(e)) {\n            if (!results.write(withFileTypes ? e : e.fullpath())) {\n              paused = true\n            }\n          }\n        }\n        processing--\n        for (const e of entries) {\n          let r: PathBase | undefined = e\n          if (e.isSymbolicLink()) {\n            if (!(follow && (r = e.realpathSync()))) continue\n            if (r.isUnknown()) r.lstatSync()\n          }\n          if (r.shouldWalk(dirs, walkFilter)) {\n            queue.push(r)\n          }\n        }\n      }\n      if (paused && !results.flowing) results.once('drain', process)\n    }\n    process()\n    return results as Minipass<string> | Minipass<PathBase>\n  }\n\n  chdir(path: string | Path = this.cwd) {\n    const oldCwd = this.cwd\n    this.cwd = typeof path === 'string' ? this.cwd.resolve(path) : path\n    this.cwd[setAsCwd](oldCwd)\n  }\n}\n\n/**\n * Options provided to all walk methods.\n */\nexport interface WalkOptions {\n  /**\n   * Return results as {@link PathBase} objects rather than strings.\n   * When set to false, results are fully resolved paths, as returned by\n   * {@link PathBase.fullpath}.\n   * @default true\n   */\n  withFileTypes?: boolean\n\n  /**\n   *  Attempt to read directory entries from symbolic links. Otherwise, only\n   *  actual directories are traversed. Regardless of this setting, a given\n   *  target path will only ever be walked once, meaning that a symbolic link\n   *  to a previously traversed directory will never be followed.\n   *\n   *  Setting this imposes a slight performance penalty, because `readlink`\n   *  must be called on all symbolic links encountered, in order to avoid\n   *  infinite cycles.\n   * @default false\n   */\n  follow?: boolean\n\n  /**\n   * Only return entries where the provided function returns true.\n   *\n   * This will not prevent directories from being traversed, even if they do\n   * not pass the filter, though it will prevent directories themselves from\n   * being included in the result set.  See {@link walkFilter}\n   *\n   * Asynchronous functions are not supported here.\n   *\n   * By default, if no filter is provided, all entries and traversed\n   * directories are included.\n   */\n  filter?: (entry: PathBase) => boolean\n\n  /**\n   * Only traverse directories (and in the case of {@link follow} being set to\n   * true, symbolic links to directories) if the provided function returns\n   * true.\n   *\n   * This will not prevent directories from being included in the result set,\n   * even if they do not pass the supplied filter function.  See {@link filter}\n   * to do that.\n   *\n   * Asynchronous functions are not supported here.\n   */\n  walkFilter?: (entry: PathBase) => boolean\n}\n\nexport type WalkOptionsWithFileTypesUnset = WalkOptions & {\n  withFileTypes?: undefined\n}\nexport type WalkOptionsWithFileTypesTrue = WalkOptions & {\n  withFileTypes: true\n}\nexport type WalkOptionsWithFileTypesFalse = WalkOptions & {\n  withFileTypes: false\n}\n\n/**\n * Windows implementation of {@link PathScurryBase}\n *\n * Defaults to case insensitve, uses `'\\\\'` to generate path strings.  Uses\n * {@link PathWin32} for Path objects.\n */\nexport class PathScurryWin32 extends PathScurryBase {\n  /**\n   * separator for generating path strings\n   */\n  sep: '\\\\' = '\\\\'\n\n  constructor(\n    cwd: URL | string = process.cwd(),\n    opts: PathScurryOpts = {},\n  ) {\n    const { nocase = true } = opts\n    super(cwd, win32, '\\\\', { ...opts, nocase })\n    this.nocase = nocase\n    for (let p: PathBase | undefined = this.cwd; p; p = p.parent) {\n      p.nocase = this.nocase\n    }\n  }\n\n  /**\n   * @internal\n   */\n  parseRootPath(dir: string): string {\n    // if the path starts with a single separator, it's not a UNC, and we'll\n    // just get separator as the root, and driveFromUNC will return \\\n    // In that case, mount \\ on the root from the cwd.\n    return win32.parse(dir).root.toUpperCase()\n  }\n\n  /**\n   * @internal\n   */\n  newRoot(fs: FSValue) {\n    return new PathWin32(\n      this.rootPath,\n      IFDIR,\n      undefined,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      { fs },\n    )\n  }\n\n  /**\n   * Return true if the provided path string is an absolute path\n   */\n  isAbsolute(p: string): boolean {\n    return (\n      p.startsWith('/') || p.startsWith('\\\\') || /^[a-z]:(\\/|\\\\)/i.test(p)\n    )\n  }\n}\n\n/**\n * {@link PathScurryBase} implementation for all posix systems other than Darwin.\n *\n * Defaults to case-sensitive matching, uses `'/'` to generate path strings.\n *\n * Uses {@link PathPosix} for Path objects.\n */\nexport class PathScurryPosix extends PathScurryBase {\n  /**\n   * separator for generating path strings\n   */\n  sep: '/' = '/'\n  constructor(\n    cwd: URL | string = process.cwd(),\n    opts: PathScurryOpts = {},\n  ) {\n    const { nocase = false } = opts\n    super(cwd, posix, '/', { ...opts, nocase })\n    this.nocase = nocase\n  }\n\n  /**\n   * @internal\n   */\n  parseRootPath(_dir: string): string {\n    return '/'\n  }\n\n  /**\n   * @internal\n   */\n  newRoot(fs: FSValue) {\n    return new PathPosix(\n      this.rootPath,\n      IFDIR,\n      undefined,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      { fs },\n    )\n  }\n\n  /**\n   * Return true if the provided path string is an absolute path\n   */\n  isAbsolute(p: string): boolean {\n    return p.startsWith('/')\n  }\n}\n\n/**\n * {@link PathScurryBase} implementation for Darwin (macOS) systems.\n *\n * Defaults to case-insensitive matching, uses `'/'` for generating path\n * strings.\n *\n * Uses {@link PathPosix} for Path objects.\n */\nexport class PathScurryDarwin extends PathScurryPosix {\n  constructor(\n    cwd: URL | string = process.cwd(),\n    opts: PathScurryOpts = {},\n  ) {\n    const { nocase = true } = opts\n    super(cwd, { ...opts, nocase })\n  }\n}\n\n/**\n * Default {@link PathBase} implementation for the current platform.\n *\n * {@link PathWin32} on Windows systems, {@link PathPosix} on all others.\n */\nexport const Path = process.platform === 'win32' ? PathWin32 : PathPosix\nexport type Path = PathBase | InstanceType<typeof Path>\n\n/**\n * Default {@link PathScurryBase} implementation for the current platform.\n *\n * {@link PathScurryWin32} on Windows systems, {@link PathScurryDarwin} on\n * Darwin (macOS) systems, {@link PathScurryPosix} on all others.\n */\nexport const PathScurry:\n  | typeof PathScurryWin32\n  | typeof PathScurryDarwin\n  | typeof PathScurryPosix =\n  process.platform === 'win32' ? PathScurryWin32\n  : process.platform === 'darwin' ? PathScurryDarwin\n  : PathScurryPosix\nexport type PathScurry = PathScurryBase | InstanceType<typeof PathScurry>\n", "const proc =\n  typeof process === 'object' && process\n    ? process\n    : {\n        stdout: null,\n        stderr: null,\n      }\nimport { EventEmitter } from 'node:events'\nimport Stream from 'node:stream'\nimport { StringDecoder } from 'node:string_decoder'\n\n/**\n * Same as StringDecoder, but exposing the `lastNeed` flag on the type\n */\ntype SD = StringDecoder & { lastNeed: boolean }\n\nexport type { SD, Pipe, PipeProxyErrors }\n\n/**\n * Return true if the argument is a Minipass stream, Node stream, or something\n * else that Minipass can interact with.\n */\nexport const isStream = (\n  s: any\n): s is Minipass.Readable | Minipass.Writable =>\n  !!s &&\n  typeof s === 'object' &&\n  (s instanceof Minipass ||\n    s instanceof Stream ||\n    isReadable(s) ||\n    isWritable(s))\n\n/**\n * Return true if the argument is a valid {@link Minipass.Readable}\n */\nexport const isReadable = (s: any): s is Minipass.Readable =>\n  !!s &&\n  typeof s === 'object' &&\n  s instanceof EventEmitter &&\n  typeof (s as Minipass.Readable).pipe === 'function' &&\n  // node core Writable streams have a pipe() method, but it throws\n  (s as Minipass.Readable).pipe !== Stream.Writable.prototype.pipe\n\n/**\n * Return true if the argument is a valid {@link Minipass.Writable}\n */\nexport const isWritable = (s: any): s is Minipass.Readable =>\n  !!s &&\n  typeof s === 'object' &&\n  s instanceof EventEmitter &&\n  typeof (s as Minipass.Writable).write === 'function' &&\n  typeof (s as Minipass.Writable).end === 'function'\n\nconst EOF = Symbol('EOF')\nconst MAYBE_EMIT_END = Symbol('maybeEmitEnd')\nconst EMITTED_END = Symbol('emittedEnd')\nconst EMITTING_END = Symbol('emittingEnd')\nconst EMITTED_ERROR = Symbol('emittedError')\nconst CLOSED = Symbol('closed')\nconst READ = Symbol('read')\nconst FLUSH = Symbol('flush')\nconst FLUSHCHUNK = Symbol('flushChunk')\nconst ENCODING = Symbol('encoding')\nconst DECODER = Symbol('decoder')\nconst FLOWING = Symbol('flowing')\nconst PAUSED = Symbol('paused')\nconst RESUME = Symbol('resume')\nconst BUFFER = Symbol('buffer')\nconst PIPES = Symbol('pipes')\nconst BUFFERLENGTH = Symbol('bufferLength')\nconst BUFFERPUSH = Symbol('bufferPush')\nconst BUFFERSHIFT = Symbol('bufferShift')\nconst OBJECTMODE = Symbol('objectMode')\n// internal event when stream is destroyed\nconst DESTROYED = Symbol('destroyed')\n// internal event when stream has an error\nconst ERROR = Symbol('error')\nconst EMITDATA = Symbol('emitData')\nconst EMITEND = Symbol('emitEnd')\nconst EMITEND2 = Symbol('emitEnd2')\nconst ASYNC = Symbol('async')\nconst ABORT = Symbol('abort')\nconst ABORTED = Symbol('aborted')\nconst SIGNAL = Symbol('signal')\nconst DATALISTENERS = Symbol('dataListeners')\nconst DISCARDED = Symbol('discarded')\n\nconst defer = (fn: (...a: any[]) => any) => Promise.resolve().then(fn)\nconst nodefer = (fn: (...a: any[]) => any) => fn()\n\n// events that mean 'the stream is over'\n// these are treated specially, and re-emitted\n// if they are listened for after emitting.\ntype EndishEvent = 'end' | 'finish' | 'prefinish'\nconst isEndish = (ev: any): ev is EndishEvent =>\n  ev === 'end' || ev === 'finish' || ev === 'prefinish'\n\nconst isArrayBufferLike = (b: any): b is ArrayBufferLike =>\n  b instanceof ArrayBuffer ||\n  (!!b &&\n    typeof b === 'object' &&\n    b.constructor &&\n    b.constructor.name === 'ArrayBuffer' &&\n    b.byteLength >= 0)\n\nconst isArrayBufferView = (b: any): b is ArrayBufferView =>\n  !Buffer.isBuffer(b) && ArrayBuffer.isView(b)\n\n/**\n * Options that may be passed to stream.pipe()\n */\nexport interface PipeOptions {\n  /**\n   * end the destination stream when the source stream ends\n   */\n  end?: boolean\n  /**\n   * proxy errors from the source stream to the destination stream\n   */\n  proxyErrors?: boolean\n}\n\n/**\n * Internal class representing a pipe to a destination stream.\n *\n * @internal\n */\nclass Pipe<T extends unknown> {\n  src: Minipass<T>\n  dest: Minipass<any, T>\n  opts: PipeOptions\n  ondrain: () => any\n  constructor(\n    src: Minipass<T>,\n    dest: Minipass.Writable,\n    opts: PipeOptions\n  ) {\n    this.src = src\n    this.dest = dest as Minipass<any, T>\n    this.opts = opts\n    this.ondrain = () => src[RESUME]()\n    this.dest.on('drain', this.ondrain)\n  }\n  unpipe() {\n    this.dest.removeListener('drain', this.ondrain)\n  }\n  // only here for the prototype\n  /* c8 ignore start */\n  proxyErrors(_er: any) {}\n  /* c8 ignore stop */\n  end() {\n    this.unpipe()\n    if (this.opts.end) this.dest.end()\n  }\n}\n\n/**\n * Internal class representing a pipe to a destination stream where\n * errors are proxied.\n *\n * @internal\n */\nclass PipeProxyErrors<T> extends Pipe<T> {\n  unpipe() {\n    this.src.removeListener('error', this.proxyErrors)\n    super.unpipe()\n  }\n  constructor(\n    src: Minipass<T>,\n    dest: Minipass.Writable,\n    opts: PipeOptions\n  ) {\n    super(src, dest, opts)\n    this.proxyErrors = er => dest.emit('error', er)\n    src.on('error', this.proxyErrors)\n  }\n}\n\nexport namespace Minipass {\n  /**\n   * Encoding used to create a stream that outputs strings rather than\n   * Buffer objects.\n   */\n  export type Encoding = BufferEncoding | 'buffer' | null\n\n  /**\n   * Any stream that Minipass can pipe into\n   */\n  export type Writable =\n    | Minipass<any, any, any>\n    | NodeJS.WriteStream\n    | (NodeJS.WriteStream & { fd: number })\n    | (EventEmitter & {\n        end(): any\n        write(chunk: any, ...args: any[]): any\n      })\n\n  /**\n   * Any stream that can be read from\n   */\n  export type Readable =\n    | Minipass<any, any, any>\n    | NodeJS.ReadStream\n    | (NodeJS.ReadStream & { fd: number })\n    | (EventEmitter & {\n        pause(): any\n        resume(): any\n        pipe(...destArgs: any[]): any\n      })\n\n  /**\n   * Utility type that can be iterated sync or async\n   */\n  export type DualIterable<T> = Iterable<T> & AsyncIterable<T>\n\n  type EventArguments = Record<string | symbol, unknown[]>\n\n  /**\n   * The listing of events that a Minipass class can emit.\n   * Extend this when extending the Minipass class, and pass as\n   * the third template argument.  The key is the name of the event,\n   * and the value is the argument list.\n   *\n   * Any undeclared events will still be allowed, but the handler will get\n   * arguments as `unknown[]`.\n   */\n  export interface Events<RType extends any = Buffer>\n    extends EventArguments {\n    readable: []\n    data: [chunk: RType]\n    error: [er: unknown]\n    abort: [reason: unknown]\n    drain: []\n    resume: []\n    end: []\n    finish: []\n    prefinish: []\n    close: []\n    [DESTROYED]: [er?: unknown]\n    [ERROR]: [er: unknown]\n  }\n\n  /**\n   * String or buffer-like data that can be joined and sliced\n   */\n  export type ContiguousData =\n    | Buffer\n    | ArrayBufferLike\n    | ArrayBufferView\n    | string\n  export type BufferOrString = Buffer | string\n\n  /**\n   * Options passed to the Minipass constructor.\n   */\n  export type SharedOptions = {\n    /**\n     * Defer all data emission and other events until the end of the\n     * current tick, similar to Node core streams\n     */\n    async?: boolean\n    /**\n     * A signal which will abort the stream\n     */\n    signal?: AbortSignal\n    /**\n     * Output string encoding. Set to `null` or `'buffer'` (or omit) to\n     * emit Buffer objects rather than strings.\n     *\n     * Conflicts with `objectMode`\n     */\n    encoding?: BufferEncoding | null | 'buffer'\n    /**\n     * Output data exactly as it was written, supporting non-buffer/string\n     * data (such as arbitrary objects, falsey values, etc.)\n     *\n     * Conflicts with `encoding`\n     */\n    objectMode?: boolean\n  }\n\n  /**\n   * Options for a string encoded output\n   */\n  export type EncodingOptions = SharedOptions & {\n    encoding: BufferEncoding\n    objectMode?: false\n  }\n\n  /**\n   * Options for contiguous data buffer output\n   */\n  export type BufferOptions = SharedOptions & {\n    encoding?: null | 'buffer'\n    objectMode?: false\n  }\n\n  /**\n   * Options for objectMode arbitrary output\n   */\n  export type ObjectModeOptions = SharedOptions & {\n    objectMode: true\n    encoding?: null\n  }\n\n  /**\n   * Utility type to determine allowed options based on read type\n   */\n  export type Options<T> =\n    | ObjectModeOptions\n    | (T extends string\n        ? EncodingOptions\n        : T extends Buffer\n        ? BufferOptions\n        : SharedOptions)\n}\n\nconst isObjectModeOptions = (\n  o: Minipass.SharedOptions\n): o is Minipass.ObjectModeOptions => !!o.objectMode\n\nconst isEncodingOptions = (\n  o: Minipass.SharedOptions\n): o is Minipass.EncodingOptions =>\n  !o.objectMode && !!o.encoding && o.encoding !== 'buffer'\n\n/**\n * Main export, the Minipass class\n *\n * `RType` is the type of data emitted, defaults to Buffer\n *\n * `WType` is the type of data to be written, if RType is buffer or string,\n * then any {@link Minipass.ContiguousData} is allowed.\n *\n * `Events` is the set of event handler signatures that this object\n * will emit, see {@link Minipass.Events}\n */\nexport class Minipass<\n    RType extends unknown = Buffer,\n    WType extends unknown = RType extends Minipass.BufferOrString\n      ? Minipass.ContiguousData\n      : RType,\n    Events extends Minipass.Events<RType> = Minipass.Events<RType>\n  >\n  extends EventEmitter\n  implements Minipass.DualIterable<RType>\n{\n  [FLOWING]: boolean = false;\n  [PAUSED]: boolean = false;\n  [PIPES]: Pipe<RType>[] = [];\n  [BUFFER]: RType[] = [];\n  [OBJECTMODE]: boolean;\n  [ENCODING]: BufferEncoding | null;\n  [ASYNC]: boolean;\n  [DECODER]: SD | null;\n  [EOF]: boolean = false;\n  [EMITTED_END]: boolean = false;\n  [EMITTING_END]: boolean = false;\n  [CLOSED]: boolean = false;\n  [EMITTED_ERROR]: unknown = null;\n  [BUFFERLENGTH]: number = 0;\n  [DESTROYED]: boolean = false;\n  [SIGNAL]?: AbortSignal;\n  [ABORTED]: boolean = false;\n  [DATALISTENERS]: number = 0;\n  [DISCARDED]: boolean = false\n\n  /**\n   * true if the stream can be written\n   */\n  writable: boolean = true\n  /**\n   * true if the stream can be read\n   */\n  readable: boolean = true\n\n  /**\n   * If `RType` is Buffer, then options do not need to be provided.\n   * Otherwise, an options object must be provided to specify either\n   * {@link Minipass.SharedOptions.objectMode} or\n   * {@link Minipass.SharedOptions.encoding}, as appropriate.\n   */\n  constructor(\n    ...args:\n      | [Minipass.ObjectModeOptions]\n      | (RType extends Buffer\n          ? [] | [Minipass.Options<RType>]\n          : [Minipass.Options<RType>])\n  ) {\n    const options: Minipass.Options<RType> = (args[0] ||\n      {}) as Minipass.Options<RType>\n    super()\n    if (options.objectMode && typeof options.encoding === 'string') {\n      throw new TypeError(\n        'Encoding and objectMode may not be used together'\n      )\n    }\n    if (isObjectModeOptions(options)) {\n      this[OBJECTMODE] = true\n      this[ENCODING] = null\n    } else if (isEncodingOptions(options)) {\n      this[ENCODING] = options.encoding\n      this[OBJECTMODE] = false\n    } else {\n      this[OBJECTMODE] = false\n      this[ENCODING] = null\n    }\n    this[ASYNC] = !!options.async\n    this[DECODER] = this[ENCODING]\n      ? (new StringDecoder(this[ENCODING]) as SD)\n      : null\n\n    //@ts-ignore - private option for debugging and testing\n    if (options && options.debugExposeBuffer === true) {\n      Object.defineProperty(this, 'buffer', { get: () => this[BUFFER] })\n    }\n    //@ts-ignore - private option for debugging and testing\n    if (options && options.debugExposePipes === true) {\n      Object.defineProperty(this, 'pipes', { get: () => this[PIPES] })\n    }\n\n    const { signal } = options\n    if (signal) {\n      this[SIGNAL] = signal\n      if (signal.aborted) {\n        this[ABORT]()\n      } else {\n        signal.addEventListener('abort', () => this[ABORT]())\n      }\n    }\n  }\n\n  /**\n   * The amount of data stored in the buffer waiting to be read.\n   *\n   * For Buffer strings, this will be the total byte length.\n   * For string encoding streams, this will be the string character length,\n   * according to JavaScript's `string.length` logic.\n   * For objectMode streams, this is a count of the items waiting to be\n   * emitted.\n   */\n  get bufferLength() {\n    return this[BUFFERLENGTH]\n  }\n\n  /**\n   * The `BufferEncoding` currently in use, or `null`\n   */\n  get encoding() {\n    return this[ENCODING]\n  }\n\n  /**\n   * @deprecated - This is a read only property\n   */\n  set encoding(_enc) {\n    throw new Error('Encoding must be set at instantiation time')\n  }\n\n  /**\n   * @deprecated - Encoding may only be set at instantiation time\n   */\n  setEncoding(_enc: Minipass.Encoding) {\n    throw new Error('Encoding must be set at instantiation time')\n  }\n\n  /**\n   * True if this is an objectMode stream\n   */\n  get objectMode() {\n    return this[OBJECTMODE]\n  }\n\n  /**\n   * @deprecated - This is a read-only property\n   */\n  set objectMode(_om) {\n    throw new Error('objectMode must be set at instantiation time')\n  }\n\n  /**\n   * true if this is an async stream\n   */\n  get ['async'](): boolean {\n    return this[ASYNC]\n  }\n  /**\n   * Set to true to make this stream async.\n   *\n   * Once set, it cannot be unset, as this would potentially cause incorrect\n   * behavior.  Ie, a sync stream can be made async, but an async stream\n   * cannot be safely made sync.\n   */\n  set ['async'](a: boolean) {\n    this[ASYNC] = this[ASYNC] || !!a\n  }\n\n  // drop everything and get out of the flow completely\n  [ABORT]() {\n    this[ABORTED] = true\n    this.emit('abort', this[SIGNAL]?.reason)\n    this.destroy(this[SIGNAL]?.reason)\n  }\n\n  /**\n   * True if the stream has been aborted.\n   */\n  get aborted() {\n    return this[ABORTED]\n  }\n  /**\n   * No-op setter. Stream aborted status is set via the AbortSignal provided\n   * in the constructor options.\n   */\n  set aborted(_) {}\n\n  /**\n   * Write data into the stream\n   *\n   * If the chunk written is a string, and encoding is not specified, then\n   * `utf8` will be assumed. If the stream encoding matches the encoding of\n   * a written string, and the state of the string decoder allows it, then\n   * the string will be passed through to either the output or the internal\n   * buffer without any processing. Otherwise, it will be turned into a\n   * Buffer object for processing into the desired encoding.\n   *\n   * If provided, `cb` function is called immediately before return for\n   * sync streams, or on next tick for async streams, because for this\n   * base class, a chunk is considered \"processed\" once it is accepted\n   * and either emitted or buffered. That is, the callback does not indicate\n   * that the chunk has been eventually emitted, though of course child\n   * classes can override this function to do whatever processing is required\n   * and call `super.write(...)` only once processing is completed.\n   */\n  write(chunk: WType, cb?: () => void): boolean\n  write(\n    chunk: WType,\n    encoding?: Minipass.Encoding,\n    cb?: () => void\n  ): boolean\n  write(\n    chunk: WType,\n    encoding?: Minipass.Encoding | (() => void),\n    cb?: () => void\n  ): boolean {\n    if (this[ABORTED]) return false\n    if (this[EOF]) throw new Error('write after end')\n\n    if (this[DESTROYED]) {\n      this.emit(\n        'error',\n        Object.assign(\n          new Error('Cannot call write after a stream was destroyed'),\n          { code: 'ERR_STREAM_DESTROYED' }\n        )\n      )\n      return true\n    }\n\n    if (typeof encoding === 'function') {\n      cb = encoding\n      encoding = 'utf8'\n    }\n\n    if (!encoding) encoding = 'utf8'\n\n    const fn = this[ASYNC] ? defer : nodefer\n\n    // convert array buffers and typed array views into buffers\n    // at some point in the future, we may want to do the opposite!\n    // leave strings and buffers as-is\n    // anything is only allowed if in object mode, so throw\n    if (!this[OBJECTMODE] && !Buffer.isBuffer(chunk)) {\n      if (isArrayBufferView(chunk)) {\n        //@ts-ignore - sinful unsafe type changing\n        chunk = Buffer.from(\n          chunk.buffer,\n          chunk.byteOffset,\n          chunk.byteLength\n        )\n      } else if (isArrayBufferLike(chunk)) {\n        //@ts-ignore - sinful unsafe type changing\n        chunk = Buffer.from(chunk)\n      } else if (typeof chunk !== 'string') {\n        throw new Error(\n          'Non-contiguous data written to non-objectMode stream'\n        )\n      }\n    }\n\n    // handle object mode up front, since it's simpler\n    // this yields better performance, fewer checks later.\n    if (this[OBJECTMODE]) {\n      // maybe impossible?\n      /* c8 ignore start */\n      if (this[FLOWING] && this[BUFFERLENGTH] !== 0) this[FLUSH](true)\n      /* c8 ignore stop */\n\n      if (this[FLOWING]) this.emit('data', chunk as unknown as RType)\n      else this[BUFFERPUSH](chunk as unknown as RType)\n\n      if (this[BUFFERLENGTH] !== 0) this.emit('readable')\n\n      if (cb) fn(cb)\n\n      return this[FLOWING]\n    }\n\n    // at this point the chunk is a buffer or string\n    // don't buffer it up or send it to the decoder\n    if (!(chunk as Minipass.BufferOrString).length) {\n      if (this[BUFFERLENGTH] !== 0) this.emit('readable')\n      if (cb) fn(cb)\n      return this[FLOWING]\n    }\n\n    // fast-path writing strings of same encoding to a stream with\n    // an empty buffer, skipping the buffer/decoder dance\n    if (\n      typeof chunk === 'string' &&\n      // unless it is a string already ready for us to use\n      !(encoding === this[ENCODING] && !this[DECODER]?.lastNeed)\n    ) {\n      //@ts-ignore - sinful unsafe type change\n      chunk = Buffer.from(chunk, encoding)\n    }\n\n    if (Buffer.isBuffer(chunk) && this[ENCODING]) {\n      //@ts-ignore - sinful unsafe type change\n      chunk = this[DECODER].write(chunk)\n    }\n\n    // Note: flushing CAN potentially switch us into not-flowing mode\n    if (this[FLOWING] && this[BUFFERLENGTH] !== 0) this[FLUSH](true)\n\n    if (this[FLOWING]) this.emit('data', chunk as unknown as RType)\n    else this[BUFFERPUSH](chunk as unknown as RType)\n\n    if (this[BUFFERLENGTH] !== 0) this.emit('readable')\n\n    if (cb) fn(cb)\n\n    return this[FLOWING]\n  }\n\n  /**\n   * Low-level explicit read method.\n   *\n   * In objectMode, the argument is ignored, and one item is returned if\n   * available.\n   *\n   * `n` is the number of bytes (or in the case of encoding streams,\n   * characters) to consume. If `n` is not provided, then the entire buffer\n   * is returned, or `null` is returned if no data is available.\n   *\n   * If `n` is greater that the amount of data in the internal buffer,\n   * then `null` is returned.\n   */\n  read(n?: number | null): RType | null {\n    if (this[DESTROYED]) return null\n    this[DISCARDED] = false\n\n    if (\n      this[BUFFERLENGTH] === 0 ||\n      n === 0 ||\n      (n && n > this[BUFFERLENGTH])\n    ) {\n      this[MAYBE_EMIT_END]()\n      return null\n    }\n\n    if (this[OBJECTMODE]) n = null\n\n    if (this[BUFFER].length > 1 && !this[OBJECTMODE]) {\n      // not object mode, so if we have an encoding, then RType is string\n      // otherwise, must be Buffer\n      this[BUFFER] = [\n        (this[ENCODING]\n          ? this[BUFFER].join('')\n          : Buffer.concat(\n              this[BUFFER] as Buffer[],\n              this[BUFFERLENGTH]\n            )) as RType,\n      ]\n    }\n\n    const ret = this[READ](n || null, this[BUFFER][0] as RType)\n    this[MAYBE_EMIT_END]()\n    return ret\n  }\n\n  [READ](n: number | null, chunk: RType) {\n    if (this[OBJECTMODE]) this[BUFFERSHIFT]()\n    else {\n      const c = chunk as Minipass.BufferOrString\n      if (n === c.length || n === null) this[BUFFERSHIFT]()\n      else if (typeof c === 'string') {\n        this[BUFFER][0] = c.slice(n) as RType\n        chunk = c.slice(0, n) as RType\n        this[BUFFERLENGTH] -= n\n      } else {\n        this[BUFFER][0] = c.subarray(n) as RType\n        chunk = c.subarray(0, n) as RType\n        this[BUFFERLENGTH] -= n\n      }\n    }\n\n    this.emit('data', chunk)\n\n    if (!this[BUFFER].length && !this[EOF]) this.emit('drain')\n\n    return chunk\n  }\n\n  /**\n   * End the stream, optionally providing a final write.\n   *\n   * See {@link Minipass#write} for argument descriptions\n   */\n  end(cb?: () => void): this\n  end(chunk: WType, cb?: () => void): this\n  end(chunk: WType, encoding?: Minipass.Encoding, cb?: () => void): this\n  end(\n    chunk?: WType | (() => void),\n    encoding?: Minipass.Encoding | (() => void),\n    cb?: () => void\n  ): this {\n    if (typeof chunk === 'function') {\n      cb = chunk as () => void\n      chunk = undefined\n    }\n    if (typeof encoding === 'function') {\n      cb = encoding\n      encoding = 'utf8'\n    }\n    if (chunk !== undefined) this.write(chunk, encoding)\n    if (cb) this.once('end', cb)\n    this[EOF] = true\n    this.writable = false\n\n    // if we haven't written anything, then go ahead and emit,\n    // even if we're not reading.\n    // we'll re-emit if a new 'end' listener is added anyway.\n    // This makes MP more suitable to write-only use cases.\n    if (this[FLOWING] || !this[PAUSED]) this[MAYBE_EMIT_END]()\n    return this\n  }\n\n  // don't let the internal resume be overwritten\n  [RESUME]() {\n    if (this[DESTROYED]) return\n\n    if (!this[DATALISTENERS] && !this[PIPES].length) {\n      this[DISCARDED] = true\n    }\n    this[PAUSED] = false\n    this[FLOWING] = true\n    this.emit('resume')\n    if (this[BUFFER].length) this[FLUSH]()\n    else if (this[EOF]) this[MAYBE_EMIT_END]()\n    else this.emit('drain')\n  }\n\n  /**\n   * Resume the stream if it is currently in a paused state\n   *\n   * If called when there are no pipe destinations or `data` event listeners,\n   * this will place the stream in a \"discarded\" state, where all data will\n   * be thrown away. The discarded state is removed if a pipe destination or\n   * data handler is added, if pause() is called, or if any synchronous or\n   * asynchronous iteration is started.\n   */\n  resume() {\n    return this[RESUME]()\n  }\n\n  /**\n   * Pause the stream\n   */\n  pause() {\n    this[FLOWING] = false\n    this[PAUSED] = true\n    this[DISCARDED] = false\n  }\n\n  /**\n   * true if the stream has been forcibly destroyed\n   */\n  get destroyed() {\n    return this[DESTROYED]\n  }\n\n  /**\n   * true if the stream is currently in a flowing state, meaning that\n   * any writes will be immediately emitted.\n   */\n  get flowing() {\n    return this[FLOWING]\n  }\n\n  /**\n   * true if the stream is currently in a paused state\n   */\n  get paused() {\n    return this[PAUSED]\n  }\n\n  [BUFFERPUSH](chunk: RType) {\n    if (this[OBJECTMODE]) this[BUFFERLENGTH] += 1\n    else this[BUFFERLENGTH] += (chunk as Minipass.BufferOrString).length\n    this[BUFFER].push(chunk)\n  }\n\n  [BUFFERSHIFT](): RType {\n    if (this[OBJECTMODE]) this[BUFFERLENGTH] -= 1\n    else\n      this[BUFFERLENGTH] -= (\n        this[BUFFER][0] as Minipass.BufferOrString\n      ).length\n    return this[BUFFER].shift() as RType\n  }\n\n  [FLUSH](noDrain: boolean = false) {\n    do {} while (\n      this[FLUSHCHUNK](this[BUFFERSHIFT]()) &&\n      this[BUFFER].length\n    )\n\n    if (!noDrain && !this[BUFFER].length && !this[EOF]) this.emit('drain')\n  }\n\n  [FLUSHCHUNK](chunk: RType) {\n    this.emit('data', chunk)\n    return this[FLOWING]\n  }\n\n  /**\n   * Pipe all data emitted by this stream into the destination provided.\n   *\n   * Triggers the flow of data.\n   */\n  pipe<W extends Minipass.Writable>(dest: W, opts?: PipeOptions): W {\n    if (this[DESTROYED]) return dest\n    this[DISCARDED] = false\n\n    const ended = this[EMITTED_END]\n    opts = opts || {}\n    if (dest === proc.stdout || dest === proc.stderr) opts.end = false\n    else opts.end = opts.end !== false\n    opts.proxyErrors = !!opts.proxyErrors\n\n    // piping an ended stream ends immediately\n    if (ended) {\n      if (opts.end) dest.end()\n    } else {\n      // \"as\" here just ignores the WType, which pipes don't care about,\n      // since they're only consuming from us, and writing to the dest\n      this[PIPES].push(\n        !opts.proxyErrors\n          ? new Pipe<RType>(this as Minipass<RType>, dest, opts)\n          : new PipeProxyErrors<RType>(this as Minipass<RType>, dest, opts)\n      )\n      if (this[ASYNC]) defer(() => this[RESUME]())\n      else this[RESUME]()\n    }\n\n    return dest\n  }\n\n  /**\n   * Fully unhook a piped destination stream.\n   *\n   * If the destination stream was the only consumer of this stream (ie,\n   * there are no other piped destinations or `'data'` event listeners)\n   * then the flow of data will stop until there is another consumer or\n   * {@link Minipass#resume} is explicitly called.\n   */\n  unpipe<W extends Minipass.Writable>(dest: W) {\n    const p = this[PIPES].find(p => p.dest === dest)\n    if (p) {\n      if (this[PIPES].length === 1) {\n        if (this[FLOWING] && this[DATALISTENERS] === 0) {\n          this[FLOWING] = false\n        }\n        this[PIPES] = []\n      } else this[PIPES].splice(this[PIPES].indexOf(p), 1)\n      p.unpipe()\n    }\n  }\n\n  /**\n   * Alias for {@link Minipass#on}\n   */\n  addListener<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ): this {\n    return this.on(ev, handler)\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.on`, with the following\n   * behavior differences to prevent data loss and unnecessary hangs:\n   *\n   * - Adding a 'data' event handler will trigger the flow of data\n   *\n   * - Adding a 'readable' event handler when there is data waiting to be read\n   *   will cause 'readable' to be emitted immediately.\n   *\n   * - Adding an 'endish' event handler ('end', 'finish', etc.) which has\n   *   already passed will cause the event to be emitted immediately and all\n   *   handlers removed.\n   *\n   * - Adding an 'error' event handler after an error has been emitted will\n   *   cause the event to be re-emitted immediately with the error previously\n   *   raised.\n   */\n  on<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ): this {\n    const ret = super.on(\n      ev as string | symbol,\n      handler as (...a: any[]) => any\n    )\n    if (ev === 'data') {\n      this[DISCARDED] = false\n      this[DATALISTENERS]++\n      if (!this[PIPES].length && !this[FLOWING]) {\n        this[RESUME]()\n      }\n    } else if (ev === 'readable' && this[BUFFERLENGTH] !== 0) {\n      super.emit('readable')\n    } else if (isEndish(ev) && this[EMITTED_END]) {\n      super.emit(ev)\n      this.removeAllListeners(ev)\n    } else if (ev === 'error' && this[EMITTED_ERROR]) {\n      const h = handler as (...a: Events['error']) => any\n      if (this[ASYNC]) defer(() => h.call(this, this[EMITTED_ERROR]))\n      else h.call(this, this[EMITTED_ERROR])\n    }\n    return ret\n  }\n\n  /**\n   * Alias for {@link Minipass#off}\n   */\n  removeListener<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ) {\n    return this.off(ev, handler)\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.off`\n   *\n   * If a 'data' event handler is removed, and it was the last consumer\n   * (ie, there are no pipe destinations or other 'data' event listeners),\n   * then the flow of data will stop until there is another consumer or\n   * {@link Minipass#resume} is explicitly called.\n   */\n  off<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ) {\n    const ret = super.off(\n      ev as string | symbol,\n      handler as (...a: any[]) => any\n    )\n    // if we previously had listeners, and now we don't, and we don't\n    // have any pipes, then stop the flow, unless it's been explicitly\n    // put in a discarded flowing state via stream.resume().\n    if (ev === 'data') {\n      this[DATALISTENERS] = this.listeners('data').length\n      if (\n        this[DATALISTENERS] === 0 &&\n        !this[DISCARDED] &&\n        !this[PIPES].length\n      ) {\n        this[FLOWING] = false\n      }\n    }\n    return ret\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.removeAllListeners`\n   *\n   * If all 'data' event handlers are removed, and they were the last consumer\n   * (ie, there are no pipe destinations), then the flow of data will stop\n   * until there is another consumer or {@link Minipass#resume} is explicitly\n   * called.\n   */\n  removeAllListeners<Event extends keyof Events>(ev?: Event) {\n    const ret = super.removeAllListeners(ev as string | symbol | undefined)\n    if (ev === 'data' || ev === undefined) {\n      this[DATALISTENERS] = 0\n      if (!this[DISCARDED] && !this[PIPES].length) {\n        this[FLOWING] = false\n      }\n    }\n    return ret\n  }\n\n  /**\n   * true if the 'end' event has been emitted\n   */\n  get emittedEnd() {\n    return this[EMITTED_END]\n  }\n\n  [MAYBE_EMIT_END]() {\n    if (\n      !this[EMITTING_END] &&\n      !this[EMITTED_END] &&\n      !this[DESTROYED] &&\n      this[BUFFER].length === 0 &&\n      this[EOF]\n    ) {\n      this[EMITTING_END] = true\n      this.emit('end')\n      this.emit('prefinish')\n      this.emit('finish')\n      if (this[CLOSED]) this.emit('close')\n      this[EMITTING_END] = false\n    }\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.emit`, with the following\n   * behavior differences to prevent data loss and unnecessary hangs:\n   *\n   * If the stream has been destroyed, and the event is something other\n   * than 'close' or 'error', then `false` is returned and no handlers\n   * are called.\n   *\n   * If the event is 'end', and has already been emitted, then the event\n   * is ignored. If the stream is in a paused or non-flowing state, then\n   * the event will be deferred until data flow resumes. If the stream is\n   * async, then handlers will be called on the next tick rather than\n   * immediately.\n   *\n   * If the event is 'close', and 'end' has not yet been emitted, then\n   * the event will be deferred until after 'end' is emitted.\n   *\n   * If the event is 'error', and an AbortSignal was provided for the stream,\n   * and there are no listeners, then the event is ignored, matching the\n   * behavior of node core streams in the presense of an AbortSignal.\n   *\n   * If the event is 'finish' or 'prefinish', then all listeners will be\n   * removed after emitting the event, to prevent double-firing.\n   */\n  emit<Event extends keyof Events>(\n    ev: Event,\n    ...args: Events[Event]\n  ): boolean {\n    const data = args[0]\n    // error and close are only events allowed after calling destroy()\n    if (\n      ev !== 'error' &&\n      ev !== 'close' &&\n      ev !== DESTROYED &&\n      this[DESTROYED]\n    ) {\n      return false\n    } else if (ev === 'data') {\n      return !this[OBJECTMODE] && !data\n        ? false\n        : this[ASYNC]\n        ? (defer(() => this[EMITDATA](data as RType)), true)\n        : this[EMITDATA](data as RType)\n    } else if (ev === 'end') {\n      return this[EMITEND]()\n    } else if (ev === 'close') {\n      this[CLOSED] = true\n      // don't emit close before 'end' and 'finish'\n      if (!this[EMITTED_END] && !this[DESTROYED]) return false\n      const ret = super.emit('close')\n      this.removeAllListeners('close')\n      return ret\n    } else if (ev === 'error') {\n      this[EMITTED_ERROR] = data\n      super.emit(ERROR, data)\n      const ret =\n        !this[SIGNAL] || this.listeners('error').length\n          ? super.emit('error', data)\n          : false\n      this[MAYBE_EMIT_END]()\n      return ret\n    } else if (ev === 'resume') {\n      const ret = super.emit('resume')\n      this[MAYBE_EMIT_END]()\n      return ret\n    } else if (ev === 'finish' || ev === 'prefinish') {\n      const ret = super.emit(ev)\n      this.removeAllListeners(ev)\n      return ret\n    }\n\n    // Some other unknown event\n    const ret = super.emit(ev as string, ...args)\n    this[MAYBE_EMIT_END]()\n    return ret\n  }\n\n  [EMITDATA](data: RType) {\n    for (const p of this[PIPES]) {\n      if (p.dest.write(data as RType) === false) this.pause()\n    }\n    const ret = this[DISCARDED] ? false : super.emit('data', data)\n    this[MAYBE_EMIT_END]()\n    return ret\n  }\n\n  [EMITEND]() {\n    if (this[EMITTED_END]) return false\n\n    this[EMITTED_END] = true\n    this.readable = false\n    return this[ASYNC]\n      ? (defer(() => this[EMITEND2]()), true)\n      : this[EMITEND2]()\n  }\n\n  [EMITEND2]() {\n    if (this[DECODER]) {\n      const data = this[DECODER].end()\n      if (data) {\n        for (const p of this[PIPES]) {\n          p.dest.write(data as RType)\n        }\n        if (!this[DISCARDED]) super.emit('data', data)\n      }\n    }\n\n    for (const p of this[PIPES]) {\n      p.end()\n    }\n    const ret = super.emit('end')\n    this.removeAllListeners('end')\n    return ret\n  }\n\n  /**\n   * Return a Promise that resolves to an array of all emitted data once\n   * the stream ends.\n   */\n  async collect(): Promise<RType[] & { dataLength: number }> {\n    const buf: RType[] & { dataLength: number } = Object.assign([], {\n      dataLength: 0,\n    })\n    if (!this[OBJECTMODE]) buf.dataLength = 0\n    // set the promise first, in case an error is raised\n    // by triggering the flow here.\n    const p = this.promise()\n    this.on('data', c => {\n      buf.push(c)\n      if (!this[OBJECTMODE])\n        buf.dataLength += (c as Minipass.BufferOrString).length\n    })\n    await p\n    return buf\n  }\n\n  /**\n   * Return a Promise that resolves to the concatenation of all emitted data\n   * once the stream ends.\n   *\n   * Not allowed on objectMode streams.\n   */\n  async concat(): Promise<RType> {\n    if (this[OBJECTMODE]) {\n      throw new Error('cannot concat in objectMode')\n    }\n    const buf = await this.collect()\n    return (\n      this[ENCODING]\n        ? buf.join('')\n        : Buffer.concat(buf as Buffer[], buf.dataLength)\n    ) as RType\n  }\n\n  /**\n   * Return a void Promise that resolves once the stream ends.\n   */\n  async promise(): Promise<void> {\n    return new Promise<void>((resolve, reject) => {\n      this.on(DESTROYED, () => reject(new Error('stream destroyed')))\n      this.on('error', er => reject(er))\n      this.on('end', () => resolve())\n    })\n  }\n\n  /**\n   * Asynchronous `for await of` iteration.\n   *\n   * This will continue emitting all chunks until the stream terminates.\n   */\n  [Symbol.asyncIterator](): AsyncGenerator<RType, void, void> {\n    // set this up front, in case the consumer doesn't call next()\n    // right away.\n    this[DISCARDED] = false\n    let stopped = false\n    const stop = async (): Promise<IteratorReturnResult<void>> => {\n      this.pause()\n      stopped = true\n      return { value: undefined, done: true }\n    }\n    const next = (): Promise<IteratorResult<RType, void>> => {\n      if (stopped) return stop()\n      const res = this.read()\n      if (res !== null) return Promise.resolve({ done: false, value: res })\n\n      if (this[EOF]) return stop()\n\n      let resolve!: (res: IteratorResult<RType>) => void\n      let reject!: (er: unknown) => void\n      const onerr = (er: unknown) => {\n        this.off('data', ondata)\n        this.off('end', onend)\n        this.off(DESTROYED, ondestroy)\n        stop()\n        reject(er)\n      }\n      const ondata = (value: RType) => {\n        this.off('error', onerr)\n        this.off('end', onend)\n        this.off(DESTROYED, ondestroy)\n        this.pause()\n        resolve({ value, done: !!this[EOF] })\n      }\n      const onend = () => {\n        this.off('error', onerr)\n        this.off('data', ondata)\n        this.off(DESTROYED, ondestroy)\n        stop()\n        resolve({ done: true, value: undefined })\n      }\n      const ondestroy = () => onerr(new Error('stream destroyed'))\n      return new Promise<IteratorResult<RType>>((res, rej) => {\n        reject = rej\n        resolve = res\n        this.once(DESTROYED, ondestroy)\n        this.once('error', onerr)\n        this.once('end', onend)\n        this.once('data', ondata)\n      })\n    }\n\n    return {\n      next,\n      throw: stop,\n      return: stop,\n      [Symbol.asyncIterator]() {\n        return this\n      },\n    }\n  }\n\n  /**\n   * Synchronous `for of` iteration.\n   *\n   * The iteration will terminate when the internal buffer runs out, even\n   * if the stream has not yet terminated.\n   */\n  [Symbol.iterator](): Generator<RType, void, void> {\n    // set this up front, in case the consumer doesn't call next()\n    // right away.\n    this[DISCARDED] = false\n    let stopped = false\n    const stop = (): IteratorReturnResult<void> => {\n      this.pause()\n      this.off(ERROR, stop)\n      this.off(DESTROYED, stop)\n      this.off('end', stop)\n      stopped = true\n      return { done: true, value: undefined }\n    }\n\n    const next = (): IteratorResult<RType, void> => {\n      if (stopped) return stop()\n      const value = this.read()\n      return value === null ? stop() : { done: false, value }\n    }\n\n    this.once('end', stop)\n    this.once(ERROR, stop)\n    this.once(DESTROYED, stop)\n\n    return {\n      next,\n      throw: stop,\n      return: stop,\n      [Symbol.iterator]() {\n        return this\n      },\n    }\n  }\n\n  /**\n   * Destroy a stream, preventing it from being used for any further purpose.\n   *\n   * If the stream has a `close()` method, then it will be called on\n   * destruction.\n   *\n   * After destruction, any attempt to write data, read data, or emit most\n   * events will be ignored.\n   *\n   * If an error argument is provided, then it will be emitted in an\n   * 'error' event.\n   */\n  destroy(er?: unknown) {\n    if (this[DESTROYED]) {\n      if (er) this.emit('error', er)\n      else this.emit(DESTROYED)\n      return this\n    }\n\n    this[DESTROYED] = true\n    this[DISCARDED] = true\n\n    // throw away all buffered data, it's never coming out\n    this[BUFFER].length = 0\n    this[BUFFERLENGTH] = 0\n\n    const wc = this as Minipass<RType, WType, Events> & {\n      close?: () => void\n    }\n    if (typeof wc.close === 'function' && !this[CLOSED]) wc.close()\n\n    if (er) this.emit('error', er)\n    // if no error to emit, still reject pending promises\n    else this.emit(DESTROYED)\n\n    return this\n  }\n\n  /**\n   * Alias for {@link isStream}\n   *\n   * Former export location, maintained for backwards compatibility.\n   *\n   * @deprecated\n   */\n  static get isStream() {\n    return isStream\n  }\n}\n", "// this is just a very light wrapper around 2 arrays with an offset index\n\nimport { GLOBSTAR } from 'minimatch'\nexport type MMPattern = string | RegExp | typeof GLOBSTAR\n\n// an array of length >= 1\nexport type PatternList = [p: MMPattern, ...rest: MMPattern[]]\nexport type UNCPatternList = [\n  p0: '',\n  p1: '',\n  p2: string,\n  p3: string,\n  ...rest: MMPattern[],\n]\nexport type DrivePatternList = [p0: string, ...rest: MMPattern[]]\nexport type AbsolutePatternList = [p0: '', ...rest: MMPattern[]]\nexport type GlobList = [p: string, ...rest: string[]]\n\nconst isPatternList = (pl: MMPattern[]): pl is PatternList =>\n  pl.length >= 1\nconst isGlobList = (gl: string[]): gl is GlobList => gl.length >= 1\n\nconst customInspect = Symbol.for('nodejs.util.inspect.custom')\n\n/**\n * An immutable-ish view on an array of glob parts and their parsed\n * results\n */\nexport class Pattern {\n  readonly #patternList: PatternList\n  readonly #globList: GlobList\n  readonly #index: number\n  readonly length: number\n  readonly #platform: NodeJS.Platform\n  #rest?: Pattern | null\n  #globString?: string\n  #isDrive?: boolean\n  #isUNC?: boolean\n  #isAbsolute?: boolean\n  #followGlobstar: boolean = true\n\n  constructor(\n    patternList: MMPattern[],\n    globList: string[],\n    index: number,\n    platform: NodeJS.Platform,\n  ) {\n    if (!isPatternList(patternList)) {\n      throw new TypeError('empty pattern list')\n    }\n    if (!isGlobList(globList)) {\n      throw new TypeError('empty glob list')\n    }\n    if (globList.length !== patternList.length) {\n      throw new TypeError('mismatched pattern list and glob list lengths')\n    }\n    this.length = patternList.length\n    if (index < 0 || index >= this.length) {\n      throw new TypeError('index out of range')\n    }\n    this.#patternList = patternList\n    this.#globList = globList\n    this.#index = index\n    this.#platform = platform\n\n    // normalize root entries of absolute patterns on initial creation.\n    if (this.#index === 0) {\n      // c: => ['c:/']\n      // C:/ => ['C:/']\n      // C:/x => ['C:/', 'x']\n      // //host/share => ['//host/share/']\n      // //host/share/ => ['//host/share/']\n      // //host/share/x => ['//host/share/', 'x']\n      // /etc => ['/', 'etc']\n      // / => ['/']\n      if (this.isUNC()) {\n        // '' / '' / 'host' / 'share'\n        const [p0, p1, p2, p3, ...prest] = this.#patternList\n        const [g0, g1, g2, g3, ...grest] = this.#globList\n        if (prest[0] === '') {\n          // ends in /\n          prest.shift()\n          grest.shift()\n        }\n        const p = [p0, p1, p2, p3, ''].join('/')\n        const g = [g0, g1, g2, g3, ''].join('/')\n        this.#patternList = [p, ...prest]\n        this.#globList = [g, ...grest]\n        this.length = this.#patternList.length\n      } else if (this.isDrive() || this.isAbsolute()) {\n        const [p1, ...prest] = this.#patternList\n        const [g1, ...grest] = this.#globList\n        if (prest[0] === '') {\n          // ends in /\n          prest.shift()\n          grest.shift()\n        }\n        const p = (p1 as string) + '/'\n        const g = g1 + '/'\n        this.#patternList = [p, ...prest]\n        this.#globList = [g, ...grest]\n        this.length = this.#patternList.length\n      }\n    }\n  }\n\n  [customInspect]() {\n    return 'Pattern <' + this.#globList.slice(this.#index).join('/') + '>'\n  }\n\n  /**\n   * The first entry in the parsed list of patterns\n   */\n  pattern(): MMPattern {\n    return this.#patternList[this.#index] as MMPattern\n  }\n\n  /**\n   * true of if pattern() returns a string\n   */\n  isString(): boolean {\n    return typeof this.#patternList[this.#index] === 'string'\n  }\n  /**\n   * true of if pattern() returns GLOBSTAR\n   */\n  isGlobstar(): boolean {\n    return this.#patternList[this.#index] === GLOBSTAR\n  }\n  /**\n   * true if pattern() returns a regexp\n   */\n  isRegExp(): boolean {\n    return this.#patternList[this.#index] instanceof RegExp\n  }\n\n  /**\n   * The /-joined set of glob parts that make up this pattern\n   */\n  globString(): string {\n    return (this.#globString =\n      this.#globString ||\n      (this.#index === 0 ?\n        this.isAbsolute() ?\n          this.#globList[0] + this.#globList.slice(1).join('/')\n        : this.#globList.join('/')\n      : this.#globList.slice(this.#index).join('/')))\n  }\n\n  /**\n   * true if there are more pattern parts after this one\n   */\n  hasMore(): boolean {\n    return this.length > this.#index + 1\n  }\n\n  /**\n   * The rest of the pattern after this part, or null if this is the end\n   */\n  rest(): Pattern | null {\n    if (this.#rest !== undefined) return this.#rest\n    if (!this.hasMore()) return (this.#rest = null)\n    this.#rest = new Pattern(\n      this.#patternList,\n      this.#globList,\n      this.#index + 1,\n      this.#platform,\n    )\n    this.#rest.#isAbsolute = this.#isAbsolute\n    this.#rest.#isUNC = this.#isUNC\n    this.#rest.#isDrive = this.#isDrive\n    return this.#rest\n  }\n\n  /**\n   * true if the pattern represents a //unc/path/ on windows\n   */\n  isUNC(): boolean {\n    const pl = this.#patternList\n    return this.#isUNC !== undefined ?\n        this.#isUNC\n      : (this.#isUNC =\n          this.#platform === 'win32' &&\n          this.#index === 0 &&\n          pl[0] === '' &&\n          pl[1] === '' &&\n          typeof pl[2] === 'string' &&\n          !!pl[2] &&\n          typeof pl[3] === 'string' &&\n          !!pl[3])\n  }\n\n  // pattern like C:/...\n  // split = ['C:', ...]\n  // XXX: would be nice to handle patterns like `c:*` to test the cwd\n  // in c: for *, but I don't know of a way to even figure out what that\n  // cwd is without actually chdir'ing into it?\n  /**\n   * True if the pattern starts with a drive letter on Windows\n   */\n  isDrive(): boolean {\n    const pl = this.#patternList\n    return this.#isDrive !== undefined ?\n        this.#isDrive\n      : (this.#isDrive =\n          this.#platform === 'win32' &&\n          this.#index === 0 &&\n          this.length > 1 &&\n          typeof pl[0] === 'string' &&\n          /^[a-z]:$/i.test(pl[0]))\n  }\n\n  // pattern = '/' or '/...' or '/x/...'\n  // split = ['', ''] or ['', ...] or ['', 'x', ...]\n  // Drive and UNC both considered absolute on windows\n  /**\n   * True if the pattern is rooted on an absolute path\n   */\n  isAbsolute(): boolean {\n    const pl = this.#patternList\n    return this.#isAbsolute !== undefined ?\n        this.#isAbsolute\n      : (this.#isAbsolute =\n          (pl[0] === '' && pl.length > 1) ||\n          this.isDrive() ||\n          this.isUNC())\n  }\n\n  /**\n   * consume the root of the pattern, and return it\n   */\n  root(): string {\n    const p = this.#patternList[0]\n    return (\n        typeof p === 'string' && this.isAbsolute() && this.#index === 0\n      ) ?\n        p\n      : ''\n  }\n\n  /**\n   * Check to see if the current globstar pattern is allowed to follow\n   * a symbolic link.\n   */\n  checkFollowGlobstar(): boolean {\n    return !(\n      this.#index === 0 ||\n      !this.isGlobstar() ||\n      !this.#followGlobstar\n    )\n  }\n\n  /**\n   * Mark that the current globstar pattern is following a symbolic link\n   */\n  markFollowGlobstar(): boolean {\n    if (this.#index === 0 || !this.isGlobstar() || !this.#followGlobstar)\n      return false\n    this.#followGlobstar = false\n    return true\n  }\n}\n", "// give it a pattern, and it'll be able to tell you if\n// a given path should be ignored.\n// Ignoring a path ignores its children if the pattern ends in /**\n// Ignores are always parsed in dot:true mode\n\nimport { Minimatch, MinimatchOptions } from 'minimatch'\nimport { Path } from 'path-scurry'\nimport { Pattern } from './pattern.js'\nimport { GlobWalkerOpts } from './walker.js'\n\nexport interface IgnoreLike {\n  ignored?: (p: Path) => boolean\n  childrenIgnored?: (p: Path) => boolean\n  add?: (ignore: string) => void\n}\n\nconst defaultPlatform: NodeJS.Platform =\n  (\n    typeof process === 'object' &&\n    process &&\n    typeof process.platform === 'string'\n  ) ?\n    process.platform\n  : 'linux'\n\n/**\n * Class used to process ignored patterns\n */\nexport class Ignore implements IgnoreLike {\n  relative: Minimatch[]\n  relativeChildren: Minimatch[]\n  absolute: Minimatch[]\n  absoluteChildren: Minimatch[]\n  platform: NodeJS.Platform\n  mmopts: MinimatchOptions\n\n  constructor(\n    ignored: string[],\n    {\n      nobrace,\n      nocase,\n      noext,\n      noglobstar,\n      platform = defaultPlatform,\n    }: GlobWalkerOpts,\n  ) {\n    this.relative = []\n    this.absolute = []\n    this.relativeChildren = []\n    this.absoluteChildren = []\n    this.platform = platform\n    this.mmopts = {\n      dot: true,\n      nobrace,\n      nocase,\n      noext,\n      noglobstar,\n      optimizationLevel: 2,\n      platform,\n      nocomment: true,\n      nonegate: true,\n    }\n    for (const ign of ignored) this.add(ign)\n  }\n\n  add(ign: string) {\n    // this is a little weird, but it gives us a clean set of optimized\n    // minimatch matchers, without getting tripped up if one of them\n    // ends in /** inside a brace section, and it's only inefficient at\n    // the start of the walk, not along it.\n    // It'd be nice if the Pattern class just had a .test() method, but\n    // handling globstars is a bit of a pita, and that code already lives\n    // in minimatch anyway.\n    // Another way would be if maybe Minimatch could take its set/globParts\n    // as an option, and then we could at least just use Pattern to test\n    // for absolute-ness.\n    // Yet another way, Minimatch could take an array of glob strings, and\n    // a cwd option, and do the right thing.\n    const mm = new Minimatch(ign, this.mmopts)\n    for (let i = 0; i < mm.set.length; i++) {\n      const parsed = mm.set[i]\n      const globParts = mm.globParts[i]\n      /* c8 ignore start */\n      if (!parsed || !globParts) {\n        throw new Error('invalid pattern object')\n      }\n      // strip off leading ./ portions\n      // https://github.com/isaacs/node-glob/issues/570\n      while (parsed[0] === '.' && globParts[0] === '.') {\n        parsed.shift()\n        globParts.shift()\n      }\n      /* c8 ignore stop */\n      const p = new Pattern(parsed, globParts, 0, this.platform)\n      const m = new Minimatch(p.globString(), this.mmopts)\n      const children = globParts[globParts.length - 1] === '**'\n      const absolute = p.isAbsolute()\n      if (absolute) this.absolute.push(m)\n      else this.relative.push(m)\n      if (children) {\n        if (absolute) this.absoluteChildren.push(m)\n        else this.relativeChildren.push(m)\n      }\n    }\n  }\n\n  ignored(p: Path): boolean {\n    const fullpath = p.fullpath()\n    const fullpaths = `${fullpath}/`\n    const relative = p.relative() || '.'\n    const relatives = `${relative}/`\n    for (const m of this.relative) {\n      if (m.match(relative) || m.match(relatives)) return true\n    }\n    for (const m of this.absolute) {\n      if (m.match(fullpath) || m.match(fullpaths)) return true\n    }\n    return false\n  }\n\n  childrenIgnored(p: Path): boolean {\n    const fullpath = p.fullpath() + '/'\n    const relative = (p.relative() || '.') + '/'\n    for (const m of this.relativeChildren) {\n      if (m.match(relative)) return true\n    }\n    for (const m of this.absoluteChildren) {\n      if (m.match(fullpath)) return true\n    }\n    return false\n  }\n}\n", "// synchronous utility for filtering entries and calculating subwalks\n\nimport { GLOBSTAR, MMRegExp } from 'minimatch'\nimport { Path } from 'path-scurry'\nimport { MMPattern, Pattern } from './pattern.js'\nimport { GlobWalkerOpts } from './walker.js'\n\n/**\n * A cache of which patterns have been processed for a given Path\n */\nexport class HasWalkedCache {\n  store: Map<string, Set<string>>\n  constructor(store: Map<string, Set<string>> = new Map()) {\n    this.store = store\n  }\n  copy() {\n    return new HasWalkedCache(new Map(this.store))\n  }\n  hasWalked(target: Path, pattern: Pattern) {\n    return this.store.get(target.fullpath())?.has(pattern.globString())\n  }\n  storeWalked(target: Path, pattern: Pattern) {\n    const fullpath = target.fullpath()\n    const cached = this.store.get(fullpath)\n    if (cached) cached.add(pattern.globString())\n    else this.store.set(fullpath, new Set([pattern.globString()]))\n  }\n}\n\n/**\n * A record of which paths have been matched in a given walk step,\n * and whether they only are considered a match if they are a directory,\n * and whether their absolute or relative path should be returned.\n */\nexport class MatchRecord {\n  store: Map<Path, number> = new Map()\n  add(target: Path, absolute: boolean, ifDir: boolean) {\n    const n = (absolute ? 2 : 0) | (ifDir ? 1 : 0)\n    const current = this.store.get(target)\n    this.store.set(target, current === undefined ? n : n & current)\n  }\n  // match, absolute, ifdir\n  entries(): [Path, boolean, boolean][] {\n    return [...this.store.entries()].map(([path, n]) => [\n      path,\n      !!(n & 2),\n      !!(n & 1),\n    ])\n  }\n}\n\n/**\n * A collection of patterns that must be processed in a subsequent step\n * for a given path.\n */\nexport class SubWalks {\n  store: Map<Path, Pattern[]> = new Map()\n  add(target: Path, pattern: Pattern) {\n    if (!target.canReaddir()) {\n      return\n    }\n    const subs = this.store.get(target)\n    if (subs) {\n      if (!subs.find(p => p.globString() === pattern.globString())) {\n        subs.push(pattern)\n      }\n    } else this.store.set(target, [pattern])\n  }\n  get(target: Path): Pattern[] {\n    const subs = this.store.get(target)\n    /* c8 ignore start */\n    if (!subs) {\n      throw new Error('attempting to walk unknown path')\n    }\n    /* c8 ignore stop */\n    return subs\n  }\n  entries(): [Path, Pattern[]][] {\n    return this.keys().map(k => [k, this.store.get(k) as Pattern[]])\n  }\n  keys(): Path[] {\n    return [...this.store.keys()].filter(t => t.canReaddir())\n  }\n}\n\n/**\n * The class that processes patterns for a given path.\n *\n * Handles child entry filtering, and determining whether a path's\n * directory contents must be read.\n */\nexport class Processor {\n  hasWalkedCache: HasWalkedCache\n  matches = new MatchRecord()\n  subwalks = new SubWalks()\n  patterns?: Pattern[]\n  follow: boolean\n  dot: boolean\n  opts: GlobWalkerOpts\n\n  constructor(opts: GlobWalkerOpts, hasWalkedCache?: HasWalkedCache) {\n    this.opts = opts\n    this.follow = !!opts.follow\n    this.dot = !!opts.dot\n    this.hasWalkedCache =\n      hasWalkedCache ? hasWalkedCache.copy() : new HasWalkedCache()\n  }\n\n  processPatterns(target: Path, patterns: Pattern[]) {\n    this.patterns = patterns\n    const processingSet: [Path, Pattern][] = patterns.map(p => [target, p])\n\n    // map of paths to the magic-starting subwalks they need to walk\n    // first item in patterns is the filter\n\n    for (let [t, pattern] of processingSet) {\n      this.hasWalkedCache.storeWalked(t, pattern)\n\n      const root = pattern.root()\n      const absolute = pattern.isAbsolute() && this.opts.absolute !== false\n\n      // start absolute patterns at root\n      if (root) {\n        t = t.resolve(\n          root === '/' && this.opts.root !== undefined ?\n            this.opts.root\n          : root,\n        )\n        const rest = pattern.rest()\n        if (!rest) {\n          this.matches.add(t, true, false)\n          continue\n        } else {\n          pattern = rest\n        }\n      }\n\n      if (t.isENOENT()) continue\n\n      let p: MMPattern\n      let rest: Pattern | null\n      let changed = false\n      while (\n        typeof (p = pattern.pattern()) === 'string' &&\n        (rest = pattern.rest())\n      ) {\n        const c = t.resolve(p)\n        t = c\n        pattern = rest\n        changed = true\n      }\n      p = pattern.pattern()\n      rest = pattern.rest()\n      if (changed) {\n        if (this.hasWalkedCache.hasWalked(t, pattern)) continue\n        this.hasWalkedCache.storeWalked(t, pattern)\n      }\n\n      // now we have either a final string for a known entry,\n      // more strings for an unknown entry,\n      // or a pattern starting with magic, mounted on t.\n      if (typeof p === 'string') {\n        // must not be final entry, otherwise we would have\n        // concatenated it earlier.\n        const ifDir = p === '..' || p === '' || p === '.'\n        this.matches.add(t.resolve(p), absolute, ifDir)\n        continue\n      } else if (p === GLOBSTAR) {\n        // if no rest, match and subwalk pattern\n        // if rest, process rest and subwalk pattern\n        // if it's a symlink, but we didn't get here by way of a\n        // globstar match (meaning it's the first time THIS globstar\n        // has traversed a symlink), then we follow it. Otherwise, stop.\n        if (\n          !t.isSymbolicLink() ||\n          this.follow ||\n          pattern.checkFollowGlobstar()\n        ) {\n          this.subwalks.add(t, pattern)\n        }\n        const rp = rest?.pattern()\n        const rrest = rest?.rest()\n        if (!rest || ((rp === '' || rp === '.') && !rrest)) {\n          // only HAS to be a dir if it ends in **/ or **/.\n          // but ending in ** will match files as well.\n          this.matches.add(t, absolute, rp === '' || rp === '.')\n        } else {\n          if (rp === '..') {\n            // this would mean you're matching **/.. at the fs root,\n            // and no thanks, I'm not gonna test that specific case.\n            /* c8 ignore start */\n            const tp = t.parent || t\n            /* c8 ignore stop */\n            if (!rrest) this.matches.add(tp, absolute, true)\n            else if (!this.hasWalkedCache.hasWalked(tp, rrest)) {\n              this.subwalks.add(tp, rrest)\n            }\n          }\n        }\n      } else if (p instanceof RegExp) {\n        this.subwalks.add(t, pattern)\n      }\n    }\n\n    return this\n  }\n\n  subwalkTargets(): Path[] {\n    return this.subwalks.keys()\n  }\n\n  child() {\n    return new Processor(this.opts, this.hasWalkedCache)\n  }\n\n  // return a new Processor containing the subwalks for each\n  // child entry, and a set of matches, and\n  // a hasWalkedCache that's a copy of this one\n  // then we're going to call\n  filterEntries(parent: Path, entries: Path[]): Processor {\n    const patterns = this.subwalks.get(parent)\n    // put matches and entry walks into the results processor\n    const results = this.child()\n    for (const e of entries) {\n      for (const pattern of patterns) {\n        const absolute = pattern.isAbsolute()\n        const p = pattern.pattern()\n        const rest = pattern.rest()\n        if (p === GLOBSTAR) {\n          results.testGlobstar(e, pattern, rest, absolute)\n        } else if (p instanceof RegExp) {\n          results.testRegExp(e, p, rest, absolute)\n        } else {\n          results.testString(e, p, rest, absolute)\n        }\n      }\n    }\n    return results\n  }\n\n  testGlobstar(\n    e: Path,\n    pattern: Pattern,\n    rest: Pattern | null,\n    absolute: boolean,\n  ) {\n    if (this.dot || !e.name.startsWith('.')) {\n      if (!pattern.hasMore()) {\n        this.matches.add(e, absolute, false)\n      }\n      if (e.canReaddir()) {\n        // if we're in follow mode or it's not a symlink, just keep\n        // testing the same pattern. If there's more after the globstar,\n        // then this symlink consumes the globstar. If not, then we can\n        // follow at most ONE symlink along the way, so we mark it, which\n        // also checks to ensure that it wasn't already marked.\n        if (this.follow || !e.isSymbolicLink()) {\n          this.subwalks.add(e, pattern)\n        } else if (e.isSymbolicLink()) {\n          if (rest && pattern.checkFollowGlobstar()) {\n            this.subwalks.add(e, rest)\n          } else if (pattern.markFollowGlobstar()) {\n            this.subwalks.add(e, pattern)\n          }\n        }\n      }\n    }\n    // if the NEXT thing matches this entry, then also add\n    // the rest.\n    if (rest) {\n      const rp = rest.pattern()\n      if (\n        typeof rp === 'string' &&\n        // dots and empty were handled already\n        rp !== '..' &&\n        rp !== '' &&\n        rp !== '.'\n      ) {\n        this.testString(e, rp, rest.rest(), absolute)\n      } else if (rp === '..') {\n        /* c8 ignore start */\n        const ep = e.parent || e\n        /* c8 ignore stop */\n        this.subwalks.add(ep, rest)\n      } else if (rp instanceof RegExp) {\n        this.testRegExp(e, rp, rest.rest(), absolute)\n      }\n    }\n  }\n\n  testRegExp(\n    e: Path,\n    p: MMRegExp,\n    rest: Pattern | null,\n    absolute: boolean,\n  ) {\n    if (!p.test(e.name)) return\n    if (!rest) {\n      this.matches.add(e, absolute, false)\n    } else {\n      this.subwalks.add(e, rest)\n    }\n  }\n\n  testString(e: Path, p: string, rest: Pattern | null, absolute: boolean) {\n    // should never happen?\n    if (!e.isNamed(p)) return\n    if (!rest) {\n      this.matches.add(e, absolute, false)\n    } else {\n      this.subwalks.add(e, rest)\n    }\n  }\n}\n", "/**\n * Single-use utility classes to provide functionality to the {@link Glob}\n * methods.\n *\n * @module\n */\nimport { Minipass } from 'minipass'\nimport { Path } from 'path-scurry'\nimport { Ignore, IgnoreLike } from './ignore.js'\n\n// XXX can we somehow make it so that it NEVER processes a given path more than\n// once, enough that the match set tracking is no longer needed?  that'd speed\n// things up a lot.  Or maybe bring back nounique, and skip it in that case?\n\n// a single minimatch set entry with 1 or more parts\nimport { Pattern } from './pattern.js'\nimport { Processor } from './processor.js'\n\nexport interface GlobWalkerOpts {\n  absolute?: boolean\n  allowWindowsEscape?: boolean\n  cwd?: string | URL\n  dot?: boolean\n  dotRelative?: boolean\n  follow?: boolean\n  ignore?: string | string[] | IgnoreLike\n  mark?: boolean\n  matchBase?: boolean\n  // Note: maxDepth here means \"maximum actual Path.depth()\",\n  // not \"maximum depth beyond cwd\"\n  maxDepth?: number\n  nobrace?: boolean\n  nocase?: boolean\n  nodir?: boolean\n  noext?: boolean\n  noglobstar?: boolean\n  platform?: NodeJS.Platform\n  posix?: boolean\n  realpath?: boolean\n  root?: string\n  stat?: boolean\n  signal?: AbortSignal\n  windowsPathsNoEscape?: boolean\n  withFileTypes?: boolean\n  includeChildMatches?: boolean\n}\n\nexport type GWOFileTypesTrue = GlobWalkerOpts & {\n  withFileTypes: true\n}\nexport type GWOFileTypesFalse = GlobWalkerOpts & {\n  withFileTypes: false\n}\nexport type GWOFileTypesUnset = GlobWalkerOpts & {\n  withFileTypes?: undefined\n}\n\nexport type Result<O extends GlobWalkerOpts> =\n  O extends GWOFileTypesTrue ? Path\n  : O extends GWOFileTypesFalse ? string\n  : O extends GWOFileTypesUnset ? string\n  : Path | string\n\nexport type Matches<O extends GlobWalkerOpts> =\n  O extends GWOFileTypesTrue ? Set<Path>\n  : O extends GWOFileTypesFalse ? Set<string>\n  : O extends GWOFileTypesUnset ? Set<string>\n  : Set<Path | string>\n\nexport type MatchStream<O extends GlobWalkerOpts> = Minipass<\n  Result<O>,\n  Result<O>\n>\n\nconst makeIgnore = (\n  ignore: string | string[] | IgnoreLike,\n  opts: GlobWalkerOpts,\n): IgnoreLike =>\n  typeof ignore === 'string' ? new Ignore([ignore], opts)\n  : Array.isArray(ignore) ? new Ignore(ignore, opts)\n  : ignore\n\n/**\n * basic walking utilities that all the glob walker types use\n */\nexport abstract class GlobUtil<O extends GlobWalkerOpts = GlobWalkerOpts> {\n  path: Path\n  patterns: Pattern[]\n  opts: O\n  seen: Set<Path> = new Set<Path>()\n  paused: boolean = false\n  aborted: boolean = false\n  #onResume: (() => any)[] = []\n  #ignore?: IgnoreLike\n  #sep: '\\\\' | '/'\n  signal?: AbortSignal\n  maxDepth: number\n  includeChildMatches: boolean\n\n  constructor(patterns: Pattern[], path: Path, opts: O)\n  constructor(patterns: Pattern[], path: Path, opts: O) {\n    this.patterns = patterns\n    this.path = path\n    this.opts = opts\n    this.#sep = !opts.posix && opts.platform === 'win32' ? '\\\\' : '/'\n    this.includeChildMatches = opts.includeChildMatches !== false\n    if (opts.ignore || !this.includeChildMatches) {\n      this.#ignore = makeIgnore(opts.ignore ?? [], opts)\n      if (\n        !this.includeChildMatches &&\n        typeof this.#ignore.add !== 'function'\n      ) {\n        const m = 'cannot ignore child matches, ignore lacks add() method.'\n        throw new Error(m)\n      }\n    }\n    // ignore, always set with maxDepth, but it's optional on the\n    // GlobOptions type\n    /* c8 ignore start */\n    this.maxDepth = opts.maxDepth || Infinity\n    /* c8 ignore stop */\n    if (opts.signal) {\n      this.signal = opts.signal\n      this.signal.addEventListener('abort', () => {\n        this.#onResume.length = 0\n      })\n    }\n  }\n\n  #ignored(path: Path): boolean {\n    return this.seen.has(path) || !!this.#ignore?.ignored?.(path)\n  }\n  #childrenIgnored(path: Path): boolean {\n    return !!this.#ignore?.childrenIgnored?.(path)\n  }\n\n  // backpressure mechanism\n  pause() {\n    this.paused = true\n  }\n  resume() {\n    /* c8 ignore start */\n    if (this.signal?.aborted) return\n    /* c8 ignore stop */\n    this.paused = false\n    let fn: (() => any) | undefined = undefined\n    while (!this.paused && (fn = this.#onResume.shift())) {\n      fn()\n    }\n  }\n  onResume(fn: () => any) {\n    if (this.signal?.aborted) return\n    /* c8 ignore start */\n    if (!this.paused) {\n      fn()\n    } else {\n      /* c8 ignore stop */\n      this.#onResume.push(fn)\n    }\n  }\n\n  // do the requisite realpath/stat checking, and return the path\n  // to add or undefined to filter it out.\n  async matchCheck(e: Path, ifDir: boolean): Promise<Path | undefined> {\n    if (ifDir && this.opts.nodir) return undefined\n    let rpc: Path | undefined\n    if (this.opts.realpath) {\n      rpc = e.realpathCached() || (await e.realpath())\n      if (!rpc) return undefined\n      e = rpc\n    }\n    const needStat = e.isUnknown() || this.opts.stat\n    const s = needStat ? await e.lstat() : e\n    if (this.opts.follow && this.opts.nodir && s?.isSymbolicLink()) {\n      const target = await s.realpath()\n      /* c8 ignore start */\n      if (target && (target.isUnknown() || this.opts.stat)) {\n        await target.lstat()\n      }\n      /* c8 ignore stop */\n    }\n    return this.matchCheckTest(s, ifDir)\n  }\n\n  matchCheckTest(e: Path | undefined, ifDir: boolean): Path | undefined {\n    return (\n        e &&\n          (this.maxDepth === Infinity || e.depth() <= this.maxDepth) &&\n          (!ifDir || e.canReaddir()) &&\n          (!this.opts.nodir || !e.isDirectory()) &&\n          (!this.opts.nodir ||\n            !this.opts.follow ||\n            !e.isSymbolicLink() ||\n            !e.realpathCached()?.isDirectory()) &&\n          !this.#ignored(e)\n      ) ?\n        e\n      : undefined\n  }\n\n  matchCheckSync(e: Path, ifDir: boolean): Path | undefined {\n    if (ifDir && this.opts.nodir) return undefined\n    let rpc: Path | undefined\n    if (this.opts.realpath) {\n      rpc = e.realpathCached() || e.realpathSync()\n      if (!rpc) return undefined\n      e = rpc\n    }\n    const needStat = e.isUnknown() || this.opts.stat\n    const s = needStat ? e.lstatSync() : e\n    if (this.opts.follow && this.opts.nodir && s?.isSymbolicLink()) {\n      const target = s.realpathSync()\n      if (target && (target?.isUnknown() || this.opts.stat)) {\n        target.lstatSync()\n      }\n    }\n    return this.matchCheckTest(s, ifDir)\n  }\n\n  abstract matchEmit(p: Result<O>): void\n  abstract matchEmit(p: string | Path): void\n\n  matchFinish(e: Path, absolute: boolean) {\n    if (this.#ignored(e)) return\n    // we know we have an ignore if this is false, but TS doesn't\n    if (!this.includeChildMatches && this.#ignore?.add) {\n      const ign = `${e.relativePosix()}/**`\n      this.#ignore.add(ign)\n    }\n    const abs =\n      this.opts.absolute === undefined ? absolute : this.opts.absolute\n    this.seen.add(e)\n    const mark = this.opts.mark && e.isDirectory() ? this.#sep : ''\n    // ok, we have what we need!\n    if (this.opts.withFileTypes) {\n      this.matchEmit(e)\n    } else if (abs) {\n      const abs = this.opts.posix ? e.fullpathPosix() : e.fullpath()\n      this.matchEmit(abs + mark)\n    } else {\n      const rel = this.opts.posix ? e.relativePosix() : e.relative()\n      const pre =\n        this.opts.dotRelative && !rel.startsWith('..' + this.#sep) ?\n          '.' + this.#sep\n        : ''\n      this.matchEmit(!rel ? '.' + mark : pre + rel + mark)\n    }\n  }\n\n  async match(e: Path, absolute: boolean, ifDir: boolean): Promise<void> {\n    const p = await this.matchCheck(e, ifDir)\n    if (p) this.matchFinish(p, absolute)\n  }\n\n  matchSync(e: Path, absolute: boolean, ifDir: boolean): void {\n    const p = this.matchCheckSync(e, ifDir)\n    if (p) this.matchFinish(p, absolute)\n  }\n\n  walkCB(target: Path, patterns: Pattern[], cb: () => any) {\n    /* c8 ignore start */\n    if (this.signal?.aborted) cb()\n    /* c8 ignore stop */\n    this.walkCB2(target, patterns, new Processor(this.opts), cb)\n  }\n\n  walkCB2(\n    target: Path,\n    patterns: Pattern[],\n    processor: Processor,\n    cb: () => any,\n  ) {\n    if (this.#childrenIgnored(target)) return cb()\n    if (this.signal?.aborted) cb()\n    if (this.paused) {\n      this.onResume(() => this.walkCB2(target, patterns, processor, cb))\n      return\n    }\n    processor.processPatterns(target, patterns)\n\n    // done processing.  all of the above is sync, can be abstracted out.\n    // subwalks is a map of paths to the entry filters they need\n    // matches is a map of paths to [absolute, ifDir] tuples.\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      tasks++\n      this.match(m, absolute, ifDir).then(() => next())\n    }\n\n    for (const t of processor.subwalkTargets()) {\n      if (this.maxDepth !== Infinity && t.depth() >= this.maxDepth) {\n        continue\n      }\n      tasks++\n      const childrenCached = t.readdirCached()\n      if (t.calledReaddir())\n        this.walkCB3(t, childrenCached, processor, next)\n      else {\n        t.readdirCB(\n          (_, entries) => this.walkCB3(t, entries, processor, next),\n          true,\n        )\n      }\n    }\n\n    next()\n  }\n\n  walkCB3(\n    target: Path,\n    entries: Path[],\n    processor: Processor,\n    cb: () => any,\n  ) {\n    processor = processor.filterEntries(target, entries)\n\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      tasks++\n      this.match(m, absolute, ifDir).then(() => next())\n    }\n    for (const [target, patterns] of processor.subwalks.entries()) {\n      tasks++\n      this.walkCB2(target, patterns, processor.child(), next)\n    }\n\n    next()\n  }\n\n  walkCBSync(target: Path, patterns: Pattern[], cb: () => any) {\n    /* c8 ignore start */\n    if (this.signal?.aborted) cb()\n    /* c8 ignore stop */\n    this.walkCB2Sync(target, patterns, new Processor(this.opts), cb)\n  }\n\n  walkCB2Sync(\n    target: Path,\n    patterns: Pattern[],\n    processor: Processor,\n    cb: () => any,\n  ) {\n    if (this.#childrenIgnored(target)) return cb()\n    if (this.signal?.aborted) cb()\n    if (this.paused) {\n      this.onResume(() =>\n        this.walkCB2Sync(target, patterns, processor, cb),\n      )\n      return\n    }\n    processor.processPatterns(target, patterns)\n\n    // done processing.  all of the above is sync, can be abstracted out.\n    // subwalks is a map of paths to the entry filters they need\n    // matches is a map of paths to [absolute, ifDir] tuples.\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      this.matchSync(m, absolute, ifDir)\n    }\n\n    for (const t of processor.subwalkTargets()) {\n      if (this.maxDepth !== Infinity && t.depth() >= this.maxDepth) {\n        continue\n      }\n      tasks++\n      const children = t.readdirSync()\n      this.walkCB3Sync(t, children, processor, next)\n    }\n\n    next()\n  }\n\n  walkCB3Sync(\n    target: Path,\n    entries: Path[],\n    processor: Processor,\n    cb: () => any,\n  ) {\n    processor = processor.filterEntries(target, entries)\n\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      this.matchSync(m, absolute, ifDir)\n    }\n    for (const [target, patterns] of processor.subwalks.entries()) {\n      tasks++\n      this.walkCB2Sync(target, patterns, processor.child(), next)\n    }\n\n    next()\n  }\n}\n\nexport class GlobWalker<\n  O extends GlobWalkerOpts = GlobWalkerOpts,\n> extends GlobUtil<O> {\n  matches = new Set<Result<O>>()\n\n  constructor(patterns: Pattern[], path: Path, opts: O) {\n    super(patterns, path, opts)\n  }\n\n  matchEmit(e: Result<O>): void {\n    this.matches.add(e)\n  }\n\n  async walk(): Promise<Set<Result<O>>> {\n    if (this.signal?.aborted) throw this.signal.reason\n    if (this.path.isUnknown()) {\n      await this.path.lstat()\n    }\n    await new Promise((res, rej) => {\n      this.walkCB(this.path, this.patterns, () => {\n        if (this.signal?.aborted) {\n          rej(this.signal.reason)\n        } else {\n          res(this.matches)\n        }\n      })\n    })\n    return this.matches\n  }\n\n  walkSync(): Set<Result<O>> {\n    if (this.signal?.aborted) throw this.signal.reason\n    if (this.path.isUnknown()) {\n      this.path.lstatSync()\n    }\n    // nothing for the callback to do, because this never pauses\n    this.walkCBSync(this.path, this.patterns, () => {\n      if (this.signal?.aborted) throw this.signal.reason\n    })\n    return this.matches\n  }\n}\n\nexport class GlobStream<\n  O extends GlobWalkerOpts = GlobWalkerOpts,\n> extends GlobUtil<O> {\n  results: Minipass<Result<O>, Result<O>>\n\n  constructor(patterns: Pattern[], path: Path, opts: O) {\n    super(patterns, path, opts)\n    this.results = new Minipass<Result<O>, Result<O>>({\n      signal: this.signal,\n      objectMode: true,\n    })\n    this.results.on('drain', () => this.resume())\n    this.results.on('resume', () => this.resume())\n  }\n\n  matchEmit(e: Result<O>): void {\n    this.results.write(e)\n    if (!this.results.flowing) this.pause()\n  }\n\n  stream(): MatchStream<O> {\n    const target = this.path\n    if (target.isUnknown()) {\n      target.lstat().then(() => {\n        this.walkCB(target, this.patterns, () => this.results.end())\n      })\n    } else {\n      this.walkCB(target, this.patterns, () => this.results.end())\n    }\n    return this.results\n  }\n\n  streamSync(): MatchStream<O> {\n    if (this.path.isUnknown()) {\n      this.path.lstatSync()\n    }\n    this.walkCBSync(this.path, this.patterns, () => this.results.end())\n    return this.results\n  }\n}\n", "import { Minimatch } from 'minimatch'\nimport { GlobOptions } from './glob.js'\n\n/**\n * Return true if the patterns provided contain any magic glob characters,\n * given the options provided.\n *\n * Brace expansion is not considered \"magic\" unless the `magicalBraces` option\n * is set, as brace expansion just turns one string into an array of strings.\n * So a pattern like `'x{a,b}y'` would return `false`, because `'xay'` and\n * `'xby'` both do not contain any magic glob characters, and it's treated the\n * same as if you had called it on `['xay', 'xby']`. When `magicalBraces:true`\n * is in the options, brace expansion _is_ treated as a pattern having magic.\n */\nexport const hasMagic = (\n  pattern: string | string[],\n  options: GlobOptions = {},\n): boolean => {\n  if (!Array.isArray(pattern)) {\n    pattern = [pattern]\n  }\n  for (const p of pattern) {\n    if (new Minimatch(p, options).hasMagic()) return true\n  }\n  return false\n}\n", "import { escape, unescape } from 'minimatch'\nimport { Minipass } from 'minipass'\nimport { Path } from 'path-scurry'\nimport type {\n  GlobOptions,\n  GlobOptionsWithFileTypesFalse,\n  GlobOptionsWithFileTypesTrue,\n  GlobOptionsWithFileTypesUnset,\n} from './glob.js'\nimport { Glob } from './glob.js'\nimport { hasMagic } from './has-magic.js'\n\nexport { escape, unescape } from 'minimatch'\nexport type {\n  FSOption,\n  Path,\n  WalkOptions,\n  WalkOptionsWithFileTypesTrue,\n  WalkOptionsWithFileTypesUnset,\n} from 'path-scurry'\nexport { Glob } from './glob.js'\nexport type {\n  GlobOptions,\n  GlobOptionsWithFileTypesFalse,\n  GlobOptionsWithFileTypesTrue,\n  GlobOptionsWithFileTypesUnset,\n} from './glob.js'\nexport { hasMagic } from './has-magic.js'\nexport { Ignore } from './ignore.js'\nexport type { IgnoreLike } from './ignore.js'\nexport type { MatchStream } from './walker.js'\n\n/**\n * Syncronous form of {@link globStream}. Will read all the matches as fast as\n * you consume them, even all in a single tick if you consume them immediately,\n * but will still respond to backpressure if they're not consumed immediately.\n */\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): Minipass<Path, Path>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesUnset,\n): Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptions,\n): Minipass<Path, Path> | Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).streamSync()\n}\n\n/**\n * Return a stream that emits all the strings or `Path` objects and\n * then emits `end` when completed.\n */\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): Minipass<Path, Path>\nexport function globStream(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined,\n): Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptions,\n): Minipass<Path, Path> | Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).stream()\n}\n\n/**\n * Synchronous form of {@link glob}\n */\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): Path[]\nexport function globSync(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined,\n): string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptions,\n): Path[] | string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).walkSync()\n}\n\n/**\n * Perform an asynchronous glob search for the pattern(s) specified. Returns\n * [Path](https://isaacs.github.io/path-scurry/classes/PathBase) objects if the\n * {@link withFileTypes} option is set to `true`. See {@link GlobOptions} for\n * full option descriptions.\n */\nasync function glob_(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined,\n): Promise<string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): Promise<Path[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): Promise<string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptions,\n): Promise<Path[] | string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).walk()\n}\n\n/**\n * Return a sync iterator for walking glob pattern matches.\n */\nexport function globIterateSync(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined,\n): Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): Generator<Path, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptions,\n): Generator<Path, void, void> | Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).iterateSync()\n}\n\n/**\n * Return an async iterator for walking glob pattern matches.\n */\nexport function globIterate(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined,\n): AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue,\n): AsyncGenerator<Path, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse,\n): AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptions,\n): AsyncGenerator<Path, void, void> | AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptions = {},\n) {\n  return new Glob(pattern, options).iterate()\n}\n\n// aliases: glob.sync.stream() glob.stream.sync() glob.sync() etc\nexport const streamSync = globStreamSync\nexport const stream = Object.assign(globStream, { sync: globStreamSync })\nexport const iterateSync = globIterateSync\nexport const iterate = Object.assign(globIterate, {\n  sync: globIterateSync,\n})\nexport const sync = Object.assign(globSync, {\n  stream: globStreamSync,\n  iterate: globIterateSync,\n})\n\nexport const glob = Object.assign(glob_, {\n  glob: glob_,\n  globSync,\n  sync,\n  globStream,\n  stream,\n  globStreamSync,\n  streamSync,\n  globIterate,\n  iterate,\n  globIterateSync,\n  iterateSync,\n  Glob,\n  hasMagic,\n  escape,\n  unescape,\n})\nglob.glob = glob\n", "import { dirname } from 'path'\nimport { MkdirpOptions, optsArg } from './opts-arg.js'\n\nexport const mkdirpManualSync = (\n  path: string,\n  options?: MkdirpOptions,\n  made?: string | undefined | void\n): string | undefined | void => {\n  const parent = dirname(path)\n  const opts = { ...optsArg(options), recursive: false }\n\n  if (parent === path) {\n    try {\n      return opts.mkdirSync(path, opts)\n    } catch (er) {\n      // swallowed by recursive implementation on posix systems\n      // any other error is a failure\n      const fer = er as NodeJS.ErrnoException\n      if (fer && fer.code !== 'EISDIR') {\n        throw er\n      }\n      return\n    }\n  }\n\n  try {\n    opts.mkdirSync(path, opts)\n    return made || path\n  } catch (er) {\n    const fer = er as NodeJS.ErrnoException\n    if (fer && fer.code === 'ENOENT') {\n      return mkdirpManualSync(path, opts, mkdirpManualSync(parent, opts, made))\n    }\n    if (fer && fer.code !== 'EEXIST' && fer && fer.code !== 'EROFS') {\n      throw er\n    }\n    try {\n      if (!opts.statSync(path).isDirectory()) throw er\n    } catch (_) {\n      throw er\n    }\n  }\n}\n\nexport const mkdirpManual = Object.assign(\n  async (\n    path: string,\n    options?: MkdirpOptions,\n    made?: string | undefined | void\n  ): Promise<string | undefined | void> => {\n    const opts = optsArg(options)\n    opts.recursive = false\n    const parent = dirname(path)\n    if (parent === path) {\n      return opts.mkdirAsync(path, opts).catch(er => {\n        // swallowed by recursive implementation on posix systems\n        // any other error is a failure\n        const fer = er as NodeJS.ErrnoException\n        if (fer && fer.code !== 'EISDIR') {\n          throw er\n        }\n      })\n    }\n\n    return opts.mkdirAsync(path, opts).then(\n      () => made || path,\n      async er => {\n        const fer = er as NodeJS.ErrnoException\n        if (fer && fer.code === 'ENOENT') {\n          return mkdirpManual(parent, opts).then(\n            (made?: string | undefined | void) => mkdirpManual(path, opts, made)\n          )\n        }\n        if (fer && fer.code !== 'EEXIST' && fer.code !== 'EROFS') {\n          throw er\n        }\n        return opts.statAsync(path).then(\n          st => {\n            if (st.isDirectory()) {\n              return made\n            } else {\n              throw er\n            }\n          },\n          () => {\n            throw er\n          }\n        )\n      }\n    )\n  },\n  { sync: mkdirpManualSync }\n)\n", "import {\n  MakeDirectoryOptions,\n  mkdir,\n  mkdirSync,\n  stat,\n  Stats,\n  statSync,\n} from 'fs'\n\nexport interface FsProvider {\n  stat?: (\n    path: string,\n    callback: (err: NodeJS.ErrnoException | null, stats: Stats) => any\n  ) => any\n  mkdir?: (\n    path: string,\n    opts: MakeDirectoryOptions & { recursive?: boolean },\n    callback: (err: NodeJS.ErrnoException | null, made?: string) => any\n  ) => any\n  statSync?: (path: string) => Stats\n  mkdirSync?: (\n    path: string,\n    opts: MakeDirectoryOptions & { recursive?: boolean }\n  ) => string | undefined\n}\n\ninterface Options extends FsProvider {\n  mode?: number | string\n  fs?: FsProvider\n  mkdirAsync?: (\n    path: string,\n    opts: MakeDirectoryOptions & { recursive?: boolean }\n  ) => Promise<string | undefined>\n  statAsync?: (path: string) => Promise<Stats>\n}\n\nexport type MkdirpOptions = Options | number | string\n\nexport interface MkdirpOptionsResolved {\n  mode: number\n  fs: FsProvider\n  mkdirAsync: (\n    path: string,\n    opts: MakeDirectoryOptions & { recursive?: boolean }\n  ) => Promise<string | undefined>\n  statAsync: (path: string) => Promise<Stats>\n  stat: (\n    path: string,\n    callback: (err: NodeJS.ErrnoException | null, stats: Stats) => any\n  ) => any\n  mkdir: (\n    path: string,\n    opts: MakeDirectoryOptions & { recursive?: boolean },\n    callback: (err: NodeJS.ErrnoException | null, made?: string) => any\n  ) => any\n  statSync: (path: string) => Stats\n  mkdirSync: (\n    path: string,\n    opts: MakeDirectoryOptions & { recursive?: boolean }\n  ) => string | undefined\n  recursive?: boolean\n}\n\nexport const optsArg = (opts?: MkdirpOptions): MkdirpOptionsResolved => {\n  if (!opts) {\n    opts = { mode: 0o777 }\n  } else if (typeof opts === 'object') {\n    opts = { mode: 0o777, ...opts }\n  } else if (typeof opts === 'number') {\n    opts = { mode: opts }\n  } else if (typeof opts === 'string') {\n    opts = { mode: parseInt(opts, 8) }\n  } else {\n    throw new TypeError('invalid options argument')\n  }\n\n  const resolved = opts as MkdirpOptionsResolved\n  const optsFs = opts.fs || {}\n\n  opts.mkdir = opts.mkdir || optsFs.mkdir || mkdir\n\n  opts.mkdirAsync = opts.mkdirAsync\n    ? opts.mkdirAsync\n    : async (\n        path: string,\n        options: MakeDirectoryOptions & { recursive?: boolean }\n      ): Promise<string | undefined> => {\n        return new Promise<string | undefined>((res, rej) =>\n          resolved.mkdir(path, options, (er, made) =>\n            er ? rej(er) : res(made)\n          )\n        )\n      }\n\n  opts.stat = opts.stat || optsFs.stat || stat\n  opts.statAsync = opts.statAsync\n    ? opts.statAsync\n    : async (path: string) =>\n        new Promise((res, rej) =>\n          resolved.stat(path, (err, stats) => (err ? rej(err) : res(stats)))\n        )\n\n  opts.statSync = opts.statSync || optsFs.statSync || statSync\n  opts.mkdirSync = opts.mkdirSync || optsFs.mkdirSync || mkdirSync\n\n  return resolved\n}\n", "import { dirname } from 'path'\nimport { findMade, findMadeSync } from './find-made.js'\nimport { mkdirpManual, mkdirpManualSync } from './mkdirp-manual.js'\nimport { MkdirpOptions, optsArg } from './opts-arg.js'\n\nexport const mkdirpNativeSync = (\n  path: string,\n  options?: MkdirpOptions\n): string | void | undefined => {\n  const opts = optsArg(options)\n  opts.recursive = true\n  const parent = dirname(path)\n  if (parent === path) {\n    return opts.mkdirSync(path, opts)\n  }\n\n  const made = findMadeSync(opts, path)\n  try {\n    opts.mkdirSync(path, opts)\n    return made\n  } catch (er) {\n    const fer = er as NodeJS.ErrnoException\n    if (fer && fer.code === 'ENOENT') {\n      return mkdirpManualSync(path, opts)\n    } else {\n      throw er\n    }\n  }\n}\n\nexport const mkdirpNative = Object.assign(\n  async (\n    path: string,\n    options?: MkdirpOptions\n  ): Promise<string | void | undefined> => {\n    const opts = { ...optsArg(options), recursive: true }\n    const parent = dirname(path)\n    if (parent === path) {\n      return await opts.mkdirAsync(path, opts)\n    }\n\n    return findMade(opts, path).then((made?: string | undefined) =>\n      opts\n        .mkdirAsync(path, opts)\n        .then(m => made || m)\n        .catch(er => {\n          const fer = er as NodeJS.ErrnoException\n          if (fer && fer.code === 'ENOENT') {\n            return mkdirpManual(path, opts)\n          } else {\n            throw er\n          }\n        })\n    )\n  },\n  { sync: mkdirpNativeSync }\n)\n", "import { dirname } from 'path'\nimport { MkdirpOptionsResolved } from './opts-arg.js'\n\nexport const findMade = async (\n  opts: MkdirpOptionsResolved,\n  parent: string,\n  path?: string\n): Promise<undefined | string> => {\n  // we never want the 'made' return value to be a root directory\n  if (path === parent) {\n    return\n  }\n\n  return opts.statAsync(parent).then(\n    st => (st.isDirectory() ? path : undefined), // will fail later\n    er => {\n      const fer = er as NodeJS.ErrnoException\n      return fer && fer.code === 'ENOENT'\n        ? findMade(opts, dirname(parent), parent)\n        : undefined\n    }\n  )\n}\n\nexport const findMadeSync = (\n  opts: MkdirpOptionsResolved,\n  parent: string,\n  path?: string\n): undefined | string => {\n  if (path === parent) {\n    return undefined\n  }\n\n  try {\n    return opts.statSync(parent).isDirectory() ? path : undefined\n  } catch (er) {\n    const fer = er as NodeJS.ErrnoException\n    return fer && fer.code === 'ENOENT'\n      ? findMadeSync(opts, dirname(parent), parent)\n      : undefined\n  }\n}\n", "const platform = process.env.__TESTING_MKDIRP_PLATFORM__ || process.platform\nimport { parse, resolve } from 'path'\nexport const pathArg = (path: string) => {\n  if (/\\0/.test(path)) {\n    // simulate same failure that node raises\n    throw Object.assign(\n      new TypeError('path must be a string without null bytes'),\n      {\n        path,\n        code: 'ERR_INVALID_ARG_VALUE',\n      }\n    )\n  }\n\n  path = resolve(path)\n  if (platform === 'win32') {\n    const badWinChars = /[*|\"<>?:]/\n    const { root } = parse(path)\n    if (badWinChars.test(path.substring(root.length))) {\n      throw Object.assign(new Error('Illegal characters in path.'), {\n        path,\n        code: 'EINVAL',\n      })\n    }\n  }\n\n  return path\n}\n", "import { mkdir, mkdirSync } from 'fs'\nimport { MkdirpOptions, optsArg } from './opts-arg.js'\n\nconst version = process.env.__TESTING_MKDIRP_NODE_VERSION__ || process.version\nconst versArr = version.replace(/^v/, '').split('.')\nconst hasNative = +versArr[0] > 10 || (+versArr[0] === 10 && +versArr[1] >= 12)\n\nexport const useNativeSync = !hasNative\n  ? () => false\n  : (opts?: MkdirpOptions) => optsArg(opts).mkdirSync === mkdirSync\n\nexport const useNative = Object.assign(\n  !hasNative\n    ? () => false\n    : (opts?: MkdirpOptions) => optsArg(opts).mkdir === mkdir,\n  {\n    sync: useNativeSync,\n  }\n)\n", "import { mkdirpManual, mkdirpManualSync } from './mkdirp-manual.js'\nimport { mkdirpNative, mkdirpNativeSync } from './mkdirp-native.js'\nimport { MkdirpOptions, optsArg } from './opts-arg.js'\nimport { pathArg } from './path-arg.js'\nimport { useNative, useNativeSync } from './use-native.js'\n/* c8 ignore start */\nexport { mkdirpManual, mkdirpManualSync } from './mkdirp-manual.js'\nexport { mkdirpNative, mkdirpNativeSync } from './mkdirp-native.js'\nexport { useNative, useNativeSync } from './use-native.js'\n/* c8 ignore stop */\n\nexport const mkdirpSync = (path: string, opts?: MkdirpOptions) => {\n  path = pathArg(path)\n  const resolved = optsArg(opts)\n  return useNativeSync(resolved)\n    ? mkdirpNativeSync(path, resolved)\n    : mkdirpManualSync(path, resolved)\n}\n\nexport const sync = mkdirpSync\nexport const manual = mkdirpManual\nexport const manualSync = mkdirpManualSync\nexport const native = mkdirpNative\nexport const nativeSync = mkdirpNativeSync\nexport const mkdirp = Object.assign(\n  async (path: string, opts?: MkdirpOptions) => {\n    path = pathArg(path)\n    const resolved = optsArg(opts)\n    return useNative(resolved)\n      ? mkdirpNative(path, resolved)\n      : mkdirpManual(path, resolved)\n  },\n  {\n    mkdirpSync,\n    mkdirpNative,\n    mkdirpNativeSync,\n    mkdirpManual,\n    mkdirpManualSync,\n\n    sync: mkdirpSync,\n    native: mkdirpNative,\n    nativeSync: mkdirpNativeSync,\n    manual: mkdirpManual,\n    manualSync: mkdirpManualSync,\n    useNative,\n    useNativeSync,\n  }\n)\n", "import { glob, globSync } from 'glob'\nimport { mkdirp, mkdirpSync } from 'mkdirp'\nimport constants from 'node:constants'\nimport { createHash } from 'node:crypto'\nimport {\n  chmodSync,\n  copyFileSync,\n  linkSync,\n  readFileSync,\n  readlinkSync,\n  symlinkSync,\n  unlinkSync,\n} from 'node:fs'\nimport {\n  chmod,\n  copyFile,\n  link,\n  readFile,\n  readlink,\n  symlink,\n} from 'node:fs/promises'\nimport { dirname, relative, resolve, sep } from 'node:path'\nimport { Path, PathScurry } from 'path-scurry'\nimport { rimraf, rimrafSync } from 'rimraf'\n\nconst mkdirpClobber = async (dir: string) => {\n  try {\n    return await mkdirp(dir)\n  } catch (e) {\n    await mkdirpClobber(dirname(dir))\n    await rimraf(dir)\n    return await mkdirp(dir)\n  }\n}\n\nconst mkdirpClobberSync = (dir: string) => {\n  try {\n    return mkdirpSync(dir)\n  } catch (e) {\n    mkdirpClobberSync(dirname(dir))\n    rimrafSync(dir)\n    return mkdirpSync(dir)\n  }\n}\n\nconst syncFile = async (src: Path, dest: Path) => {\n  // only sync files, dirs, and symlinks\n  // Creating these is a pain to test cross platform\n  /* c8 ignore start */\n  if (!(src.isSymbolicLink() || src.isDirectory() || src.isFile())) {\n    if (!dest.isENOENT()) await rimraf(dest.fullpath())\n    return\n  }\n  /* c8 ignore stop */\n\n  if (src.isSymbolicLink()) {\n    const target = await readlink(src.fullpath())\n    if (!dest.isENOENT()) {\n      const dp = dest.isSymbolicLink() && (await readlink(dest.fullpath()))\n      if (dp === target) return\n      await rimraf(dest.fullpath())\n    }\n    await mkdirpClobber(dirname(dest.fullpath()))\n    await symlink(target, dest.fullpath())\n    /* c8 ignore start */\n    if (constants.O_SYMLINK && src.mode) {\n      try {\n        await chmod(dest.fullpath(), src.mode)\n      } catch {}\n    }\n    /* c8 ignore stop */\n    return\n  }\n\n  if (src.isDirectory()) {\n    if (!dest.isDirectory()) {\n      await mkdirpClobber(dest.fullpath())\n    }\n  } else {\n    // must be file\n    let write = true\n    if (!dest.isENOENT() && !dest.isFile()) await rimraf(dest.fullpath())\n    else if (await contentMatch(src, dest)) write = false\n    if (write) {\n      await mkdirpClobber(dirname(dest.fullpath()))\n      // platform specific\n      /* c8 ignore start */\n      await link(src.fullpath(), dest.fullpath()).catch(() =>\n        copyFile(src.fullpath(), dest.fullpath()),\n      )\n      /* c8 ignore stop */\n    }\n  }\n  const mode = src.mode\n  /* c8 ignore start */\n  if (!mode) return\n  /* c8 ignore stop */\n  await chmod(dest.fullpath(), mode)\n}\n\nconst syncFileSync = (src: Path, dest: Path) => {\n  // only sync files, dirs, and symlinks\n  // Creating these is a pain to test cross platform\n  /* c8 ignore start */\n  if (!(src.isSymbolicLink() || src.isDirectory() || src.isFile())) {\n    if (!dest.isENOENT()) rimrafSync(dest.fullpath())\n    return\n  }\n  /* c8 ignore stop */\n\n  if (src.isSymbolicLink()) {\n    const target = readlinkSync(src.fullpath())\n    if (!dest.isENOENT()) {\n      const dp = dest.isSymbolicLink() && readlinkSync(dest.fullpath())\n      if (dp === target) return\n      rimrafSync(dest.fullpath())\n    }\n    mkdirpClobberSync(dirname(dest.fullpath()))\n    symlinkSync(target, dest.fullpath())\n    /* c8 ignore start */\n    if (constants.O_SYMLINK && src.mode) {\n      try {\n        chmodSync(dest.fullpath(), src.mode)\n      } catch {}\n    }\n    /* c8 ignore stop */\n    return\n  }\n\n  if (src.isDirectory()) {\n    if (!dest.isDirectory()) {\n      mkdirpClobberSync(dest.fullpath())\n    }\n  } else {\n    // must be file\n    let write = true\n    if (!dest.isENOENT() && !dest.isFile()) rimrafSync(dest.fullpath())\n    else if (contentMatchSync(src, dest)) write = false\n    if (write) {\n      mkdirpClobberSync(dirname(dest.fullpath()))\n      // platform specific\n      /* c8 ignore start */\n      try {\n        linkSync(src.fullpath(), dest.fullpath())\n      } catch {\n        copyFileSync(src.fullpath(), dest.fullpath())\n      }\n      /* c8 ignore stop */\n    }\n  }\n\n  const mode = src.mode\n  /* c8 ignore start */\n  if (!mode) return\n  /* c8 ignore stop */\n  chmodSync(dest.fullpath(), mode)\n}\n\nconst contentMatch = async (src: Path, dest: Path) => {\n  try {\n    return (\n      createHash('sha512')\n        .update(await readFile(src.fullpath()))\n        .digest('hex') ===\n      createHash('sha512')\n        .update(await readFile(dest.fullpath()))\n        .digest('hex')\n    )\n    // we should only be doing this if we know it's a valid file already\n    // but just in case we can't read it, that's not a match.\n    /* c8 ignore start */\n  } catch {\n    return false\n  }\n  /* c8 ignore stop */\n}\n\nconst contentMatchSync = (src: Path, dest: Path) => {\n  try {\n    return (\n      createHash('sha512')\n        .update(readFileSync(src.fullpath()))\n        .digest('hex') ===\n      createHash('sha512')\n        .update(readFileSync(dest.fullpath()))\n        .digest('hex')\n    )\n    // we should only be doing this if we know it's a valid file already\n    // but just in case we can't read it, that's not a match.\n    /* c8 ignore start */\n  } catch {\n    return false\n  }\n  /* c8 ignore stop */\n}\n\n// if a is a parent of b, or b is a parent of a, then one of them\n// will not start with .. in the relative path.\nconst dots = `..${sep}`\nconst dirsRelated = (a: string, b: string): boolean => {\n  if (a === b) return true\n  const relab = relative(a, b)\n  const relba = relative(a, b)\n  if (!relab.startsWith(dots) || !relba.startsWith(dots)) return true\n  return false\n}\n\nexport const syncContent = async (from: string, to: string) => {\n  const scurry = new PathScurry(from)\n  const rfrom = resolve(from)\n  const rto = resolve(to)\n  if (dirname(rfrom) === rfrom || dirname(rto) === rto) {\n    throw new Error('cannot sync root directory')\n  }\n  /* c8 ignore start */\n  if (dirsRelated(rto, rfrom)) {\n    /* c8 ignore stop */\n    throw new Error('cannot copy directory into itself or its parent')\n  }\n  const [src, dest] = await Promise.all([\n    await glob('**', { scurry, withFileTypes: true }),\n    await glob('**', { cwd: rto, withFileTypes: true }),\n  ])\n  await Promise.all([\n    ...src.map(async s => {\n      /* c8 ignore start */\n      if (!s.parent) throw new Error('cannot sync root directory')\n      /* c8 ignore stop */\n      const d = s.resolve(resolve(rto, s.relative()))\n      const parent = d.parent\n      /* c8 ignore start */\n      if (!parent) throw new Error('cannot sync root directory')\n      /* c8 ignore stop */\n      await d.lstat()\n      await mkdirpClobber(parent.fullpath())\n      await syncFile(s, d)\n    }),\n    ...dest.map(async d => {\n      const s = scurry.cwd.resolve(resolve(rfrom, d.relative()))\n      await s.lstat()\n      if (s.isENOENT()) {\n        // race\n        /* c8 ignore start */\n        try {\n          await rimraf(d.fullpath())\n        } catch {}\n        /* c8 ignore stop */\n      }\n    }),\n  ])\n}\n\nexport const syncContentSync = (from: string, to: string) => {\n  const scurry = new PathScurry(from)\n  const rfrom = resolve(from)\n  const rto = resolve(to)\n  if (dirname(rfrom) === rfrom || dirname(rto) === rto) {\n    throw new Error('cannot sync root directory')\n  }\n  if (dirsRelated(rto, rfrom)) {\n    throw new Error('cannot copy directory into itself or its parent')\n  }\n  const [src, dest] = [\n    globSync('**', { scurry, withFileTypes: true }),\n    globSync('**', { cwd: rto, withFileTypes: true }),\n  ]\n  for (const s of src) {\n    /* c8 ignore start */\n    if (!s.parent) throw new Error('cannot sync root directory')\n    /* c8 ignore stop */\n    const d = s.resolve(resolve(rto, s.relative()))\n    const parent = d.parent\n    /* c8 ignore start */\n    if (!parent) throw new Error('cannot sync root directory')\n    /* c8 ignore stop */\n    d.lstatSync()\n    mkdirpClobberSync(parent.fullpath())\n    syncFileSync(s, d)\n  }\n  for (const d of dest) {\n    const s = scurry.cwd.resolve(resolve(rfrom, d.relative()))\n    s.lstatSync()\n    if (s.isENOENT()) {\n      // race\n      /* c8 ignore start */\n      try {\n        rimrafSync(d.fullpath())\n        unlinkSync(d.fullpath())\n      } catch {}\n      /* c8 ignore stop */\n    }\n  }\n}\n", "/**\n * @module LRUCache\n */\n\n// module-private names and types\n// this provides the default Perf object source.\n// it can be passed in via configuration to override it\n// for a single LRU object.\nexport type Perf = { now: () => number }\nconst defaultPerf: Perf =\n  (\n    typeof performance === 'object' &&\n    performance &&\n    typeof performance.now === 'function'\n  ) ?\n    performance\n  : Date\n\nconst warned = new Set<string>()\n\n// either a function or a class\ntype ForC = ((...a: any[]) => any) | { new (...a: any[]): any }\n\n/* c8 ignore start */\nconst PROCESS = (\n  typeof process === 'object' && !!process ?\n    process\n  : {}) as { [k: string]: any }\n/* c8 ignore start */\n\nconst emitWarning = (\n  msg: string,\n  type: string,\n  code: string,\n  fn: ForC,\n) => {\n  typeof PROCESS.emitWarning === 'function' ?\n    PROCESS.emitWarning(msg, type, code, fn)\n  : console.error(`[${code}] ${type}: ${msg}`)\n}\n\nlet AC = globalThis.AbortController\nlet AS = globalThis.AbortSignal\n\n/* c8 ignore start */\nif (typeof AC === 'undefined') {\n  //@ts-ignore\n  AS = class AbortSignal {\n    onabort?: (...a: any[]) => any\n    _onabort: ((...a: any[]) => any)[] = []\n    reason?: any\n    aborted: boolean = false\n    addEventListener(_: string, fn: (...a: any[]) => any) {\n      this._onabort.push(fn)\n    }\n  }\n  //@ts-ignore\n  AC = class AbortController {\n    constructor() {\n      warnACPolyfill()\n    }\n    signal = new AS()\n    abort(reason: any) {\n      if (this.signal.aborted) return\n      //@ts-ignore\n      this.signal.reason = reason\n      //@ts-ignore\n      this.signal.aborted = true\n      //@ts-ignore\n      for (const fn of this.signal._onabort) {\n        fn(reason)\n      }\n      this.signal.onabort?.(reason)\n    }\n  }\n  let printACPolyfillWarning =\n    PROCESS.env?.LRU_CACHE_IGNORE_AC_WARNING !== '1'\n  const warnACPolyfill = () => {\n    if (!printACPolyfillWarning) return\n    printACPolyfillWarning = false\n    emitWarning(\n      'AbortController is not defined. If using lru-cache in ' +\n        'node 14, load an AbortController polyfill from the ' +\n        '`node-abort-controller` package. A minimal polyfill is ' +\n        'provided for use by LRUCache.fetch(), but it should not be ' +\n        'relied upon in other contexts (eg, passing it to other APIs that ' +\n        'use AbortController/AbortSignal might have undesirable effects). ' +\n        'You may disable this with LRU_CACHE_IGNORE_AC_WARNING=1 in the env.',\n      'NO_ABORT_CONTROLLER',\n      'ENOTSUP',\n      warnACPolyfill,\n    )\n  }\n}\n/* c8 ignore stop */\n\nconst shouldWarn = (code: string) => !warned.has(code)\n\nconst TYPE = Symbol('type')\nexport type PosInt = number & { [TYPE]: 'Positive Integer' }\nexport type Index = number & { [TYPE]: 'LRUCache Index' }\n\nconst isPosInt = (n: any): n is PosInt =>\n  n && n === Math.floor(n) && n > 0 && isFinite(n)\n\nexport type UintArray = Uint8Array | Uint16Array | Uint32Array\nexport type NumberArray = UintArray | number[]\n\n/* c8 ignore start */\n// This is a little bit ridiculous, tbh.\n// The maximum array length is 2^32-1 or thereabouts on most JS impls.\n// And well before that point, you're caching the entire world, I mean,\n// that's ~32GB of just integers for the next/prev links, plus whatever\n// else to hold that many keys and values.  Just filling the memory with\n// zeroes at init time is brutal when you get that big.\n// But why not be complete?\n// Maybe in the future, these limits will have expanded.\nconst getUintArray = (max: number) =>\n  !isPosInt(max) ? null\n  : max <= Math.pow(2, 8) ? Uint8Array\n  : max <= Math.pow(2, 16) ? Uint16Array\n  : max <= Math.pow(2, 32) ? Uint32Array\n  : max <= Number.MAX_SAFE_INTEGER ? ZeroArray\n  : null\n/* c8 ignore stop */\n\nclass ZeroArray extends Array<number> {\n  constructor(size: number) {\n    super(size)\n    this.fill(0)\n  }\n}\nexport type { ZeroArray }\nexport type { Stack }\n\nexport type StackLike = Stack | Index[]\nclass Stack {\n  heap: NumberArray\n  length: number\n  // private constructor\n  static #constructing: boolean = false\n  static create(max: number): StackLike {\n    const HeapCls = getUintArray(max)\n    if (!HeapCls) return []\n    Stack.#constructing = true\n    const s = new Stack(max, HeapCls)\n    Stack.#constructing = false\n    return s\n  }\n  constructor(max: number, HeapCls: { new (n: number): NumberArray }) {\n    /* c8 ignore start */\n    if (!Stack.#constructing) {\n      throw new TypeError('instantiate Stack using Stack.create(n)')\n    }\n    /* c8 ignore stop */\n    this.heap = new HeapCls(max)\n    this.length = 0\n  }\n  push(n: Index) {\n    this.heap[this.length++] = n\n  }\n  pop(): Index {\n    return this.heap[--this.length] as Index\n  }\n}\n\n/**\n * Promise representing an in-progress {@link LRUCache#fetch} call\n */\nexport type BackgroundFetch<V> = Promise<V | undefined> & {\n  __returned: BackgroundFetch<V> | undefined\n  __abortController: AbortController\n  __staleWhileFetching: V | undefined\n}\n\nexport type DisposeTask<K, V> = [\n  value: V,\n  key: K,\n  reason: LRUCache.DisposeReason,\n]\n\nexport namespace LRUCache {\n  /**\n   * An integer greater than 0, reflecting the calculated size of items\n   */\n  export type Size = number\n\n  /**\n   * Integer greater than 0, representing some number of milliseconds, or the\n   * time at which a TTL started counting from.\n   */\n  export type Milliseconds = number\n\n  /**\n   * An integer greater than 0, reflecting a number of items\n   */\n  export type Count = number\n\n  /**\n   * The reason why an item was removed from the cache, passed\n   * to the {@link Disposer} methods.\n   *\n   * - `evict`: The item was evicted because it is the least recently used,\n   *   and the cache is full.\n   * - `set`: A new value was set, overwriting the old value being disposed.\n   * - `delete`: The item was explicitly deleted, either by calling\n   *   {@link LRUCache#delete}, {@link LRUCache#clear}, or\n   *   {@link LRUCache#set} with an undefined value.\n   * - `expire`: The item was removed due to exceeding its TTL.\n   * - `fetch`: A {@link OptionsBase#fetchMethod} operation returned\n   *   `undefined` or was aborted, causing the item to be deleted.\n   */\n  export type DisposeReason =\n    | 'evict'\n    | 'set'\n    | 'delete'\n    | 'expire'\n    | 'fetch'\n  /**\n   * A method called upon item removal, passed as the\n   * {@link OptionsBase.dispose} and/or\n   * {@link OptionsBase.disposeAfter} options.\n   */\n  export type Disposer<K, V> = (\n    value: V,\n    key: K,\n    reason: DisposeReason,\n  ) => void\n\n  /**\n   * The reason why an item was added to the cache, passed\n   * to the {@link Inserter} methods.\n   *\n   * - `add`: the item was not found in the cache, and was added\n   * - `update`: the item was in the cache, with the same value provided\n   * - `replace`: the item was in the cache, and replaced\n   */\n  export type InsertReason = 'add' | 'update' | 'replace'\n\n  /**\n   * A method called upon item insertion, passed as the\n   * {@link OptionsBase.insert}\n   */\n  export type Inserter<K, V> = (\n    value: V,\n    key: K,\n    reason: InsertReason,\n  ) => void\n\n  /**\n   * A function that returns the effective calculated size\n   * of an entry in the cache.\n   */\n  export type SizeCalculator<K, V> = (value: V, key: K) => Size\n\n  /**\n   * Options provided to the\n   * {@link OptionsBase.fetchMethod} function.\n   */\n  export interface FetcherOptions<K, V, FC = unknown> {\n    signal: AbortSignal\n    options: FetcherFetchOptions<K, V, FC>\n    /**\n     * Object provided in the {@link FetchOptions.context} option to\n     * {@link LRUCache#fetch}\n     */\n    context: FC\n  }\n\n  /**\n   * Occasionally, it may be useful to track the internal behavior of the\n   * cache, particularly for logging, debugging, or for behavior within the\n   * `fetchMethod`. To do this, you can pass a `status` object to the\n   * {@link LRUCache#fetch}, {@link LRUCache#get}, {@link LRUCache#set},\n   * {@link LRUCache#memo}, and {@link LRUCache#has} methods.\n   *\n   * The `status` option should be a plain JavaScript object. The following\n   * fields will be set on it appropriately, depending on the situation.\n   */\n  export interface Status<V> {\n    /**\n     * The status of a set() operation.\n     *\n     * - add: the item was not found in the cache, and was added\n     * - update: the item was in the cache, with the same value provided\n     * - replace: the item was in the cache, and replaced\n     * - miss: the item was not added to the cache for some reason\n     */\n    set?: 'add' | 'update' | 'replace' | 'miss'\n\n    /**\n     * the ttl stored for the item, or undefined if ttls are not used.\n     */\n    ttl?: Milliseconds\n\n    /**\n     * the start time for the item, or undefined if ttls are not used.\n     */\n    start?: Milliseconds\n\n    /**\n     * The timestamp used for TTL calculation\n     */\n    now?: Milliseconds\n\n    /**\n     * the remaining ttl for the item, or undefined if ttls are not used.\n     */\n    remainingTTL?: Milliseconds\n\n    /**\n     * The calculated size for the item, if sizes are used.\n     */\n    entrySize?: Size\n\n    /**\n     * The total calculated size of the cache, if sizes are used.\n     */\n    totalCalculatedSize?: Size\n\n    /**\n     * A flag indicating that the item was not stored, due to exceeding the\n     * {@link OptionsBase.maxEntrySize}\n     */\n    maxEntrySizeExceeded?: true\n\n    /**\n     * The old value, specified in the case of `set:'update'` or\n     * `set:'replace'`\n     */\n    oldValue?: V\n\n    /**\n     * The results of a {@link LRUCache#has} operation\n     *\n     * - hit: the item was found in the cache\n     * - stale: the item was found in the cache, but is stale\n     * - miss: the item was not found in the cache\n     */\n    has?: 'hit' | 'stale' | 'miss'\n\n    /**\n     * The status of a {@link LRUCache#fetch} operation.\n     * Note that this can change as the underlying fetch() moves through\n     * various states.\n     *\n     * - inflight: there is another fetch() for this key which is in process\n     * - get: there is no {@link OptionsBase.fetchMethod}, so\n     *   {@link LRUCache#get} was called.\n     * - miss: the item is not in cache, and will be fetched.\n     * - hit: the item is in the cache, and was resolved immediately.\n     * - stale: the item is in the cache, but stale.\n     * - refresh: the item is in the cache, and not stale, but\n     *   {@link FetchOptions.forceRefresh} was specified.\n     */\n    fetch?: 'get' | 'inflight' | 'miss' | 'hit' | 'stale' | 'refresh'\n\n    /**\n     * The {@link OptionsBase.fetchMethod} was called\n     */\n    fetchDispatched?: true\n\n    /**\n     * The cached value was updated after a successful call to\n     * {@link OptionsBase.fetchMethod}\n     */\n    fetchUpdated?: true\n\n    /**\n     * The reason for a fetch() rejection.  Either the error raised by the\n     * {@link OptionsBase.fetchMethod}, or the reason for an\n     * AbortSignal.\n     */\n    fetchError?: Error\n\n    /**\n     * The fetch received an abort signal\n     */\n    fetchAborted?: true\n\n    /**\n     * The abort signal received was ignored, and the fetch was allowed to\n     * continue.\n     */\n    fetchAbortIgnored?: true\n\n    /**\n     * The fetchMethod promise resolved successfully\n     */\n    fetchResolved?: true\n\n    /**\n     * The fetchMethod promise was rejected\n     */\n    fetchRejected?: true\n\n    /**\n     * The status of a {@link LRUCache#get} operation.\n     *\n     * - fetching: The item is currently being fetched.  If a previous value\n     *   is present and allowed, that will be returned.\n     * - stale: The item is in the cache, and is stale.\n     * - hit: the item is in the cache\n     * - miss: the item is not in the cache\n     */\n    get?: 'stale' | 'hit' | 'miss'\n\n    /**\n     * A fetch or get operation returned a stale value.\n     */\n    returnedStale?: true\n  }\n\n  /**\n   * options which override the options set in the LRUCache constructor\n   * when calling {@link LRUCache#fetch}.\n   *\n   * This is the union of {@link GetOptions} and {@link SetOptions}, plus\n   * {@link OptionsBase.noDeleteOnFetchRejection},\n   * {@link OptionsBase.allowStaleOnFetchRejection},\n   * {@link FetchOptions.forceRefresh}, and\n   * {@link FetcherOptions.context}\n   *\n   * Any of these may be modified in the {@link OptionsBase.fetchMethod}\n   * function, but the {@link GetOptions} fields will of course have no\n   * effect, as the {@link LRUCache#get} call already happened by the time\n   * the fetchMethod is called.\n   */\n  export interface FetcherFetchOptions<K, V, FC = unknown>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      | 'allowStale'\n      | 'updateAgeOnGet'\n      | 'noDeleteOnStaleGet'\n      | 'sizeCalculation'\n      | 'ttl'\n      | 'noDisposeOnSet'\n      | 'noUpdateTTL'\n      | 'noDeleteOnFetchRejection'\n      | 'allowStaleOnFetchRejection'\n      | 'ignoreFetchAbort'\n      | 'allowStaleOnFetchAbort'\n    > {\n    status?: Status<V>\n    size?: Size\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#fetch} method.\n   */\n  export interface FetchOptions<K, V, FC>\n    extends FetcherFetchOptions<K, V, FC> {\n    /**\n     * Set to true to force a re-load of the existing data, even if it\n     * is not yet stale.\n     */\n    forceRefresh?: boolean\n    /**\n     * Context provided to the {@link OptionsBase.fetchMethod} as\n     * the {@link FetcherOptions.context} param.\n     *\n     * If the FC type is specified as unknown (the default),\n     * undefined or void, then this is optional.  Otherwise, it will\n     * be required.\n     */\n    context?: FC\n    signal?: AbortSignal\n    status?: Status<V>\n  }\n  /**\n   * Options provided to {@link LRUCache#fetch} when the FC type is something\n   * other than `unknown`, `undefined`, or `void`\n   */\n  export interface FetchOptionsWithContext<K, V, FC>\n    extends FetchOptions<K, V, FC> {\n    context: FC\n  }\n  /**\n   * Options provided to {@link LRUCache#fetch} when the FC type is\n   * `undefined` or `void`\n   */\n  export interface FetchOptionsNoContext<K, V>\n    extends FetchOptions<K, V, undefined> {\n    context?: undefined\n  }\n\n  export interface MemoOptions<K, V, FC = unknown>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      | 'allowStale'\n      | 'updateAgeOnGet'\n      | 'noDeleteOnStaleGet'\n      | 'sizeCalculation'\n      | 'ttl'\n      | 'noDisposeOnSet'\n      | 'noUpdateTTL'\n      | 'noDeleteOnFetchRejection'\n      | 'allowStaleOnFetchRejection'\n      | 'ignoreFetchAbort'\n      | 'allowStaleOnFetchAbort'\n    > {\n    /**\n     * Set to true to force a re-load of the existing data, even if it\n     * is not yet stale.\n     */\n    forceRefresh?: boolean\n    /**\n     * Context provided to the {@link OptionsBase.memoMethod} as\n     * the {@link MemoizerOptions.context} param.\n     *\n     * If the FC type is specified as unknown (the default),\n     * undefined or void, then this is optional.  Otherwise, it will\n     * be required.\n     */\n    context?: FC\n    status?: Status<V>\n  }\n  /**\n   * Options provided to {@link LRUCache#memo} when the FC type is something\n   * other than `unknown`, `undefined`, or `void`\n   */\n  export interface MemoOptionsWithContext<K, V, FC>\n    extends MemoOptions<K, V, FC> {\n    context: FC\n  }\n  /**\n   * Options provided to {@link LRUCache#memo} when the FC type is\n   * `undefined` or `void`\n   */\n  export interface MemoOptionsNoContext<K, V>\n    extends MemoOptions<K, V, undefined> {\n    context?: undefined\n  }\n\n  /**\n   * Options provided to the\n   * {@link OptionsBase.memoMethod} function.\n   */\n  export interface MemoizerOptions<K, V, FC = unknown> {\n    options: MemoizerMemoOptions<K, V, FC>\n    /**\n     * Object provided in the {@link MemoOptions.context} option to\n     * {@link LRUCache#memo}\n     */\n    context: FC\n  }\n\n  /**\n   * options which override the options set in the LRUCache constructor\n   * when calling {@link LRUCache#memo}.\n   *\n   * This is the union of {@link GetOptions} and {@link SetOptions}, plus\n   * {@link MemoOptions.forceRefresh}, and\n   * {@link MemoOptions.context}\n   *\n   * Any of these may be modified in the {@link OptionsBase.memoMethod}\n   * function, but the {@link GetOptions} fields will of course have no\n   * effect, as the {@link LRUCache#get} call already happened by the time\n   * the memoMethod is called.\n   */\n  export interface MemoizerMemoOptions<K, V, FC = unknown>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      | 'allowStale'\n      | 'updateAgeOnGet'\n      | 'noDeleteOnStaleGet'\n      | 'sizeCalculation'\n      | 'ttl'\n      | 'noDisposeOnSet'\n      | 'noUpdateTTL'\n    > {\n    status?: Status<V>\n    size?: Size\n    start?: Milliseconds\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#has} method.\n   */\n  export interface HasOptions<K, V, FC>\n    extends Pick<OptionsBase<K, V, FC>, 'updateAgeOnHas'> {\n    status?: Status<V>\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#get} method.\n   */\n  export interface GetOptions<K, V, FC>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      'allowStale' | 'updateAgeOnGet' | 'noDeleteOnStaleGet'\n    > {\n    status?: Status<V>\n  }\n\n  /**\n   * Options that may be passed to the {@link LRUCache#peek} method.\n   */\n  export interface PeekOptions<K, V, FC>\n    extends Pick<OptionsBase<K, V, FC>, 'allowStale'> {}\n\n  /**\n   * Options that may be passed to the {@link LRUCache#set} method.\n   */\n  export interface SetOptions<K, V, FC>\n    extends Pick<\n      OptionsBase<K, V, FC>,\n      'sizeCalculation' | 'ttl' | 'noDisposeOnSet' | 'noUpdateTTL'\n    > {\n    /**\n     * If size tracking is enabled, then setting an explicit size\n     * in the {@link LRUCache#set} call will prevent calling the\n     * {@link OptionsBase.sizeCalculation} function.\n     */\n    size?: Size\n    /**\n     * If TTL tracking is enabled, then setting an explicit start\n     * time in the {@link LRUCache#set} call will override the\n     * default time from `performance.now()` or `Date.now()`.\n     *\n     * Note that it must be a valid value for whichever time-tracking\n     * method is in use.\n     */\n    start?: Milliseconds\n    status?: Status<V>\n  }\n\n  /**\n   * The type signature for the {@link OptionsBase.fetchMethod} option.\n   */\n  export type Fetcher<K, V, FC = unknown> = (\n    key: K,\n    staleValue: V | undefined,\n    options: FetcherOptions<K, V, FC>,\n  ) => Promise<V | undefined | void> | V | undefined | void\n\n  /**\n   * the type signature for the {@link OptionsBase.memoMethod} option.\n   */\n  export type Memoizer<K, V, FC = unknown> = (\n    key: K,\n    staleValue: V | undefined,\n    options: MemoizerOptions<K, V, FC>,\n  ) => V\n\n  /**\n   * Options which may be passed to the {@link LRUCache} constructor.\n   *\n   * Most of these may be overridden in the various options that use\n   * them.\n   *\n   * Despite all being technically optional, the constructor requires that\n   * a cache is at minimum limited by one or more of {@link OptionsBase.max},\n   * {@link OptionsBase.ttl}, or {@link OptionsBase.maxSize}.\n   *\n   * If {@link OptionsBase.ttl} is used alone, then it is strongly advised\n   * (and in fact required by the type definitions here) that the cache\n   * also set {@link OptionsBase.ttlAutopurge}, to prevent potentially\n   * unbounded storage.\n   *\n   * All options are also available on the {@link LRUCache} instance, making\n   * it safe to pass an LRUCache instance as the options argumemnt to\n   * make another empty cache of the same type.\n   *\n   * Some options are marked as read-only, because changing them after\n   * instantiation is not safe. Changing any of the other options will of\n   * course only have an effect on subsequent method calls.\n   */\n  export interface OptionsBase<K, V, FC> {\n    /**\n     * The maximum number of items to store in the cache before evicting\n     * old entries. This is read-only on the {@link LRUCache} instance,\n     * and may not be overridden.\n     *\n     * If set, then storage space will be pre-allocated at construction\n     * time, and the cache will perform significantly faster.\n     *\n     * Note that significantly fewer items may be stored, if\n     * {@link OptionsBase.maxSize} and/or {@link OptionsBase.ttl} are also\n     * set.\n     *\n     * **It is strongly recommended to set a `max` to prevent unbounded growth\n     * of the cache.**\n     */\n    max?: Count\n\n    /**\n     * Max time in milliseconds for items to live in cache before they are\n     * considered stale.  Note that stale items are NOT preemptively removed by\n     * default, and MAY live in the cache, contributing to its LRU max, long\n     * after they have expired, unless {@link OptionsBase.ttlAutopurge} is\n     * set.\n     *\n     * If set to `0` (the default value), then that means \"do not track\n     * TTL\", not \"expire immediately\".\n     *\n     * Also, as this cache is optimized for LRU/MRU operations, some of\n     * the staleness/TTL checks will reduce performance, as they will incur\n     * overhead by deleting items.\n     *\n     * This is not primarily a TTL cache, and does not make strong TTL\n     * guarantees. There is no pre-emptive pruning of expired items, but you\n     * _may_ set a TTL on the cache, and it will treat expired items as missing\n     * when they are fetched, and delete them.\n     *\n     * Optional, but must be a non-negative integer in ms if specified.\n     *\n     * This may be overridden by passing an options object to `cache.set()`.\n     *\n     * At least one of `max`, `maxSize`, or `TTL` is required. This must be a\n     * positive integer if set.\n     *\n     * Even if ttl tracking is enabled, **it is strongly recommended to set a\n     * `max` to prevent unbounded growth of the cache.**\n     *\n     * If ttl tracking is enabled, and `max` and `maxSize` are not set,\n     * and `ttlAutopurge` is not set, then a warning will be emitted\n     * cautioning about the potential for unbounded memory consumption.\n     * (The TypeScript definitions will also discourage this.)\n     */\n    ttl?: Milliseconds\n\n    /**\n     * Minimum amount of time in ms in which to check for staleness.\n     * Defaults to 1, which means that the current time is checked\n     * at most once per millisecond.\n     *\n     * Set to 0 to check the current time every time staleness is tested.\n     * (This reduces performance, and is theoretically unnecessary.)\n     *\n     * Setting this to a higher value will improve performance somewhat\n     * while using ttl tracking, albeit at the expense of keeping stale\n     * items around a bit longer than their TTLs would indicate.\n     *\n     * @default 1\n     */\n    ttlResolution?: Milliseconds\n\n    /**\n     * Preemptively remove stale items from the cache.\n     *\n     * Note that this may *significantly* degrade performance, especially if\n     * the cache is storing a large number of items. It is almost always best\n     * to just leave the stale items in the cache, and let them fall out as new\n     * items are added.\n     *\n     * Note that this means that {@link OptionsBase.allowStale} is a bit\n     * pointless, as stale items will be deleted almost as soon as they\n     * expire.\n     *\n     * Use with caution!\n     */\n    ttlAutopurge?: boolean\n\n    /**\n     * When using time-expiring entries with `ttl`, setting this to `true` will\n     * make each item's age reset to 0 whenever it is retrieved from cache with\n     * {@link LRUCache#get}, causing it to not expire. (It can still fall out\n     * of cache based on recency of use, of course.)\n     *\n     * Has no effect if {@link OptionsBase.ttl} is not set.\n     *\n     * This may be overridden by passing an options object to `cache.get()`.\n     */\n    updateAgeOnGet?: boolean\n\n    /**\n     * When using time-expiring entries with `ttl`, setting this to `true` will\n     * make each item's age reset to 0 whenever its presence in the cache is\n     * checked with {@link LRUCache#has}, causing it to not expire. (It can\n     * still fall out of cache based on recency of use, of course.)\n     *\n     * Has no effect if {@link OptionsBase.ttl} is not set.\n     */\n    updateAgeOnHas?: boolean\n\n    /**\n     * Allow {@link LRUCache#get} and {@link LRUCache#fetch} calls to return\n     * stale data, if available.\n     *\n     * By default, if you set `ttl`, stale items will only be deleted from the\n     * cache when you `get(key)`. That is, it's not preemptively pruning items,\n     * unless {@link OptionsBase.ttlAutopurge} is set.\n     *\n     * If you set `allowStale:true`, it'll return the stale value *as well as*\n     * deleting it. If you don't set this, then it'll return `undefined` when\n     * you try to get a stale entry.\n     *\n     * Note that when a stale entry is fetched, _even if it is returned due to\n     * `allowStale` being set_, it is removed from the cache immediately. You\n     * can suppress this behavior by setting\n     * {@link OptionsBase.noDeleteOnStaleGet}, either in the constructor, or in\n     * the options provided to {@link LRUCache#get}.\n     *\n     * This may be overridden by passing an options object to `cache.get()`.\n     * The `cache.has()` method will always return `false` for stale items.\n     *\n     * Only relevant if a ttl is set.\n     */\n    allowStale?: boolean\n\n    /**\n     * Function that is called on items when they are dropped from the\n     * cache, as `dispose(value, key, reason)`.\n     *\n     * This can be handy if you want to close file descriptors or do\n     * other cleanup tasks when items are no longer stored in the cache.\n     *\n     * **NOTE**: It is called _before_ the item has been fully removed\n     * from the cache, so if you want to put it right back in, you need\n     * to wait until the next tick. If you try to add it back in during\n     * the `dispose()` function call, it will break things in subtle and\n     * weird ways.\n     *\n     * Unlike several other options, this may _not_ be overridden by\n     * passing an option to `set()`, for performance reasons.\n     *\n     * The `reason` will be one of the following strings, corresponding\n     * to the reason for the item's deletion:\n     *\n     * - `evict` Item was evicted to make space for a new addition\n     * - `set` Item was overwritten by a new value\n     * - `expire` Item expired its TTL\n     * - `fetch` Item was deleted due to a failed or aborted fetch, or a\n     *   fetchMethod returning `undefined.\n     * - `delete` Item was removed by explicit `cache.delete(key)`,\n     *   `cache.clear()`, or `cache.set(key, undefined)`.\n     */\n    dispose?: Disposer<K, V>\n\n    /**\n     * Function that is called when new items are inserted into the cache,\n     * as `onInsert(value, key, reason)`.\n     *\n     * This can be useful if you need to perform actions when an item is\n     * added, such as logging or tracking insertions.\n     *\n     * Unlike some other options, this may _not_ be overridden by passing\n     * an option to `set()`, for performance and consistency reasons.\n     */\n    onInsert?: Inserter<K, V>\n\n    /**\n     * The same as {@link OptionsBase.dispose}, but called *after* the entry\n     * is completely removed and the cache is once again in a clean state.\n     *\n     * It is safe to add an item right back into the cache at this point.\n     * However, note that it is *very* easy to inadvertently create infinite\n     * recursion this way.\n     */\n    disposeAfter?: Disposer<K, V>\n\n    /**\n     * Set to true to suppress calling the\n     * {@link OptionsBase.dispose} function if the entry key is\n     * still accessible within the cache.\n     *\n     * This may be overridden by passing an options object to\n     * {@link LRUCache#set}.\n     *\n     * Only relevant if `dispose` or `disposeAfter` are set.\n     */\n    noDisposeOnSet?: boolean\n\n    /**\n     * Boolean flag to tell the cache to not update the TTL when setting a new\n     * value for an existing key (ie, when updating a value rather than\n     * inserting a new value).  Note that the TTL value is _always_ set (if\n     * provided) when adding a new entry into the cache.\n     *\n     * Has no effect if a {@link OptionsBase.ttl} is not set.\n     *\n     * May be passed as an option to {@link LRUCache#set}.\n     */\n    noUpdateTTL?: boolean\n\n    /**\n     * Set to a positive integer to track the sizes of items added to the\n     * cache, and automatically evict items in order to stay below this size.\n     * Note that this may result in fewer than `max` items being stored.\n     *\n     * Attempting to add an item to the cache whose calculated size is greater\n     * that this amount will be a no-op. The item will not be cached, and no\n     * other items will be evicted.\n     *\n     * Optional, must be a positive integer if provided.\n     *\n     * Sets `maxEntrySize` to the same value, unless a different value is\n     * provided for `maxEntrySize`.\n     *\n     * At least one of `max`, `maxSize`, or `TTL` is required. This must be a\n     * positive integer if set.\n     *\n     * Even if size tracking is enabled, **it is strongly recommended to set a\n     * `max` to prevent unbounded growth of the cache.**\n     *\n     * Note also that size tracking can negatively impact performance,\n     * though for most cases, only minimally.\n     */\n    maxSize?: Size\n\n    /**\n     * The maximum allowed size for any single item in the cache.\n     *\n     * If a larger item is passed to {@link LRUCache#set} or returned by a\n     * {@link OptionsBase.fetchMethod} or {@link OptionsBase.memoMethod}, then\n     * it will not be stored in the cache.\n     *\n     * Attempting to add an item whose calculated size is greater than\n     * this amount will not cache the item or evict any old items, but\n     * WILL delete an existing value if one is already present.\n     *\n     * Optional, must be a positive integer if provided. Defaults to\n     * the value of `maxSize` if provided.\n     */\n    maxEntrySize?: Size\n\n    /**\n     * A function that returns a number indicating the item's size.\n     *\n     * Requires {@link OptionsBase.maxSize} to be set.\n     *\n     * If not provided, and {@link OptionsBase.maxSize} or\n     * {@link OptionsBase.maxEntrySize} are set, then all\n     * {@link LRUCache#set} calls **must** provide an explicit\n     * {@link SetOptions.size} or sizeCalculation param.\n     */\n    sizeCalculation?: SizeCalculator<K, V>\n\n    /**\n     * Method that provides the implementation for {@link LRUCache#fetch}\n     *\n     * ```ts\n     * fetchMethod(key, staleValue, { signal, options, context })\n     * ```\n     *\n     * If `fetchMethod` is not provided, then `cache.fetch(key)` is equivalent\n     * to `Promise.resolve(cache.get(key))`.\n     *\n     * If at any time, `signal.aborted` is set to `true`, or if the\n     * `signal.onabort` method is called, or if it emits an `'abort'` event\n     * which you can listen to with `addEventListener`, then that means that\n     * the fetch should be abandoned. This may be passed along to async\n     * functions aware of AbortController/AbortSignal behavior.\n     *\n     * The `fetchMethod` should **only** return `undefined` or a Promise\n     * resolving to `undefined` if the AbortController signaled an `abort`\n     * event. In all other cases, it should return or resolve to a value\n     * suitable for adding to the cache.\n     *\n     * The `options` object is a union of the options that may be provided to\n     * `set()` and `get()`. If they are modified, then that will result in\n     * modifying the settings to `cache.set()` when the value is resolved, and\n     * in the case of\n     * {@link OptionsBase.noDeleteOnFetchRejection} and\n     * {@link OptionsBase.allowStaleOnFetchRejection}, the handling of\n     * `fetchMethod` failures.\n     *\n     * For example, a DNS cache may update the TTL based on the value returned\n     * from a remote DNS server by changing `options.ttl` in the `fetchMethod`.\n     */\n    fetchMethod?: Fetcher<K, V, FC>\n\n    /**\n     * Method that provides the implementation for {@link LRUCache#memo}\n     */\n    memoMethod?: Memoizer<K, V, FC>\n\n    /**\n     * Set to true to suppress the deletion of stale data when a\n     * {@link OptionsBase.fetchMethod} returns a rejected promise.\n     */\n    noDeleteOnFetchRejection?: boolean\n\n    /**\n     * Do not delete stale items when they are retrieved with\n     * {@link LRUCache#get}.\n     *\n     * Note that the `get` return value will still be `undefined`\n     * unless {@link OptionsBase.allowStale} is true.\n     *\n     * When using time-expiring entries with `ttl`, by default stale\n     * items will be removed from the cache when the key is accessed\n     * with `cache.get()`.\n     *\n     * Setting this option will cause stale items to remain in the cache, until\n     * they are explicitly deleted with `cache.delete(key)`, or retrieved with\n     * `noDeleteOnStaleGet` set to `false`.\n     *\n     * This may be overridden by passing an options object to `cache.get()`.\n     *\n     * Only relevant if a ttl is used.\n     */\n    noDeleteOnStaleGet?: boolean\n\n    /**\n     * Set to true to allow returning stale data when a\n     * {@link OptionsBase.fetchMethod} throws an error or returns a rejected\n     * promise.\n     *\n     * This differs from using {@link OptionsBase.allowStale} in that stale\n     * data will ONLY be returned in the case that the {@link LRUCache#fetch}\n     * fails, not any other times.\n     *\n     * If a `fetchMethod` fails, and there is no stale value available, the\n     * `fetch()` will resolve to `undefined`. Ie, all `fetchMethod` errors are\n     * suppressed.\n     *\n     * Implies `noDeleteOnFetchRejection`.\n     *\n     * This may be set in calls to `fetch()`, or defaulted on the constructor,\n     * or overridden by modifying the options object in the `fetchMethod`.\n     */\n    allowStaleOnFetchRejection?: boolean\n\n    /**\n     * Set to true to return a stale value from the cache when the\n     * `AbortSignal` passed to the {@link OptionsBase.fetchMethod} dispatches\n     * an `'abort'` event, whether user-triggered, or due to internal cache\n     * behavior.\n     *\n     * Unless {@link OptionsBase.ignoreFetchAbort} is also set, the underlying\n     * {@link OptionsBase.fetchMethod} will still be considered canceled, and\n     * any value it returns will be ignored and not cached.\n     *\n     * Caveat: since fetches are aborted when a new value is explicitly\n     * set in the cache, this can lead to fetch returning a stale value,\n     * since that was the fallback value _at the moment the `fetch()` was\n     * initiated_, even though the new updated value is now present in\n     * the cache.\n     *\n     * For example:\n     *\n     * ```ts\n     * const cache = new LRUCache<string, any>({\n     *   ttl: 100,\n     *   fetchMethod: async (url, oldValue, { signal }) =>  {\n     *     const res = await fetch(url, { signal })\n     *     return await res.json()\n     *   }\n     * })\n     * cache.set('https://example.com/', { some: 'data' })\n     * // 100ms go by...\n     * const result = cache.fetch('https://example.com/')\n     * cache.set('https://example.com/', { other: 'thing' })\n     * console.log(await result) // { some: 'data' }\n     * console.log(cache.get('https://example.com/')) // { other: 'thing' }\n     * ```\n     */\n    allowStaleOnFetchAbort?: boolean\n\n    /**\n     * Set to true to ignore the `abort` event emitted by the `AbortSignal`\n     * object passed to {@link OptionsBase.fetchMethod}, and still cache the\n     * resulting resolution value, as long as it is not `undefined`.\n     *\n     * When used on its own, this means aborted {@link LRUCache#fetch} calls\n     * are not immediately resolved or rejected when they are aborted, and\n     * instead take the full time to await.\n     *\n     * When used with {@link OptionsBase.allowStaleOnFetchAbort}, aborted\n     * {@link LRUCache#fetch} calls will resolve immediately to their stale\n     * cached value or `undefined`, and will continue to process and eventually\n     * update the cache when they resolve, as long as the resulting value is\n     * not `undefined`, thus supporting a \"return stale on timeout while\n     * refreshing\" mechanism by passing `AbortSignal.timeout(n)` as the signal.\n     *\n     * For example:\n     *\n     * ```ts\n     * const c = new LRUCache({\n     *   ttl: 100,\n     *   ignoreFetchAbort: true,\n     *   allowStaleOnFetchAbort: true,\n     *   fetchMethod: async (key, oldValue, { signal }) => {\n     *     // note: do NOT pass the signal to fetch()!\n     *     // let's say this fetch can take a long time.\n     *     const res = await fetch(`https://slow-backend-server/${key}`)\n     *     return await res.json()\n     *   },\n     * })\n     *\n     * // this will return the stale value after 100ms, while still\n     * // updating in the background for next time.\n     * const val = await c.fetch('key', { signal: AbortSignal.timeout(100) })\n     * ```\n     *\n     * **Note**: regardless of this setting, an `abort` event _is still\n     * emitted on the `AbortSignal` object_, so may result in invalid results\n     * when passed to other underlying APIs that use AbortSignals.\n     *\n     * This may be overridden in the {@link OptionsBase.fetchMethod} or the\n     * call to {@link LRUCache#fetch}.\n     */\n    ignoreFetchAbort?: boolean\n\n    /**\n     * In some cases, you may want to swap out the performance/Date object\n     * used for TTL tracking. This should almost certainly NOT be done in\n     * production environments!\n     *\n     * This value defaults to `global.performance` if it has a `now()` method,\n     * or the `global.Date` object otherwise.\n     */\n    perf?: Perf\n  }\n\n  export interface OptionsMaxLimit<K, V, FC>\n    extends OptionsBase<K, V, FC> {\n    max: Count\n  }\n  export interface OptionsTTLLimit<K, V, FC>\n    extends OptionsBase<K, V, FC> {\n    ttl: Milliseconds\n    ttlAutopurge: boolean\n  }\n  export interface OptionsSizeLimit<K, V, FC>\n    extends OptionsBase<K, V, FC> {\n    maxSize: Size\n  }\n\n  /**\n   * The valid safe options for the {@link LRUCache} constructor\n   */\n  export type Options<K, V, FC> =\n    | OptionsMaxLimit<K, V, FC>\n    | OptionsSizeLimit<K, V, FC>\n    | OptionsTTLLimit<K, V, FC>\n\n  /**\n   * Entry objects used by {@link LRUCache#load} and {@link LRUCache#dump},\n   * and returned by {@link LRUCache#info}.\n   */\n  export interface Entry<V> {\n    value: V\n    ttl?: Milliseconds\n    size?: Size\n    start?: Milliseconds\n  }\n}\n\n/**\n * Default export, the thing you're using this module to get.\n *\n * The `K` and `V` types define the key and value types, respectively. The\n * optional `FC` type defines the type of the `context` object passed to\n * `cache.fetch()` and `cache.memo()`.\n *\n * Keys and values **must not** be `null` or `undefined`.\n *\n * All properties from the options object (with the exception of `max`,\n * `maxSize`, `fetchMethod`, `memoMethod`, `dispose` and `disposeAfter`) are\n * added as normal public members. (The listed options are read-only getters.)\n *\n * Changing any of these will alter the defaults for subsequent method calls.\n */\nexport class LRUCache<K extends {}, V extends {}, FC = unknown> {\n  // options that cannot be changed without disaster\n  readonly #max: LRUCache.Count\n  readonly #maxSize: LRUCache.Size\n  readonly #dispose?: LRUCache.Disposer<K, V>\n  readonly #onInsert?: LRUCache.Inserter<K, V>\n  readonly #disposeAfter?: LRUCache.Disposer<K, V>\n  readonly #fetchMethod?: LRUCache.Fetcher<K, V, FC>\n  readonly #memoMethod?: LRUCache.Memoizer<K, V, FC>\n  readonly #perf: Perf\n\n  /**\n   * {@link LRUCache.OptionsBase.perf}\n   */\n  get perf() {\n    return this.#perf\n  }\n\n  /**\n   * {@link LRUCache.OptionsBase.ttl}\n   */\n  ttl: LRUCache.Milliseconds\n\n  /**\n   * {@link LRUCache.OptionsBase.ttlResolution}\n   */\n  ttlResolution: LRUCache.Milliseconds\n  /**\n   * {@link LRUCache.OptionsBase.ttlAutopurge}\n   */\n  ttlAutopurge: boolean\n  /**\n   * {@link LRUCache.OptionsBase.updateAgeOnGet}\n   */\n  updateAgeOnGet: boolean\n  /**\n   * {@link LRUCache.OptionsBase.updateAgeOnHas}\n   */\n  updateAgeOnHas: boolean\n  /**\n   * {@link LRUCache.OptionsBase.allowStale}\n   */\n  allowStale: boolean\n\n  /**\n   * {@link LRUCache.OptionsBase.noDisposeOnSet}\n   */\n  noDisposeOnSet: boolean\n  /**\n   * {@link LRUCache.OptionsBase.noUpdateTTL}\n   */\n  noUpdateTTL: boolean\n  /**\n   * {@link LRUCache.OptionsBase.maxEntrySize}\n   */\n  maxEntrySize: LRUCache.Size\n  /**\n   * {@link LRUCache.OptionsBase.sizeCalculation}\n   */\n  sizeCalculation?: LRUCache.SizeCalculator<K, V>\n  /**\n   * {@link LRUCache.OptionsBase.noDeleteOnFetchRejection}\n   */\n  noDeleteOnFetchRejection: boolean\n  /**\n   * {@link LRUCache.OptionsBase.noDeleteOnStaleGet}\n   */\n  noDeleteOnStaleGet: boolean\n  /**\n   * {@link LRUCache.OptionsBase.allowStaleOnFetchAbort}\n   */\n  allowStaleOnFetchAbort: boolean\n  /**\n   * {@link LRUCache.OptionsBase.allowStaleOnFetchRejection}\n   */\n  allowStaleOnFetchRejection: boolean\n  /**\n   * {@link LRUCache.OptionsBase.ignoreFetchAbort}\n   */\n  ignoreFetchAbort: boolean\n\n  // computed properties\n  #size: LRUCache.Count\n  #calculatedSize: LRUCache.Size\n  #keyMap: Map<K, Index>\n  #keyList: (K | undefined)[]\n  #valList: (V | BackgroundFetch<V> | undefined)[]\n  #next: NumberArray\n  #prev: NumberArray\n  #head: Index\n  #tail: Index\n  #free: StackLike\n  #disposed?: DisposeTask<K, V>[]\n  #sizes?: ZeroArray\n  #starts?: ZeroArray\n  #ttls?: ZeroArray\n  #autopurgeTimers?: (undefined | ReturnType<typeof setTimeout>)[]\n\n  #hasDispose: boolean\n  #hasFetchMethod: boolean\n  #hasDisposeAfter: boolean\n  #hasOnInsert: boolean\n\n  /**\n   * Do not call this method unless you need to inspect the\n   * inner workings of the cache.  If anything returned by this\n   * object is modified in any way, strange breakage may occur.\n   *\n   * These fields are private for a reason!\n   *\n   * @internal\n   */\n  static unsafeExposeInternals<\n    K extends {},\n    V extends {},\n    FC extends unknown = unknown,\n  >(c: LRUCache<K, V, FC>) {\n    return {\n      // properties\n      starts: c.#starts,\n      ttls: c.#ttls,\n      autopurgeTimers: c.#autopurgeTimers,\n      sizes: c.#sizes,\n      keyMap: c.#keyMap as Map<K, number>,\n      keyList: c.#keyList,\n      valList: c.#valList,\n      next: c.#next,\n      prev: c.#prev,\n      get head() {\n        return c.#head\n      },\n      get tail() {\n        return c.#tail\n      },\n      free: c.#free,\n      // methods\n      isBackgroundFetch: (p: any) => c.#isBackgroundFetch(p),\n      backgroundFetch: (\n        k: K,\n        index: number | undefined,\n        options: LRUCache.FetchOptions<K, V, FC>,\n        context: any,\n      ): BackgroundFetch<V> =>\n        c.#backgroundFetch(\n          k,\n          index as Index | undefined,\n          options,\n          context,\n        ),\n      moveToTail: (index: number): void => c.#moveToTail(index as Index),\n      indexes: (options?: { allowStale: boolean }) => c.#indexes(options),\n      rindexes: (options?: { allowStale: boolean }) =>\n        c.#rindexes(options),\n      isStale: (index: number | undefined) => c.#isStale(index as Index),\n    }\n  }\n\n  // Protected read-only members\n\n  /**\n   * {@link LRUCache.OptionsBase.max} (read-only)\n   */\n  get max(): LRUCache.Count {\n    return this.#max\n  }\n  /**\n   * {@link LRUCache.OptionsBase.maxSize} (read-only)\n   */\n  get maxSize(): LRUCache.Count {\n    return this.#maxSize\n  }\n  /**\n   * The total computed size of items in the cache (read-only)\n   */\n  get calculatedSize(): LRUCache.Size {\n    return this.#calculatedSize\n  }\n  /**\n   * The number of items stored in the cache (read-only)\n   */\n  get size(): LRUCache.Count {\n    return this.#size\n  }\n  /**\n   * {@link LRUCache.OptionsBase.fetchMethod} (read-only)\n   */\n  get fetchMethod(): LRUCache.Fetcher<K, V, FC> | undefined {\n    return this.#fetchMethod\n  }\n  get memoMethod(): LRUCache.Memoizer<K, V, FC> | undefined {\n    return this.#memoMethod\n  }\n  /**\n   * {@link LRUCache.OptionsBase.dispose} (read-only)\n   */\n  get dispose() {\n    return this.#dispose\n  }\n  /**\n   * {@link LRUCache.OptionsBase.onInsert} (read-only)\n   */\n  get onInsert() {\n    return this.#onInsert\n  }\n  /**\n   * {@link LRUCache.OptionsBase.disposeAfter} (read-only)\n   */\n  get disposeAfter() {\n    return this.#disposeAfter\n  }\n\n  constructor(options: LRUCache.Options<K, V, FC> | LRUCache<K, V, FC>) {\n    const {\n      max = 0,\n      ttl,\n      ttlResolution = 1,\n      ttlAutopurge,\n      updateAgeOnGet,\n      updateAgeOnHas,\n      allowStale,\n      dispose,\n      onInsert,\n      disposeAfter,\n      noDisposeOnSet,\n      noUpdateTTL,\n      maxSize = 0,\n      maxEntrySize = 0,\n      sizeCalculation,\n      fetchMethod,\n      memoMethod,\n      noDeleteOnFetchRejection,\n      noDeleteOnStaleGet,\n      allowStaleOnFetchRejection,\n      allowStaleOnFetchAbort,\n      ignoreFetchAbort,\n      perf,\n    } = options\n\n    if (perf !== undefined) {\n      if (typeof perf?.now !== 'function') {\n        throw new TypeError(\n          'perf option must have a now() method if specified',\n        )\n      }\n    }\n\n    this.#perf = perf ?? defaultPerf\n\n    if (max !== 0 && !isPosInt(max)) {\n      throw new TypeError('max option must be a nonnegative integer')\n    }\n\n    const UintArray = max ? getUintArray(max) : Array\n    if (!UintArray) {\n      throw new Error('invalid max value: ' + max)\n    }\n\n    this.#max = max\n    this.#maxSize = maxSize\n    this.maxEntrySize = maxEntrySize || this.#maxSize\n    this.sizeCalculation = sizeCalculation\n    if (this.sizeCalculation) {\n      if (!this.#maxSize && !this.maxEntrySize) {\n        throw new TypeError(\n          'cannot set sizeCalculation without setting maxSize or maxEntrySize',\n        )\n      }\n      if (typeof this.sizeCalculation !== 'function') {\n        throw new TypeError('sizeCalculation set to non-function')\n      }\n    }\n\n    if (memoMethod !== undefined && typeof memoMethod !== 'function') {\n      throw new TypeError('memoMethod must be a function if defined')\n    }\n    this.#memoMethod = memoMethod\n\n    if (fetchMethod !== undefined && typeof fetchMethod !== 'function') {\n      throw new TypeError('fetchMethod must be a function if specified')\n    }\n    this.#fetchMethod = fetchMethod\n    this.#hasFetchMethod = !!fetchMethod\n\n    this.#keyMap = new Map()\n    this.#keyList = new Array(max).fill(undefined)\n    this.#valList = new Array(max).fill(undefined)\n    this.#next = new UintArray(max)\n    this.#prev = new UintArray(max)\n    this.#head = 0 as Index\n    this.#tail = 0 as Index\n    this.#free = Stack.create(max)\n    this.#size = 0\n    this.#calculatedSize = 0\n\n    if (typeof dispose === 'function') {\n      this.#dispose = dispose\n    }\n    if (typeof onInsert === 'function') {\n      this.#onInsert = onInsert\n    }\n    if (typeof disposeAfter === 'function') {\n      this.#disposeAfter = disposeAfter\n      this.#disposed = []\n    } else {\n      this.#disposeAfter = undefined\n      this.#disposed = undefined\n    }\n    this.#hasDispose = !!this.#dispose\n    this.#hasOnInsert = !!this.#onInsert\n    this.#hasDisposeAfter = !!this.#disposeAfter\n\n    this.noDisposeOnSet = !!noDisposeOnSet\n    this.noUpdateTTL = !!noUpdateTTL\n    this.noDeleteOnFetchRejection = !!noDeleteOnFetchRejection\n    this.allowStaleOnFetchRejection = !!allowStaleOnFetchRejection\n    this.allowStaleOnFetchAbort = !!allowStaleOnFetchAbort\n    this.ignoreFetchAbort = !!ignoreFetchAbort\n\n    // NB: maxEntrySize is set to maxSize if it's set\n    if (this.maxEntrySize !== 0) {\n      if (this.#maxSize !== 0) {\n        if (!isPosInt(this.#maxSize)) {\n          throw new TypeError(\n            'maxSize must be a positive integer if specified',\n          )\n        }\n      }\n      if (!isPosInt(this.maxEntrySize)) {\n        throw new TypeError(\n          'maxEntrySize must be a positive integer if specified',\n        )\n      }\n      this.#initializeSizeTracking()\n    }\n\n    this.allowStale = !!allowStale\n    this.noDeleteOnStaleGet = !!noDeleteOnStaleGet\n    this.updateAgeOnGet = !!updateAgeOnGet\n    this.updateAgeOnHas = !!updateAgeOnHas\n    this.ttlResolution =\n      isPosInt(ttlResolution) || ttlResolution === 0 ? ttlResolution : 1\n    this.ttlAutopurge = !!ttlAutopurge\n    this.ttl = ttl || 0\n    if (this.ttl) {\n      if (!isPosInt(this.ttl)) {\n        throw new TypeError('ttl must be a positive integer if specified')\n      }\n      this.#initializeTTLTracking()\n    }\n\n    // do not allow completely unbounded caches\n    if (this.#max === 0 && this.ttl === 0 && this.#maxSize === 0) {\n      throw new TypeError(\n        'At least one of max, maxSize, or ttl is required',\n      )\n    }\n    if (!this.ttlAutopurge && !this.#max && !this.#maxSize) {\n      const code = 'LRU_CACHE_UNBOUNDED'\n      if (shouldWarn(code)) {\n        warned.add(code)\n        const msg =\n          'TTL caching without ttlAutopurge, max, or maxSize can ' +\n          'result in unbounded memory consumption.'\n        emitWarning(msg, 'UnboundedCacheWarning', code, LRUCache)\n      }\n    }\n  }\n\n  /**\n   * Return the number of ms left in the item's TTL. If item is not in cache,\n   * returns `0`. Returns `Infinity` if item is in cache without a defined TTL.\n   */\n  getRemainingTTL(key: K) {\n    return this.#keyMap.has(key) ? Infinity : 0\n  }\n\n  #initializeTTLTracking() {\n    const ttls = new ZeroArray(this.#max)\n    const starts = new ZeroArray(this.#max)\n    this.#ttls = ttls\n    this.#starts = starts\n    const purgeTimers =\n      this.ttlAutopurge ?\n        new Array<undefined | ReturnType<typeof setTimeout>>(this.#max)\n      : undefined\n    this.#autopurgeTimers = purgeTimers\n\n    this.#setItemTTL = (index, ttl, start = this.#perf.now()) => {\n      starts[index] = ttl !== 0 ? start : 0\n      ttls[index] = ttl\n      // clear out the purge timer if we're setting TTL to 0, and\n      // previously had a ttl purge timer running, so it doesn't\n      // fire unnecessarily.\n      if (purgeTimers?.[index]) {\n        clearTimeout(purgeTimers[index])\n        purgeTimers[index] = undefined\n      }\n      if (ttl !== 0 && purgeTimers) {\n        const t = setTimeout(() => {\n          if (this.#isStale(index)) {\n            this.#delete(this.#keyList[index] as K, 'expire')\n          }\n        }, ttl + 1)\n        // unref() not supported on all platforms\n        /* c8 ignore start */\n        if (t.unref) {\n          t.unref()\n        }\n        /* c8 ignore stop */\n        purgeTimers[index] = t\n      }\n    }\n\n    this.#updateItemAge = index => {\n      starts[index] = ttls[index] !== 0 ? this.#perf.now() : 0\n    }\n\n    this.#statusTTL = (status, index) => {\n      if (ttls[index]) {\n        const ttl = ttls[index]\n        const start = starts[index]\n        /* c8 ignore next */\n        if (!ttl || !start) return\n        status.ttl = ttl\n        status.start = start\n        status.now = cachedNow || getNow()\n        const age = status.now - start\n        status.remainingTTL = ttl - age\n      }\n    }\n\n    // debounce calls to perf.now() to 1s so we're not hitting\n    // that costly call repeatedly.\n    let cachedNow = 0\n    const getNow = () => {\n      const n = this.#perf.now()\n      if (this.ttlResolution > 0) {\n        cachedNow = n\n        const t = setTimeout(() => (cachedNow = 0), this.ttlResolution)\n        // not available on all platforms\n        /* c8 ignore start */\n        if (t.unref) {\n          t.unref()\n        }\n        /* c8 ignore stop */\n      }\n      return n\n    }\n\n    this.getRemainingTTL = key => {\n      const index = this.#keyMap.get(key)\n      if (index === undefined) {\n        return 0\n      }\n      const ttl = ttls[index]\n      const start = starts[index]\n      if (!ttl || !start) {\n        return Infinity\n      }\n      const age = (cachedNow || getNow()) - start\n      return ttl - age\n    }\n\n    this.#isStale = index => {\n      const s = starts[index]\n      const t = ttls[index]\n      return !!t && !!s && (cachedNow || getNow()) - s > t\n    }\n  }\n\n  // conditionally set private methods related to TTL\n  #updateItemAge: (index: Index) => void = () => {}\n  #statusTTL: (status: LRUCache.Status<V>, index: Index) => void = () => {}\n  #setItemTTL: (\n    index: Index,\n    ttl: LRUCache.Milliseconds,\n    start?: LRUCache.Milliseconds,\n    // ignore because we never call this if we're not already in TTL mode\n    /* c8 ignore start */\n  ) => void = () => {}\n  /* c8 ignore stop */\n\n  #isStale: (index: Index) => boolean = () => false\n\n  #initializeSizeTracking() {\n    const sizes = new ZeroArray(this.#max)\n    this.#calculatedSize = 0\n    this.#sizes = sizes\n    this.#removeItemSize = index => {\n      this.#calculatedSize -= sizes[index] as number\n      sizes[index] = 0\n    }\n    this.#requireSize = (k, v, size, sizeCalculation) => {\n      // provisionally accept background fetches.\n      // actual value size will be checked when they return.\n      if (this.#isBackgroundFetch(v)) {\n        return 0\n      }\n      if (!isPosInt(size)) {\n        if (sizeCalculation) {\n          if (typeof sizeCalculation !== 'function') {\n            throw new TypeError('sizeCalculation must be a function')\n          }\n          size = sizeCalculation(v, k)\n          if (!isPosInt(size)) {\n            throw new TypeError(\n              'sizeCalculation return invalid (expect positive integer)',\n            )\n          }\n        } else {\n          throw new TypeError(\n            'invalid size value (must be positive integer). ' +\n              'When maxSize or maxEntrySize is used, sizeCalculation ' +\n              'or size must be set.',\n          )\n        }\n      }\n      return size\n    }\n    this.#addItemSize = (\n      index: Index,\n      size: LRUCache.Size,\n      status?: LRUCache.Status<V>,\n    ) => {\n      sizes[index] = size\n      if (this.#maxSize) {\n        const maxSize = this.#maxSize - (sizes[index] as number)\n        while (this.#calculatedSize > maxSize) {\n          this.#evict(true)\n        }\n      }\n      this.#calculatedSize += sizes[index] as number\n      if (status) {\n        status.entrySize = size\n        status.totalCalculatedSize = this.#calculatedSize\n      }\n    }\n  }\n\n  #removeItemSize: (index: Index) => void = _i => {}\n  #addItemSize: (\n    index: Index,\n    size: LRUCache.Size,\n    status?: LRUCache.Status<V>,\n  ) => void = (_i, _s, _st) => {}\n  #requireSize: (\n    k: K,\n    v: V | BackgroundFetch<V>,\n    size?: LRUCache.Size,\n    sizeCalculation?: LRUCache.SizeCalculator<K, V>,\n  ) => LRUCache.Size = (\n    _k: K,\n    _v: V | BackgroundFetch<V>,\n    size?: LRUCache.Size,\n    sizeCalculation?: LRUCache.SizeCalculator<K, V>,\n  ) => {\n    if (size || sizeCalculation) {\n      throw new TypeError(\n        'cannot set size without setting maxSize or maxEntrySize on cache',\n      )\n    }\n    return 0\n  };\n\n  *#indexes({ allowStale = this.allowStale } = {}) {\n    if (this.#size) {\n      for (let i = this.#tail; true; ) {\n        if (!this.#isValidIndex(i)) {\n          break\n        }\n        if (allowStale || !this.#isStale(i)) {\n          yield i\n        }\n        if (i === this.#head) {\n          break\n        } else {\n          i = this.#prev[i] as Index\n        }\n      }\n    }\n  }\n\n  *#rindexes({ allowStale = this.allowStale } = {}) {\n    if (this.#size) {\n      for (let i = this.#head; true; ) {\n        if (!this.#isValidIndex(i)) {\n          break\n        }\n        if (allowStale || !this.#isStale(i)) {\n          yield i\n        }\n        if (i === this.#tail) {\n          break\n        } else {\n          i = this.#next[i] as Index\n        }\n      }\n    }\n  }\n\n  #isValidIndex(index: Index) {\n    return (\n      index !== undefined &&\n      this.#keyMap.get(this.#keyList[index] as K) === index\n    )\n  }\n\n  /**\n   * Return a generator yielding `[key, value]` pairs,\n   * in order from most recently used to least recently used.\n   */\n  *entries() {\n    for (const i of this.#indexes()) {\n      if (\n        this.#valList[i] !== undefined &&\n        this.#keyList[i] !== undefined &&\n        !this.#isBackgroundFetch(this.#valList[i])\n      ) {\n        yield [this.#keyList[i], this.#valList[i]] as [K, V]\n      }\n    }\n  }\n\n  /**\n   * Inverse order version of {@link LRUCache.entries}\n   *\n   * Return a generator yielding `[key, value]` pairs,\n   * in order from least recently used to most recently used.\n   */\n  *rentries() {\n    for (const i of this.#rindexes()) {\n      if (\n        this.#valList[i] !== undefined &&\n        this.#keyList[i] !== undefined &&\n        !this.#isBackgroundFetch(this.#valList[i])\n      ) {\n        yield [this.#keyList[i], this.#valList[i]]\n      }\n    }\n  }\n\n  /**\n   * Return a generator yielding the keys in the cache,\n   * in order from most recently used to least recently used.\n   */\n  *keys() {\n    for (const i of this.#indexes()) {\n      const k = this.#keyList[i]\n      if (k !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield k\n      }\n    }\n  }\n\n  /**\n   * Inverse order version of {@link LRUCache.keys}\n   *\n   * Return a generator yielding the keys in the cache,\n   * in order from least recently used to most recently used.\n   */\n  *rkeys() {\n    for (const i of this.#rindexes()) {\n      const k = this.#keyList[i]\n      if (k !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield k\n      }\n    }\n  }\n\n  /**\n   * Return a generator yielding the values in the cache,\n   * in order from most recently used to least recently used.\n   */\n  *values() {\n    for (const i of this.#indexes()) {\n      const v = this.#valList[i]\n      if (v !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield this.#valList[i] as V\n      }\n    }\n  }\n\n  /**\n   * Inverse order version of {@link LRUCache.values}\n   *\n   * Return a generator yielding the values in the cache,\n   * in order from least recently used to most recently used.\n   */\n  *rvalues() {\n    for (const i of this.#rindexes()) {\n      const v = this.#valList[i]\n      if (v !== undefined && !this.#isBackgroundFetch(this.#valList[i])) {\n        yield this.#valList[i]\n      }\n    }\n  }\n\n  /**\n   * Iterating over the cache itself yields the same results as\n   * {@link LRUCache.entries}\n   */\n  [Symbol.iterator]() {\n    return this.entries()\n  }\n\n  /**\n   * A String value that is used in the creation of the default string\n   * description of an object. Called by the built-in method\n   * `Object.prototype.toString`.\n   */\n  [Symbol.toStringTag] = 'LRUCache'\n\n  /**\n   * Find a value for which the supplied fn method returns a truthy value,\n   * similar to `Array.find()`. fn is called as `fn(value, key, cache)`.\n   */\n  find(\n    fn: (v: V, k: K, self: LRUCache<K, V, FC>) => boolean,\n    getOptions: LRUCache.GetOptions<K, V, FC> = {},\n  ) {\n    for (const i of this.#indexes()) {\n      const v = this.#valList[i]\n      const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined) continue\n      if (fn(value, this.#keyList[i] as K, this)) {\n        return this.get(this.#keyList[i] as K, getOptions)\n      }\n    }\n  }\n\n  /**\n   * Call the supplied function on each item in the cache, in order from most\n   * recently used to least recently used.\n   *\n   * `fn` is called as `fn(value, key, cache)`.\n   *\n   * If `thisp` is provided, function will be called in the `this`-context of\n   * the provided object, or the cache if no `thisp` object is provided.\n   *\n   * Does not update age or recenty of use, or iterate over stale values.\n   */\n  forEach(\n    fn: (v: V, k: K, self: LRUCache<K, V, FC>) => any,\n    thisp: any = this,\n  ) {\n    for (const i of this.#indexes()) {\n      const v = this.#valList[i]\n      const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined) continue\n      fn.call(thisp, value, this.#keyList[i] as K, this)\n    }\n  }\n\n  /**\n   * The same as {@link LRUCache.forEach} but items are iterated over in\n   * reverse order.  (ie, less recently used items are iterated over first.)\n   */\n  rforEach(\n    fn: (v: V, k: K, self: LRUCache<K, V, FC>) => any,\n    thisp: any = this,\n  ) {\n    for (const i of this.#rindexes()) {\n      const v = this.#valList[i]\n      const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined) continue\n      fn.call(thisp, value, this.#keyList[i] as K, this)\n    }\n  }\n\n  /**\n   * Delete any stale entries. Returns true if anything was removed,\n   * false otherwise.\n   */\n  purgeStale() {\n    let deleted = false\n    for (const i of this.#rindexes({ allowStale: true })) {\n      if (this.#isStale(i)) {\n        this.#delete(this.#keyList[i] as K, 'expire')\n        deleted = true\n      }\n    }\n    return deleted\n  }\n\n  /**\n   * Get the extended info about a given entry, to get its value, size, and\n   * TTL info simultaneously. Returns `undefined` if the key is not present.\n   *\n   * Unlike {@link LRUCache#dump}, which is designed to be portable and survive\n   * serialization, the `start` value is always the current timestamp, and the\n   * `ttl` is a calculated remaining time to live (negative if expired).\n   *\n   * Always returns stale values, if their info is found in the cache, so be\n   * sure to check for expirations (ie, a negative {@link LRUCache.Entry#ttl})\n   * if relevant.\n   */\n  info(key: K): LRUCache.Entry<V> | undefined {\n    const i = this.#keyMap.get(key)\n    if (i === undefined) return undefined\n    const v = this.#valList[i]\n    /* c8 ignore start - this isn't tested for the info function,\n     * but it's the same logic as found in other places. */\n    const value: V | undefined =\n      this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n    if (value === undefined) return undefined\n    /* c8 ignore end */\n    const entry: LRUCache.Entry<V> = { value }\n    if (this.#ttls && this.#starts) {\n      const ttl = this.#ttls[i]\n      const start = this.#starts[i]\n      if (ttl && start) {\n        const remain = ttl - (this.#perf.now() - start)\n        entry.ttl = remain\n        entry.start = Date.now()\n      }\n    }\n    if (this.#sizes) {\n      entry.size = this.#sizes[i]\n    }\n    return entry\n  }\n\n  /**\n   * Return an array of [key, {@link LRUCache.Entry}] tuples which can be\n   * passed to {@link LRUCache#load}.\n   *\n   * The `start` fields are calculated relative to a portable `Date.now()`\n   * timestamp, even if `performance.now()` is available.\n   *\n   * Stale entries are always included in the `dump`, even if\n   * {@link LRUCache.OptionsBase.allowStale} is false.\n   *\n   * Note: this returns an actual array, not a generator, so it can be more\n   * easily passed around.\n   */\n  dump() {\n    const arr: [K, LRUCache.Entry<V>][] = []\n    for (const i of this.#indexes({ allowStale: true })) {\n      const key = this.#keyList[i]\n      const v = this.#valList[i]\n      const value: V | undefined =\n        this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n      if (value === undefined || key === undefined) continue\n      const entry: LRUCache.Entry<V> = { value }\n      if (this.#ttls && this.#starts) {\n        entry.ttl = this.#ttls[i]\n        // always dump the start relative to a portable timestamp\n        // it's ok for this to be a bit slow, it's a rare operation.\n        const age = this.#perf.now() - (this.#starts[i] as number)\n        entry.start = Math.floor(Date.now() - age)\n      }\n      if (this.#sizes) {\n        entry.size = this.#sizes[i]\n      }\n      arr.unshift([key, entry])\n    }\n    return arr\n  }\n\n  /**\n   * Reset the cache and load in the items in entries in the order listed.\n   *\n   * The shape of the resulting cache may be different if the same options are\n   * not used in both caches.\n   *\n   * The `start` fields are assumed to be calculated relative to a portable\n   * `Date.now()` timestamp, even if `performance.now()` is available.\n   */\n  load(arr: [K, LRUCache.Entry<V>][]) {\n    this.clear()\n    for (const [key, entry] of arr) {\n      if (entry.start) {\n        // entry.start is a portable timestamp, but we may be using\n        // node's performance.now(), so calculate the offset, so that\n        // we get the intended remaining TTL, no matter how long it's\n        // been on ice.\n        //\n        // it's ok for this to be a bit slow, it's a rare operation.\n        const age = Date.now() - entry.start\n        entry.start = this.#perf.now() - age\n      }\n      this.set(key, entry.value, entry)\n    }\n  }\n\n  /**\n   * Add a value to the cache.\n   *\n   * Note: if `undefined` is specified as a value, this is an alias for\n   * {@link LRUCache#delete}\n   *\n   * Fields on the {@link LRUCache.SetOptions} options param will override\n   * their corresponding values in the constructor options for the scope\n   * of this single `set()` operation.\n   *\n   * If `start` is provided, then that will set the effective start\n   * time for the TTL calculation. Note that this must be a previous\n   * value of `performance.now()` if supported, or a previous value of\n   * `Date.now()` if not.\n   *\n   * Options object may also include `size`, which will prevent\n   * calling the `sizeCalculation` function and just use the specified\n   * number if it is a positive integer, and `noDisposeOnSet` which\n   * will prevent calling a `dispose` function in the case of\n   * overwrites.\n   *\n   * If the `size` (or return value of `sizeCalculation`) for a given\n   * entry is greater than `maxEntrySize`, then the item will not be\n   * added to the cache.\n   *\n   * Will update the recency of the entry.\n   *\n   * If the value is `undefined`, then this is an alias for\n   * `cache.delete(key)`. `undefined` is never stored in the cache.\n   */\n  set(\n    k: K,\n    v: V | BackgroundFetch<V> | undefined,\n    setOptions: LRUCache.SetOptions<K, V, FC> = {},\n  ) {\n    if (v === undefined) {\n      this.delete(k)\n      return this\n    }\n    const {\n      ttl = this.ttl,\n      start,\n      noDisposeOnSet = this.noDisposeOnSet,\n      sizeCalculation = this.sizeCalculation,\n      status,\n    } = setOptions\n    let { noUpdateTTL = this.noUpdateTTL } = setOptions\n\n    const size = this.#requireSize(\n      k,\n      v,\n      setOptions.size || 0,\n      sizeCalculation,\n    )\n    // if the item doesn't fit, don't do anything\n    // NB: maxEntrySize set to maxSize by default\n    if (this.maxEntrySize && size > this.maxEntrySize) {\n      if (status) {\n        status.set = 'miss'\n        status.maxEntrySizeExceeded = true\n      }\n      // have to delete, in case something is there already.\n      this.#delete(k, 'set')\n      return this\n    }\n    let index = this.#size === 0 ? undefined : this.#keyMap.get(k)\n    if (index === undefined) {\n      // addition\n      index = (\n        this.#size === 0 ? this.#tail\n        : this.#free.length !== 0 ? this.#free.pop()\n        : this.#size === this.#max ? this.#evict(false)\n        : this.#size) as Index\n      this.#keyList[index] = k\n      this.#valList[index] = v\n      this.#keyMap.set(k, index)\n      this.#next[this.#tail] = index\n      this.#prev[index] = this.#tail\n      this.#tail = index\n      this.#size++\n      this.#addItemSize(index, size, status)\n      if (status) status.set = 'add'\n      noUpdateTTL = false\n      if (this.#hasOnInsert) {\n        this.#onInsert?.(v as V, k, 'add')\n      }\n    } else {\n      // update\n      this.#moveToTail(index)\n      const oldVal = this.#valList[index] as V | BackgroundFetch<V>\n      if (v !== oldVal) {\n        if (this.#hasFetchMethod && this.#isBackgroundFetch(oldVal)) {\n          oldVal.__abortController.abort(new Error('replaced'))\n          const { __staleWhileFetching: s } = oldVal\n          if (s !== undefined && !noDisposeOnSet) {\n            if (this.#hasDispose) {\n              this.#dispose?.(s as V, k, 'set')\n            }\n            if (this.#hasDisposeAfter) {\n              this.#disposed?.push([s as V, k, 'set'])\n            }\n          }\n        } else if (!noDisposeOnSet) {\n          if (this.#hasDispose) {\n            this.#dispose?.(oldVal as V, k, 'set')\n          }\n          if (this.#hasDisposeAfter) {\n            this.#disposed?.push([oldVal as V, k, 'set'])\n          }\n        }\n        this.#removeItemSize(index)\n        this.#addItemSize(index, size, status)\n        this.#valList[index] = v\n        if (status) {\n          status.set = 'replace'\n          const oldValue =\n            oldVal && this.#isBackgroundFetch(oldVal) ?\n              oldVal.__staleWhileFetching\n            : oldVal\n          if (oldValue !== undefined) status.oldValue = oldValue\n        }\n      } else if (status) {\n        status.set = 'update'\n      }\n\n      if (this.#hasOnInsert) {\n        this.onInsert?.(v as V, k, v === oldVal ? 'update' : 'replace')\n      }\n    }\n    if (ttl !== 0 && !this.#ttls) {\n      this.#initializeTTLTracking()\n    }\n    if (this.#ttls) {\n      if (!noUpdateTTL) {\n        this.#setItemTTL(index, ttl, start)\n      }\n      if (status) this.#statusTTL(status, index)\n    }\n    if (!noDisposeOnSet && this.#hasDisposeAfter && this.#disposed) {\n      const dt = this.#disposed\n      let task: DisposeTask<K, V> | undefined\n      while ((task = dt?.shift())) {\n        this.#disposeAfter?.(...task)\n      }\n    }\n    return this\n  }\n\n  /**\n   * Evict the least recently used item, returning its value or\n   * `undefined` if cache is empty.\n   */\n  pop(): V | undefined {\n    try {\n      while (this.#size) {\n        const val = this.#valList[this.#head]\n        this.#evict(true)\n        if (this.#isBackgroundFetch(val)) {\n          if (val.__staleWhileFetching) {\n            return val.__staleWhileFetching\n          }\n        } else if (val !== undefined) {\n          return val\n        }\n      }\n    } finally {\n      if (this.#hasDisposeAfter && this.#disposed) {\n        const dt = this.#disposed\n        let task: DisposeTask<K, V> | undefined\n        while ((task = dt?.shift())) {\n          this.#disposeAfter?.(...task)\n        }\n      }\n    }\n  }\n\n  #evict(free: boolean) {\n    const head = this.#head\n    const k = this.#keyList[head] as K\n    const v = this.#valList[head] as V\n    if (this.#hasFetchMethod && this.#isBackgroundFetch(v)) {\n      v.__abortController.abort(new Error('evicted'))\n    } else if (this.#hasDispose || this.#hasDisposeAfter) {\n      if (this.#hasDispose) {\n        this.#dispose?.(v, k, 'evict')\n      }\n      if (this.#hasDisposeAfter) {\n        this.#disposed?.push([v, k, 'evict'])\n      }\n    }\n    this.#removeItemSize(head)\n    if (this.#autopurgeTimers?.[head]) {\n      clearTimeout(this.#autopurgeTimers[head])\n      this.#autopurgeTimers[head] = undefined\n    }\n    // if we aren't about to use the index, then null these out\n    if (free) {\n      this.#keyList[head] = undefined\n      this.#valList[head] = undefined\n      this.#free.push(head)\n    }\n    if (this.#size === 1) {\n      this.#head = this.#tail = 0 as Index\n      this.#free.length = 0\n    } else {\n      this.#head = this.#next[head] as Index\n    }\n    this.#keyMap.delete(k)\n    this.#size--\n    return head\n  }\n\n  /**\n   * Check if a key is in the cache, without updating the recency of use.\n   * Will return false if the item is stale, even though it is technically\n   * in the cache.\n   *\n   * Check if a key is in the cache, without updating the recency of\n   * use. Age is updated if {@link LRUCache.OptionsBase.updateAgeOnHas} is set\n   * to `true` in either the options or the constructor.\n   *\n   * Will return `false` if the item is stale, even though it is technically in\n   * the cache. The difference can be determined (if it matters) by using a\n   * `status` argument, and inspecting the `has` field.\n   *\n   * Will not update item age unless\n   * {@link LRUCache.OptionsBase.updateAgeOnHas} is set.\n   */\n  has(k: K, hasOptions: LRUCache.HasOptions<K, V, FC> = {}) {\n    const { updateAgeOnHas = this.updateAgeOnHas, status } = hasOptions\n    const index = this.#keyMap.get(k)\n    if (index !== undefined) {\n      const v = this.#valList[index]\n      if (\n        this.#isBackgroundFetch(v) &&\n        v.__staleWhileFetching === undefined\n      ) {\n        return false\n      }\n      if (!this.#isStale(index)) {\n        if (updateAgeOnHas) {\n          this.#updateItemAge(index)\n        }\n        if (status) {\n          status.has = 'hit'\n          this.#statusTTL(status, index)\n        }\n        return true\n      } else if (status) {\n        status.has = 'stale'\n        this.#statusTTL(status, index)\n      }\n    } else if (status) {\n      status.has = 'miss'\n    }\n    return false\n  }\n\n  /**\n   * Like {@link LRUCache#get} but doesn't update recency or delete stale\n   * items.\n   *\n   * Returns `undefined` if the item is stale, unless\n   * {@link LRUCache.OptionsBase.allowStale} is set.\n   */\n  peek(k: K, peekOptions: LRUCache.PeekOptions<K, V, FC> = {}) {\n    const { allowStale = this.allowStale } = peekOptions\n    const index = this.#keyMap.get(k)\n    if (index === undefined || (!allowStale && this.#isStale(index))) {\n      return\n    }\n    const v = this.#valList[index]\n    // either stale and allowed, or forcing a refresh of non-stale value\n    return this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v\n  }\n\n  #backgroundFetch(\n    k: K,\n    index: Index | undefined,\n    options: LRUCache.FetchOptions<K, V, FC>,\n    context: any,\n  ): BackgroundFetch<V> {\n    const v = index === undefined ? undefined : this.#valList[index]\n    if (this.#isBackgroundFetch(v)) {\n      return v\n    }\n\n    const ac = new AC()\n    const { signal } = options\n    // when/if our AC signals, then stop listening to theirs.\n    signal?.addEventListener('abort', () => ac.abort(signal.reason), {\n      signal: ac.signal,\n    })\n\n    const fetchOpts = {\n      signal: ac.signal,\n      options,\n      context,\n    }\n\n    const cb = (v: V | undefined, updateCache = false): V | undefined => {\n      const { aborted } = ac.signal\n      const ignoreAbort = options.ignoreFetchAbort && v !== undefined\n      const proceed = options.ignoreFetchAbort ||\n        !!(options.allowStaleOnFetchAbort && v !== undefined)\n      if (options.status) {\n        if (aborted && !updateCache) {\n          options.status.fetchAborted = true\n          options.status.fetchError = ac.signal.reason\n          if (ignoreAbort) options.status.fetchAbortIgnored = true\n        } else {\n          options.status.fetchResolved = true\n        }\n      }\n      if (aborted && !ignoreAbort && !updateCache) {\n        return fetchFail(ac.signal.reason, proceed)\n      }\n      // either we didn't abort, and are still here, or we did, and ignored\n      const bf = p as BackgroundFetch<V>\n      // if nothing else has been written there but we're set to update the\n      // cache and ignore the abort, or if it's still pending on this specific\n      // background request, then write it to the cache.\n      const vl = this.#valList[index as Index]\n      if (vl === p || (ignoreAbort && updateCache && vl === undefined)) {\n        if (v === undefined) {\n          if (bf.__staleWhileFetching !== undefined) {\n            this.#valList[index as Index] = bf.__staleWhileFetching\n          } else {\n            this.#delete(k, 'fetch')\n          }\n        } else {\n          if (options.status) options.status.fetchUpdated = true\n          this.set(k, v, fetchOpts.options)\n        }\n      }\n      return v\n    }\n\n    const eb = (er: any) => {\n      if (options.status) {\n        options.status.fetchRejected = true\n        options.status.fetchError = er\n      }\n      // do not pass go, do not collect $200\n      return fetchFail(er, false)\n    }\n\n    const fetchFail = (er: any, proceed: boolean): V | undefined => {\n      const { aborted } = ac.signal\n      const allowStaleAborted = aborted && options.allowStaleOnFetchAbort\n      const allowStale =\n        allowStaleAborted || options.allowStaleOnFetchRejection\n      const noDelete = allowStale || options.noDeleteOnFetchRejection\n      const bf = p as BackgroundFetch<V>\n      if (this.#valList[index as Index] === p) {\n        // if we allow stale on fetch rejections, then we need to ensure that\n        // the stale value is not removed from the cache when the fetch fails.\n        const del = !noDelete ||\n          !proceed && bf.__staleWhileFetching === undefined\n        if (del) {\n          this.#delete(k, 'fetch')\n        } else if (!allowStaleAborted) {\n          // still replace the *promise* with the stale value,\n          // since we are done with the promise at this point.\n          // leave it untouched if we're still waiting for an\n          // aborted background fetch that hasn't yet returned.\n          this.#valList[index as Index] = bf.__staleWhileFetching\n        }\n      }\n      if (allowStale) {\n        if (options.status && bf.__staleWhileFetching !== undefined) {\n          options.status.returnedStale = true\n        }\n        return bf.__staleWhileFetching\n      } else if (bf.__returned === bf) {\n        throw er\n      }\n    }\n\n    const pcall = (\n      res: (v: V | undefined) => void,\n      rej: (e: any) => void,\n    ) => {\n      const fmp = this.#fetchMethod?.(k, v, fetchOpts)\n      if (fmp && fmp instanceof Promise) {\n        fmp.then(v => res(v === undefined ? undefined : v), rej)\n      }\n      // ignored, we go until we finish, regardless.\n      // defer check until we are actually aborting,\n      // so fetchMethod can override.\n      ac.signal.addEventListener('abort', () => {\n        if (!options.ignoreFetchAbort || options.allowStaleOnFetchAbort) {\n          res(undefined)\n          // when it eventually resolves, update the cache.\n          if (options.allowStaleOnFetchAbort) {\n            res = v => cb(v, true)\n          }\n        }\n      })\n    }\n\n    if (options.status) options.status.fetchDispatched = true\n    const p = new Promise(pcall).then(cb, eb)\n    const bf: BackgroundFetch<V> = Object.assign(p, {\n      __abortController: ac,\n      __staleWhileFetching: v,\n      __returned: undefined,\n    })\n\n    if (index === undefined) {\n      // internal, don't expose status.\n      this.set(k, bf, { ...fetchOpts.options, status: undefined })\n      index = this.#keyMap.get(k)\n    } else {\n      this.#valList[index] = bf\n    }\n    return bf\n  }\n\n  #isBackgroundFetch(p: any): p is BackgroundFetch<V> {\n    if (!this.#hasFetchMethod) return false\n    const b = p as BackgroundFetch<V>\n    return (\n      !!b &&\n      b instanceof Promise &&\n      b.hasOwnProperty('__staleWhileFetching') &&\n      b.__abortController instanceof AC\n    )\n  }\n\n  /**\n   * Make an asynchronous cached fetch using the\n   * {@link LRUCache.OptionsBase.fetchMethod} function.\n   *\n   * If the value is in the cache and not stale, then the returned\n   * Promise resolves to the value.\n   *\n   * If not in the cache, or beyond its TTL staleness, then\n   * `fetchMethod(key, staleValue, { options, signal, context })` is\n   * called, and the value returned will be added to the cache once\n   * resolved.\n   *\n   * If called with `allowStale`, and an asynchronous fetch is\n   * currently in progress to reload a stale value, then the former\n   * stale value will be returned.\n   *\n   * If called with `forceRefresh`, then the cached item will be\n   * re-fetched, even if it is not stale. However, if `allowStale` is also\n   * set, then the old value will still be returned. This is useful\n   * in cases where you want to force a reload of a cached value. If\n   * a background fetch is already in progress, then `forceRefresh`\n   * has no effect.\n   *\n   * If multiple fetches for the same key are issued, then they will all be\n   * coalesced into a single call to fetchMethod.\n   *\n   * Note that this means that handling options such as\n   * {@link LRUCache.OptionsBase.allowStaleOnFetchAbort},\n   * {@link LRUCache.FetchOptions.signal},\n   * and {@link LRUCache.OptionsBase.allowStaleOnFetchRejection} will be\n   * determined by the FIRST fetch() call for a given key.\n   *\n   * This is a known (fixable) shortcoming which will be addresed on when\n   * someone complains about it, as the fix would involve added complexity and\n   * may not be worth the costs for this edge case.\n   *\n   * If {@link LRUCache.OptionsBase.fetchMethod} is not specified, then this is\n   * effectively an alias for `Promise.resolve(cache.get(key))`.\n   *\n   * When the fetch method resolves to a value, if the fetch has not\n   * been aborted due to deletion, eviction, or being overwritten,\n   * then it is added to the cache using the options provided.\n   *\n   * If the key is evicted or deleted before the `fetchMethod`\n   * resolves, then the AbortSignal passed to the `fetchMethod` will\n   * receive an `abort` event, and the promise returned by `fetch()`\n   * will reject with the reason for the abort.\n   *\n   * If a `signal` is passed to the `fetch()` call, then aborting the\n   * signal will abort the fetch and cause the `fetch()` promise to\n   * reject with the reason provided.\n   *\n   * **Setting `context`**\n   *\n   * If an `FC` type is set to a type other than `unknown`, `void`, or\n   * `undefined` in the {@link LRUCache} constructor, then all\n   * calls to `cache.fetch()` _must_ provide a `context` option. If\n   * set to `undefined` or `void`, then calls to fetch _must not_\n   * provide a `context` option.\n   *\n   * The `context` param allows you to provide arbitrary data that\n   * might be relevant in the course of fetching the data. It is only\n   * relevant for the course of a single `fetch()` operation, and\n   * discarded afterwards.\n   *\n   * **Note: `fetch()` calls are inflight-unique**\n   *\n   * If you call `fetch()` multiple times with the same key value,\n   * then every call after the first will resolve on the same\n   * promise<sup>1</sup>,\n   * _even if they have different settings that would otherwise change\n   * the behavior of the fetch_, such as `noDeleteOnFetchRejection`\n   * or `ignoreFetchAbort`.\n   *\n   * In most cases, this is not a problem (in fact, only fetching\n   * something once is what you probably want, if you're caching in\n   * the first place). If you are changing the fetch() options\n   * dramatically between runs, there's a good chance that you might\n   * be trying to fit divergent semantics into a single object, and\n   * would be better off with multiple cache instances.\n   *\n   * **1**: Ie, they're not the \"same Promise\", but they resolve at\n   * the same time, because they're both waiting on the same\n   * underlying fetchMethod response.\n   */\n\n  fetch(\n    k: K,\n    fetchOptions: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : LRUCache.FetchOptionsWithContext<K, V, FC>,\n  ): Promise<undefined | V>\n\n  // this overload not allowed if context is required\n  fetch(\n    k: unknown extends FC ? K\n    : FC extends undefined | void ? K\n    : never,\n    fetchOptions?: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : never,\n  ): Promise<undefined | V>\n\n  async fetch(\n    k: K,\n    fetchOptions: LRUCache.FetchOptions<K, V, FC> = {},\n  ): Promise<undefined | V> {\n    const {\n      // get options\n      allowStale = this.allowStale,\n      updateAgeOnGet = this.updateAgeOnGet,\n      noDeleteOnStaleGet = this.noDeleteOnStaleGet,\n      // set options\n      ttl = this.ttl,\n      noDisposeOnSet = this.noDisposeOnSet,\n      size = 0,\n      sizeCalculation = this.sizeCalculation,\n      noUpdateTTL = this.noUpdateTTL,\n      // fetch exclusive options\n      noDeleteOnFetchRejection = this.noDeleteOnFetchRejection,\n      allowStaleOnFetchRejection = this.allowStaleOnFetchRejection,\n      ignoreFetchAbort = this.ignoreFetchAbort,\n      allowStaleOnFetchAbort = this.allowStaleOnFetchAbort,\n      context,\n      forceRefresh = false,\n      status,\n      signal,\n    } = fetchOptions\n\n    if (!this.#hasFetchMethod) {\n      if (status) status.fetch = 'get'\n      return this.get(k, {\n        allowStale,\n        updateAgeOnGet,\n        noDeleteOnStaleGet,\n        status,\n      })\n    }\n\n    const options = {\n      allowStale,\n      updateAgeOnGet,\n      noDeleteOnStaleGet,\n      ttl,\n      noDisposeOnSet,\n      size,\n      sizeCalculation,\n      noUpdateTTL,\n      noDeleteOnFetchRejection,\n      allowStaleOnFetchRejection,\n      allowStaleOnFetchAbort,\n      ignoreFetchAbort,\n      status,\n      signal,\n    }\n\n    let index = this.#keyMap.get(k)\n    if (index === undefined) {\n      if (status) status.fetch = 'miss'\n      const p = this.#backgroundFetch(k, index, options, context)\n      return (p.__returned = p)\n    } else {\n      // in cache, maybe already fetching\n      const v = this.#valList[index]\n      if (this.#isBackgroundFetch(v)) {\n        const stale = allowStale && v.__staleWhileFetching !== undefined\n        if (status) {\n          status.fetch = 'inflight'\n          if (stale) status.returnedStale = true\n        }\n        return stale ? v.__staleWhileFetching : (v.__returned = v)\n      }\n\n      // if we force a refresh, that means do NOT serve the cached value,\n      // unless we are already in the process of refreshing the cache.\n      const isStale = this.#isStale(index)\n      if (!forceRefresh && !isStale) {\n        if (status) status.fetch = 'hit'\n        this.#moveToTail(index)\n        if (updateAgeOnGet) {\n          this.#updateItemAge(index)\n        }\n        if (status) this.#statusTTL(status, index)\n        return v\n      }\n\n      // ok, it is stale or a forced refresh, and not already fetching.\n      // refresh the cache.\n      const p = this.#backgroundFetch(k, index, options, context)\n      const hasStale = p.__staleWhileFetching !== undefined\n      const staleVal = hasStale && allowStale\n      if (status) {\n        status.fetch = isStale ? 'stale' : 'refresh'\n        if (staleVal && isStale) status.returnedStale = true\n      }\n      return staleVal ? p.__staleWhileFetching : (p.__returned = p)\n    }\n  }\n\n  /**\n   * In some cases, `cache.fetch()` may resolve to `undefined`, either because\n   * a {@link LRUCache.OptionsBase#fetchMethod} was not provided (turning\n   * `cache.fetch(k)` into just an async wrapper around `cache.get(k)`) or\n   * because `ignoreFetchAbort` was specified (either to the constructor or\n   * in the {@link LRUCache.FetchOptions}). Also, the\n   * {@link LRUCache.OptionsBase.fetchMethod} may return `undefined` or `void`, making\n   * the test even more complicated.\n   *\n   * Because inferring the cases where `undefined` might be returned are so\n   * cumbersome, but testing for `undefined` can also be annoying, this method\n   * can be used, which will reject if `this.fetch()` resolves to undefined.\n   */\n  forceFetch(\n    k: K,\n    fetchOptions: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : LRUCache.FetchOptionsWithContext<K, V, FC>,\n  ): Promise<V>\n  // this overload not allowed if context is required\n  forceFetch(\n    k: unknown extends FC ? K\n    : FC extends undefined | void ? K\n    : never,\n    fetchOptions?: unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n    : never,\n  ): Promise<V>\n  async forceFetch(\n    k: K,\n    fetchOptions: LRUCache.FetchOptions<K, V, FC> = {},\n  ): Promise<V> {\n    const v = await this.fetch(\n      k,\n      fetchOptions as unknown extends FC ? LRUCache.FetchOptions<K, V, FC>\n      : FC extends undefined | void ? LRUCache.FetchOptionsNoContext<K, V>\n      : LRUCache.FetchOptionsWithContext<K, V, FC>,\n    )\n    if (v === undefined) throw new Error('fetch() returned undefined')\n    return v\n  }\n\n  /**\n   * If the key is found in the cache, then this is equivalent to\n   * {@link LRUCache#get}. If not, in the cache, then calculate the value using\n   * the {@link LRUCache.OptionsBase.memoMethod}, and add it to the cache.\n   *\n   * If an `FC` type is set to a type other than `unknown`, `void`, or\n   * `undefined` in the LRUCache constructor, then all calls to `cache.memo()`\n   * _must_ provide a `context` option. If set to `undefined` or `void`, then\n   * calls to memo _must not_ provide a `context` option.\n   *\n   * The `context` param allows you to provide arbitrary data that might be\n   * relevant in the course of fetching the data. It is only relevant for the\n   * course of a single `memo()` operation, and discarded afterwards.\n   */\n  memo(\n    k: K,\n    memoOptions: unknown extends FC ? LRUCache.MemoOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.MemoOptionsNoContext<K, V>\n    : LRUCache.MemoOptionsWithContext<K, V, FC>,\n  ): V\n  // this overload not allowed if context is required\n  memo(\n    k: unknown extends FC ? K\n    : FC extends undefined | void ? K\n    : never,\n    memoOptions?: unknown extends FC ? LRUCache.MemoOptions<K, V, FC>\n    : FC extends undefined | void ? LRUCache.MemoOptionsNoContext<K, V>\n    : never,\n  ): V\n  memo(k: K, memoOptions: LRUCache.MemoOptions<K, V, FC> = {}) {\n    const memoMethod = this.#memoMethod\n    if (!memoMethod) {\n      throw new Error('no memoMethod provided to constructor')\n    }\n    const { context, forceRefresh, ...options } = memoOptions\n    const v = this.get(k, options)\n    if (!forceRefresh && v !== undefined) return v\n    const vv = memoMethod(k, v, {\n      options,\n      context,\n    } as LRUCache.MemoizerOptions<K, V, FC>)\n    this.set(k, vv, options)\n    return vv\n  }\n\n  /**\n   * Return a value from the cache. Will update the recency of the cache\n   * entry found.\n   *\n   * If the key is not found, get() will return `undefined`.\n   */\n  get(k: K, getOptions: LRUCache.GetOptions<K, V, FC> = {}) {\n    const {\n      allowStale = this.allowStale,\n      updateAgeOnGet = this.updateAgeOnGet,\n      noDeleteOnStaleGet = this.noDeleteOnStaleGet,\n      status,\n    } = getOptions\n    const index = this.#keyMap.get(k)\n    if (index !== undefined) {\n      const value = this.#valList[index]\n      const fetching = this.#isBackgroundFetch(value)\n      if (status) this.#statusTTL(status, index)\n      if (this.#isStale(index)) {\n        if (status) status.get = 'stale'\n        // delete only if not an in-flight background fetch\n        if (!fetching) {\n          if (!noDeleteOnStaleGet) {\n            this.#delete(k, 'expire')\n          }\n          if (status && allowStale) status.returnedStale = true\n          return allowStale ? value : undefined\n        } else {\n          if (\n            status &&\n            allowStale &&\n            value.__staleWhileFetching !== undefined\n          ) {\n            status.returnedStale = true\n          }\n          return allowStale ? value.__staleWhileFetching : undefined\n        }\n      } else {\n        if (status) status.get = 'hit'\n        // if we're currently fetching it, we don't actually have it yet\n        // it's not stale, which means this isn't a staleWhileRefetching.\n        // If it's not stale, and fetching, AND has a __staleWhileFetching\n        // value, then that means the user fetched with {forceRefresh:true},\n        // so it's safe to return that value.\n        if (fetching) {\n          return value.__staleWhileFetching\n        }\n        this.#moveToTail(index)\n        if (updateAgeOnGet) {\n          this.#updateItemAge(index)\n        }\n        return value\n      }\n    } else if (status) {\n      status.get = 'miss'\n    }\n  }\n\n  #connect(p: Index, n: Index) {\n    this.#prev[n] = p\n    this.#next[p] = n\n  }\n\n  #moveToTail(index: Index): void {\n    // if tail already, nothing to do\n    // if head, move head to next[index]\n    // else\n    //   move next[prev[index]] to next[index] (head has no prev)\n    //   move prev[next[index]] to prev[index]\n    // prev[index] = tail\n    // next[tail] = index\n    // tail = index\n    if (index !== this.#tail) {\n      if (index === this.#head) {\n        this.#head = this.#next[index] as Index\n      } else {\n        this.#connect(\n          this.#prev[index] as Index,\n          this.#next[index] as Index,\n        )\n      }\n      this.#connect(this.#tail, index)\n      this.#tail = index\n    }\n  }\n\n  /**\n   * Deletes a key out of the cache.\n   *\n   * Returns true if the key was deleted, false otherwise.\n   */\n  delete(k: K) {\n    return this.#delete(k, 'delete')\n  }\n\n  #delete(k: K, reason: LRUCache.DisposeReason) {\n    let deleted = false\n    if (this.#size !== 0) {\n      const index = this.#keyMap.get(k)\n      if (index !== undefined) {\n        if (this.#autopurgeTimers?.[index]) {\n          clearTimeout(this.#autopurgeTimers?.[index])\n          this.#autopurgeTimers[index] = undefined\n        }\n        deleted = true\n        if (this.#size === 1) {\n          this.#clear(reason)\n        } else {\n          this.#removeItemSize(index)\n          const v = this.#valList[index]\n          if (this.#isBackgroundFetch(v)) {\n            v.__abortController.abort(new Error('deleted'))\n          } else if (this.#hasDispose || this.#hasDisposeAfter) {\n            if (this.#hasDispose) {\n              this.#dispose?.(v as V, k, reason)\n            }\n            if (this.#hasDisposeAfter) {\n              this.#disposed?.push([v as V, k, reason])\n            }\n          }\n          this.#keyMap.delete(k)\n          this.#keyList[index] = undefined\n          this.#valList[index] = undefined\n          if (index === this.#tail) {\n            this.#tail = this.#prev[index] as Index\n          } else if (index === this.#head) {\n            this.#head = this.#next[index] as Index\n          } else {\n            const pi = this.#prev[index] as number\n            this.#next[pi] = this.#next[index] as number\n            const ni = this.#next[index] as number\n            this.#prev[ni] = this.#prev[index] as number\n          }\n          this.#size--\n          this.#free.push(index)\n        }\n      }\n    }\n    if (this.#hasDisposeAfter && this.#disposed?.length) {\n      const dt = this.#disposed\n      let task: DisposeTask<K, V> | undefined\n      while ((task = dt?.shift())) {\n        this.#disposeAfter?.(...task)\n      }\n    }\n    return deleted\n  }\n\n  /**\n   * Clear the cache entirely, throwing away all values.\n   */\n  clear() {\n    return this.#clear('delete')\n  }\n  #clear(reason: LRUCache.DisposeReason) {\n    for (const index of this.#rindexes({ allowStale: true })) {\n      const v = this.#valList[index]\n      if (this.#isBackgroundFetch(v)) {\n        v.__abortController.abort(new Error('deleted'))\n      } else {\n        const k = this.#keyList[index]\n        if (this.#hasDispose) {\n          this.#dispose?.(v as V, k as K, reason)\n        }\n        if (this.#hasDisposeAfter) {\n          this.#disposed?.push([v as V, k as K, reason])\n        }\n      }\n    }\n\n    this.#keyMap.clear()\n    this.#valList.fill(undefined)\n    this.#keyList.fill(undefined)\n    if (this.#ttls && this.#starts) {\n      this.#ttls.fill(0)\n      this.#starts.fill(0)\n      for (const t of this.#autopurgeTimers ?? []) {\n        if (t !== undefined) clearTimeout(t)\n      }\n      this.#autopurgeTimers?.fill(undefined)\n    }\n    if (this.#sizes) {\n      this.#sizes.fill(0)\n    }\n    this.#head = 0 as Index\n    this.#tail = 0 as Index\n    this.#free.length = 0\n    this.#calculatedSize = 0\n    this.#size = 0\n    if (this.#hasDisposeAfter && this.#disposed) {\n      const dt = this.#disposed\n      let task: DisposeTask<K, V> | undefined\n      while ((task = dt?.shift())) {\n        this.#disposeAfter?.(...task)\n      }\n    }\n  }\n}\n", "import { LRUCache } from 'lru-cache'\nimport { posix, win32 } from 'node:path'\n\nimport { fileURLToPath } from 'node:url'\n\nimport {\n  lstatSync,\n  readdir as readdirCB,\n  readdirSync,\n  readlinkSync,\n  realpathSync as rps,\n} from 'fs'\nimport * as actualFS from 'node:fs'\n\nconst realpathSync = rps.native\n// TODO: test perf of fs/promises realpath vs realpathCB,\n// since the promises one uses realpath.native\n\nimport { lstat, readdir, readlink, realpath } from 'node:fs/promises'\n\nimport { Minipass } from 'minipass'\nimport type { Dirent, Stats } from 'node:fs'\n\n/**\n * An object that will be used to override the default `fs`\n * methods.  Any methods that are not overridden will use Node's\n * built-in implementations.\n *\n * - lstatSync\n * - readdir (callback `withFileTypes` Dirent variant, used for\n *   readdirCB and most walks)\n * - readdirSync\n * - readlinkSync\n * - realpathSync\n * - promises: Object containing the following async methods:\n *   - lstat\n *   - readdir (Dirent variant only)\n *   - readlink\n *   - realpath\n */\nexport interface FSOption {\n  lstatSync?: (path: string) => Stats\n  readdir?: (\n    path: string,\n    options: { withFileTypes: true },\n    cb: (er: NodeJS.ErrnoException | null, entries?: Dirent[]) => any,\n  ) => void\n  readdirSync?: (\n    path: string,\n    options: { withFileTypes: true },\n  ) => Dirent[]\n  readlinkSync?: (path: string) => string\n  realpathSync?: (path: string) => string\n  promises?: {\n    lstat?: (path: string) => Promise<Stats>\n    readdir?: (\n      path: string,\n      options: { withFileTypes: true },\n    ) => Promise<Dirent[]>\n    readlink?: (path: string) => Promise<string>\n    realpath?: (path: string) => Promise<string>\n    [k: string]: any\n  }\n  [k: string]: any\n}\n\ninterface FSValue {\n  lstatSync: (path: string) => Stats\n  readdir: (\n    path: string,\n    options: { withFileTypes: true },\n    cb: (er: NodeJS.ErrnoException | null, entries?: Dirent[]) => any,\n  ) => void\n  readdirSync: (path: string, options: { withFileTypes: true }) => Dirent[]\n  readlinkSync: (path: string) => string\n  realpathSync: (path: string) => string\n  promises: {\n    lstat: (path: string) => Promise<Stats>\n    readdir: (\n      path: string,\n      options: { withFileTypes: true },\n    ) => Promise<Dirent[]>\n    readlink: (path: string) => Promise<string>\n    realpath: (path: string) => Promise<string>\n    [k: string]: any\n  }\n  [k: string]: any\n}\n\nconst defaultFS: FSValue = {\n  lstatSync,\n  readdir: readdirCB,\n  readdirSync,\n  readlinkSync,\n  realpathSync,\n  promises: {\n    lstat,\n    readdir,\n    readlink,\n    realpath,\n  },\n}\n\n// if they just gave us require('fs') then use our default\nconst fsFromOption = (fsOption?: FSOption): FSValue =>\n  !fsOption || fsOption === defaultFS || fsOption === actualFS ?\n    defaultFS\n  : {\n      ...defaultFS,\n      ...fsOption,\n      promises: {\n        ...defaultFS.promises,\n        ...(fsOption.promises || {}),\n      },\n    }\n\n// turn something like //?/c:/ into c:\\\nconst uncDriveRegexp = /^\\\\\\\\\\?\\\\([a-z]:)\\\\?$/i\nconst uncToDrive = (rootPath: string): string =>\n  rootPath.replace(/\\//g, '\\\\').replace(uncDriveRegexp, '$1\\\\')\n\n// windows paths are separated by either / or \\\nconst eitherSep = /[\\\\\\/]/\n\nconst UNKNOWN = 0 // may not even exist, for all we know\nconst IFIFO = 0b0001\nconst IFCHR = 0b0010\nconst IFDIR = 0b0100\nconst IFBLK = 0b0110\nconst IFREG = 0b1000\nconst IFLNK = 0b1010\nconst IFSOCK = 0b1100\nconst IFMT = 0b1111\n\nexport type Type =\n  | 'Unknown'\n  | 'FIFO'\n  | 'CharacterDevice'\n  | 'Directory'\n  | 'BlockDevice'\n  | 'File'\n  | 'SymbolicLink'\n  | 'Socket'\n\n// mask to unset low 4 bits\nconst IFMT_UNKNOWN = ~IFMT\n\n// set after successfully calling readdir() and getting entries.\nconst READDIR_CALLED = 0b0000_0001_0000\n// set after a successful lstat()\nconst LSTAT_CALLED = 0b0000_0010_0000\n// set if an entry (or one of its parents) is definitely not a dir\nconst ENOTDIR = 0b0000_0100_0000\n// set if an entry (or one of its parents) does not exist\n// (can also be set on lstat errors like EACCES or ENAMETOOLONG)\nconst ENOENT = 0b0000_1000_0000\n// cannot have child entries -- also verify &IFMT is either IFDIR or IFLNK\n// set if we fail to readlink\nconst ENOREADLINK = 0b0001_0000_0000\n// set if we know realpath() will fail\nconst ENOREALPATH = 0b0010_0000_0000\n\nconst ENOCHILD = ENOTDIR | ENOENT | ENOREALPATH\nconst TYPEMASK = 0b0011_1111_1111\n\nconst entToType = (s: Dirent | Stats) =>\n  s.isFile() ? IFREG\n  : s.isDirectory() ? IFDIR\n  : s.isSymbolicLink() ? IFLNK\n  : s.isCharacterDevice() ? IFCHR\n  : s.isBlockDevice() ? IFBLK\n  : s.isSocket() ? IFSOCK\n  : s.isFIFO() ? IFIFO\n  : UNKNOWN\n\n// normalize unicode path names\nconst normalizeCache = new LRUCache<string, string>({ max: 2 ** 12 })\nconst normalize = (s: string) => {\n  const c = normalizeCache.get(s)\n  if (c) return c\n  const n = s.normalize('NFKD')\n  normalizeCache.set(s, n)\n  return n\n}\n\nconst normalizeNocaseCache = new LRUCache<string, string>({ max: 2 ** 12 })\nconst normalizeNocase = (s: string) => {\n  const c = normalizeNocaseCache.get(s)\n  if (c) return c\n  const n = normalize(s.toLowerCase())\n  normalizeNocaseCache.set(s, n)\n  return n\n}\n\n/**\n * Options that may be provided to the Path constructor\n */\nexport interface PathOpts {\n  fullpath?: string\n  relative?: string\n  relativePosix?: string\n  parent?: PathBase\n  /**\n   * See {@link FSOption}\n   */\n  fs?: FSOption\n}\n\n/**\n * An LRUCache for storing resolved path strings or Path objects.\n * @internal\n */\nexport class ResolveCache extends LRUCache<string, string> {\n  constructor() {\n    super({ max: 256 })\n  }\n}\n\n// In order to prevent blowing out the js heap by allocating hundreds of\n// thousands of Path entries when walking extremely large trees, the \"children\"\n// in this tree are represented by storing an array of Path entries in an\n// LRUCache, indexed by the parent.  At any time, Path.children() may return an\n// empty array, indicating that it doesn't know about any of its children, and\n// thus has to rebuild that cache.  This is fine, it just means that we don't\n// benefit as much from having the cached entries, but huge directory walks\n// don't blow out the stack, and smaller ones are still as fast as possible.\n//\n//It does impose some complexity when building up the readdir data, because we\n//need to pass a reference to the children array that we started with.\n\n/**\n * an LRUCache for storing child entries.\n * @internal\n */\nexport class ChildrenCache extends LRUCache<PathBase, Children> {\n  constructor(maxSize: number = 16 * 1024) {\n    super({\n      maxSize,\n      // parent + children\n      sizeCalculation: a => a.length + 1,\n    })\n  }\n}\n\n/**\n * Array of Path objects, plus a marker indicating the first provisional entry\n *\n * @internal\n */\nexport type Children = PathBase[] & { provisional: number }\n\nconst setAsCwd = Symbol('PathScurry setAsCwd')\n\n/**\n * Path objects are sort of like a super-powered\n * {@link https://nodejs.org/docs/latest/api/fs.html#class-fsdirent fs.Dirent}\n *\n * Each one represents a single filesystem entry on disk, which may or may not\n * exist. It includes methods for reading various types of information via\n * lstat, readlink, and readdir, and caches all information to the greatest\n * degree possible.\n *\n * Note that fs operations that would normally throw will instead return an\n * \"empty\" value. This is in order to prevent excessive overhead from error\n * stack traces.\n */\nexport abstract class PathBase implements Dirent {\n  /**\n   * the basename of this path\n   *\n   * **Important**: *always* test the path name against any test string\n   * usingthe {@link isNamed} method, and not by directly comparing this\n   * string. Otherwise, unicode path strings that the system sees as identical\n   * will not be properly treated as the same path, leading to incorrect\n   * behavior and possible security issues.\n   */\n  name: string\n  /**\n   * the Path entry corresponding to the path root.\n   *\n   * @internal\n   */\n  root: PathBase\n  /**\n   * All roots found within the current PathScurry family\n   *\n   * @internal\n   */\n  roots: { [k: string]: PathBase }\n  /**\n   * a reference to the parent path, or undefined in the case of root entries\n   *\n   * @internal\n   */\n  parent?: PathBase\n  /**\n   * boolean indicating whether paths are compared case-insensitively\n   * @internal\n   */\n  nocase: boolean\n\n  /**\n   * boolean indicating that this path is the current working directory\n   * of the PathScurry collection that contains it.\n   */\n  isCWD: boolean = false\n\n  /**\n   * the string or regexp used to split paths. On posix, it is `'/'`, and on\n   * windows it is a RegExp matching either `'/'` or `'\\\\'`\n   */\n  abstract splitSep: string | RegExp\n  /**\n   * The path separator string to use when joining paths\n   */\n  abstract sep: string\n\n  // potential default fs override\n  #fs: FSValue\n\n  // Stats fields\n  #dev?: number\n  get dev() {\n    return this.#dev\n  }\n  #mode?: number\n  get mode() {\n    return this.#mode\n  }\n  #nlink?: number\n  get nlink() {\n    return this.#nlink\n  }\n  #uid?: number\n  get uid() {\n    return this.#uid\n  }\n  #gid?: number\n  get gid() {\n    return this.#gid\n  }\n  #rdev?: number\n  get rdev() {\n    return this.#rdev\n  }\n  #blksize?: number\n  get blksize() {\n    return this.#blksize\n  }\n  #ino?: number\n  get ino() {\n    return this.#ino\n  }\n  #size?: number\n  get size() {\n    return this.#size\n  }\n  #blocks?: number\n  get blocks() {\n    return this.#blocks\n  }\n  #atimeMs?: number\n  get atimeMs() {\n    return this.#atimeMs\n  }\n  #mtimeMs?: number\n  get mtimeMs() {\n    return this.#mtimeMs\n  }\n  #ctimeMs?: number\n  get ctimeMs() {\n    return this.#ctimeMs\n  }\n  #birthtimeMs?: number\n  get birthtimeMs() {\n    return this.#birthtimeMs\n  }\n  #atime?: Date\n  get atime() {\n    return this.#atime\n  }\n  #mtime?: Date\n  get mtime() {\n    return this.#mtime\n  }\n  #ctime?: Date\n  get ctime() {\n    return this.#ctime\n  }\n  #birthtime?: Date\n  get birthtime() {\n    return this.#birthtime\n  }\n\n  #matchName: string\n  #depth?: number\n  #fullpath?: string\n  #fullpathPosix?: string\n  #relative?: string\n  #relativePosix?: string\n  #type: number\n  #children: ChildrenCache\n  #linkTarget?: PathBase\n  #realpath?: PathBase\n\n  /**\n   * This property is for compatibility with the Dirent class as of\n   * Node v20, where Dirent['parentPath'] refers to the path of the\n   * directory that was passed to readdir. For root entries, it's the path\n   * to the entry itself.\n   */\n  get parentPath(): string {\n    return (this.parent || this).fullpath()\n  }\n\n  /* c8 ignore start */\n  /**\n   * Deprecated alias for Dirent['parentPath'] Somewhat counterintuitively,\n   * this property refers to the *parent* path, not the path object itself.\n   *\n   * @deprecated\n   */\n  get path(): string {\n    return this.parentPath\n  }\n  /* c8 ignore stop */\n\n  /**\n   * Do not create new Path objects directly.  They should always be accessed\n   * via the PathScurry class or other methods on the Path class.\n   *\n   * @internal\n   */\n  constructor(\n    name: string,\n    type: number = UNKNOWN,\n    root: PathBase | undefined,\n    roots: { [k: string]: PathBase },\n    nocase: boolean,\n    children: ChildrenCache,\n    opts: PathOpts,\n  ) {\n    this.name = name\n    this.#matchName = nocase ? normalizeNocase(name) : normalize(name)\n    this.#type = type & TYPEMASK\n    this.nocase = nocase\n    this.roots = roots\n    this.root = root || this\n    this.#children = children\n    this.#fullpath = opts.fullpath\n    this.#relative = opts.relative\n    this.#relativePosix = opts.relativePosix\n    this.parent = opts.parent\n    if (this.parent) {\n      this.#fs = this.parent.#fs\n    } else {\n      this.#fs = fsFromOption(opts.fs)\n    }\n  }\n\n  /**\n   * Returns the depth of the Path object from its root.\n   *\n   * For example, a path at `/foo/bar` would have a depth of 2.\n   */\n  depth(): number {\n    if (this.#depth !== undefined) return this.#depth\n    if (!this.parent) return (this.#depth = 0)\n    return (this.#depth = this.parent.depth() + 1)\n  }\n\n  /**\n   * @internal\n   */\n  abstract getRootString(path: string): string\n  /**\n   * @internal\n   */\n  abstract getRoot(rootPath: string): PathBase\n  /**\n   * @internal\n   */\n  abstract newChild(name: string, type?: number, opts?: PathOpts): PathBase\n\n  /**\n   * @internal\n   */\n  childrenCache() {\n    return this.#children\n  }\n\n  /**\n   * Get the Path object referenced by the string path, resolved from this Path\n   */\n  resolve(path?: string): PathBase {\n    if (!path) {\n      return this\n    }\n    const rootPath = this.getRootString(path)\n    const dir = path.substring(rootPath.length)\n    const dirParts = dir.split(this.splitSep)\n    const result: PathBase =\n      rootPath ?\n        this.getRoot(rootPath).#resolveParts(dirParts)\n      : this.#resolveParts(dirParts)\n    return result\n  }\n\n  #resolveParts(dirParts: string[]) {\n    let p: PathBase = this\n    for (const part of dirParts) {\n      p = p.child(part)\n    }\n    return p\n  }\n\n  /**\n   * Returns the cached children Path objects, if still available.  If they\n   * have fallen out of the cache, then returns an empty array, and resets the\n   * READDIR_CALLED bit, so that future calls to readdir() will require an fs\n   * lookup.\n   *\n   * @internal\n   */\n  children(): Children {\n    const cached = this.#children.get(this)\n    if (cached) {\n      return cached\n    }\n    const children: Children = Object.assign([], { provisional: 0 })\n    this.#children.set(this, children)\n    this.#type &= ~READDIR_CALLED\n    return children\n  }\n\n  /**\n   * Resolves a path portion and returns or creates the child Path.\n   *\n   * Returns `this` if pathPart is `''` or `'.'`, or `parent` if pathPart is\n   * `'..'`.\n   *\n   * This should not be called directly.  If `pathPart` contains any path\n   * separators, it will lead to unsafe undefined behavior.\n   *\n   * Use `Path.resolve()` instead.\n   *\n   * @internal\n   */\n  child(pathPart: string, opts?: PathOpts): PathBase {\n    if (pathPart === '' || pathPart === '.') {\n      return this\n    }\n    if (pathPart === '..') {\n      return this.parent || this\n    }\n\n    // find the child\n    const children = this.children()\n    const name =\n      this.nocase ? normalizeNocase(pathPart) : normalize(pathPart)\n    for (const p of children) {\n      if (p.#matchName === name) {\n        return p\n      }\n    }\n\n    // didn't find it, create provisional child, since it might not\n    // actually exist.  If we know the parent isn't a dir, then\n    // in fact it CAN'T exist.\n    const s = this.parent ? this.sep : ''\n    const fullpath =\n      this.#fullpath ? this.#fullpath + s + pathPart : undefined\n    const pchild = this.newChild(pathPart, UNKNOWN, {\n      ...opts,\n      parent: this,\n      fullpath,\n    })\n\n    if (!this.canReaddir()) {\n      pchild.#type |= ENOENT\n    }\n\n    // don't have to update provisional, because if we have real children,\n    // then provisional is set to children.length, otherwise a lower number\n    children.push(pchild)\n    return pchild\n  }\n\n  /**\n   * The relative path from the cwd. If it does not share an ancestor with\n   * the cwd, then this ends up being equivalent to the fullpath()\n   */\n  relative(): string {\n    if (this.isCWD) return ''\n    if (this.#relative !== undefined) {\n      return this.#relative\n    }\n    const name = this.name\n    const p = this.parent\n    if (!p) {\n      return (this.#relative = this.name)\n    }\n    const pv = p.relative()\n    return pv + (!pv || !p.parent ? '' : this.sep) + name\n  }\n\n  /**\n   * The relative path from the cwd, using / as the path separator.\n   * If it does not share an ancestor with\n   * the cwd, then this ends up being equivalent to the fullpathPosix()\n   * On posix systems, this is identical to relative().\n   */\n  relativePosix(): string {\n    if (this.sep === '/') return this.relative()\n    if (this.isCWD) return ''\n    if (this.#relativePosix !== undefined) return this.#relativePosix\n    const name = this.name\n    const p = this.parent\n    if (!p) {\n      return (this.#relativePosix = this.fullpathPosix())\n    }\n    const pv = p.relativePosix()\n    return pv + (!pv || !p.parent ? '' : '/') + name\n  }\n\n  /**\n   * The fully resolved path string for this Path entry\n   */\n  fullpath(): string {\n    if (this.#fullpath !== undefined) {\n      return this.#fullpath\n    }\n    const name = this.name\n    const p = this.parent\n    if (!p) {\n      return (this.#fullpath = this.name)\n    }\n    const pv = p.fullpath()\n    const fp = pv + (!p.parent ? '' : this.sep) + name\n    return (this.#fullpath = fp)\n  }\n\n  /**\n   * On platforms other than windows, this is identical to fullpath.\n   *\n   * On windows, this is overridden to return the forward-slash form of the\n   * full UNC path.\n   */\n  fullpathPosix(): string {\n    if (this.#fullpathPosix !== undefined) return this.#fullpathPosix\n    if (this.sep === '/') return (this.#fullpathPosix = this.fullpath())\n    if (!this.parent) {\n      const p = this.fullpath().replace(/\\\\/g, '/')\n      if (/^[a-z]:\\//i.test(p)) {\n        return (this.#fullpathPosix = `//?/${p}`)\n      } else {\n        return (this.#fullpathPosix = p)\n      }\n    }\n    const p = this.parent\n    const pfpp = p.fullpathPosix()\n    const fpp = pfpp + (!pfpp || !p.parent ? '' : '/') + this.name\n    return (this.#fullpathPosix = fpp)\n  }\n\n  /**\n   * Is the Path of an unknown type?\n   *\n   * Note that we might know *something* about it if there has been a previous\n   * filesystem operation, for example that it does not exist, or is not a\n   * link, or whether it has child entries.\n   */\n  isUnknown(): boolean {\n    return (this.#type & IFMT) === UNKNOWN\n  }\n\n  isType(type: Type): boolean {\n    return this[`is${type}`]()\n  }\n\n  getType(): Type {\n    return (\n      this.isUnknown() ? 'Unknown'\n      : this.isDirectory() ? 'Directory'\n      : this.isFile() ? 'File'\n      : this.isSymbolicLink() ? 'SymbolicLink'\n      : this.isFIFO() ? 'FIFO'\n      : this.isCharacterDevice() ? 'CharacterDevice'\n      : this.isBlockDevice() ? 'BlockDevice'\n      : /* c8 ignore start */ this.isSocket() ? 'Socket'\n      : 'Unknown'\n    )\n    /* c8 ignore stop */\n  }\n\n  /**\n   * Is the Path a regular file?\n   */\n  isFile(): boolean {\n    return (this.#type & IFMT) === IFREG\n  }\n\n  /**\n   * Is the Path a directory?\n   */\n  isDirectory(): boolean {\n    return (this.#type & IFMT) === IFDIR\n  }\n\n  /**\n   * Is the path a character device?\n   */\n  isCharacterDevice(): boolean {\n    return (this.#type & IFMT) === IFCHR\n  }\n\n  /**\n   * Is the path a block device?\n   */\n  isBlockDevice(): boolean {\n    return (this.#type & IFMT) === IFBLK\n  }\n\n  /**\n   * Is the path a FIFO pipe?\n   */\n  isFIFO(): boolean {\n    return (this.#type & IFMT) === IFIFO\n  }\n\n  /**\n   * Is the path a socket?\n   */\n  isSocket(): boolean {\n    return (this.#type & IFMT) === IFSOCK\n  }\n\n  /**\n   * Is the path a symbolic link?\n   */\n  isSymbolicLink(): boolean {\n    return (this.#type & IFLNK) === IFLNK\n  }\n\n  /**\n   * Return the entry if it has been subject of a successful lstat, or\n   * undefined otherwise.\n   *\n   * Does not read the filesystem, so an undefined result *could* simply\n   * mean that we haven't called lstat on it.\n   */\n  lstatCached(): PathBase | undefined {\n    return this.#type & LSTAT_CALLED ? this : undefined\n  }\n\n  /**\n   * Return the cached link target if the entry has been the subject of a\n   * successful readlink, or undefined otherwise.\n   *\n   * Does not read the filesystem, so an undefined result *could* just mean we\n   * don't have any cached data. Only use it if you are very sure that a\n   * readlink() has been called at some point.\n   */\n  readlinkCached(): PathBase | undefined {\n    return this.#linkTarget\n  }\n\n  /**\n   * Returns the cached realpath target if the entry has been the subject\n   * of a successful realpath, or undefined otherwise.\n   *\n   * Does not read the filesystem, so an undefined result *could* just mean we\n   * don't have any cached data. Only use it if you are very sure that a\n   * realpath() has been called at some point.\n   */\n  realpathCached(): PathBase | undefined {\n    return this.#realpath\n  }\n\n  /**\n   * Returns the cached child Path entries array if the entry has been the\n   * subject of a successful readdir(), or [] otherwise.\n   *\n   * Does not read the filesystem, so an empty array *could* just mean we\n   * don't have any cached data. Only use it if you are very sure that a\n   * readdir() has been called recently enough to still be valid.\n   */\n  readdirCached(): PathBase[] {\n    const children = this.children()\n    return children.slice(0, children.provisional)\n  }\n\n  /**\n   * Return true if it's worth trying to readlink.  Ie, we don't (yet) have\n   * any indication that readlink will definitely fail.\n   *\n   * Returns false if the path is known to not be a symlink, if a previous\n   * readlink failed, or if the entry does not exist.\n   */\n  canReadlink(): boolean {\n    if (this.#linkTarget) return true\n    if (!this.parent) return false\n    // cases where it cannot possibly succeed\n    const ifmt = this.#type & IFMT\n    return !(\n      (ifmt !== UNKNOWN && ifmt !== IFLNK) ||\n      this.#type & ENOREADLINK ||\n      this.#type & ENOENT\n    )\n  }\n\n  /**\n   * Return true if readdir has previously been successfully called on this\n   * path, indicating that cachedReaddir() is likely valid.\n   */\n  calledReaddir(): boolean {\n    return !!(this.#type & READDIR_CALLED)\n  }\n\n  /**\n   * Returns true if the path is known to not exist. That is, a previous lstat\n   * or readdir failed to verify its existence when that would have been\n   * expected, or a parent entry was marked either enoent or enotdir.\n   */\n  isENOENT(): boolean {\n    return !!(this.#type & ENOENT)\n  }\n\n  /**\n   * Return true if the path is a match for the given path name.  This handles\n   * case sensitivity and unicode normalization.\n   *\n   * Note: even on case-sensitive systems, it is **not** safe to test the\n   * equality of the `.name` property to determine whether a given pathname\n   * matches, due to unicode normalization mismatches.\n   *\n   * Always use this method instead of testing the `path.name` property\n   * directly.\n   */\n  isNamed(n: string): boolean {\n    return !this.nocase ?\n        this.#matchName === normalize(n)\n      : this.#matchName === normalizeNocase(n)\n  }\n\n  /**\n   * Return the Path object corresponding to the target of a symbolic link.\n   *\n   * If the Path is not a symbolic link, or if the readlink call fails for any\n   * reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   */\n  async readlink(): Promise<PathBase | undefined> {\n    const target = this.#linkTarget\n    if (target) {\n      return target\n    }\n    if (!this.canReadlink()) {\n      return undefined\n    }\n    /* c8 ignore start */\n    // already covered by the canReadlink test, here for ts grumples\n    if (!this.parent) {\n      return undefined\n    }\n    /* c8 ignore stop */\n    try {\n      const read = await this.#fs.promises.readlink(this.fullpath())\n      const linkTarget = (await this.parent.realpath())?.resolve(read)\n      if (linkTarget) {\n        return (this.#linkTarget = linkTarget)\n      }\n    } catch (er) {\n      this.#readlinkFail((er as NodeJS.ErrnoException).code)\n      return undefined\n    }\n  }\n\n  /**\n   * Synchronous {@link PathBase.readlink}\n   */\n  readlinkSync(): PathBase | undefined {\n    const target = this.#linkTarget\n    if (target) {\n      return target\n    }\n    if (!this.canReadlink()) {\n      return undefined\n    }\n    /* c8 ignore start */\n    // already covered by the canReadlink test, here for ts grumples\n    if (!this.parent) {\n      return undefined\n    }\n    /* c8 ignore stop */\n    try {\n      const read = this.#fs.readlinkSync(this.fullpath())\n      const linkTarget = this.parent.realpathSync()?.resolve(read)\n      if (linkTarget) {\n        return (this.#linkTarget = linkTarget)\n      }\n    } catch (er) {\n      this.#readlinkFail((er as NodeJS.ErrnoException).code)\n      return undefined\n    }\n  }\n\n  #readdirSuccess(children: Children) {\n    // succeeded, mark readdir called bit\n    this.#type |= READDIR_CALLED\n    // mark all remaining provisional children as ENOENT\n    for (let p = children.provisional; p < children.length; p++) {\n      const c = children[p]\n      if (c) c.#markENOENT()\n    }\n  }\n\n  #markENOENT() {\n    // mark as UNKNOWN and ENOENT\n    if (this.#type & ENOENT) return\n    this.#type = (this.#type | ENOENT) & IFMT_UNKNOWN\n    this.#markChildrenENOENT()\n  }\n\n  #markChildrenENOENT() {\n    // all children are provisional and do not exist\n    const children = this.children()\n    children.provisional = 0\n    for (const p of children) {\n      p.#markENOENT()\n    }\n  }\n\n  #markENOREALPATH() {\n    this.#type |= ENOREALPATH\n    this.#markENOTDIR()\n  }\n\n  // save the information when we know the entry is not a dir\n  #markENOTDIR() {\n    // entry is not a directory, so any children can't exist.\n    // this *should* be impossible, since any children created\n    // after it's been marked ENOTDIR should be marked ENOENT,\n    // so it won't even get to this point.\n    /* c8 ignore start */\n    if (this.#type & ENOTDIR) return\n    /* c8 ignore stop */\n    let t = this.#type\n    // this could happen if we stat a dir, then delete it,\n    // then try to read it or one of its children.\n    if ((t & IFMT) === IFDIR) t &= IFMT_UNKNOWN\n    this.#type = t | ENOTDIR\n    this.#markChildrenENOENT()\n  }\n\n  #readdirFail(code: string = '') {\n    // markENOTDIR and markENOENT also set provisional=0\n    if (code === 'ENOTDIR' || code === 'EPERM') {\n      this.#markENOTDIR()\n    } else if (code === 'ENOENT') {\n      this.#markENOENT()\n    } else {\n      this.children().provisional = 0\n    }\n  }\n\n  #lstatFail(code: string = '') {\n    // Windows just raises ENOENT in this case, disable for win CI\n    /* c8 ignore start */\n    if (code === 'ENOTDIR') {\n      // already know it has a parent by this point\n      const p = this.parent as PathBase\n      p.#markENOTDIR()\n    } else if (code === 'ENOENT') {\n      /* c8 ignore stop */\n      this.#markENOENT()\n    }\n  }\n\n  #readlinkFail(code: string = '') {\n    let ter = this.#type\n    ter |= ENOREADLINK\n    if (code === 'ENOENT') ter |= ENOENT\n    // windows gets a weird error when you try to readlink a file\n    if (code === 'EINVAL' || code === 'UNKNOWN') {\n      // exists, but not a symlink, we don't know WHAT it is, so remove\n      // all IFMT bits.\n      ter &= IFMT_UNKNOWN\n    }\n    this.#type = ter\n    // windows just gets ENOENT in this case.  We do cover the case,\n    // just disabled because it's impossible on Windows CI\n    /* c8 ignore start */\n    if (code === 'ENOTDIR' && this.parent) {\n      this.parent.#markENOTDIR()\n    }\n    /* c8 ignore stop */\n  }\n\n  #readdirAddChild(e: Dirent, c: Children) {\n    return (\n      this.#readdirMaybePromoteChild(e, c) ||\n      this.#readdirAddNewChild(e, c)\n    )\n  }\n\n  #readdirAddNewChild(e: Dirent, c: Children): PathBase {\n    // alloc new entry at head, so it's never provisional\n    const type = entToType(e)\n    const child = this.newChild(e.name, type, { parent: this })\n    const ifmt = child.#type & IFMT\n    if (ifmt !== IFDIR && ifmt !== IFLNK && ifmt !== UNKNOWN) {\n      child.#type |= ENOTDIR\n    }\n    c.unshift(child)\n    c.provisional++\n    return child\n  }\n\n  #readdirMaybePromoteChild(e: Dirent, c: Children): PathBase | undefined {\n    for (let p = c.provisional; p < c.length; p++) {\n      const pchild = c[p]\n      const name =\n        this.nocase ? normalizeNocase(e.name) : normalize(e.name)\n      if (name !== pchild!.#matchName) {\n        continue\n      }\n\n      return this.#readdirPromoteChild(e, pchild!, p, c)\n    }\n  }\n\n  #readdirPromoteChild(\n    e: Dirent,\n    p: PathBase,\n    index: number,\n    c: Children,\n  ): PathBase {\n    const v = p.name\n    // retain any other flags, but set ifmt from dirent\n    p.#type = (p.#type & IFMT_UNKNOWN) | entToType(e)\n    // case sensitivity fixing when we learn the true name.\n    if (v !== e.name) p.name = e.name\n\n    // just advance provisional index (potentially off the list),\n    // otherwise we have to splice/pop it out and re-insert at head\n    if (index !== c.provisional) {\n      if (index === c.length - 1) c.pop()\n      else c.splice(index, 1)\n      c.unshift(p)\n    }\n    c.provisional++\n    return p\n  }\n\n  /**\n   * Call lstat() on this Path, and update all known information that can be\n   * determined.\n   *\n   * Note that unlike `fs.lstat()`, the returned value does not contain some\n   * information, such as `mode`, `dev`, `nlink`, and `ino`.  If that\n   * information is required, you will need to call `fs.lstat` yourself.\n   *\n   * If the Path refers to a nonexistent file, or if the lstat call fails for\n   * any reason, `undefined` is returned.  Otherwise the updated Path object is\n   * returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   */\n  async lstat(): Promise<PathBase | undefined> {\n    if ((this.#type & ENOENT) === 0) {\n      try {\n        this.#applyStat(await this.#fs.promises.lstat(this.fullpath()))\n        return this\n      } catch (er) {\n        this.#lstatFail((er as NodeJS.ErrnoException).code)\n      }\n    }\n  }\n\n  /**\n   * synchronous {@link PathBase.lstat}\n   */\n  lstatSync(): PathBase | undefined {\n    if ((this.#type & ENOENT) === 0) {\n      try {\n        this.#applyStat(this.#fs.lstatSync(this.fullpath()))\n        return this\n      } catch (er) {\n        this.#lstatFail((er as NodeJS.ErrnoException).code)\n      }\n    }\n  }\n\n  #applyStat(st: Stats) {\n    const {\n      atime,\n      atimeMs,\n      birthtime,\n      birthtimeMs,\n      blksize,\n      blocks,\n      ctime,\n      ctimeMs,\n      dev,\n      gid,\n      ino,\n      mode,\n      mtime,\n      mtimeMs,\n      nlink,\n      rdev,\n      size,\n      uid,\n    } = st\n    this.#atime = atime\n    this.#atimeMs = atimeMs\n    this.#birthtime = birthtime\n    this.#birthtimeMs = birthtimeMs\n    this.#blksize = blksize\n    this.#blocks = blocks\n    this.#ctime = ctime\n    this.#ctimeMs = ctimeMs\n    this.#dev = dev\n    this.#gid = gid\n    this.#ino = ino\n    this.#mode = mode\n    this.#mtime = mtime\n    this.#mtimeMs = mtimeMs\n    this.#nlink = nlink\n    this.#rdev = rdev\n    this.#size = size\n    this.#uid = uid\n    const ifmt = entToType(st)\n    // retain any other flags, but set the ifmt\n    this.#type = (this.#type & IFMT_UNKNOWN) | ifmt | LSTAT_CALLED\n    if (ifmt !== UNKNOWN && ifmt !== IFDIR && ifmt !== IFLNK) {\n      this.#type |= ENOTDIR\n    }\n  }\n\n  #onReaddirCB: ((\n    er: NodeJS.ErrnoException | null,\n    entries: Path[],\n  ) => any)[] = []\n  #readdirCBInFlight: boolean = false\n  #callOnReaddirCB(children: Path[]) {\n    this.#readdirCBInFlight = false\n    const cbs = this.#onReaddirCB.slice()\n    this.#onReaddirCB.length = 0\n    cbs.forEach(cb => cb(null, children))\n  }\n\n  /**\n   * Standard node-style callback interface to get list of directory entries.\n   *\n   * If the Path cannot or does not contain any children, then an empty array\n   * is returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   *\n   * @param cb The callback called with (er, entries).  Note that the `er`\n   * param is somewhat extraneous, as all readdir() errors are handled and\n   * simply result in an empty set of entries being returned.\n   * @param allowZalgo Boolean indicating that immediately known results should\n   * *not* be deferred with `queueMicrotask`. Defaults to `false`. Release\n   * zalgo at your peril, the dark pony lord is devious and unforgiving.\n   */\n  readdirCB(\n    cb: (er: NodeJS.ErrnoException | null, entries: PathBase[]) => any,\n    allowZalgo: boolean = false,\n  ): void {\n    if (!this.canReaddir()) {\n      if (allowZalgo) cb(null, [])\n      else queueMicrotask(() => cb(null, []))\n      return\n    }\n\n    const children = this.children()\n    if (this.calledReaddir()) {\n      const c = children.slice(0, children.provisional)\n      if (allowZalgo) cb(null, c)\n      else queueMicrotask(() => cb(null, c))\n      return\n    }\n\n    // don't have to worry about zalgo at this point.\n    this.#onReaddirCB.push(cb)\n    if (this.#readdirCBInFlight) {\n      return\n    }\n    this.#readdirCBInFlight = true\n\n    // else read the directory, fill up children\n    // de-provisionalize any provisional children.\n    const fullpath = this.fullpath()\n    this.#fs.readdir(fullpath, { withFileTypes: true }, (er, entries) => {\n      if (er) {\n        this.#readdirFail((er as NodeJS.ErrnoException).code)\n        children.provisional = 0\n      } else {\n        // if we didn't get an error, we always get entries.\n        //@ts-ignore\n        for (const e of entries) {\n          this.#readdirAddChild(e, children)\n        }\n        this.#readdirSuccess(children)\n      }\n      this.#callOnReaddirCB(children.slice(0, children.provisional))\n      return\n    })\n  }\n\n  #asyncReaddirInFlight?: Promise<void>\n\n  /**\n   * Return an array of known child entries.\n   *\n   * If the Path cannot or does not contain any children, then an empty array\n   * is returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   */\n  async readdir(): Promise<PathBase[]> {\n    if (!this.canReaddir()) {\n      return []\n    }\n\n    const children = this.children()\n    if (this.calledReaddir()) {\n      return children.slice(0, children.provisional)\n    }\n\n    // else read the directory, fill up children\n    // de-provisionalize any provisional children.\n    const fullpath = this.fullpath()\n    if (this.#asyncReaddirInFlight) {\n      await this.#asyncReaddirInFlight\n    } else {\n      /* c8 ignore start */\n      let resolve: () => void = () => {}\n      /* c8 ignore stop */\n      this.#asyncReaddirInFlight = new Promise<void>(\n        res => (resolve = res),\n      )\n      try {\n        for (const e of await this.#fs.promises.readdir(fullpath, {\n          withFileTypes: true,\n        })) {\n          this.#readdirAddChild(e, children)\n        }\n        this.#readdirSuccess(children)\n      } catch (er) {\n        this.#readdirFail((er as NodeJS.ErrnoException).code)\n        children.provisional = 0\n      }\n      this.#asyncReaddirInFlight = undefined\n      resolve()\n    }\n    return children.slice(0, children.provisional)\n  }\n\n  /**\n   * synchronous {@link PathBase.readdir}\n   */\n  readdirSync(): PathBase[] {\n    if (!this.canReaddir()) {\n      return []\n    }\n\n    const children = this.children()\n    if (this.calledReaddir()) {\n      return children.slice(0, children.provisional)\n    }\n\n    // else read the directory, fill up children\n    // de-provisionalize any provisional children.\n    const fullpath = this.fullpath()\n    try {\n      for (const e of this.#fs.readdirSync(fullpath, {\n        withFileTypes: true,\n      })) {\n        this.#readdirAddChild(e, children)\n      }\n      this.#readdirSuccess(children)\n    } catch (er) {\n      this.#readdirFail((er as NodeJS.ErrnoException).code)\n      children.provisional = 0\n    }\n    return children.slice(0, children.provisional)\n  }\n\n  canReaddir() {\n    if (this.#type & ENOCHILD) return false\n    const ifmt = IFMT & this.#type\n    // we always set ENOTDIR when setting IFMT, so should be impossible\n    /* c8 ignore start */\n    if (!(ifmt === UNKNOWN || ifmt === IFDIR || ifmt === IFLNK)) {\n      return false\n    }\n    /* c8 ignore stop */\n    return true\n  }\n\n  shouldWalk(\n    dirs: Set<PathBase | undefined>,\n    walkFilter?: (e: PathBase) => boolean,\n  ): boolean {\n    return (\n      (this.#type & IFDIR) === IFDIR &&\n      !(this.#type & ENOCHILD) &&\n      !dirs.has(this) &&\n      (!walkFilter || walkFilter(this))\n    )\n  }\n\n  /**\n   * Return the Path object corresponding to path as resolved\n   * by realpath(3).\n   *\n   * If the realpath call fails for any reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   * On success, returns a Path object.\n   */\n  async realpath(): Promise<PathBase | undefined> {\n    if (this.#realpath) return this.#realpath\n    if ((ENOREALPATH | ENOREADLINK | ENOENT) & this.#type) return undefined\n    try {\n      const rp = await this.#fs.promises.realpath(this.fullpath())\n      return (this.#realpath = this.resolve(rp))\n    } catch (_) {\n      this.#markENOREALPATH()\n    }\n  }\n\n  /**\n   * Synchronous {@link realpath}\n   */\n  realpathSync(): PathBase | undefined {\n    if (this.#realpath) return this.#realpath\n    if ((ENOREALPATH | ENOREADLINK | ENOENT) & this.#type) return undefined\n    try {\n      const rp = this.#fs.realpathSync(this.fullpath())\n      return (this.#realpath = this.resolve(rp))\n    } catch (_) {\n      this.#markENOREALPATH()\n    }\n  }\n\n  /**\n   * Internal method to mark this Path object as the scurry cwd,\n   * called by {@link PathScurry#chdir}\n   *\n   * @internal\n   */\n  [setAsCwd](oldCwd: PathBase): void {\n    if (oldCwd === this) return\n    oldCwd.isCWD = false\n    this.isCWD = true\n\n    const changed = new Set<PathBase>([])\n    let rp = []\n    let p: PathBase = this\n    while (p && p.parent) {\n      changed.add(p)\n      p.#relative = rp.join(this.sep)\n      p.#relativePosix = rp.join('/')\n      p = p.parent\n      rp.push('..')\n    }\n    // now un-memoize parents of old cwd\n    p = oldCwd\n    while (p && p.parent && !changed.has(p)) {\n      p.#relative = undefined\n      p.#relativePosix = undefined\n      p = p.parent\n    }\n  }\n}\n\n/**\n * Path class used on win32 systems\n *\n * Uses `'\\\\'` as the path separator for returned paths, either `'\\\\'` or `'/'`\n * as the path separator for parsing paths.\n */\nexport class PathWin32 extends PathBase {\n  /**\n   * Separator for generating path strings.\n   */\n  sep: '\\\\' = '\\\\'\n  /**\n   * Separator for parsing path strings.\n   */\n  splitSep: RegExp = eitherSep\n\n  /**\n   * Do not create new Path objects directly.  They should always be accessed\n   * via the PathScurry class or other methods on the Path class.\n   *\n   * @internal\n   */\n  constructor(\n    name: string,\n    type: number = UNKNOWN,\n    root: PathBase | undefined,\n    roots: { [k: string]: PathBase },\n    nocase: boolean,\n    children: ChildrenCache,\n    opts: PathOpts,\n  ) {\n    super(name, type, root, roots, nocase, children, opts)\n  }\n\n  /**\n   * @internal\n   */\n  newChild(name: string, type: number = UNKNOWN, opts: PathOpts = {}) {\n    return new PathWin32(\n      name,\n      type,\n      this.root,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      opts,\n    )\n  }\n\n  /**\n   * @internal\n   */\n  getRootString(path: string): string {\n    return win32.parse(path).root\n  }\n\n  /**\n   * @internal\n   */\n  getRoot(rootPath: string): PathBase {\n    rootPath = uncToDrive(rootPath.toUpperCase())\n    if (rootPath === this.root.name) {\n      return this.root\n    }\n    // ok, not that one, check if it matches another we know about\n    for (const [compare, root] of Object.entries(this.roots)) {\n      if (this.sameRoot(rootPath, compare)) {\n        return (this.roots[rootPath] = root)\n      }\n    }\n    // otherwise, have to create a new one.\n    return (this.roots[rootPath] = new PathScurryWin32(\n      rootPath,\n      this,\n    ).root)\n  }\n\n  /**\n   * @internal\n   */\n  sameRoot(rootPath: string, compare: string = this.root.name): boolean {\n    // windows can (rarely) have case-sensitive filesystem, but\n    // UNC and drive letters are always case-insensitive, and canonically\n    // represented uppercase.\n    rootPath = rootPath\n      .toUpperCase()\n      .replace(/\\//g, '\\\\')\n      .replace(uncDriveRegexp, '$1\\\\')\n    return rootPath === compare\n  }\n}\n\n/**\n * Path class used on all posix systems.\n *\n * Uses `'/'` as the path separator.\n */\nexport class PathPosix extends PathBase {\n  /**\n   * separator for parsing path strings\n   */\n  splitSep: '/' = '/'\n  /**\n   * separator for generating path strings\n   */\n  sep: '/' = '/'\n\n  /**\n   * Do not create new Path objects directly.  They should always be accessed\n   * via the PathScurry class or other methods on the Path class.\n   *\n   * @internal\n   */\n  constructor(\n    name: string,\n    type: number = UNKNOWN,\n    root: PathBase | undefined,\n    roots: { [k: string]: PathBase },\n    nocase: boolean,\n    children: ChildrenCache,\n    opts: PathOpts,\n  ) {\n    super(name, type, root, roots, nocase, children, opts)\n  }\n\n  /**\n   * @internal\n   */\n  getRootString(path: string): string {\n    return path.startsWith('/') ? '/' : ''\n  }\n\n  /**\n   * @internal\n   */\n  getRoot(_rootPath: string): PathBase {\n    return this.root\n  }\n\n  /**\n   * @internal\n   */\n  newChild(name: string, type: number = UNKNOWN, opts: PathOpts = {}) {\n    return new PathPosix(\n      name,\n      type,\n      this.root,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      opts,\n    )\n  }\n}\n\n/**\n * Options that may be provided to the PathScurry constructor\n */\nexport interface PathScurryOpts {\n  /**\n   * perform case-insensitive path matching. Default based on platform\n   * subclass.\n   */\n  nocase?: boolean\n  /**\n   * Number of Path entries to keep in the cache of Path child references.\n   *\n   * Setting this higher than 65536 will dramatically increase the data\n   * consumption and construction time overhead of each PathScurry.\n   *\n   * Setting this value to 256 or lower will significantly reduce the data\n   * consumption and construction time overhead, but may also reduce resolve()\n   * and readdir() performance on large filesystems.\n   *\n   * Default `16384`.\n   */\n  childrenCacheSize?: number\n  /**\n   * An object that overrides the built-in functions from the fs and\n   * fs/promises modules.\n   *\n   * See {@link FSOption}\n   */\n  fs?: FSOption\n}\n\n/**\n * The base class for all PathScurry classes, providing the interface for path\n * resolution and filesystem operations.\n *\n * Typically, you should *not* instantiate this class directly, but rather one\n * of the platform-specific classes, or the exported {@link PathScurry} which\n * defaults to the current platform.\n */\nexport abstract class PathScurryBase {\n  /**\n   * The root Path entry for the current working directory of this Scurry\n   */\n  root: PathBase\n  /**\n   * The string path for the root of this Scurry's current working directory\n   */\n  rootPath: string\n  /**\n   * A collection of all roots encountered, referenced by rootPath\n   */\n  roots: { [k: string]: PathBase }\n  /**\n   * The Path entry corresponding to this PathScurry's current working directory.\n   */\n  cwd: PathBase\n  #resolveCache: ResolveCache\n  #resolvePosixCache: ResolveCache\n  #children: ChildrenCache\n  /**\n   * Perform path comparisons case-insensitively.\n   *\n   * Defaults true on Darwin and Windows systems, false elsewhere.\n   */\n  nocase: boolean\n\n  /**\n   * The path separator used for parsing paths\n   *\n   * `'/'` on Posix systems, either `'/'` or `'\\\\'` on Windows\n   */\n  abstract sep: string | RegExp\n\n  #fs: FSValue\n\n  /**\n   * This class should not be instantiated directly.\n   *\n   * Use PathScurryWin32, PathScurryDarwin, PathScurryPosix, or PathScurry\n   *\n   * @internal\n   */\n  constructor(\n    cwd: URL | string = process.cwd(),\n    pathImpl: typeof win32 | typeof posix,\n    sep: string | RegExp,\n    {\n      nocase,\n      childrenCacheSize = 16 * 1024,\n      fs = defaultFS,\n    }: PathScurryOpts = {},\n  ) {\n    this.#fs = fsFromOption(fs)\n    if (cwd instanceof URL || cwd.startsWith('file://')) {\n      cwd = fileURLToPath(cwd)\n    }\n    // resolve and split root, and then add to the store.\n    // this is the only time we call path.resolve()\n    const cwdPath = pathImpl.resolve(cwd)\n    this.roots = Object.create(null)\n    this.rootPath = this.parseRootPath(cwdPath)\n    this.#resolveCache = new ResolveCache()\n    this.#resolvePosixCache = new ResolveCache()\n    this.#children = new ChildrenCache(childrenCacheSize)\n\n    const split = cwdPath.substring(this.rootPath.length).split(sep)\n    // resolve('/') leaves '', splits to [''], we don't want that.\n    if (split.length === 1 && !split[0]) {\n      split.pop()\n    }\n    /* c8 ignore start */\n    if (nocase === undefined) {\n      throw new TypeError(\n        'must provide nocase setting to PathScurryBase ctor',\n      )\n    }\n    /* c8 ignore stop */\n    this.nocase = nocase\n    this.root = this.newRoot(this.#fs)\n    this.roots[this.rootPath] = this.root\n    let prev: PathBase = this.root\n    let len = split.length - 1\n    const joinSep = pathImpl.sep\n    let abs = this.rootPath\n    let sawFirst = false\n    for (const part of split) {\n      const l = len--\n      prev = prev.child(part, {\n        relative: new Array(l).fill('..').join(joinSep),\n        relativePosix: new Array(l).fill('..').join('/'),\n        fullpath: (abs += (sawFirst ? '' : joinSep) + part),\n      })\n      sawFirst = true\n    }\n    this.cwd = prev\n  }\n\n  /**\n   * Get the depth of a provided path, string, or the cwd\n   */\n  depth(path: Path | string = this.cwd): number {\n    if (typeof path === 'string') {\n      path = this.cwd.resolve(path)\n    }\n    return path.depth()\n  }\n\n  /**\n   * Parse the root portion of a path string\n   *\n   * @internal\n   */\n  abstract parseRootPath(dir: string): string\n  /**\n   * create a new Path to use as root during construction.\n   *\n   * @internal\n   */\n  abstract newRoot(fs: FSValue): PathBase\n  /**\n   * Determine whether a given path string is absolute\n   */\n  abstract isAbsolute(p: string): boolean\n\n  /**\n   * Return the cache of child entries.  Exposed so subclasses can create\n   * child Path objects in a platform-specific way.\n   *\n   * @internal\n   */\n  childrenCache() {\n    return this.#children\n  }\n\n  /**\n   * Resolve one or more path strings to a resolved string\n   *\n   * Same interface as require('path').resolve.\n   *\n   * Much faster than path.resolve() when called multiple times for the same\n   * path, because the resolved Path objects are cached.  Much slower\n   * otherwise.\n   */\n  resolve(...paths: string[]): string {\n    // first figure out the minimum number of paths we have to test\n    // we always start at cwd, but any absolutes will bump the start\n    let r = ''\n    for (let i = paths.length - 1; i >= 0; i--) {\n      const p = paths[i]\n      if (!p || p === '.') continue\n      r = r ? `${p}/${r}` : p\n      if (this.isAbsolute(p)) {\n        break\n      }\n    }\n    const cached = this.#resolveCache.get(r)\n    if (cached !== undefined) {\n      return cached\n    }\n    const result = this.cwd.resolve(r).fullpath()\n    this.#resolveCache.set(r, result)\n    return result\n  }\n\n  /**\n   * Resolve one or more path strings to a resolved string, returning\n   * the posix path.  Identical to .resolve() on posix systems, but on\n   * windows will return a forward-slash separated UNC path.\n   *\n   * Same interface as require('path').resolve.\n   *\n   * Much faster than path.resolve() when called multiple times for the same\n   * path, because the resolved Path objects are cached.  Much slower\n   * otherwise.\n   */\n  resolvePosix(...paths: string[]): string {\n    // first figure out the minimum number of paths we have to test\n    // we always start at cwd, but any absolutes will bump the start\n    let r = ''\n    for (let i = paths.length - 1; i >= 0; i--) {\n      const p = paths[i]\n      if (!p || p === '.') continue\n      r = r ? `${p}/${r}` : p\n      if (this.isAbsolute(p)) {\n        break\n      }\n    }\n    const cached = this.#resolvePosixCache.get(r)\n    if (cached !== undefined) {\n      return cached\n    }\n    const result = this.cwd.resolve(r).fullpathPosix()\n    this.#resolvePosixCache.set(r, result)\n    return result\n  }\n\n  /**\n   * find the relative path from the cwd to the supplied path string or entry\n   */\n  relative(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.relative()\n  }\n\n  /**\n   * find the relative path from the cwd to the supplied path string or\n   * entry, using / as the path delimiter, even on Windows.\n   */\n  relativePosix(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.relativePosix()\n  }\n\n  /**\n   * Return the basename for the provided string or Path object\n   */\n  basename(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.name\n  }\n\n  /**\n   * Return the dirname for the provided string or Path object\n   */\n  dirname(entry: PathBase | string = this.cwd): string {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return (entry.parent || entry).fullpath()\n  }\n\n  /**\n   * Return an array of known child entries.\n   *\n   * First argument may be either a string, or a Path object.\n   *\n   * If the Path cannot or does not contain any children, then an empty array\n   * is returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   *\n   * Unlike `fs.readdir()`, the `withFileTypes` option defaults to `true`. Set\n   * `{ withFileTypes: false }` to return strings.\n   */\n\n  readdir(): Promise<PathBase[]>\n  readdir(opts: { withFileTypes: true }): Promise<PathBase[]>\n  readdir(opts: { withFileTypes: false }): Promise<string[]>\n  readdir(opts: { withFileTypes: boolean }): Promise<PathBase[] | string[]>\n  readdir(entry: PathBase | string): Promise<PathBase[]>\n  readdir(\n    entry: PathBase | string,\n    opts: { withFileTypes: true },\n  ): Promise<PathBase[]>\n  readdir(\n    entry: PathBase | string,\n    opts: { withFileTypes: false },\n  ): Promise<string[]>\n  readdir(\n    entry: PathBase | string,\n    opts: { withFileTypes: boolean },\n  ): Promise<PathBase[] | string[]>\n  async readdir(\n    entry: PathBase | string | { withFileTypes: boolean } = this.cwd,\n    opts: { withFileTypes: boolean } = {\n      withFileTypes: true,\n    },\n  ): Promise<PathBase[] | string[]> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const { withFileTypes } = opts\n    if (!entry.canReaddir()) {\n      return []\n    } else {\n      const p = await entry.readdir()\n      return withFileTypes ? p : p.map(e => e.name)\n    }\n  }\n\n  /**\n   * synchronous {@link PathScurryBase.readdir}\n   */\n  readdirSync(): PathBase[]\n  readdirSync(opts: { withFileTypes: true }): PathBase[]\n  readdirSync(opts: { withFileTypes: false }): string[]\n  readdirSync(opts: { withFileTypes: boolean }): PathBase[] | string[]\n  readdirSync(entry: PathBase | string): PathBase[]\n  readdirSync(\n    entry: PathBase | string,\n    opts: { withFileTypes: true },\n  ): PathBase[]\n  readdirSync(\n    entry: PathBase | string,\n    opts: { withFileTypes: false },\n  ): string[]\n  readdirSync(\n    entry: PathBase | string,\n    opts: { withFileTypes: boolean },\n  ): PathBase[] | string[]\n  readdirSync(\n    entry: PathBase | string | { withFileTypes: boolean } = this.cwd,\n    opts: { withFileTypes: boolean } = {\n      withFileTypes: true,\n    },\n  ): PathBase[] | string[] {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const { withFileTypes = true } = opts\n    if (!entry.canReaddir()) {\n      return []\n    } else if (withFileTypes) {\n      return entry.readdirSync()\n    } else {\n      return entry.readdirSync().map(e => e.name)\n    }\n  }\n\n  /**\n   * Call lstat() on the string or Path object, and update all known\n   * information that can be determined.\n   *\n   * Note that unlike `fs.lstat()`, the returned value does not contain some\n   * information, such as `mode`, `dev`, `nlink`, and `ino`.  If that\n   * information is required, you will need to call `fs.lstat` yourself.\n   *\n   * If the Path refers to a nonexistent file, or if the lstat call fails for\n   * any reason, `undefined` is returned.  Otherwise the updated Path object is\n   * returned.\n   *\n   * Results are cached, and thus may be out of date if the filesystem is\n   * mutated.\n   */\n  async lstat(\n    entry: string | PathBase = this.cwd,\n  ): Promise<PathBase | undefined> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.lstat()\n  }\n\n  /**\n   * synchronous {@link PathScurryBase.lstat}\n   */\n  lstatSync(entry: string | PathBase = this.cwd): PathBase | undefined {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    }\n    return entry.lstatSync()\n  }\n\n  /**\n   * Return the Path object or string path corresponding to the target of a\n   * symbolic link.\n   *\n   * If the path is not a symbolic link, or if the readlink call fails for any\n   * reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   *\n   * `{withFileTypes}` option defaults to `false`.\n   *\n   * On success, returns a Path object if `withFileTypes` option is true,\n   * otherwise a string.\n   */\n  readlink(): Promise<string | undefined>\n  readlink(opt: { withFileTypes: false }): Promise<string | undefined>\n  readlink(opt: { withFileTypes: true }): Promise<PathBase | undefined>\n  readlink(opt: {\n    withFileTypes: boolean\n  }): Promise<PathBase | string | undefined>\n  readlink(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): Promise<string | undefined>\n  readlink(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): Promise<PathBase | undefined>\n  readlink(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): Promise<string | PathBase | undefined>\n  async readlink(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): Promise<string | PathBase | undefined> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = await entry.readlink()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  /**\n   * synchronous {@link PathScurryBase.readlink}\n   */\n  readlinkSync(): string | undefined\n  readlinkSync(opt: { withFileTypes: false }): string | undefined\n  readlinkSync(opt: { withFileTypes: true }): PathBase | undefined\n  readlinkSync(opt: {\n    withFileTypes: boolean\n  }): PathBase | string | undefined\n  readlinkSync(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): string | undefined\n  readlinkSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): PathBase | undefined\n  readlinkSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): string | PathBase | undefined\n  readlinkSync(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): string | PathBase | undefined {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = entry.readlinkSync()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  /**\n   * Return the Path object or string path corresponding to path as resolved\n   * by realpath(3).\n   *\n   * If the realpath call fails for any reason, `undefined` is returned.\n   *\n   * Result is cached, and thus may be outdated if the filesystem is mutated.\n   *\n   * `{withFileTypes}` option defaults to `false`.\n   *\n   * On success, returns a Path object if `withFileTypes` option is true,\n   * otherwise a string.\n   */\n  realpath(): Promise<string | undefined>\n  realpath(opt: { withFileTypes: false }): Promise<string | undefined>\n  realpath(opt: { withFileTypes: true }): Promise<PathBase | undefined>\n  realpath(opt: {\n    withFileTypes: boolean\n  }): Promise<PathBase | string | undefined>\n  realpath(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): Promise<string | undefined>\n  realpath(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): Promise<PathBase | undefined>\n  realpath(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): Promise<string | PathBase | undefined>\n  async realpath(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): Promise<string | PathBase | undefined> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = await entry.realpath()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  realpathSync(): string | undefined\n  realpathSync(opt: { withFileTypes: false }): string | undefined\n  realpathSync(opt: { withFileTypes: true }): PathBase | undefined\n  realpathSync(opt: {\n    withFileTypes: boolean\n  }): PathBase | string | undefined\n  realpathSync(\n    entry: string | PathBase,\n    opt?: { withFileTypes: false },\n  ): string | undefined\n  realpathSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: true },\n  ): PathBase | undefined\n  realpathSync(\n    entry: string | PathBase,\n    opt: { withFileTypes: boolean },\n  ): string | PathBase | undefined\n  realpathSync(\n    entry: string | PathBase | { withFileTypes: boolean } = this.cwd,\n    { withFileTypes }: { withFileTypes: boolean } = {\n      withFileTypes: false,\n    },\n  ): string | PathBase | undefined {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      withFileTypes = entry.withFileTypes\n      entry = this.cwd\n    }\n    const e = entry.realpathSync()\n    return withFileTypes ? e : e?.fullpath()\n  }\n\n  /**\n   * Asynchronously walk the directory tree, returning an array of\n   * all path strings or Path objects found.\n   *\n   * Note that this will be extremely memory-hungry on large filesystems.\n   * In such cases, it may be better to use the stream or async iterator\n   * walk implementation.\n   */\n  walk(): Promise<PathBase[]>\n  walk(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Promise<PathBase[]>\n  walk(opts: WalkOptionsWithFileTypesFalse): Promise<string[]>\n  walk(opts: WalkOptions): Promise<string[] | PathBase[]>\n  walk(entry: string | PathBase): Promise<PathBase[]>\n  walk(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Promise<PathBase[]>\n  walk(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Promise<string[]>\n  walk(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Promise<PathBase[] | string[]>\n  async walk(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Promise<PathBase[] | string[]> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results: (string | PathBase)[] = []\n    if (!filter || filter(entry)) {\n      results.push(withFileTypes ? entry : entry.fullpath())\n    }\n    const dirs = new Set<PathBase>()\n    const walk = (\n      dir: PathBase,\n      cb: (er?: NodeJS.ErrnoException) => void,\n    ) => {\n      dirs.add(dir)\n      dir.readdirCB((er, entries) => {\n        /* c8 ignore start */\n        if (er) {\n          return cb(er)\n        }\n        /* c8 ignore stop */\n        let len = entries.length\n        if (!len) return cb()\n        const next = () => {\n          if (--len === 0) {\n            cb()\n          }\n        }\n        for (const e of entries) {\n          if (!filter || filter(e)) {\n            results.push(withFileTypes ? e : e.fullpath())\n          }\n          if (follow && e.isSymbolicLink()) {\n            e.realpath()\n              .then(r => (r?.isUnknown() ? r.lstat() : r))\n              .then(r =>\n                r?.shouldWalk(dirs, walkFilter) ? walk(r, next) : next(),\n              )\n          } else {\n            if (e.shouldWalk(dirs, walkFilter)) {\n              walk(e, next)\n            } else {\n              next()\n            }\n          }\n        }\n      }, true) // zalgooooooo\n    }\n\n    const start = entry\n    return new Promise<PathBase[] | string[]>((res, rej) => {\n      walk(start, er => {\n        /* c8 ignore start */\n        if (er) return rej(er)\n        /* c8 ignore stop */\n        res(results as PathBase[] | string[])\n      })\n    })\n  }\n\n  /**\n   * Synchronously walk the directory tree, returning an array of\n   * all path strings or Path objects found.\n   *\n   * Note that this will be extremely memory-hungry on large filesystems.\n   * In such cases, it may be better to use the stream or async iterator\n   * walk implementation.\n   */\n  walkSync(): PathBase[]\n  walkSync(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): PathBase[]\n  walkSync(opts: WalkOptionsWithFileTypesFalse): string[]\n  walkSync(opts: WalkOptions): string[] | PathBase[]\n  walkSync(entry: string | PathBase): PathBase[]\n  walkSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesUnset | WalkOptionsWithFileTypesTrue,\n  ): PathBase[]\n  walkSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): string[]\n  walkSync(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): PathBase[] | string[]\n  walkSync(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): PathBase[] | string[] {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results: (string | PathBase)[] = []\n    if (!filter || filter(entry)) {\n      results.push(withFileTypes ? entry : entry.fullpath())\n    }\n    const dirs = new Set<PathBase>([entry])\n    for (const dir of dirs) {\n      const entries = dir.readdirSync()\n      for (const e of entries) {\n        if (!filter || filter(e)) {\n          results.push(withFileTypes ? e : e.fullpath())\n        }\n        let r: PathBase | undefined = e\n        if (e.isSymbolicLink()) {\n          if (!(follow && (r = e.realpathSync()))) continue\n          if (r.isUnknown()) r.lstatSync()\n        }\n        if (r.shouldWalk(dirs, walkFilter)) {\n          dirs.add(r)\n        }\n      }\n    }\n    return results as string[] | PathBase[]\n  }\n\n  /**\n   * Support for `for await`\n   *\n   * Alias for {@link PathScurryBase.iterate}\n   *\n   * Note: As of Node 19, this is very slow, compared to other methods of\n   * walking.  Consider using {@link PathScurryBase.stream} if memory overhead\n   * and backpressure are concerns, or {@link PathScurryBase.walk} if not.\n   */\n  [Symbol.asyncIterator]() {\n    return this.iterate()\n  }\n\n  /**\n   * Async generator form of {@link PathScurryBase.walk}\n   *\n   * Note: As of Node 19, this is very slow, compared to other methods of\n   * walking, especially if most/all of the directory tree has been previously\n   * walked.  Consider using {@link PathScurryBase.stream} if memory overhead\n   * and backpressure are concerns, or {@link PathScurryBase.walk} if not.\n   */\n  iterate(): AsyncGenerator<PathBase, void, void>\n  iterate(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): AsyncGenerator<PathBase, void, void>\n  iterate(\n    opts: WalkOptionsWithFileTypesFalse,\n  ): AsyncGenerator<string, void, void>\n  iterate(opts: WalkOptions): AsyncGenerator<string | PathBase, void, void>\n  iterate(entry: string | PathBase): AsyncGenerator<PathBase, void, void>\n  iterate(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): AsyncGenerator<PathBase, void, void>\n  iterate(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): AsyncGenerator<string, void, void>\n  iterate(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): AsyncGenerator<PathBase | string, void, void>\n  iterate(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    options: WalkOptions = {},\n  ): AsyncGenerator<PathBase | string, void, void> {\n    // iterating async over the stream is significantly more performant,\n    // especially in the warm-cache scenario, because it buffers up directory\n    // entries in the background instead of waiting for a yield for each one.\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      options = entry\n      entry = this.cwd\n    }\n    return this.stream(entry, options)[Symbol.asyncIterator]()\n  }\n\n  /**\n   * Iterating over a PathScurry performs a synchronous walk.\n   *\n   * Alias for {@link PathScurryBase.iterateSync}\n   */\n  [Symbol.iterator]() {\n    return this.iterateSync()\n  }\n\n  iterateSync(): Generator<PathBase, void, void>\n  iterateSync(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Generator<PathBase, void, void>\n  iterateSync(\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Generator<string, void, void>\n  iterateSync(opts: WalkOptions): Generator<string | PathBase, void, void>\n  iterateSync(entry: string | PathBase): Generator<PathBase, void, void>\n  iterateSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Generator<PathBase, void, void>\n  iterateSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Generator<string, void, void>\n  iterateSync(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Generator<PathBase | string, void, void>\n  *iterateSync(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Generator<PathBase | string, void, void> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    if (!filter || filter(entry)) {\n      yield withFileTypes ? entry : entry.fullpath()\n    }\n    const dirs = new Set<PathBase>([entry])\n    for (const dir of dirs) {\n      const entries = dir.readdirSync()\n      for (const e of entries) {\n        if (!filter || filter(e)) {\n          yield withFileTypes ? e : e.fullpath()\n        }\n        let r: PathBase | undefined = e\n        if (e.isSymbolicLink()) {\n          if (!(follow && (r = e.realpathSync()))) continue\n          if (r.isUnknown()) r.lstatSync()\n        }\n        if (r.shouldWalk(dirs, walkFilter)) {\n          dirs.add(r)\n        }\n      }\n    }\n  }\n\n  /**\n   * Stream form of {@link PathScurryBase.walk}\n   *\n   * Returns a Minipass stream that emits {@link PathBase} objects by default,\n   * or strings if `{ withFileTypes: false }` is set in the options.\n   */\n  stream(): Minipass<PathBase>\n  stream(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Minipass<PathBase>\n  stream(opts: WalkOptionsWithFileTypesFalse): Minipass<string>\n  stream(opts: WalkOptions): Minipass<string | PathBase>\n  stream(entry: string | PathBase): Minipass<PathBase>\n  stream(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesUnset | WalkOptionsWithFileTypesTrue,\n  ): Minipass<PathBase>\n  stream(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Minipass<string>\n  stream(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Minipass<string> | Minipass<PathBase>\n  stream(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Minipass<string> | Minipass<PathBase> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results = new Minipass<string | PathBase>({ objectMode: true })\n    if (!filter || filter(entry)) {\n      results.write(withFileTypes ? entry : entry.fullpath())\n    }\n    const dirs = new Set<PathBase>()\n    const queue: PathBase[] = [entry]\n    let processing = 0\n    const process = () => {\n      let paused = false\n      while (!paused) {\n        const dir = queue.shift()\n        if (!dir) {\n          if (processing === 0) results.end()\n          return\n        }\n\n        processing++\n        dirs.add(dir)\n\n        const onReaddir = (\n          er: null | NodeJS.ErrnoException,\n          entries: PathBase[],\n          didRealpaths: boolean = false,\n        ) => {\n          /* c8 ignore start */\n          if (er) return results.emit('error', er)\n          /* c8 ignore stop */\n          if (follow && !didRealpaths) {\n            const promises: Promise<PathBase | undefined>[] = []\n            for (const e of entries) {\n              if (e.isSymbolicLink()) {\n                promises.push(\n                  e\n                    .realpath()\n                    .then((r: PathBase | undefined) =>\n                      r?.isUnknown() ? r.lstat() : r,\n                    ),\n                )\n              }\n            }\n            if (promises.length) {\n              Promise.all(promises).then(() =>\n                onReaddir(null, entries, true),\n              )\n              return\n            }\n          }\n\n          for (const e of entries) {\n            if (e && (!filter || filter(e))) {\n              if (!results.write(withFileTypes ? e : e.fullpath())) {\n                paused = true\n              }\n            }\n          }\n\n          processing--\n          for (const e of entries) {\n            const r = e.realpathCached() || e\n            if (r.shouldWalk(dirs, walkFilter)) {\n              queue.push(r)\n            }\n          }\n          if (paused && !results.flowing) {\n            results.once('drain', process)\n          } else if (!sync) {\n            process()\n          }\n        }\n\n        // zalgo containment\n        let sync = true\n        dir.readdirCB(onReaddir, true)\n        sync = false\n      }\n    }\n    process()\n    return results as Minipass<string> | Minipass<PathBase>\n  }\n\n  /**\n   * Synchronous form of {@link PathScurryBase.stream}\n   *\n   * Returns a Minipass stream that emits {@link PathBase} objects by default,\n   * or strings if `{ withFileTypes: false }` is set in the options.\n   *\n   * Will complete the walk in a single tick if the stream is consumed fully.\n   * Otherwise, will pause as needed for stream backpressure.\n   */\n  streamSync(): Minipass<PathBase>\n  streamSync(\n    opts: WalkOptionsWithFileTypesTrue | WalkOptionsWithFileTypesUnset,\n  ): Minipass<PathBase>\n  streamSync(opts: WalkOptionsWithFileTypesFalse): Minipass<string>\n  streamSync(opts: WalkOptions): Minipass<string | PathBase>\n  streamSync(entry: string | PathBase): Minipass<PathBase>\n  streamSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesUnset | WalkOptionsWithFileTypesTrue,\n  ): Minipass<PathBase>\n  streamSync(\n    entry: string | PathBase,\n    opts: WalkOptionsWithFileTypesFalse,\n  ): Minipass<string>\n  streamSync(\n    entry: string | PathBase,\n    opts: WalkOptions,\n  ): Minipass<string> | Minipass<PathBase>\n  streamSync(\n    entry: string | PathBase | WalkOptions = this.cwd,\n    opts: WalkOptions = {},\n  ): Minipass<string> | Minipass<PathBase> {\n    if (typeof entry === 'string') {\n      entry = this.cwd.resolve(entry)\n    } else if (!(entry instanceof PathBase)) {\n      opts = entry\n      entry = this.cwd\n    }\n    const {\n      withFileTypes = true,\n      follow = false,\n      filter,\n      walkFilter,\n    } = opts\n    const results = new Minipass<string | PathBase>({ objectMode: true })\n    const dirs = new Set<PathBase>()\n    if (!filter || filter(entry)) {\n      results.write(withFileTypes ? entry : entry.fullpath())\n    }\n    const queue: PathBase[] = [entry]\n    let processing = 0\n    const process = () => {\n      let paused = false\n      while (!paused) {\n        const dir = queue.shift()\n        if (!dir) {\n          if (processing === 0) results.end()\n          return\n        }\n        processing++\n        dirs.add(dir)\n\n        const entries = dir.readdirSync()\n        for (const e of entries) {\n          if (!filter || filter(e)) {\n            if (!results.write(withFileTypes ? e : e.fullpath())) {\n              paused = true\n            }\n          }\n        }\n        processing--\n        for (const e of entries) {\n          let r: PathBase | undefined = e\n          if (e.isSymbolicLink()) {\n            if (!(follow && (r = e.realpathSync()))) continue\n            if (r.isUnknown()) r.lstatSync()\n          }\n          if (r.shouldWalk(dirs, walkFilter)) {\n            queue.push(r)\n          }\n        }\n      }\n      if (paused && !results.flowing) results.once('drain', process)\n    }\n    process()\n    return results as Minipass<string> | Minipass<PathBase>\n  }\n\n  chdir(path: string | Path = this.cwd) {\n    const oldCwd = this.cwd\n    this.cwd = typeof path === 'string' ? this.cwd.resolve(path) : path\n    this.cwd[setAsCwd](oldCwd)\n  }\n}\n\n/**\n * Options provided to all walk methods.\n */\nexport interface WalkOptions {\n  /**\n   * Return results as {@link PathBase} objects rather than strings.\n   * When set to false, results are fully resolved paths, as returned by\n   * {@link PathBase.fullpath}.\n   * @default true\n   */\n  withFileTypes?: boolean\n\n  /**\n   *  Attempt to read directory entries from symbolic links. Otherwise, only\n   *  actual directories are traversed. Regardless of this setting, a given\n   *  target path will only ever be walked once, meaning that a symbolic link\n   *  to a previously traversed directory will never be followed.\n   *\n   *  Setting this imposes a slight performance penalty, because `readlink`\n   *  must be called on all symbolic links encountered, in order to avoid\n   *  infinite cycles.\n   * @default false\n   */\n  follow?: boolean\n\n  /**\n   * Only return entries where the provided function returns true.\n   *\n   * This will not prevent directories from being traversed, even if they do\n   * not pass the filter, though it will prevent directories themselves from\n   * being included in the result set.  See {@link walkFilter}\n   *\n   * Asynchronous functions are not supported here.\n   *\n   * By default, if no filter is provided, all entries and traversed\n   * directories are included.\n   */\n  filter?: (entry: PathBase) => boolean\n\n  /**\n   * Only traverse directories (and in the case of {@link follow} being set to\n   * true, symbolic links to directories) if the provided function returns\n   * true.\n   *\n   * This will not prevent directories from being included in the result set,\n   * even if they do not pass the supplied filter function.  See {@link filter}\n   * to do that.\n   *\n   * Asynchronous functions are not supported here.\n   */\n  walkFilter?: (entry: PathBase) => boolean\n}\n\nexport type WalkOptionsWithFileTypesUnset = WalkOptions & {\n  withFileTypes?: undefined\n}\nexport type WalkOptionsWithFileTypesTrue = WalkOptions & {\n  withFileTypes: true\n}\nexport type WalkOptionsWithFileTypesFalse = WalkOptions & {\n  withFileTypes: false\n}\n\n/**\n * Windows implementation of {@link PathScurryBase}\n *\n * Defaults to case insensitve, uses `'\\\\'` to generate path strings.  Uses\n * {@link PathWin32} for Path objects.\n */\nexport class PathScurryWin32 extends PathScurryBase {\n  /**\n   * separator for generating path strings\n   */\n  sep: '\\\\' = '\\\\'\n\n  constructor(\n    cwd: URL | string = process.cwd(),\n    opts: PathScurryOpts = {},\n  ) {\n    const { nocase = true } = opts\n    super(cwd, win32, '\\\\', { ...opts, nocase })\n    this.nocase = nocase\n    for (let p: PathBase | undefined = this.cwd; p; p = p.parent) {\n      p.nocase = this.nocase\n    }\n  }\n\n  /**\n   * @internal\n   */\n  parseRootPath(dir: string): string {\n    // if the path starts with a single separator, it's not a UNC, and we'll\n    // just get separator as the root, and driveFromUNC will return \\\n    // In that case, mount \\ on the root from the cwd.\n    return win32.parse(dir).root.toUpperCase()\n  }\n\n  /**\n   * @internal\n   */\n  newRoot(fs: FSValue) {\n    return new PathWin32(\n      this.rootPath,\n      IFDIR,\n      undefined,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      { fs },\n    )\n  }\n\n  /**\n   * Return true if the provided path string is an absolute path\n   */\n  isAbsolute(p: string): boolean {\n    return (\n      p.startsWith('/') || p.startsWith('\\\\') || /^[a-z]:(\\/|\\\\)/i.test(p)\n    )\n  }\n}\n\n/**\n * {@link PathScurryBase} implementation for all posix systems other than Darwin.\n *\n * Defaults to case-sensitive matching, uses `'/'` to generate path strings.\n *\n * Uses {@link PathPosix} for Path objects.\n */\nexport class PathScurryPosix extends PathScurryBase {\n  /**\n   * separator for generating path strings\n   */\n  sep: '/' = '/'\n  constructor(\n    cwd: URL | string = process.cwd(),\n    opts: PathScurryOpts = {},\n  ) {\n    const { nocase = false } = opts\n    super(cwd, posix, '/', { ...opts, nocase })\n    this.nocase = nocase\n  }\n\n  /**\n   * @internal\n   */\n  parseRootPath(_dir: string): string {\n    return '/'\n  }\n\n  /**\n   * @internal\n   */\n  newRoot(fs: FSValue) {\n    return new PathPosix(\n      this.rootPath,\n      IFDIR,\n      undefined,\n      this.roots,\n      this.nocase,\n      this.childrenCache(),\n      { fs },\n    )\n  }\n\n  /**\n   * Return true if the provided path string is an absolute path\n   */\n  isAbsolute(p: string): boolean {\n    return p.startsWith('/')\n  }\n}\n\n/**\n * {@link PathScurryBase} implementation for Darwin (macOS) systems.\n *\n * Defaults to case-insensitive matching, uses `'/'` for generating path\n * strings.\n *\n * Uses {@link PathPosix} for Path objects.\n */\nexport class PathScurryDarwin extends PathScurryPosix {\n  constructor(\n    cwd: URL | string = process.cwd(),\n    opts: PathScurryOpts = {},\n  ) {\n    const { nocase = true } = opts\n    super(cwd, { ...opts, nocase })\n  }\n}\n\n/**\n * Default {@link PathBase} implementation for the current platform.\n *\n * {@link PathWin32} on Windows systems, {@link PathPosix} on all others.\n */\nexport const Path = process.platform === 'win32' ? PathWin32 : PathPosix\nexport type Path = PathBase | InstanceType<typeof Path>\n\n/**\n * Default {@link PathScurryBase} implementation for the current platform.\n *\n * {@link PathScurryWin32} on Windows systems, {@link PathScurryDarwin} on\n * Darwin (macOS) systems, {@link PathScurryPosix} on all others.\n */\nexport const PathScurry:\n  | typeof PathScurryWin32\n  | typeof PathScurryDarwin\n  | typeof PathScurryPosix =\n  process.platform === 'win32' ? PathScurryWin32\n  : process.platform === 'darwin' ? PathScurryDarwin\n  : PathScurryPosix\nexport type PathScurry = PathScurryBase | InstanceType<typeof PathScurry>\n", "const proc =\n  typeof process === 'object' && process\n    ? process\n    : {\n        stdout: null,\n        stderr: null,\n      }\nimport { EventEmitter } from 'node:events'\nimport Stream from 'node:stream'\nimport { StringDecoder } from 'node:string_decoder'\n\n/**\n * Same as StringDecoder, but exposing the `lastNeed` flag on the type\n */\ntype SD = StringDecoder & { lastNeed: boolean }\n\nexport type { SD, Pipe, PipeProxyErrors }\n\n/**\n * Return true if the argument is a Minipass stream, Node stream, or something\n * else that Minipass can interact with.\n */\nexport const isStream = (\n  s: any\n): s is Minipass.Readable | Minipass.Writable =>\n  !!s &&\n  typeof s === 'object' &&\n  (s instanceof Minipass ||\n    s instanceof Stream ||\n    isReadable(s) ||\n    isWritable(s))\n\n/**\n * Return true if the argument is a valid {@link Minipass.Readable}\n */\nexport const isReadable = (s: any): s is Minipass.Readable =>\n  !!s &&\n  typeof s === 'object' &&\n  s instanceof EventEmitter &&\n  typeof (s as Minipass.Readable).pipe === 'function' &&\n  // node core Writable streams have a pipe() method, but it throws\n  (s as Minipass.Readable).pipe !== Stream.Writable.prototype.pipe\n\n/**\n * Return true if the argument is a valid {@link Minipass.Writable}\n */\nexport const isWritable = (s: any): s is Minipass.Readable =>\n  !!s &&\n  typeof s === 'object' &&\n  s instanceof EventEmitter &&\n  typeof (s as Minipass.Writable).write === 'function' &&\n  typeof (s as Minipass.Writable).end === 'function'\n\nconst EOF = Symbol('EOF')\nconst MAYBE_EMIT_END = Symbol('maybeEmitEnd')\nconst EMITTED_END = Symbol('emittedEnd')\nconst EMITTING_END = Symbol('emittingEnd')\nconst EMITTED_ERROR = Symbol('emittedError')\nconst CLOSED = Symbol('closed')\nconst READ = Symbol('read')\nconst FLUSH = Symbol('flush')\nconst FLUSHCHUNK = Symbol('flushChunk')\nconst ENCODING = Symbol('encoding')\nconst DECODER = Symbol('decoder')\nconst FLOWING = Symbol('flowing')\nconst PAUSED = Symbol('paused')\nconst RESUME = Symbol('resume')\nconst BUFFER = Symbol('buffer')\nconst PIPES = Symbol('pipes')\nconst BUFFERLENGTH = Symbol('bufferLength')\nconst BUFFERPUSH = Symbol('bufferPush')\nconst BUFFERSHIFT = Symbol('bufferShift')\nconst OBJECTMODE = Symbol('objectMode')\n// internal event when stream is destroyed\nconst DESTROYED = Symbol('destroyed')\n// internal event when stream has an error\nconst ERROR = Symbol('error')\nconst EMITDATA = Symbol('emitData')\nconst EMITEND = Symbol('emitEnd')\nconst EMITEND2 = Symbol('emitEnd2')\nconst ASYNC = Symbol('async')\nconst ABORT = Symbol('abort')\nconst ABORTED = Symbol('aborted')\nconst SIGNAL = Symbol('signal')\nconst DATALISTENERS = Symbol('dataListeners')\nconst DISCARDED = Symbol('discarded')\n\nconst defer = (fn: (...a: any[]) => any) => Promise.resolve().then(fn)\nconst nodefer = (fn: (...a: any[]) => any) => fn()\n\n// events that mean 'the stream is over'\n// these are treated specially, and re-emitted\n// if they are listened for after emitting.\ntype EndishEvent = 'end' | 'finish' | 'prefinish'\nconst isEndish = (ev: any): ev is EndishEvent =>\n  ev === 'end' || ev === 'finish' || ev === 'prefinish'\n\nconst isArrayBufferLike = (b: any): b is ArrayBufferLike =>\n  b instanceof ArrayBuffer ||\n  (!!b &&\n    typeof b === 'object' &&\n    b.constructor &&\n    b.constructor.name === 'ArrayBuffer' &&\n    b.byteLength >= 0)\n\nconst isArrayBufferView = (b: any): b is ArrayBufferView =>\n  !Buffer.isBuffer(b) && ArrayBuffer.isView(b)\n\n/**\n * Options that may be passed to stream.pipe()\n */\nexport interface PipeOptions {\n  /**\n   * end the destination stream when the source stream ends\n   */\n  end?: boolean\n  /**\n   * proxy errors from the source stream to the destination stream\n   */\n  proxyErrors?: boolean\n}\n\n/**\n * Internal class representing a pipe to a destination stream.\n *\n * @internal\n */\nclass Pipe<T extends unknown> {\n  src: Minipass<T>\n  dest: Minipass<any, T>\n  opts: PipeOptions\n  ondrain: () => any\n  constructor(\n    src: Minipass<T>,\n    dest: Minipass.Writable,\n    opts: PipeOptions\n  ) {\n    this.src = src\n    this.dest = dest as Minipass<any, T>\n    this.opts = opts\n    this.ondrain = () => src[RESUME]()\n    this.dest.on('drain', this.ondrain)\n  }\n  unpipe() {\n    this.dest.removeListener('drain', this.ondrain)\n  }\n  // only here for the prototype\n  /* c8 ignore start */\n  proxyErrors(_er: any) {}\n  /* c8 ignore stop */\n  end() {\n    this.unpipe()\n    if (this.opts.end) this.dest.end()\n  }\n}\n\n/**\n * Internal class representing a pipe to a destination stream where\n * errors are proxied.\n *\n * @internal\n */\nclass PipeProxyErrors<T> extends Pipe<T> {\n  unpipe() {\n    this.src.removeListener('error', this.proxyErrors)\n    super.unpipe()\n  }\n  constructor(\n    src: Minipass<T>,\n    dest: Minipass.Writable,\n    opts: PipeOptions\n  ) {\n    super(src, dest, opts)\n    this.proxyErrors = er => dest.emit('error', er)\n    src.on('error', this.proxyErrors)\n  }\n}\n\nexport namespace Minipass {\n  /**\n   * Encoding used to create a stream that outputs strings rather than\n   * Buffer objects.\n   */\n  export type Encoding = BufferEncoding | 'buffer' | null\n\n  /**\n   * Any stream that Minipass can pipe into\n   */\n  export type Writable =\n    | Minipass<any, any, any>\n    | NodeJS.WriteStream\n    | (NodeJS.WriteStream & { fd: number })\n    | (EventEmitter & {\n        end(): any\n        write(chunk: any, ...args: any[]): any\n      })\n\n  /**\n   * Any stream that can be read from\n   */\n  export type Readable =\n    | Minipass<any, any, any>\n    | NodeJS.ReadStream\n    | (NodeJS.ReadStream & { fd: number })\n    | (EventEmitter & {\n        pause(): any\n        resume(): any\n        pipe(...destArgs: any[]): any\n      })\n\n  /**\n   * Utility type that can be iterated sync or async\n   */\n  export type DualIterable<T> = Iterable<T> & AsyncIterable<T>\n\n  type EventArguments = Record<string | symbol, unknown[]>\n\n  /**\n   * The listing of events that a Minipass class can emit.\n   * Extend this when extending the Minipass class, and pass as\n   * the third template argument.  The key is the name of the event,\n   * and the value is the argument list.\n   *\n   * Any undeclared events will still be allowed, but the handler will get\n   * arguments as `unknown[]`.\n   */\n  export interface Events<RType extends any = Buffer>\n    extends EventArguments {\n    readable: []\n    data: [chunk: RType]\n    error: [er: unknown]\n    abort: [reason: unknown]\n    drain: []\n    resume: []\n    end: []\n    finish: []\n    prefinish: []\n    close: []\n    [DESTROYED]: [er?: unknown]\n    [ERROR]: [er: unknown]\n  }\n\n  /**\n   * String or buffer-like data that can be joined and sliced\n   */\n  export type ContiguousData =\n    | Buffer\n    | ArrayBufferLike\n    | ArrayBufferView\n    | string\n  export type BufferOrString = Buffer | string\n\n  /**\n   * Options passed to the Minipass constructor.\n   */\n  export type SharedOptions = {\n    /**\n     * Defer all data emission and other events until the end of the\n     * current tick, similar to Node core streams\n     */\n    async?: boolean\n    /**\n     * A signal which will abort the stream\n     */\n    signal?: AbortSignal\n    /**\n     * Output string encoding. Set to `null` or `'buffer'` (or omit) to\n     * emit Buffer objects rather than strings.\n     *\n     * Conflicts with `objectMode`\n     */\n    encoding?: BufferEncoding | null | 'buffer'\n    /**\n     * Output data exactly as it was written, supporting non-buffer/string\n     * data (such as arbitrary objects, falsey values, etc.)\n     *\n     * Conflicts with `encoding`\n     */\n    objectMode?: boolean\n  }\n\n  /**\n   * Options for a string encoded output\n   */\n  export type EncodingOptions = SharedOptions & {\n    encoding: BufferEncoding\n    objectMode?: false\n  }\n\n  /**\n   * Options for contiguous data buffer output\n   */\n  export type BufferOptions = SharedOptions & {\n    encoding?: null | 'buffer'\n    objectMode?: false\n  }\n\n  /**\n   * Options for objectMode arbitrary output\n   */\n  export type ObjectModeOptions = SharedOptions & {\n    objectMode: true\n    encoding?: null\n  }\n\n  /**\n   * Utility type to determine allowed options based on read type\n   */\n  export type Options<T> =\n    | ObjectModeOptions\n    | (T extends string\n        ? EncodingOptions\n        : T extends Buffer\n        ? BufferOptions\n        : SharedOptions)\n}\n\nconst isObjectModeOptions = (\n  o: Minipass.SharedOptions\n): o is Minipass.ObjectModeOptions => !!o.objectMode\n\nconst isEncodingOptions = (\n  o: Minipass.SharedOptions\n): o is Minipass.EncodingOptions =>\n  !o.objectMode && !!o.encoding && o.encoding !== 'buffer'\n\n/**\n * Main export, the Minipass class\n *\n * `RType` is the type of data emitted, defaults to Buffer\n *\n * `WType` is the type of data to be written, if RType is buffer or string,\n * then any {@link Minipass.ContiguousData} is allowed.\n *\n * `Events` is the set of event handler signatures that this object\n * will emit, see {@link Minipass.Events}\n */\nexport class Minipass<\n    RType extends unknown = Buffer,\n    WType extends unknown = RType extends Minipass.BufferOrString\n      ? Minipass.ContiguousData\n      : RType,\n    Events extends Minipass.Events<RType> = Minipass.Events<RType>\n  >\n  extends EventEmitter\n  implements Minipass.DualIterable<RType>\n{\n  [FLOWING]: boolean = false;\n  [PAUSED]: boolean = false;\n  [PIPES]: Pipe<RType>[] = [];\n  [BUFFER]: RType[] = [];\n  [OBJECTMODE]: boolean;\n  [ENCODING]: BufferEncoding | null;\n  [ASYNC]: boolean;\n  [DECODER]: SD | null;\n  [EOF]: boolean = false;\n  [EMITTED_END]: boolean = false;\n  [EMITTING_END]: boolean = false;\n  [CLOSED]: boolean = false;\n  [EMITTED_ERROR]: unknown = null;\n  [BUFFERLENGTH]: number = 0;\n  [DESTROYED]: boolean = false;\n  [SIGNAL]?: AbortSignal;\n  [ABORTED]: boolean = false;\n  [DATALISTENERS]: number = 0;\n  [DISCARDED]: boolean = false\n\n  /**\n   * true if the stream can be written\n   */\n  writable: boolean = true\n  /**\n   * true if the stream can be read\n   */\n  readable: boolean = true\n\n  /**\n   * If `RType` is Buffer, then options do not need to be provided.\n   * Otherwise, an options object must be provided to specify either\n   * {@link Minipass.SharedOptions.objectMode} or\n   * {@link Minipass.SharedOptions.encoding}, as appropriate.\n   */\n  constructor(\n    ...args:\n      | [Minipass.ObjectModeOptions]\n      | (RType extends Buffer\n          ? [] | [Minipass.Options<RType>]\n          : [Minipass.Options<RType>])\n  ) {\n    const options: Minipass.Options<RType> = (args[0] ||\n      {}) as Minipass.Options<RType>\n    super()\n    if (options.objectMode && typeof options.encoding === 'string') {\n      throw new TypeError(\n        'Encoding and objectMode may not be used together'\n      )\n    }\n    if (isObjectModeOptions(options)) {\n      this[OBJECTMODE] = true\n      this[ENCODING] = null\n    } else if (isEncodingOptions(options)) {\n      this[ENCODING] = options.encoding\n      this[OBJECTMODE] = false\n    } else {\n      this[OBJECTMODE] = false\n      this[ENCODING] = null\n    }\n    this[ASYNC] = !!options.async\n    this[DECODER] = this[ENCODING]\n      ? (new StringDecoder(this[ENCODING]) as SD)\n      : null\n\n    //@ts-ignore - private option for debugging and testing\n    if (options && options.debugExposeBuffer === true) {\n      Object.defineProperty(this, 'buffer', { get: () => this[BUFFER] })\n    }\n    //@ts-ignore - private option for debugging and testing\n    if (options && options.debugExposePipes === true) {\n      Object.defineProperty(this, 'pipes', { get: () => this[PIPES] })\n    }\n\n    const { signal } = options\n    if (signal) {\n      this[SIGNAL] = signal\n      if (signal.aborted) {\n        this[ABORT]()\n      } else {\n        signal.addEventListener('abort', () => this[ABORT]())\n      }\n    }\n  }\n\n  /**\n   * The amount of data stored in the buffer waiting to be read.\n   *\n   * For Buffer strings, this will be the total byte length.\n   * For string encoding streams, this will be the string character length,\n   * according to JavaScript's `string.length` logic.\n   * For objectMode streams, this is a count of the items waiting to be\n   * emitted.\n   */\n  get bufferLength() {\n    return this[BUFFERLENGTH]\n  }\n\n  /**\n   * The `BufferEncoding` currently in use, or `null`\n   */\n  get encoding() {\n    return this[ENCODING]\n  }\n\n  /**\n   * @deprecated - This is a read only property\n   */\n  set encoding(_enc) {\n    throw new Error('Encoding must be set at instantiation time')\n  }\n\n  /**\n   * @deprecated - Encoding may only be set at instantiation time\n   */\n  setEncoding(_enc: Minipass.Encoding) {\n    throw new Error('Encoding must be set at instantiation time')\n  }\n\n  /**\n   * True if this is an objectMode stream\n   */\n  get objectMode() {\n    return this[OBJECTMODE]\n  }\n\n  /**\n   * @deprecated - This is a read-only property\n   */\n  set objectMode(_om) {\n    throw new Error('objectMode must be set at instantiation time')\n  }\n\n  /**\n   * true if this is an async stream\n   */\n  get ['async'](): boolean {\n    return this[ASYNC]\n  }\n  /**\n   * Set to true to make this stream async.\n   *\n   * Once set, it cannot be unset, as this would potentially cause incorrect\n   * behavior.  Ie, a sync stream can be made async, but an async stream\n   * cannot be safely made sync.\n   */\n  set ['async'](a: boolean) {\n    this[ASYNC] = this[ASYNC] || !!a\n  }\n\n  // drop everything and get out of the flow completely\n  [ABORT]() {\n    this[ABORTED] = true\n    this.emit('abort', this[SIGNAL]?.reason)\n    this.destroy(this[SIGNAL]?.reason)\n  }\n\n  /**\n   * True if the stream has been aborted.\n   */\n  get aborted() {\n    return this[ABORTED]\n  }\n  /**\n   * No-op setter. Stream aborted status is set via the AbortSignal provided\n   * in the constructor options.\n   */\n  set aborted(_) {}\n\n  /**\n   * Write data into the stream\n   *\n   * If the chunk written is a string, and encoding is not specified, then\n   * `utf8` will be assumed. If the stream encoding matches the encoding of\n   * a written string, and the state of the string decoder allows it, then\n   * the string will be passed through to either the output or the internal\n   * buffer without any processing. Otherwise, it will be turned into a\n   * Buffer object for processing into the desired encoding.\n   *\n   * If provided, `cb` function is called immediately before return for\n   * sync streams, or on next tick for async streams, because for this\n   * base class, a chunk is considered \"processed\" once it is accepted\n   * and either emitted or buffered. That is, the callback does not indicate\n   * that the chunk has been eventually emitted, though of course child\n   * classes can override this function to do whatever processing is required\n   * and call `super.write(...)` only once processing is completed.\n   */\n  write(chunk: WType, cb?: () => void): boolean\n  write(\n    chunk: WType,\n    encoding?: Minipass.Encoding,\n    cb?: () => void\n  ): boolean\n  write(\n    chunk: WType,\n    encoding?: Minipass.Encoding | (() => void),\n    cb?: () => void\n  ): boolean {\n    if (this[ABORTED]) return false\n    if (this[EOF]) throw new Error('write after end')\n\n    if (this[DESTROYED]) {\n      this.emit(\n        'error',\n        Object.assign(\n          new Error('Cannot call write after a stream was destroyed'),\n          { code: 'ERR_STREAM_DESTROYED' }\n        )\n      )\n      return true\n    }\n\n    if (typeof encoding === 'function') {\n      cb = encoding\n      encoding = 'utf8'\n    }\n\n    if (!encoding) encoding = 'utf8'\n\n    const fn = this[ASYNC] ? defer : nodefer\n\n    // convert array buffers and typed array views into buffers\n    // at some point in the future, we may want to do the opposite!\n    // leave strings and buffers as-is\n    // anything is only allowed if in object mode, so throw\n    if (!this[OBJECTMODE] && !Buffer.isBuffer(chunk)) {\n      if (isArrayBufferView(chunk)) {\n        //@ts-ignore - sinful unsafe type changing\n        chunk = Buffer.from(\n          chunk.buffer,\n          chunk.byteOffset,\n          chunk.byteLength\n        )\n      } else if (isArrayBufferLike(chunk)) {\n        //@ts-ignore - sinful unsafe type changing\n        chunk = Buffer.from(chunk)\n      } else if (typeof chunk !== 'string') {\n        throw new Error(\n          'Non-contiguous data written to non-objectMode stream'\n        )\n      }\n    }\n\n    // handle object mode up front, since it's simpler\n    // this yields better performance, fewer checks later.\n    if (this[OBJECTMODE]) {\n      // maybe impossible?\n      /* c8 ignore start */\n      if (this[FLOWING] && this[BUFFERLENGTH] !== 0) this[FLUSH](true)\n      /* c8 ignore stop */\n\n      if (this[FLOWING]) this.emit('data', chunk as unknown as RType)\n      else this[BUFFERPUSH](chunk as unknown as RType)\n\n      if (this[BUFFERLENGTH] !== 0) this.emit('readable')\n\n      if (cb) fn(cb)\n\n      return this[FLOWING]\n    }\n\n    // at this point the chunk is a buffer or string\n    // don't buffer it up or send it to the decoder\n    if (!(chunk as Minipass.BufferOrString).length) {\n      if (this[BUFFERLENGTH] !== 0) this.emit('readable')\n      if (cb) fn(cb)\n      return this[FLOWING]\n    }\n\n    // fast-path writing strings of same encoding to a stream with\n    // an empty buffer, skipping the buffer/decoder dance\n    if (\n      typeof chunk === 'string' &&\n      // unless it is a string already ready for us to use\n      !(encoding === this[ENCODING] && !this[DECODER]?.lastNeed)\n    ) {\n      //@ts-ignore - sinful unsafe type change\n      chunk = Buffer.from(chunk, encoding)\n    }\n\n    if (Buffer.isBuffer(chunk) && this[ENCODING]) {\n      //@ts-ignore - sinful unsafe type change\n      chunk = this[DECODER].write(chunk)\n    }\n\n    // Note: flushing CAN potentially switch us into not-flowing mode\n    if (this[FLOWING] && this[BUFFERLENGTH] !== 0) this[FLUSH](true)\n\n    if (this[FLOWING]) this.emit('data', chunk as unknown as RType)\n    else this[BUFFERPUSH](chunk as unknown as RType)\n\n    if (this[BUFFERLENGTH] !== 0) this.emit('readable')\n\n    if (cb) fn(cb)\n\n    return this[FLOWING]\n  }\n\n  /**\n   * Low-level explicit read method.\n   *\n   * In objectMode, the argument is ignored, and one item is returned if\n   * available.\n   *\n   * `n` is the number of bytes (or in the case of encoding streams,\n   * characters) to consume. If `n` is not provided, then the entire buffer\n   * is returned, or `null` is returned if no data is available.\n   *\n   * If `n` is greater that the amount of data in the internal buffer,\n   * then `null` is returned.\n   */\n  read(n?: number | null): RType | null {\n    if (this[DESTROYED]) return null\n    this[DISCARDED] = false\n\n    if (\n      this[BUFFERLENGTH] === 0 ||\n      n === 0 ||\n      (n && n > this[BUFFERLENGTH])\n    ) {\n      this[MAYBE_EMIT_END]()\n      return null\n    }\n\n    if (this[OBJECTMODE]) n = null\n\n    if (this[BUFFER].length > 1 && !this[OBJECTMODE]) {\n      // not object mode, so if we have an encoding, then RType is string\n      // otherwise, must be Buffer\n      this[BUFFER] = [\n        (this[ENCODING]\n          ? this[BUFFER].join('')\n          : Buffer.concat(\n              this[BUFFER] as Buffer[],\n              this[BUFFERLENGTH]\n            )) as RType,\n      ]\n    }\n\n    const ret = this[READ](n || null, this[BUFFER][0] as RType)\n    this[MAYBE_EMIT_END]()\n    return ret\n  }\n\n  [READ](n: number | null, chunk: RType) {\n    if (this[OBJECTMODE]) this[BUFFERSHIFT]()\n    else {\n      const c = chunk as Minipass.BufferOrString\n      if (n === c.length || n === null) this[BUFFERSHIFT]()\n      else if (typeof c === 'string') {\n        this[BUFFER][0] = c.slice(n) as RType\n        chunk = c.slice(0, n) as RType\n        this[BUFFERLENGTH] -= n\n      } else {\n        this[BUFFER][0] = c.subarray(n) as RType\n        chunk = c.subarray(0, n) as RType\n        this[BUFFERLENGTH] -= n\n      }\n    }\n\n    this.emit('data', chunk)\n\n    if (!this[BUFFER].length && !this[EOF]) this.emit('drain')\n\n    return chunk\n  }\n\n  /**\n   * End the stream, optionally providing a final write.\n   *\n   * See {@link Minipass#write} for argument descriptions\n   */\n  end(cb?: () => void): this\n  end(chunk: WType, cb?: () => void): this\n  end(chunk: WType, encoding?: Minipass.Encoding, cb?: () => void): this\n  end(\n    chunk?: WType | (() => void),\n    encoding?: Minipass.Encoding | (() => void),\n    cb?: () => void\n  ): this {\n    if (typeof chunk === 'function') {\n      cb = chunk as () => void\n      chunk = undefined\n    }\n    if (typeof encoding === 'function') {\n      cb = encoding\n      encoding = 'utf8'\n    }\n    if (chunk !== undefined) this.write(chunk, encoding)\n    if (cb) this.once('end', cb)\n    this[EOF] = true\n    this.writable = false\n\n    // if we haven't written anything, then go ahead and emit,\n    // even if we're not reading.\n    // we'll re-emit if a new 'end' listener is added anyway.\n    // This makes MP more suitable to write-only use cases.\n    if (this[FLOWING] || !this[PAUSED]) this[MAYBE_EMIT_END]()\n    return this\n  }\n\n  // don't let the internal resume be overwritten\n  [RESUME]() {\n    if (this[DESTROYED]) return\n\n    if (!this[DATALISTENERS] && !this[PIPES].length) {\n      this[DISCARDED] = true\n    }\n    this[PAUSED] = false\n    this[FLOWING] = true\n    this.emit('resume')\n    if (this[BUFFER].length) this[FLUSH]()\n    else if (this[EOF]) this[MAYBE_EMIT_END]()\n    else this.emit('drain')\n  }\n\n  /**\n   * Resume the stream if it is currently in a paused state\n   *\n   * If called when there are no pipe destinations or `data` event listeners,\n   * this will place the stream in a \"discarded\" state, where all data will\n   * be thrown away. The discarded state is removed if a pipe destination or\n   * data handler is added, if pause() is called, or if any synchronous or\n   * asynchronous iteration is started.\n   */\n  resume() {\n    return this[RESUME]()\n  }\n\n  /**\n   * Pause the stream\n   */\n  pause() {\n    this[FLOWING] = false\n    this[PAUSED] = true\n    this[DISCARDED] = false\n  }\n\n  /**\n   * true if the stream has been forcibly destroyed\n   */\n  get destroyed() {\n    return this[DESTROYED]\n  }\n\n  /**\n   * true if the stream is currently in a flowing state, meaning that\n   * any writes will be immediately emitted.\n   */\n  get flowing() {\n    return this[FLOWING]\n  }\n\n  /**\n   * true if the stream is currently in a paused state\n   */\n  get paused() {\n    return this[PAUSED]\n  }\n\n  [BUFFERPUSH](chunk: RType) {\n    if (this[OBJECTMODE]) this[BUFFERLENGTH] += 1\n    else this[BUFFERLENGTH] += (chunk as Minipass.BufferOrString).length\n    this[BUFFER].push(chunk)\n  }\n\n  [BUFFERSHIFT](): RType {\n    if (this[OBJECTMODE]) this[BUFFERLENGTH] -= 1\n    else\n      this[BUFFERLENGTH] -= (\n        this[BUFFER][0] as Minipass.BufferOrString\n      ).length\n    return this[BUFFER].shift() as RType\n  }\n\n  [FLUSH](noDrain: boolean = false) {\n    do {} while (\n      this[FLUSHCHUNK](this[BUFFERSHIFT]()) &&\n      this[BUFFER].length\n    )\n\n    if (!noDrain && !this[BUFFER].length && !this[EOF]) this.emit('drain')\n  }\n\n  [FLUSHCHUNK](chunk: RType) {\n    this.emit('data', chunk)\n    return this[FLOWING]\n  }\n\n  /**\n   * Pipe all data emitted by this stream into the destination provided.\n   *\n   * Triggers the flow of data.\n   */\n  pipe<W extends Minipass.Writable>(dest: W, opts?: PipeOptions): W {\n    if (this[DESTROYED]) return dest\n    this[DISCARDED] = false\n\n    const ended = this[EMITTED_END]\n    opts = opts || {}\n    if (dest === proc.stdout || dest === proc.stderr) opts.end = false\n    else opts.end = opts.end !== false\n    opts.proxyErrors = !!opts.proxyErrors\n\n    // piping an ended stream ends immediately\n    if (ended) {\n      if (opts.end) dest.end()\n    } else {\n      // \"as\" here just ignores the WType, which pipes don't care about,\n      // since they're only consuming from us, and writing to the dest\n      this[PIPES].push(\n        !opts.proxyErrors\n          ? new Pipe<RType>(this as Minipass<RType>, dest, opts)\n          : new PipeProxyErrors<RType>(this as Minipass<RType>, dest, opts)\n      )\n      if (this[ASYNC]) defer(() => this[RESUME]())\n      else this[RESUME]()\n    }\n\n    return dest\n  }\n\n  /**\n   * Fully unhook a piped destination stream.\n   *\n   * If the destination stream was the only consumer of this stream (ie,\n   * there are no other piped destinations or `'data'` event listeners)\n   * then the flow of data will stop until there is another consumer or\n   * {@link Minipass#resume} is explicitly called.\n   */\n  unpipe<W extends Minipass.Writable>(dest: W) {\n    const p = this[PIPES].find(p => p.dest === dest)\n    if (p) {\n      if (this[PIPES].length === 1) {\n        if (this[FLOWING] && this[DATALISTENERS] === 0) {\n          this[FLOWING] = false\n        }\n        this[PIPES] = []\n      } else this[PIPES].splice(this[PIPES].indexOf(p), 1)\n      p.unpipe()\n    }\n  }\n\n  /**\n   * Alias for {@link Minipass#on}\n   */\n  addListener<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ): this {\n    return this.on(ev, handler)\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.on`, with the following\n   * behavior differences to prevent data loss and unnecessary hangs:\n   *\n   * - Adding a 'data' event handler will trigger the flow of data\n   *\n   * - Adding a 'readable' event handler when there is data waiting to be read\n   *   will cause 'readable' to be emitted immediately.\n   *\n   * - Adding an 'endish' event handler ('end', 'finish', etc.) which has\n   *   already passed will cause the event to be emitted immediately and all\n   *   handlers removed.\n   *\n   * - Adding an 'error' event handler after an error has been emitted will\n   *   cause the event to be re-emitted immediately with the error previously\n   *   raised.\n   */\n  on<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ): this {\n    const ret = super.on(\n      ev as string | symbol,\n      handler as (...a: any[]) => any\n    )\n    if (ev === 'data') {\n      this[DISCARDED] = false\n      this[DATALISTENERS]++\n      if (!this[PIPES].length && !this[FLOWING]) {\n        this[RESUME]()\n      }\n    } else if (ev === 'readable' && this[BUFFERLENGTH] !== 0) {\n      super.emit('readable')\n    } else if (isEndish(ev) && this[EMITTED_END]) {\n      super.emit(ev)\n      this.removeAllListeners(ev)\n    } else if (ev === 'error' && this[EMITTED_ERROR]) {\n      const h = handler as (...a: Events['error']) => any\n      if (this[ASYNC]) defer(() => h.call(this, this[EMITTED_ERROR]))\n      else h.call(this, this[EMITTED_ERROR])\n    }\n    return ret\n  }\n\n  /**\n   * Alias for {@link Minipass#off}\n   */\n  removeListener<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ) {\n    return this.off(ev, handler)\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.off`\n   *\n   * If a 'data' event handler is removed, and it was the last consumer\n   * (ie, there are no pipe destinations or other 'data' event listeners),\n   * then the flow of data will stop until there is another consumer or\n   * {@link Minipass#resume} is explicitly called.\n   */\n  off<Event extends keyof Events>(\n    ev: Event,\n    handler: (...args: Events[Event]) => any\n  ) {\n    const ret = super.off(\n      ev as string | symbol,\n      handler as (...a: any[]) => any\n    )\n    // if we previously had listeners, and now we don't, and we don't\n    // have any pipes, then stop the flow, unless it's been explicitly\n    // put in a discarded flowing state via stream.resume().\n    if (ev === 'data') {\n      this[DATALISTENERS] = this.listeners('data').length\n      if (\n        this[DATALISTENERS] === 0 &&\n        !this[DISCARDED] &&\n        !this[PIPES].length\n      ) {\n        this[FLOWING] = false\n      }\n    }\n    return ret\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.removeAllListeners`\n   *\n   * If all 'data' event handlers are removed, and they were the last consumer\n   * (ie, there are no pipe destinations), then the flow of data will stop\n   * until there is another consumer or {@link Minipass#resume} is explicitly\n   * called.\n   */\n  removeAllListeners<Event extends keyof Events>(ev?: Event) {\n    const ret = super.removeAllListeners(ev as string | symbol | undefined)\n    if (ev === 'data' || ev === undefined) {\n      this[DATALISTENERS] = 0\n      if (!this[DISCARDED] && !this[PIPES].length) {\n        this[FLOWING] = false\n      }\n    }\n    return ret\n  }\n\n  /**\n   * true if the 'end' event has been emitted\n   */\n  get emittedEnd() {\n    return this[EMITTED_END]\n  }\n\n  [MAYBE_EMIT_END]() {\n    if (\n      !this[EMITTING_END] &&\n      !this[EMITTED_END] &&\n      !this[DESTROYED] &&\n      this[BUFFER].length === 0 &&\n      this[EOF]\n    ) {\n      this[EMITTING_END] = true\n      this.emit('end')\n      this.emit('prefinish')\n      this.emit('finish')\n      if (this[CLOSED]) this.emit('close')\n      this[EMITTING_END] = false\n    }\n  }\n\n  /**\n   * Mostly identical to `EventEmitter.emit`, with the following\n   * behavior differences to prevent data loss and unnecessary hangs:\n   *\n   * If the stream has been destroyed, and the event is something other\n   * than 'close' or 'error', then `false` is returned and no handlers\n   * are called.\n   *\n   * If the event is 'end', and has already been emitted, then the event\n   * is ignored. If the stream is in a paused or non-flowing state, then\n   * the event will be deferred until data flow resumes. If the stream is\n   * async, then handlers will be called on the next tick rather than\n   * immediately.\n   *\n   * If the event is 'close', and 'end' has not yet been emitted, then\n   * the event will be deferred until after 'end' is emitted.\n   *\n   * If the event is 'error', and an AbortSignal was provided for the stream,\n   * and there are no listeners, then the event is ignored, matching the\n   * behavior of node core streams in the presense of an AbortSignal.\n   *\n   * If the event is 'finish' or 'prefinish', then all listeners will be\n   * removed after emitting the event, to prevent double-firing.\n   */\n  emit<Event extends keyof Events>(\n    ev: Event,\n    ...args: Events[Event]\n  ): boolean {\n    const data = args[0]\n    // error and close are only events allowed after calling destroy()\n    if (\n      ev !== 'error' &&\n      ev !== 'close' &&\n      ev !== DESTROYED &&\n      this[DESTROYED]\n    ) {\n      return false\n    } else if (ev === 'data') {\n      return !this[OBJECTMODE] && !data\n        ? false\n        : this[ASYNC]\n        ? (defer(() => this[EMITDATA](data as RType)), true)\n        : this[EMITDATA](data as RType)\n    } else if (ev === 'end') {\n      return this[EMITEND]()\n    } else if (ev === 'close') {\n      this[CLOSED] = true\n      // don't emit close before 'end' and 'finish'\n      if (!this[EMITTED_END] && !this[DESTROYED]) return false\n      const ret = super.emit('close')\n      this.removeAllListeners('close')\n      return ret\n    } else if (ev === 'error') {\n      this[EMITTED_ERROR] = data\n      super.emit(ERROR, data)\n      const ret =\n        !this[SIGNAL] || this.listeners('error').length\n          ? super.emit('error', data)\n          : false\n      this[MAYBE_EMIT_END]()\n      return ret\n    } else if (ev === 'resume') {\n      const ret = super.emit('resume')\n      this[MAYBE_EMIT_END]()\n      return ret\n    } else if (ev === 'finish' || ev === 'prefinish') {\n      const ret = super.emit(ev)\n      this.removeAllListeners(ev)\n      return ret\n    }\n\n    // Some other unknown event\n    const ret = super.emit(ev as string, ...args)\n    this[MAYBE_EMIT_END]()\n    return ret\n  }\n\n  [EMITDATA](data: RType) {\n    for (const p of this[PIPES]) {\n      if (p.dest.write(data as RType) === false) this.pause()\n    }\n    const ret = this[DISCARDED] ? false : super.emit('data', data)\n    this[MAYBE_EMIT_END]()\n    return ret\n  }\n\n  [EMITEND]() {\n    if (this[EMITTED_END]) return false\n\n    this[EMITTED_END] = true\n    this.readable = false\n    return this[ASYNC]\n      ? (defer(() => this[EMITEND2]()), true)\n      : this[EMITEND2]()\n  }\n\n  [EMITEND2]() {\n    if (this[DECODER]) {\n      const data = this[DECODER].end()\n      if (data) {\n        for (const p of this[PIPES]) {\n          p.dest.write(data as RType)\n        }\n        if (!this[DISCARDED]) super.emit('data', data)\n      }\n    }\n\n    for (const p of this[PIPES]) {\n      p.end()\n    }\n    const ret = super.emit('end')\n    this.removeAllListeners('end')\n    return ret\n  }\n\n  /**\n   * Return a Promise that resolves to an array of all emitted data once\n   * the stream ends.\n   */\n  async collect(): Promise<RType[] & { dataLength: number }> {\n    const buf: RType[] & { dataLength: number } = Object.assign([], {\n      dataLength: 0,\n    })\n    if (!this[OBJECTMODE]) buf.dataLength = 0\n    // set the promise first, in case an error is raised\n    // by triggering the flow here.\n    const p = this.promise()\n    this.on('data', c => {\n      buf.push(c)\n      if (!this[OBJECTMODE])\n        buf.dataLength += (c as Minipass.BufferOrString).length\n    })\n    await p\n    return buf\n  }\n\n  /**\n   * Return a Promise that resolves to the concatenation of all emitted data\n   * once the stream ends.\n   *\n   * Not allowed on objectMode streams.\n   */\n  async concat(): Promise<RType> {\n    if (this[OBJECTMODE]) {\n      throw new Error('cannot concat in objectMode')\n    }\n    const buf = await this.collect()\n    return (\n      this[ENCODING]\n        ? buf.join('')\n        : Buffer.concat(buf as Buffer[], buf.dataLength)\n    ) as RType\n  }\n\n  /**\n   * Return a void Promise that resolves once the stream ends.\n   */\n  async promise(): Promise<void> {\n    return new Promise<void>((resolve, reject) => {\n      this.on(DESTROYED, () => reject(new Error('stream destroyed')))\n      this.on('error', er => reject(er))\n      this.on('end', () => resolve())\n    })\n  }\n\n  /**\n   * Asynchronous `for await of` iteration.\n   *\n   * This will continue emitting all chunks until the stream terminates.\n   */\n  [Symbol.asyncIterator](): AsyncGenerator<RType, void, void> {\n    // set this up front, in case the consumer doesn't call next()\n    // right away.\n    this[DISCARDED] = false\n    let stopped = false\n    const stop = async (): Promise<IteratorReturnResult<void>> => {\n      this.pause()\n      stopped = true\n      return { value: undefined, done: true }\n    }\n    const next = (): Promise<IteratorResult<RType, void>> => {\n      if (stopped) return stop()\n      const res = this.read()\n      if (res !== null) return Promise.resolve({ done: false, value: res })\n\n      if (this[EOF]) return stop()\n\n      let resolve!: (res: IteratorResult<RType>) => void\n      let reject!: (er: unknown) => void\n      const onerr = (er: unknown) => {\n        this.off('data', ondata)\n        this.off('end', onend)\n        this.off(DESTROYED, ondestroy)\n        stop()\n        reject(er)\n      }\n      const ondata = (value: RType) => {\n        this.off('error', onerr)\n        this.off('end', onend)\n        this.off(DESTROYED, ondestroy)\n        this.pause()\n        resolve({ value, done: !!this[EOF] })\n      }\n      const onend = () => {\n        this.off('error', onerr)\n        this.off('data', ondata)\n        this.off(DESTROYED, ondestroy)\n        stop()\n        resolve({ done: true, value: undefined })\n      }\n      const ondestroy = () => onerr(new Error('stream destroyed'))\n      return new Promise<IteratorResult<RType>>((res, rej) => {\n        reject = rej\n        resolve = res\n        this.once(DESTROYED, ondestroy)\n        this.once('error', onerr)\n        this.once('end', onend)\n        this.once('data', ondata)\n      })\n    }\n\n    return {\n      next,\n      throw: stop,\n      return: stop,\n      [Symbol.asyncIterator]() {\n        return this\n      },\n    }\n  }\n\n  /**\n   * Synchronous `for of` iteration.\n   *\n   * The iteration will terminate when the internal buffer runs out, even\n   * if the stream has not yet terminated.\n   */\n  [Symbol.iterator](): Generator<RType, void, void> {\n    // set this up front, in case the consumer doesn't call next()\n    // right away.\n    this[DISCARDED] = false\n    let stopped = false\n    const stop = (): IteratorReturnResult<void> => {\n      this.pause()\n      this.off(ERROR, stop)\n      this.off(DESTROYED, stop)\n      this.off('end', stop)\n      stopped = true\n      return { done: true, value: undefined }\n    }\n\n    const next = (): IteratorResult<RType, void> => {\n      if (stopped) return stop()\n      const value = this.read()\n      return value === null ? stop() : { done: false, value }\n    }\n\n    this.once('end', stop)\n    this.once(ERROR, stop)\n    this.once(DESTROYED, stop)\n\n    return {\n      next,\n      throw: stop,\n      return: stop,\n      [Symbol.iterator]() {\n        return this\n      },\n    }\n  }\n\n  /**\n   * Destroy a stream, preventing it from being used for any further purpose.\n   *\n   * If the stream has a `close()` method, then it will be called on\n   * destruction.\n   *\n   * After destruction, any attempt to write data, read data, or emit most\n   * events will be ignored.\n   *\n   * If an error argument is provided, then it will be emitted in an\n   * 'error' event.\n   */\n  destroy(er?: unknown) {\n    if (this[DESTROYED]) {\n      if (er) this.emit('error', er)\n      else this.emit(DESTROYED)\n      return this\n    }\n\n    this[DESTROYED] = true\n    this[DISCARDED] = true\n\n    // throw away all buffered data, it's never coming out\n    this[BUFFER].length = 0\n    this[BUFFERLENGTH] = 0\n\n    const wc = this as Minipass<RType, WType, Events> & {\n      close?: () => void\n    }\n    if (typeof wc.close === 'function' && !this[CLOSED]) wc.close()\n\n    if (er) this.emit('error', er)\n    // if no error to emit, still reject pending promises\n    else this.emit(DESTROYED)\n\n    return this\n  }\n\n  /**\n   * Alias for {@link isStream}\n   *\n   * Former export location, maintained for backwards compatibility.\n   *\n   * @deprecated\n   */\n  static get isStream() {\n    return isStream\n  }\n}\n", "import { Dirent, Stats } from 'fs'\nimport { GlobOptions } from 'glob'\n\nconst typeOrUndef = (val: any, t: string) =>\n  typeof val === 'undefined' || typeof val === t\n\nexport const isRimrafOptions = (o: any): o is RimrafOptions =>\n  !!o &&\n  typeof o === 'object' &&\n  typeOrUndef(o.preserveRoot, 'boolean') &&\n  typeOrUndef(o.tmp, 'string') &&\n  typeOrUndef(o.maxRetries, 'number') &&\n  typeOrUndef(o.retryDelay, 'number') &&\n  typeOrUndef(o.backoff, 'number') &&\n  typeOrUndef(o.maxBackoff, 'number') &&\n  (typeOrUndef(o.glob, 'boolean') ||\n    (o.glob && typeof o.glob === 'object')) &&\n  typeOrUndef(o.filter, 'function')\n\nexport const assertRimrafOptions: (o: any) => void = (\n  o: any,\n): asserts o is RimrafOptions => {\n  if (!isRimrafOptions(o)) {\n    throw new Error('invalid rimraf options')\n  }\n}\n\nexport interface RimrafAsyncOptions {\n  preserveRoot?: boolean\n  tmp?: string\n  maxRetries?: number\n  retryDelay?: number\n  backoff?: number\n  maxBackoff?: number\n  signal?: AbortSignal\n  glob?: boolean | GlobOptions\n  filter?:\n    | ((path: string, ent: Dirent | Stats) => boolean)\n    | ((path: string, ent: Dirent | Stats) => Promise<boolean>)\n}\n\nexport interface RimrafSyncOptions extends RimrafAsyncOptions {\n  filter?: (path: string, ent: Dirent | Stats) => boolean\n}\n\nexport type RimrafOptions = RimrafSyncOptions | RimrafAsyncOptions\n\nconst optArgT = <T extends RimrafOptions>(\n  opt: T,\n):\n  | (T & {\n      glob: GlobOptions & { withFileTypes: false }\n    })\n  | (T & { glob: undefined }) => {\n  assertRimrafOptions(opt)\n  const { glob, ...options } = opt\n  if (!glob) {\n    return options as T & { glob: undefined }\n  }\n  const globOpt =\n    glob === true ?\n      opt.signal ?\n        { signal: opt.signal }\n      : {}\n    : opt.signal ?\n      {\n        signal: opt.signal,\n        ...glob,\n      }\n    : glob\n  return {\n    ...options,\n    glob: {\n      ...globOpt,\n      // always get absolute paths from glob, to ensure\n      // that we are referencing the correct thing.\n      absolute: true,\n      withFileTypes: false,\n    },\n  } as T & { glob: GlobOptions & { withFileTypes: false } }\n}\n\nexport const optArg = (opt: RimrafAsyncOptions = {}) => optArgT(opt)\nexport const optArgSync = (opt: RimrafSyncOptions = {}) => optArgT(opt)\n", "import { parse, resolve } from 'path'\nimport { inspect } from 'util'\nimport { RimrafAsyncOptions } from './index.js'\n\nconst pathArg = (path: string, opt: RimrafAsyncOptions = {}) => {\n  const type = typeof path\n  if (type !== 'string') {\n    const ctor = path && type === 'object' && path.constructor\n    const received =\n      ctor && ctor.name ? `an instance of ${ctor.name}`\n      : type === 'object' ? inspect(path)\n      : `type ${type} ${path}`\n    const msg =\n      'The \"path\" argument must be of type string. ' +\n      `Received ${received}`\n    throw Object.assign(new TypeError(msg), {\n      path,\n      code: 'ERR_INVALID_ARG_TYPE',\n    })\n  }\n\n  if (/\\0/.test(path)) {\n    // simulate same failure that node raises\n    const msg = 'path must be a string without null bytes'\n    throw Object.assign(new TypeError(msg), {\n      path,\n      code: 'ERR_INVALID_ARG_VALUE',\n    })\n  }\n\n  path = resolve(path)\n  const { root } = parse(path)\n\n  if (path === root && opt.preserveRoot !== false) {\n    const msg =\n      'refusing to remove root directory without preserveRoot:false'\n    throw Object.assign(new Error(msg), {\n      path,\n      code: 'ERR_PRESERVE_ROOT',\n    })\n  }\n\n  if (process.platform === 'win32') {\n    const badWinChars = /[*|\"<>?:]/\n    const { root } = parse(path)\n    if (badWinChars.test(path.substring(root.length))) {\n      throw Object.assign(new Error('Illegal characters in path.'), {\n        path,\n        code: 'EINVAL',\n      })\n    }\n  }\n\n  return path\n}\n\nexport default pathArg\n", "import fs, { Dirent, readdirSync as rdSync } from 'fs'\nimport fsPromises from 'fs/promises'\n\n// sync ones just take the sync version from node\n// readdir forces withFileTypes: true\n\nexport {\n  chmodSync,\n  mkdirSync,\n  renameSync,\n  rmdirSync,\n  rmSync,\n  statSync,\n  lstatSync,\n  unlinkSync,\n} from 'fs'\n\nexport const readdirSync = (path: fs.PathLike): Dirent[] =>\n  rdSync(path, { withFileTypes: true })\n\nexport const promises = {\n  chmod: fsPromises.chmod,\n  mkdir: fsPromises.mkdir,\n  readdir: (path: fs.PathLike) =>\n    fsPromises.readdir(path, { withFileTypes: true }),\n  rename: fsPromises.rename,\n  rm: fsPromises.rm,\n  rmdir: fsPromises.rmdir,\n  stat: fsPromises.stat,\n  lstat: fsPromises.lstat,\n  unlink: fsPromises.unlink,\n}\n", "// the simple recursive removal, where unlink and rmdir are atomic\n// Note that this approach does NOT work on Windows!\n// We stat first and only unlink if the Dirent isn't a directory,\n// because sunos will let root unlink a directory, and some\n// SUPER weird breakage happens as a result.\n\nimport { lstatSync, promises, rmdirSync, unlinkSync } from './fs.js'\nimport { parse, resolve } from 'path'\nimport { readdirOrError, readdirOrErrorSync } from './readdir-or-error.js'\nimport { Dirent, Stats } from 'fs'\nimport { RimrafAsyncOptions, RimrafSyncOptions } from './index.js'\nimport { ignoreENOENT, ignoreENOENTSync } from './ignore-enoent.js'\nimport { errorCode } from './error.js'\nconst { lstat, rmdir, unlink } = promises\n\nexport const rimrafPosix = async (\n  path: string,\n  opt: RimrafAsyncOptions,\n) => {\n  opt?.signal?.throwIfAborted()\n  return (\n    (await ignoreENOENT(\n      lstat(path).then(stat => rimrafPosixDir(path, opt, stat)),\n    )) ?? true\n  )\n}\n\nexport const rimrafPosixSync = (path: string, opt: RimrafSyncOptions) => {\n  opt?.signal?.throwIfAborted()\n  return (\n    ignoreENOENTSync(() =>\n      rimrafPosixDirSync(path, opt, lstatSync(path)),\n    ) ?? true\n  )\n}\n\nconst rimrafPosixDir = async (\n  path: string,\n  opt: RimrafAsyncOptions,\n  ent: Dirent | Stats,\n): Promise<boolean> => {\n  opt?.signal?.throwIfAborted()\n  const entries = ent.isDirectory() ? await readdirOrError(path) : null\n  if (!Array.isArray(entries)) {\n    // this can only happen if lstat/readdir lied, or if the dir was\n    // swapped out with a file at just the right moment.\n    /* c8 ignore start */\n    if (entries) {\n      if (errorCode(entries) === 'ENOENT') {\n        return true\n      }\n      if (errorCode(entries) !== 'ENOTDIR') {\n        throw entries\n      }\n    }\n    /* c8 ignore stop */\n    if (opt.filter && !(await opt.filter(path, ent))) {\n      return false\n    }\n    await ignoreENOENT(unlink(path))\n    return true\n  }\n\n  const removedAll = (\n    await Promise.all(\n      entries.map(ent =>\n        rimrafPosixDir(resolve(path, ent.name), opt, ent),\n      ),\n    )\n  ).every(v => v === true)\n\n  if (!removedAll) {\n    return false\n  }\n\n  // we don't ever ACTUALLY try to unlink /, because that can never work\n  // but when preserveRoot is false, we could be operating on it.\n  // No need to check if preserveRoot is not false.\n  if (opt.preserveRoot === false && path === parse(path).root) {\n    return false\n  }\n\n  if (opt.filter && !(await opt.filter(path, ent))) {\n    return false\n  }\n\n  await ignoreENOENT(rmdir(path))\n  return true\n}\n\nconst rimrafPosixDirSync = (\n  path: string,\n  opt: RimrafSyncOptions,\n  ent: Dirent | Stats,\n): boolean => {\n  opt?.signal?.throwIfAborted()\n  const entries = ent.isDirectory() ? readdirOrErrorSync(path) : null\n  if (!Array.isArray(entries)) {\n    // this can only happen if lstat/readdir lied, or if the dir was\n    // swapped out with a file at just the right moment.\n    /* c8 ignore start */\n    if (entries) {\n      if (errorCode(entries) === 'ENOENT') {\n        return true\n      }\n      if (errorCode(entries) !== 'ENOTDIR') {\n        throw entries\n      }\n    }\n    /* c8 ignore stop */\n    if (opt.filter && !opt.filter(path, ent)) {\n      return false\n    }\n    ignoreENOENTSync(() => unlinkSync(path))\n    return true\n  }\n  let removedAll: boolean = true\n  for (const ent of entries) {\n    const p = resolve(path, ent.name)\n    removedAll = rimrafPosixDirSync(p, opt, ent) && removedAll\n  }\n  if (opt.preserveRoot === false && path === parse(path).root) {\n    return false\n  }\n\n  if (!removedAll) {\n    return false\n  }\n\n  if (opt.filter && !opt.filter(path, ent)) {\n    return false\n  }\n\n  ignoreENOENTSync(() => rmdirSync(path))\n  return true\n}\n", "// returns an array of entries if readdir() works,\n// or the error that readdir() raised if not.\nimport { promises, readdirSync } from './fs.js'\nconst { readdir } = promises\n\nexport const readdirOrError = (path: string) =>\n  readdir(path).catch(er => er as Error)\nexport const readdirOrErrorSync = (path: string) => {\n  try {\n    return readdirSync(path)\n  } catch (er) {\n    return er as Error\n  }\n}\n", "const isRecord = (o: unknown): o is Record<string, unknown> =>\n  !!o && typeof o === 'object'\n\nconst hasString = (o: Record<string, unknown>, key: string) =>\n  key in o && typeof o[key] === 'string'\n\nexport const isFsError = (\n  o: unknown,\n): o is NodeJS.ErrnoException & {\n  code: string\n  path: string\n} => isRecord(o) && hasString(o, 'code') && hasString(o, 'path')\n\nexport const errorCode = (er: unknown) =>\n  isRecord(er) && hasString(er, 'code') ? er.code : null\n", "import { errorCode } from './error.js'\n\nexport const ignoreENOENT = async <T>(p: Promise<T>, rethrow?: unknown) =>\n  p.catch(er => {\n    if (errorCode(er) === 'ENOENT') {\n      return\n    }\n    throw rethrow ?? er\n  })\n\nexport const ignoreENOENTSync = <T>(fn: () => T, rethrow?: unknown) => {\n  try {\n    return fn()\n  } catch (er) {\n    if (errorCode(er) === 'ENOENT') {\n      return\n    }\n    throw rethrow ?? er\n  }\n}\n", "// This is the same as rimrafPosix, with the following changes:\n//\n// 1. EBUSY, ENFILE, EMFILE trigger retries and/or exponential backoff\n// 2. All non-directories are removed first and then all directories are\n//    removed in a second sweep.\n// 3. If we hit ENOTEMPTY in the second sweep, fall back to move-remove on\n//    the that folder.\n//\n// Note: \"move then remove\" is 2-10 times slower, and just as unreliable.\n\nimport { Dirent, Stats } from 'fs'\nimport { parse, resolve } from 'path'\nimport { RimrafAsyncOptions, RimrafSyncOptions } from './index.js'\nimport { fixEPERM, fixEPERMSync } from './fix-eperm.js'\nimport { lstatSync, promises, rmdirSync, unlinkSync } from './fs.js'\nimport { ignoreENOENT, ignoreENOENTSync } from './ignore-enoent.js'\nimport { readdirOrError, readdirOrErrorSync } from './readdir-or-error.js'\nimport { retryBusy, retryBusySync } from './retry-busy.js'\nimport {\n  rimrafMoveRemove,\n  rimrafMoveRemoveSync,\n} from './rimraf-move-remove.js'\nimport { errorCode } from './error.js'\nconst { unlink, rmdir, lstat } = promises\n\nconst rimrafWindowsFile = retryBusy(fixEPERM(unlink))\nconst rimrafWindowsFileSync = retryBusySync(fixEPERMSync(unlinkSync))\nconst rimrafWindowsDirRetry = retryBusy(fixEPERM(rmdir))\nconst rimrafWindowsDirRetrySync = retryBusySync(fixEPERMSync(rmdirSync))\n\nconst rimrafWindowsDirMoveRemoveFallback = async (\n  path: string,\n  // already filtered, remove from options so we don't call unnecessarily\n  // eslint-disable-next-line @typescript-eslint/no-unused-vars\n  { filter, ...opt }: RimrafAsyncOptions,\n): Promise<boolean> => {\n  /* c8 ignore next */\n  opt?.signal?.throwIfAborted()\n  try {\n    await rimrafWindowsDirRetry(path, opt)\n    return true\n  } catch (er) {\n    if (errorCode(er) === 'ENOTEMPTY') {\n      return rimrafMoveRemove(path, opt)\n    }\n    throw er\n  }\n}\n\nconst rimrafWindowsDirMoveRemoveFallbackSync = (\n  path: string,\n  // already filtered, remove from options so we don't call unnecessarily\n  // eslint-disable-next-line @typescript-eslint/no-unused-vars\n  { filter, ...opt }: RimrafSyncOptions,\n): boolean => {\n  opt?.signal?.throwIfAborted()\n  try {\n    rimrafWindowsDirRetrySync(path, opt)\n    return true\n  } catch (er) {\n    if (errorCode(er) === 'ENOTEMPTY') {\n      return rimrafMoveRemoveSync(path, opt)\n    }\n    throw er\n  }\n}\n\nconst START = Symbol('start')\nconst CHILD = Symbol('child')\nconst FINISH = Symbol('finish')\n\nexport const rimrafWindows = async (\n  path: string,\n  opt: RimrafAsyncOptions,\n) => {\n  opt?.signal?.throwIfAborted()\n  return (\n    (await ignoreENOENT(\n      lstat(path).then(stat => rimrafWindowsDir(path, opt, stat, START)),\n    )) ?? true\n  )\n}\n\nexport const rimrafWindowsSync = (\n  path: string,\n  opt: RimrafSyncOptions,\n) => {\n  opt?.signal?.throwIfAborted()\n  return (\n    ignoreENOENTSync(() =>\n      rimrafWindowsDirSync(path, opt, lstatSync(path), START),\n    ) ?? true\n  )\n}\n\nconst rimrafWindowsDir = async (\n  path: string,\n  opt: RimrafAsyncOptions,\n  ent: Dirent | Stats,\n  state = START,\n): Promise<boolean> => {\n  opt?.signal?.throwIfAborted()\n\n  const entries = ent.isDirectory() ? await readdirOrError(path) : null\n  if (!Array.isArray(entries)) {\n    // this can only happen if lstat/readdir lied, or if the dir was\n    // swapped out with a file at just the right moment.\n    /* c8 ignore start */\n    if (entries) {\n      if (errorCode(entries) === 'ENOENT') {\n        return true\n      }\n      if (errorCode(entries) !== 'ENOTDIR') {\n        throw entries\n      }\n    }\n    /* c8 ignore stop */\n    if (opt.filter && !(await opt.filter(path, ent))) {\n      return false\n    }\n    // is a file\n    await ignoreENOENT(rimrafWindowsFile(path, opt))\n    return true\n  }\n\n  const s = state === START ? CHILD : state\n  const removedAll = (\n    await Promise.all(\n      entries.map(ent =>\n        rimrafWindowsDir(resolve(path, ent.name), opt, ent, s),\n      ),\n    )\n  ).every(v => v === true)\n\n  if (state === START) {\n    return rimrafWindowsDir(path, opt, ent, FINISH)\n  } else if (state === FINISH) {\n    if (opt.preserveRoot === false && path === parse(path).root) {\n      return false\n    }\n    if (!removedAll) {\n      return false\n    }\n    if (opt.filter && !(await opt.filter(path, ent))) {\n      return false\n    }\n    await ignoreENOENT(rimrafWindowsDirMoveRemoveFallback(path, opt))\n  }\n  return true\n}\n\nconst rimrafWindowsDirSync = (\n  path: string,\n  opt: RimrafSyncOptions,\n  ent: Dirent | Stats,\n  state = START,\n): boolean => {\n  const entries = ent.isDirectory() ? readdirOrErrorSync(path) : null\n  if (!Array.isArray(entries)) {\n    // this can only happen if lstat/readdir lied, or if the dir was\n    // swapped out with a file at just the right moment.\n    /* c8 ignore start */\n    if (entries) {\n      if (errorCode(entries) === 'ENOENT') {\n        return true\n      }\n      if (errorCode(entries) !== 'ENOTDIR') {\n        throw entries\n      }\n    }\n    /* c8 ignore stop */\n    if (opt.filter && !opt.filter(path, ent)) {\n      return false\n    }\n    // is a file\n    ignoreENOENTSync(() => rimrafWindowsFileSync(path, opt))\n    return true\n  }\n\n  let removedAll = true\n  for (const ent of entries) {\n    const s = state === START ? CHILD : state\n    const p = resolve(path, ent.name)\n    removedAll = rimrafWindowsDirSync(p, opt, ent, s) && removedAll\n  }\n\n  if (state === START) {\n    return rimrafWindowsDirSync(path, opt, ent, FINISH)\n  } else if (state === FINISH) {\n    if (opt.preserveRoot === false && path === parse(path).root) {\n      return false\n    }\n    if (!removedAll) {\n      return false\n    }\n    if (opt.filter && !opt.filter(path, ent)) {\n      return false\n    }\n    ignoreENOENTSync(() =>\n      rimrafWindowsDirMoveRemoveFallbackSync(path, opt),\n    )\n  }\n  return true\n}\n", "import { errorCode } from './error.js'\nimport { chmodSync, promises } from './fs.js'\nimport { ignoreENOENT, ignoreENOENTSync } from './ignore-enoent.js'\nconst { chmod } = promises\n\nexport const fixEPERM =\n  (fn: (path: string) => Promise<unknown>) =>\n  async (path: string): Promise<void> => {\n    try {\n      return void (await ignoreENOENT(fn(path)))\n    } catch (er) {\n      if (errorCode(er) === 'EPERM') {\n        if (\n          !(await ignoreENOENT(\n            chmod(path, 0o666).then(() => true),\n            er,\n          ))\n        ) {\n          return\n        }\n        return void (await fn(path))\n      }\n      throw er\n    }\n  }\n\nexport const fixEPERMSync =\n  (fn: (path: string) => unknown) =>\n  (path: string): void => {\n    try {\n      return void ignoreENOENTSync(() => fn(path))\n    } catch (er) {\n      if (errorCode(er) === 'EPERM') {\n        if (!ignoreENOENTSync(() => (chmodSync(path, 0o666), true), er)) {\n          return\n        }\n        return void fn(path)\n      }\n      throw er\n    }\n  }\n", "// note: max backoff is the maximum that any *single* backoff will do\n\nimport { setTimeout } from 'timers/promises'\nimport { RimrafAsyncOptions, RimrafOptions } from './index.js'\nimport { isFsError } from './error.js'\n\nexport const MAXBACKOFF = 200\nexport const RATE = 1.2\nexport const MAXRETRIES = 10\nexport const codes = new Set(['EMFILE', 'ENFILE', 'EBUSY'])\n\nexport const retryBusy = <T>(fn: (path: string) => Promise<T>) => {\n  const method = async (\n    path: string,\n    opt: RimrafAsyncOptions,\n    backoff = 1,\n    total = 0,\n  ) => {\n    const mbo = opt.maxBackoff || MAXBACKOFF\n    const rate = opt.backoff || RATE\n    const max = opt.maxRetries || MAXRETRIES\n    let retries = 0\n    while (true) {\n      try {\n        return await fn(path)\n      } catch (er) {\n        if (isFsError(er) && er.path === path && codes.has(er.code)) {\n          backoff = Math.ceil(backoff * rate)\n          total = backoff + total\n          if (total < mbo) {\n            await setTimeout(backoff)\n            return method(path, opt, backoff, total)\n          }\n          if (retries < max) {\n            retries++\n            continue\n          }\n        }\n        throw er\n      }\n    }\n  }\n\n  return method\n}\n\n// just retries, no async so no backoff\nexport const retryBusySync = <T>(fn: (path: string) => T) => {\n  const method = (path: string, opt: RimrafOptions) => {\n    const max = opt.maxRetries || MAXRETRIES\n    let retries = 0\n    while (true) {\n      try {\n        return fn(path)\n      } catch (er) {\n        if (\n          isFsError(er) &&\n          er.path === path &&\n          codes.has(er.code) &&\n          retries < max\n        ) {\n          retries++\n          continue\n        }\n        throw er\n      }\n    }\n  }\n  return method\n}\n", "// https://youtu.be/uhRWMGBjlO8?t=537\n//\n// 1. readdir\n// 2. for each entry\n//   a. if a non-empty directory, recurse\n//   b. if an empty directory, move to random hidden file name in $TEMP\n//   c. unlink/rmdir $TEMP\n//\n// This works around the fact that unlink/rmdir is non-atomic and takes\n// a non-deterministic amount of time to complete.\n//\n// However, it is HELLA SLOW, like 2-10x slower than a naive recursive rm.\n\nimport { basename, parse, resolve } from 'path'\nimport { defaultTmp, defaultTmpSync } from './default-tmp.js'\nimport { ignoreENOENT, ignoreENOENTSync } from './ignore-enoent.js'\nimport {\n  lstatSync,\n  promises,\n  renameSync,\n  rmdirSync,\n  unlinkSync,\n} from './fs.js'\nimport { Dirent, Stats } from 'fs'\nimport { RimrafAsyncOptions, RimrafSyncOptions } from './index.js'\nimport { readdirOrError, readdirOrErrorSync } from './readdir-or-error.js'\nimport { fixEPERM, fixEPERMSync } from './fix-eperm.js'\nimport { errorCode } from './error.js'\nconst { lstat, rename, unlink, rmdir } = promises\n\n// crypto.randomBytes is much slower, and Math.random() is enough here\nconst uniqueFilename = (path: string) =>\n  `.${basename(path)}.${Math.random()}`\n\nconst unlinkFixEPERM = fixEPERM(unlink)\nconst unlinkFixEPERMSync = fixEPERMSync(unlinkSync)\n\nexport const rimrafMoveRemove = async (\n  path: string,\n  opt: RimrafAsyncOptions,\n) => {\n  opt?.signal?.throwIfAborted()\n  return (\n    (await ignoreENOENT(\n      lstat(path).then(stat => rimrafMoveRemoveDir(path, opt, stat)),\n    )) ?? true\n  )\n}\n\nconst rimrafMoveRemoveDir = async (\n  path: string,\n  opt: RimrafAsyncOptions,\n  ent: Dirent | Stats,\n): Promise<boolean> => {\n  opt?.signal?.throwIfAborted()\n  if (!opt.tmp) {\n    return rimrafMoveRemoveDir(\n      path,\n      { ...opt, tmp: await defaultTmp(path) },\n      ent,\n    )\n  }\n  if (path === opt.tmp && parse(path).root !== path) {\n    throw new Error('cannot delete temp directory used for deletion')\n  }\n\n  const entries = ent.isDirectory() ? await readdirOrError(path) : null\n  if (!Array.isArray(entries)) {\n    // this can only happen if lstat/readdir lied, or if the dir was\n    // swapped out with a file at just the right moment.\n    /* c8 ignore start */\n    if (entries) {\n      if (errorCode(entries) === 'ENOENT') {\n        return true\n      }\n      if (errorCode(entries) !== 'ENOTDIR') {\n        throw entries\n      }\n    }\n    /* c8 ignore stop */\n    if (opt.filter && !(await opt.filter(path, ent))) {\n      return false\n    }\n    await ignoreENOENT(tmpUnlink(path, opt.tmp, unlinkFixEPERM))\n    return true\n  }\n\n  const removedAll = (\n    await Promise.all(\n      entries.map(ent =>\n        rimrafMoveRemoveDir(resolve(path, ent.name), opt, ent),\n      ),\n    )\n  ).every(v => v === true)\n  if (!removedAll) {\n    return false\n  }\n\n  // we don't ever ACTUALLY try to unlink /, because that can never work\n  // but when preserveRoot is false, we could be operating on it.\n  // No need to check if preserveRoot is not false.\n  if (opt.preserveRoot === false && path === parse(path).root) {\n    return false\n  }\n  if (opt.filter && !(await opt.filter(path, ent))) {\n    return false\n  }\n  await ignoreENOENT(tmpUnlink(path, opt.tmp, rmdir))\n  return true\n}\n\nconst tmpUnlink = async <T>(\n  path: string,\n  tmp: string,\n  rm: (p: string) => Promise<T>,\n) => {\n  const tmpFile = resolve(tmp, uniqueFilename(path))\n  await rename(path, tmpFile)\n  return await rm(tmpFile)\n}\n\nexport const rimrafMoveRemoveSync = (\n  path: string,\n  opt: RimrafSyncOptions,\n) => {\n  opt?.signal?.throwIfAborted()\n  return (\n    ignoreENOENTSync(() =>\n      rimrafMoveRemoveDirSync(path, opt, lstatSync(path)),\n    ) ?? true\n  )\n}\n\nconst rimrafMoveRemoveDirSync = (\n  path: string,\n  opt: RimrafSyncOptions,\n  ent: Dirent | Stats,\n): boolean => {\n  opt?.signal?.throwIfAborted()\n  if (!opt.tmp) {\n    return rimrafMoveRemoveDirSync(\n      path,\n      { ...opt, tmp: defaultTmpSync(path) },\n      ent,\n    )\n  }\n  const tmp: string = opt.tmp\n\n  if (path === opt.tmp && parse(path).root !== path) {\n    throw new Error('cannot delete temp directory used for deletion')\n  }\n\n  const entries = ent.isDirectory() ? readdirOrErrorSync(path) : null\n  if (!Array.isArray(entries)) {\n    // this can only happen if lstat/readdir lied, or if the dir was\n    // swapped out with a file at just the right moment.\n    /* c8 ignore start */\n    if (entries) {\n      if (errorCode(entries) === 'ENOENT') {\n        return true\n      }\n      if (errorCode(entries) !== 'ENOTDIR') {\n        throw entries\n      }\n    }\n    /* c8 ignore stop */\n    if (opt.filter && !opt.filter(path, ent)) {\n      return false\n    }\n    ignoreENOENTSync(() => tmpUnlinkSync(path, tmp, unlinkFixEPERMSync))\n    return true\n  }\n\n  let removedAll = true\n  for (const ent of entries) {\n    const p = resolve(path, ent.name)\n    removedAll = rimrafMoveRemoveDirSync(p, opt, ent) && removedAll\n  }\n  if (!removedAll) {\n    return false\n  }\n  if (opt.preserveRoot === false && path === parse(path).root) {\n    return false\n  }\n  if (opt.filter && !opt.filter(path, ent)) {\n    return false\n  }\n  ignoreENOENTSync(() => tmpUnlinkSync(path, tmp, rmdirSync))\n  return true\n}\n\nconst tmpUnlinkSync = (\n  path: string,\n  tmp: string,\n  rmSync: (p: string) => void,\n) => {\n  const tmpFile = resolve(tmp, uniqueFilename(path))\n  renameSync(path, tmpFile)\n  return rmSync(tmpFile)\n}\n", "// The default temporary folder location for use in the windows algorithm.\n// It's TEMPting to use dirname(path), since that's guaranteed to be on the\n// same device.  However, this means that:\n// rimraf(path).then(() => rimraf(dirname(path)))\n// will often fail with EBUSY, because the parent dir contains\n// marked-for-deletion directory entries (which do not show up in readdir).\n// The approach here is to use os.tmpdir() if it's on the same drive letter,\n// or resolve(path, '\\\\temp') if it exists, or the root of the drive if not.\n// On Posix (not that you'd be likely to use the windows algorithm there),\n// it uses os.tmpdir() always.\nimport { tmpdir } from 'os'\nimport { parse, resolve } from 'path'\nimport { promises, statSync } from './fs.js'\nconst { stat } = promises\n\nconst isDirSync = (path: string) => {\n  try {\n    return statSync(path).isDirectory()\n  } catch {\n    return false\n  }\n}\n\nconst isDir = (path: string) =>\n  stat(path).then(\n    st => st.isDirectory(),\n    () => false,\n  )\n\nconst win32DefaultTmp = async (path: string) => {\n  const { root } = parse(path)\n  const tmp = tmpdir()\n  const { root: tmpRoot } = parse(tmp)\n  if (root.toLowerCase() === tmpRoot.toLowerCase()) {\n    return tmp\n  }\n\n  const driveTmp = resolve(root, '/temp')\n  if (await isDir(driveTmp)) {\n    return driveTmp\n  }\n\n  return root\n}\n\nconst win32DefaultTmpSync = (path: string) => {\n  const { root } = parse(path)\n  const tmp = tmpdir()\n  const { root: tmpRoot } = parse(tmp)\n  if (root.toLowerCase() === tmpRoot.toLowerCase()) {\n    return tmp\n  }\n\n  const driveTmp = resolve(root, '/temp')\n  if (isDirSync(driveTmp)) {\n    return driveTmp\n  }\n\n  return root\n}\n\n// eslint-disable-next-line @typescript-eslint/require-await\nconst posixDefaultTmp = async () => tmpdir()\nconst posixDefaultTmpSync = () => tmpdir()\n\nexport const defaultTmp =\n  process.platform === 'win32' ? win32DefaultTmp : posixDefaultTmp\nexport const defaultTmpSync =\n  process.platform === 'win32' ? win32DefaultTmpSync : posixDefaultTmpSync\n", "import { rimrafPosix, rimrafPosixSync } from './rimraf-posix.js'\nimport { rimrafWindows, rimrafWindowsSync } from './rimraf-windows.js'\n\nexport const rimrafManual =\n  process.platform === 'win32' ? rimrafWindows : rimrafPosix\nexport const rimrafManualSync =\n  process.platform === 'win32' ? rimrafWindowsSync : rimrafPosixSync\n", "import { RimrafAsyncOptions, RimrafSyncOptions } from './index.js'\nimport { promises, rmSync } from './fs.js'\nconst { rm } = promises\n\nexport const rimrafNative = async (\n  path: string,\n  opt: RimrafAsyncOptions,\n): Promise<boolean> => {\n  await rm(path, {\n    ...opt,\n    force: true,\n    recursive: true,\n  })\n  return true\n}\n\nexport const rimrafNativeSync = (\n  path: string,\n  opt: RimrafSyncOptions,\n): boolean => {\n  rmSync(path, {\n    ...opt,\n    force: true,\n    recursive: true,\n  })\n  return true\n}\n", "import { RimrafAsyncOptions, RimrafOptions } from './index.js'\n\n/* c8 ignore next */\nconst [major = 0, minor = 0] = process.version\n  .replace(/^v/, '')\n  .split('.')\n  .map(v => parseInt(v, 10))\nconst hasNative = major > 14 || (major === 14 && minor >= 14)\n\n// we do NOT use native by default on Windows, because Node's native\n// rm implementation is less advanced.  Change this code if that changes.\nexport const useNative: (opt?: RimrafAsyncOptions) => boolean =\n  !hasNative || process.platform === 'win32' ?\n    () => false\n  : opt => !opt?.signal && !opt?.filter\nexport const useNativeSync: (opt?: RimrafOptions) => boolean =\n  !hasNative || process.platform === 'win32' ?\n    () => false\n  : opt => !opt?.signal && !opt?.filter\n", "import { glob, globSync } from 'glob'\nimport {\n  optArg,\n  optArgSync,\n  RimrafAsyncOptions,\n  RimrafSyncOptions,\n} from './opt-arg.js'\nimport pathArg from './path-arg.js'\nimport { rimrafManual, rimrafManualSync } from './rimraf-manual.js'\nimport {\n  rimrafMoveRemove,\n  rimrafMoveRemoveSync,\n} from './rimraf-move-remove.js'\nimport { rimrafNative, rimrafNativeSync } from './rimraf-native.js'\nimport { rimrafPosix, rimrafPosixSync } from './rimraf-posix.js'\nimport { rimrafWindows, rimrafWindowsSync } from './rimraf-windows.js'\nimport { useNative, useNativeSync } from './use-native.js'\n\nexport {\n  assertRimrafOptions,\n  isRimrafOptions,\n  type RimrafAsyncOptions,\n  type RimrafOptions,\n  type RimrafSyncOptions,\n} from './opt-arg.js'\n\nconst wrap =\n  (fn: (p: string, o: RimrafAsyncOptions) => Promise<boolean>) =>\n  async (\n    path: string | string[],\n    opt?: RimrafAsyncOptions,\n  ): Promise<boolean> => {\n    const options = optArg(opt)\n    if (options.glob) {\n      path = await glob(path, options.glob)\n    }\n    if (Array.isArray(path)) {\n      return !!(\n        await Promise.all(path.map(p => fn(pathArg(p, options), options)))\n      ).reduce((a, b) => a && b, true)\n    } else {\n      return !!(await fn(pathArg(path, options), options))\n    }\n  }\n\nconst wrapSync =\n  (fn: (p: string, o: RimrafSyncOptions) => boolean) =>\n  (path: string | string[], opt?: RimrafSyncOptions): boolean => {\n    const options = optArgSync(opt)\n    if (options.glob) {\n      path = globSync(path, options.glob)\n    }\n    if (Array.isArray(path)) {\n      return !!path\n        .map(p => fn(pathArg(p, options), options))\n        .reduce((a, b) => a && b, true)\n    } else {\n      return !!fn(pathArg(path, options), options)\n    }\n  }\n\nexport const nativeSync = wrapSync(rimrafNativeSync)\nexport const native = Object.assign(wrap(rimrafNative), {\n  sync: nativeSync,\n})\n\nexport const manualSync = wrapSync(rimrafManualSync)\nexport const manual = Object.assign(wrap(rimrafManual), {\n  sync: manualSync,\n})\n\nexport const windowsSync = wrapSync(rimrafWindowsSync)\nexport const windows = Object.assign(wrap(rimrafWindows), {\n  sync: windowsSync,\n})\n\nexport const posixSync = wrapSync(rimrafPosixSync)\nexport const posix = Object.assign(wrap(rimrafPosix), { sync: posixSync })\n\nexport const moveRemoveSync = wrapSync(rimrafMoveRemoveSync)\nexport const moveRemove = Object.assign(wrap(rimrafMoveRemove), {\n  sync: moveRemoveSync,\n})\n\nexport const rimrafSync = wrapSync((path, opt) =>\n  useNativeSync(opt) ?\n    rimrafNativeSync(path, opt)\n  : rimrafManualSync(path, opt),\n)\nexport const sync = rimrafSync\n\nconst rimraf_ = wrap((path, opt) =>\n  useNative(opt) ? rimrafNative(path, opt) : rimrafManual(path, opt),\n)\nexport const rimraf = Object.assign(rimraf_, {\n  rimraf: rimraf_,\n  sync: rimrafSync,\n  rimrafSync: rimrafSync,\n  manual,\n  manualSync,\n  native,\n  nativeSync,\n  posix,\n  posixSync,\n  windows,\n  windowsSync,\n  moveRemove,\n  moveRemoveSync,\n})\nrimraf.rimraf = rimraf\n", "// chmod bins after build\nimport { chmodSync } from 'fs'\nimport { resolve } from 'path'\nimport pkg from './package.js'\nexport default () => {\n  const { bin } = pkg\n  if (!bin) return\n  if (typeof bin === 'string') {\n    chmodSync(resolve(bin), 0o755)\n  } else {\n    for (const v of Object.values(bin)) {\n      chmodSync(resolve(v), 0o755)\n    }\n  }\n}\n", "import chalk from 'chalk'\nimport { spawnSync } from 'node:child_process'\nimport { relative, resolve } from 'node:path/posix'\nimport buildFail from './build-fail.js'\nimport config from './config.js'\nimport * as console from './console.js'\nimport ifExist from './if-exist.js'\nimport polyfills from './polyfills.js'\nimport setFolderDialect from './set-folder-dialect.js'\nimport './tsconfig.js'\nimport tsc from './which-tsc.js'\n\nconst node = process.execPath\nconst { commonjsDialects = [] } = config\n\nexport const buildCommonJS = () => {\n  setFolderDialect('src', 'commonjs')\n  for (const d of ['commonjs', ...commonjsDialects]) {\n    const pf = polyfills.get(d === 'commonjs' ? 'cjs' : d)\n    console.debug(chalk.cyan.dim('building ' + d))\n    const res = spawnSync(node, [tsc, '-p', `.tshy/${d}.json`], {\n      stdio: 'inherit',\n    })\n    if (res.status || res.signal) {\n      setFolderDialect('src')\n      return buildFail(res)\n    }\n    setFolderDialect('.tshy-build/' + d, 'commonjs')\n    for (const [override, orig] of pf?.map.entries() ?? []) {\n      const stemFrom = resolve(\n        `.tshy-build/${d}`,\n        relative(resolve('src'), resolve(override)),\n      ).replace(/\\.cts$/, '')\n      const stemTo = resolve(\n        `.tshy-build/${d}`,\n        relative(resolve('src'), resolve(orig)),\n      ).replace(/\\.tsx?$/, '')\n      const stemToPath = `${stemTo}.js.map`\n      const stemToDtsPath = `${stemTo}.d.ts.map`\n      ifExist.unlink(stemToPath)\n      ifExist.unlink(stemToDtsPath)\n      ifExist.rename(`${stemFrom}.cjs`, `${stemTo}.js`)\n      ifExist.rename(`${stemFrom}.d.cts`, `${stemTo}.d.ts`)\n    }\n    console.error(chalk.cyan.bold('built commonjs'))\n  }\n  setFolderDialect('src')\n}\n", "import chalk from 'chalk'\nimport { writeFileSync } from 'fs'\nimport { rimrafSync } from 'rimraf'\nimport * as console from './console.js'\nimport getImports from './built-imports.js'\nimport pkg from './package.js'\nimport { Dialect } from './types.js'\n\nconst writeDialectPJ = (d: string, mode?: Dialect) => {\n  if (!mode) {\n    return rimrafSync(`${d}/package.json`)\n  }\n  const v: { type: string; imports?: Record<string, any> } = {\n    type: mode === 'commonjs' ? 'commonjs' : 'module',\n    imports: getImports(pkg),\n  }\n  writeFileSync(`${d}/package.json`, JSON.stringify(v, null, 2) + '\\n')\n}\n\nexport default (where: string, mode?: Dialect) => {\n  if (mode) console.debug(chalk.cyan.dim('set dialect'), { where, mode })\n  writeDialectPJ(where, mode)\n}\n", "// merge tshy.imports with package.json imports\n\nimport { Package } from './types.js'\n\n// strip the ./src/ and turn ts extension into js for built imports\n// leave unbuilt imports alone, they'll be symlinked\nexport default (pkg: Package): Package['imports'] => {\n  const { imports } = pkg\n  if (!imports) return undefined\n  return Object.fromEntries(\n    Object.entries(imports).map(([k, v]) => [\n      k,\n      typeof v === 'string' && v.startsWith('./src/') ?\n        './' +\n        v\n          .substring('./src/'.length)\n          .replace(/\\.([cm]?)ts$/, '.$1js')\n          .replace(/\\.tsx$/, '.js')\n      : v,\n    ]),\n  )\n}\n", "import chalk from 'chalk'\nimport { mkdirpSync } from 'mkdirp'\nimport {\n  existsSync,\n  readdirSync,\n  unlinkSync,\n  writeFileSync,\n} from 'node:fs'\nimport { resolve } from 'node:path'\nimport { join } from 'node:path/posix'\nimport * as console from './console.js'\n\n// the commonjs build needs to exclude anything that will be polyfilled\nimport config from './config.js'\nimport polyfills from './polyfills.js'\nimport preventVerbatimModuleSyntax from './prevent-verbatim-module-syntax.js'\nimport readTypescriptConfig from './read-typescript-config.js'\n\nconst {\n  dialects = ['esm', 'commonjs'],\n  esmDialects = [],\n  commonjsDialects = [],\n  exclude = [],\n} = config\n\nconst relativeExclude = exclude.map(e => `../${e.replace(/^\\.\\//, '')}`)\n\nconst recommended: Record<string, any> = {\n  compilerOptions: {\n    declaration: true,\n    declarationMap: true,\n    esModuleInterop: true,\n    forceConsistentCasingInFileNames: true,\n    inlineSources: true,\n    jsx: 'react',\n    module: 'nodenext',\n    moduleResolution: 'nodenext',\n    noUncheckedIndexedAccess: true,\n    resolveJsonModule: true,\n    skipLibCheck: true,\n    sourceMap: true,\n    strict: true,\n    target: 'es2022',\n  },\n}\n\nconst build = (): Record<string, any> => ({\n  extends:\n    config.project === undefined ?\n      '../tsconfig.json'\n    : join('..', config.project),\n  compilerOptions: {\n    target:\n      readTypescriptConfig().compilerOptions.target === undefined ?\n        'es2022'\n      : undefined,\n    rootDir: '../src',\n    module: 'nodenext',\n    moduleResolution: 'nodenext',\n  },\n})\n\nconst commonjs = (dialect: string): Record<string, any> => {\n  const exclude = [\n    ...relativeExclude,\n    '../src/**/*.mts',\n    '../src/package.json',\n  ]\n  for (const [d, pf] of polyfills) {\n    if (d === dialect) continue\n    for (const f of pf.map.keys()) {\n      exclude.push(`../${join(f)}`)\n    }\n  }\n  return {\n    extends: './build.json',\n    include: [\n      '../src/**/*.ts',\n      '../src/**/*.cts',\n      '../src/**/*.tsx',\n      '../src/**/*.json',\n    ],\n    exclude,\n    compilerOptions: {\n      outDir:\n        '../.tshy-build/' + (dialect === 'cjs' ? 'commonjs' : dialect),\n    },\n  }\n}\n\nconst esm = (dialect: string): Record<string, any> => {\n  const exclude: string[] = [...relativeExclude, '../src/package.json']\n  for (const [d, pf] of polyfills) {\n    if (d === dialect) continue\n    for (const f of pf.map.keys()) {\n      exclude.push(`../${f.replace(/^\\.\\//, '')}`)\n    }\n  }\n  return {\n    extends: './build.json',\n    include: [\n      '../src/**/*.ts',\n      '../src/**/*.mts',\n      '../src/**/*.tsx',\n      '../src/**/*.json',\n    ],\n    exclude,\n    compilerOptions: {\n      outDir: '../.tshy-build/' + dialect,\n    },\n  }\n}\n\nmkdirpSync('.tshy')\nconst writeConfig = (name: string, data: Record<string, any>) =>\n  writeFileSync(`.tshy/${name}.json`, JSON.stringify(data, null, 2) + '\\n')\n\nconsole.debug(chalk.cyan.dim('writing tsconfig files...'))\nif (config.project === undefined && !existsSync('tsconfig.json')) {\n  console.debug('using recommended tsconfig.json')\n  writeConfig('../tsconfig', recommended)\n} else {\n  if (dialects.length > 1) preventVerbatimModuleSyntax()\n  console.debug('using existing tsconfig.json')\n}\nfor (const f of readdirSync('.tshy')) {\n  unlinkSync(resolve('.tshy', f))\n}\nwriteConfig('build', build())\nif (dialects.includes('commonjs')) {\n  writeConfig('commonjs', commonjs('cjs'))\n  for (const d of commonjsDialects) {\n    writeConfig(d, commonjs(d))\n  }\n}\nif (dialects.includes('esm')) {\n  writeConfig('esm', esm('esm'))\n  for (const d of esmDialects) {\n    writeConfig(d, esm(d))\n  }\n}\n", "// the modules like -cjs.cts that override a module at .ts\nimport chalk from 'chalk'\nimport config from './config.js'\nimport * as console from './console.js'\nimport sources from './sources.js'\n\nconst { esmDialects = [], commonjsDialects = [] } = config\n\nexport class PolyfillSet {\n  type: 'esm' | 'commonjs'\n  name: string\n  map = new Map<string, string>()\n  constructor(type: 'esm' | 'commonjs', name: string) {\n    this.type = type\n    this.name = name\n  }\n  addFile(f: string, sources: Set<string>) {\n    const dotts = this.type === 'commonjs' ? 'cts' : 'mts'\n    const ending = `-${this.name}.${dotts}`\n    if (!f.endsWith(ending)) return\n    const ts = f.substring(0, f.length - ending.length) + '.ts'\n    const tsx = ts + 'x'\n    if (sources.has(ts)) this.map.set(f, ts)\n    else if (sources.has(tsx)) this.map.set(f, tsx)\n  }\n  [Symbol.for('nodejs.util.inspect.custom')]() {\n    return [this.name, this.map]\n  }\n}\n\nconst polyfills = new Map<string, PolyfillSet>([\n  ['cjs', new PolyfillSet('commonjs', 'cjs')],\n])\nfor (const d of commonjsDialects)\n  polyfills.set(d, new PolyfillSet('commonjs', d))\nfor (const d of esmDialects) polyfills.set(d, new PolyfillSet('esm', d))\n\nfor (const f of sources) {\n  for (const pf of polyfills.values()) {\n    pf.addFile(f, sources)\n  }\n}\n\n// delete any polyfill types that have no entries\nfor (const [name, pf] of polyfills.entries()) {\n  if (pf.map.size === 0) polyfills.delete(name)\n}\n\nif (polyfills.size) {\n  console.debug(chalk.cyan.dim('polyfills detected'), polyfills)\n}\n\nexport default polyfills\n", "// read the actual configuration that tsc is using\n// reimplemented in this way to avoid pulling in the massive pile\n// of CommonJS that is the typescript module, since we really do not\n// need most of the logic that it (reasonably) applies when parsing\n// configs, just for our purposes.\nimport { dirname, isAbsolute, resolve } from 'node:path'\nimport config from './config.js'\nimport type { ParsedCommandLine } from 'typescript'\nimport { readFileSync, statSync } from 'node:fs'\nimport { walkUp } from 'walk-up-path'\nimport JSON from 'jsonc-simple-parser'\n\nconst isFile = (f: string) => {\n  try {\n    return statSync(f).isFile()\n  } catch {\n    return false\n  }\n}\n\nlet parsedTsConfig: Record<string, any> & {\n  compilerOptions: ParsedCommandLine['options']\n}\nexport default () => {\n  const configPath = config.project ?? 'tsconfig.json'\n  return (parsedTsConfig ??= parseTsConfig(resolveConfig(configPath)))\n}\n\nconst resolveConfig = (\n  target: string,\n  from: string = process.cwd(),\n): string => {\n  if (isAbsolute(target)) return target\n  let local = resolve(from, target)\n  if (!isFile(local) && isFile(local + '.json')) local += '.json'\n  if (\n    isFile(local) ||\n    target.startsWith('.\\\\') ||\n    target.startsWith('./')\n  ) {\n    return local\n  }\n\n  // starts with a package name?\n  for (const p of walkUp(from)) {\n    const found = resolve(p, 'node_modules', target)\n    if (isFile(found)) return found\n    const pre = resolve(p, 'node_modules', target)\n    const foundTsconfig = resolve(pre, 'tsconfig.json')\n    if (isFile(foundTsconfig)) return foundTsconfig\n    if (isFile(pre + '.json')) return pre + '.json'\n  }\n\n  throw new Error('Could not resolve tsconfig file location', {\n    cause: {\n      target,\n      from,\n    },\n  })\n}\n\nconst applyExtends = (\n  data: Record<string, any>,\n  base: Record<string, any>,\n) => {\n  for (const [key, val] of Object.entries(base)) {\n    if (typeof val !== 'object' || Array.isArray(val)) {\n      data[key] ??= val\n    } else if (!(key in data)) {\n      data[key] = val\n    } else if (\n      typeof data[key] === 'object' &&\n      !Array.isArray(data[key])\n    ) {\n      data[key] = applyExtends(data[key], val)\n    }\n  }\n  return data\n}\n\nconst parseTsConfig = (configPath: string, seen = new Set<string>()) => {\n  try {\n    const data = JSON.parse(\n      readFileSync(resolveConfig(configPath), 'utf8'),\n    )\n    if (!data || typeof data !== 'object' || Array.isArray(data)) {\n      throw new Error('invalid data, expected object', {\n        cause: data,\n      })\n    }\n    if (!data.compilerOptions) data.compilerOptions = {}\n    if (typeof data.extends === 'string') {\n      const ext = resolveConfig(data.extends, dirname(configPath))\n      if (!seen.has(ext)) {\n        seen.add(ext)\n        applyExtends(data, parseTsConfig(ext, seen))\n      }\n    }\n    return data\n  } catch (e) {\n    throw new Error('Invalid tsconfig file', { cause: e })\n  }\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", "/* IMPORT */\n/* MAIN */\nconst detokenize = (token) => {\n    if ('source' in token)\n        return token.source;\n    return token.children.map(detokenize).join('');\n};\n/* EXPORT */\nexport default detokenize;\n", "/* MAIN */\nconst Context = {\n    /* VARIABLES */\n    offset: 0,\n    offsetMax: Infinity,\n    /* API */\n    init: (limit = Infinity) => {\n        Context.offset = 0;\n        Context.offsetMax = limit;\n    }\n};\n/* EXPORT */\nexport default Context;\n", "const _state = 'state';\nconst _node = 'node';\nconst _match = 'x';\n\nfunction js(/* arguments */) {\n  let body = arguments[0][0];\n  for (let i = 1; i < arguments.length; i++)\n    body = body + arguments[i] + arguments[0][i];\n  return body.trim();\n}\n\nconst copy = (prev) => {\n  const next = {};\n  for (const key in prev) next[key] = prev[key];\n  return next;\n};\n\nconst assignIndex = (depth) => js`\n  var y${depth} = ${_state}.y,\n      x${depth} = ${_state}.x;\n`;\n\nconst restoreIndex = (depth) => js`\n  ${_state}.y = y${depth};\n  ${_state}.x = x${depth};\n`;\n\nconst astExpression = (ast, depth, opts) => {\n  const capture = !!opts.capture && !ast.capture;\n  const restoreLength =\n    (opts.length && opts.abort && js`${_node}.length = ln${opts.length};`) ||\n    '';\n  const condition = `(${_match} = ${ast.expression.id}(${_state})) ${\n    capture ? '!=' : '=='\n  } null`;\n  return js`\n    if (${condition}) ${\n    capture\n      ? js`{\n      ${_node}.push(${_match});\n    } else `\n      : ''\n  }{\n      ${restoreIndex(opts.index)}\n      ${restoreLength}\n      ${opts.abort}\n    }\n  `;\n};\n\nconst astGroup = (ast, depth, opts) => {\n  const capture = !!opts.capture && !ast.capture;\n\n  opts = copy(opts);\n  opts.capture = capture;\n\n  if (!opts.length && capture) {\n    opts.length = depth;\n    return js`\n      ${js`var ln${depth} = ${_node}.length;`}\n      ${astSequence(ast.sequence, depth + 1, opts)}\n    `;\n  }\n\n  return astSequence(ast.sequence, depth + 1, opts);\n};\n\nconst astChild = (ast, depth, opts) =>\n  ast.expression ? astExpression(ast, depth, opts) : astGroup(ast, depth, opts);\n\nconst astQuantifier = (ast, depth, opts) => {\n  const { index, abort } = opts;\n  const invert = `inv_${depth}`;\n  const group = `group_${depth}`;\n\n  opts = copy(opts);\n  if (ast.capture === '!') {\n    opts.index = depth;\n    opts.abort = js`break ${invert}`;\n  }\n\n  let child;\n  if (ast.quantifier === '+') {\n    const starAst = copy(ast);\n    starAst.quantifier = '*';\n    child = js`\n      ${astChild(ast, depth, opts)}\n      ${astQuantifier(starAst, depth, opts)}\n    `;\n  } else if (ast.quantifier === '*') {\n    opts.length = 0;\n    opts.index = depth;\n    opts.abort = js`break ${group};`;\n\n    child = js`\n      ${group}: for (;;) {\n        ${assignIndex(depth)}\n        ${astChild(ast, depth, opts)}\n      }\n    `;\n  } else if (ast.quantifier === '?' && ast.expression) {\n    opts.index = depth;\n    opts.abort = '';\n\n    child = js`\n      ${assignIndex(depth)}\n      ${astChild(ast, depth, opts)}\n    `;\n  } else if (ast.quantifier === '?') {\n    opts.index = depth;\n    opts.abort = js`break ${group}`;\n\n    child = js`\n      ${group}: {\n        ${assignIndex(depth)}\n        ${astChild(ast, depth, opts)}\n      }\n    `;\n  } else {\n    child = astChild(ast, depth, opts);\n  }\n\n  if (ast.capture === '!') {\n    return js`\n      ${invert}: {\n        ${assignIndex(depth)}\n        ${child}\n        ${restoreIndex(index)}\n        ${abort}\n      }\n    `;\n  } else if (ast.capture === '=') {\n    return js`\n      ${assignIndex(depth)}\n      ${child}\n      ${restoreIndex(depth)}\n    `;\n  } else {\n    return child;\n  }\n};\n\nconst astSequence = (ast, depth, opts) => {\n  const alternation = ast.alternation ? `alt_${depth}` : '';\n\n  let body = '';\n  for (; ast; ast = ast.alternation) {\n    const block = `block_${depth}`;\n\n    let childOpts = opts;\n    if (ast.alternation) {\n      childOpts = copy(opts);\n      childOpts.index = depth;\n      childOpts.abort = js`break ${block};`;\n    }\n\n    let sequence = '';\n    for (let i = 0; i < ast.length; i++)\n      sequence += astQuantifier(ast[i], depth, childOpts);\n\n    if (!ast.alternation) {\n      body += sequence;\n    } else {\n      body += js`\n        ${block}: {\n          ${assignIndex(depth)}\n          ${sequence}\n          break ${alternation};\n        }\n      `;\n    }\n  }\n\n  if (!alternation) return body;\n\n  return js`\n    ${alternation}: {\n      ${body}\n    }\n  `;\n};\n\nconst astRoot = (ast, name, transform) => {\n  return js`\n    (function (${_state}) {\n      ${assignIndex(1)}\n      var ${_node} = [];\n      var ${_match};\n\n      ${astSequence(ast, 2, {\n        index: 1,\n        length: 0,\n        abort: js`return;`,\n        capture: true,\n      })}\n\n      if (${name}) ${_node}.tag = ${name};\n      return ${transform ? js`(${transform})(${_node})` : _node};\n    })\n  `;\n};\n\nexport { astRoot };\n", "const syntaxError = (char) => {\n  throw new SyntaxError('Unexpected token \"' + char + '\"');\n};\n\nexport const parse = (quasis, expressions) => {\n  let quasiIndex = 0;\n  let stackIndex = 0;\n\n  const sequenceStack = [];\n  const rootSequence = [];\n\n  let currentGroup = null;\n  let lastMatch;\n  let currentSequence = rootSequence;\n  let capture;\n\n  for (\n    let quasiIndex = 0, stackIndex = 0;\n    stackIndex < quasis.length + expressions.length;\n    stackIndex++\n  ) {\n    if (stackIndex % 2 !== 0) {\n      const expression = expressions[stackIndex++ >> 1];\n      currentSequence.push({ expression, capture });\n      capture = undefined;\n    }\n\n    const quasi = quasis[stackIndex >> 1];\n    for (quasiIndex = 0; quasiIndex < quasi.length; ) {\n      const char = quasi[quasiIndex++];\n      if (char === ' ' || char === '\\t' || char === '\\r' || char === '\\n') {\n      } else if (char === '|' && currentSequence.length) {\n        currentSequence = currentSequence.alternation = [];\n      } else if (char === ')' && currentSequence.length) {\n        currentGroup = null;\n        currentSequence = sequenceStack.pop();\n        if (!currentSequence) syntaxError(char);\n      } else if (char === '(') {\n        sequenceStack.push(currentSequence);\n        currentSequence.push((currentGroup = { sequence: [], capture }));\n        currentSequence = currentGroup.sequence;\n        capture = undefined;\n      } else if (char === ':' || char === '=' || char === '!') {\n        capture = char;\n        const nextChar = quasi[quasiIndex];\n        if (quasi[quasiIndex] && quasi[quasiIndex] !== '(') syntaxError(char);\n      } else if (char === '?' && !currentSequence.length && currentGroup) {\n        capture = quasi[quasiIndex++];\n        if (capture === ':' || capture === '=' || capture === '!') {\n          currentGroup.capture = capture;\n          capture = undefined;\n        } else {\n          syntaxError(char);\n        }\n      } else if (\n        (char === '?' || char === '+' || char === '*') &&\n        (lastMatch = currentSequence[currentSequence.length - 1])\n      ) {\n        lastMatch.quantifier = char;\n      } else {\n        syntaxError(char);\n      }\n    }\n  }\n\n  return rootSequence;\n};\n", "import { astRoot } from './codegen';\nimport { parse as parseDSL } from './parser';\n\nconst isStickySupported = typeof /./g.sticky === 'boolean';\n\nconst execLambda = (pattern) => {\n  if (pattern.length) return pattern;\n  return (state) => pattern()(state);\n};\n\nconst execString = (pattern) => {\n  return (state) => {\n    if (state.x < state.quasis.length) {\n      const input = state.quasis[state.x];\n      for (let i = 0, l = pattern.length; i < l; i++)\n        if (input.charCodeAt(state.y + i) !== pattern.charCodeAt(i))\n          return null;\n      state.y += pattern.length;\n      return pattern;\n    }\n  };\n};\n\nconst execRegex = (pattern) => {\n  pattern = isStickySupported\n    ? new RegExp(pattern.source, 'y')\n    : new RegExp(pattern.source + '|()', 'g');\n  return (state) => {\n    if (state.x < state.quasis.length) {\n      const input = state.quasis[state.x];\n      pattern.lastIndex = state.y;\n      let match;\n      if (isStickySupported) {\n        if (pattern.test(input))\n          match = input.slice(state.y, pattern.lastIndex);\n      } else {\n        const x = pattern.exec(input);\n        if (x[1] == null) match = x[0];\n      }\n\n      state.y = pattern.lastIndex;\n      return match;\n    }\n  };\n};\n\nexport const __pattern = (input) => {\n  if (typeof input === 'function') {\n    return execLambda(input);\n  } else if (typeof input === 'string') {\n    return execString(input);\n  } else {\n    return execRegex(input);\n  }\n};\n\nexport const interpolation = (predicate) => (state) => {\n  let match;\n\n  if (\n    state.x < state.expressions.length &&\n    state.y >= state.quasis[state.x].length\n  ) {\n    state.y = 0;\n    match = state.expressions[state.x++];\n    if (predicate && match) match = predicate(match);\n  }\n\n  return match;\n};\n\nexport const parse = (matcher) => (quasis, ...expressions) => {\n  if (typeof quasis === 'string') quasis = [quasis];\n  const state = { quasis, expressions, x: 0, y: 0 };\n  return matcher(state);\n};\n\nexport const match = (name, transform) => (quasis, ...expressions) => {\n  const ast = parseDSL(\n    quasis,\n    expressions.map((_, i) => ({ id: `_${i}` }))\n  );\n  return new Function(\n    '_n,_t,' + expressions.map((_expression, i) => `_${i}`).join(','),\n    'return ' + astRoot(ast, '_n', transform ? '_t' : null)\n  )(name, transform, ...expressions.map(__pattern));\n};\n", "/* IMPORT */\nimport { match } from 'reghex';\n/* MAIN */\nconst Utils = {\n    /* VARIABLES */\n    tokenDelimiterTypes: new Set(['ArrayOpen', 'ArrayClose', 'ObjectOpen', 'ObjectClose']),\n    tokenIgnoredTypes: new Set(['Newline', 'Whitespace', 'CommentLine', 'CommentBlock', 'Comma', 'CommaTrailing', 'Colon']),\n    tokenLiteralTypes: new Set(['Null', 'True', 'False', 'Number', 'String', 'Array', 'Object']),\n    /* API */\n    isEven: (number) => {\n        return !(number % 2);\n    },\n    isOdd: (number) => {\n        return !Utils.isEven(number);\n    },\n    isString: (value) => {\n        return typeof value === 'string';\n    },\n    isToken: (value) => {\n        return !Utils.isString(value);\n    },\n    isTokenDelimiter: (token) => {\n        return Utils.tokenDelimiterTypes.has(token.type);\n    },\n    isTokenIgnored: (token) => {\n        return Utils.tokenIgnoredTypes.has(token.type);\n    },\n    isTokenLiteral: (token) => {\n        return Utils.tokenLiteralTypes.has(token.type);\n    },\n    tokens2matchers: (tokens) => {\n        const cache = new Map();\n        return Object.keys(tokens).reduce((acc, type) => {\n            const transformer = tokens[type];\n            const matcher = transformer.unwrapped ? transformer : cache.get(transformer) || match(type, transformer);\n            cache.set(transformer, matcher);\n            acc[type] = matcher;\n            return acc;\n        }, {});\n    }\n};\n/* EXPORT */\nexport default Utils;\n", "/* IMPORT */\nimport Utils from '../utils.js';\n/* MAIN */\nconst grammar = (tokens) => {\n    /* MATCHERS */\n    const $ = Utils.tokens2matchers(tokens);\n    /* EARLY RETURN */\n    const EarlyReturn = $.EarlyReturn `${''}`;\n    /* INSUFFICIENT */\n    const Insufficient = $.Insufficient `${/[^]?/}`;\n    /* INVALID */\n    const Invalid = $.Invalid `${/[^]/}`;\n    /* TRIVIA */\n    const Newline = $.Newline `${/\\r?\\n|\\r/}`;\n    const Whitespace = $.Whitespace `${/[ \\t]+/}`;\n    const CommentLine = $.CommentLine `${/\\/\\/.*/}`;\n    const CommentBlock = $.CommentBlock `${/\\/\\*[^]*?\\*\\//}`;\n    const Trivia = $.Passthrough `${Newline} | ${Whitespace} | ${CommentLine} | ${CommentBlock}`;\n    /* _ */\n    const _Separated = $.Passthrough `${Trivia}*`;\n    const _Merged = $.Whitespace `${/(?:[ \\t\\r\\n]|\\/\\/.*|\\/\\*[^]*?\\*\\/)*/}`;\n    const _ = $.Newline === $.Whitespace && $.Whitespace === $.CommentLine && $.CommentLine === $.CommentBlock ? _Merged : _Separated;\n    /* COMMA */\n    const Comma = $.Comma `${','}`;\n    const CommaTrailing = $.CommaTrailing `${','}`;\n    /* COLON */\n    const Colon = $.Colon `${':'}`;\n    /* NULL */\n    const Null = $.Null `${'null'}`;\n    /* BOOLEAN */\n    const True = $.True `${'true'}`;\n    const False = $.False `${'false'}`;\n    const Boolean = $.Passthrough `${True} | ${False}`;\n    /* NUMBER */\n    const Number = $.Number `${/-?(?:0|[1-9]\\d*)(?:\\.\\d+)?(?:[eE][-+]?\\d+)?/}`;\n    /* STRING */\n    const String = $.String `${/\"(?:[^\\u0000-\\u001F\\\\\"]|\\\\[\"bfnrt\\\\/]|\\\\u[0-9a-fA-F]{4})*\"/}`;\n    /* ARRAY */\n    const ArrayOpen = $.ArrayOpen `${'['}`;\n    const ArrayClose = $.ArrayClose `${']'}`;\n    const ArrayMember = $.Passthrough `${_} ${() => Literal} ${_}`;\n    const ArrayMembers = $.Passthrough `${ArrayMember} (!${EarlyReturn} ${Comma} ${ArrayMember})* ${CommaTrailing}?`;\n    const Array = $.Array `${ArrayOpen} ${_} ${ArrayMembers}? ${_} (${EarlyReturn} | ${ArrayClose})`;\n    /* OBJECT */\n    const ObjectOpen = $.ObjectOpen `${'{'}`;\n    const ObjectClose = $.ObjectClose `${'}'}`;\n    const ObjectMember = $.Passthrough `${_} ${String} (${EarlyReturn} | ${_} ${Colon} ${_} ${() => Literal} ${_})`;\n    const ObjectMembers = $.Passthrough `${ObjectMember} (!${EarlyReturn} ${Comma} ${ObjectMember})* ${CommaTrailing}?`;\n    const Object = $.Object `${ObjectOpen} ${_} ${ObjectMembers}? ${_} (${EarlyReturn} | ${ObjectClose})`;\n    /* LITERAL */\n    const Literal = $.Passthrough `${Null} | ${Boolean} | ${Number} | ${String} | ${Object} | ${Array}`;\n    /* ROOT */\n    const Root = $.Root `${_} (${Literal} | ${Insufficient}) (${EarlyReturn} | ${_} ${Invalid}?)`;\n    /* RETURN */\n    return Root;\n};\n/* EXPORT */\nexport default grammar;\n", "/* IMPORT */\nimport Utils from '../utils.js';\nimport Context from './context.js';\n/* HELPERS */\nconst makeChild = (type) => (values) => {\n    const source = values[0];\n    Context.offset += source.length;\n    return { type, source };\n};\nconst makeParent = (type) => (values) => {\n    const children = values.flat();\n    return { type, children };\n};\n/* MAIN */\nconst Tokens = {\n    EarlyReturn: () => {\n        if (Context.offset > Context.offsetMax)\n            return [];\n    },\n    Insufficient: (values) => {\n        if (values[0].length)\n            Tokens.Invalid(values);\n        throw new SyntaxError('Unexpected end of JSONC input');\n    },\n    Invalid: (values) => {\n        throw new SyntaxError(`Unexpected token ${values[0]} in JSONC at position ${Context.offset}`);\n    },\n    Passthrough: (values) => {\n        return values.flat().filter(Utils.isToken);\n    },\n    Newline: makeChild('Newline'),\n    Whitespace: makeChild('Whitespace'),\n    CommentLine: makeChild('CommentLine'),\n    CommentBlock: makeChild('CommentBlock'),\n    Comma: makeChild('Comma'),\n    CommaTrailing: makeChild('CommaTrailing'),\n    Colon: makeChild('Colon'),\n    Null: makeChild('Null'),\n    True: makeChild('True'),\n    False: makeChild('False'),\n    Number: makeChild('Number'),\n    String: makeChild('String'),\n    ArrayOpen: makeChild('ArrayOpen'),\n    ArrayClose: makeChild('ArrayClose'),\n    Array: makeParent('Array'),\n    ObjectOpen: makeChild('ObjectOpen'),\n    ObjectClose: makeChild('ObjectClose'),\n    Object: makeParent('Object'),\n    Root: makeParent('Root')\n};\n/* EXPORT */\nexport default Tokens;\n", "/* IMPORT */\nimport Context from '../tokenize/context.js';\nimport TokenizeTokens from '../tokenize/tokens.js';\n/* HELPERS */\nconst Delete = (values) => {\n    Context.offset += values[0].length;\n    return '';\n};\nconst Passthrough = (values) => {\n    const source = values.join('');\n    Context.offset += source.length;\n    return source;\n};\nconst Unwrapped = (quasis, token) => {\n    return token;\n};\nUnwrapped.unwrapped = true;\n/* MAIN */\nconst Tokens = {\n    ...TokenizeTokens,\n    Passthrough,\n    Newline: Delete,\n    Whitespace: Delete,\n    CommentLine: Delete,\n    CommentBlock: Delete,\n    Comma: Unwrapped,\n    CommaTrailing: Delete,\n    Colon: Unwrapped,\n    Null: Unwrapped,\n    True: Unwrapped,\n    False: Unwrapped,\n    Number: Unwrapped,\n    String: Unwrapped,\n    ArrayOpen: Unwrapped,\n    ArrayClose: Unwrapped,\n    Array: Passthrough,\n    ObjectOpen: Unwrapped,\n    ObjectClose: Unwrapped,\n    Object: Passthrough,\n    Root: Passthrough\n};\n/* EXPORT */\nexport default Tokens;\n", "/* IMPORT */\nimport { parse } from 'reghex';\nimport grammar from '../tokenize/grammar.js';\nimport tokens from './tokens.js';\n/* MAIN */\nconst parser = parse(grammar(tokens));\n/* EXPORT */\nexport default parser;\n", "/* IMPORT */\nimport Context from '../tokenize/context.js';\nimport parser from './parser.js';\n/* MAIN */\nconst strip = (text) => {\n    Context.init();\n    return parser(text);\n};\n/* EXPORT */\nexport default strip;\n", "/* IMPORT */\nimport strip from './strip/index.js';\n/* HELPERS */\nconst _parse = JSON.parse;\n/* MAIN */\nconst parse = (text, reviver) => {\n    text = `${text}`; // \"text\" can actually be anything, but we need a string here\n    if (reviver) { // A \"reviver\" could have side effects, it may not be safe to call it twice\n        return _parse(strip(text), reviver);\n    }\n    else {\n        try { // Shortcut in case there are no comments or trailing commas\n            return _parse(text);\n        }\n        catch (error) { // Stripping out any potential comments and trailing commas and trying again\n            const textStripped = strip(text);\n            if (text === textStripped) { // Parsing it again would inevitably lead to the same error\n                throw error;\n            }\n            else {\n                return _parse(textStripped);\n            }\n        }\n    }\n};\n/* EXPORT */\nexport default parse;\n", "/* IMPORT */\nimport { parse } from 'reghex';\nimport grammar from './grammar.js';\nimport tokens from './tokens.js';\n/* MAIN */\nconst parser = parse(grammar(tokens));\n/* EXPORT */\nexport default parser;\n", "/* IMPORT */\nimport Context from './context.js';\nimport parser from './parser.js';\n/* MAIN */\nconst tokenize = (text, limit) => {\n    Context.init(limit);\n    return parser(text);\n};\n/* EXPORT */\nexport default tokenize;\n", "/* IMPORT */\nimport detokenize from './detokenize.js';\nimport parse from './parse.js';\nimport tokenize from './tokenize/index.js';\nimport Utils from './utils.js';\n/* MAIN */\n//FIXME: This is wonky, it should be much more robust, it should probably be rewritten from scratch\nconst getLookupToken = (ast, position) => {\n    let tokenPosition = null;\n    let offsetCurrent = 0;\n    const checkPositionToken = (token) => {\n        if (token.start > position)\n            return;\n        if (token.end <= (position - 1))\n            return;\n        if (tokenPosition && Utils.isTokenLiteral(tokenPosition))\n            return;\n        if (tokenPosition && Utils.isTokenIgnored(token))\n            return;\n        tokenPosition = token;\n    };\n    const parseChild = (token, parent, depth, index) => {\n        const { type, source } = token;\n        const start = offsetCurrent;\n        const end = (offsetCurrent += source.length);\n        const ltoken = { type, source, token, parent, depth, index, start, end };\n        checkPositionToken(ltoken);\n        return ltoken;\n    };\n    const parseParent = (token, parent, depth, index) => {\n        const { type } = token;\n        const ltoken = { type, children: [], token, parent, depth, index };\n        ltoken.children = token.children.map((child, index) => parseToken(child, ltoken, depth + 1, index)).filter(Utils.isTokenLiteral);\n        ltoken.children.forEach((token, index) => token.index = index);\n        return ltoken;\n    };\n    const parseToken = (token, parent, depth, index) => {\n        if ('children' in token)\n            return parseParent(token, parent, depth, index);\n        return parseChild(token, parent, depth, index);\n    };\n    parseToken(ast, null, -1, -1);\n    return tokenPosition;\n};\nconst getLookupPath = (token) => {\n    if (!token)\n        return [];\n    const path = [];\n    while (token) {\n        const parent = token.parent;\n        if (!parent)\n            break;\n        if (Utils.isTokenLiteral(token)) {\n            if (parent.type === 'Object') {\n                if (Utils.isEven(token.index)) {\n                    path.unshift(JSON.parse(token.source));\n                }\n                else {\n                    path.unshift(JSON.parse(parent.children[token.index - 1].source));\n                }\n            }\n            else if (parent.type === 'Array') {\n                path.unshift(token.index);\n            }\n        }\n        token = parent;\n    }\n    return path;\n};\nconst getLookupIsInsideProperty = (token) => {\n    if (!token)\n        return false;\n    const parentType = token.parent?.type;\n    if (parentType === 'Object')\n        return Utils.isTokenLiteral(token) ? Utils.isEven(token.index) : token.parent?.parent?.type === 'Array';\n    if (parentType === 'Array')\n        return Utils.isTokenLiteral(token) || token.parent?.parent?.type === 'Array';\n    return false;\n};\nconst getLookupIsInsideValue = (token) => {\n    if (!token)\n        return false;\n    const isParentEmpty = !token.parent?.children.length;\n    const parentType = token.parent?.type;\n    if (parentType === 'Object')\n        return isParentEmpty || Utils.isTokenDelimiter(token) || (Utils.isTokenLiteral(token) && Utils.isOdd(token.index));\n    if (parentType === 'Array')\n        return (token.depth > 1);\n    return false;\n};\nconst getLookupProperty = (token, isInsideProperty) => {\n    if (!isInsideProperty || !token)\n        return;\n    const parentType = token.parent?.type;\n    if (Utils.isTokenLiteral(token)) {\n        if (parentType === 'Array')\n            return token.index;\n        return parse(detokenize(token));\n    }\n    else {\n        if (parentType === 'Array')\n            return token.parent?.index;\n    }\n};\nconst getLookupValue = (token, isInsideValue, usePartialScanning) => {\n    if (!isInsideValue || !token)\n        return;\n    if (Utils.isTokenLiteral(token))\n        return parse(detokenize(token));\n    if (usePartialScanning)\n        return;\n    const { parent } = token;\n    if (!parent || !parent.token)\n        return;\n    if (parent.type !== 'Array' && parent.type !== 'Object')\n        return;\n    return parse(detokenize(parent.token));\n};\nconst lookup = (text, position, usePartialScanning = true) => {\n    const limit = usePartialScanning ? position : Infinity;\n    const ast = tokenize(text, limit);\n    const token = getLookupToken(ast, position);\n    const path = getLookupPath(token);\n    const isInsideProperty = getLookupIsInsideProperty(token);\n    const isInsideValue = getLookupIsInsideValue(token);\n    const property = getLookupProperty(token, isInsideProperty);\n    const value = getLookupValue(token, isInsideValue, usePartialScanning);\n    const t = token ? { type: token.type, start: token.start, end: token.end, source: token.source } : undefined;\n    const result = { path, property, value, token: t, isInsideProperty, isInsideValue };\n    return result;\n};\n/* EXPORT */\nexport default lookup;\n", "/* EXPORT */\nexport default JSON.stringify;\n", "/* IMPORT */\nimport parse from './parse.js';\n/* MAIN */\nconst validate = (text) => {\n    try {\n        parse(text);\n        return true;\n    }\n    catch {\n        return false;\n    }\n};\n/* EXPORT */\nexport default validate;\n", "/* IMPORT */\nimport detokenize from './detokenize.js';\nimport lookup from './lookup.js';\nimport parse from './parse.js';\nimport stringify from './stringify.js';\nimport strip from './strip/index.js';\nimport tokenize from './tokenize/index.js';\nimport validate from './validate.js';\n/* MAIN */\nconst JSONC = {\n    ast: {\n        parse: tokenize,\n        stringify: detokenize\n    },\n    lookup,\n    parse,\n    stringify,\n    strip,\n    validate\n};\n/* EXPORT */\nexport default JSONC;\n", "// prevent the use of verbatimModuleSyntax: true when\n// more than one dialect is in use, since this cannot ever\n// be made to work in a hybrid context.\n// Note: cannot just use JSON.parse, because ts config files\n// are jsonc.\nimport * as console from './console.js'\nimport fail from './fail.js'\nimport readTypescriptConfig from './read-typescript-config.js'\n\nexport default () => {\n  const config = readTypescriptConfig()\n  if (config.compilerOptions.verbatimModuleSyntax) {\n    fail('verbatimModuleSyntax detected')\n    console.error(\n      `verbatimModuleSyntax is incompatible with multi-dialect builds. Either remove\nthis field from tsconfig.json, or set a single dialect in the \"dialects\"\nfield in package.json, for example:\n\n{\n  \"tshy\": {\n    \"dialects\": [\"esm\"]\n  }\n}\n\nor\n\n{\n  \"tshy\": {\n    \"dialects\": [\"commonjs\"]\n  }\n}\n`,\n    )\n    console.print()\n    process.exit(1)\n  }\n}\n", "// this is the thing that supports top-level package.json imports\n// via symlinks, not the tshy.imports which are just config.\nimport { writeFileSync } from 'fs'\nimport { symlink } from 'fs/promises'\nimport { mkdirp } from 'mkdirp'\nimport { dirname, relative, resolve, sep } from 'path'\nimport { getAllConditionalValues } from 'resolve-import/get-all-conditional-values'\nimport { getUniqueConditionSets } from 'resolve-import/get-unique-condition-sets'\nimport { resolveAllLocalImports } from 'resolve-import/resolve-all-local-imports'\nimport { rimraf } from 'rimraf'\nimport { fileURLToPath } from 'url'\nimport * as console from './console.js'\nimport { Package } from './types.js'\n\nconst dirsMade = new Set<string>()\n\n// write out the steps to the save file script\nexport const save = (f: string): boolean => {\n  const links = [...saveSet.entries()]\n  if (!links.length) return false\n  const dirs = new Set<string>(links.map(([dest]) => dirname(dest)))\n  console.debug('save import linker', f)\n  writeFileSync(\n    f,\n    `import { mkdirSync } from 'node:fs'\nimport { symlink } from 'node:fs/promises'\nconst dirs = ${JSON.stringify([...dirs])}\nconst links = [\n${links.map(l => `  ${JSON.stringify(l)},\\n`).join('')}]\nconst e = (er) => { if (er.code !== 'EEXIST') throw er }\nfor (const d of dirs) mkdirSync(d, { recursive: true })\nPromise.all(links.map(([dest, src]) => symlink(src, dest).catch(e)))\n`,\n  )\n  return true\n}\n\nlet targets: undefined | string[] = undefined\n// Get the targets that will have to be linked, because they're not\n// a target in ./src\nconst getTargets = async (imports: Record<string, any>) => {\n  const conds = getAllConditionalValues(imports).filter(\n    c => !c.startsWith('./src/'),\n  )\n  if (!conds.some(c => c.includes('*'))) {\n    // fast path\n    return (targets = conds.filter(c => c.startsWith('./')))\n  }\n  const sets = getUniqueConditionSets(imports)\n  const t = new Set<string>()\n  const pj = resolve('package.json')\n  for (const conditions of sets) {\n    const imps = await resolveAllLocalImports(pj, { conditions })\n    for (const url of Object.values(imps)) {\n      // node builtin\n      if (typeof url === 'string') continue\n      const p = fileURLToPath(url)\n      const rel = relative(process.cwd(), p)\n      // if it's empty, a dep in node_modules, or a built module, skip\n      if (\n        !rel ||\n        rel.startsWith('..' + sep) ||\n        rel.startsWith('src' + sep) ||\n        rel.startsWith('node_modules' + sep)\n      )\n        continue\n      t.add('./' + rel.replace(/\\\\/g, '/'))\n    }\n  }\n  return (targets = [...t])\n}\n\nconst saveSet = new Map<string, string>()\n\n// create symlinks for the package imports in the target dir\nexport const link = async (pkg: Package, dir: string, save = false) => {\n  const { imports } = pkg\n  if (!imports) return\n  if (!targets) targets = await getTargets(imports)\n  if (!targets.length) return\n  console.debug(`link import targets in ${dir}`, targets)\n  const rel = relative(resolve(dir), process.cwd())\n  const lps: Promise<any>[] = []\n  for (const t of targets) {\n    const l = t.replace(/^\\.\\//, '')\n    const df = dirname(l)\n    const dfrel =\n      df === '.' ? '' : (\n        df\n          .split('/')\n          .map(() => '../')\n          .join('')\n      )\n    const dest = dir + '/' + l\n    const src = rel + '/' + dfrel + l\n    if (save) saveSet.set(dest, src)\n    lps.push(\n      mkdirp(dirname(dest))\n        .then(d => {\n          // if we aren't saving, then this is a transient link\n          // save the dirs created so that we can clean them up\n          if (!save && d) dirsMade.add(d)\n          return rimraf(dest)\n        })\n        .then(() => symlink(src, dest)),\n    )\n  }\n  await Promise.all(lps)\n}\n\n// remove symlinks created for package imports in the target dir\nexport const unlink = async (pkg: Package, dir: string) => {\n  const { imports } = pkg\n  if (!imports) return\n  // will always have targets by this point\n  /* c8 ignore start */\n  if (!targets) targets = await getTargets(imports)\n  /* c8 ignore stop */\n  console.debug(`unlink import targets in ${dir}`, targets)\n  const lps: Promise<any>[] = []\n  for (const t of targets) {\n    const dest = resolve(dir, t)\n    lps.push(rimraf(dest))\n  }\n  for (const d of dirsMade) lps.push(rimraf(d))\n  await Promise.all(lps)\n}\n", "/**\n * Exported as `'resolve-import/get-conditional-values-list'`\n * @module\n */\nimport { ConditionalValue, Exports, Imports } from './index.js'\n\nexport type ConditionalValuesList = [\n  submodulePath: string,\n  conditions: Set<string>,\n  resolvedValue: string | null,\n][]\n\n/**\n * Given an `exports` or `imports` value from a package, return the list of all\n * possible conditional values that it might potentially resolve to, for any\n * possible set of import conditions, along with the `Set<string>` of\n * conditions, any superset of which will result in the condition.\n *\n * The list includes null results, since while these are not a valid resolution\n * per se, they do *prevent* valid resolutions that match the same conditions.\n */\nexport const getConditionalValuesList = (\n  importsExports: Imports | Exports,\n): ConditionalValuesList => {\n  if (\n    !!importsExports &&\n    typeof importsExports === 'object' &&\n    !Array.isArray(importsExports)\n  ) {\n    let subs: string | undefined = undefined\n    const conditions: ConditionalValuesList = []\n    for (const [k, v] of Object.entries(importsExports)) {\n      /* c8 ignore start */\n      if (!k) continue\n      /* c8 ignore stop */\n      if (subs === undefined) {\n        if (!k.startsWith('#') && k !== '.' && !k.startsWith('./')) {\n          return getConditionalValuesListFromCond(\n            importsExports as ConditionalValue,\n          ).map(s => ['.', ...s])\n        }\n        subs = k.charAt(0)\n      }\n      if (\n        // imports have to be #<something>\n        (subs === '#' && (k === '#' || !k.startsWith('#'))) ||\n        // exports can be ./<something> or .\n        (subs === '.' && k !== '.' && !k.startsWith('./'))\n      ) {\n        throw new Error(\n          `invalid ${\n            subs === '.' ? 'exports' : 'imports'\n          } object, all keys ` + `must start with ${subs}. Found ${k}.`,\n        )\n      }\n      conditions.push(\n        ...getConditionalValuesListFromCond(v).map(\n          s => [k, ...s] as [string, Set<string>, string | null],\n        ),\n      )\n    }\n    return conditions\n  }\n  return getConditionalValuesListFromCond(\n    importsExports as ConditionalValue,\n  ).map(s => ['.', ...s])\n}\n\nconst isSubset = (maybeSub: Set<string>, sup: Set<string>) => {\n  if (maybeSub.size > sup.size) return false\n  for (const c of maybeSub) {\n    if (!sup.has(c)) return false\n  }\n  return true\n}\n\n// walk down the tree, creating a list of [Set<Condition>, value]\n// if a subset of the current set is already present in the list, then omit it\nconst getConditionalValuesListFromCond = (\n  cond?: ConditionalValue,\n  path: string[] = [], // path of conditions that got here\n  list: [Set<string>, string | null][] = [],\n): [Set<string>, string | null][] => {\n  /* c8 ignore start */\n  if (cond === undefined) return list\n  /* c8 ignore stop */\n  if (cond === null || typeof cond === 'string') {\n    // reached a resolution value.\n    // if we got here, we know it has not yet been seen.\n    list.push([new Set(path), cond])\n    return list\n  }\n  if (Array.isArray(cond)) {\n    for (const c of cond) {\n      getConditionalValuesListFromCond(c, path, list)\n      // if we hit a default condition, break\n      if (!c || typeof c === 'string') break\n    }\n    return list\n  }\n  // ConditionalValueObject\n  for (const [k, v] of Object.entries(cond)) {\n    if (k.startsWith('#') || k === '.' || k.startsWith('./')) {\n      throw new Error(`Expected valid import condition, got: ${k}`)\n    }\n    const p = k === 'default' ? path : path.concat(k)\n    // if no subset seen, then recurse\n    const ps = new Set(p)\n    const seen = list.some(([s]) => isSubset(s, ps))\n    if (!seen) {\n      getConditionalValuesListFromCond(v, p, list)\n    }\n    if (k === 'default') break\n  }\n  return list\n}\n", "/**\n * Exported as `'resolve-import/get-all-conditional-values'`\n * @module\n */\nimport { getConditionalValuesList } from './get-conditional-values-list.js'\nimport { Exports, Imports } from './index.js'\n\n/**\n * Given an `exports` or `imports` value from a package, return the list of all\n * possible conditional values that it might potentially resolve to, for any\n * possible set of import conditions.\n *\n * Filters out cases that are unreachable, such as conditions that appear after\n * a `default` value, or after a set of conditions that would have been\n * satisfied previously.\n *\n * For example:\n *\n * ```json\n * {\n *   \"import\": { \"node\": \"./x.js\" },\n *   \"node\": { \"import\": { \"blah\": \"./y.js\" } }\n * }\n * ```\n *\n * Will return `['./x.js']`, omitting the unreachable `'./y.js'`, because the\n * conditions ['import','node','blah'] would have been satisfied by the earlier\n * condition.\n *\n * Note that this does *not* mean that the target actually can be imported, as\n * it may not exist, be an incorrect module type, etc.\n *\n * Star values are not expanded. For that, use `resolveAllExports` or\n * `resolveAllLocalImports`.\n */\nexport const getAllConditionalValues = (\n  importsExports: Imports | Exports,\n): string[] => [\n  ...new Set(\n    getConditionalValuesList(importsExports)\n      .map(([_, __, c]) => c)\n      .filter(c => !!c) as string[],\n  ),\n]\n", "import { getConditionalValuesList } from './get-conditional-values-list.js'\nimport { Exports, Imports } from './index.js'\n\n/**\n * Get the minimal set of conditions that can potentially produce different\n * resolution values for a given imports or exports object from a package\n * manifest.\n *\n * For example:\n *\n * ```json\n * {\n *   \".\": [{\"import\":[{\"types\":\"x.d.ts\"},\"x.mjs\"], \"require\":\"y.js\"}]\n *   \"./a\": {\"browser\":{\"require\":\"./a.js\"}},\n *   \"./b\": {\"browser\":\"./b.js\"},\n *   \"./c\": {\"require\":{\"browser\":\"./c.js\"}}\n * }\n * ```\n *\n * would return:\n * ```js\n * [\n *   ['import','types'],\n *   ['import'],\n *   ['require'],\n *   ['browser'],\n *   ['browser', 'require'],\n * ]\n * ```\n *\n * With the `['require', 'browser']` condition set omitted, as it is already\n * covered by `['browser', 'require']`.\n *\n * Condition ordering is arbitrary and not guaranteed to be consistent.\n */\nexport const getUniqueConditionSets = (\n  importsExports: Imports | Exports,\n): string[][] => {\n  const list = getConditionalValuesList(importsExports)\n  let results: string[][] = []\n  for (const [_, conditions] of list) {\n    if (!results.some(arr => arrayIsEquivalent(arr, conditions))) {\n      results.push([...conditions])\n    }\n  }\n  return results\n}\n\nconst arrayIsEquivalent = (arr: string[], sup: Set<string>) => {\n  if (arr.length !== sup.size) return false\n  for (const c of arr) {\n    if (!sup.has(c)) return false\n  }\n  return true\n}\n", "/**\n * Exported as `'resolve-import/resolve-all-local-imports'`\n * @module\n */\nimport { dirname, resolve } from 'path'\nimport { pathToFileURL } from 'url'\nimport { invalidPackage } from './errors.js'\nimport { fileExists } from './file-exists.js'\nimport { findDepPackage } from './find-dep-package.js'\nimport { ResolveImportOpts } from './index.js'\nimport { Pkg, readPkg } from './read-pkg.js'\nimport { resolveAllExports } from './resolve-all-exports.js'\nimport { resolveConditionalValue } from './resolve-conditional-value.js'\nimport { resolveImport } from './resolve-import.js'\nimport { starGlob } from './star-glob.js'\nimport { toFileURL } from './to-file-url.js'\nimport { toPath } from './to-path.js'\nexport * from './resolve-all-local-imports-sync.js'\n\n/**\n * Given a path or file URL to a package.json file, return an object where each\n * possible local import path is mapped to the file URL that it would resolve\n * to.\n *\n * Invalid and non-resolving imports are omitted.\n */\nexport const resolveAllLocalImports = async (\n  packageJsonPath: string | URL,\n  options: ResolveImportOpts = {},\n): Promise<Record<string, string | URL>> => {\n  const pjPath = toPath(packageJsonPath)\n  const pjDir = dirname(pjPath)\n  const pjURL = toFileURL(packageJsonPath)\n\n  const pkg = await readPkg(pjPath)\n  if (!pkg) {\n    throw invalidPackage(packageJsonPath, resolveAllLocalImports)\n  }\n  const results: Record<string, URL | string> = {}\n\n  for (const [sub, target] of getNamedImportsList(pkg, options)) {\n    // if the import is local, then look it up\n    // if it's another package, then look up that package\n    // if it's another package with a *, then look up all exports\n    // of that package, and filter by the matches.\n    const parts = target.match(/^(@[^\\/]+\\/[^\\/]+|[^\\/]+)/)\n    // make internal package named modules consistently `./`\n    const name = pkg.name\n\n    // non-matches already filtered out\n    /* c8 ignore start */\n    if (!parts) continue\n    /* c8 ignore stop */\n\n    const ssub = sub.split('*')\n    const starget = target.split('*') as [string, string]\n    const star = ssub.length === 2 && starget.length === 2\n    if (!star) {\n      // simple case, no * replacement\n      // if not found, just omit it.\n      // do a full resolve, because the target can be anything like\n      // './foo/bar' or 'dep/blah', etc.\n      try {\n        results[sub] = await resolveImport(target, pjURL)\n      } catch {}\n      continue\n    }\n\n    // has a star, have to glob if it's localPath, or look up exports if not\n    const localPath = parts[1] === '.'\n    if (localPath) {\n      for (const [rep, target] of await starGlob(starget, pjDir)) {\n        results[ssub[0] + rep + ssub[1]] = pathToFileURL(target)\n      }\n      continue\n    }\n\n    const localName = parts[1] === name\n    const dep = !localPath && !localName ? parts[1] : null\n\n    // if we can't find the package, it's not valid.\n    const ppath = dep ? await findDepPackage(dep, pjDir) : pjDir\n    if (!ppath) continue\n\n    const pj = resolve(ppath, 'package.json')\n    if (!(await fileExists(pj))) {\n      continue\n    }\n\n    const allExports = await resolveAllExports(pj)\n    for (const [k, v] of Object.entries(allExports)) {\n      if (k === '.' || k === './') continue\n      const i = dep + k.substring(1)\n      if (i.startsWith(starget[0]) && i.endsWith(starget[1])) {\n        const s =\n          ssub[0] +\n          i.substring(starget[0].length, i.length - starget[1].length) +\n          ssub[1]\n        // should be impossible to throw, because we're pulling the list\n        // from the package itself, and it gets resolved at that point.\n        /* c8 ignore start */\n        try {\n          results[s] = await resolveImport(v, pjURL)\n        } catch {}\n        /* c8 ignore stop */\n      }\n    }\n  }\n\n  return results\n}\n\n/**\n * Get the condition-resolved targets of all imports\n *\n * Stars are not expanded.\n */\nconst getNamedImportsList = (\n  pkg: Pkg,\n  options: ResolveImportOpts,\n): [string, string][] => {\n  const results: [string, string][] = []\n  const { imports } = pkg\n  if (!imports || typeof imports !== 'object') return results\n  for (const [k, v] of Object.entries(imports)) {\n    const r = resolveConditionalValue(v, options)\n    if (r && !r.startsWith('#')) results.push([k, r])\n  }\n  return results\n}\n", "/**\n * Exported as `'resolve-import/resolve-import-sync'`\n * @module\n */\nimport { realpathSync } from 'node:fs'\nimport Module from 'node:module'\nimport { basename, dirname, isAbsolute, resolve } from 'node:path'\nimport { fileURLToPath, pathToFileURL } from 'node:url'\nimport {\n  moduleNotFound,\n  relativeImportWithoutParentURL,\n} from './errors.js'\nimport { fileExistsSync } from './file-exists.js'\nimport type { ResolveImportOpts } from './index.js'\nimport { isRelativeRequire } from './is-relative-require.js'\nimport { resolveDependencyExportsSync } from './resolve-dependency-export-sync.js'\nimport { resolvePackageImportSync } from './resolve-package-import-sync.js'\nimport { toFileURL } from './to-file-url.js'\nimport { toPath } from './to-path.js'\n\n// affordance for node 16 <16.17 and 18 <18.9\n/* c8 ignore start */\nif (typeof Module.isBuiltin !== 'function') {\n  Module.isBuiltin = (moduleName: string) => {\n    if (moduleName.startsWith('node:')) {\n      moduleName = moduleName.substring('node:'.length)\n    }\n    return Module.builtinModules.includes(moduleName)\n  }\n}\n/* c8 ignore stop */\n\n// It's pretty common to resolve against, eg, cwd + '/x', since we might not\n// know the actual file that it's being loaded from, and want to resolve what\n// a dep WOULD be from a given path. This allows us to realpath that directory,\n// without requiring that the file exist.\nconst realpathParentDir = (path: string | URL) => {\n  path = toPath(path)\n  return resolve(realpathSync(dirname(path)), basename(path))\n}\n\n/**\n * Resolve an import URL or string as if it were coming from the\n * module at parentURL.\n *\n * Returns a string for node builtin modules, and a file:// URL\n * object for anything resolved on disk.\n *\n * If the resolution is impossible, then an error will be raised, which\n * closely matches the errors raised by Node when failing for the same\n * reason.\n */\nexport const resolveImportSync = (\n  /** the thing being imported */\n  url: string | URL,\n  /**\n   * the place the import() would be coming from. Required for relative\n   * imports.\n   */\n  parentURL: string | URL | undefined = undefined,\n  options: ResolveImportOpts = {},\n): URL | string => {\n  // already resolved, just check that it exists\n  if (typeof url === 'string' && url.startsWith('file://')) {\n    url = new URL(url)\n  }\n  if (typeof url === 'object') {\n    if (!fileExistsSync(url)) {\n      throw moduleNotFound(String(url), String(parentURL))\n    }\n    const rp = realpathSync(toPath(url))\n    return rp !== fileURLToPath(url) ? pathToFileURL(rp) : url\n  }\n\n  const pu =\n    parentURL ? toFileURL(realpathParentDir(parentURL)) : undefined\n\n  if (isRelativeRequire(url)) {\n    if (!pu) {\n      throw relativeImportWithoutParentURL(url, parentURL)\n    }\n    const u = new URL(url, pu)\n    if (!fileExistsSync(u)) {\n      throw moduleNotFound(url, String(parentURL))\n    }\n    return pathToFileURL(realpathSync(new URL(url, pu)))\n  }\n\n  if (isAbsolute(url)) {\n    if (!fileExistsSync(url)) {\n      throw moduleNotFound(url, String(parentURL))\n    }\n    return pathToFileURL(realpathSync(url))\n  }\n\n  if (Module.isBuiltin(String(url))) {\n    return String(url)\n  }\n\n  // ok, we have to resolve it. some kind of bare dep import,\n  // either a package name resolving to module or main, or a named export.\n  const parentPath: string = toPath(\n    parentURL || resolve(realpathSync(process.cwd()), 'x'),\n  )\n  const opts = {\n    ...options,\n    originalParent: String(options.originalParent || parentPath),\n  }\n  if (url) {\n    return resolvePackageImportSync(url, parentPath, opts)\n  } else {\n    return resolveDependencyExportsSync(url, parentPath, opts)\n  }\n}\n", "import { stat } from 'node:fs/promises'\nimport { statSync } from 'node:fs'\nimport { fileURLToPath } from 'node:url'\n\nconst toPath = (p: string | URL) =>\n  typeof p === 'object' || p.startsWith('file://') ? fileURLToPath(p) : p\n\nexport const fileExists = async (f: string | URL): Promise<boolean> => {\n  try {\n    return (await stat(toPath(f))).isFile()\n  } catch (er) {\n    return false\n  }\n}\n\nexport const fileExistsSync = (f: string | URL): boolean => {\n  try {\n    return statSync(toPath(f)).isFile()\n  } catch {\n    return false\n  }\n}\n", "export const isWindows =\n  typeof process === 'object' && process && process.platform === 'win32'\n", "/**\n * Exported as `'resolve-import/is-relative-require'`\n * @module\n */\nimport { isWindows } from './is-windows.js'\nexport const isRelativeRequire = (url: string) =>\n  /^\\.\\.?\\//.test(url) || (isWindows && /^\\.\\.?\\\\/.test(url))\n", "import { realpathSync, statSync } from 'node:fs'\nimport { realpath, stat } from 'node:fs/promises'\nimport { dirname, resolve, sep } from 'node:path'\nimport { walkUp } from 'walk-up-path'\n\nconst dirExists = async (f: string): Promise<boolean> => {\n  try {\n    return (await stat(f)).isDirectory()\n  } catch {\n    return false\n  }\n}\n\nconst dirExistsSync = (f: string): boolean => {\n  try {\n    return statSync(f).isDirectory()\n  } catch {\n    return false\n  }\n}\n\nexport const findDepPackage = async (\n  pkgName: string | null,\n  parentPath: string,\n) => {\n  // starting from the dirname, try to find the nearest node_modules\n  for (const dir of walkUp(dirname(parentPath))) {\n    const nm = resolve(dir, 'node_modules') + sep\n    // if it's null, then we need the node_modules itself\n    // if it's '' then we use node_modules with an extra / on it\n    // thisis only relevant when generating the error message, since\n    // of course node_modules// is never going to be a valid package.\n    const ppath =\n      pkgName === null ? nm : (!pkgName ? nm : resolve(nm, pkgName)) + sep\n    if (await dirExists(ppath)) {\n      try {\n        return (await realpath(ppath)) + sep\n        // the direxists stat will avoid almost all throws that could\n        // occur here, but just in case.\n        /* c8 ignore start */\n      } catch {}\n      /* c8 ignore stop */\n    }\n  }\n}\n\nexport const findDepPackageSync = (\n  pkgName: string | null,\n  parentPath: string,\n) => {\n  // starting from the dirname, try to find the nearest node_modules\n  for (const dir of walkUp(dirname(parentPath))) {\n    const nm = resolve(dir, 'node_modules') + sep\n    // if it's null, then we need the node_modules itself\n    // if it's '' then we use node_modules with an extra / on it\n    // thisis only relevant when generating the error message, since\n    // of course node_modules// is never going to be a valid package.\n    const ppath =\n      pkgName === null ? nm : (!pkgName ? nm : resolve(nm, pkgName)) + sep\n    if (dirExistsSync(ppath)) {\n      try {\n        return realpathSync(ppath) + sep\n        // the direxists stat will avoid almost all throws that could\n        // occur here, but just in case.\n        /* c8 ignore start */\n      } catch {}\n      /* c8 ignore stop */\n    }\n  }\n}\n", "import { readFile } from 'node:fs/promises'\nimport { readFileSync } from 'node:fs'\n\nexport const readJSON = async (f: string): Promise<unknown> => {\n  try {\n    return JSON.parse(await readFile(f, 'utf8'))\n  } catch {\n    return null\n  }\n}\n\nexport const readJSONSync = (f: string): unknown => {\n  try {\n    return JSON.parse(readFileSync(f, 'utf8'))\n  } catch {\n    return null\n  }\n}\n", "import { Exports, Imports } from './index.js'\nimport { readJSON, readJSONSync } from './read-json.js'\n\nexport type Pkg = {\n  name?: string\n  main?: string\n  type?: string\n  module?: string\n  exports?: Exports\n  imports?: Imports\n}\n\nconst isExports = (e: any): e is Exports =>\n  !!e && (typeof e === 'object' || typeof e === 'string')\n\nconst isImports = (e: any): e is Exports => {\n  if (!e || typeof e !== 'object' || Array.isArray(e)) return false\n  for (const p in e) {\n    if (!p.startsWith('#')) return false\n  }\n  return true\n}\n\nconst isPkg = (o: any): o is Pkg =>\n  !!o &&\n  typeof o === 'object' &&\n  (typeof o.name === 'string' || typeof o.name === 'undefined') &&\n  (typeof o.main === 'string' || typeof o.main === 'undefined') &&\n  (typeof o.module === 'string' || typeof o.module === 'undefined') &&\n  (typeof o.exports === 'undefined' || isExports(o.exports)) &&\n  (typeof o.imports === 'undefined' || isImports(o.imports))\n\nconst ifPkg = (p: unknown): Pkg | null => (isPkg(p) ? p : null)\n\nexport const readPkg = async (f: string): Promise<Pkg | null> =>\n  ifPkg(await readJSON(f))\n\nexport const readPkgSync = (f: string): Pkg | null =>\n  ifPkg(readJSONSync(f))\n", "/**\n * Given an object with string keys possibly containing *, and a test\n * string, return the matching key, and the section that the star should\n * expand to when matching against the test string.\n */\nexport const findStarMatch = (\n  s: string,\n  obj: Record<string, any>,\n): [string, string] | null => {\n  // longest pattern matches take priority\n  const patterns = Object.keys(obj)\n    .filter(p => p.length <= s.length)\n    .sort((a, b) => b.length - a.length)\n    .map(p => [p, p.split('*')])\n    .filter(([, p]) => (p as string[]).length === 2) as [\n    string,\n    [string, string],\n  ][]\n\n  for (const [key, [before, after]] of patterns) {\n    if (s.startsWith(before) && s.endsWith(after)) {\n      const mid = s.substring(before.length, s.length - after.length)\n      return [key, mid]\n    }\n  }\n\n  return null\n}\n", "/**\n * Exported as `'resolve-import/resolve-conditional-value'`\n * @module\n */\nimport { ConditionalValue, ResolveImportOpts } from './index.js'\n\n/**\n * find the first match for string, import, node, or default\n * at this point, we know we're on the right subpath already\n */\nexport const resolveConditionalValue = (\n  exp: ConditionalValue,\n  options: ResolveImportOpts,\n): string | null => {\n  if (exp === null || typeof exp === 'string') return exp\n  if (Array.isArray(exp)) {\n    for (const e of exp) {\n      const r = resolveConditionalValue(e, options)\n      if (r) return r\n    }\n    return null\n  }\n\n  const conditions = new Set(['default'])\n  for (const condition of options.conditions ?? ['import', 'node']) {\n    if (condition.startsWith('!')) {\n      conditions.delete(condition.slice(1))\n    } else {\n      conditions.add(condition)\n    }\n  }\n  for (const [k, v] of Object.entries(exp)) {\n    if (conditions.has(k)) {\n      return resolveConditionalValue(v, options)\n    }\n  }\n  return null\n}\n", "import { subpathNotExported } from './errors.js'\nimport { findStarMatch } from './find-star-match.js'\nimport {\n  ConditionalValue,\n  Exports,\n  ExportsSubpaths,\n  ResolveImportOpts,\n} from './index.js'\nimport { resolveConditionalValue } from './resolve-conditional-value.js'\n\n/**\n * Resolve an export that might be a string, subpath exports, exports value\n * object, or array of strings and exports value objects\n */\nexport const resolveExport = (\n  sub: string,\n  exp: Exports,\n  pj: string,\n  from: string,\n  options: ResolveImportOpts,\n): string => {\n  const s =\n    !sub ? '.'\n    : sub === '.' || sub.startsWith('./') ? sub\n    : `./${sub}`\n\n  if (typeof exp === 'string' || Array.isArray(exp)) {\n    const res = s === '.' && resolveConditionalValue(exp, options)\n    if (!res) throw subpathNotExported(s, pj, from)\n    return res\n  }\n\n  // now it must be a set of named exports or an export value object\n  // first try to resolve as a value object, if that's allowed\n  if (s === '.') {\n    const res = resolveConditionalValue(exp, options)\n    if (res) return res\n  }\n\n  // otherwise the only way to match is with subpaths\n  const es = exp as ExportsSubpaths\n\n  // if we have an exact match, use that\n  const e = es[s]\n  if (e !== undefined) {\n    const res = resolveConditionalValue(e, options)\n    if (!res) throw subpathNotExported(s, pj, from)\n    return res\n  }\n\n  const sm = findStarMatch(s, es)\n  if (sm) {\n    const [key, mid] = sm\n    const res = resolveConditionalValue(\n      es[key] as ConditionalValue,\n      options,\n    )\n    if (!res) throw subpathNotExported(s, pj, from)\n    return res.replace(/\\*/g, mid)\n  }\n\n  // did not find a match\n  throw subpathNotExported(s, pj, from)\n}\n", "import { pathToFileURL } from 'url'\n\nexport const toFileURL = (p: string | URL): URL =>\n  typeof p === 'object' ? p\n  : p.startsWith('file://') ? new URL(p)\n  : pathToFileURL(p)\n", "import { fileURLToPath } from 'url'\n\nexport const toPath = (p: string | URL): string =>\n  typeof p === 'object' || p.startsWith('file://') ? fileURLToPath(p) : p\n", "/**\n * Exported as `'resolve-import/resolve-import'`\n * @module\n */\nimport { realpath } from 'fs/promises'\nimport Module from 'module'\nimport { basename, dirname, isAbsolute, resolve } from 'path'\nimport { fileURLToPath, pathToFileURL } from 'url'\nimport {\n  moduleNotFound,\n  relativeImportWithoutParentURL,\n} from './errors.js'\nimport { fileExists } from './file-exists.js'\nimport { ResolveImportOpts } from './index.js'\nimport { isRelativeRequire } from './is-relative-require.js'\nimport { resolveDependencyExports } from './resolve-dependency-export.js'\nimport { resolvePackageImport } from './resolve-package-import.js'\nimport { toFileURL } from './to-file-url.js'\nimport { toPath } from './to-path.js'\nexport * from './resolve-import-sync.js'\n\n// affordance for node 16 <16.17 and 18 <18.9\n/* c8 ignore start */\nif (typeof Module.isBuiltin !== 'function') {\n  Module.isBuiltin = (moduleName: string) => {\n    if (moduleName.startsWith('node:')) {\n      moduleName = moduleName.substring('node:'.length)\n    }\n    return Module.builtinModules.includes(moduleName)\n  }\n}\n/* c8 ignore stop */\n\n// It's pretty common to resolve against, eg, cwd + '/x', since we might not\n// know the actual file that it's being loaded from, and want to resolve what\n// a dep WOULD be from a given path. This allows us to realpath that directory,\n// without requiring that the file exist.\nconst realpathParentDir = async (path: string | URL) => {\n  path = toPath(path)\n  return resolve(await realpath(dirname(path)), basename(path))\n}\n\n/**\n * Resolve an import URL or string as if it were coming from the\n * module at parentURL.\n *\n * Returns a string for node builtin modules, and a file:// URL\n * object for anything resolved on disk.\n *\n * If the resolution is impossible, then an error will be raised, which\n * closely matches the errors raised by Node when failing for the same\n * reason.\n */\nexport const resolveImport = async (\n  /** the thing being imported */\n  url: string | URL,\n  /**\n   * the place the import() would be coming from. Required for relative\n   * imports.\n   */\n  parentURL: string | URL | undefined = undefined,\n  options: ResolveImportOpts = {},\n): Promise<URL | string> => {\n  // already resolved, just check that it exists\n  if (typeof url === 'string' && url.startsWith('file://')) {\n    url = new URL(url)\n  }\n  if (typeof url === 'object') {\n    if (!(await fileExists(url))) {\n      throw moduleNotFound(String(url), String(parentURL))\n    }\n    const rp = await realpath(toPath(url))\n    return rp !== fileURLToPath(url) ? pathToFileURL(rp) : url\n  }\n\n  const pu =\n    parentURL ? toFileURL(await realpathParentDir(parentURL)) : undefined\n\n  if (isRelativeRequire(url)) {\n    if (!pu) {\n      throw relativeImportWithoutParentURL(url, parentURL)\n    }\n    const u = new URL(url, pu)\n    if (!(await fileExists(u))) {\n      throw moduleNotFound(url, String(parentURL))\n    }\n    return pathToFileURL(await realpath(new URL(url, pu)))\n  }\n\n  if (isAbsolute(url)) {\n    if (!(await fileExists(url))) {\n      throw moduleNotFound(url, String(parentURL))\n    }\n    return pathToFileURL(await realpath(url))\n  }\n\n  if (Module.isBuiltin(String(url))) {\n    return String(url)\n  }\n\n  // ok, we have to resolve it. some kind of bare dep import,\n  // either a package name resolving to module or main, or a named export.\n  const parentPath: string = toPath(\n    parentURL || resolve(await realpath(process.cwd()), 'x'),\n  )\n  const opts = {\n    ...options,\n    originalParent: String(options.originalParent || parentPath),\n  }\n  if (url) {\n    return resolvePackageImport(url, parentPath, opts)\n  } else {\n    return resolveDependencyExports(url, parentPath, opts)\n  }\n}\n", "import { resolve } from 'path'\nimport { pathToFileURL } from 'url'\nimport { moduleNotFound, packageNotFound } from './errors.js'\nimport { fileExists } from './file-exists.js'\nimport { findDepPackage } from './find-dep-package.js'\nimport { ResolveImportOpts } from './index.js'\nimport { readPkg } from './read-pkg.js'\nimport { resolveExport } from './resolve-export.js'\nexport * from './resolve-dependency-export-sync.js'\n\n/**\n * Resolve a dependency like '@dep/name/sub/module' where\n * '@dep/name' is in node_modules somewhere and exports './sub/module'\n */\nexport const resolveDependencyExports = async (\n  url: string | null,\n  parentPath: string,\n  options: ResolveImportOpts & { originalParent: string },\n): Promise<URL> => {\n  const { originalParent } = options\n  const parts = url?.match(/^(@[^\\/]+\\/[^\\/]+|[^\\/]+)(?:\\/(.*))?$/)\n  const [, pkgName, sub] =\n    url === null ? [, null, ''] : parts || ['', '', '']\n  const ppath = await findDepPackage(pkgName, parentPath)\n  if (!ppath) {\n    throw packageNotFound(pkgName, originalParent)\n  }\n\n  const indexjs = resolve(ppath, 'index.js')\n  const pj = resolve(ppath, 'package.json')\n  const pkg = await readPkg(pj)\n  const subpath = sub ? resolve(ppath, sub) : false\n  // if not a package, then the sub can still be a direct path\n  // if no sub, then resolves to index.js if available.\n  if (!pkg) {\n    if (!subpath) {\n      // try index.js, otherwise fail\n      if (await fileExists(indexjs)) return pathToFileURL(indexjs)\n      else throw packageNotFound(ppath, originalParent)\n    } else {\n      if (await fileExists(subpath)) {\n        return pathToFileURL(subpath)\n      } else throw moduleNotFound(subpath, originalParent)\n    }\n  }\n\n  // ok, have a package, look up the export if present.\n  // otherwise, use main, otherwise index.js\n  if (pkg.exports) {\n    const subPath = resolveExport(\n      sub,\n      pkg.exports,\n      pj,\n      originalParent,\n      options,\n    )\n    const resolved = resolve(ppath, subPath)\n    if (await fileExists(resolved)) return pathToFileURL(resolved)\n    else throw moduleNotFound(resolved, originalParent)\n  } else if (subpath) {\n    if (await fileExists(subpath)) return pathToFileURL(subpath)\n    else throw moduleNotFound(subpath, originalParent)\n  } else if (pkg.main) {\n    // fall back to index.js if main is missing\n    const rmain = resolve(ppath, pkg.main)\n    if (await fileExists(rmain)) return pathToFileURL(rmain)\n    else if (await fileExists(indexjs)) return pathToFileURL(indexjs)\n    else throw packageNotFound(ppath, originalParent)\n  } else if (await fileExists(indexjs)) {\n    return pathToFileURL(indexjs)\n  } else {\n    throw packageNotFound(ppath, originalParent)\n  }\n}\n", "import { dirname, resolve } from 'path'\nimport { pathToFileURL } from 'url'\nimport { walkUp } from 'walk-up-path'\nimport {\n  invalidImportSpecifier,\n  moduleNotFound,\n  packageImportNotDefined,\n} from './errors.js'\nimport { fileExists } from './file-exists.js'\nimport { findStarMatch } from './find-star-match.js'\nimport { ConditionalValue, ResolveImportOpts } from './index.js'\nimport { readPkg } from './read-pkg.js'\nimport { resolveConditionalValue } from './resolve-conditional-value.js'\nimport { resolveDependencyExports } from './resolve-dependency-export.js'\nimport { resolveExport } from './resolve-export.js'\nimport { resolveImport } from './resolve-import.js'\nexport * from './resolve-package-import-sync.js'\n\n/**\n * Resolve an import like '@package/name/sub/module', where\n * './sub/module' appears in the exports of the local package.\n */\nexport const resolvePackageImport = async (\n  url: string,\n  parentPath: string,\n  options: ResolveImportOpts & { originalParent: string },\n): Promise<URL | string> => {\n  const { originalParent } = options\n  const parts = url.match(/^(@[^\\/]+\\/[^\\/]+|[^\\/]+)(?:\\/(.*))?$/) as\n    | null\n    | (RegExpMatchArray & [string, string, string])\n  // impossible\n  /* c8 ignore start */\n  if (!parts) throw invalidImportSpecifier(url)\n  /* c8 ignore stop */\n\n  for (const dir of walkUp(dirname(parentPath))) {\n    const pj = resolve(dir, 'package.json')\n    const pkg = await readPkg(pj)\n    if (!pkg) continue\n    if (pkg.name && pkg.exports) {\n      // can import from this package name if exports is defined\n      const [, pkgName, sub] = parts\n      if (pkgName === pkg.name) {\n        // ok, see if sub is a valid export then\n        const subPath = resolveExport(\n          sub,\n          pkg.exports,\n          pj,\n          originalParent,\n          options,\n        )\n        const resolved = resolve(dir, subPath)\n        if (await fileExists(resolved)) return pathToFileURL(resolved)\n        else throw moduleNotFound(resolved, originalParent)\n      }\n    }\n\n    if (url.startsWith('#')) {\n      if (!pkg.imports) {\n        throw packageImportNotDefined(url, pj, originalParent)\n      }\n      const exact = pkg.imports[url]\n      if (exact !== undefined) {\n        const res = resolveConditionalValue(exact, options)\n        if (!res) {\n          throw packageImportNotDefined(url, pj, originalParent)\n        }\n        // kind of weird behavior, but it's what node does\n        if (res.startsWith('#')) {\n          return resolveDependencyExports(null, parentPath, options)\n        }\n        return resolveImport(res, pj, options)\n      }\n\n      const sm = findStarMatch(url, pkg.imports)\n      if (!sm) {\n        throw packageImportNotDefined(url, pj, originalParent)\n      }\n      const [key, mid] = sm\n      const match = pkg.imports[key] as ConditionalValue\n      const res = resolveConditionalValue(match, options)\n      if (!res) {\n        throw packageImportNotDefined(url, pj, originalParent)\n      }\n      if (res.startsWith('#')) {\n        return resolveDependencyExports(null, parentPath, options)\n      }\n      const expand = res.replace(/\\*/g, mid)\n\n      // start over with the resolved import\n      return resolveImport(expand, pj, options)\n    }\n\n    break\n  }\n\n  return resolveDependencyExports(url, parentPath, options)\n}\n", "/**\n * Errors raised by resolve failures.\n * @module\n */\n\nimport { resolveImport } from './resolve-import.js'\n\n// TODO: move \"caller\" to an options object. Then the same options object can\n// be used that handles conditions, parentURL, etc., and the relevant\n// top-level function can set it explicitly at the start of the process and\n// just pass it along.\n\nexport const invalidImportSpecifier = (\n  url: string,\n  caller: (...a: any[]) => any = resolveImport,\n) => {\n  const er = new Error('invalid import() specifier: ' + url)\n  Error.captureStackTrace(er, caller)\n  return er\n}\n\nexport const invalidPackage = (\n  pj: string | URL,\n  caller: (...a: any[]) => any = resolveImport,\n) => {\n  const er = new Error(`Not a valid package: ${pj}`)\n  Error.captureStackTrace(er, caller)\n  return er\n}\n\nexport const relativeImportWithoutParentURL = (\n  url: string,\n  parentURL: any,\n  caller: (...a: any[]) => any = resolveImport,\n) => {\n  const er = Object.assign(\n    new Error('relative import without parentURL'),\n    {\n      url,\n      parentURL,\n    },\n  )\n  Error.captureStackTrace(er, caller)\n  return er\n}\n\nexport const subpathNotExported = (\n  sub: string,\n  pj: string,\n  from: string,\n  caller: (...a: any[]) => any = resolveImport,\n) => {\n  const p =\n    sub === '.' ?\n      'No \"exports\" main defined'\n    : `Package subpath '${sub}' is not defined by \"exports\"`\n  const er = Object.assign(\n    new Error(`${p} in ${pj} imported from ${from}`),\n    {\n      code: 'ERR_PACKAGE_PATH_NOT_EXPORTED',\n    },\n  )\n  Error.captureStackTrace(er, caller)\n  return er\n}\n\nexport const packageNotFound = (\n  path: string | null,\n  from: string,\n  caller: (...a: any[]) => any = resolveImport,\n) => {\n  const er = Object.assign(\n    new Error(`Cannot find package '${path}' imported from ${from}`),\n    {\n      code: 'ERR_MODULE_NOT_FOUND',\n    },\n  )\n  Error.captureStackTrace(er, caller)\n  return er\n}\n\nexport const moduleNotFound = (\n  path: string,\n  from: string,\n  caller: (...a: any[]) => any = resolveImport,\n) => {\n  const er = Object.assign(\n    new Error(`Cannot find module '${path}' imported from ${from}`),\n    {\n      code: 'ERR_MODULE_NOT_FOUND',\n    },\n  )\n  Error.captureStackTrace(er, caller)\n  return er\n}\n\nexport const packageImportNotDefined = (\n  path: string,\n  pj: string,\n  from: string,\n  caller: (...a: any[]) => any = resolveImport,\n) => {\n  const er = Object.assign(\n    new Error(\n      `Package import specifier \"${path}\" is not defined in package ` +\n        `${pj} imported from ${from}`,\n    ),\n    { code: 'ERR_PACKAGE_IMPORT_NOT_DEFINED' },\n  )\n  Error.captureStackTrace(er, caller)\n  return er\n}\n", "/**\n * Exported as `'resolve-import/resolve-all-exports'`\n * @module\n */\nimport { dirname, resolve } from 'path'\nimport { pathToFileURL } from 'url'\nimport { invalidPackage } from './errors.js'\nimport { getNamedExportsList } from './get-named-exports-list.js'\nimport { Exports, ResolveImportOpts } from './index.js'\nimport { readPkg } from './read-pkg.js'\nimport { resolveExport } from './resolve-export.js'\nimport { starGlob } from './star-glob.js'\nimport { toPath } from './to-path.js'\nexport * from './resolve-all-exports-sync.js'\n\n/**\n * Given a path or file URL to a package.json file, return an object where each\n * possible export path is mapped to the file URL that it would resolve to.\n *\n * Invalid exports are omitted. No errors are raised as long as the file is a\n * valid `package.json`.\n *\n * Note: in cases like `\"./x/*\": \"./file.js\"`, where the list of possible\n * import paths is unbounded, the returned object will contain `\"./x/*\"` as the\n * key, since there's no way to expand that to every possible match.\n */\nexport const resolveAllExports = async (\n  packageJsonPath: string | URL,\n  options: ResolveImportOpts = {},\n): Promise<Record<string, string | URL>> => {\n  const pjPath = toPath(packageJsonPath)\n  const pjDir = dirname(pjPath)\n\n  const pkg = await readPkg(pjPath)\n  if (!pkg) {\n    throw invalidPackage(packageJsonPath, resolveAllExports)\n  }\n\n  const results: Record<string, string | URL> = {}\n\n  const { exports } = pkg\n  for (const sub of getNamedExportsList(exports)) {\n    let res\n\n    // this can't shouldn't be able to actually throw, because we're\n    // pulling the list from the set itself.\n    /* c8 ignore start */\n    try {\n      res = resolveExport(sub, exports as Exports, pjPath, pjPath, options)\n    } catch {}\n    if (!res) continue\n    /* c8 ignore stop */\n\n    // if it contains a *, then we have to glob,\n    // in package.json exports * is actually **, but only\n    // relevant if there is exactly ONE star\n    const sres = res.split('*')\n    const ssub = sub.split('*')\n    if (sres.length === 2 && ssub.length === 2) {\n      for (const [rep, target] of await starGlob(\n        sres as [string, string],\n        pjDir,\n      )) {\n        results[ssub[0] + rep + ssub[1]] = pathToFileURL(target)\n      }\n    } else {\n      results[sub] = pathToFileURL(resolve(pjDir, res))\n    }\n  }\n\n  return results\n}\n", "import { Exports, ExportsSubpaths } from './index.js'\n/**\n * Get the condition-resolved targets of all exports\n *\n * Stars are not expanded.\n */\nexport const getNamedExportsList = (exports?: Exports): string[] => {\n  if (!exports) return []\n  if (!isExportSubpaths(exports)) return ['.']\n  return Object.keys(exports).filter(e => e === '.' || e.startsWith('./'))\n}\n\nconst isExportSubpaths = (e: Exports): e is ExportsSubpaths => {\n  if (!e || typeof e !== 'object' || Array.isArray(e)) return false\n  for (const p in e) {\n    if (p !== '.' && !p.startsWith('./')) return false\n  }\n  return true\n}\n", "import { escape, glob, globSync } from 'glob'\nimport { resolve } from 'node:path'\n\nexport const starGlob = async (\n  star: [string, string], // actually [string,string]\n  dir: string,\n): Promise<[string, string][]> => {\n  const pattern =\n    escape(star[0]) +\n    (star[0].endsWith('/') ? '' : '*/') +\n    '**' +\n    (star[1].startsWith('/') ? '' : '/*') +\n    escape(star[1])\n  const matches = await glob(pattern, {\n    posix: true,\n    absolute: false,\n    nodir: true,\n    cwd: dir,\n    dotRelative: true,\n  })\n  return matches.map(match => {\n    const rep = match.substring(\n      star[0].length,\n      match.length - star[1].length,\n    )\n    return [rep, resolve(dir, match)]\n  })\n}\n\nexport const starGlobSync = (\n  star: [string, string], // actually [string,string]\n  dir: string,\n): [string, string][] => {\n  const pattern =\n    escape(star[0]) +\n    (star[0].endsWith('/') ? '' : '*/') +\n    '**' +\n    (star[1].startsWith('/') ? '' : '/*') +\n    escape(star[1])\n  const matches = globSync(pattern, {\n    posix: true,\n    absolute: false,\n    nodir: true,\n    cwd: dir,\n    dotRelative: true,\n  })\n  return matches.map(match => {\n    const rep = match.substring(\n      star[0].length,\n      match.length - star[1].length,\n    )\n    return [rep, resolve(dir, match)]\n  })\n}\n", "// link the package folder into ./target/node_modules/<pkgname>\nimport { readlinkSync, symlinkSync } from 'fs'\nimport { mkdirpSync } from 'mkdirp'\nimport { dirname, relative, resolve, sep } from 'path'\nimport { rimrafSync } from 'rimraf'\nimport { walkUp } from 'walk-up-path'\nimport { Package } from './types.js'\n\nconst dirsMade = new Map<string, string>()\n\n// if the cwd is in already linked to or living within node_modules,\n// then skip the linking, because it's already done.\n// This is typically the case in a workspaces setup, and\n// creating yet *another* symlink to ourselves in src/node_modules\n// will break nx's change detection logic with an ELOOP error.\nlet inNM: boolean | undefined = undefined\n\nconst linkedAlready = (pkg: Package) => {\n  if (inNM !== undefined) {\n    return inNM\n  }\n\n  const cwd = process.cwd()\n  const p = `${sep}node_modules${sep}${pkg.name}`.toLowerCase()\n  if (cwd.toLowerCase().endsWith(p)) {\n    return (inNM = true)\n  }\n\n  for (const p of walkUp(cwd)) {\n    const link = resolve(p, 'node_modules', pkg.name)\n    try {\n      const target = resolve(dirname(link), readlinkSync(link))\n      if (relative(target, cwd) === '') {\n        return (inNM = true)\n      }\n    } catch {}\n  }\n\n  return (inNM = false)\n}\n\nexport const link = (pkg: Package, where: string) => {\n  const selfLink = pkg?.tshy?.selfLink\n  if (!pkg.name || selfLink === false || linkedAlready(pkg)) {\n    return\n  }\n  const dest = resolve(where, 'node_modules', pkg.name)\n  const dir = dirname(dest)\n  const src = relative(dir, process.cwd())\n  const made = mkdirpSync(dir)\n  if (made) dirsMade.set(dest, made)\n  try {\n    symlinkSync(src, dest)\n  } catch {\n    rimrafSync(dest)\n    let threw = true\n    try {\n      symlinkSync(src, dest)\n      threw = false\n    } finally {\n      // best effort if not set explicitly. suppress error with return.\n      if (threw && selfLink === undefined) return\n    }\n  }\n}\n\nexport const unlink = (pkg: Package, where: string) => {\n  if (!pkg.name || pkg?.tshy?.selfLink === false || linkedAlready(pkg)) {\n    return\n  }\n  const dest = resolve(where, 'node_modules', pkg.name)\n  rimrafSync(dest)\n  const made = dirsMade.get(dest)\n  if (made) rimrafSync(made)\n}\n", "import { SpawnSyncReturns } from 'node:child_process'\nimport * as console from './console.js'\nimport fail from './fail.js'\nimport setFolderDialect from './set-folder-dialect.js'\nimport './tsconfig.js'\nimport { unlink as unlinkImports } from './unbuilt-imports.js'\nimport { unlink as unlinkSelfDep } from './self-link.js'\nimport pkg from './package.js'\n\nexport default (res: SpawnSyncReturns<Buffer>) => {\n  setFolderDialect('src')\n  unlinkImports(pkg, 'src')\n  unlinkSelfDep(pkg, 'src')\n  fail('build failed')\n  console.error(res)\n  process.exit(1)\n}\n", "import { existsSync, renameSync, unlinkSync } from 'fs'\n\nconst unlink = (f: string) => existsSync(f) && unlinkSync(f)\nconst rename = (f: string, to: string) =>\n  existsSync(f) && renameSync(f, to)\n\nexport default {\n  unlink,\n  rename,\n}\n", "/**\n * Exported as `'resolve-import/resolve-import'`\n * @module\n */\nimport { realpath } from 'fs/promises'\nimport Module from 'module'\nimport { basename, dirname, isAbsolute, resolve } from 'path'\nimport { fileURLToPath, pathToFileURL } from 'url'\nimport {\n  moduleNotFound,\n  relativeImportWithoutParentURL,\n} from './errors.js'\nimport { fileExists } from './file-exists.js'\nimport { ResolveImportOpts } from './index.js'\nimport { isRelativeRequire } from './is-relative-require.js'\nimport { resolveDependencyExports } from './resolve-dependency-export.js'\nimport { resolvePackageImport } from './resolve-package-import.js'\nimport { toFileURL } from './to-file-url.js'\nimport { toPath } from './to-path.js'\nexport * from './resolve-import-sync.js'\n\n// affordance for node 16 <16.17 and 18 <18.9\n/* c8 ignore start */\nif (typeof Module.isBuiltin !== 'function') {\n  Module.isBuiltin = (moduleName: string) => {\n    if (moduleName.startsWith('node:')) {\n      moduleName = moduleName.substring('node:'.length)\n    }\n    return Module.builtinModules.includes(moduleName)\n  }\n}\n/* c8 ignore stop */\n\n// It's pretty common to resolve against, eg, cwd + '/x', since we might not\n// know the actual file that it's being loaded from, and want to resolve what\n// a dep WOULD be from a given path. This allows us to realpath that directory,\n// without requiring that the file exist.\nconst realpathParentDir = async (path: string | URL) => {\n  path = toPath(path)\n  return resolve(await realpath(dirname(path)), basename(path))\n}\n\n/**\n * Resolve an import URL or string as if it were coming from the\n * module at parentURL.\n *\n * Returns a string for node builtin modules, and a file:// URL\n * object for anything resolved on disk.\n *\n * If the resolution is impossible, then an error will be raised, which\n * closely matches the errors raised by Node when failing for the same\n * reason.\n */\nexport const resolveImport = async (\n  /** the thing being imported */\n  url: string | URL,\n  /**\n   * the place the import() would be coming from. Required for relative\n   * imports.\n   */\n  parentURL: string | URL | undefined = undefined,\n  options: ResolveImportOpts = {},\n): Promise<URL | string> => {\n  // already resolved, just check that it exists\n  if (typeof url === 'string' && url.startsWith('file://')) {\n    url = new URL(url)\n  }\n  if (typeof url === 'object') {\n    if (!(await fileExists(url))) {\n      throw moduleNotFound(String(url), String(parentURL))\n    }\n    const rp = await realpath(toPath(url))\n    return rp !== fileURLToPath(url) ? pathToFileURL(rp) : url\n  }\n\n  const pu =\n    parentURL ? toFileURL(await realpathParentDir(parentURL)) : undefined\n\n  if (isRelativeRequire(url)) {\n    if (!pu) {\n      throw relativeImportWithoutParentURL(url, parentURL)\n    }\n    const u = new URL(url, pu)\n    if (!(await fileExists(u))) {\n      throw moduleNotFound(url, String(parentURL))\n    }\n    return pathToFileURL(await realpath(new URL(url, pu)))\n  }\n\n  if (isAbsolute(url)) {\n    if (!(await fileExists(url))) {\n      throw moduleNotFound(url, String(parentURL))\n    }\n    return pathToFileURL(await realpath(url))\n  }\n\n  if (Module.isBuiltin(String(url))) {\n    return String(url)\n  }\n\n  // ok, we have to resolve it. some kind of bare dep import,\n  // either a package name resolving to module or main, or a named export.\n  const parentPath: string = toPath(\n    parentURL || resolve(await realpath(process.cwd()), 'x'),\n  )\n  const opts = {\n    ...options,\n    originalParent: String(options.originalParent || parentPath),\n  }\n  if (url) {\n    return resolvePackageImport(url, parentPath, opts)\n  } else {\n    return resolveDependencyExports(url, parentPath, opts)\n  }\n}\n", "/**\n * Exported as `'resolve-import/resolve-import-sync'`\n * @module\n */\nimport { realpathSync } from 'node:fs'\nimport Module from 'node:module'\nimport { basename, dirname, isAbsolute, resolve } from 'node:path'\nimport { fileURLToPath, pathToFileURL } from 'node:url'\nimport {\n  moduleNotFound,\n  relativeImportWithoutParentURL,\n} from './errors.js'\nimport { fileExistsSync } from './file-exists.js'\nimport type { ResolveImportOpts } from './index.js'\nimport { isRelativeRequire } from './is-relative-require.js'\nimport { resolveDependencyExportsSync } from './resolve-dependency-export-sync.js'\nimport { resolvePackageImportSync } from './resolve-package-import-sync.js'\nimport { toFileURL } from './to-file-url.js'\nimport { toPath } from './to-path.js'\n\n// affordance for node 16 <16.17 and 18 <18.9\n/* c8 ignore start */\nif (typeof Module.isBuiltin !== 'function') {\n  Module.isBuiltin = (moduleName: string) => {\n    if (moduleName.startsWith('node:')) {\n      moduleName = moduleName.substring('node:'.length)\n    }\n    return Module.builtinModules.includes(moduleName)\n  }\n}\n/* c8 ignore stop */\n\n// It's pretty common to resolve against, eg, cwd + '/x', since we might not\n// know the actual file that it's being loaded from, and want to resolve what\n// a dep WOULD be from a given path. This allows us to realpath that directory,\n// without requiring that the file exist.\nconst realpathParentDir = (path: string | URL) => {\n  path = toPath(path)\n  return resolve(realpathSync(dirname(path)), basename(path))\n}\n\n/**\n * Resolve an import URL or string as if it were coming from the\n * module at parentURL.\n *\n * Returns a string for node builtin modules, and a file:// URL\n * object for anything resolved on disk.\n *\n * If the resolution is impossible, then an error will be raised, which\n * closely matches the errors raised by Node when failing for the same\n * reason.\n */\nexport const resolveImportSync = (\n  /** the thing being imported */\n  url: string | URL,\n  /**\n   * the place the import() would be coming from. Required for relative\n   * imports.\n   */\n  parentURL: string | URL | undefined = undefined,\n  options: ResolveImportOpts = {},\n): URL | string => {\n  // already resolved, just check that it exists\n  if (typeof url === 'string' && url.startsWith('file://')) {\n    url = new URL(url)\n  }\n  if (typeof url === 'object') {\n    if (!fileExistsSync(url)) {\n      throw moduleNotFound(String(url), String(parentURL))\n    }\n    const rp = realpathSync(toPath(url))\n    return rp !== fileURLToPath(url) ? pathToFileURL(rp) : url\n  }\n\n  const pu =\n    parentURL ? toFileURL(realpathParentDir(parentURL)) : undefined\n\n  if (isRelativeRequire(url)) {\n    if (!pu) {\n      throw relativeImportWithoutParentURL(url, parentURL)\n    }\n    const u = new URL(url, pu)\n    if (!fileExistsSync(u)) {\n      throw moduleNotFound(url, String(parentURL))\n    }\n    return pathToFileURL(realpathSync(new URL(url, pu)))\n  }\n\n  if (isAbsolute(url)) {\n    if (!fileExistsSync(url)) {\n      throw moduleNotFound(url, String(parentURL))\n    }\n    return pathToFileURL(realpathSync(url))\n  }\n\n  if (Module.isBuiltin(String(url))) {\n    return String(url)\n  }\n\n  // ok, we have to resolve it. some kind of bare dep import,\n  // either a package name resolving to module or main, or a named export.\n  const parentPath: string = toPath(\n    parentURL || resolve(realpathSync(process.cwd()), 'x'),\n  )\n  const opts = {\n    ...options,\n    originalParent: String(options.originalParent || parentPath),\n  }\n  if (url) {\n    return resolvePackageImportSync(url, parentPath, opts)\n  } else {\n    return resolveDependencyExportsSync(url, parentPath, opts)\n  }\n}\n", "import { stat } from 'node:fs/promises'\nimport { statSync } from 'node:fs'\nimport { fileURLToPath } from 'node:url'\n\nconst toPath = (p: string | URL) =>\n  typeof p === 'object' || p.startsWith('file://') ? fileURLToPath(p) : p\n\nexport const fileExists = async (f: string | URL): Promise<boolean> => {\n  try {\n    return (await stat(toPath(f))).isFile()\n  } catch (er) {\n    return false\n  }\n}\n\nexport const fileExistsSync = (f: string | URL): boolean => {\n  try {\n    return statSync(toPath(f)).isFile()\n  } catch {\n    return false\n  }\n}\n", "export const isWindows =\n  typeof process === 'object' && process && process.platform === 'win32'\n", "/**\n * Exported as `'resolve-import/is-relative-require'`\n * @module\n */\nimport { isWindows } from './is-windows.js'\nexport const isRelativeRequire = (url: string) =>\n  /^\\.\\.?\\//.test(url) || (isWindows && /^\\.\\.?\\\\/.test(url))\n", "import { resolve } from 'node:path'\nimport { pathToFileURL } from 'node:url'\nimport { moduleNotFound, packageNotFound } from './errors.js'\nimport { fileExistsSync } from './file-exists.js'\nimport { findDepPackageSync } from './find-dep-package.js'\nimport { ResolveImportOpts } from './index.js'\nimport { readPkgSync } from './read-pkg.js'\nimport { resolveExport } from './resolve-export.js'\n\n/**\n * Resolve a dependency like '@dep/name/sub/module' where\n * '@dep/name' is in node_modules somewhere and exports './sub/module'\n */\nexport const resolveDependencyExportsSync = (\n  url: string | null,\n  parentPath: string,\n  options: ResolveImportOpts & { originalParent: string },\n): URL => {\n  const { originalParent } = options\n  const parts = url?.match(/^(@[^\\/]+\\/[^\\/]+|[^\\/]+)(?:\\/(.*))?$/)\n  const [, pkgName, sub] =\n    url === null ? [, null, ''] : parts || ['', '', '']\n  const ppath = findDepPackageSync(pkgName, parentPath)\n  if (!ppath) {\n    throw packageNotFound(pkgName, originalParent)\n  }\n\n  const indexjs = resolve(ppath, 'index.js')\n  const pj = resolve(ppath, 'package.json')\n  const pkg = readPkgSync(pj)\n  const subpath = sub ? resolve(ppath, sub) : false\n  // if not a package, then the sub can still be a direct path\n  // if no sub, then resolves to index.js if available.\n  if (!pkg) {\n    if (!subpath) {\n      // try index.js, otherwise fail\n      if (fileExistsSync(indexjs)) return pathToFileURL(indexjs)\n      else throw packageNotFound(ppath, originalParent)\n    } else {\n      if (fileExistsSync(subpath)) {\n        return pathToFileURL(subpath)\n      } else throw moduleNotFound(subpath, originalParent)\n    }\n  }\n\n  // ok, have a package, look up the export if present.\n  // otherwise, use main, otherwise index.js\n  if (pkg.exports) {\n    const subPath = resolveExport(\n      sub,\n      pkg.exports,\n      pj,\n      originalParent,\n      options,\n    )\n    const resolved = resolve(ppath, subPath)\n    if (fileExistsSync(resolved)) return pathToFileURL(resolved)\n    else throw moduleNotFound(resolved, originalParent)\n  } else if (subpath) {\n    if (fileExistsSync(subpath)) return pathToFileURL(subpath)\n    else throw moduleNotFound(subpath, originalParent)\n  } else if (pkg.main) {\n    // fall back to index.js if main is missing\n    const rmain = resolve(ppath, pkg.main)\n    if (fileExistsSync(rmain)) return pathToFileURL(rmain)\n    else if (fileExistsSync(indexjs)) return pathToFileURL(indexjs)\n    else throw packageNotFound(ppath, originalParent)\n  } else if (fileExistsSync(indexjs)) {\n    return pathToFileURL(indexjs)\n  } else {\n    throw packageNotFound(ppath, originalParent)\n  }\n}\n", "import { realpathSync, statSync } from 'node:fs'\nimport { realpath, stat } from 'node:fs/promises'\nimport { dirname, resolve, sep } from 'node:path'\nimport { walkUp } from 'walk-up-path'\n\nconst dirExists = async (f: string): Promise<boolean> => {\n  try {\n    return (await stat(f)).isDirectory()\n  } catch {\n    return false\n  }\n}\n\nconst dirExistsSync = (f: string): boolean => {\n  try {\n    return statSync(f).isDirectory()\n  } catch {\n    return false\n  }\n}\n\nexport const findDepPackage = async (\n  pkgName: string | null,\n  parentPath: string,\n) => {\n  // starting from the dirname, try to find the nearest node_modules\n  for (const dir of walkUp(dirname(parentPath))) {\n    const nm = resolve(dir, 'node_modules') + sep\n    // if it's null, then we need the node_modules itself\n    // if it's '' then we use node_modules with an extra / on it\n    // thisis only relevant when generating the error message, since\n    // of course node_modules// is never going to be a valid package.\n    const ppath =\n      pkgName === null ? nm : (!pkgName ? nm : resolve(nm, pkgName)) + sep\n    if (await dirExists(ppath)) {\n      try {\n        return (await realpath(ppath)) + sep\n        // the direxists stat will avoid almost all throws that could\n        // occur here, but just in case.\n        /* c8 ignore start */\n      } catch {}\n      /* c8 ignore stop */\n    }\n  }\n}\n\nexport const findDepPackageSync = (\n  pkgName: string | null,\n  parentPath: string,\n) => {\n  // starting from the dirname, try to find the nearest node_modules\n  for (const dir of walkUp(dirname(parentPath))) {\n    const nm = resolve(dir, 'node_modules') + sep\n    // if it's null, then we need the node_modules itself\n    // if it's '' then we use node_modules with an extra / on it\n    // thisis only relevant when generating the error message, since\n    // of course node_modules// is never going to be a valid package.\n    const ppath =\n      pkgName === null ? nm : (!pkgName ? nm : resolve(nm, pkgName)) + sep\n    if (dirExistsSync(ppath)) {\n      try {\n        return realpathSync(ppath) + sep\n        // the direxists stat will avoid almost all throws that could\n        // occur here, but just in case.\n        /* c8 ignore start */\n      } catch {}\n      /* c8 ignore stop */\n    }\n  }\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", "import { readFile } from 'node:fs/promises'\nimport { readFileSync } from 'node:fs'\n\nexport const readJSON = async (f: string): Promise<unknown> => {\n  try {\n    return JSON.parse(await readFile(f, 'utf8'))\n  } catch {\n    return null\n  }\n}\n\nexport const readJSONSync = (f: string): unknown => {\n  try {\n    return JSON.parse(readFileSync(f, 'utf8'))\n  } catch {\n    return null\n  }\n}\n", "import { Exports, Imports } from './index.js'\nimport { readJSON, readJSONSync } from './read-json.js'\n\nexport type Pkg = {\n  name?: string\n  main?: string\n  type?: string\n  module?: string\n  exports?: Exports\n  imports?: Imports\n}\n\nconst isExports = (e: any): e is Exports =>\n  !!e && (typeof e === 'object' || typeof e === 'string')\n\nconst isImports = (e: any): e is Exports => {\n  if (!e || typeof e !== 'object' || Array.isArray(e)) return false\n  for (const p in e) {\n    if (!p.startsWith('#')) return false\n  }\n  return true\n}\n\nconst isPkg = (o: any): o is Pkg =>\n  !!o &&\n  typeof o === 'object' &&\n  (typeof o.name === 'string' || typeof o.name === 'undefined') &&\n  (typeof o.main === 'string' || typeof o.main === 'undefined') &&\n  (typeof o.module === 'string' || typeof o.module === 'undefined') &&\n  (typeof o.exports === 'undefined' || isExports(o.exports)) &&\n  (typeof o.imports === 'undefined' || isImports(o.imports))\n\nconst ifPkg = (p: unknown): Pkg | null => (isPkg(p) ? p : null)\n\nexport const readPkg = async (f: string): Promise<Pkg | null> =>\n  ifPkg(await readJSON(f))\n\nexport const readPkgSync = (f: string): Pkg | null =>\n  ifPkg(readJSONSync(f))\n", "/**\n * Given an object with string keys possibly containing *, and a test\n * string, return the matching key, and the section that the star should\n * expand to when matching against the test string.\n */\nexport const findStarMatch = (\n  s: string,\n  obj: Record<string, any>,\n): [string, string] | null => {\n  // longest pattern matches take priority\n  const patterns = Object.keys(obj)\n    .filter(p => p.length <= s.length)\n    .sort((a, b) => b.length - a.length)\n    .map(p => [p, p.split('*')])\n    .filter(([, p]) => (p as string[]).length === 2) as [\n    string,\n    [string, string],\n  ][]\n\n  for (const [key, [before, after]] of patterns) {\n    if (s.startsWith(before) && s.endsWith(after)) {\n      const mid = s.substring(before.length, s.length - after.length)\n      return [key, mid]\n    }\n  }\n\n  return null\n}\n", "/**\n * Exported as `'resolve-import/resolve-conditional-value'`\n * @module\n */\nimport { ConditionalValue, ResolveImportOpts } from './index.js'\n\n/**\n * find the first match for string, import, node, or default\n * at this point, we know we're on the right subpath already\n */\nexport const resolveConditionalValue = (\n  exp: ConditionalValue,\n  options: ResolveImportOpts,\n): string | null => {\n  if (exp === null || typeof exp === 'string') return exp\n  if (Array.isArray(exp)) {\n    for (const e of exp) {\n      const r = resolveConditionalValue(e, options)\n      if (r) return r\n    }\n    return null\n  }\n\n  const conditions = new Set(['default'])\n  for (const condition of options.conditions ?? ['import', 'node']) {\n    if (condition.startsWith('!')) {\n      conditions.delete(condition.slice(1))\n    } else {\n      conditions.add(condition)\n    }\n  }\n  for (const [k, v] of Object.entries(exp)) {\n    if (conditions.has(k)) {\n      return resolveConditionalValue(v, options)\n    }\n  }\n  return null\n}\n", "import { subpathNotExported } from './errors.js'\nimport { findStarMatch } from './find-star-match.js'\nimport {\n  ConditionalValue,\n  Exports,\n  ExportsSubpaths,\n  ResolveImportOpts,\n} from './index.js'\nimport { resolveConditionalValue } from './resolve-conditional-value.js'\n\n/**\n * Resolve an export that might be a string, subpath exports, exports value\n * object, or array of strings and exports value objects\n */\nexport const resolveExport = (\n  sub: string,\n  exp: Exports,\n  pj: string,\n  from: string,\n  options: ResolveImportOpts,\n): string => {\n  const s =\n    !sub ? '.'\n    : sub === '.' || sub.startsWith('./') ? sub\n    : `./${sub}`\n\n  if (typeof exp === 'string' || Array.isArray(exp)) {\n    const res = s === '.' && resolveConditionalValue(exp, options)\n    if (!res) throw subpathNotExported(s, pj, from)\n    return res\n  }\n\n  // now it must be a set of named exports or an export value object\n  // first try to resolve as a value object, if that's allowed\n  if (s === '.') {\n    const res = resolveConditionalValue(exp, options)\n    if (res) return res\n  }\n\n  // otherwise the only way to match is with subpaths\n  const es = exp as ExportsSubpaths\n\n  // if we have an exact match, use that\n  const e = es[s]\n  if (e !== undefined) {\n    const res = resolveConditionalValue(e, options)\n    if (!res) throw subpathNotExported(s, pj, from)\n    return res\n  }\n\n  const sm = findStarMatch(s, es)\n  if (sm) {\n    const [key, mid] = sm\n    const res = resolveConditionalValue(\n      es[key] as ConditionalValue,\n      options,\n    )\n    if (!res) throw subpathNotExported(s, pj, from)\n    return res.replace(/\\*/g, mid)\n  }\n\n  // did not find a match\n  throw subpathNotExported(s, pj, from)\n}\n", "import { dirname, resolve } from 'node:path'\nimport { pathToFileURL } from 'node:url'\nimport { walkUp } from 'walk-up-path'\nimport {\n  invalidImportSpecifier,\n  moduleNotFound,\n  packageImportNotDefined,\n} from './errors.js'\nimport { fileExistsSync } from './file-exists.js'\nimport { findStarMatch } from './find-star-match.js'\nimport { ConditionalValue, ResolveImportOpts } from './index.js'\nimport { readPkgSync } from './read-pkg.js'\nimport { resolveConditionalValue } from './resolve-conditional-value.js'\nimport { resolveDependencyExportsSync } from './resolve-dependency-export-sync.js'\nimport { resolveExport } from './resolve-export.js'\nimport { resolveImportSync } from './resolve-import-sync.js'\n\n/**\n * Resolve an import like '@package/name/sub/module', where\n * './sub/module' appears in the exports of the local package.\n */\nexport const resolvePackageImportSync = (\n  url: string,\n  parentPath: string,\n  options: ResolveImportOpts & { originalParent: string },\n): URL | string => {\n  const { originalParent } = options\n  const parts = url.match(/^(@[^\\/]+\\/[^\\/]+|[^\\/]+)(?:\\/(.*))?$/) as\n    | null\n    | (RegExpMatchArray & [string, string, string])\n  // impossible\n  /* c8 ignore start */\n  if (!parts) throw invalidImportSpecifier(url)\n  /* c8 ignore stop */\n\n  for (const dir of walkUp(dirname(parentPath))) {\n    const pj = resolve(dir, 'package.json')\n    const pkg = readPkgSync(pj)\n    if (!pkg) continue\n    if (pkg.name && pkg.exports) {\n      // can import from this package name if exports is defined\n      const [, pkgName, sub] = parts\n      if (pkgName === pkg.name) {\n        // ok, see if sub is a valid export then\n        const subPath = resolveExport(\n          sub,\n          pkg.exports,\n          pj,\n          originalParent,\n          options,\n        )\n        const resolved = resolve(dir, subPath)\n        if (fileExistsSync(resolved)) return pathToFileURL(resolved)\n        else throw moduleNotFound(resolved, originalParent)\n      }\n    }\n\n    if (url.startsWith('#')) {\n      if (!pkg.imports) {\n        throw packageImportNotDefined(url, pj, originalParent)\n      }\n      const exact = pkg.imports[url]\n      if (exact !== undefined) {\n        const res = resolveConditionalValue(exact, options)\n        if (!res) {\n          throw packageImportNotDefined(url, pj, originalParent)\n        }\n        // kind of weird behavior, but it's what node does\n        if (res.startsWith('#')) {\n          return resolveDependencyExportsSync(null, parentPath, options)\n        }\n        return resolveImportSync(res, pj, options)\n      }\n\n      const sm = findStarMatch(url, pkg.imports)\n      if (!sm) {\n        throw packageImportNotDefined(url, pj, originalParent)\n      }\n      const [key, mid] = sm\n      const match = pkg.imports[key] as ConditionalValue\n      const res = resolveConditionalValue(match, options)\n      if (!res) {\n        throw packageImportNotDefined(url, pj, originalParent)\n      }\n      if (res.startsWith('#')) {\n        return resolveDependencyExportsSync(null, parentPath, options)\n      }\n      const expand = res.replace(/\\*/g, mid)\n\n      // start over with the resolved import\n      return resolveImportSync(expand, pj, options)\n    }\n\n    break\n  }\n\n  return resolveDependencyExportsSync(url, parentPath, options)\n}\n", "import { pathToFileURL } from 'url'\n\nexport const toFileURL = (p: string | URL): URL =>\n  typeof p === 'object' ? p\n  : p.startsWith('file://') ? new URL(p)\n  : pathToFileURL(p)\n", "import { fileURLToPath } from 'url'\n\nexport const toPath = (p: string | URL): string =>\n  typeof p === 'object' || p.startsWith('file://') ? fileURLToPath(p) : p\n", "/**\n * Errors raised by resolve failures.\n * @module\n */\n\nimport { resolveImport } from './resolve-import.js'\n\n// TODO: move \"caller\" to an options object. Then the same options object can\n// be used that handles conditions, parentURL, etc., and the relevant\n// top-level function can set it explicitly at the start of the process and\n// just pass it along.\n\nexport const invalidImportSpecifier = (\n  url: string,\n  caller: (...a: any[]) => any = resolveImport,\n) => {\n  const er = new Error('invalid import() specifier: ' + url)\n  Error.captureStackTrace(er, caller)\n  return er\n}\n\nexport const invalidPackage = (\n  pj: string | URL,\n  caller: (...a: any[]) => any = resolveImport,\n) => {\n  const er = new Error(`Not a valid package: ${pj}`)\n  Error.captureStackTrace(er, caller)\n  return er\n}\n\nexport const relativeImportWithoutParentURL = (\n  url: string,\n  parentURL: any,\n  caller: (...a: any[]) => any = resolveImport,\n) => {\n  const er = Object.assign(\n    new Error('relative import without parentURL'),\n    {\n      url,\n      parentURL,\n    },\n  )\n  Error.captureStackTrace(er, caller)\n  return er\n}\n\nexport const subpathNotExported = (\n  sub: string,\n  pj: string,\n  from: string,\n  caller: (...a: any[]) => any = resolveImport,\n) => {\n  const p =\n    sub === '.' ?\n      'No \"exports\" main defined'\n    : `Package subpath '${sub}' is not defined by \"exports\"`\n  const er = Object.assign(\n    new Error(`${p} in ${pj} imported from ${from}`),\n    {\n      code: 'ERR_PACKAGE_PATH_NOT_EXPORTED',\n    },\n  )\n  Error.captureStackTrace(er, caller)\n  return er\n}\n\nexport const packageNotFound = (\n  path: string | null,\n  from: string,\n  caller: (...a: any[]) => any = resolveImport,\n) => {\n  const er = Object.assign(\n    new Error(`Cannot find package '${path}' imported from ${from}`),\n    {\n      code: 'ERR_MODULE_NOT_FOUND',\n    },\n  )\n  Error.captureStackTrace(er, caller)\n  return er\n}\n\nexport const moduleNotFound = (\n  path: string,\n  from: string,\n  caller: (...a: any[]) => any = resolveImport,\n) => {\n  const er = Object.assign(\n    new Error(`Cannot find module '${path}' imported from ${from}`),\n    {\n      code: 'ERR_MODULE_NOT_FOUND',\n    },\n  )\n  Error.captureStackTrace(er, caller)\n  return er\n}\n\nexport const packageImportNotDefined = (\n  path: string,\n  pj: string,\n  from: string,\n  caller: (...a: any[]) => any = resolveImport,\n) => {\n  const er = Object.assign(\n    new Error(\n      `Package import specifier \"${path}\" is not defined in package ` +\n        `${pj} imported from ${from}`,\n    ),\n    { code: 'ERR_PACKAGE_IMPORT_NOT_DEFINED' },\n  )\n  Error.captureStackTrace(er, caller)\n  return er\n}\n", "import { resolve } from 'path'\nimport { pathToFileURL } from 'url'\nimport { moduleNotFound, packageNotFound } from './errors.js'\nimport { fileExists } from './file-exists.js'\nimport { findDepPackage } from './find-dep-package.js'\nimport { ResolveImportOpts } from './index.js'\nimport { readPkg } from './read-pkg.js'\nimport { resolveExport } from './resolve-export.js'\nexport * from './resolve-dependency-export-sync.js'\n\n/**\n * Resolve a dependency like '@dep/name/sub/module' where\n * '@dep/name' is in node_modules somewhere and exports './sub/module'\n */\nexport const resolveDependencyExports = async (\n  url: string | null,\n  parentPath: string,\n  options: ResolveImportOpts & { originalParent: string },\n): Promise<URL> => {\n  const { originalParent } = options\n  const parts = url?.match(/^(@[^\\/]+\\/[^\\/]+|[^\\/]+)(?:\\/(.*))?$/)\n  const [, pkgName, sub] =\n    url === null ? [, null, ''] : parts || ['', '', '']\n  const ppath = await findDepPackage(pkgName, parentPath)\n  if (!ppath) {\n    throw packageNotFound(pkgName, originalParent)\n  }\n\n  const indexjs = resolve(ppath, 'index.js')\n  const pj = resolve(ppath, 'package.json')\n  const pkg = await readPkg(pj)\n  const subpath = sub ? resolve(ppath, sub) : false\n  // if not a package, then the sub can still be a direct path\n  // if no sub, then resolves to index.js if available.\n  if (!pkg) {\n    if (!subpath) {\n      // try index.js, otherwise fail\n      if (await fileExists(indexjs)) return pathToFileURL(indexjs)\n      else throw packageNotFound(ppath, originalParent)\n    } else {\n      if (await fileExists(subpath)) {\n        return pathToFileURL(subpath)\n      } else throw moduleNotFound(subpath, originalParent)\n    }\n  }\n\n  // ok, have a package, look up the export if present.\n  // otherwise, use main, otherwise index.js\n  if (pkg.exports) {\n    const subPath = resolveExport(\n      sub,\n      pkg.exports,\n      pj,\n      originalParent,\n      options,\n    )\n    const resolved = resolve(ppath, subPath)\n    if (await fileExists(resolved)) return pathToFileURL(resolved)\n    else throw moduleNotFound(resolved, originalParent)\n  } else if (subpath) {\n    if (await fileExists(subpath)) return pathToFileURL(subpath)\n    else throw moduleNotFound(subpath, originalParent)\n  } else if (pkg.main) {\n    // fall back to index.js if main is missing\n    const rmain = resolve(ppath, pkg.main)\n    if (await fileExists(rmain)) return pathToFileURL(rmain)\n    else if (await fileExists(indexjs)) return pathToFileURL(indexjs)\n    else throw packageNotFound(ppath, originalParent)\n  } else if (await fileExists(indexjs)) {\n    return pathToFileURL(indexjs)\n  } else {\n    throw packageNotFound(ppath, originalParent)\n  }\n}\n", "import { dirname, resolve } from 'path'\nimport { pathToFileURL } from 'url'\nimport { walkUp } from 'walk-up-path'\nimport {\n  invalidImportSpecifier,\n  moduleNotFound,\n  packageImportNotDefined,\n} from './errors.js'\nimport { fileExists } from './file-exists.js'\nimport { findStarMatch } from './find-star-match.js'\nimport { ConditionalValue, ResolveImportOpts } from './index.js'\nimport { readPkg } from './read-pkg.js'\nimport { resolveConditionalValue } from './resolve-conditional-value.js'\nimport { resolveDependencyExports } from './resolve-dependency-export.js'\nimport { resolveExport } from './resolve-export.js'\nimport { resolveImport } from './resolve-import.js'\nexport * from './resolve-package-import-sync.js'\n\n/**\n * Resolve an import like '@package/name/sub/module', where\n * './sub/module' appears in the exports of the local package.\n */\nexport const resolvePackageImport = async (\n  url: string,\n  parentPath: string,\n  options: ResolveImportOpts & { originalParent: string },\n): Promise<URL | string> => {\n  const { originalParent } = options\n  const parts = url.match(/^(@[^\\/]+\\/[^\\/]+|[^\\/]+)(?:\\/(.*))?$/) as\n    | null\n    | (RegExpMatchArray & [string, string, string])\n  // impossible\n  /* c8 ignore start */\n  if (!parts) throw invalidImportSpecifier(url)\n  /* c8 ignore stop */\n\n  for (const dir of walkUp(dirname(parentPath))) {\n    const pj = resolve(dir, 'package.json')\n    const pkg = await readPkg(pj)\n    if (!pkg) continue\n    if (pkg.name && pkg.exports) {\n      // can import from this package name if exports is defined\n      const [, pkgName, sub] = parts\n      if (pkgName === pkg.name) {\n        // ok, see if sub is a valid export then\n        const subPath = resolveExport(\n          sub,\n          pkg.exports,\n          pj,\n          originalParent,\n          options,\n        )\n        const resolved = resolve(dir, subPath)\n        if (await fileExists(resolved)) return pathToFileURL(resolved)\n        else throw moduleNotFound(resolved, originalParent)\n      }\n    }\n\n    if (url.startsWith('#')) {\n      if (!pkg.imports) {\n        throw packageImportNotDefined(url, pj, originalParent)\n      }\n      const exact = pkg.imports[url]\n      if (exact !== undefined) {\n        const res = resolveConditionalValue(exact, options)\n        if (!res) {\n          throw packageImportNotDefined(url, pj, originalParent)\n        }\n        // kind of weird behavior, but it's what node does\n        if (res.startsWith('#')) {\n          return resolveDependencyExports(null, parentPath, options)\n        }\n        return resolveImport(res, pj, options)\n      }\n\n      const sm = findStarMatch(url, pkg.imports)\n      if (!sm) {\n        throw packageImportNotDefined(url, pj, originalParent)\n      }\n      const [key, mid] = sm\n      const match = pkg.imports[key] as ConditionalValue\n      const res = resolveConditionalValue(match, options)\n      if (!res) {\n        throw packageImportNotDefined(url, pj, originalParent)\n      }\n      if (res.startsWith('#')) {\n        return resolveDependencyExports(null, parentPath, options)\n      }\n      const expand = res.replace(/\\*/g, mid)\n\n      // start over with the resolved import\n      return resolveImport(expand, pj, options)\n    }\n\n    break\n  }\n\n  return resolveDependencyExports(url, parentPath, options)\n}\n", "// find the location of the tsc binary\n// This is necessary because pnpm install trees don't expose binaries\n// of meta-deps, and it's nicer to not require that the tshy user has\n// a dep on typescript directly if they don't need it otherwise.\n// However, if they DO have a direct dep on typescript, then load the\n// tsc from their local node_modules/.bin/tsc location.\nimport { resolveImport } from 'resolve-import/resolve-import-async'\nimport { fileURLToPath } from 'url'\nimport config from './config.js'\n\nconst provider = {\n  tsgo: '@typescript/native-preview',\n  tsc: 'typescript',\n} as const\n\nconst pjToCompilerPath = {\n  tsgo: 'bin/tsgo.js',\n  tsc: 'bin/tsc',\n} as const\n\n// use theirs if possible, otherwise use tshy's\nconst resolve = async (pkg: (typeof provider)[keyof typeof provider]) =>\n  await resolveImport(pkg + '/package.json', process.cwd() + '/x').catch(\n    () => resolveImport(pkg + '/package.json', import.meta.url),\n  )\n\nconst { compiler = 'tsc' } = config\nconst provPkg = provider[compiler]\n\nconst pjToCompiler = (pj: string) =>\n  pj.slice(0, -1 * 'package.json'.length) + pjToCompilerPath[compiler]\n\nexport default pjToCompiler(fileURLToPath(await resolve(provPkg)))\n", "import chalk from 'chalk'\nimport { spawnSync } from 'node:child_process'\nimport { relative, resolve } from 'node:path'\nimport buildFail from './build-fail.js'\nimport config from './config.js'\nimport * as console from './console.js'\nimport ifExist from './if-exist.js'\nimport polyfills from './polyfills.js'\nimport setFolderDialect from './set-folder-dialect.js'\nimport './tsconfig.js'\nimport tsc from './which-tsc.js'\n\nconst node = process.execPath\nconst { esmDialects = [] } = config\n\nexport const buildESM = () => {\n  setFolderDialect('src', 'esm')\n  for (const d of ['esm', ...esmDialects]) {\n    const pf = polyfills.get(d)\n    console.debug(chalk.cyan.dim('building ' + d))\n    const res = spawnSync(node, [tsc, '-p', `.tshy/${d}.json`], {\n      stdio: 'inherit',\n    })\n    if (res.status || res.signal) {\n      setFolderDialect('src')\n      return buildFail(res)\n    }\n    setFolderDialect('.tshy-build/' + d, 'esm')\n    for (const [override, orig] of pf?.map.entries() ?? []) {\n      const stemFrom = resolve(\n        `.tshy-build/${d}`,\n        relative(resolve('src'), resolve(override)),\n      ).replace(/\\.mts$/, '')\n      const stemTo = resolve(\n        `.tshy-build/${d}`,\n        relative(resolve('src'), resolve(orig)),\n      ).replace(/\\.tsx?$/, '')\n      ifExist.unlink(`${stemTo}.js.map`)\n      ifExist.unlink(`${stemTo}.d.ts.map`)\n      ifExist.rename(`${stemFrom}.mjs`, `${stemTo}.js`)\n      ifExist.rename(`${stemFrom}.d.mts`, `${stemTo}.d.ts`)\n    }\n    console.error(chalk.cyan.bold('built ' + d))\n  }\n  setFolderDialect('src')\n}\n", "// Remove the .tshy-build folder, but ONLY if\n// the \"incremental\" config value is not set, or if\n// it does not contain any tsbuildinfo files.\n// If we are in incremental mode, and have tsbuildinfo files,\n// then find and remove any files here that do not have a matching\n// source file in ./src\n\nimport { readdirSync } from 'fs'\nimport { parse } from 'path'\nimport { rimraf } from 'rimraf'\nimport * as console from './console.js'\nimport readTypescriptConfig from './read-typescript-config.js'\n\nconst cleanRemovedOutputs = async (path: string, root: string) => {\n  const entries = readdirSync(`${root}/${path}`, {\n    withFileTypes: true,\n  })\n  let sources: Set<string> | undefined = undefined\n  try {\n    sources = new Set(readdirSync(`src/${path}`))\n  } catch {}\n  // directory was removed\n  if (!sources) {\n    return await rimraf(`${root}/${path}`)\n  }\n  for (const e of entries) {\n    const outputFile = `${path}/${e.name}`\n    if (e.isDirectory()) {\n      await cleanRemovedOutputs(outputFile, root)\n      continue\n    }\n    let { ext, name } = parse(outputFile)\n    if (ext === '.map') {\n      continue\n    }\n    if (name.endsWith('.d') && ext.endsWith('ts')) {\n      ext = '.d' + ext\n      name = name.substring(0, name.length - '.d'.length)\n    }\n\n    const inputSearch =\n      ext === '.js' || ext === '.d.ts' ? ['.tsx', '.ts']\n      : ext === '.mjs' || ext === '.d.mts' ? ['.mts']\n      : ext === '.cjs' || ext === '.d.cts' ? ['.cts']\n      : []\n    inputSearch.push(ext)\n    let del = true\n    for (const ext of inputSearch) {\n      if (sources.has(`${name}${ext}`)) {\n        del = false\n        break\n      }\n    }\n    if (del) {\n      console.debug('removing output file', outputFile)\n      await rimraf([`${root}/${outputFile}`, `${root}/${outputFile}.map`])\n    }\n  }\n}\n\nexport default async () => {\n  const config = readTypescriptConfig()\n  if (\n    config.compilerOptions.incremental !== true &&\n    config.compilerOptions.composite !== true\n  ) {\n    return await rimraf('.tshy-build')\n  }\n\n  let buildInfos: string[] | undefined = undefined\n  try {\n    buildInfos = readdirSync('.tshy-build/.tshy')\n  } catch {}\n  if (!buildInfos?.length) {\n    return await rimraf('.tshy-build')\n  }\n\n  // delete anything that has been removed from src.\n  for (const dialect of readdirSync('.tshy-build')) {\n    if (dialect === '.tshy') continue\n    await cleanRemovedOutputs('.', `.tshy-build/${dialect}`)\n  }\n}\n", "import config from './config.js'\nexport default config.dialects || ['esm', 'commonjs']\n", "import { writeFileSync } from 'fs'\nimport { stringify } from 'polite-json'\nimport pkg from './package.js'\n\nexport default () => writeFileSync('package.json', stringify(pkg))\n", "import chalk from 'chalk'\nimport { linkSync, mkdirSync } from 'node:fs'\nimport { dirname, relative, resolve } from 'node:path'\nimport config from './config.js'\nimport * as console from './console.js'\nimport ifExist from './if-exist.js'\nimport polyfills from './polyfills.js'\nimport setFolderDialect from './set-folder-dialect.js'\nimport sources from './sources.js'\nimport './tsconfig.js'\n\nconst { esmDialects = [] } = config\n\nexport const buildLiveESM = () => {\n  for (const d of ['esm', ...esmDialects]) {\n    const pf = polyfills.get(d)\n    console.debug(chalk.cyan.dim('linking ' + d))\n    for (const s of sources) {\n      const source = s.substring('./src/'.length)\n      const target = resolve(`.tshy-build/${d}/${source}`)\n      mkdirSync(dirname(target), { recursive: true })\n      linkSync(s, target)\n    }\n    setFolderDialect('.tshy-build/' + d, 'esm')\n    for (const [override, orig] of pf?.map.entries() ?? []) {\n      const stemFrom = resolve(\n        `.tshy-build/${d}`,\n        relative(resolve('src'), resolve(override)),\n      ).replace(/\\.mts$/, '')\n      const stemTo = resolve(\n        `.tshy-build/${d}`,\n        relative(resolve('src'), resolve(orig)),\n      ).replace(/\\.tsx?$/, '')\n      ifExist.unlink(`${stemTo}.js.map`)\n      ifExist.unlink(`${stemTo}.d.ts.map`)\n      ifExist.rename(`${stemFrom}.mjs`, `${stemTo}.js`)\n      ifExist.rename(`${stemFrom}.d.mts`, `${stemTo}.d.ts`)\n    }\n    console.error(chalk.cyan.bold('linked ' + d))\n  }\n}\n", "import chalk from 'chalk'\nimport { linkSync, mkdirSync } from 'node:fs'\nimport { dirname } from 'node:path'\nimport { relative, resolve } from 'node:path/posix'\nimport config from './config.js'\nimport * as console from './console.js'\nimport ifExist from './if-exist.js'\nimport polyfills from './polyfills.js'\nimport setFolderDialect from './set-folder-dialect.js'\nimport sources from './sources.js'\nimport './tsconfig.js'\n\nconst { commonjsDialects = [] } = config\n\n// don't actually do a build, just link files into places.\nexport const buildLiveCommonJS = () => {\n  for (const d of ['commonjs', ...commonjsDialects]) {\n    const pf = polyfills.get(d === 'commonjs' ? 'cjs' : d)\n    console.debug(chalk.cyan.dim('linking ' + d))\n    for (const s of sources) {\n      const source = s.substring('./src/'.length)\n      const target = resolve(`.tshy-build/${d}/${source}`)\n      mkdirSync(dirname(target), { recursive: true })\n      linkSync(s, target)\n    }\n    setFolderDialect('.tshy-build/' + d, 'commonjs')\n    for (const [override, orig] of pf?.map.entries() ?? []) {\n      const stemFrom = resolve(\n        `.tshy-build/${d}`,\n        relative(resolve('src'), resolve(override)),\n      ).replace(/\\.cts$/, '')\n      const stemTo = resolve(\n        `.tshy-build/${d}`,\n        relative(resolve('src'), resolve(orig)),\n      ).replace(/\\.tsx?$/, '')\n      ifExist.unlink(`${stemTo}.js.map`)\n      ifExist.unlink(`${stemTo}.d.ts.map`)\n      ifExist.rename(`${stemFrom}.cjs`, `${stemTo}.js`)\n      ifExist.rename(`${stemFrom}.d.cts`, `${stemTo}.d.ts`)\n    }\n    console.error(chalk.cyan.bold('linked commonjs'))\n  }\n}\n", "import chalk from 'chalk'\nimport config from './config.js'\nimport { syncContentSync } from 'sync-content'\nimport bins from './bins.js'\nimport { buildCommonJS } from './build-commonjs.js'\nimport { buildESM } from './build-esm.js'\nimport cleanBuildTmp from './clean-build-tmp.js'\nimport * as console from './console.js'\nimport dialects from './dialects.js'\nimport pkg from './package.js'\nimport {\n  link as linkSelfDep,\n  unlink as unlinkSelfDep,\n} from './self-link.js'\nimport './tsconfig.js'\nimport {\n  link as linkImports,\n  save as saveImports,\n  unlink as unlinkImports,\n} from './unbuilt-imports.js'\nimport writePackage from './write-package.js'\nimport { buildLiveESM } from './build-live-esm.js'\nimport { buildLiveCommonJS } from './build-live-commonjs.js'\n\nexport default async () => {\n  await cleanBuildTmp()\n\n  linkSelfDep(pkg, 'src')\n  await linkImports(pkg, 'src')\n  const liveDev =\n    config.liveDev &&\n    process.env.npm_command !== 'publish' &&\n    process.env.npm_command !== 'pack'\n  const esm = liveDev ? buildLiveESM : buildESM\n  const commonjs = liveDev ? buildLiveCommonJS : buildCommonJS\n  if (dialects.includes('esm')) esm()\n  if (dialects.includes('commonjs')) commonjs()\n  await unlinkImports(pkg, 'src')\n  unlinkSelfDep(pkg, 'src')\n\n  console.debug(chalk.cyan.dim('moving to ./dist'))\n  syncContentSync('.tshy-build', 'dist')\n  console.debug(chalk.cyan.dim('cleaning build temp dir'))\n\n  await cleanBuildTmp()\n\n  linkSelfDep(pkg, 'dist')\n\n  if (pkg.imports) {\n    console.debug('linking package imports', pkg.imports)\n    if (dialects.includes('commonjs'))\n      await linkImports(pkg, 'dist/commonjs', true)\n    if (dialects.includes('esm')) await linkImports(pkg, 'dist/esm', true)\n    if (saveImports('dist/.tshy-link-imports.mjs')) {\n      pkg.scripts = pkg.scripts || {}\n      pkg.scripts.preinstall =\n        'node -e \"import(process.argv[1]).catch(()=>{})\" ' +\n        'dist/.tshy-link-imports.mjs'\n    }\n  }\n\n  console.debug(chalk.cyan.dim('chmod bins'))\n  bins()\n  console.debug(chalk.cyan.dim('write package.json'))\n  writePackage()\n}\n", "import { relative, resolve } from 'node:path/posix'\nimport type {\n  ConditionalValue,\n  ConditionalValueObject,\n  ExportsSubpaths,\n} from 'resolve-import'\nimport config from './config.js'\nimport dialects from './dialects.js'\nimport fail from './fail.js'\nimport pkg from './package.js'\nimport type { PolyfillSet } from './polyfills.js'\nimport polyfills from './polyfills.js'\nimport { resolveExport } from './resolve-export.js'\nimport { Package, TshyConfig, TshyExport } from './types.js'\nconst { esmDialects = [], commonjsDialects = [] } = config\n\nconst liveDev =\n  config.liveDev &&\n  process.env.npm_command !== 'publish' &&\n  process.env.npm_command !== 'pack'\n\nconst getTargetForDialectCondition = <T extends string>(\n  s: string | TshyExport | undefined | null,\n  dialect: T,\n  condition: T extends 'esm' ? 'import'\n  : T extends 'commonjs' ? 'require'\n  : T,\n  type: T extends 'esm' ? 'esm'\n  : T extends 'commonjs' ? 'commonjs'\n  : 'esm' | 'commonjs',\n  polyfills: Map<string, PolyfillSet> = new Map(),\n): string | undefined | null => {\n  if (s === undefined) return undefined\n  if (typeof s === 'string') {\n    // the excluded filename pattern\n    const xts = type === 'commonjs' ? '.mts' : '.cts'\n    if (s.endsWith(xts)) return undefined\n    const pf = dialect === 'commonjs' ? 'cjs' : dialect\n    const rel = relative(\n      resolve('./src'),\n      resolve(polyfills.get(pf)?.map.get(s) ?? s),\n    )\n    const target = liveDev ? rel : rel.replace(/\\.([mc]?)tsx?$/, '.$1js')\n    return (\n      !s || !s.startsWith('./src/') ? s\n      : dialects.includes(type) ? `./dist/${dialect}/${target}`\n      : undefined\n    )\n  }\n  return resolveExport(s, [condition])\n}\n\nexport const getImpTarget = (\n  s: string | TshyExport | undefined | null,\n  polyfills: Map<string, PolyfillSet> = new Map(),\n) => getTargetForDialectCondition(s, 'esm', 'import', 'esm', polyfills)\n\nexport const getReqTarget = (\n  s: string | TshyExport | undefined | null,\n  polyfills: Map<string, PolyfillSet> = new Map(),\n) =>\n  getTargetForDialectCondition(\n    s,\n    'commonjs',\n    'require',\n    'commonjs',\n    polyfills,\n  )\n\nconst getExports = (\n  c: TshyConfig,\n  pkgType: 'commonjs' | 'module',\n): Record<string, ConditionalValue> => {\n  // by this time it always exports, will get the default if missing\n  /* c8 ignore start */\n  if (!c.exports) {\n    fail('no exports on tshy config (is there code in ./src?)')\n    return process.exit(1)\n  }\n  /* c8 ignore stop */\n  const e: Record<string, ConditionalValue> = {}\n  for (const [sub, s] of Object.entries(c.exports)) {\n    // external export, not built by us\n    if (s !== null && (typeof s !== 'string' || !s.startsWith('./src/'))) {\n      // already been validated, just accept as-is\n      e[sub] = s as ConditionalValue\n      continue\n    }\n\n    /* c8 ignore next - already guarded */\n    if (s === null) continue\n\n    const impTarget = getImpTarget(s, polyfills)\n    const reqTarget = getReqTarget(s, polyfills)\n\n    // should be impossible\n    /* c8 ignore start */\n    if (!impTarget && !reqTarget) continue\n    /* c8 ignore stop */\n\n    const exp: ConditionalValueObject = (e[sub] = {})\n    if (impTarget) {\n      for (const d of esmDialects) {\n        const source = s && (polyfills.get(d)?.map.get(s) ?? s)\n\n        const target = getTargetForDialectCondition(\n          s,\n          d,\n          d,\n          'esm',\n          polyfills,\n        )\n        if (target) {\n          exp[d] =\n            liveDev ?\n              {\n                ...(pkgType === 'commonjs' ?\n                  getSourceDialects(source, c)\n                : {}),\n                default: target,\n              }\n            : {\n                ...(pkgType === 'commonjs' ?\n                  getSourceDialects(source, c)\n                : {}),\n                types: target.replace(/\\.js$/, '.d.ts'),\n                default: target,\n              }\n        }\n      }\n    }\n\n    if (reqTarget) {\n      for (const d of commonjsDialects) {\n        const source = s && (polyfills.get(d)?.map.get(s) ?? s)\n        const target = getTargetForDialectCondition(\n          s,\n          d,\n          d,\n          'commonjs',\n          polyfills,\n        )\n        if (target) {\n          exp[d] =\n            liveDev ?\n              {\n                ...(pkgType === 'module' ?\n                  getSourceDialects(source, c)\n                : {}),\n                default: target,\n              }\n            : {\n                ...(pkgType === 'module' ?\n                  getSourceDialects(source, c)\n                : {}),\n                types: target.replace(/\\.js$/, '.d.ts'),\n                default: target,\n              }\n        }\n      }\n    }\n\n    // put the default import/require after all the other special ones.\n    if (impTarget) {\n      exp.import =\n        liveDev ?\n          {\n            ...(pkgType === 'module' ? getSourceDialects(s, c) : {}),\n            default: impTarget,\n          }\n        : {\n            ...(pkgType === 'module' ? getSourceDialects(s, c) : {}),\n            types: impTarget.replace(/\\.(m?)js$/, '.d.$1ts'),\n            default: impTarget,\n          }\n    }\n    if (reqTarget) {\n      exp.require =\n        liveDev ?\n          {\n            ...(pkgType === 'commonjs' ? getSourceDialects(s, c) : {}),\n            default: reqTarget,\n          }\n        : {\n            ...(pkgType === 'commonjs' ? getSourceDialects(s, c) : {}),\n            types: reqTarget.replace(/\\.(c?)js$/, '.d.$1ts'),\n            default: reqTarget,\n          }\n    }\n  }\n  return e\n}\n\nconst getSourceDialects = (source: string, c: TshyConfig) => {\n  const { sourceDialects } = c\n  if (!sourceDialects) return {}\n  return Object.fromEntries(sourceDialects.map(s => [s, source]))\n}\n\nexport const setMain = (\n  c: TshyConfig | undefined,\n  pkg: Package & { exports: ExportsSubpaths },\n) => {\n  pkg.type = pkg.type === 'commonjs' ? 'commonjs' : 'module'\n  const mod = resolveExport(pkg.exports['.'], ['require'])\n  const main = c?.main ?? !!mod\n  if (main) {\n    if (!mod) {\n      fail(`could not resolve exports['.'] for tshy.main 'require'`)\n      return process.exit(1)\n    }\n    const types = resolveExport(pkg.exports['.'], ['require', 'types'])\n    pkg.main = mod\n    if (types && types !== mod) pkg.types = types\n    else delete pkg.types\n  } else {\n    if (c && c.main !== false) delete c.main\n    delete pkg.main\n    delete pkg.types\n  }\n\n  // Set the package module to exports[\".\"]\n  const importMod = resolveExport(pkg.exports['.'], ['import'])\n  const module = c?.module ?? !!importMod\n  if (module) {\n    if (!importMod) {\n      fail(`could not resolve exports['.'] for tshy.module 'import'`)\n      return process.exit(1)\n    }\n\n    pkg.module = importMod\n  } else {\n    if (c && c.module !== false) delete c.module\n    delete pkg.module\n  }\n}\n\npkg.exports = getExports(config, pkg.type)\n\nsetMain(config, pkg as Package & { exports: ExportsSubpaths })\nexport default pkg.exports\n", "import chalk from 'chalk'\nimport fail from './fail.js'\n\nexport default (err?: string) => {\n  const url = 'https://github.com/isaacs/tshy'\n  const link =\n    chalk.level > 0 ? `\\x1b]8;;${url}\\x1b\\\\${url}\\x1b]8;;\\x1b\\\\` : url\n  console[err ? 'error' : 'log'](`Usage: tshy [--help]\n  --help -h   Print this message and exit.\n  --watch -w  Watch files in ./src and build when they change.\n\nDefault behavior: build project according to tshy config in package.json\n\nSee the docs for more information: ${link}`)\n  if (err) fail(err)\n  process.exit(err ? 1 : 0)\n}\n", "// any time the root package.json or any typescript files in src\n// are changed/added/removed, run the build\nimport chalk from 'chalk'\nimport { spawn } from 'child_process'\nimport { watch, ChokidarOptions } from 'chokidar'\nimport { readFileSync } from 'fs'\nimport { resolve, sep } from 'path'\nimport { fileURLToPath } from 'url'\nimport * as tshyConsole from './console.js'\n\nconst pjData = (): string => {\n  try {\n    return JSON.stringify(\n      JSON.parse(readFileSync('./package.json', 'utf8')),\n    )\n    /* c8 ignore start */\n  } catch {\n    return 'null'\n  }\n  /* c8 ignore stop */\n}\nlet lastPJData: string = 'null'\n\nexport const options: ChokidarOptions = {\n  persistent: true,\n  ignoreInitial: true,\n  ignorePermissionErrors: true,\n  ignored: path => {\n    const r = resolve(path)\n    if (r === srcPJ) return true\n    if (r === srcNM) return true\n    if (r.startsWith(srcNM + sep)) return true\n    return false\n  },\n}\n\nexport const srcPJ = resolve('./src/package.json')\nexport const srcNM = resolve('./src/node_modules')\nexport const src = resolve('./src')\nexport const rootPJ = resolve('./package.json')\nexport const targets = [src, rootPJ]\nexport const bin = fileURLToPath(new URL('./index.js', import.meta.url))\n\nexport default () => {\n  let building = false\n  let needRebuild = false\n  const watcher = watch(targets, options)\n  const build = () => {\n    building = true\n    needRebuild = false\n    const child = spawn(process.execPath, [bin], { stdio: 'inherit' })\n    child.on('close', (code, signal) => {\n      if (code || signal) {\n        tshyConsole.error(chalk.red('build failure'), {\n          code,\n          signal,\n        })\n        tshyConsole.print()\n      } else {\n        console.log(chalk.green('build success'), { code, signal })\n      }\n      if (needRebuild) build()\n      else building = false\n    })\n  }\n  watcher.on('all', (ev, path) => {\n    // prevent infinite looping on the src dir in liveDev mode\n    if (ev === 'addDir' && path === src) {\n      return\n    }\n\n    const r = resolve(path)\n    if (r === srcPJ) return\n    if (r === rootPJ) {\n      // check if the data actually changed\n      const newData = pjData()\n      /* c8 ignore next */\n      if (newData === lastPJData) return\n      lastPJData = newData\n    }\n    if (building) {\n      if (r !== rootPJ) needRebuild = true\n      return\n    }\n    tshyConsole.debug(chalk.cyan.dim(ev), path)\n    build()\n  })\n  lastPJData = pjData()\n  build()\n}\n", "/*! chokidar - MIT License (c) 2012 Paul Miller (paulmillr.com) */\nimport { stat as statcb } from 'fs';\nimport { stat, readdir } from 'fs/promises';\nimport { EventEmitter } from 'events';\nimport * as sysPath from 'path';\nimport { readdirp } from 'readdirp';\nimport { NodeFsHandler, EVENTS as EV, isWindows, isIBMi, EMPTY_FN, STR_CLOSE, STR_END, } from './handler.js';\nconst SLASH = '/';\nconst SLASH_SLASH = '//';\nconst ONE_DOT = '.';\nconst TWO_DOTS = '..';\nconst STRING_TYPE = 'string';\nconst BACK_SLASH_RE = /\\\\/g;\nconst DOUBLE_SLASH_RE = /\\/\\//;\nconst DOT_RE = /\\..*\\.(sw[px])$|~$|\\.subl.*\\.tmp/;\nconst REPLACER_RE = /^\\.[/\\\\]/;\nfunction arrify(item) {\n    return Array.isArray(item) ? item : [item];\n}\nconst isMatcherObject = (matcher) => typeof matcher === 'object' && matcher !== null && !(matcher instanceof RegExp);\nfunction createPattern(matcher) {\n    if (typeof matcher === 'function')\n        return matcher;\n    if (typeof matcher === 'string')\n        return (string) => matcher === string;\n    if (matcher instanceof RegExp)\n        return (string) => matcher.test(string);\n    if (typeof matcher === 'object' && matcher !== null) {\n        return (string) => {\n            if (matcher.path === string)\n                return true;\n            if (matcher.recursive) {\n                const relative = sysPath.relative(matcher.path, string);\n                if (!relative) {\n                    return false;\n                }\n                return !relative.startsWith('..') && !sysPath.isAbsolute(relative);\n            }\n            return false;\n        };\n    }\n    return () => false;\n}\nfunction normalizePath(path) {\n    if (typeof path !== 'string')\n        throw new Error('string expected');\n    path = sysPath.normalize(path);\n    path = path.replace(/\\\\/g, '/');\n    let prepend = false;\n    if (path.startsWith('//'))\n        prepend = true;\n    const DOUBLE_SLASH_RE = /\\/\\//;\n    while (path.match(DOUBLE_SLASH_RE))\n        path = path.replace(DOUBLE_SLASH_RE, '/');\n    if (prepend)\n        path = '/' + path;\n    return path;\n}\nfunction matchPatterns(patterns, testString, stats) {\n    const path = normalizePath(testString);\n    for (let index = 0; index < patterns.length; index++) {\n        const pattern = patterns[index];\n        if (pattern(path, stats)) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction anymatch(matchers, testString) {\n    if (matchers == null) {\n        throw new TypeError('anymatch: specify first argument');\n    }\n    // Early cache for matchers.\n    const matchersArray = arrify(matchers);\n    const patterns = matchersArray.map((matcher) => createPattern(matcher));\n    if (testString == null) {\n        return (testString, stats) => {\n            return matchPatterns(patterns, testString, stats);\n        };\n    }\n    return matchPatterns(patterns, testString);\n}\nconst unifyPaths = (paths_) => {\n    const paths = arrify(paths_).flat();\n    if (!paths.every((p) => typeof p === STRING_TYPE)) {\n        throw new TypeError(`Non-string provided as watch path: ${paths}`);\n    }\n    return paths.map(normalizePathToUnix);\n};\n// If SLASH_SLASH occurs at the beginning of path, it is not replaced\n//     because \"//StoragePC/DrivePool/Movies\" is a valid network path\nconst toUnix = (string) => {\n    let str = string.replace(BACK_SLASH_RE, SLASH);\n    let prepend = false;\n    if (str.startsWith(SLASH_SLASH)) {\n        prepend = true;\n    }\n    while (str.match(DOUBLE_SLASH_RE)) {\n        str = str.replace(DOUBLE_SLASH_RE, SLASH);\n    }\n    if (prepend) {\n        str = SLASH + str;\n    }\n    return str;\n};\n// Our version of upath.normalize\n// TODO: this is not equal to path-normalize module - investigate why\nconst normalizePathToUnix = (path) => toUnix(sysPath.normalize(toUnix(path)));\n// TODO: refactor\nconst normalizeIgnored = (cwd = '') => (path) => {\n    if (typeof path === 'string') {\n        return normalizePathToUnix(sysPath.isAbsolute(path) ? path : sysPath.join(cwd, path));\n    }\n    else {\n        return path;\n    }\n};\nconst getAbsolutePath = (path, cwd) => {\n    if (sysPath.isAbsolute(path)) {\n        return path;\n    }\n    return sysPath.join(cwd, path);\n};\nconst EMPTY_SET = Object.freeze(new Set());\n/**\n * Directory entry.\n */\nclass DirEntry {\n    constructor(dir, removeWatcher) {\n        this.path = dir;\n        this._removeWatcher = removeWatcher;\n        this.items = new Set();\n    }\n    add(item) {\n        const { items } = this;\n        if (!items)\n            return;\n        if (item !== ONE_DOT && item !== TWO_DOTS)\n            items.add(item);\n    }\n    async remove(item) {\n        const { items } = this;\n        if (!items)\n            return;\n        items.delete(item);\n        if (items.size > 0)\n            return;\n        const dir = this.path;\n        try {\n            await readdir(dir);\n        }\n        catch (err) {\n            if (this._removeWatcher) {\n                this._removeWatcher(sysPath.dirname(dir), sysPath.basename(dir));\n            }\n        }\n    }\n    has(item) {\n        const { items } = this;\n        if (!items)\n            return;\n        return items.has(item);\n    }\n    getChildren() {\n        const { items } = this;\n        if (!items)\n            return [];\n        return [...items.values()];\n    }\n    dispose() {\n        this.items.clear();\n        this.path = '';\n        this._removeWatcher = EMPTY_FN;\n        this.items = EMPTY_SET;\n        Object.freeze(this);\n    }\n}\nconst STAT_METHOD_F = 'stat';\nconst STAT_METHOD_L = 'lstat';\nexport class WatchHelper {\n    constructor(path, follow, fsw) {\n        this.fsw = fsw;\n        const watchPath = path;\n        this.path = path = path.replace(REPLACER_RE, '');\n        this.watchPath = watchPath;\n        this.fullWatchPath = sysPath.resolve(watchPath);\n        this.dirParts = [];\n        this.dirParts.forEach((parts) => {\n            if (parts.length > 1)\n                parts.pop();\n        });\n        this.followSymlinks = follow;\n        this.statMethod = follow ? STAT_METHOD_F : STAT_METHOD_L;\n    }\n    entryPath(entry) {\n        return sysPath.join(this.watchPath, sysPath.relative(this.watchPath, entry.fullPath));\n    }\n    filterPath(entry) {\n        const { stats } = entry;\n        if (stats && stats.isSymbolicLink())\n            return this.filterDir(entry);\n        const resolvedPath = this.entryPath(entry);\n        // TODO: what if stats is undefined? remove !\n        return this.fsw._isntIgnored(resolvedPath, stats) && this.fsw._hasReadPermissions(stats);\n    }\n    filterDir(entry) {\n        return this.fsw._isntIgnored(this.entryPath(entry), entry.stats);\n    }\n}\n/**\n * Watches files & directories for changes. Emitted events:\n * `add`, `addDir`, `change`, `unlink`, `unlinkDir`, `all`, `error`\n *\n *     new FSWatcher()\n *       .add(directories)\n *       .on('add', path => log('File', path, 'was added'))\n */\nexport class FSWatcher extends EventEmitter {\n    // Not indenting methods for history sake; for now.\n    constructor(_opts = {}) {\n        super();\n        this.closed = false;\n        this._closers = new Map();\n        this._ignoredPaths = new Set();\n        this._throttled = new Map();\n        this._streams = new Set();\n        this._symlinkPaths = new Map();\n        this._watched = new Map();\n        this._pendingWrites = new Map();\n        this._pendingUnlinks = new Map();\n        this._readyCount = 0;\n        this._readyEmitted = false;\n        const awf = _opts.awaitWriteFinish;\n        const DEF_AWF = { stabilityThreshold: 2000, pollInterval: 100 };\n        const opts = {\n            // Defaults\n            persistent: true,\n            ignoreInitial: false,\n            ignorePermissionErrors: false,\n            interval: 100,\n            binaryInterval: 300,\n            followSymlinks: true,\n            usePolling: false,\n            // useAsync: false,\n            atomic: true, // NOTE: overwritten later (depends on usePolling)\n            ..._opts,\n            // Change format\n            ignored: _opts.ignored ? arrify(_opts.ignored) : arrify([]),\n            awaitWriteFinish: awf === true ? DEF_AWF : typeof awf === 'object' ? { ...DEF_AWF, ...awf } : false,\n        };\n        // Always default to polling on IBM i because fs.watch() is not available on IBM i.\n        if (isIBMi)\n            opts.usePolling = true;\n        // Editor atomic write normalization enabled by default with fs.watch\n        if (opts.atomic === undefined)\n            opts.atomic = !opts.usePolling;\n        // opts.atomic = typeof _opts.atomic === 'number' ? _opts.atomic : 100;\n        // Global override. Useful for developers, who need to force polling for all\n        // instances of chokidar, regardless of usage / dependency depth\n        const envPoll = process.env.CHOKIDAR_USEPOLLING;\n        if (envPoll !== undefined) {\n            const envLower = envPoll.toLowerCase();\n            if (envLower === 'false' || envLower === '0')\n                opts.usePolling = false;\n            else if (envLower === 'true' || envLower === '1')\n                opts.usePolling = true;\n            else\n                opts.usePolling = !!envLower;\n        }\n        const envInterval = process.env.CHOKIDAR_INTERVAL;\n        if (envInterval)\n            opts.interval = Number.parseInt(envInterval, 10);\n        // This is done to emit ready only once, but each 'add' will increase that?\n        let readyCalls = 0;\n        this._emitReady = () => {\n            readyCalls++;\n            if (readyCalls >= this._readyCount) {\n                this._emitReady = EMPTY_FN;\n                this._readyEmitted = true;\n                // use process.nextTick to allow time for listener to be bound\n                process.nextTick(() => this.emit(EV.READY));\n            }\n        };\n        this._emitRaw = (...args) => this.emit(EV.RAW, ...args);\n        this._boundRemove = this._remove.bind(this);\n        this.options = opts;\n        this._nodeFsHandler = new NodeFsHandler(this);\n        // You\u2019re frozen when your heart\u2019s not open.\n        Object.freeze(opts);\n    }\n    _addIgnoredPath(matcher) {\n        if (isMatcherObject(matcher)) {\n            // return early if we already have a deeply equal matcher object\n            for (const ignored of this._ignoredPaths) {\n                if (isMatcherObject(ignored) &&\n                    ignored.path === matcher.path &&\n                    ignored.recursive === matcher.recursive) {\n                    return;\n                }\n            }\n        }\n        this._ignoredPaths.add(matcher);\n    }\n    _removeIgnoredPath(matcher) {\n        this._ignoredPaths.delete(matcher);\n        // now find any matcher objects with the matcher as path\n        if (typeof matcher === 'string') {\n            for (const ignored of this._ignoredPaths) {\n                // TODO (43081j): make this more efficient.\n                // probably just make a `this._ignoredDirectories` or some\n                // such thing.\n                if (isMatcherObject(ignored) && ignored.path === matcher) {\n                    this._ignoredPaths.delete(ignored);\n                }\n            }\n        }\n    }\n    // Public methods\n    /**\n     * Adds paths to be watched on an existing FSWatcher instance.\n     * @param paths_ file or file list. Other arguments are unused\n     */\n    add(paths_, _origAdd, _internal) {\n        const { cwd } = this.options;\n        this.closed = false;\n        this._closePromise = undefined;\n        let paths = unifyPaths(paths_);\n        if (cwd) {\n            paths = paths.map((path) => {\n                const absPath = getAbsolutePath(path, cwd);\n                // Check `path` instead of `absPath` because the cwd portion can't be a glob\n                return absPath;\n            });\n        }\n        paths.forEach((path) => {\n            this._removeIgnoredPath(path);\n        });\n        this._userIgnored = undefined;\n        if (!this._readyCount)\n            this._readyCount = 0;\n        this._readyCount += paths.length;\n        Promise.all(paths.map(async (path) => {\n            const res = await this._nodeFsHandler._addToNodeFs(path, !_internal, undefined, 0, _origAdd);\n            if (res)\n                this._emitReady();\n            return res;\n        })).then((results) => {\n            if (this.closed)\n                return;\n            results.forEach((item) => {\n                if (item)\n                    this.add(sysPath.dirname(item), sysPath.basename(_origAdd || item));\n            });\n        });\n        return this;\n    }\n    /**\n     * Close watchers or start ignoring events from specified paths.\n     */\n    unwatch(paths_) {\n        if (this.closed)\n            return this;\n        const paths = unifyPaths(paths_);\n        const { cwd } = this.options;\n        paths.forEach((path) => {\n            // convert to absolute path unless relative path already matches\n            if (!sysPath.isAbsolute(path) && !this._closers.has(path)) {\n                if (cwd)\n                    path = sysPath.join(cwd, path);\n                path = sysPath.resolve(path);\n            }\n            this._closePath(path);\n            this._addIgnoredPath(path);\n            if (this._watched.has(path)) {\n                this._addIgnoredPath({\n                    path,\n                    recursive: true,\n                });\n            }\n            // reset the cached userIgnored anymatch fn\n            // to make ignoredPaths changes effective\n            this._userIgnored = undefined;\n        });\n        return this;\n    }\n    /**\n     * Close watchers and remove all listeners from watched paths.\n     */\n    close() {\n        if (this._closePromise) {\n            return this._closePromise;\n        }\n        this.closed = true;\n        // Memory management.\n        this.removeAllListeners();\n        const closers = [];\n        this._closers.forEach((closerList) => closerList.forEach((closer) => {\n            const promise = closer();\n            if (promise instanceof Promise)\n                closers.push(promise);\n        }));\n        this._streams.forEach((stream) => stream.destroy());\n        this._userIgnored = undefined;\n        this._readyCount = 0;\n        this._readyEmitted = false;\n        this._watched.forEach((dirent) => dirent.dispose());\n        this._closers.clear();\n        this._watched.clear();\n        this._streams.clear();\n        this._symlinkPaths.clear();\n        this._throttled.clear();\n        this._closePromise = closers.length\n            ? Promise.all(closers).then(() => undefined)\n            : Promise.resolve();\n        return this._closePromise;\n    }\n    /**\n     * Expose list of watched paths\n     * @returns for chaining\n     */\n    getWatched() {\n        const watchList = {};\n        this._watched.forEach((entry, dir) => {\n            const key = this.options.cwd ? sysPath.relative(this.options.cwd, dir) : dir;\n            const index = key || ONE_DOT;\n            watchList[index] = entry.getChildren().sort();\n        });\n        return watchList;\n    }\n    emitWithAll(event, args) {\n        this.emit(event, ...args);\n        if (event !== EV.ERROR)\n            this.emit(EV.ALL, event, ...args);\n    }\n    // Common helpers\n    // --------------\n    /**\n     * Normalize and emit events.\n     * Calling _emit DOES NOT MEAN emit() would be called!\n     * @param event Type of event\n     * @param path File or directory path\n     * @param stats arguments to be passed with event\n     * @returns the error if defined, otherwise the value of the FSWatcher instance's `closed` flag\n     */\n    async _emit(event, path, stats) {\n        if (this.closed)\n            return;\n        const opts = this.options;\n        if (isWindows)\n            path = sysPath.normalize(path);\n        if (opts.cwd)\n            path = sysPath.relative(opts.cwd, path);\n        const args = [path];\n        if (stats != null)\n            args.push(stats);\n        const awf = opts.awaitWriteFinish;\n        let pw;\n        if (awf && (pw = this._pendingWrites.get(path))) {\n            pw.lastChange = new Date();\n            return this;\n        }\n        if (opts.atomic) {\n            if (event === EV.UNLINK) {\n                this._pendingUnlinks.set(path, [event, ...args]);\n                setTimeout(() => {\n                    this._pendingUnlinks.forEach((entry, path) => {\n                        this.emit(...entry);\n                        this.emit(EV.ALL, ...entry);\n                        this._pendingUnlinks.delete(path);\n                    });\n                }, typeof opts.atomic === 'number' ? opts.atomic : 100);\n                return this;\n            }\n            if (event === EV.ADD && this._pendingUnlinks.has(path)) {\n                event = EV.CHANGE;\n                this._pendingUnlinks.delete(path);\n            }\n        }\n        if (awf && (event === EV.ADD || event === EV.CHANGE) && this._readyEmitted) {\n            const awfEmit = (err, stats) => {\n                if (err) {\n                    event = EV.ERROR;\n                    args[0] = err;\n                    this.emitWithAll(event, args);\n                }\n                else if (stats) {\n                    // if stats doesn't exist the file must have been deleted\n                    if (args.length > 1) {\n                        args[1] = stats;\n                    }\n                    else {\n                        args.push(stats);\n                    }\n                    this.emitWithAll(event, args);\n                }\n            };\n            this._awaitWriteFinish(path, awf.stabilityThreshold, event, awfEmit);\n            return this;\n        }\n        if (event === EV.CHANGE) {\n            const isThrottled = !this._throttle(EV.CHANGE, path, 50);\n            if (isThrottled)\n                return this;\n        }\n        if (opts.alwaysStat &&\n            stats === undefined &&\n            (event === EV.ADD || event === EV.ADD_DIR || event === EV.CHANGE)) {\n            const fullPath = opts.cwd ? sysPath.join(opts.cwd, path) : path;\n            let stats;\n            try {\n                stats = await stat(fullPath);\n            }\n            catch (err) {\n                // do nothing\n            }\n            // Suppress event when fs_stat fails, to avoid sending undefined 'stat'\n            if (!stats || this.closed)\n                return;\n            args.push(stats);\n        }\n        this.emitWithAll(event, args);\n        return this;\n    }\n    /**\n     * Common handler for errors\n     * @returns The error if defined, otherwise the value of the FSWatcher instance's `closed` flag\n     */\n    _handleError(error) {\n        const code = error && error.code;\n        if (error &&\n            code !== 'ENOENT' &&\n            code !== 'ENOTDIR' &&\n            (!this.options.ignorePermissionErrors || (code !== 'EPERM' && code !== 'EACCES'))) {\n            this.emit(EV.ERROR, error);\n        }\n        return error || this.closed;\n    }\n    /**\n     * Helper utility for throttling\n     * @param actionType type being throttled\n     * @param path being acted upon\n     * @param timeout duration of time to suppress duplicate actions\n     * @returns tracking object or false if action should be suppressed\n     */\n    _throttle(actionType, path, timeout) {\n        if (!this._throttled.has(actionType)) {\n            this._throttled.set(actionType, new Map());\n        }\n        const action = this._throttled.get(actionType);\n        if (!action)\n            throw new Error('invalid throttle');\n        const actionPath = action.get(path);\n        if (actionPath) {\n            actionPath.count++;\n            return false;\n        }\n        // eslint-disable-next-line prefer-const\n        let timeoutObject;\n        const clear = () => {\n            const item = action.get(path);\n            const count = item ? item.count : 0;\n            action.delete(path);\n            clearTimeout(timeoutObject);\n            if (item)\n                clearTimeout(item.timeoutObject);\n            return count;\n        };\n        timeoutObject = setTimeout(clear, timeout);\n        const thr = { timeoutObject, clear, count: 0 };\n        action.set(path, thr);\n        return thr;\n    }\n    _incrReadyCount() {\n        return this._readyCount++;\n    }\n    /**\n     * Awaits write operation to finish.\n     * Polls a newly created file for size variations. When files size does not change for 'threshold' milliseconds calls callback.\n     * @param path being acted upon\n     * @param threshold Time in milliseconds a file size must be fixed before acknowledging write OP is finished\n     * @param event\n     * @param awfEmit Callback to be called when ready for event to be emitted.\n     */\n    _awaitWriteFinish(path, threshold, event, awfEmit) {\n        const awf = this.options.awaitWriteFinish;\n        if (typeof awf !== 'object')\n            return;\n        const pollInterval = awf.pollInterval;\n        let timeoutHandler;\n        let fullPath = path;\n        if (this.options.cwd && !sysPath.isAbsolute(path)) {\n            fullPath = sysPath.join(this.options.cwd, path);\n        }\n        const now = new Date();\n        const writes = this._pendingWrites;\n        function awaitWriteFinishFn(prevStat) {\n            statcb(fullPath, (err, curStat) => {\n                if (err || !writes.has(path)) {\n                    if (err && err.code !== 'ENOENT')\n                        awfEmit(err);\n                    return;\n                }\n                const now = Number(new Date());\n                if (prevStat && curStat.size !== prevStat.size) {\n                    writes.get(path).lastChange = now;\n                }\n                const pw = writes.get(path);\n                const df = now - pw.lastChange;\n                if (df >= threshold) {\n                    writes.delete(path);\n                    awfEmit(undefined, curStat);\n                }\n                else {\n                    timeoutHandler = setTimeout(awaitWriteFinishFn, pollInterval, curStat);\n                }\n            });\n        }\n        if (!writes.has(path)) {\n            writes.set(path, {\n                lastChange: now,\n                cancelWait: () => {\n                    writes.delete(path);\n                    clearTimeout(timeoutHandler);\n                    return event;\n                },\n            });\n            timeoutHandler = setTimeout(awaitWriteFinishFn, pollInterval);\n        }\n    }\n    /**\n     * Determines whether user has asked to ignore this path.\n     */\n    _isIgnored(path, stats) {\n        if (this.options.atomic && DOT_RE.test(path))\n            return true;\n        if (!this._userIgnored) {\n            const { cwd } = this.options;\n            const ign = this.options.ignored;\n            const ignored = (ign || []).map(normalizeIgnored(cwd));\n            const ignoredPaths = [...this._ignoredPaths];\n            const list = [...ignoredPaths.map(normalizeIgnored(cwd)), ...ignored];\n            this._userIgnored = anymatch(list, undefined);\n        }\n        return this._userIgnored(path, stats);\n    }\n    _isntIgnored(path, stat) {\n        return !this._isIgnored(path, stat);\n    }\n    /**\n     * Provides a set of common helpers and properties relating to symlink handling.\n     * @param path file or directory pattern being watched\n     */\n    _getWatchHelpers(path) {\n        return new WatchHelper(path, this.options.followSymlinks, this);\n    }\n    // Directory helpers\n    // -----------------\n    /**\n     * Provides directory tracking objects\n     * @param directory path of the directory\n     */\n    _getWatchedDir(directory) {\n        const dir = sysPath.resolve(directory);\n        if (!this._watched.has(dir))\n            this._watched.set(dir, new DirEntry(dir, this._boundRemove));\n        return this._watched.get(dir);\n    }\n    // File helpers\n    // ------------\n    /**\n     * Check for read permissions: https://stackoverflow.com/a/11781404/1358405\n     */\n    _hasReadPermissions(stats) {\n        if (this.options.ignorePermissionErrors)\n            return true;\n        return Boolean(Number(stats.mode) & 0o400);\n    }\n    /**\n     * Handles emitting unlink events for\n     * files and directories, and via recursion, for\n     * files and directories within directories that are unlinked\n     * @param directory within which the following item is located\n     * @param item      base path of item/directory\n     */\n    _remove(directory, item, isDirectory) {\n        // if what is being deleted is a directory, get that directory's paths\n        // for recursive deleting and cleaning of watched object\n        // if it is not a directory, nestedDirectoryChildren will be empty array\n        const path = sysPath.join(directory, item);\n        const fullPath = sysPath.resolve(path);\n        isDirectory =\n            isDirectory != null ? isDirectory : this._watched.has(path) || this._watched.has(fullPath);\n        // prevent duplicate handling in case of arriving here nearly simultaneously\n        // via multiple paths (such as _handleFile and _handleDir)\n        if (!this._throttle('remove', path, 100))\n            return;\n        // if the only watched file is removed, watch for its return\n        if (!isDirectory && this._watched.size === 1) {\n            this.add(directory, item, true);\n        }\n        // This will create a new entry in the watched object in either case\n        // so we got to do the directory check beforehand\n        const wp = this._getWatchedDir(path);\n        const nestedDirectoryChildren = wp.getChildren();\n        // Recursively remove children directories / files.\n        nestedDirectoryChildren.forEach((nested) => this._remove(path, nested));\n        // Check if item was on the watched list and remove it\n        const parent = this._getWatchedDir(directory);\n        const wasTracked = parent.has(item);\n        parent.remove(item);\n        // Fixes issue #1042 -> Relative paths were detected and added as symlinks\n        // (https://github.com/paulmillr/chokidar/blob/e1753ddbc9571bdc33b4a4af172d52cb6e611c10/lib/nodefs-handler.js#L612),\n        // but never removed from the map in case the path was deleted.\n        // This leads to an incorrect state if the path was recreated:\n        // https://github.com/paulmillr/chokidar/blob/e1753ddbc9571bdc33b4a4af172d52cb6e611c10/lib/nodefs-handler.js#L553\n        if (this._symlinkPaths.has(fullPath)) {\n            this._symlinkPaths.delete(fullPath);\n        }\n        // If we wait for this file to be fully written, cancel the wait.\n        let relPath = path;\n        if (this.options.cwd)\n            relPath = sysPath.relative(this.options.cwd, path);\n        if (this.options.awaitWriteFinish && this._pendingWrites.has(relPath)) {\n            const event = this._pendingWrites.get(relPath).cancelWait();\n            if (event === EV.ADD)\n                return;\n        }\n        // The Entry will either be a directory that just got removed\n        // or a bogus entry to a file, in either case we have to remove it\n        this._watched.delete(path);\n        this._watched.delete(fullPath);\n        const eventName = isDirectory ? EV.UNLINK_DIR : EV.UNLINK;\n        if (wasTracked && !this._isIgnored(path))\n            this._emit(eventName, path);\n        // Avoid conflicts if we later create another file with the same name\n        this._closePath(path);\n    }\n    /**\n     * Closes all watchers for a path\n     */\n    _closePath(path) {\n        this._closeFile(path);\n        const dir = sysPath.dirname(path);\n        this._getWatchedDir(dir).remove(sysPath.basename(path));\n    }\n    /**\n     * Closes only file-specific watchers\n     */\n    _closeFile(path) {\n        const closers = this._closers.get(path);\n        if (!closers)\n            return;\n        closers.forEach((closer) => closer());\n        this._closers.delete(path);\n    }\n    _addPathCloser(path, closer) {\n        if (!closer)\n            return;\n        let list = this._closers.get(path);\n        if (!list) {\n            list = [];\n            this._closers.set(path, list);\n        }\n        list.push(closer);\n    }\n    _readdirp(root, opts) {\n        if (this.closed)\n            return;\n        const options = { type: EV.ALL, alwaysStat: true, lstat: true, ...opts, depth: 0 };\n        let stream = readdirp(root, options);\n        this._streams.add(stream);\n        stream.once(STR_CLOSE, () => {\n            stream = undefined;\n        });\n        stream.once(STR_END, () => {\n            if (stream) {\n                this._streams.delete(stream);\n                stream = undefined;\n            }\n        });\n        return stream;\n    }\n}\n/**\n * Instantiates watcher with paths to be tracked.\n * @param paths file / directory paths\n * @param options opts, such as `atomic`, `awaitWriteFinish`, `ignored`, and others\n * @returns an instance of FSWatcher for chaining.\n * @example\n * const watcher = watch('.').on('all', (event, path) => { console.log(event, path); });\n * watch('.', { atomic: true, awaitWriteFinish: true, ignored: (f, stats) => stats?.isFile() && !f.endsWith('.js') })\n */\nexport function watch(paths, options = {}) {\n    const watcher = new FSWatcher(options);\n    watcher.add(paths);\n    return watcher;\n}\nexport default { watch, FSWatcher };\n", "import { stat, lstat, readdir, realpath } from 'node:fs/promises';\nimport { Readable } from 'node:stream';\nimport { resolve as presolve, relative as prelative, join as pjoin, sep as psep } from 'node:path';\nexport const EntryTypes = {\n    FILE_TYPE: 'files',\n    DIR_TYPE: 'directories',\n    FILE_DIR_TYPE: 'files_directories',\n    EVERYTHING_TYPE: 'all',\n};\nconst defaultOptions = {\n    root: '.',\n    fileFilter: (_entryInfo) => true,\n    directoryFilter: (_entryInfo) => true,\n    type: EntryTypes.FILE_TYPE,\n    lstat: false,\n    depth: 2147483648,\n    alwaysStat: false,\n    highWaterMark: 4096,\n};\nObject.freeze(defaultOptions);\nconst RECURSIVE_ERROR_CODE = 'READDIRP_RECURSIVE_ERROR';\nconst NORMAL_FLOW_ERRORS = new Set(['ENOENT', 'EPERM', 'EACCES', 'ELOOP', RECURSIVE_ERROR_CODE]);\nconst ALL_TYPES = [\n    EntryTypes.DIR_TYPE,\n    EntryTypes.EVERYTHING_TYPE,\n    EntryTypes.FILE_DIR_TYPE,\n    EntryTypes.FILE_TYPE,\n];\nconst DIR_TYPES = new Set([\n    EntryTypes.DIR_TYPE,\n    EntryTypes.EVERYTHING_TYPE,\n    EntryTypes.FILE_DIR_TYPE,\n]);\nconst FILE_TYPES = new Set([\n    EntryTypes.EVERYTHING_TYPE,\n    EntryTypes.FILE_DIR_TYPE,\n    EntryTypes.FILE_TYPE,\n]);\nconst isNormalFlowError = (error) => NORMAL_FLOW_ERRORS.has(error.code);\nconst wantBigintFsStats = process.platform === 'win32';\nconst emptyFn = (_entryInfo) => true;\nconst normalizeFilter = (filter) => {\n    if (filter === undefined)\n        return emptyFn;\n    if (typeof filter === 'function')\n        return filter;\n    if (typeof filter === 'string') {\n        const fl = filter.trim();\n        return (entry) => entry.basename === fl;\n    }\n    if (Array.isArray(filter)) {\n        const trItems = filter.map((item) => item.trim());\n        return (entry) => trItems.some((f) => entry.basename === f);\n    }\n    return emptyFn;\n};\n/** Readable readdir stream, emitting new files as they're being listed. */\nexport class ReaddirpStream extends Readable {\n    constructor(options = {}) {\n        super({\n            objectMode: true,\n            autoDestroy: true,\n            highWaterMark: options.highWaterMark,\n        });\n        const opts = { ...defaultOptions, ...options };\n        const { root, type } = opts;\n        this._fileFilter = normalizeFilter(opts.fileFilter);\n        this._directoryFilter = normalizeFilter(opts.directoryFilter);\n        const statMethod = opts.lstat ? lstat : stat;\n        // Use bigint stats if it's windows and stat() supports options (node 10+).\n        if (wantBigintFsStats) {\n            this._stat = (path) => statMethod(path, { bigint: true });\n        }\n        else {\n            this._stat = statMethod;\n        }\n        this._maxDepth = opts.depth ?? defaultOptions.depth;\n        this._wantsDir = type ? DIR_TYPES.has(type) : false;\n        this._wantsFile = type ? FILE_TYPES.has(type) : false;\n        this._wantsEverything = type === EntryTypes.EVERYTHING_TYPE;\n        this._root = presolve(root);\n        this._isDirent = !opts.alwaysStat;\n        this._statsProp = this._isDirent ? 'dirent' : 'stats';\n        this._rdOptions = { encoding: 'utf8', withFileTypes: this._isDirent };\n        // Launch stream with one parent, the root dir.\n        this.parents = [this._exploreDir(root, 1)];\n        this.reading = false;\n        this.parent = undefined;\n    }\n    async _read(batch) {\n        if (this.reading)\n            return;\n        this.reading = true;\n        try {\n            while (!this.destroyed && batch > 0) {\n                const par = this.parent;\n                const fil = par && par.files;\n                if (fil && fil.length > 0) {\n                    const { path, depth } = par;\n                    const slice = fil.splice(0, batch).map((dirent) => this._formatEntry(dirent, path));\n                    const awaited = await Promise.all(slice);\n                    for (const entry of awaited) {\n                        if (!entry)\n                            continue;\n                        if (this.destroyed)\n                            return;\n                        const entryType = await this._getEntryType(entry);\n                        if (entryType === 'directory' && this._directoryFilter(entry)) {\n                            if (depth <= this._maxDepth) {\n                                this.parents.push(this._exploreDir(entry.fullPath, depth + 1));\n                            }\n                            if (this._wantsDir) {\n                                this.push(entry);\n                                batch--;\n                            }\n                        }\n                        else if ((entryType === 'file' || this._includeAsFile(entry)) &&\n                            this._fileFilter(entry)) {\n                            if (this._wantsFile) {\n                                this.push(entry);\n                                batch--;\n                            }\n                        }\n                    }\n                }\n                else {\n                    const parent = this.parents.pop();\n                    if (!parent) {\n                        this.push(null);\n                        break;\n                    }\n                    this.parent = await parent;\n                    if (this.destroyed)\n                        return;\n                }\n            }\n        }\n        catch (error) {\n            this.destroy(error);\n        }\n        finally {\n            this.reading = false;\n        }\n    }\n    async _exploreDir(path, depth) {\n        let files;\n        try {\n            files = await readdir(path, this._rdOptions);\n        }\n        catch (error) {\n            this._onError(error);\n        }\n        return { files, depth, path };\n    }\n    async _formatEntry(dirent, path) {\n        let entry;\n        const basename = this._isDirent ? dirent.name : dirent;\n        try {\n            const fullPath = presolve(pjoin(path, basename));\n            entry = { path: prelative(this._root, fullPath), fullPath, basename };\n            entry[this._statsProp] = this._isDirent ? dirent : await this._stat(fullPath);\n        }\n        catch (err) {\n            this._onError(err);\n            return;\n        }\n        return entry;\n    }\n    _onError(err) {\n        if (isNormalFlowError(err) && !this.destroyed) {\n            this.emit('warn', err);\n        }\n        else {\n            this.destroy(err);\n        }\n    }\n    async _getEntryType(entry) {\n        // entry may be undefined, because a warning or an error were emitted\n        // and the statsProp is undefined\n        if (!entry && this._statsProp in entry) {\n            return '';\n        }\n        const stats = entry[this._statsProp];\n        if (stats.isFile())\n            return 'file';\n        if (stats.isDirectory())\n            return 'directory';\n        if (stats && stats.isSymbolicLink()) {\n            const full = entry.fullPath;\n            try {\n                const entryRealPath = await realpath(full);\n                const entryRealPathStats = await lstat(entryRealPath);\n                if (entryRealPathStats.isFile()) {\n                    return 'file';\n                }\n                if (entryRealPathStats.isDirectory()) {\n                    const len = entryRealPath.length;\n                    if (full.startsWith(entryRealPath) && full.substr(len, 1) === psep) {\n                        const recursiveError = new Error(`Circular symlink detected: \"${full}\" points to \"${entryRealPath}\"`);\n                        // @ts-ignore\n                        recursiveError.code = RECURSIVE_ERROR_CODE;\n                        return this._onError(recursiveError);\n                    }\n                    return 'directory';\n                }\n            }\n            catch (error) {\n                this._onError(error);\n                return '';\n            }\n        }\n    }\n    _includeAsFile(entry) {\n        const stats = entry && entry[this._statsProp];\n        return stats && this._wantsEverything && !stats.isDirectory();\n    }\n}\n/**\n * Streaming version: Reads all files and directories in given root recursively.\n * Consumes ~constant small amount of RAM.\n * @param root Root directory\n * @param options Options to specify root (start directory), filters and recursion depth\n */\nexport function readdirp(root, options = {}) {\n    // @ts-ignore\n    let type = options.entryType || options.type;\n    if (type === 'both')\n        type = EntryTypes.FILE_DIR_TYPE; // backwards-compatibility\n    if (type)\n        options.type = type;\n    if (!root) {\n        throw new Error('readdirp: root argument is required. Usage: readdirp(root, options)');\n    }\n    else if (typeof root !== 'string') {\n        throw new TypeError('readdirp: root argument must be a string. Usage: readdirp(root, options)');\n    }\n    else if (type && !ALL_TYPES.includes(type)) {\n        throw new Error(`readdirp: Invalid type passed. Use one of ${ALL_TYPES.join(', ')}`);\n    }\n    options.root = root;\n    return new ReaddirpStream(options);\n}\n/**\n * Promise version: Reads all files and directories in given root recursively.\n * Compared to streaming version, will consume a lot of RAM e.g. when 1 million files are listed.\n * @returns array of paths and their entry infos\n */\nexport function readdirpPromise(root, options = {}) {\n    return new Promise((resolve, reject) => {\n        const files = [];\n        readdirp(root, options)\n            .on('data', (entry) => files.push(entry))\n            .on('end', () => resolve(files))\n            .on('error', (error) => reject(error));\n    });\n}\nexport default readdirp;\n", "import { watchFile, unwatchFile, watch as fs_watch } from 'fs';\nimport { open, stat, lstat, realpath as fsrealpath } from 'fs/promises';\nimport * as sysPath from 'path';\nimport { type as osType } from 'os';\nexport const STR_DATA = 'data';\nexport const STR_END = 'end';\nexport const STR_CLOSE = 'close';\nexport const EMPTY_FN = () => { };\nexport const IDENTITY_FN = (val) => val;\nconst pl = process.platform;\nexport const isWindows = pl === 'win32';\nexport const isMacos = pl === 'darwin';\nexport const isLinux = pl === 'linux';\nexport const isFreeBSD = pl === 'freebsd';\nexport const isIBMi = osType() === 'OS400';\nexport const EVENTS = {\n    ALL: 'all',\n    READY: 'ready',\n    ADD: 'add',\n    CHANGE: 'change',\n    ADD_DIR: 'addDir',\n    UNLINK: 'unlink',\n    UNLINK_DIR: 'unlinkDir',\n    RAW: 'raw',\n    ERROR: 'error',\n};\nconst EV = EVENTS;\nconst THROTTLE_MODE_WATCH = 'watch';\nconst statMethods = { lstat, stat };\nconst KEY_LISTENERS = 'listeners';\nconst KEY_ERR = 'errHandlers';\nconst KEY_RAW = 'rawEmitters';\nconst HANDLER_KEYS = [KEY_LISTENERS, KEY_ERR, KEY_RAW];\n// prettier-ignore\nconst binaryExtensions = new Set([\n    '3dm', '3ds', '3g2', '3gp', '7z', 'a', 'aac', 'adp', 'afdesign', 'afphoto', 'afpub', 'ai',\n    'aif', 'aiff', 'alz', 'ape', 'apk', 'appimage', 'ar', 'arj', 'asf', 'au', 'avi',\n    'bak', 'baml', 'bh', 'bin', 'bk', 'bmp', 'btif', 'bz2', 'bzip2',\n    'cab', 'caf', 'cgm', 'class', 'cmx', 'cpio', 'cr2', 'cur', 'dat', 'dcm', 'deb', 'dex', 'djvu',\n    'dll', 'dmg', 'dng', 'doc', 'docm', 'docx', 'dot', 'dotm', 'dra', 'DS_Store', 'dsk', 'dts',\n    'dtshd', 'dvb', 'dwg', 'dxf',\n    'ecelp4800', 'ecelp7470', 'ecelp9600', 'egg', 'eol', 'eot', 'epub', 'exe',\n    'f4v', 'fbs', 'fh', 'fla', 'flac', 'flatpak', 'fli', 'flv', 'fpx', 'fst', 'fvt',\n    'g3', 'gh', 'gif', 'graffle', 'gz', 'gzip',\n    'h261', 'h263', 'h264', 'icns', 'ico', 'ief', 'img', 'ipa', 'iso',\n    'jar', 'jpeg', 'jpg', 'jpgv', 'jpm', 'jxr', 'key', 'ktx',\n    'lha', 'lib', 'lvp', 'lz', 'lzh', 'lzma', 'lzo',\n    'm3u', 'm4a', 'm4v', 'mar', 'mdi', 'mht', 'mid', 'midi', 'mj2', 'mka', 'mkv', 'mmr', 'mng',\n    'mobi', 'mov', 'movie', 'mp3',\n    'mp4', 'mp4a', 'mpeg', 'mpg', 'mpga', 'mxu',\n    'nef', 'npx', 'numbers', 'nupkg',\n    'o', 'odp', 'ods', 'odt', 'oga', 'ogg', 'ogv', 'otf', 'ott',\n    'pages', 'pbm', 'pcx', 'pdb', 'pdf', 'pea', 'pgm', 'pic', 'png', 'pnm', 'pot', 'potm',\n    'potx', 'ppa', 'ppam',\n    'ppm', 'pps', 'ppsm', 'ppsx', 'ppt', 'pptm', 'pptx', 'psd', 'pya', 'pyc', 'pyo', 'pyv',\n    'qt',\n    'rar', 'ras', 'raw', 'resources', 'rgb', 'rip', 'rlc', 'rmf', 'rmvb', 'rpm', 'rtf', 'rz',\n    's3m', 's7z', 'scpt', 'sgi', 'shar', 'snap', 'sil', 'sketch', 'slk', 'smv', 'snk', 'so',\n    'stl', 'suo', 'sub', 'swf',\n    'tar', 'tbz', 'tbz2', 'tga', 'tgz', 'thmx', 'tif', 'tiff', 'tlz', 'ttc', 'ttf', 'txz',\n    'udf', 'uvh', 'uvi', 'uvm', 'uvp', 'uvs', 'uvu',\n    'viv', 'vob',\n    'war', 'wav', 'wax', 'wbmp', 'wdp', 'weba', 'webm', 'webp', 'whl', 'wim', 'wm', 'wma',\n    'wmv', 'wmx', 'woff', 'woff2', 'wrm', 'wvx',\n    'xbm', 'xif', 'xla', 'xlam', 'xls', 'xlsb', 'xlsm', 'xlsx', 'xlt', 'xltm', 'xltx', 'xm',\n    'xmind', 'xpi', 'xpm', 'xwd', 'xz',\n    'z', 'zip', 'zipx',\n]);\nconst isBinaryPath = (filePath) => binaryExtensions.has(sysPath.extname(filePath).slice(1).toLowerCase());\n// TODO: emit errors properly. Example: EMFILE on Macos.\nconst foreach = (val, fn) => {\n    if (val instanceof Set) {\n        val.forEach(fn);\n    }\n    else {\n        fn(val);\n    }\n};\nconst addAndConvert = (main, prop, item) => {\n    let container = main[prop];\n    if (!(container instanceof Set)) {\n        main[prop] = container = new Set([container]);\n    }\n    container.add(item);\n};\nconst clearItem = (cont) => (key) => {\n    const set = cont[key];\n    if (set instanceof Set) {\n        set.clear();\n    }\n    else {\n        delete cont[key];\n    }\n};\nconst delFromSet = (main, prop, item) => {\n    const container = main[prop];\n    if (container instanceof Set) {\n        container.delete(item);\n    }\n    else if (container === item) {\n        delete main[prop];\n    }\n};\nconst isEmptySet = (val) => (val instanceof Set ? val.size === 0 : !val);\nconst FsWatchInstances = new Map();\n/**\n * Instantiates the fs_watch interface\n * @param path to be watched\n * @param options to be passed to fs_watch\n * @param listener main event handler\n * @param errHandler emits info about errors\n * @param emitRaw emits raw event data\n * @returns {NativeFsWatcher}\n */\nfunction createFsWatchInstance(path, options, listener, errHandler, emitRaw) {\n    const handleEvent = (rawEvent, evPath) => {\n        listener(path);\n        emitRaw(rawEvent, evPath, { watchedPath: path });\n        // emit based on events occurring for files from a directory's watcher in\n        // case the file's watcher misses it (and rely on throttling to de-dupe)\n        if (evPath && path !== evPath) {\n            fsWatchBroadcast(sysPath.resolve(path, evPath), KEY_LISTENERS, sysPath.join(path, evPath));\n        }\n    };\n    try {\n        return fs_watch(path, {\n            persistent: options.persistent,\n        }, handleEvent);\n    }\n    catch (error) {\n        errHandler(error);\n        return undefined;\n    }\n}\n/**\n * Helper for passing fs_watch event data to a collection of listeners\n * @param fullPath absolute path bound to fs_watch instance\n */\nconst fsWatchBroadcast = (fullPath, listenerType, val1, val2, val3) => {\n    const cont = FsWatchInstances.get(fullPath);\n    if (!cont)\n        return;\n    foreach(cont[listenerType], (listener) => {\n        listener(val1, val2, val3);\n    });\n};\n/**\n * Instantiates the fs_watch interface or binds listeners\n * to an existing one covering the same file system entry\n * @param path\n * @param fullPath absolute path\n * @param options to be passed to fs_watch\n * @param handlers container for event listener functions\n */\nconst setFsWatchListener = (path, fullPath, options, handlers) => {\n    const { listener, errHandler, rawEmitter } = handlers;\n    let cont = FsWatchInstances.get(fullPath);\n    let watcher;\n    if (!options.persistent) {\n        watcher = createFsWatchInstance(path, options, listener, errHandler, rawEmitter);\n        if (!watcher)\n            return;\n        return watcher.close.bind(watcher);\n    }\n    if (cont) {\n        addAndConvert(cont, KEY_LISTENERS, listener);\n        addAndConvert(cont, KEY_ERR, errHandler);\n        addAndConvert(cont, KEY_RAW, rawEmitter);\n    }\n    else {\n        watcher = createFsWatchInstance(path, options, fsWatchBroadcast.bind(null, fullPath, KEY_LISTENERS), errHandler, // no need to use broadcast here\n        fsWatchBroadcast.bind(null, fullPath, KEY_RAW));\n        if (!watcher)\n            return;\n        watcher.on(EV.ERROR, async (error) => {\n            const broadcastErr = fsWatchBroadcast.bind(null, fullPath, KEY_ERR);\n            if (cont)\n                cont.watcherUnusable = true; // documented since Node 10.4.1\n            // Workaround for https://github.com/joyent/node/issues/4337\n            if (isWindows && error.code === 'EPERM') {\n                try {\n                    const fd = await open(path, 'r');\n                    await fd.close();\n                    broadcastErr(error);\n                }\n                catch (err) {\n                    // do nothing\n                }\n            }\n            else {\n                broadcastErr(error);\n            }\n        });\n        cont = {\n            listeners: listener,\n            errHandlers: errHandler,\n            rawEmitters: rawEmitter,\n            watcher,\n        };\n        FsWatchInstances.set(fullPath, cont);\n    }\n    // const index = cont.listeners.indexOf(listener);\n    // removes this instance's listeners and closes the underlying fs_watch\n    // instance if there are no more listeners left\n    return () => {\n        delFromSet(cont, KEY_LISTENERS, listener);\n        delFromSet(cont, KEY_ERR, errHandler);\n        delFromSet(cont, KEY_RAW, rawEmitter);\n        if (isEmptySet(cont.listeners)) {\n            // Check to protect against issue gh-730.\n            // if (cont.watcherUnusable) {\n            cont.watcher.close();\n            // }\n            FsWatchInstances.delete(fullPath);\n            HANDLER_KEYS.forEach(clearItem(cont));\n            // @ts-ignore\n            cont.watcher = undefined;\n            Object.freeze(cont);\n        }\n    };\n};\n// fs_watchFile helpers\n// object to hold per-process fs_watchFile instances\n// (may be shared across chokidar FSWatcher instances)\nconst FsWatchFileInstances = new Map();\n/**\n * Instantiates the fs_watchFile interface or binds listeners\n * to an existing one covering the same file system entry\n * @param path to be watched\n * @param fullPath absolute path\n * @param options options to be passed to fs_watchFile\n * @param handlers container for event listener functions\n * @returns closer\n */\nconst setFsWatchFileListener = (path, fullPath, options, handlers) => {\n    const { listener, rawEmitter } = handlers;\n    let cont = FsWatchFileInstances.get(fullPath);\n    // let listeners = new Set();\n    // let rawEmitters = new Set();\n    const copts = cont && cont.options;\n    if (copts && (copts.persistent < options.persistent || copts.interval > options.interval)) {\n        // \"Upgrade\" the watcher to persistence or a quicker interval.\n        // This creates some unlikely edge case issues if the user mixes\n        // settings in a very weird way, but solving for those cases\n        // doesn't seem worthwhile for the added complexity.\n        // listeners = cont.listeners;\n        // rawEmitters = cont.rawEmitters;\n        unwatchFile(fullPath);\n        cont = undefined;\n    }\n    if (cont) {\n        addAndConvert(cont, KEY_LISTENERS, listener);\n        addAndConvert(cont, KEY_RAW, rawEmitter);\n    }\n    else {\n        // TODO\n        // listeners.add(listener);\n        // rawEmitters.add(rawEmitter);\n        cont = {\n            listeners: listener,\n            rawEmitters: rawEmitter,\n            options,\n            watcher: watchFile(fullPath, options, (curr, prev) => {\n                foreach(cont.rawEmitters, (rawEmitter) => {\n                    rawEmitter(EV.CHANGE, fullPath, { curr, prev });\n                });\n                const currmtime = curr.mtimeMs;\n                if (curr.size !== prev.size || currmtime > prev.mtimeMs || currmtime === 0) {\n                    foreach(cont.listeners, (listener) => listener(path, curr));\n                }\n            }),\n        };\n        FsWatchFileInstances.set(fullPath, cont);\n    }\n    // const index = cont.listeners.indexOf(listener);\n    // Removes this instance's listeners and closes the underlying fs_watchFile\n    // instance if there are no more listeners left.\n    return () => {\n        delFromSet(cont, KEY_LISTENERS, listener);\n        delFromSet(cont, KEY_RAW, rawEmitter);\n        if (isEmptySet(cont.listeners)) {\n            FsWatchFileInstances.delete(fullPath);\n            unwatchFile(fullPath);\n            cont.options = cont.watcher = undefined;\n            Object.freeze(cont);\n        }\n    };\n};\n/**\n * @mixin\n */\nexport class NodeFsHandler {\n    constructor(fsW) {\n        this.fsw = fsW;\n        this._boundHandleError = (error) => fsW._handleError(error);\n    }\n    /**\n     * Watch file for changes with fs_watchFile or fs_watch.\n     * @param path to file or dir\n     * @param listener on fs change\n     * @returns closer for the watcher instance\n     */\n    _watchWithNodeFs(path, listener) {\n        const opts = this.fsw.options;\n        const directory = sysPath.dirname(path);\n        const basename = sysPath.basename(path);\n        const parent = this.fsw._getWatchedDir(directory);\n        parent.add(basename);\n        const absolutePath = sysPath.resolve(path);\n        const options = {\n            persistent: opts.persistent,\n        };\n        if (!listener)\n            listener = EMPTY_FN;\n        let closer;\n        if (opts.usePolling) {\n            const enableBin = opts.interval !== opts.binaryInterval;\n            options.interval = enableBin && isBinaryPath(basename) ? opts.binaryInterval : opts.interval;\n            closer = setFsWatchFileListener(path, absolutePath, options, {\n                listener,\n                rawEmitter: this.fsw._emitRaw,\n            });\n        }\n        else {\n            closer = setFsWatchListener(path, absolutePath, options, {\n                listener,\n                errHandler: this._boundHandleError,\n                rawEmitter: this.fsw._emitRaw,\n            });\n        }\n        return closer;\n    }\n    /**\n     * Watch a file and emit add event if warranted.\n     * @returns closer for the watcher instance\n     */\n    _handleFile(file, stats, initialAdd) {\n        if (this.fsw.closed) {\n            return;\n        }\n        const dirname = sysPath.dirname(file);\n        const basename = sysPath.basename(file);\n        const parent = this.fsw._getWatchedDir(dirname);\n        // stats is always present\n        let prevStats = stats;\n        // if the file is already being watched, do nothing\n        if (parent.has(basename))\n            return;\n        const listener = async (path, newStats) => {\n            if (!this.fsw._throttle(THROTTLE_MODE_WATCH, file, 5))\n                return;\n            if (!newStats || newStats.mtimeMs === 0) {\n                try {\n                    const newStats = await stat(file);\n                    if (this.fsw.closed)\n                        return;\n                    // Check that change event was not fired because of changed only accessTime.\n                    const at = newStats.atimeMs;\n                    const mt = newStats.mtimeMs;\n                    if (!at || at <= mt || mt !== prevStats.mtimeMs) {\n                        this.fsw._emit(EV.CHANGE, file, newStats);\n                    }\n                    if ((isMacos || isLinux || isFreeBSD) && prevStats.ino !== newStats.ino) {\n                        this.fsw._closeFile(path);\n                        prevStats = newStats;\n                        const closer = this._watchWithNodeFs(file, listener);\n                        if (closer)\n                            this.fsw._addPathCloser(path, closer);\n                    }\n                    else {\n                        prevStats = newStats;\n                    }\n                }\n                catch (error) {\n                    // Fix issues where mtime is null but file is still present\n                    this.fsw._remove(dirname, basename);\n                }\n                // add is about to be emitted if file not already tracked in parent\n            }\n            else if (parent.has(basename)) {\n                // Check that change event was not fired because of changed only accessTime.\n                const at = newStats.atimeMs;\n                const mt = newStats.mtimeMs;\n                if (!at || at <= mt || mt !== prevStats.mtimeMs) {\n                    this.fsw._emit(EV.CHANGE, file, newStats);\n                }\n                prevStats = newStats;\n            }\n        };\n        // kick off the watcher\n        const closer = this._watchWithNodeFs(file, listener);\n        // emit an add event if we're supposed to\n        if (!(initialAdd && this.fsw.options.ignoreInitial) && this.fsw._isntIgnored(file)) {\n            if (!this.fsw._throttle(EV.ADD, file, 0))\n                return;\n            this.fsw._emit(EV.ADD, file, stats);\n        }\n        return closer;\n    }\n    /**\n     * Handle symlinks encountered while reading a dir.\n     * @param entry returned by readdirp\n     * @param directory path of dir being read\n     * @param path of this item\n     * @param item basename of this item\n     * @returns true if no more processing is needed for this entry.\n     */\n    async _handleSymlink(entry, directory, path, item) {\n        if (this.fsw.closed) {\n            return;\n        }\n        const full = entry.fullPath;\n        const dir = this.fsw._getWatchedDir(directory);\n        if (!this.fsw.options.followSymlinks) {\n            // watch symlink directly (don't follow) and detect changes\n            this.fsw._incrReadyCount();\n            let linkPath;\n            try {\n                linkPath = await fsrealpath(path);\n            }\n            catch (e) {\n                this.fsw._emitReady();\n                return true;\n            }\n            if (this.fsw.closed)\n                return;\n            if (dir.has(item)) {\n                if (this.fsw._symlinkPaths.get(full) !== linkPath) {\n                    this.fsw._symlinkPaths.set(full, linkPath);\n                    this.fsw._emit(EV.CHANGE, path, entry.stats);\n                }\n            }\n            else {\n                dir.add(item);\n                this.fsw._symlinkPaths.set(full, linkPath);\n                this.fsw._emit(EV.ADD, path, entry.stats);\n            }\n            this.fsw._emitReady();\n            return true;\n        }\n        // don't follow the same symlink more than once\n        if (this.fsw._symlinkPaths.has(full)) {\n            return true;\n        }\n        this.fsw._symlinkPaths.set(full, true);\n    }\n    _handleRead(directory, initialAdd, wh, target, dir, depth, throttler) {\n        // Normalize the directory name on Windows\n        directory = sysPath.join(directory, '');\n        throttler = this.fsw._throttle('readdir', directory, 1000);\n        if (!throttler)\n            return;\n        const previous = this.fsw._getWatchedDir(wh.path);\n        const current = new Set();\n        let stream = this.fsw._readdirp(directory, {\n            fileFilter: (entry) => wh.filterPath(entry),\n            directoryFilter: (entry) => wh.filterDir(entry),\n        });\n        if (!stream)\n            return;\n        stream\n            .on(STR_DATA, async (entry) => {\n            if (this.fsw.closed) {\n                stream = undefined;\n                return;\n            }\n            const item = entry.path;\n            let path = sysPath.join(directory, item);\n            current.add(item);\n            if (entry.stats.isSymbolicLink() &&\n                (await this._handleSymlink(entry, directory, path, item))) {\n                return;\n            }\n            if (this.fsw.closed) {\n                stream = undefined;\n                return;\n            }\n            // Files that present in current directory snapshot\n            // but absent in previous are added to watch list and\n            // emit `add` event.\n            if (item === target || (!target && !previous.has(item))) {\n                this.fsw._incrReadyCount();\n                // ensure relativeness of path is preserved in case of watcher reuse\n                path = sysPath.join(dir, sysPath.relative(dir, path));\n                this._addToNodeFs(path, initialAdd, wh, depth + 1);\n            }\n        })\n            .on(EV.ERROR, this._boundHandleError);\n        return new Promise((resolve, reject) => {\n            if (!stream)\n                return reject();\n            stream.once(STR_END, () => {\n                if (this.fsw.closed) {\n                    stream = undefined;\n                    return;\n                }\n                const wasThrottled = throttler ? throttler.clear() : false;\n                resolve(undefined);\n                // Files that absent in current directory snapshot\n                // but present in previous emit `remove` event\n                // and are removed from @watched[directory].\n                previous\n                    .getChildren()\n                    .filter((item) => {\n                    return item !== directory && !current.has(item);\n                })\n                    .forEach((item) => {\n                    this.fsw._remove(directory, item);\n                });\n                stream = undefined;\n                // one more time for any missed in case changes came in extremely quickly\n                if (wasThrottled)\n                    this._handleRead(directory, false, wh, target, dir, depth, throttler);\n            });\n        });\n    }\n    /**\n     * Read directory to add / remove files from `@watched` list and re-read it on change.\n     * @param dir fs path\n     * @param stats\n     * @param initialAdd\n     * @param depth relative to user-supplied path\n     * @param target child path targeted for watch\n     * @param wh Common watch helpers for this path\n     * @param realpath\n     * @returns closer for the watcher instance.\n     */\n    async _handleDir(dir, stats, initialAdd, depth, target, wh, realpath) {\n        const parentDir = this.fsw._getWatchedDir(sysPath.dirname(dir));\n        const tracked = parentDir.has(sysPath.basename(dir));\n        if (!(initialAdd && this.fsw.options.ignoreInitial) && !target && !tracked) {\n            this.fsw._emit(EV.ADD_DIR, dir, stats);\n        }\n        // ensure dir is tracked (harmless if redundant)\n        parentDir.add(sysPath.basename(dir));\n        this.fsw._getWatchedDir(dir);\n        let throttler;\n        let closer;\n        const oDepth = this.fsw.options.depth;\n        if ((oDepth == null || depth <= oDepth) && !this.fsw._symlinkPaths.has(realpath)) {\n            if (!target) {\n                await this._handleRead(dir, initialAdd, wh, target, dir, depth, throttler);\n                if (this.fsw.closed)\n                    return;\n            }\n            closer = this._watchWithNodeFs(dir, (dirPath, stats) => {\n                // if current directory is removed, do nothing\n                if (stats && stats.mtimeMs === 0)\n                    return;\n                this._handleRead(dirPath, false, wh, target, dir, depth, throttler);\n            });\n        }\n        return closer;\n    }\n    /**\n     * Handle added file, directory, or glob pattern.\n     * Delegates call to _handleFile / _handleDir after checks.\n     * @param path to file or ir\n     * @param initialAdd was the file added at watch instantiation?\n     * @param priorWh depth relative to user-supplied path\n     * @param depth Child path actually targeted for watch\n     * @param target Child path actually targeted for watch\n     */\n    async _addToNodeFs(path, initialAdd, priorWh, depth, target) {\n        const ready = this.fsw._emitReady;\n        if (this.fsw._isIgnored(path) || this.fsw.closed) {\n            ready();\n            return false;\n        }\n        const wh = this.fsw._getWatchHelpers(path);\n        if (priorWh) {\n            wh.filterPath = (entry) => priorWh.filterPath(entry);\n            wh.filterDir = (entry) => priorWh.filterDir(entry);\n        }\n        // evaluate what is at the path we're being asked to watch\n        try {\n            const stats = await statMethods[wh.statMethod](wh.watchPath);\n            if (this.fsw.closed)\n                return;\n            if (this.fsw._isIgnored(wh.watchPath, stats)) {\n                ready();\n                return false;\n            }\n            const follow = this.fsw.options.followSymlinks;\n            let closer;\n            if (stats.isDirectory()) {\n                const absPath = sysPath.resolve(path);\n                const targetPath = follow ? await fsrealpath(path) : path;\n                if (this.fsw.closed)\n                    return;\n                closer = await this._handleDir(wh.watchPath, stats, initialAdd, depth, target, wh, targetPath);\n                if (this.fsw.closed)\n                    return;\n                // preserve this symlink's target path\n                if (absPath !== targetPath && targetPath !== undefined) {\n                    this.fsw._symlinkPaths.set(absPath, targetPath);\n                }\n            }\n            else if (stats.isSymbolicLink()) {\n                const targetPath = follow ? await fsrealpath(path) : path;\n                if (this.fsw.closed)\n                    return;\n                const parent = sysPath.dirname(wh.watchPath);\n                this.fsw._getWatchedDir(parent).add(wh.watchPath);\n                this.fsw._emit(EV.ADD, wh.watchPath, stats);\n                closer = await this._handleDir(parent, stats, initialAdd, depth, path, wh, targetPath);\n                if (this.fsw.closed)\n                    return;\n                // preserve this symlink's target path\n                if (targetPath !== undefined) {\n                    this.fsw._symlinkPaths.set(sysPath.resolve(path), targetPath);\n                }\n            }\n            else {\n                closer = this._handleFile(wh.watchPath, stats, initialAdd);\n            }\n            ready();\n            if (closer)\n                this.fsw._addPathCloser(path, closer);\n            return false;\n        }\n        catch (error) {\n            if (this.fsw._handleError(error)) {\n                ready();\n                return path;\n            }\n        }\n    }\n}\n", "#!/usr/bin/env node\n\nimport chalk from 'chalk'\nimport build from './build.js'\nimport * as debugConsole from './console.js'\nimport './exports.js'\nimport pkg from './package.js'\nimport usage from './usage.js'\nimport watch from './watch.js'\n\nconst { exports: exp, tshy } = pkg\n\nconst main = async () => {\n  for (const arg of process.argv.slice(2)) {\n    switch (arg) {\n      case '--help':\n      case '-h':\n        return usage()\n      case '--watch':\n      case '-w':\n        return watch()\n      default:\n        return usage(`Unknown argument: ${arg}`)\n    }\n  }\n\n  debugConsole.debug(chalk.yellow.bold('building'), process.cwd())\n  debugConsole.debug(chalk.cyan.dim('tshy config'), tshy)\n  debugConsole.debug(chalk.cyan.dim('exports'), exp)\n\n  await build()\n\n  debugConsole.log(chalk.bold.green('success!'))\n}\nawait main()\n"],
  "mappings": ";AAEA,IAAMA,GAAa,CAACC,EAAS,IAAMC,GAAQ,QAAUA,EAAOD,CAAM,IAE5DE,GAAc,CAACF,EAAS,IAAMC,GAAQ,QAAU,GAAKD,CAAM,MAAMC,CAAI,IAErEE,GAAc,CAACH,EAAS,IAAM,CAACI,EAAKC,EAAOC,IAAS,QAAU,GAAKN,CAAM,MAAMI,CAAG,IAAIC,CAAK,IAAIC,CAAI,IAEnGC,EAAS,CACd,SAAU,CACT,MAAO,CAAC,EAAG,CAAC,EAEZ,KAAM,CAAC,EAAG,EAAE,EACZ,IAAK,CAAC,EAAG,EAAE,EACX,OAAQ,CAAC,EAAG,EAAE,EACd,UAAW,CAAC,EAAG,EAAE,EACjB,SAAU,CAAC,GAAI,EAAE,EACjB,QAAS,CAAC,EAAG,EAAE,EACf,OAAQ,CAAC,EAAG,EAAE,EACd,cAAe,CAAC,EAAG,EAAE,CACtB,EACA,MAAO,CACN,MAAO,CAAC,GAAI,EAAE,EACd,IAAK,CAAC,GAAI,EAAE,EACZ,MAAO,CAAC,GAAI,EAAE,EACd,OAAQ,CAAC,GAAI,EAAE,EACf,KAAM,CAAC,GAAI,EAAE,EACb,QAAS,CAAC,GAAI,EAAE,EAChB,KAAM,CAAC,GAAI,EAAE,EACb,MAAO,CAAC,GAAI,EAAE,EAGd,YAAa,CAAC,GAAI,EAAE,EACpB,KAAM,CAAC,GAAI,EAAE,EACb,KAAM,CAAC,GAAI,EAAE,EACb,UAAW,CAAC,GAAI,EAAE,EAClB,YAAa,CAAC,GAAI,EAAE,EACpB,aAAc,CAAC,GAAI,EAAE,EACrB,WAAY,CAAC,GAAI,EAAE,EACnB,cAAe,CAAC,GAAI,EAAE,EACtB,WAAY,CAAC,GAAI,EAAE,EACnB,YAAa,CAAC,GAAI,EAAE,CACrB,EACA,QAAS,CACR,QAAS,CAAC,GAAI,EAAE,EAChB,MAAO,CAAC,GAAI,EAAE,EACd,QAAS,CAAC,GAAI,EAAE,EAChB,SAAU,CAAC,GAAI,EAAE,EACjB,OAAQ,CAAC,GAAI,EAAE,EACf,UAAW,CAAC,GAAI,EAAE,EAClB,OAAQ,CAAC,GAAI,EAAE,EACf,QAAS,CAAC,GAAI,EAAE,EAGhB,cAAe,CAAC,IAAK,EAAE,EACvB,OAAQ,CAAC,IAAK,EAAE,EAChB,OAAQ,CAAC,IAAK,EAAE,EAChB,YAAa,CAAC,IAAK,EAAE,EACrB,cAAe,CAAC,IAAK,EAAE,EACvB,eAAgB,CAAC,IAAK,EAAE,EACxB,aAAc,CAAC,IAAK,EAAE,EACtB,gBAAiB,CAAC,IAAK,EAAE,EACzB,aAAc,CAAC,IAAK,EAAE,EACtB,cAAe,CAAC,IAAK,EAAE,CACxB,CACD,EAEaC,GAAgB,OAAO,KAAKD,EAAO,QAAQ,EAC3CE,GAAuB,OAAO,KAAKF,EAAO,KAAK,EAC/CG,GAAuB,OAAO,KAAKH,EAAO,OAAO,EACjDI,GAAa,CAAC,GAAGF,GAAsB,GAAGC,EAAoB,EAE3E,SAASE,IAAiB,CACzB,IAAMC,EAAQ,IAAI,IAElB,OAAW,CAACC,EAAWC,CAAK,IAAK,OAAO,QAAQR,CAAM,EAAG,CACxD,OAAW,CAACS,EAAWC,CAAK,IAAK,OAAO,QAAQF,CAAK,EACpDR,EAAOS,CAAS,EAAI,CACnB,KAAM,QAAUC,EAAM,CAAC,CAAC,IACxB,MAAO,QAAUA,EAAM,CAAC,CAAC,GAC1B,EAEAF,EAAMC,CAAS,EAAIT,EAAOS,CAAS,EAEnCH,EAAM,IAAII,EAAM,CAAC,EAAGA,EAAM,CAAC,CAAC,EAG7B,OAAO,eAAeV,EAAQO,EAAW,CACxC,MAAOC,EACP,WAAY,EACb,CAAC,CACF,CAEA,cAAO,eAAeR,EAAQ,QAAS,CACtC,MAAOM,EACP,WAAY,EACb,CAAC,EAEDN,EAAO,MAAM,MAAQ,WACrBA,EAAO,QAAQ,MAAQ,WAEvBA,EAAO,MAAM,KAAOR,GAAW,EAC/BQ,EAAO,MAAM,QAAUL,GAAY,EACnCK,EAAO,MAAM,QAAUJ,GAAY,EACnCI,EAAO,QAAQ,KAAOR,GAAW,EAAsB,EACvDQ,EAAO,QAAQ,QAAUL,GAAY,EAAsB,EAC3DK,EAAO,QAAQ,QAAUJ,GAAY,EAAsB,EAG3D,OAAO,iBAAiBI,EAAQ,CAC/B,aAAc,CACb,MAAMH,EAAKC,EAAOC,EAAM,CAGvB,OAAIF,IAAQC,GAASA,IAAUC,EAC1BF,EAAM,EACF,GAGJA,EAAM,IACF,IAGD,KAAK,OAAQA,EAAM,GAAK,IAAO,EAAE,EAAI,IAGtC,GACH,GAAK,KAAK,MAAMA,EAAM,IAAM,CAAC,EAC7B,EAAI,KAAK,MAAMC,EAAQ,IAAM,CAAC,EAC/B,KAAK,MAAMC,EAAO,IAAM,CAAC,CAC7B,EACA,WAAY,EACb,EACA,SAAU,CACT,MAAMY,EAAK,CACV,IAAMC,EAAU,yBAAyB,KAAKD,EAAI,SAAS,EAAE,CAAC,EAC9D,GAAI,CAACC,EACJ,MAAO,CAAC,EAAG,EAAG,CAAC,EAGhB,GAAI,CAACC,CAAW,EAAID,EAEhBC,EAAY,SAAW,IAC1BA,EAAc,CAAC,GAAGA,CAAW,EAAE,IAAIC,GAAaA,EAAYA,CAAS,EAAE,KAAK,EAAE,GAG/E,IAAMC,EAAU,OAAO,SAASF,EAAa,EAAE,EAE/C,MAAO,CAELE,GAAW,GAAM,IACjBA,GAAW,EAAK,IACjBA,EAAU,GAEX,CACD,EACA,WAAY,EACb,EACA,aAAc,CACb,MAAOJ,GAAOX,EAAO,aAAa,GAAGA,EAAO,SAASW,CAAG,CAAC,EACzD,WAAY,EACb,EACA,cAAe,CACd,MAAMjB,EAAM,CACX,GAAIA,EAAO,EACV,MAAO,IAAKA,EAGb,GAAIA,EAAO,GACV,MAAO,KAAMA,EAAO,GAGrB,IAAIG,EACAC,EACAC,EAEJ,GAAIL,GAAQ,IACXG,IAASH,EAAO,KAAO,GAAM,GAAK,IAClCI,EAAQD,EACRE,EAAOF,MACD,CACNH,GAAQ,GAER,IAAMsB,EAAYtB,EAAO,GAEzBG,EAAM,KAAK,MAAMH,EAAO,EAAE,EAAI,EAC9BI,EAAQ,KAAK,MAAMkB,EAAY,CAAC,EAAI,EACpCjB,EAAQiB,EAAY,EAAK,CAC1B,CAEA,IAAMC,EAAQ,KAAK,IAAIpB,EAAKC,EAAOC,CAAI,EAAI,EAE3C,GAAIkB,IAAU,EACb,MAAO,IAIR,IAAIC,EAAS,IAAO,KAAK,MAAMnB,CAAI,GAAK,EAAM,KAAK,MAAMD,CAAK,GAAK,EAAK,KAAK,MAAMD,CAAG,GAEtF,OAAIoB,IAAU,IACbC,GAAU,IAGJA,CACR,EACA,WAAY,EACb,EACA,UAAW,CACV,MAAO,CAACrB,EAAKC,EAAOC,IAASC,EAAO,cAAcA,EAAO,aAAaH,EAAKC,EAAOC,CAAI,CAAC,EACvF,WAAY,EACb,EACA,UAAW,CACV,MAAOY,GAAOX,EAAO,cAAcA,EAAO,aAAaW,CAAG,CAAC,EAC3D,WAAY,EACb,CACD,CAAC,EAEMX,CACR,CAEA,IAAMmB,GAAad,GAAe,EAE3Be,GAAQD,GC9Nf,OAAOE,OAAa,eACpB,OAAOC,OAAQ,UACf,OAAOC,OAAS,WAIhB,SAASC,GAAQC,EAAMC,EAAO,WAAW,KAAO,WAAW,KAAK,KAAOL,GAAQ,KAAM,CACpF,IAAMM,EAASF,EAAK,WAAW,GAAG,EAAI,GAAMA,EAAK,SAAW,EAAI,IAAM,KAChEG,EAAWF,EAAK,QAAQC,EAASF,CAAI,EACrCI,EAAqBH,EAAK,QAAQ,IAAI,EAC5C,OAAOE,IAAa,KAAOC,IAAuB,IAAMD,EAAWC,EACpE,CAEA,GAAM,CAAC,IAAAC,CAAG,EAAIT,GAEVU,GAEHP,GAAQ,UAAU,GACfA,GAAQ,WAAW,GACnBA,GAAQ,aAAa,GACrBA,GAAQ,aAAa,EAExBO,GAAiB,GAEjBP,GAAQ,OAAO,GACZA,GAAQ,QAAQ,GAChBA,GAAQ,YAAY,GACpBA,GAAQ,cAAc,KAEzBO,GAAiB,GAGlB,SAASC,IAAgB,CACxB,GAAI,gBAAiBF,EACpB,OAAIA,EAAI,cAAgB,OAChB,EAGJA,EAAI,cAAgB,QAChB,EAGDA,EAAI,YAAY,SAAW,EAAI,EAAI,KAAK,IAAI,OAAO,SAASA,EAAI,YAAa,EAAE,EAAG,CAAC,CAE5F,CAEA,SAASG,GAAeC,EAAO,CAC9B,OAAIA,IAAU,EACN,GAGD,CACN,MAAAA,EACA,SAAU,GACV,OAAQA,GAAS,EACjB,OAAQA,GAAS,CAClB,CACD,CAEA,SAASC,GAAeC,EAAY,CAAC,YAAAC,EAAa,WAAAC,EAAa,EAAI,EAAI,CAAC,EAAG,CAC1E,IAAMC,EAAmBP,GAAc,EACnCO,IAAqB,SACxBR,GAAiBQ,GAGlB,IAAMC,EAAaF,EAAaP,GAAiBQ,EAEjD,GAAIC,IAAe,EAClB,MAAO,GAGR,GAAIF,EAAY,CACf,GAAId,GAAQ,WAAW,GACnBA,GAAQ,YAAY,GACpBA,GAAQ,iBAAiB,EAC5B,MAAO,GAGR,GAAIA,GAAQ,WAAW,EACtB,MAAO,EAET,CAIA,GAAI,aAAcM,GAAO,eAAgBA,EACxC,MAAO,GAGR,GAAIM,GAAc,CAACC,GAAeG,IAAe,OAChD,MAAO,GAGR,IAAMC,EAAMD,GAAc,EAE1B,GAAIV,EAAI,OAAS,OAChB,OAAOW,EAGR,GAAIpB,GAAQ,WAAa,QAAS,CAGjC,IAAMqB,EAAYpB,GAAG,QAAQ,EAAE,MAAM,GAAG,EACxC,OACC,OAAOoB,EAAU,CAAC,CAAC,GAAK,IACrB,OAAOA,EAAU,CAAC,CAAC,GAAK,MAEpB,OAAOA,EAAU,CAAC,CAAC,GAAK,MAAS,EAAI,EAGtC,CACR,CAEA,GAAI,OAAQZ,EACX,MAAI,CAAC,iBAAkB,gBAAiB,UAAU,EAAE,KAAKa,GAAOA,KAAOb,CAAG,EAClE,EAGJ,CAAC,SAAU,WAAY,YAAa,YAAa,OAAO,EAAE,KAAKc,GAAQA,KAAQd,CAAG,GAAKA,EAAI,UAAY,WACnG,EAGDW,EAGR,GAAI,qBAAsBX,EACzB,MAAO,gCAAgC,KAAKA,EAAI,gBAAgB,EAAI,EAAI,EAezE,GAZIA,EAAI,YAAc,aAIlBA,EAAI,OAAS,eAIbA,EAAI,OAAS,iBAIbA,EAAI,OAAS,UAChB,MAAO,GAGR,GAAI,iBAAkBA,EAAK,CAC1B,IAAMe,EAAU,OAAO,UAAUf,EAAI,sBAAwB,IAAI,MAAM,GAAG,EAAE,CAAC,EAAG,EAAE,EAElF,OAAQA,EAAI,aAAc,CACzB,IAAK,YACJ,OAAOe,GAAW,EAAI,EAAI,EAG3B,IAAK,iBACJ,MAAO,EAGT,CACD,CAEA,MAAI,iBAAiB,KAAKf,EAAI,IAAI,EAC1B,EAGJ,8DAA8D,KAAKA,EAAI,IAAI,GAI3E,cAAeA,EACX,EAGDW,CACR,CAEO,SAASK,GAAoBC,EAAQC,EAAU,CAAC,EAAG,CACzD,IAAMd,EAAQC,GAAeY,EAAQ,CACpC,YAAaA,GAAUA,EAAO,MAC9B,GAAGC,CACJ,CAAC,EAED,OAAOf,GAAeC,CAAK,CAC5B,CAEA,IAAMe,GAAgB,CACrB,OAAQH,GAAoB,CAAC,MAAOvB,GAAI,OAAO,CAAC,CAAC,CAAC,EAClD,OAAQuB,GAAoB,CAAC,MAAOvB,GAAI,OAAO,CAAC,CAAC,CAAC,CACnD,EAEO2B,GAAQD,GC5LR,SAASE,GAAiBC,EAAQC,EAAWC,EAAU,CAC7D,IAAIC,EAAQH,EAAO,QAAQC,CAAS,EACpC,GAAIE,IAAU,GACb,OAAOH,EAGR,IAAMI,EAAkBH,EAAU,OAC9BI,EAAW,EACXC,EAAc,GAClB,GACCA,GAAeN,EAAO,MAAMK,EAAUF,CAAK,EAAIF,EAAYC,EAC3DG,EAAWF,EAAQC,EACnBD,EAAQH,EAAO,QAAQC,EAAWI,CAAQ,QAClCF,IAAU,IAEnB,OAAAG,GAAeN,EAAO,MAAMK,CAAQ,EAC7BC,CACR,CAEO,SAASC,GAA+BP,EAAQQ,EAAQC,EAASN,EAAO,CAC9E,IAAIE,EAAW,EACXC,EAAc,GAClB,EAAG,CACF,IAAMI,EAAQV,EAAOG,EAAQ,CAAC,IAAM,KACpCG,GAAeN,EAAO,MAAMK,EAAWK,EAAQP,EAAQ,EAAIA,CAAM,EAAIK,GAAUE,EAAQ;AAAA,EAAS;AAAA,GAAQD,EACxGJ,EAAWF,EAAQ,EACnBA,EAAQH,EAAO,QAAQ;AAAA,EAAMK,CAAQ,CACtC,OAASF,IAAU,IAEnB,OAAAG,GAAeN,EAAO,MAAMK,CAAQ,EAC7BC,CACR,CCzBA,GAAM,CAAC,OAAQK,GAAa,OAAQC,EAAW,EAAIC,GAE7CC,GAAY,OAAO,WAAW,EAC9BC,GAAS,OAAO,QAAQ,EACxBC,GAAW,OAAO,UAAU,EAG5BC,GAAe,CACpB,OACA,OACA,UACA,SACD,EAEMC,GAAS,OAAO,OAAO,IAAI,EAE3BC,GAAe,CAACC,EAAQC,EAAU,CAAC,IAAM,CAC9C,GAAIA,EAAQ,OAAS,EAAE,OAAO,UAAUA,EAAQ,KAAK,GAAKA,EAAQ,OAAS,GAAKA,EAAQ,OAAS,GAChG,MAAM,IAAI,MAAM,qDAAqD,EAItE,IAAMC,EAAaX,GAAcA,GAAY,MAAQ,EACrDS,EAAO,MAAQC,EAAQ,QAAU,OAAYC,EAAaD,EAAQ,KACnE,EASA,IAAME,GAAeC,GAAW,CAC/B,IAAMC,EAAQ,IAAIC,IAAYA,EAAQ,KAAK,GAAG,EAC9C,OAAAC,GAAaF,EAAOD,CAAO,EAE3B,OAAO,eAAeC,EAAOG,GAAY,SAAS,EAE3CH,CACR,EAEA,SAASG,GAAYJ,EAAS,CAC7B,OAAOD,GAAaC,CAAO,CAC5B,CAEA,OAAO,eAAeI,GAAY,UAAW,SAAS,SAAS,EAE/D,OAAW,CAACC,EAAWC,CAAK,IAAK,OAAO,QAAQC,EAAU,EACzDC,GAAOH,CAAS,EAAI,CACnB,KAAM,CACL,IAAMI,EAAUC,GAAc,KAAMC,GAAaL,EAAM,KAAMA,EAAM,MAAO,KAAKM,EAAM,CAAC,EAAG,KAAKC,EAAQ,CAAC,EACvG,cAAO,eAAe,KAAMR,EAAW,CAAC,MAAOI,CAAO,CAAC,EAChDA,CACR,CACD,EAGDD,GAAO,QAAU,CAChB,KAAM,CACL,IAAMC,EAAUC,GAAc,KAAM,KAAKE,EAAM,EAAG,EAAI,EACtD,cAAO,eAAe,KAAM,UAAW,CAAC,MAAOH,CAAO,CAAC,EAChDA,CACR,CACD,EAEA,IAAMK,GAAe,CAACC,EAAOC,EAAOC,KAASC,IACxCH,IAAU,MACTC,IAAU,UACNT,GAAWU,CAAI,EAAE,QAAQ,GAAGC,CAAU,EAG1CF,IAAU,UACNT,GAAWU,CAAI,EAAE,QAAQV,GAAW,aAAa,GAAGW,CAAU,CAAC,EAGhEX,GAAWU,CAAI,EAAE,KAAKV,GAAW,UAAU,GAAGW,CAAU,CAAC,EAG7DH,IAAU,MACND,GAAa,MAAOE,EAAOC,EAAM,GAAGV,GAAW,SAAS,GAAGW,CAAU,CAAC,EAGvEX,GAAWU,CAAI,EAAEF,CAAK,EAAE,GAAGG,CAAU,EAGvCC,GAAa,CAAC,MAAO,MAAO,SAAS,EAE3C,QAAWJ,KAASI,GAAY,CAC/BX,GAAOO,CAAK,EAAI,CACf,KAAM,CACL,GAAM,CAAC,MAAAC,CAAK,EAAI,KAChB,OAAO,YAAaE,EAAY,CAC/B,IAAME,EAAST,GAAaG,GAAaC,EAAOM,GAAaL,CAAK,EAAG,QAAS,GAAGE,CAAU,EAAGX,GAAW,MAAM,MAAO,KAAKK,EAAM,CAAC,EAClI,OAAOF,GAAc,KAAMU,EAAQ,KAAKP,EAAQ,CAAC,CAClD,CACD,CACD,EAEA,IAAMS,EAAU,KAAOP,EAAM,CAAC,EAAE,YAAY,EAAIA,EAAM,MAAM,CAAC,EAC7DP,GAAOc,CAAO,EAAI,CACjB,KAAM,CACL,GAAM,CAAC,MAAAN,CAAK,EAAI,KAChB,OAAO,YAAaE,EAAY,CAC/B,IAAME,EAAST,GAAaG,GAAaC,EAAOM,GAAaL,CAAK,EAAG,UAAW,GAAGE,CAAU,EAAGX,GAAW,QAAQ,MAAO,KAAKK,EAAM,CAAC,EACtI,OAAOF,GAAc,KAAMU,EAAQ,KAAKP,EAAQ,CAAC,CAClD,CACD,CACD,CACD,CAEA,IAAMU,GAAQ,OAAO,iBAAiB,IAAM,CAAC,EAAG,CAC/C,GAAGf,GACH,MAAO,CACN,WAAY,GACZ,KAAM,CACL,OAAO,KAAKgB,EAAS,EAAE,KACxB,EACA,IAAIR,EAAO,CACV,KAAKQ,EAAS,EAAE,MAAQR,CACzB,CACD,CACD,CAAC,EAEKL,GAAe,CAACc,EAAMC,EAAOC,IAAW,CAC7C,IAAIC,EACAC,EACJ,OAAIF,IAAW,QACdC,EAAUH,EACVI,EAAWH,IAEXE,EAAUD,EAAO,QAAUF,EAC3BI,EAAWH,EAAQC,EAAO,UAGpB,CACN,KAAAF,EACA,MAAAC,EACA,QAAAE,EACA,SAAAC,EACA,OAAAF,CACD,CACD,EAEMjB,GAAgB,CAACoB,EAAMC,EAASC,IAAa,CAGlD,IAAMvB,EAAU,IAAIS,IAAee,GAAWxB,EAAUS,EAAW,SAAW,EAAM,GAAKA,EAAW,CAAC,EAAKA,EAAW,KAAK,GAAG,CAAC,EAI9H,cAAO,eAAeT,EAASc,EAAK,EAEpCd,EAAQe,EAAS,EAAIM,EACrBrB,EAAQG,EAAM,EAAImB,EAClBtB,EAAQI,EAAQ,EAAImB,EAEbvB,CACR,EAEMwB,GAAa,CAACH,EAAMI,IAAW,CACpC,GAAIJ,EAAK,OAAS,GAAK,CAACI,EACvB,OAAOJ,EAAKjB,EAAQ,EAAI,GAAKqB,EAG9B,IAAId,EAASU,EAAKlB,EAAM,EAExB,GAAIQ,IAAW,OACd,OAAOc,EAGR,GAAM,CAAC,QAAAN,EAAS,SAAAC,CAAQ,EAAIT,EAC5B,GAAIc,EAAO,SAAS,MAAQ,EAC3B,KAAOd,IAAW,QAIjBc,EAASC,GAAiBD,EAAQd,EAAO,MAAOA,EAAO,IAAI,EAE3DA,EAASA,EAAO,OAOlB,IAAMgB,EAAUF,EAAO,QAAQ;AAAA,CAAI,EACnC,OAAIE,IAAY,KACfF,EAASG,GAA+BH,EAAQL,EAAUD,EAASQ,CAAO,GAGpER,EAAUM,EAASL,CAC3B,EAEA,OAAO,iBAAiBzB,GAAY,UAAWI,EAAM,EAErD,IAAMP,GAAQG,GAAY,EACbkC,GAAclC,GAAY,CAAC,MAAOmC,GAAcA,GAAY,MAAQ,CAAC,CAAC,EAoBnF,IAAOC,EAAQC,GChOR,IAAMC,GAAW,CACtBC,EACAC,EACAC,IACE,CACF,IAAMC,EAAKH,aAAa,OAASI,GAAWJ,EAAGE,CAAG,EAAIF,EAChDK,EAAKJ,aAAa,OAASG,GAAWH,EAAGC,CAAG,EAAID,EAEhDK,EAAIH,IAAO,MAAQE,GAAM,MAAQE,GAAMJ,EAAIE,EAAIH,CAAG,EAExD,OACEI,GAAK,CACH,MAAOA,EAAE,CAAC,EACV,IAAKA,EAAE,CAAC,EACR,IAAKJ,EAAI,MAAM,EAAGI,EAAE,CAAC,CAAC,EACtB,KAAMJ,EAAI,MAAMI,EAAE,CAAC,EAAIH,EAAG,OAAQG,EAAE,CAAC,CAAC,EACtC,KAAMJ,EAAI,MAAMI,EAAE,CAAC,EAAID,EAAG,MAAM,EAGtC,EAEMD,GAAa,CAACI,EAAaN,IAAe,CAC9C,IAAMO,EAAIP,EAAI,MAAMM,CAAG,EACvB,OAAOC,EAAIA,EAAE,CAAC,EAAI,IACpB,EAEaF,GAAQ,CACnBP,EACAC,EACAC,IACgC,CAChC,IAAIQ,EACFC,EACAC,EACAC,EACAC,EACEC,EAAKb,EAAI,QAAQF,CAAC,EAClBgB,EAAKd,EAAI,QAAQD,EAAGc,EAAK,CAAC,EAC1BE,EAAIF,EAER,GAAIA,GAAM,GAAKC,EAAK,EAAG,CACrB,GAAIhB,IAAMC,EACR,MAAO,CAACc,EAAIC,CAAE,EAKhB,IAHAN,EAAO,CAAA,EACPE,EAAOV,EAAI,OAEJe,GAAK,GAAK,CAACH,GAAQ,CACxB,GAAIG,IAAMF,EACRL,EAAK,KAAKO,CAAC,EACXF,EAAKb,EAAI,QAAQF,EAAGiB,EAAI,CAAC,UAChBP,EAAK,SAAW,EAAG,CAC5B,IAAMJ,EAAII,EAAK,IAAG,EACdJ,IAAM,SAAWQ,EAAS,CAACR,EAAGU,CAAE,EACtC,MACEL,EAAMD,EAAK,IAAG,EACVC,IAAQ,QAAaA,EAAMC,IAC7BA,EAAOD,EACPE,EAAQG,GAGVA,EAAKd,EAAI,QAAQD,EAAGgB,EAAI,CAAC,EAG3BA,EAAIF,EAAKC,GAAMD,GAAM,EAAIA,EAAKC,CAChC,CAEIN,EAAK,QAAUG,IAAU,SAC3BC,EAAS,CAACF,EAAMC,CAAK,EAEzB,CAEA,OAAOC,CACT,ECvEA,IAAMI,GAAW,UAAY,KAAK,OAAM,EAAK,KACvCC,GAAU,SAAW,KAAK,OAAM,EAAK,KACrCC,GAAW,UAAY,KAAK,OAAM,EAAK,KACvCC,GAAW,UAAY,KAAK,OAAM,EAAK,KACvCC,GAAY,WAAa,KAAK,OAAM,EAAK,KACzCC,GAAkB,IAAI,OAAOL,GAAU,GAAG,EAC1CM,GAAiB,IAAI,OAAOL,GAAS,GAAG,EACxCM,GAAkB,IAAI,OAAOL,GAAU,GAAG,EAC1CM,GAAkB,IAAI,OAAOL,GAAU,GAAG,EAC1CM,GAAmB,IAAI,OAAOL,GAAW,GAAG,EAC5CM,GAAe,QACfC,GAAc,OACdC,GAAe,OACfC,GAAe,OACfC,GAAgB,OAETC,GAAgB,IAE7B,SAASC,GAAQC,EAAW,CAC1B,OAAQ,MAAMA,CAAU,EAAwBA,EAAI,WAAW,CAAC,EAApC,SAASA,EAAK,EAAE,CAC9C,CAEA,SAASC,GAAaD,EAAW,CAC/B,OAAOA,EACJ,QAAQP,GAAcV,EAAQ,EAC9B,QAAQW,GAAaV,EAAO,EAC5B,QAAQW,GAAcV,EAAQ,EAC9B,QAAQW,GAAcV,EAAQ,EAC9B,QAAQW,GAAeV,EAAS,CACrC,CAEA,SAASe,GAAeF,EAAW,CACjC,OAAOA,EACJ,QAAQZ,GAAiB,IAAI,EAC7B,QAAQC,GAAgB,GAAG,EAC3B,QAAQC,GAAiB,GAAG,EAC5B,QAAQC,GAAiB,GAAG,EAC5B,QAAQC,GAAkB,GAAG,CAClC,CAOA,SAASW,GAAgBH,EAAW,CAClC,GAAI,CAACA,EACH,MAAO,CAAC,EAAE,EAGZ,IAAMI,EAAkB,CAAA,EAClBC,EAAIC,GAAS,IAAK,IAAKN,CAAG,EAEhC,GAAI,CAACK,EACH,OAAOL,EAAI,MAAM,GAAG,EAGtB,GAAM,CAAE,IAAAO,EAAK,KAAAC,EAAM,KAAAC,CAAI,EAAKJ,EACtBK,EAAIH,EAAI,MAAM,GAAG,EAEvBG,EAAEA,EAAE,OAAS,CAAC,GAAK,IAAMF,EAAO,IAChC,IAAMG,EAAYR,GAAgBM,CAAI,EACtC,OAAIA,EAAK,SACLC,EAAEA,EAAE,OAAS,CAAC,GAAgBC,EAAU,MAAK,EAC/CD,EAAE,KAAK,MAAMA,EAAGC,CAAS,GAG3BP,EAAM,KAAK,MAAMA,EAAOM,CAAC,EAElBN,CACT,CAMM,SAAUQ,GAAOZ,EAAaa,EAAiC,CAAA,EAAE,CACrE,GAAI,CAACb,EACH,MAAO,CAAA,EAGT,GAAM,CAAE,IAAAc,EAAMhB,EAAa,EAAKe,EAQhC,OAAIb,EAAI,MAAM,EAAG,CAAC,IAAM,OACtBA,EAAM,SAAWA,EAAI,MAAM,CAAC,GAGvBe,GAAQd,GAAaD,CAAG,EAAGc,EAAK,EAAI,EAAE,IAAIZ,EAAc,CACjE,CAEA,SAASc,GAAQhB,EAAW,CAC1B,MAAO,IAAMA,EAAM,GACrB,CAEA,SAASiB,GAASC,EAAU,CAC1B,MAAO,SAAS,KAAKA,CAAE,CACzB,CAEA,SAASC,GAAIC,EAAWC,EAAS,CAC/B,OAAOD,GAAKC,CACd,CAEA,SAASC,GAAIF,EAAWC,EAAS,CAC/B,OAAOD,GAAKC,CACd,CAEA,SAASN,GAAQf,EAAac,EAAaS,EAAc,CAEvD,IAAMC,EAAuB,CAAA,EAEvBnB,EAAIC,GAAS,IAAK,IAAKN,CAAG,EAChC,GAAI,CAACK,EAAG,MAAO,CAACL,CAAG,EAGnB,IAAMO,EAAMF,EAAE,IACRI,EAAiBJ,EAAE,KAAK,OAASU,GAAQV,EAAE,KAAMS,EAAK,EAAK,EAAI,CAAC,EAAE,EAExE,GAAI,MAAM,KAAKT,EAAE,GAAG,EAClB,QAASoB,EAAI,EAAGA,EAAIhB,EAAK,QAAUgB,EAAIX,EAAKW,IAAK,CAC/C,IAAMC,EAAYnB,EAAM,IAAMF,EAAE,KAAO,IAAMI,EAAKgB,CAAC,EACnDD,EAAW,KAAKE,CAAS,CAC3B,KACK,CACL,IAAMC,EAAoB,iCAAiC,KAAKtB,EAAE,IAAI,EAChEuB,EAAkB,uCAAuC,KAC7DvB,EAAE,IAAI,EAEFwB,EAAaF,GAAqBC,EAClCE,EAAYzB,EAAE,KAAK,QAAQ,GAAG,GAAK,EACzC,GAAI,CAACwB,GAAc,CAACC,EAElB,OAAIzB,EAAE,KAAK,MAAM,YAAY,GAC3BL,EAAMK,EAAE,IAAM,IAAMA,EAAE,KAAOpB,GAAWoB,EAAE,KACnCU,GAAQf,EAAKc,EAAK,EAAI,GAExB,CAACd,CAAG,EAGb,IAAI+B,EACJ,GAAIF,EACFE,EAAI1B,EAAE,KAAK,MAAM,MAAM,UAEvB0B,EAAI5B,GAAgBE,EAAE,IAAI,EACtB0B,EAAE,SAAW,GAAKA,EAAE,CAAC,IAAM,SAE7BA,EAAIhB,GAAQgB,EAAE,CAAC,EAAGjB,EAAK,EAAK,EAAE,IAAIE,EAAO,EAGrCe,EAAE,SAAW,GACf,OAAOtB,EAAK,IAAI,GAAKJ,EAAE,IAAM0B,EAAE,CAAC,EAAI,CAAC,EAQ3C,IAAIC,EAEJ,GAAIH,GAAcE,EAAE,CAAC,IAAM,QAAaA,EAAE,CAAC,IAAM,OAAW,CAC1D,IAAME,EAAIlC,GAAQgC,EAAE,CAAC,CAAC,EAChBV,EAAItB,GAAQgC,EAAE,CAAC,CAAC,EAChBG,EAAQ,KAAK,IAAIH,EAAE,CAAC,EAAE,OAAQA,EAAE,CAAC,EAAE,MAAM,EAC3CI,EACFJ,EAAE,SAAW,GAAKA,EAAE,CAAC,IAAM,OAAY,KAAK,IAAIhC,GAAQgC,EAAE,CAAC,CAAC,CAAC,EAAI,EAC/DK,EAAOjB,GACKE,EAAIY,IAElBE,GAAQ,GACRC,EAAOd,IAET,IAAMe,EAAMN,EAAE,KAAKd,EAAQ,EAE3Be,EAAI,CAAA,EAEJ,QAASZ,EAAIa,EAAGG,EAAKhB,EAAGC,CAAC,EAAGD,GAAKe,EAAM,CACrC,IAAIG,EACJ,GAAIV,EACFU,EAAI,OAAO,aAAalB,CAAC,EACrBkB,IAAM,OACRA,EAAI,YAGNA,EAAI,OAAOlB,CAAC,EACRiB,EAAK,CACP,IAAME,EAAOL,EAAQI,EAAE,OACvB,GAAIC,EAAO,EAAG,CACZ,IAAMC,EAAI,IAAI,MAAMD,EAAO,CAAC,EAAE,KAAK,GAAG,EAClCnB,EAAI,EACNkB,EAAI,IAAME,EAAIF,EAAE,MAAM,CAAC,EAEvBA,EAAIE,EAAIF,CAEZ,CACF,CAEFN,EAAE,KAAKM,CAAC,CACV,CACF,KAAO,CACLN,EAAI,CAAA,EAEJ,QAASS,EAAI,EAAGA,EAAIV,EAAE,OAAQU,IAC5BT,EAAE,KAAK,MAAMA,EAAGjB,GAAQgB,EAAEU,CAAC,EAAa3B,EAAK,EAAK,CAAC,CAEvD,CAEA,QAAS2B,EAAI,EAAGA,EAAIT,EAAE,OAAQS,IAC5B,QAAShB,EAAI,EAAGA,EAAIhB,EAAK,QAAUe,EAAW,OAASV,EAAKW,IAAK,CAC/D,IAAMC,EAAYnB,EAAMyB,EAAES,CAAC,EAAIhC,EAAKgB,CAAC,GACjC,CAACF,GAASM,GAAcH,IAC1BF,EAAW,KAAKE,CAAS,CAE7B,CAEJ,CAEA,OAAOF,CACT,CChOO,IAAMkB,GACXC,GAC6B,CAC7B,GAAI,OAAOA,GAAY,SACrB,MAAM,IAAI,UAAU,iBAAiB,EAGvC,GAAIA,EAAQ,OAAS,MACnB,MAAM,IAAI,UAAU,qBAAqB,CAE7C,ECPA,IAAMC,GACJ,CACE,YAAa,CAAC,uBAAwB,EAAI,EAC1C,YAAa,CAAC,gBAAiB,EAAI,EACnC,YAAa,CAAC,cAAyB,EAAK,EAC5C,YAAa,CAAC,aAAc,EAAI,EAChC,YAAa,CAAC,UAAW,EAAI,EAC7B,YAAa,CAAC,UAAW,EAAI,EAC7B,YAAa,CAAC,eAAgB,GAAM,EAAI,EACxC,YAAa,CAAC,UAAW,EAAI,EAC7B,YAAa,CAAC,SAAU,EAAI,EAC5B,YAAa,CAAC,SAAU,EAAI,EAC5B,YAAa,CAAC,wBAAyB,EAAI,EAC3C,YAAa,CAAC,UAAW,EAAI,EAC7B,WAAY,CAAC,8BAA+B,EAAI,EAChD,aAAc,CAAC,YAAa,EAAK,GAK/BC,GAAeC,GAAcA,EAAE,QAAQ,YAAa,MAAM,EAE1DC,GAAgBD,GACpBA,EAAE,QAAQ,2BAA4B,MAAM,EAGxCE,GAAkBC,GAA6BA,EAAO,KAAK,EAAE,EAetDC,GAAa,CACxBC,EACAC,IACoB,CACpB,IAAMC,EAAMD,EAEZ,GAAID,EAAK,OAAOE,CAAG,IAAM,IACvB,MAAM,IAAI,MAAM,2BAA2B,EAG7C,IAAMJ,EAAmB,CAAA,EACnBK,EAAiB,CAAA,EAEnBC,EAAIF,EAAM,EACVG,EAAW,GACXC,EAAQ,GACRC,EAAW,GACXC,EAAS,GACTC,EAASP,EACTQ,EAAa,GACjBC,EAAO,KAAOP,EAAIJ,EAAK,QAAQ,CAC7B,IAAMY,EAAIZ,EAAK,OAAOI,CAAC,EACvB,IAAKQ,IAAM,KAAOA,IAAM,MAAQR,IAAMF,EAAM,EAAG,CAC7CM,EAAS,GACTJ,IACA,QACF,CAEA,GAAIQ,IAAM,KAAOP,GAAY,CAACE,EAAU,CACtCE,EAASL,EAAI,EACb,KACF,CAGA,GADAC,EAAW,GACPO,IAAM,MACJ,CAACL,EAAU,CACbA,EAAW,GACXH,IACA,QACF,CAGF,GAAIQ,IAAM,KAAO,CAACL,GAEhB,OAAW,CAACM,EAAK,CAACC,EAAMC,EAAGC,CAAG,CAAC,IAAK,OAAO,QAAQvB,EAAY,EAC7D,GAAIO,EAAK,WAAWa,EAAKT,CAAC,EAAG,CAE3B,GAAIM,EACF,MAAO,CAAC,KAAM,GAAOV,EAAK,OAASE,EAAK,EAAI,EAE9CE,GAAKS,EAAI,OACLG,EAAKb,EAAK,KAAKW,CAAI,EAClBhB,EAAO,KAAKgB,CAAI,EACrBR,EAAQA,GAASS,EACjB,SAASJ,CACX,EAMJ,GADAJ,EAAW,GACPG,EAAY,CAGVE,EAAIF,EACNZ,EAAO,KAAKJ,GAAYgB,CAAU,EAAI,IAAMhB,GAAYkB,CAAC,CAAC,EACjDA,IAAMF,GACfZ,EAAO,KAAKJ,GAAYkB,CAAC,CAAC,EAE5BF,EAAa,GACbN,IACA,QACF,CAIA,GAAIJ,EAAK,WAAW,KAAMI,EAAI,CAAC,EAAG,CAChCN,EAAO,KAAKJ,GAAYkB,EAAI,GAAG,CAAC,EAChCR,GAAK,EACL,QACF,CACA,GAAIJ,EAAK,WAAW,IAAKI,EAAI,CAAC,EAAG,CAC/BM,EAAaE,EACbR,GAAK,EACL,QACF,CAGAN,EAAO,KAAKJ,GAAYkB,CAAC,CAAC,EAC1BR,GACF,CAEA,GAAIK,EAASL,EAGX,MAAO,CAAC,GAAI,GAAO,EAAG,EAAK,EAK7B,GAAI,CAACN,EAAO,QAAU,CAACK,EAAK,OAC1B,MAAO,CAAC,KAAM,GAAOH,EAAK,OAASE,EAAK,EAAI,EAO9C,GACEC,EAAK,SAAW,GAChBL,EAAO,SAAW,GAClB,SAAS,KAAKA,EAAO,CAAC,CAAC,GACvB,CAACU,EACD,CACA,IAAMS,EAAInB,EAAO,CAAC,EAAE,SAAW,EAAIA,EAAO,CAAC,EAAE,MAAM,EAAE,EAAIA,EAAO,CAAC,EACjE,MAAO,CAACF,GAAaqB,CAAC,EAAG,GAAOR,EAASP,EAAK,EAAK,CACrD,CAEA,IAAMgB,EAAU,KAAOV,EAAS,IAAM,IAAMX,GAAeC,CAAM,EAAI,IAC/DqB,EAAQ,KAAOX,EAAS,GAAK,KAAOX,GAAeM,CAAI,EAAI,IAMjE,MAAO,CAJLL,EAAO,QAAUK,EAAK,OAAS,IAAMe,EAAU,IAAMC,EAAQ,IAC3DrB,EAAO,OAASoB,EAChBC,EAEUb,EAAOG,EAASP,EAAK,EAAI,CACzC,ECrJO,IAAMkB,GAAW,CACtBC,EACA,CACE,qBAAAC,EAAuB,GACvB,cAAAC,EAAgB,EAAI,EACgD,CAAA,IAElEA,EACKD,EACHD,EAAE,QAAQ,iBAAkB,IAAI,EAChCA,EACG,QAAQ,4BAA6B,MAAM,EAC3C,QAAQ,aAAc,IAAI,EAE5BC,EACHD,EAAE,QAAQ,mBAAoB,IAAI,EAClCA,EACG,QAAQ,8BAA+B,MAAM,EAC7C,QAAQ,eAAgB,IAAI,ECIrC,IAAMG,GAAQ,IAAI,IAAiB,CAAC,IAAK,IAAK,IAAK,IAAK,GAAG,CAAC,EACtDC,GAAiBC,GACrBF,GAAM,IAAIE,CAAgB,EAMtBC,GAAmB,4BACnBC,GAAa,UAKbC,GAAkB,IAAI,IAAI,CAAC,IAAK,GAAG,CAAC,EAEpCC,GAAW,IAAI,IAAI,CAAC,KAAM,GAAG,CAAC,EAC9BC,GAAa,IAAI,IAAI,iBAAiB,EACtCC,GAAgBC,GACpBA,EAAE,QAAQ,2BAA4B,MAAM,EAGxCC,GAAQ,OAGRC,GAAOD,GAAQ,KAGfE,GAAcF,GAAQ,KAKfG,GAAP,MAAOC,CAAG,CACd,KACSC,GAETC,GACAC,GAAkB,GAClBC,GAA2B,CAAA,EAClBC,GACAC,GACTC,GACAC,GAAuB,GACvBC,GACAC,GAGAC,GAAqB,GAErB,YACEC,EACAC,EACAC,EAA4B,CAAA,EAAE,CAE9B,KAAK,KAAOF,EAERA,IAAM,KAAKV,GAAY,IAC3B,KAAKG,GAAUQ,EACf,KAAKZ,GAAQ,KAAKI,GAAU,KAAKA,GAAQJ,GAAQ,KACjD,KAAKQ,GAAW,KAAKR,KAAU,KAAOa,EAAU,KAAKb,GAAMQ,GAC3D,KAAKF,GAAQ,KAAKN,KAAU,KAAO,CAAA,EAAK,KAAKA,GAAMM,GAC/CK,IAAS,KAAO,CAAC,KAAKX,GAAMO,IAAa,KAAKD,GAAM,KAAK,IAAI,EACjE,KAAKD,GAAe,KAAKD,GAAU,KAAKA,GAAQD,GAAO,OAAS,CAClE,CAEA,IAAI,UAAQ,CAEV,GAAI,KAAKF,KAAc,OAAW,OAAO,KAAKA,GAE9C,QAAWa,KAAK,KAAKX,GACnB,GAAI,OAAOW,GAAM,WACbA,EAAE,MAAQA,EAAE,UAAU,OAAQ,KAAKb,GAAY,GAGrD,OAAO,KAAKA,EACd,CAGA,UAAQ,CACN,OAAI,KAAKQ,KAAc,OAAkB,KAAKA,GACzC,KAAK,KAGA,KAAKA,GACX,KAAK,KAAO,IAAM,KAAKN,GAAO,IAAIW,GAAK,OAAOA,CAAC,CAAC,EAAE,KAAK,GAAG,EAAI,IAHxD,KAAKL,GAAY,KAAKN,GAAO,IAAIW,GAAK,OAAOA,CAAC,CAAC,EAAE,KAAK,EAAE,CAKpE,CAEAC,IAAS,CAEP,GAAI,OAAS,KAAKf,GAAO,MAAM,IAAI,MAAM,0BAA0B,EACnE,GAAI,KAAKO,GAAa,OAAO,KAI7B,KAAK,SAAQ,EACb,KAAKA,GAAc,GACnB,IAAIS,EACJ,KAAQA,EAAI,KAAKV,GAAM,IAAG,GAAK,CAC7B,GAAIU,EAAE,OAAS,IAAK,SAEpB,IAAIF,EAAqBE,EACrBC,EAAKH,EAAEV,GACX,KAAOa,GAAI,CACT,QACMC,EAAIJ,EAAET,GAAe,EACzB,CAACY,EAAG,MAAQC,EAAID,EAAGd,GAAO,OAC1Be,IAEA,QAAWC,KAAQH,EAAEb,GAAQ,CAE3B,GAAI,OAAOgB,GAAS,SAClB,MAAM,IAAI,MAAM,8BAA8B,EAGhDA,EAAK,OAAOF,EAAGd,GAAOe,CAAC,CAAC,CAC1B,CAEFJ,EAAIG,EACJA,EAAKH,EAAEV,EACT,CACF,CACA,OAAO,IACT,CAEA,QAAQgB,EAAuB,CAC7B,QAAWN,KAAKM,EACd,GAAIN,IAAM,GAEV,IACE,OAAOA,GAAM,UACb,EAAEA,aAAaf,GAAOe,EAAEV,KAAY,MAEpC,MAAM,IAAI,MAAM,iBAAmBU,CAAC,EAGtC,KAAKX,GAAO,KAAKW,CAAC,EAEtB,CAEA,QAAM,CACJ,IAAMO,EACJ,KAAK,OAAS,KACZ,KAAKlB,GACF,MAAK,EACL,IAAIW,GAAM,OAAOA,GAAM,SAAWA,EAAIA,EAAE,OAAM,CAAG,EACpD,CAAC,KAAK,KAAM,GAAG,KAAKX,GAAO,IAAIW,GAAMA,EAAU,OAAM,CAAE,CAAC,EAC5D,OAAI,KAAK,QAAO,GAAM,CAAC,KAAK,MAAMO,EAAI,QAAQ,CAAA,CAAE,EAE9C,KAAK,MAAK,IACT,OAAS,KAAKrB,IACZ,KAAKA,GAAMO,IAAe,KAAKH,IAAS,OAAS,MAEpDiB,EAAI,KAAK,CAAA,CAAE,EAENA,CACT,CAEA,SAAO,CACL,GAAI,KAAKrB,KAAU,KAAM,MAAO,GAEhC,GAAI,CAAC,KAAKI,IAAS,QAAO,EAAI,MAAO,GACrC,GAAI,KAAKC,KAAiB,EAAG,MAAO,GAEpC,IAAMS,EAAI,KAAKV,GACf,QAASc,EAAI,EAAGA,EAAI,KAAKb,GAAca,IAAK,CAC1C,IAAMD,EAAKH,EAAEX,GAAOe,CAAC,EACrB,GAAI,EAAED,aAAclB,GAAOkB,EAAG,OAAS,KACrC,MAAO,EAEX,CACA,MAAO,EACT,CAEA,OAAK,CAEH,GADI,KAAKjB,KAAU,MACf,KAAKI,IAAS,OAAS,IAAK,MAAO,GACvC,GAAI,CAAC,KAAKA,IAAS,MAAK,EAAI,MAAO,GACnC,GAAI,CAAC,KAAK,KAAM,OAAO,KAAKA,IAAS,MAAK,EAG1C,IAAMkB,EAAK,KAAKlB,GAAU,KAAKA,GAAQD,GAAO,OAAS,EAEvD,OAAO,KAAKE,KAAiBiB,EAAK,CACpC,CAEA,OAAOH,EAAkB,CACnB,OAAOA,GAAS,SAAU,KAAK,KAAKA,CAAI,EACvC,KAAK,KAAKA,EAAK,MAAM,IAAI,CAAC,CACjC,CAEA,MAAMP,EAAW,CACf,IAAMzB,EAAI,IAAIY,EAAI,KAAK,KAAMa,CAAM,EACnC,QAAWE,KAAK,KAAKX,GACnBhB,EAAE,OAAO2B,CAAC,EAEZ,OAAO3B,CACT,CAEA,MAAOoC,GACLC,EACAC,EACAC,EACAC,EAAqB,CAErB,IAAIC,EAAW,GACXC,EAAU,GACVC,EAAa,GACbC,EAAW,GACf,GAAIN,EAAI,OAAS,KAAM,CAErB,IAAIP,EAAIQ,EACJM,EAAM,GACV,KAAOd,EAAIM,EAAI,QAAQ,CACrB,IAAMrC,EAAIqC,EAAI,OAAON,GAAG,EAGxB,GAAIU,GAAYzC,IAAM,KAAM,CAC1ByC,EAAW,CAACA,EACZI,GAAO7C,EACP,QACF,CAEA,GAAI0C,EAAS,CACPX,IAAMY,EAAa,GACjB3C,IAAM,KAAOA,IAAM,OACrB4C,EAAW,IAEJ5C,IAAM,KAAO,EAAE+B,IAAMY,EAAa,GAAKC,KAChDF,EAAU,IAEZG,GAAO7C,EACP,QACF,SAAWA,IAAM,IAAK,CACpB0C,EAAU,GACVC,EAAaZ,EACba,EAAW,GACXC,GAAO7C,EACP,QACF,CAEA,GAAI,CAACwC,EAAI,OAASzC,GAAcC,CAAC,GAAKqC,EAAI,OAAON,CAAC,IAAM,IAAK,CAC3DO,EAAI,KAAKO,CAAG,EACZA,EAAM,GACN,IAAMC,EAAM,IAAIlC,EAAIZ,EAAGsC,CAAG,EAC1BP,EAAInB,EAAIwB,GAAUC,EAAKS,EAAKf,EAAGS,CAAG,EAClCF,EAAI,KAAKQ,CAAG,EACZ,QACF,CACAD,GAAO7C,CACT,CACA,OAAAsC,EAAI,KAAKO,CAAG,EACLd,CACT,CAIA,IAAIA,EAAIQ,EAAM,EACVP,EAAO,IAAIpB,EAAI,KAAM0B,CAAG,EACtBL,EAAe,CAAA,EACjBY,EAAM,GACV,KAAOd,EAAIM,EAAI,QAAQ,CACrB,IAAMrC,EAAIqC,EAAI,OAAON,GAAG,EAGxB,GAAIU,GAAYzC,IAAM,KAAM,CAC1ByC,EAAW,CAACA,EACZI,GAAO7C,EACP,QACF,CAEA,GAAI0C,EAAS,CACPX,IAAMY,EAAa,GACjB3C,IAAM,KAAOA,IAAM,OACrB4C,EAAW,IAEJ5C,IAAM,KAAO,EAAE+B,IAAMY,EAAa,GAAKC,KAChDF,EAAU,IAEZG,GAAO7C,EACP,QACF,SAAWA,IAAM,IAAK,CACpB0C,EAAU,GACVC,EAAaZ,EACba,EAAW,GACXC,GAAO7C,EACP,QACF,CAEA,GAAID,GAAcC,CAAC,GAAKqC,EAAI,OAAON,CAAC,IAAM,IAAK,CAC7CC,EAAK,KAAKa,CAAG,EACbA,EAAM,GACN,IAAMC,EAAM,IAAIlC,EAAIZ,EAAGgC,CAAI,EAC3BA,EAAK,KAAKc,CAAG,EACbf,EAAInB,EAAIwB,GAAUC,EAAKS,EAAKf,EAAGS,CAAG,EAClC,QACF,CACA,GAAIxC,IAAM,IAAK,CACbgC,EAAK,KAAKa,CAAG,EACbA,EAAM,GACNZ,EAAM,KAAKD,CAAI,EACfA,EAAO,IAAIpB,EAAI,KAAM0B,CAAG,EACxB,QACF,CACA,GAAItC,IAAM,IACR,OAAI6C,IAAQ,IAAMP,EAAItB,GAAO,SAAW,IACtCsB,EAAIf,GAAY,IAElBS,EAAK,KAAKa,CAAG,EACbA,EAAM,GACNP,EAAI,KAAK,GAAGL,EAAOD,CAAI,EAChBD,EAETc,GAAO7C,CACT,CAKA,OAAAsC,EAAI,KAAO,KACXA,EAAIxB,GAAY,OAChBwB,EAAItB,GAAS,CAACqB,EAAI,UAAUE,EAAM,CAAC,CAAC,EAC7BR,CACT,CAEA,OAAO,SAASgB,EAAiBrB,EAA4B,CAAA,EAAE,CAC7D,IAAMY,EAAM,IAAI1B,EAAI,KAAM,OAAWc,CAAO,EAC5C,OAAAd,EAAIwB,GAAUW,EAAST,EAAK,EAAGZ,CAAO,EAC/BY,CACT,CAIA,aAAW,CAGT,GAAI,OAAS,KAAKzB,GAAO,OAAO,KAAKA,GAAM,YAAW,EAEtD,IAAMmC,EAAO,KAAK,SAAQ,EACpB,CAACC,EAAIC,EAAMC,EAAUC,CAAK,EAAI,KAAK,eAAc,EAUvD,GAAI,EALFD,GACA,KAAKrC,IACJ,KAAKO,GAAS,QACb,CAAC,KAAKA,GAAS,iBACf2B,EAAK,YAAW,IAAOA,EAAK,YAAW,GAEzC,OAAOE,EAGT,IAAMG,GAAS,KAAKhC,GAAS,OAAS,IAAM,KAAO+B,EAAQ,IAAM,IACjE,OAAO,OAAO,OAAO,IAAI,OAAO,IAAIH,CAAE,IAAKI,CAAK,EAAG,CACjD,KAAMJ,EACN,MAAOD,EACR,CACH,CAEA,IAAI,SAAO,CACT,OAAO,KAAK3B,EACd,CAuEA,eACEiC,EAAkB,CAElB,IAAMC,EAAMD,GAAY,CAAC,CAAC,KAAKjC,GAAS,IAExC,GADI,KAAKR,KAAU,MAAM,KAAKe,GAAS,EACnC,CAAC,KAAK,KAAM,CACd,IAAM4B,EACJ,KAAK,QAAO,GACZ,KAAK,MAAK,GACV,CAAC,KAAKxC,GAAO,KAAKT,GAAK,OAAOA,GAAM,QAAQ,EACxCkD,EAAM,KAAKzC,GACd,IAAI,GAAI,CACP,GAAM,CAACiC,EAAIS,EAAGP,EAAUC,CAAK,EAC3B,OAAO,GAAM,SACXxC,EAAI+C,GAAW,EAAG,KAAK7C,GAAW0C,CAAO,EACzC,EAAE,eAAeF,CAAQ,EAC7B,YAAKxC,GAAY,KAAKA,IAAaqC,EACnC,KAAKpC,GAAS,KAAKA,IAAUqC,EACtBH,CACT,CAAC,EACA,KAAK,EAAE,EAENW,EAAQ,GACZ,GAAI,KAAK,QAAO,GACV,OAAO,KAAK5C,GAAO,CAAC,GAAM,UAQxB,EADF,KAAKA,GAAO,SAAW,GAAKZ,GAAS,IAAI,KAAKY,GAAO,CAAC,CAAC,GACpC,CACnB,IAAM6C,EAAM1D,GAGN2D,EAEHP,GAAOM,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC,GAE5BA,EAAI,WAAW,KAAK,GAAKI,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC,GAE9CA,EAAI,WAAW,QAAQ,GAAKI,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC,EAG9CM,EAAY,CAACR,GAAO,CAACD,GAAYO,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC,EAE5DG,EACEE,EAAa7D,GACX8D,EAAY7D,GACZ,EACN,CAKJ,IAAI8D,EAAM,GACV,OACE,KAAK,MAAK,GACV,KAAKnD,GAAMO,IACX,KAAKH,IAAS,OAAS,MAEvB+C,EAAM,aAGD,CADOJ,EAAQH,EAAMO,EAG1BC,GAASR,CAAG,EACX,KAAK3C,GAAY,CAAC,CAAC,KAAKA,GACzB,KAAKC,GAET,CAMA,IAAMmD,EAAW,KAAK,OAAS,KAAO,KAAK,OAAS,IAE9CN,EAAQ,KAAK,OAAS,IAAM,YAAc,MAC5CV,EAAO,KAAKiB,GAAeZ,CAAG,EAElC,GAAI,KAAK,QAAO,GAAM,KAAK,MAAK,GAAM,CAACL,GAAQ,KAAK,OAAS,IAAK,CAGhE,IAAM3C,EAAI,KAAK,SAAQ,EACvB,YAAKS,GAAS,CAACT,CAAC,EAChB,KAAK,KAAO,KACZ,KAAKO,GAAY,OACV,CAACP,EAAG0D,GAAS,KAAK,SAAQ,CAAE,EAAG,GAAO,EAAK,CACpD,CAGA,IAAIG,EACF,CAACF,GAAYZ,GAAYC,GAAO,CAACrD,GAC/B,GACA,KAAKiE,GAAe,EAAI,EACxBC,IAAmBlB,IACrBkB,EAAiB,IAEfA,IACFlB,EAAO,MAAMA,CAAI,OAAOkB,CAAc,OAIxC,IAAIC,EAAQ,GACZ,GAAI,KAAK,OAAS,KAAO,KAAK9C,GAC5B8C,GAAS,KAAK,QAAO,GAAM,CAACd,EAAMrD,GAAa,IAAMQ,OAChD,CACL,IAAM4D,EACJ,KAAK,OAAS,IAEZ,MACC,KAAK,QAAO,GAAM,CAACf,GAAO,CAACD,EAAWpD,GAAa,IACpDO,GACA,IACA,KAAK,OAAS,IAAM,IACpB,KAAK,OAAS,IAAM,KACpB,KAAK,OAAS,KAAO2D,EAAiB,IACtC,KAAK,OAAS,KAAOA,EAAiB,KACtC,IAAI,KAAK,IAAI,GACjBC,EAAQT,EAAQV,EAAOoB,CACzB,CACA,MAAO,CACLD,EACAJ,GAASf,CAAI,EACZ,KAAKpC,GAAY,CAAC,CAAC,KAAKA,GACzB,KAAKC,GAET,CAEAoD,GAAeZ,EAAY,CACzB,OAAO,KAAKvC,GACT,IAAIW,GAAI,CAGP,GAAI,OAAOA,GAAM,SACf,MAAM,IAAI,MAAM,8BAA8B,EAIhD,GAAM,CAACsB,EAAIS,EAAGa,EAAWnB,CAAK,EAAIzB,EAAE,eAAe4B,CAAG,EACtD,YAAKxC,GAAS,KAAKA,IAAUqC,EACtBH,CACT,CAAC,EACA,OAAOtB,GAAK,EAAE,KAAK,QAAO,GAAM,KAAK,MAAK,IAAO,CAAC,CAACA,CAAC,EACpD,KAAK,GAAG,CACb,CAEA,MAAOgC,GACLX,EACAG,EACAK,EAAmB,GAAK,CAExB,IAAIf,EAAW,GACXQ,EAAK,GACLG,EAAQ,GAERoB,EAAS,GACb,QAASzC,EAAI,EAAGA,EAAIiB,EAAK,OAAQjB,IAAK,CACpC,IAAM/B,EAAIgD,EAAK,OAAOjB,CAAC,EACvB,GAAIU,EAAU,CACZA,EAAW,GACXQ,IAAO5C,GAAW,IAAIL,CAAC,EAAI,KAAO,IAAMA,EACxC,QACF,CACA,GAAIA,IAAM,IAAK,CACb,GAAIwE,EAAQ,SACZA,EAAS,GACTvB,GAAMO,GAAW,SAAS,KAAKR,CAAI,EAAItC,GAAcD,GACrD0C,EAAW,GACX,QACF,MACEqB,EAAS,GAEX,GAAIxE,IAAM,KAAM,CACV+B,IAAMiB,EAAK,OAAS,EACtBC,GAAM,OAENR,EAAW,GAEb,QACF,CACA,GAAIzC,IAAM,IAAK,CACb,GAAM,CAACyD,EAAKgB,EAAWC,EAAUC,CAAK,EAAIC,GAAW5B,EAAMjB,CAAC,EAC5D,GAAI2C,EAAU,CACZzB,GAAMQ,EACNL,EAAQA,GAASqB,EACjB1C,GAAK2C,EAAW,EAChBvB,EAAWA,GAAYwB,EACvB,QACF,CACF,CACA,GAAI3E,IAAM,IAAK,CACbiD,GAAMzC,GACN2C,EAAW,GACX,QACF,CACAF,GAAM3C,GAAaN,CAAC,CACtB,CACA,MAAO,CAACiD,EAAIgB,GAASjB,CAAI,EAAG,CAAC,CAACG,EAAUC,CAAK,CAC/C,GCzpBK,IAAMyB,GAAS,CACpBC,EACA,CACE,qBAAAC,EAAuB,GACvB,cAAAC,EAAgB,EAAK,EAC+C,CAAA,IAKlEA,EACKD,EACHD,EAAE,QAAQ,eAAgB,MAAM,EAChCA,EAAE,QAAQ,iBAAkB,MAAM,EAEjCC,EACHD,EAAE,QAAQ,aAAc,MAAM,EAC9BA,EAAE,QAAQ,eAAgB,MAAM,EC6D/B,IAAMG,GAAY,CACvBC,EACAC,EACAC,EAA4B,CAAA,KAE5BC,GAAmBF,CAAO,EAGtB,CAACC,EAAQ,WAAaD,EAAQ,OAAO,CAAC,IAAM,IACvC,GAGF,IAAIG,GAAUH,EAASC,CAAO,EAAE,MAAMF,CAAC,GAI1CK,GAAe,wBACfC,GAAkBC,GAAiBC,GACvC,CAACA,EAAE,WAAW,GAAG,GAAKA,EAAE,SAASD,CAAG,EAChCE,GAAqBF,GAAiBC,GAAcA,EAAE,SAASD,CAAG,EAClEG,GAAwBH,IAC5BA,EAAMA,EAAI,YAAW,EACbC,GAAc,CAACA,EAAE,WAAW,GAAG,GAAKA,EAAE,YAAW,EAAG,SAASD,CAAG,GAEpEI,GAA2BJ,IAC/BA,EAAMA,EAAI,YAAW,EACbC,GAAcA,EAAE,YAAW,EAAG,SAASD,CAAG,GAE9CK,GAAgB,aAChBC,GAAmBL,GACvB,CAACA,EAAE,WAAW,GAAG,GAAKA,EAAE,SAAS,GAAG,EAChCM,GAAsBN,GAC1BA,IAAM,KAAOA,IAAM,MAAQA,EAAE,SAAS,GAAG,EACrCO,GAAY,UACZC,GAAeR,GACnBA,IAAM,KAAOA,IAAM,MAAQA,EAAE,WAAW,GAAG,EACvCS,GAAS,QACTC,GAAYV,GAAcA,EAAE,SAAW,GAAK,CAACA,EAAE,WAAW,GAAG,EAC7DW,GAAeX,GACnBA,EAAE,SAAW,GAAKA,IAAM,KAAOA,IAAM,KACjCY,GAAW,yBACXC,GAAmB,CAAC,CAACC,EAAIf,EAAM,EAAE,IAAuB,CAC5D,IAAMgB,EAAQC,GAAgB,CAACF,CAAE,CAAC,EAClC,OAAKf,GACLA,EAAMA,EAAI,YAAW,EACbC,GAAce,EAAMf,CAAC,GAAKA,EAAE,YAAW,EAAG,SAASD,CAAG,GAF7CgB,CAGnB,EACME,GAAsB,CAAC,CAACH,EAAIf,EAAM,EAAE,IAAuB,CAC/D,IAAMgB,EAAQG,GAAmB,CAACJ,CAAE,CAAC,EACrC,OAAKf,GACLA,EAAMA,EAAI,YAAW,EACbC,GAAce,EAAMf,CAAC,GAAKA,EAAE,YAAW,EAAG,SAASD,CAAG,GAF7CgB,CAGnB,EACMI,GAAgB,CAAC,CAACL,EAAIf,EAAM,EAAE,IAAuB,CACzD,IAAMgB,EAAQG,GAAmB,CAACJ,CAAE,CAAC,EACrC,OAAQf,EAAeC,GAAce,EAAMf,CAAC,GAAKA,EAAE,SAASD,CAAG,EAAjDgB,CAChB,EACMK,GAAa,CAAC,CAACN,EAAIf,EAAM,EAAE,IAAuB,CACtD,IAAMgB,EAAQC,GAAgB,CAACF,CAAE,CAAC,EAClC,OAAQf,EAAeC,GAAce,EAAMf,CAAC,GAAKA,EAAE,SAASD,CAAG,EAAjDgB,CAChB,EACMC,GAAkB,CAAC,CAACF,CAAE,IAAuB,CACjD,IAAMO,EAAMP,EAAG,OACf,OAAQd,GAAcA,EAAE,SAAWqB,GAAO,CAACrB,EAAE,WAAW,GAAG,CAC7D,EACMkB,GAAqB,CAAC,CAACJ,CAAE,IAAuB,CACpD,IAAMO,EAAMP,EAAG,OACf,OAAQd,GAAcA,EAAE,SAAWqB,GAAOrB,IAAM,KAAOA,IAAM,IAC/D,EAGMsB,GACJ,OAAO,SAAY,UAAY,QAC5B,OAAO,QAAQ,KAAQ,UACtB,QAAQ,KACR,QAAQ,IAAI,gCACd,QAAQ,SACR,QAIEC,GAAsC,CAC1C,MAAO,CAAE,IAAK,IAAI,EAClB,MAAO,CAAE,IAAK,GAAG,GAINC,GACXF,KAAoB,QAAUC,GAAK,MAAM,IAAMA,GAAK,MAAM,IAC5DhC,GAAU,IAAMiC,GAET,IAAMC,GAAW,OAAO,aAAa,EAC5ClC,GAAU,SAAWkC,GAIrB,IAAMC,GAAQ,OAGRC,GAAOD,GAAQ,KAKfE,GAAa,0CAIbC,GAAe,0BAERC,GACX,CAACrC,EAAiBC,EAA4B,CAAA,IAC7CF,GACCD,GAAUC,EAAGC,EAASC,CAAO,EACjCH,GAAU,OAASuC,GAEnB,IAAM/B,GAAM,CAACgC,EAAqBC,EAAsB,CAAA,IACtD,OAAO,OAAO,CAAA,EAAID,EAAGC,CAAC,EAEXC,GAAYC,GAA2C,CAClE,GAAI,CAACA,GAAO,OAAOA,GAAQ,UAAY,CAAC,OAAO,KAAKA,CAAG,EAAE,OACvD,OAAO3C,GAGT,IAAM4C,EAAO5C,GAKb,OAAO,OAAO,OAHJ,CAACC,EAAWC,EAAiBC,EAA4B,CAAA,IACjEyC,EAAK3C,EAAGC,EAASM,GAAImC,EAAKxC,CAAO,CAAC,EAEZ,CACtB,UAAW,cAAwByC,EAAK,SAAS,CAC/C,YAAY1C,EAAiBC,EAA4B,CAAA,EAAE,CACzD,MAAMD,EAASM,GAAImC,EAAKxC,CAAO,CAAC,CAClC,CACA,OAAO,SAASA,EAAyB,CACvC,OAAOyC,EAAK,SAASpC,GAAImC,EAAKxC,CAAO,CAAC,EAAE,SAC1C,GAGF,IAAK,cAAkByC,EAAK,GAAG,CAE7B,YACEC,EACAC,EACA3C,EAA4B,CAAA,EAAE,CAE9B,MAAM0C,EAAMC,EAAQtC,GAAImC,EAAKxC,CAAO,CAAC,CACvC,CAGA,OAAO,SAASD,EAAiBC,EAA4B,CAAA,EAAE,CAC7D,OAAOyC,EAAK,IAAI,SAAS1C,EAASM,GAAImC,EAAKxC,CAAO,CAAC,CACrD,GAGF,SAAU,CACR4C,EACA5C,EAGI,CAAA,IACDyC,EAAK,SAASG,EAAGvC,GAAImC,EAAKxC,CAAO,CAAC,EAEvC,OAAQ,CACN4C,EACA5C,EAGI,CAAA,IACDyC,EAAK,OAAOG,EAAGvC,GAAImC,EAAKxC,CAAO,CAAC,EAErC,OAAQ,CAACD,EAAiBC,EAA4B,CAAA,IACpDyC,EAAK,OAAO1C,EAASM,GAAImC,EAAKxC,CAAO,CAAC,EAExC,SAAWA,GACTyC,EAAK,SAASpC,GAAImC,EAAKxC,CAAO,CAAC,EAEjC,OAAQ,CAACD,EAAiBC,EAA4B,CAAA,IACpDyC,EAAK,OAAO1C,EAASM,GAAImC,EAAKxC,CAAO,CAAC,EAExC,YAAa,CAACD,EAAiBC,EAA4B,CAAA,IACzDyC,EAAK,YAAY1C,EAASM,GAAImC,EAAKxC,CAAO,CAAC,EAE7C,MAAO,CACL6C,EACA9C,EACAC,EAA4B,CAAA,IACzByC,EAAK,MAAMI,EAAM9C,EAASM,GAAImC,EAAKxC,CAAO,CAAC,EAEhD,IAAKyC,EAAK,IACV,SAAUV,GACX,CACH,EACAlC,GAAU,SAAW0C,GAYd,IAAMO,GAAc,CACzB/C,EACAC,EAA4B,CAAA,KAE5BC,GAAmBF,CAAO,EAItBC,EAAQ,SAAW,CAAC,mBAAmB,KAAKD,CAAO,EAE9C,CAACA,CAAO,EAGVgD,GAAOhD,EAAS,CAAE,IAAKC,EAAQ,cAAc,CAAE,GAExDH,GAAU,YAAciD,GAcjB,IAAME,GAAS,CAACjD,EAAiBC,EAA4B,CAAA,IAClE,IAAIE,GAAUH,EAASC,CAAO,EAAE,OAAM,EACxCH,GAAU,OAASmD,GAEZ,IAAMC,GAAQ,CACnBJ,EACA9C,EACAC,EAA4B,CAAA,IAC1B,CACF,IAAMkD,EAAK,IAAIhD,GAAUH,EAASC,CAAO,EACzC,OAAA6C,EAAOA,EAAK,OAAOvC,GAAK4C,EAAG,MAAM5C,CAAC,CAAC,EAC/B4C,EAAG,QAAQ,QAAU,CAACL,EAAK,QAC7BA,EAAK,KAAK9C,CAAO,EAEZ8C,CACT,EACAhD,GAAU,MAAQoD,GAGlB,IAAME,GAAY,0BACZC,GAAgBR,GACpBA,EAAE,QAAQ,2BAA4B,MAAM,EAUjC1C,GAAP,KAAgB,CACpB,QACA,IACA,QAEA,qBACA,SACA,OACA,QACA,MACA,wBACA,QACA,QACA,UACA,OAEA,UACA,SACA,mBAEA,OACA,YAAYH,EAAiBC,EAA4B,CAAA,EAAE,CACzDC,GAAmBF,CAAO,EAE1BC,EAAUA,GAAW,CAAA,EACrB,KAAK,QAAUA,EACf,KAAK,QAAUD,EACf,KAAK,SAAWC,EAAQ,UAAY4B,GACpC,KAAK,UAAY,KAAK,WAAa,QAEnC,IAAMyB,EAAO,qBACb,KAAK,qBACH,CAAC,CAACrD,EAAQ,sBAAwBA,EAAQqD,CAAG,IAAM,GACjD,KAAK,uBACP,KAAK,QAAU,KAAK,QAAQ,QAAQ,MAAO,GAAG,GAEhD,KAAK,wBAA0B,CAAC,CAACrD,EAAQ,wBACzC,KAAK,OAAS,KACd,KAAK,OAAS,GACd,KAAK,SAAW,CAAC,CAACA,EAAQ,SAC1B,KAAK,QAAU,GACf,KAAK,MAAQ,GACb,KAAK,QAAU,CAAC,CAACA,EAAQ,QACzB,KAAK,OAAS,CAAC,CAAC,KAAK,QAAQ,OAC7B,KAAK,mBACHA,EAAQ,qBAAuB,OAC7BA,EAAQ,mBACR,CAAC,EAAE,KAAK,WAAa,KAAK,QAE9B,KAAK,QAAU,CAAA,EACf,KAAK,UAAY,CAAA,EACjB,KAAK,IAAM,CAAA,EAGX,KAAK,KAAI,CACX,CAEA,UAAQ,CACN,GAAI,KAAK,QAAQ,eAAiB,KAAK,IAAI,OAAS,EAClD,MAAO,GAET,QAAWD,KAAW,KAAK,IACzB,QAAWuD,KAAQvD,EACjB,GAAI,OAAOuD,GAAS,SAAU,MAAO,GAGzC,MAAO,EACT,CAEA,SAASC,EAAQ,CAAG,CAEpB,MAAI,CACF,IAAMxD,EAAU,KAAK,QACfC,EAAU,KAAK,QAGrB,GAAI,CAACA,EAAQ,WAAaD,EAAQ,OAAO,CAAC,IAAM,IAAK,CACnD,KAAK,QAAU,GACf,MACF,CAEA,GAAI,CAACA,EAAS,CACZ,KAAK,MAAQ,GACb,MACF,CAGA,KAAK,YAAW,EAGhB,KAAK,QAAU,CAAC,GAAG,IAAI,IAAI,KAAK,YAAW,CAAE,CAAC,EAE1CC,EAAQ,QACV,KAAK,MAAQ,IAAIwD,IAAgB,QAAQ,MAAM,GAAGA,CAAI,GAGxD,KAAK,MAAM,KAAK,QAAS,KAAK,OAAO,EAWrC,IAAMC,EAAe,KAAK,QAAQ,IAAIb,GAAK,KAAK,WAAWA,CAAC,CAAC,EAC7D,KAAK,UAAY,KAAK,WAAWa,CAAY,EAC7C,KAAK,MAAM,KAAK,QAAS,KAAK,SAAS,EAGvC,IAAIC,EAAM,KAAK,UAAU,IAAI,CAACd,EAAGW,EAAGI,IAAM,CACxC,GAAI,KAAK,WAAa,KAAK,mBAAoB,CAE7C,IAAMC,EACJhB,EAAE,CAAC,IAAM,IACTA,EAAE,CAAC,IAAM,KACRA,EAAE,CAAC,IAAM,KAAO,CAACO,GAAU,KAAKP,EAAE,CAAC,CAAC,IACrC,CAACO,GAAU,KAAKP,EAAE,CAAC,CAAC,EAChBiB,EAAU,WAAW,KAAKjB,EAAE,CAAC,CAAC,EACpC,GAAIgB,EACF,MAAO,CACL,GAAGhB,EAAE,MAAM,EAAG,CAAC,EACf,GAAGA,EAAE,MAAM,CAAC,EAAE,IAAIkB,GAAM,KAAK,MAAMA,CAAE,CAAC,GAEnC,GAAID,EACT,MAAO,CAACjB,EAAE,CAAC,EAAG,GAAGA,EAAE,MAAM,CAAC,EAAE,IAAIkB,GAAM,KAAK,MAAMA,CAAE,CAAC,CAAC,CAEzD,CACA,OAAOlB,EAAE,IAAIkB,GAAM,KAAK,MAAMA,CAAE,CAAC,CACnC,CAAC,EAUD,GARA,KAAK,MAAM,KAAK,QAASJ,CAAG,EAG5B,KAAK,IAAMA,EAAI,OACbd,GAAKA,EAAE,QAAQ,EAAK,IAAM,EAAE,EAI1B,KAAK,UACP,QAASmB,EAAI,EAAGA,EAAI,KAAK,IAAI,OAAQA,IAAK,CACxC,IAAMjE,EAAI,KAAK,IAAIiE,CAAC,EAElBjE,EAAE,CAAC,IAAM,IACTA,EAAE,CAAC,IAAM,IACT,KAAK,UAAUiE,CAAC,EAAE,CAAC,IAAM,KACzB,OAAOjE,EAAE,CAAC,GAAM,UAChB,YAAY,KAAKA,EAAE,CAAC,CAAC,IAErBA,EAAE,CAAC,EAAI,IAEX,CAGF,KAAK,MAAM,KAAK,QAAS,KAAK,GAAG,CACnC,CAOA,WAAWkE,EAAqB,CAE9B,GAAI,KAAK,QAAQ,WACf,QAAS,EAAI,EAAG,EAAIA,EAAU,OAAQ,IACpC,QAASC,EAAI,EAAGA,EAAID,EAAU,CAAC,EAAE,OAAQC,IACnCD,EAAU,CAAC,EAAEC,CAAC,IAAM,OACtBD,EAAU,CAAC,EAAEC,CAAC,EAAI,KAM1B,GAAM,CAAE,kBAAAC,EAAoB,CAAC,EAAK,KAAK,QAEvC,OAAIA,GAAqB,GAEvBF,EAAY,KAAK,qBAAqBA,CAAS,EAC/CA,EAAY,KAAK,sBAAsBA,CAAS,GACvCE,GAAqB,EAE9BF,EAAY,KAAK,iBAAiBA,CAAS,EAG3CA,EAAY,KAAK,0BAA0BA,CAAS,EAG/CA,CACT,CAGA,0BAA0BA,EAAqB,CAC7C,OAAOA,EAAU,IAAIG,GAAQ,CAC3B,IAAIC,EAAa,GACjB,MAAeA,EAAKD,EAAM,QAAQ,KAAMC,EAAK,CAAC,KAAvC,IAA2C,CAChD,IAAIL,EAAIK,EACR,KAAOD,EAAMJ,EAAI,CAAC,IAAM,MACtBA,IAEEA,IAAMK,GACRD,EAAM,OAAOC,EAAIL,EAAIK,CAAE,CAE3B,CACA,OAAOD,CACT,CAAC,CACH,CAGA,iBAAiBH,EAAqB,CACpC,OAAOA,EAAU,IAAIG,IACnBA,EAAQA,EAAM,OAAO,CAACT,EAAeJ,IAAQ,CAC3C,IAAMe,EAAOX,EAAIA,EAAI,OAAS,CAAC,EAC/B,OAAIJ,IAAS,MAAQe,IAAS,KACrBX,EAELJ,IAAS,MACPe,GAAQA,IAAS,MAAQA,IAAS,KAAOA,IAAS,MACpDX,EAAI,IAAG,EACAA,IAGXA,EAAI,KAAKJ,CAAI,EACNI,EACT,EAAG,CAAA,CAAE,EACES,EAAM,SAAW,EAAI,CAAC,EAAE,EAAIA,EACpC,CACH,CAEA,qBAAqBA,EAAwB,CACtC,MAAM,QAAQA,CAAK,IACtBA,EAAQ,KAAK,WAAWA,CAAK,GAE/B,IAAIG,EAAwB,GAC5B,EAAG,CAGD,GAFAA,EAAe,GAEX,CAAC,KAAK,wBAAyB,CACjC,QAASP,EAAI,EAAGA,EAAII,EAAM,OAAS,EAAGJ,IAAK,CACzC,IAAMjE,EAAIqE,EAAMJ,CAAC,EAEbA,IAAM,GAAKjE,IAAM,IAAMqE,EAAM,CAAC,IAAM,KACpCrE,IAAM,KAAOA,IAAM,MACrBwE,EAAe,GACfH,EAAM,OAAOJ,EAAG,CAAC,EACjBA,IAEJ,CAEEI,EAAM,CAAC,IAAM,KACbA,EAAM,SAAW,IAChBA,EAAM,CAAC,IAAM,KAAOA,EAAM,CAAC,IAAM,MAElCG,EAAe,GACfH,EAAM,IAAG,EAEb,CAGA,IAAII,EAAa,EACjB,MAAeA,EAAKJ,EAAM,QAAQ,KAAMI,EAAK,CAAC,KAAvC,IAA2C,CAChD,IAAMzE,EAAIqE,EAAMI,EAAK,CAAC,EAClBzE,GAAKA,IAAM,KAAOA,IAAM,MAAQA,IAAM,OACxCwE,EAAe,GACfH,EAAM,OAAOI,EAAK,EAAG,CAAC,EACtBA,GAAM,EAEV,CACF,OAASD,GACT,OAAOH,EAAM,SAAW,EAAI,CAAC,EAAE,EAAIA,CACrC,CAoBA,qBAAqBH,EAAqB,CACxC,IAAIM,EAAe,GACnB,EAAG,CACDA,EAAe,GAEf,QAASH,KAASH,EAAW,CAC3B,IAAII,EAAa,GACjB,MAAeA,EAAKD,EAAM,QAAQ,KAAMC,EAAK,CAAC,KAAvC,IAA2C,CAChD,IAAII,EAAcJ,EAClB,KAAOD,EAAMK,EAAM,CAAC,IAAM,MAExBA,IAIEA,EAAMJ,GACRD,EAAM,OAAOC,EAAK,EAAGI,EAAMJ,CAAE,EAG/B,IAAIK,EAAON,EAAMC,EAAK,CAAC,EACjBtE,EAAIqE,EAAMC,EAAK,CAAC,EAChBM,EAAKP,EAAMC,EAAK,CAAC,EAEvB,GADIK,IAAS,MAEX,CAAC3E,GACDA,IAAM,KACNA,IAAM,MACN,CAAC4E,GACDA,IAAO,KACPA,IAAO,KAEP,SAEFJ,EAAe,GAEfH,EAAM,OAAOC,EAAI,CAAC,EAClB,IAAMO,EAAQR,EAAM,MAAM,CAAC,EAC3BQ,EAAMP,CAAE,EAAI,KACZJ,EAAU,KAAKW,CAAK,EACpBP,GACF,CAGA,GAAI,CAAC,KAAK,wBAAyB,CACjC,QAASL,EAAI,EAAGA,EAAII,EAAM,OAAS,EAAGJ,IAAK,CACzC,IAAMjE,EAAIqE,EAAMJ,CAAC,EAEbA,IAAM,GAAKjE,IAAM,IAAMqE,EAAM,CAAC,IAAM,KACpCrE,IAAM,KAAOA,IAAM,MACrBwE,EAAe,GACfH,EAAM,OAAOJ,EAAG,CAAC,EACjBA,IAEJ,CAEEI,EAAM,CAAC,IAAM,KACbA,EAAM,SAAW,IAChBA,EAAM,CAAC,IAAM,KAAOA,EAAM,CAAC,IAAM,MAElCG,EAAe,GACfH,EAAM,IAAG,EAEb,CAGA,IAAII,EAAa,EACjB,MAAeA,EAAKJ,EAAM,QAAQ,KAAMI,EAAK,CAAC,KAAvC,IAA2C,CAChD,IAAMzE,EAAIqE,EAAMI,EAAK,CAAC,EACtB,GAAIzE,GAAKA,IAAM,KAAOA,IAAM,MAAQA,IAAM,KAAM,CAC9CwE,EAAe,GAEf,IAAMM,EADUL,IAAO,GAAKJ,EAAMI,EAAK,CAAC,IAAM,KACtB,CAAC,GAAG,EAAI,CAAA,EAChCJ,EAAM,OAAOI,EAAK,EAAG,EAAG,GAAGK,CAAK,EAC5BT,EAAM,SAAW,GAAGA,EAAM,KAAK,EAAE,EACrCI,GAAM,CACR,CACF,CACF,CACF,OAASD,GAET,OAAON,CACT,CASA,sBAAsBA,EAAqB,CACzC,QAASD,EAAI,EAAGA,EAAIC,EAAU,OAAS,EAAGD,IACxC,QAASE,EAAIF,EAAI,EAAGE,EAAID,EAAU,OAAQC,IAAK,CAC7C,IAAMY,EAAU,KAAK,WACnBb,EAAUD,CAAC,EACXC,EAAUC,CAAC,EACX,CAAC,KAAK,uBAAuB,EAE/B,GAAIY,EAAS,CACXb,EAAUD,CAAC,EAAI,CAAA,EACfC,EAAUC,CAAC,EAAIY,EACf,KACF,CACF,CAEF,OAAOb,EAAU,OAAOI,GAAMA,EAAG,MAAM,CACzC,CAEA,WACE/B,EACAC,EACAwC,EAAwB,GAAK,CAE7B,IAAIC,EAAK,EACLC,EAAK,EACLC,EAAmB,CAAA,EACnBC,EAAgB,GACpB,KAAOH,EAAK1C,EAAE,QAAU2C,EAAK1C,EAAE,QAC7B,GAAID,EAAE0C,CAAE,IAAMzC,EAAE0C,CAAE,EAChBC,EAAO,KAAKC,IAAU,IAAM5C,EAAE0C,CAAE,EAAI3C,EAAE0C,CAAE,CAAC,EACzCA,IACAC,YACSF,GAAgBzC,EAAE0C,CAAE,IAAM,MAAQzC,EAAE0C,CAAE,IAAM3C,EAAE0C,EAAK,CAAC,EAC7DE,EAAO,KAAK5C,EAAE0C,CAAE,CAAC,EACjBA,YACSD,GAAgBxC,EAAE0C,CAAE,IAAM,MAAQ3C,EAAE0C,CAAE,IAAMzC,EAAE0C,EAAK,CAAC,EAC7DC,EAAO,KAAK3C,EAAE0C,CAAE,CAAC,EACjBA,YAEA3C,EAAE0C,CAAE,IAAM,KACVzC,EAAE0C,CAAE,IACH,KAAK,QAAQ,KAAO,CAAC1C,EAAE0C,CAAE,EAAE,WAAW,GAAG,IAC1C1C,EAAE0C,CAAE,IAAM,KACV,CACA,GAAIE,IAAU,IAAK,MAAO,GAC1BA,EAAQ,IACRD,EAAO,KAAK5C,EAAE0C,CAAE,CAAC,EACjBA,IACAC,GACF,SACE1C,EAAE0C,CAAE,IAAM,KACV3C,EAAE0C,CAAE,IACH,KAAK,QAAQ,KAAO,CAAC1C,EAAE0C,CAAE,EAAE,WAAW,GAAG,IAC1C1C,EAAE0C,CAAE,IAAM,KACV,CACA,GAAIG,IAAU,IAAK,MAAO,GAC1BA,EAAQ,IACRD,EAAO,KAAK3C,EAAE0C,CAAE,CAAC,EACjBD,IACAC,GACF,KACE,OAAO,GAKX,OAAO3C,EAAE,SAAWC,EAAE,QAAU2C,CAClC,CAEA,aAAW,CACT,GAAI,KAAK,SAAU,OAEnB,IAAMlF,EAAU,KAAK,QACjBoF,EAAS,GACTC,EAAe,EAEnB,QAASrB,EAAI,EAAGA,EAAIhE,EAAQ,QAAUA,EAAQ,OAAOgE,CAAC,IAAM,IAAKA,IAC/DoB,EAAS,CAACA,EACVC,IAGEA,IAAc,KAAK,QAAUrF,EAAQ,MAAMqF,CAAY,GAC3D,KAAK,OAASD,CAChB,CAOA,SACEE,EACAtF,EACAuF,EAAmB,GAAK,CAExB,IAAMtF,EAAU,KAAK,QAKrB,GAAI,KAAK,UAAW,CAClB,IAAMuF,EACJ,OAAOF,EAAK,CAAC,GAAM,UAAY,YAAY,KAAKA,EAAK,CAAC,CAAC,EACnDG,EACJ,CAACD,GACDF,EAAK,CAAC,IAAM,IACZA,EAAK,CAAC,IAAM,IACZA,EAAK,CAAC,IAAM,KACZ,YAAY,KAAKA,EAAK,CAAC,CAAC,EAEpBI,EACJ,OAAO1F,EAAQ,CAAC,GAAM,UAAY,YAAY,KAAKA,EAAQ,CAAC,CAAC,EACzD2F,EACJ,CAACD,GACD1F,EAAQ,CAAC,IAAM,IACfA,EAAQ,CAAC,IAAM,IACfA,EAAQ,CAAC,IAAM,KACf,OAAOA,EAAQ,CAAC,GAAM,UACtB,YAAY,KAAKA,EAAQ,CAAC,CAAC,EAEvB4F,EACJH,EAAU,EACRD,EAAY,EACZ,OACEK,EACJF,EAAa,EACXD,EAAe,EACf,OACJ,GAAI,OAAOE,GAAQ,UAAY,OAAOC,GAAQ,SAAU,CACtD,GAAM,CAACC,EAAIC,CAAE,EAAsB,CACjCT,EAAKM,CAAG,EACR5F,EAAQ6F,CAAG,GAETC,EAAG,YAAW,IAAOC,EAAG,YAAW,IACrC/F,EAAQ6F,CAAG,EAAIC,EACXD,EAAMD,EACR5F,EAAUA,EAAQ,MAAM6F,CAAG,EAClBD,EAAMC,IACfP,EAAOA,EAAK,MAAMM,CAAG,GAG3B,CACF,CAIA,GAAM,CAAE,kBAAAzB,EAAoB,CAAC,EAAK,KAAK,QACnCA,GAAqB,IACvBmB,EAAO,KAAK,qBAAqBA,CAAI,GAGvC,KAAK,MAAM,WAAY,KAAM,CAAE,KAAAA,EAAM,QAAAtF,CAAO,CAAE,EAC9C,KAAK,MAAM,WAAYsF,EAAK,OAAQtF,EAAQ,MAAM,EAElD,QACMgG,EAAK,EAAGC,EAAK,EAAGC,EAAKZ,EAAK,OAAQa,EAAKnG,EAAQ,OACnDgG,EAAKE,GAAMD,EAAKE,EAChBH,IAAMC,IACN,CACA,KAAK,MAAM,eAAe,EAC1B,IAAIlG,EAAIC,EAAQiG,CAAE,EACd1F,EAAI+E,EAAKU,CAAE,EAOf,GALA,KAAK,MAAMhG,EAASD,EAAGQ,CAAC,EAKpBR,IAAM,GACR,MAAO,GAIT,GAAIA,IAAMiC,GAAU,CAClB,KAAK,MAAM,WAAY,CAAChC,EAASD,EAAGQ,CAAC,CAAC,EAwBtC,IAAI6F,EAAKJ,EACLK,EAAKJ,EAAK,EACd,GAAII,IAAOF,EAAI,CAQb,IAPA,KAAK,MAAM,eAAe,EAOnBH,EAAKE,EAAIF,IACd,GACEV,EAAKU,CAAE,IAAM,KACbV,EAAKU,CAAE,IAAM,MACZ,CAAC/F,EAAQ,KAAOqF,EAAKU,CAAE,EAAE,OAAO,CAAC,IAAM,IAExC,MAAO,GAEX,MAAO,EACT,CAGA,KAAOI,EAAKF,GAAI,CACd,IAAII,EAAYhB,EAAKc,CAAE,EAKvB,GAHA,KAAK,MAAM;gBAAoBd,EAAMc,EAAIpG,EAASqG,EAAIC,CAAS,EAG3D,KAAK,SAAShB,EAAK,MAAMc,CAAE,EAAGpG,EAAQ,MAAMqG,CAAE,EAAGd,CAAO,EAC1D,YAAK,MAAM,wBAAyBa,EAAIF,EAAII,CAAS,EAE9C,GAIP,GACEA,IAAc,KACdA,IAAc,MACb,CAACrG,EAAQ,KAAOqG,EAAU,OAAO,CAAC,IAAM,IACzC,CACA,KAAK,MAAM,gBAAiBhB,EAAMc,EAAIpG,EAASqG,CAAE,EACjD,KACF,CAGA,KAAK,MAAM,0CAA0C,EACrDD,GAEJ,CAKA,MAAI,GAAAb,IAEF,KAAK,MAAM;wBAA4BD,EAAMc,EAAIpG,EAASqG,CAAE,EACxDD,IAAOF,GAMf,CAKA,IAAIK,EASJ,GARI,OAAOxG,GAAM,UACfwG,EAAMhG,IAAMR,EACZ,KAAK,MAAM,eAAgBA,EAAGQ,EAAGgG,CAAG,IAEpCA,EAAMxG,EAAE,KAAKQ,CAAC,EACd,KAAK,MAAM,gBAAiBR,EAAGQ,EAAGgG,CAAG,GAGnC,CAACA,EAAK,MAAO,EACnB,CAcA,GAAIP,IAAOE,GAAMD,IAAOE,EAGtB,MAAO,GACF,GAAIH,IAAOE,EAIhB,OAAOX,EACF,GAAIU,IAAOE,EAKhB,OAAOH,IAAOE,EAAK,GAAKZ,EAAKU,CAAE,IAAM,GAKrC,MAAM,IAAI,MAAM,MAAM,CAG1B,CAEA,aAAW,CACT,OAAOjD,GAAY,KAAK,QAAS,KAAK,OAAO,CAC/C,CAEA,MAAM/C,EAAe,CACnBE,GAAmBF,CAAO,EAE1B,IAAMC,EAAU,KAAK,QAGrB,GAAID,IAAY,KAAM,OAAOgC,GAC7B,GAAIhC,IAAY,GAAI,MAAO,GAI3B,IAAIwG,EACAC,EAA4C,MAC3CD,EAAIxG,EAAQ,MAAMgB,EAAM,GAC3ByF,EAAWxG,EAAQ,IAAMiB,GAAcD,IAC7BuF,EAAIxG,EAAQ,MAAMI,EAAY,GACxCqG,GACExG,EAAQ,OACNA,EAAQ,IACNS,GACAD,GACFR,EAAQ,IAAMO,GACdH,IAAgBmG,EAAE,CAAC,CAAC,GACdA,EAAIxG,EAAQ,MAAMmB,EAAQ,GACpCsF,GACExG,EAAQ,OACNA,EAAQ,IACNuB,GACAJ,GACFnB,EAAQ,IAAMyB,GACdC,IAAY6E,CAAC,GACPA,EAAIxG,EAAQ,MAAMW,EAAa,GACzC8F,EAAWxG,EAAQ,IAAMY,GAAqBD,IACpC4F,EAAIxG,EAAQ,MAAMc,EAAS,KACrC2F,EAAW1F,IAGb,IAAM2F,EAAKC,GAAI,SAAS3G,EAAS,KAAK,OAAO,EAAE,YAAW,EAC1D,OAAIyG,GAAY,OAAOC,GAAO,UAE5B,QAAQ,eAAeA,EAAI,OAAQ,CAAE,MAAOD,CAAQ,CAAE,EAEjDC,CACT,CAEA,QAAM,CACJ,GAAI,KAAK,QAAU,KAAK,SAAW,GAAO,OAAO,KAAK,OAQtD,IAAM/C,EAAM,KAAK,IAEjB,GAAI,CAACA,EAAI,OACP,YAAK,OAAS,GACP,KAAK,OAEd,IAAM1D,EAAU,KAAK,QAEf2G,EACJ3G,EAAQ,WAAaiC,GACnBjC,EAAQ,IAAMkC,GACdC,GACEyE,EAAQ,IAAI,IAAI5G,EAAQ,OAAS,CAAC,GAAG,EAAI,CAAA,CAAE,EAQ7CyG,EAAK/C,EACN,IAAI3D,GAAU,CACb,IAAM8G,EAAmC9G,EAAQ,IAAID,GAAI,CACvD,GAAIA,aAAa,OACf,QAAWQ,KAAKR,EAAE,MAAM,MAAM,EAAE,EAAG8G,EAAM,IAAItG,CAAC,EAEhD,OACE,OAAOR,GAAM,SAAWsD,GAAatD,CAAC,EACpCA,IAAMiC,GAAWA,GACjBjC,EAAE,IAER,CAAC,EACD+G,EAAG,QAAQ,CAAC/G,EAAGiE,IAAK,CAClB,IAAMU,EAAOoC,EAAG9C,EAAI,CAAC,EACfM,EAAOwC,EAAG9C,EAAI,CAAC,EACjBjE,IAAMiC,IAAYsC,IAAStC,KAG3BsC,IAAS,OACPI,IAAS,QAAaA,IAAS1C,GACjC8E,EAAG9C,EAAI,CAAC,EAAI,UAAY4C,EAAU,QAAUlC,EAE5CoC,EAAG9C,CAAC,EAAI4C,EAEDlC,IAAS,OAClBoC,EAAG9C,EAAI,CAAC,EAAIM,EAAO,aAAesC,EAAU,KACnClC,IAAS1C,KAClB8E,EAAG9C,EAAI,CAAC,EAAIM,EAAO,aAAesC,EAAU,OAASlC,EACrDoC,EAAG9C,EAAI,CAAC,EAAIhC,IAEhB,CAAC,EACD,IAAM+E,EAAWD,EAAG,OAAO/G,GAAKA,IAAMiC,EAAQ,EAK9C,GAAI,KAAK,SAAW+E,EAAS,QAAU,EAAG,CACxC,IAAMC,EAAqB,CAAA,EAC3B,QAAShD,EAAI,EAAGA,GAAK+C,EAAS,OAAQ/C,IACpCgD,EAAS,KAAKD,EAAS,MAAM,EAAG/C,CAAC,EAAE,KAAK,GAAG,CAAC,EAE9C,MAAO,MAAQgD,EAAS,KAAK,GAAG,EAAI,GACtC,CAEA,OAAOD,EAAS,KAAK,GAAG,CAC1B,CAAC,EACA,KAAK,GAAG,EAIL,CAACE,EAAMC,CAAK,EAAIvD,EAAI,OAAS,EAAI,CAAC,MAAO,GAAG,EAAI,CAAC,GAAI,EAAE,EAG7D+C,EAAK,IAAMO,EAAOP,EAAKQ,EAAQ,IAG3B,KAAK,UACPR,EAAK,WAAaO,EAAOP,EAAG,MAAM,EAAG,EAAE,EAAIQ,EAAQ,MAIjD,KAAK,SAAQR,EAAK,OAASA,EAAK,QAEpC,GAAI,CACF,KAAK,OAAS,IAAI,OAAOA,EAAI,CAAC,GAAGG,CAAK,EAAE,KAAK,EAAE,CAAC,CAElD,MAAa,CAEX,KAAK,OAAS,EAChB,CAEA,OAAO,KAAK,MACd,CAEA,WAAW9G,EAAS,CAKlB,OAAI,KAAK,wBACAA,EAAE,MAAM,GAAG,EACT,KAAK,WAAa,cAAc,KAAKA,CAAC,EAExC,CAAC,GAAI,GAAGA,EAAE,MAAM,KAAK,CAAC,EAEtBA,EAAE,MAAM,KAAK,CAExB,CAEA,MAAMQ,EAAWgF,EAAU,KAAK,QAAO,CAIrC,GAHA,KAAK,MAAM,QAAShF,EAAG,KAAK,OAAO,EAG/B,KAAK,QACP,MAAO,GAET,GAAI,KAAK,MACP,OAAOA,IAAM,GAGf,GAAIA,IAAM,KAAOgF,EACf,MAAO,GAGT,IAAMtF,EAAU,KAAK,QAGjB,KAAK,YACPM,EAAIA,EAAE,MAAM,IAAI,EAAE,KAAK,GAAG,GAI5B,IAAM4G,EAAK,KAAK,WAAW5G,CAAC,EAC5B,KAAK,MAAM,KAAK,QAAS,QAAS4G,CAAE,EAOpC,IAAMxD,EAAM,KAAK,IACjB,KAAK,MAAM,KAAK,QAAS,MAAOA,CAAG,EAGnC,IAAIyD,EAAmBD,EAAGA,EAAG,OAAS,CAAC,EACvC,GAAI,CAACC,EACH,QAASpD,EAAImD,EAAG,OAAS,EAAG,CAACC,GAAYpD,GAAK,EAAGA,IAC/CoD,EAAWD,EAAGnD,CAAC,EAInB,QAASA,EAAI,EAAGA,EAAIL,EAAI,OAAQK,IAAK,CACnC,IAAMhE,EAAU2D,EAAIK,CAAC,EACjBsB,EAAO6B,EAKX,GAJIlH,EAAQ,WAAaD,EAAQ,SAAW,IAC1CsF,EAAO,CAAC8B,CAAQ,GAEN,KAAK,SAAS9B,EAAMtF,EAASuF,CAAO,EAE9C,OAAItF,EAAQ,WACH,GAEF,CAAC,KAAK,MAEjB,CAIA,OAAIA,EAAQ,WACH,GAEF,KAAK,MACd,CAEA,OAAO,SAASwC,EAAqB,CACnC,OAAO3C,GAAU,SAAS2C,CAAG,EAAE,SACjC,GAOF3C,GAAU,IAAM6G,GAChB7G,GAAU,UAAYK,GACtBL,GAAU,OAASuH,GACnBvH,GAAU,SAAWwH,GC9wCrB,IAAIC,GAAU,SAAS,QAAQ,IAAI,cAAgB,GAAG,EAEhDC,GAAkB,CAAA,EACXC,EAAQ,IAAIC,IAAa,CAChCH,IAAW,EAAG,QAAQ,MAAM,GAAGG,CAAC,EAC/BF,GAAO,KAAKE,CAAC,CAAC,EAERC,EAAQ,IAAID,IAAa,CAChCH,IAAW,EAAG,QAAQ,MAAM,GAAGG,CAAC,EAC/BF,GAAO,KAAKE,CAAC,CAAC,EAIRE,GAAM,IAAIF,IAAa,CAC9BH,IAAW,GAAG,QAAQ,IAAI,GAAGG,CAAC,CAAC,EAGxBG,GAAQ,IAAM,CACzB,QAAWH,KAAKF,GACd,QAAQ,MAAM,GAAGE,CAAC,EAEpBF,GAAO,OAAS,CAAC,ECrBnB,IAAAM,EAAe,CAACC,EAAiBC,IAAe,CACtCC,EAAMC,EAAM,IAAI,KAAKH,CAAO,CAAC,EACjCC,GAAYC,EAAMD,EAAG,OAAO,EACxBG,GAAK,CAAE,ECHjB,OAAS,gBAAAC,OAAoB,KCkC7B,IAAMC,GAAUC,GACd,MAAM,KAAKA,CAAC,EACT,IACCC,GAAK,KAAOA,EAAE,WAAW,CAAC,EAAE,SAAS,EAAE,EAAE,YAAW,EAAG,SAAS,EAAG,GAAG,CAAC,EAExE,KAAK,EAAE,EAONC,GAAa,CAAC,EAAUC,EAAaC,IAAmC,CAC5E,GAAI,CAACD,EACH,MAAO,CACL,QAAS,EAAE,QAAU,8BACrB,SAAU,GAGd,IAAME,EAAW,EAAE,QAAQ,MAAM,+BAA+B,EAC1DC,EAAQ,EAAE,QAAQ,MAAM,qBAAqB,EAI7CC,EAAS,uDAAuD,KACpE,EAAE,OAAO,EAEPJ,EAAI,OAAS,EACbG,GAASA,EAAM,CAAC,EAChB,CAACA,EAAM,CAAC,EACR,qBAAqB,KAAK,EAAE,OAAO,EACnC,EACA,KAEEE,EACJH,GAAYA,EAAS,CAAC,EAClB,EAAE,QAAQ,QACR,sBACA,oBAAoB,KAAK,UAAUA,EAAS,CAAC,CAAC,CAAC,KAAKN,GAClDM,EAAS,CAAC,CAAC,CACZ,GAAG,EAEN,EAAE,QAGR,GAAIE,GAAW,KAA8B,CAC3C,IAAME,EAAQF,GAAUH,EAAU,EAAIG,EAASH,EAEzCM,EAAMH,EAASH,GAAWD,EAAI,OAASA,EAAI,OAASI,EAASH,EAE7DO,GACHF,IAAU,EAAI,GAAK,OACpBN,EAAI,MAAMM,EAAOC,CAAG,GACnBA,IAAQP,EAAI,OAAS,GAAK,OAI7B,MAAO,CACL,QAASK,EAAM,kBAHJL,IAAQQ,EAAQ,GAAK,OAGK,GAAG,KAAK,UAAUA,CAAK,CAAC,GAC7D,SAAUJ,EAEd,KACE,OAAO,CACL,QAASC,EAAM,mBAAmBL,EAAI,MAAM,EAAGC,EAAU,CAAC,CAAC,IAC3D,SAAU,EAGhB,EAEaQ,GAAP,cAA8B,WAAW,CAC7C,KACA,MACA,SACA,YACEC,EACAV,EACAC,EAAkB,GAClBU,EAA0C,CAE1C,GAAM,CAAE,QAAAC,EAAS,SAAAC,CAAQ,EAAKd,GAAWW,EAAIV,EAAKC,CAAO,EACzD,MAAMW,CAAO,EACb,KAAK,MAAQF,EACb,KAAK,SAAWG,EAChB,KAAK,KAAO,aACZ,MAAM,kBAAkB,KAAMF,GAAU,KAAK,WAAW,CAC1D,CACA,IAAI,MAAI,CACN,OAAO,KAAK,YAAY,IAC1B,CACA,IAAI,KAAKG,EAAC,CAAG,CACb,IAAK,OAAO,WAAW,GAAC,CACtB,OAAO,KAAK,YAAY,IAC1B,GAGWC,GAAU,OAAO,IAAI,QAAQ,EAC7BC,GAAW,OAAO,IAAI,SAAS,EAKtCC,GAAW,iCACXC,GAAU,+BAiBHC,GAAQ,CACnBnB,EACAoB,EACAnB,IACc,CACd,IAAMoB,EAAYC,GAAS,OAAOtB,CAAG,CAAC,EACjCoB,IAASA,EAAU,QACxBnB,EAAUA,GAAW,GACrB,GAAI,CAOF,GAAM,CAAC,CAAEsB,EAAU;EAAMC,EAAS,IAAI,EAAIH,EAAU,MAAMH,EAAO,GAC/DG,EAAU,MAAMJ,EAAQ,GAAK,CAAC,CAAE,GAAI,EAAE,EAElCQ,EAAS,KAAK,MAAMJ,EAAWD,CAAO,EAC5C,OAAIK,GAAU,OAAOA,GAAW,WAC9BA,EAAOT,EAAQ,EAAIO,EACnBE,EAAOV,EAAO,EAAIS,GAEbC,CACT,OAASC,EAAG,CACV,GAAI,OAAO1B,GAAQ,UAAY,CAAC,OAAO,SAASA,CAAG,EAAG,CACpD,IAAM2B,EACJ,MAAM,QAAQ3B,CAAG,GAAMA,EAAmB,SAAW,EACvD,MAAM,OAAO,OACX,IAAI,UACF,gBAAgB2B,EAAe,iBAAmB,OAAO3B,CAAG,CAAC,EAAE,EAEjE,CACE,KAAM,aACN,YAAa0B,EACd,CAEL,CAEA,MAAM,IAAIjB,GAAeiB,EAAYL,EAAWpB,EAASkB,EAAK,CAChE,CACF,EAWA,IAAMS,GAAYC,GAAgB,OAAOA,CAAG,EAAE,QAAQ,UAAW,EAAE,EAEtDC,GAAY,CACvBC,EACAC,EACAC,IACE,CACF,IAAMC,EAAQD,IAAW,OAAYF,EAAII,EAAO,EAAIF,EAE9CG,EAGA,KAAK,UAAUL,EAAKC,EAAUE,CAAK,EAGnCG,EAAKN,EAAIO,EAAQ,GAAK;EAC5B,OAAOJ,GAASG,IAAO;EAAOD,EAAMA,EAAI,MAAM;CAAI,EAAE,KAAKC,CAAE,GAAKA,EAAKD,CACvE,EDzNA,IAAMG,GAAaC,GACjB,CAAC,CAACA,GAAO,OAAOA,GAAQ,UAAY,CAAC,MAAM,QAAQA,CAAG,EAElDC,GAAU,IAAiD,CAC/D,GAAI,CACF,IAAMC,EAAMC,GAAMC,GAAa,eAAgB,MAAM,CAAC,EACtD,GAAIL,GAAUG,CAAG,EACf,OAAO,OAAO,OAAOA,EAAK,CACxB,KAAMA,EAAI,OAAS,WAAa,WAAa,SAC9C,EAEH,MAAM,IAAI,MAAM,kCAAoCG,GAAUH,CAAG,CAAC,CACpE,OAASI,EAAI,CACXC,EAAK,8BAA+BD,CAAW,EAC/C,QAAQ,KAAK,CAAC,CAChB,CAAC,EAGHE,EAAeP,GAAO,EEvBtB,OAAS,eAAAQ,OAAmB,KAC5B,OAAS,QAAAC,OAAY,aAErB,IAAMC,GAAa,CAACC,EAAM,QAAoB,CAC5C,IAAMC,EAAoB,CAAA,EACpBC,EAAUL,GAAYG,EAAK,CAAE,cAAe,EAAI,CAAE,EACxD,QAAWG,KAAKD,EAAS,CACvB,IAAME,EAAI,KAAKN,GAAKE,EAAKG,EAAE,IAAI,CAAC,GAC5BA,EAAE,OAAM,EAAIF,EAAQ,KAAKG,CAAC,EACrBD,EAAE,YAAW,GACpBF,EAAQ,KAAK,GAAGF,GAAWK,CAAC,CAAC,CAEjC,CACA,OAAOH,CAAO,EAGVA,GAAU,IAAI,IAAIF,GAAU,CAAE,EACpCM,GAAeJ,GChBR,IAAMK,GAAaC,GACxBA,IAAM,YAAcA,IAAM,MAE5BC,GACED,GAEMA,GAAK,MAAM,QAAQA,CAAC,GAAKA,EAAE,QAAU,CAACA,EAAE,KAAKA,GAAK,CAACD,GAAUC,CAAC,CAAC,EAC5D,IAGTE,EACE,0EACU,KAAK,UAAUF,CAAC,CAAC,EAAE,EAExB,QAAQ,KAAK,CAAC,GCfvB,IAAAG,GACEC,GAGIA,GACF,MAAM,QAAQA,CAAC,GACfA,EAAE,QACF,CAACA,EAAE,KAAKA,GAAK,OAAOA,GAAM,QAAQ,EAE3B,IAETC,EACE,0EACU,KAAK,UAAUD,CAAC,CAAC,EAAE,EAExB,QAAQ,KAAK,CAAC,GCjBvB,OAAS,QAAAE,OAAY,kBACrB,IAAAC,GAAgBC,GAAc,KAAKF,GAAKE,CAAC,CAAC,GCD1C,OAAS,QAAAC,OAAY,aCAd,IAAMC,GAAgB,CAC3BC,EACAC,IAC8B,CAC9B,GAAI,OAAOD,GAAQ,SAAU,OAAOA,EACpC,GAAI,OAAOA,GAAQ,SAAU,OAC7B,GAAIA,IAAQ,KAAM,OAAOA,EACzB,GAAI,MAAM,QAAQA,CAAG,EAAG,CACtB,QAAWE,KAAKF,EAAK,CACnB,IAAMG,EAAIJ,GAAcG,EAAGD,CAAU,EACrC,GAAIE,GAAKA,IAAM,KAAM,OAAOA,CAC9B,CACA,MACF,CACA,IAAMC,EAAQ,CAAC,GAAGH,EAAY,OAAQ,SAAS,EAC/C,OAAW,CAACI,EAAGH,CAAC,IAAK,OAAO,QAAQF,CAAG,EACrC,GAAII,EAAM,SAASC,CAAC,EAAG,CACrB,IAAMF,EAAIJ,GAAcG,EAAGD,CAAU,EACrC,GAAIE,GAAKA,IAAM,KAAM,OAAOA,CAC9B,CACD,EDhBH,IAAAG,GAAgBC,GAA4C,CAC1D,IAAMC,EAAIC,GAAcF,EAAK,CAAC,QAAQ,CAAC,EACjCG,EAAID,GAAcF,EAAK,CAAC,SAAS,CAAC,EAExC,MADI,EAAAC,GAAKG,GAAKH,CAAC,EAAE,WAAW,MAAM,GAC9BE,GAAKC,GAAKD,CAAC,EAAE,WAAW,MAAM,EACvB,EEJb,IAAAE,GACE,GACmD,CACnD,GAAI,CAAC,GAAK,OAAO,GAAM,UAAY,MAAM,QAAQ,CAAC,EAAG,MAAO,GAC5D,OAAW,CAACC,EAAKC,CAAG,IAAK,OAAO,QAAQ,CAAC,EAAG,CAC1C,GAAID,IAAQ,KAAO,CAACA,EAAI,WAAW,IAAI,EACrC,OAAAE,EAAK,yDAAyDF,CAAG,EAAE,EAC5D,QAAQ,KAAK,CAAC,EAIvB,GAAI,OAAOC,GAAQ,SAAU,CAC3B,EAAED,CAAG,EAAIG,GAAOF,CAAG,EACnB,QACF,CAEA,GAAI,OAAOA,GAAQ,SACjB,OAAAC,EACE,gBAAgBF,CAAG,yDACF,KAAK,UAAUC,CAAG,CAAC,EAAE,EAEjC,QAAQ,KAAK,CAAC,EAKvB,GAAI,CAACG,GAAoBH,CAAG,EAC1B,OAAAC,EACE,gBAAgBF,CAAG,yFAET,KAAK,UAAUC,CAAG,CAAC,EAAE,EAE1B,QAAQ,KAAK,CAAC,EAGvB,EAAED,CAAG,EAAIC,CACX,CACA,MAAO,EAAI,ECtCb,IAAMI,GAAe,CACnBC,EACAC,IACmB,CACnB,GAAI,CAACD,GAAK,CAACC,EAAG,MAAO,GACrB,QAAWC,KAAMF,EACf,GAAIC,EAAE,SAASC,CAAE,EAAG,OAAOA,EAE7B,MAAO,EAAK,EAGRC,GAAuB,CAC3B,EACAC,IACG,CACH,QAAWC,KAAK,EAAG,CACjB,GAAI,OAAOA,GAAM,SACf,OAAAC,EAAK,GAAGF,CAAK,sCAAsCC,CAAC,EAAE,EAC/C,QAAQ,KAAK,CAAC,EAEvB,GACEA,IAAM,YACNA,IAAM,OACNA,IAAM,OACNA,IAAM,WACNA,IAAM,UACNA,IAAM,QACNA,IAAM,UACNA,IAAM,UAEN,OAAAC,EAAK,QAAQF,CAAK,6BAA6B,KAAK,UAAUC,CAAC,CAAC,EAAE,EAC3D,QAAQ,KAAK,CAAC,CAEzB,CACA,MAAO,EAAI,EAGbE,GAAe,CAAC,CACd,iBAAAC,EACA,YAAAC,EACA,eAAAC,CAAc,IACE,CAChB,GACEF,IAAqB,QACrBC,IAAgB,QAChBC,IAAmB,OAEnB,MAAO,GAWT,GAREF,GACA,CAACL,GAAqBK,EAAkB,UAAU,GAIhDC,GAAe,CAACN,GAAqBM,EAAa,KAAK,GAGvDC,GAAkB,CAACP,GAAqBO,EAAgB,QAAQ,EAClE,MAAO,GAET,OAAW,CAACC,EAAOC,EAAOZ,EAAGC,CAAC,GAAK,CACjC,CAAC,mBAAoB,cAAeO,EAAkBC,CAAW,EACjE,CACE,mBACA,iBACAD,EACAE,GAEF,CAAC,cAAe,iBAAkBD,EAAaC,CAAc,GACnD,CACV,IAAMG,EAAUd,GAAaC,EAAGC,CAAC,EACjC,GAAKY,EACL,OAAAP,EACE,GAAGK,CAAK,QAAQC,CAAK,0BAA0BC,CAAO,gBAAgB,EAEjE,QAAQ,KAAK,CAAC,CACvB,CACA,MAAO,EAAI,EC7Eb,IAAAC,GAAgBC,GAAiB,CAC/B,GAAM,CAAE,QAAAC,CAAO,EAAKD,EACpB,GAAIC,IAAY,OAAW,MAAO,GAClC,GAAI,MAAM,QAAQA,CAAO,GAAK,OAAOA,GAAY,SAC/C,OAAAC,EACE,gEACU,KAAK,UAAUD,CAAO,CAAC,EAAE,EAE9B,QAAQ,KAAK,CAAC,EAGvB,OAAW,CAACE,EAAGC,CAAC,IAAK,OAAO,QAAQH,CAAO,EAAG,CAC5C,GAAI,CAACE,EAAE,WAAW,GAAG,GAAKA,IAAM,KAAOA,EAAE,WAAW,IAAI,EACtD,OAAAD,EAAK,qCAAuCC,CAAC,EACtC,QAAQ,KAAK,CAAC,EAEvB,GAAI,OAAOC,GAAM,UACb,CAACC,GAAoBD,CAAC,EACxB,OAAAF,EACE,2BAA2BC,CAAC,2EAE1B,KAAK,UAAUC,CAAC,CAAC,EAEd,QAAQ,KAAK,CAAC,CAEzB,CACA,MAAO,EAAI,EC/Bb,OAAS,WAAAE,OAAe,OACxB,OAAS,gBAAAC,OAAoB,UAI7B,IAAAC,GAAgBC,GAA2C,CACzD,GAAI,OAAOA,GAAM,SACf,GAAI,CACF,OAAAC,GAAaC,GAAQF,CAAC,EAAG,MAAM,EACxB,EACT,MAAY,CAAC,CAGf,OAAAG,EACE,4DACU,KAAK,UAAUH,CAAC,CAAC,EAAE,EAExB,QAAQ,KAAK,CAAC,CAAC,ECfxB,IAAAI,GAAgBC,GACdA,IAAa,QAAaA,IAAa,OAASA,IAAa,OCkB/D,IAAMC,GAAe,CAAC,EAAwBC,IAAiB,CAC7D,IAAMC,EAAI,EAAED,CAAI,EAChB,OAAIC,IAAM,QAAa,OAAOA,GAAM,UAAkB,IACtDC,EAAK,QAAQF,CAAI,+CAAiDC,CAAC,EAC5D,QAAQ,KAAK,CAAC,EAAC,EAGlBE,GAAiB,GACrB,CAAC,CAAC,GAAK,MAAM,QAAQ,CAAC,GAAK,CAAC,EAAE,KAAKC,GAAK,OAAOA,GAAM,QAAQ,EAEzDC,GAAe,GACnB,CAAC,CAAC,GACF,OAAO,GAAM,WACZ,EAAE,UAAY,QACb,OAAO,EAAE,SAAY,UACrBF,GAAc,EAAE,OAAO,GACvBG,GAAa,EAAE,OAAO,KACvB,EAAE,WAAa,QAAaC,GAAc,EAAE,QAAQ,KACpD,EAAE,UAAY,QAAaC,GAAa,EAAE,OAAO,KACjD,EAAE,UAAY,QAAaC,GAAa,EAAE,OAAO,IAClDC,GAAmB,CAAC,GACpBC,GAAc,EAAE,QAAQ,GACxBZ,GAAa,EAAG,UAAU,GAC1BA,GAAa,EAAG,MAAM,GACtBA,GAAa,EAAG,SAAS,EAErBa,GAAQ,CAAC,EAAWC,IACxBA,EAAQ,KAAKC,GAAKA,EAAE,MAAM,CAAC,CAAC,EAExBC,GAAgBC,GACpB,MAAM,QAAQA,CAAC,EACbA,EAAE,IAAIA,GAAK,IAAIC,GAAUD,EAAE,QAAQ,QAAS,EAAE,CAAC,CAAC,EAChDD,GAAa,CAACC,CAAC,CAAC,EAEdE,GAAY,CAACC,EAAcC,IAAqC,CACpE,IAAMC,EACJhB,GAAYc,EAAI,IAAI,EAAIA,EAAI,KAAO,CAAA,EACjCG,EAAgBD,EAAK,QACzB,GAAI,OAAOC,GAAkB,UAAY,MAAM,QAAQA,CAAa,EAAG,CAGrE,IAAMC,EAAiD,CAAA,EAEjDT,EAAIC,GADyBO,CACL,EAC9B,QAAWlB,KAAKgB,EAAS,CACvB,GAAI,CAACR,GAAMR,EAAE,QAAQ,QAAS,EAAE,EAAGU,CAAC,EAAG,SAEvC,IAAMU,EACJ,uCAAuC,KAAKpB,CAAC,EAAI,IAC/C,KACAA,EAAE,QAAQ,aAAc,EAAE,EAAE,QAAQ,yBAA0B,EAAE,EAEpEmB,EAAIC,CAAE,EAAI,KAAKpB,CAAC,EAClB,CAEKE,GAAaiB,CAAG,GAMnBA,EAAI,gBAAgB,EAAI,iBACxBF,EAAK,QAAUE,IANPE,EAAM,gDAAgD,EAC9D,OAAOJ,EAAK,QACZC,EAAgB,OAMpB,CACA,IAAMI,EAAS,CAAE,GAAGL,CAAI,EAClBM,EAAKD,EAYX,GAXIC,EAAG,UACGC,EACNC,EAAM,KAAK,IAAI,SAAS,EAAI,uCAAuC,EAErEV,EAAI,QAAU,CACZ,GAAGA,EAAI,QACP,GAAGQ,EAAG,SAER,OAAOA,EAAG,SAEZG,GAAaX,CAAG,EACZ,CAACG,EAAe,CAClB,IAAMlB,EAA+C,CACnD,iBAAkB,kBAEpB,QAAW2B,KAAKX,EACd,GAAI,2BAA2B,KAAKW,CAAC,EAAG,CACtC3B,EAAE,GAAG,EAAI2B,EACT,KACF,CAEFL,EAAO,QAAUtB,EACjBiB,EAAK,QAAUjB,EACfkB,EAAgBlB,CAClB,CAGA,OAAAe,EAAI,KAAO,CAAE,GAAGE,EAAM,QAASC,CAAa,EACrCI,CAAM,EAGTA,GAAqBR,GAAUc,EAAKC,EAAO,EACjDC,EAAeR,GStHf,OAAS,iBAAAS,OAAqB,WED9B,OAAS,SAAAC,GAAO,SAAAC,OAAa,YAE7B,OAAS,iBAAAF,OAAqB,WAE9B,OACE,aAAAG,GACA,WAAWC,GACX,eAAAC,GACA,gBAAAC,GACA,gBAAgBC,OACX,KACP,UAAYC,OAAc,UAM1B,OAAS,SAAAC,GAAO,WAAAC,GAAS,YAAAC,GAAU,YAAAC,OAAgB,mBCXnD,OAAS,gBAAAC,OAAoB,cAC7B,OAAOC,OAAY,cACnB,OAAS,iBAAAC,OAAqB,sBXTvB,IAAMC,GAAW,CACtBC,EACAC,EACAC,IACE,CACF,IAAMC,EAAKH,aAAa,OAASI,GAAWJ,EAAGE,CAAG,EAAIF,EAChDK,EAAKJ,aAAa,OAASG,GAAWH,EAAGC,CAAG,EAAID,EAEhDK,EAAIH,IAAO,MAAQE,GAAM,MAAQE,GAAMJ,EAAIE,EAAIH,CAAG,EAExD,OACEI,GAAK,CACH,MAAOA,EAAE,CAAC,EACV,IAAKA,EAAE,CAAC,EACR,IAAKJ,EAAI,MAAM,EAAGI,EAAE,CAAC,CAAC,EACtB,KAAMJ,EAAI,MAAMI,EAAE,CAAC,EAAIH,EAAG,OAAQG,EAAE,CAAC,CAAC,EACtC,KAAMJ,EAAI,MAAMI,EAAE,CAAC,EAAID,EAAG,MAAM,CAAA,CAGtC,EAEMD,GAAa,CAACI,EAAaN,IAAe,CAC9C,IAAMO,EAAIP,EAAI,MAAMM,CAAG,EACvB,OAAOC,EAAIA,EAAE,CAAC,EAAI,IACpB,EAEaF,GAAQ,CACnBP,EACAC,EACAC,IACgC,CAChC,IAAIQ,EACFC,EACAC,EACAC,EACAC,EACEC,EAAKb,EAAI,QAAQF,CAAC,EAClBgB,EAAKd,EAAI,QAAQD,EAAGc,EAAK,CAAC,EAC1BE,EAAIF,EAER,GAAIA,GAAM,GAAKC,EAAK,EAAG,CACrB,GAAIhB,IAAMC,EACR,MAAO,CAACc,EAAIC,CAAE,EAKhB,IAHAN,EAAO,CAAA,EACPE,EAAOV,EAAI,OAEJe,GAAK,GAAK,CAACH,GAAQ,CACxB,GAAIG,IAAMF,EACRL,EAAK,KAAKO,CAAC,EACXF,EAAKb,EAAI,QAAQF,EAAGiB,EAAI,CAAC,UAChBP,EAAK,SAAW,EAAG,CAC5B,IAAMJ,EAAII,EAAK,IAAG,EACdJ,IAAM,SAAWQ,EAAS,CAACR,EAAGU,CAAE,EACtC,MACEL,EAAMD,EAAK,IAAG,EACVC,IAAQ,QAAaA,EAAMC,IAC7BA,EAAOD,EACPE,EAAQG,GAGVA,EAAKd,EAAI,QAAQD,EAAGgB,EAAI,CAAC,EAG3BA,EAAIF,EAAKC,GAAMD,GAAM,EAAIA,EAAKC,CAChC,CAEIN,EAAK,QAAUG,IAAU,SAC3BC,EAAS,CAACF,EAAMC,CAAK,EAEzB,CAEA,OAAOC,CACT,ECvEMI,GAAW,UAAY,KAAK,OAAM,EAAK,KACvCC,GAAU,SAAW,KAAK,OAAM,EAAK,KACrCC,GAAW,UAAY,KAAK,OAAM,EAAK,KACvCC,GAAW,UAAY,KAAK,OAAM,EAAK,KACvCC,GAAY,WAAa,KAAK,OAAM,EAAK,KACzCC,GAAkB,IAAI,OAAOL,GAAU,GAAG,EAC1CM,GAAiB,IAAI,OAAOL,GAAS,GAAG,EACxCM,GAAkB,IAAI,OAAOL,GAAU,GAAG,EAC1CM,GAAkB,IAAI,OAAOL,GAAU,GAAG,EAC1CM,GAAmB,IAAI,OAAOL,GAAW,GAAG,EAC5CM,GAAe,QACfC,GAAc,OACdC,GAAe,OACfC,GAAe,OACfC,GAAgB,OAETC,GAAgB,IAE7B,SAASC,GAAQhC,EAAW,CAC1B,OAAQ,MAAMA,CAAU,EAAwBA,EAAI,WAAW,CAAC,EAApC,SAASA,EAAK,EAAE,CAC9C,CAEA,SAASiC,GAAajC,EAAW,CAC/B,OAAOA,EACJ,QAAQ0B,GAAcV,EAAQ,EAC9B,QAAQW,GAAaV,EAAO,EAC5B,QAAQW,GAAcV,EAAQ,EAC9B,QAAQW,GAAcV,EAAQ,EAC9B,QAAQW,GAAeV,EAAS,CACrC,CAEA,SAASc,GAAelC,EAAW,CACjC,OAAOA,EACJ,QAAQqB,GAAiB,IAAI,EAC7B,QAAQC,GAAgB,GAAG,EAC3B,QAAQC,GAAiB,GAAG,EAC5B,QAAQC,GAAiB,GAAG,EAC5B,QAAQC,GAAkB,GAAG,CAClC,CAOA,SAASU,GAAgBnC,EAAW,CAClC,GAAI,CAACA,EACH,MAAO,CAAC,EAAE,EAGZ,IAAMoC,EAAkB,CAAA,EAClB7B,EAAIV,GAAS,IAAK,IAAKG,CAAG,EAEhC,GAAI,CAACO,EACH,OAAOP,EAAI,MAAM,GAAG,EAGtB,GAAM,CAAE,IAAAqC,EAAK,KAAAC,EAAM,KAAAC,CAAI,EAAKhC,EACtBiC,EAAIH,EAAI,MAAM,GAAG,EAEvBG,EAAEA,EAAE,OAAS,CAAC,GAAK,IAAMF,EAAO,IAChC,IAAMG,EAAYN,GAAgBI,CAAI,EACtC,OAAIA,EAAK,SACLC,EAAEA,EAAE,OAAS,CAAC,GAAgBC,EAAU,MAAK,EAC/CD,EAAE,KAAK,MAAMA,EAAGC,CAAS,GAG3BL,EAAM,KAAK,MAAMA,EAAOI,CAAC,EAElBJ,CACT,CAMM,SAAUM,GAAO1C,EAAa2C,EAAiC,CAAA,EAAE,CACrE,GAAI,CAAC3C,EACH,MAAO,CAAA,EAGT,GAAM,CAAE,IAAA4C,EAAMb,EAAa,EAAKY,EAQhC,OAAI3C,EAAI,MAAM,EAAG,CAAC,IAAM,OACtBA,EAAM,SAAWA,EAAI,MAAM,CAAC,GAGvB6C,GAAQZ,GAAajC,CAAG,EAAG4C,EAAK,EAAI,EAAE,IAAIV,EAAc,CACjE,CAEA,SAASY,GAAQ9C,EAAW,CAC1B,MAAO,IAAMA,EAAM,GACrB,CAEA,SAAS+C,GAASC,EAAU,CAC1B,MAAO,SAAS,KAAKA,CAAE,CACzB,CAEA,SAASC,GAAIlC,EAAWmC,EAAS,CAC/B,OAAOnC,GAAKmC,CACd,CAEA,SAASC,GAAIpC,EAAWmC,EAAS,CAC/B,OAAOnC,GAAKmC,CACd,CAEA,SAASL,GAAQ7C,EAAa4C,EAAaQ,EAAc,CAEvD,IAAMC,EAAuB,CAAA,EAEvB9C,EAAIV,GAAS,IAAK,IAAKG,CAAG,EAChC,GAAI,CAACO,EAAG,MAAO,CAACP,CAAG,EAGnB,IAAMqC,EAAM9B,EAAE,IACRgC,EAAiBhC,EAAE,KAAK,OAASsC,GAAQtC,EAAE,KAAMqC,EAAK,EAAK,EAAI,CAAC,EAAE,EAExE,GAAI,MAAM,KAAKrC,EAAE,GAAG,EAClB,QAAS+C,EAAI,EAAGA,EAAIf,EAAK,QAAUe,EAAIV,EAAKU,IAAK,CAC/C,IAAMC,EAAYlB,EAAM,IAAM9B,EAAE,KAAO,IAAMgC,EAAKe,CAAC,EACnDD,EAAW,KAAKE,CAAS,CAC3B,KACK,CACL,IAAMC,EAAoB,iCAAiC,KAAKjD,EAAE,IAAI,EAChEkD,EAAkB,uCAAuC,KAC7DlD,EAAE,IAAI,EAEFmD,EAAaF,GAAqBC,EAClCE,EAAYpD,EAAE,KAAK,QAAQ,GAAG,GAAK,EACzC,GAAI,CAACmD,GAAc,CAACC,EAElB,OAAIpD,EAAE,KAAK,MAAM,YAAY,GAC3BP,EAAMO,EAAE,IAAM,IAAMA,EAAE,KAAOW,GAAWX,EAAE,KACnCsC,GAAQ7C,EAAK4C,EAAK,EAAI,GAExB,CAAC5C,CAAG,EAGb,IAAI4D,EACJ,GAAIF,EACFE,EAAIrD,EAAE,KAAK,MAAM,MAAM,UAEvBqD,EAAIzB,GAAgB5B,EAAE,IAAI,EACtBqD,EAAE,SAAW,GAAKA,EAAE,CAAC,IAAM,SAE7BA,EAAIf,GAAQe,EAAE,CAAC,EAAGhB,EAAK,EAAK,EAAE,IAAIE,EAAO,EAGrCc,EAAE,SAAW,GACf,OAAOrB,EAAK,IAAIC,GAAKjC,EAAE,IAAMqD,EAAE,CAAC,EAAIpB,CAAC,EAQ3C,IAAIqB,EAEJ,GAAIH,GAAcE,EAAE,CAAC,IAAM,QAAaA,EAAE,CAAC,IAAM,OAAW,CAC1D,IAAME,EAAI9B,GAAQ4B,EAAE,CAAC,CAAC,EAChBV,EAAIlB,GAAQ4B,EAAE,CAAC,CAAC,EAChBG,EAAQ,KAAK,IAAIH,EAAE,CAAC,EAAE,OAAQA,EAAE,CAAC,EAAE,MAAM,EAC3CI,EACFJ,EAAE,SAAW,GAAKA,EAAE,CAAC,IAAM,OAAY,KAAK,IAAI5B,GAAQ4B,EAAE,CAAC,CAAC,CAAC,EAAI,EAC/DK,EAAOhB,GACKC,EAAIY,IAElBE,GAAQ,GACRC,EAAOd,IAET,IAAMe,EAAMN,EAAE,KAAKb,EAAQ,EAE3Bc,EAAI,CAAA,EAEJ,QAAS9C,EAAI+C,EAAGG,EAAKlD,EAAGmC,CAAC,EAAGnC,GAAKiD,EAAM,CACrC,IAAIG,EACJ,GAAIV,EACFU,EAAI,OAAO,aAAapD,CAAC,EACrBoD,IAAM,OACRA,EAAI,YAGNA,EAAI,OAAOpD,CAAC,EACRmD,EAAK,CACP,IAAME,EAAOL,EAAQI,EAAE,OACvB,GAAIC,EAAO,EAAG,CACZ,IAAMC,EAAI,IAAI,MAAMD,EAAO,CAAC,EAAE,KAAK,GAAG,EAClCrD,EAAI,EACNoD,EAAI,IAAME,EAAIF,EAAE,MAAM,CAAC,EAEvBA,EAAIE,EAAIF,CAEZ,CACF,CAEFN,EAAE,KAAKM,CAAC,CACV,CACF,KAAO,CACLN,EAAI,CAAA,EAEJ,QAASS,EAAI,EAAGA,EAAIV,EAAE,OAAQU,IAC5BT,EAAE,KAAK,MAAMA,EAAGhB,GAAQe,EAAEU,CAAC,EAAa1B,EAAK,EAAK,CAAC,CAEvD,CAEA,QAAS0B,EAAI,EAAGA,EAAIT,EAAE,OAAQS,IAC5B,QAAShB,EAAI,EAAGA,EAAIf,EAAK,QAAUc,EAAW,OAAST,EAAKU,IAAK,CAC/D,IAAMC,EAAYlB,EAAMwB,EAAES,CAAC,EAAI/B,EAAKe,CAAC,GACjC,CAACF,GAASM,GAAcH,IAC1BF,EAAW,KAAKE,CAAS,CAE7B,CAEJ,CAEA,OAAOF,CACT,CChOO,IAAMkB,GACXC,GAC6B,CAC7B,GAAI,OAAOA,GAAY,SACrB,MAAM,IAAI,UAAU,iBAAiB,EAGvC,GAAIA,EAAQ,OAAS,MACnB,MAAM,IAAI,UAAU,qBAAqB,CAE7C,ECPMC,GACJ,CACE,YAAa,CAAC,uBAAwB,EAAI,EAC1C,YAAa,CAAC,gBAAiB,EAAI,EACnC,YAAa,CAAC,cAAyB,EAAK,EAC5C,YAAa,CAAC,aAAc,EAAI,EAChC,YAAa,CAAC,UAAW,EAAI,EAC7B,YAAa,CAAC,UAAW,EAAI,EAC7B,YAAa,CAAC,eAAgB,GAAM,EAAI,EACxC,YAAa,CAAC,UAAW,EAAI,EAC7B,YAAa,CAAC,SAAU,EAAI,EAC5B,YAAa,CAAC,SAAU,EAAI,EAC5B,YAAa,CAAC,wBAAyB,EAAI,EAC3C,YAAa,CAAC,UAAW,EAAI,EAC7B,WAAY,CAAC,8BAA+B,EAAI,EAChD,aAAc,CAAC,YAAa,EAAK,CAAA,EAK/BC,GAAeC,GAAcA,EAAE,QAAQ,YAAa,MAAM,EAE1DC,GAAgBD,GACpBA,EAAE,QAAQ,2BAA4B,MAAM,EAGxCE,GAAkBC,GAA6BA,EAAO,KAAK,EAAE,EAetDC,GAAa,CACxBC,EACAC,IACoB,CACpB,IAAMC,EAAMD,EAEZ,GAAID,EAAK,OAAOE,CAAG,IAAM,IACvB,MAAM,IAAI,MAAM,2BAA2B,EAG7C,IAAMJ,EAAmB,CAAA,EACnBK,EAAiB,CAAA,EAEnBpE,EAAImE,EAAM,EACVE,EAAW,GACXC,EAAQ,GACRC,EAAW,GACXC,EAAS,GACTC,EAASN,EACTO,EAAa,GACjBC,EAAO,KAAO3E,EAAIiE,EAAK,QAAQ,CAC7B,IAAMb,EAAIa,EAAK,OAAOjE,CAAC,EACvB,IAAKoD,IAAM,KAAOA,IAAM,MAAQpD,IAAMmE,EAAM,EAAG,CAC7CK,EAAS,GACTxE,IACA,QACF,CAEA,GAAIoD,IAAM,KAAOiB,GAAY,CAACE,EAAU,CACtCE,EAASzE,EAAI,EACb,KACF,CAGA,GADAqE,EAAW,GACPjB,IAAM,MACJ,CAACmB,EAAU,CACbA,EAAW,GACXvE,IACA,QACF,CAGF,GAAIoD,IAAM,KAAO,CAACmB,GAEhB,OAAW,CAACK,EAAK,CAACC,EAAMC,EAAGC,CAAG,CAAC,IAAK,OAAO,QAAQrB,EAAY,EAC7D,GAAIO,EAAK,WAAWW,EAAK5E,CAAC,EAAG,CAE3B,GAAI0E,EACF,MAAO,CAAC,KAAM,GAAOT,EAAK,OAASE,EAAK,EAAI,EAE9CnE,GAAK4E,EAAI,OACLG,EAAKX,EAAK,KAAKS,CAAI,EAClBd,EAAO,KAAKc,CAAI,EACrBP,EAAQA,GAASQ,EACjB,SAASH,CACX,EAMJ,GADAJ,EAAW,GACPG,EAAY,CAGVtB,EAAIsB,EACNX,EAAO,KAAKJ,GAAYe,CAAU,EAAI,IAAMf,GAAYP,CAAC,CAAC,EACjDA,IAAMsB,GACfX,EAAO,KAAKJ,GAAYP,CAAC,CAAC,EAE5BsB,EAAa,GACb1E,IACA,QACF,CAIA,GAAIiE,EAAK,WAAW,KAAMjE,EAAI,CAAC,EAAG,CAChC+D,EAAO,KAAKJ,GAAYP,EAAI,GAAG,CAAC,EAChCpD,GAAK,EACL,QACF,CACA,GAAIiE,EAAK,WAAW,IAAKjE,EAAI,CAAC,EAAG,CAC/B0E,EAAatB,EACbpD,GAAK,EACL,QACF,CAGA+D,EAAO,KAAKJ,GAAYP,CAAC,CAAC,EAC1BpD,GACF,CAEA,GAAIyE,EAASzE,EAGX,MAAO,CAAC,GAAI,GAAO,EAAG,EAAK,EAK7B,GAAI,CAAC+D,EAAO,QAAU,CAACK,EAAK,OAC1B,MAAO,CAAC,KAAM,GAAOH,EAAK,OAASE,EAAK,EAAI,EAO9C,GACEC,EAAK,SAAW,GAChBL,EAAO,SAAW,GAClB,SAAS,KAAKA,EAAO,CAAC,CAAC,GACvB,CAACS,EACD,CACA,IAAMnF,EAAI0E,EAAO,CAAC,EAAE,SAAW,EAAIA,EAAO,CAAC,EAAE,MAAM,EAAE,EAAIA,EAAO,CAAC,EACjE,MAAO,CAACF,GAAaxE,CAAC,EAAG,GAAOoF,EAASN,EAAK,EAAK,CACrD,CAEA,IAAMa,EAAU,KAAOR,EAAS,IAAM,IAAMV,GAAeC,CAAM,EAAI,IAC/DkB,EAAQ,KAAOT,EAAS,GAAK,KAAOV,GAAeM,CAAI,EAAI,IAMjE,MAAO,CAJLL,EAAO,QAAUK,EAAK,OAAS,IAAMY,EAAU,IAAMC,EAAQ,IAC3DlB,EAAO,OAASiB,EAChBC,EAEUX,EAAOG,EAASN,EAAK,EAAI,CACzC,ECrJae,GAAW,CACtBtB,EACA,CACE,qBAAAuB,EAAuB,GACvB,cAAAC,EAAgB,EAAI,EACgD,CAAA,IAElEA,EACKD,EACHvB,EAAE,QAAQ,iBAAkB,IAAI,EAChCA,EACG,QAAQ,4BAA6B,MAAM,EAC3C,QAAQ,aAAc,IAAI,EAE5BuB,EACHvB,EAAE,QAAQ,mBAAoB,IAAI,EAClCA,EACG,QAAQ,8BAA+B,MAAM,EAC7C,QAAQ,eAAgB,IAAI,ECI/ByB,GAAQ,IAAI,IAAiB,CAAC,IAAK,IAAK,IAAK,IAAK,GAAG,CAAC,EACtDC,GAAiBlC,GACrBiC,GAAM,IAAIjC,CAAgB,EAMtBmC,GAAmB,4BACnBC,GAAa,UAKbC,GAAkB,IAAI,IAAI,CAAC,IAAK,GAAG,CAAC,EAEpCC,GAAW,IAAI,IAAI,CAAC,KAAM,GAAG,CAAC,EAC9BC,GAAa,IAAI,IAAI,iBAAiB,EACtCC,GAAgBhC,GACpBA,EAAE,QAAQ,2BAA4B,MAAM,EAGxCiC,GAAQ,OAGRC,GAAOD,GAAQ,KAGfE,GAAcF,GAAQ,KAKfG,GAAP,MAAOC,EAAG,CACd,KACSC,GAETC,GACAC,GAAkB,GAClBC,GAA2B,CAAA,EAClBC,GACAC,GACTC,GACAC,GAAuB,GACvBC,GACAC,GAGAC,GAAqB,GAErB,YACEC,EACAC,EACAlF,EAA4B,CAAA,EAAE,CAE9B,KAAK,KAAOiF,EAERA,IAAM,KAAKV,GAAY,IAC3B,KAAKG,GAAUQ,EACf,KAAKZ,GAAQ,KAAKI,GAAU,KAAKA,GAAQJ,GAAQ,KACjD,KAAKQ,GAAW,KAAKR,KAAU,KAAOtE,EAAU,KAAKsE,GAAMQ,GAC3D,KAAKF,GAAQ,KAAKN,KAAU,KAAO,CAAA,EAAK,KAAKA,GAAMM,GAC/CK,IAAS,KAAO,CAAC,KAAKX,GAAMO,IAAa,KAAKD,GAAM,KAAK,IAAI,EACjE,KAAKD,GAAe,KAAKD,GAAU,KAAKA,GAAQD,GAAO,OAAS,CAClE,CAEA,IAAI,UAAQ,CAEV,GAAI,KAAKF,KAAc,OAAW,OAAO,KAAKA,GAE9C,QAAW1E,KAAK,KAAK4E,GACnB,GAAI,OAAO5E,GAAM,WACbA,EAAE,MAAQA,EAAE,UAAU,OAAQ,KAAK0E,GAAY,GAGrD,OAAO,KAAKA,EACd,CAGA,UAAQ,CACN,OAAI,KAAKQ,KAAc,OAAkB,KAAKA,GACzC,KAAK,KAGA,KAAKA,GACX,KAAK,KAAO,IAAM,KAAKN,GAAO,IAAI5E,GAAK,OAAOA,CAAC,CAAC,EAAE,KAAK,GAAG,EAAI,IAHxD,KAAKkF,GAAY,KAAKN,GAAO,IAAI5E,GAAK,OAAOA,CAAC,CAAC,EAAE,KAAK,EAAE,CAKpE,CAEAsF,IAAS,CAEP,GAAI,OAAS,KAAKb,GAAO,MAAM,IAAI,MAAM,0BAA0B,EACnE,GAAI,KAAKO,GAAa,OAAO,KAI7B,KAAK,SAAQ,EACb,KAAKA,GAAc,GACnB,IAAI5D,EACJ,KAAQA,EAAI,KAAK2D,GAAM,IAAG,GAAK,CAC7B,GAAI3D,EAAE,OAAS,IAAK,SAEpB,IAAIpB,EAAqBoB,EACrBmE,EAAKvF,EAAE6E,GACX,KAAOU,GAAI,CACT,QACMhH,EAAIyB,EAAE8E,GAAe,EACzB,CAACS,EAAG,MAAQhH,EAAIgH,EAAGX,GAAO,OAC1BrG,IAEA,QAAWiH,KAAQpE,EAAEwD,GAAQ,CAE3B,GAAI,OAAOY,GAAS,SAClB,MAAM,IAAI,MAAM,8BAA8B,EAGhDA,EAAK,OAAOD,EAAGX,GAAOrG,CAAC,CAAC,CAC1B,CAEFyB,EAAIuF,EACJA,EAAKvF,EAAE6E,EACT,CACF,CACA,OAAO,IACT,CAEA,QAAQjF,EAAuB,CAC7B,QAAWI,KAAKJ,EACd,GAAII,IAAM,GAEV,CAAA,GACE,OAAOA,GAAM,UACb,EAAEA,aAAawE,IAAOxE,EAAE6E,KAAY,MAEpC,MAAM,IAAI,MAAM,iBAAmB7E,CAAC,EAGtC,KAAK4E,GAAO,KAAK5E,CAAC,CAAA,CAEtB,CAEA,QAAM,CACJ,IAAMyF,EACJ,KAAK,OAAS,KACZ,KAAKb,GACF,MAAK,EACL,IAAI5E,GAAM,OAAOA,GAAM,SAAWA,EAAIA,EAAE,OAAM,CAAG,EACpD,CAAC,KAAK,KAAM,GAAG,KAAK4E,GAAO,IAAI5E,GAAMA,EAAU,OAAM,CAAE,CAAC,EAC5D,OAAI,KAAK,QAAO,GAAM,CAAC,KAAK,MAAMyF,EAAI,QAAQ,CAAA,CAAE,EAE9C,KAAK,MAAK,IACT,OAAS,KAAKhB,IACZ,KAAKA,GAAMO,IAAe,KAAKH,IAAS,OAAS,MAEpDY,EAAI,KAAK,CAAA,CAAE,EAENA,CACT,CAEA,SAAO,CACL,GAAI,KAAKhB,KAAU,KAAM,MAAO,GAEhC,GAAI,CAAC,KAAKI,IAAS,QAAO,EAAI,MAAO,GACrC,GAAI,KAAKC,KAAiB,EAAG,MAAO,GAEpC,IAAM9E,EAAI,KAAK6E,GACf,QAAStG,EAAI,EAAGA,EAAI,KAAKuG,GAAcvG,IAAK,CAC1C,IAAMgH,EAAKvF,EAAE4E,GAAOrG,CAAC,EACrB,GAAI,EAAEgH,aAAcf,IAAOe,EAAG,OAAS,KACrC,MAAO,EAEX,CACA,MAAO,EACT,CAEA,OAAK,CAEH,GADI,KAAKd,KAAU,MACf,KAAKI,IAAS,OAAS,IAAK,MAAO,GACvC,GAAI,CAAC,KAAKA,IAAS,MAAK,EAAI,MAAO,GACnC,GAAI,CAAC,KAAK,KAAM,OAAO,KAAKA,IAAS,MAAK,EAG1C,IAAMa,EAAK,KAAKb,GAAU,KAAKA,GAAQD,GAAO,OAAS,EAEvD,OAAO,KAAKE,KAAiBY,EAAK,CACpC,CAEA,OAAOF,EAAkB,CACnB,OAAOA,GAAS,SAAU,KAAK,KAAKA,CAAI,EACvC,KAAK,KAAKA,EAAK,MAAM,IAAI,CAAC,CACjC,CAEA,MAAMH,EAAW,CACf,IAAM1D,EAAI,IAAI6C,GAAI,KAAK,KAAMa,CAAM,EACnC,QAAWrF,KAAK,KAAK4E,GACnBjD,EAAE,OAAO3B,CAAC,EAEZ,OAAO2B,CACT,CAEA,MAAOgE,GACLnI,EACAoI,EACAlD,EACAmD,EAAqB,CAErB,IAAI/C,EAAW,GACXgD,EAAU,GACVC,EAAa,GACbC,EAAW,GACf,GAAIJ,EAAI,OAAS,KAAM,CAErB,IAAIrH,EAAImE,EACJuD,EAAM,GACV,KAAO1H,EAAIf,EAAI,QAAQ,CACrB,IAAMmE,EAAInE,EAAI,OAAOe,GAAG,EAGxB,GAAIuE,GAAYnB,IAAM,KAAM,CAC1BmB,EAAW,CAACA,EACZmD,GAAOtE,EACP,QACF,CAEA,GAAImE,EAAS,CACPvH,IAAMwH,EAAa,GACjBpE,IAAM,KAAOA,IAAM,OACrBqE,EAAW,IAEJrE,IAAM,KAAO,EAAEpD,IAAMwH,EAAa,GAAKC,KAChDF,EAAU,IAEZG,GAAOtE,EACP,QACF,SAAWA,IAAM,IAAK,CACpBmE,EAAU,GACVC,EAAaxH,EACbyH,EAAW,GACXC,GAAOtE,EACP,QACF,CAEA,GAAI,CAACkE,EAAI,OAAShC,GAAclC,CAAC,GAAKnE,EAAI,OAAOe,CAAC,IAAM,IAAK,CAC3DqH,EAAI,KAAKK,CAAG,EACZA,EAAM,GACN,IAAMC,EAAM,IAAI1B,GAAI7C,EAAGiE,CAAG,EAC1BrH,EAAIiG,GAAImB,GAAUnI,EAAK0I,EAAK3H,EAAGsH,CAAG,EAClCD,EAAI,KAAKM,CAAG,EACZ,QACF,CACAD,GAAOtE,CACT,CACA,OAAAiE,EAAI,KAAKK,CAAG,EACL1H,CACT,CAIA,IAAIA,EAAImE,EAAM,EACV8C,EAAO,IAAIhB,GAAI,KAAMoB,CAAG,EACtBhG,EAAe,CAAA,EACjBqG,EAAM,GACV,KAAO1H,EAAIf,EAAI,QAAQ,CACrB,IAAMmE,EAAInE,EAAI,OAAOe,GAAG,EAGxB,GAAIuE,GAAYnB,IAAM,KAAM,CAC1BmB,EAAW,CAACA,EACZmD,GAAOtE,EACP,QACF,CAEA,GAAImE,EAAS,CACPvH,IAAMwH,EAAa,GACjBpE,IAAM,KAAOA,IAAM,OACrBqE,EAAW,IAEJrE,IAAM,KAAO,EAAEpD,IAAMwH,EAAa,GAAKC,KAChDF,EAAU,IAEZG,GAAOtE,EACP,QACF,SAAWA,IAAM,IAAK,CACpBmE,EAAU,GACVC,EAAaxH,EACbyH,EAAW,GACXC,GAAOtE,EACP,QACF,CAEA,GAAIkC,GAAclC,CAAC,GAAKnE,EAAI,OAAOe,CAAC,IAAM,IAAK,CAC7CiH,EAAK,KAAKS,CAAG,EACbA,EAAM,GACN,IAAMC,EAAM,IAAI1B,GAAI7C,EAAG6D,CAAI,EAC3BA,EAAK,KAAKU,CAAG,EACb3H,EAAIiG,GAAImB,GAAUnI,EAAK0I,EAAK3H,EAAGsH,CAAG,EAClC,QACF,CACA,GAAIlE,IAAM,IAAK,CACb6D,EAAK,KAAKS,CAAG,EACbA,EAAM,GACNrG,EAAM,KAAK4F,CAAI,EACfA,EAAO,IAAIhB,GAAI,KAAMoB,CAAG,EACxB,QACF,CACA,GAAIjE,IAAM,IACR,OAAIsE,IAAQ,IAAML,EAAIhB,GAAO,SAAW,IACtCgB,EAAIT,GAAY,IAElBK,EAAK,KAAKS,CAAG,EACbA,EAAM,GACNL,EAAI,KAAK,GAAGhG,EAAO4F,CAAI,EAChBjH,EAET0H,GAAOtE,CACT,CAKA,OAAAiE,EAAI,KAAO,KACXA,EAAIlB,GAAY,OAChBkB,EAAIhB,GAAS,CAACpH,EAAI,UAAUkF,EAAM,CAAC,CAAC,EAC7BnE,CACT,CAEA,OAAO,SAASyD,EAAiB7B,EAA4B,CAAA,EAAE,CAC7D,IAAMyF,EAAM,IAAIpB,GAAI,KAAM,OAAWrE,CAAO,EAC5C,OAAAqE,GAAImB,GAAU3D,EAAS4D,EAAK,EAAGzF,CAAO,EAC/ByF,CACT,CAIA,aAAW,CAGT,GAAI,OAAS,KAAKnB,GAAO,OAAO,KAAKA,GAAM,YAAW,EAEtD,IAAMjC,EAAO,KAAK,SAAQ,EACpB,CAAC2D,EAAIrG,EAAMsG,EAAUvD,CAAK,EAAI,KAAK,eAAc,EAUvD,GAAI,EALFuD,GACA,KAAK1B,IACJ,KAAKO,GAAS,QACb,CAAC,KAAKA,GAAS,iBACfzC,EAAK,YAAW,IAAOA,EAAK,YAAW,GAEzC,OAAO1C,EAGT,IAAMuG,GAAS,KAAKpB,GAAS,OAAS,IAAM,KAAOpC,EAAQ,IAAM,IACjE,OAAO,OAAO,OAAO,IAAI,OAAO,IAAIsD,CAAE,IAAKE,CAAK,EAAG,CACjD,KAAMF,EACN,MAAO3D,CAAAA,CACR,CACH,CAEA,IAAI,SAAO,CACT,OAAO,KAAKyC,EACd,CAuEA,eACEqB,EAAkB,CAElB,IAAMC,EAAMD,GAAY,CAAC,CAAC,KAAKrB,GAAS,IAExC,GADI,KAAKR,KAAU,MAAM,KAAKa,GAAS,EACnC,CAAC,KAAK,KAAM,CACd,IAAMkB,EACJ,KAAK,QAAO,GACZ,KAAK,MAAK,GACV,CAAC,KAAK5B,GAAO,KAAKzC,GAAK,OAAOA,GAAM,QAAQ,EACxCsE,EAAM,KAAK7B,GACd,IAAI5E,GAAI,CACP,GAAM,CAACmG,EAAIO,EAAGN,EAAUvD,CAAK,EAC3B,OAAO7C,GAAM,SACXwE,GAAImC,GAAW3G,EAAG,KAAK0E,GAAW8B,CAAO,EACzCxG,EAAE,eAAesG,CAAQ,EAC7B,OAAA,KAAK5B,GAAY,KAAKA,IAAa0B,EACnC,KAAKzB,GAAS,KAAKA,IAAU9B,EACtBsD,CACT,CAAC,EACA,KAAK,EAAE,EAENS,EAAQ,GACZ,GAAI,KAAK,QAAO,GACV,OAAO,KAAKhC,GAAO,CAAC,GAAM,UAQxB,EADF,KAAKA,GAAO,SAAW,GAAKX,GAAS,IAAI,KAAKW,GAAO,CAAC,CAAC,GACpC,CACnB,IAAMiC,EAAM7C,GAGN8C,EAEHP,GAAOM,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC,GAE5BA,EAAI,WAAW,KAAK,GAAKI,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC,GAE9CA,EAAI,WAAW,QAAQ,GAAKI,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC,EAG9CM,EAAY,CAACR,GAAO,CAACD,GAAYO,EAAI,IAAIJ,EAAI,OAAO,CAAC,CAAC,EAE5DG,EACEE,EAAahD,GACXiD,EAAYhD,GACZ,EACN,CAKJ,IAAIiD,EAAM,GACV,OACE,KAAK,MAAK,GACV,KAAKvC,GAAMO,IACX,KAAKH,IAAS,OAAS,MAEvBmC,EAAM,aAGD,CADOJ,EAAQH,EAAMO,EAG1BvD,GAASgD,CAAG,EACX,KAAK/B,GAAY,CAAC,CAAC,KAAKA,GACzB,KAAKC,EAAAA,CAET,CAMA,IAAMsC,EAAW,KAAK,OAAS,KAAO,KAAK,OAAS,IAE9CL,EAAQ,KAAK,OAAS,IAAM,YAAc,MAC5C9G,EAAO,KAAKoH,GAAeX,CAAG,EAElC,GAAI,KAAK,QAAO,GAAM,KAAK,MAAK,GAAM,CAACzG,GAAQ,KAAK,OAAS,IAAK,CAGhE,IAAMqC,EAAI,KAAK,SAAQ,EACvB,OAAA,KAAKyC,GAAS,CAACzC,CAAC,EAChB,KAAK,KAAO,KACZ,KAAKuC,GAAY,OACV,CAACvC,EAAGsB,GAAS,KAAK,SAAQ,CAAE,EAAG,GAAO,EAAK,CACpD,CAGA,IAAI0D,EACF,CAACF,GAAYX,GAAYC,GAAO,CAACxC,GAC/B,GACA,KAAKmD,GAAe,EAAI,EACxBC,IAAmBrH,IACrBqH,EAAiB,IAEfA,IACFrH,EAAO,MAAMA,CAAI,OAAOqH,CAAc,OAIxC,IAAIC,EAAQ,GACZ,GAAI,KAAK,OAAS,KAAO,KAAKjC,GAC5BiC,GAAS,KAAK,QAAO,GAAM,CAACb,EAAMxC,GAAa,IAAMO,OAChD,CACL,IAAM+C,EACJ,KAAK,OAAS,IAEZ,MACC,KAAK,QAAO,GAAM,CAACd,GAAO,CAACD,EAAWvC,GAAa,IACpDM,GACA,IACA,KAAK,OAAS,IAAM,IACpB,KAAK,OAAS,IAAM,KACpB,KAAK,OAAS,KAAO8C,EAAiB,IACtC,KAAK,OAAS,KAAOA,EAAiB,KACtC,IAAI,KAAK,IAAI,GACjBC,EAAQR,EAAQ9G,EAAOuH,CACzB,CACA,MAAO,CACLD,EACA3D,GAAS3D,CAAI,EACZ,KAAK4E,GAAY,CAAC,CAAC,KAAKA,GACzB,KAAKC,EAAAA,CAET,CAEAuC,GAAeX,EAAY,CACzB,OAAO,KAAK3B,GACT,IAAI5E,GAAI,CAGP,GAAI,OAAOA,GAAM,SACf,MAAM,IAAI,MAAM,8BAA8B,EAIhD,GAAM,CAACmG,EAAIO,EAAGY,EAAWzE,CAAK,EAAI7C,EAAE,eAAeuG,CAAG,EACtD,OAAA,KAAK5B,GAAS,KAAKA,IAAU9B,EACtBsD,CACT,CAAC,EACA,OAAOnG,GAAK,EAAE,KAAK,QAAO,GAAM,KAAK,MAAK,IAAO,CAAC,CAACA,CAAC,EACpD,KAAK,GAAG,CACb,CAEA,MAAO2G,GACLnE,EACA4D,EACAI,EAAmB,GAAK,CAExB,IAAI1D,EAAW,GACXqD,EAAK,GACLtD,EAAQ,GAER0E,EAAS,GACb,QAAShJ,EAAI,EAAGA,EAAIiE,EAAK,OAAQjE,IAAK,CACpC,IAAMoD,EAAIa,EAAK,OAAOjE,CAAC,EACvB,GAAIuE,EAAU,CACZA,EAAW,GACXqD,IAAOjC,GAAW,IAAIvC,CAAC,EAAI,KAAO,IAAMA,EACxC,QACF,CACA,GAAIA,IAAM,IAAK,CACb,GAAI4F,EAAQ,SACZA,EAAS,GACTpB,GAAMK,GAAW,SAAS,KAAKhE,CAAI,EAAI8B,GAAcD,GACrD+B,EAAW,GACX,QACF,MACEmB,EAAS,GAEX,GAAI5F,IAAM,KAAM,CACVpD,IAAMiE,EAAK,OAAS,EACtB2D,GAAM,OAENrD,EAAW,GAEb,QACF,CACA,GAAInB,IAAM,IAAK,CACb,GAAM,CAAC8E,EAAKe,EAAWC,EAAUC,CAAK,EAAInF,GAAWC,EAAMjE,CAAC,EAC5D,GAAIkJ,EAAU,CACZtB,GAAMM,EACN5D,EAAQA,GAAS2E,EACjBjJ,GAAKkJ,EAAW,EAChBrB,EAAWA,GAAYsB,EACvB,QACF,CACF,CACA,GAAI/F,IAAM,IAAK,CACbwE,GAAM/B,GACNgC,EAAW,GACX,QACF,CACAD,GAAMhC,GAAaxC,CAAC,CACtB,CACA,MAAO,CAACwE,EAAI1C,GAASjB,CAAI,EAAG,CAAC,CAAC4D,EAAUvD,CAAK,CAC/C,CAAA,ECzpBW8E,GAAS,CACpBxF,EACA,CACE,qBAAAuB,EAAuB,GACvB,cAAAC,EAAgB,EAAK,EAC+C,CAAA,IAKlEA,EACKD,EACHvB,EAAE,QAAQ,eAAgB,MAAM,EAChCA,EAAE,QAAQ,iBAAkB,MAAM,EAEjCuB,EACHvB,EAAE,QAAQ,aAAc,MAAM,EAC9BA,EAAE,QAAQ,eAAgB,MAAM,EC6DzByF,GAAY,CACvB5H,EACAgC,EACA7B,EAA4B,CAAA,KAE5B4B,GAAmBC,CAAO,EAGtB,CAAC7B,EAAQ,WAAa6B,EAAQ,OAAO,CAAC,IAAM,IACvC,GAGF,IAAI6F,GAAU7F,EAAS7B,CAAO,EAAE,MAAMH,CAAC,GAI1C8H,GAAe,wBACfC,GAAkB7B,GAAiB8B,GACvC,CAACA,EAAE,WAAW,GAAG,GAAKA,EAAE,SAAS9B,CAAG,EAChC+B,GAAqB/B,GAAiB8B,GAAcA,EAAE,SAAS9B,CAAG,EAClEgC,GAAwBhC,IAC5BA,EAAMA,EAAI,YAAW,EACb8B,GAAc,CAACA,EAAE,WAAW,GAAG,GAAKA,EAAE,YAAW,EAAG,SAAS9B,CAAG,GAEpEiC,GAA2BjC,IAC/BA,EAAMA,EAAI,YAAW,EACb8B,GAAcA,EAAE,YAAW,EAAG,SAAS9B,CAAG,GAE9CkC,GAAgB,aAChBC,GAAmBL,GACvB,CAACA,EAAE,WAAW,GAAG,GAAKA,EAAE,SAAS,GAAG,EAChCM,GAAsBN,GAC1BA,IAAM,KAAOA,IAAM,MAAQA,EAAE,SAAS,GAAG,EACrCO,GAAY,UACZC,GAAeR,GACnBA,IAAM,KAAOA,IAAM,MAAQA,EAAE,WAAW,GAAG,EACvCS,GAAS,QACTC,GAAYV,GAAcA,EAAE,SAAW,GAAK,CAACA,EAAE,WAAW,GAAG,EAC7DW,GAAeX,GACnBA,EAAE,SAAW,GAAKA,IAAM,KAAOA,IAAM,KACjCY,GAAW,yBACXC,GAAmB,CAAC,CAACC,EAAI5C,EAAM,EAAE,IAAuB,CAC5D,IAAM6C,EAAQC,GAAgB,CAACF,CAAE,CAAC,EAClC,OAAK5C,GACLA,EAAMA,EAAI,YAAW,EACb8B,GAAce,EAAMf,CAAC,GAAKA,EAAE,YAAW,EAAG,SAAS9B,CAAG,GAF7C6C,CAGnB,EACME,GAAsB,CAAC,CAACH,EAAI5C,EAAM,EAAE,IAAuB,CAC/D,IAAM6C,EAAQG,GAAmB,CAACJ,CAAE,CAAC,EACrC,OAAK5C,GACLA,EAAMA,EAAI,YAAW,EACb8B,GAAce,EAAMf,CAAC,GAAKA,EAAE,YAAW,EAAG,SAAS9B,CAAG,GAF7C6C,CAGnB,EACMI,GAAgB,CAAC,CAACL,EAAI5C,EAAM,EAAE,IAAuB,CACzD,IAAM6C,EAAQG,GAAmB,CAACJ,CAAE,CAAC,EACrC,OAAQ5C,EAAe8B,GAAce,EAAMf,CAAC,GAAKA,EAAE,SAAS9B,CAAG,EAAjD6C,CAChB,EACMK,GAAa,CAAC,CAACN,EAAI5C,EAAM,EAAE,IAAuB,CACtD,IAAM6C,EAAQC,GAAgB,CAACF,CAAE,CAAC,EAClC,OAAQ5C,EAAe8B,GAAce,EAAMf,CAAC,GAAKA,EAAE,SAAS9B,CAAG,EAAjD6C,CAChB,EACMC,GAAkB,CAAC,CAACF,CAAE,IAAuB,CACjD,IAAMO,EAAMP,EAAG,OACf,OAAQd,GAAcA,EAAE,SAAWqB,GAAO,CAACrB,EAAE,WAAW,GAAG,CAC7D,EACMkB,GAAqB,CAAC,CAACJ,CAAE,IAAuB,CACpD,IAAMO,EAAMP,EAAG,OACf,OAAQd,GAAcA,EAAE,SAAWqB,GAAOrB,IAAM,KAAOA,IAAM,IAC/D,EAGMsB,GACJ,OAAO,SAAY,UAAY,QAC5B,OAAO,QAAQ,KAAQ,UACtB,QAAQ,KACR,QAAQ,IAAI,gCACd,QAAQ,SACR,QAIEC,GAAsC,CAC1C,MAAO,CAAE,IAAK,IAAI,EAClB,MAAO,CAAE,IAAK,GAAG,CAAA,EAINC,GACXF,KAAoB,QAAUC,GAAK,MAAM,IAAMA,GAAK,MAAM,IAC5D3B,GAAU,IAAM4B,GAET,IAAMC,GAAW,OAAO,aAAa,EAC5C7B,GAAU,SAAW6B,GAIrB,IAAMrF,GAAQ,OAGRC,GAAOD,GAAQ,KAKfsF,GAAa,0CAIbC,GAAe,0BAERC,GACX,CAAC5H,EAAiB7B,EAA4B,CAAA,IAC7CH,GACC4H,GAAU5H,EAAGgC,EAAS7B,CAAO,EACjCyH,GAAU,OAASgC,GAEnB,IAAM1D,GAAM,CAAC5I,EAAqBC,EAAsB,CAAA,IACtD,OAAO,OAAO,CAAA,EAAID,EAAGC,CAAC,EAEXsM,GAAYC,GAA2C,CAClE,GAAI,CAACA,GAAO,OAAOA,GAAQ,UAAY,CAAC,OAAO,KAAKA,CAAG,EAAE,OACvD,OAAOlC,GAGT,IAAMmC,EAAOnC,GAKb,OAAO,OAAO,OAHJ,CAAC5H,EAAWgC,EAAiB7B,EAA4B,CAAA,IACjE4J,EAAK/J,EAAGgC,EAASkE,GAAI4D,EAAK3J,CAAO,CAAC,EAEZ,CACtB,UAAW,cAAwB4J,EAAK,SAAS,CAC/C,YAAY/H,EAAiB7B,EAA4B,CAAA,EAAE,CACzD,MAAM6B,EAASkE,GAAI4D,EAAK3J,CAAO,CAAC,CAClC,CACA,OAAO,SAASA,EAAyB,CACvC,OAAO4J,EAAK,SAAS7D,GAAI4D,EAAK3J,CAAO,CAAC,EAAE,SAC1C,CAAA,EAGF,IAAK,cAAkB4J,EAAK,GAAG,CAE7B,YACE3E,EACAC,EACAlF,EAA4B,CAAA,EAAE,CAE9B,MAAMiF,EAAMC,EAAQa,GAAI4D,EAAK3J,CAAO,CAAC,CACvC,CAGA,OAAO,SAAS6B,EAAiB7B,EAA4B,CAAA,EAAE,CAC7D,OAAO4J,EAAK,IAAI,SAAS/H,EAASkE,GAAI4D,EAAK3J,CAAO,CAAC,CACrD,CAAA,EAGF,SAAU,CACR,EACAA,EAGI,CAAA,IACD4J,EAAK,SAAS,EAAG7D,GAAI4D,EAAK3J,CAAO,CAAC,EAEvC,OAAQ,CACN,EACAA,EAGI,CAAA,IACD4J,EAAK,OAAO,EAAG7D,GAAI4D,EAAK3J,CAAO,CAAC,EAErC,OAAQ,CAAC6B,EAAiB7B,EAA4B,CAAA,IACpD4J,EAAK,OAAO/H,EAASkE,GAAI4D,EAAK3J,CAAO,CAAC,EAExC,SAAWA,GACT4J,EAAK,SAAS7D,GAAI4D,EAAK3J,CAAO,CAAC,EAEjC,OAAQ,CAAC6B,EAAiB7B,EAA4B,CAAA,IACpD4J,EAAK,OAAO/H,EAASkE,GAAI4D,EAAK3J,CAAO,CAAC,EAExC,YAAa,CAAC6B,EAAiB7B,EAA4B,CAAA,IACzD4J,EAAK,YAAY/H,EAASkE,GAAI4D,EAAK3J,CAAO,CAAC,EAE7C,MAAO,CACL6J,EACAhI,EACA7B,EAA4B,CAAA,IACzB4J,EAAK,MAAMC,EAAMhI,EAASkE,GAAI4D,EAAK3J,CAAO,CAAC,EAEhD,IAAK4J,EAAK,IACV,SAAUN,EAAAA,CACX,CACH,EACA7B,GAAU,SAAWiC,GAYd,IAAMI,GAAc,CACzBjI,EACA7B,EAA4B,CAAA,KAE5B4B,GAAmBC,CAAO,EAItB7B,EAAQ,SAAW,CAAC,mBAAmB,KAAK6B,CAAO,EAE9C,CAACA,CAAO,EAGV9B,GAAO8B,EAAS,CAAE,IAAK7B,EAAQ,cAAc,CAAE,GAExDyH,GAAU,YAAcqC,GAcjB,IAAMC,GAAS,CAAClI,EAAiB7B,EAA4B,CAAA,IAClE,IAAI0H,GAAU7F,EAAS7B,CAAO,EAAE,OAAM,EACxCyH,GAAU,OAASsC,GAEZ,IAAMC,GAAQ,CACnBH,EACAhI,EACA7B,EAA4B,CAAA,IAC1B,CACF,IAAMiK,EAAK,IAAIvC,GAAU7F,EAAS7B,CAAO,EACzC,OAAA6J,EAAOA,EAAK,OAAOhC,GAAKoC,EAAG,MAAMpC,CAAC,CAAC,EAC/BoC,EAAG,QAAQ,QAAU,CAACJ,EAAK,QAC7BA,EAAK,KAAKhI,CAAO,EAEZgI,CACT,EACApC,GAAU,MAAQuC,GAGlB,IAAME,GAAY,0BACZlG,GAAgBhC,GACpBA,EAAE,QAAQ,2BAA4B,MAAM,EAUjC0F,GAAP,KAAgB,CACpB,QACA,IACA,QAEA,qBACA,SACA,OACA,QACA,MACA,wBACA,QACA,QACA,UACA,OAEA,UACA,SACA,mBAEA,OACA,YAAY7F,EAAiB7B,EAA4B,CAAA,EAAE,CACzD4B,GAAmBC,CAAO,EAE1B7B,EAAUA,GAAW,CAAA,EACrB,KAAK,QAAUA,EACf,KAAK,QAAU6B,EACf,KAAK,SAAW7B,EAAQ,UAAYmJ,GACpC,KAAK,UAAY,KAAK,WAAa,QAEnC,IAAMgB,EAAO,qBACb,KAAK,qBACH,CAAC,CAACnK,EAAQ,sBAAwBA,EAAQmK,CAAG,IAAM,GACjD,KAAK,uBACP,KAAK,QAAU,KAAK,QAAQ,QAAQ,MAAO,GAAG,GAEhD,KAAK,wBAA0B,CAAC,CAACnK,EAAQ,wBACzC,KAAK,OAAS,KACd,KAAK,OAAS,GACd,KAAK,SAAW,CAAC,CAACA,EAAQ,SAC1B,KAAK,QAAU,GACf,KAAK,MAAQ,GACb,KAAK,QAAU,CAAC,CAACA,EAAQ,QACzB,KAAK,OAAS,CAAC,CAAC,KAAK,QAAQ,OAC7B,KAAK,mBACHA,EAAQ,qBAAuB,OAC7BA,EAAQ,mBACR,CAAC,EAAE,KAAK,WAAa,KAAK,QAE9B,KAAK,QAAU,CAAA,EACf,KAAK,UAAY,CAAA,EACjB,KAAK,IAAM,CAAA,EAGX,KAAK,KAAI,CACX,CAEA,UAAQ,CACN,GAAI,KAAK,QAAQ,eAAiB,KAAK,IAAI,OAAS,EAClD,MAAO,GAET,QAAW6B,KAAW,KAAK,IACzB,QAAWwD,KAAQxD,EACjB,GAAI,OAAOwD,GAAS,SAAU,MAAO,GAGzC,MAAO,EACT,CAEA,SAASkB,EAAQ,CAAG,CAEpB,MAAI,CACF,IAAM1E,EAAU,KAAK,QACf7B,EAAU,KAAK,QAGrB,GAAI,CAACA,EAAQ,WAAa6B,EAAQ,OAAO,CAAC,IAAM,IAAK,CACnD,KAAK,QAAU,GACf,MACF,CAEA,GAAI,CAACA,EAAS,CACZ,KAAK,MAAQ,GACb,MACF,CAGA,KAAK,YAAW,EAGhB,KAAK,QAAU,CAAC,GAAG,IAAI,IAAI,KAAK,YAAW,CAAE,CAAC,EAE1C7B,EAAQ,QACV,KAAK,MAAQ,IAAIoK,IAAgB,QAAQ,MAAM,GAAGA,CAAI,GAGxD,KAAK,MAAM,KAAK,QAAS,KAAK,OAAO,EAWrC,IAAMC,EAAe,KAAK,QAAQ,IAAIrI,GAAK,KAAK,WAAWA,CAAC,CAAC,EAC7D,KAAK,UAAY,KAAK,WAAWqI,CAAY,EAC7C,KAAK,MAAM,KAAK,QAAS,KAAK,SAAS,EAGvC,IAAIC,EAAM,KAAK,UAAU,IAAI,CAACtI,EAAGuE,EAAGgE,IAAM,CACxC,GAAI,KAAK,WAAa,KAAK,mBAAoB,CAE7C,IAAMC,EACJxI,EAAE,CAAC,IAAM,IACTA,EAAE,CAAC,IAAM,KACRA,EAAE,CAAC,IAAM,KAAO,CAACkI,GAAU,KAAKlI,EAAE,CAAC,CAAC,IACrC,CAACkI,GAAU,KAAKlI,EAAE,CAAC,CAAC,EAChByI,EAAU,WAAW,KAAKzI,EAAE,CAAC,CAAC,EACpC,GAAIwI,EACF,MAAO,CACL,GAAGxI,EAAE,MAAM,EAAG,CAAC,EACf,GAAGA,EAAE,MAAM,CAAC,EAAE,IAAI0I,GAAM,KAAK,MAAMA,CAAE,CAAC,CAAA,EAEnC,GAAID,EACT,MAAO,CAACzI,EAAE,CAAC,EAAG,GAAGA,EAAE,MAAM,CAAC,EAAE,IAAI0I,GAAM,KAAK,MAAMA,CAAE,CAAC,CAAC,CAEzD,CACA,OAAO1I,EAAE,IAAI0I,GAAM,KAAK,MAAMA,CAAE,CAAC,CACnC,CAAC,EAUD,GARA,KAAK,MAAM,KAAK,QAASJ,CAAG,EAG5B,KAAK,IAAMA,EAAI,OACbtI,GAAKA,EAAE,QAAQ,EAAK,IAAM,EAAE,EAI1B,KAAK,UACP,QAAS5D,EAAI,EAAGA,EAAI,KAAK,IAAI,OAAQA,IAAK,CACxC,IAAMyB,EAAI,KAAK,IAAIzB,CAAC,EAElByB,EAAE,CAAC,IAAM,IACTA,EAAE,CAAC,IAAM,IACT,KAAK,UAAUzB,CAAC,EAAE,CAAC,IAAM,KACzB,OAAOyB,EAAE,CAAC,GAAM,UAChB,YAAY,KAAKA,EAAE,CAAC,CAAC,IAErBA,EAAE,CAAC,EAAI,IAEX,CAGF,KAAK,MAAM,KAAK,QAAS,KAAK,GAAG,CACnC,CAOA,WAAW8K,EAAqB,CAE9B,GAAI,KAAK,QAAQ,WACf,QAASvM,EAAI,EAAGA,EAAIuM,EAAU,OAAQvM,IACpC,QAASuD,EAAI,EAAGA,EAAIgJ,EAAUvM,CAAC,EAAE,OAAQuD,IACnCgJ,EAAUvM,CAAC,EAAEuD,CAAC,IAAM,OACtBgJ,EAAUvM,CAAC,EAAEuD,CAAC,EAAI,KAM1B,GAAM,CAAE,kBAAAiJ,EAAoB,CAAC,EAAK,KAAK,QAEvC,OAAIA,GAAqB,GAEvBD,EAAY,KAAK,qBAAqBA,CAAS,EAC/CA,EAAY,KAAK,sBAAsBA,CAAS,GACvCC,GAAqB,EAE9BD,EAAY,KAAK,iBAAiBA,CAAS,EAG3CA,EAAY,KAAK,0BAA0BA,CAAS,EAG/CA,CACT,CAGA,0BAA0BA,EAAqB,CAC7C,OAAOA,EAAU,IAAIlL,GAAQ,CAC3B,IAAIoL,EAAa,GACjB,MAAeA,EAAKpL,EAAM,QAAQ,KAAMoL,EAAK,CAAC,KAAvC,IAA2C,CAChD,IAAI,EAAIA,EACR,KAAOpL,EAAM,EAAI,CAAC,IAAM,MACtB,IAEE,IAAMoL,GACRpL,EAAM,OAAOoL,EAAI,EAAIA,CAAE,CAE3B,CACA,OAAOpL,CACT,CAAC,CACH,CAGA,iBAAiBkL,EAAqB,CACpC,OAAOA,EAAU,IAAIlL,IACnBA,EAAQA,EAAM,OAAO,CAAC6K,EAAejF,IAAQ,CAC3C,IAAMyF,EAAOR,EAAIA,EAAI,OAAS,CAAC,EAC/B,OAAIjF,IAAS,MAAQyF,IAAS,KACrBR,EAELjF,IAAS,MACPyF,GAAQA,IAAS,MAAQA,IAAS,KAAOA,IAAS,MACpDR,EAAI,IAAG,EACAA,IAGXA,EAAI,KAAKjF,CAAI,EACNiF,EACT,EAAG,CAAA,CAAE,EACE7K,EAAM,SAAW,EAAI,CAAC,EAAE,EAAIA,EACpC,CACH,CAEA,qBAAqBA,EAAwB,CACtC,MAAM,QAAQA,CAAK,IACtBA,EAAQ,KAAK,WAAWA,CAAK,GAE/B,IAAIsL,EAAwB,GAC5B,EAAG,CAGD,GAFAA,EAAe,GAEX,CAAC,KAAK,wBAAyB,CACjC,QAAS,EAAI,EAAG,EAAItL,EAAM,OAAS,EAAG,IAAK,CACzC,IAAMI,EAAIJ,EAAM,CAAC,EAEb,IAAM,GAAKI,IAAM,IAAMJ,EAAM,CAAC,IAAM,KACpCI,IAAM,KAAOA,IAAM,MACrBkL,EAAe,GACftL,EAAM,OAAO,EAAG,CAAC,EACjB,IAEJ,CAEEA,EAAM,CAAC,IAAM,KACbA,EAAM,SAAW,IAChBA,EAAM,CAAC,IAAM,KAAOA,EAAM,CAAC,IAAM,MAElCsL,EAAe,GACftL,EAAM,IAAG,EAEb,CAGA,IAAIuL,EAAa,EACjB,MAAeA,EAAKvL,EAAM,QAAQ,KAAMuL,EAAK,CAAC,KAAvC,IAA2C,CAChD,IAAMnL,EAAIJ,EAAMuL,EAAK,CAAC,EAClBnL,GAAKA,IAAM,KAAOA,IAAM,MAAQA,IAAM,OACxCkL,EAAe,GACftL,EAAM,OAAOuL,EAAK,EAAG,CAAC,EACtBA,GAAM,EAEV,CACF,OAASD,GACT,OAAOtL,EAAM,SAAW,EAAI,CAAC,EAAE,EAAIA,CACrC,CAoBA,qBAAqBkL,EAAqB,CACxC,IAAII,EAAe,GACnB,EAAG,CACDA,EAAe,GAEf,QAAStL,KAASkL,EAAW,CAC3B,IAAIE,EAAa,GACjB,MAAeA,EAAKpL,EAAM,QAAQ,KAAMoL,EAAK,CAAC,KAAvC,IAA2C,CAChD,IAAII,EAAcJ,EAClB,KAAOpL,EAAMwL,EAAM,CAAC,IAAM,MAExBA,IAIEA,EAAMJ,GACRpL,EAAM,OAAOoL,EAAK,EAAGI,EAAMJ,CAAE,EAG/B,IAAIK,EAAOzL,EAAMoL,EAAK,CAAC,EACjBhL,EAAIJ,EAAMoL,EAAK,CAAC,EAChBM,EAAK1L,EAAMoL,EAAK,CAAC,EAEvB,GADIK,IAAS,MAEX,CAACrL,GACDA,IAAM,KACNA,IAAM,MACN,CAACsL,GACDA,IAAO,KACPA,IAAO,KAEP,SAEFJ,EAAe,GAEftL,EAAM,OAAOoL,EAAI,CAAC,EAClB,IAAMO,EAAQ3L,EAAM,MAAM,CAAC,EAC3B2L,EAAMP,CAAE,EAAI,KACZF,EAAU,KAAKS,CAAK,EACpBP,GACF,CAGA,GAAI,CAAC,KAAK,wBAAyB,CACjC,QAASzM,EAAI,EAAGA,EAAIqB,EAAM,OAAS,EAAGrB,IAAK,CACzC,IAAMyB,EAAIJ,EAAMrB,CAAC,EAEbA,IAAM,GAAKyB,IAAM,IAAMJ,EAAM,CAAC,IAAM,KACpCI,IAAM,KAAOA,IAAM,MACrBkL,EAAe,GACftL,EAAM,OAAOrB,EAAG,CAAC,EACjBA,IAEJ,CAEEqB,EAAM,CAAC,IAAM,KACbA,EAAM,SAAW,IAChBA,EAAM,CAAC,IAAM,KAAOA,EAAM,CAAC,IAAM,MAElCsL,EAAe,GACftL,EAAM,IAAG,EAEb,CAGA,IAAIuL,EAAa,EACjB,MAAeA,EAAKvL,EAAM,QAAQ,KAAMuL,EAAK,CAAC,KAAvC,IAA2C,CAChD,IAAMnL,EAAIJ,EAAMuL,EAAK,CAAC,EACtB,GAAInL,GAAKA,IAAM,KAAOA,IAAM,MAAQA,IAAM,KAAM,CAC9CkL,EAAe,GAEf,IAAMM,EADUL,IAAO,GAAKvL,EAAMuL,EAAK,CAAC,IAAM,KACtB,CAAC,GAAG,EAAI,CAAA,EAChCvL,EAAM,OAAOuL,EAAK,EAAG,EAAG,GAAGK,CAAK,EAC5B5L,EAAM,SAAW,GAAGA,EAAM,KAAK,EAAE,EACrCuL,GAAM,CACR,CACF,CACF,CACF,OAASD,GAET,OAAOJ,CACT,CASA,sBAAsBA,EAAqB,CACzC,QAASvM,EAAI,EAAGA,EAAIuM,EAAU,OAAS,EAAGvM,IACxC,QAASuD,EAAIvD,EAAI,EAAGuD,EAAIgJ,EAAU,OAAQhJ,IAAK,CAC7C,IAAM2J,EAAU,KAAK,WACnBX,EAAUvM,CAAC,EACXuM,EAAUhJ,CAAC,EACX,CAAC,KAAK,uBAAuB,EAE/B,GAAI2J,EAAS,CACXX,EAAUvM,CAAC,EAAI,CAAA,EACfuM,EAAUhJ,CAAC,EAAI2J,EACf,KACF,CACF,CAEF,OAAOX,EAAU,OAAOE,GAAMA,EAAG,MAAM,CACzC,CAEA,WACE1N,EACAC,EACAmO,EAAwB,GAAK,CAE7B,IAAIrN,EAAK,EACLC,EAAK,EACLF,EAAmB,CAAA,EACnBuN,EAAgB,GACpB,KAAOtN,EAAKf,EAAE,QAAUgB,EAAKf,EAAE,QAC7B,GAAID,EAAEe,CAAE,IAAMd,EAAEe,CAAE,EAChBF,EAAO,KAAKuN,IAAU,IAAMpO,EAAEe,CAAE,EAAIhB,EAAEe,CAAE,CAAC,EACzCA,IACAC,YACSoN,GAAgBpO,EAAEe,CAAE,IAAM,MAAQd,EAAEe,CAAE,IAAMhB,EAAEe,EAAK,CAAC,EAC7DD,EAAO,KAAKd,EAAEe,CAAE,CAAC,EACjBA,YACSqN,GAAgBnO,EAAEe,CAAE,IAAM,MAAQhB,EAAEe,CAAE,IAAMd,EAAEe,EAAK,CAAC,EAC7DF,EAAO,KAAKb,EAAEe,CAAE,CAAC,EACjBA,YAEAhB,EAAEe,CAAE,IAAM,KACVd,EAAEe,CAAE,IACH,KAAK,QAAQ,KAAO,CAACf,EAAEe,CAAE,EAAE,WAAW,GAAG,IAC1Cf,EAAEe,CAAE,IAAM,KACV,CACA,GAAIqN,IAAU,IAAK,MAAO,GAC1BA,EAAQ,IACRvN,EAAO,KAAKd,EAAEe,CAAE,CAAC,EACjBA,IACAC,GACF,SACEf,EAAEe,CAAE,IAAM,KACVhB,EAAEe,CAAE,IACH,KAAK,QAAQ,KAAO,CAACf,EAAEe,CAAE,EAAE,WAAW,GAAG,IAC1Cf,EAAEe,CAAE,IAAM,KACV,CACA,GAAIsN,IAAU,IAAK,MAAO,GAC1BA,EAAQ,IACRvN,EAAO,KAAKb,EAAEe,CAAE,CAAC,EACjBD,IACAC,GACF,KACE,OAAO,GAKX,OAAOhB,EAAE,SAAWC,EAAE,QAAUa,CAClC,CAEA,aAAW,CACT,GAAI,KAAK,SAAU,OAEnB,IAAM4D,EAAU,KAAK,QACjBe,EAAS,GACT6I,EAAe,EAEnB,QAAS,EAAI,EAAG,EAAI5J,EAAQ,QAAUA,EAAQ,OAAO,CAAC,IAAM,IAAK,IAC/De,EAAS,CAACA,EACV6I,IAGEA,IAAc,KAAK,QAAU5J,EAAQ,MAAM4J,CAAY,GAC3D,KAAK,OAAS7I,CAChB,CAOA,SACE8I,EACA7J,EACA8J,EAAmB,GAAK,CAExB,IAAM3L,EAAU,KAAK,QAKrB,GAAI,KAAK,UAAW,CAClB,IAAM4L,EACJ,OAAOF,EAAK,CAAC,GAAM,UAAY,YAAY,KAAKA,EAAK,CAAC,CAAC,EACnDG,EACJ,CAACD,GACDF,EAAK,CAAC,IAAM,IACZA,EAAK,CAAC,IAAM,IACZA,EAAK,CAAC,IAAM,KACZ,YAAY,KAAKA,EAAK,CAAC,CAAC,EAEpBI,EACJ,OAAOjK,EAAQ,CAAC,GAAM,UAAY,YAAY,KAAKA,EAAQ,CAAC,CAAC,EACzDkK,EACJ,CAACD,GACDjK,EAAQ,CAAC,IAAM,IACfA,EAAQ,CAAC,IAAM,IACfA,EAAQ,CAAC,IAAM,KACf,OAAOA,EAAQ,CAAC,GAAM,UACtB,YAAY,KAAKA,EAAQ,CAAC,CAAC,EAEvBmK,EACJH,EAAU,EACRD,EAAY,EACZ,OACEK,EACJF,EAAa,EACXD,EAAe,EACf,OACJ,GAAI,OAAOE,GAAQ,UAAY,OAAOC,GAAQ,SAAU,CACtD,GAAM,CAACC,EAAIC,CAAE,EAAsB,CACjCT,EAAKM,CAAG,EACRnK,EAAQoK,CAAG,CAAA,EAETC,EAAG,YAAW,IAAOC,EAAG,YAAW,IACrCtK,EAAQoK,CAAG,EAAIC,EACXD,EAAMD,EACRnK,EAAUA,EAAQ,MAAMoK,CAAG,EAClBD,EAAMC,IACfP,EAAOA,EAAK,MAAMM,CAAG,GAG3B,CACF,CAIA,GAAM,CAAE,kBAAApB,EAAoB,CAAC,EAAK,KAAK,QACnCA,GAAqB,IACvBc,EAAO,KAAK,qBAAqBA,CAAI,GAGvC,KAAK,MAAM,WAAY,KAAM,CAAE,KAAAA,EAAM,QAAA7J,CAAO,CAAE,EAC9C,KAAK,MAAM,WAAY6J,EAAK,OAAQ7J,EAAQ,MAAM,EAElD,QACMuK,EAAK,EAAGC,EAAK,EAAGC,EAAKZ,EAAK,OAAQnG,EAAK1D,EAAQ,OACnDuK,EAAKE,GAAMD,EAAK9G,EAChB6G,IAAMC,IACN,CACA,KAAK,MAAM,eAAe,EAC1B,IAAIxM,EAAIgC,EAAQwK,CAAE,EACdxE,EAAI6D,EAAKU,CAAE,EAOf,GALA,KAAK,MAAMvK,EAAShC,EAAGgI,CAAC,EAKpBhI,IAAM,GACR,MAAO,GAIT,GAAIA,IAAMyJ,GAAU,CAClB,KAAK,MAAM,WAAY,CAACzH,EAAShC,EAAGgI,CAAC,CAAC,EAwBtC,IAAI0E,EAAKH,EACLI,EAAKH,EAAK,EACd,GAAIG,IAAOjH,EAAI,CAQb,IAPA,KAAK,MAAM,eAAe,EAOnB6G,EAAKE,EAAIF,IACd,GACEV,EAAKU,CAAE,IAAM,KACbV,EAAKU,CAAE,IAAM,MACZ,CAACpM,EAAQ,KAAO0L,EAAKU,CAAE,EAAE,OAAO,CAAC,IAAM,IAExC,MAAO,GAEX,MAAO,EACT,CAGA,KAAOG,EAAKD,GAAI,CACd,IAAIG,EAAYf,EAAKa,CAAE,EAKvB,GAHA,KAAK,MAAM;gBAAoBb,EAAMa,EAAI1K,EAAS2K,EAAIC,CAAS,EAG3D,KAAK,SAASf,EAAK,MAAMa,CAAE,EAAG1K,EAAQ,MAAM2K,CAAE,EAAGb,CAAO,EAC1D,OAAA,KAAK,MAAM,wBAAyBY,EAAID,EAAIG,CAAS,EAE9C,GAIP,GACEA,IAAc,KACdA,IAAc,MACb,CAACzM,EAAQ,KAAOyM,EAAU,OAAO,CAAC,IAAM,IACzC,CACA,KAAK,MAAM,gBAAiBf,EAAMa,EAAI1K,EAAS2K,CAAE,EACjD,KACF,CAGA,KAAK,MAAM,0CAA0C,EACrDD,GAEJ,CAKA,MAAI,CAAA,EAAAZ,IAEF,KAAK,MAAM;wBAA4BD,EAAMa,EAAI1K,EAAS2K,CAAE,EACxDD,IAAOD,GAMf,CAKA,IAAII,EASJ,GARI,OAAO7M,GAAM,UACf6M,EAAM7E,IAAMhI,EACZ,KAAK,MAAM,eAAgBA,EAAGgI,EAAG6E,CAAG,IAEpCA,EAAM7M,EAAE,KAAKgI,CAAC,EACd,KAAK,MAAM,gBAAiBhI,EAAGgI,EAAG6E,CAAG,GAGnC,CAACA,EAAK,MAAO,EACnB,CAcA,GAAIN,IAAOE,GAAMD,IAAO9G,EAGtB,MAAO,GACF,GAAI6G,IAAOE,EAIhB,OAAOX,EACF,GAAIU,IAAO9G,EAKhB,OAAO6G,IAAOE,EAAK,GAAKZ,EAAKU,CAAE,IAAM,GAKrC,MAAM,IAAI,MAAM,MAAM,CAG1B,CAEA,aAAW,CACT,OAAOtC,GAAY,KAAK,QAAS,KAAK,OAAO,CAC/C,CAEA,MAAMjI,EAAe,CACnBD,GAAmBC,CAAO,EAE1B,IAAM7B,EAAU,KAAK,QAGrB,GAAI6B,IAAY,KAAM,OAAOyH,GAC7B,GAAIzH,IAAY,GAAI,MAAO,GAI3B,IAAIjE,EACA+O,EAA4C,MAC3C/O,EAAIiE,EAAQ,MAAMyG,EAAM,GAC3BqE,EAAW3M,EAAQ,IAAMwI,GAAcD,IAC7B3K,EAAIiE,EAAQ,MAAM8F,EAAY,GACxCgF,GACE3M,EAAQ,OACNA,EAAQ,IACNgI,GACAD,GACF/H,EAAQ,IAAM8H,GACdF,IAAgBhK,EAAE,CAAC,CAAC,GACdA,EAAIiE,EAAQ,MAAM4G,EAAQ,GACpCkE,GACE3M,EAAQ,OACNA,EAAQ,IACN8I,GACAJ,GACF1I,EAAQ,IAAMgJ,GACdC,IAAYrL,CAAC,GACPA,EAAIiE,EAAQ,MAAMoG,EAAa,GACzC0E,EAAW3M,EAAQ,IAAMmI,GAAqBD,IACpCtK,EAAIiE,EAAQ,MAAMuG,EAAS,KACrCuE,EAAWtE,IAGb,IAAMrC,EAAK5B,GAAI,SAASvC,EAAS,KAAK,OAAO,EAAE,YAAW,EAC1D,OAAI8K,GAAY,OAAO3G,GAAO,UAE5B,QAAQ,eAAeA,EAAI,OAAQ,CAAE,MAAO2G,CAAQ,CAAE,EAEjD3G,CACT,CAEA,QAAM,CACJ,GAAI,KAAK,QAAU,KAAK,SAAW,GAAO,OAAO,KAAK,OAQtD,IAAMsE,EAAM,KAAK,IAEjB,GAAI,CAACA,EAAI,OACP,OAAA,KAAK,OAAS,GACP,KAAK,OAEd,IAAMtK,EAAU,KAAK,QAEf4M,EACJ5M,EAAQ,WAAakE,GACnBlE,EAAQ,IAAMuJ,GACdC,GACEtD,EAAQ,IAAI,IAAIlG,EAAQ,OAAS,CAAC,GAAG,EAAI,CAAA,CAAE,EAQ7CgG,EAAKsE,EACN,IAAIzI,GAAU,CACb,IAAMuD,EAAmCvD,EAAQ,IAAIhC,GAAI,CACvD,GAAIA,aAAa,OACf,QAAWgI,KAAKhI,EAAE,MAAM,MAAM,EAAE,EAAGqG,EAAM,IAAI2B,CAAC,EAEhD,OACE,OAAOhI,GAAM,SAAWmE,GAAanE,CAAC,EACpCA,IAAMyJ,GAAWA,GACjBzJ,EAAE,IAER,CAAC,EACDuF,EAAG,QAAQ,CAACvF,EAAGzB,IAAK,CAClB,IAAM8M,EAAO9F,EAAGhH,EAAI,CAAC,EACf0M,EAAO1F,EAAGhH,EAAI,CAAC,EACjByB,IAAMyJ,IAAYwB,IAASxB,KAG3BwB,IAAS,OACPI,IAAS,QAAaA,IAAS5B,GACjClE,EAAGhH,EAAI,CAAC,EAAI,UAAYwO,EAAU,QAAU1B,EAE5C9F,EAAGhH,CAAC,EAAIwO,EAED1B,IAAS,OAClB9F,EAAGhH,EAAI,CAAC,EAAI0M,EAAO,aAAe8B,EAAU,KACnC1B,IAAS5B,KAClBlE,EAAGhH,EAAI,CAAC,EAAI0M,EAAO,aAAe8B,EAAU,OAAS1B,EACrD9F,EAAGhH,EAAI,CAAC,EAAIkL,IAEhB,CAAC,EACD,IAAMuD,EAAWzH,EAAG,OAAOvF,GAAKA,IAAMyJ,EAAQ,EAK9C,GAAI,KAAK,SAAWuD,EAAS,QAAU,EAAG,CACxC,IAAMC,EAAqB,CAAA,EAC3B,QAAS1O,EAAI,EAAGA,GAAKyO,EAAS,OAAQzO,IACpC0O,EAAS,KAAKD,EAAS,MAAM,EAAGzO,CAAC,EAAE,KAAK,GAAG,CAAC,EAE9C,MAAO,MAAQ0O,EAAS,KAAK,GAAG,EAAI,GACtC,CAEA,OAAOD,EAAS,KAAK,GAAG,CAC1B,CAAC,EACA,KAAK,GAAG,EAIL,CAACE,EAAM7F,CAAK,EAAIoD,EAAI,OAAS,EAAI,CAAC,MAAO,GAAG,EAAI,CAAC,GAAI,EAAE,EAG7DtE,EAAK,IAAM+G,EAAO/G,EAAKkB,EAAQ,IAG3B,KAAK,UACPlB,EAAK,WAAa+G,EAAO/G,EAAG,MAAM,EAAG,EAAE,EAAIkB,EAAQ,MAIjD,KAAK,SAAQlB,EAAK,OAASA,EAAK,QAEpC,GAAI,CACF,KAAK,OAAS,IAAI,OAAOA,EAAI,CAAC,GAAGE,CAAK,EAAE,KAAK,EAAE,CAAC,CAElD,MAAa,CAEX,KAAK,OAAS,EAChB,CAEA,OAAO,KAAK,MACd,CAEA,WAAWrG,EAAS,CAKlB,OAAI,KAAK,wBACAA,EAAE,MAAM,GAAG,EACT,KAAK,WAAa,cAAc,KAAKA,CAAC,EAExC,CAAC,GAAI,GAAGA,EAAE,MAAM,KAAK,CAAC,EAEtBA,EAAE,MAAM,KAAK,CAExB,CAEA,MAAMgI,EAAW8D,EAAU,KAAK,QAAO,CAIrC,GAHA,KAAK,MAAM,QAAS9D,EAAG,KAAK,OAAO,EAG/B,KAAK,QACP,MAAO,GAET,GAAI,KAAK,MACP,OAAOA,IAAM,GAGf,GAAIA,IAAM,KAAO8D,EACf,MAAO,GAGT,IAAM3L,EAAU,KAAK,QAGjB,KAAK,YACP6H,EAAIA,EAAE,MAAM,IAAI,EAAE,KAAK,GAAG,GAI5B,IAAMmF,EAAK,KAAK,WAAWnF,CAAC,EAC5B,KAAK,MAAM,KAAK,QAAS,QAASmF,CAAE,EAOpC,IAAM1C,EAAM,KAAK,IACjB,KAAK,MAAM,KAAK,QAAS,MAAOA,CAAG,EAGnC,IAAI2C,EAAmBD,EAAGA,EAAG,OAAS,CAAC,EACvC,GAAI,CAACC,EACH,QAAS7O,EAAI4O,EAAG,OAAS,EAAG,CAACC,GAAY7O,GAAK,EAAGA,IAC/C6O,EAAWD,EAAG5O,CAAC,EAInB,QAASA,EAAI,EAAGA,EAAIkM,EAAI,OAAQlM,IAAK,CACnC,IAAMyD,EAAUyI,EAAIlM,CAAC,EACjBsN,EAAOsB,EAKX,GAJIhN,EAAQ,WAAa6B,EAAQ,SAAW,IAC1C6J,EAAO,CAACuB,CAAQ,GAEN,KAAK,SAASvB,EAAM7J,EAAS8J,CAAO,EAE9C,OAAI3L,EAAQ,WACH,GAEF,CAAC,KAAK,MAEjB,CAIA,OAAIA,EAAQ,WACH,GAEF,KAAK,MACd,CAEA,OAAO,SAAS2J,EAAqB,CACnC,OAAOlC,GAAU,SAASkC,CAAG,EAAE,SACjC,CAAA,EAOFlC,GAAU,IAAMrD,GAChBqD,GAAU,UAAYC,GACtBD,GAAU,OAASD,GACnBC,GAAU,SAAWnE,GEvwCrB,IAAM4J,GAEF,OAAO,aAAgB,UACvB,aACA,OAAO,YAAY,KAAQ,WAE3B,YACA,KAEEC,GAAS,IAAI,IAMbC,GACJ,OAAO,SAAY,UAAc,QAC/B,QACA,CAAA,EAGEC,GAAc,CAClBC,EACArI,EACAsI,EACAC,IACE,CACF,OAAOJ,GAAQ,aAAgB,WAC7BA,GAAQ,YAAYE,EAAKrI,EAAMsI,EAAMC,CAAE,EACvC,QAAQ,MAAM,IAAID,CAAI,KAAKtI,CAAI,KAAKqI,CAAG,EAAE,CAC7C,EAEIG,GAAK,WAAW,gBAChBC,GAAK,WAAW,YAGpB,GAAI,OAAOD,GAAO,IAAa,CAE7BC,GAAK,KAAiB,CACpB,QACA,SAAqC,CAAA,EACrC,OACA,QAAmB,GACnB,iBAAiBnH,EAAWiH,EAAwB,CAClD,KAAK,SAAS,KAAKA,CAAE,CACvB,CAAA,EAGFC,GAAK,KAAqB,CACxB,aAAA,CACEE,EAAc,CAChB,CACA,OAAS,IAAID,GACb,MAAME,EAAW,CACf,GAAI,CAAA,KAAK,OAAO,QAEhB,CAAA,KAAK,OAAO,OAASA,EAErB,KAAK,OAAO,QAAU,GAEtB,QAAWJ,KAAM,KAAK,OAAO,SAC3BA,EAAGI,CAAM,EAEX,KAAK,OAAO,UAAUA,CAAM,CAAA,CAC9B,CAAA,EAEF,IAAIC,EACFT,GAAQ,KAAK,8BAAgC,IACzCO,EAAiB,IAAK,CACrBE,IACLA,EAAyB,GACzBR,GACE,maAOA,sBACA,UACAM,CAAc,EAElB,CACF,CAGA,IAAMG,GAAcP,GAAiB,CAACJ,GAAO,IAAII,CAAI,EAM/CQ,GAAY9M,GAChBA,GAAKA,IAAM,KAAK,MAAMA,CAAC,GAAKA,EAAI,GAAK,SAASA,CAAC,EAc3C+M,GAAgB/N,GACnB8N,GAAS9N,CAAG,EACXA,GAAO,KAAK,IAAI,EAAG,CAAC,EAAI,WACxBA,GAAO,KAAK,IAAI,EAAG,EAAE,EAAI,YACzBA,GAAO,KAAK,IAAI,EAAG,EAAE,EAAI,YACzBA,GAAO,OAAO,iBAAmBgO,GACjC,KALe,KAQbA,GAAN,cAAwB,KAAa,CACnC,YAAYC,EAAY,CACtB,MAAMA,CAAI,EACV,KAAK,KAAK,CAAC,CACb,CAAA,EAMIC,GAAN,MAAMC,EAAK,CACT,KACA,OAEA,MAAOC,GAAyB,GAChC,OAAO,OAAOpO,EAAW,CACvB,IAAMqO,EAAUN,GAAa/N,CAAG,EAChC,GAAI,CAACqO,EAAS,MAAO,CAAA,EACrBF,GAAMC,GAAgB,GACtB,IAAMrM,EAAI,IAAIoM,GAAMnO,EAAKqO,CAAO,EAChC,OAAAF,GAAMC,GAAgB,GACfrM,CACT,CACA,YAAY/B,EAAaqO,EAAyC,CAEhE,GAAI,CAACF,GAAMC,GACT,MAAM,IAAI,UAAU,yCAAyC,EAG/D,KAAK,KAAO,IAAIC,EAAQrO,CAAG,EAC3B,KAAK,OAAS,CAChB,CACA,KAAKgB,EAAQ,CACX,KAAK,KAAK,KAAK,QAAQ,EAAIA,CAC7B,CACA,KAAG,CACD,OAAO,KAAK,KAAK,EAAE,KAAK,MAAM,CAChC,CAAA,EAi+BWsN,GAAP,MAAOC,EAAQ,CAEVC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAKT,IAAI,MAAI,CACN,OAAO,KAAKA,EACd,CAKA,IAKA,cAIA,aAIA,eAIA,eAIA,WAKA,eAIA,YAIA,aAIA,gBAIA,yBAIA,mBAIA,uBAIA,2BAIA,iBAGAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAEAC,GACAC,GACAC,GACAC,GAWA,OAAO,sBAIL3O,EAAqB,CACrB,MAAO,CAEL,OAAQA,EAAEqO,GACV,KAAMrO,EAAEsO,GACR,gBAAiBtO,EAAEuO,GACnB,MAAOvO,EAAEoO,GACT,OAAQpO,EAAE2N,GACV,QAAS3N,EAAE4N,GACX,QAAS5N,EAAE6N,GACX,KAAM7N,EAAE8N,GACR,KAAM9N,EAAE+N,GACR,IAAI,MAAI,CACN,OAAO/N,EAAEgO,EACX,EACA,IAAI,MAAI,CACN,OAAOhO,EAAEiO,EACX,EACA,KAAMjO,EAAEkO,GAER,kBAAoB7P,GAAW2B,EAAE4O,GAAmBvQ,CAAC,EACrD,gBAAiB,CACfc,EACA0P,EACArQ,EACAsQ,IAEA9O,EAAE+O,GACA5P,EACA0P,EACArQ,EACAsQ,CAAO,EAEX,WAAaD,GAAwB7O,EAAEgP,GAAYH,CAAc,EACjE,QAAUrQ,GAAsCwB,EAAEiP,GAASzQ,CAAO,EAClE,SAAWA,GACTwB,EAAEkP,GAAU1Q,CAAO,EACrB,QAAUqQ,GAA8B7O,EAAEmP,GAASN,CAAc,CAAA,CAErE,CAOA,IAAI,KAAG,CACL,OAAO,KAAK5B,EACd,CAIA,IAAI,SAAO,CACT,OAAO,KAAKC,EACd,CAIA,IAAI,gBAAc,CAChB,OAAO,KAAKQ,EACd,CAIA,IAAI,MAAI,CACN,OAAO,KAAKD,EACd,CAIA,IAAI,aAAW,CACb,OAAO,KAAKH,EACd,CACA,IAAI,YAAU,CACZ,OAAO,KAAKC,EACd,CAIA,IAAI,SAAO,CACT,OAAO,KAAKJ,EACd,CAIA,IAAI,UAAQ,CACV,OAAO,KAAKC,EACd,CAIA,IAAI,cAAY,CACd,OAAO,KAAKC,EACd,CAEA,YAAY7O,EAAwD,CAClE,GAAM,CACJ,IAAAC,EAAM,EACN,IAAA2Q,EACA,cAAAC,EAAgB,EAChB,aAAAC,EACA,eAAAC,EACA,eAAAC,EACA,WAAAC,EACA,QAAAC,EACA,SAAAC,EACA,aAAAC,EACA,eAAAC,EACA,YAAAC,EACA,QAAAC,EAAU,EACV,aAAAC,EAAe,EACf,gBAAAC,EACA,YAAAC,EACA,WAAAC,EACA,yBAAAC,EACA,mBAAAC,EACA,2BAAAC,EACA,uBAAAC,EACA,iBAAAC,EACA,KAAAC,CAAI,EACFjS,EAEJ,GAAIiS,IAAS,QACP,OAAOA,GAAM,KAAQ,WACvB,MAAM,IAAI,UACR,mDAAmD,EAOzD,GAFA,KAAKjD,GAAQiD,GAAQ/E,GAEjBjN,IAAQ,GAAK,CAAC8N,GAAS9N,CAAG,EAC5B,MAAM,IAAI,UAAU,0CAA0C,EAGhE,IAAMiS,GAAYjS,EAAM+N,GAAa/N,CAAG,EAAI,MAC5C,GAAI,CAACiS,GACH,MAAM,IAAI,MAAM,sBAAwBjS,CAAG,EAO7C,GAJA,KAAKwO,GAAOxO,EACZ,KAAKyO,GAAW6C,EAChB,KAAK,aAAeC,GAAgB,KAAK9C,GACzC,KAAK,gBAAkB+C,EACnB,KAAK,gBAAiB,CACxB,GAAI,CAAC,KAAK/C,IAAY,CAAC,KAAK,aAC1B,MAAM,IAAI,UACR,oEAAoE,EAGxE,GAAI,OAAO,KAAK,iBAAoB,WAClC,MAAM,IAAI,UAAU,qCAAqC,CAE7D,CAEA,GAAIiD,IAAe,QAAa,OAAOA,GAAe,WACpD,MAAM,IAAI,UAAU,0CAA0C,EAIhE,GAFA,KAAK5C,GAAc4C,EAEfD,IAAgB,QAAa,OAAOA,GAAgB,WACtD,MAAM,IAAI,UAAU,6CAA6C,EAyCnE,GAvCA,KAAK5C,GAAe4C,EACpB,KAAKzB,GAAkB,CAAC,CAACyB,EAEzB,KAAKvC,GAAU,IAAI,IACnB,KAAKC,GAAW,IAAI,MAAMnP,CAAG,EAAE,KAAK,MAAS,EAC7C,KAAKoP,GAAW,IAAI,MAAMpP,CAAG,EAAE,KAAK,MAAS,EAC7C,KAAKqP,GAAQ,IAAI4C,GAAUjS,CAAG,EAC9B,KAAKsP,GAAQ,IAAI2C,GAAUjS,CAAG,EAC9B,KAAKuP,GAAQ,EACb,KAAKC,GAAQ,EACb,KAAKC,GAAQvB,GAAM,OAAOlO,CAAG,EAC7B,KAAKgP,GAAQ,EACb,KAAKC,GAAkB,EAEnB,OAAOgC,GAAY,aACrB,KAAKvC,GAAWuC,GAEd,OAAOC,GAAa,aACtB,KAAKvC,GAAYuC,GAEf,OAAOC,GAAiB,YAC1B,KAAKvC,GAAgBuC,EACrB,KAAKzB,GAAY,CAAA,IAEjB,KAAKd,GAAgB,OACrB,KAAKc,GAAY,QAEnB,KAAKK,GAAc,CAAC,CAAC,KAAKrB,GAC1B,KAAKwB,GAAe,CAAC,CAAC,KAAKvB,GAC3B,KAAKsB,GAAmB,CAAC,CAAC,KAAKrB,GAE/B,KAAK,eAAiB,CAAC,CAACwC,EACxB,KAAK,YAAc,CAAC,CAACC,EACrB,KAAK,yBAA2B,CAAC,CAACM,EAClC,KAAK,2BAA6B,CAAC,CAACE,EACpC,KAAK,uBAAyB,CAAC,CAACC,EAChC,KAAK,iBAAmB,CAAC,CAACC,EAGtB,KAAK,eAAiB,EAAG,CAC3B,GAAI,KAAKtD,KAAa,GAChB,CAACX,GAAS,KAAKW,EAAQ,EACzB,MAAM,IAAI,UACR,iDAAiD,EAIvD,GAAI,CAACX,GAAS,KAAK,YAAY,EAC7B,MAAM,IAAI,UACR,sDAAsD,EAG1D,KAAKoE,GAAuB,CAC9B,CAUA,GARA,KAAK,WAAa,CAAC,CAAClB,EACpB,KAAK,mBAAqB,CAAC,CAACY,EAC5B,KAAK,eAAiB,CAAC,CAACd,EACxB,KAAK,eAAiB,CAAC,CAACC,EACxB,KAAK,cACHjD,GAAS8C,CAAa,GAAKA,IAAkB,EAAIA,EAAgB,EACnE,KAAK,aAAe,CAAC,CAACC,EACtB,KAAK,IAAMF,GAAO,EACd,KAAK,IAAK,CACZ,GAAI,CAAC7C,GAAS,KAAK,GAAG,EACpB,MAAM,IAAI,UAAU,6CAA6C,EAEnE,KAAKqE,GAAsB,CAC7B,CAGA,GAAI,KAAK3D,KAAS,GAAK,KAAK,MAAQ,GAAK,KAAKC,KAAa,EACzD,MAAM,IAAI,UACR,kDAAkD,EAGtD,GAAI,CAAC,KAAK,cAAgB,CAAC,KAAKD,IAAQ,CAAC,KAAKC,GAAU,CACtD,IAAMnB,GAAO,sBACTO,GAAWP,EAAI,IACjBJ,GAAO,IAAII,EAAI,EAIfF,GAFE,gGAEe,wBAAyBE,GAAMiB,EAAQ,EAE5D,CACF,CAMA,gBAAgB6D,EAAM,CACpB,OAAO,KAAKlD,GAAQ,IAAIkD,CAAG,EAAI,IAAW,CAC5C,CAEAD,IAAsB,CACpB,IAAME,EAAO,IAAIrE,GAAU,KAAKQ,EAAI,EAC9B8D,EAAS,IAAItE,GAAU,KAAKQ,EAAI,EACtC,KAAKqB,GAAQwC,EACb,KAAKzC,GAAU0C,EACf,IAAMC,EACJ,KAAK,aACH,IAAI,MAAiD,KAAK/D,EAAI,EAC9D,OACJ,KAAKsB,GAAmByC,EAExB,KAAKC,GAAc,CAACpC,EAAOO,EAAKnK,EAAQ,KAAKuI,GAAM,IAAG,IAAM,CAU1D,GATAuD,EAAOlC,CAAK,EAAIO,IAAQ,EAAInK,EAAQ,EACpC6L,EAAKjC,CAAK,EAAIO,EAIV4B,IAAcnC,CAAK,IACrB,aAAamC,EAAYnC,CAAK,CAAC,EAC/BmC,EAAYnC,CAAK,EAAI,QAEnBO,IAAQ,GAAK4B,EAAa,CAC5B,IAAME,EAAI,WAAW,IAAK,CACpB,KAAK/B,GAASN,CAAK,GACrB,KAAKsC,GAAQ,KAAKvD,GAASiB,CAAK,EAAQ,QAAQ,CAEpD,EAAGO,EAAM,CAAC,EAGN8B,EAAE,OACJA,EAAE,MAAK,EAGTF,EAAYnC,CAAK,EAAIqC,CACvB,CACF,EAEA,KAAKE,GAAiBvC,GAAQ,CAC5BkC,EAAOlC,CAAK,EAAIiC,EAAKjC,CAAK,IAAM,EAAI,KAAKrB,GAAM,IAAG,EAAK,CACzD,EAEA,KAAK6D,GAAa,CAACC,EAAQzC,IAAS,CAClC,GAAIiC,EAAKjC,CAAK,EAAG,CACf,IAAMO,EAAM0B,EAAKjC,CAAK,EAChB5J,EAAQ8L,EAAOlC,CAAK,EAE1B,GAAI,CAACO,GAAO,CAACnK,EAAO,OACpBqM,EAAO,IAAMlC,EACbkC,EAAO,MAAQrM,EACfqM,EAAO,IAAMC,GAAaC,EAAM,EAChC,IAAMC,EAAMH,EAAO,IAAMrM,EACzBqM,EAAO,aAAelC,EAAMqC,CAC9B,CACF,EAIA,IAAIF,EAAY,EACVC,EAAS,IAAK,CAClB,IAAM/R,EAAI,KAAK+N,GAAM,IAAG,EACxB,GAAI,KAAK,cAAgB,EAAG,CAC1B+D,EAAY9R,EACZ,IAAMyR,EAAI,WAAW,IAAOK,EAAY,EAAI,KAAK,aAAa,EAG1DL,EAAE,OACJA,EAAE,MAAK,CAGX,CACA,OAAOzR,CACT,EAEA,KAAK,gBAAkBoR,GAAM,CAC3B,IAAMhC,EAAQ,KAAKlB,GAAQ,IAAIkD,CAAG,EAClC,GAAIhC,IAAU,OACZ,MAAO,GAET,IAAMO,EAAM0B,EAAKjC,CAAK,EAChB5J,EAAQ8L,EAAOlC,CAAK,EAC1B,GAAI,CAACO,GAAO,CAACnK,EACX,MAAO,KAET,IAAMwM,GAAOF,GAAaC,EAAM,GAAMvM,EACtC,OAAOmK,EAAMqC,CACf,EAEA,KAAKtC,GAAWN,GAAQ,CACtB,IAAMrO,EAAIuQ,EAAOlC,CAAK,EAChBqC,EAAIJ,EAAKjC,CAAK,EACpB,MAAO,CAAC,CAACqC,GAAK,CAAC,CAAC1Q,IAAM+Q,GAAaC,EAAM,GAAMhR,EAAI0Q,CACrD,CACF,CAGAE,GAAyC,IAAK,CAAE,EAChDC,GAAiE,IAAK,CAAE,EACxEJ,GAMY,IAAK,CAAE,EAGnB9B,GAAsC,IAAM,GAE5CwB,IAAuB,CACrB,IAAMe,EAAQ,IAAIjF,GAAU,KAAKQ,EAAI,EACrC,KAAKS,GAAkB,EACvB,KAAKU,GAASsD,EACd,KAAKC,GAAkB9C,GAAQ,CAC7B,KAAKnB,IAAmBgE,EAAM7C,CAAK,EACnC6C,EAAM7C,CAAK,EAAI,CACjB,EACA,KAAK+C,GAAe,CAACzS,EAAG0S,EAAGnF,EAAMuD,IAAmB,CAGlD,GAAI,KAAKrB,GAAmBiD,CAAC,EAC3B,MAAO,GAET,GAAI,CAACtF,GAASG,CAAI,EAChB,GAAIuD,EAAiB,CACnB,GAAI,OAAOA,GAAoB,WAC7B,MAAM,IAAI,UAAU,oCAAoC,EAG1D,GADAvD,EAAOuD,EAAgB4B,EAAG1S,CAAC,EACvB,CAACoN,GAASG,CAAI,EAChB,MAAM,IAAI,UACR,0DAA0D,CAGhE,KACE,OAAM,IAAI,UACR,2HAEwB,EAI9B,OAAOA,CACT,EACA,KAAKoF,GAAe,CAClBjD,EACAnC,EACA4E,IACE,CAEF,GADAI,EAAM7C,CAAK,EAAInC,EACX,KAAKQ,GAAU,CACjB,IAAM6C,EAAU,KAAK7C,GAAYwE,EAAM7C,CAAK,EAC5C,KAAO,KAAKnB,GAAkBqC,GAC5B,KAAKgC,GAAO,EAAI,CAEpB,CACA,KAAKrE,IAAmBgE,EAAM7C,CAAK,EAC/ByC,IACFA,EAAO,UAAY5E,EACnB4E,EAAO,oBAAsB,KAAK5D,GAEtC,CACF,CAEAiE,GAA0CK,GAAK,CAAE,EACjDF,GAIY,CAACE,EAAIC,EAAIC,IAAO,CAAE,EAC9BN,GAKqB,CACnBO,EACAC,EACA1F,EACAuD,IACE,CACF,GAAIvD,GAAQuD,EACV,MAAM,IAAI,UACR,kEAAkE,EAGtE,MAAO,EACT,EAEA,CAAChB,GAAS,CAAE,WAAAQ,EAAa,KAAK,UAAU,EAAK,CAAA,EAAE,CAC7C,GAAI,KAAKhC,GACP,QAAS7Q,EAAI,KAAKqR,GACZ,EAAA,CAAC,KAAKoE,GAAczV,CAAC,KAGrB6S,GAAc,CAAC,KAAKN,GAASvS,CAAC,KAChC,MAAMA,GAEJA,IAAM,KAAKoR,MAGbpR,EAAI,KAAKmR,GAAMnR,CAAC,CAIxB,CAEA,CAACsS,GAAU,CAAE,WAAAO,EAAa,KAAK,UAAU,EAAK,CAAA,EAAE,CAC9C,GAAI,KAAKhC,GACP,QAAS7Q,EAAI,KAAKoR,GACZ,EAAA,CAAC,KAAKqE,GAAczV,CAAC,KAGrB6S,GAAc,CAAC,KAAKN,GAASvS,CAAC,KAChC,MAAMA,GAEJA,IAAM,KAAKqR,MAGbrR,EAAI,KAAKkR,GAAMlR,CAAC,CAIxB,CAEAyV,GAAcxD,EAAY,CACxB,OACEA,IAAU,QACV,KAAKlB,GAAQ,IAAI,KAAKC,GAASiB,CAAK,CAAM,IAAMA,CAEpD,CAMA,CAAC,SAAO,CACN,QAAWjS,KAAK,KAAKqS,GAAQ,EAEzB,KAAKpB,GAASjR,CAAC,IAAM,QACrB,KAAKgR,GAAShR,CAAC,IAAM,QACrB,CAAC,KAAKgS,GAAmB,KAAKf,GAASjR,CAAC,CAAC,IAEzC,KAAM,CAAC,KAAKgR,GAAShR,CAAC,EAAG,KAAKiR,GAASjR,CAAC,CAAC,EAG/C,CAQA,CAAC,UAAQ,CACP,QAAWA,KAAK,KAAKsS,GAAS,EAE1B,KAAKrB,GAASjR,CAAC,IAAM,QACrB,KAAKgR,GAAShR,CAAC,IAAM,QACrB,CAAC,KAAKgS,GAAmB,KAAKf,GAASjR,CAAC,CAAC,IAEzC,KAAM,CAAC,KAAKgR,GAAShR,CAAC,EAAG,KAAKiR,GAASjR,CAAC,CAAC,EAG/C,CAMA,CAAC,MAAI,CACH,QAAWA,KAAK,KAAKqS,GAAQ,EAAI,CAC/B,IAAM9P,EAAI,KAAKyO,GAAShR,CAAC,EACrBuC,IAAM,QAAa,CAAC,KAAKyP,GAAmB,KAAKf,GAASjR,CAAC,CAAC,IAC9D,MAAMuC,EAEV,CACF,CAQA,CAAC,OAAK,CACJ,QAAWvC,KAAK,KAAKsS,GAAS,EAAI,CAChC,IAAM/P,EAAI,KAAKyO,GAAShR,CAAC,EACrBuC,IAAM,QAAa,CAAC,KAAKyP,GAAmB,KAAKf,GAASjR,CAAC,CAAC,IAC9D,MAAMuC,EAEV,CACF,CAMA,CAAC,QAAM,CACL,QAAWvC,KAAK,KAAKqS,GAAQ,EACjB,KAAKpB,GAASjR,CAAC,IACf,QAAa,CAAC,KAAKgS,GAAmB,KAAKf,GAASjR,CAAC,CAAC,IAC9D,MAAM,KAAKiR,GAASjR,CAAC,EAG3B,CAQA,CAAC,SAAO,CACN,QAAWA,KAAK,KAAKsS,GAAS,EAClB,KAAKrB,GAASjR,CAAC,IACf,QAAa,CAAC,KAAKgS,GAAmB,KAAKf,GAASjR,CAAC,CAAC,IAC9D,MAAM,KAAKiR,GAASjR,CAAC,EAG3B,CAMA,CAAC,OAAO,QAAQ,GAAC,CACf,OAAO,KAAK,QAAO,CACrB,CAOA,CAAC,OAAO,WAAW,EAAI,WAMvB,KACEoP,EACAsG,EAA4C,CAAA,EAAE,CAE9C,QAAW1V,KAAK,KAAKqS,GAAQ,EAAI,CAC/B,IAAM4C,EAAI,KAAKhE,GAASjR,CAAC,EACnB2V,EAAQ,KAAK3D,GAAmBiD,CAAC,EAAIA,EAAE,qBAAuBA,EACpE,GAAIU,IAAU,QACVvG,EAAGuG,EAAO,KAAK3E,GAAShR,CAAC,EAAQ,IAAI,EACvC,OAAO,KAAK,IAAI,KAAKgR,GAAShR,CAAC,EAAQ0V,CAAU,CAErD,CACF,CAaA,QACEtG,EACAwG,EAAa,KAAI,CAEjB,QAAW5V,KAAK,KAAKqS,GAAQ,EAAI,CAC/B,IAAM4C,EAAI,KAAKhE,GAASjR,CAAC,EACnB2V,EAAQ,KAAK3D,GAAmBiD,CAAC,EAAIA,EAAE,qBAAuBA,EAChEU,IAAU,QACdvG,EAAG,KAAKwG,EAAOD,EAAO,KAAK3E,GAAShR,CAAC,EAAQ,IAAI,CACnD,CACF,CAMA,SACEoP,EACAwG,EAAa,KAAI,CAEjB,QAAW5V,KAAK,KAAKsS,GAAS,EAAI,CAChC,IAAM2C,EAAI,KAAKhE,GAASjR,CAAC,EACnB2V,EAAQ,KAAK3D,GAAmBiD,CAAC,EAAIA,EAAE,qBAAuBA,EAChEU,IAAU,QACdvG,EAAG,KAAKwG,EAAOD,EAAO,KAAK3E,GAAShR,CAAC,EAAQ,IAAI,CACnD,CACF,CAMA,YAAU,CACR,IAAI6V,EAAU,GACd,QAAW7V,KAAK,KAAKsS,GAAU,CAAE,WAAY,EAAI,CAAE,EAC7C,KAAKC,GAASvS,CAAC,IACjB,KAAKuU,GAAQ,KAAKvD,GAAShR,CAAC,EAAQ,QAAQ,EAC5C6V,EAAU,IAGd,OAAOA,CACT,CAcA,KAAK5B,EAAM,CACT,IAAMjU,EAAI,KAAK+Q,GAAQ,IAAIkD,CAAG,EAC9B,GAAIjU,IAAM,OAAW,OACrB,IAAMiV,EAAI,KAAKhE,GAASjR,CAAC,EAGnB2V,EACJ,KAAK3D,GAAmBiD,CAAC,EAAIA,EAAE,qBAAuBA,EACxD,GAAIU,IAAU,OAAW,OAEzB,IAAMG,EAA2B,CAAE,MAAAH,CAAK,EACxC,GAAI,KAAKjE,IAAS,KAAKD,GAAS,CAC9B,IAAMe,EAAM,KAAKd,GAAM1R,CAAC,EAClBqI,EAAQ,KAAKoJ,GAAQzR,CAAC,EAC5B,GAAIwS,GAAOnK,EAAO,CAChB,IAAM0N,EAASvD,GAAO,KAAK5B,GAAM,IAAG,EAAKvI,GACzCyN,EAAM,IAAMC,EACZD,EAAM,MAAQ,KAAK,IAAG,CACxB,CACF,CACA,OAAI,KAAKtE,KACPsE,EAAM,KAAO,KAAKtE,GAAOxR,CAAC,GAErB8V,CACT,CAeA,MAAI,CACF,IAAME,EAAgC,CAAA,EACtC,QAAWhW,KAAK,KAAKqS,GAAS,CAAE,WAAY,EAAI,CAAE,EAAG,CACnD,IAAM4B,EAAM,KAAKjD,GAAShR,CAAC,EACrBiV,EAAI,KAAKhE,GAASjR,CAAC,EACnB2V,EACJ,KAAK3D,GAAmBiD,CAAC,EAAIA,EAAE,qBAAuBA,EACxD,GAAIU,IAAU,QAAa1B,IAAQ,OAAW,SAC9C,IAAM6B,EAA2B,CAAE,MAAAH,CAAK,EACxC,GAAI,KAAKjE,IAAS,KAAKD,GAAS,CAC9BqE,EAAM,IAAM,KAAKpE,GAAM1R,CAAC,EAGxB,IAAM6U,EAAM,KAAKjE,GAAM,IAAG,EAAM,KAAKa,GAAQzR,CAAC,EAC9C8V,EAAM,MAAQ,KAAK,MAAM,KAAK,IAAG,EAAKjB,CAAG,CAC3C,CACI,KAAKrD,KACPsE,EAAM,KAAO,KAAKtE,GAAOxR,CAAC,GAE5BgW,EAAI,QAAQ,CAAC/B,EAAK6B,CAAK,CAAC,CAC1B,CACA,OAAOE,CACT,CAWA,KAAKA,EAA6B,CAChC,KAAK,MAAK,EACV,OAAW,CAAC/B,EAAK6B,CAAK,IAAKE,EAAK,CAC9B,GAAIF,EAAM,MAAO,CAOf,IAAMjB,EAAM,KAAK,IAAG,EAAKiB,EAAM,MAC/BA,EAAM,MAAQ,KAAKlF,GAAM,IAAG,EAAKiE,CACnC,CACA,KAAK,IAAIZ,EAAK6B,EAAM,MAAOA,CAAK,CAClC,CACF,CAgCA,IACEvT,EACA0S,EACAgB,EAA4C,CAAA,EAAE,CAE9C,GAAIhB,IAAM,OACR,OAAA,KAAK,OAAO1S,CAAC,EACN,KAET,GAAM,CACJ,IAAAiQ,EAAM,KAAK,IACX,MAAAnK,EACA,eAAA4K,EAAiB,KAAK,eACtB,gBAAAI,EAAkB,KAAK,gBACvB,OAAAqB,CAAM,EACJuB,EACA,CAAE,YAAA/C,EAAc,KAAK,WAAW,EAAK+C,EAEnCnG,EAAO,KAAKkF,GAChBzS,EACA0S,EACAgB,EAAW,MAAQ,EACnB5C,CAAe,EAIjB,GAAI,KAAK,cAAgBvD,EAAO,KAAK,aACnC,OAAI4E,IACFA,EAAO,IAAM,OACbA,EAAO,qBAAuB,IAGhC,KAAKH,GAAQhS,EAAG,KAAK,EACd,KAET,IAAI0P,EAAQ,KAAKpB,KAAU,EAAI,OAAY,KAAKE,GAAQ,IAAIxO,CAAC,EAC7D,GAAI0P,IAAU,OAEZA,EACE,KAAKpB,KAAU,EAAI,KAAKQ,GACtB,KAAKC,GAAM,SAAW,EAAI,KAAKA,GAAM,IAAG,EACxC,KAAKT,KAAU,KAAKR,GAAO,KAAK8E,GAAO,EAAK,EAC5C,KAAKtE,GACT,KAAKG,GAASiB,CAAK,EAAI1P,EACvB,KAAK0O,GAASgB,CAAK,EAAIgD,EACvB,KAAKlE,GAAQ,IAAIxO,EAAG0P,CAAK,EACzB,KAAKf,GAAM,KAAKG,EAAK,EAAIY,EACzB,KAAKd,GAAMc,CAAK,EAAI,KAAKZ,GACzB,KAAKA,GAAQY,EACb,KAAKpB,KACL,KAAKqE,GAAajD,EAAOnC,EAAM4E,CAAM,EACjCA,IAAQA,EAAO,IAAM,OACzBxB,EAAc,GACV,KAAKnB,IACP,KAAKvB,KAAYyE,EAAQ1S,EAAG,KAAK,MAE9B,CAEL,KAAK6P,GAAYH,CAAK,EACtB,IAAMiE,EAAS,KAAKjF,GAASgB,CAAK,EAClC,GAAIgD,IAAMiB,EAAQ,CAChB,GAAI,KAAKrE,IAAmB,KAAKG,GAAmBkE,CAAM,EAAG,CAC3DA,EAAO,kBAAkB,MAAM,IAAI,MAAM,UAAU,CAAC,EACpD,GAAM,CAAE,qBAAsBtS,CAAC,EAAKsS,EAChCtS,IAAM,QAAa,CAACqP,IAClB,KAAKrB,IACP,KAAKrB,KAAW3M,EAAQrB,EAAG,KAAK,EAE9B,KAAKuP,IACP,KAAKP,IAAW,KAAK,CAAC3N,EAAQrB,EAAG,KAAK,CAAC,EAG7C,MAAY0Q,IACN,KAAKrB,IACP,KAAKrB,KAAW2F,EAAa3T,EAAG,KAAK,EAEnC,KAAKuP,IACP,KAAKP,IAAW,KAAK,CAAC2E,EAAa3T,EAAG,KAAK,CAAC,GAMhD,GAHA,KAAKwS,GAAgB9C,CAAK,EAC1B,KAAKiD,GAAajD,EAAOnC,EAAM4E,CAAM,EACrC,KAAKzD,GAASgB,CAAK,EAAIgD,EACnBP,EAAQ,CACVA,EAAO,IAAM,UACb,IAAMyB,EACJD,GAAU,KAAKlE,GAAmBkE,CAAM,EACtCA,EAAO,qBACPA,EACAC,IAAa,SAAWzB,EAAO,SAAWyB,EAChD,CACF,MAAWzB,IACTA,EAAO,IAAM,UAGX,KAAK3C,IACP,KAAK,WAAWkD,EAAQ1S,EAAG0S,IAAMiB,EAAS,SAAW,SAAS,CAElE,CAUA,GATI1D,IAAQ,GAAK,CAAC,KAAKd,IACrB,KAAKsC,GAAsB,EAEzB,KAAKtC,KACFwB,GACH,KAAKmB,GAAYpC,EAAOO,EAAKnK,CAAK,EAEhCqM,GAAQ,KAAKD,GAAWC,EAAQzC,CAAK,GAEvC,CAACgB,GAAkB,KAAKnB,IAAoB,KAAKP,GAAW,CAC9D,IAAM6E,EAAK,KAAK7E,GACZ8E,EACJ,KAAQA,EAAOD,GAAI,MAAK,GACtB,KAAK3F,KAAgB,GAAG4F,CAAI,CAEhC,CACA,OAAO,IACT,CAMA,KAAG,CACD,GAAI,CACF,KAAO,KAAKxF,IAAO,CACjB,IAAMyF,EAAM,KAAKrF,GAAS,KAAKG,EAAK,EAEpC,GADA,KAAK+D,GAAO,EAAI,EACZ,KAAKnD,GAAmBsE,CAAG,GAC7B,GAAIA,EAAI,qBACN,OAAOA,EAAI,6BAEJA,IAAQ,OACjB,OAAOA,CAEX,CACF,QAAA,CACE,GAAI,KAAKxE,IAAoB,KAAKP,GAAW,CAC3C,IAAM6E,EAAK,KAAK7E,GACZ8E,EACJ,KAAQA,EAAOD,GAAI,MAAK,GACtB,KAAK3F,KAAgB,GAAG4F,CAAI,CAEhC,CACF,CACF,CAEAlB,GAAOoB,EAAa,CAClB,IAAMC,EAAO,KAAKpF,GACZ7O,EAAI,KAAKyO,GAASwF,CAAI,EACtBvB,EAAI,KAAKhE,GAASuF,CAAI,EAC5B,OAAI,KAAK3E,IAAmB,KAAKG,GAAmBiD,CAAC,EACnDA,EAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC,GACrC,KAAKrD,IAAe,KAAKE,MAC9B,KAAKF,IACP,KAAKrB,KAAW0E,EAAG1S,EAAG,OAAO,EAE3B,KAAKuP,IACP,KAAKP,IAAW,KAAK,CAAC0D,EAAG1S,EAAG,OAAO,CAAC,GAGxC,KAAKwS,GAAgByB,CAAI,EACrB,KAAK7E,KAAmB6E,CAAI,IAC9B,aAAa,KAAK7E,GAAiB6E,CAAI,CAAC,EACxC,KAAK7E,GAAiB6E,CAAI,EAAI,QAG5BD,IACF,KAAKvF,GAASwF,CAAI,EAAI,OACtB,KAAKvF,GAASuF,CAAI,EAAI,OACtB,KAAKlF,GAAM,KAAKkF,CAAI,GAElB,KAAK3F,KAAU,GACjB,KAAKO,GAAQ,KAAKC,GAAQ,EAC1B,KAAKC,GAAM,OAAS,GAEpB,KAAKF,GAAQ,KAAKF,GAAMsF,CAAI,EAE9B,KAAKzF,GAAQ,OAAOxO,CAAC,EACrB,KAAKsO,KACE2F,CACT,CAkBA,IAAIjU,EAAMkU,EAA4C,CAAA,EAAE,CACtD,GAAM,CAAE,eAAA7D,EAAiB,KAAK,eAAgB,OAAA8B,CAAM,EAAK+B,EACnDxE,EAAQ,KAAKlB,GAAQ,IAAIxO,CAAC,EAChC,GAAI0P,IAAU,OAAW,CACvB,IAAMgD,EAAI,KAAKhE,GAASgB,CAAK,EAC7B,GACE,KAAKD,GAAmBiD,CAAC,GACzBA,EAAE,uBAAyB,OAE3B,MAAO,GAET,GAAK,KAAK1C,GAASN,CAAK,EASbyC,IACTA,EAAO,IAAM,QACb,KAAKD,GAAWC,EAAQzC,CAAK,OAV7B,QAAIW,GACF,KAAK4B,GAAevC,CAAK,EAEvByC,IACFA,EAAO,IAAM,MACb,KAAKD,GAAWC,EAAQzC,CAAK,GAExB,EAKX,MAAWyC,IACTA,EAAO,IAAM,QAEf,MAAO,EACT,CASA,KAAKnS,EAAMmU,EAA8C,CAAA,EAAE,CACzD,GAAM,CAAE,WAAA7D,EAAa,KAAK,UAAU,EAAK6D,EACnCzE,EAAQ,KAAKlB,GAAQ,IAAIxO,CAAC,EAChC,GAAI0P,IAAU,QAAc,CAACY,GAAc,KAAKN,GAASN,CAAK,EAC5D,OAEF,IAAMgD,EAAI,KAAKhE,GAASgB,CAAK,EAE7B,OAAO,KAAKD,GAAmBiD,CAAC,EAAIA,EAAE,qBAAuBA,CAC/D,CAEA9C,GACE5P,EACA0P,EACArQ,EACAsQ,EAAY,CAEZ,IAAM+C,EAAIhD,IAAU,OAAY,OAAY,KAAKhB,GAASgB,CAAK,EAC/D,GAAI,KAAKD,GAAmBiD,CAAC,EAC3B,OAAOA,EAGT,IAAM0B,EAAK,IAAItH,GACT,CAAE,OAAAuH,CAAM,EAAKhV,EAEnBgV,GAAQ,iBAAiB,QAAS,IAAMD,EAAG,MAAMC,EAAO,MAAM,EAAG,CAC/D,OAAQD,EAAG,MAAA,CACZ,EAED,IAAME,EAAY,CAChB,OAAQF,EAAG,OACX,QAAA/U,EACA,QAAAsQ,CAAAA,EAGI4E,EAAK,CAAC7B,EAAkB8B,EAAc,KAAwB,CAClE,GAAM,CAAE,QAAAC,CAAO,EAAKL,EAAG,OACjBM,EAAcrV,EAAQ,kBAAoBqT,IAAM,OAChDiC,EAAUtV,EAAQ,kBACtB,CAAC,EAAEA,EAAQ,wBAA0BqT,IAAM,QAU7C,GATIrT,EAAQ,SACNoV,GAAW,CAACD,GACdnV,EAAQ,OAAO,aAAe,GAC9BA,EAAQ,OAAO,WAAa+U,EAAG,OAAO,OAClCM,IAAarV,EAAQ,OAAO,kBAAoB,KAEpDA,EAAQ,OAAO,cAAgB,IAG/BoV,GAAW,CAACC,GAAe,CAACF,EAC9B,OAAOI,EAAUR,EAAG,OAAO,OAAQO,CAAO,EAG5C,IAAME,EAAK3V,EAIL4V,EAAK,KAAKpG,GAASgB,CAAc,EACvC,OAAIoF,IAAO5V,GAAMwV,GAAeF,GAAeM,IAAO,UAChDpC,IAAM,OACJmC,EAAG,uBAAyB,OAC9B,KAAKnG,GAASgB,CAAc,EAAImF,EAAG,qBAEnC,KAAK7C,GAAQhS,EAAG,OAAO,GAGrBX,EAAQ,SAAQA,EAAQ,OAAO,aAAe,IAClD,KAAK,IAAIW,EAAG0S,EAAG4B,EAAU,OAAO,IAG7B5B,CACT,EAEMqC,EAAMC,IACN3V,EAAQ,SACVA,EAAQ,OAAO,cAAgB,GAC/BA,EAAQ,OAAO,WAAa2V,GAGvBJ,EAAUI,EAAI,EAAK,GAGtBJ,EAAY,CAACI,EAASL,IAAmC,CAC7D,GAAM,CAAE,QAAAF,CAAO,EAAKL,EAAG,OACjBa,EAAoBR,GAAWpV,EAAQ,uBACvCiR,EACJ2E,GAAqB5V,EAAQ,2BACzB6V,EAAW5E,GAAcjR,EAAQ,yBACjCwV,EAAK3V,EAgBX,GAfI,KAAKwP,GAASgB,CAAc,IAAMxQ,IAGxB,CAACgW,GACX,CAACP,GAAWE,EAAG,uBAAyB,OAExC,KAAK7C,GAAQhS,EAAG,OAAO,EACbiV,IAKV,KAAKvG,GAASgB,CAAc,EAAImF,EAAG,uBAGnCvE,EACF,OAAIjR,EAAQ,QAAUwV,EAAG,uBAAyB,SAChDxV,EAAQ,OAAO,cAAgB,IAE1BwV,EAAG,qBACL,GAAIA,EAAG,aAAeA,EAC3B,MAAMG,CAEV,EAEMG,EAAQ,CACZC,EACAC,IACE,CACF,IAAMC,EAAM,KAAKnH,KAAenO,EAAG0S,EAAG4B,CAAS,EAC3CgB,GAAOA,aAAe,SACxBA,EAAI,KAAK5C,GAAK0C,EAAI1C,IAAM,OAAY,OAAYA,CAAC,EAAG2C,CAAG,EAKzDjB,EAAG,OAAO,iBAAiB,QAAS,IAAK,EACnC,CAAC/U,EAAQ,kBAAoBA,EAAQ,0BACvC+V,EAAI,MAAS,EAET/V,EAAQ,yBACV+V,EAAM1C,GAAK6B,EAAG7B,EAAG,EAAI,GAG3B,CAAC,CACH,EAEIrT,EAAQ,SAAQA,EAAQ,OAAO,gBAAkB,IACrD,IAAMH,EAAI,IAAI,QAAQiW,CAAK,EAAE,KAAKZ,EAAIQ,CAAE,EAClCF,EAAyB,OAAO,OAAO3V,EAAG,CAC9C,kBAAmBkV,EACnB,qBAAsB1B,EACtB,WAAY,MAAA,CACb,EAED,OAAIhD,IAAU,QAEZ,KAAK,IAAI1P,EAAG6U,EAAI,CAAE,GAAGP,EAAU,QAAS,OAAQ,MAAS,CAAE,EAC3D5E,EAAQ,KAAKlB,GAAQ,IAAIxO,CAAC,GAE1B,KAAK0O,GAASgB,CAAK,EAAImF,EAElBA,CACT,CAEApF,GAAmBvQ,EAAM,CACvB,GAAI,CAAC,KAAKoQ,GAAiB,MAAO,GAClC,IAAM7S,EAAIyC,EACV,MACE,CAAC,CAACzC,GACFA,aAAa,SACbA,EAAE,eAAe,sBAAsB,GACvCA,EAAE,6BAA6BqQ,EAEnC,CAyGA,MAAM,MACJ9M,EACAuV,EAAgD,CAAA,EAAE,CAElD,GAAM,CAEJ,WAAAjF,EAAa,KAAK,WAClB,eAAAF,EAAiB,KAAK,eACtB,mBAAAc,EAAqB,KAAK,mBAE1B,IAAAjB,EAAM,KAAK,IACX,eAAAS,EAAiB,KAAK,eACtB,KAAAnD,EAAO,EACP,gBAAAuD,EAAkB,KAAK,gBACvB,YAAAH,EAAc,KAAK,YAEnB,yBAAAM,EAA2B,KAAK,yBAChC,2BAAAE,EAA6B,KAAK,2BAClC,iBAAAE,EAAmB,KAAK,iBACxB,uBAAAD,EAAyB,KAAK,uBAC9B,QAAAzB,EACA,aAAA6F,EAAe,GACf,OAAArD,EACA,OAAAkC,CAAM,EACJkB,EAEJ,GAAI,CAAC,KAAKjG,GACR,OAAI6C,IAAQA,EAAO,MAAQ,OACpB,KAAK,IAAInS,EAAG,CACjB,WAAAsQ,EACA,eAAAF,EACA,mBAAAc,EACA,OAAAiB,CAAAA,CACD,EAGH,IAAM9S,EAAU,CACd,WAAAiR,EACA,eAAAF,EACA,mBAAAc,EACA,IAAAjB,EACA,eAAAS,EACA,KAAAnD,EACA,gBAAAuD,EACA,YAAAH,EACA,yBAAAM,EACA,2BAAAE,EACA,uBAAAC,EACA,iBAAAC,EACA,OAAAc,EACA,OAAAkC,CAAAA,EAGE3E,EAAQ,KAAKlB,GAAQ,IAAIxO,CAAC,EAC9B,GAAI0P,IAAU,OAAW,CACnByC,IAAQA,EAAO,MAAQ,QAC3B,IAAMjT,EAAI,KAAK0Q,GAAiB5P,EAAG0P,EAAOrQ,EAASsQ,CAAO,EAC1D,OAAQzQ,EAAE,WAAaA,CACzB,KAAO,CAEL,IAAMwT,EAAI,KAAKhE,GAASgB,CAAK,EAC7B,GAAI,KAAKD,GAAmBiD,CAAC,EAAG,CAC9B,IAAM+C,GAAQnF,GAAcoC,EAAE,uBAAyB,OACvD,OAAIP,IACFA,EAAO,MAAQ,WACXsD,KAAOtD,EAAO,cAAgB,KAE7BsD,GAAQ/C,EAAE,qBAAwBA,EAAE,WAAaA,CAC1D,CAIA,IAAMgD,EAAU,KAAK1F,GAASN,CAAK,EACnC,GAAI,CAAC8F,GAAgB,CAACE,EACpB,OAAIvD,IAAQA,EAAO,MAAQ,OAC3B,KAAKtC,GAAYH,CAAK,EAClBU,GACF,KAAK6B,GAAevC,CAAK,EAEvByC,GAAQ,KAAKD,GAAWC,EAAQzC,CAAK,EAClCgD,EAKT,IAAMxT,EAAI,KAAK0Q,GAAiB5P,EAAG0P,EAAOrQ,EAASsQ,CAAO,EAEpDgG,EADWzW,EAAE,uBAAyB,QACfoR,EAC7B,OAAI6B,IACFA,EAAO,MAAQuD,EAAU,QAAU,UAC/BC,GAAYD,IAASvD,EAAO,cAAgB,KAE3CwD,EAAWzW,EAAE,qBAAwBA,EAAE,WAAaA,CAC7D,CACF,CA8BA,MAAM,WACJc,EACAuV,EAAgD,CAAA,EAAE,CAElD,IAAM7C,EAAI,MAAM,KAAK,MACnB1S,EACAuV,CAE4C,EAE9C,GAAI7C,IAAM,OAAW,MAAM,IAAI,MAAM,4BAA4B,EACjE,OAAOA,CACT,CA+BA,KAAK1S,EAAM4V,EAA8C,CAAA,EAAE,CACzD,IAAM5E,EAAa,KAAK5C,GACxB,GAAI,CAAC4C,EACH,MAAM,IAAI,MAAM,uCAAuC,EAEzD,GAAM,CAAE,QAAArB,EAAS,aAAA6F,EAAc,GAAGnW,CAAO,EAAKuW,EACxClD,EAAI,KAAK,IAAI1S,EAAGX,CAAO,EAC7B,GAAI,CAACmW,GAAgB9C,IAAM,OAAW,OAAOA,EAC7C,IAAMmD,EAAK7E,EAAWhR,EAAG0S,EAAG,CAC1B,QAAArT,EACA,QAAAsQ,CAAAA,CACqC,EACvC,OAAA,KAAK,IAAI3P,EAAG6V,EAAIxW,CAAO,EAChBwW,CACT,CAQA,IAAI7V,EAAMmT,EAA4C,CAAA,EAAE,CACtD,GAAM,CACJ,WAAA7C,EAAa,KAAK,WAClB,eAAAF,EAAiB,KAAK,eACtB,mBAAAc,EAAqB,KAAK,mBAC1B,OAAAiB,CAAM,EACJgB,EACEzD,EAAQ,KAAKlB,GAAQ,IAAIxO,CAAC,EAChC,GAAI0P,IAAU,OAAW,CACvB,IAAM0D,EAAQ,KAAK1E,GAASgB,CAAK,EAC3BoG,EAAW,KAAKrG,GAAmB2D,CAAK,EAE9C,OADIjB,GAAQ,KAAKD,GAAWC,EAAQzC,CAAK,EACrC,KAAKM,GAASN,CAAK,GACjByC,IAAQA,EAAO,IAAM,SAEpB2D,GAQD3D,GACA7B,GACA8C,EAAM,uBAAyB,SAE/BjB,EAAO,cAAgB,IAElB7B,EAAa8C,EAAM,qBAAuB,SAb5ClC,GACH,KAAKc,GAAQhS,EAAG,QAAQ,EAEtBmS,GAAU7B,IAAY6B,EAAO,cAAgB,IAC1C7B,EAAa8C,EAAQ,UAY1BjB,IAAQA,EAAO,IAAM,OAMrB2D,EACK1C,EAAM,sBAEf,KAAKvD,GAAYH,CAAK,EAClBU,GACF,KAAK6B,GAAevC,CAAK,EAEpB0D,GAEX,MAAWjB,IACTA,EAAO,IAAM,OAEjB,CAEA4D,GAAS7W,EAAUoB,EAAQ,CACzB,KAAKsO,GAAMtO,CAAC,EAAIpB,EAChB,KAAKyP,GAAMzP,CAAC,EAAIoB,CAClB,CAEAuP,GAAYH,EAAY,CASlBA,IAAU,KAAKZ,KACbY,IAAU,KAAKb,GACjB,KAAKA,GAAQ,KAAKF,GAAMe,CAAK,EAE7B,KAAKqG,GACH,KAAKnH,GAAMc,CAAK,EAChB,KAAKf,GAAMe,CAAK,CAAU,EAG9B,KAAKqG,GAAS,KAAKjH,GAAOY,CAAK,EAC/B,KAAKZ,GAAQY,EAEjB,CAOA,OAAO1P,EAAI,CACT,OAAO,KAAKgS,GAAQhS,EAAG,QAAQ,CACjC,CAEAgS,GAAQhS,EAAMiN,EAA8B,CAC1C,IAAIqG,EAAU,GACd,GAAI,KAAKhF,KAAU,EAAG,CACpB,IAAMoB,EAAQ,KAAKlB,GAAQ,IAAIxO,CAAC,EAChC,GAAI0P,IAAU,OAMZ,GALI,KAAKN,KAAmBM,CAAK,IAC/B,aAAa,KAAKN,KAAmBM,CAAK,CAAC,EAC3C,KAAKN,GAAiBM,CAAK,EAAI,QAEjC4D,EAAU,GACN,KAAKhF,KAAU,EACjB,KAAK0H,GAAO/I,CAAM,MACb,CACL,KAAKuF,GAAgB9C,CAAK,EAC1B,IAAMgD,EAAI,KAAKhE,GAASgB,CAAK,EAc7B,GAbI,KAAKD,GAAmBiD,CAAC,EAC3BA,EAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC,GACrC,KAAKrD,IAAe,KAAKE,MAC9B,KAAKF,IACP,KAAKrB,KAAW0E,EAAQ1S,EAAGiN,CAAM,EAE/B,KAAKsC,IACP,KAAKP,IAAW,KAAK,CAAC0D,EAAQ1S,EAAGiN,CAAM,CAAC,GAG5C,KAAKuB,GAAQ,OAAOxO,CAAC,EACrB,KAAKyO,GAASiB,CAAK,EAAI,OACvB,KAAKhB,GAASgB,CAAK,EAAI,OACnBA,IAAU,KAAKZ,GACjB,KAAKA,GAAQ,KAAKF,GAAMc,CAAK,UACpBA,IAAU,KAAKb,GACxB,KAAKA,GAAQ,KAAKF,GAAMe,CAAK,MACxB,CACL,IAAMhE,EAAK,KAAKkD,GAAMc,CAAK,EAC3B,KAAKf,GAAMjD,CAAE,EAAI,KAAKiD,GAAMe,CAAK,EACjC,IAAMuG,EAAK,KAAKtH,GAAMe,CAAK,EAC3B,KAAKd,GAAMqH,CAAE,EAAI,KAAKrH,GAAMc,CAAK,CACnC,CACA,KAAKpB,KACL,KAAKS,GAAM,KAAKW,CAAK,CACvB,CAEJ,CACA,GAAI,KAAKH,IAAoB,KAAKP,IAAW,OAAQ,CACnD,IAAM6E,EAAK,KAAK7E,GACZ8E,EACJ,KAAQA,EAAOD,GAAI,MAAK,GACtB,KAAK3F,KAAgB,GAAG4F,CAAI,CAEhC,CACA,OAAOR,CACT,CAKA,OAAK,CACH,OAAO,KAAK0C,GAAO,QAAQ,CAC7B,CACAA,GAAO/I,EAA8B,CACnC,QAAWyC,KAAS,KAAKK,GAAU,CAAE,WAAY,EAAI,CAAE,EAAG,CACxD,IAAM2C,EAAI,KAAKhE,GAASgB,CAAK,EAC7B,GAAI,KAAKD,GAAmBiD,CAAC,EAC3BA,EAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC,MACzC,CACL,IAAM1S,EAAI,KAAKyO,GAASiB,CAAK,EACzB,KAAKL,IACP,KAAKrB,KAAW0E,EAAQ1S,EAAQiN,CAAM,EAEpC,KAAKsC,IACP,KAAKP,IAAW,KAAK,CAAC0D,EAAQ1S,EAAQiN,CAAM,CAAC,CAEjD,CACF,CAKA,GAHA,KAAKuB,GAAQ,MAAK,EAClB,KAAKE,GAAS,KAAK,MAAS,EAC5B,KAAKD,GAAS,KAAK,MAAS,EACxB,KAAKU,IAAS,KAAKD,GAAS,CAC9B,KAAKC,GAAM,KAAK,CAAC,EACjB,KAAKD,GAAQ,KAAK,CAAC,EACnB,QAAW6C,KAAK,KAAK3C,IAAoB,CAAA,EACnC2C,IAAM,QAAW,aAAaA,CAAC,EAErC,KAAK3C,IAAkB,KAAK,MAAS,CACvC,CASA,GARI,KAAKH,IACP,KAAKA,GAAO,KAAK,CAAC,EAEpB,KAAKJ,GAAQ,EACb,KAAKC,GAAQ,EACb,KAAKC,GAAM,OAAS,EACpB,KAAKR,GAAkB,EACvB,KAAKD,GAAQ,EACT,KAAKiB,IAAoB,KAAKP,GAAW,CAC3C,IAAM6E,EAAK,KAAK7E,GACZ8E,EACJ,KAAQA,EAAOD,GAAI,MAAK,GACtB,KAAK3F,KAAgB,GAAG4F,CAAI,CAEhC,CACF,CAAA,EEz4FIoC,GACJ,OAAO,SAAY,UAAY,QAC3B,QACA,CACE,OAAQ,KACR,OAAQ,IAAA,EAiBHC,GACX9U,GAEA,CAAC,CAACA,GACF,OAAOA,GAAM,WACZA,aAAa+U,IACZ/U,aAAahF,IACbga,GAAWhV,CAAC,GACZiV,GAAWjV,CAAC,GAKHgV,GAAchV,GACzB,CAAC,CAACA,GACF,OAAOA,GAAM,UACbA,aAAajF,IACb,OAAQiF,EAAwB,MAAS,YAExCA,EAAwB,OAAShF,GAAO,SAAS,UAAU,KAKjDia,GAAcjV,GACzB,CAAC,CAACA,GACF,OAAOA,GAAM,UACbA,aAAajF,IACb,OAAQiF,EAAwB,OAAU,YAC1C,OAAQA,EAAwB,KAAQ,WAEpCkV,GAAM,OAAO,KAAK,EAClBC,GAAiB,OAAO,cAAc,EACtCC,GAAc,OAAO,YAAY,EACjCC,GAAe,OAAO,aAAa,EACnCC,GAAgB,OAAO,cAAc,EACrCC,GAAS,OAAO,QAAQ,EACxBC,GAAO,OAAO,MAAM,EACpBC,GAAQ,OAAO,OAAO,EACtBC,GAAa,OAAO,YAAY,EAChCC,GAAW,OAAO,UAAU,EAC5BC,GAAU,OAAO,SAAS,EAC1BC,EAAU,OAAO,SAAS,EAC1BC,GAAS,OAAO,QAAQ,EACxBC,GAAS,OAAO,QAAQ,EACxBC,EAAS,OAAO,QAAQ,EACxBC,GAAQ,OAAO,OAAO,EACtBC,EAAe,OAAO,cAAc,EACpCC,GAAa,OAAO,YAAY,EAChCC,GAAc,OAAO,aAAa,EAClCC,EAAa,OAAO,YAAY,EAEhCC,EAAY,OAAO,WAAW,EAE9BC,GAAQ,OAAO,OAAO,EACtBC,GAAW,OAAO,UAAU,EAC5BC,GAAU,OAAO,SAAS,EAC1BC,GAAW,OAAO,UAAU,EAC5BC,GAAQ,OAAO,OAAO,EACtBC,GAAQ,OAAO,OAAO,EACtBC,GAAU,OAAO,SAAS,EAC1BC,GAAS,OAAO,QAAQ,EACxBC,GAAgB,OAAO,eAAe,EACtCC,GAAY,OAAO,WAAW,EAE9BC,GAASzL,GAA6B,QAAQ,QAAO,EAAG,KAAKA,CAAE,EAC/D0L,GAAW1L,GAA6BA,EAAE,EAM1C2L,GAAYC,GAChBA,IAAO,OAASA,IAAO,UAAYA,IAAO,YAEtCC,GAAqBjc,GACzBA,aAAa,aACZ,CAAC,CAACA,GACD,OAAOA,GAAM,UACbA,EAAE,aACFA,EAAE,YAAY,OAAS,eACvBA,EAAE,YAAc,EAEdkc,GAAqBlc,GACzB,CAAC,OAAO,SAASA,CAAC,GAAK,YAAY,OAAOA,CAAC,EAqBvCmc,GAAN,KAAU,CACR,IACA,KACA,KACA,QACA,YACEjT,EACAkT,EACAC,EAAiB,CAEjB,KAAK,IAAMnT,EACX,KAAK,KAAOkT,EACZ,KAAK,KAAOC,EACZ,KAAK,QAAU,IAAMnT,EAAIyR,EAAM,EAAC,EAChC,KAAK,KAAK,GAAG,QAAS,KAAK,OAAO,CACpC,CACA,QAAM,CACJ,KAAK,KAAK,eAAe,QAAS,KAAK,OAAO,CAChD,CAGA,YAAY2B,EAAQ,CAAG,CAEvB,KAAG,CACD,KAAK,OAAM,EACP,KAAK,KAAK,KAAK,KAAK,KAAK,IAAG,CAClC,CAAA,EASIC,GAAN,cAAiCJ,EAAO,CACtC,QAAM,CACJ,KAAK,IAAI,eAAe,QAAS,KAAK,WAAW,EACjD,MAAM,OAAM,CACd,CACA,YACEjT,EACAkT,EACAC,EAAiB,CAEjB,MAAMnT,EAAKkT,EAAMC,CAAI,EACrB,KAAK,YAAc9D,GAAM6D,EAAK,KAAK,QAAS7D,CAAE,EAC9CrP,EAAI,GAAG,QAAS,KAAK,WAAW,CAClC,CAAA,EA8IIsT,GACJC,GACoC,CAAC,CAACA,EAAE,WAEpCC,GACJD,GAEA,CAACA,EAAE,YAAc,CAAC,CAACA,EAAE,UAAYA,EAAE,WAAa,SAarC9C,GAAP,cAOIha,EAAY,CAGpB,CAAC8a,CAAO,EAAa,GACrB,CAACC,EAAM,EAAa,GACpB,CAACG,EAAK,EAAmB,CAAA,EACzB,CAACD,CAAM,EAAa,CAAA,EACpB,CAACK,CAAU,EACX,CAACV,EAAQ,EACT,CAACgB,EAAK,EACN,CAACf,EAAO,EACR,CAACV,EAAG,EAAa,GACjB,CAACE,EAAW,EAAa,GACzB,CAACC,EAAY,EAAa,GAC1B,CAACE,EAAM,EAAa,GACpB,CAACD,EAAa,EAAa,KAC3B,CAACY,CAAY,EAAY,EACzB,CAACI,CAAS,EAAa,GACvB,CAACQ,EAAM,EACP,CAACD,EAAO,EAAa,GACrB,CAACE,EAAa,EAAY,EAC1B,CAACC,EAAS,EAAa,GAKvB,SAAoB,GAIpB,SAAoB,GAQpB,eACK5O,EAI+B,CAElC,IAAMpK,EAAoCoK,EAAK,CAAC,GAC9C,CAAA,EAEF,GADA,MAAK,EACDpK,EAAQ,YAAc,OAAOA,EAAQ,UAAa,SACpD,MAAM,IAAI,UACR,kDAAkD,EAGlD4Z,GAAoB5Z,CAAO,GAC7B,KAAKqY,CAAU,EAAI,GACnB,KAAKV,EAAQ,EAAI,MACRmC,GAAkB9Z,CAAO,GAClC,KAAK2X,EAAQ,EAAI3X,EAAQ,SACzB,KAAKqY,CAAU,EAAI,KAEnB,KAAKA,CAAU,EAAI,GACnB,KAAKV,EAAQ,EAAI,MAEnB,KAAKgB,EAAK,EAAI,CAAC,CAAC3Y,EAAQ,MACxB,KAAK4X,EAAO,EAAI,KAAKD,EAAQ,EACxB,IAAI1a,GAAc,KAAK0a,EAAQ,CAAC,EACjC,KAGA3X,GAAWA,EAAQ,oBAAsB,IAC3C,OAAO,eAAe,KAAM,SAAU,CAAE,IAAK,IAAM,KAAKgY,CAAM,CAAC,CAAE,EAG/DhY,GAAWA,EAAQ,mBAAqB,IAC1C,OAAO,eAAe,KAAM,QAAS,CAAE,IAAK,IAAM,KAAKiY,EAAK,CAAC,CAAE,EAGjE,GAAM,CAAE,OAAAjD,CAAM,EAAKhV,EACfgV,IACF,KAAK8D,EAAM,EAAI9D,EACXA,EAAO,QACT,KAAK4D,EAAK,EAAC,EAEX5D,EAAO,iBAAiB,QAAS,IAAM,KAAK4D,EAAK,EAAC,CAAE,EAG1D,CAWA,IAAI,cAAY,CACd,OAAO,KAAKV,CAAY,CAC1B,CAKA,IAAI,UAAQ,CACV,OAAO,KAAKP,EAAQ,CACtB,CAKA,IAAI,SAASoC,EAAI,CACf,MAAM,IAAI,MAAM,4CAA4C,CAC9D,CAKA,YAAYA,EAAuB,CACjC,MAAM,IAAI,MAAM,4CAA4C,CAC9D,CAKA,IAAI,YAAU,CACZ,OAAO,KAAK1B,CAAU,CACxB,CAKA,IAAI,WAAW2B,EAAG,CAChB,MAAM,IAAI,MAAM,8CAA8C,CAChE,CAKA,IAAK,OAAQ,CACX,OAAO,KAAKrB,EAAK,CACnB,CAQA,IAAK,MAASxb,EAAU,CACtB,KAAKwb,EAAK,EAAI,KAAKA,EAAK,GAAK,CAAC,CAACxb,CACjC,CAGA,CAACyb,EAAK,GAAC,CACL,KAAKC,EAAO,EAAI,GAChB,KAAK,KAAK,QAAS,KAAKC,EAAM,GAAG,MAAM,EACvC,KAAK,QAAQ,KAAKA,EAAM,GAAG,MAAM,CACnC,CAKA,IAAI,SAAO,CACT,OAAO,KAAKD,EAAO,CACrB,CAKA,IAAI,QAAQtS,EAAC,CAAG,CA0BhB,MACE0T,EACAC,EACAhF,EAAe,CAEf,GAAI,KAAK2D,EAAO,EAAG,MAAO,GAC1B,GAAI,KAAK3B,EAAG,EAAG,MAAM,IAAI,MAAM,iBAAiB,EAEhD,GAAI,KAAKoB,CAAS,EAChB,OAAA,KAAK,KACH,QACA,OAAO,OACL,IAAI,MAAM,gDAAgD,EAC1D,CAAE,KAAM,sBAAsB,CAAE,CACjC,EAEI,GAGL,OAAO4B,GAAa,aACtBhF,EAAKgF,EACLA,EAAW,QAGRA,IAAUA,EAAW,QAE1B,IAAM1M,EAAK,KAAKmL,EAAK,EAAIM,GAAQC,GAMjC,GAAI,CAAC,KAAKb,CAAU,GAAK,CAAC,OAAO,SAAS4B,CAAK,GAC7C,GAAIX,GAAkBW,CAAK,EAEzBA,EAAQ,OAAO,KACbA,EAAM,OACNA,EAAM,WACNA,EAAM,UAAU,UAETZ,GAAkBY,CAAK,EAEhCA,EAAQ,OAAO,KAAKA,CAAK,UAChB,OAAOA,GAAU,SAC1B,MAAM,IAAI,MACR,sDAAsD,EAO5D,OAAI,KAAK5B,CAAU,GAGb,KAAKR,CAAO,GAAK,KAAKK,CAAY,IAAM,GAAG,KAAKT,EAAK,EAAE,EAAI,EAG3D,KAAKI,CAAO,EAAG,KAAK,KAAK,OAAQoC,CAAyB,EACzD,KAAK9B,EAAU,EAAE8B,CAAyB,EAE3C,KAAK/B,CAAY,IAAM,GAAG,KAAK,KAAK,UAAU,EAE9ChD,GAAI1H,EAAG0H,CAAE,EAEN,KAAK2C,CAAO,GAKfoC,EAAkC,QAStC,OAAOA,GAAU,UAEjB,EAAEC,IAAa,KAAKvC,EAAQ,GAAK,CAAC,KAAKC,EAAO,GAAG,YAGjDqC,EAAQ,OAAO,KAAKA,EAAOC,CAAQ,GAGjC,OAAO,SAASD,CAAK,GAAK,KAAKtC,EAAQ,IAEzCsC,EAAQ,KAAKrC,EAAO,EAAE,MAAMqC,CAAK,GAI/B,KAAKpC,CAAO,GAAK,KAAKK,CAAY,IAAM,GAAG,KAAKT,EAAK,EAAE,EAAI,EAE3D,KAAKI,CAAO,EAAG,KAAK,KAAK,OAAQoC,CAAyB,EACzD,KAAK9B,EAAU,EAAE8B,CAAyB,EAE3C,KAAK/B,CAAY,IAAM,GAAG,KAAK,KAAK,UAAU,EAE9ChD,GAAI1H,EAAG0H,CAAE,EAEN,KAAK2C,CAAO,IA/Bb,KAAKK,CAAY,IAAM,GAAG,KAAK,KAAK,UAAU,EAC9ChD,GAAI1H,EAAG0H,CAAE,EACN,KAAK2C,CAAO,EA8BvB,CAeA,KAAK5W,EAAiB,CACpB,GAAI,KAAKqX,CAAS,EAAG,OAAO,KAG5B,GAFA,KAAKU,EAAS,EAAI,GAGhB,KAAKd,CAAY,IAAM,GACvBjX,IAAM,GACLA,GAAKA,EAAI,KAAKiX,CAAY,EAE3B,OAAA,KAAKf,EAAc,EAAC,EACb,KAGL,KAAKkB,CAAU,IAAGpX,EAAI,MAEtB,KAAK+W,CAAM,EAAE,OAAS,GAAK,CAAC,KAAKK,CAAU,IAG7C,KAAKL,CAAM,EAAI,CACZ,KAAKL,EAAQ,EACV,KAAKK,CAAM,EAAE,KAAK,EAAE,EACpB,OAAO,OACL,KAAKA,CAAM,EACX,KAAKE,CAAY,CAAC,CAAA,GAK5B,IAAM5S,EAAM,KAAKkS,EAAI,EAAEvW,GAAK,KAAM,KAAK+W,CAAM,EAAE,CAAC,CAAU,EAC1D,OAAA,KAAKb,EAAc,EAAC,EACb7R,CACT,CAEA,CAACkS,EAAI,EAAEvW,EAAkBgZ,EAAY,CACnC,GAAI,KAAK5B,CAAU,EAAG,KAAKD,EAAW,EAAC,MAClC,CACH,IAAM5W,EAAIyY,EACNhZ,IAAMO,EAAE,QAAUP,IAAM,KAAM,KAAKmX,EAAW,EAAC,EAC1C,OAAO5W,GAAM,UACpB,KAAKwW,CAAM,EAAE,CAAC,EAAIxW,EAAE,MAAMP,CAAC,EAC3BgZ,EAAQzY,EAAE,MAAM,EAAGP,CAAC,EACpB,KAAKiX,CAAY,GAAKjX,IAEtB,KAAK+W,CAAM,EAAE,CAAC,EAAIxW,EAAE,SAASP,CAAC,EAC9BgZ,EAAQzY,EAAE,SAAS,EAAGP,CAAC,EACvB,KAAKiX,CAAY,GAAKjX,EAE1B,CAEA,OAAA,KAAK,KAAK,OAAQgZ,CAAK,EAEnB,CAAC,KAAKjC,CAAM,EAAE,QAAU,CAAC,KAAKd,EAAG,GAAG,KAAK,KAAK,OAAO,EAElD+C,CACT,CAUA,IACEA,EACAC,EACAhF,EAAe,CAEf,OAAI,OAAO+E,GAAU,aACnB/E,EAAK+E,EACLA,EAAQ,QAEN,OAAOC,GAAa,aACtBhF,EAAKgF,EACLA,EAAW,QAETD,IAAU,QAAW,KAAK,MAAMA,EAAOC,CAAQ,EAC/ChF,GAAI,KAAK,KAAK,MAAOA,CAAE,EAC3B,KAAKgC,EAAG,EAAI,GACZ,KAAK,SAAW,IAMZ,KAAKW,CAAO,GAAK,CAAC,KAAKC,EAAM,IAAG,KAAKX,EAAc,EAAC,EACjD,IACT,CAGA,CAACY,EAAM,GAAC,CACF,KAAKO,CAAS,IAEd,CAAC,KAAKS,EAAa,GAAK,CAAC,KAAKd,EAAK,EAAE,SACvC,KAAKe,EAAS,EAAI,IAEpB,KAAKlB,EAAM,EAAI,GACf,KAAKD,CAAO,EAAI,GAChB,KAAK,KAAK,QAAQ,EACd,KAAKG,CAAM,EAAE,OAAQ,KAAKP,EAAK,EAAC,EAC3B,KAAKP,EAAG,EAAG,KAAKC,EAAc,EAAC,EACnC,KAAK,KAAK,OAAO,EACxB,CAWA,QAAM,CACJ,OAAO,KAAKY,EAAM,EAAC,CACrB,CAKA,OAAK,CACH,KAAKF,CAAO,EAAI,GAChB,KAAKC,EAAM,EAAI,GACf,KAAKkB,EAAS,EAAI,EACpB,CAKA,IAAI,WAAS,CACX,OAAO,KAAKV,CAAS,CACvB,CAMA,IAAI,SAAO,CACT,OAAO,KAAKT,CAAO,CACrB,CAKA,IAAI,QAAM,CACR,OAAO,KAAKC,EAAM,CACpB,CAEA,CAACK,EAAU,EAAE8B,EAAY,CACnB,KAAK5B,CAAU,EAAG,KAAKH,CAAY,GAAK,EACvC,KAAKA,CAAY,GAAM+B,EAAkC,OAC9D,KAAKjC,CAAM,EAAE,KAAKiC,CAAK,CACzB,CAEA,CAAC7B,EAAW,GAAC,CACX,OAAI,KAAKC,CAAU,EAAG,KAAKH,CAAY,GAAK,EAE1C,KAAKA,CAAY,GACf,KAAKF,CAAM,EAAE,CAAC,EACd,OACG,KAAKA,CAAM,EAAE,MAAK,CAC3B,CAEA,CAACP,EAAK,EAAE0C,EAAmB,GAAK,CAC9B,EAAG,OACD,KAAKzC,EAAU,EAAE,KAAKU,EAAW,EAAC,CAAE,GACpC,KAAKJ,CAAM,EAAE,QAGX,CAACmC,GAAW,CAAC,KAAKnC,CAAM,EAAE,QAAU,CAAC,KAAKd,EAAG,GAAG,KAAK,KAAK,OAAO,CACvE,CAEA,CAACQ,EAAU,EAAEuC,EAAY,CACvB,OAAA,KAAK,KAAK,OAAQA,CAAK,EAChB,KAAKpC,CAAO,CACrB,CAOA,KAAkC2B,EAASC,EAAkB,CAC3D,GAAI,KAAKnB,CAAS,EAAG,OAAOkB,EAC5B,KAAKR,EAAS,EAAI,GAElB,IAAMoB,EAAQ,KAAKhD,EAAW,EAC9B,OAAAqC,EAAOA,GAAQ,CAAA,EACXD,IAAS3C,GAAK,QAAU2C,IAAS3C,GAAK,OAAQ4C,EAAK,IAAM,GACxDA,EAAK,IAAMA,EAAK,MAAQ,GAC7BA,EAAK,YAAc,CAAC,CAACA,EAAK,YAGtBW,EACEX,EAAK,KAAKD,EAAK,IAAG,GAItB,KAAKvB,EAAK,EAAE,KACTwB,EAAK,YAEF,IAAIE,GAAuB,KAAyBH,EAAMC,CAAI,EAD9D,IAAIF,GAAY,KAAyBC,EAAMC,CAAI,CACY,EAEjE,KAAKd,EAAK,EAAGM,GAAM,IAAM,KAAKlB,EAAM,EAAC,CAAE,EACtC,KAAKA,EAAM,EAAC,GAGZyB,CACT,CAUA,OAAoCA,EAAO,CACzC,IAAM3Z,EAAI,KAAKoY,EAAK,EAAE,KAAKpY,GAAKA,EAAE,OAAS2Z,CAAI,EAC3C3Z,IACE,KAAKoY,EAAK,EAAE,SAAW,GACrB,KAAKJ,CAAO,GAAK,KAAKkB,EAAa,IAAM,IAC3C,KAAKlB,CAAO,EAAI,IAElB,KAAKI,EAAK,EAAI,CAAA,GACT,KAAKA,EAAK,EAAE,OAAO,KAAKA,EAAK,EAAE,QAAQpY,CAAC,EAAG,CAAC,EACnDA,EAAE,OAAM,EAEZ,CAKA,YACEuZ,EACAiB,EAAwC,CAExC,OAAO,KAAK,GAAGjB,EAAIiB,CAAO,CAC5B,CAmBA,GACEjB,EACAiB,EAAwC,CAExC,IAAM/U,EAAM,MAAM,GAChB8T,EACAiB,CAA+B,EAEjC,GAAIjB,IAAO,OACT,KAAKJ,EAAS,EAAI,GAClB,KAAKD,EAAa,IACd,CAAC,KAAKd,EAAK,EAAE,QAAU,CAAC,KAAKJ,CAAO,GACtC,KAAKE,EAAM,EAAC,UAELqB,IAAO,YAAc,KAAKlB,CAAY,IAAM,EACrD,MAAM,KAAK,UAAU,UACZiB,GAASC,CAAE,GAAK,KAAKhC,EAAW,EACzC,MAAM,KAAKgC,CAAE,EACb,KAAK,mBAAmBA,CAAE,UACjBA,IAAO,SAAW,KAAK9B,EAAa,EAAG,CAChD,IAAMgD,EAAID,EACN,KAAK1B,EAAK,EAAGM,GAAM,IAAMqB,EAAE,KAAK,KAAM,KAAKhD,EAAa,CAAC,CAAC,EACzDgD,EAAE,KAAK,KAAM,KAAKhD,EAAa,CAAC,CACvC,CACA,OAAOhS,CACT,CAKA,eACE8T,EACAiB,EAAwC,CAExC,OAAO,KAAK,IAAIjB,EAAIiB,CAAO,CAC7B,CAUA,IACEjB,EACAiB,EAAwC,CAExC,IAAM/U,EAAM,MAAM,IAChB8T,EACAiB,CAA+B,EAKjC,OAAIjB,IAAO,SACT,KAAKL,EAAa,EAAI,KAAK,UAAU,MAAM,EAAE,OAE3C,KAAKA,EAAa,IAAM,GACxB,CAAC,KAAKC,EAAS,GACf,CAAC,KAAKf,EAAK,EAAE,SAEb,KAAKJ,CAAO,EAAI,KAGbvS,CACT,CAUA,mBAA+C8T,EAAU,CACvD,IAAM9T,EAAM,MAAM,mBAAmB8T,CAAiC,EACtE,OAAIA,IAAO,QAAUA,IAAO,UAC1B,KAAKL,EAAa,EAAI,EAClB,CAAC,KAAKC,EAAS,GAAK,CAAC,KAAKf,EAAK,EAAE,SACnC,KAAKJ,CAAO,EAAI,KAGbvS,CACT,CAKA,IAAI,YAAU,CACZ,OAAO,KAAK8R,EAAW,CACzB,CAEA,CAACD,EAAc,GAAC,CAEZ,CAAC,KAAKE,EAAY,GAClB,CAAC,KAAKD,EAAW,GACjB,CAAC,KAAKkB,CAAS,GACf,KAAKN,CAAM,EAAE,SAAW,GACxB,KAAKd,EAAG,IAER,KAAKG,EAAY,EAAI,GACrB,KAAK,KAAK,KAAK,EACf,KAAK,KAAK,WAAW,EACrB,KAAK,KAAK,QAAQ,EACd,KAAKE,EAAM,GAAG,KAAK,KAAK,OAAO,EACnC,KAAKF,EAAY,EAAI,GAEzB,CA0BA,KACE+B,KACGhP,EAAmB,CAEtB,IAAMmQ,EAAOnQ,EAAK,CAAC,EAEnB,GACEgP,IAAO,SACPA,IAAO,SACPA,IAAOd,GACP,KAAKA,CAAS,EAEd,MAAO,GACF,GAAIc,IAAO,OAChB,MAAO,CAAC,KAAKf,CAAU,GAAK,CAACkC,EACzB,GACA,KAAK5B,EAAK,GACTM,GAAM,IAAM,KAAKT,EAAQ,EAAE+B,CAAa,CAAC,EAAG,IAC7C,KAAK/B,EAAQ,EAAE+B,CAAa,EAC3B,GAAInB,IAAO,MAChB,OAAO,KAAKX,EAAO,EAAC,EACf,GAAIW,IAAO,QAAS,CAGzB,GAFA,KAAK7B,EAAM,EAAI,GAEX,CAAC,KAAKH,EAAW,GAAK,CAAC,KAAKkB,CAAS,EAAG,MAAO,GACnD,IAAMhT,EAAM,MAAM,KAAK,OAAO,EAC9B,OAAA,KAAK,mBAAmB,OAAO,EACxBA,CACT,SAAW8T,IAAO,QAAS,CACzB,KAAK9B,EAAa,EAAIiD,EACtB,MAAM,KAAKhC,GAAOgC,CAAI,EACtB,IAAMjV,EACJ,CAAC,KAAKwT,EAAM,GAAK,KAAK,UAAU,OAAO,EAAE,OACrC,MAAM,KAAK,QAASyB,CAAI,EACxB,GACN,OAAA,KAAKpD,EAAc,EAAC,EACb7R,CACT,SAAW8T,IAAO,SAAU,CAC1B,IAAM9T,EAAM,MAAM,KAAK,QAAQ,EAC/B,OAAA,KAAK6R,EAAc,EAAC,EACb7R,CACT,SAAW8T,IAAO,UAAYA,IAAO,YAAa,CAChD,IAAM9T,EAAM,MAAM,KAAK8T,CAAE,EACzB,OAAA,KAAK,mBAAmBA,CAAE,EACnB9T,CACT,CAGA,IAAMA,EAAM,MAAM,KAAK8T,EAAc,GAAGhP,CAAI,EAC5C,OAAA,KAAK+M,EAAc,EAAC,EACb7R,CACT,CAEA,CAACkT,EAAQ,EAAE+B,EAAW,CACpB,QAAW1a,KAAK,KAAKoY,EAAK,EACpBpY,EAAE,KAAK,MAAM0a,CAAa,IAAM,IAAO,KAAK,MAAK,EAEvD,IAAMjV,EAAM,KAAK0T,EAAS,EAAI,GAAQ,MAAM,KAAK,OAAQuB,CAAI,EAC7D,OAAA,KAAKpD,EAAc,EAAC,EACb7R,CACT,CAEA,CAACmT,EAAO,GAAC,CACP,OAAI,KAAKrB,EAAW,EAAU,IAE9B,KAAKA,EAAW,EAAI,GACpB,KAAK,SAAW,GACT,KAAKuB,EAAK,GACZM,GAAM,IAAM,KAAKP,EAAQ,EAAC,CAAE,EAAG,IAChC,KAAKA,EAAQ,EAAC,EACpB,CAEA,CAACA,EAAQ,GAAC,CACR,GAAI,KAAKd,EAAO,EAAG,CACjB,IAAM2C,EAAO,KAAK3C,EAAO,EAAE,IAAG,EAC9B,GAAI2C,EAAM,CACR,QAAW1a,KAAK,KAAKoY,EAAK,EACxBpY,EAAE,KAAK,MAAM0a,CAAa,EAEvB,KAAKvB,EAAS,GAAG,MAAM,KAAK,OAAQuB,CAAI,CAC/C,CACF,CAEA,QAAW1a,KAAK,KAAKoY,EAAK,EACxBpY,EAAE,IAAG,EAEP,IAAMyF,EAAM,MAAM,KAAK,KAAK,EAC5B,OAAA,KAAK,mBAAmB,KAAK,EACtBA,CACT,CAMA,MAAM,SAAO,CACX,IAAMkV,EAAwC,OAAO,OAAO,CAAA,EAAI,CAC9D,WAAY,CAAA,CACb,EACI,KAAKnC,CAAU,IAAGmC,EAAI,WAAa,GAGxC,IAAM3a,EAAI,KAAK,QAAO,EACtB,OAAA,KAAK,GAAG,OAAQ2B,GAAI,CAClBgZ,EAAI,KAAKhZ,CAAC,EACL,KAAK6W,CAAU,IAClBmC,EAAI,YAAehZ,EAA8B,OACrD,CAAC,EACD,MAAM3B,EACC2a,CACT,CAQA,MAAM,QAAM,CACV,GAAI,KAAKnC,CAAU,EACjB,MAAM,IAAI,MAAM,6BAA6B,EAE/C,IAAMmC,EAAM,MAAM,KAAK,QAAO,EAC9B,OACE,KAAK7C,EAAQ,EACT6C,EAAI,KAAK,EAAE,EACX,OAAO,OAAOA,EAAiBA,EAAI,UAAU,CAErD,CAKA,MAAM,SAAO,CACX,OAAO,IAAI,QAAc,CAACC,EAASC,IAAU,CAC3C,KAAK,GAAGpC,EAAW,IAAMoC,EAAO,IAAI,MAAM,kBAAkB,CAAC,CAAC,EAC9D,KAAK,GAAG,QAAS/E,GAAM+E,EAAO/E,CAAE,CAAC,EACjC,KAAK,GAAG,MAAO,IAAM8E,EAAO,CAAE,CAChC,CAAC,CACH,CAOA,CAAC,OAAO,aAAa,GAAC,CAGpB,KAAKzB,EAAS,EAAI,GAClB,IAAI2B,EAAU,GACRC,EAAO,UACX,KAAK,MAAK,EACVD,EAAU,GACH,CAAE,MAAO,OAAW,KAAM,EAAI,GA2CvC,MAAO,CACL,KA1CW,IAA2C,CACtD,GAAIA,EAAS,OAAOC,EAAI,EACxB,IAAM7E,EAAM,KAAK,KAAI,EACrB,GAAIA,IAAQ,KAAM,OAAO,QAAQ,QAAQ,CAAE,KAAM,GAAO,MAAOA,CAAG,CAAE,EAEpE,GAAI,KAAKmB,EAAG,EAAG,OAAO0D,EAAI,EAE1B,IAAIH,EACAC,EACEG,EAASlF,GAAe,CAC5B,KAAK,IAAI,OAAQmF,CAAM,EACvB,KAAK,IAAI,MAAOC,CAAK,EACrB,KAAK,IAAIzC,EAAW0C,CAAS,EAC7BJ,EAAI,EACJF,EAAO/E,CAAE,CACX,EACMmF,EAAU/G,GAAgB,CAC9B,KAAK,IAAI,QAAS8G,CAAK,EACvB,KAAK,IAAI,MAAOE,CAAK,EACrB,KAAK,IAAIzC,EAAW0C,CAAS,EAC7B,KAAK,MAAK,EACVP,EAAQ,CAAE,MAAA1G,EAAO,KAAM,CAAC,CAAC,KAAKmD,EAAG,CAAC,CAAE,CACtC,EACM6D,EAAQ,IAAK,CACjB,KAAK,IAAI,QAASF,CAAK,EACvB,KAAK,IAAI,OAAQC,CAAM,EACvB,KAAK,IAAIxC,EAAW0C,CAAS,EAC7BJ,EAAI,EACJH,EAAQ,CAAE,KAAM,GAAM,MAAO,MAAS,CAAE,CAC1C,EACMO,EAAY,IAAMH,EAAM,IAAI,MAAM,kBAAkB,CAAC,EAC3D,OAAO,IAAI,QAA+B,CAAC9E,EAAKC,IAAO,CACrD0E,EAAS1E,EACTyE,EAAU1E,EACV,KAAK,KAAKuC,EAAW0C,CAAS,EAC9B,KAAK,KAAK,QAASH,CAAK,EACxB,KAAK,KAAK,MAAOE,CAAK,EACtB,KAAK,KAAK,OAAQD,CAAM,CAC1B,CAAC,CACH,EAIE,MAAOF,EACP,OAAQA,EACR,CAAC,OAAO,aAAa,GAAC,CACpB,OAAO,IACT,CAAA,CAEJ,CAQA,CAAC,OAAO,QAAQ,GAAC,CAGf,KAAK5B,EAAS,EAAI,GAClB,IAAI2B,EAAU,GACRC,EAAO,KACX,KAAK,MAAK,EACV,KAAK,IAAIrC,GAAOqC,CAAI,EACpB,KAAK,IAAItC,EAAWsC,CAAI,EACxB,KAAK,IAAI,MAAOA,CAAI,EACpBD,EAAU,GACH,CAAE,KAAM,GAAM,MAAO,MAAS,GAGjCzP,EAAO,IAAkC,CAC7C,GAAIyP,EAAS,OAAOC,EAAI,EACxB,IAAM7G,EAAQ,KAAK,KAAI,EACvB,OAAOA,IAAU,KAAO6G,EAAI,EAAK,CAAE,KAAM,GAAO,MAAA7G,CAAK,CACvD,EAEA,OAAA,KAAK,KAAK,MAAO6G,CAAI,EACrB,KAAK,KAAKrC,GAAOqC,CAAI,EACrB,KAAK,KAAKtC,EAAWsC,CAAI,EAElB,CACL,KAAA1P,EACA,MAAO0P,EACP,OAAQA,EACR,CAAC,OAAO,QAAQ,GAAC,CACf,OAAO,IACT,CAAA,CAEJ,CAcA,QAAQjF,EAAY,CAClB,GAAI,KAAK2C,CAAS,EAChB,OAAI3C,EAAI,KAAK,KAAK,QAASA,CAAE,EACxB,KAAK,KAAK2C,CAAS,EACjB,KAGT,KAAKA,CAAS,EAAI,GAClB,KAAKU,EAAS,EAAI,GAGlB,KAAKhB,CAAM,EAAE,OAAS,EACtB,KAAKE,CAAY,EAAI,EAErB,IAAM+C,EAAK,KAGX,OAAI,OAAOA,EAAG,OAAU,YAAc,CAAC,KAAK1D,EAAM,GAAG0D,EAAG,MAAK,EAEzDtF,EAAI,KAAK,KAAK,QAASA,CAAE,EAExB,KAAK,KAAK2C,CAAS,EAEjB,IACT,CASA,WAAW,UAAQ,CACjB,OAAOxB,EACT,CAAA,EDrzCIoE,GAAeze,GAAI,OA2EnB0e,GAAqB,CACzB,UAAA9e,GACA,QAASC,GACT,YAAAC,GACA,aAAAC,GACA,aAAA0e,GACA,SAAU,CACR,MAAAve,GACA,QAAAC,GACA,SAAAC,GACA,SAAAC,EAAAA,CAAAA,EAKEse,GAAgBC,GACpB,CAACA,GAAYA,IAAaF,IAAaE,IAAa3e,GAClDye,GACA,CACE,GAAGA,GACH,GAAGE,EACH,SAAU,CACR,GAAGF,GAAU,SACb,GAAIE,EAAS,UAAY,CAAA,CAAA,CAAA,EAK3BC,GAAiB,yBACjBC,GAAcC,GAClBA,EAAS,QAAQ,MAAO,IAAI,EAAE,QAAQF,GAAgB,MAAM,EAGxDG,GAAY,SAEZC,GAAU,EACVC,GAAQ,EACRC,GAAQ,EACRC,GAAQ,EACRC,GAAQ,EACRC,GAAQ,EACRC,GAAQ,GACRC,GAAS,GACTC,GAAO,GAaPC,GAAe,CAACD,GAGhBE,GAAiB,GAEjBC,GAAe,GAEfC,GAAU,GAGVC,GAAS,IAGTC,GAAc,IAEdC,GAAc,IAEdC,GAAWJ,GAAUC,GAASE,GAC9BE,GAAW,KAEXC,GAAa5a,GACjBA,EAAE,OAAM,EAAK+Z,GACX/Z,EAAE,YAAW,EAAK6Z,GAClB7Z,EAAE,eAAc,EAAKga,GACrBha,EAAE,kBAAiB,EAAK4Z,GACxB5Z,EAAE,cAAa,EAAK8Z,GACpB9Z,EAAE,SAAQ,EAAKia,GACfja,EAAE,OAAM,EAAK2Z,GACbD,GAGEmB,GAAiB,IAAIC,GAAyB,CAAE,IAAK,GAAK,EAAE,CAAE,EAC9DC,GAAa/a,GAAa,CAC9B,IAAMR,EAAIqb,GAAe,IAAI7a,CAAC,EAC9B,GAAIR,EAAG,OAAOA,EACd,IAAMP,EAAIe,EAAE,UAAU,MAAM,EAC5B,OAAA6a,GAAe,IAAI7a,EAAGf,CAAC,EAChBA,CACT,EAEM+b,GAAuB,IAAIF,GAAyB,CAAE,IAAK,GAAK,EAAE,CAAE,EACpEG,GAAmBjb,GAAa,CACpC,IAAMR,EAAIwb,GAAqB,IAAIhb,CAAC,EACpC,GAAIR,EAAG,OAAOA,EACd,IAAMP,EAAI8b,GAAU/a,EAAE,YAAW,CAAE,EACnC,OAAAgb,GAAqB,IAAIhb,EAAGf,CAAC,EACtBA,CACT,EAoBaic,GAAP,cAA4BJ,EAAwB,CACxD,aAAA,CACE,MAAM,CAAE,IAAK,GAAG,CAAE,CACpB,CAAA,EAmBWK,GAAP,cAA6BL,EAA4B,CAC7D,YAAYvL,EAAkB,GAAK,KAAI,CACrC,MAAM,CACJ,QAAAA,EAEA,gBAAiBpU,GAAKA,EAAE,OAAS,CAAA,CAClC,CACH,CAAA,EAUIigB,GAAW,OAAO,qBAAqB,EAevBC,GAAhB,KAAwB,CAU5B,KAMA,KAMA,MAMA,OAKA,OAMA,MAAiB,GAajBC,GAGAC,GACA,IAAI,KAAG,CACL,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,MAAI,CACN,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,OAAK,CACP,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,KAAG,CACL,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,KAAG,CACL,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,MAAI,CACN,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,SAAO,CACT,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,KAAG,CACL,OAAO,KAAKA,EACd,CACA7O,GACA,IAAI,MAAI,CACN,OAAO,KAAKA,EACd,CACA8O,GACA,IAAI,QAAM,CACR,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,SAAO,CACT,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,SAAO,CACT,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,SAAO,CACT,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,aAAW,CACb,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,OAAK,CACP,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,OAAK,CACP,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,OAAK,CACP,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,WAAS,CACX,OAAO,KAAKA,EACd,CAEAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAQA,IAAI,YAAU,CACZ,OAAQ,KAAK,QAAU,MAAM,SAAQ,CACvC,CASA,IAAI,MAAI,CACN,OAAO,KAAK,UACd,CASA,YACEC,EACAja,EAAeyW,GACfyD,EACAC,EACAC,EACAC,EACA7F,EAAc,CAEd,KAAK,KAAOyF,EACZ,KAAKV,GAAaa,EAASpC,GAAgBiC,CAAI,EAAInC,GAAUmC,CAAI,EACjE,KAAKJ,GAAQ7Z,EAAO0X,GACpB,KAAK,OAAS0C,EACd,KAAK,MAAQD,EACb,KAAK,KAAOD,GAAQ,KACpB,KAAKJ,GAAYO,EACjB,KAAKZ,GAAYjF,EAAK,SACtB,KAAKmF,GAAYnF,EAAK,SACtB,KAAKoF,GAAiBpF,EAAK,cAC3B,KAAK,OAASA,EAAK,OACf,KAAK,OACP,KAAK6D,GAAM,KAAK,OAAOA,GAEvB,KAAKA,GAAMlC,GAAa3B,EAAK,EAAE,CAEnC,CAOA,OAAK,CACH,OAAI,KAAKgF,KAAW,OAAkB,KAAKA,GACtC,KAAK,OACF,KAAKA,GAAS,KAAK,OAAO,MAAK,EAAK,EADlB,KAAKA,GAAS,CAE1C,CAkBA,eAAa,CACX,OAAO,KAAKM,EACd,CAKA,QAAQ3V,EAAa,CACnB,GAAI,CAACA,EACH,OAAO,KAET,IAAMoS,EAAW,KAAK,cAAcpS,CAAI,EAElCmW,EADMnW,EAAK,UAAUoS,EAAS,MAAM,EACrB,MAAM,KAAK,QAAQ,EAKxC,OAHEA,EACE,KAAK,QAAQA,CAAQ,EAAEgE,GAAcD,CAAQ,EAC7C,KAAKC,GAAcD,CAAQ,CAEjC,CAEAC,GAAcD,EAAkB,CAC9B,IAAI1f,EAAc,KAClB,QAAWwF,KAAQka,EACjB1f,EAAIA,EAAE,MAAMwF,CAAI,EAElB,OAAOxF,CACT,CAUA,UAAQ,CACN,IAAM4f,EAAS,KAAKV,GAAU,IAAI,IAAI,EACtC,GAAIU,EACF,OAAOA,EAET,IAAMH,EAAqB,OAAO,OAAO,CAAA,EAAI,CAAE,YAAa,CAAC,CAAE,EAC/D,OAAA,KAAKP,GAAU,IAAI,KAAMO,CAAQ,EACjC,KAAKR,IAAS,CAAC1C,GACRkD,CACT,CAeA,MAAMI,EAAkBjG,EAAe,CACrC,GAAIiG,IAAa,IAAMA,IAAa,IAClC,OAAO,KAET,GAAIA,IAAa,KACf,OAAO,KAAK,QAAU,KAIxB,IAAMJ,EAAW,KAAK,SAAQ,EACxBJ,EACJ,KAAK,OAASjC,GAAgByC,CAAQ,EAAI3C,GAAU2C,CAAQ,EAC9D,QAAW7f,KAAKyf,EACd,GAAIzf,EAAE2e,KAAeU,EACnB,OAAOrf,EAOX,IAAMmC,EAAI,KAAK,OAAS,KAAK,IAAM,GAC7B2d,EACJ,KAAKjB,GAAY,KAAKA,GAAY1c,EAAI0d,EAAW,OAC7CE,EAAS,KAAK,SAASF,EAAUhE,GAAS,CAC9C,GAAGjC,EACH,OAAQ,KACR,SAAAkG,CAAAA,CACD,EAED,OAAK,KAAK,WAAU,IAClBC,EAAOd,IAASvC,IAKlB+C,EAAS,KAAKM,CAAM,EACbA,CACT,CAMA,UAAQ,CACN,GAAI,KAAK,MAAO,MAAO,GACvB,GAAI,KAAKhB,KAAc,OACrB,OAAO,KAAKA,GAEd,IAAMM,EAAO,KAAK,KACZrf,EAAI,KAAK,OACf,GAAI,CAACA,EACH,OAAQ,KAAK+e,GAAY,KAAK,KAEhC,IAAMiB,EAAKhgB,EAAE,SAAQ,EACrB,OAAOggB,GAAM,CAACA,GAAM,CAAChgB,EAAE,OAAS,GAAK,KAAK,KAAOqf,CACnD,CAQA,eAAa,CACX,GAAI,KAAK,MAAQ,IAAK,OAAO,KAAK,SAAQ,EAC1C,GAAI,KAAK,MAAO,MAAO,GACvB,GAAI,KAAKL,KAAmB,OAAW,OAAO,KAAKA,GACnD,IAAMK,EAAO,KAAK,KACZrf,EAAI,KAAK,OACf,GAAI,CAACA,EACH,OAAQ,KAAKgf,GAAiB,KAAK,cAAa,EAElD,IAAMgB,EAAKhgB,EAAE,cAAa,EAC1B,OAAOggB,GAAM,CAACA,GAAM,CAAChgB,EAAE,OAAS,GAAK,KAAOqf,CAC9C,CAKA,UAAQ,CACN,GAAI,KAAKR,KAAc,OACrB,OAAO,KAAKA,GAEd,IAAMQ,EAAO,KAAK,KACZrf,EAAI,KAAK,OACf,GAAI,CAACA,EACH,OAAQ,KAAK6e,GAAY,KAAK,KAGhC,IAAMoB,EADKjgB,EAAE,SAAQ,GACHA,EAAE,OAAc,KAAK,IAAV,IAAiBqf,EAC9C,OAAQ,KAAKR,GAAYoB,CAC3B,CAQA,eAAa,CACX,GAAI,KAAKnB,KAAmB,OAAW,OAAO,KAAKA,GACnD,GAAI,KAAK,MAAQ,IAAK,OAAQ,KAAKA,GAAiB,KAAK,SAAQ,EACjE,GAAI,CAAC,KAAK,OAAQ,CAChB,IAAM9e,EAAI,KAAK,SAAQ,EAAG,QAAQ,MAAO,GAAG,EAC5C,MAAI,aAAa,KAAKA,CAAC,EACb,KAAK8e,GAAiB,OAAO9e,CAAC,GAE9B,KAAK8e,GAAiB9e,CAElC,CACA,IAAMA,EAAI,KAAK,OACTkgB,EAAOlgB,EAAE,cAAa,EACtBmgB,EAAMD,GAAQ,CAACA,GAAQ,CAAClgB,EAAE,OAAS,GAAK,KAAO,KAAK,KAC1D,OAAQ,KAAK8e,GAAiBqB,CAChC,CASA,WAAS,CACP,OAAQ,KAAKlB,GAAQ5C,MAAUR,EACjC,CAEA,OAAOzW,EAAU,CACf,OAAO,KAAK,KAAKA,CAAI,EAAE,EAAC,CAC1B,CAEA,SAAO,CACL,OACE,KAAK,UAAS,EAAK,UACjB,KAAK,YAAW,EAAK,YACrB,KAAK,OAAM,EAAK,OAChB,KAAK,eAAc,EAAK,eACxB,KAAK,OAAM,EAAK,OAChB,KAAK,kBAAiB,EAAK,kBAC3B,KAAK,cAAa,EAAK,cACD,KAAK,SAAQ,EAAK,SACxC,SAGN,CAKA,QAAM,CACJ,OAAQ,KAAK6Z,GAAQ5C,MAAUH,EACjC,CAKA,aAAW,CACT,OAAQ,KAAK+C,GAAQ5C,MAAUL,EACjC,CAKA,mBAAiB,CACf,OAAQ,KAAKiD,GAAQ5C,MAAUN,EACjC,CAKA,eAAa,CACX,OAAQ,KAAKkD,GAAQ5C,MAAUJ,EACjC,CAKA,QAAM,CACJ,OAAQ,KAAKgD,GAAQ5C,MAAUP,EACjC,CAKA,UAAQ,CACN,OAAQ,KAAKmD,GAAQ5C,MAAUD,EACjC,CAKA,gBAAc,CACZ,OAAQ,KAAK6C,GAAQ9C,MAAWA,EAClC,CASA,aAAW,CACT,OAAO,KAAK8C,GAAQzC,GAAe,KAAO,MAC5C,CAUA,gBAAc,CACZ,OAAO,KAAK2C,EACd,CAUA,gBAAc,CACZ,OAAO,KAAKC,EACd,CAUA,eAAa,CACX,IAAMK,EAAW,KAAK,SAAQ,EAC9B,OAAOA,EAAS,MAAM,EAAGA,EAAS,WAAW,CAC/C,CASA,aAAW,CACT,GAAI,KAAKN,GAAa,MAAO,GAC7B,GAAI,CAAC,KAAK,OAAQ,MAAO,GAEzB,IAAMiB,EAAO,KAAKnB,GAAQ5C,GAC1B,MAAO,EACJ+D,IAASvE,IAAWuE,IAASjE,IAC9B,KAAK8C,GAAQtC,IACb,KAAKsC,GAAQvC,GAEjB,CAMA,eAAa,CACX,MAAO,CAAC,EAAE,KAAKuC,GAAQ1C,GACzB,CAOA,UAAQ,CACN,MAAO,CAAC,EAAE,KAAK0C,GAAQvC,GACzB,CAaA,QAAQtb,EAAS,CACf,OAAQ,KAAK,OAET,KAAKud,KAAevB,GAAgBhc,CAAC,EADrC,KAAKud,KAAezB,GAAU9b,CAAC,CAErC,CAUA,MAAM,UAAQ,CACZ,IAAMif,EAAS,KAAKlB,GACpB,GAAIkB,EACF,OAAOA,EAET,GAAK,KAAK,YAAW,GAKhB,KAAK,OAIV,GAAI,CACF,IAAMC,EAAO,MAAM,KAAK7C,GAAI,SAAS,SAAS,KAAK,SAAQ,CAAE,EACvD8C,GAAc,MAAM,KAAK,OAAO,SAAQ,IAAK,QAAQD,CAAI,EAC/D,GAAIC,EACF,OAAQ,KAAKpB,GAAcoB,CAE/B,OAASzK,EAAI,CACX,KAAK0K,GAAe1K,EAA6B,IAAI,EACrD,MACF,CACF,CAKA,cAAY,CACV,IAAMuK,EAAS,KAAKlB,GACpB,GAAIkB,EACF,OAAOA,EAET,GAAK,KAAK,YAAW,GAKhB,KAAK,OAIV,GAAI,CACF,IAAMC,EAAO,KAAK7C,GAAI,aAAa,KAAK,SAAQ,CAAE,EAC5C8C,EAAa,KAAK,OAAO,aAAY,GAAI,QAAQD,CAAI,EAC3D,GAAIC,EACF,OAAQ,KAAKpB,GAAcoB,CAE/B,OAASzK,EAAI,CACX,KAAK0K,GAAe1K,EAA6B,IAAI,EACrD,MACF,CACF,CAEA2K,GAAgBhB,EAAkB,CAEhC,KAAKR,IAAS1C,GAEd,QAASvc,EAAIyf,EAAS,YAAazf,EAAIyf,EAAS,OAAQzf,IAAK,CAC3D,IAAM2B,EAAI8d,EAASzf,CAAC,EAChB2B,GAAGA,EAAE+e,GAAW,CACtB,CACF,CAEAA,IAAW,CAEL,KAAKzB,GAAQvC,KACjB,KAAKuC,IAAS,KAAKA,GAAQvC,IAAUJ,GACrC,KAAKqE,GAAmB,EAC1B,CAEAA,IAAmB,CAEjB,IAAMlB,EAAW,KAAK,SAAQ,EAC9BA,EAAS,YAAc,EACvB,QAAWzf,KAAKyf,EACdzf,EAAE0gB,GAAW,CAEjB,CAEAE,IAAgB,CACd,KAAK3B,IAASrC,GACd,KAAKiE,GAAY,CACnB,CAGAA,IAAY,CAMV,GAAI,KAAK5B,GAAQxC,GAAS,OAE1B,IAAI5J,EAAI,KAAKoM,IAGRpM,EAAIwJ,MAAUL,KAAOnJ,GAAKyJ,IAC/B,KAAK2C,GAAQpM,EAAI4J,GACjB,KAAKkE,GAAmB,CAC1B,CAEAG,GAAapT,EAAe,GAAE,CAExBA,IAAS,WAAaA,IAAS,QACjC,KAAKmT,GAAY,EACRnT,IAAS,SAClB,KAAKgT,GAAW,EAEhB,KAAK,SAAQ,EAAG,YAAc,CAElC,CAEAK,GAAWrT,EAAe,GAAE,CAGtBA,IAAS,UAED,KAAK,OACbmT,GAAY,EACLnT,IAAS,UAElB,KAAKgT,GAAW,CAEpB,CAEAF,GAAc9S,EAAe,GAAE,CAC7B,IAAIsT,EAAM,KAAK/B,GACf+B,GAAOrE,GACHjP,IAAS,WAAUsT,GAAOtE,KAE1BhP,IAAS,UAAYA,IAAS,aAGhCsT,GAAO1E,IAET,KAAK2C,GAAQ+B,EAITtT,IAAS,WAAa,KAAK,QAC7B,KAAK,OAAOmT,GAAY,CAG5B,CAEAI,GAAiBC,EAAWvf,EAAW,CACrC,OACE,KAAKwf,GAA0BD,EAAGvf,CAAC,GACnC,KAAKyf,GAAoBF,EAAGvf,CAAC,CAEjC,CAEAyf,GAAoBF,EAAWvf,EAAW,CAExC,IAAMyD,EAAO2X,GAAUmE,CAAC,EAClBG,EAAQ,KAAK,SAASH,EAAE,KAAM9b,EAAM,CAAE,OAAQ,IAAI,CAAE,EACpDgb,EAAOiB,EAAMpC,GAAQ5C,GAC3B,OAAI+D,IAASpE,IAASoE,IAASjE,IAASiE,IAASvE,KAC/CwF,EAAMpC,IAASxC,IAEjB9a,EAAE,QAAQ0f,CAAK,EACf1f,EAAE,cACK0f,CACT,CAEAF,GAA0BD,EAAWvf,EAAW,CAC9C,QAAS3B,EAAI2B,EAAE,YAAa3B,EAAI2B,EAAE,OAAQ3B,IAAK,CAC7C,IAAM+f,EAASpe,EAAE3B,CAAC,EAGlB,IADE,KAAK,OAASod,GAAgB8D,EAAE,IAAI,EAAIhE,GAAUgE,EAAE,IAAI,KAC7CnB,EAAQpB,GAIrB,OAAO,KAAK2C,GAAqBJ,EAAGnB,EAAS/f,EAAG2B,CAAC,CACnD,CACF,CAEA2f,GACEJ,EACAlhB,EACAwQ,EACA7O,EAAW,CAEX,IAAM6R,EAAIxT,EAAE,KAEZ,OAAAA,EAAEif,GAASjf,EAAEif,GAAQ3C,GAAgBS,GAAUmE,CAAC,EAE5C1N,IAAM0N,EAAE,OAAMlhB,EAAE,KAAOkhB,EAAE,MAIzB1Q,IAAU7O,EAAE,cACV6O,IAAU7O,EAAE,OAAS,EAAGA,EAAE,IAAG,EAC5BA,EAAE,OAAO6O,EAAO,CAAC,EACtB7O,EAAE,QAAQ3B,CAAC,GAEb2B,EAAE,cACK3B,CACT,CAiBA,MAAM,OAAK,CACT,IAAK,KAAKif,GAAQvC,MAAY,EAC5B,GAAI,CACF,OAAA,KAAK6E,GAAW,MAAM,KAAK9D,GAAI,SAAS,MAAM,KAAK,SAAQ,CAAE,CAAC,EACvD,IACT,OAAS3H,EAAI,CACX,KAAKiL,GAAYjL,EAA6B,IAAI,CACpD,CAEJ,CAKA,WAAS,CACP,IAAK,KAAKmJ,GAAQvC,MAAY,EAC5B,GAAI,CACF,OAAA,KAAK6E,GAAW,KAAK9D,GAAI,UAAU,KAAK,SAAQ,CAAE,CAAC,EAC5C,IACT,OAAS3H,EAAI,CACX,KAAKiL,GAAYjL,EAA6B,IAAI,CACpD,CAEJ,CAEAyL,GAAWC,EAAS,CAClB,GAAM,CACJ,MAAAC,EACA,QAAAC,EACA,UAAAC,EACA,YAAAC,EACA,QAAAC,EACA,OAAAC,EACA,MAAAC,EACA,QAAAC,EACA,IAAAC,EACA,IAAAC,EACA,IAAAC,EACA,KAAAC,EACA,MAAAC,EACA,QAAAC,EACA,MAAAC,EACA,KAAAC,EACA,KAAAnU,EACA,IAAAoU,CAAG,EACDjB,EACJ,KAAKjD,GAASkD,EACd,KAAKtD,GAAWuD,EAChB,KAAKhD,GAAaiD,EAClB,KAAKrD,GAAesD,EACpB,KAAK5D,GAAW6D,EAChB,KAAK3D,GAAU4D,EACf,KAAKrD,GAASsD,EACd,KAAK1D,GAAW2D,EAChB,KAAKtE,GAAOuE,EACZ,KAAKnE,GAAOoE,EACZ,KAAKjE,GAAOkE,EACZ,KAAKxE,GAAQyE,EACb,KAAK5D,GAAS6D,EACd,KAAKjE,GAAWkE,EAChB,KAAK1E,GAAS2E,EACd,KAAKxE,GAAQyE,EACb,KAAKpT,GAAQf,EACb,KAAKwP,GAAO4E,EACZ,IAAMrC,EAAOrD,GAAUyE,CAAE,EAEzB,KAAKvC,GAAS,KAAKA,GAAQ3C,GAAgB8D,EAAO5D,GAC9C4D,IAASvE,IAAWuE,IAASpE,IAASoE,IAASjE,KACjD,KAAK8C,IAASxC,GAElB,CAEAiG,GAGc,CAAA,EACdC,GAA8B,GAC9BC,GAAiBnD,EAAgB,CAC/B,KAAKkD,GAAqB,GAC1B,IAAME,EAAM,KAAKH,GAAa,MAAK,EACnC,KAAKA,GAAa,OAAS,EAC3BG,EAAI,QAAQxN,GAAMA,EAAG,KAAMoK,CAAQ,CAAC,CACtC,CAkBA,UACEpK,EACAyN,EAAsB,GAAK,CAE3B,GAAI,CAAC,KAAK,WAAU,EAAI,CAClBA,EAAYzN,EAAG,KAAM,CAAA,CAAE,EACtB,eAAe,IAAMA,EAAG,KAAM,CAAA,CAAE,CAAC,EACtC,MACF,CAEA,IAAMoK,EAAW,KAAK,SAAQ,EAC9B,GAAI,KAAK,cAAa,EAAI,CACxB,IAAM9d,EAAI8d,EAAS,MAAM,EAAGA,EAAS,WAAW,EAC5CqD,EAAYzN,EAAG,KAAM1T,CAAC,EACrB,eAAe,IAAM0T,EAAG,KAAM1T,CAAC,CAAC,EACrC,MACF,CAIA,GADA,KAAK+gB,GAAa,KAAKrN,CAAE,EACrB,KAAKsN,GACP,OAEF,KAAKA,GAAqB,GAI1B,IAAM7C,EAAW,KAAK,SAAQ,EAC9B,KAAKrC,GAAI,QAAQqC,EAAU,CAAE,cAAe,EAAI,EAAI,CAAChK,EAAIiN,IAAW,CAClE,GAAIjN,EACF,KAAKgL,GAAchL,EAA6B,IAAI,EACpD2J,EAAS,YAAc,MAClB,CAGL,QAAWyB,KAAK6B,EACd,KAAK9B,GAAiBC,EAAGzB,CAAQ,EAEnC,KAAKgB,GAAgBhB,CAAQ,CAC/B,CACA,KAAKmD,GAAiBnD,EAAS,MAAM,EAAGA,EAAS,WAAW,CAAC,CAE/D,CAAC,CACH,CAEAuD,GAWA,MAAM,SAAO,CACX,GAAI,CAAC,KAAK,WAAU,EAClB,MAAO,CAAA,EAGT,IAAMvD,EAAW,KAAK,SAAQ,EAC9B,GAAI,KAAK,cAAa,EACpB,OAAOA,EAAS,MAAM,EAAGA,EAAS,WAAW,EAK/C,IAAMK,EAAW,KAAK,SAAQ,EAC9B,GAAI,KAAKkD,GACP,MAAM,KAAKA,OACN,CAEL,IAAIpI,EAAsB,IAAK,CAAE,EAEjC,KAAKoI,GAAwB,IAAI,QAC/B9M,GAAQ0E,EAAU1E,CAAI,EAExB,GAAI,CACF,QAAWgL,KAAK,MAAM,KAAKzD,GAAI,SAAS,QAAQqC,EAAU,CACxD,cAAe,EAAA,CAChB,EACC,KAAKmB,GAAiBC,EAAGzB,CAAQ,EAEnC,KAAKgB,GAAgBhB,CAAQ,CAC/B,OAAS3J,EAAI,CACX,KAAKgL,GAAchL,EAA6B,IAAI,EACpD2J,EAAS,YAAc,CACzB,CACA,KAAKuD,GAAwB,OAC7BpI,EAAO,CACT,CACA,OAAO6E,EAAS,MAAM,EAAGA,EAAS,WAAW,CAC/C,CAKA,aAAW,CACT,GAAI,CAAC,KAAK,WAAU,EAClB,MAAO,CAAA,EAGT,IAAMA,EAAW,KAAK,SAAQ,EAC9B,GAAI,KAAK,cAAa,EACpB,OAAOA,EAAS,MAAM,EAAGA,EAAS,WAAW,EAK/C,IAAMK,EAAW,KAAK,SAAQ,EAC9B,GAAI,CACF,QAAWoB,KAAK,KAAKzD,GAAI,YAAYqC,EAAU,CAC7C,cAAe,EAAA,CAChB,EACC,KAAKmB,GAAiBC,EAAGzB,CAAQ,EAEnC,KAAKgB,GAAgBhB,CAAQ,CAC/B,OAAS3J,EAAI,CACX,KAAKgL,GAAchL,EAA6B,IAAI,EACpD2J,EAAS,YAAc,CACzB,CACA,OAAOA,EAAS,MAAM,EAAGA,EAAS,WAAW,CAC/C,CAEA,YAAU,CACR,GAAI,KAAKR,GAAQpC,GAAU,MAAO,GAClC,IAAMuD,EAAO/D,GAAO,KAAK4C,GAGzB,OAAMmB,IAASvE,IAAWuE,IAASpE,IAASoE,IAASjE,EAKvD,CAEA,WACE8G,EACAC,EAAqC,CAErC,OACG,KAAKjE,GAAQjD,MAAWA,IACzB,EAAE,KAAKiD,GAAQpC,KACf,CAACoG,EAAK,IAAI,IAAI,IACb,CAACC,GAAcA,EAAW,IAAI,EAEnC,CAWA,MAAM,UAAQ,CACZ,GAAI,KAAK9D,GAAW,OAAO,KAAKA,GAChC,GAAK,GAAAxC,GAAcD,GAAcD,IAAU,KAAKuC,IAChD,GAAI,CACF,IAAMkE,EAAK,MAAM,KAAK1F,GAAI,SAAS,SAAS,KAAK,SAAQ,CAAE,EAC3D,OAAQ,KAAK2B,GAAY,KAAK,QAAQ+D,CAAE,CAC1C,MAAY,CACV,KAAKvC,GAAgB,CACvB,CACF,CAKA,cAAY,CACV,GAAI,KAAKxB,GAAW,OAAO,KAAKA,GAChC,GAAK,GAAAxC,GAAcD,GAAcD,IAAU,KAAKuC,IAChD,GAAI,CACF,IAAMkE,EAAK,KAAK1F,GAAI,aAAa,KAAK,SAAQ,CAAE,EAChD,OAAQ,KAAK2B,GAAY,KAAK,QAAQ+D,CAAE,CAC1C,MAAY,CACV,KAAKvC,GAAgB,CACvB,CACF,CAQA,CAACrD,EAAQ,EAAE6F,EAAgB,CACzB,GAAIA,IAAW,KAAM,OACrBA,EAAO,MAAQ,GACf,KAAK,MAAQ,GAEb,IAAMC,EAAU,IAAI,IAAc,CAAA,CAAE,EAChCF,EAAK,CAAA,EACLnjB,EAAc,KAClB,KAAOA,GAAKA,EAAE,QACZqjB,EAAQ,IAAIrjB,CAAC,EACbA,EAAE+e,GAAYoE,EAAG,KAAK,KAAK,GAAG,EAC9BnjB,EAAEgf,GAAiBmE,EAAG,KAAK,GAAG,EAC9BnjB,EAAIA,EAAE,OACNmjB,EAAG,KAAK,IAAI,EAId,IADAnjB,EAAIojB,EACGpjB,GAAKA,EAAE,QAAU,CAACqjB,EAAQ,IAAIrjB,CAAC,GACpCA,EAAE+e,GAAY,OACd/e,EAAEgf,GAAiB,OACnBhf,EAAIA,EAAE,MAEV,CAAA,EASWsjB,GAAP,MAAOC,WAAkB/F,EAAQ,CAIrC,IAAY,KAIZ,SAAmB5B,GAQnB,YACEyD,EACAja,EAAeyW,GACfyD,EACAC,EACAC,EACAC,EACA7F,EAAc,CAEd,MAAMyF,EAAMja,EAAMka,EAAMC,EAAOC,EAAQC,EAAU7F,CAAI,CACvD,CAKA,SAASyF,EAAcja,EAAeyW,GAASjC,EAAiB,CAAA,EAAE,CAChE,OAAO,IAAI2J,GACTlE,EACAja,EACA,KAAK,KACL,KAAK,MACL,KAAK,OACL,KAAK,cAAa,EAClBwU,CAAI,CAER,CAKA,cAAcrQ,EAAY,CACxB,OAAOhN,GAAM,MAAMgN,CAAI,EAAE,IAC3B,CAKA,QAAQoS,EAAgB,CAEtB,GADAA,EAAWD,GAAWC,EAAS,YAAW,CAAE,EACxCA,IAAa,KAAK,KAAK,KACzB,OAAO,KAAK,KAGd,OAAW,CAAC6H,EAASlE,CAAI,IAAK,OAAO,QAAQ,KAAK,KAAK,EACrD,GAAI,KAAK,SAAS3D,EAAU6H,CAAO,EACjC,OAAQ,KAAK,MAAM7H,CAAQ,EAAI2D,EAInC,OAAQ,KAAK,MAAM3D,CAAQ,EAAI,IAAI8H,GACjC9H,EACA,IAAI,EACJ,IACJ,CAKA,SAASA,EAAkB6H,EAAkB,KAAK,KAAK,KAAI,CAIzD,OAAA7H,EAAWA,EACR,YAAW,EACX,QAAQ,MAAO,IAAI,EACnB,QAAQF,GAAgB,MAAM,EAC1BE,IAAa6H,CACtB,CAAA,EAQWE,GAAP,MAAOC,WAAkBnG,EAAQ,CAIrC,SAAgB,IAIhB,IAAW,IAQX,YACE6B,EACAja,EAAeyW,GACfyD,EACAC,EACAC,EACAC,EACA7F,EAAc,CAEd,MAAMyF,EAAMja,EAAMka,EAAMC,EAAOC,EAAQC,EAAU7F,CAAI,CACvD,CAKA,cAAcrQ,EAAY,CACxB,OAAOA,EAAK,WAAW,GAAG,EAAI,IAAM,EACtC,CAKA,QAAQqa,EAAiB,CACvB,OAAO,KAAK,IACd,CAKA,SAASvE,EAAcja,EAAeyW,GAASjC,EAAiB,CAAA,EAAE,CAChE,OAAO,IAAI+J,GACTtE,EACAja,EACA,KAAK,KACL,KAAK,MACL,KAAK,OACL,KAAK,cAAa,EAClBwU,CAAI,CAER,CAAA,EA0CoBiK,GAAhB,KAA8B,CAIlC,KAIA,SAIA,MAIA,IACAC,GACAC,GACA7E,GAMA,OASAzB,GASA,YACEuG,EAAoB,QAAQ,IAAG,EAC/BC,EACAza,EACA,CACE,OAAAgW,EACA,kBAAA0E,EAAoB,GAAK,KACzB,GAAAC,EAAK7I,EAAS,EACI,CAAA,EAAE,CAEtB,KAAKmC,GAAMlC,GAAa4I,CAAE,GACtBH,aAAe,KAAOA,EAAI,WAAW,SAAS,KAChDA,EAAM3nB,GAAc2nB,CAAG,GAIzB,IAAMI,EAAUH,EAAS,QAAQD,CAAG,EACpC,KAAK,MAAQ,OAAO,OAAO,IAAI,EAC/B,KAAK,SAAW,KAAK,cAAcI,CAAO,EAC1C,KAAKN,GAAgB,IAAIzG,GACzB,KAAK0G,GAAqB,IAAI1G,GAC9B,KAAK6B,GAAY,IAAI5B,GAAc4G,CAAiB,EAEpD,IAAMG,EAAQD,EAAQ,UAAU,KAAK,SAAS,MAAM,EAAE,MAAM5a,CAAG,EAM/D,GAJI6a,EAAM,SAAW,GAAK,CAACA,EAAM,CAAC,GAChCA,EAAM,IAAG,EAGP7E,IAAW,OACb,MAAM,IAAI,UACR,oDAAoD,EAIxD,KAAK,OAASA,EACd,KAAK,KAAO,KAAK,QAAQ,KAAK/B,EAAG,EACjC,KAAK,MAAM,KAAK,QAAQ,EAAI,KAAK,KACjC,IAAIxS,EAAiB,KAAK,KACtB5B,EAAMgb,EAAM,OAAS,EACnBC,EAAUL,EAAS,IACrBM,EAAM,KAAK,SACXC,EAAW,GACf,QAAWhf,KAAQ6e,EAAO,CACxB,IAAMI,EAAIpb,IACV4B,EAAOA,EAAK,MAAMzF,EAAM,CACtB,SAAU,IAAI,MAAMif,CAAC,EAAE,KAAK,IAAI,EAAE,KAAKH,CAAO,EAC9C,cAAe,IAAI,MAAMG,CAAC,EAAE,KAAK,IAAI,EAAE,KAAK,GAAG,EAC/C,SAAWF,IAAQC,EAAW,GAAKF,GAAW9e,CAAAA,CAC/C,EACDgf,EAAW,EACb,CACA,KAAK,IAAMvZ,CACb,CAKA,MAAM1B,EAAsB,KAAK,IAAG,CAClC,OAAI,OAAOA,GAAS,WAClBA,EAAO,KAAK,IAAI,QAAQA,CAAI,GAEvBA,EAAK,MAAK,CACnB,CAyBA,eAAa,CACX,OAAO,KAAK2V,EACd,CAWA,WAAWwF,EAAe,CAGxB,IAAI9mB,EAAI,GACR,QAASW,EAAImmB,EAAM,OAAS,EAAGnmB,GAAK,EAAGA,IAAK,CAC1C,IAAMyB,EAAI0kB,EAAMnmB,CAAC,EACjB,GAAI,EAAA,CAACyB,GAAKA,IAAM,OAChBpC,EAAIA,EAAI,GAAGoC,CAAC,IAAIpC,CAAC,GAAKoC,EAClB,KAAK,WAAWA,CAAC,GACnB,KAEJ,CACA,IAAM4f,EAAS,KAAKkE,GAAc,IAAIlmB,CAAC,EACvC,GAAIgiB,IAAW,OACb,OAAOA,EAET,IAAMxhB,EAAS,KAAK,IAAI,QAAQR,CAAC,EAAE,SAAQ,EAC3C,OAAA,KAAKkmB,GAAc,IAAIlmB,EAAGQ,CAAM,EACzBA,CACT,CAaA,gBAAgBsmB,EAAe,CAG7B,IAAI9mB,EAAI,GACR,QAASW,EAAImmB,EAAM,OAAS,EAAGnmB,GAAK,EAAGA,IAAK,CAC1C,IAAMyB,EAAI0kB,EAAMnmB,CAAC,EACjB,GAAI,EAAA,CAACyB,GAAKA,IAAM,OAChBpC,EAAIA,EAAI,GAAGoC,CAAC,IAAIpC,CAAC,GAAKoC,EAClB,KAAK,WAAWA,CAAC,GACnB,KAEJ,CACA,IAAM4f,EAAS,KAAKmE,GAAmB,IAAInmB,CAAC,EAC5C,GAAIgiB,IAAW,OACb,OAAOA,EAET,IAAMxhB,EAAS,KAAK,IAAI,QAAQR,CAAC,EAAE,cAAa,EAChD,OAAA,KAAKmmB,GAAmB,IAAInmB,EAAGQ,CAAM,EAC9BA,CACT,CAKA,SAASiW,EAA2B,KAAK,IAAG,CAC1C,OAAI,OAAOA,GAAU,WACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,GAEzBA,EAAM,SAAQ,CACvB,CAMA,cAAcA,EAA2B,KAAK,IAAG,CAC/C,OAAI,OAAOA,GAAU,WACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,GAEzBA,EAAM,cAAa,CAC5B,CAKA,SAASA,EAA2B,KAAK,IAAG,CAC1C,OAAI,OAAOA,GAAU,WACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,GAEzBA,EAAM,IACf,CAKA,QAAQA,EAA2B,KAAK,IAAG,CACzC,OAAI,OAAOA,GAAU,WACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,IAExBA,EAAM,QAAUA,GAAO,SAAQ,CACzC,CAkCA,MAAM,QACJA,EAAwD,KAAK,IAC7DuF,EAAmC,CACjC,cAAe,EAAA,EAChB,CAEG,OAAOvF,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBmJ,KAC5B5D,EAAOvF,EACPA,EAAQ,KAAK,KAEf,GAAM,CAAE,cAAAsQ,CAAa,EAAK/K,EAC1B,GAAKvF,EAAM,WAAU,EAEd,CACL,IAAMrU,EAAI,MAAMqU,EAAM,QAAO,EAC7B,OAAOsQ,EAAgB3kB,EAAIA,EAAE,IAAIkhB,GAAKA,EAAE,IAAI,CAC9C,KAJE,OAAO,CAAA,CAKX,CAsBA,YACE7M,EAAwD,KAAK,IAC7DuF,EAAmC,CACjC,cAAe,EAAA,EAChB,CAEG,OAAOvF,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBmJ,KAC5B5D,EAAOvF,EACPA,EAAQ,KAAK,KAEf,GAAM,CAAE,cAAAsQ,EAAgB,EAAI,EAAK/K,EACjC,OAAKvF,EAAM,WAAU,EAEVsQ,EACFtQ,EAAM,YAAW,EAEjBA,EAAM,YAAW,EAAG,IAAI6M,GAAKA,EAAE,IAAI,EAJnC,CAAA,CAMX,CAiBA,MAAM,MACJ7M,EAA2B,KAAK,IAAG,CAEnC,OAAI,OAAOA,GAAU,WACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,GAEzBA,EAAM,MAAK,CACpB,CAKA,UAAUA,EAA2B,KAAK,IAAG,CAC3C,OAAI,OAAOA,GAAU,WACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,GAEzBA,EAAM,UAAS,CACxB,CAkCA,MAAM,SACJA,EAAwD,KAAK,IAC7D,CAAE,cAAAsQ,CAAa,EAAiC,CAC9C,cAAe,EAAA,EAChB,CAEG,OAAOtQ,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBmJ,KAC5BmH,EAAgBtQ,EAAM,cACtBA,EAAQ,KAAK,KAEf,IAAM6M,EAAI,MAAM7M,EAAM,SAAQ,EAC9B,OAAOsQ,EAAgBzD,EAAIA,GAAG,SAAQ,CACxC,CAuBA,aACE7M,EAAwD,KAAK,IAC7D,CAAE,cAAAsQ,CAAa,EAAiC,CAC9C,cAAe,EAAA,EAChB,CAEG,OAAOtQ,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBmJ,KAC5BmH,EAAgBtQ,EAAM,cACtBA,EAAQ,KAAK,KAEf,IAAM6M,EAAI7M,EAAM,aAAY,EAC5B,OAAOsQ,EAAgBzD,EAAIA,GAAG,SAAQ,CACxC,CAiCA,MAAM,SACJ7M,EAAwD,KAAK,IAC7D,CAAE,cAAAsQ,CAAa,EAAiC,CAC9C,cAAe,EAAA,EAChB,CAEG,OAAOtQ,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBmJ,KAC5BmH,EAAgBtQ,EAAM,cACtBA,EAAQ,KAAK,KAEf,IAAM6M,EAAI,MAAM7M,EAAM,SAAQ,EAC9B,OAAOsQ,EAAgBzD,EAAIA,GAAG,SAAQ,CACxC,CAoBA,aACE7M,EAAwD,KAAK,IAC7D,CAAE,cAAAsQ,CAAa,EAAiC,CAC9C,cAAe,EAAA,EAChB,CAEG,OAAOtQ,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBmJ,KAC5BmH,EAAgBtQ,EAAM,cACtBA,EAAQ,KAAK,KAEf,IAAM6M,EAAI7M,EAAM,aAAY,EAC5B,OAAOsQ,EAAgBzD,EAAIA,GAAG,SAAQ,CACxC,CA6BA,MAAM,KACJ7M,EAAyC,KAAK,IAC9CuF,EAAoB,CAAA,EAAE,CAElB,OAAOvF,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBmJ,KAC5B5D,EAAOvF,EACPA,EAAQ,KAAK,KAEf,GAAM,CACJ,cAAAsQ,EAAgB,GAChB,OAAAC,EAAS,GACT,OAAAhb,EACA,WAAAsZ,CAAU,EACRtJ,EACEiL,EAAiC,CAAA,GACnC,CAACjb,GAAUA,EAAOyK,CAAK,IACzBwQ,EAAQ,KAAKF,EAAgBtQ,EAAQA,EAAM,SAAQ,CAAE,EAEvD,IAAM4O,EAAO,IAAI,IACX6B,EAAO,CACXC,EACA1P,IACE,CACF4N,EAAK,IAAI8B,CAAG,EACZA,EAAI,UAAU,CAACjP,EAAIiN,IAAW,CAE5B,GAAIjN,EACF,OAAOT,EAAGS,CAAE,EAGd,IAAIzM,EAAM0Z,EAAQ,OAClB,GAAI,CAAC1Z,EAAK,OAAOgM,EAAE,EACnB,IAAMhK,EAAO,IAAK,CACZ,EAAEhC,IAAQ,GACZgM,EAAE,CAEN,EACA,QAAW6L,KAAK6B,GACV,CAACnZ,GAAUA,EAAOsX,CAAC,IACrB2D,EAAQ,KAAKF,EAAgBzD,EAAIA,EAAE,SAAQ,CAAE,EAE3C0D,GAAU1D,EAAE,eAAc,EAC5BA,EAAE,SAAQ,EACP,KAAKtjB,GAAMA,GAAG,UAAS,EAAKA,EAAE,MAAK,EAAKA,CAAE,EAC1C,KAAKA,GACJA,GAAG,WAAWqlB,EAAMC,CAAU,EAAI4B,EAAKlnB,EAAGyN,CAAI,EAAIA,EAAI,CAAE,EAGxD6V,EAAE,WAAW+B,EAAMC,CAAU,EAC/B4B,EAAK5D,EAAG7V,CAAI,EAEZA,EAAI,CAIZ,EAAG,EAAI,CACT,EAEMzE,EAAQyN,EACd,OAAO,IAAI,QAA+B,CAAC6B,EAAKC,IAAO,CACrD2O,EAAKle,EAAOkP,GAAK,CAEf,GAAIA,EAAI,OAAOK,EAAIL,CAAE,EAErBI,EAAI2O,CAAgC,CACtC,CAAC,CACH,CAAC,CACH,CA6BA,SACExQ,EAAyC,KAAK,IAC9CuF,EAAoB,CAAA,EAAE,CAElB,OAAOvF,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBmJ,KAC5B5D,EAAOvF,EACPA,EAAQ,KAAK,KAEf,GAAM,CACJ,cAAAsQ,EAAgB,GAChB,OAAAC,EAAS,GACT,OAAAhb,EACA,WAAAsZ,CAAU,EACRtJ,EACEiL,EAAiC,CAAA,GACnC,CAACjb,GAAUA,EAAOyK,CAAK,IACzBwQ,EAAQ,KAAKF,EAAgBtQ,EAAQA,EAAM,SAAQ,CAAE,EAEvD,IAAM4O,EAAO,IAAI,IAAc,CAAC5O,CAAK,CAAC,EACtC,QAAW0Q,KAAO9B,EAAM,CACtB,IAAMF,EAAUgC,EAAI,YAAW,EAC/B,QAAW7D,KAAK6B,EAAS,EACnB,CAACnZ,GAAUA,EAAOsX,CAAC,IACrB2D,EAAQ,KAAKF,EAAgBzD,EAAIA,EAAE,SAAQ,CAAE,EAE/C,IAAItjB,EAA0BsjB,EAC9B,GAAIA,EAAE,eAAc,EAAI,CACtB,GAAI,EAAE0D,IAAWhnB,EAAIsjB,EAAE,aAAY,IAAM,SACrCtjB,EAAE,UAAS,GAAIA,EAAE,UAAS,CAChC,CACIA,EAAE,WAAWqlB,EAAMC,CAAU,GAC/BD,EAAK,IAAIrlB,CAAC,CAEd,CACF,CACA,OAAOinB,CACT,CAWA,CAAC,OAAO,aAAa,GAAC,CACpB,OAAO,KAAK,QAAO,CACrB,CA+BA,QACExQ,EAAyC,KAAK,IAC9ClU,EAAuB,CAAA,EAAE,CAKzB,OAAI,OAAOkU,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBmJ,KAC5Brd,EAAUkU,EACVA,EAAQ,KAAK,KAER,KAAK,OAAOA,EAAOlU,CAAO,EAAE,OAAO,aAAa,EAAC,CAC1D,CAOA,CAAC,OAAO,QAAQ,GAAC,CACf,OAAO,KAAK,YAAW,CACzB,CAuBA,CAAC,YACCkU,EAAyC,KAAK,IAC9CuF,EAAoB,CAAA,EAAE,CAElB,OAAOvF,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBmJ,KAC5B5D,EAAOvF,EACPA,EAAQ,KAAK,KAEf,GAAM,CACJ,cAAAsQ,EAAgB,GAChB,OAAAC,EAAS,GACT,OAAAhb,EACA,WAAAsZ,CAAU,EACRtJ,GACA,CAAChQ,GAAUA,EAAOyK,CAAK,KACzB,MAAMsQ,EAAgBtQ,EAAQA,EAAM,SAAQ,GAE9C,IAAM4O,EAAO,IAAI,IAAc,CAAC5O,CAAK,CAAC,EACtC,QAAW0Q,KAAO9B,EAAM,CACtB,IAAMF,EAAUgC,EAAI,YAAW,EAC/B,QAAW7D,KAAK6B,EAAS,EACnB,CAACnZ,GAAUA,EAAOsX,CAAC,KACrB,MAAMyD,EAAgBzD,EAAIA,EAAE,SAAQ,GAEtC,IAAItjB,EAA0BsjB,EAC9B,GAAIA,EAAE,eAAc,EAAI,CACtB,GAAI,EAAE0D,IAAWhnB,EAAIsjB,EAAE,aAAY,IAAM,SACrCtjB,EAAE,UAAS,GAAIA,EAAE,UAAS,CAChC,CACIA,EAAE,WAAWqlB,EAAMC,CAAU,GAC/BD,EAAK,IAAIrlB,CAAC,CAEd,CACF,CACF,CA2BA,OACEyW,EAAyC,KAAK,IAC9CuF,EAAoB,CAAA,EAAE,CAElB,OAAOvF,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBmJ,KAC5B5D,EAAOvF,EACPA,EAAQ,KAAK,KAEf,GAAM,CACJ,cAAAsQ,EAAgB,GAChB,OAAAC,EAAS,GACT,OAAAhb,EACA,WAAAsZ,CAAU,EACRtJ,EACEiL,EAAU,IAAI3N,GAA4B,CAAE,WAAY,EAAI,CAAE,GAChE,CAACtN,GAAUA,EAAOyK,CAAK,IACzBwQ,EAAQ,MAAMF,EAAgBtQ,EAAQA,EAAM,SAAQ,CAAE,EAExD,IAAM4O,EAAO,IAAI,IACX+B,EAAoB,CAAC3Q,CAAK,EAC5B4Q,EAAa,EACXC,EAAU,IAAK,CACnB,IAAIC,EAAS,GACb,KAAO,CAACA,GAAQ,CACd,IAAMJ,EAAMC,EAAM,MAAK,EACvB,GAAI,CAACD,EAAK,CACJE,IAAe,GAAGJ,EAAQ,IAAG,EACjC,MACF,CAEAI,IACAhC,EAAK,IAAI8B,CAAG,EAEZ,IAAMK,EAAY,CAChBtP,EACAiN,EACAsC,EAAwB,KACtB,CAEF,GAAIvP,EAAI,OAAO+O,EAAQ,KAAK,QAAS/O,CAAE,EAEvC,GAAI8O,GAAU,CAACS,EAAc,CAC3B,IAAMC,EAA4C,CAAA,EAClD,QAAWpE,KAAK6B,EACV7B,EAAE,eAAc,GAClBoE,EAAS,KACPpE,EACG,SAAQ,EACR,KAAMtjB,GACLA,GAAG,UAAS,EAAKA,EAAE,MAAK,EAAKA,CAAC,CAC/B,EAIT,GAAI0nB,EAAS,OAAQ,CACnB,QAAQ,IAAIA,CAAQ,EAAE,KAAK,IACzBF,EAAU,KAAMrC,EAAS,EAAI,CAAC,EAEhC,MACF,CACF,CAEA,QAAW7B,KAAK6B,EACV7B,IAAM,CAACtX,GAAUA,EAAOsX,CAAC,KACtB2D,EAAQ,MAAMF,EAAgBzD,EAAIA,EAAE,SAAQ,CAAE,IACjDiE,EAAS,KAKfF,IACA,QAAW/D,KAAK6B,EAAS,CACvB,IAAMnlB,EAAIsjB,EAAE,eAAc,GAAMA,EAC5BtjB,EAAE,WAAWqlB,EAAMC,CAAU,GAC/B8B,EAAM,KAAKpnB,CAAC,CAEhB,CACIunB,GAAU,CAACN,EAAQ,QACrBA,EAAQ,KAAK,QAASK,CAAO,EACnBK,GACVL,EAAO,CAEX,EAGIK,EAAO,GACXR,EAAI,UAAUK,EAAW,EAAI,EAC7BG,EAAO,EACT,CACF,EACA,OAAAL,EAAO,EACAL,CACT,CA8BA,WACExQ,EAAyC,KAAK,IAC9CuF,EAAoB,CAAA,EAAE,CAElB,OAAOvF,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBmJ,KAC5B5D,EAAOvF,EACPA,EAAQ,KAAK,KAEf,GAAM,CACJ,cAAAsQ,EAAgB,GAChB,OAAAC,EAAS,GACT,OAAAhb,EACA,WAAAsZ,CAAU,EACRtJ,EACEiL,EAAU,IAAI3N,GAA4B,CAAE,WAAY,EAAI,CAAE,EAC9D+L,EAAO,IAAI,KACb,CAACrZ,GAAUA,EAAOyK,CAAK,IACzBwQ,EAAQ,MAAMF,EAAgBtQ,EAAQA,EAAM,SAAQ,CAAE,EAExD,IAAM2Q,EAAoB,CAAC3Q,CAAK,EAC5B4Q,EAAa,EACXC,EAAU,IAAK,CACnB,IAAIC,EAAS,GACb,KAAO,CAACA,GAAQ,CACd,IAAMJ,EAAMC,EAAM,MAAK,EACvB,GAAI,CAACD,EAAK,CACJE,IAAe,GAAGJ,EAAQ,IAAG,EACjC,MACF,CACAI,IACAhC,EAAK,IAAI8B,CAAG,EAEZ,IAAMhC,EAAUgC,EAAI,YAAW,EAC/B,QAAW7D,KAAK6B,GACV,CAACnZ,GAAUA,EAAOsX,CAAC,KAChB2D,EAAQ,MAAMF,EAAgBzD,EAAIA,EAAE,SAAQ,CAAE,IACjDiE,EAAS,KAIfF,IACA,QAAW/D,KAAK6B,EAAS,CACvB,IAAInlB,EAA0BsjB,EAC9B,GAAIA,EAAE,eAAc,EAAI,CACtB,GAAI,EAAE0D,IAAWhnB,EAAIsjB,EAAE,aAAY,IAAM,SACrCtjB,EAAE,UAAS,GAAIA,EAAE,UAAS,CAChC,CACIA,EAAE,WAAWqlB,EAAMC,CAAU,GAC/B8B,EAAM,KAAKpnB,CAAC,CAEhB,CACF,CACIunB,GAAU,CAACN,EAAQ,SAASA,EAAQ,KAAK,QAASK,CAAO,CAC/D,EACA,OAAAA,EAAO,EACAL,CACT,CAEA,MAAMtb,EAAsB,KAAK,IAAG,CAClC,IAAM6Z,EAAS,KAAK,IACpB,KAAK,IAAM,OAAO7Z,GAAS,SAAW,KAAK,IAAI,QAAQA,CAAI,EAAIA,EAC/D,KAAK,IAAIgU,EAAQ,EAAE6F,CAAM,CAC3B,CAAA,EAwEWK,GAAP,cAA+BI,EAAc,CAIjD,IAAY,KAEZ,YACEG,EAAoB,QAAQ,IAAG,EAC/BpK,EAAuB,CAAA,EAAE,CAEzB,GAAM,CAAE,OAAA4F,EAAS,EAAI,EAAK5F,EAC1B,MAAMoK,EAAKznB,GAAO,KAAM,CAAE,GAAGqd,EAAM,OAAA4F,CAAM,CAAE,EAC3C,KAAK,OAASA,EACd,QAASxf,EAA0B,KAAK,IAAKA,EAAGA,EAAIA,EAAE,OACpDA,EAAE,OAAS,KAAK,MAEpB,CAKA,cAAc+kB,EAAW,CAIvB,OAAOxoB,GAAM,MAAMwoB,CAAG,EAAE,KAAK,YAAW,CAC1C,CAKA,QAAQZ,EAAW,CACjB,OAAO,IAAIb,GACT,KAAK,SACLtH,GACA,OACA,KAAK,MACL,KAAK,OACL,KAAK,cAAa,EAClB,CAAE,GAAAmI,CAAE,CAAE,CAEV,CAKA,WAAWnkB,EAAS,CAClB,OACEA,EAAE,WAAW,GAAG,GAAKA,EAAE,WAAW,IAAI,GAAK,kBAAkB,KAAKA,CAAC,CAEvE,CAAA,EAUWwlB,GAAP,cAA+B3B,EAAc,CAIjD,IAAW,IACX,YACEG,EAAoB,QAAQ,IAAG,EAC/BpK,EAAuB,CAAA,EAAE,CAEzB,GAAM,CAAE,OAAA4F,EAAS,EAAK,EAAK5F,EAC3B,MAAMoK,EAAK1nB,GAAO,IAAK,CAAE,GAAGsd,EAAM,OAAA4F,CAAM,CAAE,EAC1C,KAAK,OAASA,CAChB,CAKA,cAAciG,EAAY,CACxB,MAAO,GACT,CAKA,QAAQtB,EAAW,CACjB,OAAO,IAAIT,GACT,KAAK,SACL1H,GACA,OACA,KAAK,MACL,KAAK,OACL,KAAK,cAAa,EAClB,CAAE,GAAAmI,CAAE,CAAE,CAEV,CAKA,WAAWnkB,EAAS,CAClB,OAAOA,EAAE,WAAW,GAAG,CACzB,CAAA,EAWW0lB,GAAP,cAAgCF,EAAe,CACnD,YACExB,EAAoB,QAAQ,IAAG,EAC/BpK,EAAuB,CAAA,EAAE,CAEzB,GAAM,CAAE,OAAA4F,EAAS,EAAI,EAAK5F,EAC1B,MAAMoK,EAAK,CAAE,GAAGpK,EAAM,OAAA4F,CAAM,CAAE,CAChC,CAAA,EAQWmG,GAAO,QAAQ,WAAa,QAAUrC,GAAYI,GASlDkC,GAIX,QAAQ,WAAa,QAAUnC,GAC7B,QAAQ,WAAa,SAAWiC,GAChCF,GE5vFEK,GAAiBngB,GACrBA,EAAG,QAAU,EACTogB,GAAcC,GAAiCA,EAAG,QAAU,EAE5DC,GAAgB,OAAO,IAAI,4BAA4B,EAMhDC,GAAP,MAAOC,EAAO,CACTC,GACAC,GACAC,GACA,OACAC,GACTC,GACAC,GACAC,GACAC,GACAC,GACAC,GAA2B,GAE3B,YACEC,EACAC,EACAtW,EACAuW,EAAyB,CAEzB,GAAI,CAAClB,GAAcgB,CAAW,EAC5B,MAAM,IAAI,UAAU,oBAAoB,EAE1C,GAAI,CAACf,GAAWgB,CAAQ,EACtB,MAAM,IAAI,UAAU,iBAAiB,EAEvC,GAAIA,EAAS,SAAWD,EAAY,OAClC,MAAM,IAAI,UAAU,+CAA+C,EAGrE,GADA,KAAK,OAASA,EAAY,OACtBrW,EAAQ,GAAKA,GAAS,KAAK,OAC7B,MAAM,IAAI,UAAU,oBAAoB,EAQ1C,GANA,KAAK2V,GAAeU,EACpB,KAAKT,GAAYU,EACjB,KAAKT,GAAS7V,EACd,KAAK8V,GAAYS,EAGb,KAAKV,KAAW,GASlB,GAAI,KAAK,MAAK,EAAI,CAEhB,GAAM,CAACW,EAAIC,EAAI3b,EAAI4b,EAAI,GAAGC,CAAK,EAAI,KAAKhB,GAClC,CAACiB,EAAIC,EAAIC,EAAIC,EAAI,GAAGC,CAAK,EAAI,KAAKpB,GACpCe,EAAM,CAAC,IAAM,KAEfA,EAAM,MAAK,EACXK,EAAM,MAAK,GAEb,IAAMxnB,EAAI,CAACgnB,EAAIC,EAAI3b,EAAI4b,EAAI,EAAE,EAAE,KAAK,GAAG,EACjCO,EAAI,CAACL,EAAIC,EAAIC,EAAIC,EAAI,EAAE,EAAE,KAAK,GAAG,EACvC,KAAKpB,GAAe,CAACnmB,EAAG,GAAGmnB,CAAK,EAChC,KAAKf,GAAY,CAACqB,EAAG,GAAGD,CAAK,EAC7B,KAAK,OAAS,KAAKrB,GAAa,MAClC,SAAW,KAAK,QAAO,GAAM,KAAK,WAAU,EAAI,CAC9C,GAAM,CAACc,EAAI,GAAGE,CAAK,EAAI,KAAKhB,GACtB,CAACkB,EAAI,GAAGG,CAAK,EAAI,KAAKpB,GACxBe,EAAM,CAAC,IAAM,KAEfA,EAAM,MAAK,EACXK,EAAM,MAAK,GAEb,IAAMxnB,EAAKinB,EAAgB,IACrBQ,EAAIJ,EAAK,IACf,KAAKlB,GAAe,CAACnmB,EAAG,GAAGmnB,CAAK,EAChC,KAAKf,GAAY,CAACqB,EAAG,GAAGD,CAAK,EAC7B,KAAK,OAAS,KAAKrB,GAAa,MAClC,EAEJ,CAEA,CAACH,EAAa,GAAC,CACb,MAAO,YAAc,KAAKI,GAAU,MAAM,KAAKC,EAAM,EAAE,KAAK,GAAG,EAAI,GACrE,CAKA,SAAO,CACL,OAAO,KAAKF,GAAa,KAAKE,EAAM,CACtC,CAKA,UAAQ,CACN,OAAO,OAAO,KAAKF,GAAa,KAAKE,EAAM,GAAM,QACnD,CAIA,YAAU,CACR,OAAO,KAAKF,GAAa,KAAKE,EAAM,IAAM5c,EAC5C,CAIA,UAAQ,CACN,OAAO,KAAK0c,GAAa,KAAKE,EAAM,YAAa,MACnD,CAKA,YAAU,CACR,OAAQ,KAAKG,GACX,KAAKA,KACJ,KAAKH,KAAW,EACf,KAAK,WAAU,EACb,KAAKD,GAAU,CAAC,EAAI,KAAKA,GAAU,MAAM,CAAC,EAAE,KAAK,GAAG,EACpD,KAAKA,GAAU,KAAK,GAAG,EACzB,KAAKA,GAAU,MAAM,KAAKC,EAAM,EAAE,KAAK,GAAG,EAChD,CAKA,SAAO,CACL,OAAO,KAAK,OAAS,KAAKA,GAAS,CACrC,CAKA,MAAI,CACF,OAAI,KAAKE,KAAU,OAAkB,KAAKA,GACrC,KAAK,QAAO,GACjB,KAAKA,GAAQ,IAAIL,GACf,KAAKC,GACL,KAAKC,GACL,KAAKC,GAAS,EACd,KAAKC,EAAS,EAEhB,KAAKC,GAAMI,GAAc,KAAKA,GAC9B,KAAKJ,GAAMG,GAAS,KAAKA,GACzB,KAAKH,GAAME,GAAW,KAAKA,GACpB,KAAKF,IAViB,KAAKA,GAAQ,IAW5C,CAKA,OAAK,CACH,IAAM7gB,EAAK,KAAKygB,GAChB,OAAO,KAAKO,KAAW,OACnB,KAAKA,GACJ,KAAKA,GACJ,KAAKJ,KAAc,SACnB,KAAKD,KAAW,GAChB3gB,EAAG,CAAC,IAAM,IACVA,EAAG,CAAC,IAAM,IACV,OAAOA,EAAG,CAAC,GAAM,UACjB,CAAC,CAACA,EAAG,CAAC,GACN,OAAOA,EAAG,CAAC,GAAM,UACjB,CAAC,CAACA,EAAG,CAAC,CACd,CAUA,SAAO,CACL,IAAMA,EAAK,KAAKygB,GAChB,OAAO,KAAKM,KAAa,OACrB,KAAKA,GACJ,KAAKA,GACJ,KAAKH,KAAc,SACnB,KAAKD,KAAW,GAChB,KAAK,OAAS,GACd,OAAO3gB,EAAG,CAAC,GAAM,UACjB,YAAY,KAAKA,EAAG,CAAC,CAAC,CAC9B,CAQA,YAAU,CACR,IAAMA,EAAK,KAAKygB,GAChB,OAAO,KAAKQ,KAAgB,OACxB,KAAKA,GACJ,KAAKA,GACHjhB,EAAG,CAAC,IAAM,IAAMA,EAAG,OAAS,GAC7B,KAAK,QAAO,GACZ,KAAK,MAAK,CAClB,CAKA,MAAI,CACF,IAAM1F,EAAI,KAAKmmB,GAAa,CAAC,EAC7B,OACI,OAAOnmB,GAAM,UAAY,KAAK,WAAU,GAAM,KAAKqmB,KAAW,EAE9DrmB,EACA,EACN,CAMA,qBAAmB,CACjB,MAAO,EACL,KAAKqmB,KAAW,GAChB,CAAC,KAAK,WAAU,GAChB,CAAC,KAAKO,GAEV,CAKA,oBAAkB,CAChB,OAAI,KAAKP,KAAW,GAAK,CAAC,KAAK,WAAU,GAAM,CAAC,KAAKO,GAC5C,IACT,KAAKA,GAAkB,GAChB,GACT,CAAA,ECpPItd,GAEF,OAAO,SAAY,UACnB,SACA,OAAO,QAAQ,UAAa,SAE5B,QAAQ,SACR,QAKSoe,GAAP,KAAa,CACjB,SACA,iBACA,SACA,iBACA,SACA,OAEA,YACEC,EACA,CACE,QAAAC,EACA,OAAApI,EACA,MAAAzW,EACA,WAAA8e,EACA,SAAAd,EAAWzd,EAAe,EACX,CAEjB,KAAK,SAAW,CAAA,EAChB,KAAK,SAAW,CAAA,EAChB,KAAK,iBAAmB,CAAA,EACxB,KAAK,iBAAmB,CAAA,EACxB,KAAK,SAAWyd,EAChB,KAAK,OAAS,CACZ,IAAK,GACL,QAAAa,EACA,OAAApI,EACA,MAAAzW,EACA,WAAA8e,EACA,kBAAmB,EACnB,SAAAd,EACA,UAAW,GACX,SAAU,EAAA,EAEZ,QAAWe,KAAOH,EAAS,KAAK,IAAIG,CAAG,CACzC,CAEA,IAAIA,EAAW,CAab,IAAM1d,EAAK,IAAIvC,GAAUigB,EAAK,KAAK,MAAM,EACzC,QAASvpB,EAAI,EAAGA,EAAI6L,EAAG,IAAI,OAAQ7L,IAAK,CACtC,IAAMwpB,EAAS3d,EAAG,IAAI7L,CAAC,EACjBuM,EAAYV,EAAG,UAAU7L,CAAC,EAEhC,GAAI,CAACwpB,GAAU,CAACjd,EACd,MAAM,IAAI,MAAM,wBAAwB,EAI1C,KAAOid,EAAO,CAAC,IAAM,KAAOjd,EAAU,CAAC,IAAM,KAC3Cid,EAAO,MAAK,EACZjd,EAAU,MAAK,EAGjB,IAAM9K,EAAI,IAAIimB,GAAQ8B,EAAQjd,EAAW,EAAG,KAAK,QAAQ,EACnD/M,EAAI,IAAI8J,GAAU7H,EAAE,WAAU,EAAI,KAAK,MAAM,EAC7Cyf,EAAW3U,EAAUA,EAAU,OAAS,CAAC,IAAM,KAC/Ckd,EAAWhoB,EAAE,WAAU,EACzBgoB,EAAU,KAAK,SAAS,KAAKjqB,CAAC,EAC7B,KAAK,SAAS,KAAKA,CAAC,EACrB0hB,IACEuI,EAAU,KAAK,iBAAiB,KAAKjqB,CAAC,EACrC,KAAK,iBAAiB,KAAKA,CAAC,EAErC,CACF,CAEA,QAAQiC,EAAO,CACb,IAAM8f,EAAW9f,EAAE,SAAQ,EACrBioB,EAAY,GAAGnI,CAAQ,IACvBoI,EAAWloB,EAAE,SAAQ,GAAM,IAC3BmoB,EAAY,GAAGD,CAAQ,IAC7B,QAAWnqB,KAAK,KAAK,SACnB,GAAIA,EAAE,MAAMmqB,CAAQ,GAAKnqB,EAAE,MAAMoqB,CAAS,EAAG,MAAO,GAEtD,QAAWpqB,KAAK,KAAK,SACnB,GAAIA,EAAE,MAAM+hB,CAAQ,GAAK/hB,EAAE,MAAMkqB,CAAS,EAAG,MAAO,GAEtD,MAAO,EACT,CAEA,gBAAgBjoB,EAAO,CACrB,IAAM8f,EAAW9f,EAAE,SAAQ,EAAK,IAC1BkoB,GAAYloB,EAAE,SAAQ,GAAM,KAAO,IACzC,QAAWjC,KAAK,KAAK,iBACnB,GAAIA,EAAE,MAAMmqB,CAAQ,EAAG,MAAO,GAEhC,QAAWnqB,KAAK,KAAK,iBACnB,GAAIA,EAAE,MAAM+hB,CAAQ,EAAG,MAAO,GAEhC,MAAO,EACT,CAAA,ECxHWsI,GAAP,MAAOC,EAAc,CACzB,MACA,YAAYC,EAAkC,IAAI,IAAK,CACrD,KAAK,MAAQA,CACf,CACA,MAAI,CACF,OAAO,IAAID,GAAe,IAAI,IAAI,KAAK,KAAK,CAAC,CAC/C,CACA,UAAUhI,EAAcre,EAAgB,CACtC,OAAO,KAAK,MAAM,IAAIqe,EAAO,SAAQ,CAAE,GAAG,IAAIre,EAAQ,WAAU,CAAE,CACpE,CACA,YAAYqe,EAAcre,EAAgB,CACxC,IAAM8d,EAAWO,EAAO,SAAQ,EAC1BT,EAAS,KAAK,MAAM,IAAIE,CAAQ,EAClCF,EAAQA,EAAO,IAAI5d,EAAQ,WAAU,CAAE,EACtC,KAAK,MAAM,IAAI8d,EAAU,IAAI,IAAI,CAAC9d,EAAQ,WAAU,CAAE,CAAC,CAAC,CAC/D,CAAA,EAQWumB,GAAP,KAAkB,CACtB,MAA2B,IAAI,IAC/B,IAAIlI,EAAc2H,EAAmBQ,EAAc,CACjD,IAAMpnB,GAAK4mB,EAAW,EAAI,IAAMQ,EAAQ,EAAI,GACtCC,EAAU,KAAK,MAAM,IAAIpI,CAAM,EACrC,KAAK,MAAM,IAAIA,EAAQoI,IAAY,OAAYrnB,EAAIA,EAAIqnB,CAAO,CAChE,CAEA,SAAO,CACL,MAAO,CAAC,GAAG,KAAK,MAAM,QAAO,CAAE,EAAE,IAAI,CAAC,CAAClf,EAAMnI,CAAC,IAAM,CAClDmI,EACA,CAAC,EAAEnI,EAAI,GACP,CAAC,EAAEA,EAAI,EAAA,CACR,CACH,CAAA,EAOWsnB,GAAP,KAAe,CACnB,MAA8B,IAAI,IAClC,IAAIrI,EAAcre,EAAgB,CAChC,GAAI,CAACqe,EAAO,WAAU,EACpB,OAEF,IAAMsI,EAAO,KAAK,MAAM,IAAItI,CAAM,EAC9BsI,EACGA,EAAK,KAAK3oB,GAAKA,EAAE,WAAU,IAAOgC,EAAQ,WAAU,CAAE,GACzD2mB,EAAK,KAAK3mB,CAAO,EAEd,KAAK,MAAM,IAAIqe,EAAQ,CAACre,CAAO,CAAC,CACzC,CACA,IAAIqe,EAAY,CACd,IAAMsI,EAAO,KAAK,MAAM,IAAItI,CAAM,EAElC,GAAI,CAACsI,EACH,MAAM,IAAI,MAAM,iCAAiC,EAGnD,OAAOA,CACT,CACA,SAAO,CACL,OAAO,KAAK,KAAI,EAAG,IAAI7nB,GAAK,CAACA,EAAG,KAAK,MAAM,IAAIA,CAAC,CAAc,CAAC,CACjE,CACA,MAAI,CACF,MAAO,CAAC,GAAG,KAAK,MAAM,KAAI,CAAE,EAAE,OAAO+R,GAAKA,EAAE,WAAU,CAAE,CAC1D,CAAA,EASW+V,GAAP,MAAOC,EAAS,CACpB,eACA,QAAU,IAAIN,GACd,SAAW,IAAIG,GACf,SACA,OACA,IACA,KAEA,YAAY9O,EAAsBkP,EAA+B,CAC/D,KAAK,KAAOlP,EACZ,KAAK,OAAS,CAAC,CAACA,EAAK,OACrB,KAAK,IAAM,CAAC,CAACA,EAAK,IAClB,KAAK,eACHkP,EAAiBA,EAAe,KAAI,EAAK,IAAIV,EACjD,CAEA,gBAAgB/H,EAAc0I,EAAmB,CAC/C,KAAK,SAAWA,EAChB,IAAMC,EAAmCD,EAAS,IAAI/oB,GAAK,CAACqgB,EAAQrgB,CAAC,CAAC,EAKtE,OAAS,CAAC6S,EAAG7Q,CAAO,IAAKgnB,EAAe,CACtC,KAAK,eAAe,YAAYnW,EAAG7Q,CAAO,EAE1C,IAAMsd,EAAOtd,EAAQ,KAAI,EACnBgmB,EAAWhmB,EAAQ,WAAU,GAAM,KAAK,KAAK,WAAa,GAGhE,GAAIsd,EAAM,CACRzM,EAAIA,EAAE,QACJyM,IAAS,KAAO,KAAK,KAAK,OAAS,OACjC,KAAK,KAAK,KACVA,CAAI,EAER,IAAM2J,EAAOjnB,EAAQ,KAAI,EACzB,GAAKinB,EAIHjnB,EAAUinB,MAJD,CACT,KAAK,QAAQ,IAAIpW,EAAG,GAAM,EAAK,EAC/B,QACF,CAGF,CAEA,GAAIA,EAAE,SAAQ,EAAI,SAElB,IAAI7S,EACAipB,EACA5F,EAAU,GACd,KACE,OAAQrjB,EAAIgC,EAAQ,QAAO,IAAQ,WAClCinB,EAAOjnB,EAAQ,KAAI,IAGpB6Q,EADUA,EAAE,QAAQ7S,CAAC,EAErBgC,EAAUinB,EACV5F,EAAU,GAIZ,GAFArjB,EAAIgC,EAAQ,QAAO,EACnBinB,EAAOjnB,EAAQ,KAAI,EACfqhB,EAAS,CACX,GAAI,KAAK,eAAe,UAAUxQ,EAAG7Q,CAAO,EAAG,SAC/C,KAAK,eAAe,YAAY6Q,EAAG7Q,CAAO,CAC5C,CAKA,GAAI,OAAOhC,GAAM,SAAU,CAGzB,IAAMwoB,EAAQxoB,IAAM,MAAQA,IAAM,IAAMA,IAAM,IAC9C,KAAK,QAAQ,IAAI6S,EAAE,QAAQ7S,CAAC,EAAGgoB,EAAUQ,CAAK,EAC9C,QACF,SAAWxoB,IAAMyJ,GAAU,EAOvB,CAACoJ,EAAE,eAAc,GACjB,KAAK,QACL7Q,EAAQ,oBAAmB,IAE3B,KAAK,SAAS,IAAI6Q,EAAG7Q,CAAO,EAE9B,IAAMmhB,EAAK8F,GAAM,QAAO,EAClBC,EAAQD,GAAM,KAAI,EACxB,GAAI,CAACA,IAAU9F,IAAO,IAAMA,IAAO,MAAQ,CAAC+F,EAG1C,KAAK,QAAQ,IAAIrW,EAAGmV,EAAU7E,IAAO,IAAMA,IAAO,GAAG,UAEjDA,IAAO,KAAM,CAIf,IAAMgG,EAAKtW,EAAE,QAAUA,EAElBqW,EACK,KAAK,eAAe,UAAUC,EAAID,CAAK,GAC/C,KAAK,SAAS,IAAIC,EAAID,CAAK,EAFjB,KAAK,QAAQ,IAAIC,EAAInB,EAAU,EAAI,CAIjD,CAEJ,MAAWhoB,aAAa,QACtB,KAAK,SAAS,IAAI6S,EAAG7Q,CAAO,CAEhC,CAEA,OAAO,IACT,CAEA,gBAAc,CACZ,OAAO,KAAK,SAAS,KAAI,CAC3B,CAEA,OAAK,CACH,OAAO,IAAI6mB,GAAU,KAAK,KAAM,KAAK,cAAc,CACrD,CAMA,cAAcxjB,EAAc0d,EAAe,CACzC,IAAMgG,EAAW,KAAK,SAAS,IAAI1jB,CAAM,EAEnCwf,EAAU,KAAK,MAAK,EAC1B,QAAW3D,KAAK6B,EACd,QAAW/gB,KAAW+mB,EAAU,CAC9B,IAAMf,EAAWhmB,EAAQ,WAAU,EAC7BhC,EAAIgC,EAAQ,QAAO,EACnBinB,EAAOjnB,EAAQ,KAAI,EACrBhC,IAAMyJ,GACRob,EAAQ,aAAa3D,EAAGlf,EAASinB,EAAMjB,CAAQ,EACtChoB,aAAa,OACtB6kB,EAAQ,WAAW3D,EAAGlhB,EAAGipB,EAAMjB,CAAQ,EAEvCnD,EAAQ,WAAW3D,EAAGlhB,EAAGipB,EAAMjB,CAAQ,CAE3C,CAEF,OAAOnD,CACT,CAEA,aACE3D,EACAlf,EACAinB,EACAjB,EAAiB,CAyBjB,IAvBI,KAAK,KAAO,CAAC9G,EAAE,KAAK,WAAW,GAAG,KAC/Blf,EAAQ,QAAO,GAClB,KAAK,QAAQ,IAAIkf,EAAG8G,EAAU,EAAK,EAEjC9G,EAAE,WAAU,IAMV,KAAK,QAAU,CAACA,EAAE,eAAc,EAClC,KAAK,SAAS,IAAIA,EAAGlf,CAAO,EACnBkf,EAAE,eAAc,IACrB+H,GAAQjnB,EAAQ,oBAAmB,EACrC,KAAK,SAAS,IAAIkf,EAAG+H,CAAI,EAChBjnB,EAAQ,mBAAkB,GACnC,KAAK,SAAS,IAAIkf,EAAGlf,CAAO,KAOhCinB,EAAM,CACR,IAAM9F,EAAK8F,EAAK,QAAO,EACvB,GACE,OAAO9F,GAAO,UAEdA,IAAO,MACPA,IAAO,IACPA,IAAO,IAEP,KAAK,WAAWjC,EAAGiC,EAAI8F,EAAK,KAAI,EAAIjB,CAAQ,UACnC7E,IAAO,KAAM,CAEtB,IAAMiG,EAAKlI,EAAE,QAAUA,EAEvB,KAAK,SAAS,IAAIkI,EAAIH,CAAI,CAC5B,MAAW9F,aAAc,QACvB,KAAK,WAAWjC,EAAGiC,EAAI8F,EAAK,KAAI,EAAIjB,CAAQ,CAEhD,CACF,CAEA,WACE9G,EACAlhB,EACAipB,EACAjB,EAAiB,CAEZhoB,EAAE,KAAKkhB,EAAE,IAAI,IACb+H,EAGH,KAAK,SAAS,IAAI/H,EAAG+H,CAAI,EAFzB,KAAK,QAAQ,IAAI/H,EAAG8G,EAAU,EAAK,EAIvC,CAEA,WAAW9G,EAASlhB,EAAWipB,EAAsBjB,EAAiB,CAE/D9G,EAAE,QAAQlhB,CAAC,IACXipB,EAGH,KAAK,SAAS,IAAI/H,EAAG+H,CAAI,EAFzB,KAAK,QAAQ,IAAI/H,EAAG8G,EAAU,EAAK,EAIvC,CAAA,EC9OIqB,GAAa,CACjBC,EACA1P,IAEA,OAAO0P,GAAW,SAAW,IAAI5B,GAAO,CAAC4B,CAAM,EAAG1P,CAAI,EACpD,MAAM,QAAQ0P,CAAM,EAAI,IAAI5B,GAAO4B,EAAQ1P,CAAI,EAC/C0P,EAKkBC,GAAhB,KAAwB,CAC5B,KACA,SACA,KACA,KAAkB,IAAI,IACtB,OAAkB,GAClB,QAAmB,GACnBC,GAA2B,CAAA,EAC3BC,GACAC,GACA,OACA,SACA,oBAGA,YAAYX,EAAqBxf,EAAYqQ,EAAO,CAMlD,GALA,KAAK,SAAWmP,EAChB,KAAK,KAAOxf,EACZ,KAAK,KAAOqQ,EACZ,KAAK8P,GAAO,CAAC9P,EAAK,OAASA,EAAK,WAAa,QAAU,KAAO,IAC9D,KAAK,oBAAsBA,EAAK,sBAAwB,IACpDA,EAAK,QAAU,CAAC,KAAK,uBACvB,KAAK6P,GAAUJ,GAAWzP,EAAK,QAAU,CAAA,EAAIA,CAAI,EAE/C,CAAC,KAAK,qBACN,OAAO,KAAK6P,GAAQ,KAAQ,YAC5B,CACA,IAAM1rB,EAAI,0DACV,MAAM,IAAI,MAAMA,CAAC,CACnB,CAKF,KAAK,SAAW6b,EAAK,UAAY,IAE7BA,EAAK,SACP,KAAK,OAASA,EAAK,OACnB,KAAK,OAAO,iBAAiB,QAAS,IAAK,CACzC,KAAK4P,GAAU,OAAS,CAC1B,CAAC,EAEL,CAEAG,GAASpgB,EAAU,CACjB,OAAO,KAAK,KAAK,IAAIA,CAAI,GAAK,CAAC,CAAC,KAAKkgB,IAAS,UAAUlgB,CAAI,CAC9D,CACAqgB,GAAiBrgB,EAAU,CACzB,MAAO,CAAC,CAAC,KAAKkgB,IAAS,kBAAkBlgB,CAAI,CAC/C,CAGA,OAAK,CACH,KAAK,OAAS,EAChB,CACA,QAAM,CAEJ,GAAI,KAAK,QAAQ,QAAS,OAE1B,KAAK,OAAS,GACd,IAAIoE,EACJ,KAAO,CAAC,KAAK,SAAWA,EAAK,KAAK6b,GAAU,MAAK,IAC/C7b,EAAE,CAEN,CACA,SAASA,EAAa,CAChB,KAAK,QAAQ,UAEZ,KAAK,OAIR,KAAK6b,GAAU,KAAK7b,CAAE,EAHtBA,EAAE,EAKN,CAIA,MAAM,WAAWuT,EAASsH,EAAc,CACtC,GAAIA,GAAS,KAAK,KAAK,MAAO,OAC9B,IAAIqB,EACJ,GAAI,KAAK,KAAK,SAAU,CAEtB,GADAA,EAAM3I,EAAE,eAAc,GAAO,MAAMA,EAAE,SAAQ,EACzC,CAAC2I,EAAK,OACV3I,EAAI2I,CACN,CAEA,IAAM1nB,EADW+e,EAAE,UAAS,GAAM,KAAK,KAAK,KACvB,MAAMA,EAAE,MAAK,EAAKA,EACvC,GAAI,KAAK,KAAK,QAAU,KAAK,KAAK,OAAS/e,GAAG,eAAc,EAAI,CAC9D,IAAMke,EAAS,MAAMle,EAAE,SAAQ,EAE3Bke,IAAWA,EAAO,UAAS,GAAM,KAAK,KAAK,OAC7C,MAAMA,EAAO,MAAK,CAGtB,CACA,OAAO,KAAK,eAAele,EAAGqmB,CAAK,CACrC,CAEA,eAAetH,EAAqBsH,EAAc,CAChD,OACItH,IACG,KAAK,WAAa,KAAYA,EAAE,MAAK,GAAM,KAAK,YAChD,CAACsH,GAAStH,EAAE,WAAU,KACtB,CAAC,KAAK,KAAK,OAAS,CAACA,EAAE,YAAW,KAClC,CAAC,KAAK,KAAK,OACV,CAAC,KAAK,KAAK,QACX,CAACA,EAAE,eAAc,GACjB,CAACA,EAAE,eAAc,GAAI,YAAW,IAClC,CAAC,KAAKyI,GAASzI,CAAC,EAElBA,EACA,MACN,CAEA,eAAeA,EAASsH,EAAc,CACpC,GAAIA,GAAS,KAAK,KAAK,MAAO,OAC9B,IAAIqB,EACJ,GAAI,KAAK,KAAK,SAAU,CAEtB,GADAA,EAAM3I,EAAE,eAAc,GAAMA,EAAE,aAAY,EACtC,CAAC2I,EAAK,OACV3I,EAAI2I,CACN,CAEA,IAAM1nB,EADW+e,EAAE,UAAS,GAAM,KAAK,KAAK,KACvBA,EAAE,UAAS,EAAKA,EACrC,GAAI,KAAK,KAAK,QAAU,KAAK,KAAK,OAAS/e,GAAG,eAAc,EAAI,CAC9D,IAAMke,EAASle,EAAE,aAAY,EACzBke,IAAWA,GAAQ,UAAS,GAAM,KAAK,KAAK,OAC9CA,EAAO,UAAS,CAEpB,CACA,OAAO,KAAK,eAAele,EAAGqmB,CAAK,CACrC,CAKA,YAAYtH,EAAS8G,EAAiB,CACpC,GAAI,KAAK2B,GAASzI,CAAC,EAAG,OAEtB,GAAI,CAAC,KAAK,qBAAuB,KAAKuI,IAAS,IAAK,CAClD,IAAM3B,EAAM,GAAG5G,EAAE,cAAa,CAAE,MAChC,KAAKuI,GAAQ,IAAI3B,CAAG,CACtB,CACA,IAAMvD,EACJ,KAAK,KAAK,WAAa,OAAYyD,EAAW,KAAK,KAAK,SAC1D,KAAK,KAAK,IAAI9G,CAAC,EACf,IAAM4I,EAAO,KAAK,KAAK,MAAQ5I,EAAE,YAAW,EAAK,KAAKwI,GAAO,GAE7D,GAAI,KAAK,KAAK,cACZ,KAAK,UAAUxI,CAAC,UACPqD,EAAK,CACd,IAAMA,EAAM,KAAK,KAAK,MAAQrD,EAAE,cAAa,EAAKA,EAAE,SAAQ,EAC5D,KAAK,UAAUqD,EAAMuF,CAAI,CAC3B,KAAO,CACL,IAAMC,EAAM,KAAK,KAAK,MAAQ7I,EAAE,cAAa,EAAKA,EAAE,SAAQ,EACtDrhB,EACJ,KAAK,KAAK,aAAe,CAACkqB,EAAI,WAAW,KAAO,KAAKL,EAAI,EACvD,IAAM,KAAKA,GACX,GACJ,KAAK,UAAWK,EAAmBlqB,EAAMkqB,EAAMD,EAAzB,IAAMA,CAAuB,CACrD,CACF,CAEA,MAAM,MAAM5I,EAAS8G,EAAmBQ,EAAc,CACpD,IAAMxoB,EAAI,MAAM,KAAK,WAAWkhB,EAAGsH,CAAK,EACpCxoB,GAAG,KAAK,YAAYA,EAAGgoB,CAAQ,CACrC,CAEA,UAAU9G,EAAS8G,EAAmBQ,EAAc,CAClD,IAAMxoB,EAAI,KAAK,eAAekhB,EAAGsH,CAAK,EAClCxoB,GAAG,KAAK,YAAYA,EAAGgoB,CAAQ,CACrC,CAEA,OAAO3H,EAAc0I,EAAqB1T,EAAa,CAEjD,KAAK,QAAQ,SAASA,EAAE,EAE5B,KAAK,QAAQgL,EAAQ0I,EAAU,IAAIH,GAAU,KAAK,IAAI,EAAGvT,CAAE,CAC7D,CAEA,QACEgL,EACA0I,EACAiB,EACA3U,EAAa,CAEb,GAAI,KAAKuU,GAAiBvJ,CAAM,EAAG,OAAOhL,EAAE,EAE5C,GADI,KAAK,QAAQ,SAASA,EAAE,EACxB,KAAK,OAAQ,CACf,KAAK,SAAS,IAAM,KAAK,QAAQgL,EAAQ0I,EAAUiB,EAAW3U,CAAE,CAAC,EACjE,MACF,CACA2U,EAAU,gBAAgB3J,EAAQ0I,CAAQ,EAK1C,IAAIkB,EAAQ,EACN5e,EAAO,IAAK,CACZ,EAAE4e,IAAU,GAAG5U,EAAE,CACvB,EAEA,OAAW,CAACtX,EAAGiqB,EAAUQ,CAAK,IAAKwB,EAAU,QAAQ,QAAO,EACtD,KAAKL,GAAS5rB,CAAC,IACnBksB,IACA,KAAK,MAAMlsB,EAAGiqB,EAAUQ,CAAK,EAAE,KAAK,IAAMnd,EAAI,CAAE,GAGlD,QAAWwH,KAAKmX,EAAU,eAAc,EAAI,CAC1C,GAAI,KAAK,WAAa,KAAYnX,EAAE,MAAK,GAAM,KAAK,SAClD,SAEFoX,IACA,IAAMC,EAAiBrX,EAAE,cAAa,EAClCA,EAAE,cAAa,EACjB,KAAK,QAAQA,EAAGqX,EAAgBF,EAAW3e,CAAI,EAE/CwH,EAAE,UACA,CAACnM,EAAGqc,IAAY,KAAK,QAAQlQ,EAAGkQ,EAASiH,EAAW3e,CAAI,EACxD,EAAI,CAGV,CAEAA,EAAI,CACN,CAEA,QACEgV,EACA0C,EACAiH,EACA3U,EAAa,CAEb2U,EAAYA,EAAU,cAAc3J,EAAQ0C,CAAO,EAEnD,IAAIkH,EAAQ,EACN5e,EAAO,IAAK,CACZ,EAAE4e,IAAU,GAAG5U,EAAE,CACvB,EAEA,OAAW,CAACtX,EAAGiqB,EAAUQ,CAAK,IAAKwB,EAAU,QAAQ,QAAO,EACtD,KAAKL,GAAS5rB,CAAC,IACnBksB,IACA,KAAK,MAAMlsB,EAAGiqB,EAAUQ,CAAK,EAAE,KAAK,IAAMnd,EAAI,CAAE,GAElD,OAAW,CAACgV,EAAQ0I,CAAQ,IAAKiB,EAAU,SAAS,QAAO,EACzDC,IACA,KAAK,QAAQ5J,EAAQ0I,EAAUiB,EAAU,MAAK,EAAI3e,CAAI,EAGxDA,EAAI,CACN,CAEA,WAAWgV,EAAc0I,EAAqB1T,EAAa,CAErD,KAAK,QAAQ,SAASA,EAAE,EAE5B,KAAK,YAAYgL,EAAQ0I,EAAU,IAAIH,GAAU,KAAK,IAAI,EAAGvT,CAAE,CACjE,CAEA,YACEgL,EACA0I,EACAiB,EACA3U,EAAa,CAEb,GAAI,KAAKuU,GAAiBvJ,CAAM,EAAG,OAAOhL,EAAE,EAE5C,GADI,KAAK,QAAQ,SAASA,EAAE,EACxB,KAAK,OAAQ,CACf,KAAK,SAAS,IACZ,KAAK,YAAYgL,EAAQ0I,EAAUiB,EAAW3U,CAAE,CAAC,EAEnD,MACF,CACA2U,EAAU,gBAAgB3J,EAAQ0I,CAAQ,EAK1C,IAAIkB,EAAQ,EACN5e,EAAO,IAAK,CACZ,EAAE4e,IAAU,GAAG5U,EAAE,CACvB,EAEA,OAAW,CAACtX,EAAGiqB,EAAUQ,CAAK,IAAKwB,EAAU,QAAQ,QAAO,EACtD,KAAKL,GAAS5rB,CAAC,GACnB,KAAK,UAAUA,EAAGiqB,EAAUQ,CAAK,EAGnC,QAAW3V,KAAKmX,EAAU,eAAc,EAAI,CAC1C,GAAI,KAAK,WAAa,KAAYnX,EAAE,MAAK,GAAM,KAAK,SAClD,SAEFoX,IACA,IAAMxK,EAAW5M,EAAE,YAAW,EAC9B,KAAK,YAAYA,EAAG4M,EAAUuK,EAAW3e,CAAI,CAC/C,CAEAA,EAAI,CACN,CAEA,YACEgV,EACA0C,EACAiH,EACA3U,EAAa,CAEb2U,EAAYA,EAAU,cAAc3J,EAAQ0C,CAAO,EAEnD,IAAIkH,EAAQ,EACN5e,EAAO,IAAK,CACZ,EAAE4e,IAAU,GAAG5U,EAAE,CACvB,EAEA,OAAW,CAACtX,EAAGiqB,EAAUQ,CAAK,IAAKwB,EAAU,QAAQ,QAAO,EACtD,KAAKL,GAAS5rB,CAAC,GACnB,KAAK,UAAUA,EAAGiqB,EAAUQ,CAAK,EAEnC,OAAW,CAACnI,EAAQ0I,CAAQ,IAAKiB,EAAU,SAAS,QAAO,EACzDC,IACA,KAAK,YAAY5J,EAAQ0I,EAAUiB,EAAU,MAAK,EAAI3e,CAAI,EAG5DA,EAAI,CACN,CAAA,EAGW8e,GAAP,cAEIZ,EAAW,CACnB,QAAU,IAAI,IAEd,YAAYR,EAAqBxf,EAAYqQ,EAAO,CAClD,MAAMmP,EAAUxf,EAAMqQ,CAAI,CAC5B,CAEA,UAAUsH,EAAY,CACpB,KAAK,QAAQ,IAAIA,CAAC,CACpB,CAEA,MAAM,MAAI,CACR,GAAI,KAAK,QAAQ,QAAS,MAAM,KAAK,OAAO,OAC5C,OAAI,KAAK,KAAK,UAAS,GACrB,MAAM,KAAK,KAAK,MAAK,EAEvB,MAAM,IAAI,QAAQ,CAAChL,EAAKC,IAAO,CAC7B,KAAK,OAAO,KAAK,KAAM,KAAK,SAAU,IAAK,CACrC,KAAK,QAAQ,QACfA,EAAI,KAAK,OAAO,MAAM,EAEtBD,EAAI,KAAK,OAAO,CAEpB,CAAC,CACH,CAAC,EACM,KAAK,OACd,CAEA,UAAQ,CACN,GAAI,KAAK,QAAQ,QAAS,MAAM,KAAK,OAAO,OAC5C,OAAI,KAAK,KAAK,UAAS,GACrB,KAAK,KAAK,UAAS,EAGrB,KAAK,WAAW,KAAK,KAAM,KAAK,SAAU,IAAK,CAC7C,GAAI,KAAK,QAAQ,QAAS,MAAM,KAAK,OAAO,MAC9C,CAAC,EACM,KAAK,OACd,CAAA,EAGWkU,GAAP,cAEIb,EAAW,CACnB,QAEA,YAAYR,EAAqBxf,EAAYqQ,EAAO,CAClD,MAAMmP,EAAUxf,EAAMqQ,CAAI,EAC1B,KAAK,QAAU,IAAI1C,GAA+B,CAChD,OAAQ,KAAK,OACb,WAAY,EAAA,CACb,EACD,KAAK,QAAQ,GAAG,QAAS,IAAM,KAAK,OAAM,CAAE,EAC5C,KAAK,QAAQ,GAAG,SAAU,IAAM,KAAK,OAAM,CAAE,CAC/C,CAEA,UAAUgK,EAAY,CACpB,KAAK,QAAQ,MAAMA,CAAC,EACf,KAAK,QAAQ,SAAS,KAAK,MAAK,CACvC,CAEA,QAAM,CACJ,IAAMb,EAAS,KAAK,KACpB,OAAIA,EAAO,UAAS,EAClBA,EAAO,MAAK,EAAG,KAAK,IAAK,CACvB,KAAK,OAAOA,EAAQ,KAAK,SAAU,IAAM,KAAK,QAAQ,IAAG,CAAE,CAC7D,CAAC,EAED,KAAK,OAAOA,EAAQ,KAAK,SAAU,IAAM,KAAK,QAAQ,IAAG,CAAE,EAEtD,KAAK,OACd,CAEA,YAAU,CACR,OAAI,KAAK,KAAK,UAAS,GACrB,KAAK,KAAK,UAAS,EAErB,KAAK,WAAW,KAAK,KAAM,KAAK,SAAU,IAAM,KAAK,QAAQ,IAAG,CAAE,EAC3D,KAAK,OACd,CAAA,EP1dI/W,GAEF,OAAO,SAAY,UACnB,SACA,OAAO,QAAQ,UAAa,SAE5B,QAAQ,SACR,QAqWS+gB,GAAP,KAAW,CACf,SACA,IACA,KACA,IACA,YACA,OACA,OACA,cACA,KACA,UACA,SACA,QACA,OACA,MACA,MACA,WACA,QACA,SACA,SACA,OACA,KACA,OACA,qBACA,cACA,oBAKA,KAKA,SAcA,YAAYroB,EAA4B4X,EAAU,CAEhD,GAAI,CAACA,EAAM,MAAM,IAAI,UAAU,uBAAuB,EA8BtD,GA5BA,KAAK,cAAgB,CAAC,CAACA,EAAK,cAC5B,KAAK,OAASA,EAAK,OACnB,KAAK,OAAS,CAAC,CAACA,EAAK,OACrB,KAAK,IAAM,CAAC,CAACA,EAAK,IAClB,KAAK,YAAc,CAAC,CAACA,EAAK,YAC1B,KAAK,MAAQ,CAAC,CAACA,EAAK,MACpB,KAAK,KAAO,CAAC,CAACA,EAAK,KACdA,EAAK,KAECA,EAAK,eAAe,KAAOA,EAAK,IAAI,WAAW,SAAS,KACjEA,EAAK,IAAMvd,GAAcud,EAAK,GAAG,GAFjC,KAAK,IAAM,GAIb,KAAK,IAAMA,EAAK,KAAO,GACvB,KAAK,KAAOA,EAAK,KACjB,KAAK,cAAgB,CAAC,CAACA,EAAK,cAC5B,KAAK,QAAU,CAAC,CAACA,EAAK,QACtB,KAAK,MAAQ,CAAC,CAACA,EAAK,MACpB,KAAK,SAAW,CAAC,CAACA,EAAK,SACvB,KAAK,SAAWA,EAAK,SACrB,KAAK,oBAAsBA,EAAK,sBAAwB,GAExD,KAAK,WAAa,CAAC,CAACA,EAAK,WACzB,KAAK,UAAY,CAAC,CAACA,EAAK,UACxB,KAAK,SACH,OAAOA,EAAK,UAAa,SAAWA,EAAK,SAAW,IACtD,KAAK,KAAO,CAAC,CAACA,EAAK,KACnB,KAAK,OAASA,EAAK,OAEf,KAAK,eAAiB,KAAK,WAAa,OAC1C,MAAM,IAAI,MAAM,4CAA4C,EAgB9D,GAbI,OAAO5X,GAAY,WACrBA,EAAU,CAACA,CAAO,GAGpB,KAAK,qBACH,CAAC,CAAC4X,EAAK,sBACNA,EAA0C,qBACzC,GAEA,KAAK,uBACP5X,EAAUA,EAAQ,IAAIhC,GAAKA,EAAE,QAAQ,MAAO,GAAG,CAAC,GAG9C,KAAK,UAAW,CAClB,GAAI4Z,EAAK,WACP,MAAM,IAAI,UAAU,iCAAiC,EAEvD5X,EAAUA,EAAQ,IAAIhC,GAAMA,EAAE,SAAS,GAAG,EAAIA,EAAI,QAAQA,CAAC,EAAG,CAChE,CAMA,GAJA,KAAK,QAAUgC,EAEf,KAAK,SAAW4X,EAAK,UAAYtQ,GACjC,KAAK,KAAO,CAAE,GAAGsQ,EAAM,SAAU,KAAK,QAAQ,EAC1CA,EAAK,QAEP,GADA,KAAK,OAASA,EAAK,OAEjBA,EAAK,SAAW,QAChBA,EAAK,SAAWA,EAAK,OAAO,OAE5B,MAAM,IAAI,MAAM,kDAAkD,MAE/D,CACL,IAAM0Q,EACJ1Q,EAAK,WAAa,QAAU6J,GAC1B7J,EAAK,WAAa,SAAW8L,GAC7B9L,EAAK,SAAW4L,GAChBI,GACJ,KAAK,OAAS,IAAI0E,EAAO,KAAK,IAAK,CACjC,OAAQ1Q,EAAK,OACb,GAAIA,EAAK,EAAA,CACV,CACH,CACA,KAAK,OAAS,KAAK,OAAO,OAM1B,IAAM2Q,EACJ,KAAK,WAAa,UAAY,KAAK,WAAa,QAE5CC,EAAwB,CAC5B,eAAgB,IAChB,GAAG5Q,EACH,IAAK,KAAK,IACV,UAAW,KAAK,UAChB,QAAS,KAAK,QAEd,OAAQ,KAAK,OACb,gBAAA2Q,EACA,UAAW,GACX,MAAO,KAAK,MACZ,SAAU,GACV,kBAAmB,EACnB,SAAU,KAAK,SACf,qBAAsB,KAAK,qBAC3B,MAAO,CAAC,CAAC,KAAK,KAAK,KAAA,EAGfE,EAAM,KAAK,QAAQ,IAAIzqB,GAAK,IAAI6H,GAAU7H,EAAGwqB,CAAG,CAAC,EACjD,CAACE,EAAU5f,CAAS,EAAI2f,EAAI,OAChC,CAAChgB,EAA4B1M,KAC3B0M,EAAI,CAAC,EAAE,KAAK,GAAG1M,EAAE,GAAG,EACpB0M,EAAI,CAAC,EAAE,KAAK,GAAG1M,EAAE,SAAS,EACnB0M,GAET,CAAC,CAAA,EAAI,CAAA,CAAE,CAAC,EAEV,KAAK,SAAWigB,EAAS,IAAI,CAACjgB,EAAKlM,IAAK,CACtC,IAAMkpB,EAAI3c,EAAUvM,CAAC,EAErB,GAAI,CAACkpB,EAAG,MAAM,IAAI,MAAM,wBAAwB,EAEhD,OAAO,IAAIxB,GAAQxb,EAAKgd,EAAG,EAAG,KAAK,QAAQ,CAC7C,CAAC,CACH,CAMA,MAAM,MAAI,CAKR,MAAO,CACL,GAAI,MAAM,IAAI0C,GAAW,KAAK,SAAU,KAAK,OAAO,IAAK,CACvD,GAAG,KAAK,KACR,SACE,KAAK,WAAa,IAChB,KAAK,SAAW,KAAK,OAAO,IAAI,MAAK,EACrC,IACJ,SAAU,KAAK,SACf,OAAQ,KAAK,OACb,oBAAqB,KAAK,mBAAA,CAC3B,EAAE,KAAI,CAAA,CAEX,CAMA,UAAQ,CACN,MAAO,CACL,GAAG,IAAIA,GAAW,KAAK,SAAU,KAAK,OAAO,IAAK,CAChD,GAAG,KAAK,KACR,SACE,KAAK,WAAa,IAChB,KAAK,SAAW,KAAK,OAAO,IAAI,MAAK,EACrC,IACJ,SAAU,KAAK,SACf,OAAQ,KAAK,OACb,oBAAqB,KAAK,mBAAA,CAC3B,EAAE,SAAQ,CAAA,CAEf,CAMA,QAAM,CACJ,OAAO,IAAIC,GAAW,KAAK,SAAU,KAAK,OAAO,IAAK,CACpD,GAAG,KAAK,KACR,SACE,KAAK,WAAa,IAChB,KAAK,SAAW,KAAK,OAAO,IAAI,MAAK,EACrC,IACJ,SAAU,KAAK,SACf,OAAQ,KAAK,OACb,oBAAqB,KAAK,mBAAA,CAC3B,EAAE,OAAM,CACX,CAMA,YAAU,CACR,OAAO,IAAIA,GAAW,KAAK,SAAU,KAAK,OAAO,IAAK,CACpD,GAAG,KAAK,KACR,SACE,KAAK,WAAa,IAChB,KAAK,SAAW,KAAK,OAAO,IAAI,MAAK,EACrC,IACJ,SAAU,KAAK,SACf,OAAQ,KAAK,OACb,oBAAqB,KAAK,mBAAA,CAC3B,EAAE,WAAU,CACf,CAMA,aAAW,CACT,OAAO,KAAK,WAAU,EAAG,OAAO,QAAQ,EAAC,CAC3C,CACA,CAAC,OAAO,QAAQ,GAAC,CACf,OAAO,KAAK,YAAW,CACzB,CAMA,SAAO,CACL,OAAO,KAAK,OAAM,EAAG,OAAO,aAAa,EAAC,CAC5C,CACA,CAAC,OAAO,aAAa,GAAC,CACpB,OAAO,KAAK,QAAO,CACrB,CAAA,EQ/nBWhkB,GAAW,CACtBpE,EACA7B,EAAuB,CAAA,IACZ,CACN,MAAM,QAAQ6B,CAAO,IACxBA,EAAU,CAACA,CAAO,GAEpB,QAAWhC,KAAKgC,EACd,GAAI,IAAI6F,GAAU7H,EAAGG,CAAO,EAAE,SAAQ,EAAI,MAAO,GAEnD,MAAO,EACT,EC4BM,SAAUwqB,GACd3oB,EACA7B,EAAuB,CAAA,EAAE,CAEzB,OAAO,IAAIkqB,GAAKroB,EAAS7B,CAAO,EAAE,WAAU,CAC9C,CAsBM,SAAUyqB,GACd5oB,EACA7B,EAAuB,CAAA,EAAE,CAEzB,OAAO,IAAIkqB,GAAKroB,EAAS7B,CAAO,EAAE,OAAM,CAC1C,CAqBM,SAAU0qB,GACd7oB,EACA7B,EAAuB,CAAA,EAAE,CAEzB,OAAO,IAAIkqB,GAAKroB,EAAS7B,CAAO,EAAE,SAAQ,CAC5C,CAwBA,eAAe2qB,GACb9oB,EACA7B,EAAuB,CAAA,EAAE,CAEzB,OAAO,IAAIkqB,GAAKroB,EAAS7B,CAAO,EAAE,KAAI,CACxC,CAqBM,SAAU4qB,GACd/oB,EACA7B,EAAuB,CAAA,EAAE,CAEzB,OAAO,IAAIkqB,GAAKroB,EAAS7B,CAAO,EAAE,YAAW,CAC/C,CAqBM,SAAU6qB,GACdhpB,EACA7B,EAAuB,CAAA,EAAE,CAEzB,OAAO,IAAIkqB,GAAKroB,EAAS7B,CAAO,EAAE,QAAO,CAC3C,CAGO,IAAM8qB,GAAaN,GACbO,GAAS,OAAO,OAAON,GAAY,CAAE,KAAMD,EAAc,CAAE,EAC3DQ,GAAcJ,GACdK,GAAU,OAAO,OAAOJ,GAAa,CAChD,KAAMD,EAAAA,CACP,EACYxF,GAAO,OAAO,OAAOsF,GAAU,CAC1C,OAAQF,GACR,QAASI,EAAAA,CACV,EAEYvoB,GAAO,OAAO,OAAOsoB,GAAO,CACvC,KAAMA,GACN,SAAAD,GACA,KAAAtF,GACA,WAAAqF,GACA,OAAAM,GACA,eAAAP,GACA,WAAAM,GACA,YAAAD,GACA,QAAAI,GACA,gBAAAL,GACA,YAAAI,GACA,KAAAd,GACA,SAAAjkB,GACA,OAAAuB,GACA,SAAAlE,EAAAA,CACD,EACDjB,GAAK,KAAOA,GC/NZ,OAAS,WAAA6oB,OAAe,OCAxB,OAEE,SAAAC,GACA,aAAAC,GACA,QAAAC,GAEA,YAAAC,OACK,KAwDA,IAAMC,GAAWC,GAA+C,CACrE,GAAI,CAACA,EACHA,EAAO,CAAE,KAAM,GAAK,UACX,OAAOA,GAAS,SACzBA,EAAO,CAAE,KAAM,IAAO,GAAGA,CAAI,UACpB,OAAOA,GAAS,SACzBA,EAAO,CAAE,KAAMA,CAAI,UACV,OAAOA,GAAS,SACzBA,EAAO,CAAE,KAAM,SAASA,EAAM,CAAC,CAAC,MAEhC,OAAM,IAAI,UAAU,0BAA0B,EAGhD,IAAMC,EAAWD,EACXE,EAASF,EAAK,IAAM,CAAA,EAE1B,OAAAA,EAAK,MAAQA,EAAK,OAASE,EAAO,OAASP,GAE3CK,EAAK,WAAaA,EAAK,WACnBA,EAAK,WACL,MACEG,EACAC,IAEO,IAAI,QAA4B,CAACC,EAAKC,IAC3CL,EAAS,MAAME,EAAMC,EAAS,CAACG,EAAIC,IACjCD,EAAKD,EAAIC,CAAE,EAAIF,EAAIG,CAAI,CAAC,CACzB,EAITR,EAAK,KAAOA,EAAK,MAAQE,EAAO,MAAQL,GACxCG,EAAK,UAAYA,EAAK,UAClBA,EAAK,UACL,MAAOG,GACL,IAAI,QAAQ,CAACE,EAAKC,IAChBL,EAAS,KAAKE,EAAM,CAACM,EAAKC,IAAWD,EAAMH,EAAIG,CAAG,EAAIJ,EAAIK,CAAK,CAAE,CAAC,EAG1EV,EAAK,SAAWA,EAAK,UAAYE,EAAO,UAAYJ,GACpDE,EAAK,UAAYA,EAAK,WAAaE,EAAO,WAAaN,GAEhDK,CACT,EDvGO,IAAMU,GAAmB,CAC9BC,EACAC,EACAC,IAC6B,CAC7B,IAAMC,EAASC,GAAQJ,CAAI,EACrBK,EAAO,CAAE,GAAGC,GAAQL,CAAO,EAAG,UAAW,EAAK,EAEpD,GAAIE,IAAWH,EACb,GAAI,CACF,OAAOK,EAAK,UAAUL,EAAMK,CAAI,QACzBE,EAAI,CAGX,IAAMC,EAAMD,EACZ,GAAIC,GAAOA,EAAI,OAAS,SACtB,MAAMD,EAER,OAIJ,GAAI,CACF,OAAAF,EAAK,UAAUL,EAAMK,CAAI,EAClBH,GAAQF,QACRO,EAAI,CACX,IAAMC,EAAMD,EACZ,GAAIC,GAAOA,EAAI,OAAS,SACtB,OAAOT,GAAiBC,EAAMK,EAAMN,GAAiBI,EAAQE,EAAMH,CAAI,CAAC,EAE1E,GAAIM,GAAOA,EAAI,OAAS,UAAYA,GAAOA,EAAI,OAAS,QACtD,MAAMD,EAER,GAAI,CACF,GAAI,CAACF,EAAK,SAASL,CAAI,EAAE,YAAW,EAAI,MAAMO,OACpC,CACV,MAAMA,GAGZ,EAEaE,GAAe,OAAO,OACjC,MACET,EACAC,EACAC,IACsC,CACtC,IAAMG,EAAOC,GAAQL,CAAO,EAC5BI,EAAK,UAAY,GACjB,IAAMF,EAASC,GAAQJ,CAAI,EAC3B,OAAIG,IAAWH,EACNK,EAAK,WAAWL,EAAMK,CAAI,EAAE,MAAME,GAAK,CAG5C,IAAMC,EAAMD,EACZ,GAAIC,GAAOA,EAAI,OAAS,SACtB,MAAMD,CAEV,CAAC,EAGIF,EAAK,WAAWL,EAAMK,CAAI,EAAE,KACjC,IAAMH,GAAQF,EACd,MAAMO,GAAK,CACT,IAAMC,EAAMD,EACZ,GAAIC,GAAOA,EAAI,OAAS,SACtB,OAAOC,GAAaN,EAAQE,CAAI,EAAE,KAC/BH,GAAqCO,GAAaT,EAAMK,EAAMH,CAAI,CAAC,EAGxE,GAAIM,GAAOA,EAAI,OAAS,UAAYA,EAAI,OAAS,QAC/C,MAAMD,EAER,OAAOF,EAAK,UAAUL,CAAI,EAAE,KAC1BU,GAAK,CACH,GAAIA,EAAG,YAAW,EAChB,OAAOR,EAEP,MAAMK,CAEV,EACA,IAAK,CACH,MAAMA,CACR,CAAC,CAEL,CAAC,CAEL,EACA,CAAE,KAAMR,EAAgB,CAAE,EE3F5B,OAAS,WAAAY,OAAe,OCAxB,OAAS,WAAAC,OAAe,OAGjB,IAAMC,GAAW,MACtBC,EACAC,EACAC,IAC+B,CAE/B,GAAIA,IAASD,EAIb,OAAOD,EAAK,UAAUC,CAAM,EAAE,KAC5BE,GAAOA,EAAG,YAAW,EAAKD,EAAO,OACjCE,GAAK,CACH,IAAMC,EAAMD,EACZ,OAAOC,GAAOA,EAAI,OAAS,SACvBN,GAASC,EAAMF,GAAQG,CAAM,EAAGA,CAAM,EACtC,MACN,CAAC,CAEL,EAEaK,GAAe,CAC1BN,EACAC,EACAC,IACsB,CACtB,GAAIA,IAASD,EAIb,GAAI,CACF,OAAOD,EAAK,SAASC,CAAM,EAAE,YAAW,EAAKC,EAAO,aAC7CE,EAAI,CACX,IAAMC,EAAMD,EACZ,OAAOC,GAAOA,EAAI,OAAS,SACvBC,GAAaN,EAAMF,GAAQG,CAAM,EAAGA,CAAM,EAC1C,OAER,EDpCO,IAAMM,GAAmB,CAC9BC,EACAC,IAC6B,CAC7B,IAAMC,EAAOC,GAAQF,CAAO,EAG5B,GAFAC,EAAK,UAAY,GACFE,GAAQJ,CAAI,IACZA,EACb,OAAOE,EAAK,UAAUF,EAAME,CAAI,EAGlC,IAAMG,EAAOC,GAAaJ,EAAMF,CAAI,EACpC,GAAI,CACF,OAAAE,EAAK,UAAUF,EAAME,CAAI,EAClBG,QACAE,EAAI,CACX,IAAMC,EAAMD,EACZ,GAAIC,GAAOA,EAAI,OAAS,SACtB,OAAOC,GAAiBT,EAAME,CAAI,EAElC,MAAMK,EAGZ,EAEaG,GAAe,OAAO,OACjC,MACEV,EACAC,IACsC,CACtC,IAAMC,EAAO,CAAE,GAAGC,GAAQF,CAAO,EAAG,UAAW,EAAI,EAEnD,OADeG,GAAQJ,CAAI,IACZA,EACN,MAAME,EAAK,WAAWF,EAAME,CAAI,EAGlCS,GAAST,EAAMF,CAAI,EAAE,KAAMK,GAChCH,EACG,WAAWF,EAAME,CAAI,EACrB,KAAKU,GAAKP,GAAQO,CAAC,EACnB,MAAML,GAAK,CACV,IAAMC,EAAMD,EACZ,GAAIC,GAAOA,EAAI,OAAS,SACtB,OAAOK,GAAab,EAAME,CAAI,EAE9B,MAAMK,CAEV,CAAC,CAAC,CAER,EACA,CAAE,KAAMR,EAAgB,CAAE,EEtD5B,OAAS,SAAAe,GAAO,WAAAC,OAAe,OAD/B,IAAMC,GAAW,QAAQ,IAAI,6BAA+B,QAAQ,SAEvDC,GAAWC,GAAgB,CACtC,GAAI,KAAK,KAAKA,CAAI,EAEhB,MAAM,OAAO,OACX,IAAI,UAAU,0CAA0C,EACxD,CACE,KAAAA,EACA,KAAM,wBACP,EAKL,GADAA,EAAOH,GAAQG,CAAI,EACfF,KAAa,QAAS,CACxB,IAAMG,EAAc,YACd,CAAE,KAAAC,CAAI,EAAKN,GAAMI,CAAI,EAC3B,GAAIC,EAAY,KAAKD,EAAK,UAAUE,EAAK,MAAM,CAAC,EAC9C,MAAM,OAAO,OAAO,IAAI,MAAM,6BAA6B,EAAG,CAC5D,KAAAF,EACA,KAAM,SACP,EAIL,OAAOA,CACT,EC3BA,OAAS,SAAAG,GAAO,aAAAC,OAAiB,KAGjC,IAAMC,GAAU,QAAQ,IAAI,iCAAmC,QAAQ,QACjEC,GAAUD,GAAQ,QAAQ,KAAM,EAAE,EAAE,MAAM,GAAG,EAC7CE,GAAY,CAACD,GAAQ,CAAC,EAAI,IAAO,CAACA,GAAQ,CAAC,GAAM,IAAM,CAACA,GAAQ,CAAC,GAAK,GAE/DE,GAAiBD,GAEzBE,GAAyBC,GAAQD,CAAI,EAAE,YAAcE,GADtD,IAAM,GAGGC,GAAY,OAAO,OAC7BL,GAEIE,GAAyBC,GAAQD,CAAI,EAAE,QAAUI,GADlD,IAAM,GAEV,CACE,KAAML,GACP,ECNI,IAAMM,GAAa,CAACC,EAAcC,IAAwB,CAC/DD,EAAOE,GAAQF,CAAI,EACnB,IAAMG,EAAWC,GAAQH,CAAI,EAC7B,OAAOI,GAAcF,CAAQ,EACzBG,GAAiBN,EAAMG,CAAQ,EAC/BI,GAAiBP,EAAMG,CAAQ,CACrC,EAOO,IAAMK,GAAS,OAAO,OAC3B,MAAOC,EAAcC,IAAwB,CAC3CD,EAAOE,GAAQF,CAAI,EACnB,IAAMG,EAAWC,GAAQH,CAAI,EAC7B,OAAOI,GAAUF,CAAQ,EACrBG,GAAaN,EAAMG,CAAQ,EAC3BI,GAAaP,EAAMG,CAAQ,CACjC,EACA,CACE,WAAAK,GACA,aAAAF,GACA,iBAAAG,GACA,aAAAF,GACA,iBAAAG,GAEA,KAAMF,GACN,OAAQF,GACR,WAAYG,GACZ,OAAQF,GACR,WAAYG,GACZ,UAAAL,GACA,cAAAM,GACD,EC5CH,OAAOC,OAAe,iBACtB,OAAS,cAAAC,OAAkB,cAC3B,OACE,aAAAC,GACA,gBAAAC,GACA,YAAAC,GACA,gBAAAC,GACA,gBAAAC,GACA,eAAAC,GACA,cAAAC,OACK,UASP,OAAS,WAAAC,GAAS,YAAAC,GAAU,WAAAC,GAAS,OAAAC,OAAW,YCZhD,IAAMC,GAEF,OAAO,aAAgB,UACvB,aACA,OAAO,YAAY,KAAQ,WAE3B,YACA,KAEEC,GAAS,IAAI,IAMbC,GACJ,OAAO,SAAY,UAAc,QAC/B,QACA,CAAA,EAGEC,GAAc,CAClBC,EACAC,EACAC,EACAC,IACE,CACF,OAAOL,GAAQ,aAAgB,WAC7BA,GAAQ,YAAYE,EAAKC,EAAMC,EAAMC,CAAE,EACvC,QAAQ,MAAM,IAAID,CAAI,KAAKD,CAAI,KAAKD,CAAG,EAAE,CAC7C,EAEII,GAAK,WAAW,gBAChBC,GAAK,WAAW,YAGpB,GAAI,OAAOD,GAAO,IAAa,CAE7BC,GAAK,KAAiB,CACpB,QACA,SAAqC,CAAA,EACrC,OACA,QAAmB,GACnB,iBAAiBC,EAAWH,EAAwB,CAClD,KAAK,SAAS,KAAKA,CAAE,CACvB,CAAA,EAGFC,GAAK,KAAqB,CACxB,aAAA,CACEG,EAAc,CAChB,CACA,OAAS,IAAIF,GACb,MAAMG,EAAW,CACf,GAAI,CAAA,KAAK,OAAO,QAEhB,CAAA,KAAK,OAAO,OAASA,EAErB,KAAK,OAAO,QAAU,GAEtB,QAAWL,KAAM,KAAK,OAAO,SAC3BA,EAAGK,CAAM,EAEX,KAAK,OAAO,UAAUA,CAAM,CAAA,CAC9B,CAAA,EAEF,IAAIC,EACFX,GAAQ,KAAK,8BAAgC,IACzCS,EAAiB,IAAK,CACrBE,IACLA,EAAyB,GACzBV,GACE,maAOA,sBACA,UACAQ,CAAc,EAElB,CACF,CAGA,IAAMG,GAAcR,GAAiB,CAACL,GAAO,IAAIK,CAAI,EAArD,IAMMS,GAAYC,GAChBA,GAAKA,IAAM,KAAK,MAAMA,CAAC,GAAKA,EAAI,GAAK,SAASA,CAAC,EAc3CC,GAAgBC,GACnBH,GAASG,CAAG,EACXA,GAAO,KAAK,IAAI,EAAG,CAAC,EAAI,WACxBA,GAAO,KAAK,IAAI,EAAG,EAAE,EAAI,YACzBA,GAAO,KAAK,IAAI,EAAG,EAAE,EAAI,YACzBA,GAAO,OAAO,iBAAmBC,GACjC,KALe,KAQbA,GAAN,cAAwB,KAAa,CACnC,YAAYC,EAAY,CACtB,MAAMA,CAAI,EACV,KAAK,KAAK,CAAC,CACb,CAAA,EAMIC,GAAN,MAAMC,EAAK,CACT,KACA,OAEA,MAAOC,GAAyB,GAChC,OAAO,OAAOL,EAAW,CACvB,IAAMM,EAAUP,GAAaC,CAAG,EAChC,GAAI,CAACM,EAAS,MAAO,CAAA,EACrBF,GAAMC,GAAgB,GACtB,IAAME,EAAI,IAAIH,GAAMJ,EAAKM,CAAO,EAChC,OAAAF,GAAMC,GAAgB,GACfE,CACT,CACA,YAAYP,EAAaM,EAAyC,CAEhE,GAAI,CAACF,GAAMC,GACT,MAAM,IAAI,UAAU,yCAAyC,EAG/D,KAAK,KAAO,IAAIC,EAAQN,CAAG,EAC3B,KAAK,OAAS,CAChB,CACA,KAAKF,EAAQ,CACX,KAAK,KAAK,KAAK,QAAQ,EAAIA,CAC7B,CACA,KAAG,CACD,OAAO,KAAK,KAAK,EAAE,KAAK,MAAM,CAChC,CAAA,EAi+BWU,GAAP,MAAOC,EAAQ,CAEVC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAKT,IAAI,MAAI,CACN,OAAO,KAAKA,EACd,CAKA,IAKA,cAIA,aAIA,eAIA,eAIA,WAKA,eAIA,YAIA,aAIA,gBAIA,yBAIA,mBAIA,uBAIA,2BAIA,iBAGAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAEAC,GACAC,GACAC,GACAC,GAWA,OAAO,sBAILC,EAAqB,CACrB,MAAO,CAEL,OAAQA,EAAEP,GACV,KAAMO,EAAEN,GACR,gBAAiBM,EAAEL,GACnB,MAAOK,EAAER,GACT,OAAQQ,EAAEjB,GACV,QAASiB,EAAEhB,GACX,QAASgB,EAAEf,GACX,KAAMe,EAAEd,GACR,KAAMc,EAAEb,GACR,IAAI,MAAI,CACN,OAAOa,EAAEZ,EACX,EACA,IAAI,MAAI,CACN,OAAOY,EAAEX,EACX,EACA,KAAMW,EAAEV,GAER,kBAAoBW,GAAWD,EAAEE,GAAmBD,CAAC,EACrD,gBAAiB,CACfE,EACAC,EACAC,EACAC,IAEAN,EAAEO,GACAJ,EACAC,EACAC,EACAC,CAAO,EAEX,WAAaF,GAAwBJ,EAAEQ,GAAYJ,CAAc,EACjE,QAAUC,GAAsCL,EAAES,GAASJ,CAAO,EAClE,SAAWA,GACTL,EAAEU,GAAUL,CAAO,EACrB,QAAUD,GAA8BJ,EAAEW,GAASP,CAAc,CAAA,CAErE,CAOA,IAAI,KAAG,CACL,OAAO,KAAK/B,EACd,CAIA,IAAI,SAAO,CACT,OAAO,KAAKC,EACd,CAIA,IAAI,gBAAc,CAChB,OAAO,KAAKQ,EACd,CAIA,IAAI,MAAI,CACN,OAAO,KAAKD,EACd,CAIA,IAAI,aAAW,CACb,OAAO,KAAKH,EACd,CACA,IAAI,YAAU,CACZ,OAAO,KAAKC,EACd,CAIA,IAAI,SAAO,CACT,OAAO,KAAKJ,EACd,CAIA,IAAI,UAAQ,CACV,OAAO,KAAKC,EACd,CAIA,IAAI,cAAY,CACd,OAAO,KAAKC,EACd,CAEA,YAAY4B,EAAwD,CAClE,GAAM,CACJ,IAAA1C,EAAM,EACN,IAAAiD,EACA,cAAAC,EAAgB,EAChB,aAAAC,EACA,eAAAC,EACA,eAAAC,EACA,WAAAC,EACA,QAAAC,EACA,SAAAC,EACA,aAAAC,EACA,eAAAC,EACA,YAAAC,EACA,QAAAC,EAAU,EACV,aAAAC,EAAe,EACf,gBAAAC,EACA,YAAAC,EACA,WAAAC,EACA,yBAAAC,EACA,mBAAAC,EACA,2BAAAC,EACA,uBAAAC,EACA,iBAAAC,EACA,KAAAC,CAAI,EACF5B,EAEJ,GAAI4B,IAAS,QACP,OAAOA,GAAM,KAAQ,WACvB,MAAM,IAAI,UACR,mDAAmD,EAOzD,GAFA,KAAKrD,GAAQqD,GAAQC,GAEjBvE,IAAQ,GAAK,CAACH,GAASG,CAAG,EAC5B,MAAM,IAAI,UAAU,0CAA0C,EAGhE,IAAMwE,GAAYxE,EAAMD,GAAaC,CAAG,EAAI,MAC5C,GAAI,CAACwE,GACH,MAAM,IAAI,MAAM,sBAAwBxE,CAAG,EAO7C,GAJA,KAAKU,GAAOV,EACZ,KAAKW,GAAWiD,EAChB,KAAK,aAAeC,GAAgB,KAAKlD,GACzC,KAAK,gBAAkBmD,EACnB,KAAK,gBAAiB,CACxB,GAAI,CAAC,KAAKnD,IAAY,CAAC,KAAK,aAC1B,MAAM,IAAI,UACR,oEAAoE,EAGxE,GAAI,OAAO,KAAK,iBAAoB,WAClC,MAAM,IAAI,UAAU,qCAAqC,CAE7D,CAEA,GAAIqD,IAAe,QAAa,OAAOA,GAAe,WACpD,MAAM,IAAI,UAAU,0CAA0C,EAIhE,GAFA,KAAKhD,GAAcgD,EAEfD,IAAgB,QAAa,OAAOA,GAAgB,WACtD,MAAM,IAAI,UAAU,6CAA6C,EAyCnE,GAvCA,KAAKhD,GAAegD,EACpB,KAAK7B,GAAkB,CAAC,CAAC6B,EAEzB,KAAK3C,GAAU,IAAI,IACnB,KAAKC,GAAW,IAAI,MAAMrB,CAAG,EAAE,KAAK,MAAS,EAC7C,KAAKsB,GAAW,IAAI,MAAMtB,CAAG,EAAE,KAAK,MAAS,EAC7C,KAAKuB,GAAQ,IAAIiD,GAAUxE,CAAG,EAC9B,KAAKwB,GAAQ,IAAIgD,GAAUxE,CAAG,EAC9B,KAAKyB,GAAQ,EACb,KAAKC,GAAQ,EACb,KAAKC,GAAQxB,GAAM,OAAOH,CAAG,EAC7B,KAAKkB,GAAQ,EACb,KAAKC,GAAkB,EAEnB,OAAOoC,GAAY,aACrB,KAAK3C,GAAW2C,GAEd,OAAOC,GAAa,aACtB,KAAK3C,GAAY2C,GAEf,OAAOC,GAAiB,YAC1B,KAAK3C,GAAgB2C,EACrB,KAAK7B,GAAY,CAAA,IAEjB,KAAKd,GAAgB,OACrB,KAAKc,GAAY,QAEnB,KAAKK,GAAc,CAAC,CAAC,KAAKrB,GAC1B,KAAKwB,GAAe,CAAC,CAAC,KAAKvB,GAC3B,KAAKsB,GAAmB,CAAC,CAAC,KAAKrB,GAE/B,KAAK,eAAiB,CAAC,CAAC4C,EACxB,KAAK,YAAc,CAAC,CAACC,EACrB,KAAK,yBAA2B,CAAC,CAACM,EAClC,KAAK,2BAA6B,CAAC,CAACE,EACpC,KAAK,uBAAyB,CAAC,CAACC,EAChC,KAAK,iBAAmB,CAAC,CAACC,EAGtB,KAAK,eAAiB,EAAG,CAC3B,GAAI,KAAK1D,KAAa,GAChB,CAACd,GAAS,KAAKc,EAAQ,EACzB,MAAM,IAAI,UACR,iDAAiD,EAIvD,GAAI,CAACd,GAAS,KAAK,YAAY,EAC7B,MAAM,IAAI,UACR,sDAAsD,EAG1D,KAAK4E,GAAuB,CAC9B,CAUA,GARA,KAAK,WAAa,CAAC,CAACnB,EACpB,KAAK,mBAAqB,CAAC,CAACY,EAC5B,KAAK,eAAiB,CAAC,CAACd,EACxB,KAAK,eAAiB,CAAC,CAACC,EACxB,KAAK,cACHxD,GAASqD,CAAa,GAAKA,IAAkB,EAAIA,EAAgB,EACnE,KAAK,aAAe,CAAC,CAACC,EACtB,KAAK,IAAMF,GAAO,EACd,KAAK,IAAK,CACZ,GAAI,CAACpD,GAAS,KAAK,GAAG,EACpB,MAAM,IAAI,UAAU,6CAA6C,EAEnE,KAAK6E,GAAsB,CAC7B,CAGA,GAAI,KAAKhE,KAAS,GAAK,KAAK,MAAQ,GAAK,KAAKC,KAAa,EACzD,MAAM,IAAI,UACR,kDAAkD,EAGtD,GAAI,CAAC,KAAK,cAAgB,CAAC,KAAKD,IAAQ,CAAC,KAAKC,GAAU,CACtD,IAAMgE,GAAO,sBACTC,GAAWD,EAAI,IACjBE,GAAO,IAAIF,EAAI,EAIfG,GAFE,gGAEe,wBAAyBH,GAAMlE,EAAQ,EAE5D,CACF,CAMA,gBAAgBsE,EAAM,CACpB,OAAO,KAAK3D,GAAQ,IAAI2D,CAAG,EAAI,IAAW,CAC5C,CAEAL,IAAsB,CACpB,IAAMM,EAAO,IAAI/E,GAAU,KAAKS,EAAI,EAC9BuE,EAAS,IAAIhF,GAAU,KAAKS,EAAI,EACtC,KAAKqB,GAAQiD,EACb,KAAKlD,GAAUmD,EACf,IAAMC,EACJ,KAAK,aACH,IAAI,MAAiD,KAAKxE,EAAI,EAC9D,OACJ,KAAKsB,GAAmBkD,EAExB,KAAKC,GAAc,CAAC1C,EAAOQ,EAAKmC,EAAQ,KAAKnE,GAAM,IAAG,IAAM,CAU1D,GATAgE,EAAOxC,CAAK,EAAIQ,IAAQ,EAAImC,EAAQ,EACpCJ,EAAKvC,CAAK,EAAIQ,EAIViC,IAAczC,CAAK,IACrB,aAAayC,EAAYzC,CAAK,CAAC,EAC/ByC,EAAYzC,CAAK,EAAI,QAEnBQ,IAAQ,GAAKiC,EAAa,CAC5B,IAAMG,EAAI,WAAW,IAAK,CACpB,KAAKrC,GAASP,CAAK,GACrB,KAAK6C,GAAQ,KAAKjE,GAASoB,CAAK,EAAQ,QAAQ,CAEpD,EAAGQ,EAAM,CAAC,EAGNoC,EAAE,OACJA,EAAE,MAAK,EAGTH,EAAYzC,CAAK,EAAI4C,CACvB,CACF,EAEA,KAAKE,GAAiB9C,GAAQ,CAC5BwC,EAAOxC,CAAK,EAAIuC,EAAKvC,CAAK,IAAM,EAAI,KAAKxB,GAAM,IAAG,EAAK,CACzD,EAEA,KAAKuE,GAAa,CAACC,EAAQhD,IAAS,CAClC,GAAIuC,EAAKvC,CAAK,EAAG,CACf,IAAMQ,EAAM+B,EAAKvC,CAAK,EAChB2C,EAAQH,EAAOxC,CAAK,EAE1B,GAAI,CAACQ,GAAO,CAACmC,EAAO,OACpBK,EAAO,IAAMxC,EACbwC,EAAO,MAAQL,EACfK,EAAO,IAAMC,GAAaC,EAAM,EAChC,IAAMC,EAAMH,EAAO,IAAML,EACzBK,EAAO,aAAexC,EAAM2C,CAC9B,CACF,EAIA,IAAIF,EAAY,EACVC,EAAS,IAAK,CAClB,IAAM,EAAI,KAAK1E,GAAM,IAAG,EACxB,GAAI,KAAK,cAAgB,EAAG,CAC1ByE,EAAY,EACZ,IAAML,EAAI,WAAW,IAAOK,EAAY,EAAI,KAAK,aAAa,EAG1DL,EAAE,OACJA,EAAE,MAAK,CAGX,CACA,OAAO,CACT,EAEA,KAAK,gBAAkBN,GAAM,CAC3B,IAAMtC,EAAQ,KAAKrB,GAAQ,IAAI2D,CAAG,EAClC,GAAItC,IAAU,OACZ,MAAO,GAET,IAAMQ,EAAM+B,EAAKvC,CAAK,EAChB2C,EAAQH,EAAOxC,CAAK,EAC1B,GAAI,CAACQ,GAAO,CAACmC,EACX,MAAO,KAET,IAAMQ,GAAOF,GAAaC,EAAM,GAAMP,EACtC,OAAOnC,EAAM2C,CACf,EAEA,KAAK5C,GAAWP,GAAQ,CACtB,IAAMlC,EAAI0E,EAAOxC,CAAK,EAChB4C,EAAIL,EAAKvC,CAAK,EACpB,MAAO,CAAC,CAAC4C,GAAK,CAAC,CAAC9E,IAAMmF,GAAaC,EAAM,GAAMpF,EAAI8E,CACrD,CACF,CAGAE,GAAyC,IAAK,CAAE,EAChDC,GAAiE,IAAK,CAAE,EACxEL,GAMY,IAAK,CAAE,EAGnBnC,GAAsC,IAAM,GAE5CyB,IAAuB,CACrB,IAAMoB,EAAQ,IAAI5F,GAAU,KAAKS,EAAI,EACrC,KAAKS,GAAkB,EACvB,KAAKU,GAASgE,EACd,KAAKC,GAAkBrD,GAAQ,CAC7B,KAAKtB,IAAmB0E,EAAMpD,CAAK,EACnCoD,EAAMpD,CAAK,EAAI,CACjB,EACA,KAAKsD,GAAe,CAACvD,EAAGwD,EAAG9F,EAAM4D,IAAmB,CAGlD,GAAI,KAAKvB,GAAmByD,CAAC,EAC3B,MAAO,GAET,GAAI,CAACnG,GAASK,CAAI,EAChB,GAAI4D,EAAiB,CACnB,GAAI,OAAOA,GAAoB,WAC7B,MAAM,IAAI,UAAU,oCAAoC,EAG1D,GADA5D,EAAO4D,EAAgBkC,EAAGxD,CAAC,EACvB,CAAC3C,GAASK,CAAI,EAChB,MAAM,IAAI,UACR,0DAA0D,CAGhE,KACE,OAAM,IAAI,UACR,2HAEwB,EAI9B,OAAOA,CACT,EACA,KAAK+F,GAAe,CAClBxD,EACAvC,EACAuF,IACE,CAEF,GADAI,EAAMpD,CAAK,EAAIvC,EACX,KAAKS,GAAU,CACjB,IAAMiD,EAAU,KAAKjD,GAAYkF,EAAMpD,CAAK,EAC5C,KAAO,KAAKtB,GAAkByC,GAC5B,KAAKsC,GAAO,EAAI,CAEpB,CACA,KAAK/E,IAAmB0E,EAAMpD,CAAK,EAC/BgD,IACFA,EAAO,UAAYvF,EACnBuF,EAAO,oBAAsB,KAAKtE,GAEtC,CACF,CAEA2E,GAA0CK,GAAK,CAAE,EACjDF,GAIY,CAACE,EAAIC,EAAIC,IAAO,CAAE,EAC9BN,GAKqB,CACnBO,EACAC,EACArG,EACA4D,IACE,CACF,GAAI5D,GAAQ4D,EACV,MAAM,IAAI,UACR,kEAAkE,EAGtE,MAAO,EACT,EAEA,CAAChB,GAAS,CAAE,WAAAQ,EAAa,KAAK,UAAU,EAAK,CAAA,EAAE,CAC7C,GAAI,KAAKpC,GACP,QAASsF,EAAI,KAAK9E,GACZ,EAAA,CAAC,KAAK+E,GAAcD,CAAC,KAGrBlD,GAAc,CAAC,KAAKN,GAASwD,CAAC,KAChC,MAAMA,GAEJA,IAAM,KAAK/E,MAGb+E,EAAI,KAAKhF,GAAMgF,CAAC,CAIxB,CAEA,CAACzD,GAAU,CAAE,WAAAO,EAAa,KAAK,UAAU,EAAK,CAAA,EAAE,CAC9C,GAAI,KAAKpC,GACP,QAASsF,EAAI,KAAK/E,GACZ,EAAA,CAAC,KAAKgF,GAAcD,CAAC,KAGrBlD,GAAc,CAAC,KAAKN,GAASwD,CAAC,KAChC,MAAMA,GAEJA,IAAM,KAAK9E,MAGb8E,EAAI,KAAKjF,GAAMiF,CAAC,CAIxB,CAEAC,GAAchE,EAAY,CACxB,OACEA,IAAU,QACV,KAAKrB,GAAQ,IAAI,KAAKC,GAASoB,CAAK,CAAM,IAAMA,CAEpD,CAMA,CAAC,SAAO,CACN,QAAW+D,KAAK,KAAK1D,GAAQ,EAEzB,KAAKxB,GAASkF,CAAC,IAAM,QACrB,KAAKnF,GAASmF,CAAC,IAAM,QACrB,CAAC,KAAKjE,GAAmB,KAAKjB,GAASkF,CAAC,CAAC,IAEzC,KAAM,CAAC,KAAKnF,GAASmF,CAAC,EAAG,KAAKlF,GAASkF,CAAC,CAAC,EAG/C,CAQA,CAAC,UAAQ,CACP,QAAWA,KAAK,KAAKzD,GAAS,EAE1B,KAAKzB,GAASkF,CAAC,IAAM,QACrB,KAAKnF,GAASmF,CAAC,IAAM,QACrB,CAAC,KAAKjE,GAAmB,KAAKjB,GAASkF,CAAC,CAAC,IAEzC,KAAM,CAAC,KAAKnF,GAASmF,CAAC,EAAG,KAAKlF,GAASkF,CAAC,CAAC,EAG/C,CAMA,CAAC,MAAI,CACH,QAAWA,KAAK,KAAK1D,GAAQ,EAAI,CAC/B,IAAMN,EAAI,KAAKnB,GAASmF,CAAC,EACrBhE,IAAM,QAAa,CAAC,KAAKD,GAAmB,KAAKjB,GAASkF,CAAC,CAAC,IAC9D,MAAMhE,EAEV,CACF,CAQA,CAAC,OAAK,CACJ,QAAWgE,KAAK,KAAKzD,GAAS,EAAI,CAChC,IAAMP,EAAI,KAAKnB,GAASmF,CAAC,EACrBhE,IAAM,QAAa,CAAC,KAAKD,GAAmB,KAAKjB,GAASkF,CAAC,CAAC,IAC9D,MAAMhE,EAEV,CACF,CAMA,CAAC,QAAM,CACL,QAAWgE,KAAK,KAAK1D,GAAQ,EACjB,KAAKxB,GAASkF,CAAC,IACf,QAAa,CAAC,KAAKjE,GAAmB,KAAKjB,GAASkF,CAAC,CAAC,IAC9D,MAAM,KAAKlF,GAASkF,CAAC,EAG3B,CAQA,CAAC,SAAO,CACN,QAAWA,KAAK,KAAKzD,GAAS,EAClB,KAAKzB,GAASkF,CAAC,IACf,QAAa,CAAC,KAAKjE,GAAmB,KAAKjB,GAASkF,CAAC,CAAC,IAC9D,MAAM,KAAKlF,GAASkF,CAAC,EAG3B,CAMA,CAAC,OAAO,QAAQ,GAAC,CACf,OAAO,KAAK,QAAO,CACrB,CAOA,CAAC,OAAO,WAAW,EAAI,WAMvB,KACEE,EACAC,EAA4C,CAAA,EAAE,CAE9C,QAAW,KAAK,KAAK7D,GAAQ,EAAI,CAC/B,IAAMkD,EAAI,KAAK1E,GAAS,CAAC,EACnBsF,EAAQ,KAAKrE,GAAmByD,CAAC,EAAIA,EAAE,qBAAuBA,EACpE,GAAIY,IAAU,QACVF,EAAGE,EAAO,KAAKvF,GAAS,CAAC,EAAQ,IAAI,EACvC,OAAO,KAAK,IAAI,KAAKA,GAAS,CAAC,EAAQsF,CAAU,CAErD,CACF,CAaA,QACED,EACAG,EAAa,KAAI,CAEjB,QAAW,KAAK,KAAK/D,GAAQ,EAAI,CAC/B,IAAMkD,EAAI,KAAK1E,GAAS,CAAC,EACnBsF,EAAQ,KAAKrE,GAAmByD,CAAC,EAAIA,EAAE,qBAAuBA,EAChEY,IAAU,QACdF,EAAG,KAAKG,EAAOD,EAAO,KAAKvF,GAAS,CAAC,EAAQ,IAAI,CACnD,CACF,CAMA,SACEqF,EACAG,EAAa,KAAI,CAEjB,QAAW,KAAK,KAAK9D,GAAS,EAAI,CAChC,IAAMiD,EAAI,KAAK1E,GAAS,CAAC,EACnBsF,EAAQ,KAAKrE,GAAmByD,CAAC,EAAIA,EAAE,qBAAuBA,EAChEY,IAAU,QACdF,EAAG,KAAKG,EAAOD,EAAO,KAAKvF,GAAS,CAAC,EAAQ,IAAI,CACnD,CACF,CAMA,YAAU,CACR,IAAIyF,EAAU,GACd,QAAWN,KAAK,KAAKzD,GAAU,CAAE,WAAY,EAAI,CAAE,EAC7C,KAAKC,GAASwD,CAAC,IACjB,KAAKlB,GAAQ,KAAKjE,GAASmF,CAAC,EAAQ,QAAQ,EAC5CM,EAAU,IAGd,OAAOA,CACT,CAcA,KAAK/B,EAAM,CACT,IAAMyB,EAAI,KAAKpF,GAAQ,IAAI2D,CAAG,EAC9B,GAAIyB,IAAM,OAAW,OACrB,IAAMR,EAAI,KAAK1E,GAASkF,CAAC,EAGnBI,EACJ,KAAKrE,GAAmByD,CAAC,EAAIA,EAAE,qBAAuBA,EACxD,GAAIY,IAAU,OAAW,OAEzB,IAAMG,EAA2B,CAAE,MAAAH,CAAK,EACxC,GAAI,KAAK7E,IAAS,KAAKD,GAAS,CAC9B,IAAMmB,EAAM,KAAKlB,GAAMyE,CAAC,EAClBpB,EAAQ,KAAKtD,GAAQ0E,CAAC,EAC5B,GAAIvD,GAAOmC,EAAO,CAChB,IAAM4B,EAAS/D,GAAO,KAAKhC,GAAM,IAAG,EAAKmE,GACzC2B,EAAM,IAAMC,EACZD,EAAM,MAAQ,KAAK,IAAG,CACxB,CACF,CACA,OAAI,KAAKlF,KACPkF,EAAM,KAAO,KAAKlF,GAAO2E,CAAC,GAErBO,CACT,CAeA,MAAI,CACF,IAAME,EAAgC,CAAA,EACtC,QAAWT,KAAK,KAAK1D,GAAS,CAAE,WAAY,EAAI,CAAE,EAAG,CACnD,IAAMiC,EAAM,KAAK1D,GAASmF,CAAC,EACrBR,EAAI,KAAK1E,GAASkF,CAAC,EACnBI,EACJ,KAAKrE,GAAmByD,CAAC,EAAIA,EAAE,qBAAuBA,EACxD,GAAIY,IAAU,QAAa7B,IAAQ,OAAW,SAC9C,IAAMgC,EAA2B,CAAE,MAAAH,CAAK,EACxC,GAAI,KAAK7E,IAAS,KAAKD,GAAS,CAC9BiF,EAAM,IAAM,KAAKhF,GAAMyE,CAAC,EAGxB,IAAMZ,EAAM,KAAK3E,GAAM,IAAG,EAAM,KAAKa,GAAQ0E,CAAC,EAC9CO,EAAM,MAAQ,KAAK,MAAM,KAAK,IAAG,EAAKnB,CAAG,CAC3C,CACI,KAAK/D,KACPkF,EAAM,KAAO,KAAKlF,GAAO2E,CAAC,GAE5BS,EAAI,QAAQ,CAAClC,EAAKgC,CAAK,CAAC,CAC1B,CACA,OAAOE,CACT,CAWA,KAAKA,EAA6B,CAChC,KAAK,MAAK,EACV,OAAW,CAAClC,EAAKgC,CAAK,IAAKE,EAAK,CAC9B,GAAIF,EAAM,MAAO,CAOf,IAAMnB,EAAM,KAAK,IAAG,EAAKmB,EAAM,MAC/BA,EAAM,MAAQ,KAAK9F,GAAM,IAAG,EAAK2E,CACnC,CACA,KAAK,IAAIb,EAAKgC,EAAM,MAAOA,CAAK,CAClC,CACF,CAgCA,IACEvE,EACAwD,EACAkB,EAA4C,CAAA,EAAE,CAE9C,GAAIlB,IAAM,OACR,OAAA,KAAK,OAAOxD,CAAC,EACN,KAET,GAAM,CACJ,IAAAS,EAAM,KAAK,IACX,MAAAmC,EACA,eAAA1B,EAAiB,KAAK,eACtB,gBAAAI,EAAkB,KAAK,gBACvB,OAAA2B,CAAM,EACJyB,EACA,CAAE,YAAAvD,EAAc,KAAK,WAAW,EAAKuD,EAEnChH,EAAO,KAAK6F,GAChBvD,EACAwD,EACAkB,EAAW,MAAQ,EACnBpD,CAAe,EAIjB,GAAI,KAAK,cAAgB5D,EAAO,KAAK,aACnC,OAAIuF,IACFA,EAAO,IAAM,OACbA,EAAO,qBAAuB,IAGhC,KAAKH,GAAQ9C,EAAG,KAAK,EACd,KAET,IAAIC,EAAQ,KAAKvB,KAAU,EAAI,OAAY,KAAKE,GAAQ,IAAIoB,CAAC,EAC7D,GAAIC,IAAU,OAEZA,EACE,KAAKvB,KAAU,EAAI,KAAKQ,GACtB,KAAKC,GAAM,SAAW,EAAI,KAAKA,GAAM,IAAG,EACxC,KAAKT,KAAU,KAAKR,GAAO,KAAKwF,GAAO,EAAK,EAC5C,KAAKhF,GACT,KAAKG,GAASoB,CAAK,EAAID,EACvB,KAAKlB,GAASmB,CAAK,EAAIuD,EACvB,KAAK5E,GAAQ,IAAIoB,EAAGC,CAAK,EACzB,KAAKlB,GAAM,KAAKG,EAAK,EAAIe,EACzB,KAAKjB,GAAMiB,CAAK,EAAI,KAAKf,GACzB,KAAKA,GAAQe,EACb,KAAKvB,KACL,KAAK+E,GAAaxD,EAAOvC,EAAMuF,CAAM,EACjCA,IAAQA,EAAO,IAAM,OACzB9B,EAAc,GACV,KAAKvB,IACP,KAAKvB,KAAYmF,EAAQxD,EAAG,KAAK,MAE9B,CAEL,KAAKK,GAAYJ,CAAK,EACtB,IAAM0E,EAAS,KAAK7F,GAASmB,CAAK,EAClC,GAAIuD,IAAMmB,EAAQ,CAChB,GAAI,KAAKjF,IAAmB,KAAKK,GAAmB4E,CAAM,EAAG,CAC3DA,EAAO,kBAAkB,MAAM,IAAI,MAAM,UAAU,CAAC,EACpD,GAAM,CAAE,qBAAsB5G,CAAC,EAAK4G,EAChC5G,IAAM,QAAa,CAACmD,IAClB,KAAKzB,IACP,KAAKrB,KAAWL,EAAQiC,EAAG,KAAK,EAE9B,KAAKL,IACP,KAAKP,IAAW,KAAK,CAACrB,EAAQiC,EAAG,KAAK,CAAC,EAG7C,MAAYkB,IACN,KAAKzB,IACP,KAAKrB,KAAWuG,EAAa3E,EAAG,KAAK,EAEnC,KAAKL,IACP,KAAKP,IAAW,KAAK,CAACuF,EAAa3E,EAAG,KAAK,CAAC,GAMhD,GAHA,KAAKsD,GAAgBrD,CAAK,EAC1B,KAAKwD,GAAaxD,EAAOvC,EAAMuF,CAAM,EACrC,KAAKnE,GAASmB,CAAK,EAAIuD,EACnBP,EAAQ,CACVA,EAAO,IAAM,UACb,IAAM2B,EACJD,GAAU,KAAK5E,GAAmB4E,CAAM,EACtCA,EAAO,qBACPA,EACAC,IAAa,SAAW3B,EAAO,SAAW2B,EAChD,CACF,MAAW3B,IACTA,EAAO,IAAM,UAGX,KAAKrD,IACP,KAAK,WAAW4D,EAAQxD,EAAGwD,IAAMmB,EAAS,SAAW,SAAS,CAElE,CAUA,GATIlE,IAAQ,GAAK,CAAC,KAAKlB,IACrB,KAAK2C,GAAsB,EAEzB,KAAK3C,KACF4B,GACH,KAAKwB,GAAY1C,EAAOQ,EAAKmC,CAAK,EAEhCK,GAAQ,KAAKD,GAAWC,EAAQhD,CAAK,GAEvC,CAACiB,GAAkB,KAAKvB,IAAoB,KAAKP,GAAW,CAC9D,IAAMyF,EAAK,KAAKzF,GACZ0F,EACJ,KAAQA,EAAOD,GAAI,MAAK,GACtB,KAAKvG,KAAgB,GAAGwG,CAAI,CAEhC,CACA,OAAO,IACT,CAMA,KAAG,CACD,GAAI,CACF,KAAO,KAAKpG,IAAO,CACjB,IAAMqG,EAAM,KAAKjG,GAAS,KAAKG,EAAK,EAEpC,GADA,KAAKyE,GAAO,EAAI,EACZ,KAAK3D,GAAmBgF,CAAG,GAC7B,GAAIA,EAAI,qBACN,OAAOA,EAAI,6BAEJA,IAAQ,OACjB,OAAOA,CAEX,CACF,QAAA,CACE,GAAI,KAAKpF,IAAoB,KAAKP,GAAW,CAC3C,IAAMyF,EAAK,KAAKzF,GACZ0F,EACJ,KAAQA,EAAOD,GAAI,MAAK,GACtB,KAAKvG,KAAgB,GAAGwG,CAAI,CAEhC,CACF,CACF,CAEApB,GAAOsB,EAAa,CAClB,IAAMC,EAAO,KAAKhG,GACZe,EAAI,KAAKnB,GAASoG,CAAI,EACtBzB,EAAI,KAAK1E,GAASmG,CAAI,EAC5B,OAAI,KAAKvF,IAAmB,KAAKK,GAAmByD,CAAC,EACnDA,EAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC,GACrC,KAAK/D,IAAe,KAAKE,MAC9B,KAAKF,IACP,KAAKrB,KAAWoF,EAAGxD,EAAG,OAAO,EAE3B,KAAKL,IACP,KAAKP,IAAW,KAAK,CAACoE,EAAGxD,EAAG,OAAO,CAAC,GAGxC,KAAKsD,GAAgB2B,CAAI,EACrB,KAAKzF,KAAmByF,CAAI,IAC9B,aAAa,KAAKzF,GAAiByF,CAAI,CAAC,EACxC,KAAKzF,GAAiByF,CAAI,EAAI,QAG5BD,IACF,KAAKnG,GAASoG,CAAI,EAAI,OACtB,KAAKnG,GAASmG,CAAI,EAAI,OACtB,KAAK9F,GAAM,KAAK8F,CAAI,GAElB,KAAKvG,KAAU,GACjB,KAAKO,GAAQ,KAAKC,GAAQ,EAC1B,KAAKC,GAAM,OAAS,GAEpB,KAAKF,GAAQ,KAAKF,GAAMkG,CAAI,EAE9B,KAAKrG,GAAQ,OAAOoB,CAAC,EACrB,KAAKtB,KACEuG,CACT,CAkBA,IAAIjF,EAAMkF,EAA4C,CAAA,EAAE,CACtD,GAAM,CAAE,eAAArE,EAAiB,KAAK,eAAgB,OAAAoC,CAAM,EAAKiC,EACnDjF,EAAQ,KAAKrB,GAAQ,IAAIoB,CAAC,EAChC,GAAIC,IAAU,OAAW,CACvB,IAAMuD,EAAI,KAAK1E,GAASmB,CAAK,EAC7B,GACE,KAAKF,GAAmByD,CAAC,GACzBA,EAAE,uBAAyB,OAE3B,MAAO,GAET,GAAK,KAAKhD,GAASP,CAAK,EASbgD,IACTA,EAAO,IAAM,QACb,KAAKD,GAAWC,EAAQhD,CAAK,OAV7B,QAAIY,GACF,KAAKkC,GAAe9C,CAAK,EAEvBgD,IACFA,EAAO,IAAM,MACb,KAAKD,GAAWC,EAAQhD,CAAK,GAExB,EAKX,MAAWgD,IACTA,EAAO,IAAM,QAEf,MAAO,EACT,CASA,KAAKjD,EAAMmF,EAA8C,CAAA,EAAE,CACzD,GAAM,CAAE,WAAArE,EAAa,KAAK,UAAU,EAAKqE,EACnClF,EAAQ,KAAKrB,GAAQ,IAAIoB,CAAC,EAChC,GAAIC,IAAU,QAAc,CAACa,GAAc,KAAKN,GAASP,CAAK,EAC5D,OAEF,IAAMuD,EAAI,KAAK1E,GAASmB,CAAK,EAE7B,OAAO,KAAKF,GAAmByD,CAAC,EAAIA,EAAE,qBAAuBA,CAC/D,CAEApD,GACEJ,EACAC,EACAC,EACAC,EAAY,CAEZ,IAAMqD,EAAIvD,IAAU,OAAY,OAAY,KAAKnB,GAASmB,CAAK,EAC/D,GAAI,KAAKF,GAAmByD,CAAC,EAC3B,OAAOA,EAGT,IAAM4B,EAAK,IAAIC,GACT,CAAE,OAAAC,CAAM,EAAKpF,EAEnBoF,GAAQ,iBAAiB,QAAS,IAAMF,EAAG,MAAME,EAAO,MAAM,EAAG,CAC/D,OAAQF,EAAG,MAAA,CACZ,EAED,IAAMG,EAAY,CAChB,OAAQH,EAAG,OACX,QAAAlF,EACA,QAAAC,CAAAA,EAGIqF,EAAK,CAAChC,EAAkBiC,EAAc,KAAwB,CAClE,GAAM,CAAE,QAAAC,CAAO,EAAKN,EAAG,OACjBO,EAAczF,EAAQ,kBAAoBsD,IAAM,OAChDoC,EAAU1F,EAAQ,kBACtB,CAAC,EAAEA,EAAQ,wBAA0BsD,IAAM,QAU7C,GATItD,EAAQ,SACNwF,GAAW,CAACD,GACdvF,EAAQ,OAAO,aAAe,GAC9BA,EAAQ,OAAO,WAAakF,EAAG,OAAO,OAClCO,IAAazF,EAAQ,OAAO,kBAAoB,KAEpDA,EAAQ,OAAO,cAAgB,IAG/BwF,GAAW,CAACC,GAAe,CAACF,EAC9B,OAAOI,EAAUT,EAAG,OAAO,OAAQQ,CAAO,EAG5C,IAAME,EAAKhG,EAILiG,EAAK,KAAKjH,GAASmB,CAAc,EACvC,OAAI8F,IAAOjG,GAAM6F,GAAeF,GAAeM,IAAO,UAChDvC,IAAM,OACJsC,EAAG,uBAAyB,OAC9B,KAAKhH,GAASmB,CAAc,EAAI6F,EAAG,qBAEnC,KAAKhD,GAAQ9C,EAAG,OAAO,GAGrBE,EAAQ,SAAQA,EAAQ,OAAO,aAAe,IAClD,KAAK,IAAIF,EAAGwD,EAAG+B,EAAU,OAAO,IAG7B/B,CACT,EAEMwC,EAAMC,IACN/F,EAAQ,SACVA,EAAQ,OAAO,cAAgB,GAC/BA,EAAQ,OAAO,WAAa+F,GAGvBJ,EAAUI,EAAI,EAAK,GAGtBJ,EAAY,CAACI,EAASL,IAAmC,CAC7D,GAAM,CAAE,QAAAF,CAAO,EAAKN,EAAG,OACjBc,EAAoBR,GAAWxF,EAAQ,uBACvCY,EACJoF,GAAqBhG,EAAQ,2BACzBiG,EAAWrF,GAAcZ,EAAQ,yBACjC4F,EAAKhG,EAgBX,GAfI,KAAKhB,GAASmB,CAAc,IAAMH,IAGxB,CAACqG,GACX,CAACP,GAAWE,EAAG,uBAAyB,OAExC,KAAKhD,GAAQ9C,EAAG,OAAO,EACbkG,IAKV,KAAKpH,GAASmB,CAAc,EAAI6F,EAAG,uBAGnChF,EACF,OAAIZ,EAAQ,QAAU4F,EAAG,uBAAyB,SAChD5F,EAAQ,OAAO,cAAgB,IAE1B4F,EAAG,qBACL,GAAIA,EAAG,aAAeA,EAC3B,MAAMG,CAEV,EAEMG,EAAQ,CACZC,EACAC,IACE,CACF,IAAMC,EAAM,KAAKhI,KAAeyB,EAAGwD,EAAG+B,CAAS,EAC3CgB,GAAOA,aAAe,SACxBA,EAAI,KAAK/C,GAAK6C,EAAI7C,IAAM,OAAY,OAAYA,CAAC,EAAG8C,CAAG,EAKzDlB,EAAG,OAAO,iBAAiB,QAAS,IAAK,EACnC,CAAClF,EAAQ,kBAAoBA,EAAQ,0BACvCmG,EAAI,MAAS,EAETnG,EAAQ,yBACVmG,EAAM7C,GAAKgC,EAAGhC,EAAG,EAAI,GAG3B,CAAC,CACH,EAEItD,EAAQ,SAAQA,EAAQ,OAAO,gBAAkB,IACrD,IAAMJ,EAAI,IAAI,QAAQsG,CAAK,EAAE,KAAKZ,EAAIQ,CAAE,EAClCF,EAAyB,OAAO,OAAOhG,EAAG,CAC9C,kBAAmBsF,EACnB,qBAAsB5B,EACtB,WAAY,MAAA,CACb,EAED,OAAIvD,IAAU,QAEZ,KAAK,IAAID,EAAG8F,EAAI,CAAE,GAAGP,EAAU,QAAS,OAAQ,MAAS,CAAE,EAC3DtF,EAAQ,KAAKrB,GAAQ,IAAIoB,CAAC,GAE1B,KAAKlB,GAASmB,CAAK,EAAI6F,EAElBA,CACT,CAEA/F,GAAmBD,EAAM,CACvB,GAAI,CAAC,KAAKJ,GAAiB,MAAO,GAClC,IAAM8G,EAAI1G,EACV,MACE,CAAC,CAAC0G,GACFA,aAAa,SACbA,EAAE,eAAe,sBAAsB,GACvCA,EAAE,6BAA6BnB,EAEnC,CAyGA,MAAM,MACJrF,EACAyG,EAAgD,CAAA,EAAE,CAElD,GAAM,CAEJ,WAAA3F,EAAa,KAAK,WAClB,eAAAF,EAAiB,KAAK,eACtB,mBAAAc,EAAqB,KAAK,mBAE1B,IAAAjB,EAAM,KAAK,IACX,eAAAS,EAAiB,KAAK,eACtB,KAAAxD,EAAO,EACP,gBAAA4D,EAAkB,KAAK,gBACvB,YAAAH,EAAc,KAAK,YAEnB,yBAAAM,EAA2B,KAAK,yBAChC,2BAAAE,EAA6B,KAAK,2BAClC,iBAAAE,EAAmB,KAAK,iBACxB,uBAAAD,EAAyB,KAAK,uBAC9B,QAAAzB,EACA,aAAAuG,EAAe,GACf,OAAAzD,EACA,OAAAqC,CAAM,EACJmB,EAEJ,GAAI,CAAC,KAAK/G,GACR,OAAIuD,IAAQA,EAAO,MAAQ,OACpB,KAAK,IAAIjD,EAAG,CACjB,WAAAc,EACA,eAAAF,EACA,mBAAAc,EACA,OAAAuB,CAAAA,CACD,EAGH,IAAM/C,EAAU,CACd,WAAAY,EACA,eAAAF,EACA,mBAAAc,EACA,IAAAjB,EACA,eAAAS,EACA,KAAAxD,EACA,gBAAA4D,EACA,YAAAH,EACA,yBAAAM,EACA,2BAAAE,EACA,uBAAAC,EACA,iBAAAC,EACA,OAAAoB,EACA,OAAAqC,CAAAA,EAGErF,EAAQ,KAAKrB,GAAQ,IAAIoB,CAAC,EAC9B,GAAIC,IAAU,OAAW,CACnBgD,IAAQA,EAAO,MAAQ,QAC3B,IAAMnD,EAAI,KAAKM,GAAiBJ,EAAGC,EAAOC,EAASC,CAAO,EAC1D,OAAQL,EAAE,WAAaA,CACzB,KAAO,CAEL,IAAM0D,EAAI,KAAK1E,GAASmB,CAAK,EAC7B,GAAI,KAAKF,GAAmByD,CAAC,EAAG,CAC9B,IAAMmD,GAAQ7F,GAAc0C,EAAE,uBAAyB,OACvD,OAAIP,IACFA,EAAO,MAAQ,WACX0D,KAAO1D,EAAO,cAAgB,KAE7B0D,GAAQnD,EAAE,qBAAwBA,EAAE,WAAaA,CAC1D,CAIA,IAAMoD,EAAU,KAAKpG,GAASP,CAAK,EACnC,GAAI,CAACyG,GAAgB,CAACE,EACpB,OAAI3D,IAAQA,EAAO,MAAQ,OAC3B,KAAK5C,GAAYJ,CAAK,EAClBW,GACF,KAAKmC,GAAe9C,CAAK,EAEvBgD,GAAQ,KAAKD,GAAWC,EAAQhD,CAAK,EAClCuD,EAKT,IAAM1D,EAAI,KAAKM,GAAiBJ,EAAGC,EAAOC,EAASC,CAAO,EAEpD0G,EADW/G,EAAE,uBAAyB,QACfgB,EAC7B,OAAImC,IACFA,EAAO,MAAQ2D,EAAU,QAAU,UAC/BC,GAAYD,IAAS3D,EAAO,cAAgB,KAE3C4D,EAAW/G,EAAE,qBAAwBA,EAAE,WAAaA,CAC7D,CACF,CA8BA,MAAM,WACJE,EACAyG,EAAgD,CAAA,EAAE,CAElD,IAAMjD,EAAI,MAAM,KAAK,MACnBxD,EACAyG,CAE4C,EAE9C,GAAIjD,IAAM,OAAW,MAAM,IAAI,MAAM,4BAA4B,EACjE,OAAOA,CACT,CA+BA,KAAKxD,EAAM8G,EAA8C,CAAA,EAAE,CACzD,IAAMtF,EAAa,KAAKhD,GACxB,GAAI,CAACgD,EACH,MAAM,IAAI,MAAM,uCAAuC,EAEzD,GAAM,CAAE,QAAArB,EAAS,aAAAuG,EAAc,GAAGxG,CAAO,EAAK4G,EACxCtD,EAAI,KAAK,IAAIxD,EAAGE,CAAO,EAC7B,GAAI,CAACwG,GAAgBlD,IAAM,OAAW,OAAOA,EAC7C,IAAMuD,EAAKvF,EAAWxB,EAAGwD,EAAG,CAC1B,QAAAtD,EACA,QAAAC,CAAAA,CACqC,EACvC,OAAA,KAAK,IAAIH,EAAG+G,EAAI7G,CAAO,EAChB6G,CACT,CAQA,IAAI/G,EAAMmE,EAA4C,CAAA,EAAE,CACtD,GAAM,CACJ,WAAArD,EAAa,KAAK,WAClB,eAAAF,EAAiB,KAAK,eACtB,mBAAAc,EAAqB,KAAK,mBAC1B,OAAAuB,CAAM,EACJkB,EACElE,EAAQ,KAAKrB,GAAQ,IAAIoB,CAAC,EAChC,GAAIC,IAAU,OAAW,CACvB,IAAMmE,EAAQ,KAAKtF,GAASmB,CAAK,EAC3B+G,EAAW,KAAKjH,GAAmBqE,CAAK,EAE9C,OADInB,GAAQ,KAAKD,GAAWC,EAAQhD,CAAK,EACrC,KAAKO,GAASP,CAAK,GACjBgD,IAAQA,EAAO,IAAM,SAEpB+D,GAQD/D,GACAnC,GACAsD,EAAM,uBAAyB,SAE/BnB,EAAO,cAAgB,IAElBnC,EAAasD,EAAM,qBAAuB,SAb5C1C,GACH,KAAKoB,GAAQ9C,EAAG,QAAQ,EAEtBiD,GAAUnC,IAAYmC,EAAO,cAAgB,IAC1CnC,EAAasD,EAAQ,UAY1BnB,IAAQA,EAAO,IAAM,OAMrB+D,EACK5C,EAAM,sBAEf,KAAK/D,GAAYJ,CAAK,EAClBW,GACF,KAAKmC,GAAe9C,CAAK,EAEpBmE,GAEX,MAAWnB,IACTA,EAAO,IAAM,OAEjB,CAEAgE,GAASnH,EAAUxC,EAAQ,CACzB,KAAK0B,GAAM1B,CAAC,EAAIwC,EAChB,KAAKf,GAAMe,CAAC,EAAIxC,CAClB,CAEA+C,GAAYJ,EAAY,CASlBA,IAAU,KAAKf,KACbe,IAAU,KAAKhB,GACjB,KAAKA,GAAQ,KAAKF,GAAMkB,CAAK,EAE7B,KAAKgH,GACH,KAAKjI,GAAMiB,CAAK,EAChB,KAAKlB,GAAMkB,CAAK,CAAU,EAG9B,KAAKgH,GAAS,KAAK/H,GAAOe,CAAK,EAC/B,KAAKf,GAAQe,EAEjB,CAOA,OAAOD,EAAI,CACT,OAAO,KAAK8C,GAAQ9C,EAAG,QAAQ,CACjC,CAEA8C,GAAQ9C,EAAMkH,EAA8B,CAC1C,IAAI5C,EAAU,GACd,GAAI,KAAK5F,KAAU,EAAG,CACpB,IAAMuB,EAAQ,KAAKrB,GAAQ,IAAIoB,CAAC,EAChC,GAAIC,IAAU,OAMZ,GALI,KAAKT,KAAmBS,CAAK,IAC/B,aAAa,KAAKT,KAAmBS,CAAK,CAAC,EAC3C,KAAKT,GAAiBS,CAAK,EAAI,QAEjCqE,EAAU,GACN,KAAK5F,KAAU,EACjB,KAAKyI,GAAOD,CAAM,MACb,CACL,KAAK5D,GAAgBrD,CAAK,EAC1B,IAAMuD,EAAI,KAAK1E,GAASmB,CAAK,EAc7B,GAbI,KAAKF,GAAmByD,CAAC,EAC3BA,EAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC,GACrC,KAAK/D,IAAe,KAAKE,MAC9B,KAAKF,IACP,KAAKrB,KAAWoF,EAAQxD,EAAGkH,CAAM,EAE/B,KAAKvH,IACP,KAAKP,IAAW,KAAK,CAACoE,EAAQxD,EAAGkH,CAAM,CAAC,GAG5C,KAAKtI,GAAQ,OAAOoB,CAAC,EACrB,KAAKnB,GAASoB,CAAK,EAAI,OACvB,KAAKnB,GAASmB,CAAK,EAAI,OACnBA,IAAU,KAAKf,GACjB,KAAKA,GAAQ,KAAKF,GAAMiB,CAAK,UACpBA,IAAU,KAAKhB,GACxB,KAAKA,GAAQ,KAAKF,GAAMkB,CAAK,MACxB,CACL,IAAMmH,EAAK,KAAKpI,GAAMiB,CAAK,EAC3B,KAAKlB,GAAMqI,CAAE,EAAI,KAAKrI,GAAMkB,CAAK,EACjC,IAAMoH,EAAK,KAAKtI,GAAMkB,CAAK,EAC3B,KAAKjB,GAAMqI,CAAE,EAAI,KAAKrI,GAAMiB,CAAK,CACnC,CACA,KAAKvB,KACL,KAAKS,GAAM,KAAKc,CAAK,CACvB,CAEJ,CACA,GAAI,KAAKN,IAAoB,KAAKP,IAAW,OAAQ,CACnD,IAAMyF,EAAK,KAAKzF,GACZ0F,EACJ,KAAQA,EAAOD,GAAI,MAAK,GACtB,KAAKvG,KAAgB,GAAGwG,CAAI,CAEhC,CACA,OAAOR,CACT,CAKA,OAAK,CACH,OAAO,KAAK6C,GAAO,QAAQ,CAC7B,CACAA,GAAOD,EAA8B,CACnC,QAAWjH,KAAS,KAAKM,GAAU,CAAE,WAAY,EAAI,CAAE,EAAG,CACxD,IAAMiD,EAAI,KAAK1E,GAASmB,CAAK,EAC7B,GAAI,KAAKF,GAAmByD,CAAC,EAC3BA,EAAE,kBAAkB,MAAM,IAAI,MAAM,SAAS,CAAC,MACzC,CACL,IAAMxD,EAAI,KAAKnB,GAASoB,CAAK,EACzB,KAAKR,IACP,KAAKrB,KAAWoF,EAAQxD,EAAQkH,CAAM,EAEpC,KAAKvH,IACP,KAAKP,IAAW,KAAK,CAACoE,EAAQxD,EAAQkH,CAAM,CAAC,CAEjD,CACF,CAKA,GAHA,KAAKtI,GAAQ,MAAK,EAClB,KAAKE,GAAS,KAAK,MAAS,EAC5B,KAAKD,GAAS,KAAK,MAAS,EACxB,KAAKU,IAAS,KAAKD,GAAS,CAC9B,KAAKC,GAAM,KAAK,CAAC,EACjB,KAAKD,GAAQ,KAAK,CAAC,EACnB,QAAWuD,KAAK,KAAKrD,IAAoB,CAAA,EACnCqD,IAAM,QAAW,aAAaA,CAAC,EAErC,KAAKrD,IAAkB,KAAK,MAAS,CACvC,CASA,GARI,KAAKH,IACP,KAAKA,GAAO,KAAK,CAAC,EAEpB,KAAKJ,GAAQ,EACb,KAAKC,GAAQ,EACb,KAAKC,GAAM,OAAS,EACpB,KAAKR,GAAkB,EACvB,KAAKD,GAAQ,EACT,KAAKiB,IAAoB,KAAKP,GAAW,CAC3C,IAAMyF,EAAK,KAAKzF,GACZ0F,EACJ,KAAQA,EAAOD,GAAI,MAAK,GACtB,KAAKvG,KAAgB,GAAGwG,CAAI,CAEhC,CACF,CAAA,ECx4FF,OAAS,SAAAwC,GAAO,SAAAC,OAAa,YAE7B,OAAS,iBAAAC,OAAqB,WAE9B,OACE,aAAAC,GACA,WAAWC,GACX,eAAAC,GACA,gBAAAC,GACA,gBAAgBC,OACX,KACP,UAAYC,OAAc,UAM1B,OAAS,SAAAC,GAAO,WAAAC,GAAS,YAAAC,GAAU,YAAAC,OAAgB,mBCXnD,OAAS,gBAAAC,OAAoB,cAC7B,OAAOC,OAAY,cACnB,OAAS,iBAAAC,OAAqB,sBAT9B,IAAMC,GACJ,OAAO,SAAY,UAAY,QAC3B,QACA,CACE,OAAQ,KACR,OAAQ,MAiBHC,GACXC,GAEA,CAAC,CAACA,GACF,OAAOA,GAAM,WACZA,aAAaC,IACZD,aAAaJ,IACbM,GAAWF,CAAC,GACZG,GAAWH,CAAC,GAKHE,GAAcF,GACzB,CAAC,CAACA,GACF,OAAOA,GAAM,UACbA,aAAaL,IACb,OAAQK,EAAwB,MAAS,YAExCA,EAAwB,OAASJ,GAAO,SAAS,UAAU,KAKjDO,GAAcH,GACzB,CAAC,CAACA,GACF,OAAOA,GAAM,UACbA,aAAaL,IACb,OAAQK,EAAwB,OAAU,YAC1C,OAAQA,EAAwB,KAAQ,WAEpCI,GAAM,OAAO,KAAK,EAClBC,GAAiB,OAAO,cAAc,EACtCC,GAAc,OAAO,YAAY,EACjCC,GAAe,OAAO,aAAa,EACnCC,GAAgB,OAAO,cAAc,EACrCC,GAAS,OAAO,QAAQ,EACxBC,GAAO,OAAO,MAAM,EACpBC,GAAQ,OAAO,OAAO,EACtBC,GAAa,OAAO,YAAY,EAChCC,GAAW,OAAO,UAAU,EAC5BC,GAAU,OAAO,SAAS,EAC1BC,EAAU,OAAO,SAAS,EAC1BC,GAAS,OAAO,QAAQ,EACxBC,GAAS,OAAO,QAAQ,EACxBC,EAAS,OAAO,QAAQ,EACxBC,GAAQ,OAAO,OAAO,EACtBC,EAAe,OAAO,cAAc,EACpCC,GAAa,OAAO,YAAY,EAChCC,GAAc,OAAO,aAAa,EAClCC,EAAa,OAAO,YAAY,EAEhCC,EAAY,OAAO,WAAW,EAE9BC,GAAQ,OAAO,OAAO,EACtBC,GAAW,OAAO,UAAU,EAC5BC,GAAU,OAAO,SAAS,EAC1BC,GAAW,OAAO,UAAU,EAC5BC,GAAQ,OAAO,OAAO,EACtBC,GAAQ,OAAO,OAAO,EACtBC,GAAU,OAAO,SAAS,EAC1BC,GAAS,OAAO,QAAQ,EACxBC,GAAgB,OAAO,eAAe,EACtCC,GAAY,OAAO,WAAW,EAE9BC,GAASC,GAA6B,QAAQ,QAAO,EAAG,KAAKA,CAAE,EAC/DC,GAAWD,GAA6BA,EAAE,EAM1CE,GAAYC,GAChBA,IAAO,OAASA,IAAO,UAAYA,IAAO,YAEtCC,GAAqBC,GACzBA,aAAa,aACZ,CAAC,CAACA,GACD,OAAOA,GAAM,UACbA,EAAE,aACFA,EAAE,YAAY,OAAS,eACvBA,EAAE,YAAc,EAEdC,GAAqBD,GACzB,CAAC,OAAO,SAASA,CAAC,GAAK,YAAY,OAAOA,CAAC,EAqBvCE,GAAN,KAAU,CACR,IACA,KACA,KACA,QACA,YACEC,EACAC,EACAC,EAAiB,CAEjB,KAAK,IAAMF,EACX,KAAK,KAAOC,EACZ,KAAK,KAAOC,EACZ,KAAK,QAAU,IAAMF,EAAI3B,EAAM,EAAC,EAChC,KAAK,KAAK,GAAG,QAAS,KAAK,OAAO,CACpC,CACA,QAAM,CACJ,KAAK,KAAK,eAAe,QAAS,KAAK,OAAO,CAChD,CAGA,YAAY8B,EAAQ,CAAG,CAEvB,KAAG,CACD,KAAK,OAAM,EACP,KAAK,KAAK,KAAK,KAAK,KAAK,IAAG,CAClC,GASIC,GAAN,cAAiCL,EAAO,CACtC,QAAM,CACJ,KAAK,IAAI,eAAe,QAAS,KAAK,WAAW,EACjD,MAAM,OAAM,CACd,CACA,YACEC,EACAC,EACAC,EAAiB,CAEjB,MAAMF,EAAKC,EAAMC,CAAI,EACrB,KAAK,YAAcG,GAAMJ,EAAK,KAAK,QAASI,CAAE,EAC9CL,EAAI,GAAG,QAAS,KAAK,WAAW,CAClC,GA8IIM,GACJC,GACoC,CAAC,CAACA,EAAE,WAEpCC,GACJD,GAEA,CAACA,EAAE,YAAc,CAAC,CAACA,EAAE,UAAYA,EAAE,WAAa,SAarClD,GAAP,cAOIN,EAAY,CAGpB,CAACoB,CAAO,EAAa,GACrB,CAACC,EAAM,EAAa,GACpB,CAACG,EAAK,EAAmB,CAAA,EACzB,CAACD,CAAM,EAAa,CAAA,EACpB,CAACK,CAAU,EACX,CAACV,EAAQ,EACT,CAACgB,EAAK,EACN,CAACf,EAAO,EACR,CAACV,EAAG,EAAa,GACjB,CAACE,EAAW,EAAa,GACzB,CAACC,EAAY,EAAa,GAC1B,CAACE,EAAM,EAAa,GACpB,CAACD,EAAa,EAAa,KAC3B,CAACY,CAAY,EAAY,EACzB,CAACI,CAAS,EAAa,GACvB,CAACQ,EAAM,EACP,CAACD,EAAO,EAAa,GACrB,CAACE,EAAa,EAAY,EAC1B,CAACC,EAAS,EAAa,GAKvB,SAAoB,GAIpB,SAAoB,GAQpB,eACKmB,EAI+B,CAElC,IAAMC,EAAoCD,EAAK,CAAC,GAC9C,CAAA,EAEF,GADA,MAAK,EACDC,EAAQ,YAAc,OAAOA,EAAQ,UAAa,SACpD,MAAM,IAAI,UACR,kDAAkD,EAGlDJ,GAAoBI,CAAO,GAC7B,KAAK/B,CAAU,EAAI,GACnB,KAAKV,EAAQ,EAAI,MACRuC,GAAkBE,CAAO,GAClC,KAAKzC,EAAQ,EAAIyC,EAAQ,SACzB,KAAK/B,CAAU,EAAI,KAEnB,KAAKA,CAAU,EAAI,GACnB,KAAKV,EAAQ,EAAI,MAEnB,KAAKgB,EAAK,EAAI,CAAC,CAACyB,EAAQ,MACxB,KAAKxC,EAAO,EAAI,KAAKD,EAAQ,EACxB,IAAIhB,GAAc,KAAKgB,EAAQ,CAAC,EACjC,KAGAyC,GAAWA,EAAQ,oBAAsB,IAC3C,OAAO,eAAe,KAAM,SAAU,CAAE,IAAK,IAAM,KAAKpC,CAAM,CAAC,CAAE,EAG/DoC,GAAWA,EAAQ,mBAAqB,IAC1C,OAAO,eAAe,KAAM,QAAS,CAAE,IAAK,IAAM,KAAKnC,EAAK,CAAC,CAAE,EAGjE,GAAM,CAAE,OAAAoC,CAAM,EAAKD,EACfC,IACF,KAAKvB,EAAM,EAAIuB,EACXA,EAAO,QACT,KAAKzB,EAAK,EAAC,EAEXyB,EAAO,iBAAiB,QAAS,IAAM,KAAKzB,EAAK,EAAC,CAAE,EAG1D,CAWA,IAAI,cAAY,CACd,OAAO,KAAKV,CAAY,CAC1B,CAKA,IAAI,UAAQ,CACV,OAAO,KAAKP,EAAQ,CACtB,CAKA,IAAI,SAAS2C,EAAI,CACf,MAAM,IAAI,MAAM,4CAA4C,CAC9D,CAKA,YAAYA,EAAuB,CACjC,MAAM,IAAI,MAAM,4CAA4C,CAC9D,CAKA,IAAI,YAAU,CACZ,OAAO,KAAKjC,CAAU,CACxB,CAKA,IAAI,WAAWkC,EAAG,CAChB,MAAM,IAAI,MAAM,8CAA8C,CAChE,CAKA,IAAK,OAAQ,CACX,OAAO,KAAK5B,EAAK,CACnB,CAQA,IAAK,MAAS6B,EAAU,CACtB,KAAK7B,EAAK,EAAI,KAAKA,EAAK,GAAK,CAAC,CAAC6B,CACjC,CAGA,CAAC5B,EAAK,GAAC,CACL,KAAKC,EAAO,EAAI,GAChB,KAAK,KAAK,QAAS,KAAKC,EAAM,GAAG,MAAM,EACvC,KAAK,QAAQ,KAAKA,EAAM,GAAG,MAAM,CACnC,CAKA,IAAI,SAAO,CACT,OAAO,KAAKD,EAAO,CACrB,CAKA,IAAI,QAAQ4B,EAAC,CAAG,CA0BhB,MACEC,EACAC,EACAC,EAAe,CAEf,GAAI,KAAK/B,EAAO,EAAG,MAAO,GAC1B,GAAI,KAAK3B,EAAG,EAAG,MAAM,IAAI,MAAM,iBAAiB,EAEhD,GAAI,KAAKoB,CAAS,EAChB,YAAK,KACH,QACA,OAAO,OACL,IAAI,MAAM,gDAAgD,EAC1D,CAAE,KAAM,sBAAsB,CAAE,CACjC,EAEI,GAGL,OAAOqC,GAAa,aACtBC,EAAKD,EACLA,EAAW,QAGRA,IAAUA,EAAW,QAE1B,IAAMzB,EAAK,KAAKP,EAAK,EAAIM,GAAQE,GAMjC,GAAI,CAAC,KAAKd,CAAU,GAAK,CAAC,OAAO,SAASqC,CAAK,GAC7C,GAAIlB,GAAkBkB,CAAK,EAEzBA,EAAQ,OAAO,KACbA,EAAM,OACNA,EAAM,WACNA,EAAM,UAAU,UAETpB,GAAkBoB,CAAK,EAEhCA,EAAQ,OAAO,KAAKA,CAAK,UAChB,OAAOA,GAAU,SAC1B,MAAM,IAAI,MACR,sDAAsD,EAO5D,OAAI,KAAKrC,CAAU,GAGb,KAAKR,CAAO,GAAK,KAAKK,CAAY,IAAM,GAAG,KAAKT,EAAK,EAAE,EAAI,EAG3D,KAAKI,CAAO,EAAG,KAAK,KAAK,OAAQ6C,CAAyB,EACzD,KAAKvC,EAAU,EAAEuC,CAAyB,EAE3C,KAAKxC,CAAY,IAAM,GAAG,KAAK,KAAK,UAAU,EAE9C0C,GAAI1B,EAAG0B,CAAE,EAEN,KAAK/C,CAAO,GAKf6C,EAAkC,QAStC,OAAOA,GAAU,UAEjB,EAAEC,IAAa,KAAKhD,EAAQ,GAAK,CAAC,KAAKC,EAAO,GAAG,YAGjD8C,EAAQ,OAAO,KAAKA,EAAOC,CAAQ,GAGjC,OAAO,SAASD,CAAK,GAAK,KAAK/C,EAAQ,IAEzC+C,EAAQ,KAAK9C,EAAO,EAAE,MAAM8C,CAAK,GAI/B,KAAK7C,CAAO,GAAK,KAAKK,CAAY,IAAM,GAAG,KAAKT,EAAK,EAAE,EAAI,EAE3D,KAAKI,CAAO,EAAG,KAAK,KAAK,OAAQ6C,CAAyB,EACzD,KAAKvC,EAAU,EAAEuC,CAAyB,EAE3C,KAAKxC,CAAY,IAAM,GAAG,KAAK,KAAK,UAAU,EAE9C0C,GAAI1B,EAAG0B,CAAE,EAEN,KAAK/C,CAAO,IA/Bb,KAAKK,CAAY,IAAM,GAAG,KAAK,KAAK,UAAU,EAC9C0C,GAAI1B,EAAG0B,CAAE,EACN,KAAK/C,CAAO,EA8BvB,CAeA,KAAKgD,EAAiB,CACpB,GAAI,KAAKvC,CAAS,EAAG,OAAO,KAG5B,GAFA,KAAKU,EAAS,EAAI,GAGhB,KAAKd,CAAY,IAAM,GACvB2C,IAAM,GACLA,GAAKA,EAAI,KAAK3C,CAAY,EAE3B,YAAKf,EAAc,EAAC,EACb,KAGL,KAAKkB,CAAU,IAAGwC,EAAI,MAEtB,KAAK7C,CAAM,EAAE,OAAS,GAAK,CAAC,KAAKK,CAAU,IAG7C,KAAKL,CAAM,EAAI,CACZ,KAAKL,EAAQ,EACV,KAAKK,CAAM,EAAE,KAAK,EAAE,EACpB,OAAO,OACL,KAAKA,CAAM,EACX,KAAKE,CAAY,CAAC,IAK5B,IAAM4C,EAAM,KAAKtD,EAAI,EAAEqD,GAAK,KAAM,KAAK7C,CAAM,EAAE,CAAC,CAAU,EAC1D,YAAKb,EAAc,EAAC,EACb2D,CACT,CAEA,CAACtD,EAAI,EAAEqD,EAAkBH,EAAY,CACnC,GAAI,KAAKrC,CAAU,EAAG,KAAKD,EAAW,EAAC,MAClC,CACH,IAAM2C,EAAIL,EACNG,IAAME,EAAE,QAAUF,IAAM,KAAM,KAAKzC,EAAW,EAAC,EAC1C,OAAO2C,GAAM,UACpB,KAAK/C,CAAM,EAAE,CAAC,EAAI+C,EAAE,MAAMF,CAAC,EAC3BH,EAAQK,EAAE,MAAM,EAAGF,CAAC,EACpB,KAAK3C,CAAY,GAAK2C,IAEtB,KAAK7C,CAAM,EAAE,CAAC,EAAI+C,EAAE,SAASF,CAAC,EAC9BH,EAAQK,EAAE,SAAS,EAAGF,CAAC,EACvB,KAAK3C,CAAY,GAAK2C,EAE1B,CAEA,YAAK,KAAK,OAAQH,CAAK,EAEnB,CAAC,KAAK1C,CAAM,EAAE,QAAU,CAAC,KAAKd,EAAG,GAAG,KAAK,KAAK,OAAO,EAElDwD,CACT,CAUA,IACEA,EACAC,EACAC,EAAe,CAEf,OAAI,OAAOF,GAAU,aACnBE,EAAKF,EACLA,EAAQ,QAEN,OAAOC,GAAa,aACtBC,EAAKD,EACLA,EAAW,QAETD,IAAU,QAAW,KAAK,MAAMA,EAAOC,CAAQ,EAC/CC,GAAI,KAAK,KAAK,MAAOA,CAAE,EAC3B,KAAK1D,EAAG,EAAI,GACZ,KAAK,SAAW,IAMZ,KAAKW,CAAO,GAAK,CAAC,KAAKC,EAAM,IAAG,KAAKX,EAAc,EAAC,EACjD,IACT,CAGA,CAACY,EAAM,GAAC,CACF,KAAKO,CAAS,IAEd,CAAC,KAAKS,EAAa,GAAK,CAAC,KAAKd,EAAK,EAAE,SACvC,KAAKe,EAAS,EAAI,IAEpB,KAAKlB,EAAM,EAAI,GACf,KAAKD,CAAO,EAAI,GAChB,KAAK,KAAK,QAAQ,EACd,KAAKG,CAAM,EAAE,OAAQ,KAAKP,EAAK,EAAC,EAC3B,KAAKP,EAAG,EAAG,KAAKC,EAAc,EAAC,EACnC,KAAK,KAAK,OAAO,EACxB,CAWA,QAAM,CACJ,OAAO,KAAKY,EAAM,EAAC,CACrB,CAKA,OAAK,CACH,KAAKF,CAAO,EAAI,GAChB,KAAKC,EAAM,EAAI,GACf,KAAKkB,EAAS,EAAI,EACpB,CAKA,IAAI,WAAS,CACX,OAAO,KAAKV,CAAS,CACvB,CAMA,IAAI,SAAO,CACT,OAAO,KAAKT,CAAO,CACrB,CAKA,IAAI,QAAM,CACR,OAAO,KAAKC,EAAM,CACpB,CAEA,CAACK,EAAU,EAAEuC,EAAY,CACnB,KAAKrC,CAAU,EAAG,KAAKH,CAAY,GAAK,EACvC,KAAKA,CAAY,GAAMwC,EAAkC,OAC9D,KAAK1C,CAAM,EAAE,KAAK0C,CAAK,CACzB,CAEA,CAACtC,EAAW,GAAC,CACX,OAAI,KAAKC,CAAU,EAAG,KAAKH,CAAY,GAAK,EAE1C,KAAKA,CAAY,GACf,KAAKF,CAAM,EAAE,CAAC,EACd,OACG,KAAKA,CAAM,EAAE,MAAK,CAC3B,CAEA,CAACP,EAAK,EAAEuD,EAAmB,GAAK,CAC9B,EAAG,OACD,KAAKtD,EAAU,EAAE,KAAKU,EAAW,EAAC,CAAE,GACpC,KAAKJ,CAAM,EAAE,QAGX,CAACgD,GAAW,CAAC,KAAKhD,CAAM,EAAE,QAAU,CAAC,KAAKd,EAAG,GAAG,KAAK,KAAK,OAAO,CACvE,CAEA,CAACQ,EAAU,EAAEgD,EAAY,CACvB,YAAK,KAAK,OAAQA,CAAK,EAChB,KAAK7C,CAAO,CACrB,CAOA,KAAkC8B,EAASC,EAAkB,CAC3D,GAAI,KAAKtB,CAAS,EAAG,OAAOqB,EAC5B,KAAKX,EAAS,EAAI,GAElB,IAAMiC,EAAQ,KAAK7D,EAAW,EAC9B,OAAAwC,EAAOA,GAAQ,CAAA,EACXD,IAAS/C,GAAK,QAAU+C,IAAS/C,GAAK,OAAQgD,EAAK,IAAM,GACxDA,EAAK,IAAMA,EAAK,MAAQ,GAC7BA,EAAK,YAAc,CAAC,CAACA,EAAK,YAGtBqB,EACErB,EAAK,KAAKD,EAAK,IAAG,GAItB,KAAK1B,EAAK,EAAE,KACT2B,EAAK,YAEF,IAAIE,GAAuB,KAAyBH,EAAMC,CAAI,EAD9D,IAAIH,GAAY,KAAyBE,EAAMC,CAAI,CACY,EAEjE,KAAKjB,EAAK,EAAGM,GAAM,IAAM,KAAKlB,EAAM,EAAC,CAAE,EACtC,KAAKA,EAAM,EAAC,GAGZ4B,CACT,CAUA,OAAoCA,EAAO,CACzC,IAAMuB,EAAI,KAAKjD,EAAK,EAAE,KAAKiD,GAAKA,EAAE,OAASvB,CAAI,EAC3CuB,IACE,KAAKjD,EAAK,EAAE,SAAW,GACrB,KAAKJ,CAAO,GAAK,KAAKkB,EAAa,IAAM,IAC3C,KAAKlB,CAAO,EAAI,IAElB,KAAKI,EAAK,EAAI,CAAA,GACT,KAAKA,EAAK,EAAE,OAAO,KAAKA,EAAK,EAAE,QAAQiD,CAAC,EAAG,CAAC,EACnDA,EAAE,OAAM,EAEZ,CAKA,YACE7B,EACA8B,EAAwC,CAExC,OAAO,KAAK,GAAG9B,EAAI8B,CAAO,CAC5B,CAmBA,GACE9B,EACA8B,EAAwC,CAExC,IAAML,EAAM,MAAM,GAChBzB,EACA8B,CAA+B,EAEjC,GAAI9B,IAAO,OACT,KAAKL,EAAS,EAAI,GAClB,KAAKD,EAAa,IACd,CAAC,KAAKd,EAAK,EAAE,QAAU,CAAC,KAAKJ,CAAO,GACtC,KAAKE,EAAM,EAAC,UAELsB,IAAO,YAAc,KAAKnB,CAAY,IAAM,EACrD,MAAM,KAAK,UAAU,UACZkB,GAASC,CAAE,GAAK,KAAKjC,EAAW,EACzC,MAAM,KAAKiC,CAAE,EACb,KAAK,mBAAmBA,CAAE,UACjBA,IAAO,SAAW,KAAK/B,EAAa,EAAG,CAChD,IAAM8D,EAAID,EACN,KAAKxC,EAAK,EAAGM,GAAM,IAAMmC,EAAE,KAAK,KAAM,KAAK9D,EAAa,CAAC,CAAC,EACzD8D,EAAE,KAAK,KAAM,KAAK9D,EAAa,CAAC,CACvC,CACA,OAAOwD,CACT,CAKA,eACEzB,EACA8B,EAAwC,CAExC,OAAO,KAAK,IAAI9B,EAAI8B,CAAO,CAC7B,CAUA,IACE9B,EACA8B,EAAwC,CAExC,IAAML,EAAM,MAAM,IAChBzB,EACA8B,CAA+B,EAKjC,OAAI9B,IAAO,SACT,KAAKN,EAAa,EAAI,KAAK,UAAU,MAAM,EAAE,OAE3C,KAAKA,EAAa,IAAM,GACxB,CAAC,KAAKC,EAAS,GACf,CAAC,KAAKf,EAAK,EAAE,SAEb,KAAKJ,CAAO,EAAI,KAGbiD,CACT,CAUA,mBAA+CzB,EAAU,CACvD,IAAMyB,EAAM,MAAM,mBAAmBzB,CAAiC,EACtE,OAAIA,IAAO,QAAUA,IAAO,UAC1B,KAAKN,EAAa,EAAI,EAClB,CAAC,KAAKC,EAAS,GAAK,CAAC,KAAKf,EAAK,EAAE,SACnC,KAAKJ,CAAO,EAAI,KAGbiD,CACT,CAKA,IAAI,YAAU,CACZ,OAAO,KAAK1D,EAAW,CACzB,CAEA,CAACD,EAAc,GAAC,CAEZ,CAAC,KAAKE,EAAY,GAClB,CAAC,KAAKD,EAAW,GACjB,CAAC,KAAKkB,CAAS,GACf,KAAKN,CAAM,EAAE,SAAW,GACxB,KAAKd,EAAG,IAER,KAAKG,EAAY,EAAI,GACrB,KAAK,KAAK,KAAK,EACf,KAAK,KAAK,WAAW,EACrB,KAAK,KAAK,QAAQ,EACd,KAAKE,EAAM,GAAG,KAAK,KAAK,OAAO,EACnC,KAAKF,EAAY,EAAI,GAEzB,CA0BA,KACEgC,KACGc,EAAmB,CAEtB,IAAMkB,EAAOlB,EAAK,CAAC,EAEnB,GACEd,IAAO,SACPA,IAAO,SACPA,IAAOf,GACP,KAAKA,CAAS,EAEd,MAAO,GACF,GAAIe,IAAO,OAChB,MAAO,CAAC,KAAKhB,CAAU,GAAK,CAACgD,EACzB,GACA,KAAK1C,EAAK,GACTM,GAAM,IAAM,KAAKT,EAAQ,EAAE6C,CAAa,CAAC,EAAG,IAC7C,KAAK7C,EAAQ,EAAE6C,CAAa,EAC3B,GAAIhC,IAAO,MAChB,OAAO,KAAKZ,EAAO,EAAC,EACf,GAAIY,IAAO,QAAS,CAGzB,GAFA,KAAK9B,EAAM,EAAI,GAEX,CAAC,KAAKH,EAAW,GAAK,CAAC,KAAKkB,CAAS,EAAG,MAAO,GACnD,IAAMwC,EAAM,MAAM,KAAK,OAAO,EAC9B,YAAK,mBAAmB,OAAO,EACxBA,CACT,SAAWzB,IAAO,QAAS,CACzB,KAAK/B,EAAa,EAAI+D,EACtB,MAAM,KAAK9C,GAAO8C,CAAI,EACtB,IAAMP,EACJ,CAAC,KAAKhC,EAAM,GAAK,KAAK,UAAU,OAAO,EAAE,OACrC,MAAM,KAAK,QAASuC,CAAI,EACxB,GACN,YAAKlE,EAAc,EAAC,EACb2D,CACT,SAAWzB,IAAO,SAAU,CAC1B,IAAMyB,EAAM,MAAM,KAAK,QAAQ,EAC/B,YAAK3D,EAAc,EAAC,EACb2D,CACT,SAAWzB,IAAO,UAAYA,IAAO,YAAa,CAChD,IAAMyB,EAAM,MAAM,KAAKzB,CAAE,EACzB,YAAK,mBAAmBA,CAAE,EACnByB,CACT,CAGA,IAAMA,EAAM,MAAM,KAAKzB,EAAc,GAAGc,CAAI,EAC5C,YAAKhD,EAAc,EAAC,EACb2D,CACT,CAEA,CAACtC,EAAQ,EAAE6C,EAAW,CACpB,QAAWH,KAAK,KAAKjD,EAAK,EACpBiD,EAAE,KAAK,MAAMG,CAAa,IAAM,IAAO,KAAK,MAAK,EAEvD,IAAMP,EAAM,KAAK9B,EAAS,EAAI,GAAQ,MAAM,KAAK,OAAQqC,CAAI,EAC7D,YAAKlE,EAAc,EAAC,EACb2D,CACT,CAEA,CAACrC,EAAO,GAAC,CACP,OAAI,KAAKrB,EAAW,EAAU,IAE9B,KAAKA,EAAW,EAAI,GACpB,KAAK,SAAW,GACT,KAAKuB,EAAK,GACZM,GAAM,IAAM,KAAKP,EAAQ,EAAC,CAAE,EAAG,IAChC,KAAKA,EAAQ,EAAC,EACpB,CAEA,CAACA,EAAQ,GAAC,CACR,GAAI,KAAKd,EAAO,EAAG,CACjB,IAAMyD,EAAO,KAAKzD,EAAO,EAAE,IAAG,EAC9B,GAAIyD,EAAM,CACR,QAAWH,KAAK,KAAKjD,EAAK,EACxBiD,EAAE,KAAK,MAAMG,CAAa,EAEvB,KAAKrC,EAAS,GAAG,MAAM,KAAK,OAAQqC,CAAI,CAC/C,CACF,CAEA,QAAWH,KAAK,KAAKjD,EAAK,EACxBiD,EAAE,IAAG,EAEP,IAAMJ,EAAM,MAAM,KAAK,KAAK,EAC5B,YAAK,mBAAmB,KAAK,EACtBA,CACT,CAMA,MAAM,SAAO,CACX,IAAMQ,EAAwC,OAAO,OAAO,CAAA,EAAI,CAC9D,WAAY,EACb,EACI,KAAKjD,CAAU,IAAGiD,EAAI,WAAa,GAGxC,IAAMJ,EAAI,KAAK,QAAO,EACtB,YAAK,GAAG,OAAQH,GAAI,CAClBO,EAAI,KAAKP,CAAC,EACL,KAAK1C,CAAU,IAClBiD,EAAI,YAAeP,EAA8B,OACrD,CAAC,EACD,MAAMG,EACCI,CACT,CAQA,MAAM,QAAM,CACV,GAAI,KAAKjD,CAAU,EACjB,MAAM,IAAI,MAAM,6BAA6B,EAE/C,IAAMiD,EAAM,MAAM,KAAK,QAAO,EAC9B,OACE,KAAK3D,EAAQ,EACT2D,EAAI,KAAK,EAAE,EACX,OAAO,OAAOA,EAAiBA,EAAI,UAAU,CAErD,CAKA,MAAM,SAAO,CACX,OAAO,IAAI,QAAc,CAACC,EAASC,IAAU,CAC3C,KAAK,GAAGlD,EAAW,IAAMkD,EAAO,IAAI,MAAM,kBAAkB,CAAC,CAAC,EAC9D,KAAK,GAAG,QAASzB,GAAMyB,EAAOzB,CAAE,CAAC,EACjC,KAAK,GAAG,MAAO,IAAMwB,EAAO,CAAE,CAChC,CAAC,CACH,CAOA,CAAC,OAAO,aAAa,GAAC,CAGpB,KAAKvC,EAAS,EAAI,GAClB,IAAIyC,EAAU,GACRC,EAAO,UACX,KAAK,MAAK,EACVD,EAAU,GACH,CAAE,MAAO,OAAW,KAAM,EAAI,GA2CvC,MAAO,CACL,KA1CW,IAA2C,CACtD,GAAIA,EAAS,OAAOC,EAAI,EACxB,IAAMC,EAAM,KAAK,KAAI,EACrB,GAAIA,IAAQ,KAAM,OAAO,QAAQ,QAAQ,CAAE,KAAM,GAAO,MAAOA,CAAG,CAAE,EAEpE,GAAI,KAAKzE,EAAG,EAAG,OAAOwE,EAAI,EAE1B,IAAIH,EACAC,EACEI,EAAS7B,GAAe,CAC5B,KAAK,IAAI,OAAQ8B,CAAM,EACvB,KAAK,IAAI,MAAOC,CAAK,EACrB,KAAK,IAAIxD,EAAWyD,CAAS,EAC7BL,EAAI,EACJF,EAAOzB,CAAE,CACX,EACM8B,EAAUG,GAAgB,CAC9B,KAAK,IAAI,QAASJ,CAAK,EACvB,KAAK,IAAI,MAAOE,CAAK,EACrB,KAAK,IAAIxD,EAAWyD,CAAS,EAC7B,KAAK,MAAK,EACVR,EAAQ,CAAE,MAAAS,EAAO,KAAM,CAAC,CAAC,KAAK9E,EAAG,CAAC,CAAE,CACtC,EACM4E,EAAQ,IAAK,CACjB,KAAK,IAAI,QAASF,CAAK,EACvB,KAAK,IAAI,OAAQC,CAAM,EACvB,KAAK,IAAIvD,EAAWyD,CAAS,EAC7BL,EAAI,EACJH,EAAQ,CAAE,KAAM,GAAM,MAAO,MAAS,CAAE,CAC1C,EACMQ,EAAY,IAAMH,EAAM,IAAI,MAAM,kBAAkB,CAAC,EAC3D,OAAO,IAAI,QAA+B,CAACD,EAAKM,IAAO,CACrDT,EAASS,EACTV,EAAUI,EACV,KAAK,KAAKrD,EAAWyD,CAAS,EAC9B,KAAK,KAAK,QAASH,CAAK,EACxB,KAAK,KAAK,MAAOE,CAAK,EACtB,KAAK,KAAK,OAAQD,CAAM,CAC1B,CAAC,CACH,EAIE,MAAOH,EACP,OAAQA,EACR,CAAC,OAAO,aAAa,GAAC,CACpB,OAAO,IACT,EAEJ,CAQA,CAAC,OAAO,QAAQ,GAAC,CAGf,KAAK1C,EAAS,EAAI,GAClB,IAAIyC,EAAU,GACRC,EAAO,KACX,KAAK,MAAK,EACV,KAAK,IAAInD,GAAOmD,CAAI,EACpB,KAAK,IAAIpD,EAAWoD,CAAI,EACxB,KAAK,IAAI,MAAOA,CAAI,EACpBD,EAAU,GACH,CAAE,KAAM,GAAM,MAAO,MAAS,GAGjCS,EAAO,IAAkC,CAC7C,GAAIT,EAAS,OAAOC,EAAI,EACxB,IAAMM,EAAQ,KAAK,KAAI,EACvB,OAAOA,IAAU,KAAON,EAAI,EAAK,CAAE,KAAM,GAAO,MAAAM,CAAK,CACvD,EAEA,YAAK,KAAK,MAAON,CAAI,EACrB,KAAK,KAAKnD,GAAOmD,CAAI,EACrB,KAAK,KAAKpD,EAAWoD,CAAI,EAElB,CACL,KAAAQ,EACA,MAAOR,EACP,OAAQA,EACR,CAAC,OAAO,QAAQ,GAAC,CACf,OAAO,IACT,EAEJ,CAcA,QAAQ3B,EAAY,CAClB,GAAI,KAAKzB,CAAS,EAChB,OAAIyB,EAAI,KAAK,KAAK,QAASA,CAAE,EACxB,KAAK,KAAKzB,CAAS,EACjB,KAGT,KAAKA,CAAS,EAAI,GAClB,KAAKU,EAAS,EAAI,GAGlB,KAAKhB,CAAM,EAAE,OAAS,EACtB,KAAKE,CAAY,EAAI,EAErB,IAAMiE,EAAK,KAGX,OAAI,OAAOA,EAAG,OAAU,YAAc,CAAC,KAAK5E,EAAM,GAAG4E,EAAG,MAAK,EAEzDpC,EAAI,KAAK,KAAK,QAASA,CAAE,EAExB,KAAK,KAAKzB,CAAS,EAEjB,IACT,CASA,WAAW,UAAQ,CACjB,OAAOzB,EACT,GDrzCF,IAAMuF,GAAeC,GAAI,OA2EnBC,GAAqB,CACzB,UAAAC,GACA,QAASC,GACT,YAAAC,GACA,aAAAC,GACA,aAAAN,GACA,SAAU,CACR,MAAAO,GACA,QAAAC,GACA,SAAAC,GACA,SAAAC,KAKEC,GAAgBC,GACpB,CAACA,GAAYA,IAAaV,IAAaU,IAAaC,GAClDX,GACA,CACE,GAAGA,GACH,GAAGU,EACH,SAAU,CACR,GAAGV,GAAU,SACb,GAAIU,EAAS,UAAY,CAAA,IAK3BE,GAAiB,yBACjBC,GAAcC,GAClBA,EAAS,QAAQ,MAAO,IAAI,EAAE,QAAQF,GAAgB,MAAM,EAGxDG,GAAY,SAEZC,GAAU,EACVC,GAAQ,EACRC,GAAQ,EACRC,GAAQ,EACRC,GAAQ,EACRC,GAAQ,EACRC,GAAQ,GACRC,GAAS,GACTC,GAAO,GAaPC,GAAe,CAACD,GAGhBE,GAAiB,GAEjBC,GAAe,GAEfC,GAAU,GAGVC,GAAS,IAGTC,GAAc,IAEdC,GAAc,IAEdC,GAAWJ,GAAUC,GAASE,GAC9BE,GAAW,KAEXC,GAAaC,GACjBA,EAAE,OAAM,EAAKd,GACXc,EAAE,YAAW,EAAKhB,GAClBgB,EAAE,eAAc,EAAKb,GACrBa,EAAE,kBAAiB,EAAKjB,GACxBiB,EAAE,cAAa,EAAKf,GACpBe,EAAE,SAAQ,EAAKZ,GACfY,EAAE,OAAM,EAAKlB,GACbD,GAGEoB,GAAiB,IAAIC,GAAyB,CAAE,IAAK,GAAK,EAAE,CAAE,EAC9DC,GAAaH,GAAa,CAC9B,IAAMI,EAAIH,GAAe,IAAID,CAAC,EAC9B,GAAII,EAAG,OAAOA,EACd,IAAMC,EAAIL,EAAE,UAAU,MAAM,EAC5B,OAAAC,GAAe,IAAID,EAAGK,CAAC,EAChBA,CACT,EAEMC,GAAuB,IAAIJ,GAAyB,CAAE,IAAK,GAAK,EAAE,CAAE,EACpEK,GAAmBP,GAAa,CACpC,IAAMI,EAAIE,GAAqB,IAAIN,CAAC,EACpC,GAAII,EAAG,OAAOA,EACd,IAAMC,EAAIF,GAAUH,EAAE,YAAW,CAAE,EACnC,OAAAM,GAAqB,IAAIN,EAAGK,CAAC,EACtBA,CACT,EAoBaG,GAAP,cAA4BN,EAAwB,CACxD,aAAA,CACE,MAAM,CAAE,IAAK,GAAG,CAAE,CACpB,GAmBWO,GAAP,cAA6BP,EAA4B,CAC7D,YAAYQ,EAAkB,GAAK,KAAI,CACrC,MAAM,CACJ,QAAAA,EAEA,gBAAiBC,GAAKA,EAAE,OAAS,EAClC,CACH,GAUIC,GAAW,OAAO,qBAAqB,EAevBC,EAAhB,KAAwB,CAU5B,KAMA,KAMA,MAMA,OAKA,OAMA,MAAiB,GAajBC,GAGAC,GACA,IAAI,KAAG,CACL,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,MAAI,CACN,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,OAAK,CACP,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,KAAG,CACL,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,KAAG,CACL,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,MAAI,CACN,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,SAAO,CACT,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,KAAG,CACL,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,MAAI,CACN,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,QAAM,CACR,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,SAAO,CACT,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,SAAO,CACT,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,SAAO,CACT,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,aAAW,CACb,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,OAAK,CACP,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,OAAK,CACP,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,OAAK,CACP,OAAO,KAAKA,EACd,CACAC,GACA,IAAI,WAAS,CACX,OAAO,KAAKA,EACd,CAEAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAQA,IAAI,YAAU,CACZ,OAAQ,KAAK,QAAU,MAAM,SAAQ,CACvC,CASA,IAAI,MAAI,CACN,OAAO,KAAK,UACd,CASA,YACEC,EACAC,EAAe/D,GACfgE,EACAC,EACAC,EACAC,EACAC,EAAc,CAEd,KAAK,KAAON,EACZ,KAAKV,GAAac,EAASxC,GAAgBoC,CAAI,EAAIxC,GAAUwC,CAAI,EACjE,KAAKJ,GAAQK,EAAO9C,GACpB,KAAK,OAASiD,EACd,KAAK,MAAQD,EACb,KAAK,KAAOD,GAAQ,KACpB,KAAKL,GAAYQ,EACjB,KAAKb,GAAYc,EAAK,SACtB,KAAKZ,GAAYY,EAAK,SACtB,KAAKX,GAAiBW,EAAK,cAC3B,KAAK,OAASA,EAAK,OACf,KAAK,OACP,KAAKnC,GAAM,KAAK,OAAOA,GAEvB,KAAKA,GAAMxC,GAAa2E,EAAK,EAAE,CAEnC,CAOA,OAAK,CACH,OAAI,KAAKf,KAAW,OAAkB,KAAKA,GACtC,KAAK,OACF,KAAKA,GAAS,KAAK,OAAO,MAAK,EAAK,EADlB,KAAKA,GAAS,CAE1C,CAkBA,eAAa,CACX,OAAO,KAAKM,EACd,CAKA,QAAQU,EAAa,CACnB,GAAI,CAACA,EACH,OAAO,KAET,IAAMvE,EAAW,KAAK,cAAcuE,CAAI,EAElCC,EADMD,EAAK,UAAUvE,EAAS,MAAM,EACrB,MAAM,KAAK,QAAQ,EAKxC,OAHEA,EACE,KAAK,QAAQA,CAAQ,EAAEyE,GAAcD,CAAQ,EAC7C,KAAKC,GAAcD,CAAQ,CAEjC,CAEAC,GAAcD,EAAkB,CAC9B,IAAIE,EAAc,KAClB,QAAWC,KAAQH,EACjBE,EAAIA,EAAE,MAAMC,CAAI,EAElB,OAAOD,CACT,CAUA,UAAQ,CACN,IAAME,EAAS,KAAKf,GAAU,IAAI,IAAI,EACtC,GAAIe,EACF,OAAOA,EAET,IAAMP,EAAqB,OAAO,OAAO,CAAA,EAAI,CAAE,YAAa,CAAC,CAAE,EAC/D,YAAKR,GAAU,IAAI,KAAMQ,CAAQ,EACjC,KAAKT,IAAS,CAAChD,GACRyD,CACT,CAeA,MAAMQ,EAAkBP,EAAe,CACrC,GAAIO,IAAa,IAAMA,IAAa,IAClC,OAAO,KAET,GAAIA,IAAa,KACf,OAAO,KAAK,QAAU,KAIxB,IAAMR,EAAW,KAAK,SAAQ,EACxBL,EACJ,KAAK,OAASpC,GAAgBiD,CAAQ,EAAIrD,GAAUqD,CAAQ,EAC9D,QAAWH,KAAKL,EACd,GAAIK,EAAEpB,KAAeU,EACnB,OAAOU,EAOX,IAAMrD,EAAI,KAAK,OAAS,KAAK,IAAM,GAC7ByD,EACJ,KAAKtB,GAAY,KAAKA,GAAYnC,EAAIwD,EAAW,OAC7CE,EAAS,KAAK,SAASF,EAAU3E,GAAS,CAC9C,GAAGoE,EACH,OAAQ,KACR,SAAAQ,EACD,EAED,OAAK,KAAK,WAAU,IAClBC,EAAOnB,IAAS7C,IAKlBsD,EAAS,KAAKU,CAAM,EACbA,CACT,CAMA,UAAQ,CACN,GAAI,KAAK,MAAO,MAAO,GACvB,GAAI,KAAKrB,KAAc,OACrB,OAAO,KAAKA,GAEd,IAAMM,EAAO,KAAK,KACZU,EAAI,KAAK,OACf,GAAI,CAACA,EACH,OAAQ,KAAKhB,GAAY,KAAK,KAEhC,IAAMsB,EAAKN,EAAE,SAAQ,EACrB,OAAOM,GAAM,CAACA,GAAM,CAACN,EAAE,OAAS,GAAK,KAAK,KAAOV,CACnD,CAQA,eAAa,CACX,GAAI,KAAK,MAAQ,IAAK,OAAO,KAAK,SAAQ,EAC1C,GAAI,KAAK,MAAO,MAAO,GACvB,GAAI,KAAKL,KAAmB,OAAW,OAAO,KAAKA,GACnD,IAAMK,EAAO,KAAK,KACZU,EAAI,KAAK,OACf,GAAI,CAACA,EACH,OAAQ,KAAKf,GAAiB,KAAK,cAAa,EAElD,IAAMqB,EAAKN,EAAE,cAAa,EAC1B,OAAOM,GAAM,CAACA,GAAM,CAACN,EAAE,OAAS,GAAK,KAAOV,CAC9C,CAKA,UAAQ,CACN,GAAI,KAAKR,KAAc,OACrB,OAAO,KAAKA,GAEd,IAAMQ,EAAO,KAAK,KACZU,EAAI,KAAK,OACf,GAAI,CAACA,EACH,OAAQ,KAAKlB,GAAY,KAAK,KAGhC,IAAMyB,EADKP,EAAE,SAAQ,GACHA,EAAE,OAAc,KAAK,IAAV,IAAiBV,EAC9C,OAAQ,KAAKR,GAAYyB,CAC3B,CAQA,eAAa,CACX,GAAI,KAAKxB,KAAmB,OAAW,OAAO,KAAKA,GACnD,GAAI,KAAK,MAAQ,IAAK,OAAQ,KAAKA,GAAiB,KAAK,SAAQ,EACjE,GAAI,CAAC,KAAK,OAAQ,CAChB,IAAMiB,EAAI,KAAK,SAAQ,EAAG,QAAQ,MAAO,GAAG,EAC5C,MAAI,aAAa,KAAKA,CAAC,EACb,KAAKjB,GAAiB,OAAOiB,CAAC,GAE9B,KAAKjB,GAAiBiB,CAElC,CACA,IAAMA,EAAI,KAAK,OACTQ,EAAOR,EAAE,cAAa,EACtBS,EAAMD,GAAQ,CAACA,GAAQ,CAACR,EAAE,OAAS,GAAK,KAAO,KAAK,KAC1D,OAAQ,KAAKjB,GAAiB0B,CAChC,CASA,WAAS,CACP,OAAQ,KAAKvB,GAAQlD,MAAUR,EACjC,CAEA,OAAO+D,EAAU,CACf,OAAO,KAAK,KAAKA,CAAI,EAAE,EAAC,CAC1B,CAEA,SAAO,CACL,OACE,KAAK,UAAS,EAAK,UACjB,KAAK,YAAW,EAAK,YACrB,KAAK,OAAM,EAAK,OAChB,KAAK,eAAc,EAAK,eACxB,KAAK,OAAM,EAAK,OAChB,KAAK,kBAAiB,EAAK,kBAC3B,KAAK,cAAa,EAAK,cACD,KAAK,SAAQ,EAAK,SACxC,SAGN,CAKA,QAAM,CACJ,OAAQ,KAAKL,GAAQlD,MAAUH,EACjC,CAKA,aAAW,CACT,OAAQ,KAAKqD,GAAQlD,MAAUL,EACjC,CAKA,mBAAiB,CACf,OAAQ,KAAKuD,GAAQlD,MAAUN,EACjC,CAKA,eAAa,CACX,OAAQ,KAAKwD,GAAQlD,MAAUJ,EACjC,CAKA,QAAM,CACJ,OAAQ,KAAKsD,GAAQlD,MAAUP,EACjC,CAKA,UAAQ,CACN,OAAQ,KAAKyD,GAAQlD,MAAUD,EACjC,CAKA,gBAAc,CACZ,OAAQ,KAAKmD,GAAQpD,MAAWA,EAClC,CASA,aAAW,CACT,OAAO,KAAKoD,GAAQ/C,GAAe,KAAO,MAC5C,CAUA,gBAAc,CACZ,OAAO,KAAKiD,EACd,CAUA,gBAAc,CACZ,OAAO,KAAKC,EACd,CAUA,eAAa,CACX,IAAMM,EAAW,KAAK,SAAQ,EAC9B,OAAOA,EAAS,MAAM,EAAGA,EAAS,WAAW,CAC/C,CASA,aAAW,CACT,GAAI,KAAKP,GAAa,MAAO,GAC7B,GAAI,CAAC,KAAK,OAAQ,MAAO,GAEzB,IAAMsB,EAAO,KAAKxB,GAAQlD,GAC1B,MAAO,EACJ0E,IAASlF,IAAWkF,IAAS5E,IAC9B,KAAKoD,GAAQ5C,IACb,KAAK4C,GAAQ7C,GAEjB,CAMA,eAAa,CACX,MAAO,CAAC,EAAE,KAAK6C,GAAQhD,GACzB,CAOA,UAAQ,CACN,MAAO,CAAC,EAAE,KAAKgD,GAAQ7C,GACzB,CAaA,QAAQW,EAAS,CACf,OAAQ,KAAK,OAET,KAAK4B,KAAe1B,GAAgBF,CAAC,EADrC,KAAK4B,KAAe9B,GAAUE,CAAC,CAErC,CAUA,MAAM,UAAQ,CACZ,IAAM2D,EAAS,KAAKvB,GACpB,GAAIuB,EACF,OAAOA,EAET,GAAK,KAAK,YAAW,GAKhB,KAAK,OAIV,GAAI,CACF,IAAMC,EAAO,MAAM,KAAKnD,GAAI,SAAS,SAAS,KAAK,SAAQ,CAAE,EACvDoD,GAAc,MAAM,KAAK,OAAO,SAAQ,IAAK,QAAQD,CAAI,EAC/D,GAAIC,EACF,OAAQ,KAAKzB,GAAcyB,CAE/B,OAASC,EAAI,CACX,KAAKC,GAAeD,EAA6B,IAAI,EACrD,MACF,CACF,CAKA,cAAY,CACV,IAAMH,EAAS,KAAKvB,GACpB,GAAIuB,EACF,OAAOA,EAET,GAAK,KAAK,YAAW,GAKhB,KAAK,OAIV,GAAI,CACF,IAAMC,EAAO,KAAKnD,GAAI,aAAa,KAAK,SAAQ,CAAE,EAC5CoD,EAAa,KAAK,OAAO,aAAY,GAAI,QAAQD,CAAI,EAC3D,GAAIC,EACF,OAAQ,KAAKzB,GAAcyB,CAE/B,OAASC,EAAI,CACX,KAAKC,GAAeD,EAA6B,IAAI,EACrD,MACF,CACF,CAEAE,GAAgBrB,EAAkB,CAEhC,KAAKT,IAAShD,GAEd,QAAS8D,EAAIL,EAAS,YAAaK,EAAIL,EAAS,OAAQK,IAAK,CAC3D,IAAMjD,EAAI4C,EAASK,CAAC,EAChBjD,GAAGA,EAAEkE,GAAW,CACtB,CACF,CAEAA,IAAW,CAEL,KAAK/B,GAAQ7C,KACjB,KAAK6C,IAAS,KAAKA,GAAQ7C,IAAUJ,GACrC,KAAKiF,GAAmB,EAC1B,CAEAA,IAAmB,CAEjB,IAAMvB,EAAW,KAAK,SAAQ,EAC9BA,EAAS,YAAc,EACvB,QAAWK,KAAKL,EACdK,EAAEiB,GAAW,CAEjB,CAEAE,IAAgB,CACd,KAAKjC,IAAS3C,GACd,KAAK6E,GAAY,CACnB,CAGAA,IAAY,CAMV,GAAI,KAAKlC,GAAQ9C,GAAS,OAE1B,IAAI,EAAI,KAAK8C,IAGR,EAAIlD,MAAUL,KAAO,GAAKM,IAC/B,KAAKiD,GAAQ,EAAI9C,GACjB,KAAK8E,GAAmB,CAC1B,CAEAG,GAAaC,EAAe,GAAE,CAExBA,IAAS,WAAaA,IAAS,QACjC,KAAKF,GAAY,EACRE,IAAS,SAClB,KAAKL,GAAW,EAEhB,KAAK,SAAQ,EAAG,YAAc,CAElC,CAEAM,GAAWD,EAAe,GAAE,CAGtBA,IAAS,UAED,KAAK,OACbF,GAAY,EACLE,IAAS,UAElB,KAAKL,GAAW,CAEpB,CAEAF,GAAcO,EAAe,GAAE,CAC7B,IAAIE,EAAM,KAAKtC,GACfsC,GAAOlF,GACHgF,IAAS,WAAUE,GAAOnF,KAE1BiF,IAAS,UAAYA,IAAS,aAGhCE,GAAOvF,IAET,KAAKiD,GAAQsC,EAITF,IAAS,WAAa,KAAK,QAC7B,KAAK,OAAOF,GAAY,CAG5B,CAEAK,GAAiBC,EAAW3E,EAAW,CACrC,OACE,KAAK4E,GAA0BD,EAAG3E,CAAC,GACnC,KAAK6E,GAAoBF,EAAG3E,CAAC,CAEjC,CAEA6E,GAAoBF,EAAW3E,EAAW,CAExC,IAAMwC,EAAO7C,GAAUgF,CAAC,EAClBG,EAAQ,KAAK,SAASH,EAAE,KAAMnC,EAAM,CAAE,OAAQ,IAAI,CAAE,EACpDmB,EAAOmB,EAAM3C,GAAQlD,GAC3B,OAAI0E,IAAS/E,IAAS+E,IAAS5E,IAAS4E,IAASlF,KAC/CqG,EAAM3C,IAAS9C,IAEjBW,EAAE,QAAQ8E,CAAK,EACf9E,EAAE,cACK8E,CACT,CAEAF,GAA0BD,EAAW3E,EAAW,CAC9C,QAASiD,EAAIjD,EAAE,YAAaiD,EAAIjD,EAAE,OAAQiD,IAAK,CAC7C,IAAMK,EAAStD,EAAEiD,CAAC,EAGlB,IADE,KAAK,OAAS9C,GAAgBwE,EAAE,IAAI,EAAI5E,GAAU4E,EAAE,IAAI,KAC7CrB,EAAQzB,GAIrB,OAAO,KAAKkD,GAAqBJ,EAAGrB,EAASL,EAAGjD,CAAC,CACnD,CACF,CAEA+E,GACEJ,EACA1B,EACA+B,EACAhF,EAAW,CAEX,IAAMiF,EAAIhC,EAAE,KAEZ,OAAAA,EAAEd,GAASc,EAAEd,GAAQjD,GAAgBS,GAAUgF,CAAC,EAE5CM,IAAMN,EAAE,OAAM1B,EAAE,KAAO0B,EAAE,MAIzBK,IAAUhF,EAAE,cACVgF,IAAUhF,EAAE,OAAS,EAAGA,EAAE,IAAG,EAC5BA,EAAE,OAAOgF,EAAO,CAAC,EACtBhF,EAAE,QAAQiD,CAAC,GAEbjD,EAAE,cACKiD,CACT,CAiBA,MAAM,OAAK,CACT,IAAK,KAAKd,GAAQ7C,MAAY,EAC5B,GAAI,CACF,YAAK4F,GAAW,MAAM,KAAKxE,GAAI,SAAS,MAAM,KAAK,SAAQ,CAAE,CAAC,EACvD,IACT,OAASqD,EAAI,CACX,KAAKS,GAAYT,EAA6B,IAAI,CACpD,CAEJ,CAKA,WAAS,CACP,IAAK,KAAK5B,GAAQ7C,MAAY,EAC5B,GAAI,CACF,YAAK4F,GAAW,KAAKxE,GAAI,UAAU,KAAK,SAAQ,CAAE,CAAC,EAC5C,IACT,OAASqD,EAAI,CACX,KAAKS,GAAYT,EAA6B,IAAI,CACpD,CAEJ,CAEAmB,GAAWC,EAAS,CAClB,GAAM,CACJ,MAAAC,EACA,QAAAC,EACA,UAAAC,EACA,YAAAC,EACA,QAAAC,EACA,OAAAC,EACA,MAAAC,EACA,QAAAC,EACA,IAAAC,EACA,IAAAC,EACA,IAAAC,EACA,KAAAC,EACA,MAAAC,EACA,QAAAC,EACA,MAAAC,EACA,KAAAC,EACA,KAAAC,EACA,IAAAC,CAAG,EACDlB,EACJ,KAAK1D,GAAS2D,EACd,KAAK/D,GAAWgE,EAChB,KAAKzD,GAAa0D,EAClB,KAAK9D,GAAe+D,EACpB,KAAKtE,GAAWuE,EAChB,KAAKpE,GAAUqE,EACf,KAAK9D,GAAS+D,EACd,KAAKnE,GAAWoE,EAChB,KAAKhF,GAAOiF,EACZ,KAAK7E,GAAO8E,EACZ,KAAK3E,GAAO4E,EACZ,KAAKlF,GAAQmF,EACb,KAAKrE,GAASsE,EACd,KAAK1E,GAAW2E,EAChB,KAAKpF,GAASqF,EACd,KAAKlF,GAAQmF,EACb,KAAKhF,GAAQiF,EACb,KAAKtF,GAAOuF,EACZ,IAAM1C,EAAOhE,GAAUwF,CAAE,EAEzB,KAAKhD,GAAS,KAAKA,GAAQjD,GAAgByE,EAAOvE,GAC9CuE,IAASlF,IAAWkF,IAAS/E,IAAS+E,IAAS5E,KACjD,KAAKoD,IAAS9C,GAElB,CAEAiH,GAGc,CAAA,EACdC,GAA8B,GAC9BC,GAAiB5D,EAAgB,CAC/B,KAAK2D,GAAqB,GAC1B,IAAME,EAAM,KAAKH,GAAa,MAAK,EACnC,KAAKA,GAAa,OAAS,EAC3BG,EAAI,QAAQC,GAAMA,EAAG,KAAM9D,CAAQ,CAAC,CACtC,CAkBA,UACE8D,EACAC,EAAsB,GAAK,CAE3B,GAAI,CAAC,KAAK,WAAU,EAAI,CAClBA,EAAYD,EAAG,KAAM,CAAA,CAAE,EACtB,eAAe,IAAMA,EAAG,KAAM,CAAA,CAAE,CAAC,EACtC,MACF,CAEA,IAAM9D,EAAW,KAAK,SAAQ,EAC9B,GAAI,KAAK,cAAa,EAAI,CACxB,IAAM5C,EAAI4C,EAAS,MAAM,EAAGA,EAAS,WAAW,EAC5C+D,EAAYD,EAAG,KAAM1G,CAAC,EACrB,eAAe,IAAM0G,EAAG,KAAM1G,CAAC,CAAC,EACrC,MACF,CAIA,GADA,KAAKsG,GAAa,KAAKI,CAAE,EACrB,KAAKH,GACP,OAEF,KAAKA,GAAqB,GAI1B,IAAMlD,EAAW,KAAK,SAAQ,EAC9B,KAAK3C,GAAI,QAAQ2C,EAAU,CAAE,cAAe,EAAI,EAAI,CAACU,EAAI6C,IAAW,CAClE,GAAI7C,EACF,KAAKO,GAAcP,EAA6B,IAAI,EACpDnB,EAAS,YAAc,MAClB,CAGL,QAAW+B,KAAKiC,EACd,KAAKlC,GAAiBC,EAAG/B,CAAQ,EAEnC,KAAKqB,GAAgBrB,CAAQ,CAC/B,CACA,KAAK4D,GAAiB5D,EAAS,MAAM,EAAGA,EAAS,WAAW,CAAC,CAE/D,CAAC,CACH,CAEAiE,GAWA,MAAM,SAAO,CACX,GAAI,CAAC,KAAK,WAAU,EAClB,MAAO,CAAA,EAGT,IAAMjE,EAAW,KAAK,SAAQ,EAC9B,GAAI,KAAK,cAAa,EACpB,OAAOA,EAAS,MAAM,EAAGA,EAAS,WAAW,EAK/C,IAAMS,EAAW,KAAK,SAAQ,EAC9B,GAAI,KAAKwD,GACP,MAAM,KAAKA,OACN,CAEL,IAAIC,EAAsB,IAAK,CAAE,EAEjC,KAAKD,GAAwB,IAAI,QAC/BE,GAAQD,EAAUC,CAAI,EAExB,GAAI,CACF,QAAWpC,KAAK,MAAM,KAAKjE,GAAI,SAAS,QAAQ2C,EAAU,CACxD,cAAe,GAChB,EACC,KAAKqB,GAAiBC,EAAG/B,CAAQ,EAEnC,KAAKqB,GAAgBrB,CAAQ,CAC/B,OAASmB,EAAI,CACX,KAAKO,GAAcP,EAA6B,IAAI,EACpDnB,EAAS,YAAc,CACzB,CACA,KAAKiE,GAAwB,OAC7BC,EAAO,CACT,CACA,OAAOlE,EAAS,MAAM,EAAGA,EAAS,WAAW,CAC/C,CAKA,aAAW,CACT,GAAI,CAAC,KAAK,WAAU,EAClB,MAAO,CAAA,EAGT,IAAMA,EAAW,KAAK,SAAQ,EAC9B,GAAI,KAAK,cAAa,EACpB,OAAOA,EAAS,MAAM,EAAGA,EAAS,WAAW,EAK/C,IAAMS,EAAW,KAAK,SAAQ,EAC9B,GAAI,CACF,QAAWsB,KAAK,KAAKjE,GAAI,YAAY2C,EAAU,CAC7C,cAAe,GAChB,EACC,KAAKqB,GAAiBC,EAAG/B,CAAQ,EAEnC,KAAKqB,GAAgBrB,CAAQ,CAC/B,OAASmB,EAAI,CACX,KAAKO,GAAcP,EAA6B,IAAI,EACpDnB,EAAS,YAAc,CACzB,CACA,OAAOA,EAAS,MAAM,EAAGA,EAAS,WAAW,CAC/C,CAEA,YAAU,CACR,GAAI,KAAKT,GAAQ1C,GAAU,MAAO,GAClC,IAAMkE,EAAO1E,GAAO,KAAKkD,GAGzB,OAAMwB,IAASlF,IAAWkF,IAAS/E,IAAS+E,IAAS5E,EAKvD,CAEA,WACEiI,EACAC,EAAqC,CAErC,OACG,KAAK9E,GAAQvD,MAAWA,IACzB,EAAE,KAAKuD,GAAQ1C,KACf,CAACuH,EAAK,IAAI,IAAI,IACb,CAACC,GAAcA,EAAW,IAAI,EAEnC,CAWA,MAAM,UAAQ,CACZ,GAAI,KAAK3E,GAAW,OAAO,KAAKA,GAChC,GAAK,GAAA9C,GAAcD,GAAcD,IAAU,KAAK6C,IAChD,GAAI,CACF,IAAM+E,EAAK,MAAM,KAAKxG,GAAI,SAAS,SAAS,KAAK,SAAQ,CAAE,EAC3D,OAAQ,KAAK4B,GAAY,KAAK,QAAQ4E,CAAE,CAC1C,MAAY,CACV,KAAK9C,GAAgB,CACvB,CACF,CAKA,cAAY,CACV,GAAI,KAAK9B,GAAW,OAAO,KAAKA,GAChC,GAAK,GAAA9C,GAAcD,GAAcD,IAAU,KAAK6C,IAChD,GAAI,CACF,IAAM+E,EAAK,KAAKxG,GAAI,aAAa,KAAK,SAAQ,CAAE,EAChD,OAAQ,KAAK4B,GAAY,KAAK,QAAQ4E,CAAE,CAC1C,MAAY,CACV,KAAK9C,GAAgB,CACvB,CACF,CAQA,CAAC5D,EAAQ,EAAE2G,EAAgB,CACzB,GAAIA,IAAW,KAAM,OACrBA,EAAO,MAAQ,GACf,KAAK,MAAQ,GAEb,IAAMC,EAAU,IAAI,IAAc,CAAA,CAAE,EAChCF,EAAK,CAAA,EACLjE,EAAc,KAClB,KAAOA,GAAKA,EAAE,QACZmE,EAAQ,IAAInE,CAAC,EACbA,EAAEhB,GAAYiF,EAAG,KAAK,KAAK,GAAG,EAC9BjE,EAAEf,GAAiBgF,EAAG,KAAK,GAAG,EAC9BjE,EAAIA,EAAE,OACNiE,EAAG,KAAK,IAAI,EAId,IADAjE,EAAIkE,EACGlE,GAAKA,EAAE,QAAU,CAACmE,EAAQ,IAAInE,CAAC,GACpCA,EAAEhB,GAAY,OACdgB,EAAEf,GAAiB,OACnBe,EAAIA,EAAE,MAEV,GASWoE,GAAP,MAAOC,UAAkB7G,CAAQ,CAIrC,IAAY,KAIZ,SAAmBjC,GAQnB,YACE+D,EACAC,EAAe/D,GACfgE,EACAC,EACAC,EACAC,EACAC,EAAc,CAEd,MAAMN,EAAMC,EAAMC,EAAMC,EAAOC,EAAQC,EAAUC,CAAI,CACvD,CAKA,SAASN,EAAcC,EAAe/D,GAASoE,EAAiB,CAAA,EAAE,CAChE,OAAO,IAAIyE,EACT/E,EACAC,EACA,KAAK,KACL,KAAK,MACL,KAAK,OACL,KAAK,cAAa,EAClBK,CAAI,CAER,CAKA,cAAcC,EAAY,CACxB,OAAOyE,GAAM,MAAMzE,CAAI,EAAE,IAC3B,CAKA,QAAQvE,EAAgB,CAEtB,GADAA,EAAWD,GAAWC,EAAS,YAAW,CAAE,EACxCA,IAAa,KAAK,KAAK,KACzB,OAAO,KAAK,KAGd,OAAW,CAACiJ,EAAS/E,CAAI,IAAK,OAAO,QAAQ,KAAK,KAAK,EACrD,GAAI,KAAK,SAASlE,EAAUiJ,CAAO,EACjC,OAAQ,KAAK,MAAMjJ,CAAQ,EAAIkE,EAInC,OAAQ,KAAK,MAAMlE,CAAQ,EAAI,IAAIkJ,GACjClJ,EACA,IAAI,EACJ,IACJ,CAKA,SAASA,EAAkBiJ,EAAkB,KAAK,KAAK,KAAI,CAIzD,OAAAjJ,EAAWA,EACR,YAAW,EACX,QAAQ,MAAO,IAAI,EACnB,QAAQF,GAAgB,MAAM,EAC1BE,IAAaiJ,CACtB,GAQWE,GAAP,MAAOC,UAAkBlH,CAAQ,CAIrC,SAAgB,IAIhB,IAAW,IAQX,YACE8B,EACAC,EAAe/D,GACfgE,EACAC,EACAC,EACAC,EACAC,EAAc,CAEd,MAAMN,EAAMC,EAAMC,EAAMC,EAAOC,EAAQC,EAAUC,CAAI,CACvD,CAKA,cAAcC,EAAY,CACxB,OAAOA,EAAK,WAAW,GAAG,EAAI,IAAM,EACtC,CAKA,QAAQ8E,EAAiB,CACvB,OAAO,KAAK,IACd,CAKA,SAASrF,EAAcC,EAAe/D,GAASoE,EAAiB,CAAA,EAAE,CAChE,OAAO,IAAI8E,EACTpF,EACAC,EACA,KAAK,KACL,KAAK,MACL,KAAK,OACL,KAAK,cAAa,EAClBK,CAAI,CAER,GA0CoBgF,GAAhB,KAA8B,CAIlC,KAIA,SAIA,MAIA,IACAC,GACAC,GACA3F,GAMA,OASA1B,GASA,YACEsH,EAAoB,QAAQ,IAAG,EAC/BC,EACAC,EACA,CACE,OAAAvF,EACA,kBAAAwF,EAAoB,GAAK,KACzB,GAAAC,EAAK3K,EAAS,EACI,CAAA,EAAE,CAEtB,KAAKiD,GAAMxC,GAAakK,CAAE,GACtBJ,aAAe,KAAOA,EAAI,WAAW,SAAS,KAChDA,EAAMK,GAAcL,CAAG,GAIzB,IAAMM,EAAUL,EAAS,QAAQD,CAAG,EACpC,KAAK,MAAQ,OAAO,OAAO,IAAI,EAC/B,KAAK,SAAW,KAAK,cAAcM,CAAO,EAC1C,KAAKR,GAAgB,IAAI1H,GACzB,KAAK2H,GAAqB,IAAI3H,GAC9B,KAAKgC,GAAY,IAAI/B,GAAc8H,CAAiB,EAEpD,IAAMI,EAAQD,EAAQ,UAAU,KAAK,SAAS,MAAM,EAAE,MAAMJ,CAAG,EAM/D,GAJIK,EAAM,SAAW,GAAK,CAACA,EAAM,CAAC,GAChCA,EAAM,IAAG,EAGP5F,IAAW,OACb,MAAM,IAAI,UACR,oDAAoD,EAIxD,KAAK,OAASA,EACd,KAAK,KAAO,KAAK,QAAQ,KAAKjC,EAAG,EACjC,KAAK,MAAM,KAAK,QAAQ,EAAI,KAAK,KACjC,IAAI8H,EAAiB,KAAK,KACtBC,EAAMF,EAAM,OAAS,EACnBG,EAAUT,EAAS,IACrBU,EAAM,KAAK,SACXC,EAAW,GACf,QAAW1F,KAAQqF,EAAO,CACxB,IAAMM,EAAIJ,IACVD,EAAOA,EAAK,MAAMtF,EAAM,CACtB,SAAU,IAAI,MAAM2F,CAAC,EAAE,KAAK,IAAI,EAAE,KAAKH,CAAO,EAC9C,cAAe,IAAI,MAAMG,CAAC,EAAE,KAAK,IAAI,EAAE,KAAK,GAAG,EAC/C,SAAWF,IAAQC,EAAW,GAAKF,GAAWxF,EAC/C,EACD0F,EAAW,EACb,CACA,KAAK,IAAMJ,CACb,CAKA,MAAM1F,EAAsB,KAAK,IAAG,CAClC,OAAI,OAAOA,GAAS,WAClBA,EAAO,KAAK,IAAI,QAAQA,CAAI,GAEvBA,EAAK,MAAK,CACnB,CAyBA,eAAa,CACX,OAAO,KAAKV,EACd,CAWA,WAAW0G,EAAe,CAGxB,IAAIC,EAAI,GACR,QAASC,EAAIF,EAAM,OAAS,EAAGE,GAAK,EAAGA,IAAK,CAC1C,IAAM/F,EAAI6F,EAAME,CAAC,EACjB,GAAI,GAAC/F,GAAKA,IAAM,OAChB8F,EAAIA,EAAI,GAAG9F,CAAC,IAAI8F,CAAC,GAAK9F,EAClB,KAAK,WAAWA,CAAC,GACnB,KAEJ,CACA,IAAME,EAAS,KAAK2E,GAAc,IAAIiB,CAAC,EACvC,GAAI5F,IAAW,OACb,OAAOA,EAET,IAAM8F,EAAS,KAAK,IAAI,QAAQF,CAAC,EAAE,SAAQ,EAC3C,YAAKjB,GAAc,IAAIiB,EAAGE,CAAM,EACzBA,CACT,CAaA,gBAAgBH,EAAe,CAG7B,IAAIC,EAAI,GACR,QAASC,EAAIF,EAAM,OAAS,EAAGE,GAAK,EAAGA,IAAK,CAC1C,IAAM/F,EAAI6F,EAAME,CAAC,EACjB,GAAI,GAAC/F,GAAKA,IAAM,OAChB8F,EAAIA,EAAI,GAAG9F,CAAC,IAAI8F,CAAC,GAAK9F,EAClB,KAAK,WAAWA,CAAC,GACnB,KAEJ,CACA,IAAME,EAAS,KAAK4E,GAAmB,IAAIgB,CAAC,EAC5C,GAAI5F,IAAW,OACb,OAAOA,EAET,IAAM8F,EAAS,KAAK,IAAI,QAAQF,CAAC,EAAE,cAAa,EAChD,YAAKhB,GAAmB,IAAIgB,EAAGE,CAAM,EAC9BA,CACT,CAKA,SAASC,EAA2B,KAAK,IAAG,CAC1C,OAAI,OAAOA,GAAU,WACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,GAEzBA,EAAM,SAAQ,CACvB,CAMA,cAAcA,EAA2B,KAAK,IAAG,CAC/C,OAAI,OAAOA,GAAU,WACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,GAEzBA,EAAM,cAAa,CAC5B,CAKA,SAASA,EAA2B,KAAK,IAAG,CAC1C,OAAI,OAAOA,GAAU,WACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,GAEzBA,EAAM,IACf,CAKA,QAAQA,EAA2B,KAAK,IAAG,CACzC,OAAI,OAAOA,GAAU,WACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,IAExBA,EAAM,QAAUA,GAAO,SAAQ,CACzC,CAkCA,MAAM,QACJA,EAAwD,KAAK,IAC7DrG,EAAmC,CACjC,cAAe,IAChB,CAEG,OAAOqG,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBzI,IAC5BoC,EAAOqG,EACPA,EAAQ,KAAK,KAEf,GAAM,CAAE,cAAAC,CAAa,EAAKtG,EAC1B,GAAKqG,EAAM,WAAU,EAEd,CACL,IAAMjG,EAAI,MAAMiG,EAAM,QAAO,EAC7B,OAAOC,EAAgBlG,EAAIA,EAAE,IAAI0B,GAAKA,EAAE,IAAI,CAC9C,KAJE,OAAO,CAAA,CAKX,CAsBA,YACEuE,EAAwD,KAAK,IAC7DrG,EAAmC,CACjC,cAAe,IAChB,CAEG,OAAOqG,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBzI,IAC5BoC,EAAOqG,EACPA,EAAQ,KAAK,KAEf,GAAM,CAAE,cAAAC,EAAgB,EAAI,EAAKtG,EACjC,OAAKqG,EAAM,WAAU,EAEVC,EACFD,EAAM,YAAW,EAEjBA,EAAM,YAAW,EAAG,IAAIvE,GAAKA,EAAE,IAAI,EAJnC,CAAA,CAMX,CAiBA,MAAM,MACJuE,EAA2B,KAAK,IAAG,CAEnC,OAAI,OAAOA,GAAU,WACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,GAEzBA,EAAM,MAAK,CACpB,CAKA,UAAUA,EAA2B,KAAK,IAAG,CAC3C,OAAI,OAAOA,GAAU,WACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,GAEzBA,EAAM,UAAS,CACxB,CAkCA,MAAM,SACJA,EAAwD,KAAK,IAC7D,CAAE,cAAAC,CAAa,EAAiC,CAC9C,cAAe,IAChB,CAEG,OAAOD,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBzI,IAC5B0I,EAAgBD,EAAM,cACtBA,EAAQ,KAAK,KAEf,IAAMvE,EAAI,MAAMuE,EAAM,SAAQ,EAC9B,OAAOC,EAAgBxE,EAAIA,GAAG,SAAQ,CACxC,CAuBA,aACEuE,EAAwD,KAAK,IAC7D,CAAE,cAAAC,CAAa,EAAiC,CAC9C,cAAe,IAChB,CAEG,OAAOD,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBzI,IAC5B0I,EAAgBD,EAAM,cACtBA,EAAQ,KAAK,KAEf,IAAMvE,EAAIuE,EAAM,aAAY,EAC5B,OAAOC,EAAgBxE,EAAIA,GAAG,SAAQ,CACxC,CAiCA,MAAM,SACJuE,EAAwD,KAAK,IAC7D,CAAE,cAAAC,CAAa,EAAiC,CAC9C,cAAe,IAChB,CAEG,OAAOD,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBzI,IAC5B0I,EAAgBD,EAAM,cACtBA,EAAQ,KAAK,KAEf,IAAMvE,EAAI,MAAMuE,EAAM,SAAQ,EAC9B,OAAOC,EAAgBxE,EAAIA,GAAG,SAAQ,CACxC,CAoBA,aACEuE,EAAwD,KAAK,IAC7D,CAAE,cAAAC,CAAa,EAAiC,CAC9C,cAAe,IAChB,CAEG,OAAOD,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBzI,IAC5B0I,EAAgBD,EAAM,cACtBA,EAAQ,KAAK,KAEf,IAAMvE,EAAIuE,EAAM,aAAY,EAC5B,OAAOC,EAAgBxE,EAAIA,GAAG,SAAQ,CACxC,CA6BA,MAAM,KACJuE,EAAyC,KAAK,IAC9CrG,EAAoB,CAAA,EAAE,CAElB,OAAOqG,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBzI,IAC5BoC,EAAOqG,EACPA,EAAQ,KAAK,KAEf,GAAM,CACJ,cAAAC,EAAgB,GAChB,OAAAC,EAAS,GACT,OAAAC,EACA,WAAApC,CAAU,EACRpE,EACEyG,EAAiC,CAAA,GACnC,CAACD,GAAUA,EAAOH,CAAK,IACzBI,EAAQ,KAAKH,EAAgBD,EAAQA,EAAM,SAAQ,CAAE,EAEvD,IAAMlC,EAAO,IAAI,IACXuC,EAAO,CACXC,EACA9C,IACE,CACFM,EAAK,IAAIwC,CAAG,EACZA,EAAI,UAAU,CAACzF,EAAI6C,IAAW,CAE5B,GAAI7C,EACF,OAAO2C,EAAG3C,CAAE,EAGd,IAAI0E,EAAM7B,EAAQ,OAClB,GAAI,CAAC6B,EAAK,OAAO/B,EAAE,EACnB,IAAM+C,EAAO,IAAK,CACZ,EAAEhB,IAAQ,GACZ/B,EAAE,CAEN,EACA,QAAW/B,KAAKiC,GACV,CAACyC,GAAUA,EAAO1E,CAAC,IACrB2E,EAAQ,KAAKH,EAAgBxE,EAAIA,EAAE,SAAQ,CAAE,EAE3CyE,GAAUzE,EAAE,eAAc,EAC5BA,EAAE,SAAQ,EACP,KAAKoE,GAAMA,GAAG,UAAS,EAAKA,EAAE,MAAK,EAAKA,CAAE,EAC1C,KAAKA,GACJA,GAAG,WAAW/B,EAAMC,CAAU,EAAIsC,EAAKR,EAAGU,CAAI,EAAIA,EAAI,CAAE,EAGxD9E,EAAE,WAAWqC,EAAMC,CAAU,EAC/BsC,EAAK5E,EAAG8E,CAAI,EAEZA,EAAI,CAIZ,EAAG,EAAI,CACT,EAEMC,EAAQR,EACd,OAAO,IAAI,QAA+B,CAACnC,EAAK4C,IAAO,CACrDJ,EAAKG,EAAO3F,GAAK,CAEf,GAAIA,EAAI,OAAO4F,EAAI5F,CAAE,EAErBgD,EAAIuC,CAAgC,CACtC,CAAC,CACH,CAAC,CACH,CA6BA,SACEJ,EAAyC,KAAK,IAC9CrG,EAAoB,CAAA,EAAE,CAElB,OAAOqG,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBzI,IAC5BoC,EAAOqG,EACPA,EAAQ,KAAK,KAEf,GAAM,CACJ,cAAAC,EAAgB,GAChB,OAAAC,EAAS,GACT,OAAAC,EACA,WAAApC,CAAU,EACRpE,EACEyG,EAAiC,CAAA,GACnC,CAACD,GAAUA,EAAOH,CAAK,IACzBI,EAAQ,KAAKH,EAAgBD,EAAQA,EAAM,SAAQ,CAAE,EAEvD,IAAMlC,EAAO,IAAI,IAAc,CAACkC,CAAK,CAAC,EACtC,QAAWM,KAAOxC,EAAM,CACtB,IAAMJ,EAAU4C,EAAI,YAAW,EAC/B,QAAW7E,KAAKiC,EAAS,EACnB,CAACyC,GAAUA,EAAO1E,CAAC,IACrB2E,EAAQ,KAAKH,EAAgBxE,EAAIA,EAAE,SAAQ,CAAE,EAE/C,IAAIoE,EAA0BpE,EAC9B,GAAIA,EAAE,eAAc,EAAI,CACtB,GAAI,EAAEyE,IAAWL,EAAIpE,EAAE,aAAY,IAAM,SACrCoE,EAAE,UAAS,GAAIA,EAAE,UAAS,CAChC,CACIA,EAAE,WAAW/B,EAAMC,CAAU,GAC/BD,EAAK,IAAI+B,CAAC,CAEd,CACF,CACA,OAAOO,CACT,CAWA,CAAC,OAAO,aAAa,GAAC,CACpB,OAAO,KAAK,QAAO,CACrB,CA+BA,QACEJ,EAAyC,KAAK,IAC9CU,EAAuB,CAAA,EAAE,CAKzB,OAAI,OAAOV,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBzI,IAC5BmJ,EAAUV,EACVA,EAAQ,KAAK,KAER,KAAK,OAAOA,EAAOU,CAAO,EAAE,OAAO,aAAa,EAAC,CAC1D,CAOA,CAAC,OAAO,QAAQ,GAAC,CACf,OAAO,KAAK,YAAW,CACzB,CAuBA,CAAC,YACCV,EAAyC,KAAK,IAC9CrG,EAAoB,CAAA,EAAE,CAElB,OAAOqG,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBzI,IAC5BoC,EAAOqG,EACPA,EAAQ,KAAK,KAEf,GAAM,CACJ,cAAAC,EAAgB,GAChB,OAAAC,EAAS,GACT,OAAAC,EACA,WAAApC,CAAU,EACRpE,GACA,CAACwG,GAAUA,EAAOH,CAAK,KACzB,MAAMC,EAAgBD,EAAQA,EAAM,SAAQ,GAE9C,IAAMlC,EAAO,IAAI,IAAc,CAACkC,CAAK,CAAC,EACtC,QAAWM,KAAOxC,EAAM,CACtB,IAAMJ,EAAU4C,EAAI,YAAW,EAC/B,QAAW7E,KAAKiC,EAAS,EACnB,CAACyC,GAAUA,EAAO1E,CAAC,KACrB,MAAMwE,EAAgBxE,EAAIA,EAAE,SAAQ,GAEtC,IAAIoE,EAA0BpE,EAC9B,GAAIA,EAAE,eAAc,EAAI,CACtB,GAAI,EAAEyE,IAAWL,EAAIpE,EAAE,aAAY,IAAM,SACrCoE,EAAE,UAAS,GAAIA,EAAE,UAAS,CAChC,CACIA,EAAE,WAAW/B,EAAMC,CAAU,GAC/BD,EAAK,IAAI+B,CAAC,CAEd,CACF,CACF,CA2BA,OACEG,EAAyC,KAAK,IAC9CrG,EAAoB,CAAA,EAAE,CAElB,OAAOqG,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBzI,IAC5BoC,EAAOqG,EACPA,EAAQ,KAAK,KAEf,GAAM,CACJ,cAAAC,EAAgB,GAChB,OAAAC,EAAS,GACT,OAAAC,EACA,WAAApC,CAAU,EACRpE,EACEyG,EAAU,IAAIO,GAA4B,CAAE,WAAY,EAAI,CAAE,GAChE,CAACR,GAAUA,EAAOH,CAAK,IACzBI,EAAQ,MAAMH,EAAgBD,EAAQA,EAAM,SAAQ,CAAE,EAExD,IAAMlC,EAAO,IAAI,IACX8C,EAAoB,CAACZ,CAAK,EAC5Ba,EAAa,EACXC,EAAU,IAAK,CACnB,IAAIC,EAAS,GACb,KAAO,CAACA,GAAQ,CACd,IAAMT,EAAMM,EAAM,MAAK,EACvB,GAAI,CAACN,EAAK,CACJO,IAAe,GAAGT,EAAQ,IAAG,EACjC,MACF,CAEAS,IACA/C,EAAK,IAAIwC,CAAG,EAEZ,IAAMU,EAAY,CAChBnG,EACA6C,EACAuD,EAAwB,KACtB,CAEF,GAAIpG,EAAI,OAAOuF,EAAQ,KAAK,QAASvF,CAAE,EAEvC,GAAIqF,GAAU,CAACe,EAAc,CAC3B,IAAMC,EAA4C,CAAA,EAClD,QAAWzF,KAAKiC,EACVjC,EAAE,eAAc,GAClByF,EAAS,KACPzF,EACG,SAAQ,EACR,KAAMoE,GACLA,GAAG,UAAS,EAAKA,EAAE,MAAK,EAAKA,CAAC,CAC/B,EAIT,GAAIqB,EAAS,OAAQ,CACnB,QAAQ,IAAIA,CAAQ,EAAE,KAAK,IACzBF,EAAU,KAAMtD,EAAS,EAAI,CAAC,EAEhC,MACF,CACF,CAEA,QAAWjC,KAAKiC,EACVjC,IAAM,CAAC0E,GAAUA,EAAO1E,CAAC,KACtB2E,EAAQ,MAAMH,EAAgBxE,EAAIA,EAAE,SAAQ,CAAE,IACjDsF,EAAS,KAKfF,IACA,QAAWpF,KAAKiC,EAAS,CACvB,IAAMmC,EAAIpE,EAAE,eAAc,GAAMA,EAC5BoE,EAAE,WAAW/B,EAAMC,CAAU,GAC/B6C,EAAM,KAAKf,CAAC,CAEhB,CACIkB,GAAU,CAACX,EAAQ,QACrBA,EAAQ,KAAK,QAASU,CAAO,EACnBK,GACVL,EAAO,CAEX,EAGIK,EAAO,GACXb,EAAI,UAAUU,EAAW,EAAI,EAC7BG,EAAO,EACT,CACF,EACA,OAAAL,EAAO,EACAV,CACT,CA8BA,WACEJ,EAAyC,KAAK,IAC9CrG,EAAoB,CAAA,EAAE,CAElB,OAAOqG,GAAU,SACnBA,EAAQ,KAAK,IAAI,QAAQA,CAAK,EACnBA,aAAiBzI,IAC5BoC,EAAOqG,EACPA,EAAQ,KAAK,KAEf,GAAM,CACJ,cAAAC,EAAgB,GAChB,OAAAC,EAAS,GACT,OAAAC,EACA,WAAApC,CAAU,EACRpE,EACEyG,EAAU,IAAIO,GAA4B,CAAE,WAAY,EAAI,CAAE,EAC9D7C,EAAO,IAAI,KACb,CAACqC,GAAUA,EAAOH,CAAK,IACzBI,EAAQ,MAAMH,EAAgBD,EAAQA,EAAM,SAAQ,CAAE,EAExD,IAAMY,EAAoB,CAACZ,CAAK,EAC5Ba,EAAa,EACXC,EAAU,IAAK,CACnB,IAAIC,EAAS,GACb,KAAO,CAACA,GAAQ,CACd,IAAMT,EAAMM,EAAM,MAAK,EACvB,GAAI,CAACN,EAAK,CACJO,IAAe,GAAGT,EAAQ,IAAG,EACjC,MACF,CACAS,IACA/C,EAAK,IAAIwC,CAAG,EAEZ,IAAM5C,EAAU4C,EAAI,YAAW,EAC/B,QAAW7E,KAAKiC,GACV,CAACyC,GAAUA,EAAO1E,CAAC,KAChB2E,EAAQ,MAAMH,EAAgBxE,EAAIA,EAAE,SAAQ,CAAE,IACjDsF,EAAS,KAIfF,IACA,QAAWpF,KAAKiC,EAAS,CACvB,IAAImC,EAA0BpE,EAC9B,GAAIA,EAAE,eAAc,EAAI,CACtB,GAAI,EAAEyE,IAAWL,EAAIpE,EAAE,aAAY,IAAM,SACrCoE,EAAE,UAAS,GAAIA,EAAE,UAAS,CAChC,CACIA,EAAE,WAAW/B,EAAMC,CAAU,GAC/B6C,EAAM,KAAKf,CAAC,CAEhB,CACF,CACIkB,GAAU,CAACX,EAAQ,SAASA,EAAQ,KAAK,QAASU,CAAO,CAC/D,EACA,OAAAA,EAAO,EACAV,CACT,CAEA,MAAMxG,EAAsB,KAAK,IAAG,CAClC,IAAMqE,EAAS,KAAK,IACpB,KAAK,IAAM,OAAOrE,GAAS,SAAW,KAAK,IAAI,QAAQA,CAAI,EAAIA,EAC/D,KAAK,IAAItC,EAAQ,EAAE2G,CAAM,CAC3B,GAwEWM,GAAP,cAA+BI,EAAc,CAIjD,IAAY,KAEZ,YACEG,EAAoB,QAAQ,IAAG,EAC/BnF,EAAuB,CAAA,EAAE,CAEzB,GAAM,CAAE,OAAAF,EAAS,EAAI,EAAKE,EAC1B,MAAMmF,EAAKT,GAAO,KAAM,CAAE,GAAG1E,EAAM,OAAAF,CAAM,CAAE,EAC3C,KAAK,OAASA,EACd,QAASM,EAA0B,KAAK,IAAKA,EAAGA,EAAIA,EAAE,OACpDA,EAAE,OAAS,KAAK,MAEpB,CAKA,cAAcuG,EAAW,CAIvB,OAAOjC,GAAM,MAAMiC,CAAG,EAAE,KAAK,YAAW,CAC1C,CAKA,QAAQpB,EAAW,CACjB,OAAO,IAAIf,GACT,KAAK,SACLzI,GACA,OACA,KAAK,MACL,KAAK,OACL,KAAK,cAAa,EAClB,CAAE,GAAAwJ,CAAE,CAAE,CAEV,CAKA,WAAWnF,EAAS,CAClB,OACEA,EAAE,WAAW,GAAG,GAAKA,EAAE,WAAW,IAAI,GAAK,kBAAkB,KAAKA,CAAC,CAEvE,GAUWqH,GAAP,cAA+BzC,EAAc,CAIjD,IAAW,IACX,YACEG,EAAoB,QAAQ,IAAG,EAC/BnF,EAAuB,CAAA,EAAE,CAEzB,GAAM,CAAE,OAAAF,EAAS,EAAK,EAAKE,EAC3B,MAAMmF,EAAKuC,GAAO,IAAK,CAAE,GAAG1H,EAAM,OAAAF,CAAM,CAAE,EAC1C,KAAK,OAASA,CAChB,CAKA,cAAc6H,EAAY,CACxB,MAAO,GACT,CAKA,QAAQpC,EAAW,CACjB,OAAO,IAAIV,GACT,KAAK,SACL9I,GACA,OACA,KAAK,MACL,KAAK,OACL,KAAK,cAAa,EAClB,CAAE,GAAAwJ,CAAE,CAAE,CAEV,CAKA,WAAWnF,EAAS,CAClB,OAAOA,EAAE,WAAW,GAAG,CACzB,GAWWwH,GAAP,cAAgCH,EAAe,CACnD,YACEtC,EAAoB,QAAQ,IAAG,EAC/BnF,EAAuB,CAAA,EAAE,CAEzB,GAAM,CAAE,OAAAF,EAAS,EAAI,EAAKE,EAC1B,MAAMmF,EAAK,CAAE,GAAGnF,EAAM,OAAAF,CAAM,CAAE,CAChC,GAQW+H,GAAO,QAAQ,WAAa,QAAUrD,GAAYK,GASlDiD,GAIX,QAAQ,WAAa,QAAUlD,GAC7B,QAAQ,WAAa,SAAWgD,GAChCH,GE3wFJ,IAAMM,GAAc,CAACC,EAAU,IAC7B,OAAOA,EAAQ,KAAe,OAAOA,IAAQ,EAElCC,GAAmBC,GAC9B,CAAC,CAACA,GACF,OAAOA,GAAM,UACbH,GAAYG,EAAE,aAAc,SAAS,GACrCH,GAAYG,EAAE,IAAK,QAAQ,GAC3BH,GAAYG,EAAE,WAAY,QAAQ,GAClCH,GAAYG,EAAE,WAAY,QAAQ,GAClCH,GAAYG,EAAE,QAAS,QAAQ,GAC/BH,GAAYG,EAAE,WAAY,QAAQ,IACjCH,GAAYG,EAAE,KAAM,SAAS,GAC3BA,EAAE,MAAQ,OAAOA,EAAE,MAAS,WAC/BH,GAAYG,EAAE,OAAQ,UAAU,EAErBC,GACXD,GAC8B,CAC9B,GAAI,CAACD,GAAgBC,CAAC,EACpB,MAAM,IAAI,MAAM,wBAAwB,CAE5C,EAsBME,GACJC,GAK8B,CAC9BF,GAAoBE,CAAG,EACvB,GAAM,CAAE,KAAAC,EAAM,GAAGC,CAAO,EAAKF,EAC7B,GAAI,CAACC,EACH,OAAOC,EAET,IAAMC,EACJF,IAAS,GACPD,EAAI,OACF,CAAE,OAAQA,EAAI,MAAM,EACpB,CAAA,EACFA,EAAI,OACJ,CACE,OAAQA,EAAI,OACZ,GAAGC,GAELA,EACJ,MAAO,CACL,GAAGC,EACH,KAAM,CACJ,GAAGC,EAGH,SAAU,GACV,cAAe,IAGrB,EAEaC,GAAS,CAACJ,EAA0B,CAAA,IAAOD,GAAQC,CAAG,EACtDK,GAAa,CAACL,EAAyB,CAAA,IAAOD,GAAQC,CAAG,ECnFtE,OAAS,SAAAM,GAAO,WAAAC,OAAe,OAC/B,OAAS,WAAAC,OAAe,OAGxB,IAAMC,GAAU,CAACC,EAAcC,EAA0B,CAAA,IAAM,CAC7D,IAAMC,EAAO,OAAOF,EACpB,GAAIE,IAAS,SAAU,CACrB,IAAMC,EAAOH,GAAQE,IAAS,UAAYF,EAAK,YAKzCI,EACJ,wDAJAD,GAAQA,EAAK,KAAO,kBAAkBA,EAAK,IAAI,GAC7CD,IAAS,SAAWJ,GAAQE,CAAI,EAChC,QAAQE,CAAI,IAAIF,CAAI,EAGF,GACtB,MAAM,OAAO,OAAO,IAAI,UAAUI,CAAG,EAAG,CACtC,KAAAJ,EACA,KAAM,uBACP,CACH,CAEA,GAAI,KAAK,KAAKA,CAAI,EAAG,CAEnB,IAAMI,EAAM,2CACZ,MAAM,OAAO,OAAO,IAAI,UAAUA,CAAG,EAAG,CACtC,KAAAJ,EACA,KAAM,wBACP,CACH,CAEAA,EAAOH,GAAQG,CAAI,EACnB,GAAM,CAAE,KAAAK,CAAI,EAAKT,GAAMI,CAAI,EAE3B,GAAIA,IAASK,GAAQJ,EAAI,eAAiB,GAAO,CAC/C,IAAMG,EACJ,+DACF,MAAM,OAAO,OAAO,IAAI,MAAMA,CAAG,EAAG,CAClC,KAAAJ,EACA,KAAM,oBACP,CACH,CAEA,GAAI,QAAQ,WAAa,QAAS,CAChC,IAAMM,EAAc,YACd,CAAE,KAAAD,CAAI,EAAKT,GAAMI,CAAI,EAC3B,GAAIM,EAAY,KAAKN,EAAK,UAAUK,EAAK,MAAM,CAAC,EAC9C,MAAM,OAAO,OAAO,IAAI,MAAM,6BAA6B,EAAG,CAC5D,KAAAL,EACA,KAAM,SACP,CAEL,CAEA,OAAOA,CACT,EAEAO,GAAeR,GCxDf,OAAqB,eAAeS,OAAc,KAClD,OAAOC,OAAgB,cAKvB,OACE,aAAAC,GACA,aAAAC,GACA,cAAAC,GACA,aAAAC,GACA,UAAAC,GACA,YAAAC,GACA,aAAAC,GACA,cAAAC,OACK,KAEA,IAAMC,GAAeC,GAC1BX,GAAOW,EAAM,CAAE,cAAe,EAAI,CAAE,EAEzBC,GAAW,CACtB,MAAOX,GAAW,MAClB,MAAOA,GAAW,MAClB,QAAUU,GACRV,GAAW,QAAQU,EAAM,CAAE,cAAe,EAAI,CAAE,EAClD,OAAQV,GAAW,OACnB,GAAIA,GAAW,GACf,MAAOA,GAAW,MAClB,KAAMA,GAAW,KACjB,MAAOA,GAAW,MAClB,OAAQA,GAAW,QCvBrB,OAAS,SAAAY,GAAO,WAAAC,OAAe,OCJ/B,GAAM,CAAE,QAAAC,EAAO,EAAKC,GAEPC,GAAkBC,GAC7BH,GAAQG,CAAI,EAAE,MAAMC,GAAMA,CAAW,EAC1BC,GAAsBF,GAAgB,CACjD,GAAI,CACF,OAAOG,GAAYH,CAAI,CACzB,OAASC,EAAI,CACX,OAAOA,CACT,CACF,ECbA,IAAMG,GAAYC,GAChB,CAAC,CAACA,GAAK,OAAOA,GAAM,SAEhBC,GAAY,CAACD,EAA4BE,IAC7CA,KAAOF,GAAK,OAAOA,EAAEE,CAAG,GAAM,SAEnBC,GACXH,GAIGD,GAASC,CAAC,GAAKC,GAAUD,EAAG,MAAM,GAAKC,GAAUD,EAAG,MAAM,EAElDI,EAAaC,GACxBN,GAASM,CAAE,GAAKJ,GAAUI,EAAI,MAAM,EAAIA,EAAG,KAAO,KCZ7C,IAAMC,GAAe,MAAUC,EAAeC,IACnDD,EAAE,MAAME,GAAK,CACX,GAAIC,EAAUD,CAAE,IAAM,SAGtB,MAAMD,GAAWC,CACnB,CAAC,EAEUE,GAAmB,CAAIC,EAAaJ,IAAqB,CACpE,GAAI,CACF,OAAOI,EAAE,CACX,OAASH,EAAI,CACX,GAAIC,EAAUD,CAAE,IAAM,SACpB,OAEF,MAAMD,GAAWC,CACnB,CACF,EHNA,GAAM,CAAE,MAAAI,GAAO,MAAAC,GAAO,OAAAC,EAAM,EAAKC,GAEpBC,GAAc,MACzBC,EACAC,KAEAA,GAAK,QAAQ,eAAc,EAExB,MAAMC,GACLP,GAAMK,CAAI,EAAE,KAAKG,GAAQC,GAAeJ,EAAMC,EAAKE,CAAI,CAAC,CAAC,GACrD,IAIGE,GAAkB,CAACL,EAAcC,KAC5CA,GAAK,QAAQ,eAAc,EAEzBK,GAAiB,IACfC,GAAmBP,EAAMC,EAAKO,GAAUR,CAAI,CAAC,CAAC,GAC3C,IAIHI,GAAiB,MACrBJ,EACAC,EACAQ,IACoB,CACpBR,GAAK,QAAQ,eAAc,EAC3B,IAAMS,EAAUD,EAAI,YAAW,EAAK,MAAME,GAAeX,CAAI,EAAI,KACjE,GAAI,CAAC,MAAM,QAAQU,CAAO,EAAG,CAI3B,GAAIA,EAAS,CACX,GAAIE,EAAUF,CAAO,IAAM,SACzB,MAAO,GAET,GAAIE,EAAUF,CAAO,IAAM,UACzB,MAAMA,CAEV,CAEA,OAAIT,EAAI,QAAU,CAAE,MAAMA,EAAI,OAAOD,EAAMS,CAAG,EACrC,IAET,MAAMP,GAAaL,GAAOG,CAAI,CAAC,EACxB,GACT,CAqBA,MAXI,EAPF,MAAM,QAAQ,IACZU,EAAQ,IAAID,GACVL,GAAeS,GAAQb,EAAMS,EAAI,IAAI,EAAGR,EAAKQ,CAAG,CAAC,CAClD,GAEH,MAAMK,GAAKA,IAAM,EAAI,GASnBb,EAAI,eAAiB,IAASD,IAASe,GAAMf,CAAI,EAAE,MAInDC,EAAI,QAAU,CAAE,MAAMA,EAAI,OAAOD,EAAMS,CAAG,EACrC,IAGT,MAAMP,GAAaN,GAAMI,CAAI,CAAC,EACvB,GACT,EAEMO,GAAqB,CACzBP,EACAC,EACAQ,IACW,CACXR,GAAK,QAAQ,eAAc,EAC3B,IAAMS,EAAUD,EAAI,YAAW,EAAKO,GAAmBhB,CAAI,EAAI,KAC/D,GAAI,CAAC,MAAM,QAAQU,CAAO,EAAG,CAI3B,GAAIA,EAAS,CACX,GAAIE,EAAUF,CAAO,IAAM,SACzB,MAAO,GAET,GAAIE,EAAUF,CAAO,IAAM,UACzB,MAAMA,CAEV,CAEA,OAAIT,EAAI,QAAU,CAACA,EAAI,OAAOD,EAAMS,CAAG,EAC9B,IAETH,GAAiB,IAAMW,GAAWjB,CAAI,CAAC,EAChC,GACT,CACA,IAAIkB,EAAsB,GAC1B,QAAWT,KAAOC,EAAS,CACzB,IAAMS,EAAIN,GAAQb,EAAMS,EAAI,IAAI,EAChCS,EAAaX,GAAmBY,EAAGlB,EAAKQ,CAAG,GAAKS,CAClD,CASA,OARIjB,EAAI,eAAiB,IAASD,IAASe,GAAMf,CAAI,EAAE,MAInD,CAACkB,GAIDjB,EAAI,QAAU,CAACA,EAAI,OAAOD,EAAMS,CAAG,EAC9B,IAGTH,GAAiB,IAAMc,GAAUpB,CAAI,CAAC,EAC/B,GACT,EI5HA,OAAS,SAAAqB,GAAO,WAAAC,OAAe,OCR/B,GAAM,CAAE,MAAAC,EAAK,EAAKC,GAELC,GACVC,GACD,MAAOC,GAA+B,CACpC,GAAI,CACF,OAAO,KAAM,MAAMC,GAAaF,EAAGC,CAAI,CAAC,CAC1C,OAASE,EAAI,CACX,GAAIC,EAAUD,CAAE,IAAM,QACpB,OACI,MAAMD,GACNL,GAAMI,EAAM,GAAK,EAAE,KAAK,IAAM,EAAI,EAClCE,CAAE,EAKC,KAAM,MAAMH,EAAGC,CAAI,EAFxB,OAIJ,MAAME,CACR,CACF,EAEWE,GACVL,GACAC,GAAsB,CACrB,GAAI,CACF,OAAO,KAAKK,GAAiB,IAAMN,EAAGC,CAAI,CAAC,CAC7C,OAASE,EAAI,CACX,GAAIC,EAAUD,CAAE,IAAM,QACpB,OAAKG,GAAiB,KAAOC,GAAUN,EAAM,GAAK,EAAG,IAAOE,CAAE,EAGvD,KAAKH,EAAGC,CAAI,EAFjB,OAIJ,MAAME,CACR,CACF,ECtCF,OAAS,cAAAK,OAAkB,kBAIpB,IAAMC,GAAa,IACbC,GAAO,IACPC,GAAa,GACbC,GAAQ,IAAI,IAAI,CAAC,SAAU,SAAU,OAAO,CAAC,EAE7CC,GAAgBC,GAAoC,CAC/D,IAAMC,EAAS,MACbC,EACAC,EACAC,EAAU,EACVC,EAAQ,IACN,CACF,IAAMC,EAAMH,EAAI,YAAcR,GACxBY,EAAOJ,EAAI,SAAWP,GACtBY,EAAML,EAAI,YAAcN,GAC1BY,EAAU,EACd,OACE,GAAI,CACF,OAAO,MAAMT,EAAGE,CAAI,CACtB,OAASQ,EAAI,CACX,GAAIC,GAAUD,CAAE,GAAKA,EAAG,OAASR,GAAQJ,GAAM,IAAIY,EAAG,IAAI,EAAG,CAG3D,GAFAN,EAAU,KAAK,KAAKA,EAAUG,CAAI,EAClCF,EAAQD,EAAUC,EACdA,EAAQC,EACV,aAAMM,GAAWR,CAAO,EACjBH,EAAOC,EAAMC,EAAKC,EAASC,CAAK,EAEzC,GAAII,EAAUD,EAAK,CACjBC,IACA,QACF,CACF,CACA,MAAMC,CACR,CAEJ,EAEA,OAAOT,CACT,EAGaY,GAAoBb,GAChB,CAACE,EAAcC,IAAsB,CAClD,IAAMK,EAAML,EAAI,YAAcN,GAC1BY,EAAU,EACd,OACE,GAAI,CACF,OAAOT,EAAGE,CAAI,CAChB,OAASQ,EAAI,CACX,GACEC,GAAUD,CAAE,GACZA,EAAG,OAASR,GACZJ,GAAM,IAAIY,EAAG,IAAI,GACjBD,EAAUD,EACV,CACAC,IACA,QACF,CACA,MAAMC,CACR,CAEJ,ECtDF,OAAS,YAAAI,GAAU,SAAAC,GAAO,WAAAC,OAAe,OCHzC,OAAS,UAAAC,OAAc,KACvB,OAAS,SAAAC,GAAO,WAAAC,OAAe,OAE/B,GAAM,CAAE,KAAAC,EAAI,EAAKC,GAEXC,GAAaC,GAAgB,CACjC,GAAI,CACF,OAAOC,GAASD,CAAI,EAAE,YAAW,CACnC,MAAQ,CACN,MAAO,EACT,CACF,EAEME,GAASF,GACbH,GAAKG,CAAI,EAAE,KACTG,GAAMA,EAAG,YAAW,EACpB,IAAM,EAAK,EAGTC,GAAkB,MAAOJ,GAAgB,CAC7C,GAAM,CAAE,KAAAK,CAAI,EAAKC,GAAMN,CAAI,EACrBO,EAAMC,GAAM,EACZ,CAAE,KAAMC,CAAO,EAAKH,GAAMC,CAAG,EACnC,GAAIF,EAAK,YAAW,IAAOI,EAAQ,YAAW,EAC5C,OAAOF,EAGT,IAAMG,EAAWC,GAAQN,EAAM,OAAO,EACtC,OAAI,MAAMH,GAAMQ,CAAQ,EACfA,EAGFL,CACT,EAEMO,GAAuBZ,GAAgB,CAC3C,GAAM,CAAE,KAAAK,CAAI,EAAKC,GAAMN,CAAI,EACrBO,EAAMC,GAAM,EACZ,CAAE,KAAMC,CAAO,EAAKH,GAAMC,CAAG,EACnC,GAAIF,EAAK,YAAW,IAAOI,EAAQ,YAAW,EAC5C,OAAOF,EAGT,IAAMG,EAAWC,GAAQN,EAAM,OAAO,EACtC,OAAIN,GAAUW,CAAQ,EACbA,EAGFL,CACT,EAGMQ,GAAkB,SAAYL,GAAM,EACpCM,GAAsB,IAAMN,GAAM,EAE3BO,GACX,QAAQ,WAAa,QAAUX,GAAkBS,GACtCG,GACX,QAAQ,WAAa,QAAUJ,GAAsBE,GDxCvD,GAAM,CAAE,MAAAG,GAAO,OAAAC,GAAQ,OAAAC,GAAQ,MAAAC,EAAK,EAAKC,GAGnCC,GAAkBC,GACtB,IAAIC,GAASD,CAAI,CAAC,IAAI,KAAK,OAAM,CAAE,GAE/BE,GAAiBC,GAASP,EAAM,EAChCQ,GAAqBC,GAAaC,EAAU,EAErCC,GAAmB,MAC9BP,EACAQ,KAEAA,GAAK,QAAQ,eAAc,EAExB,MAAMC,GACLf,GAAMM,CAAI,EAAE,KAAKU,GAAQC,GAAoBX,EAAMQ,EAAKE,CAAI,CAAC,CAAC,GAC1D,IAIJC,GAAsB,MAC1BX,EACAQ,EACAI,IACoB,CAEpB,GADAJ,GAAK,QAAQ,eAAc,EACvB,CAACA,EAAI,IACP,OAAOG,GACLX,EACA,CAAE,GAAGQ,EAAK,IAAK,MAAMK,GAAWb,CAAI,CAAC,EACrCY,CAAG,EAGP,GAAIZ,IAASQ,EAAI,KAAOM,GAAMd,CAAI,EAAE,OAASA,EAC3C,MAAM,IAAI,MAAM,gDAAgD,EAGlE,IAAMe,EAAUH,EAAI,YAAW,EAAK,MAAMI,GAAehB,CAAI,EAAI,KACjE,GAAI,CAAC,MAAM,QAAQe,CAAO,EAAG,CAI3B,GAAIA,EAAS,CACX,GAAIE,EAAUF,CAAO,IAAM,SACzB,MAAO,GAET,GAAIE,EAAUF,CAAO,IAAM,UACzB,MAAMA,CAEV,CAEA,OAAIP,EAAI,QAAU,CAAE,MAAMA,EAAI,OAAOR,EAAMY,CAAG,EACrC,IAET,MAAMH,GAAaS,GAAUlB,EAAMQ,EAAI,IAAKN,EAAc,CAAC,EACpD,GACT,CAmBA,MAVI,EANF,MAAM,QAAQ,IACZa,EAAQ,IAAIH,GACVD,GAAoBQ,GAAQnB,EAAMY,EAAI,IAAI,EAAGJ,EAAKI,CAAG,CAAC,CACvD,GAEH,MAAMQ,GAAKA,IAAM,EAAI,GAQnBZ,EAAI,eAAiB,IAASR,IAASc,GAAMd,CAAI,EAAE,MAGnDQ,EAAI,QAAU,CAAE,MAAMA,EAAI,OAAOR,EAAMY,CAAG,EACrC,IAET,MAAMH,GAAaS,GAAUlB,EAAMQ,EAAI,IAAKX,EAAK,CAAC,EAC3C,GACT,EAEMqB,GAAY,MAChBlB,EACAqB,EACAC,IACE,CACF,IAAMC,EAAUJ,GAAQE,EAAKtB,GAAeC,CAAI,CAAC,EACjD,aAAML,GAAOK,EAAMuB,CAAO,EACnB,MAAMD,EAAGC,CAAO,CACzB,EAEaC,GAAuB,CAClCxB,EACAQ,KAEAA,GAAK,QAAQ,eAAc,EAEzBiB,GAAiB,IACfC,GAAwB1B,EAAMQ,EAAKmB,GAAU3B,CAAI,CAAC,CAAC,GAChD,IAIH0B,GAA0B,CAC9B1B,EACAQ,EACAI,IACW,CAEX,GADAJ,GAAK,QAAQ,eAAc,EACvB,CAACA,EAAI,IACP,OAAOkB,GACL1B,EACA,CAAE,GAAGQ,EAAK,IAAKoB,GAAe5B,CAAI,CAAC,EACnCY,CAAG,EAGP,IAAMS,EAAcb,EAAI,IAExB,GAAIR,IAASQ,EAAI,KAAOM,GAAMd,CAAI,EAAE,OAASA,EAC3C,MAAM,IAAI,MAAM,gDAAgD,EAGlE,IAAMe,EAAUH,EAAI,YAAW,EAAKiB,GAAmB7B,CAAI,EAAI,KAC/D,GAAI,CAAC,MAAM,QAAQe,CAAO,EAAG,CAI3B,GAAIA,EAAS,CACX,GAAIE,EAAUF,CAAO,IAAM,SACzB,MAAO,GAET,GAAIE,EAAUF,CAAO,IAAM,UACzB,MAAMA,CAEV,CAEA,OAAIP,EAAI,QAAU,CAACA,EAAI,OAAOR,EAAMY,CAAG,EAC9B,IAETa,GAAiB,IAAMK,GAAc9B,EAAMqB,EAAKjB,EAAkB,CAAC,EAC5D,GACT,CAEA,IAAI2B,EAAa,GACjB,QAAWnB,KAAOG,EAAS,CACzB,IAAMiB,EAAIb,GAAQnB,EAAMY,EAAI,IAAI,EAChCmB,EAAaL,GAAwBM,EAAGxB,EAAKI,CAAG,GAAKmB,CACvD,CAOA,MANI,CAACA,GAGDvB,EAAI,eAAiB,IAASR,IAASc,GAAMd,CAAI,EAAE,MAGnDQ,EAAI,QAAU,CAACA,EAAI,OAAOR,EAAMY,CAAG,EAC9B,IAETa,GAAiB,IAAMK,GAAc9B,EAAMqB,EAAKY,EAAS,CAAC,EACnD,GACT,EAEMH,GAAgB,CACpB9B,EACAqB,EACAa,IACE,CACF,IAAMX,EAAUJ,GAAQE,EAAKtB,GAAeC,CAAI,CAAC,EACjD,OAAAmC,GAAWnC,EAAMuB,CAAO,EACjBW,EAAOX,CAAO,CACvB,EHhLA,GAAM,CAAE,OAAAa,GAAQ,MAAAC,GAAO,MAAAC,EAAK,EAAKC,GAE3BC,GAAoBC,GAAUC,GAASN,EAAM,CAAC,EAC9CO,GAAwBC,GAAcC,GAAaC,EAAU,CAAC,EAC9DC,GAAwBN,GAAUC,GAASL,EAAK,CAAC,EACjDW,GAA4BJ,GAAcC,GAAaI,EAAS,CAAC,EAEjEC,GAAqC,MACzCC,EAGA,CAAE,OAAAC,EAAQ,GAAGC,CAAG,IACI,CAEpBA,GAAK,QAAQ,eAAc,EAC3B,GAAI,CACF,aAAMN,GAAsBI,EAAME,CAAG,EAC9B,EACT,OAASC,EAAI,CACX,GAAIC,EAAUD,CAAE,IAAM,YACpB,OAAOE,GAAiBL,EAAME,CAAG,EAEnC,MAAMC,CACR,CACF,EAEMG,GAAyC,CAC7CN,EAGA,CAAE,OAAAC,EAAQ,GAAGC,CAAG,IACL,CACXA,GAAK,QAAQ,eAAc,EAC3B,GAAI,CACF,OAAAL,GAA0BG,EAAME,CAAG,EAC5B,EACT,OAASC,EAAI,CACX,GAAIC,EAAUD,CAAE,IAAM,YACpB,OAAOI,GAAqBP,EAAME,CAAG,EAEvC,MAAMC,CACR,CACF,EAEMK,GAAQ,OAAO,OAAO,EACtBC,GAAQ,OAAO,OAAO,EACtBC,GAAS,OAAO,QAAQ,EAEjBC,GAAgB,MAC3BX,EACAE,KAEAA,GAAK,QAAQ,eAAc,EAExB,MAAMU,GACLzB,GAAMa,CAAI,EAAE,KAAKa,GAAQC,GAAiBd,EAAME,EAAKW,EAAML,EAAK,CAAC,CAAC,GAC9D,IAIGO,GAAoB,CAC/Bf,EACAE,KAEAA,GAAK,QAAQ,eAAc,EAEzBc,GAAiB,IACfC,GAAqBjB,EAAME,EAAKgB,GAAUlB,CAAI,EAAGQ,EAAK,CAAC,GACpD,IAIHM,GAAmB,MACvBd,EACAE,EACAiB,EACAC,EAAQZ,KACY,CACpBN,GAAK,QAAQ,eAAc,EAE3B,IAAMmB,EAAUF,EAAI,YAAW,EAAK,MAAMG,GAAetB,CAAI,EAAI,KACjE,GAAI,CAAC,MAAM,QAAQqB,CAAO,EAAG,CAI3B,GAAIA,EAAS,CACX,GAAIjB,EAAUiB,CAAO,IAAM,SACzB,MAAO,GAET,GAAIjB,EAAUiB,CAAO,IAAM,UACzB,MAAMA,CAEV,CAEA,OAAInB,EAAI,QAAU,CAAE,MAAMA,EAAI,OAAOF,EAAMmB,CAAG,EACrC,IAGT,MAAMP,GAAavB,GAAkBW,EAAME,CAAG,CAAC,EACxC,GACT,CAEA,IAAMqB,EAAIH,IAAUZ,GAAQC,GAAQW,EAC9BI,GACJ,MAAM,QAAQ,IACZH,EAAQ,IAAIF,GACVL,GAAiBW,GAAQzB,EAAMmB,EAAI,IAAI,EAAGjB,EAAKiB,EAAKI,CAAC,CAAC,CACvD,GAEH,MAAMG,GAAKA,IAAM,EAAI,EAEvB,GAAIN,IAAUZ,GACZ,OAAOM,GAAiBd,EAAME,EAAKiB,EAAKT,EAAM,EACzC,GAAIU,IAAUV,GAAQ,CAO3B,GANIR,EAAI,eAAiB,IAASF,IAAS2B,GAAM3B,CAAI,EAAE,MAGnD,CAACwB,GAGDtB,EAAI,QAAU,CAAE,MAAMA,EAAI,OAAOF,EAAMmB,CAAG,EAC5C,MAAO,GAET,MAAMP,GAAab,GAAmCC,EAAME,CAAG,CAAC,CAClE,CACA,MAAO,EACT,EAEMe,GAAuB,CAC3BjB,EACAE,EACAiB,EACAC,EAAQZ,KACG,CACX,IAAMa,EAAUF,EAAI,YAAW,EAAKS,GAAmB5B,CAAI,EAAI,KAC/D,GAAI,CAAC,MAAM,QAAQqB,CAAO,EAAG,CAI3B,GAAIA,EAAS,CACX,GAAIjB,EAAUiB,CAAO,IAAM,SACzB,MAAO,GAET,GAAIjB,EAAUiB,CAAO,IAAM,UACzB,MAAMA,CAEV,CAEA,OAAInB,EAAI,QAAU,CAACA,EAAI,OAAOF,EAAMmB,CAAG,EAC9B,IAGTH,GAAiB,IAAMxB,GAAsBQ,EAAME,CAAG,CAAC,EAChD,GACT,CAEA,IAAIsB,EAAa,GACjB,QAAWL,KAAOE,EAAS,CACzB,IAAME,EAAIH,IAAUZ,GAAQC,GAAQW,EAC9BS,EAAIJ,GAAQzB,EAAMmB,EAAI,IAAI,EAChCK,EAAaP,GAAqBY,EAAG3B,EAAKiB,EAAKI,CAAC,GAAKC,CACvD,CAEA,GAAIJ,IAAUZ,GACZ,OAAOS,GAAqBjB,EAAME,EAAKiB,EAAKT,EAAM,EAC7C,GAAIU,IAAUV,GAAQ,CAO3B,GANIR,EAAI,eAAiB,IAASF,IAAS2B,GAAM3B,CAAI,EAAE,MAGnD,CAACwB,GAGDtB,EAAI,QAAU,CAACA,EAAI,OAAOF,EAAMmB,CAAG,EACrC,MAAO,GAETH,GAAiB,IACfV,GAAuCN,EAAME,CAAG,CAAC,CAErD,CACA,MAAO,EACT,EKxMO,IAAM4B,GACX,QAAQ,WAAa,QAAUC,GAAgBC,GACpCC,GACX,QAAQ,WAAa,QAAUC,GAAoBC,GCJrD,GAAM,CAAE,GAAAC,EAAE,EAAKC,GAEFC,GAAe,MAC1BC,EACAC,KAEA,MAAMJ,GAAGG,EAAM,CACb,GAAGC,EACH,MAAO,GACP,UAAW,GACZ,EACM,IAGIC,GAAmB,CAC9BF,EACAC,KAEAE,GAAOH,EAAM,CACX,GAAGC,EACH,MAAO,GACP,UAAW,GACZ,EACM,ICtBT,GAAM,CAACG,GAAQ,EAAGC,GAAQ,CAAC,EAAI,QAAQ,QACpC,QAAQ,KAAM,EAAE,EAChB,MAAM,GAAG,EACT,IAAIC,GAAK,SAASA,EAAG,EAAE,CAAC,EACrBC,GAAYH,GAAQ,IAAOA,KAAU,IAAMC,IAAS,GAI7CG,GACX,CAACD,IAAa,QAAQ,WAAa,QACjC,IAAM,GACNE,GAAO,CAACA,GAAK,QAAU,CAACA,GAAK,OACpBC,GACX,CAACH,IAAa,QAAQ,WAAa,QACjC,IAAM,GACNE,GAAO,CAACA,GAAK,QAAU,CAACA,GAAK,OCQjC,IAAME,GACHC,GACD,MACEC,EACAC,IACoB,CACpB,IAAMC,EAAUC,GAAOF,CAAG,EAI1B,OAHIC,EAAQ,OACVF,EAAO,MAAMI,GAAKJ,EAAME,EAAQ,IAAI,GAElC,MAAM,QAAQF,CAAI,EACb,CAAC,EACN,MAAM,QAAQ,IAAIA,EAAK,IAAIK,GAAKN,EAAGO,GAAQD,EAAGH,CAAO,EAAGA,CAAO,CAAC,CAAC,GACjE,OAAO,CAACK,EAAGC,IAAMD,GAAKC,EAAG,EAAI,EAExB,CAAC,CAAE,MAAMT,EAAGO,GAAQN,EAAME,CAAO,EAAGA,CAAO,CAEtD,EAEIO,GACHV,GACD,CAACC,EAAyBC,IAAoC,CAC5D,IAAMC,EAAUQ,GAAWT,CAAG,EAI9B,OAHIC,EAAQ,OACVF,EAAOW,GAASX,EAAME,EAAQ,IAAI,GAEhC,MAAM,QAAQF,CAAI,EACb,CAAC,CAACA,EACN,IAAIK,GAAKN,EAAGO,GAAQD,EAAGH,CAAO,EAAGA,CAAO,CAAC,EACzC,OAAO,CAACK,EAAGC,IAAMD,GAAKC,EAAG,EAAI,EAEzB,CAAC,CAACT,EAAGO,GAAQN,EAAME,CAAO,EAAGA,CAAO,CAE/C,EAEWU,GAAaH,GAASI,EAAgB,EACtCC,GAAS,OAAO,OAAOhB,GAAKiB,EAAY,EAAG,CACtD,KAAMH,GACP,EAEYI,GAAaP,GAASQ,EAAgB,EACtCC,GAAS,OAAO,OAAOpB,GAAKqB,EAAY,EAAG,CACtD,KAAMH,GACP,EAEYI,GAAcX,GAASY,EAAiB,EACxCC,GAAU,OAAO,OAAOxB,GAAKyB,EAAa,EAAG,CACxD,KAAMH,GACP,EAEYI,GAAYf,GAASgB,EAAe,EACpCC,GAAQ,OAAO,OAAO5B,GAAK6B,EAAW,EAAG,CAAE,KAAMH,EAAS,CAAE,EAE5DI,GAAiBnB,GAASoB,EAAoB,EAC9CC,GAAa,OAAO,OAAOhC,GAAKiC,EAAgB,EAAG,CAC9D,KAAMH,GACP,EAEYI,GAAavB,GAAS,CAACT,EAAMC,IACxCgC,GAAchC,CAAG,EACfY,GAAiBb,EAAMC,CAAG,EAC1BgB,GAAiBjB,EAAMC,CAAG,CAAC,EAI/B,IAAMiC,GAAUC,GAAK,CAACC,EAAMC,IAC1BC,GAAUD,CAAG,EAAIE,GAAaH,EAAMC,CAAG,EAAIG,GAAaJ,EAAMC,CAAG,CAAC,EAEvDI,GAAS,OAAO,OAAOP,GAAS,CAC3C,OAAQA,GACR,KAAMQ,GACN,WAAYA,GACZ,OAAAC,GACA,WAAAC,GACA,OAAAC,GACA,WAAAC,GACA,MAAAC,GACA,UAAAC,GACA,QAAAC,GACA,YAAAC,GACA,WAAAC,GACA,eAAAC,GACD,EACDX,GAAO,OAASA,GnB1EhB,IAAMY,GAAqBC,GAAe,CACxC,GAAI,CACF,OAAOC,GAAWD,CAAG,CACvB,MAAY,CACV,OAAAD,GAAkBG,GAAQF,CAAG,CAAC,EAC9BG,GAAWH,CAAG,EACPC,GAAWD,CAAG,CACvB,CACF,EAyDA,IAAMI,GAAe,CAACC,EAAWC,IAAc,CAI7C,GAAI,EAAED,EAAI,eAAc,GAAMA,EAAI,YAAW,GAAMA,EAAI,OAAM,GAAK,CAC3DC,EAAK,SAAQ,GAAIC,GAAWD,EAAK,SAAQ,CAAE,EAChD,MACF,CAGA,GAAID,EAAI,eAAc,EAAI,CACxB,IAAMG,EAASC,GAAaJ,EAAI,SAAQ,CAAE,EAC1C,GAAI,CAACC,EAAK,SAAQ,EAAI,CAEpB,IADWA,EAAK,eAAc,GAAMG,GAAaH,EAAK,SAAQ,CAAE,KACrDE,EAAQ,OACnBD,GAAWD,EAAK,SAAQ,CAAE,CAC5B,CAIA,GAHAI,GAAkBC,GAAQL,EAAK,SAAQ,CAAE,CAAC,EAC1CM,GAAYJ,EAAQF,EAAK,SAAQ,CAAE,EAE/BO,GAAU,WAAaR,EAAI,KAC7B,GAAI,CACFS,GAAUR,EAAK,SAAQ,EAAID,EAAI,IAAI,CACrC,MAAQ,CAAC,CAGX,MACF,CAEA,GAAIA,EAAI,YAAW,EACZC,EAAK,YAAW,GACnBI,GAAkBJ,EAAK,SAAQ,CAAE,MAE9B,CAEL,IAAIS,EAAQ,GAGZ,GAFI,CAACT,EAAK,SAAQ,GAAM,CAACA,EAAK,OAAM,EAAIC,GAAWD,EAAK,SAAQ,CAAE,EACzDU,GAAiBX,EAAKC,CAAI,IAAGS,EAAQ,IAC1CA,EAAO,CACTL,GAAkBC,GAAQL,EAAK,SAAQ,CAAE,CAAC,EAG1C,GAAI,CACFW,GAASZ,EAAI,SAAQ,EAAIC,EAAK,SAAQ,CAAE,CAC1C,MAAQ,CACNY,GAAab,EAAI,SAAQ,EAAIC,EAAK,SAAQ,CAAE,CAC9C,CAEF,CACF,CAEA,IAAMa,EAAOd,EAAI,KAEZc,GAELL,GAAUR,EAAK,SAAQ,EAAIa,CAAI,CACjC,EAqBA,IAAMC,GAAmB,CAACC,EAAWC,IAAc,CACjD,GAAI,CACF,OACEC,GAAW,QAAQ,EAChB,OAAOC,GAAaH,EAAI,SAAQ,CAAE,CAAC,EACnC,OAAO,KAAK,IACfE,GAAW,QAAQ,EAChB,OAAOC,GAAaF,EAAK,SAAQ,CAAE,CAAC,EACpC,OAAO,KAAK,CAKnB,MAAQ,CACN,MAAO,EACT,CAEF,EAIMG,GAAO,KAAKC,EAAG,GACfC,GAAc,CAACC,EAAWC,IAAsB,CACpD,GAAID,IAAMC,EAAG,MAAO,GACpB,IAAMC,EAAQC,GAASH,EAAGC,CAAC,EACrBG,EAAQD,GAASH,EAAGC,CAAC,EAC3B,MAAI,CAACC,EAAM,WAAWL,EAAI,GAAK,CAACO,EAAM,WAAWP,EAAI,CAEvD,EA+CO,IAAMQ,GAAkB,CAACC,EAAcC,IAAc,CAC1D,IAAMC,EAAS,IAAIC,GAAWH,CAAI,EAC5BI,EAAQC,GAAQL,CAAI,EACpBM,EAAMD,GAAQJ,CAAE,EACtB,GAAIM,GAAQH,CAAK,IAAMA,GAASG,GAAQD,CAAG,IAAMA,EAC/C,MAAM,IAAI,MAAM,4BAA4B,EAE9C,GAAIE,GAAYF,EAAKF,CAAK,EACxB,MAAM,IAAI,MAAM,iDAAiD,EAEnE,GAAM,CAACK,EAAKC,CAAI,EAAI,CAClBC,GAAS,KAAM,CAAE,OAAAT,EAAQ,cAAe,EAAI,CAAE,EAC9CS,GAAS,KAAM,CAAE,IAAKL,EAAK,cAAe,EAAI,CAAE,GAElD,QAAWM,KAAKH,EAAK,CAEnB,GAAI,CAACG,EAAE,OAAQ,MAAM,IAAI,MAAM,4BAA4B,EAE3D,IAAMC,EAAID,EAAE,QAAQP,GAAQC,EAAKM,EAAE,SAAQ,CAAE,CAAC,EACxCE,EAASD,EAAE,OAEjB,GAAI,CAACC,EAAQ,MAAM,IAAI,MAAM,4BAA4B,EAEzDD,EAAE,UAAS,EACXE,GAAkBD,EAAO,SAAQ,CAAE,EACnCE,GAAaJ,EAAGC,CAAC,CACnB,CACA,QAAWA,KAAKH,EAAM,CACpB,IAAME,EAAIV,EAAO,IAAI,QAAQG,GAAQD,EAAOS,EAAE,SAAQ,CAAE,CAAC,EAEzD,GADAD,EAAE,UAAS,EACPA,EAAE,SAAQ,EAGZ,GAAI,CACFK,GAAWJ,EAAE,SAAQ,CAAE,EACvBK,GAAWL,EAAE,SAAQ,CAAE,CACzB,MAAQ,CAAC,CAGb,CACF,EoBnSA,OAAS,aAAAM,OAAiB,KAC1B,OAAS,WAAAC,OAAe,OAExB,IAAAC,GAAe,IAAM,CACnB,GAAM,CAAE,IAAAC,CAAG,EAAKC,EAChB,GAAKD,EACL,GAAI,OAAOA,GAAQ,SACjBE,GAAUC,GAAQH,CAAG,EAAG,GAAK,MAE7B,SAAWI,KAAK,OAAO,OAAOJ,CAAG,EAC/BE,GAAUC,GAAQC,CAAC,EAAG,GAAK,CAE9B,ECZH,OAAS,aAAAC,OAAiB,qBAC1B,OAAS,YAAAC,GAAU,WAAAC,OAAe,kBCDlC,OAAS,iBAAAC,OAAqB,KCK9B,IAAAC,GAAgBC,GAAqC,CACnD,GAAM,CAAE,QAAAC,CAAO,EAAKD,EACpB,GAAKC,EACL,OAAO,OAAO,YACZ,OAAO,QAAQA,CAAO,EAAE,IAAI,CAAC,CAACC,EAAGC,CAAC,IAAM,CACtCD,EACA,OAAOC,GAAM,UAAYA,EAAE,WAAW,QAAQ,EAC5C,KACAA,EACG,UAAU,CAAe,EACzB,QAAQ,eAAgB,OAAO,EAC/B,QAAQ,SAAU,KAAK,EAC1BA,EACH,CAAC,CACH,EDZH,IAAMC,GAAiB,CAACC,EAAWC,IAAmB,CACpD,GAAI,CAACA,EACH,OAAOC,GAAW,GAAGF,CAAC,eAAe,EAEvC,IAAMG,EAAqD,CACzD,KAAMF,IAAS,WAAa,WAAa,SACzC,QAASG,GAAWC,CAAG,GAEzBC,GAAc,GAAGN,CAAC,gBAAiB,KAAK,UAAUG,EAAG,KAAM,CAAC,EAAI;CAAI,CAAC,EAGvEI,EAAe,CAACC,EAAeP,IAAmB,CAC5CA,GAAcQ,EAAMC,EAAM,KAAK,IAAI,aAAa,EAAG,CAAE,MAAAF,EAAO,KAAAP,CAAI,CAAE,EACtEF,GAAeS,EAAOP,CAAI,CAAC,EEnB7B,OACE,cAAAU,GACA,eAAAC,GACA,cAAAC,GACA,iBAAAC,OACK,UACP,OAAS,WAAAC,OAAe,YACxB,OAAS,QAAAC,OAAY,kBCHrB,GAAM,CAAE,YAAAC,GAAc,CAAA,EAAI,iBAAAC,GAAmB,CAAA,CAAE,EAAKC,EAEvCC,GAAP,KAAkB,CACtB,KACA,KACA,IAAM,IAAI,IACV,YAAYC,EAA0BC,EAAc,CAClD,KAAK,KAAOD,EACZ,KAAK,KAAOC,CAAI,CAElB,QAAQC,EAAWC,EAAsB,CACvC,IAAMC,EAAQ,KAAK,OAAS,WAAa,MAAQ,MAC3CC,EAAS,IAAI,KAAK,IAAI,IAAID,CAAK,GACrC,GAAI,CAACF,EAAE,SAASG,CAAM,EAAG,OACzB,IAAMC,EAAKJ,EAAE,UAAU,EAAGA,EAAE,OAASG,EAAO,MAAM,EAAI,MAChDE,EAAMD,EAAK,IACbH,EAAQ,IAAIG,CAAE,EAAG,KAAK,IAAI,IAAIJ,EAAGI,CAAE,EAC9BH,EAAQ,IAAII,CAAG,GAAG,KAAK,IAAI,IAAIL,EAAGK,CAAG,CAAC,CAEjD,CAAC,OAAO,IAAI,4BAA4B,CAAC,GAAI,CAC3C,MAAO,CAAC,KAAK,KAAM,KAAK,GAAG,CAAC,GAI1BC,GAAY,IAAI,IAAyB,CAC7C,CAAC,MAAO,IAAIT,GAAY,WAAY,KAAK,CAAC,EAC3C,EACD,QAAWU,KAAKZ,GACdW,GAAU,IAAIC,EAAG,IAAIV,GAAY,WAAYU,CAAC,CAAC,EACjD,QAAWA,KAAKb,GAAaY,GAAU,IAAIC,EAAG,IAAIV,GAAY,MAAOU,CAAC,CAAC,EAEvE,QAAWP,KAAKQ,GACd,QAAWC,KAAMH,GAAU,OAAM,EAC/BG,EAAG,QAAQT,EAAGQ,EAAO,EAKzB,OAAW,CAACT,EAAMU,CAAE,IAAKH,GAAU,QAAO,EACpCG,EAAG,IAAI,OAAS,GAAGH,GAAU,OAAOP,CAAI,EAG1CO,GAAU,MACJI,EAAMC,EAAM,KAAK,IAAI,oBAAoB,EAAGL,EAAS,EAG/D,IAAAM,EAAeN,GC/Cf,OAAS,WAAAO,GAAS,cAAAC,GAAY,WAAAC,OAAe,YAG7C,OAAS,gBAAAC,GAAc,YAAAC,OAAgB,UCRvC,OAAS,WAAAC,GAAS,WAAAC,OAAe,OAC1B,IAAMC,GAAS,UAAWC,EAAY,CAC3C,IAAKA,EAAOF,GAAQE,CAAI,EAAGA,GAAO,CAChC,MAAMA,EACN,IAAMC,EAAKJ,GAAQG,CAAI,EACvB,GAAIC,IAAOD,EACT,MAEAA,EAAOC,CAEX,CACF,ECTA,IAAMC,GAAcC,GACZ,WAAYA,EACLA,EAAM,OACVA,EAAM,SAAS,IAAID,EAAU,EAAE,KAAK,EAAE,EAG1CE,GAAQF,GCPf,IAAMG,GAAU,CAEZ,OAAQ,EACR,UAAW,IAEX,KAAM,CAACC,EAAQ,MAAa,CACxBD,GAAQ,OAAS,EACjBA,GAAQ,UAAYC,CACxB,CACJ,EAEOC,GAAQF,GCCFG,SAAAC,GAAAC,EAAA,CACX,IAAAC,EAAW,CAAA,EAAXC,aAGIC,EAAAD,CAAA,EAAAF,EAAAE,CAAA,0BAOJ,MAAA,UAAAF,GAAA,cAAAA,EAAA,8BAIAI,MA5BaC,aA4BsBC,GAAnCF,cAAAA,EAAAA,qBAuB8BE,EAAAA,EAAAA,kBAnBxBC,EAAAA,CAAAA,CAAAA,EAAAA,SAA4B,CAAAP,EAAA,iCA/BtBQ,kBAAAA,EAAAA,OAAAA,MAAAA,GAkCZR,EAAO,aAAPA,EAAA,WAAA,GAAA,aAAAC,EAAA,KAAA,MAAA,WAAAA,EAAA,uBAAA,KAAA,KAAAQ,GAAAP,EAAA,KAAA,GAAAQ,GAAAR,EAAA,MAAA,eAIIK,EAAAA,CAAAA,CAAAA,EAAAA,SAAAA,CAAAA,EAAAA,QAAAA,EAAAA,GAAAA,CAAAA,EAAAA,EAAAA,QAAAA,EAIA,CAAAL,EAAA,QAAAQ,GAAAR,EAAA,OAAAD,EAAAD,EAAA,UAAAC,EAAA,kBAAAU,GAAAX,EAAA,SAAAC,EAAA,EAAAC,CAAA,EAAA,KAKJF,EAAAW,GAAAX,EAAA,SAAAC,EAAA,EAAAC,CAAA,8BAQA,IAAIU,EAAAA,EAAAA,MAAJC,EAAAX,EAAA,MAAAY,EAAA,OAAAb,EAGIc,EAAAA,SAAmBT,+CAKhBU,MAAAA,UAAAA,EAAAA,8CAOuB,IAAAd,EAAAe,GACHC,EAAAA,EAAAA,CAAAA,GAAAA,GAAAA,EAAAA,EAAAA,CAAAA,EAAAA,KAAAA,EAAAA,aAAAA,KAAAA,EAAAA,OAKzB,EAAAhB,EAFKU,MAELX,EAAAC,EADKc,MAAQ,UACbG,EAAA,KAAAC,EAAAD,GAAA,aAAAE,GAAApB,CAAA,GAAAgB,GAAAjB,EAAAC,EAAAC,CAAA,EAAA,QACKF,EAAQsB,aADb,KACKtB,EAAA,YAAAE,EAAA,MAAAD,EAAAC,EAAA,MAAA,GAAAA,EAAAmB,GAAApB,CAAA,GAAAgB,GAAAjB,EAAAC,EAAAC,CAAA,EAAA,KAIAF,EAAA,aAJA,KAKLI,EAAAA,MAEAH,EADAsB,EAAAA,MACA,UADyBR,EACzB,IAAAK,EAAAD,GAAA,MAAAE,GAAApB,CAAA,GAAAgB,GAAAjB,EAAAC,EAAAC,CAAA,EAAA,QAHKA,EAAAe,GAKYC,EAAAA,EAAAA,CAAAA,kBAIJM,GAAAA,MAAAA,GAAAA,CAAAA,GAAAA,GAAAA,GAAAA,CAAAA,GAAAA,EAAAA,SACRxB,EAAQO,UADAiB,IACRH,GAAApB,CAAA,GAAAC,GAAAO,GAAAR,CAAA,EAAA,KAAAC,sDAQ8C,GAAAW,EAAA,GAAAb,EAAAA,EAAAA,EAAA,YAAA,CAInD,IAAAc,EAAA,SAAAb,EACIwB,EAAYF,kBAEhBJ,EAAApB,GAAAG,CAAA,EAAAiB,EAAA,MAAAlB,EAAAkB,EAAA,MAAA,UAGgCO,EAAAA,cAG5BC,EAAAA,GAAAA,EAAAA,EAAAA,EAEgBT,EAAAA,OAAYU,oBAO9BC,EAHGX,EAAAA,YAGHW,GAHFf,GAAA,MAAAO,GAAApB,CAAA,GAAA6B,GAAA,WAAApB,EAAA,WAAAG,EAAAiB,0CAuBiBC,EAAAA,CACnB3B,MAAAA,IAAAA,YAAwB,qBAAAJ,EAAA,GAAA,ECpI1B,IAAAgC,GAAA,MAAA,KAAA,QAAA,wBAEoC,CAClCC,OAAIC,EAAQC,OAAZF,EAAAA,SAIeG,EAAO,CACpBC,OAAAA,EAAAA,EAAAA,CAAAA,CADoB,CALY,aAUTH,EAAD,mBACA,gEAIYN,EAAAA,EAAAA,sBACHU,EAAIV,CAAAA,IAAAA,EAAAA,WAAAA,CAAAA,EAC7B,OAAA,0BAMGM,EAZa,8FAmBRjC,EAAA,IAEVmC,EAAAA,EAAUG,EAAAA,OAAWJ,OAAAA,2CAKnBK,OAAAA,GAAAA,EAAAA,KAAAA,CAAAA,IAEAC,EAAAA,EAAAA,MAAAA,EAAAA,EAAAA,EAAAA,SAAAA,IAAAA,EAKFzC,EAAA,KAFqB0C,CAAAA,EAErBxC,EAAA,CAAA,GAAA,OAAAQ,EACUC,EAAA,CAAA,yECpDL,OAAO+B,YAAAA,GAAAA,CAAAA,EAAAA,GAAAA,CAAAA,EA6CpBC,SAASA,GAAAA,EAAAA,EAAAA,kBAMTC,SAAAA,GAAAA,EAAAA,EAAAA,aAgBAC,SAAAC,GAAAC,EAAAC,EAAA,4HF8EMC,EAAAA,EACAC,EAAAA,EAAAA,EAAAA,EAAAA,EAAAA,EAAAA,OAAAA,EAAAA,OAAAA,IAAAA,aASAC,EAAAC,KAAA,CAAA,EAAAC,EAAA,KAJqB,CACrBC,WAAYA,EADS,QAAAC,CAAA,CAAA,EAIrBL,EAAA,YAGEM,EAAAA,EAAQJ,GAAA,CAAA;sBAKRH,EAAAA,EAAAA,YAAAA,CAAAA,EAAAA,IAAAA,KAAAA,EAAAA,QAAAA,EAAAA,MAAAA,EAAAA,EAAAA,IAAAA,IAAAA,GAAAA,CAAAA,GAQKQ,IARLR,KAQKS,EAAA,KAAAL,CAAA,EAAAA,EAAA,KAAAM,EAAA,CAAA,SAAA,CAAA,EAAA,QAAAJ,CAAA,CAAA,EAAAF,EAAAM,EAAA,SAAAJ,EAAA,QAAAE,IAAA,KAAAA,IAAA,KAAAA,IAAA,KAAAF,EASKK,EAAAA,EAAAA,CAAAA,GAAAA,EAAAA,CAAAA,IAAAA,KAAAA,GAAAA,CAAAA,GAKDA,IALCA,KAKDA,CAAAA,EAAAA,QAAAA,GACTV,EAAUM,EAAAK,GAAA,EAEVN,IAAA,KAAAA,IAAA,KAAAA,IAAA,KAAAI,EAAA,QAEEJ,EAAAL,EAAA,QAFFY,GAAAL,CAAA,GAAAA,IAAA,KAAAA,IAAA,KAAAA,IAAA,wBCjMAM,GAAAN,CAAA,EAAAO,EAAA,WAAAP,kKDuIJQ,OAAAA,EAAAA,MAAAA,UAEAf,QAAAA,EAAAA,CAAAA,GAAAA,+BAAAA,EAAAA,KAAAA,EAAAA,WAzIUgB,QAAAA,iDEyEdrB,SAAAsB,GAAApB,EAAA,iCAzCQqB,EAAAA,UAAgBH,OAAhBG,EAAAA,EAAAA,gCAIA,OAAOC,cAAAA,EAAAA,CAAAA,CAAAA,uCAPgB,CC3B/B,IAAMC,GAAQ,CAEV,oBAAqB,IAAI,IAAI,CAAC,YAAa,aAAc,aAAc,aAAa,CAAC,EACrF,kBAAmB,IAAI,IAAI,CAAC,UAAW,aAAc,cAAe,eAAgB,QAAS,gBAAiB,OAAO,CAAC,EACtH,kBAAmB,IAAI,IAAI,CAAC,OAAQ,OAAQ,QAAS,SAAU,SAAU,QAAS,QAAQ,CAAC,EAE3F,OAASC,GACE,EAAEA,EAAS,GAEtB,MAAQA,GACG,CAACD,GAAM,OAAOC,CAAM,EAE/B,SAAWC,GACA,OAAOA,GAAU,SAE5B,QAAUA,GACC,CAACF,GAAM,SAASE,CAAK,EAEhC,iBAAmBC,GACRH,GAAM,oBAAoB,IAAIG,EAAM,IAAI,EAEnD,eAAiBA,GACNH,GAAM,kBAAkB,IAAIG,EAAM,IAAI,EAEjD,eAAiBA,GACNH,GAAM,kBAAkB,IAAIG,EAAM,IAAI,EAEjD,gBAAkBC,GAAW,CACzB,IAAMC,EAAQ,IAAI,IAClB,OAAO,OAAO,KAAKD,CAAM,EAAE,OAAO,CAACE,EAAKC,IAAS,CAC7C,IAAMC,EAAcJ,EAAOG,CAAI,EACzBE,EAAUD,EAAY,UAAYA,EAAcH,EAAM,IAAIG,CAAW,GAAKE,GAAMH,EAAMC,CAAW,EACvG,OAAAH,EAAM,IAAIG,EAAaC,CAAO,EAC9BH,EAAIC,CAAI,EAAIE,EACLH,CACX,EAAG,CAAC,CAAC,CACT,CACJ,EAEOK,EAAQX,GCvCf,IAAMY,GAAWC,GAAW,CAExB,IAAMC,EAAIC,EAAM,gBAAgBF,CAAM,EAEhCG,EAAcF,EAAE,cAAe,EAAE,GAEjCG,EAAeH,EAAE,eAAgB,MAAM,GAEvCI,EAAUJ,EAAE,UAAW,KAAK,GAE5BK,EAAUL,EAAE,UAAW,UAAU,GACjCM,EAAaN,EAAE,aAAc,QAAQ,GACrCO,EAAcP,EAAE,cAAe,QAAQ,GACvCQ,EAAeR,EAAE,eAAgB,eAAe,GAChDS,EAAST,EAAE,cAAeK,CAAO,MAAMC,CAAU,MAAMC,CAAW,MAAMC,CAAY,GAEpFE,EAAaV,EAAE,cAAeS,CAAM,IACpCE,EAAUX,EAAE,aAAc,qCAAqC,GAC/DY,EAAIZ,EAAE,UAAYA,EAAE,YAAcA,EAAE,aAAeA,EAAE,aAAeA,EAAE,cAAgBA,EAAE,aAAeW,EAAUD,EAEjHG,EAAQb,EAAE,QAAS,GAAG,GACtBc,EAAgBd,EAAE,gBAAiB,GAAG,GAEtCe,EAAQf,EAAE,QAAS,GAAG,GAEtBgB,EAAOhB,EAAE,OAAQ,MAAM,GAEvBiB,EAAOjB,EAAE,OAAQ,MAAM,GACvBkB,EAAQlB,EAAE,QAAS,OAAO,GAC1BmB,EAAUnB,EAAE,cAAeiB,CAAI,MAAMC,CAAK,GAE1CE,EAASpB,EAAE,SAAU,6CAA6C,GAElEqB,EAASrB,EAAE,SAAU,4DAA4D,GAEjFsB,EAAYtB,EAAE,YAAa,GAAG,GAC9BuB,EAAavB,EAAE,aAAc,GAAG,GAChCwB,EAAcxB,EAAE,cAAeY,CAAC,IAAI,IAAMa,EAAO,IAAIb,CAAC,GACtDc,GAAe1B,EAAE,cAAewB,CAAW,MAAMtB,CAAW,IAAIW,CAAK,IAAIW,CAAW,MAAMV,CAAa,IACvGa,GAAQ3B,EAAE,QAASsB,CAAS,IAAIV,CAAC,IAAIc,EAAY,KAAKd,CAAC,KAAKV,CAAW,MAAMqB,CAAU,IAEvFK,GAAa5B,EAAE,aAAc,GAAG,GAChC6B,GAAc7B,EAAE,cAAe,GAAG,GAClC8B,GAAe9B,EAAE,cAAeY,CAAC,IAAIS,CAAM,KAAKnB,CAAW,MAAMU,CAAC,IAAIG,CAAK,IAAIH,CAAC,IAAI,IAAMa,EAAO,IAAIb,CAAC,IACtGmB,GAAgB/B,EAAE,cAAe8B,EAAY,MAAM5B,CAAW,IAAIW,CAAK,IAAIiB,EAAY,MAAMhB,CAAa,IAC1GkB,GAAShC,EAAE,SAAU4B,EAAU,IAAIhB,CAAC,IAAImB,EAAa,KAAKnB,CAAC,KAAKV,CAAW,MAAM2B,EAAW,IAE5FJ,GAAUzB,EAAE,cAAegB,CAAI,MAAMG,CAAO,MAAMC,CAAM,MAAMC,CAAM,MAAMW,EAAM,MAAML,EAAK,GAIjG,OAFa3B,EAAE,OAAQY,CAAC,KAAKa,EAAO,MAAMtB,CAAY,MAAMD,CAAW,MAAMU,CAAC,IAAIR,CAAO,IAG7F,EAEO6B,GAAQnC,GCrDf,IAAMoC,EAAaC,GAAUC,GAAW,CACpC,IAAMC,EAASD,EAAO,CAAC,EACvB,OAAAE,GAAQ,QAAUD,EAAO,OAClB,CAAE,KAAAF,EAAM,OAAAE,CAAO,CAC1B,EACME,GAAcJ,GAAUC,GAAW,CACrC,IAAMI,EAAWJ,EAAO,KAAK,EAC7B,MAAO,CAAE,KAAAD,EAAM,SAAAK,CAAS,CAC5B,EAEMC,GAAS,CACX,YAAa,IAAM,CACf,GAAIH,GAAQ,OAASA,GAAQ,UACzB,MAAO,CAAC,CAChB,EACA,aAAeF,GAAW,CACtB,MAAIA,EAAO,CAAC,EAAE,QACVK,GAAO,QAAQL,CAAM,EACnB,IAAI,YAAY,+BAA+B,CACzD,EACA,QAAUA,GAAW,CACjB,MAAM,IAAI,YAAY,oBAAoBA,EAAO,CAAC,CAAC,yBAAyBE,GAAQ,MAAM,EAAE,CAChG,EACA,YAAcF,GACHA,EAAO,KAAK,EAAE,OAAOM,EAAM,OAAO,EAE7C,QAASR,EAAU,SAAS,EAC5B,WAAYA,EAAU,YAAY,EAClC,YAAaA,EAAU,aAAa,EACpC,aAAcA,EAAU,cAAc,EACtC,MAAOA,EAAU,OAAO,EACxB,cAAeA,EAAU,eAAe,EACxC,MAAOA,EAAU,OAAO,EACxB,KAAMA,EAAU,MAAM,EACtB,KAAMA,EAAU,MAAM,EACtB,MAAOA,EAAU,OAAO,EACxB,OAAQA,EAAU,QAAQ,EAC1B,OAAQA,EAAU,QAAQ,EAC1B,UAAWA,EAAU,WAAW,EAChC,WAAYA,EAAU,YAAY,EAClC,MAAOK,GAAW,OAAO,EACzB,WAAYL,EAAU,YAAY,EAClC,YAAaA,EAAU,aAAa,EACpC,OAAQK,GAAW,QAAQ,EAC3B,KAAMA,GAAW,MAAM,CAC3B,EAEOI,GAAQF,GC/Cf,IAAMG,GAAUC,IACZC,GAAQ,QAAUD,EAAO,CAAC,EAAE,OACrB,IAELE,GAAeF,GAAW,CAC5B,IAAMG,EAASH,EAAO,KAAK,EAAE,EAC7B,OAAAC,GAAQ,QAAUE,EAAO,OAClBA,CACX,EACMC,GAAY,CAACC,EAAQC,IAChBA,EAEXF,GAAU,UAAY,GAEtB,IAAMG,GAAS,CACX,GAAGC,GACH,YAAAN,GACA,QAASH,GACT,WAAYA,GACZ,YAAaA,GACb,aAAcA,GACd,MAAOK,GACP,cAAeL,GACf,MAAOK,GACP,KAAMA,GACN,KAAMA,GACN,MAAOA,GACP,OAAQA,GACR,OAAQA,GACR,UAAWA,GACX,WAAYA,GACZ,MAAOF,GACP,WAAYE,GACZ,YAAaA,GACb,OAAQF,GACR,KAAMA,EACV,EAEOM,GAAQD,GCrCf,IAAME,GAASC,GAAMC,GAAQC,EAAM,CAAC,EAE7BC,GAAQJ,GCHf,IAAMK,GAASC,IACXC,GAAQ,KAAK,EACNC,GAAOF,CAAI,GAGfG,GAAQJ,GCNf,IAAMK,GAAS,KAAK,MAEdC,GAAQ,CAACC,EAAMC,IAAY,CAE7B,GADAD,EAAO,GAAGA,CAAI,GACVC,EACA,OAAOH,GAAOI,GAAMF,CAAI,EAAGC,CAAO,EAGlC,GAAI,CACA,OAAOH,GAAOE,CAAI,CACtB,OACOG,EAAO,CACV,IAAMC,EAAeF,GAAMF,CAAI,EAC/B,GAAIA,IAASI,EACT,MAAMD,EAGN,OAAOL,GAAOM,CAAY,CAElC,CAER,EAEOC,GAAQN,GCrBf,IAAMO,GAASC,GAAMC,GAAQC,EAAM,CAAC,EAE7BC,GAAQJ,GCHf,IAAMK,GAAW,CAACC,EAAMC,KACpBC,GAAQ,KAAKD,CAAK,EACXE,GAAOH,CAAI,GAGfI,GAAQL,GCFf,IAAMM,GAAiB,CAACC,EAAKC,IAAa,CACtC,IAAIC,EAAgB,KAChBC,EAAgB,EACdC,EAAsBC,GAAU,CAC9BA,EAAM,MAAQJ,GAEdI,EAAM,KAAQJ,EAAW,GAEzBC,GAAiBI,EAAM,eAAeJ,CAAa,GAEnDA,GAAiBI,EAAM,eAAeD,CAAK,IAE/CH,EAAgBG,EACpB,EACME,EAAa,CAACF,EAAOG,EAAQC,EAAOC,IAAU,CAChD,GAAM,CAAE,KAAAC,EAAM,OAAAC,CAAO,EAAIP,EACnBQ,EAAQV,EACRW,EAAOX,GAAiBS,EAAO,OAC/BG,EAAS,CAAE,KAAAJ,EAAM,OAAAC,EAAQ,MAAAP,EAAO,OAAAG,EAAQ,MAAAC,EAAO,MAAAC,EAAO,MAAAG,EAAO,IAAAC,CAAI,EACvE,OAAAV,EAAmBW,CAAM,EAClBA,CACX,EACMC,EAAc,CAACX,EAAOG,EAAQC,EAAOC,IAAU,CACjD,GAAM,CAAE,KAAAC,CAAK,EAAIN,EACXU,EAAS,CAAE,KAAAJ,EAAM,SAAU,CAAC,EAAG,MAAAN,EAAO,OAAAG,EAAQ,MAAAC,EAAO,MAAAC,CAAM,EACjE,OAAAK,EAAO,SAAWV,EAAM,SAAS,IAAI,CAACY,EAAOP,IAAUQ,EAAWD,EAAOF,EAAQN,EAAQ,EAAGC,CAAK,CAAC,EAAE,OAAOJ,EAAM,cAAc,EAC/HS,EAAO,SAAS,QAAQ,CAACV,EAAOK,IAAUL,EAAM,MAAQK,CAAK,EACtDK,CACX,EACMG,EAAa,CAACb,EAAOG,EAAQC,EAAOC,IAClC,aAAcL,EACPW,EAAYX,EAAOG,EAAQC,EAAOC,CAAK,EAC3CH,EAAWF,EAAOG,EAAQC,EAAOC,CAAK,EAEjD,OAAAQ,EAAWlB,EAAK,KAAM,GAAI,EAAE,EACrBE,CACX,EACMiB,GAAiBd,GAAU,CAC7B,GAAI,CAACA,EACD,MAAO,CAAC,EACZ,IAAMe,EAAO,CAAC,EACd,KAAOf,GAAO,CACV,IAAMG,EAASH,EAAM,OACrB,GAAI,CAACG,EACD,MACAF,EAAM,eAAeD,CAAK,IACtBG,EAAO,OAAS,SACZF,EAAM,OAAOD,EAAM,KAAK,EACxBe,EAAK,QAAQ,KAAK,MAAMf,EAAM,MAAM,CAAC,EAGrCe,EAAK,QAAQ,KAAK,MAAMZ,EAAO,SAASH,EAAM,MAAQ,CAAC,EAAE,MAAM,CAAC,EAG/DG,EAAO,OAAS,SACrBY,EAAK,QAAQf,EAAM,KAAK,GAGhCA,EAAQG,CACZ,CACA,OAAOY,CACX,EACMC,GAA6BhB,GAAU,CACzC,GAAI,CAACA,EACD,MAAO,GACX,IAAMiB,EAAajB,EAAM,QAAQ,KACjC,OAAIiB,IAAe,SACRhB,EAAM,eAAeD,CAAK,EAAIC,EAAM,OAAOD,EAAM,KAAK,EAAIA,EAAM,QAAQ,QAAQ,OAAS,QAChGiB,IAAe,QACRhB,EAAM,eAAeD,CAAK,GAAKA,EAAM,QAAQ,QAAQ,OAAS,QAClE,EACX,EACMkB,GAA0BlB,GAAU,CACtC,GAAI,CAACA,EACD,MAAO,GACX,IAAMmB,EAAgB,CAACnB,EAAM,QAAQ,SAAS,OACxCiB,EAAajB,EAAM,QAAQ,KACjC,OAAIiB,IAAe,SACRE,GAAiBlB,EAAM,iBAAiBD,CAAK,GAAMC,EAAM,eAAeD,CAAK,GAAKC,EAAM,MAAMD,EAAM,KAAK,EAChHiB,IAAe,QACPjB,EAAM,MAAQ,EACnB,EACX,EACMoB,GAAoB,CAACpB,EAAOqB,IAAqB,CACnD,GAAI,CAACA,GAAoB,CAACrB,EACtB,OACJ,IAAMiB,EAAajB,EAAM,QAAQ,KACjC,GAAIC,EAAM,eAAeD,CAAK,EAC1B,OAAIiB,IAAe,QACRjB,EAAM,MACVsB,GAAMC,GAAWvB,CAAK,CAAC,EAG9B,GAAIiB,IAAe,QACf,OAAOjB,EAAM,QAAQ,KAEjC,EACMwB,GAAiB,CAACxB,EAAOyB,EAAeC,IAAuB,CACjE,GAAI,CAACD,GAAiB,CAACzB,EACnB,OACJ,GAAIC,EAAM,eAAeD,CAAK,EAC1B,OAAOsB,GAAMC,GAAWvB,CAAK,CAAC,EAClC,GAAI0B,EACA,OACJ,GAAM,CAAE,OAAAvB,CAAO,EAAIH,EACnB,GAAI,GAACG,GAAU,CAACA,EAAO,QAEnB,EAAAA,EAAO,OAAS,SAAWA,EAAO,OAAS,UAE/C,OAAOmB,GAAMC,GAAWpB,EAAO,KAAK,CAAC,CACzC,EACMwB,GAAS,CAACC,EAAMhC,EAAU8B,EAAqB,KAAS,CAE1D,IAAM/B,EAAMkC,GAASD,EADPF,EAAqB9B,EAAW,GACd,EAC1BI,EAAQN,GAAeC,EAAKC,CAAQ,EACpCmB,EAAOD,GAAcd,CAAK,EAC1BqB,EAAmBL,GAA0BhB,CAAK,EAClDyB,EAAgBP,GAAuBlB,CAAK,EAC5C8B,EAAWV,GAAkBpB,EAAOqB,CAAgB,EACpDU,EAAQP,GAAexB,EAAOyB,EAAeC,CAAkB,EAC/DM,EAAIhC,EAAQ,CAAE,KAAMA,EAAM,KAAM,MAAOA,EAAM,MAAO,IAAKA,EAAM,IAAK,OAAQA,EAAM,MAAO,EAAI,OAEnG,MADe,CAAE,KAAAe,EAAM,SAAAe,EAAU,MAAAC,EAAO,MAAOC,EAAG,iBAAAX,EAAkB,cAAAI,CAAc,CAEtF,EAEOQ,GAAQN,GCnIf,IAAOO,GAAQ,KAAK,UCEpB,IAAMC,GAAYC,GAAS,CACvB,GAAI,CACA,OAAAC,GAAMD,CAAI,EACH,EACX,MACM,CACF,MAAO,EACX,CACJ,EAEOE,GAAQH,GCJf,IAAMI,GAAQ,CACV,IAAK,CACD,MAAOC,GACP,UAAWC,EACf,EACA,OAAAC,GACA,MAAAC,GACA,UAAAC,GACA,MAAAC,GACA,SAAAC,EACJ,EAEOC,GAAQR,GnBTf,IAAMS,GAAUC,GAAc,CAC5B,GAAI,CACF,OAAOC,GAASD,CAAC,EAAE,OAAM,CAC3B,MAAQ,CACN,MAAO,EACT,CAAC,EAGCE,GAGJC,GAAe,IAAM,CACnB,IAAMC,EAAaC,EAAO,SAAW,gBACrC,OAAQH,KAAmBI,GAAcC,GAAcH,CAAU,CAAC,CAAE,EAGhEG,GAAgB,CACpBC,EACAC,EAAe,QAAQ,IAAG,IACf,CACX,GAAIC,GAAWF,CAAM,EAAG,OAAOA,EAC/B,IAAIG,EAAQC,GAAQH,EAAMD,CAAM,EAEhC,GADI,CAACT,GAAOY,CAAK,GAAKZ,GAAOY,EAAQ,OAAO,IAAGA,GAAS,SAEtDZ,GAAOY,CAAK,GACZH,EAAO,WAAW,KAAK,GACvBA,EAAO,WAAW,IAAI,EAEtB,OAAOG,EAIT,QAAWE,KAAKC,GAAOL,CAAI,EAAG,CAC5B,IAAMM,EAAQH,GAAQC,EAAG,eAAgBL,CAAM,EAC/C,GAAIT,GAAOgB,CAAK,EAAG,OAAOA,EAC1B,IAAMC,EAAMJ,GAAQC,EAAG,eAAgBL,CAAM,EACvCS,EAAgBL,GAAQI,EAAK,eAAe,EAClD,GAAIjB,GAAOkB,CAAa,EAAG,OAAOA,EAClC,GAAIlB,GAAOiB,EAAM,OAAO,EAAG,OAAOA,EAAM,OAC1C,CAEA,MAAM,IAAI,MAAM,2CAA4C,CAC1D,MAAO,CACL,OAAAR,EACA,KAAAC,GAEH,CAAC,EAGES,GAAe,CACnBC,EACAC,IACG,CACH,OAAW,CAACC,EAAKC,CAAG,IAAK,OAAO,QAAQF,CAAI,EACtC,OAAOE,GAAQ,UAAY,MAAM,QAAQA,CAAG,EAC9CH,EAAKE,CAAG,IAAMC,EACHD,KAAOF,EAGlB,OAAOA,EAAKE,CAAG,GAAM,UACrB,CAAC,MAAM,QAAQF,EAAKE,CAAG,CAAC,IAExBF,EAAKE,CAAG,EAAIH,GAAaC,EAAKE,CAAG,EAAGC,CAAG,GALvCH,EAAKE,CAAG,EAAIC,EAQhB,OAAOH,CAAI,EAGPb,GAAgB,CAACF,EAAoBmB,EAAO,IAAI,MAAkB,CACtE,GAAI,CACF,IAAMJ,EAAOK,GAAK,MAChBC,GAAalB,GAAcH,CAAU,EAAG,MAAM,CAAC,EAEjD,GAAI,CAACe,GAAQ,OAAOA,GAAS,UAAY,MAAM,QAAQA,CAAI,EACzD,MAAM,IAAI,MAAM,gCAAiC,CAC/C,MAAOA,EACR,EAGH,GADKA,EAAK,kBAAiBA,EAAK,gBAAkB,CAAA,GAC9C,OAAOA,EAAK,SAAY,SAAU,CACpC,IAAMO,EAAMnB,GAAcY,EAAK,QAASQ,GAAQvB,CAAU,CAAC,EACtDmB,EAAK,IAAIG,CAAG,IACfH,EAAK,IAAIG,CAAG,EACZR,GAAaC,EAAMb,GAAcoB,EAAKH,CAAI,CAAC,EAE/C,CACA,OAAOJ,CACT,OAASS,EAAG,CACV,MAAM,IAAI,MAAM,wBAAyB,CAAE,MAAOA,CAAC,CAAE,CACvD,CAAC,EoB5FH,IAAAC,GAAe,IAAM,CACJC,GAAoB,EACxB,gBAAgB,uBACzBC,EAAK,+BAA+B,EAC5BC,EACN;;;;;;;;;;;;;;;;;CAiBL,EAEWC,GAAK,EACb,QAAQ,KAAK,CAAC,EACf,EtBjBH,GAAM,CACJ,SAAAC,GAAW,CAAC,MAAO,UAAU,EAC7B,YAAAC,GAAc,CAAA,EACd,iBAAAC,GAAmB,CAAA,EACnB,QAAAC,GAAU,CAAA,CAAE,EACVC,EAEEC,GAAkBF,GAAQ,IAAI,GAAK,MAAM,EAAE,QAAQ,QAAS,EAAE,CAAC,EAAE,EAEjEG,GAAmC,CACvC,gBAAiB,CACf,YAAa,GACb,eAAgB,GAChB,gBAAiB,GACjB,iCAAkC,GAClC,cAAe,GACf,IAAK,QACL,OAAQ,WACR,iBAAkB,WAClB,yBAA0B,GAC1B,kBAAmB,GACnB,aAAc,GACd,UAAW,GACX,OAAQ,GACR,OAAQ,WAINC,GAAQ,KAA4B,CACxC,QACEH,EAAO,UAAY,OACjB,mBACAI,GAAK,KAAMJ,EAAO,OAAO,EAC7B,gBAAiB,CACf,OACEK,GAAoB,EAAG,gBAAgB,SAAW,OAChD,SACA,OACJ,QAAS,SACT,OAAQ,WACR,iBAAkB,cAIhBC,GAAYC,GAAyC,CACzD,IAAMR,EAAU,CACd,GAAGE,GACH,kBACA,uBAEF,OAAW,CAACO,EAAGC,CAAE,IAAKC,EACpB,GAAIF,IAAMD,EACV,QAAWI,KAAKF,EAAG,IAAI,KAAI,EACzBV,EAAQ,KAAK,MAAMK,GAAKO,CAAC,CAAC,EAAE,EAGhC,MAAO,CACL,QAAS,eACT,QAAS,CACP,iBACA,kBACA,kBACA,oBAEF,QAAAZ,EACA,gBAAiB,CACf,OACE,mBAAqBQ,IAAY,MAAQ,WAAaA,IAE3D,EAGGK,GAAOL,GAAyC,CACpD,IAAMR,EAAoB,CAAC,GAAGE,GAAiB,qBAAqB,EACpE,OAAW,CAACO,EAAGC,CAAE,IAAKC,EACpB,GAAIF,IAAMD,EACV,QAAWI,KAAKF,EAAG,IAAI,KAAI,EACzBV,EAAQ,KAAK,MAAMY,EAAE,QAAQ,QAAS,EAAE,CAAC,EAAE,EAG/C,MAAO,CACL,QAAS,eACT,QAAS,CACP,iBACA,kBACA,kBACA,oBAEF,QAAAZ,EACA,gBAAiB,CACf,OAAQ,kBAAoBQ,GAE/B,EAGHM,GAAW,OAAO,EAClB,IAAMC,GAAc,CAACC,EAAcC,IACjCC,GAAc,SAASF,CAAI,QAAS,KAAK,UAAUC,EAAM,KAAM,CAAC,EAAI;CAAI,EAElEE,EAAMC,EAAM,KAAK,IAAI,2BAA2B,CAAC,EACrDnB,EAAO,UAAY,QAAa,CAACoB,GAAW,eAAe,GACrDF,EAAM,iCAAiC,EAC/CJ,GAAY,cAAeZ,EAAW,IAElCN,GAAS,OAAS,GAAGyB,GAA2B,EAC5CH,EAAM,8BAA8B,GAE9C,QAAWP,KAAKW,GAAY,OAAO,EACjCC,GAAWC,GAAQ,QAASb,CAAC,CAAC,EAEhCG,GAAY,QAASX,GAAK,CAAE,EAC5B,GAAIP,GAAS,SAAS,UAAU,EAAG,CACjCkB,GAAY,WAAYR,GAAS,KAAK,CAAC,EACvC,QAAWE,KAAKV,GACdgB,GAAYN,EAAGF,GAASE,CAAC,CAAC,CAE9B,CACA,GAAIZ,GAAS,SAAS,KAAK,EAAG,CAC5BkB,GAAY,MAAOF,GAAI,KAAK,CAAC,EAC7B,QAAWJ,KAAKX,GACdiB,GAAYN,EAAGI,GAAIJ,CAAC,CAAC,CAEzB,CuB1IA,OAAS,iBAAAiB,OAAqB,KAC9B,OAAS,WAAAC,OAAe,cAExB,OAAS,WAAAC,GAAS,YAAAC,GAAU,WAAAC,GAAS,OAAAC,OAAW,OCgBzC,IAAMC,GACXC,GAC0B,CAC1B,GACIA,GACF,OAAOA,GAAmB,UAC1B,CAAC,MAAM,QAAQA,CAAc,EAC7B,CACA,IAAIC,EACEC,EAAoC,CAAA,EAC1C,OAAW,CAACC,EAAGC,CAAC,IAAK,OAAO,QAAQJ,CAAc,EAEhD,GAAKG,EAEL,IAAIF,IAAS,OAAW,CACtB,GAAI,CAACE,EAAE,WAAW,GAAG,GAAKA,IAAM,KAAO,CAACA,EAAE,WAAW,IAAI,EACvD,OAAOE,GACLL,CAAkC,EAClC,IAAIM,GAAK,CAAC,IAAK,GAAGA,CAAC,CAAC,EAExBL,EAAOE,EAAE,OAAO,CAAC,CACnB,CACA,GAEGF,IAAS,MAAQE,IAAM,KAAO,CAACA,EAAE,WAAW,GAAG,IAE/CF,IAAS,KAAOE,IAAM,KAAO,CAACA,EAAE,WAAW,IAAI,EAEhD,MAAM,IAAI,MACR,WACEF,IAAS,IAAM,UAAY,SAC7B,qCAA0CA,CAAI,WAAWE,CAAC,GAAG,EAGjED,EAAW,KACT,GAAGG,GAAiCD,CAAC,EAAE,IACrCE,GAAK,CAACH,EAAG,GAAGG,CAAC,CAAyC,CACvD,EAGL,OAAOJ,CACT,CACA,OAAOG,GACLL,CAAkC,EAClC,IAAIM,GAAK,CAAC,IAAK,GAAGA,CAAC,CAAC,CAAC,EAGnBC,GAAW,CAACC,EAAuBC,IAAqB,CAC5D,GAAID,EAAS,KAAOC,EAAI,KAAM,MAAO,GACrC,QAAWC,KAAKF,EACd,GAAI,CAACC,EAAI,IAAIC,CAAC,EAAG,MAAO,GAE1B,MAAO,EAAI,EAKPL,GAAmC,CACvCM,EACAC,EAAiB,CAAA,EACjBC,EAAuC,CAAA,IACJ,CAEnC,GAAIF,IAAS,OAAW,OAAOE,EAE/B,GAAIF,IAAS,MAAQ,OAAOA,GAAS,SAGnC,OAAAE,EAAK,KAAK,CAAC,IAAI,IAAID,CAAI,EAAGD,CAAI,CAAC,EACxBE,EAET,GAAI,MAAM,QAAQF,CAAI,EAAG,CACvB,QAAWD,KAAKC,EAGd,GAFAN,GAAiCK,EAAGE,EAAMC,CAAI,EAE1C,CAACH,GAAK,OAAOA,GAAM,SAAU,MAEnC,OAAOG,CACT,CAEA,OAAW,CAACV,EAAGC,CAAC,IAAK,OAAO,QAAQO,CAAI,EAAG,CACzC,GAAIR,EAAE,WAAW,GAAG,GAAKA,IAAM,KAAOA,EAAE,WAAW,IAAI,EACrD,MAAM,IAAI,MAAM,yCAAyCA,CAAC,EAAE,EAE9D,IAAMW,EAAIX,IAAM,UAAYS,EAAOA,EAAK,OAAOT,CAAC,EAE1CY,EAAK,IAAI,IAAID,CAAC,EAKpB,GAJaD,EAAK,KAAK,CAAC,CAACP,CAAC,IAAMC,GAASD,EAAGS,CAAE,CAAC,GAE7CV,GAAiCD,EAAGU,EAAGD,CAAI,EAEzCV,IAAM,UAAW,KACvB,CACA,OAAOU,CAAI,EC/EN,IAAMG,GACXC,GACa,CACb,GAAG,IAAI,IACLC,GAAyBD,CAAc,EACpC,IAAI,CAAC,CAACE,EAAGC,EAAIC,CAAC,IAAMA,CAAC,EACrB,OAAOA,GAAK,CAAC,CAACA,CAAC,CAAa,GCN5B,IAAMC,GACXC,GACe,CACf,IAAMC,EAAOC,GAAyBF,CAAc,EAChDG,EAAsB,CAAA,EAC1B,OAAW,CAACC,EAAGC,CAAU,IAAKJ,EACvBE,EAAQ,KAAKG,GAAOC,GAAkBD,EAAKD,CAAU,CAAC,GACzDF,EAAQ,KAAK,CAAC,GAAGE,CAAU,CAAC,EAGhC,OAAOF,CAAO,EAGVI,GAAoB,CAACD,EAAeE,IAAqB,CAC7D,GAAIF,EAAI,SAAWE,EAAI,KAAM,MAAO,GACpC,QAAWC,KAAKH,EACd,GAAI,CAACE,EAAI,IAAIC,CAAC,EAAG,MAAO,GAE1B,MAAO,EAAI,ECjDb,OAAS,WAAAC,GAAS,WAAAC,OAAe,OACjC,OAAS,iBAAAC,OAAqB,MCA9B,OAAOC,OAAY,cCLnB,OAAS,QAAAC,OAAY,mBAErB,OAAS,iBAAAC,OAAqB,WAE9B,IAAMC,GAAUC,GACd,OAAOA,GAAM,UAAYA,EAAE,WAAW,SAAS,EAAIF,GAAcE,CAAC,EAAIA,EAE3DC,GAAa,MAAOC,GAAsC,CACrE,GAAI,CACF,OAAQ,MAAMC,GAAKJ,GAAOG,CAAC,CAAC,GAAG,OAAM,CACvC,MAAa,CACX,MAAO,EACT,CAAC,ECZI,IAAME,GACX,OAAO,SAAY,UAAY,SAAW,QAAQ,WAAa,QCI1D,IAAMC,GAAqBC,GAChC,WAAW,KAAKA,CAAG,GAAMC,IAAa,WAAW,KAAKD,CAAG,ECL3D,OAAS,YAAAE,GAAU,QAAAC,OAAY,mBAC/B,OAAS,WAAAC,GAAS,WAAAC,GAAS,OAAAC,OAAW,YAGtC,IAAMC,GAAY,MAAOC,GAAgC,CACvD,GAAI,CACF,OAAQ,MAAMC,GAAKD,CAAC,GAAG,YAAW,CACpC,MAAQ,CACN,MAAO,EACT,CAAC,EAWI,IAAME,GAAiB,MAC5BC,EACAC,IACG,CAEH,QAAWC,KAAOC,GAAOC,GAAQH,CAAU,CAAC,EAAG,CAC7C,IAAMI,EAAKC,GAAQJ,EAAK,cAAc,EAAIK,GAKpCC,EACJR,IAAY,KAAOK,GAAOL,EAAeM,GAAQD,EAAIL,CAAO,EAAxBK,GAA6BE,GACnE,GAAI,MAAME,GAAUD,CAAK,EACvB,GAAI,CACF,OAAQ,MAAME,GAASF,CAAK,EAAKD,EAInC,MAAQ,CAAC,CAGb,CAAC,EC3CH,OAAS,YAAAI,OAAgB,mBAGlB,IAAMC,GAAW,MAAOC,GAAgC,CAC7D,GAAI,CACF,OAAO,KAAK,MAAM,MAAMC,GAASD,EAAG,MAAM,CAAC,CAC7C,MAAQ,CACN,OAAO,IACT,CAAC,ECIH,IAAME,GAAa,GACjB,CAAC,CAAC,IAAM,OAAO,GAAM,UAAY,OAAO,GAAM,UAE1CC,GAAa,GAAyB,CAC1C,GAAI,CAAC,GAAK,OAAO,GAAM,UAAY,MAAM,QAAQ,CAAC,EAAG,MAAO,GAC5D,QAAWC,KAAK,EACd,GAAI,CAACA,EAAE,WAAW,GAAG,EAAG,MAAO,GAEjC,MAAO,EAAI,EAGPC,GAASC,GACb,CAAC,CAACA,GACF,OAAOA,GAAM,WACZ,OAAOA,EAAE,MAAS,UAAY,OAAOA,EAAE,KAAS,OAChD,OAAOA,EAAE,MAAS,UAAY,OAAOA,EAAE,KAAS,OAChD,OAAOA,EAAE,QAAW,UAAY,OAAOA,EAAE,OAAW,OACpD,OAAOA,EAAE,QAAY,KAAeJ,GAAUI,EAAE,OAAO,KACvD,OAAOA,EAAE,QAAY,KAAeH,GAAUG,EAAE,OAAO,GAEpDC,GAASH,GAA4BC,GAAMD,CAAC,EAAIA,EAAI,KAE7CI,GAAU,MAAOC,GAC5BF,GAAM,MAAMG,GAASD,CAAC,CAAC,EC9BlB,IAAME,GAAgB,CAC3BC,EACAC,IAC4B,CAE5B,IAAMC,EAAW,OAAO,KAAKD,CAAG,EAC7B,OAAOE,GAAKA,EAAE,QAAUH,EAAE,MAAM,EAChC,KAAK,CAACI,EAAGC,IAAMA,EAAE,OAASD,EAAE,MAAM,EAClC,IAAID,GAAK,CAACA,EAAGA,EAAE,MAAM,GAAG,CAAC,CAAC,EAC1B,OAAO,CAAC,CAAC,CAAEA,CAAC,IAAOA,EAAe,SAAW,CAAC,EAKjD,OAAW,CAACG,EAAK,CAACC,EAAQC,CAAK,CAAC,IAAKN,EACnC,GAAIF,EAAE,WAAWO,CAAM,GAAKP,EAAE,SAASQ,CAAK,EAAG,CAC7C,IAAMC,EAAMT,EAAE,UAAUO,EAAO,OAAQP,EAAE,OAASQ,EAAM,MAAM,EAC9D,MAAO,CAACF,EAAKG,CAAG,CAClB,CAGF,OAAO,IAAI,EChBN,IAAMC,GAA0B,CACrCC,EACAC,IACkB,CAClB,GAAID,IAAQ,MAAQ,OAAOA,GAAQ,SAAU,OAAOA,EACpD,GAAI,MAAM,QAAQA,CAAG,EAAG,CACtB,QAAWE,KAAKF,EAAK,CACnB,IAAM,EAAID,GAAwBG,EAAGD,CAAO,EAC5C,GAAI,EAAG,OAAO,CAChB,CACA,OAAO,IACT,CAEA,IAAME,EAAa,IAAI,IAAI,CAAC,SAAS,CAAC,EACtC,QAAWC,KAAaH,EAAQ,YAAc,CAAC,SAAU,MAAM,EACzDG,EAAU,WAAW,GAAG,EAC1BD,EAAW,OAAOC,EAAU,MAAM,CAAC,CAAC,EAEpCD,EAAW,IAAIC,CAAS,EAG5B,OAAW,CAACC,EAAGC,CAAC,IAAK,OAAO,QAAQN,CAAG,EACrC,GAAIG,EAAW,IAAIE,CAAC,EAClB,OAAON,GAAwBO,EAAGL,CAAO,EAG7C,OAAO,IAAI,ECtBN,IAAMM,GAAgB,CAC3BC,EACAC,EACAC,EACAC,EACAC,IACW,CACX,IAAMC,EACHL,EACCA,IAAQ,KAAOA,EAAI,WAAW,IAAI,EAAIA,EACtC,KAAKA,CAAG,GAFH,IAIT,GAAI,OAAOC,GAAQ,UAAY,MAAM,QAAQA,CAAG,EAAG,CACjD,IAAMK,EAAMD,IAAM,KAAOE,GAAwBN,EAAKG,CAAO,EAC7D,GAAI,CAACE,EAAK,MAAME,GAAmBH,EAAGH,EAAIC,CAAI,EAC9C,OAAOG,CACT,CAIA,GAAID,IAAM,IAAK,CACb,IAAMC,EAAMC,GAAwBN,EAAKG,CAAO,EAChD,GAAIE,EAAK,OAAOA,CAClB,CAGA,IAAMG,EAAKR,EAGLS,EAAID,EAAGJ,CAAC,EACd,GAAIK,IAAM,OAAW,CACnB,IAAMJ,EAAMC,GAAwBG,EAAGN,CAAO,EAC9C,GAAI,CAACE,EAAK,MAAME,GAAmBH,EAAGH,EAAIC,CAAI,EAC9C,OAAOG,CACT,CAEA,IAAMK,EAAKC,GAAcP,EAAGI,CAAE,EAC9B,GAAIE,EAAI,CACN,GAAM,CAACE,EAAKC,CAAG,EAAIH,EACbL,EAAMC,GACVE,EAAGI,CAAG,EACNT,CAAO,EAET,GAAI,CAACE,EAAK,MAAME,GAAmBH,EAAGH,EAAIC,CAAI,EAC9C,OAAOG,EAAI,QAAQ,MAAOQ,CAAG,CAC/B,CAGA,MAAMN,GAAmBH,EAAGH,EAAIC,CAAI,CAAC,EC9DvC,OAAS,iBAAAY,OAAqB,MAEvB,IAAMC,GAAaC,GACxB,OAAOA,GAAM,SAAWA,EACtBA,EAAE,WAAW,SAAS,EAAI,IAAI,IAAIA,CAAC,EACnCF,GAAcE,CAAC,ECLnB,OAAS,iBAAAC,OAAqB,MAEvB,IAAMC,GAAUC,GACrB,OAAOA,GAAM,UAAYA,EAAE,WAAW,SAAS,EAAIF,GAAcE,CAAC,EAAIA,EXmBpE,OAAOC,GAAO,WAAc,aAC9BA,GAAO,UAAaC,IACdA,EAAW,WAAW,OAAO,IAC/BA,EAAaA,EAAW,UAAU,CAAc,GAE3CD,GAAO,eAAe,SAASC,CAAU,IYvBpD,OAAS,YAAAC,OAAgB,cACzB,OAAOC,OAAY,SACnB,OAAS,YAAAC,GAAU,WAAAC,GAAS,cAAAC,GAAY,WAAAC,OAAe,OACvD,OAAS,iBAAAC,GAAe,iBAAAC,OAAqB,MCP7C,OAAS,WAAAC,OAAe,OACxB,OAAS,iBAAAC,OAAqB,MAavB,IAAMC,GAA2B,MACtCC,EACAC,EACAC,IACiB,CACjB,GAAM,CAAE,eAAAC,CAAc,EAAKD,EACrBE,EAAQJ,GAAK,MAAM,uCAAuC,EAC1D,CAAC,CAAEK,EAASC,CAAG,EACnBN,IAAQ,KAAO,CAAC,CAAE,KAAM,EAAE,EAAII,GAAS,CAAC,GAAI,GAAI,EAAE,EAC9CG,EAAQ,MAAMC,GAAeH,EAASJ,CAAU,EACtD,GAAI,CAACM,EACH,MAAME,GAAgBJ,EAASF,CAAc,EAG/C,IAAMO,EAAUC,GAAQJ,EAAO,UAAU,EACnCK,EAAKD,GAAQJ,EAAO,cAAc,EAClCM,EAAM,MAAMC,GAAQF,CAAE,EACtBG,EAAUT,EAAMK,GAAQJ,EAAOD,CAAG,EAAI,GAG5C,GAAI,CAACO,EACH,GAAKE,EAIE,CACL,GAAI,MAAMC,GAAWD,CAAO,EAC1B,OAAOE,GAAcF,CAAO,EACvB,MAAMG,GAAeH,EAASZ,CAAc,CACrD,KARc,CAEZ,GAAI,MAAMa,GAAWN,CAAO,EAAG,OAAOO,GAAcP,CAAO,EACtD,MAAMD,GAAgBF,EAAOJ,CAAc,CAClD,CASF,GAAIU,EAAI,QAAS,CACf,IAAMM,EAAUC,GACdd,EACAO,EAAI,QACJD,EACAT,EACAD,CAAO,EAEHmB,EAAWV,GAAQJ,EAAOY,CAAO,EACvC,GAAI,MAAMH,GAAWK,CAAQ,EAAG,OAAOJ,GAAcI,CAAQ,EACxD,MAAMH,GAAeG,EAAUlB,CAAc,CACpD,SAAWY,EAAS,CAClB,GAAI,MAAMC,GAAWD,CAAO,EAAG,OAAOE,GAAcF,CAAO,EACtD,MAAMG,GAAeH,EAASZ,CAAc,CACnD,SAAWU,EAAI,KAAM,CAEnB,IAAMS,EAAQX,GAAQJ,EAAOM,EAAI,IAAI,EACrC,GAAI,MAAMG,GAAWM,CAAK,EAAG,OAAOL,GAAcK,CAAK,EAClD,GAAI,MAAMN,GAAWN,CAAO,EAAG,OAAOO,GAAcP,CAAO,EAC3D,MAAMD,GAAgBF,EAAOJ,CAAc,CAClD,KAAO,IAAI,MAAMa,GAAWN,CAAO,EACjC,OAAOO,GAAcP,CAAO,EAE5B,MAAMD,GAAgBF,EAAOJ,CAAc,EAC5C,ECxEH,OAAS,WAAAoB,GAAS,WAAAC,OAAe,OACjC,OAAS,iBAAAC,OAAqB,MAqBvB,IAAMC,GAAuB,MAClCC,EACAC,EACAC,IAC0B,CAC1B,GAAM,CAAE,eAAAC,CAAc,EAAKD,EACrBE,EAAQJ,EAAI,MAAM,uCAAuC,EAK/D,GAAI,CAACI,EAAO,MAAMC,GAAuBL,CAAG,EAG5C,QAAWM,KAAOC,GAAOC,GAAQP,CAAU,CAAC,EAAG,CAC7C,IAAMQ,EAAKC,GAAQJ,EAAK,cAAc,EAChCK,EAAM,MAAMC,GAAQH,CAAE,EAC5B,GAAKE,EACL,IAAIA,EAAI,MAAQA,EAAI,QAAS,CAE3B,GAAM,CAAC,CAAEE,EAASC,CAAG,EAAIV,EACzB,GAAIS,IAAYF,EAAI,KAAM,CAExB,IAAMI,EAAUC,GACdF,EACAH,EAAI,QACJF,EACAN,EACAD,CAAO,EAEHe,EAAWP,GAAQJ,EAAKS,CAAO,EACrC,GAAI,MAAMG,GAAWD,CAAQ,EAAG,OAAOE,GAAcF,CAAQ,EACxD,MAAMG,GAAeH,EAAUd,CAAc,CACpD,CACF,CAEA,GAAIH,EAAI,WAAW,GAAG,EAAG,CACvB,GAAI,CAACW,EAAI,QACP,MAAMU,GAAwBrB,EAAKS,EAAIN,CAAc,EAEvD,IAAMmB,EAAQX,EAAI,QAAQX,CAAG,EAC7B,GAAIsB,IAAU,OAAW,CACvB,IAAMC,EAAMC,GAAwBF,EAAOpB,CAAO,EAClD,GAAI,CAACqB,EACH,MAAMF,GAAwBrB,EAAKS,EAAIN,CAAc,EAGvD,OAAIoB,EAAI,WAAW,GAAG,EACbE,GAAyB,KAAMxB,EAAYC,CAAO,EAEpDwB,GAAcH,EAAKd,EAAIP,CAAO,CACvC,CAEA,IAAMyB,EAAKC,GAAc5B,EAAKW,EAAI,OAAO,EACzC,GAAI,CAACgB,EACH,MAAMN,GAAwBrB,EAAKS,EAAIN,CAAc,EAEvD,GAAM,CAAC0B,EAAKC,CAAG,EAAIH,EACbI,EAAQpB,EAAI,QAAQkB,CAAG,EACvBN,EAAMC,GAAwBO,EAAO7B,CAAO,EAClD,GAAI,CAACqB,EACH,MAAMF,GAAwBrB,EAAKS,EAAIN,CAAc,EAEvD,GAAIoB,EAAI,WAAW,GAAG,EACpB,OAAOE,GAAyB,KAAMxB,EAAYC,CAAO,EAE3D,IAAM8B,EAAST,EAAI,QAAQ,MAAOO,CAAG,EAGrC,OAAOJ,GAAcM,EAAQvB,EAAIP,CAAO,CAC1C,CAEA,MACF,CAEA,OAAOuB,GAAyBzB,EAAKC,EAAYC,CAAO,CAAC,EF1EvD,OAAO+B,GAAO,WAAc,aAC9BA,GAAO,UAAaC,IACdA,EAAW,WAAW,OAAO,IAC/BA,EAAaA,EAAW,UAAU,CAAc,GAE3CD,GAAO,eAAe,SAASC,CAAU,IASpD,IAAMC,GAAoB,MAAOC,IAC/BA,EAAOC,GAAOD,CAAI,EACXE,GAAQ,MAAMC,GAASC,GAAQJ,CAAI,CAAC,EAAGK,GAASL,CAAI,CAAC,GAcjDM,GAAgB,MAE3BC,EAKAC,EAAsC,OACtCC,EAA6B,CAAA,IACH,CAK1B,GAHI,OAAOF,GAAQ,UAAYA,EAAI,WAAW,SAAS,IACrDA,EAAM,IAAI,IAAIA,CAAG,GAEf,OAAOA,GAAQ,SAAU,CAC3B,GAAI,CAAE,MAAMG,GAAWH,CAAG,EACxB,MAAMI,GAAe,OAAOJ,CAAG,EAAG,OAAOC,CAAS,CAAC,EAErD,IAAMI,EAAK,MAAMT,GAASF,GAAOM,CAAG,CAAC,EACrC,OAAOK,IAAOC,GAAcN,CAAG,EAAIO,GAAcF,CAAE,EAAIL,CACzD,CAEA,IAAMQ,EACJP,EAAYQ,GAAU,MAAMjB,GAAkBS,CAAS,CAAC,EAAI,OAE9D,GAAIS,GAAkBV,CAAG,EAAG,CAC1B,GAAI,CAACQ,EACH,MAAMG,GAA+BX,EAAKC,CAAS,EAErD,IAAMW,EAAI,IAAI,IAAIZ,EAAKQ,CAAE,EACzB,GAAI,CAAE,MAAML,GAAWS,CAAC,EACtB,MAAMR,GAAeJ,EAAK,OAAOC,CAAS,CAAC,EAE7C,OAAOM,GAAc,MAAMX,GAAS,IAAI,IAAII,EAAKQ,CAAE,CAAC,CAAC,CACvD,CAEA,GAAIK,GAAWb,CAAG,EAAG,CACnB,GAAI,CAAE,MAAMG,GAAWH,CAAG,EACxB,MAAMI,GAAeJ,EAAK,OAAOC,CAAS,CAAC,EAE7C,OAAOM,GAAc,MAAMX,GAASI,CAAG,CAAC,CAC1C,CAEA,GAAIV,GAAO,UAAU,OAAOU,CAAG,CAAC,EAC9B,OAAO,OAAOA,CAAG,EAKnB,IAAMc,EAAqBpB,GACzBO,GAAaN,GAAQ,MAAMC,GAAS,QAAQ,IAAG,CAAE,EAAG,GAAG,CAAC,EAEpDmB,EAAO,CACX,GAAGb,EACH,eAAgB,OAAOA,EAAQ,gBAAkBY,CAAU,GAE7D,OAAId,EACKgB,GAAqBhB,EAAKc,EAAYC,CAAI,EAE1CE,GAAyBjB,EAAKc,EAAYC,CAAI,CACtD,EGrGI,IAAMG,GAAyB,CACpCC,EACAC,EAA+BC,KAC5B,CACH,IAAMC,EAAK,IAAI,MAAM,+BAAiCH,CAAG,EACzD,aAAM,kBAAkBG,EAAIF,CAAM,EAC3BE,CAAE,EAGEC,GAAiB,CAC5BC,EACAJ,EAA+BC,KAC5B,CACH,IAAMC,EAAK,IAAI,MAAM,wBAAwBE,CAAE,EAAE,EACjD,aAAM,kBAAkBF,EAAIF,CAAM,EAC3BE,CAAE,EAGEG,GAAiC,CAC5CN,EACAO,EACAN,EAA+BC,KAC5B,CACH,IAAMC,EAAK,OAAO,OAChB,IAAI,MAAM,mCAAmC,EAC7C,CACE,IAAAH,EACA,UAAAO,EACD,EAEH,aAAM,kBAAkBJ,EAAIF,CAAM,EAC3BE,CAAE,EAGEK,GAAqB,CAChCC,EACAJ,EACAK,EACAT,EAA+BC,KAC5B,CACH,IAAMS,EACJF,IAAQ,IACN,4BACA,oBAAoBA,CAAG,gCACrBN,EAAK,OAAO,OAChB,IAAI,MAAM,GAAGQ,CAAC,OAAON,CAAE,kBAAkBK,CAAI,EAAE,EAC/C,CACE,KAAM,gCACP,EAEH,aAAM,kBAAkBP,EAAIF,CAAM,EAC3BE,CAAE,EAGES,GAAkB,CAC7BC,EACAH,EACAT,EAA+BC,KAC5B,CACH,IAAMC,EAAK,OAAO,OAChB,IAAI,MAAM,wBAAwBU,CAAI,mBAAmBH,CAAI,EAAE,EAC/D,CACE,KAAM,uBACP,EAEH,aAAM,kBAAkBP,EAAIF,CAAM,EAC3BE,CAAE,EAGEW,GAAiB,CAC5BD,EACAH,EACAT,EAA+BC,KAC5B,CACH,IAAMC,EAAK,OAAO,OAChB,IAAI,MAAM,uBAAuBU,CAAI,mBAAmBH,CAAI,EAAE,EAC9D,CACE,KAAM,uBACP,EAEH,aAAM,kBAAkBP,EAAIF,CAAM,EAC3BE,CAAE,EAGEY,GAA0B,CACrCF,EACAR,EACAK,EACAT,EAA+BC,KAC5B,CACH,IAAMC,EAAK,OAAO,OAChB,IAAI,MACF,6BAA6BU,CAAI,+BAC5BR,CAAE,kBAAkBK,CAAI,EAAE,EAEjC,CAAE,KAAM,gCAAgC,CAAE,EAE5C,aAAM,kBAAkBP,EAAIF,CAAM,EAC3BE,CAAE,EC1GX,OAAS,WAAAa,GAAS,WAAAC,OAAe,OACjC,OAAS,iBAAAC,OAAqB,MCCvB,IAAMC,GAAuBC,GAC7BA,EACAC,GAAiBD,CAAO,EACtB,OAAO,KAAKA,CAAO,EAAE,OAAOE,GAAKA,IAAM,KAAOA,EAAE,WAAW,IAAI,CAAC,EADhC,CAAC,GAAG,EADtB,CAAA,EAKjBD,GAAoB,GAAqC,CAC7D,GAAI,CAAC,GAAK,OAAO,GAAM,UAAY,MAAM,QAAQ,CAAC,EAAG,MAAO,GAC5D,QAAWE,KAAK,EACd,GAAIA,IAAM,KAAO,CAACA,EAAE,WAAW,IAAI,EAAG,MAAO,GAE/C,MAAO,EAAI,EChBb,OAAS,WAAAC,OAAe,YAEjB,IAAMC,GAAW,MACtBC,EACAC,IACgC,CAChC,IAAMC,EACJC,GAAOH,EAAK,CAAC,CAAC,GACbA,EAAK,CAAC,EAAE,SAAS,GAAG,EAAI,GAAK,MAC9B,MACCA,EAAK,CAAC,EAAE,WAAW,GAAG,EAAI,GAAK,MAChCG,GAAOH,EAAK,CAAC,CAAC,EAQhB,OAPgB,MAAMI,GAAKF,EAAS,CAClC,MAAO,GACP,SAAU,GACV,MAAO,GACP,IAAKD,EACL,YAAa,GACd,GACc,IAAII,GAKV,CAJKA,EAAM,UAChBL,EAAK,CAAC,EAAE,OACRK,EAAM,OAASL,EAAK,CAAC,EAAE,MAAM,EAElBF,GAAQG,EAAKI,CAAK,CAAC,CACjC,CAAC,EFAG,IAAMC,GAAoB,MAC/BC,EACAC,EAA6B,CAAA,IACa,CAC1C,IAAMC,EAASC,GAAOH,CAAe,EAC/BI,EAAQC,GAAQH,CAAM,EAEtBI,EAAM,MAAMC,GAAQL,CAAM,EAChC,GAAI,CAACI,EACH,MAAME,GAAeR,EAAiBD,EAAiB,EAGzD,IAAMU,EAAwC,CAAA,EAExC,CAAE,QAAAC,CAAO,EAAKJ,EACpB,QAAWK,KAAOC,GAAoBF,CAAO,EAAG,CAC9C,IAAIG,EAKJ,GAAI,CACFA,EAAMC,GAAcH,EAAKD,EAAoBR,EAAQA,EAAQD,CAAO,CACtE,MAAQ,CAAC,CACT,GAAI,CAACY,EAAK,SAMV,IAAME,EAAOF,EAAI,MAAM,GAAG,EACpBG,EAAOL,EAAI,MAAM,GAAG,EAC1B,GAAII,EAAK,SAAW,GAAKC,EAAK,SAAW,EACvC,OAAW,CAACC,EAAKC,CAAM,IAAK,MAAMC,GAChCJ,EACAX,CAAK,EAELK,EAAQO,EAAK,CAAC,EAAIC,EAAMD,EAAK,CAAC,CAAC,EAAII,GAAcF,CAAM,OAGzDT,EAAQE,CAAG,EAAIS,GAAcC,GAAQjB,EAAOS,CAAG,CAAC,CAEpD,CAEA,OAAOJ,CAAO,EjB5CT,IAAMa,GAAyB,MACpCC,EACAC,EAA6B,CAAA,IACa,CAC1C,IAAMC,EAASC,GAAOH,CAAe,EAC/BI,EAAQC,GAAQH,CAAM,EACtBI,EAAQC,GAAUP,CAAe,EAEjCQ,EAAM,MAAMC,GAAQP,CAAM,EAChC,GAAI,CAACM,EACH,MAAME,GAAeV,EAAiBD,EAAsB,EAE9D,IAAMY,EAAwC,CAAA,EAE9C,OAAW,CAACC,EAAKC,CAAM,IAAKC,GAAoBN,EAAKP,CAAO,EAAG,CAK7D,IAAMc,EAAQF,EAAO,MAAM,2BAA2B,EAEhDG,EAAOR,EAAI,KAIjB,GAAI,CAACO,EAAO,SAGZ,IAAME,EAAOL,EAAI,MAAM,GAAG,EACpBM,EAAUL,EAAO,MAAM,GAAG,EAEhC,GAAI,EADSI,EAAK,SAAW,GAAKC,EAAQ,SAAW,GAC1C,CAKT,GAAI,CACFP,EAAQC,CAAG,EAAI,MAAMO,GAAcN,EAAQP,CAAK,CAClD,MAAQ,CAAC,CACT,QACF,CAGA,IAAMc,EAAYL,EAAM,CAAC,IAAM,IAC/B,GAAIK,EAAW,CACb,OAAW,CAACC,EAAKR,CAAM,IAAK,MAAMS,GAASJ,EAASd,CAAK,EACvDO,EAAQM,EAAK,CAAC,EAAII,EAAMJ,EAAK,CAAC,CAAC,EAAIM,GAAcV,CAAM,EAEzD,QACF,CAEA,IAAMW,EAAYT,EAAM,CAAC,IAAMC,EACzBS,EAAM,CAACL,GAAa,CAACI,EAAYT,EAAM,CAAC,EAAI,KAG5CW,EAAQD,EAAM,MAAME,GAAeF,EAAKrB,CAAK,EAAIA,EACvD,GAAI,CAACsB,EAAO,SAEZ,IAAME,EAAKC,GAAQH,EAAO,cAAc,EACxC,GAAI,CAAE,MAAMI,GAAWF,CAAE,EACvB,SAGF,IAAMG,EAAa,MAAMC,GAAkBJ,CAAE,EAC7C,OAAW,CAACK,EAAGC,CAAC,IAAK,OAAO,QAAQH,CAAU,EAAG,CAC/C,GAAIE,IAAM,KAAOA,IAAM,KAAM,SAC7B,IAAME,EAAIV,EAAMQ,EAAE,UAAU,CAAC,EAC7B,GAAIE,EAAE,WAAWjB,EAAQ,CAAC,CAAC,GAAKiB,EAAE,SAASjB,EAAQ,CAAC,CAAC,EAAG,CACtD,IAAMkB,EACJnB,EAAK,CAAC,EACNkB,EAAE,UAAUjB,EAAQ,CAAC,EAAE,OAAQiB,EAAE,OAASjB,EAAQ,CAAC,EAAE,MAAM,EAC3DD,EAAK,CAAC,EAIR,GAAI,CACFN,EAAQyB,CAAC,EAAI,MAAMjB,GAAce,EAAG5B,CAAK,CAC3C,MAAQ,CAAC,CAEX,CACF,CACF,CAEA,OAAOK,CAAO,EAQVG,GAAsB,CAC1BN,EACAP,IACuB,CACvB,IAAMU,EAA8B,CAAA,EAC9B,CAAE,QAAA0B,CAAO,EAAK7B,EACpB,GAAI,CAAC6B,GAAW,OAAOA,GAAY,SAAU,OAAO1B,EACpD,OAAW,CAACsB,EAAGC,CAAC,IAAK,OAAO,QAAQG,CAAO,EAAG,CAC5C,IAAMC,EAAIC,GAAwBL,EAAGjC,CAAO,EACxCqC,GAAK,CAACA,EAAE,WAAW,GAAG,GAAG3B,EAAQ,KAAK,CAACsB,EAAGK,CAAC,CAAC,CAClD,CACA,OAAO3B,CAAO,EJtHhB,OAAS,iBAAA6B,OAAqB,MAI9B,IAAMC,GAAW,IAAI,IAGRC,GAAQC,GAAuB,CAC1C,IAAMC,EAAQ,CAAC,GAAGC,GAAQ,QAAO,CAAE,EACnC,GAAI,CAACD,EAAM,OAAQ,MAAO,GAC1B,IAAME,EAAO,IAAI,IAAYF,EAAM,IAAI,CAAC,CAACG,CAAI,IAAMC,GAAQD,CAAI,CAAC,CAAC,EACjE,OAAQE,EAAM,qBAAsBN,CAAC,EACrCO,GACEP,EACA;;eAEW,KAAK,UAAU,CAAC,GAAGG,CAAI,CAAC,CAAC;;EAEtCF,EAAM,IAAIO,GAAK,KAAK,KAAK,UAAUA,CAAC,CAAC;CAAK,EAAE,KAAK,EAAE,CAAC;;;;CAIrD,EAEQ,EAAI,EAGTC,GAGEC,GAAa,MAAOC,GAAiC,CACzD,IAAMC,EAAQC,GAAwBF,CAAO,EAAE,OAC7CG,GAAK,CAACA,EAAE,WAAW,QAAQ,CAAC,EAE9B,GAAI,CAACF,EAAM,KAAKE,GAAKA,EAAE,SAAS,GAAG,CAAC,EAElC,OAAQL,GAAUG,EAAM,OAAOE,GAAKA,EAAE,WAAW,IAAI,CAAC,EAExD,IAAMC,EAAOC,GAAuBL,CAAO,EACrCM,EAAI,IAAI,IACRC,EAAKC,GAAQ,cAAc,EACjC,QAAWC,KAAcL,EAAM,CAC7B,IAAMM,EAAO,MAAMC,GAAuBJ,EAAI,CAAE,WAAAE,CAAU,CAAE,EAC5D,QAAWG,KAAO,OAAO,OAAOF,CAAI,EAAG,CAErC,GAAI,OAAOE,GAAQ,SAAU,SAC7B,IAAMC,EAAIC,GAAcF,CAAG,EACrBG,EAAMC,GAAS,QAAQ,IAAG,EAAIH,CAAC,EAGnC,CAACE,GACDA,EAAI,WAAW,KAAOE,EAAG,GACzBF,EAAI,WAAW,MAAQE,EAAG,GAC1BF,EAAI,WAAW,eAAiBE,EAAG,GAGrCX,EAAE,IAAI,KAAOS,EAAI,QAAQ,MAAO,GAAG,CAAC,CACtC,CACF,CACA,OAAQjB,GAAU,CAAC,GAAGQ,CAAC,CAAE,EAGrBf,GAAU,IAAI,IAGP2B,GAAO,MAAOC,EAAcC,EAAahC,EAAO,KAAU,CACrE,GAAM,CAAE,QAAAY,CAAO,EAAKmB,EAGpB,GAFI,CAACnB,IACAF,KAASA,GAAU,MAAMC,GAAWC,CAAO,GAC5C,CAACF,GAAQ,QAAQ,OACbH,EAAM,0BAA0ByB,CAAG,GAAItB,EAAO,EACtD,IAAMiB,EAAMC,GAASR,GAAQY,CAAG,EAAG,QAAQ,IAAG,CAAE,EAC1CC,EAAsB,CAAA,EAC5B,QAAWf,KAAKR,GAAS,CACvB,IAAMD,EAAIS,EAAE,QAAQ,QAAS,EAAE,EACzBgB,EAAK5B,GAAQG,CAAC,EACd0B,EACJD,IAAO,IAAM,GACXA,EACG,MAAM,GAAG,EACT,IAAI,IAAM,KAAK,EACf,KAAK,EAAE,EAER7B,EAAO2B,EAAM,IAAMvB,EACnB2B,EAAMT,EAAM,IAAMQ,EAAQ1B,EAC5BT,GAAMG,GAAQ,IAAIE,EAAM+B,CAAG,EAC/BH,EAAI,KACFI,GAAO/B,GAAQD,CAAI,CAAC,EACjB,KAAKiC,IAGA,CAACtC,GAAQsC,GAAGvC,GAAS,IAAIuC,CAAC,EACvBC,GAAOlC,CAAI,EACnB,EACA,KAAK,IAAMmC,GAAQJ,EAAK/B,CAAI,CAAC,CAAC,CAErC,CACA,MAAM,QAAQ,IAAI4B,CAAG,CAAC,EAIXQ,GAAS,MAAOV,EAAcC,IAAgB,CACzD,GAAM,CAAE,QAAApB,CAAO,EAAKmB,EACpB,GAAI,CAACnB,EAAS,OAGTF,KAASA,GAAU,MAAMC,GAAWC,CAAO,GAExCL,EAAM,4BAA4ByB,CAAG,GAAItB,EAAO,EACxD,IAAMuB,EAAsB,CAAA,EAC5B,QAAWf,KAAKR,GAAS,CACvB,IAAML,EAAOe,GAAQY,EAAKd,CAAC,EAC3Be,EAAI,KAAKM,GAAOlC,CAAI,CAAC,CACvB,CACA,QAAWiC,KAAKvC,GAAUkC,EAAI,KAAKM,GAAOD,CAAC,CAAC,EAC5C,MAAM,QAAQ,IAAIL,CAAG,CAAC,EwB5HxB,OAAS,gBAAAS,GAAc,eAAAC,OAAmB,KAE1C,OAAS,WAAAC,GAAS,YAAAC,GAAU,WAAAC,GAAS,OAAAC,OAAW,OAKhD,IAAMC,GAAW,IAAI,IAOjBC,GAEEC,GAAiBC,GAAiB,CACtC,GAAIF,KAAS,OACX,OAAOA,GAGT,IAAMG,EAAM,QAAQ,IAAG,EACjBC,EAAI,GAAGC,EAAG,eAAeA,EAAG,GAAGH,EAAI,IAAI,GAAG,YAAW,EAC3D,GAAIC,EAAI,YAAW,EAAG,SAASC,CAAC,EAC9B,OAAQJ,GAAO,GAGjB,QAAWI,KAAKE,GAAOH,CAAG,EAAG,CAC3B,IAAMI,EAAOC,GAAQJ,EAAG,eAAgBF,EAAI,IAAI,EAChD,GAAI,CACF,IAAMO,EAASD,GAAQE,GAAQH,CAAI,EAAGI,GAAaJ,CAAI,CAAC,EACxD,GAAIK,GAASH,EAAQN,CAAG,IAAM,GAC5B,OAAQH,GAAO,EAEnB,MAAQ,CAAC,CACX,CAEA,OAAQA,GAAO,EAAM,EAGVO,GAAO,CAACL,EAAcW,IAAkB,CACnD,IAAMC,EAAWZ,GAAK,MAAM,SAC5B,GAAI,CAACA,EAAI,MAAQY,IAAa,IAASb,GAAcC,CAAG,EACtD,OAEF,IAAMa,EAAOP,GAAQK,EAAO,eAAgBX,EAAI,IAAI,EAC9Cc,EAAMN,GAAQK,CAAI,EAClBE,EAAML,GAASI,EAAK,QAAQ,IAAG,CAAE,EACjCE,EAAOC,GAAWH,CAAG,EACvBE,GAAMnB,GAAS,IAAIgB,EAAMG,CAAI,EACjC,GAAI,CACFE,GAAYH,EAAKF,CAAI,CACvB,MAAQ,CACNM,GAAWN,CAAI,EACf,IAAIO,EAAQ,GACZ,GAAI,CACFF,GAAYH,EAAKF,CAAI,EACrBO,EAAQ,EACV,SAEE,GAAIA,GAASR,IAAa,OAAW,MACvC,CACF,CAAC,EAGUS,GAAS,CAACrB,EAAcW,IAAkB,CACrD,GAAI,CAACX,EAAI,MAAQA,GAAK,MAAM,WAAa,IAASD,GAAcC,CAAG,EACjE,OAEF,IAAMa,EAAOP,GAAQK,EAAO,eAAgBX,EAAI,IAAI,EACpDmB,GAAWN,CAAI,EACf,IAAMG,EAAOnB,GAAS,IAAIgB,CAAI,EAC1BG,GAAMG,GAAWH,CAAI,CAAC,EChE5B,IAAAM,GAAgBC,GAAkC,CAChDC,EAAiB,KAAK,EACtBC,GAAcC,EAAK,KAAK,EACxBD,GAAcC,EAAK,KAAK,EACxBC,EAAK,cAAc,EACXC,EAAML,CAAG,EACjB,QAAQ,KAAK,CAAC,CAAC,ECfjB,OAAS,cAAAM,GAAY,cAAAC,GAAY,cAAAC,OAAkB,KAEnD,IAAMC,GAAUC,GAAcJ,GAAWI,CAAC,GAAKF,GAAWE,CAAC,EACrDC,GAAS,CAACD,EAAWE,IACzBN,GAAWI,CAAC,GAAKH,GAAWG,EAAGE,CAAE,EAEnCC,EAAe,CACb,OAAAJ,GACA,OAAAE,ICJF,OAAS,YAAAG,OAAgB,cACzB,OAAOC,OAAY,SACnB,OAAS,YAAAC,GAAU,WAAAC,GAAS,cAAAC,GAAY,WAAAC,OAAe,OACvD,OAAS,iBAAAC,GAAe,iBAAAC,OAAqB,MCF7C,OAAOC,OAAY,cCLnB,OAAS,QAAAC,OAAY,mBAErB,OAAS,iBAAAC,OAAqB,WID9B,OAAS,YAAAC,GAAU,QAAAC,OAAY,mBAC/B,OAAS,WAAAC,GAAS,WAAAC,GAAS,OAAAC,OAAW,YCFtC,OAAS,WAAAF,GAAS,WAAAC,OAAe,OCAjC,OAAS,YAAAE,OAAgB,mBMAzB,OAAS,iBAAAC,OAAqB,MCA9B,OAAS,iBAAAC,OAAqB,MEA9B,OAAS,WAAAC,OAAe,OACxB,OAAS,iBAAAF,OAAqB,MCD9B,OAAS,WAAAG,GAAS,WAAAD,OAAe,OACjC,OAAS,iBAAAF,OAAqB,MhBG9B,IAAMI,GAAUC,GACd,OAAOA,GAAM,UAAYA,EAAE,WAAW,SAAS,EAAIJ,GAAcI,CAAC,EAAIA,EAE3DC,GAAa,MAAOC,GAAsC,CACrE,GAAI,CACF,OAAQ,MAAMC,GAAKJ,GAAOG,CAAC,CAAC,GAAG,OAAM,CACvC,MAAa,CACX,MAAO,EACT,CAAC,ECZI,IAAME,GACX,OAAO,SAAY,UAAY,SAAW,QAAQ,WAAa,QCIpDC,GAAqBC,GAChC,WAAW,KAAKA,CAAG,GAAMF,IAAa,WAAW,KAAKE,CAAG,EGL9CC,GAAS,UAAWC,EAAY,CAC3C,IAAKA,EAAOC,GAAQD,CAAI,EAAGA,GAAO,CAChC,MAAMA,EACN,IAAME,EAAKC,GAAQH,CAAI,EACvB,GAAIE,IAAOF,EACT,MAEAA,EAAOE,CAEX,CACF,EDNME,GAAY,MAAOC,GAAgC,CACvD,GAAI,CACF,OAAQ,MAAMC,GAAKD,CAAC,GAAG,YAAW,CACpC,MAAQ,CACN,MAAO,EACT,CAAC,EALH,IAgBaE,GAAiB,MAC5BC,EACAC,IACG,CAEH,QAAWC,KAAOC,GAAOC,GAAQH,CAAU,CAAC,EAAG,CAC7C,IAAMI,EAAKC,GAAQJ,EAAK,cAAc,EAAIK,GAKpCC,EACJR,IAAY,KAAOK,GAAOL,EAAeM,GAAQD,EAAIL,CAAO,EAAxBK,GAA6BE,GACnE,GAAI,MAAME,GAAUD,CAAK,EACvB,GAAI,CACF,OAAQ,MAAME,GAASF,CAAK,EAAKD,EAInC,MAAQ,CAAC,CAGb,CAAC,EExCI,IAAMI,GAAW,MAAOC,GAAgC,CAC7D,GAAI,CACF,OAAO,KAAK,MAAM,MAAMC,GAASD,EAAG,MAAM,CAAC,CAC7C,MAAQ,CACN,OAAO,IACT,CAAC,ECIH,IAAME,GAAaC,GACjB,CAAC,CAACA,IAAM,OAAOA,GAAM,UAAY,OAAOA,GAAM,UAE1CC,GAAaD,GAAyB,CAC1C,GAAI,CAACA,GAAK,OAAOA,GAAM,UAAY,MAAM,QAAQA,CAAC,EAAG,MAAO,GAC5D,QAAWE,KAAKF,EACd,GAAI,CAACE,EAAE,WAAW,GAAG,EAAG,MAAO,GAEjC,MAAO,EAAI,EAGPC,GAASC,GACb,CAAC,CAACA,GACF,OAAOA,GAAM,WACZ,OAAOA,EAAE,MAAS,UAAY,OAAOA,EAAE,KAAS,OAChD,OAAOA,EAAE,MAAS,UAAY,OAAOA,EAAE,KAAS,OAChD,OAAOA,EAAE,QAAW,UAAY,OAAOA,EAAE,OAAW,OACpD,OAAOA,EAAE,QAAY,KAAeL,GAAUK,EAAE,OAAO,KACvD,OAAOA,EAAE,QAAY,KAAeH,GAAUG,EAAE,OAAO,GAEpDC,GAASH,GAA4BC,GAAMD,CAAC,EAAIA,EAAI,KAE7CI,GAAU,MAAOC,GAC5BF,GAAM,MAAMG,GAASD,CAAC,CAAC,EC9BlB,IAAME,GAAgB,CAC3BC,EACAC,IAC4B,CAE5B,IAAMC,EAAW,OAAO,KAAKD,CAAG,EAC7B,OAAOE,GAAKA,EAAE,QAAUH,EAAE,MAAM,EAChC,KAAK,CAACI,EAAGC,IAAMA,EAAE,OAASD,EAAE,MAAM,EAClC,IAAID,GAAK,CAACA,EAAGA,EAAE,MAAM,GAAG,CAAC,CAAC,EAC1B,OAAO,CAAC,CAAC,CAAEA,CAAC,IAAOA,EAAe,SAAW,CAAC,EAKjD,OAAW,CAACG,EAAK,CAACC,EAAQC,CAAK,CAAC,IAAKN,EACnC,GAAIF,EAAE,WAAWO,CAAM,GAAKP,EAAE,SAASQ,CAAK,EAAG,CAC7C,IAAMC,EAAMT,EAAE,UAAUO,EAAO,OAAQP,EAAE,OAASQ,EAAM,MAAM,EAC9D,MAAO,CAACF,EAAKG,CAAG,CAClB,CAGF,OAAO,IAAI,EChBAC,GAA0B,CACrCC,EACAC,IACkB,CAClB,GAAID,IAAQ,MAAQ,OAAOA,GAAQ,SAAU,OAAOA,EACpD,GAAI,MAAM,QAAQA,CAAG,EAAG,CACtB,QAAWE,KAAKF,EAAK,CACnB,IAAMG,EAAIJ,GAAwBG,EAAGD,CAAO,EAC5C,GAAIE,EAAG,OAAOA,CAChB,CACA,OAAO,IACT,CAEA,IAAMC,EAAa,IAAI,IAAI,CAAC,SAAS,CAAC,EACtC,QAAWC,KAAaJ,EAAQ,YAAc,CAAC,SAAU,MAAM,EACzDI,EAAU,WAAW,GAAG,EAC1BD,EAAW,OAAOC,EAAU,MAAM,CAAC,CAAC,EAEpCD,EAAW,IAAIC,CAAS,EAG5B,OAAW,CAACC,EAAGC,CAAC,IAAK,OAAO,QAAQP,CAAG,EACrC,GAAII,EAAW,IAAIE,CAAC,EAClB,OAAOP,GAAwBQ,EAAGN,CAAO,EAG7C,OAAO,IAAI,ECtBAO,GAAgB,CAC3BC,EACAT,EACAU,EACAC,EACAV,IACW,CACX,IAAMZ,EACHoB,EACCA,IAAQ,KAAOA,EAAI,WAAW,IAAI,EAAIA,EACtC,KAAKA,CAAG,GAFH,IAIT,GAAI,OAAOT,GAAQ,UAAY,MAAM,QAAQA,CAAG,EAAG,CACjD,IAAMY,EAAMvB,IAAM,KAAOU,GAAwBC,EAAKC,CAAO,EAC7D,GAAI,CAACW,EAAK,MAAMC,GAAmBxB,EAAGqB,EAAIC,CAAI,EAC9C,OAAOC,CACT,CAIA,GAAIvB,IAAM,IAAK,CACb,IAAMuB,EAAMb,GAAwBC,EAAKC,CAAO,EAChD,GAAIW,EAAK,OAAOA,CAClB,CAGA,IAAME,EAAKd,EAGLE,EAAIY,EAAGzB,CAAC,EACd,GAAIa,IAAM,OAAW,CACnB,IAAMU,EAAMb,GAAwBG,EAAGD,CAAO,EAC9C,GAAI,CAACW,EAAK,MAAMC,GAAmBxB,EAAGqB,EAAIC,CAAI,EAC9C,OAAOC,CACT,CAEA,IAAMG,EAAK3B,GAAcC,EAAGyB,CAAE,EAC9B,GAAIC,EAAI,CACN,GAAM,CAACpB,EAAKG,CAAG,EAAIiB,EACbH,EAAMb,GACVe,EAAGnB,CAAG,EACNM,CAAO,EAET,GAAI,CAACW,EAAK,MAAMC,GAAmBxB,EAAGqB,EAAIC,CAAI,EAC9C,OAAOC,EAAI,QAAQ,MAAOd,CAAG,CAC/B,CAGA,MAAMe,GAAmBxB,EAAGqB,EAAIC,CAAI,CAAC,EE5DhC,IAAMK,GAAaC,GACxB,OAAOA,GAAM,SAAWA,EACtBA,EAAE,WAAW,SAAS,EAAI,IAAI,IAAIA,CAAC,EACnCC,GAAcD,CAAC,ECHNE,GAAUF,GACrB,OAAOA,GAAM,UAAYA,EAAE,WAAW,SAAS,EAAIG,GAAcH,CAAC,EAAIA,EdmBpE,OAAOI,GAAO,WAAc,aAC9BA,GAAO,UAAaC,IACdA,EAAW,WAAW,OAAO,IAC/BA,EAAaA,EAAW,UAAU,CAAc,GAE3CD,GAAO,eAAe,SAASC,CAAU,Ief7C,IAAMC,GAAyB,CACpCC,EACAC,EAA+BC,KAC5B,CACH,IAAMC,EAAK,IAAI,MAAM,+BAAiCH,CAAG,EACzD,OAAA,MAAM,kBAAkBG,EAAIF,CAAM,EAC3BE,CAAE,EAYEC,GAAiC,CAC5CJ,EACAK,EACAJ,EAA+BC,KAC5B,CACH,IAAMC,EAAK,OAAO,OAChB,IAAI,MAAM,mCAAmC,EAC7C,CACE,IAAAH,EACA,UAAAK,CAAAA,CACD,EAEH,OAAA,MAAM,kBAAkBF,EAAIF,CAAM,EAC3BE,CAAE,EAGEG,GAAqB,CAChCC,EACAC,EACAC,EACAR,EAA+BC,KAC5B,CACH,IAAMQ,EACJH,IAAQ,IACN,4BACA,oBAAoBA,CAAG,gCACrBJ,EAAK,OAAO,OAChB,IAAI,MAAM,GAAGO,CAAC,OAAOF,CAAE,kBAAkBC,CAAI,EAAE,EAC/C,CACE,KAAM,+BAAA,CACP,EAEH,OAAA,MAAM,kBAAkBN,EAAIF,CAAM,EAC3BE,CAAE,EAGEQ,GAAkB,CAC7BC,EACAH,EACAR,EAA+BC,KAC5B,CACH,IAAMC,EAAK,OAAO,OAChB,IAAI,MAAM,wBAAwBS,CAAI,mBAAmBH,CAAI,EAAE,EAC/D,CACE,KAAM,sBAAA,CACP,EAEH,OAAA,MAAM,kBAAkBN,EAAIF,CAAM,EAC3BE,CAAE,EAGEU,GAAiB,CAC5BD,EACAH,EACAR,EAA+BC,KAC5B,CACH,IAAMC,EAAK,OAAO,OAChB,IAAI,MAAM,uBAAuBS,CAAI,mBAAmBH,CAAI,EAAE,EAC9D,CACE,KAAM,sBAAA,CACP,EAEH,OAAA,MAAM,kBAAkBN,EAAIF,CAAM,EAC3BE,CAAE,EAGEW,GAA0B,CACrCF,EACAJ,EACAC,EACAR,EAA+BC,KAC5B,CACH,IAAMC,EAAK,OAAO,OAChB,IAAI,MACF,6BAA6BS,CAAI,+BAC5BJ,CAAE,kBAAkBC,CAAI,EAAE,EAEjC,CAAE,KAAM,gCAAgC,CAAE,EAE5C,OAAA,MAAM,kBAAkBN,EAAIF,CAAM,EAC3BE,CAAE,EChGEY,GAA2B,MACtCf,EACAgB,EACAC,IACiB,CACjB,GAAM,CAAE,eAAAC,CAAc,EAAKD,EACrBE,EAAQnB,GAAK,MAAM,uCAAuC,EAC1D,CAAC,CAAEoB,EAASb,CAAG,EACnBP,IAAQ,KAAO,CAAC,CAAE,KAAM,EAAE,EAAImB,GAAS,CAAC,GAAI,GAAI,EAAE,EAC9CE,EAAQ,MAAMC,GAAeF,EAASJ,CAAU,EACtD,GAAI,CAACK,EACH,MAAMV,GAAgBS,EAASF,CAAc,EAG/C,IAAMK,EAAUC,GAAQH,EAAO,UAAU,EACnCb,EAAKgB,GAAQH,EAAO,cAAc,EAClCI,EAAM,MAAMC,GAAQlB,CAAE,EACtBmB,EAAUpB,EAAMiB,GAAQH,EAAOd,CAAG,EAAI,GAG5C,GAAI,CAACkB,EACH,GAAKE,EAIE,CACL,GAAI,MAAMC,GAAWD,CAAO,EAC1B,OAAOE,GAAcF,CAAO,EACvB,MAAMd,GAAec,EAAST,CAAc,CACrD,KARc,CAEZ,GAAI,MAAMU,GAAWL,CAAO,EAAG,OAAOM,GAAcN,CAAO,EACtD,MAAMZ,GAAgBU,EAAOH,CAAc,CAClD,CASF,GAAIO,EAAI,QAAS,CACf,IAAMK,EAAUC,GACdxB,EACAkB,EAAI,QACJjB,EACAU,EACAD,CAAO,EAEHe,EAAWR,GAAQH,EAAOS,CAAO,EACvC,GAAI,MAAMF,GAAWI,CAAQ,EAAG,OAAOH,GAAcG,CAAQ,EACxD,MAAMnB,GAAemB,EAAUd,CAAc,CACpD,SAAWS,EAAS,CAClB,GAAI,MAAMC,GAAWD,CAAO,EAAG,OAAOE,GAAcF,CAAO,EACtD,MAAMd,GAAec,EAAST,CAAc,CACnD,SAAWO,EAAI,KAAM,CAEnB,IAAMQ,EAAQT,GAAQH,EAAOI,EAAI,IAAI,EACrC,GAAI,MAAMG,GAAWK,CAAK,EAAG,OAAOJ,GAAcI,CAAK,EAClD,GAAI,MAAML,GAAWL,CAAO,EAAG,OAAOM,GAAcN,CAAO,EAC3D,MAAMZ,GAAgBU,EAAOH,CAAc,CAClD,KAAO,CAAA,GAAI,MAAMU,GAAWL,CAAO,EACjC,OAAOM,GAAcN,CAAO,EAE5B,MAAMZ,GAAgBU,EAAOH,CAAc,CAAA,CAC5C,EClDUgB,GAAuB,MAClClC,EACAgB,EACAC,IAC0B,CAC1B,GAAM,CAAE,eAAAC,CAAc,EAAKD,EACrBE,EAAQnB,EAAI,MAAM,uCAAuC,EAK/D,GAAI,CAACmB,EAAO,MAAMpB,GAAuBC,CAAG,EAG5C,QAAWmC,KAAOC,GAAOC,GAAQrB,CAAU,CAAC,EAAG,CAC7C,IAAMR,EAAKgB,GAAQW,EAAK,cAAc,EAChCV,EAAM,MAAMC,GAAQlB,CAAE,EAC5B,GAAKiB,EACL,CAAA,GAAIA,EAAI,MAAQA,EAAI,QAAS,CAE3B,GAAM,CAAC,CAAEL,EAASb,CAAG,EAAIY,EACzB,GAAIC,IAAYK,EAAI,KAAM,CAExB,IAAMK,EAAUC,GACdxB,EACAkB,EAAI,QACJjB,EACAU,EACAD,CAAO,EAEHe,EAAWR,GAAQW,EAAKL,CAAO,EACrC,GAAI,MAAMF,GAAWI,CAAQ,EAAG,OAAOH,GAAcG,CAAQ,EACxD,MAAMnB,GAAemB,EAAUd,CAAc,CACpD,CACF,CAEA,GAAIlB,EAAI,WAAW,GAAG,EAAG,CACvB,GAAI,CAACyB,EAAI,QACP,MAAMX,GAAwBd,EAAKQ,EAAIU,CAAc,EAEvD,IAAMoB,EAAQb,EAAI,QAAQzB,CAAG,EAC7B,GAAIsC,IAAU,OAAW,CACvB,IAAMC,EAAMC,GAAwBF,EAAOrB,CAAO,EAClD,GAAI,CAACsB,EACH,MAAMzB,GAAwBd,EAAKQ,EAAIU,CAAc,EAGvD,OAAIqB,EAAI,WAAW,GAAG,EACbxB,GAAyB,KAAMC,EAAYC,CAAO,EAEpDf,GAAcqC,EAAK/B,EAAIS,CAAO,CACvC,CAEA,IAAMwB,EAAKC,GAAc1C,EAAKyB,EAAI,OAAO,EACzC,GAAI,CAACgB,EACH,MAAM3B,GAAwBd,EAAKQ,EAAIU,CAAc,EAEvD,GAAM,CAACyB,EAAKC,CAAG,EAAIH,EACbI,EAAQpB,EAAI,QAAQkB,CAAG,EACvBJ,EAAMC,GAAwBK,EAAO5B,CAAO,EAClD,GAAI,CAACsB,EACH,MAAMzB,GAAwBd,EAAKQ,EAAIU,CAAc,EAEvD,GAAIqB,EAAI,WAAW,GAAG,EACpB,OAAOxB,GAAyB,KAAMC,EAAYC,CAAO,EAE3D,IAAM6B,EAASP,EAAI,QAAQ,MAAOK,CAAG,EAGrC,OAAO1C,GAAc4C,EAAQtC,EAAIS,CAAO,CAC1C,CAEA,KAAA,CACF,CAEA,OAAOF,GAAyBf,EAAKgB,EAAYC,CAAO,CAAC,ElB1EvD,OAAO8B,GAAO,WAAc,aAC9BA,GAAO,UAAaC,IACdA,EAAW,WAAW,OAAO,IAC/BA,EAAaA,EAAW,UAAU,CAAc,GAE3CD,GAAO,eAAe,SAASC,CAAU,IASpD,IAAMC,GAAoB,MAAOrC,IAC/BA,EAAOsC,GAAOtC,CAAI,EACXY,GAAQ,MAAM2B,GAASd,GAAQzB,CAAI,CAAC,EAAGwC,GAASxC,CAAI,CAAC,GAcjDV,GAAgB,MAE3BF,EAKAK,EAAsC,OACtCY,EAA6B,CAAA,IACH,CAK1B,GAHI,OAAOjB,GAAQ,UAAYA,EAAI,WAAW,SAAS,IACrDA,EAAM,IAAI,IAAIA,CAAG,GAEf,OAAOA,GAAQ,SAAU,CAC3B,GAAI,CAAE,MAAM4B,GAAW5B,CAAG,EACxB,MAAMa,GAAe,OAAOb,CAAG,EAAG,OAAOK,CAAS,CAAC,EAErD,IAAMgD,EAAK,MAAMF,GAASD,GAAOlD,CAAG,CAAC,EACrC,OAAOqD,IAAOC,GAActD,CAAG,EAAI6B,GAAcwB,CAAE,EAAIrD,CACzD,CAEA,IAAMuD,EACJlD,EAAYmD,GAAU,MAAMP,GAAkB5C,CAAS,CAAC,EAAI,OAE9D,GAAIoD,GAAkBzD,CAAG,EAAG,CAC1B,GAAI,CAACuD,EACH,MAAMnD,GAA+BJ,EAAKK,CAAS,EAErD,IAAMqD,EAAI,IAAI,IAAI1D,EAAKuD,CAAE,EACzB,GAAI,CAAE,MAAM3B,GAAW8B,CAAC,EACtB,MAAM7C,GAAeb,EAAK,OAAOK,CAAS,CAAC,EAE7C,OAAOwB,GAAc,MAAMsB,GAAS,IAAI,IAAInD,EAAKuD,CAAE,CAAC,CAAC,CACvD,CAEA,GAAII,GAAW3D,CAAG,EAAG,CACnB,GAAI,CAAE,MAAM4B,GAAW5B,CAAG,EACxB,MAAMa,GAAeb,EAAK,OAAOK,CAAS,CAAC,EAE7C,OAAOwB,GAAc,MAAMsB,GAASnD,CAAG,CAAC,CAC1C,CAEA,GAAI+C,GAAO,UAAU,OAAO/C,CAAG,CAAC,EAC9B,OAAO,OAAOA,CAAG,EAKnB,IAAMgB,EAAqBkC,GACzB7C,GAAamB,GAAQ,MAAM2B,GAAS,QAAQ,IAAG,CAAE,EAAG,GAAG,CAAC,EAEpDS,EAAO,CACX,GAAG3C,EACH,eAAgB,OAAOA,EAAQ,gBAAkBD,CAAU,CAAA,EAE7D,OAAIhB,EACKkC,GAAqBlC,EAAKgB,EAAY4C,CAAI,EAE1C7C,GAAyBf,EAAKgB,EAAY4C,CAAI,CACtD,EmB1GH,OAAS,iBAAAC,OAAqB,MAG9B,IAAMC,GAAW,CACf,KAAM,6BACN,IAAK,cAGDC,GAAmB,CACvB,KAAM,cACN,IAAK,WAIDC,GAAU,MAAOC,GACrB,MAAMC,GAAcD,EAAM,gBAAiB,QAAQ,IAAG,EAAK,IAAI,EAAE,MAC/D,IAAMC,GAAcD,EAAM,gBAAiB,YAAY,GAAG,CAAC,EAGzD,CAAE,SAAAE,GAAW,KAAK,EAAKC,EACvBC,GAAUP,GAASK,EAAQ,EAE3BG,GAAgBC,GACpBA,EAAG,MAAM,EAAG,GAA0B,EAAIR,GAAiBI,EAAQ,EAErEK,GAAeF,GAAaG,GAAc,MAAMT,GAAQK,EAAO,CAAC,CAAC,ExEpBjE,IAAMK,GAAO,QAAQ,SACf,CAAE,iBAAAC,GAAmB,CAAA,CAAE,EAAKC,EAErBC,GAAgB,IAAM,CACjCC,EAAiB,MAAO,UAAU,EAClC,QAAWC,IAAK,CAAC,WAAY,GAAGJ,EAAgB,EAAG,CACjD,IAAMK,EAAKC,EAAU,IAAIF,IAAM,WAAa,MAAQA,CAAC,EAC7CG,EAAMC,EAAM,KAAK,IAAI,YAAcJ,CAAC,CAAC,EAC7C,IAAMK,EAAMC,GAAUX,GAAM,CAACY,GAAK,KAAM,SAASP,CAAC,OAAO,EAAG,CAC1D,MAAO,UACR,EACD,GAAIK,EAAI,QAAUA,EAAI,OACpB,OAAAN,EAAiB,KAAK,EACfS,GAAUH,CAAG,EAEtBN,EAAiB,eAAiBC,EAAG,UAAU,EAC/C,OAAW,CAACS,EAAUC,CAAI,IAAKT,GAAI,IAAI,QAAO,GAAM,CAAA,EAAI,CACtD,IAAMU,EAAWC,GACf,eAAeZ,CAAC,GAChBa,GAASD,GAAQ,KAAK,EAAGA,GAAQH,CAAQ,CAAC,CAAC,EAC3C,QAAQ,SAAU,EAAE,EAChBK,EAASF,GACb,eAAeZ,CAAC,GAChBa,GAASD,GAAQ,KAAK,EAAGA,GAAQF,CAAI,CAAC,CAAC,EACvC,QAAQ,UAAW,EAAE,EACjBK,EAAa,GAAGD,CAAM,UACtBE,EAAgB,GAAGF,CAAM,YAC/BG,EAAQ,OAAOF,CAAU,EACzBE,EAAQ,OAAOD,CAAa,EAC5BC,EAAQ,OAAO,GAAGN,CAAQ,OAAQ,GAAGG,CAAM,KAAK,EAChDG,EAAQ,OAAO,GAAGN,CAAQ,SAAU,GAAGG,CAAM,OAAO,CACtD,CACQI,EAAMd,EAAM,KAAK,KAAK,gBAAgB,CAAC,CACjD,CACAL,EAAiB,KAAK,CAAC,EyE7CzB,OAAS,aAAAoB,OAAiB,qBAC1B,OAAS,YAAAC,GAAU,WAAAC,OAAe,YAUlC,IAAMC,GAAO,QAAQ,SACf,CAAE,YAAAC,GAAc,CAAA,CAAE,EAAKC,EAEhBC,GAAW,IAAM,CAC5BC,EAAiB,MAAO,KAAK,EAC7B,QAAWC,IAAK,CAAC,MAAO,GAAGJ,EAAW,EAAG,CACvC,IAAMK,EAAKC,EAAU,IAAIF,CAAC,EAClBG,EAAMC,EAAM,KAAK,IAAI,YAAcJ,CAAC,CAAC,EAC7C,IAAMK,EAAMC,GAAUX,GAAM,CAACY,GAAK,KAAM,SAASP,CAAC,OAAO,EAAG,CAC1D,MAAO,UACR,EACD,GAAIK,EAAI,QAAUA,EAAI,OACpB,OAAAN,EAAiB,KAAK,EACfS,GAAUH,CAAG,EAEtBN,EAAiB,eAAiBC,EAAG,KAAK,EAC1C,OAAW,CAACS,EAAUC,CAAI,IAAKT,GAAI,IAAI,QAAO,GAAM,CAAA,EAAI,CACtD,IAAMU,EAAWC,GACf,eAAeZ,CAAC,GAChBa,GAASD,GAAQ,KAAK,EAAGA,GAAQH,CAAQ,CAAC,CAAC,EAC3C,QAAQ,SAAU,EAAE,EAChBK,EAASF,GACb,eAAeZ,CAAC,GAChBa,GAASD,GAAQ,KAAK,EAAGA,GAAQF,CAAI,CAAC,CAAC,EACvC,QAAQ,UAAW,EAAE,EACvBK,EAAQ,OAAO,GAAGD,CAAM,SAAS,EACjCC,EAAQ,OAAO,GAAGD,CAAM,WAAW,EACnCC,EAAQ,OAAO,GAAGJ,CAAQ,OAAQ,GAAGG,CAAM,KAAK,EAChDC,EAAQ,OAAO,GAAGJ,CAAQ,SAAU,GAAGG,CAAM,OAAO,CACtD,CACQE,EAAMZ,EAAM,KAAK,KAAK,SAAWJ,CAAC,CAAC,CAC7C,CACAD,EAAiB,KAAK,CAAC,ECrCzB,OAAS,eAAAkB,OAAmB,KAC5B,OAAS,SAAAC,OAAa,OAKtB,IAAMC,GAAsB,MAAOC,EAAcC,IAAiB,CAChE,IAAMC,EAAUC,GAAY,GAAGF,CAAI,IAAID,CAAI,GAAI,CAC7C,cAAe,GAChB,EACGI,EACJ,GAAI,CACFA,EAAU,IAAI,IAAID,GAAY,OAAOH,CAAI,EAAE,CAAC,CAC9C,MAAQ,CAAC,CAET,GAAI,CAACI,EACH,OAAO,MAAMC,GAAO,GAAGJ,CAAI,IAAID,CAAI,EAAE,EAEvC,QAAWM,KAAKJ,EAAS,CACvB,IAAMK,EAAa,GAAGP,CAAI,IAAIM,EAAE,IAAI,GACpC,GAAIA,EAAE,YAAW,EAAI,CACnB,MAAMP,GAAoBQ,EAAYN,CAAI,EAC1C,QACF,CACA,GAAI,CAAE,IAAAO,EAAK,KAAAC,CAAI,EAAKC,GAAMH,CAAU,EACpC,GAAIC,IAAQ,OACV,SAEEC,EAAK,SAAS,IAAI,GAAKD,EAAI,SAAS,IAAI,IAC1CA,EAAM,KAAOA,EACbC,EAAOA,EAAK,UAAU,EAAGA,EAAK,OAAS,CAAW,GAGpD,IAAME,EACJH,IAAQ,OAASA,IAAQ,QAAU,CAAC,OAAQ,KAAK,EAC/CA,IAAQ,QAAUA,IAAQ,SAAW,CAAC,MAAM,EAC5CA,IAAQ,QAAUA,IAAQ,SAAW,CAAC,MAAM,EAC5C,CAAA,EACJG,EAAY,KAAKH,CAAG,EACpB,IAAII,EAAM,GACV,QAAWJ,KAAOG,EAChB,GAAIP,EAAQ,IAAI,GAAGK,CAAI,GAAGD,CAAG,EAAE,EAAG,CAChCI,EAAM,GACN,KACF,CAEEA,IACMC,EAAM,uBAAwBN,CAAU,EAChD,MAAMF,GAAO,CAAC,GAAGJ,CAAI,IAAIM,CAAU,GAAI,GAAGN,CAAI,IAAIM,CAAU,MAAM,CAAC,EAEvE,CAAC,EAGHO,GAAe,SAAY,CACzB,IAAMC,EAASC,GAAoB,EACnC,GACED,EAAO,gBAAgB,cAAgB,IACvCA,EAAO,gBAAgB,YAAc,GAErC,OAAO,MAAMV,GAAO,aAAa,EAGnC,IAAIY,EACJ,GAAI,CACFA,EAAad,GAAY,mBAAmB,CAC9C,MAAQ,CAAC,CACT,GAAI,CAACc,GAAY,OACf,OAAO,MAAMZ,GAAO,aAAa,EAInC,QAAWa,KAAWf,GAAY,aAAa,EACzCe,IAAY,SAChB,MAAMnB,GAAoB,IAAK,eAAemB,CAAO,EAAE,CACxD,EChFH,IAAAC,GAAeC,EAAO,UAAY,CAAC,MAAO,UAAU,ECDpD,OAAS,iBAAAC,OAAqB,KAI9B,IAAAC,GAAe,IAAMC,GAAc,eAAgBC,GAAUC,CAAG,CAAC,ECHjE,OAAS,YAAAC,GAAU,aAAAC,OAAiB,UACpC,OAAS,WAAAC,GAAS,YAAAC,GAAU,WAAAC,OAAe,YAS3C,GAAM,CAAE,YAAAC,GAAc,CAAA,CAAE,EAAKC,EAEhBC,GAAe,IAAM,CAChC,QAAWC,IAAK,CAAC,MAAO,GAAGH,EAAW,EAAG,CACvC,IAAMI,EAAKC,EAAU,IAAIF,CAAC,EAClBG,EAAMC,EAAM,KAAK,IAAI,WAAaJ,CAAC,CAAC,EAC5C,QAAW,KAAKK,GAAS,CACvB,IAAMC,EAAS,EAAE,UAAU,CAAe,EACpCC,EAASC,GAAQ,eAAeR,CAAC,IAAIM,CAAM,EAAE,EACnDG,GAAUC,GAAQH,CAAM,EAAG,CAAE,UAAW,EAAI,CAAE,EAC9CI,GAAS,EAAGJ,CAAM,CACpB,CACAK,EAAiB,eAAiBZ,EAAG,KAAK,EAC1C,OAAW,CAACa,EAAUC,CAAI,IAAKb,GAAI,IAAI,QAAO,GAAM,CAAA,EAAI,CACtD,IAAMc,EAAWP,GACf,eAAeR,CAAC,GAChBgB,GAASR,GAAQ,KAAK,EAAGA,GAAQK,CAAQ,CAAC,CAAC,EAC3C,QAAQ,SAAU,EAAE,EAChBI,EAAST,GACb,eAAeR,CAAC,GAChBgB,GAASR,GAAQ,KAAK,EAAGA,GAAQM,CAAI,CAAC,CAAC,EACvC,QAAQ,UAAW,EAAE,EACvBI,EAAQ,OAAO,GAAGD,CAAM,SAAS,EACjCC,EAAQ,OAAO,GAAGD,CAAM,WAAW,EACnCC,EAAQ,OAAO,GAAGH,CAAQ,OAAQ,GAAGE,CAAM,KAAK,EAChDC,EAAQ,OAAO,GAAGH,CAAQ,SAAU,GAAGE,CAAM,OAAO,CACtD,CACQE,EAAMf,EAAM,KAAK,KAAK,UAAYJ,CAAC,CAAC,CAC9C,CAAC,ECtCH,OAAS,YAAAoB,GAAU,aAAAC,OAAiB,UACpC,OAAS,WAAAC,OAAe,YACxB,OAAS,YAAAC,GAAU,WAAAC,OAAe,kBASlC,GAAM,CAAE,iBAAAC,GAAmB,CAAA,CAAE,EAAKC,EAGrBC,GAAoB,IAAM,CACrC,QAAWC,IAAK,CAAC,WAAY,GAAGH,EAAgB,EAAG,CACjD,IAAMI,EAAKC,EAAU,IAAIF,IAAM,WAAa,MAAQA,CAAC,EAC7CG,EAAMC,EAAM,KAAK,IAAI,WAAaJ,CAAC,CAAC,EAC5C,QAAW,KAAKK,GAAS,CACvB,IAAMC,EAAS,EAAE,UAAU,CAAe,EACpCC,EAASC,GAAQ,eAAeR,CAAC,IAAIM,CAAM,EAAE,EACnDG,GAAUC,GAAQH,CAAM,EAAG,CAAE,UAAW,EAAI,CAAE,EAC9CI,GAAS,EAAGJ,CAAM,CACpB,CACAK,EAAiB,eAAiBZ,EAAG,UAAU,EAC/C,OAAW,CAACa,EAAUC,CAAI,IAAKb,GAAI,IAAI,QAAO,GAAM,CAAA,EAAI,CACtD,IAAMc,EAAWP,GACf,eAAeR,CAAC,GAChBgB,GAASR,GAAQ,KAAK,EAAGA,GAAQK,CAAQ,CAAC,CAAC,EAC3C,QAAQ,SAAU,EAAE,EAChBI,EAAST,GACb,eAAeR,CAAC,GAChBgB,GAASR,GAAQ,KAAK,EAAGA,GAAQM,CAAI,CAAC,CAAC,EACvC,QAAQ,UAAW,EAAE,EACvBI,EAAQ,OAAO,GAAGD,CAAM,SAAS,EACjCC,EAAQ,OAAO,GAAGD,CAAM,WAAW,EACnCC,EAAQ,OAAO,GAAGH,CAAQ,OAAQ,GAAGE,CAAM,KAAK,EAChDC,EAAQ,OAAO,GAAGH,CAAQ,SAAU,GAAGE,CAAM,OAAO,CACtD,CACQE,EAAMf,EAAM,KAAK,KAAK,iBAAiB,CAAC,CAClD,CAAC,ECjBH,IAAAgB,GAAe,SAAY,CACzB,MAAMC,GAAa,EAEnBC,GAAYC,EAAK,KAAK,EACtB,MAAMD,GAAYC,EAAK,KAAK,EAC5B,IAAMC,EACJC,EAAO,SACP,QAAQ,IAAI,cAAgB,WAC5B,QAAQ,IAAI,cAAgB,OACxBC,EAAMF,EAAUG,GAAeC,GAC/BC,EAAWL,EAAUM,GAAoBC,GAC3CC,GAAS,SAAS,KAAK,GAAGN,EAAG,EAC7BM,GAAS,SAAS,UAAU,GAAGH,EAAQ,EAC3C,MAAMI,GAAcV,EAAK,KAAK,EAC9BU,GAAcV,EAAK,KAAK,EAEhBW,EAAMC,EAAM,KAAK,IAAI,kBAAkB,CAAC,EAChDC,GAAgB,cAAe,MAAM,EAC7BF,EAAMC,EAAM,KAAK,IAAI,yBAAyB,CAAC,EAEvD,MAAMd,GAAa,EAEnBC,GAAYC,EAAK,MAAM,EAEnBA,EAAI,UACEW,EAAM,0BAA2BX,EAAI,OAAO,EAChDS,GAAS,SAAS,UAAU,GAC9B,MAAMV,GAAYC,EAAK,gBAAiB,EAAI,EAC1CS,GAAS,SAAS,KAAK,GAAG,MAAMV,GAAYC,EAAK,WAAY,EAAI,EACjEc,GAAY,6BAA6B,IAC3Cd,EAAI,QAAUA,EAAI,SAAW,CAAA,EAC7BA,EAAI,QAAQ,WACV,gFAKEW,EAAMC,EAAM,KAAK,IAAI,YAAY,CAAC,EAC1CG,GAAI,EACIJ,EAAMC,EAAM,KAAK,IAAI,oBAAoB,CAAC,EAClDI,GAAY,CAAE,EChEhB,OAAS,YAAAC,GAAU,WAAAC,OAAe,kBAclC,GAAM,CAAE,YAAAC,GAAc,CAAA,EAAI,iBAAAC,GAAmB,CAAA,CAAE,EAAKC,EAE9CC,GACJD,EAAO,SACP,QAAQ,IAAI,cAAgB,WAC5B,QAAQ,IAAI,cAAgB,OAExBE,GAA+B,CACnCC,EACAC,EACAC,EAGAC,EAGAC,EAAsC,IAAI,MACZ,CAC9B,GAAIJ,IAAM,OACV,IAAI,OAAOA,GAAM,SAAU,CAEzB,IAAMK,EAAMF,IAAS,WAAa,OAAS,OAC3C,GAAIH,EAAE,SAASK,CAAG,EAAG,OACrB,IAAMC,EAAKL,IAAY,WAAa,MAAQA,EACtCM,EAAMC,GACVC,GAAQ,OAAO,EACfA,GAAQL,EAAU,IAAIE,CAAE,GAAG,IAAI,IAAIN,CAAC,GAAKA,CAAC,CAAC,EAEvCU,EAASZ,GAAUS,EAAMA,EAAI,QAAQ,iBAAkB,OAAO,EACpE,MACE,CAACP,GAAK,CAACA,EAAE,WAAW,QAAQ,EAAIA,EAC9BW,GAAS,SAASR,CAAI,EAAI,UAAUF,CAAO,IAAIS,CAAM,GACrD,MAEN,CACA,OAAOE,GAAcZ,EAAG,CAACE,CAAS,CAAC,EAAC,EAGzBW,GAAe,CAC1Bb,EACAI,EAAsC,IAAI,MACvCL,GAA6BC,EAAG,MAAO,SAAU,MAAOI,CAAS,EAEzDU,GAAe,CAC1Bd,EACAI,EAAsC,IAAI,MAE1CL,GACEC,EACA,WACA,UACA,WACAI,CAAS,EAGPW,GAAa,CACjBC,EACAC,IACqC,CAGrC,GAAI,CAACD,EAAE,QACL,OAAAE,EAAK,qDAAqD,EACnD,QAAQ,KAAK,CAAC,EAGvB,IAAMC,EAAsC,CAAA,EAC5C,OAAW,CAACC,EAAKpB,CAAC,IAAK,OAAO,QAAQgB,EAAE,OAAO,EAAG,CAEhD,GAAIhB,IAAM,OAAS,OAAOA,GAAM,UAAY,CAACA,EAAE,WAAW,QAAQ,GAAI,CAEpEmB,EAAEC,CAAG,EAAIpB,EACT,QACF,CAGA,GAAIA,IAAM,KAAM,SAEhB,IAAMqB,EAAYR,GAAab,EAAGsB,CAAS,EACrCC,EAAYT,GAAad,EAAGsB,CAAS,EAI3C,GAAI,CAACD,GAAa,CAACE,EAAW,SAG9B,IAAMC,EAA+BL,EAAEC,CAAG,EAAI,CAAA,EAC9C,GAAIC,EACF,QAAWI,KAAK9B,GAAa,CAC3B,IAAM+B,EAAS1B,IAAMsB,EAAU,IAAIG,CAAC,GAAG,IAAI,IAAIzB,CAAC,GAAKA,GAE/CU,EAASX,GACbC,EACAyB,EACAA,EACA,MACAH,CAAS,EAEPZ,IACFc,EAAIC,CAAC,EACH3B,GACE,CACE,GAAImB,IAAY,WACdU,GAAkBD,EAAQV,CAAC,EAC3B,CAAA,EACF,QAASN,GAEX,CACE,GAAIO,IAAY,WACdU,GAAkBD,EAAQV,CAAC,EAC3B,CAAA,EACF,MAAON,EAAO,QAAQ,QAAS,OAAO,EACtC,QAASA,GAGnB,CAGF,GAAIa,EACF,QAAWE,KAAK7B,GAAkB,CAChC,IAAM8B,EAAS1B,IAAMsB,EAAU,IAAIG,CAAC,GAAG,IAAI,IAAIzB,CAAC,GAAKA,GAC/CU,EAASX,GACbC,EACAyB,EACAA,EACA,WACAH,CAAS,EAEPZ,IACFc,EAAIC,CAAC,EACH3B,GACE,CACE,GAAImB,IAAY,SACdU,GAAkBD,EAAQV,CAAC,EAC3B,CAAA,EACF,QAASN,GAEX,CACE,GAAIO,IAAY,SACdU,GAAkBD,EAAQV,CAAC,EAC3B,CAAA,EACF,MAAON,EAAO,QAAQ,QAAS,OAAO,EACtC,QAASA,GAGnB,CAIEW,IACFG,EAAI,OACF1B,GACE,CACE,GAAImB,IAAY,SAAWU,GAAkB3B,EAAGgB,CAAC,EAAI,CAAA,EACrD,QAASK,GAEX,CACE,GAAIJ,IAAY,SAAWU,GAAkB3B,EAAGgB,CAAC,EAAI,CAAA,EACrD,MAAOK,EAAU,QAAQ,YAAa,SAAS,EAC/C,QAASA,IAGbE,IACFC,EAAI,QACF1B,GACE,CACE,GAAImB,IAAY,WAAaU,GAAkB3B,EAAGgB,CAAC,EAAI,CAAA,EACvD,QAASO,GAEX,CACE,GAAIN,IAAY,WAAaU,GAAkB3B,EAAGgB,CAAC,EAAI,CAAA,EACvD,MAAOO,EAAU,QAAQ,YAAa,SAAS,EAC/C,QAASA,GAGnB,CACA,OAAOJ,CAAC,EAGJQ,GAAoB,CAACD,EAAgBV,IAAkB,CAC3D,GAAM,CAAE,eAAAY,CAAc,EAAKZ,EAC3B,OAAKY,EACE,OAAO,YAAYA,EAAe,IAAI5B,GAAK,CAACA,EAAG0B,CAAM,CAAC,CAAC,EADlC,CAAA,CACmC,EAGpDG,GAAU,CACrBb,EACAc,IACG,CACHA,EAAI,KAAOA,EAAI,OAAS,WAAa,WAAa,SAClD,IAAMC,EAAMnB,GAAckB,EAAI,QAAQ,GAAG,EAAG,CAAC,SAAS,CAAC,EAEvD,GADad,GAAG,MAAQ,CAAC,CAACe,EAChB,CACR,GAAI,CAACA,EACH,OAAAb,EAAK,wDAAwD,EACtD,QAAQ,KAAK,CAAC,EAEvB,IAAMc,EAAQpB,GAAckB,EAAI,QAAQ,GAAG,EAAG,CAAC,UAAW,OAAO,CAAC,EAClEA,EAAI,KAAOC,EACPC,GAASA,IAAUD,EAAKD,EAAI,MAAQE,EACnC,OAAOF,EAAI,KAClB,MACMd,GAAKA,EAAE,OAAS,IAAO,OAAOA,EAAE,KACpC,OAAOc,EAAI,KACX,OAAOA,EAAI,MAIb,IAAMG,EAAYrB,GAAckB,EAAI,QAAQ,GAAG,EAAG,CAAC,QAAQ,CAAC,EAE5D,GADed,GAAG,QAAU,CAAC,CAACiB,EAClB,CACV,GAAI,CAACA,EACH,OAAAf,EAAK,yDAAyD,EACvD,QAAQ,KAAK,CAAC,EAGvBY,EAAI,OAASG,CACf,MACMjB,GAAKA,EAAE,SAAW,IAAO,OAAOA,EAAE,OACtC,OAAOc,EAAI,MACZ,EAGHI,EAAI,QAAUnB,GAAWlB,EAAQqC,EAAI,IAAI,EAEzCL,GAAQhC,EAAQqC,CAA6C,EAC7D,IAAAC,GAAeD,EAAI,QC7OnB,IAAAE,GAAgBC,GAAiB,CAC/B,IAAMC,EAAM,iCACNC,EACJC,EAAM,MAAQ,EAAI,WAAWF,CAAG,SAASA,CAAG,iBAAmBA,EACjE,QAAQD,EAAM,QAAU,KAAK,EAAE;;;;;;qCAMIE,CAAI,EAAE,EACrCF,GAAKI,EAAKJ,CAAG,EACjB,QAAQ,KAAKA,EAAM,EAAI,CAAC,CAAC,ECZ3B,OAAS,SAAAK,OAAa,gBCFtB,OAAS,QAAQC,OAAc,KAC/B,OAAS,QAAAC,GAAM,WAAAC,OAAe,cAC9B,OAAS,gBAAAC,OAAoB,SAC7B,UAAYC,MAAa,OCJzB,OAAS,QAAAC,GAAM,SAAAC,GAAO,WAAAC,GAAS,YAAAC,OAAgB,mBAC/C,OAAS,YAAAC,OAAgB,cACzB,OAAS,WAAWC,GAAU,YAAYC,GAAW,QAAQC,GAAO,OAAOC,OAAY,YAChF,IAAMC,GAAa,CACtB,UAAW,QACX,SAAU,cACV,cAAe,oBACf,gBAAiB,KACrB,EACMC,GAAiB,CACnB,KAAM,IACN,WAAaC,GAAe,GAC5B,gBAAkBA,GAAe,GACjC,KAAMF,GAAW,UACjB,MAAO,GACP,MAAO,WACP,WAAY,GACZ,cAAe,IACnB,EACA,OAAO,OAAOC,EAAc,EAC5B,IAAME,GAAuB,2BACvBC,GAAqB,IAAI,IAAI,CAAC,SAAU,QAAS,SAAU,QAASD,EAAoB,CAAC,EACzFE,GAAY,CACdL,GAAW,SACXA,GAAW,gBACXA,GAAW,cACXA,GAAW,SACf,EACMM,GAAY,IAAI,IAAI,CACtBN,GAAW,SACXA,GAAW,gBACXA,GAAW,aACf,CAAC,EACKO,GAAa,IAAI,IAAI,CACvBP,GAAW,gBACXA,GAAW,cACXA,GAAW,SACf,CAAC,EACKQ,GAAqBC,GAAUL,GAAmB,IAAIK,EAAM,IAAI,EAChEC,GAAoB,QAAQ,WAAa,QACzCC,GAAWT,GAAe,GAC1BU,GAAmBC,GAAW,CAChC,GAAIA,IAAW,OACX,OAAOF,GACX,GAAI,OAAOE,GAAW,WAClB,OAAOA,EACX,GAAI,OAAOA,GAAW,SAAU,CAC5B,IAAMC,EAAKD,EAAO,KAAK,EACvB,OAAQE,GAAUA,EAAM,WAAaD,CACzC,CACA,GAAI,MAAM,QAAQD,CAAM,EAAG,CACvB,IAAMG,EAAUH,EAAO,IAAKI,GAASA,EAAK,KAAK,CAAC,EAChD,OAAQF,GAAUC,EAAQ,KAAME,GAAMH,EAAM,WAAaG,CAAC,CAC9D,CACA,OAAOP,EACX,EAEaQ,GAAN,cAA6BxB,EAAS,CACzC,YAAYyB,EAAU,CAAC,EAAG,CACtB,MAAM,CACF,WAAY,GACZ,YAAa,GACb,cAAeA,EAAQ,aAC3B,CAAC,EACD,IAAMC,EAAO,CAAE,GAAGpB,GAAgB,GAAGmB,CAAQ,EACvC,CAAE,KAAAE,EAAM,KAAAC,CAAK,EAAIF,EACvB,KAAK,YAAcT,GAAgBS,EAAK,UAAU,EAClD,KAAK,iBAAmBT,GAAgBS,EAAK,eAAe,EAC5D,IAAMG,EAAaH,EAAK,MAAQ7B,GAAQD,GAEpCmB,GACA,KAAK,MAASe,GAASD,EAAWC,EAAM,CAAE,OAAQ,EAAK,CAAC,EAGxD,KAAK,MAAQD,EAEjB,KAAK,UAAYH,EAAK,OAASpB,GAAe,MAC9C,KAAK,UAAYsB,EAAOjB,GAAU,IAAIiB,CAAI,EAAI,GAC9C,KAAK,WAAaA,EAAOhB,GAAW,IAAIgB,CAAI,EAAI,GAChD,KAAK,iBAAmBA,IAASvB,GAAW,gBAC5C,KAAK,MAAQJ,GAAS0B,CAAI,EAC1B,KAAK,UAAY,CAACD,EAAK,WACvB,KAAK,WAAa,KAAK,UAAY,SAAW,QAC9C,KAAK,WAAa,CAAE,SAAU,OAAQ,cAAe,KAAK,SAAU,EAEpE,KAAK,QAAU,CAAC,KAAK,YAAYC,EAAM,CAAC,CAAC,EACzC,KAAK,QAAU,GACf,KAAK,OAAS,MAClB,CACA,MAAM,MAAMI,EAAO,CACf,GAAI,MAAK,QAET,MAAK,QAAU,GACf,GAAI,CACA,KAAO,CAAC,KAAK,WAAaA,EAAQ,GAAG,CACjC,IAAMC,EAAM,KAAK,OACXC,EAAMD,GAAOA,EAAI,MACvB,GAAIC,GAAOA,EAAI,OAAS,EAAG,CACvB,GAAM,CAAE,KAAAH,EAAM,MAAAI,CAAM,EAAIF,EAClBG,EAAQF,EAAI,OAAO,EAAGF,CAAK,EAAE,IAAKK,GAAW,KAAK,aAAaA,EAAQN,CAAI,CAAC,EAC5EO,EAAU,MAAM,QAAQ,IAAIF,CAAK,EACvC,QAAWf,KAASiB,EAAS,CACzB,GAAI,CAACjB,EACD,SACJ,GAAI,KAAK,UACL,OACJ,IAAMkB,EAAY,MAAM,KAAK,cAAclB,CAAK,EAC5CkB,IAAc,aAAe,KAAK,iBAAiBlB,CAAK,GACpDc,GAAS,KAAK,WACd,KAAK,QAAQ,KAAK,KAAK,YAAYd,EAAM,SAAUc,EAAQ,CAAC,CAAC,EAE7D,KAAK,YACL,KAAK,KAAKd,CAAK,EACfW,OAGEO,IAAc,QAAU,KAAK,eAAelB,CAAK,IACvD,KAAK,YAAYA,CAAK,GAClB,KAAK,aACL,KAAK,KAAKA,CAAK,EACfW,IAGZ,CACJ,KACK,CACD,IAAMQ,EAAS,KAAK,QAAQ,IAAI,EAChC,GAAI,CAACA,EAAQ,CACT,KAAK,KAAK,IAAI,EACd,KACJ,CAEA,GADA,KAAK,OAAS,MAAMA,EAChB,KAAK,UACL,MACR,CACJ,CACJ,OACOzB,EAAO,CACV,KAAK,QAAQA,CAAK,CACtB,QACA,CACI,KAAK,QAAU,EACnB,EACJ,CACA,MAAM,YAAYgB,EAAMI,EAAO,CAC3B,IAAIM,EACJ,GAAI,CACAA,EAAQ,MAAM1C,GAAQgC,EAAM,KAAK,UAAU,CAC/C,OACOhB,EAAO,CACV,KAAK,SAASA,CAAK,CACvB,CACA,MAAO,CAAE,MAAA0B,EAAO,MAAAN,EAAO,KAAAJ,CAAK,CAChC,CACA,MAAM,aAAaM,EAAQN,EAAM,CAC7B,IAAIV,EACEqB,EAAW,KAAK,UAAYL,EAAO,KAAOA,EAChD,GAAI,CACA,IAAMM,EAAWzC,GAASE,GAAM2B,EAAMW,CAAQ,CAAC,EAC/CrB,EAAQ,CAAE,KAAMlB,GAAU,KAAK,MAAOwC,CAAQ,EAAG,SAAAA,EAAU,SAAAD,CAAS,EACpErB,EAAM,KAAK,UAAU,EAAI,KAAK,UAAYgB,EAAS,MAAM,KAAK,MAAMM,CAAQ,CAChF,OACOC,EAAK,CACR,KAAK,SAASA,CAAG,EACjB,MACJ,CACA,OAAOvB,CACX,CACA,SAASuB,EAAK,CACN9B,GAAkB8B,CAAG,GAAK,CAAC,KAAK,UAChC,KAAK,KAAK,OAAQA,CAAG,EAGrB,KAAK,QAAQA,CAAG,CAExB,CACA,MAAM,cAAcvB,EAAO,CAGvB,GAAI,CAACA,GAAS,KAAK,cAAcA,EAC7B,MAAO,GAEX,IAAMwB,EAAQxB,EAAM,KAAK,UAAU,EACnC,GAAIwB,EAAM,OAAO,EACb,MAAO,OACX,GAAIA,EAAM,YAAY,EAClB,MAAO,YACX,GAAIA,GAASA,EAAM,eAAe,EAAG,CACjC,IAAMC,EAAOzB,EAAM,SACnB,GAAI,CACA,IAAM0B,EAAgB,MAAM/C,GAAS8C,CAAI,EACnCE,EAAqB,MAAMlD,GAAMiD,CAAa,EACpD,GAAIC,EAAmB,OAAO,EAC1B,MAAO,OAEX,GAAIA,EAAmB,YAAY,EAAG,CAClC,IAAMC,EAAMF,EAAc,OAC1B,GAAID,EAAK,WAAWC,CAAa,GAAKD,EAAK,OAAOG,EAAK,CAAC,IAAM5C,GAAM,CAChE,IAAM6C,EAAiB,IAAI,MAAM,+BAA+BJ,CAAI,gBAAgBC,CAAa,GAAG,EAEpG,OAAAG,EAAe,KAAOzC,GACf,KAAK,SAASyC,CAAc,CACvC,CACA,MAAO,WACX,CACJ,OACOnC,EAAO,CACV,YAAK,SAASA,CAAK,EACZ,EACX,CACJ,CACJ,CACA,eAAeM,EAAO,CAClB,IAAMwB,EAAQxB,GAASA,EAAM,KAAK,UAAU,EAC5C,OAAOwB,GAAS,KAAK,kBAAoB,CAACA,EAAM,YAAY,CAChE,CACJ,EAOO,SAASM,GAASvB,EAAMF,EAAU,CAAC,EAAG,CAEzC,IAAIG,EAAOH,EAAQ,WAAaA,EAAQ,KAKxC,GAJIG,IAAS,SACTA,EAAOvB,GAAW,eAClBuB,IACAH,EAAQ,KAAOG,GACdD,EAGA,IAAI,OAAOA,GAAS,SACrB,MAAM,IAAI,UAAU,0EAA0E,EAE7F,GAAIC,GAAQ,CAAClB,GAAU,SAASkB,CAAI,EACrC,MAAM,IAAI,MAAM,6CAA6ClB,GAAU,KAAK,IAAI,CAAC,EAAE,MANnF,OAAM,IAAI,MAAM,qEAAqE,EAQzF,OAAAe,EAAQ,KAAOE,EACR,IAAIH,GAAeC,CAAO,CACrC,CCjPA,OAAS,aAAA0B,GAAW,eAAAC,GAAa,SAASC,OAAgB,KAC1D,OAAS,QAAAC,GAAM,QAAAC,GAAM,SAAAC,GAAO,YAAYC,OAAkB,cAC1D,UAAYC,MAAa,OACzB,OAAS,QAAQC,OAAc,KACxB,IAAMC,GAAW,OACXC,GAAU,MACVC,GAAY,QACZC,GAAW,IAAM,CAAE,EAEhC,IAAMC,GAAK,QAAQ,SACNC,GAAYD,KAAO,QACnBE,GAAUF,KAAO,SACjBG,GAAUH,KAAO,QACjBI,GAAYJ,KAAO,UACnBK,GAASC,GAAO,IAAM,QACtBC,EAAS,CAClB,IAAK,MACL,MAAO,QACP,IAAK,MACL,OAAQ,SACR,QAAS,SACT,OAAQ,SACR,WAAY,YACZ,IAAK,MACL,MAAO,OACX,EACMC,GAAKD,EACLE,GAAsB,QACtBC,GAAc,CAAE,MAAAC,GAAO,KAAAC,EAAK,EAC5BC,GAAgB,YAChBC,GAAU,cACVC,GAAU,cACVC,GAAe,CAACH,GAAeC,GAASC,EAAO,EAE/CE,GAAmB,IAAI,IAAI,CAC7B,MAAO,MAAO,MAAO,MAAO,KAAM,IAAK,MAAO,MAAO,WAAY,UAAW,QAAS,KACrF,MAAO,OAAQ,MAAO,MAAO,MAAO,WAAY,KAAM,MAAO,MAAO,KAAM,MAC1E,MAAO,OAAQ,KAAM,MAAO,KAAM,MAAO,OAAQ,MAAO,QACxD,MAAO,MAAO,MAAO,QAAS,MAAO,OAAQ,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,OACvF,MAAO,MAAO,MAAO,MAAO,OAAQ,OAAQ,MAAO,OAAQ,MAAO,WAAY,MAAO,MACrF,QAAS,MAAO,MAAO,MACvB,YAAa,YAAa,YAAa,MAAO,MAAO,MAAO,OAAQ,MACpE,MAAO,MAAO,KAAM,MAAO,OAAQ,UAAW,MAAO,MAAO,MAAO,MAAO,MAC1E,KAAM,KAAM,MAAO,UAAW,KAAM,OACpC,OAAQ,OAAQ,OAAQ,OAAQ,MAAO,MAAO,MAAO,MAAO,MAC5D,MAAO,OAAQ,MAAO,OAAQ,MAAO,MAAO,MAAO,MACnD,MAAO,MAAO,MAAO,KAAM,MAAO,OAAQ,MAC1C,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,OAAQ,MAAO,MAAO,MAAO,MAAO,MACrF,OAAQ,MAAO,QAAS,MACxB,MAAO,OAAQ,OAAQ,MAAO,OAAQ,MACtC,MAAO,MAAO,UAAW,QACzB,IAAK,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MACtD,QAAS,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,OAC/E,OAAQ,MAAO,OACf,MAAO,MAAO,OAAQ,OAAQ,MAAO,OAAQ,OAAQ,MAAO,MAAO,MAAO,MAAO,MACjF,KACA,MAAO,MAAO,MAAO,YAAa,MAAO,MAAO,MAAO,MAAO,OAAQ,MAAO,MAAO,KACpF,MAAO,MAAO,OAAQ,MAAO,OAAQ,OAAQ,MAAO,SAAU,MAAO,MAAO,MAAO,KACnF,MAAO,MAAO,MAAO,MACrB,MAAO,MAAO,OAAQ,MAAO,MAAO,OAAQ,MAAO,OAAQ,MAAO,MAAO,MAAO,MAChF,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAC1C,MAAO,MACP,MAAO,MAAO,MAAO,OAAQ,MAAO,OAAQ,OAAQ,OAAQ,MAAO,MAAO,KAAM,MAChF,MAAO,MAAO,OAAQ,QAAS,MAAO,MACtC,MAAO,MAAO,MAAO,OAAQ,MAAO,OAAQ,OAAQ,OAAQ,MAAO,OAAQ,OAAQ,KACnF,QAAS,MAAO,MAAO,MAAO,KAC9B,IAAK,MAAO,MAChB,CAAC,EACKC,GAAgBC,GAAaF,GAAiB,IAAY,UAAQE,CAAQ,EAAE,MAAM,CAAC,EAAE,YAAY,CAAC,EAElGC,GAAU,CAACC,EAAKC,IAAO,CACrBD,aAAe,IACfA,EAAI,QAAQC,CAAE,EAGdA,EAAGD,CAAG,CAEd,EACME,GAAgB,CAACC,EAAMC,EAAMC,IAAS,CACxC,IAAIC,EAAYH,EAAKC,CAAI,EACnBE,aAAqB,MACvBH,EAAKC,CAAI,EAAIE,EAAY,IAAI,IAAI,CAACA,CAAS,CAAC,GAEhDA,EAAU,IAAID,CAAI,CACtB,EACME,GAAaC,GAAUC,GAAQ,CACjC,IAAMC,EAAMF,EAAKC,CAAG,EAChBC,aAAe,IACfA,EAAI,MAAM,EAGV,OAAOF,EAAKC,CAAG,CAEvB,EACME,GAAa,CAACR,EAAMC,EAAMC,IAAS,CACrC,IAAMC,EAAYH,EAAKC,CAAI,EACvBE,aAAqB,IACrBA,EAAU,OAAOD,CAAI,EAEhBC,IAAcD,GACnB,OAAOF,EAAKC,CAAI,CAExB,EACMQ,GAAcZ,GAASA,aAAe,IAAMA,EAAI,OAAS,EAAI,CAACA,EAC9Da,GAAmB,IAAI,IAU7B,SAASC,GAAsBC,EAAMC,EAASC,EAAUC,EAAYC,EAAS,CACzE,IAAMC,EAAc,CAACC,EAAUC,IAAW,CACtCL,EAASF,CAAI,EACbI,EAAQE,EAAUC,EAAQ,CAAE,YAAaP,CAAK,CAAC,EAG3CO,GAAUP,IAASO,GACnBC,GAAyB,UAAQR,EAAMO,CAAM,EAAG9B,GAAuB,OAAKuB,EAAMO,CAAM,CAAC,CAEjG,EACA,GAAI,CACA,OAAOE,GAAST,EAAM,CAClB,WAAYC,EAAQ,UACxB,EAAGI,CAAW,CAClB,OACOK,EAAO,CACVP,EAAWO,CAAK,EAChB,MACJ,CACJ,CAKA,IAAMF,GAAmB,CAACG,EAAUC,EAAcC,EAAMC,EAAMC,IAAS,CACnE,IAAMtB,EAAOK,GAAiB,IAAIa,CAAQ,EACrClB,GAELT,GAAQS,EAAKmB,CAAY,EAAIV,GAAa,CACtCA,EAASW,EAAMC,EAAMC,CAAI,CAC7B,CAAC,CACL,EASMC,GAAqB,CAAChB,EAAMW,EAAUV,EAASgB,IAAa,CAC9D,GAAM,CAAE,SAAAf,EAAU,WAAAC,EAAY,WAAAe,CAAW,EAAID,EACzCxB,EAAOK,GAAiB,IAAIa,CAAQ,EACpCQ,EACJ,GAAI,CAAClB,EAAQ,WAET,OADAkB,EAAUpB,GAAsBC,EAAMC,EAASC,EAAUC,EAAYe,CAAU,EAC1EC,EAEEA,EAAQ,MAAM,KAAKA,CAAO,EAD7B,OAGR,GAAI1B,EACAN,GAAcM,EAAMhB,GAAeyB,CAAQ,EAC3Cf,GAAcM,EAAMf,GAASyB,CAAU,EACvChB,GAAcM,EAAMd,GAASuC,CAAU,MAEtC,CAGD,GAFAC,EAAUpB,GAAsBC,EAAMC,EAASO,GAAiB,KAAK,KAAMG,EAAUlC,EAAa,EAAG0B,EACrGK,GAAiB,KAAK,KAAMG,EAAUhC,EAAO,CAAC,EAC1C,CAACwC,EACD,OACJA,EAAQ,GAAG/C,GAAG,MAAO,MAAOsC,GAAU,CAClC,IAAMU,EAAeZ,GAAiB,KAAK,KAAMG,EAAUjC,EAAO,EAIlE,GAHIe,IACAA,EAAK,gBAAkB,IAEvB5B,IAAa6C,EAAM,OAAS,QAC5B,GAAI,CAEA,MADW,MAAMW,GAAKrB,EAAM,GAAG,GACtB,MAAM,EACfoB,EAAaV,CAAK,CACtB,MACY,CAEZ,MAGAU,EAAaV,CAAK,CAE1B,CAAC,EACDjB,EAAO,CACH,UAAWS,EACX,YAAaC,EACb,YAAae,EACb,QAAAC,CACJ,EACArB,GAAiB,IAAIa,EAAUlB,CAAI,CACvC,CAIA,MAAO,IAAM,CACTG,GAAWH,EAAMhB,GAAeyB,CAAQ,EACxCN,GAAWH,EAAMf,GAASyB,CAAU,EACpCP,GAAWH,EAAMd,GAASuC,CAAU,EAChCrB,GAAWJ,EAAK,SAAS,IAGzBA,EAAK,QAAQ,MAAM,EAEnBK,GAAiB,OAAOa,CAAQ,EAChC/B,GAAa,QAAQY,GAAUC,CAAI,CAAC,EAEpCA,EAAK,QAAU,OACf,OAAO,OAAOA,CAAI,EAE1B,CACJ,EAIM6B,GAAuB,IAAI,IAU3BC,GAAyB,CAACvB,EAAMW,EAAUV,EAASgB,IAAa,CAClE,GAAM,CAAE,SAAAf,EAAU,WAAAgB,CAAW,EAAID,EAC7BxB,EAAO6B,GAAqB,IAAIX,CAAQ,EAGtCa,EAAQ/B,GAAQA,EAAK,QAC3B,OAAI+B,IAAUA,EAAM,WAAavB,EAAQ,YAAcuB,EAAM,SAAWvB,EAAQ,YAO5EwB,GAAYd,CAAQ,EACpBlB,EAAO,QAEPA,GACAN,GAAcM,EAAMhB,GAAeyB,CAAQ,EAC3Cf,GAAcM,EAAMd,GAASuC,CAAU,IAMvCzB,EAAO,CACH,UAAWS,EACX,YAAagB,EACb,QAAAjB,EACA,QAASyB,GAAUf,EAAUV,EAAS,CAAC0B,EAAMC,IAAS,CAClD5C,GAAQS,EAAK,YAAcyB,GAAe,CACtCA,EAAW9C,GAAG,OAAQuC,EAAU,CAAE,KAAAgB,EAAM,KAAAC,CAAK,CAAC,CAClD,CAAC,EACD,IAAMC,EAAYF,EAAK,SACnBA,EAAK,OAASC,EAAK,MAAQC,EAAYD,EAAK,SAAWC,IAAc,IACrE7C,GAAQS,EAAK,UAAYS,GAAaA,EAASF,EAAM2B,CAAI,CAAC,CAElE,CAAC,CACL,EACAL,GAAqB,IAAIX,EAAUlB,CAAI,GAKpC,IAAM,CACTG,GAAWH,EAAMhB,GAAeyB,CAAQ,EACxCN,GAAWH,EAAMd,GAASuC,CAAU,EAChCrB,GAAWJ,EAAK,SAAS,IACzB6B,GAAqB,OAAOX,CAAQ,EACpCc,GAAYd,CAAQ,EACpBlB,EAAK,QAAUA,EAAK,QAAU,OAC9B,OAAO,OAAOA,CAAI,EAE1B,CACJ,EAIaqC,GAAN,KAAoB,CACvB,YAAYC,EAAK,CACb,KAAK,IAAMA,EACX,KAAK,kBAAqBrB,GAAUqB,EAAI,aAAarB,CAAK,CAC9D,CAOA,iBAAiBV,EAAME,EAAU,CAC7B,IAAM8B,EAAO,KAAK,IAAI,QAChBC,EAAoB,UAAQjC,CAAI,EAChCkC,EAAmB,WAASlC,CAAI,EACvB,KAAK,IAAI,eAAeiC,CAAS,EACzC,IAAIC,CAAQ,EACnB,IAAMC,EAAuB,UAAQnC,CAAI,EACnCC,EAAU,CACZ,WAAY+B,EAAK,UACrB,EACK9B,IACDA,EAAWkC,IACf,IAAIC,EACJ,GAAIL,EAAK,WAAY,CACjB,IAAMM,EAAYN,EAAK,WAAaA,EAAK,eACzC/B,EAAQ,SAAWqC,GAAaxD,GAAaoD,CAAQ,EAAIF,EAAK,eAAiBA,EAAK,SACpFK,EAASd,GAAuBvB,EAAMmC,EAAclC,EAAS,CACzD,SAAAC,EACA,WAAY,KAAK,IAAI,QACzB,CAAC,CACL,MAEImC,EAASrB,GAAmBhB,EAAMmC,EAAclC,EAAS,CACrD,SAAAC,EACA,WAAY,KAAK,kBACjB,WAAY,KAAK,IAAI,QACzB,CAAC,EAEL,OAAOmC,CACX,CAKA,YAAYE,EAAMC,EAAOC,EAAY,CACjC,GAAI,KAAK,IAAI,OACT,OAEJ,IAAMC,EAAkB,UAAQH,CAAI,EAC9BL,EAAmB,WAASK,CAAI,EAChCI,EAAS,KAAK,IAAI,eAAeD,CAAO,EAE1CE,EAAYJ,EAEhB,GAAIG,EAAO,IAAIT,CAAQ,EACnB,OACJ,IAAMhC,EAAW,MAAOF,EAAM6C,IAAa,CACvC,GAAK,KAAK,IAAI,UAAUxE,GAAqBkE,EAAM,CAAC,GAEpD,GAAI,CAACM,GAAYA,EAAS,UAAY,EAClC,GAAI,CACA,IAAMA,EAAW,MAAMrE,GAAK+D,CAAI,EAChC,GAAI,KAAK,IAAI,OACT,OAEJ,IAAMO,EAAKD,EAAS,QACdE,EAAKF,EAAS,QAIpB,IAHI,CAACC,GAAMA,GAAMC,GAAMA,IAAOH,EAAU,UACpC,KAAK,IAAI,MAAMxE,GAAG,OAAQmE,EAAMM,CAAQ,GAEvC/E,IAAWC,IAAWC,KAAc4E,EAAU,MAAQC,EAAS,IAAK,CACrE,KAAK,IAAI,WAAW7C,CAAI,EACxB4C,EAAYC,EACZ,IAAMR,EAAS,KAAK,iBAAiBE,EAAMrC,CAAQ,EAC/CmC,GACA,KAAK,IAAI,eAAerC,EAAMqC,CAAM,CAC5C,MAEIO,EAAYC,CAEpB,MACc,CAEV,KAAK,IAAI,QAAQH,EAASR,CAAQ,CACtC,SAGKS,EAAO,IAAIT,CAAQ,EAAG,CAE3B,IAAMY,EAAKD,EAAS,QACdE,EAAKF,EAAS,SAChB,CAACC,GAAMA,GAAMC,GAAMA,IAAOH,EAAU,UACpC,KAAK,IAAI,MAAMxE,GAAG,OAAQmE,EAAMM,CAAQ,EAE5CD,EAAYC,CAChB,EACJ,EAEMR,EAAS,KAAK,iBAAiBE,EAAMrC,CAAQ,EAEnD,GAAI,EAAEuC,GAAc,KAAK,IAAI,QAAQ,gBAAkB,KAAK,IAAI,aAAaF,CAAI,EAAG,CAChF,GAAI,CAAC,KAAK,IAAI,UAAUnE,GAAG,IAAKmE,EAAM,CAAC,EACnC,OACJ,KAAK,IAAI,MAAMnE,GAAG,IAAKmE,EAAMC,CAAK,CACtC,CACA,OAAOH,CACX,CASA,MAAM,eAAeW,EAAOf,EAAWjC,EAAMV,EAAM,CAC/C,GAAI,KAAK,IAAI,OACT,OAEJ,IAAM2D,EAAOD,EAAM,SACbE,EAAM,KAAK,IAAI,eAAejB,CAAS,EAC7C,GAAI,CAAC,KAAK,IAAI,QAAQ,eAAgB,CAElC,KAAK,IAAI,gBAAgB,EACzB,IAAIkB,EACJ,GAAI,CACAA,EAAW,MAAMC,GAAWpD,CAAI,CACpC,MACU,CACN,YAAK,IAAI,WAAW,EACb,EACX,CACA,OAAI,KAAK,IAAI,OACT,QACAkD,EAAI,IAAI5D,CAAI,EACR,KAAK,IAAI,cAAc,IAAI2D,CAAI,IAAME,IACrC,KAAK,IAAI,cAAc,IAAIF,EAAME,CAAQ,EACzC,KAAK,IAAI,MAAM/E,GAAG,OAAQ4B,EAAMgD,EAAM,KAAK,IAI/CE,EAAI,IAAI5D,CAAI,EACZ,KAAK,IAAI,cAAc,IAAI2D,EAAME,CAAQ,EACzC,KAAK,IAAI,MAAM/E,GAAG,IAAK4B,EAAMgD,EAAM,KAAK,GAE5C,KAAK,IAAI,WAAW,EACb,GACX,CAEA,GAAI,KAAK,IAAI,cAAc,IAAIC,CAAI,EAC/B,MAAO,GAEX,KAAK,IAAI,cAAc,IAAIA,EAAM,EAAI,CACzC,CACA,YAAYhB,EAAWQ,EAAYY,EAAIC,EAAQJ,EAAKK,EAAOC,EAAW,CAIlE,GAFAvB,EAAoB,OAAKA,EAAW,EAAE,EACtCuB,EAAY,KAAK,IAAI,UAAU,UAAWvB,EAAW,GAAI,EACrD,CAACuB,EACD,OACJ,IAAMC,EAAW,KAAK,IAAI,eAAeJ,EAAG,IAAI,EAC1CK,EAAU,IAAI,IAChBC,EAAS,KAAK,IAAI,UAAU1B,EAAW,CACvC,WAAae,GAAUK,EAAG,WAAWL,CAAK,EAC1C,gBAAkBA,GAAUK,EAAG,UAAUL,CAAK,CAClD,CAAC,EACD,GAAKW,EAEL,OAAAA,EACK,GAAGC,GAAU,MAAOZ,GAAU,CAC/B,GAAI,KAAK,IAAI,OAAQ,CACjBW,EAAS,OACT,MACJ,CACA,IAAMrE,EAAO0D,EAAM,KACfhD,EAAe,OAAKiC,EAAW3C,CAAI,EAEvC,GADAoE,EAAQ,IAAIpE,CAAI,EACZ,EAAA0D,EAAM,MAAM,eAAe,GAC1B,MAAM,KAAK,eAAeA,EAAOf,EAAWjC,EAAMV,CAAI,GAG3D,IAAI,KAAK,IAAI,OAAQ,CACjBqE,EAAS,OACT,MACJ,EAIIrE,IAASgE,GAAW,CAACA,GAAU,CAACG,EAAS,IAAInE,CAAI,KACjD,KAAK,IAAI,gBAAgB,EAEzBU,EAAe,OAAKkD,EAAa,WAASA,EAAKlD,CAAI,CAAC,EACpD,KAAK,aAAaA,EAAMyC,EAAYY,EAAIE,EAAQ,CAAC,GAEzD,CAAC,EACI,GAAGnF,GAAG,MAAO,KAAK,iBAAiB,EACjC,IAAI,QAAQ,CAACyF,EAASC,IAAW,CACpC,GAAI,CAACH,EACD,OAAOG,EAAO,EAClBH,EAAO,KAAKI,GAAS,IAAM,CACvB,GAAI,KAAK,IAAI,OAAQ,CACjBJ,EAAS,OACT,MACJ,CACA,IAAMK,EAAeR,EAAYA,EAAU,MAAM,EAAI,GACrDK,EAAQ,MAAS,EAIjBJ,EACK,YAAY,EACZ,OAAQnE,GACFA,IAAS2C,GAAa,CAACyB,EAAQ,IAAIpE,CAAI,CACjD,EACI,QAASA,GAAS,CACnB,KAAK,IAAI,QAAQ2C,EAAW3C,CAAI,CACpC,CAAC,EACDqE,EAAS,OAELK,GACA,KAAK,YAAY/B,EAAW,GAAOoB,EAAIC,EAAQJ,EAAKK,EAAOC,CAAS,CAC5E,CAAC,CACL,CAAC,CACL,CAYA,MAAM,WAAWN,EAAKV,EAAOC,EAAYc,EAAOD,EAAQD,EAAIY,EAAU,CAClE,IAAMC,EAAY,KAAK,IAAI,eAAuB,UAAQhB,CAAG,CAAC,EACxDiB,EAAUD,EAAU,IAAY,WAAShB,CAAG,CAAC,EAC/C,EAAET,GAAc,KAAK,IAAI,QAAQ,gBAAkB,CAACa,GAAU,CAACa,GAC/D,KAAK,IAAI,MAAM/F,GAAG,QAAS8E,EAAKV,CAAK,EAGzC0B,EAAU,IAAY,WAAShB,CAAG,CAAC,EACnC,KAAK,IAAI,eAAeA,CAAG,EAC3B,IAAIM,EACAnB,EACE+B,EAAS,KAAK,IAAI,QAAQ,MAChC,IAAKA,GAAU,MAAQb,GAASa,IAAW,CAAC,KAAK,IAAI,cAAc,IAAIH,CAAQ,EAAG,CAC9E,GAAI,CAACX,IACD,MAAM,KAAK,YAAYJ,EAAKT,EAAYY,EAAIC,EAAQJ,EAAKK,EAAOC,CAAS,EACrE,KAAK,IAAI,QACT,OAERnB,EAAS,KAAK,iBAAiBa,EAAK,CAACmB,EAAS7B,IAAU,CAEhDA,GAASA,EAAM,UAAY,GAE/B,KAAK,YAAY6B,EAAS,GAAOhB,EAAIC,EAAQJ,EAAKK,EAAOC,CAAS,CACtE,CAAC,CACL,CACA,OAAOnB,CACX,CAUA,MAAM,aAAarC,EAAMyC,EAAY6B,EAASf,EAAOD,EAAQ,CACzD,IAAMiB,EAAQ,KAAK,IAAI,WACvB,GAAI,KAAK,IAAI,WAAWvE,CAAI,GAAK,KAAK,IAAI,OACtC,OAAAuE,EAAM,EACC,GAEX,IAAMlB,EAAK,KAAK,IAAI,iBAAiBrD,CAAI,EACrCsE,IACAjB,EAAG,WAAcL,GAAUsB,EAAQ,WAAWtB,CAAK,EACnDK,EAAG,UAAaL,GAAUsB,EAAQ,UAAUtB,CAAK,GAGrD,GAAI,CACA,IAAMR,EAAQ,MAAMlE,GAAY+E,EAAG,UAAU,EAAEA,EAAG,SAAS,EAC3D,GAAI,KAAK,IAAI,OACT,OACJ,GAAI,KAAK,IAAI,WAAWA,EAAG,UAAWb,CAAK,EACvC,OAAA+B,EAAM,EACC,GAEX,IAAMC,EAAS,KAAK,IAAI,QAAQ,eAC5BnC,EACJ,GAAIG,EAAM,YAAY,EAAG,CACrB,IAAMiC,EAAkB,UAAQzE,CAAI,EAC9B0E,EAAaF,EAAS,MAAMpB,GAAWpD,CAAI,EAAIA,EAIrD,GAHI,KAAK,IAAI,SAEbqC,EAAS,MAAM,KAAK,WAAWgB,EAAG,UAAWb,EAAOC,EAAYc,EAAOD,EAAQD,EAAIqB,CAAU,EACzF,KAAK,IAAI,QACT,OAEAD,IAAYC,GAAcA,IAAe,QACzC,KAAK,IAAI,cAAc,IAAID,EAASC,CAAU,CAEtD,SACSlC,EAAM,eAAe,EAAG,CAC7B,IAAMkC,EAAaF,EAAS,MAAMpB,GAAWpD,CAAI,EAAIA,EACrD,GAAI,KAAK,IAAI,OACT,OACJ,IAAM2C,EAAiB,UAAQU,EAAG,SAAS,EAI3C,GAHA,KAAK,IAAI,eAAeV,CAAM,EAAE,IAAIU,EAAG,SAAS,EAChD,KAAK,IAAI,MAAMjF,GAAG,IAAKiF,EAAG,UAAWb,CAAK,EAC1CH,EAAS,MAAM,KAAK,WAAWM,EAAQH,EAAOC,EAAYc,EAAOvD,EAAMqD,EAAIqB,CAAU,EACjF,KAAK,IAAI,OACT,OAEAA,IAAe,QACf,KAAK,IAAI,cAAc,IAAY,UAAQ1E,CAAI,EAAG0E,CAAU,CAEpE,MAEIrC,EAAS,KAAK,YAAYgB,EAAG,UAAWb,EAAOC,CAAU,EAE7D,OAAA8B,EAAM,EACFlC,GACA,KAAK,IAAI,eAAerC,EAAMqC,CAAM,EACjC,EACX,OACO3B,EAAO,CACV,GAAI,KAAK,IAAI,aAAaA,CAAK,EAC3B,OAAA6D,EAAM,EACCvE,CAEf,CACJ,CACJ,EF7mBA,IAAM2E,GAAQ,IACRC,GAAc,KACdC,GAAU,IACVC,GAAW,KACXC,GAAc,SACdC,GAAgB,MAChBC,GAAkB,OAClBC,GAAS,mCACTC,GAAc,WACpB,SAASC,GAAOC,EAAM,CAClB,OAAO,MAAM,QAAQA,CAAI,EAAIA,EAAO,CAACA,CAAI,CAC7C,CACA,IAAMC,GAAmBC,GAAY,OAAOA,GAAY,UAAYA,IAAY,MAAQ,EAAEA,aAAmB,QAC7G,SAASC,GAAcD,EAAS,CAC5B,OAAI,OAAOA,GAAY,WACZA,EACP,OAAOA,GAAY,SACXE,GAAWF,IAAYE,EAC/BF,aAAmB,OACXE,GAAWF,EAAQ,KAAKE,CAAM,EACtC,OAAOF,GAAY,UAAYA,IAAY,KACnCE,GAAW,CACf,GAAIF,EAAQ,OAASE,EACjB,MAAO,GACX,GAAIF,EAAQ,UAAW,CACnB,IAAMG,EAAmB,WAASH,EAAQ,KAAME,CAAM,EACtD,OAAKC,EAGE,CAACA,EAAS,WAAW,IAAI,GAAK,CAAS,aAAWA,CAAQ,EAFtD,EAGf,CACA,MAAO,EACX,EAEG,IAAM,EACjB,CACA,SAASC,GAAcC,EAAM,CACzB,GAAI,OAAOA,GAAS,SAChB,MAAM,IAAI,MAAM,iBAAiB,EACrCA,EAAe,YAAUA,CAAI,EAC7BA,EAAOA,EAAK,QAAQ,MAAO,GAAG,EAC9B,IAAIC,EAAU,GACVD,EAAK,WAAW,IAAI,IACpBC,EAAU,IACd,IAAMZ,EAAkB,OACxB,KAAOW,EAAK,MAAMX,CAAe,GAC7BW,EAAOA,EAAK,QAAQX,EAAiB,GAAG,EAC5C,OAAIY,IACAD,EAAO,IAAMA,GACVA,CACX,CACA,SAASE,GAAcC,EAAUC,EAAYC,EAAO,CAChD,IAAML,EAAOD,GAAcK,CAAU,EACrC,QAASE,EAAQ,EAAGA,EAAQH,EAAS,OAAQG,IAAS,CAClD,IAAMC,EAAUJ,EAASG,CAAK,EAC9B,GAAIC,EAAQP,EAAMK,CAAK,EACnB,MAAO,EAEf,CACA,MAAO,EACX,CACA,SAASG,GAASC,EAAUL,EAAY,CACpC,GAAIK,GAAY,KACZ,MAAM,IAAI,UAAU,kCAAkC,EAI1D,IAAMN,EADgBX,GAAOiB,CAAQ,EACN,IAAKd,GAAYC,GAAcD,CAAO,CAAC,EACtE,OAAIS,GAAc,KACP,CAACA,EAAYC,IACTH,GAAcC,EAAUC,EAAYC,CAAK,EAGjDH,GAAcC,EAAUC,CAAU,CAC7C,CACA,IAAMM,GAAcC,GAAW,CAC3B,IAAMC,EAAQpB,GAAOmB,CAAM,EAAE,KAAK,EAClC,GAAI,CAACC,EAAM,MAAOC,GAAM,OAAOA,IAAM1B,EAAW,EAC5C,MAAM,IAAI,UAAU,sCAAsCyB,CAAK,EAAE,EAErE,OAAOA,EAAM,IAAIE,EAAmB,CACxC,EAGMC,GAAUlB,GAAW,CACvB,IAAImB,EAAMnB,EAAO,QAAQT,GAAeL,EAAK,EACzCkB,EAAU,GAId,IAHIe,EAAI,WAAWhC,EAAW,IAC1BiB,EAAU,IAEPe,EAAI,MAAM3B,EAAe,GAC5B2B,EAAMA,EAAI,QAAQ3B,GAAiBN,EAAK,EAE5C,OAAIkB,IACAe,EAAMjC,GAAQiC,GAEXA,CACX,EAGMF,GAAuBd,GAASe,GAAe,YAAUA,GAAOf,CAAI,CAAC,CAAC,EAEtEiB,GAAmB,CAACC,EAAM,KAAQlB,GAChC,OAAOA,GAAS,SACTc,GAA4B,aAAWd,CAAI,EAAIA,EAAe,OAAKkB,EAAKlB,CAAI,CAAC,EAG7EA,EAGTmB,GAAkB,CAACnB,EAAMkB,IACf,aAAWlB,CAAI,EAChBA,EAEI,OAAKkB,EAAKlB,CAAI,EAE3BoB,GAAY,OAAO,OAAO,IAAI,GAAK,EAInCC,GAAN,KAAe,CACX,YAAYC,EAAKC,EAAe,CAC5B,KAAK,KAAOD,EACZ,KAAK,eAAiBC,EACtB,KAAK,MAAQ,IAAI,GACrB,CACA,IAAI9B,EAAM,CACN,GAAM,CAAE,MAAA+B,CAAM,EAAI,KACbA,GAED/B,IAASR,IAAWQ,IAASP,IAC7BsC,EAAM,IAAI/B,CAAI,CACtB,CACA,MAAM,OAAOA,EAAM,CACf,GAAM,CAAE,MAAA+B,CAAM,EAAI,KAIlB,GAHI,CAACA,IAELA,EAAM,OAAO/B,CAAI,EACb+B,EAAM,KAAO,GACb,OACJ,IAAMF,EAAM,KAAK,KACjB,GAAI,CACA,MAAMG,GAAQH,CAAG,CACrB,MACY,CACJ,KAAK,gBACL,KAAK,eAAuB,UAAQA,CAAG,EAAW,WAASA,CAAG,CAAC,CAEvE,CACJ,CACA,IAAI7B,EAAM,CACN,GAAM,CAAE,MAAA+B,CAAM,EAAI,KAClB,GAAKA,EAEL,OAAOA,EAAM,IAAI/B,CAAI,CACzB,CACA,aAAc,CACV,GAAM,CAAE,MAAA+B,CAAM,EAAI,KAClB,OAAKA,EAEE,CAAC,GAAGA,EAAM,OAAO,CAAC,EADd,CAAC,CAEhB,CACA,SAAU,CACN,KAAK,MAAM,MAAM,EACjB,KAAK,KAAO,GACZ,KAAK,eAAiBE,GACtB,KAAK,MAAQN,GACb,OAAO,OAAO,IAAI,CACtB,CACJ,EACMO,GAAgB,OAChBC,GAAgB,QACTC,GAAN,KAAkB,CACrB,YAAY7B,EAAM8B,EAAQC,EAAK,CAC3B,KAAK,IAAMA,EACX,IAAMC,EAAYhC,EAClB,KAAK,KAAOA,EAAOA,EAAK,QAAQT,GAAa,EAAE,EAC/C,KAAK,UAAYyC,EACjB,KAAK,cAAwB,UAAQA,CAAS,EAC9C,KAAK,SAAW,CAAC,EACjB,KAAK,SAAS,QAASC,GAAU,CACzBA,EAAM,OAAS,GACfA,EAAM,IAAI,CAClB,CAAC,EACD,KAAK,eAAiBH,EACtB,KAAK,WAAaA,EAASH,GAAgBC,EAC/C,CACA,UAAUM,EAAO,CACb,OAAe,OAAK,KAAK,UAAmB,WAAS,KAAK,UAAWA,EAAM,QAAQ,CAAC,CACxF,CACA,WAAWA,EAAO,CACd,GAAM,CAAE,MAAA7B,CAAM,EAAI6B,EAClB,GAAI7B,GAASA,EAAM,eAAe,EAC9B,OAAO,KAAK,UAAU6B,CAAK,EAC/B,IAAMC,EAAe,KAAK,UAAUD,CAAK,EAEzC,OAAO,KAAK,IAAI,aAAaC,EAAc9B,CAAK,GAAK,KAAK,IAAI,oBAAoBA,CAAK,CAC3F,CACA,UAAU6B,EAAO,CACb,OAAO,KAAK,IAAI,aAAa,KAAK,UAAUA,CAAK,EAAGA,EAAM,KAAK,CACnE,CACJ,EASaE,GAAN,cAAwBC,EAAa,CAExC,YAAYC,EAAQ,CAAC,EAAG,CACpB,MAAM,EACN,KAAK,OAAS,GACd,KAAK,SAAW,IAAI,IACpB,KAAK,cAAgB,IAAI,IACzB,KAAK,WAAa,IAAI,IACtB,KAAK,SAAW,IAAI,IACpB,KAAK,cAAgB,IAAI,IACzB,KAAK,SAAW,IAAI,IACpB,KAAK,eAAiB,IAAI,IAC1B,KAAK,gBAAkB,IAAI,IAC3B,KAAK,YAAc,EACnB,KAAK,cAAgB,GACrB,IAAMC,EAAMD,EAAM,iBACZE,EAAU,CAAE,mBAAoB,IAAM,aAAc,GAAI,EACxDC,EAAO,CAET,WAAY,GACZ,cAAe,GACf,uBAAwB,GACxB,SAAU,IACV,eAAgB,IAChB,eAAgB,GAChB,WAAY,GAEZ,OAAQ,GACR,GAAGH,EAEH,QAASA,EAAM,QAAU9C,GAAO8C,EAAM,OAAO,EAAI9C,GAAO,CAAC,CAAC,EAC1D,iBAAkB+C,IAAQ,GAAOC,EAAU,OAAOD,GAAQ,SAAW,CAAE,GAAGC,EAAS,GAAGD,CAAI,EAAI,EAClG,EAEIG,KACAD,EAAK,WAAa,IAElBA,EAAK,SAAW,SAChBA,EAAK,OAAS,CAACA,EAAK,YAIxB,IAAME,EAAU,QAAQ,IAAI,oBAC5B,GAAIA,IAAY,OAAW,CACvB,IAAMC,EAAWD,EAAQ,YAAY,EACjCC,IAAa,SAAWA,IAAa,IACrCH,EAAK,WAAa,GACbG,IAAa,QAAUA,IAAa,IACzCH,EAAK,WAAa,GAElBA,EAAK,WAAa,CAAC,CAACG,CAC5B,CACA,IAAMC,EAAc,QAAQ,IAAI,kBAC5BA,IACAJ,EAAK,SAAW,OAAO,SAASI,EAAa,EAAE,GAEnD,IAAIC,EAAa,EACjB,KAAK,WAAa,IAAM,CACpBA,IACIA,GAAc,KAAK,cACnB,KAAK,WAAapB,GAClB,KAAK,cAAgB,GAErB,QAAQ,SAAS,IAAM,KAAK,KAAKqB,EAAG,KAAK,CAAC,EAElD,EACA,KAAK,SAAW,IAAIC,IAAS,KAAK,KAAKD,EAAG,IAAK,GAAGC,CAAI,EACtD,KAAK,aAAe,KAAK,QAAQ,KAAK,IAAI,EAC1C,KAAK,QAAUP,EACf,KAAK,eAAiB,IAAIQ,GAAc,IAAI,EAE5C,OAAO,OAAOR,CAAI,CACtB,CACA,gBAAgB9C,EAAS,CACrB,GAAID,GAAgBC,CAAO,GAEvB,QAAWuD,KAAW,KAAK,cACvB,GAAIxD,GAAgBwD,CAAO,GACvBA,EAAQ,OAASvD,EAAQ,MACzBuD,EAAQ,YAAcvD,EAAQ,UAC9B,OAIZ,KAAK,cAAc,IAAIA,CAAO,CAClC,CACA,mBAAmBA,EAAS,CAGxB,GAFA,KAAK,cAAc,OAAOA,CAAO,EAE7B,OAAOA,GAAY,SACnB,QAAWuD,KAAW,KAAK,cAInBxD,GAAgBwD,CAAO,GAAKA,EAAQ,OAASvD,GAC7C,KAAK,cAAc,OAAOuD,CAAO,CAIjD,CAMA,IAAIvC,EAAQwC,EAAUC,EAAW,CAC7B,GAAM,CAAE,IAAAlC,CAAI,EAAI,KAAK,QACrB,KAAK,OAAS,GACd,KAAK,cAAgB,OACrB,IAAIN,EAAQF,GAAWC,CAAM,EAC7B,OAAIO,IACAN,EAAQA,EAAM,IAAKZ,GACCmB,GAAgBnB,EAAMkB,CAAG,CAG5C,GAELN,EAAM,QAASZ,GAAS,CACpB,KAAK,mBAAmBA,CAAI,CAChC,CAAC,EACD,KAAK,aAAe,OACf,KAAK,cACN,KAAK,YAAc,GACvB,KAAK,aAAeY,EAAM,OAC1B,QAAQ,IAAIA,EAAM,IAAI,MAAOZ,GAAS,CAClC,IAAMqD,EAAM,MAAM,KAAK,eAAe,aAAarD,EAAM,CAACoD,EAAW,OAAW,EAAGD,CAAQ,EAC3F,OAAIE,GACA,KAAK,WAAW,EACbA,CACX,CAAC,CAAC,EAAE,KAAMC,GAAY,CACd,KAAK,QAETA,EAAQ,QAAS7D,GAAS,CAClBA,GACA,KAAK,IAAY,UAAQA,CAAI,EAAW,WAAS0D,GAAY1D,CAAI,CAAC,CAC1E,CAAC,CACL,CAAC,EACM,IACX,CAIA,QAAQkB,EAAQ,CACZ,GAAI,KAAK,OACL,OAAO,KACX,IAAMC,EAAQF,GAAWC,CAAM,EACzB,CAAE,IAAAO,CAAI,EAAI,KAAK,QACrB,OAAAN,EAAM,QAASZ,GAAS,CAEhB,CAAS,aAAWA,CAAI,GAAK,CAAC,KAAK,SAAS,IAAIA,CAAI,IAChDkB,IACAlB,EAAe,OAAKkB,EAAKlB,CAAI,GACjCA,EAAe,UAAQA,CAAI,GAE/B,KAAK,WAAWA,CAAI,EACpB,KAAK,gBAAgBA,CAAI,EACrB,KAAK,SAAS,IAAIA,CAAI,GACtB,KAAK,gBAAgB,CACjB,KAAAA,EACA,UAAW,EACf,CAAC,EAIL,KAAK,aAAe,MACxB,CAAC,EACM,IACX,CAIA,OAAQ,CACJ,GAAI,KAAK,cACL,OAAO,KAAK,cAEhB,KAAK,OAAS,GAEd,KAAK,mBAAmB,EACxB,IAAMuD,EAAU,CAAC,EACjB,YAAK,SAAS,QAASC,GAAeA,EAAW,QAASC,GAAW,CACjE,IAAMC,EAAUD,EAAO,EACnBC,aAAmB,SACnBH,EAAQ,KAAKG,CAAO,CAC5B,CAAC,CAAC,EACF,KAAK,SAAS,QAASC,GAAWA,EAAO,QAAQ,CAAC,EAClD,KAAK,aAAe,OACpB,KAAK,YAAc,EACnB,KAAK,cAAgB,GACrB,KAAK,SAAS,QAASC,GAAWA,EAAO,QAAQ,CAAC,EAClD,KAAK,SAAS,MAAM,EACpB,KAAK,SAAS,MAAM,EACpB,KAAK,SAAS,MAAM,EACpB,KAAK,cAAc,MAAM,EACzB,KAAK,WAAW,MAAM,EACtB,KAAK,cAAgBL,EAAQ,OACvB,QAAQ,IAAIA,CAAO,EAAE,KAAK,IAAG,EAAY,EACzC,QAAQ,QAAQ,EACf,KAAK,aAChB,CAKA,YAAa,CACT,IAAMM,EAAY,CAAC,EACnB,YAAK,SAAS,QAAQ,CAAC3B,EAAOZ,IAAQ,CAElC,IAAMhB,GADM,KAAK,QAAQ,IAAc,WAAS,KAAK,QAAQ,IAAKgB,CAAG,EAAIA,IACpDrC,GACrB4E,EAAUvD,CAAK,EAAI4B,EAAM,YAAY,EAAE,KAAK,CAChD,CAAC,EACM2B,CACX,CACA,YAAYC,EAAOd,EAAM,CACrB,KAAK,KAAKc,EAAO,GAAGd,CAAI,EACpBc,IAAUf,EAAG,OACb,KAAK,KAAKA,EAAG,IAAKe,EAAO,GAAGd,CAAI,CACxC,CAWA,MAAM,MAAMc,EAAO9D,EAAMK,EAAO,CAC5B,GAAI,KAAK,OACL,OACJ,IAAMoC,EAAO,KAAK,QACdsB,KACA/D,EAAe,YAAUA,CAAI,GAC7ByC,EAAK,MACLzC,EAAe,WAASyC,EAAK,IAAKzC,CAAI,GAC1C,IAAMgD,EAAO,CAAChD,CAAI,EACdK,GAAS,MACT2C,EAAK,KAAK3C,CAAK,EACnB,IAAMkC,EAAME,EAAK,iBACbuB,EACJ,GAAIzB,IAAQyB,EAAK,KAAK,eAAe,IAAIhE,CAAI,GACzC,OAAAgE,EAAG,WAAa,IAAI,KACb,KAEX,GAAIvB,EAAK,OAAQ,CACb,GAAIqB,IAAUf,EAAG,OACb,YAAK,gBAAgB,IAAI/C,EAAM,CAAC8D,EAAO,GAAGd,CAAI,CAAC,EAC/C,WAAW,IAAM,CACb,KAAK,gBAAgB,QAAQ,CAACd,EAAOlC,IAAS,CAC1C,KAAK,KAAK,GAAGkC,CAAK,EAClB,KAAK,KAAKa,EAAG,IAAK,GAAGb,CAAK,EAC1B,KAAK,gBAAgB,OAAOlC,CAAI,CACpC,CAAC,CACL,EAAG,OAAOyC,EAAK,QAAW,SAAWA,EAAK,OAAS,GAAG,EAC/C,KAEPqB,IAAUf,EAAG,KAAO,KAAK,gBAAgB,IAAI/C,CAAI,IACjD8D,EAAQf,EAAG,OACX,KAAK,gBAAgB,OAAO/C,CAAI,EAExC,CACA,GAAIuC,IAAQuB,IAAUf,EAAG,KAAOe,IAAUf,EAAG,SAAW,KAAK,cAAe,CACxE,IAAMkB,EAAU,CAACC,EAAK7D,IAAU,CACxB6D,GACAJ,EAAQf,EAAG,MACXC,EAAK,CAAC,EAAIkB,EACV,KAAK,YAAYJ,EAAOd,CAAI,GAEvB3C,IAED2C,EAAK,OAAS,EACdA,EAAK,CAAC,EAAI3C,EAGV2C,EAAK,KAAK3C,CAAK,EAEnB,KAAK,YAAYyD,EAAOd,CAAI,EAEpC,EACA,YAAK,kBAAkBhD,EAAMuC,EAAI,mBAAoBuB,EAAOG,CAAO,EAC5D,IACX,CACA,GAAIH,IAAUf,EAAG,QACO,CAAC,KAAK,UAAUA,EAAG,OAAQ/C,EAAM,EAAE,EAEnD,OAAO,KAEf,GAAIyC,EAAK,YACLpC,IAAU,SACTyD,IAAUf,EAAG,KAAOe,IAAUf,EAAG,SAAWe,IAAUf,EAAG,QAAS,CACnE,IAAMoB,EAAW1B,EAAK,IAAc,OAAKA,EAAK,IAAKzC,CAAI,EAAIA,EACvDK,EACJ,GAAI,CACAA,EAAQ,MAAM+D,GAAKD,CAAQ,CAC/B,MACY,CAEZ,CAEA,GAAI,CAAC9D,GAAS,KAAK,OACf,OACJ2C,EAAK,KAAK3C,CAAK,CACnB,CACA,YAAK,YAAYyD,EAAOd,CAAI,EACrB,IACX,CAKA,aAAaqB,EAAO,CAChB,IAAMC,EAAOD,GAASA,EAAM,KAC5B,OAAIA,GACAC,IAAS,UACTA,IAAS,YACR,CAAC,KAAK,QAAQ,wBAA2BA,IAAS,SAAWA,IAAS,WACvE,KAAK,KAAKvB,EAAG,MAAOsB,CAAK,EAEtBA,GAAS,KAAK,MACzB,CAQA,UAAUE,EAAYvE,EAAMwE,EAAS,CAC5B,KAAK,WAAW,IAAID,CAAU,GAC/B,KAAK,WAAW,IAAIA,EAAY,IAAI,GAAK,EAE7C,IAAME,EAAS,KAAK,WAAW,IAAIF,CAAU,EAC7C,GAAI,CAACE,EACD,MAAM,IAAI,MAAM,kBAAkB,EACtC,IAAMC,EAAaD,EAAO,IAAIzE,CAAI,EAClC,GAAI0E,EACA,OAAAA,EAAW,QACJ,GAGX,IAAIC,EACEC,EAAQ,IAAM,CAChB,IAAMnF,EAAOgF,EAAO,IAAIzE,CAAI,EACtB6E,EAAQpF,EAAOA,EAAK,MAAQ,EAClC,OAAAgF,EAAO,OAAOzE,CAAI,EAClB,aAAa2E,CAAa,EACtBlF,GACA,aAAaA,EAAK,aAAa,EAC5BoF,CACX,EACAF,EAAgB,WAAWC,EAAOJ,CAAO,EACzC,IAAMM,EAAM,CAAE,cAAAH,EAAe,MAAAC,EAAO,MAAO,CAAE,EAC7C,OAAAH,EAAO,IAAIzE,EAAM8E,CAAG,EACbA,CACX,CACA,iBAAkB,CACd,OAAO,KAAK,aAChB,CASA,kBAAkB9E,EAAM+E,EAAWjB,EAAOG,EAAS,CAC/C,IAAM1B,EAAM,KAAK,QAAQ,iBACzB,GAAI,OAAOA,GAAQ,SACf,OACJ,IAAMyC,EAAezC,EAAI,aACrB0C,EACAd,EAAWnE,EACX,KAAK,QAAQ,KAAO,CAAS,aAAWA,CAAI,IAC5CmE,EAAmB,OAAK,KAAK,QAAQ,IAAKnE,CAAI,GAElD,IAAMkF,EAAM,IAAI,KACVC,EAAS,KAAK,eACpB,SAASC,EAAmBC,EAAU,CAClCC,GAAOnB,EAAU,CAACD,EAAKqB,IAAY,CAC/B,GAAIrB,GAAO,CAACiB,EAAO,IAAInF,CAAI,EAAG,CACtBkE,GAAOA,EAAI,OAAS,UACpBD,EAAQC,CAAG,EACf,MACJ,CACA,IAAMgB,EAAM,OAAO,IAAI,IAAM,EACzBG,GAAYE,EAAQ,OAASF,EAAS,OACtCF,EAAO,IAAInF,CAAI,EAAE,WAAakF,GAElC,IAAMlB,EAAKmB,EAAO,IAAInF,CAAI,EACfkF,EAAMlB,EAAG,YACVe,GACNI,EAAO,OAAOnF,CAAI,EAClBiE,EAAQ,OAAWsB,CAAO,GAG1BN,EAAiB,WAAWG,EAAoBJ,EAAcO,CAAO,CAE7E,CAAC,CACL,CACKJ,EAAO,IAAInF,CAAI,IAChBmF,EAAO,IAAInF,EAAM,CACb,WAAYkF,EACZ,WAAY,KACRC,EAAO,OAAOnF,CAAI,EAClB,aAAaiF,CAAc,EACpBnB,EAEf,CAAC,EACDmB,EAAiB,WAAWG,EAAoBJ,CAAY,EAEpE,CAIA,WAAWhF,EAAMK,EAAO,CACpB,GAAI,KAAK,QAAQ,QAAUf,GAAO,KAAKU,CAAI,EACvC,MAAO,GACX,GAAI,CAAC,KAAK,aAAc,CACpB,GAAM,CAAE,IAAAkB,CAAI,EAAI,KAAK,QAEfgC,GADM,KAAK,QAAQ,SACD,CAAC,GAAG,IAAIjC,GAAiBC,CAAG,CAAC,EAE/CsE,EAAO,CAAC,GADO,CAAC,GAAG,KAAK,aAAa,EACb,IAAIvE,GAAiBC,CAAG,CAAC,EAAG,GAAGgC,CAAO,EACpE,KAAK,aAAe1C,GAASgF,EAAM,MAAS,CAChD,CACA,OAAO,KAAK,aAAaxF,EAAMK,CAAK,CACxC,CACA,aAAaL,EAAMoE,EAAM,CACrB,MAAO,CAAC,KAAK,WAAWpE,EAAMoE,CAAI,CACtC,CAKA,iBAAiBpE,EAAM,CACnB,OAAO,IAAI6B,GAAY7B,EAAM,KAAK,QAAQ,eAAgB,IAAI,CAClE,CAOA,eAAeyF,EAAW,CACtB,IAAMnE,EAAc,UAAQmE,CAAS,EACrC,OAAK,KAAK,SAAS,IAAInE,CAAG,GACtB,KAAK,SAAS,IAAIA,EAAK,IAAID,GAASC,EAAK,KAAK,YAAY,CAAC,EACxD,KAAK,SAAS,IAAIA,CAAG,CAChC,CAMA,oBAAoBjB,EAAO,CACvB,OAAI,KAAK,QAAQ,uBACN,GACJ,GAAQ,OAAOA,EAAM,IAAI,EAAI,IACxC,CAQA,QAAQoF,EAAWhG,EAAMiG,EAAa,CAIlC,IAAM1F,EAAe,OAAKyF,EAAWhG,CAAI,EACnC0E,EAAmB,UAAQnE,CAAI,EAKrC,GAJA0F,EACIA,IAAoC,KAAK,SAAS,IAAI1F,CAAI,GAAK,KAAK,SAAS,IAAImE,CAAQ,GAGzF,CAAC,KAAK,UAAU,SAAUnE,EAAM,GAAG,EACnC,OAEA,CAAC0F,GAAe,KAAK,SAAS,OAAS,GACvC,KAAK,IAAID,EAAWhG,EAAM,EAAI,EAIvB,KAAK,eAAeO,CAAI,EACA,YAAY,EAEvB,QAAS2F,GAAW,KAAK,QAAQ3F,EAAM2F,CAAM,CAAC,EAEtE,IAAMC,EAAS,KAAK,eAAeH,CAAS,EACtCI,EAAaD,EAAO,IAAInG,CAAI,EAClCmG,EAAO,OAAOnG,CAAI,EAMd,KAAK,cAAc,IAAI0E,CAAQ,GAC/B,KAAK,cAAc,OAAOA,CAAQ,EAGtC,IAAI2B,EAAU9F,EAGd,GAFI,KAAK,QAAQ,MACb8F,EAAkB,WAAS,KAAK,QAAQ,IAAK9F,CAAI,GACjD,KAAK,QAAQ,kBAAoB,KAAK,eAAe,IAAI8F,CAAO,GAClD,KAAK,eAAe,IAAIA,CAAO,EAAE,WAAW,IAC5C/C,EAAG,IACb,OAIR,KAAK,SAAS,OAAO/C,CAAI,EACzB,KAAK,SAAS,OAAOmE,CAAQ,EAC7B,IAAM4B,EAAYL,EAAc3C,EAAG,WAAaA,EAAG,OAC/C8C,GAAc,CAAC,KAAK,WAAW7F,CAAI,GACnC,KAAK,MAAM+F,EAAW/F,CAAI,EAE9B,KAAK,WAAWA,CAAI,CACxB,CAIA,WAAWA,EAAM,CACb,KAAK,WAAWA,CAAI,EACpB,IAAMsB,EAAc,UAAQtB,CAAI,EAChC,KAAK,eAAesB,CAAG,EAAE,OAAe,WAAStB,CAAI,CAAC,CAC1D,CAIA,WAAWA,EAAM,CACb,IAAMuD,EAAU,KAAK,SAAS,IAAIvD,CAAI,EACjCuD,IAELA,EAAQ,QAASE,GAAWA,EAAO,CAAC,EACpC,KAAK,SAAS,OAAOzD,CAAI,EAC7B,CACA,eAAeA,EAAMyD,EAAQ,CACzB,GAAI,CAACA,EACD,OACJ,IAAI+B,EAAO,KAAK,SAAS,IAAIxF,CAAI,EAC5BwF,IACDA,EAAO,CAAC,EACR,KAAK,SAAS,IAAIxF,EAAMwF,CAAI,GAEhCA,EAAK,KAAK/B,CAAM,CACpB,CACA,UAAUuC,EAAMvD,EAAM,CAClB,GAAI,KAAK,OACL,OACJ,IAAMwD,EAAU,CAAE,KAAMlD,EAAG,IAAK,WAAY,GAAM,MAAO,GAAM,GAAGN,EAAM,MAAO,CAAE,EAC7EkB,EAASuC,GAASF,EAAMC,CAAO,EACnC,YAAK,SAAS,IAAItC,CAAM,EACxBA,EAAO,KAAKwC,GAAW,IAAM,CACzBxC,EAAS,MACb,CAAC,EACDA,EAAO,KAAKyC,GAAS,IAAM,CACnBzC,IACA,KAAK,SAAS,OAAOA,CAAM,EAC3BA,EAAS,OAEjB,CAAC,EACMA,CACX,CACJ,EAUO,SAAS0C,GAAMzF,EAAOqF,EAAU,CAAC,EAAG,CACvC,IAAMK,EAAU,IAAIlE,GAAU6D,CAAO,EACrC,OAAAK,EAAQ,IAAI1F,CAAK,EACV0F,CACX,CDvxBA,OAAS,gBAAAC,OAAoB,KAC7B,OAAS,WAAAC,GAAS,OAAAC,OAAW,OAC7B,OAAS,iBAAAC,OAAqB,MAG9B,IAAMC,GAAS,IAAc,CAC3B,GAAI,CACF,OAAO,KAAK,UACV,KAAK,MAAMC,GAAa,iBAAkB,MAAM,CAAC,CAAC,CAGtD,MAAQ,CACN,MAAO,MACT,CAAC,EAGCC,GAAqB,OAEZC,GAA2B,CACtC,WAAY,GACZ,cAAe,GACf,uBAAwB,GACxB,QAASC,GAAQ,CACf,IAAMC,EAAIC,GAAQF,CAAI,EAGtB,MAFI,GAAAC,IAAME,IACNF,IAAMG,IACNH,EAAE,WAAWG,GAAQC,EAAG,EAChB,GAIHF,GAAQD,GAAQ,oBAAoB,EACpCE,GAAQF,GAAQ,oBAAoB,EACpCI,GAAMJ,GAAQ,OAAO,EACrBK,GAASL,GAAQ,gBAAgB,EACjCM,GAAU,CAACF,GAAKC,EAAM,EACtBE,GAAMC,GAAc,IAAI,IAAI,aAAc,YAAY,GAAG,CAAC,EAEvEC,GAAe,IAAM,CACnB,IAAIC,EAAW,GACXC,EAAc,GACZC,EAAUC,GAAMP,GAAST,EAAO,EAChCiB,EAAQ,IAAM,CAClBJ,EAAW,GACXC,EAAc,GACAI,GAAM,QAAQ,SAAU,CAACR,EAAG,EAAG,CAAE,MAAO,SAAS,CAAE,EAC3D,GAAG,QAAS,CAACS,EAAMC,IAAW,CAC9BD,GAAQC,GACEC,EAAMC,EAAM,IAAI,eAAe,EAAG,CAC5C,KAAAH,EACA,OAAAC,EACD,EACWG,GAAK,GAEjB,QAAQ,IAAID,EAAM,MAAM,eAAe,EAAG,CAAE,KAAAH,EAAM,OAAAC,CAAM,CAAE,EAExDN,EAAaG,EAAK,EACjBJ,EAAW,EAAK,CACtB,CAAC,EAEJE,EAAQ,GAAG,MAAO,CAACS,EAAIvB,IAAS,CAE9B,GAAIuB,IAAO,UAAYvB,IAASM,GAC9B,OAGF,IAAML,EAAIC,GAAQF,CAAI,EACtB,GAAIC,IAAME,GACV,IAAIF,IAAMM,GAAQ,CAEhB,IAAMiB,EAAU5B,GAAM,EAEtB,GAAI4B,IAAY1B,GAAY,OAC5BA,GAAa0B,CACf,CACA,GAAIZ,EAAU,CACRX,IAAMM,KAAQM,EAAc,IAChC,MACF,CACYY,EAAMJ,EAAM,KAAK,IAAIE,CAAE,EAAGvB,CAAI,EAC1CgB,EAAK,EAAE,CACR,EACDlB,GAAaF,GAAM,EACnBoB,EAAK,CAAE,EI9ET,GAAM,CAAE,QAASU,GAAK,KAAAC,EAAI,EAAKC,EAEzBC,GAAO,SAAY,CACvB,QAAWC,KAAO,QAAQ,KAAK,MAAM,CAAC,EACpC,OAAQA,EAAK,CACX,IAAK,SACL,IAAK,KACH,OAAOC,GAAK,EACd,IAAK,UACL,IAAK,KACH,OAAOC,GAAK,EACd,QACE,OAAOD,GAAM,qBAAqBD,CAAG,EAAE,CAC3C,CAGWG,EAAMC,EAAM,OAAO,KAAK,UAAU,EAAG,QAAQ,IAAG,CAAE,EAClDD,EAAMC,EAAM,KAAK,IAAI,aAAa,EAAGP,EAAI,EACzCM,EAAMC,EAAM,KAAK,IAAI,SAAS,EAAGR,EAAG,EAEjD,MAAMS,GAAK,EAEEC,GAAIF,EAAM,KAAK,MAAM,UAAU,CAAC,CAAC,EAEhD,MAAML,GAAI",
  "names": ["wrapAnsi16", "offset", "code", "wrapAnsi256", "wrapAnsi16m", "red", "green", "blue", "styles", "modifierNames", "foregroundColorNames", "backgroundColorNames", "colorNames", "assembleStyles", "codes", "groupName", "group", "styleName", "style", "hex", "matches", "colorString", "character", "integer", "remainder", "value", "result", "ansiStyles", "ansi_styles_default", "process", "os", "tty", "hasFlag", "flag", "argv", "prefix", "position", "terminatorPosition", "env", "flagForceColor", "envForceColor", "translateLevel", "level", "_supportsColor", "haveStream", "streamIsTTY", "sniffFlags", "noFlagForceColor", "forceColor", "min", "osRelease", "key", "sign", "version", "createSupportsColor", "stream", "options", "supportsColor", "supports_color_default", "stringReplaceAll", "string", "substring", "replacer", "index", "substringLength", "endIndex", "returnValue", "stringEncaseCRLFWithFirstIndex", "prefix", "postfix", "gotCR", "stdoutColor", "stderrColor", "supports_color_default", "GENERATOR", "STYLER", "IS_EMPTY", "levelMapping", "styles", "applyOptions", "object", "options", "colorLevel", "chalkFactory", "options", "chalk", "strings", "applyOptions", "createChalk", "styleName", "style", "ansi_styles_default", "styles", "builder", "createBuilder", "createStyler", "STYLER", "IS_EMPTY", "getModelAnsi", "model", "level", "type", "arguments_", "usedModels", "styler", "levelMapping", "bgModel", "proto", "GENERATOR", "open", "close", "parent", "openAll", "closeAll", "self", "_styler", "_isEmpty", "applyStyle", "string", "stringReplaceAll", "lfIndex", "stringEncaseCRLFWithFirstIndex", "chalkStderr", "stderrColor", "source_default", "chalk", "balanced", "a", "b", "str", "ma", "maybeMatch", "mb", "r", "range", "reg", "m", "begs", "beg", "left", "right", "result", "ai", "bi", "i", "escSlash", "escOpen", "escClose", "escComma", "escPeriod", "escSlashPattern", "escOpenPattern", "escClosePattern", "escCommaPattern", "escPeriodPattern", "slashPattern", "openPattern", "closePattern", "commaPattern", "periodPattern", "EXPANSION_MAX", "numeric", "str", "escapeBraces", "unescapeBraces", "parseCommaParts", "parts", "m", "balanced", "pre", "body", "post", "p", "postParts", "expand", "options", "max", "expand_", "embrace", "isPadded", "el", "lte", "i", "y", "gte", "isTop", "expansions", "k", "expansion", "isNumericSequence", "isAlphaSequence", "isSequence", "isOptions", "n", "N", "x", "width", "incr", "test", "pad", "c", "need", "z", "j", "assertValidPattern", "pattern", "posixClasses", "braceEscape", "s", "regexpEscape", "rangesToString", "ranges", "parseClass", "glob", "position", "pos", "negs", "i", "sawStart", "uflag", "escaping", "negate", "endPos", "rangeStart", "WHILE", "c", "cls", "unip", "u", "neg", "r", "sranges", "snegs", "unescape", "s", "windowsPathsNoEscape", "magicalBraces", "types", "isExtglobType", "c", "startNoTraversal", "startNoDot", "addPatternStart", "justDots", "reSpecials", "regExpEscape", "s", "qmark", "star", "starNoEmpty", "AST", "_AST", "#root", "#hasMagic", "#uflag", "#parts", "#parent", "#parentIndex", "#negs", "#filledNegs", "#options", "#toString", "#emptyExt", "type", "parent", "options", "p", "#fillNegs", "n", "pp", "i", "part", "parts", "ret", "pl", "#parseAST", "str", "ast", "pos", "opt", "escaping", "inBrace", "braceStart", "braceNeg", "acc", "ext", "pattern", "glob", "re", "body", "hasMagic", "uflag", "flags", "allowDot", "dot", "noEmpty", "src", "_", "#parseGlob", "start", "aps", "needNoTrav", "needNoDot", "end", "unescape", "repeated", "#partsToRegExp", "bodyDotAllowed", "final", "close", "_hasMagic", "inStar", "needUflag", "consumed", "magic", "parseClass", "escape", "s", "windowsPathsNoEscape", "magicalBraces", "minimatch", "p", "pattern", "options", "assertValidPattern", "Minimatch", "starDotExtRE", "starDotExtTest", "ext", "f", "starDotExtTestDot", "starDotExtTestNocase", "starDotExtTestNocaseDot", "starDotStarRE", "starDotStarTest", "starDotStarTestDot", "dotStarRE", "dotStarTest", "starRE", "starTest", "starTestDot", "qmarksRE", "qmarksTestNocase", "$0", "noext", "qmarksTestNoExt", "qmarksTestNocaseDot", "qmarksTestNoExtDot", "qmarksTestDot", "qmarksTest", "len", "defaultPlatform", "path", "sep", "GLOBSTAR", "qmark", "star", "twoStarDot", "twoStarNoDot", "filter", "a", "b", "defaults", "def", "orig", "type", "parent", "s", "list", "braceExpand", "expand", "makeRe", "match", "mm", "globMagic", "regExpEscape", "awe", "part", "_", "args", "rawGlobParts", "set", "__", "isUNC", "isDrive", "ss", "i", "globParts", "j", "optimizationLevel", "parts", "gs", "prev", "didSomething", "dd", "gss", "next", "p2", "other", "splin", "matched", "emptyGSMatch", "ai", "bi", "result", "which", "negate", "negateOffset", "file", "partial", "fileDrive", "fileUNC", "patternDrive", "patternUNC", "fdi", "pdi", "fd", "pd", "fi", "pi", "fl", "pl", "fr", "pr", "swallowee", "hit", "m", "fastTest", "re", "AST", "twoStar", "flags", "pp", "filtered", "prefixes", "open", "close", "ff", "filename", "escape", "unescape", "verbose", "errors", "error", "a", "debug", "log", "print", "fail_default", "message", "er", "error", "source_default", "print", "readFileSync", "hexify", "s", "c", "parseError", "txt", "context", "badToken", "atPos", "errIdx", "msg", "start", "end", "slice", "JSONParseError", "er", "caller", "message", "position", "_", "kIndent", "kNewline", "formatRE", "emptyRE", "parse", "reviver", "parseText", "stripBOM", "newline", "indent", "result", "e", "isEmptyArray", "stripBOM", "txt", "stringify", "obj", "replacer", "indent", "space", "kIndent", "res", "nl", "kNewline", "isPackage", "pkg", "readPkg", "res", "parse", "readFileSync", "stringify", "er", "fail_default", "package_default", "readdirSync", "join", "getSources", "dir", "sources", "entries", "e", "j", "sources_default", "isDialect", "d", "valid_dialects_default", "fail_default", "valid_exclude_default", "d", "fail_default", "join", "add_dot_default", "s", "join", "resolveExport", "exp", "conditions", "e", "u", "conds", "c", "valid_external_export_default", "exp", "i", "resolveExport", "r", "join", "valid_exports_default", "sub", "exp", "fail_default", "add_dot_default", "valid_external_export_default", "arrayOverlap", "a", "b", "av", "validExtraDialectSet", "which", "d", "fail_default", "valid_extra_dialects_default", "commonjsDialects", "esmDialects", "sourceDialects", "aname", "bname", "overlap", "valid_imports_default", "pkg", "imports", "fail_default", "i", "v", "valid_external_export_default", "resolve", "readFileSync", "valid_project_default", "p", "readFileSync", "resolve", "fail_default", "valid_compiler_default", "compiler", "validBoolean", "name", "v", "fail_default", "isStringArray", "e", "validConfig", "valid_exports_default", "valid_dialects_default", "valid_project_default", "valid_exclude_default", "valid_extra_dialects_default", "valid_compiler_default", "match", "pattern", "m", "parsePattern", "p", "Minimatch", "getConfig", "pkg", "sources", "tshy", "exportsConfig", "exp", "sp", "error", "config", "ti", "debug", "source_default", "valid_imports_default", "i", "package_default", "sources_default", "config_default", "fileURLToPath", "posix", "win32", "lstatSync", "readdirCB", "readdirSync", "readlinkSync", "rps", "actualFS", "lstat", "readdir", "readlink", "realpath", "EventEmitter", "Stream", "StringDecoder", "balanced", "a", "b", "str", "ma", "maybeMatch", "mb", "r", "range", "reg", "m", "begs", "beg", "left", "right", "result", "ai", "bi", "i", "escSlash", "escOpen", "escClose", "escComma", "escPeriod", "escSlashPattern", "escOpenPattern", "escClosePattern", "escCommaPattern", "escPeriodPattern", "slashPattern", "openPattern", "closePattern", "commaPattern", "periodPattern", "EXPANSION_MAX", "numeric", "escapeBraces", "unescapeBraces", "parseCommaParts", "parts", "pre", "body", "post", "p", "postParts", "expand", "options", "max", "expand_", "embrace", "isPadded", "el", "lte", "y", "gte", "isTop", "expansions", "k", "expansion", "isNumericSequence", "isAlphaSequence", "isSequence", "isOptions", "n", "N", "x", "width", "incr", "test", "pad", "c", "need", "z", "j", "assertValidPattern", "pattern", "posixClasses", "braceEscape", "s", "regexpEscape", "rangesToString", "ranges", "parseClass", "glob", "position", "pos", "negs", "sawStart", "uflag", "escaping", "negate", "endPos", "rangeStart", "WHILE", "cls", "unip", "u", "neg", "sranges", "snegs", "unescape", "windowsPathsNoEscape", "magicalBraces", "types", "isExtglobType", "startNoTraversal", "startNoDot", "addPatternStart", "justDots", "reSpecials", "regExpEscape", "qmark", "star", "starNoEmpty", "AST", "_AST", "#root", "#hasMagic", "#uflag", "#parts", "#parent", "#parentIndex", "#negs", "#filledNegs", "#options", "#toString", "#emptyExt", "type", "parent", "#fillNegs", "pp", "part", "ret", "pl", "#parseAST", "ast", "opt", "inBrace", "braceStart", "braceNeg", "acc", "ext", "re", "hasMagic", "flags", "allowDot", "dot", "noEmpty", "src", "_", "#parseGlob", "start", "aps", "needNoTrav", "needNoDot", "end", "repeated", "#partsToRegExp", "bodyDotAllowed", "final", "close", "_hasMagic", "inStar", "needUflag", "consumed", "magic", "escape", "minimatch", "Minimatch", "starDotExtRE", "starDotExtTest", "f", "starDotExtTestDot", "starDotExtTestNocase", "starDotExtTestNocaseDot", "starDotStarRE", "starDotStarTest", "starDotStarTestDot", "dotStarRE", "dotStarTest", "starRE", "starTest", "starTestDot", "qmarksRE", "qmarksTestNocase", "$0", "noext", "qmarksTestNoExt", "qmarksTestNocaseDot", "qmarksTestNoExtDot", "qmarksTestDot", "qmarksTest", "len", "defaultPlatform", "path", "sep", "GLOBSTAR", "twoStarDot", "twoStarNoDot", "filter", "defaults", "def", "orig", "list", "braceExpand", "makeRe", "match", "mm", "globMagic", "awe", "args", "rawGlobParts", "set", "__", "isUNC", "isDrive", "ss", "globParts", "optimizationLevel", "gs", "prev", "didSomething", "dd", "gss", "next", "p2", "other", "splin", "matched", "emptyGSMatch", "which", "negateOffset", "file", "partial", "fileDrive", "fileUNC", "patternDrive", "patternUNC", "fdi", "pdi", "fd", "pd", "fi", "pi", "fl", "fr", "pr", "swallowee", "hit", "fastTest", "twoStar", "filtered", "prefixes", "open", "ff", "filename", "defaultPerf", "warned", "PROCESS", "emitWarning", "msg", "code", "fn", "AC", "AS", "warnACPolyfill", "reason", "printACPolyfillWarning", "shouldWarn", "isPosInt", "getUintArray", "ZeroArray", "size", "Stack", "_Stack", "#constructing", "HeapCls", "LRUCache", "_LRUCache", "#max", "#maxSize", "#dispose", "#onInsert", "#disposeAfter", "#fetchMethod", "#memoMethod", "#perf", "#size", "#calculatedSize", "#keyMap", "#keyList", "#valList", "#next", "#prev", "#head", "#tail", "#free", "#disposed", "#sizes", "#starts", "#ttls", "#autopurgeTimers", "#hasDispose", "#hasFetchMethod", "#hasDisposeAfter", "#hasOnInsert", "#isBackgroundFetch", "index", "context", "#backgroundFetch", "#moveToTail", "#indexes", "#rindexes", "#isStale", "ttl", "ttlResolution", "ttlAutopurge", "updateAgeOnGet", "updateAgeOnHas", "allowStale", "dispose", "onInsert", "disposeAfter", "noDisposeOnSet", "noUpdateTTL", "maxSize", "maxEntrySize", "sizeCalculation", "fetchMethod", "memoMethod", "noDeleteOnFetchRejection", "noDeleteOnStaleGet", "allowStaleOnFetchRejection", "allowStaleOnFetchAbort", "ignoreFetchAbort", "perf", "UintArray", "#initializeSizeTracking", "#initializeTTLTracking", "key", "ttls", "starts", "purgeTimers", "#setItemTTL", "t", "#delete", "#updateItemAge", "#statusTTL", "status", "cachedNow", "getNow", "age", "sizes", "#removeItemSize", "#requireSize", "v", "#addItemSize", "#evict", "_i", "_s", "_st", "_k", "_v", "#isValidIndex", "getOptions", "value", "thisp", "deleted", "entry", "remain", "arr", "setOptions", "oldVal", "oldValue", "dt", "task", "val", "free", "head", "hasOptions", "peekOptions", "ac", "signal", "fetchOpts", "cb", "updateCache", "aborted", "ignoreAbort", "proceed", "fetchFail", "bf", "vl", "eb", "er", "allowStaleAborted", "noDelete", "pcall", "res", "rej", "fmp", "fetchOptions", "forceRefresh", "stale", "isStale", "staleVal", "memoOptions", "vv", "fetching", "#connect", "#clear", "ni", "proc", "isStream", "Minipass", "isReadable", "isWritable", "EOF", "MAYBE_EMIT_END", "EMITTED_END", "EMITTING_END", "EMITTED_ERROR", "CLOSED", "READ", "FLUSH", "FLUSHCHUNK", "ENCODING", "DECODER", "FLOWING", "PAUSED", "RESUME", "BUFFER", "PIPES", "BUFFERLENGTH", "BUFFERPUSH", "BUFFERSHIFT", "OBJECTMODE", "DESTROYED", "ERROR", "EMITDATA", "EMITEND", "EMITEND2", "ASYNC", "ABORT", "ABORTED", "SIGNAL", "DATALISTENERS", "DISCARDED", "defer", "nodefer", "isEndish", "ev", "isArrayBufferLike", "isArrayBufferView", "Pipe", "dest", "opts", "_er", "PipeProxyErrors", "isObjectModeOptions", "o", "isEncodingOptions", "_enc", "_om", "chunk", "encoding", "noDrain", "ended", "handler", "h", "data", "buf", "resolve", "reject", "stopped", "stop", "onerr", "ondata", "onend", "ondestroy", "wc", "realpathSync", "defaultFS", "fsFromOption", "fsOption", "uncDriveRegexp", "uncToDrive", "rootPath", "eitherSep", "UNKNOWN", "IFIFO", "IFCHR", "IFDIR", "IFBLK", "IFREG", "IFLNK", "IFSOCK", "IFMT", "IFMT_UNKNOWN", "READDIR_CALLED", "LSTAT_CALLED", "ENOTDIR", "ENOENT", "ENOREADLINK", "ENOREALPATH", "ENOCHILD", "TYPEMASK", "entToType", "normalizeCache", "L", "normalize", "normalizeNocaseCache", "normalizeNocase", "ResolveCache", "ChildrenCache", "setAsCwd", "PathBase", "#fs", "#dev", "#mode", "#nlink", "#uid", "#gid", "#rdev", "#blksize", "#ino", "#blocks", "#atimeMs", "#mtimeMs", "#ctimeMs", "#birthtimeMs", "#atime", "#mtime", "#ctime", "#birthtime", "#matchName", "#depth", "#fullpath", "#fullpathPosix", "#relative", "#relativePosix", "#type", "#children", "#linkTarget", "#realpath", "name", "root", "roots", "nocase", "children", "dirParts", "#resolveParts", "cached", "pathPart", "fullpath", "pchild", "pv", "fp", "pfpp", "fpp", "ifmt", "target", "read", "linkTarget", "#readlinkFail", "#readdirSuccess", "#markENOENT", "#markChildrenENOENT", "#markENOREALPATH", "#markENOTDIR", "#readdirFail", "#lstatFail", "ter", "#readdirAddChild", "e", "#readdirMaybePromoteChild", "#readdirAddNewChild", "child", "#readdirPromoteChild", "#applyStat", "st", "atime", "atimeMs", "birthtime", "birthtimeMs", "blksize", "blocks", "ctime", "ctimeMs", "dev", "gid", "ino", "mode", "mtime", "mtimeMs", "nlink", "rdev", "uid", "#onReaddirCB", "#readdirCBInFlight", "#callOnReaddirCB", "cbs", "allowZalgo", "entries", "#asyncReaddirInFlight", "dirs", "walkFilter", "rp", "oldCwd", "changed", "PathWin32", "_PathWin32", "compare", "PathScurryWin32", "PathPosix", "_PathPosix", "_rootPath", "PathScurryBase", "#resolveCache", "#resolvePosixCache", "cwd", "pathImpl", "childrenCacheSize", "fs", "cwdPath", "split", "joinSep", "abs", "sawFirst", "l", "paths", "withFileTypes", "follow", "results", "walk", "dir", "queue", "processing", "process", "paused", "onReaddir", "didRealpaths", "promises", "sync", "PathScurryPosix", "_dir", "PathScurryDarwin", "Path", "PathScurry", "isPatternList", "isGlobList", "gl", "customInspect", "Pattern", "_Pattern", "#patternList", "#globList", "#index", "#platform", "#rest", "#globString", "#isDrive", "#isUNC", "#isAbsolute", "#followGlobstar", "patternList", "globList", "platform", "p0", "p1", "p3", "prest", "g0", "g1", "g2", "g3", "grest", "g", "Ignore", "ignored", "nobrace", "noglobstar", "ign", "parsed", "absolute", "fullpaths", "relative", "relatives", "HasWalkedCache", "_HasWalkedCache", "store", "MatchRecord", "ifDir", "current", "SubWalks", "subs", "Processor", "_Processor", "hasWalkedCache", "patterns", "processingSet", "rest", "rrest", "tp", "ep", "makeIgnore", "ignore", "GlobUtil", "#onResume", "#ignore", "#sep", "#ignored", "#childrenIgnored", "rpc", "mark", "rel", "processor", "tasks", "childrenCached", "GlobWalker", "GlobStream", "Glob", "Scurry", "nocaseMagicOnly", "mmo", "mms", "matchSet", "globStreamSync", "globStream", "globSync", "glob_", "globIterateSync", "globIterate", "streamSync", "stream", "iterateSync", "iterate", "dirname", "mkdir", "mkdirSync", "stat", "statSync", "optsArg", "opts", "resolved", "optsFs", "path", "options", "res", "rej", "er", "made", "err", "stats", "mkdirpManualSync", "path", "options", "made", "parent", "dirname", "opts", "optsArg", "er", "fer", "mkdirpManual", "st", "dirname", "dirname", "findMade", "opts", "parent", "path", "st", "er", "fer", "findMadeSync", "mkdirpNativeSync", "path", "options", "opts", "optsArg", "dirname", "made", "findMadeSync", "er", "fer", "mkdirpManualSync", "mkdirpNative", "findMade", "m", "mkdirpManual", "parse", "resolve", "platform", "pathArg", "path", "badWinChars", "root", "mkdir", "mkdirSync", "version", "versArr", "hasNative", "useNativeSync", "opts", "optsArg", "mkdirSync", "useNative", "mkdir", "mkdirpSync", "path", "opts", "pathArg", "resolved", "optsArg", "useNativeSync", "mkdirpNativeSync", "mkdirpManualSync", "mkdirp", "path", "opts", "pathArg", "resolved", "optsArg", "useNative", "mkdirpNative", "mkdirpManual", "mkdirpSync", "mkdirpNativeSync", "mkdirpManualSync", "useNativeSync", "constants", "createHash", "chmodSync", "copyFileSync", "linkSync", "readFileSync", "readlinkSync", "symlinkSync", "unlinkSync", "dirname", "relative", "resolve", "sep", "defaultPerf", "warned", "PROCESS", "emitWarning", "msg", "type", "code", "fn", "AC", "AS", "_", "warnACPolyfill", "reason", "printACPolyfillWarning", "shouldWarn", "isPosInt", "n", "getUintArray", "max", "ZeroArray", "size", "Stack", "_Stack", "#constructing", "HeapCls", "s", "LRUCache", "_LRUCache", "#max", "#maxSize", "#dispose", "#onInsert", "#disposeAfter", "#fetchMethod", "#memoMethod", "#perf", "#size", "#calculatedSize", "#keyMap", "#keyList", "#valList", "#next", "#prev", "#head", "#tail", "#free", "#disposed", "#sizes", "#starts", "#ttls", "#autopurgeTimers", "#hasDispose", "#hasFetchMethod", "#hasDisposeAfter", "#hasOnInsert", "c", "p", "#isBackgroundFetch", "k", "index", "options", "context", "#backgroundFetch", "#moveToTail", "#indexes", "#rindexes", "#isStale", "ttl", "ttlResolution", "ttlAutopurge", "updateAgeOnGet", "updateAgeOnHas", "allowStale", "dispose", "onInsert", "disposeAfter", "noDisposeOnSet", "noUpdateTTL", "maxSize", "maxEntrySize", "sizeCalculation", "fetchMethod", "memoMethod", "noDeleteOnFetchRejection", "noDeleteOnStaleGet", "allowStaleOnFetchRejection", "allowStaleOnFetchAbort", "ignoreFetchAbort", "perf", "defaultPerf", "UintArray", "#initializeSizeTracking", "#initializeTTLTracking", "code", "shouldWarn", "warned", "emitWarning", "key", "ttls", "starts", "purgeTimers", "#setItemTTL", "start", "t", "#delete", "#updateItemAge", "#statusTTL", "status", "cachedNow", "getNow", "age", "sizes", "#removeItemSize", "#requireSize", "v", "#addItemSize", "#evict", "_i", "_s", "_st", "_k", "_v", "i", "#isValidIndex", "fn", "getOptions", "value", "thisp", "deleted", "entry", "remain", "arr", "setOptions", "oldVal", "oldValue", "dt", "task", "val", "free", "head", "hasOptions", "peekOptions", "ac", "AC", "signal", "fetchOpts", "cb", "updateCache", "aborted", "ignoreAbort", "proceed", "fetchFail", "bf", "vl", "eb", "er", "allowStaleAborted", "noDelete", "pcall", "res", "rej", "fmp", "b", "fetchOptions", "forceRefresh", "stale", "isStale", "staleVal", "memoOptions", "vv", "fetching", "#connect", "reason", "#clear", "pi", "ni", "posix", "win32", "fileURLToPath", "lstatSync", "readdirCB", "readdirSync", "readlinkSync", "rps", "actualFS", "lstat", "readdir", "readlink", "realpath", "EventEmitter", "Stream", "StringDecoder", "proc", "isStream", "s", "Minipass", "isReadable", "isWritable", "EOF", "MAYBE_EMIT_END", "EMITTED_END", "EMITTING_END", "EMITTED_ERROR", "CLOSED", "READ", "FLUSH", "FLUSHCHUNK", "ENCODING", "DECODER", "FLOWING", "PAUSED", "RESUME", "BUFFER", "PIPES", "BUFFERLENGTH", "BUFFERPUSH", "BUFFERSHIFT", "OBJECTMODE", "DESTROYED", "ERROR", "EMITDATA", "EMITEND", "EMITEND2", "ASYNC", "ABORT", "ABORTED", "SIGNAL", "DATALISTENERS", "DISCARDED", "defer", "fn", "nodefer", "isEndish", "ev", "isArrayBufferLike", "b", "isArrayBufferView", "Pipe", "src", "dest", "opts", "_er", "PipeProxyErrors", "er", "isObjectModeOptions", "o", "isEncodingOptions", "args", "options", "signal", "_enc", "_om", "a", "_", "chunk", "encoding", "cb", "n", "ret", "c", "noDrain", "ended", "p", "handler", "h", "data", "buf", "resolve", "reject", "stopped", "stop", "res", "onerr", "ondata", "onend", "ondestroy", "value", "rej", "next", "wc", "realpathSync", "rps", "defaultFS", "lstatSync", "readdirCB", "readdirSync", "readlinkSync", "lstat", "readdir", "readlink", "realpath", "fsFromOption", "fsOption", "actualFS", "uncDriveRegexp", "uncToDrive", "rootPath", "eitherSep", "UNKNOWN", "IFIFO", "IFCHR", "IFDIR", "IFBLK", "IFREG", "IFLNK", "IFSOCK", "IFMT", "IFMT_UNKNOWN", "READDIR_CALLED", "LSTAT_CALLED", "ENOTDIR", "ENOENT", "ENOREADLINK", "ENOREALPATH", "ENOCHILD", "TYPEMASK", "entToType", "s", "normalizeCache", "L", "normalize", "c", "n", "normalizeNocaseCache", "normalizeNocase", "ResolveCache", "ChildrenCache", "maxSize", "a", "setAsCwd", "PathBase", "#fs", "#dev", "#mode", "#nlink", "#uid", "#gid", "#rdev", "#blksize", "#ino", "#size", "#blocks", "#atimeMs", "#mtimeMs", "#ctimeMs", "#birthtimeMs", "#atime", "#mtime", "#ctime", "#birthtime", "#matchName", "#depth", "#fullpath", "#fullpathPosix", "#relative", "#relativePosix", "#type", "#children", "#linkTarget", "#realpath", "name", "type", "root", "roots", "nocase", "children", "opts", "path", "dirParts", "#resolveParts", "p", "part", "cached", "pathPart", "fullpath", "pchild", "pv", "fp", "pfpp", "fpp", "ifmt", "target", "read", "linkTarget", "er", "#readlinkFail", "#readdirSuccess", "#markENOENT", "#markChildrenENOENT", "#markENOREALPATH", "#markENOTDIR", "#readdirFail", "code", "#lstatFail", "ter", "#readdirAddChild", "e", "#readdirMaybePromoteChild", "#readdirAddNewChild", "child", "#readdirPromoteChild", "index", "v", "#applyStat", "st", "atime", "atimeMs", "birthtime", "birthtimeMs", "blksize", "blocks", "ctime", "ctimeMs", "dev", "gid", "ino", "mode", "mtime", "mtimeMs", "nlink", "rdev", "size", "uid", "#onReaddirCB", "#readdirCBInFlight", "#callOnReaddirCB", "cbs", "cb", "allowZalgo", "entries", "#asyncReaddirInFlight", "resolve", "res", "dirs", "walkFilter", "rp", "oldCwd", "changed", "PathWin32", "_PathWin32", "win32", "compare", "PathScurryWin32", "PathPosix", "_PathPosix", "_rootPath", "PathScurryBase", "#resolveCache", "#resolvePosixCache", "cwd", "pathImpl", "sep", "childrenCacheSize", "fs", "fileURLToPath", "cwdPath", "split", "prev", "len", "joinSep", "abs", "sawFirst", "l", "paths", "r", "i", "result", "entry", "withFileTypes", "follow", "filter", "results", "walk", "dir", "next", "start", "rej", "options", "Minipass", "queue", "processing", "process", "paused", "onReaddir", "didRealpaths", "promises", "sync", "PathScurryPosix", "posix", "_dir", "PathScurryDarwin", "Path", "PathScurry", "typeOrUndef", "val", "isRimrafOptions", "o", "assertRimrafOptions", "optArgT", "opt", "glob", "options", "globOpt", "optArg", "optArgSync", "parse", "resolve", "inspect", "pathArg", "path", "opt", "type", "ctor", "msg", "root", "badWinChars", "path_arg_default", "rdSync", "fsPromises", "chmodSync", "mkdirSync", "renameSync", "rmdirSync", "rmSync", "statSync", "lstatSync", "unlinkSync", "readdirSync", "path", "promises", "parse", "resolve", "readdir", "promises", "readdirOrError", "path", "er", "readdirOrErrorSync", "readdirSync", "isRecord", "o", "hasString", "key", "isFsError", "errorCode", "er", "ignoreENOENT", "p", "rethrow", "er", "errorCode", "ignoreENOENTSync", "fn", "lstat", "rmdir", "unlink", "promises", "rimrafPosix", "path", "opt", "ignoreENOENT", "stat", "rimrafPosixDir", "rimrafPosixSync", "ignoreENOENTSync", "rimrafPosixDirSync", "lstatSync", "ent", "entries", "readdirOrError", "errorCode", "resolve", "v", "parse", "readdirOrErrorSync", "unlinkSync", "removedAll", "p", "rmdirSync", "parse", "resolve", "chmod", "promises", "fixEPERM", "fn", "path", "ignoreENOENT", "er", "errorCode", "fixEPERMSync", "ignoreENOENTSync", "chmodSync", "setTimeout", "MAXBACKOFF", "RATE", "MAXRETRIES", "codes", "retryBusy", "fn", "method", "path", "opt", "backoff", "total", "mbo", "rate", "max", "retries", "er", "isFsError", "setTimeout", "retryBusySync", "basename", "parse", "resolve", "tmpdir", "parse", "resolve", "stat", "promises", "isDirSync", "path", "statSync", "isDir", "st", "win32DefaultTmp", "root", "parse", "tmp", "tmpdir", "tmpRoot", "driveTmp", "resolve", "win32DefaultTmpSync", "posixDefaultTmp", "posixDefaultTmpSync", "defaultTmp", "defaultTmpSync", "lstat", "rename", "unlink", "rmdir", "promises", "uniqueFilename", "path", "basename", "unlinkFixEPERM", "fixEPERM", "unlinkFixEPERMSync", "fixEPERMSync", "unlinkSync", "rimrafMoveRemove", "opt", "ignoreENOENT", "stat", "rimrafMoveRemoveDir", "ent", "defaultTmp", "parse", "entries", "readdirOrError", "errorCode", "tmpUnlink", "resolve", "v", "tmp", "rm", "tmpFile", "rimrafMoveRemoveSync", "ignoreENOENTSync", "rimrafMoveRemoveDirSync", "lstatSync", "defaultTmpSync", "readdirOrErrorSync", "tmpUnlinkSync", "removedAll", "p", "rmdirSync", "rmSync", "renameSync", "unlink", "rmdir", "lstat", "promises", "rimrafWindowsFile", "retryBusy", "fixEPERM", "rimrafWindowsFileSync", "retryBusySync", "fixEPERMSync", "unlinkSync", "rimrafWindowsDirRetry", "rimrafWindowsDirRetrySync", "rmdirSync", "rimrafWindowsDirMoveRemoveFallback", "path", "filter", "opt", "er", "errorCode", "rimrafMoveRemove", "rimrafWindowsDirMoveRemoveFallbackSync", "rimrafMoveRemoveSync", "START", "CHILD", "FINISH", "rimrafWindows", "ignoreENOENT", "stat", "rimrafWindowsDir", "rimrafWindowsSync", "ignoreENOENTSync", "rimrafWindowsDirSync", "lstatSync", "ent", "state", "entries", "readdirOrError", "s", "removedAll", "resolve", "v", "parse", "readdirOrErrorSync", "p", "rimrafManual", "rimrafWindows", "rimrafPosix", "rimrafManualSync", "rimrafWindowsSync", "rimrafPosixSync", "rm", "promises", "rimrafNative", "path", "opt", "rimrafNativeSync", "rmSync", "major", "minor", "v", "hasNative", "useNative", "opt", "useNativeSync", "wrap", "fn", "path", "opt", "options", "optArg", "Ze", "p", "path_arg_default", "a", "b", "wrapSync", "optArgSync", "ts", "nativeSync", "rimrafNativeSync", "native", "rimrafNative", "manualSync", "rimrafManualSync", "manual", "rimrafManual", "windowsSync", "rimrafWindowsSync", "windows", "rimrafWindows", "posixSync", "rimrafPosixSync", "posix", "rimrafPosix", "moveRemoveSync", "rimrafMoveRemoveSync", "moveRemove", "rimrafMoveRemove", "rimrafSync", "useNativeSync", "rimraf_", "wrap", "path", "opt", "useNative", "rimrafNative", "rimrafManual", "rimraf", "rimrafSync", "manual", "manualSync", "native", "nativeSync", "posix", "posixSync", "windows", "windowsSync", "moveRemove", "moveRemoveSync", "mkdirpClobberSync", "dir", "mkdirpSync", "dirname", "rimrafSync", "syncFileSync", "src", "dest", "rimrafSync", "target", "readlinkSync", "mkdirpClobberSync", "dirname", "symlinkSync", "constants", "chmodSync", "write", "contentMatchSync", "linkSync", "copyFileSync", "mode", "contentMatchSync", "src", "dest", "createHash", "readFileSync", "dots", "sep", "dirsRelated", "a", "b", "relab", "relative", "relba", "syncContentSync", "from", "to", "scurry", "PathScurry", "rfrom", "resolve", "rto", "dirname", "dirsRelated", "src", "dest", "ts", "s", "d", "parent", "mkdirpClobberSync", "syncFileSync", "rimrafSync", "unlinkSync", "chmodSync", "resolve", "bins_default", "bin", "package_default", "chmodSync", "resolve", "v", "spawnSync", "relative", "resolve", "writeFileSync", "built_imports_default", "pkg", "imports", "k", "v", "writeDialectPJ", "d", "mode", "rimrafSync", "v", "built_imports_default", "package_default", "writeFileSync", "set_folder_dialect_default", "where", "debug", "source_default", "existsSync", "readdirSync", "unlinkSync", "writeFileSync", "resolve", "join", "esmDialects", "commonjsDialects", "config_default", "PolyfillSet", "type", "name", "f", "sources", "dotts", "ending", "ts", "tsx", "polyfills", "d", "sources_default", "pf", "debug", "source_default", "polyfills_default", "dirname", "isAbsolute", "resolve", "readFileSync", "statSync", "dirname", "resolve", "walkUp", "path", "pp", "detokenize", "token", "detokenize_default", "Context", "limit", "context_default", "copy", "q", "a", "b", "c", "next", "const", "_state", "depth", "capture", "_node", "v", "d", "x", "index", "f", "l", "group", "abort", "w", "ast", "g", "child", "r", "quantifier", "opts", "invert", "childOpts", "block", "sequence", "i", "body", "m", "char", "A", "let", "pattern", "length", "state", "stackIndex", "y", "quasiIndex", "isStickySupported", "match", "input", "_ref", "_ref2", "window", "match", "a", "b", "currentSequence", "capture", "l", "t", "k", "expression", "h", "quasi", "e", "g", "m", "char", "p", "z", "syntaxError", "n", "length", "_node", "parse", "len", "quasis", "Utils", "number", "value", "token", "tokens", "cache", "acc", "type", "transformer", "matcher", "match", "utils_default", "grammar", "tokens", "$", "utils_default", "EarlyReturn", "Insufficient", "Invalid", "Newline", "Whitespace", "CommentLine", "CommentBlock", "Trivia", "_Separated", "_Merged", "_", "Comma", "CommaTrailing", "Colon", "Null", "True", "False", "Boolean", "Number", "String", "ArrayOpen", "ArrayClose", "ArrayMember", "Literal", "ArrayMembers", "Array", "ObjectOpen", "ObjectClose", "ObjectMember", "ObjectMembers", "Object", "grammar_default", "makeChild", "type", "values", "source", "context_default", "makeParent", "children", "Tokens", "utils_default", "tokens_default", "Delete", "values", "context_default", "Passthrough", "source", "Unwrapped", "quasis", "token", "Tokens", "tokens_default", "parser", "parse", "grammar_default", "tokens_default", "parser_default", "strip", "text", "context_default", "parser_default", "strip_default", "_parse", "parse", "text", "reviver", "strip_default", "error", "textStripped", "parse_default", "parser", "parse", "grammar_default", "tokens_default", "parser_default", "tokenize", "text", "limit", "context_default", "parser_default", "tokenize_default", "getLookupToken", "ast", "position", "tokenPosition", "offsetCurrent", "checkPositionToken", "token", "utils_default", "parseChild", "parent", "depth", "index", "type", "source", "start", "end", "ltoken", "parseParent", "child", "parseToken", "getLookupPath", "path", "getLookupIsInsideProperty", "parentType", "getLookupIsInsideValue", "isParentEmpty", "getLookupProperty", "isInsideProperty", "parse_default", "detokenize_default", "getLookupValue", "isInsideValue", "usePartialScanning", "lookup", "text", "tokenize_default", "property", "value", "t", "lookup_default", "stringify_default", "validate", "text", "parse_default", "validate_default", "JSONC", "tokenize_default", "detokenize_default", "lookup_default", "parse_default", "stringify_default", "strip_default", "validate_default", "dist_default", "isFile", "f", "statSync", "parsedTsConfig", "read_typescript_config_default", "configPath", "config_default", "parseTsConfig", "resolveConfig", "target", "from", "isAbsolute", "local", "resolve", "p", "walkUp", "found", "pre", "foundTsconfig", "applyExtends", "data", "base", "key", "val", "seen", "dist_default", "readFileSync", "ext", "dirname", "e", "prevent_verbatim_module_syntax_default", "read_typescript_config_default", "fail_default", "error", "print", "dialects", "esmDialects", "commonjsDialects", "exclude", "config_default", "relativeExclude", "recommended", "build", "join", "read_typescript_config_default", "commonjs", "dialect", "d", "pf", "polyfills_default", "f", "esm", "mkdirpSync", "writeConfig", "name", "data", "writeFileSync", "debug", "source_default", "existsSync", "prevent_verbatim_module_syntax_default", "readdirSync", "unlinkSync", "resolve", "writeFileSync", "symlink", "dirname", "relative", "resolve", "sep", "getConditionalValuesList", "importsExports", "subs", "conditions", "k", "v", "getConditionalValuesListFromCond", "s", "isSubset", "maybeSub", "sup", "c", "cond", "path", "list", "p", "ps", "getAllConditionalValues", "importsExports", "getConditionalValuesList", "_", "__", "c", "getUniqueConditionSets", "importsExports", "list", "getConditionalValuesList", "results", "_", "conditions", "arr", "arrayIsEquivalent", "sup", "c", "dirname", "resolve", "pathToFileURL", "Module", "stat", "fileURLToPath", "toPath", "p", "fileExists", "f", "stat", "isWindows", "isRelativeRequire", "url", "isWindows", "realpath", "stat", "dirname", "resolve", "sep", "dirExists", "f", "stat", "findDepPackage", "pkgName", "parentPath", "dir", "walkUp", "dirname", "nm", "resolve", "sep", "ppath", "dirExists", "realpath", "readFile", "readJSON", "f", "readFile", "isExports", "isImports", "p", "isPkg", "o", "ifPkg", "readPkg", "f", "readJSON", "findStarMatch", "s", "obj", "patterns", "p", "a", "b", "key", "before", "after", "mid", "resolveConditionalValue", "exp", "options", "e", "conditions", "condition", "k", "v", "resolveExport", "sub", "exp", "pj", "from", "options", "s", "res", "resolveConditionalValue", "subpathNotExported", "es", "e", "sm", "findStarMatch", "key", "mid", "pathToFileURL", "toFileURL", "p", "fileURLToPath", "toPath", "p", "Module", "moduleName", "realpath", "Module", "basename", "dirname", "isAbsolute", "resolve", "fileURLToPath", "pathToFileURL", "resolve", "pathToFileURL", "resolveDependencyExports", "url", "parentPath", "options", "originalParent", "parts", "pkgName", "sub", "ppath", "findDepPackage", "packageNotFound", "indexjs", "resolve", "pj", "pkg", "readPkg", "subpath", "fileExists", "pathToFileURL", "moduleNotFound", "subPath", "resolveExport", "resolved", "rmain", "dirname", "resolve", "pathToFileURL", "resolvePackageImport", "url", "parentPath", "options", "originalParent", "parts", "invalidImportSpecifier", "dir", "walkUp", "dirname", "pj", "resolve", "pkg", "readPkg", "pkgName", "sub", "subPath", "resolveExport", "resolved", "fileExists", "pathToFileURL", "moduleNotFound", "packageImportNotDefined", "exact", "res", "resolveConditionalValue", "resolveDependencyExports", "resolveImport", "sm", "findStarMatch", "key", "mid", "match", "expand", "Module", "moduleName", "realpathParentDir", "path", "toPath", "resolve", "realpath", "dirname", "basename", "resolveImport", "url", "parentURL", "options", "fileExists", "moduleNotFound", "rp", "fileURLToPath", "pathToFileURL", "pu", "toFileURL", "isRelativeRequire", "relativeImportWithoutParentURL", "u", "isAbsolute", "parentPath", "opts", "resolvePackageImport", "resolveDependencyExports", "invalidImportSpecifier", "url", "caller", "resolveImport", "er", "invalidPackage", "pj", "relativeImportWithoutParentURL", "parentURL", "subpathNotExported", "sub", "from", "p", "packageNotFound", "path", "moduleNotFound", "packageImportNotDefined", "dirname", "resolve", "pathToFileURL", "getNamedExportsList", "exports", "isExportSubpaths", "e", "p", "resolve", "starGlob", "star", "dir", "pattern", "tt", "Ze", "match", "resolveAllExports", "packageJsonPath", "options", "pjPath", "toPath", "pjDir", "dirname", "pkg", "readPkg", "invalidPackage", "results", "exports", "sub", "getNamedExportsList", "res", "resolveExport", "sres", "ssub", "rep", "target", "starGlob", "pathToFileURL", "resolve", "resolveAllLocalImports", "packageJsonPath", "options", "pjPath", "toPath", "pjDir", "dirname", "pjURL", "toFileURL", "pkg", "readPkg", "invalidPackage", "results", "sub", "target", "getNamedImportsList", "parts", "name", "ssub", "starget", "resolveImport", "localPath", "rep", "starGlob", "pathToFileURL", "localName", "dep", "ppath", "findDepPackage", "pj", "resolve", "fileExists", "allExports", "resolveAllExports", "k", "v", "i", "s", "imports", "r", "resolveConditionalValue", "fileURLToPath", "dirsMade", "save", "f", "links", "saveSet", "dirs", "dest", "dirname", "debug", "writeFileSync", "l", "targets", "getTargets", "imports", "conds", "getAllConditionalValues", "c", "sets", "getUniqueConditionSets", "t", "pj", "resolve", "conditions", "imps", "resolveAllLocalImports", "url", "p", "fileURLToPath", "rel", "relative", "sep", "link", "pkg", "dir", "lps", "df", "dfrel", "src", "mkdirp", "d", "rimraf", "symlink", "unlink", "readlinkSync", "symlinkSync", "dirname", "relative", "resolve", "sep", "dirsMade", "inNM", "linkedAlready", "pkg", "cwd", "p", "sep", "walkUp", "link", "resolve", "target", "dirname", "readlinkSync", "relative", "where", "selfLink", "dest", "dir", "src", "made", "mkdirpSync", "symlinkSync", "rimrafSync", "threw", "unlink", "build_fail_default", "res", "set_folder_dialect_default", "unlink", "package_default", "fail_default", "error", "existsSync", "renameSync", "unlinkSync", "unlink", "f", "rename", "to", "if_exist_default", "realpath", "Module", "basename", "dirname", "isAbsolute", "resolve", "fileURLToPath", "pathToFileURL", "Module", "stat", "fileURLToPath", "realpath", "stat", "dirname", "resolve", "sep", "readFile", "pathToFileURL", "fileURLToPath", "resolve", "dirname", "toPath", "p", "fileExists", "f", "stat", "isWindows", "isRelativeRequire", "url", "walkUp", "path", "resolve", "pp", "dirname", "dirExists", "f", "stat", "findDepPackage", "pkgName", "parentPath", "dir", "walkUp", "dirname", "nm", "resolve", "sep", "ppath", "dirExists", "realpath", "readJSON", "f", "readFile", "isExports", "e", "isImports", "p", "isPkg", "o", "ifPkg", "readPkg", "f", "readJSON", "findStarMatch", "s", "obj", "patterns", "p", "a", "b", "key", "before", "after", "mid", "resolveConditionalValue", "exp", "options", "e", "r", "conditions", "condition", "k", "v", "resolveExport", "sub", "pj", "from", "res", "subpathNotExported", "es", "sm", "toFileURL", "p", "pathToFileURL", "toPath", "fileURLToPath", "Module", "moduleName", "invalidImportSpecifier", "url", "caller", "resolveImport", "er", "relativeImportWithoutParentURL", "parentURL", "subpathNotExported", "sub", "pj", "from", "p", "packageNotFound", "path", "moduleNotFound", "packageImportNotDefined", "resolveDependencyExports", "parentPath", "options", "originalParent", "parts", "pkgName", "ppath", "findDepPackage", "indexjs", "resolve", "pkg", "readPkg", "subpath", "fileExists", "pathToFileURL", "subPath", "resolveExport", "resolved", "rmain", "resolvePackageImport", "dir", "walkUp", "dirname", "exact", "res", "resolveConditionalValue", "sm", "findStarMatch", "key", "mid", "match", "expand", "Module", "moduleName", "realpathParentDir", "toPath", "realpath", "basename", "rp", "fileURLToPath", "pu", "toFileURL", "isRelativeRequire", "u", "isAbsolute", "opts", "fileURLToPath", "provider", "pjToCompilerPath", "resolve", "pkg", "S", "compiler", "config_default", "provPkg", "pjToCompiler", "pj", "which_tsc_default", "fileURLToPath", "node", "commonjsDialects", "config_default", "buildCommonJS", "set_folder_dialect_default", "d", "pf", "polyfills_default", "debug", "source_default", "res", "spawnSync", "which_tsc_default", "build_fail_default", "override", "orig", "stemFrom", "resolve", "relative", "stemTo", "stemToPath", "stemToDtsPath", "if_exist_default", "error", "spawnSync", "relative", "resolve", "node", "esmDialects", "config_default", "buildESM", "set_folder_dialect_default", "d", "pf", "polyfills_default", "debug", "source_default", "res", "spawnSync", "which_tsc_default", "build_fail_default", "override", "orig", "stemFrom", "resolve", "relative", "stemTo", "if_exist_default", "error", "readdirSync", "parse", "cleanRemovedOutputs", "path", "root", "entries", "readdirSync", "sources", "rimraf", "e", "outputFile", "ext", "name", "parse", "inputSearch", "del", "debug", "clean_build_tmp_default", "config", "read_typescript_config_default", "buildInfos", "dialect", "dialects_default", "config_default", "writeFileSync", "write_package_default", "writeFileSync", "stringify", "package_default", "linkSync", "mkdirSync", "dirname", "relative", "resolve", "esmDialects", "config_default", "buildLiveESM", "d", "pf", "polyfills_default", "debug", "source_default", "sources_default", "source", "target", "resolve", "mkdirSync", "dirname", "linkSync", "set_folder_dialect_default", "override", "orig", "stemFrom", "relative", "stemTo", "if_exist_default", "error", "linkSync", "mkdirSync", "dirname", "relative", "resolve", "commonjsDialects", "config_default", "buildLiveCommonJS", "d", "pf", "polyfills_default", "debug", "source_default", "sources_default", "source", "target", "resolve", "mkdirSync", "dirname", "linkSync", "set_folder_dialect_default", "override", "orig", "stemFrom", "relative", "stemTo", "if_exist_default", "error", "build_default", "clean_build_tmp_default", "link", "package_default", "liveDev", "config_default", "esm", "buildLiveESM", "buildESM", "commonjs", "buildLiveCommonJS", "buildCommonJS", "dialects_default", "unlink", "debug", "source_default", "syncContentSync", "save", "bins_default", "write_package_default", "relative", "resolve", "esmDialects", "commonjsDialects", "config_default", "liveDev", "getTargetForDialectCondition", "s", "dialect", "condition", "type", "polyfills", "xts", "pf", "rel", "relative", "resolve", "target", "dialects_default", "resolveExport", "getImpTarget", "getReqTarget", "getExports", "c", "pkgType", "fail_default", "e", "sub", "impTarget", "polyfills_default", "reqTarget", "exp", "d", "source", "getSourceDialects", "sourceDialects", "setMain", "pkg", "mod", "types", "importMod", "package_default", "exports_default", "usage_default", "err", "url", "link", "source_default", "fail_default", "spawn", "statcb", "stat", "readdir", "EventEmitter", "sysPath", "stat", "lstat", "readdir", "realpath", "Readable", "presolve", "prelative", "pjoin", "psep", "EntryTypes", "defaultOptions", "_entryInfo", "RECURSIVE_ERROR_CODE", "NORMAL_FLOW_ERRORS", "ALL_TYPES", "DIR_TYPES", "FILE_TYPES", "isNormalFlowError", "error", "wantBigintFsStats", "emptyFn", "normalizeFilter", "filter", "fl", "entry", "trItems", "item", "f", "ReaddirpStream", "options", "opts", "root", "type", "statMethod", "path", "batch", "par", "fil", "depth", "slice", "dirent", "awaited", "entryType", "parent", "files", "basename", "fullPath", "err", "stats", "full", "entryRealPath", "entryRealPathStats", "len", "recursiveError", "readdirp", "watchFile", "unwatchFile", "fs_watch", "open", "stat", "lstat", "fsrealpath", "sysPath", "osType", "STR_DATA", "STR_END", "STR_CLOSE", "EMPTY_FN", "pl", "isWindows", "isMacos", "isLinux", "isFreeBSD", "isIBMi", "osType", "EVENTS", "EV", "THROTTLE_MODE_WATCH", "statMethods", "lstat", "stat", "KEY_LISTENERS", "KEY_ERR", "KEY_RAW", "HANDLER_KEYS", "binaryExtensions", "isBinaryPath", "filePath", "foreach", "val", "fn", "addAndConvert", "main", "prop", "item", "container", "clearItem", "cont", "key", "set", "delFromSet", "isEmptySet", "FsWatchInstances", "createFsWatchInstance", "path", "options", "listener", "errHandler", "emitRaw", "handleEvent", "rawEvent", "evPath", "fsWatchBroadcast", "fs_watch", "error", "fullPath", "listenerType", "val1", "val2", "val3", "setFsWatchListener", "handlers", "rawEmitter", "watcher", "broadcastErr", "open", "FsWatchFileInstances", "setFsWatchFileListener", "copts", "unwatchFile", "watchFile", "curr", "prev", "currmtime", "NodeFsHandler", "fsW", "opts", "directory", "basename", "absolutePath", "EMPTY_FN", "closer", "enableBin", "file", "stats", "initialAdd", "dirname", "parent", "prevStats", "newStats", "at", "mt", "entry", "full", "dir", "linkPath", "fsrealpath", "wh", "target", "depth", "throttler", "previous", "current", "stream", "STR_DATA", "resolve", "reject", "STR_END", "wasThrottled", "realpath", "parentDir", "tracked", "oDepth", "dirPath", "priorWh", "ready", "follow", "absPath", "targetPath", "SLASH", "SLASH_SLASH", "ONE_DOT", "TWO_DOTS", "STRING_TYPE", "BACK_SLASH_RE", "DOUBLE_SLASH_RE", "DOT_RE", "REPLACER_RE", "arrify", "item", "isMatcherObject", "matcher", "createPattern", "string", "relative", "normalizePath", "path", "prepend", "matchPatterns", "patterns", "testString", "stats", "index", "pattern", "anymatch", "matchers", "unifyPaths", "paths_", "paths", "p", "normalizePathToUnix", "toUnix", "str", "normalizeIgnored", "cwd", "getAbsolutePath", "EMPTY_SET", "DirEntry", "dir", "removeWatcher", "items", "readdir", "EMPTY_FN", "STAT_METHOD_F", "STAT_METHOD_L", "WatchHelper", "follow", "fsw", "watchPath", "parts", "entry", "resolvedPath", "FSWatcher", "EventEmitter", "_opts", "awf", "DEF_AWF", "opts", "isIBMi", "envPoll", "envLower", "envInterval", "readyCalls", "EVENTS", "args", "NodeFsHandler", "ignored", "_origAdd", "_internal", "res", "results", "closers", "closerList", "closer", "promise", "stream", "dirent", "watchList", "event", "isWindows", "pw", "awfEmit", "err", "fullPath", "stat", "error", "code", "actionType", "timeout", "action", "actionPath", "timeoutObject", "clear", "count", "thr", "threshold", "pollInterval", "timeoutHandler", "now", "writes", "awaitWriteFinishFn", "prevStat", "statcb", "curStat", "list", "directory", "isDirectory", "nested", "parent", "wasTracked", "relPath", "eventName", "root", "options", "readdirp", "STR_CLOSE", "STR_END", "watch", "watcher", "readFileSync", "resolve", "sep", "fileURLToPath", "pjData", "readFileSync", "lastPJData", "options", "path", "r", "resolve", "srcPJ", "srcNM", "sep", "src", "rootPJ", "targets", "bin", "fileURLToPath", "watch_default", "building", "needRebuild", "watcher", "watch", "build", "spawn", "code", "signal", "error", "source_default", "print", "ev", "newData", "debug", "exp", "tshy", "package_default", "main", "arg", "usage_default", "watch_default", "debug", "source_default", "build_default", "log"]
}