npm - @wise/wds-codemods - Versions diffs - 0.0.1-experimental-063df14 → 0.0.1-experimental-3e28ce1 - Mend

@wise/wds-codemods 0.0.1-experimental-063df14 → 0.0.1-experimental-3e28ce1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (6) hide show

package/dist/index.js +222 -5264
package/dist/index.js.map +1 -1
package/dist/{reportManualReview-cd73vDXT.js → reportManualReview-DQ00-OKx.js} +1 -10
package/dist/{reportManualReview-cd73vDXT.js.map → reportManualReview-DQ00-OKx.js.map} +1 -1
package/dist/transforms/button.js +1 -1
package/package.json +1 -3

package/dist/index.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index.js","names":["transformFile","targetPath","dry","print","ignorePattern: string \| undefined","gitignore","transformModules: Record<string, unknown>","fs","path","convert","g","b","h","l","v","diff","c","k","m","f","p","q","t","n","conversions","models","path","wrapAnsi256","wrapAnsi16m","n","g","b","styles","assembleStyles","version","stringReplaceAll","stringEncaseCRLFWithFirstIndex","u","c","styles","chalk","chalk","getType","styles","printer","list","_collections","Symbol","SPACE","serialize","printer","test","plugin","_default","_collections","SPACE","test","serialize","printer","plugin","_default","_interopRequireDefault","printer","_markup","test","serialize","printer","plugin","_default","_collections","printer","serialize","test","plugin","_default","_markup","nodeInterop","getPropKeys","serialize","printer","test","plugin","_default","Symbol","printer","_default","_interopRequireDefault","plugin","p","plugins","_default","d","isCommon","_cleanupSemantic","n","diff","diffs","_chalk","_interopRequireDefault","_diffSequences","_interopRequireDefault","_cleanupSemantic","_normalizeDiffOptions","b","diff","aIndex","bIndex","_interopRequireDefault","_cleanupSemantic","aIndex","b","bIndex","_default","_cleanupSemantic","diff","_cleanupSemantic","_diffLines","_interopRequireDefault","_normalizeDiffOptions","diff","b","diff","Symbol","b","fs_1","path","path_1","opts_arg_js_1","path","made","path_1","path","path_1","mkdirp_manual_js_1","opts_arg_js_1","path","m","path","opts_arg_js_1","path","escapeStringRegexp","filenamify","path","filenamify","filenamifyPath","filenamify","fs","path","b","toMatchFile","path","fs","error: unknown"],"sources":["../src/utils/getOptions.ts","../src/utils/loadTransformModules.ts","../node_modules/.pnpm/color-name@1.1.4/node_modules/color-name/index.js","../node_modules/.pnpm/color-convert@2.0.1/node_modules/color-convert/conversions.js","../node_modules/.pnpm/color-convert@2.0.1/node_modules/color-convert/route.js","../node_modules/.pnpm/color-convert@2.0.1/node_modules/color-convert/index.js","../node_modules/.pnpm/ansi-styles@4.3.0/node_modules/ansi-styles/index.js","../node_modules/.pnpm/has-flag@4.0.0/node_modules/has-flag/index.js","../node_modules/.pnpm/supports-color@7.2.0/node_modules/supports-color/index.js","../node_modules/.pnpm/chalk@4.1.2/node_modules/chalk/source/util.js","../node_modules/.pnpm/chalk@4.1.2/node_modules/chalk/source/templates.js","../node_modules/.pnpm/chalk@4.1.2/node_modules/chalk/source/index.js","../node_modules/.pnpm/jest-get-type@29.6.3/node_modules/jest-get-type/build/index.js","../node_modules/.pnpm/ansi-styles@5.2.0/node_modules/ansi-styles/index.js","../node_modules/.pnpm/pretty-format@29.7.0/node_modules/pretty-format/build/collections.js","../node_modules/.pnpm/pretty-format@29.7.0/node_modules/pretty-format/build/plugins/AsymmetricMatcher.js","../node_modules/.pnpm/pretty-format@29.7.0/node_modules/pretty-format/build/plugins/DOMCollection.js","../node_modules/.pnpm/pretty-format@29.7.0/node_modules/pretty-format/build/plugins/lib/escapeHTML.js","../node_modules/.pnpm/pretty-format@29.7.0/node_modules/pretty-format/build/plugins/lib/markup.js","../node_modules/.pnpm/pretty-format@29.7.0/node_modules/pretty-format/build/plugins/DOMElement.js","../node_modules/.pnpm/pretty-format@29.7.0/node_modules/pretty-format/build/plugins/Immutable.js","../node_modules/.pnpm/react-is@18.3.1/node_modules/react-is/cjs/react-is.production.min.js","../node_modules/.pnpm/react-is@18.3.1/node_modules/react-is/cjs/react-is.development.js","../node_modules/.pnpm/react-is@18.3.1/node_modules/react-is/index.js","../node_modules/.pnpm/pretty-format@29.7.0/node_modules/pretty-format/build/plugins/ReactElement.js","../node_modules/.pnpm/pretty-format@29.7.0/node_modules/pretty-format/build/plugins/ReactTestComponent.js","../node_modules/.pnpm/pretty-format@29.7.0/node_modules/pretty-format/build/index.js","../node_modules/.pnpm/jest-diff@29.7.0/node_modules/jest-diff/build/cleanupSemantic.js","../node_modules/.pnpm/jest-diff@29.7.0/node_modules/jest-diff/build/constants.js","../node_modules/.pnpm/diff-sequences@29.6.3/node_modules/diff-sequences/build/index.js","../node_modules/.pnpm/jest-diff@29.7.0/node_modules/jest-diff/build/joinAlignedDiffs.js","../node_modules/.pnpm/jest-diff@29.7.0/node_modules/jest-diff/build/normalizeDiffOptions.js","../node_modules/.pnpm/jest-diff@29.7.0/node_modules/jest-diff/build/diffLines.js","../node_modules/.pnpm/jest-diff@29.7.0/node_modules/jest-diff/build/diffStrings.js","../node_modules/.pnpm/jest-diff@29.7.0/node_modules/jest-diff/build/getAlignedDiffs.js","../node_modules/.pnpm/jest-diff@29.7.0/node_modules/jest-diff/build/printDiffs.js","../node_modules/.pnpm/jest-diff@29.7.0/node_modules/jest-diff/build/index.js","../node_modules/.pnpm/mkdirp@3.0.1/node_modules/mkdirp/dist/cjs/src/opts-arg.js","../node_modules/.pnpm/mkdirp@3.0.1/node_modules/mkdirp/dist/cjs/src/mkdirp-manual.js","../node_modules/.pnpm/mkdirp@3.0.1/node_modules/mkdirp/dist/cjs/src/find-made.js","../node_modules/.pnpm/mkdirp@3.0.1/node_modules/mkdirp/dist/cjs/src/mkdirp-native.js","../node_modules/.pnpm/mkdirp@3.0.1/node_modules/mkdirp/dist/cjs/src/path-arg.js","../node_modules/.pnpm/mkdirp@3.0.1/node_modules/mkdirp/dist/cjs/src/use-native.js","../node_modules/.pnpm/mkdirp@3.0.1/node_modules/mkdirp/dist/cjs/src/index.js","../node_modules/.pnpm/escape-string-regexp@1.0.5/node_modules/escape-string-regexp/index.js","../node_modules/.pnpm/trim-repeated@1.0.0/node_modules/trim-repeated/index.js","../node_modules/.pnpm/filename-reserved-regex@2.0.0/node_modules/filename-reserved-regex/index.js","../node_modules/.pnpm/strip-outer@1.0.1/node_modules/strip-outer/index.js","../node_modules/.pnpm/filenamify@4.3.0/node_modules/filenamify/filenamify.js","../node_modules/.pnpm/filenamify@4.3.0/node_modules/filenamify/filenamify-path.js","../node_modules/.pnpm/filenamify@4.3.0/node_modules/filenamify/index.js","../node_modules/.pnpm/jest-file-snapshot@0.7.0/node_modules/jest-file-snapshot/index.js","../src/utils/snapshotOrchestrator.ts","../src/runCodemod.ts","../src/index.ts"],"sourcesContent":["import { confirm, input, select as list } from '@inquirer/prompts';\n\nasync function getOptions(transformFiles: string[]) {\n const args = process.argv.slice(2);\n if (args.length > 0) {\n const [transformFile, targetPath] = args;\n const dry = args.includes('--dry') \|\| args.includes('--dry-run');\n const print = args.includes('--print');\n const ignorePatternIndex = args.findIndex((arg) => arg === '--ignore-pattern');\n let ignorePattern: string \| undefined;\n if (ignorePatternIndex !== -1 && args.length > ignorePatternIndex + 1) {\n ignorePattern = args[ignorePatternIndex + 1];\n }\n const gitignore = args.includes('--gitignore');\n const noGitignore = args.includes('--no-gitignore');\n\n if (!transformFile \|\| !transformFiles.includes(transformFile)) {\n throw new Error('Invalid transform file specified.');\n }\n if (!targetPath) {\n throw new Error('Target path cannot be empty.');\n }\n\n // If both --gitignore and --no-gitignore are specified, prioritize --gitignore\n const useGitignore = !!(gitignore \|\| (!gitignore && !noGitignore));\n\n return { transformFile, targetPath, dry, print, ignorePattern, gitignore: useGitignore };\n }\n\n const transformFile = await list({\n message: 'Select a codemod transform to run:',\n choices: transformFiles.map((file) => ({ name: file, value: file })),\n });\n\n const targetPath = await input({\n message: 'Enter the target directory or file path to run codemod on:',\n validate: (value) => value.trim() !== '' \|\| 'Target path cannot be empty',\n });\n\n const dry = await confirm({\n message: 'Run in dry mode (no changes written to files)?',\n default: true,\n });\n\n const print = await confirm({\n message: 'Print transformed source to console?',\n default: false,\n });\n\n const ignorePattern = await input({\n message: 'Enter ignore pattern(s) (comma separated) or leave empty:',\n validate: (value) => true,\n });\n\n const gitignore = await confirm({\n message: 'Respect .gitignore files?',\n default: true,\n });\n\n return { transformFile, targetPath, dry, print, ignorePattern, gitignore };\n}\n\nexport default getOptions;\n","import { promises as fs } from 'fs';\nimport path from 'path';\n\ninterface TransformModule {\n default: {\n default: unknown;\n };\n}\n\nasync function loadTransformModules(transformsDir: string) {\n let transformModules: Record<string, unknown> = {};\n\n const files = await fs.readdir(transformsDir);\n const transformFiles = await Promise.all(\n files\n .filter((file) => file.endsWith('.js'))\n .map(async (file) => {\n const transformPath = path.join(transformsDir, file);\n const transformModule = (await import(transformPath)) as TransformModule;\n transformModules = { ...transformModules, [file]: transformModule.default.default };\n return file.replace('.js', '');\n }),\n );\n\n return { transformModules, transformFiles };\n}\n\nexport default loadTransformModules;\n","'use strict'\r\n\r\nmodule.exports = {\r\n\t\"aliceblue\": [240, 248, 255],\r\n\t\"antiquewhite\": [250, 235, 215],\r\n\t\"aqua\": [0, 255, 255],\r\n\t\"aquamarine\": [127, 255, 212],\r\n\t\"azure\": [240, 255, 255],\r\n\t\"beige\": [245, 245, 220],\r\n\t\"bisque\": [255, 228, 196],\r\n\t\"black\": [0, 0, 0],\r\n\t\"blanchedalmond\": [255, 235, 205],\r\n\t\"blue\": [0, 0, 255],\r\n\t\"blueviolet\": [138, 43, 226],\r\n\t\"brown\": [165, 42, 42],\r\n\t\"burlywood\": [222, 184, 135],\r\n\t\"cadetblue\": [95, 158, 160],\r\n\t\"chartreuse\": [127, 255, 0],\r\n\t\"chocolate\": [210, 105, 30],\r\n\t\"coral\": [255, 127, 80],\r\n\t\"cornflowerblue\": [100, 149, 237],\r\n\t\"cornsilk\": [255, 248, 220],\r\n\t\"crimson\": [220, 20, 60],\r\n\t\"cyan\": [0, 255, 255],\r\n\t\"darkblue\": [0, 0, 139],\r\n\t\"darkcyan\": [0, 139, 139],\r\n\t\"darkgoldenrod\": [184, 134, 11],\r\n\t\"darkgray\": [169, 169, 169],\r\n\t\"darkgreen\": [0, 100, 0],\r\n\t\"darkgrey\": [169, 169, 169],\r\n\t\"darkkhaki\": [189, 183, 107],\r\n\t\"darkmagenta\": [139, 0, 139],\r\n\t\"darkolivegreen\": [85, 107, 47],\r\n\t\"darkorange\": [255, 140, 0],\r\n\t\"darkorchid\": [153, 50, 204],\r\n\t\"darkred\": [139, 0, 0],\r\n\t\"darksalmon\": [233, 150, 122],\r\n\t\"darkseagreen\": [143, 188, 143],\r\n\t\"darkslateblue\": [72, 61, 139],\r\n\t\"darkslategray\": [47, 79, 79],\r\n\t\"darkslategrey\": [47, 79, 79],\r\n\t\"darkturquoise\": [0, 206, 209],\r\n\t\"darkviolet\": [148, 0, 211],\r\n\t\"deeppink\": [255, 20, 147],\r\n\t\"deepskyblue\": [0, 191, 255],\r\n\t\"dimgray\": [105, 105, 105],\r\n\t\"dimgrey\": [105, 105, 105],\r\n\t\"dodgerblue\": [30, 144, 255],\r\n\t\"firebrick\": [178, 34, 34],\r\n\t\"floralwhite\": [255, 250, 240],\r\n\t\"forestgreen\": [34, 139, 34],\r\n\t\"fuchsia\": [255, 0, 255],\r\n\t\"gainsboro\": [220, 220, 220],\r\n\t\"ghostwhite\": [248, 248, 255],\r\n\t\"gold\": [255, 215, 0],\r\n\t\"goldenrod\": [218, 165, 32],\r\n\t\"gray\": [128, 128, 128],\r\n\t\"green\": [0, 128, 0],\r\n\t\"greenyellow\": [173, 255, 47],\r\n\t\"grey\": [128, 128, 128],\r\n\t\"honeydew\": [240, 255, 240],\r\n\t\"hotpink\": [255, 105, 180],\r\n\t\"indianred\": [205, 92, 92],\r\n\t\"indigo\": [75, 0, 130],\r\n\t\"ivory\": [255, 255, 240],\r\n\t\"khaki\": [240, 230, 140],\r\n\t\"lavender\": [230, 230, 250],\r\n\t\"lavenderblush\": [255, 240, 245],\r\n\t\"lawngreen\": [124, 252, 0],\r\n\t\"lemonchiffon\": [255, 250, 205],\r\n\t\"lightblue\": [173, 216, 230],\r\n\t\"lightcoral\": [240, 128, 128],\r\n\t\"lightcyan\": [224, 255, 255],\r\n\t\"lightgoldenrodyellow\": [250, 250, 210],\r\n\t\"lightgray\": [211, 211, 211],\r\n\t\"lightgreen\": [144, 238, 144],\r\n\t\"lightgrey\": [211, 211, 211],\r\n\t\"lightpink\": [255, 182, 193],\r\n\t\"lightsalmon\": [255, 160, 122],\r\n\t\"lightseagreen\": [32, 178, 170],\r\n\t\"lightskyblue\": [135, 206, 250],\r\n\t\"lightslategray\": [119, 136, 153],\r\n\t\"lightslategrey\": [119, 136, 153],\r\n\t\"lightsteelblue\": [176, 196, 222],\r\n\t\"lightyellow\": [255, 255, 224],\r\n\t\"lime\": [0, 255, 0],\r\n\t\"limegreen\": [50, 205, 50],\r\n\t\"linen\": [250, 240, 230],\r\n\t\"magenta\": [255, 0, 255],\r\n\t\"maroon\": [128, 0, 0],\r\n\t\"mediumaquamarine\": [102, 205, 170],\r\n\t\"mediumblue\": [0, 0, 205],\r\n\t\"mediumorchid\": [186, 85, 211],\r\n\t\"mediumpurple\": [147, 112, 219],\r\n\t\"mediumseagreen\": [60, 179, 113],\r\n\t\"mediumslateblue\": [123, 104, 238],\r\n\t\"mediumspringgreen\": [0, 250, 154],\r\n\t\"mediumturquoise\": [72, 209, 204],\r\n\t\"mediumvioletred\": [199, 21, 133],\r\n\t\"midnightblue\": [25, 25, 112],\r\n\t\"mintcream\": [245, 255, 250],\r\n\t\"mistyrose\": [255, 228, 225],\r\n\t\"moccasin\": [255, 228, 181],\r\n\t\"navajowhite\": [255, 222, 173],\r\n\t\"navy\": [0, 0, 128],\r\n\t\"oldlace\": [253, 245, 230],\r\n\t\"olive\": [128, 128, 0],\r\n\t\"olivedrab\": [107, 142, 35],\r\n\t\"orange\": [255, 165, 0],\r\n\t\"orangered\": [255, 69, 0],\r\n\t\"orchid\": [218, 112, 214],\r\n\t\"palegoldenrod\": [238, 232, 170],\r\n\t\"palegreen\": [152, 251, 152],\r\n\t\"paleturquoise\": [175, 238, 238],\r\n\t\"palevioletred\": [219, 112, 147],\r\n\t\"papayawhip\": [255, 239, 213],\r\n\t\"peachpuff\": [255, 218, 185],\r\n\t\"peru\": [205, 133, 63],\r\n\t\"pink\": [255, 192, 203],\r\n\t\"plum\": [221, 160, 221],\r\n\t\"powderblue\": [176, 224, 230],\r\n\t\"purple\": [128, 0, 128],\r\n\t\"rebeccapurple\": [102, 51, 153],\r\n\t\"red\": [255, 0, 0],\r\n\t\"rosybrown\": [188, 143, 143],\r\n\t\"royalblue\": [65, 105, 225],\r\n\t\"saddlebrown\": [139, 69, 19],\r\n\t\"salmon\": [250, 128, 114],\r\n\t\"sandybrown\": [244, 164, 96],\r\n\t\"seagreen\": [46, 139, 87],\r\n\t\"seashell\": [255, 245, 238],\r\n\t\"sienna\": [160, 82, 45],\r\n\t\"silver\": [192, 192, 192],\r\n\t\"skyblue\": [135, 206, 235],\r\n\t\"slateblue\": [106, 90, 205],\r\n\t\"slategray\": [112, 128, 144],\r\n\t\"slategrey\": [112, 128, 144],\r\n\t\"snow\": [255, 250, 250],\r\n\t\"springgreen\": [0, 255, 127],\r\n\t\"steelblue\": [70, 130, 180],\r\n\t\"tan\": [210, 180, 140],\r\n\t\"teal\": [0, 128, 128],\r\n\t\"thistle\": [216, 191, 216],\r\n\t\"tomato\": [255, 99, 71],\r\n\t\"turquoise\": [64, 224, 208],\r\n\t\"violet\": [238, 130, 238],\r\n\t\"wheat\": [245, 222, 179],\r\n\t\"white\": [255, 255, 255],\r\n\t\"whitesmoke\": [245, 245, 245],\r\n\t\"yellow\": [255, 255, 0],\r\n\t\"yellowgreen\": [154, 205, 50]\r\n};\r\n","/* MIT license /\n/ eslint-disable no-mixed-operators /\nconst cssKeywords = require('color-name');\n\n// NOTE: conversions should only return primitive values (i.e. arrays, or\n// values that give correct `typeof` results).\n// do not use box values types (i.e. Number(), String(), etc.)\n\nconst reverseKeywords = {};\nfor (const key of Object.keys(cssKeywords)) {\n\treverseKeywords[cssKeywords[key]] = key;\n}\n\nconst convert = {\n\trgb: {channels: 3, labels: 'rgb'},\n\thsl: {channels: 3, labels: 'hsl'},\n\thsv: {channels: 3, labels: 'hsv'},\n\thwb: {channels: 3, labels: 'hwb'},\n\tcmyk: {channels: 4, labels: 'cmyk'},\n\txyz: {channels: 3, labels: 'xyz'},\n\tlab: {channels: 3, labels: 'lab'},\n\tlch: {channels: 3, labels: 'lch'},\n\thex: {channels: 1, labels: ['hex']},\n\tkeyword: {channels: 1, labels: ['keyword']},\n\tansi16: {channels: 1, labels: ['ansi16']},\n\tansi256: {channels: 1, labels: ['ansi256']},\n\thcg: {channels: 3, labels: ['h', 'c', 'g']},\n\tapple: {channels: 3, labels: ['r16', 'g16', 'b16']},\n\tgray: {channels: 1, labels: ['gray']}\n};\n\nmodule.exports = convert;\n\n// Hide .channels and .labels properties\nfor (const model of Object.keys(convert)) {\n\tif (!('channels' in convert[model])) {\n\t\tthrow new Error('missing channels property: ' + model);\n\t}\n\n\tif (!('labels' in convert[model])) {\n\t\tthrow new Error('missing channel labels property: ' + model);\n\t}\n\n\tif (convert[model].labels.length !== convert[model].channels) {\n\t\tthrow new Error('channel and label counts mismatch: ' + model);\n\t}\n\n\tconst {channels, labels} = convert[model];\n\tdelete convert[model].channels;\n\tdelete convert[model].labels;\n\tObject.defineProperty(convert[model], 'channels', {value: channels});\n\tObject.defineProperty(convert[model], 'labels', {value: labels});\n}\n\nconvert.rgb.hsl = function (rgb) {\n\tconst r = rgb[0] / 255;\n\tconst g = rgb[1] / 255;\n\tconst b = rgb[2] / 255;\n\tconst min = Math.min(r, g, b);\n\tconst max = Math.max(r, g, b);\n\tconst delta = max - min;\n\tlet h;\n\tlet s;\n\n\tif (max === min) {\n\t\th = 0;\n\t} else if (r === max) {\n\t\th = (g - b) / delta;\n\t} else if (g === max) {\n\t\th = 2 + (b - r) / delta;\n\t} else if (b === max) {\n\t\th = 4 + (r - g) / delta;\n\t}\n\n\th = Math.min(h 60, 360);\n\n\tif (h < 0) {\n\t\th += 360;\n\t}\n\n\tconst l = (min + max) / 2;\n\n\tif (max === min) {\n\t\ts = 0;\n\t} else if (l <= 0.5) {\n\t\ts = delta / (max + min);\n\t} else {\n\t\ts = delta / (2 - max - min);\n\t}\n\n\treturn [h, s * 100, l * 100];\n};\n\nconvert.rgb.hsv = function (rgb) {\n\tlet rdif;\n\tlet gdif;\n\tlet bdif;\n\tlet h;\n\tlet s;\n\n\tconst r = rgb[0] / 255;\n\tconst g = rgb[1] / 255;\n\tconst b = rgb[2] / 255;\n\tconst v = Math.max(r, g, b);\n\tconst diff = v - Math.min(r, g, b);\n\tconst diffc = function (c) {\n\t\treturn (v - c) / 6 / diff + 1 / 2;\n\t};\n\n\tif (diff === 0) {\n\t\th = 0;\n\t\ts = 0;\n\t} else {\n\t\ts = diff / v;\n\t\trdif = diffc(r);\n\t\tgdif = diffc(g);\n\t\tbdif = diffc(b);\n\n\t\tif (r === v) {\n\t\t\th = bdif - gdif;\n\t\t} else if (g === v) {\n\t\t\th = (1 / 3) + rdif - bdif;\n\t\t} else if (b === v) {\n\t\t\th = (2 / 3) + gdif - rdif;\n\t\t}\n\n\t\tif (h < 0) {\n\t\t\th += 1;\n\t\t} else if (h > 1) {\n\t\t\th -= 1;\n\t\t}\n\t}\n\n\treturn [\n\t\th * 360,\n\t\ts * 100,\n\t\tv * 100\n\t];\n};\n\nconvert.rgb.hwb = function (rgb) {\n\tconst r = rgb[0];\n\tconst g = rgb[1];\n\tlet b = rgb[2];\n\tconst h = convert.rgb.hsl(rgb)[0];\n\tconst w = 1 / 255 * Math.min(r, Math.min(g, b));\n\n\tb = 1 - 1 / 255 * Math.max(r, Math.max(g, b));\n\n\treturn [h, w * 100, b * 100];\n};\n\nconvert.rgb.cmyk = function (rgb) {\n\tconst r = rgb[0] / 255;\n\tconst g = rgb[1] / 255;\n\tconst b = rgb[2] / 255;\n\n\tconst k = Math.min(1 - r, 1 - g, 1 - b);\n\tconst c = (1 - r - k) / (1 - k) \|\| 0;\n\tconst m = (1 - g - k) / (1 - k) \|\| 0;\n\tconst y = (1 - b - k) / (1 - k) \|\| 0;\n\n\treturn [c * 100, m * 100, y * 100, k * 100];\n};\n\nfunction comparativeDistance(x, y) {\n\t/\n\t\tSee https://en.m.wikipedia.org/wiki/Euclidean_distance#Squared_Euclidean_distance\n\t/\n\treturn (\n\t\t((x[0] - y[0]) 2) +\n\t\t((x[1] - y[1]) 2) +\n\t\t((x[2] - y[2]) 2)\n\t);\n}\n\nconvert.rgb.keyword = function (rgb) {\n\tconst reversed = reverseKeywords[rgb];\n\tif (reversed) {\n\t\treturn reversed;\n\t}\n\n\tlet currentClosestDistance = Infinity;\n\tlet currentClosestKeyword;\n\n\tfor (const keyword of Object.keys(cssKeywords)) {\n\t\tconst value = cssKeywords[keyword];\n\n\t\t// Compute comparative distance\n\t\tconst distance = comparativeDistance(rgb, value);\n\n\t\t// Check if its less, if so set as closest\n\t\tif (distance < currentClosestDistance) {\n\t\t\tcurrentClosestDistance = distance;\n\t\t\tcurrentClosestKeyword = keyword;\n\t\t}\n\t}\n\n\treturn currentClosestKeyword;\n};\n\nconvert.keyword.rgb = function (keyword) {\n\treturn cssKeywords[keyword];\n};\n\nconvert.rgb.xyz = function (rgb) {\n\tlet r = rgb[0] / 255;\n\tlet g = rgb[1] / 255;\n\tlet b = rgb[2] / 255;\n\n\t// Assume sRGB\n\tr = r > 0.04045 ? (((r + 0.055) / 1.055) 2.4) : (r / 12.92);\n\tg = g > 0.04045 ? (((g + 0.055) / 1.055) 2.4) : (g / 12.92);\n\tb = b > 0.04045 ? (((b + 0.055) / 1.055) 2.4) : (b / 12.92);\n\n\tconst x = (r * 0.4124) + (g * 0.3576) + (b * 0.1805);\n\tconst y = (r * 0.2126) + (g * 0.7152) + (b * 0.0722);\n\tconst z = (r * 0.0193) + (g * 0.1192) + (b * 0.9505);\n\n\treturn [x * 100, y * 100, z * 100];\n};\n\nconvert.rgb.lab = function (rgb) {\n\tconst xyz = convert.rgb.xyz(rgb);\n\tlet x = xyz[0];\n\tlet y = xyz[1];\n\tlet z = xyz[2];\n\n\tx /= 95.047;\n\ty /= 100;\n\tz /= 108.883;\n\n\tx = x > 0.008856 ? (x ** (1 / 3)) : (7.787 * x) + (16 / 116);\n\ty = y > 0.008856 ? (y ** (1 / 3)) : (7.787 * y) + (16 / 116);\n\tz = z > 0.008856 ? (z ** (1 / 3)) : (7.787 * z) + (16 / 116);\n\n\tconst l = (116 * y) - 16;\n\tconst a = 500 * (x - y);\n\tconst b = 200 * (y - z);\n\n\treturn [l, a, b];\n};\n\nconvert.hsl.rgb = function (hsl) {\n\tconst h = hsl[0] / 360;\n\tconst s = hsl[1] / 100;\n\tconst l = hsl[2] / 100;\n\tlet t2;\n\tlet t3;\n\tlet val;\n\n\tif (s === 0) {\n\t\tval = l * 255;\n\t\treturn [val, val, val];\n\t}\n\n\tif (l < 0.5) {\n\t\tt2 = l * (1 + s);\n\t} else {\n\t\tt2 = l + s - l * s;\n\t}\n\n\tconst t1 = 2 * l - t2;\n\n\tconst rgb = [0, 0, 0];\n\tfor (let i = 0; i < 3; i++) {\n\t\tt3 = h + 1 / 3 * -(i - 1);\n\t\tif (t3 < 0) {\n\t\t\tt3++;\n\t\t}\n\n\t\tif (t3 > 1) {\n\t\t\tt3--;\n\t\t}\n\n\t\tif (6 * t3 < 1) {\n\t\t\tval = t1 + (t2 - t1) * 6 * t3;\n\t\t} else if (2 * t3 < 1) {\n\t\t\tval = t2;\n\t\t} else if (3 * t3 < 2) {\n\t\t\tval = t1 + (t2 - t1) * (2 / 3 - t3) * 6;\n\t\t} else {\n\t\t\tval = t1;\n\t\t}\n\n\t\trgb[i] = val * 255;\n\t}\n\n\treturn rgb;\n};\n\nconvert.hsl.hsv = function (hsl) {\n\tconst h = hsl[0];\n\tlet s = hsl[1] / 100;\n\tlet l = hsl[2] / 100;\n\tlet smin = s;\n\tconst lmin = Math.max(l, 0.01);\n\n\tl = 2;\n\ts = (l <= 1) ? l : 2 - l;\n\tsmin = lmin <= 1 ? lmin : 2 - lmin;\n\tconst v = (l + s) / 2;\n\tconst sv = l === 0 ? (2 smin) / (lmin + smin) : (2 * s) / (l + s);\n\n\treturn [h, sv * 100, v * 100];\n};\n\nconvert.hsv.rgb = function (hsv) {\n\tconst h = hsv[0] / 60;\n\tconst s = hsv[1] / 100;\n\tlet v = hsv[2] / 100;\n\tconst hi = Math.floor(h) % 6;\n\n\tconst f = h - Math.floor(h);\n\tconst p = 255 * v * (1 - s);\n\tconst q = 255 * v * (1 - (s * f));\n\tconst t = 255 * v * (1 - (s * (1 - f)));\n\tv = 255;\n\n\tswitch (hi) {\n\t\tcase 0:\n\t\t\treturn [v, t, p];\n\t\tcase 1:\n\t\t\treturn [q, v, p];\n\t\tcase 2:\n\t\t\treturn [p, v, t];\n\t\tcase 3:\n\t\t\treturn [p, q, v];\n\t\tcase 4:\n\t\t\treturn [t, p, v];\n\t\tcase 5:\n\t\t\treturn [v, p, q];\n\t}\n};\n\nconvert.hsv.hsl = function (hsv) {\n\tconst h = hsv[0];\n\tconst s = hsv[1] / 100;\n\tconst v = hsv[2] / 100;\n\tconst vmin = Math.max(v, 0.01);\n\tlet sl;\n\tlet l;\n\n\tl = (2 - s) v;\n\tconst lmin = (2 - s) * vmin;\n\tsl = s * vmin;\n\tsl /= (lmin <= 1) ? lmin : 2 - lmin;\n\tsl = sl \|\| 0;\n\tl /= 2;\n\n\treturn [h, sl * 100, l * 100];\n};\n\n// http://dev.w3.org/csswg/css-color/#hwb-to-rgb\nconvert.hwb.rgb = function (hwb) {\n\tconst h = hwb[0] / 360;\n\tlet wh = hwb[1] / 100;\n\tlet bl = hwb[2] / 100;\n\tconst ratio = wh + bl;\n\tlet f;\n\n\t// Wh + bl cant be > 1\n\tif (ratio > 1) {\n\t\twh /= ratio;\n\t\tbl /= ratio;\n\t}\n\n\tconst i = Math.floor(6 * h);\n\tconst v = 1 - bl;\n\tf = 6 * h - i;\n\n\tif ((i & 0x01) !== 0) {\n\t\tf = 1 - f;\n\t}\n\n\tconst n = wh + f * (v - wh); // Linear interpolation\n\n\tlet r;\n\tlet g;\n\tlet b;\n\t/* eslint-disable max-statements-per-line,no-multi-spaces /\n\tswitch (i) {\n\t\tdefault:\n\t\tcase 6:\n\t\tcase 0: r = v; g = n; b = wh; break;\n\t\tcase 1: r = n; g = v; b = wh; break;\n\t\tcase 2: r = wh; g = v; b = n; break;\n\t\tcase 3: r = wh; g = n; b = v; break;\n\t\tcase 4: r = n; g = wh; b = v; break;\n\t\tcase 5: r = v; g = wh; b = n; break;\n\t}\n\t/ eslint-enable max-statements-per-line,no-multi-spaces /\n\n\treturn [r 255, g * 255, b * 255];\n};\n\nconvert.cmyk.rgb = function (cmyk) {\n\tconst c = cmyk[0] / 100;\n\tconst m = cmyk[1] / 100;\n\tconst y = cmyk[2] / 100;\n\tconst k = cmyk[3] / 100;\n\n\tconst r = 1 - Math.min(1, c * (1 - k) + k);\n\tconst g = 1 - Math.min(1, m * (1 - k) + k);\n\tconst b = 1 - Math.min(1, y * (1 - k) + k);\n\n\treturn [r * 255, g * 255, b * 255];\n};\n\nconvert.xyz.rgb = function (xyz) {\n\tconst x = xyz[0] / 100;\n\tconst y = xyz[1] / 100;\n\tconst z = xyz[2] / 100;\n\tlet r;\n\tlet g;\n\tlet b;\n\n\tr = (x * 3.2406) + (y * -1.5372) + (z * -0.4986);\n\tg = (x * -0.9689) + (y * 1.8758) + (z * 0.0415);\n\tb = (x * 0.0557) + (y * -0.2040) + (z * 1.0570);\n\n\t// Assume sRGB\n\tr = r > 0.0031308\n\t\t? ((1.055 * (r ** (1.0 / 2.4))) - 0.055)\n\t\t: r * 12.92;\n\n\tg = g > 0.0031308\n\t\t? ((1.055 * (g ** (1.0 / 2.4))) - 0.055)\n\t\t: g * 12.92;\n\n\tb = b > 0.0031308\n\t\t? ((1.055 * (b ** (1.0 / 2.4))) - 0.055)\n\t\t: b * 12.92;\n\n\tr = Math.min(Math.max(0, r), 1);\n\tg = Math.min(Math.max(0, g), 1);\n\tb = Math.min(Math.max(0, b), 1);\n\n\treturn [r * 255, g * 255, b * 255];\n};\n\nconvert.xyz.lab = function (xyz) {\n\tlet x = xyz[0];\n\tlet y = xyz[1];\n\tlet z = xyz[2];\n\n\tx /= 95.047;\n\ty /= 100;\n\tz /= 108.883;\n\n\tx = x > 0.008856 ? (x ** (1 / 3)) : (7.787 * x) + (16 / 116);\n\ty = y > 0.008856 ? (y ** (1 / 3)) : (7.787 * y) + (16 / 116);\n\tz = z > 0.008856 ? (z ** (1 / 3)) : (7.787 * z) + (16 / 116);\n\n\tconst l = (116 * y) - 16;\n\tconst a = 500 * (x - y);\n\tconst b = 200 * (y - z);\n\n\treturn [l, a, b];\n};\n\nconvert.lab.xyz = function (lab) {\n\tconst l = lab[0];\n\tconst a = lab[1];\n\tconst b = lab[2];\n\tlet x;\n\tlet y;\n\tlet z;\n\n\ty = (l + 16) / 116;\n\tx = a / 500 + y;\n\tz = y - b / 200;\n\n\tconst y2 = y 3;\n\tconst x2 = x 3;\n\tconst z2 = z ** 3;\n\ty = y2 > 0.008856 ? y2 : (y - 16 / 116) / 7.787;\n\tx = x2 > 0.008856 ? x2 : (x - 16 / 116) / 7.787;\n\tz = z2 > 0.008856 ? z2 : (z - 16 / 116) / 7.787;\n\n\tx = 95.047;\n\ty = 100;\n\tz = 108.883;\n\n\treturn [x, y, z];\n};\n\nconvert.lab.lch = function (lab) {\n\tconst l = lab[0];\n\tconst a = lab[1];\n\tconst b = lab[2];\n\tlet h;\n\n\tconst hr = Math.atan2(b, a);\n\th = hr 360 / 2 / Math.PI;\n\n\tif (h < 0) {\n\t\th += 360;\n\t}\n\n\tconst c = Math.sqrt(a * a + b * b);\n\n\treturn [l, c, h];\n};\n\nconvert.lch.lab = function (lch) {\n\tconst l = lch[0];\n\tconst c = lch[1];\n\tconst h = lch[2];\n\n\tconst hr = h / 360 * 2 * Math.PI;\n\tconst a = c * Math.cos(hr);\n\tconst b = c * Math.sin(hr);\n\n\treturn [l, a, b];\n};\n\nconvert.rgb.ansi16 = function (args, saturation = null) {\n\tconst [r, g, b] = args;\n\tlet value = saturation === null ? convert.rgb.hsv(args)[2] : saturation; // Hsv -> ansi16 optimization\n\n\tvalue = Math.round(value / 50);\n\n\tif (value === 0) {\n\t\treturn 30;\n\t}\n\n\tlet ansi = 30\n\t\t+ ((Math.round(b / 255) << 2)\n\t\t\| (Math.round(g / 255) << 1)\n\t\t\| Math.round(r / 255));\n\n\tif (value === 2) {\n\t\tansi += 60;\n\t}\n\n\treturn ansi;\n};\n\nconvert.hsv.ansi16 = function (args) {\n\t// Optimization here; we already know the value and don't need to get\n\t// it converted for us.\n\treturn convert.rgb.ansi16(convert.hsv.rgb(args), args[2]);\n};\n\nconvert.rgb.ansi256 = function (args) {\n\tconst r = args[0];\n\tconst g = args[1];\n\tconst b = args[2];\n\n\t// We use the extended greyscale palette here, with the exception of\n\t// black and white. normal palette only has 4 greyscale shades.\n\tif (r === g && g === b) {\n\t\tif (r < 8) {\n\t\t\treturn 16;\n\t\t}\n\n\t\tif (r > 248) {\n\t\t\treturn 231;\n\t\t}\n\n\t\treturn Math.round(((r - 8) / 247) * 24) + 232;\n\t}\n\n\tconst ansi = 16\n\t\t+ (36 * Math.round(r / 255 * 5))\n\t\t+ (6 * Math.round(g / 255 * 5))\n\t\t+ Math.round(b / 255 * 5);\n\n\treturn ansi;\n};\n\nconvert.ansi16.rgb = function (args) {\n\tlet color = args % 10;\n\n\t// Handle greyscale\n\tif (color === 0 \|\| color === 7) {\n\t\tif (args > 50) {\n\t\t\tcolor += 3.5;\n\t\t}\n\n\t\tcolor = color / 10.5 * 255;\n\n\t\treturn [color, color, color];\n\t}\n\n\tconst mult = (~~(args > 50) + 1) * 0.5;\n\tconst r = ((color & 1) * mult) * 255;\n\tconst g = (((color >> 1) & 1) * mult) * 255;\n\tconst b = (((color >> 2) & 1) * mult) * 255;\n\n\treturn [r, g, b];\n};\n\nconvert.ansi256.rgb = function (args) {\n\t// Handle greyscale\n\tif (args >= 232) {\n\t\tconst c = (args - 232) * 10 + 8;\n\t\treturn [c, c, c];\n\t}\n\n\targs -= 16;\n\n\tlet rem;\n\tconst r = Math.floor(args / 36) / 5 * 255;\n\tconst g = Math.floor((rem = args % 36) / 6) / 5 * 255;\n\tconst b = (rem % 6) / 5 * 255;\n\n\treturn [r, g, b];\n};\n\nconvert.rgb.hex = function (args) {\n\tconst integer = ((Math.round(args[0]) & 0xFF) << 16)\n\t\t+ ((Math.round(args[1]) & 0xFF) << 8)\n\t\t+ (Math.round(args[2]) & 0xFF);\n\n\tconst string = integer.toString(16).toUpperCase();\n\treturn '000000'.substring(string.length) + string;\n};\n\nconvert.hex.rgb = function (args) {\n\tconst match = args.toString(16).match(/[a-f0-9]{6}\|[a-f0-9]{3}/i);\n\tif (!match) {\n\t\treturn [0, 0, 0];\n\t}\n\n\tlet colorString = match[0];\n\n\tif (match[0].length === 3) {\n\t\tcolorString = colorString.split('').map(char => {\n\t\t\treturn char + char;\n\t\t}).join('');\n\t}\n\n\tconst integer = parseInt(colorString, 16);\n\tconst r = (integer >> 16) & 0xFF;\n\tconst g = (integer >> 8) & 0xFF;\n\tconst b = integer & 0xFF;\n\n\treturn [r, g, b];\n};\n\nconvert.rgb.hcg = function (rgb) {\n\tconst r = rgb[0] / 255;\n\tconst g = rgb[1] / 255;\n\tconst b = rgb[2] / 255;\n\tconst max = Math.max(Math.max(r, g), b);\n\tconst min = Math.min(Math.min(r, g), b);\n\tconst chroma = (max - min);\n\tlet grayscale;\n\tlet hue;\n\n\tif (chroma < 1) {\n\t\tgrayscale = min / (1 - chroma);\n\t} else {\n\t\tgrayscale = 0;\n\t}\n\n\tif (chroma <= 0) {\n\t\thue = 0;\n\t} else\n\tif (max === r) {\n\t\thue = ((g - b) / chroma) % 6;\n\t} else\n\tif (max === g) {\n\t\thue = 2 + (b - r) / chroma;\n\t} else {\n\t\thue = 4 + (r - g) / chroma;\n\t}\n\n\thue /= 6;\n\thue %= 1;\n\n\treturn [hue * 360, chroma * 100, grayscale * 100];\n};\n\nconvert.hsl.hcg = function (hsl) {\n\tconst s = hsl[1] / 100;\n\tconst l = hsl[2] / 100;\n\n\tconst c = l < 0.5 ? (2.0 * s * l) : (2.0 * s * (1.0 - l));\n\n\tlet f = 0;\n\tif (c < 1.0) {\n\t\tf = (l - 0.5 * c) / (1.0 - c);\n\t}\n\n\treturn [hsl[0], c * 100, f * 100];\n};\n\nconvert.hsv.hcg = function (hsv) {\n\tconst s = hsv[1] / 100;\n\tconst v = hsv[2] / 100;\n\n\tconst c = s * v;\n\tlet f = 0;\n\n\tif (c < 1.0) {\n\t\tf = (v - c) / (1 - c);\n\t}\n\n\treturn [hsv[0], c * 100, f * 100];\n};\n\nconvert.hcg.rgb = function (hcg) {\n\tconst h = hcg[0] / 360;\n\tconst c = hcg[1] / 100;\n\tconst g = hcg[2] / 100;\n\n\tif (c === 0.0) {\n\t\treturn [g * 255, g * 255, g * 255];\n\t}\n\n\tconst pure = [0, 0, 0];\n\tconst hi = (h % 1) * 6;\n\tconst v = hi % 1;\n\tconst w = 1 - v;\n\tlet mg = 0;\n\n\t/* eslint-disable max-statements-per-line /\n\tswitch (Math.floor(hi)) {\n\t\tcase 0:\n\t\t\tpure[0] = 1; pure[1] = v; pure[2] = 0; break;\n\t\tcase 1:\n\t\t\tpure[0] = w; pure[1] = 1; pure[2] = 0; break;\n\t\tcase 2:\n\t\t\tpure[0] = 0; pure[1] = 1; pure[2] = v; break;\n\t\tcase 3:\n\t\t\tpure[0] = 0; pure[1] = w; pure[2] = 1; break;\n\t\tcase 4:\n\t\t\tpure[0] = v; pure[1] = 0; pure[2] = 1; break;\n\t\tdefault:\n\t\t\tpure[0] = 1; pure[1] = 0; pure[2] = w;\n\t}\n\t/ eslint-enable max-statements-per-line /\n\n\tmg = (1.0 - c) g;\n\n\treturn [\n\t\t(c * pure[0] + mg) * 255,\n\t\t(c * pure[1] + mg) * 255,\n\t\t(c * pure[2] + mg) * 255\n\t];\n};\n\nconvert.hcg.hsv = function (hcg) {\n\tconst c = hcg[1] / 100;\n\tconst g = hcg[2] / 100;\n\n\tconst v = c + g * (1.0 - c);\n\tlet f = 0;\n\n\tif (v > 0.0) {\n\t\tf = c / v;\n\t}\n\n\treturn [hcg[0], f * 100, v * 100];\n};\n\nconvert.hcg.hsl = function (hcg) {\n\tconst c = hcg[1] / 100;\n\tconst g = hcg[2] / 100;\n\n\tconst l = g * (1.0 - c) + 0.5 * c;\n\tlet s = 0;\n\n\tif (l > 0.0 && l < 0.5) {\n\t\ts = c / (2 * l);\n\t} else\n\tif (l >= 0.5 && l < 1.0) {\n\t\ts = c / (2 * (1 - l));\n\t}\n\n\treturn [hcg[0], s * 100, l * 100];\n};\n\nconvert.hcg.hwb = function (hcg) {\n\tconst c = hcg[1] / 100;\n\tconst g = hcg[2] / 100;\n\tconst v = c + g * (1.0 - c);\n\treturn [hcg[0], (v - c) * 100, (1 - v) * 100];\n};\n\nconvert.hwb.hcg = function (hwb) {\n\tconst w = hwb[1] / 100;\n\tconst b = hwb[2] / 100;\n\tconst v = 1 - b;\n\tconst c = v - w;\n\tlet g = 0;\n\n\tif (c < 1) {\n\t\tg = (v - c) / (1 - c);\n\t}\n\n\treturn [hwb[0], c * 100, g * 100];\n};\n\nconvert.apple.rgb = function (apple) {\n\treturn [(apple[0] / 65535) * 255, (apple[1] / 65535) * 255, (apple[2] / 65535) * 255];\n};\n\nconvert.rgb.apple = function (rgb) {\n\treturn [(rgb[0] / 255) * 65535, (rgb[1] / 255) * 65535, (rgb[2] / 255) * 65535];\n};\n\nconvert.gray.rgb = function (args) {\n\treturn [args[0] / 100 * 255, args[0] / 100 * 255, args[0] / 100 * 255];\n};\n\nconvert.gray.hsl = function (args) {\n\treturn [0, 0, args[0]];\n};\n\nconvert.gray.hsv = convert.gray.hsl;\n\nconvert.gray.hwb = function (gray) {\n\treturn [0, 100, gray[0]];\n};\n\nconvert.gray.cmyk = function (gray) {\n\treturn [0, 0, 0, gray[0]];\n};\n\nconvert.gray.lab = function (gray) {\n\treturn [gray[0], 0, 0];\n};\n\nconvert.gray.hex = function (gray) {\n\tconst val = Math.round(gray[0] / 100 * 255) & 0xFF;\n\tconst integer = (val << 16) + (val << 8) + val;\n\n\tconst string = integer.toString(16).toUpperCase();\n\treturn '000000'.substring(string.length) + string;\n};\n\nconvert.rgb.gray = function (rgb) {\n\tconst val = (rgb[0] + rgb[1] + rgb[2]) / 3;\n\treturn [val / 255 * 100];\n};\n","const conversions = require('./conversions');\n\n/\n\tThis function routes a model to all other models.\n\n\tall functions that are routed have a property `.conversion` attached\n\tto the returned synthetic function. This property is an array\n\tof strings, each with the steps in between the 'from' and 'to'\n\tcolor models (inclusive).\n\n\tconversions that are not possible simply are not included.\n/\n\nfunction buildGraph() {\n\tconst graph = {};\n\t// https://jsperf.com/object-keys-vs-for-in-with-closure/3\n\tconst models = Object.keys(conversions);\n\n\tfor (let len = models.length, i = 0; i < len; i++) {\n\t\tgraph[models[i]] = {\n\t\t\t// http://jsperf.com/1-vs-infinity\n\t\t\t// micro-opt, but this is simple.\n\t\t\tdistance: -1,\n\t\t\tparent: null\n\t\t};\n\t}\n\n\treturn graph;\n}\n\n// https://en.wikipedia.org/wiki/Breadth-first_search\nfunction deriveBFS(fromModel) {\n\tconst graph = buildGraph();\n\tconst queue = [fromModel]; // Unshift -> queue -> pop\n\n\tgraph[fromModel].distance = 0;\n\n\twhile (queue.length) {\n\t\tconst current = queue.pop();\n\t\tconst adjacents = Object.keys(conversions[current]);\n\n\t\tfor (let len = adjacents.length, i = 0; i < len; i++) {\n\t\t\tconst adjacent = adjacents[i];\n\t\t\tconst node = graph[adjacent];\n\n\t\t\tif (node.distance === -1) {\n\t\t\t\tnode.distance = graph[current].distance + 1;\n\t\t\t\tnode.parent = current;\n\t\t\t\tqueue.unshift(adjacent);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn graph;\n}\n\nfunction link(from, to) {\n\treturn function (args) {\n\t\treturn to(from(args));\n\t};\n}\n\nfunction wrapConversion(toModel, graph) {\n\tconst path = [graph[toModel].parent, toModel];\n\tlet fn = conversions[graph[toModel].parent][toModel];\n\n\tlet cur = graph[toModel].parent;\n\twhile (graph[cur].parent) {\n\t\tpath.unshift(graph[cur].parent);\n\t\tfn = link(conversions[graph[cur].parent][cur], fn);\n\t\tcur = graph[cur].parent;\n\t}\n\n\tfn.conversion = path;\n\treturn fn;\n}\n\nmodule.exports = function (fromModel) {\n\tconst graph = deriveBFS(fromModel);\n\tconst conversion = {};\n\n\tconst models = Object.keys(graph);\n\tfor (let len = models.length, i = 0; i < len; i++) {\n\t\tconst toModel = models[i];\n\t\tconst node = graph[toModel];\n\n\t\tif (node.parent === null) {\n\t\t\t// No possible conversion, or this node is the source model.\n\t\t\tcontinue;\n\t\t}\n\n\t\tconversion[toModel] = wrapConversion(toModel, graph);\n\t}\n\n\treturn conversion;\n};\n\n","const conversions = require('./conversions');\nconst route = require('./route');\n\nconst convert = {};\n\nconst models = Object.keys(conversions);\n\nfunction wrapRaw(fn) {\n\tconst wrappedFn = function (...args) {\n\t\tconst arg0 = args[0];\n\t\tif (arg0 === undefined \|\| arg0 === null) {\n\t\t\treturn arg0;\n\t\t}\n\n\t\tif (arg0.length > 1) {\n\t\t\targs = arg0;\n\t\t}\n\n\t\treturn fn(args);\n\t};\n\n\t// Preserve .conversion property if there is one\n\tif ('conversion' in fn) {\n\t\twrappedFn.conversion = fn.conversion;\n\t}\n\n\treturn wrappedFn;\n}\n\nfunction wrapRounded(fn) {\n\tconst wrappedFn = function (...args) {\n\t\tconst arg0 = args[0];\n\n\t\tif (arg0 === undefined \|\| arg0 === null) {\n\t\t\treturn arg0;\n\t\t}\n\n\t\tif (arg0.length > 1) {\n\t\t\targs = arg0;\n\t\t}\n\n\t\tconst result = fn(args);\n\n\t\t// We're assuming the result is an array here.\n\t\t// see notice in conversions.js; don't use box types\n\t\t// in conversion functions.\n\t\tif (typeof result === 'object') {\n\t\t\tfor (let len = result.length, i = 0; i < len; i++) {\n\t\t\t\tresult[i] = Math.round(result[i]);\n\t\t\t}\n\t\t}\n\n\t\treturn result;\n\t};\n\n\t// Preserve .conversion property if there is one\n\tif ('conversion' in fn) {\n\t\twrappedFn.conversion = fn.conversion;\n\t}\n\n\treturn wrappedFn;\n}\n\nmodels.forEach(fromModel => {\n\tconvert[fromModel] = {};\n\n\tObject.defineProperty(convert[fromModel], 'channels', {value: conversions[fromModel].channels});\n\tObject.defineProperty(convert[fromModel], 'labels', {value: conversions[fromModel].labels});\n\n\tconst routes = route(fromModel);\n\tconst routeModels = Object.keys(routes);\n\n\trouteModels.forEach(toModel => {\n\t\tconst fn = routes[toModel];\n\n\t\tconvert[fromModel][toModel] = wrapRounded(fn);\n\t\tconvert[fromModel][toModel].raw = wrapRaw(fn);\n\t});\n});\n\nmodule.exports = convert;\n","'use strict';\n\nconst wrapAnsi16 = (fn, offset) => (...args) => {\n\tconst code = fn(...args);\n\treturn `\\u001B[${code + offset}m`;\n};\n\nconst wrapAnsi256 = (fn, offset) => (...args) => {\n\tconst code = fn(...args);\n\treturn `\\u001B[${38 + offset};5;${code}m`;\n};\n\nconst wrapAnsi16m = (fn, offset) => (...args) => {\n\tconst rgb = fn(...args);\n\treturn `\\u001B[${38 + offset};2;${rgb[0]};${rgb[1]};${rgb[2]}m`;\n};\n\nconst ansi2ansi = n => n;\nconst rgb2rgb = (r, g, b) => [r, g, b];\n\nconst setLazyProperty = (object, property, get) => {\n\tObject.defineProperty(object, property, {\n\t\tget: () => {\n\t\t\tconst value = get();\n\n\t\t\tObject.defineProperty(object, property, {\n\t\t\t\tvalue,\n\t\t\t\tenumerable: true,\n\t\t\t\tconfigurable: true\n\t\t\t});\n\n\t\t\treturn value;\n\t\t},\n\t\tenumerable: true,\n\t\tconfigurable: true\n\t});\n};\n\n/** @type {typeof import('color-convert')} /\nlet colorConvert;\nconst makeDynamicStyles = (wrap, targetSpace, identity, isBackground) => {\n\tif (colorConvert === undefined) {\n\t\tcolorConvert = require('color-convert');\n\t}\n\n\tconst offset = isBackground ? 10 : 0;\n\tconst styles = {};\n\n\tfor (const [sourceSpace, suite] of Object.entries(colorConvert)) {\n\t\tconst name = sourceSpace === 'ansi16' ? 'ansi' : sourceSpace;\n\t\tif (sourceSpace === targetSpace) {\n\t\t\tstyles[name] = wrap(identity, offset);\n\t\t} else if (typeof suite === 'object') {\n\t\t\tstyles[name] = wrap(suite[targetSpace], offset);\n\t\t}\n\t}\n\n\treturn styles;\n};\n\nfunction assembleStyles() {\n\tconst codes = new Map();\n\tconst styles = {\n\t\tmodifier: {\n\t\t\treset: [0, 0],\n\t\t\t// 21 isn't widely supported and 22 does the same thing\n\t\t\tbold: [1, 22],\n\t\t\tdim: [2, 22],\n\t\t\titalic: [3, 23],\n\t\t\tunderline: [4, 24],\n\t\t\tinverse: [7, 27],\n\t\t\thidden: [8, 28],\n\t\t\tstrikethrough: [9, 29]\n\t\t},\n\t\tcolor: {\n\t\t\tblack: [30, 39],\n\t\t\tred: [31, 39],\n\t\t\tgreen: [32, 39],\n\t\t\tyellow: [33, 39],\n\t\t\tblue: [34, 39],\n\t\t\tmagenta: [35, 39],\n\t\t\tcyan: [36, 39],\n\t\t\twhite: [37, 39],\n\n\t\t\t// Bright color\n\t\t\tblackBright: [90, 39],\n\t\t\tredBright: [91, 39],\n\t\t\tgreenBright: [92, 39],\n\t\t\tyellowBright: [93, 39],\n\t\t\tblueBright: [94, 39],\n\t\t\tmagentaBright: [95, 39],\n\t\t\tcyanBright: [96, 39],\n\t\t\twhiteBright: [97, 39]\n\t\t},\n\t\tbgColor: {\n\t\t\tbgBlack: [40, 49],\n\t\t\tbgRed: [41, 49],\n\t\t\tbgGreen: [42, 49],\n\t\t\tbgYellow: [43, 49],\n\t\t\tbgBlue: [44, 49],\n\t\t\tbgMagenta: [45, 49],\n\t\t\tbgCyan: [46, 49],\n\t\t\tbgWhite: [47, 49],\n\n\t\t\t// Bright color\n\t\t\tbgBlackBright: [100, 49],\n\t\t\tbgRedBright: [101, 49],\n\t\t\tbgGreenBright: [102, 49],\n\t\t\tbgYellowBright: [103, 49],\n\t\t\tbgBlueBright: [104, 49],\n\t\t\tbgMagentaBright: [105, 49],\n\t\t\tbgCyanBright: [106, 49],\n\t\t\tbgWhiteBright: [107, 49]\n\t\t}\n\t};\n\n\t// Alias bright black as gray (and grey)\n\tstyles.color.gray = styles.color.blackBright;\n\tstyles.bgColor.bgGray = styles.bgColor.bgBlackBright;\n\tstyles.color.grey = styles.color.blackBright;\n\tstyles.bgColor.bgGrey = styles.bgColor.bgBlackBright;\n\n\tfor (const [groupName, group] of Object.entries(styles)) {\n\t\tfor (const [styleName, style] of Object.entries(group)) {\n\t\t\tstyles[styleName] = {\n\t\t\t\topen: `\\u001B[${style[0]}m`,\n\t\t\t\tclose: `\\u001B[${style[1]}m`\n\t\t\t};\n\n\t\t\tgroup[styleName] = styles[styleName];\n\n\t\t\tcodes.set(style[0], style[1]);\n\t\t}\n\n\t\tObject.defineProperty(styles, groupName, {\n\t\t\tvalue: group,\n\t\t\tenumerable: false\n\t\t});\n\t}\n\n\tObject.defineProperty(styles, 'codes', {\n\t\tvalue: codes,\n\t\tenumerable: false\n\t});\n\n\tstyles.color.close = '\\u001B[39m';\n\tstyles.bgColor.close = '\\u001B[49m';\n\n\tsetLazyProperty(styles.color, 'ansi', () => makeDynamicStyles(wrapAnsi16, 'ansi16', ansi2ansi, false));\n\tsetLazyProperty(styles.color, 'ansi256', () => makeDynamicStyles(wrapAnsi256, 'ansi256', ansi2ansi, false));\n\tsetLazyProperty(styles.color, 'ansi16m', () => makeDynamicStyles(wrapAnsi16m, 'rgb', rgb2rgb, false));\n\tsetLazyProperty(styles.bgColor, 'ansi', () => makeDynamicStyles(wrapAnsi16, 'ansi16', ansi2ansi, true));\n\tsetLazyProperty(styles.bgColor, 'ansi256', () => makeDynamicStyles(wrapAnsi256, 'ansi256', ansi2ansi, true));\n\tsetLazyProperty(styles.bgColor, 'ansi16m', () => makeDynamicStyles(wrapAnsi16m, 'rgb', rgb2rgb, true));\n\n\treturn styles;\n}\n\n// Make the export immutable\nObject.defineProperty(module, 'exports', {\n\tenumerable: true,\n\tget: assembleStyles\n});\n","'use strict';\n\nmodule.exports = (flag, argv = process.argv) => {\n\tconst prefix = flag.startsWith('-') ? '' : (flag.length === 1 ? '-' : '--');\n\tconst position = argv.indexOf(prefix + flag);\n\tconst terminatorPosition = argv.indexOf('--');\n\treturn position !== -1 && (terminatorPosition === -1 \|\| position < terminatorPosition);\n};\n","'use strict';\nconst os = require('os');\nconst tty = require('tty');\nconst hasFlag = require('has-flag');\n\nconst {env} = process;\n\nlet forceColor;\nif (hasFlag('no-color') \|\|\n\thasFlag('no-colors') \|\|\n\thasFlag('color=false') \|\|\n\thasFlag('color=never')) {\n\tforceColor = 0;\n} else if (hasFlag('color') \|\|\n\thasFlag('colors') \|\|\n\thasFlag('color=true') \|\|\n\thasFlag('color=always')) {\n\tforceColor = 1;\n}\n\nif ('FORCE_COLOR' in env) {\n\tif (env.FORCE_COLOR === 'true') {\n\t\tforceColor = 1;\n\t} else if (env.FORCE_COLOR === 'false') {\n\t\tforceColor = 0;\n\t} else {\n\t\tforceColor = env.FORCE_COLOR.length === 0 ? 1 : Math.min(parseInt(env.FORCE_COLOR, 10), 3);\n\t}\n}\n\nfunction translateLevel(level) {\n\tif (level === 0) {\n\t\treturn false;\n\t}\n\n\treturn {\n\t\tlevel,\n\t\thasBasic: true,\n\t\thas256: level >= 2,\n\t\thas16m: level >= 3\n\t};\n}\n\nfunction supportsColor(haveStream, streamIsTTY) {\n\tif (forceColor === 0) {\n\t\treturn 0;\n\t}\n\n\tif (hasFlag('color=16m') \|\|\n\t\thasFlag('color=full') \|\|\n\t\thasFlag('color=truecolor')) {\n\t\treturn 3;\n\t}\n\n\tif (hasFlag('color=256')) {\n\t\treturn 2;\n\t}\n\n\tif (haveStream && !streamIsTTY && forceColor === undefined) {\n\t\treturn 0;\n\t}\n\n\tconst min = forceColor \|\| 0;\n\n\tif (env.TERM === 'dumb') {\n\t\treturn min;\n\t}\n\n\tif (process.platform === 'win32') {\n\t\t// Windows 10 build 10586 is the first Windows release that supports 256 colors.\n\t\t// Windows 10 build 14931 is the first release that supports 16m/TrueColor.\n\t\tconst osRelease = os.release().split('.');\n\t\tif (\n\t\t\tNumber(osRelease[0]) >= 10 &&\n\t\t\tNumber(osRelease[2]) >= 10586\n\t\t) {\n\t\t\treturn Number(osRelease[2]) >= 14931 ? 3 : 2;\n\t\t}\n\n\t\treturn 1;\n\t}\n\n\tif ('CI' in env) {\n\t\tif (['TRAVIS', 'CIRCLECI', 'APPVEYOR', 'GITLAB_CI', 'GITHUB_ACTIONS', 'BUILDKITE'].some(sign => sign in env) \|\| env.CI_NAME === 'codeship') {\n\t\t\treturn 1;\n\t\t}\n\n\t\treturn min;\n\t}\n\n\tif ('TEAMCITY_VERSION' in env) {\n\t\treturn /^(9\\.(0[1-9]\\d)\\.\|\\d{2,}\\.)/.test(env.TEAMCITY_VERSION) ? 1 : 0;\n\t}\n\n\tif (env.COLORTERM === 'truecolor') {\n\t\treturn 3;\n\t}\n\n\tif ('TERM_PROGRAM' in env) {\n\t\tconst version = parseInt((env.TERM_PROGRAM_VERSION \|\| '').split('.')[0], 10);\n\n\t\tswitch (env.TERM_PROGRAM) {\n\t\t\tcase 'iTerm.app':\n\t\t\t\treturn version >= 3 ? 3 : 2;\n\t\t\tcase 'Apple_Terminal':\n\t\t\t\treturn 2;\n\t\t\t// No default\n\t\t}\n\t}\n\n\tif (/-256(color)?$/i.test(env.TERM)) {\n\t\treturn 2;\n\t}\n\n\tif (/^screen\|^xterm\|^vt100\|^vt220\|^rxvt\|color\|ansi\|cygwin\|linux/i.test(env.TERM)) {\n\t\treturn 1;\n\t}\n\n\tif ('COLORTERM' in env) {\n\t\treturn 1;\n\t}\n\n\treturn min;\n}\n\nfunction getSupportLevel(stream) {\n\tconst level = supportsColor(stream, stream && stream.isTTY);\n\treturn translateLevel(level);\n}\n\nmodule.exports = {\n\tsupportsColor: getSupportLevel,\n\tstdout: translateLevel(supportsColor(true, tty.isatty(1))),\n\tstderr: translateLevel(supportsColor(true, tty.isatty(2)))\n};\n","'use strict';\n\nconst stringReplaceAll = (string, substring, replacer) => {\n\tlet index = string.indexOf(substring);\n\tif (index === -1) {\n\t\treturn string;\n\t}\n\n\tconst substringLength = substring.length;\n\tlet endIndex = 0;\n\tlet returnValue = '';\n\tdo {\n\t\treturnValue += string.substr(endIndex, index - endIndex) + substring + replacer;\n\t\tendIndex = index + substringLength;\n\t\tindex = string.indexOf(substring, endIndex);\n\t} while (index !== -1);\n\n\treturnValue += string.substr(endIndex);\n\treturn returnValue;\n};\n\nconst stringEncaseCRLFWithFirstIndex = (string, prefix, postfix, index) => {\n\tlet endIndex = 0;\n\tlet returnValue = '';\n\tdo {\n\t\tconst gotCR = string[index - 1] === '\\r';\n\t\treturnValue += string.substr(endIndex, (gotCR ? index - 1 : index) - endIndex) + prefix + (gotCR ? '\\r\\n' : '\\n') + postfix;\n\t\tendIndex = index + 1;\n\t\tindex = string.indexOf('\\n', endIndex);\n\t} while (index !== -1);\n\n\treturnValue += string.substr(endIndex);\n\treturn returnValue;\n};\n\nmodule.exports = {\n\tstringReplaceAll,\n\tstringEncaseCRLFWithFirstIndex\n};\n","'use strict';\nconst TEMPLATE_REGEX = /(?:\\\$u(?:[a-f\\d]{4}\|\\{[a-f\\d]{1,6}\\})\|x[a-f\\d]{2}\|.))\|(?:\\{(~)?(\\w+(?:\\([^)]\$)?(?:\\.\\w+(?:\$[^)]\$)?))(?:[ \\t]\|(?=\\r?\\n)))\|(\\})\|((?:.\|[\\r\\n\\f])+?)/gi;\nconst STYLE_REGEX = /(?:^\|\\.)(\\w+)(?:\$([^)])\$)?/g;\nconst STRING_REGEX = /^(['\"])((?:\\\\.\|(?!\\1)[^\\\\]))\\1$/;\nconst ESCAPE_REGEX = /\\\\(u(?:[a-f\\d]{4}\|{[a-f\\d]{1,6}})\|x[a-f\\d]{2}\|.)\|([^\\\\])/gi;\n\nconst ESCAPES = new Map([\n\t['n', '\\n'],\n\t['r', '\\r'],\n\t['t', '\\t'],\n\t['b', '\\b'],\n\t['f', '\\f'],\n\t['v', '\\v'],\n\t['0', '\\0'],\n\t['\\\\', '\\\\'],\n\t['e', '\\u001B'],\n\t['a', '\\u0007']\n]);\n\nfunction unescape(c) {\n\tconst u = c[0] === 'u';\n\tconst bracket = c[1] === '{';\n\n\tif ((u && !bracket && c.length === 5) \|\| (c[0] === 'x' && c.length === 3)) {\n\t\treturn String.fromCharCode(parseInt(c.slice(1), 16));\n\t}\n\n\tif (u && bracket) {\n\t\treturn String.fromCodePoint(parseInt(c.slice(2, -1), 16));\n\t}\n\n\treturn ESCAPES.get(c) \|\| c;\n}\n\nfunction parseArguments(name, arguments_) {\n\tconst results = [];\n\tconst chunks = arguments_.trim().split(/\\s,\\s/g);\n\tlet matches;\n\n\tfor (const chunk of chunks) {\n\t\tconst number = Number(chunk);\n\t\tif (!Number.isNaN(number)) {\n\t\t\tresults.push(number);\n\t\t} else if ((matches = chunk.match(STRING_REGEX))) {\n\t\t\tresults.push(matches[2].replace(ESCAPE_REGEX, (m, escape, character) => escape ? unescape(escape) : character));\n\t\t} else {\n\t\t\tthrow new Error(`Invalid Chalk template style argument: ${chunk} (in style '${name}')`);\n\t\t}\n\t}\n\n\treturn results;\n}\n\nfunction parseStyle(style) {\n\tSTYLE_REGEX.lastIndex = 0;\n\n\tconst results = [];\n\tlet matches;\n\n\twhile ((matches = STYLE_REGEX.exec(style)) !== null) {\n\t\tconst name = matches[1];\n\n\t\tif (matches[2]) {\n\t\t\tconst args = parseArguments(name, matches[2]);\n\t\t\tresults.push([name].concat(args));\n\t\t} else {\n\t\t\tresults.push([name]);\n\t\t}\n\t}\n\n\treturn results;\n}\n\nfunction buildStyle(chalk, styles) {\n\tconst enabled = {};\n\n\tfor (const layer of styles) {\n\t\tfor (const style of layer.styles) {\n\t\t\tenabled[style[0]] = layer.inverse ? null : style.slice(1);\n\t\t}\n\t}\n\n\tlet current = chalk;\n\tfor (const [styleName, styles] of Object.entries(enabled)) {\n\t\tif (!Array.isArray(styles)) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (!(styleName in current)) {\n\t\t\tthrow new Error(`Unknown Chalk style: ${styleName}`);\n\t\t}\n\n\t\tcurrent = styles.length > 0 ? current[styleName](...styles) : current[styleName];\n\t}\n\n\treturn current;\n}\n\nmodule.exports = (chalk, temporary) => {\n\tconst styles = [];\n\tconst chunks = [];\n\tlet chunk = [];\n\n\t// eslint-disable-next-line max-params\n\ttemporary.replace(TEMPLATE_REGEX, (m, escapeCharacter, inverse, style, close, character) => {\n\t\tif (escapeCharacter) {\n\t\t\tchunk.push(unescape(escapeCharacter));\n\t\t} else if (style) {\n\t\t\tconst string = chunk.join('');\n\t\t\tchunk = [];\n\t\t\tchunks.push(styles.length === 0 ? string : buildStyle(chalk, styles)(string));\n\t\t\tstyles.push({inverse, styles: parseStyle(style)});\n\t\t} else if (close) {\n\t\t\tif (styles.length === 0) {\n\t\t\t\tthrow new Error('Found extraneous } in Chalk template literal');\n\t\t\t}\n\n\t\t\tchunks.push(buildStyle(chalk, styles)(chunk.join('')));\n\t\t\tchunk = [];\n\t\t\tstyles.pop();\n\t\t} else {\n\t\t\tchunk.push(character);\n\t\t}\n\t});\n\n\tchunks.push(chunk.join(''));\n\n\tif (styles.length > 0) {\n\t\tconst errMessage = `Chalk template literal is missing ${styles.length} closing bracket${styles.length === 1 ? '' : 's'} (\\`}\\`)`;\n\t\tthrow new Error(errMessage);\n\t}\n\n\treturn chunks.join('');\n};\n","'use strict';\nconst ansiStyles = require('ansi-styles');\nconst {stdout: stdoutColor, stderr: stderrColor} = require('supports-color');\nconst {\n\tstringReplaceAll,\n\tstringEncaseCRLFWithFirstIndex\n} = require('./util');\n\nconst {isArray} = Array;\n\n// `supportsColor.level` → `ansiStyles.color[name]` mapping\nconst levelMapping = [\n\t'ansi',\n\t'ansi',\n\t'ansi256',\n\t'ansi16m'\n];\n\nconst styles = Object.create(null);\n\nconst applyOptions = (object, options = {}) => {\n\tif (options.level && !(Number.isInteger(options.level) && options.level >= 0 && options.level <= 3)) {\n\t\tthrow new Error('The `level` option should be an integer from 0 to 3');\n\t}\n\n\t// Detect level if not set manually\n\tconst colorLevel = stdoutColor ? stdoutColor.level : 0;\n\tobject.level = options.level === undefined ? colorLevel : options.level;\n};\n\nclass ChalkClass {\n\tconstructor(options) {\n\t\t// eslint-disable-next-line no-constructor-return\n\t\treturn chalkFactory(options);\n\t}\n}\n\nconst chalkFactory = options => {\n\tconst chalk = {};\n\tapplyOptions(chalk, options);\n\n\tchalk.template = (...arguments_) => chalkTag(chalk.template, ...arguments_);\n\n\tObject.setPrototypeOf(chalk, Chalk.prototype);\n\tObject.setPrototypeOf(chalk.template, chalk);\n\n\tchalk.template.constructor = () => {\n\t\tthrow new Error('`chalk.constructor()` is deprecated. Use `new chalk.Instance()` instead.');\n\t};\n\n\tchalk.template.Instance = ChalkClass;\n\n\treturn chalk.template;\n};\n\nfunction Chalk(options) {\n\treturn chalkFactory(options);\n}\n\nfor (const [styleName, style] of Object.entries(ansiStyles)) {\n\tstyles[styleName] = {\n\t\tget() {\n\t\t\tconst builder = createBuilder(this, createStyler(style.open, style.close, this._styler), this._isEmpty);\n\t\t\tObject.defineProperty(this, styleName, {value: builder});\n\t\t\treturn builder;\n\t\t}\n\t};\n}\n\nstyles.visible = {\n\tget() {\n\t\tconst builder = createBuilder(this, this._styler, true);\n\t\tObject.defineProperty(this, 'visible', {value: builder});\n\t\treturn builder;\n\t}\n};\n\nconst usedModels = ['rgb', 'hex', 'keyword', 'hsl', 'hsv', 'hwb', 'ansi', 'ansi256'];\n\nfor (const model of usedModels) {\n\tstyles[model] = {\n\t\tget() {\n\t\t\tconst {level} = this;\n\t\t\treturn function (...arguments_) {\n\t\t\t\tconst styler = createStyler(ansiStyles.color[levelMapping[level]][model](...arguments_), ansiStyles.color.close, this._styler);\n\t\t\t\treturn createBuilder(this, styler, this._isEmpty);\n\t\t\t};\n\t\t}\n\t};\n}\n\nfor (const model of usedModels) {\n\tconst bgModel = 'bg' + model[0].toUpperCase() + model.slice(1);\n\tstyles[bgModel] = {\n\t\tget() {\n\t\t\tconst {level} = this;\n\t\t\treturn function (...arguments_) {\n\t\t\t\tconst styler = createStyler(ansiStyles.bgColor[levelMapping[level]][model](...arguments_), ansiStyles.bgColor.close, this._styler);\n\t\t\t\treturn createBuilder(this, styler, this._isEmpty);\n\t\t\t};\n\t\t}\n\t};\n}\n\nconst proto = Object.defineProperties(() => {}, {\n\t...styles,\n\tlevel: {\n\t\tenumerable: true,\n\t\tget() {\n\t\t\treturn this._generator.level;\n\t\t},\n\t\tset(level) {\n\t\t\tthis._generator.level = level;\n\t\t}\n\t}\n});\n\nconst createStyler = (open, close, parent) => {\n\tlet openAll;\n\tlet closeAll;\n\tif (parent === undefined) {\n\t\topenAll = open;\n\t\tcloseAll = close;\n\t} else {\n\t\topenAll = parent.openAll + open;\n\t\tcloseAll = close + parent.closeAll;\n\t}\n\n\treturn {\n\t\topen,\n\t\tclose,\n\t\topenAll,\n\t\tcloseAll,\n\t\tparent\n\t};\n};\n\nconst createBuilder = (self, _styler, _isEmpty) => {\n\tconst builder = (...arguments_) => {\n\t\tif (isArray(arguments_[0]) && isArray(arguments_[0].raw)) {\n\t\t\t// Called as a template literal, for example: chalk.red`2 + 3 = {bold ${2+3}}`\n\t\t\treturn applyStyle(builder, chalkTag(builder, ...arguments_));\n\t\t}\n\n\t\t// Single argument is hot path, implicit coercion is faster than anything\n\t\t// eslint-disable-next-line no-implicit-coercion\n\t\treturn applyStyle(builder, (arguments_.length === 1) ? ('' + arguments_[0]) : arguments_.join(' '));\n\t};\n\n\t// We alter the prototype because we must return a function, but there is\n\t// no way to create a function with a different prototype\n\tObject.setPrototypeOf(builder, proto);\n\n\tbuilder._generator = self;\n\tbuilder._styler = _styler;\n\tbuilder._isEmpty = _isEmpty;\n\n\treturn builder;\n};\n\nconst applyStyle = (self, string) => {\n\tif (self.level <= 0 \|\| !string) {\n\t\treturn self._isEmpty ? '' : string;\n\t}\n\n\tlet styler = self._styler;\n\n\tif (styler === undefined) {\n\t\treturn string;\n\t}\n\n\tconst {openAll, closeAll} = styler;\n\tif (string.indexOf('\\u001B') !== -1) {\n\t\twhile (styler !== undefined) {\n\t\t\t// Replace any instances already present with a re-opening code\n\t\t\t// otherwise only the part of the string until said closing code\n\t\t\t// will be colored, and the rest will simply be 'plain'.\n\t\t\tstring = stringReplaceAll(string, styler.close, styler.open);\n\n\t\t\tstyler = styler.parent;\n\t\t}\n\t}\n\n\t// We can move both next actions out of loop, because remaining actions in loop won't have\n\t// any/visible effect on parts we add here. Close the styling before a linebreak and reopen\n\t// after next line to fix a bleed issue on macOS: https://github.com/chalk/chalk/pull/92\n\tconst lfIndex = string.indexOf('\\n');\n\tif (lfIndex !== -1) {\n\t\tstring = stringEncaseCRLFWithFirstIndex(string, closeAll, openAll, lfIndex);\n\t}\n\n\treturn openAll + string + closeAll;\n};\n\nlet template;\nconst chalkTag = (chalk, ...strings) => {\n\tconst [firstString] = strings;\n\n\tif (!isArray(firstString) \|\| !isArray(firstString.raw)) {\n\t\t// If chalk() was called by itself or with a string,\n\t\t// return the string itself as a string.\n\t\treturn strings.join(' ');\n\t}\n\n\tconst arguments_ = strings.slice(1);\n\tconst parts = [firstString.raw[0]];\n\n\tfor (let i = 1; i < firstString.length; i++) {\n\t\tparts.push(\n\t\t\tString(arguments_[i - 1]).replace(/[{}\\\\]/g, '\\\\$&'),\n\t\t\tString(firstString.raw[i])\n\t\t);\n\t}\n\n\tif (template === undefined) {\n\t\ttemplate = require('./templates');\n\t}\n\n\treturn template(chalk, parts.join(''));\n};\n\nObject.defineProperties(Chalk.prototype, styles);\n\nconst chalk = Chalk(); // eslint-disable-line new-cap\nchalk.supportsColor = stdoutColor;\nchalk.stderr = Chalk({level: stderrColor ? stderrColor.level : 0}); // eslint-disable-line new-cap\nchalk.stderr.supportsColor = stderrColor;\n\nmodule.exports = chalk;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.getType = getType;\nexports.isPrimitive = void 0;\n/*\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\n// get the type of a value with handling the edge cases like `typeof []`\n// and `typeof null`\nfunction getType(value) {\n if (value === undefined) {\n return 'undefined';\n } else if (value === null) {\n return 'null';\n } else if (Array.isArray(value)) {\n return 'array';\n } else if (typeof value === 'boolean') {\n return 'boolean';\n } else if (typeof value === 'function') {\n return 'function';\n } else if (typeof value === 'number') {\n return 'number';\n } else if (typeof value === 'string') {\n return 'string';\n } else if (typeof value === 'bigint') {\n return 'bigint';\n } else if (typeof value === 'object') {\n if (value != null) {\n if (value.constructor === RegExp) {\n return 'regexp';\n } else if (value.constructor === Map) {\n return 'map';\n } else if (value.constructor === Set) {\n return 'set';\n } else if (value.constructor === Date) {\n return 'date';\n }\n }\n return 'object';\n } else if (typeof value === 'symbol') {\n return 'symbol';\n }\n throw new Error(`value of unknown type: ${value}`);\n}\nconst isPrimitive = value => Object(value) !== value;\nexports.isPrimitive = isPrimitive;\n","'use strict';\n\nconst ANSI_BACKGROUND_OFFSET = 10;\n\nconst wrapAnsi256 = (offset = 0) => code => `\\u001B[${38 + offset};5;${code}m`;\n\nconst wrapAnsi16m = (offset = 0) => (red, green, blue) => `\\u001B[${38 + offset};2;${red};${green};${blue}m`;\n\nfunction assembleStyles() {\n\tconst codes = new Map();\n\tconst styles = {\n\t\tmodifier: {\n\t\t\treset: [0, 0],\n\t\t\t// 21 isn't widely supported and 22 does the same thing\n\t\t\tbold: [1, 22],\n\t\t\tdim: [2, 22],\n\t\t\titalic: [3, 23],\n\t\t\tunderline: [4, 24],\n\t\t\toverline: [53, 55],\n\t\t\tinverse: [7, 27],\n\t\t\thidden: [8, 28],\n\t\t\tstrikethrough: [9, 29]\n\t\t},\n\t\tcolor: {\n\t\t\tblack: [30, 39],\n\t\t\tred: [31, 39],\n\t\t\tgreen: [32, 39],\n\t\t\tyellow: [33, 39],\n\t\t\tblue: [34, 39],\n\t\t\tmagenta: [35, 39],\n\t\t\tcyan: [36, 39],\n\t\t\twhite: [37, 39],\n\n\t\t\t// Bright color\n\t\t\tblackBright: [90, 39],\n\t\t\tredBright: [91, 39],\n\t\t\tgreenBright: [92, 39],\n\t\t\tyellowBright: [93, 39],\n\t\t\tblueBright: [94, 39],\n\t\t\tmagentaBright: [95, 39],\n\t\t\tcyanBright: [96, 39],\n\t\t\twhiteBright: [97, 39]\n\t\t},\n\t\tbgColor: {\n\t\t\tbgBlack: [40, 49],\n\t\t\tbgRed: [41, 49],\n\t\t\tbgGreen: [42, 49],\n\t\t\tbgYellow: [43, 49],\n\t\t\tbgBlue: [44, 49],\n\t\t\tbgMagenta: [45, 49],\n\t\t\tbgCyan: [46, 49],\n\t\t\tbgWhite: [47, 49],\n\n\t\t\t// Bright color\n\t\t\tbgBlackBright: [100, 49],\n\t\t\tbgRedBright: [101, 49],\n\t\t\tbgGreenBright: [102, 49],\n\t\t\tbgYellowBright: [103, 49],\n\t\t\tbgBlueBright: [104, 49],\n\t\t\tbgMagentaBright: [105, 49],\n\t\t\tbgCyanBright: [106, 49],\n\t\t\tbgWhiteBright: [107, 49]\n\t\t}\n\t};\n\n\t// Alias bright black as gray (and grey)\n\tstyles.color.gray = styles.color.blackBright;\n\tstyles.bgColor.bgGray = styles.bgColor.bgBlackBright;\n\tstyles.color.grey = styles.color.blackBright;\n\tstyles.bgColor.bgGrey = styles.bgColor.bgBlackBright;\n\n\tfor (const [groupName, group] of Object.entries(styles)) {\n\t\tfor (const [styleName, style] of Object.entries(group)) {\n\t\t\tstyles[styleName] = {\n\t\t\t\topen: `\\u001B[${style[0]}m`,\n\t\t\t\tclose: `\\u001B[${style[1]}m`\n\t\t\t};\n\n\t\t\tgroup[styleName] = styles[styleName];\n\n\t\t\tcodes.set(style[0], style[1]);\n\t\t}\n\n\t\tObject.defineProperty(styles, groupName, {\n\t\t\tvalue: group,\n\t\t\tenumerable: false\n\t\t});\n\t}\n\n\tObject.defineProperty(styles, 'codes', {\n\t\tvalue: codes,\n\t\tenumerable: false\n\t});\n\n\tstyles.color.close = '\\u001B[39m';\n\tstyles.bgColor.close = '\\u001B[49m';\n\n\tstyles.color.ansi256 = wrapAnsi256();\n\tstyles.color.ansi16m = wrapAnsi16m();\n\tstyles.bgColor.ansi256 = wrapAnsi256(ANSI_BACKGROUND_OFFSET);\n\tstyles.bgColor.ansi16m = wrapAnsi16m(ANSI_BACKGROUND_OFFSET);\n\n\t// From https://github.com/Qix-/color-convert/blob/3f0e0d4e92e235796ccb17f6e85c72094a651f49/conversions.js\n\tObject.defineProperties(styles, {\n\t\trgbToAnsi256: {\n\t\t\tvalue: (red, green, blue) => {\n\t\t\t\t// We use the extended greyscale palette here, with the exception of\n\t\t\t\t// black and white. normal palette only has 4 greyscale shades.\n\t\t\t\tif (red === green && green === blue) {\n\t\t\t\t\tif (red < 8) {\n\t\t\t\t\t\treturn 16;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (red > 248) {\n\t\t\t\t\t\treturn 231;\n\t\t\t\t\t}\n\n\t\t\t\t\treturn Math.round(((red - 8) / 247) 24) + 232;\n\t\t\t\t}\n\n\t\t\t\treturn 16 +\n\t\t\t\t\t(36 * Math.round(red / 255 * 5)) +\n\t\t\t\t\t(6 * Math.round(green / 255 * 5)) +\n\t\t\t\t\tMath.round(blue / 255 * 5);\n\t\t\t},\n\t\t\tenumerable: false\n\t\t},\n\t\thexToRgb: {\n\t\t\tvalue: hex => {\n\t\t\t\tconst matches = /(?<colorString>[a-f\\d]{6}\|[a-f\\d]{3})/i.exec(hex.toString(16));\n\t\t\t\tif (!matches) {\n\t\t\t\t\treturn [0, 0, 0];\n\t\t\t\t}\n\n\t\t\t\tlet {colorString} = matches.groups;\n\n\t\t\t\tif (colorString.length === 3) {\n\t\t\t\t\tcolorString = colorString.split('').map(character => character + character).join('');\n\t\t\t\t}\n\n\t\t\t\tconst integer = Number.parseInt(colorString, 16);\n\n\t\t\t\treturn [\n\t\t\t\t\t(integer >> 16) & 0xFF,\n\t\t\t\t\t(integer >> 8) & 0xFF,\n\t\t\t\t\tinteger & 0xFF\n\t\t\t\t];\n\t\t\t},\n\t\t\tenumerable: false\n\t\t},\n\t\thexToAnsi256: {\n\t\t\tvalue: hex => styles.rgbToAnsi256(...styles.hexToRgb(hex)),\n\t\t\tenumerable: false\n\t\t}\n\t});\n\n\treturn styles;\n}\n\n// Make the export immutable\nObject.defineProperty(module, 'exports', {\n\tenumerable: true,\n\tget: assembleStyles\n});\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.printIteratorEntries = printIteratorEntries;\nexports.printIteratorValues = printIteratorValues;\nexports.printListItems = printListItems;\nexports.printObjectProperties = printObjectProperties;\n/*\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n \n /\n\nconst getKeysOfEnumerableProperties = (object, compareKeys) => {\n const rawKeys = Object.keys(object);\n const keys = compareKeys !== null ? rawKeys.sort(compareKeys) : rawKeys;\n if (Object.getOwnPropertySymbols) {\n Object.getOwnPropertySymbols(object).forEach(symbol => {\n if (Object.getOwnPropertyDescriptor(object, symbol).enumerable) {\n keys.push(symbol);\n }\n });\n }\n return keys;\n};\n\n/*\n Return entries (for example, of a map)\n * with spacing, indentation, and comma\n * without surrounding punctuation (for example, braces)\n /\nfunction printIteratorEntries(\n iterator,\n config,\n indentation,\n depth,\n refs,\n printer,\n // Too bad, so sad that separator for ECMAScript Map has been ' => '\n // What a distracting diff if you change a data structure to/from\n // ECMAScript Object or Immutable.Map/OrderedMap which use the default.\n separator = ': '\n) {\n let result = '';\n let width = 0;\n let current = iterator.next();\n if (!current.done) {\n result += config.spacingOuter;\n const indentationNext = indentation + config.indent;\n while (!current.done) {\n result += indentationNext;\n if (width++ === config.maxWidth) {\n result += '…';\n break;\n }\n const name = printer(\n current.value[0],\n config,\n indentationNext,\n depth,\n refs\n );\n const value = printer(\n current.value[1],\n config,\n indentationNext,\n depth,\n refs\n );\n result += name + separator + value;\n current = iterator.next();\n if (!current.done) {\n result += `,${config.spacingInner}`;\n } else if (!config.min) {\n result += ',';\n }\n }\n result += config.spacingOuter + indentation;\n }\n return result;\n}\n\n/\n Return values (for example, of a set)\n * with spacing, indentation, and comma\n * without surrounding punctuation (braces or brackets)\n /\nfunction printIteratorValues(\n iterator,\n config,\n indentation,\n depth,\n refs,\n printer\n) {\n let result = '';\n let width = 0;\n let current = iterator.next();\n if (!current.done) {\n result += config.spacingOuter;\n const indentationNext = indentation + config.indent;\n while (!current.done) {\n result += indentationNext;\n if (width++ === config.maxWidth) {\n result += '…';\n break;\n }\n result += printer(current.value, config, indentationNext, depth, refs);\n current = iterator.next();\n if (!current.done) {\n result += `,${config.spacingInner}`;\n } else if (!config.min) {\n result += ',';\n }\n }\n result += config.spacingOuter + indentation;\n }\n return result;\n}\n\n/\n Return items (for example, of an array)\n * with spacing, indentation, and comma\n * without surrounding punctuation (for example, brackets)\n /\nfunction printListItems(list, config, indentation, depth, refs, printer) {\n let result = '';\n if (list.length) {\n result += config.spacingOuter;\n const indentationNext = indentation + config.indent;\n for (let i = 0; i < list.length; i++) {\n result += indentationNext;\n if (i === config.maxWidth) {\n result += '…';\n break;\n }\n if (i in list) {\n result += printer(list[i], config, indentationNext, depth, refs);\n }\n if (i < list.length - 1) {\n result += `,${config.spacingInner}`;\n } else if (!config.min) {\n result += ',';\n }\n }\n result += config.spacingOuter + indentation;\n }\n return result;\n}\n\n/\n * Return properties of an object\n * with spacing, indentation, and comma\n * without surrounding punctuation (for example, braces)\n /\nfunction printObjectProperties(val, config, indentation, depth, refs, printer) {\n let result = '';\n const keys = getKeysOfEnumerableProperties(val, config.compareKeys);\n if (keys.length) {\n result += config.spacingOuter;\n const indentationNext = indentation + config.indent;\n for (let i = 0; i < keys.length; i++) {\n const key = keys[i];\n const name = printer(key, config, indentationNext, depth, refs);\n const value = printer(val[key], config, indentationNext, depth, refs);\n result += `${indentationNext + name}: ${value}`;\n if (i < keys.length - 1) {\n result += `,${config.spacingInner}`;\n } else if (!config.min) {\n result += ',';\n }\n }\n result += config.spacingOuter + indentation;\n }\n return result;\n}\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.test = exports.serialize = exports.default = void 0;\nvar _collections = require('../collections');\nvar Symbol = globalThis['jest-symbol-do-not-touch'] \|\| globalThis.Symbol;\n/\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\nconst asymmetricMatcher =\n typeof Symbol === 'function' && Symbol.for\n ? Symbol.for('jest.asymmetricMatcher')\n : 0x1357a5;\nconst SPACE = ' ';\nconst serialize = (val, config, indentation, depth, refs, printer) => {\n const stringedValue = val.toString();\n if (\n stringedValue === 'ArrayContaining' \|\|\n stringedValue === 'ArrayNotContaining'\n ) {\n if (++depth > config.maxDepth) {\n return `[${stringedValue}]`;\n }\n return `${stringedValue + SPACE}[${(0, _collections.printListItems)(\n val.sample,\n config,\n indentation,\n depth,\n refs,\n printer\n )}]`;\n }\n if (\n stringedValue === 'ObjectContaining' \|\|\n stringedValue === 'ObjectNotContaining'\n ) {\n if (++depth > config.maxDepth) {\n return `[${stringedValue}]`;\n }\n return `${stringedValue + SPACE}{${(0, _collections.printObjectProperties)(\n val.sample,\n config,\n indentation,\n depth,\n refs,\n printer\n )}}`;\n }\n if (\n stringedValue === 'StringMatching' \|\|\n stringedValue === 'StringNotMatching'\n ) {\n return (\n stringedValue +\n SPACE +\n printer(val.sample, config, indentation, depth, refs)\n );\n }\n if (\n stringedValue === 'StringContaining' \|\|\n stringedValue === 'StringNotContaining'\n ) {\n return (\n stringedValue +\n SPACE +\n printer(val.sample, config, indentation, depth, refs)\n );\n }\n if (typeof val.toAsymmetricMatcher !== 'function') {\n throw new Error(\n `Asymmetric matcher ${val.constructor.name} does not implement toAsymmetricMatcher()`\n );\n }\n return val.toAsymmetricMatcher();\n};\nexports.serialize = serialize;\nconst test = val => val && val.$$typeof === asymmetricMatcher;\nexports.test = test;\nconst plugin = {\n serialize,\n test\n};\nvar _default = plugin;\nexports.default = _default;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.test = exports.serialize = exports.default = void 0;\nvar _collections = require('../collections');\n/\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\nconst SPACE = ' ';\nconst OBJECT_NAMES = ['DOMStringMap', 'NamedNodeMap'];\nconst ARRAY_REGEXP = /^(HTML\\wCollection\|NodeList)$/;\nconst testName = name =>\n OBJECT_NAMES.indexOf(name) !== -1 \|\| ARRAY_REGEXP.test(name);\nconst test = val =>\n val &&\n val.constructor &&\n !!val.constructor.name &&\n testName(val.constructor.name);\nexports.test = test;\nconst isNamedNodeMap = collection =>\n collection.constructor.name === 'NamedNodeMap';\nconst serialize = (collection, config, indentation, depth, refs, printer) => {\n const name = collection.constructor.name;\n if (++depth > config.maxDepth) {\n return `[${name}]`;\n }\n return (\n (config.min ? '' : name + SPACE) +\n (OBJECT_NAMES.indexOf(name) !== -1\n ? `{${(0, _collections.printObjectProperties)(\n isNamedNodeMap(collection)\n ? Array.from(collection).reduce((props, attribute) => {\n props[attribute.name] = attribute.value;\n return props;\n }, {})\n : {\n ...collection\n },\n config,\n indentation,\n depth,\n refs,\n printer\n )}}`\n : `[${(0, _collections.printListItems)(\n Array.from(collection),\n config,\n indentation,\n depth,\n refs,\n printer\n )}]`)\n );\n};\nexports.serialize = serialize;\nconst plugin = {\n serialize,\n test\n};\nvar _default = plugin;\nexports.default = _default;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.default = escapeHTML;\n/*\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\nfunction escapeHTML(str) {\n return str.replace(/</g, '<').replace(/>/g, '>');\n}\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.printText =\n exports.printProps =\n exports.printElementAsLeaf =\n exports.printElement =\n exports.printComment =\n exports.printChildren =\n void 0;\nvar _escapeHTML = _interopRequireDefault(require('./escapeHTML'));\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {default: obj};\n}\n/\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\n// Return empty string if keys is empty.\nconst printProps = (keys, props, config, indentation, depth, refs, printer) => {\n const indentationNext = indentation + config.indent;\n const colors = config.colors;\n return keys\n .map(key => {\n const value = props[key];\n let printed = printer(value, config, indentationNext, depth, refs);\n if (typeof value !== 'string') {\n if (printed.indexOf('\\n') !== -1) {\n printed =\n config.spacingOuter +\n indentationNext +\n printed +\n config.spacingOuter +\n indentation;\n }\n printed = `{${printed}}`;\n }\n return `${\n config.spacingInner +\n indentation +\n colors.prop.open +\n key +\n colors.prop.close\n }=${colors.value.open}${printed}${colors.value.close}`;\n })\n .join('');\n};\n\n// Return empty string if children is empty.\nexports.printProps = printProps;\nconst printChildren = (children, config, indentation, depth, refs, printer) =>\n children\n .map(\n child =>\n config.spacingOuter +\n indentation +\n (typeof child === 'string'\n ? printText(child, config)\n : printer(child, config, indentation, depth, refs))\n )\n .join('');\nexports.printChildren = printChildren;\nconst printText = (text, config) => {\n const contentColor = config.colors.content;\n return (\n contentColor.open + (0, _escapeHTML.default)(text) + contentColor.close\n );\n};\nexports.printText = printText;\nconst printComment = (comment, config) => {\n const commentColor = config.colors.comment;\n return `${commentColor.open}<!--${(0, _escapeHTML.default)(comment)}-->${\n commentColor.close\n }`;\n};\n\n// Separate the functions to format props, children, and element,\n// so a plugin could override a particular function, if needed.\n// Too bad, so sad: the traditional (but unnecessary) space\n// in a self-closing tagColor requires a second test of printedProps.\nexports.printComment = printComment;\nconst printElement = (\n type,\n printedProps,\n printedChildren,\n config,\n indentation\n) => {\n const tagColor = config.colors.tag;\n return `${tagColor.open}<${type}${\n printedProps &&\n tagColor.close +\n printedProps +\n config.spacingOuter +\n indentation +\n tagColor.open\n }${\n printedChildren\n ? `>${tagColor.close}${printedChildren}${config.spacingOuter}${indentation}${tagColor.open}</${type}`\n : `${printedProps && !config.min ? '' : ' '}/`\n }>${tagColor.close}`;\n};\nexports.printElement = printElement;\nconst printElementAsLeaf = (type, config) => {\n const tagColor = config.colors.tag;\n return `${tagColor.open}<${type}${tagColor.close} …${tagColor.open} />${tagColor.close}`;\n};\nexports.printElementAsLeaf = printElementAsLeaf;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.test = exports.serialize = exports.default = void 0;\nvar _markup = require('./lib/markup');\n/\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\nconst ELEMENT_NODE = 1;\nconst TEXT_NODE = 3;\nconst COMMENT_NODE = 8;\nconst FRAGMENT_NODE = 11;\nconst ELEMENT_REGEXP = /^((HTML\|SVG)\\w)?Element$/;\nconst testHasAttribute = val => {\n try {\n return typeof val.hasAttribute === 'function' && val.hasAttribute('is');\n } catch {\n return false;\n }\n};\nconst testNode = val => {\n const constructorName = val.constructor.name;\n const {nodeType, tagName} = val;\n const isCustomElement =\n (typeof tagName === 'string' && tagName.includes('-')) \|\|\n testHasAttribute(val);\n return (\n (nodeType === ELEMENT_NODE &&\n (ELEMENT_REGEXP.test(constructorName) \|\| isCustomElement)) \|\|\n (nodeType === TEXT_NODE && constructorName === 'Text') \|\|\n (nodeType === COMMENT_NODE && constructorName === 'Comment') \|\|\n (nodeType === FRAGMENT_NODE && constructorName === 'DocumentFragment')\n );\n};\nconst test = val => val?.constructor?.name && testNode(val);\nexports.test = test;\nfunction nodeIsText(node) {\n return node.nodeType === TEXT_NODE;\n}\nfunction nodeIsComment(node) {\n return node.nodeType === COMMENT_NODE;\n}\nfunction nodeIsFragment(node) {\n return node.nodeType === FRAGMENT_NODE;\n}\nconst serialize = (node, config, indentation, depth, refs, printer) => {\n if (nodeIsText(node)) {\n return (0, _markup.printText)(node.data, config);\n }\n if (nodeIsComment(node)) {\n return (0, _markup.printComment)(node.data, config);\n }\n const type = nodeIsFragment(node)\n ? 'DocumentFragment'\n : node.tagName.toLowerCase();\n if (++depth > config.maxDepth) {\n return (0, _markup.printElementAsLeaf)(type, config);\n }\n return (0, _markup.printElement)(\n type,\n (0, _markup.printProps)(\n nodeIsFragment(node)\n ? []\n : Array.from(node.attributes, attr => attr.name).sort(),\n nodeIsFragment(node)\n ? {}\n : Array.from(node.attributes).reduce((props, attribute) => {\n props[attribute.name] = attribute.value;\n return props;\n }, {}),\n config,\n indentation + config.indent,\n depth,\n refs,\n printer\n ),\n (0, _markup.printChildren)(\n Array.prototype.slice.call(node.childNodes \|\| node.children),\n config,\n indentation + config.indent,\n depth,\n refs,\n printer\n ),\n config,\n indentation\n );\n};\nexports.serialize = serialize;\nconst plugin = {\n serialize,\n test\n};\nvar _default = plugin;\nexports.default = _default;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.test = exports.serialize = exports.default = void 0;\nvar _collections = require('../collections');\n/*\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\n// SENTINEL constants are from https://github.com/facebook/immutable-js\nconst IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\nconst IS_LIST_SENTINEL = '@@__IMMUTABLE_LIST__@@';\nconst IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\nconst IS_MAP_SENTINEL = '@@__IMMUTABLE_MAP__@@';\nconst IS_ORDERED_SENTINEL = '@@__IMMUTABLE_ORDERED__@@';\nconst IS_RECORD_SENTINEL = '@@__IMMUTABLE_RECORD__@@'; // immutable v4\nconst IS_SEQ_SENTINEL = '@@__IMMUTABLE_SEQ__@@';\nconst IS_SET_SENTINEL = '@@__IMMUTABLE_SET__@@';\nconst IS_STACK_SENTINEL = '@@__IMMUTABLE_STACK__@@';\nconst getImmutableName = name => `Immutable.${name}`;\nconst printAsLeaf = name => `[${name}]`;\nconst SPACE = ' ';\nconst LAZY = '…'; // Seq is lazy if it calls a method like filter\n\nconst printImmutableEntries = (\n val,\n config,\n indentation,\n depth,\n refs,\n printer,\n type\n) =>\n ++depth > config.maxDepth\n ? printAsLeaf(getImmutableName(type))\n : `${getImmutableName(type) + SPACE}{${(0,\n _collections.printIteratorEntries)(\n val.entries(),\n config,\n indentation,\n depth,\n refs,\n printer\n )}}`;\n\n// Record has an entries method because it is a collection in immutable v3.\n// Return an iterator for Immutable Record from version v3 or v4.\nfunction getRecordEntries(val) {\n let i = 0;\n return {\n next() {\n if (i < val._keys.length) {\n const key = val._keys[i++];\n return {\n done: false,\n value: [key, val.get(key)]\n };\n }\n return {\n done: true,\n value: undefined\n };\n }\n };\n}\nconst printImmutableRecord = (\n val,\n config,\n indentation,\n depth,\n refs,\n printer\n) => {\n // _name property is defined only for an Immutable Record instance\n // which was constructed with a second optional descriptive name arg\n const name = getImmutableName(val._name \|\| 'Record');\n return ++depth > config.maxDepth\n ? printAsLeaf(name)\n : `${name + SPACE}{${(0, _collections.printIteratorEntries)(\n getRecordEntries(val),\n config,\n indentation,\n depth,\n refs,\n printer\n )}}`;\n};\nconst printImmutableSeq = (val, config, indentation, depth, refs, printer) => {\n const name = getImmutableName('Seq');\n if (++depth > config.maxDepth) {\n return printAsLeaf(name);\n }\n if (val[IS_KEYED_SENTINEL]) {\n return `${name + SPACE}{${\n // from Immutable collection of entries or from ECMAScript object\n val._iter \|\| val._object\n ? (0, _collections.printIteratorEntries)(\n val.entries(),\n config,\n indentation,\n depth,\n refs,\n printer\n )\n : LAZY\n }}`;\n }\n return `${name + SPACE}[${\n val._iter \|\|\n // from Immutable collection of values\n val._array \|\|\n // from ECMAScript array\n val._collection \|\|\n // from ECMAScript collection in immutable v4\n val._iterable // from ECMAScript collection in immutable v3\n ? (0, _collections.printIteratorValues)(\n val.values(),\n config,\n indentation,\n depth,\n refs,\n printer\n )\n : LAZY\n }]`;\n};\nconst printImmutableValues = (\n val,\n config,\n indentation,\n depth,\n refs,\n printer,\n type\n) =>\n ++depth > config.maxDepth\n ? printAsLeaf(getImmutableName(type))\n : `${getImmutableName(type) + SPACE}[${(0,\n _collections.printIteratorValues)(\n val.values(),\n config,\n indentation,\n depth,\n refs,\n printer\n )}]`;\nconst serialize = (val, config, indentation, depth, refs, printer) => {\n if (val[IS_MAP_SENTINEL]) {\n return printImmutableEntries(\n val,\n config,\n indentation,\n depth,\n refs,\n printer,\n val[IS_ORDERED_SENTINEL] ? 'OrderedMap' : 'Map'\n );\n }\n if (val[IS_LIST_SENTINEL]) {\n return printImmutableValues(\n val,\n config,\n indentation,\n depth,\n refs,\n printer,\n 'List'\n );\n }\n if (val[IS_SET_SENTINEL]) {\n return printImmutableValues(\n val,\n config,\n indentation,\n depth,\n refs,\n printer,\n val[IS_ORDERED_SENTINEL] ? 'OrderedSet' : 'Set'\n );\n }\n if (val[IS_STACK_SENTINEL]) {\n return printImmutableValues(\n val,\n config,\n indentation,\n depth,\n refs,\n printer,\n 'Stack'\n );\n }\n if (val[IS_SEQ_SENTINEL]) {\n return printImmutableSeq(val, config, indentation, depth, refs, printer);\n }\n\n // For compatibility with immutable v3 and v4, let record be the default.\n return printImmutableRecord(val, config, indentation, depth, refs, printer);\n};\n\n// Explicitly comparing sentinel properties to true avoids false positive\n// when mock identity-obj-proxy returns the key as the value for any key.\nexports.serialize = serialize;\nconst test = val =>\n val &&\n (val[IS_ITERABLE_SENTINEL] === true \|\| val[IS_RECORD_SENTINEL] === true);\nexports.test = test;\nconst plugin = {\n serialize,\n test\n};\nvar _default = plugin;\nexports.default = _default;\n","/\n @license React\n * react-is.production.min.js\n \n Copyright (c) Facebook, Inc. and its affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n'use strict';var b=Symbol.for(\"react.element\"),c=Symbol.for(\"react.portal\"),d=Symbol.for(\"react.fragment\"),e=Symbol.for(\"react.strict_mode\"),f=Symbol.for(\"react.profiler\"),g=Symbol.for(\"react.provider\"),h=Symbol.for(\"react.context\"),k=Symbol.for(\"react.server_context\"),l=Symbol.for(\"react.forward_ref\"),m=Symbol.for(\"react.suspense\"),n=Symbol.for(\"react.suspense_list\"),p=Symbol.for(\"react.memo\"),q=Symbol.for(\"react.lazy\"),t=Symbol.for(\"react.offscreen\"),u;u=Symbol.for(\"react.module.reference\");\nfunction v(a){if(\"object\"===typeof a&&null!==a){var r=a.$$typeof;switch(r){case b:switch(a=a.type,a){case d:case f:case e:case m:case n:return a;default:switch(a=a&&a.$$typeof,a){case k:case h:case l:case q:case p:case g:return a;default:return r}}case c:return r}}}exports.ContextConsumer=h;exports.ContextProvider=g;exports.Element=b;exports.ForwardRef=l;exports.Fragment=d;exports.Lazy=q;exports.Memo=p;exports.Portal=c;exports.Profiler=f;exports.StrictMode=e;exports.Suspense=m;\nexports.SuspenseList=n;exports.isAsyncMode=function(){return!1};exports.isConcurrentMode=function(){return!1};exports.isContextConsumer=function(a){return v(a)===h};exports.isContextProvider=function(a){return v(a)===g};exports.isElement=function(a){return\"object\"===typeof a&&null!==a&&a.$$typeof===b};exports.isForwardRef=function(a){return v(a)===l};exports.isFragment=function(a){return v(a)===d};exports.isLazy=function(a){return v(a)===q};exports.isMemo=function(a){return v(a)===p};\nexports.isPortal=function(a){return v(a)===c};exports.isProfiler=function(a){return v(a)===f};exports.isStrictMode=function(a){return v(a)===e};exports.isSuspense=function(a){return v(a)===m};exports.isSuspenseList=function(a){return v(a)===n};\nexports.isValidElementType=function(a){return\"string\"===typeof a\|\|\"function\"===typeof a\|\|a===d\|\|a===f\|\|a===e\|\|a===m\|\|a===n\|\|a===t\|\|\"object\"===typeof a&&null!==a&&(a.$$typeof===q\|\|a.$$typeof===p\|\|a.$$typeof===g\|\|a.$$typeof===h\|\|a.$$typeof===l\|\|a.$$typeof===u\|\|void 0!==a.getModuleId)?!0:!1};exports.typeOf=v;\n","/\n @license React\n * react-is.development.js\n \n Copyright (c) Facebook, Inc. and its affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\n'use strict';\n\nif (process.env.NODE_ENV !== \"production\") {\n (function() {\n'use strict';\n\n// ATTENTION\n// When adding new symbols to this file,\n// Please consider also adding to 'react-devtools-shared/src/backend/ReactSymbols'\n// The Symbol used to tag the ReactElement-like types.\nvar REACT_ELEMENT_TYPE = Symbol.for('react.element');\nvar REACT_PORTAL_TYPE = Symbol.for('react.portal');\nvar REACT_FRAGMENT_TYPE = Symbol.for('react.fragment');\nvar REACT_STRICT_MODE_TYPE = Symbol.for('react.strict_mode');\nvar REACT_PROFILER_TYPE = Symbol.for('react.profiler');\nvar REACT_PROVIDER_TYPE = Symbol.for('react.provider');\nvar REACT_CONTEXT_TYPE = Symbol.for('react.context');\nvar REACT_SERVER_CONTEXT_TYPE = Symbol.for('react.server_context');\nvar REACT_FORWARD_REF_TYPE = Symbol.for('react.forward_ref');\nvar REACT_SUSPENSE_TYPE = Symbol.for('react.suspense');\nvar REACT_SUSPENSE_LIST_TYPE = Symbol.for('react.suspense_list');\nvar REACT_MEMO_TYPE = Symbol.for('react.memo');\nvar REACT_LAZY_TYPE = Symbol.for('react.lazy');\nvar REACT_OFFSCREEN_TYPE = Symbol.for('react.offscreen');\n\n// -----------------------------------------------------------------------------\n\nvar enableScopeAPI = false; // Experimental Create Event Handle API.\nvar enableCacheElement = false;\nvar enableTransitionTracing = false; // No known bugs, but needs performance testing\n\nvar enableLegacyHidden = false; // Enables unstable_avoidThisFallback feature in Fiber\n// stuff. Intended to enable React core members to more easily debug scheduling\n// issues in DEV builds.\n\nvar enableDebugTracing = false; // Track which Fiber(s) schedule render work.\n\nvar REACT_MODULE_REFERENCE;\n\n{\n REACT_MODULE_REFERENCE = Symbol.for('react.module.reference');\n}\n\nfunction isValidElementType(type) {\n if (typeof type === 'string' \|\| typeof type === 'function') {\n return true;\n } // Note: typeof might be other than 'symbol' or 'number' (e.g. if it's a polyfill).\n\n\n if (type === REACT_FRAGMENT_TYPE \|\| type === REACT_PROFILER_TYPE \|\| enableDebugTracing \|\| type === REACT_STRICT_MODE_TYPE \|\| type === REACT_SUSPENSE_TYPE \|\| type === REACT_SUSPENSE_LIST_TYPE \|\| enableLegacyHidden \|\| type === REACT_OFFSCREEN_TYPE \|\| enableScopeAPI \|\| enableCacheElement \|\| enableTransitionTracing ) {\n return true;\n }\n\n if (typeof type === 'object' && type !== null) {\n if (type.$$typeof === REACT_LAZY_TYPE \|\| type.$$typeof === REACT_MEMO_TYPE \|\| type.$$typeof === REACT_PROVIDER_TYPE \|\| type.$$typeof === REACT_CONTEXT_TYPE \|\| type.$$typeof === REACT_FORWARD_REF_TYPE \|\| // This needs to include all possible module reference object\n // types supported by any Flight configuration anywhere since\n // we don't know which Flight build this will end up being used\n // with.\n type.$$typeof === REACT_MODULE_REFERENCE \|\| type.getModuleId !== undefined) {\n return true;\n }\n }\n\n return false;\n}\n\nfunction typeOf(object) {\n if (typeof object === 'object' && object !== null) {\n var $$typeof = object.$$typeof;\n\n switch ($$typeof) {\n case REACT_ELEMENT_TYPE:\n var type = object.type;\n\n switch (type) {\n case REACT_FRAGMENT_TYPE:\n case REACT_PROFILER_TYPE:\n case REACT_STRICT_MODE_TYPE:\n case REACT_SUSPENSE_TYPE:\n case REACT_SUSPENSE_LIST_TYPE:\n return type;\n\n default:\n var $$typeofType = type && type.$$typeof;\n\n switch ($$typeofType) {\n case REACT_SERVER_CONTEXT_TYPE:\n case REACT_CONTEXT_TYPE:\n case REACT_FORWARD_REF_TYPE:\n case REACT_LAZY_TYPE:\n case REACT_MEMO_TYPE:\n case REACT_PROVIDER_TYPE:\n return $$typeofType;\n\n default:\n return $$typeof;\n }\n\n }\n\n case REACT_PORTAL_TYPE:\n return $$typeof;\n }\n }\n\n return undefined;\n}\nvar ContextConsumer = REACT_CONTEXT_TYPE;\nvar ContextProvider = REACT_PROVIDER_TYPE;\nvar Element = REACT_ELEMENT_TYPE;\nvar ForwardRef = REACT_FORWARD_REF_TYPE;\nvar Fragment = REACT_FRAGMENT_TYPE;\nvar Lazy = REACT_LAZY_TYPE;\nvar Memo = REACT_MEMO_TYPE;\nvar Portal = REACT_PORTAL_TYPE;\nvar Profiler = REACT_PROFILER_TYPE;\nvar StrictMode = REACT_STRICT_MODE_TYPE;\nvar Suspense = REACT_SUSPENSE_TYPE;\nvar SuspenseList = REACT_SUSPENSE_LIST_TYPE;\nvar hasWarnedAboutDeprecatedIsAsyncMode = false;\nvar hasWarnedAboutDeprecatedIsConcurrentMode = false; // AsyncMode should be deprecated\n\nfunction isAsyncMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint\n\n console['warn']('The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 18+.');\n }\n }\n\n return false;\n}\nfunction isConcurrentMode(object) {\n {\n if (!hasWarnedAboutDeprecatedIsConcurrentMode) {\n hasWarnedAboutDeprecatedIsConcurrentMode = true; // Using console['warn'] to evade Babel and ESLint\n\n console['warn']('The ReactIs.isConcurrentMode() alias has been deprecated, ' + 'and will be removed in React 18+.');\n }\n }\n\n return false;\n}\nfunction isContextConsumer(object) {\n return typeOf(object) === REACT_CONTEXT_TYPE;\n}\nfunction isContextProvider(object) {\n return typeOf(object) === REACT_PROVIDER_TYPE;\n}\nfunction isElement(object) {\n return typeof object === 'object' && object !== null && object.$$typeof === REACT_ELEMENT_TYPE;\n}\nfunction isForwardRef(object) {\n return typeOf(object) === REACT_FORWARD_REF_TYPE;\n}\nfunction isFragment(object) {\n return typeOf(object) === REACT_FRAGMENT_TYPE;\n}\nfunction isLazy(object) {\n return typeOf(object) === REACT_LAZY_TYPE;\n}\nfunction isMemo(object) {\n return typeOf(object) === REACT_MEMO_TYPE;\n}\nfunction isPortal(object) {\n return typeOf(object) === REACT_PORTAL_TYPE;\n}\nfunction isProfiler(object) {\n return typeOf(object) === REACT_PROFILER_TYPE;\n}\nfunction isStrictMode(object) {\n return typeOf(object) === REACT_STRICT_MODE_TYPE;\n}\nfunction isSuspense(object) {\n return typeOf(object) === REACT_SUSPENSE_TYPE;\n}\nfunction isSuspenseList(object) {\n return typeOf(object) === REACT_SUSPENSE_LIST_TYPE;\n}\n\nexports.ContextConsumer = ContextConsumer;\nexports.ContextProvider = ContextProvider;\nexports.Element = Element;\nexports.ForwardRef = ForwardRef;\nexports.Fragment = Fragment;\nexports.Lazy = Lazy;\nexports.Memo = Memo;\nexports.Portal = Portal;\nexports.Profiler = Profiler;\nexports.StrictMode = StrictMode;\nexports.Suspense = Suspense;\nexports.SuspenseList = SuspenseList;\nexports.isAsyncMode = isAsyncMode;\nexports.isConcurrentMode = isConcurrentMode;\nexports.isContextConsumer = isContextConsumer;\nexports.isContextProvider = isContextProvider;\nexports.isElement = isElement;\nexports.isForwardRef = isForwardRef;\nexports.isFragment = isFragment;\nexports.isLazy = isLazy;\nexports.isMemo = isMemo;\nexports.isPortal = isPortal;\nexports.isProfiler = isProfiler;\nexports.isStrictMode = isStrictMode;\nexports.isSuspense = isSuspense;\nexports.isSuspenseList = isSuspenseList;\nexports.isValidElementType = isValidElementType;\nexports.typeOf = typeOf;\n })();\n}\n","'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n module.exports = require('./cjs/react-is.production.min.js');\n} else {\n module.exports = require('./cjs/react-is.development.js');\n}\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.test = exports.serialize = exports.default = void 0;\nvar ReactIs = _interopRequireWildcard(require('react-is'));\nvar _markup = require('./lib/markup');\nfunction _getRequireWildcardCache(nodeInterop) {\n if (typeof WeakMap !== 'function') return null;\n var cacheBabelInterop = new WeakMap();\n var cacheNodeInterop = new WeakMap();\n return (_getRequireWildcardCache = function (nodeInterop) {\n return nodeInterop ? cacheNodeInterop : cacheBabelInterop;\n })(nodeInterop);\n}\nfunction _interopRequireWildcard(obj, nodeInterop) {\n if (!nodeInterop && obj && obj.__esModule) {\n return obj;\n }\n if (obj === null \|\| (typeof obj !== 'object' && typeof obj !== 'function')) {\n return {default: obj};\n }\n var cache = _getRequireWildcardCache(nodeInterop);\n if (cache && cache.has(obj)) {\n return cache.get(obj);\n }\n var newObj = {};\n var hasPropertyDescriptor =\n Object.defineProperty && Object.getOwnPropertyDescriptor;\n for (var key in obj) {\n if (key !== 'default' && Object.prototype.hasOwnProperty.call(obj, key)) {\n var desc = hasPropertyDescriptor\n ? Object.getOwnPropertyDescriptor(obj, key)\n : null;\n if (desc && (desc.get \|\| desc.set)) {\n Object.defineProperty(newObj, key, desc);\n } else {\n newObj[key] = obj[key];\n }\n }\n }\n newObj.default = obj;\n if (cache) {\n cache.set(obj, newObj);\n }\n return newObj;\n}\n/\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\n// Given element.props.children, or subtree during recursive traversal,\n// return flattened array of children.\nconst getChildren = (arg, children = []) => {\n if (Array.isArray(arg)) {\n arg.forEach(item => {\n getChildren(item, children);\n });\n } else if (arg != null && arg !== false) {\n children.push(arg);\n }\n return children;\n};\nconst getType = element => {\n const type = element.type;\n if (typeof type === 'string') {\n return type;\n }\n if (typeof type === 'function') {\n return type.displayName \|\| type.name \|\| 'Unknown';\n }\n if (ReactIs.isFragment(element)) {\n return 'React.Fragment';\n }\n if (ReactIs.isSuspense(element)) {\n return 'React.Suspense';\n }\n if (typeof type === 'object' && type !== null) {\n if (ReactIs.isContextProvider(element)) {\n return 'Context.Provider';\n }\n if (ReactIs.isContextConsumer(element)) {\n return 'Context.Consumer';\n }\n if (ReactIs.isForwardRef(element)) {\n if (type.displayName) {\n return type.displayName;\n }\n const functionName = type.render.displayName \|\| type.render.name \|\| '';\n return functionName !== '' ? `ForwardRef(${functionName})` : 'ForwardRef';\n }\n if (ReactIs.isMemo(element)) {\n const functionName =\n type.displayName \|\| type.type.displayName \|\| type.type.name \|\| '';\n return functionName !== '' ? `Memo(${functionName})` : 'Memo';\n }\n }\n return 'UNDEFINED';\n};\nconst getPropKeys = element => {\n const {props} = element;\n return Object.keys(props)\n .filter(key => key !== 'children' && props[key] !== undefined)\n .sort();\n};\nconst serialize = (element, config, indentation, depth, refs, printer) =>\n ++depth > config.maxDepth\n ? (0, _markup.printElementAsLeaf)(getType(element), config)\n : (0, _markup.printElement)(\n getType(element),\n (0, _markup.printProps)(\n getPropKeys(element),\n element.props,\n config,\n indentation + config.indent,\n depth,\n refs,\n printer\n ),\n (0, _markup.printChildren)(\n getChildren(element.props.children),\n config,\n indentation + config.indent,\n depth,\n refs,\n printer\n ),\n config,\n indentation\n );\nexports.serialize = serialize;\nconst test = val => val != null && ReactIs.isElement(val);\nexports.test = test;\nconst plugin = {\n serialize,\n test\n};\nvar _default = plugin;\nexports.default = _default;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.test = exports.serialize = exports.default = void 0;\nvar _markup = require('./lib/markup');\nvar Symbol = globalThis['jest-symbol-do-not-touch'] \|\| globalThis.Symbol;\n/\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n// Child can be `number` in Stack renderer but not in Fiber renderer.\n\nconst testSymbol =\n typeof Symbol === 'function' && Symbol.for\n ? Symbol.for('react.test.json')\n : 0xea71357;\nconst getPropKeys = object => {\n const {props} = object;\n return props\n ? Object.keys(props)\n .filter(key => props[key] !== undefined)\n .sort()\n : [];\n};\nconst serialize = (object, config, indentation, depth, refs, printer) =>\n ++depth > config.maxDepth\n ? (0, _markup.printElementAsLeaf)(object.type, config)\n : (0, _markup.printElement)(\n object.type,\n object.props\n ? (0, _markup.printProps)(\n getPropKeys(object),\n object.props,\n config,\n indentation + config.indent,\n depth,\n refs,\n printer\n )\n : '',\n object.children\n ? (0, _markup.printChildren)(\n object.children,\n config,\n indentation + config.indent,\n depth,\n refs,\n printer\n )\n : '',\n config,\n indentation\n );\nexports.serialize = serialize;\nconst test = val => val && val.$$typeof === testSymbol;\nexports.test = test;\nconst plugin = {\n serialize,\n test\n};\nvar _default = plugin;\nexports.default = _default;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.default = exports.DEFAULT_OPTIONS = void 0;\nexports.format = format;\nexports.plugins = void 0;\nvar _ansiStyles = _interopRequireDefault(require('ansi-styles'));\nvar _collections = require('./collections');\nvar _AsymmetricMatcher = _interopRequireDefault(\n require('./plugins/AsymmetricMatcher')\n);\nvar _DOMCollection = _interopRequireDefault(require('./plugins/DOMCollection'));\nvar _DOMElement = _interopRequireDefault(require('./plugins/DOMElement'));\nvar _Immutable = _interopRequireDefault(require('./plugins/Immutable'));\nvar _ReactElement = _interopRequireDefault(require('./plugins/ReactElement'));\nvar _ReactTestComponent = _interopRequireDefault(\n require('./plugins/ReactTestComponent')\n);\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {default: obj};\n}\n/\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\n/ eslint-disable local/ban-types-eventually /\n\nconst toString = Object.prototype.toString;\nconst toISOString = Date.prototype.toISOString;\nconst errorToString = Error.prototype.toString;\nconst regExpToString = RegExp.prototype.toString;\n\n/\n Explicitly comparing typeof constructor to function avoids undefined as name\n * when mock identity-obj-proxy returns the key as the value for any key.\n /\nconst getConstructorName = val =>\n (typeof val.constructor === 'function' && val.constructor.name) \|\| 'Object';\n\n/ global window /\n/* Is val is equal to global window object? Works even if it does not exist :) /\nconst isWindow = val => typeof window !== 'undefined' && val === window;\nconst SYMBOL_REGEXP = /^Symbol\$(.)\$(.)$/;\nconst NEWLINE_REGEXP = /\\n/gi;\nclass PrettyFormatPluginError extends Error {\n constructor(message, stack) {\n super(message);\n this.stack = stack;\n this.name = this.constructor.name;\n }\n}\nfunction isToStringedArrayType(toStringed) {\n return (\n toStringed === '[object Array]' \|\|\n toStringed === '[object ArrayBuffer]' \|\|\n toStringed === '[object DataView]' \|\|\n toStringed === '[object Float32Array]' \|\|\n toStringed === '[object Float64Array]' \|\|\n toStringed === '[object Int8Array]' \|\|\n toStringed === '[object Int16Array]' \|\|\n toStringed === '[object Int32Array]' \|\|\n toStringed === '[object Uint8Array]' \|\|\n toStringed === '[object Uint8ClampedArray]' \|\|\n toStringed === '[object Uint16Array]' \|\|\n toStringed === '[object Uint32Array]'\n );\n}\nfunction printNumber(val) {\n return Object.is(val, -0) ? '-0' : String(val);\n}\nfunction printBigInt(val) {\n return String(`${val}n`);\n}\nfunction printFunction(val, printFunctionName) {\n if (!printFunctionName) {\n return '[Function]';\n }\n return `[Function ${val.name \|\| 'anonymous'}]`;\n}\nfunction printSymbol(val) {\n return String(val).replace(SYMBOL_REGEXP, 'Symbol($1)');\n}\nfunction printError(val) {\n return `[${errorToString.call(val)}]`;\n}\n\n/\n The first port of call for printing an object, handles most of the\n * data-types in JS.\n /\nfunction printBasicValue(val, printFunctionName, escapeRegex, escapeString) {\n if (val === true \|\| val === false) {\n return `${val}`;\n }\n if (val === undefined) {\n return 'undefined';\n }\n if (val === null) {\n return 'null';\n }\n const typeOf = typeof val;\n if (typeOf === 'number') {\n return printNumber(val);\n }\n if (typeOf === 'bigint') {\n return printBigInt(val);\n }\n if (typeOf === 'string') {\n if (escapeString) {\n return `\"${val.replace(/\"\|\\\\/g, '\\\\$&')}\"`;\n }\n return `\"${val}\"`;\n }\n if (typeOf === 'function') {\n return printFunction(val, printFunctionName);\n }\n if (typeOf === 'symbol') {\n return printSymbol(val);\n }\n const toStringed = toString.call(val);\n if (toStringed === '[object WeakMap]') {\n return 'WeakMap {}';\n }\n if (toStringed === '[object WeakSet]') {\n return 'WeakSet {}';\n }\n if (\n toStringed === '[object Function]' \|\|\n toStringed === '[object GeneratorFunction]'\n ) {\n return printFunction(val, printFunctionName);\n }\n if (toStringed === '[object Symbol]') {\n return printSymbol(val);\n }\n if (toStringed === '[object Date]') {\n return isNaN(+val) ? 'Date { NaN }' : toISOString.call(val);\n }\n if (toStringed === '[object Error]') {\n return printError(val);\n }\n if (toStringed === '[object RegExp]') {\n if (escapeRegex) {\n // https://github.com/benjamingr/RegExp.escape/blob/main/polyfill.js\n return regExpToString.call(val).replace(/[\\\\^$+?.()\|[\\]{}]/g, '\\\\$&');\n }\n return regExpToString.call(val);\n }\n if (val instanceof Error) {\n return printError(val);\n }\n return null;\n}\n\n/*\n Handles more complex objects ( such as objects with circular references.\n * maps and sets etc )\n /\nfunction printComplexValue(\n val,\n config,\n indentation,\n depth,\n refs,\n hasCalledToJSON\n) {\n if (refs.indexOf(val) !== -1) {\n return '[Circular]';\n }\n refs = refs.slice();\n refs.push(val);\n const hitMaxDepth = ++depth > config.maxDepth;\n const min = config.min;\n if (\n config.callToJSON &&\n !hitMaxDepth &&\n val.toJSON &&\n typeof val.toJSON === 'function' &&\n !hasCalledToJSON\n ) {\n return printer(val.toJSON(), config, indentation, depth, refs, true);\n }\n const toStringed = toString.call(val);\n if (toStringed === '[object Arguments]') {\n return hitMaxDepth\n ? '[Arguments]'\n : `${min ? '' : 'Arguments '}[${(0, _collections.printListItems)(\n val,\n config,\n indentation,\n depth,\n refs,\n printer\n )}]`;\n }\n if (isToStringedArrayType(toStringed)) {\n return hitMaxDepth\n ? `[${val.constructor.name}]`\n : `${\n min\n ? ''\n : !config.printBasicPrototype && val.constructor.name === 'Array'\n ? ''\n : `${val.constructor.name} `\n }[${(0, _collections.printListItems)(\n val,\n config,\n indentation,\n depth,\n refs,\n printer\n )}]`;\n }\n if (toStringed === '[object Map]') {\n return hitMaxDepth\n ? '[Map]'\n : `Map {${(0, _collections.printIteratorEntries)(\n val.entries(),\n config,\n indentation,\n depth,\n refs,\n printer,\n ' => '\n )}}`;\n }\n if (toStringed === '[object Set]') {\n return hitMaxDepth\n ? '[Set]'\n : `Set {${(0, _collections.printIteratorValues)(\n val.values(),\n config,\n indentation,\n depth,\n refs,\n printer\n )}}`;\n }\n\n // Avoid failure to serialize global window object in jsdom test environment.\n // For example, not even relevant if window is prop of React element.\n return hitMaxDepth \|\| isWindow(val)\n ? `[${getConstructorName(val)}]`\n : `${\n min\n ? ''\n : !config.printBasicPrototype && getConstructorName(val) === 'Object'\n ? ''\n : `${getConstructorName(val)} `\n }{${(0, _collections.printObjectProperties)(\n val,\n config,\n indentation,\n depth,\n refs,\n printer\n )}}`;\n}\nfunction isNewPlugin(plugin) {\n return plugin.serialize != null;\n}\nfunction printPlugin(plugin, val, config, indentation, depth, refs) {\n let printed;\n try {\n printed = isNewPlugin(plugin)\n ? plugin.serialize(val, config, indentation, depth, refs, printer)\n : plugin.print(\n val,\n valChild => printer(valChild, config, indentation, depth, refs),\n str => {\n const indentationNext = indentation + config.indent;\n return (\n indentationNext +\n str.replace(NEWLINE_REGEXP, `\\n${indentationNext}`)\n );\n },\n {\n edgeSpacing: config.spacingOuter,\n min: config.min,\n spacing: config.spacingInner\n },\n config.colors\n );\n } catch (error) {\n throw new PrettyFormatPluginError(error.message, error.stack);\n }\n if (typeof printed !== 'string') {\n throw new Error(\n `pretty-format: Plugin must return type \"string\" but instead returned \"${typeof printed}\".`\n );\n }\n return printed;\n}\nfunction findPlugin(plugins, val) {\n for (let p = 0; p < plugins.length; p++) {\n try {\n if (plugins[p].test(val)) {\n return plugins[p];\n }\n } catch (error) {\n throw new PrettyFormatPluginError(error.message, error.stack);\n }\n }\n return null;\n}\nfunction printer(val, config, indentation, depth, refs, hasCalledToJSON) {\n const plugin = findPlugin(config.plugins, val);\n if (plugin !== null) {\n return printPlugin(plugin, val, config, indentation, depth, refs);\n }\n const basicResult = printBasicValue(\n val,\n config.printFunctionName,\n config.escapeRegex,\n config.escapeString\n );\n if (basicResult !== null) {\n return basicResult;\n }\n return printComplexValue(\n val,\n config,\n indentation,\n depth,\n refs,\n hasCalledToJSON\n );\n}\nconst DEFAULT_THEME = {\n comment: 'gray',\n content: 'reset',\n prop: 'yellow',\n tag: 'cyan',\n value: 'green'\n};\nconst DEFAULT_THEME_KEYS = Object.keys(DEFAULT_THEME);\n\n// could be replaced by `satisfies` operator in the future: https://github.com/microsoft/TypeScript/issues/47920\nconst toOptionsSubtype = options => options;\nconst DEFAULT_OPTIONS = toOptionsSubtype({\n callToJSON: true,\n compareKeys: undefined,\n escapeRegex: false,\n escapeString: true,\n highlight: false,\n indent: 2,\n maxDepth: Infinity,\n maxWidth: Infinity,\n min: false,\n plugins: [],\n printBasicPrototype: true,\n printFunctionName: true,\n theme: DEFAULT_THEME\n});\nexports.DEFAULT_OPTIONS = DEFAULT_OPTIONS;\nfunction validateOptions(options) {\n Object.keys(options).forEach(key => {\n if (!Object.prototype.hasOwnProperty.call(DEFAULT_OPTIONS, key)) {\n throw new Error(`pretty-format: Unknown option \"${key}\".`);\n }\n });\n if (options.min && options.indent !== undefined && options.indent !== 0) {\n throw new Error(\n 'pretty-format: Options \"min\" and \"indent\" cannot be used together.'\n );\n }\n if (options.theme !== undefined) {\n if (options.theme === null) {\n throw new Error('pretty-format: Option \"theme\" must not be null.');\n }\n if (typeof options.theme !== 'object') {\n throw new Error(\n `pretty-format: Option \"theme\" must be of type \"object\" but instead received \"${typeof options.theme}\".`\n );\n }\n }\n}\nconst getColorsHighlight = options =>\n DEFAULT_THEME_KEYS.reduce((colors, key) => {\n const value =\n options.theme && options.theme[key] !== undefined\n ? options.theme[key]\n : DEFAULT_THEME[key];\n const color = value && _ansiStyles.default[value];\n if (\n color &&\n typeof color.close === 'string' &&\n typeof color.open === 'string'\n ) {\n colors[key] = color;\n } else {\n throw new Error(\n `pretty-format: Option \"theme\" has a key \"${key}\" whose value \"${value}\" is undefined in ansi-styles.`\n );\n }\n return colors;\n }, Object.create(null));\nconst getColorsEmpty = () =>\n DEFAULT_THEME_KEYS.reduce((colors, key) => {\n colors[key] = {\n close: '',\n open: ''\n };\n return colors;\n }, Object.create(null));\nconst getPrintFunctionName = options =>\n options?.printFunctionName ?? DEFAULT_OPTIONS.printFunctionName;\nconst getEscapeRegex = options =>\n options?.escapeRegex ?? DEFAULT_OPTIONS.escapeRegex;\nconst getEscapeString = options =>\n options?.escapeString ?? DEFAULT_OPTIONS.escapeString;\nconst getConfig = options => ({\n callToJSON: options?.callToJSON ?? DEFAULT_OPTIONS.callToJSON,\n colors: options?.highlight ? getColorsHighlight(options) : getColorsEmpty(),\n compareKeys:\n typeof options?.compareKeys === 'function' \|\| options?.compareKeys === null\n ? options.compareKeys\n : DEFAULT_OPTIONS.compareKeys,\n escapeRegex: getEscapeRegex(options),\n escapeString: getEscapeString(options),\n indent: options?.min\n ? ''\n : createIndent(options?.indent ?? DEFAULT_OPTIONS.indent),\n maxDepth: options?.maxDepth ?? DEFAULT_OPTIONS.maxDepth,\n maxWidth: options?.maxWidth ?? DEFAULT_OPTIONS.maxWidth,\n min: options?.min ?? DEFAULT_OPTIONS.min,\n plugins: options?.plugins ?? DEFAULT_OPTIONS.plugins,\n printBasicPrototype: options?.printBasicPrototype ?? true,\n printFunctionName: getPrintFunctionName(options),\n spacingInner: options?.min ? ' ' : '\\n',\n spacingOuter: options?.min ? '' : '\\n'\n});\nfunction createIndent(indent) {\n return new Array(indent + 1).join(' ');\n}\n\n/\n Returns a presentation string of your `val` object\n * @param val any potential JavaScript object\n * @param options Custom settings\n /\nfunction format(val, options) {\n if (options) {\n validateOptions(options);\n if (options.plugins) {\n const plugin = findPlugin(options.plugins, val);\n if (plugin !== null) {\n return printPlugin(plugin, val, getConfig(options), '', 0, []);\n }\n }\n }\n const basicResult = printBasicValue(\n val,\n getPrintFunctionName(options),\n getEscapeRegex(options),\n getEscapeString(options)\n );\n if (basicResult !== null) {\n return basicResult;\n }\n return printComplexValue(val, getConfig(options), '', 0, []);\n}\nconst plugins = {\n AsymmetricMatcher: _AsymmetricMatcher.default,\n DOMCollection: _DOMCollection.default,\n DOMElement: _DOMElement.default,\n Immutable: _Immutable.default,\n ReactElement: _ReactElement.default,\n ReactTestComponent: _ReactTestComponent.default\n};\nexports.plugins = plugins;\nvar _default = format;\nexports.default = _default;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.cleanupSemantic =\n exports.Diff =\n exports.DIFF_INSERT =\n exports.DIFF_EQUAL =\n exports.DIFF_DELETE =\n void 0;\n/\n Diff Match and Patch\n * Copyright 2018 The diff-match-patch Authors.\n * https://github.com/google/diff-match-patch\n \n Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n \n http://www.apache.org/licenses/LICENSE-2.0\n \n Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n /\n\n/\n @fileoverview Computes the difference between two texts to create a patch.\n * Applies the patch onto another text, allowing for errors.\n * @author fraser@google.com (Neil Fraser)\n /\n\n/\n CHANGES by pedrottimark to diff_match_patch_uncompressed.ts file:\n \n 1. Delete anything not needed to use diff_cleanupSemantic method\n * 2. Convert from prototype properties to var declarations\n * 3. Convert Diff to class from constructor and prototype\n * 4. Add type annotations for arguments and return values\n * 5. Add exports\n /\n\n/\n The data structure representing a diff is an array of tuples:\n * [[DIFF_DELETE, 'Hello'], [DIFF_INSERT, 'Goodbye'], [DIFF_EQUAL, ' world.']]\n * which means: delete 'Hello', add 'Goodbye' and keep ' world.'\n /\nvar DIFF_DELETE = -1;\nexports.DIFF_DELETE = DIFF_DELETE;\nvar DIFF_INSERT = 1;\nexports.DIFF_INSERT = DIFF_INSERT;\nvar DIFF_EQUAL = 0;\n\n/\n Class representing one diff tuple.\n * Attempts to look like a two-element array (which is what this used to be).\n * @param {number} op Operation, one of: DIFF_DELETE, DIFF_INSERT, DIFF_EQUAL.\n * @param {string} text Text to be deleted, inserted, or retained.\n * @constructor\n /\nexports.DIFF_EQUAL = DIFF_EQUAL;\nclass Diff {\n 0;\n 1;\n constructor(op, text) {\n this[0] = op;\n this[1] = text;\n }\n}\n\n/\n Determine the common prefix of two strings.\n * @param {string} text1 First string.\n * @param {string} text2 Second string.\n * @return {number} The number of characters common to the start of each\n * string.\n /\nexports.Diff = Diff;\nvar diff_commonPrefix = function (text1, text2) {\n // Quick check for common null cases.\n if (!text1 \|\| !text2 \|\| text1.charAt(0) != text2.charAt(0)) {\n return 0;\n }\n // Binary search.\n // Performance analysis: https://neil.fraser.name/news/2007/10/09/\n var pointermin = 0;\n var pointermax = Math.min(text1.length, text2.length);\n var pointermid = pointermax;\n var pointerstart = 0;\n while (pointermin < pointermid) {\n if (\n text1.substring(pointerstart, pointermid) ==\n text2.substring(pointerstart, pointermid)\n ) {\n pointermin = pointermid;\n pointerstart = pointermin;\n } else {\n pointermax = pointermid;\n }\n pointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);\n }\n return pointermid;\n};\n\n/\n Determine the common suffix of two strings.\n * @param {string} text1 First string.\n * @param {string} text2 Second string.\n * @return {number} The number of characters common to the end of each string.\n /\nvar diff_commonSuffix = function (text1, text2) {\n // Quick check for common null cases.\n if (\n !text1 \|\|\n !text2 \|\|\n text1.charAt(text1.length - 1) != text2.charAt(text2.length - 1)\n ) {\n return 0;\n }\n // Binary search.\n // Performance analysis: https://neil.fraser.name/news/2007/10/09/\n var pointermin = 0;\n var pointermax = Math.min(text1.length, text2.length);\n var pointermid = pointermax;\n var pointerend = 0;\n while (pointermin < pointermid) {\n if (\n text1.substring(text1.length - pointermid, text1.length - pointerend) ==\n text2.substring(text2.length - pointermid, text2.length - pointerend)\n ) {\n pointermin = pointermid;\n pointerend = pointermin;\n } else {\n pointermax = pointermid;\n }\n pointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);\n }\n return pointermid;\n};\n\n/\n Determine if the suffix of one string is the prefix of another.\n * @param {string} text1 First string.\n * @param {string} text2 Second string.\n * @return {number} The number of characters common to the end of the first\n * string and the start of the second string.\n * @private\n /\nvar diff_commonOverlap_ = function (text1, text2) {\n // Cache the text lengths to prevent multiple calls.\n var text1_length = text1.length;\n var text2_length = text2.length;\n // Eliminate the null case.\n if (text1_length == 0 \|\| text2_length == 0) {\n return 0;\n }\n // Truncate the longer string.\n if (text1_length > text2_length) {\n text1 = text1.substring(text1_length - text2_length);\n } else if (text1_length < text2_length) {\n text2 = text2.substring(0, text1_length);\n }\n var text_length = Math.min(text1_length, text2_length);\n // Quick check for the worst case.\n if (text1 == text2) {\n return text_length;\n }\n\n // Start by looking for a single character match\n // and increase length until no match is found.\n // Performance analysis: https://neil.fraser.name/news/2010/11/04/\n var best = 0;\n var length = 1;\n while (true) {\n var pattern = text1.substring(text_length - length);\n var found = text2.indexOf(pattern);\n if (found == -1) {\n return best;\n }\n length += found;\n if (\n found == 0 \|\|\n text1.substring(text_length - length) == text2.substring(0, length)\n ) {\n best = length;\n length++;\n }\n }\n};\n\n/\n Reduce the number of edits by eliminating semantically trivial equalities.\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\n /\nvar diff_cleanupSemantic = function (diffs) {\n var changes = false;\n var equalities = []; // Stack of indices where equalities are found.\n var equalitiesLength = 0; // Keeping our own length var is faster in JS.\n /* @type {?string} /\n var lastEquality = null;\n // Always equal to diffs[equalities[equalitiesLength - 1]][1]\n var pointer = 0; // Index of current position.\n // Number of characters that changed prior to the equality.\n var length_insertions1 = 0;\n var length_deletions1 = 0;\n // Number of characters that changed after the equality.\n var length_insertions2 = 0;\n var length_deletions2 = 0;\n while (pointer < diffs.length) {\n if (diffs[pointer][0] == DIFF_EQUAL) {\n // Equality found.\n equalities[equalitiesLength++] = pointer;\n length_insertions1 = length_insertions2;\n length_deletions1 = length_deletions2;\n length_insertions2 = 0;\n length_deletions2 = 0;\n lastEquality = diffs[pointer][1];\n } else {\n // An insertion or deletion.\n if (diffs[pointer][0] == DIFF_INSERT) {\n length_insertions2 += diffs[pointer][1].length;\n } else {\n length_deletions2 += diffs[pointer][1].length;\n }\n // Eliminate an equality that is smaller or equal to the edits on both\n // sides of it.\n if (\n lastEquality &&\n lastEquality.length <=\n Math.max(length_insertions1, length_deletions1) &&\n lastEquality.length <= Math.max(length_insertions2, length_deletions2)\n ) {\n // Duplicate record.\n diffs.splice(\n equalities[equalitiesLength - 1],\n 0,\n new Diff(DIFF_DELETE, lastEquality)\n );\n // Change second copy to insert.\n diffs[equalities[equalitiesLength - 1] + 1][0] = DIFF_INSERT;\n // Throw away the equality we just deleted.\n equalitiesLength--;\n // Throw away the previous equality (it needs to be reevaluated).\n equalitiesLength--;\n pointer = equalitiesLength > 0 ? equalities[equalitiesLength - 1] : -1;\n length_insertions1 = 0; // Reset the counters.\n length_deletions1 = 0;\n length_insertions2 = 0;\n length_deletions2 = 0;\n lastEquality = null;\n changes = true;\n }\n }\n pointer++;\n }\n\n // Normalize the diff.\n if (changes) {\n diff_cleanupMerge(diffs);\n }\n diff_cleanupSemanticLossless(diffs);\n\n // Find any overlaps between deletions and insertions.\n // e.g: <del>abcxxx</del><ins>xxxdef</ins>\n // -> <del>abc</del>xxx<ins>def</ins>\n // e.g: <del>xxxabc</del><ins>defxxx</ins>\n // -> <ins>def</ins>xxx<del>abc</del>\n // Only extract an overlap if it is as big as the edit ahead or behind it.\n pointer = 1;\n while (pointer < diffs.length) {\n if (\n diffs[pointer - 1][0] == DIFF_DELETE &&\n diffs[pointer][0] == DIFF_INSERT\n ) {\n var deletion = diffs[pointer - 1][1];\n var insertion = diffs[pointer][1];\n var overlap_length1 = diff_commonOverlap_(deletion, insertion);\n var overlap_length2 = diff_commonOverlap_(insertion, deletion);\n if (overlap_length1 >= overlap_length2) {\n if (\n overlap_length1 >= deletion.length / 2 \|\|\n overlap_length1 >= insertion.length / 2\n ) {\n // Overlap found. Insert an equality and trim the surrounding edits.\n diffs.splice(\n pointer,\n 0,\n new Diff(DIFF_EQUAL, insertion.substring(0, overlap_length1))\n );\n diffs[pointer - 1][1] = deletion.substring(\n 0,\n deletion.length - overlap_length1\n );\n diffs[pointer + 1][1] = insertion.substring(overlap_length1);\n pointer++;\n }\n } else {\n if (\n overlap_length2 >= deletion.length / 2 \|\|\n overlap_length2 >= insertion.length / 2\n ) {\n // Reverse overlap found.\n // Insert an equality and swap and trim the surrounding edits.\n diffs.splice(\n pointer,\n 0,\n new Diff(DIFF_EQUAL, deletion.substring(0, overlap_length2))\n );\n diffs[pointer - 1][0] = DIFF_INSERT;\n diffs[pointer - 1][1] = insertion.substring(\n 0,\n insertion.length - overlap_length2\n );\n diffs[pointer + 1][0] = DIFF_DELETE;\n diffs[pointer + 1][1] = deletion.substring(overlap_length2);\n pointer++;\n }\n }\n pointer++;\n }\n pointer++;\n }\n};\n\n/\n Look for single edits surrounded on both sides by equalities\n * which can be shifted sideways to align the edit to a word boundary.\n * e.g: The c<ins>at c</ins>ame. -> The <ins>cat </ins>came.\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\n /\nexports.cleanupSemantic = diff_cleanupSemantic;\nvar diff_cleanupSemanticLossless = function (diffs) {\n /\n Given two strings, compute a score representing whether the internal\n * boundary falls on logical boundaries.\n * Scores range from 6 (best) to 0 (worst).\n * Closure, but does not reference any external variables.\n * @param {string} one First string.\n * @param {string} two Second string.\n * @return {number} The score.\n * @private\n /\n function diff_cleanupSemanticScore_(one, two) {\n if (!one \|\| !two) {\n // Edges are the best.\n return 6;\n }\n\n // Each port of this function behaves slightly differently due to\n // subtle differences in each language's definition of things like\n // 'whitespace'. Since this function's purpose is largely cosmetic,\n // the choice has been made to use each language's native features\n // rather than force total conformity.\n var char1 = one.charAt(one.length - 1);\n var char2 = two.charAt(0);\n var nonAlphaNumeric1 = char1.match(nonAlphaNumericRegex_);\n var nonAlphaNumeric2 = char2.match(nonAlphaNumericRegex_);\n var whitespace1 = nonAlphaNumeric1 && char1.match(whitespaceRegex_);\n var whitespace2 = nonAlphaNumeric2 && char2.match(whitespaceRegex_);\n var lineBreak1 = whitespace1 && char1.match(linebreakRegex_);\n var lineBreak2 = whitespace2 && char2.match(linebreakRegex_);\n var blankLine1 = lineBreak1 && one.match(blanklineEndRegex_);\n var blankLine2 = lineBreak2 && two.match(blanklineStartRegex_);\n if (blankLine1 \|\| blankLine2) {\n // Five points for blank lines.\n return 5;\n } else if (lineBreak1 \|\| lineBreak2) {\n // Four points for line breaks.\n return 4;\n } else if (nonAlphaNumeric1 && !whitespace1 && whitespace2) {\n // Three points for end of sentences.\n return 3;\n } else if (whitespace1 \|\| whitespace2) {\n // Two points for whitespace.\n return 2;\n } else if (nonAlphaNumeric1 \|\| nonAlphaNumeric2) {\n // One point for non-alphanumeric.\n return 1;\n }\n return 0;\n }\n var pointer = 1;\n // Intentionally ignore the first and last element (don't need checking).\n while (pointer < diffs.length - 1) {\n if (\n diffs[pointer - 1][0] == DIFF_EQUAL &&\n diffs[pointer + 1][0] == DIFF_EQUAL\n ) {\n // This is a single edit surrounded by equalities.\n var equality1 = diffs[pointer - 1][1];\n var edit = diffs[pointer][1];\n var equality2 = diffs[pointer + 1][1];\n\n // First, shift the edit as far left as possible.\n var commonOffset = diff_commonSuffix(equality1, edit);\n if (commonOffset) {\n var commonString = edit.substring(edit.length - commonOffset);\n equality1 = equality1.substring(0, equality1.length - commonOffset);\n edit = commonString + edit.substring(0, edit.length - commonOffset);\n equality2 = commonString + equality2;\n }\n\n // Second, step character by character right, looking for the best fit.\n var bestEquality1 = equality1;\n var bestEdit = edit;\n var bestEquality2 = equality2;\n var bestScore =\n diff_cleanupSemanticScore_(equality1, edit) +\n diff_cleanupSemanticScore_(edit, equality2);\n while (edit.charAt(0) === equality2.charAt(0)) {\n equality1 += edit.charAt(0);\n edit = edit.substring(1) + equality2.charAt(0);\n equality2 = equality2.substring(1);\n var score =\n diff_cleanupSemanticScore_(equality1, edit) +\n diff_cleanupSemanticScore_(edit, equality2);\n // The >= encourages trailing rather than leading whitespace on edits.\n if (score >= bestScore) {\n bestScore = score;\n bestEquality1 = equality1;\n bestEdit = edit;\n bestEquality2 = equality2;\n }\n }\n if (diffs[pointer - 1][1] != bestEquality1) {\n // We have an improvement, save it back to the diff.\n if (bestEquality1) {\n diffs[pointer - 1][1] = bestEquality1;\n } else {\n diffs.splice(pointer - 1, 1);\n pointer--;\n }\n diffs[pointer][1] = bestEdit;\n if (bestEquality2) {\n diffs[pointer + 1][1] = bestEquality2;\n } else {\n diffs.splice(pointer + 1, 1);\n pointer--;\n }\n }\n }\n pointer++;\n }\n};\n\n// Define some regex patterns for matching boundaries.\nvar nonAlphaNumericRegex_ = /[^a-zA-Z0-9]/;\nvar whitespaceRegex_ = /\\s/;\nvar linebreakRegex_ = /[\\r\\n]/;\nvar blanklineEndRegex_ = /\\n\\r?\\n$/;\nvar blanklineStartRegex_ = /^\\r?\\n\\r?\\n/;\n\n/\n Reorder and merge like edit sections. Merge equalities.\n * Any edit section can move as long as it doesn't cross an equality.\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\n /\nvar diff_cleanupMerge = function (diffs) {\n // Add a dummy entry at the end.\n diffs.push(new Diff(DIFF_EQUAL, ''));\n var pointer = 0;\n var count_delete = 0;\n var count_insert = 0;\n var text_delete = '';\n var text_insert = '';\n var commonlength;\n while (pointer < diffs.length) {\n switch (diffs[pointer][0]) {\n case DIFF_INSERT:\n count_insert++;\n text_insert += diffs[pointer][1];\n pointer++;\n break;\n case DIFF_DELETE:\n count_delete++;\n text_delete += diffs[pointer][1];\n pointer++;\n break;\n case DIFF_EQUAL:\n // Upon reaching an equality, check for prior redundancies.\n if (count_delete + count_insert > 1) {\n if (count_delete !== 0 && count_insert !== 0) {\n // Factor out any common prefixies.\n commonlength = diff_commonPrefix(text_insert, text_delete);\n if (commonlength !== 0) {\n if (\n pointer - count_delete - count_insert > 0 &&\n diffs[pointer - count_delete - count_insert - 1][0] ==\n DIFF_EQUAL\n ) {\n diffs[pointer - count_delete - count_insert - 1][1] +=\n text_insert.substring(0, commonlength);\n } else {\n diffs.splice(\n 0,\n 0,\n new Diff(DIFF_EQUAL, text_insert.substring(0, commonlength))\n );\n pointer++;\n }\n text_insert = text_insert.substring(commonlength);\n text_delete = text_delete.substring(commonlength);\n }\n // Factor out any common suffixies.\n commonlength = diff_commonSuffix(text_insert, text_delete);\n if (commonlength !== 0) {\n diffs[pointer][1] =\n text_insert.substring(text_insert.length - commonlength) +\n diffs[pointer][1];\n text_insert = text_insert.substring(\n 0,\n text_insert.length - commonlength\n );\n text_delete = text_delete.substring(\n 0,\n text_delete.length - commonlength\n );\n }\n }\n // Delete the offending records and add the merged ones.\n pointer -= count_delete + count_insert;\n diffs.splice(pointer, count_delete + count_insert);\n if (text_delete.length) {\n diffs.splice(pointer, 0, new Diff(DIFF_DELETE, text_delete));\n pointer++;\n }\n if (text_insert.length) {\n diffs.splice(pointer, 0, new Diff(DIFF_INSERT, text_insert));\n pointer++;\n }\n pointer++;\n } else if (pointer !== 0 && diffs[pointer - 1][0] == DIFF_EQUAL) {\n // Merge this equality with the previous one.\n diffs[pointer - 1][1] += diffs[pointer][1];\n diffs.splice(pointer, 1);\n } else {\n pointer++;\n }\n count_insert = 0;\n count_delete = 0;\n text_delete = '';\n text_insert = '';\n break;\n }\n }\n if (diffs[diffs.length - 1][1] === '') {\n diffs.pop(); // Remove the dummy entry at the end.\n }\n\n // Second pass: look for single edits surrounded on both sides by equalities\n // which can be shifted sideways to eliminate an equality.\n // e.g: A<ins>BA</ins>C -> <ins>AB</ins>AC\n var changes = false;\n pointer = 1;\n // Intentionally ignore the first and last element (don't need checking).\n while (pointer < diffs.length - 1) {\n if (\n diffs[pointer - 1][0] == DIFF_EQUAL &&\n diffs[pointer + 1][0] == DIFF_EQUAL\n ) {\n // This is a single edit surrounded by equalities.\n if (\n diffs[pointer][1].substring(\n diffs[pointer][1].length - diffs[pointer - 1][1].length\n ) == diffs[pointer - 1][1]\n ) {\n // Shift the edit over the previous equality.\n diffs[pointer][1] =\n diffs[pointer - 1][1] +\n diffs[pointer][1].substring(\n 0,\n diffs[pointer][1].length - diffs[pointer - 1][1].length\n );\n diffs[pointer + 1][1] = diffs[pointer - 1][1] + diffs[pointer + 1][1];\n diffs.splice(pointer - 1, 1);\n changes = true;\n } else if (\n diffs[pointer][1].substring(0, diffs[pointer + 1][1].length) ==\n diffs[pointer + 1][1]\n ) {\n // Shift the edit over the next equality.\n diffs[pointer - 1][1] += diffs[pointer + 1][1];\n diffs[pointer][1] =\n diffs[pointer][1].substring(diffs[pointer + 1][1].length) +\n diffs[pointer + 1][1];\n diffs.splice(pointer + 1, 1);\n changes = true;\n }\n }\n pointer++;\n }\n // If shifts were made, the diff needs reordering and another shift sweep.\n if (changes) {\n diff_cleanupMerge(diffs);\n }\n};\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.SIMILAR_MESSAGE = exports.NO_DIFF_MESSAGE = void 0;\n/\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\nconst NO_DIFF_MESSAGE = 'Compared values have no visual difference.';\nexports.NO_DIFF_MESSAGE = NO_DIFF_MESSAGE;\nconst SIMILAR_MESSAGE =\n 'Compared values serialize to the same structure.\\n' +\n 'Printing internal object structure without calling `toJSON` instead.';\nexports.SIMILAR_MESSAGE = SIMILAR_MESSAGE;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.default = diffSequence;\n/\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n \n /\n\n// This diff-sequences package implements the linear space variation in\n// An O(ND) Difference Algorithm and Its Variations by Eugene W. Myers\n\n// Relationship in notation between Myers paper and this package:\n// A is a\n// N is aLength, aEnd - aStart, and so on\n// x is aIndex, aFirst, aLast, and so on\n// B is b\n// M is bLength, bEnd - bStart, and so on\n// y is bIndex, bFirst, bLast, and so on\n// Δ = N - M is negative of baDeltaLength = bLength - aLength\n// D is d\n// k is kF\n// k + Δ is kF = kR - baDeltaLength\n// V is aIndexesF or aIndexesR (see comment below about Indexes type)\n// index intervals [1, N] and [1, M] are [0, aLength) and [0, bLength)\n// starting point in forward direction (0, 0) is (-1, -1)\n// starting point in reverse direction (N + 1, M + 1) is (aLength, bLength)\n\n// The “edit graph” for sequences a and b corresponds to items:\n// in a on the horizontal axis\n// in b on the vertical axis\n//\n// Given a-coordinate of a point in a diagonal, you can compute b-coordinate.\n//\n// Forward diagonals kF:\n// zero diagonal intersects top left corner\n// positive diagonals intersect top edge\n// negative diagonals insersect left edge\n//\n// Reverse diagonals kR:\n// zero diagonal intersects bottom right corner\n// positive diagonals intersect right edge\n// negative diagonals intersect bottom edge\n\n// The graph contains a directed acyclic graph of edges:\n// horizontal: delete an item from a\n// vertical: insert an item from b\n// diagonal: common item in a and b\n//\n// The algorithm solves dual problems in the graph analogy:\n// Find longest common subsequence: path with maximum number of diagonal edges\n// Find shortest edit script: path with minimum number of non-diagonal edges\n\n// Input callback function compares items at indexes in the sequences.\n\n// Output callback function receives the number of adjacent items\n// and starting indexes of each common subsequence.\n// Either original functions or wrapped to swap indexes if graph is transposed.\n// Indexes in sequence a of last point of forward or reverse paths in graph.\n// Myers algorithm indexes by diagonal k which for negative is bad deopt in V8.\n// This package indexes by iF and iR which are greater than or equal to zero.\n// and also updates the index arrays in place to cut memory in half.\n// kF = 2 * iF - d\n// kR = d - 2 * iR\n// Division of index intervals in sequences a and b at the middle change.\n// Invariant: intervals do not have common items at the start or end.\nconst pkg = 'diff-sequences'; // for error messages\nconst NOT_YET_SET = 0; // small int instead of undefined to avoid deopt in V8\n\n// Return the number of common items that follow in forward direction.\n// The length of what Myers paper calls a “snake” in a forward path.\nconst countCommonItemsF = (aIndex, aEnd, bIndex, bEnd, isCommon) => {\n let nCommon = 0;\n while (aIndex < aEnd && bIndex < bEnd && isCommon(aIndex, bIndex)) {\n aIndex += 1;\n bIndex += 1;\n nCommon += 1;\n }\n return nCommon;\n};\n\n// Return the number of common items that precede in reverse direction.\n// The length of what Myers paper calls a “snake” in a reverse path.\nconst countCommonItemsR = (aStart, aIndex, bStart, bIndex, isCommon) => {\n let nCommon = 0;\n while (aStart <= aIndex && bStart <= bIndex && isCommon(aIndex, bIndex)) {\n aIndex -= 1;\n bIndex -= 1;\n nCommon += 1;\n }\n return nCommon;\n};\n\n// A simple function to extend forward paths from (d - 1) to d changes\n// when forward and reverse paths cannot yet overlap.\nconst extendPathsF = (\n d,\n aEnd,\n bEnd,\n bF,\n isCommon,\n aIndexesF,\n iMaxF // return the value because optimization might decrease it\n) => {\n // Unroll the first iteration.\n let iF = 0;\n let kF = -d; // kF = 2 * iF - d\n let aFirst = aIndexesF[iF]; // in first iteration always insert\n let aIndexPrev1 = aFirst; // prev value of [iF - 1] in next iteration\n aIndexesF[iF] += countCommonItemsF(\n aFirst + 1,\n aEnd,\n bF + aFirst - kF + 1,\n bEnd,\n isCommon\n );\n\n // Optimization: skip diagonals in which paths cannot ever overlap.\n const nF = d < iMaxF ? d : iMaxF;\n\n // The diagonals kF are odd when d is odd and even when d is even.\n for (iF += 1, kF += 2; iF <= nF; iF += 1, kF += 2) {\n // To get first point of path segment, move one change in forward direction\n // from last point of previous path segment in an adjacent diagonal.\n // In last possible iteration when iF === d and kF === d always delete.\n if (iF !== d && aIndexPrev1 < aIndexesF[iF]) {\n aFirst = aIndexesF[iF]; // vertical to insert from b\n } else {\n aFirst = aIndexPrev1 + 1; // horizontal to delete from a\n\n if (aEnd <= aFirst) {\n // Optimization: delete moved past right of graph.\n return iF - 1;\n }\n }\n\n // To get last point of path segment, move along diagonal of common items.\n aIndexPrev1 = aIndexesF[iF];\n aIndexesF[iF] =\n aFirst +\n countCommonItemsF(aFirst + 1, aEnd, bF + aFirst - kF + 1, bEnd, isCommon);\n }\n return iMaxF;\n};\n\n// A simple function to extend reverse paths from (d - 1) to d changes\n// when reverse and forward paths cannot yet overlap.\nconst extendPathsR = (\n d,\n aStart,\n bStart,\n bR,\n isCommon,\n aIndexesR,\n iMaxR // return the value because optimization might decrease it\n) => {\n // Unroll the first iteration.\n let iR = 0;\n let kR = d; // kR = d - 2 * iR\n let aFirst = aIndexesR[iR]; // in first iteration always insert\n let aIndexPrev1 = aFirst; // prev value of [iR - 1] in next iteration\n aIndexesR[iR] -= countCommonItemsR(\n aStart,\n aFirst - 1,\n bStart,\n bR + aFirst - kR - 1,\n isCommon\n );\n\n // Optimization: skip diagonals in which paths cannot ever overlap.\n const nR = d < iMaxR ? d : iMaxR;\n\n // The diagonals kR are odd when d is odd and even when d is even.\n for (iR += 1, kR -= 2; iR <= nR; iR += 1, kR -= 2) {\n // To get first point of path segment, move one change in reverse direction\n // from last point of previous path segment in an adjacent diagonal.\n // In last possible iteration when iR === d and kR === -d always delete.\n if (iR !== d && aIndexesR[iR] < aIndexPrev1) {\n aFirst = aIndexesR[iR]; // vertical to insert from b\n } else {\n aFirst = aIndexPrev1 - 1; // horizontal to delete from a\n\n if (aFirst < aStart) {\n // Optimization: delete moved past left of graph.\n return iR - 1;\n }\n }\n\n // To get last point of path segment, move along diagonal of common items.\n aIndexPrev1 = aIndexesR[iR];\n aIndexesR[iR] =\n aFirst -\n countCommonItemsR(\n aStart,\n aFirst - 1,\n bStart,\n bR + aFirst - kR - 1,\n isCommon\n );\n }\n return iMaxR;\n};\n\n// A complete function to extend forward paths from (d - 1) to d changes.\n// Return true if a path overlaps reverse path of (d - 1) changes in its diagonal.\nconst extendOverlappablePathsF = (\n d,\n aStart,\n aEnd,\n bStart,\n bEnd,\n isCommon,\n aIndexesF,\n iMaxF,\n aIndexesR,\n iMaxR,\n division // update prop values if return true\n) => {\n const bF = bStart - aStart; // bIndex = bF + aIndex - kF\n const aLength = aEnd - aStart;\n const bLength = bEnd - bStart;\n const baDeltaLength = bLength - aLength; // kF = kR - baDeltaLength\n\n // Range of diagonals in which forward and reverse paths might overlap.\n const kMinOverlapF = -baDeltaLength - (d - 1); // -(d - 1) <= kR\n const kMaxOverlapF = -baDeltaLength + (d - 1); // kR <= (d - 1)\n\n let aIndexPrev1 = NOT_YET_SET; // prev value of [iF - 1] in next iteration\n\n // Optimization: skip diagonals in which paths cannot ever overlap.\n const nF = d < iMaxF ? d : iMaxF;\n\n // The diagonals kF = 2 * iF - d are odd when d is odd and even when d is even.\n for (let iF = 0, kF = -d; iF <= nF; iF += 1, kF += 2) {\n // To get first point of path segment, move one change in forward direction\n // from last point of previous path segment in an adjacent diagonal.\n // In first iteration when iF === 0 and kF === -d always insert.\n // In last possible iteration when iF === d and kF === d always delete.\n const insert = iF === 0 \|\| (iF !== d && aIndexPrev1 < aIndexesF[iF]);\n const aLastPrev = insert ? aIndexesF[iF] : aIndexPrev1;\n const aFirst = insert\n ? aLastPrev // vertical to insert from b\n : aLastPrev + 1; // horizontal to delete from a\n\n // To get last point of path segment, move along diagonal of common items.\n const bFirst = bF + aFirst - kF;\n const nCommonF = countCommonItemsF(\n aFirst + 1,\n aEnd,\n bFirst + 1,\n bEnd,\n isCommon\n );\n const aLast = aFirst + nCommonF;\n aIndexPrev1 = aIndexesF[iF];\n aIndexesF[iF] = aLast;\n if (kMinOverlapF <= kF && kF <= kMaxOverlapF) {\n // Solve for iR of reverse path with (d - 1) changes in diagonal kF:\n // kR = kF + baDeltaLength\n // kR = (d - 1) - 2 * iR\n const iR = (d - 1 - (kF + baDeltaLength)) / 2;\n\n // If this forward path overlaps the reverse path in this diagonal,\n // then this is the middle change of the index intervals.\n if (iR <= iMaxR && aIndexesR[iR] - 1 <= aLast) {\n // Unlike the Myers algorithm which finds only the middle “snake”\n // this package can find two common subsequences per division.\n // Last point of previous path segment is on an adjacent diagonal.\n const bLastPrev = bF + aLastPrev - (insert ? kF + 1 : kF - 1);\n\n // Because of invariant that intervals preceding the middle change\n // cannot have common items at the end,\n // move in reverse direction along a diagonal of common items.\n const nCommonR = countCommonItemsR(\n aStart,\n aLastPrev,\n bStart,\n bLastPrev,\n isCommon\n );\n const aIndexPrevFirst = aLastPrev - nCommonR;\n const bIndexPrevFirst = bLastPrev - nCommonR;\n const aEndPreceding = aIndexPrevFirst + 1;\n const bEndPreceding = bIndexPrevFirst + 1;\n division.nChangePreceding = d - 1;\n if (d - 1 === aEndPreceding + bEndPreceding - aStart - bStart) {\n // Optimization: number of preceding changes in forward direction\n // is equal to number of items in preceding interval,\n // therefore it cannot contain any common items.\n division.aEndPreceding = aStart;\n division.bEndPreceding = bStart;\n } else {\n division.aEndPreceding = aEndPreceding;\n division.bEndPreceding = bEndPreceding;\n }\n division.nCommonPreceding = nCommonR;\n if (nCommonR !== 0) {\n division.aCommonPreceding = aEndPreceding;\n division.bCommonPreceding = bEndPreceding;\n }\n division.nCommonFollowing = nCommonF;\n if (nCommonF !== 0) {\n division.aCommonFollowing = aFirst + 1;\n division.bCommonFollowing = bFirst + 1;\n }\n const aStartFollowing = aLast + 1;\n const bStartFollowing = bFirst + nCommonF + 1;\n division.nChangeFollowing = d - 1;\n if (d - 1 === aEnd + bEnd - aStartFollowing - bStartFollowing) {\n // Optimization: number of changes in reverse direction\n // is equal to number of items in following interval,\n // therefore it cannot contain any common items.\n division.aStartFollowing = aEnd;\n division.bStartFollowing = bEnd;\n } else {\n division.aStartFollowing = aStartFollowing;\n division.bStartFollowing = bStartFollowing;\n }\n return true;\n }\n }\n }\n return false;\n};\n\n// A complete function to extend reverse paths from (d - 1) to d changes.\n// Return true if a path overlaps forward path of d changes in its diagonal.\nconst extendOverlappablePathsR = (\n d,\n aStart,\n aEnd,\n bStart,\n bEnd,\n isCommon,\n aIndexesF,\n iMaxF,\n aIndexesR,\n iMaxR,\n division // update prop values if return true\n) => {\n const bR = bEnd - aEnd; // bIndex = bR + aIndex - kR\n const aLength = aEnd - aStart;\n const bLength = bEnd - bStart;\n const baDeltaLength = bLength - aLength; // kR = kF + baDeltaLength\n\n // Range of diagonals in which forward and reverse paths might overlap.\n const kMinOverlapR = baDeltaLength - d; // -d <= kF\n const kMaxOverlapR = baDeltaLength + d; // kF <= d\n\n let aIndexPrev1 = NOT_YET_SET; // prev value of [iR - 1] in next iteration\n\n // Optimization: skip diagonals in which paths cannot ever overlap.\n const nR = d < iMaxR ? d : iMaxR;\n\n // The diagonals kR = d - 2 * iR are odd when d is odd and even when d is even.\n for (let iR = 0, kR = d; iR <= nR; iR += 1, kR -= 2) {\n // To get first point of path segment, move one change in reverse direction\n // from last point of previous path segment in an adjacent diagonal.\n // In first iteration when iR === 0 and kR === d always insert.\n // In last possible iteration when iR === d and kR === -d always delete.\n const insert = iR === 0 \|\| (iR !== d && aIndexesR[iR] < aIndexPrev1);\n const aLastPrev = insert ? aIndexesR[iR] : aIndexPrev1;\n const aFirst = insert\n ? aLastPrev // vertical to insert from b\n : aLastPrev - 1; // horizontal to delete from a\n\n // To get last point of path segment, move along diagonal of common items.\n const bFirst = bR + aFirst - kR;\n const nCommonR = countCommonItemsR(\n aStart,\n aFirst - 1,\n bStart,\n bFirst - 1,\n isCommon\n );\n const aLast = aFirst - nCommonR;\n aIndexPrev1 = aIndexesR[iR];\n aIndexesR[iR] = aLast;\n if (kMinOverlapR <= kR && kR <= kMaxOverlapR) {\n // Solve for iF of forward path with d changes in diagonal kR:\n // kF = kR - baDeltaLength\n // kF = 2 * iF - d\n const iF = (d + (kR - baDeltaLength)) / 2;\n\n // If this reverse path overlaps the forward path in this diagonal,\n // then this is a middle change of the index intervals.\n if (iF <= iMaxF && aLast - 1 <= aIndexesF[iF]) {\n const bLast = bFirst - nCommonR;\n division.nChangePreceding = d;\n if (d === aLast + bLast - aStart - bStart) {\n // Optimization: number of changes in reverse direction\n // is equal to number of items in preceding interval,\n // therefore it cannot contain any common items.\n division.aEndPreceding = aStart;\n division.bEndPreceding = bStart;\n } else {\n division.aEndPreceding = aLast;\n division.bEndPreceding = bLast;\n }\n division.nCommonPreceding = nCommonR;\n if (nCommonR !== 0) {\n // The last point of reverse path segment is start of common subsequence.\n division.aCommonPreceding = aLast;\n division.bCommonPreceding = bLast;\n }\n division.nChangeFollowing = d - 1;\n if (d === 1) {\n // There is no previous path segment.\n division.nCommonFollowing = 0;\n division.aStartFollowing = aEnd;\n division.bStartFollowing = bEnd;\n } else {\n // Unlike the Myers algorithm which finds only the middle “snake”\n // this package can find two common subsequences per division.\n // Last point of previous path segment is on an adjacent diagonal.\n const bLastPrev = bR + aLastPrev - (insert ? kR - 1 : kR + 1);\n\n // Because of invariant that intervals following the middle change\n // cannot have common items at the start,\n // move in forward direction along a diagonal of common items.\n const nCommonF = countCommonItemsF(\n aLastPrev,\n aEnd,\n bLastPrev,\n bEnd,\n isCommon\n );\n division.nCommonFollowing = nCommonF;\n if (nCommonF !== 0) {\n // The last point of reverse path segment is start of common subsequence.\n division.aCommonFollowing = aLastPrev;\n division.bCommonFollowing = bLastPrev;\n }\n const aStartFollowing = aLastPrev + nCommonF; // aFirstPrev\n const bStartFollowing = bLastPrev + nCommonF; // bFirstPrev\n\n if (d - 1 === aEnd + bEnd - aStartFollowing - bStartFollowing) {\n // Optimization: number of changes in forward direction\n // is equal to number of items in following interval,\n // therefore it cannot contain any common items.\n division.aStartFollowing = aEnd;\n division.bStartFollowing = bEnd;\n } else {\n division.aStartFollowing = aStartFollowing;\n division.bStartFollowing = bStartFollowing;\n }\n }\n return true;\n }\n }\n }\n return false;\n};\n\n// Given index intervals and input function to compare items at indexes,\n// divide at the middle change.\n//\n// DO NOT CALL if start === end, because interval cannot contain common items\n// and because this function will throw the “no overlap” error.\nconst divide = (\n nChange,\n aStart,\n aEnd,\n bStart,\n bEnd,\n isCommon,\n aIndexesF,\n aIndexesR,\n division // output\n) => {\n const bF = bStart - aStart; // bIndex = bF + aIndex - kF\n const bR = bEnd - aEnd; // bIndex = bR + aIndex - kR\n const aLength = aEnd - aStart;\n const bLength = bEnd - bStart;\n\n // Because graph has square or portrait orientation,\n // length difference is minimum number of items to insert from b.\n // Corresponding forward and reverse diagonals in graph\n // depend on length difference of the sequences:\n // kF = kR - baDeltaLength\n // kR = kF + baDeltaLength\n const baDeltaLength = bLength - aLength;\n\n // Optimization: max diagonal in graph intersects corner of shorter side.\n let iMaxF = aLength;\n let iMaxR = aLength;\n\n // Initialize no changes yet in forward or reverse direction:\n aIndexesF[0] = aStart - 1; // at open start of interval, outside closed start\n aIndexesR[0] = aEnd; // at open end of interval\n\n if (baDeltaLength % 2 === 0) {\n // The number of changes in paths is 2 * d if length difference is even.\n const dMin = (nChange \|\| baDeltaLength) / 2;\n const dMax = (aLength + bLength) / 2;\n for (let d = 1; d <= dMax; d += 1) {\n iMaxF = extendPathsF(d, aEnd, bEnd, bF, isCommon, aIndexesF, iMaxF);\n if (d < dMin) {\n iMaxR = extendPathsR(d, aStart, bStart, bR, isCommon, aIndexesR, iMaxR);\n } else if (\n // If a reverse path overlaps a forward path in the same diagonal,\n // return a division of the index intervals at the middle change.\n extendOverlappablePathsR(\n d,\n aStart,\n aEnd,\n bStart,\n bEnd,\n isCommon,\n aIndexesF,\n iMaxF,\n aIndexesR,\n iMaxR,\n division\n )\n ) {\n return;\n }\n }\n } else {\n // The number of changes in paths is 2 * d - 1 if length difference is odd.\n const dMin = ((nChange \|\| baDeltaLength) + 1) / 2;\n const dMax = (aLength + bLength + 1) / 2;\n\n // Unroll first half iteration so loop extends the relevant pairs of paths.\n // Because of invariant that intervals have no common items at start or end,\n // and limitation not to call divide with empty intervals,\n // therefore it cannot be called if a forward path with one change\n // would overlap a reverse path with no changes, even if dMin === 1.\n let d = 1;\n iMaxF = extendPathsF(d, aEnd, bEnd, bF, isCommon, aIndexesF, iMaxF);\n for (d += 1; d <= dMax; d += 1) {\n iMaxR = extendPathsR(\n d - 1,\n aStart,\n bStart,\n bR,\n isCommon,\n aIndexesR,\n iMaxR\n );\n if (d < dMin) {\n iMaxF = extendPathsF(d, aEnd, bEnd, bF, isCommon, aIndexesF, iMaxF);\n } else if (\n // If a forward path overlaps a reverse path in the same diagonal,\n // return a division of the index intervals at the middle change.\n extendOverlappablePathsF(\n d,\n aStart,\n aEnd,\n bStart,\n bEnd,\n isCommon,\n aIndexesF,\n iMaxF,\n aIndexesR,\n iMaxR,\n division\n )\n ) {\n return;\n }\n }\n }\n\n /* istanbul ignore next /\n throw new Error(\n `${pkg}: no overlap aStart=${aStart} aEnd=${aEnd} bStart=${bStart} bEnd=${bEnd}`\n );\n};\n\n// Given index intervals and input function to compare items at indexes,\n// return by output function the number of adjacent items and starting indexes\n// of each common subsequence. Divide and conquer with only linear space.\n//\n// The index intervals are half open [start, end) like array slice method.\n// DO NOT CALL if start === end, because interval cannot contain common items\n// and because divide function will throw the “no overlap” error.\nconst findSubsequences = (\n nChange,\n aStart,\n aEnd,\n bStart,\n bEnd,\n transposed,\n callbacks,\n aIndexesF,\n aIndexesR,\n division // temporary memory, not input nor output\n) => {\n if (bEnd - bStart < aEnd - aStart) {\n // Transpose graph so it has portrait instead of landscape orientation.\n // Always compare shorter to longer sequence for consistency and optimization.\n transposed = !transposed;\n if (transposed && callbacks.length === 1) {\n // Lazily wrap callback functions to swap args if graph is transposed.\n const {foundSubsequence, isCommon} = callbacks[0];\n callbacks[1] = {\n foundSubsequence: (nCommon, bCommon, aCommon) => {\n foundSubsequence(nCommon, aCommon, bCommon);\n },\n isCommon: (bIndex, aIndex) => isCommon(aIndex, bIndex)\n };\n }\n const tStart = aStart;\n const tEnd = aEnd;\n aStart = bStart;\n aEnd = bEnd;\n bStart = tStart;\n bEnd = tEnd;\n }\n const {foundSubsequence, isCommon} = callbacks[transposed ? 1 : 0];\n\n // Divide the index intervals at the middle change.\n divide(\n nChange,\n aStart,\n aEnd,\n bStart,\n bEnd,\n isCommon,\n aIndexesF,\n aIndexesR,\n division\n );\n const {\n nChangePreceding,\n aEndPreceding,\n bEndPreceding,\n nCommonPreceding,\n aCommonPreceding,\n bCommonPreceding,\n nCommonFollowing,\n aCommonFollowing,\n bCommonFollowing,\n nChangeFollowing,\n aStartFollowing,\n bStartFollowing\n } = division;\n\n // Unless either index interval is empty, they might contain common items.\n if (aStart < aEndPreceding && bStart < bEndPreceding) {\n // Recursely find and return common subsequences preceding the division.\n findSubsequences(\n nChangePreceding,\n aStart,\n aEndPreceding,\n bStart,\n bEndPreceding,\n transposed,\n callbacks,\n aIndexesF,\n aIndexesR,\n division\n );\n }\n\n // Return common subsequences that are adjacent to the middle change.\n if (nCommonPreceding !== 0) {\n foundSubsequence(nCommonPreceding, aCommonPreceding, bCommonPreceding);\n }\n if (nCommonFollowing !== 0) {\n foundSubsequence(nCommonFollowing, aCommonFollowing, bCommonFollowing);\n }\n\n // Unless either index interval is empty, they might contain common items.\n if (aStartFollowing < aEnd && bStartFollowing < bEnd) {\n // Recursely find and return common subsequences following the division.\n findSubsequences(\n nChangeFollowing,\n aStartFollowing,\n aEnd,\n bStartFollowing,\n bEnd,\n transposed,\n callbacks,\n aIndexesF,\n aIndexesR,\n division\n );\n }\n};\nconst validateLength = (name, arg) => {\n if (typeof arg !== 'number') {\n throw new TypeError(`${pkg}: ${name} typeof ${typeof arg} is not a number`);\n }\n if (!Number.isSafeInteger(arg)) {\n throw new RangeError(`${pkg}: ${name} value ${arg} is not a safe integer`);\n }\n if (arg < 0) {\n throw new RangeError(`${pkg}: ${name} value ${arg} is a negative integer`);\n }\n};\nconst validateCallback = (name, arg) => {\n const type = typeof arg;\n if (type !== 'function') {\n throw new TypeError(`${pkg}: ${name} typeof ${type} is not a function`);\n }\n};\n\n// Compare items in two sequences to find a longest common subsequence.\n// Given lengths of sequences and input function to compare items at indexes,\n// return by output function the number of adjacent items and starting indexes\n// of each common subsequence.\nfunction diffSequence(aLength, bLength, isCommon, foundSubsequence) {\n validateLength('aLength', aLength);\n validateLength('bLength', bLength);\n validateCallback('isCommon', isCommon);\n validateCallback('foundSubsequence', foundSubsequence);\n\n // Count common items from the start in the forward direction.\n const nCommonF = countCommonItemsF(0, aLength, 0, bLength, isCommon);\n if (nCommonF !== 0) {\n foundSubsequence(nCommonF, 0, 0);\n }\n\n // Unless both sequences consist of common items only,\n // find common items in the half-trimmed index intervals.\n if (aLength !== nCommonF \|\| bLength !== nCommonF) {\n // Invariant: intervals do not have common items at the start.\n // The start of an index interval is closed like array slice method.\n const aStart = nCommonF;\n const bStart = nCommonF;\n\n // Count common items from the end in the reverse direction.\n const nCommonR = countCommonItemsR(\n aStart,\n aLength - 1,\n bStart,\n bLength - 1,\n isCommon\n );\n\n // Invariant: intervals do not have common items at the end.\n // The end of an index interval is open like array slice method.\n const aEnd = aLength - nCommonR;\n const bEnd = bLength - nCommonR;\n\n // Unless one sequence consists of common items only,\n // therefore the other trimmed index interval consists of changes only,\n // find common items in the trimmed index intervals.\n const nCommonFR = nCommonF + nCommonR;\n if (aLength !== nCommonFR && bLength !== nCommonFR) {\n const nChange = 0; // number of change items is not yet known\n const transposed = false; // call the original unwrapped functions\n const callbacks = [\n {\n foundSubsequence,\n isCommon\n }\n ];\n\n // Indexes in sequence a of last points in furthest reaching paths\n // from outside the start at top left in the forward direction:\n const aIndexesF = [NOT_YET_SET];\n // from the end at bottom right in the reverse direction:\n const aIndexesR = [NOT_YET_SET];\n\n // Initialize one object as output of all calls to divide function.\n const division = {\n aCommonFollowing: NOT_YET_SET,\n aCommonPreceding: NOT_YET_SET,\n aEndPreceding: NOT_YET_SET,\n aStartFollowing: NOT_YET_SET,\n bCommonFollowing: NOT_YET_SET,\n bCommonPreceding: NOT_YET_SET,\n bEndPreceding: NOT_YET_SET,\n bStartFollowing: NOT_YET_SET,\n nChangeFollowing: NOT_YET_SET,\n nChangePreceding: NOT_YET_SET,\n nCommonFollowing: NOT_YET_SET,\n nCommonPreceding: NOT_YET_SET\n };\n\n // Find and return common subsequences in the trimmed index intervals.\n findSubsequences(\n nChange,\n aStart,\n aEnd,\n bStart,\n bEnd,\n transposed,\n callbacks,\n aIndexesF,\n aIndexesR,\n division\n );\n }\n if (nCommonR !== 0) {\n foundSubsequence(nCommonR, aEnd, bEnd);\n }\n }\n}\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.joinAlignedDiffsNoExpand = exports.joinAlignedDiffsExpand = void 0;\nvar _cleanupSemantic = require('./cleanupSemantic');\n/\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\nconst formatTrailingSpaces = (line, trailingSpaceFormatter) =>\n line.replace(/\\s+$/, match => trailingSpaceFormatter(match));\nconst printDiffLine = (\n line,\n isFirstOrLast,\n color,\n indicator,\n trailingSpaceFormatter,\n emptyFirstOrLastLinePlaceholder\n) =>\n line.length !== 0\n ? color(\n `${indicator} ${formatTrailingSpaces(line, trailingSpaceFormatter)}`\n )\n : indicator !== ' '\n ? color(indicator)\n : isFirstOrLast && emptyFirstOrLastLinePlaceholder.length !== 0\n ? color(`${indicator} ${emptyFirstOrLastLinePlaceholder}`)\n : '';\nconst printDeleteLine = (\n line,\n isFirstOrLast,\n {\n aColor,\n aIndicator,\n changeLineTrailingSpaceColor,\n emptyFirstOrLastLinePlaceholder\n }\n) =>\n printDiffLine(\n line,\n isFirstOrLast,\n aColor,\n aIndicator,\n changeLineTrailingSpaceColor,\n emptyFirstOrLastLinePlaceholder\n );\nconst printInsertLine = (\n line,\n isFirstOrLast,\n {\n bColor,\n bIndicator,\n changeLineTrailingSpaceColor,\n emptyFirstOrLastLinePlaceholder\n }\n) =>\n printDiffLine(\n line,\n isFirstOrLast,\n bColor,\n bIndicator,\n changeLineTrailingSpaceColor,\n emptyFirstOrLastLinePlaceholder\n );\nconst printCommonLine = (\n line,\n isFirstOrLast,\n {\n commonColor,\n commonIndicator,\n commonLineTrailingSpaceColor,\n emptyFirstOrLastLinePlaceholder\n }\n) =>\n printDiffLine(\n line,\n isFirstOrLast,\n commonColor,\n commonIndicator,\n commonLineTrailingSpaceColor,\n emptyFirstOrLastLinePlaceholder\n );\n\n// In GNU diff format, indexes are one-based instead of zero-based.\nconst createPatchMark = (aStart, aEnd, bStart, bEnd, {patchColor}) =>\n patchColor(\n `@@ -${aStart + 1},${aEnd - aStart} +${bStart + 1},${bEnd - bStart} @@`\n );\n\n// jest --no-expand\n//\n// Given array of aligned strings with inverse highlight formatting,\n// return joined lines with diff formatting (and patch marks, if needed).\nconst joinAlignedDiffsNoExpand = (diffs, options) => {\n const iLength = diffs.length;\n const nContextLines = options.contextLines;\n const nContextLines2 = nContextLines + nContextLines;\n\n // First pass: count output lines and see if it has patches.\n let jLength = iLength;\n let hasExcessAtStartOrEnd = false;\n let nExcessesBetweenChanges = 0;\n let i = 0;\n while (i !== iLength) {\n const iStart = i;\n while (i !== iLength && diffs[i][0] === _cleanupSemantic.DIFF_EQUAL) {\n i += 1;\n }\n if (iStart !== i) {\n if (iStart === 0) {\n // at start\n if (i > nContextLines) {\n jLength -= i - nContextLines; // subtract excess common lines\n hasExcessAtStartOrEnd = true;\n }\n } else if (i === iLength) {\n // at end\n const n = i - iStart;\n if (n > nContextLines) {\n jLength -= n - nContextLines; // subtract excess common lines\n hasExcessAtStartOrEnd = true;\n }\n } else {\n // between changes\n const n = i - iStart;\n if (n > nContextLines2) {\n jLength -= n - nContextLines2; // subtract excess common lines\n nExcessesBetweenChanges += 1;\n }\n }\n }\n while (i !== iLength && diffs[i][0] !== _cleanupSemantic.DIFF_EQUAL) {\n i += 1;\n }\n }\n const hasPatch = nExcessesBetweenChanges !== 0 \|\| hasExcessAtStartOrEnd;\n if (nExcessesBetweenChanges !== 0) {\n jLength += nExcessesBetweenChanges + 1; // add patch lines\n } else if (hasExcessAtStartOrEnd) {\n jLength += 1; // add patch line\n }\n\n const jLast = jLength - 1;\n const lines = [];\n let jPatchMark = 0; // index of placeholder line for current patch mark\n if (hasPatch) {\n lines.push(''); // placeholder line for first patch mark\n }\n\n // Indexes of expected or received lines in current patch:\n let aStart = 0;\n let bStart = 0;\n let aEnd = 0;\n let bEnd = 0;\n const pushCommonLine = line => {\n const j = lines.length;\n lines.push(printCommonLine(line, j === 0 \|\| j === jLast, options));\n aEnd += 1;\n bEnd += 1;\n };\n const pushDeleteLine = line => {\n const j = lines.length;\n lines.push(printDeleteLine(line, j === 0 \|\| j === jLast, options));\n aEnd += 1;\n };\n const pushInsertLine = line => {\n const j = lines.length;\n lines.push(printInsertLine(line, j === 0 \|\| j === jLast, options));\n bEnd += 1;\n };\n\n // Second pass: push lines with diff formatting (and patch marks, if needed).\n i = 0;\n while (i !== iLength) {\n let iStart = i;\n while (i !== iLength && diffs[i][0] === _cleanupSemantic.DIFF_EQUAL) {\n i += 1;\n }\n if (iStart !== i) {\n if (iStart === 0) {\n // at beginning\n if (i > nContextLines) {\n iStart = i - nContextLines;\n aStart = iStart;\n bStart = iStart;\n aEnd = aStart;\n bEnd = bStart;\n }\n for (let iCommon = iStart; iCommon !== i; iCommon += 1) {\n pushCommonLine(diffs[iCommon][1]);\n }\n } else if (i === iLength) {\n // at end\n const iEnd = i - iStart > nContextLines ? iStart + nContextLines : i;\n for (let iCommon = iStart; iCommon !== iEnd; iCommon += 1) {\n pushCommonLine(diffs[iCommon][1]);\n }\n } else {\n // between changes\n const nCommon = i - iStart;\n if (nCommon > nContextLines2) {\n const iEnd = iStart + nContextLines;\n for (let iCommon = iStart; iCommon !== iEnd; iCommon += 1) {\n pushCommonLine(diffs[iCommon][1]);\n }\n lines[jPatchMark] = createPatchMark(\n aStart,\n aEnd,\n bStart,\n bEnd,\n options\n );\n jPatchMark = lines.length;\n lines.push(''); // placeholder line for next patch mark\n\n const nOmit = nCommon - nContextLines2;\n aStart = aEnd + nOmit;\n bStart = bEnd + nOmit;\n aEnd = aStart;\n bEnd = bStart;\n for (let iCommon = i - nContextLines; iCommon !== i; iCommon += 1) {\n pushCommonLine(diffs[iCommon][1]);\n }\n } else {\n for (let iCommon = iStart; iCommon !== i; iCommon += 1) {\n pushCommonLine(diffs[iCommon][1]);\n }\n }\n }\n }\n while (i !== iLength && diffs[i][0] === _cleanupSemantic.DIFF_DELETE) {\n pushDeleteLine(diffs[i][1]);\n i += 1;\n }\n while (i !== iLength && diffs[i][0] === _cleanupSemantic.DIFF_INSERT) {\n pushInsertLine(diffs[i][1]);\n i += 1;\n }\n }\n if (hasPatch) {\n lines[jPatchMark] = createPatchMark(aStart, aEnd, bStart, bEnd, options);\n }\n return lines.join('\\n');\n};\n\n// jest --expand\n//\n// Given array of aligned strings with inverse highlight formatting,\n// return joined lines with diff formatting.\nexports.joinAlignedDiffsNoExpand = joinAlignedDiffsNoExpand;\nconst joinAlignedDiffsExpand = (diffs, options) =>\n diffs\n .map((diff, i, diffs) => {\n const line = diff[1];\n const isFirstOrLast = i === 0 \|\| i === diffs.length - 1;\n switch (diff[0]) {\n case _cleanupSemantic.DIFF_DELETE:\n return printDeleteLine(line, isFirstOrLast, options);\n case _cleanupSemantic.DIFF_INSERT:\n return printInsertLine(line, isFirstOrLast, options);\n default:\n return printCommonLine(line, isFirstOrLast, options);\n }\n })\n .join('\\n');\nexports.joinAlignedDiffsExpand = joinAlignedDiffsExpand;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.normalizeDiffOptions = exports.noColor = void 0;\nvar _chalk = _interopRequireDefault(require('chalk'));\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {default: obj};\n}\n/\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\nconst noColor = string => string;\nexports.noColor = noColor;\nconst DIFF_CONTEXT_DEFAULT = 5;\nconst OPTIONS_DEFAULT = {\n aAnnotation: 'Expected',\n aColor: _chalk.default.green,\n aIndicator: '-',\n bAnnotation: 'Received',\n bColor: _chalk.default.red,\n bIndicator: '+',\n changeColor: _chalk.default.inverse,\n changeLineTrailingSpaceColor: noColor,\n commonColor: _chalk.default.dim,\n commonIndicator: ' ',\n commonLineTrailingSpaceColor: noColor,\n compareKeys: undefined,\n contextLines: DIFF_CONTEXT_DEFAULT,\n emptyFirstOrLastLinePlaceholder: '',\n expand: true,\n includeChangeCounts: false,\n omitAnnotationLines: false,\n patchColor: _chalk.default.yellow\n};\nconst getCompareKeys = compareKeys =>\n compareKeys && typeof compareKeys === 'function'\n ? compareKeys\n : OPTIONS_DEFAULT.compareKeys;\nconst getContextLines = contextLines =>\n typeof contextLines === 'number' &&\n Number.isSafeInteger(contextLines) &&\n contextLines >= 0\n ? contextLines\n : DIFF_CONTEXT_DEFAULT;\n\n// Pure function returns options with all properties.\nconst normalizeDiffOptions = (options = {}) => ({\n ...OPTIONS_DEFAULT,\n ...options,\n compareKeys: getCompareKeys(options.compareKeys),\n contextLines: getContextLines(options.contextLines)\n});\nexports.normalizeDiffOptions = normalizeDiffOptions;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.printDiffLines =\n exports.diffLinesUnified2 =\n exports.diffLinesUnified =\n exports.diffLinesRaw =\n void 0;\nvar _diffSequences = _interopRequireDefault(require('diff-sequences'));\nvar _cleanupSemantic = require('./cleanupSemantic');\nvar _joinAlignedDiffs = require('./joinAlignedDiffs');\nvar _normalizeDiffOptions = require('./normalizeDiffOptions');\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {default: obj};\n}\n/\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\nconst isEmptyString = lines => lines.length === 1 && lines[0].length === 0;\nconst countChanges = diffs => {\n let a = 0;\n let b = 0;\n diffs.forEach(diff => {\n switch (diff[0]) {\n case _cleanupSemantic.DIFF_DELETE:\n a += 1;\n break;\n case _cleanupSemantic.DIFF_INSERT:\n b += 1;\n break;\n }\n });\n return {\n a,\n b\n };\n};\nconst printAnnotation = (\n {\n aAnnotation,\n aColor,\n aIndicator,\n bAnnotation,\n bColor,\n bIndicator,\n includeChangeCounts,\n omitAnnotationLines\n },\n changeCounts\n) => {\n if (omitAnnotationLines) {\n return '';\n }\n let aRest = '';\n let bRest = '';\n if (includeChangeCounts) {\n const aCount = String(changeCounts.a);\n const bCount = String(changeCounts.b);\n\n // Padding right aligns the ends of the annotations.\n const baAnnotationLengthDiff = bAnnotation.length - aAnnotation.length;\n const aAnnotationPadding = ' '.repeat(Math.max(0, baAnnotationLengthDiff));\n const bAnnotationPadding = ' '.repeat(Math.max(0, -baAnnotationLengthDiff));\n\n // Padding left aligns the ends of the counts.\n const baCountLengthDiff = bCount.length - aCount.length;\n const aCountPadding = ' '.repeat(Math.max(0, baCountLengthDiff));\n const bCountPadding = ' '.repeat(Math.max(0, -baCountLengthDiff));\n aRest = `${aAnnotationPadding} ${aIndicator} ${aCountPadding}${aCount}`;\n bRest = `${bAnnotationPadding} ${bIndicator} ${bCountPadding}${bCount}`;\n }\n const a = `${aIndicator} ${aAnnotation}${aRest}`;\n const b = `${bIndicator} ${bAnnotation}${bRest}`;\n return `${aColor(a)}\\n${bColor(b)}\\n\\n`;\n};\nconst printDiffLines = (diffs, options) =>\n printAnnotation(options, countChanges(diffs)) +\n (options.expand\n ? (0, _joinAlignedDiffs.joinAlignedDiffsExpand)(diffs, options)\n : (0, _joinAlignedDiffs.joinAlignedDiffsNoExpand)(diffs, options));\n\n// Compare two arrays of strings line-by-line. Format as comparison lines.\nexports.printDiffLines = printDiffLines;\nconst diffLinesUnified = (aLines, bLines, options) =>\n printDiffLines(\n diffLinesRaw(\n isEmptyString(aLines) ? [] : aLines,\n isEmptyString(bLines) ? [] : bLines\n ),\n (0, _normalizeDiffOptions.normalizeDiffOptions)(options)\n );\n\n// Given two pairs of arrays of strings:\n// Compare the pair of comparison arrays line-by-line.\n// Format the corresponding lines in the pair of displayable arrays.\nexports.diffLinesUnified = diffLinesUnified;\nconst diffLinesUnified2 = (\n aLinesDisplay,\n bLinesDisplay,\n aLinesCompare,\n bLinesCompare,\n options\n) => {\n if (isEmptyString(aLinesDisplay) && isEmptyString(aLinesCompare)) {\n aLinesDisplay = [];\n aLinesCompare = [];\n }\n if (isEmptyString(bLinesDisplay) && isEmptyString(bLinesCompare)) {\n bLinesDisplay = [];\n bLinesCompare = [];\n }\n if (\n aLinesDisplay.length !== aLinesCompare.length \|\|\n bLinesDisplay.length !== bLinesCompare.length\n ) {\n // Fall back to diff of display lines.\n return diffLinesUnified(aLinesDisplay, bLinesDisplay, options);\n }\n const diffs = diffLinesRaw(aLinesCompare, bLinesCompare);\n\n // Replace comparison lines with displayable lines.\n let aIndex = 0;\n let bIndex = 0;\n diffs.forEach(diff => {\n switch (diff[0]) {\n case _cleanupSemantic.DIFF_DELETE:\n diff[1] = aLinesDisplay[aIndex];\n aIndex += 1;\n break;\n case _cleanupSemantic.DIFF_INSERT:\n diff[1] = bLinesDisplay[bIndex];\n bIndex += 1;\n break;\n default:\n diff[1] = bLinesDisplay[bIndex];\n aIndex += 1;\n bIndex += 1;\n }\n });\n return printDiffLines(\n diffs,\n (0, _normalizeDiffOptions.normalizeDiffOptions)(options)\n );\n};\n\n// Compare two arrays of strings line-by-line.\nexports.diffLinesUnified2 = diffLinesUnified2;\nconst diffLinesRaw = (aLines, bLines) => {\n const aLength = aLines.length;\n const bLength = bLines.length;\n const isCommon = (aIndex, bIndex) => aLines[aIndex] === bLines[bIndex];\n const diffs = [];\n let aIndex = 0;\n let bIndex = 0;\n const foundSubsequence = (nCommon, aCommon, bCommon) => {\n for (; aIndex !== aCommon; aIndex += 1) {\n diffs.push(\n new _cleanupSemantic.Diff(_cleanupSemantic.DIFF_DELETE, aLines[aIndex])\n );\n }\n for (; bIndex !== bCommon; bIndex += 1) {\n diffs.push(\n new _cleanupSemantic.Diff(_cleanupSemantic.DIFF_INSERT, bLines[bIndex])\n );\n }\n for (; nCommon !== 0; nCommon -= 1, aIndex += 1, bIndex += 1) {\n diffs.push(\n new _cleanupSemantic.Diff(_cleanupSemantic.DIFF_EQUAL, bLines[bIndex])\n );\n }\n };\n (0, _diffSequences.default)(aLength, bLength, isCommon, foundSubsequence);\n\n // After the last common subsequence, push remaining change items.\n for (; aIndex !== aLength; aIndex += 1) {\n diffs.push(\n new _cleanupSemantic.Diff(_cleanupSemantic.DIFF_DELETE, aLines[aIndex])\n );\n }\n for (; bIndex !== bLength; bIndex += 1) {\n diffs.push(\n new _cleanupSemantic.Diff(_cleanupSemantic.DIFF_INSERT, bLines[bIndex])\n );\n }\n return diffs;\n};\nexports.diffLinesRaw = diffLinesRaw;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.default = void 0;\nvar _diffSequences = _interopRequireDefault(require('diff-sequences'));\nvar _cleanupSemantic = require('./cleanupSemantic');\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {default: obj};\n}\n/\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\nconst diffStrings = (a, b) => {\n const isCommon = (aIndex, bIndex) => a[aIndex] === b[bIndex];\n let aIndex = 0;\n let bIndex = 0;\n const diffs = [];\n const foundSubsequence = (nCommon, aCommon, bCommon) => {\n if (aIndex !== aCommon) {\n diffs.push(\n new _cleanupSemantic.Diff(\n _cleanupSemantic.DIFF_DELETE,\n a.slice(aIndex, aCommon)\n )\n );\n }\n if (bIndex !== bCommon) {\n diffs.push(\n new _cleanupSemantic.Diff(\n _cleanupSemantic.DIFF_INSERT,\n b.slice(bIndex, bCommon)\n )\n );\n }\n aIndex = aCommon + nCommon; // number of characters compared in a\n bIndex = bCommon + nCommon; // number of characters compared in b\n diffs.push(\n new _cleanupSemantic.Diff(\n _cleanupSemantic.DIFF_EQUAL,\n b.slice(bCommon, bIndex)\n )\n );\n };\n (0, _diffSequences.default)(a.length, b.length, isCommon, foundSubsequence);\n\n // After the last common subsequence, push remaining change items.\n if (aIndex !== a.length) {\n diffs.push(\n new _cleanupSemantic.Diff(_cleanupSemantic.DIFF_DELETE, a.slice(aIndex))\n );\n }\n if (bIndex !== b.length) {\n diffs.push(\n new _cleanupSemantic.Diff(_cleanupSemantic.DIFF_INSERT, b.slice(bIndex))\n );\n }\n return diffs;\n};\nvar _default = diffStrings;\nexports.default = _default;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.default = void 0;\nvar _cleanupSemantic = require('./cleanupSemantic');\n/\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\n// Given change op and array of diffs, return concatenated string:\n// include common strings\n// * include change strings which have argument op with changeColor\n// * exclude change strings which have opposite op\nconst concatenateRelevantDiffs = (op, diffs, changeColor) =>\n diffs.reduce(\n (reduced, diff) =>\n reduced +\n (diff[0] === _cleanupSemantic.DIFF_EQUAL\n ? diff[1]\n : diff[0] === op && diff[1].length !== 0 // empty if change is newline\n ? changeColor(diff[1])\n : ''),\n ''\n );\n\n// Encapsulate change lines until either a common newline or the end.\nclass ChangeBuffer {\n op;\n line; // incomplete line\n lines; // complete lines\n changeColor;\n constructor(op, changeColor) {\n this.op = op;\n this.line = [];\n this.lines = [];\n this.changeColor = changeColor;\n }\n pushSubstring(substring) {\n this.pushDiff(new _cleanupSemantic.Diff(this.op, substring));\n }\n pushLine() {\n // Assume call only if line has at least one diff,\n // therefore an empty line must have a diff which has an empty string.\n\n // If line has multiple diffs, then assume it has a common diff,\n // therefore change diffs have change color;\n // otherwise then it has line color only.\n this.lines.push(\n this.line.length !== 1\n ? new _cleanupSemantic.Diff(\n this.op,\n concatenateRelevantDiffs(this.op, this.line, this.changeColor)\n )\n : this.line[0][0] === this.op\n ? this.line[0] // can use instance\n : new _cleanupSemantic.Diff(this.op, this.line[0][1]) // was common diff\n );\n\n this.line.length = 0;\n }\n isLineEmpty() {\n return this.line.length === 0;\n }\n\n // Minor input to buffer.\n pushDiff(diff) {\n this.line.push(diff);\n }\n\n // Main input to buffer.\n align(diff) {\n const string = diff[1];\n if (string.includes('\\n')) {\n const substrings = string.split('\\n');\n const iLast = substrings.length - 1;\n substrings.forEach((substring, i) => {\n if (i < iLast) {\n // The first substring completes the current change line.\n // A middle substring is a change line.\n this.pushSubstring(substring);\n this.pushLine();\n } else if (substring.length !== 0) {\n // The last substring starts a change line, if it is not empty.\n // Important: This non-empty condition also automatically omits\n // the newline appended to the end of expected and received strings.\n this.pushSubstring(substring);\n }\n });\n } else {\n // Append non-multiline string to current change line.\n this.pushDiff(diff);\n }\n }\n\n // Output from buffer.\n moveLinesTo(lines) {\n if (!this.isLineEmpty()) {\n this.pushLine();\n }\n lines.push(...this.lines);\n this.lines.length = 0;\n }\n}\n\n// Encapsulate common and change lines.\nclass CommonBuffer {\n deleteBuffer;\n insertBuffer;\n lines;\n constructor(deleteBuffer, insertBuffer) {\n this.deleteBuffer = deleteBuffer;\n this.insertBuffer = insertBuffer;\n this.lines = [];\n }\n pushDiffCommonLine(diff) {\n this.lines.push(diff);\n }\n pushDiffChangeLines(diff) {\n const isDiffEmpty = diff[1].length === 0;\n\n // An empty diff string is redundant, unless a change line is empty.\n if (!isDiffEmpty \|\| this.deleteBuffer.isLineEmpty()) {\n this.deleteBuffer.pushDiff(diff);\n }\n if (!isDiffEmpty \|\| this.insertBuffer.isLineEmpty()) {\n this.insertBuffer.pushDiff(diff);\n }\n }\n flushChangeLines() {\n this.deleteBuffer.moveLinesTo(this.lines);\n this.insertBuffer.moveLinesTo(this.lines);\n }\n\n // Input to buffer.\n align(diff) {\n const op = diff[0];\n const string = diff[1];\n if (string.includes('\\n')) {\n const substrings = string.split('\\n');\n const iLast = substrings.length - 1;\n substrings.forEach((substring, i) => {\n if (i === 0) {\n const subdiff = new _cleanupSemantic.Diff(op, substring);\n if (\n this.deleteBuffer.isLineEmpty() &&\n this.insertBuffer.isLineEmpty()\n ) {\n // If both current change lines are empty,\n // then the first substring is a common line.\n this.flushChangeLines();\n this.pushDiffCommonLine(subdiff);\n } else {\n // If either current change line is non-empty,\n // then the first substring completes the change lines.\n this.pushDiffChangeLines(subdiff);\n this.flushChangeLines();\n }\n } else if (i < iLast) {\n // A middle substring is a common line.\n this.pushDiffCommonLine(new _cleanupSemantic.Diff(op, substring));\n } else if (substring.length !== 0) {\n // The last substring starts a change line, if it is not empty.\n // Important: This non-empty condition also automatically omits\n // the newline appended to the end of expected and received strings.\n this.pushDiffChangeLines(new _cleanupSemantic.Diff(op, substring));\n }\n });\n } else {\n // Append non-multiline string to current change lines.\n // Important: It cannot be at the end following empty change lines,\n // because newline appended to the end of expected and received strings.\n this.pushDiffChangeLines(diff);\n }\n }\n\n // Output from buffer.\n getLines() {\n this.flushChangeLines();\n return this.lines;\n }\n}\n\n// Given diffs from expected and received strings,\n// return new array of diffs split or joined into lines.\n//\n// To correctly align a change line at the end, the algorithm:\n// * assumes that a newline was appended to the strings\n// * omits the last newline from the output array\n//\n// Assume the function is not called:\n// * if either expected or received is empty string\n// * if neither expected nor received is multiline string\nconst getAlignedDiffs = (diffs, changeColor) => {\n const deleteBuffer = new ChangeBuffer(\n _cleanupSemantic.DIFF_DELETE,\n changeColor\n );\n const insertBuffer = new ChangeBuffer(\n _cleanupSemantic.DIFF_INSERT,\n changeColor\n );\n const commonBuffer = new CommonBuffer(deleteBuffer, insertBuffer);\n diffs.forEach(diff => {\n switch (diff[0]) {\n case _cleanupSemantic.DIFF_DELETE:\n deleteBuffer.align(diff);\n break;\n case _cleanupSemantic.DIFF_INSERT:\n insertBuffer.align(diff);\n break;\n default:\n commonBuffer.align(diff);\n }\n });\n return commonBuffer.getLines();\n};\nvar _default = getAlignedDiffs;\nexports.default = _default;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nexports.diffStringsUnified = exports.diffStringsRaw = void 0;\nvar _cleanupSemantic = require('./cleanupSemantic');\nvar _diffLines = require('./diffLines');\nvar _diffStrings = _interopRequireDefault(require('./diffStrings'));\nvar _getAlignedDiffs = _interopRequireDefault(require('./getAlignedDiffs'));\nvar _normalizeDiffOptions = require('./normalizeDiffOptions');\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {default: obj};\n}\n/*\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\n\nconst hasCommonDiff = (diffs, isMultiline) => {\n if (isMultiline) {\n // Important: Ignore common newline that was appended to multiline strings!\n const iLast = diffs.length - 1;\n return diffs.some(\n (diff, i) =>\n diff[0] === _cleanupSemantic.DIFF_EQUAL &&\n (i !== iLast \|\| diff[1] !== '\\n')\n );\n }\n return diffs.some(diff => diff[0] === _cleanupSemantic.DIFF_EQUAL);\n};\n\n// Compare two strings character-by-character.\n// Format as comparison lines in which changed substrings have inverse colors.\nconst diffStringsUnified = (a, b, options) => {\n if (a !== b && a.length !== 0 && b.length !== 0) {\n const isMultiline = a.includes('\\n') \|\| b.includes('\\n');\n\n // getAlignedDiffs assumes that a newline was appended to the strings.\n const diffs = diffStringsRaw(\n isMultiline ? `${a}\\n` : a,\n isMultiline ? `${b}\\n` : b,\n true // cleanupSemantic\n );\n\n if (hasCommonDiff(diffs, isMultiline)) {\n const optionsNormalized = (0, _normalizeDiffOptions.normalizeDiffOptions)(\n options\n );\n const lines = (0, _getAlignedDiffs.default)(\n diffs,\n optionsNormalized.changeColor\n );\n return (0, _diffLines.printDiffLines)(lines, optionsNormalized);\n }\n }\n\n // Fall back to line-by-line diff.\n return (0, _diffLines.diffLinesUnified)(\n a.split('\\n'),\n b.split('\\n'),\n options\n );\n};\n\n// Compare two strings character-by-character.\n// Optionally clean up small common substrings, also known as chaff.\nexports.diffStringsUnified = diffStringsUnified;\nconst diffStringsRaw = (a, b, cleanup) => {\n const diffs = (0, _diffStrings.default)(a, b);\n if (cleanup) {\n (0, _cleanupSemantic.cleanupSemantic)(diffs); // impure function\n }\n\n return diffs;\n};\nexports.diffStringsRaw = diffStringsRaw;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', {\n value: true\n});\nObject.defineProperty(exports, 'DIFF_DELETE', {\n enumerable: true,\n get: function () {\n return _cleanupSemantic.DIFF_DELETE;\n }\n});\nObject.defineProperty(exports, 'DIFF_EQUAL', {\n enumerable: true,\n get: function () {\n return _cleanupSemantic.DIFF_EQUAL;\n }\n});\nObject.defineProperty(exports, 'DIFF_INSERT', {\n enumerable: true,\n get: function () {\n return _cleanupSemantic.DIFF_INSERT;\n }\n});\nObject.defineProperty(exports, 'Diff', {\n enumerable: true,\n get: function () {\n return _cleanupSemantic.Diff;\n }\n});\nexports.diff = diff;\nObject.defineProperty(exports, 'diffLinesRaw', {\n enumerable: true,\n get: function () {\n return _diffLines.diffLinesRaw;\n }\n});\nObject.defineProperty(exports, 'diffLinesUnified', {\n enumerable: true,\n get: function () {\n return _diffLines.diffLinesUnified;\n }\n});\nObject.defineProperty(exports, 'diffLinesUnified2', {\n enumerable: true,\n get: function () {\n return _diffLines.diffLinesUnified2;\n }\n});\nObject.defineProperty(exports, 'diffStringsRaw', {\n enumerable: true,\n get: function () {\n return _printDiffs.diffStringsRaw;\n }\n});\nObject.defineProperty(exports, 'diffStringsUnified', {\n enumerable: true,\n get: function () {\n return _printDiffs.diffStringsUnified;\n }\n});\nvar _chalk = _interopRequireDefault(require('chalk'));\nvar _jestGetType = require('jest-get-type');\nvar _prettyFormat = require('pretty-format');\nvar _cleanupSemantic = require('./cleanupSemantic');\nvar _constants = require('./constants');\nvar _diffLines = require('./diffLines');\nvar _normalizeDiffOptions = require('./normalizeDiffOptions');\nvar _printDiffs = require('./printDiffs');\nfunction _interopRequireDefault(obj) {\n return obj && obj.__esModule ? obj : {default: obj};\n}\nvar Symbol = globalThis['jest-symbol-do-not-touch'] \|\| globalThis.Symbol;\n/\n Copyright (c) Meta Platforms, Inc. and affiliates.\n \n This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n /\nconst getCommonMessage = (message, options) => {\n const {commonColor} = (0, _normalizeDiffOptions.normalizeDiffOptions)(\n options\n );\n return commonColor(message);\n};\nconst {\n AsymmetricMatcher,\n DOMCollection,\n DOMElement,\n Immutable,\n ReactElement,\n ReactTestComponent\n} = _prettyFormat.plugins;\nconst PLUGINS = [\n ReactTestComponent,\n ReactElement,\n DOMElement,\n DOMCollection,\n Immutable,\n AsymmetricMatcher\n];\nconst FORMAT_OPTIONS = {\n plugins: PLUGINS\n};\nconst FALLBACK_FORMAT_OPTIONS = {\n callToJSON: false,\n maxDepth: 10,\n plugins: PLUGINS\n};\n\n// Generate a string that will highlight the difference between two values\n// with green and red. (similar to how github does code diffing)\n// eslint-disable-next-line @typescript-eslint/explicit-module-boundary-types\nfunction diff(a, b, options) {\n if (Object.is(a, b)) {\n return getCommonMessage(_constants.NO_DIFF_MESSAGE, options);\n }\n const aType = (0, _jestGetType.getType)(a);\n let expectedType = aType;\n let omitDifference = false;\n if (aType === 'object' && typeof a.asymmetricMatch === 'function') {\n if (a.$$typeof !== Symbol.for('jest.asymmetricMatcher')) {\n // Do not know expected type of user-defined asymmetric matcher.\n return null;\n }\n if (typeof a.getExpectedType !== 'function') {\n // For example, expect.anything() matches either null or undefined\n return null;\n }\n expectedType = a.getExpectedType();\n // Primitive types boolean and number omit difference below.\n // For example, omit difference for expect.stringMatching(regexp)\n omitDifference = expectedType === 'string';\n }\n if (expectedType !== (0, _jestGetType.getType)(b)) {\n return (\n ' Comparing two different types of values.' +\n ` Expected ${_chalk.default.green(expectedType)} but ` +\n `received ${_chalk.default.red((0, _jestGetType.getType)(b))}.`\n );\n }\n if (omitDifference) {\n return null;\n }\n switch (aType) {\n case 'string':\n return (0, _diffLines.diffLinesUnified)(\n a.split('\\n'),\n b.split('\\n'),\n options\n );\n case 'boolean':\n case 'number':\n return comparePrimitive(a, b, options);\n case 'map':\n return compareObjects(sortMap(a), sortMap(b), options);\n case 'set':\n return compareObjects(sortSet(a), sortSet(b), options);\n default:\n return compareObjects(a, b, options);\n }\n}\nfunction comparePrimitive(a, b, options) {\n const aFormat = (0, _prettyFormat.format)(a, FORMAT_OPTIONS);\n const bFormat = (0, _prettyFormat.format)(b, FORMAT_OPTIONS);\n return aFormat === bFormat\n ? getCommonMessage(_constants.NO_DIFF_MESSAGE, options)\n : (0, _diffLines.diffLinesUnified)(\n aFormat.split('\\n'),\n bFormat.split('\\n'),\n options\n );\n}\nfunction sortMap(map) {\n return new Map(Array.from(map.entries()).sort());\n}\nfunction sortSet(set) {\n return new Set(Array.from(set.values()).sort());\n}\nfunction compareObjects(a, b, options) {\n let difference;\n let hasThrown = false;\n try {\n const formatOptions = getFormatOptions(FORMAT_OPTIONS, options);\n difference = getObjectsDifference(a, b, formatOptions, options);\n } catch {\n hasThrown = true;\n }\n const noDiffMessage = getCommonMessage(_constants.NO_DIFF_MESSAGE, options);\n // If the comparison yields no results, compare again but this time\n // without calling `toJSON`. It's also possible that toJSON might throw.\n if (difference === undefined \|\| difference === noDiffMessage) {\n const formatOptions = getFormatOptions(FALLBACK_FORMAT_OPTIONS, options);\n difference = getObjectsDifference(a, b, formatOptions, options);\n if (difference !== noDiffMessage && !hasThrown) {\n difference = `${getCommonMessage(\n _constants.SIMILAR_MESSAGE,\n options\n )}\\n\\n${difference}`;\n }\n }\n return difference;\n}\nfunction getFormatOptions(formatOptions, options) {\n const {compareKeys} = (0, _normalizeDiffOptions.normalizeDiffOptions)(\n options\n );\n return {\n ...formatOptions,\n compareKeys\n };\n}\nfunction getObjectsDifference(a, b, formatOptions, options) {\n const formatOptionsZeroIndent = {\n ...formatOptions,\n indent: 0\n };\n const aCompare = (0, _prettyFormat.format)(a, formatOptionsZeroIndent);\n const bCompare = (0, _prettyFormat.format)(b, formatOptionsZeroIndent);\n if (aCompare === bCompare) {\n return getCommonMessage(_constants.NO_DIFF_MESSAGE, options);\n } else {\n const aDisplay = (0, _prettyFormat.format)(a, formatOptions);\n const bDisplay = (0, _prettyFormat.format)(b, formatOptions);\n return (0, _diffLines.diffLinesUnified2)(\n aDisplay.split('\\n'),\n bDisplay.split('\\n'),\n aCompare.split('\\n'),\n bCompare.split('\\n'),\n options\n );\n }\n}\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.optsArg = void 0;\nconst fs_1 = require(\"fs\");\nconst optsArg = (opts) => {\n if (!opts) {\n opts = { mode: 0o777 };\n }\n else if (typeof opts === 'object') {\n opts = { mode: 0o777, ...opts };\n }\n else if (typeof opts === 'number') {\n opts = { mode: opts };\n }\n else if (typeof opts === 'string') {\n opts = { mode: parseInt(opts, 8) };\n }\n else {\n throw new TypeError('invalid options argument');\n }\n const resolved = opts;\n const optsFs = opts.fs \|\| {};\n opts.mkdir = opts.mkdir \|\| optsFs.mkdir \|\| fs_1.mkdir;\n opts.mkdirAsync = opts.mkdirAsync\n ? opts.mkdirAsync\n : async (path, options) => {\n return new Promise((res, rej) => resolved.mkdir(path, options, (er, made) => er ? rej(er) : res(made)));\n };\n opts.stat = opts.stat \|\| optsFs.stat \|\| fs_1.stat;\n opts.statAsync = opts.statAsync\n ? opts.statAsync\n : async (path) => new Promise((res, rej) => resolved.stat(path, (err, stats) => (err ? rej(err) : res(stats))));\n opts.statSync = opts.statSync \|\| optsFs.statSync \|\| fs_1.statSync;\n opts.mkdirSync = opts.mkdirSync \|\| optsFs.mkdirSync \|\| fs_1.mkdirSync;\n return resolved;\n};\nexports.optsArg = optsArg;\n//# sourceMappingURL=opts-arg.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.mkdirpManual = exports.mkdirpManualSync = void 0;\nconst path_1 = require(\"path\");\nconst opts_arg_js_1 = require(\"./opts-arg.js\");\nconst mkdirpManualSync = (path, options, made) => {\n const parent = (0, path_1.dirname)(path);\n const opts = { ...(0, opts_arg_js_1.optsArg)(options), recursive: false };\n if (parent === path) {\n try {\n return opts.mkdirSync(path, opts);\n }\n catch (er) {\n // swallowed by recursive implementation on posix systems\n // any other error is a failure\n const fer = er;\n if (fer && fer.code !== 'EISDIR') {\n throw er;\n }\n return;\n }\n }\n try {\n opts.mkdirSync(path, opts);\n return made \|\| path;\n }\n catch (er) {\n const fer = er;\n if (fer && fer.code === 'ENOENT') {\n return (0, exports.mkdirpManualSync)(path, opts, (0, exports.mkdirpManualSync)(parent, opts, made));\n }\n if (fer && fer.code !== 'EEXIST' && fer && fer.code !== 'EROFS') {\n throw er;\n }\n try {\n if (!opts.statSync(path).isDirectory())\n throw er;\n }\n catch (_) {\n throw er;\n }\n }\n};\nexports.mkdirpManualSync = mkdirpManualSync;\nexports.mkdirpManual = Object.assign(async (path, options, made) => {\n const opts = (0, opts_arg_js_1.optsArg)(options);\n opts.recursive = false;\n const parent = (0, path_1.dirname)(path);\n if (parent === path) {\n return opts.mkdirAsync(path, opts).catch(er => {\n // swallowed by recursive implementation on posix systems\n // any other error is a failure\n const fer = er;\n if (fer && fer.code !== 'EISDIR') {\n throw er;\n }\n });\n }\n return opts.mkdirAsync(path, opts).then(() => made \|\| path, async (er) => {\n const fer = er;\n if (fer && fer.code === 'ENOENT') {\n return (0, exports.mkdirpManual)(parent, opts).then((made) => (0, exports.mkdirpManual)(path, opts, made));\n }\n if (fer && fer.code !== 'EEXIST' && fer.code !== 'EROFS') {\n throw er;\n }\n return opts.statAsync(path).then(st => {\n if (st.isDirectory()) {\n return made;\n }\n else {\n throw er;\n }\n }, () => {\n throw er;\n });\n });\n}, { sync: exports.mkdirpManualSync });\n//# sourceMappingURL=mkdirp-manual.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.findMadeSync = exports.findMade = void 0;\nconst path_1 = require(\"path\");\nconst findMade = async (opts, parent, path) => {\n // we never want the 'made' return value to be a root directory\n if (path === parent) {\n return;\n }\n return opts.statAsync(parent).then(st => (st.isDirectory() ? path : undefined), // will fail later\n // will fail later\n er => {\n const fer = er;\n return fer && fer.code === 'ENOENT'\n ? (0, exports.findMade)(opts, (0, path_1.dirname)(parent), parent)\n : undefined;\n });\n};\nexports.findMade = findMade;\nconst findMadeSync = (opts, parent, path) => {\n if (path === parent) {\n return undefined;\n }\n try {\n return opts.statSync(parent).isDirectory() ? path : undefined;\n }\n catch (er) {\n const fer = er;\n return fer && fer.code === 'ENOENT'\n ? (0, exports.findMadeSync)(opts, (0, path_1.dirname)(parent), parent)\n : undefined;\n }\n};\nexports.findMadeSync = findMadeSync;\n//# sourceMappingURL=find-made.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.mkdirpNative = exports.mkdirpNativeSync = void 0;\nconst path_1 = require(\"path\");\nconst find_made_js_1 = require(\"./find-made.js\");\nconst mkdirp_manual_js_1 = require(\"./mkdirp-manual.js\");\nconst opts_arg_js_1 = require(\"./opts-arg.js\");\nconst mkdirpNativeSync = (path, options) => {\n const opts = (0, opts_arg_js_1.optsArg)(options);\n opts.recursive = true;\n const parent = (0, path_1.dirname)(path);\n if (parent === path) {\n return opts.mkdirSync(path, opts);\n }\n const made = (0, find_made_js_1.findMadeSync)(opts, path);\n try {\n opts.mkdirSync(path, opts);\n return made;\n }\n catch (er) {\n const fer = er;\n if (fer && fer.code === 'ENOENT') {\n return (0, mkdirp_manual_js_1.mkdirpManualSync)(path, opts);\n }\n else {\n throw er;\n }\n }\n};\nexports.mkdirpNativeSync = mkdirpNativeSync;\nexports.mkdirpNative = Object.assign(async (path, options) => {\n const opts = { ...(0, opts_arg_js_1.optsArg)(options), recursive: true };\n const parent = (0, path_1.dirname)(path);\n if (parent === path) {\n return await opts.mkdirAsync(path, opts);\n }\n return (0, find_made_js_1.findMade)(opts, path).then((made) => opts\n .mkdirAsync(path, opts)\n .then(m => made \|\| m)\n .catch(er => {\n const fer = er;\n if (fer && fer.code === 'ENOENT') {\n return (0, mkdirp_manual_js_1.mkdirpManual)(path, opts);\n }\n else {\n throw er;\n }\n }));\n}, { sync: exports.mkdirpNativeSync });\n//# sourceMappingURL=mkdirp-native.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.pathArg = void 0;\nconst platform = process.env.__TESTING_MKDIRP_PLATFORM__ \|\| process.platform;\nconst path_1 = require(\"path\");\nconst pathArg = (path) => {\n if (/\\0/.test(path)) {\n // simulate same failure that node raises\n throw Object.assign(new TypeError('path must be a string without null bytes'), {\n path,\n code: 'ERR_INVALID_ARG_VALUE',\n });\n }\n path = (0, path_1.resolve)(path);\n if (platform === 'win32') {\n const badWinChars = /[\|\"<>?:]/;\n const { root } = (0, path_1.parse)(path);\n if (badWinChars.test(path.substring(root.length))) {\n throw Object.assign(new Error('Illegal characters in path.'), {\n path,\n code: 'EINVAL',\n });\n }\n }\n return path;\n};\nexports.pathArg = pathArg;\n//# sourceMappingURL=path-arg.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.useNative = exports.useNativeSync = void 0;\nconst fs_1 = require(\"fs\");\nconst opts_arg_js_1 = require(\"./opts-arg.js\");\nconst version = process.env.__TESTING_MKDIRP_NODE_VERSION__ \|\| process.version;\nconst versArr = version.replace(/^v/, '').split('.');\nconst hasNative = +versArr[0] > 10 \|\| (+versArr[0] === 10 && +versArr[1] >= 12);\nexports.useNativeSync = !hasNative\n ? () => false\n : (opts) => (0, opts_arg_js_1.optsArg)(opts).mkdirSync === fs_1.mkdirSync;\nexports.useNative = Object.assign(!hasNative\n ? () => false\n : (opts) => (0, opts_arg_js_1.optsArg)(opts).mkdir === fs_1.mkdir, {\n sync: exports.useNativeSync,\n});\n//# sourceMappingURL=use-native.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.mkdirp = exports.nativeSync = exports.native = exports.manualSync = exports.manual = exports.sync = exports.mkdirpSync = exports.useNativeSync = exports.useNative = exports.mkdirpNativeSync = exports.mkdirpNative = exports.mkdirpManualSync = exports.mkdirpManual = void 0;\nconst mkdirp_manual_js_1 = require(\"./mkdirp-manual.js\");\nconst mkdirp_native_js_1 = require(\"./mkdirp-native.js\");\nconst opts_arg_js_1 = require(\"./opts-arg.js\");\nconst path_arg_js_1 = require(\"./path-arg.js\");\nconst use_native_js_1 = require(\"./use-native.js\");\n/* c8 ignore start /\nvar mkdirp_manual_js_2 = require(\"./mkdirp-manual.js\");\nObject.defineProperty(exports, \"mkdirpManual\", { enumerable: true, get: function () { return mkdirp_manual_js_2.mkdirpManual; } });\nObject.defineProperty(exports, \"mkdirpManualSync\", { enumerable: true, get: function () { return mkdirp_manual_js_2.mkdirpManualSync; } });\nvar mkdirp_native_js_2 = require(\"./mkdirp-native.js\");\nObject.defineProperty(exports, \"mkdirpNative\", { enumerable: true, get: function () { return mkdirp_native_js_2.mkdirpNative; } });\nObject.defineProperty(exports, \"mkdirpNativeSync\", { enumerable: true, get: function () { return mkdirp_native_js_2.mkdirpNativeSync; } });\nvar use_native_js_2 = require(\"./use-native.js\");\nObject.defineProperty(exports, \"useNative\", { enumerable: true, get: function () { return use_native_js_2.useNative; } });\nObject.defineProperty(exports, \"useNativeSync\", { enumerable: true, get: function () { return use_native_js_2.useNativeSync; } });\n/ c8 ignore stop /\nconst mkdirpSync = (path, opts) => {\n path = (0, path_arg_js_1.pathArg)(path);\n const resolved = (0, opts_arg_js_1.optsArg)(opts);\n return (0, use_native_js_1.useNativeSync)(resolved)\n ? (0, mkdirp_native_js_1.mkdirpNativeSync)(path, resolved)\n : (0, mkdirp_manual_js_1.mkdirpManualSync)(path, resolved);\n};\nexports.mkdirpSync = mkdirpSync;\nexports.sync = exports.mkdirpSync;\nexports.manual = mkdirp_manual_js_1.mkdirpManual;\nexports.manualSync = mkdirp_manual_js_1.mkdirpManualSync;\nexports.native = mkdirp_native_js_1.mkdirpNative;\nexports.nativeSync = mkdirp_native_js_1.mkdirpNativeSync;\nexports.mkdirp = Object.assign(async (path, opts) => {\n path = (0, path_arg_js_1.pathArg)(path);\n const resolved = (0, opts_arg_js_1.optsArg)(opts);\n return (0, use_native_js_1.useNative)(resolved)\n ? (0, mkdirp_native_js_1.mkdirpNative)(path, resolved)\n : (0, mkdirp_manual_js_1.mkdirpManual)(path, resolved);\n}, {\n mkdirpSync: exports.mkdirpSync,\n mkdirpNative: mkdirp_native_js_1.mkdirpNative,\n mkdirpNativeSync: mkdirp_native_js_1.mkdirpNativeSync,\n mkdirpManual: mkdirp_manual_js_1.mkdirpManual,\n mkdirpManualSync: mkdirp_manual_js_1.mkdirpManualSync,\n sync: exports.mkdirpSync,\n native: mkdirp_native_js_1.mkdirpNative,\n nativeSync: mkdirp_native_js_1.mkdirpNativeSync,\n manual: mkdirp_manual_js_1.mkdirpManual,\n manualSync: mkdirp_manual_js_1.mkdirpManualSync,\n useNative: use_native_js_1.useNative,\n useNativeSync: use_native_js_1.useNativeSync,\n});\n//# sourceMappingURL=index.js.map","'use strict';\n\nvar matchOperatorsRe = /[\|\\\\{}()[\\]^$+?.]/g;\n\nmodule.exports = function (str) {\n\tif (typeof str !== 'string') {\n\t\tthrow new TypeError('Expected a string');\n\t}\n\n\treturn str.replace(matchOperatorsRe, '\\\\$&');\n};\n","'use strict';\nvar escapeStringRegexp = require('escape-string-regexp');\n\nmodule.exports = function (str, target) {\n\tif (typeof str !== 'string' \|\| typeof target !== 'string') {\n\t\tthrow new TypeError('Expected a string');\n\t}\n\n\treturn str.replace(new RegExp('(?:' + escapeStringRegexp(target) + '){2,}', 'g'), target);\n};\n","'use strict';\n/* eslint-disable no-control-regex /\n// TODO: remove parens when Node.js 6 is targeted. Node.js 4 barfs at it.\nmodule.exports = () => (/[<>:\"\\/\\\\\|?\\x00-\\x1F]/g);\nmodule.exports.windowsNames = () => (/^(con\|prn\|aux\|nul\|com[0-9]\|lpt[0-9])$/i);\n","'use strict';\nvar escapeStringRegexp = require('escape-string-regexp');\n\nmodule.exports = function (str, sub) {\n\tif (typeof str !== 'string' \|\| typeof sub !== 'string') {\n\t\tthrow new TypeError();\n\t}\n\n\tsub = escapeStringRegexp(sub);\n\treturn str.replace(new RegExp('^' + sub + '\|' + sub + '$', 'g'), '');\n};\n","'use strict';\nconst trimRepeated = require('trim-repeated');\nconst filenameReservedRegex = require('filename-reserved-regex');\nconst stripOuter = require('strip-outer');\n\n// Doesn't make sense to have longer filenames\nconst MAX_FILENAME_LENGTH = 100;\n\nconst reControlChars = /[\\u0000-\\u001f\\u0080-\\u009f]/g; // eslint-disable-line no-control-regex\nconst reRelativePath = /^\\.+/;\nconst reTrailingPeriods = /\\.+$/;\n\nconst filenamify = (string, options = {}) => {\n\tif (typeof string !== 'string') {\n\t\tthrow new TypeError('Expected a string');\n\t}\n\n\tconst replacement = options.replacement === undefined ? '!' : options.replacement;\n\n\tif (filenameReservedRegex().test(replacement) && reControlChars.test(replacement)) {\n\t\tthrow new Error('Replacement string cannot contain reserved filename characters');\n\t}\n\n\tstring = string.replace(filenameReservedRegex(), replacement);\n\tstring = string.replace(reControlChars, replacement);\n\tstring = string.replace(reRelativePath, replacement);\n\tstring = string.replace(reTrailingPeriods, '');\n\n\tif (replacement.length > 0) {\n\t\tstring = trimRepeated(string, replacement);\n\t\tstring = string.length > 1 ? stripOuter(string, replacement) : string;\n\t}\n\n\tstring = filenameReservedRegex.windowsNames().test(string) ? string + replacement : string;\n\tstring = string.slice(0, typeof options.maxLength === 'number' ? options.maxLength : MAX_FILENAME_LENGTH);\n\n\treturn string;\n};\n\nmodule.exports = filenamify;\n","'use strict';\nconst path = require('path');\nconst filenamify = require('./filenamify');\n\nconst filenamifyPath = (filePath, options) => {\n\tfilePath = path.resolve(filePath);\n\treturn path.join(path.dirname(filePath), filenamify(path.basename(filePath), options));\n};\n\nmodule.exports = filenamifyPath;\n","'use strict';\nconst filenamify = require('./filenamify');\nconst filenamifyPath = require('./filenamify-path');\n\nconst filenamifyCombined = filenamify;\nfilenamifyCombined.path = filenamifyPath;\n\nmodule.exports = filenamify;\n","/* istanbul ignore file /\n\nconst fs = require('fs');\nconst path = require('path');\nconst chalk = require('chalk');\nconst { diff } = require('jest-diff');\nconst mkdirp = require('mkdirp');\nconst filenamify = require('filenamify');\n\n/\n Check if 2 strings or buffer are equal\n * @param {string \| Buffer} a\n * @param {string \| Buffer} b\n /\nconst isEqual = (a, b) => {\n // @ts-ignore: TypeScript gives error if we pass string to buffer.equals\n return Buffer.isBuffer(a) ? a.equals(b) : a === b;\n};\n\n/\n Match given content against content of the specified file.\n \n @param {string \| Buffer} content Output content to match\n * @param {string} [filepath] Path to the file to match against\n * @param {{\n * diff?: import('jest-diff').DiffOptions,\n * diffMethod?: (a: string, b: string, options: import('jest-diff').DiffOptions) => string,\n * fileExtension?: string,\n * }} options\n * @this {{ testPath: string, currentTestName: string, assertionCalls: number, isNot: boolean, snapshotState: { added: number, updated: number, unmatched: number, _updateSnapshot: 'none' \| 'new' \| 'all' } }}\n /\nexports.toMatchFile = function toMatchFile(content, filepath, options = {}) {\n const { isNot, snapshotState } = this;\n\n const fileExtension = options.fileExtension \|\| '';\n\n const filename =\n filepath === undefined\n ? // If file name is not specified, generate one from the test title\n path.join(\n path.dirname(this.testPath),\n '__file_snapshots__',\n `${filenamify(\n this.currentTestName,\n {\n replacement: '-',\n },\n { maxLength: Infinity }\n ).replace(/\\s/g, '-')}-${this.assertionCalls}`\n ) + fileExtension\n : filepath;\n\n options = {\n // Options for jest-diff\n diff: Object.assign(\n {\n expand: false,\n contextLines: 5,\n aAnnotation: 'Snapshot',\n },\n options.diff\n ),\n };\n\n if (snapshotState._updateSnapshot === 'none' && !fs.existsSync(filename)) {\n // We're probably running in CI environment\n\n snapshotState.unmatched++;\n\n return {\n pass: isNot,\n message: () =>\n `New output file ${chalk.blue(\n path.basename(filename)\n )} was ${chalk.bold.red('not written')}.\\n\\n` +\n 'The update flag must be explicitly passed to write a new snapshot.\\n\\n' +\n `This is likely because this test is run in a ${chalk.blue(\n 'continuous integration (CI) environment'\n )} in which snapshots are not written by default.\\n\\n`,\n };\n }\n\n if (fs.existsSync(filename)) {\n const output = fs.readFileSync(\n filename,\n Buffer.isBuffer(content) ? null : 'utf8'\n );\n\n if (isNot) {\n // The matcher is being used with `.not`\n\n if (!isEqual(content, output)) {\n // The value of `pass` is reversed when used with `.not`\n return { pass: false, message: () => '' };\n } else {\n snapshotState.unmatched++;\n\n return {\n pass: true,\n message: () =>\n `Expected received content ${chalk.red(\n 'to not match'\n )} the file ${chalk.blue(path.basename(filename))}.`,\n };\n }\n } else {\n if (isEqual(content, output)) {\n return { pass: true, message: () => '' };\n } else {\n if (snapshotState._updateSnapshot === 'all') {\n mkdirp.sync(path.dirname(filename));\n fs.writeFileSync(filename, content);\n\n snapshotState.updated++;\n\n return { pass: true, message: () => '' };\n } else {\n snapshotState.unmatched++;\n\n const diffMethod = options.diffMethod \|\| diff;\n const difference =\n Buffer.isBuffer(content) \|\| Buffer.isBuffer(output)\n ? ''\n : `\\n\\n${diffMethod(output, content, options.diff)}`;\n\n return {\n pass: false,\n message: () =>\n `Received content ${chalk.red(\n \"doesn't match\"\n )} the file ${chalk.blue(path.basename(filename))}.${difference}`,\n };\n }\n }\n }\n } else {\n if (\n !isNot &&\n (snapshotState._updateSnapshot === 'new' \|\|\n snapshotState._updateSnapshot === 'all')\n ) {\n mkdirp.sync(path.dirname(filename));\n fs.writeFileSync(filename, content);\n\n snapshotState.added++;\n\n return { pass: true, message: () => '' };\n } else {\n snapshotState.unmatched++;\n\n return {\n pass: true,\n message: () =>\n `The output file ${chalk.blue(\n path.basename(filename)\n )} ${chalk.bold.red(\"doesn't exist\")}.`,\n };\n }\n }\n};\n","import { existsSync, readdirSync, readFileSync } from 'node:fs';\nimport { dirname, join } from 'node:path';\nimport { getCallSites } from 'node:util';\n\nimport { toMatchFile } from 'jest-file-snapshot';\nimport { applyTransform } from 'jscodeshift/src/testUtils';\n\nexpect.extend({ toMatchFile });\n\ntype Transformer = Parameters<typeof applyTransform>[0];\ninterface CreateSuiteType {\n name?: string;\n transformer: Transformer;\n}\n\nexport class SnapshotOrchestrator {\n private readonly NAME: string;\n private readonly TRANSFORMER: Transformer;\n private readonly DIR_IN?: string;\n private readonly DIR_OUT: string;\n\n constructor({ name = '', transformer }: CreateSuiteType) {\n const path = this.getCalleePath();\n this.DIR_IN = this.setInputDirIfExists(path);\n this.DIR_OUT = join(path, '/snapshots/output');\n this.TRANSFORMER = transformer;\n this.NAME = name;\n }\n\n private setInputDirIfExists(path: string): string \| undefined {\n const inputDir = join(path, '/snapshots/source');\n\n if (existsSync(inputDir)) {\n return inputDir;\n }\n\n return undefined;\n }\n\n /\n Determines the path of the test file that called createSuite.\n * @private\n /\n private getCalleePath() {\n const path = getCallSites()?.find(({ scriptName }) =>\n scriptName.endsWith('.test.tsx'),\n )?.scriptName;\n\n if (!path) {\n throw new Error(\n 'Could not determine the test file path. Make sure to call createSuite from a .test.tsx file.',\n );\n }\n\n return dirname(path);\n }\n\n /\n Generates a human-readable test title from the given filename.\n /\n private getTestTitleFromFilename(fileName: string) {\n return fileName\n .replace('.tsx', '')\n .replace(/([A-Z])/gu, ' $1')\n .replace(/-/gu, ': ')\n .toLowerCase()\n .trim();\n }\n\n private readInput(fileName: string) {\n return this.DIR_IN ? readFileSync(join(this.DIR_IN, fileName), 'utf-8') : undefined;\n }\n\n /\n runs the codemod against provided file and creates Jest snapshot test\n */\n private createSnapshotTest(fileName: string) {\n const source = this.readInput(fileName);\n if (!source) return;\n\n const testTitle = this.getTestTitleFromFilename(fileName);\n const output = applyTransform(this.TRANSFORMER, { parser: 'tsx' }, { source });\n\n it(testTitle, async () => {\n expect(output).toMatchFile(join(this.DIR_OUT, fileName));\n });\n }\n\n createSuite(): void {\n if (!this.DIR_IN) return;\n\n const sources = readdirSync(this.DIR_IN).filter((file) => file.endsWith('.tsx'));\n\n describe(`Snapshots${this.NAME ? `: ${this.NAME}` : ''}`, () => {\n sources.forEach((fileName) => this.createSnapshotTest(fileName));\n });\n }\n}\n\nexport const createSnapshotSuite = (options: CreateSuiteType): void => {\n const orchestrator = new SnapshotOrchestrator(options);\n orchestrator.createSuite();\n};\n","#!/usr/bin/env node\n\nimport fs from 'node:fs/promises';\n\nimport { execSync } from 'child_process';\nimport path from 'path';\nimport { fileURLToPath } from 'url';\n\nimport { getOptions, handleError, loadTransformModules } from './utils';\n\nconst currentFilePath = fileURLToPath(import.meta.url);\nconst currentDirPath = path.dirname(currentFilePath);\n\nasync function runCodemod(transformsDir?: string) {\n try {\n const resolvedTransformsDir =\n transformsDir ?? path.resolve(currentDirPath, '../dist/transforms');\n console.debug(`Resolved transforms directory: ${resolvedTransformsDir}`);\n\n const { transformFiles } = await loadTransformModules(resolvedTransformsDir);\n\n if (transformFiles.length === 0) {\n throw new Error(`No transform scripts found in directory: ${resolvedTransformsDir}`);\n }\n\n const resolvedTransformFiles = await Promise.all(transformFiles);\n const options = await getOptions(resolvedTransformFiles);\n\n const codemodPath = path.resolve(resolvedTransformsDir, `${options.transformFile}.js`);\n console.debug(`Resolved codemod path: ${codemodPath}`);\n\n const args = [\n '-t',\n codemodPath,\n options.targetPath,\n options.dry ? '--dry' : '',\n options.print ? '--print' : '',\n options.ignorePattern\n ? options.ignorePattern\n .split(',')\n .map((pattern) => `--ignore-pattern=${pattern.trim()}`)\n .join(' ')\n : '',\n options.gitignore ? '--gitignore' : '',\n ].filter(Boolean);\n\n const command = `npx jscodeshift ${args.join(' ')}`;\n\n console.debug(`Running: ${command}`);\n\n const reportPath = path.resolve(process.cwd(), 'codemod-report.txt');\n\n try {\n await fs.access(reportPath);\n await fs.rm(reportPath);\n console.debug(`Removed existing report file: ${reportPath}`);\n } catch {\n console.debug(`No existing report file to remove: ${reportPath}`);\n }\n\n execSync(command, { stdio: 'inherit' });\n\n try {\n const reportContent = await fs.readFile(reportPath, 'utf8');\n const lines = reportContent.split('\\n').filter(Boolean);\n if (lines.length) {\n console.log(\n `\\n⚠️ ${lines.length} manual review${lines.length > 1 ? 's are' : ' is'} required. See ${reportPath} for details.`,\n );\n } else {\n console.debug(`Report file exists but is empty: ${reportPath}`);\n }\n } catch {\n console.debug(`No report file generated - no manual reviews needed`);\n }\n } catch (error: unknown) {\n if (error instanceof Error) {\n console.error('Error running codemod:', error.message);\n } else {\n console.error('Error running codemod:', error);\n }\n if (process.env.NODE_ENV !== 'test') {\n process.exit(1);\n }\n }\n}\n\nexport { runCodemod };\n","#!/usr/bin/env node\nimport { runCodemod } from './runCodemod';\n\nvoid runCodemod();\n"],"x_google_ignoreList":[2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51],"mappings":";;;;;;;;;;;AAEA,eAAe,WAAW,gBAA0B;CAClD,MAAM,OAAO,QAAQ,KAAK,MAAM;AAChC,KAAI,KAAK,SAAS,GAAG;EACnB,MAAM,CAACA,iBAAeC,aAAW,GAAG;EACpC,MAAMC,QAAM,KAAK,SAAS,YAAY,KAAK,SAAS;EACpD,MAAMC,UAAQ,KAAK,SAAS;EAC5B,MAAM,qBAAqB,KAAK,WAAW,QAAQ,QAAQ;EAC3D,IAAIC;AACJ,MAAI,uBAAuB,MAAM,KAAK,SAAS,qBAAqB,EAClE,mBAAgB,KAAK,qBAAqB;EAE5C,MAAMC,cAAY,KAAK,SAAS;EAChC,MAAM,cAAc,KAAK,SAAS;AAElC,MAAI,CAACL,mBAAiB,CAAC,eAAe,SAASA,iBAC7C,OAAM,IAAI,MAAM;AAElB,MAAI,CAACC,aACH,OAAM,IAAI,MAAM;EAIlB,MAAM,eAAe,CAAC,EAAEI,eAAc,CAACA,eAAa,CAAC;AAErD,SAAO;GAAE;GAAe;GAAY;GAAK;GAAO;GAAe,WAAW;GAAc;CACzF;CAED,MAAM,gBAAgB,qCAAW;EAC/B,SAAS;EACT,SAAS,eAAe,KAAK,UAAU;GAAE,MAAM;GAAM,OAAO;GAAM;EACnE;CAED,MAAM,aAAa,oCAAY;EAC7B,SAAS;EACT,WAAW,UAAU,MAAM,WAAW,MAAM;EAC7C;CAED,MAAM,MAAM,sCAAc;EACxB,SAAS;EACT,SAAS;EACV;CAED,MAAM,QAAQ,sCAAc;EAC1B,SAAS;EACT,SAAS;EACV;CAED,MAAM,gBAAgB,oCAAY;EAChC,SAAS;EACT,WAAW,UAAU;EACtB;CAED,MAAM,YAAY,sCAAc;EAC9B,SAAS;EACT,SAAS;EACV;AAED,QAAO;EAAE;EAAe;EAAY;EAAK;EAAO;EAAe;EAAW;AAC3E;;;;ACnDD,eAAe,qBAAqB,eAAuB;CACzD,IAAIC,mBAA4C,EAAE;CAElD,MAAM,QAAQ,MAAMC,iBAAG,QAAQ;CAC/B,MAAM,iBAAiB,MAAM,QAAQ,IACnC,MACG,QAAQ,SAAS,KAAK,SAAS,QAC/B,IAAI,OAAO,SAAS;EACnB,MAAM,gBAAgBC,kBAAK,KAAK,eAAe;EAC/C,MAAM,kBAAmB,MAAM,OAAO;AACtC,qBAAmB;GAAE,GAAG;IAAmB,OAAO,gBAAgB,QAAQ;GAAS;AACnF,SAAO,KAAK,QAAQ,OAAO;CAC5B;AAGL,QAAO;EAAE;EAAkB;EAAgB;AAC5C;;;;;ACvBD,QAAO,UAAU;EAChB,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,gBAAgB;GAAC;GAAK;GAAK;GAAI;EAC/B,QAAQ;GAAC;GAAG;GAAK;GAAI;EACrB,cAAc;GAAC;GAAK;GAAK;GAAI;EAC7B,SAAS;GAAC;GAAK;GAAK;GAAI;EACxB,SAAS;GAAC;GAAK;GAAK;GAAI;EACxB,UAAU;GAAC;GAAK;GAAK;GAAI;EACzB,SAAS;GAAC;GAAG;GAAG;GAAE;EAClB,kBAAkB;GAAC;GAAK;GAAK;GAAI;EACjC,QAAQ;GAAC;GAAG;GAAG;GAAI;EACnB,cAAc;GAAC;GAAK;GAAI;GAAI;EAC5B,SAAS;GAAC;GAAK;GAAI;GAAG;EACtB,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,aAAa;GAAC;GAAI;GAAK;GAAI;EAC3B,cAAc;GAAC;GAAK;GAAK;GAAE;EAC3B,aAAa;GAAC;GAAK;GAAK;GAAG;EAC3B,SAAS;GAAC;GAAK;GAAK;GAAG;EACvB,kBAAkB;GAAC;GAAK;GAAK;GAAI;EACjC,YAAY;GAAC;GAAK;GAAK;GAAI;EAC3B,WAAW;GAAC;GAAK;GAAI;GAAG;EACxB,QAAQ;GAAC;GAAG;GAAK;GAAI;EACrB,YAAY;GAAC;GAAG;GAAG;GAAI;EACvB,YAAY;GAAC;GAAG;GAAK;GAAI;EACzB,iBAAiB;GAAC;GAAK;GAAK;GAAG;EAC/B,YAAY;GAAC;GAAK;GAAK;GAAI;EAC3B,aAAa;GAAC;GAAG;GAAK;GAAE;EACxB,YAAY;GAAC;GAAK;GAAK;GAAI;EAC3B,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,eAAe;GAAC;GAAK;GAAG;GAAI;EAC5B,kBAAkB;GAAC;GAAI;GAAK;GAAG;EAC/B,cAAc;GAAC;GAAK;GAAK;GAAE;EAC3B,cAAc;GAAC;GAAK;GAAI;GAAI;EAC5B,WAAW;GAAC;GAAK;GAAG;GAAE;EACtB,cAAc;GAAC;GAAK;GAAK;GAAI;EAC7B,gBAAgB;GAAC;GAAK;GAAK;GAAI;EAC/B,iBAAiB;GAAC;GAAI;GAAI;GAAI;EAC9B,iBAAiB;GAAC;GAAI;GAAI;GAAG;EAC7B,iBAAiB;GAAC;GAAI;GAAI;GAAG;EAC7B,iBAAiB;GAAC;GAAG;GAAK;GAAI;EAC9B,cAAc;GAAC;GAAK;GAAG;GAAI;EAC3B,YAAY;GAAC;GAAK;GAAI;GAAI;EAC1B,eAAe;GAAC;GAAG;GAAK;GAAI;EAC5B,WAAW;GAAC;GAAK;GAAK;GAAI;EAC1B,WAAW;GAAC;GAAK;GAAK;GAAI;EAC1B,cAAc;GAAC;GAAI;GAAK;GAAI;EAC5B,aAAa;GAAC;GAAK;GAAI;GAAG;EAC1B,eAAe;GAAC;GAAK;GAAK;GAAI;EAC9B,eAAe;GAAC;GAAI;GAAK;GAAG;EAC5B,WAAW;GAAC;GAAK;GAAG;GAAI;EACxB,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,cAAc;GAAC;GAAK;GAAK;GAAI;EAC7B,QAAQ;GAAC;GAAK;GAAK;GAAE;EACrB,aAAa;GAAC;GAAK;GAAK;GAAG;EAC3B,QAAQ;GAAC;GAAK;GAAK;GAAI;EACvB,SAAS;GAAC;GAAG;GAAK;GAAE;EACpB,eAAe;GAAC;GAAK;GAAK;GAAG;EAC7B,QAAQ;GAAC;GAAK;GAAK;GAAI;EACvB,YAAY;GAAC;GAAK;GAAK;GAAI;EAC3B,WAAW;GAAC;GAAK;GAAK;GAAI;EAC1B,aAAa;GAAC;GAAK;GAAI;GAAG;EAC1B,UAAU;GAAC;GAAI;GAAG;GAAI;EACtB,SAAS;GAAC;GAAK;GAAK;GAAI;EACxB,SAAS;GAAC;GAAK;GAAK;GAAI;EACxB,YAAY;GAAC;GAAK;GAAK;GAAI;EAC3B,iBAAiB;GAAC;GAAK;GAAK;GAAI;EAChC,aAAa;GAAC;GAAK;GAAK;GAAE;EAC1B,gBAAgB;GAAC;GAAK;GAAK;GAAI;EAC/B,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,cAAc;GAAC;GAAK;GAAK;GAAI;EAC7B,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,wBAAwB;GAAC;GAAK;GAAK;GAAI;EACvC,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,cAAc;GAAC;GAAK;GAAK;GAAI;EAC7B,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,eAAe;GAAC;GAAK;GAAK;GAAI;EAC9B,iBAAiB;GAAC;GAAI;GAAK;GAAI;EAC/B,gBAAgB;GAAC;GAAK;GAAK;GAAI;EAC/B,kBAAkB;GAAC;GAAK;GAAK;GAAI;EACjC,kBAAkB;GAAC;GAAK;GAAK;GAAI;EACjC,kBAAkB;GAAC;GAAK;GAAK;GAAI;EACjC,eAAe;GAAC;GAAK;GAAK;GAAI;EAC9B,QAAQ;GAAC;GAAG;GAAK;GAAE;EACnB,aAAa;GAAC;GAAI;GAAK;GAAG;EAC1B,SAAS;GAAC;GAAK;GAAK;GAAI;EACxB,WAAW;GAAC;GAAK;GAAG;GAAI;EACxB,UAAU;GAAC;GAAK;GAAG;GAAE;EACrB,oBAAoB;GAAC;GAAK;GAAK;GAAI;EACnC,cAAc;GAAC;GAAG;GAAG;GAAI;EACzB,gBAAgB;GAAC;GAAK;GAAI;GAAI;EAC9B,gBAAgB;GAAC;GAAK;GAAK;GAAI;EAC/B,kBAAkB;GAAC;GAAI;GAAK;GAAI;EAChC,mBAAmB;GAAC;GAAK;GAAK;GAAI;EAClC,qBAAqB;GAAC;GAAG;GAAK;GAAI;EAClC,mBAAmB;GAAC;GAAI;GAAK;GAAI;EACjC,mBAAmB;GAAC;GAAK;GAAI;GAAI;EACjC,gBAAgB;GAAC;GAAI;GAAI;GAAI;EAC7B,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,YAAY;GAAC;GAAK;GAAK;GAAI;EAC3B,eAAe;GAAC;GAAK;GAAK;GAAI;EAC9B,QAAQ;GAAC;GAAG;GAAG;GAAI;EACnB,WAAW;GAAC;GAAK;GAAK;GAAI;EAC1B,SAAS;GAAC;GAAK;GAAK;GAAE;EACtB,aAAa;GAAC;GAAK;GAAK;GAAG;EAC3B,UAAU;GAAC;GAAK;GAAK;GAAE;EACvB,aAAa;GAAC;GAAK;GAAI;GAAE;EACzB,UAAU;GAAC;GAAK;GAAK;GAAI;EACzB,iBAAiB;GAAC;GAAK;GAAK;GAAI;EAChC,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,iBAAiB;GAAC;GAAK;GAAK;GAAI;EAChC,iBAAiB;GAAC;GAAK;GAAK;GAAI;EAChC,cAAc;GAAC;GAAK;GAAK;GAAI;EAC7B,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,QAAQ;GAAC;GAAK;GAAK;GAAG;EACtB,QAAQ;GAAC;GAAK;GAAK;GAAI;EACvB,QAAQ;GAAC;GAAK;GAAK;GAAI;EACvB,cAAc;GAAC;GAAK;GAAK;GAAI;EAC7B,UAAU;GAAC;GAAK;GAAG;GAAI;EACvB,iBAAiB;GAAC;GAAK;GAAI;GAAI;EAC/B,OAAO;GAAC;GAAK;GAAG;GAAE;EAClB,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,aAAa;GAAC;GAAI;GAAK;GAAI;EAC3B,eAAe;GAAC;GAAK;GAAI;GAAG;EAC5B,UAAU;GAAC;GAAK;GAAK;GAAI;EACzB,cAAc;GAAC;GAAK;GAAK;GAAG;EAC5B,YAAY;GAAC;GAAI;GAAK;GAAG;EACzB,YAAY;GAAC;GAAK;GAAK;GAAI;EAC3B,UAAU;GAAC;GAAK;GAAI;GAAG;EACvB,UAAU;GAAC;GAAK;GAAK;GAAI;EACzB,WAAW;GAAC;GAAK;GAAK;GAAI;EAC1B,aAAa;GAAC;GAAK;GAAI;GAAI;EAC3B,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,aAAa;GAAC;GAAK;GAAK;GAAI;EAC5B,QAAQ;GAAC;GAAK;GAAK;GAAI;EACvB,eAAe;GAAC;GAAG;GAAK;GAAI;EAC5B,aAAa;GAAC;GAAI;GAAK;GAAI;EAC3B,OAAO;GAAC;GAAK;GAAK;GAAI;EACtB,QAAQ;GAAC;GAAG;GAAK;GAAI;EACrB,WAAW;GAAC;GAAK;GAAK;GAAI;EAC1B,UAAU;GAAC;GAAK;GAAI;GAAG;EACvB,aAAa;GAAC;GAAI;GAAK;GAAI;EAC3B,UAAU;GAAC;GAAK;GAAK;GAAI;EACzB,SAAS;GAAC;GAAK;GAAK;GAAI;EACxB,SAAS;GAAC;GAAK;GAAK;GAAI;EACxB,cAAc;GAAC;GAAK;GAAK;GAAI;EAC7B,UAAU;GAAC;GAAK;GAAK;GAAE;EACvB,eAAe;GAAC;GAAK;GAAK;GAAG;EAC7B;;;;;;CCrJD,MAAM;CAMN,MAAM,kBAAkB,EAAE;AAC1B,MAAK,MAAM,OAAO,OAAO,KAAK,aAC7B,iBAAgB,YAAY,QAAQ;CAGrC,MAAMC,YAAU;EACf,KAAK;GAAC,UAAU;GAAG,QAAQ;GAAM;EACjC,KAAK;GAAC,UAAU;GAAG,QAAQ;GAAM;EACjC,KAAK;GAAC,UAAU;GAAG,QAAQ;GAAM;EACjC,KAAK;GAAC,UAAU;GAAG,QAAQ;GAAM;EACjC,MAAM;GAAC,UAAU;GAAG,QAAQ;GAAO;EACnC,KAAK;GAAC,UAAU;GAAG,QAAQ;GAAM;EACjC,KAAK;GAAC,UAAU;GAAG,QAAQ;GAAM;EACjC,KAAK;GAAC,UAAU;GAAG,QAAQ;GAAM;EACjC,KAAK;GAAC,UAAU;GAAG,QAAQ,CAAC,MAAM;GAAC;EACnC,SAAS;GAAC,UAAU;GAAG,QAAQ,CAAC,UAAU;GAAC;EAC3C,QAAQ;GAAC,UAAU;GAAG,QAAQ,CAAC,SAAS;GAAC;EACzC,SAAS;GAAC,UAAU;GAAG,QAAQ,CAAC,UAAU;GAAC;EAC3C,KAAK;GAAC,UAAU;GAAG,QAAQ;IAAC;IAAK;IAAK;IAAI;GAAC;EAC3C,OAAO;GAAC,UAAU;GAAG,QAAQ;IAAC;IAAO;IAAO;IAAM;GAAC;EACnD,MAAM;GAAC,UAAU;GAAG,QAAQ,CAAC,OAAO;GAAC;EACrC;AAED,QAAO,UAAUA;AAGjB,MAAK,MAAM,SAAS,OAAO,KAAKA,YAAU;AACzC,MAAI,EAAE,cAAcA,UAAQ,QAC3B,OAAM,IAAI,MAAM,gCAAgC;AAGjD,MAAI,EAAE,YAAYA,UAAQ,QACzB,OAAM,IAAI,MAAM,sCAAsC;AAGvD,MAAIA,UAAQ,OAAO,OAAO,WAAWA,UAAQ,OAAO,SACnD,OAAM,IAAI,MAAM,wCAAwC;EAGzD,MAAM,EAAC,UAAU,QAAO,GAAGA,UAAQ;AACnC,SAAOA,UAAQ,OAAO;AACtB,SAAOA,UAAQ,OAAO;AACtB,SAAO,eAAeA,UAAQ,QAAQ,YAAY,EAAC,OAAO,UAAS;AACnE,SAAO,eAAeA,UAAQ,QAAQ,UAAU,EAAC,OAAO,QAAO;CAC/D;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAM,IAAI,IAAI,KAAK;EACnB,MAAMC,MAAI,IAAI,KAAK;EACnB,MAAMC,MAAI,IAAI,KAAK;EACnB,MAAM,MAAM,KAAK,IAAI,GAAGD,KAAGC;EAC3B,MAAM,MAAM,KAAK,IAAI,GAAGD,KAAGC;EAC3B,MAAM,QAAQ,MAAM;EACpB,IAAIC;EACJ,IAAI;AAEJ,MAAI,QAAQ,IACX,OAAI;WACM,MAAM,IAChB,QAAKF,MAAIC,OAAK;WACJD,QAAM,IAChB,OAAI,KAAKC,MAAI,KAAK;WACRA,QAAM,IAChB,OAAI,KAAK,IAAID,OAAK;AAGnB,QAAI,KAAK,IAAIE,MAAI,IAAI;AAErB,MAAIA,MAAI,EACP,QAAK;EAGN,MAAMC,OAAK,MAAM,OAAO;AAExB,MAAI,QAAQ,IACX,KAAI;WACMA,OAAK,GACf,KAAI,SAAS,MAAM;MAEnB,KAAI,SAAS,IAAI,MAAM;AAGxB,SAAO;GAACD;GAAG,IAAI;GAAKC,MAAI;GAAI;CAC5B;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAID;EACJ,IAAI;EAEJ,MAAM,IAAI,IAAI,KAAK;EACnB,MAAMF,MAAI,IAAI,KAAK;EACnB,MAAMC,MAAI,IAAI,KAAK;EACnB,MAAMG,MAAI,KAAK,IAAI,GAAGJ,KAAGC;EACzB,MAAMI,SAAOD,MAAI,KAAK,IAAI,GAAGJ,KAAGC;EAChC,MAAM,QAAQ,SAAU,KAAG;AAC1B,WAAQG,MAAIE,OAAK,IAAID,SAAO,IAAI;EAChC;AAED,MAAIA,WAAS,GAAG;AACf,SAAI;AACJ,OAAI;EACJ,OAAM;AACN,OAAIA,SAAOD;AACX,UAAO,MAAM;AACb,UAAO,MAAMJ;AACb,UAAO,MAAMC;AAEb,OAAI,MAAMG,IACT,OAAI,OAAO;YACDJ,QAAMI,IAChB,OAAK,IAAI,IAAK,OAAO;YACXH,QAAMG,IAChB,OAAK,IAAI,IAAK,OAAO;AAGtB,OAAIF,MAAI,EACP,QAAK;YACKA,MAAI,EACd,QAAK;EAEN;AAED,SAAO;GACNA,MAAI;GACJ,IAAI;GACJE,MAAI;GACJ;CACD;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAM,IAAI,IAAI;EACd,MAAMJ,MAAI,IAAI;EACd,IAAIC,MAAI,IAAI;EACZ,MAAMC,MAAIH,UAAQ,IAAI,IAAI,KAAK;EAC/B,MAAM,IAAI,IAAI,MAAM,KAAK,IAAI,GAAG,KAAK,IAAIC,KAAGC;AAE5C,QAAI,IAAI,IAAI,MAAM,KAAK,IAAI,GAAG,KAAK,IAAID,KAAGC;AAE1C,SAAO;GAACC;GAAG,IAAI;GAAKD,MAAI;GAAI;CAC5B;AAED,WAAQ,IAAI,OAAO,SAAU,KAAK;EACjC,MAAM,IAAI,IAAI,KAAK;EACnB,MAAMD,MAAI,IAAI,KAAK;EACnB,MAAMC,MAAI,IAAI,KAAK;EAEnB,MAAMM,MAAI,KAAK,IAAI,IAAI,GAAG,IAAIP,KAAG,IAAIC;EACrC,MAAMK,OAAK,IAAI,IAAIC,QAAM,IAAIA,QAAM;EACnC,MAAMC,OAAK,IAAIR,MAAIO,QAAM,IAAIA,QAAM;EACnC,MAAM,KAAK,IAAIN,MAAIM,QAAM,IAAIA,QAAM;AAEnC,SAAO;GAACD,MAAI;GAAKE,MAAI;GAAK,IAAI;GAAKD,MAAI;GAAI;CAC3C;CAED,SAAS,oBAAoB,GAAG,GAAG;AAIlC,UACG,EAAE,KAAK,EAAE,OAAO,KAChB,EAAE,KAAK,EAAE,OAAO,KAChB,EAAE,KAAK,EAAE,OAAO;CAEnB;AAED,WAAQ,IAAI,UAAU,SAAU,KAAK;EACpC,MAAM,WAAW,gBAAgB;AACjC,MAAI,SACH,QAAO;EAGR,IAAI,yBAAyB;EAC7B,IAAI;AAEJ,OAAK,MAAM,WAAW,OAAO,KAAK,cAAc;GAC/C,MAAM,QAAQ,YAAY;GAG1B,MAAM,WAAW,oBAAoB,KAAK;AAG1C,OAAI,WAAW,wBAAwB;AACtC,6BAAyB;AACzB,4BAAwB;GACxB;EACD;AAED,SAAO;CACP;AAED,WAAQ,QAAQ,MAAM,SAAU,SAAS;AACxC,SAAO,YAAY;CACnB;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,IAAI,IAAI,IAAI,KAAK;EACjB,IAAIP,MAAI,IAAI,KAAK;EACjB,IAAIC,MAAI,IAAI,KAAK;AAGjB,MAAI,IAAI,WAAa,IAAI,QAAS,UAAU,MAAQ,IAAI;AACxD,QAAID,MAAI,WAAaA,MAAI,QAAS,UAAU,MAAQA,MAAI;AACxD,QAAIC,MAAI,WAAaA,MAAI,QAAS,UAAU,MAAQA,MAAI;EAExD,MAAM,IAAK,IAAI,QAAWD,MAAI,QAAWC,MAAI;EAC7C,MAAM,IAAK,IAAI,QAAWD,MAAI,QAAWC,MAAI;EAC7C,MAAM,IAAK,IAAI,QAAWD,MAAI,QAAWC,MAAI;AAE7C,SAAO;GAAC,IAAI;GAAK,IAAI;GAAK,IAAI;GAAI;CAClC;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAM,MAAMF,UAAQ,IAAI,IAAI;EAC5B,IAAI,IAAI,IAAI;EACZ,IAAI,IAAI,IAAI;EACZ,IAAI,IAAI,IAAI;AAEZ,OAAK;AACL,OAAK;AACL,OAAK;AAEL,MAAI,IAAI,UAAY,MAAM,IAAI,KAAO,QAAQ,IAAM,KAAK;AACxD,MAAI,IAAI,UAAY,MAAM,IAAI,KAAO,QAAQ,IAAM,KAAK;AACxD,MAAI,IAAI,UAAY,MAAM,IAAI,KAAO,QAAQ,IAAM,KAAK;EAExD,MAAMI,MAAK,MAAM,IAAK;EACtB,MAAM,IAAI,OAAO,IAAI;EACrB,MAAMF,MAAI,OAAO,IAAI;AAErB,SAAO;GAACE;GAAG;GAAGF;GAAE;CAChB;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAMC,MAAI,IAAI,KAAK;EACnB,MAAM,IAAI,IAAI,KAAK;EACnB,MAAMC,MAAI,IAAI,KAAK;EACnB,IAAI;EACJ,IAAI;EACJ,IAAI;AAEJ,MAAI,MAAM,GAAG;AACZ,SAAMA,MAAI;AACV,UAAO;IAAC;IAAK;IAAK;IAAI;EACtB;AAED,MAAIA,MAAI,GACP,MAAKA,OAAK,IAAI;MAEd,MAAKA,MAAI,IAAIA,MAAI;EAGlB,MAAM,KAAK,IAAIA,MAAI;EAEnB,MAAM,MAAM;GAAC;GAAG;GAAG;GAAE;AACrB,OAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,QAAKD,MAAI,IAAI,IAAI,EAAE,IAAI;AACvB,OAAI,KAAK,EACR;AAGD,OAAI,KAAK,EACR;AAGD,OAAI,IAAI,KAAK,EACZ,OAAM,MAAM,KAAK,MAAM,IAAI;YACjB,IAAI,KAAK,EACnB,OAAM;YACI,IAAI,KAAK,EACnB,OAAM,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM;OAEtC,OAAM;AAGP,OAAI,KAAK,MAAM;EACf;AAED,SAAO;CACP;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAMA,MAAI,IAAI;EACd,IAAI,IAAI,IAAI,KAAK;EACjB,IAAIC,MAAI,IAAI,KAAK;EACjB,IAAI,OAAO;EACX,MAAM,OAAO,KAAK,IAAIA,KAAG;AAEzB,SAAK;AACL,OAAMA,OAAK,IAAKA,MAAI,IAAIA;AACxB,UAAQ,QAAQ,IAAI,OAAO,IAAI;EAC/B,MAAMC,OAAKD,MAAI,KAAK;EACpB,MAAM,KAAKA,QAAM,IAAK,IAAI,QAAS,OAAO,QAAS,IAAI,KAAMA,MAAI;AAEjE,SAAO;GAACD;GAAG,KAAK;GAAKE,MAAI;GAAI;CAC7B;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAMF,MAAI,IAAI,KAAK;EACnB,MAAM,IAAI,IAAI,KAAK;EACnB,IAAIE,MAAI,IAAI,KAAK;EACjB,MAAM,KAAK,KAAK,MAAMF,OAAK;EAE3B,MAAMO,MAAIP,MAAI,KAAK,MAAMA;EACzB,MAAMQ,MAAI,MAAMN,OAAK,IAAI;EACzB,MAAMO,MAAI,MAAMP,OAAK,IAAK,IAAIK;EAC9B,MAAMG,MAAI,MAAMR,OAAK,IAAK,KAAK,IAAIK;AACnC,SAAK;AAEL,UAAQ,IAAR;GACC,KAAK,EACJ,QAAO;IAACL;IAAGQ;IAAGF;IAAE;GACjB,KAAK,EACJ,QAAO;IAACC;IAAGP;IAAGM;IAAE;GACjB,KAAK,EACJ,QAAO;IAACA;IAAGN;IAAGQ;IAAE;GACjB,KAAK,EACJ,QAAO;IAACF;IAAGC;IAAGP;IAAE;GACjB,KAAK,EACJ,QAAO;IAACQ;IAAGF;IAAGN;IAAE;GACjB,KAAK,EACJ,QAAO;IAACA;IAAGM;IAAGC;IAAE;EACjB;CACD;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAMT,MAAI,IAAI;EACd,MAAM,IAAI,IAAI,KAAK;EACnB,MAAME,MAAI,IAAI,KAAK;EACnB,MAAM,OAAO,KAAK,IAAIA,KAAG;EACzB,IAAI;EACJ,IAAID;AAEJ,SAAK,IAAI,KAAKC;EACd,MAAM,QAAQ,IAAI,KAAK;AACvB,OAAK,IAAI;AACT,QAAO,QAAQ,IAAK,OAAO,IAAI;AAC/B,OAAK,MAAM;AACX,SAAK;AAEL,SAAO;GAACF;GAAG,KAAK;GAAKC,MAAI;GAAI;CAC7B;AAGD,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAMD,MAAI,IAAI,KAAK;EACnB,IAAI,KAAK,IAAI,KAAK;EAClB,IAAI,KAAK,IAAI,KAAK;EAClB,MAAM,QAAQ,KAAK;EACnB,IAAIO;AAGJ,MAAI,QAAQ,GAAG;AACd,SAAM;AACN,SAAM;EACN;EAED,MAAM,IAAI,KAAK,MAAM,IAAIP;EACzB,MAAME,MAAI,IAAI;AACd,QAAI,IAAIF,MAAI;AAEZ,OAAK,IAAI,OAAU,EAClB,OAAI,IAAIO;EAGT,MAAMI,MAAI,KAAKJ,OAAKL,MAAI;EAExB,IAAI;EACJ,IAAIJ;EACJ,IAAIC;AAEJ,UAAQ,GAAR;GACC;GACA,KAAK;GACL,KAAK;AAAG,QAAIG;AAAI,UAAIS;AAAI,UAAI;AAAI;GAChC,KAAK;AAAG,QAAIA;AAAI,UAAIT;AAAI,UAAI;AAAI;GAChC,KAAK;AAAG,QAAI;AAAI,UAAIA;AAAI,UAAIS;AAAG;GAC/B,KAAK;AAAG,QAAI;AAAI,UAAIA;AAAI,UAAIT;AAAG;GAC/B,KAAK;AAAG,QAAIS;AAAI,UAAI;AAAI,UAAIT;AAAG;GAC/B,KAAK;AAAG,QAAIA;AAAI,UAAI;AAAI,UAAIS;AAAG;EAC/B;AAGD,SAAO;GAAC,IAAI;GAAKb,MAAI;GAAKC,MAAI;GAAI;CAClC;AAED,WAAQ,KAAK,MAAM,SAAU,MAAM;EAClC,MAAMK,MAAI,KAAK,KAAK;EACpB,MAAME,MAAI,KAAK,KAAK;EACpB,MAAM,IAAI,KAAK,KAAK;EACpB,MAAMD,MAAI,KAAK,KAAK;EAEpB,MAAM,IAAI,IAAI,KAAK,IAAI,GAAGD,OAAK,IAAIC,OAAKA;EACxC,MAAMP,MAAI,IAAI,KAAK,IAAI,GAAGQ,OAAK,IAAID,OAAKA;EACxC,MAAMN,MAAI,IAAI,KAAK,IAAI,GAAG,KAAK,IAAIM,OAAKA;AAExC,SAAO;GAAC,IAAI;GAAKP,MAAI;GAAKC,MAAI;GAAI;CAClC;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAM,IAAI,IAAI,KAAK;EACnB,MAAM,IAAI,IAAI,KAAK;EACnB,MAAM,IAAI,IAAI,KAAK;EACnB,IAAI;EACJ,IAAID;EACJ,IAAIC;AAEJ,MAAK,IAAI,SAAW,IAAI,UAAY,IAAI;AACxC,QAAK,IAAI,SAAY,IAAI,SAAW,IAAI;AACxC,QAAK,IAAI,QAAW,IAAI,QAAY,IAAI;AAGxC,MAAI,IAAI,WACH,QAAS,MAAM,IAAM,OAAS,OAChC,IAAI;AAEP,QAAID,MAAI,WACH,QAASA,QAAM,IAAM,OAAS,OAChCA,MAAI;AAEP,QAAIC,MAAI,WACH,QAASA,QAAM,IAAM,OAAS,OAChCA,MAAI;AAEP,MAAI,KAAK,IAAI,KAAK,IAAI,GAAG,IAAI;AAC7B,QAAI,KAAK,IAAI,KAAK,IAAI,GAAGD,MAAI;AAC7B,QAAI,KAAK,IAAI,KAAK,IAAI,GAAGC,MAAI;AAE7B,SAAO;GAAC,IAAI;GAAKD,MAAI;GAAKC,MAAI;GAAI;CAClC;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,IAAI,IAAI,IAAI;EACZ,IAAI,IAAI,IAAI;EACZ,IAAI,IAAI,IAAI;AAEZ,OAAK;AACL,OAAK;AACL,OAAK;AAEL,MAAI,IAAI,UAAY,MAAM,IAAI,KAAO,QAAQ,IAAM,KAAK;AACxD,MAAI,IAAI,UAAY,MAAM,IAAI,KAAO,QAAQ,IAAM,KAAK;AACxD,MAAI,IAAI,UAAY,MAAM,IAAI,KAAO,QAAQ,IAAM,KAAK;EAExD,MAAME,MAAK,MAAM,IAAK;EACtB,MAAM,IAAI,OAAO,IAAI;EACrB,MAAMF,MAAI,OAAO,IAAI;AAErB,SAAO;GAACE;GAAG;GAAGF;GAAE;CAChB;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAME,MAAI,IAAI;EACd,MAAM,IAAI,IAAI;EACd,MAAMF,MAAI,IAAI;EACd,IAAI;EACJ,IAAI;EACJ,IAAI;AAEJ,OAAKE,MAAI,MAAM;AACf,MAAI,IAAI,MAAM;AACd,MAAI,IAAIF,MAAI;EAEZ,MAAM,KAAK,KAAK;EAChB,MAAM,KAAK,KAAK;EAChB,MAAM,KAAK,KAAK;AAChB,MAAI,KAAK,UAAW,MAAM,IAAI,KAAK,OAAO;AAC1C,MAAI,KAAK,UAAW,MAAM,IAAI,KAAK,OAAO;AAC1C,MAAI,KAAK,UAAW,MAAM,IAAI,KAAK,OAAO;AAE1C,OAAK;AACL,OAAK;AACL,OAAK;AAEL,SAAO;GAAC;GAAG;GAAG;GAAE;CAChB;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAME,MAAI,IAAI;EACd,MAAM,IAAI,IAAI;EACd,MAAMF,MAAI,IAAI;EACd,IAAIC;EAEJ,MAAM,KAAK,KAAK,MAAMD,KAAG;AACzB,QAAI,KAAK,MAAM,IAAI,KAAK;AAExB,MAAIC,MAAI,EACP,QAAK;EAGN,MAAMI,MAAI,KAAK,KAAK,IAAI,IAAIL,MAAIA;AAEhC,SAAO;GAACE;GAAGG;GAAGJ;GAAE;CAChB;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAMC,MAAI,IAAI;EACd,MAAMG,MAAI,IAAI;EACd,MAAMJ,MAAI,IAAI;EAEd,MAAM,KAAKA,MAAI,MAAM,IAAI,KAAK;EAC9B,MAAM,IAAII,MAAI,KAAK,IAAI;EACvB,MAAML,MAAIK,MAAI,KAAK,IAAI;AAEvB,SAAO;GAACH;GAAG;GAAGF;GAAE;CAChB;AAED,WAAQ,IAAI,SAAS,SAAU,MAAM,aAAa,MAAM;EACvD,MAAM,CAAC,GAAGD,KAAGC,IAAE,GAAG;EAClB,IAAI,QAAQ,eAAe,OAAOF,UAAQ,IAAI,IAAI,MAAM,KAAK;AAE7D,UAAQ,KAAK,MAAM,QAAQ;AAE3B,MAAI,UAAU,EACb,QAAO;EAGR,IAAI,OAAO,MACN,KAAK,MAAME,MAAI,QAAQ,IACxB,KAAK,MAAMD,MAAI,QAAQ,IACxB,KAAK,MAAM,IAAI;AAElB,MAAI,UAAU,EACb,SAAQ;AAGT,SAAO;CACP;AAED,WAAQ,IAAI,SAAS,SAAU,MAAM;AAGpC,SAAOD,UAAQ,IAAI,OAAOA,UAAQ,IAAI,IAAI,OAAO,KAAK;CACtD;AAED,WAAQ,IAAI,UAAU,SAAU,MAAM;EACrC,MAAM,IAAI,KAAK;EACf,MAAMC,MAAI,KAAK;EACf,MAAMC,MAAI,KAAK;AAIf,MAAI,MAAMD,OAAKA,QAAMC,KAAG;AACvB,OAAI,IAAI,EACP,QAAO;AAGR,OAAI,IAAI,IACP,QAAO;AAGR,UAAO,KAAK,OAAQ,IAAI,KAAK,MAAO,MAAM;EAC1C;EAED,MAAM,OAAO,KACT,KAAK,KAAK,MAAM,IAAI,MAAM,KAC1B,IAAI,KAAK,MAAMD,MAAI,MAAM,KAC1B,KAAK,MAAMC,MAAI,MAAM;AAExB,SAAO;CACP;AAED,WAAQ,OAAO,MAAM,SAAU,MAAM;EACpC,IAAI,QAAQ,OAAO;AAGnB,MAAI,UAAU,KAAK,UAAU,GAAG;AAC/B,OAAI,OAAO,GACV,UAAS;AAGV,WAAQ,QAAQ,OAAO;AAEvB,UAAO;IAAC;IAAO;IAAO;IAAM;EAC5B;EAED,MAAM,QAAQ,CAAC,EAAE,OAAO,MAAM,KAAK;EACnC,MAAM,KAAM,QAAQ,KAAK,OAAQ;EACjC,MAAMD,OAAO,SAAS,IAAK,KAAK,OAAQ;EACxC,MAAMC,OAAO,SAAS,IAAK,KAAK,OAAQ;AAExC,SAAO;GAAC;GAAGD;GAAGC;GAAE;CAChB;AAED,WAAQ,QAAQ,MAAM,SAAU,MAAM;AAErC,MAAI,QAAQ,KAAK;GAChB,MAAMK,OAAK,OAAO,OAAO,KAAK;AAC9B,UAAO;IAACA;IAAGA;IAAGA;IAAE;EAChB;AAED,UAAQ;EAER,IAAI;EACJ,MAAM,IAAI,KAAK,MAAM,OAAO,MAAM,IAAI;EACtC,MAAMN,MAAI,KAAK,OAAO,MAAM,OAAO,MAAM,KAAK,IAAI;EAClD,MAAMC,MAAK,MAAM,IAAK,IAAI;AAE1B,SAAO;GAAC;GAAGD;GAAGC;GAAE;CAChB;AAED,WAAQ,IAAI,MAAM,SAAU,MAAM;EACjC,MAAM,YAAY,KAAK,MAAM,KAAK,MAAM,QAAS,QAC5C,KAAK,MAAM,KAAK,MAAM,QAAS,MAChC,KAAK,MAAM,KAAK,MAAM;EAE1B,MAAM,SAAS,QAAQ,SAAS,IAAI;AACpC,SAAO,SAAS,UAAU,OAAO,UAAU;CAC3C;AAED,WAAQ,IAAI,MAAM,SAAU,MAAM;EACjC,MAAM,QAAQ,KAAK,SAAS,IAAI,MAAM;AACtC,MAAI,CAAC,MACJ,QAAO;GAAC;GAAG;GAAG;GAAE;EAGjB,IAAI,cAAc,MAAM;AAExB,MAAI,MAAM,GAAG,WAAW,EACvB,eAAc,YAAY,MAAM,IAAI,KAAI,SAAQ;AAC/C,UAAO,OAAO;EACd,GAAE,KAAK;EAGT,MAAM,UAAU,SAAS,aAAa;EACtC,MAAM,IAAK,WAAW,KAAM;EAC5B,MAAMD,MAAK,WAAW,IAAK;EAC3B,MAAMC,MAAI,UAAU;AAEpB,SAAO;GAAC;GAAGD;GAAGC;GAAE;CAChB;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAM,IAAI,IAAI,KAAK;EACnB,MAAMD,MAAI,IAAI,KAAK;EACnB,MAAMC,MAAI,IAAI,KAAK;EACnB,MAAM,MAAM,KAAK,IAAI,KAAK,IAAI,GAAGD,MAAIC;EACrC,MAAM,MAAM,KAAK,IAAI,KAAK,IAAI,GAAGD,MAAIC;EACrC,MAAM,SAAU,MAAM;EACtB,IAAI;EACJ,IAAI;AAEJ,MAAI,SAAS,EACZ,aAAY,OAAO,IAAI;MAEvB,aAAY;AAGb,MAAI,UAAU,EACb,OAAM;WAEH,QAAQ,EACX,QAAQD,MAAIC,OAAK,SAAU;WAExB,QAAQD,IACX,OAAM,KAAKC,MAAI,KAAK;MAEpB,OAAM,KAAK,IAAID,OAAK;AAGrB,SAAO;AACP,SAAO;AAEP,SAAO;GAAC,MAAM;GAAK,SAAS;GAAK,YAAY;GAAI;CACjD;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAM,IAAI,IAAI,KAAK;EACnB,MAAMG,MAAI,IAAI,KAAK;EAEnB,MAAMG,MAAIH,MAAI,KAAO,IAAM,IAAIA,MAAM,IAAM,KAAK,IAAMA;EAEtD,IAAIM,MAAI;AACR,MAAIH,MAAI,EACP,QAAKH,MAAI,KAAMG,QAAM,IAAMA;AAG5B,SAAO;GAAC,IAAI;GAAIA,MAAI;GAAKG,MAAI;GAAI;CACjC;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAM,IAAI,IAAI,KAAK;EACnB,MAAML,MAAI,IAAI,KAAK;EAEnB,MAAME,MAAI,IAAIF;EACd,IAAIK,MAAI;AAER,MAAIH,MAAI,EACP,QAAKF,MAAIE,QAAM,IAAIA;AAGpB,SAAO;GAAC,IAAI;GAAIA,MAAI;GAAKG,MAAI;GAAI;CACjC;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAMP,MAAI,IAAI,KAAK;EACnB,MAAMI,MAAI,IAAI,KAAK;EACnB,MAAMN,MAAI,IAAI,KAAK;AAEnB,MAAIM,QAAM,EACT,QAAO;GAACN,MAAI;GAAKA,MAAI;GAAKA,MAAI;GAAI;EAGnC,MAAM,OAAO;GAAC;GAAG;GAAG;GAAE;EACtB,MAAM,KAAME,MAAI,IAAK;EACrB,MAAME,MAAI,KAAK;EACf,MAAM,IAAI,IAAIA;EACd,IAAI,KAAK;AAGT,UAAQ,KAAK,MAAM,KAAnB;GACC,KAAK;AACJ,SAAK,KAAK;AAAG,SAAK,KAAKA;AAAG,SAAK,KAAK;AAAG;GACxC,KAAK;AACJ,SAAK,KAAK;AAAG,SAAK,KAAK;AAAG,SAAK,KAAK;AAAG;GACxC,KAAK;AACJ,SAAK,KAAK;AAAG,SAAK,KAAK;AAAG,SAAK,KAAKA;AAAG;GACxC,KAAK;AACJ,SAAK,KAAK;AAAG,SAAK,KAAK;AAAG,SAAK,KAAK;AAAG;GACxC,KAAK;AACJ,SAAK,KAAKA;AAAG,SAAK,KAAK;AAAG,SAAK,KAAK;AAAG;GACxC;AACC,SAAK,KAAK;AAAG,SAAK,KAAK;AAAG,SAAK,KAAK;EACrC;AAGD,QAAM,IAAME,OAAKN;AAEjB,SAAO;IACLM,MAAI,KAAK,KAAK,MAAM;IACpBA,MAAI,KAAK,KAAK,MAAM;IACpBA,MAAI,KAAK,KAAK,MAAM;GACrB;CACD;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAMA,MAAI,IAAI,KAAK;EACnB,MAAMN,MAAI,IAAI,KAAK;EAEnB,MAAMI,MAAIE,MAAIN,OAAK,IAAMM;EACzB,IAAIG,MAAI;AAER,MAAIL,MAAI,EACP,OAAIE,MAAIF;AAGT,SAAO;GAAC,IAAI;GAAIK,MAAI;GAAKL,MAAI;GAAI;CACjC;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAME,MAAI,IAAI,KAAK;EACnB,MAAMN,MAAI,IAAI,KAAK;EAEnB,MAAMG,MAAIH,OAAK,IAAMM,OAAK,KAAMA;EAChC,IAAI,IAAI;AAER,MAAIH,MAAI,KAAOA,MAAI,GAClB,KAAIG,OAAK,IAAIH;WAEVA,OAAK,MAAOA,MAAI,EACnB,KAAIG,OAAK,KAAK,IAAIH;AAGnB,SAAO;GAAC,IAAI;GAAI,IAAI;GAAKA,MAAI;GAAI;CACjC;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAMG,MAAI,IAAI,KAAK;EACnB,MAAMN,MAAI,IAAI,KAAK;EACnB,MAAMI,MAAIE,MAAIN,OAAK,IAAMM;AACzB,SAAO;GAAC,IAAI;IAAKF,MAAIE,OAAK;IAAM,IAAIF,OAAK;GAAI;CAC7C;AAED,WAAQ,IAAI,MAAM,SAAU,KAAK;EAChC,MAAM,IAAI,IAAI,KAAK;EACnB,MAAMH,MAAI,IAAI,KAAK;EACnB,MAAMG,MAAI,IAAIH;EACd,MAAMK,MAAIF,MAAI;EACd,IAAIJ,MAAI;AAER,MAAIM,MAAI,EACP,QAAKF,MAAIE,QAAM,IAAIA;AAGpB,SAAO;GAAC,IAAI;GAAIA,MAAI;GAAKN,MAAI;GAAI;CACjC;AAED,WAAQ,MAAM,MAAM,SAAU,OAAO;AACpC,SAAO;GAAE,MAAM,KAAK,QAAS;GAAM,MAAM,KAAK,QAAS;GAAM,MAAM,KAAK,QAAS;GAAI;CACrF;AAED,WAAQ,IAAI,QAAQ,SAAU,KAAK;AAClC,SAAO;GAAE,IAAI,KAAK,MAAO;GAAQ,IAAI,KAAK,MAAO;GAAQ,IAAI,KAAK,MAAO;GAAM;CAC/E;AAED,WAAQ,KAAK,MAAM,SAAU,MAAM;AAClC,SAAO;GAAC,KAAK,KAAK,MAAM;GAAK,KAAK,KAAK,MAAM;GAAK,KAAK,KAAK,MAAM;GAAI;CACtE;AAED,WAAQ,KAAK,MAAM,SAAU,MAAM;AAClC,SAAO;GAAC;GAAG;GAAG,KAAK;GAAG;CACtB;AAED,WAAQ,KAAK,MAAMD,UAAQ,KAAK;AAEhC,WAAQ,KAAK,MAAM,SAAU,MAAM;AAClC,SAAO;GAAC;GAAG;GAAK,KAAK;GAAG;CACxB;AAED,WAAQ,KAAK,OAAO,SAAU,MAAM;AACnC,SAAO;GAAC;GAAG;GAAG;GAAG,KAAK;GAAG;CACzB;AAED,WAAQ,KAAK,MAAM,SAAU,MAAM;AAClC,SAAO;GAAC,KAAK;GAAI;GAAG;GAAE;CACtB;AAED,WAAQ,KAAK,MAAM,SAAU,MAAM;EAClC,MAAM,MAAM,KAAK,MAAM,KAAK,KAAK,MAAM,OAAO;EAC9C,MAAM,WAAW,OAAO,OAAO,OAAO,KAAK;EAE3C,MAAM,SAAS,QAAQ,SAAS,IAAI;AACpC,SAAO,SAAS,UAAU,OAAO,UAAU;CAC3C;AAED,WAAQ,IAAI,OAAO,SAAU,KAAK;EACjC,MAAM,OAAO,IAAI,KAAK,IAAI,KAAK,IAAI,MAAM;AACzC,SAAO,CAAC,MAAM,MAAM,IAAI;CACxB;;;;;;CCt0BD,MAAMe;CAaN,SAAS,aAAa;EACrB,MAAM,QAAQ,EAAE;EAEhB,MAAMC,WAAS,OAAO,KAAKD;AAE3B,OAAK,IAAI,MAAMC,SAAO,QAAQ,IAAI,GAAG,IAAI,KAAK,IAC7C,OAAMA,SAAO,MAAM;GAGlB,UAAU;GACV,QAAQ;GACR;AAGF,SAAO;CACP;CAGD,SAAS,UAAU,WAAW;EAC7B,MAAM,QAAQ;EACd,MAAM,QAAQ,CAAC,UAAU;AAEzB,QAAM,WAAW,WAAW;AAE5B,SAAO,MAAM,QAAQ;GACpB,MAAM,UAAU,MAAM;GACtB,MAAM,YAAY,OAAO,KAAKD,cAAY;AAE1C,QAAK,IAAI,MAAM,UAAU,QAAQ,IAAI,GAAG,IAAI,KAAK,KAAK;IACrD,MAAM,WAAW,UAAU;IAC3B,MAAM,OAAO,MAAM;AAEnB,QAAI,KAAK,aAAa,IAAI;AACzB,UAAK,WAAW,MAAM,SAAS,WAAW;AAC1C,UAAK,SAAS;AACd,WAAM,QAAQ;IACd;GACD;EACD;AAED,SAAO;CACP;CAED,SAAS,KAAK,MAAM,IAAI;AACvB,SAAO,SAAU,MAAM;AACtB,UAAO,GAAG,KAAK;EACf;CACD;CAED,SAAS,eAAe,SAAS,OAAO;EACvC,MAAME,SAAO,CAAC,MAAM,SAAS,QAAQ,QAAQ;EAC7C,IAAI,KAAKF,cAAY,MAAM,SAAS,QAAQ;EAE5C,IAAI,MAAM,MAAM,SAAS;AACzB,SAAO,MAAM,KAAK,QAAQ;AACzB,UAAK,QAAQ,MAAM,KAAK;AACxB,QAAK,KAAKA,cAAY,MAAM,KAAK,QAAQ,MAAM;AAC/C,SAAM,MAAM,KAAK;EACjB;AAED,KAAG,aAAaE;AAChB,SAAO;CACP;AAED,QAAO,UAAU,SAAU,WAAW;EACrC,MAAM,QAAQ,UAAU;EACxB,MAAM,aAAa,EAAE;EAErB,MAAMD,WAAS,OAAO,KAAK;AAC3B,OAAK,IAAI,MAAMA,SAAO,QAAQ,IAAI,GAAG,IAAI,KAAK,KAAK;GAClD,MAAM,UAAUA,SAAO;GACvB,MAAM,OAAO,MAAM;AAEnB,OAAI,KAAK,WAAW,KAEnB;AAGD,cAAW,WAAW,eAAe,SAAS;EAC9C;AAED,SAAO;CACP;;;;;;CC/FD,MAAM;CACN,MAAM;CAEN,MAAM,UAAU,EAAE;CAElB,MAAM,SAAS,OAAO,KAAK;CAE3B,SAAS,QAAQ,IAAI;EACpB,MAAM,YAAY,SAAU,GAAG,MAAM;GACpC,MAAM,OAAO,KAAK;AAClB,OAAI,SAAS,UAAa,SAAS,KAClC,QAAO;AAGR,OAAI,KAAK,SAAS,EACjB,QAAO;AAGR,UAAO,GAAG;EACV;AAGD,MAAI,gBAAgB,GACnB,WAAU,aAAa,GAAG;AAG3B,SAAO;CACP;CAED,SAAS,YAAY,IAAI;EACxB,MAAM,YAAY,SAAU,GAAG,MAAM;GACpC,MAAM,OAAO,KAAK;AAElB,OAAI,SAAS,UAAa,SAAS,KAClC,QAAO;AAGR,OAAI,KAAK,SAAS,EACjB,QAAO;GAGR,MAAM,SAAS,GAAG;AAKlB,OAAI,OAAO,WAAW,SACrB,MAAK,IAAI,MAAM,OAAO,QAAQ,IAAI,GAAG,IAAI,KAAK,IAC7C,QAAO,KAAK,KAAK,MAAM,OAAO;AAIhC,UAAO;EACP;AAGD,MAAI,gBAAgB,GACnB,WAAU,aAAa,GAAG;AAG3B,SAAO;CACP;AAED,QAAO,SAAQ,cAAa;AAC3B,UAAQ,aAAa,EAAE;AAEvB,SAAO,eAAe,QAAQ,YAAY,YAAY,EAAC,OAAO,YAAY,WAAW,UAAS;AAC9F,SAAO,eAAe,QAAQ,YAAY,UAAU,EAAC,OAAO,YAAY,WAAW,QAAO;EAE1F,MAAM,SAAS,MAAM;EACrB,MAAM,cAAc,OAAO,KAAK;AAEhC,cAAY,SAAQ,YAAW;GAC9B,MAAM,KAAK,OAAO;AAElB,WAAQ,WAAW,WAAW,YAAY;AAC1C,WAAQ,WAAW,SAAS,MAAM,QAAQ;EAC1C;CACD;AAED,QAAO,UAAU;;;;;;CC9EjB,MAAM,cAAc,IAAI,YAAY,GAAG,SAAS;EAC/C,MAAM,OAAO,GAAG,GAAG;AACnB,SAAO,UAAU,OAAO,OAAO;CAC/B;CAED,MAAME,iBAAe,IAAI,YAAY,GAAG,SAAS;EAChD,MAAM,OAAO,GAAG,GAAG;AACnB,SAAO,UAAU,KAAK,OAAO,KAAK,KAAK;CACvC;CAED,MAAMC,iBAAe,IAAI,YAAY,GAAG,SAAS;EAChD,MAAM,MAAM,GAAG,GAAG;AAClB,SAAO,UAAU,KAAK,OAAO,KAAK,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG;CAC7D;CAED,MAAM,aAAY,QAAKC;CACvB,MAAM,WAAW,GAAG,KAAG,QAAM;EAAC;EAAGC;EAAGC;EAAE;CAEtC,MAAM,mBAAmB,QAAQ,UAAU,QAAQ;AAClD,SAAO,eAAe,QAAQ,UAAU;GACvC,WAAW;IACV,MAAM,QAAQ;AAEd,WAAO,eAAe,QAAQ,UAAU;KACvC;KACA,YAAY;KACZ,cAAc;KACd;AAED,WAAO;GACP;GACD,YAAY;GACZ,cAAc;GACd;CACD;;CAGD,IAAI;CACJ,MAAM,qBAAqB,MAAM,aAAa,UAAU,iBAAiB;AACxE,MAAI,iBAAiB,OACpB;EAGD,MAAM,SAAS,eAAe,KAAK;EACnC,MAAMC,WAAS,EAAE;AAEjB,OAAK,MAAM,CAAC,aAAa,MAAM,IAAI,OAAO,QAAQ,eAAe;GAChE,MAAM,OAAO,gBAAgB,WAAW,SAAS;AACjD,OAAI,gBAAgB,YACnB,UAAO,QAAQ,KAAK,UAAU;YACpB,OAAO,UAAU,SAC3B,UAAO,QAAQ,KAAK,MAAM,cAAc;EAEzC;AAED,SAAOA;CACP;CAED,SAASC,mBAAiB;EACzB,MAAM,wBAAQ,IAAI;EAClB,MAAMD,WAAS;GACd,UAAU;IACT,OAAO,CAAC,GAAG,EAAE;IAEb,MAAM,CAAC,GAAG,GAAG;IACb,KAAK,CAAC,GAAG,GAAG;IACZ,QAAQ,CAAC,GAAG,GAAG;IACf,WAAW,CAAC,GAAG,GAAG;IAClB,SAAS,CAAC,GAAG,GAAG;IAChB,QAAQ,CAAC,GAAG,GAAG;IACf,eAAe,CAAC,GAAG,GAAG;IACtB;GACD,OAAO;IACN,OAAO,CAAC,IAAI,GAAG;IACf,KAAK,CAAC,IAAI,GAAG;IACb,OAAO,CAAC,IAAI,GAAG;IACf,QAAQ,CAAC,IAAI,GAAG;IAChB,MAAM,CAAC,IAAI,GAAG;IACd,SAAS,CAAC,IAAI,GAAG;IACjB,MAAM,CAAC,IAAI,GAAG;IACd,OAAO,CAAC,IAAI,GAAG;IAGf,aAAa,CAAC,IAAI,GAAG;IACrB,WAAW,CAAC,IAAI,GAAG;IACnB,aAAa,CAAC,IAAI,GAAG;IACrB,cAAc,CAAC,IAAI,GAAG;IACtB,YAAY,CAAC,IAAI,GAAG;IACpB,eAAe,CAAC,IAAI,GAAG;IACvB,YAAY,CAAC,IAAI,GAAG;IACpB,aAAa,CAAC,IAAI,GAAG;IACrB;GACD,SAAS;IACR,SAAS,CAAC,IAAI,GAAG;IACjB,OAAO,CAAC,IAAI,GAAG;IACf,SAAS,CAAC,IAAI,GAAG;IACjB,UAAU,CAAC,IAAI,GAAG;IAClB,QAAQ,CAAC,IAAI,GAAG;IAChB,WAAW,CAAC,IAAI,GAAG;IACnB,QAAQ,CAAC,IAAI,GAAG;IAChB,SAAS,CAAC,IAAI,GAAG;IAGjB,eAAe,CAAC,KAAK,GAAG;IACxB,aAAa,CAAC,KAAK,GAAG;IACtB,eAAe,CAAC,KAAK,GAAG;IACxB,gBAAgB,CAAC,KAAK,GAAG;IACzB,cAAc,CAAC,KAAK,GAAG;IACvB,iBAAiB,CAAC,KAAK,GAAG;IAC1B,cAAc,CAAC,KAAK,GAAG;IACvB,eAAe,CAAC,KAAK,GAAG;IACxB;GACD;AAGD,WAAO,MAAM,OAAOA,SAAO,MAAM;AACjC,WAAO,QAAQ,SAASA,SAAO,QAAQ;AACvC,WAAO,MAAM,OAAOA,SAAO,MAAM;AACjC,WAAO,QAAQ,SAASA,SAAO,QAAQ;AAEvC,OAAK,MAAM,CAAC,WAAW,MAAM,IAAI,OAAO,QAAQA,WAAS;AACxD,QAAK,MAAM,CAAC,WAAW,MAAM,IAAI,OAAO,QAAQ,QAAQ;AACvD,aAAO,aAAa;KACnB,MAAM,UAAU,MAAM,GAAG;KACzB,OAAO,UAAU,MAAM,GAAG;KAC1B;AAED,UAAM,aAAaA,SAAO;AAE1B,UAAM,IAAI,MAAM,IAAI,MAAM;GAC1B;AAED,UAAO,eAAeA,UAAQ,WAAW;IACxC,OAAO;IACP,YAAY;IACZ;EACD;AAED,SAAO,eAAeA,UAAQ,SAAS;GACtC,OAAO;GACP,YAAY;GACZ;AAED,WAAO,MAAM,QAAQ;AACrB,WAAO,QAAQ,QAAQ;AAEvB,kBAAgBA,SAAO,OAAO,cAAc,kBAAkB,YAAY,UAAU,WAAW;AAC/F,kBAAgBA,SAAO,OAAO,iBAAiB,kBAAkBL,eAAa,WAAW,WAAW;AACpG,kBAAgBK,SAAO,OAAO,iBAAiB,kBAAkBJ,eAAa,OAAO,SAAS;AAC9F,kBAAgBI,SAAO,SAAS,cAAc,kBAAkB,YAAY,UAAU,WAAW;AACjG,kBAAgBA,SAAO,SAAS,iBAAiB,kBAAkBL,eAAa,WAAW,WAAW;AACtG,kBAAgBK,SAAO,SAAS,iBAAiB,kBAAkBJ,eAAa,OAAO,SAAS;AAEhG,SAAOI;CACP;AAGD,QAAO,eAAe,QAAQ,WAAW;EACxC,YAAY;EACZ,KAAKC;EACL;;;;;;AChKD,QAAO,WAAW,MAAM,OAAO,QAAQ,SAAS;EAC/C,MAAM,SAAS,KAAK,WAAW,OAAO,KAAM,KAAK,WAAW,IAAI,MAAM;EACtE,MAAM,WAAW,KAAK,QAAQ,SAAS;EACvC,MAAM,qBAAqB,KAAK,QAAQ;AACxC,SAAO,aAAa,OAAO,uBAAuB,MAAM,WAAW;CACnE;;;;;;CCND,MAAM,KAAK,QAAQ;CACnB,MAAM,MAAM,QAAQ;CACpB,MAAM;CAEN,MAAM,EAAC,KAAI,GAAG;CAEd,IAAI;AACJ,KAAI,QAAQ,eACX,QAAQ,gBACR,QAAQ,kBACR,QAAQ,eACR,cAAa;UACH,QAAQ,YAClB,QAAQ,aACR,QAAQ,iBACR,QAAQ,gBACR,cAAa;AAGd,KAAI,iBAAiB,IACpB,KAAI,IAAI,gBAAgB,OACvB,cAAa;UACH,IAAI,gBAAgB,QAC9B,cAAa;KAEb,cAAa,IAAI,YAAY,WAAW,IAAI,IAAI,KAAK,IAAI,SAAS,IAAI,aAAa,KAAK;CAI1F,SAAS,eAAe,OAAO;AAC9B,MAAI,UAAU,EACb,QAAO;AAGR,SAAO;GACN;GACA,UAAU;GACV,QAAQ,SAAS;GACjB,QAAQ,SAAS;GACjB;CACD;CAED,SAAS,cAAc,YAAY,aAAa;AAC/C,MAAI,eAAe,EAClB,QAAO;AAGR,MAAI,QAAQ,gBACX,QAAQ,iBACR,QAAQ,mBACR,QAAO;AAGR,MAAI,QAAQ,aACX,QAAO;AAGR,MAAI,cAAc,CAAC,eAAe,eAAe,OAChD,QAAO;EAGR,MAAM,MAAM,cAAc;AAE1B,MAAI,IAAI,SAAS,OAChB,QAAO;AAGR,MAAI,QAAQ,aAAa,SAAS;GAGjC,MAAM,YAAY,GAAG,UAAU,MAAM;AACrC,OACC,OAAO,UAAU,OAAO,MACxB,OAAO,UAAU,OAAO,MAExB,QAAO,OAAO,UAAU,OAAO,QAAQ,IAAI;AAG5C,UAAO;EACP;AAED,MAAI,QAAQ,KAAK;AAChB,OAAI;IAAC;IAAU;IAAY;IAAY;IAAa;IAAkB;IAAY,CAAC,MAAK,SAAQ,QAAQ,QAAQ,IAAI,YAAY,WAC/H,QAAO;AAGR,UAAO;EACP;AAED,MAAI,sBAAsB,IACzB,QAAO,gCAAgC,KAAK,IAAI,oBAAoB,IAAI;AAGzE,MAAI,IAAI,cAAc,YACrB,QAAO;AAGR,MAAI,kBAAkB,KAAK;GAC1B,MAAMC,YAAU,UAAU,IAAI,wBAAwB,IAAI,MAAM,KAAK,IAAI;AAEzE,WAAQ,IAAI,cAAZ;IACC,KAAK,YACJ,QAAOA,aAAW,IAAI,IAAI;IAC3B,KAAK,iBACJ,QAAO;GAER;EACD;AAED,MAAI,iBAAiB,KAAK,IAAI,MAC7B,QAAO;AAGR,MAAI,8DAA8D,KAAK,IAAI,MAC1E,QAAO;AAGR,MAAI,eAAe,IAClB,QAAO;AAGR,SAAO;CACP;CAED,SAAS,gBAAgB,QAAQ;EAChC,MAAM,QAAQ,cAAc,QAAQ,UAAU,OAAO;AACrD,SAAO,eAAe;CACtB;AAED,QAAO,UAAU;EAChB,eAAe;EACf,QAAQ,eAAe,cAAc,MAAM,IAAI,OAAO;EACtD,QAAQ,eAAe,cAAc,MAAM,IAAI,OAAO;EACtD;;;;;;CCpID,MAAMC,sBAAoB,QAAQ,WAAW,aAAa;EACzD,IAAI,QAAQ,OAAO,QAAQ;AAC3B,MAAI,UAAU,GACb,QAAO;EAGR,MAAM,kBAAkB,UAAU;EAClC,IAAI,WAAW;EACf,IAAI,cAAc;AAClB,KAAG;AACF,kBAAe,OAAO,OAAO,UAAU,QAAQ,YAAY,YAAY;AACvE,cAAW,QAAQ;AACnB,WAAQ,OAAO,QAAQ,WAAW;EAClC,SAAQ,UAAU;AAEnB,iBAAe,OAAO,OAAO;AAC7B,SAAO;CACP;CAED,MAAMC,oCAAkC,QAAQ,QAAQ,SAAS,UAAU;EAC1E,IAAI,WAAW;EACf,IAAI,cAAc;AAClB,KAAG;GACF,MAAM,QAAQ,OAAO,QAAQ,OAAO;AACpC,kBAAe,OAAO,OAAO,WAAW,QAAQ,QAAQ,IAAI,SAAS,YAAY,UAAU,QAAQ,SAAS,QAAQ;AACpH,cAAW,QAAQ;AACnB,WAAQ,OAAO,QAAQ,MAAM;EAC7B,SAAQ,UAAU;AAEnB,iBAAe,OAAO,OAAO;AAC7B,SAAO;CACP;AAED,QAAO,UAAU;EAChB;EACA;EACA;;;;;;CCrCD,MAAM,iBAAiB;CACvB,MAAM,cAAc;CACpB,MAAM,eAAe;CACrB,MAAM,eAAe;CAErB,MAAM,UAAU,IAAI,IAAI;EACvB,CAAC,KAAK,KAAK;EACX,CAAC,KAAK,KAAK;EACX,CAAC,KAAK,IAAK;EACX,CAAC,KAAK,KAAK;EACX,CAAC,KAAK,KAAK;EACX,CAAC,KAAK,KAAK;EACX,CAAC,KAAK,KAAK;EACX,CAAC,MAAM,KAAK;EACZ,CAAC,KAAK,OAAS;EACf,CAAC,KAAK,OAAS;EACf;CAED,SAAS,SAAS,KAAG;EACpB,MAAMC,MAAIC,IAAE,OAAO;EACnB,MAAM,UAAUA,IAAE,OAAO;AAEzB,MAAKD,OAAK,CAAC,WAAWC,IAAE,WAAW,KAAOA,IAAE,OAAO,OAAOA,IAAE,WAAW,EACtE,QAAO,OAAO,aAAa,SAASA,IAAE,MAAM,IAAI;AAGjD,MAAID,OAAK,QACR,QAAO,OAAO,cAAc,SAASC,IAAE,MAAM,GAAG,KAAK;AAGtD,SAAO,QAAQ,IAAIA,QAAMA;CACzB;CAED,SAAS,eAAe,MAAM,YAAY;EACzC,MAAM,UAAU,EAAE;EAClB,MAAM,SAAS,WAAW,OAAO,MAAM;EACvC,IAAI;AAEJ,OAAK,MAAM,SAAS,QAAQ;GAC3B,MAAM,SAAS,OAAO;AACtB,OAAI,CAAC,OAAO,MAAM,QACjB,SAAQ,KAAK;YACF,UAAU,MAAM,MAAM,cACjC,SAAQ,KAAK,QAAQ,GAAG,QAAQ,eAAe,KAAG,QAAQ,cAAc,SAAS,SAAS,UAAU;OAEpG,OAAM,IAAI,MAAM,0CAA0C,MAAM,cAAc,KAAK;EAEpF;AAED,SAAO;CACP;CAED,SAAS,WAAW,OAAO;AAC1B,cAAY,YAAY;EAExB,MAAM,UAAU,EAAE;EAClB,IAAI;AAEJ,UAAQ,UAAU,YAAY,KAAK,YAAY,MAAM;GACpD,MAAM,OAAO,QAAQ;AAErB,OAAI,QAAQ,IAAI;IACf,MAAM,OAAO,eAAe,MAAM,QAAQ;AAC1C,YAAQ,KAAK,CAAC,KAAK,CAAC,OAAO;GAC3B,MACA,SAAQ,KAAK,CAAC,KAAK;EAEpB;AAED,SAAO;CACP;CAED,SAAS,WAAW,SAAO,UAAQ;EAClC,MAAM,UAAU,EAAE;AAElB,OAAK,MAAM,SAASC,SACnB,MAAK,MAAM,SAAS,MAAM,OACzB,SAAQ,MAAM,MAAM,MAAM,UAAU,OAAO,MAAM,MAAM;EAIzD,IAAI,UAAUC;AACd,OAAK,MAAM,CAAC,WAAWD,SAAO,IAAI,OAAO,QAAQ,UAAU;AAC1D,OAAI,CAAC,MAAM,QAAQA,UAClB;AAGD,OAAI,EAAE,aAAa,SAClB,OAAM,IAAI,MAAM,wBAAwB;AAGzC,aAAUA,SAAO,SAAS,IAAI,QAAQ,WAAW,GAAGA,YAAU,QAAQ;EACtE;AAED,SAAO;CACP;AAED,QAAO,WAAW,SAAO,cAAc;EACtC,MAAMA,WAAS,EAAE;EACjB,MAAM,SAAS,EAAE;EACjB,IAAI,QAAQ,EAAE;AAGd,YAAU,QAAQ,iBAAiB,KAAG,iBAAiB,SAAS,OAAO,OAAO,cAAc;AAC3F,OAAI,gBACH,OAAM,KAAK,SAAS;YACV,OAAO;IACjB,MAAM,SAAS,MAAM,KAAK;AAC1B,YAAQ,EAAE;AACV,WAAO,KAAKA,SAAO,WAAW,IAAI,SAAS,WAAWC,SAAOD,UAAQ;AACrE,aAAO,KAAK;KAAC;KAAS,QAAQ,WAAW;KAAO;GAChD,WAAU,OAAO;AACjB,QAAIA,SAAO,WAAW,EACrB,OAAM,IAAI,MAAM;AAGjB,WAAO,KAAK,WAAWC,SAAOD,UAAQ,MAAM,KAAK;AACjD,YAAQ,EAAE;AACV,aAAO;GACP,MACA,OAAM,KAAK;EAEZ;AAED,SAAO,KAAK,MAAM,KAAK;AAEvB,MAAIA,SAAO,SAAS,GAAG;GACtB,MAAM,aAAa,qCAAqCA,SAAO,OAAO,kBAAkBA,SAAO,WAAW,IAAI,KAAK,IAAI;AACvH,SAAM,IAAI,MAAM;EAChB;AAED,SAAO,OAAO,KAAK;CACnB;;;;;;CCpID,MAAM;CACN,MAAM,EAAC,QAAQ,aAAa,QAAQ,aAAY;CAChD,MAAM,EACL,kBACA,gCACA;CAED,MAAM,EAAC,SAAQ,GAAG;CAGlB,MAAM,eAAe;EACpB;EACA;EACA;EACA;EACA;CAED,MAAM,SAAS,OAAO,OAAO;CAE7B,MAAM,gBAAgB,QAAQ,UAAU,EAAE,KAAK;AAC9C,MAAI,QAAQ,SAAS,EAAE,OAAO,UAAU,QAAQ,UAAU,QAAQ,SAAS,KAAK,QAAQ,SAAS,GAChG,OAAM,IAAI,MAAM;EAIjB,MAAM,aAAa,cAAc,YAAY,QAAQ;AACrD,SAAO,QAAQ,QAAQ,UAAU,SAAY,aAAa,QAAQ;CAClE;CAED,IAAM,aAAN,MAAiB;EAChB,YAAY,SAAS;AAEpB,UAAO,aAAa;EACpB;CACD;CAED,MAAM,gBAAe,YAAW;EAC/B,MAAME,UAAQ,EAAE;AAChB,eAAaA,SAAO;AAEpB,UAAM,YAAY,GAAG,eAAe,SAASA,QAAM,UAAU,GAAG;AAEhE,SAAO,eAAeA,SAAO,MAAM;AACnC,SAAO,eAAeA,QAAM,UAAUA;AAEtC,UAAM,SAAS,oBAAoB;AAClC,SAAM,IAAI,MAAM;EAChB;AAED,UAAM,SAAS,WAAW;AAE1B,SAAOA,QAAM;CACb;CAED,SAAS,MAAM,SAAS;AACvB,SAAO,aAAa;CACpB;AAED,MAAK,MAAM,CAAC,WAAW,MAAM,IAAI,OAAO,QAAQ,YAC/C,QAAO,aAAa,EACnB,MAAM;EACL,MAAM,UAAU,cAAc,MAAM,aAAa,MAAM,MAAM,MAAM,OAAO,KAAK,UAAU,KAAK;AAC9F,SAAO,eAAe,MAAM,WAAW,EAAC,OAAO,SAAQ;AACvD,SAAO;CACP,GACD;AAGF,QAAO,UAAU,EAChB,MAAM;EACL,MAAM,UAAU,cAAc,MAAM,KAAK,SAAS;AAClD,SAAO,eAAe,MAAM,WAAW,EAAC,OAAO,SAAQ;AACvD,SAAO;CACP,GACD;CAED,MAAM,aAAa;EAAC;EAAO;EAAO;EAAW;EAAO;EAAO;EAAO;EAAQ;EAAU;AAEpF,MAAK,MAAM,SAAS,WACnB,QAAO,SAAS,EACf,MAAM;EACL,MAAM,EAAC,OAAM,GAAG;AAChB,SAAO,SAAU,GAAG,YAAY;GAC/B,MAAM,SAAS,aAAa,WAAW,MAAM,aAAa,QAAQ,OAAO,GAAG,aAAa,WAAW,MAAM,OAAO,KAAK;AACtH,UAAO,cAAc,MAAM,QAAQ,KAAK;EACxC;CACD,GACD;AAGF,MAAK,MAAM,SAAS,YAAY;EAC/B,MAAM,UAAU,OAAO,MAAM,GAAG,gBAAgB,MAAM,MAAM;AAC5D,SAAO,WAAW,EACjB,MAAM;GACL,MAAM,EAAC,OAAM,GAAG;AAChB,UAAO,SAAU,GAAG,YAAY;IAC/B,MAAM,SAAS,aAAa,WAAW,QAAQ,aAAa,QAAQ,OAAO,GAAG,aAAa,WAAW,QAAQ,OAAO,KAAK;AAC1H,WAAO,cAAc,MAAM,QAAQ,KAAK;GACxC;EACD,GACD;CACD;CAED,MAAM,QAAQ,OAAO,uBAAuB,CAAE,GAAE;EAC/C,GAAG;EACH,OAAO;GACN,YAAY;GACZ,MAAM;AACL,WAAO,KAAK,WAAW;GACvB;GACD,IAAI,OAAO;AACV,SAAK,WAAW,QAAQ;GACxB;GACD;EACD;CAED,MAAM,gBAAgB,MAAM,OAAO,WAAW;EAC7C,IAAI;EACJ,IAAI;AACJ,MAAI,WAAW,QAAW;AACzB,aAAU;AACV,cAAW;EACX,OAAM;AACN,aAAU,OAAO,UAAU;AAC3B,cAAW,QAAQ,OAAO;EAC1B;AAED,SAAO;GACN;GACA;GACA;GACA;GACA;GACA;CACD;CAED,MAAM,iBAAiB,MAAM,SAAS,aAAa;EAClD,MAAM,WAAW,GAAG,eAAe;AAClC,OAAI,QAAQ,WAAW,OAAO,QAAQ,WAAW,GAAG,KAEnD,QAAO,WAAW,SAAS,SAAS,SAAS,GAAG;AAKjD,UAAO,WAAW,SAAU,WAAW,WAAW,IAAM,KAAK,WAAW,KAAM,WAAW,KAAK;EAC9F;AAID,SAAO,eAAe,SAAS;AAE/B,UAAQ,aAAa;AACrB,UAAQ,UAAU;AAClB,UAAQ,WAAW;AAEnB,SAAO;CACP;CAED,MAAM,cAAc,MAAM,WAAW;AACpC,MAAI,KAAK,SAAS,KAAK,CAAC,OACvB,QAAO,KAAK,WAAW,KAAK;EAG7B,IAAI,SAAS,KAAK;AAElB,MAAI,WAAW,OACd,QAAO;EAGR,MAAM,EAAC,SAAS,UAAS,GAAG;AAC5B,MAAI,OAAO,QAAQ,YAAc,GAChC,QAAO,WAAW,QAAW;AAI5B,YAAS,iBAAiB,QAAQ,OAAO,OAAO,OAAO;AAEvD,YAAS,OAAO;EAChB;EAMF,MAAM,UAAU,OAAO,QAAQ;AAC/B,MAAI,YAAY,GACf,UAAS,+BAA+B,QAAQ,UAAU,SAAS;AAGpE,SAAO,UAAU,SAAS;CAC1B;CAED,IAAI;CACJ,MAAM,YAAY,SAAO,GAAG,YAAY;EACvC,MAAM,CAAC,YAAY,GAAG;AAEtB,MAAI,CAAC,QAAQ,gBAAgB,CAAC,QAAQ,YAAY,KAGjD,QAAO,QAAQ,KAAK;EAGrB,MAAM,aAAa,QAAQ,MAAM;EACjC,MAAM,QAAQ,CAAC,YAAY,IAAI,GAAG;AAElC,OAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,IACvC,OAAM,KACL,OAAO,WAAW,IAAI,IAAI,QAAQ,WAAW,SAC7C,OAAO,YAAY,IAAI;AAIzB,MAAI,aAAa,OAChB;AAGD,SAAO,SAASA,SAAO,MAAM,KAAK;CAClC;AAED,QAAO,iBAAiB,MAAM,WAAW;CAEzC,MAAMA,UAAQ;AACd,SAAM,gBAAgB;AACtB,SAAM,SAAS,MAAM,EAAC,OAAO,cAAc,YAAY,QAAQ,GAAE;AACjE,SAAM,OAAO,gBAAgB;AAE7B,QAAO,UAAUA;;;;;;AClOjB,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,UAAUC;AAClB,SAAQ,cAAc,KAAK;;;;;;;CAU3B,SAASA,UAAQ,OAAO;AACtB,MAAI,UAAU,OACZ,QAAO;WACE,UAAU,KACnB,QAAO;WACE,MAAM,QAAQ,OACvB,QAAO;WACE,OAAO,UAAU,UAC1B,QAAO;WACE,OAAO,UAAU,WAC1B,QAAO;WACE,OAAO,UAAU,SAC1B,QAAO;WACE,OAAO,UAAU,SAC1B,QAAO;WACE,OAAO,UAAU,SAC1B,QAAO;WACE,OAAO,UAAU,UAAU;AACpC,OAAI,SAAS,MACX;QAAI,MAAM,gBAAgB,OACxB,QAAO;aACE,MAAM,gBAAgB,IAC/B,QAAO;aACE,MAAM,gBAAgB,IAC/B,QAAO;aACE,MAAM,gBAAgB,KAC/B,QAAO;GACR;AAEH,UAAO;EACR,WAAU,OAAO,UAAU,SAC1B,QAAO;AAET,QAAM,IAAI,MAAM,0BAA0B;CAC3C;CACD,MAAM,eAAc,UAAS,OAAO,WAAW;AAC/C,SAAQ,cAAc;;;;;;CClDtB,MAAM,yBAAyB;CAE/B,MAAM,eAAe,SAAS,OAAM,SAAQ,UAAU,KAAK,OAAO,KAAK,KAAK;CAE5E,MAAM,eAAe,SAAS,OAAO,KAAK,OAAO,SAAS,UAAU,KAAK,OAAO,KAAK,IAAI,GAAG,MAAM,GAAG,KAAK;CAE1G,SAAS,iBAAiB;EACzB,MAAM,wBAAQ,IAAI;EAClB,MAAMC,WAAS;GACd,UAAU;IACT,OAAO,CAAC,GAAG,EAAE;IAEb,MAAM,CAAC,GAAG,GAAG;IACb,KAAK,CAAC,GAAG,GAAG;IACZ,QAAQ,CAAC,GAAG,GAAG;IACf,WAAW,CAAC,GAAG,GAAG;IAClB,UAAU,CAAC,IAAI,GAAG;IAClB,SAAS,CAAC,GAAG,GAAG;IAChB,QAAQ,CAAC,GAAG,GAAG;IACf,eAAe,CAAC,GAAG,GAAG;IACtB;GACD,OAAO;IACN,OAAO,CAAC,IAAI,GAAG;IACf,KAAK,CAAC,IAAI,GAAG;IACb,OAAO,CAAC,IAAI,GAAG;IACf,QAAQ,CAAC,IAAI,GAAG;IAChB,MAAM,CAAC,IAAI,GAAG;IACd,SAAS,CAAC,IAAI,GAAG;IACjB,MAAM,CAAC,IAAI,GAAG;IACd,OAAO,CAAC,IAAI,GAAG;IAGf,aAAa,CAAC,IAAI,GAAG;IACrB,WAAW,CAAC,IAAI,GAAG;IACnB,aAAa,CAAC,IAAI,GAAG;IACrB,cAAc,CAAC,IAAI,GAAG;IACtB,YAAY,CAAC,IAAI,GAAG;IACpB,eAAe,CAAC,IAAI,GAAG;IACvB,YAAY,CAAC,IAAI,GAAG;IACpB,aAAa,CAAC,IAAI,GAAG;IACrB;GACD,SAAS;IACR,SAAS,CAAC,IAAI,GAAG;IACjB,OAAO,CAAC,IAAI,GAAG;IACf,SAAS,CAAC,IAAI,GAAG;IACjB,UAAU,CAAC,IAAI,GAAG;IAClB,QAAQ,CAAC,IAAI,GAAG;IAChB,WAAW,CAAC,IAAI,GAAG;IACnB,QAAQ,CAAC,IAAI,GAAG;IAChB,SAAS,CAAC,IAAI,GAAG;IAGjB,eAAe,CAAC,KAAK,GAAG;IACxB,aAAa,CAAC,KAAK,GAAG;IACtB,eAAe,CAAC,KAAK,GAAG;IACxB,gBAAgB,CAAC,KAAK,GAAG;IACzB,cAAc,CAAC,KAAK,GAAG;IACvB,iBAAiB,CAAC,KAAK,GAAG;IAC1B,cAAc,CAAC,KAAK,GAAG;IACvB,eAAe,CAAC,KAAK,GAAG;IACxB;GACD;AAGD,WAAO,MAAM,OAAOA,SAAO,MAAM;AACjC,WAAO,QAAQ,SAASA,SAAO,QAAQ;AACvC,WAAO,MAAM,OAAOA,SAAO,MAAM;AACjC,WAAO,QAAQ,SAASA,SAAO,QAAQ;AAEvC,OAAK,MAAM,CAAC,WAAW,MAAM,IAAI,OAAO,QAAQA,WAAS;AACxD,QAAK,MAAM,CAAC,WAAW,MAAM,IAAI,OAAO,QAAQ,QAAQ;AACvD,aAAO,aAAa;KACnB,MAAM,UAAU,MAAM,GAAG;KACzB,OAAO,UAAU,MAAM,GAAG;KAC1B;AAED,UAAM,aAAaA,SAAO;AAE1B,UAAM,IAAI,MAAM,IAAI,MAAM;GAC1B;AAED,UAAO,eAAeA,UAAQ,WAAW;IACxC,OAAO;IACP,YAAY;IACZ;EACD;AAED,SAAO,eAAeA,UAAQ,SAAS;GACtC,OAAO;GACP,YAAY;GACZ;AAED,WAAO,MAAM,QAAQ;AACrB,WAAO,QAAQ,QAAQ;AAEvB,WAAO,MAAM,UAAU;AACvB,WAAO,MAAM,UAAU;AACvB,WAAO,QAAQ,UAAU,YAAY;AACrC,WAAO,QAAQ,UAAU,YAAY;AAGrC,SAAO,iBAAiBA,UAAQ;GAC/B,cAAc;IACb,QAAQ,KAAK,OAAO,SAAS;AAG5B,SAAI,QAAQ,SAAS,UAAU,MAAM;AACpC,UAAI,MAAM,EACT,QAAO;AAGR,UAAI,MAAM,IACT,QAAO;AAGR,aAAO,KAAK,OAAQ,MAAM,KAAK,MAAO,MAAM;KAC5C;AAED,YAAO,KACL,KAAK,KAAK,MAAM,MAAM,MAAM,KAC5B,IAAI,KAAK,MAAM,QAAQ,MAAM,KAC9B,KAAK,MAAM,OAAO,MAAM;IACzB;IACD,YAAY;IACZ;GACD,UAAU;IACT,QAAO,QAAO;KACb,MAAM,UAAU,yCAAyC,KAAK,IAAI,SAAS;AAC3E,SAAI,CAAC,QACJ,QAAO;MAAC;MAAG;MAAG;MAAE;KAGjB,IAAI,EAAC,aAAY,GAAG,QAAQ;AAE5B,SAAI,YAAY,WAAW,EAC1B,eAAc,YAAY,MAAM,IAAI,KAAI,cAAa,YAAY,WAAW,KAAK;KAGlF,MAAM,UAAU,OAAO,SAAS,aAAa;AAE7C,YAAO;MACL,WAAW,KAAM;MACjB,WAAW,IAAK;MACjB,UAAU;MACV;IACD;IACD,YAAY;IACZ;GACD,cAAc;IACb,QAAO,QAAOA,SAAO,aAAa,GAAGA,SAAO,SAAS;IACrD,YAAY;IACZ;GACD;AAED,SAAOA;CACP;AAGD,QAAO,eAAe,QAAQ,WAAW;EACxC,YAAY;EACZ,KAAK;EACL;;;;;;ACjKD,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,uBAAuB;AAC/B,SAAQ,sBAAsB;AAC9B,SAAQ,iBAAiB;AACzB,SAAQ,wBAAwB;;;;;;;;CAShC,MAAM,iCAAiC,QAAQ,gBAAgB;EAC7D,MAAM,UAAU,OAAO,KAAK;EAC5B,MAAM,OAAO,gBAAgB,OAAO,QAAQ,KAAK,eAAe;AAChE,MAAI,OAAO,sBACT,QAAO,sBAAsB,QAAQ,SAAQ,WAAU;AACrD,OAAI,OAAO,yBAAyB,QAAQ,QAAQ,WAClD,MAAK,KAAK;EAEb;AAEH,SAAO;CACR;;;;;;CAOD,SAAS,qBACP,UACA,QACA,aACA,OACA,MACA,WAIA,YAAY,MACZ;EACA,IAAI,SAAS;EACb,IAAI,QAAQ;EACZ,IAAI,UAAU,SAAS;AACvB,MAAI,CAAC,QAAQ,MAAM;AACjB,aAAU,OAAO;GACjB,MAAM,kBAAkB,cAAc,OAAO;AAC7C,UAAO,CAAC,QAAQ,MAAM;AACpB,cAAU;AACV,QAAI,YAAY,OAAO,UAAU;AAC/B,eAAU;AACV;IACD;IACD,MAAM,OAAOC,UACX,QAAQ,MAAM,IACd,QACA,iBACA,OACA;IAEF,MAAM,QAAQA,UACZ,QAAQ,MAAM,IACd,QACA,iBACA,OACA;AAEF,cAAU,OAAO,YAAY;AAC7B,cAAU,SAAS;AACnB,QAAI,CAAC,QAAQ,KACX,WAAU,IAAI,OAAO;aACZ,CAAC,OAAO,IACjB,WAAU;GAEb;AACD,aAAU,OAAO,eAAe;EACjC;AACD,SAAO;CACR;;;;;;CAOD,SAAS,oBACP,UACA,QACA,aACA,OACA,MACA,WACA;EACA,IAAI,SAAS;EACb,IAAI,QAAQ;EACZ,IAAI,UAAU,SAAS;AACvB,MAAI,CAAC,QAAQ,MAAM;AACjB,aAAU,OAAO;GACjB,MAAM,kBAAkB,cAAc,OAAO;AAC7C,UAAO,CAAC,QAAQ,MAAM;AACpB,cAAU;AACV,QAAI,YAAY,OAAO,UAAU;AAC/B,eAAU;AACV;IACD;AACD,cAAUA,UAAQ,QAAQ,OAAO,QAAQ,iBAAiB,OAAO;AACjE,cAAU,SAAS;AACnB,QAAI,CAAC,QAAQ,KACX,WAAU,IAAI,OAAO;aACZ,CAAC,OAAO,IACjB,WAAU;GAEb;AACD,aAAU,OAAO,eAAe;EACjC;AACD,SAAO;CACR;;;;;;CAOD,SAAS,eAAe,QAAM,QAAQ,aAAa,OAAO,MAAM,WAAS;EACvE,IAAI,SAAS;AACb,MAAIC,OAAK,QAAQ;AACf,aAAU,OAAO;GACjB,MAAM,kBAAkB,cAAc,OAAO;AAC7C,QAAK,IAAI,IAAI,GAAG,IAAIA,OAAK,QAAQ,KAAK;AACpC,cAAU;AACV,QAAI,MAAM,OAAO,UAAU;AACzB,eAAU;AACV;IACD;AACD,QAAI,KAAKA,OACP,WAAUD,UAAQC,OAAK,IAAI,QAAQ,iBAAiB,OAAO;AAE7D,QAAI,IAAIA,OAAK,SAAS,EACpB,WAAU,IAAI,OAAO;aACZ,CAAC,OAAO,IACjB,WAAU;GAEb;AACD,aAAU,OAAO,eAAe;EACjC;AACD,SAAO;CACR;;;;;;CAOD,SAAS,sBAAsB,KAAK,QAAQ,aAAa,OAAO,MAAM,WAAS;EAC7E,IAAI,SAAS;EACb,MAAM,OAAO,8BAA8B,KAAK,OAAO;AACvD,MAAI,KAAK,QAAQ;AACf,aAAU,OAAO;GACjB,MAAM,kBAAkB,cAAc,OAAO;AAC7C,QAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;IACpC,MAAM,MAAM,KAAK;IACjB,MAAM,OAAOD,UAAQ,KAAK,QAAQ,iBAAiB,OAAO;IAC1D,MAAM,QAAQA,UAAQ,IAAI,MAAM,QAAQ,iBAAiB,OAAO;AAChE,cAAU,GAAG,kBAAkB,KAAK,IAAI;AACxC,QAAI,IAAI,KAAK,SAAS,EACpB,WAAU,IAAI,OAAO;aACZ,CAAC,OAAO,IACjB,WAAU;GAEb;AACD,aAAU,OAAO,eAAe;EACjC;AACD,SAAO;CACR;;;;;;ACjLD,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,OAAO,QAAQ,YAAY,QAAQ,UAAU,KAAK;CAC1D,IAAIE;CACJ,IAAIC,WAAS,WAAW,+BAA+B,WAAW;;;;;;;CAOlE,MAAM,oBACJ,OAAOA,aAAW,cAAcA,SAAO,MACnCA,SAAO,IAAI,4BACX;CACN,MAAMC,UAAQ;CACd,MAAMC,eAAa,KAAK,QAAQ,aAAa,OAAO,MAAM,cAAY;EACpE,MAAM,gBAAgB,IAAI;AAC1B,MACE,kBAAkB,qBAClB,kBAAkB,sBAClB;AACA,OAAI,EAAE,QAAQ,OAAO,SACnB,QAAO,IAAI,cAAc;AAE3B,UAAO,GAAG,gBAAgBD,QAAM,IAAI,GAAGF,eAAa,gBAClD,IAAI,QACJ,QACA,aACA,OACA,MACAI,WACA;EACH;AACD,MACE,kBAAkB,sBAClB,kBAAkB,uBAClB;AACA,OAAI,EAAE,QAAQ,OAAO,SACnB,QAAO,IAAI,cAAc;AAE3B,UAAO,GAAG,gBAAgBF,QAAM,IAAI,GAAGF,eAAa,uBAClD,IAAI,QACJ,QACA,aACA,OACA,MACAI,WACA;EACH;AACD,MACE,kBAAkB,oBAClB,kBAAkB,oBAElB,QACE,gBACAF,UACAE,UAAQ,IAAI,QAAQ,QAAQ,aAAa,OAAO;AAGpD,MACE,kBAAkB,sBAClB,kBAAkB,sBAElB,QACE,gBACAF,UACAE,UAAQ,IAAI,QAAQ,QAAQ,aAAa,OAAO;AAGpD,MAAI,OAAO,IAAI,wBAAwB,WACrC,OAAM,IAAI,MACR,sBAAsB,IAAI,YAAY,KAAK;AAG/C,SAAO,IAAI;CACZ;AACD,SAAQ,YAAYD;CACpB,MAAME,UAAO,QAAO,OAAO,IAAI,aAAa;AAC5C,SAAQ,OAAOA;CACf,MAAMC,WAAS;EACb;EACA;EACD;CACD,IAAIC,aAAWD;AACf,SAAQ,UAAUC;;;;;;ACtFlB,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,OAAO,QAAQ,YAAY,QAAQ,UAAU,KAAK;CAC1D,IAAIC;;;;;;;CAQJ,MAAMC,UAAQ;CACd,MAAM,eAAe,CAAC,gBAAgB,eAAe;CACrD,MAAM,eAAe;CACrB,MAAM,YAAW,SACf,aAAa,QAAQ,UAAU,MAAM,aAAa,KAAK;CACzD,MAAMC,UAAO,QACX,OACA,IAAI,eACJ,CAAC,CAAC,IAAI,YAAY,QAClB,SAAS,IAAI,YAAY;AAC3B,SAAQ,OAAOA;CACf,MAAM,kBAAiB,eACrB,WAAW,YAAY,SAAS;CAClC,MAAMC,eAAa,YAAY,QAAQ,aAAa,OAAO,MAAM,cAAY;EAC3E,MAAM,OAAO,WAAW,YAAY;AACpC,MAAI,EAAE,QAAQ,OAAO,SACnB,QAAO,IAAI,KAAK;AAElB,UACG,OAAO,MAAM,KAAK,OAAOF,YACzB,aAAa,QAAQ,UAAU,KAC5B,KAAK,GAAGD,eAAa,uBACnB,eAAe,cACX,MAAM,KAAK,YAAY,QAAQ,OAAO,cAAc;AAClD,SAAM,UAAU,QAAQ,UAAU;AAClC,UAAO;EACR,GAAE,EAAE,IACL,EACE,GAAG,YACJ,EACL,QACA,aACA,OACA,MACAI,WACA,KACF,KAAK,GAAGJ,eAAa,gBACnB,MAAM,KAAK,aACX,QACA,aACA,OACA,MACAI,WACA;CAET;AACD,SAAQ,YAAYD;CACpB,MAAME,WAAS;EACb;EACA;EACD;CACD,IAAIC,aAAWD;AACf,SAAQ,UAAUC;;;;;;AChElB,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,UAAU;;;;;;;CAQlB,SAAS,WAAW,KAAK;AACvB,SAAO,IAAI,QAAQ,MAAM,QAAQ,QAAQ,MAAM;CAChD;;;;;;ACbD,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,YACN,QAAQ,aACR,QAAQ,qBACR,QAAQ,eACR,QAAQ,eACR,QAAQ,gBACN,KAAK;CACT,IAAI,cAAcC;CAClB,SAASA,yBAAuB,KAAK;AACnC,SAAO,OAAO,IAAI,aAAa,MAAM,EAAC,SAAS,KAAI;CACpD;;;;;;;CASD,MAAM,cAAc,MAAM,OAAO,QAAQ,aAAa,OAAO,MAAM,cAAY;EAC7E,MAAM,kBAAkB,cAAc,OAAO;EAC7C,MAAM,SAAS,OAAO;AACtB,SAAO,KACJ,KAAI,QAAO;GACV,MAAM,QAAQ,MAAM;GACpB,IAAI,UAAUC,UAAQ,OAAO,QAAQ,iBAAiB,OAAO;AAC7D,OAAI,OAAO,UAAU,UAAU;AAC7B,QAAI,QAAQ,QAAQ,UAAU,GAC5B,WACE,OAAO,eACP,kBACA,UACA,OAAO,eACP;AAEJ,cAAU,IAAI,QAAQ;GACvB;AACD,UAAO,GACL,OAAO,eACP,cACA,OAAO,KAAK,OACZ,MACA,OAAO,KAAK,MACb,GAAG,OAAO,MAAM,OAAO,UAAU,OAAO,MAAM;EAChD,GACA,KAAK;CACT;AAGD,SAAQ,aAAa;CACrB,MAAM,iBAAiB,UAAU,QAAQ,aAAa,OAAO,MAAM,cACjE,SACG,KACC,UACE,OAAO,eACP,eACC,OAAO,UAAU,WACd,UAAU,OAAO,UACjBA,UAAQ,OAAO,QAAQ,aAAa,OAAO,QAElD,KAAK;AACV,SAAQ,gBAAgB;CACxB,MAAM,aAAa,MAAM,WAAW;EAClC,MAAM,eAAe,OAAO,OAAO;AACnC,SACE,aAAa,QAAQ,GAAG,YAAY,SAAS,QAAQ,aAAa;CAErE;AACD,SAAQ,YAAY;CACpB,MAAM,gBAAgB,SAAS,WAAW;EACxC,MAAM,eAAe,OAAO,OAAO;AACnC,SAAO,GAAG,aAAa,KAAK,OAAO,GAAG,YAAY,SAAS,SAAS,KAClE,aAAa;CAEhB;AAMD,SAAQ,eAAe;CACvB,MAAM,gBACJ,MACA,cACA,iBACA,QACA,gBACG;EACH,MAAM,WAAW,OAAO,OAAO;AAC/B,SAAO,GAAG,SAAS,KAAK,GAAG,OACzB,gBACA,SAAS,QACP,eACA,OAAO,eACP,cACA,SAAS,OAEX,kBACI,IAAI,SAAS,QAAQ,kBAAkB,OAAO,eAAe,cAAc,SAAS,KAAK,IAAI,SAC7F,GAAG,gBAAgB,CAAC,OAAO,MAAM,KAAK,IAAI,GAC/C,GAAG,SAAS;CACd;AACD,SAAQ,eAAe;CACvB,MAAM,sBAAsB,MAAM,WAAW;EAC3C,MAAM,WAAW,OAAO,OAAO;AAC/B,SAAO,GAAG,SAAS,KAAK,GAAG,OAAO,SAAS,MAAM,IAAI,SAAS,KAAK,KAAK,SAAS;CAClF;AACD,SAAQ,qBAAqB;;;;;;AC9G7B,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,OAAO,QAAQ,YAAY,QAAQ,UAAU,KAAK;CAC1D,IAAIC;;;;;;;CAQJ,MAAM,eAAe;CACrB,MAAM,YAAY;CAClB,MAAM,eAAe;CACrB,MAAM,gBAAgB;CACtB,MAAM,iBAAiB;CACvB,MAAM,oBAAmB,QAAO;AAC9B,MAAI;AACF,UAAO,OAAO,IAAI,iBAAiB,cAAc,IAAI,aAAa;EACnE,QAAO;AACN,UAAO;EACR;CACF;CACD,MAAM,YAAW,QAAO;EACtB,MAAM,kBAAkB,IAAI,YAAY;EACxC,MAAM,EAAC,UAAU,SAAQ,GAAG;EAC5B,MAAM,kBACH,OAAO,YAAY,YAAY,QAAQ,SAAS,QACjD,iBAAiB;AACnB,SACG,aAAa,iBACX,eAAe,KAAK,oBAAoB,oBAC1C,aAAa,aAAa,oBAAoB,UAC9C,aAAa,gBAAgB,oBAAoB,aACjD,aAAa,iBAAiB,oBAAoB;CAEtD;CACD,MAAMC,UAAO,QAAO,KAAK,aAAa,QAAQ,SAAS;AACvD,SAAQ,OAAOA;CACf,SAAS,WAAW,MAAM;AACxB,SAAO,KAAK,aAAa;CAC1B;CACD,SAAS,cAAc,MAAM;AAC3B,SAAO,KAAK,aAAa;CAC1B;CACD,SAAS,eAAe,MAAM;AAC5B,SAAO,KAAK,aAAa;CAC1B;CACD,MAAMC,eAAa,MAAM,QAAQ,aAAa,OAAO,MAAM,cAAY;AACrE,MAAI,WAAW,MACb,SAAQ,GAAGF,UAAQ,WAAW,KAAK,MAAM;AAE3C,MAAI,cAAc,MAChB,SAAQ,GAAGA,UAAQ,cAAc,KAAK,MAAM;EAE9C,MAAM,OAAO,eAAe,QACxB,qBACA,KAAK,QAAQ;AACjB,MAAI,EAAE,QAAQ,OAAO,SACnB,SAAQ,GAAGA,UAAQ,oBAAoB,MAAM;AAE/C,UAAQ,GAAGA,UAAQ,cACjB,OACC,GAAGA,UAAQ,YACV,eAAe,QACX,EAAE,GACF,MAAM,KAAK,KAAK,aAAY,SAAQ,KAAK,MAAM,QACnD,eAAe,QACX,EAAE,GACF,MAAM,KAAK,KAAK,YAAY,QAAQ,OAAO,cAAc;AACvD,SAAM,UAAU,QAAQ,UAAU;AAClC,UAAO;EACR,GAAE,EAAE,GACT,QACA,cAAc,OAAO,QACrB,OACA,MACAG,aAED,GAAGH,UAAQ,eACV,MAAM,UAAU,MAAM,KAAK,KAAK,cAAc,KAAK,WACnD,QACA,cAAc,OAAO,QACrB,OACA,MACAG,YAEF,QACA;CAEH;AACD,SAAQ,YAAYD;CACpB,MAAME,WAAS;EACb;EACA;EACD;CACD,IAAIC,aAAWD;AACf,SAAQ,UAAUC;;;;;;AClGlB,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,OAAO,QAAQ,YAAY,QAAQ,UAAU,KAAK;CAC1D,IAAIC;;;;;;;CASJ,MAAM,uBAAuB;CAC7B,MAAM,mBAAmB;CACzB,MAAM,oBAAoB;CAC1B,MAAM,kBAAkB;CACxB,MAAM,sBAAsB;CAC5B,MAAM,qBAAqB;CAC3B,MAAM,kBAAkB;CACxB,MAAM,kBAAkB;CACxB,MAAM,oBAAoB;CAC1B,MAAM,oBAAmB,SAAQ,aAAa;CAC9C,MAAM,eAAc,SAAQ,IAAI,KAAK;CACrC,MAAM,QAAQ;CACd,MAAM,OAAO;CAEb,MAAM,yBACJ,KACA,QACA,aACA,OACA,MACA,WACA,SAEA,EAAE,QAAQ,OAAO,WACb,YAAY,iBAAiB,SAC7B,GAAG,iBAAiB,QAAQ,MAAM,IAAI,GACtCA,eAAa,sBACX,IAAI,WACJ,QACA,aACA,OACA,MACAC,WACA;CAIR,SAAS,iBAAiB,KAAK;EAC7B,IAAI,IAAI;AACR,SAAO,EACL,OAAO;AACL,OAAI,IAAI,IAAI,MAAM,QAAQ;IACxB,MAAM,MAAM,IAAI,MAAM;AACtB,WAAO;KACL,MAAM;KACN,OAAO,CAAC,KAAK,IAAI,IAAI,KAAK;KAC3B;GACF;AACD,UAAO;IACL,MAAM;IACN,OAAO;IACR;EACF,GACF;CACF;CACD,MAAM,wBACJ,KACA,QACA,aACA,OACA,MACA,cACG;EAGH,MAAM,OAAO,iBAAiB,IAAI,SAAS;AAC3C,SAAO,EAAE,QAAQ,OAAO,WACpB,YAAY,QACZ,GAAG,OAAO,MAAM,IAAI,GAAGD,eAAa,sBAClC,iBAAiB,MACjB,QACA,aACA,OACA,MACAC,WACA;CACP;CACD,MAAM,qBAAqB,KAAK,QAAQ,aAAa,OAAO,MAAM,cAAY;EAC5E,MAAM,OAAO,iBAAiB;AAC9B,MAAI,EAAE,QAAQ,OAAO,SACnB,QAAO,YAAY;AAErB,MAAI,IAAI,mBACN,QAAO,GAAG,OAAO,MAAM,GAErB,IAAI,SAAS,IAAI,WACZ,GAAGD,eAAa,sBACf,IAAI,WACJ,QACA,aACA,OACA,MACAC,aAEF,KACL;AAEH,SAAO,GAAG,OAAO,MAAM,GACrB,IAAI,SAEJ,IAAI,UAEJ,IAAI,eAEJ,IAAI,aACC,GAAGD,eAAa,qBACf,IAAI,UACJ,QACA,aACA,OACA,MACAC,aAEF,KACL;CACF;CACD,MAAM,wBACJ,KACA,QACA,aACA,OACA,MACA,WACA,SAEA,EAAE,QAAQ,OAAO,WACb,YAAY,iBAAiB,SAC7B,GAAG,iBAAiB,QAAQ,MAAM,IAAI,GACtCD,eAAa,qBACX,IAAI,UACJ,QACA,aACA,OACA,MACAC,WACA;CACR,MAAMC,eAAa,KAAK,QAAQ,aAAa,OAAO,MAAM,cAAY;AACpE,MAAI,IAAI,iBACN,QAAO,sBACL,KACA,QACA,aACA,OACA,MACAD,WACA,IAAI,uBAAuB,eAAe;AAG9C,MAAI,IAAI,kBACN,QAAO,qBACL,KACA,QACA,aACA,OACA,MACAA,WACA;AAGJ,MAAI,IAAI,iBACN,QAAO,qBACL,KACA,QACA,aACA,OACA,MACAA,WACA,IAAI,uBAAuB,eAAe;AAG9C,MAAI,IAAI,mBACN,QAAO,qBACL,KACA,QACA,aACA,OACA,MACAA,WACA;AAGJ,MAAI,IAAI,iBACN,QAAO,kBAAkB,KAAK,QAAQ,aAAa,OAAO,MAAMA;AAIlE,SAAO,qBAAqB,KAAK,QAAQ,aAAa,OAAO,MAAMA;CACpE;AAID,SAAQ,YAAYC;CACpB,MAAMC,UAAO,QACX,QACC,IAAI,0BAA0B,QAAQ,IAAI,wBAAwB;AACrE,SAAQ,OAAOA;CACf,MAAMC,WAAS;EACb;EACA;EACD;CACD,IAAIC,aAAWD;AACf,SAAQ,UAAUC;;;;;;CC/ML,IAAI,IAAE,OAAO,IAAI,kBAAiB,IAAE,OAAO,IAAI,iBAAgB,IAAE,OAAO,IAAI,mBAAkB,IAAE,OAAO,IAAI,sBAAqB,IAAE,OAAO,IAAI,mBAAkB,IAAE,OAAO,IAAI,mBAAkB,IAAE,OAAO,IAAI,kBAAiB,IAAE,OAAO,IAAI,yBAAwB,IAAE,OAAO,IAAI,sBAAqB,IAAE,OAAO,IAAI,mBAAkB,IAAE,OAAO,IAAI,wBAAuB,IAAE,OAAO,IAAI,eAAc,IAAE,OAAO,IAAI,eAAc,IAAE,OAAO,IAAI,oBAAmB;AAAE,KAAE,OAAO,IAAI;CACxd,SAAS,EAAE,GAAE;AAAC,MAAG,aAAW,OAAO,KAAG,SAAO,GAAE;GAAC,IAAI,IAAE,EAAE;AAAS,WAAO,GAAP;IAAU,KAAK,EAAE,SAAO,IAAE,EAAE,MAAK,GAAhB;KAAmB,KAAK;KAAE,KAAK;KAAE,KAAK;KAAE,KAAK;KAAE,KAAK,EAAE,QAAO;KAAE,QAAQ,SAAO,IAAE,KAAG,EAAE,UAAS,GAAvB;MAA0B,KAAK;MAAE,KAAK;MAAE,KAAK;MAAE,KAAK;MAAE,KAAK;MAAE,KAAK,EAAE,QAAO;MAAE,QAAQ,QAAO;KAAE;IAAC;SAAK,EAAE,QAAO;GAAE;EAAC;CAAC;SAAQ,kBAAgB;AAAE,SAAQ,kBAAgB;AAAE,SAAQ,UAAQ;AAAE,SAAQ,aAAW;AAAE,SAAQ,WAAS;AAAE,SAAQ,OAAK;AAAE,SAAQ,OAAK;AAAE,SAAQ,SAAO;AAAE,SAAQ,WAAS;AAAE,SAAQ,aAAW;AAAE,SAAQ,WAAS;AAChe,SAAQ,eAAa;AAAE,SAAQ,cAAY,WAAU;AAAC,SAAM,CAAC;CAAE;AAAC,SAAQ,mBAAiB,WAAU;AAAC,SAAM,CAAC;CAAE;AAAC,SAAQ,oBAAkB,SAAS,GAAE;AAAC,SAAO,EAAE,OAAK;CAAE;AAAC,SAAQ,oBAAkB,SAAS,GAAE;AAAC,SAAO,EAAE,OAAK;CAAE;AAAC,SAAQ,YAAU,SAAS,GAAE;AAAC,SAAM,aAAW,OAAO,KAAG,SAAO,KAAG,EAAE,aAAW;CAAE;AAAC,SAAQ,eAAa,SAAS,GAAE;AAAC,SAAO,EAAE,OAAK;CAAE;AAAC,SAAQ,aAAW,SAAS,GAAE;AAAC,SAAO,EAAE,OAAK;CAAE;AAAC,SAAQ,SAAO,SAAS,GAAE;AAAC,SAAO,EAAE,OAAK;CAAE;AAAC,SAAQ,SAAO,SAAS,GAAE;AAAC,SAAO,EAAE,OAAK;CAAE;AACxe,SAAQ,WAAS,SAAS,GAAE;AAAC,SAAO,EAAE,OAAK;CAAE;AAAC,SAAQ,aAAW,SAAS,GAAE;AAAC,SAAO,EAAE,OAAK;CAAE;AAAC,SAAQ,eAAa,SAAS,GAAE;AAAC,SAAO,EAAE,OAAK;CAAE;AAAC,SAAQ,aAAW,SAAS,GAAE;AAAC,SAAO,EAAE,OAAK;CAAE;AAAC,SAAQ,iBAAe,SAAS,GAAE;AAAC,SAAO,EAAE,OAAK;CAAE;AACnP,SAAQ,qBAAmB,SAAS,GAAE;AAAC,SAAM,aAAW,OAAO,KAAG,eAAa,OAAO,KAAG,MAAI,KAAG,MAAI,KAAG,MAAI,KAAG,MAAI,KAAG,MAAI,KAAG,MAAI,KAAG,aAAW,OAAO,KAAG,SAAO,MAAI,EAAE,aAAW,KAAG,EAAE,aAAW,KAAG,EAAE,aAAW,KAAG,EAAE,aAAW,KAAG,EAAE,aAAW,KAAG,EAAE,aAAW,KAAG,KAAK,MAAI,EAAE,eAAa,CAAC,IAAE,CAAC;CAAE;AAAC,SAAQ,SAAO;;;;;;ACDjT,KAAI,QAAQ,IAAI,aAAa,aAC3B,EAAC,WAAW;EAOd,IAAI,qBAAqB,OAAO,IAAI;EACpC,IAAI,oBAAoB,OAAO,IAAI;EACnC,IAAI,sBAAsB,OAAO,IAAI;EACrC,IAAI,yBAAyB,OAAO,IAAI;EACxC,IAAI,sBAAsB,OAAO,IAAI;EACrC,IAAI,sBAAsB,OAAO,IAAI;EACrC,IAAI,qBAAqB,OAAO,IAAI;EACpC,IAAI,4BAA4B,OAAO,IAAI;EAC3C,IAAI,yBAAyB,OAAO,IAAI;EACxC,IAAI,sBAAsB,OAAO,IAAI;EACrC,IAAI,2BAA2B,OAAO,IAAI;EAC1C,IAAI,kBAAkB,OAAO,IAAI;EACjC,IAAI,kBAAkB,OAAO,IAAI;EACjC,IAAI,uBAAuB,OAAO,IAAI;EAItC,IAAI,iBAAiB;EACrB,IAAI,qBAAqB;EACzB,IAAI,0BAA0B;EAE9B,IAAI,qBAAqB;EAIzB,IAAI,qBAAqB;EAEzB,IAAI;AAGF,2BAAyB,OAAO,IAAI;EAGtC,SAAS,mBAAmB,MAAM;AAChC,OAAI,OAAO,SAAS,YAAY,OAAO,SAAS,WAC9C,QAAO;AAIT,OAAI,SAAS,uBAAuB,SAAS,uBAAuB,sBAAuB,SAAS,0BAA0B,SAAS,uBAAuB,SAAS,4BAA4B,sBAAuB,SAAS,wBAAwB,kBAAmB,sBAAuB,wBACnS,QAAO;AAGT,OAAI,OAAO,SAAS,YAAY,SAAS,MACvC;QAAI,KAAK,aAAa,mBAAmB,KAAK,aAAa,mBAAmB,KAAK,aAAa,uBAAuB,KAAK,aAAa,sBAAsB,KAAK,aAAa,0BAIjL,KAAK,aAAa,0BAA0B,KAAK,gBAAgB,OAC/D,QAAO;GACR;AAGH,UAAO;EACR;EAED,SAAS,OAAO,QAAQ;AACtB,OAAI,OAAO,WAAW,YAAY,WAAW,MAAM;IACjD,IAAI,WAAW,OAAO;AAEtB,YAAQ,UAAR;KACE,KAAK;MACH,IAAI,OAAO,OAAO;AAElB,cAAQ,MAAR;OACE,KAAK;OACL,KAAK;OACL,KAAK;OACL,KAAK;OACL,KAAK,yBACH,QAAO;OAET;QACE,IAAI,eAAe,QAAQ,KAAK;AAEhC,gBAAQ,cAAR;SACE,KAAK;SACL,KAAK;SACL,KAAK;SACL,KAAK;SACL,KAAK;SACL,KAAK,oBACH,QAAO;SAET,QACE,QAAO;QACV;MAEJ;KAEH,KAAK,kBACH,QAAO;IACV;GACF;AAED,UAAO;EACR;EACD,IAAI,kBAAkB;EACtB,IAAI,kBAAkB;EACtB,IAAI,UAAU;EACd,IAAI,aAAa;EACjB,IAAI,WAAW;EACf,IAAI,OAAO;EACX,IAAI,OAAO;EACX,IAAI,SAAS;EACb,IAAI,WAAW;EACf,IAAI,aAAa;EACjB,IAAI,WAAW;EACf,IAAI,eAAe;EACnB,IAAI,sCAAsC;EAC1C,IAAI,2CAA2C;EAE/C,SAAS,YAAY,QAAQ;AAEzB,OAAI,CAAC,qCAAqC;AACxC,0CAAsC;AAEtC,YAAQ,QAAQ;GACjB;AAGH,UAAO;EACR;EACD,SAAS,iBAAiB,QAAQ;AAE9B,OAAI,CAAC,0CAA0C;AAC7C,+CAA2C;AAE3C,YAAQ,QAAQ;GACjB;AAGH,UAAO;EACR;EACD,SAAS,kBAAkB,QAAQ;AACjC,UAAO,OAAO,YAAY;EAC3B;EACD,SAAS,kBAAkB,QAAQ;AACjC,UAAO,OAAO,YAAY;EAC3B;EACD,SAAS,UAAU,QAAQ;AACzB,UAAO,OAAO,WAAW,YAAY,WAAW,QAAQ,OAAO,aAAa;EAC7E;EACD,SAAS,aAAa,QAAQ;AAC5B,UAAO,OAAO,YAAY;EAC3B;EACD,SAAS,WAAW,QAAQ;AAC1B,UAAO,OAAO,YAAY;EAC3B;EACD,SAAS,OAAO,QAAQ;AACtB,UAAO,OAAO,YAAY;EAC3B;EACD,SAAS,OAAO,QAAQ;AACtB,UAAO,OAAO,YAAY;EAC3B;EACD,SAAS,SAAS,QAAQ;AACxB,UAAO,OAAO,YAAY;EAC3B;EACD,SAAS,WAAW,QAAQ;AAC1B,UAAO,OAAO,YAAY;EAC3B;EACD,SAAS,aAAa,QAAQ;AAC5B,UAAO,OAAO,YAAY;EAC3B;EACD,SAAS,WAAW,QAAQ;AAC1B,UAAO,OAAO,YAAY;EAC3B;EACD,SAAS,eAAe,QAAQ;AAC9B,UAAO,OAAO,YAAY;EAC3B;AAED,UAAQ,kBAAkB;AAC1B,UAAQ,kBAAkB;AAC1B,UAAQ,UAAU;AAClB,UAAQ,aAAa;AACrB,UAAQ,WAAW;AACnB,UAAQ,OAAO;AACf,UAAQ,OAAO;AACf,UAAQ,SAAS;AACjB,UAAQ,WAAW;AACnB,UAAQ,aAAa;AACrB,UAAQ,WAAW;AACnB,UAAQ,eAAe;AACvB,UAAQ,cAAc;AACtB,UAAQ,mBAAmB;AAC3B,UAAQ,oBAAoB;AAC5B,UAAQ,oBAAoB;AAC5B,UAAQ,YAAY;AACpB,UAAQ,eAAe;AACvB,UAAQ,aAAa;AACrB,UAAQ,SAAS;AACjB,UAAQ,SAAS;AACjB,UAAQ,WAAW;AACnB,UAAQ,aAAa;AACrB,UAAQ,eAAe;AACvB,UAAQ,aAAa;AACrB,UAAQ,iBAAiB;AACzB,UAAQ,qBAAqB;AAC7B,UAAQ,SAAS;CACd;;;;;;ACzNH,KAAI,QAAQ,IAAI,aAAa,aAC3B,QAAO;KAEP,QAAO;;;;;;ACHT,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,OAAO,QAAQ,YAAY,QAAQ,UAAU,KAAK;CAC1D,IAAI,UAAU;CACd,IAAIC;CACJ,SAAS,yBAAyB,aAAa;AAC7C,MAAI,OAAO,YAAY,WAAY,QAAO;EAC1C,IAAI,oCAAoB,IAAI;EAC5B,IAAI,mCAAmB,IAAI;AAC3B,UAAQ,2BAA2B,SAAU,eAAa;AACxD,UAAOC,gBAAc,mBAAmB;EACzC,GAAE;CACJ;CACD,SAAS,wBAAwB,KAAK,aAAa;AACjD,MAAI,CAAC,eAAe,OAAO,IAAI,WAC7B,QAAO;AAET,MAAI,QAAQ,QAAS,OAAO,QAAQ,YAAY,OAAO,QAAQ,WAC7D,QAAO,EAAC,SAAS,KAAI;EAEvB,IAAI,QAAQ,yBAAyB;AACrC,MAAI,SAAS,MAAM,IAAI,KACrB,QAAO,MAAM,IAAI;EAEnB,IAAI,SAAS,EAAE;EACf,IAAI,wBACF,OAAO,kBAAkB,OAAO;AAClC,OAAK,IAAI,OAAO,IACd,KAAI,QAAQ,aAAa,OAAO,UAAU,eAAe,KAAK,KAAK,MAAM;GACvE,IAAI,OAAO,wBACP,OAAO,yBAAyB,KAAK,OACrC;AACJ,OAAI,SAAS,KAAK,OAAO,KAAK,KAC5B,QAAO,eAAe,QAAQ,KAAK;OAEnC,QAAO,OAAO,IAAI;EAErB;AAEH,SAAO,UAAU;AACjB,MAAI,MACF,OAAM,IAAI,KAAK;AAEjB,SAAO;CACR;;;;;;;CAUD,MAAM,eAAe,KAAK,WAAW,EAAE,KAAK;AAC1C,MAAI,MAAM,QAAQ,KAChB,KAAI,SAAQ,SAAQ;AAClB,eAAY,MAAM;EACnB;WACQ,OAAO,QAAQ,QAAQ,MAChC,UAAS,KAAK;AAEhB,SAAO;CACR;CACD,MAAM,WAAU,YAAW;EACzB,MAAM,OAAO,QAAQ;AACrB,MAAI,OAAO,SAAS,SAClB,QAAO;AAET,MAAI,OAAO,SAAS,WAClB,QAAO,KAAK,eAAe,KAAK,QAAQ;AAE1C,MAAI,QAAQ,WAAW,SACrB,QAAO;AAET,MAAI,QAAQ,WAAW,SACrB,QAAO;AAET,MAAI,OAAO,SAAS,YAAY,SAAS,MAAM;AAC7C,OAAI,QAAQ,kBAAkB,SAC5B,QAAO;AAET,OAAI,QAAQ,kBAAkB,SAC5B,QAAO;AAET,OAAI,QAAQ,aAAa,UAAU;AACjC,QAAI,KAAK,YACP,QAAO,KAAK;IAEd,MAAM,eAAe,KAAK,OAAO,eAAe,KAAK,OAAO,QAAQ;AACpE,WAAO,iBAAiB,KAAK,cAAc,aAAa,KAAK;GAC9D;AACD,OAAI,QAAQ,OAAO,UAAU;IAC3B,MAAM,eACJ,KAAK,eAAe,KAAK,KAAK,eAAe,KAAK,KAAK,QAAQ;AACjE,WAAO,iBAAiB,KAAK,QAAQ,aAAa,KAAK;GACxD;EACF;AACD,SAAO;CACR;CACD,MAAMC,iBAAc,YAAW;EAC7B,MAAM,EAAC,OAAM,GAAG;AAChB,SAAO,OAAO,KAAK,OAChB,QAAO,QAAO,QAAQ,cAAc,MAAM,SAAS,QACnD;CACJ;CACD,MAAMC,eAAa,SAAS,QAAQ,aAAa,OAAO,MAAM,cAC5D,EAAE,QAAQ,OAAO,YACZ,GAAGH,UAAQ,oBAAoB,QAAQ,UAAU,WACjD,GAAGA,UAAQ,cACV,QAAQ,WACP,GAAGA,UAAQ,YACVE,cAAY,UACZ,QAAQ,OACR,QACA,cAAc,OAAO,QACrB,OACA,MACAE,aAED,GAAGJ,UAAQ,eACV,YAAY,QAAQ,MAAM,WAC1B,QACA,cAAc,OAAO,QACrB,OACA,MACAI,YAEF,QACA;AAER,SAAQ,YAAYD;CACpB,MAAME,UAAO,QAAO,OAAO,QAAQ,QAAQ,UAAU;AACrD,SAAQ,OAAOA;CACf,MAAMC,WAAS;EACb;EACA;EACD;CACD,IAAIC,aAAWD;AACf,SAAQ,UAAUC;;;;;;AC5IlB,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,OAAO,QAAQ,YAAY,QAAQ,UAAU,KAAK;CAC1D,IAAI;CACJ,IAAIC,WAAS,WAAW,+BAA+B,WAAW;;;;;;;CASlE,MAAM,aACJ,OAAOA,aAAW,cAAcA,SAAO,MACnCA,SAAO,IAAI,qBACX;CACN,MAAM,eAAc,WAAU;EAC5B,MAAM,EAAC,OAAM,GAAG;AAChB,SAAO,QACH,OAAO,KAAK,OACT,QAAO,QAAO,MAAM,SAAS,QAC7B,SACH,EAAE;CACP;CACD,MAAM,aAAa,QAAQ,QAAQ,aAAa,OAAO,MAAM,cAC3D,EAAE,QAAQ,OAAO,YACZ,GAAG,QAAQ,oBAAoB,OAAO,MAAM,WAC5C,GAAG,QAAQ,cACV,OAAO,MACP,OAAO,SACF,GAAG,QAAQ,YACV,YAAY,SACZ,OAAO,OACP,QACA,cAAc,OAAO,QACrB,OACA,MACAC,aAEF,IACJ,OAAO,YACF,GAAG,QAAQ,eACV,OAAO,UACP,QACA,cAAc,OAAO,QACrB,OACA,MACAA,aAEF,IACJ,QACA;AAER,SAAQ,YAAY;CACpB,MAAM,QAAO,QAAO,OAAO,IAAI,aAAa;AAC5C,SAAQ,OAAO;CACf,MAAM,SAAS;EACb;EACA;EACD;CACD,IAAIC,aAAW;AACf,SAAQ,UAAUA;;;;;;AC/DlB,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,UAAU,QAAQ,kBAAkB,KAAK;AACjD,SAAQ,SAAS;AACjB,SAAQ,UAAU,KAAK;CACvB,IAAI,cAAcC;CAClB,IAAI;CACJ,IAAI,qBAAqBA;CAGzB,IAAI,iBAAiBA;CACrB,IAAI,cAAcA;CAClB,IAAI,aAAaA;CACjB,IAAI,gBAAgBA;CACpB,IAAI,sBAAsBA;CAG1B,SAASA,yBAAuB,KAAK;AACnC,SAAO,OAAO,IAAI,aAAa,MAAM,EAAC,SAAS,KAAI;CACpD;;;;;;;CAUD,MAAM,WAAW,OAAO,UAAU;CAClC,MAAM,cAAc,KAAK,UAAU;CACnC,MAAM,gBAAgB,MAAM,UAAU;CACtC,MAAM,iBAAiB,OAAO,UAAU;;;;;CAMxC,MAAM,sBAAqB,QACxB,OAAO,IAAI,gBAAgB,cAAc,IAAI,YAAY,QAAS;;CAIrE,MAAM,YAAW,QAAO,OAAO,WAAW,eAAe,QAAQ;CACjE,MAAM,gBAAgB;CACtB,MAAM,iBAAiB;CACvB,IAAM,0BAAN,cAAsC,MAAM;EAC1C,YAAY,SAAS,OAAO;AAC1B,SAAM;AACN,QAAK,QAAQ;AACb,QAAK,OAAO,KAAK,YAAY;EAC9B;CACF;CACD,SAAS,sBAAsB,YAAY;AACzC,SACE,eAAe,oBACf,eAAe,0BACf,eAAe,uBACf,eAAe,2BACf,eAAe,2BACf,eAAe,wBACf,eAAe,yBACf,eAAe,yBACf,eAAe,yBACf,eAAe,gCACf,eAAe,0BACf,eAAe;CAElB;CACD,SAAS,YAAY,KAAK;AACxB,SAAO,OAAO,GAAG,KAAK,MAAM,OAAO,OAAO;CAC3C;CACD,SAAS,YAAY,KAAK;AACxB,SAAO,OAAO,GAAG,IAAI;CACtB;CACD,SAAS,cAAc,KAAK,mBAAmB;AAC7C,MAAI,CAAC,kBACH,QAAO;AAET,SAAO,aAAa,IAAI,QAAQ,YAAY;CAC7C;CACD,SAAS,YAAY,KAAK;AACxB,SAAO,OAAO,KAAK,QAAQ,eAAe;CAC3C;CACD,SAAS,WAAW,KAAK;AACvB,SAAO,IAAI,cAAc,KAAK,KAAK;CACpC;;;;;CAMD,SAAS,gBAAgB,KAAK,mBAAmB,aAAa,cAAc;AAC1E,MAAI,QAAQ,QAAQ,QAAQ,MAC1B,QAAO,GAAG;AAEZ,MAAI,QAAQ,OACV,QAAO;AAET,MAAI,QAAQ,KACV,QAAO;EAET,MAAM,SAAS,OAAO;AACtB,MAAI,WAAW,SACb,QAAO,YAAY;AAErB,MAAI,WAAW,SACb,QAAO,YAAY;AAErB,MAAI,WAAW,UAAU;AACvB,OAAI,aACF,QAAO,IAAI,IAAI,QAAQ,SAAS,QAAQ;AAE1C,UAAO,IAAI,IAAI;EAChB;AACD,MAAI,WAAW,WACb,QAAO,cAAc,KAAK;AAE5B,MAAI,WAAW,SACb,QAAO,YAAY;EAErB,MAAM,aAAa,SAAS,KAAK;AACjC,MAAI,eAAe,mBACjB,QAAO;AAET,MAAI,eAAe,mBACjB,QAAO;AAET,MACE,eAAe,uBACf,eAAe,6BAEf,QAAO,cAAc,KAAK;AAE5B,MAAI,eAAe,kBACjB,QAAO,YAAY;AAErB,MAAI,eAAe,gBACjB,QAAO,MAAM,CAAC,OAAO,iBAAiB,YAAY,KAAK;AAEzD,MAAI,eAAe,iBACjB,QAAO,WAAW;AAEpB,MAAI,eAAe,mBAAmB;AACpC,OAAI,YAEF,QAAO,eAAe,KAAK,KAAK,QAAQ,uBAAuB;AAEjE,UAAO,eAAe,KAAK;EAC5B;AACD,MAAI,eAAe,MACjB,QAAO,WAAW;AAEpB,SAAO;CACR;;;;;CAMD,SAAS,kBACP,KACA,QACA,aACA,OACA,MACA,iBACA;AACA,MAAI,KAAK,QAAQ,SAAS,GACxB,QAAO;AAET,SAAO,KAAK;AACZ,OAAK,KAAK;EACV,MAAM,cAAc,EAAE,QAAQ,OAAO;EACrC,MAAM,MAAM,OAAO;AACnB,MACE,OAAO,cACP,CAAC,eACD,IAAI,UACJ,OAAO,IAAI,WAAW,cACtB,CAAC,gBAED,QAAO,QAAQ,IAAI,UAAU,QAAQ,aAAa,OAAO,MAAM;EAEjE,MAAM,aAAa,SAAS,KAAK;AACjC,MAAI,eAAe,qBACjB,QAAO,cACH,gBACA,GAAG,MAAM,KAAK,aAAa,IAAI,GAAG,aAAa,gBAC7C,KACA,QACA,aACA,OACA,MACA,SACA;AAER,MAAI,sBAAsB,YACxB,QAAO,cACH,IAAI,IAAI,YAAY,KAAK,KACzB,GACE,MACI,KACA,CAAC,OAAO,uBAAuB,IAAI,YAAY,SAAS,UACxD,KACA,GAAG,IAAI,YAAY,KAAK,GAC7B,IAAI,GAAG,aAAa,gBACnB,KACA,QACA,aACA,OACA,MACA,SACA;AAER,MAAI,eAAe,eACjB,QAAO,cACH,UACA,SAAS,GAAG,aAAa,sBACvB,IAAI,WACJ,QACA,aACA,OACA,MACA,SACA,QACA;AAER,MAAI,eAAe,eACjB,QAAO,cACH,UACA,SAAS,GAAG,aAAa,qBACvB,IAAI,UACJ,QACA,aACA,OACA,MACA,SACA;AAKR,SAAO,eAAe,SAAS,OAC3B,IAAI,mBAAmB,KAAK,KAC5B,GACE,MACI,KACA,CAAC,OAAO,uBAAuB,mBAAmB,SAAS,WAC3D,KACA,GAAG,mBAAmB,KAAK,GAChC,IAAI,GAAG,aAAa,uBACnB,KACA,QACA,aACA,OACA,MACA,SACA;CACP;CACD,SAAS,YAAY,UAAQ;AAC3B,SAAOC,SAAO,aAAa;CAC5B;CACD,SAAS,YAAY,UAAQ,KAAK,QAAQ,aAAa,OAAO,MAAM;EAClE,IAAI;AACJ,MAAI;AACF,aAAU,YAAYA,YAClBA,SAAO,UAAU,KAAK,QAAQ,aAAa,OAAO,MAAM,WACxDA,SAAO,MACL,MACA,aAAY,QAAQ,UAAU,QAAQ,aAAa,OAAO,QAC1D,QAAO;IACL,MAAM,kBAAkB,cAAc,OAAO;AAC7C,WACE,kBACA,IAAI,QAAQ,gBAAgB,KAAK;GAEpC,GACD;IACE,aAAa,OAAO;IACpB,KAAK,OAAO;IACZ,SAAS,OAAO;IACjB,EACD,OAAO;EAEd,SAAQ,OAAO;AACd,SAAM,IAAI,wBAAwB,MAAM,SAAS,MAAM;EACxD;AACD,MAAI,OAAO,YAAY,SACrB,OAAM,IAAI,MACR,yEAAyE,OAAO,QAAQ;AAG5F,SAAO;CACR;CACD,SAAS,WAAW,WAAS,KAAK;AAChC,OAAK,IAAIC,MAAI,GAAGA,MAAIC,UAAQ,QAAQ,MAClC,KAAI;AACF,OAAIA,UAAQD,KAAG,KAAK,KAClB,QAAOC,UAAQD;EAElB,SAAQ,OAAO;AACd,SAAM,IAAI,wBAAwB,MAAM,SAAS,MAAM;EACxD;AAEH,SAAO;CACR;CACD,SAAS,QAAQ,KAAK,QAAQ,aAAa,OAAO,MAAM,iBAAiB;EACvE,MAAMD,WAAS,WAAW,OAAO,SAAS;AAC1C,MAAIA,aAAW,KACb,QAAO,YAAYA,UAAQ,KAAK,QAAQ,aAAa,OAAO;EAE9D,MAAM,cAAc,gBAClB,KACA,OAAO,mBACP,OAAO,aACP,OAAO;AAET,MAAI,gBAAgB,KAClB,QAAO;AAET,SAAO,kBACL,KACA,QACA,aACA,OACA,MACA;CAEH;CACD,MAAM,gBAAgB;EACpB,SAAS;EACT,SAAS;EACT,MAAM;EACN,KAAK;EACL,OAAO;EACR;CACD,MAAM,qBAAqB,OAAO,KAAK;CAGvC,MAAM,oBAAmB,YAAW;CACpC,MAAM,kBAAkB,iBAAiB;EACvC,YAAY;EACZ,aAAa;EACb,aAAa;EACb,cAAc;EACd,WAAW;EACX,QAAQ;EACR,UAAU;EACV,UAAU;EACV,KAAK;EACL,SAAS,EAAE;EACX,qBAAqB;EACrB,mBAAmB;EACnB,OAAO;EACR;AACD,SAAQ,kBAAkB;CAC1B,SAAS,gBAAgB,SAAS;AAChC,SAAO,KAAK,SAAS,SAAQ,QAAO;AAClC,OAAI,CAAC,OAAO,UAAU,eAAe,KAAK,iBAAiB,KACzD,OAAM,IAAI,MAAM,kCAAkC,IAAI;EAEzD;AACD,MAAI,QAAQ,OAAO,QAAQ,WAAW,UAAa,QAAQ,WAAW,EACpE,OAAM,IAAI,MACR;AAGJ,MAAI,QAAQ,UAAU,QAAW;AAC/B,OAAI,QAAQ,UAAU,KACpB,OAAM,IAAI,MAAM;AAElB,OAAI,OAAO,QAAQ,UAAU,SAC3B,OAAM,IAAI,MACR,gFAAgF,OAAO,QAAQ,MAAM;EAG1G;CACF;CACD,MAAM,sBAAqB,YACzB,mBAAmB,QAAQ,QAAQ,QAAQ;EACzC,MAAM,QACJ,QAAQ,SAAS,QAAQ,MAAM,SAAS,SACpC,QAAQ,MAAM,OACd,cAAc;EACpB,MAAM,QAAQ,SAAS,YAAY,QAAQ;AAC3C,MACE,SACA,OAAO,MAAM,UAAU,YACvB,OAAO,MAAM,SAAS,SAEtB,QAAO,OAAO;MAEd,OAAM,IAAI,MACR,4CAA4C,IAAI,iBAAiB,MAAM;AAG3E,SAAO;CACR,GAAE,OAAO,OAAO;CACnB,MAAM,uBACJ,mBAAmB,QAAQ,QAAQ,QAAQ;AACzC,SAAO,OAAO;GACZ,OAAO;GACP,MAAM;GACP;AACD,SAAO;CACR,GAAE,OAAO,OAAO;CACnB,MAAM,wBAAuB,YAC3B,SAAS,qBAAqB,gBAAgB;CAChD,MAAM,kBAAiB,YACrB,SAAS,eAAe,gBAAgB;CAC1C,MAAM,mBAAkB,YACtB,SAAS,gBAAgB,gBAAgB;CAC3C,MAAM,aAAY,aAAY;EAC5B,YAAY,SAAS,cAAc,gBAAgB;EACnD,QAAQ,SAAS,YAAY,mBAAmB,WAAW;EAC3D,aACE,OAAO,SAAS,gBAAgB,cAAc,SAAS,gBAAgB,OACnE,QAAQ,cACR,gBAAgB;EACtB,aAAa,eAAe;EAC5B,cAAc,gBAAgB;EAC9B,QAAQ,SAAS,MACb,KACA,aAAa,SAAS,UAAU,gBAAgB;EACpD,UAAU,SAAS,YAAY,gBAAgB;EAC/C,UAAU,SAAS,YAAY,gBAAgB;EAC/C,KAAK,SAAS,OAAO,gBAAgB;EACrC,SAAS,SAAS,WAAW,gBAAgB;EAC7C,qBAAqB,SAAS,uBAAuB;EACrD,mBAAmB,qBAAqB;EACxC,cAAc,SAAS,MAAM,MAAM;EACnC,cAAc,SAAS,MAAM,KAAK;EACnC;CACD,SAAS,aAAa,QAAQ;AAC5B,SAAO,IAAI,MAAM,SAAS,GAAG,KAAK;CACnC;;;;;;CAOD,SAAS,OAAO,KAAK,SAAS;AAC5B,MAAI,SAAS;AACX,mBAAgB;AAChB,OAAI,QAAQ,SAAS;IACnB,MAAMA,WAAS,WAAW,QAAQ,SAAS;AAC3C,QAAIA,aAAW,KACb,QAAO,YAAYA,UAAQ,KAAK,UAAU,UAAU,IAAI,GAAG,EAAE;GAEhE;EACF;EACD,MAAM,cAAc,gBAClB,KACA,qBAAqB,UACrB,eAAe,UACf,gBAAgB;AAElB,MAAI,gBAAgB,KAClB,QAAO;AAET,SAAO,kBAAkB,KAAK,UAAU,UAAU,IAAI,GAAG,EAAE;CAC5D;CACD,MAAM,UAAU;EACd,mBAAmB,mBAAmB;EACtC,eAAe,eAAe;EAC9B,YAAY,YAAY;EACxB,WAAW,WAAW;EACtB,cAAc,cAAc;EAC5B,oBAAoB,oBAAoB;EACzC;AACD,SAAQ,UAAU;CAClB,IAAIG,aAAW;AACf,SAAQ,UAAUA;;;;;;AC3dlB,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,kBACN,QAAQ,OACR,QAAQ,cACR,QAAQ,aACR,QAAQ,cACN,KAAK;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAwCT,IAAI,cAAc;AAClB,SAAQ,cAAc;CACtB,IAAI,cAAc;AAClB,SAAQ,cAAc;CACtB,IAAI,aAAa;;;;;;;;AASjB,SAAQ,aAAa;CACrB,IAAM,OAAN,MAAW;EACT;EACA;EACA,YAAY,IAAI,MAAM;AACpB,QAAK,KAAK;AACV,QAAK,KAAK;EACX;CACF;;;;;;;;AASD,SAAQ,OAAO;CACf,IAAI,oBAAoB,SAAU,OAAO,OAAO;AAE9C,MAAI,CAAC,SAAS,CAAC,SAAS,MAAM,OAAO,MAAM,MAAM,OAAO,GACtD,QAAO;EAIT,IAAI,aAAa;EACjB,IAAI,aAAa,KAAK,IAAI,MAAM,QAAQ,MAAM;EAC9C,IAAI,aAAa;EACjB,IAAI,eAAe;AACnB,SAAO,aAAa,YAAY;AAC9B,OACE,MAAM,UAAU,cAAc,eAC9B,MAAM,UAAU,cAAc,aAC9B;AACA,iBAAa;AACb,mBAAe;GAChB,MACC,cAAa;AAEf,gBAAa,KAAK,OAAO,aAAa,cAAc,IAAI;EACzD;AACD,SAAO;CACR;;;;;;;CAQD,IAAI,oBAAoB,SAAU,OAAO,OAAO;AAE9C,MACE,CAAC,SACD,CAAC,SACD,MAAM,OAAO,MAAM,SAAS,MAAM,MAAM,OAAO,MAAM,SAAS,GAE9D,QAAO;EAIT,IAAI,aAAa;EACjB,IAAI,aAAa,KAAK,IAAI,MAAM,QAAQ,MAAM;EAC9C,IAAI,aAAa;EACjB,IAAI,aAAa;AACjB,SAAO,aAAa,YAAY;AAC9B,OACE,MAAM,UAAU,MAAM,SAAS,YAAY,MAAM,SAAS,eAC1D,MAAM,UAAU,MAAM,SAAS,YAAY,MAAM,SAAS,aAC1D;AACA,iBAAa;AACb,iBAAa;GACd,MACC,cAAa;AAEf,gBAAa,KAAK,OAAO,aAAa,cAAc,IAAI;EACzD;AACD,SAAO;CACR;;;;;;;;;CAUD,IAAI,sBAAsB,SAAU,OAAO,OAAO;EAEhD,IAAI,eAAe,MAAM;EACzB,IAAI,eAAe,MAAM;AAEzB,MAAI,gBAAgB,KAAK,gBAAgB,EACvC,QAAO;AAGT,MAAI,eAAe,aACjB,SAAQ,MAAM,UAAU,eAAe;WAC9B,eAAe,aACxB,SAAQ,MAAM,UAAU,GAAG;EAE7B,IAAI,cAAc,KAAK,IAAI,cAAc;AAEzC,MAAI,SAAS,MACX,QAAO;EAMT,IAAI,OAAO;EACX,IAAI,SAAS;AACb,SAAO,MAAM;GACX,IAAI,UAAU,MAAM,UAAU,cAAc;GAC5C,IAAI,QAAQ,MAAM,QAAQ;AAC1B,OAAI,SAAS,GACX,QAAO;AAET,aAAU;AACV,OACE,SAAS,KACT,MAAM,UAAU,cAAc,WAAW,MAAM,UAAU,GAAG,SAC5D;AACA,WAAO;AACP;GACD;EACF;CACF;;;;;CAMD,IAAI,uBAAuB,SAAU,OAAO;EAC1C,IAAI,UAAU;EACd,IAAI,aAAa,EAAE;EACnB,IAAI,mBAAmB;;EAEvB,IAAI,eAAe;EAEnB,IAAI,UAAU;EAEd,IAAI,qBAAqB;EACzB,IAAI,oBAAoB;EAExB,IAAI,qBAAqB;EACzB,IAAI,oBAAoB;AACxB,SAAO,UAAU,MAAM,QAAQ;AAC7B,OAAI,MAAM,SAAS,MAAM,YAAY;AAEnC,eAAW,sBAAsB;AACjC,yBAAqB;AACrB,wBAAoB;AACpB,yBAAqB;AACrB,wBAAoB;AACpB,mBAAe,MAAM,SAAS;GAC/B,OAAM;AAEL,QAAI,MAAM,SAAS,MAAM,YACvB,uBAAsB,MAAM,SAAS,GAAG;QAExC,sBAAqB,MAAM,SAAS,GAAG;AAIzC,QACE,gBACA,aAAa,UACX,KAAK,IAAI,oBAAoB,sBAC/B,aAAa,UAAU,KAAK,IAAI,oBAAoB,oBACpD;AAEA,WAAM,OACJ,WAAW,mBAAmB,IAC9B,GACA,IAAI,KAAK,aAAa;AAGxB,WAAM,WAAW,mBAAmB,KAAK,GAAG,KAAK;AAEjD;AAEA;AACA,eAAU,mBAAmB,IAAI,WAAW,mBAAmB,KAAK;AACpE,0BAAqB;AACrB,yBAAoB;AACpB,0BAAqB;AACrB,yBAAoB;AACpB,oBAAe;AACf,eAAU;IACX;GACF;AACD;EACD;AAGD,MAAI,QACF,mBAAkB;AAEpB,+BAA6B;AAQ7B,YAAU;AACV,SAAO,UAAU,MAAM,QAAQ;AAC7B,OACE,MAAM,UAAU,GAAG,MAAM,eACzB,MAAM,SAAS,MAAM,aACrB;IACA,IAAI,WAAW,MAAM,UAAU,GAAG;IAClC,IAAI,YAAY,MAAM,SAAS;IAC/B,IAAI,kBAAkB,oBAAoB,UAAU;IACpD,IAAI,kBAAkB,oBAAoB,WAAW;AACrD,QAAI,mBAAmB,iBACrB;SACE,mBAAmB,SAAS,SAAS,KACrC,mBAAmB,UAAU,SAAS,GACtC;AAEA,YAAM,OACJ,SACA,GACA,IAAI,KAAK,YAAY,UAAU,UAAU,GAAG;AAE9C,YAAM,UAAU,GAAG,KAAK,SAAS,UAC/B,GACA,SAAS,SAAS;AAEpB,YAAM,UAAU,GAAG,KAAK,UAAU,UAAU;AAC5C;KACD;eAGC,mBAAmB,SAAS,SAAS,KACrC,mBAAmB,UAAU,SAAS,GACtC;AAGA,WAAM,OACJ,SACA,GACA,IAAI,KAAK,YAAY,SAAS,UAAU,GAAG;AAE7C,WAAM,UAAU,GAAG,KAAK;AACxB,WAAM,UAAU,GAAG,KAAK,UAAU,UAChC,GACA,UAAU,SAAS;AAErB,WAAM,UAAU,GAAG,KAAK;AACxB,WAAM,UAAU,GAAG,KAAK,SAAS,UAAU;AAC3C;IACD;AAEH;GACD;AACD;EACD;CACF;;;;;;;AAQD,SAAQ,kBAAkB;CAC1B,IAAI,+BAA+B,SAAU,OAAO;;;;;;;;;;;EAWlD,SAAS,2BAA2B,KAAK,KAAK;AAC5C,OAAI,CAAC,OAAO,CAAC,IAEX,QAAO;GAQT,IAAI,QAAQ,IAAI,OAAO,IAAI,SAAS;GACpC,IAAI,QAAQ,IAAI,OAAO;GACvB,IAAI,mBAAmB,MAAM,MAAM;GACnC,IAAI,mBAAmB,MAAM,MAAM;GACnC,IAAI,cAAc,oBAAoB,MAAM,MAAM;GAClD,IAAI,cAAc,oBAAoB,MAAM,MAAM;GAClD,IAAI,aAAa,eAAe,MAAM,MAAM;GAC5C,IAAI,aAAa,eAAe,MAAM,MAAM;GAC5C,IAAI,aAAa,cAAc,IAAI,MAAM;GACzC,IAAI,aAAa,cAAc,IAAI,MAAM;AACzC,OAAI,cAAc,WAEhB,QAAO;YACE,cAAc,WAEvB,QAAO;YACE,oBAAoB,CAAC,eAAe,YAE7C,QAAO;YACE,eAAe,YAExB,QAAO;YACE,oBAAoB,iBAE7B,QAAO;AAET,UAAO;EACR;EACD,IAAI,UAAU;AAEd,SAAO,UAAU,MAAM,SAAS,GAAG;AACjC,OACE,MAAM,UAAU,GAAG,MAAM,cACzB,MAAM,UAAU,GAAG,MAAM,YACzB;IAEA,IAAI,YAAY,MAAM,UAAU,GAAG;IACnC,IAAI,OAAO,MAAM,SAAS;IAC1B,IAAI,YAAY,MAAM,UAAU,GAAG;IAGnC,IAAI,eAAe,kBAAkB,WAAW;AAChD,QAAI,cAAc;KAChB,IAAI,eAAe,KAAK,UAAU,KAAK,SAAS;AAChD,iBAAY,UAAU,UAAU,GAAG,UAAU,SAAS;AACtD,YAAO,eAAe,KAAK,UAAU,GAAG,KAAK,SAAS;AACtD,iBAAY,eAAe;IAC5B;IAGD,IAAI,gBAAgB;IACpB,IAAI,WAAW;IACf,IAAI,gBAAgB;IACpB,IAAI,YACF,2BAA2B,WAAW,QACtC,2BAA2B,MAAM;AACnC,WAAO,KAAK,OAAO,OAAO,UAAU,OAAO,IAAI;AAC7C,kBAAa,KAAK,OAAO;AACzB,YAAO,KAAK,UAAU,KAAK,UAAU,OAAO;AAC5C,iBAAY,UAAU,UAAU;KAChC,IAAI,QACF,2BAA2B,WAAW,QACtC,2BAA2B,MAAM;AAEnC,SAAI,SAAS,WAAW;AACtB,kBAAY;AACZ,sBAAgB;AAChB,iBAAW;AACX,sBAAgB;KACjB;IACF;AACD,QAAI,MAAM,UAAU,GAAG,MAAM,eAAe;AAE1C,SAAI,cACF,OAAM,UAAU,GAAG,KAAK;UACnB;AACL,YAAM,OAAO,UAAU,GAAG;AAC1B;KACD;AACD,WAAM,SAAS,KAAK;AACpB,SAAI,cACF,OAAM,UAAU,GAAG,KAAK;UACnB;AACL,YAAM,OAAO,UAAU,GAAG;AAC1B;KACD;IACF;GACF;AACD;EACD;CACF;CAGD,IAAI,wBAAwB;CAC5B,IAAI,mBAAmB;CACvB,IAAI,kBAAkB;CACtB,IAAI,qBAAqB;CACzB,IAAI,uBAAuB;;;;;;CAO3B,IAAI,oBAAoB,SAAU,OAAO;AAEvC,QAAM,KAAK,IAAI,KAAK,YAAY;EAChC,IAAI,UAAU;EACd,IAAI,eAAe;EACnB,IAAI,eAAe;EACnB,IAAI,cAAc;EAClB,IAAI,cAAc;EAClB,IAAI;AACJ,SAAO,UAAU,MAAM,OACrB,SAAQ,MAAM,SAAS,IAAvB;GACE,KAAK;AACH;AACA,mBAAe,MAAM,SAAS;AAC9B;AACA;GACF,KAAK;AACH;AACA,mBAAe,MAAM,SAAS;AAC9B;AACA;GACF,KAAK;AAEH,QAAI,eAAe,eAAe,GAAG;AACnC,SAAI,iBAAiB,KAAK,iBAAiB,GAAG;AAE5C,qBAAe,kBAAkB,aAAa;AAC9C,UAAI,iBAAiB,GAAG;AACtB,WACE,UAAU,eAAe,eAAe,KACxC,MAAM,UAAU,eAAe,eAAe,GAAG,MAC/C,WAEF,OAAM,UAAU,eAAe,eAAe,GAAG,MAC/C,YAAY,UAAU,GAAG;YACtB;AACL,cAAM,OACJ,GACA,GACA,IAAI,KAAK,YAAY,YAAY,UAAU,GAAG;AAEhD;OACD;AACD,qBAAc,YAAY,UAAU;AACpC,qBAAc,YAAY,UAAU;MACrC;AAED,qBAAe,kBAAkB,aAAa;AAC9C,UAAI,iBAAiB,GAAG;AACtB,aAAM,SAAS,KACb,YAAY,UAAU,YAAY,SAAS,gBAC3C,MAAM,SAAS;AACjB,qBAAc,YAAY,UACxB,GACA,YAAY,SAAS;AAEvB,qBAAc,YAAY,UACxB,GACA,YAAY,SAAS;MAExB;KACF;AAED,gBAAW,eAAe;AAC1B,WAAM,OAAO,SAAS,eAAe;AACrC,SAAI,YAAY,QAAQ;AACtB,YAAM,OAAO,SAAS,GAAG,IAAI,KAAK,aAAa;AAC/C;KACD;AACD,SAAI,YAAY,QAAQ;AACtB,YAAM,OAAO,SAAS,GAAG,IAAI,KAAK,aAAa;AAC/C;KACD;AACD;IACD,WAAU,YAAY,KAAK,MAAM,UAAU,GAAG,MAAM,YAAY;AAE/D,WAAM,UAAU,GAAG,MAAM,MAAM,SAAS;AACxC,WAAM,OAAO,SAAS;IACvB,MACC;AAEF,mBAAe;AACf,mBAAe;AACf,kBAAc;AACd,kBAAc;AACd;EACH;AAEH,MAAI,MAAM,MAAM,SAAS,GAAG,OAAO,GACjC,OAAM;EAMR,IAAI,UAAU;AACd,YAAU;AAEV,SAAO,UAAU,MAAM,SAAS,GAAG;AACjC,OACE,MAAM,UAAU,GAAG,MAAM,cACzB,MAAM,UAAU,GAAG,MAAM,YAGzB;QACE,MAAM,SAAS,GAAG,UAChB,MAAM,SAAS,GAAG,SAAS,MAAM,UAAU,GAAG,GAAG,WAC9C,MAAM,UAAU,GAAG,IACxB;AAEA,WAAM,SAAS,KACb,MAAM,UAAU,GAAG,KACnB,MAAM,SAAS,GAAG,UAChB,GACA,MAAM,SAAS,GAAG,SAAS,MAAM,UAAU,GAAG,GAAG;AAErD,WAAM,UAAU,GAAG,KAAK,MAAM,UAAU,GAAG,KAAK,MAAM,UAAU,GAAG;AACnE,WAAM,OAAO,UAAU,GAAG;AAC1B,eAAU;IACX,WACC,MAAM,SAAS,GAAG,UAAU,GAAG,MAAM,UAAU,GAAG,GAAG,WACrD,MAAM,UAAU,GAAG,IACnB;AAEA,WAAM,UAAU,GAAG,MAAM,MAAM,UAAU,GAAG;AAC5C,WAAM,SAAS,KACb,MAAM,SAAS,GAAG,UAAU,MAAM,UAAU,GAAG,GAAG,UAClD,MAAM,UAAU,GAAG;AACrB,WAAM,OAAO,UAAU,GAAG;AAC1B,eAAU;IACX;;AAEH;EACD;AAED,MAAI,QACF,mBAAkB;CAErB;;;;;;ACplBD,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,kBAAkB,QAAQ,kBAAkB,KAAK;;;;;;;CAQzD,MAAM,kBAAkB;AACxB,SAAQ,kBAAkB;CAC1B,MAAM,kBACJ;AAEF,SAAQ,kBAAkB;;;;;;AChB1B,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,UAAU;;;;;;;;CAkElB,MAAM,MAAM;CACZ,MAAM,cAAc;CAIpB,MAAM,qBAAqB,QAAQ,MAAM,QAAQ,MAAM,aAAa;EAClE,IAAI,UAAU;AACd,SAAO,SAAS,QAAQ,SAAS,QAAQ,SAAS,QAAQ,SAAS;AACjE,aAAU;AACV,aAAU;AACV,cAAW;EACZ;AACD,SAAO;CACR;CAID,MAAM,qBAAqB,QAAQ,QAAQ,QAAQ,QAAQ,aAAa;EACtE,IAAI,UAAU;AACd,SAAO,UAAU,UAAU,UAAU,UAAU,SAAS,QAAQ,SAAS;AACvE,aAAU;AACV,aAAU;AACV,cAAW;EACZ;AACD,SAAO;CACR;CAID,MAAM,gBACJ,KACA,MACA,MACA,IACA,UACA,WACA,UACG;EAEH,IAAI,KAAK;EACT,IAAI,KAAK,CAACC;EACV,IAAI,SAAS,UAAU;EACvB,IAAI,cAAc;AAClB,YAAU,OAAO,kBACf,SAAS,GACT,MACA,KAAK,SAAS,KAAK,GACnB,MACA;EAIF,MAAM,KAAKA,MAAI,QAAQA,MAAI;AAG3B,OAAK,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;AAIjD,OAAI,OAAOA,OAAK,cAAc,UAAU,IACtC,UAAS,UAAU;QACd;AACL,aAAS,cAAc;AAEvB,QAAI,QAAQ,OAEV,QAAO,KAAK;GAEf;AAGD,iBAAc,UAAU;AACxB,aAAU,MACR,SACA,kBAAkB,SAAS,GAAG,MAAM,KAAK,SAAS,KAAK,GAAG,MAAM;EACnE;AACD,SAAO;CACR;CAID,MAAM,gBACJ,KACA,QACA,QACA,IACA,UACA,WACA,UACG;EAEH,IAAI,KAAK;EACT,IAAI,KAAKA;EACT,IAAI,SAAS,UAAU;EACvB,IAAI,cAAc;AAClB,YAAU,OAAO,kBACf,QACA,SAAS,GACT,QACA,KAAK,SAAS,KAAK,GACnB;EAIF,MAAM,KAAKA,MAAI,QAAQA,MAAI;AAG3B,OAAK,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;AAIjD,OAAI,OAAOA,OAAK,UAAU,MAAM,YAC9B,UAAS,UAAU;QACd;AACL,aAAS,cAAc;AAEvB,QAAI,SAAS,OAEX,QAAO,KAAK;GAEf;AAGD,iBAAc,UAAU;AACxB,aAAU,MACR,SACA,kBACE,QACA,SAAS,GACT,QACA,KAAK,SAAS,KAAK,GACnB;EAEL;AACD,SAAO;CACR;CAID,MAAM,4BACJ,KACA,QACA,MACA,QACA,MACA,UACA,WACA,OACA,WACA,OACA,aACG;EACH,MAAM,KAAK,SAAS;EACpB,MAAM,UAAU,OAAO;EACvB,MAAM,UAAU,OAAO;EACvB,MAAM,gBAAgB,UAAU;EAGhC,MAAM,eAAe,CAAC,iBAAiBA,MAAI;EAC3C,MAAM,eAAe,CAAC,iBAAiBA,MAAI;EAE3C,IAAI,cAAc;EAGlB,MAAM,KAAKA,MAAI,QAAQA,MAAI;AAG3B,OAAK,IAAI,KAAK,GAAG,KAAK,CAACA,KAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;GAKpD,MAAM,SAAS,OAAO,KAAM,OAAOA,OAAK,cAAc,UAAU;GAChE,MAAM,YAAY,SAAS,UAAU,MAAM;GAC3C,MAAM,SAAS,SACX,YACA,YAAY;GAGhB,MAAM,SAAS,KAAK,SAAS;GAC7B,MAAM,WAAW,kBACf,SAAS,GACT,MACA,SAAS,GACT,MACA;GAEF,MAAM,QAAQ,SAAS;AACvB,iBAAc,UAAU;AACxB,aAAU,MAAM;AAChB,OAAI,gBAAgB,MAAM,MAAM,cAAc;IAI5C,MAAM,MAAMA,MAAI,KAAK,KAAK,kBAAkB;AAI5C,QAAI,MAAM,SAAS,UAAU,MAAM,KAAK,OAAO;KAI7C,MAAM,YAAY,KAAK,aAAa,SAAS,KAAK,IAAI,KAAK;KAK3D,MAAM,WAAW,kBACf,QACA,WACA,QACA,WACA;KAEF,MAAM,kBAAkB,YAAY;KACpC,MAAM,kBAAkB,YAAY;KACpC,MAAM,gBAAgB,kBAAkB;KACxC,MAAM,gBAAgB,kBAAkB;AACxC,cAAS,mBAAmBA,MAAI;AAChC,SAAIA,MAAI,MAAM,gBAAgB,gBAAgB,SAAS,QAAQ;AAI7D,eAAS,gBAAgB;AACzB,eAAS,gBAAgB;KAC1B,OAAM;AACL,eAAS,gBAAgB;AACzB,eAAS,gBAAgB;KAC1B;AACD,cAAS,mBAAmB;AAC5B,SAAI,aAAa,GAAG;AAClB,eAAS,mBAAmB;AAC5B,eAAS,mBAAmB;KAC7B;AACD,cAAS,mBAAmB;AAC5B,SAAI,aAAa,GAAG;AAClB,eAAS,mBAAmB,SAAS;AACrC,eAAS,mBAAmB,SAAS;KACtC;KACD,MAAM,kBAAkB,QAAQ;KAChC,MAAM,kBAAkB,SAAS,WAAW;AAC5C,cAAS,mBAAmBA,MAAI;AAChC,SAAIA,MAAI,MAAM,OAAO,OAAO,kBAAkB,iBAAiB;AAI7D,eAAS,kBAAkB;AAC3B,eAAS,kBAAkB;KAC5B,OAAM;AACL,eAAS,kBAAkB;AAC3B,eAAS,kBAAkB;KAC5B;AACD,YAAO;IACR;GACF;EACF;AACD,SAAO;CACR;CAID,MAAM,4BACJ,KACA,QACA,MACA,QACA,MACA,UACA,WACA,OACA,WACA,OACA,aACG;EACH,MAAM,KAAK,OAAO;EAClB,MAAM,UAAU,OAAO;EACvB,MAAM,UAAU,OAAO;EACvB,MAAM,gBAAgB,UAAU;EAGhC,MAAM,eAAe,gBAAgBA;EACrC,MAAM,eAAe,gBAAgBA;EAErC,IAAI,cAAc;EAGlB,MAAM,KAAKA,MAAI,QAAQA,MAAI;AAG3B,OAAK,IAAI,KAAK,GAAG,KAAKA,KAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;GAKnD,MAAM,SAAS,OAAO,KAAM,OAAOA,OAAK,UAAU,MAAM;GACxD,MAAM,YAAY,SAAS,UAAU,MAAM;GAC3C,MAAM,SAAS,SACX,YACA,YAAY;GAGhB,MAAM,SAAS,KAAK,SAAS;GAC7B,MAAM,WAAW,kBACf,QACA,SAAS,GACT,QACA,SAAS,GACT;GAEF,MAAM,QAAQ,SAAS;AACvB,iBAAc,UAAU;AACxB,aAAU,MAAM;AAChB,OAAI,gBAAgB,MAAM,MAAM,cAAc;IAI5C,MAAM,MAAMA,OAAK,KAAK,kBAAkB;AAIxC,QAAI,MAAM,SAAS,QAAQ,KAAK,UAAU,KAAK;KAC7C,MAAM,QAAQ,SAAS;AACvB,cAAS,mBAAmBA;AAC5B,SAAIA,QAAM,QAAQ,QAAQ,SAAS,QAAQ;AAIzC,eAAS,gBAAgB;AACzB,eAAS,gBAAgB;KAC1B,OAAM;AACL,eAAS,gBAAgB;AACzB,eAAS,gBAAgB;KAC1B;AACD,cAAS,mBAAmB;AAC5B,SAAI,aAAa,GAAG;AAElB,eAAS,mBAAmB;AAC5B,eAAS,mBAAmB;KAC7B;AACD,cAAS,mBAAmBA,MAAI;AAChC,SAAIA,QAAM,GAAG;AAEX,eAAS,mBAAmB;AAC5B,eAAS,kBAAkB;AAC3B,eAAS,kBAAkB;KAC5B,OAAM;MAIL,MAAM,YAAY,KAAK,aAAa,SAAS,KAAK,IAAI,KAAK;MAK3D,MAAM,WAAW,kBACf,WACA,MACA,WACA,MACA;AAEF,eAAS,mBAAmB;AAC5B,UAAI,aAAa,GAAG;AAElB,gBAAS,mBAAmB;AAC5B,gBAAS,mBAAmB;MAC7B;MACD,MAAM,kBAAkB,YAAY;MACpC,MAAM,kBAAkB,YAAY;AAEpC,UAAIA,MAAI,MAAM,OAAO,OAAO,kBAAkB,iBAAiB;AAI7D,gBAAS,kBAAkB;AAC3B,gBAAS,kBAAkB;MAC5B,OAAM;AACL,gBAAS,kBAAkB;AAC3B,gBAAS,kBAAkB;MAC5B;KACF;AACD,YAAO;IACR;GACF;EACF;AACD,SAAO;CACR;CAOD,MAAM,UACJ,SACA,QACA,MACA,QACA,MACA,UACA,WACA,WACA,aACG;EACH,MAAM,KAAK,SAAS;EACpB,MAAM,KAAK,OAAO;EAClB,MAAM,UAAU,OAAO;EACvB,MAAM,UAAU,OAAO;EAQvB,MAAM,gBAAgB,UAAU;EAGhC,IAAI,QAAQ;EACZ,IAAI,QAAQ;AAGZ,YAAU,KAAK,SAAS;AACxB,YAAU,KAAK;AAEf,MAAI,gBAAgB,MAAM,GAAG;GAE3B,MAAM,QAAQ,WAAW,iBAAiB;GAC1C,MAAM,QAAQ,UAAU,WAAW;AACnC,QAAK,IAAIA,MAAI,GAAGA,OAAK,MAAM,OAAK,GAAG;AACjC,YAAQ,aAAaA,KAAG,MAAM,MAAM,IAAI,UAAU,WAAW;AAC7D,QAAIA,MAAI,KACN,SAAQ,aAAaA,KAAG,QAAQ,QAAQ,IAAI,UAAU,WAAW;aAIjE,yBACEA,KACA,QACA,MACA,QACA,MACA,UACA,WACA,OACA,WACA,OACA,UAGF;GAEH;EACF,OAAM;GAEL,MAAM,SAAS,WAAW,iBAAiB,KAAK;GAChD,MAAM,QAAQ,UAAU,UAAU,KAAK;GAOvC,IAAIA,MAAI;AACR,WAAQ,aAAaA,KAAG,MAAM,MAAM,IAAI,UAAU,WAAW;AAC7D,QAAK,OAAK,GAAGA,OAAK,MAAM,OAAK,GAAG;AAC9B,YAAQ,aACNA,MAAI,GACJ,QACA,QACA,IACA,UACA,WACA;AAEF,QAAIA,MAAI,KACN,SAAQ,aAAaA,KAAG,MAAM,MAAM,IAAI,UAAU,WAAW;aAI7D,yBACEA,KACA,QACA,MACA,QACA,MACA,UACA,WACA,OACA,WACA,OACA,UAGF;GAEH;EACF;;AAGD,QAAM,IAAI,MACR,GAAG,IAAI,sBAAsB,OAAO,QAAQ,KAAK,UAAU,OAAO,QAAQ;CAE7E;CASD,MAAM,oBACJ,SACA,QACA,MACA,QACA,MACA,YACA,WACA,WACA,WACA,aACG;AACH,MAAI,OAAO,SAAS,OAAO,QAAQ;AAGjC,gBAAa,CAAC;AACd,OAAI,cAAc,UAAU,WAAW,GAAG;IAExC,MAAM,EAAC,sCAAkB,sBAAS,GAAG,UAAU;AAC/C,cAAU,KAAK;KACb,mBAAmB,SAAS,SAAS,YAAY;AAC/C,yBAAiB,SAAS,SAAS;KACpC;KACD,WAAW,QAAQ,WAAWC,WAAS,QAAQ;KAChD;GACF;GACD,MAAM,SAAS;GACf,MAAM,OAAO;AACb,YAAS;AACT,UAAO;AACP,YAAS;AACT,UAAO;EACR;EACD,MAAM,EAAC,kBAAkB,UAAS,GAAG,UAAU,aAAa,IAAI;AAGhE,SACE,SACA,QACA,MACA,QACA,MACA,UACA,WACA,WACA;EAEF,MAAM,EACJ,kBACA,eACA,eACA,kBACA,kBACA,kBACA,kBACA,kBACA,kBACA,kBACA,iBACA,iBACD,GAAG;AAGJ,MAAI,SAAS,iBAAiB,SAAS,cAErC,kBACE,kBACA,QACA,eACA,QACA,eACA,YACA,WACA,WACA,WACA;AAKJ,MAAI,qBAAqB,EACvB,kBAAiB,kBAAkB,kBAAkB;AAEvD,MAAI,qBAAqB,EACvB,kBAAiB,kBAAkB,kBAAkB;AAIvD,MAAI,kBAAkB,QAAQ,kBAAkB,KAE9C,kBACE,kBACA,iBACA,MACA,iBACA,MACA,YACA,WACA,WACA,WACA;CAGL;CACD,MAAM,kBAAkB,MAAM,QAAQ;AACpC,MAAI,OAAO,QAAQ,SACjB,OAAM,IAAI,UAAU,GAAG,IAAI,IAAI,KAAK,UAAU,OAAO,IAAI;AAE3D,MAAI,CAAC,OAAO,cAAc,KACxB,OAAM,IAAI,WAAW,GAAG,IAAI,IAAI,KAAK,SAAS,IAAI;AAEpD,MAAI,MAAM,EACR,OAAM,IAAI,WAAW,GAAG,IAAI,IAAI,KAAK,SAAS,IAAI;CAErD;CACD,MAAM,oBAAoB,MAAM,QAAQ;EACtC,MAAM,OAAO,OAAO;AACpB,MAAI,SAAS,WACX,OAAM,IAAI,UAAU,GAAG,IAAI,IAAI,KAAK,UAAU,KAAK;CAEtD;CAMD,SAAS,aAAa,SAAS,SAAS,UAAU,kBAAkB;AAClE,iBAAe,WAAW;AAC1B,iBAAe,WAAW;AAC1B,mBAAiB,YAAY;AAC7B,mBAAiB,oBAAoB;EAGrC,MAAM,WAAW,kBAAkB,GAAG,SAAS,GAAG,SAAS;AAC3D,MAAI,aAAa,EACf,kBAAiB,UAAU,GAAG;AAKhC,MAAI,YAAY,YAAY,YAAY,UAAU;GAGhD,MAAM,SAAS;GACf,MAAM,SAAS;GAGf,MAAM,WAAW,kBACf,QACA,UAAU,GACV,QACA,UAAU,GACV;GAKF,MAAM,OAAO,UAAU;GACvB,MAAM,OAAO,UAAU;GAKvB,MAAM,YAAY,WAAW;AAC7B,OAAI,YAAY,aAAa,YAAY,WAAW;IAClD,MAAM,UAAU;IAChB,MAAM,aAAa;IACnB,MAAM,YAAY,CAChB;KACE;KACA;KACD,CACF;IAID,MAAM,YAAY,CAAC,YAAY;IAE/B,MAAM,YAAY,CAAC,YAAY;IAG/B,MAAM,WAAW;KACf,kBAAkB;KAClB,kBAAkB;KAClB,eAAe;KACf,iBAAiB;KACjB,kBAAkB;KAClB,kBAAkB;KAClB,eAAe;KACf,iBAAiB;KACjB,kBAAkB;KAClB,kBAAkB;KAClB,kBAAkB;KAClB,kBAAkB;KACnB;AAGD,qBACE,SACA,QACA,MACA,QACA,MACA,YACA,WACA,WACA,WACA;GAEH;AACD,OAAI,aAAa,EACf,kBAAiB,UAAU,MAAM;EAEpC;CACF;;;;;;AC3xBD,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,2BAA2B,QAAQ,yBAAyB,KAAK;CACzE,IAAIC;;;;;;;CAQJ,MAAM,wBAAwB,MAAM,2BAClC,KAAK,QAAQ,SAAQ,UAAS,uBAAuB;CACvD,MAAM,iBACJ,MACA,eACA,OACA,WACA,wBACA,oCAEA,KAAK,WAAW,IACZ,MACE,GAAG,UAAU,GAAG,qBAAqB,MAAM,6BAE7C,cAAc,MACd,MAAM,aACN,iBAAiB,gCAAgC,WAAW,IAC5D,MAAM,GAAG,UAAU,GAAG,qCACtB;CACN,MAAM,mBACJ,MACA,eACA,EACE,QACA,YACA,8BACA,iCACD,KAED,cACE,MACA,eACA,QACA,YACA,8BACA;CAEJ,MAAM,mBACJ,MACA,eACA,EACE,QACA,YACA,8BACA,iCACD,KAED,cACE,MACA,eACA,QACA,YACA,8BACA;CAEJ,MAAM,mBACJ,MACA,eACA,EACE,aACA,iBACA,8BACA,iCACD,KAED,cACE,MACA,eACA,aACA,iBACA,8BACA;CAIJ,MAAM,mBAAmB,QAAQ,MAAM,QAAQ,MAAM,EAAC,YAAW,KAC/D,WACE,OAAO,SAAS,EAAE,GAAG,OAAO,OAAO,IAAI,SAAS,EAAE,GAAG,OAAO,OAAO;CAOvE,MAAM,4BAA4B,OAAO,YAAY;EACnD,MAAM,UAAU,MAAM;EACtB,MAAM,gBAAgB,QAAQ;EAC9B,MAAM,iBAAiB,gBAAgB;EAGvC,IAAI,UAAU;EACd,IAAI,wBAAwB;EAC5B,IAAI,0BAA0B;EAC9B,IAAI,IAAI;AACR,SAAO,MAAM,SAAS;GACpB,MAAM,SAAS;AACf,UAAO,MAAM,WAAW,MAAM,GAAG,OAAOA,mBAAiB,WACvD,MAAK;AAEP,OAAI,WAAW,EACb,KAAI,WAAW,GAEb;QAAI,IAAI,eAAe;AACrB,gBAAW,IAAI;AACf,6BAAwB;IACzB;cACQ,MAAM,SAAS;IAExB,MAAMC,MAAI,IAAI;AACd,QAAIA,MAAI,eAAe;AACrB,gBAAWA,MAAI;AACf,6BAAwB;IACzB;GACF,OAAM;IAEL,MAAMA,MAAI,IAAI;AACd,QAAIA,MAAI,gBAAgB;AACtB,gBAAWA,MAAI;AACf,gCAA2B;IAC5B;GACF;AAEH,UAAO,MAAM,WAAW,MAAM,GAAG,OAAOD,mBAAiB,WACvD,MAAK;EAER;EACD,MAAM,WAAW,4BAA4B,KAAK;AAClD,MAAI,4BAA4B,EAC9B,YAAW,0BAA0B;WAC5B,sBACT,YAAW;EAGb,MAAM,QAAQ,UAAU;EACxB,MAAM,QAAQ,EAAE;EAChB,IAAI,aAAa;AACjB,MAAI,SACF,OAAM,KAAK;EAIb,IAAI,SAAS;EACb,IAAI,SAAS;EACb,IAAI,OAAO;EACX,IAAI,OAAO;EACX,MAAM,kBAAiB,SAAQ;GAC7B,MAAM,IAAI,MAAM;AAChB,SAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,MAAM,OAAO;AACzD,WAAQ;AACR,WAAQ;EACT;EACD,MAAM,kBAAiB,SAAQ;GAC7B,MAAM,IAAI,MAAM;AAChB,SAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,MAAM,OAAO;AACzD,WAAQ;EACT;EACD,MAAM,kBAAiB,SAAQ;GAC7B,MAAM,IAAI,MAAM;AAChB,SAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,MAAM,OAAO;AACzD,WAAQ;EACT;AAGD,MAAI;AACJ,SAAO,MAAM,SAAS;GACpB,IAAI,SAAS;AACb,UAAO,MAAM,WAAW,MAAM,GAAG,OAAOA,mBAAiB,WACvD,MAAK;AAEP,OAAI,WAAW,EACb,KAAI,WAAW,GAAG;AAEhB,QAAI,IAAI,eAAe;AACrB,cAAS,IAAI;AACb,cAAS;AACT,cAAS;AACT,YAAO;AACP,YAAO;IACR;AACD,SAAK,IAAI,UAAU,QAAQ,YAAY,GAAG,WAAW,EACnD,gBAAe,MAAM,SAAS;GAEjC,WAAU,MAAM,SAAS;IAExB,MAAM,OAAO,IAAI,SAAS,gBAAgB,SAAS,gBAAgB;AACnE,SAAK,IAAI,UAAU,QAAQ,YAAY,MAAM,WAAW,EACtD,gBAAe,MAAM,SAAS;GAEjC,OAAM;IAEL,MAAM,UAAU,IAAI;AACpB,QAAI,UAAU,gBAAgB;KAC5B,MAAM,OAAO,SAAS;AACtB,UAAK,IAAI,UAAU,QAAQ,YAAY,MAAM,WAAW,EACtD,gBAAe,MAAM,SAAS;AAEhC,WAAM,cAAc,gBAClB,QACA,MACA,QACA,MACA;AAEF,kBAAa,MAAM;AACnB,WAAM,KAAK;KAEX,MAAM,QAAQ,UAAU;AACxB,cAAS,OAAO;AAChB,cAAS,OAAO;AAChB,YAAO;AACP,YAAO;AACP,UAAK,IAAI,UAAU,IAAI,eAAe,YAAY,GAAG,WAAW,EAC9D,gBAAe,MAAM,SAAS;IAEjC,MACC,MAAK,IAAI,UAAU,QAAQ,YAAY,GAAG,WAAW,EACnD,gBAAe,MAAM,SAAS;GAGnC;AAEH,UAAO,MAAM,WAAW,MAAM,GAAG,OAAOA,mBAAiB,aAAa;AACpE,mBAAe,MAAM,GAAG;AACxB,SAAK;GACN;AACD,UAAO,MAAM,WAAW,MAAM,GAAG,OAAOA,mBAAiB,aAAa;AACpE,mBAAe,MAAM,GAAG;AACxB,SAAK;GACN;EACF;AACD,MAAI,SACF,OAAM,cAAc,gBAAgB,QAAQ,MAAM,QAAQ,MAAM;AAElE,SAAO,MAAM,KAAK;CACnB;AAMD,SAAQ,2BAA2B;CACnC,MAAM,0BAA0B,OAAO,YACrC,MACG,KAAK,QAAM,GAAG,YAAU;EACvB,MAAM,OAAOE,OAAK;EAClB,MAAM,gBAAgB,MAAM,KAAK,MAAMC,QAAM,SAAS;AACtD,UAAQD,OAAK,IAAb;GACE,KAAKF,mBAAiB,YACpB,QAAO,gBAAgB,MAAM,eAAe;GAC9C,KAAKA,mBAAiB,YACpB,QAAO,gBAAgB,MAAM,eAAe;GAC9C,QACE,QAAO,gBAAgB,MAAM,eAAe;EAC/C;CACF,GACA,KAAK;AACV,SAAQ,yBAAyB;;;;;;AC5QjC,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,uBAAuB,QAAQ,UAAU,KAAK;CACtD,IAAII,WAASC;CACb,SAASA,yBAAuB,KAAK;AACnC,SAAO,OAAO,IAAI,aAAa,MAAM,EAAC,SAAS,KAAI;CACpD;;;;;;;CAQD,MAAM,WAAU,WAAU;AAC1B,SAAQ,UAAU;CAClB,MAAM,uBAAuB;CAC7B,MAAM,kBAAkB;EACtB,aAAa;EACb,QAAQD,SAAO,QAAQ;EACvB,YAAY;EACZ,aAAa;EACb,QAAQA,SAAO,QAAQ;EACvB,YAAY;EACZ,aAAaA,SAAO,QAAQ;EAC5B,8BAA8B;EAC9B,aAAaA,SAAO,QAAQ;EAC5B,iBAAiB;EACjB,8BAA8B;EAC9B,aAAa;EACb,cAAc;EACd,iCAAiC;EACjC,QAAQ;EACR,qBAAqB;EACrB,qBAAqB;EACrB,YAAYA,SAAO,QAAQ;EAC5B;CACD,MAAM,kBAAiB,gBACrB,eAAe,OAAO,gBAAgB,aAClC,cACA,gBAAgB;CACtB,MAAM,mBAAkB,iBACtB,OAAO,iBAAiB,YACxB,OAAO,cAAc,iBACrB,gBAAgB,IACZ,eACA;CAGN,MAAM,wBAAwB,UAAU,EAAE,MAAM;EAC9C,GAAG;EACH,GAAG;EACH,aAAa,eAAe,QAAQ;EACpC,cAAc,gBAAgB,QAAQ;EACvC;AACD,SAAQ,uBAAuB;;;;;;ACxD/B,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,iBACN,QAAQ,oBACR,QAAQ,mBACR,QAAQ,eACN,KAAK;CACT,IAAIE,mBAAiBC;CACrB,IAAIC;CACJ,IAAI;CACJ,IAAIC;CACJ,SAASF,yBAAuB,KAAK;AACnC,SAAO,OAAO,IAAI,aAAa,MAAM,EAAC,SAAS,KAAI;CACpD;;;;;;;CAQD,MAAM,iBAAgB,UAAS,MAAM,WAAW,KAAK,MAAM,GAAG,WAAW;CACzE,MAAM,gBAAe,UAAS;EAC5B,IAAI,IAAI;EACR,IAAIG,MAAI;AACR,QAAM,SAAQ,WAAQ;AACpB,WAAQC,OAAK,IAAb;IACE,KAAKH,mBAAiB;AACpB,UAAK;AACL;IACF,KAAKA,mBAAiB;AACpB,YAAK;AACL;GACH;EACF;AACD,SAAO;GACL;GACA;GACD;CACF;CACD,MAAM,mBACJ,EACE,aACA,QACA,YACA,aACA,QACA,YACA,qBACA,qBACD,EACD,iBACG;AACH,MAAI,oBACF,QAAO;EAET,IAAI,QAAQ;EACZ,IAAI,QAAQ;AACZ,MAAI,qBAAqB;GACvB,MAAM,SAAS,OAAO,aAAa;GACnC,MAAM,SAAS,OAAO,aAAa;GAGnC,MAAM,yBAAyB,YAAY,SAAS,YAAY;GAChE,MAAM,qBAAqB,IAAI,OAAO,KAAK,IAAI,GAAG;GAClD,MAAM,qBAAqB,IAAI,OAAO,KAAK,IAAI,GAAG,CAAC;GAGnD,MAAM,oBAAoB,OAAO,SAAS,OAAO;GACjD,MAAM,gBAAgB,IAAI,OAAO,KAAK,IAAI,GAAG;GAC7C,MAAM,gBAAgB,IAAI,OAAO,KAAK,IAAI,GAAG,CAAC;AAC9C,WAAQ,GAAG,mBAAmB,IAAI,WAAW,GAAG,gBAAgB;AAChE,WAAQ,GAAG,mBAAmB,IAAI,WAAW,GAAG,gBAAgB;EACjE;EACD,MAAM,IAAI,GAAG,WAAW,GAAG,cAAc;EACzC,MAAME,MAAI,GAAG,WAAW,GAAG,cAAc;AACzC,SAAO,GAAG,OAAO,GAAG,IAAI,OAAOA,KAAG;CACnC;CACD,MAAM,kBAAkB,OAAO,YAC7B,gBAAgB,SAAS,aAAa,WACrC,QAAQ,UACJ,GAAG,kBAAkB,wBAAwB,OAAO,YACpD,GAAG,kBAAkB,0BAA0B,OAAO;AAG7D,SAAQ,iBAAiB;CACzB,MAAM,oBAAoB,QAAQ,QAAQ,YACxC,eACE,aACE,cAAc,UAAU,EAAE,GAAG,QAC7B,cAAc,UAAU,EAAE,GAAG,UAE9B,GAAGD,wBAAsB,sBAAsB;AAMpD,SAAQ,mBAAmB;CAC3B,MAAM,qBACJ,eACA,eACA,eACA,eACA,YACG;AACH,MAAI,cAAc,kBAAkB,cAAc,gBAAgB;AAChE,mBAAgB,EAAE;AAClB,mBAAgB,EAAE;EACnB;AACD,MAAI,cAAc,kBAAkB,cAAc,gBAAgB;AAChE,mBAAgB,EAAE;AAClB,mBAAgB,EAAE;EACnB;AACD,MACE,cAAc,WAAW,cAAc,UACvC,cAAc,WAAW,cAAc,OAGvC,QAAO,iBAAiB,eAAe,eAAe;EAExD,MAAM,QAAQ,aAAa,eAAe;EAG1C,IAAI,SAAS;EACb,IAAI,SAAS;AACb,QAAM,SAAQ,WAAQ;AACpB,WAAQE,OAAK,IAAb;IACE,KAAKH,mBAAiB;AACpB,YAAK,KAAK,cAAc;AACxB,eAAU;AACV;IACF,KAAKA,mBAAiB;AACpB,YAAK,KAAK,cAAc;AACxB,eAAU;AACV;IACF;AACE,YAAK,KAAK,cAAc;AACxB,eAAU;AACV,eAAU;GACb;EACF;AACD,SAAO,eACL,QACC,GAAGC,wBAAsB,sBAAsB;CAEnD;AAGD,SAAQ,oBAAoB;CAC5B,MAAM,gBAAgB,QAAQ,WAAW;EACvC,MAAM,UAAU,OAAO;EACvB,MAAM,UAAU,OAAO;EACvB,MAAM,YAAY,UAAQ,aAAW,OAAOG,cAAY,OAAOC;EAC/D,MAAM,QAAQ,EAAE;EAChB,IAAI,SAAS;EACb,IAAI,SAAS;EACb,MAAM,oBAAoB,SAAS,SAAS,YAAY;AACtD,UAAO,WAAW,SAAS,UAAU,EACnC,OAAM,KACJ,IAAIL,mBAAiB,KAAKA,mBAAiB,aAAa,OAAO;AAGnE,UAAO,WAAW,SAAS,UAAU,EACnC,OAAM,KACJ,IAAIA,mBAAiB,KAAKA,mBAAiB,aAAa,OAAO;AAGnE,UAAO,YAAY,GAAG,WAAW,GAAG,UAAU,GAAG,UAAU,EACzD,OAAM,KACJ,IAAIA,mBAAiB,KAAKA,mBAAiB,YAAY,OAAO;EAGnE;AACD,GAAC,GAAGF,iBAAe,SAAS,SAAS,SAAS,UAAU;AAGxD,SAAO,WAAW,SAAS,UAAU,EACnC,OAAM,KACJ,IAAIE,mBAAiB,KAAKA,mBAAiB,aAAa,OAAO;AAGnE,SAAO,WAAW,SAAS,UAAU,EACnC,OAAM,KACJ,IAAIA,mBAAiB,KAAKA,mBAAiB,aAAa,OAAO;AAGnE,SAAO;CACR;AACD,SAAQ,eAAe;;;;;;AC9LvB,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,UAAU,KAAK;CACvB,IAAI,iBAAiBM;CACrB,IAAIC;CACJ,SAASD,yBAAuB,KAAK;AACnC,SAAO,OAAO,IAAI,aAAa,MAAM,EAAC,SAAS,KAAI;CACpD;;;;;;;CAQD,MAAM,eAAe,GAAG,QAAM;EAC5B,MAAM,YAAY,UAAQ,aAAW,EAAEE,cAAYC,IAAEC;EACrD,IAAI,SAAS;EACb,IAAI,SAAS;EACb,MAAM,QAAQ,EAAE;EAChB,MAAM,oBAAoB,SAAS,SAAS,YAAY;AACtD,OAAI,WAAW,QACb,OAAM,KACJ,IAAIH,mBAAiB,KACnBA,mBAAiB,aACjB,EAAE,MAAM,QAAQ;AAItB,OAAI,WAAW,QACb,OAAM,KACJ,IAAIA,mBAAiB,KACnBA,mBAAiB,aACjBE,IAAE,MAAM,QAAQ;AAItB,YAAS,UAAU;AACnB,YAAS,UAAU;AACnB,SAAM,KACJ,IAAIF,mBAAiB,KACnBA,mBAAiB,YACjBE,IAAE,MAAM,SAAS;EAGtB;AACD,GAAC,GAAG,eAAe,SAAS,EAAE,QAAQA,IAAE,QAAQ,UAAU;AAG1D,MAAI,WAAW,EAAE,OACf,OAAM,KACJ,IAAIF,mBAAiB,KAAKA,mBAAiB,aAAa,EAAE,MAAM;AAGpE,MAAI,WAAWE,IAAE,OACf,OAAM,KACJ,IAAIF,mBAAiB,KAAKA,mBAAiB,aAAaE,IAAE,MAAM;AAGpE,SAAO;CACR;CACD,IAAIE,aAAW;AACf,SAAQ,UAAUA;;;;;;AC/DlB,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,UAAU,KAAK;CACvB,IAAIC;;;;;;;CAYJ,MAAM,4BAA4B,IAAI,OAAO,gBAC3C,MAAM,QACH,SAAS,WACR,WACCC,OAAK,OAAOD,mBAAiB,aAC1BC,OAAK,KACLA,OAAK,OAAO,MAAMA,OAAK,GAAG,WAAW,IACrC,YAAYA,OAAK,MACjB,KACN;CAIJ,IAAM,eAAN,MAAmB;EACjB;EACA;EACA;EACA;EACA,YAAY,IAAI,aAAa;AAC3B,QAAK,KAAK;AACV,QAAK,OAAO,EAAE;AACd,QAAK,QAAQ,EAAE;AACf,QAAK,cAAc;EACpB;EACD,cAAc,WAAW;AACvB,QAAK,SAAS,IAAID,mBAAiB,KAAK,KAAK,IAAI;EAClD;EACD,WAAW;AAOT,QAAK,MAAM,KACT,KAAK,KAAK,WAAW,IACjB,IAAIA,mBAAiB,KACnB,KAAK,IACL,yBAAyB,KAAK,IAAI,KAAK,MAAM,KAAK,gBAEpD,KAAK,KAAK,GAAG,OAAO,KAAK,KACzB,KAAK,KAAK,KACV,IAAIA,mBAAiB,KAAK,KAAK,IAAI,KAAK,KAAK,GAAG;AAGtD,QAAK,KAAK,SAAS;EACpB;EACD,cAAc;AACZ,UAAO,KAAK,KAAK,WAAW;EAC7B;EAGD,SAAS,QAAM;AACb,QAAK,KAAK,KAAKC;EAChB;EAGD,MAAM,QAAM;GACV,MAAM,SAASA,OAAK;AACpB,OAAI,OAAO,SAAS,OAAO;IACzB,MAAM,aAAa,OAAO,MAAM;IAChC,MAAM,QAAQ,WAAW,SAAS;AAClC,eAAW,SAAS,WAAW,MAAM;AACnC,SAAI,IAAI,OAAO;AAGb,WAAK,cAAc;AACnB,WAAK;KACN,WAAU,UAAU,WAAW,EAI9B,MAAK,cAAc;IAEtB;GACF,MAEC,MAAK,SAASA;EAEjB;EAGD,YAAY,OAAO;AACjB,OAAI,CAAC,KAAK,cACR,MAAK;AAEP,SAAM,KAAK,GAAG,KAAK;AACnB,QAAK,MAAM,SAAS;EACrB;CACF;CAGD,IAAM,eAAN,MAAmB;EACjB;EACA;EACA;EACA,YAAY,cAAc,cAAc;AACtC,QAAK,eAAe;AACpB,QAAK,eAAe;AACpB,QAAK,QAAQ,EAAE;EAChB;EACD,mBAAmB,QAAM;AACvB,QAAK,MAAM,KAAKA;EACjB;EACD,oBAAoB,QAAM;GACxB,MAAM,cAAcA,OAAK,GAAG,WAAW;AAGvC,OAAI,CAAC,eAAe,KAAK,aAAa,cACpC,MAAK,aAAa,SAASA;AAE7B,OAAI,CAAC,eAAe,KAAK,aAAa,cACpC,MAAK,aAAa,SAASA;EAE9B;EACD,mBAAmB;AACjB,QAAK,aAAa,YAAY,KAAK;AACnC,QAAK,aAAa,YAAY,KAAK;EACpC;EAGD,MAAM,QAAM;GACV,MAAM,KAAKA,OAAK;GAChB,MAAM,SAASA,OAAK;AACpB,OAAI,OAAO,SAAS,OAAO;IACzB,MAAM,aAAa,OAAO,MAAM;IAChC,MAAM,QAAQ,WAAW,SAAS;AAClC,eAAW,SAAS,WAAW,MAAM;AACnC,SAAI,MAAM,GAAG;MACX,MAAM,UAAU,IAAID,mBAAiB,KAAK,IAAI;AAC9C,UACE,KAAK,aAAa,iBAClB,KAAK,aAAa,eAClB;AAGA,YAAK;AACL,YAAK,mBAAmB;MACzB,OAAM;AAGL,YAAK,oBAAoB;AACzB,YAAK;MACN;KACF,WAAU,IAAI,MAEb,MAAK,mBAAmB,IAAIA,mBAAiB,KAAK,IAAI;cAC7C,UAAU,WAAW,EAI9B,MAAK,oBAAoB,IAAIA,mBAAiB,KAAK,IAAI;IAE1D;GACF,MAIC,MAAK,oBAAoBC;EAE5B;EAGD,WAAW;AACT,QAAK;AACL,UAAO,KAAK;EACb;CACF;CAYD,MAAM,mBAAmB,OAAO,gBAAgB;EAC9C,MAAM,eAAe,IAAI,aACvBD,mBAAiB,aACjB;EAEF,MAAM,eAAe,IAAI,aACvBA,mBAAiB,aACjB;EAEF,MAAM,eAAe,IAAI,aAAa,cAAc;AACpD,QAAM,SAAQ,WAAQ;AACpB,WAAQC,OAAK,IAAb;IACE,KAAKD,mBAAiB;AACpB,kBAAa,MAAMC;AACnB;IACF,KAAKD,mBAAiB;AACpB,kBAAa,MAAMC;AACnB;IACF,QACE,cAAa,MAAMA;GACtB;EACF;AACD,SAAO,aAAa;CACrB;CACD,IAAI,WAAW;AACf,SAAQ,UAAU;;;;;;AC5NlB,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,SAAQ,qBAAqB,QAAQ,iBAAiB,KAAK;CAC3D,IAAIC;CACJ,IAAIC;CACJ,IAAI,eAAeC;CACnB,IAAI,mBAAmBA;CACvB,IAAIC;CACJ,SAASD,yBAAuB,KAAK;AACnC,SAAO,OAAO,IAAI,aAAa,MAAM,EAAC,SAAS,KAAI;CACpD;;;;;;;CAQD,MAAM,iBAAiB,OAAO,gBAAgB;AAC5C,MAAI,aAAa;GAEf,MAAM,QAAQ,MAAM,SAAS;AAC7B,UAAO,MAAM,MACV,QAAM,MACLE,OAAK,OAAOJ,mBAAiB,eAC5B,MAAM,SAASI,OAAK,OAAO;EAEjC;AACD,SAAO,MAAM,MAAK,WAAQA,OAAK,OAAOJ,mBAAiB;CACxD;CAID,MAAM,sBAAsB,GAAG,KAAG,YAAY;AAC5C,MAAI,MAAMK,OAAK,EAAE,WAAW,KAAKA,IAAE,WAAW,GAAG;GAC/C,MAAM,cAAc,EAAE,SAAS,SAASA,IAAE,SAAS;GAGnD,MAAM,QAAQ,eACZ,cAAc,GAAG,EAAE,MAAM,GACzB,cAAc,GAAGA,IAAE,MAAMA,KACzB;AAGF,OAAI,cAAc,OAAO,cAAc;IACrC,MAAM,qBAAqB,GAAGF,wBAAsB,sBAClD;IAEF,MAAM,SAAS,GAAG,iBAAiB,SACjC,OACA,kBAAkB;AAEpB,YAAQ,GAAGF,aAAW,gBAAgB,OAAO;GAC9C;EACF;AAGD,UAAQ,GAAGA,aAAW,kBACpB,EAAE,MAAM,OACRI,IAAE,MAAM,OACR;CAEH;AAID,SAAQ,qBAAqB;CAC7B,MAAM,kBAAkB,GAAG,KAAG,YAAY;EACxC,MAAM,SAAS,GAAG,aAAa,SAAS,GAAGA;AAC3C,MAAI,QACF,EAAC,GAAGL,mBAAiB,iBAAiB;AAGxC,SAAO;CACR;AACD,SAAQ,iBAAiB;;;;;;AC5EzB,QAAO,eAAe,SAAS,cAAc,EAC3C,OAAO,MACR;AACD,QAAO,eAAe,SAAS,eAAe;EAC5C,YAAY;EACZ,KAAK,WAAY;AACf,UAAO,iBAAiB;EACzB;EACF;AACD,QAAO,eAAe,SAAS,cAAc;EAC3C,YAAY;EACZ,KAAK,WAAY;AACf,UAAO,iBAAiB;EACzB;EACF;AACD,QAAO,eAAe,SAAS,eAAe;EAC5C,YAAY;EACZ,KAAK,WAAY;AACf,UAAO,iBAAiB;EACzB;EACF;AACD,QAAO,eAAe,SAAS,QAAQ;EACrC,YAAY;EACZ,KAAK,WAAY;AACf,UAAO,iBAAiB;EACzB;EACF;AACD,SAAQ,OAAOM;AACf,QAAO,eAAe,SAAS,gBAAgB;EAC7C,YAAY;EACZ,KAAK,WAAY;AACf,UAAO,WAAW;EACnB;EACF;AACD,QAAO,eAAe,SAAS,oBAAoB;EACjD,YAAY;EACZ,KAAK,WAAY;AACf,UAAO,WAAW;EACnB;EACF;AACD,QAAO,eAAe,SAAS,qBAAqB;EAClD,YAAY;EACZ,KAAK,WAAY;AACf,UAAO,WAAW;EACnB;EACF;AACD,QAAO,eAAe,SAAS,kBAAkB;EAC/C,YAAY;EACZ,KAAK,WAAY;AACf,UAAO,YAAY;EACpB;EACF;AACD,QAAO,eAAe,SAAS,sBAAsB;EACnD,YAAY;EACZ,KAAK,WAAY;AACf,UAAO,YAAY;EACpB;EACF;CACD,IAAI,SAAS;CACb,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,SAAS,uBAAuB,KAAK;AACnC,SAAO,OAAO,IAAI,aAAa,MAAM,EAAC,SAAS,KAAI;CACpD;CACD,IAAIC,WAAS,WAAW,+BAA+B,WAAW;;;;;;;CAOlE,MAAM,oBAAoB,SAAS,YAAY;EAC7C,MAAM,EAAC,aAAY,IAAI,GAAG,sBAAsB,sBAC9C;AAEF,SAAO,YAAY;CACpB;CACD,MAAM,EACJ,mBACA,eACA,YACA,WACA,cACA,oBACD,GAAG,cAAc;CAClB,MAAM,UAAU;EACd;EACA;EACA;EACA;EACA;EACA;EACD;CACD,MAAM,iBAAiB,EACrB,SAAS,SACV;CACD,MAAM,0BAA0B;EAC9B,YAAY;EACZ,UAAU;EACV,SAAS;EACV;CAKD,SAASD,OAAK,GAAG,KAAG,SAAS;AAC3B,MAAI,OAAO,GAAG,GAAGE,KACf,QAAO,iBAAiB,WAAW,iBAAiB;EAEtD,MAAM,SAAS,GAAG,aAAa,SAAS;EACxC,IAAI,eAAe;EACnB,IAAI,iBAAiB;AACrB,MAAI,UAAU,YAAY,OAAO,EAAE,oBAAoB,YAAY;AACjE,OAAI,EAAE,aAAaD,SAAO,IAAI,0BAE5B,QAAO;AAET,OAAI,OAAO,EAAE,oBAAoB,WAE/B,QAAO;AAET,kBAAe,EAAE;AAGjB,oBAAiB,iBAAiB;EACnC;AACD,MAAI,kBAAkB,GAAG,aAAa,SAASC,KAC7C,QACE,uDACa,OAAO,QAAQ,MAAM,cAAc,gBACpC,OAAO,QAAQ,KAAK,GAAG,aAAa,SAASA,MAAI;AAGjE,MAAI,eACF,QAAO;AAET,UAAQ,OAAR;GACE,KAAK,SACH,SAAQ,GAAG,WAAW,kBACpB,EAAE,MAAM,OACRA,IAAE,MAAM,OACR;GAEJ,KAAK;GACL,KAAK,SACH,QAAO,iBAAiB,GAAGA,KAAG;GAChC,KAAK,MACH,QAAO,eAAe,QAAQ,IAAI,QAAQA,MAAI;GAChD,KAAK,MACH,QAAO,eAAe,QAAQ,IAAI,QAAQA,MAAI;GAChD,QACE,QAAO,eAAe,GAAGA,KAAG;EAC/B;CACF;CACD,SAAS,iBAAiB,GAAG,KAAG,SAAS;EACvC,MAAM,WAAW,GAAG,cAAc,QAAQ,GAAG;EAC7C,MAAM,WAAW,GAAG,cAAc,QAAQA,KAAG;AAC7C,SAAO,YAAY,UACf,iBAAiB,WAAW,iBAAiB,YAC5C,GAAG,WAAW,kBACb,QAAQ,MAAM,OACd,QAAQ,MAAM,OACd;CAEP;CACD,SAAS,QAAQ,KAAK;AACpB,SAAO,IAAI,IAAI,MAAM,KAAK,IAAI,WAAW;CAC1C;CACD,SAAS,QAAQ,KAAK;AACpB,SAAO,IAAI,IAAI,MAAM,KAAK,IAAI,UAAU;CACzC;CACD,SAAS,eAAe,GAAG,KAAG,SAAS;EACrC,IAAI;EACJ,IAAI,YAAY;AAChB,MAAI;GACF,MAAM,gBAAgB,iBAAiB,gBAAgB;AACvD,gBAAa,qBAAqB,GAAGA,KAAG,eAAe;EACxD,QAAO;AACN,eAAY;EACb;EACD,MAAM,gBAAgB,iBAAiB,WAAW,iBAAiB;AAGnE,MAAI,eAAe,UAAa,eAAe,eAAe;GAC5D,MAAM,gBAAgB,iBAAiB,yBAAyB;AAChE,gBAAa,qBAAqB,GAAGA,KAAG,eAAe;AACvD,OAAI,eAAe,iBAAiB,CAAC,UACnC,cAAa,GAAG,iBACd,WAAW,iBACX,SACA,MAAM;EAEX;AACD,SAAO;CACR;CACD,SAAS,iBAAiB,eAAe,SAAS;EAChD,MAAM,EAAC,aAAY,IAAI,GAAG,sBAAsB,sBAC9C;AAEF,SAAO;GACL,GAAG;GACH;GACD;CACF;CACD,SAAS,qBAAqB,GAAG,KAAG,eAAe,SAAS;EAC1D,MAAM,0BAA0B;GAC9B,GAAG;GACH,QAAQ;GACT;EACD,MAAM,YAAY,GAAG,cAAc,QAAQ,GAAG;EAC9C,MAAM,YAAY,GAAG,cAAc,QAAQA,KAAG;AAC9C,MAAI,aAAa,SACf,QAAO,iBAAiB,WAAW,iBAAiB;OAC/C;GACL,MAAM,YAAY,GAAG,cAAc,QAAQ,GAAG;GAC9C,MAAM,YAAY,GAAG,cAAc,QAAQA,KAAG;AAC9C,WAAQ,GAAG,WAAW,mBACpB,SAAS,MAAM,OACf,SAAS,MAAM,OACf,SAAS,MAAM,OACf,SAAS,MAAM,OACf;EAEH;CACF;;;;;;ACtOD,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM;AAC5D,SAAQ,UAAU,KAAK;CACvB,MAAMC,SAAO,QAAQ;CACrB,MAAM,WAAW,SAAS;AACtB,MAAI,CAAC,KACD,QAAO,EAAE,MAAM,KAAO;WAEjB,OAAO,SAAS,SACrB,QAAO;GAAE,MAAM;GAAO,GAAG;GAAM;WAE1B,OAAO,SAAS,SACrB,QAAO,EAAE,MAAM,MAAM;WAEhB,OAAO,SAAS,SACrB,QAAO,EAAE,MAAM,SAAS,MAAM,IAAI;MAGlC,OAAM,IAAI,UAAU;EAExB,MAAM,WAAW;EACjB,MAAM,SAAS,KAAK,MAAM,EAAE;AAC5B,OAAK,QAAQ,KAAK,SAAS,OAAO,SAASA,OAAK;AAChD,OAAK,aAAa,KAAK,aACjB,KAAK,aACL,OAAO,QAAM,YAAY;AACvB,UAAO,IAAI,SAAS,KAAK,QAAQ,SAAS,MAAMC,QAAM,UAAU,IAAI,SAAS,KAAK,IAAI,MAAM,IAAI;EACnG;AACL,OAAK,OAAO,KAAK,QAAQ,OAAO,QAAQD,OAAK;AAC7C,OAAK,YAAY,KAAK,YAChB,KAAK,YACL,OAAO,WAAS,IAAI,SAAS,KAAK,QAAQ,SAAS,KAAKC,SAAO,KAAK,UAAW,MAAM,IAAI,OAAO,IAAI;AAC1G,OAAK,WAAW,KAAK,YAAY,OAAO,YAAYD,OAAK;AACzD,OAAK,YAAY,KAAK,aAAa,OAAO,aAAaA,OAAK;AAC5D,SAAO;CACV;AACD,SAAQ,UAAU;;;;;;ACnClB,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM;AAC5D,SAAQ,eAAe,QAAQ,mBAAmB,KAAK;CACvD,MAAME,WAAS,QAAQ;CACvB,MAAMC;CACN,MAAM,oBAAoB,QAAM,SAAS,SAAS;EAC9C,MAAM,UAAU,GAAGD,SAAO,SAASE;EACnC,MAAM,OAAO;GAAE,IAAI,GAAGD,gBAAc,SAAS;GAAU,WAAW;GAAO;AACzE,MAAI,WAAWC,OACX,KAAI;AACA,UAAO,KAAK,UAAUA,QAAM;EAC/B,SACM,IAAI;GAGP,MAAM,MAAM;AACZ,OAAI,OAAO,IAAI,SAAS,SACpB,OAAM;AAEV;EACH;AAEL,MAAI;AACA,QAAK,UAAUA,QAAM;AACrB,UAAO,QAAQA;EAClB,SACM,IAAI;GACP,MAAM,MAAM;AACZ,OAAI,OAAO,IAAI,SAAS,SACpB,SAAQ,GAAG,QAAQ,kBAAkBA,QAAM,OAAO,GAAG,QAAQ,kBAAkB,QAAQ,MAAM;AAEjG,OAAI,OAAO,IAAI,SAAS,YAAY,OAAO,IAAI,SAAS,QACpD,OAAM;AAEV,OAAI;AACA,QAAI,CAAC,KAAK,SAASA,QAAM,cACrB,OAAM;GACb,SACM,GAAG;AACN,UAAM;GACT;EACJ;CACJ;AACD,SAAQ,mBAAmB;AAC3B,SAAQ,eAAe,OAAO,OAAO,OAAO,QAAM,SAAS,SAAS;EAChE,MAAM,QAAQ,GAAGD,gBAAc,SAAS;AACxC,OAAK,YAAY;EACjB,MAAM,UAAU,GAAGD,SAAO,SAASE;AACnC,MAAI,WAAWA,OACX,QAAO,KAAK,WAAWA,QAAM,MAAM,OAAM,OAAM;GAG3C,MAAM,MAAM;AACZ,OAAI,OAAO,IAAI,SAAS,SACpB,OAAM;EAEb;AAEL,SAAO,KAAK,WAAWA,QAAM,MAAM,WAAW,QAAQA,QAAM,OAAO,OAAO;GACtE,MAAM,MAAM;AACZ,OAAI,OAAO,IAAI,SAAS,SACpB,SAAQ,GAAG,QAAQ,cAAc,QAAQ,MAAM,MAAM,YAAU,GAAG,QAAQ,cAAcA,QAAM,MAAMC;AAExG,OAAI,OAAO,IAAI,SAAS,YAAY,IAAI,SAAS,QAC7C,OAAM;AAEV,UAAO,KAAK,UAAUD,QAAM,MAAK,OAAM;AACnC,QAAI,GAAG,cACH,QAAO;QAGP,OAAM;GAEb,SAAQ;AACL,UAAM;GACT;EACJ;CACJ,GAAE,EAAE,MAAM,QAAQ,kBAAkB;;;;;;AC5ErC,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM;AAC5D,SAAQ,eAAe,QAAQ,WAAW,KAAK;CAC/C,MAAME,WAAS,QAAQ;CACvB,MAAM,WAAW,OAAO,MAAM,QAAQ,WAAS;AAE3C,MAAIC,WAAS,OACT;AAEJ,SAAO,KAAK,UAAU,QAAQ,MAAK,OAAO,GAAG,gBAAgBA,SAAO,SAEpE,OAAM;GACF,MAAM,MAAM;AACZ,UAAO,OAAO,IAAI,SAAS,YACpB,GAAG,QAAQ,UAAU,OAAO,GAAGD,SAAO,SAAS,SAAS,UACzD;EACT;CACJ;AACD,SAAQ,WAAW;CACnB,MAAM,gBAAgB,MAAM,QAAQ,WAAS;AACzC,MAAIC,WAAS,OACT,QAAO;AAEX,MAAI;AACA,UAAO,KAAK,SAAS,QAAQ,gBAAgBA,SAAO;EACvD,SACM,IAAI;GACP,MAAM,MAAM;AACZ,UAAO,OAAO,IAAI,SAAS,YACpB,GAAG,QAAQ,cAAc,OAAO,GAAGD,SAAO,SAAS,SAAS,UAC7D;EACT;CACJ;AACD,SAAQ,eAAe;;;;;;AChCvB,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM;AAC5D,SAAQ,eAAe,QAAQ,mBAAmB,KAAK;CACvD,MAAME,WAAS,QAAQ;CACvB,MAAM;CACN,MAAMC;CACN,MAAMC;CACN,MAAM,oBAAoB,QAAM,YAAY;EACxC,MAAM,QAAQ,GAAGA,gBAAc,SAAS;AACxC,OAAK,YAAY;EACjB,MAAM,UAAU,GAAGF,SAAO,SAASG;AACnC,MAAI,WAAWA,OACX,QAAO,KAAK,UAAUA,QAAM;EAEhC,MAAM,QAAQ,GAAG,eAAe,cAAc,MAAMA;AACpD,MAAI;AACA,QAAK,UAAUA,QAAM;AACrB,UAAO;EACV,SACM,IAAI;GACP,MAAM,MAAM;AACZ,OAAI,OAAO,IAAI,SAAS,SACpB,SAAQ,GAAGF,qBAAmB,kBAAkBE,QAAM;OAGtD,OAAM;EAEb;CACJ;AACD,SAAQ,mBAAmB;AAC3B,SAAQ,eAAe,OAAO,OAAO,OAAO,QAAM,YAAY;EAC1D,MAAM,OAAO;GAAE,IAAI,GAAGD,gBAAc,SAAS;GAAU,WAAW;GAAM;EACxE,MAAM,UAAU,GAAGF,SAAO,SAASG;AACnC,MAAI,WAAWA,OACX,QAAO,MAAM,KAAK,WAAWA,QAAM;AAEvC,UAAQ,GAAG,eAAe,UAAU,MAAMA,QAAM,MAAM,SAAS,KAC1D,WAAWA,QAAM,MACjB,MAAK,QAAK,QAAQC,KAClB,OAAM,OAAM;GACb,MAAM,MAAM;AACZ,OAAI,OAAO,IAAI,SAAS,SACpB,SAAQ,GAAGH,qBAAmB,cAAcE,QAAM;OAGlD,OAAM;EAEb;CACJ,GAAE,EAAE,MAAM,QAAQ,kBAAkB;;;;;;AC/CrC,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM;AAC5D,SAAQ,UAAU,KAAK;CACvB,MAAM,WAAW,QAAQ,IAAI,+BAA+B,QAAQ;CACpE,MAAM,SAAS,QAAQ;CACvB,MAAM,WAAW,WAAS;AACtB,MAAI,KAAK,KAAKE,QAEV,OAAM,OAAO,uBAAO,IAAI,UAAU,6CAA6C;GAC3E;GACA,MAAM;GACT;AAEL,YAAQ,GAAG,OAAO,SAASA;AAC3B,MAAI,aAAa,SAAS;GACtB,MAAM,cAAc;GACpB,MAAM,EAAE,MAAM,IAAI,GAAG,OAAO,OAAOA;AACnC,OAAI,YAAY,KAAKA,OAAK,UAAU,KAAK,SACrC,OAAM,OAAO,uBAAO,IAAI,MAAM,gCAAgC;IAC1D;IACA,MAAM;IACT;EAER;AACD,SAAOA;CACV;AACD,SAAQ,UAAU;;;;;;ACzBlB,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM;AAC5D,SAAQ,YAAY,QAAQ,gBAAgB,KAAK;CACjD,MAAM,OAAO,QAAQ;CACrB,MAAMC;CACN,MAAM,UAAU,QAAQ,IAAI,mCAAmC,QAAQ;CACvE,MAAM,UAAU,QAAQ,QAAQ,MAAM,IAAI,MAAM;CAChD,MAAM,YAAY,CAAC,QAAQ,KAAK,MAAO,CAAC,QAAQ,OAAO,MAAM,CAAC,QAAQ,MAAM;AAC5E,SAAQ,gBAAgB,CAAC,kBACb,SACL,UAAU,GAAGA,gBAAc,SAAS,MAAM,cAAc,KAAK;AACpE,SAAQ,YAAY,OAAO,OAAO,CAAC,kBACvB,SACL,UAAU,GAAGA,gBAAc,SAAS,MAAM,UAAU,KAAK,OAAO,EACnE,MAAM,QAAQ,eACjB;;;;;;ACdD,QAAO,eAAe,SAAS,cAAc,EAAE,OAAO,MAAM;AAC5D,SAAQ,SAAS,QAAQ,aAAa,QAAQ,SAAS,QAAQ,aAAa,QAAQ,SAAS,QAAQ,OAAO,QAAQ,aAAa,QAAQ,gBAAgB,QAAQ,YAAY,QAAQ,mBAAmB,QAAQ,eAAe,QAAQ,mBAAmB,QAAQ,eAAe,KAAK;CACtR,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;;CAEN,IAAI;AACJ,QAAO,eAAe,SAAS,gBAAgB;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,mBAAmB;EAAe;EAAE;AACjI,QAAO,eAAe,SAAS,oBAAoB;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,mBAAmB;EAAmB;EAAE;CACzI,IAAI;AACJ,QAAO,eAAe,SAAS,gBAAgB;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,mBAAmB;EAAe;EAAE;AACjI,QAAO,eAAe,SAAS,oBAAoB;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,mBAAmB;EAAmB;EAAE;CACzI,IAAI;AACJ,QAAO,eAAe,SAAS,aAAa;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,gBAAgB;EAAY;EAAE;AACxH,QAAO,eAAe,SAAS,iBAAiB;EAAE,YAAY;EAAM,KAAK,WAAY;AAAE,UAAO,gBAAgB;EAAgB;EAAE;;CAEhI,MAAM,cAAc,QAAM,SAAS;AAC/B,YAAQ,GAAG,cAAc,SAASC;EAClC,MAAM,YAAY,GAAG,cAAc,SAAS;AAC5C,UAAQ,GAAG,gBAAgB,eAAe,aACnC,GAAG,mBAAmB,kBAAkBA,QAAM,aAC9C,GAAG,mBAAmB,kBAAkBA,QAAM;CACxD;AACD,SAAQ,aAAa;AACrB,SAAQ,OAAO,QAAQ;AACvB,SAAQ,SAAS,mBAAmB;AACpC,SAAQ,aAAa,mBAAmB;AACxC,SAAQ,SAAS,mBAAmB;AACpC,SAAQ,aAAa,mBAAmB;AACxC,SAAQ,SAAS,OAAO,OAAO,OAAO,QAAM,SAAS;AACjD,YAAQ,GAAG,cAAc,SAASA;EAClC,MAAM,YAAY,GAAG,cAAc,SAAS;AAC5C,UAAQ,GAAG,gBAAgB,WAAW,aAC/B,GAAG,mBAAmB,cAAcA,QAAM,aAC1C,GAAG,mBAAmB,cAAcA,QAAM;CACpD,GAAE;EACC,YAAY,QAAQ;EACpB,cAAc,mBAAmB;EACjC,kBAAkB,mBAAmB;EACrC,cAAc,mBAAmB;EACjC,kBAAkB,mBAAmB;EACrC,MAAM,QAAQ;EACd,QAAQ,mBAAmB;EAC3B,YAAY,mBAAmB;EAC/B,QAAQ,mBAAmB;EAC3B,YAAY,mBAAmB;EAC/B,WAAW,gBAAgB;EAC3B,eAAe,gBAAgB;EAClC;;;;;;CCjDD,IAAI,mBAAmB;AAEvB,QAAO,UAAU,SAAU,KAAK;AAC/B,MAAI,OAAO,QAAQ,SAClB,OAAM,IAAI,UAAU;AAGrB,SAAO,IAAI,QAAQ,kBAAkB;CACrC;;;;;;CCTD,IAAIC;AAEJ,QAAO,UAAU,SAAU,KAAK,QAAQ;AACvC,MAAI,OAAO,QAAQ,YAAY,OAAO,WAAW,SAChD,OAAM,IAAI,UAAU;AAGrB,SAAO,IAAI,QAAQ,IAAI,OAAO,QAAQA,qBAAmB,UAAU,SAAS,MAAM;CAClF;;;;;;ACND,QAAO,gBAAiB;AACxB,QAAO,QAAQ,qBAAsB;;;;;;CCHrC,IAAI;AAEJ,QAAO,UAAU,SAAU,KAAK,KAAK;AACpC,MAAI,OAAO,QAAQ,YAAY,OAAO,QAAQ,SAC7C,OAAM,IAAI;AAGX,QAAM,mBAAmB;AACzB,SAAO,IAAI,QAAQ,IAAI,OAAO,MAAM,MAAM,MAAM,MAAM,KAAK,MAAM;CACjE;;;;;;CCTD,MAAM;CACN,MAAM;CACN,MAAM;CAGN,MAAM,sBAAsB;CAE5B,MAAM,iBAAiB;CACvB,MAAM,iBAAiB;CACvB,MAAM,oBAAoB;CAE1B,MAAMC,gBAAc,QAAQ,UAAU,EAAE,KAAK;AAC5C,MAAI,OAAO,WAAW,SACrB,OAAM,IAAI,UAAU;EAGrB,MAAM,cAAc,QAAQ,gBAAgB,SAAY,MAAM,QAAQ;AAEtE,MAAI,wBAAwB,KAAK,gBAAgB,eAAe,KAAK,aACpE,OAAM,IAAI,MAAM;AAGjB,WAAS,OAAO,QAAQ,yBAAyB;AACjD,WAAS,OAAO,QAAQ,gBAAgB;AACxC,WAAS,OAAO,QAAQ,gBAAgB;AACxC,WAAS,OAAO,QAAQ,mBAAmB;AAE3C,MAAI,YAAY,SAAS,GAAG;AAC3B,YAAS,aAAa,QAAQ;AAC9B,YAAS,OAAO,SAAS,IAAI,WAAW,QAAQ,eAAe;EAC/D;AAED,WAAS,sBAAsB,eAAe,KAAK,UAAU,SAAS,cAAc;AACpF,WAAS,OAAO,MAAM,GAAG,OAAO,QAAQ,cAAc,WAAW,QAAQ,YAAY;AAErF,SAAO;CACP;AAED,QAAO,UAAUA;;;;;;CCtCjB,MAAMC,SAAO,QAAQ;CACrB,MAAMC;CAEN,MAAMC,oBAAkB,UAAU,YAAY;AAC7C,aAAWF,OAAK,QAAQ;AACxB,SAAOA,OAAK,KAAKA,OAAK,QAAQ,WAAWC,aAAWD,OAAK,SAAS,WAAW;CAC7E;AAED,QAAO,UAAUE;;;;;;CCRjB,MAAMC;CACN,MAAM;CAEN,MAAM,qBAAqBA;AAC3B,oBAAmB,OAAO;AAE1B,QAAO,UAAUA;;;;;;;CCLjB,MAAMC,OAAK,QAAQ;CACnB,MAAMC,SAAO,QAAQ;CACrB,MAAM;CACN,MAAM,EAAE,MAAM;CACd,MAAM;CACN,MAAM;;;;;;CAON,MAAM,WAAW,GAAG,QAAM;AAExB,SAAO,OAAO,SAAS,KAAK,EAAE,OAAOC,OAAK,MAAMA;CACjD;;;;;;;;;;;;;AAcD,SAAQ,cAAc,SAASC,cAAY,SAAS,UAAU,UAAU,EAAE,EAAE;EAC1E,MAAM,EAAE,OAAO,eAAe,GAAG;EAEjC,MAAM,gBAAgB,QAAQ,iBAAiB;EAE/C,MAAM,WACJ,aAAa,SAETF,OAAK,KACHA,OAAK,QAAQ,KAAK,WAClB,sBACA,GAAG,WACD,KAAK,iBACL,EACE,aAAa,KACd,EACD,EAAE,WAAW,UAAU,EACvB,QAAQ,OAAO,KAAK,GAAG,KAAK,oBAC5B,gBACJ;AAEN,YAAU,EAER,MAAM,OAAO,OACX;GACE,QAAQ;GACR,cAAc;GACd,aAAa;GACd,EACD,QAAQ,OAEX;AAED,MAAI,cAAc,oBAAoB,UAAU,CAACD,KAAG,WAAW,WAAW;AAGxE,iBAAc;AAEd,UAAO;IACL,MAAM;IACN,eACE,mBAAmB,MAAM,KACvBC,OAAK,SAAS,WACd,OAAO,MAAM,KAAK,IAAI,eAAe;;+CAES,MAAM,KACpD,2CACA;IACL;EACF;AAED,MAAID,KAAG,WAAW,WAAW;GAC3B,MAAM,SAASA,KAAG,aAChB,UACA,OAAO,SAAS,WAAW,OAAO;AAGpC,OAAI,MAGF,KAAI,CAAC,QAAQ,SAAS,QAEpB,QAAO;IAAE,MAAM;IAAO,eAAe;IAAI;QACpC;AACL,kBAAc;AAEd,WAAO;KACL,MAAM;KACN,eACE,6BAA6B,MAAM,IACjC,gBACA,YAAY,MAAM,KAAKC,OAAK,SAAS,WAAW;KACrD;GACF;YAEG,QAAQ,SAAS,QACnB,QAAO;IAAE,MAAM;IAAM,eAAe;IAAI;YAEpC,cAAc,oBAAoB,OAAO;AAC3C,WAAO,KAAKA,OAAK,QAAQ;AACzB,SAAG,cAAc,UAAU;AAE3B,kBAAc;AAEd,WAAO;KAAE,MAAM;KAAM,eAAe;KAAI;GACzC,OAAM;AACL,kBAAc;IAEd,MAAM,aAAa,QAAQ,cAAc;IACzC,MAAM,aACJ,OAAO,SAAS,YAAY,OAAO,SAAS,UACxC,KACA,OAAO,WAAW,QAAQ,SAAS,QAAQ;AAEjD,WAAO;KACL,MAAM;KACN,eACE,oBAAoB,MAAM,IACxB,iBACA,YAAY,MAAM,KAAKA,OAAK,SAAS,WAAW,GAAG;KACxD;GACF;EAGN,WAEG,CAAC,UACA,cAAc,oBAAoB,SACjC,cAAc,oBAAoB,QACpC;AACA,UAAO,KAAKA,OAAK,QAAQ;AACzB,QAAG,cAAc,UAAU;AAE3B,iBAAc;AAEd,UAAO;IAAE,MAAM;IAAM,eAAe;IAAI;EACzC,OAAM;AACL,iBAAc;AAEd,UAAO;IACL,MAAM;IACN,eACE,mBAAmB,MAAM,KACvBA,OAAK,SAAS,WACd,GAAG,MAAM,KAAK,IAAI,iBAAiB;IACxC;EACF;CAEJ;;;;;;ACxJD,OAAO,OAAO,EAAE,oDAAa;;;;ACG7B,MAAM;AACN,MAAM,iBAAiBG,kBAAK,QAAQ;AAEpC,eAAe,WAAW,eAAwB;AAChD,KAAI;EACF,MAAM,wBACJ,iBAAiBA,kBAAK,QAAQ,gBAAgB;AAChD,UAAQ,MAAM,kCAAkC;EAEhD,MAAM,EAAE,gBAAgB,GAAG,MAAM,qBAAqB;AAEtD,MAAI,eAAe,WAAW,EAC5B,OAAM,IAAI,MAAM,4CAA4C;EAG9D,MAAM,yBAAyB,MAAM,QAAQ,IAAI;EACjD,MAAM,UAAU,MAAM,WAAW;EAEjC,MAAM,cAAcA,kBAAK,QAAQ,uBAAuB,GAAG,QAAQ,cAAc;AACjF,UAAQ,MAAM,0BAA0B;EAExC,MAAM,OAAO;GACX;GACA;GACA,QAAQ;GACR,QAAQ,MAAM,UAAU;GACxB,QAAQ,QAAQ,YAAY;GAC5B,QAAQ,gBACJ,QAAQ,cACL,MAAM,KACN,KAAK,YAAY,oBAAoB,QAAQ,UAC7C,KAAK,OACR;GACJ,QAAQ,YAAY,gBAAgB;GACrC,CAAC,OAAO;EAET,MAAM,UAAU,mBAAmB,KAAK,KAAK;AAE7C,UAAQ,MAAM,YAAY;EAE1B,MAAM,aAAaA,kBAAK,QAAQ,QAAQ,OAAO;AAE/C,MAAI;AACF,SAAMC,yBAAG,OAAO;AAChB,SAAMA,yBAAG,GAAG;AACZ,WAAQ,MAAM,iCAAiC;EAChD,QAAO;AACN,WAAQ,MAAM,sCAAsC;EACrD;AAED,mCAAS,SAAS,EAAE,OAAO,WAAW;AAEtC,MAAI;GACF,MAAM,gBAAgB,MAAMA,yBAAG,SAAS,YAAY;GACpD,MAAM,QAAQ,cAAc,MAAM,MAAM,OAAO;AAC/C,OAAI,MAAM,OACR,SAAQ,IACN,SAAS,MAAM,OAAO,gBAAgB,MAAM,SAAS,IAAI,UAAU,MAAM,iBAAiB,WAAW;OAGvG,SAAQ,MAAM,oCAAoC;EAErD,QAAO;AACN,WAAQ,MAAM;EACf;CACF,SAAQC,OAAgB;AACvB,MAAI,iBAAiB,MACnB,SAAQ,MAAM,0BAA0B,MAAM;MAE9C,SAAQ,MAAM,0BAA0B;AAE1C,MAAI,QAAQ,IAAI,aAAa,OAC3B,SAAQ,KAAK;CAEhB;AACF;;;;AClFI"}
1	+ {"version":3,"file":"index.js","names":["ignorePattern: string \| undefined","transformModules: Record<string, unknown>","fs","path","path","path","fs","error: unknown"],"sources":["../src/utils/getOptions.ts","../src/utils/loadTransformModules.ts","../src/utils/repository.ts","../src/runCodemod.ts","../src/index.ts"],"sourcesContent":["import { existsSync } from 'node:fs';\nimport { join } from 'node:path';\n\nimport { checkbox, confirm, input, select as list } from '@inquirer/prompts';\n\n/*\n if args are provided via CLI, log them to the console in\n * a formatted way matching Inquirer's style\n /\nconst logToInquirer = (label: string, value: string) => {\n const checkmark = '\\x1b[32m✔\\x1b[0m'; // Green checkmark\n const boldLabel = `\\x1b[1m${label}\\x1b[0m`; // Bold label\n const greenValue = `\\x1b[32m${value}\\x1b[0m`; // Green value\n\n console.info(`${checkmark} ${boldLabel} ${greenValue}`);\n};\n\n/\n Lets user pick from available packages to run the codemod on\n /\nconst queryPackages = async (packages: string[]) => {\n const message = 'Path to run codemod on:';\n const nonRootPackages = packages.filter((pkg) => pkg !== '.');\n\n // root package only\n if (packages.length === 1 && nonRootPackages.length === 0) {\n logToInquirer(message, packages[0]);\n return packages;\n }\n\n // multiple non-root packages\n if (nonRootPackages.length >= 1) {\n return checkbox({\n required: true,\n message: 'Select packages to transform:',\n choices: nonRootPackages.map((file) => ({\n name: file,\n value: file,\n checked: true,\n })),\n });\n }\n};\n\n/\n Determine user choice between CLI arg and Inquirer prompt: codemod\n /\nconst determineTransformer = async ({\n candidate,\n transformFiles,\n}: {\n candidate: string;\n transformFiles: string[];\n}): Promise<string> => {\n const codemodMessage = 'Select codemod to run:';\n\n if (candidate && transformFiles.includes(candidate)) {\n logToInquirer(codemodMessage, candidate);\n return candidate;\n }\n\n return list({\n message: codemodMessage,\n choices: transformFiles.map((file) => ({ name: file, value: file })),\n });\n};\n\n/\n Determine user choice between CLI arg and Inquirer prompt: paths/packages to process\n /\nconst determinePaths = async ({\n candidate,\n root,\n packages,\n}: {\n candidate: string;\n root: string;\n packages: string[];\n}): Promise<string[]> => {\n const targetPaths = [];\n\n if (candidate && existsSync(join(root, candidate))) {\n logToInquirer('Path to run codemod on', candidate);\n targetPaths.push(candidate);\n }\n\n if (!targetPaths.length) {\n const packagesToProcess = await queryPackages(packages);\n targetPaths.push(...(packagesToProcess ?? []));\n }\n\n return targetPaths;\n};\n\n/\n Determine user choice between CLI arg and Inquirer prompt: dry mode\n /\nconst determineIsDryMode = async (args: string[]) => {\n const message = 'Run in dry mode (no changes written to files)?';\n if (args.includes('--dry') \|\| args.includes('--dry-run')) {\n logToInquirer(message, 'Yes');\n return true;\n }\n\n return confirm({ message, default: false });\n};\n\n/\n Determine user choice between CLI arg and Inquirer prompt: print to CLI\n /\nconst determineIsPrint = async (args: string[]) => {\n const message = 'Print transformed source to console?';\n\n if (args.includes('--print')) {\n logToInquirer(message, 'Yes');\n return true;\n }\n\n return confirm({ message, default: false });\n};\n\n/\n Determine user choice between CLI arg and Inquirer prompt: ignore patterns\n /\nconst determineIgnorePatterns = async (args: string[]) => {\n const message = 'Enter ignore pattern(s) (comma separated) or leave empty:';\n const ignorePatternIndex = args.findIndex((arg) => arg === '--ignore-pattern');\n\n let ignorePattern: string \| undefined;\n\n if (ignorePatternIndex !== -1 && args.length > ignorePatternIndex + 1) {\n ignorePattern = args[ignorePatternIndex + 1];\n }\n\n if (ignorePattern) {\n logToInquirer(message, ignorePattern);\n return ignorePattern;\n }\n\n return input({\n message,\n validate: () => true,\n });\n};\n\n/\n Determine user choice between CLI arg and Inquirer prompt: gitignore\n /\nconst determineGitIgnore = async (args: string[]) => {\n const message = 'Respect .gitignore files?';\n\n if (args.includes('--gitignore')) {\n logToInquirer(message, 'Yes');\n return true;\n }\n\n if (args.includes('--no-gitignore')) {\n logToInquirer(message, 'No');\n return false;\n }\n\n return confirm({ message, default: true });\n};\n\ninterface OptionsParams {\n transformFiles: string[];\n packages: string[];\n root: string;\n}\nasync function getOptions({ transformFiles, packages, root }: OptionsParams) {\n const args = process.argv.slice(2);\n\n const transformFile = await determineTransformer({ candidate: args[0], transformFiles });\n const targetPaths = await determinePaths({ candidate: args[1], packages, root });\n const isDry = await determineIsDryMode(args);\n const isPrint = await determineIsPrint(args);\n const ignorePatterns = await determineIgnorePatterns(args);\n const useGitIgnore = await determineGitIgnore(args);\n\n return {\n transformFile,\n targetPaths,\n isDry,\n isPrint,\n ignorePatterns,\n useGitIgnore,\n };\n}\n\nexport default getOptions;\n","import { promises as fs } from 'fs';\nimport path from 'path';\n\ninterface TransformModule {\n default: {\n default: unknown;\n };\n}\n\nasync function loadTransformModules(transformsDir: string) {\n let transformModules: Record<string, unknown> = {};\n\n const files = await fs.readdir(transformsDir);\n const transformFiles = await Promise.all(\n files\n .filter((file) => file.endsWith('.js'))\n .map(async (file) => {\n const transformPath = path.join(transformsDir, file);\n const transformModule = (await import(transformPath)) as TransformModule;\n transformModules = { ...transformModules, [file]: transformModule.default.default };\n return file.replace('.js', '');\n }),\n );\n\n return { transformModules, transformFiles };\n}\n\nexport default loadTransformModules;\n","import { execSync } from 'node:child_process';\nimport { existsSync } from 'node:fs';\nimport path from 'node:path';\n\n/\n Finds the root of the project by looking for the `.git` directory.\n /\nexport function findProjectRoot(): string {\n try {\n const gitRoot = execSync('git rev-parse --show-toplevel', {\n cwd: process.cwd(),\n encoding: 'utf8',\n stdio: ['ignore', 'pipe', 'ignore'],\n }).trim();\n\n return gitRoot && existsSync(gitRoot) ? gitRoot : '';\n } catch {\n return '';\n }\n}\n\n/\n Quick and dirty way of determining package roots based on\n * the presence of `package.json` files and them optimistically\n * containing a `@transferwise/components` string.\n * /\nexport function findPackages() {\n try {\n const packages = execSync(\n [\n 'find ./',\n '-type f',\n '-name \"package.json\"',\n '-not -path \"/node_modules/*\"',\n '\|',\n 'xargs grep -l \"@transferwise/components\"',\n ].join(' '),\n {\n cwd: findProjectRoot(),\n encoding: 'utf8',\n },\n )\n .trim()\n .split('\\n')\n .map(path.dirname);\n\n console.log(packages);\n\n if (packages.length === 0) {\n throw new Error();\n }\n\n return packages;\n } catch {\n throw new Error('No suitable package roots found in the repository.');\n }\n}\n","#!/usr/bin/env node\n\nimport { execSync } from 'node:child_process';\nimport fs from 'node:fs/promises';\nimport path from 'node:path';\nimport { fileURLToPath } from 'node:url';\n\nimport { findPackages, findProjectRoot, getOptions, loadTransformModules } from './utils';\n\nconst currentFilePath = fileURLToPath(import.meta.url);\nconst currentDirPath = path.dirname(currentFilePath);\n\nconst resetReportFile = async (reportPath: string) => {\n try {\n await fs.access(reportPath);\n await fs.rm(reportPath);\n console.debug(`Removed existing report file: ${reportPath}`);\n } catch {\n console.debug(`No existing report file to remove: ${reportPath}`);\n }\n};\n\nconst summariseReportFile = async (reportPath: string) => {\n try {\n const reportContent = await fs.readFile(reportPath, 'utf8');\n const lines = reportContent.split('\\n').filter(Boolean);\n if (lines.length) {\n console.log(\n `\\n⚠️ ${lines.length} manual review${lines.length > 1 ? 's are' : ' is'} required. See ${reportPath} for details.`,\n );\n } else {\n console.debug(`Report file exists but is empty: ${reportPath}`);\n }\n } catch {\n console.debug(`No report file generated - no manual reviews needed`);\n }\n};\n\nasync function runCodemod(transformsDir?: string) {\n try {\n const packages = findPackages();\n const reportPath = path.resolve(process.cwd(), 'codemod-report.txt');\n const resolvedTransformsDir =\n transformsDir ?? path.resolve(currentDirPath, '../dist/transforms');\n console.debug(`Resolved transforms directory: ${resolvedTransformsDir}`);\n\n await resetReportFile(reportPath);\n\n const { transformFiles } = await loadTransformModules(resolvedTransformsDir);\n if (transformFiles.length === 0) {\n throw new Error(`No transform scripts found in directory: ${resolvedTransformsDir}`);\n }\n\n const options = await getOptions({\n packages,\n root: findProjectRoot(),\n transformFiles: await Promise.all(transformFiles),\n });\n\n const codemodPath = path.resolve(resolvedTransformsDir, `${options.transformFile}.js`);\n console.debug(`Resolved codemod path: ${codemodPath}`);\n\n options.targetPaths.map((targetPath) => {\n const args = [\n '-t',\n codemodPath,\n targetPath,\n options.isDry ? '--dry' : '',\n options.isPrint ? '--print' : '',\n options.ignorePatterns\n ? options.ignorePatterns\n .split(',')\n .map((pattern) => `--ignore-pattern=${pattern.trim()}`)\n .join(' ')\n : '',\n options.useGitIgnore ? '--gitignore' : '',\n ].filter(Boolean);\n\n const command = `npx jscodeshift ${args.join(' ')}`;\n console.info(`⚙️ \\x1b[1mProcessing:\\x1b[0m \\x1b[32m${targetPath}\\x1b[0m`);\n console.debug(`Running: ${command}`);\n\n return execSync(command, { stdio: 'inherit' });\n });\n\n await summariseReportFile(reportPath);\n } catch (error: unknown) {\n if (error instanceof Error) {\n console.error('Error running codemod:', error.message);\n } else {\n console.error('Error running codemod:', error);\n }\n if (process.env.NODE_ENV !== 'test') {\n process.exit(1);\n }\n }\n}\n\nexport { runCodemod };\n","#!/usr/bin/env node\nimport { runCodemod } from './runCodemod';\n\nvoid runCodemod();\n"],"mappings":";;;;;;;;;;;;;;AASA,MAAM,iBAAiB,OAAe,UAAkB;CACtD,MAAM,YAAY;CAClB,MAAM,YAAY,UAAU,MAAM;CAClC,MAAM,aAAa,WAAW,MAAM;AAEpC,SAAQ,KAAK,GAAG,UAAU,GAAG,UAAU,GAAG;AAC3C;;;;AAKD,MAAM,gBAAgB,OAAO,aAAuB;CAClD,MAAM,UAAU;CAChB,MAAM,kBAAkB,SAAS,QAAQ,QAAQ,QAAQ;AAGzD,KAAI,SAAS,WAAW,KAAK,gBAAgB,WAAW,GAAG;AACzD,gBAAc,SAAS,SAAS;AAChC,SAAO;CACR;AAGD,KAAI,gBAAgB,UAAU,EAC5B,yCAAgB;EACd,UAAU;EACV,SAAS;EACT,SAAS,gBAAgB,KAAK,UAAU;GACtC,MAAM;GACN,OAAO;GACP,SAAS;GACV;EACF;AAEJ;;;;AAKD,MAAM,uBAAuB,OAAO,EAClC,WACA,gBAID,KAAsB;CACrB,MAAM,iBAAiB;AAEvB,KAAI,aAAa,eAAe,SAAS,YAAY;AACnD,gBAAc,gBAAgB;AAC9B,SAAO;CACR;AAED,uCAAY;EACV,SAAS;EACT,SAAS,eAAe,KAAK,UAAU;GAAE,MAAM;GAAM,OAAO;GAAM;EACnE;AACF;;;;AAKD,MAAM,iBAAiB,OAAO,EAC5B,WACA,MACA,UAKD,KAAwB;CACvB,MAAM,cAAc,EAAE;AAEtB,KAAI,yDAA6B,MAAM,aAAa;AAClD,gBAAc,0BAA0B;AACxC,cAAY,KAAK;CAClB;AAED,KAAI,CAAC,YAAY,QAAQ;EACvB,MAAM,oBAAoB,MAAM,cAAc;AAC9C,cAAY,KAAK,GAAI,qBAAqB,EAAE;CAC7C;AAED,QAAO;AACR;;;;AAKD,MAAM,qBAAqB,OAAO,SAAmB;CACnD,MAAM,UAAU;AAChB,KAAI,KAAK,SAAS,YAAY,KAAK,SAAS,cAAc;AACxD,gBAAc,SAAS;AACvB,SAAO;CACR;AAED,wCAAe;EAAE;EAAS,SAAS;EAAO;AAC3C;;;;AAKD,MAAM,mBAAmB,OAAO,SAAmB;CACjD,MAAM,UAAU;AAEhB,KAAI,KAAK,SAAS,YAAY;AAC5B,gBAAc,SAAS;AACvB,SAAO;CACR;AAED,wCAAe;EAAE;EAAS,SAAS;EAAO;AAC3C;;;;AAKD,MAAM,0BAA0B,OAAO,SAAmB;CACxD,MAAM,UAAU;CAChB,MAAM,qBAAqB,KAAK,WAAW,QAAQ,QAAQ;CAE3D,IAAIA;AAEJ,KAAI,uBAAuB,MAAM,KAAK,SAAS,qBAAqB,EAClE,iBAAgB,KAAK,qBAAqB;AAG5C,KAAI,eAAe;AACjB,gBAAc,SAAS;AACvB,SAAO;CACR;AAED,sCAAa;EACX;EACA,gBAAgB;EACjB;AACF;;;;AAKD,MAAM,qBAAqB,OAAO,SAAmB;CACnD,MAAM,UAAU;AAEhB,KAAI,KAAK,SAAS,gBAAgB;AAChC,gBAAc,SAAS;AACvB,SAAO;CACR;AAED,KAAI,KAAK,SAAS,mBAAmB;AACnC,gBAAc,SAAS;AACvB,SAAO;CACR;AAED,wCAAe;EAAE;EAAS,SAAS;EAAM;AAC1C;AAOD,eAAe,WAAW,EAAE,gBAAgB,UAAU,MAAqB,EAAE;CAC3E,MAAM,OAAO,QAAQ,KAAK,MAAM;CAEhC,MAAM,gBAAgB,MAAM,qBAAqB;EAAE,WAAW,KAAK;EAAI;EAAgB;CACvF,MAAM,cAAc,MAAM,eAAe;EAAE,WAAW,KAAK;EAAI;EAAU;EAAM;CAC/E,MAAM,QAAQ,MAAM,mBAAmB;CACvC,MAAM,UAAU,MAAM,iBAAiB;CACvC,MAAM,iBAAiB,MAAM,wBAAwB;CACrD,MAAM,eAAe,MAAM,mBAAmB;AAE9C,QAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACD;AACF;;;;AClLD,eAAe,qBAAqB,eAAuB;CACzD,IAAIC,mBAA4C,EAAE;CAElD,MAAM,QAAQ,MAAMC,iBAAG,QAAQ;CAC/B,MAAM,iBAAiB,MAAM,QAAQ,IACnC,MACG,QAAQ,SAAS,KAAK,SAAS,QAC/B,IAAI,OAAO,SAAS;EACnB,MAAM,gBAAgBC,kBAAK,KAAK,eAAe;EAC/C,MAAM,kBAAmB,MAAM,OAAO;AACtC,qBAAmB;GAAE,GAAG;IAAmB,OAAO,gBAAgB,QAAQ;GAAS;AACnF,SAAO,KAAK,QAAQ,OAAO;CAC5B;AAGL,QAAO;EAAE;EAAkB;EAAgB;AAC5C;;;;;;;AClBD,SAAgB,kBAA0B;AACxC,KAAI;EACF,MAAM,2CAAmB,iCAAiC;GACxD,KAAK,QAAQ;GACb,UAAU;GACV,OAAO;IAAC;IAAU;IAAQ;IAAS;GACpC,EAAE;AAEH,SAAO,mCAAsB,WAAW,UAAU;CACnD,QAAO;AACN,SAAO;CACR;AACF;;;;;;AAOD,SAAgB,eAAe;AAC7B,KAAI;EACF,MAAM,4CACJ;GACE;GACA;GACA;GACA;GACA;GACA;GACD,CAAC,KAAK,MACP;GACE,KAAK;GACL,UAAU;GACX,EAEA,OACA,MAAM,MACN,IAAIC,kBAAK;AAEZ,UAAQ,IAAI;AAEZ,MAAI,SAAS,WAAW,EACtB,OAAM,IAAI;AAGZ,SAAO;CACR,QAAO;AACN,QAAM,IAAI,MAAM;CACjB;AACF;;;;AC/CD,MAAM;AACN,MAAM,iBAAiBC,kBAAK,QAAQ;AAEpC,MAAM,kBAAkB,OAAO,eAAuB;AACpD,KAAI;AACF,QAAMC,yBAAG,OAAO;AAChB,QAAMA,yBAAG,GAAG;AACZ,UAAQ,MAAM,iCAAiC;CAChD,QAAO;AACN,UAAQ,MAAM,sCAAsC;CACrD;AACF;AAED,MAAM,sBAAsB,OAAO,eAAuB;AACxD,KAAI;EACF,MAAM,gBAAgB,MAAMA,yBAAG,SAAS,YAAY;EACpD,MAAM,QAAQ,cAAc,MAAM,MAAM,OAAO;AAC/C,MAAI,MAAM,OACR,SAAQ,IACN,SAAS,MAAM,OAAO,gBAAgB,MAAM,SAAS,IAAI,UAAU,MAAM,iBAAiB,WAAW;MAGvG,SAAQ,MAAM,oCAAoC;CAErD,QAAO;AACN,UAAQ,MAAM;CACf;AACF;AAED,eAAe,WAAW,eAAwB;AAChD,KAAI;EACF,MAAM,WAAW;EACjB,MAAM,aAAaD,kBAAK,QAAQ,QAAQ,OAAO;EAC/C,MAAM,wBACJ,iBAAiBA,kBAAK,QAAQ,gBAAgB;AAChD,UAAQ,MAAM,kCAAkC;AAEhD,QAAM,gBAAgB;EAEtB,MAAM,EAAE,gBAAgB,GAAG,MAAM,qBAAqB;AACtD,MAAI,eAAe,WAAW,EAC5B,OAAM,IAAI,MAAM,4CAA4C;EAG9D,MAAM,UAAU,MAAM,WAAW;GAC/B;GACA,MAAM;GACN,gBAAgB,MAAM,QAAQ,IAAI;GACnC;EAED,MAAM,cAAcA,kBAAK,QAAQ,uBAAuB,GAAG,QAAQ,cAAc;AACjF,UAAQ,MAAM,0BAA0B;AAExC,UAAQ,YAAY,KAAK,eAAe;GACtC,MAAM,OAAO;IACX;IACA;IACA;IACA,QAAQ,QAAQ,UAAU;IAC1B,QAAQ,UAAU,YAAY;IAC9B,QAAQ,iBACJ,QAAQ,eACL,MAAM,KACN,KAAK,YAAY,oBAAoB,QAAQ,UAC7C,KAAK,OACR;IACJ,QAAQ,eAAe,gBAAgB;IACxC,CAAC,OAAO;GAET,MAAM,UAAU,mBAAmB,KAAK,KAAK;AAC7C,WAAQ,KAAK,wCAAwC,WAAW;AAChE,WAAQ,MAAM,YAAY;AAE1B,2CAAgB,SAAS,EAAE,OAAO,WAAW;EAC9C;AAED,QAAM,oBAAoB;CAC3B,SAAQE,OAAgB;AACvB,MAAI,iBAAiB,MACnB,SAAQ,MAAM,0BAA0B,MAAM;MAE9C,SAAQ,MAAM,0BAA0B;AAE1C,MAAI,QAAQ,IAAI,aAAa,OAC3B,SAAQ,KAAK;CAEhB;AACF;;;;AC7FI"}