@happyvertical/smrt-core 0.51.11 → 0.51.16

package/dist/node_modules/.pnpm/{minimatch@10.2.5 → minimatch@10.2.6}/node_modules/minimatch/dist/esm/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":["#matchGlobstar","#matchOne","#matchGlobStarBodySections"],"sources":["../../../../../../../../../../node_modules/.pnpm/minimatch@10.2.5/node_modules/minimatch/dist/esm/index.js"],"sourcesContent":["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 <https://github.com/yetingli> for\n    // improving this regexp to avoid a ReDOS vulnerability.\n    if (options.nobrace || !/\\{(?:(?!\\{).)*\\}/.test(pattern)) {\n        // shortcut. no need to expand.\n        return [pattern];\n    }\n    return expand(pattern, { max: options.braceExpandMax });\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    maxGlobstarRecursion;\n    regexp;\n    constructor(pattern, options = {}) {\n        assertValidPattern(pattern);\n        options = options || {};\n        this.options = options;\n        this.maxGlobstarRecursion = options.maxGlobstarRecursion ?? 200;\n        this.pattern = pattern;\n        this.platform = options.platform || defaultPlatform;\n        this.isWindows = this.platform === 'win32';\n        // avoid the annoying deprecation flag lol\n        const awe = ('allowWindow' + 'sEscape');\n        this.windowsPathsNoEscape =\n            !!options.windowsPathsNoEscape || options[awe] === false;\n        if (this.windowsPathsNoEscape) {\n            this.pattern = this.pattern.replace(/\\\\/g, '/');\n        }\n        this.preserveMultipleSlashes = !!options.preserveMultipleSlashes;\n        this.regexp = null;\n        this.negate = false;\n        this.nonegate = !!options.nonegate;\n        this.comment = false;\n        this.empty = false;\n        this.partial = !!options.partial;\n        this.nocase = !!this.options.nocase;\n        this.windowsNoMagicRoot =\n            options.windowsNoMagicRoot !== undefined ?\n                options.windowsNoMagicRoot\n                : !!(this.isWindows && this.nocase);\n        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            //oxlint-disable-next-line no-console\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 [\n                        ...s.slice(0, 4),\n                        ...s.slice(4).map(ss => this.parse(ss)),\n                    ];\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 ** into *\n        if (this.options.noglobstar) {\n            for (const partset of globParts) {\n                for (let j = 0; j < partset.length; j++) {\n                    if (partset[j] === '**') {\n                        partset[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            // <pre>/<e>/<rest> -> <pre>/<rest>\n            if (!this.preserveMultipleSlashes) {\n                for (let i = 1; i < parts.length - 1; i++) {\n                    const p = parts[i];\n                    // don't squeeze out UNC patterns\n                    if (i === 1 && p === '' && parts[0] === '')\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            // <pre>/<p>/../<rest> -> <pre>/<rest>\n            let dd = 0;\n            while (-1 !== (dd = parts.indexOf('..', dd + 1))) {\n                const p = parts[dd - 1];\n                if (p &&\n                    p !== '.' &&\n                    p !== '..' &&\n                    p !== '**' &&\n                    !(this.isWindows && /^[a-z]:$/i.test(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    // <pre> is 1 or more portions\n    // <rest> is 1 or more portions\n    // <p> is any portion other than ., .., '', or **\n    // <e> is . or ''\n    //\n    // **/.. is *brutal* for filesystem walking performance, because\n    // it effectively resets the recursive walk each time it occurs,\n    // and ** cannot be reduced out by a .. pattern part like a regexp\n    // or most strings (other than .., ., and '') can be.\n    //\n    // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n    // <pre>/<e>/<rest> -> <pre>/<rest>\n    // <pre>/<p>/../<rest> -> <pre>/<rest>\n    // **/**/<rest> -> **/<rest>\n    //\n    // **/*/<rest> -> */**/<rest> <== not valid because ** doesn't follow\n    // this WOULD be allowed if ** did follow symlinks, or * didn't\n    firstPhasePreProcess(globParts) {\n        let didSomething = false;\n        do {\n            didSomething = false;\n            // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n            for (let parts of globParts) {\n                let gs = -1;\n                while (-1 !== (gs = parts.indexOf('**', gs + 1))) {\n                    let gss = gs;\n                    while (parts[gss + 1] === '**') {\n                        // <pre>/**/**/<rest> -> <pre>/**/<rest>\n                        gss++;\n                    }\n                    // eg, if gs is 2 and gss is 4, that means we have 3 **\n                    // parts, and can remove 2 of them.\n                    if (gss > gs) {\n                        parts.splice(gs + 1, gss - gs);\n                    }\n                    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                // <pre>/<e>/<rest> -> <pre>/<rest>\n                if (!this.preserveMultipleSlashes) {\n                    for (let i = 1; i < parts.length - 1; i++) {\n                        const p = parts[i];\n                        // don't squeeze out UNC patterns\n                        if (i === 1 && p === '' && parts[0] === '')\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                // <pre>/<p>/../<rest> -> <pre>/<rest>\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    // {<pre>/*/<rest>,<pre>/<p>/<rest>} -> <pre>/*/<rest>\n    // {<pre>/<rest>,<pre>/<rest>} -> <pre>/<rest>\n    // {<pre>/**/<rest>,<pre>/<rest>} -> <pre>/**/<rest>\n    //\n    // {<pre>/**/<rest>,<pre>/**/<p>/<rest>} -> <pre>/**/<rest>\n    // ^-- not valid because ** doens't follow symlinks\n    secondPhasePreProcess(globParts) {\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        let fileStartIndex = 0;\n        let patternStartIndex = 0;\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\n                : fileDrive ? 0\n                    : undefined;\n            const pdi = patternUNC ? 3\n                : patternDrive ? 0\n                    : undefined;\n            if (typeof fdi === 'number' && typeof pdi === 'number') {\n                const [fd, pd] = [\n                    file[fdi],\n                    pattern[pdi],\n                ];\n                // start matching at the drive letter index of each\n                if (fd.toLowerCase() === pd.toLowerCase()) {\n                    pattern[pdi] = fd;\n                    patternStartIndex = pdi;\n                    fileStartIndex = fdi;\n                }\n            }\n        }\n        // resolve and reduce . and .. portions in the file as well.\n        // don't need to do the second phase, because it's only one string[]\n        const { optimizationLevel = 1 } = this.options;\n        if (optimizationLevel >= 2) {\n            file = this.levelTwoFileOptimize(file);\n        }\n        if (pattern.includes(GLOBSTAR)) {\n            return this.#matchGlobstar(file, pattern, partial, fileStartIndex, patternStartIndex);\n        }\n        return this.#matchOne(file, pattern, partial, fileStartIndex, patternStartIndex);\n    }\n    #matchGlobstar(file, pattern, partial, fileIndex, patternIndex) {\n        // split the pattern into head, tail, and middle of ** delimited parts\n        const firstgs = pattern.indexOf(GLOBSTAR, patternIndex);\n        const lastgs = pattern.lastIndexOf(GLOBSTAR);\n        // split the pattern up into globstar-delimited sections\n        // the tail has to be at the end, and the others just have\n        // to be found in order from the head.\n        const [head, body, tail] = partial ?\n            [\n                pattern.slice(patternIndex, firstgs),\n                pattern.slice(firstgs + 1),\n                [],\n            ]\n            : [\n                pattern.slice(patternIndex, firstgs),\n                pattern.slice(firstgs + 1, lastgs),\n                pattern.slice(lastgs + 1),\n            ];\n        // check the head, from the current file/pattern index.\n        if (head.length) {\n            const fileHead = file.slice(fileIndex, fileIndex + head.length);\n            if (!this.#matchOne(fileHead, head, partial, 0, 0)) {\n                return false;\n            }\n            fileIndex += head.length;\n            patternIndex += head.length;\n        }\n        // now we know the head matches!\n        // if the last portion is not empty, it MUST match the end\n        // check the tail\n        let fileTailMatch = 0;\n        if (tail.length) {\n            // if head + tail > file, then we cannot possibly match\n            if (tail.length + fileIndex > file.length)\n                return false;\n            // try to match the tail\n            let tailStart = file.length - tail.length;\n            if (this.#matchOne(file, tail, partial, tailStart, 0)) {\n                fileTailMatch = tail.length;\n            }\n            else {\n                // affordance for stuff like a/**/* matching a/b/\n                // if the last file portion is '', and there's more to the pattern\n                // then try without the '' bit.\n                if (file[file.length - 1] !== '' ||\n                    fileIndex + tail.length === file.length) {\n                    return false;\n                }\n                tailStart--;\n                if (!this.#matchOne(file, tail, partial, tailStart, 0)) {\n                    return false;\n                }\n                fileTailMatch = tail.length + 1;\n            }\n        }\n        // now we know the tail matches!\n        // the middle is zero or more portions wrapped in **, possibly\n        // containing more ** sections.\n        // so a/**/b/**/c/**/d has become **/b/**/c/**\n        // if it's empty, it means a/**/b, just verify we have no bad dots\n        // if there's no tail, so it ends on /**, then we must have *something*\n        // after the head, or it's not a matc\n        if (!body.length) {\n            let sawSome = !!fileTailMatch;\n            for (let i = fileIndex; i < file.length - fileTailMatch; i++) {\n                const f = String(file[i]);\n                sawSome = true;\n                if (f === '.' ||\n                    f === '..' ||\n                    (!this.options.dot && f.startsWith('.'))) {\n                    return false;\n                }\n            }\n            // in partial mode, we just need to get past all file parts\n            return partial || sawSome;\n        }\n        // now we know that there's one or more body sections, which can\n        // be matched anywhere from the 0 index (because the head was pruned)\n        // through to the length-fileTailMatch index.\n        // split the body up into sections, and note the minimum index it can\n        // be found at (start with the length of all previous segments)\n        // [section, before, after]\n        const bodySegments = [[[], 0]];\n        let currentBody = bodySegments[0];\n        let nonGsParts = 0;\n        const nonGsPartsSums = [0];\n        for (const b of body) {\n            if (b === GLOBSTAR) {\n                nonGsPartsSums.push(nonGsParts);\n                currentBody = [[], 0];\n                bodySegments.push(currentBody);\n            }\n            else {\n                currentBody[0].push(b);\n                nonGsParts++;\n            }\n        }\n        let i = bodySegments.length - 1;\n        const fileLength = file.length - fileTailMatch;\n        for (const b of bodySegments) {\n            b[1] = fileLength - (nonGsPartsSums[i--] + b[0].length);\n        }\n        return !!this.#matchGlobStarBodySections(file, bodySegments, fileIndex, 0, partial, 0, !!fileTailMatch);\n    }\n    // return false for \"nope, not matching\"\n    // return null for \"not matching, cannot keep trying\"\n    #matchGlobStarBodySections(file, \n    // pattern section, last possible position for it\n    bodySegments, fileIndex, bodyIndex, partial, globStarDepth, sawTail) {\n        // take the first body segment, and walk from fileIndex to its \"after\"\n        // value at the end\n        // If it doesn't match at that position, we increment, until we hit\n        // that final possible position, and give up.\n        // If it does match, then advance and try to rest.\n        // If any of them fail we keep walking forward.\n        // this is still a bit recursively painful, but it's more constrained\n        // than previous implementations, because we never test something that\n        // can't possibly be a valid matching condition.\n        const bs = bodySegments[bodyIndex];\n        if (!bs) {\n            // just make sure that there's no bad dots\n            for (let i = fileIndex; i < file.length; i++) {\n                sawTail = true;\n                const f = file[i];\n                if (f === '.' ||\n                    f === '..' ||\n                    (!this.options.dot && f.startsWith('.'))) {\n                    return false;\n                }\n            }\n            return sawTail;\n        }\n        // have a non-globstar body section to test\n        const [body, after] = bs;\n        while (fileIndex <= after) {\n            const m = this.#matchOne(file.slice(0, fileIndex + body.length), body, partial, fileIndex, 0);\n            // if limit exceeded, no match. intentional false negative,\n            // acceptable break in correctness for security.\n            if (m && globStarDepth < this.maxGlobstarRecursion) {\n                // match! see if the rest match. if so, we're done!\n                const sub = this.#matchGlobStarBodySections(file, bodySegments, fileIndex + body.length, bodyIndex + 1, partial, globStarDepth + 1, sawTail);\n                if (sub !== false) {\n                    return sub;\n                }\n            }\n            const f = file[fileIndex];\n            if (f === '.' ||\n                f === '..' ||\n                (!this.options.dot && f.startsWith('.'))) {\n                return false;\n            }\n            fileIndex++;\n        }\n        // walked off. no point continuing\n        return partial || null;\n    }\n    #matchOne(file, pattern, partial, fileIndex, patternIndex) {\n        let fi;\n        let pi;\n        let pl;\n        let fl;\n        for (fi = fileIndex,\n            pi = patternIndex,\n            fl = file.length,\n            pl = pattern.length; fi < fl && pi < pl; fi++, pi++) {\n            this.debug('matchOne loop');\n            let p = pattern[pi];\n            let 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 || p === GLOBSTAR) {\n                return false;\n            }\n            /* c8 ignore stop */\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 *.<ext>  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 ? 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 ? 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 ? star\n            : options.dot ? 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' ? regExpEscape(p)\n                    : p === GLOBSTAR ? 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            const filtered = pp.filter(p => p !== GLOBSTAR);\n            // For partial matches, we need to make the pattern match\n            // any prefix of the full path. We do this by generating\n            // alternative patterns that match progressively longer prefixes.\n            if (this.partial && filtered.length >= 1) {\n                const prefixes = [];\n                for (let i = 1; i <= filtered.length; i++) {\n                    prefixes.push(filtered.slice(0, i).join('/'));\n                }\n                return '(?:' + prefixes.join('|') + ')';\n            }\n            return filtered.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        // In partial mode, '/' should always match as it's a valid prefix for any pattern\n        if (this.partial) {\n            re = '^(?:\\\\/|' + open + re.slice(1, -1) + close + ')$';\n        }\n        // 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 {\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 (const pattern of set) {\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"],"x_google_ignoreList":[0],"mappings":";;;;;;AAKA,IAAa,aAAa,GAAG,SAAS,UAAU,CAAC,MAAM;CACnD,mBAAmB,OAAO;CAE1B,IAAI,CAAC,QAAQ,aAAa,QAAQ,OAAO,CAAC,MAAM,KAC5C,OAAO;CAEX,OAAO,IAAI,UAAU,SAAS,OAAO,CAAC,CAAC,MAAM,CAAC;AAClD;AAEA,IAAM,eAAe;AACrB,IAAM,kBAAkB,SAAS,MAAM,CAAC,EAAE,WAAW,GAAG,KAAK,EAAE,SAAS,GAAG;AAC3E,IAAM,qBAAqB,SAAS,MAAM,EAAE,SAAS,GAAG;AACxD,IAAM,wBAAwB,QAAQ;CAClC,MAAM,IAAI,YAAY;CACtB,QAAQ,MAAM,CAAC,EAAE,WAAW,GAAG,KAAK,EAAE,YAAY,CAAC,CAAC,SAAS,GAAG;AACpE;AACA,IAAM,2BAA2B,QAAQ;CACrC,MAAM,IAAI,YAAY;CACtB,QAAQ,MAAM,EAAE,YAAY,CAAC,CAAC,SAAS,GAAG;AAC9C;AACA,IAAM,gBAAgB;AACtB,IAAM,mBAAmB,MAAM,CAAC,EAAE,WAAW,GAAG,KAAK,EAAE,SAAS,GAAG;AACnE,IAAM,sBAAsB,MAAM,MAAM,OAAO,MAAM,QAAQ,EAAE,SAAS,GAAG;AAC3E,IAAM,YAAY;AAClB,IAAM,eAAe,MAAM,MAAM,OAAO,MAAM,QAAQ,EAAE,WAAW,GAAG;AACtE,IAAM,SAAS;AACf,IAAM,YAAY,MAAM,EAAE,WAAW,KAAK,CAAC,EAAE,WAAW,GAAG;AAC3D,IAAM,eAAe,MAAM,EAAE,WAAW,KAAK,MAAM,OAAO,MAAM;AAChE,IAAM,WAAW;AACjB,IAAM,oBAAoB,CAAC,IAAI,MAAM,QAAQ;CACzC,MAAM,QAAQ,gBAAgB,CAAC,EAAE,CAAC;CAClC,IAAI,CAAC,KACD,OAAO;CACX,MAAM,IAAI,YAAY;CACtB,QAAQ,MAAM,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,SAAS,GAAG;AAC1D;AACA,IAAM,uBAAuB,CAAC,IAAI,MAAM,QAAQ;CAC5C,MAAM,QAAQ,mBAAmB,CAAC,EAAE,CAAC;CACrC,IAAI,CAAC,KACD,OAAO;CACX,MAAM,IAAI,YAAY;CACtB,QAAQ,MAAM,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,SAAS,GAAG;AAC1D;AACA,IAAM,iBAAiB,CAAC,IAAI,MAAM,QAAQ;CACtC,MAAM,QAAQ,mBAAmB,CAAC,EAAE,CAAC;CACrC,OAAO,CAAC,MAAM,SAAS,MAAM,MAAM,CAAC,KAAK,EAAE,SAAS,GAAG;AAC3D;AACA,IAAM,cAAc,CAAC,IAAI,MAAM,QAAQ;CACnC,MAAM,QAAQ,gBAAgB,CAAC,EAAE,CAAC;CAClC,OAAO,CAAC,MAAM,SAAS,MAAM,MAAM,CAAC,KAAK,EAAE,SAAS,GAAG;AAC3D;AACA,IAAM,mBAAmB,CAAC,QAAQ;CAC9B,MAAM,MAAM,GAAG;CACf,QAAQ,MAAM,EAAE,WAAW,OAAO,CAAC,EAAE,WAAW,GAAG;AACvD;AACA,IAAM,sBAAsB,CAAC,QAAQ;CACjC,MAAM,MAAM,GAAG;CACf,QAAQ,MAAM,EAAE,WAAW,OAAO,MAAM,OAAO,MAAM;AACzD;;AAEA,IAAM,kBAAmB,OAAO,YAAY,YAAY,UACnD,OAAO,QAAQ,QAAQ,YACpB,QAAQ,OACR,QAAQ,IAAI,kCACZ,QAAQ,WACV;AACN,IAAM,OAAO;CACT,OAAO,EAAE,KAAK,KAAK;CACnB,OAAO,EAAE,KAAK,IAAI;AACtB;;AAEA,IAAa,MAAM,oBAAoB,UAAU,KAAK,MAAM,MAAM,KAAK,MAAM;AAC7E,UAAU,MAAM;AAChB,IAAa,WAAW,OAAO,aAAa;AAC5C,UAAU,WAAW;AAKrB,IAAM,OAAO;AAIb,IAAM,aAAa;AAGnB,IAAM,eAAe;AACrB,IAAa,UAAU,SAAS,UAAU,CAAC,OAAO,MAAM,UAAU,GAAG,SAAS,OAAO;AACrF,UAAU,SAAS;AACnB,IAAM,OAAO,GAAG,IAAI,CAAC,MAAM,OAAO,OAAO,CAAC,GAAG,GAAG,CAAC;AACjD,IAAa,YAAY,QAAQ;CAC7B,IAAI,CAAC,OAAO,OAAO,QAAQ,YAAY,CAAC,OAAO,KAAK,GAAG,CAAC,CAAC,QACrD,OAAO;CAEX,MAAM,OAAO;CACb,MAAM,KAAK,GAAG,SAAS,UAAU,CAAC,MAAM,KAAK,GAAG,SAAS,IAAI,KAAK,OAAO,CAAC;CAC1E,OAAO,OAAO,OAAO,GAAG;EACpB,WAAW,MAAM,kBAAkB,KAAK,UAAU;GAC9C,YAAY,SAAS,UAAU,CAAC,GAAG;IAC/B,MAAM,SAAS,IAAI,KAAK,OAAO,CAAC;GACpC;GACA,OAAO,SAAS,SAAS;IACrB,OAAO,KAAK,SAAS,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC;GAC5C;EACJ;EACA,KAAK,MAAM,YAAY,KAAK,IAAI;;GAE5B,YAAY,MAAM,QAAQ,UAAU,CAAC,GAAG;IACpC,MAAM,MAAM,QAAQ,IAAI,KAAK,OAAO,CAAC;GACzC;;GAEA,OAAO,SAAS,SAAS,UAAU,CAAC,GAAG;IACnC,OAAO,KAAK,IAAI,SAAS,SAAS,IAAI,KAAK,OAAO,CAAC;GACvD;EACJ;EACA,WAAW,GAAG,UAAU,CAAC,MAAM,KAAK,SAAS,GAAG,IAAI,KAAK,OAAO,CAAC;EACjE,SAAS,GAAG,UAAU,CAAC,MAAM,KAAK,OAAO,GAAG,IAAI,KAAK,OAAO,CAAC;EAC7D,SAAS,SAAS,UAAU,CAAC,MAAM,KAAK,OAAO,SAAS,IAAI,KAAK,OAAO,CAAC;EACzE,WAAW,YAAY,KAAK,SAAS,IAAI,KAAK,OAAO,CAAC;EACtD,SAAS,SAAS,UAAU,CAAC,MAAM,KAAK,OAAO,SAAS,IAAI,KAAK,OAAO,CAAC;EACzE,cAAc,SAAS,UAAU,CAAC,MAAM,KAAK,YAAY,SAAS,IAAI,KAAK,OAAO,CAAC;EACnF,QAAQ,MAAM,SAAS,UAAU,CAAC,MAAM,KAAK,MAAM,MAAM,SAAS,IAAI,KAAK,OAAO,CAAC;EACnF,KAAK,KAAK;EACA;CACd,CAAC;AACL;AACA,UAAU,WAAW;AAWrB,IAAa,eAAe,SAAS,UAAU,CAAC,MAAM;CAClD,mBAAmB,OAAO;CAG1B,IAAI,QAAQ,WAAW,CAAC,mBAAmB,KAAK,OAAO,GAEnD,OAAO,CAAC,OAAO;CAEnB,OAAO,OAAO,SAAS,EAAE,KAAK,QAAQ,eAAe,CAAC;AAC1D;AACA,UAAU,cAAc;AAYxB,IAAa,UAAU,SAAS,UAAU,CAAC,MAAM,IAAI,UAAU,SAAS,OAAO,CAAC,CAAC,OAAO;AACxF,UAAU,SAAS;AACnB,IAAa,SAAS,MAAM,SAAS,UAAU,CAAC,MAAM;CAClD,MAAM,KAAK,IAAI,UAAU,SAAS,OAAO;CACzC,OAAO,KAAK,QAAO,MAAK,GAAG,MAAM,CAAC,CAAC;CACnC,IAAI,GAAG,QAAQ,UAAU,CAAC,KAAK,QAC3B,KAAK,KAAK,OAAO;CAErB,OAAO;AACX;AACA,UAAU,QAAQ;AAElB,IAAM,YAAY;AAClB,IAAM,gBAAgB,MAAM,EAAE,QAAQ,4BAA4B,MAAM;AACxE,IAAa,YAAb,MAAuB;CACnB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,YAAY,SAAS,UAAU,CAAC,GAAG;EAC/B,mBAAmB,OAAO;EAC1B,UAAU,WAAW,CAAC;EACtB,KAAK,UAAU;EACf,KAAK,uBAAuB,QAAQ,wBAAwB;EAC5D,KAAK,UAAU;EACf,KAAK,WAAW,QAAQ,YAAY;EACpC,KAAK,YAAY,KAAK,aAAa;EAEnC,MAAM,MAAO;EACb,KAAK,uBACD,CAAC,CAAC,QAAQ,wBAAwB,QAAQ,SAAS;EACvD,IAAI,KAAK,sBACL,KAAK,UAAU,KAAK,QAAQ,QAAQ,OAAO,GAAG;EAElD,KAAK,0BAA0B,CAAC,CAAC,QAAQ;EACzC,KAAK,SAAS;EACd,KAAK,SAAS;EACd,KAAK,WAAW,CAAC,CAAC,QAAQ;EAC1B,KAAK,UAAU;EACf,KAAK,QAAQ;EACb,KAAK,UAAU,CAAC,CAAC,QAAQ;EACzB,KAAK,SAAS,CAAC,CAAC,KAAK,QAAQ;EAC7B,KAAK,qBACD,QAAQ,uBAAuB,KAAA,IAC3B,QAAQ,qBACN,CAAC,EAAE,KAAK,aAAa,KAAK;EACpC,KAAK,UAAU,CAAC;EAChB,KAAK,YAAY,CAAC;EAClB,KAAK,MAAM,CAAC;EAEZ,KAAK,KAAK;CACd;CACA,WAAW;EACP,IAAI,KAAK,QAAQ,iBAAiB,KAAK,IAAI,SAAS,GAChD,OAAO;EAEX,KAAK,MAAM,WAAW,KAAK,KACvB,KAAK,MAAM,QAAQ,SACf,IAAI,OAAO,SAAS,UAChB,OAAO;EAGnB,OAAO;CACX;CACA,MAAM,GAAG,GAAG,CAAE;CACd,OAAO;EACH,MAAM,UAAU,KAAK;EACrB,MAAM,UAAU,KAAK;EAErB,IAAI,CAAC,QAAQ,aAAa,QAAQ,OAAO,CAAC,MAAM,KAAK;GACjD,KAAK,UAAU;GACf;EACJ;EACA,IAAI,CAAC,SAAS;GACV,KAAK,QAAQ;GACb;EACJ;EAEA,KAAK,YAAY;EAEjB,KAAK,UAAU,CAAC,GAAG,IAAI,IAAI,KAAK,YAAY,CAAC,CAAC;EAC9C,IAAI,QAAQ,OAER,KAAK,SAAS,GAAG,SAAS,QAAQ,MAAM,GAAG,IAAI;EAEnD,KAAK,MAAM,KAAK,SAAS,KAAK,OAAO;EAUrC,MAAM,eAAe,KAAK,QAAQ,KAAI,MAAK,KAAK,WAAW,CAAC,CAAC;EAC7D,KAAK,YAAY,KAAK,WAAW,YAAY;EAC7C,KAAK,MAAM,KAAK,SAAS,KAAK,SAAS;EAEvC,IAAI,MAAM,KAAK,UAAU,KAAK,GAAG,GAAG,OAAO;GACvC,IAAI,KAAK,aAAa,KAAK,oBAAoB;IAE3C,MAAM,QAAQ,EAAE,OAAO,MACnB,EAAE,OAAO,OACR,EAAE,OAAO,OAAO,CAAC,UAAU,KAAK,EAAE,EAAE,MACrC,CAAC,UAAU,KAAK,EAAE,EAAE;IACxB,MAAM,UAAU,WAAW,KAAK,EAAE,EAAE;IACpC,IAAI,OACA,OAAO,CACH,GAAG,EAAE,MAAM,GAAG,CAAC,GACf,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,KAAI,OAAM,KAAK,MAAM,EAAE,CAAC,CAC1C;SAEC,IAAI,SACL,OAAO,CAAC,EAAE,IAAI,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,KAAI,OAAM,KAAK,MAAM,EAAE,CAAC,CAAC;GAE7D;GACA,OAAO,EAAE,KAAI,OAAM,KAAK,MAAM,EAAE,CAAC;EACrC,CAAC;EACD,KAAK,MAAM,KAAK,SAAS,GAAG;EAE5B,KAAK,MAAM,IAAI,QAAO,MAAK,EAAE,QAAQ,KAAK,MAAM,EAAE;EAElD,IAAI,KAAK,WACL,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;GACtC,MAAM,IAAI,KAAK,IAAI;GACnB,IAAI,EAAE,OAAO,MACT,EAAE,OAAO,MACT,KAAK,UAAU,EAAE,CAAC,OAAO,OACzB,OAAO,EAAE,OAAO,YAChB,YAAY,KAAK,EAAE,EAAE,GACrB,EAAE,KAAK;EAEf;EAEJ,KAAK,MAAM,KAAK,SAAS,KAAK,GAAG;CACrC;CAMA,WAAW,WAAW;EAElB,IAAI,KAAK,QAAQ;QACR,MAAM,WAAW,WAClB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAChC,IAAI,QAAQ,OAAO,MACf,QAAQ,KAAK;EAAA;EAK7B,MAAM,EAAE,oBAAoB,MAAM,KAAK;EACvC,IAAI,qBAAqB,GAAG;GAExB,YAAY,KAAK,qBAAqB,SAAS;GAC/C,YAAY,KAAK,sBAAsB,SAAS;EACpD,OACK,IAAI,qBAAqB,GAE1B,YAAY,KAAK,iBAAiB,SAAS;OAI3C,YAAY,KAAK,0BAA0B,SAAS;EAExD,OAAO;CACX;CAEA,0BAA0B,WAAW;EACjC,OAAO,UAAU,KAAI,UAAS;GAC1B,IAAI,KAAK;GACT,OAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,CAAC,IAAI;IAC9C,IAAI,IAAI;IACR,OAAO,MAAM,IAAI,OAAO,MACpB;IAEJ,IAAI,MAAM,IACN,MAAM,OAAO,IAAI,IAAI,EAAE;GAE/B;GACA,OAAO;EACX,CAAC;CACL;CAEA,iBAAiB,WAAW;EACxB,OAAO,UAAU,KAAI,UAAS;GAC1B,QAAQ,MAAM,QAAQ,KAAK,SAAS;IAChC,MAAM,OAAO,IAAI,IAAI,SAAS;IAC9B,IAAI,SAAS,QAAQ,SAAS,MAC1B,OAAO;IAEX,IAAI,SAAS;SACL,QAAQ,SAAS,QAAQ,SAAS,OAAO,SAAS,MAAM;MACxD,IAAI,IAAI;MACR,OAAO;KACX;;IAEJ,IAAI,KAAK,IAAI;IACb,OAAO;GACX,GAAG,CAAC,CAAC;GACL,OAAO,MAAM,WAAW,IAAI,CAAC,EAAE,IAAI;EACvC,CAAC;CACL;CACA,qBAAqB,OAAO;EACxB,IAAI,CAAC,MAAM,QAAQ,KAAK,GACpB,QAAQ,KAAK,WAAW,KAAK;EAEjC,IAAI,eAAe;EACnB,GAAG;GACC,eAAe;GAEf,IAAI,CAAC,KAAK,yBAAyB;IAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK;KACvC,MAAM,IAAI,MAAM;KAEhB,IAAI,MAAM,KAAK,MAAM,MAAM,MAAM,OAAO,IACpC;KACJ,IAAI,MAAM,OAAO,MAAM,IAAI;MACvB,eAAe;MACf,MAAM,OAAO,GAAG,CAAC;MACjB;KACJ;IACJ;IACA,IAAI,MAAM,OAAO,OACb,MAAM,WAAW,MAChB,MAAM,OAAO,OAAO,MAAM,OAAO,KAAK;KACvC,eAAe;KACf,MAAM,IAAI;IACd;GACJ;GAEA,IAAI,KAAK;GACT,OAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,CAAC,IAAI;IAC9C,MAAM,IAAI,MAAM,KAAK;IACrB,IAAI,KACA,MAAM,OACN,MAAM,QACN,MAAM,QACN,EAAE,KAAK,aAAa,YAAY,KAAK,CAAC,IAAI;KAC1C,eAAe;KACf,MAAM,OAAO,KAAK,GAAG,CAAC;KACtB,MAAM;IACV;GACJ;EACJ,SAAS;EACT,OAAO,MAAM,WAAW,IAAI,CAAC,EAAE,IAAI;CACvC;CAmBA,qBAAqB,WAAW;EAC5B,IAAI,eAAe;EACnB,GAAG;GACC,eAAe;GAEf,KAAK,IAAI,SAAS,WAAW;IACzB,IAAI,KAAK;IACT,OAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,CAAC,IAAI;KAC9C,IAAI,MAAM;KACV,OAAO,MAAM,MAAM,OAAO,MAEtB;KAIJ,IAAI,MAAM,IACN,MAAM,OAAO,KAAK,GAAG,MAAM,EAAE;KAEjC,IAAI,OAAO,MAAM,KAAK;KACtB,MAAM,IAAI,MAAM,KAAK;KACrB,MAAM,KAAK,MAAM,KAAK;KACtB,IAAI,SAAS,MACT;KACJ,IAAI,CAAC,KACD,MAAM,OACN,MAAM,QACN,CAAC,MACD,OAAO,OACP,OAAO,MACP;KAEJ,eAAe;KAEf,MAAM,OAAO,IAAI,CAAC;KAClB,MAAM,QAAQ,MAAM,MAAM,CAAC;KAC3B,MAAM,MAAM;KACZ,UAAU,KAAK,KAAK;KACpB;IACJ;IAEA,IAAI,CAAC,KAAK,yBAAyB;KAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK;MACvC,MAAM,IAAI,MAAM;MAEhB,IAAI,MAAM,KAAK,MAAM,MAAM,MAAM,OAAO,IACpC;MACJ,IAAI,MAAM,OAAO,MAAM,IAAI;OACvB,eAAe;OACf,MAAM,OAAO,GAAG,CAAC;OACjB;MACJ;KACJ;KACA,IAAI,MAAM,OAAO,OACb,MAAM,WAAW,MAChB,MAAM,OAAO,OAAO,MAAM,OAAO,KAAK;MACvC,eAAe;MACf,MAAM,IAAI;KACd;IACJ;IAEA,IAAI,KAAK;IACT,OAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,CAAC,IAAI;KAC9C,MAAM,IAAI,MAAM,KAAK;KACrB,IAAI,KAAK,MAAM,OAAO,MAAM,QAAQ,MAAM,MAAM;MAC5C,eAAe;MAEf,MAAM,QADU,OAAO,KAAK,MAAM,KAAK,OAAO,OACtB,CAAC,GAAG,IAAI,CAAC;MACjC,MAAM,OAAO,KAAK,GAAG,GAAG,GAAG,KAAK;MAChC,IAAI,MAAM,WAAW,GACjB,MAAM,KAAK,EAAE;MACjB,MAAM;KACV;IACJ;GACJ;EACJ,SAAS;EACT,OAAO;CACX;CAQA,sBAAsB,WAAW;EAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,SAAS,GAAG,KACtC,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;GAC3C,MAAM,UAAU,KAAK,WAAW,UAAU,IAAI,UAAU,IAAI,CAAC,KAAK,uBAAuB;GACzF,IAAI,SAAS;IACT,UAAU,KAAK,CAAC;IAChB,UAAU,KAAK;IACf;GACJ;EACJ;EAEJ,OAAO,UAAU,QAAO,OAAM,GAAG,MAAM;CAC3C;CACA,WAAW,GAAG,GAAG,eAAe,OAAO;EACnC,IAAI,KAAK;EACT,IAAI,KAAK;EACT,IAAI,SAAS,CAAC;EACd,IAAI,QAAQ;EACZ,OAAO,KAAK,EAAE,UAAU,KAAK,EAAE,QAC3B,IAAI,EAAE,QAAQ,EAAE,KAAK;GACjB,OAAO,KAAK,UAAU,MAAM,EAAE,MAAM,EAAE,GAAG;GACzC;GACA;EACJ,OACK,IAAI,gBAAgB,EAAE,QAAQ,QAAQ,EAAE,QAAQ,EAAE,KAAK,IAAI;GAC5D,OAAO,KAAK,EAAE,GAAG;GACjB;EACJ,OACK,IAAI,gBAAgB,EAAE,QAAQ,QAAQ,EAAE,QAAQ,EAAE,KAAK,IAAI;GAC5D,OAAO,KAAK,EAAE,GAAG;GACjB;EACJ,OACK,IAAI,EAAE,QAAQ,OACf,EAAE,QACD,KAAK,QAAQ,OAAO,CAAC,EAAE,GAAG,CAAC,WAAW,GAAG,MAC1C,EAAE,QAAQ,MAAM;GAChB,IAAI,UAAU,KACV,OAAO;GACX,QAAQ;GACR,OAAO,KAAK,EAAE,GAAG;GACjB;GACA;EACJ,OACK,IAAI,EAAE,QAAQ,OACf,EAAE,QACD,KAAK,QAAQ,OAAO,CAAC,EAAE,GAAG,CAAC,WAAW,GAAG,MAC1C,EAAE,QAAQ,MAAM;GAChB,IAAI,UAAU,KACV,OAAO;GACX,QAAQ;GACR,OAAO,KAAK,EAAE,GAAG;GACjB;GACA;EACJ,OAEI,OAAO;EAKf,OAAO,EAAE,WAAW,EAAE,UAAU;CACpC;CACA,cAAc;EACV,IAAI,KAAK,UACL;EACJ,MAAM,UAAU,KAAK;EACrB,IAAI,SAAS;EACb,IAAI,eAAe;EACnB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,UAAU,QAAQ,OAAO,CAAC,MAAM,KAAK,KAAK;GAClE,SAAS,CAAC;GACV;EACJ;EACA,IAAI,cACA,KAAK,UAAU,QAAQ,MAAM,YAAY;EAC7C,KAAK,SAAS;CAClB;CAMA,SAAS,MAAM,SAAS,UAAU,OAAO;EACrC,IAAI,iBAAiB;EACrB,IAAI,oBAAoB;EAIxB,IAAI,KAAK,WAAW;GAChB,MAAM,YAAY,OAAO,KAAK,OAAO,YAAY,YAAY,KAAK,KAAK,EAAE;GACzE,MAAM,UAAU,CAAC,aACb,KAAK,OAAO,MACZ,KAAK,OAAO,MACZ,KAAK,OAAO,OACZ,YAAY,KAAK,KAAK,EAAE;GAC5B,MAAM,eAAe,OAAO,QAAQ,OAAO,YAAY,YAAY,KAAK,QAAQ,EAAE;GAClF,MAAM,aAAa,CAAC,gBAChB,QAAQ,OAAO,MACf,QAAQ,OAAO,MACf,QAAQ,OAAO,OACf,OAAO,QAAQ,OAAO,YACtB,YAAY,KAAK,QAAQ,EAAE;GAC/B,MAAM,MAAM,UAAU,IAChB,YAAY,IACR,KAAA;GACV,MAAM,MAAM,aAAa,IACnB,eAAe,IACX,KAAA;GACV,IAAI,OAAO,QAAQ,YAAY,OAAO,QAAQ,UAAU;IACpD,MAAM,CAAC,IAAI,MAAM,CACb,KAAK,MACL,QAAQ,IACZ;IAEA,IAAI,GAAG,YAAY,MAAM,GAAG,YAAY,GAAG;KACvC,QAAQ,OAAO;KACf,oBAAoB;KACpB,iBAAiB;IACrB;GACJ;EACJ;EAGA,MAAM,EAAE,oBAAoB,MAAM,KAAK;EACvC,IAAI,qBAAqB,GACrB,OAAO,KAAK,qBAAqB,IAAI;EAEzC,IAAI,QAAQ,SAAS,QAAQ,GACzB,OAAO,KAAKA,eAAe,MAAM,SAAS,SAAS,gBAAgB,iBAAiB;EAExF,OAAO,KAAKC,UAAU,MAAM,SAAS,SAAS,gBAAgB,iBAAiB;CACnF;CACA,eAAe,MAAM,SAAS,SAAS,WAAW,cAAc;EAE5D,MAAM,UAAU,QAAQ,QAAQ,UAAU,YAAY;EACtD,MAAM,SAAS,QAAQ,YAAY,QAAQ;EAI3C,MAAM,CAAC,MAAM,MAAM,QAAQ,UACvB;GACI,QAAQ,MAAM,cAAc,OAAO;GACnC,QAAQ,MAAM,UAAU,CAAC;GACzB,CAAC;EACL,IACE;GACE,QAAQ,MAAM,cAAc,OAAO;GACnC,QAAQ,MAAM,UAAU,GAAG,MAAM;GACjC,QAAQ,MAAM,SAAS,CAAC;EAC5B;EAEJ,IAAI,KAAK,QAAQ;GACb,MAAM,WAAW,KAAK,MAAM,WAAW,YAAY,KAAK,MAAM;GAC9D,IAAI,CAAC,KAAKA,UAAU,UAAU,MAAM,SAAS,GAAG,CAAC,GAC7C,OAAO;GAEX,aAAa,KAAK;GAClB,gBAAgB,KAAK;EACzB;EAIA,IAAI,gBAAgB;EACpB,IAAI,KAAK,QAAQ;GAEb,IAAI,KAAK,SAAS,YAAY,KAAK,QAC/B,OAAO;GAEX,IAAI,YAAY,KAAK,SAAS,KAAK;GACnC,IAAI,KAAKA,UAAU,MAAM,MAAM,SAAS,WAAW,CAAC,GAChD,gBAAgB,KAAK;QAEpB;IAID,IAAI,KAAK,KAAK,SAAS,OAAO,MAC1B,YAAY,KAAK,WAAW,KAAK,QACjC,OAAO;IAEX;IACA,IAAI,CAAC,KAAKA,UAAU,MAAM,MAAM,SAAS,WAAW,CAAC,GACjD,OAAO;IAEX,gBAAgB,KAAK,SAAS;GAClC;EACJ;EAQA,IAAI,CAAC,KAAK,QAAQ;GACd,IAAI,UAAU,CAAC,CAAC;GAChB,KAAK,IAAI,IAAI,WAAW,IAAI,KAAK,SAAS,eAAe,KAAK;IAC1D,MAAM,IAAI,OAAO,KAAK,EAAE;IACxB,UAAU;IACV,IAAI,MAAM,OACN,MAAM,QACL,CAAC,KAAK,QAAQ,OAAO,EAAE,WAAW,GAAG,GACtC,OAAO;GAEf;GAEA,OAAO,WAAW;EACtB;EAOA,MAAM,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;EAC7B,IAAI,cAAc,aAAa;EAC/B,IAAI,aAAa;EACjB,MAAM,iBAAiB,CAAC,CAAC;EACzB,KAAK,MAAM,KAAK,MACZ,IAAI,MAAM,UAAU;GAChB,eAAe,KAAK,UAAU;GAC9B,cAAc,CAAC,CAAC,GAAG,CAAC;GACpB,aAAa,KAAK,WAAW;EACjC,OACK;GACD,YAAY,EAAE,CAAC,KAAK,CAAC;GACrB;EACJ;EAEJ,IAAI,IAAI,aAAa,SAAS;EAC9B,MAAM,aAAa,KAAK,SAAS;EACjC,KAAK,MAAM,KAAK,cACZ,EAAE,KAAK,cAAc,eAAe,OAAO,EAAE,EAAE,CAAC;EAEpD,OAAO,CAAC,CAAC,KAAKC,2BAA2B,MAAM,cAAc,WAAW,GAAG,SAAS,GAAG,CAAC,CAAC,aAAa;CAC1G;CAGA,2BAA2B,MAE3B,cAAc,WAAW,WAAW,SAAS,eAAe,SAAS;EAUjE,MAAM,KAAK,aAAa;EACxB,IAAI,CAAC,IAAI;GAEL,KAAK,IAAI,IAAI,WAAW,IAAI,KAAK,QAAQ,KAAK;IAC1C,UAAU;IACV,MAAM,IAAI,KAAK;IACf,IAAI,MAAM,OACN,MAAM,QACL,CAAC,KAAK,QAAQ,OAAO,EAAE,WAAW,GAAG,GACtC,OAAO;GAEf;GACA,OAAO;EACX;EAEA,MAAM,CAAC,MAAM,SAAS;EACtB,OAAO,aAAa,OAAO;GAIvB,IAHU,KAAKD,UAAU,KAAK,MAAM,GAAG,YAAY,KAAK,MAAM,GAAG,MAAM,SAAS,WAAW,CAGvF,KAAK,gBAAgB,KAAK,sBAAsB;IAEhD,MAAM,MAAM,KAAKC,2BAA2B,MAAM,cAAc,YAAY,KAAK,QAAQ,YAAY,GAAG,SAAS,gBAAgB,GAAG,OAAO;IAC3I,IAAI,QAAQ,OACR,OAAO;GAEf;GACA,MAAM,IAAI,KAAK;GACf,IAAI,MAAM,OACN,MAAM,QACL,CAAC,KAAK,QAAQ,OAAO,EAAE,WAAW,GAAG,GACtC,OAAO;GAEX;EACJ;EAEA,OAAO,WAAW;CACtB;CACA,UAAU,MAAM,SAAS,SAAS,WAAW,cAAc;EACvD,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,KAAK,KAAK,WACN,KAAK,cACL,KAAK,KAAK,QACV,KAAK,QAAQ,QAAQ,KAAK,MAAM,KAAK,IAAI,MAAM,MAAM;GACrD,KAAK,MAAM,eAAe;GAC1B,IAAI,IAAI,QAAQ;GAChB,IAAI,IAAI,KAAK;GACb,KAAK,MAAM,SAAS,GAAG,CAAC;;GAIxB,IAAI,MAAM,SAAS,MAAM,UACrB,OAAO;;GAMX,IAAI;GACJ,IAAI,OAAO,MAAM,UAAU;IACvB,MAAM,MAAM;IACZ,KAAK,MAAM,gBAAgB,GAAG,GAAG,GAAG;GACxC,OACK;IACD,MAAM,EAAE,KAAK,CAAC;IACd,KAAK,MAAM,iBAAiB,GAAG,GAAG,GAAG;GACzC;GACA,IAAI,CAAC,KACD,OAAO;EACf;EAYA,IAAI,OAAO,MAAM,OAAO,IAGpB,OAAO;OAEN,IAAI,OAAO,IAIZ,OAAO;OAEN,IAAI,OAAO,IAKZ,OAAO,OAAO,KAAK,KAAK,KAAK,QAAQ;OAKrC,MAAM,IAAI,MAAM,MAAM;;CAG9B;CACA,cAAc;EACV,OAAO,YAAY,KAAK,SAAS,KAAK,OAAO;CACjD;CACA,MAAM,SAAS;EACX,mBAAmB,OAAO;EAC1B,MAAM,UAAU,KAAK;EAErB,IAAI,YAAY,MACZ,OAAO;EACX,IAAI,YAAY,IACZ,OAAO;EAGX,IAAI;EACJ,IAAI,WAAW;EACf,IAAK,IAAI,QAAQ,MAAM,MAAM,GACzB,WAAW,QAAQ,MAAM,cAAc;OAEtC,IAAK,IAAI,QAAQ,MAAM,YAAY,GACpC,YAAY,QAAQ,SAChB,QAAQ,MACJ,0BACE,uBACJ,QAAQ,MAAM,oBACV,eAAA,CAAgB,EAAE,EAAE;OAE7B,IAAK,IAAI,QAAQ,MAAM,QAAQ,GAChC,YAAY,QAAQ,SAChB,QAAQ,MACJ,sBACE,mBACJ,QAAQ,MAAM,gBACV,WAAA,CAAY,CAAC;OAEtB,IAAK,IAAI,QAAQ,MAAM,aAAa,GACrC,WAAW,QAAQ,MAAM,qBAAqB;OAE7C,IAAK,IAAI,QAAQ,MAAM,SAAS,GACjC,WAAW;EAEf,MAAM,KAAK,IAAI,SAAS,SAAS,KAAK,OAAO,CAAC,CAAC,YAAY;EAC3D,IAAI,YAAY,OAAO,OAAO,UAE1B,QAAQ,eAAe,IAAI,QAAQ,EAAE,OAAO,SAAS,CAAC;EAE1D,OAAO;CACX;CACA,SAAS;EACL,IAAI,KAAK,UAAU,KAAK,WAAW,OAC/B,OAAO,KAAK;EAOhB,MAAM,MAAM,KAAK;EACjB,IAAI,CAAC,IAAI,QAAQ;GACb,KAAK,SAAS;GACd,OAAO,KAAK;EAChB;EACA,MAAM,UAAU,KAAK;EACrB,MAAM,UAAU,QAAQ,aAAa,OAC/B,QAAQ,MAAM,aACV;EACV,MAAM,QAAQ,IAAI,IAAI,QAAQ,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC;EAOjD,IAAI,KAAK,IACJ,KAAI,YAAW;GAChB,MAAM,KAAK,QAAQ,KAAI,MAAK;IACxB,IAAI,aAAa,QACb,KAAK,MAAM,KAAK,EAAE,MAAM,MAAM,EAAE,GAC5B,MAAM,IAAI,CAAC;IAEnB,OAAQ,OAAO,MAAM,WAAW,aAAa,CAAC,IACxC,MAAM,WAAW,WACb,EAAE;GAChB,CAAC;GACD,GAAG,SAAS,GAAG,MAAM;IACjB,MAAM,OAAO,GAAG,IAAI;IACpB,MAAM,OAAO,GAAG,IAAI;IACpB,IAAI,MAAM,YAAY,SAAS,UAC3B;IAEJ,IAAI,SAAS,KAAA,GACT,IAAI,SAAS,KAAA,KAAa,SAAS,UAC/B,GAAG,IAAI,KAAK,YAAY,UAAU,UAAU;SAG5C,GAAG,KAAK;SAGX,IAAI,SAAS,KAAA,GACd,GAAG,IAAI,KAAK,OAAO,eAAe,UAAU;SAE3C,IAAI,SAAS,UAAU;KACxB,GAAG,IAAI,KAAK,OAAO,eAAe,UAAU,SAAS;KACrD,GAAG,IAAI,KAAK;IAChB;GACJ,CAAC;GACD,MAAM,WAAW,GAAG,QAAO,MAAK,MAAM,QAAQ;GAI9C,IAAI,KAAK,WAAW,SAAS,UAAU,GAAG;IACtC,MAAM,WAAW,CAAC;IAClB,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS,QAAQ,KAClC,SAAS,KAAK,SAAS,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC;IAEhD,OAAO,QAAQ,SAAS,KAAK,GAAG,IAAI;GACxC;GACA,OAAO,SAAS,KAAK,GAAG;EAC5B,CAAC,CAAC,CACG,KAAK,GAAG;EAGb,MAAM,CAAC,MAAM,SAAS,IAAI,SAAS,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE;EAG7D,KAAK,MAAM,OAAO,KAAK,QAAQ;EAE/B,IAAI,KAAK,SACL,KAAK,aAAa,OAAO,GAAG,MAAM,GAAG,EAAE,IAAI,QAAQ;EAGvD,IAAI,KAAK,QACL,KAAK,SAAS,KAAK;EACvB,IAAI;GACA,KAAK,SAAS,IAAI,OAAO,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;EAEpD,QACM;GAEF,KAAK,SAAS;EAClB;;EAEA,OAAO,KAAK;CAChB;CACA,WAAW,GAAG;EAKV,IAAI,KAAK,yBACL,OAAO,EAAE,MAAM,GAAG;OAEjB,IAAI,KAAK,aAAa,aAAa,KAAK,CAAC,GAE1C,OAAO,CAAC,IAAI,GAAG,EAAE,MAAM,KAAK,CAAC;OAG7B,OAAO,EAAE,MAAM,KAAK;CAE5B;CACA,MAAM,GAAG,UAAU,KAAK,SAAS;EAC7B,KAAK,MAAM,SAAS,GAAG,KAAK,OAAO;EAGnC,IAAI,KAAK,SACL,OAAO;EAEX,IAAI,KAAK,OACL,OAAO,MAAM;EAEjB,IAAI,MAAM,OAAO,SACb,OAAO;EAEX,MAAM,UAAU,KAAK;EAErB,IAAI,KAAK,WACL,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC,KAAK,GAAG;EAG9B,MAAM,KAAK,KAAK,WAAW,CAAC;EAC5B,KAAK,MAAM,KAAK,SAAS,SAAS,EAAE;EAKpC,MAAM,MAAM,KAAK;EACjB,KAAK,MAAM,KAAK,SAAS,OAAO,GAAG;EAEnC,IAAI,WAAW,GAAG,GAAG,SAAS;EAC9B,IAAI,CAAC,UACD,KAAK,IAAI,IAAI,GAAG,SAAS,GAAG,CAAC,YAAY,KAAK,GAAG,KAC7C,WAAW,GAAG;EAGtB,KAAK,MAAM,WAAW,KAAK;GACvB,IAAI,OAAO;GACX,IAAI,QAAQ,aAAa,QAAQ,WAAW,GACxC,OAAO,CAAC,QAAQ;GAGpB,IADY,KAAK,SAAS,MAAM,SAAS,OACnC,GAAG;IACL,IAAI,QAAQ,YACR,OAAO;IAEX,OAAO,CAAC,KAAK;GACjB;EACJ;EAGA,IAAI,QAAQ,YACR,OAAO;EAEX,OAAO,KAAK;CAChB;CACA,OAAO,SAAS,KAAK;EACjB,OAAO,UAAU,SAAS,GAAG,CAAC,CAAC;CACnC;AACJ;;AAMA,UAAU,MAAM;AAChB,UAAU,YAAY;AACtB,UAAU,SAAS;AACnB,UAAU,WAAW"}
+{"version":3,"file":"index.js","names":["#matchGlobstar","#matchOne","#matchGlobStarBodySections"],"sources":["../../../../../../../../../../node_modules/.pnpm/minimatch@10.2.6/node_modules/minimatch/dist/esm/index.js"],"sourcesContent":["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 <https://github.com/yetingli> for\n    // improving this regexp to avoid a ReDOS vulnerability.\n    if (options.nobrace || !/\\{(?:(?!\\{).)*\\}/.test(pattern)) {\n        // shortcut. no need to expand.\n        return [pattern];\n    }\n    return expand(pattern, { max: options.braceExpandMax });\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    maxGlobstarRecursion;\n    regexp;\n    constructor(pattern, options = {}) {\n        assertValidPattern(pattern);\n        options = options || {};\n        this.options = options;\n        this.maxGlobstarRecursion = options.maxGlobstarRecursion ?? 200;\n        this.pattern = pattern;\n        this.platform = options.platform || defaultPlatform;\n        this.isWindows = this.platform === 'win32';\n        // avoid the annoying deprecation flag lol\n        const awe = ('allowWindow' + 'sEscape');\n        this.windowsPathsNoEscape =\n            !!options.windowsPathsNoEscape || options[awe] === false;\n        if (this.windowsPathsNoEscape) {\n            this.pattern = this.pattern.replace(/\\\\/g, '/');\n        }\n        this.preserveMultipleSlashes = !!options.preserveMultipleSlashes;\n        this.regexp = null;\n        this.negate = false;\n        this.nonegate = !!options.nonegate;\n        this.comment = false;\n        this.empty = false;\n        this.partial = !!options.partial;\n        this.nocase = !!this.options.nocase;\n        this.windowsNoMagicRoot =\n            options.windowsNoMagicRoot !== undefined ?\n                options.windowsNoMagicRoot\n                : !!(this.isWindows && this.nocase);\n        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            //oxlint-disable-next-line no-console\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 [\n                        ...s.slice(0, 4),\n                        ...s.slice(4).map(ss => this.parse(ss)),\n                    ];\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 ** into *\n        if (this.options.noglobstar) {\n            for (const partset of globParts) {\n                for (let j = 0; j < partset.length; j++) {\n                    if (partset[j] === '**') {\n                        partset[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            // <pre>/<e>/<rest> -> <pre>/<rest>\n            if (!this.preserveMultipleSlashes) {\n                for (let i = 1; i < parts.length - 1; i++) {\n                    const p = parts[i];\n                    // don't squeeze out UNC patterns\n                    if (i === 1 && p === '' && parts[0] === '')\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            // <pre>/<p>/../<rest> -> <pre>/<rest>\n            let dd = 0;\n            while (-1 !== (dd = parts.indexOf('..', dd + 1))) {\n                const p = parts[dd - 1];\n                if (p &&\n                    p !== '.' &&\n                    p !== '..' &&\n                    p !== '**' &&\n                    !(this.isWindows && /^[a-z]:$/i.test(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    // <pre> is 1 or more portions\n    // <rest> is 1 or more portions\n    // <p> is any portion other than ., .., '', or **\n    // <e> is . or ''\n    //\n    // **/.. is *brutal* for filesystem walking performance, because\n    // it effectively resets the recursive walk each time it occurs,\n    // and ** cannot be reduced out by a .. pattern part like a regexp\n    // or most strings (other than .., ., and '') can be.\n    //\n    // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n    // <pre>/<e>/<rest> -> <pre>/<rest>\n    // <pre>/<p>/../<rest> -> <pre>/<rest>\n    // **/**/<rest> -> **/<rest>\n    //\n    // **/*/<rest> -> */**/<rest> <== not valid because ** doesn't follow\n    // this WOULD be allowed if ** did follow symlinks, or * didn't\n    firstPhasePreProcess(globParts) {\n        let didSomething = false;\n        do {\n            didSomething = false;\n            // <pre>/**/../<p>/<p>/<rest> -> {<pre>/../<p>/<p>/<rest>,<pre>/**/<p>/<p>/<rest>}\n            for (let parts of globParts) {\n                let gs = -1;\n                while (-1 !== (gs = parts.indexOf('**', gs + 1))) {\n                    let gss = gs;\n                    while (parts[gss + 1] === '**') {\n                        // <pre>/**/**/<rest> -> <pre>/**/<rest>\n                        gss++;\n                    }\n                    // eg, if gs is 2 and gss is 4, that means we have 3 **\n                    // parts, and can remove 2 of them.\n                    if (gss > gs) {\n                        parts.splice(gs + 1, gss - gs);\n                    }\n                    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                // <pre>/<e>/<rest> -> <pre>/<rest>\n                if (!this.preserveMultipleSlashes) {\n                    for (let i = 1; i < parts.length - 1; i++) {\n                        const p = parts[i];\n                        // don't squeeze out UNC patterns\n                        if (i === 1 && p === '' && parts[0] === '')\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                // <pre>/<p>/../<rest> -> <pre>/<rest>\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    // {<pre>/*/<rest>,<pre>/<p>/<rest>} -> <pre>/*/<rest>\n    // {<pre>/<rest>,<pre>/<rest>} -> <pre>/<rest>\n    // {<pre>/**/<rest>,<pre>/<rest>} -> <pre>/**/<rest>\n    //\n    // {<pre>/**/<rest>,<pre>/**/<p>/<rest>} -> <pre>/**/<rest>\n    // ^-- not valid because ** doens't follow symlinks\n    secondPhasePreProcess(globParts) {\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        let fileStartIndex = 0;\n        let patternStartIndex = 0;\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\n                : fileDrive ? 0\n                    : undefined;\n            const pdi = patternUNC ? 3\n                : patternDrive ? 0\n                    : undefined;\n            if (typeof fdi === 'number' && typeof pdi === 'number') {\n                const [fd, pd] = [\n                    file[fdi],\n                    pattern[pdi],\n                ];\n                // start matching at the drive letter index of each\n                if (fd.toLowerCase() === pd.toLowerCase()) {\n                    pattern[pdi] = fd;\n                    patternStartIndex = pdi;\n                    fileStartIndex = fdi;\n                }\n            }\n        }\n        // resolve and reduce . and .. portions in the file as well.\n        // don't need to do the second phase, because it's only one string[]\n        const { optimizationLevel = 1 } = this.options;\n        if (optimizationLevel >= 2) {\n            file = this.levelTwoFileOptimize(file);\n        }\n        if (pattern.includes(GLOBSTAR)) {\n            return this.#matchGlobstar(file, pattern, partial, fileStartIndex, patternStartIndex);\n        }\n        return this.#matchOne(file, pattern, partial, fileStartIndex, patternStartIndex);\n    }\n    #matchGlobstar(file, pattern, partial, fileIndex, patternIndex) {\n        // split the pattern into head, tail, and middle of ** delimited parts\n        const firstgs = pattern.indexOf(GLOBSTAR, patternIndex);\n        const lastgs = pattern.lastIndexOf(GLOBSTAR);\n        // split the pattern up into globstar-delimited sections\n        // the tail has to be at the end, and the others just have\n        // to be found in order from the head.\n        const [head, body, tail] = partial ?\n            [\n                pattern.slice(patternIndex, firstgs),\n                pattern.slice(firstgs + 1),\n                [],\n            ]\n            : [\n                pattern.slice(patternIndex, firstgs),\n                pattern.slice(firstgs + 1, lastgs),\n                pattern.slice(lastgs + 1),\n            ];\n        // check the head, from the current file/pattern index.\n        if (head.length) {\n            const fileHead = file.slice(fileIndex, fileIndex + head.length);\n            if (!this.#matchOne(fileHead, head, partial, 0, 0)) {\n                return false;\n            }\n            fileIndex += head.length;\n            patternIndex += head.length;\n        }\n        // now we know the head matches!\n        // if the last portion is not empty, it MUST match the end\n        // check the tail\n        let fileTailMatch = 0;\n        if (tail.length) {\n            // if head + tail > file, then we cannot possibly match\n            if (tail.length + fileIndex > file.length)\n                return false;\n            // try to match the tail\n            let tailStart = file.length - tail.length;\n            if (this.#matchOne(file, tail, partial, tailStart, 0)) {\n                fileTailMatch = tail.length;\n            }\n            else {\n                // affordance for stuff like a/**/* matching a/b/\n                // if the last file portion is '', and there's more to the pattern\n                // then try without the '' bit.\n                if (file[file.length - 1] !== '' ||\n                    fileIndex + tail.length === file.length) {\n                    return false;\n                }\n                tailStart--;\n                if (!this.#matchOne(file, tail, partial, tailStart, 0)) {\n                    return false;\n                }\n                fileTailMatch = tail.length + 1;\n            }\n        }\n        // now we know the tail matches!\n        // the middle is zero or more portions wrapped in **, possibly\n        // containing more ** sections.\n        // so a/**/b/**/c/**/d has become **/b/**/c/**\n        // if it's empty, it means a/**/b, just verify we have no bad dots\n        // if there's no tail, so it ends on /**, then we must have *something*\n        // after the head, or it's not a matc\n        if (!body.length) {\n            let sawSome = !!fileTailMatch;\n            for (let i = fileIndex; i < file.length - fileTailMatch; i++) {\n                const f = String(file[i]);\n                sawSome = true;\n                if (f === '.' ||\n                    f === '..' ||\n                    (!this.options.dot && f.startsWith('.'))) {\n                    return false;\n                }\n            }\n            // in partial mode, we just need to get past all file parts\n            return partial || sawSome;\n        }\n        // now we know that there's one or more body sections, which can\n        // be matched anywhere from the 0 index (because the head was pruned)\n        // through to the length-fileTailMatch index.\n        // split the body up into sections, and note the minimum index it can\n        // be found at (start with the length of all previous segments)\n        // [section, before, after]\n        const bodySegments = [[[], 0]];\n        let currentBody = bodySegments[0];\n        let nonGsParts = 0;\n        const nonGsPartsSums = [0];\n        for (const b of body) {\n            if (b === GLOBSTAR) {\n                nonGsPartsSums.push(nonGsParts);\n                currentBody = [[], 0];\n                bodySegments.push(currentBody);\n            }\n            else {\n                currentBody[0].push(b);\n                nonGsParts++;\n            }\n        }\n        let i = bodySegments.length - 1;\n        const fileLength = file.length - fileTailMatch;\n        for (const b of bodySegments) {\n            b[1] = fileLength - (nonGsPartsSums[i--] + b[0].length);\n        }\n        return !!this.#matchGlobStarBodySections(file, bodySegments, fileIndex, 0, partial, 0, !!fileTailMatch);\n    }\n    // return false for \"nope, not matching\"\n    // return null for \"not matching, cannot keep trying\"\n    #matchGlobStarBodySections(file, \n    // pattern section, last possible position for it\n    bodySegments, fileIndex, bodyIndex, partial, globStarDepth, sawTail) {\n        // take the first body segment, and walk from fileIndex to its \"after\"\n        // value at the end\n        // If it doesn't match at that position, we increment, until we hit\n        // that final possible position, and give up.\n        // If it does match, then advance and try to rest.\n        // If any of them fail we keep walking forward.\n        // this is still a bit recursively painful, but it's more constrained\n        // than previous implementations, because we never test something that\n        // can't possibly be a valid matching condition.\n        const bs = bodySegments[bodyIndex];\n        if (!bs) {\n            // just make sure that there's no bad dots\n            for (let i = fileIndex; i < file.length; i++) {\n                sawTail = true;\n                const f = file[i];\n                if (f === '.' ||\n                    f === '..' ||\n                    (!this.options.dot && f.startsWith('.'))) {\n                    return false;\n                }\n            }\n            return sawTail;\n        }\n        // have a non-globstar body section to test\n        const [body, after] = bs;\n        while (fileIndex <= after) {\n            const m = this.#matchOne(file.slice(0, fileIndex + body.length), body, partial, fileIndex, 0);\n            // if limit exceeded, no match. intentional false negative,\n            // acceptable break in correctness for security.\n            if (m && globStarDepth < this.maxGlobstarRecursion) {\n                // match! see if the rest match. if so, we're done!\n                const sub = this.#matchGlobStarBodySections(file, bodySegments, fileIndex + body.length, bodyIndex + 1, partial, globStarDepth + 1, sawTail);\n                if (sub !== false) {\n                    return sub;\n                }\n            }\n            const f = file[fileIndex];\n            if (f === '.' ||\n                f === '..' ||\n                (!this.options.dot && f.startsWith('.'))) {\n                return false;\n            }\n            fileIndex++;\n        }\n        // walked off. no point continuing\n        return partial || null;\n    }\n    #matchOne(file, pattern, partial, fileIndex, patternIndex) {\n        let fi;\n        let pi;\n        let pl;\n        let fl;\n        for (fi = fileIndex,\n            pi = patternIndex,\n            fl = file.length,\n            pl = pattern.length; fi < fl && pi < pl; fi++, pi++) {\n            this.debug('matchOne loop');\n            let p = pattern[pi];\n            let 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 || p === GLOBSTAR) {\n                return false;\n            }\n            /* c8 ignore stop */\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 *.<ext>  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 ? 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 ? 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 ? star\n            : options.dot ? 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' ? regExpEscape(p)\n                    : p === GLOBSTAR ? 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            const filtered = pp.filter(p => p !== GLOBSTAR);\n            // For partial matches, we need to make the pattern match\n            // any prefix of the full path. We do this by generating\n            // alternative patterns that match progressively longer prefixes.\n            if (this.partial && filtered.length >= 1) {\n                const prefixes = [];\n                for (let i = 1; i <= filtered.length; i++) {\n                    prefixes.push(filtered.slice(0, i).join('/'));\n                }\n                return '(?:' + prefixes.join('|') + ')';\n            }\n            return filtered.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        // In partial mode, '/' should always match as it's a valid prefix for any pattern\n        if (this.partial) {\n            re = '^(?:\\\\/|' + open + re.slice(1, -1) + close + ')$';\n        }\n        // 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 {\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 (const pattern of set) {\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"],"x_google_ignoreList":[0],"mappings":";;;;;;AAKA,IAAa,aAAa,GAAG,SAAS,UAAU,CAAC,MAAM;CACnD,mBAAmB,OAAO;CAE1B,IAAI,CAAC,QAAQ,aAAa,QAAQ,OAAO,CAAC,MAAM,KAC5C,OAAO;CAEX,OAAO,IAAI,UAAU,SAAS,OAAO,CAAC,CAAC,MAAM,CAAC;AAClD;AAEA,IAAM,eAAe;AACrB,IAAM,kBAAkB,SAAS,MAAM,CAAC,EAAE,WAAW,GAAG,KAAK,EAAE,SAAS,GAAG;AAC3E,IAAM,qBAAqB,SAAS,MAAM,EAAE,SAAS,GAAG;AACxD,IAAM,wBAAwB,QAAQ;CAClC,MAAM,IAAI,YAAY;CACtB,QAAQ,MAAM,CAAC,EAAE,WAAW,GAAG,KAAK,EAAE,YAAY,CAAC,CAAC,SAAS,GAAG;AACpE;AACA,IAAM,2BAA2B,QAAQ;CACrC,MAAM,IAAI,YAAY;CACtB,QAAQ,MAAM,EAAE,YAAY,CAAC,CAAC,SAAS,GAAG;AAC9C;AACA,IAAM,gBAAgB;AACtB,IAAM,mBAAmB,MAAM,CAAC,EAAE,WAAW,GAAG,KAAK,EAAE,SAAS,GAAG;AACnE,IAAM,sBAAsB,MAAM,MAAM,OAAO,MAAM,QAAQ,EAAE,SAAS,GAAG;AAC3E,IAAM,YAAY;AAClB,IAAM,eAAe,MAAM,MAAM,OAAO,MAAM,QAAQ,EAAE,WAAW,GAAG;AACtE,IAAM,SAAS;AACf,IAAM,YAAY,MAAM,EAAE,WAAW,KAAK,CAAC,EAAE,WAAW,GAAG;AAC3D,IAAM,eAAe,MAAM,EAAE,WAAW,KAAK,MAAM,OAAO,MAAM;AAChE,IAAM,WAAW;AACjB,IAAM,oBAAoB,CAAC,IAAI,MAAM,QAAQ;CACzC,MAAM,QAAQ,gBAAgB,CAAC,EAAE,CAAC;CAClC,IAAI,CAAC,KACD,OAAO;CACX,MAAM,IAAI,YAAY;CACtB,QAAQ,MAAM,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,SAAS,GAAG;AAC1D;AACA,IAAM,uBAAuB,CAAC,IAAI,MAAM,QAAQ;CAC5C,MAAM,QAAQ,mBAAmB,CAAC,EAAE,CAAC;CACrC,IAAI,CAAC,KACD,OAAO;CACX,MAAM,IAAI,YAAY;CACtB,QAAQ,MAAM,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,SAAS,GAAG;AAC1D;AACA,IAAM,iBAAiB,CAAC,IAAI,MAAM,QAAQ;CACtC,MAAM,QAAQ,mBAAmB,CAAC,EAAE,CAAC;CACrC,OAAO,CAAC,MAAM,SAAS,MAAM,MAAM,CAAC,KAAK,EAAE,SAAS,GAAG;AAC3D;AACA,IAAM,cAAc,CAAC,IAAI,MAAM,QAAQ;CACnC,MAAM,QAAQ,gBAAgB,CAAC,EAAE,CAAC;CAClC,OAAO,CAAC,MAAM,SAAS,MAAM,MAAM,CAAC,KAAK,EAAE,SAAS,GAAG;AAC3D;AACA,IAAM,mBAAmB,CAAC,QAAQ;CAC9B,MAAM,MAAM,GAAG;CACf,QAAQ,MAAM,EAAE,WAAW,OAAO,CAAC,EAAE,WAAW,GAAG;AACvD;AACA,IAAM,sBAAsB,CAAC,QAAQ;CACjC,MAAM,MAAM,GAAG;CACf,QAAQ,MAAM,EAAE,WAAW,OAAO,MAAM,OAAO,MAAM;AACzD;;AAEA,IAAM,kBAAmB,OAAO,YAAY,YAAY,UACnD,OAAO,QAAQ,QAAQ,YACpB,QAAQ,OACR,QAAQ,IAAI,kCACZ,QAAQ,WACV;AACN,IAAM,OAAO;CACT,OAAO,EAAE,KAAK,KAAK;CACnB,OAAO,EAAE,KAAK,IAAI;AACtB;;AAEA,IAAa,MAAM,oBAAoB,UAAU,KAAK,MAAM,MAAM,KAAK,MAAM;AAC7E,UAAU,MAAM;AAChB,IAAa,WAAW,OAAO,aAAa;AAC5C,UAAU,WAAW;AAKrB,IAAM,OAAO;AAIb,IAAM,aAAa;AAGnB,IAAM,eAAe;AACrB,IAAa,UAAU,SAAS,UAAU,CAAC,OAAO,MAAM,UAAU,GAAG,SAAS,OAAO;AACrF,UAAU,SAAS;AACnB,IAAM,OAAO,GAAG,IAAI,CAAC,MAAM,OAAO,OAAO,CAAC,GAAG,GAAG,CAAC;AACjD,IAAa,YAAY,QAAQ;CAC7B,IAAI,CAAC,OAAO,OAAO,QAAQ,YAAY,CAAC,OAAO,KAAK,GAAG,CAAC,CAAC,QACrD,OAAO;CAEX,MAAM,OAAO;CACb,MAAM,KAAK,GAAG,SAAS,UAAU,CAAC,MAAM,KAAK,GAAG,SAAS,IAAI,KAAK,OAAO,CAAC;CAC1E,OAAO,OAAO,OAAO,GAAG;EACpB,WAAW,MAAM,kBAAkB,KAAK,UAAU;GAC9C,YAAY,SAAS,UAAU,CAAC,GAAG;IAC/B,MAAM,SAAS,IAAI,KAAK,OAAO,CAAC;GACpC;GACA,OAAO,SAAS,SAAS;IACrB,OAAO,KAAK,SAAS,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC;GAC5C;EACJ;EACA,KAAK,MAAM,YAAY,KAAK,IAAI;;GAE5B,YAAY,MAAM,QAAQ,UAAU,CAAC,GAAG;IACpC,MAAM,MAAM,QAAQ,IAAI,KAAK,OAAO,CAAC;GACzC;;GAEA,OAAO,SAAS,SAAS,UAAU,CAAC,GAAG;IACnC,OAAO,KAAK,IAAI,SAAS,SAAS,IAAI,KAAK,OAAO,CAAC;GACvD;EACJ;EACA,WAAW,GAAG,UAAU,CAAC,MAAM,KAAK,SAAS,GAAG,IAAI,KAAK,OAAO,CAAC;EACjE,SAAS,GAAG,UAAU,CAAC,MAAM,KAAK,OAAO,GAAG,IAAI,KAAK,OAAO,CAAC;EAC7D,SAAS,SAAS,UAAU,CAAC,MAAM,KAAK,OAAO,SAAS,IAAI,KAAK,OAAO,CAAC;EACzE,WAAW,YAAY,KAAK,SAAS,IAAI,KAAK,OAAO,CAAC;EACtD,SAAS,SAAS,UAAU,CAAC,MAAM,KAAK,OAAO,SAAS,IAAI,KAAK,OAAO,CAAC;EACzE,cAAc,SAAS,UAAU,CAAC,MAAM,KAAK,YAAY,SAAS,IAAI,KAAK,OAAO,CAAC;EACnF,QAAQ,MAAM,SAAS,UAAU,CAAC,MAAM,KAAK,MAAM,MAAM,SAAS,IAAI,KAAK,OAAO,CAAC;EACnF,KAAK,KAAK;EACA;CACd,CAAC;AACL;AACA,UAAU,WAAW;AAWrB,IAAa,eAAe,SAAS,UAAU,CAAC,MAAM;CAClD,mBAAmB,OAAO;CAG1B,IAAI,QAAQ,WAAW,CAAC,mBAAmB,KAAK,OAAO,GAEnD,OAAO,CAAC,OAAO;CAEnB,OAAO,OAAO,SAAS,EAAE,KAAK,QAAQ,eAAe,CAAC;AAC1D;AACA,UAAU,cAAc;AAYxB,IAAa,UAAU,SAAS,UAAU,CAAC,MAAM,IAAI,UAAU,SAAS,OAAO,CAAC,CAAC,OAAO;AACxF,UAAU,SAAS;AACnB,IAAa,SAAS,MAAM,SAAS,UAAU,CAAC,MAAM;CAClD,MAAM,KAAK,IAAI,UAAU,SAAS,OAAO;CACzC,OAAO,KAAK,QAAO,MAAK,GAAG,MAAM,CAAC,CAAC;CACnC,IAAI,GAAG,QAAQ,UAAU,CAAC,KAAK,QAC3B,KAAK,KAAK,OAAO;CAErB,OAAO;AACX;AACA,UAAU,QAAQ;AAElB,IAAM,YAAY;AAClB,IAAM,gBAAgB,MAAM,EAAE,QAAQ,4BAA4B,MAAM;AACxE,IAAa,YAAb,MAAuB;CACnB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,YAAY,SAAS,UAAU,CAAC,GAAG;EAC/B,mBAAmB,OAAO;EAC1B,UAAU,WAAW,CAAC;EACtB,KAAK,UAAU;EACf,KAAK,uBAAuB,QAAQ,wBAAwB;EAC5D,KAAK,UAAU;EACf,KAAK,WAAW,QAAQ,YAAY;EACpC,KAAK,YAAY,KAAK,aAAa;EAEnC,MAAM,MAAO;EACb,KAAK,uBACD,CAAC,CAAC,QAAQ,wBAAwB,QAAQ,SAAS;EACvD,IAAI,KAAK,sBACL,KAAK,UAAU,KAAK,QAAQ,QAAQ,OAAO,GAAG;EAElD,KAAK,0BAA0B,CAAC,CAAC,QAAQ;EACzC,KAAK,SAAS;EACd,KAAK,SAAS;EACd,KAAK,WAAW,CAAC,CAAC,QAAQ;EAC1B,KAAK,UAAU;EACf,KAAK,QAAQ;EACb,KAAK,UAAU,CAAC,CAAC,QAAQ;EACzB,KAAK,SAAS,CAAC,CAAC,KAAK,QAAQ;EAC7B,KAAK,qBACD,QAAQ,uBAAuB,KAAA,IAC3B,QAAQ,qBACN,CAAC,EAAE,KAAK,aAAa,KAAK;EACpC,KAAK,UAAU,CAAC;EAChB,KAAK,YAAY,CAAC;EAClB,KAAK,MAAM,CAAC;EAEZ,KAAK,KAAK;CACd;CACA,WAAW;EACP,IAAI,KAAK,QAAQ,iBAAiB,KAAK,IAAI,SAAS,GAChD,OAAO;EAEX,KAAK,MAAM,WAAW,KAAK,KACvB,KAAK,MAAM,QAAQ,SACf,IAAI,OAAO,SAAS,UAChB,OAAO;EAGnB,OAAO;CACX;CACA,MAAM,GAAG,GAAG,CAAE;CACd,OAAO;EACH,MAAM,UAAU,KAAK;EACrB,MAAM,UAAU,KAAK;EAErB,IAAI,CAAC,QAAQ,aAAa,QAAQ,OAAO,CAAC,MAAM,KAAK;GACjD,KAAK,UAAU;GACf;EACJ;EACA,IAAI,CAAC,SAAS;GACV,KAAK,QAAQ;GACb;EACJ;EAEA,KAAK,YAAY;EAEjB,KAAK,UAAU,CAAC,GAAG,IAAI,IAAI,KAAK,YAAY,CAAC,CAAC;EAC9C,IAAI,QAAQ,OAER,KAAK,SAAS,GAAG,SAAS,QAAQ,MAAM,GAAG,IAAI;EAEnD,KAAK,MAAM,KAAK,SAAS,KAAK,OAAO;EAUrC,MAAM,eAAe,KAAK,QAAQ,KAAI,MAAK,KAAK,WAAW,CAAC,CAAC;EAC7D,KAAK,YAAY,KAAK,WAAW,YAAY;EAC7C,KAAK,MAAM,KAAK,SAAS,KAAK,SAAS;EAEvC,IAAI,MAAM,KAAK,UAAU,KAAK,GAAG,GAAG,OAAO;GACvC,IAAI,KAAK,aAAa,KAAK,oBAAoB;IAE3C,MAAM,QAAQ,EAAE,OAAO,MACnB,EAAE,OAAO,OACR,EAAE,OAAO,OAAO,CAAC,UAAU,KAAK,EAAE,EAAE,MACrC,CAAC,UAAU,KAAK,EAAE,EAAE;IACxB,MAAM,UAAU,WAAW,KAAK,EAAE,EAAE;IACpC,IAAI,OACA,OAAO,CACH,GAAG,EAAE,MAAM,GAAG,CAAC,GACf,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,KAAI,OAAM,KAAK,MAAM,EAAE,CAAC,CAC1C;SAEC,IAAI,SACL,OAAO,CAAC,EAAE,IAAI,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,KAAI,OAAM,KAAK,MAAM,EAAE,CAAC,CAAC;GAE7D;GACA,OAAO,EAAE,KAAI,OAAM,KAAK,MAAM,EAAE,CAAC;EACrC,CAAC;EACD,KAAK,MAAM,KAAK,SAAS,GAAG;EAE5B,KAAK,MAAM,IAAI,QAAO,MAAK,EAAE,QAAQ,KAAK,MAAM,EAAE;EAElD,IAAI,KAAK,WACL,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;GACtC,MAAM,IAAI,KAAK,IAAI;GACnB,IAAI,EAAE,OAAO,MACT,EAAE,OAAO,MACT,KAAK,UAAU,EAAE,CAAC,OAAO,OACzB,OAAO,EAAE,OAAO,YAChB,YAAY,KAAK,EAAE,EAAE,GACrB,EAAE,KAAK;EAEf;EAEJ,KAAK,MAAM,KAAK,SAAS,KAAK,GAAG;CACrC;CAMA,WAAW,WAAW;EAElB,IAAI,KAAK,QAAQ;QACR,MAAM,WAAW,WAClB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAChC,IAAI,QAAQ,OAAO,MACf,QAAQ,KAAK;EAAA;EAK7B,MAAM,EAAE,oBAAoB,MAAM,KAAK;EACvC,IAAI,qBAAqB,GAAG;GAExB,YAAY,KAAK,qBAAqB,SAAS;GAC/C,YAAY,KAAK,sBAAsB,SAAS;EACpD,OACK,IAAI,qBAAqB,GAE1B,YAAY,KAAK,iBAAiB,SAAS;OAI3C,YAAY,KAAK,0BAA0B,SAAS;EAExD,OAAO;CACX;CAEA,0BAA0B,WAAW;EACjC,OAAO,UAAU,KAAI,UAAS;GAC1B,IAAI,KAAK;GACT,OAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,CAAC,IAAI;IAC9C,IAAI,IAAI;IACR,OAAO,MAAM,IAAI,OAAO,MACpB;IAEJ,IAAI,MAAM,IACN,MAAM,OAAO,IAAI,IAAI,EAAE;GAE/B;GACA,OAAO;EACX,CAAC;CACL;CAEA,iBAAiB,WAAW;EACxB,OAAO,UAAU,KAAI,UAAS;GAC1B,QAAQ,MAAM,QAAQ,KAAK,SAAS;IAChC,MAAM,OAAO,IAAI,IAAI,SAAS;IAC9B,IAAI,SAAS,QAAQ,SAAS,MAC1B,OAAO;IAEX,IAAI,SAAS;SACL,QAAQ,SAAS,QAAQ,SAAS,OAAO,SAAS,MAAM;MACxD,IAAI,IAAI;MACR,OAAO;KACX;;IAEJ,IAAI,KAAK,IAAI;IACb,OAAO;GACX,GAAG,CAAC,CAAC;GACL,OAAO,MAAM,WAAW,IAAI,CAAC,EAAE,IAAI;EACvC,CAAC;CACL;CACA,qBAAqB,OAAO;EACxB,IAAI,CAAC,MAAM,QAAQ,KAAK,GACpB,QAAQ,KAAK,WAAW,KAAK;EAEjC,IAAI,eAAe;EACnB,GAAG;GACC,eAAe;GAEf,IAAI,CAAC,KAAK,yBAAyB;IAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK;KACvC,MAAM,IAAI,MAAM;KAEhB,IAAI,MAAM,KAAK,MAAM,MAAM,MAAM,OAAO,IACpC;KACJ,IAAI,MAAM,OAAO,MAAM,IAAI;MACvB,eAAe;MACf,MAAM,OAAO,GAAG,CAAC;MACjB;KACJ;IACJ;IACA,IAAI,MAAM,OAAO,OACb,MAAM,WAAW,MAChB,MAAM,OAAO,OAAO,MAAM,OAAO,KAAK;KACvC,eAAe;KACf,MAAM,IAAI;IACd;GACJ;GAEA,IAAI,KAAK;GACT,OAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,CAAC,IAAI;IAC9C,MAAM,IAAI,MAAM,KAAK;IACrB,IAAI,KACA,MAAM,OACN,MAAM,QACN,MAAM,QACN,EAAE,KAAK,aAAa,YAAY,KAAK,CAAC,IAAI;KAC1C,eAAe;KACf,MAAM,OAAO,KAAK,GAAG,CAAC;KACtB,MAAM;IACV;GACJ;EACJ,SAAS;EACT,OAAO,MAAM,WAAW,IAAI,CAAC,EAAE,IAAI;CACvC;CAmBA,qBAAqB,WAAW;EAC5B,IAAI,eAAe;EACnB,GAAG;GACC,eAAe;GAEf,KAAK,IAAI,SAAS,WAAW;IACzB,IAAI,KAAK;IACT,OAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,CAAC,IAAI;KAC9C,IAAI,MAAM;KACV,OAAO,MAAM,MAAM,OAAO,MAEtB;KAIJ,IAAI,MAAM,IACN,MAAM,OAAO,KAAK,GAAG,MAAM,EAAE;KAEjC,IAAI,OAAO,MAAM,KAAK;KACtB,MAAM,IAAI,MAAM,KAAK;KACrB,MAAM,KAAK,MAAM,KAAK;KACtB,IAAI,SAAS,MACT;KACJ,IAAI,CAAC,KACD,MAAM,OACN,MAAM,QACN,CAAC,MACD,OAAO,OACP,OAAO,MACP;KAEJ,eAAe;KAEf,MAAM,OAAO,IAAI,CAAC;KAClB,MAAM,QAAQ,MAAM,MAAM,CAAC;KAC3B,MAAM,MAAM;KACZ,UAAU,KAAK,KAAK;KACpB;IACJ;IAEA,IAAI,CAAC,KAAK,yBAAyB;KAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK;MACvC,MAAM,IAAI,MAAM;MAEhB,IAAI,MAAM,KAAK,MAAM,MAAM,MAAM,OAAO,IACpC;MACJ,IAAI,MAAM,OAAO,MAAM,IAAI;OACvB,eAAe;OACf,MAAM,OAAO,GAAG,CAAC;OACjB;MACJ;KACJ;KACA,IAAI,MAAM,OAAO,OACb,MAAM,WAAW,MAChB,MAAM,OAAO,OAAO,MAAM,OAAO,KAAK;MACvC,eAAe;MACf,MAAM,IAAI;KACd;IACJ;IAEA,IAAI,KAAK;IACT,OAAO,QAAQ,KAAK,MAAM,QAAQ,MAAM,KAAK,CAAC,IAAI;KAC9C,MAAM,IAAI,MAAM,KAAK;KACrB,IAAI,KAAK,MAAM,OAAO,MAAM,QAAQ,MAAM,MAAM;MAC5C,eAAe;MAEf,MAAM,QADU,OAAO,KAAK,MAAM,KAAK,OAAO,OACtB,CAAC,GAAG,IAAI,CAAC;MACjC,MAAM,OAAO,KAAK,GAAG,GAAG,GAAG,KAAK;MAChC,IAAI,MAAM,WAAW,GACjB,MAAM,KAAK,EAAE;MACjB,MAAM;KACV;IACJ;GACJ;EACJ,SAAS;EACT,OAAO;CACX;CAQA,sBAAsB,WAAW;EAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,SAAS,GAAG,KACtC,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;GAC3C,MAAM,UAAU,KAAK,WAAW,UAAU,IAAI,UAAU,IAAI,CAAC,KAAK,uBAAuB;GACzF,IAAI,SAAS;IACT,UAAU,KAAK,CAAC;IAChB,UAAU,KAAK;IACf;GACJ;EACJ;EAEJ,OAAO,UAAU,QAAO,OAAM,GAAG,MAAM;CAC3C;CACA,WAAW,GAAG,GAAG,eAAe,OAAO;EACnC,IAAI,KAAK;EACT,IAAI,KAAK;EACT,IAAI,SAAS,CAAC;EACd,IAAI,QAAQ;EACZ,OAAO,KAAK,EAAE,UAAU,KAAK,EAAE,QAC3B,IAAI,EAAE,QAAQ,EAAE,KAAK;GACjB,OAAO,KAAK,UAAU,MAAM,EAAE,MAAM,EAAE,GAAG;GACzC;GACA;EACJ,OACK,IAAI,gBAAgB,EAAE,QAAQ,QAAQ,EAAE,QAAQ,EAAE,KAAK,IAAI;GAC5D,OAAO,KAAK,EAAE,GAAG;GACjB;EACJ,OACK,IAAI,gBAAgB,EAAE,QAAQ,QAAQ,EAAE,QAAQ,EAAE,KAAK,IAAI;GAC5D,OAAO,KAAK,EAAE,GAAG;GACjB;EACJ,OACK,IAAI,EAAE,QAAQ,OACf,EAAE,QACD,KAAK,QAAQ,OAAO,CAAC,EAAE,GAAG,CAAC,WAAW,GAAG,MAC1C,EAAE,QAAQ,MAAM;GAChB,IAAI,UAAU,KACV,OAAO;GACX,QAAQ;GACR,OAAO,KAAK,EAAE,GAAG;GACjB;GACA;EACJ,OACK,IAAI,EAAE,QAAQ,OACf,EAAE,QACD,KAAK,QAAQ,OAAO,CAAC,EAAE,GAAG,CAAC,WAAW,GAAG,MAC1C,EAAE,QAAQ,MAAM;GAChB,IAAI,UAAU,KACV,OAAO;GACX,QAAQ;GACR,OAAO,KAAK,EAAE,GAAG;GACjB;GACA;EACJ,OAEI,OAAO;EAKf,OAAO,EAAE,WAAW,EAAE,UAAU;CACpC;CACA,cAAc;EACV,IAAI,KAAK,UACL;EACJ,MAAM,UAAU,KAAK;EACrB,IAAI,SAAS;EACb,IAAI,eAAe;EACnB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,UAAU,QAAQ,OAAO,CAAC,MAAM,KAAK,KAAK;GAClE,SAAS,CAAC;GACV;EACJ;EACA,IAAI,cACA,KAAK,UAAU,QAAQ,MAAM,YAAY;EAC7C,KAAK,SAAS;CAClB;CAMA,SAAS,MAAM,SAAS,UAAU,OAAO;EACrC,IAAI,iBAAiB;EACrB,IAAI,oBAAoB;EAIxB,IAAI,KAAK,WAAW;GAChB,MAAM,YAAY,OAAO,KAAK,OAAO,YAAY,YAAY,KAAK,KAAK,EAAE;GACzE,MAAM,UAAU,CAAC,aACb,KAAK,OAAO,MACZ,KAAK,OAAO,MACZ,KAAK,OAAO,OACZ,YAAY,KAAK,KAAK,EAAE;GAC5B,MAAM,eAAe,OAAO,QAAQ,OAAO,YAAY,YAAY,KAAK,QAAQ,EAAE;GAClF,MAAM,aAAa,CAAC,gBAChB,QAAQ,OAAO,MACf,QAAQ,OAAO,MACf,QAAQ,OAAO,OACf,OAAO,QAAQ,OAAO,YACtB,YAAY,KAAK,QAAQ,EAAE;GAC/B,MAAM,MAAM,UAAU,IAChB,YAAY,IACR,KAAA;GACV,MAAM,MAAM,aAAa,IACnB,eAAe,IACX,KAAA;GACV,IAAI,OAAO,QAAQ,YAAY,OAAO,QAAQ,UAAU;IACpD,MAAM,CAAC,IAAI,MAAM,CACb,KAAK,MACL,QAAQ,IACZ;IAEA,IAAI,GAAG,YAAY,MAAM,GAAG,YAAY,GAAG;KACvC,QAAQ,OAAO;KACf,oBAAoB;KACpB,iBAAiB;IACrB;GACJ;EACJ;EAGA,MAAM,EAAE,oBAAoB,MAAM,KAAK;EACvC,IAAI,qBAAqB,GACrB,OAAO,KAAK,qBAAqB,IAAI;EAEzC,IAAI,QAAQ,SAAS,QAAQ,GACzB,OAAO,KAAKA,eAAe,MAAM,SAAS,SAAS,gBAAgB,iBAAiB;EAExF,OAAO,KAAKC,UAAU,MAAM,SAAS,SAAS,gBAAgB,iBAAiB;CACnF;CACA,eAAe,MAAM,SAAS,SAAS,WAAW,cAAc;EAE5D,MAAM,UAAU,QAAQ,QAAQ,UAAU,YAAY;EACtD,MAAM,SAAS,QAAQ,YAAY,QAAQ;EAI3C,MAAM,CAAC,MAAM,MAAM,QAAQ,UACvB;GACI,QAAQ,MAAM,cAAc,OAAO;GACnC,QAAQ,MAAM,UAAU,CAAC;GACzB,CAAC;EACL,IACE;GACE,QAAQ,MAAM,cAAc,OAAO;GACnC,QAAQ,MAAM,UAAU,GAAG,MAAM;GACjC,QAAQ,MAAM,SAAS,CAAC;EAC5B;EAEJ,IAAI,KAAK,QAAQ;GACb,MAAM,WAAW,KAAK,MAAM,WAAW,YAAY,KAAK,MAAM;GAC9D,IAAI,CAAC,KAAKA,UAAU,UAAU,MAAM,SAAS,GAAG,CAAC,GAC7C,OAAO;GAEX,aAAa,KAAK;GAClB,gBAAgB,KAAK;EACzB;EAIA,IAAI,gBAAgB;EACpB,IAAI,KAAK,QAAQ;GAEb,IAAI,KAAK,SAAS,YAAY,KAAK,QAC/B,OAAO;GAEX,IAAI,YAAY,KAAK,SAAS,KAAK;GACnC,IAAI,KAAKA,UAAU,MAAM,MAAM,SAAS,WAAW,CAAC,GAChD,gBAAgB,KAAK;QAEpB;IAID,IAAI,KAAK,KAAK,SAAS,OAAO,MAC1B,YAAY,KAAK,WAAW,KAAK,QACjC,OAAO;IAEX;IACA,IAAI,CAAC,KAAKA,UAAU,MAAM,MAAM,SAAS,WAAW,CAAC,GACjD,OAAO;IAEX,gBAAgB,KAAK,SAAS;GAClC;EACJ;EAQA,IAAI,CAAC,KAAK,QAAQ;GACd,IAAI,UAAU,CAAC,CAAC;GAChB,KAAK,IAAI,IAAI,WAAW,IAAI,KAAK,SAAS,eAAe,KAAK;IAC1D,MAAM,IAAI,OAAO,KAAK,EAAE;IACxB,UAAU;IACV,IAAI,MAAM,OACN,MAAM,QACL,CAAC,KAAK,QAAQ,OAAO,EAAE,WAAW,GAAG,GACtC,OAAO;GAEf;GAEA,OAAO,WAAW;EACtB;EAOA,MAAM,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;EAC7B,IAAI,cAAc,aAAa;EAC/B,IAAI,aAAa;EACjB,MAAM,iBAAiB,CAAC,CAAC;EACzB,KAAK,MAAM,KAAK,MACZ,IAAI,MAAM,UAAU;GAChB,eAAe,KAAK,UAAU;GAC9B,cAAc,CAAC,CAAC,GAAG,CAAC;GACpB,aAAa,KAAK,WAAW;EACjC,OACK;GACD,YAAY,EAAE,CAAC,KAAK,CAAC;GACrB;EACJ;EAEJ,IAAI,IAAI,aAAa,SAAS;EAC9B,MAAM,aAAa,KAAK,SAAS;EACjC,KAAK,MAAM,KAAK,cACZ,EAAE,KAAK,cAAc,eAAe,OAAO,EAAE,EAAE,CAAC;EAEpD,OAAO,CAAC,CAAC,KAAKC,2BAA2B,MAAM,cAAc,WAAW,GAAG,SAAS,GAAG,CAAC,CAAC,aAAa;CAC1G;CAGA,2BAA2B,MAE3B,cAAc,WAAW,WAAW,SAAS,eAAe,SAAS;EAUjE,MAAM,KAAK,aAAa;EACxB,IAAI,CAAC,IAAI;GAEL,KAAK,IAAI,IAAI,WAAW,IAAI,KAAK,QAAQ,KAAK;IAC1C,UAAU;IACV,MAAM,IAAI,KAAK;IACf,IAAI,MAAM,OACN,MAAM,QACL,CAAC,KAAK,QAAQ,OAAO,EAAE,WAAW,GAAG,GACtC,OAAO;GAEf;GACA,OAAO;EACX;EAEA,MAAM,CAAC,MAAM,SAAS;EACtB,OAAO,aAAa,OAAO;GAIvB,IAHU,KAAKD,UAAU,KAAK,MAAM,GAAG,YAAY,KAAK,MAAM,GAAG,MAAM,SAAS,WAAW,CAGvF,KAAK,gBAAgB,KAAK,sBAAsB;IAEhD,MAAM,MAAM,KAAKC,2BAA2B,MAAM,cAAc,YAAY,KAAK,QAAQ,YAAY,GAAG,SAAS,gBAAgB,GAAG,OAAO;IAC3I,IAAI,QAAQ,OACR,OAAO;GAEf;GACA,MAAM,IAAI,KAAK;GACf,IAAI,MAAM,OACN,MAAM,QACL,CAAC,KAAK,QAAQ,OAAO,EAAE,WAAW,GAAG,GACtC,OAAO;GAEX;EACJ;EAEA,OAAO,WAAW;CACtB;CACA,UAAU,MAAM,SAAS,SAAS,WAAW,cAAc;EACvD,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,KAAK,KAAK,WACN,KAAK,cACL,KAAK,KAAK,QACV,KAAK,QAAQ,QAAQ,KAAK,MAAM,KAAK,IAAI,MAAM,MAAM;GACrD,KAAK,MAAM,eAAe;GAC1B,IAAI,IAAI,QAAQ;GAChB,IAAI,IAAI,KAAK;GACb,KAAK,MAAM,SAAS,GAAG,CAAC;;GAIxB,IAAI,MAAM,SAAS,MAAM,UACrB,OAAO;;GAMX,IAAI;GACJ,IAAI,OAAO,MAAM,UAAU;IACvB,MAAM,MAAM;IACZ,KAAK,MAAM,gBAAgB,GAAG,GAAG,GAAG;GACxC,OACK;IACD,MAAM,EAAE,KAAK,CAAC;IACd,KAAK,MAAM,iBAAiB,GAAG,GAAG,GAAG;GACzC;GACA,IAAI,CAAC,KACD,OAAO;EACf;EAYA,IAAI,OAAO,MAAM,OAAO,IAGpB,OAAO;OAEN,IAAI,OAAO,IAIZ,OAAO;OAEN,IAAI,OAAO,IAKZ,OAAO,OAAO,KAAK,KAAK,KAAK,QAAQ;OAKrC,MAAM,IAAI,MAAM,MAAM;;CAG9B;CACA,cAAc;EACV,OAAO,YAAY,KAAK,SAAS,KAAK,OAAO;CACjD;CACA,MAAM,SAAS;EACX,mBAAmB,OAAO;EAC1B,MAAM,UAAU,KAAK;EAErB,IAAI,YAAY,MACZ,OAAO;EACX,IAAI,YAAY,IACZ,OAAO;EAGX,IAAI;EACJ,IAAI,WAAW;EACf,IAAK,IAAI,QAAQ,MAAM,MAAM,GACzB,WAAW,QAAQ,MAAM,cAAc;OAEtC,IAAK,IAAI,QAAQ,MAAM,YAAY,GACpC,YAAY,QAAQ,SAChB,QAAQ,MACJ,0BACE,uBACJ,QAAQ,MAAM,oBACV,eAAA,CAAgB,EAAE,EAAE;OAE7B,IAAK,IAAI,QAAQ,MAAM,QAAQ,GAChC,YAAY,QAAQ,SAChB,QAAQ,MACJ,sBACE,mBACJ,QAAQ,MAAM,gBACV,WAAA,CAAY,CAAC;OAEtB,IAAK,IAAI,QAAQ,MAAM,aAAa,GACrC,WAAW,QAAQ,MAAM,qBAAqB;OAE7C,IAAK,IAAI,QAAQ,MAAM,SAAS,GACjC,WAAW;EAEf,MAAM,KAAK,IAAI,SAAS,SAAS,KAAK,OAAO,CAAC,CAAC,YAAY;EAC3D,IAAI,YAAY,OAAO,OAAO,UAE1B,QAAQ,eAAe,IAAI,QAAQ,EAAE,OAAO,SAAS,CAAC;EAE1D,OAAO;CACX;CACA,SAAS;EACL,IAAI,KAAK,UAAU,KAAK,WAAW,OAC/B,OAAO,KAAK;EAOhB,MAAM,MAAM,KAAK;EACjB,IAAI,CAAC,IAAI,QAAQ;GACb,KAAK,SAAS;GACd,OAAO,KAAK;EAChB;EACA,MAAM,UAAU,KAAK;EACrB,MAAM,UAAU,QAAQ,aAAa,OAC/B,QAAQ,MAAM,aACV;EACV,MAAM,QAAQ,IAAI,IAAI,QAAQ,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC;EAOjD,IAAI,KAAK,IACJ,KAAI,YAAW;GAChB,MAAM,KAAK,QAAQ,KAAI,MAAK;IACxB,IAAI,aAAa,QACb,KAAK,MAAM,KAAK,EAAE,MAAM,MAAM,EAAE,GAC5B,MAAM,IAAI,CAAC;IAEnB,OAAQ,OAAO,MAAM,WAAW,aAAa,CAAC,IACxC,MAAM,WAAW,WACb,EAAE;GAChB,CAAC;GACD,GAAG,SAAS,GAAG,MAAM;IACjB,MAAM,OAAO,GAAG,IAAI;IACpB,MAAM,OAAO,GAAG,IAAI;IACpB,IAAI,MAAM,YAAY,SAAS,UAC3B;IAEJ,IAAI,SAAS,KAAA,GACT,IAAI,SAAS,KAAA,KAAa,SAAS,UAC/B,GAAG,IAAI,KAAK,YAAY,UAAU,UAAU;SAG5C,GAAG,KAAK;SAGX,IAAI,SAAS,KAAA,GACd,GAAG,IAAI,KAAK,OAAO,eAAe,UAAU;SAE3C,IAAI,SAAS,UAAU;KACxB,GAAG,IAAI,KAAK,OAAO,eAAe,UAAU,SAAS;KACrD,GAAG,IAAI,KAAK;IAChB;GACJ,CAAC;GACD,MAAM,WAAW,GAAG,QAAO,MAAK,MAAM,QAAQ;GAI9C,IAAI,KAAK,WAAW,SAAS,UAAU,GAAG;IACtC,MAAM,WAAW,CAAC;IAClB,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS,QAAQ,KAClC,SAAS,KAAK,SAAS,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC;IAEhD,OAAO,QAAQ,SAAS,KAAK,GAAG,IAAI;GACxC;GACA,OAAO,SAAS,KAAK,GAAG;EAC5B,CAAC,CAAC,CACG,KAAK,GAAG;EAGb,MAAM,CAAC,MAAM,SAAS,IAAI,SAAS,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE;EAG7D,KAAK,MAAM,OAAO,KAAK,QAAQ;EAE/B,IAAI,KAAK,SACL,KAAK,aAAa,OAAO,GAAG,MAAM,GAAG,EAAE,IAAI,QAAQ;EAGvD,IAAI,KAAK,QACL,KAAK,SAAS,KAAK;EACvB,IAAI;GACA,KAAK,SAAS,IAAI,OAAO,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;EAEpD,QACM;GAEF,KAAK,SAAS;EAClB;;EAEA,OAAO,KAAK;CAChB;CACA,WAAW,GAAG;EAKV,IAAI,KAAK,yBACL,OAAO,EAAE,MAAM,GAAG;OAEjB,IAAI,KAAK,aAAa,aAAa,KAAK,CAAC,GAE1C,OAAO,CAAC,IAAI,GAAG,EAAE,MAAM,KAAK,CAAC;OAG7B,OAAO,EAAE,MAAM,KAAK;CAE5B;CACA,MAAM,GAAG,UAAU,KAAK,SAAS;EAC7B,KAAK,MAAM,SAAS,GAAG,KAAK,OAAO;EAGnC,IAAI,KAAK,SACL,OAAO;EAEX,IAAI,KAAK,OACL,OAAO,MAAM;EAEjB,IAAI,MAAM,OAAO,SACb,OAAO;EAEX,MAAM,UAAU,KAAK;EAErB,IAAI,KAAK,WACL,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC,KAAK,GAAG;EAG9B,MAAM,KAAK,KAAK,WAAW,CAAC;EAC5B,KAAK,MAAM,KAAK,SAAS,SAAS,EAAE;EAKpC,MAAM,MAAM,KAAK;EACjB,KAAK,MAAM,KAAK,SAAS,OAAO,GAAG;EAEnC,IAAI,WAAW,GAAG,GAAG,SAAS;EAC9B,IAAI,CAAC,UACD,KAAK,IAAI,IAAI,GAAG,SAAS,GAAG,CAAC,YAAY,KAAK,GAAG,KAC7C,WAAW,GAAG;EAGtB,KAAK,MAAM,WAAW,KAAK;GACvB,IAAI,OAAO;GACX,IAAI,QAAQ,aAAa,QAAQ,WAAW,GACxC,OAAO,CAAC,QAAQ;GAGpB,IADY,KAAK,SAAS,MAAM,SAAS,OACnC,GAAG;IACL,IAAI,QAAQ,YACR,OAAO;IAEX,OAAO,CAAC,KAAK;GACjB;EACJ;EAGA,IAAI,QAAQ,YACR,OAAO;EAEX,OAAO,KAAK;CAChB;CACA,OAAO,SAAS,KAAK;EACjB,OAAO,UAAU,SAAS,GAAG,CAAC,CAAC;CACnC;AACJ;;AAMA,UAAU,MAAM;AAChB,UAAU,YAAY;AACtB,UAAU,SAAS;AACnB,UAAU,WAAW"}

package/dist/node_modules/.pnpm/{minimatch@10.2.5 → minimatch@10.2.6}/node_modules/minimatch/dist/esm/unescape.js

@@ -1,4 +1,4 @@
-//#region ../../node_modules/.pnpm/minimatch@10.2.5/node_modules/minimatch/dist/esm/unescape.js
+//#region ../../node_modules/.pnpm/minimatch@10.2.6/node_modules/minimatch/dist/esm/unescape.js
 /**
 * Un-escape a string that has been escaped with {@link escape}.
 *

package/dist/node_modules/.pnpm/{minimatch@10.2.5 → minimatch@10.2.6}/node_modules/minimatch/dist/esm/unescape.js.map

@@ -1 +1 @@
-{"version":3,"file":"unescape.js","names":[],"sources":["../../../../../../../../../../node_modules/.pnpm/minimatch@10.2.5/node_modules/minimatch/dist/esm/unescape.js"],"sourcesContent":["/**\n * Un-escape a string that has been escaped with {@link escape}.\n *\n * If the {@link MinimatchOptions.windowsPathsNoEscape} option is used, then\n * square-bracket escapes are removed, but not backslash escapes.\n *\n * For example, it will turn the string `'[*]'` into `*`, but it will not\n * turn `'\\\\*'` into `'*'`, because `\\` is a path separator in\n * `windowsPathsNoEscape` mode.\n *\n * When `windowsPathsNoEscape` is not set, then both square-bracket escapes and\n * backslash escapes are removed.\n *\n * Slashes (and backslashes in `windowsPathsNoEscape` mode) cannot be escaped\n * or unescaped.\n *\n * When `magicalBraces` is not set, escapes of braces (`{` and `}`) will not be\n * unescaped.\n */\nexport const unescape = (s, { windowsPathsNoEscape = false, magicalBraces = true, } = {}) => {\n    if (magicalBraces) {\n        return windowsPathsNoEscape ?\n            s.replace(/\\[([^/\\\\])\\]/g, '$1')\n            : s\n                .replace(/((?!\\\\).|^)\\[([^/\\\\])\\]/g, '$1$2')\n                .replace(/\\\\([^/])/g, '$1');\n    }\n    return windowsPathsNoEscape ?\n        s.replace(/\\[([^/\\\\{}])\\]/g, '$1')\n        : s\n            .replace(/((?!\\\\).|^)\\[([^/\\\\{}])\\]/g, '$1$2')\n            .replace(/\\\\([^/{}])/g, '$1');\n};\n//# sourceMappingURL=unescape.js.map"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;;;;AAmBA,IAAa,YAAY,GAAG,EAAE,uBAAuB,OAAO,gBAAgB,SAAU,CAAC,MAAM;CACzF,IAAI,eACA,OAAO,uBACH,EAAE,QAAQ,iBAAiB,IAAI,IAC7B,EACG,QAAQ,4BAA4B,MAAM,CAAC,CAC3C,QAAQ,aAAa,IAAI;CAEtC,OAAO,uBACH,EAAE,QAAQ,mBAAmB,IAAI,IAC/B,EACG,QAAQ,8BAA8B,MAAM,CAAC,CAC7C,QAAQ,eAAe,IAAI;AACxC"}
+{"version":3,"file":"unescape.js","names":[],"sources":["../../../../../../../../../../node_modules/.pnpm/minimatch@10.2.6/node_modules/minimatch/dist/esm/unescape.js"],"sourcesContent":["/**\n * Un-escape a string that has been escaped with {@link escape}.\n *\n * If the {@link MinimatchOptions.windowsPathsNoEscape} option is used, then\n * square-bracket escapes are removed, but not backslash escapes.\n *\n * For example, it will turn the string `'[*]'` into `*`, but it will not\n * turn `'\\\\*'` into `'*'`, because `\\` is a path separator in\n * `windowsPathsNoEscape` mode.\n *\n * When `windowsPathsNoEscape` is not set, then both square-bracket escapes and\n * backslash escapes are removed.\n *\n * Slashes (and backslashes in `windowsPathsNoEscape` mode) cannot be escaped\n * or unescaped.\n *\n * When `magicalBraces` is not set, escapes of braces (`{` and `}`) will not be\n * unescaped.\n */\nexport const unescape = (s, { windowsPathsNoEscape = false, magicalBraces = true, } = {}) => {\n    if (magicalBraces) {\n        return windowsPathsNoEscape ?\n            s.replace(/\\[([^/\\\\])\\]/g, '$1')\n            : s\n                .replace(/((?!\\\\).|^)\\[([^/\\\\])\\]/g, '$1$2')\n                .replace(/\\\\([^/])/g, '$1');\n    }\n    return windowsPathsNoEscape ?\n        s.replace(/\\[([^/\\\\{}])\\]/g, '$1')\n        : s\n            .replace(/((?!\\\\).|^)\\[([^/\\\\{}])\\]/g, '$1$2')\n            .replace(/\\\\([^/{}])/g, '$1');\n};\n//# sourceMappingURL=unescape.js.map"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;;;;AAmBA,IAAa,YAAY,GAAG,EAAE,uBAAuB,OAAO,gBAAgB,SAAU,CAAC,MAAM;CACzF,IAAI,eACA,OAAO,uBACH,EAAE,QAAQ,iBAAiB,IAAI,IAC7B,EACG,QAAQ,4BAA4B,MAAM,CAAC,CAC3C,QAAQ,aAAa,IAAI;CAEtC,OAAO,uBACH,EAAE,QAAQ,mBAAmB,IAAI,IAC/B,EACG,QAAQ,8BAA8B,MAAM,CAAC,CAC7C,QAAQ,eAAe,IAAI;AACxC"}

package/dist/registry/db-cache-key.d.ts

@@ -0,0 +1,47 @@
+/**
+ * Stable cache identity for the collection cache's `db` option (#2306).
+ *
+ * `ObjectRegistry.getCollection()` derives its cache key partly from
+ * `options.db`, which accepts all three `DatabaseConfig` shapes. Real
+ * `DatabaseInterface` instances are keyed by object identity (issue #384),
+ * string URLs by value, but plain config objects used to fall into the
+ * identity path too — so semantically equivalent fresh `{ type, url }`
+ * objects missed the cache entirely and churned the LRU with duplicate
+ * initialization work.
+ *
+ * This module derives a stable, value-based key for config objects:
+ *
+ * - Real instances (anything with a callable `query()`) keep identity keys.
+ * - `:memory:` databases stay per-instance isolated — two in-memory
+ *   databases that share the URL string are different databases, so sharing
+ *   a cached collection between them would be a correctness bug.
+ * - The key derives from the *bounded* PostgreSQL URL
+ *   (`applyPostgresRuntimeTimeouts`, #2377) so two configs that differ only
+ *   in runtime timeouts — and therefore in the pool `resolveDatabase()`
+ *   would hand the collection — cannot collide in the cache.
+ * - `authToken` participates through a SHA-256 digest, never as cleartext:
+ *   cache keys are not credentials storage, and a leaked log line must not
+ *   carry a bearer token. URL-embedded credentials (`postgres://user:pass@…`)
+ *   get the same treatment: the userinfo is replaced by a digest so the key
+ *   stays deterministic without carrying a password.
+ * - Remaining properties are canonicalized deterministically: sorted keys,
+ *   nested containers recursed, and every string value runs through the
+ *   same URL-credential redaction (not just `url`) so a
+ *   `connectionString`-style option cannot smuggle a password into the
+ *   key; opaque values (functions, symbols, bigints, non-plain objects
+ *   such as pre-created `client` handles) are reduced to a
+ *   reference-identity digest so property order and identity noise cannot
+ *   split equivalent configs — while two distinct live objects can never
+ *   merge into one cache entry.
+ *
+ * @see https://github.com/happyvertical/smrt/issues/2306
+ * @packageDocumentation
+ */
+/**
+ * Resolve the collection-cache key fragment for a `db` option value.
+ *
+ * Returns `undefined` for a missing db, matching the historical shape of the
+ * cache key (absent db serializes as `null` in the JSON part of the key).
+ */
+export declare function resolveCollectionDbCacheKey(db: unknown): string | undefined;
+//# sourceMappingURL=db-cache-key.d.ts.map

package/dist/registry/db-cache-key.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"db-cache-key.d.ts","sourceRoot":"","sources":["../../src/registry/db-cache-key.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AAqMH;;;;;GAKG;AACH,wBAAgB,2BAA2B,CAAC,EAAE,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS,CA2E3E"}

package/dist/registry/db-cache-key.js

@@ -0,0 +1,201 @@
+import { applyPostgresRuntimeTimeouts } from "../postgres-timeouts.js";
+import { getDbInstanceIds, getNextDbId, setNextDbId } from "./shared-state.js";
+import { isDatabaseInterface } from "../database.js";
+import { createHash } from "node:crypto";
+//#region src/registry/db-cache-key.ts
+/**
+* Stable cache identity for the collection cache's `db` option (#2306).
+*
+* `ObjectRegistry.getCollection()` derives its cache key partly from
+* `options.db`, which accepts all three `DatabaseConfig` shapes. Real
+* `DatabaseInterface` instances are keyed by object identity (issue #384),
+* string URLs by value, but plain config objects used to fall into the
+* identity path too — so semantically equivalent fresh `{ type, url }`
+* objects missed the cache entirely and churned the LRU with duplicate
+* initialization work.
+*
+* This module derives a stable, value-based key for config objects:
+*
+* - Real instances (anything with a callable `query()`) keep identity keys.
+* - `:memory:` databases stay per-instance isolated — two in-memory
+*   databases that share the URL string are different databases, so sharing
+*   a cached collection between them would be a correctness bug.
+* - The key derives from the *bounded* PostgreSQL URL
+*   (`applyPostgresRuntimeTimeouts`, #2377) so two configs that differ only
+*   in runtime timeouts — and therefore in the pool `resolveDatabase()`
+*   would hand the collection — cannot collide in the cache.
+* - `authToken` participates through a SHA-256 digest, never as cleartext:
+*   cache keys are not credentials storage, and a leaked log line must not
+*   carry a bearer token. URL-embedded credentials (`postgres://user:pass@…`)
+*   get the same treatment: the userinfo is replaced by a digest so the key
+*   stays deterministic without carrying a password.
+* - Remaining properties are canonicalized deterministically: sorted keys,
+*   nested containers recursed, and every string value runs through the
+*   same URL-credential redaction (not just `url`) so a
+*   `connectionString`-style option cannot smuggle a password into the
+*   key; opaque values (functions, symbols, bigints, non-plain objects
+*   such as pre-created `client` handles) are reduced to a
+*   reference-identity digest so property order and identity noise cannot
+*   split equivalent configs — while two distinct live objects can never
+*   merge into one cache entry.
+*
+* @see https://github.com/happyvertical/smrt/issues/2306
+* @packageDocumentation
+*/
+/** Secret-ish values hashed into the key instead of embedded in it. */
+var HASHED_DB_KEYS = /* @__PURE__ */ new Set(["authToken"]);
+/**
+* Reference-identity registry for opaque callable options. Two calls passing
+* the SAME function share one cache scope; two distinct functions — even
+* with identical source text, since `String(fn)` cannot tell them apart —
+* stay separate. The conservative direction: an adapter-specific callback
+* may close over state the collection initialization observes, so a value
+* key that merged distinct functions would be a correctness risk, while
+* splitting them only costs a cache entry.
+*/
+var opaqueFunctionIds = /* @__PURE__ */ new WeakMap();
+var nextOpaqueFunctionId = 1;
+/**
+* Reference-identity registry for opaque non-plain objects (PR #2922
+* review). A pre-created adapter `client` (e.g. a pg `Pool` passed through
+* a config object, `class.ts` Format 3) typically exposes its API on the
+* prototype with few or no own enumerable keys — canonicalizing it as a
+* plain record would reduce two distinct clients to the same `{}` and hand
+* both configs a collection bound to the wrong client. Non-plain objects
+* therefore key by reference: the same handle shares the entry, distinct
+* handles never merge (splitting only costs a cache entry).
+*/
+var opaqueObjectIds = /* @__PURE__ */ new WeakMap();
+var nextOpaqueObjectId = 1;
+/**
+* True for values safe to canonicalize by structure: plain records
+* (`{...}`, `Object.create(null)`) and arrays. Class instances, Maps,
+* Sets, and other builtins carry behavior/identity on the prototype and
+* must not be flattened to their enumerable keys.
+*/
+function isPlainStructure(value) {
+	if (Array.isArray(value)) return true;
+	const proto = Object.getPrototypeOf(value);
+	return proto === Object.prototype || proto === null;
+}
+/**
+* Reference-identity key fragment for opaque non-plain objects (see
+* {@link opaqueObjectIds}).
+*/
+function objectIdentityDigest(value) {
+	let id = opaqueObjectIds.get(value);
+	if (id === void 0) {
+		id = nextOpaqueObjectId++;
+		opaqueObjectIds.set(value, id);
+	}
+	return `objref:${id}`;
+}
+/**
+* Redact URL-embedded credentials (PR #2922 review). A PostgreSQL URL such
+* as `postgres://user:secret@host/db` would otherwise land verbatim in the
+* cache key, contradicting this module's contract that keys never carry
+* secrets. The userinfo is replaced by a truncated SHA-256 digest:
+* deterministic (equal credentials → equal keys), distinguishing
+* (different credentials → different keys), and irreversible.
+* Non-URL strings (file paths, `:memory:`) pass through untouched.
+*/
+function redactUrlCredentials(url) {
+	let parsed;
+	try {
+		parsed = new URL(url);
+	} catch {
+		return url;
+	}
+	if (!parsed.username && !parsed.password) return url;
+	const fingerprint = createHash("sha256").update(`${parsed.username}:${parsed.password}`).digest("hex").slice(0, 32);
+	parsed.username = `cred-${fingerprint}`;
+	parsed.password = "";
+	return parsed.toString();
+}
+/**
+* Render an opaque value (symbol, bigint, over-deep object) as a stable
+* textual digest. Distinct-but-textually-identical symbols remain possible
+* here; symbols as database options are vanishingly rare and the collision
+* only merges two configs that agree on every other property.
+*/
+function digest(value) {
+	const source = typeof value === "symbol" ? value.toString() : typeof value === "bigint" ? `${value}n` : String(value);
+	return `opaque:${createHash("sha256").update(source).digest("hex")}`;
+}
+/**
+* Reference-identity key fragment for callable options (see
+* {@link opaqueFunctionIds}).
+*/
+function functionDigest(value) {
+	let id = opaqueFunctionIds.get(value);
+	if (id === void 0) {
+		id = nextOpaqueFunctionId++;
+		opaqueFunctionIds.set(value, id);
+	}
+	return `fnref:${id}`;
+}
+/**
+* Canonicalize a config-object value into a JSON-safe representation with
+* deterministic key order and hashed secrets.
+*/
+function canonicalizeValue(key, value, depth) {
+	if (value === null || value === void 0) return null;
+	if (HASHED_DB_KEYS.has(key) && typeof value === "string" && value !== "") return `sha256:${createHash("sha256").update(value).digest("hex")}`;
+	if (typeof value === "string" && value !== "") return redactUrlCredentials(value);
+	const t = typeof value;
+	if (t === "string" || t === "number" || t === "boolean") return value;
+	if (t === "function") return functionDigest(value);
+	if (t === "bigint" || t === "symbol") return digest(value);
+	if (Array.isArray(value)) return value.map((item) => canonicalizeValue(key, item, depth + 1));
+	if (t === "object") {
+		if (isDatabaseInterface(value)) return instanceKey(value);
+		if (!isPlainStructure(value)) return objectIdentityDigest(value);
+		if (depth >= 8) return digest(value);
+		const out = {};
+		for (const k of Object.keys(value).sort()) out[k] = canonicalizeValue(k, value[k], depth + 1);
+		return out;
+	}
+	return digest(value);
+}
+/**
+* Identity key for a live `DatabaseInterface` instance (issue #384): the
+* registry's `dbInstanceIds` WeakMap assigns each instance a stable
+* per-process ID. Also used for `:memory:` config objects, which must stay
+* per-call-site isolated.
+*/
+function instanceKey(db) {
+	const ids = getDbInstanceIds();
+	if (!ids.has(db)) {
+		ids.set(db, getNextDbId());
+		setNextDbId(getNextDbId() + 1);
+	}
+	return `instance:${ids.get(db)}`;
+}
+/**
+* Resolve the collection-cache key fragment for a `db` option value.
+*
+* Returns `undefined` for a missing db, matching the historical shape of the
+* cache key (absent db serializes as `null` in the JSON part of the key).
+*/
+function resolveCollectionDbCacheKey(db) {
+	if (db === void 0 || db === null) return void 0;
+	if (typeof db === "string") return `string:${redactUrlCredentials(db)}`;
+	if (typeof db !== "object") return void 0;
+	if (isDatabaseInterface(db)) return instanceKey(db);
+	const config = db;
+	const rawUrl = typeof config.url === "string" ? config.url : "";
+	const canUseMemory = !config.type || config.type === "sqlite" || config.type === "json";
+	if (rawUrl === ":memory:" || rawUrl === "memory" || rawUrl === "file::memory:" || !rawUrl && canUseMemory) return instanceKey(db);
+	const bounded = applyPostgresRuntimeTimeouts({
+		...config,
+		...rawUrl ? { url: rawUrl } : {}
+	});
+	if ("client" in config && config.client != null && !("client" in bounded)) bounded.client = config.client;
+	const canonical = {};
+	for (const k of Object.keys(bounded).sort()) canonical[k] = canonicalizeValue(k, bounded[k], 0);
+	return `config:${JSON.stringify(canonical)}`;
+}
+//#endregion
+export { resolveCollectionDbCacheKey };
+
+//# sourceMappingURL=db-cache-key.js.map