{"version":3,"file":"regex-generator-BbXzO8yz.mjs","names":["RandExp","__toESM","require_tokens","exports","require_types$1","types","\"ROOT\"","\"GROUP\"","\"POSITION\"","\"SET\"","\"RANGE\"","\"REPETITION\"","\"REFERENCE\"","\"CHAR\"","require_set_lookup","require_types","__createBinding","this$7","k2","k","desc","m","o","__exportStar","p","require_sets","types_1","INTS","WORDS","WHITESPACE","NOTANYCHAR","require_util","this$6","__setModuleDefault","v","\"default\"","__importStar","ownKeys","ar","mod","result","i","sets","CTRL","str","lbs","s","code","b","a16","b16","dctrl","eslsh","tokens","rs","c","regexp","regexpStr","require_tokenizer","this$5","util","captureGroupFirstChar","captureGroupChars","digit","start","lastGroup","last","groupStack","referenceQueue","groupCount","repeatErr","col","digits","value","reference","not","classTokens","group","name","stack","min","max","updateReferences","elem","valueString","tail","char","require_sets_lookup","this$4","Sets","setToLookup","lookup","len","token","require_write_set_tokens","this$3","setChar","writeSetTokens","charCode","isSameSet","set","map","key","tokenString","subset","writeSetToken","contents","isNested","require_reconstruct","write_set_tokens_1","reduceStack","createAlternate","endWith","require_dist$1","this$2","tokenizer_1","reconstruct_1","require_dist","rangeLength","high","low","SubRange","range","toSubRange","DRange","a","previous","_add","subrange","newRanges","_subtract","_intersect","index","import_randexp","__commonJSMin","this$1","ret_1","RandExp","groups","l","expandedSet","randNumber","arr","drange","j","otherCaseCode","randexp","MAX_ATTEMPTS","generateRegex","regex","pattern","generator","randomInt","minLength","attempt","length","maxLength","padding","candidate"],"sources":["../node_modules/.pnpm/ret@0.5.1/node_modules/ret/dist/types/tokens.js","../node_modules/.pnpm/ret@0.5.1/node_modules/ret/dist/types/types.js","../node_modules/.pnpm/ret@0.5.1/node_modules/ret/dist/types/set-lookup.js","../node_modules/.pnpm/ret@0.5.1/node_modules/ret/dist/types/index.js","../node_modules/.pnpm/ret@0.5.1/node_modules/ret/dist/sets.js","../node_modules/.pnpm/ret@0.5.1/node_modules/ret/dist/util.js","../node_modules/.pnpm/ret@0.5.1/node_modules/ret/dist/tokenizer.js","../node_modules/.pnpm/ret@0.5.1/node_modules/ret/dist/sets-lookup.js","../node_modules/.pnpm/ret@0.5.1/node_modules/ret/dist/write-set-tokens.js","../node_modules/.pnpm/ret@0.5.1/node_modules/ret/dist/reconstruct.js","../node_modules/.pnpm/ret@0.5.1/node_modules/ret/dist/index.js","../node_modules/.pnpm/drange@2.1.0/node_modules/drange/dist/index.js","../node_modules/.pnpm/randexp@0.6.1/node_modules/randexp/dist/randexp.js","../src/regex-generator.ts"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n//# sourceMappingURL=tokens.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.types = void 0;\nvar types;\n(function (types) {\n    types[types[\"ROOT\"] = 0] = \"ROOT\";\n    types[types[\"GROUP\"] = 1] = \"GROUP\";\n    types[types[\"POSITION\"] = 2] = \"POSITION\";\n    types[types[\"SET\"] = 3] = \"SET\";\n    types[types[\"RANGE\"] = 4] = \"RANGE\";\n    types[types[\"REPETITION\"] = 5] = \"REPETITION\";\n    types[types[\"REFERENCE\"] = 6] = \"REFERENCE\";\n    types[types[\"CHAR\"] = 7] = \"CHAR\";\n})(types || (exports.types = types = {}));\n//# sourceMappingURL=types.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n//# sourceMappingURL=set-lookup.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./tokens\"), exports);\n__exportStar(require(\"./types\"), exports);\n__exportStar(require(\"./set-lookup\"), exports);\n//# sourceMappingURL=index.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.anyChar = exports.notWhitespace = exports.whitespace = exports.notInts = exports.ints = exports.notWords = exports.words = void 0;\nconst types_1 = require(\"./types\");\nconst INTS = () => [{ type: types_1.types.RANGE, from: 48, to: 57 }];\nconst WORDS = () => [\n    { type: types_1.types.CHAR, value: 95 },\n    { type: types_1.types.RANGE, from: 97, to: 122 },\n    { type: types_1.types.RANGE, from: 65, to: 90 },\n    { type: types_1.types.RANGE, from: 48, to: 57 },\n];\nconst WHITESPACE = () => [\n    { type: types_1.types.CHAR, value: 9 },\n    { type: types_1.types.CHAR, value: 10 },\n    { type: types_1.types.CHAR, value: 11 },\n    { type: types_1.types.CHAR, value: 12 },\n    { type: types_1.types.CHAR, value: 13 },\n    { type: types_1.types.CHAR, value: 32 },\n    { type: types_1.types.CHAR, value: 160 },\n    { type: types_1.types.CHAR, value: 5760 },\n    { type: types_1.types.RANGE, from: 8192, to: 8202 },\n    { type: types_1.types.CHAR, value: 8232 },\n    { type: types_1.types.CHAR, value: 8233 },\n    { type: types_1.types.CHAR, value: 8239 },\n    { type: types_1.types.CHAR, value: 8287 },\n    { type: types_1.types.CHAR, value: 12288 },\n    { type: types_1.types.CHAR, value: 65279 },\n];\nconst NOTANYCHAR = () => [\n    { type: types_1.types.CHAR, value: 10 },\n    { type: types_1.types.CHAR, value: 13 },\n    { type: types_1.types.CHAR, value: 8232 },\n    { type: types_1.types.CHAR, value: 8233 },\n];\n// Predefined class objects.\nconst words = () => ({ type: types_1.types.SET, set: WORDS(), not: false });\nexports.words = words;\nconst notWords = () => ({ type: types_1.types.SET, set: WORDS(), not: true });\nexports.notWords = notWords;\nconst ints = () => ({ type: types_1.types.SET, set: INTS(), not: false });\nexports.ints = ints;\nconst notInts = () => ({ type: types_1.types.SET, set: INTS(), not: true });\nexports.notInts = notInts;\nconst whitespace = () => ({ type: types_1.types.SET, set: WHITESPACE(), not: false });\nexports.whitespace = whitespace;\nconst notWhitespace = () => ({ type: types_1.types.SET, set: WHITESPACE(), not: true });\nexports.notWhitespace = notWhitespace;\nconst anyChar = () => ({ type: types_1.types.SET, set: NOTANYCHAR(), not: true });\nexports.anyChar = anyChar;\n//# sourceMappingURL=sets.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.tokenizeClass = exports.strToChars = void 0;\nconst types_1 = require(\"./types\");\nconst sets = __importStar(require(\"./sets\"));\nconst CTRL = '@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^ ?';\n/**\n * Finds character representations in str and convert all to\n * their respective characters.\n *\n * @param {string} str\n * @returns {string}\n */\nconst strToChars = (str) => {\n    const charsRegex = /(\\[\\\\b\\])|(\\\\)?\\\\(?:u([A-F0-9]{4})|x([A-F0-9]{2})|c([@A-Z[\\\\\\]^?])|([0tnvfr]))/g;\n    return str.replace(charsRegex, (s, b, lbs, a16, b16, dctrl, eslsh) => {\n        if (lbs) {\n            return s;\n        }\n        let code = b ? 8 :\n            a16 ? parseInt(a16, 16) :\n                b16 ? parseInt(b16, 16) :\n                    dctrl ? CTRL.indexOf(dctrl) : {\n                        0: 0,\n                        t: 9,\n                        n: 10,\n                        v: 11,\n                        f: 12,\n                        r: 13,\n                    }[eslsh];\n        let c = String.fromCharCode(code);\n        // Escape special regex characters.\n        return /[[\\]{}^$.|?*+()]/.test(c) ? `\\\\${c}` : c;\n    });\n};\nexports.strToChars = strToChars;\n/**\n * Turns class into tokens\n * reads str until it encounters a ] not preceeded by a \\\n *\n * @param {string} str\n * @param {string} regexpStr\n * @returns {Array.<Array.<Object>, number>}\n */\nconst tokenizeClass = (str, regexpStr = '') => {\n    var _a, _b, _c, _d, _e, _f, _g;\n    let tokens = [], rs, c;\n    const regexp = /\\\\(?:(w)|(d)|(s)|(W)|(D)|(S))|((?:(?:\\\\)(.)|([^\\]\\\\]))-(((?:\\\\)])|(((?:\\\\)?([^\\]])))))|(\\])|(?:\\\\)?([^])/g;\n    while ((rs = regexp.exec(str)) !== null) {\n        const p = (_g = (_f = (_e = (_d = (_c = (_b = (_a = (rs[1] && sets.words())) !== null && _a !== void 0 ? _a : (rs[2] && sets.ints())) !== null && _b !== void 0 ? _b : (rs[3] && sets.whitespace())) !== null && _c !== void 0 ? _c : (rs[4] && sets.notWords())) !== null && _d !== void 0 ? _d : (rs[5] && sets.notInts())) !== null && _e !== void 0 ? _e : (rs[6] && sets.notWhitespace())) !== null && _f !== void 0 ? _f : (rs[7] && {\n            type: types_1.types.RANGE,\n            from: (rs[8] || rs[9]).charCodeAt(0),\n            to: (c = rs[10]).charCodeAt(c.length - 1),\n        })) !== null && _g !== void 0 ? _g : ((c = rs[16]) && { type: types_1.types.CHAR, value: c.charCodeAt(0) });\n        if (p) {\n            tokens.push(p);\n        }\n        else {\n            return [tokens, regexp.lastIndex];\n        }\n    }\n    throw new SyntaxError(`Invalid regular expression: /${regexpStr}/: Unterminated character class`);\n};\nexports.tokenizeClass = tokenizeClass;\n//# sourceMappingURL=util.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.tokenizer = void 0;\nconst util = __importStar(require(\"./util\"));\nconst types_1 = require(\"./types\");\nconst sets = __importStar(require(\"./sets\"));\n/**\n * Valid opening characters for capture group names.\n */\nconst captureGroupFirstChar = /^[a-zA-Z_$]$/i;\n/**\n * Valid characters for capture group names.\n */\nconst captureGroupChars = /^[a-zA-Z0-9_$]$/i;\nconst digit = /\\d/;\n/**\n * Tokenizes a regular expression (that is currently a string)\n * @param {string} regexpStr String of regular expression to be tokenized\n *\n * @returns {Root}\n */\nconst tokenizer = (regexpStr) => {\n    let i = 0, c;\n    let start = { type: types_1.types.ROOT, stack: [] };\n    // Keep track of last clause/group and stack.\n    let lastGroup = start;\n    let last = start.stack;\n    let groupStack = [];\n    let referenceQueue = [];\n    let groupCount = 0;\n    const repeatErr = (col) => {\n        throw new SyntaxError(`Invalid regular expression: /${regexpStr}/: Nothing to repeat at column ${col - 1}`);\n    };\n    // Decode a few escaped characters.\n    let str = util.strToChars(regexpStr);\n    // Iterate through each character in string.\n    while (i < str.length) {\n        switch (c = str[i++]) {\n            // Handle escaped characters, inclues a few sets.\n            case '\\\\':\n                if (i === str.length) {\n                    throw new SyntaxError(`Invalid regular expression: /${regexpStr}/: \\\\ at end of pattern`);\n                }\n                switch (c = str[i++]) {\n                    case 'b':\n                        last.push({ type: types_1.types.POSITION, value: 'b' });\n                        break;\n                    case 'B':\n                        last.push({ type: types_1.types.POSITION, value: 'B' });\n                        break;\n                    case 'w':\n                        last.push(sets.words());\n                        break;\n                    case 'W':\n                        last.push(sets.notWords());\n                        break;\n                    case 'd':\n                        last.push(sets.ints());\n                        break;\n                    case 'D':\n                        last.push(sets.notInts());\n                        break;\n                    case 's':\n                        last.push(sets.whitespace());\n                        break;\n                    case 'S':\n                        last.push(sets.notWhitespace());\n                        break;\n                    default:\n                        // Check if c is integer.\n                        // In which case it's a reference.\n                        if (digit.test(c)) {\n                            let digits = c;\n                            while (i < str.length && digit.test(str[i])) {\n                                digits += str[i++];\n                            }\n                            let value = parseInt(digits, 10);\n                            const reference = { type: types_1.types.REFERENCE, value };\n                            last.push(reference);\n                            referenceQueue.push({ reference, stack: last, index: last.length - 1 });\n                            // Escaped character.\n                        }\n                        else {\n                            last.push({ type: types_1.types.CHAR, value: c.charCodeAt(0) });\n                        }\n                }\n                break;\n            // Positionals.\n            case '^':\n                last.push({ type: types_1.types.POSITION, value: '^' });\n                break;\n            case '$':\n                last.push({ type: types_1.types.POSITION, value: '$' });\n                break;\n            // Handle custom sets.\n            case '[': {\n                // Check if this class is 'anti' i.e. [^abc].\n                let not;\n                if (str[i] === '^') {\n                    not = true;\n                    i++;\n                }\n                else {\n                    not = false;\n                }\n                // Get all the characters in class.\n                let classTokens = util.tokenizeClass(str.slice(i), regexpStr);\n                // Increase index by length of class.\n                i += classTokens[1];\n                last.push({\n                    type: types_1.types.SET,\n                    set: classTokens[0],\n                    not,\n                });\n                break;\n            }\n            // Class of any character except \\n.\n            case '.':\n                last.push(sets.anyChar());\n                break;\n            // Push group onto stack.\n            case '(': {\n                // Create group.\n                let group = {\n                    type: types_1.types.GROUP,\n                    stack: [],\n                    remember: true,\n                };\n                // If this is a special kind of group.\n                if (str[i] === '?') {\n                    c = str[i + 1];\n                    i += 2;\n                    // Match if followed by.\n                    if (c === '=') {\n                        group.followedBy = true;\n                        group.remember = false;\n                        // Match if not followed by.\n                    }\n                    else if (c === '!') {\n                        group.notFollowedBy = true;\n                        group.remember = false;\n                    }\n                    else if (c === '<') {\n                        let name = '';\n                        if (captureGroupFirstChar.test(str[i])) {\n                            name += str[i];\n                            i++;\n                        }\n                        else {\n                            throw new SyntaxError(`Invalid regular expression: /${regexpStr}/: Invalid capture group name, character '${str[i]}'` +\n                                ` after '<' at column ${i + 1}`);\n                        }\n                        while (i < str.length && captureGroupChars.test(str[i])) {\n                            name += str[i];\n                            i++;\n                        }\n                        if (str[i] !== '>') {\n                            throw new SyntaxError(`Invalid regular expression: /${regexpStr}/: Unclosed capture group name, expected '>', found` +\n                                ` '${str[i]}' at column ${i + 1}`);\n                        }\n                        group.name = name;\n                        i++;\n                    }\n                    else if (c === ':') {\n                        group.remember = false;\n                    }\n                    else {\n                        throw new SyntaxError(`Invalid regular expression: /${regexpStr}/: Invalid group, character '${c}'` +\n                            ` after '?' at column ${i - 1}`);\n                    }\n                }\n                else {\n                    groupCount += 1;\n                }\n                // Insert subgroup into current group stack.\n                last.push(group);\n                // Remember the current group for when the group closes.\n                groupStack.push(lastGroup);\n                // Make this new group the current group.\n                lastGroup = group;\n                last = group.stack;\n                break;\n            }\n            // Pop group out of stack.\n            case ')':\n                if (groupStack.length === 0) {\n                    throw new SyntaxError(`Invalid regular expression: /${regexpStr}/: Unmatched ) at column ${i - 1}`);\n                }\n                lastGroup = groupStack.pop();\n                // Check if this group has a PIPE.\n                // To get back the correct last stack.\n                last = lastGroup.options ?\n                    lastGroup.options[lastGroup.options.length - 1] :\n                    lastGroup.stack;\n                break;\n            // Use pipe character to give more choices.\n            case '|': {\n                // Create array where options are if this is the first PIPE\n                // in this clause.\n                if (!lastGroup.options) {\n                    lastGroup.options = [lastGroup.stack];\n                    delete lastGroup.stack;\n                }\n                // Create a new stack and add to options for rest of clause.\n                let stack = [];\n                lastGroup.options.push(stack);\n                last = stack;\n                break;\n            }\n            // Repetition.\n            // For every repetition, remove last element from last stack\n            // then insert back a RANGE object.\n            // This design is chosen because there could be more than\n            // one repetition symbols in a regex i.e. `a?+{2,3}`.\n            case '{': {\n                let rs = /^(\\d+)(,(\\d+)?)?\\}/.exec(str.slice(i)), min, max;\n                if (rs !== null) {\n                    if (last.length === 0) {\n                        repeatErr(i);\n                    }\n                    min = parseInt(rs[1], 10);\n                    max = rs[2] ? rs[3] ? parseInt(rs[3], 10) : Infinity : min;\n                    i += rs[0].length;\n                    last.push({\n                        type: types_1.types.REPETITION,\n                        min,\n                        max,\n                        value: last.pop(),\n                    });\n                }\n                else {\n                    last.push({\n                        type: types_1.types.CHAR,\n                        value: 123,\n                    });\n                }\n                break;\n            }\n            case '?':\n                if (last.length === 0) {\n                    repeatErr(i);\n                }\n                last.push({\n                    type: types_1.types.REPETITION,\n                    min: 0,\n                    max: 1,\n                    value: last.pop(),\n                });\n                break;\n            case '+':\n                if (last.length === 0) {\n                    repeatErr(i);\n                }\n                last.push({\n                    type: types_1.types.REPETITION,\n                    min: 1,\n                    max: Infinity,\n                    value: last.pop(),\n                });\n                break;\n            case '*':\n                if (last.length === 0) {\n                    repeatErr(i);\n                }\n                last.push({\n                    type: types_1.types.REPETITION,\n                    min: 0,\n                    max: Infinity,\n                    value: last.pop(),\n                });\n                break;\n            // Default is a character that is not `\\[](){}?+*^$`.\n            default:\n                last.push({\n                    type: types_1.types.CHAR,\n                    value: c.charCodeAt(0),\n                });\n        }\n    }\n    // Check if any groups have not been closed.\n    if (groupStack.length !== 0) {\n        throw new SyntaxError(`Invalid regular expression: /${regexpStr}/: Unterminated group`);\n    }\n    updateReferences(referenceQueue, groupCount);\n    return start;\n};\nexports.tokenizer = tokenizer;\n/**\n * This is a side effecting function that changes references to chars\n * if there are not enough capturing groups to reference\n * See: https://github.com/fent/ret.js/pull/39#issuecomment-1006475703\n * See: https://github.com/fent/ret.js/issues/38\n * @param {(Reference | Char)[]} referenceQueue\n * @param {number} groupCount\n * @returns {void}\n */\nfunction updateReferences(referenceQueue, groupCount) {\n    // Note: We go through the queue in reverse order so\n    // that index we use is correct even if we have to add\n    // multiple tokens to one stack\n    for (const elem of referenceQueue.reverse()) {\n        if (groupCount < elem.reference.value) {\n            // If there is nothing to reference then turn this into a char token\n            elem.reference.type = types_1.types.CHAR;\n            const valueString = elem.reference.value.toString();\n            elem.reference.value = parseInt(valueString, 8);\n            // If the number is not octal then we need to create multiple tokens\n            // https://github.com/fent/ret.js/pull/39#issuecomment-1008229226\n            if (!/^[0-7]+$/.test(valueString)) {\n                let i = 0;\n                while (valueString[i] !== '8' && valueString[i] !== '9') {\n                    i += 1;\n                }\n                if (i === 0) {\n                    // Handling case when escaped number starts with 8 or 9\n                    elem.reference.value = valueString.charCodeAt(0);\n                    i += 1;\n                }\n                else {\n                    // If the escaped number does not start with 8 or 9, then all\n                    // 0-7 digits before the first 8/9 form the first character code\n                    // see: https://github.com/fent/ret.js/pull/39#discussion_r780747085\n                    elem.reference.value = parseInt(valueString.slice(0, i), 8);\n                }\n                if (valueString.length > i) {\n                    const tail = elem.stack.splice(elem.index + 1);\n                    for (const char of valueString.slice(i)) {\n                        elem.stack.push({\n                            type: types_1.types.CHAR,\n                            value: char.charCodeAt(0),\n                        });\n                    }\n                    elem.stack.push(...tail);\n                }\n            }\n        }\n    }\n}\n//# sourceMappingURL=tokenizer.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.NOTANYCHAR = exports.WHITESPACE = exports.WORDS = exports.INTS = void 0;\nconst Sets = __importStar(require(\"./sets\"));\nconst types_1 = require(\"./types\");\nfunction setToLookup(tokens) {\n    let lookup = {};\n    let len = 0;\n    for (const token of tokens) {\n        if (token.type === types_1.types.CHAR) {\n            lookup[token.value] = true;\n        }\n        // Note this is in an if statement because\n        // the SetTokens type is (Char | Range | Set)[]\n        // so a type error is thrown if it is not.\n        // If the SetTokens type is modified the if statement\n        // can be removed\n        if (token.type === types_1.types.RANGE) {\n            lookup[`${token.from}-${token.to}`] = true;\n        }\n        len += 1;\n    }\n    return {\n        lookup: () => (Object.assign({}, lookup)),\n        len,\n    };\n}\nexports.INTS = setToLookup(Sets.ints().set);\nexports.WORDS = setToLookup(Sets.words().set);\nexports.WHITESPACE = setToLookup(Sets.whitespace().set);\nexports.NOTANYCHAR = setToLookup(Sets.anyChar().set);\n//# sourceMappingURL=sets-lookup.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || (function () {\n    var ownKeys = function(o) {\n        ownKeys = Object.getOwnPropertyNames || function (o) {\n            var ar = [];\n            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n            return ar;\n        };\n        return ownKeys(o);\n    };\n    return function (mod) {\n        if (mod && mod.__esModule) return mod;\n        var result = {};\n        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n        __setModuleDefault(result, mod);\n        return result;\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.setChar = setChar;\nexports.writeSetTokens = writeSetTokens;\nconst types_1 = require(\"./types\");\nconst sets = __importStar(require(\"./sets-lookup\"));\n/**\n * Takes character code and returns character to be displayed in a set\n * @param {number} charCode Character code of set element\n * @returns {string} The string for the sets character\n */\nfunction setChar(charCode) {\n    return charCode === 94 ? '\\\\^' :\n        charCode === 92 ? '\\\\\\\\' :\n            charCode === 93 ? '\\\\]' :\n                charCode === 45 ? '\\\\-' :\n                    String.fromCharCode(charCode);\n}\n/**\n * Test if a character set matches a 'set-lookup'\n * @param {SetTokens} set The set to be tested\n * @param {SetLookup} param The predefined 'set-lookup' & the number of elements in the lookup\n * @returns {boolean} True if the character set corresponds to the 'set-lookup'\n */\nfunction isSameSet(set, { lookup, len }) {\n    // If the set and the lookup are not of the same length\n    // then we immediately know that the lookup will be false\n    if (len !== set.length) {\n        return false;\n    }\n    const map = lookup();\n    for (const elem of set) {\n        if (elem.type === types_1.types.SET) {\n            return false;\n        }\n        const key = elem.type === types_1.types.CHAR ? elem.value : `${elem.from}-${elem.to}`;\n        if (map[key]) {\n            map[key] = false;\n        }\n        else {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Writes the tokens for a set\n * @param {Set} set The set to display\n * @param {boolean} isNested Whether the token is nested inside another set token\n * @returns {string} The tokens for the set\n */\nfunction writeSetTokens(set, isNested = false) {\n    if (isSameSet(set.set, sets.INTS)) {\n        return set.not ? '\\\\D' : '\\\\d';\n    }\n    if (isSameSet(set.set, sets.WORDS)) {\n        return set.not ? '\\\\W' : '\\\\w';\n    }\n    // Notanychar is only relevant when not nested inside another set token\n    if (set.not && isSameSet(set.set, sets.NOTANYCHAR)) {\n        return '.';\n    }\n    if (isSameSet(set.set, sets.WHITESPACE)) {\n        return set.not ? '\\\\S' : '\\\\s';\n    }\n    let tokenString = '';\n    for (let i = 0; i < set.set.length; i++) {\n        const subset = set.set[i];\n        tokenString += writeSetToken(subset);\n    }\n    const contents = `${set.not ? '^' : ''}${tokenString}`;\n    return isNested ? contents : `[${contents}]`;\n}\n/**\n * Writes a token within a set\n * @param {Range | Char | Set} set The set token to display\n * @returns {string} The token as a string\n */\nfunction writeSetToken(set) {\n    if (set.type === types_1.types.CHAR) {\n        return setChar(set.value);\n    }\n    else if (set.type === types_1.types.RANGE) {\n        return `${setChar(set.from)}-${setChar(set.to)}`;\n    }\n    return writeSetTokens(set, true);\n}\n//# sourceMappingURL=write-set-tokens.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.reconstruct = void 0;\nconst types_1 = require(\"./types\");\nconst write_set_tokens_1 = require(\"./write-set-tokens\");\nconst reduceStack = (stack) => stack.map(exports.reconstruct).join('');\nconst createAlternate = (token) => {\n    if ('options' in token) {\n        return token.options.map(reduceStack).join('|');\n    }\n    else if ('stack' in token) {\n        return reduceStack(token.stack);\n    }\n    else {\n        throw new Error(`options or stack must be Root or Group token`);\n    }\n};\nconst reconstruct = (token) => {\n    switch (token.type) {\n        case types_1.types.ROOT:\n            return createAlternate(token);\n        case types_1.types.CHAR: {\n            const c = String.fromCharCode(token.value);\n            // Note that the escaping for characters inside classes is handled\n            // in the write-set-tokens module so '-' and ']' are not escaped here\n            return (/[[\\\\{}$^.|?*+()]/.test(c) ? '\\\\' : '') + c;\n        }\n        case types_1.types.POSITION:\n            if (token.value === '^' || token.value === '$') {\n                return token.value;\n            }\n            else {\n                return `\\\\${token.value}`;\n            }\n        case types_1.types.REFERENCE:\n            return `\\\\${token.value}`;\n        case types_1.types.SET:\n            return (0, write_set_tokens_1.writeSetTokens)(token);\n        case types_1.types.GROUP: {\n            // Check token.remember\n            const prefix = token.name ? `?<${token.name}>` :\n                token.remember ? '' :\n                    token.followedBy ? '?=' :\n                        token.notFollowedBy ? '?!' :\n                            '?:';\n            return `(${prefix}${createAlternate(token)})`;\n        }\n        case types_1.types.REPETITION: {\n            const { min, max } = token;\n            let endWith;\n            if (min === 0 && max === 1) {\n                endWith = '?';\n            }\n            else if (min === 1 && max === Infinity) {\n                endWith = '+';\n            }\n            else if (min === 0 && max === Infinity) {\n                endWith = '*';\n            }\n            else if (max === Infinity) {\n                endWith = `{${min},}`;\n            }\n            else if (min === max) {\n                endWith = `{${min}}`;\n            }\n            else {\n                endWith = `{${min},${max}}`;\n            }\n            return `${(0, exports.reconstruct)(token.value)}${endWith}`;\n        }\n        case types_1.types.RANGE:\n            return `${(0, write_set_tokens_1.setChar)(token.from)}-${(0, write_set_tokens_1.setChar)(token.to)}`;\n        default:\n            throw new Error(`Invalid token type ${token}`);\n    }\n};\nexports.reconstruct = reconstruct;\n//# sourceMappingURL=reconstruct.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.types = void 0;\n/* istanbul ignore file */\nconst types_1 = require(\"./types\");\nObject.defineProperty(exports, \"types\", { enumerable: true, get: function () { return types_1.types; } });\n__exportStar(require(\"./tokenizer\"), exports);\n__exportStar(require(\"./reconstruct\"), exports);\nconst tokenizer_1 = require(\"./tokenizer\");\nconst reconstruct_1 = require(\"./reconstruct\");\n__exportStar(require(\"./types\"), exports);\nexports.default = tokenizer_1.tokenizer;\nmodule.exports = tokenizer_1.tokenizer;\nmodule.exports.types = types_1.types;\nmodule.exports.reconstruct = reconstruct_1.reconstruct;\n//# sourceMappingURL=index.js.map","\"use strict\";\nconst rangeLength = (low, high) => 1 + high - low;\n// Private helper class\nclass SubRange {\n    constructor(low, high) {\n        this.low = low;\n        this.high = high;\n        this.length = rangeLength(low, high);\n    }\n    overlaps(range) {\n        return range.low <= this.high && this.low <= range.high;\n    }\n    touches(range) {\n        return range.low <= this.high + 1 && this.low - 1 <= range.high;\n    }\n    covers(range) {\n        return this.low <= range.low && range.high <= this.high;\n    }\n    isInside(range) {\n        return range.low < this.low && this.high < range.high;\n    }\n    isBefore(range) {\n        return this.high < range.low;\n    }\n    // Returns inclusive combination of SubRanges as a SubRange.\n    add(range) {\n        return new SubRange(Math.min(this.low, range.low), Math.max(this.high, range.high));\n    }\n    // Returns subtraction of SubRanges as an array of SubRanges.\n    // (There's a case where subtraction divides it in 2)\n    subtract(range) {\n        if (range.covers(this)) {\n            return [];\n        }\n        else if (range.isInside(this)) {\n            return [\n                new SubRange(this.low, range.low - 1),\n                new SubRange(range.high + 1, this.high),\n            ];\n        }\n        else if (range.low <= this.low) {\n            return [new SubRange(range.high + 1, this.high)];\n        }\n        else {\n            return [new SubRange(this.low, range.low - 1)];\n        }\n    }\n    toString() {\n        return this.low === this.high\n            ? this.low.toString()\n            : `${this.low}-${this.high}`;\n    }\n}\nconst toSubRange = (low, high) => new SubRange(low, high === undefined ? low : high);\n/**\n * For adding/subtracting sets of range of numbers.\n */\nclass DRange {\n    constructor(a, b) {\n        this.ranges = [];\n        this.length = 0;\n        if (a != null) {\n            if (a instanceof DRange)\n                this.add(a);\n            else\n                this.add(a, b);\n        }\n    }\n    _update_length() {\n        this.length = this.ranges.reduce((previous, range) => {\n            return previous + range.length;\n        }, 0);\n    }\n    add(a, b) {\n        const _add = (subrange) => {\n            let i = 0;\n            while (i < this.ranges.length &&\n                !subrange.touches(this.ranges[i]) &&\n                this.ranges[i].isBefore(subrange)) {\n                i++;\n            }\n            const newRanges = this.ranges.slice(0, i);\n            while (i < this.ranges.length && subrange.touches(this.ranges[i])) {\n                subrange = subrange.add(this.ranges[i]);\n                i++;\n            }\n            newRanges.push(subrange);\n            this.ranges = newRanges.concat(this.ranges.slice(i));\n            this._update_length();\n        };\n        if (a instanceof DRange) {\n            a.ranges.forEach(_add);\n        }\n        else {\n            _add(toSubRange(a, b));\n        }\n        return this;\n    }\n    subtract(a, b) {\n        const _subtract = (subrange) => {\n            let i = 0;\n            while (i < this.ranges.length && !subrange.overlaps(this.ranges[i])) {\n                i++;\n            }\n            let newRanges = this.ranges.slice(0, i);\n            while (i < this.ranges.length && subrange.overlaps(this.ranges[i])) {\n                newRanges = newRanges.concat(this.ranges[i].subtract(subrange));\n                i++;\n            }\n            this.ranges = newRanges.concat(this.ranges.slice(i));\n            this._update_length();\n        };\n        if (a instanceof DRange) {\n            a.ranges.forEach(_subtract);\n        }\n        else if (a != null) {\n            _subtract(toSubRange(a, b));\n        }\n        return this;\n    }\n    intersect(a, b) {\n        const newRanges = [];\n        const _intersect = (subrange) => {\n            let i = 0;\n            while (i < this.ranges.length && !subrange.overlaps(this.ranges[i])) {\n                i++;\n            }\n            while (i < this.ranges.length && subrange.overlaps(this.ranges[i])) {\n                const low = Math.max(this.ranges[i].low, subrange.low);\n                const high = Math.min(this.ranges[i].high, subrange.high);\n                newRanges.push(new SubRange(low, high));\n                i++;\n            }\n        };\n        if (a instanceof DRange) {\n            a.ranges.forEach(_intersect);\n        }\n        else if (a != null) {\n            _intersect(toSubRange(a, b));\n        }\n        this.ranges = newRanges;\n        this._update_length();\n        return this;\n    }\n    /**\n     * Get the number at the specified index.\n     */\n    index(index) {\n        let i = 0;\n        while (i < this.ranges.length && this.ranges[i].length <= index) {\n            index -= this.ranges[i].length;\n            i++;\n        }\n        return this.ranges[i].low + index;\n    }\n    toString() {\n        return `[ ${this.ranges.join(', ')} ]`;\n    }\n    /**\n     * Clones the drange, so that changes to it are not reflected on its clone.\n     */\n    clone() {\n        return new DRange(this);\n    }\n    /**\n     * Get contained numbers.\n     */\n    numbers() {\n        return this.ranges.reduce((result, subrange) => {\n            let i = subrange.low;\n            while (i <= subrange.high) {\n                result.push(i);\n                i++;\n            }\n            return result;\n        }, []);\n    }\n    /**\n     * Get copy of subranges.\n     */\n    subranges() {\n        return this.ranges.map((subrange) => ({\n            low: subrange.low,\n            high: subrange.high,\n            length: rangeLength(subrange.low, subrange.high),\n        }));\n    }\n}\nDRange.DRange = DRange;\nDRange.default = DRange;\n// Statically recognizable exports for Node.js cjs-module-lexer (ESM named import support)\nmodule.exports = DRange;\nmodule.exports.default = DRange;\nmodule.exports.DRange = DRange;\nmodule.exports = DRange;\n//# sourceMappingURL=index.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst ret_1 = __importStar(require(\"ret\"));\nconst DRange = require(\"drange\");\nclass RandExp {\n    constructor(regexp, m) {\n        this._setDefaults(regexp);\n        if (regexp instanceof RegExp) {\n            this.ignoreCase = regexp.ignoreCase;\n            this.multiline = regexp.multiline;\n            regexp = regexp.source;\n        }\n        else if (typeof regexp === \"string\") {\n            this.ignoreCase = !!(m && m.indexOf(\"i\") !== -1);\n            this.multiline = !!(m && m.indexOf(\"m\") !== -1);\n        }\n        else {\n            throw Error(\"Expected a regexp or string\");\n        }\n        this.tokens = (0, ret_1.default)(regexp);\n    }\n    /**\n     * Checks if some custom properties have been set for this regexp.\n     */\n    _setDefaults(regexp) {\n        // When a repetitional token has its max set to Infinite,\n        // randexp won't actually generate a random amount between min and Infinite\n        // instead it will see Infinite as min + 100.\n        this.max =\n            typeof regexp !== \"string\" && regexp.max != null\n                ? regexp.max\n                : RandExp.prototype.max != null\n                    ? RandExp.prototype.max\n                    : 100;\n        // This allows expanding to include additional characters\n        // for instance: RandExp.defaultRange.add(0, 65535);\n        this.defaultRange =\n            typeof regexp !== \"string\" && regexp.defaultRange\n                ? regexp.defaultRange\n                : this.defaultRange.clone();\n        if (typeof regexp !== \"string\" && regexp.randInt) {\n            this.randInt = regexp.randInt;\n        }\n    }\n    /**\n     * Generates the random string.\n     */\n    gen() {\n        return this._gen(this.tokens, []);\n    }\n    /**\n     * Generate random string modeled after given tokens.\n     */\n    _gen(token, groups) {\n        switch (token.type) {\n            case ret_1.types.ROOT:\n            case ret_1.types.GROUP:\n                if (token.type === ret_1.types.GROUP) {\n                    // Ignore lookaheads for now.\n                    if (token.followedBy || token.notFollowedBy) {\n                        return \"\";\n                    }\n                    // Insert placeholder until group string is generated.\n                    if (token.remember && token.groupNumber === undefined) {\n                        token.groupNumber = groups.push(null) - 1;\n                    }\n                }\n                let stack = token.options\n                    ? this._randSelect(token.options)\n                    : token.stack;\n                let str = \"\";\n                for (let i = 0, l = stack.length; i < l; i++) {\n                    str += this._gen(stack[i], groups);\n                }\n                if (token.type === ret_1.types.GROUP && token.remember) {\n                    groups[token.groupNumber] = str;\n                }\n                return str;\n            case ret_1.types.POSITION:\n                // Do nothing for now.\n                return \"\";\n            case ret_1.types.SET:\n                const expandedSet = this._expand(token);\n                if (!expandedSet.length) {\n                    return \"\";\n                }\n                return String.fromCodePoint(expandedSet.index(this.randInt(0, expandedSet.length - 1)));\n            case ret_1.types.REPETITION: {\n                // Randomly generate number between min and max.\n                const randNumber = this.randInt(token.min, token.max === Infinity ? token.min + this.max : token.max);\n                let str = \"\";\n                for (let i = 0; i < randNumber; i++) {\n                    str += this._gen(token.value, groups);\n                }\n                return str;\n            }\n            case ret_1.types.REFERENCE:\n                return groups[token.value - 1] || \"\";\n            case ret_1.types.CHAR:\n                const code = this.ignoreCase && this._randBool()\n                    ? this._toOtherCase(token.value)\n                    : token.value;\n                return String.fromCodePoint(code);\n        }\n    }\n    /**\n     * If code is alphabetic, converts to other case.\n     * If not alphabetic, returns back code.\n     */\n    _toOtherCase(code) {\n        return (code +\n            (97 <= code && code <= 122 ? -32 : 65 <= code && code <= 90 ? 32 : 0));\n    }\n    /**\n     * Randomly returns a true or false value.\n     */\n    _randBool() {\n        return !this.randInt(0, 1);\n    }\n    /**\n     * Randomly selects and returns a value from the array.\n     */\n    _randSelect(arr) {\n        return arr[this.randInt(0, arr.length - 1)];\n    }\n    /**\n     * Expands a token to a DiscontinuousRange of characters which has a\n     * length and an index function (for random selecting).\n     */\n    _expand(token) {\n        if (token.type === ret_1.types.CHAR) {\n            return new DRange(token.value);\n        }\n        else if (token.type === ret_1.types.RANGE) {\n            return new DRange(token.from, token.to);\n        }\n        else {\n            let drange = new DRange();\n            for (let i = 0; i < token.set.length; i++) {\n                let subrange = this._expand(token.set[i]);\n                drange.add(subrange);\n                if (this.ignoreCase) {\n                    for (let j = 0; j < subrange.length; j++) {\n                        let code = subrange.index(j);\n                        let otherCaseCode = this._toOtherCase(code);\n                        if (code !== otherCaseCode) {\n                            drange.add(otherCaseCode);\n                        }\n                    }\n                }\n            }\n            if (token.not) {\n                return this.defaultRange.clone().subtract(drange);\n            }\n            else {\n                return this.defaultRange.clone().intersect(drange);\n            }\n        }\n    }\n    /**\n     * Randomly generates and returns a number between a and b (inclusive).\n     */\n    randInt(a, b) {\n        return a + Math.floor(Math.random() * (1 + b - a));\n    }\n    /**\n     * Default range of characters to generate from.\n     */\n    get defaultRange() {\n        return (this._range = this._range || new DRange(32, 126));\n    }\n    set defaultRange(range) {\n        this._range = range;\n    }\n    /**\n     * Enables use of randexp with a shorter call.\n     */\n    static randexp(regexp, m) {\n        let randexp;\n        if (typeof regexp === \"string\") {\n            regexp = new RegExp(regexp, m);\n        }\n        if (regexp._randexp === undefined) {\n            randexp = new RandExp(regexp, m);\n            regexp._randexp = randexp;\n        }\n        else {\n            randexp = regexp._randexp;\n            randexp._setDefaults(regexp);\n        }\n        return randexp.gen();\n    }\n    /**\n     * Enables sugary /regexp/.gen syntax.\n     */\n    static sugar() {\n        RegExp.prototype.gen = function () {\n            return RandExp.randexp(this);\n        };\n    }\n}\nexports.default = RandExp;\nmodule.exports = RandExp;\n//# sourceMappingURL=randexp.js.map","import RandExp from 'randexp';\n\nconst MAX_ATTEMPTS = 20;\n\nexport function generateRegex(\n    pattern: RegExp,\n    randomInt: (min: number, max: number) => number,\n    minLength = 0,\n    maxLength = Infinity,\n): string | undefined {\n    const regex = new RegExp(pattern.source, pattern.flags.replace(/[gy]/g, ''));\n    const generator = new RandExp(regex);\n    generator.randInt = randomInt;\n    generator.max = Math.max(generator.max, Math.min(minLength, 1000));\n\n    for (let attempt = 0; attempt < MAX_ATTEMPTS; attempt++) {\n        const value = generator.gen();\n        const length = [...value].length;\n        if (length > maxLength) {\n            continue;\n        }\n\n        const padding = 'a'.repeat(Math.max(0, minLength - length));\n        for (const candidate of [value + padding, padding + value]) {\n            if (regex.test(candidate)) {\n                return candidate;\n            }\n        }\n    }\n\n    return undefined;\n}\n"],"ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12],"mappings":";;;CACA,OAAO,eAAeG,GAAS,cAAc,EAAE,OAAO,GAAK,CAAC;;CCC5D,AADA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,GAAK,CAAC,GAC5D,EAAQ,QAAQ,KAAK;CACrB,IAAIE;CACJ,CAAC,SAAU,GAAO;EAQd,AAPA,EAAM,EAAMC,OAAU,KAAK,QAC3B,EAAM,EAAMC,QAAW,KAAK,SAC5B,EAAM,EAAMC,WAAc,KAAK,YAC/B,EAAM,EAAMC,MAAS,KAAK,OAC1B,EAAM,EAAMC,QAAW,KAAK,SAC5B,EAAM,EAAMC,aAAgB,KAAK,cACjC,EAAM,EAAMC,YAAe,KAAK,aAChC,EAAM,EAAMC,OAAU,KAAK;CAC/B,EAAA,CAAGR,MAAU,EAAQ,QAAQ,IAAQ,CAAC,EAAE;;CCZxC,OAAO,eAAeF,GAAS,cAAc,EAAE,OAAO,GAAK,CAAC;;CCA5D,IAAIa,IAAAC,KAAAA,EAAgC,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,GAAI;EAC5F,AAAIC,MAAO,KAAA,MAAW,IAAKC;EAC3B,IAAIC,IAAO,OAAO,yBAAyBC,GAAGF,CAAC;EAI/C,CAHI,CAACC,MAAS,SAASA,IAAO,CAACC,EAAE,aAAaD,EAAK,YAAYA,EAAK,mBAClE,IAAO;GAAE,YAAY;GAAM,KAAK,WAAW;IAAE,OAAOC,EAAEF;GAAI;EAAE,IAE9D,OAAO,eAAeG,GAAGJ,GAAIE,CAAI;CACrC,MAAM,SAAS,GAAG,GAAG,GAAG,GAAI;EAExB,AADIF,MAAO,KAAA,MAAW,IAAKC,IAC3B,EAAED,KAAMG,EAAEF;CACd,KACII,IAAAN,KAAAA,EAA6B,gBAAiB,SAAS,GAAG,GAAS;EACnE,KAAK,IAAIO,KAAKH,GAAG,AAAIG,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKrB,GAASqB,CAAC,KAAGR,EAAgBb,GAASkB,GAAGG,CAAC;CAC5H;CAIA,AAHA,OAAO,eAAerB,GAAS,cAAc,EAAE,OAAO,GAAK,CAAC,GAC5DoB,EAAArB,EAAA,GAAkCC,CAAO,GACzCoB,EAAAnB,EAAA,GAAiCD,CAAO,GACxCoB,EAAAT,EAAA,GAAsCX,CAAO;;CChB7C,AADA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,GAAK,CAAC,GAC5D,EAAQ,UAAU,EAAQ,gBAAgB,EAAQ,aAAa,EAAQ,UAAU,EAAQ,OAAO,EAAQ,WAAW,EAAQ,QAAQ,KAAK;CACxI,IAAMuB,IAAAX,EAAA,GACAY,UAAa,CAAC;EAAE,MAAMD,EAAQ,MAAM;EAAO,MAAM;EAAI,IAAI;CAAG,CAAC,GAC7DE,UAAc;EAChB;GAAE,MAAMF,EAAQ,MAAM;GAAM,OAAO;EAAG;EACtC;GAAE,MAAMA,EAAQ,MAAM;GAAO,MAAM;GAAI,IAAI;EAAI;EAC/C;GAAE,MAAMA,EAAQ,MAAM;GAAO,MAAM;GAAI,IAAI;EAAG;EAC9C;GAAE,MAAMA,EAAQ,MAAM;GAAO,MAAM;GAAI,IAAI;EAAG;CAClD,GACMG,UAAmB;EACrB;GAAE,MAAMH,EAAQ,MAAM;GAAM,OAAO;EAAE;EACrC;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAG;EACtC;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAG;EACtC;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAG;EACtC;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAG;EACtC;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAG;EACtC;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAI;EACvC;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAK;EACxC;GAAE,MAAMA,EAAQ,MAAM;GAAO,MAAM;GAAM,IAAI;EAAK;EAClD;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAK;EACxC;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAK;EACxC;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAK;EACxC;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAK;EACxC;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAM;EACzC;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAM;CAC7C,GACMI,UAAmB;EACrB;GAAE,MAAMJ,EAAQ,MAAM;GAAM,OAAO;EAAG;EACtC;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAG;EACtC;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAK;EACxC;GAAE,MAAMA,EAAQ,MAAM;GAAM,OAAO;EAAK;CAC5C;CAeA,AAZA,EAAQ,eADa;EAAE,MAAMA,EAAQ,MAAM;EAAK,KAAKE,EAAM;EAAG,KAAK;CAAM,IAGzE,EAAQ,kBADgB;EAAE,MAAMF,EAAQ,MAAM;EAAK,KAAKE,EAAM;EAAG,KAAK;CAAK,IAG3E,EAAQ,cADY;EAAE,MAAMF,EAAQ,MAAM;EAAK,KAAKC,EAAK;EAAG,KAAK;CAAM,IAGvE,EAAQ,iBADe;EAAE,MAAMD,EAAQ,MAAM;EAAK,KAAKC,EAAK;EAAG,KAAK;CAAK,IAGzE,EAAQ,oBADkB;EAAE,MAAMD,EAAQ,MAAM;EAAK,KAAKG,EAAW;EAAG,KAAK;CAAM,IAGnF,EAAQ,uBADqB;EAAE,MAAMH,EAAQ,MAAM;EAAK,KAAKG,EAAW;EAAG,KAAK;CAAK,IAGrF,EAAQ,iBADe;EAAE,MAAMH,EAAQ,MAAM;EAAK,KAAKI,EAAW;EAAG,KAAK;CAAK;;CC9C/E,IAAId,IAAAgB,KAAAA,EAAgC,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,GAAI;EAC5F,AAAId,MAAO,KAAA,MAAW,IAAKC;EAC3B,IAAIC,IAAO,OAAO,yBAAyBC,GAAGF,CAAC;EAI/C,CAHI,CAACC,MAAS,SAASA,IAAO,CAACC,EAAE,aAAaD,EAAK,YAAYA,EAAK,mBAClE,IAAO;GAAE,YAAY;GAAM,KAAK,WAAW;IAAE,OAAOC,EAAEF;GAAI;EAAE,IAE9D,OAAO,eAAeG,GAAGJ,GAAIE,CAAI;CACrC,MAAM,SAAS,GAAG,GAAG,GAAG,GAAI;EAExB,AADIF,MAAO,KAAA,MAAW,IAAKC,IAC3B,EAAED,KAAMG,EAAEF;CACd,KACIc,IAAAD,KAAAA,EAAmC,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;EAC3F,OAAO,eAAeV,GAAG,WAAW;GAAE,YAAY;GAAM,OAAOY;EAAE,CAAC;CACtE,KAAK,SAAS,GAAG,GAAG;EAChB,EAAEC,UAAaD;CACnB,IACIE,IAAAJ,KAAAA,EAA6B,iBAAkB,WAAY;EAC3D,IAAIK,IAAU,SAAS,GAAG;GAMtB,OALA,IAAU,OAAO,uBAAuB,SAAU,GAAG;IACjD,IAAIC,IAAK,CAAC;IACV,KAAK,IAAInB,KAAKG,GAAG,AAAI,OAAO,UAAU,eAAe,KAAKA,GAAGH,CAAC,MAAG,EAAGmB,EAAG,UAAUnB;IACjF,OAAOmB;GACX,GACOD,EAAQf,CAAC;EACpB;EACA,OAAO,SAAU,GAAK;GAClB,IAAIiB,KAAOA,EAAI,YAAY,OAAOA;GAClC,IAAIC,IAAS,CAAC;GACd,IAAID,KAAO,MAAW,KAAA,IAAIpB,IAAIkB,EAAQE,CAAG,GAAGE,IAAI,GAAGA,IAAItB,EAAE,QAAQ,KAAK,AAAIA,EAAEsB,OAAO,aAAWzB,EAAgBwB,GAAQD,GAAKpB,EAAEsB,EAAE;GAE/H,OADAR,EAAmBO,GAAQD,CAAG,GACvBC;EACX;CACJ,EAAA,CAAG;CAEH,AADA,OAAO,eAAerC,GAAS,cAAc,EAAE,OAAO,GAAK,CAAC,GAC5D,EAAQ,gBAAgB,EAAQ,aAAa,KAAK;CAClD,IAAMuB,IAAAX,EAAA,GACA2B,IAAON,EAAAX,EAAA,CAA8B,GACrCkB,IAAO;CA0Db,AA5BA,EAAQ,cAtBY,MAETC,EAAI,QAAQ,oFAAa,GAAG,GAAG,GAAK,GAAK,GAAK,GAAO,MAAU;EAClE,IAAIC,GACA,OAAOC;EAEX,IAAIC,IAAOC,IAAI,IACXC,IAAM,SAASA,GAAK,EAAE,IAClBC,IAAM,SAASA,GAAK,EAAE,IAClBC,IAAQR,EAAK,QAAQQ,CAAK,IAAI;GAC1B,GAAG;GACH,GAAG;GACH,GAAG;GACH,GAAG;GACH,GAAG;GACH,GAAG;EACP,EAAEC,IACV,IAAI,OAAO,aAAaL,CAAI;EAEhC,OAAO,mBAAmB,KAAK,CAAC,IAAI,KAAK,MAAM;CACnD,CAAC,GA8BL,EAAQ,iBAnBe,GAAK,IAAY,OAAO;EAE3C,IAAIM,IAAS,CAAC,GAAGC,GAAIC,GACfC,IAAS;EACf,QAAQ,IAAKA,EAAO,KAAKZ,CAAG,OAAO,OAAM;GACrC,IAAMpB,KAA+C8B,EAAG,MAAMZ,EAAK,MAAM,OAAsCY,EAAG,MAAMZ,EAAK,KAAK,OAAsCY,EAAG,MAAMZ,EAAK,WAAW,OAAsCY,EAAG,MAAMZ,EAAK,SAAS,OAAsCY,EAAG,MAAMZ,EAAK,QAAQ,OAAsCY,EAAG,MAAMZ,EAAK,cAAc,OAAsCY,EAAG,MAAM;IACva,MAAM5B,EAAQ,MAAM;IACpB,OAAO4B,EAAG,MAAMA,EAAG,GAAA,CAAI,WAAW,CAAC;IACnC,KAAK,IAAIA,EAAG,IAAA,CAAK,WAAWC,EAAE,SAAS,CAAC;GAC5C,QAAuC,IAAID,EAAG,QAAQ;IAAE,MAAM5B,EAAQ,MAAM;IAAM,OAAO6B,EAAE,WAAW,CAAC;GAAE;GACzG,IAAI/B,GACA,EAAO,KAAKA,CAAC;QAGb,OAAO,CAAC6B,GAAQG,EAAO,SAAS;EAExC;EACA,MAAU,YAAY,gCAAgCC,EAAU,gCAAgC;CACpG;;CC9FA,IAAIzC,IAAA2C,KAAAA,EAAgC,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,GAAI;EAC5F,AAAIzC,MAAO,KAAA,MAAW,IAAKC;EAC3B,IAAIC,IAAO,OAAO,yBAAyBC,GAAGF,CAAC;EAI/C,CAHI,CAACC,MAAS,SAASA,IAAO,CAACC,EAAE,aAAaD,EAAK,YAAYA,EAAK,mBAClE,IAAO;GAAE,YAAY;GAAM,KAAK,WAAW;IAAE,OAAOC,EAAEF;GAAI;EAAE,IAE9D,OAAO,eAAeG,GAAGJ,GAAIE,CAAI;CACrC,MAAM,SAAS,GAAG,GAAG,GAAG,GAAI;EAExB,AADIF,MAAO,KAAA,MAAW,IAAKC,IAC3B,EAAED,KAAMG,EAAEF;CACd,KACIc,IAAA0B,KAAAA,EAAmC,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;EAC3F,OAAO,eAAerC,GAAG,WAAW;GAAE,YAAY;GAAM,OAAOY;EAAE,CAAC;CACtE,KAAK,SAAS,GAAG,GAAG;EAChB,EAAEC,UAAaD;CACnB,IACIE,IAAAuB,KAAAA,EAA6B,iBAAkB,WAAY;EAC3D,IAAItB,IAAU,SAAS,GAAG;GAMtB,OALA,IAAU,OAAO,uBAAuB,SAAU,GAAG;IACjD,IAAIC,IAAK,CAAC;IACV,KAAK,IAAInB,KAAKG,GAAG,AAAI,OAAO,UAAU,eAAe,KAAKA,GAAGH,CAAC,MAAG,EAAGmB,EAAG,UAAUnB;IACjF,OAAOmB;GACX,GACOD,EAAQf,CAAC;EACpB;EACA,OAAO,SAAU,GAAK;GAClB,IAAIiB,KAAOA,EAAI,YAAY,OAAOA;GAClC,IAAIC,IAAS,CAAC;GACd,IAAID,KAAO,MAAW,KAAA,IAAIpB,IAAIkB,EAAQE,CAAG,GAAGE,IAAI,GAAGA,IAAItB,EAAE,QAAQ,KAAK,AAAIA,EAAEsB,OAAO,aAAWzB,EAAgBwB,GAAQD,GAAKpB,EAAEsB,EAAE;GAE/H,OADAR,EAAmBO,GAAQD,CAAG,GACvBC;EACX;CACJ,EAAA,CAAG;CAEH,AADA,OAAO,eAAerC,GAAS,cAAc,EAAE,OAAO,GAAK,CAAC,GAC5D,EAAQ,YAAY,KAAK;CACzB,IAAMyD,IAAOxB,EAAAL,EAAA,CAA8B,GACrCL,IAAAX,EAAA,GACA2B,IAAON,EAAAX,EAAA,CAA8B,GAIrCoC,IAAwB,iBAIxBC,IAAoB,oBACpBC,IAAQ;CAgRd,EAAQ,aAzQW,MAAc;EAC7B,IAAItB,IAAI,GAAGc,GACPS,IAAQ;GAAE,MAAMtC,EAAQ,MAAM;GAAM,OAAO,CAAC;EAAE,GAE9CuC,IAAYD,GACZE,IAAOF,EAAM,OACbG,IAAa,CAAC,GACdC,IAAiB,CAAC,GAClBC,IAAa,GACXC,KAAa,MAAQ;GACvB,MAAU,YAAY,gCAAgCb,EAAU,iCAAiCc,IAAM,GAAG;EAC9G,GAEI3B,IAAMgB,EAAK,WAAWH,CAAS;EAEnC,OAAOhB,IAAIG,EAAI,SACX,QAAQ,IAAIA,EAAI,MAAhB;GAEI,KAAK;IACD,IAAIH,MAAMG,EAAI,QACV,MAAU,YAAY,gCAAgCa,EAAU,wBAAwB;IAE5F,QAAQ,IAAIb,EAAI,MAAhB;KACI,KAAK;MACD,EAAK,KAAK;OAAE,MAAMlB,EAAQ,MAAM;OAAU,OAAO;MAAI,CAAC;MACtD;KACJ,KAAK;MACD,EAAK,KAAK;OAAE,MAAMA,EAAQ,MAAM;OAAU,OAAO;MAAI,CAAC;MACtD;KACJ,KAAK;MACD,EAAK,KAAKgB,EAAK,MAAM,CAAC;MACtB;KACJ,KAAK;MACD,EAAK,KAAKA,EAAK,SAAS,CAAC;MACzB;KACJ,KAAK;MACD,EAAK,KAAKA,EAAK,KAAK,CAAC;MACrB;KACJ,KAAK;MACD,EAAK,KAAKA,EAAK,QAAQ,CAAC;MACxB;KACJ,KAAK;MACD,EAAK,KAAKA,EAAK,WAAW,CAAC;MAC3B;KACJ,KAAK;MACD,EAAK,KAAKA,EAAK,cAAc,CAAC;MAC9B;KACJ,SAGI,IAAIqB,EAAM,KAAKR,CAAC,GAAG;MACf,IAAIiB,IAASjB;MACb,OAAOd,IAAIG,EAAI,UAAUmB,EAAM,KAAKnB,EAAIH,EAAE,IACtC,KAAUG,EAAI;MAElB,IAAI6B,IAAQ,SAASD,GAAQ,EAAE,GACzBE,IAAY;OAAE,MAAMhD,EAAQ,MAAM;OAAW;MAAM;MAEzD,AADAwC,EAAK,KAAKQ,CAAS,GACnBN,EAAe,KAAK;OAAE;OAAW,OAAOF;OAAM,OAAOA,EAAK,SAAS;MAAE,CAAC;KAE1E,OAEI,EAAK,KAAK;MAAE,MAAMxC,EAAQ,MAAM;MAAM,OAAO6B,EAAE,WAAW,CAAC;KAAE,CAAC;IAE1E;IACA;GAEJ,KAAK;IACD,EAAK,KAAK;KAAE,MAAM7B,EAAQ,MAAM;KAAU,OAAO;IAAI,CAAC;IACtD;GACJ,KAAK;IACD,EAAK,KAAK;KAAE,MAAMA,EAAQ,MAAM;KAAU,OAAO;IAAI,CAAC;IACtD;GAEJ,KAAK,KAAK;IAEN,IAAIiD;IACJ,AAAI/B,EAAIH,OAAO,OACX,IAAM,IACN,OAGA,IAAM;IAGV,IAAImC,IAAchB,EAAK,cAAchB,EAAI,MAAMH,CAAC,GAAGgB,CAAS;IAG5D,AADA,KAAKmB,EAAY,IACjBV,EAAK,KAAK;KACN,MAAMxC,EAAQ,MAAM;KACpB,KAAKkD,EAAY;KACjB;IACJ,CAAC;IACD;GACJ;GAEA,KAAK;IACD,EAAK,KAAKlC,EAAK,QAAQ,CAAC;IACxB;GAEJ,KAAK,KAAK;IAEN,IAAImC,IAAQ;KACR,MAAMnD,EAAQ,MAAM;KACpB,OAAO,CAAC;KACR,UAAU;IACd;IAEA,IAAIkB,EAAIH,OAAO,KAAK;KAIhB,IAHA,IAAIG,EAAIH,IAAI,IACZ,KAAK,GAEDc,MAAM,KAEN,AADA,EAAM,aAAa,IACnB,EAAM,WAAW;UAGhB,IAAIA,MAAM,KAEX,AADA,EAAM,gBAAgB,IACtB,EAAM,WAAW;UAEhB,IAAIA,MAAM,KAAK;MAChB,IAAIuB,IAAO;MACX,IAAIjB,EAAsB,KAAKjB,EAAIH,EAAE,GAEjC,AADA,KAAQG,EAAIH,IACZ;WAGA,MAAU,YAAY,gCAAgCgB,EAAU,4CAA4Cb,EAAIH,GAAG,wBACvFA,IAAI,GAAG;MAEvC,OAAOA,IAAIG,EAAI,UAAUkB,EAAkB,KAAKlB,EAAIH,EAAE,IAElD,AADA,KAAQG,EAAIH,IACZ;MAEJ,IAAIG,EAAIH,OAAO,KACX,MAAU,YAAY,gCAAgCgB,EAAU,uDACvDb,EAAIH,GAAG,cAAcA,IAAI,GAAG;MAGzC,AADA,EAAM,OAAOqC,GACb;KACJ,OACK,IAAIvB,MAAM,KACX,EAAM,WAAW;UAGjB,MAAU,YAAY,gCAAgCE,EAAU,+BAA+BF,EAAE,wBACrEd,IAAI,GAAG;IAE3C,OAEI,KAAc;IAQlB,AALAyB,EAAK,KAAKW,CAAK,GAEfV,EAAW,KAAKF,CAAS,GAEzB,IAAYY,GACZ,IAAOA,EAAM;IACb;GACJ;GAEA,KAAK;IACD,IAAIV,EAAW,WAAW,GACtB,MAAU,YAAY,gCAAgCV,EAAU,2BAA2BhB,IAAI,GAAG;IAKtG,AAHA,IAAY0B,EAAW,IAAI,GAG3B,IAAOF,EAAU,UACbA,EAAU,QAAQA,EAAU,QAAQ,SAAS,KAC7CA,EAAU;IACd;GAEJ,KAAK,KAAK;IAGN,AAAKA,EAAU,YACX,EAAU,UAAU,CAACA,EAAU,KAAK,GACpC,OAAOA,EAAU;IAGrB,IAAIc,IAAQ,CAAC;IAEb,AADAd,EAAU,QAAQ,KAAKc,CAAK,GAC5B,IAAOA;IACP;GACJ;GAMA,KAAK,KAAK;IACN,IAAIzB,IAAK,qBAAqB,KAAKV,EAAI,MAAMH,CAAC,CAAC,GAAGuC,GAAKC;IACvD,AAAI3B,MAAO,OAePY,EAAK,KAAK;KACN,MAAMxC,EAAQ,MAAM;KACpB,OAAO;IACX,CAAC,KAjBGwC,EAAK,WAAW,KAChBI,EAAU7B,CAAC,GAEf,IAAM,SAASa,EAAG,IAAI,EAAE,GACxB,IAAMA,EAAG,KAAKA,EAAG,KAAK,SAASA,EAAG,IAAI,EAAE,IAAI,WAAW0B,GACvD,KAAK1B,EAAG,EAAE,CAAC,QACXY,EAAK,KAAK;KACN,MAAMxC,EAAQ,MAAM;KACpB;KACA;KACA,OAAOwC,EAAK,IAAI;IACpB,CAAC;IAQL;GACJ;GACA,KAAK;IAID,AAHIA,EAAK,WAAW,KAChBI,EAAU7B,CAAC,GAEfyB,EAAK,KAAK;KACN,MAAMxC,EAAQ,MAAM;KACpB,KAAK;KACL,KAAK;KACL,OAAOwC,EAAK,IAAI;IACpB,CAAC;IACD;GACJ,KAAK;IAID,AAHIA,EAAK,WAAW,KAChBI,EAAU7B,CAAC,GAEfyB,EAAK,KAAK;KACN,MAAMxC,EAAQ,MAAM;KACpB,KAAK;KACL,KAAK;KACL,OAAOwC,EAAK,IAAI;IACpB,CAAC;IACD;GACJ,KAAK;IAID,AAHIA,EAAK,WAAW,KAChBI,EAAU7B,CAAC,GAEfyB,EAAK,KAAK;KACN,MAAMxC,EAAQ,MAAM;KACpB,KAAK;KACL,KAAK;KACL,OAAOwC,EAAK,IAAI;IACpB,CAAC;IACD;GAEJ,SACI,EAAK,KAAK;IACN,MAAMxC,EAAQ,MAAM;IACpB,OAAO6B,EAAE,WAAW,CAAC;GACzB,CAAC;EACT;EAGJ,IAAIY,EAAW,WAAW,GACtB,MAAU,YAAY,gCAAgCV,EAAU,sBAAsB;EAG1F,OADAyB,EAAiBd,GAAgBC,CAAU,GACpCL;CACX;CAWA,SAASkB,EAAiB,GAAgB,GAAY;EAIlD,KAAK,IAAMC,KAAQf,EAAe,QAAQ,GACtC,IAAIC,IAAac,EAAK,UAAU,OAAO;GAEnC,EAAK,UAAU,OAAOzD,EAAQ,MAAM;GACpC,IAAM0D,IAAcD,EAAK,UAAU,MAAM,SAAS;GAIlD,IAHA,EAAK,UAAU,QAAQ,SAASC,GAAa,CAAC,GAG1C,CAAC,WAAW,KAAKA,CAAW,GAAG;IAC/B,IAAI3C,IAAI;IACR,OAAO2C,EAAY3C,OAAO,OAAO2C,EAAY3C,OAAO,MAChD,KAAK;IAaT,IAXIA,MAAM,KAEN,EAAK,UAAU,QAAQ2C,EAAY,WAAW,CAAC,GAC/C,KAAK,KAML,EAAK,UAAU,QAAQ,SAASA,EAAY,MAAM,GAAG3C,CAAC,GAAG,CAAC,GAE1D2C,EAAY,SAAS3C,GAAG;KACxB,IAAM4C,IAAOF,EAAK,MAAM,OAAOA,EAAK,QAAQ,CAAC;KAC7C,KAAK,IAAMG,KAAQF,EAAY,MAAM3C,CAAC,GAClC,EAAK,MAAM,KAAK;MACZ,MAAMf,EAAQ,MAAM;MACpB,OAAO4D,EAAK,WAAW,CAAC;KAC5B,CAAC;KAEL,EAAK,MAAM,KAAK,GAAGD,CAAI;IAC3B;GACJ;EACJ;CAER;;CCjXA,IAAIrE,IAAAwE,KAAAA,EAAgC,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,GAAI;EAC5F,AAAItE,MAAO,KAAA,MAAW,IAAKC;EAC3B,IAAIC,IAAO,OAAO,yBAAyBC,GAAGF,CAAC;EAI/C,CAHI,CAACC,MAAS,SAASA,IAAO,CAACC,EAAE,aAAaD,EAAK,YAAYA,EAAK,mBAClE,IAAO;GAAE,YAAY;GAAM,KAAK,WAAW;IAAE,OAAOC,EAAEF;GAAI;EAAE,IAE9D,OAAO,eAAeG,GAAGJ,GAAIE,CAAI;CACrC,MAAM,SAAS,GAAG,GAAG,GAAG,GAAI;EAExB,AADIF,MAAO,KAAA,MAAW,IAAKC,IAC3B,EAAED,KAAMG,EAAEF;CACd,KACIc,IAAAuD,KAAAA,EAAmC,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;EAC3F,OAAO,eAAelE,GAAG,WAAW;GAAE,YAAY;GAAM,OAAOY;EAAE,CAAC;CACtE,KAAK,SAAS,GAAG,GAAG;EAChB,EAAEC,UAAaD;CACnB,IACIE,IAAAoD,KAAAA,EAA6B,iBAAkB,WAAY;EAC3D,IAAInD,IAAU,SAAS,GAAG;GAMtB,OALA,IAAU,OAAO,uBAAuB,SAAU,GAAG;IACjD,IAAIC,IAAK,CAAC;IACV,KAAK,IAAInB,KAAKG,GAAG,AAAI,OAAO,UAAU,eAAe,KAAKA,GAAGH,CAAC,MAAG,EAAGmB,EAAG,UAAUnB;IACjF,OAAOmB;GACX,GACOD,EAAQf,CAAC;EACpB;EACA,OAAO,SAAU,GAAK;GAClB,IAAIiB,KAAOA,EAAI,YAAY,OAAOA;GAClC,IAAIC,IAAS,CAAC;GACd,IAAID,KAAO,MAAW,KAAA,IAAIpB,IAAIkB,EAAQE,CAAG,GAAGE,IAAI,GAAGA,IAAItB,EAAE,QAAQ,KAAK,AAAIA,EAAEsB,OAAO,aAAWzB,EAAgBwB,GAAQD,GAAKpB,EAAEsB,EAAE;GAE/H,OADAR,EAAmBO,GAAQD,CAAG,GACvBC;EACX;CACJ,EAAA,CAAG;CAEH,AADA,OAAO,eAAerC,GAAS,cAAc,EAAE,OAAO,GAAK,CAAC,GAC5D,EAAQ,aAAa,EAAQ,aAAa,EAAQ,QAAQ,EAAQ,OAAO,KAAK;CAC9E,IAAMsF,IAAOrD,EAAAX,EAAA,CAA8B,GACrCC,IAAAX,EAAA;CACN,SAAS2E,EAAY,GAAQ;EACzB,IAAIC,IAAS,CAAC,GACVC,IAAM;EACV,KAAK,IAAMC,KAASxC,GAYhB,AAXIwC,EAAM,SAASnE,EAAQ,MAAM,SAC7B,EAAOmE,EAAM,SAAS,KAOtBA,EAAM,SAASnE,EAAQ,MAAM,UAC7B,EAAO,GAAGmE,EAAM,KAAK,GAAGA,EAAM,QAAQ,KAE1C,KAAO;EAEX,OAAO;GACH,cAAe,OAAO,OAAO,CAAC,GAAGF,CAAM;GACvC;EACJ;CACJ;CAIA,AAHA,EAAQ,OAAOD,EAAYD,EAAK,KAAK,CAAC,CAAC,GAAG,GAC1C,EAAQ,QAAQC,EAAYD,EAAK,MAAM,CAAC,CAAC,GAAG,GAC5C,EAAQ,aAAaC,EAAYD,EAAK,WAAW,CAAC,CAAC,GAAG,GACtD,EAAQ,aAAaC,EAAYD,EAAK,QAAQ,CAAC,CAAC,GAAG;;CC9DnD,IAAIzE,IAAA+E,KAAAA,EAAgC,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,GAAI;EAC5F,AAAI7E,MAAO,KAAA,MAAW,IAAKC;EAC3B,IAAIC,IAAO,OAAO,yBAAyBC,GAAGF,CAAC;EAI/C,CAHI,CAACC,MAAS,SAASA,IAAO,CAACC,EAAE,aAAaD,EAAK,YAAYA,EAAK,mBAClE,IAAO;GAAE,YAAY;GAAM,KAAK,WAAW;IAAE,OAAOC,EAAEF;GAAI;EAAE,IAE9D,OAAO,eAAeG,GAAGJ,GAAIE,CAAI;CACrC,MAAM,SAAS,GAAG,GAAG,GAAG,GAAI;EAExB,AADIF,MAAO,KAAA,MAAW,IAAKC,IAC3B,EAAED,KAAMG,EAAEF;CACd,KACIc,IAAA8D,KAAAA,EAAmC,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;EAC3F,OAAO,eAAezE,GAAG,WAAW;GAAE,YAAY;GAAM,OAAOY;EAAE,CAAC;CACtE,KAAK,SAAS,GAAG,GAAG;EAChB,EAAEC,UAAaD;CACnB,IACIE,IAAA2D,KAAAA,EAA6B,iBAAkB,WAAY;EAC3D,IAAI1D,IAAU,SAAS,GAAG;GAMtB,OALA,IAAU,OAAO,uBAAuB,SAAU,GAAG;IACjD,IAAIC,IAAK,CAAC;IACV,KAAK,IAAInB,KAAKG,GAAG,AAAI,OAAO,UAAU,eAAe,KAAKA,GAAGH,CAAC,MAAG,EAAGmB,EAAG,UAAUnB;IACjF,OAAOmB;GACX,GACOD,EAAQf,CAAC;EACpB;EACA,OAAO,SAAU,GAAK;GAClB,IAAIiB,KAAOA,EAAI,YAAY,OAAOA;GAClC,IAAIC,IAAS,CAAC;GACd,IAAID,KAAO,MAAW,KAAA,IAAIpB,IAAIkB,EAAQE,CAAG,GAAGE,IAAI,GAAGA,IAAItB,EAAE,QAAQ,KAAK,AAAIA,EAAEsB,OAAO,aAAWzB,EAAgBwB,GAAQD,GAAKpB,EAAEsB,EAAE;GAE/H,OADAR,EAAmBO,GAAQD,CAAG,GACvBC;EACX;CACJ,EAAA,CAAG;CAGH,AAFA,OAAO,eAAerC,GAAS,cAAc,EAAE,OAAO,GAAK,CAAC,GAC5D,EAAQ,UAAU6F,GAClB,EAAQ,iBAAiBC;CACzB,IAAMvE,IAAAX,EAAA,GACA2B,IAAON,EAAAmD,EAAA,CAAqC;CAMlD,SAASS,EAAQ,GAAU;EACvB,OAAOE,MAAa,KAAK,QACrBA,MAAa,KAAK,SACdA,MAAa,KAAK,QACdA,MAAa,KAAK,QACd,OAAO,aAAaA,CAAQ;CAChD;CAOA,SAASC,EAAU,GAAK,EAAE,WAAQ,UAAO;EAGrC,IAAIP,MAAQQ,EAAI,QACZ,OAAO;EAEX,IAAMC,IAAMV,EAAO;EACnB,KAAK,IAAMR,KAAQiB,GAAK;GACpB,IAAIjB,EAAK,SAASzD,EAAQ,MAAM,KAC5B,OAAO;GAEX,IAAM4E,IAAMnB,EAAK,SAASzD,EAAQ,MAAM,OAAOyD,EAAK,QAAQ,GAAGA,EAAK,KAAK,GAAGA,EAAK;GACjF,IAAIkB,EAAIC,IACJ,EAAIA,KAAO;QAGX,OAAO;EAEf;EACA,OAAO;CACX;CAOA,SAASL,EAAe,GAAK,IAAW,IAAO;EAC3C,IAAIE,EAAUC,EAAI,KAAK1D,EAAK,IAAI,GAC5B,OAAO0D,EAAI,MAAM,QAAQ;EAE7B,IAAID,EAAUC,EAAI,KAAK1D,EAAK,KAAK,GAC7B,OAAO0D,EAAI,MAAM,QAAQ;EAG7B,IAAIA,EAAI,OAAOD,EAAUC,EAAI,KAAK1D,EAAK,UAAU,GAC7C,OAAO;EAEX,IAAIyD,EAAUC,EAAI,KAAK1D,EAAK,UAAU,GAClC,OAAO0D,EAAI,MAAM,QAAQ;EAE7B,IAAIG,IAAc;EAClB,KAAK,IAAI9D,IAAI,GAAGA,IAAI2D,EAAI,IAAI,QAAQ,KAAK;GACrC,IAAMI,IAASJ,EAAI,IAAI3D;GACvB,KAAegE,EAAcD,CAAM;EACvC;EACA,IAAME,IAAW,GAAGN,EAAI,MAAM,MAAM,KAAKG;EACzC,OAAOI,IAAWD,IAAW,IAAIA,EAAS;CAC9C;CAMA,SAASD,EAAc,GAAK;EAOxB,OANIL,EAAI,SAAS1E,EAAQ,MAAM,OACpBsE,EAAQI,EAAI,KAAK,IAEnBA,EAAI,SAAS1E,EAAQ,MAAM,QACzB,GAAGsE,EAAQI,EAAI,IAAI,EAAE,GAAGJ,EAAQI,EAAI,EAAE,MAE1CH,EAAeG,GAAK,EAAI;CACnC;;CCrHA,AADA,OAAO,eAAejG,GAAS,cAAc,EAAE,OAAO,GAAK,CAAC,GAC5D,EAAQ,cAAc,KAAK;CAC3B,IAAMuB,IAAAX,EAAA,GACA8F,IAAAf,EAAA,GACAgB,KAAe,MAAU/B,EAAM,IAAI5E,EAAQ,WAAW,CAAC,CAAC,KAAK,EAAE,GAC/D4G,KAAmB,MAAU;EAC/B,IAAI,aAAalB,GACb,OAAOA,EAAM,QAAQ,IAAIiB,CAAW,CAAC,CAAC,KAAK,GAAG;EAE7C,IAAI,WAAWjB,GAChB,OAAOiB,EAAYjB,EAAM,KAAK;EAG9B,MAAU,MAAM,8CAA8C;CAEtE;CA4DA,EAAQ,eA3Da,MAAU;EAC3B,QAAQA,EAAM,MAAd;GACI,KAAKnE,EAAQ,MAAM,MACf,OAAOqF,EAAgBlB,CAAK;GAChC,KAAKnE,EAAQ,MAAM,MAAM;IACrB,IAAM6B,IAAI,OAAO,aAAasC,EAAM,KAAK;IAGzC,QAAQ,mBAAmB,KAAKtC,CAAC,IAAI,OAAO,MAAMA;GACtD;GACA,KAAK7B,EAAQ,MAAM,UAKX,OAJAmE,EAAM,UAAU,OAAOA,EAAM,UAAU,MAChCA,EAAM,QAGN,KAAKA,EAAM;GAE1B,KAAKnE,EAAQ,MAAM,WACf,OAAO,KAAKmE,EAAM;GACtB,KAAKnE,EAAQ,MAAM,KACf,QAAQ,GAAGmF,EAAmB,eAAA,CAAgBhB,CAAK;GACvD,KAAKnE,EAAQ,MAAM,OAOf,OAAO,IALQmE,EAAM,OAAO,KAAKA,EAAM,KAAK,KACxCA,EAAM,WAAW,KACbA,EAAM,aAAa,OACfA,EAAM,gBAAgB,OAClB,OACIkB,EAAgBlB,CAAK,EAAE;GAE/C,KAAKnE,EAAQ,MAAM,YAAY;IAC3B,IAAM,EAAE,QAAK,WAAQmE,GACjBmB;IAmBJ,OAlBA,AAgBIA,IAhBAhC,MAAQ,KAAKC,MAAQ,IACX,MAELD,MAAQ,KAAKC,MAAQ,WAChB,MAELD,MAAQ,KAAKC,MAAQ,WAChB,MAELA,MAAQ,WACH,IAAID,EAAI,MAEbA,MAAQC,IACH,IAAID,EAAI,KAGR,IAAIA,EAAI,GAAGC,EAAI,IAEtB,IAAI,GAAG9E,EAAQ,YAAA,CAAa0F,EAAM,KAAK,IAAImB;GACtD;GACA,KAAKtF,EAAQ,MAAM,OACf,OAAO,IAAI,GAAGmF,EAAmB,QAAA,CAAShB,EAAM,IAAI,EAAE,IAAI,GAAGgB,EAAmB,QAAA,CAAShB,EAAM,EAAE;GACrG,SACI,MAAU,MAAM,sBAAsBA,GAAO;EACrD;CACJ;;CC1EA,IAAI7E,IAAAkG,KAAAA,EAAgC,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,GAAI;EAC5F,AAAIhG,MAAO,KAAA,MAAW,IAAKC;EAC3B,IAAIC,IAAO,OAAO,yBAAyBC,GAAGF,CAAC;EAI/C,CAHI,CAACC,MAAS,SAASA,IAAO,CAACC,EAAE,aAAaD,EAAK,YAAYA,EAAK,mBAClE,IAAO;GAAE,YAAY;GAAM,KAAK,WAAW;IAAE,OAAOC,EAAEF;GAAI;EAAE,IAE9D,OAAO,eAAeG,GAAGJ,GAAIE,CAAI;CACrC,MAAM,SAAS,GAAG,GAAG,GAAG,GAAI;EAExB,AADIF,MAAO,KAAA,MAAW,IAAKC,IAC3B,EAAED,KAAMG,EAAEF;CACd,KACII,IAAA2F,KAAAA,EAA6B,gBAAiB,SAAS,GAAG,GAAS;EACnE,KAAK,IAAI1F,KAAKH,GAAG,AAAIG,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKrB,GAASqB,CAAC,KAAGR,EAAgBb,GAASkB,GAAGG,CAAC;CAC5H;CAEA,AADA,OAAO,eAAerB,GAAS,cAAc,EAAE,OAAO,GAAK,CAAC,GAC5D,EAAQ,QAAQ,KAAK;;CAErB,IAAMuB,IAAAX,EAAA;CAGN,AAFA,OAAO,eAAeZ,GAAS,SAAS;EAAE,YAAY;EAAM,KAAK,WAAY;GAAE,OAAOuB,EAAQ;EAAO;CAAE,CAAC,GACxGH,EAAAmC,EAAA,GAAqCvD,CAAO,GAC5CoB,EAAAqF,EAAA,GAAuCzG,CAAO;CAC9C,IAAMgH,IAAAzD,EAAA,GACA0D,IAAAR,EAAA;CAKN,AAJArF,EAAAR,EAAA,GAAiCZ,CAAO,GACxC,EAAQ,UAAUgH,EAAY,WAC9B,EAAO,UAAUA,EAAY,WAC7B,EAAO,QAAQ,QAAQzF,EAAQ,OAC/B,EAAO,QAAQ,cAAc0F,EAAc;;CC3B3C,IAAME,KAAe,GAAK,MAAS,IAAIC,IAAOC,GAExCC,IAAN,MAAMA,EAAS;EACX,YAAY,GAAK,GAAM;GAGnB,AAFA,KAAK,MAAMD,GACX,KAAK,OAAOD,GACZ,KAAK,SAASD,EAAYE,GAAKD,CAAI;EACvC;EACA,SAAS,GAAO;GACZ,OAAOG,EAAM,OAAO,KAAK,QAAQ,KAAK,OAAOA,EAAM;EACvD;EACA,QAAQ,GAAO;GACX,OAAOA,EAAM,OAAO,KAAK,OAAO,KAAK,KAAK,MAAM,KAAKA,EAAM;EAC/D;EACA,OAAO,GAAO;GACV,OAAO,KAAK,OAAOA,EAAM,OAAOA,EAAM,QAAQ,KAAK;EACvD;EACA,SAAS,GAAO;GACZ,OAAOA,EAAM,MAAM,KAAK,OAAO,KAAK,OAAOA,EAAM;EACrD;EACA,SAAS,GAAO;GACZ,OAAO,KAAK,OAAOA,EAAM;EAC7B;EAEA,IAAI,GAAO;GACP,OAAO,IAAID,EAAS,KAAK,IAAI,KAAK,KAAKC,EAAM,GAAG,GAAG,KAAK,IAAI,KAAK,MAAMA,EAAM,IAAI,CAAC;EACtF;EAGA,SAAS,GAAO;GAcR,OAbAA,EAAM,OAAO,IAAI,IACV,CAAC,IAEHA,EAAM,SAAS,IAAI,IACjB,CACH,IAAID,EAAS,KAAK,KAAKC,EAAM,MAAM,CAAC,GACpC,IAAID,EAASC,EAAM,OAAO,GAAG,KAAK,IAAI,CAC1C,IAEKA,EAAM,OAAO,KAAK,MAChB,CAAC,IAAID,EAASC,EAAM,OAAO,GAAG,KAAK,IAAI,CAAC,IAGxC,CAAC,IAAID,EAAS,KAAK,KAAKC,EAAM,MAAM,CAAC,CAAC;EAErD;EACA,WAAW;GACP,OAAO,KAAK,QAAQ,KAAK,OACnB,KAAK,IAAI,SAAS,IAClB,GAAG,KAAK,IAAI,GAAG,KAAK;EAC9B;CACJ,GACMC,KAAc,GAAK,MAAS,IAAIF,EAASD,GAAKD,MAAS,KAAA,IAAYC,IAAMD,CAAI,GAI7EK,IAAN,MAAMA,EAAO;EACT,YAAY,GAAG,GAAG;GAGd,AAFA,KAAK,SAAS,CAAC,GACf,KAAK,SAAS,GACVC,KAAK,SACDA,aAAaD,IACb,KAAK,IAAIC,CAAC,IAEV,KAAK,IAAIA,GAAG7E,CAAC;EAEzB;EACA,iBAAiB;GACb,KAAK,SAAS,KAAK,OAAO,QAAQ,GAAU,MACjC8E,IAAWJ,EAAM,QACzB,CAAC;EACR;EACA,IAAI,GAAG,GAAG;GACN,IAAMK,KAAQ,MAAa;IACvB,IAAItF,IAAI;IACR,OAAOA,IAAI,KAAK,OAAO,UACnB,CAACuF,EAAS,QAAQ,KAAK,OAAOvF,EAAE,KAChC,KAAK,OAAOA,EAAE,CAAC,SAASuF,CAAQ,IAChC;IAEJ,IAAMC,IAAY,KAAK,OAAO,MAAM,GAAGxF,CAAC;IACxC,OAAOA,IAAI,KAAK,OAAO,UAAUuF,EAAS,QAAQ,KAAK,OAAOvF,EAAE,IAE5D,AADA,IAAWuF,EAAS,IAAI,KAAK,OAAOvF,EAAE,GACtC;IAIJ,AAFAwF,EAAU,KAAKD,CAAQ,GACvB,KAAK,SAASC,EAAU,OAAO,KAAK,OAAO,MAAMxF,CAAC,CAAC,GACnD,KAAK,eAAe;GACxB;GAOA,OANIoF,aAAaD,IACbC,EAAE,OAAO,QAAQE,CAAI,IAGrBA,EAAKJ,EAAWE,GAAG7E,CAAC,CAAC,GAElB;EACX;EACA,SAAS,GAAG,GAAG;GACX,IAAMkF,KAAa,MAAa;IAC5B,IAAIzF,IAAI;IACR,OAAOA,IAAI,KAAK,OAAO,UAAU,CAACuF,EAAS,SAAS,KAAK,OAAOvF,EAAE,IAC9D;IAEJ,IAAIwF,IAAY,KAAK,OAAO,MAAM,GAAGxF,CAAC;IACtC,OAAOA,IAAI,KAAK,OAAO,UAAUuF,EAAS,SAAS,KAAK,OAAOvF,EAAE,IAE7D,AADA,IAAYwF,EAAU,OAAO,KAAK,OAAOxF,EAAE,CAAC,SAASuF,CAAQ,CAAC,GAC9D;IAGJ,AADA,KAAK,SAASC,EAAU,OAAO,KAAK,OAAO,MAAMxF,CAAC,CAAC,GACnD,KAAK,eAAe;GACxB;GAOA,OANIoF,aAAaD,IACbC,EAAE,OAAO,QAAQK,CAAS,IAErBL,KAAK,QACVK,EAAUP,EAAWE,GAAG7E,CAAC,CAAC,GAEvB;EACX;EACA,UAAU,GAAG,GAAG;GACZ,IAAMiF,IAAY,CAAC,GACbE,KAAc,MAAa;IAC7B,IAAI1F,IAAI;IACR,OAAOA,IAAI,KAAK,OAAO,UAAU,CAACuF,EAAS,SAAS,KAAK,OAAOvF,EAAE,IAC9D;IAEJ,OAAOA,IAAI,KAAK,OAAO,UAAUuF,EAAS,SAAS,KAAK,OAAOvF,EAAE,IAAG;KAChE,IAAM+E,IAAM,KAAK,IAAI,KAAK,OAAO/E,EAAE,CAAC,KAAKuF,EAAS,GAAG,GAC/CT,IAAO,KAAK,IAAI,KAAK,OAAO9E,EAAE,CAAC,MAAMuF,EAAS,IAAI;KAExD,AADAC,EAAU,KAAK,IAAIR,EAASD,GAAKD,CAAI,CAAC,GACtC;IACJ;GACJ;GASA,OARIM,aAAaD,IACbC,EAAE,OAAO,QAAQM,CAAU,IAEtBN,KAAK,QACVM,EAAWR,EAAWE,GAAG7E,CAAC,CAAC,GAE/B,KAAK,SAASiF,GACd,KAAK,eAAe,GACb;EACX;EAIA,MAAM,GAAO;GACT,IAAIxF,IAAI;GACR,OAAOA,IAAI,KAAK,OAAO,UAAU,KAAK,OAAOA,EAAE,CAAC,UAAU2F,IAEtD,AADA,KAAS,KAAK,OAAO3F,EAAE,CAAC,QACxB;GAEJ,OAAO,KAAK,OAAOA,EAAE,CAAC,MAAM2F;EAChC;EACA,WAAW;GACP,OAAO,KAAK,KAAK,OAAO,KAAK,IAAI,EAAE;EACvC;EAIA,QAAQ;GACJ,OAAO,IAAIR,EAAO,IAAI;EAC1B;EAIA,UAAU;GACN,OAAO,KAAK,OAAO,QAAQ,GAAQ,MAAa;IAC5C,IAAInF,IAAIuF,EAAS;IACjB,OAAOvF,KAAKuF,EAAS,OAEjB,AADAxF,EAAO,KAAKC,CAAC,GACb;IAEJ,OAAOD;GACX,GAAG,CAAC,CAAC;EACT;EAIA,YAAY;GACR,OAAO,KAAK,OAAO,KAAK,OAAc;IAClC,KAAKwF,EAAS;IACd,MAAMA,EAAS;IACf,QAAQV,EAAYU,EAAS,KAAKA,EAAS,IAAI;GACnD,EAAE;EACN;CACJ;CAOA,AANA,EAAO,SAASJ,GAChB,EAAO,UAAUA,GAEjB,EAAO,UAAUA,GACjB,EAAO,QAAQ,UAAUA,GACzB,EAAO,QAAQ,SAASA,GACxB,EAAO,UAAUA;;CCjMjB,IAAI5G,IAAAuH,KAAAA,EAAgC,oBAAqB,OAAO,UAAU,SAAS,GAAG,GAAG,GAAG,GAAI;EAC5F,AAAIrH,MAAO,KAAA,MAAW,IAAKC;EAC3B,IAAIC,IAAO,OAAO,yBAAyBC,GAAGF,CAAC;EAI/C,CAHI,CAACC,MAAS,SAASA,IAAO,CAACC,EAAE,aAAaD,EAAK,YAAYA,EAAK,mBAClE,IAAO;GAAE,YAAY;GAAM,KAAK,WAAW;IAAE,OAAOC,EAAEF;GAAI;EAAE,IAE9D,OAAO,eAAeG,GAAGJ,GAAIE,CAAI;CACrC,MAAM,SAAS,GAAG,GAAG,GAAG,GAAI;EAExB,AADIF,MAAO,KAAA,MAAW,IAAKC,IAC3B,EAAED,KAAMG,EAAEF;CACd,KACIc,IAAAsG,KAAAA,EAAmC,uBAAwB,OAAO,UAAU,SAAS,GAAG,GAAG;EAC3F,OAAO,eAAejH,GAAG,WAAW;GAAE,YAAY;GAAM,OAAOY;EAAE,CAAC;CACtE,KAAK,SAAS,GAAG,GAAG;EAChB,EAAEC,UAAaD;CACnB,IACIE,IAAAmG,KAAAA,EAA6B,gBAAiB,SAAU,GAAK;EAC7D,IAAIhG,KAAOA,EAAI,YAAY,OAAOA;EAClC,IAAIC,IAAS,CAAC;EACd,IAAID,KAAO,MAAW,KAAA,IAAIpB,KAAKoB,GAAK,AAAIpB,MAAM,aAAa,OAAO,UAAU,eAAe,KAAKoB,GAAKpB,CAAC,KAAGH,EAAgBwB,GAAQD,GAAKpB,CAAC;EAEvI,OADAc,EAAmBO,GAAQD,CAAG,GACvBC;CACX;CACA,OAAO,eAAerC,GAAS,cAAc,EAAE,OAAO,GAAK,CAAC;CAC5D,IAAMqI,IAAQpG,EAAA6E,EAAA,CAA2B,GACnCW,IAAAP,EAAA,GACAoB,IAAN,MAAMA,EAAQ;EACV,YAAY,GAAQ,GAAG;GAEnB,IADA,KAAK,aAAajF,CAAM,GACpBA,aAAkB,QAGlB,AAFA,KAAK,aAAaA,EAAO,YACzB,KAAK,YAAYA,EAAO,WACxB,IAASA,EAAO;QAEf,IAAI,OAAOA,KAAW,UAEvB,AADA,KAAK,aAAa,CAAC,EAAEnC,KAAKA,EAAE,QAAQ,GAAG,MAAM,KAC7C,KAAK,YAAY,CAAC,EAAEA,KAAKA,EAAE,QAAQ,GAAG,MAAM;QAG5C,MAAM,MAAM,6BAA6B;GAE7C,KAAK,UAAU,GAAGmH,EAAM,QAAA,CAAShF,CAAM;EAC3C;EAIA,aAAa,GAAQ;GAgBjB,AAZA,KAAK,MACD,OAAOA,KAAW,YAAYA,EAAO,OAAO,OACtCA,EAAO,MACPiF,EAAQ,UAAU,OAAO,OAErB,MADAA,EAAQ,UAAU,KAIhC,KAAK,eACD,OAAOjF,KAAW,YAAYA,EAAO,eAC/BA,EAAO,eACP,KAAK,aAAa,MAAM,GAC9B,OAAOA,KAAW,YAAYA,EAAO,YACrC,KAAK,UAAUA,EAAO;EAE9B;EAIA,MAAM;GACF,OAAO,KAAK,KAAK,KAAK,QAAQ,CAAC,CAAC;EACpC;EAIA,KAAK,GAAO,GAAQ;GAChB,QAAQqC,EAAM,MAAd;IACI,KAAK2C,EAAM,MAAM;IACjB,KAAKA,EAAM,MAAM;KACb,IAAI3C,EAAM,SAAS2C,EAAM,MAAM,OAAO;MAElC,IAAI3C,EAAM,cAAcA,EAAM,eAC1B,OAAO;MAGX,AAAIA,EAAM,YAAYA,EAAM,gBAAgB,KAAA,MACxC,EAAM,cAAc6C,EAAO,KAAK,IAAI,IAAI;KAEhD;KACA,IAAI3D,IAAQc,EAAM,UACZ,KAAK,YAAYA,EAAM,OAAO,IAC9BA,EAAM,OACRjD,IAAM;KACV,KAAK,IAAIH,IAAI,GAAGkG,IAAI5D,EAAM,QAAQtC,IAAIkG,GAAG,KACrC,KAAO,KAAK,KAAK5D,EAAMtC,IAAIiG,CAAM;KAKrC,OAHI7C,EAAM,SAAS2C,EAAM,MAAM,SAAS3C,EAAM,aAC1C,EAAOA,EAAM,eAAejD,IAEzBA;IACX,KAAK4F,EAAM,MAAM,UAEb,OAAO;IACX,KAAKA,EAAM,MAAM;KACb,IAAMI,IAAc,KAAK,QAAQ/C,CAAK;KAItC,OAHK+C,EAAY,SAGV,OAAO,cAAcA,EAAY,MAAM,KAAK,QAAQ,GAAGA,EAAY,SAAS,CAAC,CAAC,CAAC,IAF3E;IAGf,KAAKJ,EAAM,MAAM,YAAY;KAEzB,IAAMK,IAAa,KAAK,QAAQhD,EAAM,KAAKA,EAAM,QAAQ,WAAWA,EAAM,MAAM,KAAK,MAAMA,EAAM,GAAG,GAChGjD,IAAM;KACV,KAAK,IAAI,IAAI,GAAG,IAAIiG,GAAY,KAC5B,KAAO,KAAK,KAAKhD,EAAM,OAAO6C,CAAM;KAExC,OAAO9F;IACX;IACA,KAAK4F,EAAM,MAAM,WACb,OAAOE,EAAO7C,EAAM,QAAQ,MAAM;IACtC,KAAK2C,EAAM,MAAM;KACb,IAAMzF,IAAO,KAAK,cAAc,KAAK,UAAU,IACzC,KAAK,aAAa8C,EAAM,KAAK,IAC7BA,EAAM;KACZ,OAAO,OAAO,cAAc9C,CAAI;GACxC;EACJ;EAKA,aAAa,GAAM;GACf,OAAQA,KACH,MAAMA,KAAQA,KAAQ,MAAM,MAAM,MAAMA,KAAQA,KAAQ,KAAK,KAAK;EAC3E;EAIA,YAAY;GACR,OAAO,CAAC,KAAK,QAAQ,GAAG,CAAC;EAC7B;EAIA,YAAY,GAAK;GACb,OAAO+F,EAAI,KAAK,QAAQ,GAAGA,EAAI,SAAS,CAAC;EAC7C;EAKA,QAAQ,GAAO;GACX,IAAIjD,EAAM,SAAS2C,EAAM,MAAM,MAC3B,OAAO,IAAIZ,EAAO/B,EAAM,KAAK;GAE5B,IAAIA,EAAM,SAAS2C,EAAM,MAAM,OAChC,OAAO,IAAIZ,EAAO/B,EAAM,MAAMA,EAAM,EAAE;GAErC;IACD,IAAIkD,IAAS,IAAInB,EAAO;IACxB,KAAK,IAAInF,IAAI,GAAGA,IAAIoD,EAAM,IAAI,QAAQ,KAAK;KACvC,IAAImC,IAAW,KAAK,QAAQnC,EAAM,IAAIpD,EAAE;KAExC,IADAsG,EAAO,IAAIf,CAAQ,GACf,KAAK,YACL,KAAK,IAAIgB,IAAI,GAAGA,IAAIhB,EAAS,QAAQ,KAAK;MACtC,IAAIjF,IAAOiF,EAAS,MAAMgB,CAAC,GACvBC,IAAgB,KAAK,aAAalG,CAAI;MAC1C,AAAIA,MAASkG,KACTF,EAAO,IAAIE,CAAa;KAEhC;IAER;IAKI,OAJApD,EAAM,MACC,KAAK,aAAa,MAAM,CAAC,CAAC,SAASkD,CAAM,IAGzC,KAAK,aAAa,MAAM,CAAC,CAAC,UAAUA,CAAM;GAEzD;EACJ;EAIA,QAAQ,GAAG,GAAG;GACV,OAAOlB,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI7E,IAAI6E,EAAE;EACrD;EAIA,IAAI,eAAe;GACf,OAAQ,KAAK,SAAS,KAAK,UAAU,IAAID,EAAO,IAAI,GAAG;EAC3D;EACA,IAAI,aAAa,GAAO;GACpB,KAAK,SAASF;EAClB;EAIA,OAAO,QAAQ,GAAQ,GAAG;GACtB,IAAIwB;GAYJ,OAXI,OAAO1F,KAAW,aAClB,IAAS,IAAI,OAAOA,GAAQnC,CAAC,IAE7BmC,EAAO,aAAa,KAAA,KACpB,IAAU,IAAIiF,EAAQjF,GAAQnC,CAAC,GAC/B,EAAO,WAAW6H,MAGlB,IAAU1F,EAAO,UACjB0F,EAAQ,aAAa1F,CAAM,IAExB0F,EAAQ,IAAI;EACvB;EAIA,OAAO,QAAQ;GACX,OAAO,UAAU,MAAM,WAAY;IAC/B,OAAOT,EAAQ,QAAQ,IAAI;GAC/B;EACJ;CACJ;CAEA,AADA,EAAQ,UAAUA,GAClB,EAAO,UAAUA;A,SC/NXU,IAAe;AAErB,SAAgBC,EACZ,GACA,GACA,IAAY,GACZ,IAAY,UACM;CAClB,IAAMC,IAAQ,IAAI,OAAOC,EAAQ,QAAQA,EAAQ,MAAM,QAAQ,SAAS,EAAE,CAAC,GACrEC,IAAY,IAAIvJ,EAAAA,QAAQqJ,CAAK;CAEnC,AADA,EAAU,UAAUG,GACpB,EAAU,MAAM,KAAK,IAAID,EAAU,KAAK,KAAK,IAAIE,GAAW,GAAI,CAAC;CAEjE,KAAK,IAAIC,IAAU,GAAGA,IAAUP,GAAc,KAAW;EACrD,IAAM1E,IAAQ8E,EAAU,IAAI,GACtBI,IAAS,CAAC,GAAGlF,CAAK,CAAC,CAAC;EAC1B,IAAIkF,IAASC,GACT;EAGJ,IAAMC,IAAU,IAAI,OAAO,KAAK,IAAI,GAAGJ,IAAYE,CAAM,CAAC;EAC1D,KAAK,IAAMG,KAAa,CAACrF,IAAQoF,GAASA,IAAUpF,CAAK,GACrD,IAAI4E,EAAM,KAAKS,CAAS,GACpB,OAAOA;CAGnB;AAGJ"}