@ykurilov/agent-chat-attachments 0.0.0-stage → 0.56.0

package/dist/attachment-storage-contract.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../node_modules/.pnpm/expect-type@1.4.0/node_modules/expect-type/dist/branding.js","../../../node_modules/.pnpm/expect-type@1.4.0/node_modules/expect-type/dist/messages.js","../../../node_modules/.pnpm/expect-type@1.4.0/node_modules/expect-type/dist/overloads.js","../../../node_modules/.pnpm/expect-type@1.4.0/node_modules/expect-type/dist/utils.js","../../../node_modules/.pnpm/expect-type@1.4.0/node_modules/expect-type/dist/index.js","../../../node_modules/.pnpm/vitest@5.0.2_@types+node@22.20.4_jsdom@30.1.1_vite@8.3.1_@types+node@22.20.4_esbuild@0._c1a73b1baa2239b9b993b00a60e203c6/node_modules/vitest/dist/chunks/tinyrainbow.Ht9iggcq.js","../../../node_modules/.pnpm/vitest@5.0.2_@types+node@22.20.4_jsdom@30.1.1_vite@8.3.1_@types+node@22.20.4_esbuild@0._c1a73b1baa2239b9b993b00a60e203c6/node_modules/vitest/dist/chunks/index.M2dsQ_UQ.js","../../../node_modules/.pnpm/vitest@5.0.2_@types+node@22.20.4_jsdom@30.1.1_vite@8.3.1_@types+node@22.20.4_esbuild@0._c1a73b1baa2239b9b993b00a60e203c6/node_modules/vitest/dist/chunks/display.pkpxlVcY.js","../../../node_modules/.pnpm/vitest@5.0.2_@types+node@22.20.4_jsdom@30.1.1_vite@8.3.1_@types+node@22.20.4_esbuild@0._c1a73b1baa2239b9b993b00a60e203c6/node_modules/vitest/dist/chunks/pathe.M-eThtNZ.DwEga6ro.js","../../../node_modules/.pnpm/vitest@5.0.2_@types+node@22.20.4_jsdom@30.1.1_vite@8.3.1_@types+node@22.20.4_esbuild@0._c1a73b1baa2239b9b993b00a60e203c6/node_modules/vitest/dist/chunks/source-map.BH0bbrs9.js","../../../node_modules/.pnpm/vitest@5.0.2_@types+node@22.20.4_jsdom@30.1.1_vite@8.3.1_@types+node@22.20.4_esbuild@0._c1a73b1baa2239b9b993b00a60e203c6/node_modules/vitest/dist/task-utils.js","../../../node_modules/.pnpm/vitest@5.0.2_@types+node@22.20.4_jsdom@30.1.1_vite@8.3.1_@types+node@22.20.4_esbuild@0._c1a73b1baa2239b9b993b00a60e203c6/node_modules/vitest/dist/chunks/run.C5UmxDPh.js","../../../node_modules/.pnpm/vitest@5.0.2_@types+node@22.20.4_jsdom@30.1.1_vite@8.3.1_@types+node@22.20.4_esbuild@0._c1a73b1baa2239b9b993b00a60e203c6/node_modules/vitest/dist/chunks/utils.DYj33du9.js","../../../node_modules/.pnpm/vitest@5.0.2_@types+node@22.20.4_jsdom@30.1.1_vite@8.3.1_@types+node@22.20.4_esbuild@0._c1a73b1baa2239b9b993b00a60e203c6/node_modules/vitest/dist/chunks/spy.KLHgXex_.js","../../../node_modules/.pnpm/chai@6.2.2/node_modules/chai/index.js","../../../node_modules/.pnpm/vitest@5.0.2_@types+node@22.20.4_jsdom@30.1.1_vite@8.3.1_@types+node@22.20.4_esbuild@0._c1a73b1baa2239b9b993b00a60e203c6/node_modules/vitest/dist/chunks/plugins.Cigb0uSy.js","../../../node_modules/.pnpm/vitest@5.0.2_@types+node@22.20.4_jsdom@30.1.1_vite@8.3.1_@types+node@22.20.4_esbuild@0._c1a73b1baa2239b9b993b00a60e203c6/node_modules/vitest/dist/chunks/offset.Dy-5Fdfn.js","../../../node_modules/.pnpm/vite@8.3.1_@types+node@22.20.4_esbuild@0.27.7_jiti@2.7.0_tsx@4.23.15_yaml@2.9.1/node_modules/vite/dist/node/module-runner.js","../../../node_modules/.pnpm/tinybench@6.2.0/node_modules/tinybench/dist/index.js","../../../node_modules/.pnpm/vitest@5.0.2_@types+node@22.20.4_jsdom@30.1.1_vite@8.3.1_@types+node@22.20.4_esbuild@0._c1a73b1baa2239b9b993b00a60e203c6/node_modules/vitest/dist/chunks/index.DGdajAO2.js","../../../node_modules/.pnpm/vitest@5.0.2_@types+node@22.20.4_jsdom@30.1.1_vite@8.3.1_@types+node@22.20.4_esbuild@0._c1a73b1baa2239b9b993b00a60e203c6/node_modules/vitest/dist/index.js","../src/attachment-storage-contract.ts"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * @internal\n */\nconst inverted = Symbol('inverted');\n/**\n * @internal\n */\nconst expectNull = Symbol('expectNull');\n/**\n * @internal\n */\nconst expectUndefined = Symbol('expectUndefined');\n/**\n * @internal\n */\nconst expectNumber = Symbol('expectNumber');\n/**\n * @internal\n */\nconst expectString = Symbol('expectString');\n/**\n * @internal\n */\nconst expectBoolean = Symbol('expectBoolean');\n/**\n * @internal\n */\nconst expectVoid = Symbol('expectVoid');\n/**\n * @internal\n */\nconst expectFunction = Symbol('expectFunction');\n/**\n * @internal\n */\nconst expectObject = Symbol('expectObject');\n/**\n * @internal\n */\nconst expectArray = Symbol('expectArray');\n/**\n * @internal\n */\nconst expectSymbol = Symbol('expectSymbol');\n/**\n * @internal\n */\nconst expectAny = Symbol('expectAny');\n/**\n * @internal\n */\nconst expectUnknown = Symbol('expectUnknown');\n/**\n * @internal\n */\nconst expectNever = Symbol('expectNever');\n/**\n * @internal\n */\nconst expectNullable = Symbol('expectNullable');\n/**\n * @internal\n */\nconst expectBigInt = Symbol('expectBigInt');\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * @internal\n */\nconst secret = Symbol('secret');\n/**\n * @internal\n */\nconst mismatch = Symbol('mismatch');\n/**\n * A type which should match anything passed as a value but *doesn't*\n * match {@linkcode Mismatch}. It helps TypeScript select the right overload\n * for {@linkcode PositiveExpectTypeOf.toEqualTypeOf | .toEqualTypeOf()} and\n * {@linkcode PositiveExpectTypeOf.toMatchTypeOf | .toMatchTypeOf()}.\n *\n * @internal\n */\nconst avalue = Symbol('avalue');\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.expectTypeOf = void 0;\n__exportStar(require(\"./branding\"), exports); // backcompat, consider removing in next major version\n__exportStar(require(\"./messages\"), exports); // backcompat, consider removing in next major version\n__exportStar(require(\"./overloads\"), exports);\n__exportStar(require(\"./utils\"), exports); // backcompat, consider removing in next major version\nconst fn = () => true;\n/**\n * Similar to Jest's `expect`, but with type-awareness.\n * Gives you access to a number of type-matchers that let you make assertions about the\n * form of a reference or generic type parameter.\n *\n * @example\n * ```ts\n * import { foo, bar } from '../foo'\n * import { expectTypeOf } from 'expect-type'\n *\n * test('foo types', () => {\n *   // make sure `foo` has type { a: number }\n *   expectTypeOf(foo).toMatchTypeOf({ a: 1 })\n *   expectTypeOf(foo).toHaveProperty('a').toBeNumber()\n *\n *   // make sure `bar` is a function taking a string:\n *   expectTypeOf(bar).parameter(0).toBeString()\n *   expectTypeOf(bar).returns.not.toBeAny()\n * })\n * ```\n *\n * @description\n * See the [full docs](https://npmjs.com/package/expect-type#documentation) for lots more examples.\n */\nconst expectTypeOf = (_actual) => {\n    const nonFunctionProperties = [\n        'parameters',\n        'returns',\n        'resolves',\n        'not',\n        'items',\n        'constructorParameters',\n        'thisParameter',\n        'instance',\n        'guards',\n        'asserts',\n    ];\n    /* eslint-disable @typescript-eslint/no-unsafe-assignment */\n    function createBranded() {\n        return {\n            inspect: () => true,\n            configure: () => createBranded(),\n            toEqualTypeOf: fn,\n        };\n    }\n    const obj = {\n        toBeAny: fn,\n        toBeUnknown: fn,\n        toBeNever: fn,\n        toBeFunction: fn,\n        toBeObject: fn,\n        toBeArray: fn,\n        toBeString: fn,\n        toBeNumber: fn,\n        toBeBoolean: fn,\n        toBeVoid: fn,\n        toBeSymbol: fn,\n        toBeNull: fn,\n        toBeUndefined: fn,\n        toBeNullable: fn,\n        toBeBigInt: fn,\n        toMatchTypeOf: fn,\n        toEqualTypeOf: fn,\n        toBeConstructibleWith: fn,\n        toMatchObjectType: fn,\n        toExtend: fn,\n        map: exports.expectTypeOf,\n        toBeCallableWith: exports.expectTypeOf,\n        extract: exports.expectTypeOf,\n        exclude: exports.expectTypeOf,\n        pick: exports.expectTypeOf,\n        omit: exports.expectTypeOf,\n        toHaveProperty: exports.expectTypeOf,\n        parameter: exports.expectTypeOf,\n        get branded() {\n            return createBranded();\n        },\n    };\n    /* eslint-enable @typescript-eslint/no-unsafe-assignment */\n    const getterProperties = nonFunctionProperties;\n    getterProperties.forEach((prop) => Object.defineProperty(obj, prop, { get: () => (0, exports.expectTypeOf)({}) }));\n    return obj;\n};\nexports.expectTypeOf = expectTypeOf;\n","// src/index.ts\nvar b = {\n  reset: [0, 0],\n  bold: [1, 22, \"\\x1B[22m\\x1B[1m\"],\n  dim: [2, 22, \"\\x1B[22m\\x1B[2m\"],\n  italic: [3, 23],\n  underline: [4, 24],\n  inverse: [7, 27],\n  hidden: [8, 28],\n  strikethrough: [9, 29],\n  black: [30, 39],\n  red: [31, 39],\n  green: [32, 39],\n  yellow: [33, 39],\n  blue: [34, 39],\n  magenta: [35, 39],\n  cyan: [36, 39],\n  white: [37, 39],\n  gray: [90, 39],\n  bgBlack: [40, 49],\n  bgRed: [41, 49],\n  bgGreen: [42, 49],\n  bgYellow: [43, 49],\n  bgBlue: [44, 49],\n  bgMagenta: [45, 49],\n  bgCyan: [46, 49],\n  bgWhite: [47, 49],\n  blackBright: [90, 39],\n  redBright: [91, 39],\n  greenBright: [92, 39],\n  yellowBright: [93, 39],\n  blueBright: [94, 39],\n  magentaBright: [95, 39],\n  cyanBright: [96, 39],\n  whiteBright: [97, 39],\n  bgBlackBright: [100, 49],\n  bgRedBright: [101, 49],\n  bgGreenBright: [102, 49],\n  bgYellowBright: [103, 49],\n  bgBlueBright: [104, 49],\n  bgMagentaBright: [105, 49],\n  bgCyanBright: [106, 49],\n  bgWhiteBright: [107, 49]\n};\nfunction i(e) {\n  return String(e);\n}\ni.open = \"\";\ni.close = \"\";\nfunction p() {\n  let e = {\n    isColorSupported: false,\n    reset: i\n  };\n  for (let r in b)\n    e[r] = i;\n  return e;\n}\nfunction B() {\n  let e = typeof process != \"undefined\" ? process : void 0, r = (e == null ? void 0 : e.env) || {}, a = r.FORCE_TTY !== \"false\", l = (e == null ? void 0 : e.argv) || [];\n  return !(\"NO_COLOR\" in r || l.includes(\"--no-color\")) && (\"FORCE_COLOR\" in r || l.includes(\"--color\") || (e == null ? void 0 : e.platform) === \"win32\" || a && r.TERM !== \"dumb\" || \"CI\" in r) || typeof window != \"undefined\" && !!window.chrome;\n}\nfunction C({ force: e } = {}) {\n  let r = e || B(), a = (t, o, u, n) => {\n    let g = \"\", s = 0;\n    do\n      g += t.substring(s, n) + u, s = n + o.length, n = t.indexOf(o, s);\n    while (~n);\n    return g + t.substring(s);\n  }, l = (t, o, u = t) => {\n    let n = (g) => {\n      let s = String(g), h = s.indexOf(o, t.length);\n      return ~h ? t + a(s, o, u, h) + o : t + s + o;\n    };\n    return n.open = t, n.close = o, n;\n  }, c = {\n    isColorSupported: r\n  }, f = (t) => `\\x1B[${t}m`;\n  for (let t in b) {\n    let o = b[t];\n    c[t] = r ? l(\n      f(o[0]),\n      f(o[1]),\n      o[2]\n    ) : i;\n  }\n  return c;\n}\nvar d = C();\nfunction m() {\n  Object.assign(d, p());\n}\nvar y = d;\n\nexport { m, y };\n","import { y } from './tinyrainbow.Ht9iggcq.js';\n\nfunction _mergeNamespaces$1(n, m) {\n\tm.forEach(function(e) {\n\t\te && typeof e !== \"string\" && !Array.isArray(e) && Object.keys(e).forEach(function(k) {\n\t\t\tif (k !== \"default\" && !(k in n)) {\n\t\t\t\tvar d = Object.getOwnPropertyDescriptor(e, k);\n\t\t\t\tObject.defineProperty(n, k, d.get ? d : {\n\t\t\t\t\tenumerable: true,\n\t\t\t\t\tget: function() {\n\t\t\t\t\t\treturn e[k];\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\t});\n\treturn Object.freeze(n);\n}\nfunction getKeysOfEnumerableProperties(object, compareKeys) {\n\tconst rawKeys = Object.keys(object);\n\tconst keys = compareKeys === null ? rawKeys : rawKeys.sort(compareKeys);\n\tif (Object.getOwnPropertySymbols) {\n\t\tfor (const symbol of Object.getOwnPropertySymbols(object)) if (Object.getOwnPropertyDescriptor(object, symbol).enumerable) keys.push(symbol);\n\t}\n\treturn keys;\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(iterator, config, indentation, depth, refs, printer, separator = \": \", length) {\n\tlet result = \"\";\n\tlet width = 0;\n\tlet current = iterator.next();\n\tif (!current.done) {\n\t\tresult += config.spacingOuter;\n\t\tconst indentationNext = indentation + config.indent;\n\t\twhile (!current.done) {\n\t\t\tresult += indentationNext;\n\t\t\tif (width++ === config.maxWidth) {\n\t\t\t\tresult += typeof length === \"number\" ? `…(${length - width + 1})` : \"…\";\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tconst name = printer(current.value[0], config, indentationNext, depth, refs);\n\t\t\tconst value = printer(current.value[1], config, indentationNext, depth, refs);\n\t\t\tresult += name + separator + value;\n\t\t\tcurrent = iterator.next();\n\t\t\tif (!current.done) result += `,${config.spacingInner}`;\n\t\t\telse if (!config.min) result += \",\";\n\t\t}\n\t\tresult += config.spacingOuter + indentation;\n\t}\n\treturn result;\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(iterator, config, indentation, depth, refs, printer, length) {\n\tlet result = \"\";\n\tlet width = 0;\n\tlet current = iterator.next();\n\tif (!current.done) {\n\t\tresult += config.spacingOuter;\n\t\tconst indentationNext = indentation + config.indent;\n\t\twhile (!current.done) {\n\t\t\tresult += indentationNext;\n\t\t\tif (width++ === config.maxWidth) {\n\t\t\t\tresult += typeof length === \"number\" ? `…(${length - width + 1})` : \"…\";\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tresult += printer(current.value, config, indentationNext, depth, refs);\n\t\t\tcurrent = iterator.next();\n\t\t\tif (!current.done) result += `,${config.spacingInner}`;\n\t\t\telse if (!config.min) result += \",\";\n\t\t}\n\t\tresult += config.spacingOuter + indentation;\n\t}\n\treturn result;\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\tlet result = \"\";\n\tlist = list instanceof ArrayBuffer ? new DataView(list) : list;\n\tconst isDataView = (l) => l instanceof DataView;\n\tconst length = isDataView(list) ? list.byteLength : list.length;\n\tif (length > 0) {\n\t\tresult += config.spacingOuter;\n\t\tconst indentationNext = indentation + config.indent;\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tresult += indentationNext;\n\t\t\tif (i === config.maxWidth) {\n\t\t\t\tresult += `…(${length - i})`;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (isDataView(list) || i in list) result += printer(isDataView(list) ? list.getInt8(i) : list[i], config, indentationNext, depth, refs);\n\t\t\tif (i < length - 1) result += `,${config.spacingInner}`;\n\t\t\telse if (!config.min) result += \",\";\n\t\t}\n\t\tresult += config.spacingOuter + indentation;\n\t}\n\treturn result;\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, compareKeysOverride = config.compareKeys) {\n\tlet result = \"\";\n\tconst keys = getKeysOfEnumerableProperties(val, compareKeysOverride);\n\tif (keys.length > 0) {\n\t\tresult += config.spacingOuter;\n\t\tconst indentationNext = indentation + config.indent;\n\t\tfor (let i = 0; i < keys.length; i++) {\n\t\t\tresult += indentationNext;\n\t\t\tif (i === config.maxWidth) {\n\t\t\t\tresult += `…(${keys.length - i})`;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tconst key = keys[i];\n\t\t\tconst name = !config.quoteKeys && isUnquotableKey(key) ? key : printer(key, config, indentationNext, depth, refs);\n\t\t\tconst value = printer(val[key], config, indentationNext, depth, refs);\n\t\t\tresult += `${name}: ${value}`;\n\t\t\tif (i < keys.length - 1) result += `,${config.spacingInner}`;\n\t\t\telse if (!config.min) result += \",\";\n\t\t}\n\t\tresult += config.spacingOuter + indentation;\n\t}\n\treturn result;\n}\n// https://github.com/nodejs/node/blob/61102cdbb3d59155ad5bb4fc9419627a31e63f7a/lib/internal/util/inspect.js#L249\n// /^[a-zA-Z_][a-zA-Z_0-9]*$/\nconst keyStrRegExp = /^[a-z_]\\w*$/i;\nfunction isUnquotableKey(key) {\n\treturn typeof key === \"string\" && key !== \"__proto__\" && keyStrRegExp.test(key);\n}\nconst asymmetricMatcher = typeof Symbol === \"function\" && Symbol.for ? Symbol.for(\"jest.asymmetricMatcher\") : 1267621;\nconst SPACE$2 = \" \";\nconst serialize$5 = (val, config, indentation, depth, refs, printer) => {\n\tconst stringedValue = val.toString();\n\tif (stringedValue === \"ArrayContaining\" || stringedValue === \"ArrayNotContaining\") {\n\t\tif (++depth > config.maxDepth) return `[${stringedValue}]`;\n\t\treturn `${stringedValue + SPACE$2}[${printListItems(val.sample, config, indentation, depth, refs, printer)}]`;\n\t}\n\tif (stringedValue === \"ObjectContaining\" || stringedValue === \"ObjectNotContaining\") {\n\t\tif (++depth > config.maxDepth) return `[${stringedValue}]`;\n\t\treturn `${stringedValue + SPACE$2}{${printObjectProperties(val.sample, config, indentation, depth, refs, printer)}}`;\n\t}\n\tif (stringedValue === \"StringMatching\" || stringedValue === \"StringNotMatching\") return stringedValue + SPACE$2 + printer(val.sample, config, indentation, depth, refs);\n\tif (stringedValue === \"StringContaining\" || stringedValue === \"StringNotContaining\") return stringedValue + SPACE$2 + printer(val.sample, config, indentation, depth, refs);\n\tif (typeof val.toAsymmetricMatcher !== \"function\") throw new TypeError(`Asymmetric matcher ${val.constructor.name} does not implement toAsymmetricMatcher()`);\n\treturn val.toAsymmetricMatcher();\n};\nconst test$5 = (val) => val && val.$$typeof === asymmetricMatcher;\nconst plugin$5 = {\n\tserialize: serialize$5,\n\ttest: test$5\n};\nconst SPACE$1 = \" \";\nconst OBJECT_NAMES = /* @__PURE__ */ new Set([\"DOMStringMap\", \"NamedNodeMap\"]);\nconst ARRAY_REGEXP = /^(?:HTML\\w*Collection|NodeList)$/;\nfunction testName(name) {\n\treturn OBJECT_NAMES.has(name) || ARRAY_REGEXP.test(name);\n}\nconst test$4 = (val) => val && val.constructor && !!val.constructor.name && testName(val.constructor.name);\nfunction isNamedNodeMap(collection) {\n\treturn collection.constructor.name === \"NamedNodeMap\";\n}\nconst serialize$4 = (collection, config, indentation, depth, refs, printer) => {\n\tconst name = collection.constructor.name;\n\tif (++depth > config.maxDepth) return `[${name}]`;\n\treturn (config.min ? \"\" : name + SPACE$1) + (OBJECT_NAMES.has(name) ? `{${printObjectProperties(isNamedNodeMap(collection) ? [...collection].reduce((props, attribute) => {\n\t\tprops[attribute.name] = attribute.value;\n\t\treturn props;\n\t}, {}) : { ...collection }, config, indentation, depth, refs, printer)}}` : `[${printListItems([...collection], config, indentation, depth, refs, printer)}]`);\n};\nconst plugin$4 = {\n\tserialize: serialize$4,\n\ttest: test$4\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*/\nfunction escapeHTML(str) {\n\treturn str.replaceAll(\"<\", \"&lt;\").replaceAll(\">\", \"&gt;\");\n}\n// Return empty string if keys is empty.\nfunction printProps(keys, props, config, indentation, depth, refs, printer) {\n\tconst indentationNext = indentation + config.indent;\n\tconst colors = config.colors;\n\treturn keys.map((key) => {\n\t\tconst value = props[key];\n\t\t// hidden injected value that should not be printed\n\t\tif (typeof value === \"string\" && value[0] === \"_\" && value.startsWith(\"__vitest_\") && /__vitest_\\d+__/.test(value)) return \"\";\n\t\tlet printed = printer(value, config, indentationNext, depth, refs);\n\t\tif (typeof value !== \"string\") {\n\t\t\tif (printed.includes(\"\\n\")) printed = config.spacingOuter + indentationNext + printed + config.spacingOuter + indentation;\n\t\t\tprinted = `{${printed}}`;\n\t\t}\n\t\treturn `${config.spacingInner + indentation + colors.prop.open + key + colors.prop.close}=${colors.value.open}${printed}${colors.value.close}`;\n\t}).join(\"\");\n}\n// Return empty string if children is empty.\nfunction printChildren(children, config, indentation, depth, refs, printer) {\n\treturn children.map((child) => config.spacingOuter + indentation + (typeof child === \"string\" ? printText(child, config) : printer(child, config, indentation, depth, refs))).join(\"\");\n}\nfunction printShadowRoot(children, config, indentation, depth, refs, printer) {\n\tif (config.printShadowRoot === false) return \"\";\n\treturn [`${config.spacingOuter + indentation}#shadow-root`, printChildren(children, config, indentation + config.indent, depth, refs, printer)].join(\"\");\n}\nfunction printText(text, config) {\n\tconst contentColor = config.colors.content;\n\treturn contentColor.open + escapeHTML(text) + contentColor.close;\n}\nfunction printComment(comment, config) {\n\tconst commentColor = config.colors.comment;\n\treturn `${commentColor.open}<!--${escapeHTML(comment)}-->${commentColor.close}`;\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.\nfunction printElement(type, printedProps, printedChildren, config, indentation) {\n\tconst tagColor = config.colors.tag;\n\treturn `${tagColor.open}<${type}${printedProps && tagColor.close + printedProps + config.spacingOuter + indentation + tagColor.open}${printedChildren ? `>${tagColor.close}${printedChildren}${config.spacingOuter}${indentation}${tagColor.open}</${type}` : `${printedProps && !config.min ? \"\" : \" \"}/`}>${tagColor.close}`;\n}\nfunction printElementAsLeaf(type, config) {\n\tconst tagColor = config.colors.tag;\n\treturn `${tagColor.open}<${type}${tagColor.close} …${tagColor.open} />${tagColor.close}`;\n}\nconst ELEMENT_NODE = 1;\nconst TEXT_NODE = 3;\nconst COMMENT_NODE = 8;\nconst FRAGMENT_NODE = 11;\nconst ELEMENT_REGEXP = /^(?:(?:HTML|SVG)\\w*)?Element$/;\nfunction testHasAttribute(val) {\n\ttry {\n\t\treturn typeof val.hasAttribute === \"function\" && val.hasAttribute(\"is\");\n\t} catch {\n\t\treturn false;\n\t}\n}\nfunction testNode(val) {\n\tconst constructorName = val.constructor.name;\n\tconst { nodeType, tagName } = val;\n\tconst isCustomElement = typeof tagName === \"string\" && tagName.includes(\"-\") || testHasAttribute(val);\n\treturn nodeType === ELEMENT_NODE && (ELEMENT_REGEXP.test(constructorName) || isCustomElement) || nodeType === TEXT_NODE && constructorName === \"Text\" || nodeType === COMMENT_NODE && constructorName === \"Comment\" || nodeType === FRAGMENT_NODE && constructorName === \"DocumentFragment\";\n}\nconst test$3 = (val) => val?.constructor?.name && testNode(val);\nfunction nodeIsText(node) {\n\treturn node.nodeType === TEXT_NODE;\n}\nfunction nodeIsComment(node) {\n\treturn node.nodeType === COMMENT_NODE;\n}\nfunction nodeIsFragment(node) {\n\treturn node.nodeType === FRAGMENT_NODE;\n}\nfunction filterChildren(children, filterNode) {\n\t// Filter out text nodes that only contain whitespace to prevent empty lines\n\t// This is done regardless of whether a filterNode is provided\n\tlet filtered = children.filter((node) => {\n\t\t// Filter out text nodes that are only whitespace\n\t\tif (node.nodeType === TEXT_NODE)\n // Keep text nodes that have non-whitespace content\n\t\treturn (node.data || \"\").trim().length > 0;\n\t\treturn true;\n\t});\n\t// Apply additional user-provided filter if specified\n\tif (filterNode) filtered = filtered.filter(filterNode);\n\treturn filtered;\n}\nfunction serializeDOM(node, config, indentation, depth, refs, printer, filterNode) {\n\tif (nodeIsText(node)) return printText(node.data, config);\n\tif (nodeIsComment(node)) return printComment(node.data, config);\n\tconst type = nodeIsFragment(node) ? \"DocumentFragment\" : node.tagName.toLowerCase();\n\tif (++depth > config.maxDepth) return printElementAsLeaf(type, config);\n\tconst children = Array.prototype.slice.call(node.childNodes || node.children);\n\tconst shadowChildren = nodeIsFragment(node) || !node.shadowRoot ? [] : Array.prototype.slice.call(node.shadowRoot.children);\n\tconst resolvedChildren = filterNode ? filterChildren(children, filterNode) : children;\n\tconst resolvedShadowChildren = filterNode ? filterChildren(shadowChildren, filterNode) : shadowChildren;\n\treturn printElement(type, printProps(nodeIsFragment(node) ? [] : Array.from(node.attributes, (attr) => attr.name).sort(), nodeIsFragment(node) ? {} : [...node.attributes].reduce((props, attribute) => {\n\t\tprops[attribute.name] = attribute.value;\n\t\treturn props;\n\t}, {}), config, indentation + config.indent, depth, refs, printer), (resolvedShadowChildren.length > 0 ? printShadowRoot(resolvedShadowChildren, config, indentation + config.indent, depth, refs, printer) : \"\") + printChildren(resolvedChildren, config, indentation + config.indent, depth, refs, printer), config, indentation);\n}\nconst serialize$3 = (node, config, indentation, depth, refs, printer) => serializeDOM(node, config, indentation, depth, refs, printer);\nfunction createDOMElementFilter(filterNode) {\n\treturn {\n\t\ttest: test$3,\n\t\tserialize: (node, config, indentation, depth, refs, printer) => serializeDOM(node, config, indentation, depth, refs, printer, filterNode)\n\t};\n}\nconst plugin$3 = {\n\tserialize: serialize$3,\n\ttest: test$3\n};\n// SENTINEL constants are from https://github.com/immutable-js/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__@@\";\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 = \"…\";\nfunction printImmutableEntries(val, config, indentation, depth, refs, printer, type) {\n\treturn ++depth > config.maxDepth ? printAsLeaf(getImmutableName(type)) : `${getImmutableName(type) + SPACE}{${printIteratorEntries(val.entries(), config, indentation, depth, refs, printer)}}`;\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\tlet i = 0;\n\treturn { next() {\n\t\tif (i < val._keys.length) {\n\t\t\tconst key = val._keys[i++];\n\t\t\treturn {\n\t\t\t\tdone: false,\n\t\t\t\tvalue: [key, val.get(key)]\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\tdone: true,\n\t\t\tvalue: void 0\n\t\t};\n\t} };\n}\nfunction printImmutableRecord(val, config, indentation, depth, refs, printer) {\n\t// _name property is defined only for an Immutable Record instance\n\t// which was constructed with a second optional descriptive name arg\n\tconst name = getImmutableName(val._name || \"Record\");\n\treturn ++depth > config.maxDepth ? printAsLeaf(name) : `${name + SPACE}{${printIteratorEntries(getRecordEntries(val), config, indentation, depth, refs, printer)}}`;\n}\nfunction printImmutableSeq(val, config, indentation, depth, refs, printer) {\n\tconst name = getImmutableName(\"Seq\");\n\tif (++depth > config.maxDepth) return printAsLeaf(name);\n\tif (val[IS_KEYED_SENTINEL]) return `${name + SPACE}{${\n\t// from Immutable collection of entries or from ECMAScript object\n\tval._iter || val._object ? printIteratorEntries(val.entries(), config, indentation, depth, refs, printer) : LAZY}}`;\n\treturn `${name + SPACE}[${val._iter || val._array || val._collection || val._iterable ? printIteratorValues(val.values(), config, indentation, depth, refs, printer) : LAZY}]`;\n}\nfunction printImmutableValues(val, config, indentation, depth, refs, printer, type) {\n\treturn ++depth > config.maxDepth ? printAsLeaf(getImmutableName(type)) : `${getImmutableName(type) + SPACE}[${printIteratorValues(val.values(), config, indentation, depth, refs, printer)}]`;\n}\nconst serialize$2 = (val, config, indentation, depth, refs, printer) => {\n\tif (val[IS_MAP_SENTINEL]) return printImmutableEntries(val, config, indentation, depth, refs, printer, val[IS_ORDERED_SENTINEL] ? \"OrderedMap\" : \"Map\");\n\tif (val[IS_LIST_SENTINEL]) return printImmutableValues(val, config, indentation, depth, refs, printer, \"List\");\n\tif (val[IS_SET_SENTINEL]) return printImmutableValues(val, config, indentation, depth, refs, printer, val[IS_ORDERED_SENTINEL] ? \"OrderedSet\" : \"Set\");\n\tif (val[IS_STACK_SENTINEL]) return printImmutableValues(val, config, indentation, depth, refs, printer, \"Stack\");\n\tif (val[IS_SEQ_SENTINEL]) return printImmutableSeq(val, config, indentation, depth, refs, printer);\n\t// For compatibility with immutable v3 and v4, let record be the default.\n\treturn printImmutableRecord(val, config, indentation, depth, refs, printer);\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.\nconst test$2 = (val) => val && (val[IS_ITERABLE_SENTINEL] === true || val[IS_RECORD_SENTINEL] === true);\nconst plugin$2 = {\n\tserialize: serialize$2,\n\ttest: test$2\n};\nfunction getDefaultExportFromCjs(x) {\n\treturn x && x.__esModule && Object.prototype.hasOwnProperty.call(x, \"default\") ? x[\"default\"] : x;\n}\nvar reactIs$1 = { exports: {} };\nvar reactIs_production = {};\n/**\n* @license React\n* react-is.production.js\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*/\nvar hasRequiredReactIs_production;\nfunction requireReactIs_production() {\n\tif (hasRequiredReactIs_production) return reactIs_production;\n\thasRequiredReactIs_production = 1;\n\tvar REACT_ELEMENT_TYPE = Symbol.for(\"react.transitional.element\"), REACT_PORTAL_TYPE = Symbol.for(\"react.portal\"), REACT_FRAGMENT_TYPE = Symbol.for(\"react.fragment\"), REACT_STRICT_MODE_TYPE = Symbol.for(\"react.strict_mode\"), REACT_PROFILER_TYPE = Symbol.for(\"react.profiler\"), REACT_CONSUMER_TYPE = Symbol.for(\"react.consumer\"), REACT_CONTEXT_TYPE = Symbol.for(\"react.context\"), REACT_FORWARD_REF_TYPE = Symbol.for(\"react.forward_ref\"), REACT_SUSPENSE_TYPE = Symbol.for(\"react.suspense\"), REACT_SUSPENSE_LIST_TYPE = Symbol.for(\"react.suspense_list\"), REACT_MEMO_TYPE = Symbol.for(\"react.memo\"), REACT_LAZY_TYPE = Symbol.for(\"react.lazy\"), REACT_VIEW_TRANSITION_TYPE = Symbol.for(\"react.view_transition\"), REACT_CLIENT_REFERENCE = Symbol.for(\"react.client.reference\");\n\tfunction typeOf(object) {\n\t\tif (\"object\" === typeof object && null !== object) {\n\t\t\tvar $$typeof = object.$$typeof;\n\t\t\tswitch ($$typeof) {\n\t\t\t\tcase REACT_ELEMENT_TYPE: switch (object = object.type, object) {\n\t\t\t\t\tcase REACT_FRAGMENT_TYPE:\n\t\t\t\t\tcase REACT_PROFILER_TYPE:\n\t\t\t\t\tcase REACT_STRICT_MODE_TYPE:\n\t\t\t\t\tcase REACT_SUSPENSE_TYPE:\n\t\t\t\t\tcase REACT_SUSPENSE_LIST_TYPE:\n\t\t\t\t\tcase REACT_VIEW_TRANSITION_TYPE: return object;\n\t\t\t\t\tdefault: switch (object = object && object.$$typeof, object) {\n\t\t\t\t\t\tcase REACT_CONTEXT_TYPE:\n\t\t\t\t\t\tcase REACT_FORWARD_REF_TYPE:\n\t\t\t\t\t\tcase REACT_LAZY_TYPE:\n\t\t\t\t\t\tcase REACT_MEMO_TYPE: return object;\n\t\t\t\t\t\tcase REACT_CONSUMER_TYPE: return object;\n\t\t\t\t\t\tdefault: return $$typeof;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcase REACT_PORTAL_TYPE: return $$typeof;\n\t\t\t}\n\t\t}\n\t}\n\treactIs_production.ContextConsumer = REACT_CONSUMER_TYPE;\n\treactIs_production.ContextProvider = REACT_CONTEXT_TYPE;\n\treactIs_production.Element = REACT_ELEMENT_TYPE;\n\treactIs_production.ForwardRef = REACT_FORWARD_REF_TYPE;\n\treactIs_production.Fragment = REACT_FRAGMENT_TYPE;\n\treactIs_production.Lazy = REACT_LAZY_TYPE;\n\treactIs_production.Memo = REACT_MEMO_TYPE;\n\treactIs_production.Portal = REACT_PORTAL_TYPE;\n\treactIs_production.Profiler = REACT_PROFILER_TYPE;\n\treactIs_production.StrictMode = REACT_STRICT_MODE_TYPE;\n\treactIs_production.Suspense = REACT_SUSPENSE_TYPE;\n\treactIs_production.SuspenseList = REACT_SUSPENSE_LIST_TYPE;\n\treactIs_production.isContextConsumer = function(object) {\n\t\treturn typeOf(object) === REACT_CONSUMER_TYPE;\n\t};\n\treactIs_production.isContextProvider = function(object) {\n\t\treturn typeOf(object) === REACT_CONTEXT_TYPE;\n\t};\n\treactIs_production.isElement = function(object) {\n\t\treturn \"object\" === typeof object && null !== object && object.$$typeof === REACT_ELEMENT_TYPE;\n\t};\n\treactIs_production.isForwardRef = function(object) {\n\t\treturn typeOf(object) === REACT_FORWARD_REF_TYPE;\n\t};\n\treactIs_production.isFragment = function(object) {\n\t\treturn typeOf(object) === REACT_FRAGMENT_TYPE;\n\t};\n\treactIs_production.isLazy = function(object) {\n\t\treturn typeOf(object) === REACT_LAZY_TYPE;\n\t};\n\treactIs_production.isMemo = function(object) {\n\t\treturn typeOf(object) === REACT_MEMO_TYPE;\n\t};\n\treactIs_production.isPortal = function(object) {\n\t\treturn typeOf(object) === REACT_PORTAL_TYPE;\n\t};\n\treactIs_production.isProfiler = function(object) {\n\t\treturn typeOf(object) === REACT_PROFILER_TYPE;\n\t};\n\treactIs_production.isStrictMode = function(object) {\n\t\treturn typeOf(object) === REACT_STRICT_MODE_TYPE;\n\t};\n\treactIs_production.isSuspense = function(object) {\n\t\treturn typeOf(object) === REACT_SUSPENSE_TYPE;\n\t};\n\treactIs_production.isSuspenseList = function(object) {\n\t\treturn typeOf(object) === REACT_SUSPENSE_LIST_TYPE;\n\t};\n\treactIs_production.isValidElementType = function(type) {\n\t\treturn \"string\" === typeof type || \"function\" === typeof type || type === REACT_FRAGMENT_TYPE || type === REACT_PROFILER_TYPE || type === REACT_STRICT_MODE_TYPE || type === REACT_SUSPENSE_TYPE || type === REACT_SUSPENSE_LIST_TYPE || \"object\" === typeof type && null !== type && (type.$$typeof === REACT_LAZY_TYPE || type.$$typeof === REACT_MEMO_TYPE || type.$$typeof === REACT_CONTEXT_TYPE || type.$$typeof === REACT_CONSUMER_TYPE || type.$$typeof === REACT_FORWARD_REF_TYPE || type.$$typeof === REACT_CLIENT_REFERENCE || void 0 !== type.getModuleId) ? true : false;\n\t};\n\treactIs_production.typeOf = typeOf;\n\treturn reactIs_production;\n}\nvar hasRequiredReactIs$1;\nfunction requireReactIs$1() {\n\tif (hasRequiredReactIs$1) return reactIs$1.exports;\n\thasRequiredReactIs$1 = 1;\n\treactIs$1.exports = requireReactIs_production();\n\treturn reactIs$1.exports;\n}\nvar reactIsExports$1 = requireReactIs$1();\nvar ReactIs19 = /*#__PURE__*/ _mergeNamespaces$1({\n\t__proto__: null,\n\tdefault: /* @__PURE__ */ getDefaultExportFromCjs(reactIsExports$1)\n}, [reactIsExports$1]);\nvar reactIs = { exports: {} };\nvar reactIs_production_min = {};\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*/\nvar hasRequiredReactIs_production_min;\nfunction requireReactIs_production_min() {\n\tif (hasRequiredReactIs_production_min) return reactIs_production_min;\n\thasRequiredReactIs_production_min = 1;\n\tvar 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 = Symbol.for(\"react.module.reference\");\n\tfunction v(a) {\n\t\tif (\"object\" === typeof a && null !== a) {\n\t\t\tvar r = a.$$typeof;\n\t\t\tswitch (r) {\n\t\t\t\tcase b: switch (a = a.type, a) {\n\t\t\t\t\tcase d:\n\t\t\t\t\tcase f:\n\t\t\t\t\tcase e:\n\t\t\t\t\tcase m:\n\t\t\t\t\tcase n: return a;\n\t\t\t\t\tdefault: switch (a = a && a.$$typeof, a) {\n\t\t\t\t\t\tcase k:\n\t\t\t\t\t\tcase h:\n\t\t\t\t\t\tcase l:\n\t\t\t\t\t\tcase q:\n\t\t\t\t\t\tcase p:\n\t\t\t\t\t\tcase g: return a;\n\t\t\t\t\t\tdefault: return r;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcase c: return r;\n\t\t\t}\n\t\t}\n\t}\n\treactIs_production_min.ContextConsumer = h;\n\treactIs_production_min.ContextProvider = g;\n\treactIs_production_min.Element = b;\n\treactIs_production_min.ForwardRef = l;\n\treactIs_production_min.Fragment = d;\n\treactIs_production_min.Lazy = q;\n\treactIs_production_min.Memo = p;\n\treactIs_production_min.Portal = c;\n\treactIs_production_min.Profiler = f;\n\treactIs_production_min.StrictMode = e;\n\treactIs_production_min.Suspense = m;\n\treactIs_production_min.SuspenseList = n;\n\treactIs_production_min.isAsyncMode = function() {\n\t\treturn false;\n\t};\n\treactIs_production_min.isConcurrentMode = function() {\n\t\treturn false;\n\t};\n\treactIs_production_min.isContextConsumer = function(a) {\n\t\treturn v(a) === h;\n\t};\n\treactIs_production_min.isContextProvider = function(a) {\n\t\treturn v(a) === g;\n\t};\n\treactIs_production_min.isElement = function(a) {\n\t\treturn \"object\" === typeof a && null !== a && a.$$typeof === b;\n\t};\n\treactIs_production_min.isForwardRef = function(a) {\n\t\treturn v(a) === l;\n\t};\n\treactIs_production_min.isFragment = function(a) {\n\t\treturn v(a) === d;\n\t};\n\treactIs_production_min.isLazy = function(a) {\n\t\treturn v(a) === q;\n\t};\n\treactIs_production_min.isMemo = function(a) {\n\t\treturn v(a) === p;\n\t};\n\treactIs_production_min.isPortal = function(a) {\n\t\treturn v(a) === c;\n\t};\n\treactIs_production_min.isProfiler = function(a) {\n\t\treturn v(a) === f;\n\t};\n\treactIs_production_min.isStrictMode = function(a) {\n\t\treturn v(a) === e;\n\t};\n\treactIs_production_min.isSuspense = function(a) {\n\t\treturn v(a) === m;\n\t};\n\treactIs_production_min.isSuspenseList = function(a) {\n\t\treturn v(a) === n;\n\t};\n\treactIs_production_min.isValidElementType = function(a) {\n\t\treturn \"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) ? true : false;\n\t};\n\treactIs_production_min.typeOf = v;\n\treturn reactIs_production_min;\n}\nvar hasRequiredReactIs;\nfunction requireReactIs() {\n\tif (hasRequiredReactIs) return reactIs.exports;\n\thasRequiredReactIs = 1;\n\treactIs.exports = requireReactIs_production_min();\n\treturn reactIs.exports;\n}\nvar reactIsExports = requireReactIs();\nvar ReactIs18 = /*#__PURE__*/ _mergeNamespaces$1({\n\t__proto__: null,\n\tdefault: /* @__PURE__ */ getDefaultExportFromCjs(reactIsExports)\n}, [reactIsExports]);\nconst ReactIs = Object.fromEntries([\n\t\"isAsyncMode\",\n\t\"isConcurrentMode\",\n\t\"isContextConsumer\",\n\t\"isContextProvider\",\n\t\"isElement\",\n\t\"isForwardRef\",\n\t\"isFragment\",\n\t\"isLazy\",\n\t\"isMemo\",\n\t\"isPortal\",\n\t\"isProfiler\",\n\t\"isStrictMode\",\n\t\"isSuspense\",\n\t\"isSuspenseList\",\n\t\"isValidElementType\"\n].map((m) => [m, (v) => ReactIs18[m](v) || ReactIs19[m](v)]));\n// Given element.props.children, or subtree during recursive traversal,\n// return flattened array of children.\nfunction getChildren(arg, children = []) {\n\tif (Array.isArray(arg)) for (const item of arg) getChildren(item, children);\n\telse if (arg != null && arg !== false && arg !== \"\") children.push(arg);\n\treturn children;\n}\nfunction getType(element) {\n\tconst type = element.type;\n\tif (typeof type === \"string\") return type;\n\tif (typeof type === \"function\") return type.displayName || type.name || \"Unknown\";\n\tif (ReactIs.isFragment(element)) return \"React.Fragment\";\n\tif (ReactIs.isSuspense(element)) return \"React.Suspense\";\n\tif (typeof type === \"object\" && type !== null) {\n\t\tif (ReactIs.isContextProvider(element)) return \"Context.Provider\";\n\t\tif (ReactIs.isContextConsumer(element)) return \"Context.Consumer\";\n\t\tif (ReactIs.isForwardRef(element)) {\n\t\t\tif (type.displayName) return type.displayName;\n\t\t\tconst functionName = type.render.displayName || type.render.name || \"\";\n\t\t\treturn functionName === \"\" ? \"ForwardRef\" : `ForwardRef(${functionName})`;\n\t\t}\n\t\tif (ReactIs.isMemo(element)) {\n\t\t\tconst functionName = type.displayName || type.type.displayName || type.type.name || \"\";\n\t\t\treturn functionName === \"\" ? \"Memo\" : `Memo(${functionName})`;\n\t\t}\n\t}\n\treturn \"UNDEFINED\";\n}\nfunction getPropKeys$1(element) {\n\tconst { props } = element;\n\treturn Object.keys(props).filter((key) => key !== \"children\" && props[key] !== void 0).sort();\n}\nconst serialize$1 = (element, config, indentation, depth, refs, printer) => ++depth > config.maxDepth ? printElementAsLeaf(getType(element), config) : printElement(getType(element), printProps(getPropKeys$1(element), element.props, config, indentation + config.indent, depth, refs, printer), printChildren(getChildren(element.props.children), config, indentation + config.indent, depth, refs, printer), config, indentation);\nconst test$1 = (val) => val != null && ReactIs.isElement(val);\nconst plugin$1 = {\n\tserialize: serialize$1,\n\ttest: test$1\n};\nconst testSymbol = typeof Symbol === \"function\" && Symbol.for ? Symbol.for(\"react.test.json\") : 245830487;\nfunction getPropKeys(object) {\n\tconst { props } = object;\n\treturn props ? Object.keys(props).filter((key) => props[key] !== void 0).sort() : [];\n}\nconst serialize = (object, config, indentation, depth, refs, printer) => ++depth > config.maxDepth ? printElementAsLeaf(object.type, config) : printElement(object.type, object.props ? printProps(getPropKeys(object), object.props, config, indentation + config.indent, depth, refs, printer) : \"\", object.children ? printChildren(object.children, config, indentation + config.indent, depth, refs, printer) : \"\", config, indentation);\nconst test = (val) => val && val.$$typeof === testSymbol;\nconst plugin = {\n\tserialize,\n\ttest\n};\nconst toString = Object.prototype.toString;\nconst toISOString = Date.prototype.toISOString;\nconst errorToString = Error.prototype.toString;\nconst regExpToString = RegExp.prototype.toString;\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*/\nfunction getConstructorName(val) {\n\treturn typeof val.constructor === \"function\" && val.constructor.name || \"Object\";\n}\n/** Is val is equal to global window object? Works even if it does not exist :) */\nfunction isWindow(val) {\n\treturn typeof window !== \"undefined\" && val === window;\n}\n// eslint-disable-next-line regexp/no-super-linear-backtracking\nconst SYMBOL_REGEXP = /^Symbol\\((.*)\\)(.*)$/;\nconst NEWLINE_REGEXP = /\\n/g;\nclass PrettyFormatPluginError extends Error {\n\tconstructor(message, stack) {\n\t\tsuper(message);\n\t\tthis.stack = stack;\n\t\tthis.name = this.constructor.name;\n\t}\n}\nfunction isToStringedArrayType(toStringed) {\n\treturn toStringed === \"[object Array]\" || toStringed === \"[object ArrayBuffer]\" || toStringed === \"[object DataView]\" || toStringed === \"[object Float32Array]\" || toStringed === \"[object Float64Array]\" || toStringed === \"[object Int8Array]\" || toStringed === \"[object Int16Array]\" || toStringed === \"[object Int32Array]\" || toStringed === \"[object Uint8Array]\" || toStringed === \"[object Uint8ClampedArray]\" || toStringed === \"[object Uint16Array]\" || toStringed === \"[object Uint32Array]\";\n}\nfunction printNumber(val) {\n\treturn Object.is(val, -0) ? \"-0\" : String(val);\n}\nfunction printBigInt(val) {\n\treturn String(`${val}n`);\n}\nfunction printFunction(val, printFunctionName) {\n\tif (!printFunctionName) return \"[Function]\";\n\treturn `[Function ${val.name || \"anonymous\"}]`;\n}\nfunction printSymbol(val) {\n\treturn String(val).replace(SYMBOL_REGEXP, \"Symbol($1)\");\n}\nfunction printError(val) {\n\treturn `[${errorToString.call(val)}]`;\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, singleQuote) {\n\tif (val === true || val === false) return `${val}`;\n\tif (val === void 0) return \"undefined\";\n\tif (val === null) return \"null\";\n\tconst typeOf = typeof val;\n\tif (typeOf === \"number\") return printNumber(val);\n\tif (typeOf === \"bigint\") return printBigInt(val);\n\tif (typeOf === \"string\") {\n\t\tconst q = singleQuote ? \"'\" : \"\\\"\";\n\t\tif (escapeString) {\n\t\t\t// escape quote in each case, e.g.\n\t\t\t//   it's me -> 'it\\'s me'\n\t\t\t//   say \"hi\" -> \"say \\\"hi\\\"\"\n\t\t\tconst escapePattern = singleQuote ? /['\\\\]/g : /[\"\\\\]/g;\n\t\t\treturn `${q}${val.replaceAll(escapePattern, \"\\\\$&\")}${q}`;\n\t\t}\n\t\treturn `${q}${val}${q}`;\n\t}\n\tif (typeOf === \"function\") return printFunction(val, printFunctionName);\n\tif (typeOf === \"symbol\") return printSymbol(val);\n\tconst toStringed = toString.call(val);\n\tif (toStringed === \"[object WeakMap]\") return \"WeakMap {}\";\n\tif (toStringed === \"[object WeakSet]\") return \"WeakSet {}\";\n\tif (toStringed === \"[object Function]\" || toStringed === \"[object GeneratorFunction]\") return printFunction(val, printFunctionName);\n\tif (toStringed === \"[object Symbol]\") return printSymbol(val);\n\tif (toStringed === \"[object Date]\") return Number.isNaN(+val) ? \"Date { NaN }\" : toISOString.call(val);\n\tif (toStringed === \"[object Error]\") return printError(val);\n\tif (toStringed === \"[object RegExp]\") {\n\t\tif (escapeRegex)\n // https://github.com/benjamingr/RegExp.escape/blob/main/polyfill.js\n\t\treturn regExpToString.call(val).replaceAll(/[$()*+.?[\\\\\\]^{|}]/g, \"\\\\$&\");\n\t\treturn regExpToString.call(val);\n\t}\n\tif (val instanceof Error) return printError(val);\n\treturn null;\n}\n/**\n* Handles more complex objects ( such as objects with circular references.\n* maps and sets etc )\n*/\nfunction printComplexValue(val, config, indentation, depth, refs, hasCalledToJSON) {\n\tif (refs.includes(val)) return \"[Circular]\";\n\trefs = [...refs];\n\trefs.push(val);\n\tconst hitMaxDepth = ++depth > config.maxDepth;\n\tconst min = config.min;\n\tif (config.callToJSON && !hitMaxDepth && val.toJSON && typeof val.toJSON === \"function\" && !hasCalledToJSON) return printer(val.toJSON(), config, indentation, depth, refs, true);\n\tconst toStringed = toString.call(val);\n\tif (toStringed === \"[object Arguments]\") return hitMaxDepth ? \"[Arguments]\" : `${min ? \"\" : \"Arguments \"}[${printListItems(val, config, indentation, depth, refs, printer)}]`;\n\tif (isToStringedArrayType(toStringed)) return hitMaxDepth ? `[${val.constructor.name}]` : `${!config.printBasicPrototype && val.constructor.name === \"Array\" ? \"\" : `${val.constructor.name} `}[${printListItems(val, config, indentation, depth, refs, printer)}]`;\n\tif (toStringed === \"[object Map]\") return hitMaxDepth ? \"[Map]\" : `Map {${printIteratorEntries(val.entries(), config, indentation, depth, refs, printer, \" => \", val.size)}}`;\n\tif (toStringed === \"[object Set]\") return hitMaxDepth ? \"[Set]\" : `Set {${printIteratorValues(val.values(), config, indentation, depth, refs, printer, val.size)}}`;\n\t// Avoid failure to serialize global window object in jsdom test environment.\n\t// For example, not even relevant if window is prop of React element.\n\treturn hitMaxDepth || isWindow(val) ? `[${getConstructorName(val)}]` : `${!config.printBasicPrototype && getConstructorName(val) === \"Object\" ? \"\" : `${getConstructorName(val)} `}{${printObjectProperties(val, config, indentation, depth, refs, printer)}}`;\n}\nconst ErrorPlugin = {\n\ttest: (val) => val && val instanceof Error,\n\tserialize(val, config, indentation, depth, refs, printer) {\n\t\tif (refs.includes(val)) return \"[Circular]\";\n\t\trefs = [...refs, val];\n\t\tconst hitMaxDepth = ++depth > config.maxDepth;\n\t\tconst { message, cause, ...rest } = val;\n\t\tconst entries = {\n\t\t\tmessage,\n\t\t\t...typeof cause !== \"undefined\" ? { cause } : {},\n\t\t\t...val instanceof AggregateError ? { errors: val.errors } : {},\n\t\t\t...rest\n\t\t};\n\t\tconst name = val.name !== \"Error\" ? val.name : getConstructorName(val);\n\t\treturn hitMaxDepth ? `[${name}]` : `${name} {${printObjectProperties(entries, config, indentation, depth, refs, printer, null)}}`;\n\t}\n};\nfunction isNewPlugin(plugin) {\n\treturn plugin.serialize != null;\n}\nfunction printPlugin(plugin, val, config, indentation, depth, refs) {\n\tlet printed;\n\ttry {\n\t\tprinted = isNewPlugin(plugin) ? plugin.serialize(val, config, indentation, depth, refs, printer) : plugin.print(val, (valChild) => printer(valChild, config, indentation, depth, refs), (str) => {\n\t\t\tconst indentationNext = indentation + config.indent;\n\t\t\treturn indentationNext + str.replaceAll(NEWLINE_REGEXP, `\\n${indentationNext}`);\n\t\t}, {\n\t\t\tedgeSpacing: config.spacingOuter,\n\t\t\tmin: config.min,\n\t\t\tspacing: config.spacingInner\n\t\t}, config.colors);\n\t} catch (error) {\n\t\tthrow new PrettyFormatPluginError(error.message, error.stack);\n\t}\n\tif (typeof printed !== \"string\") throw new TypeError(`pretty-format: Plugin must return type \"string\" but instead returned \"${typeof printed}\".`);\n\treturn printed;\n}\nfunction findPlugin(plugins, val) {\n\tfor (const plugin of plugins) try {\n\t\tif (plugin.test(val)) return plugin;\n\t} catch (error) {\n\t\tthrow new PrettyFormatPluginError(error.message, error.stack);\n\t}\n\treturn null;\n}\nfunction printer(val, config, indentation, depth, refs, hasCalledToJSON) {\n\tlet result;\n\tconst plugin = findPlugin(config.plugins, val);\n\tif (plugin !== null) result = printPlugin(plugin, val, config, indentation, depth, refs);\n\telse {\n\t\tconst basicResult = printBasicValue(val, config.printFunctionName, config.escapeRegex, config.escapeString, config.singleQuote);\n\t\tif (basicResult !== null) result = basicResult;\n\t\telse result = printComplexValue(val, config, indentation, depth, refs, hasCalledToJSON);\n\t}\n\t// Per-depth output budget (inspired by Node's util.inspect).\n\t// Each depth level tracks output independently, so nested results\n\t// don't inflate a single counter (which would undercount by ~Nx for\n\t// N levels of nesting). Nodes at the same depth produce disjoint spans\n\t// in the output string, so each bucket accurately reflects output at\n\t// that level. Total output is bounded by maxDepth × maxOutputLength.\n\tconfig._outputLengthPerDepth[depth] ??= 0;\n\tconfig._outputLengthPerDepth[depth] += result.length;\n\tif (config._outputLengthPerDepth[depth] > config.maxOutputLength) config.maxDepth = 0;\n\treturn result;\n}\nconst DEFAULT_THEME = {\n\tcomment: \"gray\",\n\tcontent: \"reset\",\n\tprop: \"yellow\",\n\ttag: \"cyan\",\n\tvalue: \"green\"\n};\nconst DEFAULT_THEME_KEYS = Object.keys(DEFAULT_THEME);\nconst DEFAULT_OPTIONS = {\n\tcallToJSON: true,\n\tcompareKeys: void 0,\n\tescapeRegex: false,\n\tescapeString: true,\n\thighlight: false,\n\tindent: 2,\n\tmaxDepth: Number.POSITIVE_INFINITY,\n\t// Practical default hard-limit to avoid too long string being generated\n\t// (Node's limit is buffer.constants.MAX_STRING_LENGTH ~ 512MB)\n\tmaxOutputLength: 1e6,\n\tmaxWidth: Number.POSITIVE_INFINITY,\n\tmin: false,\n\tplugins: [],\n\tprintBasicPrototype: true,\n\tprintFunctionName: true,\n\tprintShadowRoot: true,\n\ttheme: DEFAULT_THEME,\n\tsingleQuote: false,\n\tquoteKeys: true,\n\tspacingInner: \"\\n\",\n\tspacingOuter: \"\\n\"\n};\nfunction validateOptions(options) {\n\tfor (const key of Object.keys(options)) if (!Object.hasOwn(DEFAULT_OPTIONS, key)) throw new Error(`pretty-format: Unknown option \"${key}\".`);\n\tif (options.min && options.indent !== void 0 && options.indent !== 0) throw new Error(\"pretty-format: Options \\\"min\\\" and \\\"indent\\\" cannot be used together.\");\n}\nfunction getColorsHighlight() {\n\treturn DEFAULT_THEME_KEYS.reduce((colors, key) => {\n\t\tconst value = DEFAULT_THEME[key];\n\t\tconst color = value && y[value];\n\t\tif (color && typeof color.close === \"string\" && typeof color.open === \"string\") colors[key] = color;\n\t\telse throw new Error(`pretty-format: Option \"theme\" has a key \"${key}\" whose value \"${value}\" is undefined in ansi-styles.`);\n\t\treturn colors;\n\t}, Object.create(null));\n}\nfunction getColorsEmpty() {\n\treturn DEFAULT_THEME_KEYS.reduce((colors, key) => {\n\t\tcolors[key] = {\n\t\t\tclose: \"\",\n\t\t\topen: \"\"\n\t\t};\n\t\treturn colors;\n\t}, Object.create(null));\n}\nfunction getPrintFunctionName(options) {\n\treturn options?.printFunctionName ?? DEFAULT_OPTIONS.printFunctionName;\n}\nfunction getEscapeRegex(options) {\n\treturn options?.escapeRegex ?? DEFAULT_OPTIONS.escapeRegex;\n}\nfunction getEscapeString(options) {\n\treturn options?.escapeString ?? DEFAULT_OPTIONS.escapeString;\n}\nfunction getConfig(options) {\n\treturn {\n\t\tcallToJSON: options?.callToJSON ?? DEFAULT_OPTIONS.callToJSON,\n\t\tcolors: options?.highlight ? getColorsHighlight() : getColorsEmpty(),\n\t\tcompareKeys: typeof options?.compareKeys === \"function\" || options?.compareKeys === null ? options.compareKeys : DEFAULT_OPTIONS.compareKeys,\n\t\tescapeRegex: getEscapeRegex(options),\n\t\tescapeString: getEscapeString(options),\n\t\tindent: options?.min ? \"\" : createIndent(options?.indent ?? DEFAULT_OPTIONS.indent),\n\t\tmaxDepth: options?.maxDepth ?? DEFAULT_OPTIONS.maxDepth,\n\t\tmaxWidth: options?.maxWidth ?? DEFAULT_OPTIONS.maxWidth,\n\t\tmin: options?.min ?? DEFAULT_OPTIONS.min,\n\t\tplugins: options?.plugins ?? DEFAULT_OPTIONS.plugins,\n\t\tprintBasicPrototype: options?.printBasicPrototype ?? !options?.min,\n\t\tprintFunctionName: getPrintFunctionName(options),\n\t\tprintShadowRoot: options?.printShadowRoot ?? true,\n\t\tspacingInner: options?.spacingInner ?? (options?.min ? \" \" : \"\\n\"),\n\t\tspacingOuter: options?.spacingOuter ?? (options?.min ? \"\" : \"\\n\"),\n\t\tsingleQuote: options?.singleQuote ?? DEFAULT_OPTIONS.singleQuote,\n\t\tquoteKeys: options?.quoteKeys ?? DEFAULT_OPTIONS.quoteKeys,\n\t\tmaxOutputLength: options?.maxOutputLength ?? DEFAULT_OPTIONS.maxOutputLength,\n\t\t_outputLengthPerDepth: []\n\t};\n}\nfunction createIndent(indent) {\n\treturn Array.from({ length: indent + 1 }).join(\" \");\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\tif (options) validateOptions(options);\n\tconst config = getConfig(options);\n\tconst plugin = findPlugin(config.plugins, val);\n\tif (plugin !== null) return printPlugin(plugin, val, config, \"\", 0, []);\n\tconst basicResult = printBasicValue(val, config.printFunctionName, config.escapeRegex, config.escapeString, config.singleQuote);\n\tif (basicResult !== null) return basicResult;\n\treturn printComplexValue(val, config, \"\", 0, []);\n}\nconst plugins = {\n\tAsymmetricMatcher: plugin$5,\n\tDOMCollection: plugin$4,\n\tDOMElement: plugin$3,\n\tImmutable: plugin$2,\n\tReactElement: plugin$1,\n\tReactTestComponent: plugin,\n\tError: ErrorPlugin\n};\n\nexport { createDOMElementFilter as c, format as f, plugins as p };\n","import { f as format$1, p as plugins, c as createDOMElementFilter } from './index.M2dsQ_UQ.js';\n\nconst { AsymmetricMatcher, DOMCollection, DOMElement, Immutable, ReactElement, ReactTestComponent } = plugins;\nconst PLUGINS = [\n\tReactTestComponent,\n\tReactElement,\n\tDOMElement,\n\tDOMCollection,\n\tImmutable,\n\tAsymmetricMatcher\n];\nfunction stringify(object, maxDepth = 10, { maxLength, filterNode, ...options } = {}) {\n\tconst MAX_LENGTH = maxLength ?? 1e4;\n\tlet result;\n\t// Convert string selector to filter function\n\tconst filterFn = typeof filterNode === \"string\" ? createNodeFilterFromSelector(filterNode) : filterNode;\n\tconst plugins = filterFn ? [\n\t\tReactTestComponent,\n\t\tReactElement,\n\t\tcreateDOMElementFilter(filterFn),\n\t\tDOMCollection,\n\t\tImmutable,\n\t\tAsymmetricMatcher\n\t] : PLUGINS;\n\ttry {\n\t\tresult = format$1(object, {\n\t\t\tmaxDepth,\n\t\t\tescapeString: false,\n\t\t\t// min: true,\n\t\t\tplugins,\n\t\t\t...options\n\t\t});\n\t} catch {\n\t\tresult = format$1(object, {\n\t\t\tcallToJSON: false,\n\t\t\tmaxDepth,\n\t\t\tescapeString: false,\n\t\t\t// min: true,\n\t\t\tplugins,\n\t\t\t...options\n\t\t});\n\t}\n\t// Prevents infinite loop https://github.com/vitest-dev/vitest/issues/7249\n\treturn result.length >= MAX_LENGTH && maxDepth > 1 ? stringify(object, Math.floor(Math.min(maxDepth, Number.MAX_SAFE_INTEGER) / 2), {\n\t\tmaxLength,\n\t\tfilterNode,\n\t\t...options\n\t}) : result;\n}\nfunction createNodeFilterFromSelector(selector) {\n\tconst ELEMENT_NODE = 1;\n\tconst COMMENT_NODE = 8;\n\treturn (node) => {\n\t\t// Filter out comments\n\t\tif (node.nodeType === COMMENT_NODE) return false;\n\t\t// Filter out elements matching the selector\n\t\tif (node.nodeType === ELEMENT_NODE && node.matches) try {\n\t\t\treturn !node.matches(selector);\n\t\t} catch {\n\t\t\treturn true;\n\t\t}\n\t\treturn true;\n\t};\n}\nconst formatRegExp = /%[sdjifoOc%]/g;\nfunction format(args, options = {}) {\n\tconst formatArg = (item) => inspect(item, options);\n\tif (typeof args[0] !== \"string\") {\n\t\tconst objects = [];\n\t\tfor (let i = 0; i < args.length; i++) objects.push(formatArg(args[i]));\n\t\treturn objects.join(\" \");\n\t}\n\tconst len = args.length;\n\tlet i = 1;\n\tconst template = args[0];\n\tlet str = String(template).replace(formatRegExp, (x) => {\n\t\tif (x === \"%%\") return \"%\";\n\t\tif (i >= len) return x;\n\t\tswitch (x) {\n\t\t\tcase \"%s\": {\n\t\t\t\tconst value = args[i++];\n\t\t\t\tif (typeof value === \"bigint\") return `${value.toString()}n`;\n\t\t\t\tif (typeof value === \"number\" && value === 0 && 1 / value < 0) return \"-0\";\n\t\t\t\tif (typeof value === \"object\" && value !== null) {\n\t\t\t\t\tif (typeof value.toString === \"function\" && value.toString !== Object.prototype.toString) return value.toString();\n\t\t\t\t\treturn formatArg(value);\n\t\t\t\t}\n\t\t\t\treturn String(value);\n\t\t\t}\n\t\t\tcase \"%d\": {\n\t\t\t\tconst value = args[i++];\n\t\t\t\tif (typeof value === \"bigint\") return `${value.toString()}n`;\n\t\t\t\tif (typeof value === \"symbol\") return \"NaN\";\n\t\t\t\treturn Number(value).toString();\n\t\t\t}\n\t\t\tcase \"%i\": {\n\t\t\t\tconst value = args[i++];\n\t\t\t\tif (typeof value === \"bigint\") return `${value.toString()}n`;\n\t\t\t\treturn Number.parseInt(String(value)).toString();\n\t\t\t}\n\t\t\tcase \"%f\": return Number.parseFloat(String(args[i++])).toString();\n\t\t\tcase \"%o\":\n\t\t\tcase \"%O\": return formatArg(args[i++]);\n\t\t\tcase \"%c\":\n\t\t\t\ti++;\n\t\t\t\treturn \"\";\n\t\t\tcase \"%j\": try {\n\t\t\t\treturn JSON.stringify(args[i++]);\n\t\t\t} catch (err) {\n\t\t\t\tconst m = err.message;\n\t\t\t\tif (m.includes(\"circular structure\") || m.includes(\"cyclic structures\") || m.includes(\"cyclic object\")) return \"[Circular]\";\n\t\t\t\tthrow err;\n\t\t\t}\n\t\t\tdefault: return x;\n\t\t}\n\t});\n\tfor (let x = args[i]; i < len; x = args[++i]) if (x === null || typeof x !== \"object\") str += ` ${typeof x === \"symbol\" ? x.toString() : x}`;\n\telse str += ` ${formatArg(x)}`;\n\treturn str;\n}\nfunction inspect(obj, options) {\n\tconst { truncate, multiline, ...stringifyOptions } = options ?? {};\n\tconst prettyFormatOptions = {\n\t\tsingleQuote: true,\n\t\tquoteKeys: false,\n\t\tmin: true,\n\t\tspacingInner: \" \",\n\t\tspacingOuter: \" \",\n\t\tprintBasicPrototype: false,\n\t\tcompareKeys: null,\n\t\t...multiline ? {\n\t\t\tmin: false,\n\t\t\tspacingInner: void 0,\n\t\t\tspacingOuter: void 0\n\t\t} : {}\n\t};\n\tconst threshold = truncate ?? 0;\n\tconst formatted = stringify(obj, void 0, {\n\t\t...prettyFormatOptions,\n\t\t...stringifyOptions,\n\t\tmaxLength: threshold || void 0\n\t});\n\tif (threshold === 0 || formatted.length <= threshold) return formatted;\n\t// if stringify's adaptive maxDepth (down to 1) fails to truncate enough,\n\t// - for known types (e.g. string, object, array, etc), apply best effort truncation.\n\t// - for other values, fallback to maxDepth = 0 which should can show minimal output.\n\tconst type = Object.prototype.toString.call(obj);\n\tif (typeof obj === \"string\") {\n\t\tlet end = threshold - 1;\n\t\tif (end > 0 && isHighSurrogate(formatted[end - 1])) end = end - 1;\n\t\treturn `'${formatted.slice(1, end)}…'`;\n\t}\n\tif (type === \"[object Array]\" || type === \"[object Object]\" || type === \"[object Set]\" || type === \"[object Map]\") return stringifyByMaxWidth(obj, threshold, {\n\t\t...prettyFormatOptions,\n\t\t...stringifyOptions,\n\t\tmaxDepth: 1\n\t});\n\treturn stringify(obj, void 0, {\n\t\t...prettyFormatOptions,\n\t\t...stringifyOptions,\n\t\tmaxDepth: 0\n\t});\n}\nfunction truncateString(string, maxLength) {\n\tif (string.length <= maxLength) return string;\n\tlet end = maxLength - 1;\n\tif (isHighSurrogate(string[end - 1])) end = end - 1;\n\treturn `${string.slice(0, end)}…`;\n}\nfunction stringifyByMaxWidth(object, threshold, options) {\n\tfunction evaluate(x) {\n\t\treturn stringify(object, void 0, {\n\t\t\t...options,\n\t\t\tmaxWidth: x\n\t\t});\n\t}\n\treturn evaluate(binarySearch(0, threshold, (x) => evaluate(x).length <= threshold));\n}\n// find max(x \\in [x, y) | f(x) = true)\n// if f(x0) is false, then returns x0.\nfunction binarySearch(x0, x1, f) {\n\twhile (x0 + 1 < x1) {\n\t\tconst x = Math.floor((x0 + x1) / 2);\n\t\tif (f(x)) x0 = x;\n\t\telse x1 = x;\n\t}\n\treturn x0;\n}\n// https://github.com/chaijs/loupe/pull/79\nfunction isHighSurrogate(char) {\n\treturn char >= \"\\ud800\" && char <= \"\\udbff\";\n}\n\nexport { formatRegExp as a, format as f, inspect as i, stringify as s, truncateString as t };\n","// TODO: this is all copy pasted from Vite - can they expose a module that exports only constants?\nconst KNOWN_ASSET_TYPES = [\n\t\"apng\",\n\t\"bmp\",\n\t\"png\",\n\t\"jpe?g\",\n\t\"jfif\",\n\t\"pjpeg\",\n\t\"pjp\",\n\t\"gif\",\n\t\"svg\",\n\t\"ico\",\n\t\"webp\",\n\t\"avif\",\n\t\"mp4\",\n\t\"webm\",\n\t\"ogg\",\n\t\"mp3\",\n\t\"wav\",\n\t\"flac\",\n\t\"aac\",\n\t\"woff2?\",\n\t\"eot\",\n\t\"ttf\",\n\t\"otf\",\n\t\"webmanifest\",\n\t\"pdf\",\n\t\"txt\"\n];\nconst KNOWN_ASSET_RE = new RegExp(`\\\\.(${KNOWN_ASSET_TYPES.join(\"|\")})$`);\nconst CSS_LANGS_RE = /\\.(css|less|sass|scss|styl|stylus|pcss|postcss|sss)(?:$|\\?)/;\n/**\n* Prefix for resolved Ids that are not valid browser import specifiers\n*/\nconst VALID_ID_PREFIX = `/@id/`;\n/**\n* Plugins that use 'virtual modules' (e.g. for helper functions), prefix the\n* module ID with `\\0`, a convention from the rollup ecosystem.\n* This prevents other plugins from trying to process the id (like node resolution),\n* and core features like sourcemaps can use this info to differentiate between\n* virtual modules and regular files.\n* `\\0` is not a permitted char in import URLs so we have to replace them during\n* import analysis. The id will be decoded back before entering the plugins pipeline.\n* These encoded virtual ids are also prefixed by the VALID_ID_PREFIX, so virtual\n* modules in the browser end up encoded as `/@id/__x00__{id}`\n*/\nconst NULL_BYTE_PLACEHOLDER = `__x00__`;\n\n/**\n* Get original stacktrace without source map support the most performant way.\n* - Create only 1 stack frame.\n* - Rewrite prepareStackTrace to bypass \"support-stack-trace\" (usually takes ~250ms).\n*/\nfunction createSimpleStackTrace(options) {\n\tconst { message = \"$$stack trace error\", stackTraceLimit = 1 } = options || {};\n\tconst limit = Error.stackTraceLimit;\n\tconst prepareStackTrace = Error.prepareStackTrace;\n\tError.stackTraceLimit = stackTraceLimit;\n\tError.prepareStackTrace = (e) => e.stack;\n\tconst stackTrace = new Error(message).stack || \"\";\n\tError.prepareStackTrace = prepareStackTrace;\n\tError.stackTraceLimit = limit;\n\treturn stackTrace;\n}\nfunction notNullish(v) {\n\treturn v != null;\n}\nfunction assertTypes(value, name, types) {\n\tconst receivedType = typeof value;\n\tif (!types.includes(receivedType)) throw new TypeError(`${name} value must be ${types.join(\" or \")}, received \"${receivedType}\"`);\n}\nfunction isPrimitive(value) {\n\treturn value === null || typeof value !== \"function\" && typeof value !== \"object\";\n}\nfunction slash(path) {\n\treturn path.replace(/\\\\/g, \"/\");\n}\nconst postfixRE = /[?#].*$/;\nfunction cleanUrl(url) {\n\treturn url.replace(postfixRE, \"\");\n}\nfunction splitFileAndPostfix(path) {\n\tconst file = cleanUrl(path);\n\treturn {\n\t\tfile,\n\t\tpostfix: path.slice(file.length)\n\t};\n}\nconst externalRE = /^(?:[a-z]+:)?\\/\\//;\nconst isExternalUrl = (url) => externalRE.test(url);\n/**\n* Prepend `/@id/` and replace null byte so the id is URL-safe.\n* This is prepended to resolved ids that are not valid browser\n* import specifiers by the importAnalysis plugin.\n*/\nfunction wrapId(id) {\n\treturn id.startsWith(VALID_ID_PREFIX) ? id : VALID_ID_PREFIX + id.replace(\"\\0\", NULL_BYTE_PLACEHOLDER);\n}\n/**\n* Undo {@link wrapId}'s `/@id/` and null byte replacements.\n*/\nfunction unwrapId(id) {\n\treturn id.startsWith(VALID_ID_PREFIX) ? id.slice(VALID_ID_PREFIX.length).replace(NULL_BYTE_PLACEHOLDER, \"\\0\") : id;\n}\nfunction withTrailingSlash(path) {\n\tif (path.at(-1) !== \"/\") return `${path}/`;\n\treturn path;\n}\nfunction filterOutComments(s) {\n\tconst result = [];\n\tlet commentState = \"none\";\n\tfor (let i = 0; i < s.length; ++i) if (commentState === \"singleline\") {\n\t\tif (s[i] === \"\\n\") commentState = \"none\";\n\t} else if (commentState === \"multiline\") {\n\t\tif (s[i - 1] === \"*\" && s[i] === \"/\") commentState = \"none\";\n\t} else if (commentState === \"none\") if (s[i] === \"/\" && s[i + 1] === \"/\") commentState = \"singleline\";\n\telse if (s[i] === \"/\" && s[i + 1] === \"*\") {\n\t\tcommentState = \"multiline\";\n\t\ti += 2;\n\t} else result.push(s[i]);\n\treturn result.join(\"\");\n}\nconst bareImportRE = /^(?![a-z]:)[\\w@](?!.*:\\/\\/)/i;\nfunction isBareImport(id) {\n\treturn bareImportRE.test(id);\n}\nfunction toArray(array) {\n\tarray ??= [];\n\tif (Array.isArray(array)) return array;\n\treturn [array];\n}\nfunction isObject(item) {\n\treturn item != null && typeof item === \"object\" && !Array.isArray(item);\n}\nfunction isFinalObj(obj) {\n\treturn obj === Object.prototype || obj === Function.prototype || obj === RegExp.prototype;\n}\nfunction getType(value) {\n\treturn Object.prototype.toString.apply(value).slice(8, -1);\n}\nfunction collectOwnProperties(obj, collector) {\n\tconst collect = typeof collector === \"function\" ? collector : (key) => collector.add(key);\n\tObject.getOwnPropertyNames(obj).forEach(collect);\n\tObject.getOwnPropertySymbols(obj).forEach(collect);\n}\nfunction getOwnProperties(obj) {\n\tconst ownProps = /* @__PURE__ */ new Set();\n\tif (isFinalObj(obj)) return [];\n\tcollectOwnProperties(obj, ownProps);\n\treturn Array.from(ownProps);\n}\nconst defaultCloneOptions = { forceWritable: false };\nfunction deepClone(val, options = defaultCloneOptions) {\n\treturn clone(val, /* @__PURE__ */ new WeakMap(), options);\n}\nfunction clone(val, seen, options = defaultCloneOptions) {\n\tlet k, out;\n\tif (seen.has(val)) return seen.get(val);\n\tif (Array.isArray(val)) {\n\t\tout = Array.from({ length: k = val.length });\n\t\tseen.set(val, out);\n\t\twhile (k--) out[k] = clone(val[k], seen, options);\n\t\treturn out;\n\t}\n\tif (Object.prototype.toString.call(val) === \"[object Object]\") {\n\t\tout = Object.create(Object.getPrototypeOf(val));\n\t\tseen.set(val, out);\n\t\t// we don't need properties from prototype\n\t\tconst props = getOwnProperties(val);\n\t\tfor (const k of props) {\n\t\t\tconst descriptor = Object.getOwnPropertyDescriptor(val, k);\n\t\t\tif (!descriptor) continue;\n\t\t\tconst cloned = clone(val[k], seen, options);\n\t\t\tif (options.forceWritable) Object.defineProperty(out, k, {\n\t\t\t\tenumerable: descriptor.enumerable,\n\t\t\t\tconfigurable: true,\n\t\t\t\twritable: true,\n\t\t\t\tvalue: cloned\n\t\t\t});\n\t\t\telse if (\"get\" in descriptor) Object.defineProperty(out, k, {\n\t\t\t\t...descriptor,\n\t\t\t\tget() {\n\t\t\t\t\treturn cloned;\n\t\t\t\t}\n\t\t\t});\n\t\t\telse Object.defineProperty(out, k, {\n\t\t\t\t...descriptor,\n\t\t\t\tvalue: cloned\n\t\t\t});\n\t\t}\n\t\treturn out;\n\t}\n\treturn val;\n}\nfunction noop() {}\nfunction objectAttr(source, path, defaultValue = void 0) {\n\t// a[3].b -> a.3.b\n\tconst paths = path.replace(/\\[(\\d+)\\]/g, \".$1\").split(\".\");\n\tlet result = source;\n\tfor (const p of paths) {\n\t\tresult = new Object(result)[p];\n\t\tif (result === void 0) return defaultValue;\n\t}\n\treturn result;\n}\nfunction createDefer() {\n\tlet resolve = null;\n\tlet reject = null;\n\tconst p = new Promise((_resolve, _reject) => {\n\t\tresolve = _resolve;\n\t\treject = _reject;\n\t});\n\tp.resolve = resolve;\n\tp.reject = reject;\n\treturn p;\n}\n/**\n* If code starts with a function call, will return its last index, respecting arguments.\n* This will return 25 - last ending character of toMatch \")\"\n* Also works with callbacks\n* ```\n* toMatch({ test: '123' });\n* toBeAliased('123')\n* ```\n*/\nfunction getCallLastIndex(code) {\n\tlet charIndex = -1;\n\tlet inString = null;\n\tlet startedBracers = 0;\n\tlet endedBracers = 0;\n\tlet beforeChar = null;\n\twhile (charIndex <= code.length) {\n\t\tbeforeChar = code[charIndex];\n\t\tcharIndex++;\n\t\tconst char = code[charIndex];\n\t\tif ((char === \"\\\"\" || char === \"'\" || char === \"`\") && beforeChar !== \"\\\\\") {\n\t\t\tif (inString === char) inString = null;\n\t\t\telse if (!inString) inString = char;\n\t\t}\n\t\tif (!inString) {\n\t\t\tif (char === \"(\") startedBracers++;\n\t\t\tif (char === \")\") endedBracers++;\n\t\t}\n\t\tif (startedBracers && endedBracers && startedBracers === endedBracers) return charIndex;\n\t}\n\treturn null;\n}\nfunction isNegativeNaN(val) {\n\tif (!Number.isNaN(val)) return false;\n\tconst f64 = /* @__PURE__ */ new Float64Array(1);\n\tf64[0] = val;\n\treturn new Uint32Array(f64.buffer)[1] >>> 31 === 1;\n}\nfunction toString(v) {\n\treturn Object.prototype.toString.call(v);\n}\nfunction isPlainObject(val) {\n\treturn toString(val) === \"[object Object]\" && (!val.constructor || val.constructor.name === \"Object\");\n}\nfunction isMergeableObject(item) {\n\treturn isPlainObject(item) && !Array.isArray(item);\n}\nfunction ordinal(i) {\n\tconst j = i % 10;\n\tconst k = i % 100;\n\tif (j === 1 && k !== 11) return `${i}st`;\n\tif (j === 2 && k !== 12) return `${i}nd`;\n\tif (j === 3 && k !== 13) return `${i}rd`;\n\treturn `${i}th`;\n}\n/**\n* Deep merge :P\n*\n* Will merge objects only if they are plain\n*\n* Do not merge types - it is very expensive and usually it's better to case a type here\n*/\nfunction deepMerge(target, ...sources) {\n\tif (!sources.length) return target;\n\tconst source = sources.shift();\n\tif (source === void 0) return target;\n\tif (isMergeableObject(target) && isMergeableObject(source)) Object.keys(source).forEach((key) => {\n\t\tif (key === \"__proto__\" || key === \"constructor\" || key === \"prototype\") return;\n\t\tconst _source = source;\n\t\tif (isMergeableObject(_source[key])) {\n\t\t\tif (!target[key]) target[key] = {};\n\t\t\tdeepMerge(target[key], _source[key]);\n\t\t} else target[key] = _source[key];\n\t});\n\treturn deepMerge(target, ...sources);\n}\nfunction unique(array) {\n\treturn Array.from(new Set(array));\n}\nfunction sanitizeFilePath(s) {\n\t// eslint-disable-next-line no-control-regex\n\treturn s.replace(/[\\x00-\\x2C\\x2E\\x2F\\x3A-\\x40\\x5B-\\x60\\x7B-\\x7F]+/g, \"-\");\n}\n\nconst _DRIVE_LETTER_START_RE = /^[A-Za-z]:\\//;\nfunction normalizeWindowsPath(input = \"\") {\n  if (!input) {\n    return input;\n  }\n  return input.replace(/\\\\/g, \"/\").replace(_DRIVE_LETTER_START_RE, (r) => r.toUpperCase());\n}\n\nconst _UNC_REGEX = /^[/\\\\]{2}/;\nconst _IS_ABSOLUTE_RE = /^[/\\\\](?![/\\\\])|^[/\\\\]{2}(?!\\.)|^[A-Za-z]:[/\\\\]/;\nconst _DRIVE_LETTER_RE = /^[A-Za-z]:$/;\nconst _ROOT_FOLDER_RE = /^\\/([A-Za-z]:)?$/;\nconst _EXTNAME_RE = /.(\\.[^./]+|\\.)$/;\nconst normalize = function(path) {\n  if (path.length === 0) {\n    return \".\";\n  }\n  path = normalizeWindowsPath(path);\n  const isUNCPath = path.match(_UNC_REGEX);\n  const isPathAbsolute = isAbsolute(path);\n  const trailingSeparator = path[path.length - 1] === \"/\";\n  path = normalizeString(path, !isPathAbsolute);\n  if (path.length === 0) {\n    if (isPathAbsolute) {\n      return \"/\";\n    }\n    return trailingSeparator ? \"./\" : \".\";\n  }\n  if (trailingSeparator) {\n    path += \"/\";\n  }\n  if (_DRIVE_LETTER_RE.test(path)) {\n    path += \"/\";\n  }\n  if (isUNCPath) {\n    if (!isPathAbsolute) {\n      return `//./${path}`;\n    }\n    return `//${path}`;\n  }\n  return isPathAbsolute && !isAbsolute(path) ? `/${path}` : path;\n};\nconst join = function(...segments) {\n  let path = \"\";\n  for (const seg of segments) {\n    if (!seg) {\n      continue;\n    }\n    if (path.length > 0) {\n      const pathTrailing = path[path.length - 1] === \"/\";\n      const segLeading = seg[0] === \"/\";\n      const both = pathTrailing && segLeading;\n      if (both) {\n        path += seg.slice(1);\n      } else {\n        path += pathTrailing || segLeading ? seg : `/${seg}`;\n      }\n    } else {\n      path += seg;\n    }\n  }\n  return normalize(path);\n};\nfunction cwd() {\n  if (typeof process !== \"undefined\" && typeof process.cwd === \"function\") {\n    return process.cwd().replace(/\\\\/g, \"/\");\n  }\n  return \"/\";\n}\nconst resolve = function(...arguments_) {\n  arguments_ = arguments_.map((argument) => normalizeWindowsPath(argument));\n  let resolvedPath = \"\";\n  let resolvedAbsolute = false;\n  for (let index = arguments_.length - 1; index >= -1 && !resolvedAbsolute; index--) {\n    const path = index >= 0 ? arguments_[index] : cwd();\n    if (!path || path.length === 0) {\n      continue;\n    }\n    resolvedPath = `${path}/${resolvedPath}`;\n    resolvedAbsolute = isAbsolute(path);\n  }\n  resolvedPath = normalizeString(resolvedPath, !resolvedAbsolute);\n  if (resolvedAbsolute && !isAbsolute(resolvedPath)) {\n    return `/${resolvedPath}`;\n  }\n  return resolvedPath.length > 0 ? resolvedPath : \".\";\n};\nfunction normalizeString(path, allowAboveRoot) {\n  let res = \"\";\n  let lastSegmentLength = 0;\n  let lastSlash = -1;\n  let dots = 0;\n  let char = null;\n  for (let index = 0; index <= path.length; ++index) {\n    if (index < path.length) {\n      char = path[index];\n    } else if (char === \"/\") {\n      break;\n    } else {\n      char = \"/\";\n    }\n    if (char === \"/\") {\n      if (lastSlash === index - 1 || dots === 1) ; else if (dots === 2) {\n        if (res.length < 2 || lastSegmentLength !== 2 || res[res.length - 1] !== \".\" || res[res.length - 2] !== \".\") {\n          if (res.length > 2) {\n            const lastSlashIndex = res.lastIndexOf(\"/\");\n            if (lastSlashIndex === -1) {\n              res = \"\";\n              lastSegmentLength = 0;\n            } else {\n              res = res.slice(0, lastSlashIndex);\n              lastSegmentLength = res.length - 1 - res.lastIndexOf(\"/\");\n            }\n            lastSlash = index;\n            dots = 0;\n            continue;\n          } else if (res.length > 0) {\n            res = \"\";\n            lastSegmentLength = 0;\n            lastSlash = index;\n            dots = 0;\n            continue;\n          }\n        }\n        if (allowAboveRoot) {\n          res += res.length > 0 ? \"/..\" : \"..\";\n          lastSegmentLength = 2;\n        }\n      } else {\n        if (res.length > 0) {\n          res += `/${path.slice(lastSlash + 1, index)}`;\n        } else {\n          res = path.slice(lastSlash + 1, index);\n        }\n        lastSegmentLength = index - lastSlash - 1;\n      }\n      lastSlash = index;\n      dots = 0;\n    } else if (char === \".\" && dots !== -1) {\n      ++dots;\n    } else {\n      dots = -1;\n    }\n  }\n  return res;\n}\nconst isAbsolute = function(p) {\n  return _IS_ABSOLUTE_RE.test(p);\n};\nconst extname = function(p) {\n  if (p === \"..\") return \"\";\n  const match = _EXTNAME_RE.exec(normalizeWindowsPath(p));\n  return match && match[1] || \"\";\n};\nconst relative = function(from, to) {\n  const _from = resolve(from).replace(_ROOT_FOLDER_RE, \"$1\").split(\"/\");\n  const _to = resolve(to).replace(_ROOT_FOLDER_RE, \"$1\").split(\"/\");\n  if (_to[0][1] === \":\" && _from[0][1] === \":\" && _from[0] !== _to[0]) {\n    return _to.join(\"/\");\n  }\n  const _fromCopy = [..._from];\n  for (const segment of _fromCopy) {\n    if (_to[0] !== segment) {\n      break;\n    }\n    _from.shift();\n    _to.shift();\n  }\n  return [..._from.map(() => \"..\"), ..._to].join(\"/\");\n};\nconst dirname = function(p) {\n  const segments = normalizeWindowsPath(p).replace(/\\/$/, \"\").split(\"/\").slice(0, -1);\n  if (segments.length === 1 && _DRIVE_LETTER_RE.test(segments[0])) {\n    segments[0] += \"/\";\n  }\n  return segments.join(\"/\") || (isAbsolute(p) ? \"/\" : \".\");\n};\nconst basename = function(p, extension) {\n  const segments = normalizeWindowsPath(p).split(\"/\");\n  let lastSegment = \"\";\n  for (let i = segments.length - 1; i >= 0; i--) {\n    const val = segments[i];\n    if (val) {\n      lastSegment = val;\n      break;\n    }\n  }\n  return extension && lastSegment.endsWith(extension) ? lastSegment.slice(0, -extension.length) : lastSegment;\n};\n\nexport { objectAttr as A, getCallLastIndex as B, CSS_LANGS_RE as C, noop as D, createSimpleStackTrace as E, withTrailingSlash as F, wrapId as G, isExternalUrl as H, unwrapId as I, deepMerge as J, KNOWN_ASSET_TYPES as K, sanitizeFilePath as L, relative as a, basename as b, cleanUrl as c, dirname as d, createDefer as e, extname as f, getType as g, KNOWN_ASSET_RE as h, isAbsolute as i, join as j, splitFileAndPostfix as k, isBareImport as l, isPrimitive as m, normalize as n, notNullish as o, deepClone as p, getOwnProperties as q, resolve as r, slash as s, toArray as t, isObject as u, filterOutComments as v, ordinal as w, assertTypes as x, isNegativeNaN as y, unique as z };\n","import { m as isPrimitive, o as notNullish, r as resolve$1 } from './pathe.M-eThtNZ.DwEga6ro.js';\n\nvar commonjsGlobal = typeof globalThis !== \"undefined\" ? globalThis : typeof window !== \"undefined\" ? window : typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : {};\nfunction getDefaultExportFromCjs(x) {\n\treturn x && x.__esModule && Object.prototype.hasOwnProperty.call(x, \"default\") ? x[\"default\"] : x;\n}\n\nvar build = {};\n\nvar hasRequiredBuild;\n\nfunction requireBuild () {\n\tif (hasRequiredBuild) return build;\n\thasRequiredBuild = 1;\n\n\tObject.defineProperty(build, '__esModule', {\n\t  value: true\n\t});\n\tbuild.default = diffSequence;\n\t/**\n\t * Copyright (c) Meta Platforms, Inc. and affiliates.\n\t *\n\t * This source code is licensed under the MIT license found in the\n\t * LICENSE file in the root directory of this source tree.\n\t *\n\t */\n\n\t// This diff-sequences package implements the linear space variation in\n\t// An O(ND) Difference Algorithm and Its Variations by Eugene W. Myers\n\n\t// Relationship in notation between Myers paper and this package:\n\t// A is a\n\t// N is aLength, aEnd - aStart, and so on\n\t// x is aIndex, aFirst, aLast, and so on\n\t// B is b\n\t// M is bLength, bEnd - bStart, and so on\n\t// y is bIndex, bFirst, bLast, and so on\n\t// Δ = N - M is negative of baDeltaLength = bLength - aLength\n\t// D is d\n\t// k is kF\n\t// k + Δ is kF = kR - baDeltaLength\n\t// V is aIndexesF or aIndexesR (see comment below about Indexes type)\n\t// index intervals [1, N] and [1, M] are [0, aLength) and [0, bLength)\n\t// starting point in forward direction (0, 0) is (-1, -1)\n\t// starting point in reverse direction (N + 1, M + 1) is (aLength, bLength)\n\n\t// The “edit graph” for sequences a and b corresponds to items:\n\t// in a on the horizontal axis\n\t// in b on the vertical axis\n\t//\n\t// Given a-coordinate of a point in a diagonal, you can compute b-coordinate.\n\t//\n\t// Forward diagonals kF:\n\t// zero diagonal intersects top left corner\n\t// positive diagonals intersect top edge\n\t// negative diagonals insersect left edge\n\t//\n\t// Reverse diagonals kR:\n\t// zero diagonal intersects bottom right corner\n\t// positive diagonals intersect right edge\n\t// negative diagonals intersect bottom edge\n\n\t// The graph contains a directed acyclic graph of edges:\n\t// horizontal: delete an item from a\n\t// vertical: insert an item from b\n\t// diagonal: common item in a and b\n\t//\n\t// The algorithm solves dual problems in the graph analogy:\n\t// Find longest common subsequence: path with maximum number of diagonal edges\n\t// Find shortest edit script: path with minimum number of non-diagonal edges\n\n\t// Input callback function compares items at indexes in the sequences.\n\n\t// Output callback function receives the number of adjacent items\n\t// and starting indexes of each common subsequence.\n\t// Either original functions or wrapped to swap indexes if graph is transposed.\n\t// Indexes in sequence a of last point of forward or reverse paths in graph.\n\t// Myers algorithm indexes by diagonal k which for negative is bad deopt in V8.\n\t// This package indexes by iF and iR which are greater than or equal to zero.\n\t// and also updates the index arrays in place to cut memory in half.\n\t// kF = 2 * iF - d\n\t// kR = d - 2 * iR\n\t// Division of index intervals in sequences a and b at the middle change.\n\t// Invariant: intervals do not have common items at the start or end.\n\tconst pkg = 'diff-sequences'; // for error messages\n\tconst NOT_YET_SET = 0; // small int instead of undefined to avoid deopt in V8\n\n\t// Return the number of common items that follow in forward direction.\n\t// The length of what Myers paper calls a “snake” in a forward path.\n\tconst countCommonItemsF = (aIndex, aEnd, bIndex, bEnd, isCommon) => {\n\t  let nCommon = 0;\n\t  while (aIndex < aEnd && bIndex < bEnd && isCommon(aIndex, bIndex)) {\n\t    aIndex += 1;\n\t    bIndex += 1;\n\t    nCommon += 1;\n\t  }\n\t  return nCommon;\n\t};\n\n\t// Return the number of common items that precede in reverse direction.\n\t// The length of what Myers paper calls a “snake” in a reverse path.\n\tconst countCommonItemsR = (aStart, aIndex, bStart, bIndex, isCommon) => {\n\t  let nCommon = 0;\n\t  while (aStart <= aIndex && bStart <= bIndex && isCommon(aIndex, bIndex)) {\n\t    aIndex -= 1;\n\t    bIndex -= 1;\n\t    nCommon += 1;\n\t  }\n\t  return nCommon;\n\t};\n\n\t// A simple function to extend forward paths from (d - 1) to d changes\n\t// when forward and reverse paths cannot yet overlap.\n\tconst extendPathsF = (\n\t  d,\n\t  aEnd,\n\t  bEnd,\n\t  bF,\n\t  isCommon,\n\t  aIndexesF,\n\t  iMaxF // return the value because optimization might decrease it\n\t) => {\n\t  // Unroll the first iteration.\n\t  let iF = 0;\n\t  let kF = -d; // kF = 2 * iF - d\n\t  let aFirst = aIndexesF[iF]; // in first iteration always insert\n\t  let aIndexPrev1 = aFirst; // prev value of [iF - 1] in next iteration\n\t  aIndexesF[iF] += countCommonItemsF(\n\t    aFirst + 1,\n\t    aEnd,\n\t    bF + aFirst - kF + 1,\n\t    bEnd,\n\t    isCommon\n\t  );\n\n\t  // Optimization: skip diagonals in which paths cannot ever overlap.\n\t  const nF = d < iMaxF ? d : iMaxF;\n\n\t  // The diagonals kF are odd when d is odd and even when d is even.\n\t  for (iF += 1, kF += 2; iF <= nF; iF += 1, kF += 2) {\n\t    // To get first point of path segment, move one change in forward direction\n\t    // from last point of previous path segment in an adjacent diagonal.\n\t    // In last possible iteration when iF === d and kF === d always delete.\n\t    if (iF !== d && aIndexPrev1 < aIndexesF[iF]) {\n\t      aFirst = aIndexesF[iF]; // vertical to insert from b\n\t    } else {\n\t      aFirst = aIndexPrev1 + 1; // horizontal to delete from a\n\n\t      if (aEnd <= aFirst) {\n\t        // Optimization: delete moved past right of graph.\n\t        return iF - 1;\n\t      }\n\t    }\n\n\t    // To get last point of path segment, move along diagonal of common items.\n\t    aIndexPrev1 = aIndexesF[iF];\n\t    aIndexesF[iF] =\n\t      aFirst +\n\t      countCommonItemsF(aFirst + 1, aEnd, bF + aFirst - kF + 1, bEnd, isCommon);\n\t  }\n\t  return iMaxF;\n\t};\n\n\t// A simple function to extend reverse paths from (d - 1) to d changes\n\t// when reverse and forward paths cannot yet overlap.\n\tconst extendPathsR = (\n\t  d,\n\t  aStart,\n\t  bStart,\n\t  bR,\n\t  isCommon,\n\t  aIndexesR,\n\t  iMaxR // return the value because optimization might decrease it\n\t) => {\n\t  // Unroll the first iteration.\n\t  let iR = 0;\n\t  let kR = d; // kR = d - 2 * iR\n\t  let aFirst = aIndexesR[iR]; // in first iteration always insert\n\t  let aIndexPrev1 = aFirst; // prev value of [iR - 1] in next iteration\n\t  aIndexesR[iR] -= countCommonItemsR(\n\t    aStart,\n\t    aFirst - 1,\n\t    bStart,\n\t    bR + aFirst - kR - 1,\n\t    isCommon\n\t  );\n\n\t  // Optimization: skip diagonals in which paths cannot ever overlap.\n\t  const nR = d < iMaxR ? d : iMaxR;\n\n\t  // The diagonals kR are odd when d is odd and even when d is even.\n\t  for (iR += 1, kR -= 2; iR <= nR; iR += 1, kR -= 2) {\n\t    // To get first point of path segment, move one change in reverse direction\n\t    // from last point of previous path segment in an adjacent diagonal.\n\t    // In last possible iteration when iR === d and kR === -d always delete.\n\t    if (iR !== d && aIndexesR[iR] < aIndexPrev1) {\n\t      aFirst = aIndexesR[iR]; // vertical to insert from b\n\t    } else {\n\t      aFirst = aIndexPrev1 - 1; // horizontal to delete from a\n\n\t      if (aFirst < aStart) {\n\t        // Optimization: delete moved past left of graph.\n\t        return iR - 1;\n\t      }\n\t    }\n\n\t    // To get last point of path segment, move along diagonal of common items.\n\t    aIndexPrev1 = aIndexesR[iR];\n\t    aIndexesR[iR] =\n\t      aFirst -\n\t      countCommonItemsR(\n\t        aStart,\n\t        aFirst - 1,\n\t        bStart,\n\t        bR + aFirst - kR - 1,\n\t        isCommon\n\t      );\n\t  }\n\t  return iMaxR;\n\t};\n\n\t// A complete function to extend forward paths from (d - 1) to d changes.\n\t// Return true if a path overlaps reverse path of (d - 1) changes in its diagonal.\n\tconst extendOverlappablePathsF = (\n\t  d,\n\t  aStart,\n\t  aEnd,\n\t  bStart,\n\t  bEnd,\n\t  isCommon,\n\t  aIndexesF,\n\t  iMaxF,\n\t  aIndexesR,\n\t  iMaxR,\n\t  division // update prop values if return true\n\t) => {\n\t  const bF = bStart - aStart; // bIndex = bF + aIndex - kF\n\t  const aLength = aEnd - aStart;\n\t  const bLength = bEnd - bStart;\n\t  const baDeltaLength = bLength - aLength; // kF = kR - baDeltaLength\n\n\t  // Range of diagonals in which forward and reverse paths might overlap.\n\t  const kMinOverlapF = -baDeltaLength - (d - 1); // -(d - 1) <= kR\n\t  const kMaxOverlapF = -baDeltaLength + (d - 1); // kR <= (d - 1)\n\n\t  let aIndexPrev1 = NOT_YET_SET; // prev value of [iF - 1] in next iteration\n\n\t  // Optimization: skip diagonals in which paths cannot ever overlap.\n\t  const nF = d < iMaxF ? d : iMaxF;\n\n\t  // The diagonals kF = 2 * iF - d are odd when d is odd and even when d is even.\n\t  for (let iF = 0, kF = -d; iF <= nF; iF += 1, kF += 2) {\n\t    // To get first point of path segment, move one change in forward direction\n\t    // from last point of previous path segment in an adjacent diagonal.\n\t    // In first iteration when iF === 0 and kF === -d always insert.\n\t    // In last possible iteration when iF === d and kF === d always delete.\n\t    const insert = iF === 0 || (iF !== d && aIndexPrev1 < aIndexesF[iF]);\n\t    const aLastPrev = insert ? aIndexesF[iF] : aIndexPrev1;\n\t    const aFirst = insert\n\t      ? aLastPrev // vertical to insert from b\n\t      : aLastPrev + 1; // horizontal to delete from a\n\n\t    // To get last point of path segment, move along diagonal of common items.\n\t    const bFirst = bF + aFirst - kF;\n\t    const nCommonF = countCommonItemsF(\n\t      aFirst + 1,\n\t      aEnd,\n\t      bFirst + 1,\n\t      bEnd,\n\t      isCommon\n\t    );\n\t    const aLast = aFirst + nCommonF;\n\t    aIndexPrev1 = aIndexesF[iF];\n\t    aIndexesF[iF] = aLast;\n\t    if (kMinOverlapF <= kF && kF <= kMaxOverlapF) {\n\t      // Solve for iR of reverse path with (d - 1) changes in diagonal kF:\n\t      // kR = kF + baDeltaLength\n\t      // kR = (d - 1) - 2 * iR\n\t      const iR = (d - 1 - (kF + baDeltaLength)) / 2;\n\n\t      // If this forward path overlaps the reverse path in this diagonal,\n\t      // then this is the middle change of the index intervals.\n\t      if (iR <= iMaxR && aIndexesR[iR] - 1 <= aLast) {\n\t        // Unlike the Myers algorithm which finds only the middle “snake”\n\t        // this package can find two common subsequences per division.\n\t        // Last point of previous path segment is on an adjacent diagonal.\n\t        const bLastPrev = bF + aLastPrev - (insert ? kF + 1 : kF - 1);\n\n\t        // Because of invariant that intervals preceding the middle change\n\t        // cannot have common items at the end,\n\t        // move in reverse direction along a diagonal of common items.\n\t        const nCommonR = countCommonItemsR(\n\t          aStart,\n\t          aLastPrev,\n\t          bStart,\n\t          bLastPrev,\n\t          isCommon\n\t        );\n\t        const aIndexPrevFirst = aLastPrev - nCommonR;\n\t        const bIndexPrevFirst = bLastPrev - nCommonR;\n\t        const aEndPreceding = aIndexPrevFirst + 1;\n\t        const bEndPreceding = bIndexPrevFirst + 1;\n\t        division.nChangePreceding = d - 1;\n\t        if (d - 1 === aEndPreceding + bEndPreceding - aStart - bStart) {\n\t          // Optimization: number of preceding changes in forward direction\n\t          // is equal to number of items in preceding interval,\n\t          // therefore it cannot contain any common items.\n\t          division.aEndPreceding = aStart;\n\t          division.bEndPreceding = bStart;\n\t        } else {\n\t          division.aEndPreceding = aEndPreceding;\n\t          division.bEndPreceding = bEndPreceding;\n\t        }\n\t        division.nCommonPreceding = nCommonR;\n\t        if (nCommonR !== 0) {\n\t          division.aCommonPreceding = aEndPreceding;\n\t          division.bCommonPreceding = bEndPreceding;\n\t        }\n\t        division.nCommonFollowing = nCommonF;\n\t        if (nCommonF !== 0) {\n\t          division.aCommonFollowing = aFirst + 1;\n\t          division.bCommonFollowing = bFirst + 1;\n\t        }\n\t        const aStartFollowing = aLast + 1;\n\t        const bStartFollowing = bFirst + nCommonF + 1;\n\t        division.nChangeFollowing = d - 1;\n\t        if (d - 1 === aEnd + bEnd - aStartFollowing - bStartFollowing) {\n\t          // Optimization: number of changes in reverse direction\n\t          // is equal to number of items in following interval,\n\t          // therefore it cannot contain any common items.\n\t          division.aStartFollowing = aEnd;\n\t          division.bStartFollowing = bEnd;\n\t        } else {\n\t          division.aStartFollowing = aStartFollowing;\n\t          division.bStartFollowing = bStartFollowing;\n\t        }\n\t        return true;\n\t      }\n\t    }\n\t  }\n\t  return false;\n\t};\n\n\t// A complete function to extend reverse paths from (d - 1) to d changes.\n\t// Return true if a path overlaps forward path of d changes in its diagonal.\n\tconst extendOverlappablePathsR = (\n\t  d,\n\t  aStart,\n\t  aEnd,\n\t  bStart,\n\t  bEnd,\n\t  isCommon,\n\t  aIndexesF,\n\t  iMaxF,\n\t  aIndexesR,\n\t  iMaxR,\n\t  division // update prop values if return true\n\t) => {\n\t  const bR = bEnd - aEnd; // bIndex = bR + aIndex - kR\n\t  const aLength = aEnd - aStart;\n\t  const bLength = bEnd - bStart;\n\t  const baDeltaLength = bLength - aLength; // kR = kF + baDeltaLength\n\n\t  // Range of diagonals in which forward and reverse paths might overlap.\n\t  const kMinOverlapR = baDeltaLength - d; // -d <= kF\n\t  const kMaxOverlapR = baDeltaLength + d; // kF <= d\n\n\t  let aIndexPrev1 = NOT_YET_SET; // prev value of [iR - 1] in next iteration\n\n\t  // Optimization: skip diagonals in which paths cannot ever overlap.\n\t  const nR = d < iMaxR ? d : iMaxR;\n\n\t  // The diagonals kR = d - 2 * iR are odd when d is odd and even when d is even.\n\t  for (let iR = 0, kR = d; iR <= nR; iR += 1, kR -= 2) {\n\t    // To get first point of path segment, move one change in reverse direction\n\t    // from last point of previous path segment in an adjacent diagonal.\n\t    // In first iteration when iR === 0 and kR === d always insert.\n\t    // In last possible iteration when iR === d and kR === -d always delete.\n\t    const insert = iR === 0 || (iR !== d && aIndexesR[iR] < aIndexPrev1);\n\t    const aLastPrev = insert ? aIndexesR[iR] : aIndexPrev1;\n\t    const aFirst = insert\n\t      ? aLastPrev // vertical to insert from b\n\t      : aLastPrev - 1; // horizontal to delete from a\n\n\t    // To get last point of path segment, move along diagonal of common items.\n\t    const bFirst = bR + aFirst - kR;\n\t    const nCommonR = countCommonItemsR(\n\t      aStart,\n\t      aFirst - 1,\n\t      bStart,\n\t      bFirst - 1,\n\t      isCommon\n\t    );\n\t    const aLast = aFirst - nCommonR;\n\t    aIndexPrev1 = aIndexesR[iR];\n\t    aIndexesR[iR] = aLast;\n\t    if (kMinOverlapR <= kR && kR <= kMaxOverlapR) {\n\t      // Solve for iF of forward path with d changes in diagonal kR:\n\t      // kF = kR - baDeltaLength\n\t      // kF = 2 * iF - d\n\t      const iF = (d + (kR - baDeltaLength)) / 2;\n\n\t      // If this reverse path overlaps the forward path in this diagonal,\n\t      // then this is a middle change of the index intervals.\n\t      if (iF <= iMaxF && aLast - 1 <= aIndexesF[iF]) {\n\t        const bLast = bFirst - nCommonR;\n\t        division.nChangePreceding = d;\n\t        if (d === aLast + bLast - aStart - bStart) {\n\t          // Optimization: number of changes in reverse direction\n\t          // is equal to number of items in preceding interval,\n\t          // therefore it cannot contain any common items.\n\t          division.aEndPreceding = aStart;\n\t          division.bEndPreceding = bStart;\n\t        } else {\n\t          division.aEndPreceding = aLast;\n\t          division.bEndPreceding = bLast;\n\t        }\n\t        division.nCommonPreceding = nCommonR;\n\t        if (nCommonR !== 0) {\n\t          // The last point of reverse path segment is start of common subsequence.\n\t          division.aCommonPreceding = aLast;\n\t          division.bCommonPreceding = bLast;\n\t        }\n\t        division.nChangeFollowing = d - 1;\n\t        if (d === 1) {\n\t          // There is no previous path segment.\n\t          division.nCommonFollowing = 0;\n\t          division.aStartFollowing = aEnd;\n\t          division.bStartFollowing = bEnd;\n\t        } else {\n\t          // Unlike the Myers algorithm which finds only the middle “snake”\n\t          // this package can find two common subsequences per division.\n\t          // Last point of previous path segment is on an adjacent diagonal.\n\t          const bLastPrev = bR + aLastPrev - (insert ? kR - 1 : kR + 1);\n\n\t          // Because of invariant that intervals following the middle change\n\t          // cannot have common items at the start,\n\t          // move in forward direction along a diagonal of common items.\n\t          const nCommonF = countCommonItemsF(\n\t            aLastPrev,\n\t            aEnd,\n\t            bLastPrev,\n\t            bEnd,\n\t            isCommon\n\t          );\n\t          division.nCommonFollowing = nCommonF;\n\t          if (nCommonF !== 0) {\n\t            // The last point of reverse path segment is start of common subsequence.\n\t            division.aCommonFollowing = aLastPrev;\n\t            division.bCommonFollowing = bLastPrev;\n\t          }\n\t          const aStartFollowing = aLastPrev + nCommonF; // aFirstPrev\n\t          const bStartFollowing = bLastPrev + nCommonF; // bFirstPrev\n\n\t          if (d - 1 === aEnd + bEnd - aStartFollowing - bStartFollowing) {\n\t            // Optimization: number of changes in forward direction\n\t            // is equal to number of items in following interval,\n\t            // therefore it cannot contain any common items.\n\t            division.aStartFollowing = aEnd;\n\t            division.bStartFollowing = bEnd;\n\t          } else {\n\t            division.aStartFollowing = aStartFollowing;\n\t            division.bStartFollowing = bStartFollowing;\n\t          }\n\t        }\n\t        return true;\n\t      }\n\t    }\n\t  }\n\t  return false;\n\t};\n\n\t// Given index intervals and input function to compare items at indexes,\n\t// divide at the middle change.\n\t//\n\t// DO NOT CALL if start === end, because interval cannot contain common items\n\t// and because this function will throw the “no overlap” error.\n\tconst divide = (\n\t  nChange,\n\t  aStart,\n\t  aEnd,\n\t  bStart,\n\t  bEnd,\n\t  isCommon,\n\t  aIndexesF,\n\t  aIndexesR,\n\t  division // output\n\t) => {\n\t  const bF = bStart - aStart; // bIndex = bF + aIndex - kF\n\t  const bR = bEnd - aEnd; // bIndex = bR + aIndex - kR\n\t  const aLength = aEnd - aStart;\n\t  const bLength = bEnd - bStart;\n\n\t  // Because graph has square or portrait orientation,\n\t  // length difference is minimum number of items to insert from b.\n\t  // Corresponding forward and reverse diagonals in graph\n\t  // depend on length difference of the sequences:\n\t  // kF = kR - baDeltaLength\n\t  // kR = kF + baDeltaLength\n\t  const baDeltaLength = bLength - aLength;\n\n\t  // Optimization: max diagonal in graph intersects corner of shorter side.\n\t  let iMaxF = aLength;\n\t  let iMaxR = aLength;\n\n\t  // Initialize no changes yet in forward or reverse direction:\n\t  aIndexesF[0] = aStart - 1; // at open start of interval, outside closed start\n\t  aIndexesR[0] = aEnd; // at open end of interval\n\n\t  if (baDeltaLength % 2 === 0) {\n\t    // The number of changes in paths is 2 * d if length difference is even.\n\t    const dMin = (nChange || baDeltaLength) / 2;\n\t    const dMax = (aLength + bLength) / 2;\n\t    for (let d = 1; d <= dMax; d += 1) {\n\t      iMaxF = extendPathsF(d, aEnd, bEnd, bF, isCommon, aIndexesF, iMaxF);\n\t      if (d < dMin) {\n\t        iMaxR = extendPathsR(d, aStart, bStart, bR, isCommon, aIndexesR, iMaxR);\n\t      } else if (\n\t        // If a reverse path overlaps a forward path in the same diagonal,\n\t        // return a division of the index intervals at the middle change.\n\t        extendOverlappablePathsR(\n\t          d,\n\t          aStart,\n\t          aEnd,\n\t          bStart,\n\t          bEnd,\n\t          isCommon,\n\t          aIndexesF,\n\t          iMaxF,\n\t          aIndexesR,\n\t          iMaxR,\n\t          division\n\t        )\n\t      ) {\n\t        return;\n\t      }\n\t    }\n\t  } else {\n\t    // The number of changes in paths is 2 * d - 1 if length difference is odd.\n\t    const dMin = ((nChange || baDeltaLength) + 1) / 2;\n\t    const dMax = (aLength + bLength + 1) / 2;\n\n\t    // Unroll first half iteration so loop extends the relevant pairs of paths.\n\t    // Because of invariant that intervals have no common items at start or end,\n\t    // and limitation not to call divide with empty intervals,\n\t    // therefore it cannot be called if a forward path with one change\n\t    // would overlap a reverse path with no changes, even if dMin === 1.\n\t    let d = 1;\n\t    iMaxF = extendPathsF(d, aEnd, bEnd, bF, isCommon, aIndexesF, iMaxF);\n\t    for (d += 1; d <= dMax; d += 1) {\n\t      iMaxR = extendPathsR(\n\t        d - 1,\n\t        aStart,\n\t        bStart,\n\t        bR,\n\t        isCommon,\n\t        aIndexesR,\n\t        iMaxR\n\t      );\n\t      if (d < dMin) {\n\t        iMaxF = extendPathsF(d, aEnd, bEnd, bF, isCommon, aIndexesF, iMaxF);\n\t      } else if (\n\t        // If a forward path overlaps a reverse path in the same diagonal,\n\t        // return a division of the index intervals at the middle change.\n\t        extendOverlappablePathsF(\n\t          d,\n\t          aStart,\n\t          aEnd,\n\t          bStart,\n\t          bEnd,\n\t          isCommon,\n\t          aIndexesF,\n\t          iMaxF,\n\t          aIndexesR,\n\t          iMaxR,\n\t          division\n\t        )\n\t      ) {\n\t        return;\n\t      }\n\t    }\n\t  }\n\n\t  /* istanbul ignore next */\n\t  throw new Error(\n\t    `${pkg}: no overlap aStart=${aStart} aEnd=${aEnd} bStart=${bStart} bEnd=${bEnd}`\n\t  );\n\t};\n\n\t// Given index intervals and input function to compare items at indexes,\n\t// return by output function the number of adjacent items and starting indexes\n\t// of each common subsequence. Divide and conquer with only linear space.\n\t//\n\t// The index intervals are half open [start, end) like array slice method.\n\t// DO NOT CALL if start === end, because interval cannot contain common items\n\t// and because divide function will throw the “no overlap” error.\n\tconst findSubsequences = (\n\t  nChange,\n\t  aStart,\n\t  aEnd,\n\t  bStart,\n\t  bEnd,\n\t  transposed,\n\t  callbacks,\n\t  aIndexesF,\n\t  aIndexesR,\n\t  division // temporary memory, not input nor output\n\t) => {\n\t  if (bEnd - bStart < aEnd - aStart) {\n\t    // Transpose graph so it has portrait instead of landscape orientation.\n\t    // Always compare shorter to longer sequence for consistency and optimization.\n\t    transposed = !transposed;\n\t    if (transposed && callbacks.length === 1) {\n\t      // Lazily wrap callback functions to swap args if graph is transposed.\n\t      const {foundSubsequence, isCommon} = callbacks[0];\n\t      callbacks[1] = {\n\t        foundSubsequence: (nCommon, bCommon, aCommon) => {\n\t          foundSubsequence(nCommon, aCommon, bCommon);\n\t        },\n\t        isCommon: (bIndex, aIndex) => isCommon(aIndex, bIndex)\n\t      };\n\t    }\n\t    const tStart = aStart;\n\t    const tEnd = aEnd;\n\t    aStart = bStart;\n\t    aEnd = bEnd;\n\t    bStart = tStart;\n\t    bEnd = tEnd;\n\t  }\n\t  const {foundSubsequence, isCommon} = callbacks[transposed ? 1 : 0];\n\n\t  // Divide the index intervals at the middle change.\n\t  divide(\n\t    nChange,\n\t    aStart,\n\t    aEnd,\n\t    bStart,\n\t    bEnd,\n\t    isCommon,\n\t    aIndexesF,\n\t    aIndexesR,\n\t    division\n\t  );\n\t  const {\n\t    nChangePreceding,\n\t    aEndPreceding,\n\t    bEndPreceding,\n\t    nCommonPreceding,\n\t    aCommonPreceding,\n\t    bCommonPreceding,\n\t    nCommonFollowing,\n\t    aCommonFollowing,\n\t    bCommonFollowing,\n\t    nChangeFollowing,\n\t    aStartFollowing,\n\t    bStartFollowing\n\t  } = division;\n\n\t  // Unless either index interval is empty, they might contain common items.\n\t  if (aStart < aEndPreceding && bStart < bEndPreceding) {\n\t    // Recursely find and return common subsequences preceding the division.\n\t    findSubsequences(\n\t      nChangePreceding,\n\t      aStart,\n\t      aEndPreceding,\n\t      bStart,\n\t      bEndPreceding,\n\t      transposed,\n\t      callbacks,\n\t      aIndexesF,\n\t      aIndexesR,\n\t      division\n\t    );\n\t  }\n\n\t  // Return common subsequences that are adjacent to the middle change.\n\t  if (nCommonPreceding !== 0) {\n\t    foundSubsequence(nCommonPreceding, aCommonPreceding, bCommonPreceding);\n\t  }\n\t  if (nCommonFollowing !== 0) {\n\t    foundSubsequence(nCommonFollowing, aCommonFollowing, bCommonFollowing);\n\t  }\n\n\t  // Unless either index interval is empty, they might contain common items.\n\t  if (aStartFollowing < aEnd && bStartFollowing < bEnd) {\n\t    // Recursely find and return common subsequences following the division.\n\t    findSubsequences(\n\t      nChangeFollowing,\n\t      aStartFollowing,\n\t      aEnd,\n\t      bStartFollowing,\n\t      bEnd,\n\t      transposed,\n\t      callbacks,\n\t      aIndexesF,\n\t      aIndexesR,\n\t      division\n\t    );\n\t  }\n\t};\n\tconst validateLength = (name, arg) => {\n\t  if (typeof arg !== 'number') {\n\t    throw new TypeError(`${pkg}: ${name} typeof ${typeof arg} is not a number`);\n\t  }\n\t  if (!Number.isSafeInteger(arg)) {\n\t    throw new RangeError(`${pkg}: ${name} value ${arg} is not a safe integer`);\n\t  }\n\t  if (arg < 0) {\n\t    throw new RangeError(`${pkg}: ${name} value ${arg} is a negative integer`);\n\t  }\n\t};\n\tconst validateCallback = (name, arg) => {\n\t  const type = typeof arg;\n\t  if (type !== 'function') {\n\t    throw new TypeError(`${pkg}: ${name} typeof ${type} is not a function`);\n\t  }\n\t};\n\n\t// Compare items in two sequences to find a longest common subsequence.\n\t// Given lengths of sequences and input function to compare items at indexes,\n\t// return by output function the number of adjacent items and starting indexes\n\t// of each common subsequence.\n\tfunction diffSequence(aLength, bLength, isCommon, foundSubsequence) {\n\t  validateLength('aLength', aLength);\n\t  validateLength('bLength', bLength);\n\t  validateCallback('isCommon', isCommon);\n\t  validateCallback('foundSubsequence', foundSubsequence);\n\n\t  // Count common items from the start in the forward direction.\n\t  const nCommonF = countCommonItemsF(0, aLength, 0, bLength, isCommon);\n\t  if (nCommonF !== 0) {\n\t    foundSubsequence(nCommonF, 0, 0);\n\t  }\n\n\t  // Unless both sequences consist of common items only,\n\t  // find common items in the half-trimmed index intervals.\n\t  if (aLength !== nCommonF || bLength !== nCommonF) {\n\t    // Invariant: intervals do not have common items at the start.\n\t    // The start of an index interval is closed like array slice method.\n\t    const aStart = nCommonF;\n\t    const bStart = nCommonF;\n\n\t    // Count common items from the end in the reverse direction.\n\t    const nCommonR = countCommonItemsR(\n\t      aStart,\n\t      aLength - 1,\n\t      bStart,\n\t      bLength - 1,\n\t      isCommon\n\t    );\n\n\t    // Invariant: intervals do not have common items at the end.\n\t    // The end of an index interval is open like array slice method.\n\t    const aEnd = aLength - nCommonR;\n\t    const bEnd = bLength - nCommonR;\n\n\t    // Unless one sequence consists of common items only,\n\t    // therefore the other trimmed index interval consists of changes only,\n\t    // find common items in the trimmed index intervals.\n\t    const nCommonFR = nCommonF + nCommonR;\n\t    if (aLength !== nCommonFR && bLength !== nCommonFR) {\n\t      const nChange = 0; // number of change items is not yet known\n\t      const transposed = false; // call the original unwrapped functions\n\t      const callbacks = [\n\t        {\n\t          foundSubsequence,\n\t          isCommon\n\t        }\n\t      ];\n\n\t      // Indexes in sequence a of last points in furthest reaching paths\n\t      // from outside the start at top left in the forward direction:\n\t      const aIndexesF = [NOT_YET_SET];\n\t      // from the end at bottom right in the reverse direction:\n\t      const aIndexesR = [NOT_YET_SET];\n\n\t      // Initialize one object as output of all calls to divide function.\n\t      const division = {\n\t        aCommonFollowing: NOT_YET_SET,\n\t        aCommonPreceding: NOT_YET_SET,\n\t        aEndPreceding: NOT_YET_SET,\n\t        aStartFollowing: NOT_YET_SET,\n\t        bCommonFollowing: NOT_YET_SET,\n\t        bCommonPreceding: NOT_YET_SET,\n\t        bEndPreceding: NOT_YET_SET,\n\t        bStartFollowing: NOT_YET_SET,\n\t        nChangeFollowing: NOT_YET_SET,\n\t        nChangePreceding: NOT_YET_SET,\n\t        nCommonFollowing: NOT_YET_SET,\n\t        nCommonPreceding: NOT_YET_SET\n\t      };\n\n\t      // Find and return common subsequences in the trimmed index intervals.\n\t      findSubsequences(\n\t        nChange,\n\t        aStart,\n\t        aEnd,\n\t        bStart,\n\t        bEnd,\n\t        transposed,\n\t        callbacks,\n\t        aIndexesF,\n\t        aIndexesR,\n\t        division\n\t      );\n\t    }\n\t    if (nCommonR !== 0) {\n\t      foundSubsequence(nCommonR, aEnd, bEnd);\n\t    }\n\t  }\n\t}\n\treturn build;\n}\n\nvar buildExports = requireBuild();\nvar diffSequences = /*@__PURE__*/getDefaultExportFromCjs(buildExports);\n\nconst IS_RECORD_SYMBOL = \"@@__IMMUTABLE_RECORD__@@\";\nconst IS_COLLECTION_SYMBOL = \"@@__IMMUTABLE_ITERABLE__@@\";\nfunction isImmutable(v) {\n\treturn v && (v[IS_COLLECTION_SYMBOL] || v[IS_RECORD_SYMBOL]);\n}\nconst OBJECT_PROTO = Object.getPrototypeOf({});\nfunction getUnserializableMessage(err) {\n\tif (err instanceof Error) return `<unserializable>: ${err.message}`;\n\tif (typeof err === \"string\") return `<unserializable>: ${err}`;\n\treturn \"<unserializable>\";\n}\n// https://developer.mozilla.org/en-US/docs/Web/API/Web_Workers_API/Structured_clone_algorithm\nfunction serializeValue(val, seen = /* @__PURE__ */ new WeakMap()) {\n\tif (!val || typeof val === \"string\") return val;\n\tif (val instanceof Error && \"toJSON\" in val && typeof val.toJSON === \"function\") {\n\t\tconst jsonValue = val.toJSON();\n\t\tif (jsonValue && jsonValue !== val && typeof jsonValue === \"object\") {\n\t\t\tif (typeof val.message === \"string\") safe(() => jsonValue.message ??= normalizeErrorMessage(val.message));\n\t\t\tif (typeof val.stack === \"string\") safe(() => jsonValue.stack ??= val.stack);\n\t\t\tif (typeof val.name === \"string\") safe(() => jsonValue.name ??= val.name);\n\t\t\tif (val.cause != null) safe(() => jsonValue.cause ??= serializeValue(val.cause, seen));\n\t\t}\n\t\treturn serializeValue(jsonValue, seen);\n\t}\n\tif (typeof val === \"function\") return `Function<${val.name || \"anonymous\"}>`;\n\tif (typeof val === \"symbol\") return val.toString();\n\tif (typeof val !== \"object\") return val;\n\tif (typeof Buffer !== \"undefined\" && val instanceof Buffer) return `<Buffer(${val.length}) ...>`;\n\tif (typeof Uint8Array !== \"undefined\" && val instanceof Uint8Array) return `<Uint8Array(${val.length}) ...>`;\n\t// cannot serialize immutables as immutables\n\tif (isImmutable(val)) return serializeValue(val.toJSON(), seen);\n\tif (val instanceof Promise || val.constructor && val.constructor.prototype === \"AsyncFunction\") return \"Promise\";\n\tif (typeof Element !== \"undefined\" && val instanceof Element) return val.tagName;\n\tif (typeof val.toJSON === \"function\") return serializeValue(val.toJSON(), seen);\n\tif (seen.has(val)) return seen.get(val);\n\tif (Array.isArray(val)) {\n\t\t// eslint-disable-next-line unicorn/no-new-array -- we need to keep sparse arrays ([1,,3])\n\t\tconst clone = new Array(val.length);\n\t\tseen.set(val, clone);\n\t\tval.forEach((e, i) => {\n\t\t\ttry {\n\t\t\t\tclone[i] = serializeValue(e, seen);\n\t\t\t} catch (err) {\n\t\t\t\tclone[i] = getUnserializableMessage(err);\n\t\t\t}\n\t\t});\n\t\treturn clone;\n\t} else {\n\t\t// Objects with `Error` constructors appear to cause problems during worker communication\n\t\t// using `MessagePort`, so the serialized error object is being recreated as plain object.\n\t\tconst clone = Object.create(null);\n\t\tseen.set(val, clone);\n\t\tlet obj = val;\n\t\twhile (obj && obj !== OBJECT_PROTO) {\n\t\t\tObject.getOwnPropertyNames(obj).forEach((key) => {\n\t\t\t\tif (key in clone) return;\n\t\t\t\ttry {\n\t\t\t\t\tclone[key] = serializeValue(val[key], seen);\n\t\t\t\t} catch (err) {\n\t\t\t\t\t// delete in case it has a setter from prototype that might throw\n\t\t\t\t\tdelete clone[key];\n\t\t\t\t\tclone[key] = getUnserializableMessage(err);\n\t\t\t\t}\n\t\t\t});\n\t\t\tobj = Object.getPrototypeOf(obj);\n\t\t}\n\t\tif (val instanceof Error) safe(() => clone.message = normalizeErrorMessage(val.message));\n\t\treturn clone;\n\t}\n}\nfunction safe(fn) {\n\ttry {\n\t\treturn fn();\n\t} catch {}\n}\nfunction normalizeErrorMessage(message) {\n\treturn message.replace(/\\(0\\s?,\\s?__vite_ssr_import_\\d+__.(\\w+)\\)/g, \"$1\").replace(/__(vite_ssr_import|vi_import)_\\d+__\\./g, \"\").replace(/getByTestId('__vitest_\\d+__')/g, \"page\");\n}\n\nconst SAFE_TIMERS_SYMBOL = Symbol(\"vitest:SAFE_TIMERS\");\nfunction getSafeTimers() {\n\tconst { setTimeout: safeSetTimeout, setInterval: safeSetInterval, clearInterval: safeClearInterval, clearTimeout: safeClearTimeout, setImmediate: safeSetImmediate, clearImmediate: safeClearImmediate, queueMicrotask: safeQueueMicrotask } = globalThis[SAFE_TIMERS_SYMBOL] || globalThis;\n\tconst { nextTick: safeNextTick } = globalThis[SAFE_TIMERS_SYMBOL] || globalThis.process || {};\n\treturn {\n\t\tnextTick: safeNextTick,\n\t\tsetTimeout: safeSetTimeout,\n\t\tsetInterval: safeSetInterval,\n\t\tclearInterval: safeClearInterval,\n\t\tclearTimeout: safeClearTimeout,\n\t\tsetImmediate: safeSetImmediate,\n\t\tclearImmediate: safeClearImmediate,\n\t\tqueueMicrotask: safeQueueMicrotask\n\t};\n}\nfunction setSafeTimers() {\n\tconst { setTimeout: safeSetTimeout, setInterval: safeSetInterval, clearInterval: safeClearInterval, clearTimeout: safeClearTimeout, setImmediate: safeSetImmediate, clearImmediate: safeClearImmediate, queueMicrotask: safeQueueMicrotask } = globalThis;\n\tconst { nextTick: safeNextTick } = globalThis.process || {};\n\tglobalThis[SAFE_TIMERS_SYMBOL] = {\n\t\tnextTick: safeNextTick,\n\t\tsetTimeout: safeSetTimeout,\n\t\tsetInterval: safeSetInterval,\n\t\tclearInterval: safeClearInterval,\n\t\tclearTimeout: safeClearTimeout,\n\t\tsetImmediate: safeSetImmediate,\n\t\tclearImmediate: safeClearImmediate,\n\t\tqueueMicrotask: safeQueueMicrotask\n\t};\n}\n/**\n* Returns a promise that resolves after the specified duration.\n*\n* @param timeout - Delay in milliseconds\n* @param scheduler - Timer function to use, defaults to `setTimeout`. Useful for mocked timers.\n*\n* @example\n* await delay(100)\n*\n* @example\n* // With mocked timers\n* const { setTimeout } = getSafeTimers()\n* await delay(100, setTimeout)\n*/\nfunction delay(timeout, scheduler = setTimeout) {\n\treturn new Promise((resolve) => scheduler(resolve, timeout));\n}\n\n// src/vlq.ts\nvar comma = \",\".charCodeAt(0);\nvar chars = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\nvar intToChar = new Uint8Array(64);\nvar charToInt = new Uint8Array(128);\nfor (let i = 0; i < chars.length; i++) {\n  const c = chars.charCodeAt(i);\n  intToChar[i] = c;\n  charToInt[c] = i;\n}\nfunction decodeInteger(reader, relative) {\n  let value = 0;\n  let shift = 0;\n  let integer = 0;\n  do {\n    const c = reader.next();\n    integer = charToInt[c];\n    value |= (integer & 31) << shift;\n    shift += 5;\n  } while (integer & 32);\n  const shouldNegate = value & 1;\n  value >>>= 1;\n  if (shouldNegate) {\n    value = -2147483648 | -value;\n  }\n  return relative + value;\n}\nfunction hasMoreVlq(reader, max) {\n  if (reader.pos >= max) return false;\n  return reader.peek() !== comma;\n}\nvar StringReader = class {\n  constructor(buffer) {\n    this.pos = 0;\n    this.buffer = buffer;\n  }\n  next() {\n    return this.buffer.charCodeAt(this.pos++);\n  }\n  peek() {\n    return this.buffer.charCodeAt(this.pos);\n  }\n  indexOf(char) {\n    const { buffer, pos } = this;\n    const idx = buffer.indexOf(char, pos);\n    return idx === -1 ? buffer.length : idx;\n  }\n};\n\n// src/sourcemap-codec.ts\nfunction decode(mappings) {\n  const { length } = mappings;\n  const reader = new StringReader(mappings);\n  const decoded = [];\n  let genColumn = 0;\n  let sourcesIndex = 0;\n  let sourceLine = 0;\n  let sourceColumn = 0;\n  let namesIndex = 0;\n  do {\n    const semi = reader.indexOf(\";\");\n    const line = [];\n    let sorted = true;\n    let lastCol = 0;\n    genColumn = 0;\n    while (reader.pos < semi) {\n      let seg;\n      genColumn = decodeInteger(reader, genColumn);\n      if (genColumn < lastCol) sorted = false;\n      lastCol = genColumn;\n      if (hasMoreVlq(reader, semi)) {\n        sourcesIndex = decodeInteger(reader, sourcesIndex);\n        sourceLine = decodeInteger(reader, sourceLine);\n        sourceColumn = decodeInteger(reader, sourceColumn);\n        if (hasMoreVlq(reader, semi)) {\n          namesIndex = decodeInteger(reader, namesIndex);\n          seg = [genColumn, sourcesIndex, sourceLine, sourceColumn, namesIndex];\n        } else {\n          seg = [genColumn, sourcesIndex, sourceLine, sourceColumn];\n        }\n      } else {\n        seg = [genColumn];\n      }\n      line.push(seg);\n      reader.pos++;\n    }\n    if (!sorted) sort(line);\n    decoded.push(line);\n    reader.pos = semi + 1;\n  } while (reader.pos <= length);\n  return decoded;\n}\nfunction sort(line) {\n  line.sort(sortComparator$1);\n}\nfunction sortComparator$1(a, b) {\n  return a[0] - b[0];\n}\n\n// Matches the scheme of a URL, eg \"http://\"\nconst schemeRegex = /^[\\w+.-]+:\\/\\//;\n/**\n * Matches the parts of a URL:\n * 1. Scheme, including \":\", guaranteed.\n * 2. User/password, including \"@\", optional.\n * 3. Host, guaranteed.\n * 4. Port, including \":\", optional.\n * 5. Path, including \"/\", optional.\n * 6. Query, including \"?\", optional.\n * 7. Hash, including \"#\", optional.\n */\nconst urlRegex = /^([\\w+.-]+:)\\/\\/([^@/#?]*@)?([^:/#?]*)(:\\d+)?(\\/[^#?]*)?(\\?[^#]*)?(#.*)?/;\n/**\n * File URLs are weird. They dont' need the regular `//` in the scheme, they may or may not start\n * with a leading `/`, they can have a domain (but only if they don't start with a Windows drive).\n *\n * 1. Host, optional.\n * 2. Path, which may include \"/\", guaranteed.\n * 3. Query, including \"?\", optional.\n * 4. Hash, including \"#\", optional.\n */\nconst fileRegex = /^file:(?:\\/\\/((?![a-z]:)[^/#?]*)?)?(\\/?[^#?]*)(\\?[^#]*)?(#.*)?/i;\nfunction isAbsoluteUrl(input) {\n    return schemeRegex.test(input);\n}\nfunction isSchemeRelativeUrl(input) {\n    return input.startsWith('//');\n}\nfunction isAbsolutePath(input) {\n    return input.startsWith('/');\n}\nfunction isFileUrl(input) {\n    return input.startsWith('file:');\n}\nfunction isRelative(input) {\n    return /^[.?#]/.test(input);\n}\nfunction parseAbsoluteUrl(input) {\n    const match = urlRegex.exec(input);\n    return makeUrl(match[1], match[2] || '', match[3], match[4] || '', match[5] || '/', match[6] || '', match[7] || '');\n}\nfunction parseFileUrl(input) {\n    const match = fileRegex.exec(input);\n    const path = match[2];\n    return makeUrl('file:', '', match[1] || '', '', isAbsolutePath(path) ? path : '/' + path, match[3] || '', match[4] || '');\n}\nfunction makeUrl(scheme, user, host, port, path, query, hash) {\n    return {\n        scheme,\n        user,\n        host,\n        port,\n        path,\n        query,\n        hash,\n        type: 7 /* Absolute */,\n    };\n}\nfunction parseUrl(input) {\n    if (isSchemeRelativeUrl(input)) {\n        const url = parseAbsoluteUrl('http:' + input);\n        url.scheme = '';\n        url.type = 6 /* SchemeRelative */;\n        return url;\n    }\n    if (isAbsolutePath(input)) {\n        const url = parseAbsoluteUrl('http://foo.com' + input);\n        url.scheme = '';\n        url.host = '';\n        url.type = 5 /* AbsolutePath */;\n        return url;\n    }\n    if (isFileUrl(input))\n        return parseFileUrl(input);\n    if (isAbsoluteUrl(input))\n        return parseAbsoluteUrl(input);\n    const url = parseAbsoluteUrl('http://foo.com/' + input);\n    url.scheme = '';\n    url.host = '';\n    url.type = input\n        ? input.startsWith('?')\n            ? 3 /* Query */\n            : input.startsWith('#')\n                ? 2 /* Hash */\n                : 4 /* RelativePath */\n        : 1 /* Empty */;\n    return url;\n}\nfunction stripPathFilename(path) {\n    // If a path ends with a parent directory \"..\", then it's a relative path with excess parent\n    // paths. It's not a file, so we can't strip it.\n    if (path.endsWith('/..'))\n        return path;\n    const index = path.lastIndexOf('/');\n    return path.slice(0, index + 1);\n}\nfunction mergePaths(url, base) {\n    normalizePath(base, base.type);\n    // If the path is just a \"/\", then it was an empty path to begin with (remember, we're a relative\n    // path).\n    if (url.path === '/') {\n        url.path = base.path;\n    }\n    else {\n        // Resolution happens relative to the base path's directory, not the file.\n        url.path = stripPathFilename(base.path) + url.path;\n    }\n}\n/**\n * The path can have empty directories \"//\", unneeded parents \"foo/..\", or current directory\n * \"foo/.\". We need to normalize to a standard representation.\n */\nfunction normalizePath(url, type) {\n    const rel = type <= 4 /* RelativePath */;\n    const pieces = url.path.split('/');\n    // We need to preserve the first piece always, so that we output a leading slash. The item at\n    // pieces[0] is an empty string.\n    let pointer = 1;\n    // Positive is the number of real directories we've output, used for popping a parent directory.\n    // Eg, \"foo/bar/..\" will have a positive 2, and we can decrement to be left with just \"foo\".\n    let positive = 0;\n    // We need to keep a trailing slash if we encounter an empty directory (eg, splitting \"foo/\" will\n    // generate `[\"foo\", \"\"]` pieces). And, if we pop a parent directory. But once we encounter a\n    // real directory, we won't need to append, unless the other conditions happen again.\n    let addTrailingSlash = false;\n    for (let i = 1; i < pieces.length; i++) {\n        const piece = pieces[i];\n        // An empty directory, could be a trailing slash, or just a double \"//\" in the path.\n        if (!piece) {\n            addTrailingSlash = true;\n            continue;\n        }\n        // If we encounter a real directory, then we don't need to append anymore.\n        addTrailingSlash = false;\n        // A current directory, which we can always drop.\n        if (piece === '.')\n            continue;\n        // A parent directory, we need to see if there are any real directories we can pop. Else, we\n        // have an excess of parents, and we'll need to keep the \"..\".\n        if (piece === '..') {\n            if (positive) {\n                addTrailingSlash = true;\n                positive--;\n                pointer--;\n            }\n            else if (rel) {\n                // If we're in a relativePath, then we need to keep the excess parents. Else, in an absolute\n                // URL, protocol relative URL, or an absolute path, we don't need to keep excess.\n                pieces[pointer++] = piece;\n            }\n            continue;\n        }\n        // We've encountered a real directory. Move it to the next insertion pointer, which accounts for\n        // any popped or dropped directories.\n        pieces[pointer++] = piece;\n        positive++;\n    }\n    let path = '';\n    for (let i = 1; i < pointer; i++) {\n        path += '/' + pieces[i];\n    }\n    if (!path || (addTrailingSlash && !path.endsWith('/..'))) {\n        path += '/';\n    }\n    url.path = path;\n}\n/**\n * Attempts to resolve `input` URL/path relative to `base`.\n */\nfunction resolve(input, base) {\n    if (!input && !base)\n        return '';\n    const url = parseUrl(input);\n    let inputType = url.type;\n    if (base && inputType !== 7 /* Absolute */) {\n        const baseUrl = parseUrl(base);\n        const baseType = baseUrl.type;\n        switch (inputType) {\n            case 1 /* Empty */:\n                url.hash = baseUrl.hash;\n            // fall through\n            case 2 /* Hash */:\n                url.query = baseUrl.query;\n            // fall through\n            case 3 /* Query */:\n            case 4 /* RelativePath */:\n                mergePaths(url, baseUrl);\n            // fall through\n            case 5 /* AbsolutePath */:\n                // The host, user, and port are joined, you can't copy one without the others.\n                url.user = baseUrl.user;\n                url.host = baseUrl.host;\n                url.port = baseUrl.port;\n            // fall through\n            case 6 /* SchemeRelative */:\n                // The input doesn't have a schema at least, so we need to copy at least that over.\n                url.scheme = baseUrl.scheme;\n        }\n        if (baseType > inputType)\n            inputType = baseType;\n    }\n    normalizePath(url, inputType);\n    const queryHash = url.query + url.hash;\n    switch (inputType) {\n        // This is impossible, because of the empty checks at the start of the function.\n        // case UrlType.Empty:\n        case 2 /* Hash */:\n        case 3 /* Query */:\n            return queryHash;\n        case 4 /* RelativePath */: {\n            // The first char is always a \"/\", and we need it to be relative.\n            const path = url.path.slice(1);\n            if (!path)\n                return queryHash || '.';\n            if (isRelative(base || input) && !isRelative(path)) {\n                // If base started with a leading \".\", or there is no base and input started with a \".\",\n                // then we need to ensure that the relative path starts with a \".\". We don't know if\n                // relative starts with a \"..\", though, so check before prepending.\n                return './' + path + queryHash;\n            }\n            return path + queryHash;\n        }\n        case 5 /* AbsolutePath */:\n            return url.path + queryHash;\n        default:\n            return url.scheme + '//' + url.user + url.host + url.port + url.path + queryHash;\n    }\n}\n\n// src/trace-mapping.ts\n\n// src/strip-filename.ts\nfunction stripFilename(path) {\n  if (!path) return \"\";\n  const index = path.lastIndexOf(\"/\");\n  return path.slice(0, index + 1);\n}\n\n// src/resolve.ts\nfunction resolver(mapUrl, sourceRoot) {\n  const from = stripFilename(mapUrl);\n  const prefix = sourceRoot ? sourceRoot + \"/\" : \"\";\n  return (source) => resolve(prefix + (source || \"\"), from);\n}\n\n// src/sourcemap-segment.ts\nvar COLUMN = 0;\nvar SOURCES_INDEX = 1;\nvar SOURCE_LINE = 2;\nvar SOURCE_COLUMN = 3;\nvar NAMES_INDEX = 4;\nvar REV_GENERATED_LINE = 1;\nvar REV_GENERATED_COLUMN = 2;\n\n// src/sort.ts\nfunction maybeSort(mappings, owned) {\n  const unsortedIndex = nextUnsortedSegmentLine(mappings, 0);\n  if (unsortedIndex === mappings.length) return mappings;\n  if (!owned) mappings = mappings.slice();\n  for (let i = unsortedIndex; i < mappings.length; i = nextUnsortedSegmentLine(mappings, i + 1)) {\n    mappings[i] = sortSegments(mappings[i], owned);\n  }\n  return mappings;\n}\nfunction nextUnsortedSegmentLine(mappings, start) {\n  for (let i = start; i < mappings.length; i++) {\n    if (!isSorted(mappings[i])) return i;\n  }\n  return mappings.length;\n}\nfunction isSorted(line) {\n  for (let j = 1; j < line.length; j++) {\n    if (line[j][COLUMN] < line[j - 1][COLUMN]) {\n      return false;\n    }\n  }\n  return true;\n}\nfunction sortSegments(line, owned) {\n  if (!owned) line = line.slice();\n  return line.sort(sortComparator);\n}\nfunction sortComparator(a, b) {\n  return a[COLUMN] - b[COLUMN];\n}\n\n// src/by-source.ts\nfunction buildBySources(decoded, memos) {\n  const sources = memos.map(() => []);\n  for (let i = 0; i < decoded.length; i++) {\n    const line = decoded[i];\n    for (let j = 0; j < line.length; j++) {\n      const seg = line[j];\n      if (seg.length === 1) continue;\n      const sourceIndex2 = seg[SOURCES_INDEX];\n      const sourceLine = seg[SOURCE_LINE];\n      const sourceColumn = seg[SOURCE_COLUMN];\n      const source = sources[sourceIndex2];\n      const segs = source[sourceLine] || (source[sourceLine] = []);\n      segs.push([sourceColumn, i, seg[COLUMN]]);\n    }\n  }\n  for (let i = 0; i < sources.length; i++) {\n    const source = sources[i];\n    for (let j = 0; j < source.length; j++) {\n      const line = source[j];\n      if (line) line.sort(sortComparator);\n    }\n  }\n  return sources;\n}\n\n// src/binary-search.ts\nvar found = false;\nfunction binarySearch(haystack, needle, low, high) {\n  while (low <= high) {\n    const mid = low + (high - low >> 1);\n    const cmp = haystack[mid][COLUMN] - needle;\n    if (cmp === 0) {\n      found = true;\n      return mid;\n    }\n    if (cmp < 0) {\n      low = mid + 1;\n    } else {\n      high = mid - 1;\n    }\n  }\n  found = false;\n  return low - 1;\n}\nfunction upperBound(haystack, needle, index) {\n  for (let i = index + 1; i < haystack.length; index = i++) {\n    if (haystack[i][COLUMN] !== needle) break;\n  }\n  return index;\n}\nfunction lowerBound(haystack, needle, index) {\n  for (let i = index - 1; i >= 0; index = i--) {\n    if (haystack[i][COLUMN] !== needle) break;\n  }\n  return index;\n}\nfunction memoizedState$1() {\n  return {\n    lastKey: -1,\n    lastNeedle: -1,\n    lastIndex: -1\n  };\n}\nfunction memoizedBinarySearch(haystack, needle, state, key) {\n  const { lastKey, lastNeedle, lastIndex } = state;\n  let low = 0;\n  let high = haystack.length - 1;\n  if (key === lastKey) {\n    if (needle === lastNeedle) {\n      found = lastIndex !== -1 && haystack[lastIndex][COLUMN] === needle;\n      return lastIndex;\n    }\n    if (needle >= lastNeedle) {\n      low = lastIndex === -1 ? 0 : lastIndex;\n    } else {\n      high = lastIndex;\n    }\n  }\n  state.lastKey = key;\n  state.lastNeedle = needle;\n  return state.lastIndex = binarySearch(haystack, needle, low, high);\n}\n\n// src/types.ts\nfunction parse(map) {\n  return typeof map === \"string\" ? JSON.parse(map) : map;\n}\n\n// src/trace-mapping.ts\nvar LINE_GTR_ZERO = \"`line` must be greater than 0 (lines start at line 1)\";\nvar COL_GTR_EQ_ZERO = \"`column` must be greater than or equal to 0 (columns start at column 0)\";\nvar LEAST_UPPER_BOUND = -1;\nvar GREATEST_LOWER_BOUND = 1;\nvar TraceMap = class {\n  constructor(map, mapUrl) {\n    const isString = typeof map === \"string\";\n    if (!isString && map._decodedMemo) return map;\n    const parsed = parse(map);\n    const { version, file, names, sourceRoot, sources, sourcesContent } = parsed;\n    this.version = version;\n    this.file = file;\n    this.names = names || [];\n    this.sourceRoot = sourceRoot;\n    this.sources = sources;\n    this.sourcesContent = sourcesContent;\n    this.ignoreList = parsed.ignoreList || parsed.x_google_ignoreList || void 0;\n    const resolve = resolver(mapUrl, sourceRoot);\n    this.resolvedSources = sources.map(resolve);\n    const { mappings } = parsed;\n    if (typeof mappings === \"string\") {\n      this._encoded = mappings;\n      this._decoded = void 0;\n    } else if (Array.isArray(mappings)) {\n      this._encoded = void 0;\n      this._decoded = maybeSort(mappings, isString);\n    } else if (parsed.sections) {\n      throw new Error(`TraceMap passed sectioned source map, please use FlattenMap export instead`);\n    } else {\n      throw new Error(`invalid source map: ${JSON.stringify(parsed)}`);\n    }\n    this._decodedMemo = memoizedState$1();\n    this._bySources = void 0;\n    this._bySourceMemos = void 0;\n  }\n};\nfunction cast(map) {\n  return map;\n}\nfunction decodedMappings(map) {\n  var _a;\n  return (_a = cast(map))._decoded || (_a._decoded = decode(cast(map)._encoded));\n}\nfunction originalPositionFor(map, needle) {\n  let { line, column, bias } = needle;\n  line--;\n  if (line < 0) throw new Error(LINE_GTR_ZERO);\n  if (column < 0) throw new Error(COL_GTR_EQ_ZERO);\n  const decoded = decodedMappings(map);\n  if (line >= decoded.length) return OMapping(null, null, null, null);\n  const segments = decoded[line];\n  const index = traceSegmentInternal(\n    segments,\n    cast(map)._decodedMemo,\n    line,\n    column,\n    bias || GREATEST_LOWER_BOUND\n  );\n  if (index === -1) return OMapping(null, null, null, null);\n  const segment = segments[index];\n  if (segment.length === 1) return OMapping(null, null, null, null);\n  const { names, resolvedSources } = map;\n  return OMapping(\n    resolvedSources[segment[SOURCES_INDEX]],\n    segment[SOURCE_LINE] + 1,\n    segment[SOURCE_COLUMN],\n    segment.length === 5 ? names[segment[NAMES_INDEX]] : null\n  );\n}\nfunction generatedPositionFor(map, needle) {\n  const { source, line, column, bias } = needle;\n  return generatedPosition(map, source, line, column, bias || GREATEST_LOWER_BOUND, false);\n}\nfunction eachMapping(map, cb) {\n  const decoded = decodedMappings(map);\n  const { names, resolvedSources } = map;\n  for (let i = 0; i < decoded.length; i++) {\n    const line = decoded[i];\n    for (let j = 0; j < line.length; j++) {\n      const seg = line[j];\n      const generatedLine = i + 1;\n      const generatedColumn = seg[0];\n      let source = null;\n      let originalLine = null;\n      let originalColumn = null;\n      let name = null;\n      if (seg.length !== 1) {\n        source = resolvedSources[seg[1]];\n        originalLine = seg[2] + 1;\n        originalColumn = seg[3];\n      }\n      if (seg.length === 5) name = names[seg[4]];\n      cb({\n        generatedLine,\n        generatedColumn,\n        source,\n        originalLine,\n        originalColumn,\n        name\n      });\n    }\n  }\n}\nfunction OMapping(source, line, column, name) {\n  return { source, line, column, name };\n}\nfunction GMapping(line, column) {\n  return { line, column };\n}\nfunction traceSegmentInternal(segments, memo, line, column, bias) {\n  let index = memoizedBinarySearch(segments, column, memo, line);\n  if (found) {\n    index = (bias === LEAST_UPPER_BOUND ? upperBound : lowerBound)(segments, column, index);\n  } else if (bias === LEAST_UPPER_BOUND) index++;\n  if (index === -1 || index === segments.length) return -1;\n  return index;\n}\nfunction generatedPosition(map, source, line, column, bias, all) {\n  var _a, _b;\n  line--;\n  if (line < 0) throw new Error(LINE_GTR_ZERO);\n  if (column < 0) throw new Error(COL_GTR_EQ_ZERO);\n  const { sources, resolvedSources } = map;\n  let sourceIndex2 = sources.indexOf(source);\n  if (sourceIndex2 === -1) sourceIndex2 = resolvedSources.indexOf(source);\n  if (sourceIndex2 === -1) return all ? [] : GMapping(null, null);\n  const bySourceMemos = (_a = cast(map))._bySourceMemos || (_a._bySourceMemos = sources.map(memoizedState$1));\n  const generated = (_b = cast(map))._bySources || (_b._bySources = buildBySources(decodedMappings(map), bySourceMemos));\n  const segments = generated[sourceIndex2][line];\n  if (segments == null) return all ? [] : GMapping(null, null);\n  const memo = bySourceMemos[sourceIndex2];\n  const index = traceSegmentInternal(segments, memo, line, column, bias);\n  if (index === -1) return GMapping(null, null);\n  const segment = segments[index];\n  return GMapping(segment[REV_GENERATED_LINE] + 1, segment[REV_GENERATED_COLUMN]);\n}\n\nconst CHROME_IE_STACK_REGEXP = /^\\s*at .*(?:\\S:\\d+|\\(native\\))/m;\nconst SAFARI_NATIVE_CODE_REGEXP = /^(?:eval@)?(?:\\[native code\\])?$/;\nconst stackIgnorePatterns = [\n\t\"node:internal\",\n\t/\\/packages\\/\\w+\\/dist\\//,\n\t/\\/@vitest\\/\\w+\\/dist\\//,\n\t\"/vitest/dist/\",\n\t\"/vitest/src/\",\n\t\"/packages/expect/src/\",\n\t\"/packages/snapshot/src/\",\n\t\"/node_modules/chai/\",\n\t\"/node_modules/tinyspy/\",\n\t\"/vite/dist/node/module-runner\",\n\t\"/rolldown-vite/dist/node/module-runner\",\n\t\"/deps/chunk-\",\n\t\"/deps/@vitest\",\n\t\"/deps/loupe\",\n\t\"/deps/chai\",\n\t\"/browser-playwright/dist/locators.js\",\n\t\"/browser-webdriverio/dist/locators.js\",\n\t\"/browser-preview/dist/locators.js\",\n\t/node:\\w+/,\n\t/__vitest_test__/,\n\t/__vitest_browser__/,\n\t\"/@id/__x00__vitest/browser\",\n\t/\\/deps\\/vitest_/,\n\t\"/deps/vitest.js\"\n];\nconst NOW_LENGTH = Date.now().toString().length;\nconst REGEXP_VITEST = new RegExp(`vitest=\\\\d{${NOW_LENGTH}}`);\nfunction extractLocation(urlLike) {\n\t// Fail-fast but return locations like \"(native)\"\n\tif (!urlLike.includes(\":\")) return [urlLike];\n\tconst parts = /(.+?)(?::(\\d+))?(?::(\\d+))?$/.exec(urlLike.replace(/^\\(|\\)$/g, \"\"));\n\tif (!parts) return [urlLike];\n\tlet url = parts[1];\n\tif (url.startsWith(\"async \")) url = url.slice(6);\n\tif (url.startsWith(\"http:\") || url.startsWith(\"https:\")) {\n\t\tconst urlObj = new URL(url);\n\t\turlObj.searchParams.delete(\"import\");\n\t\turlObj.searchParams.delete(\"browserv\");\n\t\turl = urlObj.pathname + urlObj.hash + urlObj.search;\n\t}\n\tif (url.startsWith(\"/@fs/\")) {\n\t\tconst isWindows = /^\\/@fs\\/[a-zA-Z]:\\//.test(url);\n\t\turl = url.slice(isWindows ? 5 : 4);\n\t}\n\tif (url.includes(\"vitest=\")) url = url.replace(REGEXP_VITEST, \"\").replace(/[?&]$/, \"\");\n\treturn [\n\t\turl,\n\t\tparts[2] || void 0,\n\t\tparts[3] || void 0\n\t];\n}\nfunction parseSingleFFOrSafariStack(raw) {\n\tlet line = raw.trim();\n\tif (SAFARI_NATIVE_CODE_REGEXP.test(line)) return null;\n\tif (line.includes(\" > eval\")) line = line.replace(/ line (\\d+)(?: > eval line \\d+)* > eval:\\d+:\\d+/g, \":$1\");\n\t// Early return for lines that don't look like Firefox/Safari stack traces\n\t// Firefox/Safari stack traces must contain '@' and should have location info after it\n\tif (!line.includes(\"@\")) return null;\n\t// Find the correct @ that separates function name from location\n\t// For cases like '@https://@fs/path' or 'functionName@https://@fs/path'\n\t// we need to find the first @ that precedes a valid location (containing :)\n\tlet atIndex = -1;\n\tlet locationPart = \"\";\n\tlet functionName;\n\t// Try each @ from left to right to find the one that gives us a valid location\n\tfor (let i = 0; i < line.length; i++) if (line[i] === \"@\") {\n\t\tconst candidateLocation = line.slice(i + 1);\n\t\t// Minimum length 3 for valid location: 1 for filename + 1 for colon + 1 for line number (e.g., \"a:1\")\n\t\tif (candidateLocation.includes(\":\") && candidateLocation.length >= 3) {\n\t\t\tatIndex = i;\n\t\t\tlocationPart = candidateLocation;\n\t\t\tfunctionName = i > 0 ? line.slice(0, i) : void 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\t// Validate we found a valid location with minimum length (filename:line format)\n\tif (atIndex === -1 || !locationPart.includes(\":\") || locationPart.length < 3) return null;\n\tconst [url, lineNumber, columnNumber] = extractLocation(locationPart);\n\tif (!url || !lineNumber || !columnNumber) return null;\n\treturn {\n\t\tfile: url,\n\t\tmethod: functionName || \"\",\n\t\tline: Number.parseInt(lineNumber),\n\t\tcolumn: Number.parseInt(columnNumber)\n\t};\n}\nfunction parseSingleStack(raw) {\n\tconst line = raw.trim();\n\tif (!CHROME_IE_STACK_REGEXP.test(line)) return parseSingleFFOrSafariStack(line);\n\treturn parseSingleV8Stack(line);\n}\n// Based on https://github.com/stacktracejs/error-stack-parser\n// Credit to stacktracejs\nfunction parseSingleV8Stack(raw) {\n\tlet line = raw.trim();\n\tif (!CHROME_IE_STACK_REGEXP.test(line)) return null;\n\tif (line.includes(\"(eval \")) line = line.replace(/eval code/g, \"eval\").replace(/(\\(eval at [^()]*)|(,.*$)/g, \"\");\n\tlet sanitizedLine = line.replace(/^\\s+/, \"\").replace(/\\(eval code/g, \"(\").replace(/^.*?\\s+/, \"\");\n\t// capture and preserve the parenthesized location \"(/foo/my bar.js:12:87)\" in\n\t// case it has spaces in it, as the string is split on \\s+ later on\n\tconst location = sanitizedLine.match(/ (\\(.+\\)$)/);\n\t// remove the parenthesized location from the line, if it was matched\n\tsanitizedLine = location ? sanitizedLine.replace(location[0], \"\") : sanitizedLine;\n\t// if a location was matched, pass it to extractLocation() otherwise pass all sanitizedLine\n\t// because this line doesn't have function name\n\tconst [url, lineNumber, columnNumber] = extractLocation(location ? location[1] : sanitizedLine);\n\tlet method = location && sanitizedLine || \"\";\n\tlet file = url && [\"eval\", \"<anonymous>\"].includes(url) ? void 0 : url;\n\tif (!file || !lineNumber || !columnNumber) return null;\n\tif (method.startsWith(\"async \")) method = method.slice(6);\n\tif (file.startsWith(\"file://\")) file = file.slice(7);\n\t// normalize Windows path (\\ -> /)\n\tfile = file.startsWith(\"node:\") || file.startsWith(\"internal:\") ? file : resolve$1(file);\n\tif (method) method = method.replace(/\\(0\\s?,\\s?__vite_ssr_import_\\d+__.(\\w+)\\)/g, \"$1\").replace(/__(vite_ssr_import|vi_import)_\\d+__\\./g, \"\").replace(/(Object\\.)?__vite_ssr_export_default__\\s?/g, \"\");\n\treturn {\n\t\tmethod,\n\t\tfile,\n\t\tline: Number.parseInt(lineNumber),\n\t\tcolumn: Number.parseInt(columnNumber)\n\t};\n}\nfunction createStackString(stacks) {\n\treturn stacks.map((stack) => {\n\t\tconst line = `${stack.file}:${stack.line}:${stack.column}`;\n\t\tif (stack.method) return `    at ${stack.method}(${line})`;\n\t\treturn `    at ${line}`;\n\t}).join(\"\\n\");\n}\nfunction parseStacktrace(stack, options = {}) {\n\tconst { ignoreStackEntries = stackIgnorePatterns } = options;\n\tlet stacks = !CHROME_IE_STACK_REGEXP.test(stack) ? parseFFOrSafariStackTrace(stack) : parseV8Stacktrace(stack);\n\t// remove vi.defineHelper's internal stacks\n\tconst helperIndex = stacks.findLastIndex((s) => s.method.includes(\"__VITEST_HELPER__\"));\n\tif (helperIndex >= 0) stacks = stacks.slice(helperIndex + 1);\n\treturn stacks.map((stack) => {\n\t\tif (options.getUrlId) stack.file = options.getUrlId(stack.file);\n\t\tconst map = options.getSourceMap?.(stack.file);\n\t\tif (!map || typeof map !== \"object\" || !map.version) return shouldFilter(ignoreStackEntries, stack.file) ? null : stack;\n\t\tconst traceMap = new DecodedMap(map, stack.file);\n\t\tif (stack.line <= 0 || stack.column <= 0) return stack;\n\t\tconst position = getOriginalPosition(traceMap, {\n\t\t\tline: stack.line,\n\t\t\t// stacktrace's column is 1-indexed, but sourcemap's one is 0-indexed\n\t\t\tcolumn: stack.column - 1\n\t\t});\n\t\tif (!position) return stack;\n\t\tconst { line, column, source, name } = position;\n\t\tlet file = source || stack.file;\n\t\tif (/\\/\\w:\\//.test(file)) file = file.slice(1);\n\t\tif (shouldFilter(ignoreStackEntries, file)) return null;\n\t\tif (line != null && column != null) return {\n\t\t\tline,\n\t\t\tcolumn: column + 1,\n\t\t\tfile,\n\t\t\tmethod: name || stack.method\n\t\t};\n\t\treturn stack;\n\t}).filter((s) => s != null);\n}\nfunction shouldFilter(ignoreStackEntries, file) {\n\treturn ignoreStackEntries.some((p) => file.match(p));\n}\nfunction parseFFOrSafariStackTrace(stack) {\n\treturn stack.split(\"\\n\").map((line) => parseSingleFFOrSafariStack(line)).filter(notNullish);\n}\nfunction parseV8Stacktrace(stack) {\n\treturn stack.split(\"\\n\").map((line) => parseSingleV8Stack(line)).filter(notNullish);\n}\nfunction parseErrorStacktrace(e, options = {}) {\n\tif (!e || isPrimitive(e)) return [];\n\tif (\"stacks\" in e && e.stacks) return e.stacks;\n\tconst stackStr = e.stack || \"\";\n\t// if \"stack\" property was overwritten at runtime to be something else,\n\t// ignore the value because we don't know how to process it\n\tlet stackFrames = typeof stackStr === \"string\" ? parseStacktrace(stackStr, options) : [];\n\tif (!stackFrames.length) {\n\t\tconst e_ = e;\n\t\tif (e_.fileName != null && e_.lineNumber != null && e_.columnNumber != null) stackFrames = parseStacktrace(`${e_.fileName}:${e_.lineNumber}:${e_.columnNumber}`, options);\n\t\tif (e_.sourceURL != null && e_.line != null && e_._column != null) stackFrames = parseStacktrace(`${e_.sourceURL}:${e_.line}:${e_.column}`, options);\n\t}\n\tif (options.frameFilter) stackFrames = stackFrames.filter((f) => options.frameFilter(e, f) !== false);\n\te.stacks = stackFrames;\n\treturn stackFrames;\n}\nclass DecodedMap {\n\tmap;\n\t_encoded;\n\t_decoded;\n\t_decodedMemo;\n\turl;\n\tversion;\n\tnames = [];\n\tresolvedSources;\n\tconstructor(map, from) {\n\t\tthis.map = map;\n\t\tconst { mappings, names, sources } = map;\n\t\tthis.version = map.version;\n\t\tthis.names = names || [];\n\t\tthis._encoded = mappings || \"\";\n\t\tthis._decodedMemo = memoizedState();\n\t\tthis.url = from;\n\t\tthis.resolvedSources = (sources || []).map((s) => resolve$1(from, \"..\", s || \"\"));\n\t}\n}\nfunction memoizedState() {\n\treturn {\n\t\tlastKey: -1,\n\t\tlastNeedle: -1,\n\t\tlastIndex: -1\n\t};\n}\nfunction getOriginalPosition(map, needle) {\n\tconst result = originalPositionFor(map, needle);\n\tif (result.column == null) return null;\n\treturn result;\n}\n\nexport { DecodedMap as D, TraceMap as T, getSafeTimers as a, serializeValue as b, createStackString as c, diffSequences as d, getDefaultExportFromCjs as e, parseErrorStacktrace as f, getOriginalPosition as g, commonjsGlobal as h, parseSingleStack as i, delay as j, generatedPositionFor as k, eachMapping as l, stackIgnorePatterns as m, originalPositionFor as o, parseStacktrace as p, setSafeTimers as s };\n","import { t as toArray, a as relative } from './chunks/pathe.M-eThtNZ.DwEga6ro.js';\n\n/* @__NO_SIDE_EFFECTS__ */\nfunction isTestCase(s) {\n\treturn s.type === \"test\";\n}\n/* @__NO_SIDE_EFFECTS__ */\nfunction getTests(suite) {\n\tconst tests = [];\n\tconst arraySuites = toArray(suite);\n\tfor (const s of arraySuites) if (/* @__PURE__ */ isTestCase(s)) tests.push(s);\n\telse for (const task of s.tasks) if (/* @__PURE__ */ isTestCase(task)) tests.push(task);\n\telse {\n\t\tconst taskTests = /* @__PURE__ */ getTests(task);\n\t\tfor (const test of taskTests) tests.push(test);\n\t}\n\treturn tests;\n}\n/* @__NO_SIDE_EFFECTS__ */\nfunction getTasks(tasks = []) {\n\treturn toArray(tasks).flatMap((s) => /* @__PURE__ */ isTestCase(s) ? [s] : [s, .../* @__PURE__ */ getTasks(s.tasks)]);\n}\n/* @__NO_SIDE_EFFECTS__ */\nfunction getSuites(suite) {\n\treturn toArray(suite).flatMap((s) => s.type === \"suite\" ? [s, .../* @__PURE__ */ getSuites(s.tasks)] : []);\n}\n/* @__NO_SIDE_EFFECTS__ */\nfunction hasFailed(suite) {\n\treturn toArray(suite).some((s) => s.result?.state === \"fail\" || s.type === \"suite\" && /* @__PURE__ */ hasFailed(s.tasks));\n}\n/* @__NO_SIDE_EFFECTS__ */\nfunction getNames(task) {\n\tconst names = [task.name];\n\tlet current = task;\n\twhile (current?.suite) {\n\t\tcurrent = current.suite;\n\t\tif (current?.name) names.unshift(current.name);\n\t}\n\tif (current !== task.file) names.unshift(task.file.name);\n\treturn names;\n}\n/* @__NO_SIDE_EFFECTS__ */\nfunction getFullName(task, separator = \" > \") {\n\treturn (/* @__PURE__ */ getNames(task)).join(separator);\n}\n/* @__NO_SIDE_EFFECTS__ */\nfunction getTestName(task, separator = \" > \") {\n\treturn (/* @__PURE__ */ getNames(task)).slice(1).join(separator);\n}\n/* @__NO_SIDE_EFFECTS__ */\nfunction createTaskName(names, separator = \" > \") {\n\treturn names.filter((name) => name !== void 0).join(separator);\n}\n/* @__NO_SIDE_EFFECTS__ */\nfunction hasFailedSnapshot(suite) {\n\treturn (/* @__PURE__ */ getTests(suite)).some((s) => {\n\t\treturn s.result?.errors?.some((e) => typeof e?.message === \"string\" && e.message.match(/Snapshot .* mismatched/));\n\t});\n}\n/* @__NO_SIDE_EFFECTS__ */\nfunction convertTasksToEvents(file, onTask) {\n\tconst packs = [];\n\tconst events = [];\n\tfunction visit(suite) {\n\t\tonTask?.(suite);\n\t\tpacks.push([\n\t\t\tsuite.id,\n\t\t\tsuite.result,\n\t\t\tsuite.meta\n\t\t]);\n\t\tevents.push([\n\t\t\tsuite.id,\n\t\t\t\"suite-prepare\",\n\t\t\tvoid 0\n\t\t]);\n\t\tsuite.tasks.forEach((task) => {\n\t\t\tif (task.type === \"suite\") visit(task);\n\t\t\telse {\n\t\t\t\tonTask?.(task);\n\t\t\t\tif (suite.mode !== \"skip\" && suite.mode !== \"todo\") {\n\t\t\t\t\tpacks.push([\n\t\t\t\t\t\ttask.id,\n\t\t\t\t\t\ttask.result,\n\t\t\t\t\t\ttask.meta\n\t\t\t\t\t]);\n\t\t\t\t\tevents.push([\n\t\t\t\t\t\ttask.id,\n\t\t\t\t\t\t\"test-prepare\",\n\t\t\t\t\t\tvoid 0\n\t\t\t\t\t]);\n\t\t\t\t\ttask.annotations.forEach((annotation) => {\n\t\t\t\t\t\tevents.push([\n\t\t\t\t\t\t\ttask.id,\n\t\t\t\t\t\t\t\"test-annotation\",\n\t\t\t\t\t\t\t{ annotation }\n\t\t\t\t\t\t]);\n\t\t\t\t\t});\n\t\t\t\t\ttask.artifacts.forEach((artifact) => {\n\t\t\t\t\t\tevents.push([\n\t\t\t\t\t\t\ttask.id,\n\t\t\t\t\t\t\t\"test-artifact\",\n\t\t\t\t\t\t\t{ artifact }\n\t\t\t\t\t\t]);\n\t\t\t\t\t});\n\t\t\t\t\tevents.push([\n\t\t\t\t\t\ttask.id,\n\t\t\t\t\t\t\"test-finished\",\n\t\t\t\t\t\tvoid 0\n\t\t\t\t\t]);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\tevents.push([\n\t\t\tsuite.id,\n\t\t\t\"suite-finished\",\n\t\t\tvoid 0\n\t\t]);\n\t}\n\tvisit(file);\n\treturn {\n\t\tpacks,\n\t\tevents\n\t};\n}\n/* @__NO_SIDE_EFFECTS__ */\nfunction createFileTask(filepath, root, projectName, pool, viteEnvironment, meta) {\n\tconst path = relative(root, filepath);\n\t// this can be called outside of the test run, so worker might not be there\n\t// @ts-expect-error injected global\n\tconst workerState = globalThis.__vitest_worker__;\n\tconst file = {\n\t\tid: /* @__PURE__ */ generateFileHash(path, projectName, meta),\n\t\tname: path,\n\t\tfullName: path,\n\t\ttype: \"suite\",\n\t\tmode: \"queued\",\n\t\tfilepath,\n\t\ttasks: [],\n\t\tmeta: Object.assign(Object.create(null), meta),\n\t\tprojectName,\n\t\tfile: void 0,\n\t\tpool,\n\t\tviteEnvironment,\n\t\tconcurrencyId: workerState?.ctx.concurrencyId ?? 0,\n\t\tworkerId: workerState?.ctx.workerId ?? 0\n\t};\n\tfile.file = file;\n\treturn file;\n}\n/**\n* Generate a unique ID for a file based on its path and project name\n* @param file File relative to the root of the project to keep ID the same between different machines\n* @param projectName The name of the test project\n*/\n/* @__NO_SIDE_EFFECTS__ */\nfunction generateFileHash(file, projectName, meta) {\n\treturn /* @__PURE__ */ generateHash([\n\t\tfile,\n\t\tprojectName || \"\",\n\t\tmeta?.typecheck ? \"__typecheck__\" : \"\",\n\t\tmeta?.__vitest_label__ || \"\"\n\t].join(\"\\0\"));\n}\n/* @__NO_SIDE_EFFECTS__ */\nfunction generateHash(str) {\n\tlet hash = 0;\n\tif (str.length === 0) return `${hash}`;\n\tfor (let i = 0; i < str.length; i++) {\n\t\tconst char = str.charCodeAt(i);\n\t\thash = (hash << 5) - hash + char;\n\t\thash = hash & hash;\n\t}\n\treturn `${hash}`;\n}\nfunction calculateSuiteHash(parent) {\n\tparent.tasks.forEach((t, idx) => {\n\t\tt.id = `${parent.id}_${idx}`;\n\t\tif (t.type === \"suite\") calculateSuiteHash(t);\n\t});\n}\n/**\n* If any tasks been marked as `only`, mark all other tasks as `skip`.\n*/\nfunction interpretTaskModes(file, namePattern, testLocations, testIds, testTagsFilter, onlyMode, parentIsOnly, allowOnly) {\n\tconst matchedLocations = [];\n\tconst testLocationsSet = testLocations !== void 0 && testLocations.length !== 0 ? new Set(testLocations) : void 0;\n\tconst testIdsSet = testIds ? new Set(testIds) : void 0;\n\tconst traverseSuite = (suite, parentIsOnly, parentMatchedWithLocation) => {\n\t\tconst suiteIsOnly = parentIsOnly || suite.mode === \"only\";\n\t\t// Check if any tasks in this suite have `.only` - if so, only those should run.\n\t\t// `containsOnly` is computed during collection (in the runtime/AST collectors).\n\t\tconst hasSomeTasksOnly = !!(onlyMode && suite.containsOnly);\n\t\tsuite.tasks.forEach((t) => {\n\t\t\t// Check if either the parent suite or the task itself are marked as included\n\t\t\t// If there are tasks with `.only` in this suite, only include those (not all tasks from describe.only)\n\t\t\tconst includeTask = hasSomeTasksOnly ? t.mode === \"only\" || t.type === \"suite\" && !!t.containsOnly : suiteIsOnly || t.mode === \"only\";\n\t\t\tif (onlyMode) {\n\t\t\t\tif (t.type === \"suite\" && (includeTask || t.containsOnly)) {\n\t\t\t\t\t// Don't skip this suite\n\t\t\t\t\tif (t.mode === \"only\") {\n\t\t\t\t\t\tcheckAllowOnly(t, allowOnly);\n\t\t\t\t\t\tt.mode = \"run\";\n\t\t\t\t\t}\n\t\t\t\t} else if (t.mode === \"run\" && !includeTask) t.mode = \"skip\";\n\t\t\t\telse if (t.mode === \"only\") {\n\t\t\t\t\tcheckAllowOnly(t, allowOnly);\n\t\t\t\t\tt.mode = \"run\";\n\t\t\t\t}\n\t\t\t}\n\t\t\tlet hasLocationMatch = parentMatchedWithLocation;\n\t\t\t// Match test location against provided locations, only run if present\n\t\t\t// in `testLocations`. Note: if `includeTaskLocation` is not enabled,\n\t\t\t// all test will be skipped.\n\t\t\tif (testLocationsSet !== void 0) {\n\t\t\t\tif (t.location && testLocationsSet.has(t.location.line)) {\n\t\t\t\t\tt.mode = \"run\";\n\t\t\t\t\tmatchedLocations.push(t.location.line);\n\t\t\t\t\thasLocationMatch = true;\n\t\t\t\t} else if (parentMatchedWithLocation) t.mode = \"run\";\n\t\t\t\telse if (t.type === \"test\") t.mode = \"skip\";\n\t\t\t}\n\t\t\tif (t.type === \"test\") {\n\t\t\t\tif (namePattern && !t.fullTestName.match(namePattern)) t.mode = \"skip\";\n\t\t\t\tif (testIdsSet && !testIdsSet.has(t.id)) t.mode = \"skip\";\n\t\t\t\tif (testTagsFilter && !testTagsFilter(t.tags || [])) t.mode = \"skip\";\n\t\t\t} else if (t.type === \"suite\") if (t.mode === \"skip\") skipAllTasks(t);\n\t\t\telse if (t.mode === \"todo\") todoAllTasks(t);\n\t\t\telse traverseSuite(t, includeTask, hasLocationMatch);\n\t\t});\n\t\t// if all subtasks are skipped, mark as skip\n\t\tif (suite.mode === \"run\" || suite.mode === \"queued\") {\n\t\t\tif (suite.tasks.length && suite.tasks.every((i) => i.mode !== \"run\" && i.mode !== \"queued\")) suite.mode = \"skip\";\n\t\t}\n\t};\n\ttraverseSuite(file, parentIsOnly, false);\n\tconst nonMatching = testLocations?.filter((loc) => !matchedLocations.includes(loc));\n\tif (nonMatching && nonMatching.length !== 0) {\n\t\tconst message = nonMatching.length === 1 ? `line ${nonMatching[0]}` : `lines ${nonMatching.join(\", \")}`;\n\t\tif (file.result === void 0) file.result = {\n\t\t\tstate: \"fail\",\n\t\t\terrors: []\n\t\t};\n\t\tif (file.result.errors === void 0) file.result.errors = [];\n\t\tconst error = /* @__PURE__ */ new Error(`No test found in ${file.name} in ${message}`);\n\t\tfile.result.errors.push({\n\t\t\tname: error.name,\n\t\t\tmessage: error.message,\n\t\t\tstack: error.stack\n\t\t});\n\t}\n}\nfunction skipAllTasks(suite) {\n\tsuite.tasks.forEach((t) => {\n\t\tif (t.mode === \"run\" || t.mode === \"queued\") {\n\t\t\tt.mode = \"skip\";\n\t\t\tif (t.type === \"suite\") skipAllTasks(t);\n\t\t}\n\t});\n}\nfunction todoAllTasks(suite) {\n\tsuite.tasks.forEach((t) => {\n\t\tif (t.mode === \"run\" || t.mode === \"queued\") {\n\t\t\tt.mode = \"todo\";\n\t\t\tif (t.type === \"suite\") todoAllTasks(t);\n\t\t}\n\t});\n}\nfunction checkAllowOnly(task, allowOnly) {\n\tif (allowOnly) return;\n\tconst error = /* @__PURE__ */ new Error(\"[Vitest] Unexpected .only modifier. Remove it or pass --allowOnly argument to bypass this error\");\n\ttask.result = {\n\t\tstate: \"fail\",\n\t\terrors: [{\n\t\t\tname: error.name,\n\t\t\tmessage: error.message,\n\t\t\tstack: error.stack\n\t\t}]\n\t};\n}\n\nexport { calculateSuiteHash, convertTasksToEvents, createFileTask, createTaskName, generateFileHash, generateHash, getFullName, getNames, getSuites, getTasks, getTestName, getTests, hasFailed, hasFailedSnapshot, interpretTaskModes, isTestCase };\n","import { f as format, p as plugins } from './index.M2dsQ_UQ.js';\nimport { y } from './tinyrainbow.Ht9iggcq.js';\nimport { s as stringify, f as format$1, a as formatRegExp, t as truncateString, i as inspect } from './display.pkpxlVcY.js';\nimport { p as deepClone, q as getOwnProperties, g as getType$1, u as isObject, v as filterOutComments, w as ordinal, e as createDefer, x as assertTypes, t as toArray, y as isNegativeNaN, z as unique, A as objectAttr } from './pathe.M-eThtNZ.DwEga6ro.js';\nimport { d as diffSequences, b as serializeValue, p as parseStacktrace, a as getSafeTimers } from './source-map.BH0bbrs9.js';\nimport { createTaskName, createFileTask, calculateSuiteHash, interpretTaskModes, hasFailed } from '../task-utils.js';\n\nconst RealDate = Date;\nfunction random(seed) {\n\tconst x = Math.sin(seed++) * 1e4;\n\treturn x - Math.floor(x);\n}\nfunction shuffle(array, seed = RealDate.now()) {\n\tlet length = array.length;\n\twhile (length) {\n\t\tconst index = Math.floor(random(seed) * length--);\n\t\tconst previous = array[length];\n\t\tarray[length] = array[index];\n\t\tarray[index] = previous;\n\t\t++seed;\n\t}\n\treturn array;\n}\n\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* @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* 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* 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*/\nconst DIFF_DELETE = -1;\nconst DIFF_INSERT = 1;\nconst DIFF_EQUAL = 0;\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*/\nclass Diff {\n\t0;\n\t1;\n\tconstructor(op, text) {\n\t\tthis[0] = op;\n\t\tthis[1] = text;\n\t}\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*/\nfunction diff_commonPrefix(text1, text2) {\n\t// Quick check for common null cases.\n\tif (!text1 || !text2 || text1.charAt(0) !== text2.charAt(0)) return 0;\n\t// Binary search.\n\t// Performance analysis: https://neil.fraser.name/news/2007/10/09/\n\tlet pointermin = 0;\n\tlet pointermax = Math.min(text1.length, text2.length);\n\tlet pointermid = pointermax;\n\tlet pointerstart = 0;\n\twhile (pointermin < pointermid) {\n\t\tif (text1.substring(pointerstart, pointermid) === text2.substring(pointerstart, pointermid)) {\n\t\t\tpointermin = pointermid;\n\t\t\tpointerstart = pointermin;\n\t\t} else pointermax = pointermid;\n\t\tpointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);\n\t}\n\treturn pointermid;\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*/\nfunction diff_commonSuffix(text1, text2) {\n\t// Quick check for common null cases.\n\tif (!text1 || !text2 || text1.charAt(text1.length - 1) !== text2.charAt(text2.length - 1)) return 0;\n\t// Binary search.\n\t// Performance analysis: https://neil.fraser.name/news/2007/10/09/\n\tlet pointermin = 0;\n\tlet pointermax = Math.min(text1.length, text2.length);\n\tlet pointermid = pointermax;\n\tlet pointerend = 0;\n\twhile (pointermin < pointermid) {\n\t\tif (text1.substring(text1.length - pointermid, text1.length - pointerend) === text2.substring(text2.length - pointermid, text2.length - pointerend)) {\n\t\t\tpointermin = pointermid;\n\t\t\tpointerend = pointermin;\n\t\t} else pointermax = pointermid;\n\t\tpointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);\n\t}\n\treturn pointermid;\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*/\nfunction diff_commonOverlap_(text1, text2) {\n\t// Cache the text lengths to prevent multiple calls.\n\tconst text1_length = text1.length;\n\tconst text2_length = text2.length;\n\t// Eliminate the null case.\n\tif (text1_length === 0 || text2_length === 0) return 0;\n\t// Truncate the longer string.\n\tif (text1_length > text2_length) text1 = text1.substring(text1_length - text2_length);\n\telse if (text1_length < text2_length) text2 = text2.substring(0, text1_length);\n\tconst text_length = Math.min(text1_length, text2_length);\n\t// Quick check for the worst case.\n\tif (text1 === text2) return text_length;\n\t// Start by looking for a single character match\n\t// and increase length until no match is found.\n\t// Performance analysis: https://neil.fraser.name/news/2010/11/04/\n\tlet best = 0;\n\tlet length = 1;\n\twhile (true) {\n\t\tconst pattern = text1.substring(text_length - length);\n\t\tconst found = text2.indexOf(pattern);\n\t\tif (found === -1) return best;\n\t\tlength += found;\n\t\tif (found === 0 || text1.substring(text_length - length) === text2.substring(0, length)) {\n\t\t\tbest = length;\n\t\t\tlength++;\n\t\t}\n\t}\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*/\nfunction diff_cleanupSemantic(diffs) {\n\tlet changes = false;\n\tconst equalities = [];\n\tlet equalitiesLength = 0;\n\t/** @type {?string} */\n\tlet lastEquality = null;\n\t// Always equal to diffs[equalities[equalitiesLength - 1]][1]\n\tlet pointer = 0;\n\t// Number of characters that changed prior to the equality.\n\tlet length_insertions1 = 0;\n\tlet length_deletions1 = 0;\n\t// Number of characters that changed after the equality.\n\tlet length_insertions2 = 0;\n\tlet length_deletions2 = 0;\n\twhile (pointer < diffs.length) {\n\t\tif (diffs[pointer][0] === DIFF_EQUAL) {\n\t\t\t// Equality found.\n\t\t\tequalities[equalitiesLength++] = pointer;\n\t\t\tlength_insertions1 = length_insertions2;\n\t\t\tlength_deletions1 = length_deletions2;\n\t\t\tlength_insertions2 = 0;\n\t\t\tlength_deletions2 = 0;\n\t\t\tlastEquality = diffs[pointer][1];\n\t\t} else {\n\t\t\t// An insertion or deletion.\n\t\t\tif (diffs[pointer][0] === DIFF_INSERT) length_insertions2 += diffs[pointer][1].length;\n\t\t\telse length_deletions2 += diffs[pointer][1].length;\n\t\t\t// Eliminate an equality that is smaller or equal to the edits on both\n\t\t\t// sides of it.\n\t\t\tif (lastEquality && lastEquality.length <= Math.max(length_insertions1, length_deletions1) && lastEquality.length <= Math.max(length_insertions2, length_deletions2)) {\n\t\t\t\t// Duplicate record.\n\t\t\t\tdiffs.splice(equalities[equalitiesLength - 1], 0, new Diff(DIFF_DELETE, lastEquality));\n\t\t\t\t// Change second copy to insert.\n\t\t\t\tdiffs[equalities[equalitiesLength - 1] + 1][0] = DIFF_INSERT;\n\t\t\t\t// Throw away the equality we just deleted.\n\t\t\t\tequalitiesLength--;\n\t\t\t\t// Throw away the previous equality (it needs to be reevaluated).\n\t\t\t\tequalitiesLength--;\n\t\t\t\tpointer = equalitiesLength > 0 ? equalities[equalitiesLength - 1] : -1;\n\t\t\t\tlength_insertions1 = 0;\n\t\t\t\tlength_deletions1 = 0;\n\t\t\t\tlength_insertions2 = 0;\n\t\t\t\tlength_deletions2 = 0;\n\t\t\t\tlastEquality = null;\n\t\t\t\tchanges = true;\n\t\t\t}\n\t\t}\n\t\tpointer++;\n\t}\n\t// Normalize the diff.\n\tif (changes) diff_cleanupMerge(diffs);\n\tdiff_cleanupSemanticLossless(diffs);\n\t// Find any overlaps between deletions and insertions.\n\t// e.g: <del>abcxxx</del><ins>xxxdef</ins>\n\t//   -> <del>abc</del>xxx<ins>def</ins>\n\t// e.g: <del>xxxabc</del><ins>defxxx</ins>\n\t//   -> <ins>def</ins>xxx<del>abc</del>\n\t// Only extract an overlap if it is as big as the edit ahead or behind it.\n\tpointer = 1;\n\twhile (pointer < diffs.length) {\n\t\tif (diffs[pointer - 1][0] === DIFF_DELETE && diffs[pointer][0] === DIFF_INSERT) {\n\t\t\tconst deletion = diffs[pointer - 1][1];\n\t\t\tconst insertion = diffs[pointer][1];\n\t\t\tconst overlap_length1 = diff_commonOverlap_(deletion, insertion);\n\t\t\tconst overlap_length2 = diff_commonOverlap_(insertion, deletion);\n\t\t\tif (overlap_length1 >= overlap_length2) {\n\t\t\t\tif (overlap_length1 >= deletion.length / 2 || overlap_length1 >= insertion.length / 2) {\n\t\t\t\t\t// Overlap found.  Insert an equality and trim the surrounding edits.\n\t\t\t\t\tdiffs.splice(pointer, 0, new Diff(DIFF_EQUAL, insertion.substring(0, overlap_length1)));\n\t\t\t\t\tdiffs[pointer - 1][1] = deletion.substring(0, deletion.length - overlap_length1);\n\t\t\t\t\tdiffs[pointer + 1][1] = insertion.substring(overlap_length1);\n\t\t\t\t\tpointer++;\n\t\t\t\t}\n\t\t\t} else if (overlap_length2 >= deletion.length / 2 || overlap_length2 >= insertion.length / 2) {\n\t\t\t\t// Reverse overlap found.\n\t\t\t\t// Insert an equality and swap and trim the surrounding edits.\n\t\t\t\tdiffs.splice(pointer, 0, new Diff(DIFF_EQUAL, deletion.substring(0, overlap_length2)));\n\t\t\t\tdiffs[pointer - 1][0] = DIFF_INSERT;\n\t\t\t\tdiffs[pointer - 1][1] = insertion.substring(0, insertion.length - overlap_length2);\n\t\t\t\tdiffs[pointer + 1][0] = DIFF_DELETE;\n\t\t\t\tdiffs[pointer + 1][1] = deletion.substring(overlap_length2);\n\t\t\t\tpointer++;\n\t\t\t}\n\t\t\tpointer++;\n\t\t}\n\t\tpointer++;\n\t}\n}\n// Define some regex patterns for matching boundaries.\nconst nonAlphaNumericRegex_ = /[^a-z0-9]/i;\nconst whitespaceRegex_ = /\\s/;\nconst linebreakRegex_ = /[\\r\\n]/;\nconst blanklineEndRegex_ = /\\n\\r?\\n$/;\nconst blanklineStartRegex_ = /^\\r?\\n\\r?\\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*/\nfunction diff_cleanupSemanticLossless(diffs) {\n\tlet pointer = 1;\n\t// Intentionally ignore the first and last element (don't need checking).\n\twhile (pointer < diffs.length - 1) {\n\t\tif (diffs[pointer - 1][0] === DIFF_EQUAL && diffs[pointer + 1][0] === DIFF_EQUAL) {\n\t\t\t// This is a single edit surrounded by equalities.\n\t\t\tlet equality1 = diffs[pointer - 1][1];\n\t\t\tlet edit = diffs[pointer][1];\n\t\t\tlet equality2 = diffs[pointer + 1][1];\n\t\t\t// First, shift the edit as far left as possible.\n\t\t\tconst commonOffset = diff_commonSuffix(equality1, edit);\n\t\t\tif (commonOffset) {\n\t\t\t\tconst commonString = edit.substring(edit.length - commonOffset);\n\t\t\t\tequality1 = equality1.substring(0, equality1.length - commonOffset);\n\t\t\t\tedit = commonString + edit.substring(0, edit.length - commonOffset);\n\t\t\t\tequality2 = commonString + equality2;\n\t\t\t}\n\t\t\t// Second, step character by character right, looking for the best fit.\n\t\t\tlet bestEquality1 = equality1;\n\t\t\tlet bestEdit = edit;\n\t\t\tlet bestEquality2 = equality2;\n\t\t\tlet bestScore = diff_cleanupSemanticScore_(equality1, edit) + diff_cleanupSemanticScore_(edit, equality2);\n\t\t\twhile (edit.charAt(0) === equality2.charAt(0)) {\n\t\t\t\tequality1 += edit.charAt(0);\n\t\t\t\tedit = edit.substring(1) + equality2.charAt(0);\n\t\t\t\tequality2 = equality2.substring(1);\n\t\t\t\tconst score = diff_cleanupSemanticScore_(equality1, edit) + diff_cleanupSemanticScore_(edit, equality2);\n\t\t\t\t// The >= encourages trailing rather than leading whitespace on edits.\n\t\t\t\tif (score >= bestScore) {\n\t\t\t\t\tbestScore = score;\n\t\t\t\t\tbestEquality1 = equality1;\n\t\t\t\t\tbestEdit = edit;\n\t\t\t\t\tbestEquality2 = equality2;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (diffs[pointer - 1][1] !== bestEquality1) {\n\t\t\t\t// We have an improvement, save it back to the diff.\n\t\t\t\tif (bestEquality1) diffs[pointer - 1][1] = bestEquality1;\n\t\t\t\telse {\n\t\t\t\t\tdiffs.splice(pointer - 1, 1);\n\t\t\t\t\tpointer--;\n\t\t\t\t}\n\t\t\t\tdiffs[pointer][1] = bestEdit;\n\t\t\t\tif (bestEquality2) diffs[pointer + 1][1] = bestEquality2;\n\t\t\t\telse {\n\t\t\t\t\tdiffs.splice(pointer + 1, 1);\n\t\t\t\t\tpointer--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tpointer++;\n\t}\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*/\nfunction diff_cleanupMerge(diffs) {\n\t// Add a dummy entry at the end.\n\tdiffs.push(new Diff(DIFF_EQUAL, \"\"));\n\tlet pointer = 0;\n\tlet count_delete = 0;\n\tlet count_insert = 0;\n\tlet text_delete = \"\";\n\tlet text_insert = \"\";\n\tlet commonlength;\n\twhile (pointer < diffs.length) switch (diffs[pointer][0]) {\n\t\tcase DIFF_INSERT:\n\t\t\tcount_insert++;\n\t\t\ttext_insert += diffs[pointer][1];\n\t\t\tpointer++;\n\t\t\tbreak;\n\t\tcase DIFF_DELETE:\n\t\t\tcount_delete++;\n\t\t\ttext_delete += diffs[pointer][1];\n\t\t\tpointer++;\n\t\t\tbreak;\n\t\tcase DIFF_EQUAL:\n\t\t\t// Upon reaching an equality, check for prior redundancies.\n\t\t\tif (count_delete + count_insert > 1) {\n\t\t\t\tif (count_delete !== 0 && count_insert !== 0) {\n\t\t\t\t\t// Factor out any common prefixes.\n\t\t\t\t\tcommonlength = diff_commonPrefix(text_insert, text_delete);\n\t\t\t\t\tif (commonlength !== 0) {\n\t\t\t\t\t\tif (pointer - count_delete - count_insert > 0 && diffs[pointer - count_delete - count_insert - 1][0] === DIFF_EQUAL) diffs[pointer - count_delete - count_insert - 1][1] += text_insert.substring(0, commonlength);\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tdiffs.splice(0, 0, new Diff(DIFF_EQUAL, text_insert.substring(0, commonlength)));\n\t\t\t\t\t\t\tpointer++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttext_insert = text_insert.substring(commonlength);\n\t\t\t\t\t\ttext_delete = text_delete.substring(commonlength);\n\t\t\t\t\t}\n\t\t\t\t\t// Factor out any common suffixes.\n\t\t\t\t\tcommonlength = diff_commonSuffix(text_insert, text_delete);\n\t\t\t\t\tif (commonlength !== 0) {\n\t\t\t\t\t\tdiffs[pointer][1] = text_insert.substring(text_insert.length - commonlength) + diffs[pointer][1];\n\t\t\t\t\t\ttext_insert = text_insert.substring(0, text_insert.length - commonlength);\n\t\t\t\t\t\ttext_delete = text_delete.substring(0, text_delete.length - commonlength);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// Delete the offending records and add the merged ones.\n\t\t\t\tpointer -= count_delete + count_insert;\n\t\t\t\tdiffs.splice(pointer, count_delete + count_insert);\n\t\t\t\tif (text_delete.length) {\n\t\t\t\t\tdiffs.splice(pointer, 0, new Diff(DIFF_DELETE, text_delete));\n\t\t\t\t\tpointer++;\n\t\t\t\t}\n\t\t\t\tif (text_insert.length) {\n\t\t\t\t\tdiffs.splice(pointer, 0, new Diff(DIFF_INSERT, text_insert));\n\t\t\t\t\tpointer++;\n\t\t\t\t}\n\t\t\t\tpointer++;\n\t\t\t} else if (pointer !== 0 && diffs[pointer - 1][0] === DIFF_EQUAL) {\n\t\t\t\t// Merge this equality with the previous one.\n\t\t\t\tdiffs[pointer - 1][1] += diffs[pointer][1];\n\t\t\t\tdiffs.splice(pointer, 1);\n\t\t\t} else pointer++;\n\t\t\tcount_insert = 0;\n\t\t\tcount_delete = 0;\n\t\t\ttext_delete = \"\";\n\t\t\ttext_insert = \"\";\n\t}\n\tif (diffs.at(-1)?.[1] === \"\") diffs.pop();\n\t// Second pass: look for single edits surrounded on both sides by equalities\n\t// which can be shifted sideways to eliminate an equality.\n\t// e.g: A<ins>BA</ins>C -> <ins>AB</ins>AC\n\tlet changes = false;\n\tpointer = 1;\n\t// Intentionally ignore the first and last element (don't need checking).\n\twhile (pointer < diffs.length - 1) {\n\t\tif (diffs[pointer - 1][0] === DIFF_EQUAL && diffs[pointer + 1][0] === DIFF_EQUAL) {\n\t\t\t// This is a single edit surrounded by equalities.\n\t\t\tif (diffs[pointer][1].substring(diffs[pointer][1].length - diffs[pointer - 1][1].length) === diffs[pointer - 1][1]) {\n\t\t\t\t// Shift the edit over the previous equality.\n\t\t\t\tdiffs[pointer][1] = diffs[pointer - 1][1] + diffs[pointer][1].substring(0, diffs[pointer][1].length - diffs[pointer - 1][1].length);\n\t\t\t\tdiffs[pointer + 1][1] = diffs[pointer - 1][1] + diffs[pointer + 1][1];\n\t\t\t\tdiffs.splice(pointer - 1, 1);\n\t\t\t\tchanges = true;\n\t\t\t} else if (diffs[pointer][1].substring(0, diffs[pointer + 1][1].length) === diffs[pointer + 1][1]) {\n\t\t\t\t// Shift the edit over the next equality.\n\t\t\t\tdiffs[pointer - 1][1] += diffs[pointer + 1][1];\n\t\t\t\tdiffs[pointer][1] = diffs[pointer][1].substring(diffs[pointer + 1][1].length) + diffs[pointer + 1][1];\n\t\t\t\tdiffs.splice(pointer + 1, 1);\n\t\t\t\tchanges = true;\n\t\t\t}\n\t\t}\n\t\tpointer++;\n\t}\n\t// If shifts were made, the diff needs reordering and another shift sweep.\n\tif (changes) diff_cleanupMerge(diffs);\n}\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*/\nfunction diff_cleanupSemanticScore_(one, two) {\n\tif (!one || !two)\n // Edges are the best.\n\treturn 6;\n\t// Each port of this function behaves slightly differently due to\n\t// subtle differences in each language's definition of things like\n\t// 'whitespace'.  Since this function's purpose is largely cosmetic,\n\t// the choice has been made to use each language's native features\n\t// rather than force total conformity.\n\tconst char1 = one.charAt(one.length - 1);\n\tconst char2 = two.charAt(0);\n\tconst nonAlphaNumeric1 = char1.match(nonAlphaNumericRegex_);\n\tconst nonAlphaNumeric2 = char2.match(nonAlphaNumericRegex_);\n\tconst whitespace1 = nonAlphaNumeric1 && char1.match(whitespaceRegex_);\n\tconst whitespace2 = nonAlphaNumeric2 && char2.match(whitespaceRegex_);\n\tconst lineBreak1 = whitespace1 && char1.match(linebreakRegex_);\n\tconst lineBreak2 = whitespace2 && char2.match(linebreakRegex_);\n\tconst blankLine1 = lineBreak1 && one.match(blanklineEndRegex_);\n\tconst blankLine2 = lineBreak2 && two.match(blanklineStartRegex_);\n\tif (blankLine1 || blankLine2)\n // Five points for blank lines.\n\treturn 5;\n\telse if (lineBreak1 || lineBreak2)\n // Four points for line breaks.\n\treturn 4;\n\telse if (nonAlphaNumeric1 && !whitespace1 && whitespace2)\n // Three points for end of sentences.\n\treturn 3;\n\telse if (whitespace1 || whitespace2)\n // Two points for whitespace.\n\treturn 2;\n\telse if (nonAlphaNumeric1 || nonAlphaNumeric2)\n // One point for non-alphanumeric.\n\treturn 1;\n\treturn 0;\n}\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*/\nconst NO_DIFF_MESSAGE = \"Compared values have no visual difference.\";\nconst SIMILAR_MESSAGE = \"Compared values serialize to the same structure.\\nPrinting internal object structure without calling `toJSON` instead.\";\n\nfunction formatTrailingSpaces(line, trailingSpaceFormatter) {\n\treturn line.replace(/\\s+$/, (match) => trailingSpaceFormatter(match));\n}\nfunction printDiffLine(line, isFirstOrLast, color, indicator, trailingSpaceFormatter, emptyFirstOrLastLinePlaceholder) {\n\treturn line.length !== 0 ? color(`${indicator} ${formatTrailingSpaces(line, trailingSpaceFormatter)}`) : indicator !== \" \" ? color(indicator) : isFirstOrLast && emptyFirstOrLastLinePlaceholder.length !== 0 ? color(`${indicator} ${emptyFirstOrLastLinePlaceholder}`) : \"\";\n}\nfunction printDeleteLine(line, isFirstOrLast, { aColor, aIndicator, changeLineTrailingSpaceColor, emptyFirstOrLastLinePlaceholder }) {\n\treturn printDiffLine(line, isFirstOrLast, aColor, aIndicator, changeLineTrailingSpaceColor, emptyFirstOrLastLinePlaceholder);\n}\nfunction printInsertLine(line, isFirstOrLast, { bColor, bIndicator, changeLineTrailingSpaceColor, emptyFirstOrLastLinePlaceholder }) {\n\treturn printDiffLine(line, isFirstOrLast, bColor, bIndicator, changeLineTrailingSpaceColor, emptyFirstOrLastLinePlaceholder);\n}\nfunction printCommonLine(line, isFirstOrLast, { commonColor, commonIndicator, commonLineTrailingSpaceColor, emptyFirstOrLastLinePlaceholder }) {\n\treturn printDiffLine(line, isFirstOrLast, commonColor, commonIndicator, commonLineTrailingSpaceColor, emptyFirstOrLastLinePlaceholder);\n}\n// In GNU diff format, indexes are one-based instead of zero-based.\nfunction createPatchMark(aStart, aEnd, bStart, bEnd, { patchColor }) {\n\treturn patchColor(`@@ -${aStart + 1},${aEnd - aStart} +${bStart + 1},${bEnd - bStart} @@`);\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).\nfunction joinAlignedDiffsNoExpand(diffs, options) {\n\tconst iLength = diffs.length;\n\tconst nContextLines = options.contextLines;\n\tconst nContextLines2 = nContextLines + nContextLines;\n\t// First pass: count output lines and see if it has patches.\n\tlet jLength = iLength;\n\tlet hasExcessAtStartOrEnd = false;\n\tlet nExcessesBetweenChanges = 0;\n\tlet i = 0;\n\twhile (i !== iLength) {\n\t\tconst iStart = i;\n\t\twhile (i !== iLength && diffs[i][0] === DIFF_EQUAL) i += 1;\n\t\tif (iStart !== i) if (iStart === 0) {\n\t\t\t// at start\n\t\t\tif (i > nContextLines) {\n\t\t\t\tjLength -= i - nContextLines;\n\t\t\t\thasExcessAtStartOrEnd = true;\n\t\t\t}\n\t\t} else if (i === iLength) {\n\t\t\t// at end\n\t\t\tconst n = i - iStart;\n\t\t\tif (n > nContextLines) {\n\t\t\t\tjLength -= n - nContextLines;\n\t\t\t\thasExcessAtStartOrEnd = true;\n\t\t\t}\n\t\t} else {\n\t\t\t// between changes\n\t\t\tconst n = i - iStart;\n\t\t\tif (n > nContextLines2) {\n\t\t\t\tjLength -= n - nContextLines2;\n\t\t\t\tnExcessesBetweenChanges += 1;\n\t\t\t}\n\t\t}\n\t\twhile (i !== iLength && diffs[i][0] !== DIFF_EQUAL) i += 1;\n\t}\n\tconst hasPatch = nExcessesBetweenChanges !== 0 || hasExcessAtStartOrEnd;\n\tif (nExcessesBetweenChanges !== 0) jLength += nExcessesBetweenChanges + 1;\n\telse if (hasExcessAtStartOrEnd) jLength += 1;\n\tconst jLast = jLength - 1;\n\tconst lines = [];\n\tlet jPatchMark = 0;\n\tif (hasPatch) lines.push(\"\");\n\t// Indexes of expected or received lines in current patch:\n\tlet aStart = 0;\n\tlet bStart = 0;\n\tlet aEnd = 0;\n\tlet bEnd = 0;\n\tconst pushCommonLine = (line) => {\n\t\tconst j = lines.length;\n\t\tlines.push(printCommonLine(line, j === 0 || j === jLast, options));\n\t\taEnd += 1;\n\t\tbEnd += 1;\n\t};\n\tconst pushDeleteLine = (line) => {\n\t\tconst j = lines.length;\n\t\tlines.push(printDeleteLine(line, j === 0 || j === jLast, options));\n\t\taEnd += 1;\n\t};\n\tconst pushInsertLine = (line) => {\n\t\tconst j = lines.length;\n\t\tlines.push(printInsertLine(line, j === 0 || j === jLast, options));\n\t\tbEnd += 1;\n\t};\n\t// Second pass: push lines with diff formatting (and patch marks, if needed).\n\ti = 0;\n\twhile (i !== iLength) {\n\t\tlet iStart = i;\n\t\twhile (i !== iLength && diffs[i][0] === DIFF_EQUAL) i += 1;\n\t\tif (iStart !== i) if (iStart === 0) {\n\t\t\t// at beginning\n\t\t\tif (i > nContextLines) {\n\t\t\t\tiStart = i - nContextLines;\n\t\t\t\taStart = iStart;\n\t\t\t\tbStart = iStart;\n\t\t\t\taEnd = aStart;\n\t\t\t\tbEnd = bStart;\n\t\t\t}\n\t\t\tfor (let iCommon = iStart; iCommon !== i; iCommon += 1) pushCommonLine(diffs[iCommon][1]);\n\t\t} else if (i === iLength) {\n\t\t\t// at end\n\t\t\tconst iEnd = i - iStart > nContextLines ? iStart + nContextLines : i;\n\t\t\tfor (let iCommon = iStart; iCommon !== iEnd; iCommon += 1) pushCommonLine(diffs[iCommon][1]);\n\t\t} else {\n\t\t\t// between changes\n\t\t\tconst nCommon = i - iStart;\n\t\t\tif (nCommon > nContextLines2) {\n\t\t\t\tconst iEnd = iStart + nContextLines;\n\t\t\t\tfor (let iCommon = iStart; iCommon !== iEnd; iCommon += 1) pushCommonLine(diffs[iCommon][1]);\n\t\t\t\tlines[jPatchMark] = createPatchMark(aStart, aEnd, bStart, bEnd, options);\n\t\t\t\tjPatchMark = lines.length;\n\t\t\t\tlines.push(\"\");\n\t\t\t\tconst nOmit = nCommon - nContextLines2;\n\t\t\t\taStart = aEnd + nOmit;\n\t\t\t\tbStart = bEnd + nOmit;\n\t\t\t\taEnd = aStart;\n\t\t\t\tbEnd = bStart;\n\t\t\t\tfor (let iCommon = i - nContextLines; iCommon !== i; iCommon += 1) pushCommonLine(diffs[iCommon][1]);\n\t\t\t} else for (let iCommon = iStart; iCommon !== i; iCommon += 1) pushCommonLine(diffs[iCommon][1]);\n\t\t}\n\t\twhile (i !== iLength && diffs[i][0] === DIFF_DELETE) {\n\t\t\tpushDeleteLine(diffs[i][1]);\n\t\t\ti += 1;\n\t\t}\n\t\twhile (i !== iLength && diffs[i][0] === DIFF_INSERT) {\n\t\t\tpushInsertLine(diffs[i][1]);\n\t\t\ti += 1;\n\t\t}\n\t}\n\tif (hasPatch) lines[jPatchMark] = createPatchMark(aStart, aEnd, bStart, bEnd, options);\n\treturn lines.join(\"\\n\");\n}\n// jest --expand\n//\n// Given array of aligned strings with inverse highlight formatting,\n// return joined lines with diff formatting.\nfunction joinAlignedDiffsExpand(diffs, options) {\n\treturn diffs.map((diff, i, diffs) => {\n\t\tconst line = diff[1];\n\t\tconst isFirstOrLast = i === 0 || i === diffs.length - 1;\n\t\tswitch (diff[0]) {\n\t\t\tcase DIFF_DELETE: return printDeleteLine(line, isFirstOrLast, options);\n\t\t\tcase DIFF_INSERT: return printInsertLine(line, isFirstOrLast, options);\n\t\t\tdefault: return printCommonLine(line, isFirstOrLast, options);\n\t\t}\n\t}).join(\"\\n\");\n}\n\nconst noColor = (string) => string;\nconst DIFF_CONTEXT_DEFAULT = 5;\nconst DIFF_TRUNCATE_THRESHOLD_DEFAULT = 0;\nfunction getDefaultOptions() {\n\treturn {\n\t\taAnnotation: \"Expected\",\n\t\taColor: y.green,\n\t\taIndicator: \"-\",\n\t\tbAnnotation: \"Received\",\n\t\tbColor: y.red,\n\t\tbIndicator: \"+\",\n\t\tchangeColor: y.inverse,\n\t\tchangeLineTrailingSpaceColor: noColor,\n\t\tcommonColor: y.dim,\n\t\tcommonIndicator: \" \",\n\t\tcommonLineTrailingSpaceColor: noColor,\n\t\tcompareKeys: void 0,\n\t\tcontextLines: DIFF_CONTEXT_DEFAULT,\n\t\temptyFirstOrLastLinePlaceholder: \"\",\n\t\texpand: false,\n\t\tincludeChangeCounts: false,\n\t\tomitAnnotationLines: false,\n\t\tpatchColor: y.yellow,\n\t\tprintBasicPrototype: false,\n\t\ttruncateThreshold: DIFF_TRUNCATE_THRESHOLD_DEFAULT,\n\t\ttruncateAnnotation: \"... Diff result is truncated\",\n\t\ttruncateAnnotationColor: noColor\n\t};\n}\nfunction getCompareKeys(compareKeys) {\n\treturn compareKeys && typeof compareKeys === \"function\" ? compareKeys : void 0;\n}\nfunction getContextLines(contextLines) {\n\treturn typeof contextLines === \"number\" && Number.isSafeInteger(contextLines) && contextLines >= 0 ? contextLines : DIFF_CONTEXT_DEFAULT;\n}\n// Pure function returns options with all properties.\nfunction normalizeDiffOptions(options = {}) {\n\treturn {\n\t\t...getDefaultOptions(),\n\t\t...options,\n\t\tcompareKeys: getCompareKeys(options.compareKeys),\n\t\tcontextLines: getContextLines(options.contextLines)\n\t};\n}\n\nfunction isEmptyString(lines) {\n\treturn lines.length === 1 && lines[0].length === 0;\n}\nfunction countChanges(diffs) {\n\tlet a = 0;\n\tlet b = 0;\n\tdiffs.forEach((diff) => {\n\t\tswitch (diff[0]) {\n\t\t\tcase DIFF_DELETE:\n\t\t\t\ta += 1;\n\t\t\t\tbreak;\n\t\t\tcase DIFF_INSERT: b += 1;\n\t\t}\n\t});\n\treturn {\n\t\ta,\n\t\tb\n\t};\n}\nfunction printAnnotation({ aAnnotation, aColor, aIndicator, bAnnotation, bColor, bIndicator, includeChangeCounts, omitAnnotationLines }, changeCounts) {\n\tif (omitAnnotationLines) return \"\";\n\tlet aRest = \"\";\n\tlet bRest = \"\";\n\tif (includeChangeCounts) {\n\t\tconst aCount = String(changeCounts.a);\n\t\tconst bCount = String(changeCounts.b);\n\t\t// Padding right aligns the ends of the annotations.\n\t\tconst baAnnotationLengthDiff = bAnnotation.length - aAnnotation.length;\n\t\tconst aAnnotationPadding = \" \".repeat(Math.max(0, baAnnotationLengthDiff));\n\t\tconst bAnnotationPadding = \" \".repeat(Math.max(0, -baAnnotationLengthDiff));\n\t\t// Padding left aligns the ends of the counts.\n\t\tconst baCountLengthDiff = bCount.length - aCount.length;\n\t\tconst aCountPadding = \" \".repeat(Math.max(0, baCountLengthDiff));\n\t\tconst bCountPadding = \" \".repeat(Math.max(0, -baCountLengthDiff));\n\t\taRest = `${aAnnotationPadding}  ${aIndicator} ${aCountPadding}${aCount}`;\n\t\tbRest = `${bAnnotationPadding}  ${bIndicator} ${bCountPadding}${bCount}`;\n\t}\n\tconst a = `${aIndicator} ${aAnnotation}${aRest}`;\n\tconst b = `${bIndicator} ${bAnnotation}${bRest}`;\n\treturn `${aColor(a)}\\n${bColor(b)}\\n\\n`;\n}\nfunction printDiffLines(diffs, truncated, options) {\n\treturn printAnnotation(options, countChanges(diffs)) + (options.expand ? joinAlignedDiffsExpand(diffs, options) : joinAlignedDiffsNoExpand(diffs, options)) + (truncated ? options.truncateAnnotationColor(`\\n${options.truncateAnnotation}`) : \"\");\n}\n// Compare two arrays of strings line-by-line. Format as comparison lines.\nfunction diffLinesUnified(aLines, bLines, options) {\n\tconst normalizedOptions = normalizeDiffOptions(options);\n\tconst [diffs, truncated] = diffLinesRaw(isEmptyString(aLines) ? [] : aLines, isEmptyString(bLines) ? [] : bLines, normalizedOptions);\n\treturn printDiffLines(diffs, truncated, normalizedOptions);\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.\nfunction diffLinesUnified2(aLinesDisplay, bLinesDisplay, aLinesCompare, bLinesCompare, options) {\n\tif (isEmptyString(aLinesDisplay) && isEmptyString(aLinesCompare)) {\n\t\taLinesDisplay = [];\n\t\taLinesCompare = [];\n\t}\n\tif (isEmptyString(bLinesDisplay) && isEmptyString(bLinesCompare)) {\n\t\tbLinesDisplay = [];\n\t\tbLinesCompare = [];\n\t}\n\tif (aLinesDisplay.length !== aLinesCompare.length || bLinesDisplay.length !== bLinesCompare.length)\n // Fall back to diff of display lines.\n\treturn diffLinesUnified(aLinesDisplay, bLinesDisplay, options);\n\tconst [diffs, truncated] = diffLinesRaw(aLinesCompare, bLinesCompare, options);\n\t// Replace comparison lines with displayable lines.\n\tlet aIndex = 0;\n\tlet bIndex = 0;\n\tdiffs.forEach((diff) => {\n\t\tswitch (diff[0]) {\n\t\t\tcase DIFF_DELETE:\n\t\t\t\tdiff[1] = aLinesDisplay[aIndex];\n\t\t\t\taIndex += 1;\n\t\t\t\tbreak;\n\t\t\tcase DIFF_INSERT:\n\t\t\t\tdiff[1] = bLinesDisplay[bIndex];\n\t\t\t\tbIndex += 1;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tdiff[1] = bLinesDisplay[bIndex];\n\t\t\t\taIndex += 1;\n\t\t\t\tbIndex += 1;\n\t\t}\n\t});\n\treturn printDiffLines(diffs, truncated, normalizeDiffOptions(options));\n}\n// Compare two arrays of strings line-by-line.\nfunction diffLinesRaw(aLines, bLines, options) {\n\tconst truncate = options?.truncateThreshold ?? false;\n\tconst truncateThreshold = Math.max(Math.floor(options?.truncateThreshold ?? 0), 0);\n\tconst aLength = truncate ? Math.min(aLines.length, truncateThreshold) : aLines.length;\n\tconst bLength = truncate ? Math.min(bLines.length, truncateThreshold) : bLines.length;\n\tconst truncated = aLength !== aLines.length || bLength !== bLines.length;\n\tconst isCommon = (aIndex, bIndex) => aLines[aIndex] === bLines[bIndex];\n\tconst diffs = [];\n\tlet aIndex = 0;\n\tlet bIndex = 0;\n\tconst foundSubsequence = (nCommon, aCommon, bCommon) => {\n\t\tfor (; aIndex !== aCommon; aIndex += 1) diffs.push(new Diff(DIFF_DELETE, aLines[aIndex]));\n\t\tfor (; bIndex !== bCommon; bIndex += 1) diffs.push(new Diff(DIFF_INSERT, bLines[bIndex]));\n\t\tfor (; nCommon !== 0; nCommon -= 1, aIndex += 1, bIndex += 1) diffs.push(new Diff(DIFF_EQUAL, bLines[bIndex]));\n\t};\n\tdiffSequences(aLength, bLength, isCommon, foundSubsequence);\n\t// After the last common subsequence, push remaining change items.\n\tfor (; aIndex !== aLength; aIndex += 1) diffs.push(new Diff(DIFF_DELETE, aLines[aIndex]));\n\tfor (; bIndex !== bLength; bIndex += 1) diffs.push(new Diff(DIFF_INSERT, bLines[bIndex]));\n\treturn [diffs, truncated];\n}\n\n// get the type of a value with handling the edge cases like `typeof []`\n// and `typeof null`\nfunction getType(value) {\n\tif (value === void 0) return \"undefined\";\n\telse if (value === null) return \"null\";\n\telse if (Array.isArray(value)) return \"array\";\n\telse if (typeof value === \"boolean\") return \"boolean\";\n\telse if (typeof value === \"function\") return \"function\";\n\telse if (typeof value === \"number\") return \"number\";\n\telse if (typeof value === \"string\") return \"string\";\n\telse if (typeof value === \"bigint\") return \"bigint\";\n\telse if (typeof value === \"object\") {\n\t\tif (value != null) {\n\t\t\tif (value.constructor === RegExp) return \"regexp\";\n\t\t\telse if (value.constructor === Map) return \"map\";\n\t\t\telse if (value.constructor === Set) return \"set\";\n\t\t\telse if (value.constructor === Date) return \"date\";\n\t\t}\n\t\treturn \"object\";\n\t} else if (typeof value === \"symbol\") return \"symbol\";\n\tthrow new Error(`value of unknown type: ${value}`);\n}\n\n// platforms compatible\nfunction getNewLineSymbol(string) {\n\treturn string.includes(\"\\r\\n\") ? \"\\r\\n\" : \"\\n\";\n}\nfunction diffStrings(a, b, options) {\n\tconst truncate = options?.truncateThreshold ?? false;\n\tconst truncateThreshold = Math.max(Math.floor(options?.truncateThreshold ?? 0), 0);\n\tlet aLength = a.length;\n\tlet bLength = b.length;\n\tif (truncate) {\n\t\tconst aMultipleLines = a.includes(\"\\n\");\n\t\tconst bMultipleLines = b.includes(\"\\n\");\n\t\tconst aNewLineSymbol = getNewLineSymbol(a);\n\t\tconst bNewLineSymbol = getNewLineSymbol(b);\n\t\t// multiple-lines string expects a newline to be appended at the end\n\t\tconst _a = aMultipleLines ? `${a.split(aNewLineSymbol, truncateThreshold).join(aNewLineSymbol)}\\n` : a;\n\t\tconst _b = bMultipleLines ? `${b.split(bNewLineSymbol, truncateThreshold).join(bNewLineSymbol)}\\n` : b;\n\t\taLength = _a.length;\n\t\tbLength = _b.length;\n\t}\n\tconst truncated = aLength !== a.length || bLength !== b.length;\n\tconst isCommon = (aIndex, bIndex) => a[aIndex] === b[bIndex];\n\tlet aIndex = 0;\n\tlet bIndex = 0;\n\tconst diffs = [];\n\tconst foundSubsequence = (nCommon, aCommon, bCommon) => {\n\t\tif (aIndex !== aCommon) diffs.push(new Diff(DIFF_DELETE, a.slice(aIndex, aCommon)));\n\t\tif (bIndex !== bCommon) diffs.push(new Diff(DIFF_INSERT, b.slice(bIndex, bCommon)));\n\t\taIndex = aCommon + nCommon;\n\t\tbIndex = bCommon + nCommon;\n\t\tdiffs.push(new Diff(DIFF_EQUAL, b.slice(bCommon, bIndex)));\n\t};\n\tdiffSequences(aLength, bLength, isCommon, foundSubsequence);\n\t// After the last common subsequence, push remaining change items.\n\tif (aIndex !== aLength) diffs.push(new Diff(DIFF_DELETE, a.slice(aIndex)));\n\tif (bIndex !== bLength) diffs.push(new Diff(DIFF_INSERT, b.slice(bIndex)));\n\treturn [diffs, truncated];\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\nfunction concatenateRelevantDiffs(op, diffs, changeColor) {\n\treturn diffs.reduce((reduced, diff) => reduced + (diff[0] === DIFF_EQUAL ? diff[1] : diff[0] === op && diff[1].length !== 0 ? changeColor(diff[1]) : \"\"), \"\");\n}\n// Encapsulate change lines until either a common newline or the end.\nclass ChangeBuffer {\n\top;\n\tline;\n\tlines;\n\tchangeColor;\n\tconstructor(op, changeColor) {\n\t\tthis.op = op;\n\t\tthis.line = [];\n\t\tthis.lines = [];\n\t\tthis.changeColor = changeColor;\n\t}\n\tpushSubstring(substring) {\n\t\tthis.pushDiff(new Diff(this.op, substring));\n\t}\n\tpushLine() {\n\t\t// Assume call only if line has at least one diff,\n\t\t// therefore an empty line must have a diff which has an empty string.\n\t\t// If line has multiple diffs, then assume it has a common diff,\n\t\t// therefore change diffs have change color;\n\t\t// otherwise then it has line color only.\n\t\tthis.lines.push(this.line.length !== 1 ? new Diff(this.op, concatenateRelevantDiffs(this.op, this.line, this.changeColor)) : this.line[0][0] === this.op ? this.line[0] : new Diff(this.op, this.line[0][1]));\n\t\tthis.line.length = 0;\n\t}\n\tisLineEmpty() {\n\t\treturn this.line.length === 0;\n\t}\n\t// Minor input to buffer.\n\tpushDiff(diff) {\n\t\tthis.line.push(diff);\n\t}\n\t// Main input to buffer.\n\talign(diff) {\n\t\tconst string = diff[1];\n\t\tif (string.includes(\"\\n\")) {\n\t\t\tconst substrings = string.split(\"\\n\");\n\t\t\tconst iLast = substrings.length - 1;\n\t\t\tsubstrings.forEach((substring, i) => {\n\t\t\t\tif (i < iLast) {\n\t\t\t\t\t// The first substring completes the current change line.\n\t\t\t\t\t// A middle substring is a change line.\n\t\t\t\t\tthis.pushSubstring(substring);\n\t\t\t\t\tthis.pushLine();\n\t\t\t\t} else if (substring.length !== 0)\n // The last substring starts a change line, if it is not empty.\n\t\t\t\t// Important: This non-empty condition also automatically omits\n\t\t\t\t// the newline appended to the end of expected and received strings.\n\t\t\t\tthis.pushSubstring(substring);\n\t\t\t});\n\t\t} else\n // Append non-multiline string to current change line.\n\t\tthis.pushDiff(diff);\n\t}\n\t// Output from buffer.\n\tmoveLinesTo(lines) {\n\t\tif (!this.isLineEmpty()) this.pushLine();\n\t\tlines.push(...this.lines);\n\t\tthis.lines.length = 0;\n\t}\n}\n// Encapsulate common and change lines.\nclass CommonBuffer {\n\tdeleteBuffer;\n\tinsertBuffer;\n\tlines;\n\tconstructor(deleteBuffer, insertBuffer) {\n\t\tthis.deleteBuffer = deleteBuffer;\n\t\tthis.insertBuffer = insertBuffer;\n\t\tthis.lines = [];\n\t}\n\tpushDiffCommonLine(diff) {\n\t\tthis.lines.push(diff);\n\t}\n\tpushDiffChangeLines(diff) {\n\t\tconst isDiffEmpty = diff[1].length === 0;\n\t\t// An empty diff string is redundant, unless a change line is empty.\n\t\tif (!isDiffEmpty || this.deleteBuffer.isLineEmpty()) this.deleteBuffer.pushDiff(diff);\n\t\tif (!isDiffEmpty || this.insertBuffer.isLineEmpty()) this.insertBuffer.pushDiff(diff);\n\t}\n\tflushChangeLines() {\n\t\tthis.deleteBuffer.moveLinesTo(this.lines);\n\t\tthis.insertBuffer.moveLinesTo(this.lines);\n\t}\n\t// Input to buffer.\n\talign(diff) {\n\t\tconst op = diff[0];\n\t\tconst string = diff[1];\n\t\tif (string.includes(\"\\n\")) {\n\t\t\tconst substrings = string.split(\"\\n\");\n\t\t\tconst iLast = substrings.length - 1;\n\t\t\tsubstrings.forEach((substring, i) => {\n\t\t\t\tif (i === 0) {\n\t\t\t\t\tconst subdiff = new Diff(op, substring);\n\t\t\t\t\tif (this.deleteBuffer.isLineEmpty() && this.insertBuffer.isLineEmpty()) {\n\t\t\t\t\t\t// If both current change lines are empty,\n\t\t\t\t\t\t// then the first substring is a common line.\n\t\t\t\t\t\tthis.flushChangeLines();\n\t\t\t\t\t\tthis.pushDiffCommonLine(subdiff);\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// If either current change line is non-empty,\n\t\t\t\t\t\t// then the first substring completes the change lines.\n\t\t\t\t\t\tthis.pushDiffChangeLines(subdiff);\n\t\t\t\t\t\tthis.flushChangeLines();\n\t\t\t\t\t}\n\t\t\t\t} else if (i < iLast)\n // A middle substring is a common line.\n\t\t\t\tthis.pushDiffCommonLine(new Diff(op, substring));\n\t\t\t\telse if (substring.length !== 0)\n // The last substring starts a change line, if it is not empty.\n\t\t\t\t// Important: This non-empty condition also automatically omits\n\t\t\t\t// the newline appended to the end of expected and received strings.\n\t\t\t\tthis.pushDiffChangeLines(new Diff(op, substring));\n\t\t\t});\n\t\t} else\n // Append non-multiline string to current change lines.\n\t\t// Important: It cannot be at the end following empty change lines,\n\t\t// because newline appended to the end of expected and received strings.\n\t\tthis.pushDiffChangeLines(diff);\n\t}\n\t// Output from buffer.\n\tgetLines() {\n\t\tthis.flushChangeLines();\n\t\treturn this.lines;\n\t}\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\nfunction getAlignedDiffs(diffs, changeColor) {\n\tconst deleteBuffer = new ChangeBuffer(DIFF_DELETE, changeColor);\n\tconst insertBuffer = new ChangeBuffer(DIFF_INSERT, changeColor);\n\tconst commonBuffer = new CommonBuffer(deleteBuffer, insertBuffer);\n\tdiffs.forEach((diff) => {\n\t\tswitch (diff[0]) {\n\t\t\tcase DIFF_DELETE:\n\t\t\t\tdeleteBuffer.align(diff);\n\t\t\t\tbreak;\n\t\t\tcase DIFF_INSERT:\n\t\t\t\tinsertBuffer.align(diff);\n\t\t\t\tbreak;\n\t\t\tdefault: commonBuffer.align(diff);\n\t\t}\n\t});\n\treturn commonBuffer.getLines();\n}\n\nfunction hasCommonDiff(diffs, isMultiline) {\n\tif (isMultiline) {\n\t\t// Important: Ignore common newline that was appended to multiline strings!\n\t\tconst iLast = diffs.length - 1;\n\t\treturn diffs.some((diff, i) => diff[0] === DIFF_EQUAL && (i !== iLast || diff[1] !== \"\\n\"));\n\t}\n\treturn diffs.some((diff) => diff[0] === DIFF_EQUAL);\n}\n// Compare two strings character-by-character.\n// Format as comparison lines in which changed substrings have inverse colors.\nfunction diffStringsUnified(a, b, options) {\n\tif (a !== b && a.length !== 0 && b.length !== 0) {\n\t\tconst isMultiline = a.includes(\"\\n\") || b.includes(\"\\n\");\n\t\t// getAlignedDiffs assumes that a newline was appended to the strings.\n\t\tconst [diffs, truncated] = diffStringsRaw(isMultiline ? `${a}\\n` : a, isMultiline ? `${b}\\n` : b, true, options);\n\t\tif (hasCommonDiff(diffs, isMultiline)) {\n\t\t\tconst optionsNormalized = normalizeDiffOptions(options);\n\t\t\tconst lines = getAlignedDiffs(diffs, optionsNormalized.changeColor);\n\t\t\treturn printDiffLines(lines, truncated, optionsNormalized);\n\t\t}\n\t}\n\t// Fall back to line-by-line diff.\n\treturn diffLinesUnified(a.split(\"\\n\"), b.split(\"\\n\"), options);\n}\n// Compare two strings character-by-character.\n// Optionally clean up small common substrings, also known as chaff.\nfunction diffStringsRaw(a, b, cleanup, options) {\n\tconst [diffs, truncated] = diffStrings(a, b, options);\n\tdiff_cleanupSemantic(diffs);\n\treturn [diffs, truncated];\n}\n\nfunction getCommonMessage(message, options) {\n\tconst { commonColor } = normalizeDiffOptions(options);\n\treturn commonColor(message);\n}\nconst { AsymmetricMatcher, DOMCollection, DOMElement, Immutable, ReactElement, ReactTestComponent } = plugins;\nconst PLUGINS = [\n\tReactTestComponent,\n\tReactElement,\n\tDOMElement,\n\tDOMCollection,\n\tImmutable,\n\tAsymmetricMatcher,\n\tplugins.Error\n];\nconst FORMAT_OPTIONS = {\n\tmaxDepth: 20,\n\tplugins: PLUGINS\n};\nconst FALLBACK_FORMAT_OPTIONS = {\n\tcallToJSON: false,\n\tmaxDepth: 8,\n\tplugins: PLUGINS\n};\nconst DEFAULT_MEMORIZE = (_, v) => v;\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/**\n* @param a Expected value\n* @param b Received value\n* @param options Diff options\n* @returns {string | null} a string diff\n*/\nfunction diff(a, b, options, memorize = DEFAULT_MEMORIZE) {\n\tif (Object.is(a, b)) return \"\";\n\tconst aType = getType(a);\n\tlet expectedType = aType;\n\tlet omitDifference = false;\n\tif (aType === \"object\" && typeof a.asymmetricMatch === \"function\") {\n\t\tif (a.$$typeof !== Symbol.for(\"jest.asymmetricMatcher\"))\n // Do not know expected type of user-defined asymmetric matcher.\n\t\treturn;\n\t\tif (typeof a.getExpectedType !== \"function\")\n // For example, expect.anything() matches either null or undefined\n\t\treturn;\n\t\texpectedType = a.getExpectedType();\n\t\t// Primitive types boolean and number omit difference below.\n\t\t// For example, omit difference for expect.stringMatching(regexp)\n\t\tomitDifference = expectedType === \"string\";\n\t}\n\tif (expectedType !== getType(b)) {\n\t\tconst { aAnnotation, aColor, aIndicator, bAnnotation, bColor, bIndicator } = normalizeDiffOptions(options);\n\t\tconst formatOptions = getFormatOptions(FALLBACK_FORMAT_OPTIONS, options);\n\t\tlet aDisplay = format(a, formatOptions);\n\t\tlet bDisplay = format(b, formatOptions);\n\t\t// even if prettyFormat prints successfully big objects,\n\t\t// large string can choke later on (concatenation? RPC?),\n\t\t// so truncate it to a reasonable length here.\n\t\t// (For example, playwright's ElementHandle can become about 200_000_000 length string)\n\t\tconst MAX_LENGTH = 1e5;\n\t\tfunction truncate(s) {\n\t\t\treturn s.length <= MAX_LENGTH ? s : `${s.slice(0, MAX_LENGTH)}...`;\n\t\t}\n\t\taDisplay = memorize(\"expected\", truncate(aDisplay));\n\t\tbDisplay = memorize(\"actual\", truncate(bDisplay));\n\t\treturn `${`${aColor(`${aIndicator} ${aAnnotation}:`)}\\n${aDisplay}`}\\n\\n${`${bColor(`${bIndicator} ${bAnnotation}:`)}\\n${bDisplay}`}`;\n\t}\n\tif (omitDifference) return;\n\tswitch (aType) {\n\t\tcase \"string\": return diffLinesUnified(a.split(\"\\n\"), b.split(\"\\n\"), options);\n\t\tcase \"boolean\":\n\t\tcase \"number\": return comparePrimitive(a, b, options, memorize);\n\t\tcase \"map\": return compareObjects(sortMap(a), sortMap(b), options, memorize);\n\t\tcase \"set\": return compareObjects(sortSet(a), sortSet(b), options, memorize);\n\t\tdefault: return compareObjects(a, b, options, memorize);\n\t}\n}\nfunction createMemorize(memory) {\n\treturn (pointer, stringifiedValue) => {\n\t\tmemory[pointer] = stringifiedValue;\n\t\treturn stringifiedValue;\n\t};\n}\nfunction comparePrimitive(a, b, options, memorize = DEFAULT_MEMORIZE) {\n\tconst aFormat = memorize(\"expected\", format(a, FORMAT_OPTIONS));\n\tconst bFormat = memorize(\"actual\", format(b, FORMAT_OPTIONS));\n\treturn aFormat === bFormat ? \"\" : diffLinesUnified(aFormat.split(\"\\n\"), bFormat.split(\"\\n\"), options);\n}\nfunction sortMap(map) {\n\treturn new Map(Array.from(map.entries()).sort());\n}\nfunction sortSet(set) {\n\treturn new Set(Array.from(set.values()).sort());\n}\nfunction compareObjects(a, b, options, memorize = DEFAULT_MEMORIZE) {\n\tlet difference;\n\tlet hasThrown = false;\n\ttry {\n\t\tdifference = getObjectsDifference(a, b, getFormatOptions(FORMAT_OPTIONS, options), options, memorize);\n\t} catch {\n\t\thasThrown = true;\n\t}\n\tconst noDiffMessage = getCommonMessage(NO_DIFF_MESSAGE, options);\n\t// If the comparison yields no results, compare again but this time\n\t// without calling `toJSON`. It's also possible that toJSON might throw.\n\tif (difference === void 0 || difference === noDiffMessage) {\n\t\tdifference = getObjectsDifference(a, b, getFormatOptions(FALLBACK_FORMAT_OPTIONS, options), options, memorize);\n\t\tif (difference !== noDiffMessage && !hasThrown) difference = `${getCommonMessage(SIMILAR_MESSAGE, options)}\\n\\n${difference}`;\n\t}\n\treturn difference;\n}\nfunction getDefaultFormatOptions(options) {\n\treturn getFormatOptions(FORMAT_OPTIONS, options);\n}\nfunction getFormatOptions(formatOptions, options) {\n\tconst { compareKeys, printBasicPrototype, maxDepth } = normalizeDiffOptions(options);\n\treturn {\n\t\t...formatOptions,\n\t\tcompareKeys,\n\t\tprintBasicPrototype,\n\t\tmaxDepth: maxDepth ?? formatOptions.maxDepth\n\t};\n}\nfunction getObjectsDifference(a, b, formatOptions, options, memorize = DEFAULT_MEMORIZE) {\n\tconst formatOptionsZeroIndent = {\n\t\t...formatOptions,\n\t\tindent: 0\n\t};\n\tconst aCompare = format(a, formatOptionsZeroIndent);\n\tconst bCompare = format(b, formatOptionsZeroIndent);\n\tif (aCompare === bCompare) return getCommonMessage(NO_DIFF_MESSAGE, options);\n\telse {\n\t\tconst aDisplay = memorize(\"expected\", format(a, formatOptions));\n\t\tconst bDisplay = memorize(\"actual\", format(b, formatOptions));\n\t\treturn diffLinesUnified2(aDisplay.split(\"\\n\"), bDisplay.split(\"\\n\"), aCompare.split(\"\\n\"), bCompare.split(\"\\n\"), options);\n\t}\n}\nconst MAX_DIFF_STRING_LENGTH = 2e4;\nfunction isAsymmetricMatcher(data) {\n\treturn getType$1(data) === \"Object\" && typeof data.asymmetricMatch === \"function\";\n}\nfunction isReplaceable(obj1, obj2) {\n\tconst obj1Type = getType$1(obj1);\n\treturn obj1Type === getType$1(obj2) && (obj1Type === \"Object\" || obj1Type === \"Array\");\n}\nfunction printDiffOrStringify(received, expected, options, memory) {\n\tconst { aAnnotation, bAnnotation } = normalizeDiffOptions(options);\n\tif (typeof expected === \"string\" && typeof received === \"string\" && expected.length > 0 && received.length > 0 && expected.length <= MAX_DIFF_STRING_LENGTH && received.length <= MAX_DIFF_STRING_LENGTH && expected !== received) {\n\t\tif (expected.includes(\"\\n\") || received.includes(\"\\n\")) return diffStringsUnified(expected, received, options);\n\t\tconst [diffs] = diffStringsRaw(expected, received);\n\t\tconst hasCommonDiff = diffs.some((diff) => diff[0] === DIFF_EQUAL);\n\t\tconst printLabel = getLabelPrinter(aAnnotation, bAnnotation);\n\t\treturn `${printLabel(aAnnotation) + printExpected(getCommonAndChangedSubstrings(diffs, DIFF_DELETE, hasCommonDiff))}\\n${printLabel(bAnnotation) + printReceived(getCommonAndChangedSubstrings(diffs, DIFF_INSERT, hasCommonDiff))}`;\n\t}\n\t// if (isLineDiffable(expected, received)) {\n\tconst clonedExpected = deepClone(expected, { forceWritable: true });\n\tconst { replacedExpected, replacedActual } = replaceAsymmetricMatcher(deepClone(received, { forceWritable: true }), clonedExpected);\n\treturn diff(replacedExpected, replacedActual, options, memory ? createMemorize(memory) : DEFAULT_MEMORIZE);\n\t// }\n\t// const printLabel = getLabelPrinter(aAnnotation, bAnnotation)\n\t// const expectedLine = printLabel(aAnnotation) + printExpected(expected)\n\t// const receivedLine\n\t//   = printLabel(bAnnotation)\n\t//   + (stringify(expected) === stringify(received)\n\t//     ? 'serializes to the same string'\n\t//     : printReceived(received))\n\t// return `${expectedLine}\\n${receivedLine}`\n}\nfunction replaceAsymmetricMatcher(actual, expected, actualReplaced = /* @__PURE__ */ new WeakSet(), expectedReplaced = /* @__PURE__ */ new WeakSet()) {\n\t// handle asymmetric Error.cause diff\n\tif (actual instanceof Error && expected instanceof Error && typeof actual.cause !== \"undefined\" && typeof expected.cause === \"undefined\") {\n\t\tdelete actual.cause;\n\t\treturn {\n\t\t\treplacedActual: actual,\n\t\t\treplacedExpected: expected\n\t\t};\n\t}\n\tif (!isReplaceable(actual, expected)) return {\n\t\treplacedActual: actual,\n\t\treplacedExpected: expected\n\t};\n\tif (actualReplaced.has(actual) || expectedReplaced.has(expected)) return {\n\t\treplacedActual: actual,\n\t\treplacedExpected: expected\n\t};\n\tactualReplaced.add(actual);\n\texpectedReplaced.add(expected);\n\tgetOwnProperties(expected).forEach((key) => {\n\t\tconst expectedValue = expected[key];\n\t\tconst actualValue = actual[key];\n\t\tif (isAsymmetricMatcher(expectedValue)) {\n\t\t\tif (expectedValue.asymmetricMatch(actualValue))\n // When matcher matches, replace expected with actual value\n\t\t\t// so they appear the same in the diff\n\t\t\texpected[key] = actualValue;\n\t\t\telse if (\"sample\" in expectedValue && expectedValue.sample !== void 0 && isReplaceable(actualValue, expectedValue.sample)) {\n\t\t\t\t// For container matchers (ArrayContaining, ObjectContaining), unwrap and recursively process\n\t\t\t\t// Matcher doesn't match: unwrap but keep structure to show mismatch\n\t\t\t\tconst replaced = replaceAsymmetricMatcher(actualValue, expectedValue.sample, actualReplaced, expectedReplaced);\n\t\t\t\tactual[key] = replaced.replacedActual;\n\t\t\t\texpected[key] = replaced.replacedExpected;\n\t\t\t}\n\t\t} else if (isAsymmetricMatcher(actualValue)) {\n\t\t\tif (actualValue.asymmetricMatch(expectedValue)) actual[key] = expectedValue;\n\t\t\telse if (\"sample\" in actualValue && actualValue.sample !== void 0 && isReplaceable(actualValue.sample, expectedValue)) {\n\t\t\t\tconst replaced = replaceAsymmetricMatcher(actualValue.sample, expectedValue, actualReplaced, expectedReplaced);\n\t\t\t\tactual[key] = replaced.replacedActual;\n\t\t\t\texpected[key] = replaced.replacedExpected;\n\t\t\t}\n\t\t} else if (isReplaceable(actualValue, expectedValue)) {\n\t\t\tconst replaced = replaceAsymmetricMatcher(actualValue, expectedValue, actualReplaced, expectedReplaced);\n\t\t\tactual[key] = replaced.replacedActual;\n\t\t\texpected[key] = replaced.replacedExpected;\n\t\t}\n\t});\n\treturn {\n\t\treplacedActual: actual,\n\t\treplacedExpected: expected\n\t};\n}\nfunction getLabelPrinter(...strings) {\n\tconst maxLength = strings.reduce((max, string) => string.length > max ? string.length : max, 0);\n\treturn (string) => `${string}: ${\" \".repeat(maxLength - string.length)}`;\n}\nconst SPACE_SYMBOL = \"·\";\nfunction replaceTrailingSpaces(text) {\n\treturn text.replace(/\\s+$/gm, (spaces) => SPACE_SYMBOL.repeat(spaces.length));\n}\nfunction printReceived(object) {\n\treturn y.red(replaceTrailingSpaces(stringify(object)));\n}\nfunction printExpected(value) {\n\treturn y.green(replaceTrailingSpaces(stringify(value)));\n}\nfunction getCommonAndChangedSubstrings(diffs, op, hasCommonDiff) {\n\treturn diffs.reduce((reduced, diff) => reduced + (diff[0] === DIFF_EQUAL ? diff[1] : diff[0] === op ? hasCommonDiff ? y.inverse(diff[1]) : diff[1] : \"\"), \"\");\n}\n\nfunction processError(_err, diffOptions, seen = /* @__PURE__ */ new WeakSet()) {\n\tif (!_err || typeof _err !== \"object\") return { message: String(_err) };\n\tconst err = _err;\n\tif (err.showDiff || err.showDiff === void 0 && err.expected !== void 0 && err.actual !== void 0) {\n\t\tconst options = {\n\t\t\t...diffOptions,\n\t\t\t...err.diffOptions\n\t\t};\n\t\terr.diff = printDiffOrStringify(err.actual, err.expected, options, err);\n\t\terr.expected = prettifyValue(err.expected, options);\n\t\terr.actual = prettifyValue(err.actual, options);\n\t}\n\t// some Error implementations may not allow rewriting cause\n\t// in most cases, the assignment will lead to \"err.cause = err.cause\"\n\ttry {\n\t\tif (!seen.has(err) && typeof err.cause === \"object\") {\n\t\t\tseen.add(err);\n\t\t\terr.cause = processError(err.cause, diffOptions, seen);\n\t\t}\n\t} catch {}\n\ttry {\n\t\treturn serializeValue(err);\n\t} catch (e) {\n\t\treturn serializeValue(/* @__PURE__ */ new Error(`Failed to fully serialize error: ${e?.message}\\nInner error message: ${err?.message}`));\n\t}\n}\nfunction prettifyValue(value, options) {\n\tif (typeof value !== \"string\") return format(value, getDefaultFormatOptions(options));\n\treturn value;\n}\n\n/**\n* Return a function for running multiple async operations with limited concurrency.\n*/\nfunction limitConcurrency(concurrency = Infinity) {\n\t// The number of currently active + pending tasks.\n\tlet count = 0;\n\t// The head and tail of the pending task queue, built using a singly linked list.\n\t// Both head and tail are initially undefined, signifying an empty queue.\n\t// They both become undefined again whenever there are no pending tasks.\n\tlet head;\n\tlet tail;\n\t// A bookkeeping function executed whenever a task has been run to completion.\n\tconst finish = () => {\n\t\tcount--;\n\t\t// Check if there are further pending tasks in the queue.\n\t\tif (head) {\n\t\t\t// Allow the next pending task to run and pop it from the queue.\n\t\t\thead[0]();\n\t\t\thead = head[1];\n\t\t\t// The head may now be undefined if there are no further pending tasks.\n\t\t\t// In that case, set tail to undefined as well.\n\t\t\ttail = head && tail;\n\t\t}\n\t};\n\tconst acquire = () => {\n\t\tlet released = false;\n\t\tconst release = () => {\n\t\t\tif (!released) {\n\t\t\t\treleased = true;\n\t\t\t\tfinish();\n\t\t\t}\n\t\t};\n\t\tif (count++ < concurrency) return release;\n\t\treturn new Promise((resolve) => {\n\t\t\tif (tail)\n // There are pending tasks, so append to the queue.\n\t\t\ttail = tail[1] = [() => resolve(release)];\n\t\t\telse\n // No other pending tasks, initialize the queue with a new tail and head.\n\t\t\thead = tail = [() => resolve(release)];\n\t\t});\n\t};\n\tconst limiterFn = (func, ...args) => {\n\t\tfunction run(release) {\n\t\t\ttry {\n\t\t\t\tconst result = func(...args);\n\t\t\t\tif (result instanceof Promise) return result.finally(release);\n\t\t\t\trelease();\n\t\t\t\treturn Promise.resolve(result);\n\t\t\t} catch (error) {\n\t\t\t\trelease();\n\t\t\t\treturn Promise.reject(error);\n\t\t\t}\n\t\t}\n\t\tconst release = acquire();\n\t\treturn release instanceof Promise ? release.then(run) : run(release);\n\t};\n\treturn Object.assign(limiterFn, { acquire });\n}\n\nclass PendingError extends Error {\n\tmessage;\n\tnote;\n\tcode = \"VITEST_PENDING\";\n\ttaskId;\n\tconstructor(message, task, note) {\n\t\tsuper(message);\n\t\tthis.message = message;\n\t\tthis.note = note;\n\t\tthis.taskId = task.id;\n\t}\n}\nclass TestRunAbortError extends Error {\n\tname = \"TestRunAbortError\";\n\treason;\n\tconstructor(message, reason) {\n\t\tsuper(message);\n\t\tthis.reason = reason;\n\t}\n}\nclass FixtureDependencyError extends Error {\n\tname = \"FixtureDependencyError\";\n}\nclass FixtureAccessError extends Error {\n\tname = \"FixtureAccessError\";\n}\nclass FixtureParseError extends Error {\n\tname = \"FixtureParseError\";\n}\nclass AroundHookSetupError extends Error {\n\tname = \"AroundHookSetupError\";\n}\nclass AroundHookTeardownError extends Error {\n\tname = \"AroundHookTeardownError\";\n}\nclass AroundHookMultipleCallsError extends Error {\n\tname = \"AroundHookMultipleCallsError\";\n}\n// `test.fails` doesn't flip the test result when this error is thrown\nclass TestSyntaxError extends Error {\n\tname = \"TestSyntaxError\";\n\tconstructor(message) {\n\t\tsuper(message);\n\t\t// use custom property so this survives when the error\n\t\t// is serialized on `packages/expect` side (e.g. for `expect.soft`)\n\t\t// and the runner can still detect it during `test.fails` handling\n\t\tObject.defineProperty(this, \"__vitest_test_syntax_error__\", {\n\t\t\tvalue: true,\n\t\t\tenumerable: false\n\t\t});\n\t}\n}\n\n// use WeakMap here to make the Test and Suite object serializable\nconst fnMap = /* @__PURE__ */ new WeakMap();\nconst testFixtureMap = /* @__PURE__ */ new WeakMap();\nconst hooksMap = /* @__PURE__ */ new WeakMap();\nfunction setFn(key, fn) {\n\tfnMap.set(key, fn);\n}\nfunction getFn(key) {\n\treturn fnMap.get(key);\n}\nfunction setTestFixture(key, fixture) {\n\ttestFixtureMap.set(key, fixture);\n}\nfunction getTestFixtures(key) {\n\treturn testFixtureMap.get(key);\n}\nfunction setHooks(key, hooks) {\n\thooksMap.set(key, hooks);\n}\nfunction getHooks(key) {\n\treturn hooksMap.get(key);\n}\n\nconst FIXTURE_STACK_TRACE_KEY = Symbol.for(\"VITEST_FIXTURE_STACK_TRACE\");\nclass TestFixtures {\n\t_suiteContexts;\n\t_overrides = /* @__PURE__ */ new WeakMap();\n\t_registrations;\n\tstatic _definitions = [];\n\tstatic _builtinFixtures = [\n\t\t\"task\",\n\t\t\"signal\",\n\t\t\"onTestFailed\",\n\t\t\"onTestFinished\",\n\t\t\"skip\",\n\t\t\"annotate\",\n\t\t\"bench\"\n\t];\n\tstatic _fixtureOptionKeys = [\n\t\t\"auto\",\n\t\t\"injected\",\n\t\t\"scope\"\n\t];\n\tstatic _fixtureScopes = [\n\t\t\"test\",\n\t\t\"file\",\n\t\t\"worker\"\n\t];\n\tstatic _workerContextSuite = { type: \"worker\" };\n\tstatic clearDefinitions() {\n\t\tTestFixtures._definitions.length = 0;\n\t}\n\tstatic getWorkerContexts() {\n\t\treturn TestFixtures._definitions.map((f) => f.getWorkerContext());\n\t}\n\tstatic getFileContexts(file) {\n\t\treturn TestFixtures._definitions.map((f) => f.getFileContext(file));\n\t}\n\tstatic isFixtureOptions(obj) {\n\t\treturn isObject(obj) && Object.keys(obj).some((key) => TestFixtures._fixtureOptionKeys.includes(key));\n\t}\n\tconstructor(registrations) {\n\t\tthis._registrations = registrations ?? /* @__PURE__ */ new Map();\n\t\tthis._suiteContexts = /* @__PURE__ */ new WeakMap();\n\t\tTestFixtures._definitions.push(this);\n\t}\n\textend(runner, userFixtures) {\n\t\tconst { suite } = getCurrentSuite();\n\t\tconst isTopLevel = !suite || suite.file === suite;\n\t\tconst registrations = this.parseUserFixtures(runner, userFixtures, isTopLevel);\n\t\treturn new TestFixtures(registrations);\n\t}\n\tget(suite) {\n\t\tlet currentSuite = suite;\n\t\twhile (currentSuite) {\n\t\t\tconst overrides = this._overrides.get(currentSuite);\n\t\t\t// return the closest override\n\t\t\tif (overrides) return overrides;\n\t\t\tif (currentSuite === currentSuite.file) break;\n\t\t\tcurrentSuite = currentSuite.suite || currentSuite.file;\n\t\t}\n\t\treturn this._registrations;\n\t}\n\toverride(runner, userFixtures) {\n\t\tconst { suite: currentSuite, file } = getCurrentSuite();\n\t\tconst suite = currentSuite || file;\n\t\tconst isTopLevel = !currentSuite || currentSuite.file === currentSuite;\n\t\t// Create a copy of the closest parent's registrations to avoid modifying them\n\t\t// For chained calls, this.get(suite) returns this suite's overrides; for first call, returns parent's\n\t\tconst suiteRegistrations = new Map(this.get(suite));\n\t\tconst registrations = this.parseUserFixtures(runner, userFixtures, isTopLevel, suiteRegistrations);\n\t\t// If defined in top-level, just override all registrations\n\t\t// We don't support overriding suite-level fixtures anyway (it will throw an error)\n\t\tif (isTopLevel) this._registrations = registrations;\n\t\telse this._overrides.set(suite, registrations);\n\t}\n\tgetFileContext(file) {\n\t\tif (!this._suiteContexts.has(file)) this._suiteContexts.set(file, Object.create(null));\n\t\treturn this._suiteContexts.get(file);\n\t}\n\tgetWorkerContext() {\n\t\tif (!this._suiteContexts.has(TestFixtures._workerContextSuite)) this._suiteContexts.set(TestFixtures._workerContextSuite, Object.create(null));\n\t\treturn this._suiteContexts.get(TestFixtures._workerContextSuite);\n\t}\n\tparseUserFixtures(runner, userFixtures, supportNonTest, registrations = new Map(this._registrations)) {\n\t\tconst errors = [];\n\t\tObject.entries(userFixtures).forEach(([name, fn]) => {\n\t\t\tlet options;\n\t\t\tlet value;\n\t\t\tlet _options;\n\t\t\tif (Array.isArray(fn) && fn.length >= 2 && TestFixtures.isFixtureOptions(fn[1])) {\n\t\t\t\t_options = fn[1];\n\t\t\t\toptions = {\n\t\t\t\t\tauto: _options.auto ?? false,\n\t\t\t\t\tscope: _options.scope ?? \"test\",\n\t\t\t\t\tinjected: _options.injected ?? false\n\t\t\t\t};\n\t\t\t\tvalue = options.injected ? runner.injectValue?.(name) ?? fn[0] : fn[0];\n\t\t\t} else value = fn;\n\t\t\tconst parent = registrations.get(name);\n\t\t\tif (parent && options) {\n\t\t\t\tif (parent.scope !== options.scope) errors.push(new FixtureDependencyError(`The \"${name}\" fixture was already registered with a \"${options.scope}\" scope.`));\n\t\t\t\tif (parent.auto !== options.auto) errors.push(new FixtureDependencyError(`The \"${name}\" fixture was already registered as { auto: ${options.auto} }.`));\n\t\t\t} else if (parent) options = {\n\t\t\t\tauto: parent.auto,\n\t\t\t\tscope: parent.scope,\n\t\t\t\tinjected: parent.injected\n\t\t\t};\n\t\t\telse if (!options) options = {\n\t\t\t\tauto: false,\n\t\t\t\tinjected: false,\n\t\t\t\tscope: \"test\"\n\t\t\t};\n\t\t\tif (options.scope && !TestFixtures._fixtureScopes.includes(options.scope)) errors.push(new FixtureDependencyError(`The \"${name}\" fixture has unknown scope \"${options.scope}\".`));\n\t\t\tif (!supportNonTest && options.scope !== \"test\") errors.push(new FixtureDependencyError(`The \"${name}\" fixture cannot be defined with a ${options.scope} scope${!_options?.scope && parent?.scope ? \" (inherited from the base fixture)\" : \"\"} inside the describe block. Define it at the top level of the file instead.`));\n\t\t\tconst deps = isFixtureFunction(value) ? getUsedProps(value) : /* @__PURE__ */ new Set();\n\t\t\tconst item = {\n\t\t\t\tname,\n\t\t\t\tvalue,\n\t\t\t\tauto: options.auto ?? false,\n\t\t\t\tinjected: options.injected ?? false,\n\t\t\t\tscope: options.scope ?? \"test\",\n\t\t\t\tdeps,\n\t\t\t\tparent\n\t\t\t};\n\t\t\tif (isFixtureFunction(value)) Object.assign(value, { [FIXTURE_STACK_TRACE_KEY]: /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\") });\n\t\t\tregistrations.set(name, item);\n\t\t\tif (item.scope === \"worker\" && (runner.pool === \"vmThreads\" || runner.pool === \"vmForks\")) item.scope = \"file\";\n\t\t});\n\t\t// validate fixture dependency scopes\n\t\tfor (const fixture of registrations.values()) for (const depName of fixture.deps) {\n\t\t\tif (TestFixtures._builtinFixtures.includes(depName)) continue;\n\t\t\tconst dep = registrations.get(depName);\n\t\t\tif (!dep) {\n\t\t\t\terrors.push(new FixtureDependencyError(`The \"${fixture.name}\" fixture depends on unknown fixture \"${depName}\".`));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (depName === fixture.name && !fixture.parent) {\n\t\t\t\terrors.push(new FixtureDependencyError(`The \"${fixture.name}\" fixture depends on itself, but does not have a base implementation.`));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (TestFixtures._fixtureScopes.indexOf(fixture.scope) > TestFixtures._fixtureScopes.indexOf(dep.scope)) {\n\t\t\t\terrors.push(new FixtureDependencyError(`The ${fixture.scope} \"${fixture.name}\" fixture cannot depend on a ${dep.scope} fixture \"${dep.name}\".`));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\t\tif (errors.length === 1) throw errors[0];\n\t\telse if (errors.length > 1) throw new AggregateError(errors, \"Cannot resolve user fixtures. See errors for more information.\");\n\t\treturn registrations;\n\t}\n}\nconst cleanupFnArrayMap = /* @__PURE__ */ new WeakMap();\nasync function callFixtureCleanup(context) {\n\tconst cleanupFnArray = cleanupFnArrayMap.get(context) ?? [];\n\tfor (const cleanup of cleanupFnArray.reverse()) await cleanup();\n\tcleanupFnArrayMap.delete(context);\n}\n/**\n* Returns the current number of cleanup functions registered for the context.\n* This can be used as a checkpoint to later clean up only fixtures added after this point.\n*/\nfunction getFixtureCleanupCount(context) {\n\treturn cleanupFnArrayMap.get(context)?.length ?? 0;\n}\n/**\n* Cleans up only fixtures that were added after the given checkpoint index.\n* This is used by aroundEach to clean up fixtures created inside runTest()\n* while preserving fixtures that were created for aroundEach itself.\n*/\nasync function callFixtureCleanupFrom(context, fromIndex) {\n\tconst cleanupFnArray = cleanupFnArrayMap.get(context);\n\tif (!cleanupFnArray || cleanupFnArray.length <= fromIndex) return;\n\t// Get items added after the checkpoint\n\tconst toCleanup = cleanupFnArray.slice(fromIndex);\n\t// Clean up in reverse order\n\tfor (const cleanup of toCleanup.reverse()) await cleanup();\n\t// Remove cleaned up items from the array, keeping items before checkpoint\n\tcleanupFnArray.length = fromIndex;\n}\nconst contextHasFixturesCache = /* @__PURE__ */ new WeakMap();\nfunction withFixtures(fn, options) {\n\tconst collector = getCurrentSuite();\n\tconst suite = options?.suite || collector.suite || collector.file;\n\treturn async (hookContext) => {\n\t\tconst context = hookContext || options?.context;\n\t\tif (!context) {\n\t\t\tif (options?.suiteHook) validateSuiteHook(fn, options.suiteHook, options.stackTraceError);\n\t\t\treturn fn({});\n\t\t}\n\t\tconst fixtures = options?.fixtures || getTestFixtures(context);\n\t\tif (!fixtures) return fn(context);\n\t\tconst registrations = fixtures.get(suite);\n\t\tif (!registrations.size) return fn(context);\n\t\tconst usedFixtures = [];\n\t\tconst usedProps = getUsedProps(fn);\n\t\tfor (const fixture of registrations.values()) if (isAutoFixture(fixture, options) || usedProps.has(fixture.name)) usedFixtures.push(fixture);\n\t\tif (!usedFixtures.length) return fn(context);\n\t\tif (!cleanupFnArrayMap.has(context)) cleanupFnArrayMap.set(context, []);\n\t\tconst cleanupFnArray = cleanupFnArrayMap.get(context);\n\t\tconst pendingFixtures = resolveDeps(usedFixtures, registrations);\n\t\tif (!pendingFixtures.length) return fn(context);\n\t\t// Check if suite-level hook is trying to access test-scoped fixtures\n\t\t// Suite hooks (beforeAll/afterAll/aroundAll) can only access file/worker scoped fixtures\n\t\tif (options?.suiteHook) {\n\t\t\tconst testScopedFixtures = pendingFixtures.filter((f) => f.scope === \"test\");\n\t\t\tif (testScopedFixtures.length > 0) {\n\t\t\t\tconst fixtureNames = testScopedFixtures.map((f) => `\"${f.name}\"`).join(\", \");\n\t\t\t\tconst error = new FixtureDependencyError(`Test-scoped fixtures cannot be used inside ${options.suiteHook} hook. The following fixtures are test-scoped: ${fixtureNames}. Use { scope: 'file' } or { scope: 'worker' } fixtures instead, or move the logic to ${{\n\t\t\t\t\taroundAll: \"aroundEach\",\n\t\t\t\t\tbeforeAll: \"beforeEach\",\n\t\t\t\t\tafterAll: \"afterEach\"\n\t\t\t\t}[options.suiteHook]} hook.`);\n\t\t\t\t// Use stack trace from hook registration for better error location\n\t\t\t\tif (options.stackTraceError?.stack) error.stack = error.message + options.stackTraceError.stack.replace(options.stackTraceError.message, \"\");\n\t\t\t\tthrow error;\n\t\t\t}\n\t\t}\n\t\tif (!contextHasFixturesCache.has(context)) contextHasFixturesCache.set(context, /* @__PURE__ */ new WeakSet());\n\t\tconst cachedFixtures = contextHasFixturesCache.get(context);\n\t\tfor (const fixture of pendingFixtures) if (fixture.scope === \"test\") {\n\t\t\t// fixture could be already initialized during \"before\" hook\n\t\t\t// we can't check \"fixture.name\" in context because context may\n\t\t\t// access the parent fixture ({ a: ({ a }) => {} })\n\t\t\tif (cachedFixtures.has(fixture)) continue;\n\t\t\tcachedFixtures.add(fixture);\n\t\t\tconst resolvedValue = await resolveTestFixtureValue(fixture, context, cleanupFnArray);\n\t\t\tcontext[fixture.name] = resolvedValue;\n\t\t\tcleanupFnArray.push(() => {\n\t\t\t\tcachedFixtures.delete(fixture);\n\t\t\t});\n\t\t} else {\n\t\t\tconst resolvedValue = await resolveScopeFixtureValue(fixtures, suite, fixture);\n\t\t\tcontext[fixture.name] = resolvedValue;\n\t\t}\n\t\treturn fn(context);\n\t};\n}\nfunction isAutoFixture(fixture, options) {\n\tif (!fixture.auto) return false;\n\t// suite hook doesn't automatically trigger unused test-scoped fixtures.\n\tif (options?.suiteHook && fixture.scope === \"test\") return false;\n\treturn true;\n}\nfunction isFixtureFunction(value) {\n\treturn typeof value === \"function\";\n}\nfunction resolveTestFixtureValue(fixture, context, cleanupFnArray) {\n\tif (!isFixtureFunction(fixture.value)) return fixture.value;\n\treturn resolveFixtureFunction(fixture.value, fixture.name, context, cleanupFnArray);\n}\nconst scopedFixturePromiseCache = /* @__PURE__ */ new WeakMap();\nasync function resolveScopeFixtureValue(fixtures, suite, fixture) {\n\tconst workerContext = fixtures.getWorkerContext();\n\tconst fileContext = fixtures.getFileContext(suite.file);\n\tconst fixtureContext = fixture.scope === \"worker\" ? workerContext : fileContext;\n\tif (!isFixtureFunction(fixture.value)) {\n\t\tfixtureContext[fixture.name] = fixture.value;\n\t\treturn fixture.value;\n\t}\n\tif (fixture.name in fixtureContext) return fixtureContext[fixture.name];\n\tif (scopedFixturePromiseCache.has(fixture)) return scopedFixturePromiseCache.get(fixture);\n\tif (!cleanupFnArrayMap.has(fixtureContext)) cleanupFnArrayMap.set(fixtureContext, []);\n\tconst cleanupFnFileArray = cleanupFnArrayMap.get(fixtureContext);\n\tconst promise = resolveFixtureFunction(fixture.value, fixture.name, fixture.scope === \"file\" ? {\n\t\t...workerContext,\n\t\t...fileContext\n\t} : fixtureContext, cleanupFnFileArray).then((value) => {\n\t\tfixtureContext[fixture.name] = value;\n\t\tscopedFixturePromiseCache.delete(fixture);\n\t\treturn value;\n\t});\n\tscopedFixturePromiseCache.set(fixture, promise);\n\treturn promise;\n}\nasync function resolveFixtureFunction(fixtureFn, fixtureName, context, cleanupFnArray) {\n\t// wait for `use` call to extract fixture value\n\tconst useFnArgPromise = createDefer();\n\tconst stackTraceError = FIXTURE_STACK_TRACE_KEY in fixtureFn && fixtureFn[FIXTURE_STACK_TRACE_KEY] instanceof Error ? fixtureFn[FIXTURE_STACK_TRACE_KEY] : void 0;\n\tlet isUseFnArgResolved = false;\n\tconst fixtureReturn = fixtureFn(context, async (useFnArg) => {\n\t\t// extract `use` argument\n\t\tisUseFnArgResolved = true;\n\t\tuseFnArgPromise.resolve(useFnArg);\n\t\t// suspend fixture teardown by holding off `useReturnPromise` resolution until cleanup\n\t\tconst useReturnPromise = createDefer();\n\t\tcleanupFnArray.push(async () => {\n\t\t\t// start teardown by resolving `use` Promise\n\t\t\tuseReturnPromise.resolve();\n\t\t\t// wait for finishing teardown\n\t\t\tawait fixtureReturn;\n\t\t});\n\t\tawait useReturnPromise;\n\t}).then(() => {\n\t\t// fixture returned without calling use()\n\t\tif (!isUseFnArgResolved) {\n\t\t\tconst error = /* @__PURE__ */ new Error(`Fixture \"${fixtureName}\" returned without calling \"use\". Make sure to call \"use\" in every code path of the fixture function.`);\n\t\t\tif (stackTraceError?.stack) error.stack = error.message + stackTraceError.stack.replace(stackTraceError.message, \"\");\n\t\t\tuseFnArgPromise.reject(error);\n\t\t}\n\t}).catch((e) => {\n\t\t// treat fixture setup error as test failure\n\t\tif (!isUseFnArgResolved) {\n\t\t\tuseFnArgPromise.reject(e);\n\t\t\treturn;\n\t\t}\n\t\t// otherwise re-throw to avoid silencing error during cleanup\n\t\tthrow e;\n\t});\n\treturn useFnArgPromise;\n}\nfunction resolveDeps(usedFixtures, registrations, depSet = /* @__PURE__ */ new Set(), pendingFixtures = []) {\n\tusedFixtures.forEach((fixture) => {\n\t\tif (pendingFixtures.includes(fixture)) return;\n\t\tif (!isFixtureFunction(fixture.value) || !fixture.deps) {\n\t\t\tpendingFixtures.push(fixture);\n\t\t\treturn;\n\t\t}\n\t\tif (depSet.has(fixture)) if (fixture.parent) fixture = fixture.parent;\n\t\telse throw new Error(`Circular fixture dependency detected: ${fixture.name} <- ${[...depSet].reverse().map((d) => d.name).join(\" <- \")}`);\n\t\tdepSet.add(fixture);\n\t\tresolveDeps(Array.from(fixture.deps, (n) => n === fixture.name ? fixture.parent : registrations.get(n)).filter((n) => !!n), registrations, depSet, pendingFixtures);\n\t\tpendingFixtures.push(fixture);\n\t\tdepSet.clear();\n\t});\n\treturn pendingFixtures;\n}\nfunction validateSuiteHook(fn, hook, suiteError) {\n\tconst usedProps = getUsedProps(fn, {\n\t\tsourceError: suiteError,\n\t\tsuiteHook: hook\n\t});\n\tif (usedProps.size) {\n\t\tconst error = new FixtureAccessError(`The ${hook} hook uses fixtures \"${[...usedProps].join(\"\\\", \\\"\")}\", but has no access to context. Did you forget to call it as \"test.${hook}()\" instead of \"${hook}()\"?\\nIf you used internal \"suite\" task as the first argument previously, access it in the second argument instead. See https://vitest.dev/guide/test-context#suite-level-hooks`);\n\t\tif (suiteError) error.stack = suiteError.stack?.replace(suiteError.message, error.message);\n\t\tthrow error;\n\t}\n}\nconst kPropsSymbol = Symbol(\"$vitest:fixture-props\");\nconst kPropNamesSymbol = Symbol(\"$vitest:fixture-prop-names\");\nfunction configureProps(fn, options) {\n\tObject.defineProperty(fn, kPropsSymbol, {\n\t\tvalue: options,\n\t\tenumerable: false\n\t});\n}\nfunction memoProps(fn, props) {\n\tfn[kPropNamesSymbol] = props;\n\treturn props;\n}\nfunction getUsedProps(fn, { sourceError, suiteHook } = {}) {\n\tif (kPropNamesSymbol in fn) return fn[kPropNamesSymbol];\n\tconst { index: fixturesIndex = 0, original: implementation = fn } = kPropsSymbol in fn ? fn[kPropsSymbol] : {};\n\tlet fnString = filterOutComments(implementation.toString());\n\t// match lowered async function and strip it off\n\t// example code on esbuild-try https://esbuild.github.io/try/#YgAwLjI0LjAALS1zdXBwb3J0ZWQ6YXN5bmMtYXdhaXQ9ZmFsc2UAZQBlbnRyeS50cwBjb25zdCBvID0gewogIGYxOiBhc3luYyAoKSA9PiB7fSwKICBmMjogYXN5bmMgKGEpID0+IHt9LAogIGYzOiBhc3luYyAoYSwgYikgPT4ge30sCiAgZjQ6IGFzeW5jIGZ1bmN0aW9uKGEpIHt9LAogIGY1OiBhc3luYyBmdW5jdGlvbiBmZihhKSB7fSwKICBhc3luYyBmNihhKSB7fSwKCiAgZzE6IGFzeW5jICgpID0+IHt9LAogIGcyOiBhc3luYyAoeyBhIH0pID0+IHt9LAogIGczOiBhc3luYyAoeyBhIH0sIGIpID0+IHt9LAogIGc0OiBhc3luYyBmdW5jdGlvbiAoeyBhIH0pIHt9LAogIGc1OiBhc3luYyBmdW5jdGlvbiBnZyh7IGEgfSkge30sCiAgYXN5bmMgZzYoeyBhIH0pIHt9LAoKICBoMTogYXN5bmMgKCkgPT4ge30sCiAgLy8gY29tbWVudCBiZXR3ZWVuCiAgaDI6IGFzeW5jIChhKSA9PiB7fSwKfQ\n\t//   __async(this, null, function*\n\t//   __async(this, arguments, function*\n\t//   __async(this, [_0, _1], function*\n\tif (/__async\\((?:this|null), (?:null|arguments|\\[[_0-9, ]*\\]), function\\*/.test(fnString)) fnString = fnString.split(/__async\\((?:this|null),/)[1];\n\tconst match = fnString.match(/[^(]*\\(([^)]*)/);\n\tif (!match) return memoProps(fn, /* @__PURE__ */ new Set());\n\tconst args = splitByComma(match[1]);\n\tif (!args.length) return memoProps(fn, /* @__PURE__ */ new Set());\n\tconst fixturesArgument = args[fixturesIndex];\n\tif (!fixturesArgument) return memoProps(fn, /* @__PURE__ */ new Set());\n\tif (!(fixturesArgument[0] === \"{\" && fixturesArgument.endsWith(\"}\"))) {\n\t\tconst ordinalArgument = ordinal(fixturesIndex + 1);\n\t\tconst error = new FixtureParseError(`The ${ordinalArgument} argument inside a fixture must use object destructuring pattern, e.g. ({ task } => {}). Instead, received \"${fixturesArgument}\".${suiteHook ? ` If you used internal \"suite\" task as the ${ordinalArgument} argument previously, access it in the ${ordinal(fixturesIndex + 2)} argument instead.` : \"\"}`);\n\t\tif (sourceError) error.stack = sourceError.stack?.replace(sourceError.message, error.message);\n\t\tthrow error;\n\t}\n\tconst props = splitByComma(fixturesArgument.slice(1, -1).replace(/\\s/g, \"\")).map((prop) => {\n\t\treturn prop.replace(/:.*|=.*/g, \"\");\n\t});\n\tconst last = props.at(-1);\n\tif (last && last.startsWith(\"...\")) {\n\t\tconst error = new FixtureParseError(`Rest parameters are not supported in fixtures, received \"${last}\".`);\n\t\tif (sourceError) error.stack = sourceError.stack?.replace(sourceError.message, error.message);\n\t\tthrow error;\n\t}\n\treturn memoProps(fn, new Set(props));\n}\nfunction splitByComma(s) {\n\tconst result = [];\n\tconst stack = [];\n\tlet start = 0;\n\tfor (let i = 0; i < s.length; i++) if (s[i] === \"{\" || s[i] === \"[\") stack.push(s[i] === \"{\" ? \"}\" : \"]\");\n\telse if (s[i] === stack.at(-1)) stack.pop();\n\telse if (!stack.length && s[i] === \",\") {\n\t\tconst token = s.substring(start, i).trim();\n\t\tif (token) result.push(token);\n\t\tstart = i + 1;\n\t}\n\tconst lastToken = s.substring(start).trim();\n\tif (lastToken) result.push(lastToken);\n\treturn result;\n}\n\nlet _test;\nfunction setCurrentTest(test) {\n\t_test = test;\n}\nfunction getCurrentTest() {\n\treturn _test;\n}\nconst tests = [];\nfunction addRunningTest(test) {\n\ttests.push(test);\n\treturn () => {\n\t\ttests.splice(tests.indexOf(test));\n\t};\n}\nfunction getRunningTests() {\n\treturn tests;\n}\n\nconst kChainableContext = Symbol(\"kChainableContext\");\nfunction getChainableContext(chainable) {\n\treturn chainable?.[kChainableContext];\n}\nfunction createChainable(keys, fn, context) {\n\tfunction create(context) {\n\t\tconst chain = function(...args) {\n\t\t\treturn fn.apply(context, args);\n\t\t};\n\t\tObject.assign(chain, fn);\n\t\tObject.defineProperty(chain, kChainableContext, {\n\t\t\tvalue: {\n\t\t\t\twithContext: () => chain.bind(context),\n\t\t\t\tgetFixtures: () => context.fixtures,\n\t\t\t\tsetContext: (key, value) => {\n\t\t\t\t\tcontext[key] = value;\n\t\t\t\t},\n\t\t\t\tmergeContext: (ctx) => {\n\t\t\t\t\tObject.assign(context, ctx);\n\t\t\t\t}\n\t\t\t},\n\t\t\tenumerable: false\n\t\t});\n\t\tfor (const key of keys) Object.defineProperty(chain, key, { get() {\n\t\t\treturn create({\n\t\t\t\t...context,\n\t\t\t\t[key]: true\n\t\t\t});\n\t\t} });\n\t\treturn chain;\n\t}\n\tconst chain = create(context ?? {});\n\tObject.defineProperty(chain, \"fn\", {\n\t\tvalue: fn,\n\t\tenumerable: false\n\t});\n\treturn chain;\n}\n\nfunction getDefaultHookTimeout() {\n\treturn getRunner().config.hookTimeout;\n}\nconst CLEANUP_TIMEOUT_KEY = Symbol.for(\"VITEST_CLEANUP_TIMEOUT\");\nconst CLEANUP_STACK_TRACE_KEY = Symbol.for(\"VITEST_CLEANUP_STACK_TRACE\");\nconst AROUND_TIMEOUT_KEY = Symbol.for(\"VITEST_AROUND_TIMEOUT\");\nconst AROUND_STACK_TRACE_KEY = Symbol.for(\"VITEST_AROUND_STACK_TRACE\");\nfunction getBeforeHookCleanupCallback(hook, result, context) {\n\tif (typeof result === \"function\") {\n\t\tconst timeout = CLEANUP_TIMEOUT_KEY in hook && typeof hook[CLEANUP_TIMEOUT_KEY] === \"number\" ? hook[CLEANUP_TIMEOUT_KEY] : getDefaultHookTimeout();\n\t\tconst stackTraceError = CLEANUP_STACK_TRACE_KEY in hook && hook[CLEANUP_STACK_TRACE_KEY] instanceof Error ? hook[CLEANUP_STACK_TRACE_KEY] : void 0;\n\t\treturn withTimeout(result, timeout, true, stackTraceError, (_, error) => {\n\t\t\tif (context) abortContextSignal(context, error);\n\t\t});\n\t}\n}\n/**\n* Registers a callback function to be executed once before all tests within the current suite.\n* This hook is useful for scenarios where you need to perform setup operations that are common to all tests in a suite, such as initializing a database connection or setting up a test environment.\n*\n* **Note:** The `beforeAll` hooks are executed in the order they are defined one after another. You can configure this by changing the `sequence.hooks` option in the config file.\n*\n* @param {Function} fn - The callback function to be executed before all tests.\n* @param {number} [timeout] - Optional timeout in milliseconds for the hook. If not provided, the default hook timeout from the runner's configuration is used.\n* @returns {void}\n* @example\n* ```ts\n* // Example of using beforeAll to set up a database connection\n* beforeAll(async () => {\n*   await database.connect();\n* });\n* ```\n*/\nfunction beforeAll(fn, timeout = getDefaultHookTimeout()) {\n\tassertTypes(fn, \"\\\"beforeAll\\\" callback\", [\"function\"]);\n\tconst stackTraceError = /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\");\n\tconst context = getChainableContext(this);\n\treturn getCurrentSuite().on(\"beforeAll\", Object.assign(withTimeout(withSuiteFixtures(\"beforeAll\", fn, context, stackTraceError), timeout, true, stackTraceError), {\n\t\t[CLEANUP_TIMEOUT_KEY]: timeout,\n\t\t[CLEANUP_STACK_TRACE_KEY]: stackTraceError\n\t}));\n}\n/**\n* Registers a callback function to be executed once after all tests within the current suite have completed.\n* This hook is useful for scenarios where you need to perform cleanup operations after all tests in a suite have run, such as closing database connections or cleaning up temporary files.\n*\n* **Note:** The `afterAll` hooks are running in reverse order of their registration. You can configure this by changing the `sequence.hooks` option in the config file.\n*\n* @param {Function} fn - The callback function to be executed after all tests.\n* @param {number} [timeout] - Optional timeout in milliseconds for the hook. If not provided, the default hook timeout from the runner's configuration is used.\n* @returns {void}\n* @example\n* ```ts\n* // Example of using afterAll to close a database connection\n* afterAll(async () => {\n*   await database.disconnect();\n* });\n* ```\n*/\nfunction afterAll(fn, timeout) {\n\tassertTypes(fn, \"\\\"afterAll\\\" callback\", [\"function\"]);\n\tconst context = getChainableContext(this);\n\tconst stackTraceError = /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\");\n\treturn getCurrentSuite().on(\"afterAll\", withTimeout(withSuiteFixtures(\"afterAll\", fn, context, stackTraceError), timeout ?? getDefaultHookTimeout(), true, stackTraceError));\n}\n/**\n* Registers a callback function to be executed before each test within the current suite.\n* This hook is useful for scenarios where you need to reset or reinitialize the test environment before each test runs, such as resetting database states, clearing caches, or reinitializing variables.\n*\n* **Note:** The `beforeEach` hooks are executed in the order they are defined one after another. You can configure this by changing the `sequence.hooks` option in the config file.\n*\n* @param {Function} fn - The callback function to be executed before each test. This function receives an `TestContext` parameter if additional test context is needed.\n* @param {number} [timeout] - Optional timeout in milliseconds for the hook. If not provided, the default hook timeout from the runner's configuration is used.\n* @returns {void}\n* @example\n* ```ts\n* // Example of using beforeEach to reset a database state\n* beforeEach(async () => {\n*   await database.reset();\n* });\n* ```\n*/\nfunction beforeEach(fn, timeout = getDefaultHookTimeout()) {\n\tassertTypes(fn, \"\\\"beforeEach\\\" callback\", [\"function\"]);\n\tconst stackTraceError = /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\");\n\tconst wrapper = (context, suite) => {\n\t\treturn withFixtures(fn, { suite })(context);\n\t};\n\treturn getCurrentSuite().on(\"beforeEach\", Object.assign(withTimeout(wrapper, timeout ?? getDefaultHookTimeout(), true, stackTraceError, abortIfTimeout), {\n\t\t[CLEANUP_TIMEOUT_KEY]: timeout,\n\t\t[CLEANUP_STACK_TRACE_KEY]: stackTraceError\n\t}));\n}\n/**\n* Registers a callback function to be executed after each test within the current suite has completed.\n* This hook is useful for scenarios where you need to clean up or reset the test environment after each test runs, such as deleting temporary files, clearing test-specific database entries, or resetting mocked functions.\n*\n* **Note:** The `afterEach` hooks are running in reverse order of their registration. You can configure this by changing the `sequence.hooks` option in the config file.\n*\n* @param {Function} fn - The callback function to be executed after each test. This function receives an `TestContext` parameter if additional test context is needed.\n* @param {number} [timeout] - Optional timeout in milliseconds for the hook. If not provided, the default hook timeout from the runner's configuration is used.\n* @returns {void}\n* @example\n* ```ts\n* // Example of using afterEach to delete temporary files created during a test\n* afterEach(async () => {\n*   await fileSystem.deleteTempFiles();\n* });\n* ```\n*/\nfunction afterEach(fn, timeout) {\n\tassertTypes(fn, \"\\\"afterEach\\\" callback\", [\"function\"]);\n\tconst wrapper = (context, suite) => {\n\t\treturn withFixtures(fn, { suite })(context);\n\t};\n\treturn getCurrentSuite().on(\"afterEach\", withTimeout(wrapper, timeout ?? getDefaultHookTimeout(), true, /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\"), abortIfTimeout));\n}\n/**\n* Registers a callback function to be executed when a test fails within the current suite.\n* This function allows for custom actions to be performed in response to test failures, such as logging, cleanup, or additional diagnostics.\n*\n* **Note:** The `onTestFailed` hooks are running in reverse order of their registration. You can configure this by changing the `sequence.hooks` option in the config file.\n*\n* @param {Function} fn - The callback function to be executed upon a test failure. The function receives the test result (including errors).\n* @param {number} [timeout] - Optional timeout in milliseconds for the hook. If not provided, the default hook timeout from the runner's configuration is used.\n* @throws {Error} Throws an error if the function is not called within a test.\n* @returns {void}\n* @example\n* ```ts\n* // Example of using onTestFailed to log failure details\n* onTestFailed(({ errors }) => {\n*   console.log(`Test failed: ${test.name}`, errors);\n* });\n* ```\n*/\nconst onTestFailed = createTestHook(\"onTestFailed\", (test, handler, timeout) => {\n\ttest.onFailed ||= [];\n\ttest.onFailed.push(withTimeout(handler, timeout ?? getDefaultHookTimeout(), true, /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\"), abortIfTimeout));\n});\n/**\n* Registers a callback function to be executed when the current test finishes, regardless of the outcome (pass or fail).\n* This function is ideal for performing actions that should occur after every test execution, such as cleanup, logging, or resetting shared resources.\n*\n* This hook is useful if you have access to a resource in the test itself and you want to clean it up after the test finishes. It is a more compact way to clean up resources than using the combination of `beforeEach` and `afterEach`.\n*\n* **Note:** The `onTestFinished` hooks are running in reverse order of their registration. You can configure this by changing the `sequence.hooks` option in the config file.\n*\n* **Note:** The `onTestFinished` hook is not called if the test is canceled with a dynamic `ctx.skip()` call.\n*\n* @param {Function} fn - The callback function to be executed after a test finishes. The function can receive parameters providing details about the completed test, including its success or failure status.\n* @param {number} [timeout] - Optional timeout in milliseconds for the hook. If not provided, the default hook timeout from the runner's configuration is used.\n* @throws {Error} Throws an error if the function is not called within a test.\n* @returns {void}\n* @example\n* ```ts\n* // Example of using onTestFinished for cleanup\n* const db = await connectToDatabase();\n* onTestFinished(async () => {\n*   await db.disconnect();\n* });\n* ```\n*/\nconst onTestFinished = createTestHook(\"onTestFinished\", (test, handler, timeout) => {\n\ttest.onFinished ||= [];\n\ttest.onFinished.push(withTimeout(handler, timeout ?? getDefaultHookTimeout(), true, /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\"), abortIfTimeout));\n});\n/**\n* Registers a callback function that wraps around all tests within the current suite.\n* The callback receives a `runSuite` function that must be called to run the suite's tests.\n* This hook is useful for scenarios where you need to wrap an entire suite in a context\n* (e.g., starting a server, opening a database connection that all tests share).\n*\n* **Note:** When multiple `aroundAll` hooks are registered, they are nested inside each other.\n* The first registered hook is the outermost wrapper.\n*\n* @param {Function} fn - The callback function that wraps the suite. Must call `runSuite()` to run the tests.\n* @param {number} [timeout] - Optional timeout in milliseconds for the hook. If not provided, the default hook timeout from the runner's configuration is used.\n* @returns {void}\n* @example\n* ```ts\n* // Example of using aroundAll to wrap suite in a tracing span\n* aroundAll(async (runSuite) => {\n*   await tracer.trace('test-suite', runSuite);\n* });\n* ```\n* @example\n* ```ts\n* // Example of using aroundAll with fixtures\n* aroundAll(async (runSuite, { db }) => {\n*   await db.transaction(() => runSuite());\n* });\n* ```\n*/\nfunction aroundAll(fn, timeout) {\n\tassertTypes(fn, \"\\\"aroundAll\\\" callback\", [\"function\"]);\n\tconst stackTraceError = /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\");\n\tconst resolvedTimeout = timeout ?? getDefaultHookTimeout();\n\tconst context = getChainableContext(this);\n\treturn getCurrentSuite().on(\"aroundAll\", Object.assign(withSuiteFixtures(\"aroundAll\", fn, context, stackTraceError, 1), {\n\t\t[AROUND_TIMEOUT_KEY]: resolvedTimeout,\n\t\t[AROUND_STACK_TRACE_KEY]: stackTraceError\n\t}));\n}\n/**\n* Registers a callback function that wraps around each test within the current suite.\n* The callback receives a `runTest` function that must be called to run the test.\n* This hook is useful for scenarios where you need to wrap tests in a context (e.g., database transactions).\n*\n* **Note:** When multiple `aroundEach` hooks are registered, they are nested inside each other.\n* The first registered hook is the outermost wrapper.\n*\n* @param {Function} fn - The callback function that wraps the test. Must call `runTest()` to run the test.\n* @param {number} [timeout] - Optional timeout in milliseconds for the hook. If not provided, the default hook timeout from the runner's configuration is used.\n* @returns {void}\n* @example\n* ```ts\n* // Example of using aroundEach to wrap tests in a database transaction\n* aroundEach(async (runTest) => {\n*   await database.transaction(() => runTest());\n* });\n* ```\n* @example\n* ```ts\n* // Example of using aroundEach with fixtures\n* aroundEach(async (runTest, { db }) => {\n*   await db.transaction(() => runTest());\n* });\n* ```\n*/\nfunction aroundEach(fn, timeout) {\n\tassertTypes(fn, \"\\\"aroundEach\\\" callback\", [\"function\"]);\n\tconst stackTraceError = /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\");\n\tconst resolvedTimeout = timeout ?? getDefaultHookTimeout();\n\tconst wrapper = (runTest, context, suite) => {\n\t\tconst innerFn = (ctx) => fn(runTest, ctx, suite);\n\t\tconfigureProps(innerFn, {\n\t\t\tindex: 1,\n\t\t\toriginal: fn\n\t\t});\n\t\treturn withFixtures(innerFn, { suite })(context);\n\t};\n\treturn getCurrentSuite().on(\"aroundEach\", Object.assign(wrapper, {\n\t\t[AROUND_TIMEOUT_KEY]: resolvedTimeout,\n\t\t[AROUND_STACK_TRACE_KEY]: stackTraceError\n\t}));\n}\nfunction withSuiteFixtures(suiteHook, fn, context, stackTraceError, contextIndex = 0) {\n\treturn (...args) => {\n\t\tconst suite = args.at(-1);\n\t\tconst prefix = args.slice(0, -1);\n\t\tconst wrapper = (ctx) => fn(...prefix, ctx, suite);\n\t\tconfigureProps(wrapper, {\n\t\t\tindex: contextIndex,\n\t\t\toriginal: fn\n\t\t});\n\t\tconst fixtures = context?.getFixtures();\n\t\tconst fileContext = fixtures?.getFileContext(suite.file);\n\t\treturn withFixtures(wrapper, {\n\t\t\tsuiteHook,\n\t\t\tfixtures,\n\t\t\tcontext: fileContext,\n\t\t\tstackTraceError\n\t\t})();\n\t};\n}\nfunction getAroundHookTimeout(hook) {\n\treturn AROUND_TIMEOUT_KEY in hook && typeof hook[AROUND_TIMEOUT_KEY] === \"number\" ? hook[AROUND_TIMEOUT_KEY] : getDefaultHookTimeout();\n}\nfunction getAroundHookStackTrace(hook) {\n\treturn AROUND_STACK_TRACE_KEY in hook && hook[AROUND_STACK_TRACE_KEY] instanceof Error ? hook[AROUND_STACK_TRACE_KEY] : void 0;\n}\nfunction createTestHook(name, handler) {\n\treturn (fn, timeout) => {\n\t\tassertTypes(fn, `\"${name}\" callback`, [\"function\"]);\n\t\tconst current = getCurrentTest();\n\t\tif (!current) throw new Error(`Hook ${name}() can only be called inside a test`);\n\t\treturn handler(current, fn, timeout);\n\t};\n}\n\nfunction findTestFileStackTrace(testFilePath, error) {\n\tlet stack;\n\ttry {\n\t\tstack = error.stack;\n\t} catch {\n\t\t// accessing `.stack` runs `Error.prepareStackTrace`, which can throw\n\t\t// if the test froze `Object.prototype` (see vitest-dev/vscode#798)\n\t\treturn;\n\t}\n\tif (!stack) return;\n\treturn parseStacktrace(stack, { ignoreStackEntries: [] }).find((stack) => stack.file === testFilePath);\n}\n\nconst filterMap = /* @__PURE__ */ new WeakMap();\n/**\n* @experimental\n*/\nfunction matchesTags(testTags) {\n\tconst runner = getRunner();\n\tconst tagsFilter = runner._currentSpecification?.testTagsFilter ?? runner.config.tagsFilter;\n\tif (!tagsFilter) return true;\n\tlet tagsFilterPredicate = filterMap.get(tagsFilter);\n\tif (!tagsFilterPredicate) {\n\t\ttagsFilterPredicate = createTagsFilter(tagsFilter, runner.config.tags);\n\t\tfilterMap.set(tagsFilter, tagsFilterPredicate);\n\t}\n\treturn tagsFilterPredicate(testTags);\n}\nfunction validateTags(config, tags) {\n\tif (!config.strictTags) return;\n\tconst availableTags = new Set(config.tags.map((tag) => tag.name));\n\tfor (const tag of tags) if (!availableTags.has(tag)) throw createNoTagsError(config.tags, tag);\n}\nfunction createNoTagsError(availableTags, tag, prefix = \"tag\") {\n\tif (!availableTags.length) throw new Error(`The Vitest config doesn't define any \"tags\", cannot apply \"${tag}\" ${prefix} for this test. See: https://vitest.dev/guide/test-tags`);\n\tthrow new Error(`The ${prefix} \"${tag}\" is not defined in the configuration. Available tags are:\\n${availableTags.map((t) => `- ${t.name}${t.description ? `: ${t.description}` : \"\"}`).join(\"\\n\")}`);\n}\nfunction createTagsFilter(tagsExpr, availableTags) {\n\tconst matchers = tagsExpr.map((expr) => parseTagsExpression(expr, availableTags));\n\treturn (testTags) => {\n\t\treturn matchers.every((matcher) => matcher(testTags));\n\t};\n}\nfunction parseTagsExpression(expr, availableTags) {\n\tconst tokens = tokenize(expr);\n\tconst stream = new TokenStream(tokens, expr);\n\tconst ast = parseOrExpression(stream, availableTags);\n\tif (stream.peek().type !== \"EOF\") throw new Error(`Invalid tags expression: unexpected \"${formatToken(stream.peek())}\" in \"${expr}\"`);\n\treturn (tags) => evaluateNode(ast, tags);\n}\nfunction formatToken(token) {\n\tswitch (token.type) {\n\t\tcase \"TAG\": return token.value;\n\t\tdefault: return formatTokenType(token.type);\n\t}\n}\nfunction tokenize(expr) {\n\tconst tokens = [];\n\tlet i = 0;\n\twhile (i < expr.length) {\n\t\tif (expr[i] === \" \" || expr[i] === \"\t\") {\n\t\t\ti++;\n\t\t\tcontinue;\n\t\t}\n\t\tif (expr[i] === \"(\") {\n\t\t\ttokens.push({ type: \"LPAREN\" });\n\t\t\ti++;\n\t\t\tcontinue;\n\t\t}\n\t\tif (expr[i] === \")\") {\n\t\t\ttokens.push({ type: \"RPAREN\" });\n\t\t\ti++;\n\t\t\tcontinue;\n\t\t}\n\t\tif (expr[i] === \"!\") {\n\t\t\ttokens.push({ type: \"NOT\" });\n\t\t\ti++;\n\t\t\tcontinue;\n\t\t}\n\t\tif (expr.slice(i, i + 2) === \"&&\") {\n\t\t\ttokens.push({ type: \"AND\" });\n\t\t\ti += 2;\n\t\t\tcontinue;\n\t\t}\n\t\tif (expr.slice(i, i + 2) === \"||\") {\n\t\t\ttokens.push({ type: \"OR\" });\n\t\t\ti += 2;\n\t\t\tcontinue;\n\t\t}\n\t\tif (/^and(?:\\s|\\)|$)/i.test(expr.slice(i))) {\n\t\t\ttokens.push({ type: \"AND\" });\n\t\t\ti += 3;\n\t\t\tcontinue;\n\t\t}\n\t\tif (/^or(?:\\s|\\)|$)/i.test(expr.slice(i))) {\n\t\t\ttokens.push({ type: \"OR\" });\n\t\t\ti += 2;\n\t\t\tcontinue;\n\t\t}\n\t\tif (/^not\\s/i.test(expr.slice(i))) {\n\t\t\ttokens.push({ type: \"NOT\" });\n\t\t\ti += 3;\n\t\t\tcontinue;\n\t\t}\n\t\tlet tag = \"\";\n\t\twhile (i < expr.length && expr[i] !== \" \" && expr[i] !== \"\t\" && expr[i] !== \"(\" && expr[i] !== \")\" && expr[i] !== \"!\" && expr[i] !== \"&\" && expr[i] !== \"|\") {\n\t\t\tconst remaining = expr.slice(i);\n\t\t\t// Only treat and/or/not as operators if we're at the start of a tag (after whitespace)\n\t\t\t// This allows tags like \"demand\", \"editor\", \"cannot\" to work correctly\n\t\t\tif (tag === \"\" && (/^and(?:\\s|\\)|$)/i.test(remaining) || /^or(?:\\s|\\)|$)/i.test(remaining) || /^not\\s/i.test(remaining))) break;\n\t\t\ttag += expr[i];\n\t\t\ti++;\n\t\t}\n\t\tif (tag) tokens.push({\n\t\t\ttype: \"TAG\",\n\t\t\tvalue: tag\n\t\t});\n\t}\n\ttokens.push({ type: \"EOF\" });\n\treturn tokens;\n}\nclass TokenStream {\n\ttokens;\n\texpr;\n\tpos = 0;\n\tconstructor(tokens, expr) {\n\t\tthis.tokens = tokens;\n\t\tthis.expr = expr;\n\t}\n\tpeek() {\n\t\treturn this.tokens[this.pos];\n\t}\n\tnext() {\n\t\treturn this.tokens[this.pos++];\n\t}\n\texpect(type) {\n\t\tconst token = this.next();\n\t\tif (token.type !== type) {\n\t\t\tif (type === \"RPAREN\" && token.type === \"EOF\") throw new Error(`Invalid tags expression: missing closing \")\" in \"${this.expr}\"`);\n\t\t\tthrow new Error(`Invalid tags expression: expected \"${formatTokenType(type)}\" but got \"${formatToken(token)}\" in \"${this.expr}\"`);\n\t\t}\n\t\treturn token;\n\t}\n\tunexpectedToken() {\n\t\tconst token = this.peek();\n\t\tif (token.type === \"EOF\") throw new Error(`Invalid tags expression: unexpected end of expression in \"${this.expr}\"`);\n\t\tthrow new Error(`Invalid tags expression: unexpected \"${formatToken(token)}\" in \"${this.expr}\"`);\n\t}\n}\nfunction formatTokenType(type) {\n\tswitch (type) {\n\t\tcase \"TAG\": return \"tag\";\n\t\tcase \"AND\": return \"and\";\n\t\tcase \"OR\": return \"or\";\n\t\tcase \"NOT\": return \"not\";\n\t\tcase \"LPAREN\": return \"(\";\n\t\tcase \"RPAREN\": return \")\";\n\t\tcase \"EOF\": return \"end of expression\";\n\t}\n}\nfunction parseOrExpression(stream, availableTags) {\n\tlet left = parseAndExpression(stream, availableTags);\n\twhile (stream.peek().type === \"OR\") {\n\t\tstream.next();\n\t\tconst right = parseAndExpression(stream, availableTags);\n\t\tleft = {\n\t\t\ttype: \"or\",\n\t\t\tleft,\n\t\t\tright\n\t\t};\n\t}\n\treturn left;\n}\nfunction parseAndExpression(stream, availableTags) {\n\tlet left = parseUnaryExpression(stream, availableTags);\n\twhile (stream.peek().type === \"AND\") {\n\t\tstream.next();\n\t\tconst right = parseUnaryExpression(stream, availableTags);\n\t\tleft = {\n\t\t\ttype: \"and\",\n\t\t\tleft,\n\t\t\tright\n\t\t};\n\t}\n\treturn left;\n}\nfunction parseUnaryExpression(stream, availableTags) {\n\tif (stream.peek().type === \"NOT\") {\n\t\tstream.next();\n\t\treturn {\n\t\t\ttype: \"not\",\n\t\t\toperand: parseUnaryExpression(stream, availableTags)\n\t\t};\n\t}\n\treturn parsePrimaryExpression(stream, availableTags);\n}\nfunction parsePrimaryExpression(stream, availableTags) {\n\tconst token = stream.peek();\n\tif (token.type === \"LPAREN\") {\n\t\tstream.next();\n\t\tconst expr = parseOrExpression(stream, availableTags);\n\t\tstream.expect(\"RPAREN\");\n\t\treturn expr;\n\t}\n\tif (token.type === \"TAG\") {\n\t\tstream.next();\n\t\tconst tagValue = token.value;\n\t\treturn {\n\t\t\ttype: \"tag\",\n\t\t\tvalue: tagValue,\n\t\t\tpattern: resolveTagPattern(tagValue, availableTags)\n\t\t};\n\t}\n\tstream.unexpectedToken();\n}\nfunction createWildcardRegex(pattern) {\n\treturn new RegExp(`^${pattern.replace(/[.+?^${}()|[\\]\\\\]/g, \"\\\\$&\").replace(/\\*/g, \".*\")}$`);\n}\nfunction resolveTagPattern(tagPattern, availableTags) {\n\tif (tagPattern.includes(\"*\")) {\n\t\tconst regex = createWildcardRegex(tagPattern);\n\t\tif (!availableTags.some((tag) => regex.test(tag.name))) throw createNoTagsError(availableTags, tagPattern, \"tag pattern\");\n\t\treturn regex;\n\t}\n\tif (!availableTags.length || !availableTags.some((tag) => tag.name === tagPattern)) throw createNoTagsError(availableTags, tagPattern, \"tag pattern\");\n\treturn null;\n}\nfunction evaluateNode(node, tags) {\n\tswitch (node.type) {\n\t\tcase \"tag\":\n\t\t\tif (node.pattern) return tags.some((tag) => node.pattern.test(tag));\n\t\t\treturn tags.includes(node.value);\n\t\tcase \"not\": return !evaluateNode(node.operand, tags);\n\t\tcase \"and\": return evaluateNode(node.left, tags) && evaluateNode(node.right, tags);\n\t\tcase \"or\": return evaluateNode(node.left, tags) || evaluateNode(node.right, tags);\n\t}\n}\n\n/**\n* Creates a suite of tests, allowing for grouping and hierarchical organization of tests.\n* Suites can contain both tests and other suites, enabling complex test structures.\n*\n* @param {string} name - The name of the suite, used for identification and reporting.\n* @param {Function} fn - A function that defines the tests and suites within this suite.\n* @example\n* ```ts\n* // Define a suite with two tests\n* suite('Math operations', () => {\n*   test('should add two numbers', () => {\n*     expect(add(1, 2)).toBe(3);\n*   });\n*\n*   test('should subtract two numbers', () => {\n*     expect(subtract(5, 2)).toBe(3);\n*   });\n* });\n* ```\n* @example\n* ```ts\n* // Define nested suites\n* suite('String operations', () => {\n*   suite('Trimming', () => {\n*     test('should trim whitespace from start and end', () => {\n*       expect('  hello  '.trim()).toBe('hello');\n*     });\n*   });\n*\n*   suite('Concatenation', () => {\n*     test('should concatenate two strings', () => {\n*       expect('hello' + ' ' + 'world').toBe('hello world');\n*     });\n*   });\n* });\n* ```\n*/\nconst suite = createSuite();\n/**\n* Defines a test case with a given name and test function. The test function can optionally be configured with test options.\n*\n* @param {string | Function} name - The name of the test or a function that will be used as a test name.\n* @param {TestOptions | TestFunction} [optionsOrFn] - Optional. The test options or the test function if no explicit name is provided.\n* @param {number | TestOptions | TestFunction} [optionsOrTest] - Optional. The test function or options, depending on the previous parameters.\n* @throws {Error} If called inside another test function.\n* @example\n* ```ts\n* // Define a simple test\n* test('should add two numbers', () => {\n*   expect(add(1, 2)).toBe(3);\n* });\n* ```\n* @example\n* ```ts\n* // Define a test with options\n* test('should subtract two numbers', { retry: 3 }, () => {\n*   expect(subtract(5, 2)).toBe(3);\n* });\n* ```\n*/\nconst test = createTest(function(name, optionsOrFn, optionsOrTest) {\n\tif (getCurrentTest()) throw new Error(\"Calling the test function inside another test function is not allowed. Please put it inside \\\"describe\\\" or \\\"suite\\\" so it can be properly collected.\");\n\tgetCurrentSuite().test.fn.call(this, formatName(name), optionsOrFn, optionsOrTest);\n});\n/**\n* Creates a suite of tests, allowing for grouping and hierarchical organization of tests.\n* Suites can contain both tests and other suites, enabling complex test structures.\n*\n* @param {string} name - The name of the suite, used for identification and reporting.\n* @param {Function} fn - A function that defines the tests and suites within this suite.\n* @example\n* ```ts\n* // Define a suite with two tests\n* describe('Math operations', () => {\n*   test('should add two numbers', () => {\n*     expect(add(1, 2)).toBe(3);\n*   });\n*\n*   test('should subtract two numbers', () => {\n*     expect(subtract(5, 2)).toBe(3);\n*   });\n* });\n* ```\n* @example\n* ```ts\n* // Define nested suites\n* describe('String operations', () => {\n*   describe('Trimming', () => {\n*     test('should trim whitespace from start and end', () => {\n*       expect('  hello  '.trim()).toBe('hello');\n*     });\n*   });\n*\n*   describe('Concatenation', () => {\n*     test('should concatenate two strings', () => {\n*       expect('hello' + ' ' + 'world').toBe('hello world');\n*     });\n*   });\n* });\n* ```\n*/\nconst describe = suite;\n/**\n* Defines a test case with a given name and test function. The test function can optionally be configured with test options.\n*\n* @param {string | Function} name - The name of the test or a function that will be used as a test name.\n* @param {TestOptions | TestFunction} [optionsOrFn] - Optional. The test options or the test function if no explicit name is provided.\n* @param {number | TestOptions | TestFunction} [optionsOrTest] - Optional. The test function or options, depending on the previous parameters.\n* @throws {Error} If called inside another test function.\n* @example\n* ```ts\n* // Define a simple test\n* it('adds two numbers', () => {\n*   expect(add(1, 2)).toBe(3);\n* });\n* ```\n* @example\n* ```ts\n* // Define a test with options\n* it('subtracts two numbers', { retry: 3 }, () => {\n*   expect(subtract(5, 2)).toBe(3);\n* });\n* ```\n*/\nconst it = test;\nlet runner;\nlet defaultSuite;\nlet currentTestFilepath;\nfunction assert(condition, message) {\n\tif (!condition) throw new Error(`Vitest failed to find ${message}. One of the following is possible:\n- \"vitest\" is imported directly without running \"vitest\" command\n- \"vitest\" is imported inside \"globalSetup\" (to fix this, use \"setupFiles\" instead, because \"globalSetup\" runs in a different context)\n- \"vitest\" is imported inside Vite / Vitest config file\n- Otherwise, it might be a Vitest bug. Please report it to https://github.com/vitest-dev/vitest/issues\n`);\n}\nfunction getDefaultSuite() {\n\tassert(defaultSuite, \"the default suite\");\n\treturn defaultSuite;\n}\nfunction getRunner() {\n\tassert(runner, \"the runner\");\n\treturn runner;\n}\nfunction createDefaultSuite(runner) {\n\tconst config = runner.config.sequence;\n\tconst options = {};\n\tif (config.concurrent != null) options.concurrent = config.concurrent;\n\tconst collector = suite(\"\", options, () => {});\n\t// no parent suite for top-level tests\n\tdelete collector.suite;\n\treturn collector;\n}\nfunction clearCollectorContext(file, currentRunner) {\n\tcurrentTestFilepath = file.filepath;\n\trunner = currentRunner;\n\tif (!defaultSuite) defaultSuite = createDefaultSuite(currentRunner);\n\tdefaultSuite.file = file;\n\tcollectorContext.tasks.length = 0;\n\tdefaultSuite.clear();\n\tcollectorContext.currentSuite = defaultSuite;\n}\nfunction getCurrentSuite() {\n\tconst currentSuite = collectorContext.currentSuite || defaultSuite;\n\tassert(currentSuite, \"the current suite\");\n\treturn currentSuite;\n}\nfunction createSuiteHooks() {\n\treturn {\n\t\tbeforeAll: [],\n\t\tafterAll: [],\n\t\tbeforeEach: [],\n\t\tafterEach: [],\n\t\taroundEach: [],\n\t\taroundAll: []\n\t};\n}\nconst POSITIVE_INFINITY = Number.POSITIVE_INFINITY;\nfunction parseArguments(optionsOrFn, timeoutOrTest) {\n\tif (timeoutOrTest != null && typeof timeoutOrTest === \"object\") throw new TypeError(`Signature \"test(name, fn, { ... })\" was deprecated in Vitest 3 and removed in Vitest 4. Please, provide options as a second argument instead.`);\n\tlet options = {};\n\tlet fn;\n\t// it('', () => {}, 1000)\n\tif (typeof timeoutOrTest === \"number\") options = { timeout: timeoutOrTest };\n\telse if (typeof optionsOrFn === \"object\") options = optionsOrFn;\n\tif (typeof optionsOrFn === \"function\") {\n\t\tif (typeof timeoutOrTest === \"function\") throw new TypeError(\"Cannot use two functions as arguments. Please use the second argument for options.\");\n\t\tfn = optionsOrFn;\n\t} else if (typeof timeoutOrTest === \"function\") fn = timeoutOrTest;\n\treturn {\n\t\toptions,\n\t\thandler: fn\n\t};\n}\n// implementations\nfunction createSuiteCollector(name, factory = () => {}, mode, each, suiteOptions) {\n\tconst tasks = [];\n\tlet suite;\n\tinitSuite(true);\n\tconst task = function(name = \"\", options = {}) {\n\t\tconst currentSuite = collectorContext.currentSuite?.suite;\n\t\tconst parentTags = (currentSuite ?? collectorContext.currentSuite?.file)?.tags || [];\n\t\tconst testTags = unique([...parentTags, ...toArray(options.tags)]);\n\t\tconst tagsOptions = testTags.map((tag) => {\n\t\t\tconst tagDefinition = runner.config.tags?.find((t) => t.name === tag);\n\t\t\tif (!tagDefinition && runner.config.strictTags) throw createNoTagsError(runner.config.tags, tag);\n\t\t\treturn tagDefinition;\n\t\t}).filter((r) => r != null).sort((tag1, tag2) => (tag2.priority ?? POSITIVE_INFINITY) - (tag1.priority ?? POSITIVE_INFINITY)).reduce((acc, tag) => {\n\t\t\tconst { name, description, priority, meta, ...options } = tag;\n\t\t\tObject.assign(acc, options);\n\t\t\tif (meta) acc.meta = Object.assign(acc.meta ?? Object.create(null), meta);\n\t\t\treturn acc;\n\t\t}, {});\n\t\tconst testOwnMeta = options.meta;\n\t\toptions = {\n\t\t\t...collectorContext.currentSuite?.options,\n\t\t\t...tagsOptions,\n\t\t\t...options\n\t\t};\n\t\tconst timeout = options.timeout ?? runner.config.testTimeout;\n\t\t// TODO: should this be `parentTask.meta`?\n\t\t// currently we don't inherit\n\t\t//   file.meta -> task.meta\n\t\t//   file.meta -> suite.meta (see initSuite)\n\t\t// but we do inherit\n\t\t//   suite.meta -> task.meta\n\t\t//   suite.meta -> suite.meta\n\t\t// and also\n\t\t//   file.tags -> task.tags\n\t\t//   file.tags -> suite.tags\n\t\t//   suite.tags -> suite.tags\n\t\t//   suite.tags -> task.tags\n\t\tconst parentMeta = currentSuite?.meta;\n\t\tconst tagMeta = tagsOptions.meta;\n\t\tconst testMeta = Object.create(null);\n\t\tif (tagMeta) Object.assign(testMeta, tagMeta);\n\t\tif (parentMeta) Object.assign(testMeta, parentMeta);\n\t\tif (testOwnMeta) Object.assign(testMeta, testOwnMeta);\n\t\tconst task = {\n\t\t\tid: \"\",\n\t\t\tname,\n\t\t\tfullName: createTaskName([currentSuite?.fullName ?? collectorContext.currentSuite?.file?.fullName, name]),\n\t\t\tfullTestName: createTaskName([currentSuite?.fullTestName, name]),\n\t\t\tsuite: currentSuite,\n\t\t\teach: options.each,\n\t\t\tfails: options.fails,\n\t\t\tcontext: void 0,\n\t\t\ttype: \"test\",\n\t\t\tfile: currentSuite?.file ?? collectorContext.currentSuite?.file,\n\t\t\ttimeout,\n\t\t\tretry: options.retry ?? runner.config.retry,\n\t\t\trepeats: options.repeats ?? runner.config.repeats,\n\t\t\tmode: options.only ? \"only\" : options.skip ? \"skip\" : options.todo ? \"todo\" : \"run\",\n\t\t\tmeta: testMeta,\n\t\t\tannotations: [],\n\t\t\tartifacts: [],\n\t\t\tbenchmarks: [],\n\t\t\ttags: testTags\n\t\t};\n\t\tconst handler = options.handler;\n\t\tif (task.mode === \"run\" && !handler) task.mode = \"todo\";\n\t\tif (options.concurrent ?? runner.config.sequence.concurrent) task.concurrent = true;\n\t\ttask.shuffle = suiteOptions?.shuffle;\n\t\tconst context = createTestContext(task, runner);\n\t\t// create test context\n\t\tObject.defineProperty(task, \"context\", {\n\t\t\tvalue: context,\n\t\t\tenumerable: false\n\t\t});\n\t\tsetTestFixture(context, options.fixtures ?? new TestFixtures());\n\t\tconst limit = Error.stackTraceLimit;\n\t\tError.stackTraceLimit = 10;\n\t\tconst stackTraceError = /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\");\n\t\tError.stackTraceLimit = limit;\n\t\tif (handler) setFn(task, withTimeout(withCancel(withAwaitAsyncAssertions(withFixtures(handler, { context }), task), task.context.signal), timeout, false, stackTraceError, (_, error) => abortIfTimeout([context], error)));\n\t\tif (runner.config.includeTaskLocation) {\n\t\t\tconst stack = findTestFileStackTrace(currentTestFilepath, stackTraceError);\n\t\t\tif (stack) task.location = {\n\t\t\t\tline: stack.line,\n\t\t\t\tcolumn: stack.column\n\t\t\t};\n\t\t}\n\t\ttasks.push(task);\n\t\treturn task;\n\t};\n\tconst test = createTest(function(name, optionsOrFn, timeoutOrTest) {\n\t\tconst { options, handler } = parseArguments(optionsOrFn, timeoutOrTest);\n\t\tconst concurrent = this.concurrent ?? options?.concurrent;\n\t\tif (concurrent != null) options.concurrent = concurrent;\n\t\tconst test = task(formatName(name), {\n\t\t\t...this,\n\t\t\t...options,\n\t\t\thandler\n\t\t});\n\t\ttest.type = \"test\";\n\t});\n\tconst collector = {\n\t\ttype: \"collector\",\n\t\tname,\n\t\tmode,\n\t\tsuite,\n\t\toptions: suiteOptions,\n\t\ttest,\n\t\tfile: suite.file,\n\t\ttasks,\n\t\tcollect,\n\t\ttask,\n\t\tclear,\n\t\ton: addHook\n\t};\n\tfunction addHook(name, ...fn) {\n\t\tgetHooks(suite)[name].push(...fn);\n\t}\n\tfunction initSuite(includeLocation) {\n\t\tif (typeof suiteOptions === \"number\") suiteOptions = { timeout: suiteOptions };\n\t\tconst currentSuite = collectorContext.currentSuite?.suite;\n\t\tconst parentTask = currentSuite ?? collectorContext.currentSuite?.file;\n\t\tconst suiteTags = toArray(suiteOptions?.tags);\n\t\tvalidateTags(runner.config, suiteTags);\n\t\tsuite = {\n\t\t\tid: \"\",\n\t\t\ttype: \"suite\",\n\t\t\tname,\n\t\t\tfullName: createTaskName([currentSuite?.fullName ?? collectorContext.currentSuite?.file?.fullName, name]),\n\t\t\tfullTestName: createTaskName([currentSuite?.fullTestName, name]),\n\t\t\tsuite: currentSuite,\n\t\t\tmode,\n\t\t\teach,\n\t\t\tfile: currentSuite?.file ?? collectorContext.currentSuite?.file,\n\t\t\tshuffle: suiteOptions?.shuffle,\n\t\t\ttasks: [],\n\t\t\tmeta: suiteOptions?.meta ?? Object.create(null),\n\t\t\tconcurrent: suiteOptions?.concurrent,\n\t\t\ttags: unique([...parentTask?.tags || [], ...suiteTags])\n\t\t};\n\t\tif (runner && includeLocation && runner.config.includeTaskLocation) {\n\t\t\tconst limit = Error.stackTraceLimit;\n\t\t\tError.stackTraceLimit = 15;\n\t\t\tconst error = /* @__PURE__ */ new Error(\"stacktrace\");\n\t\t\tError.stackTraceLimit = limit;\n\t\t\tconst stack = findTestFileStackTrace(currentTestFilepath, error);\n\t\t\tif (stack) suite.location = {\n\t\t\t\tline: stack.line,\n\t\t\t\tcolumn: stack.column\n\t\t\t};\n\t\t}\n\t\tsetHooks(suite, createSuiteHooks());\n\t}\n\tfunction clear() {\n\t\ttasks.length = 0;\n\t\tinitSuite(false);\n\t}\n\tasync function collect(file) {\n\t\tif (!file) throw new TypeError(\"File is required to collect tasks.\");\n\t\tif (factory) await runWithSuite(collector, () => factory(test));\n\t\tconst allChildren = [];\n\t\tlet containsOnly = false;\n\t\tlet containsTest = false;\n\t\tfor (const i of tasks) {\n\t\t\tconst child = i.type === \"collector\" ? await i.collect(file) : i;\n\t\t\tallChildren.push(child);\n\t\t\tif (child.mode === \"only\" || child.type === \"suite\" && child.containsOnly) containsOnly = true;\n\t\t\tif (child.type === \"test\" || child.type === \"suite\" && child.containsTest) containsTest = true;\n\t\t}\n\t\tsuite.tasks = allChildren;\n\t\tsuite.containsOnly = containsOnly;\n\t\tsuite.containsTest = containsTest;\n\t\treturn suite;\n\t}\n\tcollectTask(collector);\n\treturn collector;\n}\nfunction withAwaitAsyncAssertions(fn, task) {\n\treturn (async (...args) => {\n\t\tconst fnResult = await fn(...args);\n\t\t// some async expect will be added to this array, in case user forget to await them\n\t\tif (task.promises) {\n\t\t\tconst errors = (await Promise.allSettled(task.promises)).map((r) => r.status === \"rejected\" ? r.reason : void 0).filter(Boolean);\n\t\t\tif (errors.length) throw errors;\n\t\t}\n\t\treturn fnResult;\n\t});\n}\nfunction createSuite() {\n\tfunction suiteFn(name, factoryOrOptions, optionsOrFactory) {\n\t\tif (getCurrentTest()) throw new Error(\"Calling the suite function inside test function is not allowed. It can be only called at the top level or inside another suite function.\");\n\t\tconst currentSuite = collectorContext.currentSuite || defaultSuite;\n\t\tlet { options, handler: factory } = parseArguments(factoryOrOptions, optionsOrFactory);\n\t\tconst { meta: parentMeta, ...parentOptions } = currentSuite?.options || {};\n\t\t// inherit options from current suite\n\t\toptions = {\n\t\t\t...parentOptions,\n\t\t\t...options\n\t\t};\n\t\tconst shuffle = this.shuffle ?? options.shuffle ?? currentSuite?.options?.shuffle ?? runner?.config.sequence.shuffle;\n\t\tif (shuffle != null) options.shuffle = shuffle;\n\t\tlet mode = this.only ?? options.only ? \"only\" : this.skip ?? options.skip ? \"skip\" : this.todo ?? options.todo ? \"todo\" : \"run\";\n\t\t// passed as test(name), assume it's a \"todo\"\n\t\tif (mode === \"run\" && !factory) mode = \"todo\";\n\t\tconst concurrent = this.concurrent ?? options.concurrent;\n\t\tif (concurrent != null) options.concurrent = concurrent;\n\t\tif (parentMeta) options.meta = Object.assign(Object.create(null), parentMeta, options.meta);\n\t\treturn createSuiteCollector(formatName(name), factory, mode, this.each, options);\n\t}\n\tsuiteFn.each = function(cases, ...args) {\n\t\tconst context = getChainableContext(this);\n\t\tconst suite = context.withContext();\n\t\tcontext.setContext(\"each\", true);\n\t\tif (Array.isArray(cases) && args.length) cases = formatTemplateString(cases, args);\n\t\treturn (name, optionsOrFn, fnOrOptions) => {\n\t\t\tconst _name = formatName(name);\n\t\t\tconst arrayOnlyCases = cases.every(Array.isArray);\n\t\t\tconst { options, handler } = parseArguments(optionsOrFn, fnOrOptions);\n\t\t\tconst fnFirst = typeof optionsOrFn === \"function\";\n\t\t\tcases.forEach((i, idx) => {\n\t\t\t\tconst items = Array.isArray(i) ? i : [i];\n\t\t\t\tif (fnFirst) if (arrayOnlyCases) suite(formatTitle(_name, items, idx), handler ? () => handler(...items) : void 0, options.timeout);\n\t\t\t\telse suite(formatTitle(_name, items, idx), handler ? () => handler(i) : void 0, options.timeout);\n\t\t\t\telse if (arrayOnlyCases) suite(formatTitle(_name, items, idx), options, handler ? () => handler(...items) : void 0);\n\t\t\t\telse suite(formatTitle(_name, items, idx), options, handler ? () => handler(i) : void 0);\n\t\t\t});\n\t\t\tcontext.setContext(\"each\", void 0);\n\t\t};\n\t};\n\tsuiteFn.for = function(cases, ...args) {\n\t\tconst suite = getChainableContext(this).withContext();\n\t\tif (Array.isArray(cases) && args.length) cases = formatTemplateString(cases, args);\n\t\treturn (name, optionsOrFn, fnOrOptions) => {\n\t\t\tconst name_ = formatName(name);\n\t\t\tconst { options, handler } = parseArguments(optionsOrFn, fnOrOptions);\n\t\t\tcases.forEach((item, idx) => {\n\t\t\t\tsuite(formatTitle(name_, toArray(item), idx), options, handler ? () => handler(item) : void 0);\n\t\t\t});\n\t\t};\n\t};\n\tsuiteFn.skipIf = (condition) => condition ? suite.skip : suite;\n\tsuiteFn.runIf = (condition) => condition ? suite : suite.skip;\n\treturn createChainable([\n\t\t\"concurrent\",\n\t\t\"shuffle\",\n\t\t\"skip\",\n\t\t\"only\",\n\t\t\"todo\"\n\t], suiteFn);\n}\nfunction createTaskCollector(fn) {\n\tconst taskFn = fn;\n\ttaskFn.each = function(cases, ...args) {\n\t\tconst context = getChainableContext(this);\n\t\tconst test = context.withContext();\n\t\tcontext.setContext(\"each\", true);\n\t\tif (Array.isArray(cases) && args.length) cases = formatTemplateString(cases, args);\n\t\treturn (name, optionsOrFn, fnOrOptions) => {\n\t\t\tconst _name = formatName(name);\n\t\t\tconst arrayOnlyCases = cases.every(Array.isArray);\n\t\t\tconst { options, handler } = parseArguments(optionsOrFn, fnOrOptions);\n\t\t\tconst fnFirst = typeof optionsOrFn === \"function\";\n\t\t\tcases.forEach((i, idx) => {\n\t\t\t\tconst items = Array.isArray(i) ? i : [i];\n\t\t\t\tif (fnFirst) if (arrayOnlyCases) test(formatTitle(_name, items, idx), handler ? () => handler(...items) : void 0, options.timeout);\n\t\t\t\telse test(formatTitle(_name, items, idx), handler ? () => handler(i) : void 0, options.timeout);\n\t\t\t\telse if (arrayOnlyCases) test(formatTitle(_name, items, idx), options, handler ? () => handler(...items) : void 0);\n\t\t\t\telse test(formatTitle(_name, items, idx), options, handler ? () => handler(i) : void 0);\n\t\t\t});\n\t\t\tcontext.setContext(\"each\", void 0);\n\t\t};\n\t};\n\ttaskFn.for = function(cases, ...args) {\n\t\tconst test = getChainableContext(this).withContext();\n\t\tif (Array.isArray(cases) && args.length) cases = formatTemplateString(cases, args);\n\t\treturn (name, optionsOrFn, fnOrOptions) => {\n\t\t\tconst _name = formatName(name);\n\t\t\tconst { options, handler } = parseArguments(optionsOrFn, fnOrOptions);\n\t\t\tcases.forEach((item, idx) => {\n\t\t\t\t// monkey-patch handler to allow parsing fixture\n\t\t\t\tconst handlerWrapper = handler ? (ctx) => handler(item, ctx) : void 0;\n\t\t\t\tif (handlerWrapper) configureProps(handlerWrapper, {\n\t\t\t\t\tindex: 1,\n\t\t\t\t\toriginal: handler\n\t\t\t\t});\n\t\t\t\ttest(formatTitle(_name, toArray(item), idx), options, handlerWrapper);\n\t\t\t});\n\t\t};\n\t};\n\ttaskFn.skipIf = function(condition) {\n\t\treturn condition ? this.skip : this;\n\t};\n\ttaskFn.runIf = function(condition) {\n\t\treturn condition ? this : this.skip;\n\t};\n\t/**\n\t* Parse builder pattern arguments into a fixtures object.\n\t* Handles both builder pattern (name, options?, value) and object syntax.\n\t*/\n\tfunction parseBuilderFixtures(fixturesOrName, optionsOrFn, maybeFn) {\n\t\t// Object syntax: just return as-is\n\t\tif (typeof fixturesOrName !== \"string\") return fixturesOrName;\n\t\tconst fixtureName = fixturesOrName;\n\t\tlet fixtureOptions;\n\t\tlet fixtureValue;\n\t\tif (maybeFn !== void 0) {\n\t\t\t// (name, options, value) or (name, options, fn)\n\t\t\tfixtureOptions = optionsOrFn;\n\t\t\tfixtureValue = maybeFn;\n\t\t} else if (optionsOrFn !== null && typeof optionsOrFn === \"object\" && !Array.isArray(optionsOrFn) && TestFixtures.isFixtureOptions(optionsOrFn)) {\n\t\t\t// (name, options) with no value - treat as empty object fixture\n\t\t\tfixtureOptions = optionsOrFn;\n\t\t\tfixtureValue = {};\n\t\t} else {\n\t\t\t// (name, value) or (name, fn)\n\t\t\tfixtureOptions = void 0;\n\t\t\tfixtureValue = optionsOrFn;\n\t\t}\n\t\t// Function value: wrap with onCleanup pattern\n\t\tif (typeof fixtureValue === \"function\") {\n\t\t\tconst builderFn = fixtureValue;\n\t\t\t// Wrap builder pattern function (returns value) to use() pattern\n\t\t\tconst fixture = async (ctx, use) => {\n\t\t\t\tlet cleanup;\n\t\t\t\tconst onCleanup = (fn) => {\n\t\t\t\t\tif (cleanup !== void 0) throw new Error(\"onCleanup can only be called once per fixture. Define separate fixtures if you need multiple cleanup functions.\");\n\t\t\t\t\tcleanup = fn;\n\t\t\t\t};\n\t\t\t\tawait use(await builderFn(ctx, { onCleanup }));\n\t\t\t\tif (cleanup) await cleanup();\n\t\t\t};\n\t\t\tconfigureProps(fixture, { original: builderFn });\n\t\t\tif (fixtureOptions) return { [fixtureName]: [fixture, fixtureOptions] };\n\t\t\treturn { [fixtureName]: fixture };\n\t\t}\n\t\t// Non-function value: use directly\n\t\tif (fixtureOptions) return { [fixtureName]: [fixtureValue, fixtureOptions] };\n\t\treturn { [fixtureName]: fixtureValue };\n\t}\n\ttaskFn.override = function(fixturesOrName, optionsOrFn, maybeFn) {\n\t\tconst userFixtures = parseBuilderFixtures(fixturesOrName, optionsOrFn, maybeFn);\n\t\tgetChainableContext(this).getFixtures().override(runner, userFixtures);\n\t\treturn this;\n\t};\n\ttaskFn.scoped = function(fixtures) {\n\t\tconsole.warn(`test.scoped() is deprecated and will be removed in future versions. Please use test.override() instead.`);\n\t\treturn this.override(fixtures);\n\t};\n\ttaskFn.extend = function(fixturesOrName, optionsOrFn, maybeFn) {\n\t\tconst userFixtures = parseBuilderFixtures(fixturesOrName, optionsOrFn, maybeFn);\n\t\tconst fixtures = getChainableContext(this).getFixtures().extend(runner, userFixtures);\n\t\tconst _test = createTest(function(name, optionsOrFn, optionsOrTest) {\n\t\t\tfn.call(this, formatName(name), optionsOrFn, optionsOrTest);\n\t\t});\n\t\tgetChainableContext(_test).mergeContext({ fixtures });\n\t\treturn _test;\n\t};\n\ttaskFn.describe = suite;\n\ttaskFn.suite = suite;\n\ttaskFn.beforeEach = beforeEach;\n\ttaskFn.afterEach = afterEach;\n\ttaskFn.beforeAll = beforeAll;\n\ttaskFn.afterAll = afterAll;\n\ttaskFn.aroundEach = aroundEach;\n\ttaskFn.aroundAll = aroundAll;\n\treturn createChainable([\n\t\t\"concurrent\",\n\t\t\"skip\",\n\t\t\"only\",\n\t\t\"todo\",\n\t\t\"fails\"\n\t], taskFn, { fixtures: new TestFixtures() });\n}\nfunction createTest(fn) {\n\treturn createTaskCollector(fn);\n}\nfunction formatName(name) {\n\treturn typeof name === \"string\" ? name : typeof name === \"function\" ? name.name || \"<anonymous>\" : String(name);\n}\nfunction formatTitle(template, items, idx) {\n\tif (template.includes(\"%#\") || template.includes(\"%$\"))\n // '%#' match index of the test case\n\ttemplate = template.replace(/%%/g, \"__vitest_escaped_%__\").replace(/%#/g, `${idx}`).replace(/%\\$/g, `${idx + 1}`).replace(/__vitest_escaped_%__/g, \"%%\");\n\tconst count = template.split(\"%\").length - 1;\n\tif (template.includes(\"%f\")) (template.match(/%f/g) || []).forEach((_, i) => {\n\t\tif (isNegativeNaN(items[i]) || Object.is(items[i], -0)) {\n\t\t\t// Replace the i-th occurrence of '%f' with '-%f'\n\t\t\tlet occurrence = 0;\n\t\t\ttemplate = template.replace(/%f/g, (match) => {\n\t\t\t\toccurrence++;\n\t\t\t\treturn occurrence === i + 1 ? \"-%f\" : match;\n\t\t\t});\n\t\t}\n\t});\n\tconst inspectOptions = { truncate: runner.config.taskTitleValueFormatTruncate };\n\tconst isObjectItem = isObject(items[0]);\n\tfunction formatAttribute(s) {\n\t\treturn s.replace(/\\$([$\\p{ID_Continue}.]+)/gu, (_, key) => {\n\t\t\tconst isArrayKey = /^\\d+$/.test(key);\n\t\t\tif (!isObjectItem && !isArrayKey) return `$${key}`;\n\t\t\tconst arrayElement = isArrayKey ? objectAttr(items, key) : void 0;\n\t\t\tconst value = isObjectItem ? objectAttr(items[0], key, arrayElement) : arrayElement;\n\t\t\t// print string without quotes\n\t\t\tif (typeof value === \"string\") return truncateString(value, inspectOptions.truncate);\n\t\t\treturn inspect(value, inspectOptions);\n\t\t});\n\t}\n\tlet output = \"\";\n\tlet i = 0;\n\thandleRegexMatch(\n\t\ttemplate,\n\t\tformatRegExp,\n\t\t// format \"%\"\n\t\t(match) => {\n\t\t\tif (i < count) output += format$1([match[0], items[i++]], inspectOptions);\n\t\t\telse output += match[0];\n\t\t},\n\t\t// format \"$\"\n\t\t(nonMatch) => {\n\t\t\toutput += formatAttribute(nonMatch);\n\t\t}\n\t);\n\treturn output;\n}\n// based on https://github.com/unocss/unocss/blob/2e74b31625bbe3b9c8351570749aa2d3f799d919/packages/autocomplete/src/parse.ts#L11\nfunction handleRegexMatch(input, regex, onMatch, onNonMatch) {\n\tlet lastIndex = 0;\n\tfor (const m of input.matchAll(regex)) {\n\t\tif (lastIndex < m.index) onNonMatch(input.slice(lastIndex, m.index));\n\t\tonMatch(m);\n\t\tlastIndex = m.index + m[0].length;\n\t}\n\tif (lastIndex < input.length) onNonMatch(input.slice(lastIndex));\n}\nfunction formatTemplateString(cases, args) {\n\tconst header = cases.join(\"\").trim().replace(/ /g, \"\").split(\"\\n\").map((i) => i.split(\"|\"))[0];\n\tconst res = [];\n\tfor (let i = 0; i < Math.floor(args.length / header.length); i++) {\n\t\tconst oneCase = {};\n\t\tfor (let j = 0; j < header.length; j++) oneCase[header[j]] = args[i * header.length + j];\n\t\tres.push(oneCase);\n\t}\n\treturn res;\n}\n\n/**\n* @experimental\n* @advanced\n*\n* Records a custom test artifact during test execution.\n*\n* This function allows you to attach structured data, files, or metadata to a test.\n*\n* Vitest automatically injects the source location where the artifact was created and manages any attachments you include.\n*\n* **Note:** artifacts must be recorded before the task is reported. Any artifacts recorded after that will not be included in the task.\n*\n* @param task - The test task context, typically accessed via `this.task` in custom matchers or `context.task` in tests\n* @param artifact - The artifact to record. Must extend {@linkcode TestArtifactBase}\n*\n* @returns A promise that resolves to the recorded artifact with location injected\n*\n* @throws {Error} If the test runner doesn't support artifacts\n*\n* @example\n* ```ts\n* // In a custom assertion\n* async function toHaveValidSchema(this: MatcherState, actual: unknown) {\n*   const validation = validateSchema(actual)\n*\n*   await recordArtifact(this.task, {\n*     type: 'my-plugin:schema-validation',\n*     passed: validation.valid,\n*     errors: validation.errors,\n*   })\n*\n*   return { pass: validation.valid, message: () => '...' }\n* }\n* ```\n*/\nasync function recordArtifact(task, artifact) {\n\tconst runner = getRunner();\n\tconst stack = findTestFileStackTrace(task.file.filepath, /* @__PURE__ */ new Error(\"STACK_TRACE\"));\n\tif (stack) {\n\t\tartifact.location = {\n\t\t\tfile: stack.file,\n\t\t\tline: stack.line,\n\t\t\tcolumn: stack.column\n\t\t};\n\t\tif (artifact.type === \"internal:annotation\") artifact.annotation.location = artifact.location;\n\t}\n\tif (Array.isArray(artifact.attachments)) for (const attachment of artifact.attachments) manageArtifactAttachment(attachment);\n\t// annotations won't resolve as artifacts for backwards compatibility until next major\n\tif (artifact.type === \"internal:annotation\") return artifact;\n\tif (!runner.onTestArtifactRecord) throw new Error(`Test runner doesn't support test artifacts.`);\n\tawait finishSendTasksUpdate(runner);\n\tconst resolvedArtifact = await runner.onTestArtifactRecord(task, artifact);\n\ttask.artifacts.push(resolvedArtifact);\n\treturn resolvedArtifact;\n}\nconst table = [];\nfor (let i = 65; i < 91; i++) table.push(String.fromCharCode(i));\nfor (let i = 97; i < 123; i++) table.push(String.fromCharCode(i));\nfor (let i = 0; i < 10; i++) table.push(i.toString(10));\ntable.push(\"+\", \"/\");\nfunction encodeUint8Array(bytes) {\n\tlet base64 = \"\";\n\tconst len = bytes.byteLength;\n\tfor (let i = 0; i < len; i += 3) if (len === i + 1) {\n\t\tconst a = (bytes[i] & 252) >> 2;\n\t\tconst b = (bytes[i] & 3) << 4;\n\t\tbase64 += table[a];\n\t\tbase64 += table[b];\n\t\tbase64 += \"==\";\n\t} else if (len === i + 2) {\n\t\tconst a = (bytes[i] & 252) >> 2;\n\t\tconst b = (bytes[i] & 3) << 4 | (bytes[i + 1] & 240) >> 4;\n\t\tconst c = (bytes[i + 1] & 15) << 2;\n\t\tbase64 += table[a];\n\t\tbase64 += table[b];\n\t\tbase64 += table[c];\n\t\tbase64 += \"=\";\n\t} else {\n\t\tconst a = (bytes[i] & 252) >> 2;\n\t\tconst b = (bytes[i] & 3) << 4 | (bytes[i + 1] & 240) >> 4;\n\t\tconst c = (bytes[i + 1] & 15) << 2 | (bytes[i + 2] & 192) >> 6;\n\t\tconst d = bytes[i + 2] & 63;\n\t\tbase64 += table[a];\n\t\tbase64 += table[b];\n\t\tbase64 += table[c];\n\t\tbase64 += table[d];\n\t}\n\treturn base64;\n}\n/**\n* Records an async operation associated with a test task.\n*\n* This function tracks promises that should be awaited before a test completes.\n* The promise is automatically removed from the test's promise list once it settles.\n*/\nfunction recordAsyncOperation(test, promise) {\n\t// if promise is explicitly awaited, remove it from the list\n\tpromise = promise.finally(() => {\n\t\tif (!test.promises) return;\n\t\tconst index = test.promises.indexOf(promise);\n\t\tif (index !== -1) test.promises.splice(index, 1);\n\t});\n\t// record promise\n\tif (!test.promises) test.promises = [];\n\ttest.promises.push(promise);\n\treturn promise;\n}\n/**\n* Validates and prepares a test attachment for serialization.\n*\n* This function ensures attachments have either `body` or `path` set (but not both), and converts `Uint8Array` bodies to base64-encoded strings for easier serialization.\n*\n* @param attachment - The attachment to validate and prepare\n*\n* @throws {TypeError} If neither `body` nor `path` is provided\n* @throws {TypeError} If both `body` and `path` are provided\n*/\nfunction manageArtifactAttachment(attachment) {\n\tif (attachment.body == null && !attachment.path) throw new TypeError(`Test attachment requires \"body\" or \"path\" to be set. Both are missing.`);\n\tif (attachment.body && attachment.path) throw new TypeError(`Test attachment requires only one of \"body\" or \"path\" to be set. Both are specified.`);\n\tif (attachment.path && attachment.bodyEncoding) throw new TypeError(`Test attachment with \"path\" should not have \"bodyEncoding\" specified.`);\n\t// convert to a string so it's easier to serialise\n\tif (attachment.body instanceof Uint8Array) attachment.body = encodeUint8Array(attachment.body);\n\tif (attachment.body != null) attachment.bodyEncoding ??= \"base64\";\n}\n\nconst now$2 = globalThis.performance ? globalThis.performance.now.bind(globalThis.performance) : Date.now;\n// makes an operation deadline derived from the task fire before the task timer\nconst DERIVED_BUFFER = 100;\n// how long the task timer waits for a tracked operation past that operation's own deadline\nconst SETTLE_GRACE = 500;\nclass TaskDeadline {\n\tstartTime = now$2();\n\tendTime;\n\ttimer;\n\toperations = /* @__PURE__ */ new Set();\n\tconstructor(timeout, onTimeout) {\n\t\tthis.endTime = this.startTime + timeout;\n\t\tconst { setTimeout } = getSafeTimers();\n\t\tthis.timer = setTimeout(onTimeout, timeout);\n\t\t// `unref` might not exist in browser\n\t\tthis.timer.unref?.();\n\t}\n\tremaining() {\n\t\treturn this.endTime - now$2();\n\t}\n\texceeded() {\n\t\treturn now$2() >= this.endTime;\n\t}\n\tclear() {\n\t\tconst { clearTimeout } = getSafeTimers();\n\t\tclearTimeout(this.timer);\n\t}\n\t/** timeout for an operation that must fail before the task does */\n\tderive() {\n\t\treturn Math.max(Math.floor(this.remaining()) - DERIVED_BUFFER, 1);\n\t}\n\t/** Registers an operation with its own timeout; see `settle`. */\n\ttrack(name, promise, timeout, source) {\n\t\tconst operation = {\n\t\t\tname,\n\t\t\tsource,\n\t\t\tpromise,\n\t\t\tendTime: now$2() + timeout\n\t\t};\n\t\tthis.operations.add(operation);\n\t\tpromise.finally(() => this.operations.delete(operation)).catch(() => {});\n\t\treturn promise;\n\t}\n\t/**\n\t* Waits for the operations that were due before the task, if possible.\n\t*/\n\tsettle() {\n\t\tif (!this.operations.size) return;\n\t\tconst operations = [...this.operations];\n\t\tconst pending = () => operations.filter((operation) => this.operations.has(operation));\n\t\tconst due = operations.filter((operation) => operation.endTime <= this.endTime);\n\t\tif (!due.length)\n // return operations whose timeout is larger than task for a better stack trace\n\t\treturn Promise.resolve(operations);\n\t\tconst { setTimeout } = getSafeTimers();\n\t\tconst waitUntil = Math.max(...due.map((operation) => operation.endTime)) + SETTLE_GRACE;\n\t\treturn Promise.race([Promise.all(due.map((operation) => operation.promise)).then(pending), new Promise((resolve) => setTimeout(() => {\n\t\t\tresolve(pending());\n\t\t\t// the grace may already be in the past\n\t\t}, Math.max(waitUntil - now$2(), 0)))]);\n\t}\n}\n\nconst collectorContext = {\n\ttasks: [],\n\tcurrentSuite: null\n};\nfunction collectTask(task) {\n\tcollectorContext.currentSuite?.tasks.push(task);\n}\nasync function runWithSuite(suite, fn) {\n\tconst prev = collectorContext.currentSuite;\n\tcollectorContext.currentSuite = suite;\n\tawait fn();\n\tcollectorContext.currentSuite = prev;\n}\nfunction withTimeout(fn, timeout, isHook = false, stackTraceError, onTimeout) {\n\tif (timeout <= 0 || timeout === Number.POSITIVE_INFINITY) return fn;\n\t// this function name is used to filter error in test/e2e/test/fails.test.ts\n\treturn (function runWithTimeout(...args) {\n\t\tconst runner = getRunner();\n\t\tconst previousDeadline = runner._deadline;\n\t\treturn new Promise((resolve_, reject_) => {\n\t\t\tlet settled = false;\n\t\t\tconst deadline = new TaskDeadline(timeout, () => {\n\t\t\t\t// an operation derived a shorter deadline from this one,\n\t\t\t\t// so its error describes the failure better than a generic timeout\n\t\t\t\tconst pending = deadline.settle();\n\t\t\t\tif (pending) {\n\t\t\t\t\tpending.then(rejectTimeoutError, reject);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\trejectTimeoutError();\n\t\t\t});\n\t\t\trunner._deadline = deadline;\n\t\t\tfunction rejectTimeoutError(pending) {\n\t\t\t\tif (settled) return;\n\t\t\t\tsettled = true;\n\t\t\t\tconst error = makeTimeoutError(isHook, timeout, stackTraceError, pending);\n\t\t\t\tonTimeout?.(args, error);\n\t\t\t\treject_(error);\n\t\t\t}\n\t\t\tfunction resolve(result) {\n\t\t\t\trunner._deadline = previousDeadline;\n\t\t\t\tdeadline.clear();\n\t\t\t\t// if test/hook took too long in microtask, setTimeout won't be triggered,\n\t\t\t\t// but we still need to fail the test, see\n\t\t\t\t// https://github.com/vitest-dev/vitest/issues/2920\n\t\t\t\tif (deadline.exceeded()) {\n\t\t\t\t\trejectTimeoutError();\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tsettled = true;\n\t\t\t\tresolve_(result);\n\t\t\t}\n\t\t\tfunction reject(error) {\n\t\t\t\tif (settled) return;\n\t\t\t\tsettled = true;\n\t\t\t\trunner._deadline = previousDeadline;\n\t\t\t\tdeadline.clear();\n\t\t\t\treject_(error);\n\t\t\t}\n\t\t\t// sync test/hook will be caught by try/catch\n\t\t\ttry {\n\t\t\t\tconst result = fn(...args);\n\t\t\t\t// the result is a thenable, we don't wrap this in Promise.resolve\n\t\t\t\t// to avoid creating new promises\n\t\t\t\tif (typeof result === \"object\" && result != null && typeof result.then === \"function\") result.then(resolve, reject);\n\t\t\t\telse resolve(result);\n\t\t\t} \n\t\t\t// user sync test/hook throws an error\ncatch (error) {\n\t\t\t\treject(error);\n\t\t\t}\n\t\t});\n\t});\n}\nfunction withCancel(fn, signal) {\n\treturn (function runWithCancel(...args) {\n\t\treturn new Promise((resolve, reject) => {\n\t\t\tconst onAbort = () => reject(signal.reason);\n\t\t\tsignal.addEventListener(\"abort\", onAbort, { once: true });\n\t\t\tconst cleanup = () => signal.removeEventListener(\"abort\", onAbort);\n\t\t\ttry {\n\t\t\t\tconst result = fn(...args);\n\t\t\t\tif (typeof result === \"object\" && result != null && typeof result.then === \"function\") result.then((value) => {\n\t\t\t\t\tcleanup();\n\t\t\t\t\tresolve(value);\n\t\t\t\t}, (error) => {\n\t\t\t\t\tcleanup();\n\t\t\t\t\treject(error);\n\t\t\t\t});\n\t\t\t\telse {\n\t\t\t\t\tcleanup();\n\t\t\t\t\tresolve(result);\n\t\t\t\t}\n\t\t\t} catch (error) {\n\t\t\t\tcleanup();\n\t\t\t\treject(error);\n\t\t\t}\n\t\t});\n\t});\n}\nconst abortControllers = /* @__PURE__ */ new WeakMap();\nfunction abortIfTimeout([context], error) {\n\tif (context) abortContextSignal(context, error);\n}\nfunction abortContextSignal(context, error) {\n\tabortControllers.get(context)?.abort(error);\n}\nfunction createTestContext(test, runner) {\n\tconst context = function() {\n\t\tthrow new Error(\"done() callback is deprecated, use promise instead\");\n\t};\n\tlet abortController = abortControllers.get(context);\n\tif (!abortController) {\n\t\tabortController = new AbortController();\n\t\tabortControllers.set(context, abortController);\n\t}\n\tcontext.signal = abortController.signal;\n\tcontext.task = test;\n\tcontext.skip = (condition, note) => {\n\t\tif (condition === false)\n // do nothing\n\t\treturn;\n\t\ttest.result ??= { state: \"skip\" };\n\t\ttest.result.pending = true;\n\t\tthrow new PendingError(\"test is skipped; abort execution\", test, typeof condition === \"string\" ? condition : note);\n\t};\n\tcontext.annotate = ((message, type, attachment) => {\n\t\tif (test.result && test.result.state !== \"run\") throw new Error(`Cannot annotate tests outside of the test run. The test \"${test.name}\" finished running with the \"${test.result.state}\" state already.`);\n\t\tconst annotation = {\n\t\t\tmessage,\n\t\t\ttype: typeof type === \"object\" || type === void 0 ? \"notice\" : type\n\t\t};\n\t\tconst annotationAttachment = typeof type === \"object\" ? type : attachment;\n\t\tif (annotationAttachment) {\n\t\t\tannotation.attachment = annotationAttachment;\n\t\t\tmanageArtifactAttachment(annotation.attachment);\n\t\t}\n\t\treturn recordAsyncOperation(test, recordArtifact(test, {\n\t\t\ttype: \"internal:annotation\",\n\t\t\tannotation\n\t\t}).then(async ({ annotation }) => {\n\t\t\tif (!runner.onTestAnnotate) throw new Error(`Test runner doesn't support test annotations.`);\n\t\t\tawait finishSendTasksUpdate(runner);\n\t\t\tconst resolvedAnnotation = await runner.onTestAnnotate(test, annotation);\n\t\t\ttest.annotations.push(resolvedAnnotation);\n\t\t\treturn resolvedAnnotation;\n\t\t}));\n\t});\n\tcontext.onTestFailed = (handler, timeout) => {\n\t\ttest.onFailed ||= [];\n\t\ttest.onFailed.push(withTimeout(handler, timeout ?? runner.config.hookTimeout, true, /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\"), (_, error) => abortController.abort(error)));\n\t};\n\tcontext.onTestFinished = (handler, timeout) => {\n\t\ttest.onFinished ||= [];\n\t\ttest.onFinished.push(withTimeout(handler, timeout ?? runner.config.hookTimeout, true, /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\"), (_, error) => abortController.abort(error)));\n\t};\n\treturn runner.extendTaskContext?.(context) || context;\n}\nfunction makeTimeoutError(isHook, timeout, stackTraceError, pending) {\n\tconst waiting = pending?.length ? ` while waiting for ${pending.map((operation) => operation.name).join(\", \")}` : \"\";\n\t// point at the action the task is stuck on rather than at the task itself\n\tconst lastOperationSource = pending?.at(-1)?.source;\n\tif (lastOperationSource) stackTraceError = lastOperationSource;\n\tconst message = `${isHook ? \"Hook\" : \"Test\"} timed out in ${timeout}ms${waiting}.\\nIf this is a long-running ${isHook ? \"hook\" : \"test\"}, pass a timeout value as the last argument or configure it globally with \"${isHook ? \"hookTimeout\" : \"testTimeout\"}\".`;\n\tconst error = new Error(message);\n\tif (stackTraceError?.stack) error.stack = stackTraceError.stack.replace(stackTraceError.message, error.message);\n\treturn error;\n}\n\nasync function runSetupFiles(config, files, runner) {\n\tif (config.sequence.setupFiles === \"parallel\") await Promise.all(files.map(async (fsPath) => {\n\t\tawait runner.importFile(fsPath, \"setup\");\n\t}));\n\telse for (const fsPath of files) await runner.importFile(fsPath, \"setup\");\n}\n\nconst now$1 = globalThis.performance ? globalThis.performance.now.bind(globalThis.performance) : Date.now;\nasync function collectTests(specs, runner) {\n\tconst files = [];\n\tconst config = runner.config;\n\tconst $ = runner.trace;\n\tlet defaultTagsFilter;\n\tfor (const spec of specs) {\n\t\tconst filepath = typeof spec === \"string\" ? spec : spec.filepath;\n\t\tawait $(\"collect_spec\", { \"code.file.path\": filepath }, async () => {\n\t\t\trunner._currentSpecification = typeof spec === \"string\" ? { filepath: spec } : spec;\n\t\t\tconst testLocations = typeof spec === \"string\" ? void 0 : spec.testLocations;\n\t\t\tconst testNamePattern = typeof spec === \"string\" ? void 0 : spec.testNamePattern;\n\t\t\tconst testIds = typeof spec === \"string\" ? void 0 : spec.testIds;\n\t\t\tconst testTagsFilter = typeof spec === \"object\" && spec.testTagsFilter ? createTagsFilter(spec.testTagsFilter, config.tags) : void 0;\n\t\t\tconst fileTags = typeof spec === \"string\" ? [] : spec.fileTags || [];\n\t\t\tconst file = createFileTask(filepath, config.root, config.name, runner.pool, runner.viteEnvironment, { __vitest_label__: config.mergeReportsLabel });\n\t\t\tfile.tags = fileTags;\n\t\t\tfile.shuffle = config.sequence.shuffle;\n\t\t\ttry {\n\t\t\t\tvalidateTags(runner.config, fileTags);\n\t\t\t\trunner.onCollectStart?.(file);\n\t\t\t\tclearCollectorContext(file, runner);\n\t\t\t\tconst setupFiles = toArray(config.setupFiles);\n\t\t\t\tconst fetchBeforeSetup = runner.getModuleFetchDuration?.();\n\t\t\t\tif (setupFiles.length) {\n\t\t\t\t\tconst setupStart = now$1();\n\t\t\t\t\tawait runSetupFiles(config, setupFiles, runner);\n\t\t\t\t\tfile.setupDuration = now$1() - setupStart;\n\t\t\t\t} else file.setupDuration = 0;\n\t\t\t\tconst fetchBeforeCollect = runner.getModuleFetchDuration?.();\n\t\t\t\tif (fetchBeforeSetup != null && fetchBeforeCollect != null) file.setupFetchDuration = fetchBeforeCollect - fetchBeforeSetup;\n\t\t\t\tconst collectStart = now$1();\n\t\t\t\tawait runner.importFile(filepath, \"collect\");\n\t\t\t\tconst durations = runner.getImportDurations?.();\n\t\t\t\tif (durations) file.importDurations = durations;\n\t\t\t\tconst defaultTasks = await getDefaultSuite().collect(file);\n\t\t\t\tconst fileHooks = createSuiteHooks();\n\t\t\t\tmergeHooks(fileHooks, getHooks(defaultTasks));\n\t\t\t\tfor (const c of [...defaultTasks.tasks, ...collectorContext.tasks]) if (c.type === \"test\" || c.type === \"suite\") file.tasks.push(c);\n\t\t\t\telse if (c.type === \"collector\") {\n\t\t\t\t\tconst suite = await c.collect(file);\n\t\t\t\t\tif (suite.name || suite.tasks.length) {\n\t\t\t\t\t\tmergeHooks(fileHooks, getHooks(suite));\n\t\t\t\t\t\tfile.tasks.push(suite);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tsetHooks(file, fileHooks);\n\t\t\t\tfile.collectDuration = now$1() - collectStart;\n\t\t\t\tconst fetchAfterCollect = runner.getModuleFetchDuration?.();\n\t\t\t\tif (fetchBeforeCollect != null && fetchAfterCollect != null) file.collectFetchDuration = fetchAfterCollect - fetchBeforeCollect;\n\t\t\t} catch (e) {\n\t\t\t\tfile.result = {\n\t\t\t\t\tstate: \"fail\",\n\t\t\t\t\terrors: e instanceof AggregateError ? e.errors.map((e) => processError(e, runner.config._diffOptions)) : [processError(e, runner.config._diffOptions)]\n\t\t\t\t};\n\t\t\t\tconst durations = runner.getImportDurations?.();\n\t\t\t\tif (durations) file.importDurations = durations;\n\t\t\t}\n\t\t\tcalculateSuiteHash(file);\n\t\t\t// the file's children are assembled here (not in a suite collector), so\n\t\t\t// roll up the collection-time flags for the file itself\n\t\t\tfile.containsOnly = file.tasks.some((t) => t.mode === \"only\" || t.type === \"suite\" && t.containsOnly);\n\t\t\tfile.containsTest = file.tasks.some((t) => t.type === \"test\" || t.type === \"suite\" && t.containsTest);\n\t\t\tconst hasOnlyTasks = file.containsOnly;\n\t\t\tif (!testTagsFilter && !defaultTagsFilter && config.tagsFilter) defaultTagsFilter = createTagsFilter(config.tagsFilter, config.tags);\n\t\t\tinterpretTaskModes(file, testNamePattern ?? config.testNamePattern, testLocations, testIds, testTagsFilter ?? defaultTagsFilter, hasOnlyTasks, false, config.allowOnly);\n\t\t\tif (file.mode === \"queued\") file.mode = \"run\";\n\t\t\tfiles.push(file);\n\t\t});\n\t}\n\treturn files;\n}\nfunction mergeHooks(baseHooks, hooks) {\n\tfor (const _key in hooks) {\n\t\tconst key = _key;\n\t\tbaseHooks[key].push(...hooks[key]);\n\t}\n\treturn baseHooks;\n}\n\n/**\n* Partition in tasks groups by consecutive concurrent\n*/\nfunction partitionSuiteChildren(suite) {\n\tlet tasksGroup = [];\n\tconst tasksGroups = [];\n\tfor (const c of suite.tasks) if (tasksGroup.length === 0 || c.concurrent === tasksGroup[0].concurrent) tasksGroup.push(c);\n\telse {\n\t\ttasksGroups.push(tasksGroup);\n\t\ttasksGroup = [c];\n\t}\n\tif (tasksGroup.length > 0) tasksGroups.push(tasksGroup);\n\treturn tasksGroups;\n}\n\nconst now = globalThis.performance ? globalThis.performance.now.bind(globalThis.performance) : Date.now;\nconst unixNow = Date.now;\nconst { clearTimeout, setTimeout } = getSafeTimers();\nlet limitMaxConcurrency;\nlet limitTestConcurrency;\n/**\n* Normalizes retry configuration to extract individual values.\n* Handles both number and object forms.\n*/\nfunction getRetryCount(retry) {\n\tif (retry === void 0) return 0;\n\tif (typeof retry === \"number\") return retry;\n\treturn retry.count ?? 0;\n}\nfunction getRetryDelay(retry) {\n\tif (retry === void 0) return 0;\n\tif (typeof retry === \"number\") return 0;\n\treturn retry.delay ?? 0;\n}\nfunction getRetryCondition(retry) {\n\tif (retry === void 0) return;\n\tif (typeof retry === \"number\") return;\n\treturn retry.condition;\n}\nfunction updateSuiteHookState(task, name, state, runner) {\n\tif (!task.result) task.result = { state: \"run\" };\n\tif (!task.result.hooks) task.result.hooks = {};\n\tconst suiteHooks = task.result.hooks;\n\tif (suiteHooks) {\n\t\tsuiteHooks[name] = state;\n\t\tlet event = state === \"run\" ? \"before-hook-start\" : \"before-hook-end\";\n\t\tif (name === \"afterAll\" || name === \"afterEach\") event = state === \"run\" ? \"after-hook-start\" : \"after-hook-end\";\n\t\tupdateTask(event, task, runner);\n\t}\n}\nfunction getSuiteHooks(suite, name, sequence) {\n\tconst hooks = getHooks(suite)[name];\n\tif (sequence === \"stack\" && (name === \"afterAll\" || name === \"afterEach\")) return hooks.slice().reverse();\n\treturn hooks;\n}\nasync function callTestHooks(runner, test, hooks, sequence) {\n\tif (sequence === \"stack\") hooks = hooks.slice().reverse();\n\tif (!hooks.length) return;\n\tconst context = test.context;\n\tconst onTestFailed = test.context.onTestFailed;\n\tconst onTestFinished = test.context.onTestFinished;\n\tcontext.onTestFailed = () => {\n\t\tthrow new Error(`Cannot call \"onTestFailed\" inside a test hook.`);\n\t};\n\tcontext.onTestFinished = () => {\n\t\tthrow new Error(`Cannot call \"onTestFinished\" inside a test hook.`);\n\t};\n\tif (sequence === \"parallel\") try {\n\t\tawait Promise.all(hooks.map((fn) => limitMaxConcurrency(() => fn(test.context))));\n\t} catch (e) {\n\t\tfailTask(test.result, e, runner.config._diffOptions);\n\t}\n\telse for (const fn of hooks) try {\n\t\tawait limitMaxConcurrency(() => fn(test.context));\n\t} catch (e) {\n\t\tfailTask(test.result, e, runner.config._diffOptions);\n\t}\n\tcontext.onTestFailed = onTestFailed;\n\tcontext.onTestFinished = onTestFinished;\n}\nasync function callSuiteHook(suite, currentTask, name, runner, args) {\n\tconst sequence = runner.config.sequence.hooks;\n\tconst callbacks = [];\n\t// stop at file level\n\tconst parentSuite = \"filepath\" in suite ? null : suite.suite || suite.file;\n\tif (name === \"beforeEach\" && parentSuite) callbacks.push(...await callSuiteHook(parentSuite, currentTask, name, runner, args));\n\tconst hooks = getSuiteHooks(suite, name, sequence);\n\tif (hooks.length > 0) updateSuiteHookState(currentTask, name, \"run\", runner);\n\tasync function runHook(hook) {\n\t\treturn limitMaxConcurrency(async () => {\n\t\t\treturn getBeforeHookCleanupCallback(hook, await hook(...args), name === \"beforeEach\" ? args[0] : void 0);\n\t\t});\n\t}\n\tif (sequence === \"parallel\") callbacks.push(...await Promise.all(hooks.map((hook) => runHook(hook))));\n\telse for (const hook of hooks) callbacks.push(await runHook(hook));\n\tif (hooks.length > 0) updateSuiteHookState(currentTask, name, \"pass\", runner);\n\tif (name === \"afterEach\" && parentSuite) callbacks.push(...await callSuiteHook(parentSuite, currentTask, name, runner, args));\n\treturn callbacks;\n}\nfunction getAroundEachHooks(suite) {\n\tconst hooks = [];\n\tconst parentSuite = \"filepath\" in suite ? null : suite.suite || suite.file;\n\tif (parentSuite) hooks.push(...getAroundEachHooks(parentSuite));\n\thooks.push(...getHooks(suite).aroundEach);\n\treturn hooks;\n}\nfunction getAroundAllHooks(suite) {\n\treturn getHooks(suite).aroundAll;\n}\nfunction makeAroundHookTimeoutError(hookName, phase, timeout, stackTraceError) {\n\tconst message = `The ${phase} phase of \"${hookName}\" hook timed out after ${timeout}ms.`;\n\tconst error = new (phase === \"setup\" ? AroundHookSetupError : AroundHookTeardownError)(message);\n\tif (stackTraceError?.stack) error.stack = stackTraceError.stack.replace(stackTraceError.message, error.message);\n\treturn error;\n}\nasync function callAroundHooks(runInner, options) {\n\tconst { hooks, hookName, callbackName, onTimeout, invokeHook } = options;\n\tif (!hooks.length) {\n\t\tawait runInner();\n\t\treturn;\n\t}\n\tconst hookErrors = [];\n\tconst createTimeoutPromise = (timeout, phase, stackTraceError) => {\n\t\tlet timer;\n\t\tlet timedout = false;\n\t\tconst promise = new Promise((_, reject) => {\n\t\t\tif (timeout > 0 && timeout !== Number.POSITIVE_INFINITY) {\n\t\t\t\ttimer = setTimeout(() => {\n\t\t\t\t\ttimedout = true;\n\t\t\t\t\tconst error = makeAroundHookTimeoutError(hookName, phase, timeout, stackTraceError);\n\t\t\t\t\tonTimeout?.(error);\n\t\t\t\t\treject(error);\n\t\t\t\t}, timeout);\n\t\t\t\ttimer.unref?.();\n\t\t\t}\n\t\t});\n\t\tconst clear = () => {\n\t\t\tif (timer) {\n\t\t\t\tclearTimeout(timer);\n\t\t\t\ttimer = void 0;\n\t\t\t}\n\t\t};\n\t\treturn {\n\t\t\tpromise,\n\t\t\tclear,\n\t\t\tisTimedOut: () => timedout\n\t\t};\n\t};\n\tconst runNextHook = async (index) => {\n\t\tif (index >= hooks.length) return runInner();\n\t\tconst hook = hooks[index];\n\t\tconst timeout = getAroundHookTimeout(hook);\n\t\tconst stackTraceError = getAroundHookStackTrace(hook);\n\t\tlet useCalled = false;\n\t\tlet setupTimeout;\n\t\tlet teardownTimeout;\n\t\tlet setupLimitConcurrencyRelease;\n\t\tlet teardownLimitConcurrencyRelease;\n\t\t// Promise that resolves when use() is called (setup phase complete)\n\t\tlet resolveUseCalled;\n\t\tconst useCalledPromise = new Promise((resolve) => {\n\t\t\tresolveUseCalled = resolve;\n\t\t});\n\t\t// Promise that resolves when use() returns (inner hooks complete, teardown phase starts)\n\t\tlet resolveUseReturned;\n\t\tconst useReturnedPromise = new Promise((resolve) => {\n\t\t\tresolveUseReturned = resolve;\n\t\t});\n\t\t// Promise that resolves when hook completes\n\t\tlet resolveHookComplete;\n\t\tlet rejectHookComplete;\n\t\tconst hookCompletePromise = new Promise((resolve, reject) => {\n\t\t\tresolveHookComplete = resolve;\n\t\t\trejectHookComplete = reject;\n\t\t});\n\t\tconst use = async () => {\n\t\t\t// shouldn't continue to next (runTest/Suite or inner aroundEach/All) when aroundEach/All setup timed out.\n\t\t\tif (setupTimeout.isTimedOut())\n // we can throw any error to bail out.\n\t\t\t// this error is not seen by end users since `runNextHook` already rejected with timeout error\n\t\t\t// and this error is caught by `rejectHookComplete`.\n\t\t\tthrow new Error(\"__VITEST_INTERNAL_AROUND_HOOK_ABORT__\");\n\t\t\tif (useCalled) throw new AroundHookMultipleCallsError(`The \\`${callbackName}\\` callback was called multiple times in the \\`${hookName}\\` hook. The callback can only be called once per hook.`);\n\t\t\tuseCalled = true;\n\t\t\tresolveUseCalled();\n\t\t\t// Setup phase completed - clear setup timer\n\t\t\tsetupTimeout.clear();\n\t\t\tsetupLimitConcurrencyRelease?.();\n\t\t\t// Run inner hooks - don't time this against our teardown timeout\n\t\t\tawait runNextHook(index + 1).catch((e) => hookErrors.push(e));\n\t\t\tteardownLimitConcurrencyRelease = await limitMaxConcurrency.acquire();\n\t\t\t// Start teardown timer after inner hooks complete - only times this hook's teardown code\n\t\t\tteardownTimeout = createTimeoutPromise(timeout, \"teardown\", stackTraceError);\n\t\t\t// Signal that use() is returning (teardown phase starting)\n\t\t\tresolveUseReturned();\n\t\t};\n\t\tsetupLimitConcurrencyRelease = await limitMaxConcurrency.acquire();\n\t\t// Start setup timeout\n\t\tsetupTimeout = createTimeoutPromise(timeout, \"setup\", stackTraceError);\n\t\t(async () => {\n\t\t\ttry {\n\t\t\t\tawait invokeHook(hook, use);\n\t\t\t\tif (!useCalled) throw new AroundHookSetupError(`The \\`${callbackName}\\` callback was not called in the \\`${hookName}\\` hook. Make sure to call \\`${callbackName}\\` to run the ${hookName === \"aroundEach\" ? \"test\" : \"suite\"}.`);\n\t\t\t\tresolveHookComplete();\n\t\t\t} catch (error) {\n\t\t\t\trejectHookComplete(error);\n\t\t\t} finally {\n\t\t\t\tsetupLimitConcurrencyRelease?.();\n\t\t\t\tteardownLimitConcurrencyRelease?.();\n\t\t\t}\n\t\t})();\n\t\t// Wait for either: use() to be called OR hook to complete (error) OR setup timeout\n\t\ttry {\n\t\t\tawait Promise.race([\n\t\t\t\tuseCalledPromise,\n\t\t\t\thookCompletePromise,\n\t\t\t\tsetupTimeout.promise\n\t\t\t]);\n\t\t} finally {\n\t\t\tsetupLimitConcurrencyRelease?.();\n\t\t\tsetupTimeout.clear();\n\t\t}\n\t\t// Wait for use() to return (inner hooks complete) OR hook to complete (error during inner hooks)\n\t\tawait Promise.race([useReturnedPromise, hookCompletePromise]);\n\t\t// Now teardownTimeout is guaranteed to be set\n\t\t// Wait for hook to complete (teardown) OR teardown timeout\n\t\ttry {\n\t\t\tawait Promise.race([hookCompletePromise, teardownTimeout?.promise]);\n\t\t} finally {\n\t\t\tteardownLimitConcurrencyRelease?.();\n\t\t\tteardownTimeout?.clear();\n\t\t}\n\t};\n\tawait runNextHook(0).catch((e) => hookErrors.push(e));\n\tif (hookErrors.length > 0) throw hookErrors;\n}\nasync function callAroundAllHooks(suite, runSuiteInner) {\n\tawait callAroundHooks(runSuiteInner, {\n\t\thooks: getAroundAllHooks(suite),\n\t\thookName: \"aroundAll\",\n\t\tcallbackName: \"runSuite()\",\n\t\tinvokeHook: (hook, use) => hook(use, suite)\n\t});\n}\nasync function callAroundEachHooks(suite, test, runTest) {\n\tawait callAroundHooks(\n\t\t// Take checkpoint right before runTest - at this point all aroundEach fixtures\n\t\t// have been resolved, so we can correctly identify which fixtures belong to\n\t\t// aroundEach (before checkpoint) vs inside runTest (after checkpoint)\n\t\t() => runTest(getFixtureCleanupCount(test.context)),\n\t\t{\n\t\t\thooks: getAroundEachHooks(suite),\n\t\t\thookName: \"aroundEach\",\n\t\t\tcallbackName: \"runTest()\",\n\t\t\tonTimeout: (error) => abortContextSignal(test.context, error),\n\t\t\tinvokeHook: (hook, use) => hook(use, test.context, suite)\n\t\t}\n\t);\n}\nconst packs = /* @__PURE__ */ new Map();\nconst eventsPacks = [];\nconst pendingTasksUpdates = [];\nfunction sendTasksUpdate(runner) {\n\tif (packs.size) {\n\t\tconst taskPacks = Array.from(packs).map(([id, task]) => {\n\t\t\treturn [\n\t\t\t\tid,\n\t\t\t\ttask[0],\n\t\t\t\ttask[1]\n\t\t\t];\n\t\t});\n\t\tconst p = runner.onTaskUpdate?.(taskPacks, eventsPacks);\n\t\tif (p) {\n\t\t\tpendingTasksUpdates.push(p);\n\t\t\t// remove successful promise to not grow array indefinitely,\n\t\t\t// but keep rejections so finishSendTasksUpdate can handle them\n\t\t\tp.then(() => pendingTasksUpdates.splice(pendingTasksUpdates.indexOf(p), 1), () => {});\n\t\t}\n\t\teventsPacks.length = 0;\n\t\tpacks.clear();\n\t}\n}\nasync function finishSendTasksUpdate(runner) {\n\tsendTasksUpdate(runner);\n\tawait Promise.all(pendingTasksUpdates);\n}\nfunction throttle(fn, ms) {\n\tlet last = 0;\n\tlet pendingCall;\n\treturn function call(...args) {\n\t\tconst now = unixNow();\n\t\tif (now - last > ms) {\n\t\t\tlast = now;\n\t\t\tclearTimeout(pendingCall);\n\t\t\tpendingCall = void 0;\n\t\t\treturn fn.apply(this, args);\n\t\t}\n\t\t// Make sure fn is still called even if there are no further calls\n\t\tpendingCall ??= setTimeout(call.bind(this), ms, ...args);\n\t};\n}\n// throttle based on summary reporter's DURATION_UPDATE_INTERVAL_MS\nconst sendTasksUpdateThrottled = throttle(sendTasksUpdate, 100);\nfunction updateTask(event, task, runner) {\n\teventsPacks.push([\n\t\ttask.id,\n\t\tevent,\n\t\tvoid 0\n\t]);\n\tpacks.set(task.id, [task.result, task.meta]);\n\tsendTasksUpdateThrottled(runner);\n}\nasync function callCleanupHooks(runner, cleanups) {\n\tconst sequence = runner.config.sequence.hooks;\n\tif (sequence === \"stack\") cleanups = cleanups.slice().reverse();\n\tif (sequence === \"parallel\") await Promise.all(cleanups.map(async (fn) => {\n\t\tif (typeof fn !== \"function\") return;\n\t\tawait limitMaxConcurrency(() => fn());\n\t}));\n\telse for (const fn of cleanups) {\n\t\tif (typeof fn !== \"function\") continue;\n\t\tawait limitMaxConcurrency(() => fn());\n\t}\n}\n/**\n* Determines if a test should be retried based on its retryCondition configuration\n*/\nfunction passesRetryCondition(test, errors) {\n\tconst condition = getRetryCondition(test.retry);\n\tconst error = errors?.at(-1);\n\tif (error == null) return false;\n\tif (!condition) return true;\n\tif (condition instanceof RegExp) return condition.test(error.message || \"\");\n\telse if (typeof condition === \"function\") return condition(error);\n\treturn false;\n}\nasync function runTest(test, runner) {\n\tawait runner.onBeforeRunTask?.(test);\n\tif (test.mode !== \"run\" && test.mode !== \"queued\") {\n\t\tupdateTask(\"test-prepare\", test, runner);\n\t\tupdateTask(\"test-finished\", test, runner);\n\t\treturn;\n\t}\n\tif (test.result?.state === \"fail\") {\n\t\t// should not be possible to get here, I think this is just copy pasted from suite\n\t\t// TODO: maybe someone fails tests in `beforeAll` hooks?\n\t\t// https://github.com/vitest-dev/vitest/pull/7069\n\t\tupdateTask(\"test-failed-early\", test, runner);\n\t\treturn;\n\t}\n\tconst start = now();\n\ttest.result = {\n\t\tstate: \"run\",\n\t\tstartTime: unixNow(),\n\t\tretryCount: 0\n\t};\n\tupdateTask(\"test-prepare\", test, runner);\n\tconst cleanupRunningTest = addRunningTest(test);\n\tsetCurrentTest(test);\n\tconst suite = test.suite || test.file;\n\tconst $ = runner.trace;\n\tconst repeats = test.repeats ?? 0;\n\tfor (let repeatCount = 0; repeatCount <= repeats; repeatCount++) {\n\t\tconst retry = getRetryCount(test.retry);\n\t\tfor (let retryCount = 0; retryCount <= retry; retryCount++) {\n\t\t\tlet beforeEachCleanups = [];\n\t\t\t// fixtureCheckpoint is passed by callAroundEachHooks - it represents the count\n\t\t\t// of fixture cleanup functions AFTER all aroundEach fixtures have been resolved\n\t\t\t// but BEFORE the test runs. This allows us to clean up only fixtures created\n\t\t\t// inside runTest while preserving aroundEach fixtures for teardown.\n\t\t\tawait callAroundEachHooks(suite, test, async (fixtureCheckpoint) => {\n\t\t\t\ttry {\n\t\t\t\t\tawait runner.onBeforeTryTask?.(test, {\n\t\t\t\t\t\tretry: retryCount,\n\t\t\t\t\t\trepeats: repeatCount\n\t\t\t\t\t});\n\t\t\t\t\ttest.result.repeatCount = repeatCount;\n\t\t\t\t\tbeforeEachCleanups = await $(\"test.beforeEach\", () => callSuiteHook(suite, test, \"beforeEach\", runner, [test.context, suite]));\n\t\t\t\t\tif (runner.runTask) await $(\"test.callback\", () => limitMaxConcurrency(() => runner.runTask(test)));\n\t\t\t\t\telse {\n\t\t\t\t\t\tconst fn = getFn(test);\n\t\t\t\t\t\tif (!fn) throw new Error(\"Test function is not found. Did you add it using `setFn`?\");\n\t\t\t\t\t\tawait $(\"test.callback\", () => limitMaxConcurrency(() => fn()));\n\t\t\t\t\t}\n\t\t\t\t\tawait runner.onAfterTryTask?.(test, {\n\t\t\t\t\t\tretry: retryCount,\n\t\t\t\t\t\trepeats: repeatCount\n\t\t\t\t\t});\n\t\t\t\t\tif (test.result.state !== \"fail\") test.result.state = \"pass\";\n\t\t\t\t} catch (e) {\n\t\t\t\t\tfailTask(test.result, e, runner.config._diffOptions);\n\t\t\t\t}\n\t\t\t\ttry {\n\t\t\t\t\tawait runner.onTaskFinished?.(test);\n\t\t\t\t} catch (e) {\n\t\t\t\t\tfailTask(test.result, e, runner.config._diffOptions);\n\t\t\t\t}\n\t\t\t\ttry {\n\t\t\t\t\tawait $(\"test.afterEach\", () => callSuiteHook(suite, test, \"afterEach\", runner, [test.context, suite]));\n\t\t\t\t\tif (beforeEachCleanups.length) await $(\"test.cleanup\", () => callCleanupHooks(runner, beforeEachCleanups));\n\t\t\t\t\t// Only clean up fixtures created inside runTest (after the checkpoint)\n\t\t\t\t\t// Fixtures created for aroundEach will be cleaned up after aroundEach teardown\n\t\t\t\t\tawait callFixtureCleanupFrom(test.context, fixtureCheckpoint);\n\t\t\t\t} catch (e) {\n\t\t\t\t\tfailTask(test.result, e, runner.config._diffOptions);\n\t\t\t\t}\n\t\t\t\tif (test.onFinished?.length) await $(\"test.onFinished\", () => callTestHooks(runner, test, test.onFinished, \"stack\"));\n\t\t\t\tif (test.result.state === \"fail\" && test.onFailed?.length) await $(\"test.onFailed\", () => callTestHooks(runner, test, test.onFailed, runner.config.sequence.hooks));\n\t\t\t\ttest.onFailed = void 0;\n\t\t\t\ttest.onFinished = void 0;\n\t\t\t\tawait runner.onAfterRetryTask?.(test, {\n\t\t\t\t\tretry: retryCount,\n\t\t\t\t\trepeats: repeatCount\n\t\t\t\t});\n\t\t\t}).catch((error) => {\n\t\t\t\tfailTask(test.result, error, runner.config._diffOptions);\n\t\t\t});\n\t\t\t// Clean up fixtures that were created for aroundEach (before the checkpoint)\n\t\t\t// This runs after aroundEach teardown has completed\n\t\t\ttry {\n\t\t\t\tawait callFixtureCleanup(test.context);\n\t\t\t} catch (e) {\n\t\t\t\tfailTask(test.result, e, runner.config._diffOptions);\n\t\t\t}\n\t\t\t// skipped with new PendingError\n\t\t\tif (test.result?.pending || test.result?.state === \"skip\") {\n\t\t\t\ttest.mode = \"skip\";\n\t\t\t\ttest.result = {\n\t\t\t\t\tstate: \"skip\",\n\t\t\t\t\tnote: test.result?.note,\n\t\t\t\t\tpending: true,\n\t\t\t\t\tduration: now() - start\n\t\t\t\t};\n\t\t\t\tupdateTask(\"test-finished\", test, runner);\n\t\t\t\tsetCurrentTest(void 0);\n\t\t\t\tcleanupRunningTest();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (test.result.state === \"pass\") break;\n\t\t\tif (retryCount < retry) {\n\t\t\t\tif (!passesRetryCondition(test, test.result.errors)) break;\n\t\t\t\ttest.result.state = \"run\";\n\t\t\t\ttest.result.retryCount = (test.result.retryCount ?? 0) + 1;\n\t\t\t\tconst delay = getRetryDelay(test.retry);\n\t\t\t\tif (delay > 0) await new Promise((resolve) => setTimeout(resolve, delay));\n\t\t\t}\n\t\t\t// update retry info\n\t\t\tupdateTask(\"test-retried\", test, runner);\n\t\t}\n\t}\n\t// if test is marked to be failed, flip the result unless `TestSyntaxError` is present\n\tif (test.fails) {\n\t\tif (test.result.state === \"pass\") {\n\t\t\tconst error = processError(/* @__PURE__ */ new Error(\"Expect test to fail\"));\n\t\t\ttest.result.state = \"fail\";\n\t\t\ttest.result.errors = [error];\n\t\t} else if (!test.result.errors?.some((e) => e.__vitest_test_syntax_error__)) {\n\t\t\ttest.result.state = \"pass\";\n\t\t\ttest.result.errors = void 0;\n\t\t}\n\t}\n\tcleanupRunningTest();\n\tsetCurrentTest(void 0);\n\ttest.result.duration = now() - start;\n\tawait runner.onAfterRunTask?.(test);\n\tupdateTask(\"test-finished\", test, runner);\n}\nfunction failTask(result, err, diffOptions) {\n\tif (err instanceof PendingError) {\n\t\tresult.state = \"skip\";\n\t\tresult.note = err.note;\n\t\tresult.pending = true;\n\t\treturn;\n\t}\n\tif (err instanceof TestRunAbortError) {\n\t\tresult.state = \"skip\";\n\t\tresult.note = err.message;\n\t\treturn;\n\t}\n\tresult.state = \"fail\";\n\tconst errors = Array.isArray(err) ? err : [err];\n\tfor (const e of errors) {\n\t\tconst errors = e instanceof AggregateError ? e.errors.map((e) => processError(e, diffOptions)) : [processError(e, diffOptions)];\n\t\tresult.errors ??= [];\n\t\tresult.errors.push(...errors);\n\t}\n}\nfunction markTasksAsSkipped(suite, runner) {\n\tsuite.tasks.forEach((t) => {\n\t\tt.mode = \"skip\";\n\t\tt.result = {\n\t\t\t...t.result,\n\t\t\tstate: \"skip\"\n\t\t};\n\t\tupdateTask(\"test-finished\", t, runner);\n\t\tif (t.type === \"suite\") markTasksAsSkipped(t, runner);\n\t});\n}\nfunction markPendingTasksAsSkipped(suite, runner, note) {\n\tsuite.tasks.forEach((t) => {\n\t\tif (!t.result || t.result.state === \"run\") {\n\t\t\tt.mode = \"skip\";\n\t\t\tt.result = {\n\t\t\t\t...t.result,\n\t\t\t\tstate: \"skip\",\n\t\t\t\tnote\n\t\t\t};\n\t\t\tupdateTask(\"test-cancel\", t, runner);\n\t\t}\n\t\tif (t.type === \"suite\") markPendingTasksAsSkipped(t, runner, note);\n\t});\n}\nasync function runSuite(suite, runner) {\n\tawait runner.onBeforeRunSuite?.(suite);\n\tif (suite.result?.state === \"fail\") {\n\t\tmarkTasksAsSkipped(suite, runner);\n\t\t// failed during collection\n\t\tupdateTask(\"suite-failed-early\", suite, runner);\n\t\treturn;\n\t}\n\tconst start = now();\n\tconst mode = suite.mode;\n\tsuite.result = {\n\t\tstate: mode === \"skip\" || mode === \"todo\" ? mode : \"run\",\n\t\tstartTime: unixNow()\n\t};\n\tconst $ = runner.trace;\n\tupdateTask(\"suite-prepare\", suite, runner);\n\tlet beforeAllCleanups = [];\n\tif (suite.mode === \"skip\") {\n\t\tsuite.result.state = \"skip\";\n\t\tupdateTask(\"suite-finished\", suite, runner);\n\t} else if (suite.mode === \"todo\") {\n\t\tsuite.result.state = \"todo\";\n\t\tupdateTask(\"suite-finished\", suite, runner);\n\t} else {\n\t\tlet suiteRan = false;\n\t\ttry {\n\t\t\tawait callAroundAllHooks(suite, async () => {\n\t\t\t\tsuiteRan = true;\n\t\t\t\ttry {\n\t\t\t\t\t// beforeAll\n\t\t\t\t\ttry {\n\t\t\t\t\t\tbeforeAllCleanups = await $(\"suite.beforeAll\", () => callSuiteHook(suite, suite, \"beforeAll\", runner, [suite]));\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\tfailTask(suite.result, e, runner.config._diffOptions);\n\t\t\t\t\t\tmarkTasksAsSkipped(suite, runner);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\t// run suite children\n\t\t\t\t\tif (runner.runSuite) await runner.runSuite(suite);\n\t\t\t\t\telse for (let tasksGroup of partitionSuiteChildren(suite)) if (tasksGroup[0].concurrent === true) {\n\t\t\t\t\t\tconst groupLimiter = limitConcurrency(runner.config.maxConcurrency);\n\t\t\t\t\t\tawait Promise.all(tasksGroup.map((c) => groupLimiter(() => runSuiteChild(c, runner))));\n\t\t\t\t\t} else {\n\t\t\t\t\t\tconst { sequence } = runner.config;\n\t\t\t\t\t\tif (suite.shuffle) {\n\t\t\t\t\t\t\t// run describe block independently from tests\n\t\t\t\t\t\t\tconst suites = tasksGroup.filter((group) => group.type === \"suite\");\n\t\t\t\t\t\t\tconst tests = tasksGroup.filter((group) => group.type === \"test\");\n\t\t\t\t\t\t\ttasksGroup = shuffle([suites, tests], sequence.seed).flatMap((group) => shuffle(group, sequence.seed));\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor (const c of tasksGroup) await runSuiteChild(c, runner);\n\t\t\t\t\t}\n\t\t\t\t} finally {\n\t\t\t\t\t// afterAll runs even if beforeAll or suite children fail\n\t\t\t\t\ttry {\n\t\t\t\t\t\tawait $(\"suite.afterAll\", () => callSuiteHook(suite, suite, \"afterAll\", runner, [suite]));\n\t\t\t\t\t\tif (beforeAllCleanups.length) await $(\"suite.cleanup\", () => callCleanupHooks(runner, beforeAllCleanups));\n\t\t\t\t\t\tif (suite.file === suite) {\n\t\t\t\t\t\t\tconst contexts = TestFixtures.getFileContexts(suite.file);\n\t\t\t\t\t\t\tawait Promise.all(contexts.map((context) => callFixtureCleanup(context)));\n\t\t\t\t\t\t}\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\tfailTask(suite.result, e, runner.config._diffOptions);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\t} catch (e) {\n\t\t\t// mark tasks as skipped if aroundAll failed before the suite callback was executed\n\t\t\tif (!suiteRan) markTasksAsSkipped(suite, runner);\n\t\t\tfailTask(suite.result, e, runner.config._diffOptions);\n\t\t}\n\t\tif (suite.mode === \"run\" || suite.mode === \"queued\") if (!runner.config.passWithNoTests && !suite.containsTest) {\n\t\t\tsuite.result.state = \"fail\";\n\t\t\tif (!suite.result.errors?.length) {\n\t\t\t\tconst error = processError(/* @__PURE__ */ new Error(`No test found in suite ${suite.name}`));\n\t\t\t\tsuite.result.errors = [error];\n\t\t\t}\n\t\t} else if (hasFailed(suite)) suite.result.state = \"fail\";\n\t\telse suite.result.state = \"pass\";\n\t\tsuite.result.duration = now() - start;\n\t\tawait runner.onAfterRunSuite?.(suite);\n\t\tupdateTask(\"suite-finished\", suite, runner);\n\t}\n}\nasync function runSuiteChild(c, runner) {\n\tconst $ = runner.trace;\n\tif (c.type === \"test\") return $(\"run.test\", {\n\t\t\"vitest.test.id\": c.id,\n\t\t\"vitest.test.name\": c.name,\n\t\t\"vitest.test.mode\": c.mode,\n\t\t\"vitest.test.timeout\": c.timeout,\n\t\t\"code.file.path\": c.file.filepath,\n\t\t\"code.line.number\": c.location?.line,\n\t\t\"code.column.number\": c.location?.column\n\t}, () => limitTestConcurrency(() => runTest(c, runner)));\n\telse if (c.type === \"suite\") return $(\"run.suite\", {\n\t\t\"vitest.suite.id\": c.id,\n\t\t\"vitest.suite.name\": c.name,\n\t\t\"vitest.suite.mode\": c.mode,\n\t\t\"code.file.path\": c.file.filepath,\n\t\t\"code.line.number\": c.location?.line,\n\t\t\"code.column.number\": c.location?.column\n\t}, () => runSuite(c, runner));\n}\nasync function runFiles(files, runner) {\n\tlimitMaxConcurrency ??= limitConcurrency(runner.config.maxConcurrency);\n\tlimitTestConcurrency ??= limitConcurrency(runner.config.maxConcurrency);\n\tfor (const file of files) {\n\t\tif (!file.tasks.length && !runner.config.passWithNoTests) {\n\t\t\tif (!file.result?.errors?.length) file.result = {\n\t\t\t\tstate: \"fail\",\n\t\t\t\terrors: [processError(/* @__PURE__ */ new Error(`No test suite found in file ${file.filepath}`))]\n\t\t\t};\n\t\t}\n\t\tawait runner.trace(\"run.spec\", {\n\t\t\t\"code.file.path\": file.filepath,\n\t\t\t\"vitest.suite.tasks.length\": file.tasks.length\n\t\t}, () => runSuite(file, runner));\n\t}\n}\nconst workerRunners = /* @__PURE__ */ new WeakSet();\nfunction defaultTrace(_, attributes, cb) {\n\tif (typeof attributes === \"function\") return attributes();\n\treturn cb();\n}\nasync function startTests(specs, runner) {\n\trunner.trace ??= defaultTrace;\n\tconst cancel = runner.cancel?.bind(runner);\n\t// Ideally, we need to have an event listener for this, but only have a runner here.\n\t// Adding another onCancel felt wrong (maybe it needs to be refactored)\n\trunner.cancel = (reason) => {\n\t\t// We intentionally create only one error since there is only one test run that can be cancelled\n\t\tconst error = new TestRunAbortError(\"The test run was aborted by the user.\", reason);\n\t\tgetRunningTests().forEach((test) => {\n\t\t\tabortContextSignal(test.context, error);\n\t\t\tmarkPendingTasksAsSkipped(test.file, runner, error.message);\n\t\t});\n\t\treturn cancel?.(reason);\n\t};\n\tif (!workerRunners.has(runner)) {\n\t\trunner.onCleanupWorkerContext?.(async () => {\n\t\t\tawait Promise.all(Array.from(TestFixtures.getWorkerContexts(), (context) => callFixtureCleanup(context))).finally(() => {\n\t\t\t\tTestFixtures.clearDefinitions();\n\t\t\t});\n\t\t});\n\t\tworkerRunners.add(runner);\n\t}\n\ttry {\n\t\tconst paths = specs.map((f) => typeof f === \"string\" ? f : f.filepath);\n\t\tawait runner.onBeforeCollect?.(paths);\n\t\tconst files = await collectTests(specs, runner);\n\t\tawait runner.onCollected?.(files);\n\t\tawait runner.onBeforeRunFiles?.(files);\n\t\tawait runFiles(files, runner);\n\t\tawait runner.onAfterRunFiles?.(files);\n\t\tawait finishSendTasksUpdate(runner);\n\t\treturn files;\n\t} finally {\n\t\trunner.cancel = cancel;\n\t}\n}\nasync function publicCollect(specs, runner) {\n\trunner.trace ??= defaultTrace;\n\tconst paths = specs.map((f) => typeof f === \"string\" ? f : f.filepath);\n\tawait runner.onBeforeCollect?.(paths);\n\tconst files = await collectTests(specs, runner);\n\tawait runner.onCollected?.(files);\n\treturn files;\n}\n\nexport { limitConcurrency as A, shuffle as B, createTagsFilter as C, TestSyntaxError as T, processError as a, printDiffOrStringify as b, createTaskCollector as c, diff as d, getCurrentSuite as e, createChainable as f, getCurrentTest as g, getHooks as h, getFn as i, afterAll as j, afterEach as k, aroundAll as l, matchesTags as m, aroundEach as n, beforeAll as o, publicCollect as p, beforeEach as q, describe as r, startTests as s, it as t, onTestFailed as u, onTestFinished as v, recordArtifact as w, suite as x, test as y, validateTags as z };\n","const NAME_WORKER_STATE = \"__vitest_worker__\";\nclass EnvironmentTeardownError extends Error {\n\tname = \"EnvironmentTeardownError\";\n}\nfunction getWorkerState() {\n\t// @ts-expect-error untyped global\n\tconst workerState = globalThis[NAME_WORKER_STATE];\n\tif (!workerState) throw new Error(\"Vitest failed to access its internal state.\\n\\nOne of the following is possible:\\n- \\\"vitest\\\" is imported directly without running \\\"vitest\\\" command\\n- \\\"vitest\\\" is imported inside \\\"globalSetup\\\" (to fix this, use \\\"setupFiles\\\" instead, because \\\"globalSetup\\\" runs in a different context)\\n- \\\"vitest\\\" is imported inside Vite / Vitest config file\\n- Otherwise, it might be a Vitest bug. Please report it to https://github.com/vitest-dev/vitest/issues\\n\");\n\treturn workerState;\n}\nfunction getSafeWorkerState() {\n\t// @ts-expect-error untyped global\n\treturn globalThis[NAME_WORKER_STATE];\n}\nfunction provideWorkerState(context, state) {\n\tObject.defineProperty(context, NAME_WORKER_STATE, {\n\t\tvalue: state,\n\t\tconfigurable: true,\n\t\twritable: true,\n\t\tenumerable: false\n\t});\n\treturn state;\n}\nfunction isChildProcess() {\n\treturn typeof process !== \"undefined\" && !!process.send;\n}\nfunction resetModules(modules, resetMocks = false) {\n\tconst skipPaths = [\n\t\t/\\/vitest\\/dist\\//,\n\t\t/vitest-virtual-\\w+\\/dist/,\n\t\t/@vitest\\/dist/,\n\t\t...!resetMocks ? [/^mock:/] : []\n\t];\n\tmodules.idToModuleMap.forEach((node, path) => {\n\t\tif (skipPaths.some((re) => re.test(path))) return;\n\t\tnode.promise = void 0;\n\t\tnode.exports = void 0;\n\t\tnode.evaluated = false;\n\t\tnode.importers.clear();\n\t});\n}\n\nexport { EnvironmentTeardownError as E, getSafeWorkerState as a, getWorkerState as g, isChildProcess as i, provideWorkerState as p, resetModules as r };\n","function isMockFunction(fn) {\n\treturn typeof fn === \"function\" && \"_isMockFunction\" in fn && fn._isMockFunction === true;\n}\nconst MOCK_RESTORE = /* @__PURE__ */ new Set();\n// Jest keeps the state in a separate WeakMap which is good for memory,\n// but it makes the state slower to access and return different values\n// if you stored it before calling `mockClear` where it will be recreated\nconst DIRTY_MOCK_STATES = /* @__PURE__ */ new Set();\nconst addDirtyMock = DIRTY_MOCK_STATES.add.bind(DIRTY_MOCK_STATES);\nconst REGISTERED_MOCKS = /* @__PURE__ */ new Set();\nconst MOCK_FINALIZER = new FinalizationRegistry((ref) => {\n\tREGISTERED_MOCKS.delete(ref);\n});\nconst MOCK_CONFIGS = /* @__PURE__ */ new WeakMap();\nconst MOCKS_BY_STATE = /* @__PURE__ */ new WeakMap();\nfunction createMockInstance(options = {}) {\n\tconst { originalImplementation, restore, mockImplementation, resetToMockImplementation, resetToMockName } = options;\n\tif (restore) MOCK_RESTORE.add(restore);\n\tconst config = getDefaultConfig(originalImplementation);\n\tconst state = getDefaultState();\n\tconst mock = createMock({\n\t\tconfig,\n\t\tstate,\n\t\t...options\n\t});\n\tconst mockLength = (mockImplementation || originalImplementation)?.length ?? 0;\n\tObject.defineProperty(mock, \"length\", {\n\t\twritable: true,\n\t\tenumerable: false,\n\t\tvalue: mockLength,\n\t\tconfigurable: true\n\t});\n\t// inherit the default name so it appears in snapshots and logs\n\t// this is used by `vi.spyOn()` for better debugging.\n\t// when `vi.fn()` is called, we just use the default string\n\tif (resetToMockName) config.mockName = mock.name || \"vi.fn()\";\n\tMOCK_CONFIGS.set(mock, config);\n\tMOCKS_BY_STATE.set(state, mock);\n\tconst ref = new WeakRef(mock);\n\tREGISTERED_MOCKS.add(ref);\n\tMOCK_FINALIZER.register(mock, ref);\n\tmock._isMockFunction = true;\n\tmock.getMockImplementation = () => {\n\t\t// Jest only returns `config.mockImplementation` here,\n\t\t// but we think it makes sense to return what the next function will be called\n\t\treturn config.onceMockImplementations[0] || config.mockImplementation;\n\t};\n\t// keep the prototype chain in sync with the implementation the next\n\t// construction will use, so it is correct before any `new` call.\n\t// automocked classes are skipped: their methods are pre-mocked\n\t// on `mock.prototype`\n\tconst updateMockPrototype = () => {\n\t\tif (!options.prototypeMembers?.length) reparentMockPrototype(mock, config.onceMockImplementations[0] || config.mockImplementation || originalImplementation);\n\t};\n\tObject.defineProperty(mock, \"mock\", {\n\t\tconfigurable: false,\n\t\tenumerable: true,\n\t\twritable: false,\n\t\tvalue: state\n\t});\n\tmock.mockImplementation = function mockImplementation(implementation) {\n\t\tconfig.mockImplementation = implementation;\n\t\tupdateMockPrototype();\n\t\treturn mock;\n\t};\n\tmock.mockImplementationOnce = function mockImplementationOnce(implementation) {\n\t\tconfig.onceMockImplementations.push(implementation);\n\t\tupdateMockPrototype();\n\t\treturn mock;\n\t};\n\tmock.withImplementation = function withImplementation(implementation, callback) {\n\t\tconst previousImplementation = config.mockImplementation;\n\t\tconst previousOnceImplementations = config.onceMockImplementations;\n\t\tconst reset = () => {\n\t\t\tconfig.mockImplementation = previousImplementation;\n\t\t\tconfig.onceMockImplementations = previousOnceImplementations;\n\t\t\tupdateMockPrototype();\n\t\t};\n\t\tconfig.mockImplementation = implementation;\n\t\tconfig.onceMockImplementations = [];\n\t\tupdateMockPrototype();\n\t\tconst returnValue = callback();\n\t\tif (typeof returnValue === \"object\" && typeof returnValue?.then === \"function\") return returnValue.then(() => {\n\t\t\treset();\n\t\t\treturn mock;\n\t\t});\n\t\telse reset();\n\t\treturn mock;\n\t};\n\tmock.mockReturnThis = function mockReturnThis() {\n\t\treturn mock.mockImplementation(function() {\n\t\t\treturn this;\n\t\t});\n\t};\n\tmock.mockReturnValue = function mockReturnValue(value) {\n\t\treturn mock.mockImplementation(function() {\n\t\t\tif (new.target) throwConstructorError(\"mockReturnValue\");\n\t\t\treturn value;\n\t\t});\n\t};\n\tmock.mockReturnValueOnce = function mockReturnValueOnce(value) {\n\t\treturn mock.mockImplementationOnce(function() {\n\t\t\tif (new.target) throwConstructorError(\"mockReturnValueOnce\");\n\t\t\treturn value;\n\t\t});\n\t};\n\tmock.mockThrow = function mockThrow(value) {\n\t\t// eslint-disable-next-line prefer-arrow-callback\n\t\treturn mock.mockImplementation(function() {\n\t\t\tthrow value;\n\t\t});\n\t};\n\tmock.mockThrowOnce = function mockThrowOnce(value) {\n\t\t// eslint-disable-next-line prefer-arrow-callback\n\t\treturn mock.mockImplementationOnce(function() {\n\t\t\tthrow value;\n\t\t});\n\t};\n\tmock.mockResolvedValue = function mockResolvedValue(value) {\n\t\treturn mock.mockImplementation(function() {\n\t\t\tif (new.target) throwConstructorError(\"mockResolvedValue\");\n\t\t\treturn Promise.resolve(value);\n\t\t});\n\t};\n\tmock.mockResolvedValueOnce = function mockResolvedValueOnce(value) {\n\t\treturn mock.mockImplementationOnce(function() {\n\t\t\tif (new.target) throwConstructorError(\"mockResolvedValueOnce\");\n\t\t\treturn Promise.resolve(value);\n\t\t});\n\t};\n\tmock.mockRejectedValue = function mockRejectedValue(value) {\n\t\treturn mock.mockImplementation(function() {\n\t\t\tif (new.target) throwConstructorError(\"mockRejectedValue\");\n\t\t\treturn Promise.reject(value);\n\t\t});\n\t};\n\tmock.mockRejectedValueOnce = function mockRejectedValueOnce(value) {\n\t\treturn mock.mockImplementationOnce(function() {\n\t\t\tif (new.target) throwConstructorError(\"mockRejectedValueOnce\");\n\t\t\treturn Promise.reject(value);\n\t\t});\n\t};\n\tmock.mockClear = function mockClear() {\n\t\tstate.calls = [];\n\t\tstate.contexts = [];\n\t\tstate.instances = [];\n\t\tstate.invocationCallOrder = [];\n\t\tstate.results = [];\n\t\tstate.settledResults = [];\n\t\tDIRTY_MOCK_STATES.delete(mock);\n\t\treturn mock;\n\t};\n\tmock.mockReset = function mockReset() {\n\t\tmock.mockClear();\n\t\tconfig.mockImplementation = resetToMockImplementation ? mockImplementation : void 0;\n\t\tconfig.mockName = resetToMockName ? mock.name || \"vi.fn()\" : \"vi.fn()\";\n\t\tconfig.onceMockImplementations = [];\n\t\tupdateMockPrototype();\n\t\treturn mock;\n\t};\n\tmock.mockRestore = function mockRestore() {\n\t\tmock.mockReset();\n\t\treturn restore?.();\n\t};\n\tmock.mockName = function mockName(name) {\n\t\tif (typeof name === \"string\") config.mockName = name;\n\t\treturn mock;\n\t};\n\tmock.getMockName = function getMockName() {\n\t\treturn config.mockName || \"vi.fn()\";\n\t};\n\tif (Symbol.dispose) mock[Symbol.dispose] = () => mock.mockRestore();\n\tif (mockImplementation) mock.mockImplementation(mockImplementation);\n\telse\n // vi.spyOn() has no mock implementation, chain the original one\n\tupdateMockPrototype();\n\treturn mock;\n}\nfunction fn(originalImplementation) {\n\t// if the function is already a mock, just return the same function,\n\t// similarly to how vi.spyOn() works\n\tif (originalImplementation != null && isMockFunction(originalImplementation)) return originalImplementation;\n\treturn createMockInstance({\n\t\t// we pass this down so getMockImplementation() always returns the value\n\t\tmockImplementation: originalImplementation,\n\t\t// special case so that .mockReset() resets the value to\n\t\t// the the originalImplementation instead of () => undefined\n\t\tresetToMockImplementation: true\n\t});\n}\nfunction spyOn(object, key, accessor) {\n\tassert(object != null, \"The vi.spyOn() function could not find an object to spy upon. The first argument must be defined.\");\n\tassert(typeof object === \"object\" || typeof object === \"function\", \"Vitest cannot spy on a primitive value.\");\n\tconst [originalDescriptorObject, originalDescriptor] = getDescriptor(object, key) || [];\n\tassert(originalDescriptor || key in object, `The property \"${String(key)}\" is not defined on the ${typeof object}.`);\n\tlet accessType = accessor || \"value\";\n\tlet ssr = false;\n\t// vite ssr support - actual function is stored inside a getter\n\tif (accessType === \"value\" && originalDescriptor && originalDescriptor.value == null && originalDescriptor.get) {\n\t\taccessType = \"get\";\n\t\tssr = true;\n\t}\n\tlet original;\n\tif (originalDescriptor) {\n\t\toriginal = originalDescriptor[accessType];\n\t\t// weird Proxy edge case where descriptor's value is undefined,\n\t\t// but there's still a value on the object when called\n\t\t// https://github.com/vitest-dev/vitest/issues/9439\n\t\tif (original == null && accessType === \"value\") original = object[key];\n\t} else if (accessType !== \"value\") original = () => object[key];\n\telse original = object[key];\n\tconst originalImplementation = ssr && original ? original() : original;\n\tconst originalType = typeof originalImplementation;\n\tassert(\n\t\t// allow only functions\n\t\toriginalType === \"function\" || accessType !== \"value\" && original == null,\n\t\t`vi.spyOn() can only spy on a function. Received ${originalType}.`\n\t);\n\tif (isMockFunction(originalImplementation)) return originalImplementation;\n\tconst reassign = (cb) => {\n\t\tconst { value, ...desc } = originalDescriptor || {\n\t\t\tconfigurable: true,\n\t\t\twritable: true\n\t\t};\n\t\tif (accessType !== \"value\") delete desc.writable;\n\t\tdesc[accessType] = cb;\n\t\tObject.defineProperty(object, key, desc);\n\t};\n\tconst restore = () => {\n\t\t// if method is defined on the prototype, we can just remove it from\n\t\t// the current object instead of redefining a copy of it\n\t\tif (originalDescriptorObject !== object) Reflect.deleteProperty(object, key);\n\t\telse if (originalDescriptor && !original) Object.defineProperty(object, key, originalDescriptor);\n\t\telse reassign(original);\n\t};\n\tconst mock = createMockInstance({\n\t\trestore,\n\t\toriginalImplementation,\n\t\tresetToMockName: true\n\t});\n\ttry {\n\t\treassign(ssr ? () => mock : mock);\n\t} catch (error) {\n\t\tif (error instanceof TypeError && Symbol.toStringTag && object[Symbol.toStringTag] === \"Module\" && (error.message.includes(\"Cannot redefine property\") || error.message.includes(\"Cannot replace module namespace\") || error.message.includes(\"can't redefine non-configurable property\"))) throw new TypeError(`Cannot spy on export \"${String(key)}\". Module namespace is not configurable in ESM. See: https://vitest.dev/guide/mocking/modules#mocking-a-module`, { cause: error });\n\t\tthrow error;\n\t}\n\treturn mock;\n}\nfunction getDescriptor(obj, method) {\n\tconst objDescriptor = Object.getOwnPropertyDescriptor(obj, method);\n\tif (objDescriptor) return [obj, objDescriptor];\n\tlet currentProto = Object.getPrototypeOf(obj);\n\twhile (currentProto !== null) {\n\t\tconst descriptor = Object.getOwnPropertyDescriptor(currentProto, method);\n\t\tif (descriptor) return [currentProto, descriptor];\n\t\tcurrentProto = Object.getPrototypeOf(currentProto);\n\t}\n}\nfunction assert(condition, message) {\n\tif (!condition) throw new Error(message);\n}\nlet invocationCallCounter = 1;\nfunction createMock({ state, config, name: mockName, prototypeState, prototypeConfig, keepMembersImplementation, mockImplementation, prototypeMembers = [] }) {\n\tconst original = config.mockOriginal;\n\tconst pseudoOriginal = mockImplementation;\n\tconst name = mockName || original?.name || \"Mock\";\n\tconst noopImplementation = function() {};\n\tconst prototypeMock = prototypeState && MOCKS_BY_STATE.get(prototypeState);\n\tconst namedObject = { \n\t// to keep the name of the function intact\n[name]: (function(...args) {\n\t\taddDirtyMock(namedObject[name]);\n\t\tif (prototypeMock) addDirtyMock(prototypeMock);\n\t\tregisterCalls(args, state, prototypeState);\n\t\tregisterInvocationOrder(invocationCallCounter++, state, prototypeState);\n\t\tconst result = {\n\t\t\ttype: \"incomplete\",\n\t\t\tvalue: void 0\n\t\t};\n\t\tconst settledResult = {\n\t\t\ttype: \"incomplete\",\n\t\t\tvalue: void 0\n\t\t};\n\t\tregisterResult(result, state, prototypeState);\n\t\tregisterSettledResult(settledResult, state, prototypeState);\n\t\tconst context = new.target ? void 0 : this;\n\t\tconst [instanceIndex, instancePrototypeIndex] = registerInstance(context, state, prototypeState);\n\t\tconst [contextIndex, contextPrototypeIndex] = registerContext(context, state, prototypeState);\n\t\tconst implementation = config.onceMockImplementations.shift() || config.mockImplementation || prototypeConfig?.onceMockImplementations.shift() || prototypeConfig?.mockImplementation || original || noopImplementation;\n\t\tlet returnValue;\n\t\tlet thrownValue;\n\t\tlet didThrow = false;\n\t\ttry {\n\t\t\tif (new.target) {\n\t\t\t\t// the prototype chain is already prepared when the implementation\n\t\t\t\t// is registered, but a consumed `mockImplementationOnce` can change\n\t\t\t\t// which implementation this construction uses\n\t\t\t\tif (prototypeMembers.length === 0)\n // eslint-disable-next-line ts/no-use-before-define\n\t\t\t\treparentMockPrototype(mock, implementation === noopImplementation ? void 0 : implementation);\n\t\t\t\treturnValue = Reflect.construct(implementation, args, new.target);\n\t\t\t\t// jest calls this before the implementation, but we have to resolve this _after_\n\t\t\t\t// because we cannot do it before the `Reflect.construct` called the custom implementation.\n\t\t\t\t// fortunately, the constructor is always an empty function because `prototypeMethods`\n\t\t\t\t// are only used by the automocker, so this doesn't matter\n\t\t\t\tfor (const prop of prototypeMembers) {\n\t\t\t\t\tconst prototypeMock = returnValue[prop];\n\t\t\t\t\t// the method was overridden because of inheritance, ignore it\n\t\t\t\t\t// eslint-disable-next-line ts/no-use-before-define\n\t\t\t\t\tif (prototypeMock !== mock.prototype[prop]) continue;\n\t\t\t\t\tconst isMock = isMockFunction(prototypeMock);\n\t\t\t\t\tconst prototypeState = isMock ? prototypeMock.mock : void 0;\n\t\t\t\t\tconst prototypeConfig = isMock ? MOCK_CONFIGS.get(prototypeMock) : void 0;\n\t\t\t\t\treturnValue[prop] = createMockInstance({\n\t\t\t\t\t\toriginalImplementation: keepMembersImplementation ? prototypeConfig?.mockOriginal : void 0,\n\t\t\t\t\t\tprototypeState,\n\t\t\t\t\t\tprototypeConfig,\n\t\t\t\t\t\tkeepMembersImplementation\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t} else returnValue = implementation.apply(this, args);\n\t\t} catch (error) {\n\t\t\tthrownValue = error;\n\t\t\tdidThrow = true;\n\t\t\tif (error instanceof TypeError && error.message.includes(\"is not a constructor\")) console.warn(`[vitest] The ${namedObject[name].getMockName()} mock did not use 'function' or 'class' in its implementation, see https://vitest.dev/api/vi#vi-spyon for examples.`);\n\t\t\tthrow error;\n\t\t} finally {\n\t\t\tif (didThrow) {\n\t\t\t\tresult.type = \"throw\";\n\t\t\t\tresult.value = thrownValue;\n\t\t\t\tsettledResult.type = \"rejected\";\n\t\t\t\tsettledResult.value = thrownValue;\n\t\t\t} else {\n\t\t\t\tresult.type = \"return\";\n\t\t\t\tresult.value = returnValue;\n\t\t\t\tif (new.target) {\n\t\t\t\t\tstate.contexts[contextIndex - 1] = returnValue;\n\t\t\t\t\tstate.instances[instanceIndex - 1] = returnValue;\n\t\t\t\t\tif (contextPrototypeIndex != null && prototypeState) prototypeState.contexts[contextPrototypeIndex - 1] = returnValue;\n\t\t\t\t\tif (instancePrototypeIndex != null && prototypeState) prototypeState.instances[instancePrototypeIndex - 1] = returnValue;\n\t\t\t\t}\n\t\t\t\tif (returnValue instanceof Promise) returnValue.then((settledValue) => {\n\t\t\t\t\tsettledResult.type = \"fulfilled\";\n\t\t\t\t\tsettledResult.value = settledValue;\n\t\t\t\t}, (rejectedValue) => {\n\t\t\t\t\tsettledResult.type = \"rejected\";\n\t\t\t\t\tsettledResult.value = rejectedValue;\n\t\t\t\t});\n\t\t\t\telse {\n\t\t\t\t\tsettledResult.type = \"fulfilled\";\n\t\t\t\t\tsettledResult.value = returnValue;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn returnValue;\n\t}) };\n\tconst mock = namedObject[name];\n\tconst copyPropertiesFrom = original || pseudoOriginal;\n\tif (copyPropertiesFrom) copyOriginalStaticProperties(mock, copyPropertiesFrom);\n\treturn mock;\n}\n// puts the implementation's prototype behind `mock.prototype` so instances\n// see prototype methods both during and after construction, while properties\n// assigned on `mock.prototype` still shadow them\nfunction reparentMockPrototype(mock, implementation) {\n\tconst mockPrototype = mock.prototype;\n\tif (mockPrototype == null) return;\n\t// an implementation without a usable prototype (reset mock, arrow or bound\n\t// function) reverts the chain to `Object.prototype`, the parent every mock\n\t// is created with\n\tconst parent = implementation?.prototype ?? Object.prototype;\n\tif (mockPrototype !== parent && Object.getPrototypeOf(mockPrototype) !== parent) Object.setPrototypeOf(mockPrototype, parent);\n}\nfunction registerCalls(args, state, prototypeState) {\n\tstate.calls.push(args);\n\tprototypeState?.calls.push(args);\n}\nfunction registerInvocationOrder(order, state, prototypeState) {\n\tstate.invocationCallOrder.push(order);\n\tprototypeState?.invocationCallOrder.push(order);\n}\nfunction registerResult(result, state, prototypeState) {\n\tstate.results.push(result);\n\tprototypeState?.results.push(result);\n}\nfunction registerSettledResult(result, state, prototypeState) {\n\tstate.settledResults.push(result);\n\tprototypeState?.settledResults.push(result);\n}\nfunction registerInstance(instance, state, prototypeState) {\n\treturn [state.instances.push(instance), prototypeState?.instances.push(instance)];\n}\nfunction registerContext(context, state, prototypeState) {\n\treturn [state.contexts.push(context), prototypeState?.contexts.push(context)];\n}\nfunction copyOriginalStaticProperties(mock, original) {\n\tconst { properties, descriptors } = getAllProperties(original);\n\tfor (const key of properties) {\n\t\tconst descriptor = descriptors[key];\n\t\tif (getDescriptor(mock, key)) continue;\n\t\tObject.defineProperty(mock, key, descriptor);\n\t}\n}\nconst ignoreProperties = /* @__PURE__ */ new Set([\n\t\"length\",\n\t\"name\",\n\t\"prototype\",\n\tSymbol.for(\"nodejs.util.promisify.custom\")\n]);\nfunction getAllProperties(original) {\n\tconst properties = /* @__PURE__ */ new Set();\n\tconst descriptors = {};\n\twhile (original && original !== Object.prototype && original !== Function.prototype) {\n\t\tconst ownProperties = [...Object.getOwnPropertyNames(original), ...Object.getOwnPropertySymbols(original)];\n\t\tfor (const prop of ownProperties) {\n\t\t\tif (descriptors[prop] || ignoreProperties.has(prop)) continue;\n\t\t\tproperties.add(prop);\n\t\t\tdescriptors[prop] = Object.getOwnPropertyDescriptor(original, prop);\n\t\t}\n\t\toriginal = Object.getPrototypeOf(original);\n\t}\n\treturn {\n\t\tproperties,\n\t\tdescriptors\n\t};\n}\nfunction getDefaultConfig(original) {\n\treturn {\n\t\tmockImplementation: void 0,\n\t\tmockOriginal: original,\n\t\tmockName: \"vi.fn()\",\n\t\tonceMockImplementations: []\n\t};\n}\nfunction getDefaultState() {\n\tconst state = {\n\t\tcalls: [],\n\t\tcontexts: [],\n\t\tinstances: [],\n\t\tinvocationCallOrder: [],\n\t\tsettledResults: [],\n\t\tresults: [],\n\t\tget lastCall() {\n\t\t\treturn state.calls.at(-1);\n\t\t}\n\t};\n\treturn state;\n}\nfunction restoreAllMocks() {\n\tfor (const restore of MOCK_RESTORE) restore();\n\tMOCK_RESTORE.clear();\n}\nfunction clearAllMocks() {\n\tfor (const mock of DIRTY_MOCK_STATES) mock.mockClear();\n}\nfunction resetAllMocks() {\n\tfor (const ref of REGISTERED_MOCKS) {\n\t\tconst mock = ref.deref();\n\t\tif (mock) mock.mockReset();\n\t\telse REGISTERED_MOCKS.delete(ref);\n\t}\n}\nfunction throwConstructorError(shorthand) {\n\tthrow new TypeError(`Cannot use \\`${shorthand}\\` when called with \\`new\\`. Use \\`mockImplementation\\` with a \\`class\\` keyword instead. See https://vitest.dev/api/mock#class-support for more information.`);\n}\n\nvar spyModule = /*#__PURE__*/Object.freeze({\n\t__proto__: null,\n\tclearAllMocks: clearAllMocks,\n\tcreateMockInstance: createMockInstance,\n\tfn: fn,\n\tisMockFunction: isMockFunction,\n\tresetAllMocks: resetAllMocks,\n\trestoreAllMocks: restoreAllMocks,\n\tspyOn: spyOn\n});\n\nexport { spyOn as a, resetAllMocks as b, clearAllMocks as c, createMockInstance as d, fn as f, isMockFunction as i, restoreAllMocks as r, spyModule as s };\n","var __defProp = Object.defineProperty;\nvar __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;\nvar __name = (target, value) => __defProp(target, \"name\", { value, configurable: true });\nvar __export = (target, all) => {\n  for (var name in all)\n    __defProp(target, name, { get: all[name], enumerable: true });\n};\nvar __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== \"symbol\" ? key + \"\" : key, value);\n\n// lib/chai/utils/index.js\nvar utils_exports = {};\n__export(utils_exports, {\n  addChainableMethod: () => addChainableMethod,\n  addLengthGuard: () => addLengthGuard,\n  addMethod: () => addMethod,\n  addProperty: () => addProperty,\n  checkError: () => check_error_exports,\n  compareByInspect: () => compareByInspect,\n  eql: () => deep_eql_default,\n  events: () => events,\n  expectTypes: () => expectTypes,\n  flag: () => flag,\n  getActual: () => getActual,\n  getMessage: () => getMessage2,\n  getName: () => getName,\n  getOperator: () => getOperator,\n  getOwnEnumerableProperties: () => getOwnEnumerableProperties,\n  getOwnEnumerablePropertySymbols: () => getOwnEnumerablePropertySymbols,\n  getPathInfo: () => getPathInfo,\n  hasProperty: () => hasProperty,\n  inspect: () => inspect2,\n  isNaN: () => isNaN2,\n  isNumeric: () => isNumeric,\n  isProxyEnabled: () => isProxyEnabled,\n  isRegExp: () => isRegExp2,\n  objDisplay: () => objDisplay,\n  overwriteChainableMethod: () => overwriteChainableMethod,\n  overwriteMethod: () => overwriteMethod,\n  overwriteProperty: () => overwriteProperty,\n  proxify: () => proxify,\n  test: () => test,\n  transferFlags: () => transferFlags,\n  type: () => type\n});\n\n// node_modules/check-error/index.js\nvar check_error_exports = {};\n__export(check_error_exports, {\n  compatibleConstructor: () => compatibleConstructor,\n  compatibleInstance: () => compatibleInstance,\n  compatibleMessage: () => compatibleMessage,\n  getConstructorName: () => getConstructorName,\n  getMessage: () => getMessage\n});\nfunction isErrorInstance(obj) {\n  return obj instanceof Error || Object.prototype.toString.call(obj) === \"[object Error]\";\n}\n__name(isErrorInstance, \"isErrorInstance\");\nfunction isRegExp(obj) {\n  return Object.prototype.toString.call(obj) === \"[object RegExp]\";\n}\n__name(isRegExp, \"isRegExp\");\nfunction compatibleInstance(thrown, errorLike) {\n  return isErrorInstance(errorLike) && thrown === errorLike;\n}\n__name(compatibleInstance, \"compatibleInstance\");\nfunction compatibleConstructor(thrown, errorLike) {\n  if (isErrorInstance(errorLike)) {\n    return thrown.constructor === errorLike.constructor || thrown instanceof errorLike.constructor;\n  } else if ((typeof errorLike === \"object\" || typeof errorLike === \"function\") && errorLike.prototype) {\n    return thrown.constructor === errorLike || thrown instanceof errorLike;\n  }\n  return false;\n}\n__name(compatibleConstructor, \"compatibleConstructor\");\nfunction compatibleMessage(thrown, errMatcher) {\n  const comparisonString = typeof thrown === \"string\" ? thrown : thrown.message;\n  if (isRegExp(errMatcher)) {\n    return errMatcher.test(comparisonString);\n  } else if (typeof errMatcher === \"string\") {\n    return comparisonString.indexOf(errMatcher) !== -1;\n  }\n  return false;\n}\n__name(compatibleMessage, \"compatibleMessage\");\nfunction getConstructorName(errorLike) {\n  let constructorName = errorLike;\n  if (isErrorInstance(errorLike)) {\n    constructorName = errorLike.constructor.name;\n  } else if (typeof errorLike === \"function\") {\n    constructorName = errorLike.name;\n    if (constructorName === \"\") {\n      const newConstructorName = new errorLike().name;\n      constructorName = newConstructorName || constructorName;\n    }\n  }\n  return constructorName;\n}\n__name(getConstructorName, \"getConstructorName\");\nfunction getMessage(errorLike) {\n  let msg = \"\";\n  if (errorLike && errorLike.message) {\n    msg = errorLike.message;\n  } else if (typeof errorLike === \"string\") {\n    msg = errorLike;\n  }\n  return msg;\n}\n__name(getMessage, \"getMessage\");\n\n// lib/chai/utils/flag.js\nfunction flag(obj, key, value) {\n  let flags = obj.__flags || (obj.__flags = /* @__PURE__ */ Object.create(null));\n  if (arguments.length === 3) {\n    flags[key] = value;\n  } else {\n    return flags[key];\n  }\n}\n__name(flag, \"flag\");\n\n// lib/chai/utils/test.js\nfunction test(obj, args) {\n  let negate = flag(obj, \"negate\"), expr = args[0];\n  return negate ? !expr : expr;\n}\n__name(test, \"test\");\n\n// lib/chai/utils/type-detect.js\nfunction type(obj) {\n  if (typeof obj === \"undefined\") {\n    return \"undefined\";\n  }\n  if (obj === null) {\n    return \"null\";\n  }\n  const stringTag = obj[Symbol.toStringTag];\n  if (typeof stringTag === \"string\") {\n    return stringTag;\n  }\n  const type3 = Object.prototype.toString.call(obj).slice(8, -1);\n  return type3;\n}\n__name(type, \"type\");\n\n// node_modules/assertion-error/index.js\nvar canElideFrames = \"captureStackTrace\" in Error;\nvar _AssertionError = class _AssertionError extends Error {\n  constructor(message = \"Unspecified AssertionError\", props, ssf) {\n    super(message);\n    __publicField(this, \"message\");\n    this.message = message;\n    if (canElideFrames) {\n      Error.captureStackTrace(this, ssf || _AssertionError);\n    }\n    for (const key in props) {\n      if (!(key in this)) {\n        this[key] = props[key];\n      }\n    }\n  }\n  get name() {\n    return \"AssertionError\";\n  }\n  get ok() {\n    return false;\n  }\n  toJSON(stack) {\n    return {\n      ...this,\n      name: this.name,\n      message: this.message,\n      ok: false,\n      stack: stack !== false ? this.stack : void 0\n    };\n  }\n};\n__name(_AssertionError, \"AssertionError\");\nvar AssertionError = _AssertionError;\n\n// lib/chai/utils/expectTypes.js\nfunction expectTypes(obj, types) {\n  let flagMsg = flag(obj, \"message\");\n  let ssfi = flag(obj, \"ssfi\");\n  flagMsg = flagMsg ? flagMsg + \": \" : \"\";\n  obj = flag(obj, \"object\");\n  types = types.map(function(t) {\n    return t.toLowerCase();\n  });\n  types.sort();\n  let str = types.map(function(t, index) {\n    let art = ~[\"a\", \"e\", \"i\", \"o\", \"u\"].indexOf(t.charAt(0)) ? \"an\" : \"a\";\n    let or = types.length > 1 && index === types.length - 1 ? \"or \" : \"\";\n    return or + art + \" \" + t;\n  }).join(\", \");\n  let objType = type(obj).toLowerCase();\n  if (!types.some(function(expected) {\n    return objType === expected;\n  })) {\n    throw new AssertionError(\n      flagMsg + \"object tested must be \" + str + \", but \" + objType + \" given\",\n      void 0,\n      ssfi\n    );\n  }\n}\n__name(expectTypes, \"expectTypes\");\n\n// lib/chai/utils/getActual.js\nfunction getActual(obj, args) {\n  return args.length > 4 ? args[4] : obj._obj;\n}\n__name(getActual, \"getActual\");\n\n// node_modules/loupe/lib/helpers.js\nvar ansiColors = {\n  bold: [\"1\", \"22\"],\n  dim: [\"2\", \"22\"],\n  italic: [\"3\", \"23\"],\n  underline: [\"4\", \"24\"],\n  // 5 & 6 are blinking\n  inverse: [\"7\", \"27\"],\n  hidden: [\"8\", \"28\"],\n  strike: [\"9\", \"29\"],\n  // 10-20 are fonts\n  // 21-29 are resets for 1-9\n  black: [\"30\", \"39\"],\n  red: [\"31\", \"39\"],\n  green: [\"32\", \"39\"],\n  yellow: [\"33\", \"39\"],\n  blue: [\"34\", \"39\"],\n  magenta: [\"35\", \"39\"],\n  cyan: [\"36\", \"39\"],\n  white: [\"37\", \"39\"],\n  brightblack: [\"30;1\", \"39\"],\n  brightred: [\"31;1\", \"39\"],\n  brightgreen: [\"32;1\", \"39\"],\n  brightyellow: [\"33;1\", \"39\"],\n  brightblue: [\"34;1\", \"39\"],\n  brightmagenta: [\"35;1\", \"39\"],\n  brightcyan: [\"36;1\", \"39\"],\n  brightwhite: [\"37;1\", \"39\"],\n  grey: [\"90\", \"39\"]\n};\nvar styles = {\n  special: \"cyan\",\n  number: \"yellow\",\n  bigint: \"yellow\",\n  boolean: \"yellow\",\n  undefined: \"grey\",\n  null: \"bold\",\n  string: \"green\",\n  symbol: \"green\",\n  date: \"magenta\",\n  regexp: \"red\"\n};\nvar truncator = \"\\u2026\";\nfunction colorise(value, styleType) {\n  const color = ansiColors[styles[styleType]] || ansiColors[styleType] || \"\";\n  if (!color) {\n    return String(value);\n  }\n  return `\\x1B[${color[0]}m${String(value)}\\x1B[${color[1]}m`;\n}\n__name(colorise, \"colorise\");\nfunction normaliseOptions({\n  showHidden = false,\n  depth = 2,\n  colors = false,\n  customInspect = true,\n  showProxy = false,\n  maxArrayLength = Infinity,\n  breakLength = Infinity,\n  seen = [],\n  // eslint-disable-next-line no-shadow\n  truncate: truncate2 = Infinity,\n  stylize = String\n} = {}, inspect3) {\n  const options = {\n    showHidden: Boolean(showHidden),\n    depth: Number(depth),\n    colors: Boolean(colors),\n    customInspect: Boolean(customInspect),\n    showProxy: Boolean(showProxy),\n    maxArrayLength: Number(maxArrayLength),\n    breakLength: Number(breakLength),\n    truncate: Number(truncate2),\n    seen,\n    inspect: inspect3,\n    stylize\n  };\n  if (options.colors) {\n    options.stylize = colorise;\n  }\n  return options;\n}\n__name(normaliseOptions, \"normaliseOptions\");\nfunction isHighSurrogate(char) {\n  return char >= \"\\uD800\" && char <= \"\\uDBFF\";\n}\n__name(isHighSurrogate, \"isHighSurrogate\");\nfunction truncate(string, length, tail = truncator) {\n  string = String(string);\n  const tailLength = tail.length;\n  const stringLength = string.length;\n  if (tailLength > length && stringLength > tailLength) {\n    return tail;\n  }\n  if (stringLength > length && stringLength > tailLength) {\n    let end = length - tailLength;\n    if (end > 0 && isHighSurrogate(string[end - 1])) {\n      end = end - 1;\n    }\n    return `${string.slice(0, end)}${tail}`;\n  }\n  return string;\n}\n__name(truncate, \"truncate\");\nfunction inspectList(list, options, inspectItem, separator = \", \") {\n  inspectItem = inspectItem || options.inspect;\n  const size = list.length;\n  if (size === 0)\n    return \"\";\n  const originalLength = options.truncate;\n  let output = \"\";\n  let peek = \"\";\n  let truncated = \"\";\n  for (let i = 0; i < size; i += 1) {\n    const last = i + 1 === list.length;\n    const secondToLast = i + 2 === list.length;\n    truncated = `${truncator}(${list.length - i})`;\n    const value = list[i];\n    options.truncate = originalLength - output.length - (last ? 0 : separator.length);\n    const string = peek || inspectItem(value, options) + (last ? \"\" : separator);\n    const nextLength = output.length + string.length;\n    const truncatedLength = nextLength + truncated.length;\n    if (last && nextLength > originalLength && output.length + truncated.length <= originalLength) {\n      break;\n    }\n    if (!last && !secondToLast && truncatedLength > originalLength) {\n      break;\n    }\n    peek = last ? \"\" : inspectItem(list[i + 1], options) + (secondToLast ? \"\" : separator);\n    if (!last && secondToLast && truncatedLength > originalLength && nextLength + peek.length > originalLength) {\n      break;\n    }\n    output += string;\n    if (!last && !secondToLast && nextLength + peek.length >= originalLength) {\n      truncated = `${truncator}(${list.length - i - 1})`;\n      break;\n    }\n    truncated = \"\";\n  }\n  return `${output}${truncated}`;\n}\n__name(inspectList, \"inspectList\");\nfunction quoteComplexKey(key) {\n  if (key.match(/^[a-zA-Z_][a-zA-Z_0-9]*$/)) {\n    return key;\n  }\n  return JSON.stringify(key).replace(/'/g, \"\\\\'\").replace(/\\\\\"/g, '\"').replace(/(^\"|\"$)/g, \"'\");\n}\n__name(quoteComplexKey, \"quoteComplexKey\");\nfunction inspectProperty([key, value], options) {\n  options.truncate -= 2;\n  if (typeof key === \"string\") {\n    key = quoteComplexKey(key);\n  } else if (typeof key !== \"number\") {\n    key = `[${options.inspect(key, options)}]`;\n  }\n  options.truncate -= key.length;\n  value = options.inspect(value, options);\n  return `${key}: ${value}`;\n}\n__name(inspectProperty, \"inspectProperty\");\n\n// node_modules/loupe/lib/array.js\nfunction inspectArray(array, options) {\n  const nonIndexProperties = Object.keys(array).slice(array.length);\n  if (!array.length && !nonIndexProperties.length)\n    return \"[]\";\n  options.truncate -= 4;\n  const listContents = inspectList(array, options);\n  options.truncate -= listContents.length;\n  let propertyContents = \"\";\n  if (nonIndexProperties.length) {\n    propertyContents = inspectList(nonIndexProperties.map((key) => [key, array[key]]), options, inspectProperty);\n  }\n  return `[ ${listContents}${propertyContents ? `, ${propertyContents}` : \"\"} ]`;\n}\n__name(inspectArray, \"inspectArray\");\n\n// node_modules/loupe/lib/typedarray.js\nvar getArrayName = /* @__PURE__ */ __name((array) => {\n  if (typeof Buffer === \"function\" && array instanceof Buffer) {\n    return \"Buffer\";\n  }\n  if (array[Symbol.toStringTag]) {\n    return array[Symbol.toStringTag];\n  }\n  return array.constructor.name;\n}, \"getArrayName\");\nfunction inspectTypedArray(array, options) {\n  const name = getArrayName(array);\n  options.truncate -= name.length + 4;\n  const nonIndexProperties = Object.keys(array).slice(array.length);\n  if (!array.length && !nonIndexProperties.length)\n    return `${name}[]`;\n  let output = \"\";\n  for (let i = 0; i < array.length; i++) {\n    const string = `${options.stylize(truncate(array[i], options.truncate), \"number\")}${i === array.length - 1 ? \"\" : \", \"}`;\n    options.truncate -= string.length;\n    if (array[i] !== array.length && options.truncate <= 3) {\n      output += `${truncator}(${array.length - array[i] + 1})`;\n      break;\n    }\n    output += string;\n  }\n  let propertyContents = \"\";\n  if (nonIndexProperties.length) {\n    propertyContents = inspectList(nonIndexProperties.map((key) => [key, array[key]]), options, inspectProperty);\n  }\n  return `${name}[ ${output}${propertyContents ? `, ${propertyContents}` : \"\"} ]`;\n}\n__name(inspectTypedArray, \"inspectTypedArray\");\n\n// node_modules/loupe/lib/date.js\nfunction inspectDate(dateObject, options) {\n  const stringRepresentation = dateObject.toJSON();\n  if (stringRepresentation === null) {\n    return \"Invalid Date\";\n  }\n  const split = stringRepresentation.split(\"T\");\n  const date = split[0];\n  return options.stylize(`${date}T${truncate(split[1], options.truncate - date.length - 1)}`, \"date\");\n}\n__name(inspectDate, \"inspectDate\");\n\n// node_modules/loupe/lib/function.js\nfunction inspectFunction(func, options) {\n  const functionType = func[Symbol.toStringTag] || \"Function\";\n  const name = func.name;\n  if (!name) {\n    return options.stylize(`[${functionType}]`, \"special\");\n  }\n  return options.stylize(`[${functionType} ${truncate(name, options.truncate - 11)}]`, \"special\");\n}\n__name(inspectFunction, \"inspectFunction\");\n\n// node_modules/loupe/lib/map.js\nfunction inspectMapEntry([key, value], options) {\n  options.truncate -= 4;\n  key = options.inspect(key, options);\n  options.truncate -= key.length;\n  value = options.inspect(value, options);\n  return `${key} => ${value}`;\n}\n__name(inspectMapEntry, \"inspectMapEntry\");\nfunction mapToEntries(map) {\n  const entries = [];\n  map.forEach((value, key) => {\n    entries.push([key, value]);\n  });\n  return entries;\n}\n__name(mapToEntries, \"mapToEntries\");\nfunction inspectMap(map, options) {\n  if (map.size === 0)\n    return \"Map{}\";\n  options.truncate -= 7;\n  return `Map{ ${inspectList(mapToEntries(map), options, inspectMapEntry)} }`;\n}\n__name(inspectMap, \"inspectMap\");\n\n// node_modules/loupe/lib/number.js\nvar isNaN = Number.isNaN || ((i) => i !== i);\nfunction inspectNumber(number, options) {\n  if (isNaN(number)) {\n    return options.stylize(\"NaN\", \"number\");\n  }\n  if (number === Infinity) {\n    return options.stylize(\"Infinity\", \"number\");\n  }\n  if (number === -Infinity) {\n    return options.stylize(\"-Infinity\", \"number\");\n  }\n  if (number === 0) {\n    return options.stylize(1 / number === Infinity ? \"+0\" : \"-0\", \"number\");\n  }\n  return options.stylize(truncate(String(number), options.truncate), \"number\");\n}\n__name(inspectNumber, \"inspectNumber\");\n\n// node_modules/loupe/lib/bigint.js\nfunction inspectBigInt(number, options) {\n  let nums = truncate(number.toString(), options.truncate - 1);\n  if (nums !== truncator)\n    nums += \"n\";\n  return options.stylize(nums, \"bigint\");\n}\n__name(inspectBigInt, \"inspectBigInt\");\n\n// node_modules/loupe/lib/regexp.js\nfunction inspectRegExp(value, options) {\n  const flags = value.toString().split(\"/\")[2];\n  const sourceLength = options.truncate - (2 + flags.length);\n  const source = value.source;\n  return options.stylize(`/${truncate(source, sourceLength)}/${flags}`, \"regexp\");\n}\n__name(inspectRegExp, \"inspectRegExp\");\n\n// node_modules/loupe/lib/set.js\nfunction arrayFromSet(set2) {\n  const values = [];\n  set2.forEach((value) => {\n    values.push(value);\n  });\n  return values;\n}\n__name(arrayFromSet, \"arrayFromSet\");\nfunction inspectSet(set2, options) {\n  if (set2.size === 0)\n    return \"Set{}\";\n  options.truncate -= 7;\n  return `Set{ ${inspectList(arrayFromSet(set2), options)} }`;\n}\n__name(inspectSet, \"inspectSet\");\n\n// node_modules/loupe/lib/string.js\nvar stringEscapeChars = new RegExp(\"['\\\\u0000-\\\\u001f\\\\u007f-\\\\u009f\\\\u00ad\\\\u0600-\\\\u0604\\\\u070f\\\\u17b4\\\\u17b5\\\\u200c-\\\\u200f\\\\u2028-\\\\u202f\\\\u2060-\\\\u206f\\\\ufeff\\\\ufff0-\\\\uffff]\", \"g\");\nvar escapeCharacters = {\n  \"\\b\": \"\\\\b\",\n  \"\t\": \"\\\\t\",\n  \"\\n\": \"\\\\n\",\n  \"\\f\": \"\\\\f\",\n  \"\\r\": \"\\\\r\",\n  \"'\": \"\\\\'\",\n  \"\\\\\": \"\\\\\\\\\"\n};\nvar hex = 16;\nvar unicodeLength = 4;\nfunction escape(char) {\n  return escapeCharacters[char] || `\\\\u${`0000${char.charCodeAt(0).toString(hex)}`.slice(-unicodeLength)}`;\n}\n__name(escape, \"escape\");\nfunction inspectString(string, options) {\n  if (stringEscapeChars.test(string)) {\n    string = string.replace(stringEscapeChars, escape);\n  }\n  return options.stylize(`'${truncate(string, options.truncate - 2)}'`, \"string\");\n}\n__name(inspectString, \"inspectString\");\n\n// node_modules/loupe/lib/symbol.js\nfunction inspectSymbol(value) {\n  if (\"description\" in Symbol.prototype) {\n    return value.description ? `Symbol(${value.description})` : \"Symbol()\";\n  }\n  return value.toString();\n}\n__name(inspectSymbol, \"inspectSymbol\");\n\n// node_modules/loupe/lib/promise.js\nvar getPromiseValue = /* @__PURE__ */ __name(() => \"Promise{\\u2026}\", \"getPromiseValue\");\nvar promise_default = getPromiseValue;\n\n// node_modules/loupe/lib/object.js\nfunction inspectObject(object, options) {\n  const properties = Object.getOwnPropertyNames(object);\n  const symbols = Object.getOwnPropertySymbols ? Object.getOwnPropertySymbols(object) : [];\n  if (properties.length === 0 && symbols.length === 0) {\n    return \"{}\";\n  }\n  options.truncate -= 4;\n  options.seen = options.seen || [];\n  if (options.seen.includes(object)) {\n    return \"[Circular]\";\n  }\n  options.seen.push(object);\n  const propertyContents = inspectList(properties.map((key) => [key, object[key]]), options, inspectProperty);\n  const symbolContents = inspectList(symbols.map((key) => [key, object[key]]), options, inspectProperty);\n  options.seen.pop();\n  let sep = \"\";\n  if (propertyContents && symbolContents) {\n    sep = \", \";\n  }\n  return `{ ${propertyContents}${sep}${symbolContents} }`;\n}\n__name(inspectObject, \"inspectObject\");\n\n// node_modules/loupe/lib/class.js\nvar toStringTag = typeof Symbol !== \"undefined\" && Symbol.toStringTag ? Symbol.toStringTag : false;\nfunction inspectClass(value, options) {\n  let name = \"\";\n  if (toStringTag && toStringTag in value) {\n    name = value[toStringTag];\n  }\n  name = name || value.constructor.name;\n  if (!name || name === \"_class\") {\n    name = \"<Anonymous Class>\";\n  }\n  options.truncate -= name.length;\n  return `${name}${inspectObject(value, options)}`;\n}\n__name(inspectClass, \"inspectClass\");\n\n// node_modules/loupe/lib/arguments.js\nfunction inspectArguments(args, options) {\n  if (args.length === 0)\n    return \"Arguments[]\";\n  options.truncate -= 13;\n  return `Arguments[ ${inspectList(args, options)} ]`;\n}\n__name(inspectArguments, \"inspectArguments\");\n\n// node_modules/loupe/lib/error.js\nvar errorKeys = [\n  \"stack\",\n  \"line\",\n  \"column\",\n  \"name\",\n  \"message\",\n  \"fileName\",\n  \"lineNumber\",\n  \"columnNumber\",\n  \"number\",\n  \"description\",\n  \"cause\"\n];\nfunction inspectObject2(error, options) {\n  const properties = Object.getOwnPropertyNames(error).filter((key) => errorKeys.indexOf(key) === -1);\n  const name = error.name;\n  options.truncate -= name.length;\n  let message = \"\";\n  if (typeof error.message === \"string\") {\n    message = truncate(error.message, options.truncate);\n  } else {\n    properties.unshift(\"message\");\n  }\n  message = message ? `: ${message}` : \"\";\n  options.truncate -= message.length + 5;\n  options.seen = options.seen || [];\n  if (options.seen.includes(error)) {\n    return \"[Circular]\";\n  }\n  options.seen.push(error);\n  const propertyContents = inspectList(properties.map((key) => [key, error[key]]), options, inspectProperty);\n  return `${name}${message}${propertyContents ? ` { ${propertyContents} }` : \"\"}`;\n}\n__name(inspectObject2, \"inspectObject\");\n\n// node_modules/loupe/lib/html.js\nfunction inspectAttribute([key, value], options) {\n  options.truncate -= 3;\n  if (!value) {\n    return `${options.stylize(String(key), \"yellow\")}`;\n  }\n  return `${options.stylize(String(key), \"yellow\")}=${options.stylize(`\"${value}\"`, \"string\")}`;\n}\n__name(inspectAttribute, \"inspectAttribute\");\nfunction inspectNodeCollection(collection, options) {\n  return inspectList(collection, options, inspectNode, \"\\n\");\n}\n__name(inspectNodeCollection, \"inspectNodeCollection\");\nfunction inspectNode(node, options) {\n  switch (node.nodeType) {\n    case 1:\n      return inspectHTML(node, options);\n    case 3:\n      return options.inspect(node.data, options);\n    default:\n      return options.inspect(node, options);\n  }\n}\n__name(inspectNode, \"inspectNode\");\nfunction inspectHTML(element, options) {\n  const properties = element.getAttributeNames();\n  const name = element.tagName.toLowerCase();\n  const head = options.stylize(`<${name}`, \"special\");\n  const headClose = options.stylize(`>`, \"special\");\n  const tail = options.stylize(`</${name}>`, \"special\");\n  options.truncate -= name.length * 2 + 5;\n  let propertyContents = \"\";\n  if (properties.length > 0) {\n    propertyContents += \" \";\n    propertyContents += inspectList(properties.map((key) => [key, element.getAttribute(key)]), options, inspectAttribute, \" \");\n  }\n  options.truncate -= propertyContents.length;\n  const truncate2 = options.truncate;\n  let children = inspectNodeCollection(element.children, options);\n  if (children && children.length > truncate2) {\n    children = `${truncator}(${element.children.length})`;\n  }\n  return `${head}${propertyContents}${headClose}${children}${tail}`;\n}\n__name(inspectHTML, \"inspectHTML\");\n\n// node_modules/loupe/lib/index.js\nvar symbolsSupported = typeof Symbol === \"function\" && typeof Symbol.for === \"function\";\nvar chaiInspect = symbolsSupported ? /* @__PURE__ */ Symbol.for(\"chai/inspect\") : \"@@chai/inspect\";\nvar nodeInspect = /* @__PURE__ */ Symbol.for(\"nodejs.util.inspect.custom\");\nvar constructorMap = /* @__PURE__ */ new WeakMap();\nvar stringTagMap = {};\nvar baseTypesMap = {\n  undefined: /* @__PURE__ */ __name((value, options) => options.stylize(\"undefined\", \"undefined\"), \"undefined\"),\n  null: /* @__PURE__ */ __name((value, options) => options.stylize(\"null\", \"null\"), \"null\"),\n  boolean: /* @__PURE__ */ __name((value, options) => options.stylize(String(value), \"boolean\"), \"boolean\"),\n  Boolean: /* @__PURE__ */ __name((value, options) => options.stylize(String(value), \"boolean\"), \"Boolean\"),\n  number: inspectNumber,\n  Number: inspectNumber,\n  bigint: inspectBigInt,\n  BigInt: inspectBigInt,\n  string: inspectString,\n  String: inspectString,\n  function: inspectFunction,\n  Function: inspectFunction,\n  symbol: inspectSymbol,\n  // A Symbol polyfill will return `Symbol` not `symbol` from typedetect\n  Symbol: inspectSymbol,\n  Array: inspectArray,\n  Date: inspectDate,\n  Map: inspectMap,\n  Set: inspectSet,\n  RegExp: inspectRegExp,\n  Promise: promise_default,\n  // WeakSet, WeakMap are totally opaque to us\n  WeakSet: /* @__PURE__ */ __name((value, options) => options.stylize(\"WeakSet{\\u2026}\", \"special\"), \"WeakSet\"),\n  WeakMap: /* @__PURE__ */ __name((value, options) => options.stylize(\"WeakMap{\\u2026}\", \"special\"), \"WeakMap\"),\n  Arguments: inspectArguments,\n  Int8Array: inspectTypedArray,\n  Uint8Array: inspectTypedArray,\n  Uint8ClampedArray: inspectTypedArray,\n  Int16Array: inspectTypedArray,\n  Uint16Array: inspectTypedArray,\n  Int32Array: inspectTypedArray,\n  Uint32Array: inspectTypedArray,\n  Float32Array: inspectTypedArray,\n  Float64Array: inspectTypedArray,\n  Generator: /* @__PURE__ */ __name(() => \"\", \"Generator\"),\n  DataView: /* @__PURE__ */ __name(() => \"\", \"DataView\"),\n  ArrayBuffer: /* @__PURE__ */ __name(() => \"\", \"ArrayBuffer\"),\n  Error: inspectObject2,\n  HTMLCollection: inspectNodeCollection,\n  NodeList: inspectNodeCollection\n};\nvar inspectCustom = /* @__PURE__ */ __name((value, options, type3, inspectFn) => {\n  if (chaiInspect in value && typeof value[chaiInspect] === \"function\") {\n    return value[chaiInspect](options);\n  }\n  if (nodeInspect in value && typeof value[nodeInspect] === \"function\") {\n    return value[nodeInspect](options.depth, options, inspectFn);\n  }\n  if (\"inspect\" in value && typeof value.inspect === \"function\") {\n    return value.inspect(options.depth, options);\n  }\n  if (\"constructor\" in value && constructorMap.has(value.constructor)) {\n    return constructorMap.get(value.constructor)(value, options);\n  }\n  if (stringTagMap[type3]) {\n    return stringTagMap[type3](value, options);\n  }\n  return \"\";\n}, \"inspectCustom\");\nvar toString = Object.prototype.toString;\nfunction inspect(value, opts = {}) {\n  const options = normaliseOptions(opts, inspect);\n  const { customInspect } = options;\n  let type3 = value === null ? \"null\" : typeof value;\n  if (type3 === \"object\") {\n    type3 = toString.call(value).slice(8, -1);\n  }\n  if (type3 in baseTypesMap) {\n    return baseTypesMap[type3](value, options);\n  }\n  if (customInspect && value) {\n    const output = inspectCustom(value, options, type3, inspect);\n    if (output) {\n      if (typeof output === \"string\")\n        return output;\n      return inspect(output, options);\n    }\n  }\n  const proto = value ? Object.getPrototypeOf(value) : false;\n  if (proto === Object.prototype || proto === null) {\n    return inspectObject(value, options);\n  }\n  if (value && typeof HTMLElement === \"function\" && value instanceof HTMLElement) {\n    return inspectHTML(value, options);\n  }\n  if (\"constructor\" in value) {\n    if (value.constructor !== Object) {\n      return inspectClass(value, options);\n    }\n    return inspectObject(value, options);\n  }\n  if (value === Object(value)) {\n    return inspectObject(value, options);\n  }\n  return options.stylize(String(value), type3);\n}\n__name(inspect, \"inspect\");\n\n// lib/chai/config.js\nvar config = {\n  /**\n   * ### config.includeStack\n   *\n   * User configurable property, influences whether stack trace\n   * is included in Assertion error message. Default of false\n   * suppresses stack trace in the error message.\n   *\n   *     chai.config.includeStack = true;  // enable stack on error\n   *\n   * @param {boolean}\n   * @public\n   */\n  includeStack: false,\n  /**\n   * ### config.showDiff\n   *\n   * User configurable property, influences whether or not\n   * the `showDiff` flag should be included in the thrown\n   * AssertionErrors. `false` will always be `false`; `true`\n   * will be true when the assertion has requested a diff\n   * be shown.\n   *\n   * @param {boolean}\n   * @public\n   */\n  showDiff: true,\n  /**\n   * ### config.truncateThreshold\n   *\n   * User configurable property, sets length threshold for actual and\n   * expected values in assertion errors. If this threshold is exceeded, for\n   * example for large data structures, the value is replaced with something\n   * like `[ Array(3) ]` or `{ Object (prop1, prop2) }`.\n   *\n   * Set it to zero if you want to disable truncating altogether.\n   *\n   * This is especially userful when doing assertions on arrays: having this\n   * set to a reasonable large value makes the failure messages readily\n   * inspectable.\n   *\n   *     chai.config.truncateThreshold = 0;  // disable truncating\n   *\n   * @param {number}\n   * @public\n   */\n  truncateThreshold: 40,\n  /**\n   * ### config.useProxy\n   *\n   * User configurable property, defines if chai will use a Proxy to throw\n   * an error when a non-existent property is read, which protects users\n   * from typos when using property-based assertions.\n   *\n   * Set it to false if you want to disable this feature.\n   *\n   *     chai.config.useProxy = false;  // disable use of Proxy\n   *\n   * This feature is automatically disabled regardless of this config value\n   * in environments that don't support proxies.\n   *\n   * @param {boolean}\n   * @public\n   */\n  useProxy: true,\n  /**\n   * ### config.proxyExcludedKeys\n   *\n   * User configurable property, defines which properties should be ignored\n   * instead of throwing an error if they do not exist on the assertion.\n   * This is only applied if the environment Chai is running in supports proxies and\n   * if the `useProxy` configuration setting is enabled.\n   * By default, `then` and `inspect` will not throw an error if they do not exist on the\n   * assertion object because the `.inspect` property is read by `util.inspect` (for example, when\n   * using `console.log` on the assertion object) and `.then` is necessary for promise type-checking.\n   *\n   *     // By default these keys will not throw an error if they do not exist on the assertion object\n   *     chai.config.proxyExcludedKeys = ['then', 'inspect'];\n   *\n   * @param {Array}\n   * @public\n   */\n  proxyExcludedKeys: [\"then\", \"catch\", \"inspect\", \"toJSON\"],\n  /**\n   * ### config.deepEqual\n   *\n   * User configurable property, defines which a custom function to use for deepEqual\n   * comparisons.\n   * By default, the function used is the one from the `deep-eql` package without custom comparator.\n   *\n   *     // use a custom comparator\n   *     chai.config.deepEqual = (expected, actual) => {\n   *         return chai.util.eql(expected, actual, {\n   *             comparator: (expected, actual) => {\n   *                 // for non number comparison, use the default behavior\n   *                 if(typeof expected !== 'number') return null;\n   *                 // allow a difference of 10 between compared numbers\n   *                 return typeof actual === 'number' && Math.abs(actual - expected) < 10\n   *             }\n   *         })\n   *     };\n   *\n   * @param {Function}\n   * @public\n   */\n  deepEqual: null\n};\n\n// lib/chai/utils/inspect.js\nfunction inspect2(obj, showHidden, depth, colors) {\n  let options = {\n    colors,\n    depth: typeof depth === \"undefined\" ? 2 : depth,\n    showHidden,\n    truncate: config.truncateThreshold ? config.truncateThreshold : Infinity\n  };\n  return inspect(obj, options);\n}\n__name(inspect2, \"inspect\");\n\n// lib/chai/utils/objDisplay.js\nfunction objDisplay(obj) {\n  let str = inspect2(obj), type3 = Object.prototype.toString.call(obj);\n  if (config.truncateThreshold && str.length >= config.truncateThreshold) {\n    if (type3 === \"[object Function]\") {\n      return !obj.name || obj.name === \"\" ? \"[Function]\" : \"[Function: \" + obj.name + \"]\";\n    } else if (type3 === \"[object Array]\") {\n      return \"[ Array(\" + obj.length + \") ]\";\n    } else if (type3 === \"[object Object]\") {\n      let keys = Object.keys(obj), kstr = keys.length > 2 ? keys.splice(0, 2).join(\", \") + \", ...\" : keys.join(\", \");\n      return \"{ Object (\" + kstr + \") }\";\n    } else {\n      return str;\n    }\n  } else {\n    return str;\n  }\n}\n__name(objDisplay, \"objDisplay\");\n\n// lib/chai/utils/getMessage.js\nfunction getMessage2(obj, args) {\n  let negate = flag(obj, \"negate\");\n  let val = flag(obj, \"object\");\n  let expected = args[3];\n  let actual = getActual(obj, args);\n  let msg = negate ? args[2] : args[1];\n  let flagMsg = flag(obj, \"message\");\n  if (typeof msg === \"function\") msg = msg();\n  msg = msg || \"\";\n  msg = msg.replace(/#\\{this\\}/g, function() {\n    return objDisplay(val);\n  }).replace(/#\\{act\\}/g, function() {\n    return objDisplay(actual);\n  }).replace(/#\\{exp\\}/g, function() {\n    return objDisplay(expected);\n  });\n  return flagMsg ? flagMsg + \": \" + msg : msg;\n}\n__name(getMessage2, \"getMessage\");\n\n// lib/chai/utils/transferFlags.js\nfunction transferFlags(assertion, object, includeAll) {\n  let flags = assertion.__flags || (assertion.__flags = /* @__PURE__ */ Object.create(null));\n  if (!object.__flags) {\n    object.__flags = /* @__PURE__ */ Object.create(null);\n  }\n  includeAll = arguments.length === 3 ? includeAll : true;\n  for (let flag3 in flags) {\n    if (includeAll || flag3 !== \"object\" && flag3 !== \"ssfi\" && flag3 !== \"lockSsfi\" && flag3 != \"message\") {\n      object.__flags[flag3] = flags[flag3];\n    }\n  }\n}\n__name(transferFlags, \"transferFlags\");\n\n// node_modules/deep-eql/index.js\nfunction type2(obj) {\n  if (typeof obj === \"undefined\") {\n    return \"undefined\";\n  }\n  if (obj === null) {\n    return \"null\";\n  }\n  const stringTag = obj[Symbol.toStringTag];\n  if (typeof stringTag === \"string\") {\n    return stringTag;\n  }\n  const sliceStart = 8;\n  const sliceEnd = -1;\n  return Object.prototype.toString.call(obj).slice(sliceStart, sliceEnd);\n}\n__name(type2, \"type\");\nfunction FakeMap() {\n  this._key = \"chai/deep-eql__\" + Math.random() + Date.now();\n}\n__name(FakeMap, \"FakeMap\");\nFakeMap.prototype = {\n  get: /* @__PURE__ */ __name(function get(key) {\n    return key[this._key];\n  }, \"get\"),\n  set: /* @__PURE__ */ __name(function set(key, value) {\n    if (Object.isExtensible(key)) {\n      Object.defineProperty(key, this._key, {\n        value,\n        configurable: true\n      });\n    }\n  }, \"set\")\n};\nvar MemoizeMap = typeof WeakMap === \"function\" ? WeakMap : FakeMap;\nfunction memoizeCompare(leftHandOperand, rightHandOperand, memoizeMap) {\n  if (!memoizeMap || isPrimitive(leftHandOperand) || isPrimitive(rightHandOperand)) {\n    return null;\n  }\n  var leftHandMap = memoizeMap.get(leftHandOperand);\n  if (leftHandMap) {\n    var result = leftHandMap.get(rightHandOperand);\n    if (typeof result === \"boolean\") {\n      return result;\n    }\n  }\n  return null;\n}\n__name(memoizeCompare, \"memoizeCompare\");\nfunction memoizeSet(leftHandOperand, rightHandOperand, memoizeMap, result) {\n  if (!memoizeMap || isPrimitive(leftHandOperand) || isPrimitive(rightHandOperand)) {\n    return;\n  }\n  var leftHandMap = memoizeMap.get(leftHandOperand);\n  if (leftHandMap) {\n    leftHandMap.set(rightHandOperand, result);\n  } else {\n    leftHandMap = new MemoizeMap();\n    leftHandMap.set(rightHandOperand, result);\n    memoizeMap.set(leftHandOperand, leftHandMap);\n  }\n}\n__name(memoizeSet, \"memoizeSet\");\nvar deep_eql_default = deepEqual;\nfunction deepEqual(leftHandOperand, rightHandOperand, options) {\n  if (options && options.comparator) {\n    return extensiveDeepEqual(leftHandOperand, rightHandOperand, options);\n  }\n  var simpleResult = simpleEqual(leftHandOperand, rightHandOperand);\n  if (simpleResult !== null) {\n    return simpleResult;\n  }\n  return extensiveDeepEqual(leftHandOperand, rightHandOperand, options);\n}\n__name(deepEqual, \"deepEqual\");\nfunction simpleEqual(leftHandOperand, rightHandOperand) {\n  if (leftHandOperand === rightHandOperand) {\n    return leftHandOperand !== 0 || 1 / leftHandOperand === 1 / rightHandOperand;\n  }\n  if (leftHandOperand !== leftHandOperand && // eslint-disable-line no-self-compare\n  rightHandOperand !== rightHandOperand) {\n    return true;\n  }\n  if (isPrimitive(leftHandOperand) || isPrimitive(rightHandOperand)) {\n    return false;\n  }\n  return null;\n}\n__name(simpleEqual, \"simpleEqual\");\nfunction extensiveDeepEqual(leftHandOperand, rightHandOperand, options) {\n  options = options || {};\n  options.memoize = options.memoize === false ? false : options.memoize || new MemoizeMap();\n  var comparator = options && options.comparator;\n  var memoizeResultLeft = memoizeCompare(leftHandOperand, rightHandOperand, options.memoize);\n  if (memoizeResultLeft !== null) {\n    return memoizeResultLeft;\n  }\n  var memoizeResultRight = memoizeCompare(rightHandOperand, leftHandOperand, options.memoize);\n  if (memoizeResultRight !== null) {\n    return memoizeResultRight;\n  }\n  if (comparator) {\n    var comparatorResult = comparator(leftHandOperand, rightHandOperand);\n    if (comparatorResult === false || comparatorResult === true) {\n      memoizeSet(leftHandOperand, rightHandOperand, options.memoize, comparatorResult);\n      return comparatorResult;\n    }\n    var simpleResult = simpleEqual(leftHandOperand, rightHandOperand);\n    if (simpleResult !== null) {\n      return simpleResult;\n    }\n  }\n  var leftHandType = type2(leftHandOperand);\n  if (leftHandType !== type2(rightHandOperand)) {\n    memoizeSet(leftHandOperand, rightHandOperand, options.memoize, false);\n    return false;\n  }\n  memoizeSet(leftHandOperand, rightHandOperand, options.memoize, true);\n  var result = extensiveDeepEqualByType(leftHandOperand, rightHandOperand, leftHandType, options);\n  memoizeSet(leftHandOperand, rightHandOperand, options.memoize, result);\n  return result;\n}\n__name(extensiveDeepEqual, \"extensiveDeepEqual\");\nfunction extensiveDeepEqualByType(leftHandOperand, rightHandOperand, leftHandType, options) {\n  switch (leftHandType) {\n    case \"String\":\n    case \"Number\":\n    case \"Boolean\":\n    case \"Date\":\n      return deepEqual(leftHandOperand.valueOf(), rightHandOperand.valueOf());\n    case \"Promise\":\n    case \"Symbol\":\n    case \"function\":\n    case \"WeakMap\":\n    case \"WeakSet\":\n      return leftHandOperand === rightHandOperand;\n    case \"Error\":\n      return keysEqual(leftHandOperand, rightHandOperand, [\"name\", \"message\", \"code\"], options);\n    case \"Arguments\":\n    case \"Int8Array\":\n    case \"Uint8Array\":\n    case \"Uint8ClampedArray\":\n    case \"Int16Array\":\n    case \"Uint16Array\":\n    case \"Int32Array\":\n    case \"Uint32Array\":\n    case \"Float32Array\":\n    case \"Float64Array\":\n    case \"Array\":\n      return iterableEqual(leftHandOperand, rightHandOperand, options);\n    case \"RegExp\":\n      return regexpEqual(leftHandOperand, rightHandOperand);\n    case \"Generator\":\n      return generatorEqual(leftHandOperand, rightHandOperand, options);\n    case \"DataView\":\n      return iterableEqual(new Uint8Array(leftHandOperand.buffer), new Uint8Array(rightHandOperand.buffer), options);\n    case \"ArrayBuffer\":\n      return iterableEqual(new Uint8Array(leftHandOperand), new Uint8Array(rightHandOperand), options);\n    case \"Set\":\n      return entriesEqual(leftHandOperand, rightHandOperand, options);\n    case \"Map\":\n      return entriesEqual(leftHandOperand, rightHandOperand, options);\n    case \"Temporal.PlainDate\":\n    case \"Temporal.PlainTime\":\n    case \"Temporal.PlainDateTime\":\n    case \"Temporal.Instant\":\n    case \"Temporal.ZonedDateTime\":\n    case \"Temporal.PlainYearMonth\":\n    case \"Temporal.PlainMonthDay\":\n      return leftHandOperand.equals(rightHandOperand);\n    case \"Temporal.Duration\":\n      return leftHandOperand.total(\"nanoseconds\") === rightHandOperand.total(\"nanoseconds\");\n    case \"Temporal.TimeZone\":\n    case \"Temporal.Calendar\":\n      return leftHandOperand.toString() === rightHandOperand.toString();\n    default:\n      return objectEqual(leftHandOperand, rightHandOperand, options);\n  }\n}\n__name(extensiveDeepEqualByType, \"extensiveDeepEqualByType\");\nfunction regexpEqual(leftHandOperand, rightHandOperand) {\n  return leftHandOperand.toString() === rightHandOperand.toString();\n}\n__name(regexpEqual, \"regexpEqual\");\nfunction entriesEqual(leftHandOperand, rightHandOperand, options) {\n  try {\n    if (leftHandOperand.size !== rightHandOperand.size) {\n      return false;\n    }\n    if (leftHandOperand.size === 0) {\n      return true;\n    }\n  } catch (sizeError) {\n    return false;\n  }\n  var leftHandItems = [];\n  var rightHandItems = [];\n  leftHandOperand.forEach(/* @__PURE__ */ __name(function gatherEntries(key, value) {\n    leftHandItems.push([key, value]);\n  }, \"gatherEntries\"));\n  rightHandOperand.forEach(/* @__PURE__ */ __name(function gatherEntries(key, value) {\n    rightHandItems.push([key, value]);\n  }, \"gatherEntries\"));\n  return iterableEqual(leftHandItems.sort(), rightHandItems.sort(), options);\n}\n__name(entriesEqual, \"entriesEqual\");\nfunction iterableEqual(leftHandOperand, rightHandOperand, options) {\n  var length = leftHandOperand.length;\n  if (length !== rightHandOperand.length) {\n    return false;\n  }\n  if (length === 0) {\n    return true;\n  }\n  var index = -1;\n  while (++index < length) {\n    if (deepEqual(leftHandOperand[index], rightHandOperand[index], options) === false) {\n      return false;\n    }\n  }\n  return true;\n}\n__name(iterableEqual, \"iterableEqual\");\nfunction generatorEqual(leftHandOperand, rightHandOperand, options) {\n  return iterableEqual(getGeneratorEntries(leftHandOperand), getGeneratorEntries(rightHandOperand), options);\n}\n__name(generatorEqual, \"generatorEqual\");\nfunction hasIteratorFunction(target) {\n  return typeof Symbol !== \"undefined\" && typeof target === \"object\" && typeof Symbol.iterator !== \"undefined\" && typeof target[Symbol.iterator] === \"function\";\n}\n__name(hasIteratorFunction, \"hasIteratorFunction\");\nfunction getIteratorEntries(target) {\n  if (hasIteratorFunction(target)) {\n    try {\n      return getGeneratorEntries(target[Symbol.iterator]());\n    } catch (iteratorError) {\n      return [];\n    }\n  }\n  return [];\n}\n__name(getIteratorEntries, \"getIteratorEntries\");\nfunction getGeneratorEntries(generator) {\n  var generatorResult = generator.next();\n  var accumulator = [generatorResult.value];\n  while (generatorResult.done === false) {\n    generatorResult = generator.next();\n    accumulator.push(generatorResult.value);\n  }\n  return accumulator;\n}\n__name(getGeneratorEntries, \"getGeneratorEntries\");\nfunction getEnumerableKeys(target) {\n  var keys = [];\n  for (var key in target) {\n    keys.push(key);\n  }\n  return keys;\n}\n__name(getEnumerableKeys, \"getEnumerableKeys\");\nfunction getEnumerableSymbols(target) {\n  var keys = [];\n  var allKeys = Object.getOwnPropertySymbols(target);\n  for (var i = 0; i < allKeys.length; i += 1) {\n    var key = allKeys[i];\n    if (Object.getOwnPropertyDescriptor(target, key).enumerable) {\n      keys.push(key);\n    }\n  }\n  return keys;\n}\n__name(getEnumerableSymbols, \"getEnumerableSymbols\");\nfunction keysEqual(leftHandOperand, rightHandOperand, keys, options) {\n  var length = keys.length;\n  if (length === 0) {\n    return true;\n  }\n  for (var i = 0; i < length; i += 1) {\n    if (deepEqual(leftHandOperand[keys[i]], rightHandOperand[keys[i]], options) === false) {\n      return false;\n    }\n  }\n  return true;\n}\n__name(keysEqual, \"keysEqual\");\nfunction objectEqual(leftHandOperand, rightHandOperand, options) {\n  var leftHandKeys = getEnumerableKeys(leftHandOperand);\n  var rightHandKeys = getEnumerableKeys(rightHandOperand);\n  var leftHandSymbols = getEnumerableSymbols(leftHandOperand);\n  var rightHandSymbols = getEnumerableSymbols(rightHandOperand);\n  leftHandKeys = leftHandKeys.concat(leftHandSymbols);\n  rightHandKeys = rightHandKeys.concat(rightHandSymbols);\n  if (leftHandKeys.length && leftHandKeys.length === rightHandKeys.length) {\n    if (iterableEqual(mapSymbols(leftHandKeys).sort(), mapSymbols(rightHandKeys).sort()) === false) {\n      return false;\n    }\n    return keysEqual(leftHandOperand, rightHandOperand, leftHandKeys, options);\n  }\n  var leftHandEntries = getIteratorEntries(leftHandOperand);\n  var rightHandEntries = getIteratorEntries(rightHandOperand);\n  if (leftHandEntries.length && leftHandEntries.length === rightHandEntries.length) {\n    leftHandEntries.sort();\n    rightHandEntries.sort();\n    return iterableEqual(leftHandEntries, rightHandEntries, options);\n  }\n  if (leftHandKeys.length === 0 && leftHandEntries.length === 0 && rightHandKeys.length === 0 && rightHandEntries.length === 0) {\n    return true;\n  }\n  return false;\n}\n__name(objectEqual, \"objectEqual\");\nfunction isPrimitive(value) {\n  return value === null || typeof value !== \"object\";\n}\n__name(isPrimitive, \"isPrimitive\");\nfunction mapSymbols(arr) {\n  return arr.map(/* @__PURE__ */ __name(function mapSymbol(entry) {\n    if (typeof entry === \"symbol\") {\n      return entry.toString();\n    }\n    return entry;\n  }, \"mapSymbol\"));\n}\n__name(mapSymbols, \"mapSymbols\");\n\n// node_modules/pathval/index.js\nfunction hasProperty(obj, name) {\n  if (typeof obj === \"undefined\" || obj === null) {\n    return false;\n  }\n  return name in Object(obj);\n}\n__name(hasProperty, \"hasProperty\");\nfunction parsePath(path) {\n  const str = path.replace(/([^\\\\])\\[/g, \"$1.[\");\n  const parts = str.match(/(\\\\\\.|[^.]+?)+/g);\n  return parts.map((value) => {\n    if (value === \"constructor\" || value === \"__proto__\" || value === \"prototype\") {\n      return {};\n    }\n    const regexp = /^\\[(\\d+)\\]$/;\n    const mArr = regexp.exec(value);\n    let parsed = null;\n    if (mArr) {\n      parsed = { i: parseFloat(mArr[1]) };\n    } else {\n      parsed = { p: value.replace(/\\\\([.[\\]])/g, \"$1\") };\n    }\n    return parsed;\n  });\n}\n__name(parsePath, \"parsePath\");\nfunction internalGetPathValue(obj, parsed, pathDepth) {\n  let temporaryValue = obj;\n  let res = null;\n  pathDepth = typeof pathDepth === \"undefined\" ? parsed.length : pathDepth;\n  for (let i = 0; i < pathDepth; i++) {\n    const part = parsed[i];\n    if (temporaryValue) {\n      if (typeof part.p === \"undefined\") {\n        temporaryValue = temporaryValue[part.i];\n      } else {\n        temporaryValue = temporaryValue[part.p];\n      }\n      if (i === pathDepth - 1) {\n        res = temporaryValue;\n      }\n    }\n  }\n  return res;\n}\n__name(internalGetPathValue, \"internalGetPathValue\");\nfunction getPathInfo(obj, path) {\n  const parsed = parsePath(path);\n  const last = parsed[parsed.length - 1];\n  const info = {\n    parent: parsed.length > 1 ? internalGetPathValue(obj, parsed, parsed.length - 1) : obj,\n    name: last.p || last.i,\n    value: internalGetPathValue(obj, parsed)\n  };\n  info.exists = hasProperty(info.parent, info.name);\n  return info;\n}\n__name(getPathInfo, \"getPathInfo\");\n\n// lib/chai/assertion.js\nvar _Assertion = class _Assertion {\n  /**\n   * Creates object for chaining.\n   * `Assertion` objects contain metadata in the form of flags. Three flags can\n   * be assigned during instantiation by passing arguments to this constructor:\n   *\n   * - `object`: This flag contains the target of the assertion. For example, in\n   * the assertion `expect(numKittens).to.equal(7);`, the `object` flag will\n   * contain `numKittens` so that the `equal` assertion can reference it when\n   * needed.\n   *\n   * - `message`: This flag contains an optional custom error message to be\n   * prepended to the error message that's generated by the assertion when it\n   * fails.\n   *\n   * - `ssfi`: This flag stands for \"start stack function indicator\". It\n   * contains a function reference that serves as the starting point for\n   * removing frames from the stack trace of the error that's created by the\n   * assertion when it fails. The goal is to provide a cleaner stack trace to\n   * end users by removing Chai's internal functions. Note that it only works\n   * in environments that support `Error.captureStackTrace`, and only when\n   * `Chai.config.includeStack` hasn't been set to `false`.\n   *\n   * - `lockSsfi`: This flag controls whether or not the given `ssfi` flag\n   * should retain its current value, even as assertions are chained off of\n   * this object. This is usually set to `true` when creating a new assertion\n   * from within another assertion. It's also temporarily set to `true` before\n   * an overwritten assertion gets called by the overwriting assertion.\n   *\n   * - `eql`: This flag contains the deepEqual function to be used by the assertion.\n   *\n   * @param {unknown} obj target of the assertion\n   * @param {string} [msg] (optional) custom error message\n   * @param {Function} [ssfi] (optional) starting point for removing stack frames\n   * @param {boolean} [lockSsfi] (optional) whether or not the ssfi flag is locked\n   */\n  constructor(obj, msg, ssfi, lockSsfi) {\n    /** @type {{}} */\n    __publicField(this, \"__flags\", {});\n    flag(this, \"ssfi\", ssfi || _Assertion);\n    flag(this, \"lockSsfi\", lockSsfi);\n    flag(this, \"object\", obj);\n    flag(this, \"message\", msg);\n    flag(this, \"eql\", config.deepEqual || deep_eql_default);\n    return proxify(this);\n  }\n  /** @returns {boolean} */\n  static get includeStack() {\n    console.warn(\n      \"Assertion.includeStack is deprecated, use chai.config.includeStack instead.\"\n    );\n    return config.includeStack;\n  }\n  /** @param {boolean} value */\n  static set includeStack(value) {\n    console.warn(\n      \"Assertion.includeStack is deprecated, use chai.config.includeStack instead.\"\n    );\n    config.includeStack = value;\n  }\n  /** @returns {boolean} */\n  static get showDiff() {\n    console.warn(\n      \"Assertion.showDiff is deprecated, use chai.config.showDiff instead.\"\n    );\n    return config.showDiff;\n  }\n  /** @param {boolean} value */\n  static set showDiff(value) {\n    console.warn(\n      \"Assertion.showDiff is deprecated, use chai.config.showDiff instead.\"\n    );\n    config.showDiff = value;\n  }\n  /**\n   * @param {string} name\n   * @param {Function} fn\n   */\n  static addProperty(name, fn) {\n    addProperty(this.prototype, name, fn);\n  }\n  /**\n   * @param {string} name\n   * @param {Function} fn\n   */\n  static addMethod(name, fn) {\n    addMethod(this.prototype, name, fn);\n  }\n  /**\n   * @param {string} name\n   * @param {Function} fn\n   * @param {Function} chainingBehavior\n   */\n  static addChainableMethod(name, fn, chainingBehavior) {\n    addChainableMethod(this.prototype, name, fn, chainingBehavior);\n  }\n  /**\n   * @param {string} name\n   * @param {Function} fn\n   */\n  static overwriteProperty(name, fn) {\n    overwriteProperty(this.prototype, name, fn);\n  }\n  /**\n   * @param {string} name\n   * @param {Function} fn\n   */\n  static overwriteMethod(name, fn) {\n    overwriteMethod(this.prototype, name, fn);\n  }\n  /**\n   * @param {string} name\n   * @param {Function} fn\n   * @param {Function} chainingBehavior\n   */\n  static overwriteChainableMethod(name, fn, chainingBehavior) {\n    overwriteChainableMethod(this.prototype, name, fn, chainingBehavior);\n  }\n  /**\n   * ### .assert(expression, message, negateMessage, expected, actual, showDiff)\n   *\n   * Executes an expression and check expectations. Throws AssertionError for reporting if test doesn't pass.\n   *\n   * @name assert\n   * @param {unknown} _expr to be tested\n   * @param {string | Function} msg or function that returns message to display if expression fails\n   * @param {string | Function} _negateMsg or function that returns negatedMessage to display if negated expression fails\n   * @param {unknown} expected value (remember to check for negation)\n   * @param {unknown} _actual (optional) will default to `this.obj`\n   * @param {boolean} showDiff (optional) when set to `true`, assert will display a diff in addition to the message if expression fails\n   * @returns {void}\n   */\n  assert(_expr, msg, _negateMsg, expected, _actual, showDiff) {\n    const ok = test(this, arguments);\n    if (false !== showDiff) showDiff = true;\n    if (void 0 === expected && void 0 === _actual) showDiff = false;\n    if (true !== config.showDiff) showDiff = false;\n    if (!ok) {\n      msg = getMessage2(this, arguments);\n      const actual = getActual(this, arguments);\n      const assertionErrorObjectProperties = {\n        actual,\n        expected,\n        showDiff\n      };\n      const operator = getOperator(this, arguments);\n      if (operator) {\n        assertionErrorObjectProperties.operator = operator;\n      }\n      throw new AssertionError(\n        msg,\n        assertionErrorObjectProperties,\n        // @ts-expect-error Not sure what to do about these types yet\n        config.includeStack ? this.assert : flag(this, \"ssfi\")\n      );\n    }\n  }\n  /**\n   * Quick reference to stored `actual` value for plugin developers.\n   *\n   * @returns {unknown}\n   */\n  get _obj() {\n    return flag(this, \"object\");\n  }\n  /**\n   * Quick reference to stored `actual` value for plugin developers.\n   *\n   * @param {unknown} val\n   */\n  set _obj(val) {\n    flag(this, \"object\", val);\n  }\n};\n__name(_Assertion, \"Assertion\");\nvar Assertion = _Assertion;\n\n// lib/chai/utils/events.js\nvar events = new EventTarget();\nvar _PluginEvent = class _PluginEvent extends Event {\n  constructor(type3, name, fn) {\n    super(type3);\n    this.name = String(name);\n    this.fn = fn;\n  }\n};\n__name(_PluginEvent, \"PluginEvent\");\nvar PluginEvent = _PluginEvent;\n\n// lib/chai/utils/isProxyEnabled.js\nfunction isProxyEnabled() {\n  return config.useProxy && typeof Proxy !== \"undefined\" && typeof Reflect !== \"undefined\";\n}\n__name(isProxyEnabled, \"isProxyEnabled\");\n\n// lib/chai/utils/addProperty.js\nfunction addProperty(ctx, name, getter) {\n  getter = getter === void 0 ? function() {\n  } : getter;\n  Object.defineProperty(ctx, name, {\n    get: /* @__PURE__ */ __name(function propertyGetter() {\n      if (!isProxyEnabled() && !flag(this, \"lockSsfi\")) {\n        flag(this, \"ssfi\", propertyGetter);\n      }\n      let result = getter.call(this);\n      if (result !== void 0) return result;\n      let newAssertion = new Assertion();\n      transferFlags(this, newAssertion);\n      return newAssertion;\n    }, \"propertyGetter\"),\n    configurable: true\n  });\n  events.dispatchEvent(new PluginEvent(\"addProperty\", name, getter));\n}\n__name(addProperty, \"addProperty\");\n\n// lib/chai/utils/addLengthGuard.js\nvar fnLengthDesc = Object.getOwnPropertyDescriptor(function() {\n}, \"length\");\nfunction addLengthGuard(fn, assertionName, isChainable) {\n  if (!fnLengthDesc.configurable) return fn;\n  Object.defineProperty(fn, \"length\", {\n    get: /* @__PURE__ */ __name(function() {\n      if (isChainable) {\n        throw Error(\n          \"Invalid Chai property: \" + assertionName + '.length. Due to a compatibility issue, \"length\" cannot directly follow \"' + assertionName + '\". Use \"' + assertionName + '.lengthOf\" instead.'\n        );\n      }\n      throw Error(\n        \"Invalid Chai property: \" + assertionName + '.length. See docs for proper usage of \"' + assertionName + '\".'\n      );\n    }, \"get\")\n  });\n  return fn;\n}\n__name(addLengthGuard, \"addLengthGuard\");\n\n// lib/chai/utils/getProperties.js\nfunction getProperties(object) {\n  let result = Object.getOwnPropertyNames(object);\n  function addProperty2(property) {\n    if (result.indexOf(property) === -1) {\n      result.push(property);\n    }\n  }\n  __name(addProperty2, \"addProperty\");\n  let proto = Object.getPrototypeOf(object);\n  while (proto !== null) {\n    Object.getOwnPropertyNames(proto).forEach(addProperty2);\n    proto = Object.getPrototypeOf(proto);\n  }\n  return result;\n}\n__name(getProperties, \"getProperties\");\n\n// lib/chai/utils/proxify.js\nvar builtins = [\"__flags\", \"__methods\", \"_obj\", \"assert\"];\nfunction proxify(obj, nonChainableMethodName) {\n  if (!isProxyEnabled()) return obj;\n  return new Proxy(obj, {\n    get: /* @__PURE__ */ __name(function proxyGetter(target, property) {\n      if (typeof property === \"string\" && config.proxyExcludedKeys.indexOf(property) === -1 && !Reflect.has(target, property)) {\n        if (nonChainableMethodName) {\n          throw Error(\n            \"Invalid Chai property: \" + nonChainableMethodName + \".\" + property + '. See docs for proper usage of \"' + nonChainableMethodName + '\".'\n          );\n        }\n        let suggestion = null;\n        let suggestionDistance = 4;\n        getProperties(target).forEach(function(prop) {\n          if (\n            // we actually mean to check `Object.prototype` here\n            // eslint-disable-next-line no-prototype-builtins\n            !Object.prototype.hasOwnProperty(prop) && builtins.indexOf(prop) === -1\n          ) {\n            let dist = stringDistanceCapped(property, prop, suggestionDistance);\n            if (dist < suggestionDistance) {\n              suggestion = prop;\n              suggestionDistance = dist;\n            }\n          }\n        });\n        if (suggestion !== null) {\n          throw Error(\n            \"Invalid Chai property: \" + property + '. Did you mean \"' + suggestion + '\"?'\n          );\n        } else {\n          throw Error(\"Invalid Chai property: \" + property);\n        }\n      }\n      if (builtins.indexOf(property) === -1 && !flag(target, \"lockSsfi\")) {\n        flag(target, \"ssfi\", proxyGetter);\n      }\n      return Reflect.get(target, property);\n    }, \"proxyGetter\")\n  });\n}\n__name(proxify, \"proxify\");\nfunction stringDistanceCapped(strA, strB, cap) {\n  if (Math.abs(strA.length - strB.length) >= cap) {\n    return cap;\n  }\n  let memo = [];\n  for (let i = 0; i <= strA.length; i++) {\n    memo[i] = Array(strB.length + 1).fill(0);\n    memo[i][0] = i;\n  }\n  for (let j = 0; j < strB.length; j++) {\n    memo[0][j] = j;\n  }\n  for (let i = 1; i <= strA.length; i++) {\n    let ch = strA.charCodeAt(i - 1);\n    for (let j = 1; j <= strB.length; j++) {\n      if (Math.abs(i - j) >= cap) {\n        memo[i][j] = cap;\n        continue;\n      }\n      memo[i][j] = Math.min(\n        memo[i - 1][j] + 1,\n        memo[i][j - 1] + 1,\n        memo[i - 1][j - 1] + (ch === strB.charCodeAt(j - 1) ? 0 : 1)\n      );\n    }\n  }\n  return memo[strA.length][strB.length];\n}\n__name(stringDistanceCapped, \"stringDistanceCapped\");\n\n// lib/chai/utils/addMethod.js\nfunction addMethod(ctx, name, method) {\n  let methodWrapper = /* @__PURE__ */ __name(function() {\n    if (!flag(this, \"lockSsfi\")) {\n      flag(this, \"ssfi\", methodWrapper);\n    }\n    let result = method.apply(this, arguments);\n    if (result !== void 0) return result;\n    let newAssertion = new Assertion();\n    transferFlags(this, newAssertion);\n    return newAssertion;\n  }, \"methodWrapper\");\n  addLengthGuard(methodWrapper, name, false);\n  ctx[name] = proxify(methodWrapper, name);\n  events.dispatchEvent(new PluginEvent(\"addMethod\", name, method));\n}\n__name(addMethod, \"addMethod\");\n\n// lib/chai/utils/overwriteProperty.js\nfunction overwriteProperty(ctx, name, getter) {\n  let _get = Object.getOwnPropertyDescriptor(ctx, name), _super = /* @__PURE__ */ __name(function() {\n  }, \"_super\");\n  if (_get && \"function\" === typeof _get.get) _super = _get.get;\n  Object.defineProperty(ctx, name, {\n    get: /* @__PURE__ */ __name(function overwritingPropertyGetter() {\n      if (!isProxyEnabled() && !flag(this, \"lockSsfi\")) {\n        flag(this, \"ssfi\", overwritingPropertyGetter);\n      }\n      let origLockSsfi = flag(this, \"lockSsfi\");\n      flag(this, \"lockSsfi\", true);\n      let result = getter(_super).call(this);\n      flag(this, \"lockSsfi\", origLockSsfi);\n      if (result !== void 0) {\n        return result;\n      }\n      let newAssertion = new Assertion();\n      transferFlags(this, newAssertion);\n      return newAssertion;\n    }, \"overwritingPropertyGetter\"),\n    configurable: true\n  });\n}\n__name(overwriteProperty, \"overwriteProperty\");\n\n// lib/chai/utils/overwriteMethod.js\nfunction overwriteMethod(ctx, name, method) {\n  let _method = ctx[name], _super = /* @__PURE__ */ __name(function() {\n    throw new Error(name + \" is not a function\");\n  }, \"_super\");\n  if (_method && \"function\" === typeof _method) _super = _method;\n  let overwritingMethodWrapper = /* @__PURE__ */ __name(function() {\n    if (!flag(this, \"lockSsfi\")) {\n      flag(this, \"ssfi\", overwritingMethodWrapper);\n    }\n    let origLockSsfi = flag(this, \"lockSsfi\");\n    flag(this, \"lockSsfi\", true);\n    let result = method(_super).apply(this, arguments);\n    flag(this, \"lockSsfi\", origLockSsfi);\n    if (result !== void 0) {\n      return result;\n    }\n    let newAssertion = new Assertion();\n    transferFlags(this, newAssertion);\n    return newAssertion;\n  }, \"overwritingMethodWrapper\");\n  addLengthGuard(overwritingMethodWrapper, name, false);\n  ctx[name] = proxify(overwritingMethodWrapper, name);\n}\n__name(overwriteMethod, \"overwriteMethod\");\n\n// lib/chai/utils/addChainableMethod.js\nvar canSetPrototype = typeof Object.setPrototypeOf === \"function\";\nvar testFn = /* @__PURE__ */ __name(function() {\n}, \"testFn\");\nvar excludeNames = Object.getOwnPropertyNames(testFn).filter(function(name) {\n  let propDesc = Object.getOwnPropertyDescriptor(testFn, name);\n  if (typeof propDesc !== \"object\") return true;\n  return !propDesc.configurable;\n});\nvar call = Function.prototype.call;\nvar apply = Function.prototype.apply;\nvar _PluginAddChainableMethodEvent = class _PluginAddChainableMethodEvent extends PluginEvent {\n  constructor(type3, name, fn, chainingBehavior) {\n    super(type3, name, fn);\n    this.chainingBehavior = chainingBehavior;\n  }\n};\n__name(_PluginAddChainableMethodEvent, \"PluginAddChainableMethodEvent\");\nvar PluginAddChainableMethodEvent = _PluginAddChainableMethodEvent;\nfunction addChainableMethod(ctx, name, method, chainingBehavior) {\n  if (typeof chainingBehavior !== \"function\") {\n    chainingBehavior = /* @__PURE__ */ __name(function() {\n    }, \"chainingBehavior\");\n  }\n  let chainableBehavior = {\n    method,\n    chainingBehavior\n  };\n  if (!ctx.__methods) {\n    ctx.__methods = {};\n  }\n  ctx.__methods[name] = chainableBehavior;\n  Object.defineProperty(ctx, name, {\n    get: /* @__PURE__ */ __name(function chainableMethodGetter() {\n      chainableBehavior.chainingBehavior.call(this);\n      let chainableMethodWrapper = /* @__PURE__ */ __name(function() {\n        if (!flag(this, \"lockSsfi\")) {\n          flag(this, \"ssfi\", chainableMethodWrapper);\n        }\n        let result = chainableBehavior.method.apply(this, arguments);\n        if (result !== void 0) {\n          return result;\n        }\n        let newAssertion = new Assertion();\n        transferFlags(this, newAssertion);\n        return newAssertion;\n      }, \"chainableMethodWrapper\");\n      addLengthGuard(chainableMethodWrapper, name, true);\n      if (canSetPrototype) {\n        let prototype = Object.create(this);\n        prototype.call = call;\n        prototype.apply = apply;\n        Object.setPrototypeOf(chainableMethodWrapper, prototype);\n      } else {\n        let asserterNames = Object.getOwnPropertyNames(ctx);\n        asserterNames.forEach(function(asserterName) {\n          if (excludeNames.indexOf(asserterName) !== -1) {\n            return;\n          }\n          let pd = Object.getOwnPropertyDescriptor(ctx, asserterName);\n          Object.defineProperty(chainableMethodWrapper, asserterName, pd);\n        });\n      }\n      transferFlags(this, chainableMethodWrapper);\n      return proxify(chainableMethodWrapper);\n    }, \"chainableMethodGetter\"),\n    configurable: true\n  });\n  events.dispatchEvent(\n    new PluginAddChainableMethodEvent(\n      \"addChainableMethod\",\n      name,\n      method,\n      chainingBehavior\n    )\n  );\n}\n__name(addChainableMethod, \"addChainableMethod\");\n\n// lib/chai/utils/overwriteChainableMethod.js\nfunction overwriteChainableMethod(ctx, name, method, chainingBehavior) {\n  let chainableBehavior = ctx.__methods[name];\n  let _chainingBehavior = chainableBehavior.chainingBehavior;\n  chainableBehavior.chainingBehavior = /* @__PURE__ */ __name(function overwritingChainableMethodGetter() {\n    let result = chainingBehavior(_chainingBehavior).call(this);\n    if (result !== void 0) {\n      return result;\n    }\n    let newAssertion = new Assertion();\n    transferFlags(this, newAssertion);\n    return newAssertion;\n  }, \"overwritingChainableMethodGetter\");\n  let _method = chainableBehavior.method;\n  chainableBehavior.method = /* @__PURE__ */ __name(function overwritingChainableMethodWrapper() {\n    let result = method(_method).apply(this, arguments);\n    if (result !== void 0) {\n      return result;\n    }\n    let newAssertion = new Assertion();\n    transferFlags(this, newAssertion);\n    return newAssertion;\n  }, \"overwritingChainableMethodWrapper\");\n}\n__name(overwriteChainableMethod, \"overwriteChainableMethod\");\n\n// lib/chai/utils/compareByInspect.js\nfunction compareByInspect(a, b) {\n  return inspect2(a) < inspect2(b) ? -1 : 1;\n}\n__name(compareByInspect, \"compareByInspect\");\n\n// lib/chai/utils/getOwnEnumerablePropertySymbols.js\nfunction getOwnEnumerablePropertySymbols(obj) {\n  if (typeof Object.getOwnPropertySymbols !== \"function\") return [];\n  return Object.getOwnPropertySymbols(obj).filter(function(sym) {\n    return Object.getOwnPropertyDescriptor(obj, sym).enumerable;\n  });\n}\n__name(getOwnEnumerablePropertySymbols, \"getOwnEnumerablePropertySymbols\");\n\n// lib/chai/utils/getOwnEnumerableProperties.js\nfunction getOwnEnumerableProperties(obj) {\n  return Object.keys(obj).concat(getOwnEnumerablePropertySymbols(obj));\n}\n__name(getOwnEnumerableProperties, \"getOwnEnumerableProperties\");\n\n// lib/chai/utils/isNaN.js\nvar isNaN2 = Number.isNaN;\n\n// lib/chai/utils/getOperator.js\nfunction isObjectType(obj) {\n  let objectType = type(obj);\n  let objectTypes = [\"Array\", \"Object\", \"Function\"];\n  return objectTypes.indexOf(objectType) !== -1;\n}\n__name(isObjectType, \"isObjectType\");\nfunction getOperator(obj, args) {\n  let operator = flag(obj, \"operator\");\n  let negate = flag(obj, \"negate\");\n  let expected = args[3];\n  let msg = negate ? args[2] : args[1];\n  if (operator) {\n    return operator;\n  }\n  if (typeof msg === \"function\") msg = msg();\n  msg = msg || \"\";\n  if (!msg) {\n    return void 0;\n  }\n  if (/\\shave\\s/.test(msg)) {\n    return void 0;\n  }\n  let isObject = isObjectType(expected);\n  if (/\\snot\\s/.test(msg)) {\n    return isObject ? \"notDeepStrictEqual\" : \"notStrictEqual\";\n  }\n  return isObject ? \"deepStrictEqual\" : \"strictEqual\";\n}\n__name(getOperator, \"getOperator\");\n\n// lib/chai/utils/index.js\nfunction getName(fn) {\n  return fn.name;\n}\n__name(getName, \"getName\");\nfunction isRegExp2(obj) {\n  return Object.prototype.toString.call(obj) === \"[object RegExp]\";\n}\n__name(isRegExp2, \"isRegExp\");\nfunction isNumeric(obj) {\n  return [\"Number\", \"BigInt\"].includes(type(obj));\n}\n__name(isNumeric, \"isNumeric\");\n\n// lib/chai/core/assertions.js\nvar { flag: flag2 } = utils_exports;\n[\n  \"to\",\n  \"be\",\n  \"been\",\n  \"is\",\n  \"and\",\n  \"has\",\n  \"have\",\n  \"with\",\n  \"that\",\n  \"which\",\n  \"at\",\n  \"of\",\n  \"same\",\n  \"but\",\n  \"does\",\n  \"still\",\n  \"also\"\n].forEach(function(chain) {\n  Assertion.addProperty(chain);\n});\nAssertion.addProperty(\"not\", function() {\n  flag2(this, \"negate\", true);\n});\nAssertion.addProperty(\"deep\", function() {\n  flag2(this, \"deep\", true);\n});\nAssertion.addProperty(\"nested\", function() {\n  flag2(this, \"nested\", true);\n});\nAssertion.addProperty(\"own\", function() {\n  flag2(this, \"own\", true);\n});\nAssertion.addProperty(\"ordered\", function() {\n  flag2(this, \"ordered\", true);\n});\nAssertion.addProperty(\"any\", function() {\n  flag2(this, \"any\", true);\n  flag2(this, \"all\", false);\n});\nAssertion.addProperty(\"all\", function() {\n  flag2(this, \"all\", true);\n  flag2(this, \"any\", false);\n});\nvar functionTypes = {\n  function: [\n    \"function\",\n    \"asyncfunction\",\n    \"generatorfunction\",\n    \"asyncgeneratorfunction\"\n  ],\n  asyncfunction: [\"asyncfunction\", \"asyncgeneratorfunction\"],\n  generatorfunction: [\"generatorfunction\", \"asyncgeneratorfunction\"],\n  asyncgeneratorfunction: [\"asyncgeneratorfunction\"]\n};\nfunction an(type3, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  type3 = type3.toLowerCase();\n  let obj = flag2(this, \"object\"), article = ~[\"a\", \"e\", \"i\", \"o\", \"u\"].indexOf(type3.charAt(0)) ? \"an \" : \"a \";\n  const detectedType = type(obj).toLowerCase();\n  if (functionTypes[\"function\"].includes(type3)) {\n    this.assert(\n      functionTypes[type3].includes(detectedType),\n      \"expected #{this} to be \" + article + type3,\n      \"expected #{this} not to be \" + article + type3\n    );\n  } else {\n    this.assert(\n      type3 === detectedType,\n      \"expected #{this} to be \" + article + type3,\n      \"expected #{this} not to be \" + article + type3\n    );\n  }\n}\n__name(an, \"an\");\nAssertion.addChainableMethod(\"an\", an);\nAssertion.addChainableMethod(\"a\", an);\nfunction SameValueZero(a, b) {\n  return isNaN2(a) && isNaN2(b) || a === b;\n}\n__name(SameValueZero, \"SameValueZero\");\nfunction includeChainingBehavior() {\n  flag2(this, \"contains\", true);\n}\n__name(includeChainingBehavior, \"includeChainingBehavior\");\nfunction include(val, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\"), objType = type(obj).toLowerCase(), flagMsg = flag2(this, \"message\"), negate = flag2(this, \"negate\"), ssfi = flag2(this, \"ssfi\"), isDeep = flag2(this, \"deep\"), descriptor = isDeep ? \"deep \" : \"\", isEql = isDeep ? flag2(this, \"eql\") : SameValueZero;\n  flagMsg = flagMsg ? flagMsg + \": \" : \"\";\n  let included = false;\n  switch (objType) {\n    case \"string\":\n      included = obj.indexOf(val) !== -1;\n      break;\n    case \"weakset\":\n      if (isDeep) {\n        throw new AssertionError(\n          flagMsg + \"unable to use .deep.include with WeakSet\",\n          void 0,\n          ssfi\n        );\n      }\n      included = obj.has(val);\n      break;\n    case \"map\":\n      obj.forEach(function(item) {\n        included = included || isEql(item, val);\n      });\n      break;\n    case \"set\":\n      if (isDeep) {\n        obj.forEach(function(item) {\n          included = included || isEql(item, val);\n        });\n      } else {\n        included = obj.has(val);\n      }\n      break;\n    case \"array\":\n      if (isDeep) {\n        included = obj.some(function(item) {\n          return isEql(item, val);\n        });\n      } else {\n        included = obj.indexOf(val) !== -1;\n      }\n      break;\n    default: {\n      if (val !== Object(val)) {\n        throw new AssertionError(\n          flagMsg + \"the given combination of arguments (\" + objType + \" and \" + type(val).toLowerCase() + \") is invalid for this assertion. You can use an array, a map, an object, a set, a string, or a weakset instead of a \" + type(val).toLowerCase(),\n          void 0,\n          ssfi\n        );\n      }\n      let props = Object.keys(val);\n      let firstErr = null;\n      let numErrs = 0;\n      props.forEach(function(prop) {\n        let propAssertion = new Assertion(obj);\n        transferFlags(this, propAssertion, true);\n        flag2(propAssertion, \"lockSsfi\", true);\n        if (!negate || props.length === 1) {\n          propAssertion.property(prop, val[prop]);\n          return;\n        }\n        try {\n          propAssertion.property(prop, val[prop]);\n        } catch (err) {\n          if (!check_error_exports.compatibleConstructor(err, AssertionError)) {\n            throw err;\n          }\n          if (firstErr === null) firstErr = err;\n          numErrs++;\n        }\n      }, this);\n      if (negate && props.length > 1 && numErrs === props.length) {\n        throw firstErr;\n      }\n      return;\n    }\n  }\n  this.assert(\n    included,\n    \"expected #{this} to \" + descriptor + \"include \" + inspect2(val),\n    \"expected #{this} to not \" + descriptor + \"include \" + inspect2(val)\n  );\n}\n__name(include, \"include\");\nAssertion.addChainableMethod(\"include\", include, includeChainingBehavior);\nAssertion.addChainableMethod(\"contain\", include, includeChainingBehavior);\nAssertion.addChainableMethod(\"contains\", include, includeChainingBehavior);\nAssertion.addChainableMethod(\"includes\", include, includeChainingBehavior);\nAssertion.addProperty(\"ok\", function() {\n  this.assert(\n    flag2(this, \"object\"),\n    \"expected #{this} to be truthy\",\n    \"expected #{this} to be falsy\"\n  );\n});\nAssertion.addProperty(\"true\", function() {\n  this.assert(\n    true === flag2(this, \"object\"),\n    \"expected #{this} to be true\",\n    \"expected #{this} to be false\",\n    flag2(this, \"negate\") ? false : true\n  );\n});\nAssertion.addProperty(\"numeric\", function() {\n  const object = flag2(this, \"object\");\n  this.assert(\n    [\"Number\", \"BigInt\"].includes(type(object)),\n    \"expected #{this} to be numeric\",\n    \"expected #{this} to not be numeric\",\n    flag2(this, \"negate\") ? false : true\n  );\n});\nAssertion.addProperty(\"callable\", function() {\n  const val = flag2(this, \"object\");\n  const ssfi = flag2(this, \"ssfi\");\n  const message = flag2(this, \"message\");\n  const msg = message ? `${message}: ` : \"\";\n  const negate = flag2(this, \"negate\");\n  const assertionMessage = negate ? `${msg}expected ${inspect2(val)} not to be a callable function` : `${msg}expected ${inspect2(val)} to be a callable function`;\n  const isCallable = [\n    \"Function\",\n    \"AsyncFunction\",\n    \"GeneratorFunction\",\n    \"AsyncGeneratorFunction\"\n  ].includes(type(val));\n  if (isCallable && negate || !isCallable && !negate) {\n    throw new AssertionError(assertionMessage, void 0, ssfi);\n  }\n});\nAssertion.addProperty(\"false\", function() {\n  this.assert(\n    false === flag2(this, \"object\"),\n    \"expected #{this} to be false\",\n    \"expected #{this} to be true\",\n    flag2(this, \"negate\") ? true : false\n  );\n});\nAssertion.addProperty(\"null\", function() {\n  this.assert(\n    null === flag2(this, \"object\"),\n    \"expected #{this} to be null\",\n    \"expected #{this} not to be null\"\n  );\n});\nAssertion.addProperty(\"undefined\", function() {\n  this.assert(\n    void 0 === flag2(this, \"object\"),\n    \"expected #{this} to be undefined\",\n    \"expected #{this} not to be undefined\"\n  );\n});\nAssertion.addProperty(\"NaN\", function() {\n  this.assert(\n    isNaN2(flag2(this, \"object\")),\n    \"expected #{this} to be NaN\",\n    \"expected #{this} not to be NaN\"\n  );\n});\nfunction assertExist() {\n  let val = flag2(this, \"object\");\n  this.assert(\n    val !== null && val !== void 0,\n    \"expected #{this} to exist\",\n    \"expected #{this} to not exist\"\n  );\n}\n__name(assertExist, \"assertExist\");\nAssertion.addProperty(\"exist\", assertExist);\nAssertion.addProperty(\"exists\", assertExist);\nAssertion.addProperty(\"empty\", function() {\n  let val = flag2(this, \"object\"), ssfi = flag2(this, \"ssfi\"), flagMsg = flag2(this, \"message\"), itemsCount;\n  flagMsg = flagMsg ? flagMsg + \": \" : \"\";\n  switch (type(val).toLowerCase()) {\n    case \"array\":\n    case \"string\":\n      itemsCount = val.length;\n      break;\n    case \"map\":\n    case \"set\":\n      itemsCount = val.size;\n      break;\n    case \"weakmap\":\n    case \"weakset\":\n      throw new AssertionError(\n        flagMsg + \".empty was passed a weak collection\",\n        void 0,\n        ssfi\n      );\n    case \"function\": {\n      const msg = flagMsg + \".empty was passed a function \" + getName(val);\n      throw new AssertionError(msg.trim(), void 0, ssfi);\n    }\n    default:\n      if (val !== Object(val)) {\n        throw new AssertionError(\n          flagMsg + \".empty was passed non-string primitive \" + inspect2(val),\n          void 0,\n          ssfi\n        );\n      }\n      itemsCount = Object.keys(val).length;\n  }\n  this.assert(\n    0 === itemsCount,\n    \"expected #{this} to be empty\",\n    \"expected #{this} not to be empty\"\n  );\n});\nfunction checkArguments() {\n  let obj = flag2(this, \"object\"), type3 = type(obj);\n  this.assert(\n    \"Arguments\" === type3,\n    \"expected #{this} to be arguments but got \" + type3,\n    \"expected #{this} to not be arguments\"\n  );\n}\n__name(checkArguments, \"checkArguments\");\nAssertion.addProperty(\"arguments\", checkArguments);\nAssertion.addProperty(\"Arguments\", checkArguments);\nfunction assertEqual(val, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\");\n  if (flag2(this, \"deep\")) {\n    let prevLockSsfi = flag2(this, \"lockSsfi\");\n    flag2(this, \"lockSsfi\", true);\n    this.eql(val);\n    flag2(this, \"lockSsfi\", prevLockSsfi);\n  } else {\n    this.assert(\n      val === obj,\n      \"expected #{this} to equal #{exp}\",\n      \"expected #{this} to not equal #{exp}\",\n      val,\n      this._obj,\n      true\n    );\n  }\n}\n__name(assertEqual, \"assertEqual\");\nAssertion.addMethod(\"equal\", assertEqual);\nAssertion.addMethod(\"equals\", assertEqual);\nAssertion.addMethod(\"eq\", assertEqual);\nfunction assertEql(obj, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let eql = flag2(this, \"eql\");\n  this.assert(\n    eql(obj, flag2(this, \"object\")),\n    \"expected #{this} to deeply equal #{exp}\",\n    \"expected #{this} to not deeply equal #{exp}\",\n    obj,\n    this._obj,\n    true\n  );\n}\n__name(assertEql, \"assertEql\");\nAssertion.addMethod(\"eql\", assertEql);\nAssertion.addMethod(\"eqls\", assertEql);\nfunction assertAbove(n, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\"), doLength = flag2(this, \"doLength\"), flagMsg = flag2(this, \"message\"), msgPrefix = flagMsg ? flagMsg + \": \" : \"\", ssfi = flag2(this, \"ssfi\"), objType = type(obj).toLowerCase(), nType = type(n).toLowerCase();\n  if (doLength && objType !== \"map\" && objType !== \"set\") {\n    new Assertion(obj, flagMsg, ssfi, true).to.have.property(\"length\");\n  }\n  if (!doLength && objType === \"date\" && nType !== \"date\") {\n    throw new AssertionError(\n      msgPrefix + \"the argument to above must be a date\",\n      void 0,\n      ssfi\n    );\n  } else if (!isNumeric(n) && (doLength || isNumeric(obj))) {\n    throw new AssertionError(\n      msgPrefix + \"the argument to above must be a number\",\n      void 0,\n      ssfi\n    );\n  } else if (!doLength && objType !== \"date\" && !isNumeric(obj)) {\n    let printObj = objType === \"string\" ? \"'\" + obj + \"'\" : obj;\n    throw new AssertionError(\n      msgPrefix + \"expected \" + printObj + \" to be a number or a date\",\n      void 0,\n      ssfi\n    );\n  }\n  if (doLength) {\n    let descriptor = \"length\", itemsCount;\n    if (objType === \"map\" || objType === \"set\") {\n      descriptor = \"size\";\n      itemsCount = obj.size;\n    } else {\n      itemsCount = obj.length;\n    }\n    this.assert(\n      itemsCount > n,\n      \"expected #{this} to have a \" + descriptor + \" above #{exp} but got #{act}\",\n      \"expected #{this} to not have a \" + descriptor + \" above #{exp}\",\n      n,\n      itemsCount\n    );\n  } else {\n    this.assert(\n      obj > n,\n      \"expected #{this} to be above #{exp}\",\n      \"expected #{this} to be at most #{exp}\",\n      n\n    );\n  }\n}\n__name(assertAbove, \"assertAbove\");\nAssertion.addMethod(\"above\", assertAbove);\nAssertion.addMethod(\"gt\", assertAbove);\nAssertion.addMethod(\"greaterThan\", assertAbove);\nfunction assertLeast(n, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\"), doLength = flag2(this, \"doLength\"), flagMsg = flag2(this, \"message\"), msgPrefix = flagMsg ? flagMsg + \": \" : \"\", ssfi = flag2(this, \"ssfi\"), objType = type(obj).toLowerCase(), nType = type(n).toLowerCase(), errorMessage, shouldThrow = true;\n  if (doLength && objType !== \"map\" && objType !== \"set\") {\n    new Assertion(obj, flagMsg, ssfi, true).to.have.property(\"length\");\n  }\n  if (!doLength && objType === \"date\" && nType !== \"date\") {\n    errorMessage = msgPrefix + \"the argument to least must be a date\";\n  } else if (!isNumeric(n) && (doLength || isNumeric(obj))) {\n    errorMessage = msgPrefix + \"the argument to least must be a number\";\n  } else if (!doLength && objType !== \"date\" && !isNumeric(obj)) {\n    let printObj = objType === \"string\" ? \"'\" + obj + \"'\" : obj;\n    errorMessage = msgPrefix + \"expected \" + printObj + \" to be a number or a date\";\n  } else {\n    shouldThrow = false;\n  }\n  if (shouldThrow) {\n    throw new AssertionError(errorMessage, void 0, ssfi);\n  }\n  if (doLength) {\n    let descriptor = \"length\", itemsCount;\n    if (objType === \"map\" || objType === \"set\") {\n      descriptor = \"size\";\n      itemsCount = obj.size;\n    } else {\n      itemsCount = obj.length;\n    }\n    this.assert(\n      itemsCount >= n,\n      \"expected #{this} to have a \" + descriptor + \" at least #{exp} but got #{act}\",\n      \"expected #{this} to have a \" + descriptor + \" below #{exp}\",\n      n,\n      itemsCount\n    );\n  } else {\n    this.assert(\n      obj >= n,\n      \"expected #{this} to be at least #{exp}\",\n      \"expected #{this} to be below #{exp}\",\n      n\n    );\n  }\n}\n__name(assertLeast, \"assertLeast\");\nAssertion.addMethod(\"least\", assertLeast);\nAssertion.addMethod(\"gte\", assertLeast);\nAssertion.addMethod(\"greaterThanOrEqual\", assertLeast);\nfunction assertBelow(n, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\"), doLength = flag2(this, \"doLength\"), flagMsg = flag2(this, \"message\"), msgPrefix = flagMsg ? flagMsg + \": \" : \"\", ssfi = flag2(this, \"ssfi\"), objType = type(obj).toLowerCase(), nType = type(n).toLowerCase(), errorMessage, shouldThrow = true;\n  if (doLength && objType !== \"map\" && objType !== \"set\") {\n    new Assertion(obj, flagMsg, ssfi, true).to.have.property(\"length\");\n  }\n  if (!doLength && objType === \"date\" && nType !== \"date\") {\n    errorMessage = msgPrefix + \"the argument to below must be a date\";\n  } else if (!isNumeric(n) && (doLength || isNumeric(obj))) {\n    errorMessage = msgPrefix + \"the argument to below must be a number\";\n  } else if (!doLength && objType !== \"date\" && !isNumeric(obj)) {\n    let printObj = objType === \"string\" ? \"'\" + obj + \"'\" : obj;\n    errorMessage = msgPrefix + \"expected \" + printObj + \" to be a number or a date\";\n  } else {\n    shouldThrow = false;\n  }\n  if (shouldThrow) {\n    throw new AssertionError(errorMessage, void 0, ssfi);\n  }\n  if (doLength) {\n    let descriptor = \"length\", itemsCount;\n    if (objType === \"map\" || objType === \"set\") {\n      descriptor = \"size\";\n      itemsCount = obj.size;\n    } else {\n      itemsCount = obj.length;\n    }\n    this.assert(\n      itemsCount < n,\n      \"expected #{this} to have a \" + descriptor + \" below #{exp} but got #{act}\",\n      \"expected #{this} to not have a \" + descriptor + \" below #{exp}\",\n      n,\n      itemsCount\n    );\n  } else {\n    this.assert(\n      obj < n,\n      \"expected #{this} to be below #{exp}\",\n      \"expected #{this} to be at least #{exp}\",\n      n\n    );\n  }\n}\n__name(assertBelow, \"assertBelow\");\nAssertion.addMethod(\"below\", assertBelow);\nAssertion.addMethod(\"lt\", assertBelow);\nAssertion.addMethod(\"lessThan\", assertBelow);\nfunction assertMost(n, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\"), doLength = flag2(this, \"doLength\"), flagMsg = flag2(this, \"message\"), msgPrefix = flagMsg ? flagMsg + \": \" : \"\", ssfi = flag2(this, \"ssfi\"), objType = type(obj).toLowerCase(), nType = type(n).toLowerCase(), errorMessage, shouldThrow = true;\n  if (doLength && objType !== \"map\" && objType !== \"set\") {\n    new Assertion(obj, flagMsg, ssfi, true).to.have.property(\"length\");\n  }\n  if (!doLength && objType === \"date\" && nType !== \"date\") {\n    errorMessage = msgPrefix + \"the argument to most must be a date\";\n  } else if (!isNumeric(n) && (doLength || isNumeric(obj))) {\n    errorMessage = msgPrefix + \"the argument to most must be a number\";\n  } else if (!doLength && objType !== \"date\" && !isNumeric(obj)) {\n    let printObj = objType === \"string\" ? \"'\" + obj + \"'\" : obj;\n    errorMessage = msgPrefix + \"expected \" + printObj + \" to be a number or a date\";\n  } else {\n    shouldThrow = false;\n  }\n  if (shouldThrow) {\n    throw new AssertionError(errorMessage, void 0, ssfi);\n  }\n  if (doLength) {\n    let descriptor = \"length\", itemsCount;\n    if (objType === \"map\" || objType === \"set\") {\n      descriptor = \"size\";\n      itemsCount = obj.size;\n    } else {\n      itemsCount = obj.length;\n    }\n    this.assert(\n      itemsCount <= n,\n      \"expected #{this} to have a \" + descriptor + \" at most #{exp} but got #{act}\",\n      \"expected #{this} to have a \" + descriptor + \" above #{exp}\",\n      n,\n      itemsCount\n    );\n  } else {\n    this.assert(\n      obj <= n,\n      \"expected #{this} to be at most #{exp}\",\n      \"expected #{this} to be above #{exp}\",\n      n\n    );\n  }\n}\n__name(assertMost, \"assertMost\");\nAssertion.addMethod(\"most\", assertMost);\nAssertion.addMethod(\"lte\", assertMost);\nAssertion.addMethod(\"lessThanOrEqual\", assertMost);\nAssertion.addMethod(\"within\", function(start, finish, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\"), doLength = flag2(this, \"doLength\"), flagMsg = flag2(this, \"message\"), msgPrefix = flagMsg ? flagMsg + \": \" : \"\", ssfi = flag2(this, \"ssfi\"), objType = type(obj).toLowerCase(), startType = type(start).toLowerCase(), finishType = type(finish).toLowerCase(), errorMessage, shouldThrow = true, range = startType === \"date\" && finishType === \"date\" ? start.toISOString() + \"..\" + finish.toISOString() : start + \"..\" + finish;\n  if (doLength && objType !== \"map\" && objType !== \"set\") {\n    new Assertion(obj, flagMsg, ssfi, true).to.have.property(\"length\");\n  }\n  if (!doLength && objType === \"date\" && (startType !== \"date\" || finishType !== \"date\")) {\n    errorMessage = msgPrefix + \"the arguments to within must be dates\";\n  } else if ((!isNumeric(start) || !isNumeric(finish)) && (doLength || isNumeric(obj))) {\n    errorMessage = msgPrefix + \"the arguments to within must be numbers\";\n  } else if (!doLength && objType !== \"date\" && !isNumeric(obj)) {\n    let printObj = objType === \"string\" ? \"'\" + obj + \"'\" : obj;\n    errorMessage = msgPrefix + \"expected \" + printObj + \" to be a number or a date\";\n  } else {\n    shouldThrow = false;\n  }\n  if (shouldThrow) {\n    throw new AssertionError(errorMessage, void 0, ssfi);\n  }\n  if (doLength) {\n    let descriptor = \"length\", itemsCount;\n    if (objType === \"map\" || objType === \"set\") {\n      descriptor = \"size\";\n      itemsCount = obj.size;\n    } else {\n      itemsCount = obj.length;\n    }\n    this.assert(\n      itemsCount >= start && itemsCount <= finish,\n      \"expected #{this} to have a \" + descriptor + \" within \" + range,\n      \"expected #{this} to not have a \" + descriptor + \" within \" + range\n    );\n  } else {\n    this.assert(\n      obj >= start && obj <= finish,\n      \"expected #{this} to be within \" + range,\n      \"expected #{this} to not be within \" + range\n    );\n  }\n});\nfunction assertInstanceOf(constructor, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let target = flag2(this, \"object\");\n  let ssfi = flag2(this, \"ssfi\");\n  let flagMsg = flag2(this, \"message\");\n  let isInstanceOf;\n  try {\n    isInstanceOf = target instanceof constructor;\n  } catch (err) {\n    if (err instanceof TypeError) {\n      flagMsg = flagMsg ? flagMsg + \": \" : \"\";\n      throw new AssertionError(\n        flagMsg + \"The instanceof assertion needs a constructor but \" + type(constructor) + \" was given.\",\n        void 0,\n        ssfi\n      );\n    }\n    throw err;\n  }\n  let name = getName(constructor);\n  if (name == null) {\n    name = \"an unnamed constructor\";\n  }\n  this.assert(\n    isInstanceOf,\n    \"expected #{this} to be an instance of \" + name,\n    \"expected #{this} to not be an instance of \" + name\n  );\n}\n__name(assertInstanceOf, \"assertInstanceOf\");\nAssertion.addMethod(\"instanceof\", assertInstanceOf);\nAssertion.addMethod(\"instanceOf\", assertInstanceOf);\nfunction assertProperty(name, val, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let isNested = flag2(this, \"nested\"), isOwn = flag2(this, \"own\"), flagMsg = flag2(this, \"message\"), obj = flag2(this, \"object\"), ssfi = flag2(this, \"ssfi\"), nameType = typeof name;\n  flagMsg = flagMsg ? flagMsg + \": \" : \"\";\n  if (isNested) {\n    if (nameType !== \"string\") {\n      throw new AssertionError(\n        flagMsg + \"the argument to property must be a string when using nested syntax\",\n        void 0,\n        ssfi\n      );\n    }\n  } else {\n    if (nameType !== \"string\" && nameType !== \"number\" && nameType !== \"symbol\") {\n      throw new AssertionError(\n        flagMsg + \"the argument to property must be a string, number, or symbol\",\n        void 0,\n        ssfi\n      );\n    }\n  }\n  if (isNested && isOwn) {\n    throw new AssertionError(\n      flagMsg + 'The \"nested\" and \"own\" flags cannot be combined.',\n      void 0,\n      ssfi\n    );\n  }\n  if (obj === null || obj === void 0) {\n    throw new AssertionError(\n      flagMsg + \"Target cannot be null or undefined.\",\n      void 0,\n      ssfi\n    );\n  }\n  let isDeep = flag2(this, \"deep\"), negate = flag2(this, \"negate\"), pathInfo = isNested ? getPathInfo(obj, name) : null, value = isNested ? pathInfo.value : obj[name], isEql = isDeep ? flag2(this, \"eql\") : (val1, val2) => val1 === val2;\n  let descriptor = \"\";\n  if (isDeep) descriptor += \"deep \";\n  if (isOwn) descriptor += \"own \";\n  if (isNested) descriptor += \"nested \";\n  descriptor += \"property \";\n  let hasProperty2;\n  if (isOwn) hasProperty2 = Object.prototype.hasOwnProperty.call(obj, name);\n  else if (isNested) hasProperty2 = pathInfo.exists;\n  else hasProperty2 = hasProperty(obj, name);\n  if (!negate || arguments.length === 1) {\n    this.assert(\n      hasProperty2,\n      \"expected #{this} to have \" + descriptor + inspect2(name),\n      \"expected #{this} to not have \" + descriptor + inspect2(name)\n    );\n  }\n  if (arguments.length > 1) {\n    this.assert(\n      hasProperty2 && isEql(val, value),\n      \"expected #{this} to have \" + descriptor + inspect2(name) + \" of #{exp}, but got #{act}\",\n      \"expected #{this} to not have \" + descriptor + inspect2(name) + \" of #{act}\",\n      val,\n      value\n    );\n  }\n  flag2(this, \"object\", value);\n}\n__name(assertProperty, \"assertProperty\");\nAssertion.addMethod(\"property\", assertProperty);\nfunction assertOwnProperty(_name, _value, _msg) {\n  flag2(this, \"own\", true);\n  assertProperty.apply(this, arguments);\n}\n__name(assertOwnProperty, \"assertOwnProperty\");\nAssertion.addMethod(\"ownProperty\", assertOwnProperty);\nAssertion.addMethod(\"haveOwnProperty\", assertOwnProperty);\nfunction assertOwnPropertyDescriptor(name, descriptor, msg) {\n  if (typeof descriptor === \"string\") {\n    msg = descriptor;\n    descriptor = null;\n  }\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\");\n  let actualDescriptor = Object.getOwnPropertyDescriptor(Object(obj), name);\n  let eql = flag2(this, \"eql\");\n  if (actualDescriptor && descriptor) {\n    this.assert(\n      eql(descriptor, actualDescriptor),\n      \"expected the own property descriptor for \" + inspect2(name) + \" on #{this} to match \" + inspect2(descriptor) + \", got \" + inspect2(actualDescriptor),\n      \"expected the own property descriptor for \" + inspect2(name) + \" on #{this} to not match \" + inspect2(descriptor),\n      descriptor,\n      actualDescriptor,\n      true\n    );\n  } else {\n    this.assert(\n      actualDescriptor,\n      \"expected #{this} to have an own property descriptor for \" + inspect2(name),\n      \"expected #{this} to not have an own property descriptor for \" + inspect2(name)\n    );\n  }\n  flag2(this, \"object\", actualDescriptor);\n}\n__name(assertOwnPropertyDescriptor, \"assertOwnPropertyDescriptor\");\nAssertion.addMethod(\"ownPropertyDescriptor\", assertOwnPropertyDescriptor);\nAssertion.addMethod(\"haveOwnPropertyDescriptor\", assertOwnPropertyDescriptor);\nfunction assertLengthChain() {\n  flag2(this, \"doLength\", true);\n}\n__name(assertLengthChain, \"assertLengthChain\");\nfunction assertLength(n, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\"), objType = type(obj).toLowerCase(), flagMsg = flag2(this, \"message\"), ssfi = flag2(this, \"ssfi\"), descriptor = \"length\", itemsCount;\n  switch (objType) {\n    case \"map\":\n    case \"set\":\n      descriptor = \"size\";\n      itemsCount = obj.size;\n      break;\n    default:\n      new Assertion(obj, flagMsg, ssfi, true).to.have.property(\"length\");\n      itemsCount = obj.length;\n  }\n  this.assert(\n    itemsCount == n,\n    \"expected #{this} to have a \" + descriptor + \" of #{exp} but got #{act}\",\n    \"expected #{this} to not have a \" + descriptor + \" of #{act}\",\n    n,\n    itemsCount\n  );\n}\n__name(assertLength, \"assertLength\");\nAssertion.addChainableMethod(\"length\", assertLength, assertLengthChain);\nAssertion.addChainableMethod(\"lengthOf\", assertLength, assertLengthChain);\nfunction assertMatch(re, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\");\n  this.assert(\n    re.exec(obj),\n    \"expected #{this} to match \" + re,\n    \"expected #{this} not to match \" + re\n  );\n}\n__name(assertMatch, \"assertMatch\");\nAssertion.addMethod(\"match\", assertMatch);\nAssertion.addMethod(\"matches\", assertMatch);\nAssertion.addMethod(\"string\", function(str, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\"), flagMsg = flag2(this, \"message\"), ssfi = flag2(this, \"ssfi\");\n  new Assertion(obj, flagMsg, ssfi, true).is.a(\"string\");\n  this.assert(\n    ~obj.indexOf(str),\n    \"expected #{this} to contain \" + inspect2(str),\n    \"expected #{this} to not contain \" + inspect2(str)\n  );\n});\nfunction assertKeys(keys) {\n  let obj = flag2(this, \"object\"), objType = type(obj), keysType = type(keys), ssfi = flag2(this, \"ssfi\"), isDeep = flag2(this, \"deep\"), str, deepStr = \"\", actual, ok = true, flagMsg = flag2(this, \"message\");\n  flagMsg = flagMsg ? flagMsg + \": \" : \"\";\n  let mixedArgsMsg = flagMsg + \"when testing keys against an object or an array you must give a single Array|Object|String argument or multiple String arguments\";\n  if (objType === \"Map\" || objType === \"Set\") {\n    deepStr = isDeep ? \"deeply \" : \"\";\n    actual = [];\n    obj.forEach(function(val, key) {\n      actual.push(key);\n    });\n    if (keysType !== \"Array\") {\n      keys = Array.prototype.slice.call(arguments);\n    }\n  } else {\n    actual = getOwnEnumerableProperties(obj);\n    switch (keysType) {\n      case \"Array\":\n        if (arguments.length > 1) {\n          throw new AssertionError(mixedArgsMsg, void 0, ssfi);\n        }\n        break;\n      case \"Object\":\n        if (arguments.length > 1) {\n          throw new AssertionError(mixedArgsMsg, void 0, ssfi);\n        }\n        keys = Object.keys(keys);\n        break;\n      default:\n        keys = Array.prototype.slice.call(arguments);\n    }\n    keys = keys.map(function(val) {\n      return typeof val === \"symbol\" ? val : String(val);\n    });\n  }\n  if (!keys.length) {\n    throw new AssertionError(flagMsg + \"keys required\", void 0, ssfi);\n  }\n  let len = keys.length, any = flag2(this, \"any\"), all = flag2(this, \"all\"), expected = keys, isEql = isDeep ? flag2(this, \"eql\") : (val1, val2) => val1 === val2;\n  if (!any && !all) {\n    all = true;\n  }\n  if (any) {\n    ok = expected.some(function(expectedKey) {\n      return actual.some(function(actualKey) {\n        return isEql(expectedKey, actualKey);\n      });\n    });\n  }\n  if (all) {\n    ok = expected.every(function(expectedKey) {\n      return actual.some(function(actualKey) {\n        return isEql(expectedKey, actualKey);\n      });\n    });\n    if (!flag2(this, \"contains\")) {\n      ok = ok && keys.length == actual.length;\n    }\n  }\n  if (len > 1) {\n    keys = keys.map(function(key) {\n      return inspect2(key);\n    });\n    let last = keys.pop();\n    if (all) {\n      str = keys.join(\", \") + \", and \" + last;\n    }\n    if (any) {\n      str = keys.join(\", \") + \", or \" + last;\n    }\n  } else {\n    str = inspect2(keys[0]);\n  }\n  str = (len > 1 ? \"keys \" : \"key \") + str;\n  str = (flag2(this, \"contains\") ? \"contain \" : \"have \") + str;\n  this.assert(\n    ok,\n    \"expected #{this} to \" + deepStr + str,\n    \"expected #{this} to not \" + deepStr + str,\n    expected.slice(0).sort(compareByInspect),\n    actual.sort(compareByInspect),\n    true\n  );\n}\n__name(assertKeys, \"assertKeys\");\nAssertion.addMethod(\"keys\", assertKeys);\nAssertion.addMethod(\"key\", assertKeys);\nfunction assertThrows(errorLike, errMsgMatcher, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\"), ssfi = flag2(this, \"ssfi\"), flagMsg = flag2(this, \"message\"), negate = flag2(this, \"negate\") || false;\n  new Assertion(obj, flagMsg, ssfi, true).is.a(\"function\");\n  if (isRegExp2(errorLike) || typeof errorLike === \"string\") {\n    errMsgMatcher = errorLike;\n    errorLike = null;\n  }\n  let caughtErr;\n  let errorWasThrown = false;\n  try {\n    obj();\n  } catch (err) {\n    errorWasThrown = true;\n    caughtErr = err;\n  }\n  let everyArgIsUndefined = errorLike === void 0 && errMsgMatcher === void 0;\n  let everyArgIsDefined = Boolean(errorLike && errMsgMatcher);\n  let errorLikeFail = false;\n  let errMsgMatcherFail = false;\n  if (everyArgIsUndefined || !everyArgIsUndefined && !negate) {\n    let errorLikeString = \"an error\";\n    if (errorLike instanceof Error) {\n      errorLikeString = \"#{exp}\";\n    } else if (errorLike) {\n      errorLikeString = check_error_exports.getConstructorName(errorLike);\n    }\n    let actual = caughtErr;\n    if (caughtErr instanceof Error) {\n      actual = caughtErr.toString();\n    } else if (typeof caughtErr === \"string\") {\n      actual = caughtErr;\n    } else if (caughtErr && (typeof caughtErr === \"object\" || typeof caughtErr === \"function\")) {\n      try {\n        actual = check_error_exports.getConstructorName(caughtErr);\n      } catch (_err) {\n      }\n    }\n    this.assert(\n      errorWasThrown,\n      \"expected #{this} to throw \" + errorLikeString,\n      \"expected #{this} to not throw an error but #{act} was thrown\",\n      errorLike && errorLike.toString(),\n      actual\n    );\n  }\n  if (errorLike && caughtErr) {\n    if (errorLike instanceof Error) {\n      let isCompatibleInstance = check_error_exports.compatibleInstance(\n        caughtErr,\n        errorLike\n      );\n      if (isCompatibleInstance === negate) {\n        if (everyArgIsDefined && negate) {\n          errorLikeFail = true;\n        } else {\n          this.assert(\n            negate,\n            \"expected #{this} to throw #{exp} but #{act} was thrown\",\n            \"expected #{this} to not throw #{exp}\" + (caughtErr && !negate ? \" but #{act} was thrown\" : \"\"),\n            errorLike.toString(),\n            caughtErr.toString()\n          );\n        }\n      }\n    }\n    let isCompatibleConstructor = check_error_exports.compatibleConstructor(\n      caughtErr,\n      errorLike\n    );\n    if (isCompatibleConstructor === negate) {\n      if (everyArgIsDefined && negate) {\n        errorLikeFail = true;\n      } else {\n        this.assert(\n          negate,\n          \"expected #{this} to throw #{exp} but #{act} was thrown\",\n          \"expected #{this} to not throw #{exp}\" + (caughtErr ? \" but #{act} was thrown\" : \"\"),\n          errorLike instanceof Error ? errorLike.toString() : errorLike && check_error_exports.getConstructorName(errorLike),\n          caughtErr instanceof Error ? caughtErr.toString() : caughtErr && check_error_exports.getConstructorName(caughtErr)\n        );\n      }\n    }\n  }\n  if (caughtErr && errMsgMatcher !== void 0 && errMsgMatcher !== null) {\n    let placeholder = \"including\";\n    if (isRegExp2(errMsgMatcher)) {\n      placeholder = \"matching\";\n    }\n    let isCompatibleMessage = check_error_exports.compatibleMessage(\n      caughtErr,\n      errMsgMatcher\n    );\n    if (isCompatibleMessage === negate) {\n      if (everyArgIsDefined && negate) {\n        errMsgMatcherFail = true;\n      } else {\n        this.assert(\n          negate,\n          \"expected #{this} to throw error \" + placeholder + \" #{exp} but got #{act}\",\n          \"expected #{this} to throw error not \" + placeholder + \" #{exp}\",\n          errMsgMatcher,\n          check_error_exports.getMessage(caughtErr)\n        );\n      }\n    }\n  }\n  if (errorLikeFail && errMsgMatcherFail) {\n    this.assert(\n      negate,\n      \"expected #{this} to throw #{exp} but #{act} was thrown\",\n      \"expected #{this} to not throw #{exp}\" + (caughtErr ? \" but #{act} was thrown\" : \"\"),\n      errorLike instanceof Error ? errorLike.toString() : errorLike && check_error_exports.getConstructorName(errorLike),\n      caughtErr instanceof Error ? caughtErr.toString() : caughtErr && check_error_exports.getConstructorName(caughtErr)\n    );\n  }\n  flag2(this, \"object\", caughtErr);\n}\n__name(assertThrows, \"assertThrows\");\nAssertion.addMethod(\"throw\", assertThrows);\nAssertion.addMethod(\"throws\", assertThrows);\nAssertion.addMethod(\"Throw\", assertThrows);\nfunction respondTo(method, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\"), itself = flag2(this, \"itself\"), context = \"function\" === typeof obj && !itself ? obj.prototype[method] : obj[method];\n  this.assert(\n    \"function\" === typeof context,\n    \"expected #{this} to respond to \" + inspect2(method),\n    \"expected #{this} to not respond to \" + inspect2(method)\n  );\n}\n__name(respondTo, \"respondTo\");\nAssertion.addMethod(\"respondTo\", respondTo);\nAssertion.addMethod(\"respondsTo\", respondTo);\nAssertion.addProperty(\"itself\", function() {\n  flag2(this, \"itself\", true);\n});\nfunction satisfy(matcher, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\");\n  let result = matcher(obj);\n  this.assert(\n    result,\n    \"expected #{this} to satisfy \" + objDisplay(matcher),\n    \"expected #{this} to not satisfy\" + objDisplay(matcher),\n    flag2(this, \"negate\") ? false : true,\n    result\n  );\n}\n__name(satisfy, \"satisfy\");\nAssertion.addMethod(\"satisfy\", satisfy);\nAssertion.addMethod(\"satisfies\", satisfy);\nfunction closeTo(expected, delta, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\"), flagMsg = flag2(this, \"message\"), ssfi = flag2(this, \"ssfi\");\n  new Assertion(obj, flagMsg, ssfi, true).is.numeric;\n  let message = \"A `delta` value is required for `closeTo`\";\n  if (delta == void 0) {\n    throw new AssertionError(\n      flagMsg ? `${flagMsg}: ${message}` : message,\n      void 0,\n      ssfi\n    );\n  }\n  new Assertion(delta, flagMsg, ssfi, true).is.numeric;\n  message = \"A `expected` value is required for `closeTo`\";\n  if (expected == void 0) {\n    throw new AssertionError(\n      flagMsg ? `${flagMsg}: ${message}` : message,\n      void 0,\n      ssfi\n    );\n  }\n  new Assertion(expected, flagMsg, ssfi, true).is.numeric;\n  const abs = /* @__PURE__ */ __name((x) => x < 0 ? -x : x, \"abs\");\n  const strip = /* @__PURE__ */ __name((number) => parseFloat(parseFloat(number).toPrecision(12)), \"strip\");\n  this.assert(\n    strip(abs(obj - expected)) <= delta,\n    \"expected #{this} to be close to \" + expected + \" +/- \" + delta,\n    \"expected #{this} not to be close to \" + expected + \" +/- \" + delta\n  );\n}\n__name(closeTo, \"closeTo\");\nAssertion.addMethod(\"closeTo\", closeTo);\nAssertion.addMethod(\"approximately\", closeTo);\nfunction isSubsetOf(_subset, _superset, cmp, contains, ordered) {\n  let superset = Array.from(_superset);\n  let subset = Array.from(_subset);\n  if (!contains) {\n    if (subset.length !== superset.length) return false;\n    superset = superset.slice();\n  }\n  return subset.every(function(elem, idx) {\n    if (ordered) return cmp ? cmp(elem, superset[idx]) : elem === superset[idx];\n    if (!cmp) {\n      let matchIdx = superset.indexOf(elem);\n      if (matchIdx === -1) return false;\n      if (!contains) superset.splice(matchIdx, 1);\n      return true;\n    }\n    return superset.some(function(elem2, matchIdx) {\n      if (!cmp(elem, elem2)) return false;\n      if (!contains) superset.splice(matchIdx, 1);\n      return true;\n    });\n  });\n}\n__name(isSubsetOf, \"isSubsetOf\");\nAssertion.addMethod(\"members\", function(subset, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\"), flagMsg = flag2(this, \"message\"), ssfi = flag2(this, \"ssfi\");\n  new Assertion(obj, flagMsg, ssfi, true).to.be.iterable;\n  new Assertion(subset, flagMsg, ssfi, true).to.be.iterable;\n  let contains = flag2(this, \"contains\");\n  let ordered = flag2(this, \"ordered\");\n  let subject, failMsg, failNegateMsg;\n  if (contains) {\n    subject = ordered ? \"an ordered superset\" : \"a superset\";\n    failMsg = \"expected #{this} to be \" + subject + \" of #{exp}\";\n    failNegateMsg = \"expected #{this} to not be \" + subject + \" of #{exp}\";\n  } else {\n    subject = ordered ? \"ordered members\" : \"members\";\n    failMsg = \"expected #{this} to have the same \" + subject + \" as #{exp}\";\n    failNegateMsg = \"expected #{this} to not have the same \" + subject + \" as #{exp}\";\n  }\n  let cmp = flag2(this, \"deep\") ? flag2(this, \"eql\") : void 0;\n  this.assert(\n    isSubsetOf(subset, obj, cmp, contains, ordered),\n    failMsg,\n    failNegateMsg,\n    subset,\n    obj,\n    true\n  );\n});\nAssertion.addProperty(\"iterable\", function(msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let obj = flag2(this, \"object\");\n  this.assert(\n    obj != void 0 && obj[Symbol.iterator],\n    \"expected #{this} to be an iterable\",\n    \"expected #{this} to not be an iterable\",\n    obj\n  );\n});\nfunction oneOf(list, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let expected = flag2(this, \"object\"), flagMsg = flag2(this, \"message\"), ssfi = flag2(this, \"ssfi\"), contains = flag2(this, \"contains\"), isDeep = flag2(this, \"deep\"), eql = flag2(this, \"eql\");\n  new Assertion(list, flagMsg, ssfi, true).to.be.an(\"array\");\n  if (contains) {\n    this.assert(\n      list.some(function(possibility) {\n        return expected.indexOf(possibility) > -1;\n      }),\n      \"expected #{this} to contain one of #{exp}\",\n      \"expected #{this} to not contain one of #{exp}\",\n      list,\n      expected\n    );\n  } else {\n    if (isDeep) {\n      this.assert(\n        list.some(function(possibility) {\n          return eql(expected, possibility);\n        }),\n        \"expected #{this} to deeply equal one of #{exp}\",\n        \"expected #{this} to deeply equal one of #{exp}\",\n        list,\n        expected\n      );\n    } else {\n      this.assert(\n        list.indexOf(expected) > -1,\n        \"expected #{this} to be one of #{exp}\",\n        \"expected #{this} to not be one of #{exp}\",\n        list,\n        expected\n      );\n    }\n  }\n}\n__name(oneOf, \"oneOf\");\nAssertion.addMethod(\"oneOf\", oneOf);\nfunction assertChanges(subject, prop, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let fn = flag2(this, \"object\"), flagMsg = flag2(this, \"message\"), ssfi = flag2(this, \"ssfi\");\n  new Assertion(fn, flagMsg, ssfi, true).is.a(\"function\");\n  let initial;\n  if (!prop) {\n    new Assertion(subject, flagMsg, ssfi, true).is.a(\"function\");\n    initial = subject();\n  } else {\n    new Assertion(subject, flagMsg, ssfi, true).to.have.property(prop);\n    initial = subject[prop];\n  }\n  fn();\n  let final = prop === void 0 || prop === null ? subject() : subject[prop];\n  let msgObj = prop === void 0 || prop === null ? initial : \".\" + prop;\n  flag2(this, \"deltaMsgObj\", msgObj);\n  flag2(this, \"initialDeltaValue\", initial);\n  flag2(this, \"finalDeltaValue\", final);\n  flag2(this, \"deltaBehavior\", \"change\");\n  flag2(this, \"realDelta\", final !== initial);\n  this.assert(\n    initial !== final,\n    \"expected \" + msgObj + \" to change\",\n    \"expected \" + msgObj + \" to not change\"\n  );\n}\n__name(assertChanges, \"assertChanges\");\nAssertion.addMethod(\"change\", assertChanges);\nAssertion.addMethod(\"changes\", assertChanges);\nfunction assertIncreases(subject, prop, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let fn = flag2(this, \"object\"), flagMsg = flag2(this, \"message\"), ssfi = flag2(this, \"ssfi\");\n  new Assertion(fn, flagMsg, ssfi, true).is.a(\"function\");\n  let initial;\n  if (!prop) {\n    new Assertion(subject, flagMsg, ssfi, true).is.a(\"function\");\n    initial = subject();\n  } else {\n    new Assertion(subject, flagMsg, ssfi, true).to.have.property(prop);\n    initial = subject[prop];\n  }\n  new Assertion(initial, flagMsg, ssfi, true).is.a(\"number\");\n  fn();\n  let final = prop === void 0 || prop === null ? subject() : subject[prop];\n  let msgObj = prop === void 0 || prop === null ? initial : \".\" + prop;\n  flag2(this, \"deltaMsgObj\", msgObj);\n  flag2(this, \"initialDeltaValue\", initial);\n  flag2(this, \"finalDeltaValue\", final);\n  flag2(this, \"deltaBehavior\", \"increase\");\n  flag2(this, \"realDelta\", final - initial);\n  this.assert(\n    final - initial > 0,\n    \"expected \" + msgObj + \" to increase\",\n    \"expected \" + msgObj + \" to not increase\"\n  );\n}\n__name(assertIncreases, \"assertIncreases\");\nAssertion.addMethod(\"increase\", assertIncreases);\nAssertion.addMethod(\"increases\", assertIncreases);\nfunction assertDecreases(subject, prop, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let fn = flag2(this, \"object\"), flagMsg = flag2(this, \"message\"), ssfi = flag2(this, \"ssfi\");\n  new Assertion(fn, flagMsg, ssfi, true).is.a(\"function\");\n  let initial;\n  if (!prop) {\n    new Assertion(subject, flagMsg, ssfi, true).is.a(\"function\");\n    initial = subject();\n  } else {\n    new Assertion(subject, flagMsg, ssfi, true).to.have.property(prop);\n    initial = subject[prop];\n  }\n  new Assertion(initial, flagMsg, ssfi, true).is.a(\"number\");\n  fn();\n  let final = prop === void 0 || prop === null ? subject() : subject[prop];\n  let msgObj = prop === void 0 || prop === null ? initial : \".\" + prop;\n  flag2(this, \"deltaMsgObj\", msgObj);\n  flag2(this, \"initialDeltaValue\", initial);\n  flag2(this, \"finalDeltaValue\", final);\n  flag2(this, \"deltaBehavior\", \"decrease\");\n  flag2(this, \"realDelta\", initial - final);\n  this.assert(\n    final - initial < 0,\n    \"expected \" + msgObj + \" to decrease\",\n    \"expected \" + msgObj + \" to not decrease\"\n  );\n}\n__name(assertDecreases, \"assertDecreases\");\nAssertion.addMethod(\"decrease\", assertDecreases);\nAssertion.addMethod(\"decreases\", assertDecreases);\nfunction assertDelta(delta, msg) {\n  if (msg) flag2(this, \"message\", msg);\n  let msgObj = flag2(this, \"deltaMsgObj\");\n  let initial = flag2(this, \"initialDeltaValue\");\n  let final = flag2(this, \"finalDeltaValue\");\n  let behavior = flag2(this, \"deltaBehavior\");\n  let realDelta = flag2(this, \"realDelta\");\n  let expression;\n  if (behavior === \"change\") {\n    expression = Math.abs(final - initial) === Math.abs(delta);\n  } else {\n    expression = realDelta === Math.abs(delta);\n  }\n  this.assert(\n    expression,\n    \"expected \" + msgObj + \" to \" + behavior + \" by \" + delta,\n    \"expected \" + msgObj + \" to not \" + behavior + \" by \" + delta\n  );\n}\n__name(assertDelta, \"assertDelta\");\nAssertion.addMethod(\"by\", assertDelta);\nAssertion.addProperty(\"extensible\", function() {\n  let obj = flag2(this, \"object\");\n  let isExtensible = obj === Object(obj) && Object.isExtensible(obj);\n  this.assert(\n    isExtensible,\n    \"expected #{this} to be extensible\",\n    \"expected #{this} to not be extensible\"\n  );\n});\nAssertion.addProperty(\"sealed\", function() {\n  let obj = flag2(this, \"object\");\n  let isSealed = obj === Object(obj) ? Object.isSealed(obj) : true;\n  this.assert(\n    isSealed,\n    \"expected #{this} to be sealed\",\n    \"expected #{this} to not be sealed\"\n  );\n});\nAssertion.addProperty(\"frozen\", function() {\n  let obj = flag2(this, \"object\");\n  let isFrozen = obj === Object(obj) ? Object.isFrozen(obj) : true;\n  this.assert(\n    isFrozen,\n    \"expected #{this} to be frozen\",\n    \"expected #{this} to not be frozen\"\n  );\n});\nAssertion.addProperty(\"finite\", function(_msg) {\n  let obj = flag2(this, \"object\");\n  this.assert(\n    typeof obj === \"number\" && isFinite(obj),\n    \"expected #{this} to be a finite number\",\n    \"expected #{this} to not be a finite number\"\n  );\n});\nfunction compareSubset(expected, actual) {\n  if (expected === actual) {\n    return true;\n  }\n  if (typeof actual !== typeof expected) {\n    return false;\n  }\n  if (typeof expected !== \"object\" || expected === null) {\n    return expected === actual;\n  }\n  if (!actual) {\n    return false;\n  }\n  if (Array.isArray(expected)) {\n    if (!Array.isArray(actual)) {\n      return false;\n    }\n    return expected.every(function(exp) {\n      return actual.some(function(act) {\n        return compareSubset(exp, act);\n      });\n    });\n  }\n  if (expected instanceof Date) {\n    if (actual instanceof Date) {\n      return expected.getTime() === actual.getTime();\n    } else {\n      return false;\n    }\n  }\n  return Object.keys(expected).every(function(key) {\n    let expectedValue = expected[key];\n    let actualValue = actual[key];\n    if (typeof expectedValue === \"object\" && expectedValue !== null && actualValue !== null) {\n      return compareSubset(expectedValue, actualValue);\n    }\n    if (typeof expectedValue === \"function\") {\n      return expectedValue(actualValue);\n    }\n    return actualValue === expectedValue;\n  });\n}\n__name(compareSubset, \"compareSubset\");\nAssertion.addMethod(\"containSubset\", function(expected) {\n  const actual = flag(this, \"object\");\n  const showDiff = config.showDiff;\n  this.assert(\n    compareSubset(expected, actual),\n    \"expected #{act} to contain subset #{exp}\",\n    \"expected #{act} to not contain subset #{exp}\",\n    expected,\n    actual,\n    showDiff\n  );\n});\n\n// lib/chai/interface/expect.js\nfunction expect(val, message) {\n  return new Assertion(val, message);\n}\n__name(expect, \"expect\");\nexpect.fail = function(actual, expected, message, operator) {\n  if (arguments.length < 2) {\n    message = actual;\n    actual = void 0;\n  }\n  message = message || \"expect.fail()\";\n  throw new AssertionError(\n    message,\n    {\n      actual,\n      expected,\n      operator\n    },\n    expect.fail\n  );\n};\n\n// lib/chai/interface/should.js\nvar should_exports = {};\n__export(should_exports, {\n  Should: () => Should,\n  should: () => should\n});\nfunction loadShould() {\n  function shouldGetter() {\n    if (this instanceof String || this instanceof Number || this instanceof Boolean || typeof Symbol === \"function\" && this instanceof Symbol || typeof BigInt === \"function\" && this instanceof BigInt) {\n      return new Assertion(this.valueOf(), null, shouldGetter);\n    }\n    return new Assertion(this, null, shouldGetter);\n  }\n  __name(shouldGetter, \"shouldGetter\");\n  function shouldSetter(value) {\n    Object.defineProperty(this, \"should\", {\n      value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  }\n  __name(shouldSetter, \"shouldSetter\");\n  Object.defineProperty(Object.prototype, \"should\", {\n    set: shouldSetter,\n    get: shouldGetter,\n    configurable: true\n  });\n  let should2 = {};\n  should2.fail = function(actual, expected, message, operator) {\n    if (arguments.length < 2) {\n      message = actual;\n      actual = void 0;\n    }\n    message = message || \"should.fail()\";\n    throw new AssertionError(\n      message,\n      {\n        actual,\n        expected,\n        operator\n      },\n      should2.fail\n    );\n  };\n  should2.equal = function(actual, expected, message) {\n    new Assertion(actual, message).to.equal(expected);\n  };\n  should2.Throw = function(fn, errt, errs, msg) {\n    new Assertion(fn, msg).to.Throw(errt, errs);\n  };\n  should2.exist = function(val, msg) {\n    new Assertion(val, msg).to.exist;\n  };\n  should2.not = {};\n  should2.not.equal = function(actual, expected, msg) {\n    new Assertion(actual, msg).to.not.equal(expected);\n  };\n  should2.not.Throw = function(fn, errt, errs, msg) {\n    new Assertion(fn, msg).to.not.Throw(errt, errs);\n  };\n  should2.not.exist = function(val, msg) {\n    new Assertion(val, msg).to.not.exist;\n  };\n  should2[\"throw\"] = should2[\"Throw\"];\n  should2.not[\"throw\"] = should2.not[\"Throw\"];\n  return should2;\n}\n__name(loadShould, \"loadShould\");\nvar should = loadShould;\nvar Should = loadShould;\n\n// lib/chai/interface/assert.js\nfunction assert(express, errmsg) {\n  let test2 = new Assertion(null, null, assert, true);\n  test2.assert(express, errmsg, \"[ negation message unavailable ]\");\n}\n__name(assert, \"assert\");\nassert.fail = function(actual, expected, message, operator) {\n  if (arguments.length < 2) {\n    message = actual;\n    actual = void 0;\n  }\n  message = message || \"assert.fail()\";\n  throw new AssertionError(\n    message,\n    {\n      actual,\n      expected,\n      operator\n    },\n    assert.fail\n  );\n};\nassert.isOk = function(val, msg) {\n  new Assertion(val, msg, assert.isOk, true).is.ok;\n};\nassert.isNotOk = function(val, msg) {\n  new Assertion(val, msg, assert.isNotOk, true).is.not.ok;\n};\nassert.equal = function(act, exp, msg) {\n  let test2 = new Assertion(act, msg, assert.equal, true);\n  test2.assert(\n    exp == flag(test2, \"object\"),\n    \"expected #{this} to equal #{exp}\",\n    \"expected #{this} to not equal #{act}\",\n    exp,\n    act,\n    true\n  );\n};\nassert.notEqual = function(act, exp, msg) {\n  let test2 = new Assertion(act, msg, assert.notEqual, true);\n  test2.assert(\n    exp != flag(test2, \"object\"),\n    \"expected #{this} to not equal #{exp}\",\n    \"expected #{this} to equal #{act}\",\n    exp,\n    act,\n    true\n  );\n};\nassert.strictEqual = function(act, exp, msg) {\n  new Assertion(act, msg, assert.strictEqual, true).to.equal(exp);\n};\nassert.notStrictEqual = function(act, exp, msg) {\n  new Assertion(act, msg, assert.notStrictEqual, true).to.not.equal(exp);\n};\nassert.deepEqual = assert.deepStrictEqual = function(act, exp, msg) {\n  new Assertion(act, msg, assert.deepEqual, true).to.eql(exp);\n};\nassert.notDeepEqual = function(act, exp, msg) {\n  new Assertion(act, msg, assert.notDeepEqual, true).to.not.eql(exp);\n};\nassert.isAbove = function(val, abv, msg) {\n  new Assertion(val, msg, assert.isAbove, true).to.be.above(abv);\n};\nassert.isAtLeast = function(val, atlst, msg) {\n  new Assertion(val, msg, assert.isAtLeast, true).to.be.least(atlst);\n};\nassert.isBelow = function(val, blw, msg) {\n  new Assertion(val, msg, assert.isBelow, true).to.be.below(blw);\n};\nassert.isAtMost = function(val, atmst, msg) {\n  new Assertion(val, msg, assert.isAtMost, true).to.be.most(atmst);\n};\nassert.isTrue = function(val, msg) {\n  new Assertion(val, msg, assert.isTrue, true).is[\"true\"];\n};\nassert.isNotTrue = function(val, msg) {\n  new Assertion(val, msg, assert.isNotTrue, true).to.not.equal(true);\n};\nassert.isFalse = function(val, msg) {\n  new Assertion(val, msg, assert.isFalse, true).is[\"false\"];\n};\nassert.isNotFalse = function(val, msg) {\n  new Assertion(val, msg, assert.isNotFalse, true).to.not.equal(false);\n};\nassert.isNull = function(val, msg) {\n  new Assertion(val, msg, assert.isNull, true).to.equal(null);\n};\nassert.isNotNull = function(val, msg) {\n  new Assertion(val, msg, assert.isNotNull, true).to.not.equal(null);\n};\nassert.isNaN = function(val, msg) {\n  new Assertion(val, msg, assert.isNaN, true).to.be.NaN;\n};\nassert.isNotNaN = function(value, message) {\n  new Assertion(value, message, assert.isNotNaN, true).not.to.be.NaN;\n};\nassert.exists = function(val, msg) {\n  new Assertion(val, msg, assert.exists, true).to.exist;\n};\nassert.notExists = function(val, msg) {\n  new Assertion(val, msg, assert.notExists, true).to.not.exist;\n};\nassert.isUndefined = function(val, msg) {\n  new Assertion(val, msg, assert.isUndefined, true).to.equal(void 0);\n};\nassert.isDefined = function(val, msg) {\n  new Assertion(val, msg, assert.isDefined, true).to.not.equal(void 0);\n};\nassert.isCallable = function(value, message) {\n  new Assertion(value, message, assert.isCallable, true).is.callable;\n};\nassert.isNotCallable = function(value, message) {\n  new Assertion(value, message, assert.isNotCallable, true).is.not.callable;\n};\nassert.isObject = function(val, msg) {\n  new Assertion(val, msg, assert.isObject, true).to.be.a(\"object\");\n};\nassert.isNotObject = function(val, msg) {\n  new Assertion(val, msg, assert.isNotObject, true).to.not.be.a(\"object\");\n};\nassert.isArray = function(val, msg) {\n  new Assertion(val, msg, assert.isArray, true).to.be.an(\"array\");\n};\nassert.isNotArray = function(val, msg) {\n  new Assertion(val, msg, assert.isNotArray, true).to.not.be.an(\"array\");\n};\nassert.isString = function(val, msg) {\n  new Assertion(val, msg, assert.isString, true).to.be.a(\"string\");\n};\nassert.isNotString = function(val, msg) {\n  new Assertion(val, msg, assert.isNotString, true).to.not.be.a(\"string\");\n};\nassert.isNumber = function(val, msg) {\n  new Assertion(val, msg, assert.isNumber, true).to.be.a(\"number\");\n};\nassert.isNotNumber = function(val, msg) {\n  new Assertion(val, msg, assert.isNotNumber, true).to.not.be.a(\"number\");\n};\nassert.isNumeric = function(val, msg) {\n  new Assertion(val, msg, assert.isNumeric, true).is.numeric;\n};\nassert.isNotNumeric = function(val, msg) {\n  new Assertion(val, msg, assert.isNotNumeric, true).is.not.numeric;\n};\nassert.isFinite = function(val, msg) {\n  new Assertion(val, msg, assert.isFinite, true).to.be.finite;\n};\nassert.isBoolean = function(val, msg) {\n  new Assertion(val, msg, assert.isBoolean, true).to.be.a(\"boolean\");\n};\nassert.isNotBoolean = function(val, msg) {\n  new Assertion(val, msg, assert.isNotBoolean, true).to.not.be.a(\"boolean\");\n};\nassert.typeOf = function(val, type3, msg) {\n  new Assertion(val, msg, assert.typeOf, true).to.be.a(type3);\n};\nassert.notTypeOf = function(value, type3, message) {\n  new Assertion(value, message, assert.notTypeOf, true).to.not.be.a(type3);\n};\nassert.instanceOf = function(val, type3, msg) {\n  new Assertion(val, msg, assert.instanceOf, true).to.be.instanceOf(type3);\n};\nassert.notInstanceOf = function(val, type3, msg) {\n  new Assertion(val, msg, assert.notInstanceOf, true).to.not.be.instanceOf(\n    type3\n  );\n};\nassert.include = function(exp, inc, msg) {\n  new Assertion(exp, msg, assert.include, true).include(inc);\n};\nassert.notInclude = function(exp, inc, msg) {\n  new Assertion(exp, msg, assert.notInclude, true).not.include(inc);\n};\nassert.deepInclude = function(exp, inc, msg) {\n  new Assertion(exp, msg, assert.deepInclude, true).deep.include(inc);\n};\nassert.notDeepInclude = function(exp, inc, msg) {\n  new Assertion(exp, msg, assert.notDeepInclude, true).not.deep.include(inc);\n};\nassert.nestedInclude = function(exp, inc, msg) {\n  new Assertion(exp, msg, assert.nestedInclude, true).nested.include(inc);\n};\nassert.notNestedInclude = function(exp, inc, msg) {\n  new Assertion(exp, msg, assert.notNestedInclude, true).not.nested.include(\n    inc\n  );\n};\nassert.deepNestedInclude = function(exp, inc, msg) {\n  new Assertion(exp, msg, assert.deepNestedInclude, true).deep.nested.include(\n    inc\n  );\n};\nassert.notDeepNestedInclude = function(exp, inc, msg) {\n  new Assertion(\n    exp,\n    msg,\n    assert.notDeepNestedInclude,\n    true\n  ).not.deep.nested.include(inc);\n};\nassert.ownInclude = function(exp, inc, msg) {\n  new Assertion(exp, msg, assert.ownInclude, true).own.include(inc);\n};\nassert.notOwnInclude = function(exp, inc, msg) {\n  new Assertion(exp, msg, assert.notOwnInclude, true).not.own.include(inc);\n};\nassert.deepOwnInclude = function(exp, inc, msg) {\n  new Assertion(exp, msg, assert.deepOwnInclude, true).deep.own.include(inc);\n};\nassert.notDeepOwnInclude = function(exp, inc, msg) {\n  new Assertion(exp, msg, assert.notDeepOwnInclude, true).not.deep.own.include(\n    inc\n  );\n};\nassert.match = function(exp, re, msg) {\n  new Assertion(exp, msg, assert.match, true).to.match(re);\n};\nassert.notMatch = function(exp, re, msg) {\n  new Assertion(exp, msg, assert.notMatch, true).to.not.match(re);\n};\nassert.property = function(obj, prop, msg) {\n  new Assertion(obj, msg, assert.property, true).to.have.property(prop);\n};\nassert.notProperty = function(obj, prop, msg) {\n  new Assertion(obj, msg, assert.notProperty, true).to.not.have.property(prop);\n};\nassert.propertyVal = function(obj, prop, val, msg) {\n  new Assertion(obj, msg, assert.propertyVal, true).to.have.property(prop, val);\n};\nassert.notPropertyVal = function(obj, prop, val, msg) {\n  new Assertion(obj, msg, assert.notPropertyVal, true).to.not.have.property(\n    prop,\n    val\n  );\n};\nassert.deepPropertyVal = function(obj, prop, val, msg) {\n  new Assertion(obj, msg, assert.deepPropertyVal, true).to.have.deep.property(\n    prop,\n    val\n  );\n};\nassert.notDeepPropertyVal = function(obj, prop, val, msg) {\n  new Assertion(\n    obj,\n    msg,\n    assert.notDeepPropertyVal,\n    true\n  ).to.not.have.deep.property(prop, val);\n};\nassert.ownProperty = function(obj, prop, msg) {\n  new Assertion(obj, msg, assert.ownProperty, true).to.have.own.property(prop);\n};\nassert.notOwnProperty = function(obj, prop, msg) {\n  new Assertion(obj, msg, assert.notOwnProperty, true).to.not.have.own.property(\n    prop\n  );\n};\nassert.ownPropertyVal = function(obj, prop, value, msg) {\n  new Assertion(obj, msg, assert.ownPropertyVal, true).to.have.own.property(\n    prop,\n    value\n  );\n};\nassert.notOwnPropertyVal = function(obj, prop, value, msg) {\n  new Assertion(\n    obj,\n    msg,\n    assert.notOwnPropertyVal,\n    true\n  ).to.not.have.own.property(prop, value);\n};\nassert.deepOwnPropertyVal = function(obj, prop, value, msg) {\n  new Assertion(\n    obj,\n    msg,\n    assert.deepOwnPropertyVal,\n    true\n  ).to.have.deep.own.property(prop, value);\n};\nassert.notDeepOwnPropertyVal = function(obj, prop, value, msg) {\n  new Assertion(\n    obj,\n    msg,\n    assert.notDeepOwnPropertyVal,\n    true\n  ).to.not.have.deep.own.property(prop, value);\n};\nassert.nestedProperty = function(obj, prop, msg) {\n  new Assertion(obj, msg, assert.nestedProperty, true).to.have.nested.property(\n    prop\n  );\n};\nassert.notNestedProperty = function(obj, prop, msg) {\n  new Assertion(\n    obj,\n    msg,\n    assert.notNestedProperty,\n    true\n  ).to.not.have.nested.property(prop);\n};\nassert.nestedPropertyVal = function(obj, prop, val, msg) {\n  new Assertion(\n    obj,\n    msg,\n    assert.nestedPropertyVal,\n    true\n  ).to.have.nested.property(prop, val);\n};\nassert.notNestedPropertyVal = function(obj, prop, val, msg) {\n  new Assertion(\n    obj,\n    msg,\n    assert.notNestedPropertyVal,\n    true\n  ).to.not.have.nested.property(prop, val);\n};\nassert.deepNestedPropertyVal = function(obj, prop, val, msg) {\n  new Assertion(\n    obj,\n    msg,\n    assert.deepNestedPropertyVal,\n    true\n  ).to.have.deep.nested.property(prop, val);\n};\nassert.notDeepNestedPropertyVal = function(obj, prop, val, msg) {\n  new Assertion(\n    obj,\n    msg,\n    assert.notDeepNestedPropertyVal,\n    true\n  ).to.not.have.deep.nested.property(prop, val);\n};\nassert.lengthOf = function(exp, len, msg) {\n  new Assertion(exp, msg, assert.lengthOf, true).to.have.lengthOf(len);\n};\nassert.hasAnyKeys = function(obj, keys, msg) {\n  new Assertion(obj, msg, assert.hasAnyKeys, true).to.have.any.keys(keys);\n};\nassert.hasAllKeys = function(obj, keys, msg) {\n  new Assertion(obj, msg, assert.hasAllKeys, true).to.have.all.keys(keys);\n};\nassert.containsAllKeys = function(obj, keys, msg) {\n  new Assertion(obj, msg, assert.containsAllKeys, true).to.contain.all.keys(\n    keys\n  );\n};\nassert.doesNotHaveAnyKeys = function(obj, keys, msg) {\n  new Assertion(obj, msg, assert.doesNotHaveAnyKeys, true).to.not.have.any.keys(\n    keys\n  );\n};\nassert.doesNotHaveAllKeys = function(obj, keys, msg) {\n  new Assertion(obj, msg, assert.doesNotHaveAllKeys, true).to.not.have.all.keys(\n    keys\n  );\n};\nassert.hasAnyDeepKeys = function(obj, keys, msg) {\n  new Assertion(obj, msg, assert.hasAnyDeepKeys, true).to.have.any.deep.keys(\n    keys\n  );\n};\nassert.hasAllDeepKeys = function(obj, keys, msg) {\n  new Assertion(obj, msg, assert.hasAllDeepKeys, true).to.have.all.deep.keys(\n    keys\n  );\n};\nassert.containsAllDeepKeys = function(obj, keys, msg) {\n  new Assertion(\n    obj,\n    msg,\n    assert.containsAllDeepKeys,\n    true\n  ).to.contain.all.deep.keys(keys);\n};\nassert.doesNotHaveAnyDeepKeys = function(obj, keys, msg) {\n  new Assertion(\n    obj,\n    msg,\n    assert.doesNotHaveAnyDeepKeys,\n    true\n  ).to.not.have.any.deep.keys(keys);\n};\nassert.doesNotHaveAllDeepKeys = function(obj, keys, msg) {\n  new Assertion(\n    obj,\n    msg,\n    assert.doesNotHaveAllDeepKeys,\n    true\n  ).to.not.have.all.deep.keys(keys);\n};\nassert.throws = function(fn, errorLike, errMsgMatcher, msg) {\n  if (\"string\" === typeof errorLike || errorLike instanceof RegExp) {\n    errMsgMatcher = errorLike;\n    errorLike = null;\n  }\n  let assertErr = new Assertion(fn, msg, assert.throws, true).to.throw(\n    errorLike,\n    errMsgMatcher\n  );\n  return flag(assertErr, \"object\");\n};\nassert.doesNotThrow = function(fn, errorLike, errMsgMatcher, message) {\n  if (\"string\" === typeof errorLike || errorLike instanceof RegExp) {\n    errMsgMatcher = errorLike;\n    errorLike = null;\n  }\n  new Assertion(fn, message, assert.doesNotThrow, true).to.not.throw(\n    errorLike,\n    errMsgMatcher\n  );\n};\nassert.operator = function(val, operator, val2, msg) {\n  let ok;\n  switch (operator) {\n    case \"==\":\n      ok = val == val2;\n      break;\n    case \"===\":\n      ok = val === val2;\n      break;\n    case \">\":\n      ok = val > val2;\n      break;\n    case \">=\":\n      ok = val >= val2;\n      break;\n    case \"<\":\n      ok = val < val2;\n      break;\n    case \"<=\":\n      ok = val <= val2;\n      break;\n    case \"!=\":\n      ok = val != val2;\n      break;\n    case \"!==\":\n      ok = val !== val2;\n      break;\n    default:\n      msg = msg ? msg + \": \" : msg;\n      throw new AssertionError(\n        msg + 'Invalid operator \"' + operator + '\"',\n        void 0,\n        assert.operator\n      );\n  }\n  let test2 = new Assertion(ok, msg, assert.operator, true);\n  test2.assert(\n    true === flag(test2, \"object\"),\n    \"expected \" + inspect2(val) + \" to be \" + operator + \" \" + inspect2(val2),\n    \"expected \" + inspect2(val) + \" to not be \" + operator + \" \" + inspect2(val2)\n  );\n};\nassert.closeTo = function(act, exp, delta, msg) {\n  new Assertion(act, msg, assert.closeTo, true).to.be.closeTo(exp, delta);\n};\nassert.approximately = function(act, exp, delta, msg) {\n  new Assertion(act, msg, assert.approximately, true).to.be.approximately(\n    exp,\n    delta\n  );\n};\nassert.sameMembers = function(set1, set2, msg) {\n  new Assertion(set1, msg, assert.sameMembers, true).to.have.same.members(set2);\n};\nassert.notSameMembers = function(set1, set2, msg) {\n  new Assertion(\n    set1,\n    msg,\n    assert.notSameMembers,\n    true\n  ).to.not.have.same.members(set2);\n};\nassert.sameDeepMembers = function(set1, set2, msg) {\n  new Assertion(\n    set1,\n    msg,\n    assert.sameDeepMembers,\n    true\n  ).to.have.same.deep.members(set2);\n};\nassert.notSameDeepMembers = function(set1, set2, msg) {\n  new Assertion(\n    set1,\n    msg,\n    assert.notSameDeepMembers,\n    true\n  ).to.not.have.same.deep.members(set2);\n};\nassert.sameOrderedMembers = function(set1, set2, msg) {\n  new Assertion(\n    set1,\n    msg,\n    assert.sameOrderedMembers,\n    true\n  ).to.have.same.ordered.members(set2);\n};\nassert.notSameOrderedMembers = function(set1, set2, msg) {\n  new Assertion(\n    set1,\n    msg,\n    assert.notSameOrderedMembers,\n    true\n  ).to.not.have.same.ordered.members(set2);\n};\nassert.sameDeepOrderedMembers = function(set1, set2, msg) {\n  new Assertion(\n    set1,\n    msg,\n    assert.sameDeepOrderedMembers,\n    true\n  ).to.have.same.deep.ordered.members(set2);\n};\nassert.notSameDeepOrderedMembers = function(set1, set2, msg) {\n  new Assertion(\n    set1,\n    msg,\n    assert.notSameDeepOrderedMembers,\n    true\n  ).to.not.have.same.deep.ordered.members(set2);\n};\nassert.includeMembers = function(superset, subset, msg) {\n  new Assertion(superset, msg, assert.includeMembers, true).to.include.members(\n    subset\n  );\n};\nassert.notIncludeMembers = function(superset, subset, msg) {\n  new Assertion(\n    superset,\n    msg,\n    assert.notIncludeMembers,\n    true\n  ).to.not.include.members(subset);\n};\nassert.includeDeepMembers = function(superset, subset, msg) {\n  new Assertion(\n    superset,\n    msg,\n    assert.includeDeepMembers,\n    true\n  ).to.include.deep.members(subset);\n};\nassert.notIncludeDeepMembers = function(superset, subset, msg) {\n  new Assertion(\n    superset,\n    msg,\n    assert.notIncludeDeepMembers,\n    true\n  ).to.not.include.deep.members(subset);\n};\nassert.includeOrderedMembers = function(superset, subset, msg) {\n  new Assertion(\n    superset,\n    msg,\n    assert.includeOrderedMembers,\n    true\n  ).to.include.ordered.members(subset);\n};\nassert.notIncludeOrderedMembers = function(superset, subset, msg) {\n  new Assertion(\n    superset,\n    msg,\n    assert.notIncludeOrderedMembers,\n    true\n  ).to.not.include.ordered.members(subset);\n};\nassert.includeDeepOrderedMembers = function(superset, subset, msg) {\n  new Assertion(\n    superset,\n    msg,\n    assert.includeDeepOrderedMembers,\n    true\n  ).to.include.deep.ordered.members(subset);\n};\nassert.notIncludeDeepOrderedMembers = function(superset, subset, msg) {\n  new Assertion(\n    superset,\n    msg,\n    assert.notIncludeDeepOrderedMembers,\n    true\n  ).to.not.include.deep.ordered.members(subset);\n};\nassert.oneOf = function(inList, list, msg) {\n  new Assertion(inList, msg, assert.oneOf, true).to.be.oneOf(list);\n};\nassert.isIterable = function(obj, msg) {\n  if (obj == void 0 || !obj[Symbol.iterator]) {\n    msg = msg ? `${msg} expected ${inspect2(obj)} to be an iterable` : `expected ${inspect2(obj)} to be an iterable`;\n    throw new AssertionError(msg, void 0, assert.isIterable);\n  }\n};\nassert.changes = function(fn, obj, prop, msg) {\n  if (arguments.length === 3 && typeof obj === \"function\") {\n    msg = prop;\n    prop = null;\n  }\n  new Assertion(fn, msg, assert.changes, true).to.change(obj, prop);\n};\nassert.changesBy = function(fn, obj, prop, delta, msg) {\n  if (arguments.length === 4 && typeof obj === \"function\") {\n    let tmpMsg = delta;\n    delta = prop;\n    msg = tmpMsg;\n  } else if (arguments.length === 3) {\n    delta = prop;\n    prop = null;\n  }\n  new Assertion(fn, msg, assert.changesBy, true).to.change(obj, prop).by(delta);\n};\nassert.doesNotChange = function(fn, obj, prop, msg) {\n  if (arguments.length === 3 && typeof obj === \"function\") {\n    msg = prop;\n    prop = null;\n  }\n  return new Assertion(fn, msg, assert.doesNotChange, true).to.not.change(\n    obj,\n    prop\n  );\n};\nassert.changesButNotBy = function(fn, obj, prop, delta, msg) {\n  if (arguments.length === 4 && typeof obj === \"function\") {\n    let tmpMsg = delta;\n    delta = prop;\n    msg = tmpMsg;\n  } else if (arguments.length === 3) {\n    delta = prop;\n    prop = null;\n  }\n  new Assertion(fn, msg, assert.changesButNotBy, true).to.change(obj, prop).but.not.by(delta);\n};\nassert.increases = function(fn, obj, prop, msg) {\n  if (arguments.length === 3 && typeof obj === \"function\") {\n    msg = prop;\n    prop = null;\n  }\n  return new Assertion(fn, msg, assert.increases, true).to.increase(obj, prop);\n};\nassert.increasesBy = function(fn, obj, prop, delta, msg) {\n  if (arguments.length === 4 && typeof obj === \"function\") {\n    let tmpMsg = delta;\n    delta = prop;\n    msg = tmpMsg;\n  } else if (arguments.length === 3) {\n    delta = prop;\n    prop = null;\n  }\n  new Assertion(fn, msg, assert.increasesBy, true).to.increase(obj, prop).by(delta);\n};\nassert.doesNotIncrease = function(fn, obj, prop, msg) {\n  if (arguments.length === 3 && typeof obj === \"function\") {\n    msg = prop;\n    prop = null;\n  }\n  return new Assertion(fn, msg, assert.doesNotIncrease, true).to.not.increase(\n    obj,\n    prop\n  );\n};\nassert.increasesButNotBy = function(fn, obj, prop, delta, msg) {\n  if (arguments.length === 4 && typeof obj === \"function\") {\n    let tmpMsg = delta;\n    delta = prop;\n    msg = tmpMsg;\n  } else if (arguments.length === 3) {\n    delta = prop;\n    prop = null;\n  }\n  new Assertion(fn, msg, assert.increasesButNotBy, true).to.increase(obj, prop).but.not.by(delta);\n};\nassert.decreases = function(fn, obj, prop, msg) {\n  if (arguments.length === 3 && typeof obj === \"function\") {\n    msg = prop;\n    prop = null;\n  }\n  return new Assertion(fn, msg, assert.decreases, true).to.decrease(obj, prop);\n};\nassert.decreasesBy = function(fn, obj, prop, delta, msg) {\n  if (arguments.length === 4 && typeof obj === \"function\") {\n    let tmpMsg = delta;\n    delta = prop;\n    msg = tmpMsg;\n  } else if (arguments.length === 3) {\n    delta = prop;\n    prop = null;\n  }\n  new Assertion(fn, msg, assert.decreasesBy, true).to.decrease(obj, prop).by(delta);\n};\nassert.doesNotDecrease = function(fn, obj, prop, msg) {\n  if (arguments.length === 3 && typeof obj === \"function\") {\n    msg = prop;\n    prop = null;\n  }\n  return new Assertion(fn, msg, assert.doesNotDecrease, true).to.not.decrease(\n    obj,\n    prop\n  );\n};\nassert.doesNotDecreaseBy = function(fn, obj, prop, delta, msg) {\n  if (arguments.length === 4 && typeof obj === \"function\") {\n    let tmpMsg = delta;\n    delta = prop;\n    msg = tmpMsg;\n  } else if (arguments.length === 3) {\n    delta = prop;\n    prop = null;\n  }\n  return new Assertion(fn, msg, assert.doesNotDecreaseBy, true).to.not.decrease(obj, prop).by(delta);\n};\nassert.decreasesButNotBy = function(fn, obj, prop, delta, msg) {\n  if (arguments.length === 4 && typeof obj === \"function\") {\n    let tmpMsg = delta;\n    delta = prop;\n    msg = tmpMsg;\n  } else if (arguments.length === 3) {\n    delta = prop;\n    prop = null;\n  }\n  new Assertion(fn, msg, assert.decreasesButNotBy, true).to.decrease(obj, prop).but.not.by(delta);\n};\nassert.ifError = function(val) {\n  if (val) {\n    throw val;\n  }\n};\nassert.isExtensible = function(obj, msg) {\n  new Assertion(obj, msg, assert.isExtensible, true).to.be.extensible;\n};\nassert.isNotExtensible = function(obj, msg) {\n  new Assertion(obj, msg, assert.isNotExtensible, true).to.not.be.extensible;\n};\nassert.isSealed = function(obj, msg) {\n  new Assertion(obj, msg, assert.isSealed, true).to.be.sealed;\n};\nassert.isNotSealed = function(obj, msg) {\n  new Assertion(obj, msg, assert.isNotSealed, true).to.not.be.sealed;\n};\nassert.isFrozen = function(obj, msg) {\n  new Assertion(obj, msg, assert.isFrozen, true).to.be.frozen;\n};\nassert.isNotFrozen = function(obj, msg) {\n  new Assertion(obj, msg, assert.isNotFrozen, true).to.not.be.frozen;\n};\nassert.isEmpty = function(val, msg) {\n  new Assertion(val, msg, assert.isEmpty, true).to.be.empty;\n};\nassert.isNotEmpty = function(val, msg) {\n  new Assertion(val, msg, assert.isNotEmpty, true).to.not.be.empty;\n};\nassert.containsSubset = function(val, exp, msg) {\n  new Assertion(val, msg).to.containSubset(exp);\n};\nassert.doesNotContainSubset = function(val, exp, msg) {\n  new Assertion(val, msg).to.not.containSubset(exp);\n};\nvar aliases = [\n  [\"isOk\", \"ok\"],\n  [\"isNotOk\", \"notOk\"],\n  [\"throws\", \"throw\"],\n  [\"throws\", \"Throw\"],\n  [\"isExtensible\", \"extensible\"],\n  [\"isNotExtensible\", \"notExtensible\"],\n  [\"isSealed\", \"sealed\"],\n  [\"isNotSealed\", \"notSealed\"],\n  [\"isFrozen\", \"frozen\"],\n  [\"isNotFrozen\", \"notFrozen\"],\n  [\"isEmpty\", \"empty\"],\n  [\"isNotEmpty\", \"notEmpty\"],\n  [\"isCallable\", \"isFunction\"],\n  [\"isNotCallable\", \"isNotFunction\"],\n  [\"containsSubset\", \"containSubset\"]\n];\nfor (const [name, as] of aliases) {\n  assert[as] = assert[name];\n}\n\n// lib/chai.js\nvar used = [];\nfunction use(fn) {\n  const exports = {\n    use,\n    AssertionError,\n    util: utils_exports,\n    config,\n    expect,\n    assert,\n    Assertion,\n    ...should_exports\n  };\n  if (!~used.indexOf(fn)) {\n    fn(exports, utils_exports);\n    used.push(fn);\n  }\n  return exports;\n}\n__name(use, \"use\");\nexport {\n  Assertion,\n  AssertionError,\n  Should,\n  assert,\n  config,\n  expect,\n  should,\n  use,\n  utils_exports as util\n};\n","import { p as plugins } from './index.M2dsQ_UQ.js';\n\nconst serialize = (val, config, indentation, depth, refs, printer) => {\n\t// Serialize a non-default name, even if config.printFunctionName is false.\n\tconst name = val.getMockName();\n\tconst nameString = name === \"vi.fn()\" ? \"\" : ` ${name}`;\n\tlet callsString = \"\";\n\tif (val.mock.calls.length !== 0) {\n\t\tconst indentationNext = indentation + config.indent;\n\t\tcallsString = ` {${config.spacingOuter}${indentationNext}\"calls\": ${printer(val.mock.calls, config, indentationNext, depth, refs)}${config.min ? \", \" : \",\"}${config.spacingOuter}${indentationNext}\"results\": ${printer(val.mock.results, config, indentationNext, depth, refs)}${config.min ? \"\" : \",\"}${config.spacingOuter}${indentation}}`;\n\t}\n\treturn `[MockFunction${nameString}]${callsString}`;\n};\nconst test = (val) => val && !!val._isMockFunction;\nconst plugin = {\n\tserialize,\n\ttest\n};\n\nconst { DOMCollection, DOMElement, Immutable, ReactElement, ReactTestComponent, AsymmetricMatcher } = plugins;\nlet PLUGINS = [\n\tReactTestComponent,\n\tReactElement,\n\tDOMElement,\n\tDOMCollection,\n\tImmutable,\n\tAsymmetricMatcher,\n\tplugin\n];\nfunction addSerializer(plugin) {\n\tPLUGINS = [plugin].concat(PLUGINS);\n}\nfunction getSerializers() {\n\treturn PLUGINS;\n}\n\nexport { addSerializer as a, getSerializers as g };\n","const lineSplitRE = /\\r?\\n/;\nfunction positionToOffset(source, lineNumber, columnNumber) {\n\tconst lines = source.split(lineSplitRE);\n\tconst nl = /\\r\\n/.test(source) ? 2 : 1;\n\tlet start = 0;\n\tif (lineNumber > lines.length) return source.length;\n\tfor (let i = 0; i < lineNumber - 1; i++) start += lines[i].length + nl;\n\treturn start + columnNumber;\n}\nfunction offsetToLineNumber(source, offset) {\n\tif (offset > source.length) throw new Error(`offset is longer than source length! offset ${offset} > length ${source.length}`);\n\tconst lines = source.split(lineSplitRE);\n\tconst nl = /\\r\\n/.test(source) ? 2 : 1;\n\tlet counted = 0;\n\tlet line = 0;\n\tfor (; line < lines.length; line++) {\n\t\tconst lineLength = lines[line].length + nl;\n\t\tif (counted + lineLength >= offset) break;\n\t\tcounted += lineLength;\n\t}\n\treturn line + 1;\n}\n\nexport { lineSplitRE as l, offsetToLineNumber as o, positionToOffset as p };\n","let SOURCEMAPPING_URL = \"sourceMa\";\nSOURCEMAPPING_URL += \"ppingURL\";\n//#endregion\n//#region src/shared/utils.ts\nconst isWindows = typeof process < \"u\" && process.platform === \"win32\";\n/**\n* Undo {@link wrapId}'s `/@id/` and null byte replacements.\n*/\nfunction unwrapId(id) {\n\treturn id.startsWith(\"/@id/\") ? id.slice(5).replace(\"__x00__\", \"\\0\") : id;\n}\nconst windowsSlashRE = /\\\\/g;\nfunction slash(p) {\n\treturn p.replace(windowsSlashRE, \"/\");\n}\nconst postfixRE = /[?#].*$/;\nfunction cleanUrl(url) {\n\treturn url.replace(postfixRE, \"\");\n}\nfunction isPrimitive(value) {\n\treturn !value || typeof value != \"object\" && typeof value != \"function\";\n}\nconst AsyncFunction = async function() {}.constructor;\nlet asyncFunctionDeclarationPaddingLineCount;\nfunction getAsyncFunctionDeclarationPaddingLineCount() {\n\tif (asyncFunctionDeclarationPaddingLineCount === void 0) {\n\t\tlet body = \"/*code*/\", source = new AsyncFunction(\"a\", \"b\", body).toString();\n\t\tasyncFunctionDeclarationPaddingLineCount = source.slice(0, source.indexOf(body)).split(\"\\n\").length - 1;\n\t}\n\treturn asyncFunctionDeclarationPaddingLineCount;\n}\nfunction promiseWithResolvers() {\n\tlet resolve, reject;\n\treturn {\n\t\tpromise: new Promise((_resolve, _reject) => {\n\t\t\tresolve = _resolve, reject = _reject;\n\t\t}),\n\t\tresolve,\n\t\treject\n\t};\n}\n//#endregion\n//#region ../../node_modules/.pnpm/@jridgewell+sourcemap-codec@1.6.0/node_modules/@jridgewell/sourcemap-codec/dist/sourcemap-codec.mjs\nvar comma = 44, chars = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\", intToChar = /* @__PURE__ */ new Uint8Array(64), charToInt = /* @__PURE__ */ new Uint8Array(128);\nfor (let i = 0; i < chars.length; i++) {\n\tlet c = chars.charCodeAt(i);\n\tintToChar[i] = c, charToInt[c] = i;\n}\nfunction decodeInteger(reader) {\n\tlet value = 0, shift = 0, integer = 0;\n\tdo\n\t\tinteger = charToInt[reader.next()], value |= (integer & 31) << shift, shift += 5;\n\twhile (integer & 32);\n\treturn value;\n}\nfunction decodeSign(num) {\n\treturn num & 1 ? -2147483648 | -(num >>> 1) : num >>> 1;\n}\nfunction hasMoreVlq(reader, max) {\n\treturn reader.pos >= max ? !1 : reader.peek() !== comma;\n}\nvar StringReader = class {\n\tconstructor(buffer) {\n\t\tthis.pos = 0, this.buffer = buffer;\n\t}\n\tnext() {\n\t\treturn this.buffer.charCodeAt(this.pos++);\n\t}\n\tpeek() {\n\t\treturn this.buffer.charCodeAt(this.pos);\n\t}\n\tindexOf(char) {\n\t\tlet { buffer, pos } = this, idx = buffer.indexOf(char, pos);\n\t\treturn idx === -1 ? buffer.length : idx;\n\t}\n};\nfunction decode(mappings) {\n\tlet { length } = mappings, reader = new StringReader(mappings), decoded = [], genColumn = 0, sourcesIndex = 0, sourceLine = 0, sourceColumn = 0, namesIndex = 0;\n\tdo {\n\t\tlet semi = reader.indexOf(\";\"), line = [], sorted = !0, lastCol = 0;\n\t\tfor (genColumn = 0; reader.pos < semi;) {\n\t\t\tlet seg;\n\t\t\tgenColumn += decodeSign(decodeInteger(reader)), genColumn < lastCol && (sorted = !1), lastCol = genColumn, hasMoreVlq(reader, semi) ? (sourcesIndex += decodeSign(decodeInteger(reader)), sourceLine += decodeSign(decodeInteger(reader)), sourceColumn += decodeSign(decodeInteger(reader)), hasMoreVlq(reader, semi) ? (namesIndex += decodeSign(decodeInteger(reader)), seg = [\n\t\t\t\tgenColumn,\n\t\t\t\tsourcesIndex,\n\t\t\t\tsourceLine,\n\t\t\t\tsourceColumn,\n\t\t\t\tnamesIndex\n\t\t\t]) : seg = [\n\t\t\t\tgenColumn,\n\t\t\t\tsourcesIndex,\n\t\t\t\tsourceLine,\n\t\t\t\tsourceColumn\n\t\t\t]) : seg = [genColumn], line.push(seg), reader.pos++;\n\t\t}\n\t\tsorted || sort(line), decoded.push(line), reader.pos = semi + 1;\n\t} while (reader.pos <= length);\n\treturn decoded;\n}\nfunction sort(line) {\n\tline.sort(sortComparator);\n}\nfunction sortComparator(a, b) {\n\treturn a[0] - b[0];\n}\n//#endregion\n//#region ../../node_modules/.pnpm/@jridgewell+trace-mapping@0.3.31/node_modules/@jridgewell/trace-mapping/dist/trace-mapping.mjs\nvar COLUMN = 0, SOURCES_INDEX = 1, SOURCE_LINE = 2, SOURCE_COLUMN = 3, NAMES_INDEX = 4, found = !1;\nfunction binarySearch(haystack, needle, low, high) {\n\tfor (; low <= high;) {\n\t\tlet mid = low + (high - low >> 1), cmp = haystack[mid][COLUMN] - needle;\n\t\tif (cmp === 0) return found = !0, mid;\n\t\tcmp < 0 ? low = mid + 1 : high = mid - 1;\n\t}\n\treturn found = !1, low - 1;\n}\nfunction upperBound(haystack, needle, index) {\n\tfor (let i = index + 1; i < haystack.length && haystack[i][COLUMN] === needle; index = i++);\n\treturn index;\n}\nfunction lowerBound(haystack, needle, index) {\n\tfor (let i = index - 1; i >= 0 && haystack[i][COLUMN] === needle; index = i--);\n\treturn index;\n}\nfunction memoizedBinarySearch(haystack, needle, state, key) {\n\tlet { lastKey, lastNeedle, lastIndex } = state, low = 0, high = haystack.length - 1;\n\tif (key === lastKey) {\n\t\tif (needle === lastNeedle) return found = lastIndex !== -1 && haystack[lastIndex][COLUMN] === needle, lastIndex;\n\t\tneedle >= lastNeedle ? low = lastIndex === -1 ? 0 : lastIndex : high = lastIndex;\n\t}\n\treturn state.lastKey = key, state.lastNeedle = needle, state.lastIndex = binarySearch(haystack, needle, low, high);\n}\nvar LINE_GTR_ZERO = \"`line` must be greater than 0 (lines start at line 1)\", COL_GTR_EQ_ZERO = \"`column` must be greater than or equal to 0 (columns start at column 0)\";\nfunction cast(map) {\n\treturn map;\n}\nfunction decodedMappings(map) {\n\tvar _a;\n\treturn (_a = cast(map))._decoded || (_a._decoded = decode(cast(map)._encoded));\n}\nfunction originalPositionFor(map, needle) {\n\tlet { line, column, bias } = needle;\n\tif (line--, line < 0) throw Error(LINE_GTR_ZERO);\n\tif (column < 0) throw Error(COL_GTR_EQ_ZERO);\n\tlet decoded = decodedMappings(map);\n\tif (line >= decoded.length) return OMapping(null, null, null, null);\n\tlet segments = decoded[line], index = traceSegmentInternal(segments, cast(map)._decodedMemo, line, column, bias || 1);\n\tif (index === -1) return OMapping(null, null, null, null);\n\tlet segment = segments[index];\n\tif (segment.length === 1) return OMapping(null, null, null, null);\n\tlet { names, resolvedSources } = map;\n\treturn OMapping(resolvedSources[segment[SOURCES_INDEX]], segment[SOURCE_LINE] + 1, segment[SOURCE_COLUMN], segment.length === 5 ? names[segment[NAMES_INDEX]] : null);\n}\nfunction OMapping(source, line, column, name) {\n\treturn {\n\t\tsource,\n\t\tline,\n\t\tcolumn,\n\t\tname\n\t};\n}\nfunction traceSegmentInternal(segments, memo, line, column, bias) {\n\tlet index = memoizedBinarySearch(segments, column, memo, line);\n\treturn found ? index = (bias === -1 ? upperBound : lowerBound)(segments, column, index) : bias === -1 && index++, index === -1 || index === segments.length ? -1 : index;\n}\n//#endregion\n//#region ../../node_modules/.pnpm/pathe@2.0.3/node_modules/pathe/dist/shared/pathe.M-eThtNZ.mjs\nconst _DRIVE_LETTER_START_RE = /^[A-Za-z]:\\//;\nfunction normalizeWindowsPath(input = \"\") {\n\treturn input && input.replace(/\\\\/g, \"/\").replace(_DRIVE_LETTER_START_RE, (r) => r.toUpperCase());\n}\nconst _IS_ABSOLUTE_RE = /^[/\\\\](?![/\\\\])|^[/\\\\]{2}(?!\\.)|^[A-Za-z]:[/\\\\]/, _DRIVE_LETTER_RE = /^[A-Za-z]:$/;\nfunction cwd() {\n\treturn typeof process < \"u\" && typeof process.cwd == \"function\" ? process.cwd().replace(/\\\\/g, \"/\") : \"/\";\n}\nconst resolve = function(...arguments_) {\n\targuments_ = arguments_.map((argument) => normalizeWindowsPath(argument));\n\tlet resolvedPath = \"\", resolvedAbsolute = !1;\n\tfor (let index = arguments_.length - 1; index >= -1 && !resolvedAbsolute; index--) {\n\t\tlet path = index >= 0 ? arguments_[index] : cwd();\n\t\tpath && path.length !== 0 && (resolvedPath = `${path}/${resolvedPath}`, resolvedAbsolute = isAbsolute(path));\n\t}\n\treturn resolvedPath = normalizeString(resolvedPath, !resolvedAbsolute), resolvedAbsolute && !isAbsolute(resolvedPath) ? `/${resolvedPath}` : resolvedPath.length > 0 ? resolvedPath : \".\";\n};\nfunction normalizeString(path, allowAboveRoot) {\n\tlet res = \"\", lastSegmentLength = 0, lastSlash = -1, dots = 0, char = null;\n\tfor (let index = 0; index <= path.length; ++index) {\n\t\tif (index < path.length) char = path[index];\n\t\telse if (char === \"/\") break;\n\t\telse char = \"/\";\n\t\tif (char === \"/\") {\n\t\t\tif (lastSlash !== index - 1 && dots !== 1) {\n\t\t\t\tif (dots === 2) {\n\t\t\t\t\tif (res.length < 2 || lastSegmentLength !== 2 || res[res.length - 1] !== \".\" || res[res.length - 2] !== \".\") {\n\t\t\t\t\t\tif (res.length > 2) {\n\t\t\t\t\t\t\tlet lastSlashIndex = res.lastIndexOf(\"/\");\n\t\t\t\t\t\t\tlastSlashIndex === -1 ? (res = \"\", lastSegmentLength = 0) : (res = res.slice(0, lastSlashIndex), lastSegmentLength = res.length - 1 - res.lastIndexOf(\"/\")), lastSlash = index, dots = 0;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (res.length > 0) {\n\t\t\t\t\t\t\tres = \"\", lastSegmentLength = 0, lastSlash = index, dots = 0;\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tallowAboveRoot && (res += res.length > 0 ? \"/..\" : \"..\", lastSegmentLength = 2);\n\t\t\t\t} else res.length > 0 ? res += `/${path.slice(lastSlash + 1, index)}` : res = path.slice(lastSlash + 1, index), lastSegmentLength = index - lastSlash - 1;\n\t\t\t}\n\t\t\tlastSlash = index, dots = 0;\n\t\t} else char === \".\" && dots !== -1 ? ++dots : dots = -1;\n\t}\n\treturn res;\n}\nconst isAbsolute = function(p) {\n\treturn _IS_ABSOLUTE_RE.test(p);\n}, dirname = function(p) {\n\tlet segments = normalizeWindowsPath(p).replace(/\\/$/, \"\").split(\"/\").slice(0, -1);\n\treturn segments.length === 1 && _DRIVE_LETTER_RE.test(segments[0]) && (segments[0] += \"/\"), segments.join(\"/\") || (isAbsolute(p) ? \"/\" : \".\");\n}, textDecoder = new TextDecoder(), decodeBase64 = (() => {\n\tlet capturedBuffer = typeof Buffer == \"function\" ? Buffer : void 0;\n\treturn capturedBuffer && typeof capturedBuffer.from == \"function\" ? (base64) => capturedBuffer.from(base64, \"base64\").toString(\"utf-8\") : (base64) => textDecoder.decode(Uint8Array.from(atob(base64), (c) => c.charCodeAt(0)));\n})(), percentRegEx = /%/g, backslashRegEx = /\\\\/g, newlineRegEx = /\\n/g, carriageReturnRegEx = /\\r/g, tabRegEx = /\\t/g, questionRegex = /\\?/g, hashRegex = /#/g;\nfunction encodePathChars(filepath) {\n\treturn filepath.includes(\"%\") && (filepath = filepath.replace(percentRegEx, \"%25\")), !isWindows && filepath.includes(\"\\\\\") && (filepath = filepath.replace(backslashRegEx, \"%5C\")), filepath.includes(\"\\n\") && (filepath = filepath.replace(newlineRegEx, \"%0A\")), filepath.includes(\"\\r\") && (filepath = filepath.replace(carriageReturnRegEx, \"%0D\")), filepath.includes(\"\t\") && (filepath = filepath.replace(tabRegEx, \"%09\")), filepath;\n}\nconst posixDirname = dirname, posixResolve = resolve;\nfunction posixPathToFileHref(posixPath) {\n\tlet resolved = posixResolve(posixPath), filePathLast = posixPath.charCodeAt(posixPath.length - 1);\n\treturn (filePathLast === 47 || isWindows && filePathLast === 92) && resolved.at(-1) !== \"/\" && (resolved += \"/\"), resolved = encodePathChars(resolved), resolved.includes(\"?\") && (resolved = resolved.replace(questionRegex, \"%3F\")), resolved.includes(\"#\") && (resolved = resolved.replace(hashRegex, \"%23\")), new URL(`file://${resolved}`).href;\n}\nfunction toWindowsPath(path) {\n\treturn path.replace(/\\//g, \"\\\\\");\n}\n//#endregion\n//#region src/module-runner/sourcemap/decoder.ts\nvar DecodedMap = class {\n\tmap;\n\t_encoded;\n\t_decoded;\n\t_decodedMemo;\n\turl;\n\tfile;\n\tversion;\n\tnames = [];\n\tresolvedSources;\n\tconstructor(map, from) {\n\t\tthis.map = map;\n\t\tlet { mappings, names, sources } = map;\n\t\tthis.version = map.version, this.names = names || [], this._encoded = mappings || \"\", this._decodedMemo = memoizedState(), this.url = from, this.file = from;\n\t\tlet originDir = posixDirname(from);\n\t\tthis.resolvedSources = (sources || []).map((s) => posixResolve(originDir, s || \"\"));\n\t}\n};\nfunction memoizedState() {\n\treturn {\n\t\tlastKey: -1,\n\t\tlastNeedle: -1,\n\t\tlastIndex: -1\n\t};\n}\nfunction getOriginalPosition(map, needle) {\n\tlet result = originalPositionFor(map, needle);\n\treturn result.column == null ? null : result;\n}\n//#endregion\n//#region src/module-runner/evaluatedModules.ts\nconst MODULE_RUNNER_SOURCEMAPPING_REGEXP = RegExp(`//# ${SOURCEMAPPING_URL}=data:application/json;base64,(.+)`);\nvar EvaluatedModuleNode = class {\n\tid;\n\turl;\n\timporters = /* @__PURE__ */ new Set();\n\timports = /* @__PURE__ */ new Set();\n\tevaluated = !1;\n\tmeta;\n\tpromise;\n\texports;\n\tfile;\n\tmap;\n\tconstructor(id, url) {\n\t\tthis.id = id, this.url = url, this.file = cleanUrl(id);\n\t}\n}, EvaluatedModules = class {\n\tidToModuleMap = /* @__PURE__ */ new Map();\n\tfileToModulesMap = /* @__PURE__ */ new Map();\n\turlToIdModuleMap = /* @__PURE__ */ new Map();\n\t/**\n\t* Returns the module node by the resolved module ID. Usually, module ID is\n\t* the file system path with query and/or hash. It can also be a virtual module.\n\t*\n\t* Module runner graph will have 1 to 1 mapping with the server module graph.\n\t* @param id Resolved module ID\n\t*/\n\tgetModuleById(id) {\n\t\treturn this.idToModuleMap.get(id);\n\t}\n\t/**\n\t* Returns all modules related to the file system path. Different modules\n\t* might have different query parameters or hash, so it's possible to have\n\t* multiple modules for the same file.\n\t* @param file The file system path of the module\n\t*/\n\tgetModulesByFile(file) {\n\t\treturn this.fileToModulesMap.get(file);\n\t}\n\t/**\n\t* Returns the module node by the URL that was used in the import statement.\n\t* Unlike module graph on the server, the URL is not resolved and is used as is.\n\t* @param url Server URL that was used in the import statement\n\t*/\n\tgetModuleByUrl(url) {\n\t\treturn this.urlToIdModuleMap.get(unwrapId(url));\n\t}\n\t/**\n\t* Ensure that module is in the graph. If the module is already in the graph,\n\t* it will return the existing module node. Otherwise, it will create a new\n\t* module node and add it to the graph.\n\t* @param id Resolved module ID\n\t* @param url URL that was used in the import statement\n\t*/\n\tensureModule(id, url) {\n\t\tif (id = normalizeModuleId(id), this.idToModuleMap.has(id)) {\n\t\t\tlet moduleNode = this.idToModuleMap.get(id);\n\t\t\treturn this.urlToIdModuleMap.set(url, moduleNode), moduleNode;\n\t\t}\n\t\tlet moduleNode = new EvaluatedModuleNode(id, url);\n\t\tthis.idToModuleMap.set(id, moduleNode), this.urlToIdModuleMap.set(url, moduleNode);\n\t\tlet fileModules = this.fileToModulesMap.get(moduleNode.file) || /* @__PURE__ */ new Set();\n\t\treturn fileModules.add(moduleNode), this.fileToModulesMap.set(moduleNode.file, fileModules), moduleNode;\n\t}\n\tinvalidateModule(node) {\n\t\tnode.evaluated = !1, node.meta = void 0, node.map = void 0, node.promise = void 0, node.exports = void 0, node.imports.clear();\n\t}\n\t/**\n\t* Extracts the inlined source map from the module code and returns the decoded\n\t* source map. If the source map is not inlined, it will return null.\n\t* @param id Resolved module ID\n\t*/\n\tgetModuleSourceMapById(id) {\n\t\tlet mod = this.getModuleById(id);\n\t\tif (!mod) return null;\n\t\tif (mod.map) return mod.map;\n\t\tif (!mod.meta || !(\"code\" in mod.meta)) return null;\n\t\tlet pattern = `//# ${SOURCEMAPPING_URL}=data:application/json;base64,`, lastIndex = mod.meta.code.lastIndexOf(pattern);\n\t\tif (lastIndex === -1) return null;\n\t\tlet mapString = MODULE_RUNNER_SOURCEMAPPING_REGEXP.exec(mod.meta.code.slice(lastIndex))?.[1];\n\t\treturn mapString ? (mod.map = new DecodedMap(JSON.parse(decodeBase64(mapString)), mod.file), mod.map) : null;\n\t}\n\tclear() {\n\t\tthis.idToModuleMap.clear(), this.fileToModulesMap.clear(), this.urlToIdModuleMap.clear();\n\t}\n};\nconst prefixedBuiltins = /* @__PURE__ */ new Set([\n\t\"node:sea\",\n\t\"node:sqlite\",\n\t\"node:test\",\n\t\"node:test/reporters\"\n]);\nfunction normalizeModuleId(file) {\n\treturn prefixedBuiltins.has(file) ? file : slash(file).replace(/^\\/@fs\\//, isWindows ? \"\" : \"/\").replace(/^node:/, \"\").replace(/^\\/+/, \"/\").replace(/^file:\\/+/, isWindows ? \"\" : \"/\");\n}\n//#endregion\n//#region src/shared/builtin.ts\nfunction createIsBuiltin(builtins) {\n\tlet plainBuiltinsSet = new Set(builtins.filter((builtin) => typeof builtin == \"string\")), regexBuiltins = builtins.filter((builtin) => typeof builtin != \"string\");\n\treturn (id) => plainBuiltinsSet.has(id) || regexBuiltins.some((regexp) => regexp.test(id));\n}\n//#endregion\n//#region src/shared/hmr.ts\nvar HMRContext = class {\n\thmrClient;\n\townerPath;\n\tnewListeners;\n\tconstructor(hmrClient, ownerPath) {\n\t\tthis.hmrClient = hmrClient, this.ownerPath = ownerPath, hmrClient.dataMap.has(ownerPath) || hmrClient.dataMap.set(ownerPath, {});\n\t\tlet mod = hmrClient.hotModulesMap.get(ownerPath);\n\t\tmod && (mod.callbacks = []);\n\t\tlet staleListeners = hmrClient.ctxToListenersMap.get(ownerPath);\n\t\tif (staleListeners) for (let [event, staleFns] of staleListeners) {\n\t\t\tlet listeners = hmrClient.customListenersMap.get(event);\n\t\t\tlisteners && hmrClient.customListenersMap.set(event, listeners.filter((l) => !staleFns.includes(l)));\n\t\t}\n\t\tthis.newListeners = /* @__PURE__ */ new Map(), hmrClient.ctxToListenersMap.set(ownerPath, this.newListeners);\n\t}\n\tget data() {\n\t\treturn this.hmrClient.dataMap.get(this.ownerPath);\n\t}\n\taccept(deps, callback) {\n\t\tif (typeof deps == \"function\" || !deps) this.acceptDeps([this.ownerPath], ([mod]) => deps?.(mod));\n\t\telse if (typeof deps == \"string\") this.acceptDeps([deps], ([mod]) => callback?.(mod));\n\t\telse if (Array.isArray(deps)) this.acceptDeps(deps, callback);\n\t\telse throw Error(\"invalid hot.accept() usage.\");\n\t}\n\tacceptExports(_, callback) {\n\t\tthis.acceptDeps([this.ownerPath], ([mod]) => callback?.(mod));\n\t}\n\tdispose(cb) {\n\t\tthis.hmrClient.disposeMap.set(this.ownerPath, cb);\n\t}\n\tprune(cb) {\n\t\tthis.hmrClient.pruneMap.set(this.ownerPath, cb);\n\t}\n\tdecline() {}\n\tinvalidate(message) {\n\t\tlet firstInvalidatedBy = this.hmrClient.currentFirstInvalidatedBy ?? this.ownerPath;\n\t\tthis.hmrClient.notifyListeners(\"vite:invalidate\", {\n\t\t\tpath: this.ownerPath,\n\t\t\tmessage,\n\t\t\tfirstInvalidatedBy\n\t\t}), this.send(\"vite:invalidate\", {\n\t\t\tpath: this.ownerPath,\n\t\t\tmessage,\n\t\t\tfirstInvalidatedBy\n\t\t}), this.hmrClient.logger.debug(`invalidate ${this.ownerPath}${message ? `: ${message}` : \"\"}`);\n\t}\n\ton(event, cb) {\n\t\tlet addToMap = (map) => {\n\t\t\tlet existing = map.get(event) || [];\n\t\t\texisting.push(cb), map.set(event, existing);\n\t\t};\n\t\taddToMap(this.hmrClient.customListenersMap), addToMap(this.newListeners);\n\t}\n\toff(event, cb) {\n\t\tlet removeFromMap = (map) => {\n\t\t\tlet existing = map.get(event);\n\t\t\tif (existing === void 0) return;\n\t\t\tlet pruned = existing.filter((l) => l !== cb);\n\t\t\tif (pruned.length === 0) {\n\t\t\t\tmap.delete(event);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tmap.set(event, pruned);\n\t\t};\n\t\tremoveFromMap(this.hmrClient.customListenersMap), removeFromMap(this.newListeners);\n\t}\n\tsend(event, data) {\n\t\tthis.hmrClient.send({\n\t\t\ttype: \"custom\",\n\t\t\tevent,\n\t\t\tdata\n\t\t});\n\t}\n\tacceptDeps(deps, callback = () => {}) {\n\t\tlet mod = this.hmrClient.hotModulesMap.get(this.ownerPath) || {\n\t\t\tid: this.ownerPath,\n\t\t\tcallbacks: []\n\t\t};\n\t\tmod.callbacks.push({\n\t\t\tdeps,\n\t\t\tfn: callback\n\t\t}), this.hmrClient.hotModulesMap.set(this.ownerPath, mod);\n\t}\n}, HMRClient = class {\n\tlogger;\n\ttransport;\n\timportUpdatedModule;\n\thotModulesMap = /* @__PURE__ */ new Map();\n\tdisposeMap = /* @__PURE__ */ new Map();\n\tpruneMap = /* @__PURE__ */ new Map();\n\tdataMap = /* @__PURE__ */ new Map();\n\tcustomListenersMap = /* @__PURE__ */ new Map();\n\tctxToListenersMap = /* @__PURE__ */ new Map();\n\tcurrentFirstInvalidatedBy;\n\tconstructor(logger, transport, importUpdatedModule) {\n\t\tthis.logger = logger, this.transport = transport, this.importUpdatedModule = importUpdatedModule;\n\t}\n\tasync notifyListeners(event, data) {\n\t\tlet cbs = this.customListenersMap.get(event);\n\t\tcbs && await Promise.allSettled(cbs.map((cb) => cb(data)));\n\t}\n\tsend(payload) {\n\t\tthis.transport.send(payload).catch((err) => {\n\t\t\tthis.logger.error(err);\n\t\t});\n\t}\n\tclear() {\n\t\tthis.hotModulesMap.clear(), this.disposeMap.clear(), this.pruneMap.clear(), this.dataMap.clear(), this.customListenersMap.clear(), this.ctxToListenersMap.clear();\n\t}\n\tasync prunePaths(paths) {\n\t\ttry {\n\t\t\tawait Promise.all(paths.map((path) => {\n\t\t\t\tlet disposer = this.disposeMap.get(path);\n\t\t\t\tif (disposer) return disposer(this.dataMap.get(path));\n\t\t\t})), await Promise.all(paths.map((path) => {\n\t\t\t\tlet fn = this.pruneMap.get(path);\n\t\t\t\tif (fn) return fn(this.dataMap.get(path));\n\t\t\t}));\n\t\t} finally {\n\t\t\tpaths.forEach((path) => this.dataMap.delete(path));\n\t\t}\n\t}\n\twarnFailedUpdate(err, path) {\n\t\t(!(err instanceof Error) || !err.message.includes(\"fetch\")) && this.logger.error(err), this.logger.error(`Failed to reload ${path}. This could be due to syntax errors or importing non-existent modules. (see errors above)`);\n\t}\n\tupdateQueue = [];\n\tpendingUpdateQueue = !1;\n\t/**\n\t* buffer multiple hot updates triggered by the same src change\n\t* so that they are invoked in the same order they were sent.\n\t* (otherwise the order may be inconsistent because of the http request round trip)\n\t*/\n\tasync queueUpdate(payload) {\n\t\tif (this.updateQueue.push(this.fetchUpdate(payload)), !this.pendingUpdateQueue) {\n\t\t\tthis.pendingUpdateQueue = !0, await Promise.resolve(), this.pendingUpdateQueue = !1;\n\t\t\tlet loading = [...this.updateQueue];\n\t\t\tthis.updateQueue = [], (await Promise.all(loading)).forEach((fn) => fn && fn());\n\t\t}\n\t}\n\tasync fetchUpdate(update) {\n\t\tlet { path, acceptedPath, firstInvalidatedBy } = update, mod = this.hotModulesMap.get(path);\n\t\tif (!mod) return;\n\t\tlet fetchedModule, isSelfUpdate = path === acceptedPath, qualifiedCallbacks = mod.callbacks.filter(({ deps }) => deps.includes(acceptedPath));\n\t\tif (isSelfUpdate || qualifiedCallbacks.length > 0) {\n\t\t\tlet disposer = this.disposeMap.get(acceptedPath);\n\t\t\tdisposer && await disposer(this.dataMap.get(acceptedPath));\n\t\t\ttry {\n\t\t\t\tfetchedModule = await this.importUpdatedModule(update);\n\t\t\t} catch (e) {\n\t\t\t\tthis.warnFailedUpdate(e, acceptedPath);\n\t\t\t}\n\t\t}\n\t\treturn () => {\n\t\t\ttry {\n\t\t\t\tthis.currentFirstInvalidatedBy = firstInvalidatedBy;\n\t\t\t\tfor (let { deps, fn } of qualifiedCallbacks) fn(deps.map((dep) => dep === acceptedPath ? fetchedModule : void 0));\n\t\t\t\tlet loggedPath = isSelfUpdate ? path : `${acceptedPath} via ${path}`;\n\t\t\t\tthis.logger.debug(`hot updated: ${loggedPath}`);\n\t\t\t} finally {\n\t\t\t\tthis.currentFirstInvalidatedBy = void 0;\n\t\t\t}\n\t\t};\n\t}\n};\n//#endregion\n//#region ../../node_modules/.pnpm/nanoid@5.1.16/node_modules/nanoid/non-secure/index.js\nlet nanoid = (size = 21) => {\n\tlet id = \"\", i = size | 0;\n\tfor (; i-- > 0;) id += \"useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict\"[Math.random() * 64 | 0];\n\treturn id;\n};\n//#endregion\n//#region src/shared/moduleRunnerTransport.ts\nfunction reviveInvokeError(e) {\n\tlet error = Error(e.message || \"Unknown invoke error\");\n\treturn Object.assign(error, e, { runnerError: /* @__PURE__ */ Error(\"RunnerError\") }), error;\n}\nconst createInvokeableTransport = (transport) => {\n\tif (transport.invoke) return {\n\t\t...transport,\n\t\tasync invoke(name, data) {\n\t\t\tlet result = await transport.invoke({\n\t\t\t\ttype: \"custom\",\n\t\t\t\tevent: \"vite:invoke\",\n\t\t\t\tdata: {\n\t\t\t\t\tid: \"send\",\n\t\t\t\t\tname,\n\t\t\t\t\tdata\n\t\t\t\t}\n\t\t\t});\n\t\t\tif (\"error\" in result) throw reviveInvokeError(result.error);\n\t\t\treturn result.result;\n\t\t}\n\t};\n\tif (!transport.send || !transport.connect) throw Error(\"transport must implement send and connect when invoke is not implemented\");\n\tlet rpcPromises = /* @__PURE__ */ new Map();\n\treturn {\n\t\t...transport,\n\t\tconnect({ onMessage, onDisconnection }) {\n\t\t\treturn transport.connect({\n\t\t\t\tonMessage(payload) {\n\t\t\t\t\tif (payload.type === \"custom\" && payload.event === \"vite:invoke\") {\n\t\t\t\t\t\tlet data = payload.data;\n\t\t\t\t\t\tif (data.id.startsWith(\"response:\")) {\n\t\t\t\t\t\t\tlet invokeId = data.id.slice(9), promise = rpcPromises.get(invokeId);\n\t\t\t\t\t\t\tif (!promise) return;\n\t\t\t\t\t\t\tpromise.timeoutId && clearTimeout(promise.timeoutId), rpcPromises.delete(invokeId);\n\t\t\t\t\t\t\tlet { error, result } = data.data;\n\t\t\t\t\t\t\terror ? promise.reject(error) : promise.resolve(result);\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tonMessage(payload);\n\t\t\t\t},\n\t\t\t\tonDisconnection\n\t\t\t});\n\t\t},\n\t\tdisconnect() {\n\t\t\treturn rpcPromises.forEach((promise) => {\n\t\t\t\tpromise.reject(/* @__PURE__ */ Error(`transport was disconnected, cannot call ${JSON.stringify(promise.name)}`));\n\t\t\t}), rpcPromises.clear(), transport.disconnect?.();\n\t\t},\n\t\tsend(data) {\n\t\t\treturn transport.send(data);\n\t\t},\n\t\tasync invoke(name, data) {\n\t\t\tlet promiseId = nanoid(), wrappedData = {\n\t\t\t\ttype: \"custom\",\n\t\t\t\tevent: \"vite:invoke\",\n\t\t\t\tdata: {\n\t\t\t\t\tname,\n\t\t\t\t\tid: `send:${promiseId}`,\n\t\t\t\t\tdata\n\t\t\t\t}\n\t\t\t}, sendPromise = transport.send(wrappedData), { promise, resolve, reject } = promiseWithResolvers(), timeout = transport.timeout ?? 6e4, timeoutId;\n\t\t\ttimeout > 0 && (timeoutId = setTimeout(() => {\n\t\t\t\trpcPromises.delete(promiseId), reject(/* @__PURE__ */ Error(`transport invoke timed out after ${timeout}ms (data: ${JSON.stringify(wrappedData)})`));\n\t\t\t}, timeout), timeoutId?.unref?.()), rpcPromises.set(promiseId, {\n\t\t\t\tresolve,\n\t\t\t\treject,\n\t\t\t\tname,\n\t\t\t\ttimeoutId\n\t\t\t}), sendPromise && sendPromise.catch((err) => {\n\t\t\t\tclearTimeout(timeoutId), rpcPromises.delete(promiseId), reject(err);\n\t\t\t});\n\t\t\ttry {\n\t\t\t\treturn await promise;\n\t\t\t} catch (err) {\n\t\t\t\tthrow reviveInvokeError(err);\n\t\t\t}\n\t\t}\n\t};\n}, normalizeModuleRunnerTransport = (transport) => {\n\tlet invokeableTransport = createInvokeableTransport(transport), isConnected = !invokeableTransport.connect, connectingPromise;\n\treturn {\n\t\t...transport,\n\t\t...invokeableTransport.connect ? { async connect(onMessage) {\n\t\t\tif (isConnected) return;\n\t\t\tif (connectingPromise) {\n\t\t\t\tawait connectingPromise;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tlet maybePromise = invokeableTransport.connect({\n\t\t\t\tonMessage: onMessage ?? (() => {}),\n\t\t\t\tonDisconnection() {\n\t\t\t\t\tisConnected = !1;\n\t\t\t\t}\n\t\t\t});\n\t\t\tmaybePromise && (connectingPromise = maybePromise, await connectingPromise, connectingPromise = void 0), isConnected = !0;\n\t\t} } : {},\n\t\t...invokeableTransport.disconnect ? { async disconnect() {\n\t\t\tisConnected && (connectingPromise && await connectingPromise, isConnected = !1, await invokeableTransport.disconnect());\n\t\t} } : {},\n\t\tasync send(data) {\n\t\t\tif (invokeableTransport.send) {\n\t\t\t\tif (!isConnected) {\n\t\t\t\t\tif (connectingPromise) await connectingPromise;\n\t\t\t\t\telse throw new SendBeforeConnectError(\"send was called before connect\");\n\t\t\t\t}\n\t\t\t\tawait invokeableTransport.send(data);\n\t\t\t}\n\t\t},\n\t\tasync invoke(name, data) {\n\t\t\tif (!isConnected) {\n\t\t\t\tif (connectingPromise) await connectingPromise;\n\t\t\t\telse throw new SendBeforeConnectError(\"invoke was called before connect\");\n\t\t\t}\n\t\t\treturn invokeableTransport.invoke(name, data);\n\t\t}\n\t};\n};\nvar SendBeforeConnectError = class extends Error {\n\tconstructor(message) {\n\t\tsuper(message), this.name = \"SendBeforeConnectError\";\n\t}\n};\nconst createWebSocketModuleRunnerTransport = (options) => {\n\tlet pingInterval = options.pingInterval ?? 3e4, ws, pingIntervalId;\n\treturn {\n\t\tasync connect({ onMessage, onDisconnection }) {\n\t\t\tlet socket = options.createConnection();\n\t\t\tsocket.addEventListener(\"message\", ({ data }) => {\n\t\t\t\tonMessage(JSON.parse(data));\n\t\t\t});\n\t\t\tlet isOpened = socket.readyState === socket.OPEN;\n\t\t\tisOpened || await new Promise((resolve, reject) => {\n\t\t\t\tsocket.addEventListener(\"open\", () => {\n\t\t\t\t\tisOpened = !0, resolve();\n\t\t\t\t}, { once: !0 }), socket.addEventListener(\"close\", () => {\n\t\t\t\t\tif (!isOpened) {\n\t\t\t\t\t\treject(/* @__PURE__ */ Error(\"WebSocket closed without opened.\"));\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tonMessage({\n\t\t\t\t\t\ttype: \"custom\",\n\t\t\t\t\t\tevent: \"vite:ws:disconnect\",\n\t\t\t\t\t\tdata: { webSocket: socket }\n\t\t\t\t\t}), onDisconnection();\n\t\t\t\t});\n\t\t\t}), onMessage({\n\t\t\t\ttype: \"custom\",\n\t\t\t\tevent: \"vite:ws:connect\",\n\t\t\t\tdata: { webSocket: socket }\n\t\t\t}), ws = socket, pingIntervalId = setInterval(() => {\n\t\t\t\tsocket.readyState === socket.OPEN && socket.send(JSON.stringify({ type: \"ping\" }));\n\t\t\t}, pingInterval);\n\t\t},\n\t\tdisconnect() {\n\t\t\tclearInterval(pingIntervalId), ws?.close();\n\t\t},\n\t\tsend(data) {\n\t\t\tws.send(JSON.stringify(data));\n\t\t}\n\t};\n};\n//#endregion\n//#region src/shared/ssrTransform.ts\n/**\n* Vite converts `import { } from 'foo'` to `const _ = __vite_ssr_import__('foo')`.\n* Top-level imports and dynamic imports work slightly differently in Node.js.\n* This function normalizes the differences so it matches prod behaviour.\n*/\nfunction analyzeImportedModDifference(mod, rawId, moduleType, metadata) {\n\tif (!metadata?.isDynamicImport && metadata?.importedNames?.length) {\n\t\tlet missingBindings = metadata.importedNames.filter((s) => !(s in mod));\n\t\tif (missingBindings.length) {\n\t\t\tlet lastBinding = missingBindings.at(-1);\n\t\t\tthrow SyntaxError(moduleType === \"module\" ? `[vite] The requested module '${rawId}' does not provide an export named '${lastBinding}'` : `\\\n[vite] Named export '${lastBinding}' not found. The requested module '${rawId}' is a CommonJS module, which may not support all module.exports as named exports.\nCommonJS modules can always be imported via the default export, for example using:\n\nimport pkg from '${rawId}';\nconst {${missingBindings.join(\", \")}} = pkg;\n`);\n\t\t}\n\t}\n}\n//#endregion\n//#region src/module-runner/constants.ts\nconst ssrModuleExportsKey = \"__vite_ssr_exports__\", ssrImportKey = \"__vite_ssr_import__\", ssrDynamicImportKey = \"__vite_ssr_dynamic_import__\", ssrExportAllKey = \"__vite_ssr_exportAll__\", ssrExportNameKey = \"__vite_ssr_exportName__\", ssrImportMetaKey = \"__vite_ssr_import_meta__\", customizationHookNamespace = \"vite-module-runner:import-meta-resolve/v1/\", customizationHooksModule = `\n\nexport async function resolve(specifier, context, nextResolve) {\n  if (specifier.startsWith(${JSON.stringify(customizationHookNamespace)})) {\n    const data = specifier.slice(${JSON.stringify(customizationHookNamespace)}.length)\n    const [parsedSpecifier, parsedImporter] = JSON.parse(data)\n    specifier = parsedSpecifier\n    context.parentURL = parsedImporter\n  }\n  return nextResolve(specifier, context)\n}\n\n`;\nfunction customizationHookResolve(specifier, context, nextResolve) {\n\tif (specifier.startsWith(customizationHookNamespace)) {\n\t\tlet data = specifier.slice(42), [parsedSpecifier, parsedImporter] = JSON.parse(data);\n\t\tspecifier = parsedSpecifier, context.parentURL = parsedImporter;\n\t}\n\treturn nextResolve(specifier, context);\n}\nlet isHookRegistered = !1;\nfunction createImportMetaResolver() {\n\tif (isHookRegistered) return importMetaResolveWithCustomHook;\n\tlet module;\n\ttry {\n\t\tmodule = typeof process < \"u\" ? process.getBuiltinModule(\"node:module\").Module : void 0;\n\t} catch {\n\t\treturn;\n\t}\n\tif (module) {\n\t\tif (module.registerHooks) return module.registerHooks({ resolve: customizationHookResolve }), isHookRegistered = !0, importMetaResolveWithCustomHook;\n\t\tif (module.register) {\n\t\t\ttry {\n\t\t\t\tlet hookModuleContent = `data:text/javascript,${encodeURI(customizationHooksModule)}`;\n\t\t\t\tmodule.register(hookModuleContent);\n\t\t\t} catch (e) {\n\t\t\t\tif (\"code\" in e && e.code === \"ERR_NETWORK_IMPORT_DISALLOWED\") return;\n\t\t\t\tthrow e;\n\t\t\t}\n\t\t\treturn isHookRegistered = !0, importMetaResolveWithCustomHook;\n\t\t}\n\t}\n}\nfunction importMetaResolveWithCustomHook(specifier, importer) {\n\treturn import.meta.resolve(`${customizationHookNamespace}${JSON.stringify([specifier, importer])}`);\n}\n//#endregion\n//#region src/module-runner/createImportMeta.ts\nconst envProxy = new Proxy({}, { get(_, p) {\n\tthrow Error(`[module runner] Dynamic access of \"import.meta.env\" is not supported. Please, use \"import.meta.env.${String(p)}\" instead.`);\n} });\nfunction createDefaultImportMeta(modulePath) {\n\tlet href = posixPathToFileHref(modulePath), filename = modulePath, dirname = posixDirname(modulePath);\n\treturn {\n\t\tfilename: isWindows ? toWindowsPath(filename) : filename,\n\t\tdirname: isWindows ? toWindowsPath(dirname) : dirname,\n\t\turl: href,\n\t\tenv: envProxy,\n\t\tresolve(_id, _parent) {\n\t\t\tthrow Error(\"[module runner] \\\"import.meta.resolve\\\" is not supported.\");\n\t\t},\n\t\tglob() {\n\t\t\tthrow Error(\"[module runner] \\\"import.meta.glob\\\" is statically replaced during file transformation. Make sure to reference it by the full name.\");\n\t\t}\n\t};\n}\n/**\n* Create import.meta object for Node.js.\n*/\nfunction createNodeImportMeta(modulePath) {\n\tlet defaultMeta = createDefaultImportMeta(modulePath), href = defaultMeta.url, importMetaResolver = createImportMetaResolver();\n\treturn {\n\t\t...defaultMeta,\n\t\tmain: !1,\n\t\tresolve(id, parent) {\n\t\t\treturn (importMetaResolver ?? defaultMeta.resolve)(id, parent ?? href);\n\t\t}\n\t};\n}\n//#endregion\n//#region src/module-runner/esmEvaluator.ts\nvar ESModulesEvaluator = class {\n\tstartOffset = getAsyncFunctionDeclarationPaddingLineCount() + 1;\n\tasync runInlinedModule(context, code) {\n\t\tawait new AsyncFunction(ssrModuleExportsKey, ssrImportMetaKey, ssrImportKey, ssrDynamicImportKey, ssrExportAllKey, ssrExportNameKey, \"\\\"use strict\\\";\\n\" + code)(context[ssrModuleExportsKey], context[ssrImportMetaKey], context[ssrImportKey], context[ssrDynamicImportKey], context[ssrExportAllKey], context[ssrExportNameKey]), Object.seal(context[ssrModuleExportsKey]);\n\t}\n\trunExternalModule(filepath) {\n\t\treturn import(filepath);\n\t}\n};\n//#endregion\n//#region src/shared/hmrHandler.ts\nfunction createHMRHandler(handler) {\n\tlet queue = new Queue();\n\treturn (payload) => queue.enqueue(() => handler(payload));\n}\nvar Queue = class {\n\tqueue = [];\n\tpending = !1;\n\tenqueue(promise) {\n\t\treturn new Promise((resolve, reject) => {\n\t\t\tthis.queue.push({\n\t\t\t\tpromise,\n\t\t\t\tresolve,\n\t\t\t\treject\n\t\t\t}), this.dequeue();\n\t\t});\n\t}\n\tdequeue() {\n\t\tif (this.pending) return !1;\n\t\tlet item = this.queue.shift();\n\t\treturn item ? (this.pending = !0, item.promise().then(item.resolve).catch(item.reject).finally(() => {\n\t\t\tthis.pending = !1, this.dequeue();\n\t\t}), !0) : !1;\n\t}\n};\n//#endregion\n//#region src/module-runner/hmrHandler.ts\nfunction createHMRHandlerForRunner(runner) {\n\treturn createHMRHandler(async (payload) => {\n\t\tlet hmrClient = runner.hmrClient;\n\t\tif (hmrClient && !runner.isClosed()) switch (payload.type) {\n\t\t\tcase \"connected\":\n\t\t\t\thmrClient.logger.debug(\"connected.\");\n\t\t\t\tbreak;\n\t\t\tcase \"update\":\n\t\t\t\tawait hmrClient.notifyListeners(\"vite:beforeUpdate\", payload), await Promise.all(payload.updates.map(async (update) => {\n\t\t\t\t\tif (update.type === \"js-update\") return hmrClient.queueUpdate(update);\n\t\t\t\t\thmrClient.logger.error(\"css hmr is not supported in runner mode.\");\n\t\t\t\t})), await hmrClient.notifyListeners(\"vite:afterUpdate\", payload);\n\t\t\t\tbreak;\n\t\t\tcase \"custom\":\n\t\t\t\tawait hmrClient.notifyListeners(payload.event, payload.data);\n\t\t\t\tbreak;\n\t\t\tcase \"full-reload\": {\n\t\t\t\tlet { triggeredBy } = payload, clearEntrypointUrls = triggeredBy ? getModulesEntrypoints(runner, getModulesByFile(runner, slash(triggeredBy))) : findAllEntrypoints(runner);\n\t\t\t\tif (!clearEntrypointUrls.size) break;\n\t\t\t\thmrClient.logger.debug(\"program reload\"), await hmrClient.notifyListeners(\"vite:beforeFullReload\", payload), runner.evaluatedModules.clear();\n\t\t\t\tfor (let url of clearEntrypointUrls) {\n\t\t\t\t\tif (runner.isClosed()) break;\n\t\t\t\t\ttry {\n\t\t\t\t\t\tawait runner.import(url);\n\t\t\t\t\t} catch (err) {\n\t\t\t\t\t\tif (runner.isClosed()) break;\n\t\t\t\t\t\terr.code !== \"ERR_OUTDATED_OPTIMIZED_DEP\" && hmrClient.logger.error(`An error happened during full reload\\n${err.message}\\n${err.stack}`);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase \"prune\":\n\t\t\t\tawait hmrClient.notifyListeners(\"vite:beforePrune\", payload), await hmrClient.prunePaths(payload.paths);\n\t\t\t\tbreak;\n\t\t\tcase \"error\": {\n\t\t\t\tawait hmrClient.notifyListeners(\"vite:error\", payload);\n\t\t\t\tlet err = payload.err;\n\t\t\t\thmrClient.logger.error(`Internal Server Error\\n${err.message}\\n${err.stack}`);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase \"ping\": break;\n\t\t\tcase \"bundled-dev-update\": break;\n\t\t\tdefault: return payload;\n\t\t}\n\t});\n}\nfunction getModulesByFile(runner, file) {\n\tlet nodes = runner.evaluatedModules.getModulesByFile(file);\n\treturn nodes ? [...nodes].map((node) => node.id) : [];\n}\nfunction getModulesEntrypoints(runner, modules, visited = /* @__PURE__ */ new Set(), entrypoints = /* @__PURE__ */ new Set()) {\n\tfor (let moduleId of modules) {\n\t\tif (visited.has(moduleId)) continue;\n\t\tvisited.add(moduleId);\n\t\tlet module = runner.evaluatedModules.getModuleById(moduleId);\n\t\tif (module) {\n\t\t\tif (!module.importers.size) {\n\t\t\t\tentrypoints.add(module.url);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (let importer of module.importers) getModulesEntrypoints(runner, [importer], visited, entrypoints);\n\t\t}\n\t}\n\treturn entrypoints;\n}\nfunction findAllEntrypoints(runner, entrypoints = /* @__PURE__ */ new Set()) {\n\tfor (let mod of runner.evaluatedModules.idToModuleMap.values()) mod.importers.size || entrypoints.add(mod.url);\n\treturn entrypoints;\n}\n//#endregion\n//#region src/module-runner/hmrLogger.ts\nconst noop = () => {}, silentConsole = {\n\tdebug: noop,\n\terror: noop\n}, hmrLogger = {\n\tdebug: (...msg) => console.log(\"[vite]\", ...msg),\n\terror: (error) => console.log(\"[vite]\", error)\n}, sourceMapCache = {}, fileContentsCache = {}, evaluatedModulesCache = /* @__PURE__ */ new Set(), retrieveFileHandlers = /* @__PURE__ */ new Set(), retrieveSourceMapHandlers = /* @__PURE__ */ new Set(), createExecHandlers = (handlers) => ((...args) => {\n\tfor (let handler of handlers) {\n\t\tlet result = handler(...args);\n\t\tif (result) return result;\n\t}\n\treturn null;\n}), retrieveFileFromHandlers = createExecHandlers(retrieveFileHandlers), retrieveSourceMapFromHandlers = createExecHandlers(retrieveSourceMapHandlers);\nlet overridden = !1;\nconst originalPrepare = Error.prepareStackTrace;\nfunction resetInterceptor(runner, options) {\n\tevaluatedModulesCache.delete(runner.evaluatedModules), options.retrieveFile && retrieveFileHandlers.delete(options.retrieveFile), options.retrieveSourceMap && retrieveSourceMapHandlers.delete(options.retrieveSourceMap), evaluatedModulesCache.size === 0 && (Error.prepareStackTrace = originalPrepare, overridden = !1);\n}\nfunction interceptStackTrace(runner, options = {}) {\n\treturn overridden ||= (Error.prepareStackTrace = prepareStackTrace, !0), evaluatedModulesCache.add(runner.evaluatedModules), options.retrieveFile && retrieveFileHandlers.add(options.retrieveFile), options.retrieveSourceMap && retrieveSourceMapHandlers.add(options.retrieveSourceMap), () => resetInterceptor(runner, options);\n}\nfunction supportRelativeURL(file, url) {\n\tif (!file) return url;\n\tlet dir = posixDirname(slash(file)), match = /^\\w+:\\/\\/[^/]*/.exec(dir), protocol = match ? match[0] : \"\", startPath = dir.slice(protocol.length);\n\treturn protocol && /^\\/\\w:/.test(startPath) ? (protocol += \"/\", protocol + slash(posixResolve(startPath, url))) : protocol + posixResolve(startPath, url);\n}\nfunction getRunnerSourceMap(position) {\n\tfor (let moduleGraph of evaluatedModulesCache) {\n\t\tlet sourceMap = moduleGraph.getModuleSourceMapById(position.source);\n\t\tif (sourceMap) return {\n\t\t\turl: position.source,\n\t\t\tmap: sourceMap,\n\t\t\tvite: !0\n\t\t};\n\t}\n\treturn null;\n}\nfunction retrieveFile(path) {\n\tif (path in fileContentsCache) return fileContentsCache[path];\n\tlet content = retrieveFileFromHandlers(path);\n\treturn typeof content == \"string\" ? (fileContentsCache[path] = content, content) : null;\n}\nfunction retrieveSourceMapURL(source) {\n\tlet fileData = retrieveFile(source);\n\tif (!fileData) return null;\n\tlet re = /\\/\\/[@#]\\s*sourceMappingURL=([^\\s'\"]+)\\s*$|\\/\\*[@#]\\s*sourceMappingURL=[^\\s*'\"]+\\s*\\*\\/\\s*$/gm, lastMatch, match;\n\tfor (; match = re.exec(fileData);) lastMatch = match;\n\treturn lastMatch ? lastMatch[1] : null;\n}\nconst reSourceMap = /^data:application\\/json[^,]+base64,/;\nfunction retrieveSourceMap(source) {\n\tlet urlAndMap = retrieveSourceMapFromHandlers(source);\n\tif (urlAndMap) return urlAndMap;\n\tlet sourceMappingURL = retrieveSourceMapURL(source);\n\tif (!sourceMappingURL) return null;\n\tlet sourceMapData;\n\tif (reSourceMap.test(sourceMappingURL)) {\n\t\tlet rawData = sourceMappingURL.slice(sourceMappingURL.indexOf(\",\") + 1);\n\t\tsourceMapData = decodeBase64(rawData), sourceMappingURL = source;\n\t} else sourceMappingURL = supportRelativeURL(source, sourceMappingURL), sourceMapData = retrieveFile(sourceMappingURL);\n\treturn sourceMapData ? {\n\t\turl: sourceMappingURL,\n\t\tmap: sourceMapData\n\t} : null;\n}\nfunction mapSourcePosition(position) {\n\tif (!position.source) return position;\n\tlet sourceMap = getRunnerSourceMap(position);\n\tif (sourceMap ||= sourceMapCache[position.source], !sourceMap) {\n\t\tlet urlAndMap = retrieveSourceMap(position.source);\n\t\tif (urlAndMap && urlAndMap.map) {\n\t\t\tlet url = urlAndMap.url;\n\t\t\tsourceMap = sourceMapCache[position.source] = {\n\t\t\t\turl,\n\t\t\t\tmap: new DecodedMap(typeof urlAndMap.map == \"string\" ? JSON.parse(urlAndMap.map) : urlAndMap.map, url)\n\t\t\t};\n\t\t\tlet contents = sourceMap.map?.map.sourcesContent;\n\t\t\tsourceMap.map && contents && sourceMap.map.resolvedSources.forEach((source, i) => {\n\t\t\t\tlet content = contents[i];\n\t\t\t\tif (content && source && url) {\n\t\t\t\t\tlet contentUrl = supportRelativeURL(url, source);\n\t\t\t\t\tfileContentsCache[contentUrl] = content;\n\t\t\t\t}\n\t\t\t});\n\t\t} else sourceMap = sourceMapCache[position.source] = {\n\t\t\turl: null,\n\t\t\tmap: null\n\t\t};\n\t}\n\tif (sourceMap.map && sourceMap.url) {\n\t\tlet originalPosition = getOriginalPosition(sourceMap.map, position);\n\t\tif (originalPosition && originalPosition.source != null) return originalPosition.source = supportRelativeURL(sourceMap.url, originalPosition.source), sourceMap.vite && (originalPosition._vite = !0), originalPosition;\n\t}\n\treturn position;\n}\nfunction mapEvalOrigin(origin) {\n\tlet match = /^eval at ([^(]+) \\((.+):(\\d+):(\\d+)\\)$/.exec(origin);\n\tif (match) {\n\t\tlet position = mapSourcePosition({\n\t\t\tname: null,\n\t\t\tsource: match[2],\n\t\t\tline: +match[3],\n\t\t\tcolumn: match[4] - 1\n\t\t});\n\t\treturn `eval at ${match[1]} (${position.source}:${position.line}:${position.column + 1})`;\n\t}\n\treturn match = /^eval at ([^(]+) \\((.+)\\)$/.exec(origin), match ? `eval at ${match[1]} (${mapEvalOrigin(match[2])})` : origin;\n}\nfunction CallSiteToString() {\n\tlet fileName, fileLocation = \"\";\n\tif (this.isNative()) fileLocation = \"native\";\n\telse {\n\t\tfileName = this.getScriptNameOrSourceURL(), !fileName && this.isEval() && (fileLocation = this.getEvalOrigin(), fileLocation += \", \"), fileLocation += fileName || \"<anonymous>\";\n\t\tlet lineNumber = this.getLineNumber();\n\t\tif (lineNumber != null) {\n\t\t\tfileLocation += `:${lineNumber}`;\n\t\t\tlet columnNumber = this.getColumnNumber();\n\t\t\tcolumnNumber && (fileLocation += `:${columnNumber}`);\n\t\t}\n\t}\n\tlet line = \"\", functionName = this.getFunctionName(), addSuffix = !0, isConstructor = this.isConstructor();\n\tif (this.isToplevel() || isConstructor) isConstructor ? line += `new ${functionName || \"<anonymous>\"}` : functionName ? line += functionName : (line += fileLocation, addSuffix = !1);\n\telse {\n\t\tlet typeName = this.getTypeName();\n\t\ttypeName === \"[object Object]\" && (typeName = \"null\");\n\t\tlet methodName = this.getMethodName();\n\t\tfunctionName ? (typeName && functionName.indexOf(typeName) !== 0 && (line += `${typeName}.`), line += functionName, methodName && functionName.indexOf(`.${methodName}`) !== functionName.length - methodName.length - 1 && (line += ` [as ${methodName}]`)) : line += `${typeName}.${methodName || \"<anonymous>\"}`;\n\t}\n\treturn addSuffix && (line += ` (${fileLocation})`), line;\n}\nfunction cloneCallSite(frame) {\n\tlet object = Object.create(null);\n\treturn Object.getOwnPropertyNames(Object.getPrototypeOf(frame)).forEach((name) => {\n\t\tlet key = name;\n\t\tobject[key] = /^(?:is|get)/.test(name) ? function() {\n\t\t\treturn frame[key].call(frame);\n\t\t} : frame[key];\n\t}), object.toString = CallSiteToString, object;\n}\nfunction wrapCallSite(frame, state) {\n\tif (state === void 0 && (state = {\n\t\tnextPosition: null,\n\t\tcurPosition: null\n\t}), frame.isNative()) return state.curPosition = null, frame;\n\tlet source = frame.getFileName() || frame.getScriptNameOrSourceURL();\n\tif (source) {\n\t\tlet position = mapSourcePosition({\n\t\t\tname: null,\n\t\t\tsource,\n\t\t\tline: frame.getLineNumber() ?? 0,\n\t\t\tcolumn: (frame.getColumnNumber() ?? 1) - 1\n\t\t});\n\t\tstate.curPosition = position, frame = cloneCallSite(frame);\n\t\tlet originalFunctionName = frame.getFunctionName;\n\t\treturn frame.getFunctionName = function() {\n\t\t\tlet name = state.nextPosition == null ? originalFunctionName() : state.nextPosition.name || originalFunctionName();\n\t\t\treturn name === \"eval\" && \"_vite\" in position ? null : name;\n\t\t}, frame.getFileName = function() {\n\t\t\treturn position.source ?? null;\n\t\t}, frame.getLineNumber = function() {\n\t\t\treturn position.line;\n\t\t}, frame.getColumnNumber = function() {\n\t\t\treturn position.column + 1;\n\t\t}, frame.getScriptNameOrSourceURL = function() {\n\t\t\treturn position.source;\n\t\t}, frame;\n\t}\n\tlet origin = frame.isEval() && frame.getEvalOrigin();\n\treturn origin ? (origin = mapEvalOrigin(origin), frame = cloneCallSite(frame), frame.getEvalOrigin = function() {\n\t\treturn origin || void 0;\n\t}, frame) : frame;\n}\nfunction prepareStackTrace(error, stack) {\n\tlet errorString = `${error.name || \"Error\"}: ${error.message || \"\"}`, state = {\n\t\tnextPosition: null,\n\t\tcurPosition: null\n\t}, processedStack = [];\n\tfor (let i = stack.length - 1; i >= 0; i--) processedStack.push(`\\n    at ${wrapCallSite(stack[i], state)}`), state.nextPosition = state.curPosition;\n\treturn state.curPosition = state.nextPosition = null, errorString + processedStack.reverse().join(\"\");\n}\n//#endregion\n//#region src/module-runner/sourcemap/index.ts\nfunction enableSourceMapSupport(runner) {\n\tif (runner.options.sourcemapInterceptor === \"node\") {\n\t\tif (typeof process > \"u\") throw TypeError(\"Cannot use \\\"sourcemapInterceptor: 'node'\\\" because global \\\"process\\\" variable is not available.\");\n\t\tif (typeof process.setSourceMapsEnabled != \"function\") throw TypeError(\"Cannot use \\\"sourcemapInterceptor: 'node'\\\" because \\\"process.setSourceMapsEnabled\\\" function is not available. Please use Node >= 16.6.0.\");\n\t\tlet isEnabledAlready = process.sourceMapsEnabled ?? !1;\n\t\treturn process.setSourceMapsEnabled(!0), () => !isEnabledAlready && process.setSourceMapsEnabled(!1);\n\t}\n\treturn interceptStackTrace(runner, typeof runner.options.sourcemapInterceptor == \"object\" ? runner.options.sourcemapInterceptor : void 0);\n}\n//#endregion\n//#region src/module-runner/runner.ts\nvar ModuleRunner = class {\n\toptions;\n\tevaluator;\n\tdebug;\n\tevaluatedModules;\n\thmrClient;\n\ttransport;\n\tresetSourceMapSupport;\n\tconcurrentModuleNodePromises = /* @__PURE__ */ new Map();\n\tisBuiltin;\n\tbuiltinsPromise;\n\tclosed = !1;\n\tconstructor(options, evaluator = new ESModulesEvaluator(), debug) {\n\t\tif (this.options = options, this.evaluator = evaluator, this.debug = debug, this.evaluatedModules = options.evaluatedModules ?? new EvaluatedModules(), this.transport = normalizeModuleRunnerTransport(options.transport), options.hmr !== !1) {\n\t\t\tlet optionsHmr = options.hmr ?? !0, resolvedHmrLogger = optionsHmr === !0 || optionsHmr.logger === void 0 ? hmrLogger : optionsHmr.logger === !1 ? silentConsole : optionsHmr.logger;\n\t\t\tif (this.hmrClient = new HMRClient(resolvedHmrLogger, this.transport, ({ acceptedPath }) => this.import(acceptedPath)), !this.transport.connect) throw Error(\"HMR is not supported by this runner transport, but `hmr` option was set to true\");\n\t\t\tthis.transport.connect(createHMRHandlerForRunner(this));\n\t\t} else this.transport.connect?.();\n\t\toptions.sourcemapInterceptor !== !1 && (this.resetSourceMapSupport = enableSourceMapSupport(this));\n\t}\n\t/**\n\t* URL to execute. Accepts file path, server path or id relative to the root.\n\t*/\n\tasync import(url) {\n\t\tlet fetchedModule = await this.cachedModule(url);\n\t\treturn await this.cachedRequest(url, fetchedModule);\n\t}\n\t/**\n\t* Clear all caches including HMR listeners.\n\t*/\n\tclearCache() {\n\t\tthis.evaluatedModules.clear(), this.hmrClient?.clear();\n\t}\n\t/**\n\t* Clears all caches, removes all HMR listeners, and resets source map support.\n\t* This method doesn't stop the HMR connection.\n\t*/\n\tasync close() {\n\t\tthis.resetSourceMapSupport?.(), this.clearCache(), this.hmrClient = void 0, this.closed = !0, await this.transport.disconnect?.();\n\t}\n\t/**\n\t* Returns `true` if the runtime has been closed by calling `close()` method.\n\t*/\n\tisClosed() {\n\t\treturn this.closed;\n\t}\n\tprocessImport(exports, fetchResult, metadata) {\n\t\tif (!(\"externalize\" in fetchResult)) return exports;\n\t\tlet { url, type } = fetchResult;\n\t\treturn type !== \"module\" && type !== \"commonjs\" || analyzeImportedModDifference(exports, url, type, metadata), exports;\n\t}\n\tisCircularRequest(mod, callstack, visited = /* @__PURE__ */ new Set()) {\n\t\tif (visited.has(mod.id)) return !1;\n\t\tvisited.add(mod.id);\n\t\tfor (let importedModuleId of mod.imports) {\n\t\t\tlet importedModule = this.evaluatedModules.getModuleById(importedModuleId);\n\t\t\tif (importedModule?.promise && !importedModule.evaluated && (callstack.includes(importedModuleId) || this.isCircularRequest(importedModule, callstack, visited))) return !0;\n\t\t}\n\t\treturn !1;\n\t}\n\tasync cachedRequest(url, mod, callstack = [], metadata) {\n\t\tlet meta = mod.meta, moduleId = meta.id, importee = callstack.at(-1);\n\t\tif (importee && mod.importers.add(importee), mod.evaluated && mod.promise) return this.processImport(await mod.promise, meta, metadata);\n\t\tif (mod.promise) return mod.exports && (callstack.includes(moduleId) || this.isCircularRequest(mod, callstack)) ? this.processImport(mod.exports, meta, metadata) : this.processImport(await mod.promise, meta, metadata);\n\t\tlet debugTimer;\n\t\tthis.debug && (debugTimer = setTimeout(() => {\n\t\t\tthis.debug(`[module runner] module ${moduleId} takes over 2s to load.\\n${`stack:\\n${[...callstack, moduleId].reverse().map((p) => `  - ${p}`).join(\"\\n\")}`}`);\n\t\t}, 2e3));\n\t\ttry {\n\t\t\tlet promise = this.directRequest(url, mod, callstack);\n\t\t\treturn mod.promise = promise, mod.evaluated = !1, this.processImport(await promise, meta, metadata);\n\t\t} finally {\n\t\t\tmod.evaluated = !0, debugTimer && clearTimeout(debugTimer);\n\t\t}\n\t}\n\tasync cachedModule(url, importer) {\n\t\tlet cached = this.concurrentModuleNodePromises.get(url);\n\t\tif (cached) this.debug?.(\"[module runner] using cached module info for\", url);\n\t\telse {\n\t\t\tlet cachedModule = this.evaluatedModules.getModuleByUrl(url);\n\t\t\tcached = this.getModuleInformation(url, importer, cachedModule).finally(() => {\n\t\t\t\tthis.concurrentModuleNodePromises.delete(url);\n\t\t\t}), this.concurrentModuleNodePromises.set(url, cached);\n\t\t}\n\t\treturn cached;\n\t}\n\tensureBuiltins() {\n\t\tif (!this.isBuiltin) return this.builtinsPromise ??= (async () => {\n\t\t\ttry {\n\t\t\t\tthis.debug?.(\"[module runner] fetching builtins from server\");\n\t\t\t\tlet builtins = (await this.transport.invoke(\"getBuiltins\", [])).map((builtin) => typeof builtin == \"object\" && builtin && \"type\" in builtin ? builtin.type === \"string\" ? builtin.value : new RegExp(builtin.source, builtin.flags) : builtin);\n\t\t\t\tthis.isBuiltin = createIsBuiltin(builtins), this.debug?.(\"[module runner] builtins loaded:\", builtins);\n\t\t\t} finally {\n\t\t\t\tthis.builtinsPromise = void 0;\n\t\t\t}\n\t\t})(), this.builtinsPromise;\n\t}\n\tasync getModuleInformation(url, importer, cachedModule) {\n\t\tif (this.closed) throw Error(\"Vite module runner has been closed.\");\n\t\tawait this.ensureBuiltins(), this.debug?.(\"[module runner] fetching\", url);\n\t\tlet isCached = !!(typeof cachedModule == \"object\" && cachedModule.meta), fetchedModule = url.startsWith(\"data:\") || this.isBuiltin?.(url) ? {\n\t\t\texternalize: url,\n\t\t\ttype: \"builtin\"\n\t\t} : await this.transport.invoke(\"fetchModule\", [\n\t\t\turl,\n\t\t\timporter,\n\t\t\t{\n\t\t\t\tcached: isCached,\n\t\t\t\tstartOffset: this.evaluator.startOffset\n\t\t\t}\n\t\t]);\n\t\tif (\"cache\" in fetchedModule) {\n\t\t\tif (!cachedModule || !cachedModule.meta) throw Error(`Module \"${url}\" was mistakenly invalidated during fetch phase.`);\n\t\t\treturn cachedModule;\n\t\t}\n\t\tlet moduleId = \"externalize\" in fetchedModule ? fetchedModule.externalize : fetchedModule.id, moduleUrl = \"url\" in fetchedModule ? fetchedModule.url : url, module = this.evaluatedModules.ensureModule(moduleId, moduleUrl);\n\t\treturn \"invalidate\" in fetchedModule && fetchedModule.invalidate && this.evaluatedModules.invalidateModule(module), fetchedModule.url = moduleUrl, fetchedModule.id = moduleId, module.meta = fetchedModule, module;\n\t}\n\tasync directRequest(url, mod, _callstack) {\n\t\tlet fetchResult = mod.meta, moduleId = fetchResult.id, callstack = [..._callstack, moduleId], request = async (dep, metadata) => {\n\t\t\tlet importer = \"file\" in fetchResult && fetchResult.file || moduleId, depMod = await this.cachedModule(dep, importer);\n\t\t\treturn depMod.importers.add(moduleId), mod.imports.add(depMod.id), this.cachedRequest(dep, depMod, callstack, metadata);\n\t\t}, dynamicRequest = async (dep) => (dep = String(dep), dep[0] === \".\" && (dep = posixResolve(posixDirname(url), dep)), request(dep, { isDynamicImport: !0 }));\n\t\tif (\"externalize\" in fetchResult) {\n\t\t\tlet { externalize } = fetchResult;\n\t\t\tthis.debug?.(\"[module runner] externalizing\", externalize);\n\t\t\tlet exports = await this.evaluator.runExternalModule(externalize);\n\t\t\treturn mod.exports = exports, exports;\n\t\t}\n\t\tlet { code, file } = fetchResult;\n\t\tif (code == null) {\n\t\t\tlet importer = callstack[callstack.length - 2];\n\t\t\tthrow Error(`[module runner] Failed to load \"${url}\"${importer ? ` imported from ${importer}` : \"\"}`);\n\t\t}\n\t\tlet createImportMeta = this.options.createImportMeta ?? createDefaultImportMeta, modulePath = cleanUrl(file || moduleId), href = posixPathToFileHref(modulePath), meta = await createImportMeta(modulePath), exports = Object.create(null);\n\t\tObject.defineProperty(exports, Symbol.toStringTag, {\n\t\t\tvalue: \"Module\",\n\t\t\tenumerable: !1,\n\t\t\tconfigurable: !1\n\t\t}), mod.exports = exports;\n\t\tlet hotContext;\n\t\tthis.hmrClient && Object.defineProperty(meta, \"hot\", {\n\t\t\tenumerable: !0,\n\t\t\tget: () => {\n\t\t\t\tif (!this.hmrClient) throw Error(\"[module runner] HMR client was closed.\");\n\t\t\t\treturn this.debug?.(\"[module runner] creating hmr context for\", mod.url), hotContext ||= new HMRContext(this.hmrClient, mod.url), hotContext;\n\t\t\t},\n\t\t\tset: (value) => {\n\t\t\t\thotContext = value;\n\t\t\t}\n\t\t});\n\t\tlet context = {\n\t\t\t[ssrImportKey]: request,\n\t\t\t[ssrDynamicImportKey]: dynamicRequest,\n\t\t\t[ssrModuleExportsKey]: exports,\n\t\t\t[ssrExportAllKey]: (obj) => exportAll(exports, obj),\n\t\t\t[ssrExportNameKey]: (name, getter) => Object.defineProperty(exports, name, {\n\t\t\t\tenumerable: !0,\n\t\t\t\tconfigurable: !0,\n\t\t\t\tget: getter\n\t\t\t}),\n\t\t\t[ssrImportMetaKey]: meta\n\t\t};\n\t\treturn this.debug?.(\"[module runner] executing\", href), await this.evaluator.runInlinedModule(context, code, mod), exports;\n\t}\n};\nfunction exportAll(exports, sourceModule) {\n\tif (exports !== sourceModule && !(isPrimitive(sourceModule) || Array.isArray(sourceModule) || sourceModule instanceof Promise)) {\n\t\tfor (let key in sourceModule) if (key !== \"default\" && key !== \"__esModule\" && !(key in exports)) try {\n\t\t\tObject.defineProperty(exports, key, {\n\t\t\t\tenumerable: !0,\n\t\t\t\tconfigurable: !0,\n\t\t\t\tget: () => sourceModule[key]\n\t\t\t});\n\t\t} catch {}\n\t}\n}\n//#endregion\nexport { ESModulesEvaluator, EvaluatedModules, ModuleRunner, createDefaultImportMeta, createNodeImportMeta, createWebSocketModuleRunnerTransport, normalizeModuleId, ssrDynamicImportKey, ssrExportAllKey, ssrExportNameKey, ssrImportKey, ssrImportMetaKey, ssrModuleExportsKey };\n","//#region src/constants.ts\nconst e = [\n\t1.96,\n\t12.706204736432102,\n\t4.3026527299112765,\n\t3.182446305284264,\n\t2.7764451051977996,\n\t2.57058183661474,\n\t2.446911848791681,\n\t2.3646242510102997,\n\t2.306004135033371,\n\t2.262157162740992,\n\t2.2281388519649385,\n\t2.200985160082949,\n\t2.178812829663418,\n\t2.160368656461013,\n\t2.1447866879169277,\n\t2.131449545559323,\n\t2.1199052992210112,\n\t2.109815577833181,\n\t2.10092204024096,\n\t2.0930240544082634,\n\t2.085963447265837,\n\t2.0796138447276626,\n\t2.073873067904015,\n\t2.068657610419041,\n\t2.063898561628021,\n\t2.0595385527532946,\n\t2.0555294386428713,\n\t2.0518305164802837,\n\t2.048407141795244,\n\t2.0452296421327034,\n\t2.042272456301238,\n\t2.0395134463964077,\n\t2.0369333434601016,\n\t2.0345152974493383,\n\t2.0322445093177186,\n\t2.030107928250343,\n\t2.0280940009804507,\n\t2.0261924630291097,\n\t2.0243941645751367,\n\t2.0226909117347285,\n\t2.021075382995338,\n\t2.019540963982894,\n\t2.0180816970958815,\n\t2.0166921941428138,\n\t2.0153675699129416,\n\t2.0141033848332928,\n\t2.012895595294589,\n\t2.011740510475755,\n\t2.010634754696446,\n\t2.0095752344892093,\n\t2.0085591097152062,\n\t2.0075837681558824,\n\t2.0066468031022118,\n\t2.00574599353695,\n\t2.0048792865665233,\n\t2.0040447818101814,\n\t2.003240717496698,\n\t2.002465458054599,\n\t2.0017174830120927,\n\t2.0009953770482105,\n\t2.000297821058262,\n\t1.9996235841149783,\n\t1.9989715162223116,\n\t1.998340541772196,\n\t1.9977296536259739,\n\t1.9971379077520126,\n\t1.9965644183594748,\n\t1.996008353475506,\n\t1.9954689309194023,\n\t1.994945414632814,\n\t1.9944371113297732,\n\t1.9939433674345044,\n\t1.9934635662785831,\n\t1.9929971255321668,\n\t1.9925434948468204,\n\t1.9921021536898658,\n\t1.9916726093523491,\n\t1.9912543951146042,\n\t1.9908470685550523,\n\t1.9904502099893606,\n\t1.9900634210283845,\n\t1.9896863232444832,\n\t1.989318556936819,\n\t1.9889597799871794,\n\t1.9886096667986737,\n\t1.988267907310378,\n\t1.9879342060816723,\n\t1.9876082814405773,\n\t1.987289864690939,\n\t1.9869786993737681,\n\t1.9866745405784685,\n\t1.9863771543000652,\n\t1.9860863168388938,\n\t1.985801814239503,\n\t1.9855234417658303,\n\t1.9852510034099267,\n\t1.9849843114317696,\n\t1.9847231859278835,\n\t1.9844674544266925,\n\t1.9842169515086832,\n\t1.983971518449634,\n\t1.9837310028852815,\n\t1.9834952584959407,\n\t1.9832641447097104,\n\t1.9830375264229902,\n\t1.9828152737371547,\n\t1.9825972617102912,\n\t1.9823833701230178,\n\t1.9821734832574516,\n\t1.9819674896884745,\n\t1.9817652820865104,\n\t1.981566757031071,\n\t1.9813718148344008,\n\t1.9811803593745805,\n\t1.9809922979375068,\n\t1.9808075410672004,\n\t1.980626002423938,\n\t1.9804475986497296,\n\t1.9802722492407063,\n\t1.9800998764260065,\n\t1.979930405052777,\n\t1.9797637624769306,\n\t1.9795998784593314,\n\t1.97943868506709,\n\t1.979280116579683,\n\t1.9791241093996175,\n\t1.9789706019673938,\n\t1.978819534680521,\n\t1.9786708498163625,\n\t1.9785244914586055,\n\t1.9783804054271532,\n\t1.9782385392112587,\n\t1.9780988419057237,\n\t1.977961264150002,\n\t1.9778257580700531,\n\t1.9776922772228045,\n\t1.9775607765430836,\n\t1.977431212292894,\n\t1.9773035420129166,\n\t1.9771777244761224,\n\t1.9770537196433886,\n\t1.9769314886210223,\n\t1.97681099362009,\n\t1.9766921979174685,\n\t1.9765750658185368,\n\t1.9764595626214163,\n\t1.9763456545827007,\n\t1.9762333088845883,\n\t1.9761224936033637,\n\t1.9760131776791554,\n\t1.9759053308869141,\n\t1.9757989238085507,\n\t1.975693927806187,\n\t1.9755903149964589,\n\t1.9754880582258323,\n\t1.9753871310468787,\n\t1.9752875076954728,\n\t1.9751891630688665,\n\t1.9750920727046015,\n\t1.9749962127602256,\n\t1.9749015599937723,\n\t1.9748080917449764,\n\t1.9747157859171882,\n\t1.9746246209599583,\n\t1.9745345758522659,\n\t1.9744456300863593,\n\t1.9743577636521858,\n\t1.9742709570223849,\n\t1.974185191137821,\n\t1.9741004473936339,\n\t1.9740167076257829,\n\t1.9739339540980692,\n\t1.9738521694896138,\n\t1.9737713368827694,\n\t1.9736914397514562,\n\t1.9736124619498976,\n\t1.9735343877017435,\n\t1.9734572015895646,\n\t1.9733808885447033,\n\t1.9733054338374667,\n\t1.973230823067649,\n\t1.9731570421553692,\n\t1.9730840773322162,\n\t1.9730119151326795,\n\t1.9729405423858692,\n\t1.9728699462074992,\n\t1.9728001139921352,\n\t1.9727310334056907,\n\t1.9726626923781656,\n\t1.9725950790966158,\n\t1.9725281819983451,\n\t1.972461989764315,\n\t1.9723964913127596,\n\t1.9723316757930012,\n\t1.9722675325794565,\n\t1.972204051265833,\n\t1.9721412216594971,\n\t1.9720790337760221,\n\t1.972017477833896,\n\t1.9719565442493954,\n\t1.9718962236316093,\n\t1.9718365067776158,\n\t1.971777384667801,\n\t1.971718848461318,\n\t1.9716608894916787,\n\t1.971603499262479,\n\t1.9715466694432433,\n\t1.9714903918653972,\n\t1.9714346585183509,\n\t1.9713794615456992,\n\t1.9713247932415296,\n\t1.9712706460468354,\n\t1.9712170125460335,\n\t1.9711638854635767,\n\t1.971111257660664,\n\t1.9710591221320446,\n\t1.9710074720029072,\n\t1.97095630052586,\n\t1.9709056010779908,\n\t1.9708553671580111,\n\t1.9708055923834753,\n\t1.970756270488079,\n\t1.9707073953190282,\n\t1.9706589608344816,\n\t1.9706109611010594,\n\t1.9705633902914228,\n\t1.9705162426819125,\n\t1.9704695126502556,\n\t1.9704231946733297,\n\t1.9703772833249869,\n\t1.9703317732739336,\n\t1.9702866592816697,\n\t1.9702419362004757,\n\t1.9701975989714555,\n\t1.9701536426226303,\n\t1.9701100622670775,\n\t1.9700668531011214,\n\t1.9700240104025675,\n\t1.9699815295289818,\n\t1.969939405916016,\n\t1.9698976350757686,\n\t1.9698562125951948,\n\t1.9698151341345516,\n\t1.9697743954258797,\n\t1.9697339922715287,\n\t1.9696939205427133,\n\t1.9696541761781068,\n\t1.9696147551824699,\n\t1.9695756536253115,\n\t1.9695368676395828,\n\t1.9694983934204007,\n\t1.9694602272238055,\n\t1.9694223653655467,\n\t1.969384804219895,\n\t1.9693475402184863,\n\t1.9693105698491933,\n\t1.9692738896550193,\n\t1.9692374962330224,\n\t1.9692013862332616,\n\t1.9691655563577715,\n\t1.9691300033595551,\n\t1.9690947240416052,\n\t1.9690597152559448,\n\t1.9690249739026924,\n\t1.9689904969291443,\n\t1.968956281328883,\n\t1.9689223241409022,\n\t1.9688886224487527,\n\t1.9688551733797075,\n\t1.968821974103945,\n\t1.9687890218337525,\n\t1.968756313822743,\n\t1.968723847365097,\n\t1.9686916197948103,\n\t1.9686596284849691,\n\t1.9686278708470335,\n\t1.9685963443301415,\n\t1.968565046420423,\n\t1.9685339746403347,\n\t1.9685031265480044,\n\t1.9684724997365923,\n\t1.968442091833664,\n\t1.968411900500579,\n\t1.9683819234318907,\n\t1.9683521583547587,\n\t1.9683226030283762,\n\t1.9682932552434063,\n\t1.968264112821431,\n\t1.9682351736144144,\n\t1.9682064355041722,\n\t1.968177896401857,\n\t1.968149554247451,\n\t1.9681214070092705,\n\t1.9680934526834821,\n\t1.9680656892936232,\n\t1.968038114890141,\n\t1.9680107275499321,\n\t1.9679835253758984,\n\t1.967956506496507,\n\t1.9679296690653623,\n\t1.9679030112607847,\n\t1.9678765312853979,\n\t1.967850227365727,\n\t1.9678240977517998,\n\t1.967798140716761,\n\t1.9677723545564905,\n\t1.967746737589231,\n\t1.9677212881552217,\n\t1.967696004616341,\n\t1.967670885355754,\n\t1.9676459287775685,\n\t1.9676211333064957,\n\t1.9675964973875213,\n\t1.967572019485578,\n\t1.967547698085227,\n\t1.9675235316903468,\n\t1.9674995188238256,\n\t1.9674756580272583,\n\t1.9674519478606556,\n\t1.96742838690215,\n\t1.9674049737477135,\n\t1.9673817070108799,\n\t1.9673585853224684,\n\t1.9673356073303163,\n\t1.9673127716990173,\n\t1.9672900771096589,\n\t1.9672675222595717,\n\t1.9672451058620788,\n\t1.9672228266462515,\n\t1.9672006833566689,\n\t1.9671786747531816,\n\t1.9671567996106818,\n\t1.967135056718874,\n\t1.9671134448820529,\n\t1.9670919629188843,\n\t1.9670706096621893,\n\t1.967049383958733,\n\t1.9670282846690177,\n\t1.9670073106670771,\n\t1.9669864608402783,\n\t1.966965734089124,\n\t1.9669451293270586,\n\t1.9669246454802793,\n\t1.9669042814875488,\n\t1.9668840363000124,\n\t1.966863908881019,\n\t1.9668438982059417,\n\t1.966824003262006,\n\t1.9668042230481186,\n\t1.9667845565746986,\n\t1.9667650028635129,\n\t1.9667455609475144,\n\t1.9667262298706825,\n\t1.966707008687866,\n\t1.9666878964646288,\n\t1.9666688922770996,\n\t1.9666499952118222,\n\t1.9666312043656085,\n\t1.9666125188453965,\n\t1.9665939377681074,\n\t1.9665754602605063,\n\t1.9665570854590666,\n\t1.9665388125098342,\n\t1.966520640568296,\n\t1.9665025687992495,\n\t1.966484596376675,\n\t1.9664667224836099,\n\t1.9664489463120245,\n\t1.9664312670626998,\n\t1.9664136839451096,\n\t1.9663961961773,\n\t1.966378802985776,\n\t1.9663615036053859,\n\t1.9663442972792093,\n\t1.9663271832584475,\n\t1.9663101608023135,\n\t1.966293229177927,\n\t1.9662763876602067,\n\t1.96625963553177,\n\t1.9662429720828285,\n\t1.9662263966110878,\n\t1.9662099084216513,\n\t1.9661935068269203,\n\t1.9661771911465,\n\t1.9661609607071053,\n\t1.9661448148424667,\n\t1.9661287528932416,\n\t1.9661127742069229,\n\t1.9660968781377508,\n\t1.966081064046626,\n\t1.966065331301024,\n\t1.966049679274911,\n\t1.9660341073486605,\n\t1.9660186149089722,\n\t1.9660032013487905,\n\t1.9659878660672256,\n\t1.9659726084694753,\n\t1.9659574279667498,\n\t1.965942323976193,\n\t1.9659272959208094,\n\t1.9659123432293915,\n\t1.9658974653364458,\n\t1.9658826616821223,\n\t1.965867931712145,\n\t1.9658532748777406,\n\t1.9658386906355727,\n\t1.9658241784476738,\n\t1.965809737781378,\n\t1.9657953681092573,\n\t1.9657810689090576,\n\t1.9657668396636336,\n\t1.965752679860889,\n\t1.9657385889937122,\n\t1.9657245665599175,\n\t1.9657106120621863,\n\t1.9656967250080057,\n\t1.9656829049096134,\n\t1.9656691512839384,\n\t1.965655463652545,\n\t1.9656418415415793,\n\t1.9656282844817121,\n\t1.9656147920080864,\n\t1.9656013636602634,\n\t1.9655879989821707,\n\t1.9655746975220507,\n\t1.9655614588324102,\n\t1.965548282469968,\n\t1.9655351679956077,\n\t1.9655221149743287,\n\t1.9655091229751978,\n\t1.9654961915712998,\n\t1.9654833203396942,\n\t1.9654705088613673,\n\t1.9654577567211857,\n\t1.965445063507854,\n\t1.965432428813868,\n\t1.9654198522354724,\n\t1.9654073333726187,\n\t1.9653948718289207,\n\t1.9653824672116142,\n\t1.9653701191315152,\n\t1.9653578272029781,\n\t1.9653455910438589,\n\t1.9653334102754718,\n\t1.9653212845225516,\n\t1.9653092134132164,\n\t1.9652971965789277,\n\t1.9652852336544535,\n\t1.9652733242778317,\n\t1.9652614680903338,\n\t1.9652496647364275,\n\t1.9652379138637432,\n\t1.9652262151230366,\n\t1.9652145681681563,\n\t1.9652029726560083,\n\t1.9651914282465226,\n\t1.9651799346026202,\n\t1.9651684913901803,\n\t1.9651570982780076,\n\t1.9651457549378,\n\t1.9651344610441186,\n\t1.9651232162743548,\n\t1.9651120203087005,\n\t1.9651008728301178,\n\t1.9650897735243085,\n\t1.9650787220796855,\n\t1.9650677181873428,\n\t1.965056761541027,\n\t1.965045851837109,\n\t1.965034988774555,\n\t1.965024172054902,\n\t1.9650134013822251,\n\t1.9650026764631154,\n\t1.9649919970066518,\n\t1.9649813627243728,\n\t1.964970773330254,\n\t1.9649602285406784,\n\t1.9649497280744153,\n\t1.9649392716525922,\n\t1.964928858998672,\n\t1.9649184898384262,\n\t1.9649081638999137,\n\t1.9648978809134563,\n\t1.9648876406116125,\n\t1.9648774427291587,\n\t1.9648672870030628,\n\t1.9648571731724636,\n\t1.9648471009786466,\n\t1.9648370701650248,\n\t1.9648270804771135,\n\t1.9648171316625118,\n\t1.964807223470879,\n\t1.9647973556539153,\n\t1.9647875279653397,\n\t1.9647777401608706,\n\t1.9647679919982053,\n\t1.9647582832369994,\n\t1.9647486136388483,\n\t1.9647389829672652,\n\t1.9647293909876653,\n\t1.9647198374673442,\n\t1.9647103221754598,\n\t1.964700844883014,\n\t1.9646914053628335,\n\t1.9646820033895525,\n\t1.964672638739595,\n\t1.9646633111911553,\n\t1.9646540205241838,\n\t1.9646447665203655,\n\t1.964635548963106,\n\t1.9646263676375137,\n\t1.9646172223303833,\n\t1.9646081128301776,\n\t1.9645990389270147,\n\t1.9645900004126484,\n\t1.9645809970804544,\n\t1.9645720287254127,\n\t1.9645630951440949,\n\t1.964554196134645,\n\t1.9645453314967691,\n\t1.9645365010317148,\n\t1.9645277045422602,\n\t1.9645189418326983,\n\t1.964510212708822,\n\t1.964501516977911,\n\t1.964492854448715,\n\t1.9644842249314425,\n\t1.9644756282377454,\n\t1.9644670641807058,\n\t1.964458532574823,\n\t1.9644500332359982,\n\t1.9644415659815229,\n\t1.9644331306300662,\n\t1.9644247270016604,\n\t1.964416354917689,\n\t1.9644080142008735,\n\t1.9643997046752626,\n\t1.9643914261662165,\n\t1.9643831785003991,\n\t1.9643749615057613,\n\t1.9643667750115323,\n\t1.964358618848207,\n\t1.9643504928475335,\n\t1.964342396842502,\n\t1.9643343306673333,\n\t1.9643262941574684,\n\t1.9643182871495555,\n\t1.9643103094814403,\n\t1.964302360992155,\n\t1.9642944415219068,\n\t1.9642865509120675,\n\t1.9642786890051633,\n\t1.964270855644863,\n\t1.9642630506759702,\n\t1.9642552739444101,\n\t1.9642475252972216,\n\t1.9642398045825453,\n\t1.9642321116496164,\n\t1.9642244463487513,\n\t1.9642168085313412,\n\t1.9642091980498402,\n\t1.9642016147577568,\n\t1.964194058509645,\n\t1.9641865291610932,\n\t1.9641790265687171,\n\t1.964171550590149,\n\t1.9641641010840303,\n\t1.9641566779100006,\n\t1.9641492809286911,\n\t1.964141910001714,\n\t1.964134564991655,\n\t1.9641272457620647,\n\t1.9641199521774493,\n\t1.964112684103263,\n\t1.9641054414058998,\n\t1.9640982239526847,\n\t1.964091031611867,\n\t1.9640838642526093,\n\t1.964076721744983,\n\t1.9640696039599586,\n\t1.9640625107693983,\n\t1.9640554420460483,\n\t1.9640483976635308,\n\t1.9640413774963374,\n\t1.964034381419821,\n\t1.9640274093101877,\n\t1.9640204610444916,\n\t1.9640135365006257,\n\t1.9640066355573154,\n\t1.9639997580941106,\n\t1.963992903991381,\n\t1.9639860731303063,\n\t1.9639792653928712,\n\t1.9639724806618581,\n\t1.9639657188208401,\n\t1.9639589797541745,\n\t1.963952263346997,\n\t1.963945569485213,\n\t1.963938898055494,\n\t1.9639322489452695,\n\t1.96392562204272,\n\t1.9639190172367733,\n\t1.963912434417095,\n\t1.963905873474085,\n\t1.9638993342988706,\n\t1.9638928167832999,\n\t1.9638863208199362,\n\t1.9638798463020526,\n\t1.9638733931236256,\n\t1.9638669611793291,\n\t1.9638605503645292,\n\t1.9638541605752786,\n\t1.9638477917083106,\n\t1.963841443661033,\n\t1.9638351163315244,\n\t1.9638288096185263,\n\t1.9638225234214404,\n\t1.9638162576403206,\n\t1.96381001217587,\n\t1.9638037869294331,\n\t1.9637975818029945,\n\t1.9637913966991682,\n\t1.9637852315211985,\n\t1.9637790861729507,\n\t1.963772960558908,\n\t1.9637668545841658,\n\t1.9637607681544267,\n\t1.963754701175997,\n\t1.96374865355578,\n\t1.9637426252012729,\n\t1.9637366160205605,\n\t1.9637306259223126,\n\t1.9637246548157765,\n\t1.9637187026107747,\n\t1.9637127692177012,\n\t1.9637068545475131,\n\t1.9637009585117295,\n\t1.9636950810224274,\n\t1.9636892219922344,\n\t1.9636833813343266,\n\t1.963677558962424,\n\t1.9636717547907854,\n\t1.9636659687342057,\n\t1.96366020070801,\n\t1.9636544506280507,\n\t1.9636487184107032,\n\t1.9636430039728607,\n\t1.963637307231933,\n\t1.9636316281058388,\n\t1.9636259665130043,\n\t1.9636203223723585,\n\t1.9636146956033296,\n\t1.9636090861258415,\n\t1.9636034938603082,\n\t1.963597918727633,\n\t1.9635923606492014,\n\t1.9635868195468806,\n\t1.9635812953430134,\n\t1.9635757879604159,\n\t1.9635702973223736,\n\t1.9635648233526377,\n\t1.9635593659754214,\n\t1.9635539251153973,\n\t1.9635485006976923,\n\t1.9635430926478856,\n\t1.9635377008920054,\n\t1.9635323253565247,\n\t1.9635269659683576,\n\t1.9635216226548569,\n\t1.963516295343811,\n\t1.9635109839634397,\n\t1.9635056884423918,\n\t1.9635004087097414,\n\t1.9634951446949849,\n\t1.9634898963280374,\n\t1.9634846635392311,\n\t1.9634794462593101,\n\t1.9634742444194289,\n\t1.9634690579511493,\n\t1.9634638867864362,\n\t1.9634587308576554,\n\t1.9634535900975714,\n\t1.9634484644393435,\n\t1.9634433538165224,\n\t1.963438258163049,\n\t1.96343317741325,\n\t1.963428111501836,\n\t1.9634230603638985,\n\t1.9634180239349066,\n\t1.9634130021507055,\n\t1.9634079949475116,\n\t1.9634030022619122,\n\t1.9633980240308617,\n\t1.9633930601916791,\n\t1.963388110682045,\n\t1.9633831754399986,\n\t1.963378254403937,\n\t1.9633733475126116,\n\t1.9633684547051236,\n\t1.9633635759209254,\n\t1.9633587110998145,\n\t1.9633538601819331,\n\t1.9633490231077657,\n\t1.9633441998181338,\n\t1.9633393902541987,\n\t1.9633345943574538,\n\t1.9633298120697256,\n\t1.96332504333317,\n\t1.9633202880902698,\n\t1.9633155462838343,\n\t1.963310817856994,\n\t1.9633061027532,\n\t1.9633014009162226,\n\t1.9632967122901475,\n\t1.9632920368193745,\n\t1.963287374448614,\n\t1.9632827251228866,\n\t1.9632780887875207,\n\t1.9632734653881478,\n\t1.963268854870705,\n\t1.963264257181428,\n\t1.9632596722668525,\n\t1.9632551000738105,\n\t1.9632505405494287,\n\t1.963245993641126,\n\t1.963241459296613,\n\t1.9632369374638876,\n\t1.963232428091235,\n\t1.9632279311272245,\n\t1.963223446520709,\n\t1.9632189742208208,\n\t1.963214514176972,\n\t1.9632100663388516,\n\t1.9632056306564227,\n\t1.9632012070799227,\n\t1.9631967955598593,\n\t1.9631923960470097,\n\t1.9631880084924196,\n\t1.9631836328473993,\n\t1.9631792690635235,\n\t1.9631749170926298,\n\t1.9631705768868148,\n\t1.9631662483984351,\n\t1.9631619315801037,\n\t1.9631576263846882,\n\t1.9631533327653103,\n\t1.9631490506753435,\n\t1.963144780068411,\n\t1.963140520898385,\n\t1.9631362731193833,\n\t1.9631320366857699,\n\t1.9631278115521522,\n\t1.9631235976733785,\n\t1.9631193950045382,\n\t1.963115203500959,\n\t1.963111023118206,\n\t1.9631068538120793,\n\t1.963102695538613,\n\t1.963098548254074,\n\t1.963094411914959,\n\t1.963090286477995,\n\t1.9630861719001376,\n\t1.9630820681385661,\n\t1.963077975150687,\n\t1.963073892894129,\n\t1.9630698213267435,\n\t1.9630657604066017,\n\t1.9630617100919938,\n\t1.9630576703414275,\n\t1.9630536411136277,\n\t1.9630496223675324,\n\t1.963045614062295,\n\t1.963041616157278,\n\t1.9630376286120574,\n\t1.9630336513864166,\n\t1.9630296844403485,\n\t1.9630257277340504,\n\t1.9630217812279265,\n\t1.9630178448825841,\n\t1.963013918658834,\n\t1.9630100025176869,\n\t1.9630060964203544,\n\t1.9630022003282468,\n\t1.9629983142029712,\n\t1.9629944380063318,\n\t1.962990571700327,\n\t1.9629867152471494,\n\t1.9629828686091835,\n\t1.9629790317490055,\n\t1.962975204629381,\n\t1.9629713872132657,\n\t1.9629675794638015,\n\t1.962963781344317,\n\t1.9629599928183272,\n\t1.9629562138495296,\n\t1.9629524444018054,\n\t1.9629486844392179,\n\t1.9629449339260105,\n\t1.9629411928266058,\n\t1.962937461105606,\n\t1.9629337387277892,\n\t1.9629300256581104,\n\t1.9629263218616995,\n\t1.9629226273038602,\n\t1.9629189419500692,\n\t1.9629152657659752,\n\t1.9629115987173975,\n\t1.9629079407703247,\n\t1.9629042918909145,\n\t1.9629006520454917,\n\t1.9628970212005485,\n\t1.9628933993227415,\n\t1.9628897863788926,\n\t1.9628861823359869,\n\t1.962882587161172,\n\t1.9628790008217571,\n\t1.9628754232852115,\n\t1.9628718545191641,\n\t1.9628682944914029,\n\t1.9628647431698727,\n\t1.9628612005226753,\n\t1.9628576665180681,\n\t1.9628541411244633,\n\t1.9628506243104265,\n\t1.962847116044676,\n\t1.962843616296083,\n\t1.9628401250336684,\n\t1.9628366422266041,\n\t1.9628331678442101,\n\t1.962829701855956,\n\t1.9628262442314577,\n\t1.9628227949404782,\n\t1.9628193539529253,\n\t1.962815921238852,\n\t1.9628124967684557,\n\t1.962809080512076,\n\t1.9628056724401943,\n\t1.962802272523434,\n\t1.9627988807325591,\n\t1.9627954970384724,\n\t1.9627921214122162,\n\t1.96278875382497,\n\t1.9627853942480507,\n\t1.9627820426529121,\n\t1.9627786990111424,\n\t1.9627753632944653,\n\t1.962772035474738,\n\t1.962768715523951,\n\t1.962765403414227,\n\t1.9627620991178198,\n\t1.9627588026071152,\n\t1.9627555138546275,\n\t1.9627522328330012,\n\t1.962748959515009,\n\t1.962745693873551,\n\t1.9627424358816548,\n\t1.9627391855124732,\n\t1.9627359427392859,\n\t1.9627327075354966,\n\t1.9627294798746329,\n\t1.9627262597303463,\n\t1.9627230470764099,\n\t1.962719841886719,\n\t1.962716644135291,\n\t1.9627134537962623,\n\t1.9627102708438906,\n\t1.9627070952525512,\n\t1.9627039269967388,\n\t1.9627007660510651,\n\t1.9626976123902597,\n\t1.9626944659891674,\n\t1.9626913268227497,\n\t1.9626881948660826,\n\t1.9626850700943568,\n\t1.9626819524828756,\n\t1.9626788420070573,\n\t1.962675738642431,\n\t1.9626726423646375,\n\t1.9626695531494305,\n\t1.962666470972672,\n\t1.9626633958103352,\n\t1.9626603276385024,\n\t1.962657266433364,\n\t1.962654212171219,\n\t1.962651164828473,\n\t1.962648124381639,\n\t1.962645090807336,\n\t1.9626420640822897,\n\t1.9626390441833281,\n\t1.9626360310873863,\n\t1.9626330247715016,\n\t1.962630025212815,\n\t1.962627032388571,\n\t1.9626240462761142,\n\t1.9626210668528927,\n\t1.9626180940964544,\n\t1.9626151279844477,\n\t1.9626121684946207,\n\t1.9626092156048216,\n\t1.9626062692929966,\n\t1.9626033295371899,\n\t1.9626003963155434,\n\t1.9625974696062964,\n\t1.9625945493877848,\n\t1.9625916356384394,\n\t1.9625887283367882,\n\t1.9625858274614525,\n\t1.962582932991149,\n\t1.9625800449046875,\n\t1.9625771631809725,\n\t1.962574287799,\n\t1.9625714187378587,\n\t1.9625685559767294,\n\t1.9625656994948841,\n\t1.9625628492716856,\n\t1.9625600052865868,\n\t1.9625571675191313,\n\t1.9625543359489512,\n\t1.9625515105557676,\n\t1.9625486913193901,\n\t1.9625458782197165,\n\t1.9625430712367309,\n\t1.962540270350506,\n\t1.9625374755412,\n\t1.962534686789057,\n\t1.962531904074407,\n\t1.9625291273776646,\n\t1.96252635667933,\n\t1.9625235919599864,\n\t1.962520833200302,\n\t1.9625180803810265,\n\t1.962515333482994,\n\t1.9625125924871198,\n\t1.9625098573744026,\n\t1.9625071281259212,\n\t1.962504404722836,\n\t1.9625016871463874,\n\t1.9624989753778976,\n\t1.9624962693987664,\n\t1.9624935691904748,\n\t1.9624908747345817,\n\t1.9624881860127243,\n\t1.9624855030066184,\n\t1.9624828256980582,\n\t1.962480154068913,\n\t1.962477488101131,\n\t1.962474827776736,\n\t1.9624721730778274,\n\t1.962469523986581,\n\t1.9624668804852476,\n\t1.9624642425561525,\n\t1.962461610181696,\n\t1.9624589833443515,\n\t1.9624563620266673,\n\t1.9624537462112641,\n\t1.9624511358808356,\n\t1.9624485310181483,\n\t1.9624459316060407,\n\t1.9624433376274224,\n\t1.9624407490652758,\n\t1.9624381659026522,\n\t1.9624355881226763,\n\t1.962433015708541,\n\t1.9624304486435091,\n\t1.9624278869109137,\n\t1.9624253304941575,\n\t1.9624227793767104,\n\t1.9624202335421121,\n\t1.9624176929739703,\n\t1.9624151576559599,\n\t1.962412627571823,\n\t1.9624101027053702,\n\t1.9624075830404768,\n\t1.9624050685610865,\n\t1.962402559251207,\n\t1.9624000550949139,\n\t1.9623975560763454,\n\t1.962395062179708,\n\t1.9623925733892695,\n\t1.9623900896893647,\n\t1.9623876110643914,\n\t1.9623851374988106,\n\t1.9623826689771475,\n\t1.96238020548399,\n\t1.9623777470039887,\n\t1.962375293521857,\n\t1.9623728450223694,\n\t1.9623704014903631,\n\t1.9623679629107367,\n\t1.9623655292684494,\n\t1.9623631005485223,\n\t1.9623606767360353,\n\t1.9623582578161303,\n\t1.9623558437740083,\n\t1.9623534345949294,\n\t1.9623510302642144,\n\t1.9623486307672415,\n\t1.9623462360894495,\n\t1.962343846216334,\n\t1.962341461133449,\n\t1.9623390808264078,\n\t1.9623367052808791,\n\t1.9623343344825908,\n\t1.962331968417326,\n\t1.9623296070709262,\n\t1.9623272504292881,\n\t1.9623248984783654,\n\t1.9623225512041673,\n\t1.9623202085927578,\n\t1.9623178706302578,\n\t1.9623155373028418,\n\t1.9623132085967403,\n\t1.962310884498237,\n\t1.962308564993671,\n\t1.962306250069434,\n\t1.9623039397119733,\n\t1.9623016339077874,\n\t1.9622993326434304,\n\t1.962297035905507,\n\t1.9622947436806755,\n\t1.9622924559556474,\n\t1.962290172717185,\n\t1.9622878939521027,\n\t1.9622856196472673,\n\t1.962283349789597\n], t = Object.freeze(() => {}), n = globalThis.Event;\nvar r = class extends n {\n\tget error() {\n\t\treturn this.#e;\n\t}\n\tget reason() {\n\t\treturn this.#t;\n\t}\n\tget task() {\n\t\treturn this.#n;\n\t}\n\t#e;\n\t#t;\n\t#n;\n\tconstructor(e, t, n) {\n\t\tsuper(e), t != null && (this.#n = t), typeof n == \"string\" ? this.#t = n : n != null && (this.#e = n);\n\t}\n};\n//#endregion\n//#region src/async.ts\nconst i = (e) => e !== null && (typeof e == \"object\" || typeof e == \"function\") && typeof e.then == \"function\", a = (async () => {}).constructor, o = (e) => typeof e == \"function\" && e.constructor === a, s = (e) => {\n\tif (e == null) return !1;\n\tif (o(e)) return !0;\n\ttry {\n\t\tlet n = e(), r = i(n);\n\t\tif (r) try {\n\t\t\tn.then(t).catch(t);\n\t\t} catch {}\n\t\treturn r;\n\t} catch {\n\t\treturn !1;\n\t}\n}, c = (e, t) => {\n\tif (!e) {\n\t\tlet e = Error.stackTraceLimit;\n\t\ttry {\n\t\t\tError.stackTraceLimit = 0;\n\t\t\tlet n = Error(t);\n\t\t\tthrow Error.stackTraceLimit = e, e !== 0 && Error.captureStackTrace(n, c), n;\n\t\t} finally {\n\t\t\tError.stackTraceLimit = e;\n\t\t}\n\t}\n}, l = (e) => {\n\tswitch (typeof e) {\n\t\tcase \"function\": return Error(e.name);\n\t\tcase \"object\": if (e !== null) return e instanceof Error ? e : Error(e.message ?? \"\");\n\t\tcase \"undefined\": return Error();\n\t\tcase \"string\": return Error(e);\n\t\tdefault: return Error(String(e));\n\t}\n}, u = (e) => Number(e) / 1e6, d = (e) => Number(e) * 1e6, f = (e) => e, p = (e) => BigInt(Math.round(e * 1e6));\n//#endregion\n//#region src/runtime.ts\nfunction m(e = globalThis) {\n\tlet t = \"unknown\", n = \"unknown\";\n\tif (e.Bun || e.process && e.process.versions?.bun) {\n\t\tt = \"bun\";\n\t\tlet r = e.Bun?.version;\n\t\tif (r) n = r;\n\t\telse {\n\t\t\tlet t = e.process?.versions?.bun;\n\t\t\tt && (n = t);\n\t\t}\n\t} else e.Deno ? (t = \"deno\", n = e.Deno.version?.deno ?? \"unknown\") : e.process && e.process.release?.name === \"node\" ? (t = \"node\", n = e.process.versions?.node ?? \"unknown\") : e.HermesInternal ? (t = \"hermes\", n = e.HermesInternal.getRuntimeProperties?.()[\"OSS Release Version\"] ?? \"unknown\") : h(e) && e.navigator.userAgent === \"Cloudflare-Workers\" ? t = \"workerd\" : h(e) && e.navigator.userAgent.toLowerCase().startsWith(\"quickjs-ng\") ? (t = \"quickjs-ng\", n = e.navigator.userAgent.split(\"/\")[1] ?? \"unknown\") : typeof e.Netlify == \"object\" ? t = \"netlify\" : typeof e.EdgeRuntime == \"string\" ? t = \"edge-light\" : e.__lagon__ ? t = \"lagon\" : e.fastly ? t = \"fastly\" : e.$262 && e.lockdown && e.AsyncDisposableStack ? t = \"moddable\" : e.d8 ? (t = \"v8\", n = typeof e.version == \"function\" ? e.version() : \"unknown\") : e.inIon && e.performance && e.performance.mozMemory ? t = \"spidermonkey\" : typeof e.$ == \"object\" && e.$ !== null && \"IsHTMLDDA\" in e.$ ? t = \"jsc\" : e.window && e.navigator && (t = \"browser\");\n\treturn {\n\t\truntime: t,\n\t\tversion: n\n\t};\n}\nfunction h(e = globalThis) {\n\treturn typeof e.navigator == \"object\" && e.navigator !== null && typeof e.navigator.userAgent == \"string\";\n}\nconst { runtime: g, version: _ } = m(), v = globalThis.performance.now.bind(globalThis.performance), y = {\n\tfn: v,\n\tfromMs: f,\n\tname: \"performanceNow\",\n\ttoMs: f\n}, b = globalThis.process?.hrtime?.bigint.bind(globalThis.process?.hrtime) ?? (() => {\n\tthrow Error(\"hrtime.bigint() is not supported in this JS environment\");\n}), x = () => u(b()), S = {\n\tfn: b,\n\tfromMs: p,\n\tname: \"hrtimeNow\",\n\ttoMs: u\n}, C = globalThis.Bun?.nanoseconds, w = C ? {\n\tfn: C,\n\tfromMs: d,\n\tname: \"bunNanoseconds\",\n\ttoMs: u\n} : void 0;\nfunction T(e) {\n\treturn {\n\t\tfn: e,\n\t\tfromMs: f,\n\t\tname: \"custom\",\n\t\ttoMs: f\n\t};\n}\nconst E = (e = g) => e === \"bun\" ? w : e === \"deno\" ? y : e === \"node\" ? S : y, D = (e) => {\n\tswitch (typeof e) {\n\t\tcase \"function\": return T(e);\n\t\tcase \"string\": switch (e) {\n\t\t\tcase \"auto\": return E();\n\t\t\tcase \"bunNanoseconds\": return w ?? y;\n\t\t\tcase \"hrtimeNow\": return S;\n\t\t\tdefault: return y;\n\t\t}\n\t\tcase \"object\": return e === null ? y : (c(O(e), \"Invalid Timestamp Provider object\"), e);\n\t\tcase \"undefined\": return y;\n\t\tdefault: throw Error(\"Invalid value for 'timestampProvider' or 'now'\");\n\t}\n};\nfunction O(e) {\n\treturn typeof e == \"object\" && !!e && typeof e.fn == \"function\" && typeof e.name == \"string\" && typeof e.toMs == \"function\" && typeof e.fromMs == \"function\";\n}\n//#endregion\n//#region src/concurrency.ts\nconst ee = async (e) => {\n\tlet { fn: t, iterations: n, limit: r, signal: i, time: a = 0, timestampProvider: o = y } = e, s = n === 0 ? r : Math.max(0, Math.min(r, n)), c = [], u = [], d = !0, f = 0, p = Number.isFinite(a) && a > 0, m = n > 0, h = 0, g = o.fn, _ = m ? p ? () => d && f++ < n && (g() < h || (d = !1)) : () => d && f++ < n : p ? () => d && (g() < h || (d = !1)) : () => d, v = (e) => {\n\t\td && u.push(e);\n\t}, b = (e) => {\n\t\tc.push(l(e));\n\t}, x = () => d = !1;\n\tif (i) {\n\t\tif (i.aborted) return [];\n\t\ti.addEventListener(\"abort\", x);\n\t}\n\tlet S = async () => {\n\t\tfor (; _();) try {\n\t\t\tv(await t());\n\t\t} catch (e) {\n\t\t\td = !1, b(e);\n\t\t\tbreak;\n\t\t}\n\t};\n\tp && (h = g() + o.fromMs(a));\n\tlet C = Array.from({ length: s }, () => S());\n\tif (await Promise.allSettled(C), c.length === 0) return u;\n\tthrow c.length === 1 ? c[0] : AggregateError(c, \"Multiple errors occurred during concurrent execution\");\n}, k = (e, t = 5, n = 2) => {\n\tif (e === Infinity) return \"+∞\";\n\tif (e === -Infinity) return \"-∞\";\n\tif (e !== e) return \"NaN\";\n\tlet r = Math.abs(e);\n\tif (r >= 10 ** t) return e.toFixed();\n\tif (r < 10 ** (t - n)) return e.toFixed(n);\n\tlet i = Math.min(Math.max(0, t - (Math.floor(Math.log10(r)) + 1)), n);\n\treturn e.toFixed(i);\n}, A = (e) => {\n\tlet t = e.result.state;\n\treturn {\n\t\t\"Task name\": e.name,\n\t\t...t === \"aborted-with-statistics\" || t === \"completed\" ? {\n\t\t\t\"Latency avg (ns)\": `${k(d(e.result.latency.mean))} \\xb1 ${k(e.result.latency.rme)}%`,\n\t\t\t\"Latency med (ns)\": `${k(d(e.result.latency.p50))} \\xb1 ${k(d(e.result.latency.mad))}`,\n\t\t\t\"Throughput avg (ops/s)\": `${Math.round(e.result.throughput.mean).toString()} \\xb1 ${k(e.result.throughput.rme)}%`,\n\t\t\t\"Throughput med (ops/s)\": `${Math.round(e.result.throughput.p50).toString()} \\xb1 ${Math.round(e.result.throughput.mad).toString()}`,\n\t\t\tSamples: e.result.latency.samplesCount\n\t\t} : t === \"errored\" ? {\n\t\t\tError: e.result.error.message,\n\t\t\tStack: e.result.error.stack ?? \"N/A\"\n\t\t} : {\n\t\t\t\"Latency avg (ns)\": \"N/A\",\n\t\t\t\"Latency med (ns)\": \"N/A\",\n\t\t\t\"Throughput avg (ops/s)\": \"N/A\",\n\t\t\t\"Throughput med (ops/s)\": \"N/A\",\n\t\t\tSamples: \"N/A\",\n\t\t\tRemarks: t\n\t\t},\n\t\t...t === \"aborted-with-statistics\" && { Remarks: t }\n\t};\n}, j = (e) => Array.isArray(e) && e.length !== 0;\nfunction M(e) {\n\te.sort(I);\n}\nconst N = (e) => {\n\tlet t = e.length;\n\tif (t === 1) return {\n\t\tmean: e[0],\n\t\tvr: 0\n\t};\n\tlet n = 0, r = 0, i = 0, a = 0, o = 0;\n\tfor (; o < t;) i = e[o++], a = i - n, n += a / o, r += a * (i - n);\n\treturn {\n\t\tmean: n,\n\t\tvr: r / (t - 1)\n\t};\n}, P = (e, t) => {\n\tlet n = e + t;\n\treturn Number.isFinite(n) ? n / 2 : e / 2 + t / 2;\n}, F = (e, t) => {\n\tlet n = (e.length - 1) * t, r = Math.floor(n), i = e[r];\n\tif (n === r) return i;\n\tlet a = e[r + 1];\n\tif (i === a) return i;\n\tlet o = n - r;\n\tif (o === .5) return P(i, a);\n\tlet s = a - i;\n\treturn Number.isFinite(s) ? i + o * s : (1 - o) * i + o * a;\n}, I = (e, t) => e - t, L = (e, t) => {\n\tlet n = 0, r = e.length, i = 0;\n\tfor (; i < r;) n += (Math.abs(e[i++] - t) - n) / i;\n\treturn n;\n};\nfunction R(e, t) {\n\tlet n = e.length;\n\tif (n === 1) return 0;\n\tlet r = n >> 1, i = n + 1 >> 1, a = 0, o = r, s, c, l, u, d, f;\n\tfor (; a <= o;) {\n\t\tif (s = a + o >> 1, c = i - s, l = s === 0 ? -Infinity : t - e[r - s], d = s === r ? Infinity : t - e[r - s - 1], u = c === 0 ? -Infinity : e[r + c - 1] - t, f = c === n - r ? Infinity : e[r + c] - t, l <= f && u <= d) return n & 1 ? Math.max(l, u) : P(Math.max(l, u), Math.min(d, f));\n\t\tl > f ? o = s - 1 : a = s + 1;\n\t}\n\treturn 0;\n}\nconst z = (e) => R(e, F(e, .5));\nfunction B(t, n = !1) {\n\tlet { mean: r, vr: i } = N(t), a = Math.sqrt(i), o = a / Math.sqrt(t.length), s = t.length - 1, c = e[s || 1] ?? e[0], l = o * c, u = r === 0 ? Infinity : l / Math.abs(r) * 100, d = F(t, .5);\n\treturn {\n\t\taad: L(t, r),\n\t\tcritical: c,\n\t\tdf: s,\n\t\tmad: R(t, d),\n\t\tmax: t[s],\n\t\tmean: r,\n\t\tmin: t[0],\n\t\tmoe: l,\n\t\tp50: d,\n\t\tp75: F(t, .75),\n\t\tp99: F(t, .99),\n\t\tp995: F(t, .995),\n\t\tp999: F(t, .999),\n\t\trme: u,\n\t\tsamples: n ? t : void 0,\n\t\tsamplesCount: t.length,\n\t\tsd: a,\n\t\tsem: o,\n\t\tvariance: i\n\t};\n}\n//#endregion\n//#region src/timer-diagnostics.ts\nconst V = (e, t) => {\n\tlet n = e.length;\n\tif (n < 10) return;\n\tlet r = 0;\n\tfor (let t of e) t === 0 && r++;\n\tif (r * 2 > n) return \"zero-dominated\";\n\tlet i = Math.max(3, Math.min(10, Math.floor(n / 1e3))), a = 1;\n\tfor (let t = 1; t < n && !(e[t] !== e[t - 1] && (a++, a >= i)); t++);\n\tif (a < i) return \"low-distinct\";\n\tif (n > 100 && t === 0) return \"zero-mad\";\n}, H = (e, t) => V(e, t) !== void 0, U = (e) => {\n\tlet t;\n\tfor (let n = 0; n < e.length; n++) {\n\t\tlet r = e[n];\n\t\tif (!(r <= 0) && (t ??= r, e[n + 1] === r)) return r;\n\t}\n\treturn t;\n}, W = (e, t = {}) => {\n\tlet { estimator: n = \"median\", pairs: r = 1024, warmupPairs: i = 64 } = t, { fn: a, toMs: o } = e;\n\tif (!Number.isInteger(r) || r <= 0) return 0;\n\tif (Number.isInteger(i) && i > 0) for (let e = 0; e < i; e++) {\n\t\tlet e = a();\n\t\to(a() - e);\n\t}\n\tlet s = [];\n\tfor (let e = 0; e < r; e++) {\n\t\tlet e = a(), t = o(a() - e);\n\t\tt > 0 && s.push(t);\n\t}\n\treturn s.length * 2 < r ? 0 : (s.sort(I), n === \"min\" ? s[0] : F(s, n === \"p05\" ? .05 : .5));\n}, G = [\n\t\"afterAll\",\n\t\"beforeAll\",\n\t\"beforeEach\",\n\t\"afterEach\"\n], K = [\"not-started\", \"started\"], q = { state: \"not-started\" }, J = { state: \"aborted\" }, Y = { state: \"started\" };\nvar X = class extends EventTarget {\n\tget detectedResolution() {\n\t\treturn this.#r;\n\t}\n\tget name() {\n\t\treturn this.#o;\n\t}\n\tget result() {\n\t\treturn {\n\t\t\t...this.#s,\n\t\t\truntime: this.#n.runtime,\n\t\t\truntimeVersion: this.#n.runtimeVersion,\n\t\t\ttimestampProviderName: this.#n.timestampProvider.name\n\t\t};\n\t}\n\tget runs() {\n\t\treturn this.#l;\n\t}\n\t#e = !1;\n\t#t;\n\t#n;\n\t#r = void 0;\n\t#i;\n\t#a;\n\t#o;\n\t#s = q;\n\t#c;\n\t#l = 0;\n\t#u;\n\t#d;\n\t#f;\n\t#p;\n\tconstructor(e, t, n, r = {}) {\n\t\tsuper(), this.#n = e, this.#o = t, this.#i = n, this.#a = r, this.#t = r.async ?? s(n), this.#u = r.signal, this.#c = r.retainSamples ?? e.retainSamples, this.#f = e.timestampProvider, this.#d = e.timestampProvider.fn, this.#p = e.timestampProvider.toMs;\n\t\tfor (let e of G) this.#a[e] != null && c(typeof this.#a[e] == \"function\", `'${e}' must be a function if provided`);\n\t\tthis.reset(!1), this.#u && (this.#u.aborted ? this.#v() : this.#u.addEventListener(\"abort\", this.#v.bind(this), { once: !0 })), this.#n.signal && (this.#n.signal.aborted ? this.#v() : this.#n.signal.addEventListener(\"abort\", this.#v.bind(this), { once: !0 }));\n\t}\n\treset(e = !0) {\n\t\tthis.#l = 0, this.#r = void 0, this.#s = this.#e ? J : q, e && this.dispatchEvent(new r(\"reset\", this));\n\t}\n\tasync run() {\n\t\tif (this.#s.state !== \"not-started\") return this;\n\t\tthis.#s = { state: \"started\" }, this.dispatchEvent(new r(\"start\", this)), await this.#n.setup(this, \"run\");\n\t\tlet { error: e, overriddenIndices: t, samples: n } = await this.#m(\"run\", this.#n.time, this.#n.iterations);\n\t\treturn await this.#n.teardown(this, \"run\"), this.#b({\n\t\t\terror: e,\n\t\t\tlatencySamples: n,\n\t\t\toverriddenIndices: t\n\t\t}), this;\n\t}\n\trunSync() {\n\t\tif (this.#s.state !== \"not-started\") return this;\n\t\tc(this.#n.concurrency === null, \"Cannot use `concurrency` option when using `runSync`\"), this.#s = Y, this.dispatchEvent(new r(\"start\", this));\n\t\tlet e = this.#n.setup(this, \"run\");\n\t\tc(!i(e), \"`setup` function must be sync when using `runSync()`\");\n\t\tlet { error: t, overriddenIndices: n, samples: a } = this.#h(\"run\", this.#n.time, this.#n.iterations), o = this.#n.teardown(this, \"run\");\n\t\treturn c(!i(o), \"`teardown` function must be sync when using `runSync()`\"), this.#b({\n\t\t\terror: t,\n\t\t\tlatencySamples: a,\n\t\t\toverriddenIndices: n\n\t\t}), this;\n\t}\n\tasync warmup() {\n\t\tif (this.#s.state !== \"not-started\") return;\n\t\tthis.dispatchEvent(new r(\"warmup\", this)), await this.#n.setup(this, \"warmup\");\n\t\tlet { error: e } = await this.#m(\"warmup\", this.#n.warmupTime, this.#n.warmupIterations);\n\t\tawait this.#n.teardown(this, \"warmup\"), this.#y(e);\n\t}\n\twarmupSync() {\n\t\tif (this.#s.state !== \"not-started\") return;\n\t\tthis.dispatchEvent(new r(\"warmup\", this));\n\t\tlet e = this.#n.setup(this, \"warmup\");\n\t\tc(!i(e), \"`setup` function must be sync when using `runSync()`\");\n\t\tlet { error: t } = this.#h(\"warmup\", this.#n.warmupTime, this.#n.warmupIterations), n = this.#n.teardown(this, \"warmup\");\n\t\tc(!i(n), \"`teardown` function must be sync when using `runSync()`\"), this.#y(t);\n\t}\n\tasync #m(e, t, n) {\n\t\ttry {\n\t\t\tthis.#a.beforeAll && await this.#a.beforeAll.call(this, e);\n\t\t\tlet r = this.#n.concurrency !== \"task\", i = 0, a = [], o = new Set(), s = async () => {\n\t\t\t\tif (!this.#e) try {\n\t\t\t\t\tthis.#a.beforeEach != null && await this.#a.beforeEach.call(this, e);\n\t\t\t\t\tlet { iterationCost: t, overridden: n, taskTime: s } = this.#t ? await this.#g(r) : this.#_(r), c = a.push(s) - 1;\n\t\t\t\t\tn && o.add(c), r && (i += t ?? s);\n\t\t\t\t} finally {\n\t\t\t\t\tthis.#a.afterEach != null && await this.#a.afterEach.call(this, e);\n\t\t\t\t}\n\t\t\t};\n\t\t\tif (!r) await ee({\n\t\t\t\tfn: s,\n\t\t\t\titerations: n,\n\t\t\t\tlimit: Math.max(1, Math.floor(this.#n.threshold)),\n\t\t\t\tsignal: this.#u ?? this.#n.signal,\n\t\t\t\ttime: t,\n\t\t\t\ttimestampProvider: this.#f\n\t\t\t}), this.#l = a.length;\n\t\t\telse for (; (i < t || a.length < n) && !this.#e;) await s();\n\t\t\treturn this.#a.afterAll != null && await this.#a.afterAll.call(this, e), j(a) ? {\n\t\t\t\toverriddenIndices: o,\n\t\t\t\tsamples: a\n\t\t\t} : {};\n\t\t} catch (e) {\n\t\t\treturn { error: l(e) };\n\t\t}\n\t}\n\t#h(e, t, n) {\n\t\ttry {\n\t\t\tif (this.#a.beforeAll) {\n\t\t\t\tlet t = this.#a.beforeAll.call(this, e);\n\t\t\t\tc(!i(t), \"`beforeAll` function must be sync when using `runSync()`\");\n\t\t\t}\n\t\t\tlet r = 0, a = [], o = new Set(), s = () => {\n\t\t\t\tif (!this.#e) try {\n\t\t\t\t\tif (this.#a.beforeEach) {\n\t\t\t\t\t\tlet t = this.#a.beforeEach.call(this, e);\n\t\t\t\t\t\tc(!i(t), \"`beforeEach` function must be sync when using `runSync()`\");\n\t\t\t\t\t}\n\t\t\t\t\tlet { iterationCost: t, overridden: n, taskTime: s } = this.#_(!0), l = a.push(s) - 1;\n\t\t\t\t\tn && o.add(l), r += t ?? s;\n\t\t\t\t} finally {\n\t\t\t\t\tif (this.#a.afterEach) {\n\t\t\t\t\t\tlet t = this.#a.afterEach.call(this, e);\n\t\t\t\t\t\tc(!i(t), \"`afterEach` function must be sync when using `runSync()`\");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t};\n\t\t\tfor (; (r < t || a.length < n) && !this.#e;) s();\n\t\t\tif (this.#a.afterAll) {\n\t\t\t\tlet t = this.#a.afterAll.call(this, e);\n\t\t\t\tc(!i(t), \"`afterAll` function must be sync when using `runSync()`\");\n\t\t\t}\n\t\t\treturn j(a) ? {\n\t\t\t\toverriddenIndices: o,\n\t\t\t\tsamples: a\n\t\t\t} : {};\n\t\t} catch (e) {\n\t\t\treturn { error: l(e) };\n\t\t}\n\t}\n\tasync #g(e) {\n\t\tlet t = this.#d(), n = await this.#i.call(this), r = this.#p(this.#d() - t), i = e ? Q(n) : void 0, a = Z(n);\n\t\treturn a === void 0 ? {\n\t\t\titerationCost: i,\n\t\t\toverridden: !1,\n\t\t\ttaskTime: r\n\t\t} : {\n\t\t\titerationCost: i,\n\t\t\toverridden: !0,\n\t\t\ttaskTime: a\n\t\t};\n\t}\n\t#_(e) {\n\t\tlet t = this.#d(), n = this.#i.call(this), r = this.#p(this.#d() - t);\n\t\tc(!i(n), \"task function must be sync when using `runSync()`\");\n\t\tlet a = e ? Q(n) : void 0, o = Z(n);\n\t\treturn o === void 0 ? {\n\t\t\titerationCost: a,\n\t\t\toverridden: !1,\n\t\t\ttaskTime: r\n\t\t} : {\n\t\t\titerationCost: a,\n\t\t\toverridden: !0,\n\t\t\ttaskTime: o\n\t\t};\n\t}\n\t#v() {\n\t\tif (this.#e = !0, K.includes(this.#s.state)) {\n\t\t\tthis.#s = J;\n\t\t\tlet e = new r(\"abort\", this);\n\t\t\tthis.dispatchEvent(e), this.#n.dispatchEvent(e);\n\t\t}\n\t}\n\t#y(e) {\n\t\tif (e) {\n\t\t\tthis.#s = {\n\t\t\t\tstate: \"errored\",\n\t\t\t\terror: e\n\t\t\t};\n\t\t\tlet t = new r(\"error\", this, e);\n\t\t\tif (this.dispatchEvent(t), this.#n.dispatchEvent(t), this.#n.throws) throw e;\n\t\t}\n\t}\n\t#b({ error: e, latencySamples: t, overriddenIndices: n }) {\n\t\tif (j(t)) {\n\t\t\tthis.#l = t.length;\n\t\t\tlet e = this.#n.timerOverhead;\n\t\t\tif (e !== void 0 && e > 0) for (let r = 0; r < t.length; r++) n?.has(r) || (t[r] = Math.max(0, t[r] - e));\n\t\t\tlet i = (n?.size ?? 0) > 0, a = i ? t.filter((e, t) => !n?.has(t)) : t;\n\t\t\tM(t);\n\t\t\tlet o = B(t, this.#c), s;\n\t\t\ti ? j(a) ? (M(a), this.#r = U(a), s = V(a, z(a))) : this.#r = void 0 : (this.#r = U(t), s = V(t, o.mad));\n\t\t\tlet c = o.mean, l = 0, u = [];\n\t\t\tfor (let e of t) e === 0 ? u.push(c === 0 ? 0 : 1e3 / c) : (l += e, u.push(1e3 / e));\n\t\t\tM(u);\n\t\t\tlet d = B(u, this.#c);\n\t\t\tif (this.#s = {\n\t\t\t\tstate: this.#e ? \"aborted-with-statistics\" : \"completed\",\n\t\t\t\tlatency: o,\n\t\t\t\tperiod: l / this.runs,\n\t\t\t\tthroughput: d,\n\t\t\t\ttotalTime: l\n\t\t\t}, s !== void 0) {\n\t\t\t\tlet e = new r(\"warning\", this, s);\n\t\t\t\tthis.dispatchEvent(e), this.#n.dispatchEvent(e);\n\t\t\t}\n\t\t} else this.#e && (this.#s = J);\n\t\tif (e) {\n\t\t\tthis.#s = {\n\t\t\t\tstate: \"errored\",\n\t\t\t\terror: e\n\t\t\t};\n\t\t\tlet t = new r(\"error\", this, e);\n\t\t\tif (this.dispatchEvent(t), this.#n.dispatchEvent(t), this.#n.throws) throw e;\n\t\t}\n\t\tlet i = new r(\"cycle\", this);\n\t\tthis.dispatchEvent(i), this.#n.dispatchEvent(i), this.dispatchEvent(new r(\"complete\", this));\n\t}\n};\nfunction Z(e) {\n\tif (typeof e != \"object\" || !e) return;\n\tlet t = e;\n\tif (!(\"overriddenDuration\" in t)) return;\n\tlet n = t.overriddenDuration;\n\treturn typeof n == \"number\" && Number.isFinite(n) && n >= 0 ? n : void 0;\n}\nfunction Q(e) {\n\tif (typeof e != \"object\" || !e) return;\n\tlet t = e;\n\ttry {\n\t\tif (!(\"overriddenIterationCost\" in t)) return;\n\t\tlet e = t.overriddenIterationCost;\n\t\treturn typeof e == \"number\" && Number.isFinite(e) && e >= 0 ? e : void 0;\n\t} catch {\n\t\treturn;\n\t}\n}\n//#endregion\n//#region src/bench.ts\nconst $ = \"`subtractTimerOverhead` cannot be used with `concurrency: \\\"task\\\"` — set `concurrency` to `null` or `\\\"bench\\\"`, or disable `subtractTimerOverhead`\";\nvar te = class extends EventTarget {\n\tconcurrency;\n\titerations;\n\tname;\n\tnow;\n\tretainSamples;\n\truntime;\n\truntimeVersion;\n\tsetup;\n\tsignal;\n\tsubtractTimerOverhead;\n\tteardown;\n\tthreshold;\n\tthrows;\n\ttime;\n\ttimerOverhead;\n\ttimestampProvider;\n\twarmup;\n\twarmupIterations;\n\twarmupTime;\n\tget results() {\n\t\treturn this.tasks.map((e) => e.result);\n\t}\n\tget tasks() {\n\t\treturn [...this.#e.values()];\n\t}\n\t#e = new Map();\n\tconstructor(e = {}) {\n\t\tsuper();\n\t\tlet { name: n, ...i } = e;\n\t\tthis.name = n, this.runtime = g, this.runtimeVersion = _, this.concurrency = i.concurrency ?? null, this.threshold = i.threshold ?? Infinity, this.time = i.time ?? 1e3, this.iterations = i.iterations ?? 64, c(i.now === void 0 || i.timestampProvider === void 0, \"Cannot set both `now` and `timestampProvider` options\"), this.timestampProvider = D(i.now ?? i.timestampProvider), this.now = () => this.timestampProvider.toMs(this.timestampProvider.fn()), this.warmup = i.warmup ?? !0, this.warmupIterations = i.warmupIterations ?? 16, this.warmupTime = i.warmupTime ?? 250, this.setup = i.setup ?? t, this.teardown = i.teardown ?? t, this.throws = i.throws ?? !1, i.signal != null && (this.signal = i.signal), this.retainSamples = i.retainSamples === !0, this.subtractTimerOverhead = i.subtractTimerOverhead === !0, c(!(this.subtractTimerOverhead && this.concurrency === \"task\"), $);\n\t\tlet a = this.subtractTimerOverhead ? W(this.timestampProvider) : void 0;\n\t\ta != null && (this.timerOverhead = a), this.signal && this.signal.addEventListener(\"abort\", () => {\n\t\t\tthis.dispatchEvent(new r(\"abort\"));\n\t\t}, { once: !0 });\n\t}\n\tadd(e, t, n = {}) {\n\t\tif (this.#e.has(e)) throw Error(`Task \"${e}\" already exists`);\n\t\t{\n\t\t\tlet i = new X(this, e, t, n);\n\t\t\tthis.#e.set(e, i), this.dispatchEvent(new r(\"add\", i));\n\t\t}\n\t\treturn this;\n\t}\n\tgetTask(e) {\n\t\treturn this.#e.get(e);\n\t}\n\tremove(e) {\n\t\tlet t = this.getTask(e);\n\t\treturn t && (this.#e.delete(e), this.dispatchEvent(new r(\"remove\", t))), this;\n\t}\n\treset() {\n\t\tfor (let e of this.#e.values()) e.reset();\n\t\tthis.dispatchEvent(new r(\"reset\"));\n\t}\n\tasync run() {\n\t\tc(!(this.subtractTimerOverhead && this.concurrency === \"task\"), $), this.warmup && await this.#t(), this.dispatchEvent(new r(\"start\"));\n\t\tlet e = [];\n\t\tif (this.concurrency === \"bench\") {\n\t\t\tlet t = [];\n\t\t\tfor (let e of this.#e.values()) t.push(e.run());\n\t\t\te = await Promise.all(t);\n\t\t} else for (let t of this.#e.values()) e.push(await t.run());\n\t\treturn this.dispatchEvent(new r(\"complete\")), e;\n\t}\n\trunSync() {\n\t\tc(this.concurrency === null, \"Cannot use `concurrency` option when using `runSync`\"), this.warmup && this.#n();\n\t\tlet e = [];\n\t\tthis.dispatchEvent(new r(\"start\"));\n\t\tfor (let t of this.#e.values()) e.push(t.runSync());\n\t\treturn this.dispatchEvent(new r(\"complete\")), e;\n\t}\n\ttable(e = A) {\n\t\treturn this.tasks.map(e);\n\t}\n\tasync #t() {\n\t\tif (this.dispatchEvent(new r(\"warmup\")), this.concurrency === \"bench\") {\n\t\t\tlet e = [];\n\t\t\tfor (let t of this.#e.values()) e.push(t.warmup());\n\t\t\tawait Promise.all(e);\n\t\t} else for (let e of this.#e.values()) await e.warmup();\n\t}\n\t#n() {\n\t\tthis.dispatchEvent(new r(\"warmup\"));\n\t\tfor (let e of this.#e.values()) e.warmupSync();\n\t}\n};\n//#endregion\nexport { te as Bench, X as Task, W as calibrateTimerOverhead, V as classifyTimerSaturation, H as detectTimerSaturation, U as estimateResolution, k as formatNumber, x as hrtimeNow, S as hrtimeNowTimestampProvider, d as mToNs, z as medianAbsoluteDeviation, u as nToMs, v as now, y as performanceNowTimestampProvider };\n","import { b as printDiffOrStringify, d as diff, a as processError, T as TestSyntaxError, g as getCurrentTest, c as createTaskCollector, e as getCurrentSuite, f as createChainable, h as getHooks, i as getFn, m as matchesTags, j as afterAll, k as afterEach, l as aroundAll, n as aroundEach, o as beforeAll, q as beforeEach, r as describe, t as it, u as onTestFailed, v as onTestFinished, w as recordArtifact, x as suite, y as test } from './run.C5UmxDPh.js';\nimport { i as isChildProcess, r as resetModules, g as getWorkerState } from './utils.DYj33du9.js';\nimport { e as getDefaultExportFromCjs, f as parseErrorStacktrace, h as commonjsGlobal, a as getSafeTimers, i as parseSingleStack, j as delay } from './source-map.BH0bbrs9.js';\nimport { i as isMockFunction, f as fn, a as spyOn, r as restoreAllMocks, b as resetAllMocks, c as clearAllMocks } from './spy.KLHgXex_.js';\nimport { u as isObject, B as getCallLastIndex, g as getType, D as noop, x as assertTypes, w as ordinal, E as createSimpleStackTrace, i as isAbsolute, a as relative, n as normalize } from './pathe.M-eThtNZ.DwEga6ro.js';\nimport { s as stringify, i as inspect } from './display.pkpxlVcY.js';\nimport { y } from './tinyrainbow.Ht9iggcq.js';\nimport * as chai from 'chai';\nimport { use, util } from 'chai';\nimport { getNames, getTests, getTestName, createFileTask } from '../task-utils.js';\nimport { g as getSerializers, a as addSerializer } from './plugins.Cigb0uSy.js';\nimport { p as positionToOffset, o as offsetToLineNumber, l as lineSplitRE } from './offset.Dy-5Fdfn.js';\nimport { f as format } from './index.M2dsQ_UQ.js';\nimport { r as rpc, V as VitestEvaluatedModules } from './rpc.CJVl3hZH.js';\nimport { Bench } from 'tinybench';\nimport { expectTypeOf } from 'expect-type';\n\nvar naturalCompare$1 = {exports: {}};\n\nvar hasRequiredNaturalCompare;\n\nfunction requireNaturalCompare () {\n\tif (hasRequiredNaturalCompare) return naturalCompare$1.exports;\n\thasRequiredNaturalCompare = 1;\n\t/*\n\t * @version    1.4.0\n\t * @date       2015-10-26\n\t * @stability  3 - Stable\n\t * @author     Lauri Rooden (https://github.com/litejs/natural-compare-lite)\n\t * @license    MIT License\n\t */\n\n\n\tvar naturalCompare = function(a, b) {\n\t\tvar i, codeA\n\t\t, codeB = 1\n\t\t, posA = 0\n\t\t, posB = 0\n\t\t, alphabet = String.alphabet;\n\n\t\tfunction getCode(str, pos, code) {\n\t\t\tif (code) {\n\t\t\t\tfor (i = pos; code = getCode(str, i), code < 76 && code > 65;) ++i;\n\t\t\t\treturn +str.slice(pos - 1, i)\n\t\t\t}\n\t\t\tcode = alphabet && alphabet.indexOf(str.charAt(pos));\n\t\t\treturn code > -1 ? code + 76 : ((code = str.charCodeAt(pos) || 0), code < 45 || code > 127) ? code\n\t\t\t\t: code < 46 ? 65               // -\n\t\t\t\t: code < 48 ? code - 1\n\t\t\t\t: code < 58 ? code + 18        // 0-9\n\t\t\t\t: code < 65 ? code - 11\n\t\t\t\t: code < 91 ? code + 11        // A-Z\n\t\t\t\t: code < 97 ? code - 37\n\t\t\t\t: code < 123 ? code + 5        // a-z\n\t\t\t\t: code - 63\n\t\t}\n\n\n\t\tif ((a+=\"\") != (b+=\"\")) for (;codeB;) {\n\t\t\tcodeA = getCode(a, posA++);\n\t\t\tcodeB = getCode(b, posB++);\n\n\t\t\tif (codeA < 76 && codeB < 76 && codeA > 66 && codeB > 66) {\n\t\t\t\tcodeA = getCode(a, posA, posA);\n\t\t\t\tcodeB = getCode(b, posB, posA = i);\n\t\t\t\tposB = i;\n\t\t\t}\n\n\t\t\tif (codeA != codeB) return (codeA < codeB) ? -1 : 1\n\t\t}\n\t\treturn 0\n\t};\n\n\ttry {\n\t\tnaturalCompare$1.exports = naturalCompare;\n\t} catch (e) {\n\t\tString.naturalCompare = naturalCompare;\n\t}\n\treturn naturalCompare$1.exports;\n}\n\nvar naturalCompareExports = requireNaturalCompare();\nvar naturalCompare = /*@__PURE__*/getDefaultExportFromCjs(naturalCompareExports);\n\n// TODO: rewrite and clean up\nfunction testNameToKey(testName, count) {\n\treturn `${testName} ${count}`;\n}\nfunction keyToTestName(key) {\n\tif (!/ \\d+$/.test(key)) throw new Error(\"Snapshot keys must end with a number.\");\n\treturn key.replace(/ \\d+$/, \"\");\n}\n// Evaluate a snapshot file's content into its snapshot key/value pairs.\nfunction evaluateSnapshotFile(filepath, content) {\n\tconst data = Object.create(null);\n\ttry {\n\t\tnew Function(\"exports\", content)(data);\n\t} catch (cause) {\n\t\tthrow new Error(`Invalid snapshot file, please manually fix or delete it: ${filepath}`, { cause });\n\t}\n\treturn data;\n}\n// Add extra line breaks at beginning and end of multiline snapshot\n// to make the content easier to read.\nfunction addExtraLineBreaks(string) {\n\treturn string.includes(\"\\n\") ? `\\n${string}\\n` : string;\n}\n// Remove extra line breaks at beginning and end of multiline snapshot.\n// Instead of trim, which can remove additional newlines or spaces\n// at beginning or end of the content from a custom serializer.\nfunction removeExtraLineBreaks(string) {\n\treturn string.length > 2 && string[0] === \"\\n\" && string.endsWith(\"\\n\") ? string.slice(1, -1) : string;\n}\n// export const removeLinesBeforeExternalMatcherTrap = (stack: string): string => {\n//   const lines = stack.split('\\n')\n//   for (let i = 0; i < lines.length; i += 1) {\n//     // It's a function name specified in `packages/expect/src/index.ts`\n//     // for external custom matchers.\n//     if (lines[i].includes('__EXTERNAL_MATCHER_TRAP__'))\n//       return lines.slice(i + 1).join('\\n')\n//   }\n//   return stack\n// }\nconst escapeRegex = true;\nconst printFunctionName = false;\nfunction serialize(val, indent = 2, formatOverrides = {}) {\n\treturn normalizeNewlines(format(val, {\n\t\tescapeRegex,\n\t\tindent,\n\t\tplugins: getSerializers(),\n\t\tprintFunctionName,\n\t\t...formatOverrides\n\t}));\n}\nfunction escapeBacktickString(str) {\n\treturn str.replace(/`|\\\\|\\$\\{/g, \"\\\\$&\");\n}\nfunction printBacktickString(str) {\n\treturn `\\`${escapeBacktickString(str)}\\``;\n}\nfunction normalizeNewlines(string) {\n\treturn string.replace(/\\r\\n|\\r/g, \"\\n\");\n}\nasync function saveSnapshotFile(environment, snapshotData, snapshotPath) {\n\tconst snapshots = Object.keys(snapshotData).sort(naturalCompare).map((key) => `exports[${printBacktickString(key)}] = ${printBacktickString(normalizeNewlines(snapshotData[key]))};`);\n\tconst content = `${environment.getHeader()}\\n\\n${snapshots.join(\"\\n\\n\")}\\n`;\n\tconst oldContent = await environment.readSnapshotFile(snapshotPath);\n\tif (oldContent != null && oldContent === content) return;\n\tawait environment.saveSnapshotFile(snapshotPath, content);\n}\nfunction deepMergeArray(target = [], source = []) {\n\tconst mergedOutput = Array.from(target);\n\tsource.forEach((sourceElement, index) => {\n\t\tconst targetElement = mergedOutput[index];\n\t\tif (Array.isArray(target[index])) mergedOutput[index] = deepMergeArray(target[index], sourceElement);\n\t\telse if (isObject(targetElement)) mergedOutput[index] = deepMergeSnapshot(target[index], sourceElement);\n\t\telse\n // Source does not exist in target or target is primitive and cannot be deep merged\n\t\tmergedOutput[index] = sourceElement;\n\t});\n\treturn mergedOutput;\n}\n/**\n* Deep merge, but considers asymmetric matchers. Unlike base util's deep merge,\n* will merge any object-like instance.\n* Compatible with Jest's snapshot matcher. Should not be used outside of snapshot.\n*\n* @example\n* ```ts\n* toMatchSnapshot({\n*   name: expect.stringContaining('text')\n* })\n* ```\n*/\nfunction deepMergeSnapshot(target, source) {\n\tif (isObject(target) && isObject(source)) {\n\t\tconst mergedOutput = { ...target };\n\t\tObject.keys(source).forEach((key) => {\n\t\t\tif (isObject(source[key]) && !source[key].$$typeof) if (!(key in target)) Object.assign(mergedOutput, { [key]: source[key] });\n\t\t\telse mergedOutput[key] = deepMergeSnapshot(target[key], source[key]);\n\t\t\telse if (Array.isArray(source[key])) mergedOutput[key] = deepMergeArray(target[key], source[key]);\n\t\t\telse Object.assign(mergedOutput, { [key]: source[key] });\n\t\t});\n\t\treturn mergedOutput;\n\t} else if (Array.isArray(target) && Array.isArray(source)) return deepMergeArray(target, source);\n\treturn target;\n}\nclass DefaultMap extends Map {\n\tdefaultFn;\n\tconstructor(defaultFn, entries) {\n\t\tsuper(entries);\n\t\tthis.defaultFn = defaultFn;\n\t}\n\tget(key) {\n\t\tif (!this.has(key)) this.set(key, this.defaultFn(key));\n\t\treturn super.get(key);\n\t}\n}\nclass CounterMap extends DefaultMap {\n\tconstructor() {\n\t\tsuper(() => 0);\n\t}\n\t// compat for jest-image-snapshot https://github.com/vitest-dev/vitest/issues/7322\n\t// `valueOf` and `Snapshot.added` setter allows\n\t//   snapshotState.added = snapshotState.added + 1\n\t// to function as\n\t//   snapshotState.added.total_ = snapshotState.added.total() + 1\n\t_total;\n\tvalueOf() {\n\t\treturn this._total = this.total();\n\t}\n\tincrement(key) {\n\t\tif (typeof this._total !== \"undefined\") this._total++;\n\t\tthis.set(key, this.get(key) + 1);\n\t}\n\ttotal() {\n\t\tif (typeof this._total !== \"undefined\") return this._total;\n\t\tlet total = 0;\n\t\tfor (const x of this.values()) total += x;\n\t\treturn total;\n\t}\n}\n/* @__NO_SIDE_EFFECTS__ */\nfunction memo(fn) {\n\tconst cache = /* @__PURE__ */ new Map();\n\treturn (arg) => {\n\t\tif (!cache.has(arg)) cache.set(arg, fn(arg));\n\t\treturn cache.get(arg);\n\t};\n}\n\nasync function saveInlineSnapshots(environment, snapshots) {\n\tconst MagicString = (await import('magic-string')).default;\n\tconst files = new Set(snapshots.map((i) => i.file));\n\tawait Promise.all(Array.from(files).map(async (file) => {\n\t\tconst snaps = snapshots.filter((i) => i.file === file);\n\t\tconst code = await environment.readSnapshotFile(file);\n\t\tif (code == null) throw new Error(`cannot read ${file} when saving inline snapshot`);\n\t\tconst s = new MagicString(code);\n\t\tfor (const snap of snaps) replaceInlineSnap(code, s, positionToOffset(code, snap.line, snap.column), snap.snapshot, snap.assertionName);\n\t\tconst transformed = s.toString();\n\t\tif (transformed !== code) await environment.saveSnapshotFile(file, transformed);\n\t}));\n}\nconst defaultStartObjectRegex = /(?:toMatchInlineSnapshot|toThrowErrorMatchingInlineSnapshot)\\s*\\(\\s*(?:\\/\\*[\\s\\S]*\\*\\/\\s*|\\/\\/.*(?:[\\n\\r\\u2028\\u2029]\\s*|[\\t\\v\\f \\xA0\\u1680\\u2000-\\u200A\\u202F\\u205F\\u3000\\uFEFF]))*\\{/;\nfunction escapeRegExp(s) {\n\treturn s.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\nconst buildStartObjectRegex = memo((assertionName) => {\n\tconst replaced = defaultStartObjectRegex.source.replace(\"toMatchInlineSnapshot|toThrowErrorMatchingInlineSnapshot\", escapeRegExp(assertionName));\n\treturn new RegExp(replaced);\n});\nfunction replaceObjectSnap(code, s, index, newSnap, assertionName) {\n\tlet _code = code.slice(index);\n\tconst startMatch = (assertionName ? buildStartObjectRegex(assertionName) : defaultStartObjectRegex).exec(_code);\n\tif (!startMatch) return false;\n\t_code = _code.slice(startMatch.index);\n\tlet callEnd = getCallLastIndex(_code);\n\tif (callEnd === null) return false;\n\tcallEnd += index + startMatch.index;\n\tconst shapeEnd = getObjectShapeEndIndex(code, index + startMatch.index + startMatch[0].length);\n\tconst snap = `, ${prepareSnapString(newSnap, code, index)}`;\n\tif (shapeEnd === callEnd)\n // toMatchInlineSnapshot({ foo: expect.any(String) })\n\ts.appendLeft(callEnd, snap);\n\telse\n // toMatchInlineSnapshot({ foo: expect.any(String) }, ``)\n\ts.overwrite(shapeEnd, callEnd, snap);\n\treturn true;\n}\nfunction getObjectShapeEndIndex(code, index) {\n\tlet startBraces = 1;\n\tlet endBraces = 0;\n\twhile (startBraces !== endBraces && index < code.length) {\n\t\tconst s = code[index++];\n\t\tif (s === \"{\") startBraces++;\n\t\telse if (s === \"}\") endBraces++;\n\t}\n\treturn index;\n}\nfunction prepareSnapString(snap, source, index) {\n\tconst lineNumber = offsetToLineNumber(source, index);\n\tconst indent = source.split(lineSplitRE)[lineNumber - 1].match(/^\\s*/)[0] || \"\";\n\tconst indentNext = indent.includes(\"\t\") ? `${indent}\\t` : `${indent}  `;\n\tconst lines = snap.trim().replace(/\\\\/g, \"\\\\\\\\\").split(/\\n/g);\n\tconst isOneline = lines.length <= 1;\n\tconst quote = \"`\";\n\tif (isOneline) return `${quote}${lines.join(\"\\n\").replace(/`/g, \"\\\\`\").replace(/\\$\\{/g, \"\\\\${\")}${quote}`;\n\treturn `${quote}\\n${lines.map((i) => i ? indentNext + i : \"\").join(\"\\n\").replace(/`/g, \"\\\\`\").replace(/\\$\\{/g, \"\\\\${\")}\\n${indent}${quote}`;\n}\nconst defaultMethodNames = [\"toMatchInlineSnapshot\", \"toThrowErrorMatchingInlineSnapshot\"];\n// on webkit, the line number is at the end of the method, not at the start\nfunction getCodeStartingAtIndex(code, index, methodNames) {\n\tfor (const name of methodNames) {\n\t\tconst adjusted = index - name.length;\n\t\tif (adjusted >= 0 && code.slice(adjusted, index) === name) return {\n\t\t\tcode: code.slice(adjusted),\n\t\t\tindex: adjusted\n\t\t};\n\t}\n\treturn {\n\t\tcode: code.slice(index),\n\t\tindex\n\t};\n}\nconst defaultStartRegex = /(?:toMatchInlineSnapshot|toThrowErrorMatchingInlineSnapshot)\\s*\\(\\s*(?:\\/\\*[\\s\\S]*\\*\\/\\s*|\\/\\/.*(?:[\\n\\r\\u2028\\u2029]\\s*|[\\t\\v\\f \\xA0\\u1680\\u2000-\\u200A\\u202F\\u205F\\u3000\\uFEFF]))*[\\w$]*(['\"`)])/;\nconst buildStartRegex = memo((assertionName) => {\n\tconst replaced = defaultStartRegex.source.replace(\"toMatchInlineSnapshot|toThrowErrorMatchingInlineSnapshot\", escapeRegExp(assertionName));\n\treturn new RegExp(replaced);\n});\nfunction replaceInlineSnap(code, s, currentIndex, newSnap, assertionName) {\n\tconst { code: codeStartingAtIndex, index } = getCodeStartingAtIndex(code, currentIndex, assertionName ? [assertionName] : defaultMethodNames);\n\tconst startMatch = (assertionName ? buildStartRegex(assertionName) : defaultStartRegex).exec(codeStartingAtIndex);\n\tconst firstKeywordMatch = (assertionName ? new RegExp(escapeRegExp(assertionName)) : /toMatchInlineSnapshot|toThrowErrorMatchingInlineSnapshot/).exec(codeStartingAtIndex);\n\tif (!startMatch || startMatch.index !== firstKeywordMatch?.index) return replaceObjectSnap(code, s, index, newSnap, assertionName);\n\tconst quote = startMatch[1];\n\tconst startIndex = index + startMatch.index + startMatch[0].length;\n\tconst snapString = prepareSnapString(newSnap, code, index);\n\tif (quote === \")\") {\n\t\ts.appendRight(startIndex - 1, snapString);\n\t\treturn true;\n\t}\n\tconst endMatch = new RegExp(`(?:^|[^\\\\\\\\])${quote}`).exec(code.slice(startIndex));\n\tif (!endMatch) return false;\n\tconst endIndex = startIndex + endMatch.index + endMatch[0].length;\n\ts.overwrite(startIndex - 1, endIndex, snapString);\n\treturn true;\n}\nconst INDENTATION_REGEX = /^([^\\S\\n]*)\\S/m;\nfunction stripSnapshotIndentation(inlineSnapshot) {\n\t// Find indentation if exists.\n\tconst match = inlineSnapshot.match(INDENTATION_REGEX);\n\tif (!match || !match[1])\n // No indentation.\n\treturn inlineSnapshot;\n\tconst indentation = match[1];\n\tconst lines = inlineSnapshot.split(/\\n/g);\n\tif (lines.length <= 2)\n // Must be at least 3 lines.\n\treturn inlineSnapshot;\n\tif (lines[0].trim() !== \"\" || lines.at(-1)?.trim() !== \"\")\n // If not blank first and last lines, abort.\n\treturn inlineSnapshot;\n\tfor (let i = 1; i < lines.length - 1; i++) if (lines[i] !== \"\") {\n\t\tif (lines[i].indexOf(indentation) !== 0)\n // All lines except first and last should either be blank or have the same\n\t\t// indent as the first line (or more). If this isn't the case we don't\n\t\t// want to touch the snapshot at all.\n\t\treturn inlineSnapshot;\n\t\tlines[i] = lines[i].substring(indentation.length);\n\t}\n\t// Last line is a special case because it won't have the same indent as others\n\t// but may still have been given some indent to line up.\n\tlines[lines.length - 1] = \"\";\n\t// Return inline snapshot, now at indent 0.\n\tinlineSnapshot = lines.join(\"\\n\");\n\treturn inlineSnapshot;\n}\n\nasync function saveRawSnapshots(environment, snapshots) {\n\tawait Promise.all(snapshots.map(async (snap) => {\n\t\tif (!snap.readonly) await environment.saveSnapshotFile(snap.file, snap.snapshot);\n\t}));\n}\n\nfunction isSameStackPosition(x, y) {\n\treturn x.file === y.file && x.column === y.column && x.line === y.line;\n}\nclass SnapshotState {\n\ttestFilePath;\n\tsnapshotPath;\n\t_counters = new CounterMap();\n\t_dirty;\n\t_updateSnapshot;\n\t_snapshotData;\n\t_initialData;\n\t_inlineSnapshots;\n\t_inlineSnapshotStacks;\n\t_testIdToKeys = new DefaultMap(() => []);\n\t_rawSnapshots;\n\t_uncheckedKeys;\n\t_snapshotFormat;\n\t_environment;\n\t_fileExists;\n\texpand;\n\t// getter/setter for jest-image-snapshot compat\n\t// https://github.com/vitest-dev/vitest/issues/7322\n\t_added = new CounterMap();\n\t_matched = new CounterMap();\n\t_unmatched = new CounterMap();\n\t_updated = new CounterMap();\n\tget added() {\n\t\treturn this._added;\n\t}\n\tset added(value) {\n\t\tthis._added._total = value;\n\t}\n\tget matched() {\n\t\treturn this._matched;\n\t}\n\tset matched(value) {\n\t\tthis._matched._total = value;\n\t}\n\tget unmatched() {\n\t\treturn this._unmatched;\n\t}\n\tset unmatched(value) {\n\t\tthis._unmatched._total = value;\n\t}\n\tget updated() {\n\t\treturn this._updated;\n\t}\n\tset updated(value) {\n\t\tthis._updated._total = value;\n\t}\n\tconstructor(testFilePath, snapshotPath, fileData, options) {\n\t\tthis.testFilePath = testFilePath;\n\t\tthis.snapshotPath = snapshotPath;\n\t\tconst data = fileData ?? Object.create(null);\n\t\tthis._fileExists = fileData != null;\n\t\tconst update = options.updateSnapshot;\n\t\tconst dirty = (update === \"all\" || update === \"new\") && fileData != null;\n\t\tthis._initialData = { ...data };\n\t\tthis._snapshotData = { ...data };\n\t\tthis._dirty = dirty;\n\t\tthis._inlineSnapshots = [];\n\t\tthis._inlineSnapshotStacks = [];\n\t\tthis._rawSnapshots = [];\n\t\tthis._uncheckedKeys = new Set(Object.keys(this._snapshotData));\n\t\tthis.expand = options.expand || false;\n\t\tthis._updateSnapshot = options.updateSnapshot;\n\t\tthis._snapshotFormat = {\n\t\t\tprintBasicPrototype: false,\n\t\t\tescapeString: false,\n\t\t\t// more generous safety cap 128MB (same as Node's util.inspect)\n\t\t\t// instead of tighter pretty-format default 1MB\n\t\t\t// since users can purposely save large snapshot to a dedicated file.\n\t\t\tmaxOutputLength: 2 ** 27,\n\t\t\t...options.snapshotFormat\n\t\t};\n\t\tthis._environment = options.snapshotEnvironment;\n\t}\n\tstatic async create(testFilePath, options) {\n\t\tconst environment = options.snapshotEnvironment;\n\t\tconst snapshotPath = await environment.resolvePath(testFilePath);\n\t\tlet fileData;\n\t\tif (environment.readSnapshotFileData) fileData = await environment.readSnapshotFileData(snapshotPath);\n\t\telse {\n\t\t\tconst content = await environment.readSnapshotFile(snapshotPath);\n\t\t\tfileData = content != null ? evaluateSnapshotFile(snapshotPath, content) : null;\n\t\t}\n\t\treturn new SnapshotState(testFilePath, snapshotPath, fileData, options);\n\t}\n\tget snapshotUpdateState() {\n\t\treturn this._updateSnapshot;\n\t}\n\tget environment() {\n\t\treturn this._environment;\n\t}\n\tmarkSnapshotsAsCheckedForTest(testName) {\n\t\tthis._uncheckedKeys.forEach((uncheckedKey) => {\n\t\t\t// skip snapshots with following keys\n\t\t\t//   testName n\n\t\t\t//   testName > xxx n (this is for toMatchSnapshot(\"xxx\") API)\n\t\t\tif (uncheckedKey.startsWith(testName) && /^ \\d+$|^ > /.test(uncheckedKey.slice(testName.length))) this._uncheckedKeys.delete(uncheckedKey);\n\t\t});\n\t}\n\tclearTest(testId) {\n\t\t// clear inline\n\t\tthis._inlineSnapshots = this._inlineSnapshots.filter((s) => s.testId !== testId);\n\t\tthis._inlineSnapshotStacks = this._inlineSnapshotStacks.filter((s) => s.testId !== testId);\n\t\t// clear file\n\t\tfor (const key of this._testIdToKeys.get(testId)) {\n\t\t\tconst name = keyToTestName(key);\n\t\t\tconst count = this._counters.get(name);\n\t\t\tif (count > 0) {\n\t\t\t\tif (key in this._snapshotData || key in this._initialData) this._snapshotData[key] = this._initialData[key];\n\t\t\t\tthis._counters.set(name, count - 1);\n\t\t\t}\n\t\t}\n\t\tthis._testIdToKeys.delete(testId);\n\t\t// clear stats\n\t\tthis.added.delete(testId);\n\t\tthis.updated.delete(testId);\n\t\tthis.matched.delete(testId);\n\t\tthis.unmatched.delete(testId);\n\t}\n\t_inferInlineSnapshotStack(stacks) {\n\t\t// if called inside resolves/rejects, stacktrace is different\n\t\tconst promiseIndex = stacks.findIndex((i) => i.method.match(/__VITEST_(RESOLVES|REJECTS)__/));\n\t\tif (promiseIndex !== -1) return stacks[promiseIndex + 3];\n\t\t// support poll + inline snapshot\n\t\tconst pollChainIndex = stacks.findIndex((i) => i.method.match(/__VITEST_POLL_CHAIN__/));\n\t\tif (pollChainIndex !== -1) return stacks[pollChainIndex + 1];\n\t\t// inline snapshot function can be named __INLINE_SNAPSHOT_OFFSET_<n>__\n\t\t// to specify a custom stack offset\n\t\tfor (let i = 0; i < stacks.length; i++) {\n\t\t\tconst match = stacks[i].method.match(/__INLINE_SNAPSHOT_OFFSET_(\\d+)__/);\n\t\t\tif (match) return stacks[i + Number(match[1])] ?? null;\n\t\t}\n\t\t// custom matcher registered via expect.extend() — the wrapper function\n\t\t// in jest-extend.ts is named __VITEST_EXTEND_ASSERTION__\n\t\tconst customMatcherIndex = stacks.findIndex((i) => i.method.includes(\"__VITEST_EXTEND_ASSERTION__\"));\n\t\tif (customMatcherIndex !== -1) return stacks[customMatcherIndex + 3] ?? null;\n\t\t// inline snapshot function is called __INLINE_SNAPSHOT__\n\t\t// in integrations/snapshot/chai.ts\n\t\tconst stackIndex = stacks.findIndex((i) => i.method.includes(\"__INLINE_SNAPSHOT__\"));\n\t\treturn stackIndex !== -1 ? stacks[stackIndex + 2] : null;\n\t}\n\t_addSnapshot(key, receivedSerialized, options) {\n\t\tthis._dirty = true;\n\t\tif (options.stack) this._inlineSnapshots.push({\n\t\t\t...options.stack,\n\t\t\tsnapshot: receivedSerialized,\n\t\t\ttestId: options.testId,\n\t\t\tassertionName: options.assertionName\n\t\t});\n\t\telse if (options.rawSnapshot) this._rawSnapshots.push({\n\t\t\t...options.rawSnapshot,\n\t\t\tsnapshot: receivedSerialized\n\t\t});\n\t\telse this._snapshotData[key] = receivedSerialized;\n\t}\n\t_resolveKey(testId, testName, key) {\n\t\tthis._counters.increment(testName);\n\t\tconst count = this._counters.get(testName);\n\t\tif (!key) key = testNameToKey(testName, count);\n\t\tthis._testIdToKeys.get(testId).push(key);\n\t\treturn {\n\t\t\tkey,\n\t\t\tcount\n\t\t};\n\t}\n\t_resolveInlineStack(options) {\n\t\tconst { testId, snapshot, assertionName, error } = options;\n\t\tconst stacks = parseErrorStacktrace(error, { ignoreStackEntries: [] });\n\t\tconst _stack = this._inferInlineSnapshotStack(stacks);\n\t\tif (!_stack) {\n\t\t\tconst message = stacks.map((s) => `  ${s.file}:${s.line}:${s.column}${s.method ? ` (${s.method})` : \"\"}`).join(\"\\n\");\n\t\t\tthrow new Error(`@vitest/snapshot: Couldn't infer stack frame for inline snapshot.\\n${message}`);\n\t\t}\n\t\tconst stack = this.environment.processStackTrace?.(_stack) || _stack;\n\t\t// removing 1 column, because source map points to the wrong\n\t\t// location for js files, but `column-1` points to the same in both js/ts\n\t\t// https://github.com/vitejs/vite/issues/8657\n\t\tstack.column--;\n\t\t// reject multiple inline snapshots at the same location if snapshot is different\n\t\tconst snapshotsWithSameStack = this._inlineSnapshotStacks.filter((s) => isSameStackPosition(s, stack));\n\t\tif (snapshotsWithSameStack.length > 0) {\n\t\t\t// ensure only one snapshot will be written at the same location\n\t\t\tthis._inlineSnapshots = this._inlineSnapshots.filter((s) => !isSameStackPosition(s, stack));\n\t\t\tconst differentSnapshot = snapshotsWithSameStack.find((s) => s.snapshot !== snapshot);\n\t\t\tif (differentSnapshot) throw Object.assign(/* @__PURE__ */ new Error(`${assertionName} with different snapshots cannot be called at the same location`), {\n\t\t\t\tactual: snapshot,\n\t\t\t\texpected: differentSnapshot.snapshot\n\t\t\t});\n\t\t}\n\t\tthis._inlineSnapshotStacks.push({\n\t\t\t...stack,\n\t\t\ttestId,\n\t\t\tsnapshot\n\t\t});\n\t\treturn stack;\n\t}\n\t_reconcile(opts) {\n\t\t// These are the conditions on when to write snapshots:\n\t\t//  * There's no snapshot file in a non-CI environment.\n\t\t//  * There is a snapshot file and we decided to update the snapshot.\n\t\t//  * There is a snapshot file, but it doesn't have this snapshot.\n\t\t// These are the conditions on when not to write snapshots:\n\t\t//  * The update flag is set to 'none'.\n\t\t//  * There's no snapshot file or a file without this snapshot on a CI environment.\n\t\tif (opts.hasSnapshot && this._updateSnapshot === \"all\" || (!opts.hasSnapshot || !opts.snapshotIsPersisted) && (this._updateSnapshot === \"new\" || this._updateSnapshot === \"all\")) {\n\t\t\tif (this._updateSnapshot === \"all\") if (!opts.pass) {\n\t\t\t\tif (opts.hasSnapshot) this.updated.increment(opts.testId);\n\t\t\t\telse this.added.increment(opts.testId);\n\t\t\t\tthis._addSnapshot(opts.key, opts.addValue, {\n\t\t\t\t\tstack: opts.stack,\n\t\t\t\t\ttestId: opts.testId,\n\t\t\t\t\trawSnapshot: opts.rawSnapshot,\n\t\t\t\t\tassertionName: opts.assertionName\n\t\t\t\t});\n\t\t\t} else this.matched.increment(opts.testId);\n\t\t\telse {\n\t\t\t\tthis._addSnapshot(opts.key, opts.addValue, {\n\t\t\t\t\tstack: opts.stack,\n\t\t\t\t\ttestId: opts.testId,\n\t\t\t\t\trawSnapshot: opts.rawSnapshot,\n\t\t\t\t\tassertionName: opts.assertionName\n\t\t\t\t});\n\t\t\t\tthis.added.increment(opts.testId);\n\t\t\t}\n\t\t\treturn {\n\t\t\t\tactual: \"\",\n\t\t\t\tcount: opts.count,\n\t\t\t\texpected: \"\",\n\t\t\t\tkey: opts.key,\n\t\t\t\tpass: true\n\t\t\t};\n\t\t} else if (!opts.pass) {\n\t\t\tthis.unmatched.increment(opts.testId);\n\t\t\treturn {\n\t\t\t\tactual: opts.actualDisplay,\n\t\t\t\tcount: opts.count,\n\t\t\t\texpected: opts.expectedDisplay,\n\t\t\t\tkey: opts.key,\n\t\t\t\tpass: false\n\t\t\t};\n\t\t} else {\n\t\t\tthis.matched.increment(opts.testId);\n\t\t\treturn {\n\t\t\t\tactual: \"\",\n\t\t\t\tcount: opts.count,\n\t\t\t\texpected: \"\",\n\t\t\t\tkey: opts.key,\n\t\t\t\tpass: true\n\t\t\t};\n\t\t}\n\t}\n\tasync save() {\n\t\tconst hasExternalSnapshots = Object.keys(this._snapshotData).length;\n\t\tconst hasInlineSnapshots = this._inlineSnapshots.length;\n\t\tconst hasRawSnapshots = this._rawSnapshots.length;\n\t\tconst isEmpty = !hasExternalSnapshots && !hasInlineSnapshots && !hasRawSnapshots;\n\t\tconst status = {\n\t\t\tdeleted: false,\n\t\t\tsaved: false\n\t\t};\n\t\tif ((this._dirty || this._uncheckedKeys.size) && !isEmpty) {\n\t\t\tif (hasExternalSnapshots) {\n\t\t\t\tawait saveSnapshotFile(this._environment, this._snapshotData, this.snapshotPath);\n\t\t\t\tthis._fileExists = true;\n\t\t\t}\n\t\t\tif (hasInlineSnapshots) await saveInlineSnapshots(this._environment, this._inlineSnapshots);\n\t\t\tif (hasRawSnapshots) await saveRawSnapshots(this._environment, this._rawSnapshots);\n\t\t\tstatus.saved = true;\n\t\t} else if (!hasExternalSnapshots && this._fileExists) {\n\t\t\tif (this._updateSnapshot === \"all\") {\n\t\t\t\tawait this._environment.removeSnapshotFile(this.snapshotPath);\n\t\t\t\tthis._fileExists = false;\n\t\t\t}\n\t\t\tstatus.deleted = true;\n\t\t}\n\t\treturn status;\n\t}\n\tgetUncheckedCount() {\n\t\treturn this._uncheckedKeys.size || 0;\n\t}\n\tgetUncheckedKeys() {\n\t\treturn Array.from(this._uncheckedKeys);\n\t}\n\tremoveUncheckedKeys() {\n\t\tif (this._updateSnapshot === \"all\" && this._uncheckedKeys.size) {\n\t\t\tthis._dirty = true;\n\t\t\tthis._uncheckedKeys.forEach((key) => delete this._snapshotData[key]);\n\t\t\tthis._uncheckedKeys.clear();\n\t\t}\n\t}\n\tprobeExpectedSnapshot(options) {\n\t\tconst count = this._counters.get(options.testName) + 1;\n\t\tconst key = testNameToKey(options.testName, count);\n\t\treturn {\n\t\t\tkey,\n\t\t\tcount,\n\t\t\tdata: options?.isInline ? options.inlineSnapshot : this._snapshotData[key],\n\t\t\tmarkAsChecked: () => {\n\t\t\t\tthis._counters.increment(options.testName);\n\t\t\t\tthis._testIdToKeys.get(options.testId).push(key);\n\t\t\t\tthis._uncheckedKeys.delete(key);\n\t\t\t}\n\t\t};\n\t}\n\tmatch({ testId, testName, received, key, inlineSnapshot, isInline, error, rawSnapshot, assertionName }) {\n\t\tconst resolved = this._resolveKey(testId, testName, key);\n\t\tkey = resolved.key;\n\t\tconst count = resolved.count;\n\t\t// Do not mark the snapshot as \"checked\" if the snapshot is inline and\n\t\t// there's an external snapshot. This way the external snapshot can be\n\t\t// removed with `--updateSnapshot`.\n\t\tif (!(isInline && this._snapshotData[key] !== void 0)) this._uncheckedKeys.delete(key);\n\t\tlet receivedSerialized = rawSnapshot && typeof received === \"string\" ? received : serialize(received, void 0, this._snapshotFormat);\n\t\tif (!rawSnapshot) receivedSerialized = addExtraLineBreaks(receivedSerialized);\n\t\tif (rawSnapshot) {\n\t\t\t// normalize EOL when snapshot contains CRLF but received is LF\n\t\t\tif (rawSnapshot.content && /\\r\\n/.test(rawSnapshot.content) && !/\\r\\n/.test(receivedSerialized)) rawSnapshot.content = normalizeNewlines(rawSnapshot.content);\n\t\t}\n\t\tconst expected = isInline ? inlineSnapshot : rawSnapshot ? rawSnapshot.content : this._snapshotData[key];\n\t\tconst expectedTrimmed = rawSnapshot ? expected : expected?.trim();\n\t\tconst pass = expectedTrimmed === (rawSnapshot ? receivedSerialized : receivedSerialized.trim());\n\t\tconst hasSnapshot = expected !== void 0;\n\t\tconst snapshotIsPersisted = isInline || this._fileExists || rawSnapshot && rawSnapshot.content != null;\n\t\tif (pass && !isInline && !rawSnapshot)\n // When the file is re-saved (because other snapshots changed), the JS\n\t\t// round-trip can lose proper escaping. Refresh in-memory data with the\n\t\t// freshly serialized string so the file is written correctly.\n\t\t// _reconcile does not write _snapshotData on pass, so this is the only\n\t\t// place it gets refreshed. Domain snapshots skip this because the stored\n\t\t// value may contain match patterns that differ from the received output.\n\t\tthis._snapshotData[key] = receivedSerialized;\n\t\tconst stack = isInline ? this._resolveInlineStack({\n\t\t\ttestId,\n\t\t\tsnapshot: receivedSerialized,\n\t\t\tassertionName: assertionName || \"toMatchInlineSnapshot\",\n\t\t\terror: error || /* @__PURE__ */ new Error(\"snapshot\")\n\t\t}) : void 0;\n\t\treturn this._reconcile({\n\t\t\ttestId,\n\t\t\tkey,\n\t\t\tcount,\n\t\t\tpass,\n\t\t\thasSnapshot,\n\t\t\tsnapshotIsPersisted: !!snapshotIsPersisted,\n\t\t\taddValue: receivedSerialized,\n\t\t\tactualDisplay: rawSnapshot ? receivedSerialized : removeExtraLineBreaks(receivedSerialized),\n\t\t\texpectedDisplay: expectedTrimmed !== void 0 ? rawSnapshot ? expectedTrimmed : removeExtraLineBreaks(expectedTrimmed) : void 0,\n\t\t\tstack,\n\t\t\trawSnapshot,\n\t\t\tassertionName\n\t\t});\n\t}\n\tprocessDomainSnapshot({ testId, received, expectedSnapshot, matchResult, isInline, error, assertionName }) {\n\t\tconst stack = isInline ? this._resolveInlineStack({\n\t\t\ttestId,\n\t\t\tsnapshot: received,\n\t\t\tassertionName,\n\t\t\terror: error || /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\")\n\t\t}) : void 0;\n\t\tconst actualResolved = matchResult?.resolved ?? received;\n\t\tconst expectedResolved = matchResult?.expected ?? expectedSnapshot.data;\n\t\treturn this._reconcile({\n\t\t\ttestId,\n\t\t\tkey: expectedSnapshot.key,\n\t\t\tcount: expectedSnapshot.count,\n\t\t\tpass: matchResult?.pass ?? false,\n\t\t\thasSnapshot: expectedSnapshot.data !== void 0,\n\t\t\tsnapshotIsPersisted: isInline ? true : this._fileExists,\n\t\t\taddValue: actualResolved,\n\t\t\tactualDisplay: removeExtraLineBreaks(actualResolved),\n\t\t\texpectedDisplay: expectedResolved !== void 0 ? removeExtraLineBreaks(expectedResolved) : void 0,\n\t\t\tstack,\n\t\t\tassertionName\n\t\t});\n\t}\n\tasync pack() {\n\t\tconst snapshot = {\n\t\t\tfilepath: this.testFilePath,\n\t\t\tadded: 0,\n\t\t\tfileDeleted: false,\n\t\t\tmatched: 0,\n\t\t\tunchecked: 0,\n\t\t\tuncheckedKeys: [],\n\t\t\tunmatched: 0,\n\t\t\tupdated: 0\n\t\t};\n\t\tconst uncheckedCount = this.getUncheckedCount();\n\t\tconst uncheckedKeys = this.getUncheckedKeys();\n\t\tif (uncheckedCount) this.removeUncheckedKeys();\n\t\tconst status = await this.save();\n\t\tsnapshot.fileDeleted = status.deleted;\n\t\tsnapshot.added = this.added.total();\n\t\tsnapshot.matched = this.matched.total();\n\t\tsnapshot.unmatched = this.unmatched.total();\n\t\tsnapshot.updated = this.updated.total();\n\t\tsnapshot.unchecked = !status.deleted ? uncheckedCount : 0;\n\t\tsnapshot.uncheckedKeys = Array.from(uncheckedKeys);\n\t\treturn snapshot;\n\t}\n}\n\nfunction createMismatchError(message, expand, actual, expected) {\n\tconst error = new Error(message);\n\tObject.defineProperty(error, \"actual\", {\n\t\tvalue: actual,\n\t\tenumerable: true,\n\t\tconfigurable: true,\n\t\twritable: true\n\t});\n\tObject.defineProperty(error, \"expected\", {\n\t\tvalue: expected,\n\t\tenumerable: true,\n\t\tconfigurable: true,\n\t\twritable: true\n\t});\n\tObject.defineProperty(error, \"diffOptions\", { value: { expand } });\n\treturn error;\n}\nclass SnapshotClient {\n\toptions;\n\tsnapshotStateMap = /* @__PURE__ */ new Map();\n\tconstructor(options = {}) {\n\t\tthis.options = options;\n\t}\n\tasync setup(filepath, options) {\n\t\tif (this.snapshotStateMap.has(filepath)) return;\n\t\tthis.snapshotStateMap.set(filepath, await SnapshotState.create(filepath, options));\n\t}\n\tasync finish(filepath) {\n\t\tconst result = await this.getSnapshotState(filepath).pack();\n\t\tthis.snapshotStateMap.delete(filepath);\n\t\treturn result;\n\t}\n\tskipTest(filepath, testName) {\n\t\tthis.getSnapshotState(filepath).markSnapshotsAsCheckedForTest(testName);\n\t}\n\tclearTest(filepath, testId) {\n\t\tthis.getSnapshotState(filepath).clearTest(testId);\n\t}\n\tgetSnapshotState(filepath) {\n\t\tconst state = this.snapshotStateMap.get(filepath);\n\t\tif (!state) throw new Error(`The snapshot state for '${filepath}' is not found. Did you call 'SnapshotClient.setup()'?`);\n\t\treturn state;\n\t}\n\tmatch(options) {\n\t\tconst { filepath, name, testId = name, message, isInline = false, properties, inlineSnapshot, error, errorMessage, rawSnapshot, assertionName } = options;\n\t\tlet { received } = options;\n\t\tif (!filepath) throw new Error(\"Snapshot cannot be used outside of test\");\n\t\tconst snapshotState = this.getSnapshotState(filepath);\n\t\tif (rawSnapshot?.file === snapshotState.snapshotPath)\n // note that this hard rejection is best-effort in a sense that,\n\t\t// if `toMatchFileSnapshot` is called with a different test file's snapshot path,\n\t\t// this check will not catch it.\n\t\tthrow new Error(`File snapshot cannot use the same path as the test snapshot file: ${rawSnapshot.file}`);\n\t\tconst testName = [name, ...message ? [message] : []].join(\" > \");\n\t\t// Probe first so we can mark as checked even on early return\n\t\tconst expectedSnapshot = snapshotState.probeExpectedSnapshot({\n\t\t\ttestName,\n\t\t\ttestId,\n\t\t\tisInline,\n\t\t\tinlineSnapshot\n\t\t});\n\t\tif (typeof properties === \"object\") {\n\t\t\tif (typeof received !== \"object\" || !received) {\n\t\t\t\texpectedSnapshot.markAsChecked();\n\t\t\t\tthrow new Error(\"Received value must be an object when the matcher has properties\");\n\t\t\t}\n\t\t\tlet propertiesPass;\n\t\t\ttry {\n\t\t\t\tpropertiesPass = this.options.isEqual?.(received, properties) ?? false;\n\t\t\t} catch (err) {\n\t\t\t\texpectedSnapshot.markAsChecked();\n\t\t\t\tthrow err;\n\t\t\t}\n\t\t\tif (!propertiesPass) {\n\t\t\t\texpectedSnapshot.markAsChecked();\n\t\t\t\treturn {\n\t\t\t\t\tpass: false,\n\t\t\t\t\tmessage: () => errorMessage || \"Snapshot properties mismatched\",\n\t\t\t\t\tactual: received,\n\t\t\t\t\texpected: properties\n\t\t\t\t};\n\t\t\t}\n\t\t\treceived = deepMergeSnapshot(received, properties);\n\t\t}\n\t\tconst { actual, expected, key, pass } = snapshotState.match({\n\t\t\ttestId,\n\t\t\ttestName,\n\t\t\treceived,\n\t\t\tisInline,\n\t\t\terror,\n\t\t\tinlineSnapshot,\n\t\t\trawSnapshot,\n\t\t\tassertionName\n\t\t});\n\t\treturn {\n\t\t\tpass,\n\t\t\tmessage: () => `Snapshot \\`${key || \"unknown\"}\\` mismatched`,\n\t\t\tactual: rawSnapshot ? actual : actual?.trim(),\n\t\t\texpected: rawSnapshot ? expected : expected?.trim()\n\t\t};\n\t}\n\tassert(options) {\n\t\tconst result = this.match(options);\n\t\tif (!result.pass) {\n\t\t\tconst snapshotState = this.getSnapshotState(options.filepath);\n\t\t\tthrow createMismatchError(result.message(), snapshotState.expand, result.actual, result.expected);\n\t\t}\n\t}\n\tmatchDomain(options) {\n\t\tconst { received, filepath, name, testId = name, message, adapter, isInline = false, inlineSnapshot, error } = options;\n\t\tif (!filepath) throw new Error(\"Snapshot cannot be used outside of test\");\n\t\tconst captured = adapter.capture(received);\n\t\tconst rendered = adapter.render(captured);\n\t\tconst snapshotState = this.getSnapshotState(filepath);\n\t\tconst testName = [name, ...message ? [message] : []].join(\" > \");\n\t\tconst expectedSnapshot = snapshotState.probeExpectedSnapshot({\n\t\t\ttestName,\n\t\t\ttestId,\n\t\t\tisInline,\n\t\t\tinlineSnapshot\n\t\t});\n\t\texpectedSnapshot.markAsChecked();\n\t\tconst matchResult = expectedSnapshot.data !== void 0 ? adapter.match(captured, adapter.parseExpected(expectedSnapshot.data)) : void 0;\n\t\tconst { actual, expected, key, pass } = snapshotState.processDomainSnapshot({\n\t\t\ttestId,\n\t\t\treceived: rendered,\n\t\t\texpectedSnapshot,\n\t\t\tmatchResult,\n\t\t\tisInline,\n\t\t\terror,\n\t\t\tassertionName: options.assertionName\n\t\t});\n\t\treturn {\n\t\t\tpass,\n\t\t\tmessage: () => `Snapshot \\`${key}\\` mismatched`,\n\t\t\tactual: actual?.trim(),\n\t\t\texpected: expected?.trim()\n\t\t};\n\t}\n\tasync pollMatchDomain(options) {\n\t\tconst { poll, filepath, name, testId = name, message, adapter, isInline = false, inlineSnapshot, error, timeout = 1e3, interval = 50 } = options;\n\t\tif (!filepath) throw new Error(\"Snapshot cannot be used outside of test\");\n\t\tconst snapshotState = this.getSnapshotState(filepath);\n\t\tconst testName = [name, ...message ? [message] : []].join(\" > \");\n\t\tconst expectedSnapshot = snapshotState.probeExpectedSnapshot({\n\t\t\ttestName,\n\t\t\ttestId,\n\t\t\tisInline,\n\t\t\tinlineSnapshot\n\t\t});\n\t\tconst reference = expectedSnapshot.data !== void 0 && snapshotState.snapshotUpdateState !== \"all\" ? adapter.parseExpected(expectedSnapshot.data) : void 0;\n\t\tconst timeoutController = new AbortController();\n\t\tconst stableResult = await getStableSnapshot({\n\t\t\tadapter,\n\t\t\tpoll: () => poll({ signal: timeoutController.signal }),\n\t\t\tinterval,\n\t\t\ttimedOut: timeout > 0 ? new Promise((r) => setTimeout(() => {\n\t\t\t\ttimeoutController.abort();\n\t\t\t\tr();\n\t\t\t}, timeout)) : void 0,\n\t\t\tmatch: reference ? (captured) => adapter.match(captured, reference).pass : void 0\n\t\t});\n\t\texpectedSnapshot.markAsChecked();\n\t\tif (stableResult?.rendered === void 0) {\n\t\t\t// the original caller `expect.poll` later manipulates error via `throwWithCause`,\n\t\t\t// so here we can directly throw `lastPollError` if exists.\n\t\t\tif (stableResult?.lastPollError) throw stableResult.lastPollError;\n\t\t\treturn {\n\t\t\t\tpass: false,\n\t\t\t\tmessage: () => `poll() did not produce a stable snapshot within the timeout`\n\t\t\t};\n\t\t}\n\t\t// TODO: should `all` mode ignore parse error?\n\t\t// Silently hiding the error and creating snapshot full scratch isn't good either.\n\t\t// Users can fix or purge the broken snapshot manually and that decision affects how domain snapshot gets updated.\n\t\tconst matchResult = expectedSnapshot.data !== void 0 ? adapter.match(stableResult.captured, adapter.parseExpected(expectedSnapshot.data)) : void 0;\n\t\tconst { actual, expected, key, pass } = snapshotState.processDomainSnapshot({\n\t\t\ttestId,\n\t\t\treceived: stableResult.rendered,\n\t\t\texpectedSnapshot,\n\t\t\tmatchResult,\n\t\t\tisInline,\n\t\t\terror,\n\t\t\tassertionName: options.assertionName\n\t\t});\n\t\treturn {\n\t\t\tpass,\n\t\t\tmessage: () => `Snapshot \\`${key}\\` mismatched`,\n\t\t\tactual: actual?.trim(),\n\t\t\texpected: expected?.trim()\n\t\t};\n\t}\n\tasync assertRaw(options) {\n\t\tif (!options.rawSnapshot) throw new Error(\"Raw snapshot is required\");\n\t\tconst { filepath, rawSnapshot } = options;\n\t\tif (rawSnapshot.content == null) {\n\t\t\tif (!filepath) throw new Error(\"Snapshot cannot be used outside of test\");\n\t\t\tconst snapshotState = this.getSnapshotState(filepath);\n\t\t\t// save the filepath, so it don't lose even if the await make it out-of-context\n\t\t\toptions.filepath ||= filepath;\n\t\t\t// resolve and read the raw snapshot file\n\t\t\trawSnapshot.file = await snapshotState.environment.resolveRawPath(filepath, rawSnapshot.file);\n\t\t\trawSnapshot.content = await snapshotState.environment.readSnapshotFile(rawSnapshot.file) ?? void 0;\n\t\t}\n\t\treturn this.assert(options);\n\t}\n\tclear() {\n\t\tthis.snapshotStateMap.clear();\n\t}\n}\n/**\n* Polls repeatedly until the value reaches a stable state.\n*\n* Compares consecutive rendered outputs from the current session —\n* when two consecutive polls produce the same rendered string,\n* the value is considered stable.\n*\n* Every `await` (poll call, interval delay) races against `timedOut`\n* so that hanging polls and delays are interrupted.\n*/\nasync function getStableSnapshot({ adapter, poll, interval, timedOut, match }) {\n\tlet lastRendered;\n\tlet lastPollError;\n\tlet lastStable;\n\twhile (true) {\n\t\ttry {\n\t\t\tconst pollResult = await raceWith$1(Promise.resolve(poll()), timedOut);\n\t\t\tif (!pollResult.ok) break;\n\t\t\tconst captured = adapter.capture(pollResult.value);\n\t\t\tconst rendered = adapter.render(captured);\n\t\t\tif (lastRendered !== void 0 && rendered === lastRendered) {\n\t\t\t\tlastStable = {\n\t\t\t\t\tcaptured,\n\t\t\t\t\trendered\n\t\t\t\t};\n\t\t\t\tif (!match || match(captured)) break;\n\t\t\t} else {\n\t\t\t\tlastRendered = rendered;\n\t\t\t\tlastStable = void 0;\n\t\t\t}\n\t\t} catch (pollError) {\n\t\t\t// poll() threw — reset stability baseline and retry\n\t\t\tlastRendered = void 0;\n\t\t\tlastStable = void 0;\n\t\t\tlastPollError = pollError;\n\t\t}\n\t\tif (!(await raceWith$1(new Promise((r) => setTimeout(r, interval)), timedOut)).ok) break;\n\t}\n\treturn {\n\t\t...lastStable,\n\t\tlastPollError\n\t};\n}\n/** Type-safe `Promise.race` — tells you which promise won. */\nfunction raceWith$1(promise, other) {\n\tconst left = promise.then((value) => ({\n\t\tok: true,\n\t\tvalue\n\t}));\n\tif (!other) return left;\n\treturn Promise.race([left, other.then((value) => ({\n\t\tok: false,\n\t\tvalue\n\t}))]);\n}\n\nconst ChaiStyleAssertions = (chai, utils) => {\n\tfunction defProperty(name, delegateTo) {\n\t\tutils.addProperty(chai.Assertion.prototype, name, function() {\n\t\t\tconst jestMethod = chai.Assertion.prototype[delegateTo];\n\t\t\tif (!jestMethod) throw new Error(`Cannot delegate to ${String(delegateTo)}: method not found. Ensure JestChaiExpect plugin is loaded first.`);\n\t\t\treturn jestMethod.call(this);\n\t\t});\n\t}\n\tfunction defPropertyWithArgs(name, delegateTo, ...args) {\n\t\tutils.addProperty(chai.Assertion.prototype, name, function() {\n\t\t\tconst jestMethod = chai.Assertion.prototype[delegateTo];\n\t\t\tif (!jestMethod) throw new Error(`Cannot delegate to ${String(delegateTo)}: method not found. Ensure JestChaiExpect plugin is loaded first.`);\n\t\t\treturn jestMethod.call(this, ...args);\n\t\t});\n\t}\n\tfunction defMethod(name, delegateTo) {\n\t\tutils.addMethod(chai.Assertion.prototype, name, function(...args) {\n\t\t\tconst jestMethod = chai.Assertion.prototype[delegateTo];\n\t\t\tif (!jestMethod) throw new Error(`Cannot delegate to ${String(delegateTo)}: method not found. Ensure JestChaiExpect plugin is loaded first.`);\n\t\t\treturn jestMethod.call(this, ...args);\n\t\t});\n\t}\n\t// API to (somewhat) mirror sinon-chai\n\t// https://github.com/chaijs/sinon-chai\n\tdefProperty(\"called\", \"toHaveBeenCalled\");\n\tdefProperty(\"calledOnce\", \"toHaveBeenCalledOnce\");\n\tdefPropertyWithArgs(\"calledTwice\", \"toHaveBeenCalledTimes\", 2);\n\tdefPropertyWithArgs(\"calledThrice\", \"toHaveBeenCalledTimes\", 3);\n\tdefMethod(\"callCount\", \"toHaveBeenCalledTimes\");\n\tdefMethod(\"calledWith\", \"toHaveBeenCalledWith\");\n\tdefMethod(\"calledOnceWith\", \"toHaveBeenCalledExactlyOnceWith\");\n\tdefMethod(\"lastCalledWith\", \"toHaveBeenLastCalledWith\");\n\tdefMethod(\"nthCalledWith\", \"toHaveBeenNthCalledWith\");\n\tdefMethod(\"returned\", \"toHaveReturned\");\n\tdefMethod(\"returnedWith\", \"toHaveReturnedWith\");\n\tdefMethod(\"returnedTimes\", \"toHaveReturnedTimes\");\n\tdefMethod(\"lastReturnedWith\", \"toHaveLastReturnedWith\");\n\tdefMethod(\"nthReturnedWith\", \"toHaveNthReturnedWith\");\n\tdefMethod(\"calledBefore\", \"toHaveBeenCalledBefore\");\n\tdefMethod(\"calledAfter\", \"toHaveBeenCalledAfter\");\n\t// TODO: implement\n\t// defMethod('thrown', 'toHaveThrown')\n};\n\nconst MATCHERS_OBJECT = Symbol.for(\"matchers-object\");\nconst JEST_MATCHERS_OBJECT = Symbol.for(\"$$jest-matchers-object\");\nconst GLOBAL_EXPECT = Symbol.for(\"expect-global\");\nconst ASYMMETRIC_MATCHERS_OBJECT = Symbol.for(\"asymmetric-matchers-object\");\n\n// selectively ported from https://github.com/jest-community/jest-extended\nconst customMatchers = {\n\ttoSatisfy(actual, expected, message) {\n\t\tconst { printReceived, printExpected, matcherHint } = this.utils;\n\t\tconst pass = expected(actual);\n\t\treturn {\n\t\t\tpass,\n\t\t\tmessage: () => pass ? `\\\n${matcherHint(\".not.toSatisfy\", \"received\", \"\")}\n\nExpected value to not satisfy:\n${message || printExpected(expected)}\nReceived:\n${printReceived(actual)}` : `\\\n${matcherHint(\".toSatisfy\", \"received\", \"\")}\n\nExpected value to satisfy:\n${message || printExpected(expected)}\n\nReceived:\n${printReceived(actual)}`\n\t\t};\n\t},\n\ttoBeOneOf(actual, expected) {\n\t\tconst { equals, customTesters } = this;\n\t\tconst { printReceived, printExpected, matcherHint } = this.utils;\n\t\tlet pass;\n\t\tif (Array.isArray(expected)) pass = expected.length === 0 || expected.some((item) => equals(item, actual, customTesters));\n\t\telse if (expected instanceof Set) pass = expected.size === 0 || expected.has(actual) || [...expected].some((item) => equals(item, actual, customTesters));\n\t\telse throw new TypeError(`You must provide an array or set to ${matcherHint(\".toBeOneOf\")}, not '${typeof expected}'.`);\n\t\treturn {\n\t\t\tpass,\n\t\t\tmessage: () => pass ? `\\\n${matcherHint(\".not.toBeOneOf\", \"received\", \"\")}\n\nExpected value to not be one of:\n${printExpected(expected)}\nReceived:\n${printReceived(actual)}` : `\\\n${matcherHint(\".toBeOneOf\", \"received\", \"\")}\n\nExpected value to be one of:\n${printExpected(expected)}\n\nReceived:\n${printReceived(actual)}`\n\t\t};\n\t}\n};\n\nconst EXPECTED_COLOR = y.green;\nconst RECEIVED_COLOR = y.red;\nconst INVERTED_COLOR = y.inverse;\nconst BOLD_WEIGHT = y.bold;\nconst DIM_COLOR = y.dim;\nfunction matcherHint(matcherName, received = \"received\", expected = \"expected\", options = {}) {\n\tconst { comment = \"\", isDirectExpectCall = false, isNot = false, promise = \"\", secondArgument = \"\", expectedColor = EXPECTED_COLOR, receivedColor = RECEIVED_COLOR, secondArgumentColor = EXPECTED_COLOR } = options;\n\tlet hint = \"\";\n\tlet dimString = \"expect\";\n\tif (!isDirectExpectCall && received !== \"\") {\n\t\thint += DIM_COLOR(`${dimString}(`) + receivedColor(received);\n\t\tdimString = \")\";\n\t}\n\tif (promise !== \"\") {\n\t\thint += DIM_COLOR(`${dimString}.`) + promise;\n\t\tdimString = \"\";\n\t}\n\tif (isNot) {\n\t\thint += `${DIM_COLOR(`${dimString}.`)}not`;\n\t\tdimString = \"\";\n\t}\n\tif (matcherName.includes(\".\"))\n // Old format: for backward compatibility,\n\t// especially without promise or isNot options\n\tdimString += matcherName;\n\telse {\n\t\t// New format: omit period from matcherName arg\n\t\thint += DIM_COLOR(`${dimString}.`) + matcherName;\n\t\tdimString = \"\";\n\t}\n\tif (expected === \"\") dimString += \"()\";\n\telse {\n\t\thint += DIM_COLOR(`${dimString}(`) + expectedColor(expected);\n\t\tif (secondArgument) hint += DIM_COLOR(\", \") + secondArgumentColor(secondArgument);\n\t\tdimString = \")\";\n\t}\n\tif (comment !== \"\") dimString += ` // ${comment}`;\n\tif (dimString !== \"\") hint += DIM_COLOR(dimString);\n\treturn hint;\n}\nconst SPACE_SYMBOL = \"·\";\n// Instead of inverse highlight which now implies a change,\n// replace common spaces with middle dot at the end of any line.\nfunction replaceTrailingSpaces(text) {\n\treturn text.replace(/\\s+$/gm, (spaces) => SPACE_SYMBOL.repeat(spaces.length));\n}\nfunction printReceived(object) {\n\treturn RECEIVED_COLOR(replaceTrailingSpaces(stringify(object)));\n}\nfunction printExpected(value) {\n\treturn EXPECTED_COLOR(replaceTrailingSpaces(stringify(value)));\n}\nfunction getMatcherUtils() {\n\treturn {\n\t\tEXPECTED_COLOR,\n\t\tRECEIVED_COLOR,\n\t\tINVERTED_COLOR,\n\t\tBOLD_WEIGHT,\n\t\tDIM_COLOR,\n\t\tdiff,\n\t\tmatcherHint,\n\t\tprintReceived,\n\t\tprintExpected,\n\t\tprintDiffOrStringify,\n\t\tprintWithType\n\t};\n}\nfunction printWithType(name, value, print) {\n\tconst type = getType(value);\n\treturn (type !== \"null\" && type !== \"undefined\" ? `${name} has type:  ${type}\\n` : \"\") + `${name} has value: ${print(value)}`;\n}\nfunction addCustomEqualityTesters(newTesters) {\n\tif (!Array.isArray(newTesters)) throw new TypeError(`expect.customEqualityTesters: Must be set to an array of Testers. Was given \"${getType(newTesters)}\"`);\n\tglobalThis[JEST_MATCHERS_OBJECT].customEqualityTesters.push(...newTesters);\n}\nfunction getCustomEqualityTesters() {\n\treturn globalThis[JEST_MATCHERS_OBJECT].customEqualityTesters;\n}\n\n// Extracted out of jasmine 2.5.2\nfunction equals(a, b, customTesters, strictCheck) {\n\tcustomTesters = customTesters || [];\n\treturn eq(a, b, [], [], customTesters, strictCheck ? hasKey : hasDefinedKey);\n}\nfunction isAsymmetric(obj) {\n\treturn !!obj && typeof obj === \"object\" && \"asymmetricMatch\" in obj && isA(\"Function\", obj.asymmetricMatch);\n}\nfunction asymmetricMatch(a, b, customTesters) {\n\tconst asymmetricA = isAsymmetric(a);\n\tconst asymmetricB = isAsymmetric(b);\n\tif (asymmetricA && asymmetricB) return;\n\t// Asymmetric matchers define their own subset semantics.\n\tconst testers = customTesters.filter((tester) => !isSubsetEqualityTester(tester));\n\tif (asymmetricA) return a.asymmetricMatch(b, testers);\n\tif (asymmetricB) return b.asymmetricMatch(a, testers);\n}\n// https://github.com/jestjs/jest/blob/905bcbced3d40cdf7aadc4cdf6fb731c4bb3dbe3/packages/expect-utils/src/utils.ts#L509\nfunction isError(value) {\n\tif (typeof Error.isError === \"function\") return Error.isError(value);\n\tswitch (Object.prototype.toString.call(value)) {\n\t\tcase \"[object Error]\":\n\t\tcase \"[object Exception]\":\n\t\tcase \"[object DOMException]\": return true;\n\t\tdefault: return value instanceof Error;\n\t}\n}\n// Equality function lovingly adapted from isEqual in\n//   [Underscore](http://underscorejs.org)\nfunction eq(a, b, aStack, bStack, customTesters, hasKey) {\n\tlet result = true;\n\tconst asymmetricResult = asymmetricMatch(a, b, customTesters);\n\tif (asymmetricResult !== void 0) return asymmetricResult;\n\tconst testerContext = { equals };\n\tfor (let i = 0; i < customTesters.length; i++) {\n\t\tconst customTesterResult = customTesters[i].call(testerContext, a, b, customTesters);\n\t\tif (customTesterResult !== void 0) return customTesterResult;\n\t}\n\tif (typeof URL === \"function\" && a instanceof URL && b instanceof URL) return a.href === b.href;\n\tif (Object.is(a, b)) return true;\n\t// A strict comparison is necessary because `null == undefined`.\n\tif (a === null || b === null) return a === b;\n\tconst className = Object.prototype.toString.call(a);\n\tif (className !== Object.prototype.toString.call(b)) return false;\n\tswitch (className) {\n\t\tcase \"[object Boolean]\":\n\t\tcase \"[object String]\":\n\t\tcase \"[object Number]\": if (typeof a !== typeof b)\n // One is a primitive, one a `new Primitive()`\n\t\treturn false;\n\t\telse if (typeof a !== \"object\" && typeof b !== \"object\")\n // both are proper primitives\n\t\treturn Object.is(a, b);\n\t\telse\n // both are `new Primitive()`s\n\t\treturn Object.is(a.valueOf(), b.valueOf());\n\t\tcase \"[object Date]\": {\n\t\t\tconst numA = +a;\n\t\t\tconst numB = +b;\n\t\t\t// Coerce dates to numeric primitive values. Dates are compared by their\n\t\t\t// millisecond representations. Note that invalid dates with millisecond representations\n\t\t\t// of `NaN` are equivalent.\n\t\t\treturn numA === numB || Number.isNaN(numA) && Number.isNaN(numB);\n\t\t}\n\t\t// RegExps are compared by their source patterns and flags.\n\t\tcase \"[object RegExp]\": return a.source === b.source && a.flags === b.flags;\n\t\tcase \"[object Temporal.Instant]\":\n\t\tcase \"[object Temporal.ZonedDateTime]\":\n\t\tcase \"[object Temporal.PlainDateTime]\":\n\t\tcase \"[object Temporal.PlainDate]\":\n\t\tcase \"[object Temporal.PlainTime]\":\n\t\tcase \"[object Temporal.PlainYearMonth]\":\n\t\tcase \"[object Temporal.PlainMonthDay]\": return a.equals(b);\n\t\tcase \"[object Temporal.Duration]\": return a.toString() === b.toString();\n\t}\n\tif (typeof a !== \"object\" || typeof b !== \"object\") return false;\n\t// Use DOM3 method isEqualNode (IE>=9)\n\tif (isDomNode(a) && isDomNode(b)) return a.isEqualNode(b);\n\t// Used to detect circular references.\n\tlet length = aStack.length;\n\twhile (length--)\n // Linear search. Performance is inversely proportional to the number of\n\t// unique nested structures.\n\t// circular references at same depth are equal\n\t// circular reference is not equal to non-circular one\n\tif (aStack[length] === a) return bStack[length] === b;\n\telse if (bStack[length] === b) return false;\n\t// Add the first object to the stack of traversed objects.\n\taStack.push(a);\n\tbStack.push(b);\n\t// Recursively compare objects and arrays.\n\t// Compare array lengths to determine if a deep comparison is necessary.\n\tif (className === \"[object Array]\" && a.length !== b.length) return false;\n\tif (isError(a) && isError(b)) try {\n\t\treturn isErrorEqual(a, b, aStack, bStack, customTesters, hasKey);\n\t} finally {\n\t\taStack.pop();\n\t\tbStack.pop();\n\t}\n\t// Deep compare objects.\n\tconst aKeys = keys(a, hasKey);\n\tlet key;\n\tlet size = aKeys.length;\n\t// Ensure that both objects contain the same number of properties before comparing deep equality.\n\tif (keys(b, hasKey).length !== size) return false;\n\twhile (size--) {\n\t\tkey = aKeys[size];\n\t\t// Deep compare each member\n\t\tresult = hasKey(b, key) && eq(a[key], b[key], aStack, bStack, customTesters, hasKey);\n\t\tif (!result) return false;\n\t}\n\t// Remove the first object from the stack of traversed objects.\n\taStack.pop();\n\tbStack.pop();\n\treturn result;\n}\nfunction isErrorEqual(a, b, aStack, bStack, customTesters, hasKey) {\n\t// https://nodejs.org/docs/latest-v22.x/api/assert.html#comparison-details\n\t// - [[Prototype]] of objects are compared using the === operator.\n\t// - Only enumerable \"own\" properties are considered.\n\t// - Error names, messages, causes, and errors are always compared, even if these are not enumerable properties. errors is also compared.\n\tlet result = Object.prototype.toString.call(a) === Object.prototype.toString.call(b) && a.name === b.name && a.message === b.message;\n\t// check Error.cause asymmetrically\n\tif (typeof b.cause !== \"undefined\") result &&= eq(a.cause, b.cause, aStack, bStack, customTesters, hasKey);\n\t// AggregateError.errors\n\tif (a instanceof AggregateError && b instanceof AggregateError) result &&= eq(a.errors, b.errors, aStack, bStack, customTesters, hasKey);\n\t// spread to compare enumerable properties\n\tresult &&= eq({ ...a }, { ...b }, aStack, bStack, customTesters, hasKey);\n\treturn result;\n}\nfunction keys(obj, hasKey) {\n\tconst keys = [];\n\tfor (const key in obj) if (hasKey(obj, key)) keys.push(key);\n\treturn keys.concat(Object.getOwnPropertySymbols(obj).filter((symbol) => Object.getOwnPropertyDescriptor(obj, symbol).enumerable));\n}\nfunction hasDefinedKey(obj, key) {\n\treturn hasKey(obj, key) && obj[key] !== void 0;\n}\nfunction hasKey(obj, key) {\n\treturn Object.hasOwn(obj, key);\n}\nfunction isA(typeName, value) {\n\treturn Object.prototype.toString.apply(value) === `[object ${typeName}]`;\n}\nfunction isDomNode(obj) {\n\treturn obj !== null && typeof obj === \"object\" && \"nodeType\" in obj && typeof obj.nodeType === \"number\" && \"nodeName\" in obj && typeof obj.nodeName === \"string\" && \"isEqualNode\" in obj && typeof obj.isEqualNode === \"function\";\n}\n// SENTINEL constants are from https://github.com/immutable-js/immutable-js\nconst IS_KEYED_SENTINEL = \"@@__IMMUTABLE_KEYED__@@\";\nconst IS_SET_SENTINEL = \"@@__IMMUTABLE_SET__@@\";\nconst IS_LIST_SENTINEL = \"@@__IMMUTABLE_LIST__@@\";\nconst IS_ORDERED_SENTINEL = \"@@__IMMUTABLE_ORDERED__@@\";\nconst IS_RECORD_SYMBOL = \"@@__IMMUTABLE_RECORD__@@\";\nfunction isImmutableUnorderedKeyed(maybeKeyed) {\n\treturn !!(maybeKeyed && maybeKeyed[IS_KEYED_SENTINEL] && !maybeKeyed[IS_ORDERED_SENTINEL]);\n}\nfunction isImmutableUnorderedSet(maybeSet) {\n\treturn !!(maybeSet && maybeSet[IS_SET_SENTINEL] && !maybeSet[IS_ORDERED_SENTINEL]);\n}\nfunction isObjectLiteral(source) {\n\treturn source != null && typeof source === \"object\" && !Array.isArray(source);\n}\nfunction isImmutableList(source) {\n\treturn Boolean(source && isObjectLiteral(source) && source[IS_LIST_SENTINEL]);\n}\nfunction isImmutableOrderedKeyed(source) {\n\treturn Boolean(source && isObjectLiteral(source) && source[IS_KEYED_SENTINEL] && source[IS_ORDERED_SENTINEL]);\n}\nfunction isImmutableOrderedSet(source) {\n\treturn Boolean(source && isObjectLiteral(source) && source[IS_SET_SENTINEL] && source[IS_ORDERED_SENTINEL]);\n}\nfunction isImmutableRecord(source) {\n\treturn Boolean(source && isObjectLiteral(source) && source[IS_RECORD_SYMBOL]);\n}\n/**\n* Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.\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 IteratorSymbol = Symbol.iterator;\nfunction hasIterator(object) {\n\treturn !!(object != null && object[IteratorSymbol]);\n}\nfunction iterableEquality(a, b, customTesters = [], aStack = [], bStack = []) {\n\tif (typeof a !== \"object\" || typeof b !== \"object\" || Array.isArray(a) || Array.isArray(b) || !hasIterator(a) || !hasIterator(b)) return;\n\tif (a.constructor !== b.constructor) return false;\n\tlet length = aStack.length;\n\twhile (length--)\n // Linear search. Performance is inversely proportional to the number of\n\t// unique nested structures.\n\t// circular references at same depth are equal\n\t// circular reference is not equal to non-circular one\n\tif (aStack[length] === a) return bStack[length] === b;\n\taStack.push(a);\n\tbStack.push(b);\n\tconst filteredCustomTesters = [...customTesters.filter((t) => t !== iterableEquality), iterableEqualityWithStack];\n\tfunction iterableEqualityWithStack(a, b) {\n\t\treturn iterableEquality(a, b, [...customTesters], [...aStack], [...bStack]);\n\t}\n\tif (a.size !== void 0) {\n\t\tif (a.size !== b.size) return false;\n\t\telse if (isA(\"Set\", a) || isImmutableUnorderedSet(a)) {\n\t\t\tlet allFound = true;\n\t\t\tfor (const aValue of a) if (!b.has(aValue)) {\n\t\t\t\tlet has = false;\n\t\t\t\tfor (const bValue of b) if (equals(aValue, bValue, filteredCustomTesters) === true) has = true;\n\t\t\t\tif (has === false) {\n\t\t\t\t\tallFound = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Remove the first value from the stack of traversed values.\n\t\t\taStack.pop();\n\t\t\tbStack.pop();\n\t\t\treturn allFound;\n\t\t} else if (isA(\"Map\", a) || isImmutableUnorderedKeyed(a)) {\n\t\t\tlet allFound = true;\n\t\t\tfor (const aEntry of a) if (!b.has(aEntry[0]) || !equals(aEntry[1], b.get(aEntry[0]), filteredCustomTesters)) {\n\t\t\t\tlet has = false;\n\t\t\t\tfor (const bEntry of b) {\n\t\t\t\t\tconst matchedKey = equals(aEntry[0], bEntry[0], filteredCustomTesters);\n\t\t\t\t\tlet matchedValue = false;\n\t\t\t\t\tif (matchedKey === true) matchedValue = equals(aEntry[1], bEntry[1], filteredCustomTesters);\n\t\t\t\t\tif (matchedValue === true) has = true;\n\t\t\t\t}\n\t\t\t\tif (has === false) {\n\t\t\t\t\tallFound = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Remove the first value from the stack of traversed values.\n\t\t\taStack.pop();\n\t\t\tbStack.pop();\n\t\t\treturn allFound;\n\t\t}\n\t}\n\tconst bIterator = b[IteratorSymbol]();\n\tfor (const aValue of a) {\n\t\tconst nextB = bIterator.next();\n\t\tif (nextB.done || !equals(aValue, nextB.value, filteredCustomTesters)) return false;\n\t}\n\tif (!bIterator.next().done) return false;\n\tif (!isImmutableList(a) && !isImmutableOrderedKeyed(a) && !isImmutableOrderedSet(a) && !isImmutableRecord(a)) {\n\t\tif (!equals(Object.entries(a), Object.entries(b), filteredCustomTesters)) return false;\n\t}\n\t// Remove the first value from the stack of traversed values.\n\taStack.pop();\n\tbStack.pop();\n\treturn true;\n}\n/**\n* Checks if `hasOwnProperty(object, key)` up the prototype chain, stopping at `Object.prototype`.\n*/\nfunction hasPropertyInObject(object, key) {\n\tif (!object || typeof object !== \"object\" || object === Object.prototype) return false;\n\treturn Object.hasOwn(object, key) || hasPropertyInObject(Object.getPrototypeOf(object), key);\n}\nfunction isObjectWithKeys(a) {\n\treturn isObject(a) && !isError(a) && !Array.isArray(a) && !(a instanceof Date) && !(a instanceof Set) && !(a instanceof Map);\n}\n// Recursive subset testers are closures, so track them by identity.\nconst subsetEqualityTesters = /* @__PURE__ */ new WeakSet();\nfunction registerSubsetEqualityTester(tester) {\n\tsubsetEqualityTesters.add(tester);\n\treturn tester;\n}\nfunction isSubsetEqualityTester(tester) {\n\treturn tester === subsetEquality || subsetEqualityTesters.has(tester);\n}\nfunction subsetEquality(object, subset, customTesters = []) {\n\tconst filteredCustomTesters = customTesters.filter((t) => t !== subsetEquality);\n\t// subsetEquality needs to keep track of the references\n\t// it has already visited to avoid infinite loops in case\n\t// there are circular references in the subset passed to it.\n\tconst subsetEqualityWithContext = (seenReferences = /* @__PURE__ */ new WeakMap()) => registerSubsetEqualityTester((object, subset) => {\n\t\tif (!isObjectWithKeys(subset)) return;\n\t\treturn Object.keys(subset).every((key) => {\n\t\t\tif (subset[key] != null && typeof subset[key] === \"object\") {\n\t\t\t\tif (seenReferences.has(subset[key])) return equals(object[key], subset[key], filteredCustomTesters);\n\t\t\t\tseenReferences.set(subset[key], true);\n\t\t\t}\n\t\t\tconst result = object != null && hasPropertyInObject(object, key) && equals(object[key], subset[key], [...filteredCustomTesters, subsetEqualityWithContext(seenReferences)]);\n\t\t\t// The main goal of using seenReference is to avoid circular node on tree.\n\t\t\t// It will only happen within a parent and its child, not a node and nodes next to it (same level)\n\t\t\t// We should keep the reference for a parent and its child only\n\t\t\t// Thus we should delete the reference immediately so that it doesn't interfere\n\t\t\t// other nodes within the same level on tree.\n\t\t\tseenReferences.delete(subset[key]);\n\t\t\treturn result;\n\t\t});\n\t});\n\treturn subsetEqualityWithContext()(object, subset);\n}\nfunction typeEquality(a, b) {\n\tif (a == null || b == null || a.constructor === b.constructor) return;\n\treturn false;\n}\nfunction arrayBufferEquality(a, b) {\n\tlet dataViewA = a;\n\tlet dataViewB = b;\n\tif (!(a instanceof DataView && b instanceof DataView)) {\n\t\tif (!(a instanceof ArrayBuffer) || !(b instanceof ArrayBuffer)) return;\n\t\ttry {\n\t\t\tdataViewA = new DataView(a);\n\t\t\tdataViewB = new DataView(b);\n\t\t} catch {\n\t\t\treturn;\n\t\t}\n\t}\n\t// Buffers are not equal when they do not have the same byte length\n\tif (dataViewA.byteLength !== dataViewB.byteLength) return false;\n\t// Check if every byte value is equal to each other\n\tfor (let i = 0; i < dataViewA.byteLength; i++) if (dataViewA.getUint8(i) !== dataViewB.getUint8(i)) return false;\n\treturn true;\n}\nfunction sparseArrayEquality(a, b, customTesters = []) {\n\tif (!Array.isArray(a) || !Array.isArray(b)) return;\n\t// A sparse array [, , 1] will have keys [\"2\"] whereas [undefined, undefined, 1] will have keys [\"0\", \"1\", \"2\"]\n\tconst aKeys = Object.keys(a);\n\tconst bKeys = Object.keys(b);\n\treturn equals(a, b, customTesters.filter((t) => t !== sparseArrayEquality), true) && equals(aKeys, bKeys);\n}\nfunction generateToBeMessage(deepEqualityName, expected = \"#{this}\", actual = \"#{exp}\") {\n\tconst toBeMessage = `expected ${expected} to be ${actual} // Object.is equality`;\n\tif ([\"toStrictEqual\", \"toEqual\"].includes(deepEqualityName)) return `${toBeMessage}\\n\\nIf it should pass with deep equality, replace \"toBe\" with \"${deepEqualityName}\"\\n\\nExpected: ${expected}\\nReceived: serializes to the same string\\n`;\n\treturn toBeMessage;\n}\nfunction pluralize(word, count) {\n\treturn `${count} ${word}${count === 1 ? \"\" : \"s\"}`;\n}\nfunction getObjectKeys(object) {\n\treturn [...Object.keys(object), ...Object.getOwnPropertySymbols(object).filter((s) => Object.getOwnPropertyDescriptor(object, s)?.enumerable)];\n}\nfunction getObjectSubset(object, subset, customTesters) {\n\tlet stripped = 0;\n\tconst getObjectSubsetWithContext = (seenReferences = /* @__PURE__ */ new WeakMap()) => (object, subset) => {\n\t\tif (Array.isArray(object)) {\n\t\t\tif (Array.isArray(subset) && subset.length === object.length)\n // The map method returns correct subclass of subset.\n\t\t\treturn subset.map((sub, i) => getObjectSubsetWithContext(seenReferences)(object[i], sub));\n\t\t} else if (object instanceof Date) return object;\n\t\telse if (isObject(object) && isObject(subset)) {\n\t\t\tif (equals(object, subset, [\n\t\t\t\t...customTesters,\n\t\t\t\titerableEquality,\n\t\t\t\tsubsetEquality\n\t\t\t]))\n // return \"expected\" subset to avoid showing irrelevant toMatchObject diff\n\t\t\treturn subset;\n\t\t\tconst trimmed = {};\n\t\t\tseenReferences.set(object, trimmed);\n\t\t\t// preserve constructor for toMatchObject diff\n\t\t\tif (typeof object.constructor === \"function\" && typeof object.constructor.name === \"string\") Object.defineProperty(trimmed, \"constructor\", {\n\t\t\t\tenumerable: false,\n\t\t\t\tvalue: object.constructor\n\t\t\t});\n\t\t\tfor (const key of getObjectKeys(object)) if (hasPropertyInObject(subset, key)) trimmed[key] = seenReferences.has(object[key]) ? seenReferences.get(object[key]) : getObjectSubsetWithContext(seenReferences)(object[key], subset[key]);\n\t\t\telse if (!seenReferences.has(object[key])) {\n\t\t\t\tstripped += 1;\n\t\t\t\tif (isObject(object[key])) stripped += getObjectKeys(object[key]).length;\n\t\t\t\tgetObjectSubsetWithContext(seenReferences)(object[key], subset[key]);\n\t\t\t}\n\t\t\tif (getObjectKeys(trimmed).length > 0) return trimmed;\n\t\t}\n\t\treturn object;\n\t};\n\treturn {\n\t\tsubset: getObjectSubsetWithContext()(object, subset),\n\t\tstripped\n\t};\n}\n/**\n* Detects if an object is a Standard Schema V1 compatible schema\n*/\nfunction isStandardSchema(obj) {\n\treturn !!obj && (typeof obj === \"object\" || typeof obj === \"function\") && obj[\"~standard\"] && typeof obj[\"~standard\"].validate === \"function\";\n}\n\nif (!Object.hasOwn(globalThis, MATCHERS_OBJECT)) {\n\tconst globalState = /* @__PURE__ */ new WeakMap();\n\tconst matchers = Object.create(null);\n\tconst customEqualityTesters = [];\n\tconst asymmetricMatchers = Object.create(null);\n\t// `configurable` so that vm pools can strip the accessors from a disposed\n\t// context: the getters capture the expect state, which would otherwise keep\n\t// the whole test-file world reachable from the leaked context shell\n\tObject.defineProperty(globalThis, MATCHERS_OBJECT, {\n\t\tconfigurable: true,\n\t\tget: () => globalState\n\t});\n\tObject.defineProperty(globalThis, JEST_MATCHERS_OBJECT, {\n\t\tconfigurable: true,\n\t\tget: () => ({\n\t\t\tstate: globalState.get(globalThis[GLOBAL_EXPECT]),\n\t\t\tmatchers,\n\t\t\tcustomEqualityTesters\n\t\t})\n\t});\n\tObject.defineProperty(globalThis, ASYMMETRIC_MATCHERS_OBJECT, {\n\t\tconfigurable: true,\n\t\tget: () => asymmetricMatchers\n\t});\n}\nfunction getState(expect) {\n\treturn globalThis[MATCHERS_OBJECT].get(expect);\n}\nfunction setState(state, expect) {\n\tconst map = globalThis[MATCHERS_OBJECT];\n\tconst current = map.get(expect);\n\t// so it keeps getters from `testPath`\n\tconst next = Object.defineProperties(current || {}, Object.getOwnPropertyDescriptors(state));\n\tif (!current) map.set(expect, next);\n}\n\nclass AsymmetricMatcher {\n\tsample;\n\tinverse;\n\t// should have \"jest\" to be compatible with its ecosystem\n\t$$typeof = Symbol.for(\"jest.asymmetricMatcher\");\n\tconstructor(sample, inverse = false) {\n\t\tthis.sample = sample;\n\t\tthis.inverse = inverse;\n\t}\n\tgetMatcherContext(expect) {\n\t\treturn {\n\t\t\t...getState(expect || globalThis[GLOBAL_EXPECT]),\n\t\t\tequals,\n\t\t\tisNot: this.inverse,\n\t\t\tcustomTesters: getCustomEqualityTesters(),\n\t\t\tutils: {\n\t\t\t\t...getMatcherUtils(),\n\t\t\t\tdiff,\n\t\t\t\tstringify,\n\t\t\t\titerableEquality,\n\t\t\t\tsubsetEquality\n\t\t\t}\n\t\t};\n\t}\n}\n// implement custom chai/loupe inspect for better AssertionError.message formatting\n// https://github.com/chaijs/loupe/blob/9b8a6deabcd50adc056a64fb705896194710c5c6/src/index.ts#L29\n// @ts-expect-error computed properties is not supported when isolatedDeclarations is enabled\n// FIXME: https://github.com/microsoft/TypeScript/issues/61068\nAsymmetricMatcher.prototype[Symbol.for(\"chai/inspect\")] = function(options) {\n\t// minimal pretty-format with simple manual truncation\n\tconst result = stringify(this, options.depth, { min: true });\n\tif (result.length <= options.truncate) return result;\n\treturn `${this.toString()}{…}`;\n};\nclass StringContaining extends AsymmetricMatcher {\n\tconstructor(sample, inverse = false) {\n\t\tif (!isA(\"String\", sample)) throw new Error(\"Expected is not a string\");\n\t\tsuper(sample, inverse);\n\t}\n\tasymmetricMatch(other) {\n\t\tconst result = isA(\"String\", other) && other.includes(this.sample);\n\t\treturn this.inverse ? !result : result;\n\t}\n\ttoString() {\n\t\treturn `String${this.inverse ? \"Not\" : \"\"}Containing`;\n\t}\n\tgetExpectedType() {\n\t\treturn \"string\";\n\t}\n}\nclass Anything extends AsymmetricMatcher {\n\tasymmetricMatch(other) {\n\t\treturn other != null;\n\t}\n\ttoString() {\n\t\treturn \"Anything\";\n\t}\n\ttoAsymmetricMatcher() {\n\t\treturn \"Anything\";\n\t}\n}\nclass ObjectContaining extends AsymmetricMatcher {\n\tconstructor(sample, inverse = false) {\n\t\tsuper(sample, inverse);\n\t}\n\tgetPrototype(obj) {\n\t\tif (Object.getPrototypeOf) return Object.getPrototypeOf(obj);\n\t\tif (obj.constructor.prototype === obj) return null;\n\t\treturn obj.constructor.prototype;\n\t}\n\thasProperty(obj, property) {\n\t\tif (!obj) return false;\n\t\tif (Object.hasOwn(obj, property)) return true;\n\t\treturn this.hasProperty(this.getPrototype(obj), property);\n\t}\n\tgetProperties(obj) {\n\t\treturn [...Object.keys(obj), ...Object.getOwnPropertySymbols(obj).filter((s) => Object.getOwnPropertyDescriptor(obj, s)?.enumerable)];\n\t}\n\tasymmetricMatch(other, customTesters) {\n\t\tif (typeof this.sample !== \"object\") throw new TypeError(`You must provide an object to ${this.toString()}, not '${typeof this.sample}'.`);\n\t\tlet result = true;\n\t\tconst properties = this.getProperties(this.sample);\n\t\tfor (const property of properties) {\n\t\t\tif (!this.hasProperty(other, property)) {\n\t\t\t\tresult = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tconst value = this.sample[property];\n\t\t\tconst otherValue = other[property];\n\t\t\tif (!equals(value, otherValue, customTesters)) {\n\t\t\t\tresult = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\treturn this.inverse ? !result : result;\n\t}\n\ttoString() {\n\t\treturn `Object${this.inverse ? \"Not\" : \"\"}Containing`;\n\t}\n\tgetExpectedType() {\n\t\treturn \"object\";\n\t}\n}\nclass ArrayContaining extends AsymmetricMatcher {\n\tconstructor(sample, inverse = false) {\n\t\tsuper(sample, inverse);\n\t}\n\tasymmetricMatch(other, customTesters) {\n\t\tif (!Array.isArray(this.sample)) throw new TypeError(`You must provide an array to ${this.toString()}, not '${typeof this.sample}'.`);\n\t\tconst result = this.sample.length === 0 || Array.isArray(other) && this.sample.every((item) => other.some((another) => equals(item, another, customTesters)));\n\t\treturn this.inverse ? !result : result;\n\t}\n\ttoString() {\n\t\treturn `Array${this.inverse ? \"Not\" : \"\"}Containing`;\n\t}\n\tgetExpectedType() {\n\t\treturn \"array\";\n\t}\n}\nclass Any extends AsymmetricMatcher {\n\tconstructor(sample) {\n\t\tif (typeof sample === \"undefined\") throw new TypeError(\"any() expects to be passed a constructor function. Please pass one or use anything() to match any object.\");\n\t\tsuper(sample);\n\t}\n\tfnNameFor(func) {\n\t\tif (func.name) return func.name;\n\t\tconst matches = Function.prototype.toString.call(func).match(/^(?:async)?\\s*function\\s*(?:\\*\\s*)?([\\w$]+)\\s*\\(/);\n\t\treturn matches ? matches[1] : \"<anonymous>\";\n\t}\n\tasymmetricMatch(other) {\n\t\tif (this.sample === String) return typeof other == \"string\" || other instanceof String;\n\t\tif (this.sample === Number) return typeof other == \"number\" || other instanceof Number;\n\t\tif (this.sample === Function) return typeof other == \"function\" || typeof other === \"function\";\n\t\tif (this.sample === Boolean) return typeof other == \"boolean\" || other instanceof Boolean;\n\t\tif (this.sample === BigInt) return typeof other == \"bigint\" || other instanceof BigInt;\n\t\tif (this.sample === Symbol) return typeof other == \"symbol\" || other instanceof Symbol;\n\t\tif (this.sample === Object) return typeof other == \"object\";\n\t\treturn other instanceof this.sample;\n\t}\n\ttoString() {\n\t\treturn \"Any\";\n\t}\n\tgetExpectedType() {\n\t\tif (this.sample === String) return \"string\";\n\t\tif (this.sample === Number) return \"number\";\n\t\tif (this.sample === Function) return \"function\";\n\t\tif (this.sample === Object) return \"object\";\n\t\tif (this.sample === Boolean) return \"boolean\";\n\t\treturn this.fnNameFor(this.sample);\n\t}\n\ttoAsymmetricMatcher() {\n\t\treturn `Any<${this.fnNameFor(this.sample)}>`;\n\t}\n}\nclass StringMatching extends AsymmetricMatcher {\n\tconstructor(sample, inverse = false) {\n\t\tif (!isA(\"String\", sample) && !isA(\"RegExp\", sample)) throw new Error(\"Expected is not a String or a RegExp\");\n\t\tsuper(new RegExp(sample), inverse);\n\t}\n\tasymmetricMatch(other) {\n\t\tconst result = isA(\"String\", other) && this.sample.test(other);\n\t\treturn this.inverse ? !result : result;\n\t}\n\ttoString() {\n\t\treturn `String${this.inverse ? \"Not\" : \"\"}Matching`;\n\t}\n\tgetExpectedType() {\n\t\treturn \"string\";\n\t}\n}\nclass CloseTo extends AsymmetricMatcher {\n\tprecision;\n\tconstructor(sample, precision = 2, inverse = false) {\n\t\tif (!isA(\"Number\", sample)) throw new Error(\"Expected is not a Number\");\n\t\tif (!isA(\"Number\", precision)) throw new Error(\"Precision is not a Number\");\n\t\tsuper(sample);\n\t\tthis.inverse = inverse;\n\t\tthis.precision = precision;\n\t}\n\tasymmetricMatch(other) {\n\t\tif (!isA(\"Number\", other)) return false;\n\t\tlet result = false;\n\t\tif (other === Number.POSITIVE_INFINITY && this.sample === Number.POSITIVE_INFINITY) result = true;\n\t\telse if (other === Number.NEGATIVE_INFINITY && this.sample === Number.NEGATIVE_INFINITY) result = true;\n\t\telse result = Math.abs(this.sample - other) < 10 ** -this.precision / 2;\n\t\treturn this.inverse ? !result : result;\n\t}\n\ttoString() {\n\t\treturn `Number${this.inverse ? \"Not\" : \"\"}CloseTo`;\n\t}\n\tgetExpectedType() {\n\t\treturn \"number\";\n\t}\n\ttoAsymmetricMatcher() {\n\t\treturn [\n\t\t\tthis.toString(),\n\t\t\tthis.sample,\n\t\t\t`(${pluralize(\"digit\", this.precision)})`\n\t\t].join(\" \");\n\t}\n}\nclass SchemaMatching extends AsymmetricMatcher {\n\tresult;\n\tconstructor(sample, inverse = false) {\n\t\tif (!isStandardSchema(sample)) throw new TypeError(\"SchemaMatching expected to receive a Standard Schema.\");\n\t\tsuper(sample, inverse);\n\t}\n\tasymmetricMatch(other) {\n\t\tconst result = this.sample[\"~standard\"].validate(other);\n\t\t// Check if the result is a Promise (async validation)\n\t\tif (result instanceof Promise) throw new TypeError(\"Async schema validation is not supported in asymmetric matchers.\");\n\t\tthis.result = result;\n\t\tconst pass = !this.result.issues || this.result.issues.length === 0;\n\t\treturn this.inverse ? !pass : pass;\n\t}\n\ttoString() {\n\t\treturn `Schema${this.inverse ? \"Not\" : \"\"}Matching`;\n\t}\n\tgetExpectedType() {\n\t\treturn \"object\";\n\t}\n\ttoAsymmetricMatcher() {\n\t\tconst { utils } = this.getMatcherContext();\n\t\tif ((this.result?.issues || []).length > 0) return `${this.toString()} ${utils.stringify(this.result, void 0, { printBasicPrototype: false })}`;\n\t\treturn this.toString();\n\t}\n}\nconst JestAsymmetricMatchers = (chai, utils) => {\n\tutils.addMethod(chai.expect, \"anything\", () => new Anything());\n\tutils.addMethod(chai.expect, \"any\", (expected) => new Any(expected));\n\tutils.addMethod(chai.expect, \"stringContaining\", (expected) => new StringContaining(expected));\n\tutils.addMethod(chai.expect, \"objectContaining\", (expected) => new ObjectContaining(expected));\n\tutils.addMethod(chai.expect, \"arrayContaining\", (expected) => new ArrayContaining(expected));\n\tutils.addMethod(chai.expect, \"stringMatching\", (expected) => new StringMatching(expected));\n\tutils.addMethod(chai.expect, \"closeTo\", (expected, precision) => new CloseTo(expected, precision));\n\tutils.addMethod(chai.expect, \"schemaMatching\", (expected) => new SchemaMatching(expected));\n\t// defineProperty does not work\n\tchai.expect.not = {\n\t\tstringContaining: (expected) => new StringContaining(expected, true),\n\t\tobjectContaining: (expected) => new ObjectContaining(expected, true),\n\t\tarrayContaining: (expected) => new ArrayContaining(expected, true),\n\t\tstringMatching: (expected) => new StringMatching(expected, true),\n\t\tcloseTo: (expected, precision) => new CloseTo(expected, precision, true),\n\t\tschemaMatching: (expected) => new SchemaMatching(expected, true)\n\t};\n};\n\nfunction createAssertionMessage(util, assertion, hasArgs) {\n\tconst soft = util.flag(assertion, \"soft\") ? \".soft\" : \"\";\n\tconst not = util.flag(assertion, \"negate\") ? \"not.\" : \"\";\n\tconst name = `${util.flag(assertion, \"_name\")}(${hasArgs ? \"expected\" : \"\"})`;\n\tconst promiseName = util.flag(assertion, \"promise\");\n\treturn `expect${soft}(actual)${promiseName ? `.${promiseName}` : \"\"}.${not}${name}`;\n}\nfunction recordAsyncExpect(_test, promise, assertion, error, isSoft) {\n\tconst test = _test;\n\t// record promise for test, that resolves before test ends\n\tif (test && promise instanceof Promise) {\n\t\t// if promise is explicitly awaited, remove it from the list\n\t\tpromise = promise.finally(() => {\n\t\t\tif (!test.promises) return;\n\t\t\tconst index = test.promises.indexOf(promise);\n\t\t\tif (index !== -1) test.promises.splice(index, 1);\n\t\t});\n\t\t// record promise\n\t\tif (!test.promises) test.promises = [];\n\t\t// setup `expect.soft` handler here instead of `wrapAssertion`\n\t\t// to avoid double error tracking while keeping non-await promise detection.\n\t\tif (isSoft) promise = promise.then(noop, (err) => {\n\t\t\thandleTestError(test, err);\n\t\t});\n\t\ttest.promises.push(promise);\n\t\tlet resolved = false;\n\t\ttest.onFinished ??= [];\n\t\ttest.onFinished.push(() => {\n\t\t\tif (!resolved) {\n\t\t\t\tconst awaitError = /* @__PURE__ */ new Error(`Promise returned by \\`${assertion}\\` was not awaited. This assertion is asynchronous and must be awaited; otherwise, it is not guaranteed to complete before the test finishes:\\n\\nawait ${assertion}\\n`);\n\t\t\t\tif (error.stack) awaitError.stack = error.stack.replace(error.message, awaitError.message);\n\t\t\t\tthrow awaitError;\n\t\t\t}\n\t\t});\n\t\treturn {\n\t\t\tthen(onFulfilled, onRejected) {\n\t\t\t\tresolved = true;\n\t\t\t\treturn promise.then(onFulfilled, onRejected);\n\t\t\t},\n\t\t\tcatch(onRejected) {\n\t\t\t\tresolved = true;\n\t\t\t\treturn promise.catch(onRejected);\n\t\t\t},\n\t\t\tfinally(onFinally) {\n\t\t\t\tresolved = true;\n\t\t\t\treturn promise.finally(onFinally);\n\t\t\t},\n\t\t\t[Symbol.toStringTag]: \"Promise\"\n\t\t};\n\t}\n\treturn promise;\n}\nfunction handleTestError(test, err) {\n\ttest.result ||= { state: \"fail\" };\n\ttest.result.state = \"fail\";\n\ttest.result.errors ||= [];\n\ttest.result.errors.push(processError(err));\n}\n/** wrap assertion function to support `expect.soft` and provide assertion name as `_name` */\nfunction wrapAssertion(utils, name, fn) {\n\treturn function(...args) {\n\t\t// private\n\t\tif (name !== \"withTest\") utils.flag(this, \"_name\", name);\n\t\tif (!utils.flag(this, \"soft\"))\n // avoid WebKit's proper tail call to preserve stacktrace offset for inline snapshot\n\t\t// https://webkit.org/blog/6240/ecmascript-6-proper-tail-calls-in-webkit\n\t\ttry {\n\t\t\treturn fn.apply(this, args);\n\t\t} finally {}\n\t\tconst test = utils.flag(this, \"vitest-test\");\n\t\tif (!test) throw new Error(\"expect.soft() can only be used inside a test\");\n\t\ttry {\n\t\t\tconst result = fn.apply(this, args);\n\t\t\tif (result && typeof result === \"object\" && typeof result.then === \"function\") return result.then(noop, (err) => {\n\t\t\t\thandleTestError(test, err);\n\t\t\t});\n\t\t\treturn result;\n\t\t} catch (err) {\n\t\t\thandleTestError(test, err);\n\t\t}\n\t};\n}\n\n// Jest Expect Compact\nconst JestChaiExpect = (chai, utils) => {\n\tconst { AssertionError } = chai;\n\tconst customTesters = getCustomEqualityTesters();\n\tfunction def(name, fn) {\n\t\tconst addMethod = (n) => {\n\t\t\tconst softWrapper = wrapAssertion(utils, n, fn);\n\t\t\tutils.addMethod(chai.Assertion.prototype, n, softWrapper);\n\t\t\tutils.addMethod(globalThis[JEST_MATCHERS_OBJECT].matchers, n, softWrapper);\n\t\t};\n\t\tif (Array.isArray(name)) name.forEach((n) => addMethod(n));\n\t\telse addMethod(name);\n\t}\n\t[\n\t\t\"throw\",\n\t\t\"throws\",\n\t\t\"Throw\"\n\t].forEach((m) => {\n\t\tutils.overwriteMethod(chai.Assertion.prototype, m, (_super) => {\n\t\t\treturn function(...args) {\n\t\t\t\tconst promise = utils.flag(this, \"promise\");\n\t\t\t\tconst object = utils.flag(this, \"object\");\n\t\t\t\tconst isNot = utils.flag(this, \"negate\");\n\t\t\t\tif (promise === \"rejects\") utils.flag(this, \"object\", () => {\n\t\t\t\t\tthrow object;\n\t\t\t\t});\n\t\t\t\telse if (promise === \"resolves\" && typeof object !== \"function\") if (!isNot) {\n\t\t\t\t\tconst message = utils.flag(this, \"message\") || \"expected promise to throw an error, but it didn't\";\n\t\t\t\t\tthrow new AssertionError(message, { showDiff: false }, utils.flag(this, \"ssfi\"));\n\t\t\t\t} else return;\n\t\t\t\t_super.apply(this, args);\n\t\t\t};\n\t\t});\n\t});\n\t// @ts-expect-error @internal\n\tdef(\"withTest\", function(test) {\n\t\tutils.flag(this, \"vitest-test\", test);\n\t\treturn this;\n\t});\n\tdef(\"toEqual\", function(expected) {\n\t\tconst actual = utils.flag(this, \"object\");\n\t\tconst equal = equals(actual, expected, [...customTesters, iterableEquality]);\n\t\treturn this.assert(equal, \"expected #{this} to deeply equal #{exp}\", \"expected #{this} to not deeply equal #{exp}\", expected, actual);\n\t});\n\tdef(\"toStrictEqual\", function(expected) {\n\t\tconst obj = utils.flag(this, \"object\");\n\t\tconst equal = equals(obj, expected, [\n\t\t\t...customTesters,\n\t\t\titerableEquality,\n\t\t\ttypeEquality,\n\t\t\tsparseArrayEquality,\n\t\t\tarrayBufferEquality\n\t\t], true);\n\t\treturn this.assert(equal, \"expected #{this} to strictly equal #{exp}\", \"expected #{this} to not strictly equal #{exp}\", expected, obj);\n\t});\n\tdef(\"toBe\", function(expected) {\n\t\tconst actual = this._obj;\n\t\tconst pass = Object.is(actual, expected);\n\t\tlet deepEqualityName = \"\";\n\t\tif (!pass) {\n\t\t\tif (equals(actual, expected, [\n\t\t\t\t...customTesters,\n\t\t\t\titerableEquality,\n\t\t\t\ttypeEquality,\n\t\t\t\tsparseArrayEquality,\n\t\t\t\tarrayBufferEquality\n\t\t\t], true)) deepEqualityName = \"toStrictEqual\";\n\t\t\telse if (equals(actual, expected, [...customTesters, iterableEquality])) deepEqualityName = \"toEqual\";\n\t\t}\n\t\treturn this.assert(pass, generateToBeMessage(deepEqualityName), \"expected #{this} not to be #{exp} // Object.is equality\", expected, actual);\n\t});\n\tdef(\"toMatchObject\", function(expected) {\n\t\tconst actual = this._obj;\n\t\tconst pass = equals(actual, expected, [\n\t\t\t...customTesters,\n\t\t\titerableEquality,\n\t\t\tsubsetEquality\n\t\t]);\n\t\tconst isNot = utils.flag(this, \"negate\");\n\t\tconst { subset: actualSubset, stripped } = getObjectSubset(actual, expected, customTesters);\n\t\tif (pass && isNot || !pass && !isNot) {\n\t\t\tconst msg = utils.getMessage(this, [\n\t\t\t\tpass,\n\t\t\t\t\"expected #{this} to match object #{exp}\",\n\t\t\t\t\"expected #{this} to not match object #{exp}\",\n\t\t\t\texpected,\n\t\t\t\tactualSubset,\n\t\t\t\tfalse\n\t\t\t]);\n\t\t\tconst message = stripped === 0 ? msg : `${msg}\\n(${stripped} matching ${stripped === 1 ? \"property\" : \"properties\"} omitted from actual)`;\n\t\t\tthrow new AssertionError(message, {\n\t\t\t\tshowDiff: true,\n\t\t\t\texpected,\n\t\t\t\tactual: actualSubset\n\t\t\t});\n\t\t}\n\t});\n\tdef(\"toMatch\", function(expected) {\n\t\tconst actual = this._obj;\n\t\tif (typeof actual !== \"string\") throw new TypeError(`.toMatch() expects to receive a string, but got ${typeof actual}`);\n\t\treturn this.assert(typeof expected === \"string\" ? actual.includes(expected) : actual.match(expected), `expected #{this} to match #{exp}`, `expected #{this} not to match #{exp}`, expected, actual);\n\t});\n\tdef(\"toContain\", function(item) {\n\t\tconst actual = this._obj;\n\t\tif (typeof Node !== \"undefined\" && actual instanceof Node) {\n\t\t\tif (!(item instanceof Node)) throw new TypeError(`toContain() expected a DOM node as the argument, but got ${typeof item}`);\n\t\t\treturn this.assert(actual.contains(item), \"expected #{this} to contain element #{exp}\", \"expected #{this} not to contain element #{exp}\", item, actual);\n\t\t}\n\t\tif (typeof DOMTokenList !== \"undefined\" && actual instanceof DOMTokenList) {\n\t\t\tassertTypes(item, \"class name\", [\"string\"]);\n\t\t\tconst expectedClassList = utils.flag(this, \"negate\") ? actual.value.replace(item, \"\").trim() : `${actual.value} ${item}`;\n\t\t\treturn this.assert(actual.contains(item), `expected \"${actual.value}\" to contain \"${item}\"`, `expected \"${actual.value}\" not to contain \"${item}\"`, expectedClassList, actual.value);\n\t\t}\n\t\t// handle simple case on our own using `this.assert` to include diff in error message\n\t\tif (typeof actual === \"string\" && typeof item === \"string\") return this.assert(actual.includes(item), `expected #{this} to contain #{exp}`, `expected #{this} not to contain #{exp}`, item, actual);\n\t\t// make \"actual\" indexable to have compatibility with jest\n\t\tif (actual != null && typeof actual !== \"string\") utils.flag(this, \"object\", Array.from(actual));\n\t\treturn this.contain(item);\n\t});\n\tdef(\"toContainEqual\", function(expected) {\n\t\tconst obj = utils.flag(this, \"object\");\n\t\tconst index = Array.from(obj).findIndex((item) => {\n\t\t\treturn equals(item, expected, customTesters);\n\t\t});\n\t\tthis.assert(index !== -1, \"expected #{this} to deep equally contain #{exp}\", \"expected #{this} to not deep equally contain #{exp}\", expected);\n\t});\n\tdef(\"toBeTruthy\", function() {\n\t\tconst obj = utils.flag(this, \"object\");\n\t\tthis.assert(Boolean(obj), \"expected #{this} to be truthy\", \"expected #{this} to not be truthy\", true, obj);\n\t});\n\tdef(\"toBeFalsy\", function() {\n\t\tconst obj = utils.flag(this, \"object\");\n\t\tthis.assert(!obj, \"expected #{this} to be falsy\", \"expected #{this} to not be falsy\", false, obj);\n\t});\n\tdef(\"toBeGreaterThan\", function(expected) {\n\t\tconst actual = this._obj;\n\t\tassertTypes(actual, \"actual\", [\"number\", \"bigint\"]);\n\t\tassertTypes(expected, \"expected\", [\"number\", \"bigint\"]);\n\t\treturn this.assert(actual > expected, `expected ${actual} to be greater than ${expected}`, `expected ${actual} to be not greater than ${expected}`, expected, actual, false);\n\t});\n\tdef(\"toBeGreaterThanOrEqual\", function(expected) {\n\t\tconst actual = this._obj;\n\t\tassertTypes(actual, \"actual\", [\"number\", \"bigint\"]);\n\t\tassertTypes(expected, \"expected\", [\"number\", \"bigint\"]);\n\t\treturn this.assert(actual >= expected, `expected ${actual} to be greater than or equal to ${expected}`, `expected ${actual} to be not greater than or equal to ${expected}`, expected, actual, false);\n\t});\n\tdef(\"toBeLessThan\", function(expected) {\n\t\tconst actual = this._obj;\n\t\tassertTypes(actual, \"actual\", [\"number\", \"bigint\"]);\n\t\tassertTypes(expected, \"expected\", [\"number\", \"bigint\"]);\n\t\treturn this.assert(actual < expected, `expected ${actual} to be less than ${expected}`, `expected ${actual} to be not less than ${expected}`, expected, actual, false);\n\t});\n\tdef(\"toBeLessThanOrEqual\", function(expected) {\n\t\tconst actual = this._obj;\n\t\tassertTypes(actual, \"actual\", [\"number\", \"bigint\"]);\n\t\tassertTypes(expected, \"expected\", [\"number\", \"bigint\"]);\n\t\treturn this.assert(actual <= expected, `expected ${actual} to be less than or equal to ${expected}`, `expected ${actual} to be not less than or equal to ${expected}`, expected, actual, false);\n\t});\n\tdef(\"toBeNaN\", function() {\n\t\tconst obj = utils.flag(this, \"object\");\n\t\tthis.assert(Number.isNaN(obj), \"expected #{this} to be NaN\", \"expected #{this} not to be NaN\", NaN, obj);\n\t});\n\tdef(\"toBeUndefined\", function() {\n\t\tconst obj = utils.flag(this, \"object\");\n\t\tthis.assert(void 0 === obj, \"expected #{this} to be undefined\", \"expected #{this} not to be undefined\", void 0, obj);\n\t});\n\tdef(\"toBeNull\", function() {\n\t\tconst obj = utils.flag(this, \"object\");\n\t\tthis.assert(obj === null, \"expected #{this} to be null\", \"expected #{this} not to be null\", null, obj);\n\t});\n\tdef(\"toBeNullable\", function() {\n\t\tconst obj = utils.flag(this, \"object\");\n\t\tthis.assert(obj == null, \"expected #{this} to be nullish\", \"expected #{this} not to be nullish\", null, obj);\n\t});\n\tdef(\"toBeDefined\", function() {\n\t\tconst obj = utils.flag(this, \"object\");\n\t\tthis.assert(typeof obj !== \"undefined\", \"expected #{this} to be defined\", \"expected #{this} to be undefined\", obj);\n\t});\n\tdef(\"toBeTypeOf\", function(expected) {\n\t\tconst actual = typeof this._obj;\n\t\tconst equal = expected === actual;\n\t\treturn this.assert(equal, \"expected #{this} to be type of #{exp}\", \"expected #{this} not to be type of #{exp}\", expected, actual);\n\t});\n\tdef(\"toBeInstanceOf\", function(obj) {\n\t\treturn this.instanceOf(obj);\n\t});\n\tdef(\"toHaveLength\", function(length) {\n\t\treturn this.have.length(length);\n\t});\n\t// destructuring, because it checks `arguments` inside, and value is passing as `undefined`\n\tdef(\"toHaveProperty\", function(...args) {\n\t\tif (Array.isArray(args[0])) args[0] = args[0].map((key) => String(key).replace(/([.[\\]])/g, \"\\\\$1\")).join(\".\");\n\t\tconst actual = this._obj;\n\t\tif (actual == null) throw new TypeError(`.toHaveProperty() expects to receive a valid object, but got ${actual}`);\n\t\tconst [propertyName, expected] = args;\n\t\tconst getValue = () => {\n\t\t\tif (Object.hasOwn(actual, propertyName)) return {\n\t\t\t\tvalue: actual[propertyName],\n\t\t\t\texists: true\n\t\t\t};\n\t\t\treturn utils.getPathInfo(actual, propertyName);\n\t\t};\n\t\tconst { value, exists } = getValue();\n\t\tconst pass = exists && (args.length === 1 || equals(expected, value, customTesters));\n\t\tconst valueString = args.length === 1 ? \"\" : ` with value ${inspect(expected, { truncate: 40 })}`;\n\t\treturn this.assert(pass, `expected #{this} to have property \"${propertyName}\"${valueString}`, `expected #{this} to not have property \"${propertyName}\"${valueString}`, expected, exists ? value : void 0);\n\t});\n\tdef(\"toBeCloseTo\", function(received, precision = 2) {\n\t\tconst expected = this._obj;\n\t\tlet pass = false;\n\t\tlet expectedDiff = 0;\n\t\tlet receivedDiff = 0;\n\t\tif (received === Number.POSITIVE_INFINITY && expected === Number.POSITIVE_INFINITY) pass = true;\n\t\telse if (received === Number.NEGATIVE_INFINITY && expected === Number.NEGATIVE_INFINITY) pass = true;\n\t\telse {\n\t\t\texpectedDiff = 10 ** -precision / 2;\n\t\t\treceivedDiff = Math.abs(expected - received);\n\t\t\tpass = receivedDiff < expectedDiff;\n\t\t}\n\t\treturn this.assert(pass, `expected #{this} to be close to #{exp}, received difference is ${receivedDiff}, but expected ${expectedDiff}`, `expected #{this} to not be close to #{exp}, received difference is ${receivedDiff}, but expected ${expectedDiff}`, received, expected, false);\n\t});\n\tfunction assertIsMock(assertion) {\n\t\tif (!isMockFunction(assertion._obj)) throw new TypeError(`${utils.inspect(assertion._obj)} is not a spy or a call to a spy!`);\n\t}\n\tfunction getSpy(assertion) {\n\t\tassertIsMock(assertion);\n\t\treturn assertion._obj;\n\t}\n\tdef([\"toHaveBeenCalledTimes\", \"toBeCalledTimes\"], function(number) {\n\t\tconst spy = getSpy(this);\n\t\tconst spyName = spy.getMockName();\n\t\tconst callCount = spy.mock.calls.length;\n\t\treturn this.assert(callCount === number, `expected \"${spyName}\" to be called #{exp} times, but got ${callCount} times`, `expected \"${spyName}\" to not be called #{exp} times`, number, callCount, false);\n\t});\n\tdef(\"toHaveBeenCalledOnce\", function() {\n\t\tconst spy = getSpy(this);\n\t\tconst spyName = spy.getMockName();\n\t\tconst callCount = spy.mock.calls.length;\n\t\treturn this.assert(callCount === 1, `expected \"${spyName}\" to be called once, but got ${callCount} times`, `expected \"${spyName}\" to not be called once`, 1, callCount, false);\n\t});\n\tdef([\"toHaveBeenCalled\", \"toBeCalled\"], function() {\n\t\tconst spy = getSpy(this);\n\t\tconst spyName = spy.getMockName();\n\t\tconst callCount = spy.mock.calls.length;\n\t\tconst called = callCount > 0;\n\t\tconst isNot = utils.flag(this, \"negate\");\n\t\tlet msg = utils.getMessage(this, [\n\t\t\tcalled,\n\t\t\t`expected \"${spyName}\" to be called at least once`,\n\t\t\t`expected \"${spyName}\" to not be called at all, but actually been called ${callCount} times`,\n\t\t\ttrue,\n\t\t\tcalled\n\t\t]);\n\t\tif (called && isNot) msg = formatCalls(spy, msg);\n\t\tif (called && isNot || !called && !isNot) throw new AssertionError(msg);\n\t});\n\t// manually compare array elements since `jestEquals` cannot\n\t// apply asymmetric matcher to `undefined` array element.\n\tfunction equalsArgumentArray(a, b) {\n\t\treturn a.length === b.length && a.every((aItem, i) => equals(aItem, b[i], [...customTesters, iterableEquality]));\n\t}\n\tdef([\"toHaveBeenCalledWith\", \"toBeCalledWith\"], function(...args) {\n\t\tconst spy = getSpy(this);\n\t\tconst spyName = spy.getMockName();\n\t\tconst pass = spy.mock.calls.some((callArg) => equalsArgumentArray(callArg, args));\n\t\tconst isNot = utils.flag(this, \"negate\");\n\t\tif (pass && isNot || !pass && !isNot) {\n\t\t\tconst msg = utils.getMessage(this, [\n\t\t\t\tpass,\n\t\t\t\t`expected \"${spyName}\" to be called with arguments: #{exp}`,\n\t\t\t\t`expected \"${spyName}\" to not be called with arguments: #{exp}`,\n\t\t\t\targs\n\t\t\t]);\n\t\t\tthrow new AssertionError(formatCalls(spy, msg, args));\n\t\t}\n\t});\n\tdef(\"toHaveBeenCalledExactlyOnceWith\", function(...args) {\n\t\tconst spy = getSpy(this);\n\t\tconst spyName = spy.getMockName();\n\t\tconst callCount = spy.mock.calls.length;\n\t\tconst pass = spy.mock.calls.some((callArg) => equalsArgumentArray(callArg, args)) && callCount === 1;\n\t\tconst isNot = utils.flag(this, \"negate\");\n\t\tif (pass && isNot || !pass && !isNot) {\n\t\t\tconst msg = utils.getMessage(this, [\n\t\t\t\tpass,\n\t\t\t\t`expected \"${spyName}\" to be called once with arguments: #{exp}`,\n\t\t\t\t`expected \"${spyName}\" to not be called once with arguments: #{exp}`,\n\t\t\t\targs\n\t\t\t]);\n\t\t\tthrow new AssertionError(formatCalls(spy, msg, args));\n\t\t}\n\t});\n\tdef(\"toHaveBeenNthCalledWith\", function(times, ...args) {\n\t\tconst spy = getSpy(this);\n\t\tconst spyName = spy.getMockName();\n\t\tconst nthCall = spy.mock.calls[times - 1];\n\t\tconst callCount = spy.mock.calls.length;\n\t\tconst isCalled = times <= callCount;\n\t\tthis.assert(nthCall && equalsArgumentArray(nthCall, args), `expected ${ordinal(times)} \"${spyName}\" call to have been called with #{exp}${isCalled ? `` : `, but called only ${callCount} times`}`, `expected ${ordinal(times)} \"${spyName}\" call to not have been called with #{exp}`, args, nthCall, isCalled);\n\t});\n\tdef(\"toHaveBeenLastCalledWith\", function(...args) {\n\t\tconst spy = getSpy(this);\n\t\tconst spyName = spy.getMockName();\n\t\tconst lastCall = spy.mock.calls.at(-1);\n\t\tthis.assert(lastCall && equalsArgumentArray(lastCall, args), `expected last \"${spyName}\" call to have been called with #{exp}`, `expected last \"${spyName}\" call to not have been called with #{exp}`, args, lastCall);\n\t});\n\t/**\n\t* Used for `toHaveBeenCalledBefore` and `toHaveBeenCalledAfter` to determine if the expected spy was called before the result spy.\n\t*/\n\tfunction isSpyCalledBeforeAnotherSpy(beforeSpy, afterSpy, failIfNoFirstInvocation) {\n\t\tconst beforeInvocationCallOrder = beforeSpy.mock.invocationCallOrder;\n\t\tconst afterInvocationCallOrder = afterSpy.mock.invocationCallOrder;\n\t\tif (beforeInvocationCallOrder.length === 0) return !failIfNoFirstInvocation;\n\t\tif (afterInvocationCallOrder.length === 0) return false;\n\t\treturn beforeInvocationCallOrder[0] < afterInvocationCallOrder[0];\n\t}\n\tdef([\"toHaveBeenCalledBefore\"], function(resultSpy, failIfNoFirstInvocation = true) {\n\t\tconst expectSpy = getSpy(this);\n\t\tif (!isMockFunction(resultSpy)) throw new TypeError(`${utils.inspect(resultSpy)} is not a spy or a call to a spy`);\n\t\tthis.assert(isSpyCalledBeforeAnotherSpy(expectSpy, resultSpy, failIfNoFirstInvocation), `expected \"${expectSpy.getMockName()}\" to have been called before \"${resultSpy.getMockName()}\"`, `expected \"${expectSpy.getMockName()}\" to not have been called before \"${resultSpy.getMockName()}\"`, resultSpy, expectSpy);\n\t});\n\tdef([\"toHaveBeenCalledAfter\"], function(resultSpy, failIfNoFirstInvocation = true) {\n\t\tconst expectSpy = getSpy(this);\n\t\tif (!isMockFunction(resultSpy)) throw new TypeError(`${utils.inspect(resultSpy)} is not a spy or a call to a spy`);\n\t\tthis.assert(isSpyCalledBeforeAnotherSpy(resultSpy, expectSpy, failIfNoFirstInvocation), `expected \"${expectSpy.getMockName()}\" to have been called after \"${resultSpy.getMockName()}\"`, `expected \"${expectSpy.getMockName()}\" to not have been called after \"${resultSpy.getMockName()}\"`, resultSpy, expectSpy);\n\t});\n\tdef([\"toThrow\", \"toThrowError\"], function(expected) {\n\t\tif (typeof expected === \"string\" || typeof expected === \"undefined\" || expected instanceof RegExp) return this.throws(expected);\n\t\tconst obj = this._obj;\n\t\tconst promise = utils.flag(this, \"promise\");\n\t\tconst isNot = utils.flag(this, \"negate\");\n\t\tlet thrown = null;\n\t\tif (promise === \"rejects\") thrown = obj;\n\t\telse if (promise === \"resolves\" && typeof obj !== \"function\") if (!isNot) {\n\t\t\tconst message = utils.flag(this, \"message\") || \"expected promise to throw an error, but it didn't\";\n\t\t\tthrow new AssertionError(message, { showDiff: false }, utils.flag(this, \"ssfi\"));\n\t\t} else return;\n\t\telse {\n\t\t\tlet isThrow = false;\n\t\t\ttry {\n\t\t\t\tobj();\n\t\t\t} catch (err) {\n\t\t\t\tisThrow = true;\n\t\t\t\tthrown = err;\n\t\t\t}\n\t\t\tif (!isThrow && !isNot) {\n\t\t\t\tconst message = utils.flag(this, \"message\") || \"expected function to throw an error, but it didn't\";\n\t\t\t\tthrow new AssertionError(message, { showDiff: false }, utils.flag(this, \"ssfi\"));\n\t\t\t}\n\t\t}\n\t\tif (typeof expected === \"function\") {\n\t\t\tconst name = expected.name || expected.prototype.constructor.name;\n\t\t\treturn this.assert(thrown && thrown instanceof expected, `expected error to be instance of ${name}`, `expected error not to be instance of ${name}`, expected, thrown);\n\t\t}\n\t\tif (isError(expected)) {\n\t\t\tconst equal = equals(thrown, expected, [...customTesters, iterableEquality]);\n\t\t\treturn this.assert(equal, \"expected a thrown error to be #{exp}\", \"expected a thrown error not to be #{exp}\", expected, thrown);\n\t\t}\n\t\tif (typeof expected === \"object\" && \"asymmetricMatch\" in expected && typeof expected.asymmetricMatch === \"function\") {\n\t\t\tconst matcher = expected;\n\t\t\treturn this.assert(thrown && matcher.asymmetricMatch(thrown), \"expected error to match asymmetric matcher\", \"expected error not to match asymmetric matcher\", matcher, thrown);\n\t\t}\n\t\tconst equal = equals(thrown, expected, [...customTesters, iterableEquality]);\n\t\treturn this.assert(equal, \"expected a thrown value to equal #{exp}\", \"expected a thrown value not to equal #{exp}\", expected, thrown);\n\t});\n\t[{\n\t\tname: \"toHaveResolved\",\n\t\tcondition: (spy) => spy.mock.settledResults.length > 0 && spy.mock.settledResults.some(({ type }) => type === \"fulfilled\"),\n\t\taction: \"resolved\"\n\t}, {\n\t\tname: [\"toHaveReturned\", \"toReturn\"],\n\t\tcondition: (spy) => spy.mock.calls.length > 0 && spy.mock.results.some(({ type }) => type !== \"throw\"),\n\t\taction: \"called\"\n\t}].forEach(({ name, condition, action }) => {\n\t\tdef(name, function() {\n\t\t\tconst spy = getSpy(this);\n\t\t\tconst spyName = spy.getMockName();\n\t\t\tconst pass = condition(spy);\n\t\t\tthis.assert(pass, `expected \"${spyName}\" to be successfully ${action} at least once`, `expected \"${spyName}\" to not be successfully ${action}`, pass, !pass, false);\n\t\t});\n\t});\n\t[{\n\t\tname: \"toHaveResolvedTimes\",\n\t\tcondition: (spy, times) => spy.mock.settledResults.reduce((s, { type }) => type === \"fulfilled\" ? ++s : s, 0) === times,\n\t\taction: \"resolved\"\n\t}, {\n\t\tname: [\"toHaveReturnedTimes\", \"toReturnTimes\"],\n\t\tcondition: (spy, times) => spy.mock.results.reduce((s, { type }) => type === \"throw\" ? s : ++s, 0) === times,\n\t\taction: \"called\"\n\t}].forEach(({ name, condition, action }) => {\n\t\tdef(name, function(times) {\n\t\t\tconst spy = getSpy(this);\n\t\t\tconst spyName = spy.getMockName();\n\t\t\tconst pass = condition(spy, times);\n\t\t\tthis.assert(pass, `expected \"${spyName}\" to be successfully ${action} ${times} times`, `expected \"${spyName}\" to not be successfully ${action} ${times} times`, `expected resolved times: ${times}`, `received resolved times: ${pass}`, false);\n\t\t});\n\t});\n\t[{\n\t\tname: \"toHaveResolvedWith\",\n\t\tcondition: (spy, value) => spy.mock.settledResults.some(({ type, value: result }) => type === \"fulfilled\" && equals(value, result)),\n\t\taction: \"resolve\"\n\t}, {\n\t\tname: [\"toHaveReturnedWith\", \"toReturnWith\"],\n\t\tcondition: (spy, value) => spy.mock.results.some(({ type, value: result }) => type === \"return\" && equals(value, result)),\n\t\taction: \"return\"\n\t}].forEach(({ name, condition, action }) => {\n\t\tdef(name, function(value) {\n\t\t\tconst spy = getSpy(this);\n\t\t\tconst pass = condition(spy, value);\n\t\t\tconst isNot = utils.flag(this, \"negate\");\n\t\t\tif (pass && isNot || !pass && !isNot) {\n\t\t\t\tconst spyName = spy.getMockName();\n\t\t\t\tconst msg = utils.getMessage(this, [\n\t\t\t\t\tpass,\n\t\t\t\t\t`expected \"${spyName}\" to ${action} with: #{exp} at least once`,\n\t\t\t\t\t`expected \"${spyName}\" to not ${action} with: #{exp}`,\n\t\t\t\t\tvalue\n\t\t\t\t]);\n\t\t\t\tconst results = action === \"return\" ? spy.mock.results : spy.mock.settledResults;\n\t\t\t\tthrow new AssertionError(formatReturns(spy, results, msg, value));\n\t\t\t}\n\t\t});\n\t});\n\t[{\n\t\tname: \"toHaveLastResolvedWith\",\n\t\tcondition: (spy, value) => {\n\t\t\tconst result = spy.mock.settledResults.at(-1);\n\t\t\treturn Boolean(result && result.type === \"fulfilled\" && equals(result.value, value));\n\t\t},\n\t\taction: \"resolve\"\n\t}, {\n\t\tname: \"toHaveLastReturnedWith\",\n\t\tcondition: (spy, value) => {\n\t\t\tconst result = spy.mock.results.at(-1);\n\t\t\treturn Boolean(result && result.type === \"return\" && equals(result.value, value));\n\t\t},\n\t\taction: \"return\"\n\t}].forEach(({ name, condition, action }) => {\n\t\tdef(name, function(value) {\n\t\t\tconst spy = getSpy(this);\n\t\t\tconst result = (action === \"return\" ? spy.mock.results : spy.mock.settledResults).at(-1);\n\t\t\tconst spyName = spy.getMockName();\n\t\t\tthis.assert(condition(spy, value), `expected last \"${spyName}\" call to ${action} #{exp}`, `expected last \"${spyName}\" call to not ${action} #{exp}`, value, result?.value);\n\t\t});\n\t});\n\t[{\n\t\tname: \"toHaveNthResolvedWith\",\n\t\tcondition: (spy, index, value) => {\n\t\t\tconst result = spy.mock.settledResults[index - 1];\n\t\t\treturn result && result.type === \"fulfilled\" && equals(result.value, value);\n\t\t},\n\t\taction: \"resolve\"\n\t}, {\n\t\tname: \"toHaveNthReturnedWith\",\n\t\tcondition: (spy, index, value) => {\n\t\t\tconst result = spy.mock.results[index - 1];\n\t\t\treturn result && result.type === \"return\" && equals(result.value, value);\n\t\t},\n\t\taction: \"return\"\n\t}].forEach(({ name, condition, action }) => {\n\t\tdef(name, function(nthCall, value) {\n\t\t\tconst spy = getSpy(this);\n\t\t\tconst spyName = spy.getMockName();\n\t\t\tconst result = (action === \"return\" ? spy.mock.results : spy.mock.settledResults)[nthCall - 1];\n\t\t\tconst ordinalCall = `${ordinal(nthCall)} call`;\n\t\t\tthis.assert(condition(spy, nthCall, value), `expected ${ordinalCall} \"${spyName}\" call to ${action} #{exp}`, `expected ${ordinalCall} \"${spyName}\" call to not ${action} #{exp}`, value, result?.value);\n\t\t});\n\t});\n\t// @ts-expect-error @internal\n\tdef(\"withContext\", function(context) {\n\t\tfor (const key in context) utils.flag(this, key, context[key]);\n\t\treturn this;\n\t});\n\tutils.addProperty(chai.Assertion.prototype, \"resolves\", function __VITEST_RESOLVES__() {\n\t\tconst error = /* @__PURE__ */ new Error(\"resolves\");\n\t\tutils.flag(this, \"promise\", \"resolves\");\n\t\tutils.flag(this, \"error\", error);\n\t\tconst test = utils.flag(this, \"vitest-test\");\n\t\tconst obj = utils.flag(this, \"object\");\n\t\tif (utils.flag(this, \"poll\")) throw new SyntaxError(`expect.poll() is not supported in combination with .resolves`);\n\t\tif (typeof obj?.then !== \"function\") throw new TypeError(`You must provide a Promise to expect() when using .resolves, not '${typeof obj}'.`);\n\t\tconst proxy = new Proxy(this, { get: (target, key, receiver) => {\n\t\t\tconst result = Reflect.get(target, key, receiver);\n\t\t\tif (typeof result !== \"function\") return result instanceof chai.Assertion ? proxy : result;\n\t\t\treturn (...args) => {\n\t\t\t\tutils.flag(this, \"_name\", key);\n\t\t\t\tconst promise = Promise.resolve(obj).then((value) => {\n\t\t\t\t\tutils.flag(this, \"object\", value);\n\t\t\t\t\treturn result.call(this, ...args);\n\t\t\t\t}, (err) => {\n\t\t\t\t\tconst _error = new AssertionError(`promise rejected \"${utils.inspect(err)}\" instead of resolving`, { showDiff: false });\n\t\t\t\t\t_error.cause = err;\n\t\t\t\t\tthrow _error;\n\t\t\t\t}).catch((err) => {\n\t\t\t\t\tif (isError(err) && error.stack) err.stack = error.stack.replace(error.message, err.message);\n\t\t\t\t\tthrow err;\n\t\t\t\t});\n\t\t\t\treturn recordAsyncExpect(test, promise, createAssertionMessage(utils, this, !!args.length), error, utils.flag(this, \"soft\"));\n\t\t\t};\n\t\t} });\n\t\treturn proxy;\n\t});\n\tutils.addProperty(chai.Assertion.prototype, \"rejects\", function __VITEST_REJECTS__() {\n\t\tconst error = /* @__PURE__ */ new Error(\"rejects\");\n\t\tutils.flag(this, \"promise\", \"rejects\");\n\t\tutils.flag(this, \"error\", error);\n\t\tconst test = utils.flag(this, \"vitest-test\");\n\t\tconst obj = utils.flag(this, \"object\");\n\t\tconst wrapper = typeof obj === \"function\" ? obj() : obj;\n\t\tif (utils.flag(this, \"poll\")) throw new SyntaxError(`expect.poll() is not supported in combination with .rejects`);\n\t\tif (typeof wrapper?.then !== \"function\") throw new TypeError(`You must provide a Promise to expect() when using .rejects, not '${typeof wrapper}'.`);\n\t\tconst proxy = new Proxy(this, { get: (target, key, receiver) => {\n\t\t\tconst result = Reflect.get(target, key, receiver);\n\t\t\tif (typeof result !== \"function\") return result instanceof chai.Assertion ? proxy : result;\n\t\t\treturn (...args) => {\n\t\t\t\tutils.flag(this, \"_name\", key);\n\t\t\t\tconst promise = Promise.resolve(wrapper).then((value) => {\n\t\t\t\t\tthrow new AssertionError(`promise resolved \"${utils.inspect(value)}\" instead of rejecting`, {\n\t\t\t\t\t\tshowDiff: true,\n\t\t\t\t\t\texpected: /* @__PURE__ */ new Error(\"rejected promise\"),\n\t\t\t\t\t\tactual: value\n\t\t\t\t\t});\n\t\t\t\t}, (err) => {\n\t\t\t\t\tutils.flag(this, \"object\", err);\n\t\t\t\t\treturn result.call(this, ...args);\n\t\t\t\t}).catch((err) => {\n\t\t\t\t\tif (isError(err) && error.stack) err.stack = error.stack.replace(error.message, err.message);\n\t\t\t\t\tthrow err;\n\t\t\t\t});\n\t\t\t\treturn recordAsyncExpect(test, promise, createAssertionMessage(utils, this, !!args.length), error, utils.flag(this, \"soft\"));\n\t\t\t};\n\t\t} });\n\t\treturn proxy;\n\t});\n};\nfunction formatCalls(spy, msg, showActualCall) {\n\tif (spy.mock.calls.length) msg += y.gray(`\\n\\nReceived:\\n\\n${spy.mock.calls.map((callArg, i) => {\n\t\tlet methodCall = y.bold(`  ${ordinal(i + 1)} ${spy.getMockName()} call:\\n\\n`);\n\t\tif (showActualCall) methodCall += diff(showActualCall, callArg, { omitAnnotationLines: true });\n\t\telse methodCall += stringify(callArg).split(\"\\n\").map((line) => `    ${line}`).join(\"\\n\");\n\t\tmethodCall += \"\\n\";\n\t\treturn methodCall;\n\t}).join(\"\\n\")}`);\n\tmsg += y.gray(`\\n\\nNumber of calls: ${y.bold(spy.mock.calls.length)}\\n`);\n\treturn msg;\n}\nfunction formatReturns(spy, results, msg, showActualReturn) {\n\tif (results.length) msg += y.gray(`\\n\\nReceived:\\n\\n${results.map((callReturn, i) => {\n\t\tlet methodCall = y.bold(`  ${ordinal(i + 1)} ${spy.getMockName()} call return:\\n\\n`);\n\t\tif (showActualReturn) methodCall += diff(showActualReturn, callReturn.value, { omitAnnotationLines: true });\n\t\telse methodCall += stringify(callReturn).split(\"\\n\").map((line) => `    ${line}`).join(\"\\n\");\n\t\tmethodCall += \"\\n\";\n\t\treturn methodCall;\n\t}).join(\"\\n\")}`);\n\tmsg += y.gray(`\\n\\nNumber of calls: ${y.bold(spy.mock.calls.length)}\\n`);\n\treturn msg;\n}\n\nfunction getMatcherState(assertion, expect) {\n\tconst obj = assertion._obj;\n\tconst isNot = util.flag(assertion, \"negate\");\n\tconst promise = util.flag(assertion, \"promise\") || \"\";\n\tconst customMessage = util.flag(assertion, \"message\");\n\tconst jestUtils = {\n\t\t...getMatcherUtils(),\n\t\tdiff,\n\t\tstringify,\n\t\titerableEquality,\n\t\tsubsetEquality\n\t};\n\tlet task = util.flag(assertion, \"vitest-test\");\n\tconst currentTestName = task?.fullTestName ?? \"\";\n\tif (task?.type !== \"test\") task = void 0;\n\tconst matcherState = {\n\t\t...getState(expect),\n\t\tcurrentTestName,\n\t\tcustomTesters: getCustomEqualityTesters(),\n\t\tisNot,\n\t\tutils: jestUtils,\n\t\tpromise,\n\t\tequals,\n\t\t// needed for built-in jest-snapshots, but we don't use it\n\t\tsuppressedErrors: [],\n\t\tsoft: util.flag(assertion, \"soft\"),\n\t\tpoll: util.flag(assertion, \"poll\"),\n\t\tassertion\n\t};\n\tObject.assign(matcherState, { task });\n\treturn {\n\t\tstate: matcherState,\n\t\tisNot,\n\t\tobj,\n\t\tcustomMessage\n\t};\n}\nclass JestExtendError extends Error {\n\tactual;\n\texpected;\n\t__vitest_error_context__;\n\tconstructor(message, actual, expected, __vitest_error_context__) {\n\t\tsuper(message);\n\t\tthis.actual = actual;\n\t\tthis.expected = expected;\n\t\tthis.__vitest_error_context__ = __vitest_error_context__;\n\t}\n}\nfunction JestExtendPlugin(c, expect, matchers) {\n\treturn (_, utils) => {\n\t\tObject.entries(matchers).forEach(([expectAssertionName, expectAssertion]) => {\n\t\t\tfunction __VITEST_EXTEND_ASSERTION__(...args) {\n\t\t\t\tconst { state, isNot, obj, customMessage } = getMatcherState(this, expect);\n\t\t\t\tconst result = expectAssertion.call(state, obj, ...args);\n\t\t\t\tif (result && typeof result === \"object\" && typeof result.then === \"function\") return result.then(({ pass, message, actual, expected, meta }) => {\n\t\t\t\t\tif (pass && isNot || !pass && !isNot) {\n\t\t\t\t\t\tconst errorMessage = (customMessage ? `${customMessage}: ` : \"\") + message();\n\t\t\t\t\t\tthrow new JestExtendError(errorMessage, actual, expected, {\n\t\t\t\t\t\t\tassertionName: expectAssertionName,\n\t\t\t\t\t\t\tmeta\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t\tconst { pass, message, actual, expected, meta } = result;\n\t\t\t\tif (pass && isNot || !pass && !isNot) {\n\t\t\t\t\tconst errorMessage = (customMessage ? `${customMessage}: ` : \"\") + message();\n\t\t\t\t\tthrow new JestExtendError(errorMessage, actual, expected, {\n\t\t\t\t\t\tassertionName: expectAssertionName,\n\t\t\t\t\t\tmeta\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\t\t\tconst softWrapper = wrapAssertion(utils, expectAssertionName, __VITEST_EXTEND_ASSERTION__);\n\t\t\tutils.addMethod(globalThis[JEST_MATCHERS_OBJECT].matchers, expectAssertionName, softWrapper);\n\t\t\tutils.addMethod(c.Assertion.prototype, expectAssertionName, softWrapper);\n\t\t\t// `expect.poll()` inspects the installed Chai assertion method,\n\t\t\t// so copy the internal marker from the original matcher function.\n\t\t\t// this is only for domain snapshot matchers for now.\n\t\t\tif (expectAssertion.__vitest_poll_takeover__) {\n\t\t\t\tconst addedMethod = c.Assertion.prototype[expectAssertionName];\n\t\t\t\tObject.defineProperty(addedMethod, \"__vitest_poll_takeover__\", { value: true });\n\t\t\t}\n\t\t\tclass CustomMatcher extends AsymmetricMatcher {\n\t\t\t\tconstructor(inverse = false, ...sample) {\n\t\t\t\t\tsuper(sample, inverse);\n\t\t\t\t}\n\t\t\t\tasymmetricMatch(other) {\n\t\t\t\t\tconst { pass } = expectAssertion.call(this.getMatcherContext(expect), other, ...this.sample);\n\t\t\t\t\treturn this.inverse ? !pass : pass;\n\t\t\t\t}\n\t\t\t\ttoString() {\n\t\t\t\t\treturn `${this.inverse ? \"not.\" : \"\"}${expectAssertionName}`;\n\t\t\t\t}\n\t\t\t\tgetExpectedType() {\n\t\t\t\t\treturn \"any\";\n\t\t\t\t}\n\t\t\t\ttoAsymmetricMatcher() {\n\t\t\t\t\treturn `${this.toString()}<${this.sample.map((item) => stringify(item)).join(\", \")}>`;\n\t\t\t\t}\n\t\t\t}\n\t\t\tconst customMatcher = (...sample) => new CustomMatcher(false, ...sample);\n\t\t\tObject.defineProperty(expect, expectAssertionName, {\n\t\t\t\tconfigurable: true,\n\t\t\t\tenumerable: true,\n\t\t\t\tvalue: customMatcher,\n\t\t\t\twritable: true\n\t\t\t});\n\t\t\tObject.defineProperty(expect.not, expectAssertionName, {\n\t\t\t\tconfigurable: true,\n\t\t\t\tenumerable: true,\n\t\t\t\tvalue: (...sample) => new CustomMatcher(true, ...sample),\n\t\t\t\twritable: true\n\t\t\t});\n\t\t\t// keep track of asymmetric matchers on global so that it can be copied over to local context's `expect`.\n\t\t\t// note that the negated variant is automatically shared since it's assigned on the single `expect.not` object.\n\t\t\tObject.defineProperty(globalThis[ASYMMETRIC_MATCHERS_OBJECT], expectAssertionName, {\n\t\t\t\tconfigurable: true,\n\t\t\t\tenumerable: true,\n\t\t\t\tvalue: customMatcher,\n\t\t\t\twritable: true\n\t\t\t});\n\t\t});\n\t};\n}\nconst JestExtend = (chai, utils) => {\n\tutils.addMethod(chai.expect, \"extend\", (expect, expects) => {\n\t\tuse(JestExtendPlugin(chai, expect, expects));\n\t});\n};\n\nfunction isBenchResult(value) {\n\treturn typeof value === \"object\" && value !== null && \"latency\" in value && typeof value.latency?.mean === \"number\";\n}\nfunction formatOps(ops) {\n\treturn ops.toLocaleString(\"en-US\", {\n\t\tminimumFractionDigits: 2,\n\t\tmaximumFractionDigits: 2\n\t});\n}\nconst benchMatchers = {\n\ttoBeFasterThan(actual, expected, options) {\n\t\tconst { matcherHint, RECEIVED_COLOR, EXPECTED_COLOR } = this.utils;\n\t\tconst delta = options?.delta ?? 0;\n\t\tif (!isBenchResult(actual)) throw new TypeError(`${matcherHint(\".toBeFasterThan\")} expects the actual value to be a benchmark result.`);\n\t\tif (!isBenchResult(expected)) throw new TypeError(`${matcherHint(\".toBeFasterThan\")} expects the expected value to be a benchmark result.`);\n\t\tconst threshold = expected.latency.mean * (1 - delta);\n\t\tconst pass = actual.latency.mean < threshold;\n\t\treturn {\n\t\t\tpass,\n\t\t\tmessage: () => {\n\t\t\t\tconst relation = ((actual.latency.mean - expected.latency.mean) / expected.latency.mean * 100).toFixed(2);\n\t\t\t\treturn pass ? `${matcherHint(\".not.toBeFasterThan\")}\\n\\nExpected to not be faster, but was ${Math.abs(Number(relation))}% faster.\\n\\nReceived: ${RECEIVED_COLOR(formatOps(actual.throughput.mean))} ops/sec\\nExpected: ${EXPECTED_COLOR(formatOps(expected.throughput.mean))} ops/sec\\n` : `${matcherHint(\".toBeFasterThan\")}\\n\\nExpected to be faster${delta > 0 ? ` by at least ${(delta * 100).toFixed(0)}%` : \"\"}, but was ${Number(relation) > 0 ? `${relation}% slower` : `only ${Math.abs(Number(relation))}% faster`}.\\n\\nReceived: ${RECEIVED_COLOR(formatOps(actual.throughput.mean))} ops/sec\\nExpected: ${EXPECTED_COLOR(formatOps(expected.throughput.mean))} ops/sec\\n`;\n\t\t\t}\n\t\t};\n\t},\n\ttoBeSlowerThan(actual, expected, options) {\n\t\tconst { matcherHint, RECEIVED_COLOR, EXPECTED_COLOR } = this.utils;\n\t\tconst delta = options?.delta ?? 0;\n\t\tif (!isBenchResult(actual)) throw new TypeError(`${matcherHint(\".toBeSlowerThan\")} expects the actual value to be a benchmark result.`);\n\t\tif (!isBenchResult(expected)) throw new TypeError(`${matcherHint(\".toBeSlowerThan\")} expects the expected value to be a benchmark result.`);\n\t\tconst threshold = expected.latency.mean * (1 + delta);\n\t\tconst pass = actual.latency.mean > threshold;\n\t\treturn {\n\t\t\tpass,\n\t\t\tmessage: () => {\n\t\t\t\tconst relation = ((actual.latency.mean - expected.latency.mean) / expected.latency.mean * 100).toFixed(2);\n\t\t\t\treturn pass ? `${matcherHint(\".not.toBeSlowerThan\")}\\n\\nExpected to not be slower, but was ${relation}% slower.\\n\\nReceived: ${RECEIVED_COLOR(formatOps(actual.throughput.mean))} ops/sec\\nExpected: ${EXPECTED_COLOR(formatOps(expected.throughput.mean))} ops/sec\\n` : `${matcherHint(\".toBeSlowerThan\")}\\n\\nExpected to be slower${delta > 0 ? ` by at least ${(delta * 100).toFixed(0)}%` : \"\"}, but was ${Number(relation) < 0 ? `${Math.abs(Number(relation))}% faster` : `only ${relation}% slower`}.\\n\\nReceived: ${RECEIVED_COLOR(formatOps(actual.throughput.mean))} ops/sec\\nExpected: ${EXPECTED_COLOR(formatOps(expected.throughput.mean))} ops/sec\\n`;\n\t\t\t}\n\t\t};\n\t}\n};\n\nvar fakeTimersSrc = {};\n\nvar global;\nvar hasRequiredGlobal;\n\nfunction requireGlobal () {\n\tif (hasRequiredGlobal) return global;\n\thasRequiredGlobal = 1;\n\n\t/**\n\t * A reference to the global object\n\t * @type {object} globalObject\n\t */\n\tvar globalObject;\n\n\t/* istanbul ignore else */\n\tif (typeof commonjsGlobal !== \"undefined\") {\n\t    // Node\n\t    globalObject = commonjsGlobal;\n\t} else if (typeof window !== \"undefined\") {\n\t    // Browser\n\t    globalObject = window;\n\t} else {\n\t    // WebWorker\n\t    globalObject = self;\n\t}\n\n\tglobal = globalObject;\n\treturn global;\n}\n\nvar throwsOnProto_1;\nvar hasRequiredThrowsOnProto;\n\nfunction requireThrowsOnProto () {\n\tif (hasRequiredThrowsOnProto) return throwsOnProto_1;\n\thasRequiredThrowsOnProto = 1;\n\n\t/**\n\t * Is true when the environment causes an error to be thrown for accessing the\n\t * __proto__ property.\n\t * This is necessary in order to support `node --disable-proto=throw`.\n\t *\n\t * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/proto\n\t * @type {boolean}\n\t */\n\tlet throwsOnProto;\n\ttry {\n\t    const object = {};\n\t    // eslint-disable-next-line no-proto, no-unused-expressions\n\t    object.__proto__;\n\t    throwsOnProto = false;\n\t} catch (_) {\n\t    // This branch is covered when tests are run with `--disable-proto=throw`,\n\t    // however we can test both branches at the same time, so this is ignored\n\t    /* istanbul ignore next */\n\t    throwsOnProto = true;\n\t}\n\n\tthrowsOnProto_1 = throwsOnProto;\n\treturn throwsOnProto_1;\n}\n\nvar copyPrototypeMethods;\nvar hasRequiredCopyPrototypeMethods;\n\nfunction requireCopyPrototypeMethods () {\n\tif (hasRequiredCopyPrototypeMethods) return copyPrototypeMethods;\n\thasRequiredCopyPrototypeMethods = 1;\n\n\tvar call = Function.call;\n\tvar throwsOnProto = requireThrowsOnProto();\n\n\tvar disallowedProperties = [\n\t    // ignore size because it throws from Map\n\t    \"size\",\n\t    \"caller\",\n\t    \"callee\",\n\t    \"arguments\",\n\t];\n\n\t// This branch is covered when tests are run with `--disable-proto=throw`,\n\t// however we can test both branches at the same time, so this is ignored\n\t/* istanbul ignore next */\n\tif (throwsOnProto) {\n\t    disallowedProperties.push(\"__proto__\");\n\t}\n\n\tcopyPrototypeMethods = function copyPrototypeMethods(prototype) {\n\t    // eslint-disable-next-line @sinonjs/no-prototype-methods/no-prototype-methods\n\t    return Object.getOwnPropertyNames(prototype).reduce(function (\n\t        result,\n\t        name\n\t    ) {\n\t        if (disallowedProperties.includes(name)) {\n\t            return result;\n\t        }\n\n\t        if (typeof prototype[name] !== \"function\") {\n\t            return result;\n\t        }\n\n\t        result[name] = call.bind(prototype[name]);\n\n\t        return result;\n\t    },\n\t    Object.create(null));\n\t};\n\treturn copyPrototypeMethods;\n}\n\nvar array;\nvar hasRequiredArray;\n\nfunction requireArray () {\n\tif (hasRequiredArray) return array;\n\thasRequiredArray = 1;\n\n\tvar copyPrototype = requireCopyPrototypeMethods();\n\n\tarray = copyPrototype(Array.prototype);\n\treturn array;\n}\n\nvar calledInOrder_1;\nvar hasRequiredCalledInOrder;\n\nfunction requireCalledInOrder () {\n\tif (hasRequiredCalledInOrder) return calledInOrder_1;\n\thasRequiredCalledInOrder = 1;\n\n\tvar every = requireArray().every;\n\n\t/**\n\t * @private\n\t */\n\tfunction hasCallsLeft(callMap, spy) {\n\t    if (callMap[spy.id] === undefined) {\n\t        callMap[spy.id] = 0;\n\t    }\n\n\t    return callMap[spy.id] < spy.callCount;\n\t}\n\n\t/**\n\t * @private\n\t */\n\tfunction checkAdjacentCalls(callMap, spy, index, spies) {\n\t    var calledBeforeNext = true;\n\n\t    if (index !== spies.length - 1) {\n\t        calledBeforeNext = spy.calledBefore(spies[index + 1]);\n\t    }\n\n\t    if (hasCallsLeft(callMap, spy) && calledBeforeNext) {\n\t        callMap[spy.id] += 1;\n\t        return true;\n\t    }\n\n\t    return false;\n\t}\n\n\t/**\n\t * A Sinon proxy object (fake, spy, stub)\n\t * @typedef {object} SinonProxy\n\t * @property {Function} calledBefore - A method that determines if this proxy was called before another one\n\t * @property {string} id - Some id\n\t * @property {number} callCount - Number of times this proxy has been called\n\t */\n\n\t/**\n\t * Returns true when the spies have been called in the order they were supplied in\n\t * @param  {SinonProxy[] | SinonProxy} spies An array of proxies, or several proxies as arguments\n\t * @returns {boolean} true when spies are called in order, false otherwise\n\t */\n\tfunction calledInOrder(spies) {\n\t    var callMap = {};\n\t    // eslint-disable-next-line no-underscore-dangle\n\t    var _spies = arguments.length > 1 ? arguments : spies;\n\n\t    return every(_spies, checkAdjacentCalls.bind(null, callMap));\n\t}\n\n\tcalledInOrder_1 = calledInOrder;\n\treturn calledInOrder_1;\n}\n\nvar className_1;\nvar hasRequiredClassName;\n\nfunction requireClassName () {\n\tif (hasRequiredClassName) return className_1;\n\thasRequiredClassName = 1;\n\n\t/**\n\t * Returns a display name for a value from a constructor\n\t * @param  {object} value A value to examine\n\t * @returns {(string|null)} A string or null\n\t */\n\tfunction className(value) {\n\t    const name = value.constructor && value.constructor.name;\n\t    return name || null;\n\t}\n\n\tclassName_1 = className;\n\treturn className_1;\n}\n\nvar deprecated = {};\n\n/* eslint-disable no-console */\n\nvar hasRequiredDeprecated;\n\nfunction requireDeprecated () {\n\tif (hasRequiredDeprecated) return deprecated;\n\thasRequiredDeprecated = 1;\n\t(function (exports) {\n\n\t\t/**\n\t\t * Returns a function that will invoke the supplied function and print a\n\t\t * deprecation warning to the console each time it is called.\n\t\t * @param  {Function} func\n\t\t * @param  {string} msg\n\t\t * @returns {Function}\n\t\t */\n\t\texports.wrap = function (func, msg) {\n\t\t    var wrapped = function () {\n\t\t        exports.printWarning(msg);\n\t\t        return func.apply(this, arguments);\n\t\t    };\n\t\t    if (func.prototype) {\n\t\t        wrapped.prototype = func.prototype;\n\t\t    }\n\t\t    return wrapped;\n\t\t};\n\n\t\t/**\n\t\t * Returns a string which can be supplied to `wrap()` to notify the user that a\n\t\t * particular part of the sinon API has been deprecated.\n\t\t * @param  {string} packageName\n\t\t * @param  {string} funcName\n\t\t * @returns {string}\n\t\t */\n\t\texports.defaultMsg = function (packageName, funcName) {\n\t\t    return `${packageName}.${funcName} is deprecated and will be removed from the public API in a future version of ${packageName}.`;\n\t\t};\n\n\t\t/**\n\t\t * Prints a warning on the console, when it exists\n\t\t * @param  {string} msg\n\t\t * @returns {undefined}\n\t\t */\n\t\texports.printWarning = function (msg) {\n\t\t    /* istanbul ignore next */\n\t\t    if (typeof process === \"object\" && process.emitWarning) {\n\t\t        // Emit Warnings in Node\n\t\t        process.emitWarning(msg);\n\t\t    } else if (console.info) {\n\t\t        console.info(msg);\n\t\t    } else {\n\t\t        console.log(msg);\n\t\t    }\n\t\t}; \n\t} (deprecated));\n\treturn deprecated;\n}\n\nvar every;\nvar hasRequiredEvery;\n\nfunction requireEvery () {\n\tif (hasRequiredEvery) return every;\n\thasRequiredEvery = 1;\n\n\t/**\n\t * Returns true when fn returns true for all members of obj.\n\t * This is an every implementation that works for all iterables\n\t * @param  {object}   obj\n\t * @param  {Function} fn\n\t * @returns {boolean}\n\t */\n\tevery = function every(obj, fn) {\n\t    var pass = true;\n\n\t    try {\n\t        // eslint-disable-next-line @sinonjs/no-prototype-methods/no-prototype-methods\n\t        obj.forEach(function () {\n\t            if (!fn.apply(this, arguments)) {\n\t                // Throwing an error is the only way to break `forEach`\n\t                throw new Error();\n\t            }\n\t        });\n\t    } catch (e) {\n\t        pass = false;\n\t    }\n\n\t    return pass;\n\t};\n\treturn every;\n}\n\nvar functionName;\nvar hasRequiredFunctionName;\n\nfunction requireFunctionName () {\n\tif (hasRequiredFunctionName) return functionName;\n\thasRequiredFunctionName = 1;\n\n\t/**\n\t * Returns a display name for a function\n\t * @param  {Function} func\n\t * @returns {string}\n\t */\n\tfunctionName = function functionName(func) {\n\t    if (!func) {\n\t        return \"\";\n\t    }\n\n\t    try {\n\t        return (\n\t            func.displayName ||\n\t            func.name ||\n\t            // Use function decomposition as a last resort to get function\n\t            // name. Does not rely on function decomposition to work - if it\n\t            // doesn't debugging will be slightly less informative\n\t            // (i.e. toString will say 'spy' rather than 'myFunc').\n\t            (String(func).match(/function ([^\\s(]+)/) || [])[1]\n\t        );\n\t    } catch (e) {\n\t        // Stringify may fail and we might get an exception, as a last-last\n\t        // resort fall back to empty string.\n\t        return \"\";\n\t    }\n\t};\n\treturn functionName;\n}\n\nvar orderByFirstCall_1;\nvar hasRequiredOrderByFirstCall;\n\nfunction requireOrderByFirstCall () {\n\tif (hasRequiredOrderByFirstCall) return orderByFirstCall_1;\n\thasRequiredOrderByFirstCall = 1;\n\n\tvar sort = requireArray().sort;\n\tvar slice = requireArray().slice;\n\n\t/**\n\t * @private\n\t */\n\tfunction comparator(a, b) {\n\t    // uuid, won't ever be equal\n\t    var aCall = a.getCall(0);\n\t    var bCall = b.getCall(0);\n\t    var aId = (aCall && aCall.callId) || -1;\n\t    var bId = (bCall && bCall.callId) || -1;\n\n\t    return aId < bId ? -1 : 1;\n\t}\n\n\t/**\n\t * A Sinon proxy object (fake, spy, stub)\n\t * @typedef {object} SinonProxy\n\t * @property {Function} getCall - A method that can return the first call\n\t */\n\n\t/**\n\t * Sorts an array of SinonProxy instances (fake, spy, stub) by their first call\n\t * @param  {SinonProxy[] | SinonProxy} spies\n\t * @returns {SinonProxy[]}\n\t */\n\tfunction orderByFirstCall(spies) {\n\t    return sort(slice(spies), comparator);\n\t}\n\n\torderByFirstCall_1 = orderByFirstCall;\n\treturn orderByFirstCall_1;\n}\n\nvar _function;\nvar hasRequired_function;\n\nfunction require_function () {\n\tif (hasRequired_function) return _function;\n\thasRequired_function = 1;\n\n\tvar copyPrototype = requireCopyPrototypeMethods();\n\n\t_function = copyPrototype(Function.prototype);\n\treturn _function;\n}\n\nvar map;\nvar hasRequiredMap;\n\nfunction requireMap () {\n\tif (hasRequiredMap) return map;\n\thasRequiredMap = 1;\n\n\tvar copyPrototype = requireCopyPrototypeMethods();\n\n\tmap = copyPrototype(Map.prototype);\n\treturn map;\n}\n\nvar object;\nvar hasRequiredObject;\n\nfunction requireObject () {\n\tif (hasRequiredObject) return object;\n\thasRequiredObject = 1;\n\n\tvar copyPrototype = requireCopyPrototypeMethods();\n\n\tobject = copyPrototype(Object.prototype);\n\treturn object;\n}\n\nvar set;\nvar hasRequiredSet;\n\nfunction requireSet () {\n\tif (hasRequiredSet) return set;\n\thasRequiredSet = 1;\n\n\tvar copyPrototype = requireCopyPrototypeMethods();\n\n\tset = copyPrototype(Set.prototype);\n\treturn set;\n}\n\nvar string;\nvar hasRequiredString;\n\nfunction requireString () {\n\tif (hasRequiredString) return string;\n\thasRequiredString = 1;\n\n\tvar copyPrototype = requireCopyPrototypeMethods();\n\n\tstring = copyPrototype(String.prototype);\n\treturn string;\n}\n\nvar prototypes;\nvar hasRequiredPrototypes;\n\nfunction requirePrototypes () {\n\tif (hasRequiredPrototypes) return prototypes;\n\thasRequiredPrototypes = 1;\n\n\tprototypes = {\n\t    array: requireArray(),\n\t    function: require_function(),\n\t    map: requireMap(),\n\t    object: requireObject(),\n\t    set: requireSet(),\n\t    string: requireString(),\n\t};\n\treturn prototypes;\n}\n\nvar typeDetect$1 = {exports: {}};\n\nvar typeDetect = typeDetect$1.exports;\n\nvar hasRequiredTypeDetect;\n\nfunction requireTypeDetect () {\n\tif (hasRequiredTypeDetect) return typeDetect$1.exports;\n\thasRequiredTypeDetect = 1;\n\t(function (module, exports) {\n\t\t(function (global, factory) {\n\t\t\tmodule.exports = factory() ;\n\t\t}(typeDetect, (function () {\n\t\t/* !\n\t\t * type-detect\n\t\t * Copyright(c) 2013 jake luer <jake@alogicalparadox.com>\n\t\t * MIT Licensed\n\t\t */\n\t\tvar promiseExists = typeof Promise === 'function';\n\n\t\t/* eslint-disable no-undef */\n\t\tvar globalObject = typeof self === 'object' ? self : commonjsGlobal; // eslint-disable-line id-blacklist\n\n\t\tvar symbolExists = typeof Symbol !== 'undefined';\n\t\tvar mapExists = typeof Map !== 'undefined';\n\t\tvar setExists = typeof Set !== 'undefined';\n\t\tvar weakMapExists = typeof WeakMap !== 'undefined';\n\t\tvar weakSetExists = typeof WeakSet !== 'undefined';\n\t\tvar dataViewExists = typeof DataView !== 'undefined';\n\t\tvar symbolIteratorExists = symbolExists && typeof Symbol.iterator !== 'undefined';\n\t\tvar symbolToStringTagExists = symbolExists && typeof Symbol.toStringTag !== 'undefined';\n\t\tvar setEntriesExists = setExists && typeof Set.prototype.entries === 'function';\n\t\tvar mapEntriesExists = mapExists && typeof Map.prototype.entries === 'function';\n\t\tvar setIteratorPrototype = setEntriesExists && Object.getPrototypeOf(new Set().entries());\n\t\tvar mapIteratorPrototype = mapEntriesExists && Object.getPrototypeOf(new Map().entries());\n\t\tvar arrayIteratorExists = symbolIteratorExists && typeof Array.prototype[Symbol.iterator] === 'function';\n\t\tvar arrayIteratorPrototype = arrayIteratorExists && Object.getPrototypeOf([][Symbol.iterator]());\n\t\tvar stringIteratorExists = symbolIteratorExists && typeof String.prototype[Symbol.iterator] === 'function';\n\t\tvar stringIteratorPrototype = stringIteratorExists && Object.getPrototypeOf(''[Symbol.iterator]());\n\t\tvar toStringLeftSliceLength = 8;\n\t\tvar toStringRightSliceLength = -1;\n\t\t/**\n\t\t * ### typeOf (obj)\n\t\t *\n\t\t * Uses `Object.prototype.toString` to determine the type of an object,\n\t\t * normalising behaviour across engine versions & well optimised.\n\t\t *\n\t\t * @param {Mixed} object\n\t\t * @return {String} object type\n\t\t * @api public\n\t\t */\n\t\tfunction typeDetect(obj) {\n\t\t  /* ! Speed optimisation\n\t\t   * Pre:\n\t\t   *   string literal     x 3,039,035 ops/sec ±1.62% (78 runs sampled)\n\t\t   *   boolean literal    x 1,424,138 ops/sec ±4.54% (75 runs sampled)\n\t\t   *   number literal     x 1,653,153 ops/sec ±1.91% (82 runs sampled)\n\t\t   *   undefined          x 9,978,660 ops/sec ±1.92% (75 runs sampled)\n\t\t   *   function           x 2,556,769 ops/sec ±1.73% (77 runs sampled)\n\t\t   * Post:\n\t\t   *   string literal     x 38,564,796 ops/sec ±1.15% (79 runs sampled)\n\t\t   *   boolean literal    x 31,148,940 ops/sec ±1.10% (79 runs sampled)\n\t\t   *   number literal     x 32,679,330 ops/sec ±1.90% (78 runs sampled)\n\t\t   *   undefined          x 32,363,368 ops/sec ±1.07% (82 runs sampled)\n\t\t   *   function           x 31,296,870 ops/sec ±0.96% (83 runs sampled)\n\t\t   */\n\t\t  var typeofObj = typeof obj;\n\t\t  if (typeofObj !== 'object') {\n\t\t    return typeofObj;\n\t\t  }\n\n\t\t  /* ! Speed optimisation\n\t\t   * Pre:\n\t\t   *   null               x 28,645,765 ops/sec ±1.17% (82 runs sampled)\n\t\t   * Post:\n\t\t   *   null               x 36,428,962 ops/sec ±1.37% (84 runs sampled)\n\t\t   */\n\t\t  if (obj === null) {\n\t\t    return 'null';\n\t\t  }\n\n\t\t  /* ! Spec Conformance\n\t\t   * Test: `Object.prototype.toString.call(window)``\n\t\t   *  - Node === \"[object global]\"\n\t\t   *  - Chrome === \"[object global]\"\n\t\t   *  - Firefox === \"[object Window]\"\n\t\t   *  - PhantomJS === \"[object Window]\"\n\t\t   *  - Safari === \"[object Window]\"\n\t\t   *  - IE 11 === \"[object Window]\"\n\t\t   *  - IE Edge === \"[object Window]\"\n\t\t   * Test: `Object.prototype.toString.call(this)``\n\t\t   *  - Chrome Worker === \"[object global]\"\n\t\t   *  - Firefox Worker === \"[object DedicatedWorkerGlobalScope]\"\n\t\t   *  - Safari Worker === \"[object DedicatedWorkerGlobalScope]\"\n\t\t   *  - IE 11 Worker === \"[object WorkerGlobalScope]\"\n\t\t   *  - IE Edge Worker === \"[object WorkerGlobalScope]\"\n\t\t   */\n\t\t  if (obj === globalObject) {\n\t\t    return 'global';\n\t\t  }\n\n\t\t  /* ! Speed optimisation\n\t\t   * Pre:\n\t\t   *   array literal      x 2,888,352 ops/sec ±0.67% (82 runs sampled)\n\t\t   * Post:\n\t\t   *   array literal      x 22,479,650 ops/sec ±0.96% (81 runs sampled)\n\t\t   */\n\t\t  if (\n\t\t    Array.isArray(obj) &&\n\t\t    (symbolToStringTagExists === false || !(Symbol.toStringTag in obj))\n\t\t  ) {\n\t\t    return 'Array';\n\t\t  }\n\n\t\t  // Not caching existence of `window` and related properties due to potential\n\t\t  // for `window` to be unset before tests in quasi-browser environments.\n\t\t  if (typeof window === 'object' && window !== null) {\n\t\t    /* ! Spec Conformance\n\t\t     * (https://html.spec.whatwg.org/multipage/browsers.html#location)\n\t\t     * WhatWG HTML$7.7.3 - The `Location` interface\n\t\t     * Test: `Object.prototype.toString.call(window.location)``\n\t\t     *  - IE <=11 === \"[object Object]\"\n\t\t     *  - IE Edge <=13 === \"[object Object]\"\n\t\t     */\n\t\t    if (typeof window.location === 'object' && obj === window.location) {\n\t\t      return 'Location';\n\t\t    }\n\n\t\t    /* ! Spec Conformance\n\t\t     * (https://html.spec.whatwg.org/#document)\n\t\t     * WhatWG HTML$3.1.1 - The `Document` object\n\t\t     * Note: Most browsers currently adher to the W3C DOM Level 2 spec\n\t\t     *       (https://www.w3.org/TR/DOM-Level-2-HTML/html.html#ID-26809268)\n\t\t     *       which suggests that browsers should use HTMLTableCellElement for\n\t\t     *       both TD and TH elements. WhatWG separates these.\n\t\t     *       WhatWG HTML states:\n\t\t     *         > For historical reasons, Window objects must also have a\n\t\t     *         > writable, configurable, non-enumerable property named\n\t\t     *         > HTMLDocument whose value is the Document interface object.\n\t\t     * Test: `Object.prototype.toString.call(document)``\n\t\t     *  - Chrome === \"[object HTMLDocument]\"\n\t\t     *  - Firefox === \"[object HTMLDocument]\"\n\t\t     *  - Safari === \"[object HTMLDocument]\"\n\t\t     *  - IE <=10 === \"[object Document]\"\n\t\t     *  - IE 11 === \"[object HTMLDocument]\"\n\t\t     *  - IE Edge <=13 === \"[object HTMLDocument]\"\n\t\t     */\n\t\t    if (typeof window.document === 'object' && obj === window.document) {\n\t\t      return 'Document';\n\t\t    }\n\n\t\t    if (typeof window.navigator === 'object') {\n\t\t      /* ! Spec Conformance\n\t\t       * (https://html.spec.whatwg.org/multipage/webappapis.html#mimetypearray)\n\t\t       * WhatWG HTML$8.6.1.5 - Plugins - Interface MimeTypeArray\n\t\t       * Test: `Object.prototype.toString.call(navigator.mimeTypes)``\n\t\t       *  - IE <=10 === \"[object MSMimeTypesCollection]\"\n\t\t       */\n\t\t      if (typeof window.navigator.mimeTypes === 'object' &&\n\t\t          obj === window.navigator.mimeTypes) {\n\t\t        return 'MimeTypeArray';\n\t\t      }\n\n\t\t      /* ! Spec Conformance\n\t\t       * (https://html.spec.whatwg.org/multipage/webappapis.html#pluginarray)\n\t\t       * WhatWG HTML$8.6.1.5 - Plugins - Interface PluginArray\n\t\t       * Test: `Object.prototype.toString.call(navigator.plugins)``\n\t\t       *  - IE <=10 === \"[object MSPluginsCollection]\"\n\t\t       */\n\t\t      if (typeof window.navigator.plugins === 'object' &&\n\t\t          obj === window.navigator.plugins) {\n\t\t        return 'PluginArray';\n\t\t      }\n\t\t    }\n\n\t\t    if ((typeof window.HTMLElement === 'function' ||\n\t\t        typeof window.HTMLElement === 'object') &&\n\t\t        obj instanceof window.HTMLElement) {\n\t\t      /* ! Spec Conformance\n\t\t      * (https://html.spec.whatwg.org/multipage/webappapis.html#pluginarray)\n\t\t      * WhatWG HTML$4.4.4 - The `blockquote` element - Interface `HTMLQuoteElement`\n\t\t      * Test: `Object.prototype.toString.call(document.createElement('blockquote'))``\n\t\t      *  - IE <=10 === \"[object HTMLBlockElement]\"\n\t\t      */\n\t\t      if (obj.tagName === 'BLOCKQUOTE') {\n\t\t        return 'HTMLQuoteElement';\n\t\t      }\n\n\t\t      /* ! Spec Conformance\n\t\t       * (https://html.spec.whatwg.org/#htmltabledatacellelement)\n\t\t       * WhatWG HTML$4.9.9 - The `td` element - Interface `HTMLTableDataCellElement`\n\t\t       * Note: Most browsers currently adher to the W3C DOM Level 2 spec\n\t\t       *       (https://www.w3.org/TR/DOM-Level-2-HTML/html.html#ID-82915075)\n\t\t       *       which suggests that browsers should use HTMLTableCellElement for\n\t\t       *       both TD and TH elements. WhatWG separates these.\n\t\t       * Test: Object.prototype.toString.call(document.createElement('td'))\n\t\t       *  - Chrome === \"[object HTMLTableCellElement]\"\n\t\t       *  - Firefox === \"[object HTMLTableCellElement]\"\n\t\t       *  - Safari === \"[object HTMLTableCellElement]\"\n\t\t       */\n\t\t      if (obj.tagName === 'TD') {\n\t\t        return 'HTMLTableDataCellElement';\n\t\t      }\n\n\t\t      /* ! Spec Conformance\n\t\t       * (https://html.spec.whatwg.org/#htmltableheadercellelement)\n\t\t       * WhatWG HTML$4.9.9 - The `td` element - Interface `HTMLTableHeaderCellElement`\n\t\t       * Note: Most browsers currently adher to the W3C DOM Level 2 spec\n\t\t       *       (https://www.w3.org/TR/DOM-Level-2-HTML/html.html#ID-82915075)\n\t\t       *       which suggests that browsers should use HTMLTableCellElement for\n\t\t       *       both TD and TH elements. WhatWG separates these.\n\t\t       * Test: Object.prototype.toString.call(document.createElement('th'))\n\t\t       *  - Chrome === \"[object HTMLTableCellElement]\"\n\t\t       *  - Firefox === \"[object HTMLTableCellElement]\"\n\t\t       *  - Safari === \"[object HTMLTableCellElement]\"\n\t\t       */\n\t\t      if (obj.tagName === 'TH') {\n\t\t        return 'HTMLTableHeaderCellElement';\n\t\t      }\n\t\t    }\n\t\t  }\n\n\t\t  /* ! Speed optimisation\n\t\t  * Pre:\n\t\t  *   Float64Array       x 625,644 ops/sec ±1.58% (80 runs sampled)\n\t\t  *   Float32Array       x 1,279,852 ops/sec ±2.91% (77 runs sampled)\n\t\t  *   Uint32Array        x 1,178,185 ops/sec ±1.95% (83 runs sampled)\n\t\t  *   Uint16Array        x 1,008,380 ops/sec ±2.25% (80 runs sampled)\n\t\t  *   Uint8Array         x 1,128,040 ops/sec ±2.11% (81 runs sampled)\n\t\t  *   Int32Array         x 1,170,119 ops/sec ±2.88% (80 runs sampled)\n\t\t  *   Int16Array         x 1,176,348 ops/sec ±5.79% (86 runs sampled)\n\t\t  *   Int8Array          x 1,058,707 ops/sec ±4.94% (77 runs sampled)\n\t\t  *   Uint8ClampedArray  x 1,110,633 ops/sec ±4.20% (80 runs sampled)\n\t\t  * Post:\n\t\t  *   Float64Array       x 7,105,671 ops/sec ±13.47% (64 runs sampled)\n\t\t  *   Float32Array       x 5,887,912 ops/sec ±1.46% (82 runs sampled)\n\t\t  *   Uint32Array        x 6,491,661 ops/sec ±1.76% (79 runs sampled)\n\t\t  *   Uint16Array        x 6,559,795 ops/sec ±1.67% (82 runs sampled)\n\t\t  *   Uint8Array         x 6,463,966 ops/sec ±1.43% (85 runs sampled)\n\t\t  *   Int32Array         x 5,641,841 ops/sec ±3.49% (81 runs sampled)\n\t\t  *   Int16Array         x 6,583,511 ops/sec ±1.98% (80 runs sampled)\n\t\t  *   Int8Array          x 6,606,078 ops/sec ±1.74% (81 runs sampled)\n\t\t  *   Uint8ClampedArray  x 6,602,224 ops/sec ±1.77% (83 runs sampled)\n\t\t  */\n\t\t  var stringTag = (symbolToStringTagExists && obj[Symbol.toStringTag]);\n\t\t  if (typeof stringTag === 'string') {\n\t\t    return stringTag;\n\t\t  }\n\n\t\t  var objPrototype = Object.getPrototypeOf(obj);\n\t\t  /* ! Speed optimisation\n\t\t  * Pre:\n\t\t  *   regex literal      x 1,772,385 ops/sec ±1.85% (77 runs sampled)\n\t\t  *   regex constructor  x 2,143,634 ops/sec ±2.46% (78 runs sampled)\n\t\t  * Post:\n\t\t  *   regex literal      x 3,928,009 ops/sec ±0.65% (78 runs sampled)\n\t\t  *   regex constructor  x 3,931,108 ops/sec ±0.58% (84 runs sampled)\n\t\t  */\n\t\t  if (objPrototype === RegExp.prototype) {\n\t\t    return 'RegExp';\n\t\t  }\n\n\t\t  /* ! Speed optimisation\n\t\t  * Pre:\n\t\t  *   date               x 2,130,074 ops/sec ±4.42% (68 runs sampled)\n\t\t  * Post:\n\t\t  *   date               x 3,953,779 ops/sec ±1.35% (77 runs sampled)\n\t\t  */\n\t\t  if (objPrototype === Date.prototype) {\n\t\t    return 'Date';\n\t\t  }\n\n\t\t  /* ! Spec Conformance\n\t\t   * (http://www.ecma-international.org/ecma-262/6.0/index.html#sec-promise.prototype-@@tostringtag)\n\t\t   * ES6$25.4.5.4 - Promise.prototype[@@toStringTag] should be \"Promise\":\n\t\t   * Test: `Object.prototype.toString.call(Promise.resolve())``\n\t\t   *  - Chrome <=47 === \"[object Object]\"\n\t\t   *  - Edge <=20 === \"[object Object]\"\n\t\t   *  - Firefox 29-Latest === \"[object Promise]\"\n\t\t   *  - Safari 7.1-Latest === \"[object Promise]\"\n\t\t   */\n\t\t  if (promiseExists && objPrototype === Promise.prototype) {\n\t\t    return 'Promise';\n\t\t  }\n\n\t\t  /* ! Speed optimisation\n\t\t  * Pre:\n\t\t  *   set                x 2,222,186 ops/sec ±1.31% (82 runs sampled)\n\t\t  * Post:\n\t\t  *   set                x 4,545,879 ops/sec ±1.13% (83 runs sampled)\n\t\t  */\n\t\t  if (setExists && objPrototype === Set.prototype) {\n\t\t    return 'Set';\n\t\t  }\n\n\t\t  /* ! Speed optimisation\n\t\t  * Pre:\n\t\t  *   map                x 2,396,842 ops/sec ±1.59% (81 runs sampled)\n\t\t  * Post:\n\t\t  *   map                x 4,183,945 ops/sec ±6.59% (82 runs sampled)\n\t\t  */\n\t\t  if (mapExists && objPrototype === Map.prototype) {\n\t\t    return 'Map';\n\t\t  }\n\n\t\t  /* ! Speed optimisation\n\t\t  * Pre:\n\t\t  *   weakset            x 1,323,220 ops/sec ±2.17% (76 runs sampled)\n\t\t  * Post:\n\t\t  *   weakset            x 4,237,510 ops/sec ±2.01% (77 runs sampled)\n\t\t  */\n\t\t  if (weakSetExists && objPrototype === WeakSet.prototype) {\n\t\t    return 'WeakSet';\n\t\t  }\n\n\t\t  /* ! Speed optimisation\n\t\t  * Pre:\n\t\t  *   weakmap            x 1,500,260 ops/sec ±2.02% (78 runs sampled)\n\t\t  * Post:\n\t\t  *   weakmap            x 3,881,384 ops/sec ±1.45% (82 runs sampled)\n\t\t  */\n\t\t  if (weakMapExists && objPrototype === WeakMap.prototype) {\n\t\t    return 'WeakMap';\n\t\t  }\n\n\t\t  /* ! Spec Conformance\n\t\t   * (http://www.ecma-international.org/ecma-262/6.0/index.html#sec-dataview.prototype-@@tostringtag)\n\t\t   * ES6$24.2.4.21 - DataView.prototype[@@toStringTag] should be \"DataView\":\n\t\t   * Test: `Object.prototype.toString.call(new DataView(new ArrayBuffer(1)))``\n\t\t   *  - Edge <=13 === \"[object Object]\"\n\t\t   */\n\t\t  if (dataViewExists && objPrototype === DataView.prototype) {\n\t\t    return 'DataView';\n\t\t  }\n\n\t\t  /* ! Spec Conformance\n\t\t   * (http://www.ecma-international.org/ecma-262/6.0/index.html#sec-%mapiteratorprototype%-@@tostringtag)\n\t\t   * ES6$23.1.5.2.2 - %MapIteratorPrototype%[@@toStringTag] should be \"Map Iterator\":\n\t\t   * Test: `Object.prototype.toString.call(new Map().entries())``\n\t\t   *  - Edge <=13 === \"[object Object]\"\n\t\t   */\n\t\t  if (mapExists && objPrototype === mapIteratorPrototype) {\n\t\t    return 'Map Iterator';\n\t\t  }\n\n\t\t  /* ! Spec Conformance\n\t\t   * (http://www.ecma-international.org/ecma-262/6.0/index.html#sec-%setiteratorprototype%-@@tostringtag)\n\t\t   * ES6$23.2.5.2.2 - %SetIteratorPrototype%[@@toStringTag] should be \"Set Iterator\":\n\t\t   * Test: `Object.prototype.toString.call(new Set().entries())``\n\t\t   *  - Edge <=13 === \"[object Object]\"\n\t\t   */\n\t\t  if (setExists && objPrototype === setIteratorPrototype) {\n\t\t    return 'Set Iterator';\n\t\t  }\n\n\t\t  /* ! Spec Conformance\n\t\t   * (http://www.ecma-international.org/ecma-262/6.0/index.html#sec-%arrayiteratorprototype%-@@tostringtag)\n\t\t   * ES6$22.1.5.2.2 - %ArrayIteratorPrototype%[@@toStringTag] should be \"Array Iterator\":\n\t\t   * Test: `Object.prototype.toString.call([][Symbol.iterator]())``\n\t\t   *  - Edge <=13 === \"[object Object]\"\n\t\t   */\n\t\t  if (arrayIteratorExists && objPrototype === arrayIteratorPrototype) {\n\t\t    return 'Array Iterator';\n\t\t  }\n\n\t\t  /* ! Spec Conformance\n\t\t   * (http://www.ecma-international.org/ecma-262/6.0/index.html#sec-%stringiteratorprototype%-@@tostringtag)\n\t\t   * ES6$21.1.5.2.2 - %StringIteratorPrototype%[@@toStringTag] should be \"String Iterator\":\n\t\t   * Test: `Object.prototype.toString.call(''[Symbol.iterator]())``\n\t\t   *  - Edge <=13 === \"[object Object]\"\n\t\t   */\n\t\t  if (stringIteratorExists && objPrototype === stringIteratorPrototype) {\n\t\t    return 'String Iterator';\n\t\t  }\n\n\t\t  /* ! Speed optimisation\n\t\t  * Pre:\n\t\t  *   object from null   x 2,424,320 ops/sec ±1.67% (76 runs sampled)\n\t\t  * Post:\n\t\t  *   object from null   x 5,838,000 ops/sec ±0.99% (84 runs sampled)\n\t\t  */\n\t\t  if (objPrototype === null) {\n\t\t    return 'Object';\n\t\t  }\n\n\t\t  return Object\n\t\t    .prototype\n\t\t    .toString\n\t\t    .call(obj)\n\t\t    .slice(toStringLeftSliceLength, toStringRightSliceLength);\n\t\t}\n\n\t\treturn typeDetect;\n\n\t\t}))); \n\t} (typeDetect$1));\n\treturn typeDetect$1.exports;\n}\n\nvar typeOf;\nvar hasRequiredTypeOf;\n\nfunction requireTypeOf () {\n\tif (hasRequiredTypeOf) return typeOf;\n\thasRequiredTypeOf = 1;\n\n\tvar type = requireTypeDetect();\n\n\t/**\n\t * Returns the lower-case result of running type from type-detect on the value\n\t * @param  {*} value\n\t * @returns {string}\n\t */\n\ttypeOf = function typeOf(value) {\n\t    return type(value).toLowerCase();\n\t};\n\treturn typeOf;\n}\n\nvar valueToString_1;\nvar hasRequiredValueToString;\n\nfunction requireValueToString () {\n\tif (hasRequiredValueToString) return valueToString_1;\n\thasRequiredValueToString = 1;\n\n\t/**\n\t * Returns a string representation of the value\n\t * @param  {*} value\n\t * @returns {string}\n\t */\n\tfunction valueToString(value) {\n\t    if (value && value.toString) {\n\t        // eslint-disable-next-line @sinonjs/no-prototype-methods/no-prototype-methods\n\t        return value.toString();\n\t    }\n\t    return String(value);\n\t}\n\n\tvalueToString_1 = valueToString;\n\treturn valueToString_1;\n}\n\nvar lib;\nvar hasRequiredLib;\n\nfunction requireLib () {\n\tif (hasRequiredLib) return lib;\n\thasRequiredLib = 1;\n\n\tlib = {\n\t    global: requireGlobal(),\n\t    calledInOrder: requireCalledInOrder(),\n\t    className: requireClassName(),\n\t    deprecated: requireDeprecated(),\n\t    every: requireEvery(),\n\t    functionName: requireFunctionName(),\n\t    orderByFirstCall: requireOrderByFirstCall(),\n\t    prototypes: requirePrototypes(),\n\t    typeOf: requireTypeOf(),\n\t    valueToString: requireValueToString(),\n\t};\n\treturn lib;\n}\n\nvar hasRequiredFakeTimersSrc;\n\nfunction requireFakeTimersSrc () {\n\tif (hasRequiredFakeTimersSrc) return fakeTimersSrc;\n\thasRequiredFakeTimersSrc = 1;\n\n\tconst globalObject = requireLib().global;\n\tlet timersModule, timersPromisesModule;\n\tif (typeof __vitest_required__ !== 'undefined') {\n\t    try {\n\t        timersModule = __vitest_required__.timers;\n\t    } catch {\n\t        // ignored\n\t    }\n\t    try {\n\t        timersPromisesModule = __vitest_required__.timersPromises;\n\t    } catch {\n\t        // ignored\n\t    }\n\t}\n\n\t/**\n\t * @typedef {\"nextAsync\" | \"manual\" | \"interval\"} TickMode\n\t */\n\n\t/**\n\t * @typedef {object} NextAsyncTickMode\n\t * @property {\"nextAsync\"} mode - runs timers one macrotask at a time\n\t */\n\n\t/**\n\t * @typedef {object} ManualTickMode\n\t * @property {\"manual\"} mode - advances only when the caller explicitly ticks\n\t */\n\n\t/**\n\t * @typedef {object} IntervalTickMode\n\t * @property {\"interval\"} mode - advances automatically on a native interval\n\t * @property {number} [delta] - interval duration in milliseconds\n\t */\n\n\t/**\n\t * @typedef {IntervalTickMode | NextAsyncTickMode | ManualTickMode} TimerTickMode\n\t */\n\n\t/**\n\t * @callback FakeTimersFunction\n\t * @param {...unknown[]} args\n\t * @returns {unknown}\n\t */\n\n\t/**\n\t * @callback VoidVarArgsFunc\n\t * @param {...unknown[]} args - optional arguments to call the callback with\n\t * @returns {void}\n\t */\n\n\t/**\n\t * @callback NextTick\n\t * @param {VoidVarArgsFunc} callback - the callback to run\n\t * @param {...unknown[]} args - optional arguments to call the callback with\n\t * @returns {void}\n\t */\n\n\t/**\n\t * @callback SetImmediate\n\t * @param {VoidVarArgsFunc} callback - the callback to run\n\t * @param {...unknown[]} args - optional arguments to call the callback with\n\t * @returns {NodeImmediate}\n\t */\n\n\t/**\n\t * @callback SetTimeout\n\t * @param {VoidVarArgsFunc} callback - the callback to run\n\t * @param {number} [delay] - optional delay in milliseconds\n\t * @param {...unknown[]} args - optional arguments to call the callback with\n\t * @returns {TimerId} - the timeout identifier\n\t */\n\n\t/**\n\t * @callback ClearTimeout\n\t * @param {TimerId} [id] - the timeout identifier to clear\n\t * @returns {void}\n\t */\n\n\t/**\n\t * @callback SetInterval\n\t * @param {VoidVarArgsFunc} callback - the callback to run\n\t * @param {number} [delay] - optional delay in milliseconds\n\t * @param {...unknown[]} args - optional arguments to call the callback with\n\t * @returns {TimerId} - the interval identifier\n\t */\n\n\t/**\n\t * @callback ClearInterval\n\t * @param {TimerId} [id] - the interval identifier to clear\n\t * @returns {void}\n\t */\n\n\t/**\n\t * @callback QueueMicrotask\n\t * @param {VoidVarArgsFunc} callback - the callback to run\n\t * @returns {void}\n\t */\n\n\t/**\n\t * @callback TimeRemaining\n\t * @returns {number}\n\t */\n\n\t/**\n\t * @typedef {object} IdleDeadline\n\t * @property {boolean} didTimeout - whether or not the callback was called before reaching the optional timeout\n\t * @property {TimeRemaining} timeRemaining - a floating-point value providing an estimate of the number of milliseconds remaining in the current idle period\n\t */\n\n\t/**\n\t * @callback RequestIdleCallbackCallback\n\t * @param {IdleDeadline} deadline\n\t */\n\n\t/**\n\t * Queues a function to be called during a browser's idle periods\n\t * @callback RequestIdleCallback\n\t * @param {RequestIdleCallbackCallback} callback\n\t * @param {{timeout?: number}} [options] - an options object\n\t * @returns {number} the id\n\t */\n\n\t/**\n\t * @callback AnimationFrameCallback\n\t * @param {number} timestamp\n\t */\n\n\t/**\n\t * @callback RequestAnimationFrame\n\t * @param {AnimationFrameCallback} callback\n\t * @returns {TimerId} - the request id\n\t */\n\n\t/**\n\t * @callback CancelAnimationFrame\n\t * @param {TimerId} id - cancels a frame callback\n\t * @returns {void}\n\t */\n\n\t/**\n\t * @callback CancelIdleCallback\n\t * @param {TimerId} id - cancels a scheduled idle callback\n\t * @returns {void}\n\t */\n\n\t/**\n\t * @callback ClearImmediate\n\t * @param {NodeImmediate} id - faked `clearImmediate`\n\t * @returns {void}\n\t */\n\n\t/**\n\t * @callback CountTimers\n\t * @returns {number}\n\t */\n\n\t/**\n\t * @callback RunMicrotasks\n\t * @returns {void}\n\t */\n\n\t/**\n\t * @typedef {object} TemporalDuration\n\t * @property {number} years - years component\n\t * @property {number} months - months component\n\t * @property {number} weeks - weeks component\n\t * @property {number} days - days component\n\t * @property {number} hours - hours component\n\t * @property {number} minutes - minutes component\n\t * @property {number} seconds - seconds component\n\t * @property {number} milliseconds - milliseconds component\n\t * @property {number} microseconds - microseconds component\n\t * @property {number} nanoseconds - nanoseconds component\n\t * @property {(options: {unit: string, relativeTo?: unknown}) => number} total - converts to a single unit\n\t */\n\n\t/**\n\t * @typedef {object} TemporalTimelike\n\t * @property {number} epochMilliseconds - milliseconds since the Unix epoch (present on Temporal.Instant and Temporal.ZonedDateTime)\n\t */\n\n\t/**\n\t * @callback Tick\n\t * @param {number|string|TemporalDuration} tickValue milliseconds, a string parseable by parseTime, or a Temporal.Duration\n\t * @returns {number} will return the new `now` value\n\t */\n\n\t/**\n\t * @callback TickAsync\n\t * @param {number|string|TemporalDuration} tickValue milliseconds, a string parseable by parseTime, or a Temporal.Duration\n\t * @returns {Promise<number>}\n\t */\n\n\t/**\n\t * @callback Next\n\t * @returns {number}\n\t */\n\n\t/**\n\t * @callback NextAsync\n\t * @returns {Promise<number>}\n\t */\n\n\t/**\n\t * @callback RunAll\n\t * @returns {number}\n\t */\n\n\t/**\n\t * @callback RunToFrame\n\t * @returns {number}\n\t */\n\n\t/**\n\t * @callback RunAllAsync\n\t * @returns {Promise<number>}\n\t */\n\n\t/**\n\t * @callback RunToLast\n\t * @returns {number}\n\t */\n\n\t/**\n\t * @callback RunToLastAsync\n\t * @returns {Promise<number>}\n\t */\n\n\t/**\n\t * @callback Reset\n\t * @returns {void}\n\t */\n\n\t/**\n\t * @callback SetSystemTime\n\t * @param {number|Date|TemporalTimelike} [now] initial mocked time, as milliseconds since epoch, a Date, a Temporal.Instant, or a Temporal.ZonedDateTime\n\t * @returns {void}\n\t */\n\n\t/**\n\t * @callback Jump\n\t * @param {number|string|TemporalDuration} tickValue milliseconds, a human-readable value like \"01:11:15\", or a Temporal.Duration\n\t * @returns {number}\n\t */\n\n\t/**\n\t * @callback Uninstall\n\t * @returns {void}\n\t */\n\n\t/**\n\t * @callback SetTickMode\n\t * @param {SetTickModeConfig} tickModeConfig - The new configuration for how the clock should tick.\n\t * @returns {void}\n\t */\n\n\t/**\n\t * @callback Hrtime\n\t * @param {Array<number>} [prev]\n\t * @returns {Array<number>}\n\t */\n\n\t/**\n\t * @callback WithGlobal\n\t * @param {object} _global Namespace to mock (e.g. `window`)\n\t * @returns {FakeTimers}\n\t */\n\n\t/**\n\t * @typedef {\"setTimeout\" | \"clearTimeout\" | \"setImmediate\" | \"clearImmediate\" | \"setInterval\" | \"clearInterval\" | \"Date\" | \"nextTick\" | \"hrtime\" | \"requestAnimationFrame\" | \"cancelAnimationFrame\" | \"requestIdleCallback\" | \"cancelIdleCallback\" | \"performance\" | \"queueMicrotask\" | \"Intl\" | \"Temporal\"} FakeMethod\n\t */\n\n\t/**\n\t * @typedef {number | NodeImmediate | Timer} TimerId\n\t */\n\n\t/* eslint-disable jsdoc/reject-any-type */\n\t/**\n\t * @typedef {Record<string, any> & {\n\t *   setTimeout?: SetTimeout,\n\t *   clearTimeout?: ClearTimeout,\n\t *   setInterval?: SetInterval,\n\t *   clearInterval?: ClearInterval,\n\t *   setImmediate?: SetImmediate,\n\t *   clearImmediate?: ClearImmediate,\n\t *   queueMicrotask?: QueueMicrotask,\n\t *   requestAnimationFrame?: RequestAnimationFrame,\n\t *   cancelAnimationFrame?: CancelAnimationFrame,\n\t *   requestIdleCallback?: RequestIdleCallback,\n\t *   cancelIdleCallback?: CancelIdleCallback,\n\t *   process?: any,\n\t *   performance?: any,\n\t *   Performance?: any,\n\t *   Intl?: any,\n\t *   Temporal?: any,\n\t *   Promise?: typeof Promise,\n\t *   Date: typeof Date & { isFake?: boolean, toSource?: () => string, clock?: any }\n\t * }} GlobalObject\n\t */\n\n\t/**\n\t * @typedef {object} TimerHeap\n\t * @property {Timer[]} timers - the heap-ordered timers\n\t * @property {() => Timer | undefined} peek - returns the next timer without removing it\n\t * @property {(timer: Timer) => void} push - adds a timer to the heap\n\t * @property {() => Timer | undefined} pop - removes and returns the next timer\n\t * @property {(timer: Timer) => void} remove - removes a specific timer\n\t */\n\n\t/**\n\t * @typedef {object} ClockTickMode\n\t * @property {TickMode} mode - active tick mode\n\t * @property {number} counter - increments whenever the mode changes\n\t * @property {number} [delta] - interval length in milliseconds\n\t */\n\n\t/**\n\t * @typedef {object} SetTickModeConfig\n\t * @property {TickMode} mode - desired tick mode\n\t * @property {number} [delta] - interval length in milliseconds\n\t */\n\n\t/**\n\t * @typedef {Record<string, any> & { clock: Clock }} IntlWithClock\n\t */\n\n\t/**\n\t * @typedef {Record<string, any> & { now: () => number }} PerformanceLike\n\t */\n\n\t/**\n\t * @typedef {object} Timers\n\t * @property {SetTimeout} setTimeout - native `setTimeout`\n\t * @property {ClearTimeout} clearTimeout - native `clearTimeout`\n\t * @property {SetInterval} setInterval - native `setInterval`\n\t * @property {ClearInterval} clearInterval - native `clearInterval`\n\t * @property {typeof Date} Date - native `Date`\n\t * @property {typeof Intl} [Intl] - native `Intl`\n\t * @property {any} [Temporal] - native `Temporal`\n\t * @property {SetImmediate} [setImmediate] - native `setImmediate`, if available\n\t * @property {ClearImmediate} [clearImmediate] - native `clearImmediate`, if available\n\t * @property {Hrtime} [hrtime] - native `process.hrtime`, if available\n\t * @property {NextTick} [nextTick] - native `process.nextTick`, if available\n\t * @property {PerformanceLike} [performance] - native `performance`, if available\n\t * @property {RequestAnimationFrame} [requestAnimationFrame] - native `requestAnimationFrame`, if available\n\t * @property {QueueMicrotask} [queueMicrotask] - whether `queueMicrotask` exists\n\t * @property {CancelAnimationFrame} [cancelAnimationFrame] - native `cancelAnimationFrame`, if available\n\t * @property {RequestIdleCallback} [requestIdleCallback] - native `requestIdleCallback`, if available\n\t * @property {CancelIdleCallback} [cancelIdleCallback] - native `cancelIdleCallback`, if available\n\t */\n\n\t/**\n\t * @typedef {object} ClockState\n\t * @property {number} tickFrom - lower bound of the current tick range\n\t * @property {number} tickTo - upper bound of the current tick range\n\t * @property {number} [previous] - previous timer time used during ticking\n\t * @property {number | null} [oldNow] - previous value of `now`\n\t * @property {Timer} [timer] - timer currently being processed\n\t * @property {unknown} [firstException] - first exception raised while processing timers\n\t * @property {number} [nanosTotal] - accumulated nanoseconds from fractional ticks\n\t * @property {number} [msFloat] - accumulated fractional milliseconds\n\t * @property {number} [ms] - accumulated whole milliseconds\n\t */\n\n\t/**\n\t * @typedef {object} TimerInitialProps\n\t * @property {VoidVarArgsFunc} func - callback or string to execute\n\t * @property {unknown[]} [args] - arguments passed to the callback\n\t * @property {'Timeout' | 'Interval' | 'Immediate' | 'AnimationFrame' | 'IdleCallback'} [type] - timer kind\n\t * @property {number} [delay] - requested delay in milliseconds\n\t * @property {number} [callAt] - scheduled execution time\n\t * @property {number} [createdAt] - time at which the timer was created\n\t * @property {boolean} [immediate] - whether this timer should run before non-immediate timers at the same time\n\t * @property {number} [id] - unique timer identifier\n\t * @property {Error} [error] - captured stack for loop diagnostics\n\t * @property {number} [interval] - interval for repeated timers\n\t * @property {boolean} [animation] - whether this is an animation frame timer\n\t * @property {boolean} [requestIdleCallback] - whether this is an idle callback timer\n\t * @property {number} [order] - execution order for timers at the same time\n\t * @property {number} [heapIndex] - index in the timer heap\n\t */\n\n\t/**\n\t * @callback CreateClockCallback\n\t * @param {number|Date|TemporalTimelike} [start] initial mocked time, as milliseconds since epoch, a Date, a Temporal.Instant, or a Temporal.ZonedDateTime\n\t * @param {number} [loopLimit] maximum number of timers run before aborting with an infinite-loop error\n\t * @returns {Clock}\n\t */\n\n\t/**\n\t * @callback InstallCallback\n\t * @param {Config} [config] Optional config\n\t * @returns {Clock}\n\t */\n\n\t/**\n\t * @typedef {object} FakeTimers\n\t * @property {Timers} timers - the native timer APIs saved for later restoration\n\t * @property {CreateClockCallback} createClock - creates a new fake clock\n\t * @property {InstallCallback} install - installs the fake timers onto the default global object\n\t * @property {WithGlobal} withGlobal - creates a fake-timers instance for a provided global object\n\t */\n\n\t/**\n\t * @typedef {object} Clock\n\t * @property {number} now - current mocked time in milliseconds\n\t * @property {typeof Date & {clock?: Clock, isFake?: boolean, toSource?: () => string}} Date - fake Date constructor bound to this clock\n\t * @property {number} loopLimit - maximum number of timers before assuming an infinite loop\n\t * @property {RequestIdleCallback} requestIdleCallback - schedules an idle callback\n\t * @property {CancelIdleCallback} cancelIdleCallback - cancels a scheduled idle callback\n\t * @property {SetTimeout} setTimeout - faked `setTimeout`\n\t * @property {ClearTimeout} clearTimeout - faked `clearTimeout`\n\t * @property {NextTick} nextTick - faked `process.nextTick`\n\t * @property {QueueMicrotask} queueMicrotask - faked `queueMicrotask`\n\t * @property {SetInterval} setInterval - faked `setInterval`\n\t * @property {ClearInterval} clearInterval - faked `clearInterval`\n\t * @property {SetImmediate} setImmediate - faked `setImmediate`\n\t * @property {ClearImmediate} clearImmediate - faked `clearImmediate`\n\t * @property {CountTimers} countTimers - counts scheduled timers\n\t * @property {RequestAnimationFrame} requestAnimationFrame - schedules a frame callback\n\t * @property {CancelAnimationFrame} cancelAnimationFrame - cancels a frame callback\n\t * @property {RunMicrotasks} runMicrotasks - drains microtasks\n\t * @property {Tick} tick - advances fake time synchronously\n\t * @property {TickAsync} tickAsync - advances fake time asynchronously\n\t * @property {Next} next - runs the next scheduled timer\n\t * @property {NextAsync} nextAsync - runs the next scheduled timer asynchronously\n\t * @property {RunAll} runAll - runs all scheduled timers\n\t * @property {RunToFrame} runToFrame - runs timers up to the next animation frame\n\t * @property {RunAllAsync} runAllAsync - runs all scheduled timers asynchronously\n\t * @property {RunToLast} runToLast - runs timers up to the last scheduled timer\n\t * @property {RunToLastAsync} runToLastAsync - runs timers up to the last scheduled timer asynchronously\n\t * @property {Reset} reset - clears all timers and resets the clock\n\t * @property {SetSystemTime} setSystemTime - sets the clock to a specific wall-clock time\n\t * @property {Jump} jump - advances time and returns the new `now`\n\t * @property {any} performance - fake performance object\n\t * @property {Hrtime} hrtime - faked `process.hrtime`\n\t * @property {Uninstall} uninstall - restores native timers\n\t * @property {string[]} methods - names of faked methods\n\t * @property {boolean} [shouldClearNativeTimers] - inherited from config\n\t * @property {{methodName:string, original:unknown}[] | undefined} timersModuleMethods - saved Node timers module methods\n\t * @property {{methodName:string, original:unknown}[] | undefined} timersPromisesModuleMethods - saved Node timers/promises methods\n\t * @property {Map<VoidVarArgsFunc, AbortSignal>} abortListenerMap - active abort listeners\n\t * @property {SetTickMode} setTickMode - switches the auto-tick mode\n\t * @property {Map<number, Timer>} [timers] - internal timer storage\n\t * @property {TimerHeap} [timerHeap] - internal timer heap\n\t * @property {boolean} [duringTick] - internal flag\n\t * @property {boolean} isNearInfiniteLimit - internal flag indicating the loop limit is nearly reached\n\t * @property {TimerId} [attachedInterval] - internal flag\n\t * @property {ClockTickMode} [tickMode] - internal flag\n\t * @property {Timer[]} [jobs] - internal flag\n\t * @property {IntlWithClock} [Intl] - fake Intl object\n\t * @property {any} [Temporal] - fake Temporal object\n\t */\n\t/* eslint-enable jsdoc/reject-any-type */\n\n\t/**\n\t * Configuration object for the `install` method.\n\t * @typedef {object} Config\n\t * @property {number|Date|TemporalTimelike} [now] initial mocked time, as milliseconds since epoch, a Date, a Temporal.Instant, or a Temporal.ZonedDateTime\n\t * @property {FakeMethod[]} [toFake] method names that should be faked\n\t * @property {FakeMethod[]} [toNotFake] method names that should remain native\n\t * @property {number} [loopLimit] maximum number of timers run before aborting with an infinite-loop error\n\t * @property {boolean} [shouldAdvanceTime] automatically increments mocked time while the clock is installed\n\t * @property {number} [advanceTimeDelta] interval in milliseconds used when `shouldAdvanceTime` is enabled\n\t * @property {boolean} [shouldClearNativeTimers] forwards clear calls to native methods when the timer is not fake\n\t * @property {boolean} [ignoreMissingTimers] suppresses errors when a requested timer is missing from the global object\n\t * @property {GlobalObject} [target] global object to install onto\n\t */\n\n\t/**\n\t * The internal structure to describe a scheduled fake timer\n\t * @typedef {TimerInitialProps} Timer\n\t * @property {unknown[]} args - arguments passed to the callback\n\t * @property {number} callAt - scheduled execution time\n\t * @property {number} createdAt - time at which the timer was created\n\t * @property {number} id - unique timer identifier\n\t * @property {'Timeout' | 'Interval' | 'Immediate' | 'AnimationFrame' | 'IdleCallback'} type - timer kind\n\t */\n\n\t/**\n\t * @callback NodeImmediateHasRef\n\t * @returns {boolean}\n\t */\n\n\t/**\n\t * @callback NodeImmediateRef\n\t * @returns {NodeImmediate}\n\t */\n\n\t/**\n\t * @callback NodeImmediateUnref\n\t * @returns {NodeImmediate}\n\t */\n\n\t/**\n\t * A Node timer\n\t * @typedef {object} NodeImmediate\n\t * @property {NodeImmediateHasRef} hasRef - reports whether the timer keeps the event loop alive\n\t * @property {NodeImmediateRef} ref - marks the timer as referenced\n\t * @property {NodeImmediateUnref} unref - marks the timer as unreferenced\n\t */\n\n\t/* eslint-disable complexity */\n\n\t/**\n\t * Mocks available features in the specified global namespace.\n\t * @param {GlobalObject} _global Namespace to mock (e.g. `window`)\n\t * @returns {FakeTimers}\n\t */\n\tfunction withGlobal(_global) {\n\t    const maxTimeout = Math.pow(2, 31) - 1; //see https://heycam.github.io/webidl/#abstract-opdef-converttoint\n\t    const idCounterStart = 1e12; // arbitrarily large number to avoid collisions with native timer IDs\n\t    const NOOP = function () {\n\t        return undefined;\n\t    };\n\t    const NOOP_ARRAY = function () {\n\t        return [];\n\t    };\n\t    const isPresent = {};\n\t    let timeoutResult,\n\t        addTimerReturnsObject = false;\n\n\t    if (_global.setTimeout) {\n\t        isPresent.setTimeout = true;\n\t        timeoutResult = _global.setTimeout(NOOP, 0);\n\t        addTimerReturnsObject = typeof timeoutResult === \"object\";\n\t    }\n\t    isPresent.clearTimeout = Boolean(_global.clearTimeout);\n\t    isPresent.setInterval = Boolean(_global.setInterval);\n\t    isPresent.clearInterval = Boolean(_global.clearInterval);\n\t    isPresent.hrtime =\n\t        _global.process && typeof _global.process.hrtime === \"function\";\n\t    isPresent.hrtimeBigint =\n\t        isPresent.hrtime && typeof _global.process.hrtime.bigint === \"function\";\n\t    isPresent.nextTick =\n\t        _global.process && typeof _global.process.nextTick === \"function\";\n\t    const utilPromisify = _global.process && _global.__vitest_required__ && _global.__vitest_required__.util.promisify;\n\t    isPresent.performance =\n\t        _global.performance && typeof _global.performance.now === \"function\";\n\t    const hasPerformancePrototype =\n\t        _global.Performance &&\n\t        (typeof _global.Performance).match(/^(function|object)$/);\n\t    const hasPerformanceConstructorPrototype =\n\t        _global.performance &&\n\t        _global.performance.constructor &&\n\t        _global.performance.constructor.prototype;\n\t    isPresent.queueMicrotask = Object.prototype.hasOwnProperty.call(\n\t        _global,\n\t        \"queueMicrotask\",\n\t    );\n\t    isPresent.requestAnimationFrame =\n\t        _global.requestAnimationFrame &&\n\t        typeof _global.requestAnimationFrame === \"function\";\n\t    isPresent.cancelAnimationFrame =\n\t        _global.cancelAnimationFrame &&\n\t        typeof _global.cancelAnimationFrame === \"function\";\n\t    isPresent.requestIdleCallback =\n\t        _global.requestIdleCallback &&\n\t        typeof _global.requestIdleCallback === \"function\";\n\t    isPresent.cancelIdleCallback =\n\t        _global.cancelIdleCallback &&\n\t        typeof _global.cancelIdleCallback === \"function\";\n\t    isPresent.setImmediate =\n\t        _global.setImmediate && typeof _global.setImmediate === \"function\";\n\t    isPresent.clearImmediate =\n\t        _global.clearImmediate && typeof _global.clearImmediate === \"function\";\n\t    isPresent.Intl = _global.Intl && typeof _global.Intl === \"object\";\n\t    isPresent.Temporal =\n\t        _global.Temporal !== null &&\n\t        typeof _global.Temporal === \"object\" &&\n\t        typeof _global.Temporal.Now !== \"undefined\" &&\n\t        typeof _global.Temporal.Instant !== \"undefined\";\n\n\t    if (_global.clearTimeout) {\n\t        _global.clearTimeout(timeoutResult);\n\t    }\n\n\t    const NativeDate = _global.Date;\n\t    const NativeIntl = isPresent.Intl\n\t        ? Object.defineProperties(\n\t              Object.create(null),\n\t              Object.getOwnPropertyDescriptors(_global.Intl),\n\t          )\n\t        : undefined;\n\t    const NativeTemporal = isPresent.Temporal ? _global.Temporal : undefined;\n\t    let uniqueTimerId = idCounterStart;\n\t    /** @type {number} */\n\t    let uniqueTimerOrder = 0;\n\n\t    if (NativeDate === undefined) {\n\t        throw new Error(\n\t            \"The global scope doesn't have a `Date` object\" +\n\t                \" (see https://github.com/sinonjs/sinon/issues/1852#issuecomment-419622780)\",\n\t        );\n\t    }\n\t    isPresent.Date = true;\n\n\t    /**\n\t     * The PerformanceEntry object encapsulates a single performance metric\n\t     * that is part of the browser's performance timeline.\n\t     *\n\t     * This is an object returned by the `mark` and `measure` methods on the Performance prototype\n\t     */\n\t    class FakePerformanceEntry {\n\t        constructor(name, entryType, startTime, duration) {\n\t            this.name = name;\n\t            this.entryType = entryType;\n\t            this.startTime = startTime;\n\t            this.duration = duration;\n\t        }\n\n\t        toJSON() {\n\t            return JSON.stringify({ ...this });\n\t        }\n\t    }\n\n\t    /**\n\t     * @param {number} num\n\t     * @returns {boolean}\n\t     */\n\t    function isNumberFinite(num) {\n\t        if (Number.isFinite) {\n\t            return Number.isFinite(num);\n\t        }\n\n\t        return isFinite(num);\n\t    }\n\n\t    /**\n\t     * @param {Clock} clock\n\t     * @param {number} i\n\t     */\n\t    function checkIsNearInfiniteLimit(clock, i) {\n\t        if (clock.loopLimit && i === clock.loopLimit - 1) {\n\t            clock.isNearInfiniteLimit = true;\n\t        }\n\t    }\n\n\t    /**\n\t     * @param {Clock} clock\n\t     */\n\t    function resetIsNearInfiniteLimit(clock) {\n\t        if (clock) {\n\t            clock.isNearInfiniteLimit = false;\n\t        }\n\t    }\n\n\t    /**\n\t     * Parse strings like \"01:10:00\" (meaning 1 hour, 10 minutes, 0 seconds) into\n\t     * number of milliseconds. This is used to support human-readable strings passed\n\t     * to clock.tick()\n\t     * @param {string} str\n\t     * @returns {number}\n\t     */\n\t    function parseTime(str) {\n\t        if (!str) {\n\t            return 0;\n\t        }\n\n\t        const strings = str.split(\":\");\n\t        const l = strings.length;\n\t        let i = l;\n\t        let ms = 0;\n\t        let parsed;\n\n\t        if (l > 3 || !/^(\\d\\d:){0,2}\\d\\d?$/.test(str)) {\n\t            throw new Error(\n\t                \"tick only understands numbers, 'm:s' and 'h:m:s'. Each part must be two digits\",\n\t            );\n\t        }\n\n\t        while (i--) {\n\t            parsed = parseInt(strings[i], 10);\n\n\t            if (parsed >= 60) {\n\t                throw new Error(`Invalid time ${str}`);\n\t            }\n\n\t            ms += parsed * Math.pow(60, l - i - 1);\n\t        }\n\n\t        return ms * 1000;\n\t    }\n\n\t    /**\n\t     * Get the decimal part of the millisecond value as nanoseconds\n\t     * @param {number} msFloat the number of milliseconds\n\t     * @returns {number} an integer number of nanoseconds in the range [0,1e6)\n\t     *\n\t     * Example: nanoRemainer(123.456789) -> 456789\n\t     */\n\t    function nanoRemainder(msFloat) {\n\t        const modulo = 1e6;\n\t        const remainder = (msFloat * 1e6) % modulo;\n\t        const positiveRemainder =\n\t            remainder < 0 ? remainder + modulo : remainder;\n\n\t        return Math.floor(positiveRemainder);\n\t    }\n\n\t    /**\n\t     * Used to grok the `now` parameter to createClock.\n\t     * @param {Date|number|TemporalTimelike} epoch the system time\n\t     * @returns {number}\n\t     */\n\t    function getEpoch(epoch) {\n\t        if (!epoch) {\n\t            return 0;\n\t        }\n\t        if (typeof epoch === \"number\") {\n\t            return epoch;\n\t        }\n\t        if (typeof (/** @type {Date} */ (epoch).getTime) === \"function\") {\n\t            return /** @type {Date} */ (epoch).getTime();\n\t        }\n\t        if (\n\t            typeof (\n\t                /** @type {TemporalTimelike} */ (epoch).epochMilliseconds\n\t            ) === \"number\"\n\t        ) {\n\t            // Temporal.Instant and Temporal.ZonedDateTime both have epochMilliseconds\n\t            return /** @type {TemporalTimelike} */ (epoch).epochMilliseconds;\n\t        }\n\t        throw new TypeError(\"now should be milliseconds since UNIX epoch\");\n\t    }\n\n\t    /**\n\t     * @param {number} from\n\t     * @param {number} to\n\t     * @param {Timer} timer\n\t     * @returns {boolean}\n\t     */\n\t    function inRange(from, to, timer) {\n\t        return timer && timer.callAt >= from && timer.callAt <= to;\n\t    }\n\n\t    /**\n\t     * @param {Clock} clock\n\t     * @param {Timer} job\n\t     * @returns {Error}\n\t     */\n\t    function getInfiniteLoopError(clock, job) {\n\t        const infiniteLoopError = new Error(\n\t            `Aborting after running ${clock.loopLimit} timers, assuming an infinite loop!`,\n\t        );\n\n\t        if (!job.error) {\n\t            return infiniteLoopError;\n\t        }\n\n\t        // pattern never matched in Node\n\t        const computedTargetPattern = /target\\.*[<|(|[].*?[>|\\]|)]\\s*/;\n\t        let clockMethodPattern = new RegExp(\n\t            String(Object.keys(clock).join(\"|\")),\n\t        );\n\n\t        if (addTimerReturnsObject) {\n\t            // node.js environment\n\t            clockMethodPattern = new RegExp(\n\t                `\\\\s+at (Object\\\\.)?(?:${Object.keys(clock).join(\"|\")})\\\\s+`,\n\t            );\n\t        }\n\n\t        let matchedLineIndex = -1;\n\t        job.error.stack.split(\"\\n\").some(function (line, i) {\n\t            // If we've matched a computed target line (e.g. setTimeout) then we\n\t            // don't need to look any further. Return true to stop iterating.\n\t            const matchedComputedTarget = line.match(computedTargetPattern);\n\t            /* istanbul ignore if */\n\t            if (matchedComputedTarget) {\n\t                matchedLineIndex = i;\n\t                return true;\n\t            }\n\n\t            // If we've matched a clock method line, then there may still be\n\t            // others further down the trace. Return false to keep iterating.\n\t            const matchedClockMethod = line.match(clockMethodPattern);\n\t            if (matchedClockMethod) {\n\t                matchedLineIndex = i;\n\t                return false;\n\t            }\n\n\t            // If we haven't matched anything on this line, but we matched\n\t            // previously and set the matched line index, then we can stop.\n\t            // If we haven't matched previously, then we should keep iterating.\n\t            return matchedLineIndex >= 0;\n\t        });\n\n\t        const stack = `${infiniteLoopError}\\n${job.type || \"Microtask\"} - ${\n\t            job.func.name || \"anonymous\"\n\t        }\\n${job.error.stack\n\t            .split(\"\\n\")\n\t            .slice(matchedLineIndex + 1)\n\t            .join(\"\\n\")}`;\n\n\t        try {\n\t            Object.defineProperty(infiniteLoopError, \"stack\", {\n\t                value: stack,\n\t            });\n\t        } catch {\n\t            // noop\n\t        }\n\n\t        return infiniteLoopError;\n\t    }\n\n\t    /**\n\t     * @returns {typeof Date & { clock: Clock }}\n\t     */\n\t    function createDate() {\n\t        class ClockDate extends NativeDate {\n\t            /** @type {Clock} */\n\t            static clock;\n\n\t            constructor(...args) {\n\t                // Preserve fake time when Date is called without arguments.\n\t                if (args.length === 0) {\n\t                    super(ClockDate.clock.now);\n\t                } else {\n\t                    // The subclass is intentionally thin for explicit args.\n\t                    // @ts-expect-error Date constructor overloads are intentionally dynamic.\n\t                    super(...args);\n\t                }\n\n\t                // ensures identity checks using the constructor prop still works\n\t                // this should have no other functional effect\n\t                Object.defineProperty(this, \"constructor\", {\n\t                    value: NativeDate,\n\t                    enumerable: false,\n\t                });\n\t            }\n\n\t            static [Symbol.hasInstance](instance) {\n\t                return instance instanceof NativeDate;\n\t            }\n\t        }\n\n\t        ClockDate.isFake = true;\n\n\t        if (NativeDate.now) {\n\t            ClockDate.now = function now() {\n\t                return ClockDate.clock.now;\n\t            };\n\t        }\n\n\t        const NativeDateWithToSource =\n\t            /** @type {typeof Date & { toSource?: () => string }} */ (\n\t                NativeDate\n\t            );\n\n\t        if (NativeDateWithToSource.toSource) {\n\t            ClockDate.toSource = function toSource() {\n\t                return NativeDateWithToSource.toSource();\n\t            };\n\t        }\n\n\t        ClockDate.toString = function toString() {\n\t            return NativeDateWithToSource.toString();\n\t        };\n\n\t        // noinspection UnnecessaryLocalVariableJS\n\t        /**\n\t         * A normal Class constructor cannot be called without `new`, but Date can, so we need\n\t         * to wrap it in a Proxy in order to ensure this functionality of Date is kept intact\n\t         * @type {typeof ClockDate}\n\t         */\n\t        const ClockDateProxy = new Proxy(ClockDate, {\n\t            // handler for [[Call]] invocations (i.e. not using `new`)\n\t            apply() {\n\t                // the Date constructor called as a function, ref Ecma-262 Edition 5.1, section 15.9.2.\n\t                // This remains so in the 10th edition of 2019 as well.\n\t                if (this instanceof ClockDate) {\n\t                    throw new TypeError(\n\t                        \"A Proxy should only capture `new` calls with the `construct` handler. This is not supposed to be possible, so check the logic.\",\n\t                    );\n\t                }\n\n\t                return new NativeDate(ClockDate.clock.now).toString();\n\t            },\n\t        });\n\n\t        return /** @type {typeof Date & { clock: Clock }} */ (\n\t            /** @type {unknown} */ (ClockDateProxy)\n\t        );\n\t    }\n\n\t    /**\n\t     * Mirror Intl by default on our fake implementation\n\t     *\n\t     * Most of the properties are the original native ones,\n\t     * but we need to take control of those that have a\n\t     * dependency on the current clock.\n\t     * @param {Clock} clock\n\t     * @returns {IntlWithClock} the partly fake Intl implementation\n\t     */\n\t    function createIntl(clock) {\n\t        /** @type {IntlWithClock} */\n\t        const IntlWithClock = { clock: clock };\n\t        /*\n\t         * All properties of Intl are non-enumerable, so we need\n\t         * to do a bit of work to get them out.\n\t         */\n\t        Object.getOwnPropertyNames(NativeIntl).forEach(\n\t            (property) => (IntlWithClock[property] = NativeIntl[property]),\n\t        );\n\n\t        IntlWithClock.DateTimeFormat = function (...args) {\n\t            const realFormatter = new NativeIntl.DateTimeFormat(...args);\n\t            const formatter = {};\n\n\t            [\"formatRange\", \"formatRangeToParts\", \"resolvedOptions\"].forEach(\n\t                (method) => {\n\t                    formatter[method] =\n\t                        realFormatter[method].bind(realFormatter);\n\t                },\n\t            );\n\n\t            [\"format\", \"formatToParts\"].forEach((method) => {\n\t                formatter[method] = function (date) {\n\t                    return realFormatter[method](\n\t                        date || IntlWithClock.clock.now,\n\t                    );\n\t                };\n\t            });\n\n\t            return formatter;\n\t        };\n\n\t        IntlWithClock.DateTimeFormat.prototype = Object.create(\n\t            NativeIntl.DateTimeFormat.prototype,\n\t        );\n\n\t        IntlWithClock.DateTimeFormat.supportedLocalesOf =\n\t            NativeIntl.DateTimeFormat.supportedLocalesOf;\n\n\t        return IntlWithClock;\n\t    }\n\n\t    //eslint-disable-next-line jsdoc/require-jsdoc\n\t    function createTemporal(clock, getNanos) {\n\t        const fakeNow = {\n\t            instant() {\n\t                return NativeTemporal.Instant.fromEpochNanoseconds(\n\t                    BigInt(clock.now) * 1_000_000n + BigInt(getNanos()),\n\t                );\n\t            },\n\t            timeZoneId() {\n\t                return NativeTemporal.Now.timeZoneId();\n\t            },\n\t            zonedDateTimeISO(timeZone) {\n\t                const tz = timeZone ?? NativeTemporal.Now.timeZoneId();\n\t                return fakeNow.instant().toZonedDateTimeISO(tz);\n\t            },\n\t            plainDateTimeISO(timeZone) {\n\t                return fakeNow.zonedDateTimeISO(timeZone).toPlainDateTime();\n\t            },\n\t            plainDateISO(timeZone) {\n\t                return fakeNow.zonedDateTimeISO(timeZone).toPlainDate();\n\t            },\n\t            plainTimeISO(timeZone) {\n\t                return fakeNow.zonedDateTimeISO(timeZone).toPlainTime();\n\t            },\n\t        };\n\n\t        const TemporalWithClock = Object.create(\n\t            Object.getPrototypeOf(NativeTemporal),\n\t        );\n\t        [\n\t            ...Object.getOwnPropertyNames(NativeTemporal),\n\t            ...Object.getOwnPropertySymbols(NativeTemporal),\n\t        ].forEach((prop) => {\n\t            Object.defineProperty(\n\t                TemporalWithClock,\n\t                prop,\n\t                Object.getOwnPropertyDescriptor(NativeTemporal, prop),\n\t            );\n\t        });\n\t        // Temporal.Now is writable:false in the spec so we must use defineProperty\n\t        Object.defineProperty(TemporalWithClock, \"Now\", {\n\t            value: fakeNow,\n\t            writable: true,\n\t            enumerable: false,\n\t            configurable: true,\n\t        });\n\n\t        return TemporalWithClock;\n\t    }\n\n\t    //eslint-disable-next-line jsdoc/require-jsdoc\n\t    function enqueueJob(clock, job) {\n\t        // enqueues a microtick-deferred task - ecma262/#sec-enqueuejob\n\t        if (!clock.jobs) {\n\t            clock.jobs = [];\n\t        }\n\t        clock.jobs.push(job);\n\t    }\n\n\t    //eslint-disable-next-line jsdoc/require-jsdoc\n\t    function runJobs(clock) {\n\t        // runs all microtick-deferred tasks - ecma262/#sec-runjobs\n\t        if (!clock.jobs) {\n\t            return;\n\t        }\n\t        const wasNearLimit = clock.isNearInfiniteLimit;\n\t        for (let i = 0; i < clock.jobs.length; i++) {\n\t            const job = clock.jobs[i];\n\t            job.func.apply(null, job.args);\n\n\t            checkIsNearInfiniteLimit(clock, i);\n\t            if (clock.loopLimit && i > clock.loopLimit) {\n\t                throw getInfiniteLoopError(clock, job);\n\t            }\n\t        }\n\t        if (!wasNearLimit) {\n\t            resetIsNearInfiniteLimit(clock);\n\t        }\n\t        clock.jobs = [];\n\t    }\n\n\t    /**\n\t     * A compact \"soonest timer first\" container.\n\t     *\n\t     * Think of this as a waiting room for scheduled callbacks where the next\n\t     * callback to run is always kept at the front of the list. The internal\n\t     * array is arranged so we can find, add, remove, and reorder timers\n\t     * efficiently without sorting the whole list every time something changes.\n\t     *\n\t     * The important idea is not the data structure name, but the behavior:\n\t     * the timer that should run next stays near the front, and when one timer\n\t     * moves, the rest are shifted just enough to keep that promise true.\n\t     */\n\t    class TimerHeap {\n\t        constructor() {\n\t            this.timers = [];\n\t        }\n\n\t        /**\n\t         * Look at the next timer without removing it.\n\t         * This is the timer the clock would run first if time advanced now.\n\t         * @returns {Timer}\n\t         */\n\t        peek() {\n\t            return this.timers[0];\n\t        }\n\n\t        /**\n\t         * Add a timer to the waiting room, then move it upward until it is in\n\t         * the right place relative to the timers it should run before and after.\n\t         * @param {Timer} timer\n\t         */\n\t        push(timer) {\n\t            this.timers.push(timer);\n\t            this.bubbleUp(this.timers.length - 1);\n\t        }\n\n\t        /**\n\t         * Remove and return the next timer to run.\n\t         *\n\t         * We pull the front timer out, move the last timer into the empty spot,\n\t         * and then shift that replacement down until the ordering is correct\n\t         * again. That avoids rebuilding the whole list from scratch.\n\t         * @returns {Timer|undefined}\n\t         */\n\t        pop() {\n\t            if (this.timers.length === 0) {\n\t                return undefined;\n\t            }\n\t            const first = this.timers[0];\n\t            const last = this.timers.pop();\n\t            if (this.timers.length > 0) {\n\t                this.timers[0] = last;\n\t                last.heapIndex = 0;\n\t                this.bubbleDown(0);\n\t            }\n\t            delete first.heapIndex;\n\t            return first;\n\t        }\n\n\t        /**\n\t         * Remove a specific timer from the waiting room.\n\t         *\n\t         * The heap stores timers in a shape that lets us jump directly to the\n\t         * timer's current position, replace it with the last timer, and then\n\t         * move that replacement up or down until the ordering is correct again.\n\t         * @param {Timer} timer\n\t         * @returns {boolean}\n\t         */\n\t        remove(timer) {\n\t            const index = timer.heapIndex;\n\t            if (index === undefined || this.timers[index] !== timer) {\n\t                return false;\n\t            }\n\t            const last = this.timers.pop();\n\t            if (timer !== last) {\n\t                this.timers[index] = last;\n\t                last.heapIndex = index;\n\t                if (compareTimers(last, timer) < 0) {\n\t                    this.bubbleUp(index);\n\t                } else {\n\t                    this.bubbleDown(index);\n\t                }\n\t            }\n\t            delete timer.heapIndex;\n\t            return true;\n\t        }\n\n\t        /**\n\t         * Move a timer toward the front until it is no longer \"earlier\" than\n\t         * the timer above it.\n\t         *\n\t         * Conceptually, this is what happens when something newly scheduled\n\t         * turns out to belong ahead of its parent in the waiting room. We keep\n\t         * swapping it upward until it is no longer out of place.\n\t         * @param {number} index\n\t         */\n\t        bubbleUp(index) {\n\t            const timer = this.timers[index];\n\t            let currentIndex = index;\n\t            while (currentIndex > 0) {\n\t                const parentIndex = Math.floor((currentIndex - 1) / 2);\n\t                const parent = this.timers[parentIndex];\n\t                if (compareTimers(timer, parent) < 0) {\n\t                    this.timers[currentIndex] = parent;\n\t                    parent.heapIndex = currentIndex;\n\t                    currentIndex = parentIndex;\n\t                } else {\n\t                    break;\n\t                }\n\t            }\n\t            this.timers[currentIndex] = timer;\n\t            timer.heapIndex = currentIndex;\n\t        }\n\n\t        /**\n\t         * Move a timer away from the front until the timer below it is no\n\t         * longer supposed to run after it.\n\t         *\n\t         * This is the opposite of `bubbleUp`: when a timer at the front is\n\t         * removed or moved, the replacement may be too far ahead, so we\n\t         * repeatedly swap it downward with the best child until the waiting\n\t         * room is ordered again.\n\t         * @param {number} index\n\t         */\n\t        bubbleDown(index) {\n\t            const timer = this.timers[index];\n\t            let currentIndex = index;\n\t            const halfLength = Math.floor(this.timers.length / 2);\n\t            while (currentIndex < halfLength) {\n\t                const leftIndex = currentIndex * 2 + 1;\n\t                const rightIndex = leftIndex + 1;\n\t                let bestChildIndex = leftIndex;\n\t                let bestChild = this.timers[leftIndex];\n\n\t                if (\n\t                    rightIndex < this.timers.length &&\n\t                    compareTimers(this.timers[rightIndex], bestChild) < 0\n\t                ) {\n\t                    bestChildIndex = rightIndex;\n\t                    bestChild = this.timers[rightIndex];\n\t                }\n\n\t                if (compareTimers(bestChild, timer) < 0) {\n\t                    this.timers[currentIndex] = bestChild;\n\t                    bestChild.heapIndex = currentIndex;\n\t                    currentIndex = bestChildIndex;\n\t                } else {\n\t                    break;\n\t                }\n\t            }\n\t            this.timers[currentIndex] = timer;\n\t            timer.heapIndex = currentIndex;\n\t        }\n\t    }\n\n\t    /**\n\t     * Ensure timer storage and heap stay in sync even if a clear path touches\n\t     * timer state before anything has been scheduled.\n\t     *\n\t     * Why do we need two data structures to keep tabs on timers?\n\t     * 1. Fast ID Lookup (clock.timers): This is a Map from timer IDs to their respective timer objects. It allows clearTimeout(id) and\n\t     * clearInterval(id) to be $O(1)$ operations. Without this map, finding a specific timer in the heap to remove it would require a linear\n\t     * $O(n)$ search, which would significantly degrade performance as the number of active timers grows.\n\t     * 2. Efficient Scheduling (clock.timerHeap): This is a priority queue (min-heap) that keeps timers ordered by their execution time (callAt). It\n\t     * allows the library to instantly find the next timer to run (peek() in $O(1)$) and efficiently update the schedule when timers are added or\n\t     * removed ($O(\\log n)$).\n\t     *\n\t     * In short: clock.timers provides fast access by ID, while clock.timerHeap provides fast access by Time. Removing either one would make common\n\t     * operations (like clearing or finding the next timer) much slower.\n\t     * @param {Clock} clock\n\t     */\n\t    function ensureTimerState(clock) {\n\t        if (!clock.timers) {\n\t            clock.timers = new Map();\n\t            clock.timerHeap = new TimerHeap();\n\t        }\n\t    }\n\n\t    /**\n\t     * @param {Clock} clock\n\t     * @param {number} id\n\t     * @returns {boolean}\n\t     */\n\t    function hasTimer(clock, id) {\n\t        return clock.timers ? clock.timers.has(id) : false;\n\t    }\n\n\t    /**\n\t     * @param {Clock} clock\n\t     * @param {number} id\n\t     * @returns {Timer}\n\t     */\n\t    function getTimer(clock, id) {\n\t        return clock.timers ? clock.timers.get(id) : undefined;\n\t    }\n\n\t    /**\n\t     * @param {Clock} clock\n\t     * @param {Timer} timer\n\t     */\n\t    function setTimer(clock, timer) {\n\t        ensureTimerState(clock);\n\t        clock.timers.set(timer.id, timer);\n\t    }\n\n\t    /**\n\t     * @param {Clock} clock\n\t     * @param {number} id\n\t     * @returns {boolean}\n\t     */\n\t    function deleteTimer(clock, id) {\n\t        return clock.timers ? clock.timers.delete(id) : false;\n\t    }\n\n\t    /**\n\t     * @param {Clock} clock\n\t     * @param {(timer: Timer) => void} callback\n\t     */\n\t    function forEachActiveTimer(clock, callback) {\n\t        if (!clock.timers) {\n\t            return;\n\t        }\n\n\t        for (const timer of clock.timers.values()) {\n\t            callback(timer);\n\t        }\n\t    }\n\n\t    /**\n\t     * @param {Clock} clock\n\t     */\n\t    function rebuildTimerHeap(clock) {\n\t        clock.timerHeap = new TimerHeap();\n\t        forEachActiveTimer(clock, (timer) => {\n\t            clock.timerHeap.push(timer);\n\t        });\n\t    }\n\n\t    /**\n\t     * @param {Clock} clock\n\t     * @param {TimerInitialProps} timer\n\t     * @returns {TimerId} id of the created timer\n\t     */\n\t    function addTimer(clock, timer) {\n\t        if (timer.func === undefined) {\n\t            throw new Error(\"Callback must be provided to timer calls\");\n\t        }\n\n\t        if (typeof timer.func !== \"function\") {\n\t            throw new TypeError(\n\t                `[ERR_INVALID_CALLBACK]: Callback must be a function. Received ${\n\t                    timer.func\n\t                } of type ${typeof timer.func}`,\n\t            );\n\t        }\n\n\t        if (clock.isNearInfiniteLimit) {\n\t            timer.error = new Error();\n\t        }\n\n\t        timer.type = timer.immediate ? \"Immediate\" : \"Timeout\";\n\n\t        if (Object.prototype.hasOwnProperty.call(timer, \"delay\")) {\n\t            if (typeof timer.delay !== \"number\") {\n\t                timer.delay = parseInt(timer.delay, 10);\n\t            }\n\n\t            if (!isNumberFinite(timer.delay)) {\n\t                timer.delay = 0;\n\t            }\n\t            timer.delay = timer.delay > maxTimeout ? 1 : timer.delay;\n\t            timer.delay = Math.max(0, timer.delay);\n\t        }\n\n\t        if (Object.prototype.hasOwnProperty.call(timer, \"interval\")) {\n\t            timer.type = \"Interval\";\n\t            timer.interval = timer.interval > maxTimeout ? 1 : timer.interval;\n\t        }\n\n\t        if (Object.prototype.hasOwnProperty.call(timer, \"animation\")) {\n\t            timer.type = \"AnimationFrame\";\n\t            timer.animation = true;\n\t        }\n\n\t        if (\n\t            Object.prototype.hasOwnProperty.call(timer, \"requestIdleCallback\")\n\t        ) {\n\t            // mark timer as IdleCallback type if it has no delay, otherwise it'd be of type timeout\n\t            // this way we are able to sort such that the timer only gets called when there's truly no pending task to run\n\t            if (!timer.delay) {\n\t                timer.type = \"IdleCallback\";\n\t            }\n\t            timer.requestIdleCallback = true;\n\t        }\n\n\t        ensureTimerState(clock);\n\n\t        while (hasTimer(clock, uniqueTimerId)) {\n\t            uniqueTimerId++;\n\t            if (uniqueTimerId >= Number.MAX_SAFE_INTEGER) {\n\t                uniqueTimerId = idCounterStart;\n\t            }\n\t        }\n\n\t        timer.id = uniqueTimerId++;\n\t        if (uniqueTimerId >= Number.MAX_SAFE_INTEGER) {\n\t            uniqueTimerId = idCounterStart;\n\t        }\n\n\t        timer.order = uniqueTimerOrder++;\n\t        timer.createdAt = clock.now;\n\t        timer.callAt =\n\t            clock.now +\n\t            (parseInt(String(timer.delay)) || (clock.duringTick ? 1 : 0));\n\n\t        setTimer(clock, timer);\n\t        clock.timerHeap.push(timer);\n\n\t        if (addTimerReturnsObject) {\n\t            const res = {\n\t                refed: true,\n\t                ref: function () {\n\t                    this.refed = true;\n\t                    return this;\n\t                },\n\t                unref: function () {\n\t                    this.refed = false;\n\t                    return this;\n\t                },\n\t                hasRef: function () {\n\t                    return this.refed;\n\t                },\n\t                refresh: function () {\n\t                    timer.callAt =\n\t                        clock.now +\n\t                        (parseInt(String(timer.delay)) ||\n\t                            (clock.duringTick ? 1 : 0));\n\n\t                    clock.timerHeap.remove(timer);\n\t                    timer.order = uniqueTimerOrder++;\n\t                    setTimer(clock, timer);\n\t                    clock.timerHeap.push(timer);\n\n\t                    return this;\n\t                },\n\t                [Symbol.toPrimitive]: function () {\n\t                    return timer.id;\n\t                },\n\t            };\n\t            return res;\n\t        }\n\n\t        return timer.id;\n\t    }\n\n\t    /* eslint consistent-return: \"off\" */\n\t    /**\n\t     * Timer comparator\n\t     * @param {Timer} a\n\t     * @param {Timer} b\n\t     * @returns {number}\n\t     */\n\t    function compareTimers(a, b) {\n\t        // Sort IdleCallback timers to the bottom when scheduled for the same time\n\t        if (a.type === \"IdleCallback\" && b.type !== \"IdleCallback\") {\n\t            return 1;\n\t        }\n\t        if (a.type !== \"IdleCallback\" && b.type === \"IdleCallback\") {\n\t            return -1;\n\t        }\n\n\t        // Sort first by absolute timing\n\t        if (a.callAt < b.callAt) {\n\t            return -1;\n\t        }\n\t        if (a.callAt > b.callAt) {\n\t            return 1;\n\t        }\n\n\t        // Sort next by immediate, immediate timers take precedence\n\t        if (a.immediate && !b.immediate) {\n\t            return -1;\n\t        }\n\t        if (!a.immediate && b.immediate) {\n\t            return 1;\n\t        }\n\n\t        if (a.order < b.order) {\n\t            return -1;\n\t        }\n\t        if (a.order > b.order) {\n\t            return 1;\n\t        }\n\n\t        // Sort next by creation time, earlier-created timers take precedence\n\t        if (a.createdAt < b.createdAt) {\n\t            return -1;\n\t        }\n\t        if (a.createdAt > b.createdAt) {\n\t            return 1;\n\t        }\n\n\t        // Sort next by id, lower-id timers take precedence\n\t        if (a.id < b.id) {\n\t            return -1;\n\t        }\n\t        if (a.id > b.id) {\n\t            return 1;\n\t        }\n\n\t        // As timer ids are unique, no fallback `0` is necessary\n\t        return 0;\n\t    }\n\n\t    /**\n\t     * @param {Clock} clock\n\t     * @param {number} from\n\t     * @param {number} to\n\t     * @returns {Timer}\n\t     */\n\t    function firstTimerInRange(clock, from, to) {\n\t        if (!clock.timerHeap) {\n\t            return null;\n\t        }\n\n\t        const timers = clock.timerHeap.timers;\n\t        if (timers.length === 1 && timers[0].requestIdleCallback) {\n\t            return timers[0];\n\t        }\n\n\t        const first = clock.timerHeap.peek();\n\t        if (first && inRange(from, to, first)) {\n\t            return first;\n\t        }\n\n\t        /**\n\t         * @type {?Timer}\n\t         */\n\t        let timer = null;\n\n\t        for (let i = 0; i < timers.length; i++) {\n\t            if (\n\t                inRange(from, to, timers[i]) &&\n\t                (!timer || compareTimers(timer, timers[i]) === 1)\n\t            ) {\n\t                timer = timers[i];\n\t            }\n\t        }\n\n\t        return timer;\n\t    }\n\n\t    /**\n\t     * @param {Clock} clock\n\t     * @returns {Timer}\n\t     */\n\t    function firstTimer(clock) {\n\t        if (!clock.timerHeap) {\n\t            return null;\n\t        }\n\t        return clock.timerHeap.peek() || null;\n\t    }\n\n\t    /**\n\t     * @param {Clock} clock\n\t     * @returns {Timer}\n\t     */\n\t    function lastTimer(clock) {\n\t        if (!clock.timerHeap) {\n\t            return null;\n\t        }\n\t        const timers = clock.timerHeap.timers;\n\t        let timer = null;\n\n\t        for (let i = 0; i < timers.length; i++) {\n\t            if (!timer || compareTimers(timer, timers[i]) === -1) {\n\t                timer = timers[i];\n\t            }\n\t        }\n\n\t        return timer;\n\t    }\n\n\t    /**\n\t     * @param {Clock} clock\n\t     * @param {Timer} timer\n\t     */\n\t    function callTimer(clock, timer) {\n\t        if (typeof timer.interval === \"number\") {\n\t            clock.timerHeap.remove(timer);\n\t            timer.callAt += timer.interval;\n\t            timer.order = uniqueTimerOrder++;\n\t            if (clock.isNearInfiniteLimit) {\n\t                timer.error = new Error();\n\t            }\n\t            clock.timerHeap.push(timer);\n\t        } else {\n\t            deleteTimer(clock, timer.id);\n\t            clock.timerHeap.remove(timer);\n\t        }\n\n\t        if (typeof timer.func === \"function\") {\n\t            timer.func.apply(null, timer.args);\n\t        }\n\t    }\n\n\t    /**\n\t     * Gets clear handler name for a given timer type\n\t     * @param {string} ttype\n\t     * @returns {string}\n\t     */\n\t    function getClearHandler(ttype) {\n\t        if (ttype === \"IdleCallback\" || ttype === \"AnimationFrame\") {\n\t            return `cancel${ttype}`;\n\t        }\n\t        return `clear${ttype}`;\n\t    }\n\n\t    /**\n\t     * Gets schedule handler name for a given timer type\n\t     * @param {string} ttype\n\t     * @returns {string}\n\t     */\n\t    function getScheduleHandler(ttype) {\n\t        if (ttype === \"IdleCallback\" || ttype === \"AnimationFrame\") {\n\t            return `request${ttype}`;\n\t        }\n\t        return `set${ttype}`;\n\t    }\n\n\t    /**\n\t     * Creates an anonymous function to warn only once\n\t     * @returns {(msg: string) => void}\n\t     */\n\t    function createWarnOnce() {\n\t        let calls = 0;\n\t        return function (msg) {\n\t            // eslint-disable-next-line\n\t            !calls++ && console.warn(msg);\n\t        };\n\t    }\n\t    const warnOnce = createWarnOnce();\n\n\t    /**\n\t     * @param {Clock} clock\n\t     * @param {TimerId} timerId\n\t     * @param {string} ttype\n\t     * @returns {void}\n\t     */\n\t    function clearTimer(clock, timerId, ttype) {\n\t        if (!timerId) {\n\t            // null appears to be allowed in most browsers, and appears to be\n\t            // relied upon by some libraries, like Bootstrap carousel\n\t            return;\n\t        }\n\n\t        // in Node, the ID is stored as the primitive value for `Timeout` objects\n\t        // for `Immediate` objects, no ID exists, so it gets coerced to NaN\n\t        const id = Number(timerId);\n\n\t        if (Number.isNaN(id) || id < idCounterStart) {\n\t            const handlerName = getClearHandler(ttype);\n\n\t            if (clock.shouldClearNativeTimers === true) {\n\t                const nativeHandler = clock[`_${handlerName}`];\n\t                return typeof nativeHandler === \"function\"\n\t                    ? nativeHandler(timerId)\n\t                    : undefined;\n\t            }\n\n\t            // Include the stacktrace, excluding the 'error' line\n\t            const stackTrace = new Error().stack\n\t                .split(\"\\n\")\n\t                .slice(1)\n\t                .join(\"\\n\");\n\n\t            warnOnce(\n\t                `FakeTimers: ${handlerName} was invoked to clear a native timer instead of one created by this library.` +\n\t                    \"\\nTo automatically clean-up native timers, use `shouldClearNativeTimers`.\" +\n\t                    `\\n${stackTrace}`,\n\t            );\n\t        }\n\n\t        if (hasTimer(clock, id)) {\n\t            // check that the ID matches a timer of the correct type\n\t            const timer = getTimer(clock, id);\n\t            if (\n\t                timer.type === ttype ||\n\t                (timer.type === \"Timeout\" && ttype === \"Interval\") ||\n\t                (timer.type === \"Interval\" && ttype === \"Timeout\")\n\t            ) {\n\t                deleteTimer(clock, id);\n\t                clock.timerHeap.remove(timer);\n\t            } else {\n\t                const clear = getClearHandler(ttype);\n\t                const schedule = getScheduleHandler(timer.type);\n\t                throw new Error(\n\t                    `Cannot clear timer: timer created with ${schedule}() but cleared with ${clear}()`,\n\t                );\n\t            }\n\t        }\n\t    }\n\n\t    /**\n\t     * @param {object} target the target containing the method to replace\n\t     * @param {string} method the keyname of the method on the target\n\t     * @param {Clock} clock\n\t     */\n\t    function hijackMethod(target, method, clock) {\n\t        clock[method].hasOwnProperty = Object.prototype.hasOwnProperty.call(\n\t            target,\n\t            method,\n\t        );\n\t        clock[`_${method}`] = target[method];\n\n\t        if (method === \"Date\") {\n\t            target[method] = clock[method];\n\t        } else if (method === \"Intl\") {\n\t            target[method] = clock[method];\n\t        } else if (method === \"Temporal\") {\n\t            target[method] = clock[method];\n\t        } else if (method === \"performance\") {\n\t            const originalPerfDescriptor = Object.getOwnPropertyDescriptor(\n\t                target,\n\t                method,\n\t            );\n\t            // JSDOM has a read only performance field so we have to save/copy it differently\n\t            if (\n\t                originalPerfDescriptor &&\n\t                originalPerfDescriptor.get &&\n\t                !originalPerfDescriptor.set\n\t            ) {\n\t                Object.defineProperty(\n\t                    clock,\n\t                    `_${method}`,\n\t                    originalPerfDescriptor,\n\t                );\n\n\t                const perfDescriptor = Object.getOwnPropertyDescriptor(\n\t                    clock,\n\t                    method,\n\t                );\n\t                Object.defineProperty(target, method, perfDescriptor);\n\t            } else {\n\t                target[method] = clock[method];\n\t            }\n\t        } else {\n\t            target[method] = function () {\n\t                return clock[method].apply(clock, arguments);\n\t            };\n\n\t            Object.defineProperties(\n\t                target[method],\n\t                Object.getOwnPropertyDescriptors(clock[method]),\n\t            );\n\t        }\n\n\t        target[method].clock = clock;\n\t    }\n\n\t    /**\n\t     * @param {Clock} clock\n\t     * @param {number} advanceTimeDelta\n\t     */\n\t    function doIntervalTick(clock, advanceTimeDelta) {\n\t        clock.tick(advanceTimeDelta);\n\t    }\n\n\t    /** @type {Timers} */\n\t    const timers = {\n\t        setTimeout: _global.setTimeout,\n\t        clearTimeout: _global.clearTimeout,\n\t        setInterval: _global.setInterval,\n\t        clearInterval: _global.clearInterval,\n\t        Date: _global.Date,\n\t    };\n\n\t    if (isPresent.setImmediate) {\n\t        timers.setImmediate = _global.setImmediate;\n\t    }\n\n\t    if (isPresent.clearImmediate) {\n\t        timers.clearImmediate = _global.clearImmediate;\n\t    }\n\n\t    if (isPresent.hrtime) {\n\t        timers.hrtime = _global.process.hrtime;\n\t    }\n\n\t    if (isPresent.nextTick) {\n\t        timers.nextTick = _global.process.nextTick;\n\t    }\n\n\t    if (isPresent.performance) {\n\t        timers.performance = _global.performance;\n\t    }\n\n\t    if (isPresent.requestAnimationFrame) {\n\t        timers.requestAnimationFrame = _global.requestAnimationFrame;\n\t    }\n\n\t    if (isPresent.queueMicrotask) {\n\t        timers.queueMicrotask = _global.queueMicrotask;\n\t    }\n\n\t    if (isPresent.cancelAnimationFrame) {\n\t        timers.cancelAnimationFrame = _global.cancelAnimationFrame;\n\t    }\n\n\t    if (isPresent.requestIdleCallback) {\n\t        timers.requestIdleCallback = _global.requestIdleCallback;\n\t    }\n\n\t    if (isPresent.cancelIdleCallback) {\n\t        timers.cancelIdleCallback = _global.cancelIdleCallback;\n\t    }\n\n\t    if (isPresent.Intl) {\n\t        timers.Intl = NativeIntl;\n\t    }\n\n\t    if (isPresent.Temporal) {\n\t        timers.Temporal = NativeTemporal;\n\t    }\n\n\t    const originalSetTimeout = _global.setImmediate || _global.setTimeout;\n\t    const originalClearInterval = _global.clearInterval;\n\t    const originalSetInterval = _global.setInterval;\n\n\t    /**\n\t     * @param {Date|number|TemporalTimelike} [start] the system time - non-integer values are floored\n\t     * @param {number} [loopLimit] maximum number of timers that will be run when calling runAll()\n\t     * @returns {Clock}\n\t     */\n\t    function createClock(start, loopLimit) {\n\t        /** @type {number} */\n\t        // eslint-disable-next-line no-param-reassign\n\t        start = Math.floor(getEpoch(start));\n\t        const startTimestamp = start;\n\t        // eslint-disable-next-line no-param-reassign\n\t        loopLimit = loopLimit || 1000;\n\t        /** @type {number} */\n\t        let nanos = 0;\n\t        let uninstalled = false;\n\t        /** @type {number[]} */\n\t        const adjustedSystemTime = [0, 0]; // [millis, nanoremainder]\n\n\t        /** @type {Clock} */\n\t        const clock = /** @type {Clock} */ ({\n\t            now: start,\n\t            Date: createDate(),\n\t            loopLimit: loopLimit,\n\t            isNearInfiniteLimit: false,\n\t            tickMode: { mode: \"manual\", counter: 0, delta: undefined },\n\t        });\n\n\t        clock.Date.clock = clock;\n\n\t        //eslint-disable-next-line jsdoc/require-jsdoc\n\t        function getTimeToNextFrame() {\n\t            return 16 - ((clock.now - startTimestamp) % 16);\n\t        }\n\n\t        //eslint-disable-next-line jsdoc/require-jsdoc\n\t        function hrtime(prev) {\n\t            const millisSinceStart =\n\t                clock.now - adjustedSystemTime[0] - startTimestamp;\n\t            const secsSinceStart = Math.floor(millisSinceStart / 1000);\n\t            const remainderInNanos =\n\t                (millisSinceStart - secsSinceStart * 1e3) * 1e6 +\n\t                nanos -\n\t                adjustedSystemTime[1];\n\n\t            if (Array.isArray(prev)) {\n\t                if (prev[1] > 1e9) {\n\t                    throw new TypeError(\n\t                        \"Number of nanoseconds can't exceed a billion\",\n\t                    );\n\t                }\n\n\t                const oldSecs = prev[0];\n\t                let nanoDiff = remainderInNanos - prev[1];\n\t                let secDiff = secsSinceStart - oldSecs;\n\n\t                if (nanoDiff < 0) {\n\t                    nanoDiff += 1e9;\n\t                    secDiff -= 1;\n\t                }\n\n\t                return [secDiff, nanoDiff];\n\t            }\n\t            return [secsSinceStart, remainderInNanos];\n\t        }\n\n\t        /**\n\t         * A high resolution timestamp in milliseconds.\n\t         * @typedef {number} DOMHighResTimeStamp\n\t         */\n\n\t        /**\n\t         * performance.now()\n\t         * @returns {DOMHighResTimeStamp}\n\t         */\n\t        function fakePerformanceNow() {\n\t            const hrt = hrtime();\n\t            const millis = hrt[0] * 1000 + hrt[1] / 1e6;\n\t            return millis;\n\t        }\n\n\t        if (isPresent.hrtimeBigint) {\n\t            hrtime.bigint = function () {\n\t                const parts = hrtime();\n\t                return BigInt(parts[0]) * BigInt(1e9) + BigInt(parts[1]);\n\t            };\n\t        }\n\n\t        if (isPresent.Intl) {\n\t            clock.Intl = createIntl(clock);\n\t            clock.Intl.clock = clock;\n\t        }\n\n\t        if (isPresent.Temporal) {\n\t            clock.Temporal = createTemporal(clock, () => nanos);\n\t        }\n\n\t        /**\n\t         * @param {SetTickModeConfig} tickModeConfig - The new configuration for how the clock should tick.\n\t         */\n\t        clock.setTickMode = function (tickModeConfig) {\n\t            const { mode: newMode, delta: newDelta } =\n\t                /** @type {SetTickModeConfig} */ (tickModeConfig);\n\t            const { mode: oldMode, delta: oldDelta } = clock.tickMode;\n\t            if (newMode === oldMode && newDelta === oldDelta) {\n\t                return;\n\t            }\n\n\t            if (oldMode === \"interval\") {\n\t                originalClearInterval(clock.attachedInterval);\n\t            }\n\n\t            clock.tickMode = {\n\t                counter: clock.tickMode.counter + 1,\n\t                mode: newMode,\n\t                delta: newDelta,\n\t            };\n\n\t            if (newMode === \"nextAsync\") {\n\t                advanceUntilModeChanges();\n\t            } else if (newMode === \"interval\") {\n\t                createIntervalTick(clock, newDelta || 20);\n\t            }\n\t        };\n\n\t        /**\n\t         * Keeps advancing the native event loop until the tick mode changes.\n\t         * @returns {Promise<void>}\n\t         */\n\t        async function advanceUntilModeChanges() {\n\t            /**\n\t             * Waits for one native macrotask and then one microtask turn.\n\t             * @returns {Promise<void>}\n\t             */\n\t            async function newMacrotask() {\n\t                // MessageChannel ensures that setTimeout is not throttled to 4ms.\n\t                // https://developer.mozilla.org/en-US/docs/Web/API/setTimeout#reasons_for_delays_longer_than_specified\n\t                // https://stackblitz.com/edit/stackblitz-starters-qtlpcc\n\t                const channel = new MessageChannel();\n\t                await new Promise((resolve) => {\n\t                    channel.port1.onmessage = () => {\n\t                        resolve(undefined);\n\t                        channel.port1.close();\n\t                    };\n\t                    channel.port2.postMessage(undefined);\n\t                });\n\t                channel.port1.close();\n\t                channel.port2.close();\n\t                // setTimeout ensures microtask queue is emptied\n\t                await new Promise((resolve) => {\n\t                    originalSetTimeout(resolve);\n\t                });\n\t            }\n\n\t            const { counter } = clock.tickMode;\n\t            while (clock.tickMode.counter === counter) {\n\t                await newMacrotask();\n\t                if (clock.tickMode.counter !== counter) {\n\t                    return;\n\t                }\n\t                clock.next();\n\t            }\n\t        }\n\n\t        /**\n\t         * Temporarily pauses nextAsync auto-ticking while an async operation runs.\n\t         * @param {Promise<unknown>} promise\n\t         * @returns {Promise<unknown>}\n\t         */\n\t        function pauseAutoTickUntilFinished(promise) {\n\t            if (clock.tickMode.mode !== \"nextAsync\") {\n\t                return promise;\n\t            }\n\t            clock.setTickMode({ mode: \"manual\" });\n\t            return promise.finally(() => {\n\t                if (!uninstalled) {\n\t                    clock.setTickMode({ mode: \"nextAsync\" });\n\t                }\n\t            });\n\t        }\n\n\t        /**\n\t         * Returns the remaining time in the current idle window.\n\t         * @returns {number}\n\t         */\n\t        function getTimeToNextIdlePeriod() {\n\t            let timeToNextIdlePeriod = 0;\n\n\t            if (clock.countTimers() > 0) {\n\t                timeToNextIdlePeriod = 50; // const for now\n\t            }\n\n\t            return timeToNextIdlePeriod;\n\t        }\n\n\t        clock.requestIdleCallback = function requestIdleCallback(\n\t            func,\n\t            { timeout } = /** @type {{ timeout?: number }} */ ({}),\n\t        ) {\n\t            /**\n\t             * @type {IdleDeadline}\n\t             */\n\t            const idleDeadline = {\n\t                didTimeout: true,\n\t                timeRemaining: getTimeToNextIdlePeriod,\n\t            };\n\n\t            const result = addTimer(clock, {\n\t                func: func,\n\t                args: [idleDeadline],\n\t                delay: timeout,\n\t                requestIdleCallback: true,\n\t            });\n\n\t            return Number(result);\n\t        };\n\n\t        clock.cancelIdleCallback = function cancelIdleCallback(timerId) {\n\t            return clearTimer(clock, timerId, \"IdleCallback\");\n\t        };\n\n\t        clock.setTimeout = function setTimeout(func, timeout) {\n\t            return addTimer(clock, {\n\t                func: func,\n\t                args: Array.prototype.slice.call(arguments, 2),\n\t                delay: timeout,\n\t            });\n\t        };\n\t        if (typeof _global.Promise !== \"undefined\" && utilPromisify) {\n\t            clock.setTimeout[utilPromisify.custom] =\n\t                function promisifiedSetTimeout(timeout, arg) {\n\t                    return new _global.Promise(function setTimeoutExecutor(\n\t                        resolve,\n\t                    ) {\n\t                        addTimer(clock, {\n\t                            func: resolve,\n\t                            args: [arg],\n\t                            delay: timeout,\n\t                        });\n\t                    });\n\t                };\n\t        }\n\n\t        clock.clearTimeout = function clearTimeout(timerId) {\n\t            return clearTimer(clock, timerId, \"Timeout\");\n\t        };\n\n\t        clock.nextTick = function nextTick(func) {\n\t            return enqueueJob(clock, {\n\t                func: func,\n\t                args: Array.prototype.slice.call(arguments, 1),\n\t                error: clock.isNearInfiniteLimit ? new Error() : null,\n\t            });\n\t        };\n\n\t        clock.queueMicrotask = function queueMicrotask(func) {\n\t            return clock.nextTick(func); // explicitly drop additional arguments\n\t        };\n\n\t        clock.setInterval = function setInterval(func, timeout) {\n\t            // eslint-disable-next-line no-param-reassign\n\t            timeout = parseInt(String(timeout), 10);\n\t            return addTimer(clock, {\n\t                func: func,\n\t                args: Array.prototype.slice.call(arguments, 2),\n\t                delay: timeout,\n\t                interval: timeout,\n\t            });\n\t        };\n\n\t        clock.clearInterval = function clearInterval(timerId) {\n\t            return clearTimer(clock, timerId, \"Interval\");\n\t        };\n\n\t        if (isPresent.setImmediate) {\n\t            clock.setImmediate = /** @type {SetImmediate} */ (\n\t                function setImmediate(func) {\n\t                    return addTimer(clock, {\n\t                        func: func,\n\t                        args: Array.prototype.slice.call(arguments, 1),\n\t                        immediate: true,\n\t                    });\n\t                }\n\t            );\n\n\t            if (typeof _global.Promise !== \"undefined\" && utilPromisify) {\n\t                clock.setImmediate[utilPromisify.custom] =\n\t                    function promisifiedSetImmediate(arg) {\n\t                        return new _global.Promise(\n\t                            function setImmediateExecutor(resolve) {\n\t                                addTimer(clock, {\n\t                                    func: resolve,\n\t                                    args: [arg],\n\t                                    immediate: true,\n\t                                });\n\t                            },\n\t                        );\n\t                    };\n\t            }\n\n\t            clock.clearImmediate = function clearImmediate(timerId) {\n\t                return clearTimer(clock, timerId, \"Immediate\");\n\t            };\n\t        }\n\n\t        clock.countTimers = function countTimers() {\n\t            return (\n\t                (clock.timerHeap ? clock.timerHeap.timers.length : 0) +\n\t                (clock.jobs || []).length\n\t            );\n\t        };\n\n\t        clock.requestAnimationFrame = function requestAnimationFrame(func) {\n\t            const result = addTimer(clock, {\n\t                func: func,\n\t                delay: getTimeToNextFrame(),\n\t                get args() {\n\t                    return [fakePerformanceNow()];\n\t                },\n\t                animation: true,\n\t            });\n\n\t            return Number(result);\n\t        };\n\n\t        clock.cancelAnimationFrame = function cancelAnimationFrame(timerId) {\n\t            return clearTimer(clock, timerId, \"AnimationFrame\");\n\t        };\n\n\t        clock.runMicrotasks = function runMicrotasks() {\n\t            runJobs(clock);\n\t        };\n\n\t        //eslint-disable-next-line jsdoc/require-jsdoc\n\t        function durationToMs(duration) {\n\t            // relativeTo uses the real system timezone — fake-timers fakes time, not place.\n\t            // Calendar-unit durations (months, years) will resolve DST/length using the host tz.\n\t            const relativeTo = NativeTemporal.Instant.fromEpochMilliseconds(\n\t                clock.now,\n\t            ).toZonedDateTimeISO(NativeTemporal.Now.timeZoneId());\n\t            return duration.total({ unit: \"millisecond\", relativeTo });\n\t        }\n\n\t        /**\n\t         * @param {number|string|TemporalDuration} tickValue\n\t         * @returns {number} milliseconds as a float\n\t         */\n\t        function tickValueToMs(tickValue) {\n\t            if (typeof tickValue === \"number\") {\n\t                return tickValue;\n\t            }\n\t            if (\n\t                isPresent.Temporal &&\n\t                tickValue !== null &&\n\t                typeof tickValue === \"object\" &&\n\t                typeof (/** @type {TemporalDuration} */ (tickValue).total) ===\n\t                    \"function\"\n\t            ) {\n\t                return durationToMs(\n\t                    /** @type {TemporalDuration} */ (tickValue),\n\t                );\n\t            }\n\t            return parseTime(/** @type {string} */ (tickValue));\n\t        }\n\n\t        /**\n\t         * @param {number|string|TemporalDuration} tickValue milliseconds, a string parseable by parseTime, or a Temporal.Duration\n\t         * @returns {ClockState} a mutable state object for the tick execution\n\t         */\n\t        function createTickState(tickValue) {\n\t            const msFloat = tickValueToMs(tickValue);\n\t            const ms = Math.floor(msFloat);\n\t            const remainder = nanoRemainder(msFloat);\n\t            let nanosTotal = nanos + remainder;\n\t            let tickTo = clock.now + ms;\n\n\t            if (msFloat < 0) {\n\t                throw new TypeError(\"Negative ticks are not supported\");\n\t            }\n\n\t            // adjust for positive overflow\n\t            if (nanosTotal >= 1e6) {\n\t                tickTo += 1;\n\t                nanosTotal -= 1e6;\n\t            }\n\n\t            return /** @type {ClockState} */ ({\n\t                msFloat: msFloat,\n\t                ms: ms,\n\t                nanosTotal: nanosTotal,\n\t                tickFrom: clock.now,\n\t                tickTo: tickTo,\n\t                previous: clock.now,\n\t                timer: null,\n\t                firstException: null,\n\t                oldNow: null,\n\t            });\n\t        }\n\n\t        /**\n\t         * @param {ClockState} state mutable tick state\n\t         * @param {number} oldNow the clock.now before some action\n\t         * @param {object} [options] compensation options\n\t         * @param {boolean} [options.includePrevious] whether to also update state.previous\n\t         */\n\t        function applyClockChangeCompensation(state, oldNow, options) {\n\t            if (oldNow !== clock.now) {\n\t                const difference = clock.now - oldNow;\n\t                state.tickFrom += difference;\n\t                state.tickTo += difference;\n\t                if (options && options.includePrevious) {\n\t                    state.previous += difference;\n\t                }\n\t            }\n\t        }\n\n\t        /**\n\t         * @param {ClockState} state mutable tick state\n\t         */\n\t        function runInitialJobs(state) {\n\t            state.oldNow = clock.now;\n\t            runJobs(clock);\n\t            applyClockChangeCompensation(state, state.oldNow);\n\t        }\n\n\t        /**\n\t         * @param {ClockState} state mutable tick state\n\t         */\n\t        function runPostLoopJobs(state) {\n\t            state.oldNow = clock.now;\n\t            runJobs(clock);\n\t            applyClockChangeCompensation(state, state.oldNow);\n\t        }\n\n\t        /**\n\t         * @param {ClockState} state mutable tick state\n\t         */\n\t        function selectNextTimerInRange(state) {\n\t            state.timer = firstTimerInRange(\n\t                clock,\n\t                state.previous,\n\t                state.tickTo,\n\t            );\n\t            state.previous = state.tickFrom;\n\t        }\n\n\t        /**\n\t         * @param {ClockState} state mutable tick state\n\t         * @param {boolean} isAsync whether this is an async tick\n\t         * @param {FakeTimersFunction} nextPromiseTick callback for async promise settlement\n\t         * @param {FakeTimersFunction} compensationCheck callback for clock change compensation\n\t         * @returns {boolean} whether an early return was triggered (async mode)\n\t         */\n\t        function runTimersInRange(\n\t            state,\n\t            isAsync,\n\t            nextPromiseTick,\n\t            compensationCheck,\n\t        ) {\n\t            state.timer = firstTimerInRange(\n\t                clock,\n\t                state.tickFrom,\n\t                state.tickTo,\n\t            );\n\n\t            while (state.timer && state.tickFrom <= state.tickTo) {\n\t                if (hasTimer(clock, state.timer.id)) {\n\t                    state.tickFrom = state.timer.callAt;\n\t                    clock.now = state.timer.callAt;\n\t                    state.oldNow = clock.now;\n\t                    try {\n\t                        runJobs(clock);\n\t                        callTimer(clock, state.timer);\n\t                    } catch (e) {\n\t                        state.firstException = state.firstException || e;\n\t                    }\n\n\t                    if (isAsync) {\n\t                        // finish up after native setImmediate callback to allow\n\t                        // all native es6 promises to process their callbacks after\n\t                        // each timer fires.\n\t                        originalSetTimeout(nextPromiseTick);\n\t                        return true;\n\t                    }\n\n\t                    compensationCheck();\n\t                }\n\n\t                selectNextTimerInRange(state);\n\t            }\n\t            return false;\n\t        }\n\n\t        /**\n\t         * @param {ClockState} state mutable tick state\n\t         * @param {boolean} isAsync whether this is an async tick\n\t         * @param {FakeTimersFunction} resolve promise resolve function\n\t         * @returns {number|undefined} the new clock.now or nothing for async\n\t         */\n\t        function finalizeTick(state, isAsync, resolve) {\n\t            // corner case: during runJobs new timers were scheduled which could be in the range [clock.now, tickTo]\n\t            state.timer = firstTimerInRange(\n\t                clock,\n\t                state.tickFrom,\n\t                state.tickTo,\n\t            );\n\t            if (state.timer) {\n\t                try {\n\t                    clock.tick(state.tickTo - clock.now); // do it all again - for the remainder of the requested range\n\t                } catch (e) {\n\t                    state.firstException = state.firstException || e;\n\t                }\n\t            } else {\n\t                // no timers remaining in the requested range: move the clock all the way to the end\n\t                clock.now = state.tickTo;\n\n\t                // update nanos\n\t                nanos = state.nanosTotal;\n\t            }\n\t            if (state.firstException) {\n\t                throw state.firstException;\n\t            }\n\n\t            if (isAsync) {\n\t                resolve(clock.now);\n\t            } else {\n\t                return clock.now;\n\t            }\n\t        }\n\n\t        /**\n\t         * @param {number|string|TemporalDuration} tickValue milliseconds or a string parseable by parseTime\n\t         * @param {boolean} isAsync whether this is an async tick\n\t         * @param {FakeTimersFunction} [resolve] promise resolve function\n\t         * @param {FakeTimersFunction} [reject] promise reject function\n\t         * @returns {number|undefined} the new clock.now or nothing for async\n\t         */\n\t        function doTick(tickValue, isAsync, resolve, reject) {\n\t            /** @type {ClockState} */\n\t            const state = createTickState(tickValue);\n\n\t            nanos = state.nanosTotal;\n\t            clock.duringTick = true;\n\n\t            runInitialJobs(state);\n\n\t            const compensationCheck = function () {\n\t                applyClockChangeCompensation(state, state.oldNow, {\n\t                    includePrevious: true,\n\t                });\n\t            };\n\n\t            const nextPromiseTick =\n\t                isAsync &&\n\t                function () {\n\t                    try {\n\t                        compensationCheck();\n\t                        selectNextTimerInRange(state);\n\t                        doTickInner();\n\t                    } catch (e) {\n\t                        reject(e);\n\t                    }\n\t                };\n\n\t            //eslint-disable-next-line jsdoc/require-jsdoc\n\t            function doTickInner() {\n\t                if (\n\t                    runTimersInRange(\n\t                        state,\n\t                        isAsync,\n\t                        nextPromiseTick,\n\t                        compensationCheck,\n\t                    )\n\t                ) {\n\t                    return;\n\t                }\n\n\t                runPostLoopJobs(state);\n\t                clock.duringTick = false;\n\n\t                return finalizeTick(state, isAsync, resolve);\n\t            }\n\n\t            return doTickInner();\n\t        }\n\n\t        /**\n\t         * @param {string|number|TemporalDuration} tickValue number of milliseconds, a human-readable value like \"01:11:15\", or a Temporal.Duration\n\t         * @returns {number} will return the new `now` value\n\t         */\n\t        clock.tick = function tick(tickValue) {\n\t            return doTick(tickValue, false);\n\t        };\n\n\t        clock.next = function next() {\n\t            runJobs(clock);\n\t            const timer = firstTimer(clock);\n\t            if (!timer) {\n\t                return clock.now;\n\t            }\n\n\t            clock.duringTick = true;\n\t            try {\n\t                clock.now = timer.callAt;\n\t                callTimer(clock, timer);\n\t                runJobs(clock);\n\t                return clock.now;\n\t            } finally {\n\t                clock.duringTick = false;\n\t            }\n\t        };\n\n\t        /**\n\t         * @param {(resolve: (value: unknown) => void, reject: (reason?: unknown) => void) => void} callback function to run inside native setTimeout\n\t         * @returns {Promise}\n\t         */\n\t        function runAsyncWithNativeTimeout(callback) {\n\t            return pauseAutoTickUntilFinished(\n\t                new _global.Promise(function (resolve, reject) {\n\t                    originalSetTimeout(function () {\n\t                        try {\n\t                            callback(resolve, reject);\n\t                        } catch (e) {\n\t                            reject(e);\n\t                        }\n\t                    });\n\t                }),\n\t            );\n\t        }\n\n\t        clock.runAll = function runAll() {\n\t            runJobs(clock);\n\t            for (let i = 0; i < clock.loopLimit; i++) {\n\t                if (!clock.timers) {\n\t                    resetIsNearInfiniteLimit(clock);\n\t                    return clock.now;\n\t                }\n\n\t                const numTimers = clock.timerHeap.timers.length;\n\t                if (numTimers === 0) {\n\t                    resetIsNearInfiniteLimit(clock);\n\t                    return clock.now;\n\t                }\n\n\t                checkIsNearInfiniteLimit(clock, i);\n\t                clock.next();\n\t            }\n\n\t            const excessJob = firstTimer(clock);\n\t            throw getInfiniteLoopError(clock, excessJob);\n\t        };\n\n\t        clock.runToFrame = function runToFrame() {\n\t            return clock.tick(getTimeToNextFrame());\n\t        };\n\n\t        clock.runToLast = function runToLast() {\n\t            const timer = lastTimer(clock);\n\t            if (!timer) {\n\t                runJobs(clock);\n\t                return clock.now;\n\t            }\n\n\t            return clock.tick(timer.callAt - clock.now);\n\t        };\n\n\t        if (typeof _global.Promise !== \"undefined\") {\n\t            /**\n\t             * @param {string|number|TemporalDuration} tickValue number of milliseconds, a human-readable value like \"01:11:15\", or a Temporal.Duration\n\t             * @returns {Promise}\n\t             */\n\t            clock.tickAsync = function tickAsync(tickValue) {\n\t                return runAsyncWithNativeTimeout(function (resolve, reject) {\n\t                    doTick(tickValue, true, resolve, reject);\n\t                });\n\t            };\n\n\t            clock.nextAsync = function nextAsync() {\n\t                return runAsyncWithNativeTimeout(function (resolve, reject) {\n\t                    const timer = firstTimer(clock);\n\t                    if (!timer) {\n\t                        resolve(clock.now);\n\t                        return;\n\t                    }\n\n\t                    let err;\n\t                    clock.duringTick = true;\n\t                    clock.now = timer.callAt;\n\t                    try {\n\t                        callTimer(clock, timer);\n\t                    } catch (e) {\n\t                        err = e;\n\t                    }\n\t                    clock.duringTick = false;\n\n\t                    originalSetTimeout(function () {\n\t                        if (err) {\n\t                            reject(err);\n\t                        } else {\n\t                            resolve(clock.now);\n\t                        }\n\t                    });\n\t                });\n\t            };\n\n\t            clock.runAllAsync = function runAllAsync() {\n\t                let i = 0;\n\t                /**\n\t                 * @param {(value: unknown) => void} resolve promise resolve function\n\t                 * @param {(reason?: unknown) => void} reject promise reject function\n\t                 */\n\t                function doRun(resolve, reject) {\n\t                    try {\n\t                        runJobs(clock);\n\n\t                        let numTimers;\n\t                        if (i < clock.loopLimit) {\n\t                            if (!clock.timerHeap) {\n\t                                resetIsNearInfiniteLimit(clock);\n\t                                resolve(clock.now);\n\t                                return;\n\t                            }\n\n\t                            numTimers = clock.timerHeap.timers.length;\n\t                            if (numTimers === 0) {\n\t                                resetIsNearInfiniteLimit(clock);\n\t                                resolve(clock.now);\n\t                                return;\n\t                            }\n\n\t                            checkIsNearInfiniteLimit(clock, i);\n\t                            clock.next();\n\n\t                            i++;\n\n\t                            originalSetTimeout(function () {\n\t                                doRun(resolve, reject);\n\t                            });\n\t                            return;\n\t                        }\n\n\t                        const excessJob = firstTimer(clock);\n\t                        reject(getInfiniteLoopError(clock, excessJob));\n\t                    } catch (e) {\n\t                        reject(e);\n\t                    }\n\t                }\n\n\t                return runAsyncWithNativeTimeout(function (resolve, reject) {\n\t                    doRun(resolve, reject);\n\t                });\n\t            };\n\n\t            clock.runToLastAsync = function runToLastAsync() {\n\t                return runAsyncWithNativeTimeout(function (resolve) {\n\t                    const timer = lastTimer(clock);\n\t                    if (!timer) {\n\t                        runJobs(clock);\n\t                        resolve(clock.now);\n\t                        return;\n\t                    }\n\n\t                    resolve(clock.tickAsync(timer.callAt - clock.now));\n\t                });\n\t            };\n\t        }\n\n\t        clock.reset = function reset() {\n\t            nanos = 0;\n\t            clock.timers = new Map();\n\t            clock.timerHeap = new TimerHeap();\n\t            clock.jobs = [];\n\t            clock.now = start;\n\t        };\n\n\t        clock.setSystemTime = function setSystemTime(systemTime) {\n\t            // determine time difference\n\t            const newNow = getEpoch(systemTime);\n\t            const difference = newNow - clock.now;\n\n\t            adjustedSystemTime[0] = adjustedSystemTime[0] + difference;\n\t            adjustedSystemTime[1] = adjustedSystemTime[1] + nanos;\n\t            // update 'system clock'\n\t            clock.now = newNow;\n\t            nanos = 0;\n\n\t            // update timers and intervals to keep them stable\n\t            forEachActiveTimer(clock, (timer) => {\n\t                timer.createdAt += difference;\n\t                timer.callAt += difference;\n\t            });\n\t        };\n\n\t        /**\n\t         * @param {string|number|TemporalDuration} tickValue number of milliseconds, a human-readable value like \"01:11:15\", or a Temporal.Duration\n\t         * @returns {number} the new `now` value\n\t         */\n\t        clock.jump = function jump(tickValue) {\n\t            const msFloat = tickValueToMs(tickValue);\n\t            const ms = Math.floor(msFloat);\n\n\t            forEachActiveTimer(clock, (timer) => {\n\t                if (clock.now + ms > timer.callAt) {\n\t                    timer.callAt = clock.now + ms;\n\t                }\n\t            });\n\n\t            // Rebuild heap as order might have changed\n\t            rebuildTimerHeap(clock);\n\n\t            clock.tick(ms);\n\t            return clock.now;\n\t        };\n\n\t        if (isPresent.performance) {\n\t            clock.performance = Object.create(null);\n\t            clock.performance.now = fakePerformanceNow;\n\t        }\n\n\t        if (isPresent.hrtime) {\n\t            clock.hrtime = hrtime;\n\t        }\n\n\t        /**\n\t         * @returns {Timer[]}\n\t         */\n\t        clock.uninstall = function () {\n\t            uninstalled = true;\n\t            clock.setTickMode({ mode: \"manual\" });\n\n\t            if (clock.methods) {\n\t                const installedHrTime = \"_hrtime\";\n\t                const installedNextTick = \"_nextTick\";\n\t                let method, i, l;\n\t                for (i = 0, l = clock.methods.length; i < l; i++) {\n\t                    method = clock.methods[i];\n\t                    if (method === \"hrtime\" && _global.process) {\n\t                        _global.process.hrtime = clock[installedHrTime];\n\t                    } else if (method === \"nextTick\" && _global.process) {\n\t                        _global.process.nextTick = clock[installedNextTick];\n\t                    } else if (method === \"performance\") {\n\t                        const originalPerfDescriptor =\n\t                            Object.getOwnPropertyDescriptor(\n\t                                clock,\n\t                                `_${method}`,\n\t                            );\n\t                        if (\n\t                            originalPerfDescriptor &&\n\t                            originalPerfDescriptor.get &&\n\t                            !originalPerfDescriptor.set\n\t                        ) {\n\t                            Object.defineProperty(\n\t                                _global,\n\t                                method,\n\t                                originalPerfDescriptor,\n\t                            );\n\t                        } else if (originalPerfDescriptor.configurable) {\n\t                            _global[method] = clock[`_${method}`];\n\t                        }\n\t                    } else {\n\t                        if (clock[method] && clock[method].hasOwnProperty) {\n\t                            _global[method] = clock[`_${method}`];\n\t                        } else {\n\t                            try {\n\t                                delete _global[method];\n\t                            } catch {\n\t                                /* eslint no-empty: \"off\" */\n\t                            }\n\t                        }\n\t                    }\n\t                    if (clock.timersModuleMethods !== undefined) {\n\t                        for (\n\t                            let j = 0;\n\t                            j < clock.timersModuleMethods.length;\n\t                            j++\n\t                        ) {\n\t                            const entry = clock.timersModuleMethods[j];\n\t                            timersModule[entry.methodName] = entry.original;\n\t                        }\n\t                    }\n\t                    if (clock.timersPromisesModuleMethods !== undefined) {\n\t                        for (\n\t                            let j = 0;\n\t                            j < clock.timersPromisesModuleMethods.length;\n\t                            j++\n\t                        ) {\n\t                            const entry = clock.timersPromisesModuleMethods[j];\n\t                            timersPromisesModule[entry.methodName] =\n\t                                entry.original;\n\t                        }\n\t                    }\n\t                }\n\n\t                // Prevent multiple executions which will completely remove these props\n\t                clock.methods = [];\n\t            }\n\n\t            if (clock.abortListenerMap) {\n\t                for (const [\n\t                    listener,\n\t                    signal,\n\t                ] of clock.abortListenerMap.entries()) {\n\t                    signal.removeEventListener(\"abort\", listener);\n\t                    clock.abortListenerMap.delete(listener);\n\t                }\n\t            }\n\n\t            // return pending timers, to enable checking what timers remained on uninstall\n\t            if (!clock.timerHeap) {\n\t                return [];\n\t            }\n\t            return clock.timerHeap.timers.slice();\n\t        };\n\n\t        return clock;\n\t    }\n\n\t    /**\n\t     * Starts the interval used to advance the clock automatically.\n\t     * @param {Clock} clock\n\t     * @param {number} delta\n\t     */\n\t    function createIntervalTick(clock, delta) {\n\t        const intervalTick = doIntervalTick.bind(null, clock, delta);\n\t        const intervalId = originalSetInterval(intervalTick, delta);\n\t        clock.attachedInterval = intervalId;\n\t    }\n\n\t    /* eslint-disable complexity */\n\n\t    /**\n\t     * @param {Config=} [config] Optional config\n\t     * @returns {Clock}\n\t     */\n\t    function install(config) {\n\t        if (\n\t            arguments.length > 1 ||\n\t            config instanceof Date ||\n\t            Array.isArray(config) ||\n\t            typeof config === \"number\"\n\t        ) {\n\t            throw new TypeError(\n\t                `FakeTimers.install called with ${String(\n\t                    config,\n\t                )} install requires an object parameter`,\n\t            );\n\t        }\n\n\t        if (_global.Date.isFake === true) {\n\t            // Timers are already faked; this is a problem.\n\t            // Make the user reset timers before continuing.\n\t            throw new TypeError(\n\t                \"Can't install fake timers twice on the same global object.\",\n\t            );\n\t        }\n\n\t        // eslint-disable-next-line no-param-reassign\n\t        config = typeof config !== \"undefined\" ? config : {};\n\t        config.shouldAdvanceTime = config.shouldAdvanceTime || false;\n\t        config.advanceTimeDelta = config.advanceTimeDelta || 20;\n\t        config.shouldClearNativeTimers =\n\t            config.shouldClearNativeTimers || false;\n\n\t        const hasToFake = Object.prototype.hasOwnProperty.call(\n\t            config,\n\t            \"toFake\",\n\t        );\n\t        const hasToNotFake = Object.prototype.hasOwnProperty.call(\n\t            config,\n\t            \"toNotFake\",\n\t        );\n\n\t        if (hasToFake && hasToNotFake) {\n\t            throw new TypeError(\n\t                \"config.toFake and config.toNotFake cannot be used together\",\n\t            );\n\t        }\n\n\t        if (config.target) {\n\t            throw new TypeError(\n\t                \"config.target is no longer supported. Use `withGlobal(target)` instead.\",\n\t            );\n\t        }\n\n\t        /**\n\t         * Handles a missing timer or API name during installation.\n\t         * @param {string} timer - the name of the missing timer or object\n\t         */\n\t        function handleMissingTimer(timer) {\n\t            if (config.ignoreMissingTimers) {\n\t                return;\n\t            }\n\n\t            throw new ReferenceError(\n\t                `non-existent timers and/or objects cannot be faked: '${timer}'`,\n\t            );\n\t        }\n\n\t        let i, l;\n\t        const clock = createClock(config.now, config.loopLimit);\n\t        clock.shouldClearNativeTimers = config.shouldClearNativeTimers;\n\n\t        clock.abortListenerMap = new Map();\n\n\t        if (hasToFake) {\n\t            clock.methods = /** @type {FakeMethod[]} */ (config.toFake || []);\n\t            if (clock.methods.length === 0) {\n\t                clock.methods = /** @type {FakeMethod[]} */ (\n\t                    Object.keys(timers)\n\t                );\n\t            }\n\t        } else if (hasToNotFake) {\n\t            const methodsToNotFake = /** @type {string[]} */ (\n\t                config.toNotFake || []\n\t            );\n\t            clock.methods = /** @type {FakeMethod[]} */ (\n\t                Object.keys(timers).filter(\n\t                    (method) => !methodsToNotFake.includes(method),\n\t                )\n\t            );\n\t        } else {\n\t            clock.methods = /** @type {FakeMethod[]} */ (Object.keys(timers));\n\t        }\n\n\t        if (config.shouldAdvanceTime === true) {\n\t            clock.setTickMode({\n\t                mode: \"interval\",\n\t                delta: config.advanceTimeDelta,\n\t            });\n\t        }\n\n\t        if (clock.methods.includes(\"performance\")) {\n\t            const proto = (() => {\n\t                if (hasPerformanceConstructorPrototype) {\n\t                    return _global.performance.constructor.prototype;\n\t                }\n\t                if (hasPerformancePrototype) {\n\t                    return _global.Performance.prototype;\n\t                }\n\t            })();\n\t            if (proto) {\n\t                Object.getOwnPropertyNames(proto).forEach(function (name) {\n\t                    if (name !== \"now\") {\n\t                        clock.performance[name] =\n\t                            name.indexOf(\"getEntries\") === 0\n\t                                ? NOOP_ARRAY\n\t                                : NOOP;\n\t                    }\n\t                });\n\t                // ensure `mark` returns a value that is valid\n\t                clock.performance.mark = (name) =>\n\t                    new FakePerformanceEntry(name, \"mark\", 0, 0);\n\t                clock.performance.measure = (name) =>\n\t                    new FakePerformanceEntry(name, \"measure\", 0, 100);\n\t                // `timeOrigin` should return the time of when the Window session started\n\t                // (or the Worker was installed)\n\t                clock.performance.timeOrigin = getEpoch(config.now);\n\t            } else if ((config.toFake || []).includes(\"performance\")) {\n\t                handleMissingTimer(\"performance\");\n\t            }\n\t        }\n\t        if (_global === globalObject && timersModule) {\n\t            clock.timersModuleMethods = [];\n\t        }\n\t        if (_global === globalObject && timersPromisesModule) {\n\t            clock.timersPromisesModuleMethods = [];\n\t        }\n\t        for (i = 0, l = clock.methods.length; i < l; i++) {\n\t            const nameOfMethodToReplace = clock.methods[i];\n\n\t            if (!isPresent[nameOfMethodToReplace]) {\n\t                handleMissingTimer(nameOfMethodToReplace);\n\t                // eslint-disable-next-line\n\t                continue;\n\t            }\n\n\t            if (nameOfMethodToReplace === \"hrtime\") {\n\t                if (\n\t                    _global.process &&\n\t                    typeof _global.process.hrtime === \"function\"\n\t                ) {\n\t                    hijackMethod(_global.process, nameOfMethodToReplace, clock);\n\t                }\n\t            } else if (nameOfMethodToReplace === \"nextTick\") {\n\t                if (\n\t                    _global.process &&\n\t                    typeof _global.process.nextTick === \"function\"\n\t                ) {\n\t                    hijackMethod(_global.process, nameOfMethodToReplace, clock);\n\t                }\n\t            } else {\n\t                hijackMethod(_global, nameOfMethodToReplace, clock);\n\t            }\n\t            if (\n\t                clock.timersModuleMethods !== undefined &&\n\t                timersModule[nameOfMethodToReplace]\n\t            ) {\n\t                const original = timersModule[nameOfMethodToReplace];\n\t                clock.timersModuleMethods.push({\n\t                    methodName: nameOfMethodToReplace,\n\t                    original: original,\n\t                });\n\t                timersModule[nameOfMethodToReplace] =\n\t                    _global[nameOfMethodToReplace];\n\t            }\n\t            if (clock.timersPromisesModuleMethods !== undefined) {\n\t                if (nameOfMethodToReplace === \"setTimeout\") {\n\t                    clock.timersPromisesModuleMethods.push({\n\t                        methodName: \"setTimeout\",\n\t                        original: timersPromisesModule.setTimeout,\n\t                    });\n\n\t                    timersPromisesModule.setTimeout = (\n\t                        delay,\n\t                        value,\n\t                        options = {},\n\t                    ) =>\n\t                        new Promise((resolve, reject) => {\n\t                            const abort = () => {\n\t                                options.signal.removeEventListener(\n\t                                    \"abort\",\n\t                                    abort,\n\t                                );\n\t                                clock.abortListenerMap.delete(abort);\n\n\t                                // This is safe, there is no code path that leads to this function\n\t                                // being invoked before handle has been assigned.\n\t                                // eslint-disable-next-line no-use-before-define\n\t                                clock.clearTimeout(handle);\n\t                                reject(options.signal.reason);\n\t                            };\n\n\t                            const handle = clock.setTimeout(() => {\n\t                                if (options.signal) {\n\t                                    options.signal.removeEventListener(\n\t                                        \"abort\",\n\t                                        abort,\n\t                                    );\n\t                                    clock.abortListenerMap.delete(abort);\n\t                                }\n\n\t                                resolve(value);\n\t                            }, delay);\n\n\t                            if (options.signal) {\n\t                                if (options.signal.aborted) {\n\t                                    abort();\n\t                                } else {\n\t                                    options.signal.addEventListener(\n\t                                        \"abort\",\n\t                                        abort,\n\t                                    );\n\t                                    clock.abortListenerMap.set(\n\t                                        abort,\n\t                                        options.signal,\n\t                                    );\n\t                                }\n\t                            }\n\t                        });\n\t                } else if (nameOfMethodToReplace === \"setImmediate\") {\n\t                    clock.timersPromisesModuleMethods.push({\n\t                        methodName: \"setImmediate\",\n\t                        original: timersPromisesModule.setImmediate,\n\t                    });\n\n\t                    timersPromisesModule.setImmediate = (value, options = {}) =>\n\t                        new Promise((resolve, reject) => {\n\t                            const abort = () => {\n\t                                options.signal.removeEventListener(\n\t                                    \"abort\",\n\t                                    abort,\n\t                                );\n\t                                clock.abortListenerMap.delete(abort);\n\n\t                                // This is safe, there is no code path that leads to this function\n\t                                // being invoked before handle has been assigned.\n\t                                // eslint-disable-next-line no-use-before-define\n\t                                clock.clearImmediate(handle);\n\t                                reject(options.signal.reason);\n\t                            };\n\n\t                            const handle = clock.setImmediate(() => {\n\t                                if (options.signal) {\n\t                                    options.signal.removeEventListener(\n\t                                        \"abort\",\n\t                                        abort,\n\t                                    );\n\t                                    clock.abortListenerMap.delete(abort);\n\t                                }\n\n\t                                resolve(value);\n\t                            });\n\n\t                            if (options.signal) {\n\t                                if (options.signal.aborted) {\n\t                                    abort();\n\t                                } else {\n\t                                    options.signal.addEventListener(\n\t                                        \"abort\",\n\t                                        abort,\n\t                                    );\n\t                                    clock.abortListenerMap.set(\n\t                                        abort,\n\t                                        options.signal,\n\t                                    );\n\t                                }\n\t                            }\n\t                        });\n\t                } else if (nameOfMethodToReplace === \"setInterval\") {\n\t                    clock.timersPromisesModuleMethods.push({\n\t                        methodName: \"setInterval\",\n\t                        original: timersPromisesModule.setInterval,\n\t                    });\n\n\t                    timersPromisesModule.setInterval = (\n\t                        delay,\n\t                        value,\n\t                        options = {},\n\t                    ) => ({\n\t                        [Symbol.asyncIterator]: () => {\n\t                            const createResolvable = () => {\n\t                                let resolve, reject;\n\t                                const promise =\n\t                                    /** @type {Promise<unknown> & { resolve: (value: unknown) => void; reject: (reason: unknown) => void }} */ (\n\t                                        new Promise((res, rej) => {\n\t                                            resolve = res;\n\t                                            reject = rej;\n\t                                        })\n\t                                    );\n\t                                promise.resolve = resolve;\n\t                                promise.reject = reject;\n\t                                return promise;\n\t                            };\n\n\t                            let done = false;\n\t                            let hasThrown = false;\n\t                            let returnCall;\n\t                            let nextAvailable = 0;\n\t                            const nextQueue = [];\n\n\t                            const handle = clock.setInterval(() => {\n\t                                if (nextQueue.length > 0) {\n\t                                    nextQueue.shift().resolve();\n\t                                } else {\n\t                                    nextAvailable++;\n\t                                }\n\t                            }, delay);\n\n\t                            const abort = () => {\n\t                                options.signal.removeEventListener(\n\t                                    \"abort\",\n\t                                    abort,\n\t                                );\n\t                                clock.abortListenerMap.delete(abort);\n\n\t                                clock.clearInterval(handle);\n\t                                done = true;\n\t                                for (const resolvable of nextQueue) {\n\t                                    resolvable.resolve();\n\t                                }\n\t                            };\n\n\t                            if (options.signal) {\n\t                                if (options.signal.aborted) {\n\t                                    done = true;\n\t                                } else {\n\t                                    options.signal.addEventListener(\n\t                                        \"abort\",\n\t                                        abort,\n\t                                    );\n\t                                    clock.abortListenerMap.set(\n\t                                        abort,\n\t                                        options.signal,\n\t                                    );\n\t                                }\n\t                            }\n\n\t                            return {\n\t                                next: async () => {\n\t                                    if (options.signal?.aborted && !hasThrown) {\n\t                                        hasThrown = true;\n\t                                        throw options.signal.reason;\n\t                                    }\n\n\t                                    if (done) {\n\t                                        return { done: true, value: undefined };\n\t                                    }\n\n\t                                    if (nextAvailable > 0) {\n\t                                        nextAvailable--;\n\t                                        return { done: false, value: value };\n\t                                    }\n\n\t                                    const resolvable = createResolvable();\n\t                                    nextQueue.push(resolvable);\n\n\t                                    await resolvable;\n\n\t                                    if (returnCall && nextQueue.length === 0) {\n\t                                        returnCall.resolve();\n\t                                    }\n\n\t                                    if (options.signal?.aborted && !hasThrown) {\n\t                                        hasThrown = true;\n\t                                        throw options.signal.reason;\n\t                                    }\n\n\t                                    if (done) {\n\t                                        return { done: true, value: undefined };\n\t                                    }\n\n\t                                    return { done: false, value: value };\n\t                                },\n\t                                return: async () => {\n\t                                    if (done) {\n\t                                        return { done: true, value: undefined };\n\t                                    }\n\n\t                                    if (nextQueue.length > 0) {\n\t                                        returnCall = createResolvable();\n\t                                        await returnCall;\n\t                                    }\n\n\t                                    clock.clearInterval(handle);\n\t                                    done = true;\n\n\t                                    if (options.signal) {\n\t                                        options.signal.removeEventListener(\n\t                                            \"abort\",\n\t                                            abort,\n\t                                        );\n\t                                        clock.abortListenerMap.delete(abort);\n\t                                    }\n\n\t                                    return { done: true, value: undefined };\n\t                                },\n\t                            };\n\t                        },\n\t                    });\n\t                }\n\t            }\n\t        }\n\n\t        return clock;\n\t    }\n\n\t    /* eslint-enable complexity */\n\n\t    return {\n\t        timers: timers,\n\t        createClock: createClock,\n\t        install: install,\n\t        withGlobal: withGlobal,\n\t    };\n\t}\n\n\t/** @type {FakeTimers} */\n\tconst defaultImplementation = withGlobal(globalObject);\n\n\tfakeTimersSrc.timers = defaultImplementation.timers;\n\tfakeTimersSrc.createClock = defaultImplementation.createClock;\n\tfakeTimersSrc.install = defaultImplementation.install;\n\t/** @type {WithGlobal} */\n\tfakeTimersSrc.withGlobal = withGlobal;\n\treturn fakeTimersSrc;\n}\n\nvar fakeTimersSrcExports = requireFakeTimersSrc();\n\nconst RealDate = globalThis.Date;\nclass FakeTimers {\n\t_global;\n\t_clock;\n\t// | _fakingTime | _fakingDate |\n\t// +-------------+-------------+\n\t// | false       | falsy       | initial\n\t// | false       | truthy      | vi.setSystemTime called first (for mocking only Date without fake timers)\n\t// | true        | falsy       | vi.useFakeTimers called first\n\t// | true        | truthy      | unreachable\n\t_fakingTime;\n\t_fakingDate;\n\t_fakeTimers;\n\t_userConfig;\n\t_now = RealDate.now;\n\tconstructor({ global, config }) {\n\t\tthis._userConfig = config;\n\t\tthis._fakingDate = null;\n\t\tthis._fakingTime = false;\n\t\tthis._fakeTimers = fakeTimersSrcExports.withGlobal(global);\n\t\tthis._global = global;\n\t}\n\tclearAllTimers() {\n\t\tif (this._fakingTime) this._clock.reset();\n\t}\n\tdispose() {\n\t\tthis.useRealTimers();\n\t}\n\trunAllTimers() {\n\t\tif (this._checkFakeTimers()) this._clock.runAll();\n\t}\n\tasync runAllTimersAsync() {\n\t\tif (this._checkFakeTimers()) await this._clock.runAllAsync();\n\t}\n\trunOnlyPendingTimers() {\n\t\tif (this._checkFakeTimers()) this._clock.runToLast();\n\t}\n\tasync runOnlyPendingTimersAsync() {\n\t\tif (this._checkFakeTimers()) await this._clock.runToLastAsync();\n\t}\n\tadvanceTimersToNextTimer(steps = 1) {\n\t\tif (this._checkFakeTimers()) for (let i = steps; i > 0; i--) {\n\t\t\tthis._clock.next();\n\t\t\t// Fire all timers at this point: https://github.com/sinonjs/fake-timers/issues/250\n\t\t\tthis._clock.tick(0);\n\t\t\tif (this._clock.countTimers() === 0) break;\n\t\t}\n\t}\n\tasync advanceTimersToNextTimerAsync(steps = 1) {\n\t\tif (this._checkFakeTimers()) for (let i = steps; i > 0; i--) {\n\t\t\tawait this._clock.nextAsync();\n\t\t\t// Fire all timers at this point: https://github.com/sinonjs/fake-timers/issues/250\n\t\t\tthis._clock.tick(0);\n\t\t\tif (this._clock.countTimers() === 0) break;\n\t\t}\n\t}\n\tadvanceTimersByTime(msToRun) {\n\t\tif (this._checkFakeTimers()) this._clock.tick(msToRun);\n\t}\n\tasync advanceTimersByTimeAsync(msToRun) {\n\t\tif (this._checkFakeTimers()) await this._clock.tickAsync(msToRun);\n\t}\n\tadvanceTimersToNextFrame() {\n\t\tif (this._checkFakeTimers()) this._clock.runToFrame();\n\t}\n\trunAllTicks() {\n\t\tif (this._checkFakeTimers()) this._clock.runMicrotasks();\n\t}\n\tuseRealTimers() {\n\t\tif (this._fakingDate) {\n\t\t\tthis._clock.uninstall();\n\t\t\tthis._fakingDate = null;\n\t\t}\n\t\tif (this._fakingTime) {\n\t\t\tthis._clock.uninstall();\n\t\t\tthis._fakingTime = false;\n\t\t}\n\t}\n\tuseFakeTimers() {\n\t\tconst fakeDate = this._fakingDate || Date.now();\n\t\tif (this._fakingDate) {\n\t\t\tthis._clock.uninstall();\n\t\t\tthis._fakingDate = null;\n\t\t}\n\t\tif (this._fakingTime) this._clock.uninstall();\n\t\tlet toFake = this._userConfig?.toFake;\n\t\tif (isChildProcess() && toFake?.includes(\"nextTick\")) throw new Error(\"process.nextTick cannot be mocked inside child_process\");\n\t\tlet toNotFake = this._userConfig?.toNotFake;\n\t\tif (toFake === void 0 && toNotFake === void 0)\n // Do not mock timers internally used by node by default. It can still be mocked through userConfig.\n\t\ttoFake = Object.keys(this._fakeTimers.timers).filter((timer) => timer !== \"nextTick\" && timer !== \"queueMicrotask\");\n\t\telse if (toFake === void 0 && toNotFake !== void 0) {\n\t\t\t// Do not mock timers internally used by node via `toNotFake`\n\t\t\tfor (const timer of [\"nextTick\", \"queueMicrotask\"]) if (!toNotFake.includes(timer)) toNotFake = [...toNotFake, timer];\n\t\t}\n\t\tif (isChildProcess() && toNotFake && !toNotFake.includes(\"nextTick\")) toNotFake = [...toNotFake, \"nextTick\"];\n\t\tthis._clock = this._fakeTimers.install({\n\t\t\tnow: fakeDate,\n\t\t\t...this._userConfig,\n\t\t\t...toFake && { toFake },\n\t\t\t...toNotFake && { toNotFake },\n\t\t\tignoreMissingTimers: true\n\t\t});\n\t\tthis._fakingTime = true;\n\t}\n\treset() {\n\t\tif (this._checkFakeTimers()) {\n\t\t\tconst { now } = this._clock;\n\t\t\tthis._clock.reset();\n\t\t\tthis._clock.setSystemTime(now);\n\t\t}\n\t}\n\tsetSystemTime(now) {\n\t\tconst date = typeof now === \"undefined\" || now instanceof Date ? now : new Date(now);\n\t\tif (this._fakingTime) this._clock.setSystemTime(date);\n\t\telse {\n\t\t\tconst newFakingDate = date ?? new Date(this.getRealSystemTime());\n\t\t\tif (this._fakingDate) {\n\t\t\t\tthis._fakingDate = newFakingDate;\n\t\t\t\tthis._clock.setSystemTime(newFakingDate);\n\t\t\t} else {\n\t\t\t\tthis._fakingDate = newFakingDate;\n\t\t\t\tthis._clock = this._fakeTimers.install({\n\t\t\t\t\tnow: newFakingDate,\n\t\t\t\t\ttoFake: [\"Date\", \"Temporal\"],\n\t\t\t\t\tignoreMissingTimers: true\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t}\n\tgetMockedSystemTime() {\n\t\treturn this._fakingTime ? new Date(this._clock.now) : this._fakingDate;\n\t}\n\tgetRealSystemTime() {\n\t\treturn this._now();\n\t}\n\tgetTimerCount() {\n\t\tif (this._checkFakeTimers()) return this._clock.countTimers();\n\t\treturn 0;\n\t}\n\tsetTimerTickMode(mode, interval) {\n\t\tif (this._checkFakeTimers()) if (mode === \"manual\") this._clock.setTickMode({ mode: \"manual\" });\n\t\telse if (mode === \"nextTimerAsync\") this._clock.setTickMode({ mode: \"nextAsync\" });\n\t\telse if (mode === \"interval\") this._clock.setTickMode({\n\t\t\tmode: \"interval\",\n\t\t\tdelta: interval\n\t\t});\n\t\telse throw new Error(`Invalid tick mode: ${mode}`);\n\t}\n\tconfigure(config) {\n\t\tthis._userConfig = config;\n\t}\n\tisFakeTimers() {\n\t\treturn this._fakingTime;\n\t}\n\t_checkFakeTimers() {\n\t\tif (!this._fakingTime) throw new Error(\"A function to advance timers was called but the timers APIs are not mocked. Call `vi.useFakeTimers()` in the test file first.\");\n\t\treturn this._fakingTime;\n\t}\n}\n\nconst whenSymbol = Symbol.for(\"$$vitest:when\");\n/**\n* Returns `true` if the given value is a {@linkcode When} chain created by {@linkcode when|vi.when}.\n*\n* @param input - The value to check.\n* @returns `true` if `input` is a {@linkcode When} instance, `false` otherwise.\n*\n* @example\n* const spy = vi.fn()\n* const w = vi.when(spy).calledWith(1).thenReturn(0)\n*\n* expect(isWhenChain(w)).toBe(true)\n* expect(isWhenChain(spy)).toBe(false)\n*/\nfunction isWhenChain(input) {\n\ttry {\n\t\treturn Reflect.has(input, whenSymbol);\n\t} catch {\n\t\treturn false;\n\t}\n}\n/**\n* Defines conditional behaviors on a Vitest spy based on the arguments it is called with.\n*\n* Behaviors are matched using deep equality, last-registered first within each argument set.\n*\n* It automatically restores the spy's original implementation when the enclosing block exits if used with the `using` keyword.\n*\n* @param spy - A Vitest mock function to attach behaviors to.\n* @param options - Optional configuration.\n* @returns A {@linkcode When} instance for registering behaviors.\n*\n* @throws {TypeError} If `spy` is not a Vitest mock function.\n* @throws {Error} If chaining a non-existent method after `calledWith`.\n* @throws {RangeError} If setting the `times` option on a `then*` method as a negative value or `0`.\n*\n* @since 5.0.0\n* @see {@link https://vitest.dev/api/vi#vi-when}\n* @see {@link https://vitest.dev/guide/recipes/conditional-mocking}\n*\n* @example\n* // Basic usage\n* const spy = vi.fn(() => Number.NEGATIVE_INFINITY)\n* vi.when(spy).calledWith(1).thenReturn(0)\n*\n* expect(spy(1)).toBe(0)\n* expect(spy(2)).toBe(Number.NEGATIVE_INFINITY) // falls through to original implementation\n*\n* @example\n* // Async\n* const spy = vi.fn()\n* vi.when(spy).calledWith('user').thenResolve({ id: 1 })\n*\n* await expect(spy('user')).resolves.toEqual({ id: 1 })\n*\n* @example\n* // Scoped with `using`\n* const spy = vi.fn()\n*\n* {\n*   using w = vi.when(spy)\n*     .calledWith('darkMode')\n*     .thenReturn(true)\n*\n*   expect(spy('darkMode')).toBe(true)\n* }\n*\n* // spy's original implementation is restored here\n* expect(spy('darkMode')).toBe(undefined)\n*\n* @example\n* // Throw on unmatched calls\n* vi.when(spy, { onUnmatched: 'throw' })\n*   .calledWith(1)\n*   .thenReturn({ id: 1, name: 'Alice' })\n*\n* expect(spy(1)).toEqual({ id: 1, name: 'Alice' })\n* expect(() => spy(2)).toThrow()\n*/\nfunction when(spy, options) {\n\tif (!isMockFunction(spy)) throw new TypeError(\"vi.when: the argument must be a mock function created with `vi.fn()` or `vi.spyOn()`\");\n\tconst behaviors = [];\n\tconst originalImplementation = spy.getMockImplementation();\n\tfunction findAction(args) {\n\t\tconst testers = [...getCustomEqualityTesters(), iterableEquality];\n\t\tfor (const behavior of behaviors) if (equals(args, behavior.arguments, testers)) return behavior.actions.findLast((action) => !(action.remaining === 0 && action.called)) ?? null;\n\t\treturn null;\n\t}\n\tspy.mockImplementation(\n\t\t// @ts-expect-error cannot resolve generic args\n\t\t(...args) => {\n\t\t\tconst action = findAction(args);\n\t\t\tif (action === null) return (typeof options?.onUnmatched === \"function\" ? options.onUnmatched : options?.onUnmatched === \"throw\" ? () => {\n\t\t\t\tthrow new Error(`vi.when: no behavior defined when called with [${args.map((arg) => stringify(arg)).join(\", \")}]`);\n\t\t\t} : originalImplementation)?.(...args);\n\t\t\taction.remaining -= 1;\n\t\t\taction.called = true;\n\t\t\tswitch (action.type) {\n\t\t\t\tcase \"return\": return action.value;\n\t\t\t\tcase \"throw\": throw action.value;\n\t\t\t\tcase \"resolve\": return Promise.resolve(action.value);\n\t\t\t\tcase \"reject\": return Promise.reject(action.value);\n\t\t\t}\n\t\t}\n\t);\n\tfunction getOrCreateBehavior(args) {\n\t\tconst testers = [...getCustomEqualityTesters(), iterableEquality];\n\t\tlet behavior = behaviors.find((behavior) => equals(args, behavior.arguments, testers));\n\t\tif (behavior === void 0) {\n\t\t\tbehavior = {\n\t\t\t\targuments: args,\n\t\t\t\tactions: []\n\t\t\t};\n\t\t\tbehaviors.push(behavior);\n\t\t}\n\t\treturn behavior;\n\t}\n\t// @ts-expect-error `Symbol.dispose` has to be assigned conditionally since it's only supported in Node >= 24\n\tconst output = markWhenChain({\n\t\tcalledWith: (...args) => {\n\t\t\tconst behavior = getOrCreateBehavior(args);\n\t\t\tfunction appendAction(behavior, type, value, times) {\n\t\t\t\tbehavior.actions.push({\n\t\t\t\t\ttype,\n\t\t\t\t\tvalue,\n\t\t\t\t\ttimes,\n\t\t\t\t\tremaining: times,\n\t\t\t\t\tcalled: false\n\t\t\t\t});\n\t\t\t}\n\t\t\tconst calledWithInstance = markWhenChain({\n\t\t\t\t...output,\n\t\t\t\tthenThrow: (value, options) => {\n\t\t\t\t\tvalidateOptions(options);\n\t\t\t\t\tappendAction(behavior, \"throw\", value, options?.times ?? Number.POSITIVE_INFINITY);\n\t\t\t\t\treturn calledWithInstance;\n\t\t\t\t},\n\t\t\t\tthenThrowOnce: (value) => {\n\t\t\t\t\tappendAction(behavior, \"throw\", value, 1);\n\t\t\t\t\treturn calledWithInstance;\n\t\t\t\t},\n\t\t\t\tthenReturn: (value, options) => {\n\t\t\t\t\tvalidateOptions(options);\n\t\t\t\t\tappendAction(behavior, \"return\", value, options?.times ?? Number.POSITIVE_INFINITY);\n\t\t\t\t\treturn calledWithInstance;\n\t\t\t\t},\n\t\t\t\tthenReturnOnce: (value) => {\n\t\t\t\t\tappendAction(behavior, \"return\", value, 1);\n\t\t\t\t\treturn calledWithInstance;\n\t\t\t\t},\n\t\t\t\tthenResolve: (value, options) => {\n\t\t\t\t\tvalidateOptions(options);\n\t\t\t\t\tappendAction(behavior, \"resolve\", value, options?.times ?? Number.POSITIVE_INFINITY);\n\t\t\t\t\treturn calledWithInstance;\n\t\t\t\t},\n\t\t\t\tthenResolveOnce: (value) => {\n\t\t\t\t\tappendAction(behavior, \"resolve\", value, 1);\n\t\t\t\t\treturn calledWithInstance;\n\t\t\t\t},\n\t\t\t\tthenReject: (value, options) => {\n\t\t\t\t\tvalidateOptions(options);\n\t\t\t\t\tappendAction(behavior, \"reject\", value, options?.times ?? Number.POSITIVE_INFINITY);\n\t\t\t\t\treturn calledWithInstance;\n\t\t\t\t},\n\t\t\t\tthenRejectOnce: (value) => {\n\t\t\t\t\tappendAction(behavior, \"reject\", value, 1);\n\t\t\t\t\treturn calledWithInstance;\n\t\t\t\t}\n\t\t\t});\n\t\t\treturn calledWithInstance;\n\t\t},\n\t\t_getDiagnostics: () => {\n\t\t\tconst pendingBehaviors = behaviors.filter((behavior) => behavior.actions.length === 0 || behavior.actions.some((action) => !hasBeenConsumed(action)));\n\t\t\treturn {\n\t\t\t\tisExhausted: behaviors.length !== 0 && pendingBehaviors.length === 0,\n\t\t\t\tpendingBehaviors: pendingBehaviors.map((behavior) => `calledWith(${behavior.arguments.map((argument) => stringify(argument)).join(\", \")})${behavior.actions.length === 0 ? \"  → no actions\" : `\\n${formatActions(behavior.actions)}`}`).join(\"\\n\\n\")\n\t\t\t};\n\t\t}\n\t});\n\tif (Symbol.dispose) output[Symbol.dispose] = () => {\n\t\tspy.mockImplementation(\n\t\t\t// @ts-expect-error without an original implementation we should fall back to an undefined-returning function as that's what the mocking functions do\n\t\t\toriginalImplementation ?? noop\n\t\t);\n\t};\n\treturn output;\n}\nconst whenChainMarkerOptions = {};\nfunction markWhenChain(input) {\n\tReflect.defineProperty(input, whenSymbol, whenChainMarkerOptions);\n\treturn input;\n}\nfunction formatActions(actions) {\n\tconst lines = actions.map((action, index) => {\n\t\tconst method = getMethodName(action.type);\n\t\tconst left = `  ${getSymbol(action)} ${method}(${stringify(action.value)}${action.times === Number.POSITIVE_INFINITY ? \"\" : `, { times: ${action.times} }`})`;\n\t\tconst unreachable = !hasBeenConsumed(action) && actions.slice(index + 1).some((later) => later.times === Number.POSITIVE_INFINITY);\n\t\treturn {\n\t\t\tleft,\n\t\t\tremaining: getRemainingLabel(action) + (unreachable ? \"  → unreachable action\" : \"\")\n\t\t};\n\t});\n\tconst maxLeft = Math.max(...lines.map((line) => line.left.length));\n\treturn lines.map(({ left, remaining }) => `${left.padEnd(maxLeft + 2)}${remaining}`).join(\"\\n\");\n}\nfunction getMethodName(type) {\n\tswitch (type) {\n\t\tcase \"return\": return \"thenReturn\";\n\t\tcase \"resolve\": return \"thenResolve\";\n\t\tcase \"throw\": return \"thenThrow\";\n\t\tcase \"reject\": return \"thenReject\";\n\t\tdefault: throw new Error(`vi.when: \"${type}\" is not a known method`);\n\t}\n}\nfunction hasBeenConsumed(action) {\n\treturn action.remaining === 0 || action.remaining === Number.POSITIVE_INFINITY && action.called;\n}\nfunction getRemainingLabel(action) {\n\tif (hasBeenConsumed(action)) return action.remaining === Number.POSITIVE_INFINITY ? \"exhausted\" : `exhausted (${action.times} of ${action.times})`;\n\treturn action.remaining === Number.POSITIVE_INFINITY ? \"never called\" : `${action.remaining} remaining (out of ${action.times})`;\n}\nfunction getSymbol(action) {\n\tif (hasBeenConsumed(action)) return \"✓\";\n\treturn \"✗\";\n}\nfunction validateOptions(options) {\n\tif (typeof options?.times === \"number\" && options.times <= 0) throw new RangeError(\"vi.when: `times` option must be greater than 0\");\n}\n\nfunction copyStackTrace$2(target, source) {\n\tif (source.stack !== void 0) target.stack = source.stack.replace(source.message, target.message);\n\treturn target;\n}\nfunction waitFor(callback, options = {}) {\n\tconst { setTimeout, setInterval, clearTimeout, clearInterval } = getSafeTimers();\n\tconst { interval = 50, timeout = 1e3 } = typeof options === \"number\" ? { timeout: options } : options;\n\tconst STACK_TRACE_ERROR = /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\");\n\treturn new Promise((resolve, reject) => {\n\t\tlet lastError;\n\t\tlet promiseStatus = \"idle\";\n\t\tlet timeoutId;\n\t\tlet intervalId;\n\t\tconst onResolve = (result) => {\n\t\t\tif (timeoutId) clearTimeout(timeoutId);\n\t\t\tif (intervalId) clearInterval(intervalId);\n\t\t\tresolve(result);\n\t\t};\n\t\tconst handleTimeout = () => {\n\t\t\tif (intervalId) clearInterval(intervalId);\n\t\t\tlet error = lastError;\n\t\t\tif (!error) error = copyStackTrace$2(/* @__PURE__ */ new Error(\"Timed out in waitFor!\"), STACK_TRACE_ERROR);\n\t\t\treject(error);\n\t\t};\n\t\tconst checkCallback = () => {\n\t\t\tif (vi.isFakeTimers()) vi.advanceTimersByTime(interval);\n\t\t\tif (promiseStatus === \"pending\") return;\n\t\t\ttry {\n\t\t\t\tconst result = callback();\n\t\t\t\tif (result !== null && typeof result === \"object\" && typeof result.then === \"function\") {\n\t\t\t\t\tconst thenable = result;\n\t\t\t\t\tpromiseStatus = \"pending\";\n\t\t\t\t\tthenable.then((resolvedValue) => {\n\t\t\t\t\t\tpromiseStatus = \"resolved\";\n\t\t\t\t\t\tonResolve(resolvedValue);\n\t\t\t\t\t}, (rejectedValue) => {\n\t\t\t\t\t\tpromiseStatus = \"rejected\";\n\t\t\t\t\t\tlastError = rejectedValue;\n\t\t\t\t\t});\n\t\t\t\t} else {\n\t\t\t\t\tonResolve(result);\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t} catch (error) {\n\t\t\t\tlastError = error;\n\t\t\t}\n\t\t};\n\t\tif (checkCallback() === true) return;\n\t\ttimeoutId = setTimeout(handleTimeout, timeout);\n\t\tintervalId = setInterval(checkCallback, interval);\n\t});\n}\nfunction waitUntil(callback, options = {}) {\n\tconst { setTimeout, setInterval, clearTimeout, clearInterval } = getSafeTimers();\n\tconst { interval = 50, timeout = 1e3 } = typeof options === \"number\" ? { timeout: options } : options;\n\tconst STACK_TRACE_ERROR = /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\");\n\treturn new Promise((resolve, reject) => {\n\t\tlet promiseStatus = \"idle\";\n\t\tlet timeoutId;\n\t\tlet intervalId;\n\t\tconst onReject = (error) => {\n\t\t\tif (intervalId) clearInterval(intervalId);\n\t\t\tif (!error) error = copyStackTrace$2(/* @__PURE__ */ new Error(\"Timed out in waitUntil!\"), STACK_TRACE_ERROR);\n\t\t\treject(error);\n\t\t};\n\t\tconst onResolve = (result) => {\n\t\t\tif (!result) return;\n\t\t\tif (timeoutId) clearTimeout(timeoutId);\n\t\t\tif (intervalId) clearInterval(intervalId);\n\t\t\tresolve(result);\n\t\t\treturn true;\n\t\t};\n\t\tconst checkCallback = () => {\n\t\t\tif (vi.isFakeTimers()) vi.advanceTimersByTime(interval);\n\t\t\tif (promiseStatus === \"pending\") return;\n\t\t\ttry {\n\t\t\t\tconst result = callback();\n\t\t\t\tif (result !== null && typeof result === \"object\" && typeof result.then === \"function\") {\n\t\t\t\t\tconst thenable = result;\n\t\t\t\t\tpromiseStatus = \"pending\";\n\t\t\t\t\tthenable.then((resolvedValue) => {\n\t\t\t\t\t\tpromiseStatus = \"resolved\";\n\t\t\t\t\t\tonResolve(resolvedValue);\n\t\t\t\t\t}, (rejectedValue) => {\n\t\t\t\t\t\tpromiseStatus = \"rejected\";\n\t\t\t\t\t\tonReject(rejectedValue);\n\t\t\t\t\t});\n\t\t\t\t} else return onResolve(result);\n\t\t\t} catch (error) {\n\t\t\t\tonReject(error);\n\t\t\t}\n\t\t};\n\t\tif (checkCallback() === true) return;\n\t\ttimeoutId = setTimeout(onReject, timeout);\n\t\tintervalId = setInterval(checkCallback, interval);\n\t});\n}\n\nfunction createVitest() {\n\tlet _config = null;\n\tconst state = () => getWorkerState();\n\tlet _timers;\n\tconst timers = () => _timers ||= new FakeTimers({\n\t\tglobal: globalThis,\n\t\tconfig: state().config.fakeTimers\n\t});\n\tconst _stubsGlobal = /* @__PURE__ */ new Map();\n\tconst _stubsEnv = /* @__PURE__ */ new Map();\n\tconst _envBooleans = [\n\t\t\"PROD\",\n\t\t\"DEV\",\n\t\t\"SSR\"\n\t];\n\tconst utils = {\n\t\tuseFakeTimers(config) {\n\t\t\tif (isChildProcess()) {\n\t\t\t\tif (config?.toFake?.includes(\"nextTick\") || state().config?.fakeTimers?.toFake?.includes(\"nextTick\")) throw new Error(\"vi.useFakeTimers({ toFake: [\\\"nextTick\\\"] }) is not supported in node:child_process. Use --pool=threads if mocking nextTick is required.\");\n\t\t\t}\n\t\t\tif (config) timers().configure({\n\t\t\t\t...state().config.fakeTimers,\n\t\t\t\t...config\n\t\t\t});\n\t\t\telse timers().configure(state().config.fakeTimers);\n\t\t\ttimers().useFakeTimers();\n\t\t\treturn utils;\n\t\t},\n\t\tisFakeTimers() {\n\t\t\treturn timers().isFakeTimers();\n\t\t},\n\t\tuseRealTimers() {\n\t\t\ttimers().useRealTimers();\n\t\t\treturn utils;\n\t\t},\n\t\trunOnlyPendingTimers() {\n\t\t\ttimers().runOnlyPendingTimers();\n\t\t\treturn utils;\n\t\t},\n\t\tasync runOnlyPendingTimersAsync() {\n\t\t\tawait timers().runOnlyPendingTimersAsync();\n\t\t\treturn utils;\n\t\t},\n\t\trunAllTimers() {\n\t\t\ttimers().runAllTimers();\n\t\t\treturn utils;\n\t\t},\n\t\tasync runAllTimersAsync() {\n\t\t\tawait timers().runAllTimersAsync();\n\t\t\treturn utils;\n\t\t},\n\t\trunAllTicks() {\n\t\t\ttimers().runAllTicks();\n\t\t\treturn utils;\n\t\t},\n\t\tadvanceTimersByTime(ms) {\n\t\t\ttimers().advanceTimersByTime(ms);\n\t\t\treturn utils;\n\t\t},\n\t\tasync advanceTimersByTimeAsync(ms) {\n\t\t\tawait timers().advanceTimersByTimeAsync(ms);\n\t\t\treturn utils;\n\t\t},\n\t\tadvanceTimersToNextTimer() {\n\t\t\ttimers().advanceTimersToNextTimer();\n\t\t\treturn utils;\n\t\t},\n\t\tasync advanceTimersToNextTimerAsync() {\n\t\t\tawait timers().advanceTimersToNextTimerAsync();\n\t\t\treturn utils;\n\t\t},\n\t\tadvanceTimersToNextFrame() {\n\t\t\ttimers().advanceTimersToNextFrame();\n\t\t\treturn utils;\n\t\t},\n\t\tgetTimerCount() {\n\t\t\treturn timers().getTimerCount();\n\t\t},\n\t\tsetSystemTime(time) {\n\t\t\ttimers().setSystemTime(time);\n\t\t\treturn utils;\n\t\t},\n\t\tgetMockedSystemTime() {\n\t\t\treturn timers().getMockedSystemTime();\n\t\t},\n\t\tgetRealSystemTime() {\n\t\t\treturn timers().getRealSystemTime();\n\t\t},\n\t\tclearAllTimers() {\n\t\t\ttimers().clearAllTimers();\n\t\t\treturn utils;\n\t\t},\n\t\tsetTimerTickMode(mode, interval) {\n\t\t\ttimers().setTimerTickMode(mode, interval);\n\t\t\treturn utils;\n\t\t},\n\t\t// mocks\n\t\tspyOn,\n\t\tfn,\n\t\twhen,\n\t\tisWhenChain,\n\t\twaitFor,\n\t\twaitUntil,\n\t\tdefineHelper: (fn) => {\n\t\t\treturn function __VITEST_HELPER__(...args) {\n\t\t\t\tconst result = fn.apply(this, args);\n\t\t\t\tif (result && typeof result === \"object\" && typeof result.then === \"function\") {\n\t\t\t\t\tconst stackTraceError = /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\");\n\t\t\t\t\treturn (async function __VITEST_HELPER__() {\n\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\treturn await result;\n\t\t\t\t\t\t} catch (error) {\n\t\t\t\t\t\t\tif (error instanceof Error && !error.stack?.includes(\"__VITEST_HELPER__\")) copyStackTrace$1(error, stackTraceError);\n\t\t\t\t\t\t\tthrow error;\n\t\t\t\t\t\t}\n\t\t\t\t\t})();\n\t\t\t\t}\n\t\t\t\treturn result;\n\t\t\t};\n\t\t},\n\t\thoisted(factory) {\n\t\t\tassertTypes(factory, \"\\\"vi.hoisted\\\" factory\", [\"function\"]);\n\t\t\treturn factory();\n\t\t},\n\t\tmock(path, factory) {\n\t\t\tif (typeof path !== \"string\") throw new TypeError(`vi.mock() expects a string path, but received a ${typeof path}`);\n\t\t\tconst importer = getImporter(\"mock\");\n\t\t\t_mocker().queueMock(path, importer, typeof factory === \"function\" ? () => factory(() => _mocker().importActual(path, importer, _mocker().getMockContext().callstack)) : factory);\n\t\t},\n\t\tunmock(path) {\n\t\t\tif (typeof path !== \"string\") throw new TypeError(`vi.unmock() expects a string path, but received a ${typeof path}`);\n\t\t\t_mocker().queueUnmock(path, getImporter(\"unmock\"));\n\t\t},\n\t\tdoMock(path, factory) {\n\t\t\tif (typeof path !== \"string\") throw new TypeError(`vi.doMock() expects a string path, but received a ${typeof path}`);\n\t\t\tconst importer = getImporter(\"doMock\");\n\t\t\t_mocker().queueMock(path, importer, typeof factory === \"function\" ? () => factory(() => _mocker().importActual(path, importer, _mocker().getMockContext().callstack)) : factory);\n\t\t\tconst rv = {};\n\t\t\tif (Symbol.dispose) rv[Symbol.dispose] = () => {\n\t\t\t\t_mocker().queueUnmock(path, importer);\n\t\t\t};\n\t\t\treturn rv;\n\t\t},\n\t\tdoUnmock(path) {\n\t\t\tif (typeof path !== \"string\") throw new TypeError(`vi.doUnmock() expects a string path, but received a ${typeof path}`);\n\t\t\tconst importer = getImporter(\"doUnmock\");\n\t\t\t_mocker().queueUnmock(path, importer);\n\t\t},\n\t\tasync importActual(path) {\n\t\t\tconst importer = getImporter(\"importActual\");\n\t\t\treturn _mocker().importActual(path, importer, _mocker().getMockContext().callstack);\n\t\t},\n\t\tasync importMock(path) {\n\t\t\tconst importer = getImporter(\"importMock\");\n\t\t\treturn _mocker().importMock(path, importer);\n\t\t},\n\t\tmockObject(value, options) {\n\t\t\treturn _mocker().mockObject({ value }, void 0, options?.spy ? \"autospy\" : \"automock\").value;\n\t\t},\n\t\t// this is typed in the interface so it's not necessary to type it here\n\t\tmocked(item, _options = {}) {\n\t\t\treturn item;\n\t\t},\n\t\tisMockFunction(fn) {\n\t\t\treturn isMockFunction(fn);\n\t\t},\n\t\tclearAllMocks() {\n\t\t\tclearAllMocks();\n\t\t\treturn utils;\n\t\t},\n\t\tresetAllMocks() {\n\t\t\tresetAllMocks();\n\t\t\treturn utils;\n\t\t},\n\t\trestoreAllMocks() {\n\t\t\trestoreAllMocks();\n\t\t\treturn utils;\n\t\t},\n\t\tstubGlobal(name, value) {\n\t\t\tif (!_stubsGlobal.has(name)) _stubsGlobal.set(name, Object.getOwnPropertyDescriptor(globalThis, name));\n\t\t\tObject.defineProperty(globalThis, name, {\n\t\t\t\tvalue,\n\t\t\t\twritable: true,\n\t\t\t\tconfigurable: true,\n\t\t\t\tenumerable: true\n\t\t\t});\n\t\t\treturn utils;\n\t\t},\n\t\tstubEnv(name, value) {\n\t\t\tconst env = state().metaEnv;\n\t\t\tif (!_stubsEnv.has(name)) _stubsEnv.set(name, env[name]);\n\t\t\tif (value === void 0) delete env[name];\n\t\t\telse if (_envBooleans.includes(name)) env[name] = value ? \"1\" : \"\";\n\t\t\telse env[name] = String(value);\n\t\t\treturn utils;\n\t\t},\n\t\tunstubAllGlobals() {\n\t\t\t_stubsGlobal.forEach((original, name) => {\n\t\t\t\tif (!original) Reflect.deleteProperty(globalThis, name);\n\t\t\t\telse Object.defineProperty(globalThis, name, original);\n\t\t\t});\n\t\t\t_stubsGlobal.clear();\n\t\t\treturn utils;\n\t\t},\n\t\tunstubAllEnvs() {\n\t\t\tconst env = state().metaEnv;\n\t\t\t_stubsEnv.forEach((original, name) => {\n\t\t\t\tif (original === void 0) delete env[name];\n\t\t\t\telse env[name] = original;\n\t\t\t});\n\t\t\t_stubsEnv.clear();\n\t\t\treturn utils;\n\t\t},\n\t\tresetModules() {\n\t\t\tresetModules(state().evaluatedModules);\n\t\t\treturn utils;\n\t\t},\n\t\tasync dynamicImportSettled() {\n\t\t\treturn waitForImportsToResolve();\n\t\t},\n\t\tsetConfig(config) {\n\t\t\tif (!_config) _config = { ...state().config };\n\t\t\tObject.assign(state().config, config);\n\t\t},\n\t\tresetConfig() {\n\t\t\tif (_config) Object.assign(state().config, _config);\n\t\t}\n\t};\n\treturn utils;\n}\nconst vitest = createVitest();\nconst vi = vitest;\nfunction _mocker() {\n\t// @ts-expect-error injected by vite-nide\n\treturn typeof __vitest_mocker__ !== \"undefined\" ? __vitest_mocker__ : new Proxy({}, { get(_, name) {\n\t\tthrow new Error(`Vitest mocker was not initialized in this environment. vi.${String(name)}() is forbidden.`);\n\t} });\n}\nfunction getImporter(name) {\n\tconst stackArray = createSimpleStackTrace({ stackTraceLimit: 5 }).split(\"\\n\");\n\t// if there is no message in a stack trace, use the item - 1\n\tconst importerStackIndex = stackArray.findLastIndex((stack) => {\n\t\treturn stack.includes(` at Object.${name}`) || stack.includes(`${name}@`) || stack.includes(` at ${name} (`);\n\t});\n\treturn parseSingleStack(stackArray[importerStackIndex + 1])?.file || \"\";\n}\nfunction copyStackTrace$1(target, source) {\n\tif (source.stack !== void 0) target.stack = source.stack.replace(source.message, target.message);\n\treturn target;\n}\nfunction waitNextTick() {\n\tconst { setTimeout } = getSafeTimers();\n\treturn new Promise((resolve) => setTimeout(resolve, 0));\n}\nasync function waitForImportsToResolve() {\n\tawait waitNextTick();\n\tconst state = getWorkerState();\n\tconst promises = [];\n\tconst resolvingCount = state.resolvingModules.size;\n\tfor (const [_, mod] of state.evaluatedModules.idToModuleMap) if (mod.promise && !mod.evaluated) promises.push(mod.promise);\n\tif (!promises.length && !resolvingCount) return;\n\tawait Promise.allSettled(promises);\n\tawait waitForImportsToResolve();\n}\n\n// these matchers are not supported because they don't make sense with poll\nconst unsupported = [\n\t\"matchSnapshot\",\n\t\"toMatchSnapshot\",\n\t\"toMatchInlineSnapshot\",\n\t\"toThrowErrorMatchingSnapshot\",\n\t\"toThrowErrorMatchingInlineSnapshot\",\n\t\"throws\",\n\t\"Throw\",\n\t\"throw\",\n\t\"toThrow\",\n\t\"toThrowError\"\n];\n/**\n* Attaches a `cause` property to the error if missing, copies the stack trace from the source, and throws.\n*\n* @param error - The error to throw\n* @param source - Error to copy the stack trace from\n*\n* @throws Always throws the provided error with an amended stack trace\n*/\nfunction throwWithCause(error, source) {\n\terror.cause ??= /* @__PURE__ */ new Error(\"Matcher did not succeed in time.\");\n\tthrow copyStackTrace(error, source);\n}\nfunction createExpectPoll(expect) {\n\treturn function poll(fn, options = {}) {\n\t\tconst defaults = getWorkerState().config.expect?.poll ?? {};\n\t\tconst { interval = defaults.interval ?? 50, timeout = defaults.timeout ?? 1e3, message } = options;\n\t\t// @ts-expect-error private poll access\n\t\tconst assertion = expect(null, message).withContext({ poll: true });\n\t\tfn = fn.bind(assertion);\n\t\t// injected so that domain snapshot can take over poll implementation.\n\t\tchai.util.flag(assertion, \"_poll.fn\", fn);\n\t\tchai.util.flag(assertion, \"_poll.timeout\", timeout);\n\t\tchai.util.flag(assertion, \"_poll.interval\", interval);\n\t\tconst test = chai.util.flag(assertion, \"vitest-test\");\n\t\tif (!test) throw new Error(\"expect.poll() must be called inside a test\");\n\t\tconst proxy = new Proxy(assertion, { get(target, key, receiver) {\n\t\t\tconst assertionFunction = Reflect.get(target, key, receiver);\n\t\t\tif (typeof assertionFunction !== \"function\") return assertionFunction instanceof chai.Assertion ? proxy : assertionFunction;\n\t\t\tif (key === \"assert\") return assertionFunction;\n\t\t\tif (typeof key === \"string\" && unsupported.includes(key)) throw new SyntaxError(`expect.poll() is not supported in combination with .${key}(). Use vi.waitFor() if your assertion condition is unstable.`);\n\t\t\t// Core poll stack-trace trick:\n\t\t\t//   1. capture STACK_TRACE_ERROR here before entering the async poll loop\n\t\t\t//   2. when the matcher eventually fails, rethrow via throwWithCause()\n\t\t\t//      so the final error keeps this earlier stack\n\t\t\t//\n\t\t\t// For example, when user writes:\n\t\t\t//    await expect.poll(...).toBeSomething()\n\t\t\t// STACK_TRACE_ERROR.stack would look like\n\t\t\t//   at ...(more internal stacks)...\n\t\t\t//   at __VITEST_POLL_CHAIN__ .../packages/vitest/dist/...\n\t\t\t//   at .../my-file.test.ts:12:3   (this points to `toBeSomething()` callsite in user test file)\n\t\t\t// Vitest later filters out internal stacks from `vitest/dist`, so the reported errors correctly\n\t\t\t// points to the user callsite for poll assertion errors.\n\t\t\t//\n\t\t\t// Inline snapshots piggyback on the same idea. We pass\n\t\t\t// STACK_TRACE_ERROR through `chai.util.flag(assertion, 'error', ...)`.\n\t\t\t// Inline snapshot assertion access the same error stack for\n\t\t\t// extracting inline snapshot location to validate and update new snapshots.\n\t\t\treturn function __VITEST_POLL_CHAIN__(...args) {\n\t\t\t\tconst STACK_TRACE_ERROR = /* @__PURE__ */ new Error(\"STACK_TRACE_ERROR\");\n\t\t\t\tconst promise = async () => {\n\t\t\t\t\tchai.util.flag(assertion, \"_name\", key);\n\t\t\t\t\tchai.util.flag(assertion, \"error\", STACK_TRACE_ERROR);\n\t\t\t\t\tconst onStart = chai.util.flag(assertion, \"_poll.onStart\");\n\t\t\t\t\tconst onSettled = chai.util.flag(assertion, \"_poll.onSettled\");\n\t\t\t\t\tawait onStart?.({ assertion });\n\t\t\t\t\tif (Object.getOwnPropertyDescriptor(assertionFunction, \"__vitest_poll_takeover__\")?.value) try {\n\t\t\t\t\t\tconst output = await assertionFunction.call(assertion, ...args);\n\t\t\t\t\t\tawait onSettled?.({\n\t\t\t\t\t\t\tassertion,\n\t\t\t\t\t\t\tstatus: \"pass\"\n\t\t\t\t\t\t});\n\t\t\t\t\t\treturn output;\n\t\t\t\t\t} catch (err) {\n\t\t\t\t\t\tawait onSettled?.({\n\t\t\t\t\t\t\tassertion,\n\t\t\t\t\t\t\tstatus: \"fail\"\n\t\t\t\t\t\t});\n\t\t\t\t\t\tthrowWithCause(err, STACK_TRACE_ERROR);\n\t\t\t\t\t}\n\t\t\t\t\tconst { setTimeout, clearTimeout } = getSafeTimers();\n\t\t\t\t\tlet timerId;\n\t\t\t\t\tconst timeoutController = new AbortController();\n\t\t\t\t\tconst timeoutPromise = new Promise((resolve) => {\n\t\t\t\t\t\ttimerId = setTimeout(() => {\n\t\t\t\t\t\t\ttimeoutController.abort();\n\t\t\t\t\t\t\tresolve();\n\t\t\t\t\t\t}, timeout);\n\t\t\t\t\t});\n\t\t\t\t\tlet lastError;\n\t\t\t\t\ttry {\n\t\t\t\t\t\twhile (true) try {\n\t\t\t\t\t\t\tconst fnResult = await raceWith(Promise.resolve().then(() => fn({ signal: timeoutController.signal })), timeoutPromise);\n\t\t\t\t\t\t\tif (!fnResult.ok) {\n\t\t\t\t\t\t\t\tlastError ??= /* @__PURE__ */ new Error(`expect.poll() function didn't resolve in time.`);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tconst obj = fnResult.value;\n\t\t\t\t\t\t\tchai.util.flag(assertion, \"object\", obj);\n\t\t\t\t\t\t\tconst assertionResult = await raceWith(Promise.resolve().then(() => assertionFunction.apply(assertion, args)), timeoutPromise);\n\t\t\t\t\t\t\tif (!assertionResult.ok) {\n\t\t\t\t\t\t\t\tlastError ??= /* @__PURE__ */ new Error(`expect.poll() assertion didn't resolve in time.`);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tconst output = assertionResult.value;\n\t\t\t\t\t\t\tawait onSettled?.({\n\t\t\t\t\t\t\t\tassertion,\n\t\t\t\t\t\t\t\tstatus: \"pass\"\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\treturn output;\n\t\t\t\t\t\t} catch (err) {\n\t\t\t\t\t\t\tlastError = err;\n\t\t\t\t\t\t\t// no retry for toMatchScreenshot since\n\t\t\t\t\t\t\t// it owns retry/stability after the first element resolution\n\t\t\t\t\t\t\tif (key === \"toMatchScreenshot\") break;\n\t\t\t\t\t\t\tif (!(await raceWith(delay(interval, setTimeout), timeoutPromise)).ok) break;\n\t\t\t\t\t\t\tif (vi.isFakeTimers()) vi.advanceTimersByTime(interval);\n\t\t\t\t\t\t}\n\t\t\t\t\t} finally {\n\t\t\t\t\t\tclearTimeout(timerId);\n\t\t\t\t\t}\n\t\t\t\t\tif (lastError) {\n\t\t\t\t\t\tawait onSettled?.({\n\t\t\t\t\t\t\tassertion,\n\t\t\t\t\t\t\tstatus: \"fail\"\n\t\t\t\t\t\t});\n\t\t\t\t\t\tthrowWithCause(lastError, STACK_TRACE_ERROR);\n\t\t\t\t\t}\n\t\t\t\t};\n\t\t\t\tlet awaited = false;\n\t\t\t\ttest.onFinished ??= [];\n\t\t\t\ttest.onFinished.push(() => {\n\t\t\t\t\tif (!awaited) {\n\t\t\t\t\t\tconst negated = chai.util.flag(assertion, \"negate\") ? \"not.\" : \"\";\n\t\t\t\t\t\tconst assertionString = `expect.${chai.util.flag(assertion, \"_poll.element\") ? \"element(locator)\" : \"poll(assertion)\"}.${negated}${String(key)}()`;\n\t\t\t\t\t\tthrow copyStackTrace(/* @__PURE__ */ new Error(`${assertionString} was not awaited. This assertion is asynchronous and must be awaited; otherwise, it is not executed to avoid unhandled rejections:\\n\\nawait ${assertionString}\\n`), STACK_TRACE_ERROR);\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t\tlet resultPromise;\n\t\t\t\t// lets `expect.element` register the poll with the task deadline\n\t\t\t\tconst wrap = chai.util.flag(assertion, \"_poll.wrap\");\n\t\t\t\tconst start = () => resultPromise ||= wrap ? wrap(promise(), STACK_TRACE_ERROR) : promise();\n\t\t\t\t// only .then is enough to check awaited, but we type this as `Promise<void>` in global types\n\t\t\t\t// so let's follow it\n\t\t\t\treturn {\n\t\t\t\t\tthen(onFulfilled, onRejected) {\n\t\t\t\t\t\tawaited = true;\n\t\t\t\t\t\treturn start().then(onFulfilled, onRejected);\n\t\t\t\t\t},\n\t\t\t\t\tcatch(onRejected) {\n\t\t\t\t\t\tawaited = true;\n\t\t\t\t\t\treturn start().catch(onRejected);\n\t\t\t\t\t},\n\t\t\t\t\tfinally(onFinally) {\n\t\t\t\t\t\tawaited = true;\n\t\t\t\t\t\treturn start().finally(onFinally);\n\t\t\t\t\t},\n\t\t\t\t\t[Symbol.toStringTag]: \"Promise\"\n\t\t\t\t};\n\t\t\t};\n\t\t} });\n\t\treturn proxy;\n\t};\n}\nfunction copyStackTrace(target, source) {\n\tif (source.stack !== void 0) target.stack = source.stack.replace(source.message, target.message);\n\treturn target;\n}\nfunction raceWith(promise, other) {\n\tconst left = promise.then((value) => ({\n\t\tok: true,\n\t\tvalue\n\t}));\n\tif (!other) return left;\n\treturn Promise.race([left, other.then((value) => ({\n\t\tok: false,\n\t\tvalue\n\t}))]);\n}\n\nconst MockPlugin = (chai, utils) => {\n\tutils.addMethod(chai.Assertion.prototype, \"toHaveBeenExhausted\", wrapAssertion(utils, \"toHaveBeenExhausted\", function() {\n\t\tconst chain = utils.flag(this, \"object\");\n\t\tif (!isWhenChain(chain)) throw new TypeError(`${utils.inspect(chain)} is not a \\`vi.when\\` instance`);\n\t\tconst diagnostics = chain._getDiagnostics();\n\t\tthis.assert(diagnostics.isExhausted, `expected all behaviors to have been exhausted, but some remain:\\n\\n  ${diagnostics.pendingBehaviors.replaceAll(/\\n(?!\\n)/g, \"\\n  \")}`, \"expected at least one behavior to remain un-exhausted, but all were\");\n\t}));\n};\n\nlet _client;\nfunction getSnapshotClient() {\n\tif (!_client) _client = new SnapshotClient({ isEqual: (received, expected) => {\n\t\treturn equals(received, expected, [iterableEquality, subsetEquality]);\n\t} });\n\treturn _client;\n}\nfunction getError(expected, promise) {\n\tif (typeof expected !== \"function\") {\n\t\tif (!promise) throw new Error(`expected must be a function, received ${typeof expected}`);\n\t\t// when \"promised\", it receives thrown error\n\t\treturn expected;\n\t}\n\ttry {\n\t\texpected();\n\t} catch (e) {\n\t\treturn e;\n\t}\n\tthrow new Error(\"snapshot function didn't throw\");\n}\nfunction getTestNames(test) {\n\treturn {\n\t\tfilepath: test.file.filepath,\n\t\tname: getNames(test).slice(1).join(\" > \"),\n\t\ttestId: test.id\n\t};\n}\nfunction getAssertionName(assertion) {\n\tconst name = chai.util.flag(assertion, \"_name\");\n\tif (!name) throw new Error(\"Assertion name is not set. This is a bug in Vitest. Please, open a new issue with reproduction.\");\n\treturn name;\n}\nfunction getTest(obj) {\n\tconst test = chai.util.flag(obj, \"vitest-test\");\n\tif (!test) throw new Error(`'${getAssertionName(obj)}' cannot be used without test context`);\n\tif (test.fails) throw new TestSyntaxError(`'${getAssertionName(obj)}' cannot be used with 'test.fails'`);\n\treturn test;\n}\nfunction validateAssertion(assertion) {\n\tif (chai.util.flag(assertion, \"negate\")) throw new Error(`${getAssertionName(assertion)} cannot be used with \"not\"`);\n}\nconst SnapshotPlugin = (chai, utils) => {\n\tfor (const key of [\"matchSnapshot\", \"toMatchSnapshot\"]) utils.addMethod(chai.Assertion.prototype, key, wrapAssertion(utils, key, function(propertiesOrHint, hint) {\n\t\treturn assertMatchResult(toMatchSnapshotImpl({\n\t\t\tassertion: this,\n\t\t\treceived: utils.flag(this, \"object\"),\n\t\t\t...normalizeArguments(propertiesOrHint, hint)\n\t\t}), chai.util.flag(this, \"message\"));\n\t}));\n\tutils.addMethod(chai.Assertion.prototype, \"toMatchFileSnapshot\", function(filepath, hint) {\n\t\t// set name manually since it's not wrapped by wrapAssertion\n\t\tutils.flag(this, \"_name\", \"toMatchFileSnapshot\");\n\t\t// validate early synchronously just not to break some existing tests\n\t\tvalidateAssertion(this);\n\t\tconst assertPromise = toMatchFileSnapshotImpl({\n\t\t\tassertion: this,\n\t\t\treceived: utils.flag(this, \"object\"),\n\t\t\tfilepath,\n\t\t\thint\n\t\t}).then((result) => assertMatchResult(result, chai.util.flag(this, \"message\")));\n\t\treturn recordAsyncExpect(getTest(this), assertPromise, createAssertionMessage(utils, this, true), /* @__PURE__ */ new Error(\"resolves\"), utils.flag(this, \"soft\"));\n\t});\n\tutils.addMethod(chai.Assertion.prototype, \"toMatchInlineSnapshot\", wrapAssertion(utils, \"toMatchInlineSnapshot\", function __INLINE_SNAPSHOT_OFFSET_3__(propertiesOrInlineSnapshot, inlineSnapshotOrHint, hint) {\n\t\treturn assertMatchResult(toMatchSnapshotImpl({\n\t\t\tassertion: this,\n\t\t\treceived: utils.flag(this, \"object\"),\n\t\t\tisInline: true,\n\t\t\t...normalizeInlineArguments(propertiesOrInlineSnapshot, inlineSnapshotOrHint, hint)\n\t\t}), chai.util.flag(this, \"message\"));\n\t}));\n\tutils.addMethod(chai.Assertion.prototype, \"toThrowErrorMatchingSnapshot\", wrapAssertion(utils, \"toThrowErrorMatchingSnapshot\", function(propertiesOrHint, hint) {\n\t\tvalidateAssertion(this);\n\t\tconst received = utils.flag(this, \"object\");\n\t\tconst promise = utils.flag(this, \"promise\");\n\t\treturn assertMatchResult(toMatchSnapshotImpl({\n\t\t\tassertion: this,\n\t\t\treceived: getError(received, promise),\n\t\t\t...normalizeArguments(propertiesOrHint, hint)\n\t\t}), chai.util.flag(this, \"message\"));\n\t}));\n\tutils.addMethod(chai.Assertion.prototype, \"toThrowErrorMatchingInlineSnapshot\", wrapAssertion(utils, \"toThrowErrorMatchingInlineSnapshot\", function __INLINE_SNAPSHOT_OFFSET_3__(inlineSnapshotOrHint, hint) {\n\t\tvalidateAssertion(this);\n\t\tconst received = utils.flag(this, \"object\");\n\t\tconst promise = utils.flag(this, \"promise\");\n\t\treturn assertMatchResult(toMatchSnapshotImpl({\n\t\t\tassertion: this,\n\t\t\treceived: getError(received, promise),\n\t\t\tisInline: true,\n\t\t\t...normalizeInlineArguments(void 0, inlineSnapshotOrHint, hint)\n\t\t}), chai.util.flag(this, \"message\"));\n\t}));\n\tutils.addMethod(chai.expect, \"addSnapshotSerializer\", addSerializer);\n};\nfunction toMatchDomainSnapshotImpl(opts) {\n\tconst { assertion } = opts;\n\tvalidateAssertion(assertion);\n\tconst assertionName = getAssertionName(assertion);\n\tconst test = getTest(assertion);\n\tlet { inlineSnapshot } = opts;\n\tif (inlineSnapshot !== void 0) inlineSnapshot = stripSnapshotIndentation(inlineSnapshot);\n\tconst pollFn = chai.util.flag(assertion, \"_poll.fn\");\n\tif (pollFn) return getSnapshotClient().pollMatchDomain({\n\t\tpoll: pollFn,\n\t\tadapter: opts.adapter,\n\t\tmessage: opts.hint,\n\t\tisInline: opts.isInline,\n\t\terrorMessage: chai.util.flag(assertion, \"message\"),\n\t\ttimeout: chai.util.flag(assertion, \"_poll.timeout\"),\n\t\tinterval: chai.util.flag(assertion, \"_poll.interval\"),\n\t\tassertionName,\n\t\tinlineSnapshot,\n\t\terror: chai.util.flag(assertion, \"error\"),\n\t\t...getTestNames(test)\n\t});\n\treturn getSnapshotClient().matchDomain({\n\t\treceived: opts.received,\n\t\tadapter: opts.adapter,\n\t\tmessage: opts.hint,\n\t\tisInline: opts.isInline,\n\t\terrorMessage: chai.util.flag(assertion, \"message\"),\n\t\tassertionName,\n\t\tinlineSnapshot,\n\t\terror: chai.util.flag(assertion, \"error\"),\n\t\t...getTestNames(test)\n\t});\n}\n// toMatchSnapshot(propertiesOrHint?, hint?)\nfunction normalizeArguments(propertiesOrHint, hint) {\n\tif (typeof propertiesOrHint === \"string\") return { hint: propertiesOrHint };\n\treturn {\n\t\tproperties: propertiesOrHint,\n\t\thint\n\t};\n}\n// toMatchInlineSnapshot(propertiesOrInlineSnapshot?, inlineSnapshotOrHint?, hint?)\nfunction normalizeInlineArguments(propertiesOrInlineSnapshot, inlineSnapshotOrHint, hint) {\n\tlet inlineSnapshot;\n\tif (typeof propertiesOrInlineSnapshot === \"string\") {\n\t\tinlineSnapshot = stripSnapshotIndentation(propertiesOrInlineSnapshot);\n\t\treturn {\n\t\t\tinlineSnapshot,\n\t\t\thint: inlineSnapshotOrHint\n\t\t};\n\t}\n\tif (inlineSnapshotOrHint) inlineSnapshot = stripSnapshotIndentation(inlineSnapshotOrHint);\n\treturn {\n\t\tproperties: propertiesOrInlineSnapshot,\n\t\tinlineSnapshot,\n\t\thint\n\t};\n}\nfunction toMatchSnapshotImpl(options) {\n\tconst { assertion } = options;\n\tvalidateAssertion(assertion);\n\tconst assertionName = getAssertionName(assertion);\n\tconst test = getTest(assertion);\n\treturn getSnapshotClient().match({\n\t\treceived: options.received,\n\t\tproperties: options.properties,\n\t\tmessage: options.hint,\n\t\tisInline: options.isInline,\n\t\tinlineSnapshot: options.inlineSnapshot,\n\t\t// pass `assertionName` for inline snapshot stack probing\n\t\tassertionName,\n\t\t// set by async assertion (e.g. resolves/rejects) for inline snapshot stack probing\n\t\terror: chai.util.flag(assertion, \"error\"),\n\t\t...getTestNames(test)\n\t});\n}\nasync function toMatchFileSnapshotImpl(options) {\n\tconst { assertion } = options;\n\tvalidateAssertion(assertion);\n\tconst testNames = getTestNames(getTest(assertion));\n\tconst snapshotState = getSnapshotClient().getSnapshotState(testNames.filepath);\n\tconst rawSnapshotFile = await snapshotState.environment.resolveRawPath(testNames.filepath, options.filepath);\n\tconst rawSnapshotContent = await snapshotState.environment.readSnapshotFile(rawSnapshotFile);\n\treturn getSnapshotClient().match({\n\t\treceived: options.received,\n\t\tmessage: options.hint,\n\t\trawSnapshot: {\n\t\t\tfile: rawSnapshotFile,\n\t\t\tcontent: rawSnapshotContent ?? void 0\n\t\t},\n\t\t...testNames\n\t});\n}\nfunction assertMatchResult(result, customMessage) {\n\tif (!result.pass) {\n\t\tconst errorMessage = (customMessage ? `${customMessage}: ` : \"\") + result.message();\n\t\tthrow Object.assign(new Error(errorMessage), {\n\t\t\tactual: result.actual,\n\t\t\texpected: result.expected,\n\t\t\tdiffOptions: { expand: getWorkerState().config.snapshotOptions.expand }\n\t\t});\n\t}\n}\n/**\n* Composable snapshot matcher helpers for building custom snapshot matchers\n* with `expect.extend`.\n*\n* @experimental\n* @see https://vitest.dev/guide/snapshot.html#custom-snapshot-matchers\n*/\nconst Snapshots = {\n\t/**\n\t* Composable for building custom snapshot matchers via `expect.extend`.\n\t* Call with `this` bound to the matcher state. Returns `{ pass, message }`\n\t* compatible with the custom matcher return contract.\n\t*\n\t* @example\n\t* ```ts\n\t* import { Snapshots } from 'vitest/runtime'\n\t*\n\t* expect.extend({\n\t*   toMatchTrimmedSnapshot(received: string) {\n\t*     return Snapshots.toMatchSnapshot.call(this, received.slice(0, 10))\n\t*   },\n\t* })\n\t* ```\n\t*\n\t* @experimental\n\t* @see https://vitest.dev/guide/snapshot.html#custom-snapshot-matchers\n\t*/\n\ttoMatchSnapshot(received, propertiesOrHint, hint) {\n\t\treturn toMatchSnapshotImpl({\n\t\t\tassertion: this.assertion,\n\t\t\treceived,\n\t\t\t...normalizeArguments(propertiesOrHint, hint)\n\t\t});\n\t},\n\t/**\n\t* Composable for building custom inline snapshot matchers via `expect.extend`.\n\t* Call with `this` bound to the matcher state. Returns `{ pass, message }`\n\t* compatible with the custom matcher return contract.\n\t*\n\t* @example\n\t* ```ts\n\t* import { Snapshots } from 'vitest/runtime'\n\t*\n\t* expect.extend({\n\t*   toMatchTrimmedInlineSnapshot(received: string, inlineSnapshot?: string) {\n\t*     return Snapshots.toMatchInlineSnapshot.call(this, received.slice(0, 10), inlineSnapshot)\n\t*   },\n\t* })\n\t* ```\n\t*\n\t* @experimental\n\t* @see https://vitest.dev/guide/snapshot.html#custom-snapshot-matchers\n\t*/\n\ttoMatchInlineSnapshot(received, propertiesOrInlineSnapshot, inlineSnapshotOrHint, hint) {\n\t\treturn toMatchSnapshotImpl({\n\t\t\tassertion: this.assertion,\n\t\t\treceived,\n\t\t\tisInline: true,\n\t\t\t...normalizeInlineArguments(propertiesOrInlineSnapshot, inlineSnapshotOrHint, hint)\n\t\t});\n\t},\n\t/**\n\t* Composable for building custom file snapshot matchers via `expect.extend`.\n\t* Call with `this` bound to the matcher state. Returns a `Promise<{ pass, message }>`\n\t* compatible with the custom matcher return contract.\n\t*\n\t* @example\n\t* ```ts\n\t* import { Snapshots } from 'vitest/runtime'\n\t*\n\t* expect.extend({\n\t*   async toMatchTrimmedFileSnapshot(received: string, file: string) {\n\t*     return Snapshots.toMatchFileSnapshot.call(this, received.slice(0, 10), file)\n\t*   },\n\t* })\n\t* ```\n\t*\n\t* @experimental\n\t* @see https://vitest.dev/guide/snapshot.html#custom-snapshot-matchers\n\t*/\n\ttoMatchFileSnapshot(received, filepath, hint) {\n\t\treturn toMatchFileSnapshotImpl({\n\t\t\tassertion: this.assertion,\n\t\t\treceived,\n\t\t\tfilepath,\n\t\t\thint\n\t\t});\n\t},\n\t/**\n\t* Composable for building custom domain-based snapshot matchers via `expect.extend`.\n\t*\n\t* Call this from a matcher and pass the domain adapter that defines capture,\n\t* rendering, parsing, and semantic matching behavior.\n\t*\n\t* @experimental\n\t*/\n\ttoMatchDomainSnapshot(domain, received) {\n\t\treturn toMatchDomainSnapshotImpl({\n\t\t\tassertion: this.assertion,\n\t\t\tadapter: domain,\n\t\t\treceived\n\t\t});\n\t},\n\t/**\n\t* Composable for building custom domain-based inline snapshot matchers via `expect.extend`.\n\t*\n\t* Call this from a matcher and pass the domain adapter that defines capture,\n\t* rendering, parsing, and semantic matching behavior.\n\t*\n\t* @experimental\n\t*/\n\ttoMatchDomainInlineSnapshot(domain, received, inlineSnapshot) {\n\t\treturn toMatchDomainSnapshotImpl({\n\t\t\tassertion: this.assertion,\n\t\t\tadapter: domain,\n\t\t\treceived,\n\t\t\tisInline: true,\n\t\t\tinlineSnapshot\n\t\t});\n\t}\n};\n\nchai.use(JestExtend);\nchai.use(JestChaiExpect);\nchai.use(ChaiStyleAssertions);\nchai.use(SnapshotPlugin);\nchai.use(JestAsymmetricMatchers);\nchai.use(MockPlugin);\n\nfunction createExpect(test) {\n\tconst expect = ((value, message) => {\n\t\tconst { assertionCalls } = getState(expect);\n\t\tsetState({ assertionCalls: assertionCalls + 1 }, expect);\n\t\tconst assert = chai.expect(value, message);\n\t\tconst _test = test || getCurrentTest();\n\t\tif (_test)\n // @ts-expect-error internal\n\t\treturn assert.withTest(_test);\n\t\telse return assert;\n\t});\n\tObject.assign(expect, chai.expect);\n\tObject.assign(expect, globalThis[ASYMMETRIC_MATCHERS_OBJECT]);\n\texpect.getState = () => getState(expect);\n\texpect.setState = (state) => setState(state, expect);\n\t// @ts-expect-error global is not typed\n\tconst globalState = getState(globalThis[GLOBAL_EXPECT]) || {};\n\tsetState({\n\t\t// this should also add \"snapshotState\" that is added conditionally\n\t\t...globalState,\n\t\tassertionCalls: 0,\n\t\tisExpectingAssertions: false,\n\t\tisExpectingAssertionsError: null,\n\t\texpectedAssertionsNumber: null,\n\t\texpectedAssertionsNumberErrorGen: null,\n\t\tget testPath() {\n\t\t\treturn getWorkerState().filepath;\n\t\t},\n\t\tcurrentTestName: test ? test.fullTestName ?? \"\" : globalState.currentTestName\n\t}, expect);\n\texpect.assert = chai.assert;\n\t// @ts-expect-error untyped\n\texpect.extend = (matchers) => chai.expect.extend(expect, matchers);\n\texpect.addEqualityTesters = (customTesters) => addCustomEqualityTesters(customTesters);\n\texpect.soft = (...args) => {\n\t\t// @ts-expect-error private soft access\n\t\treturn expect(...args).withContext({ soft: true });\n\t};\n\texpect.poll = createExpectPoll(expect);\n\texpect.unreachable = (message) => {\n\t\tchai.assert.fail(`expected${message ? ` \"${message}\" ` : \" \"}not to be reached`);\n\t};\n\tfunction assertions(expected) {\n\t\tconst errorGen = () => /* @__PURE__ */ new Error(`expected number of assertions to be ${expected}, but got ${expect.getState().assertionCalls}`);\n\t\tif (Error.captureStackTrace) Error.captureStackTrace(errorGen(), assertions);\n\t\texpect.setState({\n\t\t\texpectedAssertionsNumber: expected,\n\t\t\texpectedAssertionsNumberErrorGen: errorGen\n\t\t});\n\t}\n\tfunction hasAssertions() {\n\t\tconst error = /* @__PURE__ */ new Error(\"expected any number of assertion, but got none\");\n\t\tif (Error.captureStackTrace) Error.captureStackTrace(error, hasAssertions);\n\t\texpect.setState({\n\t\t\tisExpectingAssertions: true,\n\t\t\tisExpectingAssertionsError: error\n\t\t});\n\t}\n\tchai.util.addMethod(expect, \"assertions\", assertions);\n\tchai.util.addMethod(expect, \"hasAssertions\", hasAssertions);\n\texpect.extend(customMatchers);\n\texpect.extend(benchMatchers);\n\treturn expect;\n}\nconst globalExpect = createExpect();\nObject.defineProperty(globalThis, GLOBAL_EXPECT, {\n\tvalue: globalExpect,\n\twritable: true,\n\tconfigurable: true\n});\nconst assert = chai.assert;\nconst should = chai.should;\n\n/**\n* Gives access to injected context provided from the main thread.\n* This usually returns a value provided by `globalSetup` or an external library.\n*/\nfunction inject(key) {\n\treturn getWorkerState().providedContext[key];\n}\n\nconst now = globalThis.performance ? globalThis.performance.now.bind(globalThis.performance) : Date.now;\n/**\n* The built-in benchmark provider, backed by tinybench. Selected when\n* `benchmark.provider` is not configured.\n*/\nfunction createDefaultBenchmarkProvider(config) {\n\tlet benchIdx = 0;\n\treturn { async run({ test, options, registrations }) {\n\t\tconst currentIndex = ++benchIdx;\n\t\tconst tinybench = new Bench({\n\t\t\tsignal: test.context.signal,\n\t\t\tname: `${test.fullTestName} ${currentIndex}`,\n\t\t\tretainSamples: config.benchmark.retainSamples,\n\t\t\t...options,\n\t\t\tnow\n\t\t});\n\t\tfor (const { name, fn, fnOpts } of registrations) tinybench.add(name, fn, fnOpts);\n\t\tawait tinybench.run();\n\t\tconst errors = tinybench.tasks.filter((task) => task.result.state === \"errored\").map((task) => task.result.error);\n\t\tif (errors.length === 1) throw errors[0];\n\t\tif (errors.length > 1) throw new AggregateError(errors, \"Some benchmarks failed\");\n\t\treturn tinybench.tasks.map(toBenchResult);\n\t} };\n}\nfunction toBenchResult(task) {\n\tconst result = task.result;\n\tif (result.state !== \"completed\") throw new Error(`task \"${task.name}\" did not complete: received \"${result.state}\"`);\n\treturn {\n\t\t...result,\n\t\tname: task.name\n\t};\n}\n\nconst kRegistration = Symbol(\"registration\");\nconst kFromSource = Symbol(\"fromSource\");\nconst kPerProject = Symbol(\"perProject\");\nconst kWriteResult = Symbol(\"writeResult\");\nconst kFinalize = Symbol(\"finalize\");\nlet cachedProvider;\nasync function loadProviderModule(provider, moduleRunner) {\n\tlet mod;\n\ttry {\n\t\tmod = await moduleRunner.import(provider);\n\t} catch (error) {\n\t\tthrow new Error(`Failed to load benchmark provider from \"${provider}\".`, { cause: error });\n\t}\n\tif (mod.default == null) throw new Error(`Benchmark provider loaded from \"${provider}\" did not have a default export.`);\n\treturn mod.default;\n}\n/**\n* Resolves the benchmark provider for the current worker, importing a custom\n* provider module on first use. The result is cached for the lifetime of the\n* worker so a custom provider is imported at most once.\n*/\nfunction resolveBenchmarkProvider(config, moduleRunner) {\n\tif (!cachedProvider) {\n\t\tconst provider = config.benchmark.provider;\n\t\tcachedProvider = !provider ? Promise.resolve(createDefaultBenchmarkProvider(config)) : loadProviderModule(provider, moduleRunner);\n\t}\n\treturn cachedProvider;\n}\nfunction isFromRegistration(reg) {\n\treturn kFromSource in reg;\n}\nfunction substitutePath(template, projectName) {\n\treturn template.replace(/\\$\\{projectName\\}/g, projectName ?? \"\");\n}\nfunction createBench(test, config, moduleRunner) {\n\tconst pending = /* @__PURE__ */ new Set();\n\tconst resolveTemplate = (template) => substitutePath(template, config.benchmark.projectName);\n\tconst resolveFromSource = async (source) => {\n\t\tif (typeof source === \"function\") return source();\n\t\tconst resolved = resolveTemplate(source);\n\t\tconst data = await rpc().readBenchmarkResult(resolved);\n\t\tif (data == null) throw new Error(`\\`bench.from()\\` could not find a result file at \"${resolved}\". Run the source benchmark first to create it.`);\n\t\treturn data;\n\t};\n\tconst taskFromBaseline = (name, data) => ({\n\t\tname,\n\t\tlatency: data.latency,\n\t\tthroughput: data.throughput,\n\t\tperiod: data.period,\n\t\ttotalTime: data.totalTime,\n\t\trank: 0,\n\t\tfromStore: true\n\t});\n\tconst createCompareStorage = (results, fromResults) => {\n\t\treturn { get(name) {\n\t\t\tconst stored = fromResults?.get(name);\n\t\t\tif (stored) return stored;\n\t\t\tconst result = results.get(name);\n\t\t\tif (!result) throw new Error(`task \"${name}\" was not defined`);\n\t\t\treturn result;\n\t\t} };\n\t};\n\tconst serializeBenchmark = (results, name, taskMeta, fromTasks) => {\n\t\tconst tasks = results.map((result) => ({\n\t\t\tname: result.name,\n\t\t\tlatency: result.latency,\n\t\t\tthroughput: result.throughput,\n\t\t\tperiod: result.period,\n\t\t\ttotalTime: result.totalTime,\n\t\t\trank: 0,\n\t\t\t...taskMeta?.get(result.name)\n\t\t}));\n\t\tif (fromTasks) tasks.push(...fromTasks);\n\t\ttasks.sort((a, b) => a.latency.mean - b.latency.mean);\n\t\ttasks.forEach((task, idx) => {\n\t\t\ttask.rank = idx + 1;\n\t\t});\n\t\treturn {\n\t\t\tname,\n\t\t\ttasks\n\t\t};\n\t};\n\tconst recordBenchmark = async (results, name, taskMeta, fromTasks) => {\n\t\tconst serializedBenchmark = serializeBenchmark(results, name, taskMeta, fromTasks);\n\t\ttest.benchmarks.push(serializedBenchmark);\n\t\tawait rpc().onTestBenchmark(test.id, serializedBenchmark);\n\t};\n\tconst writeResultArtifact = async (template, result) => {\n\t\tconst resolved = resolveTemplate(template);\n\t\tconst data = {\n\t\t\tlatency: result.latency,\n\t\t\tthroughput: result.throughput,\n\t\t\tperiod: result.period,\n\t\t\ttotalTime: result.totalTime\n\t\t};\n\t\tawait rpc().writeBenchmarkResult(resolved, data);\n\t};\n\tconst groupName = (options) => options?.name ?? test.fullTestName;\n\tconst runGroup = async (registrations, options) => {\n\t\tconst workerState = getWorkerState();\n\t\tconst getterTracker = workerState.getterTracker;\n\t\tgetterTracker?.resetInvocations();\n\t\ttry {\n\t\t\tconst results = await (await resolveBenchmarkProvider(config, moduleRunner)).run({\n\t\t\t\ttest,\n\t\t\t\tconfig: config.benchmark,\n\t\t\t\tregistrations,\n\t\t\t\toptions\n\t\t\t});\n\t\t\tconst byName = /* @__PURE__ */ new Map();\n\t\t\tfor (const result of results) byName.set(result.name, result);\n\t\t\treturn byName;\n\t\t} finally {\n\t\t\tconst excessiveInvocations = config.benchmark.suppressExportGetterWarnings ? void 0 : getterTracker?.getExcessiveInvocations();\n\t\t\tif (excessiveInvocations?.length) {\n\t\t\t\tconst entries = excessiveInvocations.map(({ moduleId, exportName }) => `  - ${formatModuleId(moduleId, workerState.config.root)} > ${exportName}`).join(\"\\n\");\n\t\t\t\tconsole.warn([\n\t\t\t\t\ty.yellow(y.bold(\"Benchmark Warning\")),\n\t\t\t\t\t`Benchmark ${y.bold(`\"${groupName(options)}\"`)} accessed module export getters too many times.`,\n\t\t\t\t\t\"\",\n\t\t\t\t\t\"This can make results unreliable because export getters add overhead.\",\n\t\t\t\t\t\"See https://vitest.dev/guide/benchmarking#module-runner-overhead\",\n\t\t\t\t\t\"\",\n\t\t\t\t\t\"Tracked exports:\",\n\t\t\t\t\tentries\n\t\t\t\t].join(\"\\n\"));\n\t\t\t}\n\t\t}\n\t};\n\tconst runSingle = async (name, fn, fnOpts, options, meta, writeResult) => {\n\t\tconst result = (await runGroup([{\n\t\t\tname,\n\t\t\tfn,\n\t\t\tfnOpts\n\t\t}], options)).get(name);\n\t\tif (!result) throw new Error(`benchmark provider did not return a result for \"${name}\"`);\n\t\tawait recordBenchmark([result], groupName(options), meta ? /* @__PURE__ */ new Map([[name, meta]]) : void 0);\n\t\tif (writeResult) await writeResultArtifact(writeResult, result);\n\t\treturn result;\n\t};\n\tconst runFrom = async (name, source) => {\n\t\tconst data = await resolveFromSource(source);\n\t\tconst benchmark = {\n\t\t\tname: test.fullTestName,\n\t\t\ttasks: [{\n\t\t\t\t...taskFromBaseline(name, data),\n\t\t\t\trank: 1\n\t\t\t}]\n\t\t};\n\t\ttest.benchmarks.push(benchmark);\n\t\tawait rpc().onTestBenchmark(test.id, benchmark);\n\t\treturn data;\n\t};\n\tconst bench = (nameOrFunction, a, b) => {\n\t\tvalidateBenchmarkProject(config);\n\t\tconst { fn, fnOpts, writeResult, perProject } = normalizeBenchArgs(a, b);\n\t\tconst name = typeof nameOrFunction === \"function\" ? nameOrFunction.name || \"<anonymous>\" : nameOrFunction;\n\t\tconst meta = perProject ? { perProject: true } : void 0;\n\t\tconst registration = {\n\t\t\t[kRegistration]: true,\n\t\t\tname,\n\t\t\tfn,\n\t\t\tfnOpts,\n\t\t\trun: (options) => {\n\t\t\t\tpending.delete(registration);\n\t\t\t\treturn runSingle(name, fn, fnOpts, options, meta, writeResult);\n\t\t\t}\n\t\t};\n\t\tif (perProject) registration[kPerProject] = true;\n\t\tif (writeResult) registration[kWriteResult] = writeResult;\n\t\tpending.add(registration);\n\t\treturn registration;\n\t};\n\tbench.from = (nameOrFunction, source) => {\n\t\tvalidateBenchmarkProject(config);\n\t\tif (typeof nameOrFunction !== \"string\" && typeof nameOrFunction !== \"function\") throw new TypeError(\"`bench.from()` requires a name (string or named function) as its first argument.\");\n\t\tif (typeof source !== \"string\" && typeof source !== \"function\") throw new TypeError(\"`bench.from()` expects a string path or a function returning the result data as its second argument.\");\n\t\tconst name = typeof nameOrFunction === \"function\" ? nameOrFunction.name || \"<anonymous>\" : nameOrFunction;\n\t\tconst registration = {\n\t\t\t[kRegistration]: true,\n\t\t\t[kFromSource]: source,\n\t\t\tname,\n\t\t\trun: () => {\n\t\t\t\tpending.delete(registration);\n\t\t\t\treturn runFrom(name, source);\n\t\t\t}\n\t\t};\n\t\tpending.add(registration);\n\t\treturn registration;\n\t};\n\tbench.compare = async (...args) => {\n\t\tvalidateBenchmarkProject(config);\n\t\t// extract optional trailing BenchRunOptions argument\n\t\tconst lastArg = args.at(-1);\n\t\tconst benchOptions = lastArg != null && typeof lastArg === \"object\" && !(kRegistration in lastArg) ? args.pop() : void 0;\n\t\tconst registrations = args;\n\t\t// Mark every passed-in registration as consumed before validation so a\n\t\t// throwing `bench.compare()` (wrong arity, wrong shape) doesn't also\n\t\t// trigger the unrun-bench warning — the user's intent was to consume them.\n\t\tfor (const reg of registrations) if (reg != null && typeof reg === \"object\" && kRegistration in reg) pending.delete(reg);\n\t\tif (registrations.length < 2) throw new SyntaxError(`\\`bench.compare()\\` requires at least 2 benchmarks, received ${registrations.length} instead. ${registrations.length === 1 ? \"Consider calling `bench().run()`. \" : \"Define benchmarks by calling `bench()`. \"}See https://vitest.dev/guide/benchmarking#comparing-benchmarks`);\n\t\tfor (const reg of registrations) if (reg == null || typeof reg !== \"object\" || !(kRegistration in reg)) throw new SyntaxError(\"`bench.compare()` expects every argument to be the return value of `bench` or `bench.from`.\");\n\t\tconst runnable = [];\n\t\tconst fromEntries = [];\n\t\tfor (const reg of registrations) if (isFromRegistration(reg)) fromEntries.push(reg);\n\t\telse runnable.push(reg);\n\t\tconst taskMeta = /* @__PURE__ */ new Map();\n\t\tfor (const reg of runnable) if (reg[kPerProject]) taskMeta.set(reg.name, { perProject: true });\n\t\tconst fromResults = /* @__PURE__ */ new Map();\n\t\tconst fromTasks = [];\n\t\tif (fromEntries.length > 0) {\n\t\t\tconst resolved = await Promise.all(fromEntries.map(async (reg) => {\n\t\t\t\treturn {\n\t\t\t\t\treg,\n\t\t\t\t\tdata: await resolveFromSource(reg[kFromSource])\n\t\t\t\t};\n\t\t\t}));\n\t\t\tfor (const { reg, data } of resolved) {\n\t\t\t\tfromResults.set(reg.name, data);\n\t\t\t\tfromTasks.push(taskFromBaseline(reg.name, data));\n\t\t\t}\n\t\t}\n\t\tlet results = /* @__PURE__ */ new Map();\n\t\tif (runnable.length > 0) results = await runGroup(runnable.map((reg) => ({\n\t\t\tname: reg.name,\n\t\t\tfn: reg.fn,\n\t\t\tfnOpts: reg.fnOpts\n\t\t})), benchOptions);\n\t\tawait recordBenchmark(Array.from(results.values()), groupName(benchOptions), taskMeta, fromTasks);\n\t\t// write artifacts for every runnable registration that requested it. We\n\t\t// do this after recording so a write failure can't be confused with a\n\t\t// benchmark failure in the reporter output.\n\t\tawait Promise.all(runnable.filter((reg) => reg[kWriteResult] != null).map((reg) => {\n\t\t\tconst result = results.get(reg.name);\n\t\t\treturn writeResultArtifact(reg[kWriteResult], result);\n\t\t}));\n\t\treturn createCompareStorage(results, fromResults);\n\t};\n\tbench[kFinalize] = () => {\n\t\tif (pending.size === 0) return;\n\t\tconst names = Array.from(pending, (reg) => `\"${reg.name}\"`).join(\", \");\n\t\tpending.clear();\n\t\tconsole.warn([\n\t\t\ty.yellow(y.bold(\"Benchmark Warning\")),\n\t\t\t`Test ${y.bold(`\"${test.fullTestName}\"`)} registered benchmarks that never ran: ${names}.`,\n\t\t\t\"\",\n\t\t\t\"Call `.run()` on the registration, or pass it to `bench.compare()`.\",\n\t\t\t\"See https://vitest.dev/guide/benchmarking#defining-a-benchmark\"\n\t\t].join(\"\\n\"));\n\t};\n\treturn bench;\n}\nfunction formatModuleId(moduleId, root) {\n\tif (!root || !isAbsolute(moduleId)) return moduleId;\n\treturn relative(root, moduleId);\n}\nfunction normalizeBenchArgs(a, b) {\n\tif (typeof a === \"function\") {\n\t\tif (b !== void 0) throw new TypeError(\"`bench()` does not accept options as the third argument. Pass options as the second argument instead: `bench(name, options, fn)`.\");\n\t\treturn {\n\t\t\tfn: a,\n\t\t\tfnOpts: void 0,\n\t\t\twriteResult: void 0,\n\t\t\tperProject: false\n\t\t};\n\t}\n\tif (typeof b !== \"function\") throw new TypeError(\"`bench()` expects a benchmark function. Call `bench(name, fn)` or `bench(name, options, fn)`.\");\n\t// Strip vitest-specific fields only when present so we don't allocate a new\n\t// object — preserving referential identity matters: users inspect\n\t// `registration.fnOpts` and the provider sees the same object the caller\n\t// passed in.\n\tif (a.writeResult === void 0 && a.perProject === void 0) return {\n\t\tfn: b,\n\t\tfnOpts: a,\n\t\twriteResult: void 0,\n\t\tperProject: false\n\t};\n\tconst { writeResult, perProject, ...fnOpts } = a;\n\treturn {\n\t\tfn: b,\n\t\tfnOpts: Object.keys(fnOpts).length > 0 ? fnOpts : void 0,\n\t\twriteResult,\n\t\tperProject: perProject ?? false\n\t};\n}\nfunction validateBenchmarkProject(config) {\n\tif (!config.benchmark.enabled) throw new Error(\"Cannot use the `bench` test-context fixture within a regular test run. Benchmarks are inherently flaky, so Vitest runs them in a dedicated project based on the `benchmark.include` pattern (default `**/*.{bench,benchmark}.?(c|m)[jt]s?(x)`). Move this code to a file matched by `benchmark.include`, and make sure `bench` is destructured from the test context (`test('...', async ({ bench }) => { ... })`) — it is not a top-level export of `vitest`. See https://vitest.dev/guide/benchmarking#stability\");\n}\n\nclass TestRunner {\n\tconfig;\n\tsnapshotClient = getSnapshotClient();\n\tworkerState = getWorkerState();\n\tmoduleRunner;\n\tcancelRun = false;\n\tassertionsErrors = /* @__PURE__ */ new WeakMap();\n\tbenchInstances = /* @__PURE__ */ new WeakMap();\n\tpool = this.workerState.ctx.pool;\n\t/**\n\t* @internal\n\t*/\n\t_otel;\n\tviteEnvironment;\n\tviteModuleRunner;\n\tconstructor(config) {\n\t\tthis.config = config;\n\t\tconst environment = this.workerState.environment;\n\t\tthis.viteEnvironment = environment.viteEnvironment || environment.name;\n\t\tthis.viteModuleRunner = config.experimental.viteModuleRunner;\n\t\t// vm pools downgrade worker-scoped fixtures to file scope, so the hook has\n\t\t// nothing to tear down there; registering it anyway would keep the\n\t\t// listener, an in-context closure, alive for the lifetime of the worker\n\t\tif (this.pool !== \"vmThreads\" && this.pool !== \"vmForks\") this.onCleanupWorkerContext = (listener) => this.workerState.onCleanup(listener);\n\t}\n\timportFile(filepath, source) {\n\t\treturn this._otel.$(`vitest.module.import_${source === \"setup\" ? \"setup\" : \"spec\"}`, { attributes: { \"code.file.path\": filepath } }, () => {\n\t\t\tif (!this.viteModuleRunner) filepath = `${filepath}?vitest=${Date.now()}`;\n\t\t\tconst options = this.viteModuleRunner ? { invalidate: true } : void 0;\n\t\t\treturn this.moduleRunner.import(filepath, options);\n\t\t});\n\t}\n\tonCollectStart(file) {\n\t\tthis.workerState.current = file;\n\t}\n\tonCleanupWorkerContext;\n\tonAfterRunFiles(_files) {\n\t\tthis.snapshotClient.clear();\n\t\tthis.workerState.current = void 0;\n\t}\n\tasync onAfterRunSuite(suite) {\n\t\tif (this.config.logHeapUsage && typeof process !== \"undefined\") suite.result.heap = process.memoryUsage().heapUsed;\n\t\tif (suite.mode !== \"skip\" && \"filepath\" in suite) {\n\t\t\t// mark snapshots in skipped tests as not obsolete\n\t\t\tfor (const test of getTests(suite)) if (test.mode === \"skip\") {\n\t\t\t\tconst name = getNames(test).slice(1).join(\" > \");\n\t\t\t\tthis.snapshotClient.skipTest(suite.file.filepath, name);\n\t\t\t}\n\t\t\tconst result = await this.snapshotClient.finish(suite.file.filepath);\n\t\t\tif (this.workerState.config.snapshotOptions.updateSnapshot === \"none\" && result.unchecked) {\n\t\t\t\tlet message = `Obsolete snapshots found when no snapshot update is expected.\\n`;\n\t\t\t\tfor (const key of result.uncheckedKeys) message += `· ${key}\\n`;\n\t\t\t\tsuite.result.errors ??= [];\n\t\t\t\tsuite.result.errors.push(processError(new Error(message)));\n\t\t\t\tsuite.result.state = \"fail\";\n\t\t\t}\n\t\t\tawait rpc().snapshotSaved(result);\n\t\t}\n\t\tthis.workerState.current = suite.suite || suite.file;\n\t}\n\tonAfterRunTask(test) {\n\t\tif (this.config.logHeapUsage && typeof process !== \"undefined\") test.result.heap = process.memoryUsage().heapUsed;\n\t\tthis.workerState.current = test.suite || test.file;\n\t}\n\tcancel(_reason) {\n\t\tthis.cancelRun = true;\n\t}\n\tinjectValue(key) {\n\t\t// inject has a very limiting type controlled by ProvidedContext\n\t\t// some tests override it which causes the build to fail\n\t\treturn inject(key);\n\t}\n\tasync onBeforeRunTask(test) {\n\t\tif (this.cancelRun) test.mode = \"skip\";\n\t\tif (test.mode !== \"run\" && test.mode !== \"queued\") return;\n\t\tthis.workerState.current = test;\n\t}\n\tasync onBeforeRunSuite(suite) {\n\t\tif (this.cancelRun) suite.mode = \"skip\";\n\t\t// initialize snapshot state before running file suite\n\t\tif (suite.mode !== \"skip\" && \"filepath\" in suite) await this.snapshotClient.setup(suite.file.filepath, this.workerState.config.snapshotOptions);\n\t\tthis.workerState.current = suite;\n\t}\n\tonBeforeTryTask(test, _options) {\n\t\tclearModuleMocks(this.config);\n\t\tthis.snapshotClient.clearTest(test.file.filepath, test.id);\n\t\tsetState({\n\t\t\tassertionCalls: 0,\n\t\t\tisExpectingAssertions: false,\n\t\t\tisExpectingAssertionsError: null,\n\t\t\texpectedAssertionsNumber: null,\n\t\t\texpectedAssertionsNumberErrorGen: null,\n\t\t\tcurrentTestName: getTestName(test),\n\t\t\tsnapshotState: this.snapshotClient.getSnapshotState(test.file.filepath)\n\t\t}, globalThis[GLOBAL_EXPECT]);\n\t}\n\tonAfterTryTask(test) {\n\t\tthis.benchInstances.get(test)?.[kFinalize]();\n\t\tconst { assertionCalls, expectedAssertionsNumber, expectedAssertionsNumberErrorGen, isExpectingAssertions, isExpectingAssertionsError } = test.context._local ? test.context.expect.getState() : getState(globalThis[GLOBAL_EXPECT]);\n\t\tif (expectedAssertionsNumber !== null && assertionCalls !== expectedAssertionsNumber) throw expectedAssertionsNumberErrorGen();\n\t\tif (isExpectingAssertions === true && assertionCalls === 0) throw isExpectingAssertionsError;\n\t\tif (this.config.expect.requireAssertions && assertionCalls === 0) throw this.assertionsErrors.get(test);\n\t}\n\textendTaskContext(context) {\n\t\t// create error during the test initialization so we have a nice stack trace\n\t\tif (this.config.expect.requireAssertions) this.assertionsErrors.set(context.task, /* @__PURE__ */ new Error(\"expected any number of assertion, but got none\"));\n\t\tlet _expect;\n\t\tObject.defineProperty(context, \"expect\", { get() {\n\t\t\tif (!_expect) _expect = createExpect(context.task);\n\t\t\treturn _expect;\n\t\t} });\n\t\tObject.defineProperty(context, \"_local\", { get() {\n\t\t\treturn _expect != null;\n\t\t} });\n\t\tlet _bench;\n\t\tconst runnerConfig = this.config;\n\t\tconst benchInstances = this.benchInstances;\n\t\tconst moduleRunner = this.moduleRunner;\n\t\tObject.defineProperty(context, \"bench\", { get() {\n\t\t\tif (!_bench) {\n\t\t\t\t_bench = createBench(context.task, runnerConfig, moduleRunner);\n\t\t\t\tbenchInstances.set(context.task, _bench);\n\t\t\t}\n\t\t\treturn _bench;\n\t\t} });\n\t\treturn context;\n\t}\n\tgetImportDurations() {\n\t\tconst { limit } = this.config.experimental.importDurations;\n\t\t// skip sorting if limit is 0\n\t\tif (limit === 0) return {};\n\t\t// Sort by duration descending and keep top entries\n\t\tconst sortedEntries = [...this.workerState.moduleExecutionInfo?.entries() || []].sort(([, a], [, b]) => b.duration - a.duration).slice(0, limit);\n\t\tconst importDurations = {};\n\t\tfor (const [filepath, { duration, selfTime, external, importer }] of sortedEntries) importDurations[normalize(filepath)] = {\n\t\t\tselfTime,\n\t\t\ttotalTime: duration,\n\t\t\texternal,\n\t\t\timporter\n\t\t};\n\t\treturn importDurations;\n\t}\n\tgetModuleFetchDuration() {\n\t\treturn this.workerState.durations.fetch;\n\t}\n\ttrace = (name, attributes, cb) => {\n\t\tconst options = typeof attributes === \"object\" ? { attributes } : {};\n\t\treturn this._otel.$(`vitest.test.runner.${name}`, options, cb || attributes);\n\t};\n\t__setTraces(traces) {\n\t\tthis._otel = traces;\n\t}\n\tstatic createTaskCollector = createTaskCollector;\n\tstatic getCurrentSuite = getCurrentSuite;\n\tstatic getCurrentTest = getCurrentTest;\n\tstatic createChainable = createChainable;\n\tstatic getSuiteHooks = getHooks;\n\tstatic getTestFn = getFn;\n\tstatic setSuiteHooks = getHooks;\n\tstatic setTestFn = getFn;\n\tstatic matchesTags = matchesTags;\n\tstatic createFileTask = createFileTask;\n}\nfunction clearModuleMocks(config) {\n\tconst { clearMocks, mockReset, restoreMocks, unstubEnvs, unstubGlobals } = config;\n\tif (restoreMocks) vi.restoreAllMocks();\n\tif (mockReset) vi.resetAllMocks();\n\tif (clearMocks) vi.clearAllMocks();\n\tif (unstubEnvs) vi.unstubAllEnvs();\n\tif (unstubGlobals) vi.unstubAllGlobals();\n}\n\nconst assertType = function assertType() {};\n\nvar index = /*#__PURE__*/Object.freeze({\n\t__proto__: null,\n\tEvaluatedModules: VitestEvaluatedModules,\n\tSnapshots: Snapshots,\n\tTestRunner: TestRunner,\n\tafterAll: afterAll,\n\tafterEach: afterEach,\n\taroundAll: aroundAll,\n\taroundEach: aroundEach,\n\tassert: assert,\n\tassertType: assertType,\n\tbeforeAll: beforeAll,\n\tbeforeEach: beforeEach,\n\tchai: chai,\n\tcreateExpect: createExpect,\n\tdescribe: describe,\n\texpect: globalExpect,\n\texpectTypeOf: expectTypeOf,\n\tinject: inject,\n\tit: it,\n\tonTestFailed: onTestFailed,\n\tonTestFinished: onTestFinished,\n\trecordArtifact: recordArtifact,\n\tshould: should,\n\tsuite: suite,\n\ttest: test,\n\tvi: vi,\n\tvitest: vitest\n});\n\nexport { Snapshots as S, TestRunner as T, assert as a, assertType as b, createExpect as c, inject as d, vitest as e, globalExpect as g, index as i, should as s, vi as v };\n","export { S as Snapshots, T as TestRunner, a as assert, b as assertType, c as createExpect, g as expect, d as inject, s as should, v as vi, e as vitest } from './chunks/index.DGdajAO2.js';\nexport { V as EvaluatedModules } from './chunks/rpc.CJVl3hZH.js';\nexport { j as afterAll, k as afterEach, l as aroundAll, n as aroundEach, o as beforeAll, q as beforeEach, r as describe, t as it, u as onTestFailed, v as onTestFinished, w as recordArtifact, x as suite, y as test } from './chunks/run.C5UmxDPh.js';\nexport { expectTypeOf } from 'expect-type';\nimport * as chai from 'chai';\nexport { chai };\nimport './chunks/utils.DYj33du9.js';\nimport './chunks/source-map.BH0bbrs9.js';\nimport './chunks/pathe.M-eThtNZ.DwEga6ro.js';\nimport './chunks/spy.KLHgXex_.js';\nimport './chunks/display.pkpxlVcY.js';\nimport './chunks/index.M2dsQ_UQ.js';\nimport './chunks/tinyrainbow.Ht9iggcq.js';\nimport './task-utils.js';\nimport './chunks/plugins.Cigb0uSy.js';\nimport './chunks/offset.Dy-5Fdfn.js';\nimport 'tinybench';\nimport 'vite/module-runner';\nimport './chunks/index.DmDMHCg8.js';\n","import { describe, expect, it } from \"vitest\";\nimport type { AttachmentStorage, StoredAttachment } from \"./attachment-storage\";\n\n/**\n * Проверки договора хранилища файлов. Каждая реализация подключает их в своих тестах:\n * `describeAttachmentStorageContract(() => createMyStorage())`.\n */\nexport function describeAttachmentStorageContract(createStorage: () => AttachmentStorage | Promise<AttachmentStorage>): void {\n  function record(overrides: Partial<StoredAttachment> = {}): StoredAttachment {\n    return {\n      id: crypto.randomUUID(),\n      chatId: \"chat-1\",\n      ownerId: \"anna\",\n      name: \"заметки.txt\",\n      mediaType: \"text/plain\",\n      kind: \"text\",\n      size: 3,\n      createdAt: \"2026-01-01T00:00:00.000Z\",\n      attached: false,\n      extractedText: \"abc\",\n      textTruncated: false,\n      ...overrides,\n    };\n  }\n  const bytes = () => new Uint8Array([1, 2, 3]);\n\n  describe(\"договор хранилища файлов\", () => {\n    it(\"записанное читается: запись и байты как были\", async () => {\n      const storage = await createStorage();\n      const saved = record();\n      await storage.save(saved, bytes());\n      expect(await storage.get(saved.id)).toEqual(saved);\n      expect([...(await storage.readBytes(saved.id))!]).toEqual([1, 2, 3]);\n    });\n\n    it(\"нет такого файла — undefined\", async () => {\n      const storage = await createStorage();\n      const id = crypto.randomUUID();\n      expect(await storage.get(id)).toBeUndefined();\n      expect(await storage.readBytes(id)).toBeUndefined();\n    });\n\n    it(\"после записи изменение исходных байтов и записи хранилище не задевает\", async () => {\n      const storage = await createStorage();\n      const saved = record();\n      const source = bytes();\n      await storage.save(saved, source);\n      source[0] = 99;\n      saved.name = \"испорчено\";\n      expect([...(await storage.readBytes(saved.id))!]).toEqual([1, 2, 3]);\n      expect((await storage.get(saved.id))?.name).toBe(\"заметки.txt\");\n    });\n\n    it(\"markAttached отмечает файл прикреплённым; повторный вызов и неизвестный файл не ошибка\", async () => {\n      const storage = await createStorage();\n      const saved = record();\n      await storage.save(saved, bytes());\n      await storage.markAttached(saved.id);\n      await storage.markAttached(saved.id);\n      expect((await storage.get(saved.id))?.attached).toBe(true);\n      await storage.markAttached(crypto.randomUUID());\n    });\n\n    it(\"remove убирает запись и байты; повторно и для неизвестного — не ошибка\", async () => {\n      const storage = await createStorage();\n      const saved = record();\n      await storage.save(saved, bytes());\n      await storage.remove(saved.id);\n      expect(await storage.get(saved.id)).toBeUndefined();\n      expect(await storage.readBytes(saved.id)).toBeUndefined();\n      await storage.remove(saved.id);\n      await storage.remove(crypto.randomUUID());\n    });\n\n    it(\"removeAllOfChat убирает все файлы этого чата, и прикреплённые тоже; чужие чаты целы; говорит, сколько убрал\", async () => {\n      const storage = await createStorage();\n      const free = record({ chatId: \"chat-1\" });\n      const attached = record({ chatId: \"chat-1\" });\n      const other = record({ chatId: \"chat-2\" });\n      for (const item of [free, attached, other]) await storage.save(item, bytes());\n      await storage.markAttached(attached.id);\n      expect(await storage.removeAllOfChat(\"chat-1\")).toBe(2);\n      for (const item of [free, attached]) {\n        expect(await storage.get(item.id)).toBeUndefined();\n        expect(await storage.readBytes(item.id)).toBeUndefined();\n      }\n      expect(await storage.get(other.id)).toBeDefined();\n      expect([...(await storage.readBytes(other.id))!]).toEqual([1, 2, 3]);\n      expect(await storage.removeAllOfChat(\"chat-1\")).toBe(0);\n      expect(await storage.removeAllOfChat(\"нет-такого\")).toBe(0);\n    });\n\n    it(\"removeUnattachedOlderThan убирает только старые непривязанные и говорит, сколько убрал\", async () => {\n      const storage = await createStorage();\n      const oldFree = record({ createdAt: \"2026-01-01T00:00:00.000Z\" });\n      const oldAttached = record({ createdAt: \"2026-01-01T00:00:00.000Z\" });\n      const freshFree = record({ createdAt: \"2026-03-01T00:00:00.000Z\" });\n      for (const item of [oldFree, oldAttached, freshFree]) await storage.save(item, bytes());\n      await storage.markAttached(oldAttached.id);\n      expect(await storage.removeUnattachedOlderThan(new Date(\"2026-02-01T00:00:00.000Z\"))).toBe(1);\n      expect(await storage.get(oldFree.id)).toBeUndefined();\n      expect(await storage.get(oldAttached.id)).toBeDefined();\n      expect(await storage.get(freshFree.id)).toBeDefined();\n    });\n\n    it(\"unattachedTotals считает только неотправленные файлы этого человека, по всем его чатам\", async () => {\n      const storage = await createStorage();\n      await storage.save(record({ size: 10 }), bytes());\n      await storage.save(record({ size: 5, chatId: \"chat-2\" }), bytes());\n      await storage.save(record({ size: 100, ownerId: \"boris\" }), bytes());\n      const sent = record({ size: 1000 });\n      await storage.save(sent, bytes());\n      await storage.markAttached(sent.id);\n      expect(await storage.unattachedTotals(\"anna\")).toEqual({ files: 2, bytes: 15 });\n      expect(await storage.unattachedTotals(\"boris\")).toEqual({ files: 1, bytes: 100 });\n      expect(await storage.unattachedTotals(\"nobody\")).toEqual({ files: 0, bytes: 0 });\n    });\n\n    it(\"id не в виде UUID: записать нельзя, прочитать нечего, ошибок обращения к файловой системе нет\", async () => {\n      const storage = await createStorage();\n      for (const id of [\"../../etc/passwd\", \"a/b\", \"\", \"..\", \"x\".repeat(300)]) {\n        await expect(storage.save(record({ id }), bytes())).rejects.toThrow();\n        expect(await storage.get(id)).toBeUndefined();\n        expect(await storage.readBytes(id)).toBeUndefined();\n        await storage.remove(id);\n        await storage.markAttached(id);\n      }\n    });\n\n    it(\"картинка без извлечённого текста хранится без этих полей, исходный тип сохраняется\", async () => {\n      const storage = await createStorage();\n      const { extractedText: _text, textTruncated: _truncated, ...image } = record({ kind: \"image\", mediaType: \"image/jpeg\", sourceMediaType: \"image/png\", name: \"a.png\" });\n      await storage.save(image, bytes());\n      expect(await storage.get(image.id)).toEqual(image);\n    });\n  });\n}\n"],"mappings":";;;;;;AAAA;AAAA;AAAA;AACA,WAAO,eAAe,SAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAAA;AAAA;;;ACD5D;AAAA;AAAA;AACA,WAAO,eAAe,SAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAAA;AAAA;;;ACD5D;AAAA;AAAA;AACA,WAAO,eAAe,SAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAAA;AAAA;;;ACD5D;AAAA;AAAA;AACA,WAAO,eAAe,SAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAAA;AAAA;;;ACD5D;AAAA;AAAA;AACA,QAAI,kBAAmB,WAAQ,QAAK,oBAAqB,OAAO,UAAU,SAAS,GAAGA,IAAG,GAAG,IAAI;AAC5F,UAAI,OAAO,OAAW,MAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyBA,IAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAACA,GAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAOA,GAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,MAAM,SAAS,GAAGA,IAAG,GAAG,IAAI;AACxB,UAAI,OAAO,OAAW,MAAK;AAC3B,QAAE,EAAE,IAAIA,GAAE,CAAC;AAAA,IACf;AACA,QAAI,eAAgB,WAAQ,QAAK,gBAAiB,SAASA,IAAGC,UAAS;AACnE,eAAS,KAAKD,GAAG,KAAI,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKC,UAAS,CAAC,EAAG,iBAAgBA,UAASD,IAAG,CAAC;AAAA,IAC5H;AACA,WAAO,eAAe,SAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,YAAQ,eAAe;AACvB,iBAAa,oBAAuB,OAAO;AAC3C,iBAAa,oBAAuB,OAAO;AAC3C,iBAAa,qBAAwB,OAAO;AAC5C,iBAAa,iBAAoB,OAAO;AACxC,QAAME,MAAK,MAAM;AAyBjB,QAAMC,gBAAe,CAAC,YAAY;AAC9B,YAAM,wBAAwB;AAAA,QAC1B;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACJ;AAEA,eAAS,gBAAgB;AACrB,eAAO;AAAA,UACH,SAAS,MAAM;AAAA,UACf,WAAW,MAAM,cAAc;AAAA,UAC/B,eAAeD;AAAA,QACnB;AAAA,MACJ;AACA,YAAM,MAAM;AAAA,QACR,SAASA;AAAA,QACT,aAAaA;AAAA,QACb,WAAWA;AAAA,QACX,cAAcA;AAAA,QACd,YAAYA;AAAA,QACZ,WAAWA;AAAA,QACX,YAAYA;AAAA,QACZ,YAAYA;AAAA,QACZ,aAAaA;AAAA,QACb,UAAUA;AAAA,QACV,YAAYA;AAAA,QACZ,UAAUA;AAAA,QACV,eAAeA;AAAA,QACf,cAAcA;AAAA,QACd,YAAYA;AAAA,QACZ,eAAeA;AAAA,QACf,eAAeA;AAAA,QACf,uBAAuBA;AAAA,QACvB,mBAAmBA;AAAA,QACnB,UAAUA;AAAA,QACV,KAAK,QAAQ;AAAA,QACb,kBAAkB,QAAQ;AAAA,QAC1B,SAAS,QAAQ;AAAA,QACjB,SAAS,QAAQ;AAAA,QACjB,MAAM,QAAQ;AAAA,QACd,MAAM,QAAQ;AAAA,QACd,gBAAgB,QAAQ;AAAA,QACxB,WAAW,QAAQ;AAAA,QACnB,IAAI,UAAU;AACV,iBAAO,cAAc;AAAA,QACzB;AAAA,MACJ;AAEA,YAAM,mBAAmB;AACzB,uBAAiB,QAAQ,CAAC,SAAS,OAAO,eAAe,KAAK,MAAM,EAAE,KAAK,OAAO,GAAG,QAAQ,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC;AACjH,aAAO;AAAA,IACX;AACA,YAAQ,eAAeC;AAAA;AAAA;;;ACxGvB,IAAI,IAAI;AAAA,EACN,OAAO,CAAC,GAAG,CAAC;AAAA,EACZ,MAAM,CAAC,GAAG,IAAI,iBAAiB;AAAA,EAC/B,KAAK,CAAC,GAAG,IAAI,iBAAiB;AAAA,EAC9B,QAAQ,CAAC,GAAG,EAAE;AAAA,EACd,WAAW,CAAC,GAAG,EAAE;AAAA,EACjB,SAAS,CAAC,GAAG,EAAE;AAAA,EACf,QAAQ,CAAC,GAAG,EAAE;AAAA,EACd,eAAe,CAAC,GAAG,EAAE;AAAA,EACrB,OAAO,CAAC,IAAI,EAAE;AAAA,EACd,KAAK,CAAC,IAAI,EAAE;AAAA,EACZ,OAAO,CAAC,IAAI,EAAE;AAAA,EACd,QAAQ,CAAC,IAAI,EAAE;AAAA,EACf,MAAM,CAAC,IAAI,EAAE;AAAA,EACb,SAAS,CAAC,IAAI,EAAE;AAAA,EAChB,MAAM,CAAC,IAAI,EAAE;AAAA,EACb,OAAO,CAAC,IAAI,EAAE;AAAA,EACd,MAAM,CAAC,IAAI,EAAE;AAAA,EACb,SAAS,CAAC,IAAI,EAAE;AAAA,EAChB,OAAO,CAAC,IAAI,EAAE;AAAA,EACd,SAAS,CAAC,IAAI,EAAE;AAAA,EAChB,UAAU,CAAC,IAAI,EAAE;AAAA,EACjB,QAAQ,CAAC,IAAI,EAAE;AAAA,EACf,WAAW,CAAC,IAAI,EAAE;AAAA,EAClB,QAAQ,CAAC,IAAI,EAAE;AAAA,EACf,SAAS,CAAC,IAAI,EAAE;AAAA,EAChB,aAAa,CAAC,IAAI,EAAE;AAAA,EACpB,WAAW,CAAC,IAAI,EAAE;AAAA,EAClB,aAAa,CAAC,IAAI,EAAE;AAAA,EACpB,cAAc,CAAC,IAAI,EAAE;AAAA,EACrB,YAAY,CAAC,IAAI,EAAE;AAAA,EACnB,eAAe,CAAC,IAAI,EAAE;AAAA,EACtB,YAAY,CAAC,IAAI,EAAE;AAAA,EACnB,aAAa,CAAC,IAAI,EAAE;AAAA,EACpB,eAAe,CAAC,KAAK,EAAE;AAAA,EACvB,aAAa,CAAC,KAAK,EAAE;AAAA,EACrB,eAAe,CAAC,KAAK,EAAE;AAAA,EACvB,gBAAgB,CAAC,KAAK,EAAE;AAAA,EACxB,cAAc,CAAC,KAAK,EAAE;AAAA,EACtB,iBAAiB,CAAC,KAAK,EAAE;AAAA,EACzB,cAAc,CAAC,KAAK,EAAE;AAAA,EACtB,eAAe,CAAC,KAAK,EAAE;AACzB;AACA,SAAS,EAAE,GAAG;AACZ,SAAO,OAAO,CAAC;AACjB;AACA,EAAE,OAAO;AACT,EAAE,QAAQ;AAUV,SAAS,IAAI;AACX,MAAI,IAAI,OAAO,WAAW,cAAc,UAAU,QAAQ,KAAK,KAAK,OAAO,SAAS,EAAE,QAAQ,CAAC,GAAGC,KAAI,EAAE,cAAc,SAAS,KAAK,KAAK,OAAO,SAAS,EAAE,SAAS,CAAC;AACrK,SAAO,EAAE,cAAc,KAAK,EAAE,SAAS,YAAY,OAAO,iBAAiB,KAAK,EAAE,SAAS,SAAS,MAAM,KAAK,OAAO,SAAS,EAAE,cAAc,WAAWA,MAAK,EAAE,SAAS,UAAU,QAAQ,MAAM,OAAO,UAAU,eAAe,CAAC,CAAC,OAAO;AAC7O;AACA,SAAS,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,GAAG;AAC5B,MAAI,IAAI,KAAK,EAAE,GAAGA,KAAI,CAACC,IAAG,GAAG,GAAGC,OAAM;AACpC,QAAIC,KAAI,IAAI,IAAI;AAChB;AACE,MAAAA,MAAKF,GAAE,UAAU,GAAGC,EAAC,IAAI,GAAG,IAAIA,KAAI,EAAE,QAAQA,KAAID,GAAE,QAAQ,GAAG,CAAC;AAAA,WAC3D,CAACC;AACR,WAAOC,KAAIF,GAAE,UAAU,CAAC;AAAA,EAC1B,GAAG,IAAI,CAACA,IAAG,GAAG,IAAIA,OAAM;AACtB,QAAIC,KAAI,CAACC,OAAM;AACb,UAAI,IAAI,OAAOA,EAAC,GAAGC,KAAI,EAAE,QAAQ,GAAGH,GAAE,MAAM;AAC5C,aAAO,CAACG,KAAIH,KAAID,GAAE,GAAG,GAAG,GAAGI,EAAC,IAAI,IAAIH,KAAI,IAAI;AAAA,IAC9C;AACA,WAAOC,GAAE,OAAOD,IAAGC,GAAE,QAAQ,GAAGA;AAAA,EAClC,GAAG,IAAI;AAAA,IACL,kBAAkB;AAAA,EACpB,GAAG,IAAI,CAACD,OAAM,QAAQA,EAAC;AACvB,WAASA,MAAK,GAAG;AACf,QAAI,IAAI,EAAEA,EAAC;AACX,MAAEA,EAAC,IAAI,IAAI;AAAA,MACT,EAAE,EAAE,CAAC,CAAC;AAAA,MACN,EAAE,EAAE,CAAC,CAAC;AAAA,MACN,EAAE,CAAC;AAAA,IACL,IAAI;AAAA,EACN;AACA,SAAO;AACT;AACA,IAAI,IAAI,EAAE;AAIV,IAAI,IAAI;;;AC1FR,SAAS,mBAAmBI,IAAGC,IAAG;AACjC,EAAAA,GAAE,QAAQ,SAAS,GAAG;AACrB,SAAK,OAAO,MAAM,YAAY,CAAC,MAAM,QAAQ,CAAC,KAAK,OAAO,KAAK,CAAC,EAAE,QAAQ,SAAS,GAAG;AACrF,UAAI,MAAM,aAAa,EAAE,KAAKD,KAAI;AACjC,YAAIE,KAAI,OAAO,yBAAyB,GAAG,CAAC;AAC5C,eAAO,eAAeF,IAAG,GAAGE,GAAE,MAAMA,KAAI;AAAA,UACvC,YAAY;AAAA,UACZ,KAAK,WAAW;AACf,mBAAO,EAAE,CAAC;AAAA,UACX;AAAA,QACD,CAAC;AAAA,MACF;AAAA,IACD,CAAC;AAAA,EACF,CAAC;AACD,SAAO,OAAO,OAAOF,EAAC;AACvB;AACA,SAAS,8BAA8BG,SAAQ,aAAa;AAC3D,QAAM,UAAU,OAAO,KAAKA,OAAM;AAClC,QAAMC,QAAO,gBAAgB,OAAO,UAAU,QAAQ,KAAK,WAAW;AACtE,MAAI,OAAO,uBAAuB;AACjC,eAAW,UAAU,OAAO,sBAAsBD,OAAM,EAAG,KAAI,OAAO,yBAAyBA,SAAQ,MAAM,EAAE,WAAY,CAAAC,MAAK,KAAK,MAAM;AAAA,EAC5I;AACA,SAAOA;AACR;AAMA,SAAS,qBAAqB,UAAUC,SAAQ,aAAa,OAAO,MAAMC,UAAS,YAAY,MAAM,QAAQ;AAC5G,MAAI,SAAS;AACb,MAAI,QAAQ;AACZ,MAAI,UAAU,SAAS,KAAK;AAC5B,MAAI,CAAC,QAAQ,MAAM;AAClB,cAAUD,QAAO;AACjB,UAAM,kBAAkB,cAAcA,QAAO;AAC7C,WAAO,CAAC,QAAQ,MAAM;AACrB,gBAAU;AACV,UAAI,YAAYA,QAAO,UAAU;AAChC,kBAAU,OAAO,WAAW,WAAW,UAAK,SAAS,QAAQ,CAAC,MAAM;AACpE;AAAA,MACD;AACA,YAAM,OAAOC,SAAQ,QAAQ,MAAM,CAAC,GAAGD,SAAQ,iBAAiB,OAAO,IAAI;AAC3E,YAAM,QAAQC,SAAQ,QAAQ,MAAM,CAAC,GAAGD,SAAQ,iBAAiB,OAAO,IAAI;AAC5E,gBAAU,OAAO,YAAY;AAC7B,gBAAU,SAAS,KAAK;AACxB,UAAI,CAAC,QAAQ,KAAM,WAAU,IAAIA,QAAO,YAAY;AAAA,eAC3C,CAACA,QAAO,IAAK,WAAU;AAAA,IACjC;AACA,cAAUA,QAAO,eAAe;AAAA,EACjC;AACA,SAAO;AACR;AAMA,SAAS,oBAAoB,UAAUA,SAAQ,aAAa,OAAO,MAAMC,UAAS,QAAQ;AACzF,MAAI,SAAS;AACb,MAAI,QAAQ;AACZ,MAAI,UAAU,SAAS,KAAK;AAC5B,MAAI,CAAC,QAAQ,MAAM;AAClB,cAAUD,QAAO;AACjB,UAAM,kBAAkB,cAAcA,QAAO;AAC7C,WAAO,CAAC,QAAQ,MAAM;AACrB,gBAAU;AACV,UAAI,YAAYA,QAAO,UAAU;AAChC,kBAAU,OAAO,WAAW,WAAW,UAAK,SAAS,QAAQ,CAAC,MAAM;AACpE;AAAA,MACD;AACA,gBAAUC,SAAQ,QAAQ,OAAOD,SAAQ,iBAAiB,OAAO,IAAI;AACrE,gBAAU,SAAS,KAAK;AACxB,UAAI,CAAC,QAAQ,KAAM,WAAU,IAAIA,QAAO,YAAY;AAAA,eAC3C,CAACA,QAAO,IAAK,WAAU;AAAA,IACjC;AACA,cAAUA,QAAO,eAAe;AAAA,EACjC;AACA,SAAO;AACR;AAMA,SAAS,eAAe,MAAMA,SAAQ,aAAa,OAAO,MAAMC,UAAS;AACxE,MAAI,SAAS;AACb,SAAO,gBAAgB,cAAc,IAAI,SAAS,IAAI,IAAI;AAC1D,QAAM,aAAa,CAAC,MAAM,aAAa;AACvC,QAAM,SAAS,WAAW,IAAI,IAAI,KAAK,aAAa,KAAK;AACzD,MAAI,SAAS,GAAG;AACf,cAAUD,QAAO;AACjB,UAAM,kBAAkB,cAAcA,QAAO;AAC7C,aAASE,KAAI,GAAGA,KAAI,QAAQA,MAAK;AAChC,gBAAU;AACV,UAAIA,OAAMF,QAAO,UAAU;AAC1B,kBAAU,UAAK,SAASE,EAAC;AACzB;AAAA,MACD;AACA,UAAI,WAAW,IAAI,KAAKA,MAAK,KAAM,WAAUD,SAAQ,WAAW,IAAI,IAAI,KAAK,QAAQC,EAAC,IAAI,KAAKA,EAAC,GAAGF,SAAQ,iBAAiB,OAAO,IAAI;AACvI,UAAIE,KAAI,SAAS,EAAG,WAAU,IAAIF,QAAO,YAAY;AAAA,eAC5C,CAACA,QAAO,IAAK,WAAU;AAAA,IACjC;AACA,cAAUA,QAAO,eAAe;AAAA,EACjC;AACA,SAAO;AACR;AAMA,SAAS,sBAAsB,KAAKA,SAAQ,aAAa,OAAO,MAAMC,UAAS,sBAAsBD,QAAO,aAAa;AACxH,MAAI,SAAS;AACb,QAAMD,QAAO,8BAA8B,KAAK,mBAAmB;AACnE,MAAIA,MAAK,SAAS,GAAG;AACpB,cAAUC,QAAO;AACjB,UAAM,kBAAkB,cAAcA,QAAO;AAC7C,aAASE,KAAI,GAAGA,KAAIH,MAAK,QAAQG,MAAK;AACrC,gBAAU;AACV,UAAIA,OAAMF,QAAO,UAAU;AAC1B,kBAAU,UAAKD,MAAK,SAASG,EAAC;AAC9B;AAAA,MACD;AACA,YAAM,MAAMH,MAAKG,EAAC;AAClB,YAAM,OAAO,CAACF,QAAO,aAAa,gBAAgB,GAAG,IAAI,MAAMC,SAAQ,KAAKD,SAAQ,iBAAiB,OAAO,IAAI;AAChH,YAAM,QAAQC,SAAQ,IAAI,GAAG,GAAGD,SAAQ,iBAAiB,OAAO,IAAI;AACpE,gBAAU,GAAG,IAAI,KAAK,KAAK;AAC3B,UAAIE,KAAIH,MAAK,SAAS,EAAG,WAAU,IAAIC,QAAO,YAAY;AAAA,eACjD,CAACA,QAAO,IAAK,WAAU;AAAA,IACjC;AACA,cAAUA,QAAO,eAAe;AAAA,EACjC;AACA,SAAO;AACR;AAGA,IAAM,eAAe;AACrB,SAAS,gBAAgB,KAAK;AAC7B,SAAO,OAAO,QAAQ,YAAY,QAAQ,eAAe,aAAa,KAAK,GAAG;AAC/E;AACA,IAAM,oBAAoB,OAAO,WAAW,cAAc,OAAO,MAAM,uBAAO,IAAI,wBAAwB,IAAI;AAC9G,IAAM,UAAU;AAChB,IAAM,cAAc,CAAC,KAAKA,SAAQ,aAAa,OAAO,MAAMC,aAAY;AACvE,QAAM,gBAAgB,IAAI,SAAS;AACnC,MAAI,kBAAkB,qBAAqB,kBAAkB,sBAAsB;AAClF,QAAI,EAAE,QAAQD,QAAO,SAAU,QAAO,IAAI,aAAa;AACvD,WAAO,GAAG,gBAAgB,OAAO,IAAI,eAAe,IAAI,QAAQA,SAAQ,aAAa,OAAO,MAAMC,QAAO,CAAC;AAAA,EAC3G;AACA,MAAI,kBAAkB,sBAAsB,kBAAkB,uBAAuB;AACpF,QAAI,EAAE,QAAQD,QAAO,SAAU,QAAO,IAAI,aAAa;AACvD,WAAO,GAAG,gBAAgB,OAAO,IAAI,sBAAsB,IAAI,QAAQA,SAAQ,aAAa,OAAO,MAAMC,QAAO,CAAC;AAAA,EAClH;AACA,MAAI,kBAAkB,oBAAoB,kBAAkB,oBAAqB,QAAO,gBAAgB,UAAUA,SAAQ,IAAI,QAAQD,SAAQ,aAAa,OAAO,IAAI;AACtK,MAAI,kBAAkB,sBAAsB,kBAAkB,sBAAuB,QAAO,gBAAgB,UAAUC,SAAQ,IAAI,QAAQD,SAAQ,aAAa,OAAO,IAAI;AAC1K,MAAI,OAAO,IAAI,wBAAwB,WAAY,OAAM,IAAI,UAAU,sBAAsB,IAAI,YAAY,IAAI,2CAA2C;AAC5J,SAAO,IAAI,oBAAoB;AAChC;AACA,IAAM,SAAS,CAAC,QAAQ,OAAO,IAAI,aAAa;AAChD,IAAM,WAAW;AAAA,EAChB,WAAW;AAAA,EACX,MAAM;AACP;AACA,IAAM,UAAU;AAChB,IAAM,eAA+B,oBAAI,IAAI,CAAC,gBAAgB,cAAc,CAAC;AAC7E,IAAM,eAAe;AACrB,SAAS,SAAS,MAAM;AACvB,SAAO,aAAa,IAAI,IAAI,KAAK,aAAa,KAAK,IAAI;AACxD;AACA,IAAM,SAAS,CAAC,QAAQ,OAAO,IAAI,eAAe,CAAC,CAAC,IAAI,YAAY,QAAQ,SAAS,IAAI,YAAY,IAAI;AACzG,SAAS,eAAe,YAAY;AACnC,SAAO,WAAW,YAAY,SAAS;AACxC;AACA,IAAM,cAAc,CAAC,YAAYA,SAAQ,aAAa,OAAO,MAAMC,aAAY;AAC9E,QAAM,OAAO,WAAW,YAAY;AACpC,MAAI,EAAE,QAAQD,QAAO,SAAU,QAAO,IAAI,IAAI;AAC9C,UAAQA,QAAO,MAAM,KAAK,OAAO,YAAY,aAAa,IAAI,IAAI,IAAI,IAAI,sBAAsB,eAAe,UAAU,IAAI,CAAC,GAAG,UAAU,EAAE,OAAO,CAAC,OAAO,cAAc;AACzK,UAAM,UAAU,IAAI,IAAI,UAAU;AAClC,WAAO;AAAA,EACR,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,WAAW,GAAGA,SAAQ,aAAa,OAAO,MAAMC,QAAO,CAAC,MAAM,IAAI,eAAe,CAAC,GAAG,UAAU,GAAGD,SAAQ,aAAa,OAAO,MAAMC,QAAO,CAAC;AAC3J;AACA,IAAM,WAAW;AAAA,EAChB,WAAW;AAAA,EACX,MAAM;AACP;AAOA,SAAS,WAAW,KAAK;AACxB,SAAO,IAAI,WAAW,KAAK,MAAM,EAAE,WAAW,KAAK,MAAM;AAC1D;AAEA,SAAS,WAAWF,OAAM,OAAOC,SAAQ,aAAa,OAAO,MAAMC,UAAS;AAC3E,QAAM,kBAAkB,cAAcD,QAAO;AAC7C,QAAM,SAASA,QAAO;AACtB,SAAOD,MAAK,IAAI,CAAC,QAAQ;AACxB,UAAM,QAAQ,MAAM,GAAG;AAEvB,QAAI,OAAO,UAAU,YAAY,MAAM,CAAC,MAAM,OAAO,MAAM,WAAW,WAAW,KAAK,iBAAiB,KAAK,KAAK,EAAG,QAAO;AAC3H,QAAI,UAAUE,SAAQ,OAAOD,SAAQ,iBAAiB,OAAO,IAAI;AACjE,QAAI,OAAO,UAAU,UAAU;AAC9B,UAAI,QAAQ,SAAS,IAAI,EAAG,WAAUA,QAAO,eAAe,kBAAkB,UAAUA,QAAO,eAAe;AAC9G,gBAAU,IAAI,OAAO;AAAA,IACtB;AACA,WAAO,GAAGA,QAAO,eAAe,cAAc,OAAO,KAAK,OAAO,MAAM,OAAO,KAAK,KAAK,IAAI,OAAO,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,MAAM,KAAK;AAAA,EAC7I,CAAC,EAAE,KAAK,EAAE;AACX;AAEA,SAAS,cAAc,UAAUA,SAAQ,aAAa,OAAO,MAAMC,UAAS;AAC3E,SAAO,SAAS,IAAI,CAAC,UAAUD,QAAO,eAAe,eAAe,OAAO,UAAU,WAAW,UAAU,OAAOA,OAAM,IAAIC,SAAQ,OAAOD,SAAQ,aAAa,OAAO,IAAI,EAAE,EAAE,KAAK,EAAE;AACtL;AACA,SAAS,gBAAgB,UAAUA,SAAQ,aAAa,OAAO,MAAMC,UAAS;AAC7E,MAAID,QAAO,oBAAoB,MAAO,QAAO;AAC7C,SAAO,CAAC,GAAGA,QAAO,eAAe,WAAW,gBAAgB,cAAc,UAAUA,SAAQ,cAAcA,QAAO,QAAQ,OAAO,MAAMC,QAAO,CAAC,EAAE,KAAK,EAAE;AACxJ;AACA,SAAS,UAAU,MAAMD,SAAQ;AAChC,QAAM,eAAeA,QAAO,OAAO;AACnC,SAAO,aAAa,OAAO,WAAW,IAAI,IAAI,aAAa;AAC5D;AACA,SAAS,aAAa,SAASA,SAAQ;AACtC,QAAM,eAAeA,QAAO,OAAO;AACnC,SAAO,GAAG,aAAa,IAAI,OAAO,WAAW,OAAO,CAAC,MAAM,aAAa,KAAK;AAC9E;AAKA,SAAS,aAAaG,OAAM,cAAc,iBAAiBH,SAAQ,aAAa;AAC/E,QAAM,WAAWA,QAAO,OAAO;AAC/B,SAAO,GAAG,SAAS,IAAI,IAAIG,KAAI,GAAG,gBAAgB,SAAS,QAAQ,eAAeH,QAAO,eAAe,cAAc,SAAS,IAAI,GAAG,kBAAkB,IAAI,SAAS,KAAK,GAAG,eAAe,GAAGA,QAAO,YAAY,GAAG,WAAW,GAAG,SAAS,IAAI,KAAKG,KAAI,KAAK,GAAG,gBAAgB,CAACH,QAAO,MAAM,KAAK,GAAG,GAAG,IAAI,SAAS,KAAK;AAC7T;AACA,SAAS,mBAAmBG,OAAMH,SAAQ;AACzC,QAAM,WAAWA,QAAO,OAAO;AAC/B,SAAO,GAAG,SAAS,IAAI,IAAIG,KAAI,GAAG,SAAS,KAAK,UAAK,SAAS,IAAI,MAAM,SAAS,KAAK;AACvF;AACA,IAAM,eAAe;AACrB,IAAM,YAAY;AAClB,IAAM,eAAe;AACrB,IAAM,gBAAgB;AACtB,IAAM,iBAAiB;AACvB,SAAS,iBAAiB,KAAK;AAC9B,MAAI;AACH,WAAO,OAAO,IAAI,iBAAiB,cAAc,IAAI,aAAa,IAAI;AAAA,EACvE,QAAQ;AACP,WAAO;AAAA,EACR;AACD;AACA,SAAS,SAAS,KAAK;AACtB,QAAM,kBAAkB,IAAI,YAAY;AACxC,QAAM,EAAE,UAAU,QAAQ,IAAI;AAC9B,QAAM,kBAAkB,OAAO,YAAY,YAAY,QAAQ,SAAS,GAAG,KAAK,iBAAiB,GAAG;AACpG,SAAO,aAAa,iBAAiB,eAAe,KAAK,eAAe,KAAK,oBAAoB,aAAa,aAAa,oBAAoB,UAAU,aAAa,gBAAgB,oBAAoB,aAAa,aAAa,iBAAiB,oBAAoB;AAC1Q;AACA,IAAM,SAAS,CAAC,QAAQ,KAAK,aAAa,QAAQ,SAAS,GAAG;AAC9D,SAAS,WAAW,MAAM;AACzB,SAAO,KAAK,aAAa;AAC1B;AACA,SAAS,cAAc,MAAM;AAC5B,SAAO,KAAK,aAAa;AAC1B;AACA,SAAS,eAAe,MAAM;AAC7B,SAAO,KAAK,aAAa;AAC1B;AACA,SAAS,eAAe,UAAU,YAAY;AAG7C,MAAI,WAAW,SAAS,OAAO,CAAC,SAAS;AAExC,QAAI,KAAK,aAAa;AAEtB,cAAQ,KAAK,QAAQ,IAAI,KAAK,EAAE,SAAS;AACzC,WAAO;AAAA,EACR,CAAC;AAED,MAAI,WAAY,YAAW,SAAS,OAAO,UAAU;AACrD,SAAO;AACR;AACA,SAAS,aAAa,MAAMH,SAAQ,aAAa,OAAO,MAAMC,UAAS,YAAY;AAClF,MAAI,WAAW,IAAI,EAAG,QAAO,UAAU,KAAK,MAAMD,OAAM;AACxD,MAAI,cAAc,IAAI,EAAG,QAAO,aAAa,KAAK,MAAMA,OAAM;AAC9D,QAAMG,QAAO,eAAe,IAAI,IAAI,qBAAqB,KAAK,QAAQ,YAAY;AAClF,MAAI,EAAE,QAAQH,QAAO,SAAU,QAAO,mBAAmBG,OAAMH,OAAM;AACrE,QAAM,WAAW,MAAM,UAAU,MAAM,KAAK,KAAK,cAAc,KAAK,QAAQ;AAC5E,QAAM,iBAAiB,eAAe,IAAI,KAAK,CAAC,KAAK,aAAa,CAAC,IAAI,MAAM,UAAU,MAAM,KAAK,KAAK,WAAW,QAAQ;AAC1H,QAAM,mBAAmB,aAAa,eAAe,UAAU,UAAU,IAAI;AAC7E,QAAM,yBAAyB,aAAa,eAAe,gBAAgB,UAAU,IAAI;AACzF,SAAO,aAAaG,OAAM,WAAW,eAAe,IAAI,IAAI,CAAC,IAAI,MAAM,KAAK,KAAK,YAAY,CAAC,SAAS,KAAK,IAAI,EAAE,KAAK,GAAG,eAAe,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,UAAU,EAAE,OAAO,CAAC,OAAO,cAAc;AACvM,UAAM,UAAU,IAAI,IAAI,UAAU;AAClC,WAAO;AAAA,EACR,GAAG,CAAC,CAAC,GAAGH,SAAQ,cAAcA,QAAO,QAAQ,OAAO,MAAMC,QAAO,IAAI,uBAAuB,SAAS,IAAI,gBAAgB,wBAAwBD,SAAQ,cAAcA,QAAO,QAAQ,OAAO,MAAMC,QAAO,IAAI,MAAM,cAAc,kBAAkBD,SAAQ,cAAcA,QAAO,QAAQ,OAAO,MAAMC,QAAO,GAAGD,SAAQ,WAAW;AACpU;AACA,IAAM,cAAc,CAAC,MAAMA,SAAQ,aAAa,OAAO,MAAMC,aAAY,aAAa,MAAMD,SAAQ,aAAa,OAAO,MAAMC,QAAO;AACrI,SAAS,uBAAuB,YAAY;AAC3C,SAAO;AAAA,IACN,MAAM;AAAA,IACN,WAAW,CAAC,MAAMD,SAAQ,aAAa,OAAO,MAAMC,aAAY,aAAa,MAAMD,SAAQ,aAAa,OAAO,MAAMC,UAAS,UAAU;AAAA,EACzI;AACD;AACA,IAAM,WAAW;AAAA,EAChB,WAAW;AAAA,EACX,MAAM;AACP;AAEA,IAAM,uBAAuB;AAC7B,IAAM,mBAAmB;AACzB,IAAM,oBAAoB;AAC1B,IAAM,kBAAkB;AACxB,IAAM,sBAAsB;AAC5B,IAAM,qBAAqB;AAC3B,IAAM,kBAAkB;AACxB,IAAM,kBAAkB;AACxB,IAAM,oBAAoB;AAC1B,IAAM,mBAAmB,CAAC,SAAS,aAAa,IAAI;AACpD,IAAM,cAAc,CAAC,SAAS,IAAI,IAAI;AACtC,IAAM,QAAQ;AACd,IAAM,OAAO;AACb,SAAS,sBAAsB,KAAKD,SAAQ,aAAa,OAAO,MAAMC,UAASE,OAAM;AACpF,SAAO,EAAE,QAAQH,QAAO,WAAW,YAAY,iBAAiBG,KAAI,CAAC,IAAI,GAAG,iBAAiBA,KAAI,IAAI,KAAK,IAAI,qBAAqB,IAAI,QAAQ,GAAGH,SAAQ,aAAa,OAAO,MAAMC,QAAO,CAAC;AAC7L;AAGA,SAAS,iBAAiB,KAAK;AAC9B,MAAIC,KAAI;AACR,SAAO,EAAE,OAAO;AACf,QAAIA,KAAI,IAAI,MAAM,QAAQ;AACzB,YAAM,MAAM,IAAI,MAAMA,IAAG;AACzB,aAAO;AAAA,QACN,MAAM;AAAA,QACN,OAAO,CAAC,KAAK,IAAI,IAAI,GAAG,CAAC;AAAA,MAC1B;AAAA,IACD;AACA,WAAO;AAAA,MACN,MAAM;AAAA,MACN,OAAO;AAAA,IACR;AAAA,EACD,EAAE;AACH;AACA,SAAS,qBAAqB,KAAKF,SAAQ,aAAa,OAAO,MAAMC,UAAS;AAG7E,QAAM,OAAO,iBAAiB,IAAI,SAAS,QAAQ;AACnD,SAAO,EAAE,QAAQD,QAAO,WAAW,YAAY,IAAI,IAAI,GAAG,OAAO,KAAK,IAAI,qBAAqB,iBAAiB,GAAG,GAAGA,SAAQ,aAAa,OAAO,MAAMC,QAAO,CAAC;AACjK;AACA,SAAS,kBAAkB,KAAKD,SAAQ,aAAa,OAAO,MAAMC,UAAS;AAC1E,QAAM,OAAO,iBAAiB,KAAK;AACnC,MAAI,EAAE,QAAQD,QAAO,SAAU,QAAO,YAAY,IAAI;AACtD,MAAI,IAAI,iBAAiB,EAAG,QAAO,GAAG,OAAO,KAAK;AAAA,EAElD,IAAI,SAAS,IAAI,UAAU,qBAAqB,IAAI,QAAQ,GAAGA,SAAQ,aAAa,OAAO,MAAMC,QAAO,IAAI,IAAI;AAChH,SAAO,GAAG,OAAO,KAAK,IAAI,IAAI,SAAS,IAAI,UAAU,IAAI,eAAe,IAAI,YAAY,oBAAoB,IAAI,OAAO,GAAGD,SAAQ,aAAa,OAAO,MAAMC,QAAO,IAAI,IAAI;AAC5K;AACA,SAAS,qBAAqB,KAAKD,SAAQ,aAAa,OAAO,MAAMC,UAASE,OAAM;AACnF,SAAO,EAAE,QAAQH,QAAO,WAAW,YAAY,iBAAiBG,KAAI,CAAC,IAAI,GAAG,iBAAiBA,KAAI,IAAI,KAAK,IAAI,oBAAoB,IAAI,OAAO,GAAGH,SAAQ,aAAa,OAAO,MAAMC,QAAO,CAAC;AAC3L;AACA,IAAM,cAAc,CAAC,KAAKD,SAAQ,aAAa,OAAO,MAAMC,aAAY;AACvE,MAAI,IAAI,eAAe,EAAG,QAAO,sBAAsB,KAAKD,SAAQ,aAAa,OAAO,MAAMC,UAAS,IAAI,mBAAmB,IAAI,eAAe,KAAK;AACtJ,MAAI,IAAI,gBAAgB,EAAG,QAAO,qBAAqB,KAAKD,SAAQ,aAAa,OAAO,MAAMC,UAAS,MAAM;AAC7G,MAAI,IAAI,eAAe,EAAG,QAAO,qBAAqB,KAAKD,SAAQ,aAAa,OAAO,MAAMC,UAAS,IAAI,mBAAmB,IAAI,eAAe,KAAK;AACrJ,MAAI,IAAI,iBAAiB,EAAG,QAAO,qBAAqB,KAAKD,SAAQ,aAAa,OAAO,MAAMC,UAAS,OAAO;AAC/G,MAAI,IAAI,eAAe,EAAG,QAAO,kBAAkB,KAAKD,SAAQ,aAAa,OAAO,MAAMC,QAAO;AAEjG,SAAO,qBAAqB,KAAKD,SAAQ,aAAa,OAAO,MAAMC,QAAO;AAC3E;AAGA,IAAM,SAAS,CAAC,QAAQ,QAAQ,IAAI,oBAAoB,MAAM,QAAQ,IAAI,kBAAkB,MAAM;AAClG,IAAM,WAAW;AAAA,EAChB,WAAW;AAAA,EACX,MAAM;AACP;AACA,SAAS,wBAAwB,GAAG;AACnC,SAAO,KAAK,EAAE,cAAc,OAAO,UAAU,eAAe,KAAK,GAAG,SAAS,IAAI,EAAE,SAAS,IAAI;AACjG;AACA,IAAI,YAAY,EAAE,SAAS,CAAC,EAAE;AAC9B,IAAI,qBAAqB,CAAC;AAU1B,IAAI;AACJ,SAAS,4BAA4B;AACpC,MAAI,8BAA+B,QAAO;AAC1C,kCAAgC;AAChC,MAAI,qBAAqB,uBAAO,IAAI,4BAA4B,GAAG,oBAAoB,uBAAO,IAAI,cAAc,GAAG,sBAAsB,uBAAO,IAAI,gBAAgB,GAAG,yBAAyB,uBAAO,IAAI,mBAAmB,GAAG,sBAAsB,uBAAO,IAAI,gBAAgB,GAAG,sBAAsB,uBAAO,IAAI,gBAAgB,GAAG,qBAAqB,uBAAO,IAAI,eAAe,GAAG,yBAAyB,uBAAO,IAAI,mBAAmB,GAAG,sBAAsB,uBAAO,IAAI,gBAAgB,GAAG,2BAA2B,uBAAO,IAAI,qBAAqB,GAAG,kBAAkB,uBAAO,IAAI,YAAY,GAAG,kBAAkB,uBAAO,IAAI,YAAY,GAAG,6BAA6B,uBAAO,IAAI,uBAAuB,GAAG,yBAAyB,uBAAO,IAAI,wBAAwB;AAC7vB,WAASG,QAAON,SAAQ;AACvB,QAAI,aAAa,OAAOA,WAAU,SAASA,SAAQ;AAClD,UAAI,WAAWA,QAAO;AACtB,cAAQ,UAAU;AAAA,QACjB,KAAK;AAAoB,kBAAQA,UAASA,QAAO,MAAMA,SAAQ;AAAA,YAC9D,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAA4B,qBAAOA;AAAA,YACxC;AAAS,sBAAQA,UAASA,WAAUA,QAAO,UAAUA,SAAQ;AAAA,gBAC5D,KAAK;AAAA,gBACL,KAAK;AAAA,gBACL,KAAK;AAAA,gBACL,KAAK;AAAiB,yBAAOA;AAAA,gBAC7B,KAAK;AAAqB,yBAAOA;AAAA,gBACjC;AAAS,yBAAO;AAAA,cACjB;AAAA,UACD;AAAA,QACA,KAAK;AAAmB,iBAAO;AAAA,MAChC;AAAA,IACD;AAAA,EACD;AACA,qBAAmB,kBAAkB;AACrC,qBAAmB,kBAAkB;AACrC,qBAAmB,UAAU;AAC7B,qBAAmB,aAAa;AAChC,qBAAmB,WAAW;AAC9B,qBAAmB,OAAO;AAC1B,qBAAmB,OAAO;AAC1B,qBAAmB,SAAS;AAC5B,qBAAmB,WAAW;AAC9B,qBAAmB,aAAa;AAChC,qBAAmB,WAAW;AAC9B,qBAAmB,eAAe;AAClC,qBAAmB,oBAAoB,SAASA,SAAQ;AACvD,WAAOM,QAAON,OAAM,MAAM;AAAA,EAC3B;AACA,qBAAmB,oBAAoB,SAASA,SAAQ;AACvD,WAAOM,QAAON,OAAM,MAAM;AAAA,EAC3B;AACA,qBAAmB,YAAY,SAASA,SAAQ;AAC/C,WAAO,aAAa,OAAOA,WAAU,SAASA,WAAUA,QAAO,aAAa;AAAA,EAC7E;AACA,qBAAmB,eAAe,SAASA,SAAQ;AAClD,WAAOM,QAAON,OAAM,MAAM;AAAA,EAC3B;AACA,qBAAmB,aAAa,SAASA,SAAQ;AAChD,WAAOM,QAAON,OAAM,MAAM;AAAA,EAC3B;AACA,qBAAmB,SAAS,SAASA,SAAQ;AAC5C,WAAOM,QAAON,OAAM,MAAM;AAAA,EAC3B;AACA,qBAAmB,SAAS,SAASA,SAAQ;AAC5C,WAAOM,QAAON,OAAM,MAAM;AAAA,EAC3B;AACA,qBAAmB,WAAW,SAASA,SAAQ;AAC9C,WAAOM,QAAON,OAAM,MAAM;AAAA,EAC3B;AACA,qBAAmB,aAAa,SAASA,SAAQ;AAChD,WAAOM,QAAON,OAAM,MAAM;AAAA,EAC3B;AACA,qBAAmB,eAAe,SAASA,SAAQ;AAClD,WAAOM,QAAON,OAAM,MAAM;AAAA,EAC3B;AACA,qBAAmB,aAAa,SAASA,SAAQ;AAChD,WAAOM,QAAON,OAAM,MAAM;AAAA,EAC3B;AACA,qBAAmB,iBAAiB,SAASA,SAAQ;AACpD,WAAOM,QAAON,OAAM,MAAM;AAAA,EAC3B;AACA,qBAAmB,qBAAqB,SAASK,OAAM;AACtD,WAAO,aAAa,OAAOA,SAAQ,eAAe,OAAOA,SAAQA,UAAS,uBAAuBA,UAAS,uBAAuBA,UAAS,0BAA0BA,UAAS,uBAAuBA,UAAS,4BAA4B,aAAa,OAAOA,SAAQ,SAASA,UAASA,MAAK,aAAa,mBAAmBA,MAAK,aAAa,mBAAmBA,MAAK,aAAa,sBAAsBA,MAAK,aAAa,uBAAuBA,MAAK,aAAa,0BAA0BA,MAAK,aAAa,0BAA0B,WAAWA,MAAK,eAAe,OAAO;AAAA,EACjjB;AACA,qBAAmB,SAASC;AAC5B,SAAO;AACR;AACA,IAAI;AACJ,SAAS,mBAAmB;AAC3B,MAAI,qBAAsB,QAAO,UAAU;AAC3C,yBAAuB;AACvB,YAAU,UAAU,0BAA0B;AAC9C,SAAO,UAAU;AAClB;AACA,IAAI,mBAAmB,iBAAiB;AACxC,IAAI,YAA0B,mCAAmB;AAAA,EAChD,WAAW;AAAA,EACX,SAAyB,wCAAwB,gBAAgB;AAClE,GAAG,CAAC,gBAAgB,CAAC;AACrB,IAAI,UAAU,EAAE,SAAS,CAAC,EAAE;AAC5B,IAAI,yBAAyB,CAAC;AAU9B,IAAI;AACJ,SAAS,gCAAgC;AACxC,MAAI,kCAAmC,QAAO;AAC9C,sCAAoC;AACpC,MAAIC,KAAI,uBAAO,IAAI,eAAe,GAAG,IAAI,uBAAO,IAAI,cAAc,GAAGR,KAAI,uBAAO,IAAI,gBAAgB,GAAG,IAAI,uBAAO,IAAI,mBAAmB,GAAG,IAAI,uBAAO,IAAI,gBAAgB,GAAGS,KAAI,uBAAO,IAAI,gBAAgB,GAAGC,KAAI,uBAAO,IAAI,eAAe,GAAG,IAAI,uBAAO,IAAI,sBAAsB,GAAG,IAAI,uBAAO,IAAI,mBAAmB,GAAGX,KAAI,uBAAO,IAAI,gBAAgB,GAAGD,KAAI,uBAAO,IAAI,qBAAqB,GAAG,IAAI,uBAAO,IAAI,YAAY,GAAG,IAAI,uBAAO,IAAI,YAAY,GAAGa,KAAI,uBAAO,IAAI,iBAAiB,GAAG,IAAI,uBAAO,IAAI,wBAAwB;AAC7gB,WAASC,GAAEC,IAAG;AACb,QAAI,aAAa,OAAOA,MAAK,SAASA,IAAG;AACxC,UAAI,IAAIA,GAAE;AACV,cAAQ,GAAG;AAAA,QACV,KAAKL;AAAG,kBAAQK,KAAIA,GAAE,MAAMA,IAAG;AAAA,YAC9B,KAAKb;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAKD;AAAA,YACL,KAAKD;AAAG,qBAAOe;AAAA,YACf;AAAS,sBAAQA,KAAIA,MAAKA,GAAE,UAAUA,IAAG;AAAA,gBACxC,KAAK;AAAA,gBACL,KAAKH;AAAA,gBACL,KAAK;AAAA,gBACL,KAAK;AAAA,gBACL,KAAK;AAAA,gBACL,KAAKD;AAAG,yBAAOI;AAAA,gBACf;AAAS,yBAAO;AAAA,cACjB;AAAA,UACD;AAAA,QACA,KAAK;AAAG,iBAAO;AAAA,MAChB;AAAA,IACD;AAAA,EACD;AACA,yBAAuB,kBAAkBH;AACzC,yBAAuB,kBAAkBD;AACzC,yBAAuB,UAAUD;AACjC,yBAAuB,aAAa;AACpC,yBAAuB,WAAWR;AAClC,yBAAuB,OAAO;AAC9B,yBAAuB,OAAO;AAC9B,yBAAuB,SAAS;AAChC,yBAAuB,WAAW;AAClC,yBAAuB,aAAa;AACpC,yBAAuB,WAAWD;AAClC,yBAAuB,eAAeD;AACtC,yBAAuB,cAAc,WAAW;AAC/C,WAAO;AAAA,EACR;AACA,yBAAuB,mBAAmB,WAAW;AACpD,WAAO;AAAA,EACR;AACA,yBAAuB,oBAAoB,SAASe,IAAG;AACtD,WAAOD,GAAEC,EAAC,MAAMH;AAAA,EACjB;AACA,yBAAuB,oBAAoB,SAASG,IAAG;AACtD,WAAOD,GAAEC,EAAC,MAAMJ;AAAA,EACjB;AACA,yBAAuB,YAAY,SAASI,IAAG;AAC9C,WAAO,aAAa,OAAOA,MAAK,SAASA,MAAKA,GAAE,aAAaL;AAAA,EAC9D;AACA,yBAAuB,eAAe,SAASK,IAAG;AACjD,WAAOD,GAAEC,EAAC,MAAM;AAAA,EACjB;AACA,yBAAuB,aAAa,SAASA,IAAG;AAC/C,WAAOD,GAAEC,EAAC,MAAMb;AAAA,EACjB;AACA,yBAAuB,SAAS,SAASa,IAAG;AAC3C,WAAOD,GAAEC,EAAC,MAAM;AAAA,EACjB;AACA,yBAAuB,SAAS,SAASA,IAAG;AAC3C,WAAOD,GAAEC,EAAC,MAAM;AAAA,EACjB;AACA,yBAAuB,WAAW,SAASA,IAAG;AAC7C,WAAOD,GAAEC,EAAC,MAAM;AAAA,EACjB;AACA,yBAAuB,aAAa,SAASA,IAAG;AAC/C,WAAOD,GAAEC,EAAC,MAAM;AAAA,EACjB;AACA,yBAAuB,eAAe,SAASA,IAAG;AACjD,WAAOD,GAAEC,EAAC,MAAM;AAAA,EACjB;AACA,yBAAuB,aAAa,SAASA,IAAG;AAC/C,WAAOD,GAAEC,EAAC,MAAMd;AAAA,EACjB;AACA,yBAAuB,iBAAiB,SAASc,IAAG;AACnD,WAAOD,GAAEC,EAAC,MAAMf;AAAA,EACjB;AACA,yBAAuB,qBAAqB,SAASe,IAAG;AACvD,WAAO,aAAa,OAAOA,MAAK,eAAe,OAAOA,MAAKA,OAAMb,MAAKa,OAAM,KAAKA,OAAM,KAAKA,OAAMd,MAAKc,OAAMf,MAAKe,OAAMF,MAAK,aAAa,OAAOE,MAAK,SAASA,OAAMA,GAAE,aAAa,KAAKA,GAAE,aAAa,KAAKA,GAAE,aAAaJ,MAAKI,GAAE,aAAaH,MAAKG,GAAE,aAAa,KAAKA,GAAE,aAAa,KAAK,WAAWA,GAAE,eAAe,OAAO;AAAA,EACjU;AACA,yBAAuB,SAASD;AAChC,SAAO;AACR;AACA,IAAI;AACJ,SAAS,iBAAiB;AACzB,MAAI,mBAAoB,QAAO,QAAQ;AACvC,uBAAqB;AACrB,UAAQ,UAAU,8BAA8B;AAChD,SAAO,QAAQ;AAChB;AACA,IAAI,iBAAiB,eAAe;AACpC,IAAI,YAA0B,mCAAmB;AAAA,EAChD,WAAW;AAAA,EACX,SAAyB,wCAAwB,cAAc;AAChE,GAAG,CAAC,cAAc,CAAC;AACnB,IAAM,UAAU,OAAO,YAAY;AAAA,EAClC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD,EAAE,IAAI,CAACb,OAAM,CAACA,IAAG,CAACa,OAAM,UAAUb,EAAC,EAAEa,EAAC,KAAK,UAAUb,EAAC,EAAEa,EAAC,CAAC,CAAC,CAAC;AAG5D,SAAS,YAAY,KAAK,WAAW,CAAC,GAAG;AACxC,MAAI,MAAM,QAAQ,GAAG,EAAG,YAAW,QAAQ,IAAK,aAAY,MAAM,QAAQ;AAAA,WACjE,OAAO,QAAQ,QAAQ,SAAS,QAAQ,GAAI,UAAS,KAAK,GAAG;AACtE,SAAO;AACR;AACA,SAAS,QAAQ,SAAS;AACzB,QAAMN,QAAO,QAAQ;AACrB,MAAI,OAAOA,UAAS,SAAU,QAAOA;AACrC,MAAI,OAAOA,UAAS,WAAY,QAAOA,MAAK,eAAeA,MAAK,QAAQ;AACxE,MAAI,QAAQ,WAAW,OAAO,EAAG,QAAO;AACxC,MAAI,QAAQ,WAAW,OAAO,EAAG,QAAO;AACxC,MAAI,OAAOA,UAAS,YAAYA,UAAS,MAAM;AAC9C,QAAI,QAAQ,kBAAkB,OAAO,EAAG,QAAO;AAC/C,QAAI,QAAQ,kBAAkB,OAAO,EAAG,QAAO;AAC/C,QAAI,QAAQ,aAAa,OAAO,GAAG;AAClC,UAAIA,MAAK,YAAa,QAAOA,MAAK;AAClC,YAAMQ,gBAAeR,MAAK,OAAO,eAAeA,MAAK,OAAO,QAAQ;AACpE,aAAOQ,kBAAiB,KAAK,eAAe,cAAcA,aAAY;AAAA,IACvE;AACA,QAAI,QAAQ,OAAO,OAAO,GAAG;AAC5B,YAAMA,gBAAeR,MAAK,eAAeA,MAAK,KAAK,eAAeA,MAAK,KAAK,QAAQ;AACpF,aAAOQ,kBAAiB,KAAK,SAAS,QAAQA,aAAY;AAAA,IAC3D;AAAA,EACD;AACA,SAAO;AACR;AACA,SAAS,cAAc,SAAS;AAC/B,QAAM,EAAE,MAAM,IAAI;AAClB,SAAO,OAAO,KAAK,KAAK,EAAE,OAAO,CAAC,QAAQ,QAAQ,cAAc,MAAM,GAAG,MAAM,MAAM,EAAE,KAAK;AAC7F;AACA,IAAM,cAAc,CAAC,SAASX,SAAQ,aAAa,OAAO,MAAMC,aAAY,EAAE,QAAQD,QAAO,WAAW,mBAAmB,QAAQ,OAAO,GAAGA,OAAM,IAAI,aAAa,QAAQ,OAAO,GAAG,WAAW,cAAc,OAAO,GAAG,QAAQ,OAAOA,SAAQ,cAAcA,QAAO,QAAQ,OAAO,MAAMC,QAAO,GAAG,cAAc,YAAY,QAAQ,MAAM,QAAQ,GAAGD,SAAQ,cAAcA,QAAO,QAAQ,OAAO,MAAMC,QAAO,GAAGD,SAAQ,WAAW;AACta,IAAM,SAAS,CAAC,QAAQ,OAAO,QAAQ,QAAQ,UAAU,GAAG;AAC5D,IAAM,WAAW;AAAA,EAChB,WAAW;AAAA,EACX,MAAM;AACP;AACA,IAAM,aAAa,OAAO,WAAW,cAAc,OAAO,MAAM,uBAAO,IAAI,iBAAiB,IAAI;AAChG,SAAS,YAAYF,SAAQ;AAC5B,QAAM,EAAE,MAAM,IAAIA;AAClB,SAAO,QAAQ,OAAO,KAAK,KAAK,EAAE,OAAO,CAAC,QAAQ,MAAM,GAAG,MAAM,MAAM,EAAE,KAAK,IAAI,CAAC;AACpF;AACA,IAAM,YAAY,CAACA,SAAQE,SAAQ,aAAa,OAAO,MAAMC,aAAY,EAAE,QAAQD,QAAO,WAAW,mBAAmBF,QAAO,MAAME,OAAM,IAAI,aAAaF,QAAO,MAAMA,QAAO,QAAQ,WAAW,YAAYA,OAAM,GAAGA,QAAO,OAAOE,SAAQ,cAAcA,QAAO,QAAQ,OAAO,MAAMC,QAAO,IAAI,IAAIH,QAAO,WAAW,cAAcA,QAAO,UAAUE,SAAQ,cAAcA,QAAO,QAAQ,OAAO,MAAMC,QAAO,IAAI,IAAID,SAAQ,WAAW;AAC5a,IAAM,OAAO,CAAC,QAAQ,OAAO,IAAI,aAAa;AAC9C,IAAM,SAAS;AAAA,EACd;AAAA,EACA;AACD;AACA,IAAM,WAAW,OAAO,UAAU;AAClC,IAAM,cAAc,KAAK,UAAU;AACnC,IAAM,gBAAgB,MAAM,UAAU;AACtC,IAAM,iBAAiB,OAAO,UAAU;AAKxC,SAAS,mBAAmB,KAAK;AAChC,SAAO,OAAO,IAAI,gBAAgB,cAAc,IAAI,YAAY,QAAQ;AACzE;AAEA,SAAS,SAAS,KAAK;AACtB,SAAO,OAAO,WAAW,eAAe,QAAQ;AACjD;AAEA,IAAM,gBAAgB;AACtB,IAAM,iBAAiB;AACvB,IAAM,0BAAN,cAAsC,MAAM;AAAA,EAC3C,YAAY,SAAS,OAAO;AAC3B,UAAM,OAAO;AACb,SAAK,QAAQ;AACb,SAAK,OAAO,KAAK,YAAY;AAAA,EAC9B;AACD;AACA,SAAS,sBAAsB,YAAY;AAC1C,SAAO,eAAe,oBAAoB,eAAe,0BAA0B,eAAe,uBAAuB,eAAe,2BAA2B,eAAe,2BAA2B,eAAe,wBAAwB,eAAe,yBAAyB,eAAe,yBAAyB,eAAe,yBAAyB,eAAe,gCAAgC,eAAe,0BAA0B,eAAe;AACpd;AACA,SAAS,YAAY,KAAK;AACzB,SAAO,OAAO,GAAG,KAAK,EAAE,IAAI,OAAO,OAAO,GAAG;AAC9C;AACA,SAAS,YAAY,KAAK;AACzB,SAAO,OAAO,GAAG,GAAG,GAAG;AACxB;AACA,SAAS,cAAc,KAAKY,oBAAmB;AAC9C,MAAI,CAACA,mBAAmB,QAAO;AAC/B,SAAO,aAAa,IAAI,QAAQ,WAAW;AAC5C;AACA,SAAS,YAAY,KAAK;AACzB,SAAO,OAAO,GAAG,EAAE,QAAQ,eAAe,YAAY;AACvD;AACA,SAAS,WAAW,KAAK;AACxB,SAAO,IAAI,cAAc,KAAK,GAAG,CAAC;AACnC;AAKA,SAAS,gBAAgB,KAAKA,oBAAmBC,cAAa,cAAc,aAAa;AACxF,MAAI,QAAQ,QAAQ,QAAQ,MAAO,QAAO,GAAG,GAAG;AAChD,MAAI,QAAQ,OAAQ,QAAO;AAC3B,MAAI,QAAQ,KAAM,QAAO;AACzB,QAAMT,UAAS,OAAO;AACtB,MAAIA,YAAW,SAAU,QAAO,YAAY,GAAG;AAC/C,MAAIA,YAAW,SAAU,QAAO,YAAY,GAAG;AAC/C,MAAIA,YAAW,UAAU;AACxB,UAAM,IAAI,cAAc,MAAM;AAC9B,QAAI,cAAc;AAIjB,YAAM,gBAAgB,cAAc,WAAW;AAC/C,aAAO,GAAG,CAAC,GAAG,IAAI,WAAW,eAAe,MAAM,CAAC,GAAG,CAAC;AAAA,IACxD;AACA,WAAO,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;AAAA,EACtB;AACA,MAAIA,YAAW,WAAY,QAAO,cAAc,KAAKQ,kBAAiB;AACtE,MAAIR,YAAW,SAAU,QAAO,YAAY,GAAG;AAC/C,QAAM,aAAa,SAAS,KAAK,GAAG;AACpC,MAAI,eAAe,mBAAoB,QAAO;AAC9C,MAAI,eAAe,mBAAoB,QAAO;AAC9C,MAAI,eAAe,uBAAuB,eAAe,6BAA8B,QAAO,cAAc,KAAKQ,kBAAiB;AAClI,MAAI,eAAe,kBAAmB,QAAO,YAAY,GAAG;AAC5D,MAAI,eAAe,gBAAiB,QAAO,OAAO,MAAM,CAAC,GAAG,IAAI,iBAAiB,YAAY,KAAK,GAAG;AACrG,MAAI,eAAe,iBAAkB,QAAO,WAAW,GAAG;AAC1D,MAAI,eAAe,mBAAmB;AACrC,QAAIC;AAEJ,aAAO,eAAe,KAAK,GAAG,EAAE,WAAW,uBAAuB,MAAM;AACxE,WAAO,eAAe,KAAK,GAAG;AAAA,EAC/B;AACA,MAAI,eAAe,MAAO,QAAO,WAAW,GAAG;AAC/C,SAAO;AACR;AAKA,SAAS,kBAAkB,KAAKb,SAAQ,aAAa,OAAO,MAAM,iBAAiB;AAClF,MAAI,KAAK,SAAS,GAAG,EAAG,QAAO;AAC/B,SAAO,CAAC,GAAG,IAAI;AACf,OAAK,KAAK,GAAG;AACb,QAAM,cAAc,EAAE,QAAQA,QAAO;AACrC,QAAM,MAAMA,QAAO;AACnB,MAAIA,QAAO,cAAc,CAAC,eAAe,IAAI,UAAU,OAAO,IAAI,WAAW,cAAc,CAAC,gBAAiB,QAAO,QAAQ,IAAI,OAAO,GAAGA,SAAQ,aAAa,OAAO,MAAM,IAAI;AAChL,QAAM,aAAa,SAAS,KAAK,GAAG;AACpC,MAAI,eAAe,qBAAsB,QAAO,cAAc,gBAAgB,GAAG,MAAM,KAAK,YAAY,IAAI,eAAe,KAAKA,SAAQ,aAAa,OAAO,MAAM,OAAO,CAAC;AAC1K,MAAI,sBAAsB,UAAU,EAAG,QAAO,cAAc,IAAI,IAAI,YAAY,IAAI,MAAM,GAAG,CAACA,QAAO,uBAAuB,IAAI,YAAY,SAAS,UAAU,KAAK,GAAG,IAAI,YAAY,IAAI,GAAG,IAAI,eAAe,KAAKA,SAAQ,aAAa,OAAO,MAAM,OAAO,CAAC;AAChQ,MAAI,eAAe,eAAgB,QAAO,cAAc,UAAU,QAAQ,qBAAqB,IAAI,QAAQ,GAAGA,SAAQ,aAAa,OAAO,MAAM,SAAS,QAAQ,IAAI,IAAI,CAAC;AAC1K,MAAI,eAAe,eAAgB,QAAO,cAAc,UAAU,QAAQ,oBAAoB,IAAI,OAAO,GAAGA,SAAQ,aAAa,OAAO,MAAM,SAAS,IAAI,IAAI,CAAC;AAGhK,SAAO,eAAe,SAAS,GAAG,IAAI,IAAI,mBAAmB,GAAG,CAAC,MAAM,GAAG,CAACA,QAAO,uBAAuB,mBAAmB,GAAG,MAAM,WAAW,KAAK,GAAG,mBAAmB,GAAG,CAAC,GAAG,IAAI,sBAAsB,KAAKA,SAAQ,aAAa,OAAO,MAAM,OAAO,CAAC;AAC5P;AACA,IAAM,cAAc;AAAA,EACnB,MAAM,CAAC,QAAQ,OAAO,eAAe;AAAA,EACrC,UAAU,KAAKA,SAAQ,aAAa,OAAO,MAAMC,UAAS;AACzD,QAAI,KAAK,SAAS,GAAG,EAAG,QAAO;AAC/B,WAAO,CAAC,GAAG,MAAM,GAAG;AACpB,UAAM,cAAc,EAAE,QAAQD,QAAO;AACrC,UAAM,EAAE,SAAS,OAAO,GAAG,KAAK,IAAI;AACpC,UAAM,UAAU;AAAA,MACf;AAAA,MACA,GAAG,OAAO,UAAU,cAAc,EAAE,MAAM,IAAI,CAAC;AAAA,MAC/C,GAAG,eAAe,iBAAiB,EAAE,QAAQ,IAAI,OAAO,IAAI,CAAC;AAAA,MAC7D,GAAG;AAAA,IACJ;AACA,UAAM,OAAO,IAAI,SAAS,UAAU,IAAI,OAAO,mBAAmB,GAAG;AACrE,WAAO,cAAc,IAAI,IAAI,MAAM,GAAG,IAAI,KAAK,sBAAsB,SAASA,SAAQ,aAAa,OAAO,MAAMC,UAAS,IAAI,CAAC;AAAA,EAC/H;AACD;AACA,SAAS,YAAYa,SAAQ;AAC5B,SAAOA,QAAO,aAAa;AAC5B;AACA,SAAS,YAAYA,SAAQ,KAAKd,SAAQ,aAAa,OAAO,MAAM;AACnE,MAAI;AACJ,MAAI;AACH,cAAU,YAAYc,OAAM,IAAIA,QAAO,UAAU,KAAKd,SAAQ,aAAa,OAAO,MAAM,OAAO,IAAIc,QAAO,MAAM,KAAK,CAAC,aAAa,QAAQ,UAAUd,SAAQ,aAAa,OAAO,IAAI,GAAG,CAAC,QAAQ;AAChM,YAAM,kBAAkB,cAAcA,QAAO;AAC7C,aAAO,kBAAkB,IAAI,WAAW,gBAAgB;AAAA,EAAK,eAAe,EAAE;AAAA,IAC/E,GAAG;AAAA,MACF,aAAaA,QAAO;AAAA,MACpB,KAAKA,QAAO;AAAA,MACZ,SAASA,QAAO;AAAA,IACjB,GAAGA,QAAO,MAAM;AAAA,EACjB,SAAS,OAAO;AACf,UAAM,IAAI,wBAAwB,MAAM,SAAS,MAAM,KAAK;AAAA,EAC7D;AACA,MAAI,OAAO,YAAY,SAAU,OAAM,IAAI,UAAU,yEAAyE,OAAO,OAAO,IAAI;AAChJ,SAAO;AACR;AACA,SAAS,WAAWe,UAAS,KAAK;AACjC,aAAWD,WAAUC,SAAS,KAAI;AACjC,QAAID,QAAO,KAAK,GAAG,EAAG,QAAOA;AAAA,EAC9B,SAAS,OAAO;AACf,UAAM,IAAI,wBAAwB,MAAM,SAAS,MAAM,KAAK;AAAA,EAC7D;AACA,SAAO;AACR;AACA,SAAS,QAAQ,KAAKd,SAAQ,aAAa,OAAO,MAAM,iBAAiB;AACxE,MAAI;AACJ,QAAMc,UAAS,WAAWd,QAAO,SAAS,GAAG;AAC7C,MAAIc,YAAW,KAAM,UAAS,YAAYA,SAAQ,KAAKd,SAAQ,aAAa,OAAO,IAAI;AAAA,OAClF;AACJ,UAAM,cAAc,gBAAgB,KAAKA,QAAO,mBAAmBA,QAAO,aAAaA,QAAO,cAAcA,QAAO,WAAW;AAC9H,QAAI,gBAAgB,KAAM,UAAS;AAAA,QAC9B,UAAS,kBAAkB,KAAKA,SAAQ,aAAa,OAAO,MAAM,eAAe;AAAA,EACvF;AAOA,EAAAA,QAAO,sBAAsB,KAAK,MAAM;AACxC,EAAAA,QAAO,sBAAsB,KAAK,KAAK,OAAO;AAC9C,MAAIA,QAAO,sBAAsB,KAAK,IAAIA,QAAO,gBAAiB,CAAAA,QAAO,WAAW;AACpF,SAAO;AACR;AACA,IAAM,gBAAgB;AAAA,EACrB,SAAS;AAAA,EACT,SAAS;AAAA,EACT,MAAM;AAAA,EACN,KAAK;AAAA,EACL,OAAO;AACR;AACA,IAAM,qBAAqB,OAAO,KAAK,aAAa;AACpD,IAAM,kBAAkB;AAAA,EACvB,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,aAAa;AAAA,EACb,cAAc;AAAA,EACd,WAAW;AAAA,EACX,QAAQ;AAAA,EACR,UAAU,OAAO;AAAA;AAAA;AAAA,EAGjB,iBAAiB;AAAA,EACjB,UAAU,OAAO;AAAA,EACjB,KAAK;AAAA,EACL,SAAS,CAAC;AAAA,EACV,qBAAqB;AAAA,EACrB,mBAAmB;AAAA,EACnB,iBAAiB;AAAA,EACjB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,WAAW;AAAA,EACX,cAAc;AAAA,EACd,cAAc;AACf;AACA,SAAS,gBAAgB,SAAS;AACjC,aAAW,OAAO,OAAO,KAAK,OAAO,EAAG,KAAI,CAAC,OAAO,OAAO,iBAAiB,GAAG,EAAG,OAAM,IAAI,MAAM,kCAAkC,GAAG,IAAI;AAC3I,MAAI,QAAQ,OAAO,QAAQ,WAAW,UAAU,QAAQ,WAAW,EAAG,OAAM,IAAI,MAAM,oEAAwE;AAC/J;AACA,SAAS,qBAAqB;AAC7B,SAAO,mBAAmB,OAAO,CAAC,QAAQ,QAAQ;AACjD,UAAM,QAAQ,cAAc,GAAG;AAC/B,UAAM,QAAQ,SAAS,EAAE,KAAK;AAC9B,QAAI,SAAS,OAAO,MAAM,UAAU,YAAY,OAAO,MAAM,SAAS,SAAU,QAAO,GAAG,IAAI;AAAA,QACzF,OAAM,IAAI,MAAM,4CAA4C,GAAG,kBAAkB,KAAK,gCAAgC;AAC3H,WAAO;AAAA,EACR,GAAG,uBAAO,OAAO,IAAI,CAAC;AACvB;AACA,SAAS,iBAAiB;AACzB,SAAO,mBAAmB,OAAO,CAAC,QAAQ,QAAQ;AACjD,WAAO,GAAG,IAAI;AAAA,MACb,OAAO;AAAA,MACP,MAAM;AAAA,IACP;AACA,WAAO;AAAA,EACR,GAAG,uBAAO,OAAO,IAAI,CAAC;AACvB;AACA,SAAS,qBAAqB,SAAS;AACtC,SAAO,SAAS,qBAAqB,gBAAgB;AACtD;AACA,SAAS,eAAe,SAAS;AAChC,SAAO,SAAS,eAAe,gBAAgB;AAChD;AACA,SAAS,gBAAgB,SAAS;AACjC,SAAO,SAAS,gBAAgB,gBAAgB;AACjD;AACA,SAAS,UAAU,SAAS;AAC3B,SAAO;AAAA,IACN,YAAY,SAAS,cAAc,gBAAgB;AAAA,IACnD,QAAQ,SAAS,YAAY,mBAAmB,IAAI,eAAe;AAAA,IACnE,aAAa,OAAO,SAAS,gBAAgB,cAAc,SAAS,gBAAgB,OAAO,QAAQ,cAAc,gBAAgB;AAAA,IACjI,aAAa,eAAe,OAAO;AAAA,IACnC,cAAc,gBAAgB,OAAO;AAAA,IACrC,QAAQ,SAAS,MAAM,KAAK,aAAa,SAAS,UAAU,gBAAgB,MAAM;AAAA,IAClF,UAAU,SAAS,YAAY,gBAAgB;AAAA,IAC/C,UAAU,SAAS,YAAY,gBAAgB;AAAA,IAC/C,KAAK,SAAS,OAAO,gBAAgB;AAAA,IACrC,SAAS,SAAS,WAAW,gBAAgB;AAAA,IAC7C,qBAAqB,SAAS,uBAAuB,CAAC,SAAS;AAAA,IAC/D,mBAAmB,qBAAqB,OAAO;AAAA,IAC/C,iBAAiB,SAAS,mBAAmB;AAAA,IAC7C,cAAc,SAAS,iBAAiB,SAAS,MAAM,MAAM;AAAA,IAC7D,cAAc,SAAS,iBAAiB,SAAS,MAAM,KAAK;AAAA,IAC5D,aAAa,SAAS,eAAe,gBAAgB;AAAA,IACrD,WAAW,SAAS,aAAa,gBAAgB;AAAA,IACjD,iBAAiB,SAAS,mBAAmB,gBAAgB;AAAA,IAC7D,uBAAuB,CAAC;AAAA,EACzB;AACD;AACA,SAAS,aAAa,QAAQ;AAC7B,SAAO,MAAM,KAAK,EAAE,QAAQ,SAAS,EAAE,CAAC,EAAE,KAAK,GAAG;AACnD;AAMA,SAAS,OAAO,KAAK,SAAS;AAC7B,MAAI,QAAS,iBAAgB,OAAO;AACpC,QAAMA,UAAS,UAAU,OAAO;AAChC,QAAMc,UAAS,WAAWd,QAAO,SAAS,GAAG;AAC7C,MAAIc,YAAW,KAAM,QAAO,YAAYA,SAAQ,KAAKd,SAAQ,IAAI,GAAG,CAAC,CAAC;AACtE,QAAM,cAAc,gBAAgB,KAAKA,QAAO,mBAAmBA,QAAO,aAAaA,QAAO,cAAcA,QAAO,WAAW;AAC9H,MAAI,gBAAgB,KAAM,QAAO;AACjC,SAAO,kBAAkB,KAAKA,SAAQ,IAAI,GAAG,CAAC,CAAC;AAChD;AACA,IAAM,UAAU;AAAA,EACf,mBAAmB;AAAA,EACnB,eAAe;AAAA,EACf,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,cAAc;AAAA,EACd,oBAAoB;AAAA,EACpB,OAAO;AACR;;;AC36BA,IAAM,EAAE,mBAAmB,eAAe,YAAY,WAAW,cAAc,mBAAmB,IAAI;AACtG,IAAM,UAAU;AAAA,EACf;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD;AACA,SAAS,UAAUgB,SAAQ,WAAW,IAAI,EAAE,WAAW,YAAY,GAAG,QAAQ,IAAI,CAAC,GAAG;AACrF,QAAM,aAAa,aAAa;AAChC,MAAI;AAEJ,QAAM,WAAW,OAAO,eAAe,WAAW,6BAA6B,UAAU,IAAI;AAC7F,QAAMC,WAAU,WAAW;AAAA,IAC1B;AAAA,IACA;AAAA,IACA,uBAAuB,QAAQ;AAAA,IAC/B;AAAA,IACA;AAAA,IACA;AAAA,EACD,IAAI;AACJ,MAAI;AACH,aAAS,OAASD,SAAQ;AAAA,MACzB;AAAA,MACA,cAAc;AAAA;AAAA,MAEd,SAAAC;AAAA,MACA,GAAG;AAAA,IACJ,CAAC;AAAA,EACF,QAAQ;AACP,aAAS,OAASD,SAAQ;AAAA,MACzB,YAAY;AAAA,MACZ;AAAA,MACA,cAAc;AAAA;AAAA,MAEd,SAAAC;AAAA,MACA,GAAG;AAAA,IACJ,CAAC;AAAA,EACF;AAEA,SAAO,OAAO,UAAU,cAAc,WAAW,IAAI,UAAUD,SAAQ,KAAK,MAAM,KAAK,IAAI,UAAU,OAAO,gBAAgB,IAAI,CAAC,GAAG;AAAA,IACnI;AAAA,IACA;AAAA,IACA,GAAG;AAAA,EACJ,CAAC,IAAI;AACN;AACA,SAAS,6BAA6B,UAAU;AAC/C,QAAME,gBAAe;AACrB,QAAMC,gBAAe;AACrB,SAAO,CAAC,SAAS;AAEhB,QAAI,KAAK,aAAaA,cAAc,QAAO;AAE3C,QAAI,KAAK,aAAaD,iBAAgB,KAAK,QAAS,KAAI;AACvD,aAAO,CAAC,KAAK,QAAQ,QAAQ;AAAA,IAC9B,QAAQ;AACP,aAAO;AAAA,IACR;AACA,WAAO;AAAA,EACR;AACD;AACA,IAAM,eAAe;AACrB,SAASE,QAAO,MAAM,UAAU,CAAC,GAAG;AACnC,QAAM,YAAY,CAAC,SAAS,QAAQ,MAAM,OAAO;AACjD,MAAI,OAAO,KAAK,CAAC,MAAM,UAAU;AAChC,UAAM,UAAU,CAAC;AACjB,aAASC,KAAI,GAAGA,KAAI,KAAK,QAAQA,KAAK,SAAQ,KAAK,UAAU,KAAKA,EAAC,CAAC,CAAC;AACrE,WAAO,QAAQ,KAAK,GAAG;AAAA,EACxB;AACA,QAAM,MAAM,KAAK;AACjB,MAAIA,KAAI;AACR,QAAM,WAAW,KAAK,CAAC;AACvB,MAAI,MAAM,OAAO,QAAQ,EAAE,QAAQ,cAAc,CAAC,MAAM;AACvD,QAAI,MAAM,KAAM,QAAO;AACvB,QAAIA,MAAK,IAAK,QAAO;AACrB,YAAQ,GAAG;AAAA,MACV,KAAK,MAAM;AACV,cAAM,QAAQ,KAAKA,IAAG;AACtB,YAAI,OAAO,UAAU,SAAU,QAAO,GAAG,MAAM,SAAS,CAAC;AACzD,YAAI,OAAO,UAAU,YAAY,UAAU,KAAK,IAAI,QAAQ,EAAG,QAAO;AACtE,YAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAChD,cAAI,OAAO,MAAM,aAAa,cAAc,MAAM,aAAa,OAAO,UAAU,SAAU,QAAO,MAAM,SAAS;AAChH,iBAAO,UAAU,KAAK;AAAA,QACvB;AACA,eAAO,OAAO,KAAK;AAAA,MACpB;AAAA,MACA,KAAK,MAAM;AACV,cAAM,QAAQ,KAAKA,IAAG;AACtB,YAAI,OAAO,UAAU,SAAU,QAAO,GAAG,MAAM,SAAS,CAAC;AACzD,YAAI,OAAO,UAAU,SAAU,QAAO;AACtC,eAAO,OAAO,KAAK,EAAE,SAAS;AAAA,MAC/B;AAAA,MACA,KAAK,MAAM;AACV,cAAM,QAAQ,KAAKA,IAAG;AACtB,YAAI,OAAO,UAAU,SAAU,QAAO,GAAG,MAAM,SAAS,CAAC;AACzD,eAAO,OAAO,SAAS,OAAO,KAAK,CAAC,EAAE,SAAS;AAAA,MAChD;AAAA,MACA,KAAK;AAAM,eAAO,OAAO,WAAW,OAAO,KAAKA,IAAG,CAAC,CAAC,EAAE,SAAS;AAAA,MAChE,KAAK;AAAA,MACL,KAAK;AAAM,eAAO,UAAU,KAAKA,IAAG,CAAC;AAAA,MACrC,KAAK;AACJ,QAAAA;AACA,eAAO;AAAA,MACR,KAAK;AAAM,YAAI;AACd,iBAAO,KAAK,UAAU,KAAKA,IAAG,CAAC;AAAA,QAChC,SAAS,KAAK;AACb,gBAAMC,KAAI,IAAI;AACd,cAAIA,GAAE,SAAS,oBAAoB,KAAKA,GAAE,SAAS,mBAAmB,KAAKA,GAAE,SAAS,eAAe,EAAG,QAAO;AAC/G,gBAAM;AAAA,QACP;AAAA,MACA;AAAS,eAAO;AAAA,IACjB;AAAA,EACD,CAAC;AACD,WAAS,IAAI,KAAKD,EAAC,GAAGA,KAAI,KAAK,IAAI,KAAK,EAAEA,EAAC,EAAG,KAAI,MAAM,QAAQ,OAAO,MAAM,SAAU,QAAO,IAAI,OAAO,MAAM,WAAW,EAAE,SAAS,IAAI,CAAC;AAAA,MACrI,QAAO,IAAI,UAAU,CAAC,CAAC;AAC5B,SAAO;AACR;AACA,SAAS,QAAQ,KAAK,SAAS;AAC9B,QAAM,EAAE,UAAAE,WAAU,WAAW,GAAG,iBAAiB,IAAI,WAAW,CAAC;AACjE,QAAM,sBAAsB;AAAA,IAC3B,aAAa;AAAA,IACb,WAAW;AAAA,IACX,KAAK;AAAA,IACL,cAAc;AAAA,IACd,cAAc;AAAA,IACd,qBAAqB;AAAA,IACrB,aAAa;AAAA,IACb,GAAG,YAAY;AAAA,MACd,KAAK;AAAA,MACL,cAAc;AAAA,MACd,cAAc;AAAA,IACf,IAAI,CAAC;AAAA,EACN;AACA,QAAM,YAAYA,aAAY;AAC9B,QAAM,YAAY,UAAU,KAAK,QAAQ;AAAA,IACxC,GAAG;AAAA,IACH,GAAG;AAAA,IACH,WAAW,aAAa;AAAA,EACzB,CAAC;AACD,MAAI,cAAc,KAAK,UAAU,UAAU,UAAW,QAAO;AAI7D,QAAMC,QAAO,OAAO,UAAU,SAAS,KAAK,GAAG;AAC/C,MAAI,OAAO,QAAQ,UAAU;AAC5B,QAAI,MAAM,YAAY;AACtB,QAAI,MAAM,KAAK,gBAAgB,UAAU,MAAM,CAAC,CAAC,EAAG,OAAM,MAAM;AAChE,WAAO,IAAI,UAAU,MAAM,GAAG,GAAG,CAAC;AAAA,EACnC;AACA,MAAIA,UAAS,oBAAoBA,UAAS,qBAAqBA,UAAS,kBAAkBA,UAAS,eAAgB,QAAO,oBAAoB,KAAK,WAAW;AAAA,IAC7J,GAAG;AAAA,IACH,GAAG;AAAA,IACH,UAAU;AAAA,EACX,CAAC;AACD,SAAO,UAAU,KAAK,QAAQ;AAAA,IAC7B,GAAG;AAAA,IACH,GAAG;AAAA,IACH,UAAU;AAAA,EACX,CAAC;AACF;AACA,SAAS,eAAeC,SAAQ,WAAW;AAC1C,MAAIA,QAAO,UAAU,UAAW,QAAOA;AACvC,MAAI,MAAM,YAAY;AACtB,MAAI,gBAAgBA,QAAO,MAAM,CAAC,CAAC,EAAG,OAAM,MAAM;AAClD,SAAO,GAAGA,QAAO,MAAM,GAAG,GAAG,CAAC;AAC/B;AACA,SAAS,oBAAoBT,SAAQ,WAAW,SAAS;AACxD,WAAS,SAAS,GAAG;AACpB,WAAO,UAAUA,SAAQ,QAAQ;AAAA,MAChC,GAAG;AAAA,MACH,UAAU;AAAA,IACX,CAAC;AAAA,EACF;AACA,SAAO,SAAS,aAAa,GAAG,WAAW,CAAC,MAAM,SAAS,CAAC,EAAE,UAAU,SAAS,CAAC;AACnF;AAGA,SAAS,aAAa,IAAI,IAAI,GAAG;AAChC,SAAO,KAAK,IAAI,IAAI;AACnB,UAAM,IAAI,KAAK,OAAO,KAAK,MAAM,CAAC;AAClC,QAAI,EAAE,CAAC,EAAG,MAAK;AAAA,QACV,MAAK;AAAA,EACX;AACA,SAAO;AACR;AAEA,SAAS,gBAAgB,MAAM;AAC9B,SAAO,QAAQ,YAAY,QAAQ;AACpC;;;AC9LA,IAAM,oBAAoB;AAAA,EACzB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD;AACA,IAAM,iBAAiB,IAAI,OAAO,OAAO,kBAAkB,KAAK,GAAG,CAAC,IAAI;AAwBxE,SAAS,uBAAuB,SAAS;AACxC,QAAM,EAAE,UAAU,uBAAuB,kBAAkB,EAAE,IAAI,WAAW,CAAC;AAC7E,QAAM,QAAQ,MAAM;AACpB,QAAM,oBAAoB,MAAM;AAChC,QAAM,kBAAkB;AACxB,QAAM,oBAAoB,CAAC,MAAM,EAAE;AACnC,QAAM,aAAa,IAAI,MAAM,OAAO,EAAE,SAAS;AAC/C,QAAM,oBAAoB;AAC1B,QAAM,kBAAkB;AACxB,SAAO;AACR;AACA,SAAS,WAAWU,IAAG;AACtB,SAAOA,MAAK;AACb;AACA,SAAS,YAAY,OAAO,MAAM,OAAO;AACxC,QAAM,eAAe,OAAO;AAC5B,MAAI,CAAC,MAAM,SAAS,YAAY,EAAG,OAAM,IAAI,UAAU,GAAG,IAAI,kBAAkB,MAAM,KAAK,MAAM,CAAC,eAAe,YAAY,GAAG;AACjI;AACA,SAAS,YAAY,OAAO;AAC3B,SAAO,UAAU,QAAQ,OAAO,UAAU,cAAc,OAAO,UAAU;AAC1E;AAmCA,SAAS,kBAAkB,GAAG;AAC7B,QAAM,SAAS,CAAC;AAChB,MAAI,eAAe;AACnB,WAASC,KAAI,GAAGA,KAAI,EAAE,QAAQ,EAAEA,GAAG,KAAI,iBAAiB,cAAc;AACrE,QAAI,EAAEA,EAAC,MAAM,KAAM,gBAAe;AAAA,EACnC,WAAW,iBAAiB,aAAa;AACxC,QAAI,EAAEA,KAAI,CAAC,MAAM,OAAO,EAAEA,EAAC,MAAM,IAAK,gBAAe;AAAA,EACtD,WAAW,iBAAiB,OAAQ,KAAI,EAAEA,EAAC,MAAM,OAAO,EAAEA,KAAI,CAAC,MAAM,IAAK,gBAAe;AAAA,WAChF,EAAEA,EAAC,MAAM,OAAO,EAAEA,KAAI,CAAC,MAAM,KAAK;AAC1C,mBAAe;AACf,IAAAA,MAAK;AAAA,EACN,MAAO,QAAO,KAAK,EAAEA,EAAC,CAAC;AACvB,SAAO,OAAO,KAAK,EAAE;AACtB;AAKA,SAAS,QAAQC,QAAO;AACvB,EAAAA,WAAU,CAAC;AACX,MAAI,MAAM,QAAQA,MAAK,EAAG,QAAOA;AACjC,SAAO,CAACA,MAAK;AACd;AACA,SAAS,SAAS,MAAM;AACvB,SAAO,QAAQ,QAAQ,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,IAAI;AACvE;AACA,SAAS,WAAW,KAAK;AACxB,SAAO,QAAQ,OAAO,aAAa,QAAQ,SAAS,aAAa,QAAQ,OAAO;AACjF;AACA,SAASC,SAAQ,OAAO;AACvB,SAAO,OAAO,UAAU,SAAS,MAAM,KAAK,EAAE,MAAM,GAAG,EAAE;AAC1D;AACA,SAAS,qBAAqB,KAAK,WAAW;AAC7C,QAAM,UAAU,OAAO,cAAc,aAAa,YAAY,CAAC,QAAQ,UAAU,IAAI,GAAG;AACxF,SAAO,oBAAoB,GAAG,EAAE,QAAQ,OAAO;AAC/C,SAAO,sBAAsB,GAAG,EAAE,QAAQ,OAAO;AAClD;AACA,SAAS,iBAAiB,KAAK;AAC9B,QAAM,WAA2B,oBAAI,IAAI;AACzC,MAAI,WAAW,GAAG,EAAG,QAAO,CAAC;AAC7B,uBAAqB,KAAK,QAAQ;AAClC,SAAO,MAAM,KAAK,QAAQ;AAC3B;AACA,IAAM,sBAAsB,EAAE,eAAe,MAAM;AACnD,SAAS,UAAU,KAAK,UAAU,qBAAqB;AACtD,SAAO,MAAM,KAAqB,oBAAI,QAAQ,GAAG,OAAO;AACzD;AACA,SAAS,MAAM,KAAK,MAAM,UAAU,qBAAqB;AACxD,MAAI,GAAG;AACP,MAAI,KAAK,IAAI,GAAG,EAAG,QAAO,KAAK,IAAI,GAAG;AACtC,MAAI,MAAM,QAAQ,GAAG,GAAG;AACvB,UAAM,MAAM,KAAK,EAAE,QAAQ,IAAI,IAAI,OAAO,CAAC;AAC3C,SAAK,IAAI,KAAK,GAAG;AACjB,WAAO,IAAK,KAAI,CAAC,IAAI,MAAM,IAAI,CAAC,GAAG,MAAM,OAAO;AAChD,WAAO;AAAA,EACR;AACA,MAAI,OAAO,UAAU,SAAS,KAAK,GAAG,MAAM,mBAAmB;AAC9D,UAAM,OAAO,OAAO,OAAO,eAAe,GAAG,CAAC;AAC9C,SAAK,IAAI,KAAK,GAAG;AAEjB,UAAM,QAAQ,iBAAiB,GAAG;AAClC,eAAWC,MAAK,OAAO;AACtB,YAAM,aAAa,OAAO,yBAAyB,KAAKA,EAAC;AACzD,UAAI,CAAC,WAAY;AACjB,YAAM,SAAS,MAAM,IAAIA,EAAC,GAAG,MAAM,OAAO;AAC1C,UAAI,QAAQ,cAAe,QAAO,eAAe,KAAKA,IAAG;AAAA,QACxD,YAAY,WAAW;AAAA,QACvB,cAAc;AAAA,QACd,UAAU;AAAA,QACV,OAAO;AAAA,MACR,CAAC;AAAA,eACQ,SAAS,WAAY,QAAO,eAAe,KAAKA,IAAG;AAAA,QAC3D,GAAG;AAAA,QACH,MAAM;AACL,iBAAO;AAAA,QACR;AAAA,MACD,CAAC;AAAA,UACI,QAAO,eAAe,KAAKA,IAAG;AAAA,QAClC,GAAG;AAAA,QACH,OAAO;AAAA,MACR,CAAC;AAAA,IACF;AACA,WAAO;AAAA,EACR;AACA,SAAO;AACR;AACA,SAAS,OAAO;AAAC;AACjB,SAAS,WAAW,QAAQ,MAAM,eAAe,QAAQ;AAExD,QAAM,QAAQ,KAAK,QAAQ,cAAc,KAAK,EAAE,MAAM,GAAG;AACzD,MAAI,SAAS;AACb,aAAW,KAAK,OAAO;AACtB,aAAS,IAAI,OAAO,MAAM,EAAE,CAAC;AAC7B,QAAI,WAAW,OAAQ,QAAO;AAAA,EAC/B;AACA,SAAO;AACR;AACA,SAAS,cAAc;AACtB,MAAIC,WAAU;AACd,MAAI,SAAS;AACb,QAAM,IAAI,IAAI,QAAQ,CAAC,UAAU,YAAY;AAC5C,IAAAA,WAAU;AACV,aAAS;AAAA,EACV,CAAC;AACD,IAAE,UAAUA;AACZ,IAAE,SAAS;AACX,SAAO;AACR;AAUA,SAAS,iBAAiB,MAAM;AAC/B,MAAI,YAAY;AAChB,MAAI,WAAW;AACf,MAAI,iBAAiB;AACrB,MAAI,eAAe;AACnB,MAAI,aAAa;AACjB,SAAO,aAAa,KAAK,QAAQ;AAChC,iBAAa,KAAK,SAAS;AAC3B;AACA,UAAM,OAAO,KAAK,SAAS;AAC3B,SAAK,SAAS,OAAQ,SAAS,OAAO,SAAS,QAAQ,eAAe,MAAM;AAC3E,UAAI,aAAa,KAAM,YAAW;AAAA,eACzB,CAAC,SAAU,YAAW;AAAA,IAChC;AACA,QAAI,CAAC,UAAU;AACd,UAAI,SAAS,IAAK;AAClB,UAAI,SAAS,IAAK;AAAA,IACnB;AACA,QAAI,kBAAkB,gBAAgB,mBAAmB,aAAc,QAAO;AAAA,EAC/E;AACA,SAAO;AACR;AACA,SAAS,cAAc,KAAK;AAC3B,MAAI,CAAC,OAAO,MAAM,GAAG,EAAG,QAAO;AAC/B,QAAM,MAAsB,oBAAI,aAAa,CAAC;AAC9C,MAAI,CAAC,IAAI;AACT,SAAO,IAAI,YAAY,IAAI,MAAM,EAAE,CAAC,MAAM,OAAO;AAClD;AAUA,SAAS,QAAQC,IAAG;AACnB,QAAM,IAAIA,KAAI;AACd,QAAM,IAAIA,KAAI;AACd,MAAI,MAAM,KAAK,MAAM,GAAI,QAAO,GAAGA,EAAC;AACpC,MAAI,MAAM,KAAK,MAAM,GAAI,QAAO,GAAGA,EAAC;AACpC,MAAI,MAAM,KAAK,MAAM,GAAI,QAAO,GAAGA,EAAC;AACpC,SAAO,GAAGA,EAAC;AACZ;AAsBA,SAAS,OAAOC,QAAO;AACtB,SAAO,MAAM,KAAK,IAAI,IAAIA,MAAK,CAAC;AACjC;AAMA,IAAM,yBAAyB;AAC/B,SAAS,qBAAqB,QAAQ,IAAI;AACxC,MAAI,CAAC,OAAO;AACV,WAAO;AAAA,EACT;AACA,SAAO,MAAM,QAAQ,OAAO,GAAG,EAAE,QAAQ,wBAAwB,CAAC,MAAM,EAAE,YAAY,CAAC;AACzF;AAGA,IAAM,kBAAkB;AAsDxB,SAAS,MAAM;AACb,MAAI,OAAO,YAAY,eAAe,OAAO,QAAQ,QAAQ,YAAY;AACvE,WAAO,QAAQ,IAAI,EAAE,QAAQ,OAAO,GAAG;AAAA,EACzC;AACA,SAAO;AACT;AACA,IAAM,UAAU,YAAY,YAAY;AACtC,eAAa,WAAW,IAAI,CAAC,aAAa,qBAAqB,QAAQ,CAAC;AACxE,MAAI,eAAe;AACnB,MAAI,mBAAmB;AACvB,WAAS,QAAQ,WAAW,SAAS,GAAG,SAAS,MAAM,CAAC,kBAAkB,SAAS;AACjF,UAAM,OAAO,SAAS,IAAI,WAAW,KAAK,IAAI,IAAI;AAClD,QAAI,CAAC,QAAQ,KAAK,WAAW,GAAG;AAC9B;AAAA,IACF;AACA,mBAAe,GAAG,IAAI,IAAI,YAAY;AACtC,uBAAmB,WAAW,IAAI;AAAA,EACpC;AACA,iBAAe,gBAAgB,cAAc,CAAC,gBAAgB;AAC9D,MAAI,oBAAoB,CAAC,WAAW,YAAY,GAAG;AACjD,WAAO,IAAI,YAAY;AAAA,EACzB;AACA,SAAO,aAAa,SAAS,IAAI,eAAe;AAClD;AACA,SAAS,gBAAgB,MAAM,gBAAgB;AAC7C,MAAI,MAAM;AACV,MAAI,oBAAoB;AACxB,MAAI,YAAY;AAChB,MAAI,OAAO;AACX,MAAI,OAAO;AACX,WAAS,QAAQ,GAAG,SAAS,KAAK,QAAQ,EAAE,OAAO;AACjD,QAAI,QAAQ,KAAK,QAAQ;AACvB,aAAO,KAAK,KAAK;AAAA,IACnB,WAAW,SAAS,KAAK;AACvB;AAAA,IACF,OAAO;AACL,aAAO;AAAA,IACT;AACA,QAAI,SAAS,KAAK;AAChB,UAAI,cAAc,QAAQ,KAAK,SAAS,EAAG;AAAA,eAAW,SAAS,GAAG;AAChE,YAAI,IAAI,SAAS,KAAK,sBAAsB,KAAK,IAAI,IAAI,SAAS,CAAC,MAAM,OAAO,IAAI,IAAI,SAAS,CAAC,MAAM,KAAK;AAC3G,cAAI,IAAI,SAAS,GAAG;AAClB,kBAAM,iBAAiB,IAAI,YAAY,GAAG;AAC1C,gBAAI,mBAAmB,IAAI;AACzB,oBAAM;AACN,kCAAoB;AAAA,YACtB,OAAO;AACL,oBAAM,IAAI,MAAM,GAAG,cAAc;AACjC,kCAAoB,IAAI,SAAS,IAAI,IAAI,YAAY,GAAG;AAAA,YAC1D;AACA,wBAAY;AACZ,mBAAO;AACP;AAAA,UACF,WAAW,IAAI,SAAS,GAAG;AACzB,kBAAM;AACN,gCAAoB;AACpB,wBAAY;AACZ,mBAAO;AACP;AAAA,UACF;AAAA,QACF;AACA,YAAI,gBAAgB;AAClB,iBAAO,IAAI,SAAS,IAAI,QAAQ;AAChC,8BAAoB;AAAA,QACtB;AAAA,MACF,OAAO;AACL,YAAI,IAAI,SAAS,GAAG;AAClB,iBAAO,IAAI,KAAK,MAAM,YAAY,GAAG,KAAK,CAAC;AAAA,QAC7C,OAAO;AACL,gBAAM,KAAK,MAAM,YAAY,GAAG,KAAK;AAAA,QACvC;AACA,4BAAoB,QAAQ,YAAY;AAAA,MAC1C;AACA,kBAAY;AACZ,aAAO;AAAA,IACT,WAAW,SAAS,OAAO,SAAS,IAAI;AACtC,QAAE;AAAA,IACJ,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AACA,IAAM,aAAa,SAAS,GAAG;AAC7B,SAAO,gBAAgB,KAAK,CAAC;AAC/B;;;AC7bA,IAAI,iBAAiB,OAAO,eAAe,cAAc,aAAa,OAAO,WAAW,cAAc,SAAS,OAAO,WAAW,cAAc,SAAS,OAAO,SAAS,cAAc,OAAO,CAAC;AAC9L,SAASC,yBAAwB,GAAG;AACnC,SAAO,KAAK,EAAE,cAAc,OAAO,UAAU,eAAe,KAAK,GAAG,SAAS,IAAI,EAAE,SAAS,IAAI;AACjG;AAEA,IAAI,QAAQ,CAAC;AAEb,IAAI;AAEJ,SAAS,eAAgB;AACxB,MAAI,iBAAkB,QAAO;AAC7B,qBAAmB;AAEnB,SAAO,eAAe,OAAO,cAAc;AAAA,IACzC,OAAO;AAAA,EACT,CAAC;AACD,QAAM,UAAU;AAkEhB,QAAM,MAAM;AACZ,QAAM,cAAc;AAIpB,QAAM,oBAAoB,CAAC,QAAQ,MAAM,QAAQ,MAAM,aAAa;AAClE,QAAI,UAAU;AACd,WAAO,SAAS,QAAQ,SAAS,QAAQ,SAAS,QAAQ,MAAM,GAAG;AACjE,gBAAU;AACV,gBAAU;AACV,iBAAW;AAAA,IACb;AACA,WAAO;AAAA,EACT;AAIA,QAAM,oBAAoB,CAAC,QAAQ,QAAQ,QAAQ,QAAQ,aAAa;AACtE,QAAI,UAAU;AACd,WAAO,UAAU,UAAU,UAAU,UAAU,SAAS,QAAQ,MAAM,GAAG;AACvE,gBAAU;AACV,gBAAU;AACV,iBAAW;AAAA,IACb;AACA,WAAO;AAAA,EACT;AAIA,QAAM,eAAe,CACnBC,IACA,MACA,MACA,IACA,UACA,WACA,UACG;AAEH,QAAI,KAAK;AACT,QAAI,KAAK,CAACA;AACV,QAAI,SAAS,UAAU,EAAE;AACzB,QAAI,cAAc;AAClB,cAAU,EAAE,KAAK;AAAA,MACf,SAAS;AAAA,MACT;AAAA,MACA,KAAK,SAAS,KAAK;AAAA,MACnB;AAAA,MACA;AAAA,IACF;AAGA,UAAM,KAAKA,KAAI,QAAQA,KAAI;AAG3B,SAAK,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;AAIjD,UAAI,OAAOA,MAAK,cAAc,UAAU,EAAE,GAAG;AAC3C,iBAAS,UAAU,EAAE;AAAA,MACvB,OAAO;AACL,iBAAS,cAAc;AAEvB,YAAI,QAAQ,QAAQ;AAElB,iBAAO,KAAK;AAAA,QACd;AAAA,MACF;AAGA,oBAAc,UAAU,EAAE;AAC1B,gBAAU,EAAE,IACV,SACA,kBAAkB,SAAS,GAAG,MAAM,KAAK,SAAS,KAAK,GAAG,MAAM,QAAQ;AAAA,IAC5E;AACA,WAAO;AAAA,EACT;AAIA,QAAM,eAAe,CACnBA,IACA,QACA,QACA,IACA,UACA,WACA,UACG;AAEH,QAAI,KAAK;AACT,QAAI,KAAKA;AACT,QAAI,SAAS,UAAU,EAAE;AACzB,QAAI,cAAc;AAClB,cAAU,EAAE,KAAK;AAAA,MACf;AAAA,MACA,SAAS;AAAA,MACT;AAAA,MACA,KAAK,SAAS,KAAK;AAAA,MACnB;AAAA,IACF;AAGA,UAAM,KAAKA,KAAI,QAAQA,KAAI;AAG3B,SAAK,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;AAIjD,UAAI,OAAOA,MAAK,UAAU,EAAE,IAAI,aAAa;AAC3C,iBAAS,UAAU,EAAE;AAAA,MACvB,OAAO;AACL,iBAAS,cAAc;AAEvB,YAAI,SAAS,QAAQ;AAEnB,iBAAO,KAAK;AAAA,QACd;AAAA,MACF;AAGA,oBAAc,UAAU,EAAE;AAC1B,gBAAU,EAAE,IACV,SACA;AAAA,QACE;AAAA,QACA,SAAS;AAAA,QACT;AAAA,QACA,KAAK,SAAS,KAAK;AAAA,QACnB;AAAA,MACF;AAAA,IACJ;AACA,WAAO;AAAA,EACT;AAIA,QAAM,2BAA2B,CAC/BA,IACA,QACA,MACA,QACA,MACA,UACA,WACA,OACA,WACA,OACA,aACG;AACH,UAAM,KAAK,SAAS;AACpB,UAAM,UAAU,OAAO;AACvB,UAAM,UAAU,OAAO;AACvB,UAAM,gBAAgB,UAAU;AAGhC,UAAM,eAAe,CAAC,iBAAiBA,KAAI;AAC3C,UAAM,eAAe,CAAC,iBAAiBA,KAAI;AAE3C,QAAI,cAAc;AAGlB,UAAM,KAAKA,KAAI,QAAQA,KAAI;AAG3B,aAAS,KAAK,GAAG,KAAK,CAACA,IAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;AAKpD,YAAM,SAAS,OAAO,KAAM,OAAOA,MAAK,cAAc,UAAU,EAAE;AAClE,YAAM,YAAY,SAAS,UAAU,EAAE,IAAI;AAC3C,YAAM,SAAS,SACX,YACA,YAAY;AAGhB,YAAM,SAAS,KAAK,SAAS;AAC7B,YAAM,WAAW;AAAA,QACf,SAAS;AAAA,QACT;AAAA,QACA,SAAS;AAAA,QACT;AAAA,QACA;AAAA,MACF;AACA,YAAM,QAAQ,SAAS;AACvB,oBAAc,UAAU,EAAE;AAC1B,gBAAU,EAAE,IAAI;AAChB,UAAI,gBAAgB,MAAM,MAAM,cAAc;AAI5C,cAAM,MAAMA,KAAI,KAAK,KAAK,kBAAkB;AAI5C,YAAI,MAAM,SAAS,UAAU,EAAE,IAAI,KAAK,OAAO;AAI7C,gBAAM,YAAY,KAAK,aAAa,SAAS,KAAK,IAAI,KAAK;AAK3D,gBAAM,WAAW;AAAA,YACf;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACF;AACA,gBAAM,kBAAkB,YAAY;AACpC,gBAAM,kBAAkB,YAAY;AACpC,gBAAM,gBAAgB,kBAAkB;AACxC,gBAAM,gBAAgB,kBAAkB;AACxC,mBAAS,mBAAmBA,KAAI;AAChC,cAAIA,KAAI,MAAM,gBAAgB,gBAAgB,SAAS,QAAQ;AAI7D,qBAAS,gBAAgB;AACzB,qBAAS,gBAAgB;AAAA,UAC3B,OAAO;AACL,qBAAS,gBAAgB;AACzB,qBAAS,gBAAgB;AAAA,UAC3B;AACA,mBAAS,mBAAmB;AAC5B,cAAI,aAAa,GAAG;AAClB,qBAAS,mBAAmB;AAC5B,qBAAS,mBAAmB;AAAA,UAC9B;AACA,mBAAS,mBAAmB;AAC5B,cAAI,aAAa,GAAG;AAClB,qBAAS,mBAAmB,SAAS;AACrC,qBAAS,mBAAmB,SAAS;AAAA,UACvC;AACA,gBAAM,kBAAkB,QAAQ;AAChC,gBAAM,kBAAkB,SAAS,WAAW;AAC5C,mBAAS,mBAAmBA,KAAI;AAChC,cAAIA,KAAI,MAAM,OAAO,OAAO,kBAAkB,iBAAiB;AAI7D,qBAAS,kBAAkB;AAC3B,qBAAS,kBAAkB;AAAA,UAC7B,OAAO;AACL,qBAAS,kBAAkB;AAC3B,qBAAS,kBAAkB;AAAA,UAC7B;AACA,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAIA,QAAM,2BAA2B,CAC/BA,IACA,QACA,MACA,QACA,MACA,UACA,WACA,OACA,WACA,OACA,aACG;AACH,UAAM,KAAK,OAAO;AAClB,UAAM,UAAU,OAAO;AACvB,UAAM,UAAU,OAAO;AACvB,UAAM,gBAAgB,UAAU;AAGhC,UAAM,eAAe,gBAAgBA;AACrC,UAAM,eAAe,gBAAgBA;AAErC,QAAI,cAAc;AAGlB,UAAM,KAAKA,KAAI,QAAQA,KAAI;AAG3B,aAAS,KAAK,GAAG,KAAKA,IAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;AAKnD,YAAM,SAAS,OAAO,KAAM,OAAOA,MAAK,UAAU,EAAE,IAAI;AACxD,YAAM,YAAY,SAAS,UAAU,EAAE,IAAI;AAC3C,YAAM,SAAS,SACX,YACA,YAAY;AAGhB,YAAM,SAAS,KAAK,SAAS;AAC7B,YAAM,WAAW;AAAA,QACf;AAAA,QACA,SAAS;AAAA,QACT;AAAA,QACA,SAAS;AAAA,QACT;AAAA,MACF;AACA,YAAM,QAAQ,SAAS;AACvB,oBAAc,UAAU,EAAE;AAC1B,gBAAU,EAAE,IAAI;AAChB,UAAI,gBAAgB,MAAM,MAAM,cAAc;AAI5C,cAAM,MAAMA,MAAK,KAAK,kBAAkB;AAIxC,YAAI,MAAM,SAAS,QAAQ,KAAK,UAAU,EAAE,GAAG;AAC7C,gBAAM,QAAQ,SAAS;AACvB,mBAAS,mBAAmBA;AAC5B,cAAIA,OAAM,QAAQ,QAAQ,SAAS,QAAQ;AAIzC,qBAAS,gBAAgB;AACzB,qBAAS,gBAAgB;AAAA,UAC3B,OAAO;AACL,qBAAS,gBAAgB;AACzB,qBAAS,gBAAgB;AAAA,UAC3B;AACA,mBAAS,mBAAmB;AAC5B,cAAI,aAAa,GAAG;AAElB,qBAAS,mBAAmB;AAC5B,qBAAS,mBAAmB;AAAA,UAC9B;AACA,mBAAS,mBAAmBA,KAAI;AAChC,cAAIA,OAAM,GAAG;AAEX,qBAAS,mBAAmB;AAC5B,qBAAS,kBAAkB;AAC3B,qBAAS,kBAAkB;AAAA,UAC7B,OAAO;AAIL,kBAAM,YAAY,KAAK,aAAa,SAAS,KAAK,IAAI,KAAK;AAK3D,kBAAM,WAAW;AAAA,cACf;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AACA,qBAAS,mBAAmB;AAC5B,gBAAI,aAAa,GAAG;AAElB,uBAAS,mBAAmB;AAC5B,uBAAS,mBAAmB;AAAA,YAC9B;AACA,kBAAM,kBAAkB,YAAY;AACpC,kBAAM,kBAAkB,YAAY;AAEpC,gBAAIA,KAAI,MAAM,OAAO,OAAO,kBAAkB,iBAAiB;AAI7D,uBAAS,kBAAkB;AAC3B,uBAAS,kBAAkB;AAAA,YAC7B,OAAO;AACL,uBAAS,kBAAkB;AAC3B,uBAAS,kBAAkB;AAAA,YAC7B;AAAA,UACF;AACA,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAOA,QAAM,SAAS,CACb,SACA,QACA,MACA,QACA,MACA,UACA,WACA,WACA,aACG;AACH,UAAM,KAAK,SAAS;AACpB,UAAM,KAAK,OAAO;AAClB,UAAM,UAAU,OAAO;AACvB,UAAM,UAAU,OAAO;AAQvB,UAAM,gBAAgB,UAAU;AAGhC,QAAI,QAAQ;AACZ,QAAI,QAAQ;AAGZ,cAAU,CAAC,IAAI,SAAS;AACxB,cAAU,CAAC,IAAI;AAEf,QAAI,gBAAgB,MAAM,GAAG;AAE3B,YAAM,QAAQ,WAAW,iBAAiB;AAC1C,YAAM,QAAQ,UAAU,WAAW;AACnC,eAASA,KAAI,GAAGA,MAAK,MAAMA,MAAK,GAAG;AACjC,gBAAQ,aAAaA,IAAG,MAAM,MAAM,IAAI,UAAU,WAAW,KAAK;AAClE,YAAIA,KAAI,MAAM;AACZ,kBAAQ,aAAaA,IAAG,QAAQ,QAAQ,IAAI,UAAU,WAAW,KAAK;AAAA,QACxE;AAAA;AAAA;AAAA,UAGE;AAAA,YACEA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACF;AAAA,UACA;AACA;AAAA,QACF;AAAA,MACF;AAAA,IACF,OAAO;AAEL,YAAM,SAAS,WAAW,iBAAiB,KAAK;AAChD,YAAM,QAAQ,UAAU,UAAU,KAAK;AAOvC,UAAIA,KAAI;AACR,cAAQ,aAAaA,IAAG,MAAM,MAAM,IAAI,UAAU,WAAW,KAAK;AAClE,WAAKA,MAAK,GAAGA,MAAK,MAAMA,MAAK,GAAG;AAC9B,gBAAQ;AAAA,UACNA,KAAI;AAAA,UACJ;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA,YAAIA,KAAI,MAAM;AACZ,kBAAQ,aAAaA,IAAG,MAAM,MAAM,IAAI,UAAU,WAAW,KAAK;AAAA,QACpE;AAAA;AAAA;AAAA,UAGE;AAAA,YACEA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACF;AAAA,UACA;AACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,UAAM,IAAI;AAAA,MACR,GAAG,GAAG,uBAAuB,MAAM,SAAS,IAAI,WAAW,MAAM,SAAS,IAAI;AAAA,IAChF;AAAA,EACF;AASA,QAAM,mBAAmB,CACvB,SACA,QACA,MACA,QACA,MACA,YACA,WACA,WACA,WACA,aACG;AACH,QAAI,OAAO,SAAS,OAAO,QAAQ;AAGjC,mBAAa,CAAC;AACd,UAAI,cAAc,UAAU,WAAW,GAAG;AAExC,cAAM,EAAC,kBAAAC,mBAAkB,UAAAC,UAAQ,IAAI,UAAU,CAAC;AAChD,kBAAU,CAAC,IAAI;AAAA,UACb,kBAAkB,CAAC,SAAS,SAAS,YAAY;AAC/C,YAAAD,kBAAiB,SAAS,SAAS,OAAO;AAAA,UAC5C;AAAA,UACA,UAAU,CAAC,QAAQ,WAAWC,UAAS,QAAQ,MAAM;AAAA,QACvD;AAAA,MACF;AACA,YAAM,SAAS;AACf,YAAM,OAAO;AACb,eAAS;AACT,aAAO;AACP,eAAS;AACT,aAAO;AAAA,IACT;AACA,UAAM,EAAC,kBAAkB,SAAQ,IAAI,UAAU,aAAa,IAAI,CAAC;AAGjE;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,IAAI;AAGJ,QAAI,SAAS,iBAAiB,SAAS,eAAe;AAEpD;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAGA,QAAI,qBAAqB,GAAG;AAC1B,uBAAiB,kBAAkB,kBAAkB,gBAAgB;AAAA,IACvE;AACA,QAAI,qBAAqB,GAAG;AAC1B,uBAAiB,kBAAkB,kBAAkB,gBAAgB;AAAA,IACvE;AAGA,QAAI,kBAAkB,QAAQ,kBAAkB,MAAM;AAEpD;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,QAAM,iBAAiB,CAAC,MAAM,QAAQ;AACpC,QAAI,OAAO,QAAQ,UAAU;AAC3B,YAAM,IAAI,UAAU,GAAG,GAAG,KAAK,IAAI,WAAW,OAAO,GAAG,kBAAkB;AAAA,IAC5E;AACA,QAAI,CAAC,OAAO,cAAc,GAAG,GAAG;AAC9B,YAAM,IAAI,WAAW,GAAG,GAAG,KAAK,IAAI,UAAU,GAAG,wBAAwB;AAAA,IAC3E;AACA,QAAI,MAAM,GAAG;AACX,YAAM,IAAI,WAAW,GAAG,GAAG,KAAK,IAAI,UAAU,GAAG,wBAAwB;AAAA,IAC3E;AAAA,EACF;AACA,QAAM,mBAAmB,CAAC,MAAM,QAAQ;AACtC,UAAMC,QAAO,OAAO;AACpB,QAAIA,UAAS,YAAY;AACvB,YAAM,IAAI,UAAU,GAAG,GAAG,KAAK,IAAI,WAAWA,KAAI,oBAAoB;AAAA,IACxE;AAAA,EACF;AAMA,WAAS,aAAa,SAAS,SAAS,UAAU,kBAAkB;AAClE,mBAAe,WAAW,OAAO;AACjC,mBAAe,WAAW,OAAO;AACjC,qBAAiB,YAAY,QAAQ;AACrC,qBAAiB,oBAAoB,gBAAgB;AAGrD,UAAM,WAAW,kBAAkB,GAAG,SAAS,GAAG,SAAS,QAAQ;AACnE,QAAI,aAAa,GAAG;AAClB,uBAAiB,UAAU,GAAG,CAAC;AAAA,IACjC;AAIA,QAAI,YAAY,YAAY,YAAY,UAAU;AAGhD,YAAM,SAAS;AACf,YAAM,SAAS;AAGf,YAAM,WAAW;AAAA,QACf;AAAA,QACA,UAAU;AAAA,QACV;AAAA,QACA,UAAU;AAAA,QACV;AAAA,MACF;AAIA,YAAM,OAAO,UAAU;AACvB,YAAM,OAAO,UAAU;AAKvB,YAAM,YAAY,WAAW;AAC7B,UAAI,YAAY,aAAa,YAAY,WAAW;AAClD,cAAM,UAAU;AAChB,cAAM,aAAa;AACnB,cAAM,YAAY;AAAA,UAChB;AAAA,YACE;AAAA,YACA;AAAA,UACF;AAAA,QACF;AAIA,cAAM,YAAY,CAAC,WAAW;AAE9B,cAAM,YAAY,CAAC,WAAW;AAG9B,cAAM,WAAW;AAAA,UACf,kBAAkB;AAAA,UAClB,kBAAkB;AAAA,UAClB,eAAe;AAAA,UACf,iBAAiB;AAAA,UACjB,kBAAkB;AAAA,UAClB,kBAAkB;AAAA,UAClB,eAAe;AAAA,UACf,iBAAiB;AAAA,UACjB,kBAAkB;AAAA,UAClB,kBAAkB;AAAA,UAClB,kBAAkB;AAAA,UAClB,kBAAkB;AAAA,QACpB;AAGA;AAAA,UACE;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AACA,UAAI,aAAa,GAAG;AAClB,yBAAiB,UAAU,MAAM,IAAI;AAAA,MACvC;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACR;AAEA,IAAI,eAAe,aAAa;AAChC,IAAI,gBAA6B,gBAAAJ,yBAAwB,YAAY;AAErE,IAAM,mBAAmB;AACzB,IAAM,uBAAuB;AAC7B,SAAS,YAAYK,IAAG;AACvB,SAAOA,OAAMA,GAAE,oBAAoB,KAAKA,GAAE,gBAAgB;AAC3D;AACA,IAAM,eAAe,OAAO,eAAe,CAAC,CAAC;AAC7C,SAAS,yBAAyB,KAAK;AACtC,MAAI,eAAe,MAAO,QAAO,qBAAqB,IAAI,OAAO;AACjE,MAAI,OAAO,QAAQ,SAAU,QAAO,qBAAqB,GAAG;AAC5D,SAAO;AACR;AAEA,SAAS,eAAe,KAAK,OAAuB,oBAAI,QAAQ,GAAG;AAClE,MAAI,CAAC,OAAO,OAAO,QAAQ,SAAU,QAAO;AAC5C,MAAI,eAAe,SAAS,YAAY,OAAO,OAAO,IAAI,WAAW,YAAY;AAChF,UAAM,YAAY,IAAI,OAAO;AAC7B,QAAI,aAAa,cAAc,OAAO,OAAO,cAAc,UAAU;AACpE,UAAI,OAAO,IAAI,YAAY,SAAU,MAAK,MAAM,UAAU,YAAY,sBAAsB,IAAI,OAAO,CAAC;AACxG,UAAI,OAAO,IAAI,UAAU,SAAU,MAAK,MAAM,UAAU,UAAU,IAAI,KAAK;AAC3E,UAAI,OAAO,IAAI,SAAS,SAAU,MAAK,MAAM,UAAU,SAAS,IAAI,IAAI;AACxE,UAAI,IAAI,SAAS,KAAM,MAAK,MAAM,UAAU,UAAU,eAAe,IAAI,OAAO,IAAI,CAAC;AAAA,IACtF;AACA,WAAO,eAAe,WAAW,IAAI;AAAA,EACtC;AACA,MAAI,OAAO,QAAQ,WAAY,QAAO,YAAY,IAAI,QAAQ,WAAW;AACzE,MAAI,OAAO,QAAQ,SAAU,QAAO,IAAI,SAAS;AACjD,MAAI,OAAO,QAAQ,SAAU,QAAO;AACpC,MAAI,OAAO,WAAW,eAAe,eAAe,OAAQ,QAAO,WAAW,IAAI,MAAM;AACxF,MAAI,OAAO,eAAe,eAAe,eAAe,WAAY,QAAO,eAAe,IAAI,MAAM;AAEpG,MAAI,YAAY,GAAG,EAAG,QAAO,eAAe,IAAI,OAAO,GAAG,IAAI;AAC9D,MAAI,eAAe,WAAW,IAAI,eAAe,IAAI,YAAY,cAAc,gBAAiB,QAAO;AACvG,MAAI,OAAO,YAAY,eAAe,eAAe,QAAS,QAAO,IAAI;AACzE,MAAI,OAAO,IAAI,WAAW,WAAY,QAAO,eAAe,IAAI,OAAO,GAAG,IAAI;AAC9E,MAAI,KAAK,IAAI,GAAG,EAAG,QAAO,KAAK,IAAI,GAAG;AACtC,MAAI,MAAM,QAAQ,GAAG,GAAG;AAEvB,UAAMC,SAAQ,IAAI,MAAM,IAAI,MAAM;AAClC,SAAK,IAAI,KAAKA,MAAK;AACnB,QAAI,QAAQ,CAAC,GAAGC,OAAM;AACrB,UAAI;AACH,QAAAD,OAAMC,EAAC,IAAI,eAAe,GAAG,IAAI;AAAA,MAClC,SAAS,KAAK;AACb,QAAAD,OAAMC,EAAC,IAAI,yBAAyB,GAAG;AAAA,MACxC;AAAA,IACD,CAAC;AACD,WAAOD;AAAA,EACR,OAAO;AAGN,UAAMA,SAAQ,uBAAO,OAAO,IAAI;AAChC,SAAK,IAAI,KAAKA,MAAK;AACnB,QAAI,MAAM;AACV,WAAO,OAAO,QAAQ,cAAc;AACnC,aAAO,oBAAoB,GAAG,EAAE,QAAQ,CAAC,QAAQ;AAChD,YAAI,OAAOA,OAAO;AAClB,YAAI;AACH,UAAAA,OAAM,GAAG,IAAI,eAAe,IAAI,GAAG,GAAG,IAAI;AAAA,QAC3C,SAAS,KAAK;AAEb,iBAAOA,OAAM,GAAG;AAChB,UAAAA,OAAM,GAAG,IAAI,yBAAyB,GAAG;AAAA,QAC1C;AAAA,MACD,CAAC;AACD,YAAM,OAAO,eAAe,GAAG;AAAA,IAChC;AACA,QAAI,eAAe,MAAO,MAAK,MAAMA,OAAM,UAAU,sBAAsB,IAAI,OAAO,CAAC;AACvF,WAAOA;AAAA,EACR;AACD;AACA,SAAS,KAAKE,KAAI;AACjB,MAAI;AACH,WAAOA,IAAG;AAAA,EACX,QAAQ;AAAA,EAAC;AACV;AACA,SAAS,sBAAsB,SAAS;AACvC,SAAO,QAAQ,QAAQ,8CAA8C,IAAI,EAAE,QAAQ,0CAA0C,EAAE,EAAE,QAAQ,kCAAkC,MAAM;AAClL;AAEA,IAAM,qBAAqB,uBAAO,oBAAoB;AACtD,SAAS,gBAAgB;AACxB,QAAM,EAAE,YAAY,gBAAgB,aAAa,iBAAiB,eAAe,mBAAmB,cAAc,kBAAkB,cAAc,kBAAkB,gBAAgB,oBAAoB,gBAAgB,mBAAmB,IAAI,WAAW,kBAAkB,KAAK;AACjR,QAAM,EAAE,UAAU,aAAa,IAAI,WAAW,kBAAkB,KAAK,WAAW,WAAW,CAAC;AAC5F,SAAO;AAAA,IACN,UAAU;AAAA,IACV,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,eAAe;AAAA,IACf,cAAc;AAAA,IACd,cAAc;AAAA,IACd,gBAAgB;AAAA,IAChB,gBAAgB;AAAA,EACjB;AACD;AA6BA,SAAS,MAAM,SAAS,YAAY,YAAY;AAC/C,SAAO,IAAI,QAAQ,CAACC,aAAY,UAAUA,UAAS,OAAO,CAAC;AAC5D;AAGA,IAAI,QAAQ,IAAI,WAAW,CAAC;AAC5B,IAAI,QAAQ;AACZ,IAAI,YAAY,IAAI,WAAW,EAAE;AACjC,IAAI,YAAY,IAAI,WAAW,GAAG;AAClC,SAASC,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,QAAM,IAAI,MAAM,WAAWA,EAAC;AAC5B,YAAUA,EAAC,IAAI;AACf,YAAU,CAAC,IAAIA;AACjB;AACA,SAAS,cAAc,QAAQC,WAAU;AACvC,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,MAAI,UAAU;AACd,KAAG;AACD,UAAM,IAAI,OAAO,KAAK;AACtB,cAAU,UAAU,CAAC;AACrB,cAAU,UAAU,OAAO;AAC3B,aAAS;AAAA,EACX,SAAS,UAAU;AACnB,QAAM,eAAe,QAAQ;AAC7B,aAAW;AACX,MAAI,cAAc;AAChB,YAAQ,cAAc,CAAC;AAAA,EACzB;AACA,SAAOA,YAAW;AACpB;AACA,SAAS,WAAW,QAAQ,KAAK;AAC/B,MAAI,OAAO,OAAO,IAAK,QAAO;AAC9B,SAAO,OAAO,KAAK,MAAM;AAC3B;AACA,IAAI,eAAe,MAAM;AAAA,EACvB,YAAY,QAAQ;AAClB,SAAK,MAAM;AACX,SAAK,SAAS;AAAA,EAChB;AAAA,EACA,OAAO;AACL,WAAO,KAAK,OAAO,WAAW,KAAK,KAAK;AAAA,EAC1C;AAAA,EACA,OAAO;AACL,WAAO,KAAK,OAAO,WAAW,KAAK,GAAG;AAAA,EACxC;AAAA,EACA,QAAQ,MAAM;AACZ,UAAM,EAAE,QAAQ,IAAI,IAAI;AACxB,UAAM,MAAM,OAAO,QAAQ,MAAM,GAAG;AACpC,WAAO,QAAQ,KAAK,OAAO,SAAS;AAAA,EACtC;AACF;AAGA,SAAS,OAAO,UAAU;AACxB,QAAM,EAAE,OAAO,IAAI;AACnB,QAAM,SAAS,IAAI,aAAa,QAAQ;AACxC,QAAM,UAAU,CAAC;AACjB,MAAI,YAAY;AAChB,MAAI,eAAe;AACnB,MAAI,aAAa;AACjB,MAAI,eAAe;AACnB,MAAI,aAAa;AACjB,KAAG;AACD,UAAM,OAAO,OAAO,QAAQ,GAAG;AAC/B,UAAM,OAAO,CAAC;AACd,QAAI,SAAS;AACb,QAAI,UAAU;AACd,gBAAY;AACZ,WAAO,OAAO,MAAM,MAAM;AACxB,UAAI;AACJ,kBAAY,cAAc,QAAQ,SAAS;AAC3C,UAAI,YAAY,QAAS,UAAS;AAClC,gBAAU;AACV,UAAI,WAAW,QAAQ,IAAI,GAAG;AAC5B,uBAAe,cAAc,QAAQ,YAAY;AACjD,qBAAa,cAAc,QAAQ,UAAU;AAC7C,uBAAe,cAAc,QAAQ,YAAY;AACjD,YAAI,WAAW,QAAQ,IAAI,GAAG;AAC5B,uBAAa,cAAc,QAAQ,UAAU;AAC7C,gBAAM,CAAC,WAAW,cAAc,YAAY,cAAc,UAAU;AAAA,QACtE,OAAO;AACL,gBAAM,CAAC,WAAW,cAAc,YAAY,YAAY;AAAA,QAC1D;AAAA,MACF,OAAO;AACL,cAAM,CAAC,SAAS;AAAA,MAClB;AACA,WAAK,KAAK,GAAG;AACb,aAAO;AAAA,IACT;AACA,QAAI,CAAC,OAAQ,MAAK,IAAI;AACtB,YAAQ,KAAK,IAAI;AACjB,WAAO,MAAM,OAAO;AAAA,EACtB,SAAS,OAAO,OAAO;AACvB,SAAO;AACT;AACA,SAAS,KAAK,MAAM;AAClB,OAAK,KAAK,gBAAgB;AAC5B;AACA,SAAS,iBAAiBC,IAAGC,IAAG;AAC9B,SAAOD,GAAE,CAAC,IAAIC,GAAE,CAAC;AACnB;AAyPA,IAAI,SAAS;AACb,IAAI,gBAAgB;AACpB,IAAI,cAAc;AAClB,IAAI,gBAAgB;AACpB,IAAI,cAAc;AA+DlB,IAAI,QAAQ;AACZ,SAASC,cAAa,UAAU,QAAQ,KAAK,MAAM;AACjD,SAAO,OAAO,MAAM;AAClB,UAAM,MAAM,OAAO,OAAO,OAAO;AACjC,UAAM,MAAM,SAAS,GAAG,EAAE,MAAM,IAAI;AACpC,QAAI,QAAQ,GAAG;AACb,cAAQ;AACR,aAAO;AAAA,IACT;AACA,QAAI,MAAM,GAAG;AACX,YAAM,MAAM;AAAA,IACd,OAAO;AACL,aAAO,MAAM;AAAA,IACf;AAAA,EACF;AACA,UAAQ;AACR,SAAO,MAAM;AACf;AACA,SAAS,WAAW,UAAU,QAAQ,OAAO;AAC3C,WAASC,KAAI,QAAQ,GAAGA,KAAI,SAAS,QAAQ,QAAQA,MAAK;AACxD,QAAI,SAASA,EAAC,EAAE,MAAM,MAAM,OAAQ;AAAA,EACtC;AACA,SAAO;AACT;AACA,SAAS,WAAW,UAAU,QAAQ,OAAO;AAC3C,WAASA,KAAI,QAAQ,GAAGA,MAAK,GAAG,QAAQA,MAAK;AAC3C,QAAI,SAASA,EAAC,EAAE,MAAM,MAAM,OAAQ;AAAA,EACtC;AACA,SAAO;AACT;AAQA,SAAS,qBAAqB,UAAU,QAAQ,OAAO,KAAK;AAC1D,QAAM,EAAE,SAAS,YAAY,UAAU,IAAI;AAC3C,MAAI,MAAM;AACV,MAAI,OAAO,SAAS,SAAS;AAC7B,MAAI,QAAQ,SAAS;AACnB,QAAI,WAAW,YAAY;AACzB,cAAQ,cAAc,MAAM,SAAS,SAAS,EAAE,MAAM,MAAM;AAC5D,aAAO;AAAA,IACT;AACA,QAAI,UAAU,YAAY;AACxB,YAAM,cAAc,KAAK,IAAI;AAAA,IAC/B,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AACA,QAAM,UAAU;AAChB,QAAM,aAAa;AACnB,SAAO,MAAM,YAAYC,cAAa,UAAU,QAAQ,KAAK,IAAI;AACnE;AAQA,IAAI,gBAAgB;AACpB,IAAI,kBAAkB;AACtB,IAAI,oBAAoB;AACxB,IAAI,uBAAuB;AAiC3B,SAAS,KAAKC,MAAK;AACjB,SAAOA;AACT;AACA,SAAS,gBAAgBA,MAAK;AAC5B,MAAI;AACJ,UAAQ,KAAK,KAAKA,IAAG,GAAG,aAAa,GAAG,WAAW,OAAO,KAAKA,IAAG,EAAE,QAAQ;AAC9E;AACA,SAAS,oBAAoBA,MAAK,QAAQ;AACxC,MAAI,EAAE,MAAM,QAAQ,KAAK,IAAI;AAC7B;AACA,MAAI,OAAO,EAAG,OAAM,IAAI,MAAM,aAAa;AAC3C,MAAI,SAAS,EAAG,OAAM,IAAI,MAAM,eAAe;AAC/C,QAAM,UAAU,gBAAgBA,IAAG;AACnC,MAAI,QAAQ,QAAQ,OAAQ,QAAO,SAAS,MAAM,MAAM,MAAM,IAAI;AAClE,QAAM,WAAW,QAAQ,IAAI;AAC7B,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA,KAAKA,IAAG,EAAE;AAAA,IACV;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,EACV;AACA,MAAI,UAAU,GAAI,QAAO,SAAS,MAAM,MAAM,MAAM,IAAI;AACxD,QAAM,UAAU,SAAS,KAAK;AAC9B,MAAI,QAAQ,WAAW,EAAG,QAAO,SAAS,MAAM,MAAM,MAAM,IAAI;AAChE,QAAM,EAAE,OAAO,gBAAgB,IAAIA;AACnC,SAAO;AAAA,IACL,gBAAgB,QAAQ,aAAa,CAAC;AAAA,IACtC,QAAQ,WAAW,IAAI;AAAA,IACvB,QAAQ,aAAa;AAAA,IACrB,QAAQ,WAAW,IAAI,MAAM,QAAQ,WAAW,CAAC,IAAI;AAAA,EACvD;AACF;AAmCA,SAAS,SAAS,QAAQ,MAAM,QAAQ,MAAM;AAC5C,SAAO,EAAE,QAAQ,MAAM,QAAQ,KAAK;AACtC;AAIA,SAAS,qBAAqB,UAAUC,OAAM,MAAM,QAAQ,MAAM;AAChE,MAAI,QAAQ,qBAAqB,UAAU,QAAQA,OAAM,IAAI;AAC7D,MAAI,OAAO;AACT,aAAS,SAAS,oBAAoB,aAAa,YAAY,UAAU,QAAQ,KAAK;AAAA,EACxF,WAAW,SAAS,kBAAmB;AACvC,MAAI,UAAU,MAAM,UAAU,SAAS,OAAQ,QAAO;AACtD,SAAO;AACT;AAqBA,IAAM,yBAAyB;AAC/B,IAAM,4BAA4B;AAClC,IAAM,sBAAsB;AAAA,EAC3B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD;AACA,IAAM,aAAa,KAAK,IAAI,EAAE,SAAS,EAAE;AACzC,IAAM,gBAAgB,IAAI,OAAO,cAAc,UAAU,GAAG;AAC5D,SAAS,gBAAgB,SAAS;AAEjC,MAAI,CAAC,QAAQ,SAAS,GAAG,EAAG,QAAO,CAAC,OAAO;AAC3C,QAAM,QAAQ,+BAA+B,KAAK,QAAQ,QAAQ,YAAY,EAAE,CAAC;AACjF,MAAI,CAAC,MAAO,QAAO,CAAC,OAAO;AAC3B,MAAI,MAAM,MAAM,CAAC;AACjB,MAAI,IAAI,WAAW,QAAQ,EAAG,OAAM,IAAI,MAAM,CAAC;AAC/C,MAAI,IAAI,WAAW,OAAO,KAAK,IAAI,WAAW,QAAQ,GAAG;AACxD,UAAM,SAAS,IAAI,IAAI,GAAG;AAC1B,WAAO,aAAa,OAAO,QAAQ;AACnC,WAAO,aAAa,OAAO,UAAU;AACrC,UAAM,OAAO,WAAW,OAAO,OAAO,OAAO;AAAA,EAC9C;AACA,MAAI,IAAI,WAAW,OAAO,GAAG;AAC5B,UAAMC,aAAY,sBAAsB,KAAK,GAAG;AAChD,UAAM,IAAI,MAAMA,aAAY,IAAI,CAAC;AAAA,EAClC;AACA,MAAI,IAAI,SAAS,SAAS,EAAG,OAAM,IAAI,QAAQ,eAAe,EAAE,EAAE,QAAQ,SAAS,EAAE;AACrF,SAAO;AAAA,IACN;AAAA,IACA,MAAM,CAAC,KAAK;AAAA,IACZ,MAAM,CAAC,KAAK;AAAA,EACb;AACD;AACA,SAAS,2BAA2B,KAAK;AACxC,MAAI,OAAO,IAAI,KAAK;AACpB,MAAI,0BAA0B,KAAK,IAAI,EAAG,QAAO;AACjD,MAAI,KAAK,SAAS,SAAS,EAAG,QAAO,KAAK,QAAQ,oDAAoD,KAAK;AAG3G,MAAI,CAAC,KAAK,SAAS,GAAG,EAAG,QAAO;AAIhC,MAAI,UAAU;AACd,MAAI,eAAe;AACnB,MAAIC;AAEJ,WAASC,KAAI,GAAGA,KAAI,KAAK,QAAQA,KAAK,KAAI,KAAKA,EAAC,MAAM,KAAK;AAC1D,UAAM,oBAAoB,KAAK,MAAMA,KAAI,CAAC;AAE1C,QAAI,kBAAkB,SAAS,GAAG,KAAK,kBAAkB,UAAU,GAAG;AACrE,gBAAUA;AACV,qBAAe;AACf,MAAAD,gBAAeC,KAAI,IAAI,KAAK,MAAM,GAAGA,EAAC,IAAI;AAC1C;AAAA,IACD;AAAA,EACD;AAEA,MAAI,YAAY,MAAM,CAAC,aAAa,SAAS,GAAG,KAAK,aAAa,SAAS,EAAG,QAAO;AACrF,QAAM,CAAC,KAAK,YAAY,YAAY,IAAI,gBAAgB,YAAY;AACpE,MAAI,CAAC,OAAO,CAAC,cAAc,CAAC,aAAc,QAAO;AACjD,SAAO;AAAA,IACN,MAAM;AAAA,IACN,QAAQD,iBAAgB;AAAA,IACxB,MAAM,OAAO,SAAS,UAAU;AAAA,IAChC,QAAQ,OAAO,SAAS,YAAY;AAAA,EACrC;AACD;AACA,SAAS,iBAAiB,KAAK;AAC9B,QAAM,OAAO,IAAI,KAAK;AACtB,MAAI,CAAC,uBAAuB,KAAK,IAAI,EAAG,QAAO,2BAA2B,IAAI;AAC9E,SAAO,mBAAmB,IAAI;AAC/B;AAGA,SAAS,mBAAmB,KAAK;AAChC,MAAI,OAAO,IAAI,KAAK;AACpB,MAAI,CAAC,uBAAuB,KAAK,IAAI,EAAG,QAAO;AAC/C,MAAI,KAAK,SAAS,QAAQ,EAAG,QAAO,KAAK,QAAQ,cAAc,MAAM,EAAE,QAAQ,8BAA8B,EAAE;AAC/G,MAAI,gBAAgB,KAAK,QAAQ,QAAQ,EAAE,EAAE,QAAQ,gBAAgB,GAAG,EAAE,QAAQ,WAAW,EAAE;AAG/F,QAAM,WAAW,cAAc,MAAM,YAAY;AAEjD,kBAAgB,WAAW,cAAc,QAAQ,SAAS,CAAC,GAAG,EAAE,IAAI;AAGpE,QAAM,CAAC,KAAK,YAAY,YAAY,IAAI,gBAAgB,WAAW,SAAS,CAAC,IAAI,aAAa;AAC9F,MAAI,SAAS,YAAY,iBAAiB;AAC1C,MAAI,OAAO,OAAO,CAAC,QAAQ,aAAa,EAAE,SAAS,GAAG,IAAI,SAAS;AACnE,MAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,aAAc,QAAO;AAClD,MAAI,OAAO,WAAW,QAAQ,EAAG,UAAS,OAAO,MAAM,CAAC;AACxD,MAAI,KAAK,WAAW,SAAS,EAAG,QAAO,KAAK,MAAM,CAAC;AAEnD,SAAO,KAAK,WAAW,OAAO,KAAK,KAAK,WAAW,WAAW,IAAI,OAAO,QAAU,IAAI;AACvF,MAAI,OAAQ,UAAS,OAAO,QAAQ,8CAA8C,IAAI,EAAE,QAAQ,0CAA0C,EAAE,EAAE,QAAQ,8CAA8C,EAAE;AACtM,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,MAAM,OAAO,SAAS,UAAU;AAAA,IAChC,QAAQ,OAAO,SAAS,YAAY;AAAA,EACrC;AACD;AAQA,SAAS,gBAAgB,OAAO,UAAU,CAAC,GAAG;AAC7C,QAAM,EAAE,qBAAqB,oBAAoB,IAAI;AACrD,MAAI,SAAS,CAAC,uBAAuB,KAAK,KAAK,IAAI,0BAA0B,KAAK,IAAI,kBAAkB,KAAK;AAE7G,QAAM,cAAc,OAAO,cAAc,CAAC,MAAM,EAAE,OAAO,SAAS,mBAAmB,CAAC;AACtF,MAAI,eAAe,EAAG,UAAS,OAAO,MAAM,cAAc,CAAC;AAC3D,SAAO,OAAO,IAAI,CAACE,WAAU;AAC5B,QAAI,QAAQ,SAAU,CAAAA,OAAM,OAAO,QAAQ,SAASA,OAAM,IAAI;AAC9D,UAAMC,OAAM,QAAQ,eAAeD,OAAM,IAAI;AAC7C,QAAI,CAACC,QAAO,OAAOA,SAAQ,YAAY,CAACA,KAAI,QAAS,QAAO,aAAa,oBAAoBD,OAAM,IAAI,IAAI,OAAOA;AAClH,UAAM,WAAW,IAAI,WAAWC,MAAKD,OAAM,IAAI;AAC/C,QAAIA,OAAM,QAAQ,KAAKA,OAAM,UAAU,EAAG,QAAOA;AACjD,UAAM,WAAW,oBAAoB,UAAU;AAAA,MAC9C,MAAMA,OAAM;AAAA;AAAA,MAEZ,QAAQA,OAAM,SAAS;AAAA,IACxB,CAAC;AACD,QAAI,CAAC,SAAU,QAAOA;AACtB,UAAM,EAAE,MAAM,QAAQ,QAAQ,KAAK,IAAI;AACvC,QAAI,OAAO,UAAUA,OAAM;AAC3B,QAAI,UAAU,KAAK,IAAI,EAAG,QAAO,KAAK,MAAM,CAAC;AAC7C,QAAI,aAAa,oBAAoB,IAAI,EAAG,QAAO;AACnD,QAAI,QAAQ,QAAQ,UAAU,KAAM,QAAO;AAAA,MAC1C;AAAA,MACA,QAAQ,SAAS;AAAA,MACjB;AAAA,MACA,QAAQ,QAAQA,OAAM;AAAA,IACvB;AACA,WAAOA;AAAA,EACR,CAAC,EAAE,OAAO,CAAC,MAAM,KAAK,IAAI;AAC3B;AACA,SAAS,aAAa,oBAAoB,MAAM;AAC/C,SAAO,mBAAmB,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;AACpD;AACA,SAAS,0BAA0B,OAAO;AACzC,SAAO,MAAM,MAAM,IAAI,EAAE,IAAI,CAAC,SAAS,2BAA2B,IAAI,CAAC,EAAE,OAAO,UAAU;AAC3F;AACA,SAAS,kBAAkB,OAAO;AACjC,SAAO,MAAM,MAAM,IAAI,EAAE,IAAI,CAAC,SAAS,mBAAmB,IAAI,CAAC,EAAE,OAAO,UAAU;AACnF;AACA,SAAS,qBAAqB,GAAG,UAAU,CAAC,GAAG;AAC9C,MAAI,CAAC,KAAK,YAAY,CAAC,EAAG,QAAO,CAAC;AAClC,MAAI,YAAY,KAAK,EAAE,OAAQ,QAAO,EAAE;AACxC,QAAM,WAAW,EAAE,SAAS;AAG5B,MAAI,cAAc,OAAO,aAAa,WAAW,gBAAgB,UAAU,OAAO,IAAI,CAAC;AACvF,MAAI,CAAC,YAAY,QAAQ;AACxB,UAAM,KAAK;AACX,QAAI,GAAG,YAAY,QAAQ,GAAG,cAAc,QAAQ,GAAG,gBAAgB,KAAM,eAAc,gBAAgB,GAAG,GAAG,QAAQ,IAAI,GAAG,UAAU,IAAI,GAAG,YAAY,IAAI,OAAO;AACxK,QAAI,GAAG,aAAa,QAAQ,GAAG,QAAQ,QAAQ,GAAG,WAAW,KAAM,eAAc,gBAAgB,GAAG,GAAG,SAAS,IAAI,GAAG,IAAI,IAAI,GAAG,MAAM,IAAI,OAAO;AAAA,EACpJ;AACA,MAAI,QAAQ,YAAa,eAAc,YAAY,OAAO,CAAC,MAAM,QAAQ,YAAY,GAAG,CAAC,MAAM,KAAK;AACpG,IAAE,SAAS;AACX,SAAO;AACR;AACA,IAAM,aAAN,MAAiB;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,QAAQ,CAAC;AAAA,EACT;AAAA,EACA,YAAYC,MAAK,MAAM;AACtB,SAAK,MAAMA;AACX,UAAM,EAAE,UAAU,OAAO,QAAQ,IAAIA;AACrC,SAAK,UAAUA,KAAI;AACnB,SAAK,QAAQ,SAAS,CAAC;AACvB,SAAK,WAAW,YAAY;AAC5B,SAAK,eAAe,cAAc;AAClC,SAAK,MAAM;AACX,SAAK,mBAAmB,WAAW,CAAC,GAAG,IAAI,CAAC,MAAM,QAAU,MAAM,MAAM,KAAK,EAAE,CAAC;AAAA,EACjF;AACD;AACA,SAAS,gBAAgB;AACxB,SAAO;AAAA,IACN,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,WAAW;AAAA,EACZ;AACD;AACA,SAAS,oBAAoBA,MAAK,QAAQ;AACzC,QAAM,SAAS,oBAAoBA,MAAK,MAAM;AAC9C,MAAI,OAAO,UAAU,KAAM,QAAO;AAClC,SAAO;AACR;;;;AC/sDA,SAAS,SAAS,MAAM;AACvB,QAAM,QAAQ,CAAC,KAAK,IAAI;AACxB,MAAI,UAAU;AACd,SAAO,SAAS,OAAO;AACtB,cAAU,QAAQ;AAClB,QAAI,SAAS,KAAM,OAAM,QAAQ,QAAQ,IAAI;AAAA,EAC9C;AACA,MAAI,YAAY,KAAK,KAAM,OAAM,QAAQ,KAAK,KAAK,IAAI;AACvD,SAAO;AACR;;AAUA,SAAS,eAAe,OAAO,YAAY,OAAO;AACjD,SAAO,MAAM,OAAO,CAAC,SAAS,SAAS,MAAM,EAAE,KAAK,SAAS;AAC9D;;;ACQA,IAAM,cAAc;AACpB,IAAM,cAAc;AACpB,IAAM,aAAa;AAQnB,IAAM,OAAN,MAAW;AAAA,EACV;AAAA,EACA;AAAA,EACA,YAAY,IAAI,MAAM;AACrB,SAAK,CAAC,IAAI;AACV,SAAK,CAAC,IAAI;AAAA,EACX;AACD;AAQA,SAAS,kBAAkB,OAAO,OAAO;AAExC,MAAI,CAAC,SAAS,CAAC,SAAS,MAAM,OAAO,CAAC,MAAM,MAAM,OAAO,CAAC,EAAG,QAAO;AAGpE,MAAI,aAAa;AACjB,MAAI,aAAa,KAAK,IAAI,MAAM,QAAQ,MAAM,MAAM;AACpD,MAAI,aAAa;AACjB,MAAI,eAAe;AACnB,SAAO,aAAa,YAAY;AAC/B,QAAI,MAAM,UAAU,cAAc,UAAU,MAAM,MAAM,UAAU,cAAc,UAAU,GAAG;AAC5F,mBAAa;AACb,qBAAe;AAAA,IAChB,MAAO,cAAa;AACpB,iBAAa,KAAK,OAAO,aAAa,cAAc,IAAI,UAAU;AAAA,EACnE;AACA,SAAO;AACR;AAOA,SAAS,kBAAkB,OAAO,OAAO;AAExC,MAAI,CAAC,SAAS,CAAC,SAAS,MAAM,OAAO,MAAM,SAAS,CAAC,MAAM,MAAM,OAAO,MAAM,SAAS,CAAC,EAAG,QAAO;AAGlG,MAAI,aAAa;AACjB,MAAI,aAAa,KAAK,IAAI,MAAM,QAAQ,MAAM,MAAM;AACpD,MAAI,aAAa;AACjB,MAAI,aAAa;AACjB,SAAO,aAAa,YAAY;AAC/B,QAAI,MAAM,UAAU,MAAM,SAAS,YAAY,MAAM,SAAS,UAAU,MAAM,MAAM,UAAU,MAAM,SAAS,YAAY,MAAM,SAAS,UAAU,GAAG;AACpJ,mBAAa;AACb,mBAAa;AAAA,IACd,MAAO,cAAa;AACpB,iBAAa,KAAK,OAAO,aAAa,cAAc,IAAI,UAAU;AAAA,EACnE;AACA,SAAO;AACR;AASA,SAAS,oBAAoB,OAAO,OAAO;AAE1C,QAAM,eAAe,MAAM;AAC3B,QAAM,eAAe,MAAM;AAE3B,MAAI,iBAAiB,KAAK,iBAAiB,EAAG,QAAO;AAErD,MAAI,eAAe,aAAc,SAAQ,MAAM,UAAU,eAAe,YAAY;AAAA,WAC3E,eAAe,aAAc,SAAQ,MAAM,UAAU,GAAG,YAAY;AAC7E,QAAM,cAAc,KAAK,IAAI,cAAc,YAAY;AAEvD,MAAI,UAAU,MAAO,QAAO;AAI5B,MAAI,OAAO;AACX,MAAI,SAAS;AACb,SAAO,MAAM;AACZ,UAAM,UAAU,MAAM,UAAU,cAAc,MAAM;AACpD,UAAMC,SAAQ,MAAM,QAAQ,OAAO;AACnC,QAAIA,WAAU,GAAI,QAAO;AACzB,cAAUA;AACV,QAAIA,WAAU,KAAK,MAAM,UAAU,cAAc,MAAM,MAAM,MAAM,UAAU,GAAG,MAAM,GAAG;AACxF,aAAO;AACP;AAAA,IACD;AAAA,EACD;AACD;AAKA,SAAS,qBAAqB,OAAO;AACpC,MAAI,UAAU;AACd,QAAM,aAAa,CAAC;AACpB,MAAI,mBAAmB;AAEvB,MAAI,eAAe;AAEnB,MAAI,UAAU;AAEd,MAAI,qBAAqB;AACzB,MAAI,oBAAoB;AAExB,MAAI,qBAAqB;AACzB,MAAI,oBAAoB;AACxB,SAAO,UAAU,MAAM,QAAQ;AAC9B,QAAI,MAAM,OAAO,EAAE,CAAC,MAAM,YAAY;AAErC,iBAAW,kBAAkB,IAAI;AACjC,2BAAqB;AACrB,0BAAoB;AACpB,2BAAqB;AACrB,0BAAoB;AACpB,qBAAe,MAAM,OAAO,EAAE,CAAC;AAAA,IAChC,OAAO;AAEN,UAAI,MAAM,OAAO,EAAE,CAAC,MAAM,YAAa,uBAAsB,MAAM,OAAO,EAAE,CAAC,EAAE;AAAA,UAC1E,sBAAqB,MAAM,OAAO,EAAE,CAAC,EAAE;AAG5C,UAAI,gBAAgB,aAAa,UAAU,KAAK,IAAI,oBAAoB,iBAAiB,KAAK,aAAa,UAAU,KAAK,IAAI,oBAAoB,iBAAiB,GAAG;AAErK,cAAM,OAAO,WAAW,mBAAmB,CAAC,GAAG,GAAG,IAAI,KAAK,aAAa,YAAY,CAAC;AAErF,cAAM,WAAW,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI;AAEjD;AAEA;AACA,kBAAU,mBAAmB,IAAI,WAAW,mBAAmB,CAAC,IAAI;AACpE,6BAAqB;AACrB,4BAAoB;AACpB,6BAAqB;AACrB,4BAAoB;AACpB,uBAAe;AACf,kBAAU;AAAA,MACX;AAAA,IACD;AACA;AAAA,EACD;AAEA,MAAI,QAAS,mBAAkB,KAAK;AACpC,+BAA6B,KAAK;AAOlC,YAAU;AACV,SAAO,UAAU,MAAM,QAAQ;AAC9B,QAAI,MAAM,UAAU,CAAC,EAAE,CAAC,MAAM,eAAe,MAAM,OAAO,EAAE,CAAC,MAAM,aAAa;AAC/E,YAAM,WAAW,MAAM,UAAU,CAAC,EAAE,CAAC;AACrC,YAAM,YAAY,MAAM,OAAO,EAAE,CAAC;AAClC,YAAM,kBAAkB,oBAAoB,UAAU,SAAS;AAC/D,YAAM,kBAAkB,oBAAoB,WAAW,QAAQ;AAC/D,UAAI,mBAAmB,iBAAiB;AACvC,YAAI,mBAAmB,SAAS,SAAS,KAAK,mBAAmB,UAAU,SAAS,GAAG;AAEtF,gBAAM,OAAO,SAAS,GAAG,IAAI,KAAK,YAAY,UAAU,UAAU,GAAG,eAAe,CAAC,CAAC;AACtF,gBAAM,UAAU,CAAC,EAAE,CAAC,IAAI,SAAS,UAAU,GAAG,SAAS,SAAS,eAAe;AAC/E,gBAAM,UAAU,CAAC,EAAE,CAAC,IAAI,UAAU,UAAU,eAAe;AAC3D;AAAA,QACD;AAAA,MACD,WAAW,mBAAmB,SAAS,SAAS,KAAK,mBAAmB,UAAU,SAAS,GAAG;AAG7F,cAAM,OAAO,SAAS,GAAG,IAAI,KAAK,YAAY,SAAS,UAAU,GAAG,eAAe,CAAC,CAAC;AACrF,cAAM,UAAU,CAAC,EAAE,CAAC,IAAI;AACxB,cAAM,UAAU,CAAC,EAAE,CAAC,IAAI,UAAU,UAAU,GAAG,UAAU,SAAS,eAAe;AACjF,cAAM,UAAU,CAAC,EAAE,CAAC,IAAI;AACxB,cAAM,UAAU,CAAC,EAAE,CAAC,IAAI,SAAS,UAAU,eAAe;AAC1D;AAAA,MACD;AACA;AAAA,IACD;AACA;AAAA,EACD;AACD;AAEA,IAAM,wBAAwB;AAC9B,IAAM,mBAAmB;AACzB,IAAM,kBAAkB;AACxB,IAAM,qBAAqB;AAC3B,IAAM,uBAAuB;AAO7B,SAAS,6BAA6B,OAAO;AAC5C,MAAI,UAAU;AAEd,SAAO,UAAU,MAAM,SAAS,GAAG;AAClC,QAAI,MAAM,UAAU,CAAC,EAAE,CAAC,MAAM,cAAc,MAAM,UAAU,CAAC,EAAE,CAAC,MAAM,YAAY;AAEjF,UAAI,YAAY,MAAM,UAAU,CAAC,EAAE,CAAC;AACpC,UAAI,OAAO,MAAM,OAAO,EAAE,CAAC;AAC3B,UAAI,YAAY,MAAM,UAAU,CAAC,EAAE,CAAC;AAEpC,YAAM,eAAe,kBAAkB,WAAW,IAAI;AACtD,UAAI,cAAc;AACjB,cAAM,eAAe,KAAK,UAAU,KAAK,SAAS,YAAY;AAC9D,oBAAY,UAAU,UAAU,GAAG,UAAU,SAAS,YAAY;AAClE,eAAO,eAAe,KAAK,UAAU,GAAG,KAAK,SAAS,YAAY;AAClE,oBAAY,eAAe;AAAA,MAC5B;AAEA,UAAI,gBAAgB;AACpB,UAAI,WAAW;AACf,UAAI,gBAAgB;AACpB,UAAI,YAAY,2BAA2B,WAAW,IAAI,IAAI,2BAA2B,MAAM,SAAS;AACxG,aAAO,KAAK,OAAO,CAAC,MAAM,UAAU,OAAO,CAAC,GAAG;AAC9C,qBAAa,KAAK,OAAO,CAAC;AAC1B,eAAO,KAAK,UAAU,CAAC,IAAI,UAAU,OAAO,CAAC;AAC7C,oBAAY,UAAU,UAAU,CAAC;AACjC,cAAM,QAAQ,2BAA2B,WAAW,IAAI,IAAI,2BAA2B,MAAM,SAAS;AAEtG,YAAI,SAAS,WAAW;AACvB,sBAAY;AACZ,0BAAgB;AAChB,qBAAW;AACX,0BAAgB;AAAA,QACjB;AAAA,MACD;AACA,UAAI,MAAM,UAAU,CAAC,EAAE,CAAC,MAAM,eAAe;AAE5C,YAAI,cAAe,OAAM,UAAU,CAAC,EAAE,CAAC,IAAI;AAAA,aACtC;AACJ,gBAAM,OAAO,UAAU,GAAG,CAAC;AAC3B;AAAA,QACD;AACA,cAAM,OAAO,EAAE,CAAC,IAAI;AACpB,YAAI,cAAe,OAAM,UAAU,CAAC,EAAE,CAAC,IAAI;AAAA,aACtC;AACJ,gBAAM,OAAO,UAAU,GAAG,CAAC;AAC3B;AAAA,QACD;AAAA,MACD;AAAA,IACD;AACA;AAAA,EACD;AACD;AAMA,SAAS,kBAAkB,OAAO;AAEjC,QAAM,KAAK,IAAI,KAAK,YAAY,EAAE,CAAC;AACnC,MAAI,UAAU;AACd,MAAI,eAAe;AACnB,MAAI,eAAe;AACnB,MAAI,cAAc;AAClB,MAAI,cAAc;AAClB,MAAI;AACJ,SAAO,UAAU,MAAM,OAAQ,SAAQ,MAAM,OAAO,EAAE,CAAC,GAAG;AAAA,IACzD,KAAK;AACJ;AACA,qBAAe,MAAM,OAAO,EAAE,CAAC;AAC/B;AACA;AAAA,IACD,KAAK;AACJ;AACA,qBAAe,MAAM,OAAO,EAAE,CAAC;AAC/B;AACA;AAAA,IACD,KAAK;AAEJ,UAAI,eAAe,eAAe,GAAG;AACpC,YAAI,iBAAiB,KAAK,iBAAiB,GAAG;AAE7C,yBAAe,kBAAkB,aAAa,WAAW;AACzD,cAAI,iBAAiB,GAAG;AACvB,gBAAI,UAAU,eAAe,eAAe,KAAK,MAAM,UAAU,eAAe,eAAe,CAAC,EAAE,CAAC,MAAM,WAAY,OAAM,UAAU,eAAe,eAAe,CAAC,EAAE,CAAC,KAAK,YAAY,UAAU,GAAG,YAAY;AAAA,iBAC5M;AACJ,oBAAM,OAAO,GAAG,GAAG,IAAI,KAAK,YAAY,YAAY,UAAU,GAAG,YAAY,CAAC,CAAC;AAC/E;AAAA,YACD;AACA,0BAAc,YAAY,UAAU,YAAY;AAChD,0BAAc,YAAY,UAAU,YAAY;AAAA,UACjD;AAEA,yBAAe,kBAAkB,aAAa,WAAW;AACzD,cAAI,iBAAiB,GAAG;AACvB,kBAAM,OAAO,EAAE,CAAC,IAAI,YAAY,UAAU,YAAY,SAAS,YAAY,IAAI,MAAM,OAAO,EAAE,CAAC;AAC/F,0BAAc,YAAY,UAAU,GAAG,YAAY,SAAS,YAAY;AACxE,0BAAc,YAAY,UAAU,GAAG,YAAY,SAAS,YAAY;AAAA,UACzE;AAAA,QACD;AAEA,mBAAW,eAAe;AAC1B,cAAM,OAAO,SAAS,eAAe,YAAY;AACjD,YAAI,YAAY,QAAQ;AACvB,gBAAM,OAAO,SAAS,GAAG,IAAI,KAAK,aAAa,WAAW,CAAC;AAC3D;AAAA,QACD;AACA,YAAI,YAAY,QAAQ;AACvB,gBAAM,OAAO,SAAS,GAAG,IAAI,KAAK,aAAa,WAAW,CAAC;AAC3D;AAAA,QACD;AACA;AAAA,MACD,WAAW,YAAY,KAAK,MAAM,UAAU,CAAC,EAAE,CAAC,MAAM,YAAY;AAEjE,cAAM,UAAU,CAAC,EAAE,CAAC,KAAK,MAAM,OAAO,EAAE,CAAC;AACzC,cAAM,OAAO,SAAS,CAAC;AAAA,MACxB,MAAO;AACP,qBAAe;AACf,qBAAe;AACf,oBAAc;AACd,oBAAc;AAAA,EAChB;AACA,MAAI,MAAM,GAAG,EAAE,IAAI,CAAC,MAAM,GAAI,OAAM,IAAI;AAIxC,MAAI,UAAU;AACd,YAAU;AAEV,SAAO,UAAU,MAAM,SAAS,GAAG;AAClC,QAAI,MAAM,UAAU,CAAC,EAAE,CAAC,MAAM,cAAc,MAAM,UAAU,CAAC,EAAE,CAAC,MAAM,YAAY;AAEjF,UAAI,MAAM,OAAO,EAAE,CAAC,EAAE,UAAU,MAAM,OAAO,EAAE,CAAC,EAAE,SAAS,MAAM,UAAU,CAAC,EAAE,CAAC,EAAE,MAAM,MAAM,MAAM,UAAU,CAAC,EAAE,CAAC,GAAG;AAEnH,cAAM,OAAO,EAAE,CAAC,IAAI,MAAM,UAAU,CAAC,EAAE,CAAC,IAAI,MAAM,OAAO,EAAE,CAAC,EAAE,UAAU,GAAG,MAAM,OAAO,EAAE,CAAC,EAAE,SAAS,MAAM,UAAU,CAAC,EAAE,CAAC,EAAE,MAAM;AAClI,cAAM,UAAU,CAAC,EAAE,CAAC,IAAI,MAAM,UAAU,CAAC,EAAE,CAAC,IAAI,MAAM,UAAU,CAAC,EAAE,CAAC;AACpE,cAAM,OAAO,UAAU,GAAG,CAAC;AAC3B,kBAAU;AAAA,MACX,WAAW,MAAM,OAAO,EAAE,CAAC,EAAE,UAAU,GAAG,MAAM,UAAU,CAAC,EAAE,CAAC,EAAE,MAAM,MAAM,MAAM,UAAU,CAAC,EAAE,CAAC,GAAG;AAElG,cAAM,UAAU,CAAC,EAAE,CAAC,KAAK,MAAM,UAAU,CAAC,EAAE,CAAC;AAC7C,cAAM,OAAO,EAAE,CAAC,IAAI,MAAM,OAAO,EAAE,CAAC,EAAE,UAAU,MAAM,UAAU,CAAC,EAAE,CAAC,EAAE,MAAM,IAAI,MAAM,UAAU,CAAC,EAAE,CAAC;AACpG,cAAM,OAAO,UAAU,GAAG,CAAC;AAC3B,kBAAU;AAAA,MACX;AAAA,IACD;AACA;AAAA,EACD;AAEA,MAAI,QAAS,mBAAkB,KAAK;AACrC;AAWA,SAAS,2BAA2B,KAAK,KAAK;AAC7C,MAAI,CAAC,OAAO,CAAC;AAEb,WAAO;AAMP,QAAM,QAAQ,IAAI,OAAO,IAAI,SAAS,CAAC;AACvC,QAAM,QAAQ,IAAI,OAAO,CAAC;AAC1B,QAAM,mBAAmB,MAAM,MAAM,qBAAqB;AAC1D,QAAM,mBAAmB,MAAM,MAAM,qBAAqB;AAC1D,QAAM,cAAc,oBAAoB,MAAM,MAAM,gBAAgB;AACpE,QAAM,cAAc,oBAAoB,MAAM,MAAM,gBAAgB;AACpE,QAAM,aAAa,eAAe,MAAM,MAAM,eAAe;AAC7D,QAAM,aAAa,eAAe,MAAM,MAAM,eAAe;AAC7D,QAAM,aAAa,cAAc,IAAI,MAAM,kBAAkB;AAC7D,QAAM,aAAa,cAAc,IAAI,MAAM,oBAAoB;AAC/D,MAAI,cAAc;AAElB,WAAO;AAAA,WACE,cAAc;AAEvB,WAAO;AAAA,WACE,oBAAoB,CAAC,eAAe;AAE7C,WAAO;AAAA,WACE,eAAe;AAExB,WAAO;AAAA,WACE,oBAAoB;AAE7B,WAAO;AACP,SAAO;AACR;AAQA,IAAM,kBAAkB;AACxB,IAAM,kBAAkB;AAExB,SAAS,qBAAqB,MAAM,wBAAwB;AAC3D,SAAO,KAAK,QAAQ,QAAQ,CAAC,UAAU,uBAAuB,KAAK,CAAC;AACrE;AACA,SAAS,cAAc,MAAM,eAAe,OAAO,WAAW,wBAAwB,iCAAiC;AACtH,SAAO,KAAK,WAAW,IAAI,MAAM,GAAG,SAAS,IAAI,qBAAqB,MAAM,sBAAsB,CAAC,EAAE,IAAI,cAAc,MAAM,MAAM,SAAS,IAAI,iBAAiB,gCAAgC,WAAW,IAAI,MAAM,GAAG,SAAS,IAAI,+BAA+B,EAAE,IAAI;AAC5Q;AACA,SAAS,gBAAgB,MAAM,eAAe,EAAE,QAAQ,YAAY,8BAA8B,gCAAgC,GAAG;AACpI,SAAO,cAAc,MAAM,eAAe,QAAQ,YAAY,8BAA8B,+BAA+B;AAC5H;AACA,SAAS,gBAAgB,MAAM,eAAe,EAAE,QAAQ,YAAY,8BAA8B,gCAAgC,GAAG;AACpI,SAAO,cAAc,MAAM,eAAe,QAAQ,YAAY,8BAA8B,+BAA+B;AAC5H;AACA,SAAS,gBAAgB,MAAM,eAAe,EAAE,aAAa,iBAAiB,8BAA8B,gCAAgC,GAAG;AAC9I,SAAO,cAAc,MAAM,eAAe,aAAa,iBAAiB,8BAA8B,+BAA+B;AACtI;AAEA,SAAS,gBAAgB,QAAQ,MAAM,QAAQ,MAAM,EAAE,WAAW,GAAG;AACpE,SAAO,WAAW,OAAO,SAAS,CAAC,IAAI,OAAO,MAAM,KAAK,SAAS,CAAC,IAAI,OAAO,MAAM,KAAK;AAC1F;AAKA,SAAS,yBAAyB,OAAO,SAAS;AACjD,QAAM,UAAU,MAAM;AACtB,QAAM,gBAAgB,QAAQ;AAC9B,QAAM,iBAAiB,gBAAgB;AAEvC,MAAI,UAAU;AACd,MAAI,wBAAwB;AAC5B,MAAI,0BAA0B;AAC9B,MAAIC,KAAI;AACR,SAAOA,OAAM,SAAS;AACrB,UAAM,SAASA;AACf,WAAOA,OAAM,WAAW,MAAMA,EAAC,EAAE,CAAC,MAAM,WAAY,CAAAA,MAAK;AACzD,QAAI,WAAWA,GAAG,KAAI,WAAW,GAAG;AAEnC,UAAIA,KAAI,eAAe;AACtB,mBAAWA,KAAI;AACf,gCAAwB;AAAA,MACzB;AAAA,IACD,WAAWA,OAAM,SAAS;AAEzB,YAAMC,KAAID,KAAI;AACd,UAAIC,KAAI,eAAe;AACtB,mBAAWA,KAAI;AACf,gCAAwB;AAAA,MACzB;AAAA,IACD,OAAO;AAEN,YAAMA,KAAID,KAAI;AACd,UAAIC,KAAI,gBAAgB;AACvB,mBAAWA,KAAI;AACf,mCAA2B;AAAA,MAC5B;AAAA,IACD;AACA,WAAOD,OAAM,WAAW,MAAMA,EAAC,EAAE,CAAC,MAAM,WAAY,CAAAA,MAAK;AAAA,EAC1D;AACA,QAAM,WAAW,4BAA4B,KAAK;AAClD,MAAI,4BAA4B,EAAG,YAAW,0BAA0B;AAAA,WAC/D,sBAAuB,YAAW;AAC3C,QAAM,QAAQ,UAAU;AACxB,QAAM,QAAQ,CAAC;AACf,MAAI,aAAa;AACjB,MAAI,SAAU,OAAM,KAAK,EAAE;AAE3B,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,OAAO;AACX,MAAI,OAAO;AACX,QAAM,iBAAiB,CAAC,SAAS;AAChC,UAAM,IAAI,MAAM;AAChB,UAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,MAAM,OAAO,OAAO,CAAC;AACjE,YAAQ;AACR,YAAQ;AAAA,EACT;AACA,QAAM,iBAAiB,CAAC,SAAS;AAChC,UAAM,IAAI,MAAM;AAChB,UAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,MAAM,OAAO,OAAO,CAAC;AACjE,YAAQ;AAAA,EACT;AACA,QAAM,iBAAiB,CAAC,SAAS;AAChC,UAAM,IAAI,MAAM;AAChB,UAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,MAAM,OAAO,OAAO,CAAC;AACjE,YAAQ;AAAA,EACT;AAEA,EAAAA,KAAI;AACJ,SAAOA,OAAM,SAAS;AACrB,QAAI,SAASA;AACb,WAAOA,OAAM,WAAW,MAAMA,EAAC,EAAE,CAAC,MAAM,WAAY,CAAAA,MAAK;AACzD,QAAI,WAAWA,GAAG,KAAI,WAAW,GAAG;AAEnC,UAAIA,KAAI,eAAe;AACtB,iBAASA,KAAI;AACb,iBAAS;AACT,iBAAS;AACT,eAAO;AACP,eAAO;AAAA,MACR;AACA,eAAS,UAAU,QAAQ,YAAYA,IAAG,WAAW,EAAG,gBAAe,MAAM,OAAO,EAAE,CAAC,CAAC;AAAA,IACzF,WAAWA,OAAM,SAAS;AAEzB,YAAM,OAAOA,KAAI,SAAS,gBAAgB,SAAS,gBAAgBA;AACnE,eAAS,UAAU,QAAQ,YAAY,MAAM,WAAW,EAAG,gBAAe,MAAM,OAAO,EAAE,CAAC,CAAC;AAAA,IAC5F,OAAO;AAEN,YAAM,UAAUA,KAAI;AACpB,UAAI,UAAU,gBAAgB;AAC7B,cAAM,OAAO,SAAS;AACtB,iBAAS,UAAU,QAAQ,YAAY,MAAM,WAAW,EAAG,gBAAe,MAAM,OAAO,EAAE,CAAC,CAAC;AAC3F,cAAM,UAAU,IAAI,gBAAgB,QAAQ,MAAM,QAAQ,MAAM,OAAO;AACvE,qBAAa,MAAM;AACnB,cAAM,KAAK,EAAE;AACb,cAAM,QAAQ,UAAU;AACxB,iBAAS,OAAO;AAChB,iBAAS,OAAO;AAChB,eAAO;AACP,eAAO;AACP,iBAAS,UAAUA,KAAI,eAAe,YAAYA,IAAG,WAAW,EAAG,gBAAe,MAAM,OAAO,EAAE,CAAC,CAAC;AAAA,MACpG,MAAO,UAAS,UAAU,QAAQ,YAAYA,IAAG,WAAW,EAAG,gBAAe,MAAM,OAAO,EAAE,CAAC,CAAC;AAAA,IAChG;AACA,WAAOA,OAAM,WAAW,MAAMA,EAAC,EAAE,CAAC,MAAM,aAAa;AACpD,qBAAe,MAAMA,EAAC,EAAE,CAAC,CAAC;AAC1B,MAAAA,MAAK;AAAA,IACN;AACA,WAAOA,OAAM,WAAW,MAAMA,EAAC,EAAE,CAAC,MAAM,aAAa;AACpD,qBAAe,MAAMA,EAAC,EAAE,CAAC,CAAC;AAC1B,MAAAA,MAAK;AAAA,IACN;AAAA,EACD;AACA,MAAI,SAAU,OAAM,UAAU,IAAI,gBAAgB,QAAQ,MAAM,QAAQ,MAAM,OAAO;AACrF,SAAO,MAAM,KAAK,IAAI;AACvB;AAKA,SAAS,uBAAuB,OAAO,SAAS;AAC/C,SAAO,MAAM,IAAI,CAACE,OAAMF,IAAGG,WAAU;AACpC,UAAM,OAAOD,MAAK,CAAC;AACnB,UAAM,gBAAgBF,OAAM,KAAKA,OAAMG,OAAM,SAAS;AACtD,YAAQD,MAAK,CAAC,GAAG;AAAA,MAChB,KAAK;AAAa,eAAO,gBAAgB,MAAM,eAAe,OAAO;AAAA,MACrE,KAAK;AAAa,eAAO,gBAAgB,MAAM,eAAe,OAAO;AAAA,MACrE;AAAS,eAAO,gBAAgB,MAAM,eAAe,OAAO;AAAA,IAC7D;AAAA,EACD,CAAC,EAAE,KAAK,IAAI;AACb;AAEA,IAAM,UAAU,CAACE,YAAWA;AAC5B,IAAM,uBAAuB;AAC7B,IAAM,kCAAkC;AACxC,SAAS,oBAAoB;AAC5B,SAAO;AAAA,IACN,aAAa;AAAA,IACb,QAAQ,EAAE;AAAA,IACV,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,QAAQ,EAAE;AAAA,IACV,YAAY;AAAA,IACZ,aAAa,EAAE;AAAA,IACf,8BAA8B;AAAA,IAC9B,aAAa,EAAE;AAAA,IACf,iBAAiB;AAAA,IACjB,8BAA8B;AAAA,IAC9B,aAAa;AAAA,IACb,cAAc;AAAA,IACd,iCAAiC;AAAA,IACjC,QAAQ;AAAA,IACR,qBAAqB;AAAA,IACrB,qBAAqB;AAAA,IACrB,YAAY,EAAE;AAAA,IACd,qBAAqB;AAAA,IACrB,mBAAmB;AAAA,IACnB,oBAAoB;AAAA,IACpB,yBAAyB;AAAA,EAC1B;AACD;AACA,SAAS,eAAe,aAAa;AACpC,SAAO,eAAe,OAAO,gBAAgB,aAAa,cAAc;AACzE;AACA,SAAS,gBAAgB,cAAc;AACtC,SAAO,OAAO,iBAAiB,YAAY,OAAO,cAAc,YAAY,KAAK,gBAAgB,IAAI,eAAe;AACrH;AAEA,SAAS,qBAAqB,UAAU,CAAC,GAAG;AAC3C,SAAO;AAAA,IACN,GAAG,kBAAkB;AAAA,IACrB,GAAG;AAAA,IACH,aAAa,eAAe,QAAQ,WAAW;AAAA,IAC/C,cAAc,gBAAgB,QAAQ,YAAY;AAAA,EACnD;AACD;AAEA,SAAS,cAAc,OAAO;AAC7B,SAAO,MAAM,WAAW,KAAK,MAAM,CAAC,EAAE,WAAW;AAClD;AACA,SAAS,aAAa,OAAO;AAC5B,MAAIC,KAAI;AACR,MAAIC,KAAI;AACR,QAAM,QAAQ,CAACJ,UAAS;AACvB,YAAQA,MAAK,CAAC,GAAG;AAAA,MAChB,KAAK;AACJ,QAAAG,MAAK;AACL;AAAA,MACD,KAAK;AAAa,QAAAC,MAAK;AAAA,IACxB;AAAA,EACD,CAAC;AACD,SAAO;AAAA,IACN,GAAAD;AAAA,IACA,GAAAC;AAAA,EACD;AACD;AACA,SAAS,gBAAgB,EAAE,aAAa,QAAQ,YAAY,aAAa,QAAQ,YAAY,qBAAqB,oBAAoB,GAAG,cAAc;AACtJ,MAAI,oBAAqB,QAAO;AAChC,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,MAAI,qBAAqB;AACxB,UAAM,SAAS,OAAO,aAAa,CAAC;AACpC,UAAM,SAAS,OAAO,aAAa,CAAC;AAEpC,UAAM,yBAAyB,YAAY,SAAS,YAAY;AAChE,UAAM,qBAAqB,IAAI,OAAO,KAAK,IAAI,GAAG,sBAAsB,CAAC;AACzE,UAAM,qBAAqB,IAAI,OAAO,KAAK,IAAI,GAAG,CAAC,sBAAsB,CAAC;AAE1E,UAAM,oBAAoB,OAAO,SAAS,OAAO;AACjD,UAAM,gBAAgB,IAAI,OAAO,KAAK,IAAI,GAAG,iBAAiB,CAAC;AAC/D,UAAM,gBAAgB,IAAI,OAAO,KAAK,IAAI,GAAG,CAAC,iBAAiB,CAAC;AAChE,YAAQ,GAAG,kBAAkB,KAAK,UAAU,IAAI,aAAa,GAAG,MAAM;AACtE,YAAQ,GAAG,kBAAkB,KAAK,UAAU,IAAI,aAAa,GAAG,MAAM;AAAA,EACvE;AACA,QAAMD,KAAI,GAAG,UAAU,IAAI,WAAW,GAAG,KAAK;AAC9C,QAAMC,KAAI,GAAG,UAAU,IAAI,WAAW,GAAG,KAAK;AAC9C,SAAO,GAAG,OAAOD,EAAC,CAAC;AAAA,EAAK,OAAOC,EAAC,CAAC;AAAA;AAAA;AAClC;AACA,SAAS,eAAe,OAAO,WAAW,SAAS;AAClD,SAAO,gBAAgB,SAAS,aAAa,KAAK,CAAC,KAAK,QAAQ,SAAS,uBAAuB,OAAO,OAAO,IAAI,yBAAyB,OAAO,OAAO,MAAM,YAAY,QAAQ,wBAAwB;AAAA,EAAK,QAAQ,kBAAkB,EAAE,IAAI;AACjP;AAEA,SAAS,iBAAiB,QAAQ,QAAQ,SAAS;AAClD,QAAM,oBAAoB,qBAAqB,OAAO;AACtD,QAAM,CAAC,OAAO,SAAS,IAAI,aAAa,cAAc,MAAM,IAAI,CAAC,IAAI,QAAQ,cAAc,MAAM,IAAI,CAAC,IAAI,QAAQ,iBAAiB;AACnI,SAAO,eAAe,OAAO,WAAW,iBAAiB;AAC1D;AAIA,SAAS,kBAAkB,eAAe,eAAe,eAAe,eAAe,SAAS;AAC/F,MAAI,cAAc,aAAa,KAAK,cAAc,aAAa,GAAG;AACjE,oBAAgB,CAAC;AACjB,oBAAgB,CAAC;AAAA,EAClB;AACA,MAAI,cAAc,aAAa,KAAK,cAAc,aAAa,GAAG;AACjE,oBAAgB,CAAC;AACjB,oBAAgB,CAAC;AAAA,EAClB;AACA,MAAI,cAAc,WAAW,cAAc,UAAU,cAAc,WAAW,cAAc;AAE5F,WAAO,iBAAiB,eAAe,eAAe,OAAO;AAC7D,QAAM,CAAC,OAAO,SAAS,IAAI,aAAa,eAAe,eAAe,OAAO;AAE7E,MAAI,SAAS;AACb,MAAI,SAAS;AACb,QAAM,QAAQ,CAACJ,UAAS;AACvB,YAAQA,MAAK,CAAC,GAAG;AAAA,MAChB,KAAK;AACJ,QAAAA,MAAK,CAAC,IAAI,cAAc,MAAM;AAC9B,kBAAU;AACV;AAAA,MACD,KAAK;AACJ,QAAAA,MAAK,CAAC,IAAI,cAAc,MAAM;AAC9B,kBAAU;AACV;AAAA,MACD;AACC,QAAAA,MAAK,CAAC,IAAI,cAAc,MAAM;AAC9B,kBAAU;AACV,kBAAU;AAAA,IACZ;AAAA,EACD,CAAC;AACD,SAAO,eAAe,OAAO,WAAW,qBAAqB,OAAO,CAAC;AACtE;AAEA,SAAS,aAAa,QAAQ,QAAQ,SAAS;AAC9C,QAAMK,YAAW,SAAS,qBAAqB;AAC/C,QAAM,oBAAoB,KAAK,IAAI,KAAK,MAAM,SAAS,qBAAqB,CAAC,GAAG,CAAC;AACjF,QAAM,UAAUA,YAAW,KAAK,IAAI,OAAO,QAAQ,iBAAiB,IAAI,OAAO;AAC/E,QAAM,UAAUA,YAAW,KAAK,IAAI,OAAO,QAAQ,iBAAiB,IAAI,OAAO;AAC/E,QAAM,YAAY,YAAY,OAAO,UAAU,YAAY,OAAO;AAClE,QAAM,WAAW,CAACC,SAAQC,YAAW,OAAOD,OAAM,MAAM,OAAOC,OAAM;AACrE,QAAM,QAAQ,CAAC;AACf,MAAI,SAAS;AACb,MAAI,SAAS;AACb,QAAM,mBAAmB,CAAC,SAAS,SAAS,YAAY;AACvD,WAAO,WAAW,SAAS,UAAU,EAAG,OAAM,KAAK,IAAI,KAAK,aAAa,OAAO,MAAM,CAAC,CAAC;AACxF,WAAO,WAAW,SAAS,UAAU,EAAG,OAAM,KAAK,IAAI,KAAK,aAAa,OAAO,MAAM,CAAC,CAAC;AACxF,WAAO,YAAY,GAAG,WAAW,GAAG,UAAU,GAAG,UAAU,EAAG,OAAM,KAAK,IAAI,KAAK,YAAY,OAAO,MAAM,CAAC,CAAC;AAAA,EAC9G;AACA,gBAAc,SAAS,SAAS,UAAU,gBAAgB;AAE1D,SAAO,WAAW,SAAS,UAAU,EAAG,OAAM,KAAK,IAAI,KAAK,aAAa,OAAO,MAAM,CAAC,CAAC;AACxF,SAAO,WAAW,SAAS,UAAU,EAAG,OAAM,KAAK,IAAI,KAAK,aAAa,OAAO,MAAM,CAAC,CAAC;AACxF,SAAO,CAAC,OAAO,SAAS;AACzB;AAIA,SAASC,SAAQ,OAAO;AACvB,MAAI,UAAU,OAAQ,QAAO;AAAA,WACpB,UAAU,KAAM,QAAO;AAAA,WACvB,MAAM,QAAQ,KAAK,EAAG,QAAO;AAAA,WAC7B,OAAO,UAAU,UAAW,QAAO;AAAA,WACnC,OAAO,UAAU,WAAY,QAAO;AAAA,WACpC,OAAO,UAAU,SAAU,QAAO;AAAA,WAClC,OAAO,UAAU,SAAU,QAAO;AAAA,WAClC,OAAO,UAAU,SAAU,QAAO;AAAA,WAClC,OAAO,UAAU,UAAU;AACnC,QAAI,SAAS,MAAM;AAClB,UAAI,MAAM,gBAAgB,OAAQ,QAAO;AAAA,eAChC,MAAM,gBAAgB,IAAK,QAAO;AAAA,eAClC,MAAM,gBAAgB,IAAK,QAAO;AAAA,eAClC,MAAM,gBAAgB,KAAM,QAAO;AAAA,IAC7C;AACA,WAAO;AAAA,EACR,WAAW,OAAO,UAAU,SAAU,QAAO;AAC7C,QAAM,IAAI,MAAM,0BAA0B,KAAK,EAAE;AAClD;AAGA,SAAS,iBAAiBN,SAAQ;AACjC,SAAOA,QAAO,SAAS,MAAM,IAAI,SAAS;AAC3C;AACA,SAAS,YAAYC,IAAGC,IAAG,SAAS;AACnC,QAAMC,YAAW,SAAS,qBAAqB;AAC/C,QAAM,oBAAoB,KAAK,IAAI,KAAK,MAAM,SAAS,qBAAqB,CAAC,GAAG,CAAC;AACjF,MAAI,UAAUF,GAAE;AAChB,MAAI,UAAUC,GAAE;AAChB,MAAIC,WAAU;AACb,UAAM,iBAAiBF,GAAE,SAAS,IAAI;AACtC,UAAM,iBAAiBC,GAAE,SAAS,IAAI;AACtC,UAAM,iBAAiB,iBAAiBD,EAAC;AACzC,UAAM,iBAAiB,iBAAiBC,EAAC;AAEzC,UAAM,KAAK,iBAAiB,GAAGD,GAAE,MAAM,gBAAgB,iBAAiB,EAAE,KAAK,cAAc,CAAC;AAAA,IAAOA;AACrG,UAAM,KAAK,iBAAiB,GAAGC,GAAE,MAAM,gBAAgB,iBAAiB,EAAE,KAAK,cAAc,CAAC;AAAA,IAAOA;AACrG,cAAU,GAAG;AACb,cAAU,GAAG;AAAA,EACd;AACA,QAAM,YAAY,YAAYD,GAAE,UAAU,YAAYC,GAAE;AACxD,QAAM,WAAW,CAACE,SAAQC,YAAWJ,GAAEG,OAAM,MAAMF,GAAEG,OAAM;AAC3D,MAAI,SAAS;AACb,MAAI,SAAS;AACb,QAAM,QAAQ,CAAC;AACf,QAAM,mBAAmB,CAAC,SAAS,SAAS,YAAY;AACvD,QAAI,WAAW,QAAS,OAAM,KAAK,IAAI,KAAK,aAAaJ,GAAE,MAAM,QAAQ,OAAO,CAAC,CAAC;AAClF,QAAI,WAAW,QAAS,OAAM,KAAK,IAAI,KAAK,aAAaC,GAAE,MAAM,QAAQ,OAAO,CAAC,CAAC;AAClF,aAAS,UAAU;AACnB,aAAS,UAAU;AACnB,UAAM,KAAK,IAAI,KAAK,YAAYA,GAAE,MAAM,SAAS,MAAM,CAAC,CAAC;AAAA,EAC1D;AACA,gBAAc,SAAS,SAAS,UAAU,gBAAgB;AAE1D,MAAI,WAAW,QAAS,OAAM,KAAK,IAAI,KAAK,aAAaD,GAAE,MAAM,MAAM,CAAC,CAAC;AACzE,MAAI,WAAW,QAAS,OAAM,KAAK,IAAI,KAAK,aAAaC,GAAE,MAAM,MAAM,CAAC,CAAC;AACzE,SAAO,CAAC,OAAO,SAAS;AACzB;AAMA,SAAS,yBAAyB,IAAI,OAAO,aAAa;AACzD,SAAO,MAAM,OAAO,CAAC,SAASJ,UAAS,WAAWA,MAAK,CAAC,MAAM,aAAaA,MAAK,CAAC,IAAIA,MAAK,CAAC,MAAM,MAAMA,MAAK,CAAC,EAAE,WAAW,IAAI,YAAYA,MAAK,CAAC,CAAC,IAAI,KAAK,EAAE;AAC7J;AAEA,IAAM,eAAN,MAAmB;AAAA,EAClB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAY,IAAI,aAAa;AAC5B,SAAK,KAAK;AACV,SAAK,OAAO,CAAC;AACb,SAAK,QAAQ,CAAC;AACd,SAAK,cAAc;AAAA,EACpB;AAAA,EACA,cAAc,WAAW;AACxB,SAAK,SAAS,IAAI,KAAK,KAAK,IAAI,SAAS,CAAC;AAAA,EAC3C;AAAA,EACA,WAAW;AAMV,SAAK,MAAM,KAAK,KAAK,KAAK,WAAW,IAAI,IAAI,KAAK,KAAK,IAAI,yBAAyB,KAAK,IAAI,KAAK,MAAM,KAAK,WAAW,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC,MAAM,KAAK,KAAK,KAAK,KAAK,CAAC,IAAI,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5M,SAAK,KAAK,SAAS;AAAA,EACpB;AAAA,EACA,cAAc;AACb,WAAO,KAAK,KAAK,WAAW;AAAA,EAC7B;AAAA;AAAA,EAEA,SAASA,OAAM;AACd,SAAK,KAAK,KAAKA,KAAI;AAAA,EACpB;AAAA;AAAA,EAEA,MAAMA,OAAM;AACX,UAAME,UAASF,MAAK,CAAC;AACrB,QAAIE,QAAO,SAAS,IAAI,GAAG;AAC1B,YAAM,aAAaA,QAAO,MAAM,IAAI;AACpC,YAAM,QAAQ,WAAW,SAAS;AAClC,iBAAW,QAAQ,CAAC,WAAWJ,OAAM;AACpC,YAAIA,KAAI,OAAO;AAGd,eAAK,cAAc,SAAS;AAC5B,eAAK,SAAS;AAAA,QACf,WAAW,UAAU,WAAW;AAIhC,eAAK,cAAc,SAAS;AAAA,MAC7B,CAAC;AAAA,IACF;AAEA,WAAK,SAASE,KAAI;AAAA,EACnB;AAAA;AAAA,EAEA,YAAY,OAAO;AAClB,QAAI,CAAC,KAAK,YAAY,EAAG,MAAK,SAAS;AACvC,UAAM,KAAK,GAAG,KAAK,KAAK;AACxB,SAAK,MAAM,SAAS;AAAA,EACrB;AACD;AAEA,IAAM,eAAN,MAAmB;AAAA,EAClB;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAY,cAAc,cAAc;AACvC,SAAK,eAAe;AACpB,SAAK,eAAe;AACpB,SAAK,QAAQ,CAAC;AAAA,EACf;AAAA,EACA,mBAAmBA,OAAM;AACxB,SAAK,MAAM,KAAKA,KAAI;AAAA,EACrB;AAAA,EACA,oBAAoBA,OAAM;AACzB,UAAM,cAAcA,MAAK,CAAC,EAAE,WAAW;AAEvC,QAAI,CAAC,eAAe,KAAK,aAAa,YAAY,EAAG,MAAK,aAAa,SAASA,KAAI;AACpF,QAAI,CAAC,eAAe,KAAK,aAAa,YAAY,EAAG,MAAK,aAAa,SAASA,KAAI;AAAA,EACrF;AAAA,EACA,mBAAmB;AAClB,SAAK,aAAa,YAAY,KAAK,KAAK;AACxC,SAAK,aAAa,YAAY,KAAK,KAAK;AAAA,EACzC;AAAA;AAAA,EAEA,MAAMA,OAAM;AACX,UAAM,KAAKA,MAAK,CAAC;AACjB,UAAME,UAASF,MAAK,CAAC;AACrB,QAAIE,QAAO,SAAS,IAAI,GAAG;AAC1B,YAAM,aAAaA,QAAO,MAAM,IAAI;AACpC,YAAM,QAAQ,WAAW,SAAS;AAClC,iBAAW,QAAQ,CAAC,WAAWJ,OAAM;AACpC,YAAIA,OAAM,GAAG;AACZ,gBAAM,UAAU,IAAI,KAAK,IAAI,SAAS;AACtC,cAAI,KAAK,aAAa,YAAY,KAAK,KAAK,aAAa,YAAY,GAAG;AAGvE,iBAAK,iBAAiB;AACtB,iBAAK,mBAAmB,OAAO;AAAA,UAChC,OAAO;AAGN,iBAAK,oBAAoB,OAAO;AAChC,iBAAK,iBAAiB;AAAA,UACvB;AAAA,QACD,WAAWA,KAAI;AAEf,eAAK,mBAAmB,IAAI,KAAK,IAAI,SAAS,CAAC;AAAA,iBACtC,UAAU,WAAW;AAI9B,eAAK,oBAAoB,IAAI,KAAK,IAAI,SAAS,CAAC;AAAA,MACjD,CAAC;AAAA,IACF;AAIA,WAAK,oBAAoBE,KAAI;AAAA,EAC9B;AAAA;AAAA,EAEA,WAAW;AACV,SAAK,iBAAiB;AACtB,WAAO,KAAK;AAAA,EACb;AACD;AAWA,SAAS,gBAAgB,OAAO,aAAa;AAC5C,QAAM,eAAe,IAAI,aAAa,aAAa,WAAW;AAC9D,QAAM,eAAe,IAAI,aAAa,aAAa,WAAW;AAC9D,QAAM,eAAe,IAAI,aAAa,cAAc,YAAY;AAChE,QAAM,QAAQ,CAACA,UAAS;AACvB,YAAQA,MAAK,CAAC,GAAG;AAAA,MAChB,KAAK;AACJ,qBAAa,MAAMA,KAAI;AACvB;AAAA,MACD,KAAK;AACJ,qBAAa,MAAMA,KAAI;AACvB;AAAA,MACD;AAAS,qBAAa,MAAMA,KAAI;AAAA,IACjC;AAAA,EACD,CAAC;AACD,SAAO,aAAa,SAAS;AAC9B;AAEA,SAAS,cAAc,OAAO,aAAa;AAC1C,MAAI,aAAa;AAEhB,UAAM,QAAQ,MAAM,SAAS;AAC7B,WAAO,MAAM,KAAK,CAACA,OAAMF,OAAME,MAAK,CAAC,MAAM,eAAeF,OAAM,SAASE,MAAK,CAAC,MAAM,KAAK;AAAA,EAC3F;AACA,SAAO,MAAM,KAAK,CAACA,UAASA,MAAK,CAAC,MAAM,UAAU;AACnD;AAGA,SAAS,mBAAmBG,IAAGC,IAAG,SAAS;AAC1C,MAAID,OAAMC,MAAKD,GAAE,WAAW,KAAKC,GAAE,WAAW,GAAG;AAChD,UAAM,cAAcD,GAAE,SAAS,IAAI,KAAKC,GAAE,SAAS,IAAI;AAEvD,UAAM,CAAC,OAAO,SAAS,IAAI,eAAe,cAAc,GAAGD,EAAC;AAAA,IAAOA,IAAG,cAAc,GAAGC,EAAC;AAAA,IAAOA,IAAG,MAAM,OAAO;AAC/G,QAAI,cAAc,OAAO,WAAW,GAAG;AACtC,YAAM,oBAAoB,qBAAqB,OAAO;AACtD,YAAM,QAAQ,gBAAgB,OAAO,kBAAkB,WAAW;AAClE,aAAO,eAAe,OAAO,WAAW,iBAAiB;AAAA,IAC1D;AAAA,EACD;AAEA,SAAO,iBAAiBD,GAAE,MAAM,IAAI,GAAGC,GAAE,MAAM,IAAI,GAAG,OAAO;AAC9D;AAGA,SAAS,eAAeD,IAAGC,IAAG,SAAS,SAAS;AAC/C,QAAM,CAAC,OAAO,SAAS,IAAI,YAAYD,IAAGC,IAAG,OAAO;AACpD,uBAAqB,KAAK;AAC1B,SAAO,CAAC,OAAO,SAAS;AACzB;AAEA,SAAS,iBAAiB,SAAS,SAAS;AAC3C,QAAM,EAAE,YAAY,IAAI,qBAAqB,OAAO;AACpD,SAAO,YAAY,OAAO;AAC3B;AACA,IAAM,EAAE,mBAAAK,oBAAmB,eAAAC,gBAAe,YAAAC,aAAY,WAAAC,YAAW,cAAAC,eAAc,oBAAAC,oBAAmB,IAAI;AACtG,IAAMC,WAAU;AAAA,EACfD;AAAA,EACAD;AAAA,EACAF;AAAA,EACAD;AAAA,EACAE;AAAA,EACAH;AAAA,EACA,QAAQ;AACT;AACA,IAAM,iBAAiB;AAAA,EACtB,UAAU;AAAA,EACV,SAASM;AACV;AACA,IAAM,0BAA0B;AAAA,EAC/B,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,SAASA;AACV;AACA,IAAM,mBAAmB,CAACC,IAAGC,OAAMA;AASnC,SAAS,KAAKd,IAAGC,IAAG,SAAS,WAAW,kBAAkB;AACzD,MAAI,OAAO,GAAGD,IAAGC,EAAC,EAAG,QAAO;AAC5B,QAAM,QAAQI,SAAQL,EAAC;AACvB,MAAI,eAAe;AACnB,MAAI,iBAAiB;AACrB,MAAI,UAAU,YAAY,OAAOA,GAAE,oBAAoB,YAAY;AAClE,QAAIA,GAAE,aAAa,uBAAO,IAAI,wBAAwB;AAEtD;AACA,QAAI,OAAOA,GAAE,oBAAoB;AAEjC;AACA,mBAAeA,GAAE,gBAAgB;AAGjC,qBAAiB,iBAAiB;AAAA,EACnC;AACA,MAAI,iBAAiBK,SAAQJ,EAAC,GAAG;AAUhC,QAASC,YAAT,SAAkB,GAAG;AACpB,aAAO,EAAE,UAAU,aAAa,IAAI,GAAG,EAAE,MAAM,GAAG,UAAU,CAAC;AAAA,IAC9D;AAFS,QAAAA;AATT,UAAM,EAAE,aAAa,QAAQ,YAAY,aAAa,QAAQ,WAAW,IAAI,qBAAqB,OAAO;AACzG,UAAM,gBAAgB,iBAAiB,yBAAyB,OAAO;AACvE,QAAI,WAAW,OAAOF,IAAG,aAAa;AACtC,QAAI,WAAW,OAAOC,IAAG,aAAa;AAKtC,UAAM,aAAa;AAInB,eAAW,SAAS,YAAYC,UAAS,QAAQ,CAAC;AAClD,eAAW,SAAS,UAAUA,UAAS,QAAQ,CAAC;AAChD,WAAO,GAAG,GAAG,OAAO,GAAG,UAAU,IAAI,WAAW,GAAG,CAAC;AAAA,EAAK,QAAQ,EAAE;AAAA;AAAA,EAAO,GAAG,OAAO,GAAG,UAAU,IAAI,WAAW,GAAG,CAAC;AAAA,EAAK,QAAQ,EAAE;AAAA,EACpI;AACA,MAAI,eAAgB;AACpB,UAAQ,OAAO;AAAA,IACd,KAAK;AAAU,aAAO,iBAAiBF,GAAE,MAAM,IAAI,GAAGC,GAAE,MAAM,IAAI,GAAG,OAAO;AAAA,IAC5E,KAAK;AAAA,IACL,KAAK;AAAU,aAAO,iBAAiBD,IAAGC,IAAG,SAAS,QAAQ;AAAA,IAC9D,KAAK;AAAO,aAAO,eAAe,QAAQD,EAAC,GAAG,QAAQC,EAAC,GAAG,SAAS,QAAQ;AAAA,IAC3E,KAAK;AAAO,aAAO,eAAe,QAAQD,EAAC,GAAG,QAAQC,EAAC,GAAG,SAAS,QAAQ;AAAA,IAC3E;AAAS,aAAO,eAAeD,IAAGC,IAAG,SAAS,QAAQ;AAAA,EACvD;AACD;AACA,SAAS,eAAe,QAAQ;AAC/B,SAAO,CAAC,SAAS,qBAAqB;AACrC,WAAO,OAAO,IAAI;AAClB,WAAO;AAAA,EACR;AACD;AACA,SAAS,iBAAiBD,IAAGC,IAAG,SAAS,WAAW,kBAAkB;AACrE,QAAM,UAAU,SAAS,YAAY,OAAOD,IAAG,cAAc,CAAC;AAC9D,QAAM,UAAU,SAAS,UAAU,OAAOC,IAAG,cAAc,CAAC;AAC5D,SAAO,YAAY,UAAU,KAAK,iBAAiB,QAAQ,MAAM,IAAI,GAAG,QAAQ,MAAM,IAAI,GAAG,OAAO;AACrG;AACA,SAAS,QAAQc,MAAK;AACrB,SAAO,IAAI,IAAI,MAAM,KAAKA,KAAI,QAAQ,CAAC,EAAE,KAAK,CAAC;AAChD;AACA,SAAS,QAAQC,MAAK;AACrB,SAAO,IAAI,IAAI,MAAM,KAAKA,KAAI,OAAO,CAAC,EAAE,KAAK,CAAC;AAC/C;AACA,SAAS,eAAehB,IAAGC,IAAG,SAAS,WAAW,kBAAkB;AACnE,MAAI;AACJ,MAAI,YAAY;AAChB,MAAI;AACH,iBAAa,qBAAqBD,IAAGC,IAAG,iBAAiB,gBAAgB,OAAO,GAAG,SAAS,QAAQ;AAAA,EACrG,QAAQ;AACP,gBAAY;AAAA,EACb;AACA,QAAM,gBAAgB,iBAAiB,iBAAiB,OAAO;AAG/D,MAAI,eAAe,UAAU,eAAe,eAAe;AAC1D,iBAAa,qBAAqBD,IAAGC,IAAG,iBAAiB,yBAAyB,OAAO,GAAG,SAAS,QAAQ;AAC7G,QAAI,eAAe,iBAAiB,CAAC,UAAW,cAAa,GAAG,iBAAiB,iBAAiB,OAAO,CAAC;AAAA;AAAA,EAAO,UAAU;AAAA,EAC5H;AACA,SAAO;AACR;AACA,SAAS,wBAAwB,SAAS;AACzC,SAAO,iBAAiB,gBAAgB,OAAO;AAChD;AACA,SAAS,iBAAiB,eAAe,SAAS;AACjD,QAAM,EAAE,aAAa,qBAAqB,SAAS,IAAI,qBAAqB,OAAO;AACnF,SAAO;AAAA,IACN,GAAG;AAAA,IACH;AAAA,IACA;AAAA,IACA,UAAU,YAAY,cAAc;AAAA,EACrC;AACD;AACA,SAAS,qBAAqBD,IAAGC,IAAG,eAAe,SAAS,WAAW,kBAAkB;AACxF,QAAM,0BAA0B;AAAA,IAC/B,GAAG;AAAA,IACH,QAAQ;AAAA,EACT;AACA,QAAM,WAAW,OAAOD,IAAG,uBAAuB;AAClD,QAAM,WAAW,OAAOC,IAAG,uBAAuB;AAClD,MAAI,aAAa,SAAU,QAAO,iBAAiB,iBAAiB,OAAO;AAAA,OACtE;AACJ,UAAM,WAAW,SAAS,YAAY,OAAOD,IAAG,aAAa,CAAC;AAC9D,UAAM,WAAW,SAAS,UAAU,OAAOC,IAAG,aAAa,CAAC;AAC5D,WAAO,kBAAkB,SAAS,MAAM,IAAI,GAAG,SAAS,MAAM,IAAI,GAAG,SAAS,MAAM,IAAI,GAAG,SAAS,MAAM,IAAI,GAAG,OAAO;AAAA,EACzH;AACD;AACA,IAAM,yBAAyB;AAC/B,SAAS,oBAAoB,MAAM;AAClC,SAAOI,SAAU,IAAI,MAAM,YAAY,OAAO,KAAK,oBAAoB;AACxE;AACA,SAAS,cAAc,MAAM,MAAM;AAClC,QAAM,WAAWA,SAAU,IAAI;AAC/B,SAAO,aAAaA,SAAU,IAAI,MAAM,aAAa,YAAY,aAAa;AAC/E;AACA,SAAS,qBAAqB,UAAU,UAAU,SAAS,QAAQ;AAClE,QAAM,EAAE,aAAa,YAAY,IAAI,qBAAqB,OAAO;AACjE,MAAI,OAAO,aAAa,YAAY,OAAO,aAAa,YAAY,SAAS,SAAS,KAAK,SAAS,SAAS,KAAK,SAAS,UAAU,0BAA0B,SAAS,UAAU,0BAA0B,aAAa,UAAU;AAClO,QAAI,SAAS,SAAS,IAAI,KAAK,SAAS,SAAS,IAAI,EAAG,QAAO,mBAAmB,UAAU,UAAU,OAAO;AAC7G,UAAM,CAAC,KAAK,IAAI,eAAe,UAAU,QAAQ;AACjD,UAAMY,iBAAgB,MAAM,KAAK,CAACpB,UAASA,MAAK,CAAC,MAAM,UAAU;AACjE,UAAM,aAAa,gBAAgB,aAAa,WAAW;AAC3D,WAAO,GAAG,WAAW,WAAW,IAAI,cAAc,8BAA8B,OAAO,aAAaoB,cAAa,CAAC,CAAC;AAAA,EAAK,WAAW,WAAW,IAAI,cAAc,8BAA8B,OAAO,aAAaA,cAAa,CAAC,CAAC;AAAA,EAClO;AAEA,QAAM,iBAAiB,UAAU,UAAU,EAAE,eAAe,KAAK,CAAC;AAClE,QAAM,EAAE,kBAAkB,eAAe,IAAI,yBAAyB,UAAU,UAAU,EAAE,eAAe,KAAK,CAAC,GAAG,cAAc;AAClI,SAAO,KAAK,kBAAkB,gBAAgB,SAAS,SAAS,eAAe,MAAM,IAAI,gBAAgB;AAU1G;AACA,SAAS,yBAAyB,QAAQ,UAAU,iBAAiC,oBAAI,QAAQ,GAAG,mBAAmC,oBAAI,QAAQ,GAAG;AAErJ,MAAI,kBAAkB,SAAS,oBAAoB,SAAS,OAAO,OAAO,UAAU,eAAe,OAAO,SAAS,UAAU,aAAa;AACzI,WAAO,OAAO;AACd,WAAO;AAAA,MACN,gBAAgB;AAAA,MAChB,kBAAkB;AAAA,IACnB;AAAA,EACD;AACA,MAAI,CAAC,cAAc,QAAQ,QAAQ,EAAG,QAAO;AAAA,IAC5C,gBAAgB;AAAA,IAChB,kBAAkB;AAAA,EACnB;AACA,MAAI,eAAe,IAAI,MAAM,KAAK,iBAAiB,IAAI,QAAQ,EAAG,QAAO;AAAA,IACxE,gBAAgB;AAAA,IAChB,kBAAkB;AAAA,EACnB;AACA,iBAAe,IAAI,MAAM;AACzB,mBAAiB,IAAI,QAAQ;AAC7B,mBAAiB,QAAQ,EAAE,QAAQ,CAAC,QAAQ;AAC3C,UAAM,gBAAgB,SAAS,GAAG;AAClC,UAAM,cAAc,OAAO,GAAG;AAC9B,QAAI,oBAAoB,aAAa,GAAG;AACvC,UAAI,cAAc,gBAAgB,WAAW;AAG7C,iBAAS,GAAG,IAAI;AAAA,eACP,YAAY,iBAAiB,cAAc,WAAW,UAAU,cAAc,aAAa,cAAc,MAAM,GAAG;AAG1H,cAAM,WAAW,yBAAyB,aAAa,cAAc,QAAQ,gBAAgB,gBAAgB;AAC7G,eAAO,GAAG,IAAI,SAAS;AACvB,iBAAS,GAAG,IAAI,SAAS;AAAA,MAC1B;AAAA,IACD,WAAW,oBAAoB,WAAW,GAAG;AAC5C,UAAI,YAAY,gBAAgB,aAAa,EAAG,QAAO,GAAG,IAAI;AAAA,eACrD,YAAY,eAAe,YAAY,WAAW,UAAU,cAAc,YAAY,QAAQ,aAAa,GAAG;AACtH,cAAM,WAAW,yBAAyB,YAAY,QAAQ,eAAe,gBAAgB,gBAAgB;AAC7G,eAAO,GAAG,IAAI,SAAS;AACvB,iBAAS,GAAG,IAAI,SAAS;AAAA,MAC1B;AAAA,IACD,WAAW,cAAc,aAAa,aAAa,GAAG;AACrD,YAAM,WAAW,yBAAyB,aAAa,eAAe,gBAAgB,gBAAgB;AACtG,aAAO,GAAG,IAAI,SAAS;AACvB,eAAS,GAAG,IAAI,SAAS;AAAA,IAC1B;AAAA,EACD,CAAC;AACD,SAAO;AAAA,IACN,gBAAgB;AAAA,IAChB,kBAAkB;AAAA,EACnB;AACD;AACA,SAAS,mBAAmB,SAAS;AACpC,QAAM,YAAY,QAAQ,OAAO,CAAC,KAAKlB,YAAWA,QAAO,SAAS,MAAMA,QAAO,SAAS,KAAK,CAAC;AAC9F,SAAO,CAACA,YAAW,GAAGA,OAAM,KAAK,IAAI,OAAO,YAAYA,QAAO,MAAM,CAAC;AACvE;AACA,IAAM,eAAe;AACrB,SAAS,sBAAsB,MAAM;AACpC,SAAO,KAAK,QAAQ,UAAU,CAAC,WAAW,aAAa,OAAO,OAAO,MAAM,CAAC;AAC7E;AACA,SAAS,cAAcmB,SAAQ;AAC9B,SAAO,EAAE,IAAI,sBAAsB,UAAUA,OAAM,CAAC,CAAC;AACtD;AACA,SAAS,cAAc,OAAO;AAC7B,SAAO,EAAE,MAAM,sBAAsB,UAAU,KAAK,CAAC,CAAC;AACvD;AACA,SAAS,8BAA8B,OAAO,IAAID,gBAAe;AAChE,SAAO,MAAM,OAAO,CAAC,SAASpB,UAAS,WAAWA,MAAK,CAAC,MAAM,aAAaA,MAAK,CAAC,IAAIA,MAAK,CAAC,MAAM,KAAKoB,iBAAgB,EAAE,QAAQpB,MAAK,CAAC,CAAC,IAAIA,MAAK,CAAC,IAAI,KAAK,EAAE;AAC7J;AAEA,SAAS,aAAa,MAAM,aAAa,OAAuB,oBAAI,QAAQ,GAAG;AAC9E,MAAI,CAAC,QAAQ,OAAO,SAAS,SAAU,QAAO,EAAE,SAAS,OAAO,IAAI,EAAE;AACtE,QAAM,MAAM;AACZ,MAAI,IAAI,YAAY,IAAI,aAAa,UAAU,IAAI,aAAa,UAAU,IAAI,WAAW,QAAQ;AAChG,UAAM,UAAU;AAAA,MACf,GAAG;AAAA,MACH,GAAG,IAAI;AAAA,IACR;AACA,QAAI,OAAO,qBAAqB,IAAI,QAAQ,IAAI,UAAU,SAAS,GAAG;AACtE,QAAI,WAAW,cAAc,IAAI,UAAU,OAAO;AAClD,QAAI,SAAS,cAAc,IAAI,QAAQ,OAAO;AAAA,EAC/C;AAGA,MAAI;AACH,QAAI,CAAC,KAAK,IAAI,GAAG,KAAK,OAAO,IAAI,UAAU,UAAU;AACpD,WAAK,IAAI,GAAG;AACZ,UAAI,QAAQ,aAAa,IAAI,OAAO,aAAa,IAAI;AAAA,IACtD;AAAA,EACD,QAAQ;AAAA,EAAC;AACT,MAAI;AACH,WAAO,eAAe,GAAG;AAAA,EAC1B,SAAS,GAAG;AACX,WAAO,eAA+B,oBAAI,MAAM,oCAAoC,GAAG,OAAO;AAAA,uBAA0B,KAAK,OAAO,EAAE,CAAC;AAAA,EACxI;AACD;AACA,SAAS,cAAc,OAAO,SAAS;AACtC,MAAI,OAAO,UAAU,SAAU,QAAO,OAAO,OAAO,wBAAwB,OAAO,CAAC;AACpF,SAAO;AACR;AA8DA,IAAM,eAAN,cAA2B,MAAM;AAAA,EAChC;AAAA,EACA;AAAA,EACA,OAAO;AAAA,EACP;AAAA,EACA,YAAY,SAAS,MAAM,MAAM;AAChC,UAAM,OAAO;AACb,SAAK,UAAU;AACf,SAAK,OAAO;AACZ,SAAK,SAAS,KAAK;AAAA,EACpB;AACD;AASA,IAAM,yBAAN,cAAqC,MAAM;AAAA,EAC1C,OAAO;AACR;AACA,IAAM,qBAAN,cAAiC,MAAM;AAAA,EACtC,OAAO;AACR;AACA,IAAM,oBAAN,cAAgC,MAAM;AAAA,EACrC,OAAO;AACR;AAWA,IAAM,kBAAN,cAA8B,MAAM;AAAA,EACnC,OAAO;AAAA,EACP,YAAY,SAAS;AACpB,UAAM,OAAO;AAIb,WAAO,eAAe,MAAM,gCAAgC;AAAA,MAC3D,OAAO;AAAA,MACP,YAAY;AAAA,IACb,CAAC;AAAA,EACF;AACD;AAGA,IAAM,QAAwB,oBAAI,QAAQ;AAC1C,IAAM,iBAAiC,oBAAI,QAAQ;AACnD,IAAM,WAA2B,oBAAI,QAAQ;AAC7C,SAAS,MAAM,KAAKsB,KAAI;AACvB,QAAM,IAAI,KAAKA,GAAE;AAClB;AAIA,SAAS,eAAe,KAAK,SAAS;AACrC,iBAAe,IAAI,KAAK,OAAO;AAChC;AACA,SAAS,gBAAgB,KAAK;AAC7B,SAAO,eAAe,IAAI,GAAG;AAC9B;AACA,SAAS,SAAS,KAAK,OAAO;AAC7B,WAAS,IAAI,KAAK,KAAK;AACxB;AACA,SAAS,SAAS,KAAK;AACtB,SAAO,SAAS,IAAI,GAAG;AACxB;AAEA,IAAM,0BAA0B,uBAAO,IAAI,4BAA4B;AACvE,IAAM,eAAN,MAAM,cAAa;AAAA,EAClB;AAAA,EACA,aAA6B,oBAAI,QAAQ;AAAA,EACzC;AAAA,EACA,OAAO,eAAe,CAAC;AAAA,EACvB,OAAO,mBAAmB;AAAA,IACzB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD;AAAA,EACA,OAAO,qBAAqB;AAAA,IAC3B;AAAA,IACA;AAAA,IACA;AAAA,EACD;AAAA,EACA,OAAO,iBAAiB;AAAA,IACvB;AAAA,IACA;AAAA,IACA;AAAA,EACD;AAAA,EACA,OAAO,sBAAsB,EAAE,MAAM,SAAS;AAAA,EAC9C,OAAO,mBAAmB;AACzB,kBAAa,aAAa,SAAS;AAAA,EACpC;AAAA,EACA,OAAO,oBAAoB;AAC1B,WAAO,cAAa,aAAa,IAAI,CAAC,MAAM,EAAE,iBAAiB,CAAC;AAAA,EACjE;AAAA,EACA,OAAO,gBAAgB,MAAM;AAC5B,WAAO,cAAa,aAAa,IAAI,CAAC,MAAM,EAAE,eAAe,IAAI,CAAC;AAAA,EACnE;AAAA,EACA,OAAO,iBAAiB,KAAK;AAC5B,WAAO,SAAS,GAAG,KAAK,OAAO,KAAK,GAAG,EAAE,KAAK,CAAC,QAAQ,cAAa,mBAAmB,SAAS,GAAG,CAAC;AAAA,EACrG;AAAA,EACA,YAAY,eAAe;AAC1B,SAAK,iBAAiB,iBAAiC,oBAAI,IAAI;AAC/D,SAAK,iBAAiC,oBAAI,QAAQ;AAClD,kBAAa,aAAa,KAAK,IAAI;AAAA,EACpC;AAAA,EACA,OAAOC,SAAQ,cAAc;AAC5B,UAAM,EAAE,OAAAC,OAAM,IAAI,gBAAgB;AAClC,UAAM,aAAa,CAACA,UAASA,OAAM,SAASA;AAC5C,UAAM,gBAAgB,KAAK,kBAAkBD,SAAQ,cAAc,UAAU;AAC7E,WAAO,IAAI,cAAa,aAAa;AAAA,EACtC;AAAA,EACA,IAAIC,QAAO;AACV,QAAI,eAAeA;AACnB,WAAO,cAAc;AACpB,YAAM,YAAY,KAAK,WAAW,IAAI,YAAY;AAElD,UAAI,UAAW,QAAO;AACtB,UAAI,iBAAiB,aAAa,KAAM;AACxC,qBAAe,aAAa,SAAS,aAAa;AAAA,IACnD;AACA,WAAO,KAAK;AAAA,EACb;AAAA,EACA,SAASD,SAAQ,cAAc;AAC9B,UAAM,EAAE,OAAO,cAAc,KAAK,IAAI,gBAAgB;AACtD,UAAMC,SAAQ,gBAAgB;AAC9B,UAAM,aAAa,CAAC,gBAAgB,aAAa,SAAS;AAG1D,UAAM,qBAAqB,IAAI,IAAI,KAAK,IAAIA,MAAK,CAAC;AAClD,UAAM,gBAAgB,KAAK,kBAAkBD,SAAQ,cAAc,YAAY,kBAAkB;AAGjG,QAAI,WAAY,MAAK,iBAAiB;AAAA,QACjC,MAAK,WAAW,IAAIC,QAAO,aAAa;AAAA,EAC9C;AAAA,EACA,eAAe,MAAM;AACpB,QAAI,CAAC,KAAK,eAAe,IAAI,IAAI,EAAG,MAAK,eAAe,IAAI,MAAM,uBAAO,OAAO,IAAI,CAAC;AACrF,WAAO,KAAK,eAAe,IAAI,IAAI;AAAA,EACpC;AAAA,EACA,mBAAmB;AAClB,QAAI,CAAC,KAAK,eAAe,IAAI,cAAa,mBAAmB,EAAG,MAAK,eAAe,IAAI,cAAa,qBAAqB,uBAAO,OAAO,IAAI,CAAC;AAC7I,WAAO,KAAK,eAAe,IAAI,cAAa,mBAAmB;AAAA,EAChE;AAAA,EACA,kBAAkBD,SAAQ,cAAc,gBAAgB,gBAAgB,IAAI,IAAI,KAAK,cAAc,GAAG;AACrG,UAAM,SAAS,CAAC;AAChB,WAAO,QAAQ,YAAY,EAAE,QAAQ,CAAC,CAAC,MAAME,GAAE,MAAM;AACpD,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,MAAM,QAAQA,GAAE,KAAKA,IAAG,UAAU,KAAK,cAAa,iBAAiBA,IAAG,CAAC,CAAC,GAAG;AAChF,mBAAWA,IAAG,CAAC;AACf,kBAAU;AAAA,UACT,MAAM,SAAS,QAAQ;AAAA,UACvB,OAAO,SAAS,SAAS;AAAA,UACzB,UAAU,SAAS,YAAY;AAAA,QAChC;AACA,gBAAQ,QAAQ,WAAWF,QAAO,cAAc,IAAI,KAAKE,IAAG,CAAC,IAAIA,IAAG,CAAC;AAAA,MACtE,MAAO,SAAQA;AACf,YAAM,SAAS,cAAc,IAAI,IAAI;AACrC,UAAI,UAAU,SAAS;AACtB,YAAI,OAAO,UAAU,QAAQ,MAAO,QAAO,KAAK,IAAI,uBAAuB,QAAQ,IAAI,4CAA4C,QAAQ,KAAK,UAAU,CAAC;AAC3J,YAAI,OAAO,SAAS,QAAQ,KAAM,QAAO,KAAK,IAAI,uBAAuB,QAAQ,IAAI,+CAA+C,QAAQ,IAAI,KAAK,CAAC;AAAA,MACvJ,WAAW,OAAQ,WAAU;AAAA,QAC5B,MAAM,OAAO;AAAA,QACb,OAAO,OAAO;AAAA,QACd,UAAU,OAAO;AAAA,MAClB;AAAA,eACS,CAAC,QAAS,WAAU;AAAA,QAC5B,MAAM;AAAA,QACN,UAAU;AAAA,QACV,OAAO;AAAA,MACR;AACA,UAAI,QAAQ,SAAS,CAAC,cAAa,eAAe,SAAS,QAAQ,KAAK,EAAG,QAAO,KAAK,IAAI,uBAAuB,QAAQ,IAAI,gCAAgC,QAAQ,KAAK,IAAI,CAAC;AAChL,UAAI,CAAC,kBAAkB,QAAQ,UAAU,OAAQ,QAAO,KAAK,IAAI,uBAAuB,QAAQ,IAAI,sCAAsC,QAAQ,KAAK,SAAS,CAAC,UAAU,SAAS,QAAQ,QAAQ,uCAAuC,EAAE,6EAA6E,CAAC;AAC3T,YAAM,OAAO,kBAAkB,KAAK,IAAI,aAAa,KAAK,IAAoB,oBAAI,IAAI;AACtF,YAAM,OAAO;AAAA,QACZ;AAAA,QACA;AAAA,QACA,MAAM,QAAQ,QAAQ;AAAA,QACtB,UAAU,QAAQ,YAAY;AAAA,QAC9B,OAAO,QAAQ,SAAS;AAAA,QACxB;AAAA,QACA;AAAA,MACD;AACA,UAAI,kBAAkB,KAAK,EAAG,QAAO,OAAO,OAAO,EAAE,CAAC,uBAAuB,GAAmB,oBAAI,MAAM,mBAAmB,EAAE,CAAC;AAChI,oBAAc,IAAI,MAAM,IAAI;AAC5B,UAAI,KAAK,UAAU,aAAaF,QAAO,SAAS,eAAeA,QAAO,SAAS,WAAY,MAAK,QAAQ;AAAA,IACzG,CAAC;AAED,eAAW,WAAW,cAAc,OAAO,EAAG,YAAW,WAAW,QAAQ,MAAM;AACjF,UAAI,cAAa,iBAAiB,SAAS,OAAO,EAAG;AACrD,YAAM,MAAM,cAAc,IAAI,OAAO;AACrC,UAAI,CAAC,KAAK;AACT,eAAO,KAAK,IAAI,uBAAuB,QAAQ,QAAQ,IAAI,yCAAyC,OAAO,IAAI,CAAC;AAChH;AAAA,MACD;AACA,UAAI,YAAY,QAAQ,QAAQ,CAAC,QAAQ,QAAQ;AAChD,eAAO,KAAK,IAAI,uBAAuB,QAAQ,QAAQ,IAAI,uEAAuE,CAAC;AACnI;AAAA,MACD;AACA,UAAI,cAAa,eAAe,QAAQ,QAAQ,KAAK,IAAI,cAAa,eAAe,QAAQ,IAAI,KAAK,GAAG;AACxG,eAAO,KAAK,IAAI,uBAAuB,OAAO,QAAQ,KAAK,KAAK,QAAQ,IAAI,gCAAgC,IAAI,KAAK,aAAa,IAAI,IAAI,IAAI,CAAC;AAC/I;AAAA,MACD;AAAA,IACD;AACA,QAAI,OAAO,WAAW,EAAG,OAAM,OAAO,CAAC;AAAA,aAC9B,OAAO,SAAS,EAAG,OAAM,IAAI,eAAe,QAAQ,gEAAgE;AAC7H,WAAO;AAAA,EACR;AACD;AACA,IAAM,oBAAoC,oBAAI,QAAQ;AA4BtD,IAAM,0BAA0C,oBAAI,QAAQ;AAC5D,SAAS,aAAaG,KAAI,SAAS;AAClC,QAAM,YAAY,gBAAgB;AAClC,QAAMC,SAAQ,SAAS,SAAS,UAAU,SAAS,UAAU;AAC7D,SAAO,OAAO,gBAAgB;AAC7B,UAAM,UAAU,eAAe,SAAS;AACxC,QAAI,CAAC,SAAS;AACb,UAAI,SAAS,UAAW,mBAAkBD,KAAI,QAAQ,WAAW,QAAQ,eAAe;AACxF,aAAOA,IAAG,CAAC,CAAC;AAAA,IACb;AACA,UAAM,WAAW,SAAS,YAAY,gBAAgB,OAAO;AAC7D,QAAI,CAAC,SAAU,QAAOA,IAAG,OAAO;AAChC,UAAM,gBAAgB,SAAS,IAAIC,MAAK;AACxC,QAAI,CAAC,cAAc,KAAM,QAAOD,IAAG,OAAO;AAC1C,UAAM,eAAe,CAAC;AACtB,UAAM,YAAY,aAAaA,GAAE;AACjC,eAAW,WAAW,cAAc,OAAO,EAAG,KAAI,cAAc,SAAS,OAAO,KAAK,UAAU,IAAI,QAAQ,IAAI,EAAG,cAAa,KAAK,OAAO;AAC3I,QAAI,CAAC,aAAa,OAAQ,QAAOA,IAAG,OAAO;AAC3C,QAAI,CAAC,kBAAkB,IAAI,OAAO,EAAG,mBAAkB,IAAI,SAAS,CAAC,CAAC;AACtE,UAAM,iBAAiB,kBAAkB,IAAI,OAAO;AACpD,UAAM,kBAAkB,YAAY,cAAc,aAAa;AAC/D,QAAI,CAAC,gBAAgB,OAAQ,QAAOA,IAAG,OAAO;AAG9C,QAAI,SAAS,WAAW;AACvB,YAAM,qBAAqB,gBAAgB,OAAO,CAAC,MAAM,EAAE,UAAU,MAAM;AAC3E,UAAI,mBAAmB,SAAS,GAAG;AAClC,cAAM,eAAe,mBAAmB,IAAI,CAAC,MAAM,IAAI,EAAE,IAAI,GAAG,EAAE,KAAK,IAAI;AAC3E,cAAM,QAAQ,IAAI,uBAAuB,8CAA8C,QAAQ,SAAS,kDAAkD,YAAY,yFAAyF;AAAA,UAC9P,WAAW;AAAA,UACX,WAAW;AAAA,UACX,UAAU;AAAA,QACX,EAAE,QAAQ,SAAS,CAAC,QAAQ;AAE5B,YAAI,QAAQ,iBAAiB,MAAO,OAAM,QAAQ,MAAM,UAAU,QAAQ,gBAAgB,MAAM,QAAQ,QAAQ,gBAAgB,SAAS,EAAE;AAC3I,cAAM;AAAA,MACP;AAAA,IACD;AACA,QAAI,CAAC,wBAAwB,IAAI,OAAO,EAAG,yBAAwB,IAAI,SAAyB,oBAAI,QAAQ,CAAC;AAC7G,UAAM,iBAAiB,wBAAwB,IAAI,OAAO;AAC1D,eAAW,WAAW,gBAAiB,KAAI,QAAQ,UAAU,QAAQ;AAIpE,UAAI,eAAe,IAAI,OAAO,EAAG;AACjC,qBAAe,IAAI,OAAO;AAC1B,YAAM,gBAAgB,MAAM,wBAAwB,SAAS,SAAS,cAAc;AACpF,cAAQ,QAAQ,IAAI,IAAI;AACxB,qBAAe,KAAK,MAAM;AACzB,uBAAe,OAAO,OAAO;AAAA,MAC9B,CAAC;AAAA,IACF,OAAO;AACN,YAAM,gBAAgB,MAAM,yBAAyB,UAAUC,QAAO,OAAO;AAC7E,cAAQ,QAAQ,IAAI,IAAI;AAAA,IACzB;AACA,WAAOD,IAAG,OAAO;AAAA,EAClB;AACD;AACA,SAAS,cAAc,SAAS,SAAS;AACxC,MAAI,CAAC,QAAQ,KAAM,QAAO;AAE1B,MAAI,SAAS,aAAa,QAAQ,UAAU,OAAQ,QAAO;AAC3D,SAAO;AACR;AACA,SAAS,kBAAkB,OAAO;AACjC,SAAO,OAAO,UAAU;AACzB;AACA,SAAS,wBAAwB,SAAS,SAAS,gBAAgB;AAClE,MAAI,CAAC,kBAAkB,QAAQ,KAAK,EAAG,QAAO,QAAQ;AACtD,SAAO,uBAAuB,QAAQ,OAAO,QAAQ,MAAM,SAAS,cAAc;AACnF;AACA,IAAM,4BAA4C,oBAAI,QAAQ;AAC9D,eAAe,yBAAyB,UAAUC,QAAO,SAAS;AACjE,QAAM,gBAAgB,SAAS,iBAAiB;AAChD,QAAM,cAAc,SAAS,eAAeA,OAAM,IAAI;AACtD,QAAM,iBAAiB,QAAQ,UAAU,WAAW,gBAAgB;AACpE,MAAI,CAAC,kBAAkB,QAAQ,KAAK,GAAG;AACtC,mBAAe,QAAQ,IAAI,IAAI,QAAQ;AACvC,WAAO,QAAQ;AAAA,EAChB;AACA,MAAI,QAAQ,QAAQ,eAAgB,QAAO,eAAe,QAAQ,IAAI;AACtE,MAAI,0BAA0B,IAAI,OAAO,EAAG,QAAO,0BAA0B,IAAI,OAAO;AACxF,MAAI,CAAC,kBAAkB,IAAI,cAAc,EAAG,mBAAkB,IAAI,gBAAgB,CAAC,CAAC;AACpF,QAAM,qBAAqB,kBAAkB,IAAI,cAAc;AAC/D,QAAM,UAAU,uBAAuB,QAAQ,OAAO,QAAQ,MAAM,QAAQ,UAAU,SAAS;AAAA,IAC9F,GAAG;AAAA,IACH,GAAG;AAAA,EACJ,IAAI,gBAAgB,kBAAkB,EAAE,KAAK,CAAC,UAAU;AACvD,mBAAe,QAAQ,IAAI,IAAI;AAC/B,8BAA0B,OAAO,OAAO;AACxC,WAAO;AAAA,EACR,CAAC;AACD,4BAA0B,IAAI,SAAS,OAAO;AAC9C,SAAO;AACR;AACA,eAAe,uBAAuB,WAAW,aAAa,SAAS,gBAAgB;AAEtF,QAAM,kBAAkB,YAAY;AACpC,QAAM,kBAAkB,2BAA2B,aAAa,UAAU,uBAAuB,aAAa,QAAQ,UAAU,uBAAuB,IAAI;AAC3J,MAAI,qBAAqB;AACzB,QAAM,gBAAgB,UAAU,SAAS,OAAO,aAAa;AAE5D,yBAAqB;AACrB,oBAAgB,QAAQ,QAAQ;AAEhC,UAAM,mBAAmB,YAAY;AACrC,mBAAe,KAAK,YAAY;AAE/B,uBAAiB,QAAQ;AAEzB,YAAM;AAAA,IACP,CAAC;AACD,UAAM;AAAA,EACP,CAAC,EAAE,KAAK,MAAM;AAEb,QAAI,CAAC,oBAAoB;AACxB,YAAM,QAAwB,oBAAI,MAAM,YAAY,WAAW,uGAAuG;AACtK,UAAI,iBAAiB,MAAO,OAAM,QAAQ,MAAM,UAAU,gBAAgB,MAAM,QAAQ,gBAAgB,SAAS,EAAE;AACnH,sBAAgB,OAAO,KAAK;AAAA,IAC7B;AAAA,EACD,CAAC,EAAE,MAAM,CAAC,MAAM;AAEf,QAAI,CAAC,oBAAoB;AACxB,sBAAgB,OAAO,CAAC;AACxB;AAAA,IACD;AAEA,UAAM;AAAA,EACP,CAAC;AACD,SAAO;AACR;AACA,SAAS,YAAY,cAAc,eAAe,SAAyB,oBAAI,IAAI,GAAG,kBAAkB,CAAC,GAAG;AAC3G,eAAa,QAAQ,CAAC,YAAY;AACjC,QAAI,gBAAgB,SAAS,OAAO,EAAG;AACvC,QAAI,CAAC,kBAAkB,QAAQ,KAAK,KAAK,CAAC,QAAQ,MAAM;AACvD,sBAAgB,KAAK,OAAO;AAC5B;AAAA,IACD;AACA,QAAI,OAAO,IAAI,OAAO,EAAG,KAAI,QAAQ,OAAQ,WAAU,QAAQ;AAAA,QAC1D,OAAM,IAAI,MAAM,yCAAyC,QAAQ,IAAI,OAAO,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,IAAI,CAACC,OAAMA,GAAE,IAAI,EAAE,KAAK,MAAM,CAAC,EAAE;AACxI,WAAO,IAAI,OAAO;AAClB,gBAAY,MAAM,KAAK,QAAQ,MAAM,CAACC,OAAMA,OAAM,QAAQ,OAAO,QAAQ,SAAS,cAAc,IAAIA,EAAC,CAAC,EAAE,OAAO,CAACA,OAAM,CAAC,CAACA,EAAC,GAAG,eAAe,QAAQ,eAAe;AAClK,oBAAgB,KAAK,OAAO;AAC5B,WAAO,MAAM;AAAA,EACd,CAAC;AACD,SAAO;AACR;AACA,SAAS,kBAAkBH,KAAI,MAAM,YAAY;AAChD,QAAM,YAAY,aAAaA,KAAI;AAAA,IAClC,aAAa;AAAA,IACb,WAAW;AAAA,EACZ,CAAC;AACD,MAAI,UAAU,MAAM;AACnB,UAAM,QAAQ,IAAI,mBAAmB,OAAO,IAAI,wBAAwB,CAAC,GAAG,SAAS,EAAE,KAAK,MAAQ,CAAC,uEAAuE,IAAI,mBAAmB,IAAI;AAAA,0KAAiL;AACxX,QAAI,WAAY,OAAM,QAAQ,WAAW,OAAO,QAAQ,WAAW,SAAS,MAAM,OAAO;AACzF,UAAM;AAAA,EACP;AACD;AACA,IAAM,eAAe,uBAAO,uBAAuB;AACnD,IAAM,mBAAmB,uBAAO,4BAA4B;AAC5D,SAAS,eAAeA,KAAI,SAAS;AACpC,SAAO,eAAeA,KAAI,cAAc;AAAA,IACvC,OAAO;AAAA,IACP,YAAY;AAAA,EACb,CAAC;AACF;AACA,SAAS,UAAUA,KAAI,OAAO;AAC7B,EAAAA,IAAG,gBAAgB,IAAI;AACvB,SAAO;AACR;AACA,SAAS,aAAaA,KAAI,EAAE,aAAa,UAAU,IAAI,CAAC,GAAG;AAC1D,MAAI,oBAAoBA,IAAI,QAAOA,IAAG,gBAAgB;AACtD,QAAM,EAAE,OAAO,gBAAgB,GAAG,UAAU,iBAAiBA,IAAG,IAAI,gBAAgBA,MAAKA,IAAG,YAAY,IAAI,CAAC;AAC7G,MAAI,WAAW,kBAAkB,eAAe,SAAS,CAAC;AAM1D,MAAI,uEAAuE,KAAK,QAAQ,EAAG,YAAW,SAAS,MAAM,yBAAyB,EAAE,CAAC;AACjJ,QAAM,QAAQ,SAAS,MAAM,gBAAgB;AAC7C,MAAI,CAAC,MAAO,QAAO,UAAUA,KAAoB,oBAAI,IAAI,CAAC;AAC1D,QAAM,OAAO,aAAa,MAAM,CAAC,CAAC;AAClC,MAAI,CAAC,KAAK,OAAQ,QAAO,UAAUA,KAAoB,oBAAI,IAAI,CAAC;AAChE,QAAM,mBAAmB,KAAK,aAAa;AAC3C,MAAI,CAAC,iBAAkB,QAAO,UAAUA,KAAoB,oBAAI,IAAI,CAAC;AACrE,MAAI,EAAE,iBAAiB,CAAC,MAAM,OAAO,iBAAiB,SAAS,GAAG,IAAI;AACrE,UAAM,kBAAkB,QAAQ,gBAAgB,CAAC;AACjD,UAAM,QAAQ,IAAI,kBAAkB,OAAO,eAAe,+GAA+G,gBAAgB,KAAK,YAAY,6CAA6C,eAAe,0CAA0C,QAAQ,gBAAgB,CAAC,CAAC,uBAAuB,EAAE,EAAE;AACrW,QAAI,YAAa,OAAM,QAAQ,YAAY,OAAO,QAAQ,YAAY,SAAS,MAAM,OAAO;AAC5F,UAAM;AAAA,EACP;AACA,QAAM,QAAQ,aAAa,iBAAiB,MAAM,GAAG,EAAE,EAAE,QAAQ,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,SAAS;AAC1F,WAAO,KAAK,QAAQ,YAAY,EAAE;AAAA,EACnC,CAAC;AACD,QAAM,OAAO,MAAM,GAAG,EAAE;AACxB,MAAI,QAAQ,KAAK,WAAW,KAAK,GAAG;AACnC,UAAM,QAAQ,IAAI,kBAAkB,4DAA4D,IAAI,IAAI;AACxG,QAAI,YAAa,OAAM,QAAQ,YAAY,OAAO,QAAQ,YAAY,SAAS,MAAM,OAAO;AAC5F,UAAM;AAAA,EACP;AACA,SAAO,UAAUA,KAAI,IAAI,IAAI,KAAK,CAAC;AACpC;AACA,SAAS,aAAa,GAAG;AACxB,QAAM,SAAS,CAAC;AAChB,QAAM,QAAQ,CAAC;AACf,MAAI,QAAQ;AACZ,WAASI,KAAI,GAAGA,KAAI,EAAE,QAAQA,KAAK,KAAI,EAAEA,EAAC,MAAM,OAAO,EAAEA,EAAC,MAAM,IAAK,OAAM,KAAK,EAAEA,EAAC,MAAM,MAAM,MAAM,GAAG;AAAA,WAC/F,EAAEA,EAAC,MAAM,MAAM,GAAG,EAAE,EAAG,OAAM,IAAI;AAAA,WACjC,CAAC,MAAM,UAAU,EAAEA,EAAC,MAAM,KAAK;AACvC,UAAM,QAAQ,EAAE,UAAU,OAAOA,EAAC,EAAE,KAAK;AACzC,QAAI,MAAO,QAAO,KAAK,KAAK;AAC5B,YAAQA,KAAI;AAAA,EACb;AACA,QAAM,YAAY,EAAE,UAAU,KAAK,EAAE,KAAK;AAC1C,MAAI,UAAW,QAAO,KAAK,SAAS;AACpC,SAAO;AACR;AAEA,IAAI;AAIJ,SAAS,iBAAiB;AACzB,SAAO;AACR;AAYA,IAAM,oBAAoB,uBAAO,mBAAmB;AACpD,SAAS,oBAAoB,WAAW;AACvC,SAAO,YAAY,iBAAiB;AACrC;AACA,SAAS,gBAAgBC,OAAMC,KAAI,SAAS;AAC3C,WAAS,OAAOC,UAAS;AACxB,UAAMC,SAAQ,YAAY,MAAM;AAC/B,aAAOF,IAAG,MAAMC,UAAS,IAAI;AAAA,IAC9B;AACA,WAAO,OAAOC,QAAOF,GAAE;AACvB,WAAO,eAAeE,QAAO,mBAAmB;AAAA,MAC/C,OAAO;AAAA,QACN,aAAa,MAAMA,OAAM,KAAKD,QAAO;AAAA,QACrC,aAAa,MAAMA,SAAQ;AAAA,QAC3B,YAAY,CAAC,KAAK,UAAU;AAC3B,UAAAA,SAAQ,GAAG,IAAI;AAAA,QAChB;AAAA,QACA,cAAc,CAAC,QAAQ;AACtB,iBAAO,OAAOA,UAAS,GAAG;AAAA,QAC3B;AAAA,MACD;AAAA,MACA,YAAY;AAAA,IACb,CAAC;AACD,eAAW,OAAOF,MAAM,QAAO,eAAeG,QAAO,KAAK,EAAE,MAAM;AACjE,aAAO,OAAO;AAAA,QACb,GAAGD;AAAA,QACH,CAAC,GAAG,GAAG;AAAA,MACR,CAAC;AAAA,IACF,EAAE,CAAC;AACH,WAAOC;AAAA,EACR;AACA,QAAM,QAAQ,OAAO,WAAW,CAAC,CAAC;AAClC,SAAO,eAAe,OAAO,MAAM;AAAA,IAClC,OAAOF;AAAA,IACP,YAAY;AAAA,EACb,CAAC;AACD,SAAO;AACR;AAEA,SAAS,wBAAwB;AAChC,SAAO,UAAU,EAAE,OAAO;AAC3B;AACA,IAAM,sBAAsB,uBAAO,IAAI,wBAAwB;AAC/D,IAAM,0BAA0B,uBAAO,IAAI,4BAA4B;AACvE,IAAM,qBAAqB,uBAAO,IAAI,uBAAuB;AAC7D,IAAM,yBAAyB,uBAAO,IAAI,2BAA2B;AA2BrE,SAAS,UAAUG,KAAI,UAAU,sBAAsB,GAAG;AACzD,cAAYA,KAAI,wBAA0B,CAAC,UAAU,CAAC;AACtD,QAAM,kBAAkC,oBAAI,MAAM,mBAAmB;AACrE,QAAM,UAAU,oBAAoB,IAAI;AACxC,SAAO,gBAAgB,EAAE,GAAG,aAAa,OAAO,OAAO,YAAY,kBAAkB,aAAaA,KAAI,SAAS,eAAe,GAAG,SAAS,MAAM,eAAe,GAAG;AAAA,IACjK,CAAC,mBAAmB,GAAG;AAAA,IACvB,CAAC,uBAAuB,GAAG;AAAA,EAC5B,CAAC,CAAC;AACH;AAkBA,SAAS,SAASA,KAAI,SAAS;AAC9B,cAAYA,KAAI,uBAAyB,CAAC,UAAU,CAAC;AACrD,QAAM,UAAU,oBAAoB,IAAI;AACxC,QAAM,kBAAkC,oBAAI,MAAM,mBAAmB;AACrE,SAAO,gBAAgB,EAAE,GAAG,YAAY,YAAY,kBAAkB,YAAYA,KAAI,SAAS,eAAe,GAAG,WAAW,sBAAsB,GAAG,MAAM,eAAe,CAAC;AAC5K;AAkBA,SAAS,WAAWA,KAAI,UAAU,sBAAsB,GAAG;AAC1D,cAAYA,KAAI,yBAA2B,CAAC,UAAU,CAAC;AACvD,QAAM,kBAAkC,oBAAI,MAAM,mBAAmB;AACrE,QAAM,UAAU,CAAC,SAASC,WAAU;AACnC,WAAO,aAAaD,KAAI,EAAE,OAAAC,OAAM,CAAC,EAAE,OAAO;AAAA,EAC3C;AACA,SAAO,gBAAgB,EAAE,GAAG,cAAc,OAAO,OAAO,YAAY,SAAS,WAAW,sBAAsB,GAAG,MAAM,iBAAiB,cAAc,GAAG;AAAA,IACxJ,CAAC,mBAAmB,GAAG;AAAA,IACvB,CAAC,uBAAuB,GAAG;AAAA,EAC5B,CAAC,CAAC;AACH;AAkBA,SAAS,UAAUD,KAAI,SAAS;AAC/B,cAAYA,KAAI,wBAA0B,CAAC,UAAU,CAAC;AACtD,QAAM,UAAU,CAAC,SAASC,WAAU;AACnC,WAAO,aAAaD,KAAI,EAAE,OAAAC,OAAM,CAAC,EAAE,OAAO;AAAA,EAC3C;AACA,SAAO,gBAAgB,EAAE,GAAG,aAAa,YAAY,SAAS,WAAW,sBAAsB,GAAG,MAAsB,oBAAI,MAAM,mBAAmB,GAAG,cAAc,CAAC;AACxK;AAmBA,IAAM,eAAe,eAAe,gBAAgB,CAACC,OAAM,SAAS,YAAY;AAC/E,EAAAA,MAAK,aAAa,CAAC;AACnB,EAAAA,MAAK,SAAS,KAAK,YAAY,SAAS,WAAW,sBAAsB,GAAG,MAAsB,oBAAI,MAAM,mBAAmB,GAAG,cAAc,CAAC;AAClJ,CAAC;AAwBD,IAAM,iBAAiB,eAAe,kBAAkB,CAACA,OAAM,SAAS,YAAY;AACnF,EAAAA,MAAK,eAAe,CAAC;AACrB,EAAAA,MAAK,WAAW,KAAK,YAAY,SAAS,WAAW,sBAAsB,GAAG,MAAsB,oBAAI,MAAM,mBAAmB,GAAG,cAAc,CAAC;AACpJ,CAAC;AA4BD,SAAS,UAAUF,KAAI,SAAS;AAC/B,cAAYA,KAAI,wBAA0B,CAAC,UAAU,CAAC;AACtD,QAAM,kBAAkC,oBAAI,MAAM,mBAAmB;AACrE,QAAM,kBAAkB,WAAW,sBAAsB;AACzD,QAAM,UAAU,oBAAoB,IAAI;AACxC,SAAO,gBAAgB,EAAE,GAAG,aAAa,OAAO,OAAO,kBAAkB,aAAaA,KAAI,SAAS,iBAAiB,CAAC,GAAG;AAAA,IACvH,CAAC,kBAAkB,GAAG;AAAA,IACtB,CAAC,sBAAsB,GAAG;AAAA,EAC3B,CAAC,CAAC;AACH;AA2BA,SAAS,WAAWA,KAAI,SAAS;AAChC,cAAYA,KAAI,yBAA2B,CAAC,UAAU,CAAC;AACvD,QAAM,kBAAkC,oBAAI,MAAM,mBAAmB;AACrE,QAAM,kBAAkB,WAAW,sBAAsB;AACzD,QAAM,UAAU,CAAC,SAAS,SAASC,WAAU;AAC5C,UAAM,UAAU,CAAC,QAAQD,IAAG,SAAS,KAAKC,MAAK;AAC/C,mBAAe,SAAS;AAAA,MACvB,OAAO;AAAA,MACP,UAAUD;AAAA,IACX,CAAC;AACD,WAAO,aAAa,SAAS,EAAE,OAAAC,OAAM,CAAC,EAAE,OAAO;AAAA,EAChD;AACA,SAAO,gBAAgB,EAAE,GAAG,cAAc,OAAO,OAAO,SAAS;AAAA,IAChE,CAAC,kBAAkB,GAAG;AAAA,IACtB,CAAC,sBAAsB,GAAG;AAAA,EAC3B,CAAC,CAAC;AACH;AACA,SAAS,kBAAkB,WAAWD,KAAI,SAAS,iBAAiB,eAAe,GAAG;AACrF,SAAO,IAAI,SAAS;AACnB,UAAMC,SAAQ,KAAK,GAAG,EAAE;AACxB,UAAM,SAAS,KAAK,MAAM,GAAG,EAAE;AAC/B,UAAM,UAAU,CAAC,QAAQD,IAAG,GAAG,QAAQ,KAAKC,MAAK;AACjD,mBAAe,SAAS;AAAA,MACvB,OAAO;AAAA,MACP,UAAUD;AAAA,IACX,CAAC;AACD,UAAM,WAAW,SAAS,YAAY;AACtC,UAAM,cAAc,UAAU,eAAeC,OAAM,IAAI;AACvD,WAAO,aAAa,SAAS;AAAA,MAC5B;AAAA,MACA;AAAA,MACA,SAAS;AAAA,MACT;AAAA,IACD,CAAC,EAAE;AAAA,EACJ;AACD;AAOA,SAAS,eAAe,MAAM,SAAS;AACtC,SAAO,CAACE,KAAI,YAAY;AACvB,gBAAYA,KAAI,IAAI,IAAI,cAAc,CAAC,UAAU,CAAC;AAClD,UAAM,UAAU,eAAe;AAC/B,QAAI,CAAC,QAAS,OAAM,IAAI,MAAM,QAAQ,IAAI,qCAAqC;AAC/E,WAAO,QAAQ,SAASA,KAAI,OAAO;AAAA,EACpC;AACD;AAEA,SAAS,uBAAuB,cAAc,OAAO;AACpD,MAAI;AACJ,MAAI;AACH,YAAQ,MAAM;AAAA,EACf,QAAQ;AAGP;AAAA,EACD;AACA,MAAI,CAAC,MAAO;AACZ,SAAO,gBAAgB,OAAO,EAAE,oBAAoB,CAAC,EAAE,CAAC,EAAE,KAAK,CAACC,WAAUA,OAAM,SAAS,YAAY;AACtG;AAiBA,SAAS,aAAaC,SAAQ,MAAM;AACnC,MAAI,CAACA,QAAO,WAAY;AACxB,QAAM,gBAAgB,IAAI,IAAIA,QAAO,KAAK,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC;AAChE,aAAW,OAAO,KAAM,KAAI,CAAC,cAAc,IAAI,GAAG,EAAG,OAAM,kBAAkBA,QAAO,MAAM,GAAG;AAC9F;AACA,SAAS,kBAAkB,eAAe,KAAK,SAAS,OAAO;AAC9D,MAAI,CAAC,cAAc,OAAQ,OAAM,IAAI,MAAM,8DAA8D,GAAG,KAAK,MAAM,yDAAyD;AAChL,QAAM,IAAI,MAAM,OAAO,MAAM,KAAK,GAAG;AAAA,EAA+D,cAAc,IAAI,CAACC,OAAM,KAAKA,GAAE,IAAI,GAAGA,GAAE,cAAc,KAAKA,GAAE,WAAW,KAAK,EAAE,EAAE,EAAE,KAAK,IAAI,CAAC,EAAE;AACrM;AA+OA,IAAM,QAAQ,YAAY;AAuB1B,IAAMC,QAAO,WAAW,SAAS,MAAM,aAAa,eAAe;AAClE,MAAI,eAAe,EAAG,OAAM,IAAI,MAAM,oJAAwJ;AAC9L,kBAAgB,EAAE,KAAK,GAAG,KAAK,MAAM,WAAW,IAAI,GAAG,aAAa,aAAa;AAClF,CAAC;AAsCD,IAAM,WAAW;AAuBjB,IAAM,KAAKA;AACX,IAAI;AACJ,IAAI;AACJ,IAAI;AACJ,SAAS,OAAO,WAAW,SAAS;AACnC,MAAI,CAAC,UAAW,OAAM,IAAI,MAAM,yBAAyB,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA,CAKhE;AACD;AAKA,SAAS,YAAY;AACpB,SAAO,QAAQ,YAAY;AAC3B,SAAO;AACR;AAmBA,SAAS,kBAAkB;AAC1B,QAAM,eAAe,iBAAiB,gBAAgB;AACtD,SAAO,cAAc,mBAAmB;AACxC,SAAO;AACR;AACA,SAAS,mBAAmB;AAC3B,SAAO;AAAA,IACN,WAAW,CAAC;AAAA,IACZ,UAAU,CAAC;AAAA,IACX,YAAY,CAAC;AAAA,IACb,WAAW,CAAC;AAAA,IACZ,YAAY,CAAC;AAAA,IACb,WAAW,CAAC;AAAA,EACb;AACD;AACA,IAAM,oBAAoB,OAAO;AACjC,SAAS,eAAe,aAAa,eAAe;AACnD,MAAI,iBAAiB,QAAQ,OAAO,kBAAkB,SAAU,OAAM,IAAI,UAAU,+IAA+I;AACnO,MAAI,UAAU,CAAC;AACf,MAAIC;AAEJ,MAAI,OAAO,kBAAkB,SAAU,WAAU,EAAE,SAAS,cAAc;AAAA,WACjE,OAAO,gBAAgB,SAAU,WAAU;AACpD,MAAI,OAAO,gBAAgB,YAAY;AACtC,QAAI,OAAO,kBAAkB,WAAY,OAAM,IAAI,UAAU,oFAAoF;AACjJ,IAAAA,MAAK;AAAA,EACN,WAAW,OAAO,kBAAkB,WAAY,CAAAA,MAAK;AACrD,SAAO;AAAA,IACN;AAAA,IACA,SAASA;AAAA,EACV;AACD;AAEA,SAAS,qBAAqB,MAAM,UAAU,MAAM;AAAC,GAAG,MAAM,MAAM,cAAc;AACjF,QAAM,QAAQ,CAAC;AACf,MAAIC;AACJ,YAAU,IAAI;AACd,QAAM,OAAO,SAASC,QAAO,IAAI,UAAU,CAAC,GAAG;AAC9C,UAAM,eAAe,iBAAiB,cAAc;AACpD,UAAM,cAAc,gBAAgB,iBAAiB,cAAc,OAAO,QAAQ,CAAC;AACnF,UAAM,WAAW,OAAO,CAAC,GAAG,YAAY,GAAG,QAAQ,QAAQ,IAAI,CAAC,CAAC;AACjE,UAAM,cAAc,SAAS,IAAI,CAAC,QAAQ;AACzC,YAAM,gBAAgB,OAAO,OAAO,MAAM,KAAK,CAACC,OAAMA,GAAE,SAAS,GAAG;AACpE,UAAI,CAAC,iBAAiB,OAAO,OAAO,WAAY,OAAM,kBAAkB,OAAO,OAAO,MAAM,GAAG;AAC/F,aAAO;AAAA,IACR,CAAC,EAAE,OAAO,CAAC,MAAM,KAAK,IAAI,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,YAAY,sBAAsB,KAAK,YAAY,kBAAkB,EAAE,OAAO,CAAC,KAAK,QAAQ;AAClJ,YAAM,EAAE,MAAAD,OAAM,aAAa,UAAU,MAAM,GAAGE,SAAQ,IAAI;AAC1D,aAAO,OAAO,KAAKA,QAAO;AAC1B,UAAI,KAAM,KAAI,OAAO,OAAO,OAAO,IAAI,QAAQ,uBAAO,OAAO,IAAI,GAAG,IAAI;AACxE,aAAO;AAAA,IACR,GAAG,CAAC,CAAC;AACL,UAAM,cAAc,QAAQ;AAC5B,cAAU;AAAA,MACT,GAAG,iBAAiB,cAAc;AAAA,MAClC,GAAG;AAAA,MACH,GAAG;AAAA,IACJ;AACA,UAAM,UAAU,QAAQ,WAAW,OAAO,OAAO;AAajD,UAAM,aAAa,cAAc;AACjC,UAAM,UAAU,YAAY;AAC5B,UAAM,WAAW,uBAAO,OAAO,IAAI;AACnC,QAAI,QAAS,QAAO,OAAO,UAAU,OAAO;AAC5C,QAAI,WAAY,QAAO,OAAO,UAAU,UAAU;AAClD,QAAI,YAAa,QAAO,OAAO,UAAU,WAAW;AACpD,UAAMC,QAAO;AAAA,MACZ,IAAI;AAAA,MACJ,MAAAH;AAAA,MACA,UAAU,eAAe,CAAC,cAAc,YAAY,iBAAiB,cAAc,MAAM,UAAUA,KAAI,CAAC;AAAA,MACxG,cAAc,eAAe,CAAC,cAAc,cAAcA,KAAI,CAAC;AAAA,MAC/D,OAAO;AAAA,MACP,MAAM,QAAQ;AAAA,MACd,OAAO,QAAQ;AAAA,MACf,SAAS;AAAA,MACT,MAAM;AAAA,MACN,MAAM,cAAc,QAAQ,iBAAiB,cAAc;AAAA,MAC3D;AAAA,MACA,OAAO,QAAQ,SAAS,OAAO,OAAO;AAAA,MACtC,SAAS,QAAQ,WAAW,OAAO,OAAO;AAAA,MAC1C,MAAM,QAAQ,OAAO,SAAS,QAAQ,OAAO,SAAS,QAAQ,OAAO,SAAS;AAAA,MAC9E,MAAM;AAAA,MACN,aAAa,CAAC;AAAA,MACd,WAAW,CAAC;AAAA,MACZ,YAAY,CAAC;AAAA,MACb,MAAM;AAAA,IACP;AACA,UAAM,UAAU,QAAQ;AACxB,QAAIG,MAAK,SAAS,SAAS,CAAC,QAAS,CAAAA,MAAK,OAAO;AACjD,QAAI,QAAQ,cAAc,OAAO,OAAO,SAAS,WAAY,CAAAA,MAAK,aAAa;AAC/E,IAAAA,MAAK,UAAU,cAAc;AAC7B,UAAM,UAAU,kBAAkBA,OAAM,MAAM;AAE9C,WAAO,eAAeA,OAAM,WAAW;AAAA,MACtC,OAAO;AAAA,MACP,YAAY;AAAA,IACb,CAAC;AACD,mBAAe,SAAS,QAAQ,YAAY,IAAI,aAAa,CAAC;AAC9D,UAAM,QAAQ,MAAM;AACpB,UAAM,kBAAkB;AACxB,UAAM,kBAAkC,oBAAI,MAAM,mBAAmB;AACrE,UAAM,kBAAkB;AACxB,QAAI,QAAS,OAAMA,OAAM,YAAY,WAAW,yBAAyB,aAAa,SAAS,EAAE,QAAQ,CAAC,GAAGA,KAAI,GAAGA,MAAK,QAAQ,MAAM,GAAG,SAAS,OAAO,iBAAiB,CAACC,IAAG,UAAU,eAAe,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC;AAC1N,QAAI,OAAO,OAAO,qBAAqB;AACtC,YAAM,QAAQ,uBAAuB,qBAAqB,eAAe;AACzE,UAAI,MAAO,CAAAD,MAAK,WAAW;AAAA,QAC1B,MAAM,MAAM;AAAA,QACZ,QAAQ,MAAM;AAAA,MACf;AAAA,IACD;AACA,UAAM,KAAKA,KAAI;AACf,WAAOA;AAAA,EACR;AACA,QAAME,QAAO,WAAW,SAASL,OAAM,aAAa,eAAe;AAClE,UAAM,EAAE,SAAS,QAAQ,IAAI,eAAe,aAAa,aAAa;AACtE,UAAM,aAAa,KAAK,cAAc,SAAS;AAC/C,QAAI,cAAc,KAAM,SAAQ,aAAa;AAC7C,UAAMK,QAAO,KAAK,WAAWL,KAAI,GAAG;AAAA,MACnC,GAAG;AAAA,MACH,GAAG;AAAA,MACH;AAAA,IACD,CAAC;AACD,IAAAK,MAAK,OAAO;AAAA,EACb,CAAC;AACD,QAAM,YAAY;AAAA,IACjB,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA,OAAAN;AAAA,IACA,SAAS;AAAA,IACT,MAAAM;AAAA,IACA,MAAMN,OAAM;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,IAAI;AAAA,EACL;AACA,WAAS,QAAQC,UAASF,KAAI;AAC7B,aAASC,MAAK,EAAEC,KAAI,EAAE,KAAK,GAAGF,GAAE;AAAA,EACjC;AACA,WAAS,UAAU,iBAAiB;AACnC,QAAI,OAAO,iBAAiB,SAAU,gBAAe,EAAE,SAAS,aAAa;AAC7E,UAAM,eAAe,iBAAiB,cAAc;AACpD,UAAM,aAAa,gBAAgB,iBAAiB,cAAc;AAClE,UAAM,YAAY,QAAQ,cAAc,IAAI;AAC5C,iBAAa,OAAO,QAAQ,SAAS;AACrC,IAAAC,SAAQ;AAAA,MACP,IAAI;AAAA,MACJ,MAAM;AAAA,MACN;AAAA,MACA,UAAU,eAAe,CAAC,cAAc,YAAY,iBAAiB,cAAc,MAAM,UAAU,IAAI,CAAC;AAAA,MACxG,cAAc,eAAe,CAAC,cAAc,cAAc,IAAI,CAAC;AAAA,MAC/D,OAAO;AAAA,MACP;AAAA,MACA;AAAA,MACA,MAAM,cAAc,QAAQ,iBAAiB,cAAc;AAAA,MAC3D,SAAS,cAAc;AAAA,MACvB,OAAO,CAAC;AAAA,MACR,MAAM,cAAc,QAAQ,uBAAO,OAAO,IAAI;AAAA,MAC9C,YAAY,cAAc;AAAA,MAC1B,MAAM,OAAO,CAAC,GAAG,YAAY,QAAQ,CAAC,GAAG,GAAG,SAAS,CAAC;AAAA,IACvD;AACA,QAAI,UAAU,mBAAmB,OAAO,OAAO,qBAAqB;AACnE,YAAM,QAAQ,MAAM;AACpB,YAAM,kBAAkB;AACxB,YAAM,QAAwB,oBAAI,MAAM,YAAY;AACpD,YAAM,kBAAkB;AACxB,YAAM,QAAQ,uBAAuB,qBAAqB,KAAK;AAC/D,UAAI,MAAO,CAAAA,OAAM,WAAW;AAAA,QAC3B,MAAM,MAAM;AAAA,QACZ,QAAQ,MAAM;AAAA,MACf;AAAA,IACD;AACA,aAASA,QAAO,iBAAiB,CAAC;AAAA,EACnC;AACA,WAAS,QAAQ;AAChB,UAAM,SAAS;AACf,cAAU,KAAK;AAAA,EAChB;AACA,iBAAe,QAAQ,MAAM;AAC5B,QAAI,CAAC,KAAM,OAAM,IAAI,UAAU,oCAAoC;AACnE,QAAI,QAAS,OAAM,aAAa,WAAW,MAAM,QAAQM,KAAI,CAAC;AAC9D,UAAM,cAAc,CAAC;AACrB,QAAI,eAAe;AACnB,QAAI,eAAe;AACnB,eAAWC,MAAK,OAAO;AACtB,YAAM,QAAQA,GAAE,SAAS,cAAc,MAAMA,GAAE,QAAQ,IAAI,IAAIA;AAC/D,kBAAY,KAAK,KAAK;AACtB,UAAI,MAAM,SAAS,UAAU,MAAM,SAAS,WAAW,MAAM,aAAc,gBAAe;AAC1F,UAAI,MAAM,SAAS,UAAU,MAAM,SAAS,WAAW,MAAM,aAAc,gBAAe;AAAA,IAC3F;AACA,IAAAP,OAAM,QAAQ;AACd,IAAAA,OAAM,eAAe;AACrB,IAAAA,OAAM,eAAe;AACrB,WAAOA;AAAA,EACR;AACA,cAAY,SAAS;AACrB,SAAO;AACR;AACA,SAAS,yBAAyBD,KAAI,MAAM;AAC3C,UAAQ,UAAU,SAAS;AAC1B,UAAM,WAAW,MAAMA,IAAG,GAAG,IAAI;AAEjC,QAAI,KAAK,UAAU;AAClB,YAAM,UAAU,MAAM,QAAQ,WAAW,KAAK,QAAQ,GAAG,IAAI,CAAC,MAAM,EAAE,WAAW,aAAa,EAAE,SAAS,MAAM,EAAE,OAAO,OAAO;AAC/H,UAAI,OAAO,OAAQ,OAAM;AAAA,IAC1B;AACA,WAAO;AAAA,EACR;AACD;AACA,SAAS,cAAc;AACtB,WAAS,QAAQ,MAAM,kBAAkB,kBAAkB;AAC1D,QAAI,eAAe,EAAG,OAAM,IAAI,MAAM,0IAA0I;AAChL,UAAM,eAAe,iBAAiB,gBAAgB;AACtD,QAAI,EAAE,SAAS,SAAS,QAAQ,IAAI,eAAe,kBAAkB,gBAAgB;AACrF,UAAM,EAAE,MAAM,YAAY,GAAG,cAAc,IAAI,cAAc,WAAW,CAAC;AAEzE,cAAU;AAAA,MACT,GAAG;AAAA,MACH,GAAG;AAAA,IACJ;AACA,UAAM,UAAU,KAAK,WAAW,QAAQ,WAAW,cAAc,SAAS,WAAW,QAAQ,OAAO,SAAS;AAC7G,QAAI,WAAW,KAAM,SAAQ,UAAU;AACvC,QAAI,OAAO,KAAK,QAAQ,QAAQ,OAAO,SAAS,KAAK,QAAQ,QAAQ,OAAO,SAAS,KAAK,QAAQ,QAAQ,OAAO,SAAS;AAE1H,QAAI,SAAS,SAAS,CAAC,QAAS,QAAO;AACvC,UAAM,aAAa,KAAK,cAAc,QAAQ;AAC9C,QAAI,cAAc,KAAM,SAAQ,aAAa;AAC7C,QAAI,WAAY,SAAQ,OAAO,OAAO,OAAO,uBAAO,OAAO,IAAI,GAAG,YAAY,QAAQ,IAAI;AAC1F,WAAO,qBAAqB,WAAW,IAAI,GAAG,SAAS,MAAM,KAAK,MAAM,OAAO;AAAA,EAChF;AACA,UAAQ,OAAO,SAAS,UAAU,MAAM;AACvC,UAAM,UAAU,oBAAoB,IAAI;AACxC,UAAMC,SAAQ,QAAQ,YAAY;AAClC,YAAQ,WAAW,QAAQ,IAAI;AAC/B,QAAI,MAAM,QAAQ,KAAK,KAAK,KAAK,OAAQ,SAAQ,qBAAqB,OAAO,IAAI;AACjF,WAAO,CAAC,MAAM,aAAa,gBAAgB;AAC1C,YAAM,QAAQ,WAAW,IAAI;AAC7B,YAAM,iBAAiB,MAAM,MAAM,MAAM,OAAO;AAChD,YAAM,EAAE,SAAS,QAAQ,IAAI,eAAe,aAAa,WAAW;AACpE,YAAM,UAAU,OAAO,gBAAgB;AACvC,YAAM,QAAQ,CAACO,IAAG,QAAQ;AACzB,cAAM,QAAQ,MAAM,QAAQA,EAAC,IAAIA,KAAI,CAACA,EAAC;AACvC,YAAI,QAAS,KAAI,eAAgB,CAAAP,OAAM,YAAY,OAAO,OAAO,GAAG,GAAG,UAAU,MAAM,QAAQ,GAAG,KAAK,IAAI,QAAQ,QAAQ,OAAO;AAAA,YAC7H,CAAAA,OAAM,YAAY,OAAO,OAAO,GAAG,GAAG,UAAU,MAAM,QAAQO,EAAC,IAAI,QAAQ,QAAQ,OAAO;AAAA,iBACtF,eAAgB,CAAAP,OAAM,YAAY,OAAO,OAAO,GAAG,GAAG,SAAS,UAAU,MAAM,QAAQ,GAAG,KAAK,IAAI,MAAM;AAAA,YAC7G,CAAAA,OAAM,YAAY,OAAO,OAAO,GAAG,GAAG,SAAS,UAAU,MAAM,QAAQO,EAAC,IAAI,MAAM;AAAA,MACxF,CAAC;AACD,cAAQ,WAAW,QAAQ,MAAM;AAAA,IAClC;AAAA,EACD;AACA,UAAQ,MAAM,SAAS,UAAU,MAAM;AACtC,UAAMP,SAAQ,oBAAoB,IAAI,EAAE,YAAY;AACpD,QAAI,MAAM,QAAQ,KAAK,KAAK,KAAK,OAAQ,SAAQ,qBAAqB,OAAO,IAAI;AACjF,WAAO,CAAC,MAAM,aAAa,gBAAgB;AAC1C,YAAM,QAAQ,WAAW,IAAI;AAC7B,YAAM,EAAE,SAAS,QAAQ,IAAI,eAAe,aAAa,WAAW;AACpE,YAAM,QAAQ,CAAC,MAAM,QAAQ;AAC5B,QAAAA,OAAM,YAAY,OAAO,QAAQ,IAAI,GAAG,GAAG,GAAG,SAAS,UAAU,MAAM,QAAQ,IAAI,IAAI,MAAM;AAAA,MAC9F,CAAC;AAAA,IACF;AAAA,EACD;AACA,UAAQ,SAAS,CAAC,cAAc,YAAY,MAAM,OAAO;AACzD,UAAQ,QAAQ,CAAC,cAAc,YAAY,QAAQ,MAAM;AACzD,SAAO,gBAAgB;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD,GAAG,OAAO;AACX;AACA,SAAS,oBAAoBD,KAAI;AAChC,QAAM,SAASA;AACf,SAAO,OAAO,SAAS,UAAU,MAAM;AACtC,UAAM,UAAU,oBAAoB,IAAI;AACxC,UAAMO,QAAO,QAAQ,YAAY;AACjC,YAAQ,WAAW,QAAQ,IAAI;AAC/B,QAAI,MAAM,QAAQ,KAAK,KAAK,KAAK,OAAQ,SAAQ,qBAAqB,OAAO,IAAI;AACjF,WAAO,CAAC,MAAM,aAAa,gBAAgB;AAC1C,YAAM,QAAQ,WAAW,IAAI;AAC7B,YAAM,iBAAiB,MAAM,MAAM,MAAM,OAAO;AAChD,YAAM,EAAE,SAAS,QAAQ,IAAI,eAAe,aAAa,WAAW;AACpE,YAAM,UAAU,OAAO,gBAAgB;AACvC,YAAM,QAAQ,CAACC,IAAG,QAAQ;AACzB,cAAM,QAAQ,MAAM,QAAQA,EAAC,IAAIA,KAAI,CAACA,EAAC;AACvC,YAAI,QAAS,KAAI,eAAgB,CAAAD,MAAK,YAAY,OAAO,OAAO,GAAG,GAAG,UAAU,MAAM,QAAQ,GAAG,KAAK,IAAI,QAAQ,QAAQ,OAAO;AAAA,YAC5H,CAAAA,MAAK,YAAY,OAAO,OAAO,GAAG,GAAG,UAAU,MAAM,QAAQC,EAAC,IAAI,QAAQ,QAAQ,OAAO;AAAA,iBACrF,eAAgB,CAAAD,MAAK,YAAY,OAAO,OAAO,GAAG,GAAG,SAAS,UAAU,MAAM,QAAQ,GAAG,KAAK,IAAI,MAAM;AAAA,YAC5G,CAAAA,MAAK,YAAY,OAAO,OAAO,GAAG,GAAG,SAAS,UAAU,MAAM,QAAQC,EAAC,IAAI,MAAM;AAAA,MACvF,CAAC;AACD,cAAQ,WAAW,QAAQ,MAAM;AAAA,IAClC;AAAA,EACD;AACA,SAAO,MAAM,SAAS,UAAU,MAAM;AACrC,UAAMD,QAAO,oBAAoB,IAAI,EAAE,YAAY;AACnD,QAAI,MAAM,QAAQ,KAAK,KAAK,KAAK,OAAQ,SAAQ,qBAAqB,OAAO,IAAI;AACjF,WAAO,CAAC,MAAM,aAAa,gBAAgB;AAC1C,YAAM,QAAQ,WAAW,IAAI;AAC7B,YAAM,EAAE,SAAS,QAAQ,IAAI,eAAe,aAAa,WAAW;AACpE,YAAM,QAAQ,CAAC,MAAM,QAAQ;AAE5B,cAAM,iBAAiB,UAAU,CAAC,QAAQ,QAAQ,MAAM,GAAG,IAAI;AAC/D,YAAI,eAAgB,gBAAe,gBAAgB;AAAA,UAClD,OAAO;AAAA,UACP,UAAU;AAAA,QACX,CAAC;AACD,QAAAA,MAAK,YAAY,OAAO,QAAQ,IAAI,GAAG,GAAG,GAAG,SAAS,cAAc;AAAA,MACrE,CAAC;AAAA,IACF;AAAA,EACD;AACA,SAAO,SAAS,SAAS,WAAW;AACnC,WAAO,YAAY,KAAK,OAAO;AAAA,EAChC;AACA,SAAO,QAAQ,SAAS,WAAW;AAClC,WAAO,YAAY,OAAO,KAAK;AAAA,EAChC;AAKA,WAAS,qBAAqB,gBAAgB,aAAa,SAAS;AAEnE,QAAI,OAAO,mBAAmB,SAAU,QAAO;AAC/C,UAAM,cAAc;AACpB,QAAI;AACJ,QAAI;AACJ,QAAI,YAAY,QAAQ;AAEvB,uBAAiB;AACjB,qBAAe;AAAA,IAChB,WAAW,gBAAgB,QAAQ,OAAO,gBAAgB,YAAY,CAAC,MAAM,QAAQ,WAAW,KAAK,aAAa,iBAAiB,WAAW,GAAG;AAEhJ,uBAAiB;AACjB,qBAAe,CAAC;AAAA,IACjB,OAAO;AAEN,uBAAiB;AACjB,qBAAe;AAAA,IAChB;AAEA,QAAI,OAAO,iBAAiB,YAAY;AACvC,YAAM,YAAY;AAElB,YAAM,UAAU,OAAO,KAAKE,SAAQ;AACnC,YAAI;AACJ,cAAM,YAAY,CAACT,QAAO;AACzB,cAAI,YAAY,OAAQ,OAAM,IAAI,MAAM,iHAAiH;AACzJ,oBAAUA;AAAA,QACX;AACA,cAAMS,KAAI,MAAM,UAAU,KAAK,EAAE,UAAU,CAAC,CAAC;AAC7C,YAAI,QAAS,OAAM,QAAQ;AAAA,MAC5B;AACA,qBAAe,SAAS,EAAE,UAAU,UAAU,CAAC;AAC/C,UAAI,eAAgB,QAAO,EAAE,CAAC,WAAW,GAAG,CAAC,SAAS,cAAc,EAAE;AACtE,aAAO,EAAE,CAAC,WAAW,GAAG,QAAQ;AAAA,IACjC;AAEA,QAAI,eAAgB,QAAO,EAAE,CAAC,WAAW,GAAG,CAAC,cAAc,cAAc,EAAE;AAC3E,WAAO,EAAE,CAAC,WAAW,GAAG,aAAa;AAAA,EACtC;AACA,SAAO,WAAW,SAAS,gBAAgB,aAAa,SAAS;AAChE,UAAM,eAAe,qBAAqB,gBAAgB,aAAa,OAAO;AAC9E,wBAAoB,IAAI,EAAE,YAAY,EAAE,SAAS,QAAQ,YAAY;AACrE,WAAO;AAAA,EACR;AACA,SAAO,SAAS,SAAS,UAAU;AAClC,YAAQ,KAAK,yGAAyG;AACtH,WAAO,KAAK,SAAS,QAAQ;AAAA,EAC9B;AACA,SAAO,SAAS,SAAS,gBAAgB,aAAa,SAAS;AAC9D,UAAM,eAAe,qBAAqB,gBAAgB,aAAa,OAAO;AAC9E,UAAM,WAAW,oBAAoB,IAAI,EAAE,YAAY,EAAE,OAAO,QAAQ,YAAY;AACpF,UAAMC,SAAQ,WAAW,SAAS,MAAMC,cAAa,eAAe;AACnE,MAAAX,IAAG,KAAK,MAAM,WAAW,IAAI,GAAGW,cAAa,aAAa;AAAA,IAC3D,CAAC;AACD,wBAAoBD,MAAK,EAAE,aAAa,EAAE,SAAS,CAAC;AACpD,WAAOA;AAAA,EACR;AACA,SAAO,WAAW;AAClB,SAAO,QAAQ;AACf,SAAO,aAAa;AACpB,SAAO,YAAY;AACnB,SAAO,YAAY;AACnB,SAAO,WAAW;AAClB,SAAO,aAAa;AACpB,SAAO,YAAY;AACnB,SAAO,gBAAgB;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD,GAAG,QAAQ,EAAE,UAAU,IAAI,aAAa,EAAE,CAAC;AAC5C;AACA,SAAS,WAAWV,KAAI;AACvB,SAAO,oBAAoBA,GAAE;AAC9B;AACA,SAAS,WAAW,MAAM;AACzB,SAAO,OAAO,SAAS,WAAW,OAAO,OAAO,SAAS,aAAa,KAAK,QAAQ,gBAAgB,OAAO,IAAI;AAC/G;AACA,SAAS,YAAY,UAAU,OAAO,KAAK;AAC1C,MAAI,SAAS,SAAS,IAAI,KAAK,SAAS,SAAS,IAAI;AAErD,eAAW,SAAS,QAAQ,OAAO,sBAAsB,EAAE,QAAQ,OAAO,GAAG,GAAG,EAAE,EAAE,QAAQ,QAAQ,GAAG,MAAM,CAAC,EAAE,EAAE,QAAQ,yBAAyB,IAAI;AACvJ,QAAM,QAAQ,SAAS,MAAM,GAAG,EAAE,SAAS;AAC3C,MAAI,SAAS,SAAS,IAAI,EAAG,EAAC,SAAS,MAAM,KAAK,KAAK,CAAC,GAAG,QAAQ,CAACM,IAAGE,OAAM;AAC5E,QAAI,cAAc,MAAMA,EAAC,CAAC,KAAK,OAAO,GAAG,MAAMA,EAAC,GAAG,EAAE,GAAG;AAEvD,UAAI,aAAa;AACjB,iBAAW,SAAS,QAAQ,OAAO,CAAC,UAAU;AAC7C;AACA,eAAO,eAAeA,KAAI,IAAI,QAAQ;AAAA,MACvC,CAAC;AAAA,IACF;AAAA,EACD,CAAC;AACD,QAAM,iBAAiB,EAAE,UAAU,OAAO,OAAO,6BAA6B;AAC9E,QAAM,eAAe,SAAS,MAAM,CAAC,CAAC;AACtC,WAAS,gBAAgB,GAAG;AAC3B,WAAO,EAAE,QAAQ,8BAA8B,CAACF,IAAG,QAAQ;AAC1D,YAAM,aAAa,QAAQ,KAAK,GAAG;AACnC,UAAI,CAAC,gBAAgB,CAAC,WAAY,QAAO,IAAI,GAAG;AAChD,YAAM,eAAe,aAAa,WAAW,OAAO,GAAG,IAAI;AAC3D,YAAM,QAAQ,eAAe,WAAW,MAAM,CAAC,GAAG,KAAK,YAAY,IAAI;AAEvE,UAAI,OAAO,UAAU,SAAU,QAAO,eAAe,OAAO,eAAe,QAAQ;AACnF,aAAO,QAAQ,OAAO,cAAc;AAAA,IACrC,CAAC;AAAA,EACF;AACA,MAAI,SAAS;AACb,MAAIE,KAAI;AACR;AAAA,IACC;AAAA,IACA;AAAA;AAAA,IAEA,CAAC,UAAU;AACV,UAAIA,KAAI,MAAO,WAAUI,QAAS,CAAC,MAAM,CAAC,GAAG,MAAMJ,IAAG,CAAC,GAAG,cAAc;AAAA,UACnE,WAAU,MAAM,CAAC;AAAA,IACvB;AAAA;AAAA,IAEA,CAAC,aAAa;AACb,gBAAU,gBAAgB,QAAQ;AAAA,IACnC;AAAA,EACD;AACA,SAAO;AACR;AAEA,SAAS,iBAAiB,OAAO,OAAO,SAAS,YAAY;AAC5D,MAAI,YAAY;AAChB,aAAWK,MAAK,MAAM,SAAS,KAAK,GAAG;AACtC,QAAI,YAAYA,GAAE,MAAO,YAAW,MAAM,MAAM,WAAWA,GAAE,KAAK,CAAC;AACnE,YAAQA,EAAC;AACT,gBAAYA,GAAE,QAAQA,GAAE,CAAC,EAAE;AAAA,EAC5B;AACA,MAAI,YAAY,MAAM,OAAQ,YAAW,MAAM,MAAM,SAAS,CAAC;AAChE;AACA,SAAS,qBAAqB,OAAO,MAAM;AAC1C,QAAM,SAAS,MAAM,KAAK,EAAE,EAAE,KAAK,EAAE,QAAQ,MAAM,EAAE,EAAE,MAAM,IAAI,EAAE,IAAI,CAACL,OAAMA,GAAE,MAAM,GAAG,CAAC,EAAE,CAAC;AAC7F,QAAM,MAAM,CAAC;AACb,WAASA,KAAI,GAAGA,KAAI,KAAK,MAAM,KAAK,SAAS,OAAO,MAAM,GAAGA,MAAK;AACjE,UAAM,UAAU,CAAC;AACjB,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAK,SAAQ,OAAO,CAAC,CAAC,IAAI,KAAKA,KAAI,OAAO,SAAS,CAAC;AACvF,QAAI,KAAK,OAAO;AAAA,EACjB;AACA,SAAO;AACR;AAqCA,eAAe,eAAe,MAAM,UAAU;AAC7C,QAAMM,UAAS,UAAU;AACzB,QAAM,QAAQ,uBAAuB,KAAK,KAAK,UAA0B,oBAAI,MAAM,aAAa,CAAC;AACjG,MAAI,OAAO;AACV,aAAS,WAAW;AAAA,MACnB,MAAM,MAAM;AAAA,MACZ,MAAM,MAAM;AAAA,MACZ,QAAQ,MAAM;AAAA,IACf;AACA,QAAI,SAAS,SAAS,sBAAuB,UAAS,WAAW,WAAW,SAAS;AAAA,EACtF;AACA,MAAI,MAAM,QAAQ,SAAS,WAAW,EAAG,YAAW,cAAc,SAAS,YAAa,0BAAyB,UAAU;AAE3H,MAAI,SAAS,SAAS,sBAAuB,QAAO;AACpD,MAAI,CAACA,QAAO,qBAAsB,OAAM,IAAI,MAAM,6CAA6C;AAC/F,QAAM,sBAAsBA,OAAM;AAClC,QAAM,mBAAmB,MAAMA,QAAO,qBAAqB,MAAM,QAAQ;AACzE,OAAK,UAAU,KAAK,gBAAgB;AACpC,SAAO;AACR;AACA,IAAM,QAAQ,CAAC;AACf,SAASN,KAAI,IAAIA,KAAI,IAAIA,KAAK,OAAM,KAAK,OAAO,aAAaA,EAAC,CAAC;AAC/D,SAASA,KAAI,IAAIA,KAAI,KAAKA,KAAK,OAAM,KAAK,OAAO,aAAaA,EAAC,CAAC;AAChE,SAASA,KAAI,GAAGA,KAAI,IAAIA,KAAK,OAAM,KAAKA,GAAE,SAAS,EAAE,CAAC;AACtD,MAAM,KAAK,KAAK,GAAG;AACnB,SAAS,iBAAiB,OAAO;AAChC,MAAI,SAAS;AACb,QAAM,MAAM,MAAM;AAClB,WAASA,KAAI,GAAGA,KAAI,KAAKA,MAAK,EAAG,KAAI,QAAQA,KAAI,GAAG;AACnD,UAAMO,MAAK,MAAMP,EAAC,IAAI,QAAQ;AAC9B,UAAMQ,MAAK,MAAMR,EAAC,IAAI,MAAM;AAC5B,cAAU,MAAMO,EAAC;AACjB,cAAU,MAAMC,EAAC;AACjB,cAAU;AAAA,EACX,WAAW,QAAQR,KAAI,GAAG;AACzB,UAAMO,MAAK,MAAMP,EAAC,IAAI,QAAQ;AAC9B,UAAMQ,MAAK,MAAMR,EAAC,IAAI,MAAM,KAAK,MAAMA,KAAI,CAAC,IAAI,QAAQ;AACxD,UAAM,KAAK,MAAMA,KAAI,CAAC,IAAI,OAAO;AACjC,cAAU,MAAMO,EAAC;AACjB,cAAU,MAAMC,EAAC;AACjB,cAAU,MAAM,CAAC;AACjB,cAAU;AAAA,EACX,OAAO;AACN,UAAMD,MAAK,MAAMP,EAAC,IAAI,QAAQ;AAC9B,UAAMQ,MAAK,MAAMR,EAAC,IAAI,MAAM,KAAK,MAAMA,KAAI,CAAC,IAAI,QAAQ;AACxD,UAAM,KAAK,MAAMA,KAAI,CAAC,IAAI,OAAO,KAAK,MAAMA,KAAI,CAAC,IAAI,QAAQ;AAC7D,UAAMS,KAAI,MAAMT,KAAI,CAAC,IAAI;AACzB,cAAU,MAAMO,EAAC;AACjB,cAAU,MAAMC,EAAC;AACjB,cAAU,MAAM,CAAC;AACjB,cAAU,MAAMC,EAAC;AAAA,EAClB;AACA,SAAO;AACR;AAOA,SAAS,qBAAqBV,OAAM,SAAS;AAE5C,YAAU,QAAQ,QAAQ,MAAM;AAC/B,QAAI,CAACA,MAAK,SAAU;AACpB,UAAM,QAAQA,MAAK,SAAS,QAAQ,OAAO;AAC3C,QAAI,UAAU,GAAI,CAAAA,MAAK,SAAS,OAAO,OAAO,CAAC;AAAA,EAChD,CAAC;AAED,MAAI,CAACA,MAAK,SAAU,CAAAA,MAAK,WAAW,CAAC;AACrC,EAAAA,MAAK,SAAS,KAAK,OAAO;AAC1B,SAAO;AACR;AAWA,SAAS,yBAAyB,YAAY;AAC7C,MAAI,WAAW,QAAQ,QAAQ,CAAC,WAAW,KAAM,OAAM,IAAI,UAAU,wEAAwE;AAC7I,MAAI,WAAW,QAAQ,WAAW,KAAM,OAAM,IAAI,UAAU,sFAAsF;AAClJ,MAAI,WAAW,QAAQ,WAAW,aAAc,OAAM,IAAI,UAAU,uEAAuE;AAE3I,MAAI,WAAW,gBAAgB,WAAY,YAAW,OAAO,iBAAiB,WAAW,IAAI;AAC7F,MAAI,WAAW,QAAQ,KAAM,YAAW,iBAAiB;AAC1D;AAEA,IAAM,QAAQ,WAAW,cAAc,WAAW,YAAY,IAAI,KAAK,WAAW,WAAW,IAAI,KAAK;AAEtG,IAAM,iBAAiB;AAEvB,IAAM,eAAe;AACrB,IAAM,eAAN,MAAmB;AAAA,EAClB,YAAY,MAAM;AAAA,EAClB;AAAA,EACA;AAAA,EACA,aAA6B,oBAAI,IAAI;AAAA,EACrC,YAAY,SAAS,WAAW;AAC/B,SAAK,UAAU,KAAK,YAAY;AAChC,UAAM,EAAE,YAAAW,YAAW,IAAI,cAAc;AACrC,SAAK,QAAQA,YAAW,WAAW,OAAO;AAE1C,SAAK,MAAM,QAAQ;AAAA,EACpB;AAAA,EACA,YAAY;AACX,WAAO,KAAK,UAAU,MAAM;AAAA,EAC7B;AAAA,EACA,WAAW;AACV,WAAO,MAAM,KAAK,KAAK;AAAA,EACxB;AAAA,EACA,QAAQ;AACP,UAAM,EAAE,cAAAC,cAAa,IAAI,cAAc;AACvC,IAAAA,cAAa,KAAK,KAAK;AAAA,EACxB;AAAA;AAAA,EAEA,SAAS;AACR,WAAO,KAAK,IAAI,KAAK,MAAM,KAAK,UAAU,CAAC,IAAI,gBAAgB,CAAC;AAAA,EACjE;AAAA;AAAA,EAEA,MAAM,MAAM,SAAS,SAAS,QAAQ;AACrC,UAAM,YAAY;AAAA,MACjB;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS,MAAM,IAAI;AAAA,IACpB;AACA,SAAK,WAAW,IAAI,SAAS;AAC7B,YAAQ,QAAQ,MAAM,KAAK,WAAW,OAAO,SAAS,CAAC,EAAE,MAAM,MAAM;AAAA,IAAC,CAAC;AACvE,WAAO;AAAA,EACR;AAAA;AAAA;AAAA;AAAA,EAIA,SAAS;AACR,QAAI,CAAC,KAAK,WAAW,KAAM;AAC3B,UAAM,aAAa,CAAC,GAAG,KAAK,UAAU;AACtC,UAAM,UAAU,MAAM,WAAW,OAAO,CAAC,cAAc,KAAK,WAAW,IAAI,SAAS,CAAC;AACrF,UAAM,MAAM,WAAW,OAAO,CAAC,cAAc,UAAU,WAAW,KAAK,OAAO;AAC9E,QAAI,CAAC,IAAI;AAET,aAAO,QAAQ,QAAQ,UAAU;AACjC,UAAM,EAAE,YAAAD,YAAW,IAAI,cAAc;AACrC,UAAME,aAAY,KAAK,IAAI,GAAG,IAAI,IAAI,CAAC,cAAc,UAAU,OAAO,CAAC,IAAI;AAC3E,WAAO,QAAQ,KAAK,CAAC,QAAQ,IAAI,IAAI,IAAI,CAAC,cAAc,UAAU,OAAO,CAAC,EAAE,KAAK,OAAO,GAAG,IAAI,QAAQ,CAACC,aAAYH,YAAW,MAAM;AACpI,MAAAG,SAAQ,QAAQ,CAAC;AAAA,IAElB,GAAG,KAAK,IAAID,aAAY,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,EACvC;AACD;AAEA,IAAM,mBAAmB;AAAA,EACxB,OAAO,CAAC;AAAA,EACR,cAAc;AACf;AACA,SAAS,YAAY,MAAM;AAC1B,mBAAiB,cAAc,MAAM,KAAK,IAAI;AAC/C;AACA,eAAe,aAAanB,QAAOD,KAAI;AACtC,QAAM,OAAO,iBAAiB;AAC9B,mBAAiB,eAAeC;AAChC,QAAMD,IAAG;AACT,mBAAiB,eAAe;AACjC;AACA,SAAS,YAAYA,KAAI,SAAS,SAAS,OAAO,iBAAiB,WAAW;AAC7E,MAAI,WAAW,KAAK,YAAY,OAAO,kBAAmB,QAAOA;AAEjE,UAAQ,SAAS,kBAAkB,MAAM;AACxC,UAAMc,UAAS,UAAU;AACzB,UAAM,mBAAmBA,QAAO;AAChC,WAAO,IAAI,QAAQ,CAAC,UAAU,YAAY;AACzC,UAAI,UAAU;AACd,YAAM,WAAW,IAAI,aAAa,SAAS,MAAM;AAGhD,cAAM,UAAU,SAAS,OAAO;AAChC,YAAI,SAAS;AACZ,kBAAQ,KAAK,oBAAoB,MAAM;AACvC;AAAA,QACD;AACA,2BAAmB;AAAA,MACpB,CAAC;AACD,MAAAA,QAAO,YAAY;AACnB,eAAS,mBAAmB,SAAS;AACpC,YAAI,QAAS;AACb,kBAAU;AACV,cAAM,QAAQ,iBAAiB,QAAQ,SAAS,iBAAiB,OAAO;AACxE,oBAAY,MAAM,KAAK;AACvB,gBAAQ,KAAK;AAAA,MACd;AACA,eAASO,SAAQ,QAAQ;AACxB,QAAAP,QAAO,YAAY;AACnB,iBAAS,MAAM;AAIf,YAAI,SAAS,SAAS,GAAG;AACxB,6BAAmB;AACnB;AAAA,QACD;AACA,kBAAU;AACV,iBAAS,MAAM;AAAA,MAChB;AACA,eAAS,OAAO,OAAO;AACtB,YAAI,QAAS;AACb,kBAAU;AACV,QAAAA,QAAO,YAAY;AACnB,iBAAS,MAAM;AACf,gBAAQ,KAAK;AAAA,MACd;AAEA,UAAI;AACH,cAAM,SAASd,IAAG,GAAG,IAAI;AAGzB,YAAI,OAAO,WAAW,YAAY,UAAU,QAAQ,OAAO,OAAO,SAAS,WAAY,QAAO,KAAKqB,UAAS,MAAM;AAAA,YAC7G,CAAAA,SAAQ,MAAM;AAAA,MACpB,SAEI,OAAO;AACV,eAAO,KAAK;AAAA,MACb;AAAA,IACD,CAAC;AAAA,EACF;AACD;AACA,SAAS,WAAWrB,KAAI,QAAQ;AAC/B,UAAQ,SAAS,iBAAiB,MAAM;AACvC,WAAO,IAAI,QAAQ,CAACqB,UAAS,WAAW;AACvC,YAAM,UAAU,MAAM,OAAO,OAAO,MAAM;AAC1C,aAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AACxD,YAAM,UAAU,MAAM,OAAO,oBAAoB,SAAS,OAAO;AACjE,UAAI;AACH,cAAM,SAASrB,IAAG,GAAG,IAAI;AACzB,YAAI,OAAO,WAAW,YAAY,UAAU,QAAQ,OAAO,OAAO,SAAS,WAAY,QAAO,KAAK,CAAC,UAAU;AAC7G,kBAAQ;AACR,UAAAqB,SAAQ,KAAK;AAAA,QACd,GAAG,CAAC,UAAU;AACb,kBAAQ;AACR,iBAAO,KAAK;AAAA,QACb,CAAC;AAAA,aACI;AACJ,kBAAQ;AACR,UAAAA,SAAQ,MAAM;AAAA,QACf;AAAA,MACD,SAAS,OAAO;AACf,gBAAQ;AACR,eAAO,KAAK;AAAA,MACb;AAAA,IACD,CAAC;AAAA,EACF;AACD;AACA,IAAM,mBAAmC,oBAAI,QAAQ;AACrD,SAAS,eAAe,CAAC,OAAO,GAAG,OAAO;AACzC,MAAI,QAAS,oBAAmB,SAAS,KAAK;AAC/C;AACA,SAAS,mBAAmB,SAAS,OAAO;AAC3C,mBAAiB,IAAI,OAAO,GAAG,MAAM,KAAK;AAC3C;AACA,SAAS,kBAAkBd,OAAMO,SAAQ;AACxC,QAAM,UAAU,WAAW;AAC1B,UAAM,IAAI,MAAM,oDAAoD;AAAA,EACrE;AACA,MAAI,kBAAkB,iBAAiB,IAAI,OAAO;AAClD,MAAI,CAAC,iBAAiB;AACrB,sBAAkB,IAAI,gBAAgB;AACtC,qBAAiB,IAAI,SAAS,eAAe;AAAA,EAC9C;AACA,UAAQ,SAAS,gBAAgB;AACjC,UAAQ,OAAOP;AACf,UAAQ,OAAO,CAAC,WAAW,SAAS;AACnC,QAAI,cAAc;AAElB;AACA,IAAAA,MAAK,WAAW,EAAE,OAAO,OAAO;AAChC,IAAAA,MAAK,OAAO,UAAU;AACtB,UAAM,IAAI,aAAa,oCAAoCA,OAAM,OAAO,cAAc,WAAW,YAAY,IAAI;AAAA,EAClH;AACA,UAAQ,YAAY,CAAC,SAASe,OAAM,eAAe;AAClD,QAAIf,MAAK,UAAUA,MAAK,OAAO,UAAU,MAAO,OAAM,IAAI,MAAM,4DAA4DA,MAAK,IAAI,gCAAgCA,MAAK,OAAO,KAAK,kBAAkB;AACxM,UAAM,aAAa;AAAA,MAClB;AAAA,MACA,MAAM,OAAOe,UAAS,YAAYA,UAAS,SAAS,WAAWA;AAAA,IAChE;AACA,UAAM,uBAAuB,OAAOA,UAAS,WAAWA,QAAO;AAC/D,QAAI,sBAAsB;AACzB,iBAAW,aAAa;AACxB,+BAAyB,WAAW,UAAU;AAAA,IAC/C;AACA,WAAO,qBAAqBf,OAAM,eAAeA,OAAM;AAAA,MACtD,MAAM;AAAA,MACN;AAAA,IACD,CAAC,EAAE,KAAK,OAAO,EAAE,YAAAgB,YAAW,MAAM;AACjC,UAAI,CAACT,QAAO,eAAgB,OAAM,IAAI,MAAM,+CAA+C;AAC3F,YAAM,sBAAsBA,OAAM;AAClC,YAAM,qBAAqB,MAAMA,QAAO,eAAeP,OAAMgB,WAAU;AACvE,MAAAhB,MAAK,YAAY,KAAK,kBAAkB;AACxC,aAAO;AAAA,IACR,CAAC,CAAC;AAAA,EACH;AACA,UAAQ,eAAe,CAAC,SAAS,YAAY;AAC5C,IAAAA,MAAK,aAAa,CAAC;AACnB,IAAAA,MAAK,SAAS,KAAK,YAAY,SAAS,WAAWO,QAAO,OAAO,aAAa,MAAsB,oBAAI,MAAM,mBAAmB,GAAG,CAACR,IAAG,UAAU,gBAAgB,MAAM,KAAK,CAAC,CAAC;AAAA,EAChL;AACA,UAAQ,iBAAiB,CAAC,SAAS,YAAY;AAC9C,IAAAC,MAAK,eAAe,CAAC;AACrB,IAAAA,MAAK,WAAW,KAAK,YAAY,SAAS,WAAWO,QAAO,OAAO,aAAa,MAAsB,oBAAI,MAAM,mBAAmB,GAAG,CAACR,IAAG,UAAU,gBAAgB,MAAM,KAAK,CAAC,CAAC;AAAA,EAClL;AACA,SAAOQ,QAAO,oBAAoB,OAAO,KAAK;AAC/C;AACA,SAAS,iBAAiB,QAAQ,SAAS,iBAAiB,SAAS;AACpE,QAAM,UAAU,SAAS,SAAS,sBAAsB,QAAQ,IAAI,CAAC,cAAc,UAAU,IAAI,EAAE,KAAK,IAAI,CAAC,KAAK;AAElH,QAAM,sBAAsB,SAAS,GAAG,EAAE,GAAG;AAC7C,MAAI,oBAAqB,mBAAkB;AAC3C,QAAM,UAAU,GAAG,SAAS,SAAS,MAAM,iBAAiB,OAAO,KAAK,OAAO;AAAA,4BAAgC,SAAS,SAAS,MAAM,8EAA8E,SAAS,gBAAgB,aAAa;AAC3P,QAAM,QAAQ,IAAI,MAAM,OAAO;AAC/B,MAAI,iBAAiB,MAAO,OAAM,QAAQ,gBAAgB,MAAM,QAAQ,gBAAgB,SAAS,MAAM,OAAO;AAC9G,SAAO;AACR;AASA,IAAM,QAAQ,WAAW,cAAc,WAAW,YAAY,IAAI,KAAK,WAAW,WAAW,IAAI,KAAK;AA+FtG,IAAM,MAAM,WAAW,cAAc,WAAW,YAAY,IAAI,KAAK,WAAW,WAAW,IAAI,KAAK;AACpG,IAAM,UAAU,KAAK;AACrB,IAAM,EAAE,cAAAU,eAAc,YAAAC,YAAW,IAAI,cAAc;AAkPnD,IAAM,QAAwB,oBAAI,IAAI;AACtC,IAAM,cAAc,CAAC;AACrB,IAAM,sBAAsB,CAAC;AAC7B,SAAS,gBAAgBC,SAAQ;AAChC,MAAI,MAAM,MAAM;AACf,UAAM,YAAY,MAAM,KAAK,KAAK,EAAE,IAAI,CAAC,CAAC,IAAI,IAAI,MAAM;AACvD,aAAO;AAAA,QACN;AAAA,QACA,KAAK,CAAC;AAAA,QACN,KAAK,CAAC;AAAA,MACP;AAAA,IACD,CAAC;AACD,UAAM,IAAIA,QAAO,eAAe,WAAW,WAAW;AACtD,QAAI,GAAG;AACN,0BAAoB,KAAK,CAAC;AAG1B,QAAE,KAAK,MAAM,oBAAoB,OAAO,oBAAoB,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM;AAAA,MAAC,CAAC;AAAA,IACrF;AACA,gBAAY,SAAS;AACrB,UAAM,MAAM;AAAA,EACb;AACD;AACA,eAAe,sBAAsBA,SAAQ;AAC5C,kBAAgBA,OAAM;AACtB,QAAM,QAAQ,IAAI,mBAAmB;AACtC;AACA,SAAS,SAASC,KAAI,IAAI;AACzB,MAAI,OAAO;AACX,MAAI;AACJ,SAAO,SAASC,SAAQ,MAAM;AAC7B,UAAMC,OAAM,QAAQ;AACpB,QAAIA,OAAM,OAAO,IAAI;AACpB,aAAOA;AACP,MAAAC,cAAa,WAAW;AACxB,oBAAc;AACd,aAAOH,IAAG,MAAM,MAAM,IAAI;AAAA,IAC3B;AAEA,oBAAgBI,YAAWH,MAAK,KAAK,IAAI,GAAG,IAAI,GAAG,IAAI;AAAA,EACxD;AACD;AAEA,IAAM,2BAA2B,SAAS,iBAAiB,GAAG;;;ACntH9D,IAAM,oBAAoB;AAI1B,SAAS,iBAAiB;AAEzB,QAAM,cAAc,WAAW,iBAAiB;AAChD,MAAI,CAAC,YAAa,OAAM,IAAI,MAAM,+bAA6c;AAC/e,SAAO;AACR;AAcA,SAAS,iBAAiB;AACzB,SAAO,OAAO,YAAY,eAAe,CAAC,CAAC,QAAQ;AACpD;AACA,SAAS,aAAa,SAAS,aAAa,OAAO;AAClD,QAAM,YAAY;AAAA,IACjB;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAG,CAAC,aAAa,CAAC,QAAQ,IAAI,CAAC;AAAA,EAChC;AACA,UAAQ,cAAc,QAAQ,CAAC,MAAM,SAAS;AAC7C,QAAI,UAAU,KAAK,CAAC,OAAO,GAAG,KAAK,IAAI,CAAC,EAAG;AAC3C,SAAK,UAAU;AACf,SAAK,UAAU;AACf,SAAK,YAAY;AACjB,SAAK,UAAU,MAAM;AAAA,EACtB,CAAC;AACF;;;ACxCA,SAAS,eAAeI,KAAI;AAC3B,SAAO,OAAOA,QAAO,cAAc,qBAAqBA,OAAMA,IAAG,oBAAoB;AACtF;AACA,IAAM,eAA+B,oBAAI,IAAI;AAI7C,IAAM,oBAAoC,oBAAI,IAAI;AAClD,IAAM,eAAe,kBAAkB,IAAI,KAAK,iBAAiB;AACjE,IAAM,mBAAmC,oBAAI,IAAI;AACjD,IAAM,iBAAiB,IAAI,qBAAqB,CAAC,QAAQ;AACxD,mBAAiB,OAAO,GAAG;AAC5B,CAAC;AACD,IAAM,eAA+B,oBAAI,QAAQ;AACjD,IAAM,iBAAiC,oBAAI,QAAQ;AACnD,SAAS,mBAAmB,UAAU,CAAC,GAAG;AACzC,QAAM,EAAE,wBAAwB,SAAS,oBAAoB,2BAA2B,gBAAgB,IAAI;AAC5G,MAAI,QAAS,cAAa,IAAI,OAAO;AACrC,QAAMC,UAAS,iBAAiB,sBAAsB;AACtD,QAAM,QAAQ,gBAAgB;AAC9B,QAAM,OAAO,WAAW;AAAA,IACvB,QAAAA;AAAA,IACA;AAAA,IACA,GAAG;AAAA,EACJ,CAAC;AACD,QAAM,cAAc,sBAAsB,yBAAyB,UAAU;AAC7E,SAAO,eAAe,MAAM,UAAU;AAAA,IACrC,UAAU;AAAA,IACV,YAAY;AAAA,IACZ,OAAO;AAAA,IACP,cAAc;AAAA,EACf,CAAC;AAID,MAAI,gBAAiB,CAAAA,QAAO,WAAW,KAAK,QAAQ;AACpD,eAAa,IAAI,MAAMA,OAAM;AAC7B,iBAAe,IAAI,OAAO,IAAI;AAC9B,QAAM,MAAM,IAAI,QAAQ,IAAI;AAC5B,mBAAiB,IAAI,GAAG;AACxB,iBAAe,SAAS,MAAM,GAAG;AACjC,OAAK,kBAAkB;AACvB,OAAK,wBAAwB,MAAM;AAGlC,WAAOA,QAAO,wBAAwB,CAAC,KAAKA,QAAO;AAAA,EACpD;AAKA,QAAM,sBAAsB,MAAM;AACjC,QAAI,CAAC,QAAQ,kBAAkB,OAAQ,uBAAsB,MAAMA,QAAO,wBAAwB,CAAC,KAAKA,QAAO,sBAAsB,sBAAsB;AAAA,EAC5J;AACA,SAAO,eAAe,MAAM,QAAQ;AAAA,IACnC,cAAc;AAAA,IACd,YAAY;AAAA,IACZ,UAAU;AAAA,IACV,OAAO;AAAA,EACR,CAAC;AACD,OAAK,qBAAqB,SAASC,oBAAmB,gBAAgB;AACrE,IAAAD,QAAO,qBAAqB;AAC5B,wBAAoB;AACpB,WAAO;AAAA,EACR;AACA,OAAK,yBAAyB,SAAS,uBAAuB,gBAAgB;AAC7E,IAAAA,QAAO,wBAAwB,KAAK,cAAc;AAClD,wBAAoB;AACpB,WAAO;AAAA,EACR;AACA,OAAK,qBAAqB,SAAS,mBAAmB,gBAAgB,UAAU;AAC/E,UAAM,yBAAyBA,QAAO;AACtC,UAAM,8BAA8BA,QAAO;AAC3C,UAAM,QAAQ,MAAM;AACnB,MAAAA,QAAO,qBAAqB;AAC5B,MAAAA,QAAO,0BAA0B;AACjC,0BAAoB;AAAA,IACrB;AACA,IAAAA,QAAO,qBAAqB;AAC5B,IAAAA,QAAO,0BAA0B,CAAC;AAClC,wBAAoB;AACpB,UAAM,cAAc,SAAS;AAC7B,QAAI,OAAO,gBAAgB,YAAY,OAAO,aAAa,SAAS,WAAY,QAAO,YAAY,KAAK,MAAM;AAC7G,YAAM;AACN,aAAO;AAAA,IACR,CAAC;AAAA,QACI,OAAM;AACX,WAAO;AAAA,EACR;AACA,OAAK,iBAAiB,SAAS,iBAAiB;AAC/C,WAAO,KAAK,mBAAmB,WAAW;AACzC,aAAO;AAAA,IACR,CAAC;AAAA,EACF;AACA,OAAK,kBAAkB,SAAS,gBAAgB,OAAO;AACtD,WAAO,KAAK,mBAAmB,WAAW;AACzC,UAAI,WAAY,uBAAsB,iBAAiB;AACvD,aAAO;AAAA,IACR,CAAC;AAAA,EACF;AACA,OAAK,sBAAsB,SAAS,oBAAoB,OAAO;AAC9D,WAAO,KAAK,uBAAuB,WAAW;AAC7C,UAAI,WAAY,uBAAsB,qBAAqB;AAC3D,aAAO;AAAA,IACR,CAAC;AAAA,EACF;AACA,OAAK,YAAY,SAAS,UAAU,OAAO;AAE1C,WAAO,KAAK,mBAAmB,WAAW;AACzC,YAAM;AAAA,IACP,CAAC;AAAA,EACF;AACA,OAAK,gBAAgB,SAAS,cAAc,OAAO;AAElD,WAAO,KAAK,uBAAuB,WAAW;AAC7C,YAAM;AAAA,IACP,CAAC;AAAA,EACF;AACA,OAAK,oBAAoB,SAAS,kBAAkB,OAAO;AAC1D,WAAO,KAAK,mBAAmB,WAAW;AACzC,UAAI,WAAY,uBAAsB,mBAAmB;AACzD,aAAO,QAAQ,QAAQ,KAAK;AAAA,IAC7B,CAAC;AAAA,EACF;AACA,OAAK,wBAAwB,SAAS,sBAAsB,OAAO;AAClE,WAAO,KAAK,uBAAuB,WAAW;AAC7C,UAAI,WAAY,uBAAsB,uBAAuB;AAC7D,aAAO,QAAQ,QAAQ,KAAK;AAAA,IAC7B,CAAC;AAAA,EACF;AACA,OAAK,oBAAoB,SAAS,kBAAkB,OAAO;AAC1D,WAAO,KAAK,mBAAmB,WAAW;AACzC,UAAI,WAAY,uBAAsB,mBAAmB;AACzD,aAAO,QAAQ,OAAO,KAAK;AAAA,IAC5B,CAAC;AAAA,EACF;AACA,OAAK,wBAAwB,SAAS,sBAAsB,OAAO;AAClE,WAAO,KAAK,uBAAuB,WAAW;AAC7C,UAAI,WAAY,uBAAsB,uBAAuB;AAC7D,aAAO,QAAQ,OAAO,KAAK;AAAA,IAC5B,CAAC;AAAA,EACF;AACA,OAAK,YAAY,SAAS,YAAY;AACrC,UAAM,QAAQ,CAAC;AACf,UAAM,WAAW,CAAC;AAClB,UAAM,YAAY,CAAC;AACnB,UAAM,sBAAsB,CAAC;AAC7B,UAAM,UAAU,CAAC;AACjB,UAAM,iBAAiB,CAAC;AACxB,sBAAkB,OAAO,IAAI;AAC7B,WAAO;AAAA,EACR;AACA,OAAK,YAAY,SAAS,YAAY;AACrC,SAAK,UAAU;AACf,IAAAA,QAAO,qBAAqB,4BAA4B,qBAAqB;AAC7E,IAAAA,QAAO,WAAW,kBAAkB,KAAK,QAAQ,YAAY;AAC7D,IAAAA,QAAO,0BAA0B,CAAC;AAClC,wBAAoB;AACpB,WAAO;AAAA,EACR;AACA,OAAK,cAAc,SAAS,cAAc;AACzC,SAAK,UAAU;AACf,WAAO,UAAU;AAAA,EAClB;AACA,OAAK,WAAW,SAAS,SAAS,MAAM;AACvC,QAAI,OAAO,SAAS,SAAU,CAAAA,QAAO,WAAW;AAChD,WAAO;AAAA,EACR;AACA,OAAK,cAAc,SAAS,cAAc;AACzC,WAAOA,QAAO,YAAY;AAAA,EAC3B;AACA,MAAI,OAAO,QAAS,MAAK,OAAO,OAAO,IAAI,MAAM,KAAK,YAAY;AAClE,MAAI,mBAAoB,MAAK,mBAAmB,kBAAkB;AAAA;AAGlE,wBAAoB;AACpB,SAAO;AACR;AACA,SAAS,GAAG,wBAAwB;AAGnC,MAAI,0BAA0B,QAAQ,eAAe,sBAAsB,EAAG,QAAO;AACrF,SAAO,mBAAmB;AAAA;AAAA,IAEzB,oBAAoB;AAAA;AAAA;AAAA,IAGpB,2BAA2B;AAAA,EAC5B,CAAC;AACF;AACA,SAAS,MAAME,SAAQ,KAAK,UAAU;AACrC,EAAAC,QAAOD,WAAU,MAAM,mGAAmG;AAC1H,EAAAC,QAAO,OAAOD,YAAW,YAAY,OAAOA,YAAW,YAAY,yCAAyC;AAC5G,QAAM,CAAC,0BAA0B,kBAAkB,IAAI,cAAcA,SAAQ,GAAG,KAAK,CAAC;AACtF,EAAAC,QAAO,sBAAsB,OAAOD,SAAQ,iBAAiB,OAAO,GAAG,CAAC,2BAA2B,OAAOA,OAAM,GAAG;AACnH,MAAI,aAAa,YAAY;AAC7B,MAAI,MAAM;AAEV,MAAI,eAAe,WAAW,sBAAsB,mBAAmB,SAAS,QAAQ,mBAAmB,KAAK;AAC/G,iBAAa;AACb,UAAM;AAAA,EACP;AACA,MAAI;AACJ,MAAI,oBAAoB;AACvB,eAAW,mBAAmB,UAAU;AAIxC,QAAI,YAAY,QAAQ,eAAe,QAAS,YAAWA,QAAO,GAAG;AAAA,EACtE,WAAW,eAAe,QAAS,YAAW,MAAMA,QAAO,GAAG;AAAA,MACzD,YAAWA,QAAO,GAAG;AAC1B,QAAM,yBAAyB,OAAO,WAAW,SAAS,IAAI;AAC9D,QAAM,eAAe,OAAO;AAC5B,EAAAC;AAAA;AAAA,IAEC,iBAAiB,cAAc,eAAe,WAAW,YAAY;AAAA,IACrE,mDAAmD,YAAY;AAAA,EAChE;AACA,MAAI,eAAe,sBAAsB,EAAG,QAAO;AACnD,QAAM,WAAW,CAAC,OAAO;AACxB,UAAM,EAAE,OAAO,GAAG,KAAK,IAAI,sBAAsB;AAAA,MAChD,cAAc;AAAA,MACd,UAAU;AAAA,IACX;AACA,QAAI,eAAe,QAAS,QAAO,KAAK;AACxC,SAAK,UAAU,IAAI;AACnB,WAAO,eAAeD,SAAQ,KAAK,IAAI;AAAA,EACxC;AACA,QAAM,UAAU,MAAM;AAGrB,QAAI,6BAA6BA,QAAQ,SAAQ,eAAeA,SAAQ,GAAG;AAAA,aAClE,sBAAsB,CAAC,SAAU,QAAO,eAAeA,SAAQ,KAAK,kBAAkB;AAAA,QAC1F,UAAS,QAAQ;AAAA,EACvB;AACA,QAAM,OAAO,mBAAmB;AAAA,IAC/B;AAAA,IACA;AAAA,IACA,iBAAiB;AAAA,EAClB,CAAC;AACD,MAAI;AACH,aAAS,MAAM,MAAM,OAAO,IAAI;AAAA,EACjC,SAAS,OAAO;AACf,QAAI,iBAAiB,aAAa,OAAO,eAAeA,QAAO,OAAO,WAAW,MAAM,aAAa,MAAM,QAAQ,SAAS,0BAA0B,KAAK,MAAM,QAAQ,SAAS,iCAAiC,KAAK,MAAM,QAAQ,SAAS,0CAA0C,GAAI,OAAM,IAAI,UAAU,yBAAyB,OAAO,GAAG,CAAC,kHAAkH,EAAE,OAAO,MAAM,CAAC;AACtd,UAAM;AAAA,EACP;AACA,SAAO;AACR;AACA,SAAS,cAAc,KAAK,QAAQ;AACnC,QAAM,gBAAgB,OAAO,yBAAyB,KAAK,MAAM;AACjE,MAAI,cAAe,QAAO,CAAC,KAAK,aAAa;AAC7C,MAAI,eAAe,OAAO,eAAe,GAAG;AAC5C,SAAO,iBAAiB,MAAM;AAC7B,UAAM,aAAa,OAAO,yBAAyB,cAAc,MAAM;AACvE,QAAI,WAAY,QAAO,CAAC,cAAc,UAAU;AAChD,mBAAe,OAAO,eAAe,YAAY;AAAA,EAClD;AACD;AACA,SAASC,QAAO,WAAW,SAAS;AACnC,MAAI,CAAC,UAAW,OAAM,IAAI,MAAM,OAAO;AACxC;AACA,IAAI,wBAAwB;AAC5B,SAAS,WAAW,EAAE,OAAO,QAAAH,SAAQ,MAAM,UAAU,gBAAgB,iBAAiB,2BAA2B,oBAAoB,mBAAmB,CAAC,EAAE,GAAG;AAC7J,QAAM,WAAWA,QAAO;AACxB,QAAM,iBAAiB;AACvB,QAAM,OAAO,YAAY,UAAU,QAAQ;AAC3C,QAAM,qBAAqB,WAAW;AAAA,EAAC;AACvC,QAAM,gBAAgB,kBAAkB,eAAe,IAAI,cAAc;AACzE,QAAM,cAAc;AAAA;AAAA,IAErB,CAAC,IAAI,IAAI,YAAY,MAAM;AACzB,mBAAa,YAAY,IAAI,CAAC;AAC9B,UAAI,cAAe,cAAa,aAAa;AAC7C,oBAAc,MAAM,OAAO,cAAc;AACzC,8BAAwB,yBAAyB,OAAO,cAAc;AACtE,YAAM,SAAS;AAAA,QACd,MAAM;AAAA,QACN,OAAO;AAAA,MACR;AACA,YAAM,gBAAgB;AAAA,QACrB,MAAM;AAAA,QACN,OAAO;AAAA,MACR;AACA,qBAAe,QAAQ,OAAO,cAAc;AAC5C,4BAAsB,eAAe,OAAO,cAAc;AAC1D,YAAM,UAAU,aAAa,SAAS;AACtC,YAAM,CAAC,eAAe,sBAAsB,IAAI,iBAAiB,SAAS,OAAO,cAAc;AAC/F,YAAM,CAAC,cAAc,qBAAqB,IAAI,gBAAgB,SAAS,OAAO,cAAc;AAC5F,YAAM,iBAAiBA,QAAO,wBAAwB,MAAM,KAAKA,QAAO,sBAAsB,iBAAiB,wBAAwB,MAAM,KAAK,iBAAiB,sBAAsB,YAAY;AACrM,UAAI;AACJ,UAAI;AACJ,UAAI,WAAW;AACf,UAAI;AACH,YAAI,YAAY;AAIf,cAAI,iBAAiB,WAAW;AAEhC,kCAAsB,MAAM,mBAAmB,qBAAqB,SAAS,cAAc;AAC3F,wBAAc,QAAQ,UAAU,gBAAgB,MAAM,UAAU;AAKhE,qBAAW,QAAQ,kBAAkB;AACpC,kBAAMI,iBAAgB,YAAY,IAAI;AAGtC,gBAAIA,mBAAkB,KAAK,UAAU,IAAI,EAAG;AAC5C,kBAAM,SAAS,eAAeA,cAAa;AAC3C,kBAAMC,kBAAiB,SAASD,eAAc,OAAO;AACrD,kBAAME,mBAAkB,SAAS,aAAa,IAAIF,cAAa,IAAI;AACnE,wBAAY,IAAI,IAAI,mBAAmB;AAAA,cACtC,wBAAwB,4BAA4BE,kBAAiB,eAAe;AAAA,cACpF,gBAAAD;AAAA,cACA,iBAAAC;AAAA,cACA;AAAA,YACD,CAAC;AAAA,UACF;AAAA,QACD,MAAO,eAAc,eAAe,MAAM,MAAM,IAAI;AAAA,MACrD,SAAS,OAAO;AACf,sBAAc;AACd,mBAAW;AACX,YAAI,iBAAiB,aAAa,MAAM,QAAQ,SAAS,sBAAsB,EAAG,SAAQ,KAAK,gBAAgB,YAAY,IAAI,EAAE,YAAY,CAAC,qHAAqH;AACnQ,cAAM;AAAA,MACP,UAAE;AACD,YAAI,UAAU;AACb,iBAAO,OAAO;AACd,iBAAO,QAAQ;AACf,wBAAc,OAAO;AACrB,wBAAc,QAAQ;AAAA,QACvB,OAAO;AACN,iBAAO,OAAO;AACd,iBAAO,QAAQ;AACf,cAAI,YAAY;AACf,kBAAM,SAAS,eAAe,CAAC,IAAI;AACnC,kBAAM,UAAU,gBAAgB,CAAC,IAAI;AACrC,gBAAI,yBAAyB,QAAQ,eAAgB,gBAAe,SAAS,wBAAwB,CAAC,IAAI;AAC1G,gBAAI,0BAA0B,QAAQ,eAAgB,gBAAe,UAAU,yBAAyB,CAAC,IAAI;AAAA,UAC9G;AACA,cAAI,uBAAuB,QAAS,aAAY,KAAK,CAAC,iBAAiB;AACtE,0BAAc,OAAO;AACrB,0BAAc,QAAQ;AAAA,UACvB,GAAG,CAAC,kBAAkB;AACrB,0BAAc,OAAO;AACrB,0BAAc,QAAQ;AAAA,UACvB,CAAC;AAAA,eACI;AACJ,0BAAc,OAAO;AACrB,0BAAc,QAAQ;AAAA,UACvB;AAAA,QACD;AAAA,MACD;AACA,aAAO;AAAA,IACR;AAAA,EAAG;AACH,QAAM,OAAO,YAAY,IAAI;AAC7B,QAAM,qBAAqB,YAAY;AACvC,MAAI,mBAAoB,8BAA6B,MAAM,kBAAkB;AAC7E,SAAO;AACR;AAIA,SAAS,sBAAsB,MAAM,gBAAgB;AACpD,QAAM,gBAAgB,KAAK;AAC3B,MAAI,iBAAiB,KAAM;AAI3B,QAAM,SAAS,gBAAgB,aAAa,OAAO;AACnD,MAAI,kBAAkB,UAAU,OAAO,eAAe,aAAa,MAAM,OAAQ,QAAO,eAAe,eAAe,MAAM;AAC7H;AACA,SAAS,cAAc,MAAM,OAAO,gBAAgB;AACnD,QAAM,MAAM,KAAK,IAAI;AACrB,kBAAgB,MAAM,KAAK,IAAI;AAChC;AACA,SAAS,wBAAwB,OAAO,OAAO,gBAAgB;AAC9D,QAAM,oBAAoB,KAAK,KAAK;AACpC,kBAAgB,oBAAoB,KAAK,KAAK;AAC/C;AACA,SAAS,eAAe,QAAQ,OAAO,gBAAgB;AACtD,QAAM,QAAQ,KAAK,MAAM;AACzB,kBAAgB,QAAQ,KAAK,MAAM;AACpC;AACA,SAAS,sBAAsB,QAAQ,OAAO,gBAAgB;AAC7D,QAAM,eAAe,KAAK,MAAM;AAChC,kBAAgB,eAAe,KAAK,MAAM;AAC3C;AACA,SAAS,iBAAiB,UAAU,OAAO,gBAAgB;AAC1D,SAAO,CAAC,MAAM,UAAU,KAAK,QAAQ,GAAG,gBAAgB,UAAU,KAAK,QAAQ,CAAC;AACjF;AACA,SAAS,gBAAgB,SAAS,OAAO,gBAAgB;AACxD,SAAO,CAAC,MAAM,SAAS,KAAK,OAAO,GAAG,gBAAgB,SAAS,KAAK,OAAO,CAAC;AAC7E;AACA,SAAS,6BAA6B,MAAM,UAAU;AACrD,QAAM,EAAE,YAAY,YAAY,IAAI,iBAAiB,QAAQ;AAC7D,aAAW,OAAO,YAAY;AAC7B,UAAM,aAAa,YAAY,GAAG;AAClC,QAAI,cAAc,MAAM,GAAG,EAAG;AAC9B,WAAO,eAAe,MAAM,KAAK,UAAU;AAAA,EAC5C;AACD;AACA,IAAM,mBAAmC,oBAAI,IAAI;AAAA,EAChD;AAAA,EACA;AAAA,EACA;AAAA,EACA,uBAAO,IAAI,8BAA8B;AAC1C,CAAC;AACD,SAAS,iBAAiB,UAAU;AACnC,QAAM,aAA6B,oBAAI,IAAI;AAC3C,QAAM,cAAc,CAAC;AACrB,SAAO,YAAY,aAAa,OAAO,aAAa,aAAa,SAAS,WAAW;AACpF,UAAM,gBAAgB,CAAC,GAAG,OAAO,oBAAoB,QAAQ,GAAG,GAAG,OAAO,sBAAsB,QAAQ,CAAC;AACzG,eAAW,QAAQ,eAAe;AACjC,UAAI,YAAY,IAAI,KAAK,iBAAiB,IAAI,IAAI,EAAG;AACrD,iBAAW,IAAI,IAAI;AACnB,kBAAY,IAAI,IAAI,OAAO,yBAAyB,UAAU,IAAI;AAAA,IACnE;AACA,eAAW,OAAO,eAAe,QAAQ;AAAA,EAC1C;AACA,SAAO;AAAA,IACN;AAAA,IACA;AAAA,EACD;AACD;AACA,SAAS,iBAAiB,UAAU;AACnC,SAAO;AAAA,IACN,oBAAoB;AAAA,IACpB,cAAc;AAAA,IACd,UAAU;AAAA,IACV,yBAAyB,CAAC;AAAA,EAC3B;AACD;AACA,SAAS,kBAAkB;AAC1B,QAAM,QAAQ;AAAA,IACb,OAAO,CAAC;AAAA,IACR,UAAU,CAAC;AAAA,IACX,WAAW,CAAC;AAAA,IACZ,qBAAqB,CAAC;AAAA,IACtB,gBAAgB,CAAC;AAAA,IACjB,SAAS,CAAC;AAAA,IACV,IAAI,WAAW;AACd,aAAO,MAAM,MAAM,GAAG,EAAE;AAAA,IACzB;AAAA,EACD;AACA,SAAO;AACR;AACA,SAAS,kBAAkB;AAC1B,aAAW,WAAW,aAAc,SAAQ;AAC5C,eAAa,MAAM;AACpB;AACA,SAAS,gBAAgB;AACxB,aAAW,QAAQ,kBAAmB,MAAK,UAAU;AACtD;AACA,SAAS,gBAAgB;AACxB,aAAW,OAAO,kBAAkB;AACnC,UAAM,OAAO,IAAI,MAAM;AACvB,QAAI,KAAM,MAAK,UAAU;AAAA,QACpB,kBAAiB,OAAO,GAAG;AAAA,EACjC;AACD;AACA,SAAS,sBAAsB,WAAW;AACzC,QAAM,IAAI,UAAU,gBAAgB,SAAS,+JAA+J;AAC7M;;;AChdA,IAAI,YAAY,OAAO;AACvB,IAAI,kBAAkB,CAAC,KAAK,KAAK,UAAU,OAAO,MAAM,UAAU,KAAK,KAAK,EAAE,YAAY,MAAM,cAAc,MAAM,UAAU,MAAM,MAAM,CAAC,IAAI,IAAI,GAAG,IAAI;AAC1J,IAAI,SAAS,CAAC,QAAQ,UAAU,UAAU,QAAQ,QAAQ,EAAE,OAAO,cAAc,KAAK,CAAC;AACvF,IAAI,WAAW,CAAC,QAAQ,QAAQ;AAC9B,WAAS,QAAQ;AACf,cAAU,QAAQ,MAAM,EAAE,KAAK,IAAI,IAAI,GAAG,YAAY,KAAK,CAAC;AAChE;AACA,IAAI,gBAAgB,CAAC,KAAK,KAAK,UAAU,gBAAgB,KAAK,OAAO,QAAQ,WAAW,MAAM,KAAK,KAAK,KAAK;AAG7G,IAAI,gBAAgB,CAAC;AACrB,SAAS,eAAe;AAAA,EACtB,oBAAoB,MAAM;AAAA,EAC1B,gBAAgB,MAAM;AAAA,EACtB,WAAW,MAAM;AAAA,EACjB,aAAa,MAAM;AAAA,EACnB,YAAY,MAAM;AAAA,EAClB,kBAAkB,MAAM;AAAA,EACxB,KAAK,MAAM;AAAA,EACX,QAAQ,MAAM;AAAA,EACd,aAAa,MAAM;AAAA,EACnB,MAAM,MAAM;AAAA,EACZ,WAAW,MAAM;AAAA,EACjB,YAAY,MAAM;AAAA,EAClB,SAAS,MAAM;AAAA,EACf,aAAa,MAAM;AAAA,EACnB,4BAA4B,MAAM;AAAA,EAClC,iCAAiC,MAAM;AAAA,EACvC,aAAa,MAAM;AAAA,EACnB,aAAa,MAAM;AAAA,EACnB,SAAS,MAAMC;AAAA,EACf,OAAO,MAAM;AAAA,EACb,WAAW,MAAM;AAAA,EACjB,gBAAgB,MAAM;AAAA,EACtB,UAAU,MAAM;AAAA,EAChB,YAAY,MAAM;AAAA,EAClB,0BAA0B,MAAM;AAAA,EAChC,iBAAiB,MAAM;AAAA,EACvB,mBAAmB,MAAM;AAAA,EACzB,SAAS,MAAM;AAAA,EACf,MAAM,MAAMC;AAAA,EACZ,eAAe,MAAM;AAAA,EACrB,MAAM,MAAM;AACd,CAAC;AAGD,IAAI,sBAAsB,CAAC;AAC3B,SAAS,qBAAqB;AAAA,EAC5B,uBAAuB,MAAM;AAAA,EAC7B,oBAAoB,MAAM;AAAA,EAC1B,mBAAmB,MAAM;AAAA,EACzB,oBAAoB,MAAMC;AAAA,EAC1B,YAAY,MAAM;AACpB,CAAC;AACD,SAAS,gBAAgB,KAAK;AAC5B,SAAO,eAAe,SAAS,OAAO,UAAU,SAAS,KAAK,GAAG,MAAM;AACzE;AACA,OAAO,iBAAiB,iBAAiB;AACzC,SAAS,SAAS,KAAK;AACrB,SAAO,OAAO,UAAU,SAAS,KAAK,GAAG,MAAM;AACjD;AACA,OAAO,UAAU,UAAU;AAC3B,SAAS,mBAAmB,QAAQ,WAAW;AAC7C,SAAO,gBAAgB,SAAS,KAAK,WAAW;AAClD;AACA,OAAO,oBAAoB,oBAAoB;AAC/C,SAAS,sBAAsB,QAAQ,WAAW;AAChD,MAAI,gBAAgB,SAAS,GAAG;AAC9B,WAAO,OAAO,gBAAgB,UAAU,eAAe,kBAAkB,UAAU;AAAA,EACrF,YAAY,OAAO,cAAc,YAAY,OAAO,cAAc,eAAe,UAAU,WAAW;AACpG,WAAO,OAAO,gBAAgB,aAAa,kBAAkB;AAAA,EAC/D;AACA,SAAO;AACT;AACA,OAAO,uBAAuB,uBAAuB;AACrD,SAAS,kBAAkB,QAAQ,YAAY;AAC7C,QAAM,mBAAmB,OAAO,WAAW,WAAW,SAAS,OAAO;AACtE,MAAI,SAAS,UAAU,GAAG;AACxB,WAAO,WAAW,KAAK,gBAAgB;AAAA,EACzC,WAAW,OAAO,eAAe,UAAU;AACzC,WAAO,iBAAiB,QAAQ,UAAU,MAAM;AAAA,EAClD;AACA,SAAO;AACT;AACA,OAAO,mBAAmB,mBAAmB;AAC7C,SAASA,oBAAmB,WAAW;AACrC,MAAI,kBAAkB;AACtB,MAAI,gBAAgB,SAAS,GAAG;AAC9B,sBAAkB,UAAU,YAAY;AAAA,EAC1C,WAAW,OAAO,cAAc,YAAY;AAC1C,sBAAkB,UAAU;AAC5B,QAAI,oBAAoB,IAAI;AAC1B,YAAM,qBAAqB,IAAI,UAAU,EAAE;AAC3C,wBAAkB,sBAAsB;AAAA,IAC1C;AAAA,EACF;AACA,SAAO;AACT;AACA,OAAOA,qBAAoB,oBAAoB;AAC/C,SAAS,WAAW,WAAW;AAC7B,MAAI,MAAM;AACV,MAAI,aAAa,UAAU,SAAS;AAClC,UAAM,UAAU;AAAA,EAClB,WAAW,OAAO,cAAc,UAAU;AACxC,UAAM;AAAA,EACR;AACA,SAAO;AACT;AACA,OAAO,YAAY,YAAY;AAG/B,SAAS,KAAK,KAAK,KAAK,OAAO;AAC7B,MAAI,QAAQ,IAAI,YAAY,IAAI,UAA0B,uBAAO,OAAO,IAAI;AAC5E,MAAI,UAAU,WAAW,GAAG;AAC1B,UAAM,GAAG,IAAI;AAAA,EACf,OAAO;AACL,WAAO,MAAM,GAAG;AAAA,EAClB;AACF;AACA,OAAO,MAAM,MAAM;AAGnB,SAASD,MAAK,KAAK,MAAM;AACvB,MAAI,SAAS,KAAK,KAAK,QAAQ,GAAG,OAAO,KAAK,CAAC;AAC/C,SAAO,SAAS,CAAC,OAAO;AAC1B;AACA,OAAOA,OAAM,MAAM;AAGnB,SAAS,KAAK,KAAK;AACjB,MAAI,OAAO,QAAQ,aAAa;AAC9B,WAAO;AAAA,EACT;AACA,MAAI,QAAQ,MAAM;AAChB,WAAO;AAAA,EACT;AACA,QAAM,YAAY,IAAI,OAAO,WAAW;AACxC,MAAI,OAAO,cAAc,UAAU;AACjC,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,OAAO,UAAU,SAAS,KAAK,GAAG,EAAE,MAAM,GAAG,EAAE;AAC7D,SAAO;AACT;AACA,OAAO,MAAM,MAAM;AAGnB,IAAI,iBAAiB,uBAAuB;AAC5C,IAAI,kBAAkB,MAAME,yBAAwB,MAAM;AAAA,EACxD,YAAY,UAAU,8BAA8B,OAAO,KAAK;AAC9D,UAAM,OAAO;AACb,kBAAc,MAAM,SAAS;AAC7B,SAAK,UAAU;AACf,QAAI,gBAAgB;AAClB,YAAM,kBAAkB,MAAM,OAAOA,gBAAe;AAAA,IACtD;AACA,eAAW,OAAO,OAAO;AACvB,UAAI,EAAE,OAAO,OAAO;AAClB,aAAK,GAAG,IAAI,MAAM,GAAG;AAAA,MACvB;AAAA,IACF;AAAA,EACF;AAAA,EACA,IAAI,OAAO;AACT,WAAO;AAAA,EACT;AAAA,EACA,IAAI,KAAK;AACP,WAAO;AAAA,EACT;AAAA,EACA,OAAO,OAAO;AACZ,WAAO;AAAA,MACL,GAAG;AAAA,MACH,MAAM,KAAK;AAAA,MACX,SAAS,KAAK;AAAA,MACd,IAAI;AAAA,MACJ,OAAO,UAAU,QAAQ,KAAK,QAAQ;AAAA,IACxC;AAAA,EACF;AACF;AACA,OAAO,iBAAiB,gBAAgB;AACxC,IAAI,iBAAiB;AAGrB,SAAS,YAAY,KAAK,OAAO;AAC/B,MAAI,UAAU,KAAK,KAAK,SAAS;AACjC,MAAI,OAAO,KAAK,KAAK,MAAM;AAC3B,YAAU,UAAU,UAAU,OAAO;AACrC,QAAM,KAAK,KAAK,QAAQ;AACxB,UAAQ,MAAM,IAAI,SAASC,IAAG;AAC5B,WAAOA,GAAE,YAAY;AAAA,EACvB,CAAC;AACD,QAAM,KAAK;AACX,MAAI,MAAM,MAAM,IAAI,SAASA,IAAG,OAAO;AACrC,QAAI,MAAM,CAAC,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,EAAE,QAAQA,GAAE,OAAO,CAAC,CAAC,IAAI,OAAO;AACnE,QAAI,KAAK,MAAM,SAAS,KAAK,UAAU,MAAM,SAAS,IAAI,QAAQ;AAClE,WAAO,KAAK,MAAM,MAAMA;AAAA,EAC1B,CAAC,EAAE,KAAK,IAAI;AACZ,MAAI,UAAU,KAAK,GAAG,EAAE,YAAY;AACpC,MAAI,CAAC,MAAM,KAAK,SAAS,UAAU;AACjC,WAAO,YAAY;AAAA,EACrB,CAAC,GAAG;AACF,UAAM,IAAI;AAAA,MACR,UAAU,2BAA2B,MAAM,WAAW,UAAU;AAAA,MAChE;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;AACA,OAAO,aAAa,aAAa;AAGjC,SAAS,UAAU,KAAK,MAAM;AAC5B,SAAO,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,IAAI;AACzC;AACA,OAAO,WAAW,WAAW;AAG7B,IAAI,aAAa;AAAA,EACf,MAAM,CAAC,KAAK,IAAI;AAAA,EAChB,KAAK,CAAC,KAAK,IAAI;AAAA,EACf,QAAQ,CAAC,KAAK,IAAI;AAAA,EAClB,WAAW,CAAC,KAAK,IAAI;AAAA;AAAA,EAErB,SAAS,CAAC,KAAK,IAAI;AAAA,EACnB,QAAQ,CAAC,KAAK,IAAI;AAAA,EAClB,QAAQ,CAAC,KAAK,IAAI;AAAA;AAAA;AAAA,EAGlB,OAAO,CAAC,MAAM,IAAI;AAAA,EAClB,KAAK,CAAC,MAAM,IAAI;AAAA,EAChB,OAAO,CAAC,MAAM,IAAI;AAAA,EAClB,QAAQ,CAAC,MAAM,IAAI;AAAA,EACnB,MAAM,CAAC,MAAM,IAAI;AAAA,EACjB,SAAS,CAAC,MAAM,IAAI;AAAA,EACpB,MAAM,CAAC,MAAM,IAAI;AAAA,EACjB,OAAO,CAAC,MAAM,IAAI;AAAA,EAClB,aAAa,CAAC,QAAQ,IAAI;AAAA,EAC1B,WAAW,CAAC,QAAQ,IAAI;AAAA,EACxB,aAAa,CAAC,QAAQ,IAAI;AAAA,EAC1B,cAAc,CAAC,QAAQ,IAAI;AAAA,EAC3B,YAAY,CAAC,QAAQ,IAAI;AAAA,EACzB,eAAe,CAAC,QAAQ,IAAI;AAAA,EAC5B,YAAY,CAAC,QAAQ,IAAI;AAAA,EACzB,aAAa,CAAC,QAAQ,IAAI;AAAA,EAC1B,MAAM,CAAC,MAAM,IAAI;AACnB;AACA,IAAI,SAAS;AAAA,EACX,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,WAAW;AAAA,EACX,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,QAAQ;AACV;AACA,IAAI,YAAY;AAChB,SAAS,SAAS,OAAO,WAAW;AAClC,QAAM,QAAQ,WAAW,OAAO,SAAS,CAAC,KAAK,WAAW,SAAS,KAAK;AACxE,MAAI,CAAC,OAAO;AACV,WAAO,OAAO,KAAK;AAAA,EACrB;AACA,SAAO,QAAQ,MAAM,CAAC,CAAC,IAAI,OAAO,KAAK,CAAC,QAAQ,MAAM,CAAC,CAAC;AAC1D;AACA,OAAO,UAAU,UAAU;AAC3B,SAAS,iBAAiB;AAAA,EACxB,aAAa;AAAA,EACb,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,gBAAgB;AAAA,EAChB,YAAY;AAAA,EACZ,iBAAiB;AAAA,EACjB,cAAc;AAAA,EACd,OAAO,CAAC;AAAA;AAAA,EAER,UAAU,YAAY;AAAA,EACtB,UAAU;AACZ,IAAI,CAAC,GAAG,UAAU;AAChB,QAAM,UAAU;AAAA,IACd,YAAY,QAAQ,UAAU;AAAA,IAC9B,OAAO,OAAO,KAAK;AAAA,IACnB,QAAQ,QAAQ,MAAM;AAAA,IACtB,eAAe,QAAQ,aAAa;AAAA,IACpC,WAAW,QAAQ,SAAS;AAAA,IAC5B,gBAAgB,OAAO,cAAc;AAAA,IACrC,aAAa,OAAO,WAAW;AAAA,IAC/B,UAAU,OAAO,SAAS;AAAA,IAC1B;AAAA,IACA,SAAS;AAAA,IACT;AAAA,EACF;AACA,MAAI,QAAQ,QAAQ;AAClB,YAAQ,UAAU;AAAA,EACpB;AACA,SAAO;AACT;AACA,OAAO,kBAAkB,kBAAkB;AAC3C,SAASC,iBAAgB,MAAM;AAC7B,SAAO,QAAQ,YAAY,QAAQ;AACrC;AACA,OAAOA,kBAAiB,iBAAiB;AACzC,SAAS,SAASC,SAAQ,QAAQ,OAAO,WAAW;AAClD,EAAAA,UAAS,OAAOA,OAAM;AACtB,QAAM,aAAa,KAAK;AACxB,QAAM,eAAeA,QAAO;AAC5B,MAAI,aAAa,UAAU,eAAe,YAAY;AACpD,WAAO;AAAA,EACT;AACA,MAAI,eAAe,UAAU,eAAe,YAAY;AACtD,QAAI,MAAM,SAAS;AACnB,QAAI,MAAM,KAAKD,iBAAgBC,QAAO,MAAM,CAAC,CAAC,GAAG;AAC/C,YAAM,MAAM;AAAA,IACd;AACA,WAAO,GAAGA,QAAO,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI;AAAA,EACvC;AACA,SAAOA;AACT;AACA,OAAO,UAAU,UAAU;AAC3B,SAAS,YAAY,MAAM,SAAS,aAAa,YAAY,MAAM;AACjE,gBAAc,eAAe,QAAQ;AACrC,QAAM,OAAO,KAAK;AAClB,MAAI,SAAS;AACX,WAAO;AACT,QAAM,iBAAiB,QAAQ;AAC/B,MAAI,SAAS;AACb,MAAI,OAAO;AACX,MAAI,YAAY;AAChB,WAASC,KAAI,GAAGA,KAAI,MAAMA,MAAK,GAAG;AAChC,UAAM,OAAOA,KAAI,MAAM,KAAK;AAC5B,UAAM,eAAeA,KAAI,MAAM,KAAK;AACpC,gBAAY,GAAG,SAAS,IAAI,KAAK,SAASA,EAAC;AAC3C,UAAM,QAAQ,KAAKA,EAAC;AACpB,YAAQ,WAAW,iBAAiB,OAAO,UAAU,OAAO,IAAI,UAAU;AAC1E,UAAMD,UAAS,QAAQ,YAAY,OAAO,OAAO,KAAK,OAAO,KAAK;AAClE,UAAM,aAAa,OAAO,SAASA,QAAO;AAC1C,UAAM,kBAAkB,aAAa,UAAU;AAC/C,QAAI,QAAQ,aAAa,kBAAkB,OAAO,SAAS,UAAU,UAAU,gBAAgB;AAC7F;AAAA,IACF;AACA,QAAI,CAAC,QAAQ,CAAC,gBAAgB,kBAAkB,gBAAgB;AAC9D;AAAA,IACF;AACA,WAAO,OAAO,KAAK,YAAY,KAAKC,KAAI,CAAC,GAAG,OAAO,KAAK,eAAe,KAAK;AAC5E,QAAI,CAAC,QAAQ,gBAAgB,kBAAkB,kBAAkB,aAAa,KAAK,SAAS,gBAAgB;AAC1G;AAAA,IACF;AACA,cAAUD;AACV,QAAI,CAAC,QAAQ,CAAC,gBAAgB,aAAa,KAAK,UAAU,gBAAgB;AACxE,kBAAY,GAAG,SAAS,IAAI,KAAK,SAASC,KAAI,CAAC;AAC/C;AAAA,IACF;AACA,gBAAY;AAAA,EACd;AACA,SAAO,GAAG,MAAM,GAAG,SAAS;AAC9B;AACA,OAAO,aAAa,aAAa;AACjC,SAAS,gBAAgB,KAAK;AAC5B,MAAI,IAAI,MAAM,0BAA0B,GAAG;AACzC,WAAO;AAAA,EACT;AACA,SAAO,KAAK,UAAU,GAAG,EAAE,QAAQ,MAAM,KAAK,EAAE,QAAQ,QAAQ,GAAG,EAAE,QAAQ,YAAY,GAAG;AAC9F;AACA,OAAO,iBAAiB,iBAAiB;AACzC,SAAS,gBAAgB,CAAC,KAAK,KAAK,GAAG,SAAS;AAC9C,UAAQ,YAAY;AACpB,MAAI,OAAO,QAAQ,UAAU;AAC3B,UAAM,gBAAgB,GAAG;AAAA,EAC3B,WAAW,OAAO,QAAQ,UAAU;AAClC,UAAM,IAAI,QAAQ,QAAQ,KAAK,OAAO,CAAC;AAAA,EACzC;AACA,UAAQ,YAAY,IAAI;AACxB,UAAQ,QAAQ,QAAQ,OAAO,OAAO;AACtC,SAAO,GAAG,GAAG,KAAK,KAAK;AACzB;AACA,OAAO,iBAAiB,iBAAiB;AAGzC,SAAS,aAAaC,QAAO,SAAS;AACpC,QAAM,qBAAqB,OAAO,KAAKA,MAAK,EAAE,MAAMA,OAAM,MAAM;AAChE,MAAI,CAACA,OAAM,UAAU,CAAC,mBAAmB;AACvC,WAAO;AACT,UAAQ,YAAY;AACpB,QAAM,eAAe,YAAYA,QAAO,OAAO;AAC/C,UAAQ,YAAY,aAAa;AACjC,MAAI,mBAAmB;AACvB,MAAI,mBAAmB,QAAQ;AAC7B,uBAAmB,YAAY,mBAAmB,IAAI,CAAC,QAAQ,CAAC,KAAKA,OAAM,GAAG,CAAC,CAAC,GAAG,SAAS,eAAe;AAAA,EAC7G;AACA,SAAO,KAAK,YAAY,GAAG,mBAAmB,KAAK,gBAAgB,KAAK,EAAE;AAC5E;AACA,OAAO,cAAc,cAAc;AAGnC,IAAI,eAA+B,uBAAO,CAACA,WAAU;AACnD,MAAI,OAAO,WAAW,cAAcA,kBAAiB,QAAQ;AAC3D,WAAO;AAAA,EACT;AACA,MAAIA,OAAM,OAAO,WAAW,GAAG;AAC7B,WAAOA,OAAM,OAAO,WAAW;AAAA,EACjC;AACA,SAAOA,OAAM,YAAY;AAC3B,GAAG,cAAc;AACjB,SAAS,kBAAkBA,QAAO,SAAS;AACzC,QAAM,OAAO,aAAaA,MAAK;AAC/B,UAAQ,YAAY,KAAK,SAAS;AAClC,QAAM,qBAAqB,OAAO,KAAKA,MAAK,EAAE,MAAMA,OAAM,MAAM;AAChE,MAAI,CAACA,OAAM,UAAU,CAAC,mBAAmB;AACvC,WAAO,GAAG,IAAI;AAChB,MAAI,SAAS;AACb,WAASD,KAAI,GAAGA,KAAIC,OAAM,QAAQD,MAAK;AACrC,UAAMD,UAAS,GAAG,QAAQ,QAAQ,SAASE,OAAMD,EAAC,GAAG,QAAQ,QAAQ,GAAG,QAAQ,CAAC,GAAGA,OAAMC,OAAM,SAAS,IAAI,KAAK,IAAI;AACtH,YAAQ,YAAYF,QAAO;AAC3B,QAAIE,OAAMD,EAAC,MAAMC,OAAM,UAAU,QAAQ,YAAY,GAAG;AACtD,gBAAU,GAAG,SAAS,IAAIA,OAAM,SAASA,OAAMD,EAAC,IAAI,CAAC;AACrD;AAAA,IACF;AACA,cAAUD;AAAA,EACZ;AACA,MAAI,mBAAmB;AACvB,MAAI,mBAAmB,QAAQ;AAC7B,uBAAmB,YAAY,mBAAmB,IAAI,CAAC,QAAQ,CAAC,KAAKE,OAAM,GAAG,CAAC,CAAC,GAAG,SAAS,eAAe;AAAA,EAC7G;AACA,SAAO,GAAG,IAAI,KAAK,MAAM,GAAG,mBAAmB,KAAK,gBAAgB,KAAK,EAAE;AAC7E;AACA,OAAO,mBAAmB,mBAAmB;AAG7C,SAAS,YAAY,YAAY,SAAS;AACxC,QAAM,uBAAuB,WAAW,OAAO;AAC/C,MAAI,yBAAyB,MAAM;AACjC,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,qBAAqB,MAAM,GAAG;AAC5C,QAAM,OAAO,MAAM,CAAC;AACpB,SAAO,QAAQ,QAAQ,GAAG,IAAI,IAAI,SAAS,MAAM,CAAC,GAAG,QAAQ,WAAW,KAAK,SAAS,CAAC,CAAC,IAAI,MAAM;AACpG;AACA,OAAO,aAAa,aAAa;AAGjC,SAAS,gBAAgB,MAAM,SAAS;AACtC,QAAM,eAAe,KAAK,OAAO,WAAW,KAAK;AACjD,QAAM,OAAO,KAAK;AAClB,MAAI,CAAC,MAAM;AACT,WAAO,QAAQ,QAAQ,IAAI,YAAY,KAAK,SAAS;AAAA,EACvD;AACA,SAAO,QAAQ,QAAQ,IAAI,YAAY,IAAI,SAAS,MAAM,QAAQ,WAAW,EAAE,CAAC,KAAK,SAAS;AAChG;AACA,OAAO,iBAAiB,iBAAiB;AAGzC,SAAS,gBAAgB,CAAC,KAAK,KAAK,GAAG,SAAS;AAC9C,UAAQ,YAAY;AACpB,QAAM,QAAQ,QAAQ,KAAK,OAAO;AAClC,UAAQ,YAAY,IAAI;AACxB,UAAQ,QAAQ,QAAQ,OAAO,OAAO;AACtC,SAAO,GAAG,GAAG,OAAO,KAAK;AAC3B;AACA,OAAO,iBAAiB,iBAAiB;AACzC,SAAS,aAAaC,MAAK;AACzB,QAAM,UAAU,CAAC;AACjB,EAAAA,KAAI,QAAQ,CAAC,OAAO,QAAQ;AAC1B,YAAQ,KAAK,CAAC,KAAK,KAAK,CAAC;AAAA,EAC3B,CAAC;AACD,SAAO;AACT;AACA,OAAO,cAAc,cAAc;AACnC,SAAS,WAAWA,MAAK,SAAS;AAChC,MAAIA,KAAI,SAAS;AACf,WAAO;AACT,UAAQ,YAAY;AACpB,SAAO,QAAQ,YAAY,aAAaA,IAAG,GAAG,SAAS,eAAe,CAAC;AACzE;AACA,OAAO,YAAY,YAAY;AAG/B,IAAI,QAAQ,OAAO,UAAU,CAACF,OAAMA,OAAMA;AAC1C,SAAS,cAAc,QAAQ,SAAS;AACtC,MAAI,MAAM,MAAM,GAAG;AACjB,WAAO,QAAQ,QAAQ,OAAO,QAAQ;AAAA,EACxC;AACA,MAAI,WAAW,UAAU;AACvB,WAAO,QAAQ,QAAQ,YAAY,QAAQ;AAAA,EAC7C;AACA,MAAI,WAAW,WAAW;AACxB,WAAO,QAAQ,QAAQ,aAAa,QAAQ;AAAA,EAC9C;AACA,MAAI,WAAW,GAAG;AAChB,WAAO,QAAQ,QAAQ,IAAI,WAAW,WAAW,OAAO,MAAM,QAAQ;AAAA,EACxE;AACA,SAAO,QAAQ,QAAQ,SAAS,OAAO,MAAM,GAAG,QAAQ,QAAQ,GAAG,QAAQ;AAC7E;AACA,OAAO,eAAe,eAAe;AAGrC,SAAS,cAAc,QAAQ,SAAS;AACtC,MAAI,OAAO,SAAS,OAAO,SAAS,GAAG,QAAQ,WAAW,CAAC;AAC3D,MAAI,SAAS;AACX,YAAQ;AACV,SAAO,QAAQ,QAAQ,MAAM,QAAQ;AACvC;AACA,OAAO,eAAe,eAAe;AAGrC,SAAS,cAAc,OAAO,SAAS;AACrC,QAAM,QAAQ,MAAM,SAAS,EAAE,MAAM,GAAG,EAAE,CAAC;AAC3C,QAAM,eAAe,QAAQ,YAAY,IAAI,MAAM;AACnD,QAAM,SAAS,MAAM;AACrB,SAAO,QAAQ,QAAQ,IAAI,SAAS,QAAQ,YAAY,CAAC,IAAI,KAAK,IAAI,QAAQ;AAChF;AACA,OAAO,eAAe,eAAe;AAGrC,SAAS,aAAaG,OAAM;AAC1B,QAAM,SAAS,CAAC;AAChB,EAAAA,MAAK,QAAQ,CAAC,UAAU;AACtB,WAAO,KAAK,KAAK;AAAA,EACnB,CAAC;AACD,SAAO;AACT;AACA,OAAO,cAAc,cAAc;AACnC,SAAS,WAAWA,OAAM,SAAS;AACjC,MAAIA,MAAK,SAAS;AAChB,WAAO;AACT,UAAQ,YAAY;AACpB,SAAO,QAAQ,YAAY,aAAaA,KAAI,GAAG,OAAO,CAAC;AACzD;AACA,OAAO,YAAY,YAAY;AAG/B,IAAI,oBAAoB,IAAI,OAAO,mJAAmJ,GAAG;AACzL,IAAI,mBAAmB;AAAA,EACrB,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AACR;AACA,IAAI,MAAM;AACV,IAAI,gBAAgB;AACpB,SAAS,OAAO,MAAM;AACpB,SAAO,iBAAiB,IAAI,KAAK,MAAM,OAAO,KAAK,WAAW,CAAC,EAAE,SAAS,GAAG,CAAC,GAAG,MAAM,CAAC,aAAa,CAAC;AACxG;AACA,OAAO,QAAQ,QAAQ;AACvB,SAAS,cAAcJ,SAAQ,SAAS;AACtC,MAAI,kBAAkB,KAAKA,OAAM,GAAG;AAClC,IAAAA,UAASA,QAAO,QAAQ,mBAAmB,MAAM;AAAA,EACnD;AACA,SAAO,QAAQ,QAAQ,IAAI,SAASA,SAAQ,QAAQ,WAAW,CAAC,CAAC,KAAK,QAAQ;AAChF;AACA,OAAO,eAAe,eAAe;AAGrC,SAAS,cAAc,OAAO;AAC5B,MAAI,iBAAiB,OAAO,WAAW;AACrC,WAAO,MAAM,cAAc,UAAU,MAAM,WAAW,MAAM;AAAA,EAC9D;AACA,SAAO,MAAM,SAAS;AACxB;AACA,OAAO,eAAe,eAAe;AAGrC,IAAI,kBAAkC,uBAAO,MAAM,mBAAmB,iBAAiB;AACvF,IAAI,kBAAkB;AAGtB,SAAS,cAAcK,SAAQ,SAAS;AACtC,QAAM,aAAa,OAAO,oBAAoBA,OAAM;AACpD,QAAM,UAAU,OAAO,wBAAwB,OAAO,sBAAsBA,OAAM,IAAI,CAAC;AACvF,MAAI,WAAW,WAAW,KAAK,QAAQ,WAAW,GAAG;AACnD,WAAO;AAAA,EACT;AACA,UAAQ,YAAY;AACpB,UAAQ,OAAO,QAAQ,QAAQ,CAAC;AAChC,MAAI,QAAQ,KAAK,SAASA,OAAM,GAAG;AACjC,WAAO;AAAA,EACT;AACA,UAAQ,KAAK,KAAKA,OAAM;AACxB,QAAM,mBAAmB,YAAY,WAAW,IAAI,CAAC,QAAQ,CAAC,KAAKA,QAAO,GAAG,CAAC,CAAC,GAAG,SAAS,eAAe;AAC1G,QAAM,iBAAiB,YAAY,QAAQ,IAAI,CAAC,QAAQ,CAAC,KAAKA,QAAO,GAAG,CAAC,CAAC,GAAG,SAAS,eAAe;AACrG,UAAQ,KAAK,IAAI;AACjB,MAAI,MAAM;AACV,MAAI,oBAAoB,gBAAgB;AACtC,UAAM;AAAA,EACR;AACA,SAAO,KAAK,gBAAgB,GAAG,GAAG,GAAG,cAAc;AACrD;AACA,OAAO,eAAe,eAAe;AAGrC,IAAI,cAAc,OAAO,WAAW,eAAe,OAAO,cAAc,OAAO,cAAc;AAC7F,SAAS,aAAa,OAAO,SAAS;AACpC,MAAI,OAAO;AACX,MAAI,eAAe,eAAe,OAAO;AACvC,WAAO,MAAM,WAAW;AAAA,EAC1B;AACA,SAAO,QAAQ,MAAM,YAAY;AACjC,MAAI,CAAC,QAAQ,SAAS,UAAU;AAC9B,WAAO;AAAA,EACT;AACA,UAAQ,YAAY,KAAK;AACzB,SAAO,GAAG,IAAI,GAAG,cAAc,OAAO,OAAO,CAAC;AAChD;AACA,OAAO,cAAc,cAAc;AAGnC,SAAS,iBAAiB,MAAM,SAAS;AACvC,MAAI,KAAK,WAAW;AAClB,WAAO;AACT,UAAQ,YAAY;AACpB,SAAO,cAAc,YAAY,MAAM,OAAO,CAAC;AACjD;AACA,OAAO,kBAAkB,kBAAkB;AAG3C,IAAI,YAAY;AAAA,EACd;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,SAAS,eAAe,OAAO,SAAS;AACtC,QAAM,aAAa,OAAO,oBAAoB,KAAK,EAAE,OAAO,CAAC,QAAQ,UAAU,QAAQ,GAAG,MAAM,EAAE;AAClG,QAAM,OAAO,MAAM;AACnB,UAAQ,YAAY,KAAK;AACzB,MAAI,UAAU;AACd,MAAI,OAAO,MAAM,YAAY,UAAU;AACrC,cAAU,SAAS,MAAM,SAAS,QAAQ,QAAQ;AAAA,EACpD,OAAO;AACL,eAAW,QAAQ,SAAS;AAAA,EAC9B;AACA,YAAU,UAAU,KAAK,OAAO,KAAK;AACrC,UAAQ,YAAY,QAAQ,SAAS;AACrC,UAAQ,OAAO,QAAQ,QAAQ,CAAC;AAChC,MAAI,QAAQ,KAAK,SAAS,KAAK,GAAG;AAChC,WAAO;AAAA,EACT;AACA,UAAQ,KAAK,KAAK,KAAK;AACvB,QAAM,mBAAmB,YAAY,WAAW,IAAI,CAAC,QAAQ,CAAC,KAAK,MAAM,GAAG,CAAC,CAAC,GAAG,SAAS,eAAe;AACzG,SAAO,GAAG,IAAI,GAAG,OAAO,GAAG,mBAAmB,MAAM,gBAAgB,OAAO,EAAE;AAC/E;AACA,OAAO,gBAAgB,eAAe;AAGtC,SAAS,iBAAiB,CAAC,KAAK,KAAK,GAAG,SAAS;AAC/C,UAAQ,YAAY;AACpB,MAAI,CAAC,OAAO;AACV,WAAO,GAAG,QAAQ,QAAQ,OAAO,GAAG,GAAG,QAAQ,CAAC;AAAA,EAClD;AACA,SAAO,GAAG,QAAQ,QAAQ,OAAO,GAAG,GAAG,QAAQ,CAAC,IAAI,QAAQ,QAAQ,IAAI,KAAK,KAAK,QAAQ,CAAC;AAC7F;AACA,OAAO,kBAAkB,kBAAkB;AAC3C,SAAS,sBAAsB,YAAY,SAAS;AAClD,SAAO,YAAY,YAAY,SAAS,aAAa,IAAI;AAC3D;AACA,OAAO,uBAAuB,uBAAuB;AACrD,SAAS,YAAY,MAAM,SAAS;AAClC,UAAQ,KAAK,UAAU;AAAA,IACrB,KAAK;AACH,aAAO,YAAY,MAAM,OAAO;AAAA,IAClC,KAAK;AACH,aAAO,QAAQ,QAAQ,KAAK,MAAM,OAAO;AAAA,IAC3C;AACE,aAAO,QAAQ,QAAQ,MAAM,OAAO;AAAA,EACxC;AACF;AACA,OAAO,aAAa,aAAa;AACjC,SAAS,YAAY,SAAS,SAAS;AACrC,QAAM,aAAa,QAAQ,kBAAkB;AAC7C,QAAM,OAAO,QAAQ,QAAQ,YAAY;AACzC,QAAM,OAAO,QAAQ,QAAQ,IAAI,IAAI,IAAI,SAAS;AAClD,QAAM,YAAY,QAAQ,QAAQ,KAAK,SAAS;AAChD,QAAM,OAAO,QAAQ,QAAQ,KAAK,IAAI,KAAK,SAAS;AACpD,UAAQ,YAAY,KAAK,SAAS,IAAI;AACtC,MAAI,mBAAmB;AACvB,MAAI,WAAW,SAAS,GAAG;AACzB,wBAAoB;AACpB,wBAAoB,YAAY,WAAW,IAAI,CAAC,QAAQ,CAAC,KAAK,QAAQ,aAAa,GAAG,CAAC,CAAC,GAAG,SAAS,kBAAkB,GAAG;AAAA,EAC3H;AACA,UAAQ,YAAY,iBAAiB;AACrC,QAAM,YAAY,QAAQ;AAC1B,MAAI,WAAW,sBAAsB,QAAQ,UAAU,OAAO;AAC9D,MAAI,YAAY,SAAS,SAAS,WAAW;AAC3C,eAAW,GAAG,SAAS,IAAI,QAAQ,SAAS,MAAM;AAAA,EACpD;AACA,SAAO,GAAG,IAAI,GAAG,gBAAgB,GAAG,SAAS,GAAG,QAAQ,GAAG,IAAI;AACjE;AACA,OAAO,aAAa,aAAa;AAGjC,IAAI,mBAAmB,OAAO,WAAW,cAAc,OAAO,OAAO,QAAQ;AAC7E,IAAI,cAAc,mBAAmC,uBAAO,IAAI,cAAc,IAAI;AAClF,IAAI,cAA8B,uBAAO,IAAI,4BAA4B;AACzE,IAAI,iBAAiC,oBAAI,QAAQ;AACjD,IAAI,eAAe,CAAC;AACpB,IAAI,eAAe;AAAA,EACjB,WAA2B,uBAAO,CAAC,OAAO,YAAY,QAAQ,QAAQ,aAAa,WAAW,GAAG,WAAW;AAAA,EAC5G,MAAsB,uBAAO,CAAC,OAAO,YAAY,QAAQ,QAAQ,QAAQ,MAAM,GAAG,MAAM;AAAA,EACxF,SAAyB,uBAAO,CAAC,OAAO,YAAY,QAAQ,QAAQ,OAAO,KAAK,GAAG,SAAS,GAAG,SAAS;AAAA,EACxG,SAAyB,uBAAO,CAAC,OAAO,YAAY,QAAQ,QAAQ,OAAO,KAAK,GAAG,SAAS,GAAG,SAAS;AAAA,EACxG,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,UAAU;AAAA,EACV,QAAQ;AAAA;AAAA,EAER,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,MAAM;AAAA,EACN,KAAK;AAAA,EACL,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,SAAS;AAAA;AAAA,EAET,SAAyB,uBAAO,CAAC,OAAO,YAAY,QAAQ,QAAQ,mBAAmB,SAAS,GAAG,SAAS;AAAA,EAC5G,SAAyB,uBAAO,CAAC,OAAO,YAAY,QAAQ,QAAQ,mBAAmB,SAAS,GAAG,SAAS;AAAA,EAC5G,WAAW;AAAA,EACX,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,mBAAmB;AAAA,EACnB,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,cAAc;AAAA,EACd,cAAc;AAAA,EACd,WAA2B,uBAAO,MAAM,IAAI,WAAW;AAAA,EACvD,UAA0B,uBAAO,MAAM,IAAI,UAAU;AAAA,EACrD,aAA6B,uBAAO,MAAM,IAAI,aAAa;AAAA,EAC3D,OAAO;AAAA,EACP,gBAAgB;AAAA,EAChB,UAAU;AACZ;AACA,IAAI,gBAAgC,uBAAO,CAAC,OAAO,SAAS,OAAO,cAAc;AAC/E,MAAI,eAAe,SAAS,OAAO,MAAM,WAAW,MAAM,YAAY;AACpE,WAAO,MAAM,WAAW,EAAE,OAAO;AAAA,EACnC;AACA,MAAI,eAAe,SAAS,OAAO,MAAM,WAAW,MAAM,YAAY;AACpE,WAAO,MAAM,WAAW,EAAE,QAAQ,OAAO,SAAS,SAAS;AAAA,EAC7D;AACA,MAAI,aAAa,SAAS,OAAO,MAAM,YAAY,YAAY;AAC7D,WAAO,MAAM,QAAQ,QAAQ,OAAO,OAAO;AAAA,EAC7C;AACA,MAAI,iBAAiB,SAAS,eAAe,IAAI,MAAM,WAAW,GAAG;AACnE,WAAO,eAAe,IAAI,MAAM,WAAW,EAAE,OAAO,OAAO;AAAA,EAC7D;AACA,MAAI,aAAa,KAAK,GAAG;AACvB,WAAO,aAAa,KAAK,EAAE,OAAO,OAAO;AAAA,EAC3C;AACA,SAAO;AACT,GAAG,eAAe;AAClB,IAAIC,YAAW,OAAO,UAAU;AAChC,SAASC,SAAQ,OAAO,OAAO,CAAC,GAAG;AACjC,QAAM,UAAU,iBAAiB,MAAMA,QAAO;AAC9C,QAAM,EAAE,cAAc,IAAI;AAC1B,MAAI,QAAQ,UAAU,OAAO,SAAS,OAAO;AAC7C,MAAI,UAAU,UAAU;AACtB,YAAQD,UAAS,KAAK,KAAK,EAAE,MAAM,GAAG,EAAE;AAAA,EAC1C;AACA,MAAI,SAAS,cAAc;AACzB,WAAO,aAAa,KAAK,EAAE,OAAO,OAAO;AAAA,EAC3C;AACA,MAAI,iBAAiB,OAAO;AAC1B,UAAM,SAAS,cAAc,OAAO,SAAS,OAAOC,QAAO;AAC3D,QAAI,QAAQ;AACV,UAAI,OAAO,WAAW;AACpB,eAAO;AACT,aAAOA,SAAQ,QAAQ,OAAO;AAAA,IAChC;AAAA,EACF;AACA,QAAM,QAAQ,QAAQ,OAAO,eAAe,KAAK,IAAI;AACrD,MAAI,UAAU,OAAO,aAAa,UAAU,MAAM;AAChD,WAAO,cAAc,OAAO,OAAO;AAAA,EACrC;AACA,MAAI,SAAS,OAAO,gBAAgB,cAAc,iBAAiB,aAAa;AAC9E,WAAO,YAAY,OAAO,OAAO;AAAA,EACnC;AACA,MAAI,iBAAiB,OAAO;AAC1B,QAAI,MAAM,gBAAgB,QAAQ;AAChC,aAAO,aAAa,OAAO,OAAO;AAAA,IACpC;AACA,WAAO,cAAc,OAAO,OAAO;AAAA,EACrC;AACA,MAAI,UAAU,OAAO,KAAK,GAAG;AAC3B,WAAO,cAAc,OAAO,OAAO;AAAA,EACrC;AACA,SAAO,QAAQ,QAAQ,OAAO,KAAK,GAAG,KAAK;AAC7C;AACA,OAAOA,UAAS,SAAS;AAGzB,IAAI,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaX,cAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAad,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoBV,mBAAmB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBnB,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBV,mBAAmB,CAAC,QAAQ,SAAS,WAAW,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuBxD,WAAW;AACb;AAGA,SAASb,UAAS,KAAK,YAAY,OAAO,QAAQ;AAChD,MAAI,UAAU;AAAA,IACZ;AAAA,IACA,OAAO,OAAO,UAAU,cAAc,IAAI;AAAA,IAC1C;AAAA,IACA,UAAU,OAAO,oBAAoB,OAAO,oBAAoB;AAAA,EAClE;AACA,SAAOa,SAAQ,KAAK,OAAO;AAC7B;AACA,OAAOb,WAAU,SAAS;AAG1B,SAAS,WAAW,KAAK;AACvB,MAAI,MAAMA,UAAS,GAAG,GAAG,QAAQ,OAAO,UAAU,SAAS,KAAK,GAAG;AACnE,MAAI,OAAO,qBAAqB,IAAI,UAAU,OAAO,mBAAmB;AACtE,QAAI,UAAU,qBAAqB;AACjC,aAAO,CAAC,IAAI,QAAQ,IAAI,SAAS,KAAK,eAAe,gBAAgB,IAAI,OAAO;AAAA,IAClF,WAAW,UAAU,kBAAkB;AACrC,aAAO,aAAa,IAAI,SAAS;AAAA,IACnC,WAAW,UAAU,mBAAmB;AACtC,UAAIc,QAAO,OAAO,KAAK,GAAG,GAAG,OAAOA,MAAK,SAAS,IAAIA,MAAK,OAAO,GAAG,CAAC,EAAE,KAAK,IAAI,IAAI,UAAUA,MAAK,KAAK,IAAI;AAC7G,aAAO,eAAe,OAAO;AAAA,IAC/B,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF,OAAO;AACL,WAAO;AAAA,EACT;AACF;AACA,OAAO,YAAY,YAAY;AAG/B,SAAS,YAAY,KAAK,MAAM;AAC9B,MAAI,SAAS,KAAK,KAAK,QAAQ;AAC/B,MAAI,MAAM,KAAK,KAAK,QAAQ;AAC5B,MAAI,WAAW,KAAK,CAAC;AACrB,MAAI,SAAS,UAAU,KAAK,IAAI;AAChC,MAAI,MAAM,SAAS,KAAK,CAAC,IAAI,KAAK,CAAC;AACnC,MAAI,UAAU,KAAK,KAAK,SAAS;AACjC,MAAI,OAAO,QAAQ,WAAY,OAAM,IAAI;AACzC,QAAM,OAAO;AACb,QAAM,IAAI,QAAQ,cAAc,WAAW;AACzC,WAAO,WAAW,GAAG;AAAA,EACvB,CAAC,EAAE,QAAQ,aAAa,WAAW;AACjC,WAAO,WAAW,MAAM;AAAA,EAC1B,CAAC,EAAE,QAAQ,aAAa,WAAW;AACjC,WAAO,WAAW,QAAQ;AAAA,EAC5B,CAAC;AACD,SAAO,UAAU,UAAU,OAAO,MAAM;AAC1C;AACA,OAAO,aAAa,YAAY;AAGhC,SAAS,cAAc,WAAWH,SAAQ,YAAY;AACpD,MAAI,QAAQ,UAAU,YAAY,UAAU,UAA0B,uBAAO,OAAO,IAAI;AACxF,MAAI,CAACA,QAAO,SAAS;AACnB,IAAAA,QAAO,UAA0B,uBAAO,OAAO,IAAI;AAAA,EACrD;AACA,eAAa,UAAU,WAAW,IAAI,aAAa;AACnD,WAAS,SAAS,OAAO;AACvB,QAAI,cAAc,UAAU,YAAY,UAAU,UAAU,UAAU,cAAc,SAAS,WAAW;AACtG,MAAAA,QAAO,QAAQ,KAAK,IAAI,MAAM,KAAK;AAAA,IACrC;AAAA,EACF;AACF;AACA,OAAO,eAAe,eAAe;AAGrC,SAAS,MAAM,KAAK;AAClB,MAAI,OAAO,QAAQ,aAAa;AAC9B,WAAO;AAAA,EACT;AACA,MAAI,QAAQ,MAAM;AAChB,WAAO;AAAA,EACT;AACA,QAAM,YAAY,IAAI,OAAO,WAAW;AACxC,MAAI,OAAO,cAAc,UAAU;AACjC,WAAO;AAAA,EACT;AACA,QAAM,aAAa;AACnB,QAAM,WAAW;AACjB,SAAO,OAAO,UAAU,SAAS,KAAK,GAAG,EAAE,MAAM,YAAY,QAAQ;AACvE;AACA,OAAO,OAAO,MAAM;AACpB,SAAS,UAAU;AACjB,OAAK,OAAO,oBAAoB,KAAK,OAAO,IAAI,KAAK,IAAI;AAC3D;AACA,OAAO,SAAS,SAAS;AACzB,QAAQ,YAAY;AAAA,EAClB,KAAqB,uBAAO,SAAS,IAAI,KAAK;AAC5C,WAAO,IAAI,KAAK,IAAI;AAAA,EACtB,GAAG,KAAK;AAAA,EACR,KAAqB,uBAAO,SAAS,IAAI,KAAK,OAAO;AACnD,QAAI,OAAO,aAAa,GAAG,GAAG;AAC5B,aAAO,eAAe,KAAK,KAAK,MAAM;AAAA,QACpC;AAAA,QACA,cAAc;AAAA,MAChB,CAAC;AAAA,IACH;AAAA,EACF,GAAG,KAAK;AACV;AACA,IAAI,aAAa,OAAO,YAAY,aAAa,UAAU;AAC3D,SAAS,eAAe,iBAAiB,kBAAkB,YAAY;AACrE,MAAI,CAAC,cAAcI,aAAY,eAAe,KAAKA,aAAY,gBAAgB,GAAG;AAChF,WAAO;AAAA,EACT;AACA,MAAI,cAAc,WAAW,IAAI,eAAe;AAChD,MAAI,aAAa;AACf,QAAI,SAAS,YAAY,IAAI,gBAAgB;AAC7C,QAAI,OAAO,WAAW,WAAW;AAC/B,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AACA,OAAO,gBAAgB,gBAAgB;AACvC,SAAS,WAAW,iBAAiB,kBAAkB,YAAY,QAAQ;AACzE,MAAI,CAAC,cAAcA,aAAY,eAAe,KAAKA,aAAY,gBAAgB,GAAG;AAChF;AAAA,EACF;AACA,MAAI,cAAc,WAAW,IAAI,eAAe;AAChD,MAAI,aAAa;AACf,gBAAY,IAAI,kBAAkB,MAAM;AAAA,EAC1C,OAAO;AACL,kBAAc,IAAI,WAAW;AAC7B,gBAAY,IAAI,kBAAkB,MAAM;AACxC,eAAW,IAAI,iBAAiB,WAAW;AAAA,EAC7C;AACF;AACA,OAAO,YAAY,YAAY;AAC/B,IAAI,mBAAmB;AACvB,SAAS,UAAU,iBAAiB,kBAAkB,SAAS;AAC7D,MAAI,WAAW,QAAQ,YAAY;AACjC,WAAO,mBAAmB,iBAAiB,kBAAkB,OAAO;AAAA,EACtE;AACA,MAAI,eAAe,YAAY,iBAAiB,gBAAgB;AAChE,MAAI,iBAAiB,MAAM;AACzB,WAAO;AAAA,EACT;AACA,SAAO,mBAAmB,iBAAiB,kBAAkB,OAAO;AACtE;AACA,OAAO,WAAW,WAAW;AAC7B,SAAS,YAAY,iBAAiB,kBAAkB;AACtD,MAAI,oBAAoB,kBAAkB;AACxC,WAAO,oBAAoB,KAAK,IAAI,oBAAoB,IAAI;AAAA,EAC9D;AACA,MAAI,oBAAoB;AAAA,EACxB,qBAAqB,kBAAkB;AACrC,WAAO;AAAA,EACT;AACA,MAAIA,aAAY,eAAe,KAAKA,aAAY,gBAAgB,GAAG;AACjE,WAAO;AAAA,EACT;AACA,SAAO;AACT;AACA,OAAO,aAAa,aAAa;AACjC,SAAS,mBAAmB,iBAAiB,kBAAkB,SAAS;AACtE,YAAU,WAAW,CAAC;AACtB,UAAQ,UAAU,QAAQ,YAAY,QAAQ,QAAQ,QAAQ,WAAW,IAAI,WAAW;AACxF,MAAI,aAAa,WAAW,QAAQ;AACpC,MAAI,oBAAoB,eAAe,iBAAiB,kBAAkB,QAAQ,OAAO;AACzF,MAAI,sBAAsB,MAAM;AAC9B,WAAO;AAAA,EACT;AACA,MAAI,qBAAqB,eAAe,kBAAkB,iBAAiB,QAAQ,OAAO;AAC1F,MAAI,uBAAuB,MAAM;AAC/B,WAAO;AAAA,EACT;AACA,MAAI,YAAY;AACd,QAAI,mBAAmB,WAAW,iBAAiB,gBAAgB;AACnE,QAAI,qBAAqB,SAAS,qBAAqB,MAAM;AAC3D,iBAAW,iBAAiB,kBAAkB,QAAQ,SAAS,gBAAgB;AAC/E,aAAO;AAAA,IACT;AACA,QAAI,eAAe,YAAY,iBAAiB,gBAAgB;AAChE,QAAI,iBAAiB,MAAM;AACzB,aAAO;AAAA,IACT;AAAA,EACF;AACA,MAAI,eAAe,MAAM,eAAe;AACxC,MAAI,iBAAiB,MAAM,gBAAgB,GAAG;AAC5C,eAAW,iBAAiB,kBAAkB,QAAQ,SAAS,KAAK;AACpE,WAAO;AAAA,EACT;AACA,aAAW,iBAAiB,kBAAkB,QAAQ,SAAS,IAAI;AACnE,MAAI,SAAS,yBAAyB,iBAAiB,kBAAkB,cAAc,OAAO;AAC9F,aAAW,iBAAiB,kBAAkB,QAAQ,SAAS,MAAM;AACrE,SAAO;AACT;AACA,OAAO,oBAAoB,oBAAoB;AAC/C,SAAS,yBAAyB,iBAAiB,kBAAkB,cAAc,SAAS;AAC1F,UAAQ,cAAc;AAAA,IACpB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,UAAU,gBAAgB,QAAQ,GAAG,iBAAiB,QAAQ,CAAC;AAAA,IACxE,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,oBAAoB;AAAA,IAC7B,KAAK;AACH,aAAO,UAAU,iBAAiB,kBAAkB,CAAC,QAAQ,WAAW,MAAM,GAAG,OAAO;AAAA,IAC1F,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,cAAc,iBAAiB,kBAAkB,OAAO;AAAA,IACjE,KAAK;AACH,aAAO,YAAY,iBAAiB,gBAAgB;AAAA,IACtD,KAAK;AACH,aAAO,eAAe,iBAAiB,kBAAkB,OAAO;AAAA,IAClE,KAAK;AACH,aAAO,cAAc,IAAI,WAAW,gBAAgB,MAAM,GAAG,IAAI,WAAW,iBAAiB,MAAM,GAAG,OAAO;AAAA,IAC/G,KAAK;AACH,aAAO,cAAc,IAAI,WAAW,eAAe,GAAG,IAAI,WAAW,gBAAgB,GAAG,OAAO;AAAA,IACjG,KAAK;AACH,aAAO,aAAa,iBAAiB,kBAAkB,OAAO;AAAA,IAChE,KAAK;AACH,aAAO,aAAa,iBAAiB,kBAAkB,OAAO;AAAA,IAChE,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO,gBAAgB,OAAO,gBAAgB;AAAA,IAChD,KAAK;AACH,aAAO,gBAAgB,MAAM,aAAa,MAAM,iBAAiB,MAAM,aAAa;AAAA,IACtF,KAAK;AAAA,IACL,KAAK;AACH,aAAO,gBAAgB,SAAS,MAAM,iBAAiB,SAAS;AAAA,IAClE;AACE,aAAO,YAAY,iBAAiB,kBAAkB,OAAO;AAAA,EACjE;AACF;AACA,OAAO,0BAA0B,0BAA0B;AAC3D,SAAS,YAAY,iBAAiB,kBAAkB;AACtD,SAAO,gBAAgB,SAAS,MAAM,iBAAiB,SAAS;AAClE;AACA,OAAO,aAAa,aAAa;AACjC,SAAS,aAAa,iBAAiB,kBAAkB,SAAS;AAChE,MAAI;AACF,QAAI,gBAAgB,SAAS,iBAAiB,MAAM;AAClD,aAAO;AAAA,IACT;AACA,QAAI,gBAAgB,SAAS,GAAG;AAC9B,aAAO;AAAA,IACT;AAAA,EACF,SAAS,WAAW;AAClB,WAAO;AAAA,EACT;AACA,MAAI,gBAAgB,CAAC;AACrB,MAAI,iBAAiB,CAAC;AACtB,kBAAgB,QAAwB,uBAAO,SAAS,cAAc,KAAK,OAAO;AAChF,kBAAc,KAAK,CAAC,KAAK,KAAK,CAAC;AAAA,EACjC,GAAG,eAAe,CAAC;AACnB,mBAAiB,QAAwB,uBAAO,SAAS,cAAc,KAAK,OAAO;AACjF,mBAAe,KAAK,CAAC,KAAK,KAAK,CAAC;AAAA,EAClC,GAAG,eAAe,CAAC;AACnB,SAAO,cAAc,cAAc,KAAK,GAAG,eAAe,KAAK,GAAG,OAAO;AAC3E;AACA,OAAO,cAAc,cAAc;AACnC,SAAS,cAAc,iBAAiB,kBAAkB,SAAS;AACjE,MAAI,SAAS,gBAAgB;AAC7B,MAAI,WAAW,iBAAiB,QAAQ;AACtC,WAAO;AAAA,EACT;AACA,MAAI,WAAW,GAAG;AAChB,WAAO;AAAA,EACT;AACA,MAAI,QAAQ;AACZ,SAAO,EAAE,QAAQ,QAAQ;AACvB,QAAI,UAAU,gBAAgB,KAAK,GAAG,iBAAiB,KAAK,GAAG,OAAO,MAAM,OAAO;AACjF,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AACA,OAAO,eAAe,eAAe;AACrC,SAAS,eAAe,iBAAiB,kBAAkB,SAAS;AAClE,SAAO,cAAc,oBAAoB,eAAe,GAAG,oBAAoB,gBAAgB,GAAG,OAAO;AAC3G;AACA,OAAO,gBAAgB,gBAAgB;AACvC,SAAS,oBAAoB,QAAQ;AACnC,SAAO,OAAO,WAAW,eAAe,OAAO,WAAW,YAAY,OAAO,OAAO,aAAa,eAAe,OAAO,OAAO,OAAO,QAAQ,MAAM;AACrJ;AACA,OAAO,qBAAqB,qBAAqB;AACjD,SAAS,mBAAmB,QAAQ;AAClC,MAAI,oBAAoB,MAAM,GAAG;AAC/B,QAAI;AACF,aAAO,oBAAoB,OAAO,OAAO,QAAQ,EAAE,CAAC;AAAA,IACtD,SAAS,eAAe;AACtB,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AACA,SAAO,CAAC;AACV;AACA,OAAO,oBAAoB,oBAAoB;AAC/C,SAAS,oBAAoB,WAAW;AACtC,MAAI,kBAAkB,UAAU,KAAK;AACrC,MAAI,cAAc,CAAC,gBAAgB,KAAK;AACxC,SAAO,gBAAgB,SAAS,OAAO;AACrC,sBAAkB,UAAU,KAAK;AACjC,gBAAY,KAAK,gBAAgB,KAAK;AAAA,EACxC;AACA,SAAO;AACT;AACA,OAAO,qBAAqB,qBAAqB;AACjD,SAAS,kBAAkB,QAAQ;AACjC,MAAID,QAAO,CAAC;AACZ,WAAS,OAAO,QAAQ;AACtB,IAAAA,MAAK,KAAK,GAAG;AAAA,EACf;AACA,SAAOA;AACT;AACA,OAAO,mBAAmB,mBAAmB;AAC7C,SAAS,qBAAqB,QAAQ;AACpC,MAAIA,QAAO,CAAC;AACZ,MAAI,UAAU,OAAO,sBAAsB,MAAM;AACjD,WAASP,KAAI,GAAGA,KAAI,QAAQ,QAAQA,MAAK,GAAG;AAC1C,QAAI,MAAM,QAAQA,EAAC;AACnB,QAAI,OAAO,yBAAyB,QAAQ,GAAG,EAAE,YAAY;AAC3D,MAAAO,MAAK,KAAK,GAAG;AAAA,IACf;AAAA,EACF;AACA,SAAOA;AACT;AACA,OAAO,sBAAsB,sBAAsB;AACnD,SAAS,UAAU,iBAAiB,kBAAkBA,OAAM,SAAS;AACnE,MAAI,SAASA,MAAK;AAClB,MAAI,WAAW,GAAG;AAChB,WAAO;AAAA,EACT;AACA,WAASP,KAAI,GAAGA,KAAI,QAAQA,MAAK,GAAG;AAClC,QAAI,UAAU,gBAAgBO,MAAKP,EAAC,CAAC,GAAG,iBAAiBO,MAAKP,EAAC,CAAC,GAAG,OAAO,MAAM,OAAO;AACrF,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AACA,OAAO,WAAW,WAAW;AAC7B,SAAS,YAAY,iBAAiB,kBAAkB,SAAS;AAC/D,MAAI,eAAe,kBAAkB,eAAe;AACpD,MAAI,gBAAgB,kBAAkB,gBAAgB;AACtD,MAAI,kBAAkB,qBAAqB,eAAe;AAC1D,MAAI,mBAAmB,qBAAqB,gBAAgB;AAC5D,iBAAe,aAAa,OAAO,eAAe;AAClD,kBAAgB,cAAc,OAAO,gBAAgB;AACrD,MAAI,aAAa,UAAU,aAAa,WAAW,cAAc,QAAQ;AACvE,QAAI,cAAc,WAAW,YAAY,EAAE,KAAK,GAAG,WAAW,aAAa,EAAE,KAAK,CAAC,MAAM,OAAO;AAC9F,aAAO;AAAA,IACT;AACA,WAAO,UAAU,iBAAiB,kBAAkB,cAAc,OAAO;AAAA,EAC3E;AACA,MAAI,kBAAkB,mBAAmB,eAAe;AACxD,MAAI,mBAAmB,mBAAmB,gBAAgB;AAC1D,MAAI,gBAAgB,UAAU,gBAAgB,WAAW,iBAAiB,QAAQ;AAChF,oBAAgB,KAAK;AACrB,qBAAiB,KAAK;AACtB,WAAO,cAAc,iBAAiB,kBAAkB,OAAO;AAAA,EACjE;AACA,MAAI,aAAa,WAAW,KAAK,gBAAgB,WAAW,KAAK,cAAc,WAAW,KAAK,iBAAiB,WAAW,GAAG;AAC5H,WAAO;AAAA,EACT;AACA,SAAO;AACT;AACA,OAAO,aAAa,aAAa;AACjC,SAASQ,aAAY,OAAO;AAC1B,SAAO,UAAU,QAAQ,OAAO,UAAU;AAC5C;AACA,OAAOA,cAAa,aAAa;AACjC,SAAS,WAAW,KAAK;AACvB,SAAO,IAAI,IAAoB,uBAAO,SAAS,UAAU,OAAO;AAC9D,QAAI,OAAO,UAAU,UAAU;AAC7B,aAAO,MAAM,SAAS;AAAA,IACxB;AACA,WAAO;AAAA,EACT,GAAG,WAAW,CAAC;AACjB;AACA,OAAO,YAAY,YAAY;AAG/B,SAAS,YAAY,KAAK,MAAM;AAC9B,MAAI,OAAO,QAAQ,eAAe,QAAQ,MAAM;AAC9C,WAAO;AAAA,EACT;AACA,SAAO,QAAQ,OAAO,GAAG;AAC3B;AACA,OAAO,aAAa,aAAa;AACjC,SAAS,UAAU,MAAM;AACvB,QAAM,MAAM,KAAK,QAAQ,cAAc,MAAM;AAC7C,QAAM,QAAQ,IAAI,MAAM,iBAAiB;AACzC,SAAO,MAAM,IAAI,CAAC,UAAU;AAC1B,QAAI,UAAU,iBAAiB,UAAU,eAAe,UAAU,aAAa;AAC7E,aAAO,CAAC;AAAA,IACV;AACA,UAAM,SAAS;AACf,UAAM,OAAO,OAAO,KAAK,KAAK;AAC9B,QAAI,SAAS;AACb,QAAI,MAAM;AACR,eAAS,EAAE,GAAG,WAAW,KAAK,CAAC,CAAC,EAAE;AAAA,IACpC,OAAO;AACL,eAAS,EAAE,GAAG,MAAM,QAAQ,eAAe,IAAI,EAAE;AAAA,IACnD;AACA,WAAO;AAAA,EACT,CAAC;AACH;AACA,OAAO,WAAW,WAAW;AAC7B,SAAS,qBAAqB,KAAK,QAAQ,WAAW;AACpD,MAAI,iBAAiB;AACrB,MAAI,MAAM;AACV,cAAY,OAAO,cAAc,cAAc,OAAO,SAAS;AAC/D,WAASR,KAAI,GAAGA,KAAI,WAAWA,MAAK;AAClC,UAAM,OAAO,OAAOA,EAAC;AACrB,QAAI,gBAAgB;AAClB,UAAI,OAAO,KAAK,MAAM,aAAa;AACjC,yBAAiB,eAAe,KAAK,CAAC;AAAA,MACxC,OAAO;AACL,yBAAiB,eAAe,KAAK,CAAC;AAAA,MACxC;AACA,UAAIA,OAAM,YAAY,GAAG;AACvB,cAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AACA,OAAO,sBAAsB,sBAAsB;AACnD,SAAS,YAAY,KAAK,MAAM;AAC9B,QAAM,SAAS,UAAU,IAAI;AAC7B,QAAM,OAAO,OAAO,OAAO,SAAS,CAAC;AACrC,QAAM,OAAO;AAAA,IACX,QAAQ,OAAO,SAAS,IAAI,qBAAqB,KAAK,QAAQ,OAAO,SAAS,CAAC,IAAI;AAAA,IACnF,MAAM,KAAK,KAAK,KAAK;AAAA,IACrB,OAAO,qBAAqB,KAAK,MAAM;AAAA,EACzC;AACA,OAAK,SAAS,YAAY,KAAK,QAAQ,KAAK,IAAI;AAChD,SAAO;AACT;AACA,OAAO,aAAa,aAAa;AAGjC,IAAI,aAAa,MAAMS,YAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoChC,YAAY,KAAK,KAAK,MAAM,UAAU;AAEpC,kBAAc,MAAM,WAAW,CAAC,CAAC;AACjC,SAAK,MAAM,QAAQ,QAAQA,WAAU;AACrC,SAAK,MAAM,YAAY,QAAQ;AAC/B,SAAK,MAAM,UAAU,GAAG;AACxB,SAAK,MAAM,WAAW,GAAG;AACzB,SAAK,MAAM,OAAO,OAAO,aAAa,gBAAgB;AACtD,WAAO,QAAQ,IAAI;AAAA,EACrB;AAAA;AAAA,EAEA,WAAW,eAAe;AACxB,YAAQ;AAAA,MACN;AAAA,IACF;AACA,WAAO,OAAO;AAAA,EAChB;AAAA;AAAA,EAEA,WAAW,aAAa,OAAO;AAC7B,YAAQ;AAAA,MACN;AAAA,IACF;AACA,WAAO,eAAe;AAAA,EACxB;AAAA;AAAA,EAEA,WAAW,WAAW;AACpB,YAAQ;AAAA,MACN;AAAA,IACF;AACA,WAAO,OAAO;AAAA,EAChB;AAAA;AAAA,EAEA,WAAW,SAAS,OAAO;AACzB,YAAQ;AAAA,MACN;AAAA,IACF;AACA,WAAO,WAAW;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,YAAY,MAAMC,KAAI;AAC3B,gBAAY,KAAK,WAAW,MAAMA,GAAE;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,UAAU,MAAMA,KAAI;AACzB,cAAU,KAAK,WAAW,MAAMA,GAAE;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,mBAAmB,MAAMA,KAAI,kBAAkB;AACpD,uBAAmB,KAAK,WAAW,MAAMA,KAAI,gBAAgB;AAAA,EAC/D;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,kBAAkB,MAAMA,KAAI;AACjC,sBAAkB,KAAK,WAAW,MAAMA,GAAE;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,gBAAgB,MAAMA,KAAI;AAC/B,oBAAgB,KAAK,WAAW,MAAMA,GAAE;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,yBAAyB,MAAMA,KAAI,kBAAkB;AAC1D,6BAAyB,KAAK,WAAW,MAAMA,KAAI,gBAAgB;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,OAAO,OAAO,KAAK,YAAY,UAAU,SAAS,UAAU;AAC1D,UAAM,KAAKhB,MAAK,MAAM,SAAS;AAC/B,QAAI,UAAU,SAAU,YAAW;AACnC,QAAI,WAAW,YAAY,WAAW,QAAS,YAAW;AAC1D,QAAI,SAAS,OAAO,SAAU,YAAW;AACzC,QAAI,CAAC,IAAI;AACP,YAAM,YAAY,MAAM,SAAS;AACjC,YAAM,SAAS,UAAU,MAAM,SAAS;AACxC,YAAM,iCAAiC;AAAA,QACrC;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,YAAM,WAAW,YAAY,MAAM,SAAS;AAC5C,UAAI,UAAU;AACZ,uCAA+B,WAAW;AAAA,MAC5C;AACA,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA;AAAA,QAEA,OAAO,eAAe,KAAK,SAAS,KAAK,MAAM,MAAM;AAAA,MACvD;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAI,OAAO;AACT,WAAO,KAAK,MAAM,QAAQ;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAI,KAAK,KAAK;AACZ,SAAK,MAAM,UAAU,GAAG;AAAA,EAC1B;AACF;AACA,OAAO,YAAY,WAAW;AAC9B,IAAI,YAAY;AAGhB,IAAI,SAAS,IAAI,YAAY;AAC7B,IAAI,eAAe,MAAMiB,sBAAqB,MAAM;AAAA,EAClD,YAAY,OAAO,MAAMD,KAAI;AAC3B,UAAM,KAAK;AACX,SAAK,OAAO,OAAO,IAAI;AACvB,SAAK,KAAKA;AAAA,EACZ;AACF;AACA,OAAO,cAAc,aAAa;AAClC,IAAI,cAAc;AAGlB,SAAS,iBAAiB;AACxB,SAAO,OAAO,YAAY,OAAO,UAAU,eAAe,OAAO,YAAY;AAC/E;AACA,OAAO,gBAAgB,gBAAgB;AAGvC,SAAS,YAAY,KAAK,MAAM,QAAQ;AACtC,WAAS,WAAW,SAAS,WAAW;AAAA,EACxC,IAAI;AACJ,SAAO,eAAe,KAAK,MAAM;AAAA,IAC/B,KAAqB,uBAAO,SAAS,iBAAiB;AACpD,UAAI,CAAC,eAAe,KAAK,CAAC,KAAK,MAAM,UAAU,GAAG;AAChD,aAAK,MAAM,QAAQ,cAAc;AAAA,MACnC;AACA,UAAI,SAAS,OAAO,KAAK,IAAI;AAC7B,UAAI,WAAW,OAAQ,QAAO;AAC9B,UAAI,eAAe,IAAI,UAAU;AACjC,oBAAc,MAAM,YAAY;AAChC,aAAO;AAAA,IACT,GAAG,gBAAgB;AAAA,IACnB,cAAc;AAAA,EAChB,CAAC;AACD,SAAO,cAAc,IAAI,YAAY,eAAe,MAAM,MAAM,CAAC;AACnE;AACA,OAAO,aAAa,aAAa;AAGjC,IAAI,eAAe,OAAO,yBAAyB,WAAW;AAC9D,GAAG,QAAQ;AACX,SAAS,eAAeA,KAAI,eAAe,aAAa;AACtD,MAAI,CAAC,aAAa,aAAc,QAAOA;AACvC,SAAO,eAAeA,KAAI,UAAU;AAAA,IAClC,KAAqB,uBAAO,WAAW;AACrC,UAAI,aAAa;AACf,cAAM;AAAA,UACJ,4BAA4B,gBAAgB,6EAA6E,gBAAgB,aAAa,gBAAgB;AAAA,QACxK;AAAA,MACF;AACA,YAAM;AAAA,QACJ,4BAA4B,gBAAgB,4CAA4C,gBAAgB;AAAA,MAC1G;AAAA,IACF,GAAG,KAAK;AAAA,EACV,CAAC;AACD,SAAOA;AACT;AACA,OAAO,gBAAgB,gBAAgB;AAGvC,SAAS,cAAcN,SAAQ;AAC7B,MAAI,SAAS,OAAO,oBAAoBA,OAAM;AAC9C,WAAS,aAAa,UAAU;AAC9B,QAAI,OAAO,QAAQ,QAAQ,MAAM,IAAI;AACnC,aAAO,KAAK,QAAQ;AAAA,IACtB;AAAA,EACF;AACA,SAAO,cAAc,aAAa;AAClC,MAAI,QAAQ,OAAO,eAAeA,OAAM;AACxC,SAAO,UAAU,MAAM;AACrB,WAAO,oBAAoB,KAAK,EAAE,QAAQ,YAAY;AACtD,YAAQ,OAAO,eAAe,KAAK;AAAA,EACrC;AACA,SAAO;AACT;AACA,OAAO,eAAe,eAAe;AAGrC,IAAI,WAAW,CAAC,WAAW,aAAa,QAAQ,QAAQ;AACxD,SAAS,QAAQ,KAAK,wBAAwB;AAC5C,MAAI,CAAC,eAAe,EAAG,QAAO;AAC9B,SAAO,IAAI,MAAM,KAAK;AAAA,IACpB,KAAqB,uBAAO,SAAS,YAAY,QAAQ,UAAU;AACjE,UAAI,OAAO,aAAa,YAAY,OAAO,kBAAkB,QAAQ,QAAQ,MAAM,MAAM,CAAC,QAAQ,IAAI,QAAQ,QAAQ,GAAG;AACvH,YAAI,wBAAwB;AAC1B,gBAAM;AAAA,YACJ,4BAA4B,yBAAyB,MAAM,WAAW,qCAAqC,yBAAyB;AAAA,UACtI;AAAA,QACF;AACA,YAAI,aAAa;AACjB,YAAI,qBAAqB;AACzB,sBAAc,MAAM,EAAE,QAAQ,SAAS,MAAM;AAC3C;AAAA;AAAA;AAAA,YAGE,CAAC,OAAO,UAAU,eAAe,IAAI,KAAK,SAAS,QAAQ,IAAI,MAAM;AAAA,YACrE;AACA,gBAAI,OAAO,qBAAqB,UAAU,MAAM,kBAAkB;AAClE,gBAAI,OAAO,oBAAoB;AAC7B,2BAAa;AACb,mCAAqB;AAAA,YACvB;AAAA,UACF;AAAA,QACF,CAAC;AACD,YAAI,eAAe,MAAM;AACvB,gBAAM;AAAA,YACJ,4BAA4B,WAAW,qBAAqB,aAAa;AAAA,UAC3E;AAAA,QACF,OAAO;AACL,gBAAM,MAAM,4BAA4B,QAAQ;AAAA,QAClD;AAAA,MACF;AACA,UAAI,SAAS,QAAQ,QAAQ,MAAM,MAAM,CAAC,KAAK,QAAQ,UAAU,GAAG;AAClE,aAAK,QAAQ,QAAQ,WAAW;AAAA,MAClC;AACA,aAAO,QAAQ,IAAI,QAAQ,QAAQ;AAAA,IACrC,GAAG,aAAa;AAAA,EAClB,CAAC;AACH;AACA,OAAO,SAAS,SAAS;AACzB,SAAS,qBAAqB,MAAM,MAAM,KAAK;AAC7C,MAAI,KAAK,IAAI,KAAK,SAAS,KAAK,MAAM,KAAK,KAAK;AAC9C,WAAO;AAAA,EACT;AACA,MAAIQ,QAAO,CAAC;AACZ,WAASZ,KAAI,GAAGA,MAAK,KAAK,QAAQA,MAAK;AACrC,IAAAY,MAAKZ,EAAC,IAAI,MAAM,KAAK,SAAS,CAAC,EAAE,KAAK,CAAC;AACvC,IAAAY,MAAKZ,EAAC,EAAE,CAAC,IAAIA;AAAA,EACf;AACA,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,IAAAY,MAAK,CAAC,EAAE,CAAC,IAAI;AAAA,EACf;AACA,WAASZ,KAAI,GAAGA,MAAK,KAAK,QAAQA,MAAK;AACrC,QAAI,KAAK,KAAK,WAAWA,KAAI,CAAC;AAC9B,aAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,UAAI,KAAK,IAAIA,KAAI,CAAC,KAAK,KAAK;AAC1B,QAAAY,MAAKZ,EAAC,EAAE,CAAC,IAAI;AACb;AAAA,MACF;AACA,MAAAY,MAAKZ,EAAC,EAAE,CAAC,IAAI,KAAK;AAAA,QAChBY,MAAKZ,KAAI,CAAC,EAAE,CAAC,IAAI;AAAA,QACjBY,MAAKZ,EAAC,EAAE,IAAI,CAAC,IAAI;AAAA,QACjBY,MAAKZ,KAAI,CAAC,EAAE,IAAI,CAAC,KAAK,OAAO,KAAK,WAAW,IAAI,CAAC,IAAI,IAAI;AAAA,MAC5D;AAAA,IACF;AAAA,EACF;AACA,SAAOY,MAAK,KAAK,MAAM,EAAE,KAAK,MAAM;AACtC;AACA,OAAO,sBAAsB,sBAAsB;AAGnD,SAAS,UAAU,KAAK,MAAM,QAAQ;AACpC,MAAI,gBAAgC,uBAAO,WAAW;AACpD,QAAI,CAAC,KAAK,MAAM,UAAU,GAAG;AAC3B,WAAK,MAAM,QAAQ,aAAa;AAAA,IAClC;AACA,QAAI,SAAS,OAAO,MAAM,MAAM,SAAS;AACzC,QAAI,WAAW,OAAQ,QAAO;AAC9B,QAAI,eAAe,IAAI,UAAU;AACjC,kBAAc,MAAM,YAAY;AAChC,WAAO;AAAA,EACT,GAAG,eAAe;AAClB,iBAAe,eAAe,MAAM,KAAK;AACzC,MAAI,IAAI,IAAI,QAAQ,eAAe,IAAI;AACvC,SAAO,cAAc,IAAI,YAAY,aAAa,MAAM,MAAM,CAAC;AACjE;AACA,OAAO,WAAW,WAAW;AAG7B,SAAS,kBAAkB,KAAK,MAAM,QAAQ;AAC5C,MAAI,OAAO,OAAO,yBAAyB,KAAK,IAAI,GAAG,SAAyB,uBAAO,WAAW;AAAA,EAClG,GAAG,QAAQ;AACX,MAAI,QAAQ,eAAe,OAAO,KAAK,IAAK,UAAS,KAAK;AAC1D,SAAO,eAAe,KAAK,MAAM;AAAA,IAC/B,KAAqB,uBAAO,SAAS,4BAA4B;AAC/D,UAAI,CAAC,eAAe,KAAK,CAAC,KAAK,MAAM,UAAU,GAAG;AAChD,aAAK,MAAM,QAAQ,yBAAyB;AAAA,MAC9C;AACA,UAAI,eAAe,KAAK,MAAM,UAAU;AACxC,WAAK,MAAM,YAAY,IAAI;AAC3B,UAAI,SAAS,OAAO,MAAM,EAAE,KAAK,IAAI;AACrC,WAAK,MAAM,YAAY,YAAY;AACnC,UAAI,WAAW,QAAQ;AACrB,eAAO;AAAA,MACT;AACA,UAAI,eAAe,IAAI,UAAU;AACjC,oBAAc,MAAM,YAAY;AAChC,aAAO;AAAA,IACT,GAAG,2BAA2B;AAAA,IAC9B,cAAc;AAAA,EAChB,CAAC;AACH;AACA,OAAO,mBAAmB,mBAAmB;AAG7C,SAAS,gBAAgB,KAAK,MAAM,QAAQ;AAC1C,MAAI,UAAU,IAAI,IAAI,GAAG,SAAyB,uBAAO,WAAW;AAClE,UAAM,IAAI,MAAM,OAAO,oBAAoB;AAAA,EAC7C,GAAG,QAAQ;AACX,MAAI,WAAW,eAAe,OAAO,QAAS,UAAS;AACvD,MAAI,2BAA2C,uBAAO,WAAW;AAC/D,QAAI,CAAC,KAAK,MAAM,UAAU,GAAG;AAC3B,WAAK,MAAM,QAAQ,wBAAwB;AAAA,IAC7C;AACA,QAAI,eAAe,KAAK,MAAM,UAAU;AACxC,SAAK,MAAM,YAAY,IAAI;AAC3B,QAAI,SAAS,OAAO,MAAM,EAAE,MAAM,MAAM,SAAS;AACjD,SAAK,MAAM,YAAY,YAAY;AACnC,QAAI,WAAW,QAAQ;AACrB,aAAO;AAAA,IACT;AACA,QAAI,eAAe,IAAI,UAAU;AACjC,kBAAc,MAAM,YAAY;AAChC,WAAO;AAAA,EACT,GAAG,0BAA0B;AAC7B,iBAAe,0BAA0B,MAAM,KAAK;AACpD,MAAI,IAAI,IAAI,QAAQ,0BAA0B,IAAI;AACpD;AACA,OAAO,iBAAiB,iBAAiB;AAGzC,IAAI,kBAAkB,OAAO,OAAO,mBAAmB;AACvD,IAAI,SAAyB,uBAAO,WAAW;AAC/C,GAAG,QAAQ;AACX,IAAI,eAAe,OAAO,oBAAoB,MAAM,EAAE,OAAO,SAAS,MAAM;AAC1E,MAAI,WAAW,OAAO,yBAAyB,QAAQ,IAAI;AAC3D,MAAI,OAAO,aAAa,SAAU,QAAO;AACzC,SAAO,CAAC,SAAS;AACnB,CAAC;AACD,IAAI,OAAO,SAAS,UAAU;AAC9B,IAAI,QAAQ,SAAS,UAAU;AAC/B,IAAI,iCAAiC,MAAMC,wCAAuC,YAAY;AAAA,EAC5F,YAAY,OAAO,MAAMH,KAAI,kBAAkB;AAC7C,UAAM,OAAO,MAAMA,GAAE;AACrB,SAAK,mBAAmB;AAAA,EAC1B;AACF;AACA,OAAO,gCAAgC,+BAA+B;AACtE,IAAI,gCAAgC;AACpC,SAAS,mBAAmB,KAAK,MAAM,QAAQ,kBAAkB;AAC/D,MAAI,OAAO,qBAAqB,YAAY;AAC1C,uBAAmC,uBAAO,WAAW;AAAA,IACrD,GAAG,kBAAkB;AAAA,EACvB;AACA,MAAI,oBAAoB;AAAA,IACtB;AAAA,IACA;AAAA,EACF;AACA,MAAI,CAAC,IAAI,WAAW;AAClB,QAAI,YAAY,CAAC;AAAA,EACnB;AACA,MAAI,UAAU,IAAI,IAAI;AACtB,SAAO,eAAe,KAAK,MAAM;AAAA,IAC/B,KAAqB,uBAAO,SAAS,wBAAwB;AAC3D,wBAAkB,iBAAiB,KAAK,IAAI;AAC5C,UAAI,yBAAyC,uBAAO,WAAW;AAC7D,YAAI,CAAC,KAAK,MAAM,UAAU,GAAG;AAC3B,eAAK,MAAM,QAAQ,sBAAsB;AAAA,QAC3C;AACA,YAAI,SAAS,kBAAkB,OAAO,MAAM,MAAM,SAAS;AAC3D,YAAI,WAAW,QAAQ;AACrB,iBAAO;AAAA,QACT;AACA,YAAI,eAAe,IAAI,UAAU;AACjC,sBAAc,MAAM,YAAY;AAChC,eAAO;AAAA,MACT,GAAG,wBAAwB;AAC3B,qBAAe,wBAAwB,MAAM,IAAI;AACjD,UAAI,iBAAiB;AACnB,YAAI,YAAY,OAAO,OAAO,IAAI;AAClC,kBAAU,OAAO;AACjB,kBAAU,QAAQ;AAClB,eAAO,eAAe,wBAAwB,SAAS;AAAA,MACzD,OAAO;AACL,YAAI,gBAAgB,OAAO,oBAAoB,GAAG;AAClD,sBAAc,QAAQ,SAAS,cAAc;AAC3C,cAAI,aAAa,QAAQ,YAAY,MAAM,IAAI;AAC7C;AAAA,UACF;AACA,cAAI,KAAK,OAAO,yBAAyB,KAAK,YAAY;AAC1D,iBAAO,eAAe,wBAAwB,cAAc,EAAE;AAAA,QAChE,CAAC;AAAA,MACH;AACA,oBAAc,MAAM,sBAAsB;AAC1C,aAAO,QAAQ,sBAAsB;AAAA,IACvC,GAAG,uBAAuB;AAAA,IAC1B,cAAc;AAAA,EAChB,CAAC;AACD,SAAO;AAAA,IACL,IAAI;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;AACA,OAAO,oBAAoB,oBAAoB;AAG/C,SAAS,yBAAyB,KAAK,MAAM,QAAQ,kBAAkB;AACrE,MAAI,oBAAoB,IAAI,UAAU,IAAI;AAC1C,MAAI,oBAAoB,kBAAkB;AAC1C,oBAAkB,mBAAmC,uBAAO,SAAS,mCAAmC;AACtG,QAAI,SAAS,iBAAiB,iBAAiB,EAAE,KAAK,IAAI;AAC1D,QAAI,WAAW,QAAQ;AACrB,aAAO;AAAA,IACT;AACA,QAAI,eAAe,IAAI,UAAU;AACjC,kBAAc,MAAM,YAAY;AAChC,WAAO;AAAA,EACT,GAAG,kCAAkC;AACrC,MAAI,UAAU,kBAAkB;AAChC,oBAAkB,SAAyB,uBAAO,SAAS,oCAAoC;AAC7F,QAAI,SAAS,OAAO,OAAO,EAAE,MAAM,MAAM,SAAS;AAClD,QAAI,WAAW,QAAQ;AACrB,aAAO;AAAA,IACT;AACA,QAAI,eAAe,IAAI,UAAU;AACjC,kBAAc,MAAM,YAAY;AAChC,WAAO;AAAA,EACT,GAAG,mCAAmC;AACxC;AACA,OAAO,0BAA0B,0BAA0B;AAG3D,SAAS,iBAAiBI,IAAGC,IAAG;AAC9B,SAAOtB,UAASqB,EAAC,IAAIrB,UAASsB,EAAC,IAAI,KAAK;AAC1C;AACA,OAAO,kBAAkB,kBAAkB;AAG3C,SAAS,gCAAgC,KAAK;AAC5C,MAAI,OAAO,OAAO,0BAA0B,WAAY,QAAO,CAAC;AAChE,SAAO,OAAO,sBAAsB,GAAG,EAAE,OAAO,SAAS,KAAK;AAC5D,WAAO,OAAO,yBAAyB,KAAK,GAAG,EAAE;AAAA,EACnD,CAAC;AACH;AACA,OAAO,iCAAiC,iCAAiC;AAGzE,SAAS,2BAA2B,KAAK;AACvC,SAAO,OAAO,KAAK,GAAG,EAAE,OAAO,gCAAgC,GAAG,CAAC;AACrE;AACA,OAAO,4BAA4B,4BAA4B;AAG/D,IAAI,SAAS,OAAO;AAGpB,SAAS,aAAa,KAAK;AACzB,MAAI,aAAa,KAAK,GAAG;AACzB,MAAI,cAAc,CAAC,SAAS,UAAU,UAAU;AAChD,SAAO,YAAY,QAAQ,UAAU,MAAM;AAC7C;AACA,OAAO,cAAc,cAAc;AACnC,SAAS,YAAY,KAAK,MAAM;AAC9B,MAAI,WAAW,KAAK,KAAK,UAAU;AACnC,MAAI,SAAS,KAAK,KAAK,QAAQ;AAC/B,MAAI,WAAW,KAAK,CAAC;AACrB,MAAI,MAAM,SAAS,KAAK,CAAC,IAAI,KAAK,CAAC;AACnC,MAAI,UAAU;AACZ,WAAO;AAAA,EACT;AACA,MAAI,OAAO,QAAQ,WAAY,OAAM,IAAI;AACzC,QAAM,OAAO;AACb,MAAI,CAAC,KAAK;AACR,WAAO;AAAA,EACT;AACA,MAAI,WAAW,KAAK,GAAG,GAAG;AACxB,WAAO;AAAA,EACT;AACA,MAAIC,YAAW,aAAa,QAAQ;AACpC,MAAI,UAAU,KAAK,GAAG,GAAG;AACvB,WAAOA,YAAW,uBAAuB;AAAA,EAC3C;AACA,SAAOA,YAAW,oBAAoB;AACxC;AACA,OAAO,aAAa,aAAa;AAGjC,SAAS,QAAQN,KAAI;AACnB,SAAOA,IAAG;AACZ;AACA,OAAO,SAAS,SAAS;AACzB,SAAS,UAAU,KAAK;AACtB,SAAO,OAAO,UAAU,SAAS,KAAK,GAAG,MAAM;AACjD;AACA,OAAO,WAAW,UAAU;AAC5B,SAAS,UAAU,KAAK;AACtB,SAAO,CAAC,UAAU,QAAQ,EAAE,SAAS,KAAK,GAAG,CAAC;AAChD;AACA,OAAO,WAAW,WAAW;AAG7B,IAAI,EAAE,MAAM,MAAM,IAAI;AACtB;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,EAAE,QAAQ,SAAS,OAAO;AACxB,YAAU,YAAY,KAAK;AAC7B,CAAC;AACD,UAAU,YAAY,OAAO,WAAW;AACtC,QAAM,MAAM,UAAU,IAAI;AAC5B,CAAC;AACD,UAAU,YAAY,QAAQ,WAAW;AACvC,QAAM,MAAM,QAAQ,IAAI;AAC1B,CAAC;AACD,UAAU,YAAY,UAAU,WAAW;AACzC,QAAM,MAAM,UAAU,IAAI;AAC5B,CAAC;AACD,UAAU,YAAY,OAAO,WAAW;AACtC,QAAM,MAAM,OAAO,IAAI;AACzB,CAAC;AACD,UAAU,YAAY,WAAW,WAAW;AAC1C,QAAM,MAAM,WAAW,IAAI;AAC7B,CAAC;AACD,UAAU,YAAY,OAAO,WAAW;AACtC,QAAM,MAAM,OAAO,IAAI;AACvB,QAAM,MAAM,OAAO,KAAK;AAC1B,CAAC;AACD,UAAU,YAAY,OAAO,WAAW;AACtC,QAAM,MAAM,OAAO,IAAI;AACvB,QAAM,MAAM,OAAO,KAAK;AAC1B,CAAC;AACD,IAAI,gBAAgB;AAAA,EAClB,UAAU;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAAA,EACA,eAAe,CAAC,iBAAiB,wBAAwB;AAAA,EACzD,mBAAmB,CAAC,qBAAqB,wBAAwB;AAAA,EACjE,wBAAwB,CAAC,wBAAwB;AACnD;AACA,SAAS,GAAG,OAAO,KAAK;AACtB,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,UAAQ,MAAM,YAAY;AAC1B,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,UAAU,CAAC,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,EAAE,QAAQ,MAAM,OAAO,CAAC,CAAC,IAAI,QAAQ;AACzG,QAAM,eAAe,KAAK,GAAG,EAAE,YAAY;AAC3C,MAAI,cAAc,UAAU,EAAE,SAAS,KAAK,GAAG;AAC7C,SAAK;AAAA,MACH,cAAc,KAAK,EAAE,SAAS,YAAY;AAAA,MAC1C,4BAA4B,UAAU;AAAA,MACtC,gCAAgC,UAAU;AAAA,IAC5C;AAAA,EACF,OAAO;AACL,SAAK;AAAA,MACH,UAAU;AAAA,MACV,4BAA4B,UAAU;AAAA,MACtC,gCAAgC,UAAU;AAAA,IAC5C;AAAA,EACF;AACF;AACA,OAAO,IAAI,IAAI;AACf,UAAU,mBAAmB,MAAM,EAAE;AACrC,UAAU,mBAAmB,KAAK,EAAE;AACpC,SAAS,cAAcI,IAAGC,IAAG;AAC3B,SAAO,OAAOD,EAAC,KAAK,OAAOC,EAAC,KAAKD,OAAMC;AACzC;AACA,OAAO,eAAe,eAAe;AACrC,SAAS,0BAA0B;AACjC,QAAM,MAAM,YAAY,IAAI;AAC9B;AACA,OAAO,yBAAyB,yBAAyB;AACzD,SAAS,QAAQ,KAAK,KAAK;AACzB,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,UAAU,KAAK,GAAG,EAAE,YAAY,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,SAAS,MAAM,MAAM,QAAQ,GAAG,OAAO,MAAM,MAAM,MAAM,GAAG,SAAS,MAAM,MAAM,MAAM,GAAG,aAAa,SAAS,UAAU,IAAI,QAAQ,SAAS,MAAM,MAAM,KAAK,IAAI;AAC1Q,YAAU,UAAU,UAAU,OAAO;AACrC,MAAI,WAAW;AACf,UAAQ,SAAS;AAAA,IACf,KAAK;AACH,iBAAW,IAAI,QAAQ,GAAG,MAAM;AAChC;AAAA,IACF,KAAK;AACH,UAAI,QAAQ;AACV,cAAM,IAAI;AAAA,UACR,UAAU;AAAA,UACV;AAAA,UACA;AAAA,QACF;AAAA,MACF;AACA,iBAAW,IAAI,IAAI,GAAG;AACtB;AAAA,IACF,KAAK;AACH,UAAI,QAAQ,SAAS,MAAM;AACzB,mBAAW,YAAY,MAAM,MAAM,GAAG;AAAA,MACxC,CAAC;AACD;AAAA,IACF,KAAK;AACH,UAAI,QAAQ;AACV,YAAI,QAAQ,SAAS,MAAM;AACzB,qBAAW,YAAY,MAAM,MAAM,GAAG;AAAA,QACxC,CAAC;AAAA,MACH,OAAO;AACL,mBAAW,IAAI,IAAI,GAAG;AAAA,MACxB;AACA;AAAA,IACF,KAAK;AACH,UAAI,QAAQ;AACV,mBAAW,IAAI,KAAK,SAAS,MAAM;AACjC,iBAAO,MAAM,MAAM,GAAG;AAAA,QACxB,CAAC;AAAA,MACH,OAAO;AACL,mBAAW,IAAI,QAAQ,GAAG,MAAM;AAAA,MAClC;AACA;AAAA,IACF,SAAS;AACP,UAAI,QAAQ,OAAO,GAAG,GAAG;AACvB,cAAM,IAAI;AAAA,UACR,UAAU,yCAAyC,UAAU,UAAU,KAAK,GAAG,EAAE,YAAY,IAAI,yHAAyH,KAAK,GAAG,EAAE,YAAY;AAAA,UAChP;AAAA,UACA;AAAA,QACF;AAAA,MACF;AACA,UAAI,QAAQ,OAAO,KAAK,GAAG;AAC3B,UAAI,WAAW;AACf,UAAI,UAAU;AACd,YAAM,QAAQ,SAAS,MAAM;AAC3B,YAAI,gBAAgB,IAAI,UAAU,GAAG;AACrC,sBAAc,MAAM,eAAe,IAAI;AACvC,cAAM,eAAe,YAAY,IAAI;AACrC,YAAI,CAAC,UAAU,MAAM,WAAW,GAAG;AACjC,wBAAc,SAAS,MAAM,IAAI,IAAI,CAAC;AACtC;AAAA,QACF;AACA,YAAI;AACF,wBAAc,SAAS,MAAM,IAAI,IAAI,CAAC;AAAA,QACxC,SAAS,KAAK;AACZ,cAAI,CAAC,oBAAoB,sBAAsB,KAAK,cAAc,GAAG;AACnE,kBAAM;AAAA,UACR;AACA,cAAI,aAAa,KAAM,YAAW;AAClC;AAAA,QACF;AAAA,MACF,GAAG,IAAI;AACP,UAAI,UAAU,MAAM,SAAS,KAAK,YAAY,MAAM,QAAQ;AAC1D,cAAM;AAAA,MACR;AACA;AAAA,IACF;AAAA,EACF;AACA,OAAK;AAAA,IACH;AAAA,IACA,yBAAyB,aAAa,aAAatB,UAAS,GAAG;AAAA,IAC/D,6BAA6B,aAAa,aAAaA,UAAS,GAAG;AAAA,EACrE;AACF;AACA,OAAO,SAAS,SAAS;AACzB,UAAU,mBAAmB,WAAW,SAAS,uBAAuB;AACxE,UAAU,mBAAmB,WAAW,SAAS,uBAAuB;AACxE,UAAU,mBAAmB,YAAY,SAAS,uBAAuB;AACzE,UAAU,mBAAmB,YAAY,SAAS,uBAAuB;AACzE,UAAU,YAAY,MAAM,WAAW;AACrC,OAAK;AAAA,IACH,MAAM,MAAM,QAAQ;AAAA,IACpB;AAAA,IACA;AAAA,EACF;AACF,CAAC;AACD,UAAU,YAAY,QAAQ,WAAW;AACvC,OAAK;AAAA,IACH,SAAS,MAAM,MAAM,QAAQ;AAAA,IAC7B;AAAA,IACA;AAAA,IACA,MAAM,MAAM,QAAQ,IAAI,QAAQ;AAAA,EAClC;AACF,CAAC;AACD,UAAU,YAAY,WAAW,WAAW;AAC1C,QAAMW,UAAS,MAAM,MAAM,QAAQ;AACnC,OAAK;AAAA,IACH,CAAC,UAAU,QAAQ,EAAE,SAAS,KAAKA,OAAM,CAAC;AAAA,IAC1C;AAAA,IACA;AAAA,IACA,MAAM,MAAM,QAAQ,IAAI,QAAQ;AAAA,EAClC;AACF,CAAC;AACD,UAAU,YAAY,YAAY,WAAW;AAC3C,QAAM,MAAM,MAAM,MAAM,QAAQ;AAChC,QAAM,OAAO,MAAM,MAAM,MAAM;AAC/B,QAAM,UAAU,MAAM,MAAM,SAAS;AACrC,QAAM,MAAM,UAAU,GAAG,OAAO,OAAO;AACvC,QAAM,SAAS,MAAM,MAAM,QAAQ;AACnC,QAAM,mBAAmB,SAAS,GAAG,GAAG,YAAYX,UAAS,GAAG,CAAC,mCAAmC,GAAG,GAAG,YAAYA,UAAS,GAAG,CAAC;AACnI,QAAM,aAAa;AAAA,IACjB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,SAAS,KAAK,GAAG,CAAC;AACpB,MAAI,cAAc,UAAU,CAAC,cAAc,CAAC,QAAQ;AAClD,UAAM,IAAI,eAAe,kBAAkB,QAAQ,IAAI;AAAA,EACzD;AACF,CAAC;AACD,UAAU,YAAY,SAAS,WAAW;AACxC,OAAK;AAAA,IACH,UAAU,MAAM,MAAM,QAAQ;AAAA,IAC9B;AAAA,IACA;AAAA,IACA,MAAM,MAAM,QAAQ,IAAI,OAAO;AAAA,EACjC;AACF,CAAC;AACD,UAAU,YAAY,QAAQ,WAAW;AACvC,OAAK;AAAA,IACH,SAAS,MAAM,MAAM,QAAQ;AAAA,IAC7B;AAAA,IACA;AAAA,EACF;AACF,CAAC;AACD,UAAU,YAAY,aAAa,WAAW;AAC5C,OAAK;AAAA,IACH,WAAW,MAAM,MAAM,QAAQ;AAAA,IAC/B;AAAA,IACA;AAAA,EACF;AACF,CAAC;AACD,UAAU,YAAY,OAAO,WAAW;AACtC,OAAK;AAAA,IACH,OAAO,MAAM,MAAM,QAAQ,CAAC;AAAA,IAC5B;AAAA,IACA;AAAA,EACF;AACF,CAAC;AACD,SAAS,cAAc;AACrB,MAAI,MAAM,MAAM,MAAM,QAAQ;AAC9B,OAAK;AAAA,IACH,QAAQ,QAAQ,QAAQ;AAAA,IACxB;AAAA,IACA;AAAA,EACF;AACF;AACA,OAAO,aAAa,aAAa;AACjC,UAAU,YAAY,SAAS,WAAW;AAC1C,UAAU,YAAY,UAAU,WAAW;AAC3C,UAAU,YAAY,SAAS,WAAW;AACxC,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,OAAO,MAAM,MAAM,MAAM,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG;AAC/F,YAAU,UAAU,UAAU,OAAO;AACrC,UAAQ,KAAK,GAAG,EAAE,YAAY,GAAG;AAAA,IAC/B,KAAK;AAAA,IACL,KAAK;AACH,mBAAa,IAAI;AACjB;AAAA,IACF,KAAK;AAAA,IACL,KAAK;AACH,mBAAa,IAAI;AACjB;AAAA,IACF,KAAK;AAAA,IACL,KAAK;AACH,YAAM,IAAI;AAAA,QACR,UAAU;AAAA,QACV;AAAA,QACA;AAAA,MACF;AAAA,IACF,KAAK,YAAY;AACf,YAAM,MAAM,UAAU,kCAAkC,QAAQ,GAAG;AACnE,YAAM,IAAI,eAAe,IAAI,KAAK,GAAG,QAAQ,IAAI;AAAA,IACnD;AAAA,IACA;AACE,UAAI,QAAQ,OAAO,GAAG,GAAG;AACvB,cAAM,IAAI;AAAA,UACR,UAAU,4CAA4CA,UAAS,GAAG;AAAA,UAClE;AAAA,UACA;AAAA,QACF;AAAA,MACF;AACA,mBAAa,OAAO,KAAK,GAAG,EAAE;AAAA,EAClC;AACA,OAAK;AAAA,IACH,MAAM;AAAA,IACN;AAAA,IACA;AAAA,EACF;AACF,CAAC;AACD,SAAS,iBAAiB;AACxB,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,QAAQ,KAAK,GAAG;AACjD,OAAK;AAAA,IACH,gBAAgB;AAAA,IAChB,8CAA8C;AAAA,IAC9C;AAAA,EACF;AACF;AACA,OAAO,gBAAgB,gBAAgB;AACvC,UAAU,YAAY,aAAa,cAAc;AACjD,UAAU,YAAY,aAAa,cAAc;AACjD,SAAS,YAAY,KAAK,KAAK;AAC7B,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ;AAC9B,MAAI,MAAM,MAAM,MAAM,GAAG;AACvB,QAAI,eAAe,MAAM,MAAM,UAAU;AACzC,UAAM,MAAM,YAAY,IAAI;AAC5B,SAAK,IAAI,GAAG;AACZ,UAAM,MAAM,YAAY,YAAY;AAAA,EACtC,OAAO;AACL,SAAK;AAAA,MACH,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA;AAAA,MACA,KAAK;AAAA,MACL;AAAA,IACF;AAAA,EACF;AACF;AACA,OAAO,aAAa,aAAa;AACjC,UAAU,UAAU,SAAS,WAAW;AACxC,UAAU,UAAU,UAAU,WAAW;AACzC,UAAU,UAAU,MAAM,WAAW;AACrC,SAAS,UAAU,KAAK,KAAK;AAC3B,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,KAAK;AAC3B,OAAK;AAAA,IACH,IAAI,KAAK,MAAM,MAAM,QAAQ,CAAC;AAAA,IAC9B;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAK;AAAA,IACL;AAAA,EACF;AACF;AACA,OAAO,WAAW,WAAW;AAC7B,UAAU,UAAU,OAAO,SAAS;AACpC,UAAU,UAAU,QAAQ,SAAS;AACrC,SAAS,YAAYwB,IAAG,KAAK;AAC3B,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,WAAW,MAAM,MAAM,UAAU,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,YAAY,UAAU,UAAU,OAAO,IAAI,OAAO,MAAM,MAAM,MAAM,GAAG,UAAU,KAAK,GAAG,EAAE,YAAY,GAAG,QAAQ,KAAKA,EAAC,EAAE,YAAY;AAC7O,MAAI,YAAY,YAAY,SAAS,YAAY,OAAO;AACtD,QAAI,UAAU,KAAK,SAAS,MAAM,IAAI,EAAE,GAAG,KAAK,SAAS,QAAQ;AAAA,EACnE;AACA,MAAI,CAAC,YAAY,YAAY,UAAU,UAAU,QAAQ;AACvD,UAAM,IAAI;AAAA,MACR,YAAY;AAAA,MACZ;AAAA,MACA;AAAA,IACF;AAAA,EACF,WAAW,CAAC,UAAUA,EAAC,MAAM,YAAY,UAAU,GAAG,IAAI;AACxD,UAAM,IAAI;AAAA,MACR,YAAY;AAAA,MACZ;AAAA,MACA;AAAA,IACF;AAAA,EACF,WAAW,CAAC,YAAY,YAAY,UAAU,CAAC,UAAU,GAAG,GAAG;AAC7D,QAAI,WAAW,YAAY,WAAW,MAAM,MAAM,MAAM;AACxD,UAAM,IAAI;AAAA,MACR,YAAY,cAAc,WAAW;AAAA,MACrC;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,MAAI,UAAU;AACZ,QAAI,aAAa,UAAU;AAC3B,QAAI,YAAY,SAAS,YAAY,OAAO;AAC1C,mBAAa;AACb,mBAAa,IAAI;AAAA,IACnB,OAAO;AACL,mBAAa,IAAI;AAAA,IACnB;AACA,SAAK;AAAA,MACH,aAAaA;AAAA,MACb,gCAAgC,aAAa;AAAA,MAC7C,oCAAoC,aAAa;AAAA,MACjDA;AAAA,MACA;AAAA,IACF;AAAA,EACF,OAAO;AACL,SAAK;AAAA,MACH,MAAMA;AAAA,MACN;AAAA,MACA;AAAA,MACAA;AAAA,IACF;AAAA,EACF;AACF;AACA,OAAO,aAAa,aAAa;AACjC,UAAU,UAAU,SAAS,WAAW;AACxC,UAAU,UAAU,MAAM,WAAW;AACrC,UAAU,UAAU,eAAe,WAAW;AAC9C,SAAS,YAAYA,IAAG,KAAK;AAC3B,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,WAAW,MAAM,MAAM,UAAU,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,YAAY,UAAU,UAAU,OAAO,IAAI,OAAO,MAAM,MAAM,MAAM,GAAG,UAAU,KAAK,GAAG,EAAE,YAAY,GAAG,QAAQ,KAAKA,EAAC,EAAE,YAAY,GAAG,cAAc,cAAc;AAC5Q,MAAI,YAAY,YAAY,SAAS,YAAY,OAAO;AACtD,QAAI,UAAU,KAAK,SAAS,MAAM,IAAI,EAAE,GAAG,KAAK,SAAS,QAAQ;AAAA,EACnE;AACA,MAAI,CAAC,YAAY,YAAY,UAAU,UAAU,QAAQ;AACvD,mBAAe,YAAY;AAAA,EAC7B,WAAW,CAAC,UAAUA,EAAC,MAAM,YAAY,UAAU,GAAG,IAAI;AACxD,mBAAe,YAAY;AAAA,EAC7B,WAAW,CAAC,YAAY,YAAY,UAAU,CAAC,UAAU,GAAG,GAAG;AAC7D,QAAI,WAAW,YAAY,WAAW,MAAM,MAAM,MAAM;AACxD,mBAAe,YAAY,cAAc,WAAW;AAAA,EACtD,OAAO;AACL,kBAAc;AAAA,EAChB;AACA,MAAI,aAAa;AACf,UAAM,IAAI,eAAe,cAAc,QAAQ,IAAI;AAAA,EACrD;AACA,MAAI,UAAU;AACZ,QAAI,aAAa,UAAU;AAC3B,QAAI,YAAY,SAAS,YAAY,OAAO;AAC1C,mBAAa;AACb,mBAAa,IAAI;AAAA,IACnB,OAAO;AACL,mBAAa,IAAI;AAAA,IACnB;AACA,SAAK;AAAA,MACH,cAAcA;AAAA,MACd,gCAAgC,aAAa;AAAA,MAC7C,gCAAgC,aAAa;AAAA,MAC7CA;AAAA,MACA;AAAA,IACF;AAAA,EACF,OAAO;AACL,SAAK;AAAA,MACH,OAAOA;AAAA,MACP;AAAA,MACA;AAAA,MACAA;AAAA,IACF;AAAA,EACF;AACF;AACA,OAAO,aAAa,aAAa;AACjC,UAAU,UAAU,SAAS,WAAW;AACxC,UAAU,UAAU,OAAO,WAAW;AACtC,UAAU,UAAU,sBAAsB,WAAW;AACrD,SAAS,YAAYA,IAAG,KAAK;AAC3B,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,WAAW,MAAM,MAAM,UAAU,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,YAAY,UAAU,UAAU,OAAO,IAAI,OAAO,MAAM,MAAM,MAAM,GAAG,UAAU,KAAK,GAAG,EAAE,YAAY,GAAG,QAAQ,KAAKA,EAAC,EAAE,YAAY,GAAG,cAAc,cAAc;AAC5Q,MAAI,YAAY,YAAY,SAAS,YAAY,OAAO;AACtD,QAAI,UAAU,KAAK,SAAS,MAAM,IAAI,EAAE,GAAG,KAAK,SAAS,QAAQ;AAAA,EACnE;AACA,MAAI,CAAC,YAAY,YAAY,UAAU,UAAU,QAAQ;AACvD,mBAAe,YAAY;AAAA,EAC7B,WAAW,CAAC,UAAUA,EAAC,MAAM,YAAY,UAAU,GAAG,IAAI;AACxD,mBAAe,YAAY;AAAA,EAC7B,WAAW,CAAC,YAAY,YAAY,UAAU,CAAC,UAAU,GAAG,GAAG;AAC7D,QAAI,WAAW,YAAY,WAAW,MAAM,MAAM,MAAM;AACxD,mBAAe,YAAY,cAAc,WAAW;AAAA,EACtD,OAAO;AACL,kBAAc;AAAA,EAChB;AACA,MAAI,aAAa;AACf,UAAM,IAAI,eAAe,cAAc,QAAQ,IAAI;AAAA,EACrD;AACA,MAAI,UAAU;AACZ,QAAI,aAAa,UAAU;AAC3B,QAAI,YAAY,SAAS,YAAY,OAAO;AAC1C,mBAAa;AACb,mBAAa,IAAI;AAAA,IACnB,OAAO;AACL,mBAAa,IAAI;AAAA,IACnB;AACA,SAAK;AAAA,MACH,aAAaA;AAAA,MACb,gCAAgC,aAAa;AAAA,MAC7C,oCAAoC,aAAa;AAAA,MACjDA;AAAA,MACA;AAAA,IACF;AAAA,EACF,OAAO;AACL,SAAK;AAAA,MACH,MAAMA;AAAA,MACN;AAAA,MACA;AAAA,MACAA;AAAA,IACF;AAAA,EACF;AACF;AACA,OAAO,aAAa,aAAa;AACjC,UAAU,UAAU,SAAS,WAAW;AACxC,UAAU,UAAU,MAAM,WAAW;AACrC,UAAU,UAAU,YAAY,WAAW;AAC3C,SAAS,WAAWA,IAAG,KAAK;AAC1B,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,WAAW,MAAM,MAAM,UAAU,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,YAAY,UAAU,UAAU,OAAO,IAAI,OAAO,MAAM,MAAM,MAAM,GAAG,UAAU,KAAK,GAAG,EAAE,YAAY,GAAG,QAAQ,KAAKA,EAAC,EAAE,YAAY,GAAG,cAAc,cAAc;AAC5Q,MAAI,YAAY,YAAY,SAAS,YAAY,OAAO;AACtD,QAAI,UAAU,KAAK,SAAS,MAAM,IAAI,EAAE,GAAG,KAAK,SAAS,QAAQ;AAAA,EACnE;AACA,MAAI,CAAC,YAAY,YAAY,UAAU,UAAU,QAAQ;AACvD,mBAAe,YAAY;AAAA,EAC7B,WAAW,CAAC,UAAUA,EAAC,MAAM,YAAY,UAAU,GAAG,IAAI;AACxD,mBAAe,YAAY;AAAA,EAC7B,WAAW,CAAC,YAAY,YAAY,UAAU,CAAC,UAAU,GAAG,GAAG;AAC7D,QAAI,WAAW,YAAY,WAAW,MAAM,MAAM,MAAM;AACxD,mBAAe,YAAY,cAAc,WAAW;AAAA,EACtD,OAAO;AACL,kBAAc;AAAA,EAChB;AACA,MAAI,aAAa;AACf,UAAM,IAAI,eAAe,cAAc,QAAQ,IAAI;AAAA,EACrD;AACA,MAAI,UAAU;AACZ,QAAI,aAAa,UAAU;AAC3B,QAAI,YAAY,SAAS,YAAY,OAAO;AAC1C,mBAAa;AACb,mBAAa,IAAI;AAAA,IACnB,OAAO;AACL,mBAAa,IAAI;AAAA,IACnB;AACA,SAAK;AAAA,MACH,cAAcA;AAAA,MACd,gCAAgC,aAAa;AAAA,MAC7C,gCAAgC,aAAa;AAAA,MAC7CA;AAAA,MACA;AAAA,IACF;AAAA,EACF,OAAO;AACL,SAAK;AAAA,MACH,OAAOA;AAAA,MACP;AAAA,MACA;AAAA,MACAA;AAAA,IACF;AAAA,EACF;AACF;AACA,OAAO,YAAY,YAAY;AAC/B,UAAU,UAAU,QAAQ,UAAU;AACtC,UAAU,UAAU,OAAO,UAAU;AACrC,UAAU,UAAU,mBAAmB,UAAU;AACjD,UAAU,UAAU,UAAU,SAAS,OAAO,QAAQ,KAAK;AACzD,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,WAAW,MAAM,MAAM,UAAU,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,YAAY,UAAU,UAAU,OAAO,IAAI,OAAO,MAAM,MAAM,MAAM,GAAG,UAAU,KAAK,GAAG,EAAE,YAAY,GAAG,YAAY,KAAK,KAAK,EAAE,YAAY,GAAG,aAAa,KAAK,MAAM,EAAE,YAAY,GAAG,cAAc,cAAc,MAAM,QAAQ,cAAc,UAAU,eAAe,SAAS,MAAM,YAAY,IAAI,OAAO,OAAO,YAAY,IAAI,QAAQ,OAAO;AAC9b,MAAI,YAAY,YAAY,SAAS,YAAY,OAAO;AACtD,QAAI,UAAU,KAAK,SAAS,MAAM,IAAI,EAAE,GAAG,KAAK,SAAS,QAAQ;AAAA,EACnE;AACA,MAAI,CAAC,YAAY,YAAY,WAAW,cAAc,UAAU,eAAe,SAAS;AACtF,mBAAe,YAAY;AAAA,EAC7B,YAAY,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,MAAM,OAAO,YAAY,UAAU,GAAG,IAAI;AACpF,mBAAe,YAAY;AAAA,EAC7B,WAAW,CAAC,YAAY,YAAY,UAAU,CAAC,UAAU,GAAG,GAAG;AAC7D,QAAI,WAAW,YAAY,WAAW,MAAM,MAAM,MAAM;AACxD,mBAAe,YAAY,cAAc,WAAW;AAAA,EACtD,OAAO;AACL,kBAAc;AAAA,EAChB;AACA,MAAI,aAAa;AACf,UAAM,IAAI,eAAe,cAAc,QAAQ,IAAI;AAAA,EACrD;AACA,MAAI,UAAU;AACZ,QAAI,aAAa,UAAU;AAC3B,QAAI,YAAY,SAAS,YAAY,OAAO;AAC1C,mBAAa;AACb,mBAAa,IAAI;AAAA,IACnB,OAAO;AACL,mBAAa,IAAI;AAAA,IACnB;AACA,SAAK;AAAA,MACH,cAAc,SAAS,cAAc;AAAA,MACrC,gCAAgC,aAAa,aAAa;AAAA,MAC1D,oCAAoC,aAAa,aAAa;AAAA,IAChE;AAAA,EACF,OAAO;AACL,SAAK;AAAA,MACH,OAAO,SAAS,OAAO;AAAA,MACvB,mCAAmC;AAAA,MACnC,uCAAuC;AAAA,IACzC;AAAA,EACF;AACF,CAAC;AACD,SAAS,iBAAiB,aAAa,KAAK;AAC1C,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,SAAS,MAAM,MAAM,QAAQ;AACjC,MAAI,OAAO,MAAM,MAAM,MAAM;AAC7B,MAAI,UAAU,MAAM,MAAM,SAAS;AACnC,MAAI;AACJ,MAAI;AACF,mBAAe,kBAAkB;AAAA,EACnC,SAAS,KAAK;AACZ,QAAI,eAAe,WAAW;AAC5B,gBAAU,UAAU,UAAU,OAAO;AACrC,YAAM,IAAI;AAAA,QACR,UAAU,sDAAsD,KAAK,WAAW,IAAI;AAAA,QACpF;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,UAAM;AAAA,EACR;AACA,MAAI,OAAO,QAAQ,WAAW;AAC9B,MAAI,QAAQ,MAAM;AAChB,WAAO;AAAA,EACT;AACA,OAAK;AAAA,IACH;AAAA,IACA,2CAA2C;AAAA,IAC3C,+CAA+C;AAAA,EACjD;AACF;AACA,OAAO,kBAAkB,kBAAkB;AAC3C,UAAU,UAAU,cAAc,gBAAgB;AAClD,UAAU,UAAU,cAAc,gBAAgB;AAClD,SAAS,eAAe,MAAM,KAAK,KAAK;AACtC,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,WAAW,MAAM,MAAM,QAAQ,GAAG,QAAQ,MAAM,MAAM,KAAK,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,MAAM,MAAM,MAAM,QAAQ,GAAG,OAAO,MAAM,MAAM,MAAM,GAAG,WAAW,OAAO;AAC/K,YAAU,UAAU,UAAU,OAAO;AACrC,MAAI,UAAU;AACZ,QAAI,aAAa,UAAU;AACzB,YAAM,IAAI;AAAA,QACR,UAAU;AAAA,QACV;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF,OAAO;AACL,QAAI,aAAa,YAAY,aAAa,YAAY,aAAa,UAAU;AAC3E,YAAM,IAAI;AAAA,QACR,UAAU;AAAA,QACV;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,MAAI,YAAY,OAAO;AACrB,UAAM,IAAI;AAAA,MACR,UAAU;AAAA,MACV;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,MAAI,QAAQ,QAAQ,QAAQ,QAAQ;AAClC,UAAM,IAAI;AAAA,MACR,UAAU;AAAA,MACV;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,MAAI,SAAS,MAAM,MAAM,MAAM,GAAG,SAAS,MAAM,MAAM,QAAQ,GAAG,WAAW,WAAW,YAAY,KAAK,IAAI,IAAI,MAAM,QAAQ,WAAW,SAAS,QAAQ,IAAI,IAAI,GAAG,QAAQ,SAAS,MAAM,MAAM,KAAK,IAAI,CAAC,MAAM,SAAS,SAAS;AACrO,MAAI,aAAa;AACjB,MAAI,OAAQ,eAAc;AAC1B,MAAI,MAAO,eAAc;AACzB,MAAI,SAAU,eAAc;AAC5B,gBAAc;AACd,MAAI;AACJ,MAAI,MAAO,gBAAe,OAAO,UAAU,eAAe,KAAK,KAAK,IAAI;AAAA,WAC/D,SAAU,gBAAe,SAAS;AAAA,MACtC,gBAAe,YAAY,KAAK,IAAI;AACzC,MAAI,CAAC,UAAU,UAAU,WAAW,GAAG;AACrC,SAAK;AAAA,MACH;AAAA,MACA,8BAA8B,aAAaxB,UAAS,IAAI;AAAA,MACxD,kCAAkC,aAAaA,UAAS,IAAI;AAAA,IAC9D;AAAA,EACF;AACA,MAAI,UAAU,SAAS,GAAG;AACxB,SAAK;AAAA,MACH,gBAAgB,MAAM,KAAK,KAAK;AAAA,MAChC,8BAA8B,aAAaA,UAAS,IAAI,IAAI;AAAA,MAC5D,kCAAkC,aAAaA,UAAS,IAAI,IAAI;AAAA,MAChE;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,QAAM,MAAM,UAAU,KAAK;AAC7B;AACA,OAAO,gBAAgB,gBAAgB;AACvC,UAAU,UAAU,YAAY,cAAc;AAC9C,SAAS,kBAAkB,OAAO,QAAQ,MAAM;AAC9C,QAAM,MAAM,OAAO,IAAI;AACvB,iBAAe,MAAM,MAAM,SAAS;AACtC;AACA,OAAO,mBAAmB,mBAAmB;AAC7C,UAAU,UAAU,eAAe,iBAAiB;AACpD,UAAU,UAAU,mBAAmB,iBAAiB;AACxD,SAAS,4BAA4B,MAAM,YAAY,KAAK;AAC1D,MAAI,OAAO,eAAe,UAAU;AAClC,UAAM;AACN,iBAAa;AAAA,EACf;AACA,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ;AAC9B,MAAI,mBAAmB,OAAO,yBAAyB,OAAO,GAAG,GAAG,IAAI;AACxE,MAAI,MAAM,MAAM,MAAM,KAAK;AAC3B,MAAI,oBAAoB,YAAY;AAClC,SAAK;AAAA,MACH,IAAI,YAAY,gBAAgB;AAAA,MAChC,8CAA8CA,UAAS,IAAI,IAAI,0BAA0BA,UAAS,UAAU,IAAI,WAAWA,UAAS,gBAAgB;AAAA,MACpJ,8CAA8CA,UAAS,IAAI,IAAI,8BAA8BA,UAAS,UAAU;AAAA,MAChH;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF,OAAO;AACL,SAAK;AAAA,MACH;AAAA,MACA,6DAA6DA,UAAS,IAAI;AAAA,MAC1E,iEAAiEA,UAAS,IAAI;AAAA,IAChF;AAAA,EACF;AACA,QAAM,MAAM,UAAU,gBAAgB;AACxC;AACA,OAAO,6BAA6B,6BAA6B;AACjE,UAAU,UAAU,yBAAyB,2BAA2B;AACxE,UAAU,UAAU,6BAA6B,2BAA2B;AAC5E,SAAS,oBAAoB;AAC3B,QAAM,MAAM,YAAY,IAAI;AAC9B;AACA,OAAO,mBAAmB,mBAAmB;AAC7C,SAAS,aAAawB,IAAG,KAAK;AAC5B,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,UAAU,KAAK,GAAG,EAAE,YAAY,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,OAAO,MAAM,MAAM,MAAM,GAAG,aAAa,UAAU;AACzJ,UAAQ,SAAS;AAAA,IACf,KAAK;AAAA,IACL,KAAK;AACH,mBAAa;AACb,mBAAa,IAAI;AACjB;AAAA,IACF;AACE,UAAI,UAAU,KAAK,SAAS,MAAM,IAAI,EAAE,GAAG,KAAK,SAAS,QAAQ;AACjE,mBAAa,IAAI;AAAA,EACrB;AACA,OAAK;AAAA,IACH,cAAcA;AAAA,IACd,gCAAgC,aAAa;AAAA,IAC7C,oCAAoC,aAAa;AAAA,IACjDA;AAAA,IACA;AAAA,EACF;AACF;AACA,OAAO,cAAc,cAAc;AACnC,UAAU,mBAAmB,UAAU,cAAc,iBAAiB;AACtE,UAAU,mBAAmB,YAAY,cAAc,iBAAiB;AACxE,SAAS,YAAY,IAAI,KAAK;AAC5B,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ;AAC9B,OAAK;AAAA,IACH,GAAG,KAAK,GAAG;AAAA,IACX,+BAA+B;AAAA,IAC/B,mCAAmC;AAAA,EACrC;AACF;AACA,OAAO,aAAa,aAAa;AACjC,UAAU,UAAU,SAAS,WAAW;AACxC,UAAU,UAAU,WAAW,WAAW;AAC1C,UAAU,UAAU,UAAU,SAAS,KAAK,KAAK;AAC/C,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,OAAO,MAAM,MAAM,MAAM;AAC5F,MAAI,UAAU,KAAK,SAAS,MAAM,IAAI,EAAE,GAAG,EAAE,QAAQ;AACrD,OAAK;AAAA,IACH,CAAC,IAAI,QAAQ,GAAG;AAAA,IAChB,iCAAiCxB,UAAS,GAAG;AAAA,IAC7C,qCAAqCA,UAAS,GAAG;AAAA,EACnD;AACF,CAAC;AACD,SAAS,WAAWc,OAAM;AACxB,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,UAAU,KAAK,GAAG,GAAG,WAAW,KAAKA,KAAI,GAAG,OAAO,MAAM,MAAM,MAAM,GAAG,SAAS,MAAM,MAAM,MAAM,GAAG,KAAK,UAAU,IAAI,QAAQ,KAAK,MAAM,UAAU,MAAM,MAAM,SAAS;AAC5M,YAAU,UAAU,UAAU,OAAO;AACrC,MAAI,eAAe,UAAU;AAC7B,MAAI,YAAY,SAAS,YAAY,OAAO;AAC1C,cAAU,SAAS,YAAY;AAC/B,aAAS,CAAC;AACV,QAAI,QAAQ,SAAS,KAAK,KAAK;AAC7B,aAAO,KAAK,GAAG;AAAA,IACjB,CAAC;AACD,QAAI,aAAa,SAAS;AACxB,MAAAA,QAAO,MAAM,UAAU,MAAM,KAAK,SAAS;AAAA,IAC7C;AAAA,EACF,OAAO;AACL,aAAS,2BAA2B,GAAG;AACvC,YAAQ,UAAU;AAAA,MAChB,KAAK;AACH,YAAI,UAAU,SAAS,GAAG;AACxB,gBAAM,IAAI,eAAe,cAAc,QAAQ,IAAI;AAAA,QACrD;AACA;AAAA,MACF,KAAK;AACH,YAAI,UAAU,SAAS,GAAG;AACxB,gBAAM,IAAI,eAAe,cAAc,QAAQ,IAAI;AAAA,QACrD;AACA,QAAAA,QAAO,OAAO,KAAKA,KAAI;AACvB;AAAA,MACF;AACE,QAAAA,QAAO,MAAM,UAAU,MAAM,KAAK,SAAS;AAAA,IAC/C;AACA,IAAAA,QAAOA,MAAK,IAAI,SAAS,KAAK;AAC5B,aAAO,OAAO,QAAQ,WAAW,MAAM,OAAO,GAAG;AAAA,IACnD,CAAC;AAAA,EACH;AACA,MAAI,CAACA,MAAK,QAAQ;AAChB,UAAM,IAAI,eAAe,UAAU,iBAAiB,QAAQ,IAAI;AAAA,EAClE;AACA,MAAI,MAAMA,MAAK,QAAQ,MAAM,MAAM,MAAM,KAAK,GAAG,MAAM,MAAM,MAAM,KAAK,GAAG,WAAWA,OAAM,QAAQ,SAAS,MAAM,MAAM,KAAK,IAAI,CAAC,MAAM,SAAS,SAAS;AAC3J,MAAI,CAAC,OAAO,CAAC,KAAK;AAChB,UAAM;AAAA,EACR;AACA,MAAI,KAAK;AACP,SAAK,SAAS,KAAK,SAAS,aAAa;AACvC,aAAO,OAAO,KAAK,SAAS,WAAW;AACrC,eAAO,MAAM,aAAa,SAAS;AAAA,MACrC,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AACA,MAAI,KAAK;AACP,SAAK,SAAS,MAAM,SAAS,aAAa;AACxC,aAAO,OAAO,KAAK,SAAS,WAAW;AACrC,eAAO,MAAM,aAAa,SAAS;AAAA,MACrC,CAAC;AAAA,IACH,CAAC;AACD,QAAI,CAAC,MAAM,MAAM,UAAU,GAAG;AAC5B,WAAK,MAAMA,MAAK,UAAU,OAAO;AAAA,IACnC;AAAA,EACF;AACA,MAAI,MAAM,GAAG;AACX,IAAAA,QAAOA,MAAK,IAAI,SAAS,KAAK;AAC5B,aAAOd,UAAS,GAAG;AAAA,IACrB,CAAC;AACD,QAAI,OAAOc,MAAK,IAAI;AACpB,QAAI,KAAK;AACP,YAAMA,MAAK,KAAK,IAAI,IAAI,WAAW;AAAA,IACrC;AACA,QAAI,KAAK;AACP,YAAMA,MAAK,KAAK,IAAI,IAAI,UAAU;AAAA,IACpC;AAAA,EACF,OAAO;AACL,UAAMd,UAASc,MAAK,CAAC,CAAC;AAAA,EACxB;AACA,SAAO,MAAM,IAAI,UAAU,UAAU;AACrC,SAAO,MAAM,MAAM,UAAU,IAAI,aAAa,WAAW;AACzD,OAAK;AAAA,IACH;AAAA,IACA,yBAAyB,UAAU;AAAA,IACnC,6BAA6B,UAAU;AAAA,IACvC,SAAS,MAAM,CAAC,EAAE,KAAK,gBAAgB;AAAA,IACvC,OAAO,KAAK,gBAAgB;AAAA,IAC5B;AAAA,EACF;AACF;AACA,OAAO,YAAY,YAAY;AAC/B,UAAU,UAAU,QAAQ,UAAU;AACtC,UAAU,UAAU,OAAO,UAAU;AACrC,SAAS,aAAa,WAAW,eAAe,KAAK;AACnD,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,OAAO,MAAM,MAAM,MAAM,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,SAAS,MAAM,MAAM,QAAQ,KAAK;AACjI,MAAI,UAAU,KAAK,SAAS,MAAM,IAAI,EAAE,GAAG,EAAE,UAAU;AACvD,MAAI,UAAU,SAAS,KAAK,OAAO,cAAc,UAAU;AACzD,oBAAgB;AAChB,gBAAY;AAAA,EACd;AACA,MAAI;AACJ,MAAI,iBAAiB;AACrB,MAAI;AACF,QAAI;AAAA,EACN,SAAS,KAAK;AACZ,qBAAiB;AACjB,gBAAY;AAAA,EACd;AACA,MAAI,sBAAsB,cAAc,UAAU,kBAAkB;AACpE,MAAI,oBAAoB,QAAQ,aAAa,aAAa;AAC1D,MAAI,gBAAgB;AACpB,MAAI,oBAAoB;AACxB,MAAI,uBAAuB,CAAC,uBAAuB,CAAC,QAAQ;AAC1D,QAAI,kBAAkB;AACtB,QAAI,qBAAqB,OAAO;AAC9B,wBAAkB;AAAA,IACpB,WAAW,WAAW;AACpB,wBAAkB,oBAAoB,mBAAmB,SAAS;AAAA,IACpE;AACA,QAAI,SAAS;AACb,QAAI,qBAAqB,OAAO;AAC9B,eAAS,UAAU,SAAS;AAAA,IAC9B,WAAW,OAAO,cAAc,UAAU;AACxC,eAAS;AAAA,IACX,WAAW,cAAc,OAAO,cAAc,YAAY,OAAO,cAAc,aAAa;AAC1F,UAAI;AACF,iBAAS,oBAAoB,mBAAmB,SAAS;AAAA,MAC3D,SAAS,MAAM;AAAA,MACf;AAAA,IACF;AACA,SAAK;AAAA,MACH;AAAA,MACA,+BAA+B;AAAA,MAC/B;AAAA,MACA,aAAa,UAAU,SAAS;AAAA,MAChC;AAAA,IACF;AAAA,EACF;AACA,MAAI,aAAa,WAAW;AAC1B,QAAI,qBAAqB,OAAO;AAC9B,UAAI,uBAAuB,oBAAoB;AAAA,QAC7C;AAAA,QACA;AAAA,MACF;AACA,UAAI,yBAAyB,QAAQ;AACnC,YAAI,qBAAqB,QAAQ;AAC/B,0BAAgB;AAAA,QAClB,OAAO;AACL,eAAK;AAAA,YACH;AAAA,YACA;AAAA,YACA,0CAA0C,aAAa,CAAC,SAAS,2BAA2B;AAAA,YAC5F,UAAU,SAAS;AAAA,YACnB,UAAU,SAAS;AAAA,UACrB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,0BAA0B,oBAAoB;AAAA,MAChD;AAAA,MACA;AAAA,IACF;AACA,QAAI,4BAA4B,QAAQ;AACtC,UAAI,qBAAqB,QAAQ;AAC/B,wBAAgB;AAAA,MAClB,OAAO;AACL,aAAK;AAAA,UACH;AAAA,UACA;AAAA,UACA,0CAA0C,YAAY,2BAA2B;AAAA,UACjF,qBAAqB,QAAQ,UAAU,SAAS,IAAI,aAAa,oBAAoB,mBAAmB,SAAS;AAAA,UACjH,qBAAqB,QAAQ,UAAU,SAAS,IAAI,aAAa,oBAAoB,mBAAmB,SAAS;AAAA,QACnH;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,MAAI,aAAa,kBAAkB,UAAU,kBAAkB,MAAM;AACnE,QAAI,cAAc;AAClB,QAAI,UAAU,aAAa,GAAG;AAC5B,oBAAc;AAAA,IAChB;AACA,QAAI,sBAAsB,oBAAoB;AAAA,MAC5C;AAAA,MACA;AAAA,IACF;AACA,QAAI,wBAAwB,QAAQ;AAClC,UAAI,qBAAqB,QAAQ;AAC/B,4BAAoB;AAAA,MACtB,OAAO;AACL,aAAK;AAAA,UACH;AAAA,UACA,qCAAqC,cAAc;AAAA,UACnD,yCAAyC,cAAc;AAAA,UACvD;AAAA,UACA,oBAAoB,WAAW,SAAS;AAAA,QAC1C;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,MAAI,iBAAiB,mBAAmB;AACtC,SAAK;AAAA,MACH;AAAA,MACA;AAAA,MACA,0CAA0C,YAAY,2BAA2B;AAAA,MACjF,qBAAqB,QAAQ,UAAU,SAAS,IAAI,aAAa,oBAAoB,mBAAmB,SAAS;AAAA,MACjH,qBAAqB,QAAQ,UAAU,SAAS,IAAI,aAAa,oBAAoB,mBAAmB,SAAS;AAAA,IACnH;AAAA,EACF;AACA,QAAM,MAAM,UAAU,SAAS;AACjC;AACA,OAAO,cAAc,cAAc;AACnC,UAAU,UAAU,SAAS,YAAY;AACzC,UAAU,UAAU,UAAU,YAAY;AAC1C,UAAU,UAAU,SAAS,YAAY;AACzC,SAAS,UAAU,QAAQ,KAAK;AAC9B,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,SAAS,MAAM,MAAM,QAAQ,GAAG,UAAU,eAAe,OAAO,OAAO,CAAC,SAAS,IAAI,UAAU,MAAM,IAAI,IAAI,MAAM;AACpJ,OAAK;AAAA,IACH,eAAe,OAAO;AAAA,IACtB,oCAAoCd,UAAS,MAAM;AAAA,IACnD,wCAAwCA,UAAS,MAAM;AAAA,EACzD;AACF;AACA,OAAO,WAAW,WAAW;AAC7B,UAAU,UAAU,aAAa,SAAS;AAC1C,UAAU,UAAU,cAAc,SAAS;AAC3C,UAAU,YAAY,UAAU,WAAW;AACzC,QAAM,MAAM,UAAU,IAAI;AAC5B,CAAC;AACD,SAAS,QAAQ,SAAS,KAAK;AAC7B,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ;AAC9B,MAAI,SAAS,QAAQ,GAAG;AACxB,OAAK;AAAA,IACH;AAAA,IACA,iCAAiC,WAAW,OAAO;AAAA,IACnD,oCAAoC,WAAW,OAAO;AAAA,IACtD,MAAM,MAAM,QAAQ,IAAI,QAAQ;AAAA,IAChC;AAAA,EACF;AACF;AACA,OAAO,SAAS,SAAS;AACzB,UAAU,UAAU,WAAW,OAAO;AACtC,UAAU,UAAU,aAAa,OAAO;AACxC,SAAS,QAAQ,UAAU,OAAO,KAAK;AACrC,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,OAAO,MAAM,MAAM,MAAM;AAC5F,MAAI,UAAU,KAAK,SAAS,MAAM,IAAI,EAAE,GAAG;AAC3C,MAAI,UAAU;AACd,MAAI,SAAS,QAAQ;AACnB,UAAM,IAAI;AAAA,MACR,UAAU,GAAG,OAAO,KAAK,OAAO,KAAK;AAAA,MACrC;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,MAAI,UAAU,OAAO,SAAS,MAAM,IAAI,EAAE,GAAG;AAC7C,YAAU;AACV,MAAI,YAAY,QAAQ;AACtB,UAAM,IAAI;AAAA,MACR,UAAU,GAAG,OAAO,KAAK,OAAO,KAAK;AAAA,MACrC;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,MAAI,UAAU,UAAU,SAAS,MAAM,IAAI,EAAE,GAAG;AAChD,QAAM,MAAsB,uBAAO,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,GAAG,KAAK;AAC/D,QAAM,QAAwB,uBAAO,CAAC,WAAW,WAAW,WAAW,MAAM,EAAE,YAAY,EAAE,CAAC,GAAG,OAAO;AACxG,OAAK;AAAA,IACH,MAAM,IAAI,MAAM,QAAQ,CAAC,KAAK;AAAA,IAC9B,qCAAqC,WAAW,UAAU;AAAA,IAC1D,yCAAyC,WAAW,UAAU;AAAA,EAChE;AACF;AACA,OAAO,SAAS,SAAS;AACzB,UAAU,UAAU,WAAW,OAAO;AACtC,UAAU,UAAU,iBAAiB,OAAO;AAC5C,SAAS,WAAW,SAAS,WAAW,KAAK,UAAU,SAAS;AAC9D,MAAI,WAAW,MAAM,KAAK,SAAS;AACnC,MAAI,SAAS,MAAM,KAAK,OAAO;AAC/B,MAAI,CAAC,UAAU;AACb,QAAI,OAAO,WAAW,SAAS,OAAQ,QAAO;AAC9C,eAAW,SAAS,MAAM;AAAA,EAC5B;AACA,SAAO,OAAO,MAAM,SAAS,MAAM,KAAK;AACtC,QAAI,QAAS,QAAO,MAAM,IAAI,MAAM,SAAS,GAAG,CAAC,IAAI,SAAS,SAAS,GAAG;AAC1E,QAAI,CAAC,KAAK;AACR,UAAI,WAAW,SAAS,QAAQ,IAAI;AACpC,UAAI,aAAa,GAAI,QAAO;AAC5B,UAAI,CAAC,SAAU,UAAS,OAAO,UAAU,CAAC;AAC1C,aAAO;AAAA,IACT;AACA,WAAO,SAAS,KAAK,SAAS,OAAO,UAAU;AAC7C,UAAI,CAAC,IAAI,MAAM,KAAK,EAAG,QAAO;AAC9B,UAAI,CAAC,SAAU,UAAS,OAAO,UAAU,CAAC;AAC1C,aAAO;AAAA,IACT,CAAC;AAAA,EACH,CAAC;AACH;AACA,OAAO,YAAY,YAAY;AAC/B,UAAU,UAAU,WAAW,SAAS,QAAQ,KAAK;AACnD,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,OAAO,MAAM,MAAM,MAAM;AAC5F,MAAI,UAAU,KAAK,SAAS,MAAM,IAAI,EAAE,GAAG,GAAG;AAC9C,MAAI,UAAU,QAAQ,SAAS,MAAM,IAAI,EAAE,GAAG,GAAG;AACjD,MAAI,WAAW,MAAM,MAAM,UAAU;AACrC,MAAI,UAAU,MAAM,MAAM,SAAS;AACnC,MAAI,SAAS,SAAS;AACtB,MAAI,UAAU;AACZ,cAAU,UAAU,wBAAwB;AAC5C,cAAU,4BAA4B,UAAU;AAChD,oBAAgB,gCAAgC,UAAU;AAAA,EAC5D,OAAO;AACL,cAAU,UAAU,oBAAoB;AACxC,cAAU,uCAAuC,UAAU;AAC3D,oBAAgB,2CAA2C,UAAU;AAAA,EACvE;AACA,MAAI,MAAM,MAAM,MAAM,MAAM,IAAI,MAAM,MAAM,KAAK,IAAI;AACrD,OAAK;AAAA,IACH,WAAW,QAAQ,KAAK,KAAK,UAAU,OAAO;AAAA,IAC9C;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF,CAAC;AACD,UAAU,YAAY,YAAY,SAAS,KAAK;AAC9C,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,MAAM,MAAM,MAAM,QAAQ;AAC9B,OAAK;AAAA,IACH,OAAO,UAAU,IAAI,OAAO,QAAQ;AAAA,IACpC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF,CAAC;AACD,SAAS,MAAM,MAAM,KAAK;AACxB,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,WAAW,MAAM,MAAM,QAAQ,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,OAAO,MAAM,MAAM,MAAM,GAAG,WAAW,MAAM,MAAM,UAAU,GAAG,SAAS,MAAM,MAAM,MAAM,GAAG,MAAM,MAAM,MAAM,KAAK;AAC7L,MAAI,UAAU,MAAM,SAAS,MAAM,IAAI,EAAE,GAAG,GAAG,GAAG,OAAO;AACzD,MAAI,UAAU;AACZ,SAAK;AAAA,MACH,KAAK,KAAK,SAAS,aAAa;AAC9B,eAAO,SAAS,QAAQ,WAAW,IAAI;AAAA,MACzC,CAAC;AAAA,MACD;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF,OAAO;AACL,QAAI,QAAQ;AACV,WAAK;AAAA,QACH,KAAK,KAAK,SAAS,aAAa;AAC9B,iBAAO,IAAI,UAAU,WAAW;AAAA,QAClC,CAAC;AAAA,QACD;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,OAAO;AACL,WAAK;AAAA,QACH,KAAK,QAAQ,QAAQ,IAAI;AAAA,QACzB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AACA,OAAO,OAAO,OAAO;AACrB,UAAU,UAAU,SAAS,KAAK;AAClC,SAAS,cAAc,SAAS,MAAM,KAAK;AACzC,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAIiB,MAAK,MAAM,MAAM,QAAQ,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,OAAO,MAAM,MAAM,MAAM;AAC3F,MAAI,UAAUA,KAAI,SAAS,MAAM,IAAI,EAAE,GAAG,EAAE,UAAU;AACtD,MAAI;AACJ,MAAI,CAAC,MAAM;AACT,QAAI,UAAU,SAAS,SAAS,MAAM,IAAI,EAAE,GAAG,EAAE,UAAU;AAC3D,cAAU,QAAQ;AAAA,EACpB,OAAO;AACL,QAAI,UAAU,SAAS,SAAS,MAAM,IAAI,EAAE,GAAG,KAAK,SAAS,IAAI;AACjE,cAAU,QAAQ,IAAI;AAAA,EACxB;AACA,EAAAA,IAAG;AACH,MAAI,QAAQ,SAAS,UAAU,SAAS,OAAO,QAAQ,IAAI,QAAQ,IAAI;AACvE,MAAI,SAAS,SAAS,UAAU,SAAS,OAAO,UAAU,MAAM;AAChE,QAAM,MAAM,eAAe,MAAM;AACjC,QAAM,MAAM,qBAAqB,OAAO;AACxC,QAAM,MAAM,mBAAmB,KAAK;AACpC,QAAM,MAAM,iBAAiB,QAAQ;AACrC,QAAM,MAAM,aAAa,UAAU,OAAO;AAC1C,OAAK;AAAA,IACH,YAAY;AAAA,IACZ,cAAc,SAAS;AAAA,IACvB,cAAc,SAAS;AAAA,EACzB;AACF;AACA,OAAO,eAAe,eAAe;AACrC,UAAU,UAAU,UAAU,aAAa;AAC3C,UAAU,UAAU,WAAW,aAAa;AAC5C,SAAS,gBAAgB,SAAS,MAAM,KAAK;AAC3C,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAIA,MAAK,MAAM,MAAM,QAAQ,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,OAAO,MAAM,MAAM,MAAM;AAC3F,MAAI,UAAUA,KAAI,SAAS,MAAM,IAAI,EAAE,GAAG,EAAE,UAAU;AACtD,MAAI;AACJ,MAAI,CAAC,MAAM;AACT,QAAI,UAAU,SAAS,SAAS,MAAM,IAAI,EAAE,GAAG,EAAE,UAAU;AAC3D,cAAU,QAAQ;AAAA,EACpB,OAAO;AACL,QAAI,UAAU,SAAS,SAAS,MAAM,IAAI,EAAE,GAAG,KAAK,SAAS,IAAI;AACjE,cAAU,QAAQ,IAAI;AAAA,EACxB;AACA,MAAI,UAAU,SAAS,SAAS,MAAM,IAAI,EAAE,GAAG,EAAE,QAAQ;AACzD,EAAAA,IAAG;AACH,MAAI,QAAQ,SAAS,UAAU,SAAS,OAAO,QAAQ,IAAI,QAAQ,IAAI;AACvE,MAAI,SAAS,SAAS,UAAU,SAAS,OAAO,UAAU,MAAM;AAChE,QAAM,MAAM,eAAe,MAAM;AACjC,QAAM,MAAM,qBAAqB,OAAO;AACxC,QAAM,MAAM,mBAAmB,KAAK;AACpC,QAAM,MAAM,iBAAiB,UAAU;AACvC,QAAM,MAAM,aAAa,QAAQ,OAAO;AACxC,OAAK;AAAA,IACH,QAAQ,UAAU;AAAA,IAClB,cAAc,SAAS;AAAA,IACvB,cAAc,SAAS;AAAA,EACzB;AACF;AACA,OAAO,iBAAiB,iBAAiB;AACzC,UAAU,UAAU,YAAY,eAAe;AAC/C,UAAU,UAAU,aAAa,eAAe;AAChD,SAAS,gBAAgB,SAAS,MAAM,KAAK;AAC3C,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAIA,MAAK,MAAM,MAAM,QAAQ,GAAG,UAAU,MAAM,MAAM,SAAS,GAAG,OAAO,MAAM,MAAM,MAAM;AAC3F,MAAI,UAAUA,KAAI,SAAS,MAAM,IAAI,EAAE,GAAG,EAAE,UAAU;AACtD,MAAI;AACJ,MAAI,CAAC,MAAM;AACT,QAAI,UAAU,SAAS,SAAS,MAAM,IAAI,EAAE,GAAG,EAAE,UAAU;AAC3D,cAAU,QAAQ;AAAA,EACpB,OAAO;AACL,QAAI,UAAU,SAAS,SAAS,MAAM,IAAI,EAAE,GAAG,KAAK,SAAS,IAAI;AACjE,cAAU,QAAQ,IAAI;AAAA,EACxB;AACA,MAAI,UAAU,SAAS,SAAS,MAAM,IAAI,EAAE,GAAG,EAAE,QAAQ;AACzD,EAAAA,IAAG;AACH,MAAI,QAAQ,SAAS,UAAU,SAAS,OAAO,QAAQ,IAAI,QAAQ,IAAI;AACvE,MAAI,SAAS,SAAS,UAAU,SAAS,OAAO,UAAU,MAAM;AAChE,QAAM,MAAM,eAAe,MAAM;AACjC,QAAM,MAAM,qBAAqB,OAAO;AACxC,QAAM,MAAM,mBAAmB,KAAK;AACpC,QAAM,MAAM,iBAAiB,UAAU;AACvC,QAAM,MAAM,aAAa,UAAU,KAAK;AACxC,OAAK;AAAA,IACH,QAAQ,UAAU;AAAA,IAClB,cAAc,SAAS;AAAA,IACvB,cAAc,SAAS;AAAA,EACzB;AACF;AACA,OAAO,iBAAiB,iBAAiB;AACzC,UAAU,UAAU,YAAY,eAAe;AAC/C,UAAU,UAAU,aAAa,eAAe;AAChD,SAAS,YAAY,OAAO,KAAK;AAC/B,MAAI,IAAK,OAAM,MAAM,WAAW,GAAG;AACnC,MAAI,SAAS,MAAM,MAAM,aAAa;AACtC,MAAI,UAAU,MAAM,MAAM,mBAAmB;AAC7C,MAAI,QAAQ,MAAM,MAAM,iBAAiB;AACzC,MAAI,WAAW,MAAM,MAAM,eAAe;AAC1C,MAAI,YAAY,MAAM,MAAM,WAAW;AACvC,MAAI;AACJ,MAAI,aAAa,UAAU;AACzB,iBAAa,KAAK,IAAI,QAAQ,OAAO,MAAM,KAAK,IAAI,KAAK;AAAA,EAC3D,OAAO;AACL,iBAAa,cAAc,KAAK,IAAI,KAAK;AAAA,EAC3C;AACA,OAAK;AAAA,IACH;AAAA,IACA,cAAc,SAAS,SAAS,WAAW,SAAS;AAAA,IACpD,cAAc,SAAS,aAAa,WAAW,SAAS;AAAA,EAC1D;AACF;AACA,OAAO,aAAa,aAAa;AACjC,UAAU,UAAU,MAAM,WAAW;AACrC,UAAU,YAAY,cAAc,WAAW;AAC7C,MAAI,MAAM,MAAM,MAAM,QAAQ;AAC9B,MAAI,eAAe,QAAQ,OAAO,GAAG,KAAK,OAAO,aAAa,GAAG;AACjE,OAAK;AAAA,IACH;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF,CAAC;AACD,UAAU,YAAY,UAAU,WAAW;AACzC,MAAI,MAAM,MAAM,MAAM,QAAQ;AAC9B,MAAI,WAAW,QAAQ,OAAO,GAAG,IAAI,OAAO,SAAS,GAAG,IAAI;AAC5D,OAAK;AAAA,IACH;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF,CAAC;AACD,UAAU,YAAY,UAAU,WAAW;AACzC,MAAI,MAAM,MAAM,MAAM,QAAQ;AAC9B,MAAI,WAAW,QAAQ,OAAO,GAAG,IAAI,OAAO,SAAS,GAAG,IAAI;AAC5D,OAAK;AAAA,IACH;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF,CAAC;AACD,UAAU,YAAY,UAAU,SAAS,MAAM;AAC7C,MAAI,MAAM,MAAM,MAAM,QAAQ;AAC9B,OAAK;AAAA,IACH,OAAO,QAAQ,YAAY,SAAS,GAAG;AAAA,IACvC;AAAA,IACA;AAAA,EACF;AACF,CAAC;AACD,SAAS,cAAc,UAAU,QAAQ;AACvC,MAAI,aAAa,QAAQ;AACvB,WAAO;AAAA,EACT;AACA,MAAI,OAAO,WAAW,OAAO,UAAU;AACrC,WAAO;AAAA,EACT;AACA,MAAI,OAAO,aAAa,YAAY,aAAa,MAAM;AACrD,WAAO,aAAa;AAAA,EACtB;AACA,MAAI,CAAC,QAAQ;AACX,WAAO;AAAA,EACT;AACA,MAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,QAAI,CAAC,MAAM,QAAQ,MAAM,GAAG;AAC1B,aAAO;AAAA,IACT;AACA,WAAO,SAAS,MAAM,SAAS,KAAK;AAClC,aAAO,OAAO,KAAK,SAAS,KAAK;AAC/B,eAAO,cAAc,KAAK,GAAG;AAAA,MAC/B,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AACA,MAAI,oBAAoB,MAAM;AAC5B,QAAI,kBAAkB,MAAM;AAC1B,aAAO,SAAS,QAAQ,MAAM,OAAO,QAAQ;AAAA,IAC/C,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO,OAAO,KAAK,QAAQ,EAAE,MAAM,SAAS,KAAK;AAC/C,QAAI,gBAAgB,SAAS,GAAG;AAChC,QAAI,cAAc,OAAO,GAAG;AAC5B,QAAI,OAAO,kBAAkB,YAAY,kBAAkB,QAAQ,gBAAgB,MAAM;AACvF,aAAO,cAAc,eAAe,WAAW;AAAA,IACjD;AACA,QAAI,OAAO,kBAAkB,YAAY;AACvC,aAAO,cAAc,WAAW;AAAA,IAClC;AACA,WAAO,gBAAgB;AAAA,EACzB,CAAC;AACH;AACA,OAAO,eAAe,eAAe;AACrC,UAAU,UAAU,iBAAiB,SAAS,UAAU;AACtD,QAAM,SAAS,KAAK,MAAM,QAAQ;AAClC,QAAM,WAAW,OAAO;AACxB,OAAK;AAAA,IACH,cAAc,UAAU,MAAM;AAAA,IAC9B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF,CAAC;AAGD,SAAS,OAAO,KAAK,SAAS;AAC5B,SAAO,IAAI,UAAU,KAAK,OAAO;AACnC;AACA,OAAO,QAAQ,QAAQ;AACvB,OAAO,OAAO,SAAS,QAAQ,UAAU,SAAS,UAAU;AAC1D,MAAI,UAAU,SAAS,GAAG;AACxB,cAAU;AACV,aAAS;AAAA,EACX;AACA,YAAU,WAAW;AACrB,QAAM,IAAI;AAAA,IACR;AAAA,IACA;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,IACA,OAAO;AAAA,EACT;AACF;AAGA,IAAI,iBAAiB,CAAC;AACtB,SAAS,gBAAgB;AAAA,EACvB,QAAQ,MAAM;AAAA,EACd,QAAQ,MAAM;AAChB,CAAC;AACD,SAAS,aAAa;AACpB,WAAS,eAAe;AACtB,QAAI,gBAAgB,UAAU,gBAAgB,UAAU,gBAAgB,WAAW,OAAO,WAAW,cAAc,gBAAgB,UAAU,OAAO,WAAW,cAAc,gBAAgB,QAAQ;AACnM,aAAO,IAAI,UAAU,KAAK,QAAQ,GAAG,MAAM,YAAY;AAAA,IACzD;AACA,WAAO,IAAI,UAAU,MAAM,MAAM,YAAY;AAAA,EAC/C;AACA,SAAO,cAAc,cAAc;AACnC,WAAS,aAAa,OAAO;AAC3B,WAAO,eAAe,MAAM,UAAU;AAAA,MACpC;AAAA,MACA,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AACA,SAAO,cAAc,cAAc;AACnC,SAAO,eAAe,OAAO,WAAW,UAAU;AAAA,IAChD,KAAK;AAAA,IACL,KAAK;AAAA,IACL,cAAc;AAAA,EAChB,CAAC;AACD,MAAIQ,WAAU,CAAC;AACf,EAAAA,SAAQ,OAAO,SAAS,QAAQ,UAAU,SAAS,UAAU;AAC3D,QAAI,UAAU,SAAS,GAAG;AACxB,gBAAU;AACV,eAAS;AAAA,IACX;AACA,cAAU,WAAW;AACrB,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,MACAA,SAAQ;AAAA,IACV;AAAA,EACF;AACA,EAAAA,SAAQ,QAAQ,SAAS,QAAQ,UAAU,SAAS;AAClD,QAAI,UAAU,QAAQ,OAAO,EAAE,GAAG,MAAM,QAAQ;AAAA,EAClD;AACA,EAAAA,SAAQ,QAAQ,SAASR,KAAI,MAAM,MAAM,KAAK;AAC5C,QAAI,UAAUA,KAAI,GAAG,EAAE,GAAG,MAAM,MAAM,IAAI;AAAA,EAC5C;AACA,EAAAQ,SAAQ,QAAQ,SAAS,KAAK,KAAK;AACjC,QAAI,UAAU,KAAK,GAAG,EAAE,GAAG;AAAA,EAC7B;AACA,EAAAA,SAAQ,MAAM,CAAC;AACf,EAAAA,SAAQ,IAAI,QAAQ,SAAS,QAAQ,UAAU,KAAK;AAClD,QAAI,UAAU,QAAQ,GAAG,EAAE,GAAG,IAAI,MAAM,QAAQ;AAAA,EAClD;AACA,EAAAA,SAAQ,IAAI,QAAQ,SAASR,KAAI,MAAM,MAAM,KAAK;AAChD,QAAI,UAAUA,KAAI,GAAG,EAAE,GAAG,IAAI,MAAM,MAAM,IAAI;AAAA,EAChD;AACA,EAAAQ,SAAQ,IAAI,QAAQ,SAAS,KAAK,KAAK;AACrC,QAAI,UAAU,KAAK,GAAG,EAAE,GAAG,IAAI;AAAA,EACjC;AACA,EAAAA,SAAQ,OAAO,IAAIA,SAAQ,OAAO;AAClC,EAAAA,SAAQ,IAAI,OAAO,IAAIA,SAAQ,IAAI,OAAO;AAC1C,SAAOA;AACT;AACA,OAAO,YAAY,YAAY;AAC/B,IAAI,SAAS;AACb,IAAI,SAAS;AAGb,SAASC,QAAO,SAAS,QAAQ;AAC/B,MAAIC,SAAQ,IAAI,UAAU,MAAM,MAAMD,SAAQ,IAAI;AAClD,EAAAC,OAAM,OAAO,SAAS,QAAQ,kCAAkC;AAClE;AACA,OAAOD,SAAQ,QAAQ;AACvBA,QAAO,OAAO,SAAS,QAAQ,UAAU,SAAS,UAAU;AAC1D,MAAI,UAAU,SAAS,GAAG;AACxB,cAAU;AACV,aAAS;AAAA,EACX;AACA,YAAU,WAAW;AACrB,QAAM,IAAI;AAAA,IACR;AAAA,IACA;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,IACAA,QAAO;AAAA,EACT;AACF;AACAA,QAAO,OAAO,SAAS,KAAK,KAAK;AAC/B,MAAI,UAAU,KAAK,KAAKA,QAAO,MAAM,IAAI,EAAE,GAAG;AAChD;AACAA,QAAO,UAAU,SAAS,KAAK,KAAK;AAClC,MAAI,UAAU,KAAK,KAAKA,QAAO,SAAS,IAAI,EAAE,GAAG,IAAI;AACvD;AACAA,QAAO,QAAQ,SAAS,KAAK,KAAK,KAAK;AACrC,MAAIC,SAAQ,IAAI,UAAU,KAAK,KAAKD,QAAO,OAAO,IAAI;AACtD,EAAAC,OAAM;AAAA,IACJ,OAAO,KAAKA,QAAO,QAAQ;AAAA,IAC3B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AACAD,QAAO,WAAW,SAAS,KAAK,KAAK,KAAK;AACxC,MAAIC,SAAQ,IAAI,UAAU,KAAK,KAAKD,QAAO,UAAU,IAAI;AACzD,EAAAC,OAAM;AAAA,IACJ,OAAO,KAAKA,QAAO,QAAQ;AAAA,IAC3B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AACAD,QAAO,cAAc,SAAS,KAAK,KAAK,KAAK;AAC3C,MAAI,UAAU,KAAK,KAAKA,QAAO,aAAa,IAAI,EAAE,GAAG,MAAM,GAAG;AAChE;AACAA,QAAO,iBAAiB,SAAS,KAAK,KAAK,KAAK;AAC9C,MAAI,UAAU,KAAK,KAAKA,QAAO,gBAAgB,IAAI,EAAE,GAAG,IAAI,MAAM,GAAG;AACvE;AACAA,QAAO,YAAYA,QAAO,kBAAkB,SAAS,KAAK,KAAK,KAAK;AAClE,MAAI,UAAU,KAAK,KAAKA,QAAO,WAAW,IAAI,EAAE,GAAG,IAAI,GAAG;AAC5D;AACAA,QAAO,eAAe,SAAS,KAAK,KAAK,KAAK;AAC5C,MAAI,UAAU,KAAK,KAAKA,QAAO,cAAc,IAAI,EAAE,GAAG,IAAI,IAAI,GAAG;AACnE;AACAA,QAAO,UAAU,SAAS,KAAK,KAAK,KAAK;AACvC,MAAI,UAAU,KAAK,KAAKA,QAAO,SAAS,IAAI,EAAE,GAAG,GAAG,MAAM,GAAG;AAC/D;AACAA,QAAO,YAAY,SAAS,KAAK,OAAO,KAAK;AAC3C,MAAI,UAAU,KAAK,KAAKA,QAAO,WAAW,IAAI,EAAE,GAAG,GAAG,MAAM,KAAK;AACnE;AACAA,QAAO,UAAU,SAAS,KAAK,KAAK,KAAK;AACvC,MAAI,UAAU,KAAK,KAAKA,QAAO,SAAS,IAAI,EAAE,GAAG,GAAG,MAAM,GAAG;AAC/D;AACAA,QAAO,WAAW,SAAS,KAAK,OAAO,KAAK;AAC1C,MAAI,UAAU,KAAK,KAAKA,QAAO,UAAU,IAAI,EAAE,GAAG,GAAG,KAAK,KAAK;AACjE;AACAA,QAAO,SAAS,SAAS,KAAK,KAAK;AACjC,MAAI,UAAU,KAAK,KAAKA,QAAO,QAAQ,IAAI,EAAE,GAAG,MAAM;AACxD;AACAA,QAAO,YAAY,SAAS,KAAK,KAAK;AACpC,MAAI,UAAU,KAAK,KAAKA,QAAO,WAAW,IAAI,EAAE,GAAG,IAAI,MAAM,IAAI;AACnE;AACAA,QAAO,UAAU,SAAS,KAAK,KAAK;AAClC,MAAI,UAAU,KAAK,KAAKA,QAAO,SAAS,IAAI,EAAE,GAAG,OAAO;AAC1D;AACAA,QAAO,aAAa,SAAS,KAAK,KAAK;AACrC,MAAI,UAAU,KAAK,KAAKA,QAAO,YAAY,IAAI,EAAE,GAAG,IAAI,MAAM,KAAK;AACrE;AACAA,QAAO,SAAS,SAAS,KAAK,KAAK;AACjC,MAAI,UAAU,KAAK,KAAKA,QAAO,QAAQ,IAAI,EAAE,GAAG,MAAM,IAAI;AAC5D;AACAA,QAAO,YAAY,SAAS,KAAK,KAAK;AACpC,MAAI,UAAU,KAAK,KAAKA,QAAO,WAAW,IAAI,EAAE,GAAG,IAAI,MAAM,IAAI;AACnE;AACAA,QAAO,QAAQ,SAAS,KAAK,KAAK;AAChC,MAAI,UAAU,KAAK,KAAKA,QAAO,OAAO,IAAI,EAAE,GAAG,GAAG;AACpD;AACAA,QAAO,WAAW,SAAS,OAAO,SAAS;AACzC,MAAI,UAAU,OAAO,SAASA,QAAO,UAAU,IAAI,EAAE,IAAI,GAAG,GAAG;AACjE;AACAA,QAAO,SAAS,SAAS,KAAK,KAAK;AACjC,MAAI,UAAU,KAAK,KAAKA,QAAO,QAAQ,IAAI,EAAE,GAAG;AAClD;AACAA,QAAO,YAAY,SAAS,KAAK,KAAK;AACpC,MAAI,UAAU,KAAK,KAAKA,QAAO,WAAW,IAAI,EAAE,GAAG,IAAI;AACzD;AACAA,QAAO,cAAc,SAAS,KAAK,KAAK;AACtC,MAAI,UAAU,KAAK,KAAKA,QAAO,aAAa,IAAI,EAAE,GAAG,MAAM,MAAM;AACnE;AACAA,QAAO,YAAY,SAAS,KAAK,KAAK;AACpC,MAAI,UAAU,KAAK,KAAKA,QAAO,WAAW,IAAI,EAAE,GAAG,IAAI,MAAM,MAAM;AACrE;AACAA,QAAO,aAAa,SAAS,OAAO,SAAS;AAC3C,MAAI,UAAU,OAAO,SAASA,QAAO,YAAY,IAAI,EAAE,GAAG;AAC5D;AACAA,QAAO,gBAAgB,SAAS,OAAO,SAAS;AAC9C,MAAI,UAAU,OAAO,SAASA,QAAO,eAAe,IAAI,EAAE,GAAG,IAAI;AACnE;AACAA,QAAO,WAAW,SAAS,KAAK,KAAK;AACnC,MAAI,UAAU,KAAK,KAAKA,QAAO,UAAU,IAAI,EAAE,GAAG,GAAG,EAAE,QAAQ;AACjE;AACAA,QAAO,cAAc,SAAS,KAAK,KAAK;AACtC,MAAI,UAAU,KAAK,KAAKA,QAAO,aAAa,IAAI,EAAE,GAAG,IAAI,GAAG,EAAE,QAAQ;AACxE;AACAA,QAAO,UAAU,SAAS,KAAK,KAAK;AAClC,MAAI,UAAU,KAAK,KAAKA,QAAO,SAAS,IAAI,EAAE,GAAG,GAAG,GAAG,OAAO;AAChE;AACAA,QAAO,aAAa,SAAS,KAAK,KAAK;AACrC,MAAI,UAAU,KAAK,KAAKA,QAAO,YAAY,IAAI,EAAE,GAAG,IAAI,GAAG,GAAG,OAAO;AACvE;AACAA,QAAO,WAAW,SAAS,KAAK,KAAK;AACnC,MAAI,UAAU,KAAK,KAAKA,QAAO,UAAU,IAAI,EAAE,GAAG,GAAG,EAAE,QAAQ;AACjE;AACAA,QAAO,cAAc,SAAS,KAAK,KAAK;AACtC,MAAI,UAAU,KAAK,KAAKA,QAAO,aAAa,IAAI,EAAE,GAAG,IAAI,GAAG,EAAE,QAAQ;AACxE;AACAA,QAAO,WAAW,SAAS,KAAK,KAAK;AACnC,MAAI,UAAU,KAAK,KAAKA,QAAO,UAAU,IAAI,EAAE,GAAG,GAAG,EAAE,QAAQ;AACjE;AACAA,QAAO,cAAc,SAAS,KAAK,KAAK;AACtC,MAAI,UAAU,KAAK,KAAKA,QAAO,aAAa,IAAI,EAAE,GAAG,IAAI,GAAG,EAAE,QAAQ;AACxE;AACAA,QAAO,YAAY,SAAS,KAAK,KAAK;AACpC,MAAI,UAAU,KAAK,KAAKA,QAAO,WAAW,IAAI,EAAE,GAAG;AACrD;AACAA,QAAO,eAAe,SAAS,KAAK,KAAK;AACvC,MAAI,UAAU,KAAK,KAAKA,QAAO,cAAc,IAAI,EAAE,GAAG,IAAI;AAC5D;AACAA,QAAO,WAAW,SAAS,KAAK,KAAK;AACnC,MAAI,UAAU,KAAK,KAAKA,QAAO,UAAU,IAAI,EAAE,GAAG,GAAG;AACvD;AACAA,QAAO,YAAY,SAAS,KAAK,KAAK;AACpC,MAAI,UAAU,KAAK,KAAKA,QAAO,WAAW,IAAI,EAAE,GAAG,GAAG,EAAE,SAAS;AACnE;AACAA,QAAO,eAAe,SAAS,KAAK,KAAK;AACvC,MAAI,UAAU,KAAK,KAAKA,QAAO,cAAc,IAAI,EAAE,GAAG,IAAI,GAAG,EAAE,SAAS;AAC1E;AACAA,QAAO,SAAS,SAAS,KAAK,OAAO,KAAK;AACxC,MAAI,UAAU,KAAK,KAAKA,QAAO,QAAQ,IAAI,EAAE,GAAG,GAAG,EAAE,KAAK;AAC5D;AACAA,QAAO,YAAY,SAAS,OAAO,OAAO,SAAS;AACjD,MAAI,UAAU,OAAO,SAASA,QAAO,WAAW,IAAI,EAAE,GAAG,IAAI,GAAG,EAAE,KAAK;AACzE;AACAA,QAAO,aAAa,SAAS,KAAK,OAAO,KAAK;AAC5C,MAAI,UAAU,KAAK,KAAKA,QAAO,YAAY,IAAI,EAAE,GAAG,GAAG,WAAW,KAAK;AACzE;AACAA,QAAO,gBAAgB,SAAS,KAAK,OAAO,KAAK;AAC/C,MAAI,UAAU,KAAK,KAAKA,QAAO,eAAe,IAAI,EAAE,GAAG,IAAI,GAAG;AAAA,IAC5D;AAAA,EACF;AACF;AACAA,QAAO,UAAU,SAAS,KAAK,KAAK,KAAK;AACvC,MAAI,UAAU,KAAK,KAAKA,QAAO,SAAS,IAAI,EAAE,QAAQ,GAAG;AAC3D;AACAA,QAAO,aAAa,SAAS,KAAK,KAAK,KAAK;AAC1C,MAAI,UAAU,KAAK,KAAKA,QAAO,YAAY,IAAI,EAAE,IAAI,QAAQ,GAAG;AAClE;AACAA,QAAO,cAAc,SAAS,KAAK,KAAK,KAAK;AAC3C,MAAI,UAAU,KAAK,KAAKA,QAAO,aAAa,IAAI,EAAE,KAAK,QAAQ,GAAG;AACpE;AACAA,QAAO,iBAAiB,SAAS,KAAK,KAAK,KAAK;AAC9C,MAAI,UAAU,KAAK,KAAKA,QAAO,gBAAgB,IAAI,EAAE,IAAI,KAAK,QAAQ,GAAG;AAC3E;AACAA,QAAO,gBAAgB,SAAS,KAAK,KAAK,KAAK;AAC7C,MAAI,UAAU,KAAK,KAAKA,QAAO,eAAe,IAAI,EAAE,OAAO,QAAQ,GAAG;AACxE;AACAA,QAAO,mBAAmB,SAAS,KAAK,KAAK,KAAK;AAChD,MAAI,UAAU,KAAK,KAAKA,QAAO,kBAAkB,IAAI,EAAE,IAAI,OAAO;AAAA,IAChE;AAAA,EACF;AACF;AACAA,QAAO,oBAAoB,SAAS,KAAK,KAAK,KAAK;AACjD,MAAI,UAAU,KAAK,KAAKA,QAAO,mBAAmB,IAAI,EAAE,KAAK,OAAO;AAAA,IAClE;AAAA,EACF;AACF;AACAA,QAAO,uBAAuB,SAAS,KAAK,KAAK,KAAK;AACpD,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,IAAI,KAAK,OAAO,QAAQ,GAAG;AAC/B;AACAA,QAAO,aAAa,SAAS,KAAK,KAAK,KAAK;AAC1C,MAAI,UAAU,KAAK,KAAKA,QAAO,YAAY,IAAI,EAAE,IAAI,QAAQ,GAAG;AAClE;AACAA,QAAO,gBAAgB,SAAS,KAAK,KAAK,KAAK;AAC7C,MAAI,UAAU,KAAK,KAAKA,QAAO,eAAe,IAAI,EAAE,IAAI,IAAI,QAAQ,GAAG;AACzE;AACAA,QAAO,iBAAiB,SAAS,KAAK,KAAK,KAAK;AAC9C,MAAI,UAAU,KAAK,KAAKA,QAAO,gBAAgB,IAAI,EAAE,KAAK,IAAI,QAAQ,GAAG;AAC3E;AACAA,QAAO,oBAAoB,SAAS,KAAK,KAAK,KAAK;AACjD,MAAI,UAAU,KAAK,KAAKA,QAAO,mBAAmB,IAAI,EAAE,IAAI,KAAK,IAAI;AAAA,IACnE;AAAA,EACF;AACF;AACAA,QAAO,QAAQ,SAAS,KAAK,IAAI,KAAK;AACpC,MAAI,UAAU,KAAK,KAAKA,QAAO,OAAO,IAAI,EAAE,GAAG,MAAM,EAAE;AACzD;AACAA,QAAO,WAAW,SAAS,KAAK,IAAI,KAAK;AACvC,MAAI,UAAU,KAAK,KAAKA,QAAO,UAAU,IAAI,EAAE,GAAG,IAAI,MAAM,EAAE;AAChE;AACAA,QAAO,WAAW,SAAS,KAAK,MAAM,KAAK;AACzC,MAAI,UAAU,KAAK,KAAKA,QAAO,UAAU,IAAI,EAAE,GAAG,KAAK,SAAS,IAAI;AACtE;AACAA,QAAO,cAAc,SAAS,KAAK,MAAM,KAAK;AAC5C,MAAI,UAAU,KAAK,KAAKA,QAAO,aAAa,IAAI,EAAE,GAAG,IAAI,KAAK,SAAS,IAAI;AAC7E;AACAA,QAAO,cAAc,SAAS,KAAK,MAAM,KAAK,KAAK;AACjD,MAAI,UAAU,KAAK,KAAKA,QAAO,aAAa,IAAI,EAAE,GAAG,KAAK,SAAS,MAAM,GAAG;AAC9E;AACAA,QAAO,iBAAiB,SAAS,KAAK,MAAM,KAAK,KAAK;AACpD,MAAI,UAAU,KAAK,KAAKA,QAAO,gBAAgB,IAAI,EAAE,GAAG,IAAI,KAAK;AAAA,IAC/D;AAAA,IACA;AAAA,EACF;AACF;AACAA,QAAO,kBAAkB,SAAS,KAAK,MAAM,KAAK,KAAK;AACrD,MAAI,UAAU,KAAK,KAAKA,QAAO,iBAAiB,IAAI,EAAE,GAAG,KAAK,KAAK;AAAA,IACjE;AAAA,IACA;AAAA,EACF;AACF;AACAA,QAAO,qBAAqB,SAAS,KAAK,MAAM,KAAK,KAAK;AACxD,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,KAAK,KAAK,SAAS,MAAM,GAAG;AACvC;AACAA,QAAO,cAAc,SAAS,KAAK,MAAM,KAAK;AAC5C,MAAI,UAAU,KAAK,KAAKA,QAAO,aAAa,IAAI,EAAE,GAAG,KAAK,IAAI,SAAS,IAAI;AAC7E;AACAA,QAAO,iBAAiB,SAAS,KAAK,MAAM,KAAK;AAC/C,MAAI,UAAU,KAAK,KAAKA,QAAO,gBAAgB,IAAI,EAAE,GAAG,IAAI,KAAK,IAAI;AAAA,IACnE;AAAA,EACF;AACF;AACAA,QAAO,iBAAiB,SAAS,KAAK,MAAM,OAAO,KAAK;AACtD,MAAI,UAAU,KAAK,KAAKA,QAAO,gBAAgB,IAAI,EAAE,GAAG,KAAK,IAAI;AAAA,IAC/D;AAAA,IACA;AAAA,EACF;AACF;AACAA,QAAO,oBAAoB,SAAS,KAAK,MAAM,OAAO,KAAK;AACzD,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,KAAK,IAAI,SAAS,MAAM,KAAK;AACxC;AACAA,QAAO,qBAAqB,SAAS,KAAK,MAAM,OAAO,KAAK;AAC1D,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,KAAK,KAAK,IAAI,SAAS,MAAM,KAAK;AACzC;AACAA,QAAO,wBAAwB,SAAS,KAAK,MAAM,OAAO,KAAK;AAC7D,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,KAAK,KAAK,IAAI,SAAS,MAAM,KAAK;AAC7C;AACAA,QAAO,iBAAiB,SAAS,KAAK,MAAM,KAAK;AAC/C,MAAI,UAAU,KAAK,KAAKA,QAAO,gBAAgB,IAAI,EAAE,GAAG,KAAK,OAAO;AAAA,IAClE;AAAA,EACF;AACF;AACAA,QAAO,oBAAoB,SAAS,KAAK,MAAM,KAAK;AAClD,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,KAAK,OAAO,SAAS,IAAI;AACpC;AACAA,QAAO,oBAAoB,SAAS,KAAK,MAAM,KAAK,KAAK;AACvD,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,KAAK,OAAO,SAAS,MAAM,GAAG;AACrC;AACAA,QAAO,uBAAuB,SAAS,KAAK,MAAM,KAAK,KAAK;AAC1D,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,KAAK,OAAO,SAAS,MAAM,GAAG;AACzC;AACAA,QAAO,wBAAwB,SAAS,KAAK,MAAM,KAAK,KAAK;AAC3D,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,KAAK,KAAK,OAAO,SAAS,MAAM,GAAG;AAC1C;AACAA,QAAO,2BAA2B,SAAS,KAAK,MAAM,KAAK,KAAK;AAC9D,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,KAAK,KAAK,OAAO,SAAS,MAAM,GAAG;AAC9C;AACAA,QAAO,WAAW,SAAS,KAAK,KAAK,KAAK;AACxC,MAAI,UAAU,KAAK,KAAKA,QAAO,UAAU,IAAI,EAAE,GAAG,KAAK,SAAS,GAAG;AACrE;AACAA,QAAO,aAAa,SAAS,KAAKZ,OAAM,KAAK;AAC3C,MAAI,UAAU,KAAK,KAAKY,QAAO,YAAY,IAAI,EAAE,GAAG,KAAK,IAAI,KAAKZ,KAAI;AACxE;AACAY,QAAO,aAAa,SAAS,KAAKZ,OAAM,KAAK;AAC3C,MAAI,UAAU,KAAK,KAAKY,QAAO,YAAY,IAAI,EAAE,GAAG,KAAK,IAAI,KAAKZ,KAAI;AACxE;AACAY,QAAO,kBAAkB,SAAS,KAAKZ,OAAM,KAAK;AAChD,MAAI,UAAU,KAAK,KAAKY,QAAO,iBAAiB,IAAI,EAAE,GAAG,QAAQ,IAAI;AAAA,IACnEZ;AAAA,EACF;AACF;AACAY,QAAO,qBAAqB,SAAS,KAAKZ,OAAM,KAAK;AACnD,MAAI,UAAU,KAAK,KAAKY,QAAO,oBAAoB,IAAI,EAAE,GAAG,IAAI,KAAK,IAAI;AAAA,IACvEZ;AAAA,EACF;AACF;AACAY,QAAO,qBAAqB,SAAS,KAAKZ,OAAM,KAAK;AACnD,MAAI,UAAU,KAAK,KAAKY,QAAO,oBAAoB,IAAI,EAAE,GAAG,IAAI,KAAK,IAAI;AAAA,IACvEZ;AAAA,EACF;AACF;AACAY,QAAO,iBAAiB,SAAS,KAAKZ,OAAM,KAAK;AAC/C,MAAI,UAAU,KAAK,KAAKY,QAAO,gBAAgB,IAAI,EAAE,GAAG,KAAK,IAAI,KAAK;AAAA,IACpEZ;AAAA,EACF;AACF;AACAY,QAAO,iBAAiB,SAAS,KAAKZ,OAAM,KAAK;AAC/C,MAAI,UAAU,KAAK,KAAKY,QAAO,gBAAgB,IAAI,EAAE,GAAG,KAAK,IAAI,KAAK;AAAA,IACpEZ;AAAA,EACF;AACF;AACAY,QAAO,sBAAsB,SAAS,KAAKZ,OAAM,KAAK;AACpD,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAY,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,QAAQ,IAAI,KAAK,KAAKZ,KAAI;AACjC;AACAY,QAAO,yBAAyB,SAAS,KAAKZ,OAAM,KAAK;AACvD,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAY,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,KAAK,IAAI,KAAK,KAAKZ,KAAI;AAClC;AACAY,QAAO,yBAAyB,SAAS,KAAKZ,OAAM,KAAK;AACvD,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAY,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,KAAK,IAAI,KAAK,KAAKZ,KAAI;AAClC;AACAY,QAAO,SAAS,SAAST,KAAI,WAAW,eAAe,KAAK;AAC1D,MAAI,aAAa,OAAO,aAAa,qBAAqB,QAAQ;AAChE,oBAAgB;AAChB,gBAAY;AAAA,EACd;AACA,MAAI,YAAY,IAAI,UAAUA,KAAI,KAAKS,QAAO,QAAQ,IAAI,EAAE,GAAG;AAAA,IAC7D;AAAA,IACA;AAAA,EACF;AACA,SAAO,KAAK,WAAW,QAAQ;AACjC;AACAA,QAAO,eAAe,SAAST,KAAI,WAAW,eAAe,SAAS;AACpE,MAAI,aAAa,OAAO,aAAa,qBAAqB,QAAQ;AAChE,oBAAgB;AAChB,gBAAY;AAAA,EACd;AACA,MAAI,UAAUA,KAAI,SAASS,QAAO,cAAc,IAAI,EAAE,GAAG,IAAI;AAAA,IAC3D;AAAA,IACA;AAAA,EACF;AACF;AACAA,QAAO,WAAW,SAAS,KAAK,UAAU,MAAM,KAAK;AACnD,MAAI;AACJ,UAAQ,UAAU;AAAA,IAChB,KAAK;AACH,WAAK,OAAO;AACZ;AAAA,IACF,KAAK;AACH,WAAK,QAAQ;AACb;AAAA,IACF,KAAK;AACH,WAAK,MAAM;AACX;AAAA,IACF,KAAK;AACH,WAAK,OAAO;AACZ;AAAA,IACF,KAAK;AACH,WAAK,MAAM;AACX;AAAA,IACF,KAAK;AACH,WAAK,OAAO;AACZ;AAAA,IACF,KAAK;AACH,WAAK,OAAO;AACZ;AAAA,IACF,KAAK;AACH,WAAK,QAAQ;AACb;AAAA,IACF;AACE,YAAM,MAAM,MAAM,OAAO;AACzB,YAAM,IAAI;AAAA,QACR,MAAM,uBAAuB,WAAW;AAAA,QACxC;AAAA,QACAA,QAAO;AAAA,MACT;AAAA,EACJ;AACA,MAAIC,SAAQ,IAAI,UAAU,IAAI,KAAKD,QAAO,UAAU,IAAI;AACxD,EAAAC,OAAM;AAAA,IACJ,SAAS,KAAKA,QAAO,QAAQ;AAAA,IAC7B,cAAc3B,UAAS,GAAG,IAAI,YAAY,WAAW,MAAMA,UAAS,IAAI;AAAA,IACxE,cAAcA,UAAS,GAAG,IAAI,gBAAgB,WAAW,MAAMA,UAAS,IAAI;AAAA,EAC9E;AACF;AACA0B,QAAO,UAAU,SAAS,KAAK,KAAK,OAAO,KAAK;AAC9C,MAAI,UAAU,KAAK,KAAKA,QAAO,SAAS,IAAI,EAAE,GAAG,GAAG,QAAQ,KAAK,KAAK;AACxE;AACAA,QAAO,gBAAgB,SAAS,KAAK,KAAK,OAAO,KAAK;AACpD,MAAI,UAAU,KAAK,KAAKA,QAAO,eAAe,IAAI,EAAE,GAAG,GAAG;AAAA,IACxD;AAAA,IACA;AAAA,EACF;AACF;AACAA,QAAO,cAAc,SAAS,MAAMhB,OAAM,KAAK;AAC7C,MAAI,UAAU,MAAM,KAAKgB,QAAO,aAAa,IAAI,EAAE,GAAG,KAAK,KAAK,QAAQhB,KAAI;AAC9E;AACAgB,QAAO,iBAAiB,SAAS,MAAMhB,OAAM,KAAK;AAChD,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAgB,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,KAAK,KAAK,QAAQhB,KAAI;AACjC;AACAgB,QAAO,kBAAkB,SAAS,MAAMhB,OAAM,KAAK;AACjD,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAgB,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,KAAK,KAAK,KAAK,QAAQhB,KAAI;AAClC;AACAgB,QAAO,qBAAqB,SAAS,MAAMhB,OAAM,KAAK;AACpD,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAgB,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQhB,KAAI;AACtC;AACAgB,QAAO,qBAAqB,SAAS,MAAMhB,OAAM,KAAK;AACpD,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAgB,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,KAAK,KAAK,QAAQ,QAAQhB,KAAI;AACrC;AACAgB,QAAO,wBAAwB,SAAS,MAAMhB,OAAM,KAAK;AACvD,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAgB,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,KAAK,KAAK,QAAQ,QAAQhB,KAAI;AACzC;AACAgB,QAAO,yBAAyB,SAAS,MAAMhB,OAAM,KAAK;AACxD,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAgB,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,KAAK,KAAK,KAAK,QAAQ,QAAQhB,KAAI;AAC1C;AACAgB,QAAO,4BAA4B,SAAS,MAAMhB,OAAM,KAAK;AAC3D,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAgB,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,KAAK,KAAK,KAAK,QAAQ,QAAQhB,KAAI;AAC9C;AACAgB,QAAO,iBAAiB,SAAS,UAAU,QAAQ,KAAK;AACtD,MAAI,UAAU,UAAU,KAAKA,QAAO,gBAAgB,IAAI,EAAE,GAAG,QAAQ;AAAA,IACnE;AAAA,EACF;AACF;AACAA,QAAO,oBAAoB,SAAS,UAAU,QAAQ,KAAK;AACzD,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,QAAQ,QAAQ,MAAM;AACjC;AACAA,QAAO,qBAAqB,SAAS,UAAU,QAAQ,KAAK;AAC1D,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,QAAQ,KAAK,QAAQ,MAAM;AAClC;AACAA,QAAO,wBAAwB,SAAS,UAAU,QAAQ,KAAK;AAC7D,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,QAAQ,KAAK,QAAQ,MAAM;AACtC;AACAA,QAAO,wBAAwB,SAAS,UAAU,QAAQ,KAAK;AAC7D,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,QAAQ,QAAQ,QAAQ,MAAM;AACrC;AACAA,QAAO,2BAA2B,SAAS,UAAU,QAAQ,KAAK;AAChE,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,QAAQ,QAAQ,QAAQ,MAAM;AACzC;AACAA,QAAO,4BAA4B,SAAS,UAAU,QAAQ,KAAK;AACjE,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,QAAQ,KAAK,QAAQ,QAAQ,MAAM;AAC1C;AACAA,QAAO,+BAA+B,SAAS,UAAU,QAAQ,KAAK;AACpE,MAAI;AAAA,IACF;AAAA,IACA;AAAA,IACAA,QAAO;AAAA,IACP;AAAA,EACF,EAAE,GAAG,IAAI,QAAQ,KAAK,QAAQ,QAAQ,MAAM;AAC9C;AACAA,QAAO,QAAQ,SAAS,QAAQ,MAAM,KAAK;AACzC,MAAI,UAAU,QAAQ,KAAKA,QAAO,OAAO,IAAI,EAAE,GAAG,GAAG,MAAM,IAAI;AACjE;AACAA,QAAO,aAAa,SAAS,KAAK,KAAK;AACrC,MAAI,OAAO,UAAU,CAAC,IAAI,OAAO,QAAQ,GAAG;AAC1C,UAAM,MAAM,GAAG,GAAG,aAAa1B,UAAS,GAAG,CAAC,uBAAuB,YAAYA,UAAS,GAAG,CAAC;AAC5F,UAAM,IAAI,eAAe,KAAK,QAAQ0B,QAAO,UAAU;AAAA,EACzD;AACF;AACAA,QAAO,UAAU,SAAST,KAAI,KAAK,MAAM,KAAK;AAC5C,MAAI,UAAU,WAAW,KAAK,OAAO,QAAQ,YAAY;AACvD,UAAM;AACN,WAAO;AAAA,EACT;AACA,MAAI,UAAUA,KAAI,KAAKS,QAAO,SAAS,IAAI,EAAE,GAAG,OAAO,KAAK,IAAI;AAClE;AACAA,QAAO,YAAY,SAAST,KAAI,KAAK,MAAM,OAAO,KAAK;AACrD,MAAI,UAAU,WAAW,KAAK,OAAO,QAAQ,YAAY;AACvD,QAAI,SAAS;AACb,YAAQ;AACR,UAAM;AAAA,EACR,WAAW,UAAU,WAAW,GAAG;AACjC,YAAQ;AACR,WAAO;AAAA,EACT;AACA,MAAI,UAAUA,KAAI,KAAKS,QAAO,WAAW,IAAI,EAAE,GAAG,OAAO,KAAK,IAAI,EAAE,GAAG,KAAK;AAC9E;AACAA,QAAO,gBAAgB,SAAST,KAAI,KAAK,MAAM,KAAK;AAClD,MAAI,UAAU,WAAW,KAAK,OAAO,QAAQ,YAAY;AACvD,UAAM;AACN,WAAO;AAAA,EACT;AACA,SAAO,IAAI,UAAUA,KAAI,KAAKS,QAAO,eAAe,IAAI,EAAE,GAAG,IAAI;AAAA,IAC/D;AAAA,IACA;AAAA,EACF;AACF;AACAA,QAAO,kBAAkB,SAAST,KAAI,KAAK,MAAM,OAAO,KAAK;AAC3D,MAAI,UAAU,WAAW,KAAK,OAAO,QAAQ,YAAY;AACvD,QAAI,SAAS;AACb,YAAQ;AACR,UAAM;AAAA,EACR,WAAW,UAAU,WAAW,GAAG;AACjC,YAAQ;AACR,WAAO;AAAA,EACT;AACA,MAAI,UAAUA,KAAI,KAAKS,QAAO,iBAAiB,IAAI,EAAE,GAAG,OAAO,KAAK,IAAI,EAAE,IAAI,IAAI,GAAG,KAAK;AAC5F;AACAA,QAAO,YAAY,SAAST,KAAI,KAAK,MAAM,KAAK;AAC9C,MAAI,UAAU,WAAW,KAAK,OAAO,QAAQ,YAAY;AACvD,UAAM;AACN,WAAO;AAAA,EACT;AACA,SAAO,IAAI,UAAUA,KAAI,KAAKS,QAAO,WAAW,IAAI,EAAE,GAAG,SAAS,KAAK,IAAI;AAC7E;AACAA,QAAO,cAAc,SAAST,KAAI,KAAK,MAAM,OAAO,KAAK;AACvD,MAAI,UAAU,WAAW,KAAK,OAAO,QAAQ,YAAY;AACvD,QAAI,SAAS;AACb,YAAQ;AACR,UAAM;AAAA,EACR,WAAW,UAAU,WAAW,GAAG;AACjC,YAAQ;AACR,WAAO;AAAA,EACT;AACA,MAAI,UAAUA,KAAI,KAAKS,QAAO,aAAa,IAAI,EAAE,GAAG,SAAS,KAAK,IAAI,EAAE,GAAG,KAAK;AAClF;AACAA,QAAO,kBAAkB,SAAST,KAAI,KAAK,MAAM,KAAK;AACpD,MAAI,UAAU,WAAW,KAAK,OAAO,QAAQ,YAAY;AACvD,UAAM;AACN,WAAO;AAAA,EACT;AACA,SAAO,IAAI,UAAUA,KAAI,KAAKS,QAAO,iBAAiB,IAAI,EAAE,GAAG,IAAI;AAAA,IACjE;AAAA,IACA;AAAA,EACF;AACF;AACAA,QAAO,oBAAoB,SAAST,KAAI,KAAK,MAAM,OAAO,KAAK;AAC7D,MAAI,UAAU,WAAW,KAAK,OAAO,QAAQ,YAAY;AACvD,QAAI,SAAS;AACb,YAAQ;AACR,UAAM;AAAA,EACR,WAAW,UAAU,WAAW,GAAG;AACjC,YAAQ;AACR,WAAO;AAAA,EACT;AACA,MAAI,UAAUA,KAAI,KAAKS,QAAO,mBAAmB,IAAI,EAAE,GAAG,SAAS,KAAK,IAAI,EAAE,IAAI,IAAI,GAAG,KAAK;AAChG;AACAA,QAAO,YAAY,SAAST,KAAI,KAAK,MAAM,KAAK;AAC9C,MAAI,UAAU,WAAW,KAAK,OAAO,QAAQ,YAAY;AACvD,UAAM;AACN,WAAO;AAAA,EACT;AACA,SAAO,IAAI,UAAUA,KAAI,KAAKS,QAAO,WAAW,IAAI,EAAE,GAAG,SAAS,KAAK,IAAI;AAC7E;AACAA,QAAO,cAAc,SAAST,KAAI,KAAK,MAAM,OAAO,KAAK;AACvD,MAAI,UAAU,WAAW,KAAK,OAAO,QAAQ,YAAY;AACvD,QAAI,SAAS;AACb,YAAQ;AACR,UAAM;AAAA,EACR,WAAW,UAAU,WAAW,GAAG;AACjC,YAAQ;AACR,WAAO;AAAA,EACT;AACA,MAAI,UAAUA,KAAI,KAAKS,QAAO,aAAa,IAAI,EAAE,GAAG,SAAS,KAAK,IAAI,EAAE,GAAG,KAAK;AAClF;AACAA,QAAO,kBAAkB,SAAST,KAAI,KAAK,MAAM,KAAK;AACpD,MAAI,UAAU,WAAW,KAAK,OAAO,QAAQ,YAAY;AACvD,UAAM;AACN,WAAO;AAAA,EACT;AACA,SAAO,IAAI,UAAUA,KAAI,KAAKS,QAAO,iBAAiB,IAAI,EAAE,GAAG,IAAI;AAAA,IACjE;AAAA,IACA;AAAA,EACF;AACF;AACAA,QAAO,oBAAoB,SAAST,KAAI,KAAK,MAAM,OAAO,KAAK;AAC7D,MAAI,UAAU,WAAW,KAAK,OAAO,QAAQ,YAAY;AACvD,QAAI,SAAS;AACb,YAAQ;AACR,UAAM;AAAA,EACR,WAAW,UAAU,WAAW,GAAG;AACjC,YAAQ;AACR,WAAO;AAAA,EACT;AACA,SAAO,IAAI,UAAUA,KAAI,KAAKS,QAAO,mBAAmB,IAAI,EAAE,GAAG,IAAI,SAAS,KAAK,IAAI,EAAE,GAAG,KAAK;AACnG;AACAA,QAAO,oBAAoB,SAAST,KAAI,KAAK,MAAM,OAAO,KAAK;AAC7D,MAAI,UAAU,WAAW,KAAK,OAAO,QAAQ,YAAY;AACvD,QAAI,SAAS;AACb,YAAQ;AACR,UAAM;AAAA,EACR,WAAW,UAAU,WAAW,GAAG;AACjC,YAAQ;AACR,WAAO;AAAA,EACT;AACA,MAAI,UAAUA,KAAI,KAAKS,QAAO,mBAAmB,IAAI,EAAE,GAAG,SAAS,KAAK,IAAI,EAAE,IAAI,IAAI,GAAG,KAAK;AAChG;AACAA,QAAO,UAAU,SAAS,KAAK;AAC7B,MAAI,KAAK;AACP,UAAM;AAAA,EACR;AACF;AACAA,QAAO,eAAe,SAAS,KAAK,KAAK;AACvC,MAAI,UAAU,KAAK,KAAKA,QAAO,cAAc,IAAI,EAAE,GAAG,GAAG;AAC3D;AACAA,QAAO,kBAAkB,SAAS,KAAK,KAAK;AAC1C,MAAI,UAAU,KAAK,KAAKA,QAAO,iBAAiB,IAAI,EAAE,GAAG,IAAI,GAAG;AAClE;AACAA,QAAO,WAAW,SAAS,KAAK,KAAK;AACnC,MAAI,UAAU,KAAK,KAAKA,QAAO,UAAU,IAAI,EAAE,GAAG,GAAG;AACvD;AACAA,QAAO,cAAc,SAAS,KAAK,KAAK;AACtC,MAAI,UAAU,KAAK,KAAKA,QAAO,aAAa,IAAI,EAAE,GAAG,IAAI,GAAG;AAC9D;AACAA,QAAO,WAAW,SAAS,KAAK,KAAK;AACnC,MAAI,UAAU,KAAK,KAAKA,QAAO,UAAU,IAAI,EAAE,GAAG,GAAG;AACvD;AACAA,QAAO,cAAc,SAAS,KAAK,KAAK;AACtC,MAAI,UAAU,KAAK,KAAKA,QAAO,aAAa,IAAI,EAAE,GAAG,IAAI,GAAG;AAC9D;AACAA,QAAO,UAAU,SAAS,KAAK,KAAK;AAClC,MAAI,UAAU,KAAK,KAAKA,QAAO,SAAS,IAAI,EAAE,GAAG,GAAG;AACtD;AACAA,QAAO,aAAa,SAAS,KAAK,KAAK;AACrC,MAAI,UAAU,KAAK,KAAKA,QAAO,YAAY,IAAI,EAAE,GAAG,IAAI,GAAG;AAC7D;AACAA,QAAO,iBAAiB,SAAS,KAAK,KAAK,KAAK;AAC9C,MAAI,UAAU,KAAK,GAAG,EAAE,GAAG,cAAc,GAAG;AAC9C;AACAA,QAAO,uBAAuB,SAAS,KAAK,KAAK,KAAK;AACpD,MAAI,UAAU,KAAK,GAAG,EAAE,GAAG,IAAI,cAAc,GAAG;AAClD;AACA,IAAI,UAAU;AAAA,EACZ,CAAC,QAAQ,IAAI;AAAA,EACb,CAAC,WAAW,OAAO;AAAA,EACnB,CAAC,UAAU,OAAO;AAAA,EAClB,CAAC,UAAU,OAAO;AAAA,EAClB,CAAC,gBAAgB,YAAY;AAAA,EAC7B,CAAC,mBAAmB,eAAe;AAAA,EACnC,CAAC,YAAY,QAAQ;AAAA,EACrB,CAAC,eAAe,WAAW;AAAA,EAC3B,CAAC,YAAY,QAAQ;AAAA,EACrB,CAAC,eAAe,WAAW;AAAA,EAC3B,CAAC,WAAW,OAAO;AAAA,EACnB,CAAC,cAAc,UAAU;AAAA,EACzB,CAAC,cAAc,YAAY;AAAA,EAC3B,CAAC,iBAAiB,eAAe;AAAA,EACjC,CAAC,kBAAkB,eAAe;AACpC;AACA,WAAW,CAAC,MAAM,EAAE,KAAK,SAAS;AAChC,EAAAA,QAAO,EAAE,IAAIA,QAAO,IAAI;AAC1B;AAGA,IAAI,OAAO,CAAC;AACZ,SAAS,IAAIT,KAAI;AACf,QAAM,UAAU;AAAA,IACd;AAAA,IACA;AAAA,IACA,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA,QAAAS;AAAA,IACA;AAAA,IACA,GAAG;AAAA,EACL;AACA,MAAI,CAAC,CAAC,KAAK,QAAQT,GAAE,GAAG;AACtB,IAAAA,IAAG,SAAS,aAAa;AACzB,SAAK,KAAKA,GAAE;AAAA,EACd;AACA,SAAO;AACT;AACA,OAAO,KAAK,KAAK;;;AC9jIjB,IAAMW,aAAY,CAAC,KAAKC,SAAQ,aAAa,OAAO,MAAMC,aAAY;AAErE,QAAM,OAAO,IAAI,YAAY;AAC7B,QAAM,aAAa,SAAS,YAAY,KAAK,IAAI,IAAI;AACrD,MAAI,cAAc;AAClB,MAAI,IAAI,KAAK,MAAM,WAAW,GAAG;AAChC,UAAM,kBAAkB,cAAcD,QAAO;AAC7C,kBAAc,KAAKA,QAAO,YAAY,GAAG,eAAe,YAAYC,SAAQ,IAAI,KAAK,OAAOD,SAAQ,iBAAiB,OAAO,IAAI,CAAC,GAAGA,QAAO,MAAM,OAAO,GAAG,GAAGA,QAAO,YAAY,GAAG,eAAe,cAAcC,SAAQ,IAAI,KAAK,SAASD,SAAQ,iBAAiB,OAAO,IAAI,CAAC,GAAGA,QAAO,MAAM,KAAK,GAAG,GAAGA,QAAO,YAAY,GAAG,WAAW;AAAA,EAC7U;AACA,SAAO,gBAAgB,UAAU,IAAI,WAAW;AACjD;AACA,IAAME,QAAO,CAAC,QAAQ,OAAO,CAAC,CAAC,IAAI;AACnC,IAAMC,UAAS;AAAA,EACd,WAAAJ;AAAA,EACA,MAAAG;AACD;AAEA,IAAM,EAAE,eAAAE,gBAAe,YAAAC,aAAY,WAAAC,YAAW,cAAAC,eAAc,oBAAAC,qBAAoB,mBAAAC,mBAAkB,IAAI;AACtG,IAAIC,WAAU;AAAA,EACbF;AAAA,EACAD;AAAA,EACAF;AAAA,EACAD;AAAA,EACAE;AAAA,EACAG;AAAA,EACAN;AACD;AACA,SAAS,cAAcA,SAAQ;AAC9B,EAAAO,WAAU,CAACP,OAAM,EAAE,OAAOO,QAAO;AAClC;AACA,SAAS,iBAAiB;AACzB,SAAOA;AACR;;;AClCA,IAAM,cAAc;AACpB,SAAS,iBAAiB,QAAQ,YAAY,cAAc;AAC3D,QAAM,QAAQ,OAAO,MAAM,WAAW;AACtC,QAAM,KAAK,OAAO,KAAK,MAAM,IAAI,IAAI;AACrC,MAAI,QAAQ;AACZ,MAAI,aAAa,MAAM,OAAQ,QAAO,OAAO;AAC7C,WAASC,KAAI,GAAGA,KAAI,aAAa,GAAGA,KAAK,UAAS,MAAMA,EAAC,EAAE,SAAS;AACpE,SAAO,QAAQ;AAChB;AACA,SAAS,mBAAmB,QAAQ,QAAQ;AAC3C,MAAI,SAAS,OAAO,OAAQ,OAAM,IAAI,MAAM,+CAA+C,MAAM,aAAa,OAAO,MAAM,EAAE;AAC7H,QAAM,QAAQ,OAAO,MAAM,WAAW;AACtC,QAAM,KAAK,OAAO,KAAK,MAAM,IAAI,IAAI;AACrC,MAAI,UAAU;AACd,MAAI,OAAO;AACX,SAAO,OAAO,MAAM,QAAQ,QAAQ;AACnC,UAAM,aAAa,MAAM,IAAI,EAAE,SAAS;AACxC,QAAI,UAAU,cAAc,OAAQ;AACpC,eAAW;AAAA,EACZ;AACA,SAAO,OAAO;AACf;;;ACrBA,IAAI,oBAAoB;AACxB,qBAAqB;AAGrB,IAAM,YAAY,OAAO,UAAU,OAAO,QAAQ,aAAa;AAkB/D,IAAM,gBAAgB,iBAAiB;AAAC,EAAE;AAqB1C,IAAgBC,SAAQ;AAAxB,IAA4FC,aAA4B,oBAAI,WAAW,EAAE;AAAzI,IAA4IC,aAA4B,oBAAI,WAAW,GAAG;AAC1L,SAASC,KAAI,GAAGA,KAAIH,OAAM,QAAQG,MAAK;AACtC,MAAI,IAAIH,OAAM,WAAWG,EAAC;AAC1B,EAAAF,WAAUE,EAAC,IAAI,GAAGD,WAAU,CAAC,IAAIC;AAClC;AAqKA,IAKG,cAAc,IAAI,YAAY;AALjC,IAKoC,gBAAgB,MAAM;AACzD,MAAI,iBAAiB,OAAO,UAAU,aAAa,SAAS;AAC5D,SAAO,kBAAkB,OAAO,eAAe,QAAQ,aAAa,CAAC,WAAW,eAAe,KAAK,QAAQ,QAAQ,EAAE,SAAS,OAAO,IAAI,CAAC,WAAW,YAAY,OAAO,WAAW,KAAK,KAAK,MAAM,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC;AAC/N,GAAG;AA6CH,IAAM,qCAAqC,OAAO,OAAO,iBAAiB,oCAAoC;AA6c9G,IAAwR,6BAA6B;AAArT,IAAmW,2BAA2B;AAAA;AAAA;AAAA,6BAGjW,KAAK,UAAU,0BAA0B,CAAC;AAAA,mCACpC,KAAK,UAAU,0BAA0B,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA4C7E,IAAM,WAAW,IAAI,MAAM,CAAC,GAAG,EAAE,IAAIC,IAAG,GAAG;AAC1C,QAAM,MAAM,sGAAsG,OAAO,CAAC,CAAC,YAAY;AACxI,EAAE,CAAC;AA2IH,IAMmG,uBAAuC,oBAAI,IAAI;AANlJ,IAMqJ,4BAA4C,oBAAI,IAAI;AANzM,IAM4M,qBAAqB,CAAC,cAAc,IAAI,SAAS;AAC5P,WAAS,WAAW,UAAU;AAC7B,QAAI,SAAS,QAAQ,GAAG,IAAI;AAC5B,QAAI,OAAQ,QAAO;AAAA,EACpB;AACA,SAAO;AACR;AAZA,IAYI,2BAA2B,mBAAmB,oBAAoB;AAZtE,IAYyE,gCAAgC,mBAAmB,yBAAyB;AAErJ,IAAM,kBAAkB,MAAM;;;ACh6B9B,IAkgCG,IAAI,OAAO,OAAO,MAAM;AAAC,CAAC;AAlgC7B,IAkgCgC,IAAI,WAAW;AAoB/C,IAAgH,KAAK,YAAY;AAAC,GAAG;AAkCrI,SAAS,EAAE,IAAI,YAAY;AAC1B,MAAIC,KAAI,WAAWC,KAAI;AACvB,MAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,UAAU,KAAK;AAClD,IAAAD,KAAI;AACJ,QAAI,IAAI,EAAE,KAAK;AACf,QAAI,EAAG,CAAAC,KAAI;AAAA,SACN;AACJ,UAAID,KAAI,EAAE,SAAS,UAAU;AAC7B,MAAAA,OAAMC,KAAID;AAAA,IACX;AAAA,EACD,MAAO,GAAE,QAAQA,KAAI,QAAQC,KAAI,EAAE,KAAK,SAAS,QAAQ,aAAa,EAAE,WAAW,EAAE,QAAQ,SAAS,SAAS,UAAUD,KAAI,QAAQC,KAAI,EAAE,QAAQ,UAAU,QAAQ,aAAa,EAAE,kBAAkBD,KAAI,UAAUC,KAAI,EAAE,eAAe,uBAAuB,EAAE,qBAAqB,KAAK,aAAa,EAAE,CAAC,KAAK,EAAE,UAAU,cAAc,uBAAuBD,KAAI,YAAY,EAAE,CAAC,KAAK,EAAE,UAAU,UAAU,YAAY,EAAE,WAAW,YAAY,KAAKA,KAAI,cAAcC,KAAI,EAAE,UAAU,UAAU,MAAM,GAAG,EAAE,CAAC,KAAK,aAAa,OAAO,EAAE,WAAW,WAAWD,KAAI,YAAY,OAAO,EAAE,eAAe,WAAWA,KAAI,eAAe,EAAE,YAAYA,KAAI,UAAU,EAAE,SAASA,KAAI,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,uBAAuBA,KAAI,aAAa,EAAE,MAAMA,KAAI,MAAMC,KAAI,OAAO,EAAE,WAAW,aAAa,EAAE,QAAQ,IAAI,aAAa,EAAE,SAAS,EAAE,eAAe,EAAE,YAAY,YAAYD,KAAI,iBAAiB,OAAO,EAAE,KAAK,YAAY,EAAE,MAAM,QAAQ,eAAe,EAAE,IAAIA,KAAI,QAAQ,EAAE,UAAU,EAAE,cAAcA,KAAI;AACz+B,SAAO;AAAA,IACN,SAASA;AAAA,IACT,SAASC;AAAA,EACV;AACD;AACA,SAAS,EAAE,IAAI,YAAY;AAC1B,SAAO,OAAO,EAAE,aAAa,YAAY,EAAE,cAAc,QAAQ,OAAO,EAAE,UAAU,aAAa;AAClG;AACA,IAAM,EAAE,SAAS,GAAG,SAAS,EAAE,IAAI,EAAE;AAArC,IAAwC,IAAI,WAAW,YAAY,IAAI,KAAK,WAAW,WAAW;AAAlG,IAKGC,KAAI,WAAW,SAAS,QAAQ,OAAO,KAAK,WAAW,SAAS,MAAM,MAAM,MAAM;AACpF,QAAM,MAAM,yDAAyD;AACtE;AAPA,IAYGC,KAAI,WAAW,KAAK;;;ACzkCvB,yBAA6B;AAE7B,IAAI,mBAAmB,EAAC,SAAS,CAAC,EAAC;AAEnC,IAAI;AAEJ,SAAS,wBAAyB;AACjC,MAAI,0BAA2B,QAAO,iBAAiB;AACvD,8BAA4B;AAU5B,MAAIC,kBAAiB,SAASC,IAAGC,IAAG;AACnC,QAAIC,IAAG,OACL,QAAQ,GACR,OAAO,GACP,OAAO,GACP,WAAW,OAAO;AAEpB,aAAS,QAAQ,KAAK,KAAK,MAAM;AAChC,UAAI,MAAM;AACT,aAAKA,KAAI,KAAK,OAAO,QAAQ,KAAKA,EAAC,GAAG,OAAO,MAAM,OAAO,KAAK,GAAEA;AACjE,eAAO,CAAC,IAAI,MAAM,MAAM,GAAGA,EAAC;AAAA,MAC7B;AACA,aAAO,YAAY,SAAS,QAAQ,IAAI,OAAO,GAAG,CAAC;AACnD,aAAO,OAAO,KAAK,OAAO,MAAO,OAAO,IAAI,WAAW,GAAG,KAAK,GAAI,OAAO,MAAM,OAAO,OAAO,OAC3F,OAAO,KAAK,KACZ,OAAO,KAAK,OAAO,IACnB,OAAO,KAAK,OAAO,KACnB,OAAO,KAAK,OAAO,KACnB,OAAO,KAAK,OAAO,KACnB,OAAO,KAAK,OAAO,KACnB,OAAO,MAAM,OAAO,IACpB,OAAO;AAAA,IACX;AAGA,SAAKF,MAAG,QAAQC,MAAG,IAAK,QAAM,SAAQ;AACrC,cAAQ,QAAQD,IAAG,MAAM;AACzB,cAAQ,QAAQC,IAAG,MAAM;AAEzB,UAAI,QAAQ,MAAM,QAAQ,MAAM,QAAQ,MAAM,QAAQ,IAAI;AACzD,gBAAQ,QAAQD,IAAG,MAAM,IAAI;AAC7B,gBAAQ,QAAQC,IAAG,MAAM,OAAOC,EAAC;AACjC,eAAOA;AAAA,MACR;AAEA,UAAI,SAAS,MAAO,QAAQ,QAAQ,QAAS,KAAK;AAAA,IACnD;AACA,WAAO;AAAA,EACR;AAEA,MAAI;AACH,qBAAiB,UAAUH;AAAA,EAC5B,SAAS,GAAG;AACX,WAAO,iBAAiBA;AAAA,EACzB;AACA,SAAO,iBAAiB;AACzB;AAEA,IAAI,wBAAwB,sBAAsB;AAClD,IAAI,iBAA8B,gBAAAI,yBAAwB,qBAAqB;AAG/E,SAAS,cAAcC,WAAU,OAAO;AACvC,SAAO,GAAGA,SAAQ,IAAI,KAAK;AAC5B;AACA,SAAS,cAAc,KAAK;AAC3B,MAAI,CAAC,QAAQ,KAAK,GAAG,EAAG,OAAM,IAAI,MAAM,uCAAuC;AAC/E,SAAO,IAAI,QAAQ,SAAS,EAAE;AAC/B;AAEA,SAAS,qBAAqB,UAAU,SAAS;AAChD,QAAM,OAAO,uBAAO,OAAO,IAAI;AAC/B,MAAI;AACH,QAAI,SAAS,WAAW,OAAO,EAAE,IAAI;AAAA,EACtC,SAAS,OAAO;AACf,UAAM,IAAI,MAAM,4DAA4D,QAAQ,IAAI,EAAE,MAAM,CAAC;AAAA,EAClG;AACA,SAAO;AACR;AAGA,SAAS,mBAAmBC,SAAQ;AACnC,SAAOA,QAAO,SAAS,IAAI,IAAI;AAAA,EAAKA,OAAM;AAAA,IAAOA;AAClD;AAIA,SAAS,sBAAsBA,SAAQ;AACtC,SAAOA,QAAO,SAAS,KAAKA,QAAO,CAAC,MAAM,QAAQA,QAAO,SAAS,IAAI,IAAIA,QAAO,MAAM,GAAG,EAAE,IAAIA;AACjG;AAWA,IAAM,cAAc;AACpB,IAAM,oBAAoB;AAC1B,SAASC,WAAU,KAAK,SAAS,GAAG,kBAAkB,CAAC,GAAG;AACzD,SAAO,kBAAkB,OAAO,KAAK;AAAA,IACpC;AAAA,IACA;AAAA,IACA,SAAS,eAAe;AAAA,IACxB;AAAA,IACA,GAAG;AAAA,EACJ,CAAC,CAAC;AACH;AACA,SAAS,qBAAqB,KAAK;AAClC,SAAO,IAAI,QAAQ,cAAc,MAAM;AACxC;AACA,SAAS,oBAAoB,KAAK;AACjC,SAAO,KAAK,qBAAqB,GAAG,CAAC;AACtC;AACA,SAAS,kBAAkBD,SAAQ;AAClC,SAAOA,QAAO,QAAQ,YAAY,IAAI;AACvC;AACA,eAAe,iBAAiB,aAAa,cAAc,cAAc;AACxE,QAAM,YAAY,OAAO,KAAK,YAAY,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC,QAAQ,WAAW,oBAAoB,GAAG,CAAC,OAAO,oBAAoB,kBAAkB,aAAa,GAAG,CAAC,CAAC,CAAC,GAAG;AACpL,QAAM,UAAU,GAAG,YAAY,UAAU,CAAC;AAAA;AAAA,EAAO,UAAU,KAAK,MAAM,CAAC;AAAA;AACvE,QAAM,aAAa,MAAM,YAAY,iBAAiB,YAAY;AAClE,MAAI,cAAc,QAAQ,eAAe,QAAS;AAClD,QAAM,YAAY,iBAAiB,cAAc,OAAO;AACzD;AACA,SAAS,eAAe,SAAS,CAAC,GAAG,SAAS,CAAC,GAAG;AACjD,QAAM,eAAe,MAAM,KAAK,MAAM;AACtC,SAAO,QAAQ,CAAC,eAAe,UAAU;AACxC,UAAM,gBAAgB,aAAa,KAAK;AACxC,QAAI,MAAM,QAAQ,OAAO,KAAK,CAAC,EAAG,cAAa,KAAK,IAAI,eAAe,OAAO,KAAK,GAAG,aAAa;AAAA,aAC1F,SAAS,aAAa,EAAG,cAAa,KAAK,IAAI,kBAAkB,OAAO,KAAK,GAAG,aAAa;AAAA;AAGtG,mBAAa,KAAK,IAAI;AAAA,EACvB,CAAC;AACD,SAAO;AACR;AAaA,SAAS,kBAAkB,QAAQ,QAAQ;AAC1C,MAAI,SAAS,MAAM,KAAK,SAAS,MAAM,GAAG;AACzC,UAAM,eAAe,EAAE,GAAG,OAAO;AACjC,WAAO,KAAK,MAAM,EAAE,QAAQ,CAAC,QAAQ;AACpC,UAAI,SAAS,OAAO,GAAG,CAAC,KAAK,CAAC,OAAO,GAAG,EAAE,SAAU,KAAI,EAAE,OAAO,QAAS,QAAO,OAAO,cAAc,EAAE,CAAC,GAAG,GAAG,OAAO,GAAG,EAAE,CAAC;AAAA,UACvH,cAAa,GAAG,IAAI,kBAAkB,OAAO,GAAG,GAAG,OAAO,GAAG,CAAC;AAAA,eAC1D,MAAM,QAAQ,OAAO,GAAG,CAAC,EAAG,cAAa,GAAG,IAAI,eAAe,OAAO,GAAG,GAAG,OAAO,GAAG,CAAC;AAAA,UAC3F,QAAO,OAAO,cAAc,EAAE,CAAC,GAAG,GAAG,OAAO,GAAG,EAAE,CAAC;AAAA,IACxD,CAAC;AACD,WAAO;AAAA,EACR,WAAW,MAAM,QAAQ,MAAM,KAAK,MAAM,QAAQ,MAAM,EAAG,QAAO,eAAe,QAAQ,MAAM;AAC/F,SAAO;AACR;AACA,IAAM,aAAN,cAAyB,IAAI;AAAA,EAC5B;AAAA,EACA,YAAY,WAAW,SAAS;AAC/B,UAAM,OAAO;AACb,SAAK,YAAY;AAAA,EAClB;AAAA,EACA,IAAI,KAAK;AACR,QAAI,CAAC,KAAK,IAAI,GAAG,EAAG,MAAK,IAAI,KAAK,KAAK,UAAU,GAAG,CAAC;AACrD,WAAO,MAAM,IAAI,GAAG;AAAA,EACrB;AACD;AACA,IAAM,aAAN,cAAyB,WAAW;AAAA,EACnC,cAAc;AACb,UAAM,MAAM,CAAC;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA;AAAA,EACA,UAAU;AACT,WAAO,KAAK,SAAS,KAAK,MAAM;AAAA,EACjC;AAAA,EACA,UAAU,KAAK;AACd,QAAI,OAAO,KAAK,WAAW,YAAa,MAAK;AAC7C,SAAK,IAAI,KAAK,KAAK,IAAI,GAAG,IAAI,CAAC;AAAA,EAChC;AAAA,EACA,QAAQ;AACP,QAAI,OAAO,KAAK,WAAW,YAAa,QAAO,KAAK;AACpD,QAAI,QAAQ;AACZ,eAAW,KAAK,KAAK,OAAO,EAAG,UAAS;AACxC,WAAO;AAAA,EACR;AACD;AAAA;AAEA,SAAS,KAAKE,KAAI;AACjB,QAAM,QAAwB,oBAAI,IAAI;AACtC,SAAO,CAAC,QAAQ;AACf,QAAI,CAAC,MAAM,IAAI,GAAG,EAAG,OAAM,IAAI,KAAKA,IAAG,GAAG,CAAC;AAC3C,WAAO,MAAM,IAAI,GAAG;AAAA,EACrB;AACD;AAEA,eAAe,oBAAoB,aAAa,WAAW;AAC1D,QAAM,eAAe,MAAM,OAAO,oBAAc,GAAG;AACnD,QAAM,QAAQ,IAAI,IAAI,UAAU,IAAI,CAACL,OAAMA,GAAE,IAAI,CAAC;AAClD,QAAM,QAAQ,IAAI,MAAM,KAAK,KAAK,EAAE,IAAI,OAAO,SAAS;AACvD,UAAM,QAAQ,UAAU,OAAO,CAACA,OAAMA,GAAE,SAAS,IAAI;AACrD,UAAM,OAAO,MAAM,YAAY,iBAAiB,IAAI;AACpD,QAAI,QAAQ,KAAM,OAAM,IAAI,MAAM,eAAe,IAAI,8BAA8B;AACnF,UAAM,IAAI,IAAI,YAAY,IAAI;AAC9B,eAAW,QAAQ,MAAO,mBAAkB,MAAM,GAAG,iBAAiB,MAAM,KAAK,MAAM,KAAK,MAAM,GAAG,KAAK,UAAU,KAAK,aAAa;AACtI,UAAM,cAAc,EAAE,SAAS;AAC/B,QAAI,gBAAgB,KAAM,OAAM,YAAY,iBAAiB,MAAM,WAAW;AAAA,EAC/E,CAAC,CAAC;AACH;AACA,IAAM,0BAA0B;AAChC,SAAS,aAAa,GAAG;AACxB,SAAO,EAAE,QAAQ,uBAAuB,MAAM;AAC/C;AACA,IAAM,wBAAwB,qBAAK,CAAC,kBAAkB;AACrD,QAAM,WAAW,wBAAwB,OAAO,QAAQ,4DAA4D,aAAa,aAAa,CAAC;AAC/I,SAAO,IAAI,OAAO,QAAQ;AAC3B,CAAC;AACD,SAAS,kBAAkB,MAAM,GAAG,OAAO,SAAS,eAAe;AAClE,MAAI,QAAQ,KAAK,MAAM,KAAK;AAC5B,QAAM,cAAc,gBAAgB,sBAAsB,aAAa,IAAI,yBAAyB,KAAK,KAAK;AAC9G,MAAI,CAAC,WAAY,QAAO;AACxB,UAAQ,MAAM,MAAM,WAAW,KAAK;AACpC,MAAI,UAAU,iBAAiB,KAAK;AACpC,MAAI,YAAY,KAAM,QAAO;AAC7B,aAAW,QAAQ,WAAW;AAC9B,QAAM,WAAW,uBAAuB,MAAM,QAAQ,WAAW,QAAQ,WAAW,CAAC,EAAE,MAAM;AAC7F,QAAM,OAAO,KAAK,kBAAkB,SAAS,MAAM,KAAK,CAAC;AACzD,MAAI,aAAa;AAEjB,MAAE,WAAW,SAAS,IAAI;AAAA;AAG1B,MAAE,UAAU,UAAU,SAAS,IAAI;AACnC,SAAO;AACR;AACA,SAAS,uBAAuB,MAAM,OAAO;AAC5C,MAAI,cAAc;AAClB,MAAI,YAAY;AAChB,SAAO,gBAAgB,aAAa,QAAQ,KAAK,QAAQ;AACxD,UAAM,IAAI,KAAK,OAAO;AACtB,QAAI,MAAM,IAAK;AAAA,aACN,MAAM,IAAK;AAAA,EACrB;AACA,SAAO;AACR;AACA,SAAS,kBAAkB,MAAM,QAAQ,OAAO;AAC/C,QAAM,aAAa,mBAAmB,QAAQ,KAAK;AACnD,QAAM,SAAS,OAAO,MAAM,WAAW,EAAE,aAAa,CAAC,EAAE,MAAM,MAAM,EAAE,CAAC,KAAK;AAC7E,QAAM,aAAa,OAAO,SAAS,GAAG,IAAI,GAAG,MAAM,MAAO,GAAG,MAAM;AACnE,QAAM,QAAQ,KAAK,KAAK,EAAE,QAAQ,OAAO,MAAM,EAAE,MAAM,KAAK;AAC5D,QAAM,YAAY,MAAM,UAAU;AAClC,QAAM,QAAQ;AACd,MAAI,UAAW,QAAO,GAAG,KAAK,GAAG,MAAM,KAAK,IAAI,EAAE,QAAQ,MAAM,KAAK,EAAE,QAAQ,SAAS,MAAM,CAAC,GAAG,KAAK;AACvG,SAAO,GAAG,KAAK;AAAA,EAAK,MAAM,IAAI,CAACA,OAAMA,KAAI,aAAaA,KAAI,EAAE,EAAE,KAAK,IAAI,EAAE,QAAQ,MAAM,KAAK,EAAE,QAAQ,SAAS,MAAM,CAAC;AAAA,EAAK,MAAM,GAAG,KAAK;AAC1I;AACA,IAAM,qBAAqB,CAAC,yBAAyB,oCAAoC;AAEzF,SAAS,uBAAuB,MAAM,OAAO,aAAa;AACzD,aAAW,QAAQ,aAAa;AAC/B,UAAM,WAAW,QAAQ,KAAK;AAC9B,QAAI,YAAY,KAAK,KAAK,MAAM,UAAU,KAAK,MAAM,KAAM,QAAO;AAAA,MACjE,MAAM,KAAK,MAAM,QAAQ;AAAA,MACzB,OAAO;AAAA,IACR;AAAA,EACD;AACA,SAAO;AAAA,IACN,MAAM,KAAK,MAAM,KAAK;AAAA,IACtB;AAAA,EACD;AACD;AACA,IAAM,oBAAoB;AAC1B,IAAM,kBAAkB,qBAAK,CAAC,kBAAkB;AAC/C,QAAM,WAAW,kBAAkB,OAAO,QAAQ,4DAA4D,aAAa,aAAa,CAAC;AACzI,SAAO,IAAI,OAAO,QAAQ;AAC3B,CAAC;AACD,SAAS,kBAAkB,MAAM,GAAG,cAAc,SAAS,eAAe;AACzE,QAAM,EAAE,MAAM,qBAAqB,MAAM,IAAI,uBAAuB,MAAM,cAAc,gBAAgB,CAAC,aAAa,IAAI,kBAAkB;AAC5I,QAAM,cAAc,gBAAgB,gBAAgB,aAAa,IAAI,mBAAmB,KAAK,mBAAmB;AAChH,QAAM,qBAAqB,gBAAgB,IAAI,OAAO,aAAa,aAAa,CAAC,IAAI,4DAA4D,KAAK,mBAAmB;AACzK,MAAI,CAAC,cAAc,WAAW,UAAU,mBAAmB,MAAO,QAAO,kBAAkB,MAAM,GAAG,OAAO,SAAS,aAAa;AACjI,QAAM,QAAQ,WAAW,CAAC;AAC1B,QAAM,aAAa,QAAQ,WAAW,QAAQ,WAAW,CAAC,EAAE;AAC5D,QAAM,aAAa,kBAAkB,SAAS,MAAM,KAAK;AACzD,MAAI,UAAU,KAAK;AAClB,MAAE,YAAY,aAAa,GAAG,UAAU;AACxC,WAAO;AAAA,EACR;AACA,QAAM,WAAW,IAAI,OAAO,gBAAgB,KAAK,EAAE,EAAE,KAAK,KAAK,MAAM,UAAU,CAAC;AAChF,MAAI,CAAC,SAAU,QAAO;AACtB,QAAM,WAAW,aAAa,SAAS,QAAQ,SAAS,CAAC,EAAE;AAC3D,IAAE,UAAU,aAAa,GAAG,UAAU,UAAU;AAChD,SAAO;AACR;AACA,IAAM,oBAAoB;AAC1B,SAAS,yBAAyB,gBAAgB;AAEjD,QAAM,QAAQ,eAAe,MAAM,iBAAiB;AACpD,MAAI,CAAC,SAAS,CAAC,MAAM,CAAC;AAEtB,WAAO;AACP,QAAM,cAAc,MAAM,CAAC;AAC3B,QAAM,QAAQ,eAAe,MAAM,KAAK;AACxC,MAAI,MAAM,UAAU;AAEpB,WAAO;AACP,MAAI,MAAM,CAAC,EAAE,KAAK,MAAM,MAAM,MAAM,GAAG,EAAE,GAAG,KAAK,MAAM;AAEvD,WAAO;AACP,WAASA,KAAI,GAAGA,KAAI,MAAM,SAAS,GAAGA,KAAK,KAAI,MAAMA,EAAC,MAAM,IAAI;AAC/D,QAAI,MAAMA,EAAC,EAAE,QAAQ,WAAW,MAAM;AAItC,aAAO;AACP,UAAMA,EAAC,IAAI,MAAMA,EAAC,EAAE,UAAU,YAAY,MAAM;AAAA,EACjD;AAGA,QAAM,MAAM,SAAS,CAAC,IAAI;AAE1B,mBAAiB,MAAM,KAAK,IAAI;AAChC,SAAO;AACR;AAEA,eAAe,iBAAiB,aAAa,WAAW;AACvD,QAAM,QAAQ,IAAI,UAAU,IAAI,OAAO,SAAS;AAC/C,QAAI,CAAC,KAAK,SAAU,OAAM,YAAY,iBAAiB,KAAK,MAAM,KAAK,QAAQ;AAAA,EAChF,CAAC,CAAC;AACH;AAEA,SAAS,oBAAoB,GAAGM,IAAG;AAClC,SAAO,EAAE,SAASA,GAAE,QAAQ,EAAE,WAAWA,GAAE,UAAU,EAAE,SAASA,GAAE;AACnE;AACA,IAAM,gBAAN,MAAM,eAAc;AAAA,EACnB;AAAA,EACA;AAAA,EACA,YAAY,IAAI,WAAW;AAAA,EAC3B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,gBAAgB,IAAI,WAAW,MAAM,CAAC,CAAC;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA,EAGA,SAAS,IAAI,WAAW;AAAA,EACxB,WAAW,IAAI,WAAW;AAAA,EAC1B,aAAa,IAAI,WAAW;AAAA,EAC5B,WAAW,IAAI,WAAW;AAAA,EAC1B,IAAI,QAAQ;AACX,WAAO,KAAK;AAAA,EACb;AAAA,EACA,IAAI,MAAM,OAAO;AAChB,SAAK,OAAO,SAAS;AAAA,EACtB;AAAA,EACA,IAAI,UAAU;AACb,WAAO,KAAK;AAAA,EACb;AAAA,EACA,IAAI,QAAQ,OAAO;AAClB,SAAK,SAAS,SAAS;AAAA,EACxB;AAAA,EACA,IAAI,YAAY;AACf,WAAO,KAAK;AAAA,EACb;AAAA,EACA,IAAI,UAAU,OAAO;AACpB,SAAK,WAAW,SAAS;AAAA,EAC1B;AAAA,EACA,IAAI,UAAU;AACb,WAAO,KAAK;AAAA,EACb;AAAA,EACA,IAAI,QAAQ,OAAO;AAClB,SAAK,SAAS,SAAS;AAAA,EACxB;AAAA,EACA,YAAY,cAAc,cAAc,UAAU,SAAS;AAC1D,SAAK,eAAe;AACpB,SAAK,eAAe;AACpB,UAAM,OAAO,YAAY,uBAAO,OAAO,IAAI;AAC3C,SAAK,cAAc,YAAY;AAC/B,UAAM,SAAS,QAAQ;AACvB,UAAM,SAAS,WAAW,SAAS,WAAW,UAAU,YAAY;AACpE,SAAK,eAAe,EAAE,GAAG,KAAK;AAC9B,SAAK,gBAAgB,EAAE,GAAG,KAAK;AAC/B,SAAK,SAAS;AACd,SAAK,mBAAmB,CAAC;AACzB,SAAK,wBAAwB,CAAC;AAC9B,SAAK,gBAAgB,CAAC;AACtB,SAAK,iBAAiB,IAAI,IAAI,OAAO,KAAK,KAAK,aAAa,CAAC;AAC7D,SAAK,SAAS,QAAQ,UAAU;AAChC,SAAK,kBAAkB,QAAQ;AAC/B,SAAK,kBAAkB;AAAA,MACtB,qBAAqB;AAAA,MACrB,cAAc;AAAA;AAAA;AAAA;AAAA,MAId,iBAAiB,KAAK;AAAA,MACtB,GAAG,QAAQ;AAAA,IACZ;AACA,SAAK,eAAe,QAAQ;AAAA,EAC7B;AAAA,EACA,aAAa,OAAO,cAAc,SAAS;AAC1C,UAAM,cAAc,QAAQ;AAC5B,UAAM,eAAe,MAAM,YAAY,YAAY,YAAY;AAC/D,QAAI;AACJ,QAAI,YAAY,qBAAsB,YAAW,MAAM,YAAY,qBAAqB,YAAY;AAAA,SAC/F;AACJ,YAAM,UAAU,MAAM,YAAY,iBAAiB,YAAY;AAC/D,iBAAW,WAAW,OAAO,qBAAqB,cAAc,OAAO,IAAI;AAAA,IAC5E;AACA,WAAO,IAAI,eAAc,cAAc,cAAc,UAAU,OAAO;AAAA,EACvE;AAAA,EACA,IAAI,sBAAsB;AACzB,WAAO,KAAK;AAAA,EACb;AAAA,EACA,IAAI,cAAc;AACjB,WAAO,KAAK;AAAA,EACb;AAAA,EACA,8BAA8BJ,WAAU;AACvC,SAAK,eAAe,QAAQ,CAAC,iBAAiB;AAI7C,UAAI,aAAa,WAAWA,SAAQ,KAAK,cAAc,KAAK,aAAa,MAAMA,UAAS,MAAM,CAAC,EAAG,MAAK,eAAe,OAAO,YAAY;AAAA,IAC1I,CAAC;AAAA,EACF;AAAA,EACA,UAAU,QAAQ;AAEjB,SAAK,mBAAmB,KAAK,iBAAiB,OAAO,CAAC,MAAM,EAAE,WAAW,MAAM;AAC/E,SAAK,wBAAwB,KAAK,sBAAsB,OAAO,CAAC,MAAM,EAAE,WAAW,MAAM;AAEzF,eAAW,OAAO,KAAK,cAAc,IAAI,MAAM,GAAG;AACjD,YAAM,OAAO,cAAc,GAAG;AAC9B,YAAM,QAAQ,KAAK,UAAU,IAAI,IAAI;AACrC,UAAI,QAAQ,GAAG;AACd,YAAI,OAAO,KAAK,iBAAiB,OAAO,KAAK,aAAc,MAAK,cAAc,GAAG,IAAI,KAAK,aAAa,GAAG;AAC1G,aAAK,UAAU,IAAI,MAAM,QAAQ,CAAC;AAAA,MACnC;AAAA,IACD;AACA,SAAK,cAAc,OAAO,MAAM;AAEhC,SAAK,MAAM,OAAO,MAAM;AACxB,SAAK,QAAQ,OAAO,MAAM;AAC1B,SAAK,QAAQ,OAAO,MAAM;AAC1B,SAAK,UAAU,OAAO,MAAM;AAAA,EAC7B;AAAA,EACA,0BAA0B,QAAQ;AAEjC,UAAM,eAAe,OAAO,UAAU,CAACF,OAAMA,GAAE,OAAO,MAAM,+BAA+B,CAAC;AAC5F,QAAI,iBAAiB,GAAI,QAAO,OAAO,eAAe,CAAC;AAEvD,UAAM,iBAAiB,OAAO,UAAU,CAACA,OAAMA,GAAE,OAAO,MAAM,uBAAuB,CAAC;AACtF,QAAI,mBAAmB,GAAI,QAAO,OAAO,iBAAiB,CAAC;AAG3D,aAASA,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACvC,YAAM,QAAQ,OAAOA,EAAC,EAAE,OAAO,MAAM,kCAAkC;AACvE,UAAI,MAAO,QAAO,OAAOA,KAAI,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK;AAAA,IACnD;AAGA,UAAM,qBAAqB,OAAO,UAAU,CAACA,OAAMA,GAAE,OAAO,SAAS,6BAA6B,CAAC;AACnG,QAAI,uBAAuB,GAAI,QAAO,OAAO,qBAAqB,CAAC,KAAK;AAGxE,UAAM,aAAa,OAAO,UAAU,CAACA,OAAMA,GAAE,OAAO,SAAS,qBAAqB,CAAC;AACnF,WAAO,eAAe,KAAK,OAAO,aAAa,CAAC,IAAI;AAAA,EACrD;AAAA,EACA,aAAa,KAAK,oBAAoB,SAAS;AAC9C,SAAK,SAAS;AACd,QAAI,QAAQ,MAAO,MAAK,iBAAiB,KAAK;AAAA,MAC7C,GAAG,QAAQ;AAAA,MACX,UAAU;AAAA,MACV,QAAQ,QAAQ;AAAA,MAChB,eAAe,QAAQ;AAAA,IACxB,CAAC;AAAA,aACQ,QAAQ,YAAa,MAAK,cAAc,KAAK;AAAA,MACrD,GAAG,QAAQ;AAAA,MACX,UAAU;AAAA,IACX,CAAC;AAAA,QACI,MAAK,cAAc,GAAG,IAAI;AAAA,EAChC;AAAA,EACA,YAAY,QAAQE,WAAU,KAAK;AAClC,SAAK,UAAU,UAAUA,SAAQ;AACjC,UAAM,QAAQ,KAAK,UAAU,IAAIA,SAAQ;AACzC,QAAI,CAAC,IAAK,OAAM,cAAcA,WAAU,KAAK;AAC7C,SAAK,cAAc,IAAI,MAAM,EAAE,KAAK,GAAG;AACvC,WAAO;AAAA,MACN;AAAA,MACA;AAAA,IACD;AAAA,EACD;AAAA,EACA,oBAAoB,SAAS;AAC5B,UAAM,EAAE,QAAQ,UAAU,eAAe,MAAM,IAAI;AACnD,UAAM,SAAS,qBAAqB,OAAO,EAAE,oBAAoB,CAAC,EAAE,CAAC;AACrE,UAAM,SAAS,KAAK,0BAA0B,MAAM;AACpD,QAAI,CAAC,QAAQ;AACZ,YAAM,UAAU,OAAO,IAAI,CAAC,MAAM,KAAK,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,MAAM,GAAG,EAAE,SAAS,KAAK,EAAE,MAAM,MAAM,EAAE,EAAE,EAAE,KAAK,IAAI;AACnH,YAAM,IAAI,MAAM;AAAA,EAAsE,OAAO,EAAE;AAAA,IAChG;AACA,UAAM,QAAQ,KAAK,YAAY,oBAAoB,MAAM,KAAK;AAI9D,UAAM;AAEN,UAAM,yBAAyB,KAAK,sBAAsB,OAAO,CAAC,MAAM,oBAAoB,GAAG,KAAK,CAAC;AACrG,QAAI,uBAAuB,SAAS,GAAG;AAEtC,WAAK,mBAAmB,KAAK,iBAAiB,OAAO,CAAC,MAAM,CAAC,oBAAoB,GAAG,KAAK,CAAC;AAC1F,YAAM,oBAAoB,uBAAuB,KAAK,CAAC,MAAM,EAAE,aAAa,QAAQ;AACpF,UAAI,kBAAmB,OAAM,OAAO,OAAuB,oBAAI,MAAM,GAAG,aAAa,iEAAiE,GAAG;AAAA,QACxJ,QAAQ;AAAA,QACR,UAAU,kBAAkB;AAAA,MAC7B,CAAC;AAAA,IACF;AACA,SAAK,sBAAsB,KAAK;AAAA,MAC/B,GAAG;AAAA,MACH;AAAA,MACA;AAAA,IACD,CAAC;AACD,WAAO;AAAA,EACR;AAAA,EACA,WAAW,MAAM;AAQhB,QAAI,KAAK,eAAe,KAAK,oBAAoB,UAAU,CAAC,KAAK,eAAe,CAAC,KAAK,yBAAyB,KAAK,oBAAoB,SAAS,KAAK,oBAAoB,QAAQ;AACjL,UAAI,KAAK,oBAAoB,MAAO,KAAI,CAAC,KAAK,MAAM;AACnD,YAAI,KAAK,YAAa,MAAK,QAAQ,UAAU,KAAK,MAAM;AAAA,YACnD,MAAK,MAAM,UAAU,KAAK,MAAM;AACrC,aAAK,aAAa,KAAK,KAAK,KAAK,UAAU;AAAA,UAC1C,OAAO,KAAK;AAAA,UACZ,QAAQ,KAAK;AAAA,UACb,aAAa,KAAK;AAAA,UAClB,eAAe,KAAK;AAAA,QACrB,CAAC;AAAA,MACF,MAAO,MAAK,QAAQ,UAAU,KAAK,MAAM;AAAA,WACpC;AACJ,aAAK,aAAa,KAAK,KAAK,KAAK,UAAU;AAAA,UAC1C,OAAO,KAAK;AAAA,UACZ,QAAQ,KAAK;AAAA,UACb,aAAa,KAAK;AAAA,UAClB,eAAe,KAAK;AAAA,QACrB,CAAC;AACD,aAAK,MAAM,UAAU,KAAK,MAAM;AAAA,MACjC;AACA,aAAO;AAAA,QACN,QAAQ;AAAA,QACR,OAAO,KAAK;AAAA,QACZ,UAAU;AAAA,QACV,KAAK,KAAK;AAAA,QACV,MAAM;AAAA,MACP;AAAA,IACD,WAAW,CAAC,KAAK,MAAM;AACtB,WAAK,UAAU,UAAU,KAAK,MAAM;AACpC,aAAO;AAAA,QACN,QAAQ,KAAK;AAAA,QACb,OAAO,KAAK;AAAA,QACZ,UAAU,KAAK;AAAA,QACf,KAAK,KAAK;AAAA,QACV,MAAM;AAAA,MACP;AAAA,IACD,OAAO;AACN,WAAK,QAAQ,UAAU,KAAK,MAAM;AAClC,aAAO;AAAA,QACN,QAAQ;AAAA,QACR,OAAO,KAAK;AAAA,QACZ,UAAU;AAAA,QACV,KAAK,KAAK;AAAA,QACV,MAAM;AAAA,MACP;AAAA,IACD;AAAA,EACD;AAAA,EACA,MAAM,OAAO;AACZ,UAAM,uBAAuB,OAAO,KAAK,KAAK,aAAa,EAAE;AAC7D,UAAM,qBAAqB,KAAK,iBAAiB;AACjD,UAAM,kBAAkB,KAAK,cAAc;AAC3C,UAAM,UAAU,CAAC,wBAAwB,CAAC,sBAAsB,CAAC;AACjE,UAAM,SAAS;AAAA,MACd,SAAS;AAAA,MACT,OAAO;AAAA,IACR;AACA,SAAK,KAAK,UAAU,KAAK,eAAe,SAAS,CAAC,SAAS;AAC1D,UAAI,sBAAsB;AACzB,cAAM,iBAAiB,KAAK,cAAc,KAAK,eAAe,KAAK,YAAY;AAC/E,aAAK,cAAc;AAAA,MACpB;AACA,UAAI,mBAAoB,OAAM,oBAAoB,KAAK,cAAc,KAAK,gBAAgB;AAC1F,UAAI,gBAAiB,OAAM,iBAAiB,KAAK,cAAc,KAAK,aAAa;AACjF,aAAO,QAAQ;AAAA,IAChB,WAAW,CAAC,wBAAwB,KAAK,aAAa;AACrD,UAAI,KAAK,oBAAoB,OAAO;AACnC,cAAM,KAAK,aAAa,mBAAmB,KAAK,YAAY;AAC5D,aAAK,cAAc;AAAA,MACpB;AACA,aAAO,UAAU;AAAA,IAClB;AACA,WAAO;AAAA,EACR;AAAA,EACA,oBAAoB;AACnB,WAAO,KAAK,eAAe,QAAQ;AAAA,EACpC;AAAA,EACA,mBAAmB;AAClB,WAAO,MAAM,KAAK,KAAK,cAAc;AAAA,EACtC;AAAA,EACA,sBAAsB;AACrB,QAAI,KAAK,oBAAoB,SAAS,KAAK,eAAe,MAAM;AAC/D,WAAK,SAAS;AACd,WAAK,eAAe,QAAQ,CAAC,QAAQ,OAAO,KAAK,cAAc,GAAG,CAAC;AACnE,WAAK,eAAe,MAAM;AAAA,IAC3B;AAAA,EACD;AAAA,EACA,sBAAsB,SAAS;AAC9B,UAAM,QAAQ,KAAK,UAAU,IAAI,QAAQ,QAAQ,IAAI;AACrD,UAAM,MAAM,cAAc,QAAQ,UAAU,KAAK;AACjD,WAAO;AAAA,MACN;AAAA,MACA;AAAA,MACA,MAAM,SAAS,WAAW,QAAQ,iBAAiB,KAAK,cAAc,GAAG;AAAA,MACzE,eAAe,MAAM;AACpB,aAAK,UAAU,UAAU,QAAQ,QAAQ;AACzC,aAAK,cAAc,IAAI,QAAQ,MAAM,EAAE,KAAK,GAAG;AAC/C,aAAK,eAAe,OAAO,GAAG;AAAA,MAC/B;AAAA,IACD;AAAA,EACD;AAAA,EACA,MAAM,EAAE,QAAQ,UAAAA,WAAU,UAAU,KAAK,gBAAgB,UAAU,OAAO,aAAa,cAAc,GAAG;AACvG,UAAM,WAAW,KAAK,YAAY,QAAQA,WAAU,GAAG;AACvD,UAAM,SAAS;AACf,UAAM,QAAQ,SAAS;AAIvB,QAAI,EAAE,YAAY,KAAK,cAAc,GAAG,MAAM,QAAS,MAAK,eAAe,OAAO,GAAG;AACrF,QAAI,qBAAqB,eAAe,OAAO,aAAa,WAAW,WAAWE,WAAU,UAAU,QAAQ,KAAK,eAAe;AAClI,QAAI,CAAC,YAAa,sBAAqB,mBAAmB,kBAAkB;AAC5E,QAAI,aAAa;AAEhB,UAAI,YAAY,WAAW,OAAO,KAAK,YAAY,OAAO,KAAK,CAAC,OAAO,KAAK,kBAAkB,EAAG,aAAY,UAAU,kBAAkB,YAAY,OAAO;AAAA,IAC7J;AACA,UAAM,WAAW,WAAW,iBAAiB,cAAc,YAAY,UAAU,KAAK,cAAc,GAAG;AACvG,UAAM,kBAAkB,cAAc,WAAW,UAAU,KAAK;AAChE,UAAM,OAAO,qBAAqB,cAAc,qBAAqB,mBAAmB,KAAK;AAC7F,UAAM,cAAc,aAAa;AACjC,UAAM,sBAAsB,YAAY,KAAK,eAAe,eAAe,YAAY,WAAW;AAClG,QAAI,QAAQ,CAAC,YAAY,CAAC;AAO1B,WAAK,cAAc,GAAG,IAAI;AAC1B,UAAM,QAAQ,WAAW,KAAK,oBAAoB;AAAA,MACjD;AAAA,MACA,UAAU;AAAA,MACV,eAAe,iBAAiB;AAAA,MAChC,OAAO,SAAyB,oBAAI,MAAM,UAAU;AAAA,IACrD,CAAC,IAAI;AACL,WAAO,KAAK,WAAW;AAAA,MACtB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,qBAAqB,CAAC,CAAC;AAAA,MACvB,UAAU;AAAA,MACV,eAAe,cAAc,qBAAqB,sBAAsB,kBAAkB;AAAA,MAC1F,iBAAiB,oBAAoB,SAAS,cAAc,kBAAkB,sBAAsB,eAAe,IAAI;AAAA,MACvH;AAAA,MACA;AAAA,MACA;AAAA,IACD,CAAC;AAAA,EACF;AAAA,EACA,sBAAsB,EAAE,QAAQ,UAAU,kBAAkB,aAAa,UAAU,OAAO,cAAc,GAAG;AAC1G,UAAM,QAAQ,WAAW,KAAK,oBAAoB;AAAA,MACjD;AAAA,MACA,UAAU;AAAA,MACV;AAAA,MACA,OAAO,SAAyB,oBAAI,MAAM,mBAAmB;AAAA,IAC9D,CAAC,IAAI;AACL,UAAM,iBAAiB,aAAa,YAAY;AAChD,UAAM,mBAAmB,aAAa,YAAY,iBAAiB;AACnE,WAAO,KAAK,WAAW;AAAA,MACtB;AAAA,MACA,KAAK,iBAAiB;AAAA,MACtB,OAAO,iBAAiB;AAAA,MACxB,MAAM,aAAa,QAAQ;AAAA,MAC3B,aAAa,iBAAiB,SAAS;AAAA,MACvC,qBAAqB,WAAW,OAAO,KAAK;AAAA,MAC5C,UAAU;AAAA,MACV,eAAe,sBAAsB,cAAc;AAAA,MACnD,iBAAiB,qBAAqB,SAAS,sBAAsB,gBAAgB,IAAI;AAAA,MACzF;AAAA,MACA;AAAA,IACD,CAAC;AAAA,EACF;AAAA,EACA,MAAM,OAAO;AACZ,UAAM,WAAW;AAAA,MAChB,UAAU,KAAK;AAAA,MACf,OAAO;AAAA,MACP,aAAa;AAAA,MACb,SAAS;AAAA,MACT,WAAW;AAAA,MACX,eAAe,CAAC;AAAA,MAChB,WAAW;AAAA,MACX,SAAS;AAAA,IACV;AACA,UAAM,iBAAiB,KAAK,kBAAkB;AAC9C,UAAM,gBAAgB,KAAK,iBAAiB;AAC5C,QAAI,eAAgB,MAAK,oBAAoB;AAC7C,UAAM,SAAS,MAAM,KAAK,KAAK;AAC/B,aAAS,cAAc,OAAO;AAC9B,aAAS,QAAQ,KAAK,MAAM,MAAM;AAClC,aAAS,UAAU,KAAK,QAAQ,MAAM;AACtC,aAAS,YAAY,KAAK,UAAU,MAAM;AAC1C,aAAS,UAAU,KAAK,QAAQ,MAAM;AACtC,aAAS,YAAY,CAAC,OAAO,UAAU,iBAAiB;AACxD,aAAS,gBAAgB,MAAM,KAAK,aAAa;AACjD,WAAO;AAAA,EACR;AACD;AAEA,SAAS,oBAAoB,SAAS,QAAQ,QAAQ,UAAU;AAC/D,QAAM,QAAQ,IAAI,MAAM,OAAO;AAC/B,SAAO,eAAe,OAAO,UAAU;AAAA,IACtC,OAAO;AAAA,IACP,YAAY;AAAA,IACZ,cAAc;AAAA,IACd,UAAU;AAAA,EACX,CAAC;AACD,SAAO,eAAe,OAAO,YAAY;AAAA,IACxC,OAAO;AAAA,IACP,YAAY;AAAA,IACZ,cAAc;AAAA,IACd,UAAU;AAAA,EACX,CAAC;AACD,SAAO,eAAe,OAAO,eAAe,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;AACjE,SAAO;AACR;AACA,IAAM,iBAAN,MAAqB;AAAA,EACpB;AAAA,EACA,mBAAmC,oBAAI,IAAI;AAAA,EAC3C,YAAY,UAAU,CAAC,GAAG;AACzB,SAAK,UAAU;AAAA,EAChB;AAAA,EACA,MAAM,MAAM,UAAU,SAAS;AAC9B,QAAI,KAAK,iBAAiB,IAAI,QAAQ,EAAG;AACzC,SAAK,iBAAiB,IAAI,UAAU,MAAM,cAAc,OAAO,UAAU,OAAO,CAAC;AAAA,EAClF;AAAA,EACA,MAAM,OAAO,UAAU;AACtB,UAAM,SAAS,MAAM,KAAK,iBAAiB,QAAQ,EAAE,KAAK;AAC1D,SAAK,iBAAiB,OAAO,QAAQ;AACrC,WAAO;AAAA,EACR;AAAA,EACA,SAAS,UAAUF,WAAU;AAC5B,SAAK,iBAAiB,QAAQ,EAAE,8BAA8BA,SAAQ;AAAA,EACvE;AAAA,EACA,UAAU,UAAU,QAAQ;AAC3B,SAAK,iBAAiB,QAAQ,EAAE,UAAU,MAAM;AAAA,EACjD;AAAA,EACA,iBAAiB,UAAU;AAC1B,UAAM,QAAQ,KAAK,iBAAiB,IAAI,QAAQ;AAChD,QAAI,CAAC,MAAO,OAAM,IAAI,MAAM,2BAA2B,QAAQ,wDAAwD;AACvH,WAAO;AAAA,EACR;AAAA,EACA,MAAM,SAAS;AACd,UAAM,EAAE,UAAU,MAAM,SAAS,MAAM,SAAS,WAAW,OAAO,YAAY,gBAAgB,OAAO,cAAc,aAAa,cAAc,IAAI;AAClJ,QAAI,EAAE,SAAS,IAAI;AACnB,QAAI,CAAC,SAAU,OAAM,IAAI,MAAM,yCAAyC;AACxE,UAAM,gBAAgB,KAAK,iBAAiB,QAAQ;AACpD,QAAI,aAAa,SAAS,cAAc;AAIxC,YAAM,IAAI,MAAM,qEAAqE,YAAY,IAAI,EAAE;AACvG,UAAMA,YAAW,CAAC,MAAM,GAAG,UAAU,CAAC,OAAO,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK;AAE/D,UAAM,mBAAmB,cAAc,sBAAsB;AAAA,MAC5D,UAAAA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACD,CAAC;AACD,QAAI,OAAO,eAAe,UAAU;AACnC,UAAI,OAAO,aAAa,YAAY,CAAC,UAAU;AAC9C,yBAAiB,cAAc;AAC/B,cAAM,IAAI,MAAM,kEAAkE;AAAA,MACnF;AACA,UAAI;AACJ,UAAI;AACH,yBAAiB,KAAK,QAAQ,UAAU,UAAU,UAAU,KAAK;AAAA,MAClE,SAAS,KAAK;AACb,yBAAiB,cAAc;AAC/B,cAAM;AAAA,MACP;AACA,UAAI,CAAC,gBAAgB;AACpB,yBAAiB,cAAc;AAC/B,eAAO;AAAA,UACN,MAAM;AAAA,UACN,SAAS,MAAM,gBAAgB;AAAA,UAC/B,QAAQ;AAAA,UACR,UAAU;AAAA,QACX;AAAA,MACD;AACA,iBAAW,kBAAkB,UAAU,UAAU;AAAA,IAClD;AACA,UAAM,EAAE,QAAQ,UAAU,KAAK,KAAK,IAAI,cAAc,MAAM;AAAA,MAC3D;AAAA,MACA,UAAAA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACD,CAAC;AACD,WAAO;AAAA,MACN;AAAA,MACA,SAAS,MAAM,cAAc,OAAO,SAAS;AAAA,MAC7C,QAAQ,cAAc,SAAS,QAAQ,KAAK;AAAA,MAC5C,UAAU,cAAc,WAAW,UAAU,KAAK;AAAA,IACnD;AAAA,EACD;AAAA,EACA,OAAO,SAAS;AACf,UAAM,SAAS,KAAK,MAAM,OAAO;AACjC,QAAI,CAAC,OAAO,MAAM;AACjB,YAAM,gBAAgB,KAAK,iBAAiB,QAAQ,QAAQ;AAC5D,YAAM,oBAAoB,OAAO,QAAQ,GAAG,cAAc,QAAQ,OAAO,QAAQ,OAAO,QAAQ;AAAA,IACjG;AAAA,EACD;AAAA,EACA,YAAY,SAAS;AACpB,UAAM,EAAE,UAAU,UAAU,MAAM,SAAS,MAAM,SAAS,SAAS,WAAW,OAAO,gBAAgB,MAAM,IAAI;AAC/G,QAAI,CAAC,SAAU,OAAM,IAAI,MAAM,yCAAyC;AACxE,UAAM,WAAW,QAAQ,QAAQ,QAAQ;AACzC,UAAM,WAAW,QAAQ,OAAO,QAAQ;AACxC,UAAM,gBAAgB,KAAK,iBAAiB,QAAQ;AACpD,UAAMA,YAAW,CAAC,MAAM,GAAG,UAAU,CAAC,OAAO,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK;AAC/D,UAAM,mBAAmB,cAAc,sBAAsB;AAAA,MAC5D,UAAAA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACD,CAAC;AACD,qBAAiB,cAAc;AAC/B,UAAM,cAAc,iBAAiB,SAAS,SAAS,QAAQ,MAAM,UAAU,QAAQ,cAAc,iBAAiB,IAAI,CAAC,IAAI;AAC/H,UAAM,EAAE,QAAQ,UAAU,KAAK,KAAK,IAAI,cAAc,sBAAsB;AAAA,MAC3E;AAAA,MACA,UAAU;AAAA,MACV;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,eAAe,QAAQ;AAAA,IACxB,CAAC;AACD,WAAO;AAAA,MACN;AAAA,MACA,SAAS,MAAM,cAAc,GAAG;AAAA,MAChC,QAAQ,QAAQ,KAAK;AAAA,MACrB,UAAU,UAAU,KAAK;AAAA,IAC1B;AAAA,EACD;AAAA,EACA,MAAM,gBAAgB,SAAS;AAC9B,UAAM,EAAE,MAAM,UAAU,MAAM,SAAS,MAAM,SAAS,SAAS,WAAW,OAAO,gBAAgB,OAAO,UAAU,KAAK,WAAW,GAAG,IAAI;AACzI,QAAI,CAAC,SAAU,OAAM,IAAI,MAAM,yCAAyC;AACxE,UAAM,gBAAgB,KAAK,iBAAiB,QAAQ;AACpD,UAAMA,YAAW,CAAC,MAAM,GAAG,UAAU,CAAC,OAAO,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK;AAC/D,UAAM,mBAAmB,cAAc,sBAAsB;AAAA,MAC5D,UAAAA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACD,CAAC;AACD,UAAM,YAAY,iBAAiB,SAAS,UAAU,cAAc,wBAAwB,QAAQ,QAAQ,cAAc,iBAAiB,IAAI,IAAI;AACnJ,UAAM,oBAAoB,IAAI,gBAAgB;AAC9C,UAAM,eAAe,MAAM,kBAAkB;AAAA,MAC5C;AAAA,MACA,MAAM,MAAM,KAAK,EAAE,QAAQ,kBAAkB,OAAO,CAAC;AAAA,MACrD;AAAA,MACA,UAAU,UAAU,IAAI,IAAI,QAAQ,CAAC,MAAM,WAAW,MAAM;AAC3D,0BAAkB,MAAM;AACxB,UAAE;AAAA,MACH,GAAG,OAAO,CAAC,IAAI;AAAA,MACf,OAAO,YAAY,CAAC,aAAa,QAAQ,MAAM,UAAU,SAAS,EAAE,OAAO;AAAA,IAC5E,CAAC;AACD,qBAAiB,cAAc;AAC/B,QAAI,cAAc,aAAa,QAAQ;AAGtC,UAAI,cAAc,cAAe,OAAM,aAAa;AACpD,aAAO;AAAA,QACN,MAAM;AAAA,QACN,SAAS,MAAM;AAAA,MAChB;AAAA,IACD;AAIA,UAAM,cAAc,iBAAiB,SAAS,SAAS,QAAQ,MAAM,aAAa,UAAU,QAAQ,cAAc,iBAAiB,IAAI,CAAC,IAAI;AAC5I,UAAM,EAAE,QAAQ,UAAU,KAAK,KAAK,IAAI,cAAc,sBAAsB;AAAA,MAC3E;AAAA,MACA,UAAU,aAAa;AAAA,MACvB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,eAAe,QAAQ;AAAA,IACxB,CAAC;AACD,WAAO;AAAA,MACN;AAAA,MACA,SAAS,MAAM,cAAc,GAAG;AAAA,MAChC,QAAQ,QAAQ,KAAK;AAAA,MACrB,UAAU,UAAU,KAAK;AAAA,IAC1B;AAAA,EACD;AAAA,EACA,MAAM,UAAU,SAAS;AACxB,QAAI,CAAC,QAAQ,YAAa,OAAM,IAAI,MAAM,0BAA0B;AACpE,UAAM,EAAE,UAAU,YAAY,IAAI;AAClC,QAAI,YAAY,WAAW,MAAM;AAChC,UAAI,CAAC,SAAU,OAAM,IAAI,MAAM,yCAAyC;AACxE,YAAM,gBAAgB,KAAK,iBAAiB,QAAQ;AAEpD,cAAQ,aAAa;AAErB,kBAAY,OAAO,MAAM,cAAc,YAAY,eAAe,UAAU,YAAY,IAAI;AAC5F,kBAAY,UAAU,MAAM,cAAc,YAAY,iBAAiB,YAAY,IAAI,KAAK;AAAA,IAC7F;AACA,WAAO,KAAK,OAAO,OAAO;AAAA,EAC3B;AAAA,EACA,QAAQ;AACP,SAAK,iBAAiB,MAAM;AAAA,EAC7B;AACD;AAWA,eAAe,kBAAkB,EAAE,SAAS,MAAM,UAAU,UAAU,MAAM,GAAG;AAC9E,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,SAAO,MAAM;AACZ,QAAI;AACH,YAAM,aAAa,MAAM,WAAW,QAAQ,QAAQ,KAAK,CAAC,GAAG,QAAQ;AACrE,UAAI,CAAC,WAAW,GAAI;AACpB,YAAM,WAAW,QAAQ,QAAQ,WAAW,KAAK;AACjD,YAAM,WAAW,QAAQ,OAAO,QAAQ;AACxC,UAAI,iBAAiB,UAAU,aAAa,cAAc;AACzD,qBAAa;AAAA,UACZ;AAAA,UACA;AAAA,QACD;AACA,YAAI,CAAC,SAAS,MAAM,QAAQ,EAAG;AAAA,MAChC,OAAO;AACN,uBAAe;AACf,qBAAa;AAAA,MACd;AAAA,IACD,SAAS,WAAW;AAEnB,qBAAe;AACf,mBAAa;AACb,sBAAgB;AAAA,IACjB;AACA,QAAI,EAAE,MAAM,WAAW,IAAI,QAAQ,CAAC,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,QAAQ,GAAG,GAAI;AAAA,EACpF;AACA,SAAO;AAAA,IACN,GAAG;AAAA,IACH;AAAA,EACD;AACD;AAEA,SAAS,WAAW,SAAS,OAAO;AACnC,QAAM,OAAO,QAAQ,KAAK,CAAC,WAAW;AAAA,IACrC,IAAI;AAAA,IACJ;AAAA,EACD,EAAE;AACF,MAAI,CAAC,MAAO,QAAO;AACnB,SAAO,QAAQ,KAAK,CAAC,MAAM,MAAM,KAAK,CAAC,WAAW;AAAA,IACjD,IAAI;AAAA,IACJ;AAAA,EACD,EAAE,CAAC,CAAC;AACL;AAEA,IAAM,sBAAsB,CAAC,MAAM,UAAU;AAC5C,WAAS,YAAY,MAAM,YAAY;AACtC,UAAM,YAAY,KAAK,UAAU,WAAW,MAAM,WAAW;AAC5D,YAAM,aAAa,KAAK,UAAU,UAAU,UAAU;AACtD,UAAI,CAAC,WAAY,OAAM,IAAI,MAAM,sBAAsB,OAAO,UAAU,CAAC,mEAAmE;AAC5I,aAAO,WAAW,KAAK,IAAI;AAAA,IAC5B,CAAC;AAAA,EACF;AACA,WAAS,oBAAoB,MAAM,eAAe,MAAM;AACvD,UAAM,YAAY,KAAK,UAAU,WAAW,MAAM,WAAW;AAC5D,YAAM,aAAa,KAAK,UAAU,UAAU,UAAU;AACtD,UAAI,CAAC,WAAY,OAAM,IAAI,MAAM,sBAAsB,OAAO,UAAU,CAAC,mEAAmE;AAC5I,aAAO,WAAW,KAAK,MAAM,GAAG,IAAI;AAAA,IACrC,CAAC;AAAA,EACF;AACA,WAAS,UAAU,MAAM,YAAY;AACpC,UAAM,UAAU,KAAK,UAAU,WAAW,MAAM,YAAY,MAAM;AACjE,YAAM,aAAa,KAAK,UAAU,UAAU,UAAU;AACtD,UAAI,CAAC,WAAY,OAAM,IAAI,MAAM,sBAAsB,OAAO,UAAU,CAAC,mEAAmE;AAC5I,aAAO,WAAW,KAAK,MAAM,GAAG,IAAI;AAAA,IACrC,CAAC;AAAA,EACF;AAGA,cAAY,UAAU,kBAAkB;AACxC,cAAY,cAAc,sBAAsB;AAChD,sBAAoB,eAAe,yBAAyB,CAAC;AAC7D,sBAAoB,gBAAgB,yBAAyB,CAAC;AAC9D,YAAU,aAAa,uBAAuB;AAC9C,YAAU,cAAc,sBAAsB;AAC9C,YAAU,kBAAkB,iCAAiC;AAC7D,YAAU,kBAAkB,0BAA0B;AACtD,YAAU,iBAAiB,yBAAyB;AACpD,YAAU,YAAY,gBAAgB;AACtC,YAAU,gBAAgB,oBAAoB;AAC9C,YAAU,iBAAiB,qBAAqB;AAChD,YAAU,oBAAoB,wBAAwB;AACtD,YAAU,mBAAmB,uBAAuB;AACpD,YAAU,gBAAgB,wBAAwB;AAClD,YAAU,eAAe,uBAAuB;AAGjD;AAEA,IAAM,kBAAkB,uBAAO,IAAI,iBAAiB;AACpD,IAAM,uBAAuB,uBAAO,IAAI,wBAAwB;AAChE,IAAM,gBAAgB,uBAAO,IAAI,eAAe;AAChD,IAAM,6BAA6B,uBAAO,IAAI,4BAA4B;AAG1E,IAAM,iBAAiB;AAAA,EACtB,UAAU,QAAQ,UAAU,SAAS;AACpC,UAAM,EAAE,eAAAK,gBAAe,eAAAC,gBAAe,aAAAC,aAAY,IAAI,KAAK;AAC3D,UAAM,OAAO,SAAS,MAAM;AAC5B,WAAO;AAAA,MACN;AAAA,MACA,SAAS,MAAM,OAAO,GACvBA,aAAY,kBAAkB,YAAY,EAAE,CAAC;AAAA;AAAA;AAAA,EAG7C,WAAWD,eAAc,QAAQ,CAAC;AAAA;AAAA,EAElCD,eAAc,MAAM,CAAC,KAAK,GAC1BE,aAAY,cAAc,YAAY,EAAE,CAAC;AAAA;AAAA;AAAA,EAGzC,WAAWD,eAAc,QAAQ,CAAC;AAAA;AAAA;AAAA,EAGlCD,eAAc,MAAM,CAAC;AAAA,IACrB;AAAA,EACD;AAAA,EACA,UAAU,QAAQ,UAAU;AAC3B,UAAM,EAAE,QAAAG,SAAQ,cAAc,IAAI;AAClC,UAAM,EAAE,eAAAH,gBAAe,eAAAC,gBAAe,aAAAC,aAAY,IAAI,KAAK;AAC3D,QAAI;AACJ,QAAI,MAAM,QAAQ,QAAQ,EAAG,QAAO,SAAS,WAAW,KAAK,SAAS,KAAK,CAAC,SAASC,QAAO,MAAM,QAAQ,aAAa,CAAC;AAAA,aAC/G,oBAAoB,IAAK,QAAO,SAAS,SAAS,KAAK,SAAS,IAAI,MAAM,KAAK,CAAC,GAAG,QAAQ,EAAE,KAAK,CAAC,SAASA,QAAO,MAAM,QAAQ,aAAa,CAAC;AAAA,QACnJ,OAAM,IAAI,UAAU,uCAAuCD,aAAY,YAAY,CAAC,UAAU,OAAO,QAAQ,IAAI;AACtH,WAAO;AAAA,MACN;AAAA,MACA,SAAS,MAAM,OAAO,GACvBA,aAAY,kBAAkB,YAAY,EAAE,CAAC;AAAA;AAAA;AAAA,EAG7CD,eAAc,QAAQ,CAAC;AAAA;AAAA,EAEvBD,eAAc,MAAM,CAAC,KAAK,GAC1BE,aAAY,cAAc,YAAY,EAAE,CAAC;AAAA;AAAA;AAAA,EAGzCD,eAAc,QAAQ,CAAC;AAAA;AAAA;AAAA,EAGvBD,eAAc,MAAM,CAAC;AAAA,IACrB;AAAA,EACD;AACD;AAEA,IAAM,iBAAiB,EAAE;AACzB,IAAM,iBAAiB,EAAE;AACzB,IAAM,iBAAiB,EAAE;AACzB,IAAM,cAAc,EAAE;AACtB,IAAM,YAAY,EAAE;AACpB,SAAS,YAAY,aAAa,WAAW,YAAY,WAAW,YAAY,UAAU,CAAC,GAAG;AAC7F,QAAM,EAAE,UAAU,IAAI,qBAAqB,OAAO,QAAQ,OAAO,UAAU,IAAI,iBAAiB,IAAI,gBAAgB,gBAAgB,gBAAgB,gBAAgB,sBAAsB,eAAe,IAAI;AAC7M,MAAI,OAAO;AACX,MAAI,YAAY;AAChB,MAAI,CAAC,sBAAsB,aAAa,IAAI;AAC3C,YAAQ,UAAU,GAAG,SAAS,GAAG,IAAI,cAAc,QAAQ;AAC3D,gBAAY;AAAA,EACb;AACA,MAAI,YAAY,IAAI;AACnB,YAAQ,UAAU,GAAG,SAAS,GAAG,IAAI;AACrC,gBAAY;AAAA,EACb;AACA,MAAI,OAAO;AACV,YAAQ,GAAG,UAAU,GAAG,SAAS,GAAG,CAAC;AACrC,gBAAY;AAAA,EACb;AACA,MAAI,YAAY,SAAS,GAAG;AAG5B,iBAAa;AAAA,OACR;AAEJ,YAAQ,UAAU,GAAG,SAAS,GAAG,IAAI;AACrC,gBAAY;AAAA,EACb;AACA,MAAI,aAAa,GAAI,cAAa;AAAA,OAC7B;AACJ,YAAQ,UAAU,GAAG,SAAS,GAAG,IAAI,cAAc,QAAQ;AAC3D,QAAI,eAAgB,SAAQ,UAAU,IAAI,IAAI,oBAAoB,cAAc;AAChF,gBAAY;AAAA,EACb;AACA,MAAI,YAAY,GAAI,cAAa,OAAO,OAAO;AAC/C,MAAI,cAAc,GAAI,SAAQ,UAAU,SAAS;AACjD,SAAO;AACR;AACA,IAAMI,gBAAe;AAGrB,SAASC,uBAAsB,MAAM;AACpC,SAAO,KAAK,QAAQ,UAAU,CAAC,WAAWD,cAAa,OAAO,OAAO,MAAM,CAAC;AAC7E;AACA,SAASJ,eAAcM,SAAQ;AAC9B,SAAO,eAAeD,uBAAsB,UAAUC,OAAM,CAAC,CAAC;AAC/D;AACA,SAASL,eAAc,OAAO;AAC7B,SAAO,eAAeI,uBAAsB,UAAU,KAAK,CAAC,CAAC;AAC9D;AACA,SAAS,kBAAkB;AAC1B,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,eAAAL;AAAA,IACA,eAAAC;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACD;AACA,SAAS,cAAc,MAAM,OAAO,OAAO;AAC1C,QAAMM,QAAOC,SAAQ,KAAK;AAC1B,UAAQD,UAAS,UAAUA,UAAS,cAAc,GAAG,IAAI,eAAeA,KAAI;AAAA,IAAO,MAAM,GAAG,IAAI,eAAe,MAAM,KAAK,CAAC;AAC5H;AACA,SAAS,yBAAyB,YAAY;AAC7C,MAAI,CAAC,MAAM,QAAQ,UAAU,EAAG,OAAM,IAAI,UAAU,gFAAgFC,SAAQ,UAAU,CAAC,GAAG;AAC1J,aAAW,oBAAoB,EAAE,sBAAsB,KAAK,GAAG,UAAU;AAC1E;AACA,SAAS,2BAA2B;AACnC,SAAO,WAAW,oBAAoB,EAAE;AACzC;AAGA,SAAS,OAAOjB,IAAGC,IAAG,eAAe,aAAa;AACjD,kBAAgB,iBAAiB,CAAC;AAClC,SAAO,GAAGD,IAAGC,IAAG,CAAC,GAAG,CAAC,GAAG,eAAe,cAAc,SAAS,aAAa;AAC5E;AACA,SAAS,aAAa,KAAK;AAC1B,SAAO,CAAC,CAAC,OAAO,OAAO,QAAQ,YAAY,qBAAqB,OAAO,IAAI,YAAY,IAAI,eAAe;AAC3G;AACA,SAAS,gBAAgBD,IAAGC,IAAG,eAAe;AAC7C,QAAM,cAAc,aAAaD,EAAC;AAClC,QAAM,cAAc,aAAaC,EAAC;AAClC,MAAI,eAAe,YAAa;AAEhC,QAAM,UAAU,cAAc,OAAO,CAAC,WAAW,CAAC,uBAAuB,MAAM,CAAC;AAChF,MAAI,YAAa,QAAOD,GAAE,gBAAgBC,IAAG,OAAO;AACpD,MAAI,YAAa,QAAOA,GAAE,gBAAgBD,IAAG,OAAO;AACrD;AAEA,SAAS,QAAQ,OAAO;AACvB,MAAI,OAAO,MAAM,YAAY,WAAY,QAAO,MAAM,QAAQ,KAAK;AACnE,UAAQ,OAAO,UAAU,SAAS,KAAK,KAAK,GAAG;AAAA,IAC9C,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAyB,aAAO;AAAA,IACrC;AAAS,aAAO,iBAAiB;AAAA,EAClC;AACD;AAGA,SAAS,GAAGA,IAAGC,IAAG,QAAQ,QAAQ,eAAeiB,SAAQ;AACxD,MAAI,SAAS;AACb,QAAM,mBAAmB,gBAAgBlB,IAAGC,IAAG,aAAa;AAC5D,MAAI,qBAAqB,OAAQ,QAAO;AACxC,QAAM,gBAAgB,EAAE,OAAO;AAC/B,WAASC,KAAI,GAAGA,KAAI,cAAc,QAAQA,MAAK;AAC9C,UAAM,qBAAqB,cAAcA,EAAC,EAAE,KAAK,eAAeF,IAAGC,IAAG,aAAa;AACnF,QAAI,uBAAuB,OAAQ,QAAO;AAAA,EAC3C;AACA,MAAI,OAAO,QAAQ,cAAcD,cAAa,OAAOC,cAAa,IAAK,QAAOD,GAAE,SAASC,GAAE;AAC3F,MAAI,OAAO,GAAGD,IAAGC,EAAC,EAAG,QAAO;AAE5B,MAAID,OAAM,QAAQC,OAAM,KAAM,QAAOD,OAAMC;AAC3C,QAAM,YAAY,OAAO,UAAU,SAAS,KAAKD,EAAC;AAClD,MAAI,cAAc,OAAO,UAAU,SAAS,KAAKC,EAAC,EAAG,QAAO;AAC5D,UAAQ,WAAW;AAAA,IAClB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAmB,UAAI,OAAOD,OAAM,OAAOC;AAEhD,eAAO;AAAA,eACE,OAAOD,OAAM,YAAY,OAAOC,OAAM;AAE/C,eAAO,OAAO,GAAGD,IAAGC,EAAC;AAAA;AAGrB,eAAO,OAAO,GAAGD,GAAE,QAAQ,GAAGC,GAAE,QAAQ,CAAC;AAAA,IACzC,KAAK,iBAAiB;AACrB,YAAM,OAAO,CAACD;AACd,YAAM,OAAO,CAACC;AAId,aAAO,SAAS,QAAQ,OAAO,MAAM,IAAI,KAAK,OAAO,MAAM,IAAI;AAAA,IAChE;AAAA;AAAA,IAEA,KAAK;AAAmB,aAAOD,GAAE,WAAWC,GAAE,UAAUD,GAAE,UAAUC,GAAE;AAAA,IACtE,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAmC,aAAOD,GAAE,OAAOC,EAAC;AAAA,IACzD,KAAK;AAA8B,aAAOD,GAAE,SAAS,MAAMC,GAAE,SAAS;AAAA,EACvE;AACA,MAAI,OAAOD,OAAM,YAAY,OAAOC,OAAM,SAAU,QAAO;AAE3D,MAAI,UAAUD,EAAC,KAAK,UAAUC,EAAC,EAAG,QAAOD,GAAE,YAAYC,EAAC;AAExD,MAAI,SAAS,OAAO;AACpB,SAAO;AAKP,QAAI,OAAO,MAAM,MAAMD,GAAG,QAAO,OAAO,MAAM,MAAMC;AAAA,aAC3C,OAAO,MAAM,MAAMA,GAAG,QAAO;AAEtC,SAAO,KAAKD,EAAC;AACb,SAAO,KAAKC,EAAC;AAGb,MAAI,cAAc,oBAAoBD,GAAE,WAAWC,GAAE,OAAQ,QAAO;AACpE,MAAI,QAAQD,EAAC,KAAK,QAAQC,EAAC,EAAG,KAAI;AACjC,WAAO,aAAaD,IAAGC,IAAG,QAAQ,QAAQ,eAAeiB,OAAM;AAAA,EAChE,UAAE;AACD,WAAO,IAAI;AACX,WAAO,IAAI;AAAA,EACZ;AAEA,QAAM,QAAQ,KAAKlB,IAAGkB,OAAM;AAC5B,MAAI;AACJ,MAAI,OAAO,MAAM;AAEjB,MAAI,KAAKjB,IAAGiB,OAAM,EAAE,WAAW,KAAM,QAAO;AAC5C,SAAO,QAAQ;AACd,UAAM,MAAM,IAAI;AAEhB,aAASA,QAAOjB,IAAG,GAAG,KAAK,GAAGD,GAAE,GAAG,GAAGC,GAAE,GAAG,GAAG,QAAQ,QAAQ,eAAeiB,OAAM;AACnF,QAAI,CAAC,OAAQ,QAAO;AAAA,EACrB;AAEA,SAAO,IAAI;AACX,SAAO,IAAI;AACX,SAAO;AACR;AACA,SAAS,aAAalB,IAAGC,IAAG,QAAQ,QAAQ,eAAeiB,SAAQ;AAKlE,MAAI,SAAS,OAAO,UAAU,SAAS,KAAKlB,EAAC,MAAM,OAAO,UAAU,SAAS,KAAKC,EAAC,KAAKD,GAAE,SAASC,GAAE,QAAQD,GAAE,YAAYC,GAAE;AAE7H,MAAI,OAAOA,GAAE,UAAU,YAAa,YAAW,GAAGD,GAAE,OAAOC,GAAE,OAAO,QAAQ,QAAQ,eAAeiB,OAAM;AAEzG,MAAIlB,cAAa,kBAAkBC,cAAa,eAAgB,YAAW,GAAGD,GAAE,QAAQC,GAAE,QAAQ,QAAQ,QAAQ,eAAeiB,OAAM;AAEvI,aAAW,GAAG,EAAE,GAAGlB,GAAE,GAAG,EAAE,GAAGC,GAAE,GAAG,QAAQ,QAAQ,eAAeiB,OAAM;AACvE,SAAO;AACR;AACA,SAAS,KAAK,KAAKA,SAAQ;AAC1B,QAAMC,QAAO,CAAC;AACd,aAAW,OAAO,IAAK,KAAID,QAAO,KAAK,GAAG,EAAG,CAAAC,MAAK,KAAK,GAAG;AAC1D,SAAOA,MAAK,OAAO,OAAO,sBAAsB,GAAG,EAAE,OAAO,CAAC,WAAW,OAAO,yBAAyB,KAAK,MAAM,EAAE,UAAU,CAAC;AACjI;AACA,SAAS,cAAc,KAAK,KAAK;AAChC,SAAO,OAAO,KAAK,GAAG,KAAK,IAAI,GAAG,MAAM;AACzC;AACA,SAAS,OAAO,KAAK,KAAK;AACzB,SAAO,OAAO,OAAO,KAAK,GAAG;AAC9B;AACA,SAAS,IAAI,UAAU,OAAO;AAC7B,SAAO,OAAO,UAAU,SAAS,MAAM,KAAK,MAAM,WAAW,QAAQ;AACtE;AACA,SAAS,UAAU,KAAK;AACvB,SAAO,QAAQ,QAAQ,OAAO,QAAQ,YAAY,cAAc,OAAO,OAAO,IAAI,aAAa,YAAY,cAAc,OAAO,OAAO,IAAI,aAAa,YAAY,iBAAiB,OAAO,OAAO,IAAI,gBAAgB;AACxN;AAEA,IAAMC,qBAAoB;AAC1B,IAAMC,mBAAkB;AACxB,IAAMC,oBAAmB;AACzB,IAAMC,uBAAsB;AAC5B,IAAMC,oBAAmB;AACzB,SAAS,0BAA0B,YAAY;AAC9C,SAAO,CAAC,EAAE,cAAc,WAAWJ,kBAAiB,KAAK,CAAC,WAAWG,oBAAmB;AACzF;AACA,SAAS,wBAAwB,UAAU;AAC1C,SAAO,CAAC,EAAE,YAAY,SAASF,gBAAe,KAAK,CAAC,SAASE,oBAAmB;AACjF;AACA,SAAS,gBAAgB,QAAQ;AAChC,SAAO,UAAU,QAAQ,OAAO,WAAW,YAAY,CAAC,MAAM,QAAQ,MAAM;AAC7E;AACA,SAAS,gBAAgB,QAAQ;AAChC,SAAO,QAAQ,UAAU,gBAAgB,MAAM,KAAK,OAAOD,iBAAgB,CAAC;AAC7E;AACA,SAAS,wBAAwB,QAAQ;AACxC,SAAO,QAAQ,UAAU,gBAAgB,MAAM,KAAK,OAAOF,kBAAiB,KAAK,OAAOG,oBAAmB,CAAC;AAC7G;AACA,SAAS,sBAAsB,QAAQ;AACtC,SAAO,QAAQ,UAAU,gBAAgB,MAAM,KAAK,OAAOF,gBAAe,KAAK,OAAOE,oBAAmB,CAAC;AAC3G;AACA,SAAS,kBAAkB,QAAQ;AAClC,SAAO,QAAQ,UAAU,gBAAgB,MAAM,KAAK,OAAOC,iBAAgB,CAAC;AAC7E;AAQA,IAAM,iBAAiB,OAAO;AAC9B,SAAS,YAAYT,SAAQ;AAC5B,SAAO,CAAC,EAAEA,WAAU,QAAQA,QAAO,cAAc;AAClD;AACA,SAAS,iBAAiBf,IAAGC,IAAG,gBAAgB,CAAC,GAAG,SAAS,CAAC,GAAG,SAAS,CAAC,GAAG;AAC7E,MAAI,OAAOD,OAAM,YAAY,OAAOC,OAAM,YAAY,MAAM,QAAQD,EAAC,KAAK,MAAM,QAAQC,EAAC,KAAK,CAAC,YAAYD,EAAC,KAAK,CAAC,YAAYC,EAAC,EAAG;AAClI,MAAID,GAAE,gBAAgBC,GAAE,YAAa,QAAO;AAC5C,MAAI,SAAS,OAAO;AACpB,SAAO;AAKP,QAAI,OAAO,MAAM,MAAMD,GAAG,QAAO,OAAO,MAAM,MAAMC;AACpD,SAAO,KAAKD,EAAC;AACb,SAAO,KAAKC,EAAC;AACb,QAAM,wBAAwB,CAAC,GAAG,cAAc,OAAO,CAACwB,OAAMA,OAAM,gBAAgB,GAAG,yBAAyB;AAChH,WAAS,0BAA0BzB,IAAGC,IAAG;AACxC,WAAO,iBAAiBD,IAAGC,IAAG,CAAC,GAAG,aAAa,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC;AAAA,EAC3E;AACA,MAAID,GAAE,SAAS,QAAQ;AACtB,QAAIA,GAAE,SAASC,GAAE,KAAM,QAAO;AAAA,aACrB,IAAI,OAAOD,EAAC,KAAK,wBAAwBA,EAAC,GAAG;AACrD,UAAI,WAAW;AACf,iBAAW,UAAUA,GAAG,KAAI,CAACC,GAAE,IAAI,MAAM,GAAG;AAC3C,YAAI,MAAM;AACV,mBAAW,UAAUA,GAAG,KAAI,OAAO,QAAQ,QAAQ,qBAAqB,MAAM,KAAM,OAAM;AAC1F,YAAI,QAAQ,OAAO;AAClB,qBAAW;AACX;AAAA,QACD;AAAA,MACD;AAEA,aAAO,IAAI;AACX,aAAO,IAAI;AACX,aAAO;AAAA,IACR,WAAW,IAAI,OAAOD,EAAC,KAAK,0BAA0BA,EAAC,GAAG;AACzD,UAAI,WAAW;AACf,iBAAW,UAAUA,GAAG,KAAI,CAACC,GAAE,IAAI,OAAO,CAAC,CAAC,KAAK,CAAC,OAAO,OAAO,CAAC,GAAGA,GAAE,IAAI,OAAO,CAAC,CAAC,GAAG,qBAAqB,GAAG;AAC7G,YAAI,MAAM;AACV,mBAAW,UAAUA,IAAG;AACvB,gBAAM,aAAa,OAAO,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,qBAAqB;AACrE,cAAI,eAAe;AACnB,cAAI,eAAe,KAAM,gBAAe,OAAO,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,qBAAqB;AAC1F,cAAI,iBAAiB,KAAM,OAAM;AAAA,QAClC;AACA,YAAI,QAAQ,OAAO;AAClB,qBAAW;AACX;AAAA,QACD;AAAA,MACD;AAEA,aAAO,IAAI;AACX,aAAO,IAAI;AACX,aAAO;AAAA,IACR;AAAA,EACD;AACA,QAAM,YAAYA,GAAE,cAAc,EAAE;AACpC,aAAW,UAAUD,IAAG;AACvB,UAAM,QAAQ,UAAU,KAAK;AAC7B,QAAI,MAAM,QAAQ,CAAC,OAAO,QAAQ,MAAM,OAAO,qBAAqB,EAAG,QAAO;AAAA,EAC/E;AACA,MAAI,CAAC,UAAU,KAAK,EAAE,KAAM,QAAO;AACnC,MAAI,CAAC,gBAAgBA,EAAC,KAAK,CAAC,wBAAwBA,EAAC,KAAK,CAAC,sBAAsBA,EAAC,KAAK,CAAC,kBAAkBA,EAAC,GAAG;AAC7G,QAAI,CAAC,OAAO,OAAO,QAAQA,EAAC,GAAG,OAAO,QAAQC,EAAC,GAAG,qBAAqB,EAAG,QAAO;AAAA,EAClF;AAEA,SAAO,IAAI;AACX,SAAO,IAAI;AACX,SAAO;AACR;AAIA,SAAS,oBAAoBc,SAAQ,KAAK;AACzC,MAAI,CAACA,WAAU,OAAOA,YAAW,YAAYA,YAAW,OAAO,UAAW,QAAO;AACjF,SAAO,OAAO,OAAOA,SAAQ,GAAG,KAAK,oBAAoB,OAAO,eAAeA,OAAM,GAAG,GAAG;AAC5F;AACA,SAAS,iBAAiBf,IAAG;AAC5B,SAAO,SAASA,EAAC,KAAK,CAAC,QAAQA,EAAC,KAAK,CAAC,MAAM,QAAQA,EAAC,KAAK,EAAEA,cAAa,SAAS,EAAEA,cAAa,QAAQ,EAAEA,cAAa;AACzH;AAEA,IAAM,wBAAwC,oBAAI,QAAQ;AAC1D,SAAS,6BAA6B,QAAQ;AAC7C,wBAAsB,IAAI,MAAM;AAChC,SAAO;AACR;AACA,SAAS,uBAAuB,QAAQ;AACvC,SAAO,WAAW,kBAAkB,sBAAsB,IAAI,MAAM;AACrE;AACA,SAAS,eAAee,SAAQ,QAAQ,gBAAgB,CAAC,GAAG;AAC3D,QAAM,wBAAwB,cAAc,OAAO,CAACU,OAAMA,OAAM,cAAc;AAI9E,QAAM,4BAA4B,CAAC,iBAAiC,oBAAI,QAAQ,MAAM,6BAA6B,CAACV,SAAQW,YAAW;AACtI,QAAI,CAAC,iBAAiBA,OAAM,EAAG;AAC/B,WAAO,OAAO,KAAKA,OAAM,EAAE,MAAM,CAAC,QAAQ;AACzC,UAAIA,QAAO,GAAG,KAAK,QAAQ,OAAOA,QAAO,GAAG,MAAM,UAAU;AAC3D,YAAI,eAAe,IAAIA,QAAO,GAAG,CAAC,EAAG,QAAO,OAAOX,QAAO,GAAG,GAAGW,QAAO,GAAG,GAAG,qBAAqB;AAClG,uBAAe,IAAIA,QAAO,GAAG,GAAG,IAAI;AAAA,MACrC;AACA,YAAM,SAASX,WAAU,QAAQ,oBAAoBA,SAAQ,GAAG,KAAK,OAAOA,QAAO,GAAG,GAAGW,QAAO,GAAG,GAAG,CAAC,GAAG,uBAAuB,0BAA0B,cAAc,CAAC,CAAC;AAM3K,qBAAe,OAAOA,QAAO,GAAG,CAAC;AACjC,aAAO;AAAA,IACR,CAAC;AAAA,EACF,CAAC;AACD,SAAO,0BAA0B,EAAEX,SAAQ,MAAM;AAClD;AACA,SAAS,aAAaf,IAAGC,IAAG;AAC3B,MAAID,MAAK,QAAQC,MAAK,QAAQD,GAAE,gBAAgBC,GAAE,YAAa;AAC/D,SAAO;AACR;AACA,SAAS,oBAAoBD,IAAGC,IAAG;AAClC,MAAI,YAAYD;AAChB,MAAI,YAAYC;AAChB,MAAI,EAAED,cAAa,YAAYC,cAAa,WAAW;AACtD,QAAI,EAAED,cAAa,gBAAgB,EAAEC,cAAa,aAAc;AAChE,QAAI;AACH,kBAAY,IAAI,SAASD,EAAC;AAC1B,kBAAY,IAAI,SAASC,EAAC;AAAA,IAC3B,QAAQ;AACP;AAAA,IACD;AAAA,EACD;AAEA,MAAI,UAAU,eAAe,UAAU,WAAY,QAAO;AAE1D,WAASC,KAAI,GAAGA,KAAI,UAAU,YAAYA,KAAK,KAAI,UAAU,SAASA,EAAC,MAAM,UAAU,SAASA,EAAC,EAAG,QAAO;AAC3G,SAAO;AACR;AACA,SAAS,oBAAoBF,IAAGC,IAAG,gBAAgB,CAAC,GAAG;AACtD,MAAI,CAAC,MAAM,QAAQD,EAAC,KAAK,CAAC,MAAM,QAAQC,EAAC,EAAG;AAE5C,QAAM,QAAQ,OAAO,KAAKD,EAAC;AAC3B,QAAM,QAAQ,OAAO,KAAKC,EAAC;AAC3B,SAAO,OAAOD,IAAGC,IAAG,cAAc,OAAO,CAACwB,OAAMA,OAAM,mBAAmB,GAAG,IAAI,KAAK,OAAO,OAAO,KAAK;AACzG;AACA,SAAS,oBAAoB,kBAAkB,WAAW,WAAW,SAAS,UAAU;AACvF,QAAM,cAAc,YAAY,QAAQ,UAAU,MAAM;AACxD,MAAI,CAAC,iBAAiB,SAAS,EAAE,SAAS,gBAAgB,EAAG,QAAO,GAAG,WAAW;AAAA;AAAA,6DAAkE,gBAAgB;AAAA;AAAA,YAAkB,QAAQ;AAAA;AAAA;AAC9L,SAAO;AACR;AACA,SAAS,UAAU,MAAM,OAAO;AAC/B,SAAO,GAAG,KAAK,IAAI,IAAI,GAAG,UAAU,IAAI,KAAK,GAAG;AACjD;AACA,SAAS,cAAcV,SAAQ;AAC9B,SAAO,CAAC,GAAG,OAAO,KAAKA,OAAM,GAAG,GAAG,OAAO,sBAAsBA,OAAM,EAAE,OAAO,CAAC,MAAM,OAAO,yBAAyBA,SAAQ,CAAC,GAAG,UAAU,CAAC;AAC9I;AACA,SAAS,gBAAgBA,SAAQ,QAAQ,eAAe;AACvD,MAAI,WAAW;AACf,QAAM,6BAA6B,CAAC,iBAAiC,oBAAI,QAAQ,MAAM,CAACA,SAAQW,YAAW;AAC1G,QAAI,MAAM,QAAQX,OAAM,GAAG;AAC1B,UAAI,MAAM,QAAQW,OAAM,KAAKA,QAAO,WAAWX,QAAO;AAEtD,eAAOW,QAAO,IAAI,CAAC,KAAKxB,OAAM,2BAA2B,cAAc,EAAEa,QAAOb,EAAC,GAAG,GAAG,CAAC;AAAA,IACzF,WAAWa,mBAAkB,KAAM,QAAOA;AAAA,aACjC,SAASA,OAAM,KAAK,SAASW,OAAM,GAAG;AAC9C,UAAI,OAAOX,SAAQW,SAAQ;AAAA,QAC1B,GAAG;AAAA,QACH;AAAA,QACA;AAAA,MACD,CAAC;AAED,eAAOA;AACP,YAAM,UAAU,CAAC;AACjB,qBAAe,IAAIX,SAAQ,OAAO;AAElC,UAAI,OAAOA,QAAO,gBAAgB,cAAc,OAAOA,QAAO,YAAY,SAAS,SAAU,QAAO,eAAe,SAAS,eAAe;AAAA,QAC1I,YAAY;AAAA,QACZ,OAAOA,QAAO;AAAA,MACf,CAAC;AACD,iBAAW,OAAO,cAAcA,OAAM,EAAG,KAAI,oBAAoBW,SAAQ,GAAG,EAAG,SAAQ,GAAG,IAAI,eAAe,IAAIX,QAAO,GAAG,CAAC,IAAI,eAAe,IAAIA,QAAO,GAAG,CAAC,IAAI,2BAA2B,cAAc,EAAEA,QAAO,GAAG,GAAGW,QAAO,GAAG,CAAC;AAAA,eAC5N,CAAC,eAAe,IAAIX,QAAO,GAAG,CAAC,GAAG;AAC1C,oBAAY;AACZ,YAAI,SAASA,QAAO,GAAG,CAAC,EAAG,aAAY,cAAcA,QAAO,GAAG,CAAC,EAAE;AAClE,mCAA2B,cAAc,EAAEA,QAAO,GAAG,GAAGW,QAAO,GAAG,CAAC;AAAA,MACpE;AACA,UAAI,cAAc,OAAO,EAAE,SAAS,EAAG,QAAO;AAAA,IAC/C;AACA,WAAOX;AAAA,EACR;AACA,SAAO;AAAA,IACN,QAAQ,2BAA2B,EAAEA,SAAQ,MAAM;AAAA,IACnD;AAAA,EACD;AACD;AAIA,SAAS,iBAAiB,KAAK;AAC9B,SAAO,CAAC,CAAC,QAAQ,OAAO,QAAQ,YAAY,OAAO,QAAQ,eAAe,IAAI,WAAW,KAAK,OAAO,IAAI,WAAW,EAAE,aAAa;AACpI;AAEA,IAAI,CAAC,OAAO,OAAO,YAAY,eAAe,GAAG;AAChD,QAAM,cAA8B,oBAAI,QAAQ;AAChD,QAAM,WAAW,uBAAO,OAAO,IAAI;AACnC,QAAM,wBAAwB,CAAC;AAC/B,QAAM,qBAAqB,uBAAO,OAAO,IAAI;AAI7C,SAAO,eAAe,YAAY,iBAAiB;AAAA,IAClD,cAAc;AAAA,IACd,KAAK,MAAM;AAAA,EACZ,CAAC;AACD,SAAO,eAAe,YAAY,sBAAsB;AAAA,IACvD,cAAc;AAAA,IACd,KAAK,OAAO;AAAA,MACX,OAAO,YAAY,IAAI,WAAW,aAAa,CAAC;AAAA,MAChD;AAAA,MACA;AAAA,IACD;AAAA,EACD,CAAC;AACD,SAAO,eAAe,YAAY,4BAA4B;AAAA,IAC7D,cAAc;AAAA,IACd,KAAK,MAAM;AAAA,EACZ,CAAC;AACF;AACA,SAAS,SAASY,SAAQ;AACzB,SAAO,WAAW,eAAe,EAAE,IAAIA,OAAM;AAC9C;AACA,SAAS,SAAS,OAAOA,SAAQ;AAChC,QAAMC,OAAM,WAAW,eAAe;AACtC,QAAM,UAAUA,KAAI,IAAID,OAAM;AAE9B,QAAM,OAAO,OAAO,iBAAiB,WAAW,CAAC,GAAG,OAAO,0BAA0B,KAAK,CAAC;AAC3F,MAAI,CAAC,QAAS,CAAAC,KAAI,IAAID,SAAQ,IAAI;AACnC;AAEA,IAAME,qBAAN,MAAwB;AAAA,EACvB;AAAA,EACA;AAAA;AAAA,EAEA,WAAW,uBAAO,IAAI,wBAAwB;AAAA,EAC9C,YAAY,QAAQ,UAAU,OAAO;AACpC,SAAK,SAAS;AACd,SAAK,UAAU;AAAA,EAChB;AAAA,EACA,kBAAkBF,SAAQ;AACzB,WAAO;AAAA,MACN,GAAG,SAASA,WAAU,WAAW,aAAa,CAAC;AAAA,MAC/C;AAAA,MACA,OAAO,KAAK;AAAA,MACZ,eAAe,yBAAyB;AAAA,MACxC,OAAO;AAAA,QACN,GAAG,gBAAgB;AAAA,QACnB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACD;AAAA,IACD;AAAA,EACD;AACD;AAKAE,mBAAkB,UAAU,uBAAO,IAAI,cAAc,CAAC,IAAI,SAAS,SAAS;AAE3E,QAAM,SAAS,UAAU,MAAM,QAAQ,OAAO,EAAE,KAAK,KAAK,CAAC;AAC3D,MAAI,OAAO,UAAU,QAAQ,SAAU,QAAO;AAC9C,SAAO,GAAG,KAAK,SAAS,CAAC;AAC1B;AACA,IAAM,mBAAN,cAA+BA,mBAAkB;AAAA,EAChD,YAAY,QAAQ,UAAU,OAAO;AACpC,QAAI,CAAC,IAAI,UAAU,MAAM,EAAG,OAAM,IAAI,MAAM,0BAA0B;AACtE,UAAM,QAAQ,OAAO;AAAA,EACtB;AAAA,EACA,gBAAgB,OAAO;AACtB,UAAM,SAAS,IAAI,UAAU,KAAK,KAAK,MAAM,SAAS,KAAK,MAAM;AACjE,WAAO,KAAK,UAAU,CAAC,SAAS;AAAA,EACjC;AAAA,EACA,WAAW;AACV,WAAO,SAAS,KAAK,UAAU,QAAQ,EAAE;AAAA,EAC1C;AAAA,EACA,kBAAkB;AACjB,WAAO;AAAA,EACR;AACD;AACA,IAAM,WAAN,cAAuBA,mBAAkB;AAAA,EACxC,gBAAgB,OAAO;AACtB,WAAO,SAAS;AAAA,EACjB;AAAA,EACA,WAAW;AACV,WAAO;AAAA,EACR;AAAA,EACA,sBAAsB;AACrB,WAAO;AAAA,EACR;AACD;AACA,IAAM,mBAAN,cAA+BA,mBAAkB;AAAA,EAChD,YAAY,QAAQ,UAAU,OAAO;AACpC,UAAM,QAAQ,OAAO;AAAA,EACtB;AAAA,EACA,aAAa,KAAK;AACjB,QAAI,OAAO,eAAgB,QAAO,OAAO,eAAe,GAAG;AAC3D,QAAI,IAAI,YAAY,cAAc,IAAK,QAAO;AAC9C,WAAO,IAAI,YAAY;AAAA,EACxB;AAAA,EACA,YAAY,KAAK,UAAU;AAC1B,QAAI,CAAC,IAAK,QAAO;AACjB,QAAI,OAAO,OAAO,KAAK,QAAQ,EAAG,QAAO;AACzC,WAAO,KAAK,YAAY,KAAK,aAAa,GAAG,GAAG,QAAQ;AAAA,EACzD;AAAA,EACA,cAAc,KAAK;AAClB,WAAO,CAAC,GAAG,OAAO,KAAK,GAAG,GAAG,GAAG,OAAO,sBAAsB,GAAG,EAAE,OAAO,CAAC,MAAM,OAAO,yBAAyB,KAAK,CAAC,GAAG,UAAU,CAAC;AAAA,EACrI;AAAA,EACA,gBAAgB,OAAO,eAAe;AACrC,QAAI,OAAO,KAAK,WAAW,SAAU,OAAM,IAAI,UAAU,iCAAiC,KAAK,SAAS,CAAC,UAAU,OAAO,KAAK,MAAM,IAAI;AACzI,QAAI,SAAS;AACb,UAAM,aAAa,KAAK,cAAc,KAAK,MAAM;AACjD,eAAW,YAAY,YAAY;AAClC,UAAI,CAAC,KAAK,YAAY,OAAO,QAAQ,GAAG;AACvC,iBAAS;AACT;AAAA,MACD;AACA,YAAM,QAAQ,KAAK,OAAO,QAAQ;AAClC,YAAM,aAAa,MAAM,QAAQ;AACjC,UAAI,CAAC,OAAO,OAAO,YAAY,aAAa,GAAG;AAC9C,iBAAS;AACT;AAAA,MACD;AAAA,IACD;AACA,WAAO,KAAK,UAAU,CAAC,SAAS;AAAA,EACjC;AAAA,EACA,WAAW;AACV,WAAO,SAAS,KAAK,UAAU,QAAQ,EAAE;AAAA,EAC1C;AAAA,EACA,kBAAkB;AACjB,WAAO;AAAA,EACR;AACD;AACA,IAAM,kBAAN,cAA8BA,mBAAkB;AAAA,EAC/C,YAAY,QAAQ,UAAU,OAAO;AACpC,UAAM,QAAQ,OAAO;AAAA,EACtB;AAAA,EACA,gBAAgB,OAAO,eAAe;AACrC,QAAI,CAAC,MAAM,QAAQ,KAAK,MAAM,EAAG,OAAM,IAAI,UAAU,gCAAgC,KAAK,SAAS,CAAC,UAAU,OAAO,KAAK,MAAM,IAAI;AACpI,UAAM,SAAS,KAAK,OAAO,WAAW,KAAK,MAAM,QAAQ,KAAK,KAAK,KAAK,OAAO,MAAM,CAAC,SAAS,MAAM,KAAK,CAAC,YAAY,OAAO,MAAM,SAAS,aAAa,CAAC,CAAC;AAC5J,WAAO,KAAK,UAAU,CAAC,SAAS;AAAA,EACjC;AAAA,EACA,WAAW;AACV,WAAO,QAAQ,KAAK,UAAU,QAAQ,EAAE;AAAA,EACzC;AAAA,EACA,kBAAkB;AACjB,WAAO;AAAA,EACR;AACD;AACA,IAAM,MAAN,cAAkBA,mBAAkB;AAAA,EACnC,YAAY,QAAQ;AACnB,QAAI,OAAO,WAAW,YAAa,OAAM,IAAI,UAAU,2GAA2G;AAClK,UAAM,MAAM;AAAA,EACb;AAAA,EACA,UAAU,MAAM;AACf,QAAI,KAAK,KAAM,QAAO,KAAK;AAC3B,UAAM,UAAU,SAAS,UAAU,SAAS,KAAK,IAAI,EAAE,MAAM,kDAAkD;AAC/G,WAAO,UAAU,QAAQ,CAAC,IAAI;AAAA,EAC/B;AAAA,EACA,gBAAgB,OAAO;AACtB,QAAI,KAAK,WAAW,OAAQ,QAAO,OAAO,SAAS,YAAY,iBAAiB;AAChF,QAAI,KAAK,WAAW,OAAQ,QAAO,OAAO,SAAS,YAAY,iBAAiB;AAChF,QAAI,KAAK,WAAW,SAAU,QAAO,OAAO,SAAS,cAAc,OAAO,UAAU;AACpF,QAAI,KAAK,WAAW,QAAS,QAAO,OAAO,SAAS,aAAa,iBAAiB;AAClF,QAAI,KAAK,WAAW,OAAQ,QAAO,OAAO,SAAS,YAAY,iBAAiB;AAChF,QAAI,KAAK,WAAW,OAAQ,QAAO,OAAO,SAAS,YAAY,iBAAiB;AAChF,QAAI,KAAK,WAAW,OAAQ,QAAO,OAAO,SAAS;AACnD,WAAO,iBAAiB,KAAK;AAAA,EAC9B;AAAA,EACA,WAAW;AACV,WAAO;AAAA,EACR;AAAA,EACA,kBAAkB;AACjB,QAAI,KAAK,WAAW,OAAQ,QAAO;AACnC,QAAI,KAAK,WAAW,OAAQ,QAAO;AACnC,QAAI,KAAK,WAAW,SAAU,QAAO;AACrC,QAAI,KAAK,WAAW,OAAQ,QAAO;AACnC,QAAI,KAAK,WAAW,QAAS,QAAO;AACpC,WAAO,KAAK,UAAU,KAAK,MAAM;AAAA,EAClC;AAAA,EACA,sBAAsB;AACrB,WAAO,OAAO,KAAK,UAAU,KAAK,MAAM,CAAC;AAAA,EAC1C;AACD;AACA,IAAM,iBAAN,cAA6BA,mBAAkB;AAAA,EAC9C,YAAY,QAAQ,UAAU,OAAO;AACpC,QAAI,CAAC,IAAI,UAAU,MAAM,KAAK,CAAC,IAAI,UAAU,MAAM,EAAG,OAAM,IAAI,MAAM,sCAAsC;AAC5G,UAAM,IAAI,OAAO,MAAM,GAAG,OAAO;AAAA,EAClC;AAAA,EACA,gBAAgB,OAAO;AACtB,UAAM,SAAS,IAAI,UAAU,KAAK,KAAK,KAAK,OAAO,KAAK,KAAK;AAC7D,WAAO,KAAK,UAAU,CAAC,SAAS;AAAA,EACjC;AAAA,EACA,WAAW;AACV,WAAO,SAAS,KAAK,UAAU,QAAQ,EAAE;AAAA,EAC1C;AAAA,EACA,kBAAkB;AACjB,WAAO;AAAA,EACR;AACD;AACA,IAAM,UAAN,cAAsBA,mBAAkB;AAAA,EACvC;AAAA,EACA,YAAY,QAAQ,YAAY,GAAG,UAAU,OAAO;AACnD,QAAI,CAAC,IAAI,UAAU,MAAM,EAAG,OAAM,IAAI,MAAM,0BAA0B;AACtE,QAAI,CAAC,IAAI,UAAU,SAAS,EAAG,OAAM,IAAI,MAAM,2BAA2B;AAC1E,UAAM,MAAM;AACZ,SAAK,UAAU;AACf,SAAK,YAAY;AAAA,EAClB;AAAA,EACA,gBAAgB,OAAO;AACtB,QAAI,CAAC,IAAI,UAAU,KAAK,EAAG,QAAO;AAClC,QAAI,SAAS;AACb,QAAI,UAAU,OAAO,qBAAqB,KAAK,WAAW,OAAO,kBAAmB,UAAS;AAAA,aACpF,UAAU,OAAO,qBAAqB,KAAK,WAAW,OAAO,kBAAmB,UAAS;AAAA,QAC7F,UAAS,KAAK,IAAI,KAAK,SAAS,KAAK,IAAI,MAAM,CAAC,KAAK,YAAY;AACtE,WAAO,KAAK,UAAU,CAAC,SAAS;AAAA,EACjC;AAAA,EACA,WAAW;AACV,WAAO,SAAS,KAAK,UAAU,QAAQ,EAAE;AAAA,EAC1C;AAAA,EACA,kBAAkB;AACjB,WAAO;AAAA,EACR;AAAA,EACA,sBAAsB;AACrB,WAAO;AAAA,MACN,KAAK,SAAS;AAAA,MACd,KAAK;AAAA,MACL,IAAI,UAAU,SAAS,KAAK,SAAS,CAAC;AAAA,IACvC,EAAE,KAAK,GAAG;AAAA,EACX;AACD;AACA,IAAM,iBAAN,cAA6BA,mBAAkB;AAAA,EAC9C;AAAA,EACA,YAAY,QAAQ,UAAU,OAAO;AACpC,QAAI,CAAC,iBAAiB,MAAM,EAAG,OAAM,IAAI,UAAU,uDAAuD;AAC1G,UAAM,QAAQ,OAAO;AAAA,EACtB;AAAA,EACA,gBAAgB,OAAO;AACtB,UAAM,SAAS,KAAK,OAAO,WAAW,EAAE,SAAS,KAAK;AAEtD,QAAI,kBAAkB,QAAS,OAAM,IAAI,UAAU,kEAAkE;AACrH,SAAK,SAAS;AACd,UAAM,OAAO,CAAC,KAAK,OAAO,UAAU,KAAK,OAAO,OAAO,WAAW;AAClE,WAAO,KAAK,UAAU,CAAC,OAAO;AAAA,EAC/B;AAAA,EACA,WAAW;AACV,WAAO,SAAS,KAAK,UAAU,QAAQ,EAAE;AAAA,EAC1C;AAAA,EACA,kBAAkB;AACjB,WAAO;AAAA,EACR;AAAA,EACA,sBAAsB;AACrB,UAAM,EAAE,MAAM,IAAI,KAAK,kBAAkB;AACzC,SAAK,KAAK,QAAQ,UAAU,CAAC,GAAG,SAAS,EAAG,QAAO,GAAG,KAAK,SAAS,CAAC,IAAI,MAAM,UAAU,KAAK,QAAQ,QAAQ,EAAE,qBAAqB,MAAM,CAAC,CAAC;AAC7I,WAAO,KAAK,SAAS;AAAA,EACtB;AACD;AACA,IAAM,yBAAyB,CAAC,MAAM,UAAU;AAC/C,QAAM,UAAU,KAAK,QAAQ,YAAY,MAAM,IAAI,SAAS,CAAC;AAC7D,QAAM,UAAU,KAAK,QAAQ,OAAO,CAAC,aAAa,IAAI,IAAI,QAAQ,CAAC;AACnE,QAAM,UAAU,KAAK,QAAQ,oBAAoB,CAAC,aAAa,IAAI,iBAAiB,QAAQ,CAAC;AAC7F,QAAM,UAAU,KAAK,QAAQ,oBAAoB,CAAC,aAAa,IAAI,iBAAiB,QAAQ,CAAC;AAC7F,QAAM,UAAU,KAAK,QAAQ,mBAAmB,CAAC,aAAa,IAAI,gBAAgB,QAAQ,CAAC;AAC3F,QAAM,UAAU,KAAK,QAAQ,kBAAkB,CAAC,aAAa,IAAI,eAAe,QAAQ,CAAC;AACzF,QAAM,UAAU,KAAK,QAAQ,WAAW,CAAC,UAAU,cAAc,IAAI,QAAQ,UAAU,SAAS,CAAC;AACjG,QAAM,UAAU,KAAK,QAAQ,kBAAkB,CAAC,aAAa,IAAI,eAAe,QAAQ,CAAC;AAEzF,OAAK,OAAO,MAAM;AAAA,IACjB,kBAAkB,CAAC,aAAa,IAAI,iBAAiB,UAAU,IAAI;AAAA,IACnE,kBAAkB,CAAC,aAAa,IAAI,iBAAiB,UAAU,IAAI;AAAA,IACnE,iBAAiB,CAAC,aAAa,IAAI,gBAAgB,UAAU,IAAI;AAAA,IACjE,gBAAgB,CAAC,aAAa,IAAI,eAAe,UAAU,IAAI;AAAA,IAC/D,SAAS,CAAC,UAAU,cAAc,IAAI,QAAQ,UAAU,WAAW,IAAI;AAAA,IACvE,gBAAgB,CAAC,aAAa,IAAI,eAAe,UAAU,IAAI;AAAA,EAChE;AACD;AAEA,SAAS,uBAAuB,MAAM,WAAW,SAAS;AACzD,QAAM,OAAO,KAAK,KAAK,WAAW,MAAM,IAAI,UAAU;AACtD,QAAM,MAAM,KAAK,KAAK,WAAW,QAAQ,IAAI,SAAS;AACtD,QAAM,OAAO,GAAG,KAAK,KAAK,WAAW,OAAO,CAAC,IAAI,UAAU,aAAa,EAAE;AAC1E,QAAM,cAAc,KAAK,KAAK,WAAW,SAAS;AAClD,SAAO,SAAS,IAAI,WAAW,cAAc,IAAI,WAAW,KAAK,EAAE,IAAI,GAAG,GAAG,IAAI;AAClF;AACA,SAAS,kBAAkBC,QAAO,SAAS,WAAW,OAAO,QAAQ;AACpE,QAAMC,QAAOD;AAEb,MAAIC,SAAQ,mBAAmB,SAAS;AAEvC,cAAU,QAAQ,QAAQ,MAAM;AAC/B,UAAI,CAACA,MAAK,SAAU;AACpB,YAAM,QAAQA,MAAK,SAAS,QAAQ,OAAO;AAC3C,UAAI,UAAU,GAAI,CAAAA,MAAK,SAAS,OAAO,OAAO,CAAC;AAAA,IAChD,CAAC;AAED,QAAI,CAACA,MAAK,SAAU,CAAAA,MAAK,WAAW,CAAC;AAGrC,QAAI,OAAQ,WAAU,QAAQ,KAAK,MAAM,CAAC,QAAQ;AACjD,sBAAgBA,OAAM,GAAG;AAAA,IAC1B,CAAC;AACD,IAAAA,MAAK,SAAS,KAAK,OAAO;AAC1B,QAAI,WAAW;AACf,IAAAA,MAAK,eAAe,CAAC;AACrB,IAAAA,MAAK,WAAW,KAAK,MAAM;AAC1B,UAAI,CAAC,UAAU;AACd,cAAM,aAA6B,oBAAI,MAAM,yBAAyB,SAAS;AAAA;AAAA,QAA0J,SAAS;AAAA,CAAI;AACtP,YAAI,MAAM,MAAO,YAAW,QAAQ,MAAM,MAAM,QAAQ,MAAM,SAAS,WAAW,OAAO;AACzF,cAAM;AAAA,MACP;AAAA,IACD,CAAC;AACD,WAAO;AAAA,MACN,KAAK,aAAa,YAAY;AAC7B,mBAAW;AACX,eAAO,QAAQ,KAAK,aAAa,UAAU;AAAA,MAC5C;AAAA,MACA,MAAM,YAAY;AACjB,mBAAW;AACX,eAAO,QAAQ,MAAM,UAAU;AAAA,MAChC;AAAA,MACA,QAAQ,WAAW;AAClB,mBAAW;AACX,eAAO,QAAQ,QAAQ,SAAS;AAAA,MACjC;AAAA,MACA,CAAC,OAAO,WAAW,GAAG;AAAA,IACvB;AAAA,EACD;AACA,SAAO;AACR;AACA,SAAS,gBAAgBA,OAAM,KAAK;AACnC,EAAAA,MAAK,WAAW,EAAE,OAAO,OAAO;AAChC,EAAAA,MAAK,OAAO,QAAQ;AACpB,EAAAA,MAAK,OAAO,WAAW,CAAC;AACxB,EAAAA,MAAK,OAAO,OAAO,KAAK,aAAa,GAAG,CAAC;AAC1C;AAEA,SAAS,cAAc,OAAO,MAAMxB,KAAI;AACvC,SAAO,YAAY,MAAM;AAExB,QAAI,SAAS,WAAY,OAAM,KAAK,MAAM,SAAS,IAAI;AACvD,QAAI,CAAC,MAAM,KAAK,MAAM,MAAM;AAG5B,UAAI;AACH,eAAOA,IAAG,MAAM,MAAM,IAAI;AAAA,MAC3B,UAAE;AAAA,MAAS;AACX,UAAMwB,QAAO,MAAM,KAAK,MAAM,aAAa;AAC3C,QAAI,CAACA,MAAM,OAAM,IAAI,MAAM,8CAA8C;AACzE,QAAI;AACH,YAAM,SAASxB,IAAG,MAAM,MAAM,IAAI;AAClC,UAAI,UAAU,OAAO,WAAW,YAAY,OAAO,OAAO,SAAS,WAAY,QAAO,OAAO,KAAK,MAAM,CAAC,QAAQ;AAChH,wBAAgBwB,OAAM,GAAG;AAAA,MAC1B,CAAC;AACD,aAAO;AAAA,IACR,SAAS,KAAK;AACb,sBAAgBA,OAAM,GAAG;AAAA,IAC1B;AAAA,EACD;AACD;AAGA,IAAM,iBAAiB,CAAC,MAAM,UAAU;AACvC,QAAM,EAAE,gBAAAC,gBAAe,IAAI;AAC3B,QAAM,gBAAgB,yBAAyB;AAC/C,WAAS,IAAI,MAAMzB,KAAI;AACtB,UAAM0B,aAAY,CAACC,OAAM;AACxB,YAAM,cAAc,cAAc,OAAOA,IAAG3B,GAAE;AAC9C,YAAM,UAAU,KAAK,UAAU,WAAW2B,IAAG,WAAW;AACxD,YAAM,UAAU,WAAW,oBAAoB,EAAE,UAAUA,IAAG,WAAW;AAAA,IAC1E;AACA,QAAI,MAAM,QAAQ,IAAI,EAAG,MAAK,QAAQ,CAACA,OAAMD,WAAUC,EAAC,CAAC;AAAA,QACpD,CAAAD,WAAU,IAAI;AAAA,EACpB;AACA;AAAA,IACC;AAAA,IACA;AAAA,IACA;AAAA,EACD,EAAE,QAAQ,CAACE,OAAM;AAChB,UAAM,gBAAgB,KAAK,UAAU,WAAWA,IAAG,CAAC,WAAW;AAC9D,aAAO,YAAY,MAAM;AACxB,cAAM,UAAU,MAAM,KAAK,MAAM,SAAS;AAC1C,cAAMpB,UAAS,MAAM,KAAK,MAAM,QAAQ;AACxC,cAAM,QAAQ,MAAM,KAAK,MAAM,QAAQ;AACvC,YAAI,YAAY,UAAW,OAAM,KAAK,MAAM,UAAU,MAAM;AAC3D,gBAAMA;AAAA,QACP,CAAC;AAAA,iBACQ,YAAY,cAAc,OAAOA,YAAW,WAAY,KAAI,CAAC,OAAO;AAC5E,gBAAM,UAAU,MAAM,KAAK,MAAM,SAAS,KAAK;AAC/C,gBAAM,IAAIiB,gBAAe,SAAS,EAAE,UAAU,MAAM,GAAG,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,QAChF,MAAO;AACP,eAAO,MAAM,MAAM,IAAI;AAAA,MACxB;AAAA,IACD,CAAC;AAAA,EACF,CAAC;AAED,MAAI,YAAY,SAASD,OAAM;AAC9B,UAAM,KAAK,MAAM,eAAeA,KAAI;AACpC,WAAO;AAAA,EACR,CAAC;AACD,MAAI,WAAW,SAAS,UAAU;AACjC,UAAM,SAAS,MAAM,KAAK,MAAM,QAAQ;AACxC,UAAM,QAAQ,OAAO,QAAQ,UAAU,CAAC,GAAG,eAAe,gBAAgB,CAAC;AAC3E,WAAO,KAAK,OAAO,OAAO,2CAA2C,+CAA+C,UAAU,MAAM;AAAA,EACrI,CAAC;AACD,MAAI,iBAAiB,SAAS,UAAU;AACvC,UAAM,MAAM,MAAM,KAAK,MAAM,QAAQ;AACrC,UAAM,QAAQ,OAAO,KAAK,UAAU;AAAA,MACnC,GAAG;AAAA,MACH;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACD,GAAG,IAAI;AACP,WAAO,KAAK,OAAO,OAAO,6CAA6C,iDAAiD,UAAU,GAAG;AAAA,EACtI,CAAC;AACD,MAAI,QAAQ,SAAS,UAAU;AAC9B,UAAM,SAAS,KAAK;AACpB,UAAM,OAAO,OAAO,GAAG,QAAQ,QAAQ;AACvC,QAAI,mBAAmB;AACvB,QAAI,CAAC,MAAM;AACV,UAAI,OAAO,QAAQ,UAAU;AAAA,QAC5B,GAAG;AAAA,QACH;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACD,GAAG,IAAI,EAAG,oBAAmB;AAAA,eACpB,OAAO,QAAQ,UAAU,CAAC,GAAG,eAAe,gBAAgB,CAAC,EAAG,oBAAmB;AAAA,IAC7F;AACA,WAAO,KAAK,OAAO,MAAM,oBAAoB,gBAAgB,GAAG,2DAA2D,UAAU,MAAM;AAAA,EAC5I,CAAC;AACD,MAAI,iBAAiB,SAAS,UAAU;AACvC,UAAM,SAAS,KAAK;AACpB,UAAM,OAAO,OAAO,QAAQ,UAAU;AAAA,MACrC,GAAG;AAAA,MACH;AAAA,MACA;AAAA,IACD,CAAC;AACD,UAAM,QAAQ,MAAM,KAAK,MAAM,QAAQ;AACvC,UAAM,EAAE,QAAQ,cAAc,SAAS,IAAI,gBAAgB,QAAQ,UAAU,aAAa;AAC1F,QAAI,QAAQ,SAAS,CAAC,QAAQ,CAAC,OAAO;AACrC,YAAM,MAAM,MAAM,WAAW,MAAM;AAAA,QAClC;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACD,CAAC;AACD,YAAM,UAAU,aAAa,IAAI,MAAM,GAAG,GAAG;AAAA,GAAM,QAAQ,aAAa,aAAa,IAAI,aAAa,YAAY;AAClH,YAAM,IAAIC,gBAAe,SAAS;AAAA,QACjC,UAAU;AAAA,QACV;AAAA,QACA,QAAQ;AAAA,MACT,CAAC;AAAA,IACF;AAAA,EACD,CAAC;AACD,MAAI,WAAW,SAAS,UAAU;AACjC,UAAM,SAAS,KAAK;AACpB,QAAI,OAAO,WAAW,SAAU,OAAM,IAAI,UAAU,mDAAmD,OAAO,MAAM,EAAE;AACtH,WAAO,KAAK,OAAO,OAAO,aAAa,WAAW,OAAO,SAAS,QAAQ,IAAI,OAAO,MAAM,QAAQ,GAAG,oCAAoC,wCAAwC,UAAU,MAAM;AAAA,EACnM,CAAC;AACD,MAAI,aAAa,SAAS,MAAM;AAC/B,UAAM,SAAS,KAAK;AACpB,QAAI,OAAO,SAAS,eAAe,kBAAkB,MAAM;AAC1D,UAAI,EAAE,gBAAgB,MAAO,OAAM,IAAI,UAAU,4DAA4D,OAAO,IAAI,EAAE;AAC1H,aAAO,KAAK,OAAO,OAAO,SAAS,IAAI,GAAG,8CAA8C,kDAAkD,MAAM,MAAM;AAAA,IACvJ;AACA,QAAI,OAAO,iBAAiB,eAAe,kBAAkB,cAAc;AAC1E,kBAAY,MAAM,cAAc,CAAC,QAAQ,CAAC;AAC1C,YAAM,oBAAoB,MAAM,KAAK,MAAM,QAAQ,IAAI,OAAO,MAAM,QAAQ,MAAM,EAAE,EAAE,KAAK,IAAI,GAAG,OAAO,KAAK,IAAI,IAAI;AACtH,aAAO,KAAK,OAAO,OAAO,SAAS,IAAI,GAAG,aAAa,OAAO,KAAK,iBAAiB,IAAI,KAAK,aAAa,OAAO,KAAK,qBAAqB,IAAI,KAAK,mBAAmB,OAAO,KAAK;AAAA,IACpL;AAEA,QAAI,OAAO,WAAW,YAAY,OAAO,SAAS,SAAU,QAAO,KAAK,OAAO,OAAO,SAAS,IAAI,GAAG,sCAAsC,0CAA0C,MAAM,MAAM;AAElM,QAAI,UAAU,QAAQ,OAAO,WAAW,SAAU,OAAM,KAAK,MAAM,UAAU,MAAM,KAAK,MAAM,CAAC;AAC/F,WAAO,KAAK,QAAQ,IAAI;AAAA,EACzB,CAAC;AACD,MAAI,kBAAkB,SAAS,UAAU;AACxC,UAAM,MAAM,MAAM,KAAK,MAAM,QAAQ;AACrC,UAAM,QAAQ,MAAM,KAAK,GAAG,EAAE,UAAU,CAAC,SAAS;AACjD,aAAO,OAAO,MAAM,UAAU,aAAa;AAAA,IAC5C,CAAC;AACD,SAAK,OAAO,UAAU,IAAI,mDAAmD,uDAAuD,QAAQ;AAAA,EAC7I,CAAC;AACD,MAAI,cAAc,WAAW;AAC5B,UAAM,MAAM,MAAM,KAAK,MAAM,QAAQ;AACrC,SAAK,OAAO,QAAQ,GAAG,GAAG,iCAAiC,qCAAqC,MAAM,GAAG;AAAA,EAC1G,CAAC;AACD,MAAI,aAAa,WAAW;AAC3B,UAAM,MAAM,MAAM,KAAK,MAAM,QAAQ;AACrC,SAAK,OAAO,CAAC,KAAK,gCAAgC,oCAAoC,OAAO,GAAG;AAAA,EACjG,CAAC;AACD,MAAI,mBAAmB,SAAS,UAAU;AACzC,UAAM,SAAS,KAAK;AACpB,gBAAY,QAAQ,UAAU,CAAC,UAAU,QAAQ,CAAC;AAClD,gBAAY,UAAU,YAAY,CAAC,UAAU,QAAQ,CAAC;AACtD,WAAO,KAAK,OAAO,SAAS,UAAU,YAAY,MAAM,uBAAuB,QAAQ,IAAI,YAAY,MAAM,2BAA2B,QAAQ,IAAI,UAAU,QAAQ,KAAK;AAAA,EAC5K,CAAC;AACD,MAAI,0BAA0B,SAAS,UAAU;AAChD,UAAM,SAAS,KAAK;AACpB,gBAAY,QAAQ,UAAU,CAAC,UAAU,QAAQ,CAAC;AAClD,gBAAY,UAAU,YAAY,CAAC,UAAU,QAAQ,CAAC;AACtD,WAAO,KAAK,OAAO,UAAU,UAAU,YAAY,MAAM,mCAAmC,QAAQ,IAAI,YAAY,MAAM,uCAAuC,QAAQ,IAAI,UAAU,QAAQ,KAAK;AAAA,EACrM,CAAC;AACD,MAAI,gBAAgB,SAAS,UAAU;AACtC,UAAM,SAAS,KAAK;AACpB,gBAAY,QAAQ,UAAU,CAAC,UAAU,QAAQ,CAAC;AAClD,gBAAY,UAAU,YAAY,CAAC,UAAU,QAAQ,CAAC;AACtD,WAAO,KAAK,OAAO,SAAS,UAAU,YAAY,MAAM,oBAAoB,QAAQ,IAAI,YAAY,MAAM,wBAAwB,QAAQ,IAAI,UAAU,QAAQ,KAAK;AAAA,EACtK,CAAC;AACD,MAAI,uBAAuB,SAAS,UAAU;AAC7C,UAAM,SAAS,KAAK;AACpB,gBAAY,QAAQ,UAAU,CAAC,UAAU,QAAQ,CAAC;AAClD,gBAAY,UAAU,YAAY,CAAC,UAAU,QAAQ,CAAC;AACtD,WAAO,KAAK,OAAO,UAAU,UAAU,YAAY,MAAM,gCAAgC,QAAQ,IAAI,YAAY,MAAM,oCAAoC,QAAQ,IAAI,UAAU,QAAQ,KAAK;AAAA,EAC/L,CAAC;AACD,MAAI,WAAW,WAAW;AACzB,UAAM,MAAM,MAAM,KAAK,MAAM,QAAQ;AACrC,SAAK,OAAO,OAAO,MAAM,GAAG,GAAG,8BAA8B,kCAAkC,KAAK,GAAG;AAAA,EACxG,CAAC;AACD,MAAI,iBAAiB,WAAW;AAC/B,UAAM,MAAM,MAAM,KAAK,MAAM,QAAQ;AACrC,SAAK,OAAO,WAAW,KAAK,oCAAoC,wCAAwC,QAAQ,GAAG;AAAA,EACpH,CAAC;AACD,MAAI,YAAY,WAAW;AAC1B,UAAM,MAAM,MAAM,KAAK,MAAM,QAAQ;AACrC,SAAK,OAAO,QAAQ,MAAM,+BAA+B,mCAAmC,MAAM,GAAG;AAAA,EACtG,CAAC;AACD,MAAI,gBAAgB,WAAW;AAC9B,UAAM,MAAM,MAAM,KAAK,MAAM,QAAQ;AACrC,SAAK,OAAO,OAAO,MAAM,kCAAkC,sCAAsC,MAAM,GAAG;AAAA,EAC3G,CAAC;AACD,MAAI,eAAe,WAAW;AAC7B,UAAM,MAAM,MAAM,KAAK,MAAM,QAAQ;AACrC,SAAK,OAAO,OAAO,QAAQ,aAAa,kCAAkC,oCAAoC,GAAG;AAAA,EAClH,CAAC;AACD,MAAI,cAAc,SAAS,UAAU;AACpC,UAAM,SAAS,OAAO,KAAK;AAC3B,UAAM,QAAQ,aAAa;AAC3B,WAAO,KAAK,OAAO,OAAO,yCAAyC,6CAA6C,UAAU,MAAM;AAAA,EACjI,CAAC;AACD,MAAI,kBAAkB,SAAS,KAAK;AACnC,WAAO,KAAK,WAAW,GAAG;AAAA,EAC3B,CAAC;AACD,MAAI,gBAAgB,SAAS,QAAQ;AACpC,WAAO,KAAK,KAAK,OAAO,MAAM;AAAA,EAC/B,CAAC;AAED,MAAI,kBAAkB,YAAY,MAAM;AACvC,QAAI,MAAM,QAAQ,KAAK,CAAC,CAAC,EAAG,MAAK,CAAC,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC,QAAQ,OAAO,GAAG,EAAE,QAAQ,aAAa,MAAM,CAAC,EAAE,KAAK,GAAG;AAC7G,UAAM,SAAS,KAAK;AACpB,QAAI,UAAU,KAAM,OAAM,IAAI,UAAU,gEAAgE,MAAM,EAAE;AAChH,UAAM,CAAC,cAAc,QAAQ,IAAI;AACjC,UAAM,WAAW,MAAM;AACtB,UAAI,OAAO,OAAO,QAAQ,YAAY,EAAG,QAAO;AAAA,QAC/C,OAAO,OAAO,YAAY;AAAA,QAC1B,QAAQ;AAAA,MACT;AACA,aAAO,MAAM,YAAY,QAAQ,YAAY;AAAA,IAC9C;AACA,UAAM,EAAE,OAAO,OAAO,IAAI,SAAS;AACnC,UAAM,OAAO,WAAW,KAAK,WAAW,KAAK,OAAO,UAAU,OAAO,aAAa;AAClF,UAAM,cAAc,KAAK,WAAW,IAAI,KAAK,eAAe,QAAQ,UAAU,EAAE,UAAU,GAAG,CAAC,CAAC;AAC/F,WAAO,KAAK,OAAO,MAAM,sCAAsC,YAAY,IAAI,WAAW,IAAI,0CAA0C,YAAY,IAAI,WAAW,IAAI,UAAU,SAAS,QAAQ,MAAM;AAAA,EACzM,CAAC;AACD,MAAI,eAAe,SAAS,UAAU,YAAY,GAAG;AACpD,UAAM,WAAW,KAAK;AACtB,QAAI,OAAO;AACX,QAAI,eAAe;AACnB,QAAI,eAAe;AACnB,QAAI,aAAa,OAAO,qBAAqB,aAAa,OAAO,kBAAmB,QAAO;AAAA,aAClF,aAAa,OAAO,qBAAqB,aAAa,OAAO,kBAAmB,QAAO;AAAA,SAC3F;AACJ,qBAAe,MAAM,CAAC,YAAY;AAClC,qBAAe,KAAK,IAAI,WAAW,QAAQ;AAC3C,aAAO,eAAe;AAAA,IACvB;AACA,WAAO,KAAK,OAAO,MAAM,kEAAkE,YAAY,kBAAkB,YAAY,IAAI,sEAAsE,YAAY,kBAAkB,YAAY,IAAI,UAAU,UAAU,KAAK;AAAA,EACvR,CAAC;AACD,WAAS,aAAa,WAAW;AAChC,QAAI,CAAC,eAAe,UAAU,IAAI,EAAG,OAAM,IAAI,UAAU,GAAG,MAAM,QAAQ,UAAU,IAAI,CAAC,mCAAmC;AAAA,EAC7H;AACA,WAAS,OAAO,WAAW;AAC1B,iBAAa,SAAS;AACtB,WAAO,UAAU;AAAA,EAClB;AACA,MAAI,CAAC,yBAAyB,iBAAiB,GAAG,SAAS,QAAQ;AAClE,UAAM,MAAM,OAAO,IAAI;AACvB,UAAM,UAAU,IAAI,YAAY;AAChC,UAAM,YAAY,IAAI,KAAK,MAAM;AACjC,WAAO,KAAK,OAAO,cAAc,QAAQ,aAAa,OAAO,wCAAwC,SAAS,UAAU,aAAa,OAAO,mCAAmC,QAAQ,WAAW,KAAK;AAAA,EACxM,CAAC;AACD,MAAI,wBAAwB,WAAW;AACtC,UAAM,MAAM,OAAO,IAAI;AACvB,UAAM,UAAU,IAAI,YAAY;AAChC,UAAM,YAAY,IAAI,KAAK,MAAM;AACjC,WAAO,KAAK,OAAO,cAAc,GAAG,aAAa,OAAO,gCAAgC,SAAS,UAAU,aAAa,OAAO,2BAA2B,GAAG,WAAW,KAAK;AAAA,EAC9K,CAAC;AACD,MAAI,CAAC,oBAAoB,YAAY,GAAG,WAAW;AAClD,UAAM,MAAM,OAAO,IAAI;AACvB,UAAM,UAAU,IAAI,YAAY;AAChC,UAAM,YAAY,IAAI,KAAK,MAAM;AACjC,UAAM,SAAS,YAAY;AAC3B,UAAM,QAAQ,MAAM,KAAK,MAAM,QAAQ;AACvC,QAAI,MAAM,MAAM,WAAW,MAAM;AAAA,MAChC;AAAA,MACA,aAAa,OAAO;AAAA,MACpB,aAAa,OAAO,uDAAuD,SAAS;AAAA,MACpF;AAAA,MACA;AAAA,IACD,CAAC;AACD,QAAI,UAAU,MAAO,OAAM,YAAY,KAAK,GAAG;AAC/C,QAAI,UAAU,SAAS,CAAC,UAAU,CAAC,MAAO,OAAM,IAAIA,gBAAe,GAAG;AAAA,EACvE,CAAC;AAGD,WAAS,oBAAoBhC,IAAGC,IAAG;AAClC,WAAOD,GAAE,WAAWC,GAAE,UAAUD,GAAE,MAAM,CAAC,OAAOE,OAAM,OAAO,OAAOD,GAAEC,EAAC,GAAG,CAAC,GAAG,eAAe,gBAAgB,CAAC,CAAC;AAAA,EAChH;AACA,MAAI,CAAC,wBAAwB,gBAAgB,GAAG,YAAY,MAAM;AACjE,UAAM,MAAM,OAAO,IAAI;AACvB,UAAM,UAAU,IAAI,YAAY;AAChC,UAAM,OAAO,IAAI,KAAK,MAAM,KAAK,CAAC,YAAY,oBAAoB,SAAS,IAAI,CAAC;AAChF,UAAM,QAAQ,MAAM,KAAK,MAAM,QAAQ;AACvC,QAAI,QAAQ,SAAS,CAAC,QAAQ,CAAC,OAAO;AACrC,YAAM,MAAM,MAAM,WAAW,MAAM;AAAA,QAClC;AAAA,QACA,aAAa,OAAO;AAAA,QACpB,aAAa,OAAO;AAAA,QACpB;AAAA,MACD,CAAC;AACD,YAAM,IAAI8B,gBAAe,YAAY,KAAK,KAAK,IAAI,CAAC;AAAA,IACrD;AAAA,EACD,CAAC;AACD,MAAI,mCAAmC,YAAY,MAAM;AACxD,UAAM,MAAM,OAAO,IAAI;AACvB,UAAM,UAAU,IAAI,YAAY;AAChC,UAAM,YAAY,IAAI,KAAK,MAAM;AACjC,UAAM,OAAO,IAAI,KAAK,MAAM,KAAK,CAAC,YAAY,oBAAoB,SAAS,IAAI,CAAC,KAAK,cAAc;AACnG,UAAM,QAAQ,MAAM,KAAK,MAAM,QAAQ;AACvC,QAAI,QAAQ,SAAS,CAAC,QAAQ,CAAC,OAAO;AACrC,YAAM,MAAM,MAAM,WAAW,MAAM;AAAA,QAClC;AAAA,QACA,aAAa,OAAO;AAAA,QACpB,aAAa,OAAO;AAAA,QACpB;AAAA,MACD,CAAC;AACD,YAAM,IAAIA,gBAAe,YAAY,KAAK,KAAK,IAAI,CAAC;AAAA,IACrD;AAAA,EACD,CAAC;AACD,MAAI,2BAA2B,SAAS,UAAU,MAAM;AACvD,UAAM,MAAM,OAAO,IAAI;AACvB,UAAM,UAAU,IAAI,YAAY;AAChC,UAAM,UAAU,IAAI,KAAK,MAAM,QAAQ,CAAC;AACxC,UAAM,YAAY,IAAI,KAAK,MAAM;AACjC,UAAM,WAAW,SAAS;AAC1B,SAAK,OAAO,WAAW,oBAAoB,SAAS,IAAI,GAAG,YAAY,QAAQ,KAAK,CAAC,KAAK,OAAO,yCAAyC,WAAW,KAAK,qBAAqB,SAAS,QAAQ,IAAI,YAAY,QAAQ,KAAK,CAAC,KAAK,OAAO,8CAA8C,MAAM,SAAS,QAAQ;AAAA,EAChT,CAAC;AACD,MAAI,4BAA4B,YAAY,MAAM;AACjD,UAAM,MAAM,OAAO,IAAI;AACvB,UAAM,UAAU,IAAI,YAAY;AAChC,UAAM,WAAW,IAAI,KAAK,MAAM,GAAG,EAAE;AACrC,SAAK,OAAO,YAAY,oBAAoB,UAAU,IAAI,GAAG,kBAAkB,OAAO,0CAA0C,kBAAkB,OAAO,8CAA8C,MAAM,QAAQ;AAAA,EACtN,CAAC;AAID,WAAS,4BAA4B,WAAW,UAAU,yBAAyB;AAClF,UAAM,4BAA4B,UAAU,KAAK;AACjD,UAAM,2BAA2B,SAAS,KAAK;AAC/C,QAAI,0BAA0B,WAAW,EAAG,QAAO,CAAC;AACpD,QAAI,yBAAyB,WAAW,EAAG,QAAO;AAClD,WAAO,0BAA0B,CAAC,IAAI,yBAAyB,CAAC;AAAA,EACjE;AACA,MAAI,CAAC,wBAAwB,GAAG,SAAS,WAAW,0BAA0B,MAAM;AACnF,UAAM,YAAY,OAAO,IAAI;AAC7B,QAAI,CAAC,eAAe,SAAS,EAAG,OAAM,IAAI,UAAU,GAAG,MAAM,QAAQ,SAAS,CAAC,kCAAkC;AACjH,SAAK,OAAO,4BAA4B,WAAW,WAAW,uBAAuB,GAAG,aAAa,UAAU,YAAY,CAAC,iCAAiC,UAAU,YAAY,CAAC,KAAK,aAAa,UAAU,YAAY,CAAC,qCAAqC,UAAU,YAAY,CAAC,KAAK,WAAW,SAAS;AAAA,EACnT,CAAC;AACD,MAAI,CAAC,uBAAuB,GAAG,SAAS,WAAW,0BAA0B,MAAM;AAClF,UAAM,YAAY,OAAO,IAAI;AAC7B,QAAI,CAAC,eAAe,SAAS,EAAG,OAAM,IAAI,UAAU,GAAG,MAAM,QAAQ,SAAS,CAAC,kCAAkC;AACjH,SAAK,OAAO,4BAA4B,WAAW,WAAW,uBAAuB,GAAG,aAAa,UAAU,YAAY,CAAC,gCAAgC,UAAU,YAAY,CAAC,KAAK,aAAa,UAAU,YAAY,CAAC,oCAAoC,UAAU,YAAY,CAAC,KAAK,WAAW,SAAS;AAAA,EACjT,CAAC;AACD,MAAI,CAAC,WAAW,cAAc,GAAG,SAAS,UAAU;AACnD,QAAI,OAAO,aAAa,YAAY,OAAO,aAAa,eAAe,oBAAoB,OAAQ,QAAO,KAAK,OAAO,QAAQ;AAC9H,UAAM,MAAM,KAAK;AACjB,UAAM,UAAU,MAAM,KAAK,MAAM,SAAS;AAC1C,UAAM,QAAQ,MAAM,KAAK,MAAM,QAAQ;AACvC,QAAI,SAAS;AACb,QAAI,YAAY,UAAW,UAAS;AAAA,aAC3B,YAAY,cAAc,OAAO,QAAQ,WAAY,KAAI,CAAC,OAAO;AACzE,YAAM,UAAU,MAAM,KAAK,MAAM,SAAS,KAAK;AAC/C,YAAM,IAAIA,gBAAe,SAAS,EAAE,UAAU,MAAM,GAAG,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,IAChF,MAAO;AAAA,SACF;AACJ,UAAI,UAAU;AACd,UAAI;AACH,YAAI;AAAA,MACL,SAAS,KAAK;AACb,kBAAU;AACV,iBAAS;AAAA,MACV;AACA,UAAI,CAAC,WAAW,CAAC,OAAO;AACvB,cAAM,UAAU,MAAM,KAAK,MAAM,SAAS,KAAK;AAC/C,cAAM,IAAIA,gBAAe,SAAS,EAAE,UAAU,MAAM,GAAG,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,MAChF;AAAA,IACD;AACA,QAAI,OAAO,aAAa,YAAY;AACnC,YAAM,OAAO,SAAS,QAAQ,SAAS,UAAU,YAAY;AAC7D,aAAO,KAAK,OAAO,UAAU,kBAAkB,UAAU,oCAAoC,IAAI,IAAI,wCAAwC,IAAI,IAAI,UAAU,MAAM;AAAA,IACtK;AACA,QAAI,QAAQ,QAAQ,GAAG;AACtB,YAAMI,SAAQ,OAAO,QAAQ,UAAU,CAAC,GAAG,eAAe,gBAAgB,CAAC;AAC3E,aAAO,KAAK,OAAOA,QAAO,wCAAwC,4CAA4C,UAAU,MAAM;AAAA,IAC/H;AACA,QAAI,OAAO,aAAa,YAAY,qBAAqB,YAAY,OAAO,SAAS,oBAAoB,YAAY;AACpH,YAAM,UAAU;AAChB,aAAO,KAAK,OAAO,UAAU,QAAQ,gBAAgB,MAAM,GAAG,8CAA8C,kDAAkD,SAAS,MAAM;AAAA,IAC9K;AACA,UAAM,QAAQ,OAAO,QAAQ,UAAU,CAAC,GAAG,eAAe,gBAAgB,CAAC;AAC3E,WAAO,KAAK,OAAO,OAAO,2CAA2C,+CAA+C,UAAU,MAAM;AAAA,EACrI,CAAC;AACD,GAAC;AAAA,IACA,MAAM;AAAA,IACN,WAAW,CAAC,QAAQ,IAAI,KAAK,eAAe,SAAS,KAAK,IAAI,KAAK,eAAe,KAAK,CAAC,EAAE,MAAApB,MAAK,MAAMA,UAAS,WAAW;AAAA,IACzH,QAAQ;AAAA,EACT,GAAG;AAAA,IACF,MAAM,CAAC,kBAAkB,UAAU;AAAA,IACnC,WAAW,CAAC,QAAQ,IAAI,KAAK,MAAM,SAAS,KAAK,IAAI,KAAK,QAAQ,KAAK,CAAC,EAAE,MAAAA,MAAK,MAAMA,UAAS,OAAO;AAAA,IACrG,QAAQ;AAAA,EACT,CAAC,EAAE,QAAQ,CAAC,EAAE,MAAM,WAAW,OAAO,MAAM;AAC3C,QAAI,MAAM,WAAW;AACpB,YAAM,MAAM,OAAO,IAAI;AACvB,YAAM,UAAU,IAAI,YAAY;AAChC,YAAM,OAAO,UAAU,GAAG;AAC1B,WAAK,OAAO,MAAM,aAAa,OAAO,wBAAwB,MAAM,kBAAkB,aAAa,OAAO,4BAA4B,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK;AAAA,IACnK,CAAC;AAAA,EACF,CAAC;AACD,GAAC;AAAA,IACA,MAAM;AAAA,IACN,WAAW,CAAC,KAAK,UAAU,IAAI,KAAK,eAAe,OAAO,CAAC,GAAG,EAAE,MAAAA,MAAK,MAAMA,UAAS,cAAc,EAAE,IAAI,GAAG,CAAC,MAAM;AAAA,IAClH,QAAQ;AAAA,EACT,GAAG;AAAA,IACF,MAAM,CAAC,uBAAuB,eAAe;AAAA,IAC7C,WAAW,CAAC,KAAK,UAAU,IAAI,KAAK,QAAQ,OAAO,CAAC,GAAG,EAAE,MAAAA,MAAK,MAAMA,UAAS,UAAU,IAAI,EAAE,GAAG,CAAC,MAAM;AAAA,IACvG,QAAQ;AAAA,EACT,CAAC,EAAE,QAAQ,CAAC,EAAE,MAAM,WAAW,OAAO,MAAM;AAC3C,QAAI,MAAM,SAAS,OAAO;AACzB,YAAM,MAAM,OAAO,IAAI;AACvB,YAAM,UAAU,IAAI,YAAY;AAChC,YAAM,OAAO,UAAU,KAAK,KAAK;AACjC,WAAK,OAAO,MAAM,aAAa,OAAO,wBAAwB,MAAM,IAAI,KAAK,UAAU,aAAa,OAAO,4BAA4B,MAAM,IAAI,KAAK,UAAU,4BAA4B,KAAK,IAAI,4BAA4B,IAAI,IAAI,KAAK;AAAA,IAC/O,CAAC;AAAA,EACF,CAAC;AACD,GAAC;AAAA,IACA,MAAM;AAAA,IACN,WAAW,CAAC,KAAK,UAAU,IAAI,KAAK,eAAe,KAAK,CAAC,EAAE,MAAAA,OAAM,OAAO,OAAO,MAAMA,UAAS,eAAe,OAAO,OAAO,MAAM,CAAC;AAAA,IAClI,QAAQ;AAAA,EACT,GAAG;AAAA,IACF,MAAM,CAAC,sBAAsB,cAAc;AAAA,IAC3C,WAAW,CAAC,KAAK,UAAU,IAAI,KAAK,QAAQ,KAAK,CAAC,EAAE,MAAAA,OAAM,OAAO,OAAO,MAAMA,UAAS,YAAY,OAAO,OAAO,MAAM,CAAC;AAAA,IACxH,QAAQ;AAAA,EACT,CAAC,EAAE,QAAQ,CAAC,EAAE,MAAM,WAAW,OAAO,MAAM;AAC3C,QAAI,MAAM,SAAS,OAAO;AACzB,YAAM,MAAM,OAAO,IAAI;AACvB,YAAM,OAAO,UAAU,KAAK,KAAK;AACjC,YAAM,QAAQ,MAAM,KAAK,MAAM,QAAQ;AACvC,UAAI,QAAQ,SAAS,CAAC,QAAQ,CAAC,OAAO;AACrC,cAAM,UAAU,IAAI,YAAY;AAChC,cAAM,MAAM,MAAM,WAAW,MAAM;AAAA,UAClC;AAAA,UACA,aAAa,OAAO,QAAQ,MAAM;AAAA,UAClC,aAAa,OAAO,YAAY,MAAM;AAAA,UACtC;AAAA,QACD,CAAC;AACD,cAAM,UAAU,WAAW,WAAW,IAAI,KAAK,UAAU,IAAI,KAAK;AAClE,cAAM,IAAIgB,gBAAe,cAAc,KAAK,SAAS,KAAK,KAAK,CAAC;AAAA,MACjE;AAAA,IACD,CAAC;AAAA,EACF,CAAC;AACD,GAAC;AAAA,IACA,MAAM;AAAA,IACN,WAAW,CAAC,KAAK,UAAU;AAC1B,YAAM,SAAS,IAAI,KAAK,eAAe,GAAG,EAAE;AAC5C,aAAO,QAAQ,UAAU,OAAO,SAAS,eAAe,OAAO,OAAO,OAAO,KAAK,CAAC;AAAA,IACpF;AAAA,IACA,QAAQ;AAAA,EACT,GAAG;AAAA,IACF,MAAM;AAAA,IACN,WAAW,CAAC,KAAK,UAAU;AAC1B,YAAM,SAAS,IAAI,KAAK,QAAQ,GAAG,EAAE;AACrC,aAAO,QAAQ,UAAU,OAAO,SAAS,YAAY,OAAO,OAAO,OAAO,KAAK,CAAC;AAAA,IACjF;AAAA,IACA,QAAQ;AAAA,EACT,CAAC,EAAE,QAAQ,CAAC,EAAE,MAAM,WAAW,OAAO,MAAM;AAC3C,QAAI,MAAM,SAAS,OAAO;AACzB,YAAM,MAAM,OAAO,IAAI;AACvB,YAAM,UAAU,WAAW,WAAW,IAAI,KAAK,UAAU,IAAI,KAAK,gBAAgB,GAAG,EAAE;AACvF,YAAM,UAAU,IAAI,YAAY;AAChC,WAAK,OAAO,UAAU,KAAK,KAAK,GAAG,kBAAkB,OAAO,aAAa,MAAM,WAAW,kBAAkB,OAAO,iBAAiB,MAAM,WAAW,OAAO,QAAQ,KAAK;AAAA,IAC1K,CAAC;AAAA,EACF,CAAC;AACD,GAAC;AAAA,IACA,MAAM;AAAA,IACN,WAAW,CAAC,KAAK,OAAO,UAAU;AACjC,YAAM,SAAS,IAAI,KAAK,eAAe,QAAQ,CAAC;AAChD,aAAO,UAAU,OAAO,SAAS,eAAe,OAAO,OAAO,OAAO,KAAK;AAAA,IAC3E;AAAA,IACA,QAAQ;AAAA,EACT,GAAG;AAAA,IACF,MAAM;AAAA,IACN,WAAW,CAAC,KAAK,OAAO,UAAU;AACjC,YAAM,SAAS,IAAI,KAAK,QAAQ,QAAQ,CAAC;AACzC,aAAO,UAAU,OAAO,SAAS,YAAY,OAAO,OAAO,OAAO,KAAK;AAAA,IACxE;AAAA,IACA,QAAQ;AAAA,EACT,CAAC,EAAE,QAAQ,CAAC,EAAE,MAAM,WAAW,OAAO,MAAM;AAC3C,QAAI,MAAM,SAAS,SAAS,OAAO;AAClC,YAAM,MAAM,OAAO,IAAI;AACvB,YAAM,UAAU,IAAI,YAAY;AAChC,YAAM,UAAU,WAAW,WAAW,IAAI,KAAK,UAAU,IAAI,KAAK,gBAAgB,UAAU,CAAC;AAC7F,YAAM,cAAc,GAAG,QAAQ,OAAO,CAAC;AACvC,WAAK,OAAO,UAAU,KAAK,SAAS,KAAK,GAAG,YAAY,WAAW,KAAK,OAAO,aAAa,MAAM,WAAW,YAAY,WAAW,KAAK,OAAO,iBAAiB,MAAM,WAAW,OAAO,QAAQ,KAAK;AAAA,IACvM,CAAC;AAAA,EACF,CAAC;AAED,MAAI,eAAe,SAAS,SAAS;AACpC,eAAW,OAAO,QAAS,OAAM,KAAK,MAAM,KAAK,QAAQ,GAAG,CAAC;AAC7D,WAAO;AAAA,EACR,CAAC;AACD,QAAM,YAAY,KAAK,UAAU,WAAW,YAAY,SAAS,sBAAsB;AACtF,UAAM,QAAwB,oBAAI,MAAM,UAAU;AAClD,UAAM,KAAK,MAAM,WAAW,UAAU;AACtC,UAAM,KAAK,MAAM,SAAS,KAAK;AAC/B,UAAMD,QAAO,MAAM,KAAK,MAAM,aAAa;AAC3C,UAAM,MAAM,MAAM,KAAK,MAAM,QAAQ;AACrC,QAAI,MAAM,KAAK,MAAM,MAAM,EAAG,OAAM,IAAI,YAAY,8DAA8D;AAClH,QAAI,OAAO,KAAK,SAAS,WAAY,OAAM,IAAI,UAAU,qEAAqE,OAAO,GAAG,IAAI;AAC5I,UAAM,QAAQ,IAAI,MAAM,MAAM,EAAE,KAAK,CAAC,QAAQ,KAAK,aAAa;AAC/D,YAAM,SAAS,QAAQ,IAAI,QAAQ,KAAK,QAAQ;AAChD,UAAI,OAAO,WAAW,WAAY,QAAO,kBAAkB,KAAK,YAAY,QAAQ;AACpF,aAAO,IAAI,SAAS;AACnB,cAAM,KAAK,MAAM,SAAS,GAAG;AAC7B,cAAM,UAAU,QAAQ,QAAQ,GAAG,EAAE,KAAK,CAAC,UAAU;AACpD,gBAAM,KAAK,MAAM,UAAU,KAAK;AAChC,iBAAO,OAAO,KAAK,MAAM,GAAG,IAAI;AAAA,QACjC,GAAG,CAAC,QAAQ;AACX,gBAAM,SAAS,IAAIC,gBAAe,qBAAqB,MAAM,QAAQ,GAAG,CAAC,0BAA0B,EAAE,UAAU,MAAM,CAAC;AACtH,iBAAO,QAAQ;AACf,gBAAM;AAAA,QACP,CAAC,EAAE,MAAM,CAAC,QAAQ;AACjB,cAAI,QAAQ,GAAG,KAAK,MAAM,MAAO,KAAI,QAAQ,MAAM,MAAM,QAAQ,MAAM,SAAS,IAAI,OAAO;AAC3F,gBAAM;AAAA,QACP,CAAC;AACD,eAAO,kBAAkBD,OAAM,SAAS,uBAAuB,OAAO,MAAM,CAAC,CAAC,KAAK,MAAM,GAAG,OAAO,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,MAC5H;AAAA,IACD,EAAE,CAAC;AACH,WAAO;AAAA,EACR,CAAC;AACD,QAAM,YAAY,KAAK,UAAU,WAAW,WAAW,SAAS,qBAAqB;AACpF,UAAM,QAAwB,oBAAI,MAAM,SAAS;AACjD,UAAM,KAAK,MAAM,WAAW,SAAS;AACrC,UAAM,KAAK,MAAM,SAAS,KAAK;AAC/B,UAAMA,QAAO,MAAM,KAAK,MAAM,aAAa;AAC3C,UAAM,MAAM,MAAM,KAAK,MAAM,QAAQ;AACrC,UAAM,UAAU,OAAO,QAAQ,aAAa,IAAI,IAAI;AACpD,QAAI,MAAM,KAAK,MAAM,MAAM,EAAG,OAAM,IAAI,YAAY,6DAA6D;AACjH,QAAI,OAAO,SAAS,SAAS,WAAY,OAAM,IAAI,UAAU,oEAAoE,OAAO,OAAO,IAAI;AACnJ,UAAM,QAAQ,IAAI,MAAM,MAAM,EAAE,KAAK,CAAC,QAAQ,KAAK,aAAa;AAC/D,YAAM,SAAS,QAAQ,IAAI,QAAQ,KAAK,QAAQ;AAChD,UAAI,OAAO,WAAW,WAAY,QAAO,kBAAkB,KAAK,YAAY,QAAQ;AACpF,aAAO,IAAI,SAAS;AACnB,cAAM,KAAK,MAAM,SAAS,GAAG;AAC7B,cAAM,UAAU,QAAQ,QAAQ,OAAO,EAAE,KAAK,CAAC,UAAU;AACxD,gBAAM,IAAIC,gBAAe,qBAAqB,MAAM,QAAQ,KAAK,CAAC,0BAA0B;AAAA,YAC3F,UAAU;AAAA,YACV,UAA0B,oBAAI,MAAM,kBAAkB;AAAA,YACtD,QAAQ;AAAA,UACT,CAAC;AAAA,QACF,GAAG,CAAC,QAAQ;AACX,gBAAM,KAAK,MAAM,UAAU,GAAG;AAC9B,iBAAO,OAAO,KAAK,MAAM,GAAG,IAAI;AAAA,QACjC,CAAC,EAAE,MAAM,CAAC,QAAQ;AACjB,cAAI,QAAQ,GAAG,KAAK,MAAM,MAAO,KAAI,QAAQ,MAAM,MAAM,QAAQ,MAAM,SAAS,IAAI,OAAO;AAC3F,gBAAM;AAAA,QACP,CAAC;AACD,eAAO,kBAAkBD,OAAM,SAAS,uBAAuB,OAAO,MAAM,CAAC,CAAC,KAAK,MAAM,GAAG,OAAO,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,MAC5H;AAAA,IACD,EAAE,CAAC;AACH,WAAO;AAAA,EACR,CAAC;AACF;AACA,SAAS,YAAY,KAAK,KAAK,gBAAgB;AAC9C,MAAI,IAAI,KAAK,MAAM,OAAQ,QAAO,EAAE,KAAK;AAAA;AAAA;AAAA;AAAA,EAAoB,IAAI,KAAK,MAAM,IAAI,CAAC,SAAS7B,OAAM;AAC/F,QAAI,aAAa,EAAE,KAAK,KAAK,QAAQA,KAAI,CAAC,CAAC,IAAI,IAAI,YAAY,CAAC;AAAA;AAAA,CAAY;AAC5E,QAAI,eAAgB,eAAc,KAAK,gBAAgB,SAAS,EAAE,qBAAqB,KAAK,CAAC;AAAA,QACxF,eAAc,UAAU,OAAO,EAAE,MAAM,IAAI,EAAE,IAAI,CAAC,SAAS,OAAO,IAAI,EAAE,EAAE,KAAK,IAAI;AACxF,kBAAc;AACd,WAAO;AAAA,EACR,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE;AACf,SAAO,EAAE,KAAK;AAAA;AAAA,mBAAwB,EAAE,KAAK,IAAI,KAAK,MAAM,MAAM,CAAC;AAAA,CAAI;AACvE,SAAO;AACR;AACA,SAAS,cAAc,KAAK,SAAS,KAAK,kBAAkB;AAC3D,MAAI,QAAQ,OAAQ,QAAO,EAAE,KAAK;AAAA;AAAA;AAAA;AAAA,EAAoB,QAAQ,IAAI,CAAC,YAAYA,OAAM;AACpF,QAAI,aAAa,EAAE,KAAK,KAAK,QAAQA,KAAI,CAAC,CAAC,IAAI,IAAI,YAAY,CAAC;AAAA;AAAA,CAAmB;AACnF,QAAI,iBAAkB,eAAc,KAAK,kBAAkB,WAAW,OAAO,EAAE,qBAAqB,KAAK,CAAC;AAAA,QACrG,eAAc,UAAU,UAAU,EAAE,MAAM,IAAI,EAAE,IAAI,CAAC,SAAS,OAAO,IAAI,EAAE,EAAE,KAAK,IAAI;AAC3F,kBAAc;AACd,WAAO;AAAA,EACR,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE;AACf,SAAO,EAAE,KAAK;AAAA;AAAA,mBAAwB,EAAE,KAAK,IAAI,KAAK,MAAM,MAAM,CAAC;AAAA,CAAI;AACvE,SAAO;AACR;AAEA,SAAS,gBAAgB,WAAWyB,SAAQ;AAC3C,QAAM,MAAM,UAAU;AACtB,QAAM,QAAQ,cAAK,KAAK,WAAW,QAAQ;AAC3C,QAAM,UAAU,cAAK,KAAK,WAAW,SAAS,KAAK;AACnD,QAAM,gBAAgB,cAAK,KAAK,WAAW,SAAS;AACpD,QAAM,YAAY;AAAA,IACjB,GAAG,gBAAgB;AAAA,IACnB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACA,MAAI,OAAO,cAAK,KAAK,WAAW,aAAa;AAC7C,QAAM,kBAAkB,MAAM,gBAAgB;AAC9C,MAAI,MAAM,SAAS,OAAQ,QAAO;AAClC,QAAM,eAAe;AAAA,IACpB,GAAG,SAASA,OAAM;AAAA,IAClB;AAAA,IACA,eAAe,yBAAyB;AAAA,IACxC;AAAA,IACA,OAAO;AAAA,IACP;AAAA,IACA;AAAA;AAAA,IAEA,kBAAkB,CAAC;AAAA,IACnB,MAAM,cAAK,KAAK,WAAW,MAAM;AAAA,IACjC,MAAM,cAAK,KAAK,WAAW,MAAM;AAAA,IACjC;AAAA,EACD;AACA,SAAO,OAAO,cAAc,EAAE,KAAK,CAAC;AACpC,SAAO;AAAA,IACN,OAAO;AAAA,IACP;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACD;AACA,IAAM,kBAAN,cAA8B,MAAM;AAAA,EACnC;AAAA,EACA;AAAA,EACA;AAAA,EACA,YAAY,SAAS,QAAQ,UAAU,0BAA0B;AAChE,UAAM,OAAO;AACb,SAAK,SAAS;AACd,SAAK,WAAW;AAChB,SAAK,2BAA2B;AAAA,EACjC;AACD;AACA,SAAS,iBAAiB,GAAGA,SAAQ,UAAU;AAC9C,SAAO,CAACU,IAAG,UAAU;AACpB,WAAO,QAAQ,QAAQ,EAAE,QAAQ,CAAC,CAAC,qBAAqB,eAAe,MAAM;AAC5E,eAAS,+BAA+B,MAAM;AAC7C,cAAM,EAAE,OAAO,OAAO,KAAK,cAAc,IAAI,gBAAgB,MAAMV,OAAM;AACzE,cAAM,SAAS,gBAAgB,KAAK,OAAO,KAAK,GAAG,IAAI;AACvD,YAAI,UAAU,OAAO,WAAW,YAAY,OAAO,OAAO,SAAS,WAAY,QAAO,OAAO,KAAK,CAAC,EAAE,MAAAW,OAAM,SAAAC,UAAS,QAAAC,SAAQ,UAAAC,WAAU,MAAAC,MAAK,MAAM;AAChJ,cAAIJ,SAAQ,SAAS,CAACA,SAAQ,CAAC,OAAO;AACrC,kBAAM,gBAAgB,gBAAgB,GAAG,aAAa,OAAO,MAAMC,SAAQ;AAC3E,kBAAM,IAAI,gBAAgB,cAAcC,SAAQC,WAAU;AAAA,cACzD,eAAe;AAAA,cACf,MAAAC;AAAA,YACD,CAAC;AAAA,UACF;AAAA,QACD,CAAC;AACD,cAAM,EAAE,MAAM,SAAS,QAAQ,UAAU,KAAK,IAAI;AAClD,YAAI,QAAQ,SAAS,CAAC,QAAQ,CAAC,OAAO;AACrC,gBAAM,gBAAgB,gBAAgB,GAAG,aAAa,OAAO,MAAM,QAAQ;AAC3E,gBAAM,IAAI,gBAAgB,cAAc,QAAQ,UAAU;AAAA,YACzD,eAAe;AAAA,YACf;AAAA,UACD,CAAC;AAAA,QACF;AAAA,MACD;AACA,YAAM,cAAc,cAAc,OAAO,qBAAqB,2BAA2B;AACzF,YAAM,UAAU,WAAW,oBAAoB,EAAE,UAAU,qBAAqB,WAAW;AAC3F,YAAM,UAAU,EAAE,UAAU,WAAW,qBAAqB,WAAW;AAIvE,UAAI,gBAAgB,0BAA0B;AAC7C,cAAM,cAAc,EAAE,UAAU,UAAU,mBAAmB;AAC7D,eAAO,eAAe,aAAa,4BAA4B,EAAE,OAAO,KAAK,CAAC;AAAA,MAC/E;AAAA,MACA,MAAM,sBAAsBb,mBAAkB;AAAA,QAC7C,YAAY,UAAU,UAAU,QAAQ;AACvC,gBAAM,QAAQ,OAAO;AAAA,QACtB;AAAA,QACA,gBAAgB,OAAO;AACtB,gBAAM,EAAE,KAAK,IAAI,gBAAgB,KAAK,KAAK,kBAAkBF,OAAM,GAAG,OAAO,GAAG,KAAK,MAAM;AAC3F,iBAAO,KAAK,UAAU,CAAC,OAAO;AAAA,QAC/B;AAAA,QACA,WAAW;AACV,iBAAO,GAAG,KAAK,UAAU,SAAS,EAAE,GAAG,mBAAmB;AAAA,QAC3D;AAAA,QACA,kBAAkB;AACjB,iBAAO;AAAA,QACR;AAAA,QACA,sBAAsB;AACrB,iBAAO,GAAG,KAAK,SAAS,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,SAAS,UAAU,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,QACnF;AAAA,MACD;AACA,YAAM,gBAAgB,IAAI,WAAW,IAAI,cAAc,OAAO,GAAG,MAAM;AACvE,aAAO,eAAeA,SAAQ,qBAAqB;AAAA,QAClD,cAAc;AAAA,QACd,YAAY;AAAA,QACZ,OAAO;AAAA,QACP,UAAU;AAAA,MACX,CAAC;AACD,aAAO,eAAeA,QAAO,KAAK,qBAAqB;AAAA,QACtD,cAAc;AAAA,QACd,YAAY;AAAA,QACZ,OAAO,IAAI,WAAW,IAAI,cAAc,MAAM,GAAG,MAAM;AAAA,QACvD,UAAU;AAAA,MACX,CAAC;AAGD,aAAO,eAAe,WAAW,0BAA0B,GAAG,qBAAqB;AAAA,QAClF,cAAc;AAAA,QACd,YAAY;AAAA,QACZ,OAAO;AAAA,QACP,UAAU;AAAA,MACX,CAAC;AAAA,IACF,CAAC;AAAA,EACF;AACD;AACA,IAAM,aAAa,CAAC,MAAM,UAAU;AACnC,QAAM,UAAU,KAAK,QAAQ,UAAU,CAACA,SAAQ,YAAY;AAC3D,QAAI,iBAAiB,MAAMA,SAAQ,OAAO,CAAC;AAAA,EAC5C,CAAC;AACF;AAEA,SAAS,cAAc,OAAO;AAC7B,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,aAAa,SAAS,OAAO,MAAM,SAAS,SAAS;AAC5G;AACA,SAAS,UAAU,KAAK;AACvB,SAAO,IAAI,eAAe,SAAS;AAAA,IAClC,uBAAuB;AAAA,IACvB,uBAAuB;AAAA,EACxB,CAAC;AACF;AACA,IAAM,gBAAgB;AAAA,EACrB,eAAe,QAAQ,UAAU,SAAS;AACzC,UAAM,EAAE,aAAAhB,cAAa,gBAAAgC,iBAAgB,gBAAAC,gBAAe,IAAI,KAAK;AAC7D,UAAM,QAAQ,SAAS,SAAS;AAChC,QAAI,CAAC,cAAc,MAAM,EAAG,OAAM,IAAI,UAAU,GAAGjC,aAAY,iBAAiB,CAAC,qDAAqD;AACtI,QAAI,CAAC,cAAc,QAAQ,EAAG,OAAM,IAAI,UAAU,GAAGA,aAAY,iBAAiB,CAAC,uDAAuD;AAC1I,UAAM,YAAY,SAAS,QAAQ,QAAQ,IAAI;AAC/C,UAAM,OAAO,OAAO,QAAQ,OAAO;AACnC,WAAO;AAAA,MACN;AAAA,MACA,SAAS,MAAM;AACd,cAAM,aAAa,OAAO,QAAQ,OAAO,SAAS,QAAQ,QAAQ,SAAS,QAAQ,OAAO,KAAK,QAAQ,CAAC;AACxG,eAAO,OAAO,GAAGA,aAAY,qBAAqB,CAAC;AAAA;AAAA,qCAA0C,KAAK,IAAI,OAAO,QAAQ,CAAC,CAAC;AAAA;AAAA,YAA0BgC,gBAAe,UAAU,OAAO,WAAW,IAAI,CAAC,CAAC;AAAA,YAAuBC,gBAAe,UAAU,SAAS,WAAW,IAAI,CAAC,CAAC;AAAA,IAAe,GAAGjC,aAAY,iBAAiB,CAAC;AAAA;AAAA,uBAA4B,QAAQ,IAAI,iBAAiB,QAAQ,KAAK,QAAQ,CAAC,CAAC,MAAM,EAAE,aAAa,OAAO,QAAQ,IAAI,IAAI,GAAG,QAAQ,aAAa,QAAQ,KAAK,IAAI,OAAO,QAAQ,CAAC,CAAC,UAAU;AAAA;AAAA,YAAkBgC,gBAAe,UAAU,OAAO,WAAW,IAAI,CAAC,CAAC;AAAA,YAAuBC,gBAAe,UAAU,SAAS,WAAW,IAAI,CAAC,CAAC;AAAA;AAAA,MAC1oB;AAAA,IACD;AAAA,EACD;AAAA,EACA,eAAe,QAAQ,UAAU,SAAS;AACzC,UAAM,EAAE,aAAAjC,cAAa,gBAAAgC,iBAAgB,gBAAAC,gBAAe,IAAI,KAAK;AAC7D,UAAM,QAAQ,SAAS,SAAS;AAChC,QAAI,CAAC,cAAc,MAAM,EAAG,OAAM,IAAI,UAAU,GAAGjC,aAAY,iBAAiB,CAAC,qDAAqD;AACtI,QAAI,CAAC,cAAc,QAAQ,EAAG,OAAM,IAAI,UAAU,GAAGA,aAAY,iBAAiB,CAAC,uDAAuD;AAC1I,UAAM,YAAY,SAAS,QAAQ,QAAQ,IAAI;AAC/C,UAAM,OAAO,OAAO,QAAQ,OAAO;AACnC,WAAO;AAAA,MACN;AAAA,MACA,SAAS,MAAM;AACd,cAAM,aAAa,OAAO,QAAQ,OAAO,SAAS,QAAQ,QAAQ,SAAS,QAAQ,OAAO,KAAK,QAAQ,CAAC;AACxG,eAAO,OAAO,GAAGA,aAAY,qBAAqB,CAAC;AAAA;AAAA,qCAA0C,QAAQ;AAAA;AAAA,YAA0BgC,gBAAe,UAAU,OAAO,WAAW,IAAI,CAAC,CAAC;AAAA,YAAuBC,gBAAe,UAAU,SAAS,WAAW,IAAI,CAAC,CAAC;AAAA,IAAe,GAAGjC,aAAY,iBAAiB,CAAC;AAAA;AAAA,uBAA4B,QAAQ,IAAI,iBAAiB,QAAQ,KAAK,QAAQ,CAAC,CAAC,MAAM,EAAE,aAAa,OAAO,QAAQ,IAAI,IAAI,GAAG,KAAK,IAAI,OAAO,QAAQ,CAAC,CAAC,aAAa,QAAQ,QAAQ,UAAU;AAAA;AAAA,YAAkBgC,gBAAe,UAAU,OAAO,WAAW,IAAI,CAAC,CAAC;AAAA,YAAuBC,gBAAe,UAAU,SAAS,WAAW,IAAI,CAAC,CAAC;AAAA;AAAA,MACxnB;AAAA,IACD;AAAA,EACD;AACD;AAEA,IAAI,gBAAgB,CAAC;AAErB,IAAIC;AACJ,IAAI;AAEJ,SAAS,gBAAiB;AACzB,MAAI,kBAAmB,QAAOA;AAC9B,sBAAoB;AAMpB,MAAI;AAGJ,MAAI,OAAO,mBAAmB,aAAa;AAEvC,mBAAe;AAAA,EACnB,WAAW,OAAO,WAAW,aAAa;AAEtC,mBAAe;AAAA,EACnB,OAAO;AAEH,mBAAe;AAAA,EACnB;AAEA,EAAAA,UAAS;AACT,SAAOA;AACR;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,uBAAwB;AAChC,MAAI,yBAA0B,QAAO;AACrC,6BAA2B;AAU3B,MAAI;AACJ,MAAI;AACA,UAAM9B,UAAS,CAAC;AAEhB,IAAAA,QAAO;AACP,oBAAgB;AAAA,EACpB,SAASsB,IAAG;AAIR,oBAAgB;AAAA,EACpB;AAEA,oBAAkB;AAClB,SAAO;AACR;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,8BAA+B;AACvC,MAAI,gCAAiC,QAAO;AAC5C,oCAAkC;AAElC,MAAIS,QAAO,SAAS;AACpB,MAAI,gBAAgB,qBAAqB;AAEzC,MAAI,uBAAuB;AAAA;AAAA,IAEvB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAKA,MAAI,eAAe;AACf,yBAAqB,KAAK,WAAW;AAAA,EACzC;AAEA,yBAAuB,SAASC,sBAAqB,WAAW;AAE5D,WAAO,OAAO,oBAAoB,SAAS,EAAE;AAAA,MAAO,SAChD,QACA,MACF;AACE,YAAI,qBAAqB,SAAS,IAAI,GAAG;AACrC,iBAAO;AAAA,QACX;AAEA,YAAI,OAAO,UAAU,IAAI,MAAM,YAAY;AACvC,iBAAO;AAAA,QACX;AAEA,eAAO,IAAI,IAAID,MAAK,KAAK,UAAU,IAAI,CAAC;AAExC,eAAO;AAAA,MACX;AAAA,MACA,uBAAO,OAAO,IAAI;AAAA,IAAC;AAAA,EACvB;AACA,SAAO;AACR;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,eAAgB;AACxB,MAAI,iBAAkB,QAAO;AAC7B,qBAAmB;AAEnB,MAAI,gBAAgB,4BAA4B;AAEhD,UAAQ,cAAc,MAAM,SAAS;AACrC,SAAO;AACR;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,uBAAwB;AAChC,MAAI,yBAA0B,QAAO;AACrC,6BAA2B;AAE3B,MAAIE,SAAQ,aAAa,EAAE;AAK3B,WAAS,aAAa,SAAS,KAAK;AAChC,QAAI,QAAQ,IAAI,EAAE,MAAM,QAAW;AAC/B,cAAQ,IAAI,EAAE,IAAI;AAAA,IACtB;AAEA,WAAO,QAAQ,IAAI,EAAE,IAAI,IAAI;AAAA,EACjC;AAKA,WAAS,mBAAmB,SAAS,KAAK,OAAO,OAAO;AACpD,QAAI,mBAAmB;AAEvB,QAAI,UAAU,MAAM,SAAS,GAAG;AAC5B,yBAAmB,IAAI,aAAa,MAAM,QAAQ,CAAC,CAAC;AAAA,IACxD;AAEA,QAAI,aAAa,SAAS,GAAG,KAAK,kBAAkB;AAChD,cAAQ,IAAI,EAAE,KAAK;AACnB,aAAO;AAAA,IACX;AAEA,WAAO;AAAA,EACX;AAeA,WAAS,cAAc,OAAO;AAC1B,QAAI,UAAU,CAAC;AAEf,QAAI,SAAS,UAAU,SAAS,IAAI,YAAY;AAEhD,WAAOA,OAAM,QAAQ,mBAAmB,KAAK,MAAM,OAAO,CAAC;AAAA,EAC/D;AAEA,oBAAkB;AAClB,SAAO;AACR;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,mBAAoB;AAC5B,MAAI,qBAAsB,QAAO;AACjC,yBAAuB;AAOvB,WAAS,UAAU,OAAO;AACtB,UAAM,OAAO,MAAM,eAAe,MAAM,YAAY;AACpD,WAAO,QAAQ;AAAA,EACnB;AAEA,gBAAc;AACd,SAAO;AACR;AAEA,IAAI,aAAa,CAAC;AAIlB,IAAI;AAEJ,SAAS,oBAAqB;AAC7B,MAAI,sBAAuB,QAAO;AAClC,0BAAwB;AACxB,GAAC,SAAU,SAAS;AASnB,YAAQ,OAAO,SAAU,MAAM,KAAK;AAChC,UAAI,UAAU,WAAY;AACtB,gBAAQ,aAAa,GAAG;AACxB,eAAO,KAAK,MAAM,MAAM,SAAS;AAAA,MACrC;AACA,UAAI,KAAK,WAAW;AAChB,gBAAQ,YAAY,KAAK;AAAA,MAC7B;AACA,aAAO;AAAA,IACX;AASA,YAAQ,aAAa,SAAU,aAAa,UAAU;AAClD,aAAO,GAAG,WAAW,IAAI,QAAQ,iFAAiF,WAAW;AAAA,IACjI;AAOA,YAAQ,eAAe,SAAU,KAAK;AAElC,UAAI,OAAO,YAAY,YAAY,QAAQ,aAAa;AAEpD,gBAAQ,YAAY,GAAG;AAAA,MAC3B,WAAW,QAAQ,MAAM;AACrB,gBAAQ,KAAK,GAAG;AAAA,MACpB,OAAO;AACH,gBAAQ,IAAI,GAAG;AAAA,MACnB;AAAA,IACJ;AAAA,EACD,GAAG,UAAU;AACb,SAAO;AACR;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,eAAgB;AACxB,MAAI,iBAAkB,QAAO;AAC7B,qBAAmB;AASnB,UAAQ,SAASA,OAAM,KAAKzC,KAAI;AAC5B,QAAI,OAAO;AAEX,QAAI;AAEA,UAAI,QAAQ,WAAY;AACpB,YAAI,CAACA,IAAG,MAAM,MAAM,SAAS,GAAG;AAE5B,gBAAM,IAAI,MAAM;AAAA,QACpB;AAAA,MACJ,CAAC;AAAA,IACL,SAAS,GAAG;AACR,aAAO;AAAA,IACX;AAEA,WAAO;AAAA,EACX;AACA,SAAO;AACR;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,sBAAuB;AAC/B,MAAI,wBAAyB,QAAO;AACpC,4BAA0B;AAO1B,iBAAe,SAAS0C,cAAa,MAAM;AACvC,QAAI,CAAC,MAAM;AACP,aAAO;AAAA,IACX;AAEA,QAAI;AACA,aACI,KAAK,eACL,KAAK;AAAA;AAAA;AAAA;AAAA,OAKJ,OAAO,IAAI,EAAE,MAAM,oBAAoB,KAAK,CAAC,GAAG,CAAC;AAAA,IAE1D,SAAS,GAAG;AAGR,aAAO;AAAA,IACX;AAAA,EACJ;AACA,SAAO;AACR;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,0BAA2B;AACnC,MAAI,4BAA6B,QAAO;AACxC,gCAA8B;AAE9B,MAAIC,QAAO,aAAa,EAAE;AAC1B,MAAI,QAAQ,aAAa,EAAE;AAK3B,WAAS,WAAWlD,IAAGC,IAAG;AAEtB,QAAI,QAAQD,GAAE,QAAQ,CAAC;AACvB,QAAI,QAAQC,GAAE,QAAQ,CAAC;AACvB,QAAI,MAAO,SAAS,MAAM,UAAW;AACrC,QAAI,MAAO,SAAS,MAAM,UAAW;AAErC,WAAO,MAAM,MAAM,KAAK;AAAA,EAC5B;AAaA,WAAS,iBAAiB,OAAO;AAC7B,WAAOiD,MAAK,MAAM,KAAK,GAAG,UAAU;AAAA,EACxC;AAEA,uBAAqB;AACrB,SAAO;AACR;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,mBAAoB;AAC5B,MAAI,qBAAsB,QAAO;AACjC,yBAAuB;AAEvB,MAAI,gBAAgB,4BAA4B;AAEhD,cAAY,cAAc,SAAS,SAAS;AAC5C,SAAO;AACR;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,aAAc;AACtB,MAAI,eAAgB,QAAO;AAC3B,mBAAiB;AAEjB,MAAI,gBAAgB,4BAA4B;AAEhD,QAAM,cAAc,IAAI,SAAS;AACjC,SAAO;AACR;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,gBAAiB;AACzB,MAAI,kBAAmB,QAAO;AAC9B,sBAAoB;AAEpB,MAAI,gBAAgB,4BAA4B;AAEhD,WAAS,cAAc,OAAO,SAAS;AACvC,SAAO;AACR;AAEA,IAAIC;AACJ,IAAI;AAEJ,SAAS,aAAc;AACtB,MAAI,eAAgB,QAAOA;AAC3B,mBAAiB;AAEjB,MAAI,gBAAgB,4BAA4B;AAEhD,EAAAA,OAAM,cAAc,IAAI,SAAS;AACjC,SAAOA;AACR;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,gBAAiB;AACzB,MAAI,kBAAmB,QAAO;AAC9B,sBAAoB;AAEpB,MAAI,gBAAgB,4BAA4B;AAEhD,WAAS,cAAc,OAAO,SAAS;AACvC,SAAO;AACR;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,oBAAqB;AAC7B,MAAI,sBAAuB,QAAO;AAClC,0BAAwB;AAExB,eAAa;AAAA,IACT,OAAO,aAAa;AAAA,IACpB,UAAU,iBAAiB;AAAA,IAC3B,KAAK,WAAW;AAAA,IAChB,QAAQ,cAAc;AAAA,IACtB,KAAK,WAAW;AAAA,IAChB,QAAQ,cAAc;AAAA,EAC1B;AACA,SAAO;AACR;AAEA,IAAI,eAAe,EAAC,SAAS,CAAC,EAAC;AAE/B,IAAI,aAAa,aAAa;AAE9B,IAAI;AAEJ,SAAS,oBAAqB;AAC7B,MAAI,sBAAuB,QAAO,aAAa;AAC/C,0BAAwB;AACxB,GAAC,SAAU,QAAQ,SAAS;AAC3B,KAAC,SAAUN,SAAQ,SAAS;AAC3B,aAAO,UAAU,QAAQ;AAAA,IAC1B,GAAE,aAAa,WAAY;AAM3B,UAAI,gBAAgB,OAAO,YAAY;AAGvC,UAAI,eAAe,OAAO,SAAS,WAAW,OAAO;AAErD,UAAI,eAAe,OAAO,WAAW;AACrC,UAAI,YAAY,OAAO,QAAQ;AAC/B,UAAI,YAAY,OAAO,QAAQ;AAC/B,UAAI,gBAAgB,OAAO,YAAY;AACvC,UAAI,gBAAgB,OAAO,YAAY;AACvC,UAAI,iBAAiB,OAAO,aAAa;AACzC,UAAI,uBAAuB,gBAAgB,OAAO,OAAO,aAAa;AACtE,UAAI,0BAA0B,gBAAgB,OAAO,OAAO,gBAAgB;AAC5E,UAAI,mBAAmB,aAAa,OAAO,IAAI,UAAU,YAAY;AACrE,UAAI,mBAAmB,aAAa,OAAO,IAAI,UAAU,YAAY;AACrE,UAAI,uBAAuB,oBAAoB,OAAO,gBAAe,oBAAI,IAAI,GAAE,QAAQ,CAAC;AACxF,UAAI,uBAAuB,oBAAoB,OAAO,gBAAe,oBAAI,IAAI,GAAE,QAAQ,CAAC;AACxF,UAAI,sBAAsB,wBAAwB,OAAO,MAAM,UAAU,OAAO,QAAQ,MAAM;AAC9F,UAAI,yBAAyB,uBAAuB,OAAO,eAAe,CAAC,EAAE,OAAO,QAAQ,EAAE,CAAC;AAC/F,UAAI,uBAAuB,wBAAwB,OAAO,OAAO,UAAU,OAAO,QAAQ,MAAM;AAChG,UAAI,0BAA0B,wBAAwB,OAAO,eAAe,GAAG,OAAO,QAAQ,EAAE,CAAC;AACjG,UAAI,0BAA0B;AAC9B,UAAI,2BAA2B;AAW/B,eAASO,YAAW,KAAK;AAevB,YAAI,YAAY,OAAO;AACvB,YAAI,cAAc,UAAU;AAC1B,iBAAO;AAAA,QACT;AAQA,YAAI,QAAQ,MAAM;AAChB,iBAAO;AAAA,QACT;AAkBA,YAAI,QAAQ,cAAc;AACxB,iBAAO;AAAA,QACT;AAQA,YACE,MAAM,QAAQ,GAAG,MAChB,4BAA4B,SAAS,EAAE,OAAO,eAAe,OAC9D;AACA,iBAAO;AAAA,QACT;AAIA,YAAI,OAAO,WAAW,YAAY,WAAW,MAAM;AAQjD,cAAI,OAAO,OAAO,aAAa,YAAY,QAAQ,OAAO,UAAU;AAClE,mBAAO;AAAA,UACT;AAqBA,cAAI,OAAO,OAAO,aAAa,YAAY,QAAQ,OAAO,UAAU;AAClE,mBAAO;AAAA,UACT;AAEA,cAAI,OAAO,OAAO,cAAc,UAAU;AAOxC,gBAAI,OAAO,OAAO,UAAU,cAAc,YACtC,QAAQ,OAAO,UAAU,WAAW;AACtC,qBAAO;AAAA,YACT;AAQA,gBAAI,OAAO,OAAO,UAAU,YAAY,YACpC,QAAQ,OAAO,UAAU,SAAS;AACpC,qBAAO;AAAA,YACT;AAAA,UACF;AAEA,eAAK,OAAO,OAAO,gBAAgB,cAC/B,OAAO,OAAO,gBAAgB,aAC9B,eAAe,OAAO,aAAa;AAOrC,gBAAI,IAAI,YAAY,cAAc;AAChC,qBAAO;AAAA,YACT;AAcA,gBAAI,IAAI,YAAY,MAAM;AACxB,qBAAO;AAAA,YACT;AAcA,gBAAI,IAAI,YAAY,MAAM;AACxB,qBAAO;AAAA,YACT;AAAA,UACF;AAAA,QACF;AAwBA,YAAI,YAAa,2BAA2B,IAAI,OAAO,WAAW;AAClE,YAAI,OAAO,cAAc,UAAU;AACjC,iBAAO;AAAA,QACT;AAEA,YAAI,eAAe,OAAO,eAAe,GAAG;AAS5C,YAAI,iBAAiB,OAAO,WAAW;AACrC,iBAAO;AAAA,QACT;AAQA,YAAI,iBAAiB,KAAK,WAAW;AACnC,iBAAO;AAAA,QACT;AAWA,YAAI,iBAAiB,iBAAiB,QAAQ,WAAW;AACvD,iBAAO;AAAA,QACT;AAQA,YAAI,aAAa,iBAAiB,IAAI,WAAW;AAC/C,iBAAO;AAAA,QACT;AAQA,YAAI,aAAa,iBAAiB,IAAI,WAAW;AAC/C,iBAAO;AAAA,QACT;AAQA,YAAI,iBAAiB,iBAAiB,QAAQ,WAAW;AACvD,iBAAO;AAAA,QACT;AAQA,YAAI,iBAAiB,iBAAiB,QAAQ,WAAW;AACvD,iBAAO;AAAA,QACT;AAQA,YAAI,kBAAkB,iBAAiB,SAAS,WAAW;AACzD,iBAAO;AAAA,QACT;AAQA,YAAI,aAAa,iBAAiB,sBAAsB;AACtD,iBAAO;AAAA,QACT;AAQA,YAAI,aAAa,iBAAiB,sBAAsB;AACtD,iBAAO;AAAA,QACT;AAQA,YAAI,uBAAuB,iBAAiB,wBAAwB;AAClE,iBAAO;AAAA,QACT;AAQA,YAAI,wBAAwB,iBAAiB,yBAAyB;AACpE,iBAAO;AAAA,QACT;AAQA,YAAI,iBAAiB,MAAM;AACzB,iBAAO;AAAA,QACT;AAEA,eAAO,OACJ,UACA,SACA,KAAK,GAAG,EACR,MAAM,yBAAyB,wBAAwB;AAAA,MAC5D;AAEA,aAAOA;AAAA,IAEP,EAAE;AAAA,EACH,GAAG,YAAY;AACf,SAAO,aAAa;AACrB;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,gBAAiB;AACzB,MAAI,kBAAmB,QAAO;AAC9B,sBAAoB;AAEpB,MAAIpC,QAAO,kBAAkB;AAO7B,WAAS,SAASqC,QAAO,OAAO;AAC5B,WAAOrC,MAAK,KAAK,EAAE,YAAY;AAAA,EACnC;AACA,SAAO;AACR;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,uBAAwB;AAChC,MAAI,yBAA0B,QAAO;AACrC,6BAA2B;AAO3B,WAAS,cAAc,OAAO;AAC1B,QAAI,SAAS,MAAM,UAAU;AAEzB,aAAO,MAAM,SAAS;AAAA,IAC1B;AACA,WAAO,OAAO,KAAK;AAAA,EACvB;AAEA,oBAAkB;AAClB,SAAO;AACR;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,aAAc;AACtB,MAAI,eAAgB,QAAO;AAC3B,mBAAiB;AAEjB,QAAM;AAAA,IACF,QAAQ,cAAc;AAAA,IACtB,eAAe,qBAAqB;AAAA,IACpC,WAAW,iBAAiB;AAAA,IAC5B,YAAY,kBAAkB;AAAA,IAC9B,OAAO,aAAa;AAAA,IACpB,cAAc,oBAAoB;AAAA,IAClC,kBAAkB,wBAAwB;AAAA,IAC1C,YAAY,kBAAkB;AAAA,IAC9B,QAAQ,cAAc;AAAA,IACtB,eAAe,qBAAqB;AAAA,EACxC;AACA,SAAO;AACR;AAEA,IAAI;AAEJ,SAAS,uBAAwB;AAChC,MAAI,yBAA0B,QAAO;AACrC,6BAA2B;AAE3B,QAAM,eAAe,WAAW,EAAE;AAClC,MAAI,cAAc;AAClB,MAAI,OAAO,wBAAwB,aAAa;AAC5C,QAAI;AACA,qBAAe,oBAAoB;AAAA,IACvC,QAAQ;AAAA,IAER;AACA,QAAI;AACA,6BAAuB,oBAAoB;AAAA,IAC/C,QAAQ;AAAA,IAER;AAAA,EACJ;AAifA,WAAS,WAAW,SAAS;AACzB,UAAM,aAAa,KAAK,IAAI,GAAG,EAAE,IAAI;AACrC,UAAM,iBAAiB;AACvB,UAAM,OAAO,WAAY;AACrB,aAAO;AAAA,IACX;AACA,UAAM,aAAa,WAAY;AAC3B,aAAO,CAAC;AAAA,IACZ;AACA,UAAM,YAAY,CAAC;AACnB,QAAI,eACA,wBAAwB;AAE5B,QAAI,QAAQ,YAAY;AACpB,gBAAU,aAAa;AACvB,sBAAgB,QAAQ,WAAW,MAAM,CAAC;AAC1C,8BAAwB,OAAO,kBAAkB;AAAA,IACrD;AACA,cAAU,eAAe,QAAQ,QAAQ,YAAY;AACrD,cAAU,cAAc,QAAQ,QAAQ,WAAW;AACnD,cAAU,gBAAgB,QAAQ,QAAQ,aAAa;AACvD,cAAU,SACN,QAAQ,WAAW,OAAO,QAAQ,QAAQ,WAAW;AACzD,cAAU,eACN,UAAU,UAAU,OAAO,QAAQ,QAAQ,OAAO,WAAW;AACjE,cAAU,WACN,QAAQ,WAAW,OAAO,QAAQ,QAAQ,aAAa;AAC3D,UAAM,gBAAgB,QAAQ,WAAW,QAAQ,uBAAuB,QAAQ,oBAAoB,KAAK;AACzG,cAAU,cACN,QAAQ,eAAe,OAAO,QAAQ,YAAY,QAAQ;AAC9D,UAAM,0BACF,QAAQ,gBACP,OAAO,QAAQ,aAAa,MAAM,qBAAqB;AAC5D,UAAM,qCACF,QAAQ,eACR,QAAQ,YAAY,eACpB,QAAQ,YAAY,YAAY;AACpC,cAAU,iBAAiB,OAAO,UAAU,eAAe;AAAA,MACvD;AAAA,MACA;AAAA,IACJ;AACA,cAAU,wBACN,QAAQ,yBACR,OAAO,QAAQ,0BAA0B;AAC7C,cAAU,uBACN,QAAQ,wBACR,OAAO,QAAQ,yBAAyB;AAC5C,cAAU,sBACN,QAAQ,uBACR,OAAO,QAAQ,wBAAwB;AAC3C,cAAU,qBACN,QAAQ,sBACR,OAAO,QAAQ,uBAAuB;AAC1C,cAAU,eACN,QAAQ,gBAAgB,OAAO,QAAQ,iBAAiB;AAC5D,cAAU,iBACN,QAAQ,kBAAkB,OAAO,QAAQ,mBAAmB;AAChE,cAAU,OAAO,QAAQ,QAAQ,OAAO,QAAQ,SAAS;AACzD,cAAU,WACN,QAAQ,aAAa,QACrB,OAAO,QAAQ,aAAa,YAC5B,OAAO,QAAQ,SAAS,QAAQ,eAChC,OAAO,QAAQ,SAAS,YAAY;AAExC,QAAI,QAAQ,cAAc;AACtB,cAAQ,aAAa,aAAa;AAAA,IACtC;AAEA,UAAM,aAAa,QAAQ;AAC3B,UAAM,aAAa,UAAU,OACvB,OAAO;AAAA,MACH,uBAAO,OAAO,IAAI;AAAA,MAClB,OAAO,0BAA0B,QAAQ,IAAI;AAAA,IACjD,IACA;AACN,UAAM,iBAAiB,UAAU,WAAW,QAAQ,WAAW;AAC/D,QAAI,gBAAgB;AAEpB,QAAI,mBAAmB;AAEvB,QAAI,eAAe,QAAW;AAC1B,YAAM,IAAI;AAAA,QACN;AAAA,MAEJ;AAAA,IACJ;AACA,cAAU,OAAO;AAAA,IAQjB,MAAM,qBAAqB;AAAA,MACvB,YAAY,MAAM,WAAW,WAAW,UAAU;AAC9C,aAAK,OAAO;AACZ,aAAK,YAAY;AACjB,aAAK,YAAY;AACjB,aAAK,WAAW;AAAA,MACpB;AAAA,MAEA,SAAS;AACL,eAAO,KAAK,UAAU,EAAE,GAAG,KAAK,CAAC;AAAA,MACrC;AAAA,IACJ;AAMA,aAAS,eAAe,KAAK;AACzB,UAAI,OAAO,UAAU;AACjB,eAAO,OAAO,SAAS,GAAG;AAAA,MAC9B;AAEA,aAAO,SAAS,GAAG;AAAA,IACvB;AAMA,aAAS,yBAAyB,OAAOd,IAAG;AACxC,UAAI,MAAM,aAAaA,OAAM,MAAM,YAAY,GAAG;AAC9C,cAAM,sBAAsB;AAAA,MAChC;AAAA,IACJ;AAKA,aAAS,yBAAyB,OAAO;AACrC,UAAI,OAAO;AACP,cAAM,sBAAsB;AAAA,MAChC;AAAA,IACJ;AASA,aAAS,UAAU,KAAK;AACpB,UAAI,CAAC,KAAK;AACN,eAAO;AAAA,MACX;AAEA,YAAM,UAAU,IAAI,MAAM,GAAG;AAC7B,YAAM,IAAI,QAAQ;AAClB,UAAIA,KAAI;AACR,UAAI,KAAK;AACT,UAAI;AAEJ,UAAI,IAAI,KAAK,CAAC,sBAAsB,KAAK,GAAG,GAAG;AAC3C,cAAM,IAAI;AAAA,UACN;AAAA,QACJ;AAAA,MACJ;AAEA,aAAOA,MAAK;AACR,iBAAS,SAAS,QAAQA,EAAC,GAAG,EAAE;AAEhC,YAAI,UAAU,IAAI;AACd,gBAAM,IAAI,MAAM,gBAAgB,GAAG,EAAE;AAAA,QACzC;AAEA,cAAM,SAAS,KAAK,IAAI,IAAI,IAAIA,KAAI,CAAC;AAAA,MACzC;AAEA,aAAO,KAAK;AAAA,IAChB;AASA,aAAS,cAAc,SAAS;AAC5B,YAAM,SAAS;AACf,YAAM,YAAa,UAAU,MAAO;AACpC,YAAM,oBACF,YAAY,IAAI,YAAY,SAAS;AAEzC,aAAO,KAAK,MAAM,iBAAiB;AAAA,IACvC;AAOA,aAAS,SAAS,OAAO;AACrB,UAAI,CAAC,OAAO;AACR,eAAO;AAAA,MACX;AACA,UAAI,OAAO,UAAU,UAAU;AAC3B,eAAO;AAAA,MACX;AACA,UAAI;AAAA,MAA6B,MAAO,YAAa,YAAY;AAC7D;AAAA;AAAA,UAA4B,MAAO,QAAQ;AAAA;AAAA,MAC/C;AACA,UACI;AAAA,MACqC,MAAO,sBACtC,UACR;AAEE;AAAA;AAAA,UAAwC,MAAO;AAAA;AAAA,MACnD;AACA,YAAM,IAAI,UAAU,6CAA6C;AAAA,IACrE;AAQA,aAAS,QAAQ,MAAM,IAAI,OAAO;AAC9B,aAAO,SAAS,MAAM,UAAU,QAAQ,MAAM,UAAU;AAAA,IAC5D;AAOA,aAAS,qBAAqB,OAAO,KAAK;AACtC,YAAM,oBAAoB,IAAI;AAAA,QAC1B,0BAA0B,MAAM,SAAS;AAAA,MAC7C;AAEA,UAAI,CAAC,IAAI,OAAO;AACZ,eAAO;AAAA,MACX;AAGA,YAAM,wBAAwB;AAC9B,UAAI,qBAAqB,IAAI;AAAA,QACzB,OAAO,OAAO,KAAK,KAAK,EAAE,KAAK,GAAG,CAAC;AAAA,MACvC;AAEA,UAAI,uBAAuB;AAEvB,6BAAqB,IAAI;AAAA,UACrB,yBAAyB,OAAO,KAAK,KAAK,EAAE,KAAK,GAAG,CAAC;AAAA,QACzD;AAAA,MACJ;AAEA,UAAI,mBAAmB;AACvB,UAAI,MAAM,MAAM,MAAM,IAAI,EAAE,KAAK,SAAU,MAAMA,IAAG;AAGhD,cAAM,wBAAwB,KAAK,MAAM,qBAAqB;AAE9D,YAAI,uBAAuB;AACvB,6BAAmBA;AACnB,iBAAO;AAAA,QACX;AAIA,cAAM,qBAAqB,KAAK,MAAM,kBAAkB;AACxD,YAAI,oBAAoB;AACpB,6BAAmBA;AACnB,iBAAO;AAAA,QACX;AAKA,eAAO,oBAAoB;AAAA,MAC/B,CAAC;AAED,YAAM,QAAQ,GAAG,iBAAiB;AAAA,EAAK,IAAI,QAAQ,WAAW,MAC1D,IAAI,KAAK,QAAQ,WACrB;AAAA,EAAK,IAAI,MAAM,MACV,MAAM,IAAI,EACV,MAAM,mBAAmB,CAAC,EAC1B,KAAK,IAAI,CAAC;AAEf,UAAI;AACA,eAAO,eAAe,mBAAmB,SAAS;AAAA,UAC9C,OAAO;AAAA,QACX,CAAC;AAAA,MACL,QAAQ;AAAA,MAER;AAEA,aAAO;AAAA,IACX;AAKA,aAAS,aAAa;AAAA,MAClB,MAAM,kBAAkB,WAAW;AAAA;AAAA,QAE/B,OAAO;AAAA,QAEP,eAAe,MAAM;AAEjB,cAAI,KAAK,WAAW,GAAG;AACnB,kBAAM,UAAU,MAAM,GAAG;AAAA,UAC7B,OAAO;AAGH,kBAAM,GAAG,IAAI;AAAA,UACjB;AAIA,iBAAO,eAAe,MAAM,eAAe;AAAA,YACvC,OAAO;AAAA,YACP,YAAY;AAAA,UAChB,CAAC;AAAA,QACL;AAAA,QAEA,QAAQ,OAAO,WAAW,EAAE,UAAU;AAClC,iBAAO,oBAAoB;AAAA,QAC/B;AAAA,MACJ;AAEA,gBAAU,SAAS;AAEnB,UAAI,WAAW,KAAK;AAChB,kBAAU,MAAM,SAASoD,OAAM;AAC3B,iBAAO,UAAU,MAAM;AAAA,QAC3B;AAAA,MACJ;AAEA,YAAM;AAAA;AAAA,QAEE;AAAA;AAGR,UAAI,uBAAuB,UAAU;AACjC,kBAAU,WAAW,SAAS,WAAW;AACrC,iBAAO,uBAAuB,SAAS;AAAA,QAC3C;AAAA,MACJ;AAEA,gBAAU,WAAW,SAASC,YAAW;AACrC,eAAO,uBAAuB,SAAS;AAAA,MAC3C;AAQA,YAAM,iBAAiB,IAAI,MAAM,WAAW;AAAA;AAAA,QAExC,QAAQ;AAGJ,cAAI,gBAAgB,WAAW;AAC3B,kBAAM,IAAI;AAAA,cACN;AAAA,YACJ;AAAA,UACJ;AAEA,iBAAO,IAAI,WAAW,UAAU,MAAM,GAAG,EAAE,SAAS;AAAA,QACxD;AAAA,MACJ,CAAC;AAED;AAAA;AAAA;AAAA,QAC4B;AAAA;AAAA,IAEhC;AAWA,aAAS,WAAW,OAAO;AAEvB,YAAM,gBAAgB,EAAE,MAAa;AAKrC,aAAO,oBAAoB,UAAU,EAAE;AAAA,QACnC,CAAC,aAAc,cAAc,QAAQ,IAAI,WAAW,QAAQ;AAAA,MAChE;AAEA,oBAAc,iBAAiB,YAAa,MAAM;AAC9C,cAAM,gBAAgB,IAAI,WAAW,eAAe,GAAG,IAAI;AAC3D,cAAM,YAAY,CAAC;AAEnB,SAAC,eAAe,sBAAsB,iBAAiB,EAAE;AAAA,UACrD,CAAC,WAAW;AACR,sBAAU,MAAM,IACZ,cAAc,MAAM,EAAE,KAAK,aAAa;AAAA,UAChD;AAAA,QACJ;AAEA,SAAC,UAAU,eAAe,EAAE,QAAQ,CAAC,WAAW;AAC5C,oBAAU,MAAM,IAAI,SAAU,MAAM;AAChC,mBAAO,cAAc,MAAM;AAAA,cACvB,QAAQ,cAAc,MAAM;AAAA,YAChC;AAAA,UACJ;AAAA,QACJ,CAAC;AAED,eAAO;AAAA,MACX;AAEA,oBAAc,eAAe,YAAY,OAAO;AAAA,QAC5C,WAAW,eAAe;AAAA,MAC9B;AAEA,oBAAc,eAAe,qBACzB,WAAW,eAAe;AAE9B,aAAO;AAAA,IACX;AAGA,aAAS,eAAe,OAAO,UAAU;AACrC,YAAM,UAAU;AAAA,QACZ,UAAU;AACN,iBAAO,eAAe,QAAQ;AAAA,YAC1B,OAAO,MAAM,GAAG,IAAI,WAAa,OAAO,SAAS,CAAC;AAAA,UACtD;AAAA,QACJ;AAAA,QACA,aAAa;AACT,iBAAO,eAAe,IAAI,WAAW;AAAA,QACzC;AAAA,QACA,iBAAiB,UAAU;AACvB,gBAAM,KAAK,YAAY,eAAe,IAAI,WAAW;AACrD,iBAAO,QAAQ,QAAQ,EAAE,mBAAmB,EAAE;AAAA,QAClD;AAAA,QACA,iBAAiB,UAAU;AACvB,iBAAO,QAAQ,iBAAiB,QAAQ,EAAE,gBAAgB;AAAA,QAC9D;AAAA,QACA,aAAa,UAAU;AACnB,iBAAO,QAAQ,iBAAiB,QAAQ,EAAE,YAAY;AAAA,QAC1D;AAAA,QACA,aAAa,UAAU;AACnB,iBAAO,QAAQ,iBAAiB,QAAQ,EAAE,YAAY;AAAA,QAC1D;AAAA,MACJ;AAEA,YAAM,oBAAoB,OAAO;AAAA,QAC7B,OAAO,eAAe,cAAc;AAAA,MACxC;AACA;AAAA,QACI,GAAG,OAAO,oBAAoB,cAAc;AAAA,QAC5C,GAAG,OAAO,sBAAsB,cAAc;AAAA,MAClD,EAAE,QAAQ,CAAC,SAAS;AAChB,eAAO;AAAA,UACH;AAAA,UACA;AAAA,UACA,OAAO,yBAAyB,gBAAgB,IAAI;AAAA,QACxD;AAAA,MACJ,CAAC;AAED,aAAO,eAAe,mBAAmB,OAAO;AAAA,QAC5C,OAAO;AAAA,QACP,UAAU;AAAA,QACV,YAAY;AAAA,QACZ,cAAc;AAAA,MAClB,CAAC;AAED,aAAO;AAAA,IACX;AAGA,aAAS,WAAW,OAAO,KAAK;AAE5B,UAAI,CAAC,MAAM,MAAM;AACb,cAAM,OAAO,CAAC;AAAA,MAClB;AACA,YAAM,KAAK,KAAK,GAAG;AAAA,IACvB;AAGA,aAAS,QAAQ,OAAO;AAEpB,UAAI,CAAC,MAAM,MAAM;AACb;AAAA,MACJ;AACA,YAAM,eAAe,MAAM;AAC3B,eAASrD,KAAI,GAAGA,KAAI,MAAM,KAAK,QAAQA,MAAK;AACxC,cAAM,MAAM,MAAM,KAAKA,EAAC;AACxB,YAAI,KAAK,MAAM,MAAM,IAAI,IAAI;AAE7B,iCAAyB,OAAOA,EAAC;AACjC,YAAI,MAAM,aAAaA,KAAI,MAAM,WAAW;AACxC,gBAAM,qBAAqB,OAAO,GAAG;AAAA,QACzC;AAAA,MACJ;AACA,UAAI,CAAC,cAAc;AACf,iCAAyB,KAAK;AAAA,MAClC;AACA,YAAM,OAAO,CAAC;AAAA,IAClB;AAAA,IAcA,MAAM,UAAU;AAAA,MACZ,cAAc;AACV,aAAK,SAAS,CAAC;AAAA,MACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO;AACH,eAAO,KAAK,OAAO,CAAC;AAAA,MACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,KAAK,OAAO;AACR,aAAK,OAAO,KAAK,KAAK;AACtB,aAAK,SAAS,KAAK,OAAO,SAAS,CAAC;AAAA,MACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,MAAM;AACF,YAAI,KAAK,OAAO,WAAW,GAAG;AAC1B,iBAAO;AAAA,QACX;AACA,cAAM,QAAQ,KAAK,OAAO,CAAC;AAC3B,cAAM,OAAO,KAAK,OAAO,IAAI;AAC7B,YAAI,KAAK,OAAO,SAAS,GAAG;AACxB,eAAK,OAAO,CAAC,IAAI;AACjB,eAAK,YAAY;AACjB,eAAK,WAAW,CAAC;AAAA,QACrB;AACA,eAAO,MAAM;AACb,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAWA,OAAO,OAAO;AACV,cAAM,QAAQ,MAAM;AACpB,YAAI,UAAU,UAAa,KAAK,OAAO,KAAK,MAAM,OAAO;AACrD,iBAAO;AAAA,QACX;AACA,cAAM,OAAO,KAAK,OAAO,IAAI;AAC7B,YAAI,UAAU,MAAM;AAChB,eAAK,OAAO,KAAK,IAAI;AACrB,eAAK,YAAY;AACjB,cAAI,cAAc,MAAM,KAAK,IAAI,GAAG;AAChC,iBAAK,SAAS,KAAK;AAAA,UACvB,OAAO;AACH,iBAAK,WAAW,KAAK;AAAA,UACzB;AAAA,QACJ;AACA,eAAO,MAAM;AACb,eAAO;AAAA,MACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAWA,SAAS,OAAO;AACZ,cAAM,QAAQ,KAAK,OAAO,KAAK;AAC/B,YAAI,eAAe;AACnB,eAAO,eAAe,GAAG;AACrB,gBAAM,cAAc,KAAK,OAAO,eAAe,KAAK,CAAC;AACrD,gBAAM,SAAS,KAAK,OAAO,WAAW;AACtC,cAAI,cAAc,OAAO,MAAM,IAAI,GAAG;AAClC,iBAAK,OAAO,YAAY,IAAI;AAC5B,mBAAO,YAAY;AACnB,2BAAe;AAAA,UACnB,OAAO;AACH;AAAA,UACJ;AAAA,QACJ;AACA,aAAK,OAAO,YAAY,IAAI;AAC5B,cAAM,YAAY;AAAA,MACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAYA,WAAW,OAAO;AACd,cAAM,QAAQ,KAAK,OAAO,KAAK;AAC/B,YAAI,eAAe;AACnB,cAAM,aAAa,KAAK,MAAM,KAAK,OAAO,SAAS,CAAC;AACpD,eAAO,eAAe,YAAY;AAC9B,gBAAM,YAAY,eAAe,IAAI;AACrC,gBAAM,aAAa,YAAY;AAC/B,cAAI,iBAAiB;AACrB,cAAI,YAAY,KAAK,OAAO,SAAS;AAErC,cACI,aAAa,KAAK,OAAO,UACzB,cAAc,KAAK,OAAO,UAAU,GAAG,SAAS,IAAI,GACtD;AACE,6BAAiB;AACjB,wBAAY,KAAK,OAAO,UAAU;AAAA,UACtC;AAEA,cAAI,cAAc,WAAW,KAAK,IAAI,GAAG;AACrC,iBAAK,OAAO,YAAY,IAAI;AAC5B,sBAAU,YAAY;AACtB,2BAAe;AAAA,UACnB,OAAO;AACH;AAAA,UACJ;AAAA,QACJ;AACA,aAAK,OAAO,YAAY,IAAI;AAC5B,cAAM,YAAY;AAAA,MACtB;AAAA,IACJ;AAkBA,aAAS,iBAAiB,OAAO;AAC7B,UAAI,CAAC,MAAM,QAAQ;AACf,cAAM,SAAS,oBAAI,IAAI;AACvB,cAAM,YAAY,IAAI,UAAU;AAAA,MACpC;AAAA,IACJ;AAOA,aAAS,SAAS,OAAO,IAAI;AACzB,aAAO,MAAM,SAAS,MAAM,OAAO,IAAI,EAAE,IAAI;AAAA,IACjD;AAOA,aAAS,SAAS,OAAO,IAAI;AACzB,aAAO,MAAM,SAAS,MAAM,OAAO,IAAI,EAAE,IAAI;AAAA,IACjD;AAMA,aAAS,SAAS,OAAO,OAAO;AAC5B,uBAAiB,KAAK;AACtB,YAAM,OAAO,IAAI,MAAM,IAAI,KAAK;AAAA,IACpC;AAOA,aAAS,YAAY,OAAO,IAAI;AAC5B,aAAO,MAAM,SAAS,MAAM,OAAO,OAAO,EAAE,IAAI;AAAA,IACpD;AAMA,aAAS,mBAAmB,OAAO,UAAU;AACzC,UAAI,CAAC,MAAM,QAAQ;AACf;AAAA,MACJ;AAEA,iBAAW,SAAS,MAAM,OAAO,OAAO,GAAG;AACvC,iBAAS,KAAK;AAAA,MAClB;AAAA,IACJ;AAKA,aAAS,iBAAiB,OAAO;AAC7B,YAAM,YAAY,IAAI,UAAU;AAChC,yBAAmB,OAAO,CAAC,UAAU;AACjC,cAAM,UAAU,KAAK,KAAK;AAAA,MAC9B,CAAC;AAAA,IACL;AAOA,aAAS,SAAS,OAAO,OAAO;AAC5B,UAAI,MAAM,SAAS,QAAW;AAC1B,cAAM,IAAI,MAAM,0CAA0C;AAAA,MAC9D;AAEA,UAAI,OAAO,MAAM,SAAS,YAAY;AAClC,cAAM,IAAI;AAAA,UACN,iEACI,MAAM,IACV,YAAY,OAAO,MAAM,IAAI;AAAA,QACjC;AAAA,MACJ;AAEA,UAAI,MAAM,qBAAqB;AAC3B,cAAM,QAAQ,IAAI,MAAM;AAAA,MAC5B;AAEA,YAAM,OAAO,MAAM,YAAY,cAAc;AAE7C,UAAI,OAAO,UAAU,eAAe,KAAK,OAAO,OAAO,GAAG;AACtD,YAAI,OAAO,MAAM,UAAU,UAAU;AACjC,gBAAM,QAAQ,SAAS,MAAM,OAAO,EAAE;AAAA,QAC1C;AAEA,YAAI,CAAC,eAAe,MAAM,KAAK,GAAG;AAC9B,gBAAM,QAAQ;AAAA,QAClB;AACA,cAAM,QAAQ,MAAM,QAAQ,aAAa,IAAI,MAAM;AACnD,cAAM,QAAQ,KAAK,IAAI,GAAG,MAAM,KAAK;AAAA,MACzC;AAEA,UAAI,OAAO,UAAU,eAAe,KAAK,OAAO,UAAU,GAAG;AACzD,cAAM,OAAO;AACb,cAAM,WAAW,MAAM,WAAW,aAAa,IAAI,MAAM;AAAA,MAC7D;AAEA,UAAI,OAAO,UAAU,eAAe,KAAK,OAAO,WAAW,GAAG;AAC1D,cAAM,OAAO;AACb,cAAM,YAAY;AAAA,MACtB;AAEA,UACI,OAAO,UAAU,eAAe,KAAK,OAAO,qBAAqB,GACnE;AAGE,YAAI,CAAC,MAAM,OAAO;AACd,gBAAM,OAAO;AAAA,QACjB;AACA,cAAM,sBAAsB;AAAA,MAChC;AAEA,uBAAiB,KAAK;AAEtB,aAAO,SAAS,OAAO,aAAa,GAAG;AACnC;AACA,YAAI,iBAAiB,OAAO,kBAAkB;AAC1C,0BAAgB;AAAA,QACpB;AAAA,MACJ;AAEA,YAAM,KAAK;AACX,UAAI,iBAAiB,OAAO,kBAAkB;AAC1C,wBAAgB;AAAA,MACpB;AAEA,YAAM,QAAQ;AACd,YAAM,YAAY,MAAM;AACxB,YAAM,SACF,MAAM,OACL,SAAS,OAAO,MAAM,KAAK,CAAC,MAAM,MAAM,aAAa,IAAI;AAE9D,eAAS,OAAO,KAAK;AACrB,YAAM,UAAU,KAAK,KAAK;AAE1B,UAAI,uBAAuB;AACvB,cAAM,MAAM;AAAA,UACR,OAAO;AAAA,UACP,KAAK,WAAY;AACb,iBAAK,QAAQ;AACb,mBAAO;AAAA,UACX;AAAA,UACA,OAAO,WAAY;AACf,iBAAK,QAAQ;AACb,mBAAO;AAAA,UACX;AAAA,UACA,QAAQ,WAAY;AAChB,mBAAO,KAAK;AAAA,UAChB;AAAA,UACA,SAAS,WAAY;AACjB,kBAAM,SACF,MAAM,OACL,SAAS,OAAO,MAAM,KAAK,CAAC,MACxB,MAAM,aAAa,IAAI;AAEhC,kBAAM,UAAU,OAAO,KAAK;AAC5B,kBAAM,QAAQ;AACd,qBAAS,OAAO,KAAK;AACrB,kBAAM,UAAU,KAAK,KAAK;AAE1B,mBAAO;AAAA,UACX;AAAA,UACA,CAAC,OAAO,WAAW,GAAG,WAAY;AAC9B,mBAAO,MAAM;AAAA,UACjB;AAAA,QACJ;AACA,eAAO;AAAA,MACX;AAEA,aAAO,MAAM;AAAA,IACjB;AASA,aAAS,cAAcF,IAAGC,IAAG;AAEzB,UAAID,GAAE,SAAS,kBAAkBC,GAAE,SAAS,gBAAgB;AACxD,eAAO;AAAA,MACX;AACA,UAAID,GAAE,SAAS,kBAAkBC,GAAE,SAAS,gBAAgB;AACxD,eAAO;AAAA,MACX;AAGA,UAAID,GAAE,SAASC,GAAE,QAAQ;AACrB,eAAO;AAAA,MACX;AACA,UAAID,GAAE,SAASC,GAAE,QAAQ;AACrB,eAAO;AAAA,MACX;AAGA,UAAID,GAAE,aAAa,CAACC,GAAE,WAAW;AAC7B,eAAO;AAAA,MACX;AACA,UAAI,CAACD,GAAE,aAAaC,GAAE,WAAW;AAC7B,eAAO;AAAA,MACX;AAEA,UAAID,GAAE,QAAQC,GAAE,OAAO;AACnB,eAAO;AAAA,MACX;AACA,UAAID,GAAE,QAAQC,GAAE,OAAO;AACnB,eAAO;AAAA,MACX;AAGA,UAAID,GAAE,YAAYC,GAAE,WAAW;AAC3B,eAAO;AAAA,MACX;AACA,UAAID,GAAE,YAAYC,GAAE,WAAW;AAC3B,eAAO;AAAA,MACX;AAGA,UAAID,GAAE,KAAKC,GAAE,IAAI;AACb,eAAO;AAAA,MACX;AACA,UAAID,GAAE,KAAKC,GAAE,IAAI;AACb,eAAO;AAAA,MACX;AAGA,aAAO;AAAA,IACX;AAQA,aAAS,kBAAkB,OAAO,MAAM,IAAI;AACxC,UAAI,CAAC,MAAM,WAAW;AAClB,eAAO;AAAA,MACX;AAEA,YAAMuD,UAAS,MAAM,UAAU;AAC/B,UAAIA,QAAO,WAAW,KAAKA,QAAO,CAAC,EAAE,qBAAqB;AACtD,eAAOA,QAAO,CAAC;AAAA,MACnB;AAEA,YAAM,QAAQ,MAAM,UAAU,KAAK;AACnC,UAAI,SAAS,QAAQ,MAAM,IAAI,KAAK,GAAG;AACnC,eAAO;AAAA,MACX;AAKA,UAAI,QAAQ;AAEZ,eAAStD,KAAI,GAAGA,KAAIsD,QAAO,QAAQtD,MAAK;AACpC,YACI,QAAQ,MAAM,IAAIsD,QAAOtD,EAAC,CAAC,MAC1B,CAAC,SAAS,cAAc,OAAOsD,QAAOtD,EAAC,CAAC,MAAM,IACjD;AACE,kBAAQsD,QAAOtD,EAAC;AAAA,QACpB;AAAA,MACJ;AAEA,aAAO;AAAA,IACX;AAMA,aAAS,WAAW,OAAO;AACvB,UAAI,CAAC,MAAM,WAAW;AAClB,eAAO;AAAA,MACX;AACA,aAAO,MAAM,UAAU,KAAK,KAAK;AAAA,IACrC;AAMA,aAAS,UAAU,OAAO;AACtB,UAAI,CAAC,MAAM,WAAW;AAClB,eAAO;AAAA,MACX;AACA,YAAMsD,UAAS,MAAM,UAAU;AAC/B,UAAI,QAAQ;AAEZ,eAAStD,KAAI,GAAGA,KAAIsD,QAAO,QAAQtD,MAAK;AACpC,YAAI,CAAC,SAAS,cAAc,OAAOsD,QAAOtD,EAAC,CAAC,MAAM,IAAI;AAClD,kBAAQsD,QAAOtD,EAAC;AAAA,QACpB;AAAA,MACJ;AAEA,aAAO;AAAA,IACX;AAMA,aAAS,UAAU,OAAO,OAAO;AAC7B,UAAI,OAAO,MAAM,aAAa,UAAU;AACpC,cAAM,UAAU,OAAO,KAAK;AAC5B,cAAM,UAAU,MAAM;AACtB,cAAM,QAAQ;AACd,YAAI,MAAM,qBAAqB;AAC3B,gBAAM,QAAQ,IAAI,MAAM;AAAA,QAC5B;AACA,cAAM,UAAU,KAAK,KAAK;AAAA,MAC9B,OAAO;AACH,oBAAY,OAAO,MAAM,EAAE;AAC3B,cAAM,UAAU,OAAO,KAAK;AAAA,MAChC;AAEA,UAAI,OAAO,MAAM,SAAS,YAAY;AAClC,cAAM,KAAK,MAAM,MAAM,MAAM,IAAI;AAAA,MACrC;AAAA,IACJ;AAOA,aAAS,gBAAgB,OAAO;AAC5B,UAAI,UAAU,kBAAkB,UAAU,kBAAkB;AACxD,eAAO,SAAS,KAAK;AAAA,MACzB;AACA,aAAO,QAAQ,KAAK;AAAA,IACxB;AAOA,aAAS,mBAAmB,OAAO;AAC/B,UAAI,UAAU,kBAAkB,UAAU,kBAAkB;AACxD,eAAO,UAAU,KAAK;AAAA,MAC1B;AACA,aAAO,MAAM,KAAK;AAAA,IACtB;AAMA,aAAS,iBAAiB;AACtB,UAAI,QAAQ;AACZ,aAAO,SAAU,KAAK;AAElB,SAAC,WAAW,QAAQ,KAAK,GAAG;AAAA,MAChC;AAAA,IACJ;AACA,UAAM,WAAW,eAAe;AAQhC,aAAS,WAAW,OAAO,SAAS,OAAO;AACvC,UAAI,CAAC,SAAS;AAGV;AAAA,MACJ;AAIA,YAAM,KAAK,OAAO,OAAO;AAEzB,UAAI,OAAO,MAAM,EAAE,KAAK,KAAK,gBAAgB;AACzC,cAAM,cAAc,gBAAgB,KAAK;AAEzC,YAAI,MAAM,4BAA4B,MAAM;AACxC,gBAAM,gBAAgB,MAAM,IAAI,WAAW,EAAE;AAC7C,iBAAO,OAAO,kBAAkB,aAC1B,cAAc,OAAO,IACrB;AAAA,QACV;AAGA,cAAM,aAAa,IAAI,MAAM,EAAE,MAC1B,MAAM,IAAI,EACV,MAAM,CAAC,EACP,KAAK,IAAI;AAEd;AAAA,UACI,eAAe,WAAW;AAAA;AAAA,EAEjB,UAAU;AAAA,QACvB;AAAA,MACJ;AAEA,UAAI,SAAS,OAAO,EAAE,GAAG;AAErB,cAAM,QAAQ,SAAS,OAAO,EAAE;AAChC,YACI,MAAM,SAAS,SACd,MAAM,SAAS,aAAa,UAAU,cACtC,MAAM,SAAS,cAAc,UAAU,WAC1C;AACE,sBAAY,OAAO,EAAE;AACrB,gBAAM,UAAU,OAAO,KAAK;AAAA,QAChC,OAAO;AACH,gBAAM,QAAQ,gBAAgB,KAAK;AACnC,gBAAM,WAAW,mBAAmB,MAAM,IAAI;AAC9C,gBAAM,IAAI;AAAA,YACN,0CAA0C,QAAQ,uBAAuB,KAAK;AAAA,UAClF;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAOA,aAAS,aAAa,QAAQ,QAAQ,OAAO;AACzC,YAAM,MAAM,EAAE,iBAAiB,OAAO,UAAU,eAAe;AAAA,QAC3D;AAAA,QACA;AAAA,MACJ;AACA,YAAM,IAAI,MAAM,EAAE,IAAI,OAAO,MAAM;AAEnC,UAAI,WAAW,QAAQ;AACnB,eAAO,MAAM,IAAI,MAAM,MAAM;AAAA,MACjC,WAAW,WAAW,QAAQ;AAC1B,eAAO,MAAM,IAAI,MAAM,MAAM;AAAA,MACjC,WAAW,WAAW,YAAY;AAC9B,eAAO,MAAM,IAAI,MAAM,MAAM;AAAA,MACjC,WAAW,WAAW,eAAe;AACjC,cAAM,yBAAyB,OAAO;AAAA,UAClC;AAAA,UACA;AAAA,QACJ;AAEA,YACI,0BACA,uBAAuB,OACvB,CAAC,uBAAuB,KAC1B;AACE,iBAAO;AAAA,YACH;AAAA,YACA,IAAI,MAAM;AAAA,YACV;AAAA,UACJ;AAEA,gBAAM,iBAAiB,OAAO;AAAA,YAC1B;AAAA,YACA;AAAA,UACJ;AACA,iBAAO,eAAe,QAAQ,QAAQ,cAAc;AAAA,QACxD,OAAO;AACH,iBAAO,MAAM,IAAI,MAAM,MAAM;AAAA,QACjC;AAAA,MACJ,OAAO;AACH,eAAO,MAAM,IAAI,WAAY;AACzB,iBAAO,MAAM,MAAM,EAAE,MAAM,OAAO,SAAS;AAAA,QAC/C;AAEA,eAAO;AAAA,UACH,OAAO,MAAM;AAAA,UACb,OAAO,0BAA0B,MAAM,MAAM,CAAC;AAAA,QAClD;AAAA,MACJ;AAEA,aAAO,MAAM,EAAE,QAAQ;AAAA,IAC3B;AAMA,aAAS,eAAe,OAAO,kBAAkB;AAC7C,YAAM,KAAK,gBAAgB;AAAA,IAC/B;AAGA,UAAM,SAAS;AAAA,MACX,YAAY,QAAQ;AAAA,MACpB,cAAc,QAAQ;AAAA,MACtB,aAAa,QAAQ;AAAA,MACrB,eAAe,QAAQ;AAAA,MACvB,MAAM,QAAQ;AAAA,IAClB;AAEA,QAAI,UAAU,cAAc;AACxB,aAAO,eAAe,QAAQ;AAAA,IAClC;AAEA,QAAI,UAAU,gBAAgB;AAC1B,aAAO,iBAAiB,QAAQ;AAAA,IACpC;AAEA,QAAI,UAAU,QAAQ;AAClB,aAAO,SAAS,QAAQ,QAAQ;AAAA,IACpC;AAEA,QAAI,UAAU,UAAU;AACpB,aAAO,WAAW,QAAQ,QAAQ;AAAA,IACtC;AAEA,QAAI,UAAU,aAAa;AACvB,aAAO,cAAc,QAAQ;AAAA,IACjC;AAEA,QAAI,UAAU,uBAAuB;AACjC,aAAO,wBAAwB,QAAQ;AAAA,IAC3C;AAEA,QAAI,UAAU,gBAAgB;AAC1B,aAAO,iBAAiB,QAAQ;AAAA,IACpC;AAEA,QAAI,UAAU,sBAAsB;AAChC,aAAO,uBAAuB,QAAQ;AAAA,IAC1C;AAEA,QAAI,UAAU,qBAAqB;AAC/B,aAAO,sBAAsB,QAAQ;AAAA,IACzC;AAEA,QAAI,UAAU,oBAAoB;AAC9B,aAAO,qBAAqB,QAAQ;AAAA,IACxC;AAEA,QAAI,UAAU,MAAM;AAChB,aAAO,OAAO;AAAA,IAClB;AAEA,QAAI,UAAU,UAAU;AACpB,aAAO,WAAW;AAAA,IACtB;AAEA,UAAM,qBAAqB,QAAQ,gBAAgB,QAAQ;AAC3D,UAAM,wBAAwB,QAAQ;AACtC,UAAM,sBAAsB,QAAQ;AAOpC,aAAS,YAAY,OAAO,WAAW;AAGnC,cAAQ,KAAK,MAAM,SAAS,KAAK,CAAC;AAClC,YAAM,iBAAiB;AAEvB,kBAAY,aAAa;AAEzB,UAAI,QAAQ;AACZ,UAAI,cAAc;AAElB,YAAM,qBAAqB,CAAC,GAAG,CAAC;AAGhC,YAAM;AAAA;AAAA,QAA8B;AAAA,UAChC,KAAK;AAAA,UACL,MAAM,WAAW;AAAA,UACjB;AAAA,UACA,qBAAqB;AAAA,UACrB,UAAU,EAAE,MAAM,UAAU,SAAS,GAAG,OAAO,OAAU;AAAA,QAC7D;AAAA;AAEA,YAAM,KAAK,QAAQ;AAGnB,eAAS,qBAAqB;AAC1B,eAAO,MAAO,MAAM,MAAM,kBAAkB;AAAA,MAChD;AAGA,eAAS,OAAO,MAAM;AAClB,cAAM,mBACF,MAAM,MAAM,mBAAmB,CAAC,IAAI;AACxC,cAAM,iBAAiB,KAAK,MAAM,mBAAmB,GAAI;AACzD,cAAM,oBACD,mBAAmB,iBAAiB,OAAO,MAC5C,QACA,mBAAmB,CAAC;AAExB,YAAI,MAAM,QAAQ,IAAI,GAAG;AACrB,cAAI,KAAK,CAAC,IAAI,KAAK;AACf,kBAAM,IAAI;AAAA,cACN;AAAA,YACJ;AAAA,UACJ;AAEA,gBAAM,UAAU,KAAK,CAAC;AACtB,cAAI,WAAW,mBAAmB,KAAK,CAAC;AACxC,cAAI,UAAU,iBAAiB;AAE/B,cAAI,WAAW,GAAG;AACd,wBAAY;AACZ,uBAAW;AAAA,UACf;AAEA,iBAAO,CAAC,SAAS,QAAQ;AAAA,QAC7B;AACA,eAAO,CAAC,gBAAgB,gBAAgB;AAAA,MAC5C;AAWA,eAAS,qBAAqB;AAC1B,cAAM,MAAM,OAAO;AACnB,cAAM,SAAS,IAAI,CAAC,IAAI,MAAO,IAAI,CAAC,IAAI;AACxC,eAAO;AAAA,MACX;AAEA,UAAI,UAAU,cAAc;AACxB,eAAO,SAAS,WAAY;AACxB,gBAAM,QAAQ,OAAO;AACrB,iBAAO,OAAO,MAAM,CAAC,CAAC,IAAI,OAAO,GAAG,IAAI,OAAO,MAAM,CAAC,CAAC;AAAA,QAC3D;AAAA,MACJ;AAEA,UAAI,UAAU,MAAM;AAChB,cAAM,OAAO,WAAW,KAAK;AAC7B,cAAM,KAAK,QAAQ;AAAA,MACvB;AAEA,UAAI,UAAU,UAAU;AACpB,cAAM,WAAW,eAAe,OAAO,MAAM,KAAK;AAAA,MACtD;AAKA,YAAM,cAAc,SAAU,gBAAgB;AAC1C,cAAM,EAAE,MAAM,SAAS,OAAO,SAAS;AAAA;AAAA,UACD;AAAA;AACtC,cAAM,EAAE,MAAM,SAAS,OAAO,SAAS,IAAI,MAAM;AACjD,YAAI,YAAY,WAAW,aAAa,UAAU;AAC9C;AAAA,QACJ;AAEA,YAAI,YAAY,YAAY;AACxB,gCAAsB,MAAM,gBAAgB;AAAA,QAChD;AAEA,cAAM,WAAW;AAAA,UACb,SAAS,MAAM,SAAS,UAAU;AAAA,UAClC,MAAM;AAAA,UACN,OAAO;AAAA,QACX;AAEA,YAAI,YAAY,aAAa;AACzB,kCAAwB;AAAA,QAC5B,WAAW,YAAY,YAAY;AAC/B,6BAAmB,OAAO,YAAY,EAAE;AAAA,QAC5C;AAAA,MACJ;AAMA,qBAAe,0BAA0B;AAKrC,uBAAe,eAAe;AAI1B,gBAAM,UAAU,IAAI,eAAe;AACnC,gBAAM,IAAI,QAAQ,CAACuD,aAAY;AAC3B,oBAAQ,MAAM,YAAY,MAAM;AAC5B,cAAAA,SAAQ,MAAS;AACjB,sBAAQ,MAAM,MAAM;AAAA,YACxB;AACA,oBAAQ,MAAM,YAAY,MAAS;AAAA,UACvC,CAAC;AACD,kBAAQ,MAAM,MAAM;AACpB,kBAAQ,MAAM,MAAM;AAEpB,gBAAM,IAAI,QAAQ,CAACA,aAAY;AAC3B,+BAAmBA,QAAO;AAAA,UAC9B,CAAC;AAAA,QACL;AAEA,cAAM,EAAE,QAAQ,IAAI,MAAM;AAC1B,eAAO,MAAM,SAAS,YAAY,SAAS;AACvC,gBAAM,aAAa;AACnB,cAAI,MAAM,SAAS,YAAY,SAAS;AACpC;AAAA,UACJ;AACA,gBAAM,KAAK;AAAA,QACf;AAAA,MACJ;AAOA,eAAS,2BAA2B,SAAS;AACzC,YAAI,MAAM,SAAS,SAAS,aAAa;AACrC,iBAAO;AAAA,QACX;AACA,cAAM,YAAY,EAAE,MAAM,SAAS,CAAC;AACpC,eAAO,QAAQ,QAAQ,MAAM;AACzB,cAAI,CAAC,aAAa;AACd,kBAAM,YAAY,EAAE,MAAM,YAAY,CAAC;AAAA,UAC3C;AAAA,QACJ,CAAC;AAAA,MACL;AAMA,eAAS,0BAA0B;AAC/B,YAAI,uBAAuB;AAE3B,YAAI,MAAM,YAAY,IAAI,GAAG;AACzB,iCAAuB;AAAA,QAC3B;AAEA,eAAO;AAAA,MACX;AAEA,YAAM,sBAAsB,SAAS,oBACjC,MACA,EAAE,QAAQ;AAAA;AAAA,QAAyC,CAAC;AAAA,SACtD;AAIE,cAAM,eAAe;AAAA,UACjB,YAAY;AAAA,UACZ,eAAe;AAAA,QACnB;AAEA,cAAM,SAAS,SAAS,OAAO;AAAA,UAC3B;AAAA,UACA,MAAM,CAAC,YAAY;AAAA,UACnB,OAAO;AAAA,UACP,qBAAqB;AAAA,QACzB,CAAC;AAED,eAAO,OAAO,MAAM;AAAA,MACxB;AAEA,YAAM,qBAAqB,SAAS,mBAAmB,SAAS;AAC5D,eAAO,WAAW,OAAO,SAAS,cAAc;AAAA,MACpD;AAEA,YAAM,aAAa,SAASC,YAAW,MAAM,SAAS;AAClD,eAAO,SAAS,OAAO;AAAA,UACnB;AAAA,UACA,MAAM,MAAM,UAAU,MAAM,KAAK,WAAW,CAAC;AAAA,UAC7C,OAAO;AAAA,QACX,CAAC;AAAA,MACL;AACA,UAAI,OAAO,QAAQ,YAAY,eAAe,eAAe;AACzD,cAAM,WAAW,cAAc,MAAM,IACjC,SAAS,sBAAsB,SAAS,KAAK;AACzC,iBAAO,IAAI,QAAQ,QAAQ,SAAS,mBAChCD,UACF;AACE,qBAAS,OAAO;AAAA,cACZ,MAAMA;AAAA,cACN,MAAM,CAAC,GAAG;AAAA,cACV,OAAO;AAAA,YACX,CAAC;AAAA,UACL,CAAC;AAAA,QACL;AAAA,MACR;AAEA,YAAM,eAAe,SAASE,cAAa,SAAS;AAChD,eAAO,WAAW,OAAO,SAAS,SAAS;AAAA,MAC/C;AAEA,YAAM,WAAW,SAAS,SAAS,MAAM;AACrC,eAAO,WAAW,OAAO;AAAA,UACrB;AAAA,UACA,MAAM,MAAM,UAAU,MAAM,KAAK,WAAW,CAAC;AAAA,UAC7C,OAAO,MAAM,sBAAsB,IAAI,MAAM,IAAI;AAAA,QACrD,CAAC;AAAA,MACL;AAEA,YAAM,iBAAiB,SAAS,eAAe,MAAM;AACjD,eAAO,MAAM,SAAS,IAAI;AAAA,MAC9B;AAEA,YAAM,cAAc,SAASC,aAAY,MAAM,SAAS;AAEpD,kBAAU,SAAS,OAAO,OAAO,GAAG,EAAE;AACtC,eAAO,SAAS,OAAO;AAAA,UACnB;AAAA,UACA,MAAM,MAAM,UAAU,MAAM,KAAK,WAAW,CAAC;AAAA,UAC7C,OAAO;AAAA,UACP,UAAU;AAAA,QACd,CAAC;AAAA,MACL;AAEA,YAAM,gBAAgB,SAASC,eAAc,SAAS;AAClD,eAAO,WAAW,OAAO,SAAS,UAAU;AAAA,MAChD;AAEA,UAAI,UAAU,cAAc;AACxB,cAAM;AAAA,SACF,SAAS,aAAa,MAAM;AACxB,iBAAO,SAAS,OAAO;AAAA,YACnB;AAAA,YACA,MAAM,MAAM,UAAU,MAAM,KAAK,WAAW,CAAC;AAAA,YAC7C,WAAW;AAAA,UACf,CAAC;AAAA,QACL;AAGJ,YAAI,OAAO,QAAQ,YAAY,eAAe,eAAe;AACzD,gBAAM,aAAa,cAAc,MAAM,IACnC,SAAS,wBAAwB,KAAK;AAClC,mBAAO,IAAI,QAAQ;AAAA,cACf,SAAS,qBAAqBJ,UAAS;AACnC,yBAAS,OAAO;AAAA,kBACZ,MAAMA;AAAA,kBACN,MAAM,CAAC,GAAG;AAAA,kBACV,WAAW;AAAA,gBACf,CAAC;AAAA,cACL;AAAA,YACJ;AAAA,UACJ;AAAA,QACR;AAEA,cAAM,iBAAiB,SAAS,eAAe,SAAS;AACpD,iBAAO,WAAW,OAAO,SAAS,WAAW;AAAA,QACjD;AAAA,MACJ;AAEA,YAAM,cAAc,SAAS,cAAc;AACvC,gBACK,MAAM,YAAY,MAAM,UAAU,OAAO,SAAS,MAClD,MAAM,QAAQ,CAAC,GAAG;AAAA,MAE3B;AAEA,YAAM,wBAAwB,SAAS,sBAAsB,MAAM;AAC/D,cAAM,SAAS,SAAS,OAAO;AAAA,UAC3B;AAAA,UACA,OAAO,mBAAmB;AAAA,UAC1B,IAAI,OAAO;AACP,mBAAO,CAAC,mBAAmB,CAAC;AAAA,UAChC;AAAA,UACA,WAAW;AAAA,QACf,CAAC;AAED,eAAO,OAAO,MAAM;AAAA,MACxB;AAEA,YAAM,uBAAuB,SAAS,qBAAqB,SAAS;AAChE,eAAO,WAAW,OAAO,SAAS,gBAAgB;AAAA,MACtD;AAEA,YAAM,gBAAgB,SAAS,gBAAgB;AAC3C,gBAAQ,KAAK;AAAA,MACjB;AAGA,eAAS,aAAa,UAAU;AAG5B,cAAM,aAAa,eAAe,QAAQ;AAAA,UACtC,MAAM;AAAA,QACV,EAAE,mBAAmB,eAAe,IAAI,WAAW,CAAC;AACpD,eAAO,SAAS,MAAM,EAAE,MAAM,eAAe,WAAW,CAAC;AAAA,MAC7D;AAMA,eAAS,cAAc,WAAW;AAC9B,YAAI,OAAO,cAAc,UAAU;AAC/B,iBAAO;AAAA,QACX;AACA,YACI,UAAU,YACV,cAAc,QACd,OAAO,cAAc,YACrB;AAAA,QAAyC,UAAW,UAChD,YACN;AACE,iBAAO;AAAA;AAAA,YAC8B;AAAA,UACrC;AAAA,QACJ;AACA,eAAO;AAAA;AAAA,UAAiC;AAAA,QAAU;AAAA,MACtD;AAMA,eAAS,gBAAgB,WAAW;AAChC,cAAM,UAAU,cAAc,SAAS;AACvC,cAAM,KAAK,KAAK,MAAM,OAAO;AAC7B,cAAM,YAAY,cAAc,OAAO;AACvC,YAAI,aAAa,QAAQ;AACzB,YAAI,SAAS,MAAM,MAAM;AAEzB,YAAI,UAAU,GAAG;AACb,gBAAM,IAAI,UAAU,kCAAkC;AAAA,QAC1D;AAGA,YAAI,cAAc,KAAK;AACnB,oBAAU;AACV,wBAAc;AAAA,QAClB;AAEA;AAAA;AAAA,UAAkC;AAAA,YAC9B;AAAA,YACA;AAAA,YACA;AAAA,YACA,UAAU,MAAM;AAAA,YAChB;AAAA,YACA,UAAU,MAAM;AAAA,YAChB,OAAO;AAAA,YACP,gBAAgB;AAAA,YAChB,QAAQ;AAAA,UACZ;AAAA;AAAA,MACJ;AAQA,eAAS,6BAA6B,OAAO,QAAQ,SAAS;AAC1D,YAAI,WAAW,MAAM,KAAK;AACtB,gBAAM,aAAa,MAAM,MAAM;AAC/B,gBAAM,YAAY;AAClB,gBAAM,UAAU;AAChB,cAAI,WAAW,QAAQ,iBAAiB;AACpC,kBAAM,YAAY;AAAA,UACtB;AAAA,QACJ;AAAA,MACJ;AAKA,eAAS,eAAe,OAAO;AAC3B,cAAM,SAAS,MAAM;AACrB,gBAAQ,KAAK;AACb,qCAA6B,OAAO,MAAM,MAAM;AAAA,MACpD;AAKA,eAAS,gBAAgB,OAAO;AAC5B,cAAM,SAAS,MAAM;AACrB,gBAAQ,KAAK;AACb,qCAA6B,OAAO,MAAM,MAAM;AAAA,MACpD;AAKA,eAAS,uBAAuB,OAAO;AACnC,cAAM,QAAQ;AAAA,UACV;AAAA,UACA,MAAM;AAAA,UACN,MAAM;AAAA,QACV;AACA,cAAM,WAAW,MAAM;AAAA,MAC3B;AASA,eAAS,iBACL,OACA,SACA,iBACA,mBACF;AACE,cAAM,QAAQ;AAAA,UACV;AAAA,UACA,MAAM;AAAA,UACN,MAAM;AAAA,QACV;AAEA,eAAO,MAAM,SAAS,MAAM,YAAY,MAAM,QAAQ;AAClD,cAAI,SAAS,OAAO,MAAM,MAAM,EAAE,GAAG;AACjC,kBAAM,WAAW,MAAM,MAAM;AAC7B,kBAAM,MAAM,MAAM,MAAM;AACxB,kBAAM,SAAS,MAAM;AACrB,gBAAI;AACA,sBAAQ,KAAK;AACb,wBAAU,OAAO,MAAM,KAAK;AAAA,YAChC,SAAS,GAAG;AACR,oBAAM,iBAAiB,MAAM,kBAAkB;AAAA,YACnD;AAEA,gBAAI,SAAS;AAIT,iCAAmB,eAAe;AAClC,qBAAO;AAAA,YACX;AAEA,8BAAkB;AAAA,UACtB;AAEA,iCAAuB,KAAK;AAAA,QAChC;AACA,eAAO;AAAA,MACX;AAQA,eAAS,aAAa,OAAO,SAASA,UAAS;AAE3C,cAAM,QAAQ;AAAA,UACV;AAAA,UACA,MAAM;AAAA,UACN,MAAM;AAAA,QACV;AACA,YAAI,MAAM,OAAO;AACb,cAAI;AACA,kBAAM,KAAK,MAAM,SAAS,MAAM,GAAG;AAAA,UACvC,SAAS,GAAG;AACR,kBAAM,iBAAiB,MAAM,kBAAkB;AAAA,UACnD;AAAA,QACJ,OAAO;AAEH,gBAAM,MAAM,MAAM;AAGlB,kBAAQ,MAAM;AAAA,QAClB;AACA,YAAI,MAAM,gBAAgB;AACtB,gBAAM,MAAM;AAAA,QAChB;AAEA,YAAI,SAAS;AACT,UAAAA,SAAQ,MAAM,GAAG;AAAA,QACrB,OAAO;AACH,iBAAO,MAAM;AAAA,QACjB;AAAA,MACJ;AASA,eAAS,OAAO,WAAW,SAASA,UAAS,QAAQ;AAEjD,cAAM,QAAQ,gBAAgB,SAAS;AAEvC,gBAAQ,MAAM;AACd,cAAM,aAAa;AAEnB,uBAAe,KAAK;AAEpB,cAAM,oBAAoB,WAAY;AAClC,uCAA6B,OAAO,MAAM,QAAQ;AAAA,YAC9C,iBAAiB;AAAA,UACrB,CAAC;AAAA,QACL;AAEA,cAAM,kBACF,WACA,WAAY;AACR,cAAI;AACA,8BAAkB;AAClB,mCAAuB,KAAK;AAC5B,wBAAY;AAAA,UAChB,SAAS,GAAG;AACR,mBAAO,CAAC;AAAA,UACZ;AAAA,QACJ;AAGJ,iBAAS,cAAc;AACnB,cACI;AAAA,YACI;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACJ,GACF;AACE;AAAA,UACJ;AAEA,0BAAgB,KAAK;AACrB,gBAAM,aAAa;AAEnB,iBAAO,aAAa,OAAO,SAASA,QAAO;AAAA,QAC/C;AAEA,eAAO,YAAY;AAAA,MACvB;AAMA,YAAM,OAAO,SAAS,KAAK,WAAW;AAClC,eAAO,OAAO,WAAW,KAAK;AAAA,MAClC;AAEA,YAAM,OAAO,SAAS,OAAO;AACzB,gBAAQ,KAAK;AACb,cAAM,QAAQ,WAAW,KAAK;AAC9B,YAAI,CAAC,OAAO;AACR,iBAAO,MAAM;AAAA,QACjB;AAEA,cAAM,aAAa;AACnB,YAAI;AACA,gBAAM,MAAM,MAAM;AAClB,oBAAU,OAAO,KAAK;AACtB,kBAAQ,KAAK;AACb,iBAAO,MAAM;AAAA,QACjB,UAAE;AACE,gBAAM,aAAa;AAAA,QACvB;AAAA,MACJ;AAMA,eAAS,0BAA0B,UAAU;AACzC,eAAO;AAAA,UACH,IAAI,QAAQ,QAAQ,SAAUA,UAAS,QAAQ;AAC3C,+BAAmB,WAAY;AAC3B,kBAAI;AACA,yBAASA,UAAS,MAAM;AAAA,cAC5B,SAAS,GAAG;AACR,uBAAO,CAAC;AAAA,cACZ;AAAA,YACJ,CAAC;AAAA,UACL,CAAC;AAAA,QACL;AAAA,MACJ;AAEA,YAAM,SAAS,SAAS,SAAS;AAC7B,gBAAQ,KAAK;AACb,iBAASvD,KAAI,GAAGA,KAAI,MAAM,WAAWA,MAAK;AACtC,cAAI,CAAC,MAAM,QAAQ;AACf,qCAAyB,KAAK;AAC9B,mBAAO,MAAM;AAAA,UACjB;AAEA,gBAAM,YAAY,MAAM,UAAU,OAAO;AACzC,cAAI,cAAc,GAAG;AACjB,qCAAyB,KAAK;AAC9B,mBAAO,MAAM;AAAA,UACjB;AAEA,mCAAyB,OAAOA,EAAC;AACjC,gBAAM,KAAK;AAAA,QACf;AAEA,cAAM,YAAY,WAAW,KAAK;AAClC,cAAM,qBAAqB,OAAO,SAAS;AAAA,MAC/C;AAEA,YAAM,aAAa,SAAS,aAAa;AACrC,eAAO,MAAM,KAAK,mBAAmB,CAAC;AAAA,MAC1C;AAEA,YAAM,YAAY,SAAS,YAAY;AACnC,cAAM,QAAQ,UAAU,KAAK;AAC7B,YAAI,CAAC,OAAO;AACR,kBAAQ,KAAK;AACb,iBAAO,MAAM;AAAA,QACjB;AAEA,eAAO,MAAM,KAAK,MAAM,SAAS,MAAM,GAAG;AAAA,MAC9C;AAEA,UAAI,OAAO,QAAQ,YAAY,aAAa;AAKxC,cAAM,YAAY,SAAS,UAAU,WAAW;AAC5C,iBAAO,0BAA0B,SAAUuD,UAAS,QAAQ;AACxD,mBAAO,WAAW,MAAMA,UAAS,MAAM;AAAA,UAC3C,CAAC;AAAA,QACL;AAEA,cAAM,YAAY,SAAS,YAAY;AACnC,iBAAO,0BAA0B,SAAUA,UAAS,QAAQ;AACxD,kBAAM,QAAQ,WAAW,KAAK;AAC9B,gBAAI,CAAC,OAAO;AACR,cAAAA,SAAQ,MAAM,GAAG;AACjB;AAAA,YACJ;AAEA,gBAAI;AACJ,kBAAM,aAAa;AACnB,kBAAM,MAAM,MAAM;AAClB,gBAAI;AACA,wBAAU,OAAO,KAAK;AAAA,YAC1B,SAAS,GAAG;AACR,oBAAM;AAAA,YACV;AACA,kBAAM,aAAa;AAEnB,+BAAmB,WAAY;AAC3B,kBAAI,KAAK;AACL,uBAAO,GAAG;AAAA,cACd,OAAO;AACH,gBAAAA,SAAQ,MAAM,GAAG;AAAA,cACrB;AAAA,YACJ,CAAC;AAAA,UACL,CAAC;AAAA,QACL;AAEA,cAAM,cAAc,SAAS,cAAc;AACvC,cAAIvD,KAAI;AAKR,mBAAS,MAAMuD,UAAS,QAAQ;AAC5B,gBAAI;AACA,sBAAQ,KAAK;AAEb,kBAAI;AACJ,kBAAIvD,KAAI,MAAM,WAAW;AACrB,oBAAI,CAAC,MAAM,WAAW;AAClB,2CAAyB,KAAK;AAC9B,kBAAAuD,SAAQ,MAAM,GAAG;AACjB;AAAA,gBACJ;AAEA,4BAAY,MAAM,UAAU,OAAO;AACnC,oBAAI,cAAc,GAAG;AACjB,2CAAyB,KAAK;AAC9B,kBAAAA,SAAQ,MAAM,GAAG;AACjB;AAAA,gBACJ;AAEA,yCAAyB,OAAOvD,EAAC;AACjC,sBAAM,KAAK;AAEX,gBAAAA;AAEA,mCAAmB,WAAY;AAC3B,wBAAMuD,UAAS,MAAM;AAAA,gBACzB,CAAC;AACD;AAAA,cACJ;AAEA,oBAAM,YAAY,WAAW,KAAK;AAClC,qBAAO,qBAAqB,OAAO,SAAS,CAAC;AAAA,YACjD,SAAS,GAAG;AACR,qBAAO,CAAC;AAAA,YACZ;AAAA,UACJ;AAEA,iBAAO,0BAA0B,SAAUA,UAAS,QAAQ;AACxD,kBAAMA,UAAS,MAAM;AAAA,UACzB,CAAC;AAAA,QACL;AAEA,cAAM,iBAAiB,SAAS,iBAAiB;AAC7C,iBAAO,0BAA0B,SAAUA,UAAS;AAChD,kBAAM,QAAQ,UAAU,KAAK;AAC7B,gBAAI,CAAC,OAAO;AACR,sBAAQ,KAAK;AACb,cAAAA,SAAQ,MAAM,GAAG;AACjB;AAAA,YACJ;AAEA,YAAAA,SAAQ,MAAM,UAAU,MAAM,SAAS,MAAM,GAAG,CAAC;AAAA,UACrD,CAAC;AAAA,QACL;AAAA,MACJ;AAEA,YAAM,QAAQ,SAAS,QAAQ;AAC3B,gBAAQ;AACR,cAAM,SAAS,oBAAI,IAAI;AACvB,cAAM,YAAY,IAAI,UAAU;AAChC,cAAM,OAAO,CAAC;AACd,cAAM,MAAM;AAAA,MAChB;AAEA,YAAM,gBAAgB,SAAS,cAAc,YAAY;AAErD,cAAM,SAAS,SAAS,UAAU;AAClC,cAAM,aAAa,SAAS,MAAM;AAElC,2BAAmB,CAAC,IAAI,mBAAmB,CAAC,IAAI;AAChD,2BAAmB,CAAC,IAAI,mBAAmB,CAAC,IAAI;AAEhD,cAAM,MAAM;AACZ,gBAAQ;AAGR,2BAAmB,OAAO,CAAC,UAAU;AACjC,gBAAM,aAAa;AACnB,gBAAM,UAAU;AAAA,QACpB,CAAC;AAAA,MACL;AAMA,YAAM,OAAO,SAAS,KAAK,WAAW;AAClC,cAAM,UAAU,cAAc,SAAS;AACvC,cAAM,KAAK,KAAK,MAAM,OAAO;AAE7B,2BAAmB,OAAO,CAAC,UAAU;AACjC,cAAI,MAAM,MAAM,KAAK,MAAM,QAAQ;AAC/B,kBAAM,SAAS,MAAM,MAAM;AAAA,UAC/B;AAAA,QACJ,CAAC;AAGD,yBAAiB,KAAK;AAEtB,cAAM,KAAK,EAAE;AACb,eAAO,MAAM;AAAA,MACjB;AAEA,UAAI,UAAU,aAAa;AACvB,cAAM,cAAc,uBAAO,OAAO,IAAI;AACtC,cAAM,YAAY,MAAM;AAAA,MAC5B;AAEA,UAAI,UAAU,QAAQ;AAClB,cAAM,SAAS;AAAA,MACnB;AAKA,YAAM,YAAY,WAAY;AAC1B,sBAAc;AACd,cAAM,YAAY,EAAE,MAAM,SAAS,CAAC;AAEpC,YAAI,MAAM,SAAS;AACf,gBAAM,kBAAkB;AACxB,gBAAM,oBAAoB;AAC1B,cAAI,QAAQvD,IAAG;AACf,eAAKA,KAAI,GAAG,IAAI,MAAM,QAAQ,QAAQA,KAAI,GAAGA,MAAK;AAC9C,qBAAS,MAAM,QAAQA,EAAC;AACxB,gBAAI,WAAW,YAAY,QAAQ,SAAS;AACxC,sBAAQ,QAAQ,SAAS,MAAM,eAAe;AAAA,YAClD,WAAW,WAAW,cAAc,QAAQ,SAAS;AACjD,sBAAQ,QAAQ,WAAW,MAAM,iBAAiB;AAAA,YACtD,WAAW,WAAW,eAAe;AACjC,oBAAM,yBACF,OAAO;AAAA,gBACH;AAAA,gBACA,IAAI,MAAM;AAAA,cACd;AACJ,kBACI,0BACA,uBAAuB,OACvB,CAAC,uBAAuB,KAC1B;AACE,uBAAO;AAAA,kBACH;AAAA,kBACA;AAAA,kBACA;AAAA,gBACJ;AAAA,cACJ,WAAW,uBAAuB,cAAc;AAC5C,wBAAQ,MAAM,IAAI,MAAM,IAAI,MAAM,EAAE;AAAA,cACxC;AAAA,YACJ,OAAO;AACH,kBAAI,MAAM,MAAM,KAAK,MAAM,MAAM,EAAE,gBAAgB;AAC/C,wBAAQ,MAAM,IAAI,MAAM,IAAI,MAAM,EAAE;AAAA,cACxC,OAAO;AACH,oBAAI;AACA,yBAAO,QAAQ,MAAM;AAAA,gBACzB,QAAQ;AAAA,gBAER;AAAA,cACJ;AAAA,YACJ;AACA,gBAAI,MAAM,wBAAwB,QAAW;AACzC,uBACQ,IAAI,GACR,IAAI,MAAM,oBAAoB,QAC9B,KACF;AACE,sBAAM,QAAQ,MAAM,oBAAoB,CAAC;AACzC,6BAAa,MAAM,UAAU,IAAI,MAAM;AAAA,cAC3C;AAAA,YACJ;AACA,gBAAI,MAAM,gCAAgC,QAAW;AACjD,uBACQ,IAAI,GACR,IAAI,MAAM,4BAA4B,QACtC,KACF;AACE,sBAAM,QAAQ,MAAM,4BAA4B,CAAC;AACjD,qCAAqB,MAAM,UAAU,IACjC,MAAM;AAAA,cACd;AAAA,YACJ;AAAA,UACJ;AAGA,gBAAM,UAAU,CAAC;AAAA,QACrB;AAEA,YAAI,MAAM,kBAAkB;AACxB,qBAAW;AAAA,YACP;AAAA,YACA;AAAA,UACJ,KAAK,MAAM,iBAAiB,QAAQ,GAAG;AACnC,mBAAO,oBAAoB,SAAS,QAAQ;AAC5C,kBAAM,iBAAiB,OAAO,QAAQ;AAAA,UAC1C;AAAA,QACJ;AAGA,YAAI,CAAC,MAAM,WAAW;AAClB,iBAAO,CAAC;AAAA,QACZ;AACA,eAAO,MAAM,UAAU,OAAO,MAAM;AAAA,MACxC;AAEA,aAAO;AAAA,IACX;AAOA,aAAS,mBAAmB,OAAO,OAAO;AACtC,YAAM,eAAe,eAAe,KAAK,MAAM,OAAO,KAAK;AAC3D,YAAM,aAAa,oBAAoB,cAAc,KAAK;AAC1D,YAAM,mBAAmB;AAAA,IAC7B;AAQA,aAAS,QAAQ4D,SAAQ;AACrB,UACI,UAAU,SAAS,KACnBA,mBAAkB,QAClB,MAAM,QAAQA,OAAM,KACpB,OAAOA,YAAW,UACpB;AACE,cAAM,IAAI;AAAA,UACN,kCAAkC;AAAA,YAC9BA;AAAA,UACJ,CAAC;AAAA,QACL;AAAA,MACJ;AAEA,UAAI,QAAQ,KAAK,WAAW,MAAM;AAG9B,cAAM,IAAI;AAAA,UACN;AAAA,QACJ;AAAA,MACJ;AAGA,MAAAA,UAAS,OAAOA,YAAW,cAAcA,UAAS,CAAC;AACnD,MAAAA,QAAO,oBAAoBA,QAAO,qBAAqB;AACvD,MAAAA,QAAO,mBAAmBA,QAAO,oBAAoB;AACrD,MAAAA,QAAO,0BACHA,QAAO,2BAA2B;AAEtC,YAAM,YAAY,OAAO,UAAU,eAAe;AAAA,QAC9CA;AAAA,QACA;AAAA,MACJ;AACA,YAAM,eAAe,OAAO,UAAU,eAAe;AAAA,QACjDA;AAAA,QACA;AAAA,MACJ;AAEA,UAAI,aAAa,cAAc;AAC3B,cAAM,IAAI;AAAA,UACN;AAAA,QACJ;AAAA,MACJ;AAEA,UAAIA,QAAO,QAAQ;AACf,cAAM,IAAI;AAAA,UACN;AAAA,QACJ;AAAA,MACJ;AAMA,eAAS,mBAAmB,OAAO;AAC/B,YAAIA,QAAO,qBAAqB;AAC5B;AAAA,QACJ;AAEA,cAAM,IAAI;AAAA,UACN,wDAAwD,KAAK;AAAA,QACjE;AAAA,MACJ;AAEA,UAAI5D,IAAG;AACP,YAAM,QAAQ,YAAY4D,QAAO,KAAKA,QAAO,SAAS;AACtD,YAAM,0BAA0BA,QAAO;AAEvC,YAAM,mBAAmB,oBAAI,IAAI;AAEjC,UAAI,WAAW;AACX,cAAM;AAAA,QAAuCA,QAAO,UAAU,CAAC;AAC/D,YAAI,MAAM,QAAQ,WAAW,GAAG;AAC5B,gBAAM;AAAA,UACF,OAAO,KAAK,MAAM;AAAA,QAE1B;AAAA,MACJ,WAAW,cAAc;AACrB,cAAM;AAAA;AAAA,UACFA,QAAO,aAAa,CAAC;AAAA;AAEzB,cAAM;AAAA,QACF,OAAO,KAAK,MAAM,EAAE;AAAA,UAChB,CAAC,WAAW,CAAC,iBAAiB,SAAS,MAAM;AAAA,QACjD;AAAA,MAER,OAAO;AACH,cAAM;AAAA,QAAuC,OAAO,KAAK,MAAM;AAAA,MACnE;AAEA,UAAIA,QAAO,sBAAsB,MAAM;AACnC,cAAM,YAAY;AAAA,UACd,MAAM;AAAA,UACN,OAAOA,QAAO;AAAA,QAClB,CAAC;AAAA,MACL;AAEA,UAAI,MAAM,QAAQ,SAAS,aAAa,GAAG;AACvC,cAAM,SAAS,MAAM;AACjB,cAAI,oCAAoC;AACpC,mBAAO,QAAQ,YAAY,YAAY;AAAA,UAC3C;AACA,cAAI,yBAAyB;AACzB,mBAAO,QAAQ,YAAY;AAAA,UAC/B;AAAA,QACJ,GAAG;AACH,YAAI,OAAO;AACP,iBAAO,oBAAoB,KAAK,EAAE,QAAQ,SAAU,MAAM;AACtD,gBAAI,SAAS,OAAO;AAChB,oBAAM,YAAY,IAAI,IAClB,KAAK,QAAQ,YAAY,MAAM,IACzB,aACA;AAAA,YACd;AAAA,UACJ,CAAC;AAED,gBAAM,YAAY,OAAO,CAAC,SACtB,IAAI,qBAAqB,MAAM,QAAQ,GAAG,CAAC;AAC/C,gBAAM,YAAY,UAAU,CAAC,SACzB,IAAI,qBAAqB,MAAM,WAAW,GAAG,GAAG;AAGpD,gBAAM,YAAY,aAAa,SAASA,QAAO,GAAG;AAAA,QACtD,YAAYA,QAAO,UAAU,CAAC,GAAG,SAAS,aAAa,GAAG;AACtD,6BAAmB,aAAa;AAAA,QACpC;AAAA,MACJ;AACA,UAAI,YAAY,gBAAgB,cAAc;AAC1C,cAAM,sBAAsB,CAAC;AAAA,MACjC;AACA,UAAI,YAAY,gBAAgB,sBAAsB;AAClD,cAAM,8BAA8B,CAAC;AAAA,MACzC;AACA,WAAK5D,KAAI,GAAG,IAAI,MAAM,QAAQ,QAAQA,KAAI,GAAGA,MAAK;AAC9C,cAAM,wBAAwB,MAAM,QAAQA,EAAC;AAE7C,YAAI,CAAC,UAAU,qBAAqB,GAAG;AACnC,6BAAmB,qBAAqB;AAExC;AAAA,QACJ;AAEA,YAAI,0BAA0B,UAAU;AACpC,cACI,QAAQ,WACR,OAAO,QAAQ,QAAQ,WAAW,YACpC;AACE,yBAAa,QAAQ,SAAS,uBAAuB,KAAK;AAAA,UAC9D;AAAA,QACJ,WAAW,0BAA0B,YAAY;AAC7C,cACI,QAAQ,WACR,OAAO,QAAQ,QAAQ,aAAa,YACtC;AACE,yBAAa,QAAQ,SAAS,uBAAuB,KAAK;AAAA,UAC9D;AAAA,QACJ,OAAO;AACH,uBAAa,SAAS,uBAAuB,KAAK;AAAA,QACtD;AACA,YACI,MAAM,wBAAwB,UAC9B,aAAa,qBAAqB,GACpC;AACE,gBAAM,WAAW,aAAa,qBAAqB;AACnD,gBAAM,oBAAoB,KAAK;AAAA,YAC3B,YAAY;AAAA,YACZ;AAAA,UACJ,CAAC;AACD,uBAAa,qBAAqB,IAC9B,QAAQ,qBAAqB;AAAA,QACrC;AACA,YAAI,MAAM,gCAAgC,QAAW;AACjD,cAAI,0BAA0B,cAAc;AACxC,kBAAM,4BAA4B,KAAK;AAAA,cACnC,YAAY;AAAA,cACZ,UAAU,qBAAqB;AAAA,YACnC,CAAC;AAED,iCAAqB,aAAa,CAC9B6D,QACA,OACA,UAAU,CAAC,MAEX,IAAI,QAAQ,CAACN,UAAS,WAAW;AAC7B,oBAAM,QAAQ,MAAM;AAChB,wBAAQ,OAAO;AAAA,kBACX;AAAA,kBACA;AAAA,gBACJ;AACA,sBAAM,iBAAiB,OAAO,KAAK;AAKnC,sBAAM,aAAa,MAAM;AACzB,uBAAO,QAAQ,OAAO,MAAM;AAAA,cAChC;AAEA,oBAAM,SAAS,MAAM,WAAW,MAAM;AAClC,oBAAI,QAAQ,QAAQ;AAChB,0BAAQ,OAAO;AAAA,oBACX;AAAA,oBACA;AAAA,kBACJ;AACA,wBAAM,iBAAiB,OAAO,KAAK;AAAA,gBACvC;AAEA,gBAAAA,SAAQ,KAAK;AAAA,cACjB,GAAGM,MAAK;AAER,kBAAI,QAAQ,QAAQ;AAChB,oBAAI,QAAQ,OAAO,SAAS;AACxB,wBAAM;AAAA,gBACV,OAAO;AACH,0BAAQ,OAAO;AAAA,oBACX;AAAA,oBACA;AAAA,kBACJ;AACA,wBAAM,iBAAiB;AAAA,oBACnB;AAAA,oBACA,QAAQ;AAAA,kBACZ;AAAA,gBACJ;AAAA,cACJ;AAAA,YACJ,CAAC;AAAA,UACT,WAAW,0BAA0B,gBAAgB;AACjD,kBAAM,4BAA4B,KAAK;AAAA,cACnC,YAAY;AAAA,cACZ,UAAU,qBAAqB;AAAA,YACnC,CAAC;AAED,iCAAqB,eAAe,CAAC,OAAO,UAAU,CAAC,MACnD,IAAI,QAAQ,CAACN,UAAS,WAAW;AAC7B,oBAAM,QAAQ,MAAM;AAChB,wBAAQ,OAAO;AAAA,kBACX;AAAA,kBACA;AAAA,gBACJ;AACA,sBAAM,iBAAiB,OAAO,KAAK;AAKnC,sBAAM,eAAe,MAAM;AAC3B,uBAAO,QAAQ,OAAO,MAAM;AAAA,cAChC;AAEA,oBAAM,SAAS,MAAM,aAAa,MAAM;AACpC,oBAAI,QAAQ,QAAQ;AAChB,0BAAQ,OAAO;AAAA,oBACX;AAAA,oBACA;AAAA,kBACJ;AACA,wBAAM,iBAAiB,OAAO,KAAK;AAAA,gBACvC;AAEA,gBAAAA,SAAQ,KAAK;AAAA,cACjB,CAAC;AAED,kBAAI,QAAQ,QAAQ;AAChB,oBAAI,QAAQ,OAAO,SAAS;AACxB,wBAAM;AAAA,gBACV,OAAO;AACH,0BAAQ,OAAO;AAAA,oBACX;AAAA,oBACA;AAAA,kBACJ;AACA,wBAAM,iBAAiB;AAAA,oBACnB;AAAA,oBACA,QAAQ;AAAA,kBACZ;AAAA,gBACJ;AAAA,cACJ;AAAA,YACJ,CAAC;AAAA,UACT,WAAW,0BAA0B,eAAe;AAChD,kBAAM,4BAA4B,KAAK;AAAA,cACnC,YAAY;AAAA,cACZ,UAAU,qBAAqB;AAAA,YACnC,CAAC;AAED,iCAAqB,cAAc,CAC/BM,QACA,OACA,UAAU,CAAC,OACT;AAAA,cACF,CAAC,OAAO,aAAa,GAAG,MAAM;AAC1B,sBAAM,mBAAmB,MAAM;AAC3B,sBAAIN,UAAS;AACb,wBAAM;AAAA;AAAA,oBAEE,IAAI,QAAQ,CAAC,KAAK,QAAQ;AACtB,sBAAAA,WAAU;AACV,+BAAS;AAAA,oBACb,CAAC;AAAA;AAET,0BAAQ,UAAUA;AAClB,0BAAQ,SAAS;AACjB,yBAAO;AAAA,gBACX;AAEA,oBAAI,OAAO;AACX,oBAAI,YAAY;AAChB,oBAAI;AACJ,oBAAI,gBAAgB;AACpB,sBAAM,YAAY,CAAC;AAEnB,sBAAM,SAAS,MAAM,YAAY,MAAM;AACnC,sBAAI,UAAU,SAAS,GAAG;AACtB,8BAAU,MAAM,EAAE,QAAQ;AAAA,kBAC9B,OAAO;AACH;AAAA,kBACJ;AAAA,gBACJ,GAAGM,MAAK;AAER,sBAAM,QAAQ,MAAM;AAChB,0BAAQ,OAAO;AAAA,oBACX;AAAA,oBACA;AAAA,kBACJ;AACA,wBAAM,iBAAiB,OAAO,KAAK;AAEnC,wBAAM,cAAc,MAAM;AAC1B,yBAAO;AACP,6BAAW,cAAc,WAAW;AAChC,+BAAW,QAAQ;AAAA,kBACvB;AAAA,gBACJ;AAEA,oBAAI,QAAQ,QAAQ;AAChB,sBAAI,QAAQ,OAAO,SAAS;AACxB,2BAAO;AAAA,kBACX,OAAO;AACH,4BAAQ,OAAO;AAAA,sBACX;AAAA,sBACA;AAAA,oBACJ;AACA,0BAAM,iBAAiB;AAAA,sBACnB;AAAA,sBACA,QAAQ;AAAA,oBACZ;AAAA,kBACJ;AAAA,gBACJ;AAEA,uBAAO;AAAA,kBACH,MAAM,YAAY;AACd,wBAAI,QAAQ,QAAQ,WAAW,CAAC,WAAW;AACvC,kCAAY;AACZ,4BAAM,QAAQ,OAAO;AAAA,oBACzB;AAEA,wBAAI,MAAM;AACN,6BAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,oBAC1C;AAEA,wBAAI,gBAAgB,GAAG;AACnB;AACA,6BAAO,EAAE,MAAM,OAAO,MAAa;AAAA,oBACvC;AAEA,0BAAM,aAAa,iBAAiB;AACpC,8BAAU,KAAK,UAAU;AAEzB,0BAAM;AAEN,wBAAI,cAAc,UAAU,WAAW,GAAG;AACtC,iCAAW,QAAQ;AAAA,oBACvB;AAEA,wBAAI,QAAQ,QAAQ,WAAW,CAAC,WAAW;AACvC,kCAAY;AACZ,4BAAM,QAAQ,OAAO;AAAA,oBACzB;AAEA,wBAAI,MAAM;AACN,6BAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,oBAC1C;AAEA,2BAAO,EAAE,MAAM,OAAO,MAAa;AAAA,kBACvC;AAAA,kBACA,QAAQ,YAAY;AAChB,wBAAI,MAAM;AACN,6BAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,oBAC1C;AAEA,wBAAI,UAAU,SAAS,GAAG;AACtB,mCAAa,iBAAiB;AAC9B,4BAAM;AAAA,oBACV;AAEA,0BAAM,cAAc,MAAM;AAC1B,2BAAO;AAEP,wBAAI,QAAQ,QAAQ;AAChB,8BAAQ,OAAO;AAAA,wBACX;AAAA,wBACA;AAAA,sBACJ;AACA,4BAAM,iBAAiB,OAAO,KAAK;AAAA,oBACvC;AAEA,2BAAO,EAAE,MAAM,MAAM,OAAO,OAAU;AAAA,kBAC1C;AAAA,gBACJ;AAAA,cACJ;AAAA,YACJ;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAEA,aAAO;AAAA,IACX;AAIA,WAAO;AAAA,MACH;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACJ;AAAA,EACJ;AAGA,QAAM,wBAAwB,WAAW,YAAY;AAErD,gBAAc,SAAS,sBAAsB;AAC7C,gBAAc,cAAc,sBAAsB;AAClD,gBAAc,UAAU,sBAAsB;AAE9C,gBAAc,aAAa;AAC3B,SAAO;AACR;AAEA,IAAI,uBAAuB,qBAAqB;AAEhD,IAAM,WAAW,WAAW;AAC5B,IAAM,aAAN,MAAiB;AAAA,EAChB;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,OAAO,SAAS;AAAA,EAChB,YAAY,EAAE,QAAAlB,SAAQ,QAAAiB,QAAO,GAAG;AAC/B,SAAK,cAAcA;AACnB,SAAK,cAAc;AACnB,SAAK,cAAc;AACnB,SAAK,cAAc,qBAAqB,WAAWjB,OAAM;AACzD,SAAK,UAAUA;AAAA,EAChB;AAAA,EACA,iBAAiB;AAChB,QAAI,KAAK,YAAa,MAAK,OAAO,MAAM;AAAA,EACzC;AAAA,EACA,UAAU;AACT,SAAK,cAAc;AAAA,EACpB;AAAA,EACA,eAAe;AACd,QAAI,KAAK,iBAAiB,EAAG,MAAK,OAAO,OAAO;AAAA,EACjD;AAAA,EACA,MAAM,oBAAoB;AACzB,QAAI,KAAK,iBAAiB,EAAG,OAAM,KAAK,OAAO,YAAY;AAAA,EAC5D;AAAA,EACA,uBAAuB;AACtB,QAAI,KAAK,iBAAiB,EAAG,MAAK,OAAO,UAAU;AAAA,EACpD;AAAA,EACA,MAAM,4BAA4B;AACjC,QAAI,KAAK,iBAAiB,EAAG,OAAM,KAAK,OAAO,eAAe;AAAA,EAC/D;AAAA,EACA,yBAAyB,QAAQ,GAAG;AACnC,QAAI,KAAK,iBAAiB,EAAG,UAAS3C,KAAI,OAAOA,KAAI,GAAGA,MAAK;AAC5D,WAAK,OAAO,KAAK;AAEjB,WAAK,OAAO,KAAK,CAAC;AAClB,UAAI,KAAK,OAAO,YAAY,MAAM,EAAG;AAAA,IACtC;AAAA,EACD;AAAA,EACA,MAAM,8BAA8B,QAAQ,GAAG;AAC9C,QAAI,KAAK,iBAAiB,EAAG,UAASA,KAAI,OAAOA,KAAI,GAAGA,MAAK;AAC5D,YAAM,KAAK,OAAO,UAAU;AAE5B,WAAK,OAAO,KAAK,CAAC;AAClB,UAAI,KAAK,OAAO,YAAY,MAAM,EAAG;AAAA,IACtC;AAAA,EACD;AAAA,EACA,oBAAoB,SAAS;AAC5B,QAAI,KAAK,iBAAiB,EAAG,MAAK,OAAO,KAAK,OAAO;AAAA,EACtD;AAAA,EACA,MAAM,yBAAyB,SAAS;AACvC,QAAI,KAAK,iBAAiB,EAAG,OAAM,KAAK,OAAO,UAAU,OAAO;AAAA,EACjE;AAAA,EACA,2BAA2B;AAC1B,QAAI,KAAK,iBAAiB,EAAG,MAAK,OAAO,WAAW;AAAA,EACrD;AAAA,EACA,cAAc;AACb,QAAI,KAAK,iBAAiB,EAAG,MAAK,OAAO,cAAc;AAAA,EACxD;AAAA,EACA,gBAAgB;AACf,QAAI,KAAK,aAAa;AACrB,WAAK,OAAO,UAAU;AACtB,WAAK,cAAc;AAAA,IACpB;AACA,QAAI,KAAK,aAAa;AACrB,WAAK,OAAO,UAAU;AACtB,WAAK,cAAc;AAAA,IACpB;AAAA,EACD;AAAA,EACA,gBAAgB;AACf,UAAM,WAAW,KAAK,eAAe,KAAK,IAAI;AAC9C,QAAI,KAAK,aAAa;AACrB,WAAK,OAAO,UAAU;AACtB,WAAK,cAAc;AAAA,IACpB;AACA,QAAI,KAAK,YAAa,MAAK,OAAO,UAAU;AAC5C,QAAI,SAAS,KAAK,aAAa;AAC/B,QAAI,eAAe,KAAK,QAAQ,SAAS,UAAU,EAAG,OAAM,IAAI,MAAM,wDAAwD;AAC9H,QAAI,YAAY,KAAK,aAAa;AAClC,QAAI,WAAW,UAAU,cAAc;AAEvC,eAAS,OAAO,KAAK,KAAK,YAAY,MAAM,EAAE,OAAO,CAAC,UAAU,UAAU,cAAc,UAAU,gBAAgB;AAAA,aACzG,WAAW,UAAU,cAAc,QAAQ;AAEnD,iBAAW,SAAS,CAAC,YAAY,gBAAgB,EAAG,KAAI,CAAC,UAAU,SAAS,KAAK,EAAG,aAAY,CAAC,GAAG,WAAW,KAAK;AAAA,IACrH;AACA,QAAI,eAAe,KAAK,aAAa,CAAC,UAAU,SAAS,UAAU,EAAG,aAAY,CAAC,GAAG,WAAW,UAAU;AAC3G,SAAK,SAAS,KAAK,YAAY,QAAQ;AAAA,MACtC,KAAK;AAAA,MACL,GAAG,KAAK;AAAA,MACR,GAAG,UAAU,EAAE,OAAO;AAAA,MACtB,GAAG,aAAa,EAAE,UAAU;AAAA,MAC5B,qBAAqB;AAAA,IACtB,CAAC;AACD,SAAK,cAAc;AAAA,EACpB;AAAA,EACA,QAAQ;AACP,QAAI,KAAK,iBAAiB,GAAG;AAC5B,YAAM,EAAE,KAAAoD,KAAI,IAAI,KAAK;AACrB,WAAK,OAAO,MAAM;AAClB,WAAK,OAAO,cAAcA,IAAG;AAAA,IAC9B;AAAA,EACD;AAAA,EACA,cAAcA,MAAK;AAClB,UAAM,OAAO,OAAOA,SAAQ,eAAeA,gBAAe,OAAOA,OAAM,IAAI,KAAKA,IAAG;AACnF,QAAI,KAAK,YAAa,MAAK,OAAO,cAAc,IAAI;AAAA,SAC/C;AACJ,YAAM,gBAAgB,QAAQ,IAAI,KAAK,KAAK,kBAAkB,CAAC;AAC/D,UAAI,KAAK,aAAa;AACrB,aAAK,cAAc;AACnB,aAAK,OAAO,cAAc,aAAa;AAAA,MACxC,OAAO;AACN,aAAK,cAAc;AACnB,aAAK,SAAS,KAAK,YAAY,QAAQ;AAAA,UACtC,KAAK;AAAA,UACL,QAAQ,CAAC,QAAQ,UAAU;AAAA,UAC3B,qBAAqB;AAAA,QACtB,CAAC;AAAA,MACF;AAAA,IACD;AAAA,EACD;AAAA,EACA,sBAAsB;AACrB,WAAO,KAAK,cAAc,IAAI,KAAK,KAAK,OAAO,GAAG,IAAI,KAAK;AAAA,EAC5D;AAAA,EACA,oBAAoB;AACnB,WAAO,KAAK,KAAK;AAAA,EAClB;AAAA,EACA,gBAAgB;AACf,QAAI,KAAK,iBAAiB,EAAG,QAAO,KAAK,OAAO,YAAY;AAC5D,WAAO;AAAA,EACR;AAAA,EACA,iBAAiB,MAAM,UAAU;AAChC,QAAI,KAAK,iBAAiB,EAAG,KAAI,SAAS,SAAU,MAAK,OAAO,YAAY,EAAE,MAAM,SAAS,CAAC;AAAA,aACrF,SAAS,iBAAkB,MAAK,OAAO,YAAY,EAAE,MAAM,YAAY,CAAC;AAAA,aACxE,SAAS,WAAY,MAAK,OAAO,YAAY;AAAA,MACrD,MAAM;AAAA,MACN,OAAO;AAAA,IACR,CAAC;AAAA,QACI,OAAM,IAAI,MAAM,sBAAsB,IAAI,EAAE;AAAA,EAClD;AAAA,EACA,UAAUQ,SAAQ;AACjB,SAAK,cAAcA;AAAA,EACpB;AAAA,EACA,eAAe;AACd,WAAO,KAAK;AAAA,EACb;AAAA,EACA,mBAAmB;AAClB,QAAI,CAAC,KAAK,YAAa,OAAM,IAAI,MAAM,+HAA+H;AACtK,WAAO,KAAK;AAAA,EACb;AACD;AAEA,IAAM,aAAa,uBAAO,IAAI,eAAe;AAc7C,SAAS,YAAY,OAAO;AAC3B,MAAI;AACH,WAAO,QAAQ,IAAI,OAAO,UAAU;AAAA,EACrC,QAAQ;AACP,WAAO;AAAA,EACR;AACD;AA2DA,SAAS,KAAK,KAAK,SAAS;AAC3B,MAAI,CAAC,eAAe,GAAG,EAAG,OAAM,IAAI,UAAU,sFAAsF;AACpI,QAAM,YAAY,CAAC;AACnB,QAAM,yBAAyB,IAAI,sBAAsB;AACzD,WAAS,WAAW,MAAM;AACzB,UAAM,UAAU,CAAC,GAAG,yBAAyB,GAAG,gBAAgB;AAChE,eAAW,YAAY,UAAW,KAAI,OAAO,MAAM,SAAS,WAAW,OAAO,EAAG,QAAO,SAAS,QAAQ,SAAS,CAAC,WAAW,EAAE,OAAO,cAAc,KAAK,OAAO,OAAO,KAAK;AAC7K,WAAO;AAAA,EACR;AACA,MAAI;AAAA;AAAA,IAEH,IAAI,SAAS;AACZ,YAAM,SAAS,WAAW,IAAI;AAC9B,UAAI,WAAW,KAAM,SAAQ,OAAO,SAAS,gBAAgB,aAAa,QAAQ,cAAc,SAAS,gBAAgB,UAAU,MAAM;AACxI,cAAM,IAAI,MAAM,kDAAkD,KAAK,IAAI,CAAC,QAAQ,UAAU,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,GAAG;AAAA,MAClH,IAAI,0BAA0B,GAAG,IAAI;AACrC,aAAO,aAAa;AACpB,aAAO,SAAS;AAChB,cAAQ,OAAO,MAAM;AAAA,QACpB,KAAK;AAAU,iBAAO,OAAO;AAAA,QAC7B,KAAK;AAAS,gBAAM,OAAO;AAAA,QAC3B,KAAK;AAAW,iBAAO,QAAQ,QAAQ,OAAO,KAAK;AAAA,QACnD,KAAK;AAAU,iBAAO,QAAQ,OAAO,OAAO,KAAK;AAAA,MAClD;AAAA,IACD;AAAA,EACD;AACA,WAAS,oBAAoB,MAAM;AAClC,UAAM,UAAU,CAAC,GAAG,yBAAyB,GAAG,gBAAgB;AAChE,QAAI,WAAW,UAAU,KAAK,CAACE,cAAa,OAAO,MAAMA,UAAS,WAAW,OAAO,CAAC;AACrF,QAAI,aAAa,QAAQ;AACxB,iBAAW;AAAA,QACV,WAAW;AAAA,QACX,SAAS,CAAC;AAAA,MACX;AACA,gBAAU,KAAK,QAAQ;AAAA,IACxB;AACA,WAAO;AAAA,EACR;AAEA,QAAM,SAAS,cAAc;AAAA,IAC5B,YAAY,IAAI,SAAS;AACxB,YAAM,WAAW,oBAAoB,IAAI;AACzC,eAAS,aAAaA,WAAUhD,OAAM,OAAO,OAAO;AACnD,QAAAgD,UAAS,QAAQ,KAAK;AAAA,UACrB,MAAAhD;AAAA,UACA;AAAA,UACA;AAAA,UACA,WAAW;AAAA,UACX,QAAQ;AAAA,QACT,CAAC;AAAA,MACF;AACA,YAAM,qBAAqB,cAAc;AAAA,QACxC,GAAG;AAAA,QACH,WAAW,CAAC,OAAOiD,aAAY;AAC9B,UAAAC,iBAAgBD,QAAO;AACvB,uBAAa,UAAU,SAAS,OAAOA,UAAS,SAAS,OAAO,iBAAiB;AACjF,iBAAO;AAAA,QACR;AAAA,QACA,eAAe,CAAC,UAAU;AACzB,uBAAa,UAAU,SAAS,OAAO,CAAC;AACxC,iBAAO;AAAA,QACR;AAAA,QACA,YAAY,CAAC,OAAOA,aAAY;AAC/B,UAAAC,iBAAgBD,QAAO;AACvB,uBAAa,UAAU,UAAU,OAAOA,UAAS,SAAS,OAAO,iBAAiB;AAClF,iBAAO;AAAA,QACR;AAAA,QACA,gBAAgB,CAAC,UAAU;AAC1B,uBAAa,UAAU,UAAU,OAAO,CAAC;AACzC,iBAAO;AAAA,QACR;AAAA,QACA,aAAa,CAAC,OAAOA,aAAY;AAChC,UAAAC,iBAAgBD,QAAO;AACvB,uBAAa,UAAU,WAAW,OAAOA,UAAS,SAAS,OAAO,iBAAiB;AACnF,iBAAO;AAAA,QACR;AAAA,QACA,iBAAiB,CAAC,UAAU;AAC3B,uBAAa,UAAU,WAAW,OAAO,CAAC;AAC1C,iBAAO;AAAA,QACR;AAAA,QACA,YAAY,CAAC,OAAOA,aAAY;AAC/B,UAAAC,iBAAgBD,QAAO;AACvB,uBAAa,UAAU,UAAU,OAAOA,UAAS,SAAS,OAAO,iBAAiB;AAClF,iBAAO;AAAA,QACR;AAAA,QACA,gBAAgB,CAAC,UAAU;AAC1B,uBAAa,UAAU,UAAU,OAAO,CAAC;AACzC,iBAAO;AAAA,QACR;AAAA,MACD,CAAC;AACD,aAAO;AAAA,IACR;AAAA,IACA,iBAAiB,MAAM;AACtB,YAAM,mBAAmB,UAAU,OAAO,CAAC,aAAa,SAAS,QAAQ,WAAW,KAAK,SAAS,QAAQ,KAAK,CAAC,WAAW,CAAC,gBAAgB,MAAM,CAAC,CAAC;AACpJ,aAAO;AAAA,QACN,aAAa,UAAU,WAAW,KAAK,iBAAiB,WAAW;AAAA,QACnE,kBAAkB,iBAAiB,IAAI,CAAC,aAAa,cAAc,SAAS,UAAU,IAAI,CAAC,aAAa,UAAU,QAAQ,CAAC,EAAE,KAAK,IAAI,CAAC,IAAI,SAAS,QAAQ,WAAW,IAAI,wBAAmB;AAAA,EAAK,cAAc,SAAS,OAAO,CAAC,EAAE,EAAE,EAAE,KAAK,MAAM;AAAA,MACpP;AAAA,IACD;AAAA,EACD,CAAC;AACD,MAAI,OAAO,QAAS,QAAO,OAAO,OAAO,IAAI,MAAM;AAClD,QAAI;AAAA;AAAA,MAEH,0BAA0B;AAAA,IAC3B;AAAA,EACD;AACA,SAAO;AACR;AACA,IAAM,yBAAyB,CAAC;AAChC,SAAS,cAAc,OAAO;AAC7B,UAAQ,eAAe,OAAO,YAAY,sBAAsB;AAChE,SAAO;AACR;AACA,SAAS,cAAc,SAAS;AAC/B,QAAM,QAAQ,QAAQ,IAAI,CAAC,QAAQ,UAAU;AAC5C,UAAM,SAAS,cAAc,OAAO,IAAI;AACxC,UAAM,OAAO,KAAK,UAAU,MAAM,CAAC,IAAI,MAAM,IAAI,UAAU,OAAO,KAAK,CAAC,GAAG,OAAO,UAAU,OAAO,oBAAoB,KAAK,cAAc,OAAO,KAAK,IAAI;AAC1J,UAAM,cAAc,CAAC,gBAAgB,MAAM,KAAK,QAAQ,MAAM,QAAQ,CAAC,EAAE,KAAK,CAAC,UAAU,MAAM,UAAU,OAAO,iBAAiB;AACjI,WAAO;AAAA,MACN;AAAA,MACA,WAAW,kBAAkB,MAAM,KAAK,cAAc,gCAA2B;AAAA,IAClF;AAAA,EACD,CAAC;AACD,QAAM,UAAU,KAAK,IAAI,GAAG,MAAM,IAAI,CAAC,SAAS,KAAK,KAAK,MAAM,CAAC;AACjE,SAAO,MAAM,IAAI,CAAC,EAAE,MAAM,UAAU,MAAM,GAAG,KAAK,OAAO,UAAU,CAAC,CAAC,GAAG,SAAS,EAAE,EAAE,KAAK,IAAI;AAC/F;AACA,SAAS,cAAcjD,OAAM;AAC5B,UAAQA,OAAM;AAAA,IACb,KAAK;AAAU,aAAO;AAAA,IACtB,KAAK;AAAW,aAAO;AAAA,IACvB,KAAK;AAAS,aAAO;AAAA,IACrB,KAAK;AAAU,aAAO;AAAA,IACtB;AAAS,YAAM,IAAI,MAAM,aAAaA,KAAI,yBAAyB;AAAA,EACpE;AACD;AACA,SAAS,gBAAgB,QAAQ;AAChC,SAAO,OAAO,cAAc,KAAK,OAAO,cAAc,OAAO,qBAAqB,OAAO;AAC1F;AACA,SAAS,kBAAkB,QAAQ;AAClC,MAAI,gBAAgB,MAAM,EAAG,QAAO,OAAO,cAAc,OAAO,oBAAoB,cAAc,cAAc,OAAO,KAAK,OAAO,OAAO,KAAK;AAC/I,SAAO,OAAO,cAAc,OAAO,oBAAoB,iBAAiB,GAAG,OAAO,SAAS,sBAAsB,OAAO,KAAK;AAC9H;AACA,SAAS,UAAU,QAAQ;AAC1B,MAAI,gBAAgB,MAAM,EAAG,QAAO;AACpC,SAAO;AACR;AACA,SAASkD,iBAAgB,SAAS;AACjC,MAAI,OAAO,SAAS,UAAU,YAAY,QAAQ,SAAS,EAAG,OAAM,IAAI,WAAW,gDAAgD;AACpI;AAEA,SAAS,iBAAiB,QAAQ,QAAQ;AACzC,MAAI,OAAO,UAAU,OAAQ,QAAO,QAAQ,OAAO,MAAM,QAAQ,OAAO,SAAS,OAAO,OAAO;AAC/F,SAAO;AACR;AACA,SAAS,QAAQ,UAAU,UAAU,CAAC,GAAG;AACxC,QAAM,EAAE,YAAAR,aAAY,aAAAE,cAAa,cAAAD,eAAc,eAAAE,eAAc,IAAI,cAAc;AAC/E,QAAM,EAAE,WAAW,IAAI,UAAU,IAAI,IAAI,OAAO,YAAY,WAAW,EAAE,SAAS,QAAQ,IAAI;AAC9F,QAAM,oBAAoC,oBAAI,MAAM,mBAAmB;AACvE,SAAO,IAAI,QAAQ,CAACJ,UAAS,WAAW;AACvC,QAAI;AACJ,QAAI,gBAAgB;AACpB,QAAI;AACJ,QAAI;AACJ,UAAM,YAAY,CAAC,WAAW;AAC7B,UAAI,UAAW,CAAAE,cAAa,SAAS;AACrC,UAAI,WAAY,CAAAE,eAAc,UAAU;AACxC,MAAAJ,SAAQ,MAAM;AAAA,IACf;AACA,UAAM,gBAAgB,MAAM;AAC3B,UAAI,WAAY,CAAAI,eAAc,UAAU;AACxC,UAAI,QAAQ;AACZ,UAAI,CAAC,MAAO,SAAQ,iBAAiC,oBAAI,MAAM,uBAAuB,GAAG,iBAAiB;AAC1G,aAAO,KAAK;AAAA,IACb;AACA,UAAM,gBAAgB,MAAM;AAC3B,UAAI,GAAG,aAAa,EAAG,IAAG,oBAAoB,QAAQ;AACtD,UAAI,kBAAkB,UAAW;AACjC,UAAI;AACH,cAAM,SAAS,SAAS;AACxB,YAAI,WAAW,QAAQ,OAAO,WAAW,YAAY,OAAO,OAAO,SAAS,YAAY;AACvF,gBAAM,WAAW;AACjB,0BAAgB;AAChB,mBAAS,KAAK,CAAC,kBAAkB;AAChC,4BAAgB;AAChB,sBAAU,aAAa;AAAA,UACxB,GAAG,CAAC,kBAAkB;AACrB,4BAAgB;AAChB,wBAAY;AAAA,UACb,CAAC;AAAA,QACF,OAAO;AACN,oBAAU,MAAM;AAChB,iBAAO;AAAA,QACR;AAAA,MACD,SAAS,OAAO;AACf,oBAAY;AAAA,MACb;AAAA,IACD;AACA,QAAI,cAAc,MAAM,KAAM;AAC9B,gBAAYH,YAAW,eAAe,OAAO;AAC7C,iBAAaE,aAAY,eAAe,QAAQ;AAAA,EACjD,CAAC;AACF;AACA,SAAS,UAAU,UAAU,UAAU,CAAC,GAAG;AAC1C,QAAM,EAAE,YAAAF,aAAY,aAAAE,cAAa,cAAAD,eAAc,eAAAE,eAAc,IAAI,cAAc;AAC/E,QAAM,EAAE,WAAW,IAAI,UAAU,IAAI,IAAI,OAAO,YAAY,WAAW,EAAE,SAAS,QAAQ,IAAI;AAC9F,QAAM,oBAAoC,oBAAI,MAAM,mBAAmB;AACvE,SAAO,IAAI,QAAQ,CAACJ,UAAS,WAAW;AACvC,QAAI,gBAAgB;AACpB,QAAI;AACJ,QAAI;AACJ,UAAM,WAAW,CAAC,UAAU;AAC3B,UAAI,WAAY,CAAAI,eAAc,UAAU;AACxC,UAAI,CAAC,MAAO,SAAQ,iBAAiC,oBAAI,MAAM,yBAAyB,GAAG,iBAAiB;AAC5G,aAAO,KAAK;AAAA,IACb;AACA,UAAM,YAAY,CAAC,WAAW;AAC7B,UAAI,CAAC,OAAQ;AACb,UAAI,UAAW,CAAAF,cAAa,SAAS;AACrC,UAAI,WAAY,CAAAE,eAAc,UAAU;AACxC,MAAAJ,SAAQ,MAAM;AACd,aAAO;AAAA,IACR;AACA,UAAM,gBAAgB,MAAM;AAC3B,UAAI,GAAG,aAAa,EAAG,IAAG,oBAAoB,QAAQ;AACtD,UAAI,kBAAkB,UAAW;AACjC,UAAI;AACH,cAAM,SAAS,SAAS;AACxB,YAAI,WAAW,QAAQ,OAAO,WAAW,YAAY,OAAO,OAAO,SAAS,YAAY;AACvF,gBAAM,WAAW;AACjB,0BAAgB;AAChB,mBAAS,KAAK,CAAC,kBAAkB;AAChC,4BAAgB;AAChB,sBAAU,aAAa;AAAA,UACxB,GAAG,CAAC,kBAAkB;AACrB,4BAAgB;AAChB,qBAAS,aAAa;AAAA,UACvB,CAAC;AAAA,QACF,MAAO,QAAO,UAAU,MAAM;AAAA,MAC/B,SAAS,OAAO;AACf,iBAAS,KAAK;AAAA,MACf;AAAA,IACD;AACA,QAAI,cAAc,MAAM,KAAM;AAC9B,gBAAYC,YAAW,UAAU,OAAO;AACxC,iBAAaE,aAAY,eAAe,QAAQ;AAAA,EACjD,CAAC;AACF;AAEA,SAAS,eAAe;AACvB,MAAI,UAAU;AACd,QAAM,QAAQ,MAAM,eAAe;AACnC,MAAI;AACJ,QAAM,SAAS,MAAM,YAAY,IAAI,WAAW;AAAA,IAC/C,QAAQ;AAAA,IACR,QAAQ,MAAM,EAAE,OAAO;AAAA,EACxB,CAAC;AACD,QAAM,eAA+B,oBAAI,IAAI;AAC7C,QAAM,YAA4B,oBAAI,IAAI;AAC1C,QAAM,eAAe;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACA,QAAM,QAAQ;AAAA,IACb,cAAcE,SAAQ;AACrB,UAAI,eAAe,GAAG;AACrB,YAAIA,SAAQ,QAAQ,SAAS,UAAU,KAAK,MAAM,EAAE,QAAQ,YAAY,QAAQ,SAAS,UAAU,EAAG,OAAM,IAAI,MAAM,wIAA0I;AAAA,MACjQ;AACA,UAAIA,QAAQ,QAAO,EAAE,UAAU;AAAA,QAC9B,GAAG,MAAM,EAAE,OAAO;AAAA,QAClB,GAAGA;AAAA,MACJ,CAAC;AAAA,UACI,QAAO,EAAE,UAAU,MAAM,EAAE,OAAO,UAAU;AACjD,aAAO,EAAE,cAAc;AACvB,aAAO;AAAA,IACR;AAAA,IACA,eAAe;AACd,aAAO,OAAO,EAAE,aAAa;AAAA,IAC9B;AAAA,IACA,gBAAgB;AACf,aAAO,EAAE,cAAc;AACvB,aAAO;AAAA,IACR;AAAA,IACA,uBAAuB;AACtB,aAAO,EAAE,qBAAqB;AAC9B,aAAO;AAAA,IACR;AAAA,IACA,MAAM,4BAA4B;AACjC,YAAM,OAAO,EAAE,0BAA0B;AACzC,aAAO;AAAA,IACR;AAAA,IACA,eAAe;AACd,aAAO,EAAE,aAAa;AACtB,aAAO;AAAA,IACR;AAAA,IACA,MAAM,oBAAoB;AACzB,YAAM,OAAO,EAAE,kBAAkB;AACjC,aAAO;AAAA,IACR;AAAA,IACA,cAAc;AACb,aAAO,EAAE,YAAY;AACrB,aAAO;AAAA,IACR;AAAA,IACA,oBAAoB,IAAI;AACvB,aAAO,EAAE,oBAAoB,EAAE;AAC/B,aAAO;AAAA,IACR;AAAA,IACA,MAAM,yBAAyB,IAAI;AAClC,YAAM,OAAO,EAAE,yBAAyB,EAAE;AAC1C,aAAO;AAAA,IACR;AAAA,IACA,2BAA2B;AAC1B,aAAO,EAAE,yBAAyB;AAClC,aAAO;AAAA,IACR;AAAA,IACA,MAAM,gCAAgC;AACrC,YAAM,OAAO,EAAE,8BAA8B;AAC7C,aAAO;AAAA,IACR;AAAA,IACA,2BAA2B;AAC1B,aAAO,EAAE,yBAAyB;AAClC,aAAO;AAAA,IACR;AAAA,IACA,gBAAgB;AACf,aAAO,OAAO,EAAE,cAAc;AAAA,IAC/B;AAAA,IACA,cAAc,MAAM;AACnB,aAAO,EAAE,cAAc,IAAI;AAC3B,aAAO;AAAA,IACR;AAAA,IACA,sBAAsB;AACrB,aAAO,OAAO,EAAE,oBAAoB;AAAA,IACrC;AAAA,IACA,oBAAoB;AACnB,aAAO,OAAO,EAAE,kBAAkB;AAAA,IACnC;AAAA,IACA,iBAAiB;AAChB,aAAO,EAAE,eAAe;AACxB,aAAO;AAAA,IACR;AAAA,IACA,iBAAiB,MAAM,UAAU;AAChC,aAAO,EAAE,iBAAiB,MAAM,QAAQ;AACxC,aAAO;AAAA,IACR;AAAA;AAAA,IAEA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,cAAc,CAACvD,QAAO;AACrB,aAAO,SAAS,qBAAqB,MAAM;AAC1C,cAAM,SAASA,IAAG,MAAM,MAAM,IAAI;AAClC,YAAI,UAAU,OAAO,WAAW,YAAY,OAAO,OAAO,SAAS,YAAY;AAC9E,gBAAM,kBAAkC,oBAAI,MAAM,mBAAmB;AACrE,kBAAQ,eAAe4D,qBAAoB;AAC1C,gBAAI;AACH,qBAAO,MAAM;AAAA,YACd,SAAS,OAAO;AACf,kBAAI,iBAAiB,SAAS,CAAC,MAAM,OAAO,SAAS,mBAAmB,EAAG,kBAAiB,OAAO,eAAe;AAClH,oBAAM;AAAA,YACP;AAAA,UACD,GAAG;AAAA,QACJ;AACA,eAAO;AAAA,MACR;AAAA,IACD;AAAA,IACA,QAAQ,SAAS;AAChB,kBAAY,SAAS,wBAA0B,CAAC,UAAU,CAAC;AAC3D,aAAO,QAAQ;AAAA,IAChB;AAAA,IACA,KAAK,MAAM,SAAS;AACnB,UAAI,OAAO,SAAS,SAAU,OAAM,IAAI,UAAU,mDAAmD,OAAO,IAAI,EAAE;AAClH,YAAM,WAAW,YAAY,MAAM;AACnC,cAAQ,EAAE,UAAU,MAAM,UAAU,OAAO,YAAY,aAAa,MAAM,QAAQ,MAAM,QAAQ,EAAE,aAAa,MAAM,UAAU,QAAQ,EAAE,eAAe,EAAE,SAAS,CAAC,IAAI,OAAO;AAAA,IAChL;AAAA,IACA,OAAO,MAAM;AACZ,UAAI,OAAO,SAAS,SAAU,OAAM,IAAI,UAAU,qDAAqD,OAAO,IAAI,EAAE;AACpH,cAAQ,EAAE,YAAY,MAAM,YAAY,QAAQ,CAAC;AAAA,IAClD;AAAA,IACA,OAAO,MAAM,SAAS;AACrB,UAAI,OAAO,SAAS,SAAU,OAAM,IAAI,UAAU,qDAAqD,OAAO,IAAI,EAAE;AACpH,YAAM,WAAW,YAAY,QAAQ;AACrC,cAAQ,EAAE,UAAU,MAAM,UAAU,OAAO,YAAY,aAAa,MAAM,QAAQ,MAAM,QAAQ,EAAE,aAAa,MAAM,UAAU,QAAQ,EAAE,eAAe,EAAE,SAAS,CAAC,IAAI,OAAO;AAC/K,YAAM,KAAK,CAAC;AACZ,UAAI,OAAO,QAAS,IAAG,OAAO,OAAO,IAAI,MAAM;AAC9C,gBAAQ,EAAE,YAAY,MAAM,QAAQ;AAAA,MACrC;AACA,aAAO;AAAA,IACR;AAAA,IACA,SAAS,MAAM;AACd,UAAI,OAAO,SAAS,SAAU,OAAM,IAAI,UAAU,uDAAuD,OAAO,IAAI,EAAE;AACtH,YAAM,WAAW,YAAY,UAAU;AACvC,cAAQ,EAAE,YAAY,MAAM,QAAQ;AAAA,IACrC;AAAA,IACA,MAAM,aAAa,MAAM;AACxB,YAAM,WAAW,YAAY,cAAc;AAC3C,aAAO,QAAQ,EAAE,aAAa,MAAM,UAAU,QAAQ,EAAE,eAAe,EAAE,SAAS;AAAA,IACnF;AAAA,IACA,MAAM,WAAW,MAAM;AACtB,YAAM,WAAW,YAAY,YAAY;AACzC,aAAO,QAAQ,EAAE,WAAW,MAAM,QAAQ;AAAA,IAC3C;AAAA,IACA,WAAW,OAAO,SAAS;AAC1B,aAAO,QAAQ,EAAE,WAAW,EAAE,MAAM,GAAG,QAAQ,SAAS,MAAM,YAAY,UAAU,EAAE;AAAA,IACvF;AAAA;AAAA,IAEA,OAAO,MAAM,WAAW,CAAC,GAAG;AAC3B,aAAO;AAAA,IACR;AAAA,IACA,eAAe5D,KAAI;AAClB,aAAO,eAAeA,GAAE;AAAA,IACzB;AAAA,IACA,gBAAgB;AACf,oBAAc;AACd,aAAO;AAAA,IACR;AAAA,IACA,gBAAgB;AACf,oBAAc;AACd,aAAO;AAAA,IACR;AAAA,IACA,kBAAkB;AACjB,sBAAgB;AAChB,aAAO;AAAA,IACR;AAAA,IACA,WAAW,MAAM,OAAO;AACvB,UAAI,CAAC,aAAa,IAAI,IAAI,EAAG,cAAa,IAAI,MAAM,OAAO,yBAAyB,YAAY,IAAI,CAAC;AACrG,aAAO,eAAe,YAAY,MAAM;AAAA,QACvC;AAAA,QACA,UAAU;AAAA,QACV,cAAc;AAAA,QACd,YAAY;AAAA,MACb,CAAC;AACD,aAAO;AAAA,IACR;AAAA,IACA,QAAQ,MAAM,OAAO;AACpB,YAAM,MAAM,MAAM,EAAE;AACpB,UAAI,CAAC,UAAU,IAAI,IAAI,EAAG,WAAU,IAAI,MAAM,IAAI,IAAI,CAAC;AACvD,UAAI,UAAU,OAAQ,QAAO,IAAI,IAAI;AAAA,eAC5B,aAAa,SAAS,IAAI,EAAG,KAAI,IAAI,IAAI,QAAQ,MAAM;AAAA,UAC3D,KAAI,IAAI,IAAI,OAAO,KAAK;AAC7B,aAAO;AAAA,IACR;AAAA,IACA,mBAAmB;AAClB,mBAAa,QAAQ,CAAC,UAAU,SAAS;AACxC,YAAI,CAAC,SAAU,SAAQ,eAAe,YAAY,IAAI;AAAA,YACjD,QAAO,eAAe,YAAY,MAAM,QAAQ;AAAA,MACtD,CAAC;AACD,mBAAa,MAAM;AACnB,aAAO;AAAA,IACR;AAAA,IACA,gBAAgB;AACf,YAAM,MAAM,MAAM,EAAE;AACpB,gBAAU,QAAQ,CAAC,UAAU,SAAS;AACrC,YAAI,aAAa,OAAQ,QAAO,IAAI,IAAI;AAAA,YACnC,KAAI,IAAI,IAAI;AAAA,MAClB,CAAC;AACD,gBAAU,MAAM;AAChB,aAAO;AAAA,IACR;AAAA,IACA,eAAe;AACd,mBAAa,MAAM,EAAE,gBAAgB;AACrC,aAAO;AAAA,IACR;AAAA,IACA,MAAM,uBAAuB;AAC5B,aAAO,wBAAwB;AAAA,IAChC;AAAA,IACA,UAAUuD,SAAQ;AACjB,UAAI,CAAC,QAAS,WAAU,EAAE,GAAG,MAAM,EAAE,OAAO;AAC5C,aAAO,OAAO,MAAM,EAAE,QAAQA,OAAM;AAAA,IACrC;AAAA,IACA,cAAc;AACb,UAAI,QAAS,QAAO,OAAO,MAAM,EAAE,QAAQ,OAAO;AAAA,IACnD;AAAA,EACD;AACA,SAAO;AACR;AACA,IAAM,SAAS,aAAa;AAC5B,IAAM,KAAK;AACX,SAAS,UAAU;AAElB,SAAO,OAAO,sBAAsB,cAAc,oBAAoB,IAAI,MAAM,CAAC,GAAG,EAAE,IAAIzB,IAAG,MAAM;AAClG,UAAM,IAAI,MAAM,6DAA6D,OAAO,IAAI,CAAC,kBAAkB;AAAA,EAC5G,EAAE,CAAC;AACJ;AACA,SAAS,YAAY,MAAM;AAC1B,QAAM,aAAa,uBAAuB,EAAE,iBAAiB,EAAE,CAAC,EAAE,MAAM,IAAI;AAE5E,QAAM,qBAAqB,WAAW,cAAc,CAAC,UAAU;AAC9D,WAAO,MAAM,SAAS,cAAc,IAAI,EAAE,KAAK,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK,MAAM,SAAS,OAAO,IAAI,IAAI;AAAA,EAC5G,CAAC;AACD,SAAO,iBAAiB,WAAW,qBAAqB,CAAC,CAAC,GAAG,QAAQ;AACtE;AACA,SAAS,iBAAiB,QAAQ,QAAQ;AACzC,MAAI,OAAO,UAAU,OAAQ,QAAO,QAAQ,OAAO,MAAM,QAAQ,OAAO,SAAS,OAAO,OAAO;AAC/F,SAAO;AACR;AACA,SAAS,eAAe;AACvB,QAAM,EAAE,YAAAqB,YAAW,IAAI,cAAc;AACrC,SAAO,IAAI,QAAQ,CAACD,aAAYC,YAAWD,UAAS,CAAC,CAAC;AACvD;AACA,eAAe,0BAA0B;AACxC,QAAM,aAAa;AACnB,QAAM,QAAQ,eAAe;AAC7B,QAAM,WAAW,CAAC;AAClB,QAAM,iBAAiB,MAAM,iBAAiB;AAC9C,aAAW,CAACpB,IAAG,GAAG,KAAK,MAAM,iBAAiB,cAAe,KAAI,IAAI,WAAW,CAAC,IAAI,UAAW,UAAS,KAAK,IAAI,OAAO;AACzH,MAAI,CAAC,SAAS,UAAU,CAAC,eAAgB;AACzC,QAAM,QAAQ,WAAW,QAAQ;AACjC,QAAM,wBAAwB;AAC/B;AAGA,IAAM,cAAc;AAAA,EACnB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD;AASA,SAAS,eAAe,OAAO,QAAQ;AACtC,QAAM,UAA0B,oBAAI,MAAM,kCAAkC;AAC5E,QAAM,eAAe,OAAO,MAAM;AACnC;AACA,SAAS,iBAAiBV,SAAQ;AACjC,SAAO,SAAS,KAAKpB,KAAI,UAAU,CAAC,GAAG;AACtC,UAAM,WAAW,eAAe,EAAE,OAAO,QAAQ,QAAQ,CAAC;AAC1D,UAAM,EAAE,WAAW,SAAS,YAAY,IAAI,UAAU,SAAS,WAAW,KAAK,QAAQ,IAAI;AAE3F,UAAM,YAAYoB,QAAO,MAAM,OAAO,EAAE,YAAY,EAAE,MAAM,KAAK,CAAC;AAClE,IAAApB,MAAKA,IAAG,KAAK,SAAS;AAEtB,IAAK,cAAK,KAAK,WAAW,YAAYA,GAAE;AACxC,IAAK,cAAK,KAAK,WAAW,iBAAiB,OAAO;AAClD,IAAK,cAAK,KAAK,WAAW,kBAAkB,QAAQ;AACpD,UAAMwB,QAAY,cAAK,KAAK,WAAW,aAAa;AACpD,QAAI,CAACA,MAAM,OAAM,IAAI,MAAM,4CAA4C;AACvE,UAAM,QAAQ,IAAI,MAAM,WAAW,EAAE,IAAI,QAAQ,KAAK,UAAU;AAC/D,YAAM,oBAAoB,QAAQ,IAAI,QAAQ,KAAK,QAAQ;AAC3D,UAAI,OAAO,sBAAsB,WAAY,QAAO,6BAAkC,YAAY,QAAQ;AAC1G,UAAI,QAAQ,SAAU,QAAO;AAC7B,UAAI,OAAO,QAAQ,YAAY,YAAY,SAAS,GAAG,EAAG,OAAM,IAAI,YAAY,uDAAuD,GAAG,+DAA+D;AAmBzM,aAAO,SAAS,yBAAyB,MAAM;AAC9C,cAAM,oBAAoC,oBAAI,MAAM,mBAAmB;AACvE,cAAM,UAAU,YAAY;AAC3B,UAAK,cAAK,KAAK,WAAW,SAAS,GAAG;AACtC,UAAK,cAAK,KAAK,WAAW,SAAS,iBAAiB;AACpD,gBAAM,UAAe,cAAK,KAAK,WAAW,eAAe;AACzD,gBAAM,YAAiB,cAAK,KAAK,WAAW,iBAAiB;AAC7D,gBAAM,UAAU,EAAE,UAAU,CAAC;AAC7B,cAAI,OAAO,yBAAyB,mBAAmB,0BAA0B,GAAG,MAAO,KAAI;AAC9F,kBAAM,SAAS,MAAM,kBAAkB,KAAK,WAAW,GAAG,IAAI;AAC9D,kBAAM,YAAY;AAAA,cACjB;AAAA,cACA,QAAQ;AAAA,YACT,CAAC;AACD,mBAAO;AAAA,UACR,SAAS,KAAK;AACb,kBAAM,YAAY;AAAA,cACjB;AAAA,cACA,QAAQ;AAAA,YACT,CAAC;AACD,2BAAe,KAAK,iBAAiB;AAAA,UACtC;AACA,gBAAM,EAAE,YAAA2B,aAAY,cAAAC,cAAa,IAAI,cAAc;AACnD,cAAI;AACJ,gBAAM,oBAAoB,IAAI,gBAAgB;AAC9C,gBAAM,iBAAiB,IAAI,QAAQ,CAACF,aAAY;AAC/C,sBAAUC,YAAW,MAAM;AAC1B,gCAAkB,MAAM;AACxB,cAAAD,SAAQ;AAAA,YACT,GAAG,OAAO;AAAA,UACX,CAAC;AACD,cAAI;AACJ,cAAI;AACH,mBAAO,KAAM,KAAI;AAChB,oBAAM,WAAW,MAAM,SAAS,QAAQ,QAAQ,EAAE,KAAK,MAAMlD,IAAG,EAAE,QAAQ,kBAAkB,OAAO,CAAC,CAAC,GAAG,cAAc;AACtH,kBAAI,CAAC,SAAS,IAAI;AACjB,8BAA8B,oBAAI,MAAM,gDAAgD;AACxF;AAAA,cACD;AACA,oBAAM,MAAM,SAAS;AACrB,cAAK,cAAK,KAAK,WAAW,UAAU,GAAG;AACvC,oBAAM,kBAAkB,MAAM,SAAS,QAAQ,QAAQ,EAAE,KAAK,MAAM,kBAAkB,MAAM,WAAW,IAAI,CAAC,GAAG,cAAc;AAC7H,kBAAI,CAAC,gBAAgB,IAAI;AACxB,8BAA8B,oBAAI,MAAM,iDAAiD;AACzF;AAAA,cACD;AACA,oBAAM,SAAS,gBAAgB;AAC/B,oBAAM,YAAY;AAAA,gBACjB;AAAA,gBACA,QAAQ;AAAA,cACT,CAAC;AACD,qBAAO;AAAA,YACR,SAAS,KAAK;AACb,0BAAY;AAGZ,kBAAI,QAAQ,oBAAqB;AACjC,kBAAI,EAAE,MAAM,SAAS,MAAM,UAAUmD,WAAU,GAAG,cAAc,GAAG,GAAI;AACvE,kBAAI,GAAG,aAAa,EAAG,IAAG,oBAAoB,QAAQ;AAAA,YACvD;AAAA,UACD,UAAE;AACD,YAAAC,cAAa,OAAO;AAAA,UACrB;AACA,cAAI,WAAW;AACd,kBAAM,YAAY;AAAA,cACjB;AAAA,cACA,QAAQ;AAAA,YACT,CAAC;AACD,2BAAe,WAAW,iBAAiB;AAAA,UAC5C;AAAA,QACD;AACA,YAAI,UAAU;AACd,QAAA5B,MAAK,eAAe,CAAC;AACrB,QAAAA,MAAK,WAAW,KAAK,MAAM;AAC1B,cAAI,CAAC,SAAS;AACb,kBAAM,UAAe,cAAK,KAAK,WAAW,QAAQ,IAAI,SAAS;AAC/D,kBAAM,kBAAkB,UAAe,cAAK,KAAK,WAAW,eAAe,IAAI,qBAAqB,iBAAiB,IAAI,OAAO,GAAG,OAAO,GAAG,CAAC;AAC9I,kBAAM,eAA+B,oBAAI,MAAM,GAAG,eAAe;AAAA;AAAA,QAA+I,eAAe;AAAA,CAAI,GAAG,iBAAiB;AAAA,UACxP;AAAA,QACD,CAAC;AACD,YAAI;AAEJ,cAAM,OAAY,cAAK,KAAK,WAAW,YAAY;AACnD,cAAM,QAAQ,MAAM,kBAAkB,OAAO,KAAK,QAAQ,GAAG,iBAAiB,IAAI,QAAQ;AAG1F,eAAO;AAAA,UACN,KAAK,aAAa,YAAY;AAC7B,sBAAU;AACV,mBAAO,MAAM,EAAE,KAAK,aAAa,UAAU;AAAA,UAC5C;AAAA,UACA,MAAM,YAAY;AACjB,sBAAU;AACV,mBAAO,MAAM,EAAE,MAAM,UAAU;AAAA,UAChC;AAAA,UACA,QAAQ,WAAW;AAClB,sBAAU;AACV,mBAAO,MAAM,EAAE,QAAQ,SAAS;AAAA,UACjC;AAAA,UACA,CAAC,OAAO,WAAW,GAAG;AAAA,QACvB;AAAA,MACD;AAAA,IACD,EAAE,CAAC;AACH,WAAO;AAAA,EACR;AACD;AACA,SAAS,eAAe,QAAQ,QAAQ;AACvC,MAAI,OAAO,UAAU,OAAQ,QAAO,QAAQ,OAAO,MAAM,QAAQ,OAAO,SAAS,OAAO,OAAO;AAC/F,SAAO;AACR;AACA,SAAS,SAAS,SAAS,OAAO;AACjC,QAAM,OAAO,QAAQ,KAAK,CAAC,WAAW;AAAA,IACrC,IAAI;AAAA,IACJ;AAAA,EACD,EAAE;AACF,MAAI,CAAC,MAAO,QAAO;AACnB,SAAO,QAAQ,KAAK,CAAC,MAAM,MAAM,KAAK,CAAC,WAAW;AAAA,IACjD,IAAI;AAAA,IACJ;AAAA,EACD,EAAE,CAAC,CAAC;AACL;AAEA,IAAM,aAAa,CAAC,MAAM,UAAU;AACnC,QAAM,UAAU,KAAK,UAAU,WAAW,uBAAuB,cAAc,OAAO,uBAAuB,WAAW;AACvH,UAAM,QAAQ,MAAM,KAAK,MAAM,QAAQ;AACvC,QAAI,CAAC,YAAY,KAAK,EAAG,OAAM,IAAI,UAAU,GAAG,MAAM,QAAQ,KAAK,CAAC,gCAAgC;AACpG,UAAM,cAAc,MAAM,gBAAgB;AAC1C,SAAK,OAAO,YAAY,aAAa;AAAA;AAAA,IAAwE,YAAY,iBAAiB,WAAW,aAAa,MAAM,CAAC,IAAI,qEAAqE;AAAA,EACnP,CAAC,CAAC;AACH;AAEA,IAAI;AACJ,SAAS,oBAAoB;AAC5B,MAAI,CAAC,QAAS,WAAU,IAAI,eAAe,EAAE,SAAS,CAAC,UAAU,aAAa;AAC7E,WAAO,OAAO,UAAU,UAAU,CAAC,kBAAkB,cAAc,CAAC;AAAA,EACrE,EAAE,CAAC;AACH,SAAO;AACR;AACA,SAAS,SAAS,UAAU,SAAS;AACpC,MAAI,OAAO,aAAa,YAAY;AACnC,QAAI,CAAC,QAAS,OAAM,IAAI,MAAM,yCAAyC,OAAO,QAAQ,EAAE;AAExF,WAAO;AAAA,EACR;AACA,MAAI;AACH,aAAS;AAAA,EACV,SAAS,GAAG;AACX,WAAO;AAAA,EACR;AACA,QAAM,IAAI,MAAM,gCAAgC;AACjD;AACA,SAAS,aAAaA,OAAM;AAC3B,SAAO;AAAA,IACN,UAAUA,MAAK,KAAK;AAAA,IACpB,MAAM,SAASA,KAAI,EAAE,MAAM,CAAC,EAAE,KAAK,KAAK;AAAA,IACxC,QAAQA,MAAK;AAAA,EACd;AACD;AACA,SAAS,iBAAiB,WAAW;AACpC,QAAM,OAAY,cAAK,KAAK,WAAW,OAAO;AAC9C,MAAI,CAAC,KAAM,OAAM,IAAI,MAAM,iGAAiG;AAC5H,SAAO;AACR;AACA,SAAS,QAAQ,KAAK;AACrB,QAAMA,QAAY,cAAK,KAAK,KAAK,aAAa;AAC9C,MAAI,CAACA,MAAM,OAAM,IAAI,MAAM,IAAI,iBAAiB,GAAG,CAAC,uCAAuC;AAC3F,MAAIA,MAAK,MAAO,OAAM,IAAI,gBAAgB,IAAI,iBAAiB,GAAG,CAAC,oCAAoC;AACvG,SAAOA;AACR;AACA,SAAS,kBAAkB,WAAW;AACrC,MAAS,cAAK,KAAK,WAAW,QAAQ,EAAG,OAAM,IAAI,MAAM,GAAG,iBAAiB,SAAS,CAAC,4BAA4B;AACpH;AACA,IAAM,iBAAiB,CAAC,MAAM,UAAU;AACvC,aAAW,OAAO,CAAC,iBAAiB,iBAAiB,EAAG,OAAM,UAAU,KAAK,UAAU,WAAW,KAAK,cAAc,OAAO,KAAK,SAAS,kBAAkB,MAAM;AACjK,WAAO,kBAAkB,oBAAoB;AAAA,MAC5C,WAAW;AAAA,MACX,UAAU,MAAM,KAAK,MAAM,QAAQ;AAAA,MACnC,GAAG,mBAAmB,kBAAkB,IAAI;AAAA,IAC7C,CAAC,GAAG,KAAK,KAAK,KAAK,MAAM,SAAS,CAAC;AAAA,EACpC,CAAC,CAAC;AACF,QAAM,UAAU,KAAK,UAAU,WAAW,uBAAuB,SAAS,UAAU,MAAM;AAEzF,UAAM,KAAK,MAAM,SAAS,qBAAqB;AAE/C,sBAAkB,IAAI;AACtB,UAAM,gBAAgB,wBAAwB;AAAA,MAC7C,WAAW;AAAA,MACX,UAAU,MAAM,KAAK,MAAM,QAAQ;AAAA,MACnC;AAAA,MACA;AAAA,IACD,CAAC,EAAE,KAAK,CAAC,WAAW,kBAAkB,QAAQ,KAAK,KAAK,KAAK,MAAM,SAAS,CAAC,CAAC;AAC9E,WAAO,kBAAkB,QAAQ,IAAI,GAAG,eAAe,uBAAuB,OAAO,MAAM,IAAI,GAAmB,oBAAI,MAAM,UAAU,GAAG,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,EAClK,CAAC;AACD,QAAM,UAAU,KAAK,UAAU,WAAW,yBAAyB,cAAc,OAAO,yBAAyB,SAAS,6BAA6B,4BAA4B,sBAAsB,MAAM;AAC9M,WAAO,kBAAkB,oBAAoB;AAAA,MAC5C,WAAW;AAAA,MACX,UAAU,MAAM,KAAK,MAAM,QAAQ;AAAA,MACnC,UAAU;AAAA,MACV,GAAG,yBAAyB,4BAA4B,sBAAsB,IAAI;AAAA,IACnF,CAAC,GAAG,KAAK,KAAK,KAAK,MAAM,SAAS,CAAC;AAAA,EACpC,CAAC,CAAC;AACF,QAAM,UAAU,KAAK,UAAU,WAAW,gCAAgC,cAAc,OAAO,gCAAgC,SAAS,kBAAkB,MAAM;AAC/J,sBAAkB,IAAI;AACtB,UAAM,WAAW,MAAM,KAAK,MAAM,QAAQ;AAC1C,UAAM,UAAU,MAAM,KAAK,MAAM,SAAS;AAC1C,WAAO,kBAAkB,oBAAoB;AAAA,MAC5C,WAAW;AAAA,MACX,UAAU,SAAS,UAAU,OAAO;AAAA,MACpC,GAAG,mBAAmB,kBAAkB,IAAI;AAAA,IAC7C,CAAC,GAAG,KAAK,KAAK,KAAK,MAAM,SAAS,CAAC;AAAA,EACpC,CAAC,CAAC;AACF,QAAM,UAAU,KAAK,UAAU,WAAW,sCAAsC,cAAc,OAAO,sCAAsC,SAAS,6BAA6B,sBAAsB,MAAM;AAC5M,sBAAkB,IAAI;AACtB,UAAM,WAAW,MAAM,KAAK,MAAM,QAAQ;AAC1C,UAAM,UAAU,MAAM,KAAK,MAAM,SAAS;AAC1C,WAAO,kBAAkB,oBAAoB;AAAA,MAC5C,WAAW;AAAA,MACX,UAAU,SAAS,UAAU,OAAO;AAAA,MACpC,UAAU;AAAA,MACV,GAAG,yBAAyB,QAAQ,sBAAsB,IAAI;AAAA,IAC/D,CAAC,GAAG,KAAK,KAAK,KAAK,MAAM,SAAS,CAAC;AAAA,EACpC,CAAC,CAAC;AACF,QAAM,UAAU,KAAK,QAAQ,yBAAyB,aAAa;AACpE;AAmCA,SAAS,mBAAmB,kBAAkB,MAAM;AACnD,MAAI,OAAO,qBAAqB,SAAU,QAAO,EAAE,MAAM,iBAAiB;AAC1E,SAAO;AAAA,IACN,YAAY;AAAA,IACZ;AAAA,EACD;AACD;AAEA,SAAS,yBAAyB,4BAA4B,sBAAsB,MAAM;AACzF,MAAI;AACJ,MAAI,OAAO,+BAA+B,UAAU;AACnD,qBAAiB,yBAAyB,0BAA0B;AACpE,WAAO;AAAA,MACN;AAAA,MACA,MAAM;AAAA,IACP;AAAA,EACD;AACA,MAAI,qBAAsB,kBAAiB,yBAAyB,oBAAoB;AACxF,SAAO;AAAA,IACN,YAAY;AAAA,IACZ;AAAA,IACA;AAAA,EACD;AACD;AACA,SAAS,oBAAoB,SAAS;AACrC,QAAM,EAAE,UAAU,IAAI;AACtB,oBAAkB,SAAS;AAC3B,QAAM,gBAAgB,iBAAiB,SAAS;AAChD,QAAMqC,QAAO,QAAQ,SAAS;AAC9B,SAAO,kBAAkB,EAAE,MAAM;AAAA,IAChC,UAAU,QAAQ;AAAA,IAClB,YAAY,QAAQ;AAAA,IACpB,SAAS,QAAQ;AAAA,IACjB,UAAU,QAAQ;AAAA,IAClB,gBAAgB,QAAQ;AAAA;AAAA,IAExB;AAAA;AAAA,IAEA,OAAY,cAAK,KAAK,WAAW,OAAO;AAAA,IACxC,GAAG,aAAaA,KAAI;AAAA,EACrB,CAAC;AACF;AACA,eAAe,wBAAwB,SAAS;AAC/C,QAAM,EAAE,UAAU,IAAI;AACtB,oBAAkB,SAAS;AAC3B,QAAM,YAAY,aAAa,QAAQ,SAAS,CAAC;AACjD,QAAM,gBAAgB,kBAAkB,EAAE,iBAAiB,UAAU,QAAQ;AAC7E,QAAM,kBAAkB,MAAM,cAAc,YAAY,eAAe,UAAU,UAAU,QAAQ,QAAQ;AAC3G,QAAM,qBAAqB,MAAM,cAAc,YAAY,iBAAiB,eAAe;AAC3F,SAAO,kBAAkB,EAAE,MAAM;AAAA,IAChC,UAAU,QAAQ;AAAA,IAClB,SAAS,QAAQ;AAAA,IACjB,aAAa;AAAA,MACZ,MAAM;AAAA,MACN,SAAS,sBAAsB;AAAA,IAChC;AAAA,IACA,GAAG;AAAA,EACJ,CAAC;AACF;AACA,SAAS,kBAAkB,QAAQ,eAAe;AACjD,MAAI,CAAC,OAAO,MAAM;AACjB,UAAM,gBAAgB,gBAAgB,GAAG,aAAa,OAAO,MAAM,OAAO,QAAQ;AAClF,UAAM,OAAO,OAAO,IAAI,MAAM,YAAY,GAAG;AAAA,MAC5C,QAAQ,OAAO;AAAA,MACf,UAAU,OAAO;AAAA,MACjB,aAAa,EAAE,QAAQ,eAAe,EAAE,OAAO,gBAAgB,OAAO;AAAA,IACvE,CAAC;AAAA,EACF;AACD;AA2HK,IAAI,UAAU;AACd,IAAI,cAAc;AAClB,IAAI,mBAAmB;AACvB,IAAI,cAAc;AAClB,IAAI,sBAAsB;AAC1B,IAAI,UAAU;AAEnB,SAAS,aAAaC,OAAM;AAC3B,QAAMC,WAAU,CAAC,OAAO,YAAY;AACnC,UAAM,EAAE,eAAe,IAAI,SAASA,OAAM;AAC1C,aAAS,EAAE,gBAAgB,iBAAiB,EAAE,GAAGA,OAAM;AACvD,UAAMC,UAAc,OAAO,OAAO,OAAO;AACzC,UAAMC,SAAQH,SAAQ,eAAe;AACrC,QAAIG;AAEJ,aAAOD,QAAO,SAASC,MAAK;AAAA,QACvB,QAAOD;AAAA,EACb;AACA,SAAO,OAAOD,SAAa,MAAM;AACjC,SAAO,OAAOA,SAAQ,WAAW,0BAA0B,CAAC;AAC5D,EAAAA,QAAO,WAAW,MAAM,SAASA,OAAM;AACvC,EAAAA,QAAO,WAAW,CAAC,UAAU,SAAS,OAAOA,OAAM;AAEnD,QAAM,cAAc,SAAS,WAAW,aAAa,CAAC,KAAK,CAAC;AAC5D,WAAS;AAAA;AAAA,IAER,GAAG;AAAA,IACH,gBAAgB;AAAA,IAChB,uBAAuB;AAAA,IACvB,4BAA4B;AAAA,IAC5B,0BAA0B;AAAA,IAC1B,kCAAkC;AAAA,IAClC,IAAI,WAAW;AACd,aAAO,eAAe,EAAE;AAAA,IACzB;AAAA,IACA,iBAAiBD,QAAOA,MAAK,gBAAgB,KAAK,YAAY;AAAA,EAC/D,GAAGC,OAAM;AACT,EAAAA,QAAO,SAAcC;AAErB,EAAAD,QAAO,SAAS,CAAC,aAAkB,OAAO,OAAOA,SAAQ,QAAQ;AACjE,EAAAA,QAAO,qBAAqB,CAAC,kBAAkB,yBAAyB,aAAa;AACrF,EAAAA,QAAO,OAAO,IAAI,SAAS;AAE1B,WAAOA,QAAO,GAAG,IAAI,EAAE,YAAY,EAAE,MAAM,KAAK,CAAC;AAAA,EAClD;AACA,EAAAA,QAAO,OAAO,iBAAiBA,OAAM;AACrC,EAAAA,QAAO,cAAc,CAAC,YAAY;AACjC,IAAKC,QAAO,KAAK,WAAW,UAAU,KAAK,OAAO,OAAO,GAAG,mBAAmB;AAAA,EAChF;AACA,WAAS,WAAW,UAAU;AAC7B,UAAM,WAAW,MAAsB,oBAAI,MAAM,uCAAuC,QAAQ,aAAaD,QAAO,SAAS,EAAE,cAAc,EAAE;AAC/I,QAAI,MAAM,kBAAmB,OAAM,kBAAkB,SAAS,GAAG,UAAU;AAC3E,IAAAA,QAAO,SAAS;AAAA,MACf,0BAA0B;AAAA,MAC1B,kCAAkC;AAAA,IACnC,CAAC;AAAA,EACF;AACA,WAAS,gBAAgB;AACxB,UAAM,QAAwB,oBAAI,MAAM,gDAAgD;AACxF,QAAI,MAAM,kBAAmB,OAAM,kBAAkB,OAAO,aAAa;AACzE,IAAAA,QAAO,SAAS;AAAA,MACf,uBAAuB;AAAA,MACvB,4BAA4B;AAAA,IAC7B,CAAC;AAAA,EACF;AACA,EAAK,cAAK,UAAUA,SAAQ,cAAc,UAAU;AACpD,EAAK,cAAK,UAAUA,SAAQ,iBAAiB,aAAa;AAC1D,EAAAA,QAAO,OAAO,cAAc;AAC5B,EAAAA,QAAO,OAAO,aAAa;AAC3B,SAAOA;AACR;AACA,IAAM,eAAe,aAAa;AAClC,OAAO,eAAe,YAAY,eAAe;AAAA,EAChD,OAAO;AAAA,EACP,UAAU;AAAA,EACV,cAAc;AACf,CAAC;AAYD,IAAMG,OAAM,WAAW,cAAc,WAAW,YAAY,IAAI,KAAK,WAAW,WAAW,IAAI,KAAK;;;ACz5PpG,IAAAC,sBAA6B;;;ACItB,SAAS,kCAAkC,eAA2E;AAC3H,WAAS,OAAO,YAAuC,CAAC,GAAqB;AAC3E,WAAO;AAAA,MACL,IAAI,OAAO,WAAW;AAAA,MACtB,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,MAAM;AAAA,MACN,WAAW;AAAA,MACX,MAAM;AAAA,MACN,MAAM;AAAA,MACN,WAAW;AAAA,MACX,UAAU;AAAA,MACV,eAAe;AAAA,MACf,eAAe;AAAA,MACf,GAAG;AAAA,IACL;AAAA,EACF;AACA,QAAM,QAAQ,MAAM,IAAI,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC;AAE5C,WAAS,0IAA4B,MAAM;AACzC,OAAG,yOAAgD,YAAY;AAC7D,YAAM,UAAU,MAAM,cAAc;AACpC,YAAM,QAAQ,OAAO;AACrB,YAAM,QAAQ,KAAK,OAAO,MAAM,CAAC;AACjC,mBAAO,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC,EAAE,QAAQ,KAAK;AACjD,mBAAO,CAAC,GAAI,MAAM,QAAQ,UAAU,MAAM,EAAE,CAAG,CAAC,EAAE,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC;AAAA,IACrE,CAAC;AAED,OAAG,2GAAgC,YAAY;AAC7C,YAAM,UAAU,MAAM,cAAc;AACpC,YAAM,KAAK,OAAO,WAAW;AAC7B,mBAAO,MAAM,QAAQ,IAAI,EAAE,CAAC,EAAE,cAAc;AAC5C,mBAAO,MAAM,QAAQ,UAAU,EAAE,CAAC,EAAE,cAAc;AAAA,IACpD,CAAC;AAED,OAAG,qXAAyE,YAAY;AACtF,YAAM,UAAU,MAAM,cAAc;AACpC,YAAM,QAAQ,OAAO;AACrB,YAAM,SAAS,MAAM;AACrB,YAAM,QAAQ,KAAK,OAAO,MAAM;AAChC,aAAO,CAAC,IAAI;AACZ,YAAM,OAAO;AACb,mBAAO,CAAC,GAAI,MAAM,QAAQ,UAAU,MAAM,EAAE,CAAG,CAAC,EAAE,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC;AACnE,oBAAQ,MAAM,QAAQ,IAAI,MAAM,EAAE,IAAI,IAAI,EAAE,KAAK,gDAAa;AAAA,IAChE,CAAC;AAED,OAAG,qZAA0F,YAAY;AACvG,YAAM,UAAU,MAAM,cAAc;AACpC,YAAM,QAAQ,OAAO;AACrB,YAAM,QAAQ,KAAK,OAAO,MAAM,CAAC;AACjC,YAAM,QAAQ,aAAa,MAAM,EAAE;AACnC,YAAM,QAAQ,aAAa,MAAM,EAAE;AACnC,oBAAQ,MAAM,QAAQ,IAAI,MAAM,EAAE,IAAI,QAAQ,EAAE,KAAK,IAAI;AACzD,YAAM,QAAQ,aAAa,OAAO,WAAW,CAAC;AAAA,IAChD,CAAC;AAED,OAAG,8UAA0E,YAAY;AACvF,YAAM,UAAU,MAAM,cAAc;AACpC,YAAM,QAAQ,OAAO;AACrB,YAAM,QAAQ,KAAK,OAAO,MAAM,CAAC;AACjC,YAAM,QAAQ,OAAO,MAAM,EAAE;AAC7B,mBAAO,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC,EAAE,cAAc;AAClD,mBAAO,MAAM,QAAQ,UAAU,MAAM,EAAE,CAAC,EAAE,cAAc;AACxD,YAAM,QAAQ,OAAO,MAAM,EAAE;AAC7B,YAAM,QAAQ,OAAO,OAAO,WAAW,CAAC;AAAA,IAC1C,CAAC;AAED,OAAG,ieAA+G,YAAY;AAC5H,YAAM,UAAU,MAAM,cAAc;AACpC,YAAM,OAAO,OAAO,EAAE,QAAQ,SAAS,CAAC;AACxC,YAAM,WAAW,OAAO,EAAE,QAAQ,SAAS,CAAC;AAC5C,YAAM,QAAQ,OAAO,EAAE,QAAQ,SAAS,CAAC;AACzC,iBAAW,QAAQ,CAAC,MAAM,UAAU,KAAK,EAAG,OAAM,QAAQ,KAAK,MAAM,MAAM,CAAC;AAC5E,YAAM,QAAQ,aAAa,SAAS,EAAE;AACtC,mBAAO,MAAM,QAAQ,gBAAgB,QAAQ,CAAC,EAAE,KAAK,CAAC;AACtD,iBAAW,QAAQ,CAAC,MAAM,QAAQ,GAAG;AACnC,qBAAO,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC,EAAE,cAAc;AACjD,qBAAO,MAAM,QAAQ,UAAU,KAAK,EAAE,CAAC,EAAE,cAAc;AAAA,MACzD;AACA,mBAAO,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC,EAAE,YAAY;AAChD,mBAAO,CAAC,GAAI,MAAM,QAAQ,UAAU,MAAM,EAAE,CAAG,CAAC,EAAE,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC;AACnE,mBAAO,MAAM,QAAQ,gBAAgB,QAAQ,CAAC,EAAE,KAAK,CAAC;AACtD,mBAAO,MAAM,QAAQ,gBAAgB,yDAAY,CAAC,EAAE,KAAK,CAAC;AAAA,IAC5D,CAAC;AAED,OAAG,8VAA0F,YAAY;AACvG,YAAM,UAAU,MAAM,cAAc;AACpC,YAAM,UAAU,OAAO,EAAE,WAAW,2BAA2B,CAAC;AAChE,YAAM,cAAc,OAAO,EAAE,WAAW,2BAA2B,CAAC;AACpE,YAAM,YAAY,OAAO,EAAE,WAAW,2BAA2B,CAAC;AAClE,iBAAW,QAAQ,CAAC,SAAS,aAAa,SAAS,EAAG,OAAM,QAAQ,KAAK,MAAM,MAAM,CAAC;AACtF,YAAM,QAAQ,aAAa,YAAY,EAAE;AACzC,mBAAO,MAAM,QAAQ,0BAA0B,oBAAI,KAAK,0BAA0B,CAAC,CAAC,EAAE,KAAK,CAAC;AAC5F,mBAAO,MAAM,QAAQ,IAAI,QAAQ,EAAE,CAAC,EAAE,cAAc;AACpD,mBAAO,MAAM,QAAQ,IAAI,YAAY,EAAE,CAAC,EAAE,YAAY;AACtD,mBAAO,MAAM,QAAQ,IAAI,UAAU,EAAE,CAAC,EAAE,YAAY;AAAA,IACtD,CAAC;AAED,OAAG,iYAA0F,YAAY;AACvG,YAAM,UAAU,MAAM,cAAc;AACpC,YAAM,QAAQ,KAAK,OAAO,EAAE,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC;AAChD,YAAM,QAAQ,KAAK,OAAO,EAAE,MAAM,GAAG,QAAQ,SAAS,CAAC,GAAG,MAAM,CAAC;AACjE,YAAM,QAAQ,KAAK,OAAO,EAAE,MAAM,KAAK,SAAS,QAAQ,CAAC,GAAG,MAAM,CAAC;AACnE,YAAM,OAAO,OAAO,EAAE,MAAM,IAAK,CAAC;AAClC,YAAM,QAAQ,KAAK,MAAM,MAAM,CAAC;AAChC,YAAM,QAAQ,aAAa,KAAK,EAAE;AAClC,mBAAO,MAAM,QAAQ,iBAAiB,MAAM,CAAC,EAAE,QAAQ,EAAE,OAAO,GAAG,OAAO,GAAG,CAAC;AAC9E,mBAAO,MAAM,QAAQ,iBAAiB,OAAO,CAAC,EAAE,QAAQ,EAAE,OAAO,GAAG,OAAO,IAAI,CAAC;AAChF,mBAAO,MAAM,QAAQ,iBAAiB,QAAQ,CAAC,EAAE,QAAQ,EAAE,OAAO,GAAG,OAAO,EAAE,CAAC;AAAA,IACjF,CAAC;AAED,OAAG,+bAAiG,YAAY;AAC9G,YAAM,UAAU,MAAM,cAAc;AACpC,iBAAW,MAAM,CAAC,oBAAoB,OAAO,IAAI,MAAM,IAAI,OAAO,GAAG,CAAC,GAAG;AACvE,cAAM,aAAO,QAAQ,KAAK,OAAO,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,QAAQ,QAAQ;AACpE,qBAAO,MAAM,QAAQ,IAAI,EAAE,CAAC,EAAE,cAAc;AAC5C,qBAAO,MAAM,QAAQ,UAAU,EAAE,CAAC,EAAE,cAAc;AAClD,cAAM,QAAQ,OAAO,EAAE;AACvB,cAAM,QAAQ,aAAa,EAAE;AAAA,MAC/B;AAAA,IACF,CAAC;AAED,OAAG,ybAAsF,YAAY;AACnG,YAAM,UAAU,MAAM,cAAc;AACpC,YAAM,EAAE,eAAe,OAAO,eAAe,YAAY,GAAG,MAAM,IAAI,OAAO,EAAE,MAAM,SAAS,WAAW,cAAc,iBAAiB,aAAa,MAAM,QAAQ,CAAC;AACpK,YAAM,QAAQ,KAAK,OAAO,MAAM,CAAC;AACjC,mBAAO,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC,EAAE,QAAQ,KAAK;AAAA,IACnD,CAAC;AAAA,EACH,CAAC;AACH;","names":["m","exports","fn","expectTypeOf","a","t","n","g","h","n","m","d","object","keys","config","printer","i","type","typeOf","b","g","h","t","v","a","functionName","printFunctionName","escapeRegex","plugin","plugins","object","plugins","ELEMENT_NODE","COMMENT_NODE","format","i","m","truncate","type","string","v","i","array","getType","k","resolve","i","array","getDefaultExportFromCjs","d","foundSubsequence","isCommon","type","v","clone","i","fn","resolve","i","relative","a","b","binarySearch","i","binarySearch","map","memo","isWindows","functionName","i","stack","map","found","i","n","diff","diffs","string","a","b","truncate","aIndex","bIndex","getType","AsymmetricMatcher","DOMCollection","DOMElement","Immutable","ReactElement","ReactTestComponent","PLUGINS","_","v","map","set","hasCommonDiff","object","fn","runner","suite","fn","fn","suite","d","n","i","keys","fn","context","chain","fn","suite","test","fn","stack","config","t","test","fn","suite","name","t","options","task","_","test","i","use","_test","optionsOrFn","format","m","runner","a","b","d","setTimeout","clearTimeout","waitUntil","resolve","type","annotation","clearTimeout","setTimeout","runner","fn","call","now","clearTimeout","setTimeout","fn","config","mockImplementation","object","assert","prototypeMock","prototypeState","prototypeConfig","inspect2","test","getConstructorName","_AssertionError","t","isHighSurrogate","string","i","array","map","set2","object","toString","inspect","keys","isPrimitive","_Assertion","fn","_PluginEvent","memo","_PluginAddChainableMethodEvent","a","b","isObject","n","should2","assert","test2","serialize","config","printer","test","plugin","DOMCollection","DOMElement","Immutable","ReactElement","ReactTestComponent","AsymmetricMatcher","PLUGINS","i","chars","intToChar","charToInt","i","_","t","n","b","C","naturalCompare","a","b","i","getDefaultExportFromCjs","testName","string","serialize","fn","y","printReceived","printExpected","matcherHint","equals","SPACE_SYMBOL","replaceTrailingSpaces","object","type","getType","hasKey","keys","IS_KEYED_SENTINEL","IS_SET_SENTINEL","IS_LIST_SENTINEL","IS_ORDERED_SENTINEL","IS_RECORD_SYMBOL","t","subset","expect","map","AsymmetricMatcher","_test","test","AssertionError","addMethod","n","m","equal","_","pass","message","actual","expected","meta","RECEIVED_COLOR","EXPECTED_COLOR","global","call","copyPrototypeMethods","every","functionName","sort","set","typeDetect","typeOf","now","toString","timers","resolve","setTimeout","clearTimeout","setInterval","clearInterval","config","delay","behavior","options","validateOptions","__VITEST_HELPER__","test","test","expect","assert","_test","now","import_expect_type"]}