{"version":3,"file":"filesystem.cjs","names":["cwd?: string","path: PathLike","path","value: string","defaultValue: T | null","value: unknown","value","balanced","expand","glob","regExpEscape","qmark","star","#hasMagic","#parent","#root","#options","#negs","#filledNegs","#parentIndex","#parts","#toString","#parseAST","i","acc","ext","#emptyExt","glob","hasMagic","#fillNegs","#parseGlob","#uflag","start","final","#partsToRegExp","ext","defaultPlatform","Minimatch","AST","#constructing","#starts","#ttls","#sizes","#keyMap","#keyList","#valList","#next","#prev","#head","#tail","#free","#isBackgroundFetch","#backgroundFetch","#moveToTail","#indexes","#rindexes","#isStale","#max","#maxSize","#calculatedSize","#size","#fetchMethod","#memoMethod","#dispose","#disposeAfter","#hasFetchMethod","#disposed","#hasDispose","#hasDisposeAfter","#initializeSizeTracking","#initializeTTLTracking","#setItemTTL","#delete","#updateItemAge","#statusTTL","#removeItemSize","#requireSize","#addItemSize","#evict","#isValidIndex","v","bf","#connect","#clear","Stream","EventEmitter","StringDecoder","p","ret","res","rps","readdirCB","actualFS","#dev","#mode","#nlink","#uid","#gid","#rdev","#blksize","#ino","#size","#blocks","#atimeMs","#mtimeMs","#ctimeMs","#birthtimeMs","#atime","#mtime","#ctime","#birthtime","#matchName","#type","#children","#fullpath","#relative","#relativePosix","#fs","#depth","path","#resolveParts","#fullpathPosix","p","#linkTarget","#realpath","#readlinkFail","#markENOENT","#markChildrenENOENT","#markENOTDIR","#readdirMaybePromoteChild","#readdirAddNewChild","#readdirPromoteChild","#applyStat","#lstatFail","#readdirCBInFlight","#onReaddirCB","#readdirFail","#readdirAddChild","#readdirSuccess","#callOnReaddirCB","#asyncReaddirInFlight","#markENOREALPATH","sep","fs","#resolveCache","#resolvePosixCache","filter","process","sync","win32","posix","#patternList","#globList","#index","#platform","#globString","#rest","#isAbsolute","#isUNC","#isDrive","#followGlobstar","defaultPlatform","path","rest","path","#sep","#ignore","#onResume","#ignored","abs","#childrenIgnored","target","startDir: string","projectDir: string","workspace: string","match","packageJsonPath: string"],"sources":["../src/filesystem/project-root.ts","../src/filesystem/exists.ts","../src/json.ts","../../../node_modules/balanced-match/index.js","../../../node_modules/brace-expansion/index.js","../../../node_modules/minimatch/dist/esm/assert-valid-pattern.js","../../../node_modules/minimatch/dist/esm/brace-expressions.js","../../../node_modules/minimatch/dist/esm/unescape.js","../../../node_modules/minimatch/dist/esm/ast.js","../../../node_modules/minimatch/dist/esm/escape.js","../../../node_modules/minimatch/dist/esm/index.js","../../../node_modules/path-scurry/node_modules/lru-cache/dist/esm/index.js","../../../node_modules/minipass/dist/esm/index.js","../../../node_modules/path-scurry/dist/esm/index.js","../../../node_modules/glob/dist/esm/pattern.js","../../../node_modules/glob/dist/esm/ignore.js","../../../node_modules/glob/dist/esm/processor.js","../../../node_modules/glob/dist/esm/walker.js","../../../node_modules/glob/dist/esm/glob.js","../../../node_modules/glob/dist/esm/has-magic.js","../../../node_modules/glob/dist/esm/index.js","../src/filesystem/mono-repo.ts"],"sourcesContent":["import { dirname } from \"node:path\";\nimport { findUp } from \"find-up\";\n\n/**\n * Finds the root directory of the current project by locating the nearest package.json file\n *\n * @param fallbackToCwd - If true, will return the current working directory if no package.json is found\n * @param cwd - The directory to start searching for the package.json file from (defaults to process.cwd())\n * @returns Promise that resolves to the absolute path of the project root directory\n * @throws Will throw an error if no package.json is found in the directory tree\n * @example\n * import { projectRoot } from \"@settlemint/sdk-utils/filesystem\";\n *\n * // Get project root path\n * const rootDir = await projectRoot();\n * console.log(`Project root is at: ${rootDir}`);\n */\nexport async function projectRoot(fallbackToCwd = false, cwd?: string): Promise {\n const packageJsonPath = await findUp(\"package.json\", { cwd });\n if (!packageJsonPath) {\n if (fallbackToCwd) {\n return process.cwd();\n }\n throw new Error(\"Unable to find project root (no package.json found)\");\n }\n return dirname(packageJsonPath);\n}\n","import type { PathLike } from \"node:fs\";\nimport { stat } from \"node:fs/promises\";\n\n/**\n * Checks if a file or directory exists at the given path\n *\n * @param path - The file system path to check for existence\n * @returns Promise that resolves to true if the path exists, false otherwise\n * @example\n * import { exists } from \"@settlemint/sdk-utils/filesystem\";\n *\n * // Check if file exists before reading\n * if (await exists('/path/to/file.txt')) {\n * // File exists, safe to read\n * }\n */\nexport async function exists(path: PathLike): Promise {\n try {\n await stat(path);\n return true;\n } catch {\n return false;\n }\n}\n","/**\n * Attempts to parse a JSON string into a typed value, returning a default value if parsing fails.\n *\n * @param value - The JSON string to parse\n * @param defaultValue - The value to return if parsing fails or results in null/undefined\n * @returns The parsed JSON value as type T, or the default value if parsing fails\n *\n * @example\n * import { tryParseJson } from \"@settlemint/sdk-utils\";\n *\n * const config = tryParseJson<{ port: number }>(\n * '{\"port\": 3000}',\n * { port: 8080 }\n * );\n * // Returns: { port: 3000 }\n *\n * const invalid = tryParseJson(\n * 'invalid json',\n * []\n * );\n * // Returns: []\n */\nexport function tryParseJson(value: string, defaultValue: T | null = null): T | null {\n try {\n const parsed = JSON.parse(value) as T;\n if (parsed === undefined || parsed === null) {\n return defaultValue;\n }\n return parsed;\n } catch (err) {\n // Invalid json\n return defaultValue;\n }\n}\n\n/**\n * Extracts a JSON object from a string.\n *\n * @param value - The string to extract the JSON object from\n * @returns The parsed JSON object, or null if no JSON object is found\n * @throws {Error} If the input string is too long (longer than 5000 characters)\n * @example\n * import { extractJsonObject } from \"@settlemint/sdk-utils\";\n *\n * const json = extractJsonObject<{ port: number }>(\n * 'port info: {\"port\": 3000}',\n * );\n * // Returns: { port: 3000 }\n */\nexport function extractJsonObject(value: string): T | null {\n if (value.length > 5000) {\n throw new Error(\"Input too long\");\n }\n const result = /\\{([\\s\\S]*)\\}/.exec(value);\n if (!result) {\n return null;\n }\n return tryParseJson(result[0]);\n}\n\n/**\n * Converts a value to a JSON stringifiable format.\n *\n * @param value - The value to convert\n * @returns The JSON stringifiable value\n *\n * @example\n * import { makeJsonStringifiable } from \"@settlemint/sdk-utils\";\n *\n * const json = makeJsonStringifiable<{ amount: bigint }>({ amount: BigInt(1000) });\n * // Returns: '{\"amount\":\"1000\"}'\n */\nexport function makeJsonStringifiable(value: unknown): T {\n if (value === undefined || value === null) {\n return value as T;\n }\n return tryParseJson(\n JSON.stringify(\n value,\n (_, value) => (typeof value === \"bigint\" ? value.toString() : value), // return everything else unchanged\n ),\n ) as T;\n}\n","'use strict';\nmodule.exports = balanced;\nfunction balanced(a, b, str) {\n if (a instanceof RegExp) a = maybeMatch(a, str);\n if (b instanceof RegExp) b = maybeMatch(b, str);\n\n var r = range(a, b, str);\n\n return r && {\n start: r[0],\n end: r[1],\n pre: str.slice(0, r[0]),\n body: str.slice(r[0] + a.length, r[1]),\n post: str.slice(r[1] + b.length)\n };\n}\n\nfunction maybeMatch(reg, str) {\n var m = str.match(reg);\n return m ? m[0] : null;\n}\n\nbalanced.range = range;\nfunction range(a, b, str) {\n var begs, beg, left, right, result;\n var ai = str.indexOf(a);\n var bi = str.indexOf(b, ai + 1);\n var 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 result = [ begs.pop(), bi ];\n } else {\n beg = begs.pop();\n if (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) {\n result = [ left, right ];\n }\n }\n\n return result;\n}\n","var balanced = require('balanced-match');\n\nmodule.exports = expandTop;\n\nvar escSlash = '\\0SLASH'+Math.random()+'\\0';\nvar escOpen = '\\0OPEN'+Math.random()+'\\0';\nvar escClose = '\\0CLOSE'+Math.random()+'\\0';\nvar escComma = '\\0COMMA'+Math.random()+'\\0';\nvar escPeriod = '\\0PERIOD'+Math.random()+'\\0';\n\nfunction numeric(str) {\n return parseInt(str, 10) == str\n ? parseInt(str, 10)\n : str.charCodeAt(0);\n}\n\nfunction escapeBraces(str) {\n return str.split('\\\\\\\\').join(escSlash)\n .split('\\\\{').join(escOpen)\n .split('\\\\}').join(escClose)\n .split('\\\\,').join(escComma)\n .split('\\\\.').join(escPeriod);\n}\n\nfunction unescapeBraces(str) {\n return str.split(escSlash).join('\\\\')\n .split(escOpen).join('{')\n .split(escClose).join('}')\n .split(escComma).join(',')\n .split(escPeriod).join('.');\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}\nfunction parseCommaParts(str) {\n if (!str)\n return [''];\n\n var parts = [];\n var m = balanced('{', '}', str);\n\n if (!m)\n return str.split(',');\n\n var pre = m.pre;\n var body = m.body;\n var post = m.post;\n var p = pre.split(',');\n\n p[p.length-1] += '{' + body + '}';\n var postParts = parseCommaParts(post);\n if (post.length) {\n p[p.length-1] += postParts.shift();\n p.push.apply(p, postParts);\n }\n\n parts.push.apply(parts, p);\n\n return parts;\n}\n\nfunction expandTop(str) {\n if (!str)\n return [];\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.substr(0, 2) === '{}') {\n str = '\\\\{\\\\}' + str.substr(2);\n }\n\n return expand(escapeBraces(str), true).map(unescapeBraces);\n}\n\nfunction embrace(str) {\n return '{' + str + '}';\n}\nfunction isPadded(el) {\n return /^-?0\\d/.test(el);\n}\n\nfunction lte(i, y) {\n return i <= y;\n}\nfunction gte(i, y) {\n return i >= y;\n}\n\nfunction expand(str, isTop) {\n var expansions = [];\n\n var 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 var pre = m.pre;\n var post = m.post.length\n ? expand(m.post, false)\n : [''];\n\n if (/\\$$/.test(m.pre)) { \n for (var k = 0; k < post.length; k++) {\n var expansion = pre+ '{' + m.body + '}' + post[k];\n expansions.push(expansion);\n }\n } else {\n var isNumericSequence = /^-?\\d+\\.\\.-?\\d+(?:\\.\\.-?\\d+)?$/.test(m.body);\n var isAlphaSequence = /^[a-zA-Z]\\.\\.[a-zA-Z](?:\\.\\.-?\\d+)?$/.test(m.body);\n var isSequence = isNumericSequence || isAlphaSequence;\n var 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);\n }\n return [str];\n }\n\n var n;\n if (isSequence) {\n n = m.body.split(/\\.\\./);\n } else {\n n = parseCommaParts(m.body);\n if (n.length === 1) {\n // x{{a,b}}y ==> x{a}y x{b}y\n n = expand(n[0], false).map(embrace);\n if (n.length === 1) {\n return post.map(function(p) {\n return m.pre + n[0] + p;\n });\n }\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 var N;\n\n if (isSequence) {\n var x = numeric(n[0]);\n var y = numeric(n[1]);\n var width = Math.max(n[0].length, n[1].length)\n var incr = n.length == 3\n ? Math.abs(numeric(n[2]))\n : 1;\n var test = lte;\n var reverse = y < x;\n if (reverse) {\n incr *= -1;\n test = gte;\n }\n var pad = n.some(isPadded);\n\n N = [];\n\n for (var i = x; test(i, y); i += incr) {\n var c;\n if (isAlphaSequence) {\n c = String.fromCharCode(i);\n if (c === '\\\\')\n c = '';\n } else {\n c = String(i);\n if (pad) {\n var need = width - c.length;\n if (need > 0) {\n var 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.push(c);\n }\n } else {\n N = [];\n\n for (var j = 0; j < n.length; j++) {\n N.push.apply(N, expand(n[j], false));\n }\n }\n\n for (var j = 0; j < N.length; j++) {\n for (var k = 0; k < post.length; k++) {\n var expansion = pre + N[j] + post[k];\n if (!isTop || isSequence || expansion)\n expansions.push(expansion);\n }\n }\n }\n\n return expansions;\n}\n\n","const MAX_PATTERN_LENGTH = 1024 * 64;\nexport const assertValidPattern = (pattern) => {\n if (typeof pattern !== 'string') {\n throw new TypeError('invalid pattern');\n }\n if (pattern.length > MAX_PATTERN_LENGTH) {\n throw new TypeError('pattern is too long');\n }\n};\n//# sourceMappingURL=assert-valid-pattern.js.map","// translate the various posix character classes into unicode properties\n// this works across all unicode locales\n// { : [, /u flag required, negated]\nconst posixClasses = {\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// only need to escape a few things inside of brace expressions\n// escapes: [ \\ ] -\nconst braceEscape = (s) => s.replace(/[[\\]\\\\-]/g, '\\\\$&');\n// escape all regexp magic characters\nconst regexpEscape = (s) => s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&');\n// everything has already been escaped, we just have to join\nconst rangesToString = (ranges) => ranges.join('');\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 = (glob, position) => {\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 = [];\n const negs = [];\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 if (c === ']' && sawStart && !escaping) {\n endPos = i + 1;\n break;\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)\n negs.push(unip);\n else\n ranges.push(unip);\n uflag = uflag || u;\n continue WHILE;\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 }\n else if (c === rangeStart) {\n ranges.push(braceEscape(c));\n }\n rangeStart = '';\n i++;\n continue;\n }\n // now might be the start of a range.\n // can be either c-d or c-] or c] 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 // not the start of a range, just a single character\n ranges.push(braceEscape(c));\n i++;\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 // 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 // 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 (negs.length === 0 &&\n ranges.length === 1 &&\n /^\\\\?.$/.test(ranges[0]) &&\n !negate) {\n const r = ranges[0].length === 2 ? ranges[0].slice(-1) : ranges[0];\n return [regexpEscape(r), false, endPos - pos, false];\n }\n const sranges = '[' + (negate ? '^' : '') + rangesToString(ranges) + ']';\n const snegs = '[' + (negate ? '' : '^') + rangesToString(negs) + ']';\n const comb = ranges.length && negs.length\n ? '(' + sranges + '|' + snegs + ')'\n : ranges.length\n ? sranges\n : snegs;\n return [comb, uflag, endPos - pos, true];\n};\n//# sourceMappingURL=brace-expressions.js.map","/**\n * Un-escape a string that has been escaped with {@link escape}.\n *\n * If the {@link windowsPathsNoEscape} option is used, then square-brace\n * escapes are removed, but not backslash escapes. For example, it will turn\n * the string `'[*]'` into `*`, but it will not turn `'\\\\*'` into `'*'`,\n * becuase `\\` is a path separator in `windowsPathsNoEscape` mode.\n *\n * When `windowsPathsNoEscape` is not set, then both brace escapes and\n * backslash escapes are removed.\n *\n * Slashes (and backslashes in `windowsPathsNoEscape` mode) cannot be escaped\n * or unescaped.\n */\nexport const unescape = (s, { windowsPathsNoEscape = false, } = {}) => {\n return windowsPathsNoEscape\n ? s.replace(/\\[([^\\/\\\\])\\]/g, '$1')\n : s.replace(/((?!\\\\).|^)\\[([^\\/\\\\])\\]/g, '$1$2').replace(/\\\\([^\\/])/g, '$1');\n};\n//# sourceMappingURL=unescape.js.map","// parse a single path portion\nimport { parseClass } from './brace-expressions.js';\nimport { unescape } from './unescape.js';\nconst types = new Set(['!', '?', '+', '*', '@']);\nconst isExtglobType = (c) => types.has(c);\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// 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) => s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&');\n// any single thing other than /\nconst qmark = '[^/]';\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// remove the \\ chars that we added if we end up doing a nonmagic compare\n// const deslash = (s: string) => s.replace(/\\\\(.)/g, '$1')\nexport class AST {\n type;\n #root;\n #hasMagic;\n #uflag = false;\n #parts = [];\n #parent;\n #parentIndex;\n #negs;\n #filledNegs = false;\n #options;\n #toString;\n // set to true if it's an extglob with no children\n // (which really means one child of '')\n #emptyExt = false;\n constructor(type, parent, options = {}) {\n this.type = type;\n // extglobs are inherently magical\n if (type)\n 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)\n this.#negs.push(this);\n this.#parentIndex = this.#parent ? this.#parent.#parts.length : 0;\n }\n get hasMagic() {\n /* c8 ignore start */\n if (this.#hasMagic !== undefined)\n return this.#hasMagic;\n /* c8 ignore stop */\n for (const p of this.#parts) {\n if (typeof p === 'string')\n continue;\n if (p.type || p.hasMagic)\n 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 // reconstructs the pattern\n toString() {\n if (this.#toString !== undefined)\n return this.#toString;\n if (!this.type) {\n return (this.#toString = this.#parts.map(p => String(p)).join(''));\n }\n else {\n return (this.#toString =\n this.type + '(' + this.#parts.map(p => String(p)).join('|') + ')');\n }\n }\n #fillNegs() {\n /* c8 ignore start */\n if (this !== this.#root)\n throw new Error('should only call on root');\n if (this.#filledNegs)\n return this;\n /* c8 ignore stop */\n // call toString() once to fill this out\n this.toString();\n this.#filledNegs = true;\n let n;\n while ((n = this.#negs.pop())) {\n if (n.type !== '!')\n continue;\n // walk up the tree, appending everthing that comes AFTER parentIndex\n let p = n;\n let pp = p.#parent;\n while (pp) {\n for (let i = p.#parentIndex + 1; !pp.type && i < pp.#parts.length; i++) {\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 push(...parts) {\n for (const p of parts) {\n if (p === '')\n continue;\n /* c8 ignore start */\n if (typeof p !== 'string' && !(p instanceof AST && p.#parent === this)) {\n throw new Error('invalid part: ' + p);\n }\n /* c8 ignore stop */\n this.#parts.push(p);\n }\n }\n toJSON() {\n const ret = this.type === null\n ? this.#parts.slice().map(p => (typeof p === 'string' ? p : p.toJSON()))\n : [this.type, ...this.#parts.map(p => p.toJSON())];\n if (this.isStart() && !this.type)\n ret.unshift([]);\n if (this.isEnd() &&\n (this === this.#root ||\n (this.#root.#filledNegs && this.#parent?.type === '!'))) {\n ret.push({});\n }\n return ret;\n }\n isStart() {\n if (this.#root === this)\n return true;\n // if (this.type) return !!this.#parent?.isStart()\n if (!this.#parent?.isStart())\n return false;\n if (this.#parentIndex === 0)\n 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 isEnd() {\n if (this.#root === this)\n return true;\n if (this.#parent?.type === '!')\n return true;\n if (!this.#parent?.isEnd())\n return false;\n if (!this.type)\n 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 copyIn(part) {\n if (typeof part === 'string')\n this.push(part);\n else\n this.push(part.clone(this));\n }\n clone(parent) {\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 static #parseAST(str, ast, pos, opt) {\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 if (inBrace) {\n if (i === braceStart + 1) {\n if (c === '^' || c === '!') {\n braceNeg = true;\n }\n }\n else if (c === ']' && !(i === braceStart + 2 && braceNeg)) {\n inBrace = false;\n }\n acc += c;\n continue;\n }\n else if (c === '[') {\n inBrace = true;\n braceStart = i;\n braceNeg = false;\n acc += c;\n continue;\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 // 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 = [];\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 if (inBrace) {\n if (i === braceStart + 1) {\n if (c === '^' || c === '!') {\n braceNeg = true;\n }\n }\n else if (c === ']' && !(i === braceStart + 2 && braceNeg)) {\n inBrace = false;\n }\n acc += c;\n continue;\n }\n else if (c === '[') {\n inBrace = true;\n braceStart = i;\n braceNeg = false;\n acc += c;\n continue;\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 // 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 static fromGlob(pattern, options = {}) {\n const ast = new AST(null, undefined, options);\n AST.#parseAST(pattern, ast, 0, options);\n return ast;\n }\n // returns the regular expression if there's magic, or the unescaped\n // string if not.\n toMMPattern() {\n // should only be called on root\n /* c8 ignore start */\n if (this !== this.#root)\n 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 = 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 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 get options() {\n return this.#options;\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(allowDot) {\n const dot = allowDot ?? !!this.#options.dot;\n if (this.#root === this)\n this.#fillNegs();\n if (!this.type) {\n const noEmpty = this.isStart() && this.isEnd();\n const src = this.#parts\n .map(p => {\n const [re, _, hasMagic, uflag] = 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 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 // '.' and '..' cannot match unless the pattern is that exactly,\n // even if it starts with . or dot:true is set.\n const dotTravAllowed = 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 start = needNoTrav ? startNoTraversal : needNoDot ? startNoDot : '';\n }\n }\n }\n // append the \"end of path portion\" pattern to negation tails\n let end = '';\n if (this.isEnd() &&\n this.#root.#filledNegs &&\n this.#parent?.type === '!') {\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 // 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 const repeated = this.type === '*' || this.type === '+';\n // some kind of extglob\n const start = this.type === '!' ? '(?:(?!(?:' : '(?:';\n let body = this.#partsToRegExp(dot);\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 // XXX abstract out this map method\n let bodyDotAllowed = !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 // 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 }\n else {\n const close = this.type === '!'\n ? // !() must match something,but !(x) can match ''\n '))' +\n (this.isStart() && !dot && !allowDot ? startNoDot : '') +\n star +\n ')'\n : this.type === '@'\n ? ')'\n : this.type === '?'\n ? ')?'\n : this.type === '+' && bodyDotAllowed\n ? ')'\n : this.type === '*' && bodyDotAllowed\n ? `)?`\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 #partsToRegExp(dot) {\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 static #parseGlob(glob, hasMagic, noEmpty = false) {\n let escaping = false;\n let re = '';\n let uflag = 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 (i === glob.length - 1) {\n re += '\\\\\\\\';\n }\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 if (noEmpty && glob === '*')\n re += starNoEmpty;\n else\n re += star;\n hasMagic = true;\n continue;\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//# sourceMappingURL=ast.js.map","/**\n * Escape all magic characters in a glob pattern.\n *\n * If the {@link windowsPathsNoEscape | GlobOptions.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 */\nexport const escape = (s, { windowsPathsNoEscape = false, } = {}) => {\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 return windowsPathsNoEscape\n ? s.replace(/[?*()[\\]]/g, '[$&]')\n : s.replace(/[?*()[\\]\\\\]/g, '\\\\$&');\n};\n//# sourceMappingURL=escape.js.map","import expand from 'brace-expansion';\nimport { assertValidPattern } from './assert-valid-pattern.js';\nimport { AST } from './ast.js';\nimport { escape } from './escape.js';\nimport { unescape } from './unescape.js';\nexport const minimatch = (p, pattern, options = {}) => {\n assertValidPattern(pattern);\n // shortcut: comments match nothing.\n if (!options.nocomment && pattern.charAt(0) === '#') {\n return false;\n }\n return new Minimatch(pattern, options).match(p);\n};\n// Optimized checking for the most common glob patterns.\nconst starDotExtRE = /^\\*+([^+@!?\\*\\[\\(]*)$/;\nconst starDotExtTest = (ext) => (f) => !f.startsWith('.') && f.endsWith(ext);\nconst starDotExtTestDot = (ext) => (f) => f.endsWith(ext);\nconst starDotExtTestNocase = (ext) => {\n ext = ext.toLowerCase();\n return (f) => !f.startsWith('.') && f.toLowerCase().endsWith(ext);\n};\nconst starDotExtTestNocaseDot = (ext) => {\n ext = ext.toLowerCase();\n return (f) => f.toLowerCase().endsWith(ext);\n};\nconst starDotStarRE = /^\\*+\\.\\*+$/;\nconst starDotStarTest = (f) => !f.startsWith('.') && f.includes('.');\nconst starDotStarTestDot = (f) => f !== '.' && f !== '..' && f.includes('.');\nconst dotStarRE = /^\\.\\*+$/;\nconst dotStarTest = (f) => f !== '.' && f !== '..' && f.startsWith('.');\nconst starRE = /^\\*+$/;\nconst starTest = (f) => f.length !== 0 && !f.startsWith('.');\nconst starTestDot = (f) => f.length !== 0 && f !== '.' && f !== '..';\nconst qmarksRE = /^\\?+([^+@!?\\*\\[\\(]*)?$/;\nconst qmarksTestNocase = ([$0, ext = '']) => {\n const noext = qmarksTestNoExt([$0]);\n if (!ext)\n return noext;\n ext = ext.toLowerCase();\n return (f) => noext(f) && f.toLowerCase().endsWith(ext);\n};\nconst qmarksTestNocaseDot = ([$0, ext = '']) => {\n const noext = qmarksTestNoExtDot([$0]);\n if (!ext)\n return noext;\n ext = ext.toLowerCase();\n return (f) => noext(f) && f.toLowerCase().endsWith(ext);\n};\nconst qmarksTestDot = ([$0, ext = '']) => {\n const noext = qmarksTestNoExtDot([$0]);\n return !ext ? noext : (f) => noext(f) && f.endsWith(ext);\n};\nconst qmarksTest = ([$0, ext = '']) => {\n const noext = qmarksTestNoExt([$0]);\n return !ext ? noext : (f) => noext(f) && f.endsWith(ext);\n};\nconst qmarksTestNoExt = ([$0]) => {\n const len = $0.length;\n return (f) => f.length === len && !f.startsWith('.');\n};\nconst qmarksTestNoExtDot = ([$0]) => {\n const len = $0.length;\n return (f) => f.length === len && f !== '.' && f !== '..';\n};\n/* c8 ignore start */\nconst defaultPlatform = (typeof process === 'object' && process\n ? (typeof process.env === 'object' &&\n process.env &&\n process.env.__MINIMATCH_TESTING_PLATFORM__) ||\n process.platform\n : 'posix');\nconst path = {\n win32: { sep: '\\\\' },\n posix: { sep: '/' },\n};\n/* c8 ignore stop */\nexport const sep = defaultPlatform === 'win32' ? path.win32.sep : path.posix.sep;\nminimatch.sep = sep;\nexport const GLOBSTAR = Symbol('globstar **');\nminimatch.GLOBSTAR = GLOBSTAR;\n// any single thing other than /\n// don't need to escape / when using new RegExp()\nconst qmark = '[^/]';\n// * => any number of characters\nconst star = qmark + '*?';\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// not a ^ or / followed by a dot,\n// followed by anything, any number of times.\nconst twoStarNoDot = '(?:(?!(?:\\\\/|^)\\\\.).)*?';\nexport const filter = (pattern, options = {}) => (p) => minimatch(p, pattern, options);\nminimatch.filter = filter;\nconst ext = (a, b = {}) => Object.assign({}, a, b);\nexport const defaults = (def) => {\n if (!def || typeof def !== 'object' || !Object.keys(def).length) {\n return minimatch;\n }\n const orig = minimatch;\n const m = (p, pattern, options = {}) => orig(p, pattern, ext(def, options));\n return Object.assign(m, {\n Minimatch: class Minimatch extends orig.Minimatch {\n constructor(pattern, options = {}) {\n super(pattern, ext(def, options));\n }\n static defaults(options) {\n return orig.defaults(ext(def, options)).Minimatch;\n }\n },\n AST: class AST extends orig.AST {\n /* c8 ignore start */\n constructor(type, parent, options = {}) {\n super(type, parent, ext(def, options));\n }\n /* c8 ignore stop */\n static fromGlob(pattern, options = {}) {\n return orig.AST.fromGlob(pattern, ext(def, options));\n }\n },\n unescape: (s, options = {}) => orig.unescape(s, ext(def, options)),\n escape: (s, options = {}) => orig.escape(s, ext(def, options)),\n filter: (pattern, options = {}) => orig.filter(pattern, ext(def, options)),\n defaults: (options) => orig.defaults(ext(def, options)),\n makeRe: (pattern, options = {}) => orig.makeRe(pattern, ext(def, options)),\n braceExpand: (pattern, options = {}) => orig.braceExpand(pattern, ext(def, options)),\n match: (list, pattern, options = {}) => orig.match(list, pattern, ext(def, options)),\n sep: orig.sep,\n GLOBSTAR: GLOBSTAR,\n });\n};\nminimatch.defaults = defaults;\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 = (pattern, options = {}) => {\n assertValidPattern(pattern);\n // Thanks to Yeting Li 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 return expand(pattern);\n};\nminimatch.braceExpand = braceExpand;\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.\nexport const makeRe = (pattern, options = {}) => new Minimatch(pattern, options).makeRe();\nminimatch.makeRe = makeRe;\nexport const match = (list, pattern, options = {}) => {\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// replace stuff like \\* with *\nconst globMagic = /[?*]|[+@!]\\(.*?\\)|\\[|\\]/;\nconst regExpEscape = (s) => s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&');\nexport class Minimatch {\n options;\n set;\n pattern;\n windowsPathsNoEscape;\n nonegate;\n negate;\n comment;\n empty;\n preserveMultipleSlashes;\n partial;\n globSet;\n globParts;\n nocase;\n isWindows;\n platform;\n windowsNoMagicRoot;\n regexp;\n constructor(pattern, options = {}) {\n assertValidPattern(pattern);\n options = options || {};\n this.options = options;\n this.pattern = pattern;\n this.platform = options.platform || defaultPlatform;\n this.isWindows = this.platform === 'win32';\n this.windowsPathsNoEscape =\n !!options.windowsPathsNoEscape || options.allowWindowsEscape === 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 this.globSet = [];\n this.globParts = [];\n this.set = [];\n // make the set of regexps etc.\n this.make();\n }\n hasMagic() {\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')\n return true;\n }\n }\n return false;\n }\n debug(..._) { }\n make() {\n const pattern = this.pattern;\n const options = this.options;\n // empty patterns and comments match nothing.\n if (!options.nocomment && pattern.charAt(0) === '#') {\n this.comment = true;\n return;\n }\n if (!pattern) {\n this.empty = true;\n return;\n }\n // step 1: figure out negation, etc.\n this.parseNegate();\n // step 2: expand braces\n this.globSet = [...new Set(this.braceExpand())];\n if (options.debug) {\n this.debug = (...args) => console.error(...args);\n }\n this.debug(this.pattern, this.globSet);\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 // 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 = 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 [...s.slice(0, 4), ...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 this.debug(this.pattern, set);\n // filter out everything that didn't compile properly.\n this.set = set.filter(s => s.indexOf(false) === -1);\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 (p[0] === '' &&\n p[1] === '' &&\n this.globParts[i][2] === '?' &&\n typeof p[3] === 'string' &&\n /^[a-z]:$/i.test(p[3])) {\n p[2] = '?';\n }\n }\n }\n this.debug(this.pattern, this.set);\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) {\n // if we're not in globstar mode, then turn all ** 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 const { optimizationLevel = 1 } = this.options;\n if (optimizationLevel >= 2) {\n // aggressive optimization for the purpose of fs walking\n globParts = this.firstPhasePreProcess(globParts);\n globParts = this.secondPhasePreProcess(globParts);\n }\n else if (optimizationLevel >= 1) {\n // just basic optimizations to remove some .. parts\n globParts = this.levelOneOptimize(globParts);\n }\n else {\n // just collapse multiple ** portions into one\n globParts = this.adjascentGlobstarOptimize(globParts);\n }\n return globParts;\n }\n // just get rid of adjascent ** portions\n adjascentGlobstarOptimize(globParts) {\n return globParts.map(parts => {\n let gs = -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 // get rid of adjascent ** and resolve .. portions\n levelOneOptimize(globParts) {\n return globParts.map(parts => {\n parts = parts.reduce((set, 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 levelTwoFileOptimize(parts) {\n if (!Array.isArray(parts)) {\n parts = this.slashSplit(parts);\n }\n let didSomething = false;\n do {\n didSomething = false;\n // 
// -> 
/\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] === '')\n                        continue;\n                    if (p === '.' || p === '') {\n                        didSomething = true;\n                        parts.splice(i, 1);\n                        i--;\n                    }\n                }\n                if (parts[0] === '.' &&\n                    parts.length === 2 &&\n                    (parts[1] === '.' || parts[1] === '')) {\n                    didSomething = true;\n                    parts.pop();\n                }\n            }\n            // 
/
/../ -> 
/\n            let dd = 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    // First phase: single-pattern processing\n    // 
 is 1 or more portions\n    //  is 1 or more portions\n    // 
 is any portion other than ., .., '', or **\n    //  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    // 
/**/../
/
/ -> {
/../
/
/,
/**/
/
/}\n    // 
// -> 
/\n    // 
/
/../ -> 
/\n    // **/**/ -> **/\n    //\n    // **/*/ -> */**/ <== not valid because ** doesn't follow\n    // this WOULD be allowed if ** did follow symlinks, or * didn't\n    firstPhasePreProcess(globParts) {\n        let didSomething = false;\n        do {\n            didSomething = false;\n            // 
/**/../
/
/ -> {
/../
/
/,
/**/
/
/}\n            for (let parts of globParts) {\n                let gs = -1;\n                while (-1 !== (gs = parts.indexOf('**', gs + 1))) {\n                    let gss = gs;\n                    while (parts[gss + 1] === '**') {\n                        // 
/**/**/ -> 
/**/\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                    let next = parts[gs + 1];\n                    const p = parts[gs + 2];\n                    const p2 = parts[gs + 3];\n                    if (next !== '..')\n                        continue;\n                    if (!p ||\n                        p === '.' ||\n                        p === '..' ||\n                        !p2 ||\n                        p2 === '.' ||\n                        p2 === '..') {\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                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] === '')\n                            continue;\n                        if (p === '.' || p === '') {\n                            didSomething = true;\n                            parts.splice(i, 1);\n                            i--;\n                        }\n                    }\n                    if (parts[0] === '.' &&\n                        parts.length === 2 &&\n                        (parts[1] === '.' || parts[1] === '')) {\n                        didSomething = true;\n                        parts.pop();\n                    }\n                }\n                // 
/
/../ -> 
/\n                let dd = 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)\n                            parts.push('');\n                        dd -= 2;\n                    }\n                }\n            }\n        } while (didSomething);\n        return globParts;\n    }\n    // second phase: multi-pattern dedupes\n    // {
/*/,
/
/} -> 
/*/\n    // {
/,
/} -> 
/\n    // {
/**/,
/} -> 
/**/\n    //\n    // {
/**/,
/**/
/} -> 
/**/\n    // ^-- not valid because ** doens't follow symlinks\n    secondPhasePreProcess(globParts) {\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(globParts[i], globParts[j], !this.preserveMultipleSlashes);\n                if (matched) {\n                    globParts[i] = [];\n                    globParts[j] = matched;\n                    break;\n                }\n            }\n        }\n        return globParts.filter(gs => gs.length);\n    }\n    partsMatch(a, b, emptyGSMatch = false) {\n        let ai = 0;\n        let bi = 0;\n        let result = [];\n        let which = '';\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            }\n            else if (emptyGSMatch && a[ai] === '**' && b[bi] === a[ai + 1]) {\n                result.push(a[ai]);\n                ai++;\n            }\n            else if (emptyGSMatch && b[bi] === '**' && a[ai] === b[bi + 1]) {\n                result.push(b[bi]);\n                bi++;\n            }\n            else if (a[ai] === '*' &&\n                b[bi] &&\n                (this.options.dot || !b[bi].startsWith('.')) &&\n                b[bi] !== '**') {\n                if (which === 'b')\n                    return false;\n                which = 'a';\n                result.push(a[ai]);\n                ai++;\n                bi++;\n            }\n            else if (b[bi] === '*' &&\n                a[ai] &&\n                (this.options.dot || !a[ai].startsWith('.')) &&\n                a[ai] !== '**') {\n                if (which === 'a')\n                    return false;\n                which = 'b';\n                result.push(b[bi]);\n                ai++;\n                bi++;\n            }\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    parseNegate() {\n        if (this.nonegate)\n            return;\n        const pattern = this.pattern;\n        let negate = false;\n        let negateOffset = 0;\n        for (let i = 0; i < pattern.length && pattern.charAt(i) === '!'; i++) {\n            negate = !negate;\n            negateOffset++;\n        }\n        if (negateOffset)\n            this.pattern = pattern.slice(negateOffset);\n        this.negate = negate;\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(file, pattern, partial = false) {\n        const options = this.options;\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 = typeof file[0] === 'string' && /^[a-z]:$/i.test(file[0]);\n            const fileUNC = !fileDrive &&\n                file[0] === '' &&\n                file[1] === '' &&\n                file[2] === '?' &&\n                /^[a-z]:$/i.test(file[3]);\n            const patternDrive = typeof pattern[0] === 'string' && /^[a-z]:$/i.test(pattern[0]);\n            const patternUNC = !patternDrive &&\n                pattern[0] === '' &&\n                pattern[1] === '' &&\n                pattern[2] === '?' &&\n                typeof pattern[3] === 'string' &&\n                /^[a-z]:$/i.test(pattern[3]);\n            const fdi = fileUNC ? 3 : fileDrive ? 0 : undefined;\n            const pdi = patternUNC ? 3 : patternDrive ? 0 : undefined;\n            if (typeof fdi === 'number' && typeof pdi === 'number') {\n                const [fd, pd] = [file[fdi], pattern[pdi]];\n                if (fd.toLowerCase() === pd.toLowerCase()) {\n                    pattern[pdi] = fd;\n                    if (pdi > fdi) {\n                        pattern = pattern.slice(pdi);\n                    }\n                    else if (fdi > pdi) {\n                        file = file.slice(fdi);\n                    }\n                }\n            }\n        }\n        // resolve and reduce . and .. portions in the file as well.\n        // dont' 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        this.debug('matchOne', this, { file, pattern });\n        this.debug('matchOne', file.length, pattern.length);\n        for (var fi = 0, pi = 0, fl = file.length, pl = pattern.length; fi < fl && pi < pl; fi++, pi++) {\n            this.debug('matchOne loop');\n            var p = pattern[pi];\n            var f = file[fi];\n            this.debug(pattern, p, f);\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            if (p === GLOBSTAR) {\n                this.debug('GLOBSTAR', [pattern, p, f]);\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 (file[fi] === '.' ||\n                            file[fi] === '..' ||\n                            (!options.dot && file[fi].charAt(0) === '.'))\n                            return false;\n                    }\n                    return true;\n                }\n                // ok, let's see if we can swallow whatever we can.\n                while (fr < fl) {\n                    var swallowee = file[fr];\n                    this.debug('\\nglobstar while', file, fr, pattern, pr, swallowee);\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                    }\n                    else {\n                        // can't swallow \".\" or \"..\" ever.\n                        // can only swallow \".foo\" when explicitly asked.\n                        if (swallowee === '.' ||\n                            swallowee === '..' ||\n                            (!options.dot && swallowee.charAt(0) === '.')) {\n                            this.debug('dot detected!', file, fr, pattern, pr);\n                            break;\n                        }\n                        // ** swallows a segment, and continue.\n                        this.debug('globstar swallow a segment, and continue');\n                        fr++;\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            // something other than **\n            // non-magic patterns just have to match exactly\n            // patterns with magic have been turned into regexps.\n            let hit;\n            if (typeof p === 'string') {\n                hit = f === p;\n                this.debug('string match', p, f, hit);\n            }\n            else {\n                hit = p.test(f);\n                this.debug('pattern match', p, f, hit);\n            }\n            if (!hit)\n                return false;\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        // 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        }\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        }\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            /* c8 ignore start */\n        }\n        else {\n            // should be unreachable.\n            throw new Error('wtf?');\n        }\n        /* c8 ignore stop */\n    }\n    braceExpand() {\n        return braceExpand(this.pattern, this.options);\n    }\n    parse(pattern) {\n        assertValidPattern(pattern);\n        const options = this.options;\n        // shortcuts\n        if (pattern === '**')\n            return GLOBSTAR;\n        if (pattern === '')\n            return '';\n        // far and away, the most common glob pattern parts are\n        // *, *.*, and *.  Add a fast check method for those.\n        let m;\n        let fastTest = null;\n        if ((m = pattern.match(starRE))) {\n            fastTest = options.dot ? starTestDot : starTest;\n        }\n        else if ((m = pattern.match(starDotExtRE))) {\n            fastTest = (options.nocase\n                ? options.dot\n                    ? starDotExtTestNocaseDot\n                    : starDotExtTestNocase\n                : options.dot\n                    ? starDotExtTestDot\n                    : starDotExtTest)(m[1]);\n        }\n        else if ((m = pattern.match(qmarksRE))) {\n            fastTest = (options.nocase\n                ? options.dot\n                    ? qmarksTestNocaseDot\n                    : qmarksTestNocase\n                : options.dot\n                    ? qmarksTestDot\n                    : qmarksTest)(m);\n        }\n        else if ((m = pattern.match(starDotStarRE))) {\n            fastTest = options.dot ? starDotStarTestDot : starDotStarTest;\n        }\n        else if ((m = pattern.match(dotStarRE))) {\n            fastTest = dotStarTest;\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    makeRe() {\n        if (this.regexp || this.regexp === false)\n            return this.regexp;\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        if (!set.length) {\n            this.regexp = false;\n            return this.regexp;\n        }\n        const options = this.options;\n        const twoStar = options.noglobstar\n            ? star\n            : options.dot\n                ? twoStarDot\n                : twoStarNoDot;\n        const flags = new Set(options.nocase ? ['i'] : []);\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 = pattern.map(p => {\n                if (p instanceof RegExp) {\n                    for (const f of p.flags.split(''))\n                        flags.add(f);\n                }\n                return typeof p === 'string'\n                    ? regExpEscape(p)\n                    : p === GLOBSTAR\n                        ? GLOBSTAR\n                        : p._src;\n            });\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                    }\n                    else {\n                        pp[i] = twoStar;\n                    }\n                }\n                else if (next === undefined) {\n                    pp[i - 1] = prev + '(?:\\\\/|' + twoStar + ')?';\n                }\n                else if (next !== GLOBSTAR) {\n                    pp[i - 1] = prev + '(?:\\\\/|\\\\/' + twoStar + '\\\\/)' + next;\n                    pp[i + 1] = GLOBSTAR;\n                }\n            });\n            return pp.filter(p => p !== GLOBSTAR).join('/');\n        })\n            .join('|');\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        // can match anything, as long as it's not this.\n        if (this.negate)\n            re = '^(?!' + re + ').+$';\n        try {\n            this.regexp = new RegExp(re, [...flags].join(''));\n            /* c8 ignore start */\n        }\n        catch (ex) {\n            // should be impossible\n            this.regexp = false;\n        }\n        /* c8 ignore stop */\n        return this.regexp;\n    }\n    slashSplit(p) {\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        }\n        else if (this.isWindows && /^\\/\\/[^\\/]+/.test(p)) {\n            // add an extra '' for the one we lose\n            return ['', ...p.split(/\\/+/)];\n        }\n        else {\n            return p.split(/\\/+/);\n        }\n    }\n    match(f, 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        if (f === '/' && partial) {\n            return true;\n        }\n        const options = this.options;\n        // windows: need to use /, not \\\n        if (this.isWindows) {\n            f = f.split('\\\\').join('/');\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        // 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        const set = this.set;\n        this.debug(this.pattern, 'set', set);\n        // Find the basename of the path by looking for the last non-empty segment\n        let filename = 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        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        // 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    static defaults(def) {\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//# sourceMappingURL=index.js.map","/**\n * @module LRUCache\n */\nconst perf = typeof performance === 'object' &&\n    performance &&\n    typeof performance.now === 'function'\n    ? performance\n    : Date;\nconst warned = new Set();\n/* c8 ignore start */\nconst PROCESS = (typeof process === 'object' && !!process ? process : {});\n/* c8 ignore start */\nconst emitWarning = (msg, type, code, fn) => {\n    typeof PROCESS.emitWarning === 'function'\n        ? PROCESS.emitWarning(msg, type, code, fn)\n        : console.error(`[${code}] ${type}: ${msg}`);\n};\nlet AC = globalThis.AbortController;\nlet AS = globalThis.AbortSignal;\n/* c8 ignore start */\nif (typeof AC === 'undefined') {\n    //@ts-ignore\n    AS = class AbortSignal {\n        onabort;\n        _onabort = [];\n        reason;\n        aborted = false;\n        addEventListener(_, fn) {\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) {\n            if (this.signal.aborted)\n                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 = PROCESS.env?.LRU_CACHE_IGNORE_AC_WARNING !== '1';\n    const warnACPolyfill = () => {\n        if (!printACPolyfillWarning)\n            return;\n        printACPolyfillWarning = false;\n        emitWarning('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.', 'NO_ABORT_CONTROLLER', 'ENOTSUP', warnACPolyfill);\n    };\n}\n/* c8 ignore stop */\nconst shouldWarn = (code) => !warned.has(code);\nconst TYPE = Symbol('type');\nconst isPosInt = (n) => n && n === Math.floor(n) && n > 0 && isFinite(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) => !isPosInt(max)\n    ? null\n    : max <= Math.pow(2, 8)\n        ? Uint8Array\n        : max <= Math.pow(2, 16)\n            ? Uint16Array\n            : max <= Math.pow(2, 32)\n                ? Uint32Array\n                : max <= Number.MAX_SAFE_INTEGER\n                    ? ZeroArray\n                    : null;\n/* c8 ignore stop */\nclass ZeroArray extends Array {\n    constructor(size) {\n        super(size);\n        this.fill(0);\n    }\n}\nclass Stack {\n    heap;\n    length;\n    // private constructor\n    static #constructing = false;\n    static create(max) {\n        const HeapCls = getUintArray(max);\n        if (!HeapCls)\n            return [];\n        Stack.#constructing = true;\n        const s = new Stack(max, HeapCls);\n        Stack.#constructing = false;\n        return s;\n    }\n    constructor(max, HeapCls) {\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) {\n        this.heap[this.length++] = n;\n    }\n    pop() {\n        return this.heap[--this.length];\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 {\n    // options that cannot be changed without disaster\n    #max;\n    #maxSize;\n    #dispose;\n    #disposeAfter;\n    #fetchMethod;\n    #memoMethod;\n    /**\n     * {@link LRUCache.OptionsBase.ttl}\n     */\n    ttl;\n    /**\n     * {@link LRUCache.OptionsBase.ttlResolution}\n     */\n    ttlResolution;\n    /**\n     * {@link LRUCache.OptionsBase.ttlAutopurge}\n     */\n    ttlAutopurge;\n    /**\n     * {@link LRUCache.OptionsBase.updateAgeOnGet}\n     */\n    updateAgeOnGet;\n    /**\n     * {@link LRUCache.OptionsBase.updateAgeOnHas}\n     */\n    updateAgeOnHas;\n    /**\n     * {@link LRUCache.OptionsBase.allowStale}\n     */\n    allowStale;\n    /**\n     * {@link LRUCache.OptionsBase.noDisposeOnSet}\n     */\n    noDisposeOnSet;\n    /**\n     * {@link LRUCache.OptionsBase.noUpdateTTL}\n     */\n    noUpdateTTL;\n    /**\n     * {@link LRUCache.OptionsBase.maxEntrySize}\n     */\n    maxEntrySize;\n    /**\n     * {@link LRUCache.OptionsBase.sizeCalculation}\n     */\n    sizeCalculation;\n    /**\n     * {@link LRUCache.OptionsBase.noDeleteOnFetchRejection}\n     */\n    noDeleteOnFetchRejection;\n    /**\n     * {@link LRUCache.OptionsBase.noDeleteOnStaleGet}\n     */\n    noDeleteOnStaleGet;\n    /**\n     * {@link LRUCache.OptionsBase.allowStaleOnFetchAbort}\n     */\n    allowStaleOnFetchAbort;\n    /**\n     * {@link LRUCache.OptionsBase.allowStaleOnFetchRejection}\n     */\n    allowStaleOnFetchRejection;\n    /**\n     * {@link LRUCache.OptionsBase.ignoreFetchAbort}\n     */\n    ignoreFetchAbort;\n    // computed properties\n    #size;\n    #calculatedSize;\n    #keyMap;\n    #keyList;\n    #valList;\n    #next;\n    #prev;\n    #head;\n    #tail;\n    #free;\n    #disposed;\n    #sizes;\n    #starts;\n    #ttls;\n    #hasDispose;\n    #hasFetchMethod;\n    #hasDisposeAfter;\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(c) {\n        return {\n            // properties\n            starts: c.#starts,\n            ttls: c.#ttls,\n            sizes: c.#sizes,\n            keyMap: c.#keyMap,\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) => c.#isBackgroundFetch(p),\n            backgroundFetch: (k, index, options, context) => c.#backgroundFetch(k, index, options, context),\n            moveToTail: (index) => c.#moveToTail(index),\n            indexes: (options) => c.#indexes(options),\n            rindexes: (options) => c.#rindexes(options),\n            isStale: (index) => c.#isStale(index),\n        };\n    }\n    // Protected read-only members\n    /**\n     * {@link LRUCache.OptionsBase.max} (read-only)\n     */\n    get max() {\n        return this.#max;\n    }\n    /**\n     * {@link LRUCache.OptionsBase.maxSize} (read-only)\n     */\n    get maxSize() {\n        return this.#maxSize;\n    }\n    /**\n     * The total computed size of items in the cache (read-only)\n     */\n    get calculatedSize() {\n        return this.#calculatedSize;\n    }\n    /**\n     * The number of items stored in the cache (read-only)\n     */\n    get size() {\n        return this.#size;\n    }\n    /**\n     * {@link LRUCache.OptionsBase.fetchMethod} (read-only)\n     */\n    get fetchMethod() {\n        return this.#fetchMethod;\n    }\n    get memoMethod() {\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.disposeAfter} (read-only)\n     */\n    get disposeAfter() {\n        return this.#disposeAfter;\n    }\n    constructor(options) {\n        const { max = 0, ttl, ttlResolution = 1, ttlAutopurge, updateAgeOnGet, updateAgeOnHas, allowStale, dispose, disposeAfter, noDisposeOnSet, noUpdateTTL, maxSize = 0, maxEntrySize = 0, sizeCalculation, fetchMethod, memoMethod, noDeleteOnFetchRejection, noDeleteOnStaleGet, allowStaleOnFetchRejection, allowStaleOnFetchAbort, ignoreFetchAbort, } = options;\n        if (max !== 0 && !isPosInt(max)) {\n            throw new TypeError('max option must be a nonnegative integer');\n        }\n        const UintArray = max ? getUintArray(max) : Array;\n        if (!UintArray) {\n            throw new Error('invalid max value: ' + max);\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('cannot set sizeCalculation without setting maxSize or maxEntrySize');\n            }\n            if (typeof this.sizeCalculation !== 'function') {\n                throw new TypeError('sizeCalculation set to non-function');\n            }\n        }\n        if (memoMethod !== undefined &&\n            typeof memoMethod !== 'function') {\n            throw new TypeError('memoMethod must be a function if defined');\n        }\n        this.#memoMethod = memoMethod;\n        if (fetchMethod !== undefined &&\n            typeof fetchMethod !== 'function') {\n            throw new TypeError('fetchMethod must be a function if specified');\n        }\n        this.#fetchMethod = fetchMethod;\n        this.#hasFetchMethod = !!fetchMethod;\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;\n        this.#tail = 0;\n        this.#free = Stack.create(max);\n        this.#size = 0;\n        this.#calculatedSize = 0;\n        if (typeof dispose === 'function') {\n            this.#dispose = dispose;\n        }\n        if (typeof disposeAfter === 'function') {\n            this.#disposeAfter = disposeAfter;\n            this.#disposed = [];\n        }\n        else {\n            this.#disposeAfter = undefined;\n            this.#disposed = undefined;\n        }\n        this.#hasDispose = !!this.#dispose;\n        this.#hasDisposeAfter = !!this.#disposeAfter;\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        // 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('maxSize must be a positive integer if specified');\n                }\n            }\n            if (!isPosInt(this.maxEntrySize)) {\n                throw new TypeError('maxEntrySize must be a positive integer if specified');\n            }\n            this.#initializeSizeTracking();\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\n                ? ttlResolution\n                : 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        // do not allow completely unbounded caches\n        if (this.#max === 0 && this.ttl === 0 && this.#maxSize === 0) {\n            throw new TypeError('At least one of max, maxSize, or ttl is required');\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 = '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     * 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) {\n        return this.#keyMap.has(key) ? Infinity : 0;\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        this.#setItemTTL = (index, ttl, start = perf.now()) => {\n            starts[index] = ttl !== 0 ? start : 0;\n            ttls[index] = ttl;\n            if (ttl !== 0 && this.ttlAutopurge) {\n                const t = setTimeout(() => {\n                    if (this.#isStale(index)) {\n                        this.#delete(this.#keyList[index], '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            }\n        };\n        this.#updateItemAge = index => {\n            starts[index] = ttls[index] !== 0 ? perf.now() : 0;\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)\n                    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        // 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 = 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        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        this.#isStale = index => {\n            const s = starts[index];\n            const t = ttls[index];\n            return !!t && !!s && (cachedNow || getNow()) - s > t;\n        };\n    }\n    // conditionally set private methods related to TTL\n    #updateItemAge = () => { };\n    #statusTTL = () => { };\n    #setItemTTL = () => { };\n    /* c8 ignore stop */\n    #isStale = () => false;\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];\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('sizeCalculation return invalid (expect positive integer)');\n                    }\n                }\n                else {\n                    throw new TypeError('invalid size value (must be positive integer). ' +\n                        'When maxSize or maxEntrySize is used, sizeCalculation ' +\n                        'or size must be set.');\n                }\n            }\n            return size;\n        };\n        this.#addItemSize = (index, size, status) => {\n            sizes[index] = size;\n            if (this.#maxSize) {\n                const maxSize = this.#maxSize - sizes[index];\n                while (this.#calculatedSize > maxSize) {\n                    this.#evict(true);\n                }\n            }\n            this.#calculatedSize += sizes[index];\n            if (status) {\n                status.entrySize = size;\n                status.totalCalculatedSize = this.#calculatedSize;\n            }\n        };\n    }\n    #removeItemSize = _i => { };\n    #addItemSize = (_i, _s, _st) => { };\n    #requireSize = (_k, _v, size, sizeCalculation) => {\n        if (size || sizeCalculation) {\n            throw new TypeError('cannot set size without setting maxSize or maxEntrySize on cache');\n        }\n        return 0;\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                }\n                else {\n                    i = this.#prev[i];\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                }\n                else {\n                    i = this.#next[i];\n                }\n            }\n        }\n    }\n    #isValidIndex(index) {\n        return (index !== undefined &&\n            this.#keyMap.get(this.#keyList[index]) === index);\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 (this.#valList[i] !== undefined &&\n                this.#keyList[i] !== undefined &&\n                !this.#isBackgroundFetch(this.#valList[i])) {\n                yield [this.#keyList[i], this.#valList[i]];\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 (this.#valList[i] !== undefined &&\n                this.#keyList[i] !== undefined &&\n                !this.#isBackgroundFetch(this.#valList[i])) {\n                yield [this.#keyList[i], this.#valList[i]];\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 &&\n                !this.#isBackgroundFetch(this.#valList[i])) {\n                yield k;\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 &&\n                !this.#isBackgroundFetch(this.#valList[i])) {\n                yield k;\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 &&\n                !this.#isBackgroundFetch(this.#valList[i])) {\n                yield this.#valList[i];\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 &&\n                !this.#isBackgroundFetch(this.#valList[i])) {\n                yield this.#valList[i];\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     * 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     * 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(fn, getOptions = {}) {\n        for (const i of this.#indexes()) {\n            const v = this.#valList[i];\n            const value = this.#isBackgroundFetch(v)\n                ? v.__staleWhileFetching\n                : v;\n            if (value === undefined)\n                continue;\n            if (fn(value, this.#keyList[i], this)) {\n                return this.get(this.#keyList[i], getOptions);\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(fn, thisp = this) {\n        for (const i of this.#indexes()) {\n            const v = this.#valList[i];\n            const value = this.#isBackgroundFetch(v)\n                ? v.__staleWhileFetching\n                : v;\n            if (value === undefined)\n                continue;\n            fn.call(thisp, value, this.#keyList[i], this);\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(fn, thisp = this) {\n        for (const i of this.#rindexes()) {\n            const v = this.#valList[i];\n            const value = this.#isBackgroundFetch(v)\n                ? v.__staleWhileFetching\n                : v;\n            if (value === undefined)\n                continue;\n            fn.call(thisp, value, this.#keyList[i], this);\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], 'expire');\n                deleted = true;\n            }\n        }\n        return deleted;\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) {\n        const i = this.#keyMap.get(key);\n        if (i === undefined)\n            return undefined;\n        const v = this.#valList[i];\n        const value = this.#isBackgroundFetch(v)\n            ? v.__staleWhileFetching\n            : v;\n        if (value === undefined)\n            return undefined;\n        const entry = { 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 - (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     * Return an array of [key, {@link LRUCache.Entry}] tuples which can be\n     * passed to {@link LRLUCache#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 = [];\n        for (const i of this.#indexes({ allowStale: true })) {\n            const key = this.#keyList[i];\n            const v = this.#valList[i];\n            const value = this.#isBackgroundFetch(v)\n                ? v.__staleWhileFetching\n                : v;\n            if (value === undefined || key === undefined)\n                continue;\n            const entry = { 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 = perf.now() - this.#starts[i];\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     * 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) {\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 = perf.now() - age;\n            }\n            this.set(key, entry.value, entry);\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(k, v, setOptions = {}) {\n        if (v === undefined) {\n            this.delete(k);\n            return this;\n        }\n        const { ttl = this.ttl, start, noDisposeOnSet = this.noDisposeOnSet, sizeCalculation = this.sizeCalculation, status, } = setOptions;\n        let { noUpdateTTL = this.noUpdateTTL } = setOptions;\n        const size = this.#requireSize(k, v, setOptions.size || 0, sizeCalculation);\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 = (this.#size === 0\n                ? this.#tail\n                : this.#free.length !== 0\n                    ? this.#free.pop()\n                    : this.#size === this.#max\n                        ? this.#evict(false)\n                        : this.#size);\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)\n                status.set = 'add';\n            noUpdateTTL = false;\n        }\n        else {\n            // update\n            this.#moveToTail(index);\n            const oldVal = this.#valList[index];\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, k, 'set');\n                        }\n                        if (this.#hasDisposeAfter) {\n                            this.#disposed?.push([s, k, 'set']);\n                        }\n                    }\n                }\n                else if (!noDisposeOnSet) {\n                    if (this.#hasDispose) {\n                        this.#dispose?.(oldVal, k, 'set');\n                    }\n                    if (this.#hasDisposeAfter) {\n                        this.#disposed?.push([oldVal, 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 = oldVal && this.#isBackgroundFetch(oldVal)\n                        ? oldVal.__staleWhileFetching\n                        : oldVal;\n                    if (oldValue !== undefined)\n                        status.oldValue = oldValue;\n                }\n            }\n            else if (status) {\n                status.set = 'update';\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)\n                this.#statusTTL(status, index);\n        }\n        if (!noDisposeOnSet && this.#hasDisposeAfter && this.#disposed) {\n            const dt = this.#disposed;\n            let task;\n            while ((task = dt?.shift())) {\n                this.#disposeAfter?.(...task);\n            }\n        }\n        return this;\n    }\n    /**\n     * Evict the least recently used item, returning its value or\n     * `undefined` if cache is empty.\n     */\n    pop() {\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                }\n                else if (val !== undefined) {\n                    return val;\n                }\n            }\n        }\n        finally {\n            if (this.#hasDisposeAfter && this.#disposed) {\n                const dt = this.#disposed;\n                let task;\n                while ((task = dt?.shift())) {\n                    this.#disposeAfter?.(...task);\n                }\n            }\n        }\n    }\n    #evict(free) {\n        const head = this.#head;\n        const k = this.#keyList[head];\n        const v = this.#valList[head];\n        if (this.#hasFetchMethod && this.#isBackgroundFetch(v)) {\n            v.__abortController.abort(new Error('evicted'));\n        }\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 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;\n            this.#free.length = 0;\n        }\n        else {\n            this.#head = this.#next[head];\n        }\n        this.#keyMap.delete(k);\n        this.#size--;\n        return head;\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, hasOptions = {}) {\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 (this.#isBackgroundFetch(v) &&\n                v.__staleWhileFetching === undefined) {\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            }\n            else if (status) {\n                status.has = 'stale';\n                this.#statusTTL(status, index);\n            }\n        }\n        else if (status) {\n            status.has = 'miss';\n        }\n        return false;\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, peekOptions = {}) {\n        const { allowStale = this.allowStale } = peekOptions;\n        const index = this.#keyMap.get(k);\n        if (index === undefined ||\n            (!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    #backgroundFetch(k, index, options, context) {\n        const v = index === undefined ? undefined : this.#valList[index];\n        if (this.#isBackgroundFetch(v)) {\n            return v;\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        const fetchOpts = {\n            signal: ac.signal,\n            options,\n            context,\n        };\n        const cb = (v, updateCache = false) => {\n            const { aborted } = ac.signal;\n            const ignoreAbort = options.ignoreFetchAbort && 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)\n                        options.status.fetchAbortIgnored = true;\n                }\n                else {\n                    options.status.fetchResolved = true;\n                }\n            }\n            if (aborted && !ignoreAbort && !updateCache) {\n                return fetchFail(ac.signal.reason);\n            }\n            // either we didn't abort, and are still here, or we did, and ignored\n            const bf = p;\n            if (this.#valList[index] === p) {\n                if (v === undefined) {\n                    if (bf.__staleWhileFetching) {\n                        this.#valList[index] = bf.__staleWhileFetching;\n                    }\n                    else {\n                        this.#delete(k, 'fetch');\n                    }\n                }\n                else {\n                    if (options.status)\n                        options.status.fetchUpdated = true;\n                    this.set(k, v, fetchOpts.options);\n                }\n            }\n            return v;\n        };\n        const eb = (er) => {\n            if (options.status) {\n                options.status.fetchRejected = true;\n                options.status.fetchError = er;\n            }\n            return fetchFail(er);\n        };\n        const fetchFail = (er) => {\n            const { aborted } = ac.signal;\n            const allowStaleAborted = aborted && options.allowStaleOnFetchAbort;\n            const allowStale = allowStaleAborted || options.allowStaleOnFetchRejection;\n            const noDelete = allowStale || options.noDeleteOnFetchRejection;\n            const bf = p;\n            if (this.#valList[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 || bf.__staleWhileFetching === undefined;\n                if (del) {\n                    this.#delete(k, 'fetch');\n                }\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] = 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            }\n            else if (bf.__returned === bf) {\n                throw er;\n            }\n        };\n        const pcall = (res, rej) => {\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 ||\n                    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        if (options.status)\n            options.status.fetchDispatched = true;\n        const p = new Promise(pcall).then(cb, eb);\n        const bf = Object.assign(p, {\n            __abortController: ac,\n            __staleWhileFetching: v,\n            __returned: undefined,\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        }\n        else {\n            this.#valList[index] = bf;\n        }\n        return bf;\n    }\n    #isBackgroundFetch(p) {\n        if (!this.#hasFetchMethod)\n            return false;\n        const b = p;\n        return (!!b &&\n            b instanceof Promise &&\n            b.hasOwnProperty('__staleWhileFetching') &&\n            b.__abortController instanceof AC);\n    }\n    async fetch(k, fetchOptions = {}) {\n        const { \n        // get options\n        allowStale = this.allowStale, updateAgeOnGet = this.updateAgeOnGet, noDeleteOnStaleGet = this.noDeleteOnStaleGet, \n        // set options\n        ttl = this.ttl, noDisposeOnSet = this.noDisposeOnSet, size = 0, sizeCalculation = this.sizeCalculation, noUpdateTTL = this.noUpdateTTL, \n        // fetch exclusive options\n        noDeleteOnFetchRejection = this.noDeleteOnFetchRejection, allowStaleOnFetchRejection = this.allowStaleOnFetchRejection, ignoreFetchAbort = this.ignoreFetchAbort, allowStaleOnFetchAbort = this.allowStaleOnFetchAbort, context, forceRefresh = false, status, signal, } = fetchOptions;\n        if (!this.#hasFetchMethod) {\n            if (status)\n                status.fetch = 'get';\n            return this.get(k, {\n                allowStale,\n                updateAgeOnGet,\n                noDeleteOnStaleGet,\n                status,\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        let index = this.#keyMap.get(k);\n        if (index === undefined) {\n            if (status)\n                status.fetch = 'miss';\n            const p = this.#backgroundFetch(k, index, options, context);\n            return (p.__returned = p);\n        }\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)\n                        status.returnedStale = true;\n                }\n                return stale ? v.__staleWhileFetching : (v.__returned = v);\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)\n                    status.fetch = 'hit';\n                this.#moveToTail(index);\n                if (updateAgeOnGet) {\n                    this.#updateItemAge(index);\n                }\n                if (status)\n                    this.#statusTTL(status, index);\n                return v;\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)\n                    status.returnedStale = true;\n            }\n            return staleVal ? p.__staleWhileFetching : (p.__returned = p);\n        }\n    }\n    async forceFetch(k, fetchOptions = {}) {\n        const v = await this.fetch(k, fetchOptions);\n        if (v === undefined)\n            throw new Error('fetch() returned undefined');\n        return v;\n    }\n    memo(k, memoOptions = {}) {\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)\n            return v;\n        const vv = memoMethod(k, v, {\n            options,\n            context,\n        });\n        this.set(k, vv, options);\n        return vv;\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, getOptions = {}) {\n        const { allowStale = this.allowStale, updateAgeOnGet = this.updateAgeOnGet, noDeleteOnStaleGet = this.noDeleteOnStaleGet, status, } = 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)\n                this.#statusTTL(status, index);\n            if (this.#isStale(index)) {\n                if (status)\n                    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)\n                        status.returnedStale = true;\n                    return allowStale ? value : undefined;\n                }\n                else {\n                    if (status &&\n                        allowStale &&\n                        value.__staleWhileFetching !== undefined) {\n                        status.returnedStale = true;\n                    }\n                    return allowStale ? value.__staleWhileFetching : undefined;\n                }\n            }\n            else {\n                if (status)\n                    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        }\n        else if (status) {\n            status.get = 'miss';\n        }\n    }\n    #connect(p, n) {\n        this.#prev[n] = p;\n        this.#next[p] = n;\n    }\n    #moveToTail(index) {\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];\n            }\n            else {\n                this.#connect(this.#prev[index], this.#next[index]);\n            }\n            this.#connect(this.#tail, index);\n            this.#tail = index;\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) {\n        return this.#delete(k, 'delete');\n    }\n    #delete(k, reason) {\n        let deleted = false;\n        if (this.#size !== 0) {\n            const index = this.#keyMap.get(k);\n            if (index !== undefined) {\n                deleted = true;\n                if (this.#size === 1) {\n                    this.#clear(reason);\n                }\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                    }\n                    else if (this.#hasDispose || this.#hasDisposeAfter) {\n                        if (this.#hasDispose) {\n                            this.#dispose?.(v, k, reason);\n                        }\n                        if (this.#hasDisposeAfter) {\n                            this.#disposed?.push([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];\n                    }\n                    else if (index === this.#head) {\n                        this.#head = this.#next[index];\n                    }\n                    else {\n                        const pi = this.#prev[index];\n                        this.#next[pi] = this.#next[index];\n                        const ni = this.#next[index];\n                        this.#prev[ni] = this.#prev[index];\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;\n            while ((task = dt?.shift())) {\n                this.#disposeAfter?.(...task);\n            }\n        }\n        return deleted;\n    }\n    /**\n     * Clear the cache entirely, throwing away all values.\n     */\n    clear() {\n        return this.#clear('delete');\n    }\n    #clear(reason) {\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            }\n            else {\n                const k = this.#keyList[index];\n                if (this.#hasDispose) {\n                    this.#dispose?.(v, k, reason);\n                }\n                if (this.#hasDisposeAfter) {\n                    this.#disposed?.push([v, k, reason]);\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        }\n        if (this.#sizes) {\n            this.#sizes.fill(0);\n        }\n        this.#head = 0;\n        this.#tail = 0;\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;\n            while ((task = dt?.shift())) {\n                this.#disposeAfter?.(...task);\n            }\n        }\n    }\n}\n//# sourceMappingURL=index.js.map","const proc = 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 * Return true if the argument is a Minipass stream, Node stream, or something\n * else that Minipass can interact with.\n */\nexport const isStream = (s) => !!s &&\n    typeof s === 'object' &&\n    (s instanceof Minipass ||\n        s instanceof Stream ||\n        isReadable(s) ||\n        isWritable(s));\n/**\n * Return true if the argument is a valid {@link Minipass.Readable}\n */\nexport const isReadable = (s) => !!s &&\n    typeof s === 'object' &&\n    s instanceof EventEmitter &&\n    typeof s.pipe === 'function' &&\n    // node core Writable streams have a pipe() method, but it throws\n    s.pipe !== Stream.Writable.prototype.pipe;\n/**\n * Return true if the argument is a valid {@link Minipass.Writable}\n */\nexport const isWritable = (s) => !!s &&\n    typeof s === 'object' &&\n    s instanceof EventEmitter &&\n    typeof s.write === 'function' &&\n    typeof s.end === 'function';\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');\nconst defer = (fn) => Promise.resolve().then(fn);\nconst nodefer = (fn) => fn();\nconst isEndish = (ev) => ev === 'end' || ev === 'finish' || ev === 'prefinish';\nconst isArrayBufferLike = (b) => b instanceof ArrayBuffer ||\n    (!!b &&\n        typeof b === 'object' &&\n        b.constructor &&\n        b.constructor.name === 'ArrayBuffer' &&\n        b.byteLength >= 0);\nconst isArrayBufferView = (b) => !Buffer.isBuffer(b) && ArrayBuffer.isView(b);\n/**\n * Internal class representing a pipe to a destination stream.\n *\n * @internal\n */\nclass Pipe {\n    src;\n    dest;\n    opts;\n    ondrain;\n    constructor(src, dest, opts) {\n        this.src = src;\n        this.dest = dest;\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) { }\n    /* c8 ignore stop */\n    end() {\n        this.unpipe();\n        if (this.opts.end)\n            this.dest.end();\n    }\n}\n/**\n * Internal class representing a pipe to a destination stream where\n * errors are proxied.\n *\n * @internal\n */\nclass PipeProxyErrors extends Pipe {\n    unpipe() {\n        this.src.removeListener('error', this.proxyErrors);\n        super.unpipe();\n    }\n    constructor(src, dest, opts) {\n        super(src, dest, opts);\n        this.proxyErrors = er => dest.emit('error', er);\n        src.on('error', this.proxyErrors);\n    }\n}\nconst isObjectModeOptions = (o) => !!o.objectMode;\nconst isEncodingOptions = (o) => !o.objectMode && !!o.encoding && o.encoding !== 'buffer';\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 extends EventEmitter {\n    [FLOWING] = false;\n    [PAUSED] = false;\n    [PIPES] = [];\n    [BUFFER] = [];\n    [OBJECTMODE];\n    [ENCODING];\n    [ASYNC];\n    [DECODER];\n    [EOF] = false;\n    [EMITTED_END] = false;\n    [EMITTING_END] = false;\n    [CLOSED] = false;\n    [EMITTED_ERROR] = null;\n    [BUFFERLENGTH] = 0;\n    [DESTROYED] = false;\n    [SIGNAL];\n    [ABORTED] = false;\n    [DATALISTENERS] = 0;\n    [DISCARDED] = false;\n    /**\n     * true if the stream can be written\n     */\n    writable = true;\n    /**\n     * true if the stream can be read\n     */\n    readable = true;\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(...args) {\n        const options = (args[0] ||\n            {});\n        super();\n        if (options.objectMode && typeof options.encoding === 'string') {\n            throw new TypeError('Encoding and objectMode may not be used together');\n        }\n        if (isObjectModeOptions(options)) {\n            this[OBJECTMODE] = true;\n            this[ENCODING] = null;\n        }\n        else if (isEncodingOptions(options)) {\n            this[ENCODING] = options.encoding;\n            this[OBJECTMODE] = false;\n        }\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])\n            : null;\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        const { signal } = options;\n        if (signal) {\n            this[SIGNAL] = signal;\n            if (signal.aborted) {\n                this[ABORT]();\n            }\n            else {\n                signal.addEventListener('abort', () => this[ABORT]());\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     * The `BufferEncoding` currently in use, or `null`\n     */\n    get encoding() {\n        return this[ENCODING];\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     * @deprecated - Encoding may only be set at instantiation time\n     */\n    setEncoding(_enc) {\n        throw new Error('Encoding must be set at instantiation time');\n    }\n    /**\n     * True if this is an objectMode stream\n     */\n    get objectMode() {\n        return this[OBJECTMODE];\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     * true if this is an async stream\n     */\n    get ['async']() {\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) {\n        this[ASYNC] = this[ASYNC] || !!a;\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     * 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    write(chunk, encoding, cb) {\n        if (this[ABORTED])\n            return false;\n        if (this[EOF])\n            throw new Error('write after end');\n        if (this[DESTROYED]) {\n            this.emit('error', Object.assign(new Error('Cannot call write after a stream was destroyed'), { code: 'ERR_STREAM_DESTROYED' }));\n            return true;\n        }\n        if (typeof encoding === 'function') {\n            cb = encoding;\n            encoding = 'utf8';\n        }\n        if (!encoding)\n            encoding = 'utf8';\n        const fn = this[ASYNC] ? defer : nodefer;\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(chunk.buffer, chunk.byteOffset, chunk.byteLength);\n            }\n            else if (isArrayBufferLike(chunk)) {\n                //@ts-ignore - sinful unsafe type changing\n                chunk = Buffer.from(chunk);\n            }\n            else if (typeof chunk !== 'string') {\n                throw new Error('Non-contiguous data written to non-objectMode stream');\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)\n                this[FLUSH](true);\n            /* c8 ignore stop */\n            if (this[FLOWING])\n                this.emit('data', chunk);\n            else\n                this[BUFFERPUSH](chunk);\n            if (this[BUFFERLENGTH] !== 0)\n                this.emit('readable');\n            if (cb)\n                fn(cb);\n            return this[FLOWING];\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.length) {\n            if (this[BUFFERLENGTH] !== 0)\n                this.emit('readable');\n            if (cb)\n                fn(cb);\n            return this[FLOWING];\n        }\n        // fast-path writing strings of same encoding to a stream with\n        // an empty buffer, skipping the buffer/decoder dance\n        if (typeof chunk === 'string' &&\n            // unless it is a string already ready for us to use\n            !(encoding === this[ENCODING] && !this[DECODER]?.lastNeed)) {\n            //@ts-ignore - sinful unsafe type change\n            chunk = Buffer.from(chunk, encoding);\n        }\n        if (Buffer.isBuffer(chunk) && this[ENCODING]) {\n            //@ts-ignore - sinful unsafe type change\n            chunk = this[DECODER].write(chunk);\n        }\n        // Note: flushing CAN potentially switch us into not-flowing mode\n        if (this[FLOWING] && this[BUFFERLENGTH] !== 0)\n            this[FLUSH](true);\n        if (this[FLOWING])\n            this.emit('data', chunk);\n        else\n            this[BUFFERPUSH](chunk);\n        if (this[BUFFERLENGTH] !== 0)\n            this.emit('readable');\n        if (cb)\n            fn(cb);\n        return this[FLOWING];\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) {\n        if (this[DESTROYED])\n            return null;\n        this[DISCARDED] = false;\n        if (this[BUFFERLENGTH] === 0 ||\n            n === 0 ||\n            (n && n > this[BUFFERLENGTH])) {\n            this[MAYBE_EMIT_END]();\n            return null;\n        }\n        if (this[OBJECTMODE])\n            n = null;\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(this[BUFFER], this[BUFFERLENGTH])),\n            ];\n        }\n        const ret = this[READ](n || null, this[BUFFER][0]);\n        this[MAYBE_EMIT_END]();\n        return ret;\n    }\n    [READ](n, chunk) {\n        if (this[OBJECTMODE])\n            this[BUFFERSHIFT]();\n        else {\n            const c = chunk;\n            if (n === c.length || n === null)\n                this[BUFFERSHIFT]();\n            else if (typeof c === 'string') {\n                this[BUFFER][0] = c.slice(n);\n                chunk = c.slice(0, n);\n                this[BUFFERLENGTH] -= n;\n            }\n            else {\n                this[BUFFER][0] = c.subarray(n);\n                chunk = c.subarray(0, n);\n                this[BUFFERLENGTH] -= n;\n            }\n        }\n        this.emit('data', chunk);\n        if (!this[BUFFER].length && !this[EOF])\n            this.emit('drain');\n        return chunk;\n    }\n    end(chunk, encoding, cb) {\n        if (typeof chunk === 'function') {\n            cb = chunk;\n            chunk = undefined;\n        }\n        if (typeof encoding === 'function') {\n            cb = encoding;\n            encoding = 'utf8';\n        }\n        if (chunk !== undefined)\n            this.write(chunk, encoding);\n        if (cb)\n            this.once('end', cb);\n        this[EOF] = true;\n        this.writable = false;\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])\n            this[MAYBE_EMIT_END]();\n        return this;\n    }\n    // don't let the internal resume be overwritten\n    [RESUME]() {\n        if (this[DESTROYED])\n            return;\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)\n            this[FLUSH]();\n        else if (this[EOF])\n            this[MAYBE_EMIT_END]();\n        else\n            this.emit('drain');\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     * Pause the stream\n     */\n    pause() {\n        this[FLOWING] = false;\n        this[PAUSED] = true;\n        this[DISCARDED] = false;\n    }\n    /**\n     * true if the stream has been forcibly destroyed\n     */\n    get destroyed() {\n        return this[DESTROYED];\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     * true if the stream is currently in a paused state\n     */\n    get paused() {\n        return this[PAUSED];\n    }\n    [BUFFERPUSH](chunk) {\n        if (this[OBJECTMODE])\n            this[BUFFERLENGTH] += 1;\n        else\n            this[BUFFERLENGTH] += chunk.length;\n        this[BUFFER].push(chunk);\n    }\n    [BUFFERSHIFT]() {\n        if (this[OBJECTMODE])\n            this[BUFFERLENGTH] -= 1;\n        else\n            this[BUFFERLENGTH] -= this[BUFFER][0].length;\n        return this[BUFFER].shift();\n    }\n    [FLUSH](noDrain = false) {\n        do { } while (this[FLUSHCHUNK](this[BUFFERSHIFT]()) &&\n            this[BUFFER].length);\n        if (!noDrain && !this[BUFFER].length && !this[EOF])\n            this.emit('drain');\n    }\n    [FLUSHCHUNK](chunk) {\n        this.emit('data', chunk);\n        return this[FLOWING];\n    }\n    /**\n     * Pipe all data emitted by this stream into the destination provided.\n     *\n     * Triggers the flow of data.\n     */\n    pipe(dest, opts) {\n        if (this[DESTROYED])\n            return dest;\n        this[DISCARDED] = false;\n        const ended = this[EMITTED_END];\n        opts = opts || {};\n        if (dest === proc.stdout || dest === proc.stderr)\n            opts.end = false;\n        else\n            opts.end = opts.end !== false;\n        opts.proxyErrors = !!opts.proxyErrors;\n        // piping an ended stream ends immediately\n        if (ended) {\n            if (opts.end)\n                dest.end();\n        }\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(!opts.proxyErrors\n                ? new Pipe(this, dest, opts)\n                : new PipeProxyErrors(this, dest, opts));\n            if (this[ASYNC])\n                defer(() => this[RESUME]());\n            else\n                this[RESUME]();\n        }\n        return dest;\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(dest) {\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            }\n            else\n                this[PIPES].splice(this[PIPES].indexOf(p), 1);\n            p.unpipe();\n        }\n    }\n    /**\n     * Alias for {@link Minipass#on}\n     */\n    addListener(ev, handler) {\n        return this.on(ev, handler);\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(ev, handler) {\n        const ret = super.on(ev, handler);\n        if (ev === 'data') {\n            this[DISCARDED] = false;\n            this[DATALISTENERS]++;\n            if (!this[PIPES].length && !this[FLOWING]) {\n                this[RESUME]();\n            }\n        }\n        else if (ev === 'readable' && this[BUFFERLENGTH] !== 0) {\n            super.emit('readable');\n        }\n        else if (isEndish(ev) && this[EMITTED_END]) {\n            super.emit(ev);\n            this.removeAllListeners(ev);\n        }\n        else if (ev === 'error' && this[EMITTED_ERROR]) {\n            const h = handler;\n            if (this[ASYNC])\n                defer(() => h.call(this, this[EMITTED_ERROR]));\n            else\n                h.call(this, this[EMITTED_ERROR]);\n        }\n        return ret;\n    }\n    /**\n     * Alias for {@link Minipass#off}\n     */\n    removeListener(ev, handler) {\n        return this.off(ev, handler);\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(ev, handler) {\n        const ret = super.off(ev, handler);\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 (this[DATALISTENERS] === 0 &&\n                !this[DISCARDED] &&\n                !this[PIPES].length) {\n                this[FLOWING] = false;\n            }\n        }\n        return ret;\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(ev) {\n        const ret = super.removeAllListeners(ev);\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     * true if the 'end' event has been emitted\n     */\n    get emittedEnd() {\n        return this[EMITTED_END];\n    }\n    [MAYBE_EMIT_END]() {\n        if (!this[EMITTING_END] &&\n            !this[EMITTED_END] &&\n            !this[DESTROYED] &&\n            this[BUFFER].length === 0 &&\n            this[EOF]) {\n            this[EMITTING_END] = true;\n            this.emit('end');\n            this.emit('prefinish');\n            this.emit('finish');\n            if (this[CLOSED])\n                this.emit('close');\n            this[EMITTING_END] = false;\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(ev, ...args) {\n        const data = args[0];\n        // error and close are only events allowed after calling destroy()\n        if (ev !== 'error' &&\n            ev !== 'close' &&\n            ev !== DESTROYED &&\n            this[DESTROYED]) {\n            return false;\n        }\n        else if (ev === 'data') {\n            return !this[OBJECTMODE] && !data\n                ? false\n                : this[ASYNC]\n                    ? (defer(() => this[EMITDATA](data)), true)\n                    : this[EMITDATA](data);\n        }\n        else if (ev === 'end') {\n            return this[EMITEND]();\n        }\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])\n                return false;\n            const ret = super.emit('close');\n            this.removeAllListeners('close');\n            return ret;\n        }\n        else if (ev === 'error') {\n            this[EMITTED_ERROR] = data;\n            super.emit(ERROR, data);\n            const ret = !this[SIGNAL] || this.listeners('error').length\n                ? super.emit('error', data)\n                : false;\n            this[MAYBE_EMIT_END]();\n            return ret;\n        }\n        else if (ev === 'resume') {\n            const ret = super.emit('resume');\n            this[MAYBE_EMIT_END]();\n            return ret;\n        }\n        else if (ev === 'finish' || ev === 'prefinish') {\n            const ret = super.emit(ev);\n            this.removeAllListeners(ev);\n            return ret;\n        }\n        // Some other unknown event\n        const ret = super.emit(ev, ...args);\n        this[MAYBE_EMIT_END]();\n        return ret;\n    }\n    [EMITDATA](data) {\n        for (const p of this[PIPES]) {\n            if (p.dest.write(data) === false)\n                this.pause();\n        }\n        const ret = this[DISCARDED] ? false : super.emit('data', data);\n        this[MAYBE_EMIT_END]();\n        return ret;\n    }\n    [EMITEND]() {\n        if (this[EMITTED_END])\n            return false;\n        this[EMITTED_END] = true;\n        this.readable = false;\n        return this[ASYNC]\n            ? (defer(() => this[EMITEND2]()), true)\n            : this[EMITEND2]();\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);\n                }\n                if (!this[DISCARDED])\n                    super.emit('data', data);\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     * Return a Promise that resolves to an array of all emitted data once\n     * the stream ends.\n     */\n    async collect() {\n        const buf = Object.assign([], {\n            dataLength: 0,\n        });\n        if (!this[OBJECTMODE])\n            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.length;\n        });\n        await p;\n        return buf;\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() {\n        if (this[OBJECTMODE]) {\n            throw new Error('cannot concat in objectMode');\n        }\n        const buf = await this.collect();\n        return (this[ENCODING]\n            ? buf.join('')\n            : Buffer.concat(buf, buf.dataLength));\n    }\n    /**\n     * Return a void Promise that resolves once the stream ends.\n     */\n    async promise() {\n        return new Promise((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     * Asynchronous `for await of` iteration.\n     *\n     * This will continue emitting all chunks until the stream terminates.\n     */\n    [Symbol.asyncIterator]() {\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 () => {\n            this.pause();\n            stopped = true;\n            return { value: undefined, done: true };\n        };\n        const next = () => {\n            if (stopped)\n                return stop();\n            const res = this.read();\n            if (res !== null)\n                return Promise.resolve({ done: false, value: res });\n            if (this[EOF])\n                return stop();\n            let resolve;\n            let reject;\n            const onerr = (er) => {\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) => {\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((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        return {\n            next,\n            throw: stop,\n            return: stop,\n            [Symbol.asyncIterator]() {\n                return this;\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]() {\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 = () => {\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        const next = () => {\n            if (stopped)\n                return stop();\n            const value = this.read();\n            return value === null ? stop() : { done: false, value };\n        };\n        this.once('end', stop);\n        this.once(ERROR, stop);\n        this.once(DESTROYED, stop);\n        return {\n            next,\n            throw: stop,\n            return: stop,\n            [Symbol.iterator]() {\n                return this;\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) {\n        if (this[DESTROYED]) {\n            if (er)\n                this.emit('error', er);\n            else\n                this.emit(DESTROYED);\n            return this;\n        }\n        this[DESTROYED] = true;\n        this[DISCARDED] = true;\n        // throw away all buffered data, it's never coming out\n        this[BUFFER].length = 0;\n        this[BUFFERLENGTH] = 0;\n        const wc = this;\n        if (typeof wc.close === 'function' && !this[CLOSED])\n            wc.close();\n        if (er)\n            this.emit('error', er);\n        // if no error to emit, still reject pending promises\n        else\n            this.emit(DESTROYED);\n        return this;\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//# sourceMappingURL=index.js.map","import { LRUCache } from 'lru-cache';\nimport { posix, win32 } from 'node:path';\nimport { fileURLToPath } from 'node:url';\nimport { lstatSync, readdir as readdirCB, readdirSync, readlinkSync, realpathSync as rps, } from 'fs';\nimport * as actualFS from 'node:fs';\nconst realpathSync = rps.native;\n// TODO: test perf of fs/promises realpath vs realpathCB,\n// since the promises one uses realpath.native\nimport { lstat, readdir, readlink, realpath } from 'node:fs/promises';\nimport { Minipass } from 'minipass';\nconst defaultFS = {\n    lstatSync,\n    readdir: readdirCB,\n    readdirSync,\n    readlinkSync,\n    realpathSync,\n    promises: {\n        lstat,\n        readdir,\n        readlink,\n        realpath,\n    },\n};\n// if they just gave us require('fs') then use our default\nconst fsFromOption = (fsOption) => !fsOption || fsOption === defaultFS || fsOption === actualFS ?\n    defaultFS\n    : {\n        ...defaultFS,\n        ...fsOption,\n        promises: {\n            ...defaultFS.promises,\n            ...(fsOption.promises || {}),\n        },\n    };\n// turn something like //?/c:/ into c:\\\nconst uncDriveRegexp = /^\\\\\\\\\\?\\\\([a-z]:)\\\\?$/i;\nconst uncToDrive = (rootPath) => rootPath.replace(/\\//g, '\\\\').replace(uncDriveRegexp, '$1\\\\');\n// windows paths are separated by either / or \\\nconst eitherSep = /[\\\\\\/]/;\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// mask to unset low 4 bits\nconst IFMT_UNKNOWN = ~IFMT;\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;\nconst ENOCHILD = ENOTDIR | ENOENT | ENOREALPATH;\nconst TYPEMASK = 0b0011_1111_1111;\nconst entToType = (s) => 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// normalize unicode path names\nconst normalizeCache = new Map();\nconst normalize = (s) => {\n    const c = normalizeCache.get(s);\n    if (c)\n        return c;\n    const n = s.normalize('NFKD');\n    normalizeCache.set(s, n);\n    return n;\n};\nconst normalizeNocaseCache = new Map();\nconst normalizeNocase = (s) => {\n    const c = normalizeNocaseCache.get(s);\n    if (c)\n        return c;\n    const n = normalize(s.toLowerCase());\n    normalizeNocaseCache.set(s, n);\n    return n;\n};\n/**\n * An LRUCache for storing resolved path strings or Path objects.\n * @internal\n */\nexport class ResolveCache extends LRUCache {\n    constructor() {\n        super({ max: 256 });\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 * an LRUCache for storing child entries.\n * @internal\n */\nexport class ChildrenCache extends LRUCache {\n    constructor(maxSize = 16 * 1024) {\n        super({\n            maxSize,\n            // parent + children\n            sizeCalculation: a => a.length + 1,\n        });\n    }\n}\nconst setAsCwd = Symbol('PathScurry setAsCwd');\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 class PathBase {\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;\n    /**\n     * the Path entry corresponding to the path root.\n     *\n     * @internal\n     */\n    root;\n    /**\n     * All roots found within the current PathScurry family\n     *\n     * @internal\n     */\n    roots;\n    /**\n     * a reference to the parent path, or undefined in the case of root entries\n     *\n     * @internal\n     */\n    parent;\n    /**\n     * boolean indicating whether paths are compared case-insensitively\n     * @internal\n     */\n    nocase;\n    /**\n     * boolean indicating that this path is the current working directory\n     * of the PathScurry collection that contains it.\n     */\n    isCWD = false;\n    // potential default fs override\n    #fs;\n    // Stats fields\n    #dev;\n    get dev() {\n        return this.#dev;\n    }\n    #mode;\n    get mode() {\n        return this.#mode;\n    }\n    #nlink;\n    get nlink() {\n        return this.#nlink;\n    }\n    #uid;\n    get uid() {\n        return this.#uid;\n    }\n    #gid;\n    get gid() {\n        return this.#gid;\n    }\n    #rdev;\n    get rdev() {\n        return this.#rdev;\n    }\n    #blksize;\n    get blksize() {\n        return this.#blksize;\n    }\n    #ino;\n    get ino() {\n        return this.#ino;\n    }\n    #size;\n    get size() {\n        return this.#size;\n    }\n    #blocks;\n    get blocks() {\n        return this.#blocks;\n    }\n    #atimeMs;\n    get atimeMs() {\n        return this.#atimeMs;\n    }\n    #mtimeMs;\n    get mtimeMs() {\n        return this.#mtimeMs;\n    }\n    #ctimeMs;\n    get ctimeMs() {\n        return this.#ctimeMs;\n    }\n    #birthtimeMs;\n    get birthtimeMs() {\n        return this.#birthtimeMs;\n    }\n    #atime;\n    get atime() {\n        return this.#atime;\n    }\n    #mtime;\n    get mtime() {\n        return this.#mtime;\n    }\n    #ctime;\n    get ctime() {\n        return this.#ctime;\n    }\n    #birthtime;\n    get birthtime() {\n        return this.#birthtime;\n    }\n    #matchName;\n    #depth;\n    #fullpath;\n    #fullpathPosix;\n    #relative;\n    #relativePosix;\n    #type;\n    #children;\n    #linkTarget;\n    #realpath;\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() {\n        return (this.parent || this).fullpath();\n    }\n    /**\n     * Deprecated alias for Dirent['parentPath'] Somewhat counterintuitively,\n     * this property refers to the *parent* path, not the path object itself.\n     */\n    get path() {\n        return this.parentPath;\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(name, type = UNKNOWN, root, roots, nocase, children, opts) {\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        }\n        else {\n            this.#fs = fsFromOption(opts.fs);\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() {\n        if (this.#depth !== undefined)\n            return this.#depth;\n        if (!this.parent)\n            return (this.#depth = 0);\n        return (this.#depth = this.parent.depth() + 1);\n    }\n    /**\n     * @internal\n     */\n    childrenCache() {\n        return this.#children;\n    }\n    /**\n     * Get the Path object referenced by the string path, resolved from this Path\n     */\n    resolve(path) {\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 = rootPath ?\n            this.getRoot(rootPath).#resolveParts(dirParts)\n            : this.#resolveParts(dirParts);\n        return result;\n    }\n    #resolveParts(dirParts) {\n        let p = this;\n        for (const part of dirParts) {\n            p = p.child(part);\n        }\n        return p;\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() {\n        const cached = this.#children.get(this);\n        if (cached) {\n            return cached;\n        }\n        const children = Object.assign([], { provisional: 0 });\n        this.#children.set(this, children);\n        this.#type &= ~READDIR_CALLED;\n        return children;\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, opts) {\n        if (pathPart === '' || pathPart === '.') {\n            return this;\n        }\n        if (pathPart === '..') {\n            return this.parent || this;\n        }\n        // find the child\n        const children = this.children();\n        const name = this.nocase ? normalizeNocase(pathPart) : normalize(pathPart);\n        for (const p of children) {\n            if (p.#matchName === name) {\n                return p;\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 = this.#fullpath ? this.#fullpath + s + pathPart : undefined;\n        const pchild = this.newChild(pathPart, UNKNOWN, {\n            ...opts,\n            parent: this,\n            fullpath,\n        });\n        if (!this.canReaddir()) {\n            pchild.#type |= ENOENT;\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     * 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() {\n        if (this.isCWD)\n            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     * 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() {\n        if (this.sep === '/')\n            return this.relative();\n        if (this.isCWD)\n            return '';\n        if (this.#relativePosix !== undefined)\n            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     * The fully resolved path string for this Path entry\n     */\n    fullpath() {\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     * 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() {\n        if (this.#fullpathPosix !== undefined)\n            return this.#fullpathPosix;\n        if (this.sep === '/')\n            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            }\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     * 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() {\n        return (this.#type & IFMT) === UNKNOWN;\n    }\n    isType(type) {\n        return this[`is${type}`]();\n    }\n    getType() {\n        return (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        /* c8 ignore stop */\n    }\n    /**\n     * Is the Path a regular file?\n     */\n    isFile() {\n        return (this.#type & IFMT) === IFREG;\n    }\n    /**\n     * Is the Path a directory?\n     */\n    isDirectory() {\n        return (this.#type & IFMT) === IFDIR;\n    }\n    /**\n     * Is the path a character device?\n     */\n    isCharacterDevice() {\n        return (this.#type & IFMT) === IFCHR;\n    }\n    /**\n     * Is the path a block device?\n     */\n    isBlockDevice() {\n        return (this.#type & IFMT) === IFBLK;\n    }\n    /**\n     * Is the path a FIFO pipe?\n     */\n    isFIFO() {\n        return (this.#type & IFMT) === IFIFO;\n    }\n    /**\n     * Is the path a socket?\n     */\n    isSocket() {\n        return (this.#type & IFMT) === IFSOCK;\n    }\n    /**\n     * Is the path a symbolic link?\n     */\n    isSymbolicLink() {\n        return (this.#type & IFLNK) === IFLNK;\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() {\n        return this.#type & LSTAT_CALLED ? this : undefined;\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() {\n        return this.#linkTarget;\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() {\n        return this.#realpath;\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() {\n        const children = this.children();\n        return children.slice(0, children.provisional);\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() {\n        if (this.#linkTarget)\n            return true;\n        if (!this.parent)\n            return false;\n        // cases where it cannot possibly succeed\n        const ifmt = this.#type & IFMT;\n        return !((ifmt !== UNKNOWN && ifmt !== IFLNK) ||\n            this.#type & ENOREADLINK ||\n            this.#type & ENOENT);\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() {\n        return !!(this.#type & READDIR_CALLED);\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() {\n        return !!(this.#type & ENOENT);\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) {\n        return !this.nocase ?\n            this.#matchName === normalize(n)\n            : this.#matchName === normalizeNocase(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() {\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        }\n        catch (er) {\n            this.#readlinkFail(er.code);\n            return undefined;\n        }\n    }\n    /**\n     * Synchronous {@link PathBase.readlink}\n     */\n    readlinkSync() {\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        }\n        catch (er) {\n            this.#readlinkFail(er.code);\n            return undefined;\n        }\n    }\n    #readdirSuccess(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)\n                c.#markENOENT();\n        }\n    }\n    #markENOENT() {\n        // mark as UNKNOWN and ENOENT\n        if (this.#type & ENOENT)\n            return;\n        this.#type = (this.#type | ENOENT) & IFMT_UNKNOWN;\n        this.#markChildrenENOENT();\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    #markENOREALPATH() {\n        this.#type |= ENOREALPATH;\n        this.#markENOTDIR();\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)\n            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)\n            t &= IFMT_UNKNOWN;\n        this.#type = t | ENOTDIR;\n        this.#markChildrenENOENT();\n    }\n    #readdirFail(code = '') {\n        // markENOTDIR and markENOENT also set provisional=0\n        if (code === 'ENOTDIR' || code === 'EPERM') {\n            this.#markENOTDIR();\n        }\n        else if (code === 'ENOENT') {\n            this.#markENOENT();\n        }\n        else {\n            this.children().provisional = 0;\n        }\n    }\n    #lstatFail(code = '') {\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;\n            p.#markENOTDIR();\n        }\n        else if (code === 'ENOENT') {\n            /* c8 ignore stop */\n            this.#markENOENT();\n        }\n    }\n    #readlinkFail(code = '') {\n        let ter = this.#type;\n        ter |= ENOREADLINK;\n        if (code === 'ENOENT')\n            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    #readdirAddChild(e, c) {\n        return (this.#readdirMaybePromoteChild(e, c) ||\n            this.#readdirAddNewChild(e, c));\n    }\n    #readdirAddNewChild(e, c) {\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    #readdirMaybePromoteChild(e, c) {\n        for (let p = c.provisional; p < c.length; p++) {\n            const pchild = c[p];\n            const name = this.nocase ? normalizeNocase(e.name) : normalize(e.name);\n            if (name !== pchild.#matchName) {\n                continue;\n            }\n            return this.#readdirPromoteChild(e, pchild, p, c);\n        }\n    }\n    #readdirPromoteChild(e, p, index, c) {\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)\n            p.name = e.name;\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)\n                c.pop();\n            else\n                c.splice(index, 1);\n            c.unshift(p);\n        }\n        c.provisional++;\n        return p;\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() {\n        if ((this.#type & ENOENT) === 0) {\n            try {\n                this.#applyStat(await this.#fs.promises.lstat(this.fullpath()));\n                return this;\n            }\n            catch (er) {\n                this.#lstatFail(er.code);\n            }\n        }\n    }\n    /**\n     * synchronous {@link PathBase.lstat}\n     */\n    lstatSync() {\n        if ((this.#type & ENOENT) === 0) {\n            try {\n                this.#applyStat(this.#fs.lstatSync(this.fullpath()));\n                return this;\n            }\n            catch (er) {\n                this.#lstatFail(er.code);\n            }\n        }\n    }\n    #applyStat(st) {\n        const { atime, atimeMs, birthtime, birthtimeMs, blksize, blocks, ctime, ctimeMs, dev, gid, ino, mode, mtime, mtimeMs, nlink, rdev, size, uid, } = 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    #onReaddirCB = [];\n    #readdirCBInFlight = false;\n    #callOnReaddirCB(children) {\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     * 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(cb, allowZalgo = false) {\n        if (!this.canReaddir()) {\n            if (allowZalgo)\n                cb(null, []);\n            else\n                queueMicrotask(() => cb(null, []));\n            return;\n        }\n        const children = this.children();\n        if (this.calledReaddir()) {\n            const c = children.slice(0, children.provisional);\n            if (allowZalgo)\n                cb(null, c);\n            else\n                queueMicrotask(() => cb(null, c));\n            return;\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        // 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.code);\n                children.provisional = 0;\n            }\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    #asyncReaddirInFlight;\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() {\n        if (!this.canReaddir()) {\n            return [];\n        }\n        const children = this.children();\n        if (this.calledReaddir()) {\n            return children.slice(0, children.provisional);\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        }\n        else {\n            /* c8 ignore start */\n            let resolve = () => { };\n            /* c8 ignore stop */\n            this.#asyncReaddirInFlight = new Promise(res => (resolve = res));\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            }\n            catch (er) {\n                this.#readdirFail(er.code);\n                children.provisional = 0;\n            }\n            this.#asyncReaddirInFlight = undefined;\n            resolve();\n        }\n        return children.slice(0, children.provisional);\n    }\n    /**\n     * synchronous {@link PathBase.readdir}\n     */\n    readdirSync() {\n        if (!this.canReaddir()) {\n            return [];\n        }\n        const children = this.children();\n        if (this.calledReaddir()) {\n            return children.slice(0, children.provisional);\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        }\n        catch (er) {\n            this.#readdirFail(er.code);\n            children.provisional = 0;\n        }\n        return children.slice(0, children.provisional);\n    }\n    canReaddir() {\n        if (this.#type & ENOCHILD)\n            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    shouldWalk(dirs, walkFilter) {\n        return ((this.#type & IFDIR) === IFDIR &&\n            !(this.#type & ENOCHILD) &&\n            !dirs.has(this) &&\n            (!walkFilter || walkFilter(this)));\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() {\n        if (this.#realpath)\n            return this.#realpath;\n        if ((ENOREALPATH | ENOREADLINK | ENOENT) & this.#type)\n            return undefined;\n        try {\n            const rp = await this.#fs.promises.realpath(this.fullpath());\n            return (this.#realpath = this.resolve(rp));\n        }\n        catch (_) {\n            this.#markENOREALPATH();\n        }\n    }\n    /**\n     * Synchronous {@link realpath}\n     */\n    realpathSync() {\n        if (this.#realpath)\n            return this.#realpath;\n        if ((ENOREALPATH | ENOREADLINK | ENOENT) & this.#type)\n            return undefined;\n        try {\n            const rp = this.#fs.realpathSync(this.fullpath());\n            return (this.#realpath = this.resolve(rp));\n        }\n        catch (_) {\n            this.#markENOREALPATH();\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) {\n        if (oldCwd === this)\n            return;\n        oldCwd.isCWD = false;\n        this.isCWD = true;\n        const changed = new Set([]);\n        let rp = [];\n        let p = 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 * 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 = eitherSep;\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(name, type = UNKNOWN, root, roots, nocase, children, opts) {\n        super(name, type, root, roots, nocase, children, opts);\n    }\n    /**\n     * @internal\n     */\n    newChild(name, type = UNKNOWN, opts = {}) {\n        return new PathWin32(name, type, this.root, this.roots, this.nocase, this.childrenCache(), opts);\n    }\n    /**\n     * @internal\n     */\n    getRootString(path) {\n        return win32.parse(path).root;\n    }\n    /**\n     * @internal\n     */\n    getRoot(rootPath) {\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(rootPath, this).root);\n    }\n    /**\n     * @internal\n     */\n    sameRoot(rootPath, compare = this.root.name) {\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 * 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     * 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(name, type = UNKNOWN, root, roots, nocase, children, opts) {\n        super(name, type, root, roots, nocase, children, opts);\n    }\n    /**\n     * @internal\n     */\n    getRootString(path) {\n        return path.startsWith('/') ? '/' : '';\n    }\n    /**\n     * @internal\n     */\n    getRoot(_rootPath) {\n        return this.root;\n    }\n    /**\n     * @internal\n     */\n    newChild(name, type = UNKNOWN, opts = {}) {\n        return new PathPosix(name, type, this.root, this.roots, this.nocase, this.childrenCache(), opts);\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 class PathScurryBase {\n    /**\n     * The root Path entry for the current working directory of this Scurry\n     */\n    root;\n    /**\n     * The string path for the root of this Scurry's current working directory\n     */\n    rootPath;\n    /**\n     * A collection of all roots encountered, referenced by rootPath\n     */\n    roots;\n    /**\n     * The Path entry corresponding to this PathScurry's current working directory.\n     */\n    cwd;\n    #resolveCache;\n    #resolvePosixCache;\n    #children;\n    /**\n     * Perform path comparisons case-insensitively.\n     *\n     * Defaults true on Darwin and Windows systems, false elsewhere.\n     */\n    nocase;\n    #fs;\n    /**\n     * This class should not be instantiated directly.\n     *\n     * Use PathScurryWin32, PathScurryDarwin, PathScurryPosix, or PathScurry\n     *\n     * @internal\n     */\n    constructor(cwd = process.cwd(), pathImpl, sep, { nocase, childrenCacheSize = 16 * 1024, fs = defaultFS, } = {}) {\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        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('must provide nocase setting to PathScurryBase ctor');\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 = 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     * Get the depth of a provided path, string, or the cwd\n     */\n    depth(path = this.cwd) {\n        if (typeof path === 'string') {\n            path = this.cwd.resolve(path);\n        }\n        return path.depth();\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     * 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) {\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 === '.')\n                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     * 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) {\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 === '.')\n                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     * find the relative path from the cwd to the supplied path string or entry\n     */\n    relative(entry = this.cwd) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\n        return entry.relative();\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 = this.cwd) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\n        return entry.relativePosix();\n    }\n    /**\n     * Return the basename for the provided string or Path object\n     */\n    basename(entry = this.cwd) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\n        return entry.name;\n    }\n    /**\n     * Return the dirname for the provided string or Path object\n     */\n    dirname(entry = this.cwd) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\n        return (entry.parent || entry).fullpath();\n    }\n    async readdir(entry = this.cwd, opts = {\n        withFileTypes: true,\n    }) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\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        }\n        else {\n            const p = await entry.readdir();\n            return withFileTypes ? p : p.map(e => e.name);\n        }\n    }\n    readdirSync(entry = this.cwd, opts = {\n        withFileTypes: true,\n    }) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\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        }\n        else if (withFileTypes) {\n            return entry.readdirSync();\n        }\n        else {\n            return entry.readdirSync().map(e => e.name);\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(entry = this.cwd) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\n        return entry.lstat();\n    }\n    /**\n     * synchronous {@link PathScurryBase.lstat}\n     */\n    lstatSync(entry = this.cwd) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\n        return entry.lstatSync();\n    }\n    async readlink(entry = this.cwd, { withFileTypes } = {\n        withFileTypes: false,\n    }) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\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    readlinkSync(entry = this.cwd, { withFileTypes } = {\n        withFileTypes: false,\n    }) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\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    async realpath(entry = this.cwd, { withFileTypes } = {\n        withFileTypes: false,\n    }) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\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    realpathSync(entry = this.cwd, { withFileTypes } = {\n        withFileTypes: false,\n    }) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\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    async walk(entry = this.cwd, opts = {}) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\n        else if (!(entry instanceof PathBase)) {\n            opts = entry;\n            entry = this.cwd;\n        }\n        const { withFileTypes = true, follow = false, filter, walkFilter, } = opts;\n        const results = [];\n        if (!filter || filter(entry)) {\n            results.push(withFileTypes ? entry : entry.fullpath());\n        }\n        const dirs = new Set();\n        const walk = (dir, cb) => {\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)\n                    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 => r?.shouldWalk(dirs, walkFilter) ? walk(r, next) : next());\n                    }\n                    else {\n                        if (e.shouldWalk(dirs, walkFilter)) {\n                            walk(e, next);\n                        }\n                        else {\n                            next();\n                        }\n                    }\n                }\n            }, true); // zalgooooooo\n        };\n        const start = entry;\n        return new Promise((res, rej) => {\n            walk(start, er => {\n                /* c8 ignore start */\n                if (er)\n                    return rej(er);\n                /* c8 ignore stop */\n                res(results);\n            });\n        });\n    }\n    walkSync(entry = this.cwd, opts = {}) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\n        else if (!(entry instanceof PathBase)) {\n            opts = entry;\n            entry = this.cwd;\n        }\n        const { withFileTypes = true, follow = false, filter, walkFilter, } = opts;\n        const results = [];\n        if (!filter || filter(entry)) {\n            results.push(withFileTypes ? entry : entry.fullpath());\n        }\n        const dirs = new Set([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 = e;\n                if (e.isSymbolicLink()) {\n                    if (!(follow && (r = e.realpathSync())))\n                        continue;\n                    if (r.isUnknown())\n                        r.lstatSync();\n                }\n                if (r.shouldWalk(dirs, walkFilter)) {\n                    dirs.add(r);\n                }\n            }\n        }\n        return results;\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    iterate(entry = this.cwd, options = {}) {\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        }\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     * 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    *iterateSync(entry = this.cwd, opts = {}) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\n        else if (!(entry instanceof PathBase)) {\n            opts = entry;\n            entry = this.cwd;\n        }\n        const { withFileTypes = true, follow = false, filter, walkFilter, } = opts;\n        if (!filter || filter(entry)) {\n            yield withFileTypes ? entry : entry.fullpath();\n        }\n        const dirs = new Set([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 = e;\n                if (e.isSymbolicLink()) {\n                    if (!(follow && (r = e.realpathSync())))\n                        continue;\n                    if (r.isUnknown())\n                        r.lstatSync();\n                }\n                if (r.shouldWalk(dirs, walkFilter)) {\n                    dirs.add(r);\n                }\n            }\n        }\n    }\n    stream(entry = this.cwd, opts = {}) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\n        else if (!(entry instanceof PathBase)) {\n            opts = entry;\n            entry = this.cwd;\n        }\n        const { withFileTypes = true, follow = false, filter, walkFilter, } = opts;\n        const results = new Minipass({ objectMode: true });\n        if (!filter || filter(entry)) {\n            results.write(withFileTypes ? entry : entry.fullpath());\n        }\n        const dirs = new Set();\n        const queue = [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)\n                        results.end();\n                    return;\n                }\n                processing++;\n                dirs.add(dir);\n                const onReaddir = (er, entries, didRealpaths = false) => {\n                    /* c8 ignore start */\n                    if (er)\n                        return results.emit('error', er);\n                    /* c8 ignore stop */\n                    if (follow && !didRealpaths) {\n                        const promises = [];\n                        for (const e of entries) {\n                            if (e.isSymbolicLink()) {\n                                promises.push(e\n                                    .realpath()\n                                    .then((r) => r?.isUnknown() ? r.lstat() : r));\n                            }\n                        }\n                        if (promises.length) {\n                            Promise.all(promises).then(() => onReaddir(null, entries, true));\n                            return;\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                    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                    }\n                    else if (!sync) {\n                        process();\n                    }\n                };\n                // zalgo containment\n                let sync = true;\n                dir.readdirCB(onReaddir, true);\n                sync = false;\n            }\n        };\n        process();\n        return results;\n    }\n    streamSync(entry = this.cwd, opts = {}) {\n        if (typeof entry === 'string') {\n            entry = this.cwd.resolve(entry);\n        }\n        else if (!(entry instanceof PathBase)) {\n            opts = entry;\n            entry = this.cwd;\n        }\n        const { withFileTypes = true, follow = false, filter, walkFilter, } = opts;\n        const results = new Minipass({ objectMode: true });\n        const dirs = new Set();\n        if (!filter || filter(entry)) {\n            results.write(withFileTypes ? entry : entry.fullpath());\n        }\n        const queue = [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)\n                        results.end();\n                    return;\n                }\n                processing++;\n                dirs.add(dir);\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 = e;\n                    if (e.isSymbolicLink()) {\n                        if (!(follow && (r = e.realpathSync())))\n                            continue;\n                        if (r.isUnknown())\n                            r.lstatSync();\n                    }\n                    if (r.shouldWalk(dirs, walkFilter)) {\n                        queue.push(r);\n                    }\n                }\n            }\n            if (paused && !results.flowing)\n                results.once('drain', process);\n        };\n        process();\n        return results;\n    }\n    chdir(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 * 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    constructor(cwd = process.cwd(), opts = {}) {\n        const { nocase = true } = opts;\n        super(cwd, win32, '\\\\', { ...opts, nocase });\n        this.nocase = nocase;\n        for (let p = this.cwd; p; p = p.parent) {\n            p.nocase = this.nocase;\n        }\n    }\n    /**\n     * @internal\n     */\n    parseRootPath(dir) {\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     * @internal\n     */\n    newRoot(fs) {\n        return new PathWin32(this.rootPath, IFDIR, undefined, this.roots, this.nocase, this.childrenCache(), { fs });\n    }\n    /**\n     * Return true if the provided path string is an absolute path\n     */\n    isAbsolute(p) {\n        return (p.startsWith('/') || p.startsWith('\\\\') || /^[a-z]:(\\/|\\\\)/i.test(p));\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(cwd = process.cwd(), opts = {}) {\n        const { nocase = false } = opts;\n        super(cwd, posix, '/', { ...opts, nocase });\n        this.nocase = nocase;\n    }\n    /**\n     * @internal\n     */\n    parseRootPath(_dir) {\n        return '/';\n    }\n    /**\n     * @internal\n     */\n    newRoot(fs) {\n        return new PathPosix(this.rootPath, IFDIR, undefined, this.roots, this.nocase, this.childrenCache(), { fs });\n    }\n    /**\n     * Return true if the provided path string is an absolute path\n     */\n    isAbsolute(p) {\n        return p.startsWith('/');\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(cwd = process.cwd(), opts = {}) {\n        const { nocase = true } = opts;\n        super(cwd, { ...opts, nocase });\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;\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 = process.platform === 'win32' ? PathScurryWin32\n    : process.platform === 'darwin' ? PathScurryDarwin\n        : PathScurryPosix;\n//# sourceMappingURL=index.js.map","// this is just a very light wrapper around 2 arrays with an offset index\nimport { GLOBSTAR } from 'minimatch';\nconst isPatternList = (pl) => pl.length >= 1;\nconst isGlobList = (gl) => gl.length >= 1;\n/**\n * An immutable-ish view on an array of glob parts and their parsed\n * results\n */\nexport class Pattern {\n    #patternList;\n    #globList;\n    #index;\n    length;\n    #platform;\n    #rest;\n    #globString;\n    #isDrive;\n    #isUNC;\n    #isAbsolute;\n    #followGlobstar = true;\n    constructor(patternList, globList, index, platform) {\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        // 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            }\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 + '/';\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     * The first entry in the parsed list of patterns\n     */\n    pattern() {\n        return this.#patternList[this.#index];\n    }\n    /**\n     * true of if pattern() returns a string\n     */\n    isString() {\n        return typeof this.#patternList[this.#index] === 'string';\n    }\n    /**\n     * true of if pattern() returns GLOBSTAR\n     */\n    isGlobstar() {\n        return this.#patternList[this.#index] === GLOBSTAR;\n    }\n    /**\n     * true if pattern() returns a regexp\n     */\n    isRegExp() {\n        return this.#patternList[this.#index] instanceof RegExp;\n    }\n    /**\n     * The /-joined set of glob parts that make up this pattern\n     */\n    globString() {\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     * true if there are more pattern parts after this one\n     */\n    hasMore() {\n        return this.length > this.#index + 1;\n    }\n    /**\n     * The rest of the pattern after this part, or null if this is the end\n     */\n    rest() {\n        if (this.#rest !== undefined)\n            return this.#rest;\n        if (!this.hasMore())\n            return (this.#rest = null);\n        this.#rest = new Pattern(this.#patternList, this.#globList, this.#index + 1, this.#platform);\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     * true if the pattern represents a //unc/path/ on windows\n     */\n    isUNC() {\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    // 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() {\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    // 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() {\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     * consume the root of the pattern, and return it\n     */\n    root() {\n        const p = this.#patternList[0];\n        return (typeof p === 'string' && this.isAbsolute() && this.#index === 0) ?\n            p\n            : '';\n    }\n    /**\n     * Check to see if the current globstar pattern is allowed to follow\n     * a symbolic link.\n     */\n    checkFollowGlobstar() {\n        return !(this.#index === 0 ||\n            !this.isGlobstar() ||\n            !this.#followGlobstar);\n    }\n    /**\n     * Mark that the current globstar pattern is following a symbolic link\n     */\n    markFollowGlobstar() {\n        if (this.#index === 0 || !this.isGlobstar() || !this.#followGlobstar)\n            return false;\n        this.#followGlobstar = false;\n        return true;\n    }\n}\n//# sourceMappingURL=pattern.js.map","// 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\nimport { Minimatch } from 'minimatch';\nimport { Pattern } from './pattern.js';\nconst defaultPlatform = (typeof process === 'object' &&\n    process &&\n    typeof process.platform === 'string') ?\n    process.platform\n    : 'linux';\n/**\n * Class used to process ignored patterns\n */\nexport class Ignore {\n    relative;\n    relativeChildren;\n    absolute;\n    absoluteChildren;\n    platform;\n    mmopts;\n    constructor(ignored, { nobrace, nocase, noext, noglobstar, platform = defaultPlatform, }) {\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)\n            this.add(ign);\n    }\n    add(ign) {\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)\n                this.absolute.push(m);\n            else\n                this.relative.push(m);\n            if (children) {\n                if (absolute)\n                    this.absoluteChildren.push(m);\n                else\n                    this.relativeChildren.push(m);\n            }\n        }\n    }\n    ignored(p) {\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))\n                return true;\n        }\n        for (const m of this.absolute) {\n            if (m.match(fullpath) || m.match(fullpaths))\n                return true;\n        }\n        return false;\n    }\n    childrenIgnored(p) {\n        const fullpath = p.fullpath() + '/';\n        const relative = (p.relative() || '.') + '/';\n        for (const m of this.relativeChildren) {\n            if (m.match(relative))\n                return true;\n        }\n        for (const m of this.absoluteChildren) {\n            if (m.match(fullpath))\n                return true;\n        }\n        return false;\n    }\n}\n//# sourceMappingURL=ignore.js.map","// synchronous utility for filtering entries and calculating subwalks\nimport { GLOBSTAR } from 'minimatch';\n/**\n * A cache of which patterns have been processed for a given Path\n */\nexport class HasWalkedCache {\n    store;\n    constructor(store = new Map()) {\n        this.store = store;\n    }\n    copy() {\n        return new HasWalkedCache(new Map(this.store));\n    }\n    hasWalked(target, pattern) {\n        return this.store.get(target.fullpath())?.has(pattern.globString());\n    }\n    storeWalked(target, pattern) {\n        const fullpath = target.fullpath();\n        const cached = this.store.get(fullpath);\n        if (cached)\n            cached.add(pattern.globString());\n        else\n            this.store.set(fullpath, new Set([pattern.globString()]));\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 = new Map();\n    add(target, absolute, ifDir) {\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() {\n        return [...this.store.entries()].map(([path, n]) => [\n            path,\n            !!(n & 2),\n            !!(n & 1),\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 = new Map();\n    add(target, 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        }\n        else\n            this.store.set(target, [pattern]);\n    }\n    get(target) {\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() {\n        return this.keys().map(k => [k, this.store.get(k)]);\n    }\n    keys() {\n        return [...this.store.keys()].filter(t => t.canReaddir());\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;\n    matches = new MatchRecord();\n    subwalks = new SubWalks();\n    patterns;\n    follow;\n    dot;\n    opts;\n    constructor(opts, 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    processPatterns(target, patterns) {\n        this.patterns = patterns;\n        const processingSet = patterns.map(p => [target, p]);\n        // map of paths to the magic-starting subwalks they need to walk\n        // first item in patterns is the filter\n        for (let [t, pattern] of processingSet) {\n            this.hasWalkedCache.storeWalked(t, pattern);\n            const root = pattern.root();\n            const absolute = pattern.isAbsolute() && this.opts.absolute !== false;\n            // start absolute patterns at root\n            if (root) {\n                t = t.resolve(root === '/' && this.opts.root !== undefined ?\n                    this.opts.root\n                    : root);\n                const rest = pattern.rest();\n                if (!rest) {\n                    this.matches.add(t, true, false);\n                    continue;\n                }\n                else {\n                    pattern = rest;\n                }\n            }\n            if (t.isENOENT())\n                continue;\n            let p;\n            let rest;\n            let changed = false;\n            while (typeof (p = pattern.pattern()) === 'string' &&\n                (rest = pattern.rest())) {\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))\n                    continue;\n                this.hasWalkedCache.storeWalked(t, pattern);\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            }\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 (!t.isSymbolicLink() ||\n                    this.follow ||\n                    pattern.checkFollowGlobstar()) {\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                }\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)\n                            this.matches.add(tp, absolute, true);\n                        else if (!this.hasWalkedCache.hasWalked(tp, rrest)) {\n                            this.subwalks.add(tp, rrest);\n                        }\n                    }\n                }\n            }\n            else if (p instanceof RegExp) {\n                this.subwalks.add(t, pattern);\n            }\n        }\n        return this;\n    }\n    subwalkTargets() {\n        return this.subwalks.keys();\n    }\n    child() {\n        return new Processor(this.opts, this.hasWalkedCache);\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, entries) {\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                }\n                else if (p instanceof RegExp) {\n                    results.testRegExp(e, p, rest, absolute);\n                }\n                else {\n                    results.testString(e, p, rest, absolute);\n                }\n            }\n        }\n        return results;\n    }\n    testGlobstar(e, pattern, rest, absolute) {\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                }\n                else if (e.isSymbolicLink()) {\n                    if (rest && pattern.checkFollowGlobstar()) {\n                        this.subwalks.add(e, rest);\n                    }\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 (typeof rp === 'string' &&\n                // dots and empty were handled already\n                rp !== '..' &&\n                rp !== '' &&\n                rp !== '.') {\n                this.testString(e, rp, rest.rest(), absolute);\n            }\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            }\n            else if (rp instanceof RegExp) {\n                this.testRegExp(e, rp, rest.rest(), absolute);\n            }\n        }\n    }\n    testRegExp(e, p, rest, absolute) {\n        if (!p.test(e.name))\n            return;\n        if (!rest) {\n            this.matches.add(e, absolute, false);\n        }\n        else {\n            this.subwalks.add(e, rest);\n        }\n    }\n    testString(e, p, rest, absolute) {\n        // should never happen?\n        if (!e.isNamed(p))\n            return;\n        if (!rest) {\n            this.matches.add(e, absolute, false);\n        }\n        else {\n            this.subwalks.add(e, rest);\n        }\n    }\n}\n//# sourceMappingURL=processor.js.map","/**\n * Single-use utility classes to provide functionality to the {@link Glob}\n * methods.\n *\n * @module\n */\nimport { Minipass } from 'minipass';\nimport { Ignore } from './ignore.js';\nimport { Processor } from './processor.js';\nconst makeIgnore = (ignore, opts) => typeof ignore === 'string' ? new Ignore([ignore], opts)\n    : Array.isArray(ignore) ? new Ignore(ignore, opts)\n        : ignore;\n/**\n * basic walking utilities that all the glob walker types use\n */\nexport class GlobUtil {\n    path;\n    patterns;\n    opts;\n    seen = new Set();\n    paused = false;\n    aborted = false;\n    #onResume = [];\n    #ignore;\n    #sep;\n    signal;\n    maxDepth;\n    includeChildMatches;\n    constructor(patterns, path, opts) {\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 (!this.includeChildMatches &&\n                typeof this.#ignore.add !== 'function') {\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    #ignored(path) {\n        return this.seen.has(path) || !!this.#ignore?.ignored?.(path);\n    }\n    #childrenIgnored(path) {\n        return !!this.#ignore?.childrenIgnored?.(path);\n    }\n    // backpressure mechanism\n    pause() {\n        this.paused = true;\n    }\n    resume() {\n        /* c8 ignore start */\n        if (this.signal?.aborted)\n            return;\n        /* c8 ignore stop */\n        this.paused = false;\n        let fn = undefined;\n        while (!this.paused && (fn = this.#onResume.shift())) {\n            fn();\n        }\n    }\n    onResume(fn) {\n        if (this.signal?.aborted)\n            return;\n        /* c8 ignore start */\n        if (!this.paused) {\n            fn();\n        }\n        else {\n            /* c8 ignore stop */\n            this.#onResume.push(fn);\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, ifDir) {\n        if (ifDir && this.opts.nodir)\n            return undefined;\n        let rpc;\n        if (this.opts.realpath) {\n            rpc = e.realpathCached() || (await e.realpath());\n            if (!rpc)\n                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    matchCheckTest(e, ifDir) {\n        return (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            e\n            : undefined;\n    }\n    matchCheckSync(e, ifDir) {\n        if (ifDir && this.opts.nodir)\n            return undefined;\n        let rpc;\n        if (this.opts.realpath) {\n            rpc = e.realpathCached() || e.realpathSync();\n            if (!rpc)\n                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    matchFinish(e, absolute) {\n        if (this.#ignored(e))\n            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 = 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        }\n        else if (abs) {\n            const abs = this.opts.posix ? e.fullpathPosix() : e.fullpath();\n            this.matchEmit(abs + mark);\n        }\n        else {\n            const rel = this.opts.posix ? e.relativePosix() : e.relative();\n            const pre = this.opts.dotRelative && !rel.startsWith('..' + this.#sep) ?\n                '.' + this.#sep\n                : '';\n            this.matchEmit(!rel ? '.' + mark : pre + rel + mark);\n        }\n    }\n    async match(e, absolute, ifDir) {\n        const p = await this.matchCheck(e, ifDir);\n        if (p)\n            this.matchFinish(p, absolute);\n    }\n    matchSync(e, absolute, ifDir) {\n        const p = this.matchCheckSync(e, ifDir);\n        if (p)\n            this.matchFinish(p, absolute);\n    }\n    walkCB(target, patterns, cb) {\n        /* c8 ignore start */\n        if (this.signal?.aborted)\n            cb();\n        /* c8 ignore stop */\n        this.walkCB2(target, patterns, new Processor(this.opts), cb);\n    }\n    walkCB2(target, patterns, processor, cb) {\n        if (this.#childrenIgnored(target))\n            return cb();\n        if (this.signal?.aborted)\n            cb();\n        if (this.paused) {\n            this.onResume(() => this.walkCB2(target, patterns, processor, cb));\n            return;\n        }\n        processor.processPatterns(target, patterns);\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)\n                cb();\n        };\n        for (const [m, absolute, ifDir] of processor.matches.entries()) {\n            if (this.#ignored(m))\n                continue;\n            tasks++;\n            this.match(m, absolute, ifDir).then(() => next());\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((_, entries) => this.walkCB3(t, entries, processor, next), true);\n            }\n        }\n        next();\n    }\n    walkCB3(target, entries, processor, cb) {\n        processor = processor.filterEntries(target, entries);\n        let tasks = 1;\n        const next = () => {\n            if (--tasks === 0)\n                cb();\n        };\n        for (const [m, absolute, ifDir] of processor.matches.entries()) {\n            if (this.#ignored(m))\n                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        next();\n    }\n    walkCBSync(target, patterns, cb) {\n        /* c8 ignore start */\n        if (this.signal?.aborted)\n            cb();\n        /* c8 ignore stop */\n        this.walkCB2Sync(target, patterns, new Processor(this.opts), cb);\n    }\n    walkCB2Sync(target, patterns, processor, cb) {\n        if (this.#childrenIgnored(target))\n            return cb();\n        if (this.signal?.aborted)\n            cb();\n        if (this.paused) {\n            this.onResume(() => this.walkCB2Sync(target, patterns, processor, cb));\n            return;\n        }\n        processor.processPatterns(target, patterns);\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)\n                cb();\n        };\n        for (const [m, absolute, ifDir] of processor.matches.entries()) {\n            if (this.#ignored(m))\n                continue;\n            this.matchSync(m, absolute, ifDir);\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        next();\n    }\n    walkCB3Sync(target, entries, processor, cb) {\n        processor = processor.filterEntries(target, entries);\n        let tasks = 1;\n        const next = () => {\n            if (--tasks === 0)\n                cb();\n        };\n        for (const [m, absolute, ifDir] of processor.matches.entries()) {\n            if (this.#ignored(m))\n                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        next();\n    }\n}\nexport class GlobWalker extends GlobUtil {\n    matches = new Set();\n    constructor(patterns, path, opts) {\n        super(patterns, path, opts);\n    }\n    matchEmit(e) {\n        this.matches.add(e);\n    }\n    async walk() {\n        if (this.signal?.aborted)\n            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                }\n                else {\n                    res(this.matches);\n                }\n            });\n        });\n        return this.matches;\n    }\n    walkSync() {\n        if (this.signal?.aborted)\n            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)\n                throw this.signal.reason;\n        });\n        return this.matches;\n    }\n}\nexport class GlobStream extends GlobUtil {\n    results;\n    constructor(patterns, path, opts) {\n        super(patterns, path, opts);\n        this.results = new Minipass({\n            signal: this.signal,\n            objectMode: true,\n        });\n        this.results.on('drain', () => this.resume());\n        this.results.on('resume', () => this.resume());\n    }\n    matchEmit(e) {\n        this.results.write(e);\n        if (!this.results.flowing)\n            this.pause();\n    }\n    stream() {\n        const target = this.path;\n        if (target.isUnknown()) {\n            target.lstat().then(() => {\n                this.walkCB(target, this.patterns, () => this.results.end());\n            });\n        }\n        else {\n            this.walkCB(target, this.patterns, () => this.results.end());\n        }\n        return this.results;\n    }\n    streamSync() {\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//# sourceMappingURL=walker.js.map","import { Minimatch } from 'minimatch';\nimport { fileURLToPath } from 'node:url';\nimport { PathScurry, PathScurryDarwin, PathScurryPosix, PathScurryWin32, } from 'path-scurry';\nimport { Pattern } from './pattern.js';\nimport { GlobStream, GlobWalker } from './walker.js';\n// if no process global, just call it linux.\n// so we default to case-sensitive, / separators\nconst defaultPlatform = (typeof process === 'object' &&\n    process &&\n    typeof process.platform === 'string') ?\n    process.platform\n    : 'linux';\n/**\n * An object that can perform glob pattern traversals.\n */\nexport class Glob {\n    absolute;\n    cwd;\n    root;\n    dot;\n    dotRelative;\n    follow;\n    ignore;\n    magicalBraces;\n    mark;\n    matchBase;\n    maxDepth;\n    nobrace;\n    nocase;\n    nodir;\n    noext;\n    noglobstar;\n    pattern;\n    platform;\n    realpath;\n    scurry;\n    stat;\n    signal;\n    windowsPathsNoEscape;\n    withFileTypes;\n    includeChildMatches;\n    /**\n     * The options provided to the constructor.\n     */\n    opts;\n    /**\n     * An array of parsed immutable {@link Pattern} objects.\n     */\n    patterns;\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, opts) {\n        /* c8 ignore start */\n        if (!opts)\n            throw new TypeError('glob options required');\n        /* c8 ignore stop */\n        this.withFileTypes = !!opts.withFileTypes;\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        }\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        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        if (this.withFileTypes && this.absolute !== undefined) {\n            throw new Error('cannot set absolute and withFileTypes:true');\n        }\n        if (typeof pattern === 'string') {\n            pattern = [pattern];\n        }\n        this.windowsPathsNoEscape =\n            !!opts.windowsPathsNoEscape ||\n                opts.allowWindowsEscape ===\n                    false;\n        if (this.windowsPathsNoEscape) {\n            pattern = pattern.map(p => p.replace(/\\\\/g, '/'));\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        this.pattern = pattern;\n        this.platform = opts.platform || defaultPlatform;\n        this.opts = { ...opts, platform: this.platform };\n        if (opts.scurry) {\n            this.scurry = opts.scurry;\n            if (opts.nocase !== undefined &&\n                opts.nocase !== opts.scurry.nocase) {\n                throw new Error('nocase option contradicts provided scurry option');\n            }\n        }\n        else {\n            const Scurry = 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        // 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 = this.platform === 'darwin' || this.platform === 'win32';\n        const mmo = {\n            // default nocase based on platform\n            ...opts,\n            dot: this.dot,\n            matchBase: this.matchBase,\n            nobrace: this.nobrace,\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        const mms = this.pattern.map(p => new Minimatch(p, mmo));\n        const [matchSet, globParts] = mms.reduce((set, m) => {\n            set[0].push(...m.set);\n            set[1].push(...m.globParts);\n            return set;\n        }, [[], []]);\n        this.patterns = matchSet.map((set, i) => {\n            const g = globParts[i];\n            /* c8 ignore start */\n            if (!g)\n                throw new Error('invalid pattern object');\n            /* c8 ignore stop */\n            return new Pattern(set, g, 0, this.platform);\n        });\n    }\n    async walk() {\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: 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    walkSync() {\n        return [\n            ...new GlobWalker(this.patterns, this.scurry.cwd, {\n                ...this.opts,\n                maxDepth: 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    stream() {\n        return new GlobStream(this.patterns, this.scurry.cwd, {\n            ...this.opts,\n            maxDepth: 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    streamSync() {\n        return new GlobStream(this.patterns, this.scurry.cwd, {\n            ...this.opts,\n            maxDepth: 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     * Default sync iteration function. Returns a Generator that\n     * iterates over the results.\n     */\n    iterateSync() {\n        return this.streamSync()[Symbol.iterator]();\n    }\n    [Symbol.iterator]() {\n        return this.iterateSync();\n    }\n    /**\n     * Default async iteration function. Returns an AsyncGenerator that\n     * iterates over the results.\n     */\n    iterate() {\n        return this.stream()[Symbol.asyncIterator]();\n    }\n    [Symbol.asyncIterator]() {\n        return this.iterate();\n    }\n}\n//# sourceMappingURL=glob.js.map","import { Minimatch } from 'minimatch';\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 = (pattern, options = {}) => {\n    if (!Array.isArray(pattern)) {\n        pattern = [pattern];\n    }\n    for (const p of pattern) {\n        if (new Minimatch(p, options).hasMagic())\n            return true;\n    }\n    return false;\n};\n//# sourceMappingURL=has-magic.js.map","import { escape, unescape } from 'minimatch';\nimport { Glob } from './glob.js';\nimport { hasMagic } from './has-magic.js';\nexport { escape, unescape } from 'minimatch';\nexport { Glob } from './glob.js';\nexport { hasMagic } from './has-magic.js';\nexport { Ignore } from './ignore.js';\nexport function globStreamSync(pattern, options = {}) {\n    return new Glob(pattern, options).streamSync();\n}\nexport function globStream(pattern, options = {}) {\n    return new Glob(pattern, options).stream();\n}\nexport function globSync(pattern, options = {}) {\n    return new Glob(pattern, options).walkSync();\n}\nasync function glob_(pattern, options = {}) {\n    return new Glob(pattern, options).walk();\n}\nexport function globIterateSync(pattern, options = {}) {\n    return new Glob(pattern, options).iterateSync();\n}\nexport function globIterate(pattern, options = {}) {\n    return new Glob(pattern, options).iterate();\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});\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//# sourceMappingURL=index.js.map","import { readFile } from \"node:fs/promises\";\nimport { dirname, join } from \"node:path\";\nimport { exists } from \"@/filesystem.js\";\nimport { tryParseJson } from \"@/json.js\";\nimport { findUp } from \"find-up\";\nimport { glob } from \"glob\";\n\n/**\n * Finds the root directory of a monorepo\n *\n * @param startDir - The directory to start searching from\n * @returns The root directory of the monorepo or null if not found\n * @example\n * import { findMonoRepoRoot } from \"@settlemint/sdk-utils/filesystem\";\n *\n * const root = await findMonoRepoRoot(\"/path/to/your/project\");\n * console.log(root); // Output: /path/to/your/project/packages/core\n */\nexport async function findMonoRepoRoot(startDir: string): Promise {\n  const lockFilePath = await findUp([\"package-lock.json\", \"yarn.lock\", \"pnpm-lock.yaml\", \"bun.lockb\", \"bun.lock\"], {\n    cwd: startDir,\n  });\n  if (lockFilePath) {\n    const packageJsonPath = join(dirname(lockFilePath), \"package.json\");\n    const hasWorkSpaces = await packageJsonHasWorkspaces(packageJsonPath);\n    return hasWorkSpaces ? dirname(lockFilePath) : null;\n  }\n\n  let currentDir = startDir;\n\n  while (currentDir !== \"/\") {\n    const packageJsonPath = join(currentDir, \"package.json\");\n\n    if (await packageJsonHasWorkspaces(packageJsonPath)) {\n      return currentDir;\n    }\n\n    const parentDir = dirname(currentDir);\n    if (parentDir === currentDir) {\n      break; // We've reached the root\n    }\n    currentDir = parentDir;\n  }\n\n  return null;\n}\n\n/**\n * Finds all packages in a monorepo\n *\n * @param projectDir - The directory to start searching from\n * @returns An array of package directories\n * @example\n * import { findMonoRepoPackages } from \"@settlemint/sdk-utils/filesystem\";\n *\n * const packages = await findMonoRepoPackages(\"/path/to/your/project\");\n * console.log(packages); // Output: [\"/path/to/your/project/packages/core\", \"/path/to/your/project/packages/ui\"]\n */\nexport async function findMonoRepoPackages(projectDir: string): Promise {\n  try {\n    const monoRepoRoot = await findMonoRepoRoot(projectDir);\n    if (!monoRepoRoot) {\n      return [projectDir];\n    }\n\n    const packageJsonPath = join(monoRepoRoot, \"package.json\");\n    const packageJson = tryParseJson<{ workspaces: string[] }>(await readFile(packageJsonPath, \"utf-8\"));\n    const workspaces = packageJson?.workspaces ?? [];\n\n    const packagePaths = await Promise.all(\n      workspaces.map(async (workspace: string) => {\n        const matches = await glob(join(monoRepoRoot, workspace, \"package.json\"));\n        return matches.map((match) => join(match, \"..\"));\n      }),\n    );\n\n    const allPaths = packagePaths.flat();\n    // If no packages found in workspaces, treat as non-monorepo\n    return allPaths.length === 0 ? [projectDir] : [monoRepoRoot, ...allPaths];\n  } catch (error) {\n    // If any error occurs, treat as non-monorepo\n    return [projectDir];\n  }\n}\n\nasync function packageJsonHasWorkspaces(packageJsonPath: string): Promise {\n  if (await exists(packageJsonPath)) {\n    const packageJson = tryParseJson<{ workspaces: string[] }>(await readFile(packageJsonPath, \"utf-8\"));\n    if (packageJson?.workspaces && Array.isArray(packageJson?.workspaces) && packageJson?.workspaces.length > 0) {\n      return true;\n    }\n  }\n  return false;\n}\n"],"x_google_ignoreList":[3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiBA,eAAsB,YAAY,gBAAgB,OAAOA,KAA+B;CACtF,MAAM,kBAAkB,MAAM,oBAAO,gBAAgB,EAAE,IAAK,EAAC;AAC7D,MAAK,iBAAiB;AACpB,MAAI,eAAe;AACjB,UAAO,QAAQ,KAAK;EACrB;AACD,QAAM,IAAI,MAAM;CACjB;AACD,QAAO,uBAAQ,gBAAgB;AAChC;;;;;;;;;;;;;;;;;ACVD,eAAsB,OAAOC,QAAkC;AAC7D,KAAI;AACF,QAAM,2BAAKC,OAAK;AAChB,SAAO;CACR,QAAO;AACN,SAAO;CACR;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;ACDD,SAAgB,aAAgBC,OAAeC,eAAyB,MAAgB;AACtF,KAAI;EACF,MAAM,SAAS,KAAK,MAAM,MAAM;AAChC,MAAI,WAAW,aAAa,WAAW,MAAM;AAC3C,UAAO;EACR;AACD,SAAO;CACR,SAAQ,KAAK;AAEZ,SAAO;CACR;AACF;;;;;;;;;;;;;;;AAgBD,SAAgB,kBAAqBD,OAAyB;AAC5D,KAAI,MAAM,SAAS,KAAM;AACvB,QAAM,IAAI,MAAM;CACjB;CACD,MAAM,SAAS,gBAAgB,KAAK,MAAM;AAC1C,MAAK,QAAQ;AACX,SAAO;CACR;AACD,QAAO,aAAgB,OAAO,GAAG;AAClC;;;;;;;;;;;;;AAcD,SAAgB,sBAAyBE,OAAmB;AAC1D,KAAI,UAAU,aAAa,UAAU,MAAM;AACzC,SAAO;CACR;AACD,QAAO,aACL,KAAK,UACH,OACA,CAAC,GAAGC,mBAAkBA,YAAU,WAAW,QAAM,UAAU,GAAGA,QAC/D,CACF;AACF;;;;;ACjFD,QAAO,UAAUC;CACjB,SAASA,WAAS,GAAG,GAAG,KAAK;AAC3B,MAAI,aAAa,OAAQ,KAAI,WAAW,GAAG,IAAI;AAC/C,MAAI,aAAa,OAAQ,KAAI,WAAW,GAAG,IAAI;EAE/C,IAAI,IAAI,MAAM,GAAG,GAAG,IAAI;AAExB,SAAO,KAAK;GACV,OAAO,EAAE;GACT,KAAK,EAAE;GACP,KAAK,IAAI,MAAM,GAAG,EAAE,GAAG;GACvB,MAAM,IAAI,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG;GACtC,MAAM,IAAI,MAAM,EAAE,KAAK,EAAE,OAAO;EACjC;CACF;CAED,SAAS,WAAW,KAAK,KAAK;EAC5B,IAAI,IAAI,IAAI,MAAM,IAAI;AACtB,SAAO,IAAI,EAAE,KAAK;CACnB;AAED,YAAS,QAAQ;CACjB,SAAS,MAAM,GAAG,GAAG,KAAK;EACxB,IAAI,MAAM,KAAK,MAAM,OAAO;EAC5B,IAAI,KAAK,IAAI,QAAQ,EAAE;EACvB,IAAI,KAAK,IAAI,QAAQ,GAAG,KAAK,EAAE;EAC/B,IAAI,IAAI;AAER,MAAI,MAAM,KAAK,KAAK,GAAG;AACrB,OAAG,MAAI,GAAG;AACR,WAAO,CAAC,IAAI,EAAG;GAChB;AACD,UAAO,CAAE;AACT,UAAO,IAAI;AAEX,UAAO,KAAK,MAAM,QAAQ;AACxB,QAAI,KAAK,IAAI;AACX,UAAK,KAAK,EAAE;AACZ,UAAK,IAAI,QAAQ,GAAG,IAAI,EAAE;IAC3B,WAAU,KAAK,UAAU,GAAG;AAC3B,cAAS,CAAE,KAAK,KAAK,EAAE,EAAI;IAC5B,OAAM;AACL,WAAM,KAAK,KAAK;AAChB,SAAI,MAAM,MAAM;AACd,aAAO;AACP,cAAQ;KACT;AAED,UAAK,IAAI,QAAQ,GAAG,IAAI,EAAE;IAC3B;AAED,QAAI,KAAK,MAAM,MAAM,IAAI,KAAK;GAC/B;AAED,OAAI,KAAK,QAAQ;AACf,aAAS,CAAE,MAAM,KAAO;GACzB;EACF;AAED,SAAO;CACR;;;;;;CC7DD,IAAI;AAEJ,QAAO,UAAU;CAEjB,IAAI,WAAW,YAAU,KAAK,QAAQ,GAAC;CACvC,IAAI,UAAU,WAAS,KAAK,QAAQ,GAAC;CACrC,IAAI,WAAW,YAAU,KAAK,QAAQ,GAAC;CACvC,IAAI,WAAW,YAAU,KAAK,QAAQ,GAAC;CACvC,IAAI,YAAY,aAAW,KAAK,QAAQ,GAAC;CAEzC,SAAS,QAAQ,KAAK;AACpB,SAAO,SAAS,KAAK,GAAG,IAAI,MACxB,SAAS,KAAK,GAAG,GACjB,IAAI,WAAW,EAAE;CACtB;CAED,SAAS,aAAa,KAAK;AACzB,SAAO,IAAI,MAAM,OAAO,CAAC,KAAK,SAAS,CAC5B,MAAM,MAAM,CAAC,KAAK,QAAQ,CAC1B,MAAM,MAAM,CAAC,KAAK,SAAS,CAC3B,MAAM,MAAM,CAAC,KAAK,SAAS,CAC3B,MAAM,MAAM,CAAC,KAAK,UAAU;CACxC;CAED,SAAS,eAAe,KAAK;AAC3B,SAAO,IAAI,MAAM,SAAS,CAAC,KAAK,KAAK,CAC1B,MAAM,QAAQ,CAAC,KAAK,IAAI,CACxB,MAAM,SAAS,CAAC,KAAK,IAAI,CACzB,MAAM,SAAS,CAAC,KAAK,IAAI,CACzB,MAAM,UAAU,CAAC,KAAK,IAAI;CACtC;CAMD,SAAS,gBAAgB,KAAK;AAC5B,OAAK,IACH,QAAO,CAAC,EAAG;EAEb,IAAI,QAAQ,CAAE;EACd,IAAI,IAAI,SAAS,KAAK,KAAK,IAAI;AAE/B,OAAK,EACH,QAAO,IAAI,MAAM,IAAI;EAEvB,IAAI,MAAM,EAAE;EACZ,IAAI,OAAO,EAAE;EACb,IAAI,OAAO,EAAE;EACb,IAAI,IAAI,IAAI,MAAM,IAAI;AAEtB,IAAE,EAAE,SAAO,MAAM,MAAM,OAAO;EAC9B,IAAI,YAAY,gBAAgB,KAAK;AACrC,MAAI,KAAK,QAAQ;AACf,KAAE,EAAE,SAAO,MAAM,UAAU,OAAO;AAClC,KAAE,KAAK,MAAM,GAAG,UAAU;EAC3B;AAED,QAAM,KAAK,MAAM,OAAO,EAAE;AAE1B,SAAO;CACR;CAED,SAAS,UAAU,KAAK;AACtB,OAAK,IACH,QAAO,CAAE;AAQX,MAAI,IAAI,OAAO,GAAG,EAAE,KAAK,MAAM;AAC7B,SAAM,WAAW,IAAI,OAAO,EAAE;EAC/B;AAED,SAAO,SAAO,aAAa,IAAI,EAAE,KAAK,CAAC,IAAI,eAAe;CAC3D;CAED,SAAS,QAAQ,KAAK;AACpB,SAAO,MAAM,MAAM;CACpB;CACD,SAAS,SAAS,IAAI;AACpB,SAAO,SAAS,KAAK,GAAG;CACzB;CAED,SAAS,IAAI,GAAG,GAAG;AACjB,SAAO,KAAK;CACb;CACD,SAAS,IAAI,GAAG,GAAG;AACjB,SAAO,KAAK;CACb;CAED,SAASC,SAAO,KAAK,OAAO;EAC1B,IAAI,aAAa,CAAE;EAEnB,IAAI,IAAI,SAAS,KAAK,KAAK,IAAI;AAC/B,OAAK,EAAG,QAAO,CAAC,GAAI;EAGpB,IAAI,MAAM,EAAE;EACZ,IAAI,OAAO,EAAE,KAAK,SACd,SAAO,EAAE,MAAM,MAAM,GACrB,CAAC,EAAG;AAER,MAAI,MAAM,KAAK,EAAE,IAAI,EAAE;AACrB,QAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;IACpC,IAAI,YAAY,MAAK,MAAM,EAAE,OAAO,MAAM,KAAK;AAC/C,eAAW,KAAK,UAAU;GAC3B;EACF,OAAM;GACL,IAAI,oBAAoB,iCAAiC,KAAK,EAAE,KAAK;GACrE,IAAI,kBAAkB,uCAAuC,KAAK,EAAE,KAAK;GACzE,IAAI,aAAa,qBAAqB;GACtC,IAAI,YAAY,EAAE,KAAK,QAAQ,IAAI,IAAI;AACvC,QAAK,eAAe,WAAW;AAE7B,QAAI,EAAE,KAAK,MAAM,QAAQ,EAAE;AACzB,WAAM,EAAE,MAAM,MAAM,EAAE,OAAO,WAAW,EAAE;AAC1C,YAAO,SAAO,IAAI;IACnB;AACD,WAAO,CAAC,GAAI;GACb;GAED,IAAI;AACJ,OAAI,YAAY;AACd,QAAI,EAAE,KAAK,MAAM,OAAO;GACzB,OAAM;AACL,QAAI,gBAAgB,EAAE,KAAK;AAC3B,QAAI,EAAE,WAAW,GAAG;AAElB,SAAI,SAAO,EAAE,IAAI,MAAM,CAAC,IAAI,QAAQ;AACpC,SAAI,EAAE,WAAW,GAAG;AAClB,aAAO,KAAK,IAAI,SAAS,GAAG;AAC1B,cAAO,EAAE,MAAM,EAAE,KAAK;MACvB,EAAC;KACH;IACF;GACF;GAID,IAAI;AAEJ,OAAI,YAAY;IACd,IAAI,IAAI,QAAQ,EAAE,GAAG;IACrB,IAAI,IAAI,QAAQ,EAAE,GAAG;IACrB,IAAI,QAAQ,KAAK,IAAI,EAAE,GAAG,QAAQ,EAAE,GAAG,OAAO;IAC9C,IAAI,OAAO,EAAE,UAAU,IACnB,KAAK,IAAI,QAAQ,EAAE,GAAG,CAAC,GACvB;IACJ,IAAI,OAAO;IACX,IAAI,UAAU,IAAI;AAClB,QAAI,SAAS;AACX,cAAS;AACT,YAAO;IACR;IACD,IAAI,MAAM,EAAE,KAAK,SAAS;AAE1B,QAAI,CAAE;AAEN,SAAK,IAAI,IAAI,GAAG,KAAK,GAAG,EAAE,EAAE,KAAK,MAAM;KACrC,IAAI;AACJ,SAAI,iBAAiB;AACnB,UAAI,OAAO,aAAa,EAAE;AAC1B,UAAI,MAAM,KACR,KAAI;KACP,OAAM;AACL,UAAI,OAAO,EAAE;AACb,UAAI,KAAK;OACP,IAAI,OAAO,QAAQ,EAAE;AACrB,WAAI,OAAO,GAAG;QACZ,IAAI,IAAI,IAAI,MAAM,OAAO,GAAG,KAAK,IAAI;AACrC,YAAI,IAAI,EACN,KAAI,MAAM,IAAI,EAAE,MAAM,EAAE;YAExB,KAAI,IAAI;OACX;MACF;KACF;AACD,OAAE,KAAK,EAAE;IACV;GACF,OAAM;AACL,QAAI,CAAE;AAEN,SAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,OAAE,KAAK,MAAM,GAAG,SAAO,EAAE,IAAI,MAAM,CAAC;IACrC;GACF;AAED,QAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,SAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;KACpC,IAAI,YAAY,MAAM,EAAE,KAAK,KAAK;AAClC,UAAK,SAAS,cAAc,UAC1B,YAAW,KAAK,UAAU;IAC7B;GACF;EACF;AAED,SAAO;CACR;;;;;ACzMD,MAAM,qBAAqB,OAAO;AAClC,MAAa,qBAAqB,CAAC,YAAY;AAC3C,YAAW,YAAY,UAAU;AAC7B,QAAM,IAAI,UAAU;CACvB;AACD,KAAI,QAAQ,SAAS,oBAAoB;AACrC,QAAM,IAAI,UAAU;CACvB;AACJ;;;;ACLD,MAAM,eAAe;CACjB,aAAa,CAAC,wBAAwB,IAAK;CAC3C,aAAa,CAAC,iBAAiB,IAAK;CACpC,aAAa,CAAC,QAAQ,WAAW,MAAM,KAAM;CAC7C,aAAa,CAAC,cAAc,IAAK;CACjC,aAAa,CAAC,WAAW,IAAK;CAC9B,aAAa,CAAC,WAAW,IAAK;CAC9B,aAAa;EAAC;EAAgB;EAAM;CAAK;CACzC,aAAa,CAAC,WAAW,IAAK;CAC9B,aAAa,CAAC,UAAU,IAAK;CAC7B,aAAa,CAAC,UAAU,IAAK;CAC7B,aAAa,CAAC,yBAAyB,IAAK;CAC5C,aAAa,CAAC,WAAW,IAAK;CAC9B,YAAY,CAAC,+BAA+B,IAAK;CACjD,cAAc,CAAC,aAAa,KAAM;AACrC;AAGD,MAAM,cAAc,CAAC,MAAM,EAAE,QAAQ,aAAa,OAAO;AAEzD,MAAM,eAAe,CAAC,MAAM,EAAE,QAAQ,4BAA4B,OAAO;AAEzE,MAAM,iBAAiB,CAAC,WAAW,OAAO,KAAK,GAAG;AAOlD,MAAa,aAAa,CAACC,QAAM,aAAa;CAC1C,MAAM,MAAM;;AAEZ,KAAI,OAAK,OAAO,IAAI,KAAK,KAAK;AAC1B,QAAM,IAAI,MAAM;CACnB;;CAED,MAAM,SAAS,CAAE;CACjB,MAAM,OAAO,CAAE;CACf,IAAI,IAAI,MAAM;CACd,IAAI,WAAW;CACf,IAAI,QAAQ;CACZ,IAAI,WAAW;CACf,IAAI,SAAS;CACb,IAAI,SAAS;CACb,IAAI,aAAa;AACjB,OAAO,QAAO,IAAIA,OAAK,QAAQ;EAC3B,MAAM,IAAI,OAAK,OAAO,EAAE;AACxB,OAAK,MAAM,OAAO,MAAM,QAAQ,MAAM,MAAM,GAAG;AAC3C,YAAS;AACT;AACA;EACH;AACD,MAAI,MAAM,OAAO,aAAa,UAAU;AACpC,YAAS,IAAI;AACb;EACH;AACD,aAAW;AACX,MAAI,MAAM,MAAM;AACZ,QAAK,UAAU;AACX,eAAW;AACX;AACA;GACH;EAEJ;AACD,MAAI,MAAM,QAAQ,UAAU;AAExB,QAAK,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,OAAO,QAAQ,aAAa,EAAE;AAC9D,QAAI,OAAK,WAAW,KAAK,EAAE,EAAE;AAEzB,SAAI,YAAY;AACZ,aAAO;OAAC;OAAM;OAAOA,OAAK,SAAS;OAAK;MAAK;KAChD;AACD,UAAK,IAAI;AACT,SAAI,IACA,MAAK,KAAK,KAAK;SAEf,QAAO,KAAK,KAAK;AACrB,aAAQ,SAAS;AACjB,cAAS;IACZ;GACJ;EACJ;AAED,aAAW;AACX,MAAI,YAAY;AAGZ,OAAI,IAAI,YAAY;AAChB,WAAO,KAAK,YAAY,WAAW,GAAG,MAAM,YAAY,EAAE,CAAC;GAC9D,WACQ,MAAM,YAAY;AACvB,WAAO,KAAK,YAAY,EAAE,CAAC;GAC9B;AACD,gBAAa;AACb;AACA;EACH;AAGD,MAAI,OAAK,WAAW,MAAM,IAAI,EAAE,EAAE;AAC9B,UAAO,KAAK,YAAY,IAAI,IAAI,CAAC;AACjC,QAAK;AACL;EACH;AACD,MAAI,OAAK,WAAW,KAAK,IAAI,EAAE,EAAE;AAC7B,gBAAa;AACb,QAAK;AACL;EACH;AAED,SAAO,KAAK,YAAY,EAAE,CAAC;AAC3B;CACH;AACD,KAAI,SAAS,GAAG;AAGZ,SAAO;GAAC;GAAI;GAAO;GAAG;EAAM;CAC/B;AAGD,MAAK,OAAO,WAAW,KAAK,QAAQ;AAChC,SAAO;GAAC;GAAM;GAAOA,OAAK,SAAS;GAAK;EAAK;CAChD;AAKD,KAAI,KAAK,WAAW,KAChB,OAAO,WAAW,KAClB,SAAS,KAAK,OAAO,GAAG,KACvB,QAAQ;EACT,MAAM,IAAI,OAAO,GAAG,WAAW,IAAI,OAAO,GAAG,OAAO,EAAE,GAAG,OAAO;AAChE,SAAO;GAAC,aAAa,EAAE;GAAE;GAAO,SAAS;GAAK;EAAM;CACvD;CACD,MAAM,UAAU,OAAO,SAAS,MAAM,MAAM,eAAe,OAAO,GAAG;CACrE,MAAM,QAAQ,OAAO,SAAS,KAAK,OAAO,eAAe,KAAK,GAAG;CACjE,MAAM,OAAO,OAAO,UAAU,KAAK,SAC7B,MAAM,UAAU,MAAM,QAAQ,MAC9B,OAAO,SACH,UACA;AACV,QAAO;EAAC;EAAM;EAAO,SAAS;EAAK;CAAK;AAC3C;;;;;;;;;;;;;;;;;;ACpID,MAAa,WAAW,CAAC,GAAG,EAAE,uBAAuB,OAAQ,GAAG,CAAE,MAAK;AACnE,QAAO,uBACD,EAAE,QAAQ,kBAAkB,KAAK,GACjC,EAAE,QAAQ,6BAA6B,OAAO,CAAC,QAAQ,cAAc,KAAK;AACnF;;;;ACfD,MAAM,QAAQ,IAAI,IAAI;CAAC;CAAK;CAAK;CAAK;CAAK;AAAI;AAC/C,MAAM,gBAAgB,CAAC,MAAM,MAAM,IAAI,EAAE;AAKzC,MAAM,mBAAmB;AACzB,MAAM,aAAa;AAInB,MAAM,kBAAkB,IAAI,IAAI,CAAC,KAAK,GAAI;AAE1C,MAAM,WAAW,IAAI,IAAI,CAAC,MAAM,GAAI;AACpC,MAAM,aAAa,IAAI,IAAI;AAC3B,MAAMC,iBAAe,CAAC,MAAM,EAAE,QAAQ,4BAA4B,OAAO;AAEzE,MAAMC,UAAQ;AAEd,MAAMC,SAAOD,UAAQ;AAGrB,MAAM,cAAcA,UAAQ;AAG5B,IAAa,MAAb,MAAa,IAAI;CACb;CACA;CACA;CACA,SAAS;CACT,SAAS,CAAE;CACX;CACA;CACA;CACA,cAAc;CACd;CACA;CAGA,YAAY;CACZ,YAAY,MAAM,QAAQ,UAAU,CAAE,GAAE;AACpC,OAAK,OAAO;AAEZ,MAAI,KACA,MAAKE,YAAY;AACrB,OAAKC,UAAU;AACf,OAAKC,QAAQ,KAAKD,UAAU,KAAKA,QAAQC,QAAQ;AACjD,OAAKC,WAAW,KAAKD,UAAU,OAAO,UAAU,KAAKA,MAAMC;AAC3D,OAAKC,QAAQ,KAAKF,UAAU,OAAO,CAAE,IAAG,KAAKA,MAAME;AACnD,MAAI,SAAS,QAAQ,KAAKF,MAAMG,YAC5B,MAAKD,MAAM,KAAK,KAAK;AACzB,OAAKE,eAAe,KAAKL,UAAU,KAAKA,QAAQM,OAAO,SAAS;CACnE;CACD,IAAI,WAAW;;AAEX,MAAI,KAAKP,cAAc,UACnB,QAAO,KAAKA;;AAEhB,OAAK,MAAM,KAAK,KAAKO,QAAQ;AACzB,cAAW,MAAM,SACb;AACJ,OAAI,EAAE,QAAQ,EAAE,SACZ,QAAQ,KAAKP,YAAY;EAChC;AAED,SAAO,KAAKA;CACf;CAED,WAAW;AACP,MAAI,KAAKQ,cAAc,UACnB,QAAO,KAAKA;AAChB,OAAK,KAAK,MAAM;AACZ,UAAQ,KAAKA,YAAY,KAAKD,OAAO,IAAI,OAAK,OAAO,EAAE,CAAC,CAAC,KAAK,GAAG;EACpE,OACI;AACD,UAAQ,KAAKC,YACT,KAAK,OAAO,MAAM,KAAKD,OAAO,IAAI,OAAK,OAAO,EAAE,CAAC,CAAC,KAAK,IAAI,GAAG;EACrE;CACJ;CACD,YAAY;;AAER,MAAI,SAAS,KAAKL,MACd,OAAM,IAAI,MAAM;AACpB,MAAI,KAAKG,YACL,QAAO;;AAGX,OAAK,UAAU;AACf,OAAKA,cAAc;EACnB,IAAI;AACJ,SAAQ,IAAI,KAAKD,MAAM,KAAK,EAAG;AAC3B,OAAI,EAAE,SAAS,IACX;GAEJ,IAAI,IAAI;GACR,IAAI,KAAK,EAAEH;AACX,UAAO,IAAI;AACP,SAAK,IAAI,IAAI,EAAEK,eAAe,IAAI,GAAG,QAAQ,IAAI,GAAGC,OAAO,QAAQ,KAAK;AACpE,UAAK,MAAM,QAAQ,EAAEA,QAAQ;;AAEzB,iBAAW,SAAS,UAAU;AAC1B,aAAM,IAAI,MAAM;MACnB;;AAED,WAAK,OAAO,GAAGA,OAAO,GAAG;KAC5B;IACJ;AACD,QAAI;AACJ,SAAK,EAAEN;GACV;EACJ;AACD,SAAO;CACV;CACD,KAAK,GAAG,OAAO;AACX,OAAK,MAAM,KAAK,OAAO;AACnB,OAAI,MAAM,GACN;;AAEJ,cAAW,MAAM,cAAc,aAAa,OAAO,EAAEA,YAAY,OAAO;AACpE,UAAM,IAAI,MAAM,mBAAmB;GACtC;;AAED,QAAKM,OAAO,KAAK,EAAE;EACtB;CACJ;CACD,SAAS;EACL,MAAM,MAAM,KAAK,SAAS,OACpB,KAAKA,OAAO,OAAO,CAAC,IAAI,cAAa,MAAM,WAAW,IAAI,EAAE,QAAQ,CAAE,GACtE,CAAC,KAAK,MAAM,GAAG,KAAKA,OAAO,IAAI,OAAK,EAAE,QAAQ,CAAC,AAAC;AACtD,MAAI,KAAK,SAAS,KAAK,KAAK,KACxB,KAAI,QAAQ,CAAE,EAAC;AACnB,MAAI,KAAK,OAAO,KACX,SAAS,KAAKL,SACV,KAAKA,MAAMG,eAAe,KAAKJ,SAAS,SAAS,MAAO;AAC7D,OAAI,KAAK,CAAE,EAAC;EACf;AACD,SAAO;CACV;CACD,UAAU;AACN,MAAI,KAAKC,UAAU,KACf,QAAO;AAEX,OAAK,KAAKD,SAAS,SAAS,CACxB,QAAO;AACX,MAAI,KAAKK,iBAAiB,EACtB,QAAO;EAEX,MAAM,IAAI,KAAKL;AACf,OAAK,IAAI,IAAI,GAAG,IAAI,KAAKK,cAAc,KAAK;GACxC,MAAM,KAAK,EAAEC,OAAO;AACpB,SAAM,cAAc,OAAO,GAAG,SAAS,MAAM;AACzC,WAAO;GACV;EACJ;AACD,SAAO;CACV;CACD,QAAQ;AACJ,MAAI,KAAKL,UAAU,KACf,QAAO;AACX,MAAI,KAAKD,SAAS,SAAS,IACvB,QAAO;AACX,OAAK,KAAKA,SAAS,OAAO,CACtB,QAAO;AACX,OAAK,KAAK,KACN,QAAO,KAAKA,SAAS,OAAO;;EAGhC,MAAM,KAAK,KAAKA,UAAU,KAAKA,QAAQM,OAAO,SAAS;;AAEvD,SAAO,KAAKD,iBAAiB,KAAK;CACrC;CACD,OAAO,MAAM;AACT,aAAW,SAAS,SAChB,MAAK,KAAK,KAAK;MAEf,MAAK,KAAK,KAAK,MAAM,KAAK,CAAC;CAClC;CACD,MAAM,QAAQ;EACV,MAAM,IAAI,IAAI,IAAI,KAAK,MAAM;AAC7B,OAAK,MAAM,KAAK,KAAKC,QAAQ;AACzB,KAAE,OAAO,EAAE;EACd;AACD,SAAO;CACV;CACD,OAAOE,UAAU,KAAK,KAAK,KAAK,KAAK;EACjC,IAAI,WAAW;EACf,IAAI,UAAU;EACd,IAAI,cAAc;EAClB,IAAI,WAAW;AACf,MAAI,IAAI,SAAS,MAAM;GAEnB,IAAIC,MAAI;GACR,IAAIC,QAAM;AACV,UAAOD,MAAI,IAAI,QAAQ;IACnB,MAAM,IAAI,IAAI,OAAOA,MAAI;AAGzB,QAAI,YAAY,MAAM,MAAM;AACxB,iBAAY;AACZ,cAAO;AACP;IACH;AACD,QAAI,SAAS;AACT,SAAIA,QAAM,aAAa,GAAG;AACtB,UAAI,MAAM,OAAO,MAAM,KAAK;AACxB,kBAAW;MACd;KACJ,WACQ,MAAM,SAASA,QAAM,aAAa,KAAK,WAAW;AACvD,gBAAU;KACb;AACD,cAAO;AACP;IACH,WACQ,MAAM,KAAK;AAChB,eAAU;AACV,kBAAaA;AACb,gBAAW;AACX,cAAO;AACP;IACH;AACD,SAAK,IAAI,SAAS,cAAc,EAAE,IAAI,IAAI,OAAOA,IAAE,KAAK,KAAK;AACzD,SAAI,KAAKC,MAAI;AACb,aAAM;KACN,MAAMC,QAAM,IAAI,IAAI,GAAG;AACvB,WAAI,IAAIH,UAAU,KAAKG,OAAKF,KAAG,IAAI;AACnC,SAAI,KAAKE,MAAI;AACb;IACH;AACD,aAAO;GACV;AACD,OAAI,KAAKD,MAAI;AACb,UAAOD;EACV;EAGD,IAAI,IAAI,MAAM;EACd,IAAI,OAAO,IAAI,IAAI,MAAM;EACzB,MAAM,QAAQ,CAAE;EAChB,IAAI,MAAM;AACV,SAAO,IAAI,IAAI,QAAQ;GACnB,MAAM,IAAI,IAAI,OAAO,IAAI;AAGzB,OAAI,YAAY,MAAM,MAAM;AACxB,gBAAY;AACZ,WAAO;AACP;GACH;AACD,OAAI,SAAS;AACT,QAAI,MAAM,aAAa,GAAG;AACtB,SAAI,MAAM,OAAO,MAAM,KAAK;AACxB,iBAAW;KACd;IACJ,WACQ,MAAM,SAAS,MAAM,aAAa,KAAK,WAAW;AACvD,eAAU;IACb;AACD,WAAO;AACP;GACH,WACQ,MAAM,KAAK;AAChB,cAAU;AACV,iBAAa;AACb,eAAW;AACX,WAAO;AACP;GACH;AACD,OAAI,cAAc,EAAE,IAAI,IAAI,OAAO,EAAE,KAAK,KAAK;AAC3C,SAAK,KAAK,IAAI;AACd,UAAM;IACN,MAAME,QAAM,IAAI,IAAI,GAAG;AACvB,SAAK,KAAKA,MAAI;AACd,QAAI,IAAIH,UAAU,KAAKG,OAAK,GAAG,IAAI;AACnC;GACH;AACD,OAAI,MAAM,KAAK;AACX,SAAK,KAAK,IAAI;AACd,UAAM;AACN,UAAM,KAAK,KAAK;AAChB,WAAO,IAAI,IAAI,MAAM;AACrB;GACH;AACD,OAAI,MAAM,KAAK;AACX,QAAI,QAAQ,MAAM,IAAIL,OAAO,WAAW,GAAG;AACvC,SAAIM,YAAY;IACnB;AACD,SAAK,KAAK,IAAI;AACd,UAAM;AACN,QAAI,KAAK,GAAG,OAAO,KAAK;AACxB,WAAO;GACV;AACD,UAAO;EACV;AAID,MAAI,OAAO;AACX,MAAIb,YAAY;AAChB,MAAIO,SAAS,CAAC,IAAI,UAAU,MAAM,EAAE,AAAC;AACrC,SAAO;CACV;CACD,OAAO,SAAS,SAAS,UAAU,CAAE,GAAE;EACnC,MAAM,MAAM,IAAI,IAAI,MAAM,WAAW;AACrC,MAAIE,UAAU,SAAS,KAAK,GAAG,QAAQ;AACvC,SAAO;CACV;CAGD,cAAc;;AAGV,MAAI,SAAS,KAAKP,MACd,QAAO,KAAKA,MAAM,aAAa;;EAEnC,MAAMY,SAAO,KAAK,UAAU;EAC5B,MAAM,CAAC,IAAI,MAAMC,YAAU,MAAM,GAAG,KAAK,gBAAgB;EAIzD,MAAM,WAAWA,cACb,KAAKf,aACJ,KAAKG,SAAS,WACV,KAAKA,SAAS,mBACf,OAAK,aAAa,KAAK,OAAK,aAAa;AACjD,OAAK,UAAU;AACX,UAAO;EACV;EACD,MAAM,SAAS,KAAKA,SAAS,SAAS,MAAM,OAAO,QAAQ,MAAM;AACjE,SAAO,OAAO,OAAO,IAAI,QAAQ,GAAG,GAAG,IAAI,QAAQ;GAC/C,MAAM;GACN,OAAOW;EACV,EAAC;CACL;CACD,IAAI,UAAU;AACV,SAAO,KAAKX;CACf;CAsED,eAAe,UAAU;EACrB,MAAM,MAAM,cAAc,KAAKA,SAAS;AACxC,MAAI,KAAKD,UAAU,KACf,MAAKc,WAAW;AACpB,OAAK,KAAK,MAAM;GACZ,MAAM,UAAU,KAAK,SAAS,IAAI,KAAK,OAAO;GAC9C,MAAM,MAAM,KAAKT,OACZ,IAAI,OAAK;IACV,MAAM,CAAC,IAAI,GAAGQ,YAAU,MAAM,UAAU,MAAM,WACxC,IAAIE,WAAW,GAAG,KAAKjB,WAAW,QAAQ,GAC1C,EAAE,eAAe,SAAS;AAChC,SAAKA,YAAY,KAAKA,aAAae;AACnC,SAAKG,SAAS,KAAKA,UAAU;AAC7B,WAAO;GACV,EAAC,CACG,KAAK,GAAG;GACb,IAAIC,UAAQ;AACZ,OAAI,KAAK,SAAS,EAAE;AAChB,eAAW,KAAKZ,OAAO,OAAO,UAAU;KAKpC,MAAM,iBAAiB,KAAKA,OAAO,WAAW,KAAK,SAAS,IAAI,KAAKA,OAAO,GAAG;AAC/E,UAAK,gBAAgB;MACjB,MAAM,MAAM;MAGZ,MAAM,aAEL,OAAO,IAAI,IAAI,IAAI,OAAO,EAAE,CAAC,IAEzB,IAAI,WAAW,MAAM,IAAI,IAAI,IAAI,IAAI,OAAO,EAAE,CAAC,IAE/C,IAAI,WAAW,SAAS,IAAI,IAAI,IAAI,IAAI,OAAO,EAAE,CAAC;MAGvD,MAAM,aAAa,QAAQ,YAAY,IAAI,IAAI,IAAI,OAAO,EAAE,CAAC;AAC7D,gBAAQ,aAAa,mBAAmB,YAAY,aAAa;KACpE;IACJ;GACJ;GAED,IAAI,MAAM;AACV,OAAI,KAAK,OAAO,IACZ,KAAKL,MAAMG,eACX,KAAKJ,SAAS,SAAS,KAAK;AAC5B,UAAM;GACT;GACD,MAAMmB,UAAQD,UAAQ,MAAM;AAC5B,UAAO;IACHC;IACA,SAAS,IAAI;IACZ,KAAKpB,cAAc,KAAKA;IACzB,KAAKkB;GACR;EACJ;EAID,MAAM,WAAW,KAAK,SAAS,OAAO,KAAK,SAAS;EAEpD,MAAM,QAAQ,KAAK,SAAS,MAAM,cAAc;EAChD,IAAI,OAAO,KAAKG,eAAe,IAAI;AACnC,MAAI,KAAK,SAAS,IAAI,KAAK,OAAO,KAAK,QAAQ,KAAK,SAAS,KAAK;GAG9D,MAAM,IAAI,KAAK,UAAU;AACzB,QAAKd,SAAS,CAAC,CAAE;AACjB,QAAK,OAAO;AACZ,QAAKP,YAAY;AACjB,UAAO;IAAC;IAAG,SAAS,KAAK,UAAU,CAAC;IAAE;IAAO;GAAM;EACtD;EAED,IAAI,kBAAkB,YAAY,YAAY,QAAQ,aAChD,KACA,KAAKqB,eAAe,KAAK;AAC/B,MAAI,mBAAmB,MAAM;AACzB,oBAAiB;EACpB;AACD,MAAI,gBAAgB;AAChB,WAAQ,KAAK,KAAK,MAAM,eAAe;EAC1C;EAED,IAAI,QAAQ;AACZ,MAAI,KAAK,SAAS,OAAO,KAAKR,WAAW;AACrC,YAAS,KAAK,SAAS,KAAK,MAAM,aAAa,MAAM;EACxD,OACI;GACD,MAAM,QAAQ,KAAK,SAAS,MAEpB,QACK,KAAK,SAAS,KAAK,QAAQ,WAAW,aAAa,MACpDd,SACA,MACN,KAAK,SAAS,MACV,MACA,KAAK,SAAS,MACV,OACA,KAAK,SAAS,OAAO,iBACjB,MACA,KAAK,SAAS,OAAO,kBAChB,OACA,GAAG,KAAK,KAAK;AACpC,WAAQ,QAAQ,OAAO;EAC1B;AACD,SAAO;GACH;GACA,SAAS,KAAK;GACb,KAAKC,cAAc,KAAKA;GACzB,KAAKkB;EACR;CACJ;CACD,eAAe,KAAK;AAChB,SAAO,KAAKX,OACP,IAAI,OAAK;;AAGV,cAAW,MAAM,UAAU;AACvB,UAAM,IAAI,MAAM;GACnB;;GAGD,MAAM,CAAC,IAAI,GAAG,WAAW,MAAM,GAAG,EAAE,eAAe,IAAI;AACvD,QAAKW,SAAS,KAAKA,UAAU;AAC7B,UAAO;EACV,EAAC,CACG,OAAO,SAAO,KAAK,SAAS,IAAI,KAAK,OAAO,OAAO,EAAE,CACrD,KAAK,IAAI;CACjB;CACD,OAAOD,WAAWH,QAAMC,YAAU,UAAU,OAAO;EAC/C,IAAI,WAAW;EACf,IAAI,KAAK;EACT,IAAI,QAAQ;AACZ,OAAK,IAAI,IAAI,GAAG,IAAID,OAAK,QAAQ,KAAK;GAClC,MAAM,IAAI,OAAK,OAAO,EAAE;AACxB,OAAI,UAAU;AACV,eAAW;AACX,WAAO,WAAW,IAAI,EAAE,GAAG,OAAO,MAAM;AACxC;GACH;AACD,OAAI,MAAM,MAAM;AACZ,QAAI,MAAMA,OAAK,SAAS,GAAG;AACvB,WAAM;IACT,OACI;AACD,gBAAW;IACd;AACD;GACH;AACD,OAAI,MAAM,KAAK;IACX,MAAM,CAAC,KAAK,WAAW,UAAU,MAAM,GAAG,WAAWA,QAAM,EAAE;AAC7D,QAAI,UAAU;AACV,WAAM;AACN,aAAQ,SAAS;AACjB,UAAK,WAAW;AAChB,kBAAWC,cAAY;AACvB;IACH;GACJ;AACD,OAAI,MAAM,KAAK;AACX,QAAI,WAAWD,WAAS,IACpB,OAAM;QAEN,OAAMf;AACV,iBAAW;AACX;GACH;AACD,OAAI,MAAM,KAAK;AACX,UAAMD;AACN,iBAAW;AACX;GACH;AACD,SAAM,eAAa,EAAE;EACxB;AACD,SAAO;GAAC;GAAI,SAASgB,OAAK;KAAIC;GAAU;EAAM;CACjD;AACJ;;;;;;;;;;;;;ACjkBD,MAAa,SAAS,CAAC,GAAG,EAAE,uBAAuB,OAAQ,GAAG,CAAE,MAAK;AAIjE,QAAO,uBACD,EAAE,QAAQ,cAAc,OAAO,GAC/B,EAAE,QAAQ,gBAAgB,OAAO;AAC1C;;;;;ACXD,MAAa,YAAY,CAAC,GAAG,SAAS,UAAU,CAAE,MAAK;AACnD,oBAAmB,QAAQ;AAE3B,MAAK,QAAQ,aAAa,QAAQ,OAAO,EAAE,KAAK,KAAK;AACjD,SAAO;CACV;AACD,QAAO,IAAI,UAAU,SAAS,SAAS,MAAM,EAAE;AAClD;AAED,MAAM,eAAe;AACrB,MAAM,iBAAiB,CAACO,UAAQ,CAAC,OAAO,EAAE,WAAW,IAAI,IAAI,EAAE,SAASA,MAAI;AAC5E,MAAM,oBAAoB,CAACA,UAAQ,CAAC,MAAM,EAAE,SAASA,MAAI;AACzD,MAAM,uBAAuB,CAACA,UAAQ;AAClC,SAAM,MAAI,aAAa;AACvB,QAAO,CAAC,OAAO,EAAE,WAAW,IAAI,IAAI,EAAE,aAAa,CAAC,SAASA,MAAI;AACpE;AACD,MAAM,0BAA0B,CAACA,UAAQ;AACrC,SAAM,MAAI,aAAa;AACvB,QAAO,CAAC,MAAM,EAAE,aAAa,CAAC,SAASA,MAAI;AAC9C;AACD,MAAM,gBAAgB;AACtB,MAAM,kBAAkB,CAAC,OAAO,EAAE,WAAW,IAAI,IAAI,EAAE,SAAS,IAAI;AACpE,MAAM,qBAAqB,CAAC,MAAM,MAAM,OAAO,MAAM,QAAQ,EAAE,SAAS,IAAI;AAC5E,MAAM,YAAY;AAClB,MAAM,cAAc,CAAC,MAAM,MAAM,OAAO,MAAM,QAAQ,EAAE,WAAW,IAAI;AACvE,MAAM,SAAS;AACf,MAAM,WAAW,CAAC,MAAM,EAAE,WAAW,MAAM,EAAE,WAAW,IAAI;AAC5D,MAAM,cAAc,CAAC,MAAM,EAAE,WAAW,KAAK,MAAM,OAAO,MAAM;AAChE,MAAM,WAAW;AACjB,MAAM,mBAAmB,CAAC,CAAC,IAAIA,QAAM,GAAG,KAAK;CACzC,MAAM,QAAQ,gBAAgB,CAAC,EAAG,EAAC;AACnC,MAAKA,MACD,QAAO;AACX,SAAM,MAAI,aAAa;AACvB,QAAO,CAAC,MAAM,MAAM,EAAE,IAAI,EAAE,aAAa,CAAC,SAASA,MAAI;AAC1D;AACD,MAAM,sBAAsB,CAAC,CAAC,IAAIA,QAAM,GAAG,KAAK;CAC5C,MAAM,QAAQ,mBAAmB,CAAC,EAAG,EAAC;AACtC,MAAKA,MACD,QAAO;AACX,SAAM,MAAI,aAAa;AACvB,QAAO,CAAC,MAAM,MAAM,EAAE,IAAI,EAAE,aAAa,CAAC,SAASA,MAAI;AAC1D;AACD,MAAM,gBAAgB,CAAC,CAAC,IAAIA,QAAM,GAAG,KAAK;CACtC,MAAM,QAAQ,mBAAmB,CAAC,EAAG,EAAC;AACtC,SAAQA,QAAM,QAAQ,CAAC,MAAM,MAAM,EAAE,IAAI,EAAE,SAASA,MAAI;AAC3D;AACD,MAAM,aAAa,CAAC,CAAC,IAAIA,QAAM,GAAG,KAAK;CACnC,MAAM,QAAQ,gBAAgB,CAAC,EAAG,EAAC;AACnC,SAAQA,QAAM,QAAQ,CAAC,MAAM,MAAM,EAAE,IAAI,EAAE,SAASA,MAAI;AAC3D;AACD,MAAM,kBAAkB,CAAC,CAAC,GAAG,KAAK;CAC9B,MAAM,MAAM,GAAG;AACf,QAAO,CAAC,MAAM,EAAE,WAAW,QAAQ,EAAE,WAAW,IAAI;AACvD;AACD,MAAM,qBAAqB,CAAC,CAAC,GAAG,KAAK;CACjC,MAAM,MAAM,GAAG;AACf,QAAO,CAAC,MAAM,EAAE,WAAW,OAAO,MAAM,OAAO,MAAM;AACxD;;AAED,MAAMC,2BAA0B,YAAY,YAAY,iBAC1C,QAAQ,QAAQ,YACtB,QAAQ,OACR,QAAQ,IAAI,kCACZ,QAAQ,WACV;AACN,MAAM,OAAO;CACT,OAAO,EAAE,KAAK,KAAM;CACpB,OAAO,EAAE,KAAK,IAAK;AACtB;;AAED,MAAa,MAAMA,sBAAoB,UAAU,KAAK,MAAM,MAAM,KAAK,MAAM;AAC7E,UAAU,MAAM;AAChB,MAAa,WAAW,OAAO,cAAc;AAC7C,UAAU,WAAW;AAGrB,MAAM,QAAQ;AAEd,MAAM,OAAO,QAAQ;AAIrB,MAAM,aAAa;AAGnB,MAAM,eAAe;AACrB,MAAa,SAAS,CAAC,SAAS,UAAU,CAAE,MAAK,CAAC,MAAM,UAAU,GAAG,SAAS,QAAQ;AACtF,UAAU,SAAS;AACnB,MAAM,MAAM,CAAC,GAAG,IAAI,CAAE,MAAK,OAAO,OAAO,CAAE,GAAE,GAAG,EAAE;AAClD,MAAa,WAAW,CAAC,QAAQ;AAC7B,MAAK,cAAc,QAAQ,aAAa,OAAO,KAAK,IAAI,CAAC,QAAQ;AAC7D,SAAO;CACV;CACD,MAAM,OAAO;CACb,MAAM,IAAI,CAAC,GAAG,SAAS,UAAU,CAAE,MAAK,KAAK,GAAG,SAAS,IAAI,KAAK,QAAQ,CAAC;AAC3E,QAAO,OAAO,OAAO,GAAG;EACpB,WAAW,MAAMC,oBAAkB,KAAK,UAAU;GAC9C,YAAY,SAAS,UAAU,CAAE,GAAE;AAC/B,UAAM,SAAS,IAAI,KAAK,QAAQ,CAAC;GACpC;GACD,OAAO,SAAS,SAAS;AACrB,WAAO,KAAK,SAAS,IAAI,KAAK,QAAQ,CAAC,CAAC;GAC3C;EACJ;EACD,KAAK,MAAMC,cAAY,KAAK,IAAI;;GAE5B,YAAY,MAAM,QAAQ,UAAU,CAAE,GAAE;AACpC,UAAM,MAAM,QAAQ,IAAI,KAAK,QAAQ,CAAC;GACzC;;GAED,OAAO,SAAS,SAAS,UAAU,CAAE,GAAE;AACnC,WAAO,KAAK,IAAI,SAAS,SAAS,IAAI,KAAK,QAAQ,CAAC;GACvD;EACJ;EACD,UAAU,CAAC,GAAG,UAAU,CAAE,MAAK,KAAK,SAAS,GAAG,IAAI,KAAK,QAAQ,CAAC;EAClE,QAAQ,CAAC,GAAG,UAAU,CAAE,MAAK,KAAK,OAAO,GAAG,IAAI,KAAK,QAAQ,CAAC;EAC9D,QAAQ,CAAC,SAAS,UAAU,CAAE,MAAK,KAAK,OAAO,SAAS,IAAI,KAAK,QAAQ,CAAC;EAC1E,UAAU,CAAC,YAAY,KAAK,SAAS,IAAI,KAAK,QAAQ,CAAC;EACvD,QAAQ,CAAC,SAAS,UAAU,CAAE,MAAK,KAAK,OAAO,SAAS,IAAI,KAAK,QAAQ,CAAC;EAC1E,aAAa,CAAC,SAAS,UAAU,CAAE,MAAK,KAAK,YAAY,SAAS,IAAI,KAAK,QAAQ,CAAC;EACpF,OAAO,CAAC,MAAM,SAAS,UAAU,CAAE,MAAK,KAAK,MAAM,MAAM,SAAS,IAAI,KAAK,QAAQ,CAAC;EACpF,KAAK,KAAK;EACA;CACb,EAAC;AACL;AACD,UAAU,WAAW;AAWrB,MAAa,cAAc,CAAC,SAAS,UAAU,CAAE,MAAK;AAClD,oBAAmB,QAAQ;AAG3B,KAAI,QAAQ,YAAY,mBAAmB,KAAK,QAAQ,EAAE;AAEtD,SAAO,CAAC,OAAQ;CACnB;AACD,QAAO,oCAAO,QAAQ;AACzB;AACD,UAAU,cAAc;AAYxB,MAAa,SAAS,CAAC,SAAS,UAAU,CAAE,MAAK,IAAI,UAAU,SAAS,SAAS,QAAQ;AACzF,UAAU,SAAS;AACnB,MAAa,QAAQ,CAAC,MAAM,SAAS,UAAU,CAAE,MAAK;CAClD,MAAM,KAAK,IAAI,UAAU,SAAS;AAClC,QAAO,KAAK,OAAO,OAAK,GAAG,MAAM,EAAE,CAAC;AACpC,KAAI,GAAG,QAAQ,WAAW,KAAK,QAAQ;AACnC,OAAK,KAAK,QAAQ;CACrB;AACD,QAAO;AACV;AACD,UAAU,QAAQ;AAElB,MAAM,YAAY;AAClB,MAAM,eAAe,CAAC,MAAM,EAAE,QAAQ,4BAA4B,OAAO;AACzE,IAAa,YAAb,MAAuB;CACnB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,YAAY,SAAS,UAAU,CAAE,GAAE;AAC/B,qBAAmB,QAAQ;AAC3B,YAAU,WAAW,CAAE;AACvB,OAAK,UAAU;AACf,OAAK,UAAU;AACf,OAAK,WAAW,QAAQ,YAAYF;AACpC,OAAK,YAAY,KAAK,aAAa;AACnC,OAAK,yBACC,QAAQ,wBAAwB,QAAQ,uBAAuB;AACrE,MAAI,KAAK,sBAAsB;AAC3B,QAAK,UAAU,KAAK,QAAQ,QAAQ,OAAO,IAAI;EAClD;AACD,OAAK,4BAA4B,QAAQ;AACzC,OAAK,SAAS;AACd,OAAK,SAAS;AACd,OAAK,aAAa,QAAQ;AAC1B,OAAK,UAAU;AACf,OAAK,QAAQ;AACb,OAAK,YAAY,QAAQ;AACzB,OAAK,WAAW,KAAK,QAAQ;AAC7B,OAAK,qBACD,QAAQ,uBAAuB,YACzB,QAAQ,wBACL,KAAK,aAAa,KAAK;AACpC,OAAK,UAAU,CAAE;AACjB,OAAK,YAAY,CAAE;AACnB,OAAK,MAAM,CAAE;AAEb,OAAK,MAAM;CACd;CACD,WAAW;AACP,MAAI,KAAK,QAAQ,iBAAiB,KAAK,IAAI,SAAS,GAAG;AACnD,UAAO;EACV;AACD,OAAK,MAAM,WAAW,KAAK,KAAK;AAC5B,QAAK,MAAM,QAAQ,SAAS;AACxB,eAAW,SAAS,SAChB,QAAO;GACd;EACJ;AACD,SAAO;CACV;CACD,MAAM,GAAG,GAAG,CAAG;CACf,OAAO;EACH,MAAM,UAAU,KAAK;EACrB,MAAM,UAAU,KAAK;AAErB,OAAK,QAAQ,aAAa,QAAQ,OAAO,EAAE,KAAK,KAAK;AACjD,QAAK,UAAU;AACf;EACH;AACD,OAAK,SAAS;AACV,QAAK,QAAQ;AACb;EACH;AAED,OAAK,aAAa;AAElB,OAAK,UAAU,CAAC,GAAG,IAAI,IAAI,KAAK,aAAa,CAAE;AAC/C,MAAI,QAAQ,OAAO;AACf,QAAK,QAAQ,CAAC,GAAG,SAAS,QAAQ,MAAM,GAAG,KAAK;EACnD;AACD,OAAK,MAAM,KAAK,SAAS,KAAK,QAAQ;EAUtC,MAAM,eAAe,KAAK,QAAQ,IAAI,OAAK,KAAK,WAAW,EAAE,CAAC;AAC9D,OAAK,YAAY,KAAK,WAAW,aAAa;AAC9C,OAAK,MAAM,KAAK,SAAS,KAAK,UAAU;EAExC,IAAI,MAAM,KAAK,UAAU,IAAI,CAAC,GAAG,GAAG,OAAO;AACvC,OAAI,KAAK,aAAa,KAAK,oBAAoB;IAE3C,MAAM,QAAQ,EAAE,OAAO,MACnB,EAAE,OAAO,OACR,EAAE,OAAO,QAAQ,UAAU,KAAK,EAAE,GAAG,MACrC,UAAU,KAAK,EAAE,GAAG;IACzB,MAAM,UAAU,WAAW,KAAK,EAAE,GAAG;AACrC,QAAI,OAAO;AACP,YAAO,CAAC,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,IAAI,QAAM,KAAK,MAAM,GAAG,CAAC,AAAC;IACrE,WACQ,SAAS;AACd,YAAO,CAAC,EAAE,IAAI,GAAG,EAAE,MAAM,EAAE,CAAC,IAAI,QAAM,KAAK,MAAM,GAAG,CAAC,AAAC;IACzD;GACJ;AACD,UAAO,EAAE,IAAI,QAAM,KAAK,MAAM,GAAG,CAAC;EACrC,EAAC;AACF,OAAK,MAAM,KAAK,SAAS,IAAI;AAE7B,OAAK,MAAM,IAAI,OAAO,OAAK,EAAE,QAAQ,MAAM,MAAM,EAAE;AAEnD,MAAI,KAAK,WAAW;AAChB,QAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;IACtC,MAAM,IAAI,KAAK,IAAI;AACnB,QAAI,EAAE,OAAO,MACT,EAAE,OAAO,MACT,KAAK,UAAU,GAAG,OAAO,cAClB,EAAE,OAAO,YAChB,YAAY,KAAK,EAAE,GAAG,EAAE;AACxB,OAAE,KAAK;IACV;GACJ;EACJ;AACD,OAAK,MAAM,KAAK,SAAS,KAAK,IAAI;CACrC;CAMD,WAAW,WAAW;AAElB,MAAI,KAAK,QAAQ,YAAY;AACzB,QAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACvC,SAAK,IAAI,IAAI,GAAG,IAAI,UAAU,GAAG,QAAQ,KAAK;AAC1C,SAAI,UAAU,GAAG,OAAO,MAAM;AAC1B,gBAAU,GAAG,KAAK;KACrB;IACJ;GACJ;EACJ;EACD,MAAM,EAAE,oBAAoB,GAAG,GAAG,KAAK;AACvC,MAAI,qBAAqB,GAAG;AAExB,eAAY,KAAK,qBAAqB,UAAU;AAChD,eAAY,KAAK,sBAAsB,UAAU;EACpD,WACQ,qBAAqB,GAAG;AAE7B,eAAY,KAAK,iBAAiB,UAAU;EAC/C,OACI;AAED,eAAY,KAAK,0BAA0B,UAAU;EACxD;AACD,SAAO;CACV;CAED,0BAA0B,WAAW;AACjC,SAAO,UAAU,IAAI,WAAS;GAC1B,IAAI,MAAM;AACV,WAAQ,OAAO,KAAK,MAAM,QAAQ,MAAM,KAAK,EAAE,GAAG;IAC9C,IAAI,IAAI;AACR,WAAO,MAAM,IAAI,OAAO,MAAM;AAC1B;IACH;AACD,QAAI,MAAM,IAAI;AACV,WAAM,OAAO,IAAI,IAAI,GAAG;IAC3B;GACJ;AACD,UAAO;EACV,EAAC;CACL;CAED,iBAAiB,WAAW;AACxB,SAAO,UAAU,IAAI,WAAS;AAC1B,WAAQ,MAAM,OAAO,CAAC,KAAK,SAAS;IAChC,MAAM,OAAO,IAAI,IAAI,SAAS;AAC9B,QAAI,SAAS,QAAQ,SAAS,MAAM;AAChC,YAAO;IACV;AACD,QAAI,SAAS,MAAM;AACf,SAAI,QAAQ,SAAS,QAAQ,SAAS,OAAO,SAAS,MAAM;AACxD,UAAI,KAAK;AACT,aAAO;KACV;IACJ;AACD,QAAI,KAAK,KAAK;AACd,WAAO;GACV,GAAE,CAAE,EAAC;AACN,UAAO,MAAM,WAAW,IAAI,CAAC,EAAG,IAAG;EACtC,EAAC;CACL;CACD,qBAAqB,OAAO;AACxB,OAAK,MAAM,QAAQ,MAAM,EAAE;AACvB,WAAQ,KAAK,WAAW,MAAM;EACjC;EACD,IAAI,eAAe;AACnB,KAAG;AACC,kBAAe;AAEf,QAAK,KAAK,yBAAyB;AAC/B,SAAK,IAAI,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK;KACvC,MAAM,IAAI,MAAM;AAEhB,SAAI,MAAM,KAAK,MAAM,MAAM,MAAM,OAAO,GACpC;AACJ,SAAI,MAAM,OAAO,MAAM,IAAI;AACvB,qBAAe;AACf,YAAM,OAAO,GAAG,EAAE;AAClB;KACH;IACJ;AACD,QAAI,MAAM,OAAO,OACb,MAAM,WAAW,MAChB,MAAM,OAAO,OAAO,MAAM,OAAO,KAAK;AACvC,oBAAe;AACf,WAAM,KAAK;IACd;GACJ;GAED,IAAI,KAAK;AACT,WAAQ,OAAO,KAAK,MAAM,QAAQ,MAAM,KAAK,EAAE,GAAG;IAC9C,MAAM,IAAI,MAAM,KAAK;AACrB,QAAI,KAAK,MAAM,OAAO,MAAM,QAAQ,MAAM,MAAM;AAC5C,oBAAe;AACf,WAAM,OAAO,KAAK,GAAG,EAAE;AACvB,WAAM;IACT;GACJ;EACJ,SAAQ;AACT,SAAO,MAAM,WAAW,IAAI,CAAC,EAAG,IAAG;CACtC;CAmBD,qBAAqB,WAAW;EAC5B,IAAI,eAAe;AACnB,KAAG;AACC,kBAAe;AAEf,QAAK,IAAI,SAAS,WAAW;IACzB,IAAI,MAAM;AACV,YAAQ,OAAO,KAAK,MAAM,QAAQ,MAAM,KAAK,EAAE,GAAG;KAC9C,IAAI,MAAM;AACV,YAAO,MAAM,MAAM,OAAO,MAAM;AAE5B;KACH;AAGD,SAAI,MAAM,IAAI;AACV,YAAM,OAAO,KAAK,GAAG,MAAM,GAAG;KACjC;KACD,IAAI,OAAO,MAAM,KAAK;KACtB,MAAM,IAAI,MAAM,KAAK;KACrB,MAAM,KAAK,MAAM,KAAK;AACtB,SAAI,SAAS,KACT;AACJ,UAAK,KACD,MAAM,OACN,MAAM,SACL,MACD,OAAO,OACP,OAAO,MAAM;AACb;KACH;AACD,oBAAe;AAEf,WAAM,OAAO,IAAI,EAAE;KACnB,MAAM,QAAQ,MAAM,MAAM,EAAE;AAC5B,WAAM,MAAM;AACZ,eAAU,KAAK,MAAM;AACrB;IACH;AAED,SAAK,KAAK,yBAAyB;AAC/B,UAAK,IAAI,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK;MACvC,MAAM,IAAI,MAAM;AAEhB,UAAI,MAAM,KAAK,MAAM,MAAM,MAAM,OAAO,GACpC;AACJ,UAAI,MAAM,OAAO,MAAM,IAAI;AACvB,sBAAe;AACf,aAAM,OAAO,GAAG,EAAE;AAClB;MACH;KACJ;AACD,SAAI,MAAM,OAAO,OACb,MAAM,WAAW,MAChB,MAAM,OAAO,OAAO,MAAM,OAAO,KAAK;AACvC,qBAAe;AACf,YAAM,KAAK;KACd;IACJ;IAED,IAAI,KAAK;AACT,YAAQ,OAAO,KAAK,MAAM,QAAQ,MAAM,KAAK,EAAE,GAAG;KAC9C,MAAM,IAAI,MAAM,KAAK;AACrB,SAAI,KAAK,MAAM,OAAO,MAAM,QAAQ,MAAM,MAAM;AAC5C,qBAAe;MACf,MAAM,UAAU,OAAO,KAAK,MAAM,KAAK,OAAO;MAC9C,MAAM,QAAQ,UAAU,CAAC,GAAI,IAAG,CAAE;AAClC,YAAM,OAAO,KAAK,GAAG,GAAG,GAAG,MAAM;AACjC,UAAI,MAAM,WAAW,EACjB,OAAM,KAAK,GAAG;AAClB,YAAM;KACT;IACJ;GACJ;EACJ,SAAQ;AACT,SAAO;CACV;CAQD,sBAAsB,WAAW;AAC7B,OAAK,IAAI,IAAI,GAAG,IAAI,UAAU,SAAS,GAAG,KAAK;AAC3C,QAAK,IAAI,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;IAC3C,MAAM,UAAU,KAAK,WAAW,UAAU,IAAI,UAAU,KAAK,KAAK,wBAAwB;AAC1F,QAAI,SAAS;AACT,eAAU,KAAK,CAAE;AACjB,eAAU,KAAK;AACf;IACH;GACJ;EACJ;AACD,SAAO,UAAU,OAAO,QAAM,GAAG,OAAO;CAC3C;CACD,WAAW,GAAG,GAAG,eAAe,OAAO;EACnC,IAAI,KAAK;EACT,IAAI,KAAK;EACT,IAAI,SAAS,CAAE;EACf,IAAI,QAAQ;AACZ,SAAO,KAAK,EAAE,UAAU,KAAK,EAAE,QAAQ;AACnC,OAAI,EAAE,QAAQ,EAAE,KAAK;AACjB,WAAO,KAAK,UAAU,MAAM,EAAE,MAAM,EAAE,IAAI;AAC1C;AACA;GACH,WACQ,gBAAgB,EAAE,QAAQ,QAAQ,EAAE,QAAQ,EAAE,KAAK,IAAI;AAC5D,WAAO,KAAK,EAAE,IAAI;AAClB;GACH,WACQ,gBAAgB,EAAE,QAAQ,QAAQ,EAAE,QAAQ,EAAE,KAAK,IAAI;AAC5D,WAAO,KAAK,EAAE,IAAI;AAClB;GACH,WACQ,EAAE,QAAQ,OACf,EAAE,QACD,KAAK,QAAQ,QAAQ,EAAE,IAAI,WAAW,IAAI,KAC3C,EAAE,QAAQ,MAAM;AAChB,QAAI,UAAU,IACV,QAAO;AACX,YAAQ;AACR,WAAO,KAAK,EAAE,IAAI;AAClB;AACA;GACH,WACQ,EAAE,QAAQ,OACf,EAAE,QACD,KAAK,QAAQ,QAAQ,EAAE,IAAI,WAAW,IAAI,KAC3C,EAAE,QAAQ,MAAM;AAChB,QAAI,UAAU,IACV,QAAO;AACX,YAAQ;AACR,WAAO,KAAK,EAAE,IAAI;AAClB;AACA;GACH,OACI;AACD,WAAO;GACV;EACJ;AAGD,SAAO,EAAE,WAAW,EAAE,UAAU;CACnC;CACD,cAAc;AACV,MAAI,KAAK,SACL;EACJ,MAAM,UAAU,KAAK;EACrB,IAAI,SAAS;EACb,IAAI,eAAe;AACnB,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,UAAU,QAAQ,OAAO,EAAE,KAAK,KAAK,KAAK;AAClE,aAAU;AACV;EACH;AACD,MAAI,aACA,MAAK,UAAU,QAAQ,MAAM,aAAa;AAC9C,OAAK,SAAS;CACjB;CAMD,SAAS,MAAM,SAAS,UAAU,OAAO;EACrC,MAAM,UAAU,KAAK;AAIrB,MAAI,KAAK,WAAW;GAChB,MAAM,mBAAmB,KAAK,OAAO,YAAY,YAAY,KAAK,KAAK,GAAG;GAC1E,MAAM,WAAW,aACb,KAAK,OAAO,MACZ,KAAK,OAAO,MACZ,KAAK,OAAO,OACZ,YAAY,KAAK,KAAK,GAAG;GAC7B,MAAM,sBAAsB,QAAQ,OAAO,YAAY,YAAY,KAAK,QAAQ,GAAG;GACnF,MAAM,cAAc,gBAChB,QAAQ,OAAO,MACf,QAAQ,OAAO,MACf,QAAQ,OAAO,cACR,QAAQ,OAAO,YACtB,YAAY,KAAK,QAAQ,GAAG;GAChC,MAAM,MAAM,UAAU,IAAI,YAAY,IAAI;GAC1C,MAAM,MAAM,aAAa,IAAI,eAAe,IAAI;AAChD,cAAW,QAAQ,mBAAmB,QAAQ,UAAU;IACpD,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC,KAAK,MAAM,QAAQ,IAAK;AAC1C,QAAI,GAAG,aAAa,KAAK,GAAG,aAAa,EAAE;AACvC,aAAQ,OAAO;AACf,SAAI,MAAM,KAAK;AACX,gBAAU,QAAQ,MAAM,IAAI;KAC/B,WACQ,MAAM,KAAK;AAChB,aAAO,KAAK,MAAM,IAAI;KACzB;IACJ;GACJ;EACJ;EAGD,MAAM,EAAE,oBAAoB,GAAG,GAAG,KAAK;AACvC,MAAI,qBAAqB,GAAG;AACxB,UAAO,KAAK,qBAAqB,KAAK;EACzC;AACD,OAAK,MAAM,YAAY,MAAM;GAAE;GAAM;EAAS,EAAC;AAC/C,OAAK,MAAM,YAAY,KAAK,QAAQ,QAAQ,OAAO;AACnD,OAAK,IAAI,KAAK,GAAG,KAAK,GAAG,KAAK,KAAK,QAAQ,KAAK,QAAQ,QAAQ,KAAK,MAAM,KAAK,IAAI,MAAM,MAAM;AAC5F,QAAK,MAAM,gBAAgB;GAC3B,IAAI,IAAI,QAAQ;GAChB,IAAI,IAAI,KAAK;AACb,QAAK,MAAM,SAAS,GAAG,EAAE;;AAIzB,OAAI,MAAM,OAAO;AACb,WAAO;GACV;;AAED,OAAI,MAAM,UAAU;AAChB,SAAK,MAAM,YAAY;KAAC;KAAS;KAAG;IAAE,EAAC;IAuBvC,IAAI,KAAK;IACT,IAAI,KAAK,KAAK;AACd,QAAI,OAAO,IAAI;AACX,UAAK,MAAM,gBAAgB;AAO3B,YAAO,KAAK,IAAI,MAAM;AAClB,UAAI,KAAK,QAAQ,OACb,KAAK,QAAQ,SACX,QAAQ,OAAO,KAAK,IAAI,OAAO,EAAE,KAAK,IACxC,QAAO;KACd;AACD,YAAO;IACV;AAED,WAAO,KAAK,IAAI;KACZ,IAAI,YAAY,KAAK;AACrB,UAAK,MAAM,oBAAoB,MAAM,IAAI,SAAS,IAAI,UAAU;AAEhE,SAAI,KAAK,SAAS,KAAK,MAAM,GAAG,EAAE,QAAQ,MAAM,GAAG,EAAE,QAAQ,EAAE;AAC3D,WAAK,MAAM,yBAAyB,IAAI,IAAI,UAAU;AAEtD,aAAO;KACV,OACI;AAGD,UAAI,cAAc,OACd,cAAc,SACZ,QAAQ,OAAO,UAAU,OAAO,EAAE,KAAK,KAAM;AAC/C,YAAK,MAAM,iBAAiB,MAAM,IAAI,SAAS,GAAG;AAClD;MACH;AAED,WAAK,MAAM,2CAA2C;AACtD;KACH;IACJ;;AAID,QAAI,SAAS;AAET,UAAK,MAAM,4BAA4B,MAAM,IAAI,SAAS,GAAG;AAC7D,SAAI,OAAO,IAAI;AACX,aAAO;KACV;IACJ;;AAED,WAAO;GACV;GAID,IAAI;AACJ,cAAW,MAAM,UAAU;AACvB,UAAM,MAAM;AACZ,SAAK,MAAM,gBAAgB,GAAG,GAAG,IAAI;GACxC,OACI;AACD,UAAM,EAAE,KAAK,EAAE;AACf,SAAK,MAAM,iBAAiB,GAAG,GAAG,IAAI;GACzC;AACD,QAAK,IACD,QAAO;EACd;AAYD,MAAI,OAAO,MAAM,OAAO,IAAI;AAGxB,UAAO;EACV,WACQ,OAAO,IAAI;AAIhB,UAAO;EACV,WACQ,OAAO,IAAI;AAKhB,UAAO,OAAO,KAAK,KAAK,KAAK,QAAQ;EAExC,OACI;AAED,SAAM,IAAI,MAAM;EACnB;;CAEJ;CACD,cAAc;AACV,SAAO,YAAY,KAAK,SAAS,KAAK,QAAQ;CACjD;CACD,MAAM,SAAS;AACX,qBAAmB,QAAQ;EAC3B,MAAM,UAAU,KAAK;AAErB,MAAI,YAAY,KACZ,QAAO;AACX,MAAI,YAAY,GACZ,QAAO;EAGX,IAAI;EACJ,IAAI,WAAW;AACf,MAAK,IAAI,QAAQ,MAAM,OAAO,EAAG;AAC7B,cAAW,QAAQ,MAAM,cAAc;EAC1C,WACS,IAAI,QAAQ,MAAM,aAAa,EAAG;AACxC,cAAW,CAAC,QAAQ,SACd,QAAQ,MACJ,0BACA,uBACJ,QAAQ,MACJ,oBACA,gBAAgB,EAAE,GAAG;EAClC,WACS,IAAI,QAAQ,MAAM,SAAS,EAAG;AACpC,cAAW,CAAC,QAAQ,SACd,QAAQ,MACJ,sBACA,mBACJ,QAAQ,MACJ,gBACA,YAAY,EAAE;EAC3B,WACS,IAAI,QAAQ,MAAM,cAAc,EAAG;AACzC,cAAW,QAAQ,MAAM,qBAAqB;EACjD,WACS,IAAI,QAAQ,MAAM,UAAU,EAAG;AACrC,cAAW;EACd;EACD,MAAM,KAAK,IAAI,SAAS,SAAS,KAAK,QAAQ,CAAC,aAAa;AAC5D,MAAI,mBAAmB,OAAO,UAAU;AAEpC,WAAQ,eAAe,IAAI,QAAQ,EAAE,OAAO,SAAU,EAAC;EAC1D;AACD,SAAO;CACV;CACD,SAAS;AACL,MAAI,KAAK,UAAU,KAAK,WAAW,MAC/B,QAAO,KAAK;EAOhB,MAAM,MAAM,KAAK;AACjB,OAAK,IAAI,QAAQ;AACb,QAAK,SAAS;AACd,UAAO,KAAK;EACf;EACD,MAAM,UAAU,KAAK;EACrB,MAAM,UAAU,QAAQ,aAClB,OACA,QAAQ,MACJ,aACA;EACV,MAAM,QAAQ,IAAI,IAAI,QAAQ,SAAS,CAAC,GAAI,IAAG,CAAE;EAOjD,IAAI,KAAK,IACJ,IAAI,aAAW;GAChB,MAAM,KAAK,QAAQ,IAAI,OAAK;AACxB,QAAI,aAAa,QAAQ;AACrB,UAAK,MAAM,KAAK,EAAE,MAAM,MAAM,GAAG,CAC7B,OAAM,IAAI,EAAE;IACnB;AACD,kBAAc,MAAM,WACd,aAAa,EAAE,GACf,MAAM,WACF,WACA,EAAE;GACf,EAAC;AACF,MAAG,QAAQ,CAAC,GAAG,MAAM;IACjB,MAAM,OAAO,GAAG,IAAI;IACpB,MAAM,OAAO,GAAG,IAAI;AACpB,QAAI,MAAM,YAAY,SAAS,UAAU;AACrC;IACH;AACD,QAAI,SAAS,WAAW;AACpB,SAAI,SAAS,aAAa,SAAS,UAAU;AACzC,SAAG,IAAI,KAAK,YAAY,UAAU,UAAU;KAC/C,OACI;AACD,SAAG,KAAK;KACX;IACJ,WACQ,SAAS,WAAW;AACzB,QAAG,IAAI,KAAK,OAAO,YAAY,UAAU;IAC5C,WACQ,SAAS,UAAU;AACxB,QAAG,IAAI,KAAK,OAAO,eAAe,UAAU,SAAS;AACrD,QAAG,IAAI,KAAK;IACf;GACJ,EAAC;AACF,UAAO,GAAG,OAAO,OAAK,MAAM,SAAS,CAAC,KAAK,IAAI;EAClD,EAAC,CACG,KAAK,IAAI;EAGd,MAAM,CAAC,MAAM,MAAM,GAAG,IAAI,SAAS,IAAI,CAAC,OAAO,GAAI,IAAG,CAAC,IAAI,EAAG;AAG9D,OAAK,MAAM,OAAO,KAAK,QAAQ;AAE/B,MAAI,KAAK,OACL,MAAK,SAAS,KAAK;AACvB,MAAI;AACA,QAAK,SAAS,IAAI,OAAO,IAAI,CAAC,GAAG,KAAM,EAAC,KAAK,GAAG;EAEnD,SACM,IAAI;AAEP,QAAK,SAAS;EACjB;;AAED,SAAO,KAAK;CACf;CACD,WAAW,GAAG;AAKV,MAAI,KAAK,yBAAyB;AAC9B,UAAO,EAAE,MAAM,IAAI;EACtB,WACQ,KAAK,aAAa,cAAc,KAAK,EAAE,EAAE;AAE9C,UAAO,CAAC,IAAI,GAAG,EAAE,MAAM,MAAM,AAAC;EACjC,OACI;AACD,UAAO,EAAE,MAAM,MAAM;EACxB;CACJ;CACD,MAAM,GAAG,UAAU,KAAK,SAAS;AAC7B,OAAK,MAAM,SAAS,GAAG,KAAK,QAAQ;AAGpC,MAAI,KAAK,SAAS;AACd,UAAO;EACV;AACD,MAAI,KAAK,OAAO;AACZ,UAAO,MAAM;EAChB;AACD,MAAI,MAAM,OAAO,SAAS;AACtB,UAAO;EACV;EACD,MAAM,UAAU,KAAK;AAErB,MAAI,KAAK,WAAW;AAChB,OAAI,EAAE,MAAM,KAAK,CAAC,KAAK,IAAI;EAC9B;EAED,MAAM,KAAK,KAAK,WAAW,EAAE;AAC7B,OAAK,MAAM,KAAK,SAAS,SAAS,GAAG;EAKrC,MAAM,MAAM,KAAK;AACjB,OAAK,MAAM,KAAK,SAAS,OAAO,IAAI;EAEpC,IAAI,WAAW,GAAG,GAAG,SAAS;AAC9B,OAAK,UAAU;AACX,QAAK,IAAI,IAAI,GAAG,SAAS,IAAI,YAAY,KAAK,GAAG,KAAK;AAClD,eAAW,GAAG;GACjB;EACJ;AACD,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;GACjC,MAAM,UAAU,IAAI;GACpB,IAAI,OAAO;AACX,OAAI,QAAQ,aAAa,QAAQ,WAAW,GAAG;AAC3C,WAAO,CAAC,QAAS;GACpB;GACD,MAAM,MAAM,KAAK,SAAS,MAAM,SAAS,QAAQ;AACjD,OAAI,KAAK;AACL,QAAI,QAAQ,YAAY;AACpB,YAAO;IACV;AACD,YAAQ,KAAK;GAChB;EACJ;AAGD,MAAI,QAAQ,YAAY;AACpB,UAAO;EACV;AACD,SAAO,KAAK;CACf;CACD,OAAO,SAAS,KAAK;AACjB,SAAO,UAAU,SAAS,IAAI,CAAC;CAClC;AACJ;;AAMD,UAAU,MAAM;AAChB,UAAU,YAAY;AACtB,UAAU,SAAS;AACnB,UAAU,WAAW;;;;;;;ACp+BrB,MAAM,cAAc,gBAAgB,YAChC,sBACO,YAAY,QAAQ,aACzB,cACA;AACN,MAAM,SAAS,IAAI;;AAEnB,MAAM,iBAAkB,YAAY,cAAc,UAAU,UAAU,CAAE;;AAExE,MAAM,cAAc,CAAC,KAAK,MAAM,MAAM,OAAO;AACzC,QAAO,QAAQ,gBAAgB,aACzB,QAAQ,YAAY,KAAK,MAAM,MAAM,GAAG,GACxC,QAAQ,OAAO,GAAG,KAAK,IAAI,KAAK,IAAI,IAAI,EAAE;AACnD;AACD,IAAI,KAAK,WAAW;AACpB,IAAI,KAAK,WAAW;;AAEpB,WAAW,OAAO,aAAa;AAE3B,MAAK,MAAM,YAAY;EACnB;EACA,WAAW,CAAE;EACb;EACA,UAAU;EACV,iBAAiB,GAAG,IAAI;AACpB,QAAK,SAAS,KAAK,GAAG;EACzB;CACJ;AAED,MAAK,MAAM,gBAAgB;EACvB,cAAc;AACV,mBAAgB;EACnB;EACD,SAAS,IAAI;EACb,MAAM,QAAQ;AACV,OAAI,KAAK,OAAO,QACZ;AAEJ,QAAK,OAAO,SAAS;AAErB,QAAK,OAAO,UAAU;AAEtB,QAAK,MAAM,MAAM,KAAK,OAAO,UAAU;AACnC,OAAG,OAAO;GACb;AACD,QAAK,OAAO,UAAU,OAAO;EAChC;CACJ;CACD,IAAI,yBAAyB,QAAQ,KAAK,gCAAgC;CAC1E,MAAM,iBAAiB,MAAM;AACzB,OAAK,uBACD;AACJ,2BAAyB;AACzB,cAAY,2DACR,wDACA,4DACA,gEACA,sEACA,sEACA,uEAAuE,uBAAuB,WAAW,eAAe;CAC/H;AACJ;;AAED,MAAM,aAAa,CAAC,UAAU,OAAO,IAAI,KAAK;AAC9C,MAAM,OAAO,OAAO,OAAO;AAC3B,MAAM,WAAW,CAAC,MAAM,KAAK,MAAM,KAAK,MAAM,EAAE,IAAI,IAAI,KAAK,SAAS,EAAE;;AAUxE,MAAM,eAAe,CAAC,SAAS,SAAS,IAAI,GACtC,OACA,OAAO,KAAK,IAAI,GAAG,EAAE,GACjB,aACA,OAAO,KAAK,IAAI,GAAG,GAAG,GAClB,cACA,OAAO,KAAK,IAAI,GAAG,GAAG,GAClB,cACA,OAAO,OAAO,mBACV,YACA;;AAEtB,IAAM,YAAN,cAAwB,MAAM;CAC1B,YAAY,MAAM;AACd,QAAM,KAAK;AACX,OAAK,KAAK,EAAE;CACf;AACJ;AACD,IAAM,QAAN,MAAM,MAAM;CACR;CACA;CAEA,OAAOG,gBAAgB;CACvB,OAAO,OAAO,KAAK;EACf,MAAM,UAAU,aAAa,IAAI;AACjC,OAAK,QACD,QAAO,CAAE;AACb,QAAMA,gBAAgB;EACtB,MAAM,IAAI,IAAI,MAAM,KAAK;AACzB,QAAMA,gBAAgB;AACtB,SAAO;CACV;CACD,YAAY,KAAK,SAAS;;AAEtB,OAAK,MAAMA,eAAe;AACtB,SAAM,IAAI,UAAU;EACvB;;AAED,OAAK,OAAO,IAAI,QAAQ;AACxB,OAAK,SAAS;CACjB;CACD,KAAK,GAAG;AACJ,OAAK,KAAK,KAAK,YAAY;CAC9B;CACD,MAAM;AACF,SAAO,KAAK,KAAK,EAAE,KAAK;CAC3B;AACJ;;;;;;;;;;;;;;;;AAgBD,IAAa,WAAb,MAAa,SAAS;CAElB;CACA;CACA;CACA;CACA;CACA;;;;CAIA;;;;CAIA;;;;CAIA;;;;CAIA;;;;CAIA;;;;CAIA;;;;CAIA;;;;CAIA;;;;CAIA;;;;CAIA;;;;CAIA;;;;CAIA;;;;CAIA;;;;CAIA;;;;CAIA;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;;;;;;;;;;CAUA,OAAO,sBAAsB,GAAG;AAC5B,SAAO;GAEH,QAAQ,EAAEC;GACV,MAAM,EAAEC;GACR,OAAO,EAAEC;GACT,QAAQ,EAAEC;GACV,SAAS,EAAEC;GACX,SAAS,EAAEC;GACX,MAAM,EAAEC;GACR,MAAM,EAAEC;GACR,IAAI,OAAO;AACP,WAAO,EAAEC;GACZ;GACD,IAAI,OAAO;AACP,WAAO,EAAEC;GACZ;GACD,MAAM,EAAEC;GAER,mBAAmB,CAAC,MAAM,EAAEC,mBAAmB,EAAE;GACjD,iBAAiB,CAAC,GAAG,OAAO,SAAS,YAAY,EAAEC,iBAAiB,GAAG,OAAO,SAAS,QAAQ;GAC/F,YAAY,CAAC,UAAU,EAAEC,YAAY,MAAM;GAC3C,SAAS,CAAC,YAAY,EAAEC,SAAS,QAAQ;GACzC,UAAU,CAAC,YAAY,EAAEC,UAAU,QAAQ;GAC3C,SAAS,CAAC,UAAU,EAAEC,SAAS,MAAM;EACxC;CACJ;;;;CAKD,IAAI,MAAM;AACN,SAAO,KAAKC;CACf;;;;CAID,IAAI,UAAU;AACV,SAAO,KAAKC;CACf;;;;CAID,IAAI,iBAAiB;AACjB,SAAO,KAAKC;CACf;;;;CAID,IAAI,OAAO;AACP,SAAO,KAAKC;CACf;;;;CAID,IAAI,cAAc;AACd,SAAO,KAAKC;CACf;CACD,IAAI,aAAa;AACb,SAAO,KAAKC;CACf;;;;CAID,IAAI,UAAU;AACV,SAAO,KAAKC;CACf;;;;CAID,IAAI,eAAe;AACf,SAAO,KAAKC;CACf;CACD,YAAY,SAAS;EACjB,MAAM,EAAE,MAAM,GAAG,KAAK,gBAAgB,GAAG,cAAc,gBAAgB,gBAAgB,YAAY,SAAS,cAAc,gBAAgB,aAAa,UAAU,GAAG,eAAe,GAAG,iBAAiB,aAAa,YAAY,0BAA0B,oBAAoB,4BAA4B,wBAAwB,kBAAmB,GAAG;AACxV,MAAI,QAAQ,MAAM,SAAS,IAAI,EAAE;AAC7B,SAAM,IAAI,UAAU;EACvB;EACD,MAAM,YAAY,MAAM,aAAa,IAAI,GAAG;AAC5C,OAAK,WAAW;AACZ,SAAM,IAAI,MAAM,wBAAwB;EAC3C;AACD,OAAKP,OAAO;AACZ,OAAKC,WAAW;AAChB,OAAK,eAAe,gBAAgB,KAAKA;AACzC,OAAK,kBAAkB;AACvB,MAAI,KAAK,iBAAiB;AACtB,QAAK,KAAKA,aAAa,KAAK,cAAc;AACtC,UAAM,IAAI,UAAU;GACvB;AACD,cAAW,KAAK,oBAAoB,YAAY;AAC5C,UAAM,IAAI,UAAU;GACvB;EACJ;AACD,MAAI,eAAe,oBACR,eAAe,YAAY;AAClC,SAAM,IAAI,UAAU;EACvB;AACD,OAAKI,cAAc;AACnB,MAAI,gBAAgB,oBACT,gBAAgB,YAAY;AACnC,SAAM,IAAI,UAAU;EACvB;AACD,OAAKD,eAAe;AACpB,OAAKI,oBAAoB;AACzB,OAAKtB,UAAU,IAAI;AACnB,OAAKC,WAAW,IAAI,MAAM,KAAK,KAAK,UAAU;AAC9C,OAAKC,WAAW,IAAI,MAAM,KAAK,KAAK,UAAU;AAC9C,OAAKC,QAAQ,IAAI,UAAU;AAC3B,OAAKC,QAAQ,IAAI,UAAU;AAC3B,OAAKC,QAAQ;AACb,OAAKC,QAAQ;AACb,OAAKC,QAAQ,MAAM,OAAO,IAAI;AAC9B,OAAKU,QAAQ;AACb,OAAKD,kBAAkB;AACvB,aAAW,YAAY,YAAY;AAC/B,QAAKI,WAAW;EACnB;AACD,aAAW,iBAAiB,YAAY;AACpC,QAAKC,gBAAgB;AACrB,QAAKE,YAAY,CAAE;EACtB,OACI;AACD,QAAKF,gBAAgB;AACrB,QAAKE,YAAY;EACpB;AACD,OAAKC,gBAAgB,KAAKJ;AAC1B,OAAKK,qBAAqB,KAAKJ;AAC/B,OAAK,mBAAmB;AACxB,OAAK,gBAAgB;AACrB,OAAK,6BAA6B;AAClC,OAAK,+BAA+B;AACpC,OAAK,2BAA2B;AAChC,OAAK,qBAAqB;AAE1B,MAAI,KAAK,iBAAiB,GAAG;AACzB,OAAI,KAAKN,aAAa,GAAG;AACrB,SAAK,SAAS,KAAKA,SAAS,EAAE;AAC1B,WAAM,IAAI,UAAU;IACvB;GACJ;AACD,QAAK,SAAS,KAAK,aAAa,EAAE;AAC9B,UAAM,IAAI,UAAU;GACvB;AACD,QAAKW,yBAAyB;EACjC;AACD,OAAK,eAAe;AACpB,OAAK,uBAAuB;AAC5B,OAAK,mBAAmB;AACxB,OAAK,mBAAmB;AACxB,OAAK,gBACD,SAAS,cAAc,IAAI,kBAAkB,IACvC,gBACA;AACV,OAAK,iBAAiB;AACtB,OAAK,MAAM,OAAO;AAClB,MAAI,KAAK,KAAK;AACV,QAAK,SAAS,KAAK,IAAI,EAAE;AACrB,UAAM,IAAI,UAAU;GACvB;AACD,QAAKC,wBAAwB;EAChC;AAED,MAAI,KAAKb,SAAS,KAAK,KAAK,QAAQ,KAAK,KAAKC,aAAa,GAAG;AAC1D,SAAM,IAAI,UAAU;EACvB;AACD,OAAK,KAAK,iBAAiB,KAAKD,SAAS,KAAKC,UAAU;GACpD,MAAM,OAAO;AACb,OAAI,WAAW,KAAK,EAAE;AAClB,WAAO,IAAI,KAAK;IAChB,MAAM,MAAM,2DACR;AACJ,gBAAY,KAAK,yBAAyB,MAAM,SAAS;GAC5D;EACJ;CACJ;;;;;CAKD,gBAAgB,KAAK;AACjB,SAAO,KAAKf,QAAQ,IAAI,IAAI,GAAG,WAAW;CAC7C;CACD,yBAAyB;EACrB,MAAM,OAAO,IAAI,UAAU,KAAKc;EAChC,MAAM,SAAS,IAAI,UAAU,KAAKA;AAClC,OAAKhB,QAAQ;AACb,OAAKD,UAAU;AACf,OAAK+B,cAAc,CAAC,OAAO,KAAK,QAAQ,KAAK,KAAK,KAAK;AACnD,UAAO,SAAS,QAAQ,IAAI,QAAQ;AACpC,QAAK,SAAS;AACd,OAAI,QAAQ,KAAK,KAAK,cAAc;IAChC,MAAM,IAAI,WAAW,MAAM;AACvB,SAAI,KAAKf,SAAS,MAAM,EAAE;AACtB,WAAKgB,QAAQ,KAAK5B,SAAS,QAAQ,SAAS;KAC/C;IACJ,GAAE,MAAM,EAAE;;AAGX,QAAI,EAAE,OAAO;AACT,OAAE,OAAO;IACZ;GAEJ;EACJ;AACD,OAAK6B,iBAAiB,WAAS;AAC3B,UAAO,SAAS,KAAK,WAAW,IAAI,KAAK,KAAK,GAAG;EACpD;AACD,OAAKC,aAAa,CAAC,QAAQ,UAAU;AACjC,OAAI,KAAK,QAAQ;IACb,MAAM,MAAM,KAAK;IACjB,MAAM,QAAQ,OAAO;;AAErB,SAAK,QAAQ,MACT;AACJ,WAAO,MAAM;AACb,WAAO,QAAQ;AACf,WAAO,MAAM,aAAa,QAAQ;IAClC,MAAM,MAAM,OAAO,MAAM;AACzB,WAAO,eAAe,MAAM;GAC/B;EACJ;EAGD,IAAI,YAAY;EAChB,MAAM,SAAS,MAAM;GACjB,MAAM,IAAI,KAAK,KAAK;AACpB,OAAI,KAAK,gBAAgB,GAAG;AACxB,gBAAY;IACZ,MAAM,IAAI,WAAW,MAAO,YAAY,GAAI,KAAK,cAAc;;AAG/D,QAAI,EAAE,OAAO;AACT,OAAE,OAAO;IACZ;GAEJ;AACD,UAAO;EACV;AACD,OAAK,kBAAkB,SAAO;GAC1B,MAAM,QAAQ,KAAK/B,QAAQ,IAAI,IAAI;AACnC,OAAI,UAAU,WAAW;AACrB,WAAO;GACV;GACD,MAAM,MAAM,KAAK;GACjB,MAAM,QAAQ,OAAO;AACrB,QAAK,QAAQ,OAAO;AAChB,WAAO;GACV;GACD,MAAM,OAAO,aAAa,QAAQ,IAAI;AACtC,UAAO,MAAM;EAChB;AACD,OAAKa,WAAW,WAAS;GACrB,MAAM,IAAI,OAAO;GACjB,MAAM,IAAI,KAAK;AACf,YAAS,OAAO,MAAM,aAAa,QAAQ,IAAI,IAAI;EACtD;CACJ;CAED,iBAAiB,MAAM,CAAG;CAC1B,aAAa,MAAM,CAAG;CACtB,cAAc,MAAM,CAAG;;CAEvB,WAAW,MAAM;CACjB,0BAA0B;EACtB,MAAM,QAAQ,IAAI,UAAU,KAAKC;AACjC,OAAKE,kBAAkB;AACvB,OAAKjB,SAAS;AACd,OAAKiC,kBAAkB,WAAS;AAC5B,QAAKhB,mBAAmB,MAAM;AAC9B,SAAM,SAAS;EAClB;AACD,OAAKiB,eAAe,CAAC,GAAG,GAAG,MAAM,oBAAoB;AAGjD,OAAI,KAAKzB,mBAAmB,EAAE,EAAE;AAC5B,WAAO;GACV;AACD,QAAK,SAAS,KAAK,EAAE;AACjB,QAAI,iBAAiB;AACjB,gBAAW,oBAAoB,YAAY;AACvC,YAAM,IAAI,UAAU;KACvB;AACD,YAAO,gBAAgB,GAAG,EAAE;AAC5B,UAAK,SAAS,KAAK,EAAE;AACjB,YAAM,IAAI,UAAU;KACvB;IACJ,OACI;AACD,WAAM,IAAI,UAAU,oDAChB,2DACA;IACP;GACJ;AACD,UAAO;EACV;AACD,OAAK0B,eAAe,CAAC,OAAO,MAAM,WAAW;AACzC,SAAM,SAAS;AACf,OAAI,KAAKnB,UAAU;IACf,MAAM,UAAU,KAAKA,WAAW,MAAM;AACtC,WAAO,KAAKC,kBAAkB,SAAS;AACnC,UAAKmB,OAAO,KAAK;IACpB;GACJ;AACD,QAAKnB,mBAAmB,MAAM;AAC9B,OAAI,QAAQ;AACR,WAAO,YAAY;AACnB,WAAO,sBAAsB,KAAKA;GACrC;EACJ;CACJ;CACD,kBAAkB,QAAM,CAAG;CAC3B,eAAe,CAAC,IAAI,IAAI,QAAQ,CAAG;CACnC,eAAe,CAAC,IAAI,IAAI,MAAM,oBAAoB;AAC9C,MAAI,QAAQ,iBAAiB;AACzB,SAAM,IAAI,UAAU;EACvB;AACD,SAAO;CACV;CACD,CAACL,SAAS,EAAE,aAAa,KAAK,YAAY,GAAG,CAAE,GAAE;AAC7C,MAAI,KAAKM,OAAO;AACZ,QAAK,IAAI,IAAI,KAAKX,OAAO,OAAO;AAC5B,SAAK,KAAK8B,cAAc,EAAE,EAAE;AACxB;IACH;AACD,QAAI,eAAe,KAAKvB,SAAS,EAAE,EAAE;AACjC,WAAM;IACT;AACD,QAAI,MAAM,KAAKR,OAAO;AAClB;IACH,OACI;AACD,SAAI,KAAKD,MAAM;IAClB;GACJ;EACJ;CACJ;CACD,CAACQ,UAAU,EAAE,aAAa,KAAK,YAAY,GAAG,CAAE,GAAE;AAC9C,MAAI,KAAKK,OAAO;AACZ,QAAK,IAAI,IAAI,KAAKZ,OAAO,OAAO;AAC5B,SAAK,KAAK+B,cAAc,EAAE,EAAE;AACxB;IACH;AACD,QAAI,eAAe,KAAKvB,SAAS,EAAE,EAAE;AACjC,WAAM;IACT;AACD,QAAI,MAAM,KAAKP,OAAO;AAClB;IACH,OACI;AACD,SAAI,KAAKH,MAAM;IAClB;GACJ;EACJ;CACJ;CACD,cAAc,OAAO;AACjB,SAAQ,UAAU,aACd,KAAKH,QAAQ,IAAI,KAAKC,SAAS,OAAO,KAAK;CAClD;;;;;CAKD,CAAC,UAAU;AACP,OAAK,MAAM,KAAK,KAAKU,UAAU,EAAE;AAC7B,OAAI,KAAKT,SAAS,OAAO,aACrB,KAAKD,SAAS,OAAO,cACpB,KAAKO,mBAAmB,KAAKN,SAAS,GAAG,EAAE;AAC5C,UAAM,CAAC,KAAKD,SAAS,IAAI,KAAKC,SAAS,EAAG;GAC7C;EACJ;CACJ;;;;;;;CAOD,CAAC,WAAW;AACR,OAAK,MAAM,KAAK,KAAKU,WAAW,EAAE;AAC9B,OAAI,KAAKV,SAAS,OAAO,aACrB,KAAKD,SAAS,OAAO,cACpB,KAAKO,mBAAmB,KAAKN,SAAS,GAAG,EAAE;AAC5C,UAAM,CAAC,KAAKD,SAAS,IAAI,KAAKC,SAAS,EAAG;GAC7C;EACJ;CACJ;;;;;CAKD,CAAC,OAAO;AACJ,OAAK,MAAM,KAAK,KAAKS,UAAU,EAAE;GAC7B,MAAM,IAAI,KAAKV,SAAS;AACxB,OAAI,MAAM,cACL,KAAKO,mBAAmB,KAAKN,SAAS,GAAG,EAAE;AAC5C,UAAM;GACT;EACJ;CACJ;;;;;;;CAOD,CAAC,QAAQ;AACL,OAAK,MAAM,KAAK,KAAKU,WAAW,EAAE;GAC9B,MAAM,IAAI,KAAKX,SAAS;AACxB,OAAI,MAAM,cACL,KAAKO,mBAAmB,KAAKN,SAAS,GAAG,EAAE;AAC5C,UAAM;GACT;EACJ;CACJ;;;;;CAKD,CAAC,SAAS;AACN,OAAK,MAAM,KAAK,KAAKS,UAAU,EAAE;GAC7B,MAAM,IAAI,KAAKT,SAAS;AACxB,OAAI,MAAM,cACL,KAAKM,mBAAmB,KAAKN,SAAS,GAAG,EAAE;AAC5C,UAAM,KAAKA,SAAS;GACvB;EACJ;CACJ;;;;;;;CAOD,CAAC,UAAU;AACP,OAAK,MAAM,KAAK,KAAKU,WAAW,EAAE;GAC9B,MAAM,IAAI,KAAKV,SAAS;AACxB,OAAI,MAAM,cACL,KAAKM,mBAAmB,KAAKN,SAAS,GAAG,EAAE;AAC5C,UAAM,KAAKA,SAAS;GACvB;EACJ;CACJ;;;;;CAKD,CAAC,OAAO,YAAY;AAChB,SAAO,KAAK,SAAS;CACxB;;;;;;CAMD,CAAC,OAAO,eAAe;;;;;CAKvB,KAAK,IAAI,aAAa,CAAE,GAAE;AACtB,OAAK,MAAM,KAAK,KAAKS,UAAU,EAAE;GAC7B,MAAM,IAAI,KAAKT,SAAS;GACxB,MAAM,QAAQ,KAAKM,mBAAmB,EAAE,GAClC,EAAE,uBACF;AACN,OAAI,UAAU,UACV;AACJ,OAAI,GAAG,OAAO,KAAKP,SAAS,IAAI,KAAK,EAAE;AACnC,WAAO,KAAK,IAAI,KAAKA,SAAS,IAAI,WAAW;GAChD;EACJ;CACJ;;;;;;;;;;;;CAYD,QAAQ,IAAI,QAAQ,MAAM;AACtB,OAAK,MAAM,KAAK,KAAKU,UAAU,EAAE;GAC7B,MAAM,IAAI,KAAKT,SAAS;GACxB,MAAM,QAAQ,KAAKM,mBAAmB,EAAE,GAClC,EAAE,uBACF;AACN,OAAI,UAAU,UACV;AACJ,MAAG,KAAK,OAAO,OAAO,KAAKP,SAAS,IAAI,KAAK;EAChD;CACJ;;;;;CAKD,SAAS,IAAI,QAAQ,MAAM;AACvB,OAAK,MAAM,KAAK,KAAKW,WAAW,EAAE;GAC9B,MAAM,IAAI,KAAKV,SAAS;GACxB,MAAM,QAAQ,KAAKM,mBAAmB,EAAE,GAClC,EAAE,uBACF;AACN,OAAI,UAAU,UACV;AACJ,MAAG,KAAK,OAAO,OAAO,KAAKP,SAAS,IAAI,KAAK;EAChD;CACJ;;;;;CAKD,aAAa;EACT,IAAI,UAAU;AACd,OAAK,MAAM,KAAK,KAAKW,UAAU,EAAE,YAAY,KAAM,EAAC,EAAE;AAClD,OAAI,KAAKC,SAAS,EAAE,EAAE;AAClB,SAAKgB,QAAQ,KAAK5B,SAAS,IAAI,SAAS;AACxC,cAAU;GACb;EACJ;AACD,SAAO;CACV;;;;;;;;;;;;;CAaD,KAAK,KAAK;EACN,MAAM,IAAI,KAAKD,QAAQ,IAAI,IAAI;AAC/B,MAAI,MAAM,UACN,QAAO;EACX,MAAM,IAAI,KAAKE,SAAS;EACxB,MAAM,QAAQ,KAAKM,mBAAmB,EAAE,GAClC,EAAE,uBACF;AACN,MAAI,UAAU,UACV,QAAO;EACX,MAAM,QAAQ,EAAE,MAAO;AACvB,MAAI,KAAKV,SAAS,KAAKD,SAAS;GAC5B,MAAM,MAAM,KAAKC,MAAM;GACvB,MAAM,QAAQ,KAAKD,QAAQ;AAC3B,OAAI,OAAO,OAAO;IACd,MAAM,SAAS,OAAO,KAAK,KAAK,GAAG;AACnC,UAAM,MAAM;AACZ,UAAM,QAAQ,KAAK,KAAK;GAC3B;EACJ;AACD,MAAI,KAAKE,QAAQ;AACb,SAAM,OAAO,KAAKA,OAAO;EAC5B;AACD,SAAO;CACV;;;;;;;;;;;;;;CAcD,OAAO;EACH,MAAM,MAAM,CAAE;AACd,OAAK,MAAM,KAAK,KAAKY,SAAS,EAAE,YAAY,KAAM,EAAC,EAAE;GACjD,MAAM,MAAM,KAAKV,SAAS;GAC1B,MAAM,IAAI,KAAKC,SAAS;GACxB,MAAM,QAAQ,KAAKM,mBAAmB,EAAE,GAClC,EAAE,uBACF;AACN,OAAI,UAAU,aAAa,QAAQ,UAC/B;GACJ,MAAM,QAAQ,EAAE,MAAO;AACvB,OAAI,KAAKV,SAAS,KAAKD,SAAS;AAC5B,UAAM,MAAM,KAAKC,MAAM;IAGvB,MAAM,MAAM,KAAK,KAAK,GAAG,KAAKD,QAAQ;AACtC,UAAM,QAAQ,KAAK,MAAM,KAAK,KAAK,GAAG,IAAI;GAC7C;AACD,OAAI,KAAKE,QAAQ;AACb,UAAM,OAAO,KAAKA,OAAO;GAC5B;AACD,OAAI,QAAQ,CAAC,KAAK,KAAM,EAAC;EAC5B;AACD,SAAO;CACV;;;;;;;;;;CAUD,KAAK,KAAK;AACN,OAAK,OAAO;AACZ,OAAK,MAAM,CAAC,KAAK,MAAM,IAAI,KAAK;AAC5B,OAAI,MAAM,OAAO;IAOb,MAAM,MAAM,KAAK,KAAK,GAAG,MAAM;AAC/B,UAAM,QAAQ,KAAK,KAAK,GAAG;GAC9B;AACD,QAAK,IAAI,KAAK,MAAM,OAAO,MAAM;EACpC;CACJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA+BD,IAAI,GAAG,GAAG,aAAa,CAAE,GAAE;AACvB,MAAI,MAAM,WAAW;AACjB,QAAK,OAAO,EAAE;AACd,UAAO;EACV;EACD,MAAM,EAAE,MAAM,KAAK,KAAK,OAAO,iBAAiB,KAAK,gBAAgB,kBAAkB,KAAK,iBAAiB,QAAS,GAAG;EACzH,IAAI,EAAE,cAAc,KAAK,aAAa,GAAG;EACzC,MAAM,OAAO,KAAKkC,aAAa,GAAG,GAAG,WAAW,QAAQ,GAAG,gBAAgB;AAG3E,MAAI,KAAK,gBAAgB,OAAO,KAAK,cAAc;AAC/C,OAAI,QAAQ;AACR,WAAO,MAAM;AACb,WAAO,uBAAuB;GACjC;AAED,QAAKJ,QAAQ,GAAG,MAAM;AACtB,UAAO;EACV;EACD,IAAI,QAAQ,KAAKZ,UAAU,IAAI,YAAY,KAAKjB,QAAQ,IAAI,EAAE;AAC9D,MAAI,UAAU,WAAW;AAErB,WAAS,KAAKiB,UAAU,IAClB,KAAKX,QACL,KAAKC,MAAM,WAAW,IAClB,KAAKA,MAAM,KAAK,GAChB,KAAKU,UAAU,KAAKH,OAChB,KAAKqB,OAAO,MAAM,GAClB,KAAKlB;AACnB,QAAKhB,SAAS,SAAS;AACvB,QAAKC,SAAS,SAAS;AACvB,QAAKF,QAAQ,IAAI,GAAG,MAAM;AAC1B,QAAKG,MAAM,KAAKG,SAAS;AACzB,QAAKF,MAAM,SAAS,KAAKE;AACzB,QAAKA,QAAQ;AACb,QAAKW;AACL,QAAKiB,aAAa,OAAO,MAAM,OAAO;AACtC,OAAI,OACA,QAAO,MAAM;AACjB,iBAAc;EACjB,OACI;AAED,QAAKxB,YAAY,MAAM;GACvB,MAAM,SAAS,KAAKR,SAAS;AAC7B,OAAI,MAAM,QAAQ;AACd,QAAI,KAAKoB,mBAAmB,KAAKd,mBAAmB,OAAO,EAAE;AACzD,YAAO,kBAAkB,MAAM,IAAI,MAAM,YAAY;KACrD,MAAM,EAAE,sBAAsB,GAAG,GAAG;AACpC,SAAI,MAAM,cAAc,gBAAgB;AACpC,UAAI,KAAKgB,aAAa;AAClB,YAAKJ,WAAW,GAAG,GAAG,MAAM;MAC/B;AACD,UAAI,KAAKK,kBAAkB;AACvB,YAAKF,WAAW,KAAK;QAAC;QAAG;QAAG;OAAM,EAAC;MACtC;KACJ;IACJ,YACS,gBAAgB;AACtB,SAAI,KAAKC,aAAa;AAClB,WAAKJ,WAAW,QAAQ,GAAG,MAAM;KACpC;AACD,SAAI,KAAKK,kBAAkB;AACvB,WAAKF,WAAW,KAAK;OAAC;OAAQ;OAAG;MAAM,EAAC;KAC3C;IACJ;AACD,SAAKS,gBAAgB,MAAM;AAC3B,SAAKE,aAAa,OAAO,MAAM,OAAO;AACtC,SAAKhC,SAAS,SAAS;AACvB,QAAI,QAAQ;AACR,YAAO,MAAM;KACb,MAAM,WAAW,UAAU,KAAKM,mBAAmB,OAAO,GACpD,OAAO,uBACP;AACN,SAAI,aAAa,UACb,QAAO,WAAW;IACzB;GACJ,WACQ,QAAQ;AACb,WAAO,MAAM;GAChB;EACJ;AACD,MAAI,QAAQ,MAAM,KAAKV,OAAO;AAC1B,QAAK6B,wBAAwB;EAChC;AACD,MAAI,KAAK7B,OAAO;AACZ,QAAK,aAAa;AACd,SAAK8B,YAAY,OAAO,KAAK,MAAM;GACtC;AACD,OAAI,OACA,MAAKG,WAAW,QAAQ,MAAM;EACrC;AACD,OAAK,kBAAkB,KAAKN,oBAAoB,KAAKF,WAAW;GAC5D,MAAM,KAAK,KAAKA;GAChB,IAAI;AACJ,UAAQ,OAAO,IAAI,OAAO,EAAG;AACzB,SAAKF,gBAAgB,GAAG,KAAK;GAChC;EACJ;AACD,SAAO;CACV;;;;;CAKD,MAAM;AACF,MAAI;AACA,UAAO,KAAKJ,OAAO;IACf,MAAM,MAAM,KAAKf,SAAS,KAAKG;AAC/B,SAAK8B,OAAO,KAAK;AACjB,QAAI,KAAK3B,mBAAmB,IAAI,EAAE;AAC9B,SAAI,IAAI,sBAAsB;AAC1B,aAAO,IAAI;KACd;IACJ,WACQ,QAAQ,WAAW;AACxB,YAAO;IACV;GACJ;EACJ,UACO;AACJ,OAAI,KAAKiB,oBAAoB,KAAKF,WAAW;IACzC,MAAM,KAAK,KAAKA;IAChB,IAAI;AACJ,WAAQ,OAAO,IAAI,OAAO,EAAG;AACzB,UAAKF,gBAAgB,GAAG,KAAK;IAChC;GACJ;EACJ;CACJ;CACD,OAAO,MAAM;EACT,MAAM,OAAO,KAAKhB;EAClB,MAAM,IAAI,KAAKJ,SAAS;EACxB,MAAM,IAAI,KAAKC,SAAS;AACxB,MAAI,KAAKoB,mBAAmB,KAAKd,mBAAmB,EAAE,EAAE;AACpD,KAAE,kBAAkB,MAAM,IAAI,MAAM,WAAW;EAClD,WACQ,KAAKgB,eAAe,KAAKC,kBAAkB;AAChD,OAAI,KAAKD,aAAa;AAClB,SAAKJ,WAAW,GAAG,GAAG,QAAQ;GACjC;AACD,OAAI,KAAKK,kBAAkB;AACvB,SAAKF,WAAW,KAAK;KAAC;KAAG;KAAG;IAAQ,EAAC;GACxC;EACJ;AACD,OAAKS,gBAAgB,KAAK;AAE1B,MAAI,MAAM;AACN,QAAK/B,SAAS,QAAQ;AACtB,QAAKC,SAAS,QAAQ;AACtB,QAAKK,MAAM,KAAK,KAAK;EACxB;AACD,MAAI,KAAKU,UAAU,GAAG;AAClB,QAAKZ,QAAQ,KAAKC,QAAQ;AAC1B,QAAKC,MAAM,SAAS;EACvB,OACI;AACD,QAAKF,QAAQ,KAAKF,MAAM;EAC3B;AACD,OAAKH,QAAQ,OAAO,EAAE;AACtB,OAAKiB;AACL,SAAO;CACV;;;;;;;;;;;;;;;;;CAiBD,IAAI,GAAG,aAAa,CAAE,GAAE;EACpB,MAAM,EAAE,iBAAiB,KAAK,gBAAgB,QAAQ,GAAG;EACzD,MAAM,QAAQ,KAAKjB,QAAQ,IAAI,EAAE;AACjC,MAAI,UAAU,WAAW;GACrB,MAAM,IAAI,KAAKE,SAAS;AACxB,OAAI,KAAKM,mBAAmB,EAAE,IAC1B,EAAE,yBAAyB,WAAW;AACtC,WAAO;GACV;AACD,QAAK,KAAKK,SAAS,MAAM,EAAE;AACvB,QAAI,gBAAgB;AAChB,UAAKiB,eAAe,MAAM;IAC7B;AACD,QAAI,QAAQ;AACR,YAAO,MAAM;AACb,UAAKC,WAAW,QAAQ,MAAM;IACjC;AACD,WAAO;GACV,WACQ,QAAQ;AACb,WAAO,MAAM;AACb,SAAKA,WAAW,QAAQ,MAAM;GACjC;EACJ,WACQ,QAAQ;AACb,UAAO,MAAM;EAChB;AACD,SAAO;CACV;;;;;;;;CAQD,KAAK,GAAG,cAAc,CAAE,GAAE;EACtB,MAAM,EAAE,aAAa,KAAK,YAAY,GAAG;EACzC,MAAM,QAAQ,KAAK/B,QAAQ,IAAI,EAAE;AACjC,MAAI,UAAU,cACR,cAAc,KAAKa,SAAS,MAAM,EAAG;AACvC;EACH;EACD,MAAM,IAAI,KAAKX,SAAS;AAExB,SAAO,KAAKM,mBAAmB,EAAE,GAAG,EAAE,uBAAuB;CAChE;CACD,iBAAiB,GAAG,OAAO,SAAS,SAAS;EACzC,MAAM,IAAI,UAAU,YAAY,YAAY,KAAKN,SAAS;AAC1D,MAAI,KAAKM,mBAAmB,EAAE,EAAE;AAC5B,UAAO;EACV;EACD,MAAM,KAAK,IAAI;EACf,MAAM,EAAE,QAAQ,GAAG;AAEnB,UAAQ,iBAAiB,SAAS,MAAM,GAAG,MAAM,OAAO,OAAO,EAAE,EAC7D,QAAQ,GAAG,OACd,EAAC;EACF,MAAM,YAAY;GACd,QAAQ,GAAG;GACX;GACA;EACH;EACD,MAAM,KAAK,CAAC6B,KAAG,cAAc,UAAU;GACnC,MAAM,EAAE,SAAS,GAAG,GAAG;GACvB,MAAM,cAAc,QAAQ,oBAAoBA,QAAM;AACtD,OAAI,QAAQ,QAAQ;AAChB,QAAI,YAAY,aAAa;AACzB,aAAQ,OAAO,eAAe;AAC9B,aAAQ,OAAO,aAAa,GAAG,OAAO;AACtC,SAAI,YACA,SAAQ,OAAO,oBAAoB;IAC1C,OACI;AACD,aAAQ,OAAO,gBAAgB;IAClC;GACJ;AACD,OAAI,YAAY,gBAAgB,aAAa;AACzC,WAAO,UAAU,GAAG,OAAO,OAAO;GACrC;GAED,MAAMC,OAAK;AACX,OAAI,KAAKpC,SAAS,WAAW,GAAG;AAC5B,QAAImC,QAAM,WAAW;AACjB,SAAIC,KAAG,sBAAsB;AACzB,WAAKpC,SAAS,SAASoC,KAAG;KAC7B,OACI;AACD,WAAKT,QAAQ,GAAG,QAAQ;KAC3B;IACJ,OACI;AACD,SAAI,QAAQ,OACR,SAAQ,OAAO,eAAe;AAClC,UAAK,IAAI,GAAGQ,KAAG,UAAU,QAAQ;IACpC;GACJ;AACD,UAAOA;EACV;EACD,MAAM,KAAK,CAAC,OAAO;AACf,OAAI,QAAQ,QAAQ;AAChB,YAAQ,OAAO,gBAAgB;AAC/B,YAAQ,OAAO,aAAa;GAC/B;AACD,UAAO,UAAU,GAAG;EACvB;EACD,MAAM,YAAY,CAAC,OAAO;GACtB,MAAM,EAAE,SAAS,GAAG,GAAG;GACvB,MAAM,oBAAoB,WAAW,QAAQ;GAC7C,MAAM,aAAa,qBAAqB,QAAQ;GAChD,MAAM,WAAW,cAAc,QAAQ;GACvC,MAAMC,OAAK;AACX,OAAI,KAAKpC,SAAS,WAAW,GAAG;IAG5B,MAAM,OAAO,YAAYoC,KAAG,yBAAyB;AACrD,QAAI,KAAK;AACL,UAAKT,QAAQ,GAAG,QAAQ;IAC3B,YACS,mBAAmB;AAKzB,UAAK3B,SAAS,SAASoC,KAAG;IAC7B;GACJ;AACD,OAAI,YAAY;AACZ,QAAI,QAAQ,UAAUA,KAAG,yBAAyB,WAAW;AACzD,aAAQ,OAAO,gBAAgB;IAClC;AACD,WAAOA,KAAG;GACb,WACQA,KAAG,eAAeA,MAAI;AAC3B,UAAM;GACT;EACJ;EACD,MAAM,QAAQ,CAAC,KAAK,QAAQ;GACxB,MAAM,MAAM,KAAKpB,eAAe,GAAG,GAAG,UAAU;AAChD,OAAI,OAAO,eAAe,SAAS;AAC/B,QAAI,KAAK,SAAK,IAAImB,QAAM,YAAY,YAAYA,IAAE,EAAE,IAAI;GAC3D;AAID,MAAG,OAAO,iBAAiB,SAAS,MAAM;AACtC,SAAK,QAAQ,oBACT,QAAQ,wBAAwB;AAChC,SAAI,UAAU;AAEd,SAAI,QAAQ,wBAAwB;AAChC,YAAM,SAAK,GAAGA,KAAG,KAAK;KACzB;IACJ;GACJ,EAAC;EACL;AACD,MAAI,QAAQ,OACR,SAAQ,OAAO,kBAAkB;EACrC,MAAM,IAAI,IAAI,QAAQ,OAAO,KAAK,IAAI,GAAG;EACzC,MAAM,KAAK,OAAO,OAAO,GAAG;GACxB,mBAAmB;GACnB,sBAAsB;GACtB,YAAY;EACf,EAAC;AACF,MAAI,UAAU,WAAW;AAErB,QAAK,IAAI,GAAG,IAAI;IAAE,GAAG,UAAU;IAAS,QAAQ;GAAW,EAAC;AAC5D,WAAQ,KAAKrC,QAAQ,IAAI,EAAE;EAC9B,OACI;AACD,QAAKE,SAAS,SAAS;EAC1B;AACD,SAAO;CACV;CACD,mBAAmB,GAAG;AAClB,OAAK,KAAKoB,gBACN,QAAO;EACX,MAAM,IAAI;AACV,WAAU,KACN,aAAa,WACb,EAAE,eAAe,uBAAuB,IACxC,EAAE,6BAA6B;CACtC;CACD,MAAM,MAAM,GAAG,eAAe,CAAE,GAAE;EAC9B,MAAM,EAEN,aAAa,KAAK,YAAY,iBAAiB,KAAK,gBAAgB,qBAAqB,KAAK,oBAE9F,MAAM,KAAK,KAAK,iBAAiB,KAAK,gBAAgB,OAAO,GAAG,kBAAkB,KAAK,iBAAiB,cAAc,KAAK,aAE3H,2BAA2B,KAAK,0BAA0B,6BAA6B,KAAK,4BAA4B,mBAAmB,KAAK,kBAAkB,yBAAyB,KAAK,wBAAwB,SAAS,eAAe,OAAO,QAAQ,QAAS,GAAG;AAC3Q,OAAK,KAAKA,iBAAiB;AACvB,OAAI,OACA,QAAO,QAAQ;AACnB,UAAO,KAAK,IAAI,GAAG;IACf;IACA;IACA;IACA;GACH,EAAC;EACL;EACD,MAAM,UAAU;GACZ;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EACH;EACD,IAAI,QAAQ,KAAKtB,QAAQ,IAAI,EAAE;AAC/B,MAAI,UAAU,WAAW;AACrB,OAAI,OACA,QAAO,QAAQ;GACnB,MAAM,IAAI,KAAKS,iBAAiB,GAAG,OAAO,SAAS,QAAQ;AAC3D,UAAQ,EAAE,aAAa;EAC1B,OACI;GAED,MAAM,IAAI,KAAKP,SAAS;AACxB,OAAI,KAAKM,mBAAmB,EAAE,EAAE;IAC5B,MAAM,QAAQ,cAAc,EAAE,yBAAyB;AACvD,QAAI,QAAQ;AACR,YAAO,QAAQ;AACf,SAAI,MACA,QAAO,gBAAgB;IAC9B;AACD,WAAO,QAAQ,EAAE,uBAAwB,EAAE,aAAa;GAC3D;GAGD,MAAM,UAAU,KAAKK,SAAS,MAAM;AACpC,QAAK,iBAAiB,SAAS;AAC3B,QAAI,OACA,QAAO,QAAQ;AACnB,SAAKH,YAAY,MAAM;AACvB,QAAI,gBAAgB;AAChB,UAAKoB,eAAe,MAAM;IAC7B;AACD,QAAI,OACA,MAAKC,WAAW,QAAQ,MAAM;AAClC,WAAO;GACV;GAGD,MAAM,IAAI,KAAKtB,iBAAiB,GAAG,OAAO,SAAS,QAAQ;GAC3D,MAAM,WAAW,EAAE,yBAAyB;GAC5C,MAAM,WAAW,YAAY;AAC7B,OAAI,QAAQ;AACR,WAAO,QAAQ,UAAU,UAAU;AACnC,QAAI,YAAY,QACZ,QAAO,gBAAgB;GAC9B;AACD,UAAO,WAAW,EAAE,uBAAwB,EAAE,aAAa;EAC9D;CACJ;CACD,MAAM,WAAW,GAAG,eAAe,CAAE,GAAE;EACnC,MAAM,IAAI,MAAM,KAAK,MAAM,GAAG,aAAa;AAC3C,MAAI,MAAM,UACN,OAAM,IAAI,MAAM;AACpB,SAAO;CACV;CACD,KAAK,GAAG,cAAc,CAAE,GAAE;EACtB,MAAM,aAAa,KAAKU;AACxB,OAAK,YAAY;AACb,SAAM,IAAI,MAAM;EACnB;EACD,MAAM,EAAE,SAAS,aAAc,GAAG,SAAS,GAAG;EAC9C,MAAM,IAAI,KAAK,IAAI,GAAG,QAAQ;AAC9B,OAAK,gBAAgB,MAAM,UACvB,QAAO;EACX,MAAM,KAAK,WAAW,GAAG,GAAG;GACxB;GACA;EACH,EAAC;AACF,OAAK,IAAI,GAAG,IAAI,QAAQ;AACxB,SAAO;CACV;;;;;;;CAOD,IAAI,GAAG,aAAa,CAAE,GAAE;EACpB,MAAM,EAAE,aAAa,KAAK,YAAY,iBAAiB,KAAK,gBAAgB,qBAAqB,KAAK,oBAAoB,QAAS,GAAG;EACtI,MAAM,QAAQ,KAAKnB,QAAQ,IAAI,EAAE;AACjC,MAAI,UAAU,WAAW;GACrB,MAAM,QAAQ,KAAKE,SAAS;GAC5B,MAAM,WAAW,KAAKM,mBAAmB,MAAM;AAC/C,OAAI,OACA,MAAKuB,WAAW,QAAQ,MAAM;AAClC,OAAI,KAAKlB,SAAS,MAAM,EAAE;AACtB,QAAI,OACA,QAAO,MAAM;AAEjB,SAAK,UAAU;AACX,UAAK,oBAAoB;AACrB,WAAKgB,QAAQ,GAAG,SAAS;KAC5B;AACD,SAAI,UAAU,WACV,QAAO,gBAAgB;AAC3B,YAAO,aAAa,QAAQ;IAC/B,OACI;AACD,SAAI,UACA,cACA,MAAM,yBAAyB,WAAW;AAC1C,aAAO,gBAAgB;KAC1B;AACD,YAAO,aAAa,MAAM,uBAAuB;IACpD;GACJ,OACI;AACD,QAAI,OACA,QAAO,MAAM;AAMjB,QAAI,UAAU;AACV,YAAO,MAAM;IAChB;AACD,SAAKnB,YAAY,MAAM;AACvB,QAAI,gBAAgB;AAChB,UAAKoB,eAAe,MAAM;IAC7B;AACD,WAAO;GACV;EACJ,WACQ,QAAQ;AACb,UAAO,MAAM;EAChB;CACJ;CACD,SAAS,GAAG,GAAG;AACX,OAAK1B,MAAM,KAAK;AAChB,OAAKD,MAAM,KAAK;CACnB;CACD,YAAY,OAAO;AASf,MAAI,UAAU,KAAKG,OAAO;AACtB,OAAI,UAAU,KAAKD,OAAO;AACtB,SAAKA,QAAQ,KAAKF,MAAM;GAC3B,OACI;AACD,SAAKoC,SAAS,KAAKnC,MAAM,QAAQ,KAAKD,MAAM,OAAO;GACtD;AACD,QAAKoC,SAAS,KAAKjC,OAAO,MAAM;AAChC,QAAKA,QAAQ;EAChB;CACJ;;;;;;CAMD,OAAO,GAAG;AACN,SAAO,KAAKuB,QAAQ,GAAG,SAAS;CACnC;CACD,QAAQ,GAAG,QAAQ;EACf,IAAI,UAAU;AACd,MAAI,KAAKZ,UAAU,GAAG;GAClB,MAAM,QAAQ,KAAKjB,QAAQ,IAAI,EAAE;AACjC,OAAI,UAAU,WAAW;AACrB,cAAU;AACV,QAAI,KAAKiB,UAAU,GAAG;AAClB,UAAKuB,OAAO,OAAO;IACtB,OACI;AACD,UAAKR,gBAAgB,MAAM;KAC3B,MAAM,IAAI,KAAK9B,SAAS;AACxB,SAAI,KAAKM,mBAAmB,EAAE,EAAE;AAC5B,QAAE,kBAAkB,MAAM,IAAI,MAAM,WAAW;KAClD,WACQ,KAAKgB,eAAe,KAAKC,kBAAkB;AAChD,UAAI,KAAKD,aAAa;AAClB,YAAKJ,WAAW,GAAG,GAAG,OAAO;MAChC;AACD,UAAI,KAAKK,kBAAkB;AACvB,YAAKF,WAAW,KAAK;QAAC;QAAG;QAAG;OAAO,EAAC;MACvC;KACJ;AACD,UAAKvB,QAAQ,OAAO,EAAE;AACtB,UAAKC,SAAS,SAAS;AACvB,UAAKC,SAAS,SAAS;AACvB,SAAI,UAAU,KAAKI,OAAO;AACtB,WAAKA,QAAQ,KAAKF,MAAM;KAC3B,WACQ,UAAU,KAAKC,OAAO;AAC3B,WAAKA,QAAQ,KAAKF,MAAM;KAC3B,OACI;MACD,MAAM,KAAK,KAAKC,MAAM;AACtB,WAAKD,MAAM,MAAM,KAAKA,MAAM;MAC5B,MAAM,KAAK,KAAKA,MAAM;AACtB,WAAKC,MAAM,MAAM,KAAKA,MAAM;KAC/B;AACD,UAAKa;AACL,UAAKV,MAAM,KAAK,MAAM;IACzB;GACJ;EACJ;AACD,MAAI,KAAKkB,oBAAoB,KAAKF,WAAW,QAAQ;GACjD,MAAM,KAAK,KAAKA;GAChB,IAAI;AACJ,UAAQ,OAAO,IAAI,OAAO,EAAG;AACzB,SAAKF,gBAAgB,GAAG,KAAK;GAChC;EACJ;AACD,SAAO;CACV;;;;CAID,QAAQ;AACJ,SAAO,KAAKmB,OAAO,SAAS;CAC/B;CACD,OAAO,QAAQ;AACX,OAAK,MAAM,SAAS,KAAK5B,UAAU,EAAE,YAAY,KAAM,EAAC,EAAE;GACtD,MAAM,IAAI,KAAKV,SAAS;AACxB,OAAI,KAAKM,mBAAmB,EAAE,EAAE;AAC5B,MAAE,kBAAkB,MAAM,IAAI,MAAM,WAAW;GAClD,OACI;IACD,MAAM,IAAI,KAAKP,SAAS;AACxB,QAAI,KAAKuB,aAAa;AAClB,UAAKJ,WAAW,GAAG,GAAG,OAAO;IAChC;AACD,QAAI,KAAKK,kBAAkB;AACvB,UAAKF,WAAW,KAAK;MAAC;MAAG;MAAG;KAAO,EAAC;IACvC;GACJ;EACJ;AACD,OAAKvB,QAAQ,OAAO;AACpB,OAAKE,SAAS,KAAK,UAAU;AAC7B,OAAKD,SAAS,KAAK,UAAU;AAC7B,MAAI,KAAKH,SAAS,KAAKD,SAAS;AAC5B,QAAKC,MAAM,KAAK,EAAE;AAClB,QAAKD,QAAQ,KAAK,EAAE;EACvB;AACD,MAAI,KAAKE,QAAQ;AACb,QAAKA,OAAO,KAAK,EAAE;EACtB;AACD,OAAKM,QAAQ;AACb,OAAKC,QAAQ;AACb,OAAKC,MAAM,SAAS;AACpB,OAAKS,kBAAkB;AACvB,OAAKC,QAAQ;AACb,MAAI,KAAKQ,oBAAoB,KAAKF,WAAW;GACzC,MAAM,KAAK,KAAKA;GAChB,IAAI;AACJ,UAAQ,OAAO,IAAI,OAAO,EAAG;AACzB,SAAKF,gBAAgB,GAAG,KAAK;GAChC;EACJ;CACJ;AACJ;;;;ACpgDD,MAAM,cAAc,YAAY,YAAY,UACtC,UACA;CACE,QAAQ;CACR,QAAQ;AACX;;;;;AAQL,MAAa,WAAW,CAAC,QAAQ,YACtB,MAAM,aACZ,aAAa,YACV,aAAaoB,uBACb,WAAW,EAAE,IACb,WAAW,EAAE;;;;AAIrB,MAAa,aAAa,CAAC,QAAQ,YACxB,MAAM,YACb,aAAaC,mCACN,EAAE,SAAS,cAElB,EAAE,SAASD,oBAAO,SAAS,UAAU;;;;AAIzC,MAAa,aAAa,CAAC,QAAQ,YACxB,MAAM,YACb,aAAaC,mCACN,EAAE,UAAU,qBACZ,EAAE,QAAQ;AACrB,MAAM,MAAM,OAAO,MAAM;AACzB,MAAM,iBAAiB,OAAO,eAAe;AAC7C,MAAM,cAAc,OAAO,aAAa;AACxC,MAAM,eAAe,OAAO,cAAc;AAC1C,MAAM,gBAAgB,OAAO,eAAe;AAC5C,MAAM,SAAS,OAAO,SAAS;AAC/B,MAAM,OAAO,OAAO,OAAO;AAC3B,MAAM,QAAQ,OAAO,QAAQ;AAC7B,MAAM,aAAa,OAAO,aAAa;AACvC,MAAM,WAAW,OAAO,WAAW;AACnC,MAAM,UAAU,OAAO,UAAU;AACjC,MAAM,UAAU,OAAO,UAAU;AACjC,MAAM,SAAS,OAAO,SAAS;AAC/B,MAAM,SAAS,OAAO,SAAS;AAC/B,MAAM,SAAS,OAAO,SAAS;AAC/B,MAAM,QAAQ,OAAO,QAAQ;AAC7B,MAAM,eAAe,OAAO,eAAe;AAC3C,MAAM,aAAa,OAAO,aAAa;AACvC,MAAM,cAAc,OAAO,cAAc;AACzC,MAAM,aAAa,OAAO,aAAa;AAEvC,MAAM,YAAY,OAAO,YAAY;AAErC,MAAM,QAAQ,OAAO,QAAQ;AAC7B,MAAM,WAAW,OAAO,WAAW;AACnC,MAAM,UAAU,OAAO,UAAU;AACjC,MAAM,WAAW,OAAO,WAAW;AACnC,MAAM,QAAQ,OAAO,QAAQ;AAC7B,MAAM,QAAQ,OAAO,QAAQ;AAC7B,MAAM,UAAU,OAAO,UAAU;AACjC,MAAM,SAAS,OAAO,SAAS;AAC/B,MAAM,gBAAgB,OAAO,gBAAgB;AAC7C,MAAM,YAAY,OAAO,YAAY;AACrC,MAAM,QAAQ,CAAC,OAAO,QAAQ,SAAS,CAAC,KAAK,GAAG;AAChD,MAAM,UAAU,CAAC,OAAO,IAAI;AAC5B,MAAM,WAAW,CAAC,OAAO,OAAO,SAAS,OAAO,YAAY,OAAO;AACnE,MAAM,oBAAoB,CAAC,MAAM,aAAa,iBACvC,YACQ,MAAM,YACb,EAAE,eACF,EAAE,YAAY,SAAS,iBACvB,EAAE,cAAc;AACxB,MAAM,oBAAoB,CAAC,OAAO,OAAO,SAAS,EAAE,IAAI,YAAY,OAAO,EAAE;;;;;;AAM7E,IAAM,OAAN,MAAW;CACP;CACA;CACA;CACA;CACA,YAAY,KAAK,MAAM,MAAM;AACzB,OAAK,MAAM;AACX,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,UAAU,MAAM,IAAI,SAAS;AAClC,OAAK,KAAK,GAAG,SAAS,KAAK,QAAQ;CACtC;CACD,SAAS;AACL,OAAK,KAAK,eAAe,SAAS,KAAK,QAAQ;CAClD;;CAGD,YAAY,KAAK,CAAG;;CAEpB,MAAM;AACF,OAAK,QAAQ;AACb,MAAI,KAAK,KAAK,IACV,MAAK,KAAK,KAAK;CACtB;AACJ;;;;;;;AAOD,IAAM,kBAAN,cAA8B,KAAK;CAC/B,SAAS;AACL,OAAK,IAAI,eAAe,SAAS,KAAK,YAAY;AAClD,QAAM,QAAQ;CACjB;CACD,YAAY,KAAK,MAAM,MAAM;AACzB,QAAM,KAAK,MAAM,KAAK;AACtB,OAAK,cAAc,QAAM,KAAK,KAAK,SAAS,GAAG;AAC/C,MAAI,GAAG,SAAS,KAAK,YAAY;CACpC;AACJ;AACD,MAAM,sBAAsB,CAAC,QAAQ,EAAE;AACvC,MAAM,oBAAoB,CAAC,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,aAAa;;;;;;;;;;;;AAYjF,IAAa,WAAb,cAA8BA,yBAAa;CACvC,CAAC,WAAW;CACZ,CAAC,UAAU;CACX,CAAC,SAAS,CAAE;CACZ,CAAC,UAAU,CAAE;CACb,CAAC;CACD,CAAC;CACD,CAAC;CACD,CAAC;CACD,CAAC,OAAO;CACR,CAAC,eAAe;CAChB,CAAC,gBAAgB;CACjB,CAAC,UAAU;CACX,CAAC,iBAAiB;CAClB,CAAC,gBAAgB;CACjB,CAAC,aAAa;CACd,CAAC;CACD,CAAC,WAAW;CACZ,CAAC,iBAAiB;CAClB,CAAC,aAAa;;;;CAId,WAAW;;;;CAIX,WAAW;;;;;;;CAOX,YAAY,GAAG,MAAM;EACjB,MAAM,UAAW,KAAK,MAClB,CAAE;AACN,SAAO;AACP,MAAI,QAAQ,qBAAqB,QAAQ,aAAa,UAAU;AAC5D,SAAM,IAAI,UAAU;EACvB;AACD,MAAI,oBAAoB,QAAQ,EAAE;AAC9B,QAAK,cAAc;AACnB,QAAK,YAAY;EACpB,WACQ,kBAAkB,QAAQ,EAAE;AACjC,QAAK,YAAY,QAAQ;AACzB,QAAK,cAAc;EACtB,OACI;AACD,QAAK,cAAc;AACnB,QAAK,YAAY;EACpB;AACD,OAAK,WAAW,QAAQ;AACxB,OAAK,WAAW,KAAK,YACf,IAAIC,kCAAc,KAAK,aACvB;AAEN,MAAI,WAAW,QAAQ,sBAAsB,MAAM;AAC/C,UAAO,eAAe,MAAM,UAAU,EAAE,KAAK,MAAM,KAAK,QAAS,EAAC;EACrE;AAED,MAAI,WAAW,QAAQ,qBAAqB,MAAM;AAC9C,UAAO,eAAe,MAAM,SAAS,EAAE,KAAK,MAAM,KAAK,OAAQ,EAAC;EACnE;EACD,MAAM,EAAE,QAAQ,GAAG;AACnB,MAAI,QAAQ;AACR,QAAK,UAAU;AACf,OAAI,OAAO,SAAS;AAChB,SAAK,QAAQ;GAChB,OACI;AACD,WAAO,iBAAiB,SAAS,MAAM,KAAK,QAAQ,CAAC;GACxD;EACJ;CACJ;;;;;;;;;;CAUD,IAAI,eAAe;AACf,SAAO,KAAK;CACf;;;;CAID,IAAI,WAAW;AACX,SAAO,KAAK;CACf;;;;CAID,IAAI,SAAS,MAAM;AACf,QAAM,IAAI,MAAM;CACnB;;;;CAID,YAAY,MAAM;AACd,QAAM,IAAI,MAAM;CACnB;;;;CAID,IAAI,aAAa;AACb,SAAO,KAAK;CACf;;;;CAID,IAAI,WAAW,KAAK;AAChB,QAAM,IAAI,MAAM;CACnB;;;;CAID,KAAK,WAAW;AACZ,SAAO,KAAK;CACf;;;;;;;;CAQD,KAAK,SAAS,GAAG;AACb,OAAK,SAAS,KAAK,YAAY;CAClC;CAED,CAAC,SAAS;AACN,OAAK,WAAW;AAChB,OAAK,KAAK,SAAS,KAAK,SAAS,OAAO;AACxC,OAAK,QAAQ,KAAK,SAAS,OAAO;CACrC;;;;CAID,IAAI,UAAU;AACV,SAAO,KAAK;CACf;;;;;CAKD,IAAI,QAAQ,GAAG,CAAG;CAClB,MAAM,OAAO,UAAU,IAAI;AACvB,MAAI,KAAK,SACL,QAAO;AACX,MAAI,KAAK,KACL,OAAM,IAAI,MAAM;AACpB,MAAI,KAAK,YAAY;AACjB,QAAK,KAAK,SAAS,OAAO,OAAO,IAAI,MAAM,mDAAmD,EAAE,MAAM,uBAAwB,EAAC,CAAC;AAChI,UAAO;EACV;AACD,aAAW,aAAa,YAAY;AAChC,QAAK;AACL,cAAW;EACd;AACD,OAAK,SACD,YAAW;EACf,MAAM,KAAK,KAAK,SAAS,QAAQ;AAKjC,OAAK,KAAK,gBAAgB,OAAO,SAAS,MAAM,EAAE;AAC9C,OAAI,kBAAkB,MAAM,EAAE;AAE1B,YAAQ,OAAO,KAAK,MAAM,QAAQ,MAAM,YAAY,MAAM,WAAW;GACxE,WACQ,kBAAkB,MAAM,EAAE;AAE/B,YAAQ,OAAO,KAAK,MAAM;GAC7B,kBACe,UAAU,UAAU;AAChC,UAAM,IAAI,MAAM;GACnB;EACJ;AAGD,MAAI,KAAK,aAAa;;AAGlB,OAAI,KAAK,YAAY,KAAK,kBAAkB,EACxC,MAAK,OAAO,KAAK;;AAErB,OAAI,KAAK,SACL,MAAK,KAAK,QAAQ,MAAM;OAExB,MAAK,YAAY,MAAM;AAC3B,OAAI,KAAK,kBAAkB,EACvB,MAAK,KAAK,WAAW;AACzB,OAAI,GACA,IAAG,GAAG;AACV,UAAO,KAAK;EACf;AAGD,OAAK,MAAM,QAAQ;AACf,OAAI,KAAK,kBAAkB,EACvB,MAAK,KAAK,WAAW;AACzB,OAAI,GACA,IAAG,GAAG;AACV,UAAO,KAAK;EACf;AAGD,aAAW,UAAU,cAEf,aAAa,KAAK,cAAc,KAAK,UAAU,WAAW;AAE5D,WAAQ,OAAO,KAAK,OAAO,SAAS;EACvC;AACD,MAAI,OAAO,SAAS,MAAM,IAAI,KAAK,WAAW;AAE1C,WAAQ,KAAK,SAAS,MAAM,MAAM;EACrC;AAED,MAAI,KAAK,YAAY,KAAK,kBAAkB,EACxC,MAAK,OAAO,KAAK;AACrB,MAAI,KAAK,SACL,MAAK,KAAK,QAAQ,MAAM;MAExB,MAAK,YAAY,MAAM;AAC3B,MAAI,KAAK,kBAAkB,EACvB,MAAK,KAAK,WAAW;AACzB,MAAI,GACA,IAAG,GAAG;AACV,SAAO,KAAK;CACf;;;;;;;;;;;;;;CAcD,KAAK,GAAG;AACJ,MAAI,KAAK,WACL,QAAO;AACX,OAAK,aAAa;AAClB,MAAI,KAAK,kBAAkB,KACvB,MAAM,KACL,KAAK,IAAI,KAAK,eAAgB;AAC/B,QAAK,iBAAiB;AACtB,UAAO;EACV;AACD,MAAI,KAAK,YACL,KAAI;AACR,MAAI,KAAK,QAAQ,SAAS,MAAM,KAAK,aAAa;AAG9C,QAAK,UAAU,CACV,KAAK,YACA,KAAK,QAAQ,KAAK,GAAG,GACrB,OAAO,OAAO,KAAK,SAAS,KAAK,cAAc,AACxD;EACJ;EACD,MAAM,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,QAAQ,GAAG;AAClD,OAAK,iBAAiB;AACtB,SAAO;CACV;CACD,CAAC,MAAM,GAAG,OAAO;AACb,MAAI,KAAK,YACL,MAAK,cAAc;OAClB;GACD,MAAM,IAAI;AACV,OAAI,MAAM,EAAE,UAAU,MAAM,KACxB,MAAK,cAAc;mBACP,MAAM,UAAU;AAC5B,SAAK,QAAQ,KAAK,EAAE,MAAM,EAAE;AAC5B,YAAQ,EAAE,MAAM,GAAG,EAAE;AACrB,SAAK,iBAAiB;GACzB,OACI;AACD,SAAK,QAAQ,KAAK,EAAE,SAAS,EAAE;AAC/B,YAAQ,EAAE,SAAS,GAAG,EAAE;AACxB,SAAK,iBAAiB;GACzB;EACJ;AACD,OAAK,KAAK,QAAQ,MAAM;AACxB,OAAK,KAAK,QAAQ,WAAW,KAAK,KAC9B,MAAK,KAAK,QAAQ;AACtB,SAAO;CACV;CACD,IAAI,OAAO,UAAU,IAAI;AACrB,aAAW,UAAU,YAAY;AAC7B,QAAK;AACL,WAAQ;EACX;AACD,aAAW,aAAa,YAAY;AAChC,QAAK;AACL,cAAW;EACd;AACD,MAAI,UAAU,UACV,MAAK,MAAM,OAAO,SAAS;AAC/B,MAAI,GACA,MAAK,KAAK,OAAO,GAAG;AACxB,OAAK,OAAO;AACZ,OAAK,WAAW;AAKhB,MAAI,KAAK,aAAa,KAAK,QACvB,MAAK,iBAAiB;AAC1B,SAAO;CACV;CAED,CAAC,UAAU;AACP,MAAI,KAAK,WACL;AACJ,OAAK,KAAK,mBAAmB,KAAK,OAAO,QAAQ;AAC7C,QAAK,aAAa;EACrB;AACD,OAAK,UAAU;AACf,OAAK,WAAW;AAChB,OAAK,KAAK,SAAS;AACnB,MAAI,KAAK,QAAQ,OACb,MAAK,QAAQ;WACR,KAAK,KACV,MAAK,iBAAiB;MAEtB,MAAK,KAAK,QAAQ;CACzB;;;;;;;;;;CAUD,SAAS;AACL,SAAO,KAAK,SAAS;CACxB;;;;CAID,QAAQ;AACJ,OAAK,WAAW;AAChB,OAAK,UAAU;AACf,OAAK,aAAa;CACrB;;;;CAID,IAAI,YAAY;AACZ,SAAO,KAAK;CACf;;;;;CAKD,IAAI,UAAU;AACV,SAAO,KAAK;CACf;;;;CAID,IAAI,SAAS;AACT,SAAO,KAAK;CACf;CACD,CAAC,YAAY,OAAO;AAChB,MAAI,KAAK,YACL,MAAK,iBAAiB;MAEtB,MAAK,iBAAiB,MAAM;AAChC,OAAK,QAAQ,KAAK,MAAM;CAC3B;CACD,CAAC,eAAe;AACZ,MAAI,KAAK,YACL,MAAK,iBAAiB;MAEtB,MAAK,iBAAiB,KAAK,QAAQ,GAAG;AAC1C,SAAO,KAAK,QAAQ,OAAO;CAC9B;CACD,CAAC,OAAO,UAAU,OAAO;AACrB,KAAG,CAAG,SAAQ,KAAK,YAAY,KAAK,cAAc,CAAC,IAC/C,KAAK,QAAQ;AACjB,OAAK,YAAY,KAAK,QAAQ,WAAW,KAAK,KAC1C,MAAK,KAAK,QAAQ;CACzB;CACD,CAAC,YAAY,OAAO;AAChB,OAAK,KAAK,QAAQ,MAAM;AACxB,SAAO,KAAK;CACf;;;;;;CAMD,KAAK,MAAM,MAAM;AACb,MAAI,KAAK,WACL,QAAO;AACX,OAAK,aAAa;EAClB,MAAM,QAAQ,KAAK;AACnB,SAAO,QAAQ,CAAE;AACjB,MAAI,SAAS,KAAK,UAAU,SAAS,KAAK,OACtC,MAAK,MAAM;MAEX,MAAK,MAAM,KAAK,QAAQ;AAC5B,OAAK,gBAAgB,KAAK;AAE1B,MAAI,OAAO;AACP,OAAI,KAAK,IACL,MAAK,KAAK;EACjB,OACI;AAGD,QAAK,OAAO,MAAM,KAAK,cACjB,IAAI,KAAK,MAAM,MAAM,QACrB,IAAI,gBAAgB,MAAM,MAAM,MAAM;AAC5C,OAAI,KAAK,OACL,OAAM,MAAM,KAAK,SAAS,CAAC;OAE3B,MAAK,SAAS;EACrB;AACD,SAAO;CACV;;;;;;;;;CASD,OAAO,MAAM;EACT,MAAM,IAAI,KAAK,OAAO,KAAK,SAAKC,IAAE,SAAS,KAAK;AAChD,MAAI,GAAG;AACH,OAAI,KAAK,OAAO,WAAW,GAAG;AAC1B,QAAI,KAAK,YAAY,KAAK,mBAAmB,GAAG;AAC5C,UAAK,WAAW;IACnB;AACD,SAAK,SAAS,CAAE;GACnB,MAEG,MAAK,OAAO,OAAO,KAAK,OAAO,QAAQ,EAAE,EAAE,EAAE;AACjD,KAAE,QAAQ;EACb;CACJ;;;;CAID,YAAY,IAAI,SAAS;AACrB,SAAO,KAAK,GAAG,IAAI,QAAQ;CAC9B;;;;;;;;;;;;;;;;;;CAkBD,GAAG,IAAI,SAAS;EACZ,MAAM,MAAM,MAAM,GAAG,IAAI,QAAQ;AACjC,MAAI,OAAO,QAAQ;AACf,QAAK,aAAa;AAClB,QAAK;AACL,QAAK,KAAK,OAAO,WAAW,KAAK,UAAU;AACvC,SAAK,SAAS;GACjB;EACJ,WACQ,OAAO,cAAc,KAAK,kBAAkB,GAAG;AACpD,SAAM,KAAK,WAAW;EACzB,WACQ,SAAS,GAAG,IAAI,KAAK,cAAc;AACxC,SAAM,KAAK,GAAG;AACd,QAAK,mBAAmB,GAAG;EAC9B,WACQ,OAAO,WAAW,KAAK,gBAAgB;GAC5C,MAAM,IAAI;AACV,OAAI,KAAK,OACL,OAAM,MAAM,EAAE,KAAK,MAAM,KAAK,eAAe,CAAC;OAE9C,GAAE,KAAK,MAAM,KAAK,eAAe;EACxC;AACD,SAAO;CACV;;;;CAID,eAAe,IAAI,SAAS;AACxB,SAAO,KAAK,IAAI,IAAI,QAAQ;CAC/B;;;;;;;;;CASD,IAAI,IAAI,SAAS;EACb,MAAM,MAAM,MAAM,IAAI,IAAI,QAAQ;AAIlC,MAAI,OAAO,QAAQ;AACf,QAAK,iBAAiB,KAAK,UAAU,OAAO,CAAC;AAC7C,OAAI,KAAK,mBAAmB,MACvB,KAAK,eACL,KAAK,OAAO,QAAQ;AACrB,SAAK,WAAW;GACnB;EACJ;AACD,SAAO;CACV;;;;;;;;;CASD,mBAAmB,IAAI;EACnB,MAAM,MAAM,MAAM,mBAAmB,GAAG;AACxC,MAAI,OAAO,UAAU,OAAO,WAAW;AACnC,QAAK,iBAAiB;AACtB,QAAK,KAAK,eAAe,KAAK,OAAO,QAAQ;AACzC,SAAK,WAAW;GACnB;EACJ;AACD,SAAO;CACV;;;;CAID,IAAI,aAAa;AACb,SAAO,KAAK;CACf;CACD,CAAC,kBAAkB;AACf,OAAK,KAAK,kBACL,KAAK,iBACL,KAAK,cACN,KAAK,QAAQ,WAAW,KACxB,KAAK,MAAM;AACX,QAAK,gBAAgB;AACrB,QAAK,KAAK,MAAM;AAChB,QAAK,KAAK,YAAY;AACtB,QAAK,KAAK,SAAS;AACnB,OAAI,KAAK,QACL,MAAK,KAAK,QAAQ;AACtB,QAAK,gBAAgB;EACxB;CACJ;;;;;;;;;;;;;;;;;;;;;;;;;CAyBD,KAAK,IAAI,GAAG,MAAM;EACd,MAAM,OAAO,KAAK;AAElB,MAAI,OAAO,WACP,OAAO,WACP,OAAO,aACP,KAAK,YAAY;AACjB,UAAO;EACV,WACQ,OAAO,QAAQ;AACpB,WAAQ,KAAK,gBAAgB,OACvB,QACA,KAAK,UACA,MAAM,MAAM,KAAK,UAAU,KAAK,CAAC,EAAE,QACpC,KAAK,UAAU,KAAK;EACjC,WACQ,OAAO,OAAO;AACnB,UAAO,KAAK,UAAU;EACzB,WACQ,OAAO,SAAS;AACrB,QAAK,UAAU;AAEf,QAAK,KAAK,iBAAiB,KAAK,WAC5B,QAAO;GACX,MAAMC,QAAM,MAAM,KAAK,QAAQ;AAC/B,QAAK,mBAAmB,QAAQ;AAChC,UAAOA;EACV,WACQ,OAAO,SAAS;AACrB,QAAK,iBAAiB;AACtB,SAAM,KAAK,OAAO,KAAK;GACvB,MAAMA,SAAO,KAAK,WAAW,KAAK,UAAU,QAAQ,CAAC,SAC/C,MAAM,KAAK,SAAS,KAAK,GACzB;AACN,QAAK,iBAAiB;AACtB,UAAOA;EACV,WACQ,OAAO,UAAU;GACtB,MAAMA,QAAM,MAAM,KAAK,SAAS;AAChC,QAAK,iBAAiB;AACtB,UAAOA;EACV,WACQ,OAAO,YAAY,OAAO,aAAa;GAC5C,MAAMA,QAAM,MAAM,KAAK,GAAG;AAC1B,QAAK,mBAAmB,GAAG;AAC3B,UAAOA;EACV;EAED,MAAM,MAAM,MAAM,KAAK,IAAI,GAAG,KAAK;AACnC,OAAK,iBAAiB;AACtB,SAAO;CACV;CACD,CAAC,UAAU,MAAM;AACb,OAAK,MAAM,KAAK,KAAK,QAAQ;AACzB,OAAI,EAAE,KAAK,MAAM,KAAK,KAAK,MACvB,MAAK,OAAO;EACnB;EACD,MAAM,MAAM,KAAK,aAAa,QAAQ,MAAM,KAAK,QAAQ,KAAK;AAC9D,OAAK,iBAAiB;AACtB,SAAO;CACV;CACD,CAAC,WAAW;AACR,MAAI,KAAK,aACL,QAAO;AACX,OAAK,eAAe;AACpB,OAAK,WAAW;AAChB,SAAO,KAAK,UACL,MAAM,MAAM,KAAK,WAAW,CAAC,EAAE,QAChC,KAAK,WAAW;CACzB;CACD,CAAC,YAAY;AACT,MAAI,KAAK,UAAU;GACf,MAAM,OAAO,KAAK,SAAS,KAAK;AAChC,OAAI,MAAM;AACN,SAAK,MAAM,KAAK,KAAK,QAAQ;AACzB,OAAE,KAAK,MAAM,KAAK;IACrB;AACD,SAAK,KAAK,WACN,OAAM,KAAK,QAAQ,KAAK;GAC/B;EACJ;AACD,OAAK,MAAM,KAAK,KAAK,QAAQ;AACzB,KAAE,KAAK;EACV;EACD,MAAM,MAAM,MAAM,KAAK,MAAM;AAC7B,OAAK,mBAAmB,MAAM;AAC9B,SAAO;CACV;;;;;CAKD,MAAM,UAAU;EACZ,MAAM,MAAM,OAAO,OAAO,CAAE,GAAE,EAC1B,YAAY,EACf,EAAC;AACF,OAAK,KAAK,YACN,KAAI,aAAa;EAGrB,MAAM,IAAI,KAAK,SAAS;AACxB,OAAK,GAAG,QAAQ,OAAK;AACjB,OAAI,KAAK,EAAE;AACX,QAAK,KAAK,YACN,KAAI,cAAc,EAAE;EAC3B,EAAC;AACF,QAAM;AACN,SAAO;CACV;;;;;;;CAOD,MAAM,SAAS;AACX,MAAI,KAAK,aAAa;AAClB,SAAM,IAAI,MAAM;EACnB;EACD,MAAM,MAAM,MAAM,KAAK,SAAS;AAChC,SAAQ,KAAK,YACP,IAAI,KAAK,GAAG,GACZ,OAAO,OAAO,KAAK,IAAI,WAAW;CAC3C;;;;CAID,MAAM,UAAU;AACZ,SAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACpC,QAAK,GAAG,WAAW,MAAM,OAAO,IAAI,MAAM,oBAAoB,CAAC;AAC/D,QAAK,GAAG,SAAS,QAAM,OAAO,GAAG,CAAC;AAClC,QAAK,GAAG,OAAO,MAAM,SAAS,CAAC;EAClC;CACJ;;;;;;CAMD,CAAC,OAAO,iBAAiB;AAGrB,OAAK,aAAa;EAClB,IAAI,UAAU;EACd,MAAM,OAAO,YAAY;AACrB,QAAK,OAAO;AACZ,aAAU;AACV,UAAO;IAAE,OAAO;IAAW,MAAM;GAAM;EAC1C;EACD,MAAM,OAAO,MAAM;AACf,OAAI,QACA,QAAO,MAAM;GACjB,MAAM,MAAM,KAAK,MAAM;AACvB,OAAI,QAAQ,KACR,QAAO,QAAQ,QAAQ;IAAE,MAAM;IAAO,OAAO;GAAK,EAAC;AACvD,OAAI,KAAK,KACL,QAAO,MAAM;GACjB,IAAI;GACJ,IAAI;GACJ,MAAM,QAAQ,CAAC,OAAO;AAClB,SAAK,IAAI,QAAQ,OAAO;AACxB,SAAK,IAAI,OAAO,MAAM;AACtB,SAAK,IAAI,WAAW,UAAU;AAC9B,UAAM;AACN,WAAO,GAAG;GACb;GACD,MAAM,SAAS,CAAC,UAAU;AACtB,SAAK,IAAI,SAAS,MAAM;AACxB,SAAK,IAAI,OAAO,MAAM;AACtB,SAAK,IAAI,WAAW,UAAU;AAC9B,SAAK,OAAO;AACZ,YAAQ;KAAE;KAAO,QAAQ,KAAK;IAAM,EAAC;GACxC;GACD,MAAM,QAAQ,MAAM;AAChB,SAAK,IAAI,SAAS,MAAM;AACxB,SAAK,IAAI,QAAQ,OAAO;AACxB,SAAK,IAAI,WAAW,UAAU;AAC9B,UAAM;AACN,YAAQ;KAAE,MAAM;KAAM,OAAO;IAAW,EAAC;GAC5C;GACD,MAAM,YAAY,MAAM,MAAM,IAAI,MAAM,oBAAoB;AAC5D,UAAO,IAAI,QAAQ,CAACC,OAAK,QAAQ;AAC7B,aAAS;AACT,cAAUA;AACV,SAAK,KAAK,WAAW,UAAU;AAC/B,SAAK,KAAK,SAAS,MAAM;AACzB,SAAK,KAAK,OAAO,MAAM;AACvB,SAAK,KAAK,QAAQ,OAAO;GAC5B;EACJ;AACD,SAAO;GACH;GACA,OAAO;GACP,QAAQ;GACR,CAAC,OAAO,iBAAiB;AACrB,WAAO;GACV;EACJ;CACJ;;;;;;;CAOD,CAAC,OAAO,YAAY;AAGhB,OAAK,aAAa;EAClB,IAAI,UAAU;EACd,MAAM,OAAO,MAAM;AACf,QAAK,OAAO;AACZ,QAAK,IAAI,OAAO,KAAK;AACrB,QAAK,IAAI,WAAW,KAAK;AACzB,QAAK,IAAI,OAAO,KAAK;AACrB,aAAU;AACV,UAAO;IAAE,MAAM;IAAM,OAAO;GAAW;EAC1C;EACD,MAAM,OAAO,MAAM;AACf,OAAI,QACA,QAAO,MAAM;GACjB,MAAM,QAAQ,KAAK,MAAM;AACzB,UAAO,UAAU,OAAO,MAAM,GAAG;IAAE,MAAM;IAAO;GAAO;EAC1D;AACD,OAAK,KAAK,OAAO,KAAK;AACtB,OAAK,KAAK,OAAO,KAAK;AACtB,OAAK,KAAK,WAAW,KAAK;AAC1B,SAAO;GACH;GACA,OAAO;GACP,QAAQ;GACR,CAAC,OAAO,YAAY;AAChB,WAAO;GACV;EACJ;CACJ;;;;;;;;;;;;;CAaD,QAAQ,IAAI;AACR,MAAI,KAAK,YAAY;AACjB,OAAI,GACA,MAAK,KAAK,SAAS,GAAG;OAEtB,MAAK,KAAK,UAAU;AACxB,UAAO;EACV;AACD,OAAK,aAAa;AAClB,OAAK,aAAa;AAElB,OAAK,QAAQ,SAAS;AACtB,OAAK,gBAAgB;EACrB,MAAM,KAAK;AACX,aAAW,GAAG,UAAU,eAAe,KAAK,QACxC,IAAG,OAAO;AACd,MAAI,GACA,MAAK,KAAK,SAAS,GAAG;MAGtB,MAAK,KAAK,UAAU;AACxB,SAAO;CACV;;;;;;;;CAQD,WAAW,WAAW;AAClB,SAAO;CACV;AACJ;;;;ACn/BD,MAAM,eAAeC,gBAAI;AAKzB,MAAM,YAAY;CACd;CACA,SAASC;CACT;CACA;CACA;CACA,UAAU;EACN;EACA;EACA;EACA;CACH;AACJ;AAED,MAAM,eAAe,CAAC,cAAc,YAAY,aAAa,aAAa,aAAaC,UACnF,YACE;CACE,GAAG;CACH,GAAG;CACH,UAAU;EACN,GAAG,UAAU;EACb,GAAI,SAAS,YAAY,CAAE;CAC9B;AACJ;AAEL,MAAM,iBAAiB;AACvB,MAAM,aAAa,CAAC,aAAa,SAAS,QAAQ,OAAO,KAAK,CAAC,QAAQ,gBAAgB,OAAO;AAE9F,MAAM,YAAY;AAClB,MAAM,UAAU;AAChB,MAAM,QAAQ;AACd,MAAM,QAAQ;AACd,MAAM,QAAQ;AACd,MAAM,QAAQ;AACd,MAAM,QAAQ;AACd,MAAM,QAAQ;AACd,MAAM,SAAS;AACf,MAAM,OAAO;AAEb,MAAM,gBAAgB;AAEtB,MAAM,iBAAiB;AAEvB,MAAM,eAAe;AAErB,MAAM,UAAU;AAGhB,MAAM,SAAS;AAGf,MAAM,cAAc;AAEpB,MAAM,cAAc;AACpB,MAAM,WAAW,UAAU,SAAS;AACpC,MAAM,WAAW;AACjB,MAAM,YAAY,CAAC,MAAM,EAAE,QAAQ,GAAG,QAChC,EAAE,aAAa,GAAG,QACd,EAAE,gBAAgB,GAAG,QACjB,EAAE,mBAAmB,GAAG,QACpB,EAAE,eAAe,GAAG,QAChB,EAAE,UAAU,GAAG,SACX,EAAE,QAAQ,GAAG,QACT;AAE9B,MAAM,iBAAiB,IAAI;AAC3B,MAAM,YAAY,CAAC,MAAM;CACrB,MAAM,IAAI,eAAe,IAAI,EAAE;AAC/B,KAAI,EACA,QAAO;CACX,MAAM,IAAI,EAAE,UAAU,OAAO;AAC7B,gBAAe,IAAI,GAAG,EAAE;AACxB,QAAO;AACV;AACD,MAAM,uBAAuB,IAAI;AACjC,MAAM,kBAAkB,CAAC,MAAM;CAC3B,MAAM,IAAI,qBAAqB,IAAI,EAAE;AACrC,KAAI,EACA,QAAO;CACX,MAAM,IAAI,UAAU,EAAE,aAAa,CAAC;AACpC,sBAAqB,IAAI,GAAG,EAAE;AAC9B,QAAO;AACV;;;;;AAKD,IAAa,eAAb,cAAkC,SAAS;CACvC,cAAc;AACV,QAAM,EAAE,KAAK,IAAK,EAAC;CACtB;AACJ;;;;;AAgBD,IAAa,gBAAb,cAAmC,SAAS;CACxC,YAAY,UAAU,KAAK,MAAM;AAC7B,QAAM;GACF;GAEA,iBAAiB,OAAK,EAAE,SAAS;EACpC,EAAC;CACL;AACJ;AACD,MAAM,WAAW,OAAO,sBAAsB;;;;;;;;;;;;;;AAc9C,IAAa,WAAb,MAAsB;;;;;;;;;;CAUlB;;;;;;CAMA;;;;;;CAMA;;;;;;CAMA;;;;;CAKA;;;;;CAKA,QAAQ;CAER;CAEA;CACA,IAAI,MAAM;AACN,SAAO,KAAKC;CACf;CACD;CACA,IAAI,OAAO;AACP,SAAO,KAAKC;CACf;CACD;CACA,IAAI,QAAQ;AACR,SAAO,KAAKC;CACf;CACD;CACA,IAAI,MAAM;AACN,SAAO,KAAKC;CACf;CACD;CACA,IAAI,MAAM;AACN,SAAO,KAAKC;CACf;CACD;CACA,IAAI,OAAO;AACP,SAAO,KAAKC;CACf;CACD;CACA,IAAI,UAAU;AACV,SAAO,KAAKC;CACf;CACD;CACA,IAAI,MAAM;AACN,SAAO,KAAKC;CACf;CACD;CACA,IAAI,OAAO;AACP,SAAO,KAAKC;CACf;CACD;CACA,IAAI,SAAS;AACT,SAAO,KAAKC;CACf;CACD;CACA,IAAI,UAAU;AACV,SAAO,KAAKC;CACf;CACD;CACA,IAAI,UAAU;AACV,SAAO,KAAKC;CACf;CACD;CACA,IAAI,UAAU;AACV,SAAO,KAAKC;CACf;CACD;CACA,IAAI,cAAc;AACd,SAAO,KAAKC;CACf;CACD;CACA,IAAI,QAAQ;AACR,SAAO,KAAKC;CACf;CACD;CACA,IAAI,QAAQ;AACR,SAAO,KAAKC;CACf;CACD;CACA,IAAI,QAAQ;AACR,SAAO,KAAKC;CACf;CACD;CACA,IAAI,YAAY;AACZ,SAAO,KAAKC;CACf;CACD;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;;;;;;;CAOA,IAAI,aAAa;AACb,SAAO,CAAC,KAAK,UAAU,MAAM,UAAU;CAC1C;;;;;CAKD,IAAI,OAAO;AACP,SAAO,KAAK;CACf;;;;;;;CAOD,YAAY,MAAM,OAAO,SAAS,MAAM,OAAO,QAAQ,UAAU,MAAM;AACnE,OAAK,OAAO;AACZ,OAAKC,aAAa,SAAS,gBAAgB,KAAK,GAAG,UAAU,KAAK;AAClE,OAAKC,QAAQ,OAAO;AACpB,OAAK,SAAS;AACd,OAAK,QAAQ;AACb,OAAK,OAAO,QAAQ;AACpB,OAAKC,YAAY;AACjB,OAAKC,YAAY,KAAK;AACtB,OAAKC,YAAY,KAAK;AACtB,OAAKC,iBAAiB,KAAK;AAC3B,OAAK,SAAS,KAAK;AACnB,MAAI,KAAK,QAAQ;AACb,QAAKC,MAAM,KAAK,OAAOA;EAC1B,OACI;AACD,QAAKA,MAAM,aAAa,KAAK,GAAG;EACnC;CACJ;;;;;;CAMD,QAAQ;AACJ,MAAI,KAAKC,WAAW,UAChB,QAAO,KAAKA;AAChB,OAAK,KAAK,OACN,QAAQ,KAAKA,SAAS;AAC1B,SAAQ,KAAKA,SAAS,KAAK,OAAO,OAAO,GAAG;CAC/C;;;;CAID,gBAAgB;AACZ,SAAO,KAAKL;CACf;;;;CAID,QAAQM,QAAM;AACV,OAAKA,QAAM;AACP,UAAO;EACV;EACD,MAAM,WAAW,KAAK,cAAcA,OAAK;EACzC,MAAM,MAAM,OAAK,UAAU,SAAS,OAAO;EAC3C,MAAM,WAAW,IAAI,MAAM,KAAK,SAAS;EACzC,MAAM,SAAS,WACX,KAAK,QAAQ,SAAS,CAACC,cAAc,SAAS,GAC5C,KAAKA,cAAc,SAAS;AAClC,SAAO;CACV;CACD,cAAc,UAAU;EACpB,IAAI,IAAI;AACR,OAAK,MAAM,QAAQ,UAAU;AACzB,OAAI,EAAE,MAAM,KAAK;EACpB;AACD,SAAO;CACV;;;;;;;;;CASD,WAAW;EACP,MAAM,SAAS,KAAKP,UAAU,IAAI,KAAK;AACvC,MAAI,QAAQ;AACR,UAAO;EACV;EACD,MAAM,WAAW,OAAO,OAAO,CAAE,GAAE,EAAE,aAAa,EAAG,EAAC;AACtD,OAAKA,UAAU,IAAI,MAAM,SAAS;AAClC,OAAKD,UAAU;AACf,SAAO;CACV;;;;;;;;;;;;;;CAcD,MAAM,UAAU,MAAM;AAClB,MAAI,aAAa,MAAM,aAAa,KAAK;AACrC,UAAO;EACV;AACD,MAAI,aAAa,MAAM;AACnB,UAAO,KAAK,UAAU;EACzB;EAED,MAAM,WAAW,KAAK,UAAU;EAChC,MAAM,OAAO,KAAK,SAAS,gBAAgB,SAAS,GAAG,UAAU,SAAS;AAC1E,OAAK,MAAM,KAAK,UAAU;AACtB,OAAI,EAAED,eAAe,MAAM;AACvB,WAAO;GACV;EACJ;EAID,MAAM,IAAI,KAAK,SAAS,KAAK,MAAM;EACnC,MAAM,WAAW,KAAKG,YAAY,KAAKA,YAAY,IAAI,WAAW;EAClE,MAAM,SAAS,KAAK,SAAS,UAAU,SAAS;GAC5C,GAAG;GACH,QAAQ;GACR;EACH,EAAC;AACF,OAAK,KAAK,YAAY,EAAE;AACpB,UAAOF,SAAS;EACnB;AAGD,WAAS,KAAK,OAAO;AACrB,SAAO;CACV;;;;;CAKD,WAAW;AACP,MAAI,KAAK,MACL,QAAO;AACX,MAAI,KAAKG,cAAc,WAAW;AAC9B,UAAO,KAAKA;EACf;EACD,MAAM,OAAO,KAAK;EAClB,MAAM,IAAI,KAAK;AACf,OAAK,GAAG;AACJ,UAAQ,KAAKA,YAAY,KAAK;EACjC;EACD,MAAM,KAAK,EAAE,UAAU;AACvB,SAAO,OAAO,OAAO,EAAE,SAAS,KAAK,KAAK,OAAO;CACpD;;;;;;;CAOD,gBAAgB;AACZ,MAAI,KAAK,QAAQ,IACb,QAAO,KAAK,UAAU;AAC1B,MAAI,KAAK,MACL,QAAO;AACX,MAAI,KAAKC,mBAAmB,UACxB,QAAO,KAAKA;EAChB,MAAM,OAAO,KAAK;EAClB,MAAM,IAAI,KAAK;AACf,OAAK,GAAG;AACJ,UAAQ,KAAKA,iBAAiB,KAAK,eAAe;EACrD;EACD,MAAM,KAAK,EAAE,eAAe;AAC5B,SAAO,OAAO,OAAO,EAAE,SAAS,KAAK,OAAO;CAC/C;;;;CAID,WAAW;AACP,MAAI,KAAKF,cAAc,WAAW;AAC9B,UAAO,KAAKA;EACf;EACD,MAAM,OAAO,KAAK;EAClB,MAAM,IAAI,KAAK;AACf,OAAK,GAAG;AACJ,UAAQ,KAAKA,YAAY,KAAK;EACjC;EACD,MAAM,KAAK,EAAE,UAAU;EACvB,MAAM,KAAK,OAAO,EAAE,SAAS,KAAK,KAAK,OAAO;AAC9C,SAAQ,KAAKA,YAAY;CAC5B;;;;;;;CAOD,gBAAgB;AACZ,MAAI,KAAKO,mBAAmB,UACxB,QAAO,KAAKA;AAChB,MAAI,KAAK,QAAQ,IACb,QAAQ,KAAKA,iBAAiB,KAAK,UAAU;AACjD,OAAK,KAAK,QAAQ;GACd,MAAMC,MAAI,KAAK,UAAU,CAAC,QAAQ,OAAO,IAAI;AAC7C,OAAI,aAAa,KAAKA,IAAE,EAAE;AACtB,WAAQ,KAAKD,kBAAkB,MAAMC,IAAE;GAC1C,OACI;AACD,WAAQ,KAAKD,iBAAiBC;GACjC;EACJ;EACD,MAAM,IAAI,KAAK;EACf,MAAM,OAAO,EAAE,eAAe;EAC9B,MAAM,MAAM,SAAS,SAAS,EAAE,SAAS,KAAK,OAAO,KAAK;AAC1D,SAAQ,KAAKD,iBAAiB;CACjC;;;;;;;;CAQD,YAAY;AACR,UAAQ,KAAKT,QAAQ,UAAU;CAClC;CACD,OAAO,MAAM;AACT,SAAO,MAAM,IAAI,KAAK,IAAI;CAC7B;CACD,UAAU;AACN,SAAQ,KAAK,WAAW,GAAG,YACrB,KAAK,aAAa,GAAG,cACjB,KAAK,QAAQ,GAAG,SACZ,KAAK,gBAAgB,GAAG,iBACpB,KAAK,QAAQ,GAAG,SACZ,KAAK,mBAAmB,GAAG,oBACvB,KAAK,eAAe,GAAG,gBACG,KAAK,UAAU,GAAG,WACpC;;CAErC;;;;CAID,SAAS;AACL,UAAQ,KAAKA,QAAQ,UAAU;CAClC;;;;CAID,cAAc;AACV,UAAQ,KAAKA,QAAQ,UAAU;CAClC;;;;CAID,oBAAoB;AAChB,UAAQ,KAAKA,QAAQ,UAAU;CAClC;;;;CAID,gBAAgB;AACZ,UAAQ,KAAKA,QAAQ,UAAU;CAClC;;;;CAID,SAAS;AACL,UAAQ,KAAKA,QAAQ,UAAU;CAClC;;;;CAID,WAAW;AACP,UAAQ,KAAKA,QAAQ,UAAU;CAClC;;;;CAID,iBAAiB;AACb,UAAQ,KAAKA,QAAQ,WAAW;CACnC;;;;;;;;CAQD,cAAc;AACV,SAAO,KAAKA,QAAQ,eAAe,OAAO;CAC7C;;;;;;;;;CASD,iBAAiB;AACb,SAAO,KAAKW;CACf;;;;;;;;;CASD,iBAAiB;AACb,SAAO,KAAKC;CACf;;;;;;;;;CASD,gBAAgB;EACZ,MAAM,WAAW,KAAK,UAAU;AAChC,SAAO,SAAS,MAAM,GAAG,SAAS,YAAY;CACjD;;;;;;;;CAQD,cAAc;AACV,MAAI,KAAKD,YACL,QAAO;AACX,OAAK,KAAK,OACN,QAAO;EAEX,MAAM,OAAO,KAAKX,QAAQ;AAC1B,WAAU,SAAS,WAAW,SAAS,SACnC,KAAKA,QAAQ,eACb,KAAKA,QAAQ;CACpB;;;;;CAKD,gBAAgB;AACZ,YAAU,KAAKA,QAAQ;CAC1B;;;;;;CAMD,WAAW;AACP,YAAU,KAAKA,QAAQ;CAC1B;;;;;;;;;;;;CAYD,QAAQ,GAAG;AACP,UAAQ,KAAK,SACT,KAAKD,eAAe,UAAU,EAAE,GAC9B,KAAKA,eAAe,gBAAgB,EAAE;CAC/C;;;;;;;;;CASD,MAAM,WAAW;EACb,MAAM,SAAS,KAAKY;AACpB,MAAI,QAAQ;AACR,UAAO;EACV;AACD,OAAK,KAAK,aAAa,EAAE;AACrB,UAAO;EACV;;AAGD,OAAK,KAAK,QAAQ;AACd,UAAO;EACV;;AAED,MAAI;GACA,MAAM,OAAO,MAAM,KAAKN,IAAI,SAAS,SAAS,KAAK,UAAU,CAAC;GAC9D,MAAM,aAAa,CAAC,MAAM,KAAK,OAAO,UAAU,GAAG,QAAQ,KAAK;AAChE,OAAI,YAAY;AACZ,WAAQ,KAAKM,cAAc;GAC9B;EACJ,SACM,IAAI;AACP,QAAKE,cAAc,GAAG,KAAK;AAC3B,UAAO;EACV;CACJ;;;;CAID,eAAe;EACX,MAAM,SAAS,KAAKF;AACpB,MAAI,QAAQ;AACR,UAAO;EACV;AACD,OAAK,KAAK,aAAa,EAAE;AACrB,UAAO;EACV;;AAGD,OAAK,KAAK,QAAQ;AACd,UAAO;EACV;;AAED,MAAI;GACA,MAAM,OAAO,KAAKN,IAAI,aAAa,KAAK,UAAU,CAAC;GACnD,MAAM,aAAa,KAAK,OAAO,cAAc,EAAE,QAAQ,KAAK;AAC5D,OAAI,YAAY;AACZ,WAAQ,KAAKM,cAAc;GAC9B;EACJ,SACM,IAAI;AACP,QAAKE,cAAc,GAAG,KAAK;AAC3B,UAAO;EACV;CACJ;CACD,gBAAgB,UAAU;AAEtB,OAAKb,SAAS;AAEd,OAAK,IAAI,IAAI,SAAS,aAAa,IAAI,SAAS,QAAQ,KAAK;GACzD,MAAM,IAAI,SAAS;AACnB,OAAI,EACA,GAAEc,aAAa;EACtB;CACJ;CACD,cAAc;AAEV,MAAI,KAAKd,QAAQ,OACb;AACJ,OAAKA,SAAS,KAAKA,QAAQ,UAAU;AACrC,OAAKe,qBAAqB;CAC7B;CACD,sBAAsB;EAElB,MAAM,WAAW,KAAK,UAAU;AAChC,WAAS,cAAc;AACvB,OAAK,MAAM,KAAK,UAAU;AACtB,KAAED,aAAa;EAClB;CACJ;CACD,mBAAmB;AACf,OAAKd,SAAS;AACd,OAAKgB,cAAc;CACtB;CAED,eAAe;;AAMX,MAAI,KAAKhB,QAAQ,QACb;;EAEJ,IAAI,IAAI,KAAKA;AAGb,OAAK,IAAI,UAAU,MACf,MAAK;AACT,OAAKA,QAAQ,IAAI;AACjB,OAAKe,qBAAqB;CAC7B;CACD,aAAa,OAAO,IAAI;AAEpB,MAAI,SAAS,aAAa,SAAS,SAAS;AACxC,QAAKC,cAAc;EACtB,WACQ,SAAS,UAAU;AACxB,QAAKF,aAAa;EACrB,OACI;AACD,QAAK,UAAU,CAAC,cAAc;EACjC;CACJ;CACD,WAAW,OAAO,IAAI;;AAGlB,MAAI,SAAS,WAAW;GAEpB,MAAM,IAAI,KAAK;AACf,KAAEE,cAAc;EACnB,WACQ,SAAS,UAAU;;AAExB,QAAKF,aAAa;EACrB;CACJ;CACD,cAAc,OAAO,IAAI;EACrB,IAAI,MAAM,KAAKd;AACf,SAAO;AACP,MAAI,SAAS,SACT,QAAO;AAEX,MAAI,SAAS,YAAY,SAAS,WAAW;AAGzC,UAAO;EACV;AACD,OAAKA,QAAQ;;AAIb,MAAI,SAAS,aAAa,KAAK,QAAQ;AACnC,QAAK,OAAOgB,cAAc;EAC7B;;CAEJ;CACD,iBAAiB,GAAG,GAAG;AACnB,SAAQ,KAAKC,0BAA0B,GAAG,EAAE,IACxC,KAAKC,oBAAoB,GAAG,EAAE;CACrC;CACD,oBAAoB,GAAG,GAAG;EAEtB,MAAM,OAAO,UAAU,EAAE;EACzB,MAAM,QAAQ,KAAK,SAAS,EAAE,MAAM,MAAM,EAAE,QAAQ,KAAM,EAAC;EAC3D,MAAM,OAAO,MAAMlB,QAAQ;AAC3B,MAAI,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS;AACtD,SAAMA,SAAS;EAClB;AACD,IAAE,QAAQ,MAAM;AAChB,IAAE;AACF,SAAO;CACV;CACD,0BAA0B,GAAG,GAAG;AAC5B,OAAK,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,QAAQ,KAAK;GAC3C,MAAM,SAAS,EAAE;GACjB,MAAM,OAAO,KAAK,SAAS,gBAAgB,EAAE,KAAK,GAAG,UAAU,EAAE,KAAK;AACtE,OAAI,SAAS,OAAOD,YAAY;AAC5B;GACH;AACD,UAAO,KAAKoB,qBAAqB,GAAG,QAAQ,GAAG,EAAE;EACpD;CACJ;CACD,qBAAqB,GAAG,GAAG,OAAO,GAAG;EACjC,MAAM,IAAI,EAAE;AAEZ,IAAEnB,QAAS,EAAEA,QAAQ,eAAgB,UAAU,EAAE;AAEjD,MAAI,MAAM,EAAE,KACR,GAAE,OAAO,EAAE;AAGf,MAAI,UAAU,EAAE,aAAa;AACzB,OAAI,UAAU,EAAE,SAAS,EACrB,GAAE,KAAK;OAEP,GAAE,OAAO,OAAO,EAAE;AACtB,KAAE,QAAQ,EAAE;EACf;AACD,IAAE;AACF,SAAO;CACV;;;;;;;;;;;;;;;;CAgBD,MAAM,QAAQ;AACV,OAAK,KAAKA,QAAQ,YAAY,GAAG;AAC7B,OAAI;AACA,SAAKoB,WAAW,MAAM,KAAKf,IAAI,SAAS,MAAM,KAAK,UAAU,CAAC,CAAC;AAC/D,WAAO;GACV,SACM,IAAI;AACP,SAAKgB,WAAW,GAAG,KAAK;GAC3B;EACJ;CACJ;;;;CAID,YAAY;AACR,OAAK,KAAKrB,QAAQ,YAAY,GAAG;AAC7B,OAAI;AACA,SAAKoB,WAAW,KAAKf,IAAI,UAAU,KAAK,UAAU,CAAC,CAAC;AACpD,WAAO;GACV,SACM,IAAI;AACP,SAAKgB,WAAW,GAAG,KAAK;GAC3B;EACJ;CACJ;CACD,WAAW,IAAI;EACX,MAAM,EAAE,OAAO,SAAS,WAAW,aAAa,SAAS,QAAQ,OAAO,SAAS,KAAK,KAAK,KAAK,MAAM,OAAO,SAAS,OAAO,MAAM,MAAM,KAAM,GAAG;AAClJ,OAAK1B,SAAS;AACd,OAAKJ,WAAW;AAChB,OAAKO,aAAa;AAClB,OAAKJ,eAAe;AACpB,OAAKP,WAAW;AAChB,OAAKG,UAAU;AACf,OAAKO,SAAS;AACd,OAAKJ,WAAW;AAChB,OAAKZ,OAAO;AACZ,OAAKI,OAAO;AACZ,OAAKG,OAAO;AACZ,OAAKN,QAAQ;AACb,OAAKc,SAAS;AACd,OAAKJ,WAAW;AAChB,OAAKT,SAAS;AACd,OAAKG,QAAQ;AACb,OAAKG,QAAQ;AACb,OAAKL,OAAO;EACZ,MAAM,OAAO,UAAU,GAAG;AAE1B,OAAKgB,QAAS,KAAKA,QAAQ,eAAgB,OAAO;AAClD,MAAI,SAAS,WAAW,SAAS,SAAS,SAAS,OAAO;AACtD,QAAKA,SAAS;EACjB;CACJ;CACD,eAAe,CAAE;CACjB,qBAAqB;CACrB,iBAAiB,UAAU;AACvB,OAAKsB,qBAAqB;EAC1B,MAAM,MAAM,KAAKC,aAAa,OAAO;AACrC,OAAKA,aAAa,SAAS;AAC3B,MAAI,QAAQ,QAAM,GAAG,MAAM,SAAS,CAAC;CACxC;;;;;;;;;;;;;;;;;CAiBD,UAAU,IAAI,aAAa,OAAO;AAC9B,OAAK,KAAK,YAAY,EAAE;AACpB,OAAI,WACA,IAAG,MAAM,CAAE,EAAC;OAEZ,gBAAe,MAAM,GAAG,MAAM,CAAE,EAAC,CAAC;AACtC;EACH;EACD,MAAM,WAAW,KAAK,UAAU;AAChC,MAAI,KAAK,eAAe,EAAE;GACtB,MAAM,IAAI,SAAS,MAAM,GAAG,SAAS,YAAY;AACjD,OAAI,WACA,IAAG,MAAM,EAAE;OAEX,gBAAe,MAAM,GAAG,MAAM,EAAE,CAAC;AACrC;EACH;AAED,OAAKA,aAAa,KAAK,GAAG;AAC1B,MAAI,KAAKD,oBAAoB;AACzB;EACH;AACD,OAAKA,qBAAqB;EAG1B,MAAM,WAAW,KAAK,UAAU;AAChC,OAAKjB,IAAI,QAAQ,UAAU,EAAE,eAAe,KAAM,GAAE,CAAC,IAAI,YAAY;AACjE,OAAI,IAAI;AACJ,SAAKmB,aAAa,GAAG,KAAK;AAC1B,aAAS,cAAc;GAC1B,OACI;AAGD,SAAK,MAAM,KAAK,SAAS;AACrB,UAAKC,iBAAiB,GAAG,SAAS;IACrC;AACD,SAAKC,gBAAgB,SAAS;GACjC;AACD,QAAKC,iBAAiB,SAAS,MAAM,GAAG,SAAS,YAAY,CAAC;AAC9D;EACH,EAAC;CACL;CACD;;;;;;;;;;CAUA,MAAM,UAAU;AACZ,OAAK,KAAK,YAAY,EAAE;AACpB,UAAO,CAAE;EACZ;EACD,MAAM,WAAW,KAAK,UAAU;AAChC,MAAI,KAAK,eAAe,EAAE;AACtB,UAAO,SAAS,MAAM,GAAG,SAAS,YAAY;EACjD;EAGD,MAAM,WAAW,KAAK,UAAU;AAChC,MAAI,KAAKC,uBAAuB;AAC5B,SAAM,KAAKA;EACd,OACI;;GAED,IAAI,UAAU,MAAM,CAAG;;AAEvB,QAAKA,wBAAwB,IAAI,QAAQ,SAAQ,UAAU;AAC3D,OAAI;AACA,SAAK,MAAM,KAAK,MAAM,KAAKvB,IAAI,SAAS,QAAQ,UAAU,EACtD,eAAe,KAClB,EAAC,EAAE;AACA,UAAKoB,iBAAiB,GAAG,SAAS;IACrC;AACD,SAAKC,gBAAgB,SAAS;GACjC,SACM,IAAI;AACP,SAAKF,aAAa,GAAG,KAAK;AAC1B,aAAS,cAAc;GAC1B;AACD,QAAKI,wBAAwB;AAC7B,YAAS;EACZ;AACD,SAAO,SAAS,MAAM,GAAG,SAAS,YAAY;CACjD;;;;CAID,cAAc;AACV,OAAK,KAAK,YAAY,EAAE;AACpB,UAAO,CAAE;EACZ;EACD,MAAM,WAAW,KAAK,UAAU;AAChC,MAAI,KAAK,eAAe,EAAE;AACtB,UAAO,SAAS,MAAM,GAAG,SAAS,YAAY;EACjD;EAGD,MAAM,WAAW,KAAK,UAAU;AAChC,MAAI;AACA,QAAK,MAAM,KAAK,KAAKvB,IAAI,YAAY,UAAU,EAC3C,eAAe,KAClB,EAAC,EAAE;AACA,SAAKoB,iBAAiB,GAAG,SAAS;GACrC;AACD,QAAKC,gBAAgB,SAAS;EACjC,SACM,IAAI;AACP,QAAKF,aAAa,GAAG,KAAK;AAC1B,YAAS,cAAc;EAC1B;AACD,SAAO,SAAS,MAAM,GAAG,SAAS,YAAY;CACjD;CACD,aAAa;AACT,MAAI,KAAKxB,QAAQ,SACb,QAAO;EACX,MAAM,OAAO,OAAO,KAAKA;;AAGzB,QAAM,SAAS,WAAW,SAAS,SAAS,SAAS,QAAQ;AACzD,UAAO;EACV;;AAED,SAAO;CACV;CACD,WAAW,MAAM,YAAY;AACzB,UAAS,KAAKA,QAAQ,WAAW,WAC3B,KAAKA,QAAQ,cACd,KAAK,IAAI,KAAK,MACb,cAAc,WAAW,KAAK;CACvC;;;;;;;;;;CAUD,MAAM,WAAW;AACb,MAAI,KAAKY,UACL,QAAO,KAAKA;AAChB,OAAK,cAAc,cAAc,UAAU,KAAKZ,MAC5C,QAAO;AACX,MAAI;GACA,MAAM,KAAK,MAAM,KAAKK,IAAI,SAAS,SAAS,KAAK,UAAU,CAAC;AAC5D,UAAQ,KAAKO,YAAY,KAAK,QAAQ,GAAG;EAC5C,SACM,GAAG;AACN,QAAKiB,kBAAkB;EAC1B;CACJ;;;;CAID,eAAe;AACX,MAAI,KAAKjB,UACL,QAAO,KAAKA;AAChB,OAAK,cAAc,cAAc,UAAU,KAAKZ,MAC5C,QAAO;AACX,MAAI;GACA,MAAM,KAAK,KAAKK,IAAI,aAAa,KAAK,UAAU,CAAC;AACjD,UAAQ,KAAKO,YAAY,KAAK,QAAQ,GAAG;EAC5C,SACM,GAAG;AACN,QAAKiB,kBAAkB;EAC1B;CACJ;;;;;;;CAOD,CAAC,UAAU,QAAQ;AACf,MAAI,WAAW,KACX;AACJ,SAAO,QAAQ;AACf,OAAK,QAAQ;EACb,MAAM,UAAU,IAAI,IAAI,CAAE;EAC1B,IAAI,KAAK,CAAE;EACX,IAAI,IAAI;AACR,SAAO,KAAK,EAAE,QAAQ;AAClB,WAAQ,IAAI,EAAE;AACd,KAAE1B,YAAY,GAAG,KAAK,KAAK,IAAI;AAC/B,KAAEC,iBAAiB,GAAG,KAAK,IAAI;AAC/B,OAAI,EAAE;AACN,MAAG,KAAK,KAAK;EAChB;AAED,MAAI;AACJ,SAAO,KAAK,EAAE,WAAW,QAAQ,IAAI,EAAE,EAAE;AACrC,KAAED,YAAY;AACd,KAAEC,iBAAiB;AACnB,OAAI,EAAE;EACT;CACJ;AACJ;;;;;;;AAOD,IAAa,YAAb,MAAa,kBAAkB,SAAS;;;;CAIpC,MAAM;;;;CAIN,WAAW;;;;;;;CAOX,YAAY,MAAM,OAAO,SAAS,MAAM,OAAO,QAAQ,UAAU,MAAM;AACnE,QAAM,MAAM,MAAM,MAAM,OAAO,QAAQ,UAAU,KAAK;CACzD;;;;CAID,SAAS,MAAM,OAAO,SAAS,OAAO,CAAE,GAAE;AACtC,SAAO,IAAI,UAAU,MAAM,MAAM,KAAK,MAAM,KAAK,OAAO,KAAK,QAAQ,KAAK,eAAe,EAAE;CAC9F;;;;CAID,cAAcG,QAAM;AAChB,SAAO,gBAAM,MAAMA,OAAK,CAAC;CAC5B;;;;CAID,QAAQ,UAAU;AACd,aAAW,WAAW,SAAS,aAAa,CAAC;AAC7C,MAAI,aAAa,KAAK,KAAK,MAAM;AAC7B,UAAO,KAAK;EACf;AAED,OAAK,MAAM,CAAC,SAAS,KAAK,IAAI,OAAO,QAAQ,KAAK,MAAM,EAAE;AACtD,OAAI,KAAK,SAAS,UAAU,QAAQ,EAAE;AAClC,WAAQ,KAAK,MAAM,YAAY;GAClC;EACJ;AAED,SAAQ,KAAK,MAAM,YAAY,IAAI,gBAAgB,UAAU,MAAM;CACtE;;;;CAID,SAAS,UAAU,UAAU,KAAK,KAAK,MAAM;AAIzC,aAAW,SACN,aAAa,CACb,QAAQ,OAAO,KAAK,CACpB,QAAQ,gBAAgB,OAAO;AACpC,SAAO,aAAa;CACvB;AACJ;;;;;;AAMD,IAAa,YAAb,MAAa,kBAAkB,SAAS;;;;CAIpC,WAAW;;;;CAIX,MAAM;;;;;;;CAON,YAAY,MAAM,OAAO,SAAS,MAAM,OAAO,QAAQ,UAAU,MAAM;AACnE,QAAM,MAAM,MAAM,MAAM,OAAO,QAAQ,UAAU,KAAK;CACzD;;;;CAID,cAAcA,QAAM;AAChB,SAAO,OAAK,WAAW,IAAI,GAAG,MAAM;CACvC;;;;CAID,QAAQ,WAAW;AACf,SAAO,KAAK;CACf;;;;CAID,SAAS,MAAM,OAAO,SAAS,OAAO,CAAE,GAAE;AACtC,SAAO,IAAI,UAAU,MAAM,MAAM,KAAK,MAAM,KAAK,OAAO,KAAK,QAAQ,KAAK,eAAe,EAAE;CAC9F;AACJ;;;;;;;;;AASD,IAAa,iBAAb,MAA4B;;;;CAIxB;;;;CAIA;;;;CAIA;;;;CAIA;CACA;CACA;CACA;;;;;;CAMA;CACA;;;;;;;;CAQA,YAAY,MAAM,QAAQ,KAAK,EAAE,UAAUuB,OAAK,EAAE,QAAQ,oBAAoB,KAAK,MAAM,WAAK,WAAY,GAAG,CAAE,GAAE;AAC7G,OAAKzB,MAAM,aAAa0B,KAAG;AAC3B,MAAI,eAAe,OAAO,IAAI,WAAW,UAAU,EAAE;AACjD,SAAM,4BAAc,IAAI;EAC3B;EAGD,MAAM,UAAU,SAAS,QAAQ,IAAI;AACrC,OAAK,QAAQ,OAAO,OAAO,KAAK;AAChC,OAAK,WAAW,KAAK,cAAc,QAAQ;AAC3C,OAAKC,gBAAgB,IAAI;AACzB,OAAKC,qBAAqB,IAAI;AAC9B,OAAKhC,YAAY,IAAI,cAAc;EACnC,MAAM,QAAQ,QAAQ,UAAU,KAAK,SAAS,OAAO,CAAC,MAAM6B,MAAI;AAEhE,MAAI,MAAM,WAAW,MAAM,MAAM,IAAI;AACjC,SAAM,KAAK;EACd;;AAED,MAAI,WAAW,WAAW;AACtB,SAAM,IAAI,UAAU;EACvB;;AAED,OAAK,SAAS;AACd,OAAK,OAAO,KAAK,QAAQ,KAAKzB,IAAI;AAClC,OAAK,MAAM,KAAK,YAAY,KAAK;EACjC,IAAI,OAAO,KAAK;EAChB,IAAI,MAAM,MAAM,SAAS;EACzB,MAAM,UAAU,SAAS;EACzB,IAAI,MAAM,KAAK;EACf,IAAI,WAAW;AACf,OAAK,MAAM,QAAQ,OAAO;GACtB,MAAM,IAAI;AACV,UAAO,KAAK,MAAM,MAAM;IACpB,UAAU,IAAI,MAAM,GAAG,KAAK,KAAK,CAAC,KAAK,QAAQ;IAC/C,eAAe,IAAI,MAAM,GAAG,KAAK,KAAK,CAAC,KAAK,IAAI;IAChD,UAAW,QAAQ,WAAW,KAAK,WAAW;GACjD,EAAC;AACF,cAAW;EACd;AACD,OAAK,MAAM;CACd;;;;CAID,MAAME,SAAO,KAAK,KAAK;AACnB,aAAWA,WAAS,UAAU;AAC1B,YAAO,KAAK,IAAI,QAAQA,OAAK;EAChC;AACD,SAAO,OAAK,OAAO;CACtB;;;;;;;CAOD,gBAAgB;AACZ,SAAO,KAAKN;CACf;;;;;;;;;;CAUD,QAAQ,GAAG,OAAO;EAGd,IAAI,IAAI;AACR,OAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;GACxC,MAAM,IAAI,MAAM;AAChB,QAAK,KAAK,MAAM,IACZ;AACJ,OAAI,KAAK,EAAE,EAAE,GAAG,EAAE,IAAI;AACtB,OAAI,KAAK,WAAW,EAAE,EAAE;AACpB;GACH;EACJ;EACD,MAAM,SAAS,KAAK+B,cAAc,IAAI,EAAE;AACxC,MAAI,WAAW,WAAW;AACtB,UAAO;EACV;EACD,MAAM,SAAS,KAAK,IAAI,QAAQ,EAAE,CAAC,UAAU;AAC7C,OAAKA,cAAc,IAAI,GAAG,OAAO;AACjC,SAAO;CACV;;;;;;;;;;;;CAYD,aAAa,GAAG,OAAO;EAGnB,IAAI,IAAI;AACR,OAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;GACxC,MAAM,IAAI,MAAM;AAChB,QAAK,KAAK,MAAM,IACZ;AACJ,OAAI,KAAK,EAAE,EAAE,GAAG,EAAE,IAAI;AACtB,OAAI,KAAK,WAAW,EAAE,EAAE;AACpB;GACH;EACJ;EACD,MAAM,SAAS,KAAKC,mBAAmB,IAAI,EAAE;AAC7C,MAAI,WAAW,WAAW;AACtB,UAAO;EACV;EACD,MAAM,SAAS,KAAK,IAAI,QAAQ,EAAE,CAAC,eAAe;AAClD,OAAKA,mBAAmB,IAAI,GAAG,OAAO;AACtC,SAAO;CACV;;;;CAID,SAAS,QAAQ,KAAK,KAAK;AACvB,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC;AACD,SAAO,MAAM,UAAU;CAC1B;;;;;CAKD,cAAc,QAAQ,KAAK,KAAK;AAC5B,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC;AACD,SAAO,MAAM,eAAe;CAC/B;;;;CAID,SAAS,QAAQ,KAAK,KAAK;AACvB,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC;AACD,SAAO,MAAM;CAChB;;;;CAID,QAAQ,QAAQ,KAAK,KAAK;AACtB,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC;AACD,SAAO,CAAC,MAAM,UAAU,OAAO,UAAU;CAC5C;CACD,MAAM,QAAQ,QAAQ,KAAK,KAAK,OAAO,EACnC,eAAe,KAClB,GAAE;AACC,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC,aACU,iBAAiB,WAAW;AACnC,UAAO;AACP,WAAQ,KAAK;EAChB;EACD,MAAM,EAAE,eAAe,GAAG;AAC1B,OAAK,MAAM,YAAY,EAAE;AACrB,UAAO,CAAE;EACZ,OACI;GACD,MAAM,IAAI,MAAM,MAAM,SAAS;AAC/B,UAAO,gBAAgB,IAAI,EAAE,IAAI,OAAK,EAAE,KAAK;EAChD;CACJ;CACD,YAAY,QAAQ,KAAK,KAAK,OAAO,EACjC,eAAe,KAClB,GAAE;AACC,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC,aACU,iBAAiB,WAAW;AACnC,UAAO;AACP,WAAQ,KAAK;EAChB;EACD,MAAM,EAAE,gBAAgB,MAAM,GAAG;AACjC,OAAK,MAAM,YAAY,EAAE;AACrB,UAAO,CAAE;EACZ,WACQ,eAAe;AACpB,UAAO,MAAM,aAAa;EAC7B,OACI;AACD,UAAO,MAAM,aAAa,CAAC,IAAI,OAAK,EAAE,KAAK;EAC9C;CACJ;;;;;;;;;;;;;;;;CAgBD,MAAM,MAAM,QAAQ,KAAK,KAAK;AAC1B,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC;AACD,SAAO,MAAM,OAAO;CACvB;;;;CAID,UAAU,QAAQ,KAAK,KAAK;AACxB,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC;AACD,SAAO,MAAM,WAAW;CAC3B;CACD,MAAM,SAAS,QAAQ,KAAK,KAAK,EAAE,eAAe,GAAG,EACjD,eAAe,MAClB,GAAE;AACC,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC,aACU,iBAAiB,WAAW;AACnC,mBAAgB,MAAM;AACtB,WAAQ,KAAK;EAChB;EACD,MAAM,IAAI,MAAM,MAAM,UAAU;AAChC,SAAO,gBAAgB,IAAI,GAAG,UAAU;CAC3C;CACD,aAAa,QAAQ,KAAK,KAAK,EAAE,eAAe,GAAG,EAC/C,eAAe,MAClB,GAAE;AACC,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC,aACU,iBAAiB,WAAW;AACnC,mBAAgB,MAAM;AACtB,WAAQ,KAAK;EAChB;EACD,MAAM,IAAI,MAAM,cAAc;AAC9B,SAAO,gBAAgB,IAAI,GAAG,UAAU;CAC3C;CACD,MAAM,SAAS,QAAQ,KAAK,KAAK,EAAE,eAAe,GAAG,EACjD,eAAe,MAClB,GAAE;AACC,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC,aACU,iBAAiB,WAAW;AACnC,mBAAgB,MAAM;AACtB,WAAQ,KAAK;EAChB;EACD,MAAM,IAAI,MAAM,MAAM,UAAU;AAChC,SAAO,gBAAgB,IAAI,GAAG,UAAU;CAC3C;CACD,aAAa,QAAQ,KAAK,KAAK,EAAE,eAAe,GAAG,EAC/C,eAAe,MAClB,GAAE;AACC,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC,aACU,iBAAiB,WAAW;AACnC,mBAAgB,MAAM;AACtB,WAAQ,KAAK;EAChB;EACD,MAAM,IAAI,MAAM,cAAc;AAC9B,SAAO,gBAAgB,IAAI,GAAG,UAAU;CAC3C;CACD,MAAM,KAAK,QAAQ,KAAK,KAAK,OAAO,CAAE,GAAE;AACpC,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC,aACU,iBAAiB,WAAW;AACnC,UAAO;AACP,WAAQ,KAAK;EAChB;EACD,MAAM,EAAE,gBAAgB,MAAM,SAAS,OAAO,kBAAQ,YAAa,GAAG;EACtE,MAAM,UAAU,CAAE;AAClB,OAAKC,YAAU,SAAO,MAAM,EAAE;AAC1B,WAAQ,KAAK,gBAAgB,QAAQ,MAAM,UAAU,CAAC;EACzD;EACD,MAAM,OAAO,IAAI;EACjB,MAAM,OAAO,CAAC,KAAK,OAAO;AACtB,QAAK,IAAI,IAAI;AACb,OAAI,UAAU,CAAC,IAAI,YAAY;;AAE3B,QAAI,IAAI;AACJ,YAAO,GAAG,GAAG;IAChB;;IAED,IAAI,MAAM,QAAQ;AAClB,SAAK,IACD,QAAO,IAAI;IACf,MAAM,OAAO,MAAM;AACf,SAAI,EAAE,QAAQ,GAAG;AACb,UAAI;KACP;IACJ;AACD,SAAK,MAAM,KAAK,SAAS;AACrB,UAAKA,YAAU,SAAO,EAAE,EAAE;AACtB,cAAQ,KAAK,gBAAgB,IAAI,EAAE,UAAU,CAAC;KACjD;AACD,SAAI,UAAU,EAAE,gBAAgB,EAAE;AAC9B,QAAE,UAAU,CACP,KAAK,OAAM,GAAG,WAAW,GAAG,EAAE,OAAO,GAAG,EAAG,CAC3C,KAAK,OAAK,GAAG,WAAW,MAAM,WAAW,GAAG,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC;KAC3E,OACI;AACD,UAAI,EAAE,WAAW,MAAM,WAAW,EAAE;AAChC,YAAK,GAAG,KAAK;MAChB,OACI;AACD,aAAM;MACT;KACJ;IACJ;GACJ,GAAE,KAAK;EACX;EACD,MAAM,QAAQ;AACd,SAAO,IAAI,QAAQ,CAAC,KAAK,QAAQ;AAC7B,QAAK,OAAO,QAAM;;AAEd,QAAI,GACA,QAAO,IAAI,GAAG;;AAElB,QAAI,QAAQ;GACf,EAAC;EACL;CACJ;CACD,SAAS,QAAQ,KAAK,KAAK,OAAO,CAAE,GAAE;AAClC,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC,aACU,iBAAiB,WAAW;AACnC,UAAO;AACP,WAAQ,KAAK;EAChB;EACD,MAAM,EAAE,gBAAgB,MAAM,SAAS,OAAO,kBAAQ,YAAa,GAAG;EACtE,MAAM,UAAU,CAAE;AAClB,OAAKA,YAAU,SAAO,MAAM,EAAE;AAC1B,WAAQ,KAAK,gBAAgB,QAAQ,MAAM,UAAU,CAAC;EACzD;EACD,MAAM,OAAO,IAAI,IAAI,CAAC,KAAM;AAC5B,OAAK,MAAM,OAAO,MAAM;GACpB,MAAM,UAAU,IAAI,aAAa;AACjC,QAAK,MAAM,KAAK,SAAS;AACrB,SAAKA,YAAU,SAAO,EAAE,EAAE;AACtB,aAAQ,KAAK,gBAAgB,IAAI,EAAE,UAAU,CAAC;IACjD;IACD,IAAI,IAAI;AACR,QAAI,EAAE,gBAAgB,EAAE;AACpB,WAAM,WAAW,IAAI,EAAE,cAAc,GACjC;AACJ,SAAI,EAAE,WAAW,CACb,GAAE,WAAW;IACpB;AACD,QAAI,EAAE,WAAW,MAAM,WAAW,EAAE;AAChC,UAAK,IAAI,EAAE;IACd;GACJ;EACJ;AACD,SAAO;CACV;;;;;;;;;;CAUD,CAAC,OAAO,iBAAiB;AACrB,SAAO,KAAK,SAAS;CACxB;CACD,QAAQ,QAAQ,KAAK,KAAK,UAAU,CAAE,GAAE;AAIpC,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC,aACU,iBAAiB,WAAW;AACnC,aAAU;AACV,WAAQ,KAAK;EAChB;AACD,SAAO,KAAK,OAAO,OAAO,QAAQ,CAAC,OAAO,gBAAgB;CAC7D;;;;;;CAMD,CAAC,OAAO,YAAY;AAChB,SAAO,KAAK,aAAa;CAC5B;CACD,CAAC,YAAY,QAAQ,KAAK,KAAK,OAAO,CAAE,GAAE;AACtC,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC,aACU,iBAAiB,WAAW;AACnC,UAAO;AACP,WAAQ,KAAK;EAChB;EACD,MAAM,EAAE,gBAAgB,MAAM,SAAS,OAAO,kBAAQ,YAAa,GAAG;AACtE,OAAKA,YAAU,SAAO,MAAM,EAAE;AAC1B,SAAM,gBAAgB,QAAQ,MAAM,UAAU;EACjD;EACD,MAAM,OAAO,IAAI,IAAI,CAAC,KAAM;AAC5B,OAAK,MAAM,OAAO,MAAM;GACpB,MAAM,UAAU,IAAI,aAAa;AACjC,QAAK,MAAM,KAAK,SAAS;AACrB,SAAKA,YAAU,SAAO,EAAE,EAAE;AACtB,WAAM,gBAAgB,IAAI,EAAE,UAAU;IACzC;IACD,IAAI,IAAI;AACR,QAAI,EAAE,gBAAgB,EAAE;AACpB,WAAM,WAAW,IAAI,EAAE,cAAc,GACjC;AACJ,SAAI,EAAE,WAAW,CACb,GAAE,WAAW;IACpB;AACD,QAAI,EAAE,WAAW,MAAM,WAAW,EAAE;AAChC,UAAK,IAAI,EAAE;IACd;GACJ;EACJ;CACJ;CACD,OAAO,QAAQ,KAAK,KAAK,OAAO,CAAE,GAAE;AAChC,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC,aACU,iBAAiB,WAAW;AACnC,UAAO;AACP,WAAQ,KAAK;EAChB;EACD,MAAM,EAAE,gBAAgB,MAAM,SAAS,OAAO,kBAAQ,YAAa,GAAG;EACtE,MAAM,UAAU,IAAI,SAAS,EAAE,YAAY,KAAM;AACjD,OAAKA,YAAU,SAAO,MAAM,EAAE;AAC1B,WAAQ,MAAM,gBAAgB,QAAQ,MAAM,UAAU,CAAC;EAC1D;EACD,MAAM,OAAO,IAAI;EACjB,MAAM,QAAQ,CAAC,KAAM;EACrB,IAAI,aAAa;EACjB,MAAMC,YAAU,MAAM;GAClB,IAAI,SAAS;AACb,WAAQ,QAAQ;IACZ,MAAM,MAAM,MAAM,OAAO;AACzB,SAAK,KAAK;AACN,SAAI,eAAe,EACf,SAAQ,KAAK;AACjB;IACH;AACD;AACA,SAAK,IAAI,IAAI;IACb,MAAM,YAAY,CAAC,IAAI,SAAS,eAAe,UAAU;;AAErD,SAAI,GACA,QAAO,QAAQ,KAAK,SAAS,GAAG;;AAEpC,SAAI,WAAW,cAAc;MACzB,MAAM,WAAW,CAAE;AACnB,WAAK,MAAM,KAAK,SAAS;AACrB,WAAI,EAAE,gBAAgB,EAAE;AACpB,iBAAS,KAAK,EACT,UAAU,CACV,KAAK,CAAC,MAAM,GAAG,WAAW,GAAG,EAAE,OAAO,GAAG,EAAE,CAAC;OACpD;MACJ;AACD,UAAI,SAAS,QAAQ;AACjB,eAAQ,IAAI,SAAS,CAAC,KAAK,MAAM,UAAU,MAAM,SAAS,KAAK,CAAC;AAChE;MACH;KACJ;AACD,UAAK,MAAM,KAAK,SAAS;AACrB,UAAI,OAAOD,YAAU,SAAO,EAAE,GAAG;AAC7B,YAAK,QAAQ,MAAM,gBAAgB,IAAI,EAAE,UAAU,CAAC,EAAE;AAClD,iBAAS;OACZ;MACJ;KACJ;AACD;AACA,UAAK,MAAM,KAAK,SAAS;MACrB,MAAM,IAAI,EAAE,gBAAgB,IAAI;AAChC,UAAI,EAAE,WAAW,MAAM,WAAW,EAAE;AAChC,aAAM,KAAK,EAAE;MAChB;KACJ;AACD,SAAI,WAAW,QAAQ,SAAS;AAC5B,cAAQ,KAAK,SAASC,UAAQ;KACjC,YACSC,QAAM;AACZ,iBAAS;KACZ;IACJ;IAED,IAAIA,SAAO;AACX,QAAI,UAAU,WAAW,KAAK;AAC9B,aAAO;GACV;EACJ;AACD,aAAS;AACT,SAAO;CACV;CACD,WAAW,QAAQ,KAAK,KAAK,OAAO,CAAE,GAAE;AACpC,aAAW,UAAU,UAAU;AAC3B,WAAQ,KAAK,IAAI,QAAQ,MAAM;EAClC,aACU,iBAAiB,WAAW;AACnC,UAAO;AACP,WAAQ,KAAK;EAChB;EACD,MAAM,EAAE,gBAAgB,MAAM,SAAS,OAAO,kBAAQ,YAAa,GAAG;EACtE,MAAM,UAAU,IAAI,SAAS,EAAE,YAAY,KAAM;EACjD,MAAM,OAAO,IAAI;AACjB,OAAKF,YAAU,SAAO,MAAM,EAAE;AAC1B,WAAQ,MAAM,gBAAgB,QAAQ,MAAM,UAAU,CAAC;EAC1D;EACD,MAAM,QAAQ,CAAC,KAAM;EACrB,IAAI,aAAa;EACjB,MAAMC,YAAU,MAAM;GAClB,IAAI,SAAS;AACb,WAAQ,QAAQ;IACZ,MAAM,MAAM,MAAM,OAAO;AACzB,SAAK,KAAK;AACN,SAAI,eAAe,EACf,SAAQ,KAAK;AACjB;IACH;AACD;AACA,SAAK,IAAI,IAAI;IACb,MAAM,UAAU,IAAI,aAAa;AACjC,SAAK,MAAM,KAAK,SAAS;AACrB,UAAKD,YAAU,SAAO,EAAE,EAAE;AACtB,WAAK,QAAQ,MAAM,gBAAgB,IAAI,EAAE,UAAU,CAAC,EAAE;AAClD,gBAAS;MACZ;KACJ;IACJ;AACD;AACA,SAAK,MAAM,KAAK,SAAS;KACrB,IAAI,IAAI;AACR,SAAI,EAAE,gBAAgB,EAAE;AACpB,YAAM,WAAW,IAAI,EAAE,cAAc,GACjC;AACJ,UAAI,EAAE,WAAW,CACb,GAAE,WAAW;KACpB;AACD,SAAI,EAAE,WAAW,MAAM,WAAW,EAAE;AAChC,YAAM,KAAK,EAAE;KAChB;IACJ;GACJ;AACD,OAAI,WAAW,QAAQ,QACnB,SAAQ,KAAK,SAASC,UAAQ;EACrC;AACD,aAAS;AACT,SAAO;CACV;CACD,MAAM5B,SAAO,KAAK,KAAK;EACnB,MAAM,SAAS,KAAK;AACpB,OAAK,aAAaA,WAAS,WAAW,KAAK,IAAI,QAAQA,OAAK,GAAGA;AAC/D,OAAK,IAAI,UAAU,OAAO;CAC7B;AACJ;;;;;;;AAOD,IAAa,kBAAb,cAAqC,eAAe;;;;CAIhD,MAAM;CACN,YAAY,MAAM,QAAQ,KAAK,EAAE,OAAO,CAAE,GAAE;EACxC,MAAM,EAAE,SAAS,MAAM,GAAG;AAC1B,QAAM,KAAK8B,iBAAO,MAAM;GAAE,GAAG;GAAM;EAAQ,EAAC;AAC5C,OAAK,SAAS;AACd,OAAK,IAAI,IAAI,KAAK,KAAK,GAAG,IAAI,EAAE,QAAQ;AACpC,KAAE,SAAS,KAAK;EACnB;CACJ;;;;CAID,cAAc,KAAK;AAIf,SAAO,gBAAM,MAAM,IAAI,CAAC,KAAK,aAAa;CAC7C;;;;CAID,QAAQN,MAAI;AACR,SAAO,IAAI,UAAU,KAAK,UAAU,OAAO,WAAW,KAAK,OAAO,KAAK,QAAQ,KAAK,eAAe,EAAE,EAAE,SAAI;CAC9G;;;;CAID,WAAW,GAAG;AACV,SAAQ,EAAE,WAAW,IAAI,IAAI,EAAE,WAAW,KAAK,IAAI,kBAAkB,KAAK,EAAE;CAC/E;AACJ;;;;;;;;AAQD,IAAa,kBAAb,cAAqC,eAAe;;;;CAIhD,MAAM;CACN,YAAY,MAAM,QAAQ,KAAK,EAAE,OAAO,CAAE,GAAE;EACxC,MAAM,EAAE,SAAS,OAAO,GAAG;AAC3B,QAAM,KAAKO,iBAAO,KAAK;GAAE,GAAG;GAAM;EAAQ,EAAC;AAC3C,OAAK,SAAS;CACjB;;;;CAID,cAAc,MAAM;AAChB,SAAO;CACV;;;;CAID,QAAQP,MAAI;AACR,SAAO,IAAI,UAAU,KAAK,UAAU,OAAO,WAAW,KAAK,OAAO,KAAK,QAAQ,KAAK,eAAe,EAAE,EAAE,SAAI;CAC9G;;;;CAID,WAAW,GAAG;AACV,SAAO,EAAE,WAAW,IAAI;CAC3B;AACJ;;;;;;;;;AASD,IAAa,mBAAb,cAAsC,gBAAgB;CAClD,YAAY,MAAM,QAAQ,KAAK,EAAE,OAAO,CAAE,GAAE;EACxC,MAAM,EAAE,SAAS,MAAM,GAAG;AAC1B,QAAM,KAAK;GAAE,GAAG;GAAM;EAAQ,EAAC;CAClC;AACJ;;;;;;AAMD,MAAa,OAAO,QAAQ,aAAa,UAAU,YAAY;;;;;;;AAO/D,MAAa,aAAa,QAAQ,aAAa,UAAU,kBACnD,QAAQ,aAAa,WAAW,mBAC5B;;;;ACv7DV,MAAM,gBAAgB,CAAC,OAAO,GAAG,UAAU;AAC3C,MAAM,aAAa,CAAC,OAAO,GAAG,UAAU;;;;;AAKxC,IAAa,UAAb,MAAa,QAAQ;CACjB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,kBAAkB;CAClB,YAAY,aAAa,UAAU,OAAO,UAAU;AAChD,OAAK,cAAc,YAAY,EAAE;AAC7B,SAAM,IAAI,UAAU;EACvB;AACD,OAAK,WAAW,SAAS,EAAE;AACvB,SAAM,IAAI,UAAU;EACvB;AACD,MAAI,SAAS,WAAW,YAAY,QAAQ;AACxC,SAAM,IAAI,UAAU;EACvB;AACD,OAAK,SAAS,YAAY;AAC1B,MAAI,QAAQ,KAAK,SAAS,KAAK,QAAQ;AACnC,SAAM,IAAI,UAAU;EACvB;AACD,OAAKQ,eAAe;AACpB,OAAKC,YAAY;AACjB,OAAKC,SAAS;AACd,OAAKC,YAAY;AAEjB,MAAI,KAAKD,WAAW,GAAG;AASnB,OAAI,KAAK,OAAO,EAAE;IAEd,MAAM,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,MAAM,GAAG,KAAKF;IACxC,MAAM,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,MAAM,GAAG,KAAKC;AACxC,QAAI,MAAM,OAAO,IAAI;AAEjB,WAAM,OAAO;AACb,WAAM,OAAO;IAChB;IACD,MAAM,IAAI;KAAC;KAAI;KAAI;KAAI;KAAI;IAAG,EAAC,KAAK,IAAI;IACxC,MAAM,IAAI;KAAC;KAAI;KAAI;KAAI;KAAI;IAAG,EAAC,KAAK,IAAI;AACxC,SAAKD,eAAe,CAAC,GAAG,GAAG,KAAM;AACjC,SAAKC,YAAY,CAAC,GAAG,GAAG,KAAM;AAC9B,SAAK,SAAS,KAAKD,aAAa;GACnC,WACQ,KAAK,SAAS,IAAI,KAAK,YAAY,EAAE;IAC1C,MAAM,CAAC,IAAI,GAAG,MAAM,GAAG,KAAKA;IAC5B,MAAM,CAAC,IAAI,GAAG,MAAM,GAAG,KAAKC;AAC5B,QAAI,MAAM,OAAO,IAAI;AAEjB,WAAM,OAAO;AACb,WAAM,OAAO;IAChB;IACD,MAAM,IAAI,KAAK;IACf,MAAM,IAAI,KAAK;AACf,SAAKD,eAAe,CAAC,GAAG,GAAG,KAAM;AACjC,SAAKC,YAAY,CAAC,GAAG,GAAG,KAAM;AAC9B,SAAK,SAAS,KAAKD,aAAa;GACnC;EACJ;CACJ;;;;CAID,UAAU;AACN,SAAO,KAAKA,aAAa,KAAKE;CACjC;;;;CAID,WAAW;AACP,gBAAc,KAAKF,aAAa,KAAKE,YAAY;CACpD;;;;CAID,aAAa;AACT,SAAO,KAAKF,aAAa,KAAKE,YAAY;CAC7C;;;;CAID,WAAW;AACP,SAAO,KAAKF,aAAa,KAAKE,mBAAmB;CACpD;;;;CAID,aAAa;AACT,SAAQ,KAAKE,cACT,KAAKA,gBACA,KAAKF,WAAW,IACb,KAAK,YAAY,GACb,KAAKD,UAAU,KAAK,KAAKA,UAAU,MAAM,EAAE,CAAC,KAAK,IAAI,GACnD,KAAKA,UAAU,KAAK,IAAI,GAC5B,KAAKA,UAAU,MAAM,KAAKC,OAAO,CAAC,KAAK,IAAI;CAC5D;;;;CAID,UAAU;AACN,SAAO,KAAK,SAAS,KAAKA,SAAS;CACtC;;;;CAID,OAAO;AACH,MAAI,KAAKG,UAAU,UACf,QAAO,KAAKA;AAChB,OAAK,KAAK,SAAS,CACf,QAAQ,KAAKA,QAAQ;AACzB,OAAKA,QAAQ,IAAI,QAAQ,KAAKL,cAAc,KAAKC,WAAW,KAAKC,SAAS,GAAG,KAAKC;AAClF,OAAKE,MAAMC,cAAc,KAAKA;AAC9B,OAAKD,MAAME,SAAS,KAAKA;AACzB,OAAKF,MAAMG,WAAW,KAAKA;AAC3B,SAAO,KAAKH;CACf;;;;CAID,QAAQ;EACJ,MAAM,KAAK,KAAKL;AAChB,SAAO,KAAKO,WAAW,YACnB,KAAKA,SACF,KAAKA,SACJ,KAAKJ,cAAc,WACf,KAAKD,WAAW,KAChB,GAAG,OAAO,MACV,GAAG,OAAO,aACH,GAAG,OAAO,cACf,GAAG,aACE,GAAG,OAAO,cACf,GAAG;CACpB;;;;CASD,UAAU;EACN,MAAM,KAAK,KAAKF;AAChB,SAAO,KAAKQ,aAAa,YACrB,KAAKA,WACF,KAAKA,WACJ,KAAKL,cAAc,WACf,KAAKD,WAAW,KAChB,KAAK,SAAS,YACP,GAAG,OAAO,YACjB,YAAY,KAAK,GAAG,GAAG;CACtC;;;;CAOD,aAAa;EACT,MAAM,KAAK,KAAKF;AAChB,SAAO,KAAKM,gBAAgB,YACxB,KAAKA,cACF,KAAKA,cACH,GAAG,OAAO,MAAM,GAAG,SAAS,KACzB,KAAK,SAAS,IACd,KAAK,OAAO;CAC3B;;;;CAID,OAAO;EACH,MAAM,IAAI,KAAKN,aAAa;AAC5B,gBAAe,MAAM,YAAY,KAAK,YAAY,IAAI,KAAKE,WAAW,IAClE,IACE;CACT;;;;;CAKD,sBAAsB;AAClB,WAAS,KAAKA,WAAW,MACpB,KAAK,YAAY,KACjB,KAAKO;CACb;;;;CAID,qBAAqB;AACjB,MAAI,KAAKP,WAAW,MAAM,KAAK,YAAY,KAAK,KAAKO,gBACjD,QAAO;AACX,OAAKA,kBAAkB;AACvB,SAAO;CACV;AACJ;;;;AC/MD,MAAMC,2BAA0B,YAAY,YACxC,kBACO,QAAQ,aAAa,WAC5B,QAAQ,WACN;;;;AAIN,IAAa,SAAb,MAAoB;CAChB;CACA;CACA;CACA;CACA;CACA;CACA,YAAY,SAAS,EAAE,SAAS,QAAQ,OAAO,YAAY,WAAWA,mBAAkB,EAAE;AACtF,OAAK,WAAW,CAAE;AAClB,OAAK,WAAW,CAAE;AAClB,OAAK,mBAAmB,CAAE;AAC1B,OAAK,mBAAmB,CAAE;AAC1B,OAAK,WAAW;AAChB,OAAK,SAAS;GACV,KAAK;GACL;GACA;GACA;GACA;GACA,mBAAmB;GACnB;GACA,WAAW;GACX,UAAU;EACb;AACD,OAAK,MAAM,OAAO,QACd,MAAK,IAAI,IAAI;CACpB;CACD,IAAI,KAAK;EAaL,MAAM,KAAK,IAAI,UAAU,KAAK,KAAK;AACnC,OAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,QAAQ,KAAK;GACpC,MAAM,SAAS,GAAG,IAAI;GACtB,MAAM,YAAY,GAAG,UAAU;;AAE/B,QAAK,WAAW,WAAW;AACvB,UAAM,IAAI,MAAM;GACnB;AAGD,UAAO,OAAO,OAAO,OAAO,UAAU,OAAO,KAAK;AAC9C,WAAO,OAAO;AACd,cAAU,OAAO;GACpB;;GAED,MAAM,IAAI,IAAI,QAAQ,QAAQ,WAAW,GAAG,KAAK;GACjD,MAAM,IAAI,IAAI,UAAU,EAAE,YAAY,EAAE,KAAK;GAC7C,MAAM,WAAW,UAAU,UAAU,SAAS,OAAO;GACrD,MAAM,WAAW,EAAE,YAAY;AAC/B,OAAI,SACA,MAAK,SAAS,KAAK,EAAE;OAErB,MAAK,SAAS,KAAK,EAAE;AACzB,OAAI,UAAU;AACV,QAAI,SACA,MAAK,iBAAiB,KAAK,EAAE;QAE7B,MAAK,iBAAiB,KAAK,EAAE;GACpC;EACJ;CACJ;CACD,QAAQ,GAAG;EACP,MAAM,WAAW,EAAE,UAAU;EAC7B,MAAM,aAAa,EAAE,SAAS;EAC9B,MAAM,WAAW,EAAE,UAAU,IAAI;EACjC,MAAM,aAAa,EAAE,SAAS;AAC9B,OAAK,MAAM,KAAK,KAAK,UAAU;AAC3B,OAAI,EAAE,MAAM,SAAS,IAAI,EAAE,MAAM,UAAU,CACvC,QAAO;EACd;AACD,OAAK,MAAM,KAAK,KAAK,UAAU;AAC3B,OAAI,EAAE,MAAM,SAAS,IAAI,EAAE,MAAM,UAAU,CACvC,QAAO;EACd;AACD,SAAO;CACV;CACD,gBAAgB,GAAG;EACf,MAAM,WAAW,EAAE,UAAU,GAAG;EAChC,MAAM,YAAY,EAAE,UAAU,IAAI,OAAO;AACzC,OAAK,MAAM,KAAK,KAAK,kBAAkB;AACnC,OAAI,EAAE,MAAM,SAAS,CACjB,QAAO;EACd;AACD,OAAK,MAAM,KAAK,KAAK,kBAAkB;AACnC,OAAI,EAAE,MAAM,SAAS,CACjB,QAAO;EACd;AACD,SAAO;CACV;AACJ;;;;;;;AC5GD,IAAa,iBAAb,MAAa,eAAe;CACxB;CACA,YAAY,QAAQ,IAAI,OAAO;AAC3B,OAAK,QAAQ;CAChB;CACD,OAAO;AACH,SAAO,IAAI,eAAe,IAAI,IAAI,KAAK;CAC1C;CACD,UAAU,QAAQ,SAAS;AACvB,SAAO,KAAK,MAAM,IAAI,OAAO,UAAU,CAAC,EAAE,IAAI,QAAQ,YAAY,CAAC;CACtE;CACD,YAAY,QAAQ,SAAS;EACzB,MAAM,WAAW,OAAO,UAAU;EAClC,MAAM,SAAS,KAAK,MAAM,IAAI,SAAS;AACvC,MAAI,OACA,QAAO,IAAI,QAAQ,YAAY,CAAC;MAEhC,MAAK,MAAM,IAAI,UAAU,IAAI,IAAI,CAAC,QAAQ,YAAY,AAAC,GAAE;CAChE;AACJ;;;;;;AAMD,IAAa,cAAb,MAAyB;CACrB,QAAQ,IAAI;CACZ,IAAI,QAAQ,UAAU,OAAO;EACzB,MAAM,KAAK,WAAW,IAAI,MAAM,QAAQ,IAAI;EAC5C,MAAM,UAAU,KAAK,MAAM,IAAI,OAAO;AACtC,OAAK,MAAM,IAAI,QAAQ,YAAY,YAAY,IAAI,IAAI,QAAQ;CAClE;CAED,UAAU;AACN,SAAO,CAAC,GAAG,KAAK,MAAM,SAAS,AAAC,EAAC,IAAI,CAAC,CAACC,QAAM,EAAE,KAAK;GAChDA;MACG,IAAI;MACJ,IAAI;EACV,EAAC;CACL;AACJ;;;;;AAKD,IAAa,WAAb,MAAsB;CAClB,QAAQ,IAAI;CACZ,IAAI,QAAQ,SAAS;AACjB,OAAK,OAAO,YAAY,EAAE;AACtB;EACH;EACD,MAAM,OAAO,KAAK,MAAM,IAAI,OAAO;AACnC,MAAI,MAAM;AACN,QAAK,KAAK,KAAK,OAAK,EAAE,YAAY,KAAK,QAAQ,YAAY,CAAC,EAAE;AAC1D,SAAK,KAAK,QAAQ;GACrB;EACJ,MAEG,MAAK,MAAM,IAAI,QAAQ,CAAC,OAAQ,EAAC;CACxC;CACD,IAAI,QAAQ;EACR,MAAM,OAAO,KAAK,MAAM,IAAI,OAAO;;AAEnC,OAAK,MAAM;AACP,SAAM,IAAI,MAAM;EACnB;;AAED,SAAO;CACV;CACD,UAAU;AACN,SAAO,KAAK,MAAM,CAAC,IAAI,OAAK,CAAC,GAAG,KAAK,MAAM,IAAI,EAAE,AAAC,EAAC;CACtD;CACD,OAAO;AACH,SAAO,CAAC,GAAG,KAAK,MAAM,MAAM,AAAC,EAAC,OAAO,OAAK,EAAE,YAAY,CAAC;CAC5D;AACJ;;;;;;;AAOD,IAAa,YAAb,MAAa,UAAU;CACnB;CACA,UAAU,IAAI;CACd,WAAW,IAAI;CACf;CACA;CACA;CACA;CACA,YAAY,MAAM,gBAAgB;AAC9B,OAAK,OAAO;AACZ,OAAK,WAAW,KAAK;AACrB,OAAK,QAAQ,KAAK;AAClB,OAAK,iBACD,iBAAiB,eAAe,MAAM,GAAG,IAAI;CACpD;CACD,gBAAgB,QAAQ,UAAU;AAC9B,OAAK,WAAW;EAChB,MAAM,gBAAgB,SAAS,IAAI,OAAK,CAAC,QAAQ,CAAE,EAAC;AAGpD,OAAK,IAAI,CAAC,GAAG,QAAQ,IAAI,eAAe;AACpC,QAAK,eAAe,YAAY,GAAG,QAAQ;GAC3C,MAAM,OAAO,QAAQ,MAAM;GAC3B,MAAM,WAAW,QAAQ,YAAY,IAAI,KAAK,KAAK,aAAa;AAEhE,OAAI,MAAM;AACN,QAAI,EAAE,QAAQ,SAAS,OAAO,KAAK,KAAK,SAAS,YAC7C,KAAK,KAAK,OACR,KAAK;IACX,MAAMC,SAAO,QAAQ,MAAM;AAC3B,SAAKA,QAAM;AACP,UAAK,QAAQ,IAAI,GAAG,MAAM,MAAM;AAChC;IACH,OACI;AACD,eAAUA;IACb;GACJ;AACD,OAAI,EAAE,UAAU,CACZ;GACJ,IAAI;GACJ,IAAI;GACJ,IAAI,UAAU;AACd,kBAAe,IAAI,QAAQ,SAAS,MAAM,aACrC,OAAO,QAAQ,MAAM,GAAG;IACzB,MAAM,IAAI,EAAE,QAAQ,EAAE;AACtB,QAAI;AACJ,cAAU;AACV,cAAU;GACb;AACD,OAAI,QAAQ,SAAS;AACrB,UAAO,QAAQ,MAAM;AACrB,OAAI,SAAS;AACT,QAAI,KAAK,eAAe,UAAU,GAAG,QAAQ,CACzC;AACJ,SAAK,eAAe,YAAY,GAAG,QAAQ;GAC9C;AAID,cAAW,MAAM,UAAU;IAGvB,MAAM,QAAQ,MAAM,QAAQ,MAAM,MAAM,MAAM;AAC9C,SAAK,QAAQ,IAAI,EAAE,QAAQ,EAAE,EAAE,UAAU,MAAM;AAC/C;GACH,WACQ,MAAM,UAAU;AAMrB,SAAK,EAAE,gBAAgB,IACnB,KAAK,UACL,QAAQ,qBAAqB,EAAE;AAC/B,UAAK,SAAS,IAAI,GAAG,QAAQ;IAChC;IACD,MAAM,KAAK,MAAM,SAAS;IAC1B,MAAM,QAAQ,MAAM,MAAM;AAC1B,SAAK,SAAU,OAAO,MAAM,OAAO,SAAS,OAAQ;AAGhD,UAAK,QAAQ,IAAI,GAAG,UAAU,OAAO,MAAM,OAAO,IAAI;IACzD,OACI;AACD,SAAI,OAAO,MAAM;;MAIb,MAAM,KAAK,EAAE,UAAU;;AAEvB,WAAK,MACD,MAAK,QAAQ,IAAI,IAAI,UAAU,KAAK;gBAC9B,KAAK,eAAe,UAAU,IAAI,MAAM,EAAE;AAChD,YAAK,SAAS,IAAI,IAAI,MAAM;MAC/B;KACJ;IACJ;GACJ,WACQ,aAAa,QAAQ;AAC1B,SAAK,SAAS,IAAI,GAAG,QAAQ;GAChC;EACJ;AACD,SAAO;CACV;CACD,iBAAiB;AACb,SAAO,KAAK,SAAS,MAAM;CAC9B;CACD,QAAQ;AACJ,SAAO,IAAI,UAAU,KAAK,MAAM,KAAK;CACxC;CAKD,cAAc,QAAQ,SAAS;EAC3B,MAAM,WAAW,KAAK,SAAS,IAAI,OAAO;EAE1C,MAAM,UAAU,KAAK,OAAO;AAC5B,OAAK,MAAM,KAAK,SAAS;AACrB,QAAK,MAAM,WAAW,UAAU;IAC5B,MAAM,WAAW,QAAQ,YAAY;IACrC,MAAM,IAAI,QAAQ,SAAS;IAC3B,MAAM,OAAO,QAAQ,MAAM;AAC3B,QAAI,MAAM,UAAU;AAChB,aAAQ,aAAa,GAAG,SAAS,MAAM,SAAS;IACnD,WACQ,aAAa,QAAQ;AAC1B,aAAQ,WAAW,GAAG,GAAG,MAAM,SAAS;IAC3C,OACI;AACD,aAAQ,WAAW,GAAG,GAAG,MAAM,SAAS;IAC3C;GACJ;EACJ;AACD,SAAO;CACV;CACD,aAAa,GAAG,SAAS,MAAM,UAAU;AACrC,MAAI,KAAK,QAAQ,EAAE,KAAK,WAAW,IAAI,EAAE;AACrC,QAAK,QAAQ,SAAS,EAAE;AACpB,SAAK,QAAQ,IAAI,GAAG,UAAU,MAAM;GACvC;AACD,OAAI,EAAE,YAAY,EAAE;AAMhB,QAAI,KAAK,WAAW,EAAE,gBAAgB,EAAE;AACpC,UAAK,SAAS,IAAI,GAAG,QAAQ;IAChC,WACQ,EAAE,gBAAgB,EAAE;AACzB,SAAI,QAAQ,QAAQ,qBAAqB,EAAE;AACvC,WAAK,SAAS,IAAI,GAAG,KAAK;KAC7B,WACQ,QAAQ,oBAAoB,EAAE;AACnC,WAAK,SAAS,IAAI,GAAG,QAAQ;KAChC;IACJ;GACJ;EACJ;AAGD,MAAI,MAAM;GACN,MAAM,KAAK,KAAK,SAAS;AACzB,cAAW,OAAO,YAEd,OAAO,QACP,OAAO,MACP,OAAO,KAAK;AACZ,SAAK,WAAW,GAAG,IAAI,KAAK,MAAM,EAAE,SAAS;GAChD,WACQ,OAAO,MAAM;;IAElB,MAAM,KAAK,EAAE,UAAU;;AAEvB,SAAK,SAAS,IAAI,IAAI,KAAK;GAC9B,WACQ,cAAc,QAAQ;AAC3B,SAAK,WAAW,GAAG,IAAI,KAAK,MAAM,EAAE,SAAS;GAChD;EACJ;CACJ;CACD,WAAW,GAAG,GAAG,MAAM,UAAU;AAC7B,OAAK,EAAE,KAAK,EAAE,KAAK,CACf;AACJ,OAAK,MAAM;AACP,QAAK,QAAQ,IAAI,GAAG,UAAU,MAAM;EACvC,OACI;AACD,QAAK,SAAS,IAAI,GAAG,KAAK;EAC7B;CACJ;CACD,WAAW,GAAG,GAAG,MAAM,UAAU;AAE7B,OAAK,EAAE,QAAQ,EAAE,CACb;AACJ,OAAK,MAAM;AACP,QAAK,QAAQ,IAAI,GAAG,UAAU,MAAM;EACvC,OACI;AACD,QAAK,SAAS,IAAI,GAAG,KAAK;EAC7B;CACJ;AACJ;;;;AC3RD,MAAM,aAAa,CAAC,QAAQ,gBAAgB,WAAW,WAAW,IAAI,OAAO,CAAC,MAAO,GAAE,QACjF,MAAM,QAAQ,OAAO,GAAG,IAAI,OAAO,QAAQ,QACvC;;;;AAIV,IAAa,WAAb,MAAsB;CAClB;CACA;CACA;CACA,OAAO,IAAI;CACX,SAAS;CACT,UAAU;CACV,YAAY,CAAE;CACd;CACA;CACA;CACA;CACA;CACA,YAAY,UAAUC,QAAM,MAAM;AAC9B,OAAK,WAAW;AAChB,OAAK,OAAOA;AACZ,OAAK,OAAO;AACZ,OAAKC,QAAQ,KAAK,SAAS,KAAK,aAAa,UAAU,OAAO;AAC9D,OAAK,sBAAsB,KAAK,wBAAwB;AACxD,MAAI,KAAK,WAAW,KAAK,qBAAqB;AAC1C,QAAKC,UAAU,WAAW,KAAK,UAAU,CAAE,GAAE,KAAK;AAClD,QAAK,KAAK,8BACC,KAAKA,QAAQ,QAAQ,YAAY;IACxC,MAAM,IAAI;AACV,UAAM,IAAI,MAAM;GACnB;EACJ;;AAID,OAAK,WAAW,KAAK,YAAY;;AAEjC,MAAI,KAAK,QAAQ;AACb,QAAK,SAAS,KAAK;AACnB,QAAK,OAAO,iBAAiB,SAAS,MAAM;AACxC,SAAKC,UAAU,SAAS;GAC3B,EAAC;EACL;CACJ;CACD,SAASH,QAAM;AACX,SAAO,KAAK,KAAK,IAAIA,OAAK,MAAM,KAAKE,SAAS,UAAUF,OAAK;CAChE;CACD,iBAAiBA,QAAM;AACnB,WAAS,KAAKE,SAAS,kBAAkBF,OAAK;CACjD;CAED,QAAQ;AACJ,OAAK,SAAS;CACjB;CACD,SAAS;;AAEL,MAAI,KAAK,QAAQ,QACb;;AAEJ,OAAK,SAAS;EACd,IAAI,KAAK;AACT,UAAQ,KAAK,WAAW,KAAK,KAAKG,UAAU,OAAO,GAAG;AAClD,OAAI;EACP;CACJ;CACD,SAAS,IAAI;AACT,MAAI,KAAK,QAAQ,QACb;;AAEJ,OAAK,KAAK,QAAQ;AACd,OAAI;EACP,OACI;;AAED,QAAKA,UAAU,KAAK,GAAG;EAC1B;CACJ;CAGD,MAAM,WAAW,GAAG,OAAO;AACvB,MAAI,SAAS,KAAK,KAAK,MACnB,QAAO;EACX,IAAI;AACJ,MAAI,KAAK,KAAK,UAAU;AACpB,SAAM,EAAE,gBAAgB,IAAK,MAAM,EAAE,UAAU;AAC/C,QAAK,IACD,QAAO;AACX,OAAI;EACP;EACD,MAAM,WAAW,EAAE,WAAW,IAAI,KAAK,KAAK;EAC5C,MAAM,IAAI,WAAW,MAAM,EAAE,OAAO,GAAG;AACvC,MAAI,KAAK,KAAK,UAAU,KAAK,KAAK,SAAS,GAAG,gBAAgB,EAAE;GAC5D,MAAM,SAAS,MAAM,EAAE,UAAU;;AAEjC,OAAI,WAAW,OAAO,WAAW,IAAI,KAAK,KAAK,OAAO;AAClD,UAAM,OAAO,OAAO;GACvB;EAEJ;AACD,SAAO,KAAK,eAAe,GAAG,MAAM;CACvC;CACD,eAAe,GAAG,OAAO;AACrB,SAAQ,MACH,KAAK,aAAa,YAAY,EAAE,OAAO,IAAI,KAAK,eAC/C,SAAS,EAAE,YAAY,OACvB,KAAK,KAAK,UAAU,EAAE,aAAa,OACnC,KAAK,KAAK,UACP,KAAK,KAAK,WACV,EAAE,gBAAgB,KAClB,EAAE,gBAAgB,EAAE,aAAa,MACrC,KAAKC,SAAS,EAAE,GACjB,IACE;CACT;CACD,eAAe,GAAG,OAAO;AACrB,MAAI,SAAS,KAAK,KAAK,MACnB,QAAO;EACX,IAAI;AACJ,MAAI,KAAK,KAAK,UAAU;AACpB,SAAM,EAAE,gBAAgB,IAAI,EAAE,cAAc;AAC5C,QAAK,IACD,QAAO;AACX,OAAI;EACP;EACD,MAAM,WAAW,EAAE,WAAW,IAAI,KAAK,KAAK;EAC5C,MAAM,IAAI,WAAW,EAAE,WAAW,GAAG;AACrC,MAAI,KAAK,KAAK,UAAU,KAAK,KAAK,SAAS,GAAG,gBAAgB,EAAE;GAC5D,MAAM,SAAS,EAAE,cAAc;AAC/B,OAAI,WAAW,QAAQ,WAAW,IAAI,KAAK,KAAK,OAAO;AACnD,WAAO,WAAW;GACrB;EACJ;AACD,SAAO,KAAK,eAAe,GAAG,MAAM;CACvC;CACD,YAAY,GAAG,UAAU;AACrB,MAAI,KAAKA,SAAS,EAAE,CAChB;AAEJ,OAAK,KAAK,uBAAuB,KAAKF,SAAS,KAAK;GAChD,MAAM,OAAO,EAAE,EAAE,eAAe,CAAC;AACjC,QAAKA,QAAQ,IAAI,IAAI;EACxB;EACD,MAAM,MAAM,KAAK,KAAK,aAAa,YAAY,WAAW,KAAK,KAAK;AACpE,OAAK,KAAK,IAAI,EAAE;EAChB,MAAM,OAAO,KAAK,KAAK,QAAQ,EAAE,aAAa,GAAG,KAAKD,OAAO;AAE7D,MAAI,KAAK,KAAK,eAAe;AACzB,QAAK,UAAU,EAAE;EACpB,WACQ,KAAK;GACV,MAAMI,QAAM,KAAK,KAAK,QAAQ,EAAE,eAAe,GAAG,EAAE,UAAU;AAC9D,QAAK,UAAUA,QAAM,KAAK;EAC7B,OACI;GACD,MAAM,MAAM,KAAK,KAAK,QAAQ,EAAE,eAAe,GAAG,EAAE,UAAU;GAC9D,MAAM,MAAM,KAAK,KAAK,gBAAgB,IAAI,WAAW,OAAO,KAAKJ,KAAK,GAClE,MAAM,KAAKA,OACT;AACN,QAAK,WAAW,MAAM,MAAM,OAAO,MAAM,MAAM,KAAK;EACvD;CACJ;CACD,MAAM,MAAM,GAAG,UAAU,OAAO;EAC5B,MAAM,IAAI,MAAM,KAAK,WAAW,GAAG,MAAM;AACzC,MAAI,EACA,MAAK,YAAY,GAAG,SAAS;CACpC;CACD,UAAU,GAAG,UAAU,OAAO;EAC1B,MAAM,IAAI,KAAK,eAAe,GAAG,MAAM;AACvC,MAAI,EACA,MAAK,YAAY,GAAG,SAAS;CACpC;CACD,OAAO,QAAQ,UAAU,IAAI;;AAEzB,MAAI,KAAK,QAAQ,QACb,KAAI;;AAER,OAAK,QAAQ,QAAQ,UAAU,IAAI,UAAU,KAAK,OAAO,GAAG;CAC/D;CACD,QAAQ,QAAQ,UAAU,WAAW,IAAI;AACrC,MAAI,KAAKK,iBAAiB,OAAO,CAC7B,QAAO,IAAI;AACf,MAAI,KAAK,QAAQ,QACb,KAAI;AACR,MAAI,KAAK,QAAQ;AACb,QAAK,SAAS,MAAM,KAAK,QAAQ,QAAQ,UAAU,WAAW,GAAG,CAAC;AAClE;EACH;AACD,YAAU,gBAAgB,QAAQ,SAAS;EAI3C,IAAI,QAAQ;EACZ,MAAM,OAAO,MAAM;AACf,OAAI,EAAE,UAAU,EACZ,KAAI;EACX;AACD,OAAK,MAAM,CAAC,GAAG,UAAU,MAAM,IAAI,UAAU,QAAQ,SAAS,EAAE;AAC5D,OAAI,KAAKF,SAAS,EAAE,CAChB;AACJ;AACA,QAAK,MAAM,GAAG,UAAU,MAAM,CAAC,KAAK,MAAM,MAAM,CAAC;EACpD;AACD,OAAK,MAAM,KAAK,UAAU,gBAAgB,EAAE;AACxC,OAAI,KAAK,aAAa,YAAY,EAAE,OAAO,IAAI,KAAK,UAAU;AAC1D;GACH;AACD;GACA,MAAM,iBAAiB,EAAE,eAAe;AACxC,OAAI,EAAE,eAAe,CACjB,MAAK,QAAQ,GAAG,gBAAgB,WAAW,KAAK;QAC/C;AACD,MAAE,UAAU,CAAC,GAAG,YAAY,KAAK,QAAQ,GAAG,SAAS,WAAW,KAAK,EAAE,KAAK;GAC/E;EACJ;AACD,QAAM;CACT;CACD,QAAQ,QAAQ,SAAS,WAAW,IAAI;AACpC,cAAY,UAAU,cAAc,QAAQ,QAAQ;EACpD,IAAI,QAAQ;EACZ,MAAM,OAAO,MAAM;AACf,OAAI,EAAE,UAAU,EACZ,KAAI;EACX;AACD,OAAK,MAAM,CAAC,GAAG,UAAU,MAAM,IAAI,UAAU,QAAQ,SAAS,EAAE;AAC5D,OAAI,KAAKA,SAAS,EAAE,CAChB;AACJ;AACA,QAAK,MAAM,GAAG,UAAU,MAAM,CAAC,KAAK,MAAM,MAAM,CAAC;EACpD;AACD,OAAK,MAAM,CAACG,UAAQ,SAAS,IAAI,UAAU,SAAS,SAAS,EAAE;AAC3D;AACA,QAAK,QAAQA,UAAQ,UAAU,UAAU,OAAO,EAAE,KAAK;EAC1D;AACD,QAAM;CACT;CACD,WAAW,QAAQ,UAAU,IAAI;;AAE7B,MAAI,KAAK,QAAQ,QACb,KAAI;;AAER,OAAK,YAAY,QAAQ,UAAU,IAAI,UAAU,KAAK,OAAO,GAAG;CACnE;CACD,YAAY,QAAQ,UAAU,WAAW,IAAI;AACzC,MAAI,KAAKD,iBAAiB,OAAO,CAC7B,QAAO,IAAI;AACf,MAAI,KAAK,QAAQ,QACb,KAAI;AACR,MAAI,KAAK,QAAQ;AACb,QAAK,SAAS,MAAM,KAAK,YAAY,QAAQ,UAAU,WAAW,GAAG,CAAC;AACtE;EACH;AACD,YAAU,gBAAgB,QAAQ,SAAS;EAI3C,IAAI,QAAQ;EACZ,MAAM,OAAO,MAAM;AACf,OAAI,EAAE,UAAU,EACZ,KAAI;EACX;AACD,OAAK,MAAM,CAAC,GAAG,UAAU,MAAM,IAAI,UAAU,QAAQ,SAAS,EAAE;AAC5D,OAAI,KAAKF,SAAS,EAAE,CAChB;AACJ,QAAK,UAAU,GAAG,UAAU,MAAM;EACrC;AACD,OAAK,MAAM,KAAK,UAAU,gBAAgB,EAAE;AACxC,OAAI,KAAK,aAAa,YAAY,EAAE,OAAO,IAAI,KAAK,UAAU;AAC1D;GACH;AACD;GACA,MAAM,WAAW,EAAE,aAAa;AAChC,QAAK,YAAY,GAAG,UAAU,WAAW,KAAK;EACjD;AACD,QAAM;CACT;CACD,YAAY,QAAQ,SAAS,WAAW,IAAI;AACxC,cAAY,UAAU,cAAc,QAAQ,QAAQ;EACpD,IAAI,QAAQ;EACZ,MAAM,OAAO,MAAM;AACf,OAAI,EAAE,UAAU,EACZ,KAAI;EACX;AACD,OAAK,MAAM,CAAC,GAAG,UAAU,MAAM,IAAI,UAAU,QAAQ,SAAS,EAAE;AAC5D,OAAI,KAAKA,SAAS,EAAE,CAChB;AACJ,QAAK,UAAU,GAAG,UAAU,MAAM;EACrC;AACD,OAAK,MAAM,CAACG,UAAQ,SAAS,IAAI,UAAU,SAAS,SAAS,EAAE;AAC3D;AACA,QAAK,YAAYA,UAAQ,UAAU,UAAU,OAAO,EAAE,KAAK;EAC9D;AACD,QAAM;CACT;AACJ;AACD,IAAa,aAAb,cAAgC,SAAS;CACrC,UAAU,IAAI;CACd,YAAY,UAAUP,QAAM,MAAM;AAC9B,QAAM,UAAUA,QAAM,KAAK;CAC9B;CACD,UAAU,GAAG;AACT,OAAK,QAAQ,IAAI,EAAE;CACtB;CACD,MAAM,OAAO;AACT,MAAI,KAAK,QAAQ,QACb,OAAM,KAAK,OAAO;AACtB,MAAI,KAAK,KAAK,WAAW,EAAE;AACvB,SAAM,KAAK,KAAK,OAAO;EAC1B;AACD,QAAM,IAAI,QAAQ,CAAC,KAAK,QAAQ;AAC5B,QAAK,OAAO,KAAK,MAAM,KAAK,UAAU,MAAM;AACxC,QAAI,KAAK,QAAQ,SAAS;AACtB,SAAI,KAAK,OAAO,OAAO;IAC1B,OACI;AACD,SAAI,KAAK,QAAQ;IACpB;GACJ,EAAC;EACL;AACD,SAAO,KAAK;CACf;CACD,WAAW;AACP,MAAI,KAAK,QAAQ,QACb,OAAM,KAAK,OAAO;AACtB,MAAI,KAAK,KAAK,WAAW,EAAE;AACvB,QAAK,KAAK,WAAW;EACxB;AAED,OAAK,WAAW,KAAK,MAAM,KAAK,UAAU,MAAM;AAC5C,OAAI,KAAK,QAAQ,QACb,OAAM,KAAK,OAAO;EACzB,EAAC;AACF,SAAO,KAAK;CACf;AACJ;AACD,IAAa,aAAb,cAAgC,SAAS;CACrC;CACA,YAAY,UAAUA,QAAM,MAAM;AAC9B,QAAM,UAAUA,QAAM,KAAK;AAC3B,OAAK,UAAU,IAAI,SAAS;GACxB,QAAQ,KAAK;GACb,YAAY;EACf;AACD,OAAK,QAAQ,GAAG,SAAS,MAAM,KAAK,QAAQ,CAAC;AAC7C,OAAK,QAAQ,GAAG,UAAU,MAAM,KAAK,QAAQ,CAAC;CACjD;CACD,UAAU,GAAG;AACT,OAAK,QAAQ,MAAM,EAAE;AACrB,OAAK,KAAK,QAAQ,QACd,MAAK,OAAO;CACnB;CACD,SAAS;EACL,MAAM,SAAS,KAAK;AACpB,MAAI,OAAO,WAAW,EAAE;AACpB,UAAO,OAAO,CAAC,KAAK,MAAM;AACtB,SAAK,OAAO,QAAQ,KAAK,UAAU,MAAM,KAAK,QAAQ,KAAK,CAAC;GAC/D,EAAC;EACL,OACI;AACD,QAAK,OAAO,QAAQ,KAAK,UAAU,MAAM,KAAK,QAAQ,KAAK,CAAC;EAC/D;AACD,SAAO,KAAK;CACf;CACD,aAAa;AACT,MAAI,KAAK,KAAK,WAAW,EAAE;AACvB,QAAK,KAAK,WAAW;EACxB;AACD,OAAK,WAAW,KAAK,MAAM,KAAK,UAAU,MAAM,KAAK,QAAQ,KAAK,CAAC;AACnE,SAAO,KAAK;CACf;AACJ;;;;ACpXD,MAAM,yBAA0B,YAAY,YACxC,kBACO,QAAQ,aAAa,WAC5B,QAAQ,WACN;;;;AAIN,IAAa,OAAb,MAAkB;CACd;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;;;;CAIA;;;;CAIA;;;;;;;;;;;;;CAaA,YAAY,SAAS,MAAM;;AAEvB,OAAK,KACD,OAAM,IAAI,UAAU;;AAExB,OAAK,kBAAkB,KAAK;AAC5B,OAAK,SAAS,KAAK;AACnB,OAAK,WAAW,KAAK;AACrB,OAAK,QAAQ,KAAK;AAClB,OAAK,gBAAgB,KAAK;AAC1B,OAAK,UAAU,KAAK;AACpB,OAAK,SAAS,KAAK;AACnB,OAAK,KAAK,KAAK;AACX,QAAK,MAAM;EACd,WACQ,KAAK,eAAe,OAAO,KAAK,IAAI,WAAW,UAAU,EAAE;AAChE,QAAK,MAAM,4BAAc,KAAK,IAAI;EACrC;AACD,OAAK,MAAM,KAAK,OAAO;AACvB,OAAK,OAAO,KAAK;AACjB,OAAK,kBAAkB,KAAK;AAC5B,OAAK,YAAY,KAAK;AACtB,OAAK,UAAU,KAAK;AACpB,OAAK,aAAa,KAAK;AACvB,OAAK,WAAW,KAAK;AACrB,OAAK,sBAAsB,KAAK,wBAAwB;AACxD,OAAK,eAAe,KAAK;AACzB,OAAK,cAAc,KAAK;AACxB,OAAK,kBACM,KAAK,aAAa,WAAW,KAAK,WAAW;AACxD,OAAK,SAAS,KAAK;AACnB,OAAK,SAAS,KAAK;AACnB,MAAI,KAAK,iBAAiB,KAAK,aAAa,WAAW;AACnD,SAAM,IAAI,MAAM;EACnB;AACD,aAAW,YAAY,UAAU;AAC7B,aAAU,CAAC,OAAQ;EACtB;AACD,OAAK,yBACC,KAAK,wBACH,KAAK,uBACD;AACZ,MAAI,KAAK,sBAAsB;AAC3B,aAAU,QAAQ,IAAI,OAAK,EAAE,QAAQ,OAAO,IAAI,CAAC;EACpD;AACD,MAAI,KAAK,WAAW;AAChB,OAAI,KAAK,YAAY;AACjB,UAAM,IAAI,UAAU;GACvB;AACD,aAAU,QAAQ,IAAI,OAAM,EAAE,SAAS,IAAI,GAAG,KAAK,OAAO,EAAE,EAAG;EAClE;AACD,OAAK,UAAU;AACf,OAAK,WAAW,KAAK,YAAY;AACjC,OAAK,OAAO;GAAE,GAAG;GAAM,UAAU,KAAK;EAAU;AAChD,MAAI,KAAK,QAAQ;AACb,QAAK,SAAS,KAAK;AACnB,OAAI,KAAK,WAAW,aAChB,KAAK,WAAW,KAAK,OAAO,QAAQ;AACpC,UAAM,IAAI,MAAM;GACnB;EACJ,OACI;GACD,MAAM,SAAS,KAAK,aAAa,UAAU,kBACrC,KAAK,aAAa,WAAW,mBACzB,KAAK,WAAW,kBACZ;AACd,QAAK,SAAS,IAAI,OAAO,KAAK,KAAK;IAC/B,QAAQ,KAAK;IACb,IAAI,KAAK;GACZ;EACJ;AACD,OAAK,SAAS,KAAK,OAAO;EAK1B,MAAM,kBAAkB,KAAK,aAAa,YAAY,KAAK,aAAa;EACxE,MAAM,MAAM;GAER,GAAG;GACH,KAAK,KAAK;GACV,WAAW,KAAK;GAChB,SAAS,KAAK;GACd,QAAQ,KAAK;GACb;GACA,WAAW;GACX,OAAO,KAAK;GACZ,UAAU;GACV,mBAAmB;GACnB,UAAU,KAAK;GACf,sBAAsB,KAAK;GAC3B,SAAS,KAAK,KAAK;EACtB;EACD,MAAM,MAAM,KAAK,QAAQ,IAAI,OAAK,IAAI,UAAU,GAAG,KAAK;EACxD,MAAM,CAAC,UAAU,UAAU,GAAG,IAAI,OAAO,CAAC,KAAK,MAAM;AACjD,OAAI,GAAG,KAAK,GAAG,EAAE,IAAI;AACrB,OAAI,GAAG,KAAK,GAAG,EAAE,UAAU;AAC3B,UAAO;EACV,GAAE,CAAC,CAAE,GAAE,CAAE,CAAC,EAAC;AACZ,OAAK,WAAW,SAAS,IAAI,CAAC,KAAK,MAAM;GACrC,MAAM,IAAI,UAAU;;AAEpB,QAAK,EACD,OAAM,IAAI,MAAM;;AAEpB,UAAO,IAAI,QAAQ,KAAK,GAAG,GAAG,KAAK;EACtC,EAAC;CACL;CACD,MAAM,OAAO;AAKT,SAAO,CACH,GAAI,MAAM,IAAI,WAAW,KAAK,UAAU,KAAK,OAAO,KAAK;GACrD,GAAG,KAAK;GACR,UAAU,KAAK,aAAa,WACxB,KAAK,WAAW,KAAK,OAAO,IAAI,OAAO,GACrC;GACN,UAAU,KAAK;GACf,QAAQ,KAAK;GACb,qBAAqB,KAAK;EAC7B,GAAE,MAAM,AACZ;CACJ;CACD,WAAW;AACP,SAAO,CACH,GAAG,IAAI,WAAW,KAAK,UAAU,KAAK,OAAO,KAAK;GAC9C,GAAG,KAAK;GACR,UAAU,KAAK,aAAa,WACxB,KAAK,WAAW,KAAK,OAAO,IAAI,OAAO,GACrC;GACN,UAAU,KAAK;GACf,QAAQ,KAAK;GACb,qBAAqB,KAAK;EAC7B,GAAE,UAAU,AAChB;CACJ;CACD,SAAS;AACL,SAAO,IAAI,WAAW,KAAK,UAAU,KAAK,OAAO,KAAK;GAClD,GAAG,KAAK;GACR,UAAU,KAAK,aAAa,WACxB,KAAK,WAAW,KAAK,OAAO,IAAI,OAAO,GACrC;GACN,UAAU,KAAK;GACf,QAAQ,KAAK;GACb,qBAAqB,KAAK;EAC7B,GAAE,QAAQ;CACd;CACD,aAAa;AACT,SAAO,IAAI,WAAW,KAAK,UAAU,KAAK,OAAO,KAAK;GAClD,GAAG,KAAK;GACR,UAAU,KAAK,aAAa,WACxB,KAAK,WAAW,KAAK,OAAO,IAAI,OAAO,GACrC;GACN,UAAU,KAAK;GACf,QAAQ,KAAK;GACb,qBAAqB,KAAK;EAC7B,GAAE,YAAY;CAClB;;;;;CAKD,cAAc;AACV,SAAO,KAAK,YAAY,CAAC,OAAO,WAAW;CAC9C;CACD,CAAC,OAAO,YAAY;AAChB,SAAO,KAAK,aAAa;CAC5B;;;;;CAKD,UAAU;AACN,SAAO,KAAK,QAAQ,CAAC,OAAO,gBAAgB;CAC/C;CACD,CAAC,OAAO,iBAAiB;AACrB,SAAO,KAAK,SAAS;CACxB;AACJ;;;;;;;;;;;;;;;ACrOD,MAAa,WAAW,CAAC,SAAS,UAAU,CAAE,MAAK;AAC/C,MAAK,MAAM,QAAQ,QAAQ,EAAE;AACzB,YAAU,CAAC,OAAQ;CACtB;AACD,MAAK,MAAM,KAAK,SAAS;AACrB,MAAI,IAAI,UAAU,GAAG,SAAS,UAAU,CACpC,QAAO;CACd;AACD,QAAO;AACV;;;;ACdD,SAAgB,eAAe,SAAS,UAAU,CAAE,GAAE;AAClD,QAAO,IAAI,KAAK,SAAS,SAAS,YAAY;AACjD;AACD,SAAgB,WAAW,SAAS,UAAU,CAAE,GAAE;AAC9C,QAAO,IAAI,KAAK,SAAS,SAAS,QAAQ;AAC7C;AACD,SAAgB,SAAS,SAAS,UAAU,CAAE,GAAE;AAC5C,QAAO,IAAI,KAAK,SAAS,SAAS,UAAU;AAC/C;AACD,eAAe,MAAM,SAAS,UAAU,CAAE,GAAE;AACxC,QAAO,IAAI,KAAK,SAAS,SAAS,MAAM;AAC3C;AACD,SAAgB,gBAAgB,SAAS,UAAU,CAAE,GAAE;AACnD,QAAO,IAAI,KAAK,SAAS,SAAS,aAAa;AAClD;AACD,SAAgB,YAAY,SAAS,UAAU,CAAE,GAAE;AAC/C,QAAO,IAAI,KAAK,SAAS,SAAS,SAAS;AAC9C;AAED,MAAa,aAAa;AAC1B,MAAa,SAAS,OAAO,OAAO,YAAY,EAAE,MAAM,eAAgB,EAAC;AACzE,MAAa,cAAc;AAC3B,MAAa,UAAU,OAAO,OAAO,aAAa,EAC9C,MAAM,gBACT,EAAC;AACF,MAAa,OAAO,OAAO,OAAO,UAAU;CACxC,QAAQ;CACR,SAAS;AACZ,EAAC;AACF,MAAa,OAAO,OAAO,OAAO,OAAO;CACrC,MAAM;CACN;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACH,EAAC;AACF,KAAK,OAAO;;;;;;;;;;;;;;;ACnCZ,eAAsB,iBAAiBQ,UAA0C;CAC/E,MAAM,eAAe,MAAM,oBAAO;EAAC;EAAqB;EAAa;EAAkB;EAAa;CAAW,GAAE,EAC/G,KAAK,SACN,EAAC;AACF,KAAI,cAAc;EAChB,MAAM,kBAAkB,oBAAK,uBAAQ,aAAa,EAAE,eAAe;EACnE,MAAM,gBAAgB,MAAM,yBAAyB,gBAAgB;AACrE,SAAO,gBAAgB,uBAAQ,aAAa,GAAG;CAChD;CAED,IAAI,aAAa;AAEjB,QAAO,eAAe,KAAK;EACzB,MAAM,kBAAkB,oBAAK,YAAY,eAAe;AAExD,MAAI,MAAM,yBAAyB,gBAAgB,EAAE;AACnD,UAAO;EACR;EAED,MAAM,YAAY,uBAAQ,WAAW;AACrC,MAAI,cAAc,YAAY;AAC5B;EACD;AACD,eAAa;CACd;AAED,QAAO;AACR;;;;;;;;;;;;AAaD,eAAsB,qBAAqBC,YAAuC;AAChF,KAAI;EACF,MAAM,eAAe,MAAM,iBAAiB,WAAW;AACvD,OAAK,cAAc;AACjB,UAAO,CAAC,UAAW;EACpB;EAED,MAAM,kBAAkB,oBAAK,cAAc,eAAe;EAC1D,MAAM,cAAc,aAAuC,MAAM,+BAAS,iBAAiB,QAAQ,CAAC;EACpG,MAAM,aAAa,aAAa,cAAc,CAAE;EAEhD,MAAM,eAAe,MAAM,QAAQ,IACjC,WAAW,IAAI,OAAOC,cAAsB;GAC1C,MAAM,UAAU,MAAM,KAAK,oBAAK,cAAc,WAAW,eAAe,CAAC;AACzE,UAAO,QAAQ,IAAI,CAACC,YAAU,oBAAKA,SAAO,KAAK,CAAC;EACjD,EAAC,CACH;EAED,MAAM,WAAW,aAAa,MAAM;AAEpC,SAAO,SAAS,WAAW,IAAI,CAAC,UAAW,IAAG,CAAC,cAAc,GAAG,QAAS;CAC1E,SAAQ,OAAO;AAEd,SAAO,CAAC,UAAW;CACpB;AACF;AAED,eAAe,yBAAyBC,iBAA2C;AACjF,KAAI,MAAM,OAAO,gBAAgB,EAAE;EACjC,MAAM,cAAc,aAAuC,MAAM,+BAAS,iBAAiB,QAAQ,CAAC;AACpG,MAAI,aAAa,cAAc,MAAM,QAAQ,aAAa,WAAW,IAAI,aAAa,WAAW,SAAS,GAAG;AAC3G,UAAO;EACR;CACF;AACD,QAAO;AACR"}