npm - @warlock.js/ai - Versions diffs - 5.1.0 → 5.2.3 - Mend

@warlock.js/ai 5.1.0 → 5.2.3

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

Files changed (251) hide show

package/esm/node_modules/@vitest/spy/dist/index.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"index.mjs","names":[],"sources":["../../../../../../../../../../node_modules/@vitest/spy/dist/index.js"],"sourcesContent":["function isMockFunction(fn) {\n\treturn typeof fn === \"function\" && \"_isMockFunction\" in fn && fn._isMockFunction === true;\n}\nconst MOCK_RESTORE = 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 REGISTERED_MOCKS = new Set();\nconst MOCK_CONFIGS = new WeakMap();\nfunction createMockInstance(options = {}) {\n\tconst { originalImplementation, restore, mockImplementation, resetToMockImplementation, resetToMockName } = options;\n\tif (restore) {\n\t\tMOCK_RESTORE.add(restore);\n\t}\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) {\n\t\tconfig.mockName = mock.name || \"vi.fn()\";\n\t}\n\tMOCK_CONFIGS.set(mock, config);\n\tREGISTERED_MOCKS.add(mock);\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\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\treturn mock;\n\t};\n\tmock.mockImplementationOnce = function mockImplementationOnce(implementation) {\n\t\tconfig.onceMockImplementations.push(implementation);\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};\n\t\tconfig.mockImplementation = implementation;\n\t\tconfig.onceMockImplementations = [];\n\t\tconst returnValue = callback();\n\t\tif (typeof returnValue === \"object\" && typeof returnValue?.then === \"function\") {\n\t\t\treturn returnValue.then(() => {\n\t\t\t\treset();\n\t\t\t\treturn mock;\n\t\t\t});\n\t\t} else {\n\t\t\treset();\n\t\t}\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) {\n\t\t\t\tthrowConstructorError(\"mockReturnValue\");\n\t\t\t}\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) {\n\t\t\t\tthrowConstructorError(\"mockReturnValueOnce\");\n\t\t\t}\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) {\n\t\t\t\tthrowConstructorError(\"mockResolvedValue\");\n\t\t\t}\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) {\n\t\t\t\tthrowConstructorError(\"mockResolvedValueOnce\");\n\t\t\t}\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) {\n\t\t\t\tthrowConstructorError(\"mockRejectedValue\");\n\t\t\t}\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) {\n\t\t\t\tthrowConstructorError(\"mockRejectedValueOnce\");\n\t\t\t}\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\treturn mock;\n\t};\n\tmock.mockReset = function mockReset() {\n\t\tmock.mockClear();\n\t\tconfig.mockImplementation = resetToMockImplementation ? mockImplementation : undefined;\n\t\tconfig.mockName = resetToMockName ? mock.name || \"vi.fn()\" : \"vi.fn()\";\n\t\tconfig.onceMockImplementations = [];\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\") {\n\t\t\tconfig.mockName = name;\n\t\t}\n\t\treturn mock;\n\t};\n\tmock.getMockName = function getMockName() {\n\t\treturn config.mockName || \"vi.fn()\";\n\t};\n\tif (Symbol.dispose) {\n\t\tmock[Symbol.dispose] = () => mock.mockRestore();\n\t}\n\tif (mockImplementation) {\n\t\tmock.mockImplementation(mockImplementation);\n\t}\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)) {\n\t\treturn originalImplementation;\n\t}\n\treturn createMockInstance({\n\t\tmockImplementation: originalImplementation,\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\") {\n\t\t\toriginal = object[key];\n\t\t}\n\t} else if (accessType !== \"value\") {\n\t\toriginal = () => object[key];\n\t} else {\n\t\toriginal = object[key];\n\t}\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)) {\n\t\treturn originalImplementation;\n\t}\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\") {\n\t\t\tdelete desc.writable;\n\t\t}\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) {\n\t\t\tReflect.deleteProperty(object, key);\n\t\t} else if (originalDescriptor && !original) {\n\t\t\tObject.defineProperty(object, key, originalDescriptor);\n\t\t} else {\n\t\t\treassign(original);\n\t\t}\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\"))) {\n\t\t\tthrow new TypeError(`Cannot spy on export \"${String(key)}\". Module namespace is not configurable in ESM. See: https://vitest.dev/guide/browser/#limitations`, { cause: error });\n\t\t}\n\t\tthrow error;\n\t}\n\treturn mock;\n}\nfunction getDescriptor(obj, method) {\n\tconst objDescriptor = Object.getOwnPropertyDescriptor(obj, method);\n\tif (objDescriptor) {\n\t\treturn [obj, objDescriptor];\n\t}\n\tlet currentProto = Object.getPrototypeOf(obj);\n\twhile (currentProto !== null) {\n\t\tconst descriptor = Object.getOwnPropertyDescriptor(currentProto, method);\n\t\tif (descriptor) {\n\t\t\treturn [currentProto, descriptor];\n\t\t}\n\t\tcurrentProto = Object.getPrototypeOf(currentProto);\n\t}\n}\nfunction assert(condition, message) {\n\tif (!condition) {\n\t\tthrow new Error(message);\n\t}\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 namedObject = { [name]: (function(...args) {\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: undefined\n\t\t};\n\t\tconst settledResult = {\n\t\t\ttype: \"incomplete\",\n\t\t\tvalue: undefined\n\t\t};\n\t\tregisterResult(result, state, prototypeState);\n\t\tregisterSettledResult(settledResult, state, prototypeState);\n\t\tconst context = new.target ? undefined : 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 || function() {};\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\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]) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tconst isMock = isMockFunction(prototypeMock);\n\t\t\t\t\tconst prototypeState = isMock ? prototypeMock.mock : undefined;\n\t\t\t\t\tconst prototypeConfig = isMock ? MOCK_CONFIGS.get(prototypeMock) : undefined;\n\t\t\t\t\treturnValue[prop] = createMockInstance({\n\t\t\t\t\t\toriginalImplementation: keepMembersImplementation ? prototypeConfig?.mockOriginal : undefined,\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 {\n\t\t\t\treturnValue = implementation.apply(this, args);\n\t\t\t}\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\")) {\n\t\t\t\tconsole.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\t}\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) {\n\t\t\t\t\t\tprototypeState.contexts[contextPrototypeIndex - 1] = returnValue;\n\t\t\t\t\t}\n\t\t\t\t\tif (instancePrototypeIndex != null && prototypeState) {\n\t\t\t\t\t\tprototypeState.instances[instancePrototypeIndex - 1] = returnValue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (returnValue instanceof Promise) {\n\t\t\t\t\treturnValue.then((settledValue) => {\n\t\t\t\t\t\tsettledResult.type = \"fulfilled\";\n\t\t\t\t\t\tsettledResult.value = settledValue;\n\t\t\t\t\t}, (rejectedValue) => {\n\t\t\t\t\t\tsettledResult.type = \"rejected\";\n\t\t\t\t\t\tsettledResult.value = rejectedValue;\n\t\t\t\t\t});\n\t\t\t\t} else {\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) {\n\t\tcopyOriginalStaticProperties(mock, copyPropertiesFrom);\n\t}\n\treturn mock;\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\tconst instanceIndex = state.instances.push(instance);\n\tconst instancePrototypeIndex = prototypeState?.instances.push(instance);\n\treturn [instanceIndex, instancePrototypeIndex];\n}\nfunction registerContext(context, state, prototypeState) {\n\tconst contextIndex = state.contexts.push(context);\n\tconst contextPrototypeIndex = prototypeState?.contexts.push(context);\n\treturn [contextIndex, contextPrototypeIndex];\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\tconst mockDescriptor = getDescriptor(mock, key);\n\t\tif (mockDescriptor) {\n\t\t\tcontinue;\n\t\t}\n\t\tObject.defineProperty(mock, key, descriptor);\n\t}\n}\nconst ignoreProperties = 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 = 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)) {\n\t\t\t\tcontinue;\n\t\t\t}\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: undefined,\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) {\n\t\trestore();\n\t}\n\tMOCK_RESTORE.clear();\n}\nfunction clearAllMocks() {\n\tREGISTERED_MOCKS.forEach((mock) => mock.mockClear());\n}\nfunction resetAllMocks() {\n\tREGISTERED_MOCKS.forEach((mock) => mock.mockReset());\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\nexport { clearAllMocks, createMockInstance, fn, isMockFunction, resetAllMocks, restoreAllMocks, spyOn };\n"],"x_google_ignoreList":[0],"mappings":";AAAA,SAAS,eAAe,IAAI;CAC3B,OAAO,OAAO,OAAO,cAAc,qBAAqB,MAAM,GAAG,oBAAoB;AACtF;AACA,MAAM,+BAAe,IAAI,IAAI;AAI7B,MAAM,mCAAmB,IAAI,IAAI;AACjC,MAAM,+BAAe,IAAI,QAAQ;AACjC,SAAS,mBAAmB,UAAU,CAAC,GAAG;CACzC,MAAM,EAAE,wBAAwB,SAAS,oBAAoB,2BAA2B,oBAAoB;CAC5G,IAAI,SACH,aAAa,IAAI,OAAO;CAEzB,MAAM,SAAS,iBAAiB,sBAAsB;CACtD,MAAM,QAAQ,gBAAgB;CAC9B,MAAM,OAAO,WAAW;EACvB;EACA;EACA,GAAG;CACJ,CAAC;CACD,MAAM,cAAc,sBAAsB,uBAAsB,EAAG,UAAU;CAC7E,OAAO,eAAe,MAAM,UAAU;EACrC,UAAU;EACV,YAAY;EACZ,OAAO;EACP,cAAc;CACf,CAAC;CAID,IAAI,iBACH,OAAO,WAAW,KAAK,QAAQ;CAEhC,aAAa,IAAI,MAAM,MAAM;CAC7B,iBAAiB,IAAI,IAAI;CACzB,KAAK,kBAAkB;CACvB,KAAK,8BAA8B;EAGlC,OAAO,OAAO,wBAAwB,MAAM,OAAO;CACpD;CACA,OAAO,eAAe,MAAM,QAAQ;EACnC,cAAc;EACd,YAAY;EACZ,UAAU;EACV,OAAO;CACR,CAAC;CACD,KAAK,qBAAqB,SAAS,mBAAmB,gBAAgB;EACrE,OAAO,qBAAqB;EAC5B,OAAO;CACR;CACA,KAAK,yBAAyB,SAAS,uBAAuB,gBAAgB;EAC7E,OAAO,wBAAwB,KAAK,cAAc;EAClD,OAAO;CACR;CACA,KAAK,qBAAqB,SAAS,mBAAmB,gBAAgB,UAAU;EAC/E,MAAM,yBAAyB,OAAO;EACtC,MAAM,8BAA8B,OAAO;EAC3C,MAAM,cAAc;GACnB,OAAO,qBAAqB;GAC5B,OAAO,0BAA0B;EAClC;EACA,OAAO,qBAAqB;EAC5B,OAAO,0BAA0B,CAAC;EAClC,MAAM,cAAc,SAAS;EAC7B,IAAI,OAAO,gBAAgB,YAAY,OAAO,aAAa,SAAS,YACnE,OAAO,YAAY,WAAW;GAC7B,MAAM;GACN,OAAO;EACR,CAAC;OAED,MAAM;EAEP,OAAO;CACR;CACA,KAAK,iBAAiB,SAAS,iBAAiB;EAC/C,OAAO,KAAK,mBAAmB,WAAW;GACzC,OAAO;EACR,CAAC;CACF;CACA,KAAK,kBAAkB,SAAS,gBAAgB,OAAO;EACtD,OAAO,KAAK,mBAAmB,WAAW;GACzC,IAAI,IAAI,QACP,sBAAsB,iBAAiB;GAExC,OAAO;EACR,CAAC;CACF;CACA,KAAK,sBAAsB,SAAS,oBAAoB,OAAO;EAC9D,OAAO,KAAK,uBAAuB,WAAW;GAC7C,IAAI,IAAI,QACP,sBAAsB,qBAAqB;GAE5C,OAAO;EACR,CAAC;CACF;CACA,KAAK,YAAY,SAAS,UAAU,OAAO;EAE1C,OAAO,KAAK,mBAAmB,WAAW;GACzC,MAAM;EACP,CAAC;CACF;CACA,KAAK,gBAAgB,SAAS,cAAc,OAAO;EAElD,OAAO,KAAK,uBAAuB,WAAW;GAC7C,MAAM;EACP,CAAC;CACF;CACA,KAAK,oBAAoB,SAAS,kBAAkB,OAAO;EAC1D,OAAO,KAAK,mBAAmB,WAAW;GACzC,IAAI,IAAI,QACP,sBAAsB,mBAAmB;GAE1C,OAAO,QAAQ,QAAQ,KAAK;EAC7B,CAAC;CACF;CACA,KAAK,wBAAwB,SAAS,sBAAsB,OAAO;EAClE,OAAO,KAAK,uBAAuB,WAAW;GAC7C,IAAI,IAAI,QACP,sBAAsB,uBAAuB;GAE9C,OAAO,QAAQ,QAAQ,KAAK;EAC7B,CAAC;CACF;CACA,KAAK,oBAAoB,SAAS,kBAAkB,OAAO;EAC1D,OAAO,KAAK,mBAAmB,WAAW;GACzC,IAAI,IAAI,QACP,sBAAsB,mBAAmB;GAE1C,OAAO,QAAQ,OAAO,KAAK;EAC5B,CAAC;CACF;CACA,KAAK,wBAAwB,SAAS,sBAAsB,OAAO;EAClE,OAAO,KAAK,uBAAuB,WAAW;GAC7C,IAAI,IAAI,QACP,sBAAsB,uBAAuB;GAE9C,OAAO,QAAQ,OAAO,KAAK;EAC5B,CAAC;CACF;CACA,KAAK,YAAY,SAAS,YAAY;EACrC,MAAM,QAAQ,CAAC;EACf,MAAM,WAAW,CAAC;EAClB,MAAM,YAAY,CAAC;EACnB,MAAM,sBAAsB,CAAC;EAC7B,MAAM,UAAU,CAAC;EACjB,MAAM,iBAAiB,CAAC;EACxB,OAAO;CACR;CACA,KAAK,YAAY,SAAS,YAAY;EACrC,KAAK,UAAU;EACf,OAAO,qBAAqB,4BAA4B,qBAAqB;EAC7E,OAAO,WAAW,kBAAkB,KAAK,QAAQ,YAAY;EAC7D,OAAO,0BAA0B,CAAC;EAClC,OAAO;CACR;CACA,KAAK,cAAc,SAAS,cAAc;EACzC,KAAK,UAAU;EACf,OAAO,UAAU;CAClB;CACA,KAAK,WAAW,SAAS,SAAS,MAAM;EACvC,IAAI,OAAO,SAAS,UACnB,OAAO,WAAW;EAEnB,OAAO;CACR;CACA,KAAK,cAAc,SAAS,cAAc;EACzC,OAAO,OAAO,YAAY;CAC3B;CACA,IAAI,OAAO,SACV,KAAK,OAAO,iBAAiB,KAAK,YAAY;CAE/C,IAAI,oBACH,KAAK,mBAAmB,kBAAkB;CAE3C,OAAO;AACR;AACA,SAAS,GAAG,wBAAwB;CAGnC,IAAI,0BAA0B,QAAQ,eAAe,sBAAsB,GAC1E,OAAO;CAER,OAAO,mBAAmB;EACzB,oBAAoB;EACpB,2BAA2B;CAC5B,CAAC;AACF;AACA,SAAS,MAAM,QAAQ,KAAK,UAAU;CACrC,OAAO,UAAU,MAAM,mGAAmG;CAC1H,OAAO,OAAO,WAAW,YAAY,OAAO,WAAW,YAAY,yCAAyC;CAC5G,MAAM,CAAC,0BAA0B,sBAAsB,cAAc,QAAQ,GAAG,KAAK,CAAC;CACtF,OAAO,sBAAsB,OAAO,QAAQ,iBAAiB,OAAO,GAAG,EAAE,0BAA0B,OAAO,OAAO,EAAE;CACnH,IAAI,aAAa,YAAY;CAC7B,IAAI,MAAM;CAEV,IAAI,eAAe,WAAW,sBAAsB,mBAAmB,SAAS,QAAQ,mBAAmB,KAAK;EAC/G,aAAa;EACb,MAAM;CACP;CACA,IAAI;CACJ,IAAI,oBAAoB;EACvB,WAAW,mBAAmB;EAI9B,IAAI,YAAY,QAAQ,eAAe,SACtC,WAAW,OAAO;CAEpB,OAAO,IAAI,eAAe,SACzB,iBAAiB,OAAO;MAExB,WAAW,OAAO;CAEnB,MAAM,yBAAyB,OAAO,WAAW,SAAS,IAAI;CAC9D,MAAM,eAAe,OAAO;CAC5B,OAEC,iBAAiB,cAAc,eAAe,WAAW,YAAY,MACrE,mDAAmD,aAAa,EACjE;CACA,IAAI,eAAe,sBAAsB,GACxC,OAAO;CAER,MAAM,YAAY,OAAO;EACxB,MAAM,EAAE,OAAO,GAAG,SAAS,sBAAsB;GAChD,cAAc;GACd,UAAU;EACX;EACA,IAAI,eAAe,SAClB,OAAO,KAAK;EAEb,KAAK,cAAc;EACnB,OAAO,eAAe,QAAQ,KAAK,IAAI;CACxC;CACA,MAAM,gBAAgB;EAGrB,IAAI,6BAA6B,QAChC,QAAQ,eAAe,QAAQ,GAAG;OAC5B,IAAI,sBAAsB,CAAC,UACjC,OAAO,eAAe,QAAQ,KAAK,kBAAkB;OAErD,SAAS,QAAQ;CAEnB;CACA,MAAM,OAAO,mBAAmB;EAC/B;EACA;EACA,iBAAiB;CAClB,CAAC;CACD,IAAI;EACH,SAAS,YAAY,OAAO,IAAI;CACjC,SAAS,OAAO;EACf,IAAI,iBAAiB,aAAa,OAAO,eAAe,OAAO,OAAO,iBAAiB,aAAa,MAAM,QAAQ,SAAS,0BAA0B,KAAK,MAAM,QAAQ,SAAS,iCAAiC,KAAK,MAAM,QAAQ,SAAS,0CAA0C,IACvR,MAAM,IAAI,UAAU,yBAAyB,OAAO,GAAG,EAAE,qGAAqG,EAAE,OAAO,MAAM,CAAC;EAE/K,MAAM;CACP;CACA,OAAO;AACR;AACA,SAAS,cAAc,KAAK,QAAQ;CACnC,MAAM,gBAAgB,OAAO,yBAAyB,KAAK,MAAM;CACjE,IAAI,eACH,OAAO,CAAC,KAAK,aAAa;CAE3B,IAAI,eAAe,OAAO,eAAe,GAAG;CAC5C,OAAO,iBAAiB,MAAM;EAC7B,MAAM,aAAa,OAAO,yBAAyB,cAAc,MAAM;EACvE,IAAI,YACH,OAAO,CAAC,cAAc,UAAU;EAEjC,eAAe,OAAO,eAAe,YAAY;CAClD;AACD;AACA,SAAS,OAAO,WAAW,SAAS;CACnC,IAAI,CAAC,WACJ,MAAM,IAAI,MAAM,OAAO;AAEzB;AACA,IAAI,wBAAwB;AAC5B,SAAS,WAAW,EAAE,OAAO,QAAQ,MAAM,UAAU,gBAAgB,iBAAiB,2BAA2B,oBAAoB,mBAAmB,CAAC,KAAK;CAC7J,MAAM,WAAW,OAAO;CACxB,MAAM,iBAAiB;CACvB,MAAM,OAAO,YAAY,UAAU,QAAQ;CAC3C,MAAM,cAAc,EAAE,CAAC,QAAQ,SAAS,GAAG,MAAM;EAChD,cAAc,MAAM,OAAO,cAAc;EACzC,wBAAwB,yBAAyB,OAAO,cAAc;EACtE,MAAM,SAAS;GACd,MAAM;GACN,OAAO;EACR;EACA,MAAM,gBAAgB;GACrB,MAAM;GACN,OAAO;EACR;EACA,eAAe,QAAQ,OAAO,cAAc;EAC5C,sBAAsB,eAAe,OAAO,cAAc;EAC1D,MAAM,UAAU,IAAI,SAAS,SAAY;EACzC,MAAM,CAAC,eAAe,0BAA0B,iBAAiB,SAAS,OAAO,cAAc;EAC/F,MAAM,CAAC,cAAc,yBAAyB,gBAAgB,SAAS,OAAO,cAAc;EAC5F,MAAM,iBAAiB,OAAO,wBAAwB,MAAM,KAAK,OAAO,sBAAsB,iBAAiB,wBAAwB,MAAM,KAAK,iBAAiB,sBAAsB,YAAY,WAAW,CAAC;EACjN,IAAI;EACJ,IAAI;EACJ,IAAI,WAAW;EACf,IAAI;GACH,IAAI,IAAI,QAAQ;IACf,cAAc,QAAQ,UAAU,gBAAgB,MAAM,IAAI,MAAM;IAKhE,KAAK,MAAM,QAAQ,kBAAkB;KACpC,MAAM,gBAAgB,YAAY;KAGlC,IAAI,kBAAkB,KAAK,UAAU,OACpC;KAED,MAAM,SAAS,eAAe,aAAa;KAC3C,MAAM,iBAAiB,SAAS,cAAc,OAAO;KACrD,MAAM,kBAAkB,SAAS,aAAa,IAAI,aAAa,IAAI;KACnE,YAAY,QAAQ,mBAAmB;MACtC,wBAAwB,4BAA4B,iBAAiB,eAAe;MACpF;MACA;MACA;KACD,CAAC;IACF;GACD,OACC,cAAc,eAAe,MAAM,MAAM,IAAI;EAE/C,SAAS,OAAO;GACf,cAAc;GACd,WAAW;GACX,IAAI,iBAAiB,aAAa,MAAM,QAAQ,SAAS,sBAAsB,GAC9E,QAAQ,KAAK,gBAAgB,YAAY,KAAK,CAAC,YAAY,EAAE,oHAAoH;GAElL,MAAM;EACP,UAAU;GACT,IAAI,UAAU;IACb,OAAO,OAAO;IACd,OAAO,QAAQ;IACf,cAAc,OAAO;IACrB,cAAc,QAAQ;GACvB,OAAO;IACN,OAAO,OAAO;IACd,OAAO,QAAQ;IACf,IAAI,IAAI,QAAQ;KACf,MAAM,SAAS,eAAe,KAAK;KACnC,MAAM,UAAU,gBAAgB,KAAK;KACrC,IAAI,yBAAyB,QAAQ,gBACpC,eAAe,SAAS,wBAAwB,KAAK;KAEtD,IAAI,0BAA0B,QAAQ,gBACrC,eAAe,UAAU,yBAAyB,KAAK;IAEzD;IACA,IAAI,uBAAuB,SAC1B,YAAY,MAAM,iBAAiB;KAClC,cAAc,OAAO;KACrB,cAAc,QAAQ;IACvB,IAAI,kBAAkB;KACrB,cAAc,OAAO;KACrB,cAAc,QAAQ;IACvB,CAAC;SACK;KACN,cAAc,OAAO;KACrB,cAAc,QAAQ;IACvB;GACD;EACD;EACA,OAAO;CACR,GAAG;CACH,MAAM,OAAO,YAAY;CACzB,MAAM,qBAAqB,YAAY;CACvC,IAAI,oBACH,6BAA6B,MAAM,kBAAkB;CAEtD,OAAO;AACR;AACA,SAAS,cAAc,MAAM,OAAO,gBAAgB;CACnD,MAAM,MAAM,KAAK,IAAI;CACrB,gBAAgB,MAAM,KAAK,IAAI;AAChC;AACA,SAAS,wBAAwB,OAAO,OAAO,gBAAgB;CAC9D,MAAM,oBAAoB,KAAK,KAAK;CACpC,gBAAgB,oBAAoB,KAAK,KAAK;AAC/C;AACA,SAAS,eAAe,QAAQ,OAAO,gBAAgB;CACtD,MAAM,QAAQ,KAAK,MAAM;CACzB,gBAAgB,QAAQ,KAAK,MAAM;AACpC;AACA,SAAS,sBAAsB,QAAQ,OAAO,gBAAgB;CAC7D,MAAM,eAAe,KAAK,MAAM;CAChC,gBAAgB,eAAe,KAAK,MAAM;AAC3C;AACA,SAAS,iBAAiB,UAAU,OAAO,gBAAgB;CAG1D,OAAO,CAFe,MAAM,UAAU,KAAK,QAEvB,GADW,gBAAgB,UAAU,KAAK,QAAQ,CACzB;AAC9C;AACA,SAAS,gBAAgB,SAAS,OAAO,gBAAgB;CAGxD,OAAO,CAFc,MAAM,SAAS,KAAK,OAEtB,GADW,gBAAgB,SAAS,KAAK,OAAO,CACxB;AAC5C;AACA,SAAS,6BAA6B,MAAM,UAAU;CACrD,MAAM,EAAE,YAAY,gBAAgB,iBAAiB,QAAQ;CAC7D,KAAK,MAAM,OAAO,YAAY;EAC7B,MAAM,aAAa,YAAY;EAE/B,IADuB,cAAc,MAAM,GAC1B,GAChB;EAED,OAAO,eAAe,MAAM,KAAK,UAAU;CAC5C;AACD;AACA,MAAM,mBAAmB,IAAI,IAAI;CAChC;CACA;CACA;CACA,OAAO,IAAI,8BAA8B;AAC1C,CAAC;AACD,SAAS,iBAAiB,UAAU;CACnC,MAAM,6BAAa,IAAI,IAAI;CAC3B,MAAM,cAAc,CAAC;CACrB,OAAO,YAAY,aAAa,OAAO,aAAa,aAAa,SAAS,WAAW;EACpF,MAAM,gBAAgB,CAAC,GAAG,OAAO,oBAAoB,QAAQ,GAAG,GAAG,OAAO,sBAAsB,QAAQ,CAAC;EACzG,KAAK,MAAM,QAAQ,eAAe;GACjC,IAAI,YAAY,SAAS,iBAAiB,IAAI,IAAI,GACjD;GAED,WAAW,IAAI,IAAI;GACnB,YAAY,QAAQ,OAAO,yBAAyB,UAAU,IAAI;EACnE;EACA,WAAW,OAAO,eAAe,QAAQ;CAC1C;CACA,OAAO;EACN;EACA;CACD;AACD;AACA,SAAS,iBAAiB,UAAU;CACnC,OAAO;EACN,oBAAoB;EACpB,cAAc;EACd,UAAU;EACV,yBAAyB,CAAC;CAC3B;AACD;AACA,SAAS,kBAAkB;CAC1B,MAAM,QAAQ;EACb,OAAO,CAAC;EACR,UAAU,CAAC;EACX,WAAW,CAAC;EACZ,qBAAqB,CAAC;EACtB,gBAAgB,CAAC;EACjB,SAAS,CAAC;EACV,IAAI,WAAW;GACd,OAAO,MAAM,MAAM,GAAG,EAAE;EACzB;CACD;CACA,OAAO;AACR;AACA,SAAS,kBAAkB;CAC1B,KAAK,MAAM,WAAW,cACrB,QAAQ;CAET,aAAa,MAAM;AACpB;AACA,SAAS,gBAAgB;CACxB,iBAAiB,SAAS,SAAS,KAAK,UAAU,CAAC;AACpD;AACA,SAAS,gBAAgB;CACxB,iBAAiB,SAAS,SAAS,KAAK,UAAU,CAAC;AACpD;AACA,SAAS,sBAAsB,WAAW;CACzC,MAAM,IAAI,UAAU,gBAAgB,UAAU,8JAA8J;AAC7M"}

package/esm/node_modules/@vitest/utils/dist/chunk-pathe.M-eThtNZ.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"chunk-pathe.M-eThtNZ.mjs","names":[],"sources":["../../../../../../../../../../node_modules/@vitest/utils/dist/chunk-pathe.M-eThtNZ.js"],"sourcesContent":["const _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 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 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};\n\nexport { dirname as d, join as j, resolve as r };\n"],"x_google_ignoreList":[0],"mappings":";AAAA,MAAM,yBAAyB;AAC/B,SAAS,qBAAqB,QAAQ,IAAI;CACxC,IAAI,CAAC,OACH,OAAO;CAET,OAAO,MAAM,QAAQ,OAAO,GAAG,CAAC,CAAC,QAAQ,yBAAyB,MAAM,EAAE,YAAY,CAAC;AACzF;AAGA,MAAM,kBAAkB;AAoDxB,SAAS,MAAM;CACb,IAAI,OAAO,YAAY,eAAe,OAAO,QAAQ,QAAQ,YAC3D,OAAO,QAAQ,IAAI,CAAC,CAAC,QAAQ,OAAO,GAAG;CAEzC,OAAO;AACT;AACA,MAAM,UAAU,SAAS,GAAG,YAAY;CACtC,aAAa,WAAW,KAAK,aAAa,qBAAqB,QAAQ,CAAC;CACxE,IAAI,eAAe;CACnB,IAAI,mBAAmB;CACvB,KAAK,IAAI,QAAQ,WAAW,SAAS,GAAG,SAAS,MAAM,CAAC,kBAAkB,SAAS;EACjF,MAAM,OAAO,SAAS,IAAI,WAAW,SAAS,IAAI;EAClD,IAAI,CAAC,QAAQ,KAAK,WAAW,GAC3B;EAEF,eAAe,GAAG,KAAK,GAAG;EAC1B,mBAAmB,WAAW,IAAI;CACpC;CACA,eAAe,gBAAgB,cAAc,CAAC,gBAAgB;CAC9D,IAAI,oBAAoB,CAAC,WAAW,YAAY,GAC9C,OAAO,IAAI;CAEb,OAAO,aAAa,SAAS,IAAI,eAAe;AAClD;AACA,SAAS,gBAAgB,MAAM,gBAAgB;CAC7C,IAAI,MAAM;CACV,IAAI,oBAAoB;CACxB,IAAI,YAAY;CAChB,IAAI,OAAO;CACX,IAAI,OAAO;CACX,KAAK,IAAI,QAAQ,GAAG,SAAS,KAAK,QAAQ,EAAE,OAAO;EACjD,IAAI,QAAQ,KAAK,QACf,OAAO,KAAK;OACP,IAAI,SAAS,KAClB;OAEA,OAAO;EAET,IAAI,SAAS,KAAK;GAChB,IAAI,cAAc,QAAQ,KAAK,SAAS;QAAU,IAAI,SAAS,GAAG;IAChE,IAAI,IAAI,SAAS,KAAK,sBAAsB,KAAK,IAAI,IAAI,SAAS,OAAO,OAAO,IAAI,IAAI,SAAS,OAAO,KACtG;SAAI,IAAI,SAAS,GAAG;MAClB,MAAM,iBAAiB,IAAI,YAAY,GAAG;MAC1C,IAAI,mBAAmB,IAAI;OACzB,MAAM;OACN,oBAAoB;MACtB,OAAO;OACL,MAAM,IAAI,MAAM,GAAG,cAAc;OACjC,oBAAoB,IAAI,SAAS,IAAI,IAAI,YAAY,GAAG;MAC1D;MACA,YAAY;MACZ,OAAO;MACP;KACF,OAAO,IAAI,IAAI,SAAS,GAAG;MACzB,MAAM;MACN,oBAAoB;MACpB,YAAY;MACZ,OAAO;MACP;KACF;;IAEF,IAAI,gBAAgB;KAClB,OAAO,IAAI,SAAS,IAAI,QAAQ;KAChC,oBAAoB;IACtB;GACF,OAAO;IACL,IAAI,IAAI,SAAS,GACf,OAAO,IAAI,KAAK,MAAM,YAAY,GAAG,KAAK;SAE1C,MAAM,KAAK,MAAM,YAAY,GAAG,KAAK;IAEvC,oBAAoB,QAAQ,YAAY;GAC1C;GACA,YAAY;GACZ,OAAO;EACT,OAAO,IAAI,SAAS,OAAO,SAAS,IAClC,EAAE;OAEF,OAAO;CAEX;CACA,OAAO;AACT;AACA,MAAM,aAAa,SAAS,GAAG;CAC7B,OAAO,gBAAgB,KAAK,CAAC;AAC/B"}

package/esm/node_modules/@vitest/utils/dist/diff.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"diff.mjs","names":["c"],"sources":["../../../../../../../../../../node_modules/@vitest/utils/dist/diff.js"],"sourcesContent":["import { plugins, format } from '@vitest/pretty-format';\nimport c from 'tinyrainbow';\nimport { stringify } from './display.js';\nimport { deepClone, getOwnProperties, getType as getType$1 } from './helpers.js';\nimport './constants.js';\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)) {\n\t\treturn 0;\n\t}\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 {\n\t\t\tpointermax = pointermid;\n\t\t}\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)) {\n\t\treturn 0;\n\t}\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 {\n\t\t\tpointermax = pointermid;\n\t\t}\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) {\n\t\treturn 0;\n\t}\n\t// Truncate the longer string.\n\tif (text1_length > text2_length) {\n\t\ttext1 = text1.substring(text1_length - text2_length);\n\t} else if (text1_length < text2_length) {\n\t\ttext2 = text2.substring(0, text1_length);\n\t}\n\tconst text_length = Math.min(text1_length, text2_length);\n\t// Quick check for the worst case.\n\tif (text1 === text2) {\n\t\treturn text_length;\n\t}\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) {\n\t\t\treturn best;\n\t\t}\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) {\n\t\t\t\tlength_insertions2 += diffs[pointer][1].length;\n\t\t\t} else {\n\t\t\t\tlength_deletions2 += diffs[pointer][1].length;\n\t\t\t}\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) {\n\t\tdiff_cleanupMerge(diffs);\n\t}\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 {\n\t\t\t\tif (overlap_length2 >= deletion.length / 2 || overlap_length2 >= insertion.length / 2) {\n\t\t\t\t\t// Reverse overlap found.\n\t\t\t\t\t// Insert an equality and swap and trim the surrounding edits.\n\t\t\t\t\tdiffs.splice(pointer, 0, new Diff(DIFF_EQUAL, deletion.substring(0, overlap_length2)));\n\t\t\t\t\tdiffs[pointer - 1][0] = DIFF_INSERT;\n\t\t\t\t\tdiffs[pointer - 1][1] = insertion.substring(0, insertion.length - overlap_length2);\n\t\t\t\t\tdiffs[pointer + 1][0] = DIFF_DELETE;\n\t\t\t\t\tdiffs[pointer + 1][1] = deletion.substring(overlap_length2);\n\t\t\t\t\tpointer++;\n\t\t\t\t}\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) {\n\t\t\t\t\tdiffs[pointer - 1][1] = bestEquality1;\n\t\t\t\t} else {\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) {\n\t\t\t\t\tdiffs[pointer + 1][1] = bestEquality2;\n\t\t\t\t} else {\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) {\n\t\tswitch (diffs[pointer][0]) {\n\t\t\tcase DIFF_INSERT:\n\t\t\t\tcount_insert++;\n\t\t\t\ttext_insert += diffs[pointer][1];\n\t\t\t\tpointer++;\n\t\t\t\tbreak;\n\t\t\tcase DIFF_DELETE:\n\t\t\t\tcount_delete++;\n\t\t\t\ttext_delete += diffs[pointer][1];\n\t\t\t\tpointer++;\n\t\t\t\tbreak;\n\t\t\tcase DIFF_EQUAL:\n\t\t\t\t// Upon reaching an equality, check for prior redundancies.\n\t\t\t\tif (count_delete + count_insert > 1) {\n\t\t\t\t\tif (count_delete !== 0 && count_insert !== 0) {\n\t\t\t\t\t\t// Factor out any common prefixes.\n\t\t\t\t\t\tcommonlength = diff_commonPrefix(text_insert, text_delete);\n\t\t\t\t\t\tif (commonlength !== 0) {\n\t\t\t\t\t\t\tif (pointer - count_delete - count_insert > 0 && diffs[pointer - count_delete - count_insert - 1][0] === DIFF_EQUAL) {\n\t\t\t\t\t\t\t\tdiffs[pointer - count_delete - count_insert - 1][1] += text_insert.substring(0, commonlength);\n\t\t\t\t\t\t\t} else {\n\t\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\t\tpointer++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttext_insert = text_insert.substring(commonlength);\n\t\t\t\t\t\t\ttext_delete = text_delete.substring(commonlength);\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Factor out any common suffixes.\n\t\t\t\t\t\tcommonlength = diff_commonSuffix(text_insert, text_delete);\n\t\t\t\t\t\tif (commonlength !== 0) {\n\t\t\t\t\t\t\tdiffs[pointer][1] = text_insert.substring(text_insert.length - commonlength) + diffs[pointer][1];\n\t\t\t\t\t\t\ttext_insert = text_insert.substring(0, text_insert.length - commonlength);\n\t\t\t\t\t\t\ttext_delete = text_delete.substring(0, text_delete.length - commonlength);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t// Delete the offending records and add the merged ones.\n\t\t\t\t\tpointer -= count_delete + count_insert;\n\t\t\t\t\tdiffs.splice(pointer, count_delete + count_insert);\n\t\t\t\t\tif (text_delete.length) {\n\t\t\t\t\t\tdiffs.splice(pointer, 0, new Diff(DIFF_DELETE, text_delete));\n\t\t\t\t\t\tpointer++;\n\t\t\t\t\t}\n\t\t\t\t\tif (text_insert.length) {\n\t\t\t\t\t\tdiffs.splice(pointer, 0, new Diff(DIFF_INSERT, text_insert));\n\t\t\t\t\t\tpointer++;\n\t\t\t\t\t}\n\t\t\t\t\tpointer++;\n\t\t\t\t} else if (pointer !== 0 && diffs[pointer - 1][0] === DIFF_EQUAL) {\n\t\t\t\t\t// Merge this equality with the previous one.\n\t\t\t\t\tdiffs[pointer - 1][1] += diffs[pointer][1];\n\t\t\t\t\tdiffs.splice(pointer, 1);\n\t\t\t\t} else {\n\t\t\t\t\tpointer++;\n\t\t\t\t}\n\t\t\t\tcount_insert = 0;\n\t\t\t\tcount_delete = 0;\n\t\t\t\ttext_delete = \"\";\n\t\t\t\ttext_insert = \"\";\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tif (diffs.at(-1)?.[1] === \"\") {\n\t\tdiffs.pop();\n\t}\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) {\n\t\tdiff_cleanupMerge(diffs);\n\t}\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\t\t// Edges are the best.\n\t\treturn 6;\n\t}\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\t\t// Five points for blank lines.\n\t\treturn 5;\n\t} else if (lineBreak1 || lineBreak2) {\n\t\t// Four points for line breaks.\n\t\treturn 4;\n\t} else if (nonAlphaNumeric1 && !whitespace1 && whitespace2) {\n\t\t// Three points for end of sentences.\n\t\treturn 3;\n\t} else if (whitespace1 || whitespace2) {\n\t\t// Two points for whitespace.\n\t\treturn 2;\n\t} else if (nonAlphaNumeric1 || nonAlphaNumeric2) {\n\t\t// One point for non-alphanumeric.\n\t\treturn 1;\n\t}\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.\\n\" + \"Printing internal object structure without calling `toJSON` instead.\";\n\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 = /*@__PURE__*/ requireBuild();\nvar diffSequences = /*@__PURE__*/getDefaultExportFromCjs(buildExports);\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) {\n\t\t\ti += 1;\n\t\t}\n\t\tif (iStart !== i) {\n\t\t\tif (iStart === 0) {\n\t\t\t\t// at start\n\t\t\t\tif (i > nContextLines) {\n\t\t\t\t\tjLength -= i - nContextLines;\n\t\t\t\t\thasExcessAtStartOrEnd = true;\n\t\t\t\t}\n\t\t\t} else if (i === iLength) {\n\t\t\t\t// at end\n\t\t\t\tconst n = i - iStart;\n\t\t\t\tif (n > nContextLines) {\n\t\t\t\t\tjLength -= n - nContextLines;\n\t\t\t\t\thasExcessAtStartOrEnd = true;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// between changes\n\t\t\t\tconst n = i - iStart;\n\t\t\t\tif (n > nContextLines2) {\n\t\t\t\t\tjLength -= n - nContextLines2;\n\t\t\t\t\tnExcessesBetweenChanges += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\twhile (i !== iLength && diffs[i][0] !== DIFF_EQUAL) {\n\t\t\ti += 1;\n\t\t}\n\t}\n\tconst hasPatch = nExcessesBetweenChanges !== 0 || hasExcessAtStartOrEnd;\n\tif (nExcessesBetweenChanges !== 0) {\n\t\tjLength += nExcessesBetweenChanges + 1;\n\t} else if (hasExcessAtStartOrEnd) {\n\t\tjLength += 1;\n\t}\n\tconst jLast = jLength - 1;\n\tconst lines = [];\n\tlet jPatchMark = 0;\n\tif (hasPatch) {\n\t\tlines.push(\"\");\n\t}\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) {\n\t\t\ti += 1;\n\t\t}\n\t\tif (iStart !== i) {\n\t\t\tif (iStart === 0) {\n\t\t\t\t// at beginning\n\t\t\t\tif (i > nContextLines) {\n\t\t\t\t\tiStart = i - nContextLines;\n\t\t\t\t\taStart = iStart;\n\t\t\t\t\tbStart = iStart;\n\t\t\t\t\taEnd = aStart;\n\t\t\t\t\tbEnd = bStart;\n\t\t\t\t}\n\t\t\t\tfor (let iCommon = iStart; iCommon !== i; iCommon += 1) {\n\t\t\t\t\tpushCommonLine(diffs[iCommon][1]);\n\t\t\t\t}\n\t\t\t} else if (i === iLength) {\n\t\t\t\t// at end\n\t\t\t\tconst iEnd = i - iStart > nContextLines ? iStart + nContextLines : i;\n\t\t\t\tfor (let iCommon = iStart; iCommon !== iEnd; iCommon += 1) {\n\t\t\t\t\tpushCommonLine(diffs[iCommon][1]);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// between changes\n\t\t\t\tconst nCommon = i - iStart;\n\t\t\t\tif (nCommon > nContextLines2) {\n\t\t\t\t\tconst iEnd = iStart + nContextLines;\n\t\t\t\t\tfor (let iCommon = iStart; iCommon !== iEnd; iCommon += 1) {\n\t\t\t\t\t\tpushCommonLine(diffs[iCommon][1]);\n\t\t\t\t\t}\n\t\t\t\t\tlines[jPatchMark] = createPatchMark(aStart, aEnd, bStart, bEnd, options);\n\t\t\t\t\tjPatchMark = lines.length;\n\t\t\t\t\tlines.push(\"\");\n\t\t\t\t\tconst nOmit = nCommon - nContextLines2;\n\t\t\t\t\taStart = aEnd + nOmit;\n\t\t\t\t\tbStart = bEnd + nOmit;\n\t\t\t\t\taEnd = aStart;\n\t\t\t\t\tbEnd = bStart;\n\t\t\t\t\tfor (let iCommon = i - nContextLines; iCommon !== i; iCommon += 1) {\n\t\t\t\t\t\tpushCommonLine(diffs[iCommon][1]);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tfor (let iCommon = iStart; iCommon !== i; iCommon += 1) {\n\t\t\t\t\t\tpushCommonLine(diffs[iCommon][1]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\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) {\n\t\tlines[jPatchMark] = createPatchMark(aStart, aEnd, bStart, bEnd, options);\n\t}\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: c.green,\n\t\taIndicator: \"-\",\n\t\tbAnnotation: \"Received\",\n\t\tbColor: c.red,\n\t\tbIndicator: \"+\",\n\t\tchangeColor: c.inverse,\n\t\tchangeLineTrailingSpaceColor: noColor,\n\t\tcommonColor: c.dim,\n\t\tcommonIndicator: \" \",\n\t\tcommonLineTrailingSpaceColor: noColor,\n\t\tcompareKeys: undefined,\n\t\tcontextLines: DIFF_CONTEXT_DEFAULT,\n\t\temptyFirstOrLastLinePlaceholder: \"\",\n\t\texpand: false,\n\t\tincludeChangeCounts: false,\n\t\tomitAnnotationLines: false,\n\t\tpatchColor: c.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 : undefined;\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:\n\t\t\t\tb += 1;\n\t\t\t\tbreak;\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) {\n\t\treturn \"\";\n\t}\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\t\t// Fall back to diff of display lines.\n\t\treturn diffLinesUnified(aLinesDisplay, bLinesDisplay, options);\n\t}\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) {\n\t\t\tdiffs.push(new Diff(DIFF_DELETE, aLines[aIndex]));\n\t\t}\n\t\tfor (; bIndex !== bCommon; bIndex += 1) {\n\t\t\tdiffs.push(new Diff(DIFF_INSERT, bLines[bIndex]));\n\t\t}\n\t\tfor (; nCommon !== 0; nCommon -= 1, aIndex += 1, bIndex += 1) {\n\t\t\tdiffs.push(new Diff(DIFF_EQUAL, bLines[bIndex]));\n\t\t}\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) {\n\t\tdiffs.push(new Diff(DIFF_DELETE, aLines[aIndex]));\n\t}\n\tfor (; bIndex !== bLength; bIndex += 1) {\n\t\tdiffs.push(new Diff(DIFF_INSERT, bLines[bIndex]));\n\t}\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 === undefined) {\n\t\treturn \"undefined\";\n\t} else if (value === null) {\n\t\treturn \"null\";\n\t} else if (Array.isArray(value)) {\n\t\treturn \"array\";\n\t} else if (typeof value === \"boolean\") {\n\t\treturn \"boolean\";\n\t} else if (typeof value === \"function\") {\n\t\treturn \"function\";\n\t} else if (typeof value === \"number\") {\n\t\treturn \"number\";\n\t} else if (typeof value === \"string\") {\n\t\treturn \"string\";\n\t} else if (typeof value === \"bigint\") {\n\t\treturn \"bigint\";\n\t} else if (typeof value === \"object\") {\n\t\tif (value != null) {\n\t\t\tif (value.constructor === RegExp) {\n\t\t\t\treturn \"regexp\";\n\t\t\t} else if (value.constructor === Map) {\n\t\t\t\treturn \"map\";\n\t\t\t} else if (value.constructor === Set) {\n\t\t\t\treturn \"set\";\n\t\t\t} else if (value.constructor === Date) {\n\t\t\t\treturn \"date\";\n\t\t\t}\n\t\t}\n\t\treturn \"object\";\n\t} else if (typeof value === \"symbol\") {\n\t\treturn \"symbol\";\n\t}\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) {\n\t\t\tdiffs.push(new Diff(DIFF_DELETE, a.slice(aIndex, aCommon)));\n\t\t}\n\t\tif (bIndex !== bCommon) {\n\t\t\tdiffs.push(new Diff(DIFF_INSERT, b.slice(bIndex, bCommon)));\n\t\t}\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) {\n\t\tdiffs.push(new Diff(DIFF_DELETE, a.slice(aIndex)));\n\t}\n\tif (bIndex !== bLength) {\n\t\tdiffs.push(new Diff(DIFF_INSERT, b.slice(bIndex)));\n\t}\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\t\t\t\t\t// The last substring starts a change line, if it is not empty.\n\t\t\t\t\t// Important: This non-empty condition also automatically omits\n\t\t\t\t\t// the newline appended to the end of expected and received strings.\n\t\t\t\t\tthis.pushSubstring(substring);\n\t\t\t\t}\n\t\t\t});\n\t\t} else {\n\t\t\t// Append non-multiline string to current change line.\n\t\t\tthis.pushDiff(diff);\n\t\t}\n\t}\n\t// Output from buffer.\n\tmoveLinesTo(lines) {\n\t\tif (!this.isLineEmpty()) {\n\t\t\tthis.pushLine();\n\t\t}\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()) {\n\t\t\tthis.deleteBuffer.pushDiff(diff);\n\t\t}\n\t\tif (!isDiffEmpty || this.insertBuffer.isLineEmpty()) {\n\t\t\tthis.insertBuffer.pushDiff(diff);\n\t\t}\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\t\t\t\t\t// A middle substring is a common line.\n\t\t\t\t\tthis.pushDiffCommonLine(new Diff(op, substring));\n\t\t\t\t} else if (substring.length !== 0) {\n\t\t\t\t\t// The last substring starts a change line, if it is not empty.\n\t\t\t\t\t// Important: This non-empty condition also automatically omits\n\t\t\t\t\t// the newline appended to the end of expected and received strings.\n\t\t\t\t\tthis.pushDiffChangeLines(new Diff(op, substring));\n\t\t\t\t}\n\t\t\t});\n\t\t} else {\n\t\t\t// Append non-multiline string to current change lines.\n\t\t\t// Important: It cannot be at the end following empty change lines,\n\t\t\t// because newline appended to the end of expected and received strings.\n\t\t\tthis.pushDiffChangeLines(diff);\n\t\t}\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\tif (cleanup) {\n\t\tdiff_cleanupSemantic(diffs);\n\t}\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)) {\n\t\treturn \"\";\n\t}\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\t\t\t// Do not know expected type of user-defined asymmetric matcher.\n\t\t\treturn undefined;\n\t\t}\n\t\tif (typeof a.getExpectedType !== \"function\") {\n\t\t\t// For example, expect.anything() matches either null or undefined\n\t\t\treturn undefined;\n\t\t}\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\tconst aDiff = `${aColor(`${aIndicator} ${aAnnotation}:`)}\\n${aDisplay}`;\n\t\tconst bDiff = `${bColor(`${bIndicator} ${bAnnotation}:`)}\\n${bDisplay}`;\n\t\treturn `${aDiff}\\n\\n${bDiff}`;\n\t}\n\tif (omitDifference) {\n\t\treturn undefined;\n\t}\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\tconst formatOptions = getFormatOptions(FORMAT_OPTIONS, options);\n\t\tdifference = getObjectsDifference(a, b, formatOptions, 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 === undefined || difference === noDiffMessage) {\n\t\tconst formatOptions = getFormatOptions(FALLBACK_FORMAT_OPTIONS, options);\n\t\tdifference = getObjectsDifference(a, b, formatOptions, options, memorize);\n\t\tif (difference !== noDiffMessage && !hasThrown) {\n\t\t\tdifference = `${getCommonMessage(SIMILAR_MESSAGE, options)}\\n\\n${difference}`;\n\t\t}\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) {\n\t\treturn getCommonMessage(NO_DIFF_MESSAGE, options);\n\t} else {\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\tconst type = getType$1(data);\n\treturn type === \"Object\" && typeof data.asymmetricMatch === \"function\";\n}\nfunction isReplaceable(obj1, obj2) {\n\tconst obj1Type = getType$1(obj1);\n\tconst obj2Type = getType$1(obj2);\n\treturn obj1Type === obj2Type && (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\")) {\n\t\t\treturn diffStringsUnified(expected, received, options);\n\t\t}\n\t\tconst [diffs] = diffStringsRaw(expected, received, true);\n\t\tconst hasCommonDiff = diffs.some((diff) => diff[0] === DIFF_EQUAL);\n\t\tconst printLabel = getLabelPrinter(aAnnotation, bAnnotation);\n\t\tconst expectedLine = printLabel(aAnnotation) + printExpected(getCommonAndChangedSubstrings(diffs, DIFF_DELETE, hasCommonDiff));\n\t\tconst receivedLine = printLabel(bAnnotation) + printReceived(getCommonAndChangedSubstrings(diffs, DIFF_INSERT, hasCommonDiff));\n\t\treturn `${expectedLine}\\n${receivedLine}`;\n\t}\n\t// if (isLineDiffable(expected, received)) {\n\tconst clonedExpected = deepClone(expected, { forceWritable: true });\n\tconst clonedReceived = deepClone(received, { forceWritable: true });\n\tconst { replacedExpected, replacedActual } = replaceAsymmetricMatcher(clonedReceived, clonedExpected);\n\tconst memorize = memory ? createMemorize(memory) : DEFAULT_MEMORIZE;\n\tconst difference = diff(replacedExpected, replacedActual, options, memorize);\n\treturn difference;\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 = new WeakSet(), expectedReplaced = 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)) {\n\t\treturn {\n\t\t\treplacedActual: actual,\n\t\t\treplacedExpected: expected\n\t\t};\n\t}\n\tif (actualReplaced.has(actual) || expectedReplaced.has(expected)) {\n\t\treturn {\n\t\t\treplacedActual: actual,\n\t\t\treplacedExpected: expected\n\t\t};\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\t\t\t\t// When matcher matches, replace expected with actual value\n\t\t\t\t// so they appear the same in the diff\n\t\t\t\texpected[key] = actualValue;\n\t\t\t} else if (\"sample\" in expectedValue && expectedValue.sample !== undefined && 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)) {\n\t\t\t\tactual[key] = expectedValue;\n\t\t\t} else if (\"sample\" in actualValue && actualValue.sample !== undefined && 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 c.red(replaceTrailingSpaces(stringify(object)));\n}\nfunction printExpected(value) {\n\treturn c.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 ? c.inverse(diff[1]) : diff[1] : \"\"), \"\");\n}\n\nexport { DIFF_DELETE, DIFF_EQUAL, DIFF_INSERT, Diff, diff, diffLinesRaw, diffLinesUnified, diffLinesUnified2, diffStringsRaw, diffStringsUnified, getDefaultFormatOptions, getLabelPrinter, printDiffOrStringify, replaceAsymmetricMatcher };\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA0CA,MAAM,cAAc;AACpB,MAAM,cAAc;AACpB,MAAM,aAAa;;;;;;;;AAQnB,IAAM,OAAN,MAAW;CACV;CACA;CACA,YAAY,IAAI,MAAM;EACrB,KAAK,KAAK;EACV,KAAK,KAAK;CACX;AACD;;;;;;;;AAQA,SAAS,kBAAkB,OAAO,OAAO;CAExC,IAAI,CAAC,SAAS,CAAC,SAAS,MAAM,OAAO,CAAC,MAAM,MAAM,OAAO,CAAC,GACzD,OAAO;CAIR,IAAI,aAAa;CACjB,IAAI,aAAa,KAAK,IAAI,MAAM,QAAQ,MAAM,MAAM;CACpD,IAAI,aAAa;CACjB,IAAI,eAAe;CACnB,OAAO,aAAa,YAAY;EAC/B,IAAI,MAAM,UAAU,cAAc,UAAU,MAAM,MAAM,UAAU,cAAc,UAAU,GAAG;GAC5F,aAAa;GACb,eAAe;EAChB,OACC,aAAa;EAEd,aAAa,KAAK,OAAO,aAAa,cAAc,IAAI,UAAU;CACnE;CACA,OAAO;AACR;;;;;;;AAOA,SAAS,kBAAkB,OAAO,OAAO;CAExC,IAAI,CAAC,SAAS,CAAC,SAAS,MAAM,OAAO,MAAM,SAAS,CAAC,MAAM,MAAM,OAAO,MAAM,SAAS,CAAC,GACvF,OAAO;CAIR,IAAI,aAAa;CACjB,IAAI,aAAa,KAAK,IAAI,MAAM,QAAQ,MAAM,MAAM;CACpD,IAAI,aAAa;CACjB,IAAI,aAAa;CACjB,OAAO,aAAa,YAAY;EAC/B,IAAI,MAAM,UAAU,MAAM,SAAS,YAAY,MAAM,SAAS,UAAU,MAAM,MAAM,UAAU,MAAM,SAAS,YAAY,MAAM,SAAS,UAAU,GAAG;GACpJ,aAAa;GACb,aAAa;EACd,OACC,aAAa;EAEd,aAAa,KAAK,OAAO,aAAa,cAAc,IAAI,UAAU;CACnE;CACA,OAAO;AACR;;;;;;;;;AASA,SAAS,oBAAoB,OAAO,OAAO;CAE1C,MAAM,eAAe,MAAM;CAC3B,MAAM,eAAe,MAAM;CAE3B,IAAI,iBAAiB,KAAK,iBAAiB,GAC1C,OAAO;CAGR,IAAI,eAAe,cAClB,QAAQ,MAAM,UAAU,eAAe,YAAY;MAC7C,IAAI,eAAe,cACzB,QAAQ,MAAM,UAAU,GAAG,YAAY;CAExC,MAAM,cAAc,KAAK,IAAI,cAAc,YAAY;CAEvD,IAAI,UAAU,OACb,OAAO;CAKR,IAAI,OAAO;CACX,IAAI,SAAS;CACb,OAAO,MAAM;EACZ,MAAM,UAAU,MAAM,UAAU,cAAc,MAAM;EACpD,MAAM,QAAQ,MAAM,QAAQ,OAAO;EACnC,IAAI,UAAU,IACb,OAAO;EAER,UAAU;EACV,IAAI,UAAU,KAAK,MAAM,UAAU,cAAc,MAAM,MAAM,MAAM,UAAU,GAAG,MAAM,GAAG;GACxF,OAAO;GACP;EACD;CACD;AACD;;;;;AAKA,SAAS,qBAAqB,OAAO;CACpC,IAAI,UAAU;CACd,MAAM,aAAa,CAAC;CACpB,IAAI,mBAAmB;;CAEvB,IAAI,eAAe;CAEnB,IAAI,UAAU;CAEd,IAAI,qBAAqB;CACzB,IAAI,oBAAoB;CAExB,IAAI,qBAAqB;CACzB,IAAI,oBAAoB;CACxB,OAAO,UAAU,MAAM,QAAQ;EAC9B,IAAI,MAAM,QAAQ,CAAC,UAAmB;GAErC,WAAW,sBAAsB;GACjC,qBAAqB;GACrB,oBAAoB;GACpB,qBAAqB;GACrB,oBAAoB;GACpB,eAAe,MAAM,QAAQ,CAAC;EAC/B,OAAO;GAEN,IAAI,MAAM,QAAQ,CAAC,UAClB,sBAAsB,MAAM,QAAQ,CAAC,EAAE,CAAC;QAExC,qBAAqB,MAAM,QAAQ,CAAC,EAAE,CAAC;GAIxC,IAAI,gBAAgB,aAAa,UAAU,KAAK,IAAI,oBAAoB,iBAAiB,KAAK,aAAa,UAAU,KAAK,IAAI,oBAAoB,iBAAiB,GAAG;IAErK,MAAM,OAAO,WAAW,mBAAmB,IAAI,GAAG,IAAI,SAAkB,YAAY,CAAC;IAErF,MAAM,WAAW,mBAAmB,KAAK,EAAE,CAAC;IAE5C;IAEA;IACA,UAAU,mBAAmB,IAAI,WAAW,mBAAmB,KAAK;IACpE,qBAAqB;IACrB,oBAAoB;IACpB,qBAAqB;IACrB,oBAAoB;IACpB,eAAe;IACf,UAAU;GACX;EACD;EACA;CACD;CAEA,IAAI,SACH,kBAAkB,KAAK;CAExB,6BAA6B,KAAK;CAOlC,UAAU;CACV,OAAO,UAAU,MAAM,QAAQ;EAC9B,IAAI,MAAM,UAAU,EAAE,CAAC,aAAsB,MAAM,QAAQ,CAAC,UAAoB;GAC/E,MAAM,WAAW,MAAM,UAAU,EAAE,CAAC;GACpC,MAAM,YAAY,MAAM,QAAQ,CAAC;GACjC,MAAM,kBAAkB,oBAAoB,UAAU,SAAS;GAC/D,MAAM,kBAAkB,oBAAoB,WAAW,QAAQ;GAC/D,IAAI,mBAAmB,iBACtB;QAAI,mBAAmB,SAAS,SAAS,KAAK,mBAAmB,UAAU,SAAS,GAAG;KAEtF,MAAM,OAAO,SAAS,GAAG,IAAI,QAAiB,UAAU,UAAU,GAAG,eAAe,CAAC,CAAC;KACtF,MAAM,UAAU,EAAE,CAAC,KAAK,SAAS,UAAU,GAAG,SAAS,SAAS,eAAe;KAC/E,MAAM,UAAU,EAAE,CAAC,KAAK,UAAU,UAAU,eAAe;KAC3D;IACD;UAEA,IAAI,mBAAmB,SAAS,SAAS,KAAK,mBAAmB,UAAU,SAAS,GAAG;IAGtF,MAAM,OAAO,SAAS,GAAG,IAAI,QAAiB,SAAS,UAAU,GAAG,eAAe,CAAC,CAAC;IACrF,MAAM,UAAU,EAAE,CAAC;IACnB,MAAM,UAAU,EAAE,CAAC,KAAK,UAAU,UAAU,GAAG,UAAU,SAAS,eAAe;IACjF,MAAM,UAAU,EAAE,CAAC;IACnB,MAAM,UAAU,EAAE,CAAC,KAAK,SAAS,UAAU,eAAe;IAC1D;GACD;GAED;EACD;EACA;CACD;AACD;AAEA,MAAM,wBAAwB;AAC9B,MAAM,mBAAmB;AACzB,MAAM,kBAAkB;AACxB,MAAM,qBAAqB;AAC3B,MAAM,uBAAuB;;;;;;;AAO7B,SAAS,6BAA6B,OAAO;CAC5C,IAAI,UAAU;CAEd,OAAO,UAAU,MAAM,SAAS,GAAG;EAClC,IAAI,MAAM,UAAU,EAAE,CAAC,YAAqB,MAAM,UAAU,EAAE,CAAC,UAAmB;GAEjF,IAAI,YAAY,MAAM,UAAU,EAAE,CAAC;GACnC,IAAI,OAAO,MAAM,QAAQ,CAAC;GAC1B,IAAI,YAAY,MAAM,UAAU,EAAE,CAAC;GAEnC,MAAM,eAAe,kBAAkB,WAAW,IAAI;GACtD,IAAI,cAAc;IACjB,MAAM,eAAe,KAAK,UAAU,KAAK,SAAS,YAAY;IAC9D,YAAY,UAAU,UAAU,GAAG,UAAU,SAAS,YAAY;IAClE,OAAO,eAAe,KAAK,UAAU,GAAG,KAAK,SAAS,YAAY;IAClE,YAAY,eAAe;GAC5B;GAEA,IAAI,gBAAgB;GACpB,IAAI,WAAW;GACf,IAAI,gBAAgB;GACpB,IAAI,YAAY,2BAA2B,WAAW,IAAI,IAAI,2BAA2B,MAAM,SAAS;GACxG,OAAO,KAAK,OAAO,CAAC,MAAM,UAAU,OAAO,CAAC,GAAG;IAC9C,aAAa,KAAK,OAAO,CAAC;IAC1B,OAAO,KAAK,UAAU,CAAC,IAAI,UAAU,OAAO,CAAC;IAC7C,YAAY,UAAU,UAAU,CAAC;IACjC,MAAM,QAAQ,2BAA2B,WAAW,IAAI,IAAI,2BAA2B,MAAM,SAAS;IAEtG,IAAI,SAAS,WAAW;KACvB,YAAY;KACZ,gBAAgB;KAChB,WAAW;KACX,gBAAgB;IACjB;GACD;GACA,IAAI,MAAM,UAAU,EAAE,CAAC,OAAO,eAAe;IAE5C,IAAI,eACH,MAAM,UAAU,EAAE,CAAC,KAAK;SAClB;KACN,MAAM,OAAO,UAAU,GAAG,CAAC;KAC3B;IACD;IACA,MAAM,QAAQ,CAAC,KAAK;IACpB,IAAI,eACH,MAAM,UAAU,EAAE,CAAC,KAAK;SAClB;KACN,MAAM,OAAO,UAAU,GAAG,CAAC;KAC3B;IACD;GACD;EACD;EACA;CACD;AACD;;;;;;AAMA,SAAS,kBAAkB,OAAO;CAEjC,MAAM,KAAK,IAAI,QAAiB,EAAE,CAAC;CACnC,IAAI,UAAU;CACd,IAAI,eAAe;CACnB,IAAI,eAAe;CACnB,IAAI,cAAc;CAClB,IAAI,cAAc;CAClB,IAAI;CACJ,OAAO,UAAU,MAAM,QACtB,QAAQ,MAAM,QAAQ,CAAC,IAAvB;EACC;GACC;GACA,eAAe,MAAM,QAAQ,CAAC;GAC9B;GACA;EACD;GACC;GACA,eAAe,MAAM,QAAQ,CAAC;GAC9B;GACA;EACD;GAEC,IAAI,eAAe,eAAe,GAAG;IACpC,IAAI,iBAAiB,KAAK,iBAAiB,GAAG;KAE7C,eAAe,kBAAkB,aAAa,WAAW;KACzD,IAAI,iBAAiB,GAAG;MACvB,IAAI,UAAU,eAAe,eAAe,KAAK,MAAM,UAAU,eAAe,eAAe,EAAE,CAAC,UACjG,MAAM,UAAU,eAAe,eAAe,EAAE,CAAC,MAAM,YAAY,UAAU,GAAG,YAAY;WACtF;OACN,MAAM,OAAO,GAAG,GAAG,IAAI,QAAiB,YAAY,UAAU,GAAG,YAAY,CAAC,CAAC;OAC/E;MACD;MACA,cAAc,YAAY,UAAU,YAAY;MAChD,cAAc,YAAY,UAAU,YAAY;KACjD;KAEA,eAAe,kBAAkB,aAAa,WAAW;KACzD,IAAI,iBAAiB,GAAG;MACvB,MAAM,QAAQ,CAAC,KAAK,YAAY,UAAU,YAAY,SAAS,YAAY,IAAI,MAAM,QAAQ,CAAC;MAC9F,cAAc,YAAY,UAAU,GAAG,YAAY,SAAS,YAAY;MACxE,cAAc,YAAY,UAAU,GAAG,YAAY,SAAS,YAAY;KACzE;IACD;IAEA,WAAW,eAAe;IAC1B,MAAM,OAAO,SAAS,eAAe,YAAY;IACjD,IAAI,YAAY,QAAQ;KACvB,MAAM,OAAO,SAAS,GAAG,IAAI,SAAkB,WAAW,CAAC;KAC3D;IACD;IACA,IAAI,YAAY,QAAQ;KACvB,MAAM,OAAO,SAAS,GAAG,IAAI,QAAkB,WAAW,CAAC;KAC3D;IACD;IACA;GACD,OAAO,IAAI,YAAY,KAAK,MAAM,UAAU,EAAE,CAAC,UAAmB;IAEjE,MAAM,UAAU,EAAE,CAAC,MAAM,MAAM,QAAQ,CAAC;IACxC,MAAM,OAAO,SAAS,CAAC;GACxB,OACC;GAED,eAAe;GACf,eAAe;GACf,cAAc;GACd,cAAc;GACd;CACF;CAED,IAAI,MAAM,GAAG,EAAE,CAAC,GAAG,OAAO,IACzB,MAAM,IAAI;CAKX,IAAI,UAAU;CACd,UAAU;CAEV,OAAO,UAAU,MAAM,SAAS,GAAG;EAClC,IAAI,MAAM,UAAU,EAAE,CAAC,YAAqB,MAAM,UAAU,EAAE,CAAC,UAE9D;OAAI,MAAM,QAAQ,CAAC,EAAE,CAAC,UAAU,MAAM,QAAQ,CAAC,EAAE,CAAC,SAAS,MAAM,UAAU,EAAE,CAAC,EAAE,CAAC,MAAM,MAAM,MAAM,UAAU,EAAE,CAAC,IAAI;IAEnH,MAAM,QAAQ,CAAC,KAAK,MAAM,UAAU,EAAE,CAAC,KAAK,MAAM,QAAQ,CAAC,EAAE,CAAC,UAAU,GAAG,MAAM,QAAQ,CAAC,EAAE,CAAC,SAAS,MAAM,UAAU,EAAE,CAAC,EAAE,CAAC,MAAM;IAClI,MAAM,UAAU,EAAE,CAAC,KAAK,MAAM,UAAU,EAAE,CAAC,KAAK,MAAM,UAAU,EAAE,CAAC;IACnE,MAAM,OAAO,UAAU,GAAG,CAAC;IAC3B,UAAU;GACX,OAAO,IAAI,MAAM,QAAQ,CAAC,EAAE,CAAC,UAAU,GAAG,MAAM,UAAU,EAAE,CAAC,EAAE,CAAC,MAAM,MAAM,MAAM,UAAU,EAAE,CAAC,IAAI;IAElG,MAAM,UAAU,EAAE,CAAC,MAAM,MAAM,UAAU,EAAE,CAAC;IAC5C,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,EAAE,CAAC,UAAU,MAAM,UAAU,EAAE,CAAC,EAAE,CAAC,MAAM,IAAI,MAAM,UAAU,EAAE,CAAC;IACnG,MAAM,OAAO,UAAU,GAAG,CAAC;IAC3B,UAAU;GACX;;EAED;CACD;CAEA,IAAI,SACH,kBAAkB,KAAK;AAEzB;;;;;;;;;;;AAWA,SAAS,2BAA2B,KAAK,KAAK;CAC7C,IAAI,CAAC,OAAO,CAAC,KAEZ,OAAO;CAOR,MAAM,QAAQ,IAAI,OAAO,IAAI,SAAS,CAAC;CACvC,MAAM,QAAQ,IAAI,OAAO,CAAC;CAC1B,MAAM,mBAAmB,MAAM,MAAM,qBAAqB;CAC1D,MAAM,mBAAmB,MAAM,MAAM,qBAAqB;CAC1D,MAAM,cAAc,oBAAoB,MAAM,MAAM,gBAAgB;CACpE,MAAM,cAAc,oBAAoB,MAAM,MAAM,gBAAgB;CACpE,MAAM,aAAa,eAAe,MAAM,MAAM,eAAe;CAC7D,MAAM,aAAa,eAAe,MAAM,MAAM,eAAe;CAC7D,MAAM,aAAa,cAAc,IAAI,MAAM,kBAAkB;CAC7D,MAAM,aAAa,cAAc,IAAI,MAAM,oBAAoB;CAC/D,IAAI,cAAc,YAEjB,OAAO;MACD,IAAI,cAAc,YAExB,OAAO;MACD,IAAI,oBAAoB,CAAC,eAAe,aAE9C,OAAO;MACD,IAAI,eAAe,aAEzB,OAAO;MACD,IAAI,oBAAoB,kBAE9B,OAAO;CAER,OAAO;AACR;;;;;;;AAQA,MAAM,kBAAkB;AACxB,MAAM,kBAAkB;AAExB,SAAS,wBAAwB,GAAG;CACnC,OAAO,KAAK,EAAE,cAAc,OAAO,UAAU,eAAe,KAAK,GAAG,SAAS,IAAI,EAAE,aAAa;AACjG;AAEA,IAAI,QAAQ,CAAC;AAEb,IAAI;AAEJ,SAAS,eAAgB;CACxB,IAAI,kBAAkB,OAAO;CAC7B,mBAAmB;CAEnB,OAAO,eAAe,OAAO,cAAc,EACzC,OAAO,KACT,CAAC;CACD,MAAM,UAAU;;;;;;;;CAkEhB,MAAM,MAAM;CACZ,MAAM,cAAc;CAIpB,MAAM,qBAAqB,QAAQ,MAAM,QAAQ,MAAM,aAAa;EAClE,IAAI,UAAU;EACd,OAAO,SAAS,QAAQ,SAAS,QAAQ,SAAS,QAAQ,MAAM,GAAG;GACjE,UAAU;GACV,UAAU;GACV,WAAW;EACb;EACA,OAAO;CACT;CAIA,MAAM,qBAAqB,QAAQ,QAAQ,QAAQ,QAAQ,aAAa;EACtE,IAAI,UAAU;EACd,OAAO,UAAU,UAAU,UAAU,UAAU,SAAS,QAAQ,MAAM,GAAG;GACvE,UAAU;GACV,UAAU;GACV,WAAW;EACb;EACA,OAAO;CACT;CAIA,MAAM,gBACJ,GACA,MACA,MACA,IACA,UACA,WACA,UACG;EAEH,IAAI,KAAK;EACT,IAAI,KAAK,CAAC;EACV,IAAI,SAAS,UAAU;EACvB,IAAI,cAAc;EAClB,UAAU,OAAO,kBACf,SAAS,GACT,MACA,KAAK,SAAS,KAAK,GACnB,MACA,QACF;EAGA,MAAM,KAAK,IAAI,QAAQ,IAAI;EAG3B,KAAK,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;GAIjD,IAAI,OAAO,KAAK,cAAc,UAAU,KACtC,SAAS,UAAU;QACd;IACL,SAAS,cAAc;IAEvB,IAAI,QAAQ,QAEV,OAAO,KAAK;GAEhB;GAGA,cAAc,UAAU;GACxB,UAAU,MACR,SACA,kBAAkB,SAAS,GAAG,MAAM,KAAK,SAAS,KAAK,GAAG,MAAM,QAAQ;EAC5E;EACA,OAAO;CACT;CAIA,MAAM,gBACJ,GACA,QACA,QACA,IACA,UACA,WACA,UACG;EAEH,IAAI,KAAK;EACT,IAAI,KAAK;EACT,IAAI,SAAS,UAAU;EACvB,IAAI,cAAc;EAClB,UAAU,OAAO,kBACf,QACA,SAAS,GACT,QACA,KAAK,SAAS,KAAK,GACnB,QACF;EAGA,MAAM,KAAK,IAAI,QAAQ,IAAI;EAG3B,KAAK,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;GAIjD,IAAI,OAAO,KAAK,UAAU,MAAM,aAC9B,SAAS,UAAU;QACd;IACL,SAAS,cAAc;IAEvB,IAAI,SAAS,QAEX,OAAO,KAAK;GAEhB;GAGA,cAAc,UAAU;GACxB,UAAU,MACR,SACA,kBACE,QACA,SAAS,GACT,QACA,KAAK,SAAS,KAAK,GACnB,QACF;EACJ;EACA,OAAO;CACT;CAIA,MAAM,4BACJ,GACA,QACA,MACA,QACA,MACA,UACA,WACA,OACA,WACA,OACA,aACG;EACH,MAAM,KAAK,SAAS;EACpB,MAAM,UAAU,OAAO;EAEvB,MAAM,gBADU,OAAO,SACS;EAGhC,MAAM,eAAe,CAAC,iBAAiB,IAAI;EAC3C,MAAM,eAAe,CAAC,iBAAiB,IAAI;EAE3C,IAAI,cAAc;EAGlB,MAAM,KAAK,IAAI,QAAQ,IAAI;EAG3B,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;GAKpD,MAAM,SAAS,OAAO,KAAM,OAAO,KAAK,cAAc,UAAU;GAChE,MAAM,YAAY,SAAS,UAAU,MAAM;GAC3C,MAAM,SAAS,SACX,YACA,YAAY;GAGhB,MAAM,SAAS,KAAK,SAAS;GAC7B,MAAM,WAAW,kBACf,SAAS,GACT,MACA,SAAS,GACT,MACA,QACF;GACA,MAAM,QAAQ,SAAS;GACvB,cAAc,UAAU;GACxB,UAAU,MAAM;GAChB,IAAI,gBAAgB,MAAM,MAAM,cAAc;IAI5C,MAAM,MAAM,IAAI,KAAK,KAAK,kBAAkB;IAI5C,IAAI,MAAM,SAAS,UAAU,MAAM,KAAK,OAAO;KAI7C,MAAM,YAAY,KAAK,aAAa,SAAS,KAAK,IAAI,KAAK;KAK3D,MAAM,WAAW,kBACf,QACA,WACA,QACA,WACA,QACF;KACA,MAAM,kBAAkB,YAAY;KACpC,MAAM,kBAAkB,YAAY;KACpC,MAAM,gBAAgB,kBAAkB;KACxC,MAAM,gBAAgB,kBAAkB;KACxC,SAAS,mBAAmB,IAAI;KAChC,IAAI,IAAI,MAAM,gBAAgB,gBAAgB,SAAS,QAAQ;MAI7D,SAAS,gBAAgB;MACzB,SAAS,gBAAgB;KAC3B,OAAO;MACL,SAAS,gBAAgB;MACzB,SAAS,gBAAgB;KAC3B;KACA,SAAS,mBAAmB;KAC5B,IAAI,aAAa,GAAG;MAClB,SAAS,mBAAmB;MAC5B,SAAS,mBAAmB;KAC9B;KACA,SAAS,mBAAmB;KAC5B,IAAI,aAAa,GAAG;MAClB,SAAS,mBAAmB,SAAS;MACrC,SAAS,mBAAmB,SAAS;KACvC;KACA,MAAM,kBAAkB,QAAQ;KAChC,MAAM,kBAAkB,SAAS,WAAW;KAC5C,SAAS,mBAAmB,IAAI;KAChC,IAAI,IAAI,MAAM,OAAO,OAAO,kBAAkB,iBAAiB;MAI7D,SAAS,kBAAkB;MAC3B,SAAS,kBAAkB;KAC7B,OAAO;MACL,SAAS,kBAAkB;MAC3B,SAAS,kBAAkB;KAC7B;KACA,OAAO;IACT;GACF;EACF;EACA,OAAO;CACT;CAIA,MAAM,4BACJ,GACA,QACA,MACA,QACA,MACA,UACA,WACA,OACA,WACA,OACA,aACG;EACH,MAAM,KAAK,OAAO;EAClB,MAAM,UAAU,OAAO;EAEvB,MAAM,gBADU,OAAO,SACS;EAGhC,MAAM,eAAe,gBAAgB;EACrC,MAAM,eAAe,gBAAgB;EAErC,IAAI,cAAc;EAGlB,MAAM,KAAK,IAAI,QAAQ,IAAI;EAG3B,KAAK,IAAI,KAAK,GAAG,KAAK,GAAG,MAAM,IAAI,MAAM,GAAG,MAAM,GAAG;GAKnD,MAAM,SAAS,OAAO,KAAM,OAAO,KAAK,UAAU,MAAM;GACxD,MAAM,YAAY,SAAS,UAAU,MAAM;GAC3C,MAAM,SAAS,SACX,YACA,YAAY;GAGhB,MAAM,SAAS,KAAK,SAAS;GAC7B,MAAM,WAAW,kBACf,QACA,SAAS,GACT,QACA,SAAS,GACT,QACF;GACA,MAAM,QAAQ,SAAS;GACvB,cAAc,UAAU;GACxB,UAAU,MAAM;GAChB,IAAI,gBAAgB,MAAM,MAAM,cAAc;IAI5C,MAAM,MAAM,KAAK,KAAK,kBAAkB;IAIxC,IAAI,MAAM,SAAS,QAAQ,KAAK,UAAU,KAAK;KAC7C,MAAM,QAAQ,SAAS;KACvB,SAAS,mBAAmB;KAC5B,IAAI,MAAM,QAAQ,QAAQ,SAAS,QAAQ;MAIzC,SAAS,gBAAgB;MACzB,SAAS,gBAAgB;KAC3B,OAAO;MACL,SAAS,gBAAgB;MACzB,SAAS,gBAAgB;KAC3B;KACA,SAAS,mBAAmB;KAC5B,IAAI,aAAa,GAAG;MAElB,SAAS,mBAAmB;MAC5B,SAAS,mBAAmB;KAC9B;KACA,SAAS,mBAAmB,IAAI;KAChC,IAAI,MAAM,GAAG;MAEX,SAAS,mBAAmB;MAC5B,SAAS,kBAAkB;MAC3B,SAAS,kBAAkB;KAC7B,OAAO;MAIL,MAAM,YAAY,KAAK,aAAa,SAAS,KAAK,IAAI,KAAK;MAK3D,MAAM,WAAW,kBACf,WACA,MACA,WACA,MACA,QACF;MACA,SAAS,mBAAmB;MAC5B,IAAI,aAAa,GAAG;OAElB,SAAS,mBAAmB;OAC5B,SAAS,mBAAmB;MAC9B;MACA,MAAM,kBAAkB,YAAY;MACpC,MAAM,kBAAkB,YAAY;MAEpC,IAAI,IAAI,MAAM,OAAO,OAAO,kBAAkB,iBAAiB;OAI7D,SAAS,kBAAkB;OAC3B,SAAS,kBAAkB;MAC7B,OAAO;OACL,SAAS,kBAAkB;OAC3B,SAAS,kBAAkB;MAC7B;KACF;KACA,OAAO;IACT;GACF;EACF;EACA,OAAO;CACT;CAOA,MAAM,UACJ,SACA,QACA,MACA,QACA,MACA,UACA,WACA,WACA,aACG;EACH,MAAM,KAAK,SAAS;EACpB,MAAM,KAAK,OAAO;EAClB,MAAM,UAAU,OAAO;EACvB,MAAM,UAAU,OAAO;EAQvB,MAAM,gBAAgB,UAAU;EAGhC,IAAI,QAAQ;EACZ,IAAI,QAAQ;EAGZ,UAAU,KAAK,SAAS;EACxB,UAAU,KAAK;EAEf,IAAI,gBAAgB,MAAM,GAAG;GAE3B,MAAM,QAAQ,WAAW,iBAAiB;GAC1C,MAAM,QAAQ,UAAU,WAAW;GACnC,KAAK,IAAI,IAAI,GAAG,KAAK,MAAM,KAAK,GAAG;IACjC,QAAQ,aAAa,GAAG,MAAM,MAAM,IAAI,UAAU,WAAW,KAAK;IAClE,IAAI,IAAI,MACN,QAAQ,aAAa,GAAG,QAAQ,QAAQ,IAAI,UAAU,WAAW,KAAK;SACjE,IAGL,yBACE,GACA,QACA,MACA,QACA,MACA,UACA,WACA,OACA,WACA,OACA,QACF,GAEA;GAEJ;EACF,OAAO;GAEL,MAAM,SAAS,WAAW,iBAAiB,KAAK;GAChD,MAAM,QAAQ,UAAU,UAAU,KAAK;GAOvC,IAAI,IAAI;GACR,QAAQ,aAAa,GAAG,MAAM,MAAM,IAAI,UAAU,WAAW,KAAK;GAClE,KAAK,KAAK,GAAG,KAAK,MAAM,KAAK,GAAG;IAC9B,QAAQ,aACN,IAAI,GACJ,QACA,QACA,IACA,UACA,WACA,KACF;IACA,IAAI,IAAI,MACN,QAAQ,aAAa,GAAG,MAAM,MAAM,IAAI,UAAU,WAAW,KAAK;SAC7D,IAGL,yBACE,GACA,QACA,MACA,QACA,MACA,UACA,WACA,OACA,WACA,OACA,QACF,GAEA;GAEJ;EACF;;EAGA,MAAM,IAAI,MACR,GAAG,IAAI,sBAAsB,OAAO,QAAQ,KAAK,UAAU,OAAO,QAAQ,MAC5E;CACF;CASA,MAAM,oBACJ,SACA,QACA,MACA,QACA,MACA,YACA,WACA,WACA,WACA,aACG;EACH,IAAI,OAAO,SAAS,OAAO,QAAQ;GAGjC,aAAa,CAAC;GACd,IAAI,cAAc,UAAU,WAAW,GAAG;IAExC,MAAM,EAAC,kBAAkB,aAAY,UAAU;IAC/C,UAAU,KAAK;KACb,mBAAmB,SAAS,SAAS,YAAY;MAC/C,iBAAiB,SAAS,SAAS,OAAO;KAC5C;KACA,WAAW,QAAQ,WAAW,SAAS,QAAQ,MAAM;IACvD;GACF;GACA,MAAM,SAAS;GACf,MAAM,OAAO;GACb,SAAS;GACT,OAAO;GACP,SAAS;GACT,OAAO;EACT;EACA,MAAM,EAAC,kBAAkB,aAAY,UAAU,aAAa,IAAI;EAGhE,OACE,SACA,QACA,MACA,QACA,MACA,UACA,WACA,WACA,QACF;EACA,MAAM,EACJ,kBACA,eACA,eACA,kBACA,kBACA,kBACA,kBACA,kBACA,kBACA,kBACA,iBACA,oBACE;EAGJ,IAAI,SAAS,iBAAiB,SAAS,eAErC,iBACE,kBACA,QACA,eACA,QACA,eACA,YACA,WACA,WACA,WACA,QACF;EAIF,IAAI,qBAAqB,GACvB,iBAAiB,kBAAkB,kBAAkB,gBAAgB;EAEvE,IAAI,qBAAqB,GACvB,iBAAiB,kBAAkB,kBAAkB,gBAAgB;EAIvE,IAAI,kBAAkB,QAAQ,kBAAkB,MAE9C,iBACE,kBACA,iBACA,MACA,iBACA,MACA,YACA,WACA,WACA,WACA,QACF;CAEJ;CACA,MAAM,kBAAkB,MAAM,QAAQ;EACpC,IAAI,OAAO,QAAQ,UACjB,MAAM,IAAI,UAAU,GAAG,IAAI,IAAI,KAAK,UAAU,OAAO,IAAI,iBAAiB;EAE5E,IAAI,CAAC,OAAO,cAAc,GAAG,GAC3B,MAAM,IAAI,WAAW,GAAG,IAAI,IAAI,KAAK,SAAS,IAAI,uBAAuB;EAE3E,IAAI,MAAM,GACR,MAAM,IAAI,WAAW,GAAG,IAAI,IAAI,KAAK,SAAS,IAAI,uBAAuB;CAE7E;CACA,MAAM,oBAAoB,MAAM,QAAQ;EACtC,MAAM,OAAO,OAAO;EACpB,IAAI,SAAS,YACX,MAAM,IAAI,UAAU,GAAG,IAAI,IAAI,KAAK,UAAU,KAAK,mBAAmB;CAE1E;CAMA,SAAS,aAAa,SAAS,SAAS,UAAU,kBAAkB;EAClE,eAAe,WAAW,OAAO;EACjC,eAAe,WAAW,OAAO;EACjC,iBAAiB,YAAY,QAAQ;EACrC,iBAAiB,oBAAoB,gBAAgB;EAGrD,MAAM,WAAW,kBAAkB,GAAG,SAAS,GAAG,SAAS,QAAQ;EACnE,IAAI,aAAa,GACf,iBAAiB,UAAU,GAAG,CAAC;EAKjC,IAAI,YAAY,YAAY,YAAY,UAAU;GAGhD,MAAM,SAAS;GACf,MAAM,SAAS;GAGf,MAAM,WAAW,kBACf,QACA,UAAU,GACV,QACA,UAAU,GACV,QACF;GAIA,MAAM,OAAO,UAAU;GACvB,MAAM,OAAO,UAAU;GAKvB,MAAM,YAAY,WAAW;GAC7B,IAAI,YAAY,aAAa,YAAY,WAiCvC,iBACE,GACA,QACA,MACA,QACA,MACA,OACA,CApCA;IACE;IACA;GACF,CAiCQ,GACR,CA7BiB,WA6BT,GACR,CA5BiB,WA4BT,GACR;IAzBA,kBAAkB;IAClB,kBAAkB;IAClB,eAAe;IACf,iBAAiB;IACjB,kBAAkB;IAClB,kBAAkB;IAClB,eAAe;IACf,iBAAiB;IACjB,kBAAkB;IAClB,kBAAkB;IAClB,kBAAkB;IAClB,kBAAkB;GAcX,CACT;GAEF,IAAI,aAAa,GACf,iBAAiB,UAAU,MAAM,IAAI;EAEzC;CACF;CACA,OAAO;AACR;AAGA,IAAI,gBAA6B,sCAAwB,gBADxB,aACmC,CAAC;AAErE,SAAS,qBAAqB,MAAM,wBAAwB;CAC3D,OAAO,KAAK,QAAQ,SAAS,UAAU,uBAAuB,KAAK,CAAC;AACrE;AACA,SAAS,cAAc,MAAM,eAAe,OAAO,WAAW,wBAAwB,iCAAiC;CACtH,OAAO,KAAK,WAAW,IAAI,MAAM,GAAG,UAAU,GAAG,qBAAqB,MAAM,sBAAsB,GAAG,IAAI,cAAc,MAAM,MAAM,SAAS,IAAI,iBAAiB,gCAAgC,WAAW,IAAI,MAAM,GAAG,UAAU,GAAG,iCAAiC,IAAI;AAC5Q;AACA,SAAS,gBAAgB,MAAM,eAAe,EAAE,QAAQ,YAAY,8BAA8B,mCAAmC;CACpI,OAAO,cAAc,MAAM,eAAe,QAAQ,YAAY,8BAA8B,+BAA+B;AAC5H;AACA,SAAS,gBAAgB,MAAM,eAAe,EAAE,QAAQ,YAAY,8BAA8B,mCAAmC;CACpI,OAAO,cAAc,MAAM,eAAe,QAAQ,YAAY,8BAA8B,+BAA+B;AAC5H;AACA,SAAS,gBAAgB,MAAM,eAAe,EAAE,aAAa,iBAAiB,8BAA8B,mCAAmC;CAC9I,OAAO,cAAc,MAAM,eAAe,aAAa,iBAAiB,8BAA8B,+BAA+B;AACtI;AAEA,SAAS,gBAAgB,QAAQ,MAAM,QAAQ,MAAM,EAAE,cAAc;CACpE,OAAO,WAAW,OAAO,SAAS,EAAE,GAAG,OAAO,OAAO,IAAI,SAAS,EAAE,GAAG,OAAO,OAAO,IAAI;AAC1F;AAKA,SAAS,yBAAyB,OAAO,SAAS;CACjD,MAAM,UAAU,MAAM;CACtB,MAAM,gBAAgB,QAAQ;CAC9B,MAAM,iBAAiB,gBAAgB;CAEvC,IAAI,UAAU;CACd,IAAI,wBAAwB;CAC5B,IAAI,0BAA0B;CAC9B,IAAI,IAAI;CACR,OAAO,MAAM,SAAS;EACrB,MAAM,SAAS;EACf,OAAO,MAAM,WAAW,MAAM,EAAE,CAAC,UAChC,KAAK;EAEN,IAAI,WAAW,GACd,IAAI,WAAW,GAEd;OAAI,IAAI,eAAe;IACtB,WAAW,IAAI;IACf,wBAAwB;GACzB;SACM,IAAI,MAAM,SAAS;GAEzB,MAAM,IAAI,IAAI;GACd,IAAI,IAAI,eAAe;IACtB,WAAW,IAAI;IACf,wBAAwB;GACzB;EACD,OAAO;GAEN,MAAM,IAAI,IAAI;GACd,IAAI,IAAI,gBAAgB;IACvB,WAAW,IAAI;IACf,2BAA2B;GAC5B;EACD;EAED,OAAO,MAAM,WAAW,MAAM,EAAE,CAAC,UAChC,KAAK;CAEP;CACA,MAAM,WAAW,4BAA4B,KAAK;CAClD,IAAI,4BAA4B,GAC/B,WAAW,0BAA0B;MAC/B,IAAI,uBACV,WAAW;CAEZ,MAAM,QAAQ,UAAU;CACxB,MAAM,QAAQ,CAAC;CACf,IAAI,aAAa;CACjB,IAAI,UACH,MAAM,KAAK,EAAE;CAGd,IAAI,SAAS;CACb,IAAI,SAAS;CACb,IAAI,OAAO;CACX,IAAI,OAAO;CACX,MAAM,kBAAkB,SAAS;EAChC,MAAM,IAAI,MAAM;EAChB,MAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,MAAM,OAAO,OAAO,CAAC;EACjE,QAAQ;EACR,QAAQ;CACT;CACA,MAAM,kBAAkB,SAAS;EAChC,MAAM,IAAI,MAAM;EAChB,MAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,MAAM,OAAO,OAAO,CAAC;EACjE,QAAQ;CACT;CACA,MAAM,kBAAkB,SAAS;EAChC,MAAM,IAAI,MAAM;EAChB,MAAM,KAAK,gBAAgB,MAAM,MAAM,KAAK,MAAM,OAAO,OAAO,CAAC;EACjE,QAAQ;CACT;CAEA,IAAI;CACJ,OAAO,MAAM,SAAS;EACrB,IAAI,SAAS;EACb,OAAO,MAAM,WAAW,MAAM,EAAE,CAAC,UAChC,KAAK;EAEN,IAAI,WAAW,GACd,IAAI,WAAW,GAAG;GAEjB,IAAI,IAAI,eAAe;IACtB,SAAS,IAAI;IACb,SAAS;IACT,SAAS;IACT,OAAO;IACP,OAAO;GACR;GACA,KAAK,IAAI,UAAU,QAAQ,YAAY,GAAG,WAAW,GACpD,eAAe,MAAM,QAAQ,CAAC,EAAE;EAElC,OAAO,IAAI,MAAM,SAAS;GAEzB,MAAM,OAAO,IAAI,SAAS,gBAAgB,SAAS,gBAAgB;GACnE,KAAK,IAAI,UAAU,QAAQ,YAAY,MAAM,WAAW,GACvD,eAAe,MAAM,QAAQ,CAAC,EAAE;EAElC,OAAO;GAEN,MAAM,UAAU,IAAI;GACpB,IAAI,UAAU,gBAAgB;IAC7B,MAAM,OAAO,SAAS;IACtB,KAAK,IAAI,UAAU,QAAQ,YAAY,MAAM,WAAW,GACvD,eAAe,MAAM,QAAQ,CAAC,EAAE;IAEjC,MAAM,cAAc,gBAAgB,QAAQ,MAAM,QAAQ,MAAM,OAAO;IACvE,aAAa,MAAM;IACnB,MAAM,KAAK,EAAE;IACb,MAAM,QAAQ,UAAU;IACxB,SAAS,OAAO;IAChB,SAAS,OAAO;IAChB,OAAO;IACP,OAAO;IACP,KAAK,IAAI,UAAU,IAAI,eAAe,YAAY,GAAG,WAAW,GAC/D,eAAe,MAAM,QAAQ,CAAC,EAAE;GAElC,OACC,KAAK,IAAI,UAAU,QAAQ,YAAY,GAAG,WAAW,GACpD,eAAe,MAAM,QAAQ,CAAC,EAAE;EAGnC;EAED,OAAO,MAAM,WAAW,MAAM,EAAE,CAAC,WAAoB;GACpD,eAAe,MAAM,EAAE,CAAC,EAAE;GAC1B,KAAK;EACN;EACA,OAAO,MAAM,WAAW,MAAM,EAAE,CAAC,UAAoB;GACpD,eAAe,MAAM,EAAE,CAAC,EAAE;GAC1B,KAAK;EACN;CACD;CACA,IAAI,UACH,MAAM,cAAc,gBAAgB,QAAQ,MAAM,QAAQ,MAAM,OAAO;CAExE,OAAO,MAAM,KAAK,IAAI;AACvB;AAKA,SAAS,uBAAuB,OAAO,SAAS;CAC/C,OAAO,MAAM,KAAK,MAAM,GAAG,UAAU;EACpC,MAAM,OAAO,KAAK;EAClB,MAAM,gBAAgB,MAAM,KAAK,MAAM,MAAM,SAAS;EACtD,QAAQ,KAAK,IAAb;GACC,SAAkB,OAAO,gBAAgB,MAAM,eAAe,OAAO;GACrE,QAAkB,OAAO,gBAAgB,MAAM,eAAe,OAAO;GACrE,SAAS,OAAO,gBAAgB,MAAM,eAAe,OAAO;EAC7D;CACD,CAAC,CAAC,CAAC,KAAK,IAAI;AACb;AAEA,MAAM,WAAW,WAAW;AAC5B,MAAM,uBAAuB;AAC7B,MAAM,kCAAkC;AACxC,SAAS,oBAAoB;CAC5B,OAAO;EACN,aAAa;EACb,QAAQA,EAAE;EACV,YAAY;EACZ,aAAa;EACb,QAAQA,EAAE;EACV,YAAY;EACZ,aAAaA,EAAE;EACf,8BAA8B;EAC9B,aAAaA,EAAE;EACf,iBAAiB;EACjB,8BAA8B;EAC9B,aAAa;EACb,cAAc;EACd,iCAAiC;EACjC,QAAQ;EACR,qBAAqB;EACrB,qBAAqB;EACrB,YAAYA,EAAE;EACd,qBAAqB;EACrB,mBAAmB;EACnB,oBAAoB;EACpB,yBAAyB;CAC1B;AACD;AACA,SAAS,eAAe,aAAa;CACpC,OAAO,eAAe,OAAO,gBAAgB,aAAa,cAAc;AACzE;AACA,SAAS,gBAAgB,cAAc;CACtC,OAAO,OAAO,iBAAiB,YAAY,OAAO,cAAc,YAAY,KAAK,gBAAgB,IAAI,eAAe;AACrH;AAEA,SAAS,qBAAqB,UAAU,CAAC,GAAG;CAC3C,OAAO;EACN,GAAG,kBAAkB;EACrB,GAAG;EACH,aAAa,eAAe,QAAQ,WAAW;EAC/C,cAAc,gBAAgB,QAAQ,YAAY;CACnD;AACD;AAEA,SAAS,cAAc,OAAO;CAC7B,OAAO,MAAM,WAAW,KAAK,MAAM,EAAE,CAAC,WAAW;AAClD;AACA,SAAS,aAAa,OAAO;CAC5B,IAAI,IAAI;CACR,IAAI,IAAI;CACR,MAAM,SAAS,SAAS;EACvB,QAAQ,KAAK,IAAb;GACC;IACC,KAAK;IACL;GACD;IACC,KAAK;IACL;EACF;CACD,CAAC;CACD,OAAO;EACN;EACA;CACD;AACD;AACA,SAAS,gBAAgB,EAAE,aAAa,QAAQ,YAAY,aAAa,QAAQ,YAAY,qBAAqB,uBAAuB,cAAc;CACtJ,IAAI,qBACH,OAAO;CAER,IAAI,QAAQ;CACZ,IAAI,QAAQ;CACZ,IAAI,qBAAqB;EACxB,MAAM,SAAS,OAAO,aAAa,CAAC;EACpC,MAAM,SAAS,OAAO,aAAa,CAAC;EAEpC,MAAM,yBAAyB,YAAY,SAAS,YAAY;EAChE,MAAM,qBAAqB,IAAI,OAAO,KAAK,IAAI,GAAG,sBAAsB,CAAC;EACzE,MAAM,qBAAqB,IAAI,OAAO,KAAK,IAAI,GAAG,CAAC,sBAAsB,CAAC;EAE1E,MAAM,oBAAoB,OAAO,SAAS,OAAO;EACjD,MAAM,gBAAgB,IAAI,OAAO,KAAK,IAAI,GAAG,iBAAiB,CAAC;EAC/D,MAAM,gBAAgB,IAAI,OAAO,KAAK,IAAI,GAAG,CAAC,iBAAiB,CAAC;EAChE,QAAQ,GAAG,mBAAmB,IAAI,WAAW,GAAG,gBAAgB;EAChE,QAAQ,GAAG,mBAAmB,IAAI,WAAW,GAAG,gBAAgB;CACjE;CACA,MAAM,IAAI,GAAG,WAAW,GAAG,cAAc;CACzC,MAAM,IAAI,GAAG,WAAW,GAAG,cAAc;CACzC,OAAO,GAAG,OAAO,CAAC,EAAE,IAAI,OAAO,CAAC,EAAE;AACnC;AACA,SAAS,eAAe,OAAO,WAAW,SAAS;CAClD,OAAO,gBAAgB,SAAS,aAAa,KAAK,CAAC,KAAK,QAAQ,SAAS,uBAAuB,OAAO,OAAO,IAAI,yBAAyB,OAAO,OAAO,MAAM,YAAY,QAAQ,wBAAwB,KAAK,QAAQ,oBAAoB,IAAI;AACjP;AAEA,SAAS,iBAAiB,QAAQ,QAAQ,SAAS;CAClD,MAAM,oBAAoB,qBAAqB,OAAO;CACtD,MAAM,CAAC,OAAO,aAAa,aAAa,cAAc,MAAM,IAAI,CAAC,IAAI,QAAQ,cAAc,MAAM,IAAI,CAAC,IAAI,QAAQ,iBAAiB;CACnI,OAAO,eAAe,OAAO,WAAW,iBAAiB;AAC1D;AAIA,SAAS,kBAAkB,eAAe,eAAe,eAAe,eAAe,SAAS;CAC/F,IAAI,cAAc,aAAa,KAAK,cAAc,aAAa,GAAG;EACjE,gBAAgB,CAAC;EACjB,gBAAgB,CAAC;CAClB;CACA,IAAI,cAAc,aAAa,KAAK,cAAc,aAAa,GAAG;EACjE,gBAAgB,CAAC;EACjB,gBAAgB,CAAC;CAClB;CACA,IAAI,cAAc,WAAW,cAAc,UAAU,cAAc,WAAW,cAAc,QAE3F,OAAO,iBAAiB,eAAe,eAAe,OAAO;CAE9D,MAAM,CAAC,OAAO,aAAa,aAAa,eAAe,eAAe,OAAO;CAE7E,IAAI,SAAS;CACb,IAAI,SAAS;CACb,MAAM,SAAS,SAAS;EACvB,QAAQ,KAAK,IAAb;GACC;IACC,KAAK,KAAK,cAAc;IACxB,UAAU;IACV;GACD;IACC,KAAK,KAAK,cAAc;IACxB,UAAU;IACV;GACD;IACC,KAAK,KAAK,cAAc;IACxB,UAAU;IACV,UAAU;EACZ;CACD,CAAC;CACD,OAAO,eAAe,OAAO,WAAW,qBAAqB,OAAO,CAAC;AACtE;AAEA,SAAS,aAAa,QAAQ,QAAQ,SAAS;CAC9C,MAAM,WAAW,SAAS,qBAAqB;CAC/C,MAAM,oBAAoB,KAAK,IAAI,KAAK,MAAM,SAAS,qBAAqB,CAAC,GAAG,CAAC;CACjF,MAAM,UAAU,WAAW,KAAK,IAAI,OAAO,QAAQ,iBAAiB,IAAI,OAAO;CAC/E,MAAM,UAAU,WAAW,KAAK,IAAI,OAAO,QAAQ,iBAAiB,IAAI,OAAO;CAC/E,MAAM,YAAY,YAAY,OAAO,UAAU,YAAY,OAAO;CAClE,MAAM,YAAY,QAAQ,WAAW,OAAO,YAAY,OAAO;CAC/D,MAAM,QAAQ,CAAC;CACf,IAAI,SAAS;CACb,IAAI,SAAS;CACb,MAAM,oBAAoB,SAAS,SAAS,YAAY;EACvD,OAAO,WAAW,SAAS,UAAU,GACpC,MAAM,KAAK,IAAI,SAAkB,OAAO,OAAO,CAAC;EAEjD,OAAO,WAAW,SAAS,UAAU,GACpC,MAAM,KAAK,IAAI,QAAkB,OAAO,OAAO,CAAC;EAEjD,OAAO,YAAY,GAAG,WAAW,GAAG,UAAU,GAAG,UAAU,GAC1D,MAAM,KAAK,IAAI,QAAiB,OAAO,OAAO,CAAC;CAEjD;CACA,cAAc,SAAS,SAAS,UAAU,gBAAgB;CAE1D,OAAO,WAAW,SAAS,UAAU,GACpC,MAAM,KAAK,IAAI,SAAkB,OAAO,OAAO,CAAC;CAEjD,OAAO,WAAW,SAAS,UAAU,GACpC,MAAM,KAAK,IAAI,QAAkB,OAAO,OAAO,CAAC;CAEjD,OAAO,CAAC,OAAO,SAAS;AACzB;AAIA,SAAS,QAAQ,OAAO;CACvB,IAAI,UAAU,QACb,OAAO;MACD,IAAI,UAAU,MACpB,OAAO;MACD,IAAI,MAAM,QAAQ,KAAK,GAC7B,OAAO;MACD,IAAI,OAAO,UAAU,WAC3B,OAAO;MACD,IAAI,OAAO,UAAU,YAC3B,OAAO;MACD,IAAI,OAAO,UAAU,UAC3B,OAAO;MACD,IAAI,OAAO,UAAU,UAC3B,OAAO;MACD,IAAI,OAAO,UAAU,UAC3B,OAAO;MACD,IAAI,OAAO,UAAU,UAAU;EACrC,IAAI,SAAS,MACZ;OAAI,MAAM,gBAAgB,QACzB,OAAO;QACD,IAAI,MAAM,gBAAgB,KAChC,OAAO;QACD,IAAI,MAAM,gBAAgB,KAChC,OAAO;QACD,IAAI,MAAM,gBAAgB,MAChC,OAAO;EACR;EAED,OAAO;CACR,OAAO,IAAI,OAAO,UAAU,UAC3B,OAAO;CAER,MAAM,IAAI,MAAM,0BAA0B,OAAO;AAClD;AAGA,SAAS,iBAAiB,QAAQ;CACjC,OAAO,OAAO,SAAS,MAAM,IAAI,SAAS;AAC3C;AACA,SAAS,YAAY,GAAG,GAAG,SAAS;CACnC,MAAM,WAAW,SAAS,qBAAqB;CAC/C,MAAM,oBAAoB,KAAK,IAAI,KAAK,MAAM,SAAS,qBAAqB,CAAC,GAAG,CAAC;CACjF,IAAI,UAAU,EAAE;CAChB,IAAI,UAAU,EAAE;CAChB,IAAI,UAAU;EACb,MAAM,iBAAiB,EAAE,SAAS,IAAI;EACtC,MAAM,iBAAiB,EAAE,SAAS,IAAI;EACtC,MAAM,iBAAiB,iBAAiB,CAAC;EACzC,MAAM,iBAAiB,iBAAiB,CAAC;EAEzC,MAAM,KAAK,iBAAiB,GAAG,EAAE,MAAM,gBAAgB,iBAAiB,CAAC,CAAC,KAAK,cAAc,EAAE,MAAM;EACrG,MAAM,KAAK,iBAAiB,GAAG,EAAE,MAAM,gBAAgB,iBAAiB,CAAC,CAAC,KAAK,cAAc,EAAE,MAAM;EACrG,UAAU,GAAG;EACb,UAAU,GAAG;CACd;CACA,MAAM,YAAY,YAAY,EAAE,UAAU,YAAY,EAAE;CACxD,MAAM,YAAY,QAAQ,WAAW,EAAE,YAAY,EAAE;CACrD,IAAI,SAAS;CACb,IAAI,SAAS;CACb,MAAM,QAAQ,CAAC;CACf,MAAM,oBAAoB,SAAS,SAAS,YAAY;EACvD,IAAI,WAAW,SACd,MAAM,KAAK,IAAI,SAAkB,EAAE,MAAM,QAAQ,OAAO,CAAC,CAAC;EAE3D,IAAI,WAAW,SACd,MAAM,KAAK,IAAI,QAAkB,EAAE,MAAM,QAAQ,OAAO,CAAC,CAAC;EAE3D,SAAS,UAAU;EACnB,SAAS,UAAU;EACnB,MAAM,KAAK,IAAI,QAAiB,EAAE,MAAM,SAAS,MAAM,CAAC,CAAC;CAC1D;CACA,cAAc,SAAS,SAAS,UAAU,gBAAgB;CAE1D,IAAI,WAAW,SACd,MAAM,KAAK,IAAI,SAAkB,EAAE,MAAM,MAAM,CAAC,CAAC;CAElD,IAAI,WAAW,SACd,MAAM,KAAK,IAAI,QAAkB,EAAE,MAAM,MAAM,CAAC,CAAC;CAElD,OAAO,CAAC,OAAO,SAAS;AACzB;AAMA,SAAS,yBAAyB,IAAI,OAAO,aAAa;CACzD,OAAO,MAAM,QAAQ,SAAS,SAAS,WAAW,KAAK,WAAoB,KAAK,KAAK,KAAK,OAAO,MAAM,KAAK,EAAE,CAAC,WAAW,IAAI,YAAY,KAAK,EAAE,IAAI,KAAK,EAAE;AAC7J;AAEA,IAAM,eAAN,MAAmB;CAClB;CACA;CACA;CACA;CACA,YAAY,IAAI,aAAa;EAC5B,KAAK,KAAK;EACV,KAAK,OAAO,CAAC;EACb,KAAK,QAAQ,CAAC;EACd,KAAK,cAAc;CACpB;CACA,cAAc,WAAW;EACxB,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,SAAS,CAAC;CAC3C;CACA,WAAW;EAMV,KAAK,MAAM,KAAK,KAAK,KAAK,WAAW,IAAI,IAAI,KAAK,KAAK,IAAI,yBAAyB,KAAK,IAAI,KAAK,MAAM,KAAK,WAAW,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC,OAAO,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,EAAE,CAAC,EAAE,CAAC;EAC5M,KAAK,KAAK,SAAS;CACpB;CACA,cAAc;EACb,OAAO,KAAK,KAAK,WAAW;CAC7B;CAEA,SAAS,MAAM;EACd,KAAK,KAAK,KAAK,IAAI;CACpB;CAEA,MAAM,MAAM;EACX,MAAM,SAAS,KAAK;EACpB,IAAI,OAAO,SAAS,IAAI,GAAG;GAC1B,MAAM,aAAa,OAAO,MAAM,IAAI;GACpC,MAAM,QAAQ,WAAW,SAAS;GAClC,WAAW,SAAS,WAAW,MAAM;IACpC,IAAI,IAAI,OAAO;KAGd,KAAK,cAAc,SAAS;KAC5B,KAAK,SAAS;IACf,OAAO,IAAI,UAAU,WAAW,GAI/B,KAAK,cAAc,SAAS;GAE9B,CAAC;EACF,OAEC,KAAK,SAAS,IAAI;CAEpB;CAEA,YAAY,OAAO;EAClB,IAAI,CAAC,KAAK,YAAY,GACrB,KAAK,SAAS;EAEf,MAAM,KAAK,GAAG,KAAK,KAAK;EACxB,KAAK,MAAM,SAAS;CACrB;AACD;AAEA,IAAM,eAAN,MAAmB;CAClB;CACA;CACA;CACA,YAAY,cAAc,cAAc;EACvC,KAAK,eAAe;EACpB,KAAK,eAAe;EACpB,KAAK,QAAQ,CAAC;CACf;CACA,mBAAmB,MAAM;EACxB,KAAK,MAAM,KAAK,IAAI;CACrB;CACA,oBAAoB,MAAM;EACzB,MAAM,cAAc,KAAK,EAAE,CAAC,WAAW;EAEvC,IAAI,CAAC,eAAe,KAAK,aAAa,YAAY,GACjD,KAAK,aAAa,SAAS,IAAI;EAEhC,IAAI,CAAC,eAAe,KAAK,aAAa,YAAY,GACjD,KAAK,aAAa,SAAS,IAAI;CAEjC;CACA,mBAAmB;EAClB,KAAK,aAAa,YAAY,KAAK,KAAK;EACxC,KAAK,aAAa,YAAY,KAAK,KAAK;CACzC;CAEA,MAAM,MAAM;EACX,MAAM,KAAK,KAAK;EAChB,MAAM,SAAS,KAAK;EACpB,IAAI,OAAO,SAAS,IAAI,GAAG;GAC1B,MAAM,aAAa,OAAO,MAAM,IAAI;GACpC,MAAM,QAAQ,WAAW,SAAS;GAClC,WAAW,SAAS,WAAW,MAAM;IACpC,IAAI,MAAM,GAAG;KACZ,MAAM,UAAU,IAAI,KAAK,IAAI,SAAS;KACtC,IAAI,KAAK,aAAa,YAAY,KAAK,KAAK,aAAa,YAAY,GAAG;MAGvE,KAAK,iBAAiB;MACtB,KAAK,mBAAmB,OAAO;KAChC,OAAO;MAGN,KAAK,oBAAoB,OAAO;MAChC,KAAK,iBAAiB;KACvB;IACD,OAAO,IAAI,IAAI,OAEd,KAAK,mBAAmB,IAAI,KAAK,IAAI,SAAS,CAAC;SACzC,IAAI,UAAU,WAAW,GAI/B,KAAK,oBAAoB,IAAI,KAAK,IAAI,SAAS,CAAC;GAElD,CAAC;EACF,OAIC,KAAK,oBAAoB,IAAI;CAE/B;CAEA,WAAW;EACV,KAAK,iBAAiB;EACtB,OAAO,KAAK;CACb;AACD;AAWA,SAAS,gBAAgB,OAAO,aAAa;CAC5C,MAAM,eAAe,IAAI,iBAA0B,WAAW;CAC9D,MAAM,eAAe,IAAI,gBAA0B,WAAW;CAC9D,MAAM,eAAe,IAAI,aAAa,cAAc,YAAY;CAChE,MAAM,SAAS,SAAS;EACvB,QAAQ,KAAK,IAAb;GACC;IACC,aAAa,MAAM,IAAI;IACvB;GACD;IACC,aAAa,MAAM,IAAI;IACvB;GACD,SAAS,aAAa,MAAM,IAAI;EACjC;CACD,CAAC;CACD,OAAO,aAAa,SAAS;AAC9B;AAEA,SAAS,cAAc,OAAO,aAAa;CAC1C,IAAI,aAAa;EAEhB,MAAM,QAAQ,MAAM,SAAS;EAC7B,OAAO,MAAM,MAAM,MAAM,MAAM,KAAK,aAAsB,MAAM,SAAS,KAAK,OAAO,KAAK;CAC3F;CACA,OAAO,MAAM,MAAM,SAAS,KAAK,QAAiB;AACnD;AAGA,SAAS,mBAAmB,GAAG,GAAG,SAAS;CAC1C,IAAI,MAAM,KAAK,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG;EAChD,MAAM,cAAc,EAAE,SAAS,IAAI,KAAK,EAAE,SAAS,IAAI;EAEvD,MAAM,CAAC,OAAO,aAAa,eAAe,cAAc,GAAG,EAAE,MAAM,GAAG,cAAc,GAAG,EAAE,MAAM,GAAG,MAAM,OAAO;EAC/G,IAAI,cAAc,OAAO,WAAW,GAAG;GACtC,MAAM,oBAAoB,qBAAqB,OAAO;GAEtD,OAAO,eADO,gBAAgB,OAAO,kBAAkB,WAC7B,GAAG,WAAW,iBAAiB;EAC1D;CACD;CAEA,OAAO,iBAAiB,EAAE,MAAM,IAAI,GAAG,EAAE,MAAM,IAAI,GAAG,OAAO;AAC9D;AAGA,SAAS,eAAe,GAAG,GAAG,SAAS,SAAS;CAC/C,MAAM,CAAC,OAAO,aAAa,YAAY,GAAG,GAAG,OAAO;CACpD,IAAI,SACH,qBAAqB,KAAK;CAE3B,OAAO,CAAC,OAAO,SAAS;AACzB;AAEA,SAAS,iBAAiB,SAAS,SAAS;CAC3C,MAAM,EAAE,gBAAgB,qBAAqB,OAAO;CACpD,OAAO,YAAY,OAAO;AAC3B;AACA,MAAM,EAAE,mBAAmB,eAAe,YAAY,WAAW,cAAc,uBAAuB;AACtG,MAAM,UAAU;CACf;CACA;CACA;CACA;CACA;CACA;CACA,QAAQ;AACT;AACA,MAAM,iBAAiB;CACtB,UAAU;CACV,SAAS;AACV;AACA,MAAM,0BAA0B;CAC/B,YAAY;CACZ,UAAU;CACV,SAAS;AACV;AACA,MAAM,oBAAoB,GAAG,MAAM;;;;;;;AASnC,SAAS,KAAK,GAAG,GAAG,SAAS,WAAW,kBAAkB;CACzD,IAAI,OAAO,GAAG,GAAG,CAAC,GACjB,OAAO;CAER,MAAM,QAAQ,QAAQ,CAAC;CACvB,IAAI,eAAe;CACnB,IAAI,iBAAiB;CACrB,IAAI,UAAU,YAAY,OAAO,EAAE,oBAAoB,YAAY;EAClE,IAAI,EAAE,aAAa,OAAO,IAAI,wBAAwB,GAErD;EAED,IAAI,OAAO,EAAE,oBAAoB,YAEhC;EAED,eAAe,EAAE,gBAAgB;EAGjC,iBAAiB,iBAAiB;CACnC;CACA,IAAI,iBAAiB,QAAQ,CAAC,GAAG;EAChC,MAAM,EAAE,aAAa,QAAQ,YAAY,aAAa,QAAQ,eAAe,qBAAqB,OAAO;EACzG,MAAM,gBAAgB,iBAAiB,yBAAyB,OAAO;EACvE,IAAI,WAAW,OAAO,GAAG,aAAa;EACtC,IAAI,WAAW,OAAO,GAAG,aAAa;EAKtC,MAAM,aAAa;EACnB,SAAS,SAAS,GAAG;GACpB,OAAO,EAAE,UAAU,aAAa,IAAI,GAAG,EAAE,MAAM,GAAG,UAAU,EAAE;EAC/D;EACA,WAAW,SAAS,YAAY,SAAS,QAAQ,CAAC;EAClD,WAAW,SAAS,UAAU,SAAS,QAAQ,CAAC;EAGhD,OAAO,GAAG,GAFO,OAAO,GAAG,WAAW,GAAG,YAAY,EAAE,EAAE,IAAI,WAE7C,MAAM,GADL,OAAO,GAAG,WAAW,GAAG,YAAY,EAAE,EAAE,IAAI;CAE9D;CACA,IAAI,gBACH;CAED,QAAQ,OAAR;EACC,KAAK,UAAU,OAAO,iBAAiB,EAAE,MAAM,IAAI,GAAG,EAAE,MAAM,IAAI,GAAG,OAAO;EAC5E,KAAK;EACL,KAAK,UAAU,OAAO,iBAAiB,GAAG,GAAG,SAAS,QAAQ;EAC9D,KAAK,OAAO,OAAO,eAAe,QAAQ,CAAC,GAAG,QAAQ,CAAC,GAAG,SAAS,QAAQ;EAC3E,KAAK,OAAO,OAAO,eAAe,QAAQ,CAAC,GAAG,QAAQ,CAAC,GAAG,SAAS,QAAQ;EAC3E,SAAS,OAAO,eAAe,GAAG,GAAG,SAAS,QAAQ;CACvD;AACD;AACA,SAAS,eAAe,QAAQ;CAC/B,QAAQ,SAAS,qBAAqB;EACrC,OAAO,WAAW;EAClB,OAAO;CACR;AACD;AACA,SAAS,iBAAiB,GAAG,GAAG,SAAS,WAAW,kBAAkB;CACrE,MAAM,UAAU,SAAS,YAAY,OAAO,GAAG,cAAc,CAAC;CAC9D,MAAM,UAAU,SAAS,UAAU,OAAO,GAAG,cAAc,CAAC;CAC5D,OAAO,YAAY,UAAU,KAAK,iBAAiB,QAAQ,MAAM,IAAI,GAAG,QAAQ,MAAM,IAAI,GAAG,OAAO;AACrG;AACA,SAAS,QAAQ,KAAK;CACrB,OAAO,IAAI,IAAI,MAAM,KAAK,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;AAChD;AACA,SAAS,QAAQ,KAAK;CACrB,OAAO,IAAI,IAAI,MAAM,KAAK,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC;AAC/C;AACA,SAAS,eAAe,GAAG,GAAG,SAAS,WAAW,kBAAkB;CACnE,IAAI;CACJ,IAAI,YAAY;CAChB,IAAI;EAEH,aAAa,qBAAqB,GAAG,GADf,iBAAiB,gBAAgB,OACH,GAAG,SAAS,QAAQ;CACzE,QAAQ;EACP,YAAY;CACb;CACA,MAAM,gBAAgB,iBAAiB,iBAAiB,OAAO;CAG/D,IAAI,eAAe,UAAa,eAAe,eAAe;EAE7D,aAAa,qBAAqB,GAAG,GADf,iBAAiB,yBAAyB,OACZ,GAAG,SAAS,QAAQ;EACxE,IAAI,eAAe,iBAAiB,CAAC,WACpC,aAAa,GAAG,iBAAiB,iBAAiB,OAAO,EAAE,MAAM;CAEnE;CACA,OAAO;AACR;AACA,SAAS,wBAAwB,SAAS;CACzC,OAAO,iBAAiB,gBAAgB,OAAO;AAChD;AACA,SAAS,iBAAiB,eAAe,SAAS;CACjD,MAAM,EAAE,aAAa,qBAAqB,aAAa,qBAAqB,OAAO;CACnF,OAAO;EACN,GAAG;EACH;EACA;EACA,UAAU,YAAY,cAAc;CACrC;AACD;AACA,SAAS,qBAAqB,GAAG,GAAG,eAAe,SAAS,WAAW,kBAAkB;CACxF,MAAM,0BAA0B;EAC/B,GAAG;EACH,QAAQ;CACT;CACA,MAAM,WAAW,OAAO,GAAG,uBAAuB;CAClD,MAAM,WAAW,OAAO,GAAG,uBAAuB;CAClD,IAAI,aAAa,UAChB,OAAO,iBAAiB,iBAAiB,OAAO;MAC1C;EACN,MAAM,WAAW,SAAS,YAAY,OAAO,GAAG,aAAa,CAAC;EAC9D,MAAM,WAAW,SAAS,UAAU,OAAO,GAAG,aAAa,CAAC;EAC5D,OAAO,kBAAkB,SAAS,MAAM,IAAI,GAAG,SAAS,MAAM,IAAI,GAAG,SAAS,MAAM,IAAI,GAAG,SAAS,MAAM,IAAI,GAAG,OAAO;CACzH;AACD;AACA,MAAM,yBAAyB;AAC/B,SAAS,oBAAoB,MAAM;CAElC,OADa,UAAU,IACb,MAAM,YAAY,OAAO,KAAK,oBAAoB;AAC7D;AACA,SAAS,cAAc,MAAM,MAAM;CAClC,MAAM,WAAW,UAAU,IAAI;CAE/B,OAAO,aADU,UAAU,IACA,MAAM,aAAa,YAAY,aAAa;AACxE;AACA,SAAS,qBAAqB,UAAU,UAAU,SAAS,QAAQ;CAClE,MAAM,EAAE,aAAa,gBAAgB,qBAAqB,OAAO;CACjE,IAAI,OAAO,aAAa,YAAY,OAAO,aAAa,YAAY,SAAS,SAAS,KAAK,SAAS,SAAS,KAAK,SAAS,UAAU,0BAA0B,SAAS,UAAU,0BAA0B,aAAa,UAAU;EAClO,IAAI,SAAS,SAAS,IAAI,KAAK,SAAS,SAAS,IAAI,GACpD,OAAO,mBAAmB,UAAU,UAAU,OAAO;EAEtD,MAAM,CAAC,SAAS,eAAe,UAAU,UAAU,IAAI;EACvD,MAAM,gBAAgB,MAAM,MAAM,SAAS,KAAK,QAAiB;EACjE,MAAM,aAAa,gBAAgB,aAAa,WAAW;EAG3D,OAAO,GAFc,WAAW,WAAW,IAAI,cAAc,8BAA8B,WAAoB,aAAa,CAAC,EAEtG,IADF,WAAW,WAAW,IAAI,cAAc,8BAA8B,UAAoB,aAAa,CAAC;CAE9H;CAEA,MAAM,iBAAiB,UAAU,UAAU,EAAE,eAAe,KAAK,CAAC;CAElE,MAAM,EAAE,kBAAkB,mBAAmB,yBADtB,UAAU,UAAU,EAAE,eAAe,KAAK,CACkB,GAAG,cAAc;CAGpG,OADmB,KAAK,kBAAkB,gBAAgB,SADzC,SAAS,eAAe,MAAM,IAAI,gBAEnC;AAUjB;AACA,SAAS,yBAAyB,QAAQ,UAAU,iCAAiB,IAAI,QAAQ,GAAG,mCAAmB,IAAI,QAAQ,GAAG;CAErH,IAAI,kBAAkB,SAAS,oBAAoB,SAAS,OAAO,OAAO,UAAU,eAAe,OAAO,SAAS,UAAU,aAAa;EACzI,OAAO,OAAO;EACd,OAAO;GACN,gBAAgB;GAChB,kBAAkB;EACnB;CACD;CACA,IAAI,CAAC,cAAc,QAAQ,QAAQ,GAClC,OAAO;EACN,gBAAgB;EAChB,kBAAkB;CACnB;CAED,IAAI,eAAe,IAAI,MAAM,KAAK,iBAAiB,IAAI,QAAQ,GAC9D,OAAO;EACN,gBAAgB;EAChB,kBAAkB;CACnB;CAED,eAAe,IAAI,MAAM;CACzB,iBAAiB,IAAI,QAAQ;CAC7B,iBAAiB,QAAQ,CAAC,CAAC,SAAS,QAAQ;EAC3C,MAAM,gBAAgB,SAAS;EAC/B,MAAM,cAAc,OAAO;EAC3B,IAAI,oBAAoB,aAAa,GACpC;OAAI,cAAc,gBAAgB,WAAW,GAG5C,SAAS,OAAO;QACV,IAAI,YAAY,iBAAiB,cAAc,WAAW,UAAa,cAAc,aAAa,cAAc,MAAM,GAAG;IAG/H,MAAM,WAAW,yBAAyB,aAAa,cAAc,QAAQ,gBAAgB,gBAAgB;IAC7G,OAAO,OAAO,SAAS;IACvB,SAAS,OAAO,SAAS;GAC1B;SACM,IAAI,oBAAoB,WAAW,GACzC;OAAI,YAAY,gBAAgB,aAAa,GAC5C,OAAO,OAAO;QACR,IAAI,YAAY,eAAe,YAAY,WAAW,UAAa,cAAc,YAAY,QAAQ,aAAa,GAAG;IAC3H,MAAM,WAAW,yBAAyB,YAAY,QAAQ,eAAe,gBAAgB,gBAAgB;IAC7G,OAAO,OAAO,SAAS;IACvB,SAAS,OAAO,SAAS;GAC1B;SACM,IAAI,cAAc,aAAa,aAAa,GAAG;GACrD,MAAM,WAAW,yBAAyB,aAAa,eAAe,gBAAgB,gBAAgB;GACtG,OAAO,OAAO,SAAS;GACvB,SAAS,OAAO,SAAS;EAC1B;CACD,CAAC;CACD,OAAO;EACN,gBAAgB;EAChB,kBAAkB;CACnB;AACD;AACA,SAAS,gBAAgB,GAAG,SAAS;CACpC,MAAM,YAAY,QAAQ,QAAQ,KAAK,WAAW,OAAO,SAAS,MAAM,OAAO,SAAS,KAAK,CAAC;CAC9F,QAAQ,WAAW,GAAG,OAAO,IAAI,IAAI,OAAO,YAAY,OAAO,MAAM;AACtE;AACA,MAAM,eAAe;AACrB,SAAS,sBAAsB,MAAM;CACpC,OAAO,KAAK,QAAQ,WAAW,WAAW,aAAa,OAAO,OAAO,MAAM,CAAC;AAC7E;AACA,SAAS,cAAc,QAAQ;CAC9B,OAAOA,EAAE,IAAI,sBAAsB,UAAU,MAAM,CAAC,CAAC;AACtD;AACA,SAAS,cAAc,OAAO;CAC7B,OAAOA,EAAE,MAAM,sBAAsB,UAAU,KAAK,CAAC,CAAC;AACvD;AACA,SAAS,8BAA8B,OAAO,IAAI,eAAe;CAChE,OAAO,MAAM,QAAQ,SAAS,SAAS,WAAW,KAAK,WAAoB,KAAK,KAAK,KAAK,OAAO,KAAK,gBAAgBA,EAAE,QAAQ,KAAK,EAAE,IAAI,KAAK,KAAK,KAAK,EAAE;AAC7J"}

package/esm/node_modules/@vitest/utils/dist/display.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"display.mjs","names":[],"sources":["../../../../../../../../../../node_modules/@vitest/utils/dist/display.js"],"sourcesContent":["import { plugins, createDOMElementFilter, format as format$1 } from '@vitest/pretty-format';\n\nconst 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};\nconst 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};\nconst truncator = '…';\nfunction colorise(value, styleType) {\n const color = ansiColors[styles[styleType]] || ansiColors[styleType] || '';\n if (!color) {\n return String(value);\n }\n return `\\u001b[${color[0]}m${String(value)}\\u001b[${color[1]}m`;\n}\nfunction normaliseOptions({ showHidden = false, depth = 2, colors = false, customInspect = true, showProxy = false, maxArrayLength = Infinity, breakLength = Infinity, seen = [], \n// eslint-disable-next-line no-shadow\ntruncate = Infinity, stylize = String, } = {}, inspect) {\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(truncate),\n seen,\n inspect,\n stylize,\n };\n if (options.colors) {\n options.stylize = colorise;\n }\n return options;\n}\nfunction isHighSurrogate(char) {\n return char >= '\\ud800' && char <= '\\udbff';\n}\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// eslint-disable-next-line complexity\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 // If there is more than one remaining we need to account for a separator of `, `\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 this is the last element, and adding it would\n // take us over length, but adding the truncator wouldn't - then break now\n if (last && nextLength > originalLength && output.length + truncated.length <= originalLength) {\n break;\n }\n // If this isn't the last or second to last element to scan,\n // but the string is already over length then break here\n if (!last && !secondToLast && truncatedLength > originalLength) {\n break;\n }\n // Peek at the next string to determine if we should\n // break early before adding this item to the output\n peek = last ? '' : inspectItem(list[i + 1], options) + (secondToLast ? '' : separator);\n // If we have one element left, but this element and\n // the next takes over length, the break early\n if (!last && secondToLast && truncatedLength > originalLength && nextLength + peek.length > originalLength) {\n break;\n }\n output += string;\n // If the next element takes us to length -\n // but there are more after that, then we should truncate now\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}\nfunction quoteComplexKey(key) {\n if (key.match(/^[a-zA-Z_][a-zA-Z_0-9]*$/)) {\n return key;\n }\n return JSON.stringify(key)\n .replace(/'/g, \"\\\\'\")\n .replace(/\\\\\"/g, '\"')\n .replace(/(^\"|\"$)/g, \"'\");\n}\nfunction inspectProperty([key, value], options) {\n options.truncate -= 2;\n if (typeof key === 'string') {\n key = quoteComplexKey(key);\n }\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\nfunction inspectArray(array, options) {\n // Object.keys will always output the Array indices first, so we can slice by\n // `array.length` to get non-index properties\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\nconst getArrayName = (array) => {\n // We need to special case Node.js' Buffers, which report to be Uint8Array\n // @ts-ignore\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};\nfunction inspectTypedArray(array, options) {\n const name = getArrayName(array);\n options.truncate -= name.length + 4;\n // Object.keys will always output the Array indices first, so we can slice by\n // `array.length` to get non-index properties\n const nonIndexProperties = Object.keys(array).slice(array.length);\n if (!array.length && !nonIndexProperties.length)\n return `${name}[]`;\n // As we know TypedArrays only contain Unsigned Integers, we can skip inspecting each one and simply\n // stylise the toString() value of them\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\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 // If we need to - truncate the time portion, but never the date\n return options.stylize(`${date}T${truncate(split[1], options.truncate - date.length - 1)}`, 'date');\n}\n\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\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// IE11 doesn't support `map.entries()`\nfunction mapToEntries(map) {\n const entries = [];\n map.forEach((value, key) => {\n entries.push([key, value]);\n });\n return entries;\n}\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\nconst isNaN = Number.isNaN || (i => i !== i); // eslint-disable-line no-self-compare\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\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\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\n// IE11 doesn't support `Array.from(set)`\nfunction arrayFromSet(set) {\n const values = [];\n set.forEach(value => {\n values.push(value);\n });\n return values;\n}\nfunction inspectSet(set, options) {\n if (set.size === 0)\n return 'Set{}';\n options.truncate -= 7;\n return `Set{ ${inspectList(arrayFromSet(set), options)} }`;\n}\n\nconst stringEscapeChars = new RegExp(\"['\\\\u0000-\\\\u001f\\\\u007f-\\\\u009f\\\\u00ad\\\\u0600-\\\\u0604\\\\u070f\\\\u17b4\\\\u17b5\" +\n '\\\\u200c-\\\\u200f\\\\u2028-\\\\u202f\\\\u2060-\\\\u206f\\\\ufeff\\\\ufff0-\\\\uffff]', 'g');\nconst escapeCharacters = {\n '\\b': '\\\\b',\n '\\t': '\\\\t',\n '\\n': '\\\\n',\n '\\f': '\\\\f',\n '\\r': '\\\\r',\n \"'\": \"\\\\'\",\n '\\\\': '\\\\\\\\',\n};\nconst hex = 16;\nfunction escape(char) {\n return (escapeCharacters[char] ||\n `\\\\u${`0000${char.charCodeAt(0).toString(hex)}`.slice(-4)}`);\n}\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\nfunction inspectSymbol(value) {\n if ('description' in Symbol.prototype) {\n return value.description ? `Symbol(${value.description})` : 'Symbol()';\n }\n return value.toString();\n}\n\nconst getPromiseValue = () => 'Promise{…}';\n\nfunction inspectObject$1(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\nconst 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 // Babel transforms anonymous classes to the name `_class`\n if (!name || name === '_class') {\n name = '<Anonymous Class>';\n }\n options.truncate -= name.length;\n return `${name}${inspectObject$1(value, options)}`;\n}\n\nfunction inspectArguments(args, options) {\n if (args.length === 0)\n return 'Arguments[]';\n options.truncate -= 13;\n return `Arguments[ ${inspectList(args, options)} ]`;\n}\n\nconst 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 inspectObject(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 }\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\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}\nfunction inspectNodeCollection(collection, options) {\n return inspectList(collection, options, inspectNode, '\\n');\n}\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// @ts-ignore (Deno doesn't have Element)\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 truncate = options.truncate;\n let children = inspectNodeCollection(element.children, options);\n if (children && children.length > truncate) {\n children = `${truncator}(${element.children.length})`;\n }\n return `${head}${propertyContents}${headClose}${children}${tail}`;\n}\n\n/* !\n * loupe\n * Copyright(c) 2013 Jake Luer <jake@alogicalparadox.com>\n * MIT Licensed\n */\nconst symbolsSupported = typeof Symbol === 'function' && typeof Symbol.for === 'function';\nconst chaiInspect = symbolsSupported ? Symbol.for('chai/inspect') : '@@chai/inspect';\nconst nodeInspect = Symbol.for('nodejs.util.inspect.custom');\nconst constructorMap = new WeakMap();\nconst stringTagMap = {};\nconst baseTypesMap = {\n undefined: (value, options) => options.stylize('undefined', 'undefined'),\n null: (value, options) => options.stylize('null', 'null'),\n boolean: (value, options) => options.stylize(String(value), 'boolean'),\n Boolean: (value, options) => options.stylize(String(value), '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: getPromiseValue,\n // WeakSet, WeakMap are totally opaque to us\n WeakSet: (value, options) => options.stylize('WeakSet{…}', 'special'),\n WeakMap: (value, options) => options.stylize('WeakMap{…}', 'special'),\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: () => '',\n DataView: () => '',\n ArrayBuffer: () => '',\n Error: inspectObject,\n HTMLCollection: inspectNodeCollection,\n NodeList: inspectNodeCollection,\n};\n// eslint-disable-next-line complexity\nconst inspectCustom = (value, options, type, 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[type]) {\n return stringTagMap[type](value, options);\n }\n return '';\n};\nconst toString = Object.prototype.toString;\n// eslint-disable-next-line complexity\nfunction inspect$1(value, opts = {}) {\n const options = normaliseOptions(opts, inspect$1);\n const { customInspect } = options;\n let type = value === null ? 'null' : typeof value;\n if (type === 'object') {\n type = toString.call(value).slice(8, -1);\n }\n // If it is a base value that we already support, then use Loupe's inspector\n if (type in baseTypesMap) {\n return baseTypesMap[type](value, options);\n }\n // If `options.customInspect` is set to true then try to use the custom inspector\n if (customInspect && value) {\n const output = inspectCustom(value, options, type, inspect$1);\n if (output) {\n if (typeof output === 'string')\n return output;\n return inspect$1(output, options);\n }\n }\n const proto = value ? Object.getPrototypeOf(value) : false;\n // If it's a plain Object then use Loupe's inspector\n if (proto === Object.prototype || proto === null) {\n return inspectObject$1(value, options);\n }\n // Specifically account for HTMLElements\n // @ts-ignore\n if (value && typeof HTMLElement === 'function' && value instanceof HTMLElement) {\n return inspectHTML(value, options);\n }\n if ('constructor' in value) {\n // If it is a class, inspect it like an object but add the constructor name\n if (value.constructor !== Object) {\n return inspectClass(value, options);\n }\n // If it is an object with an anonymous prototype, display it as an object.\n return inspectObject$1(value, options);\n }\n // last chance to check if it's an object\n if (value === Object(value)) {\n return inspectObject$1(value, options);\n }\n // We have run out of options! Just stringify the value\n return options.stylize(String(value), type);\n}\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\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\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) {\n\t\t\treturn false;\n\t\t}\n\t\t// Filter out elements matching the selector\n\t\tif (node.nodeType === ELEMENT_NODE && node.matches) {\n\t\t\ttry {\n\t\t\t\treturn !node.matches(selector);\n\t\t\t} catch {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t};\n}\nconst formatRegExp = /%[sdjifoOc%]/g;\nfunction baseFormat(args, options = {}) {\n\tconst formatArg = (item, inspecOptions) => {\n\t\tif (options.prettifyObject) {\n\t\t\treturn stringify(item, undefined, {\n\t\t\t\tprintBasicPrototype: false,\n\t\t\t\tescapeString: false\n\t\t\t});\n\t\t}\n\t\treturn inspect(item, inspecOptions);\n\t};\n\tif (typeof args[0] !== \"string\") {\n\t\tconst objects = [];\n\t\tfor (let i = 0; i < args.length; i++) {\n\t\t\tobjects.push(formatArg(args[i], {\n\t\t\t\tdepth: 0,\n\t\t\t\tcolors: false\n\t\t\t}));\n\t\t}\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 === \"%%\") {\n\t\t\treturn \"%\";\n\t\t}\n\t\tif (i >= len) {\n\t\t\treturn x;\n\t\t}\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\") {\n\t\t\t\t\treturn `${value.toString()}n`;\n\t\t\t\t}\n\t\t\t\tif (typeof value === \"number\" && value === 0 && 1 / value < 0) {\n\t\t\t\t\treturn \"-0\";\n\t\t\t\t}\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) {\n\t\t\t\t\t\treturn value.toString();\n\t\t\t\t\t}\n\t\t\t\t\treturn formatArg(value, {\n\t\t\t\t\t\tdepth: 0,\n\t\t\t\t\t\tcolors: false\n\t\t\t\t\t});\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\") {\n\t\t\t\t\treturn `${value.toString()}n`;\n\t\t\t\t}\n\t\t\t\tif (typeof value === \"symbol\") {\n\t\t\t\t\treturn \"NaN\";\n\t\t\t\t}\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\") {\n\t\t\t\t\treturn `${value.toString()}n`;\n\t\t\t\t}\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\": return formatArg(args[i++], {\n\t\t\t\tshowHidden: true,\n\t\t\t\tshowProxy: true\n\t\t\t});\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\t}\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\")) {\n\t\t\t\t\treturn \"[Circular]\";\n\t\t\t\t}\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]) {\n\t\tif (x === null || typeof x !== \"object\") {\n\t\t\tstr += ` ${typeof x === \"symbol\" ? x.toString() : x}`;\n\t\t} else {\n\t\t\tstr += ` ${formatArg(x)}`;\n\t\t}\n\t}\n\treturn str;\n}\nfunction format(...args) {\n\treturn baseFormat(args);\n}\nfunction browserFormat(...args) {\n\treturn baseFormat(args, { prettifyObject: true });\n}\nfunction inspect(obj, options = {}) {\n\tif (options.truncate === 0) {\n\t\toptions.truncate = Number.POSITIVE_INFINITY;\n\t}\n\treturn inspect$1(obj, options);\n}\nfunction objDisplay(obj, options = {}) {\n\tif (typeof options.truncate === \"undefined\") {\n\t\toptions.truncate = 40;\n\t}\n\tconst str = inspect(obj, options);\n\tconst type = Object.prototype.toString.call(obj);\n\tif (options.truncate && str.length >= options.truncate) {\n\t\tif (type === \"[object Function]\") {\n\t\t\tconst fn = obj;\n\t\t\treturn !fn.name ? \"[Function]\" : `[Function: ${fn.name}]`;\n\t\t} else if (type === \"[object Array]\") {\n\t\t\treturn `[ Array(${obj.length}) ]`;\n\t\t} else if (type === \"[object Object]\") {\n\t\t\tconst keys = Object.keys(obj);\n\t\t\tconst kstr = keys.length > 2 ? `${keys.splice(0, 2).join(\", \")}, ...` : keys.join(\", \");\n\t\t\treturn `{ Object (${kstr}) }`;\n\t\t} else {\n\t\t\treturn str;\n\t\t}\n\t}\n\treturn str;\n}\n\nexport { browserFormat, format, formatRegExp, inspect, objDisplay, stringify };\n"],"x_google_ignoreList":[0],"mappings":";;;AAEA,MAAM,aAAa;CACf,MAAM,CAAC,KAAK,IAAI;CAChB,KAAK,CAAC,KAAK,IAAI;CACf,QAAQ,CAAC,KAAK,IAAI;CAClB,WAAW,CAAC,KAAK,IAAI;CAErB,SAAS,CAAC,KAAK,IAAI;CACnB,QAAQ,CAAC,KAAK,IAAI;CAClB,QAAQ,CAAC,KAAK,IAAI;CAGlB,OAAO,CAAC,MAAM,IAAI;CAClB,KAAK,CAAC,MAAM,IAAI;CAChB,OAAO,CAAC,MAAM,IAAI;CAClB,QAAQ,CAAC,MAAM,IAAI;CACnB,MAAM,CAAC,MAAM,IAAI;CACjB,SAAS,CAAC,MAAM,IAAI;CACpB,MAAM,CAAC,MAAM,IAAI;CACjB,OAAO,CAAC,MAAM,IAAI;CAClB,aAAa,CAAC,QAAQ,IAAI;CAC1B,WAAW,CAAC,QAAQ,IAAI;CACxB,aAAa,CAAC,QAAQ,IAAI;CAC1B,cAAc,CAAC,QAAQ,IAAI;CAC3B,YAAY,CAAC,QAAQ,IAAI;CACzB,eAAe,CAAC,QAAQ,IAAI;CAC5B,YAAY,CAAC,QAAQ,IAAI;CACzB,aAAa,CAAC,QAAQ,IAAI;CAC1B,MAAM,CAAC,MAAM,IAAI;AACrB;AACA,MAAM,SAAS;CACX,SAAS;CACT,QAAQ;CACR,QAAQ;CACR,SAAS;CACT,WAAW;CACX,MAAM;CACN,QAAQ;CACR,QAAQ;CACR,MAAM;CACN,QAAQ;AACZ;AACA,MAAM,YAAY;AAClB,SAAS,SAAS,OAAO,WAAW;CAChC,MAAM,QAAQ,WAAW,OAAO,eAAe,WAAW,cAAc;CACxE,IAAI,CAAC,OACD,OAAO,OAAO,KAAK;CAEvB,OAAO,UAAU,MAAM,GAAG,GAAG,OAAO,KAAK,EAAE,SAAS,MAAM,GAAG;AACjE;AACA,SAAS,iBAAiB,EAAE,aAAa,OAAO,QAAQ,GAAG,SAAS,OAAO,gBAAgB,MAAM,YAAY,OAAO,iBAAiB,UAAU,cAAc,UAAU,OAAO,CAAC,GAE/K,WAAW,UAAU,UAAU,WAAY,CAAC,GAAG,SAAS;CACpD,MAAM,UAAU;EACZ,YAAY,QAAQ,UAAU;EAC9B,OAAO,OAAO,KAAK;EACnB,QAAQ,QAAQ,MAAM;EACtB,eAAe,QAAQ,aAAa;EACpC,WAAW,QAAQ,SAAS;EAC5B,gBAAgB,OAAO,cAAc;EACrC,aAAa,OAAO,WAAW;EAC/B,UAAU,OAAO,QAAQ;EACzB;EACA;EACA;CACJ;CACA,IAAI,QAAQ,QACR,QAAQ,UAAU;CAEtB,OAAO;AACX;AACA,SAAS,gBAAgB,MAAM;CAC3B,OAAO,QAAQ,YAAY,QAAQ;AACvC;AACA,SAAS,SAAS,QAAQ,QAAQ,OAAO,WAAW;CAChD,SAAS,OAAO,MAAM;CACtB,MAAM,aAAa,KAAK;CACxB,MAAM,eAAe,OAAO;CAC5B,IAAI,aAAa,UAAU,eAAe,YACtC,OAAO;CAEX,IAAI,eAAe,UAAU,eAAe,YAAY;EACpD,IAAI,MAAM,SAAS;EACnB,IAAI,MAAM,KAAK,gBAAgB,OAAO,MAAM,EAAE,GAC1C,MAAM,MAAM;EAEhB,OAAO,GAAG,OAAO,MAAM,GAAG,GAAG,IAAI;CACrC;CACA,OAAO;AACX;AAEA,SAAS,YAAY,MAAM,SAAS,aAAa,YAAY,MAAM;CAC/D,cAAc,eAAe,QAAQ;CACrC,MAAM,OAAO,KAAK;CAClB,IAAI,SAAS,GACT,OAAO;CACX,MAAM,iBAAiB,QAAQ;CAC/B,IAAI,SAAS;CACb,IAAI,OAAO;CACX,IAAI,YAAY;CAChB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK,GAAG;EAC9B,MAAM,OAAO,IAAI,MAAM,KAAK;EAC5B,MAAM,eAAe,IAAI,MAAM,KAAK;EACpC,YAAY,GAAG,UAAU,GAAG,KAAK,SAAS,EAAE;EAC5C,MAAM,QAAQ,KAAK;EAEnB,QAAQ,WAAW,iBAAiB,OAAO,UAAU,OAAO,IAAI,UAAU;EAC1E,MAAM,SAAS,QAAQ,YAAY,OAAO,OAAO,KAAK,OAAO,KAAK;EAClE,MAAM,aAAa,OAAO,SAAS,OAAO;EAC1C,MAAM,kBAAkB,aAAa,UAAU;EAG/C,IAAI,QAAQ,aAAa,kBAAkB,OAAO,SAAS,UAAU,UAAU,gBAC3E;EAIJ,IAAI,CAAC,QAAQ,CAAC,gBAAgB,kBAAkB,gBAC5C;EAIJ,OAAO,OAAO,KAAK,YAAY,KAAK,IAAI,IAAI,OAAO,KAAK,eAAe,KAAK;EAG5E,IAAI,CAAC,QAAQ,gBAAgB,kBAAkB,kBAAkB,aAAa,KAAK,SAAS,gBACxF;EAEJ,UAAU;EAGV,IAAI,CAAC,QAAQ,CAAC,gBAAgB,aAAa,KAAK,UAAU,gBAAgB;GACtE,YAAY,GAAG,UAAU,GAAG,KAAK,SAAS,IAAI,EAAE;GAChD;EACJ;EACA,YAAY;CAChB;CACA,OAAO,GAAG,SAAS;AACvB;AACA,SAAS,gBAAgB,KAAK;CAC1B,IAAI,IAAI,MAAM,0BAA0B,GACpC,OAAO;CAEX,OAAO,KAAK,UAAU,GAAG,CAAC,CACrB,QAAQ,MAAM,KAAK,CAAC,CACpB,QAAQ,QAAQ,IAAG,CAAC,CACpB,QAAQ,YAAY,GAAG;AAChC;AACA,SAAS,gBAAgB,CAAC,KAAK,QAAQ,SAAS;CAC5C,QAAQ,YAAY;CACpB,IAAI,OAAO,QAAQ,UACf,MAAM,gBAAgB,GAAG;MAExB,IAAI,OAAO,QAAQ,UACpB,MAAM,IAAI,QAAQ,QAAQ,KAAK,OAAO,EAAE;CAE5C,QAAQ,YAAY,IAAI;CACxB,QAAQ,QAAQ,QAAQ,OAAO,OAAO;CACtC,OAAO,GAAG,IAAI,IAAI;AACtB;AAEA,SAAS,aAAa,OAAO,SAAS;CAGlC,MAAM,qBAAqB,OAAO,KAAK,KAAK,CAAC,CAAC,MAAM,MAAM,MAAM;CAChE,IAAI,CAAC,MAAM,UAAU,CAAC,mBAAmB,QACrC,OAAO;CACX,QAAQ,YAAY;CACpB,MAAM,eAAe,YAAY,OAAO,OAAO;CAC/C,QAAQ,YAAY,aAAa;CACjC,IAAI,mBAAmB;CACvB,IAAI,mBAAmB,QACnB,mBAAmB,YAAY,mBAAmB,KAAI,QAAO,CAAC,KAAK,MAAM,IAAI,CAAC,GAAG,SAAS,eAAe;CAE7G,OAAO,KAAK,eAAe,mBAAmB,KAAK,qBAAqB,GAAG;AAC/E;AAEA,MAAM,gBAAgB,UAAU;CAG5B,IAAI,OAAO,WAAW,cAAc,iBAAiB,QACjD,OAAO;CAEX,IAAI,MAAM,OAAO,cACb,OAAO,MAAM,OAAO;CAExB,OAAO,MAAM,YAAY;AAC7B;AACA,SAAS,kBAAkB,OAAO,SAAS;CACvC,MAAM,OAAO,aAAa,KAAK;CAC/B,QAAQ,YAAY,KAAK,SAAS;CAGlC,MAAM,qBAAqB,OAAO,KAAK,KAAK,CAAC,CAAC,MAAM,MAAM,MAAM;CAChE,IAAI,CAAC,MAAM,UAAU,CAAC,mBAAmB,QACrC,OAAO,GAAG,KAAK;CAGnB,IAAI,SAAS;CACb,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACnC,MAAM,SAAS,GAAG,QAAQ,QAAQ,SAAS,MAAM,IAAI,QAAQ,QAAQ,GAAG,QAAQ,IAAI,MAAM,MAAM,SAAS,IAAI,KAAK;EAClH,QAAQ,YAAY,OAAO;EAC3B,IAAI,MAAM,OAAO,MAAM,UAAU,QAAQ,YAAY,GAAG;GACpD,UAAU,GAAG,UAAU,GAAG,MAAM,SAAS,MAAM,KAAK,EAAE;GACtD;EACJ;EACA,UAAU;CACd;CACA,IAAI,mBAAmB;CACvB,IAAI,mBAAmB,QACnB,mBAAmB,YAAY,mBAAmB,KAAI,QAAO,CAAC,KAAK,MAAM,IAAI,CAAC,GAAG,SAAS,eAAe;CAE7G,OAAO,GAAG,KAAK,IAAI,SAAS,mBAAmB,KAAK,qBAAqB,GAAG;AAChF;AAEA,SAAS,YAAY,YAAY,SAAS;CACtC,MAAM,uBAAuB,WAAW,OAAO;CAC/C,IAAI,yBAAyB,MACzB,OAAO;CAEX,MAAM,QAAQ,qBAAqB,MAAM,GAAG;CAC5C,MAAM,OAAO,MAAM;CAEnB,OAAO,QAAQ,QAAQ,GAAG,KAAK,GAAG,SAAS,MAAM,IAAI,QAAQ,WAAW,KAAK,SAAS,CAAC,KAAK,MAAM;AACtG;AAEA,SAAS,gBAAgB,MAAM,SAAS;CACpC,MAAM,eAAe,KAAK,OAAO,gBAAgB;CACjD,MAAM,OAAO,KAAK;CAClB,IAAI,CAAC,MACD,OAAO,QAAQ,QAAQ,IAAI,aAAa,IAAI,SAAS;CAEzD,OAAO,QAAQ,QAAQ,IAAI,aAAa,GAAG,SAAS,MAAM,QAAQ,WAAW,EAAE,EAAE,IAAI,SAAS;AAClG;AAEA,SAAS,gBAAgB,CAAC,KAAK,QAAQ,SAAS;CAC5C,QAAQ,YAAY;CACpB,MAAM,QAAQ,QAAQ,KAAK,OAAO;CAClC,QAAQ,YAAY,IAAI;CACxB,QAAQ,QAAQ,QAAQ,OAAO,OAAO;CACtC,OAAO,GAAG,IAAI,MAAM;AACxB;AAEA,SAAS,aAAa,KAAK;CACvB,MAAM,UAAU,CAAC;CACjB,IAAI,SAAS,OAAO,QAAQ;EACxB,QAAQ,KAAK,CAAC,KAAK,KAAK,CAAC;CAC7B,CAAC;CACD,OAAO;AACX;AACA,SAAS,WAAW,KAAK,SAAS;CAC9B,IAAI,IAAI,SAAS,GACb,OAAO;CACX,QAAQ,YAAY;CACpB,OAAO,QAAQ,YAAY,aAAa,GAAG,GAAG,SAAS,eAAe,EAAE;AAC5E;AAEA,MAAM,QAAQ,OAAO,WAAU,MAAK,MAAM;AAC1C,SAAS,cAAc,QAAQ,SAAS;CACpC,IAAI,MAAM,MAAM,GACZ,OAAO,QAAQ,QAAQ,OAAO,QAAQ;CAE1C,IAAI,WAAW,UACX,OAAO,QAAQ,QAAQ,YAAY,QAAQ;CAE/C,IAAI,WAAW,WACX,OAAO,QAAQ,QAAQ,aAAa,QAAQ;CAEhD,IAAI,WAAW,GACX,OAAO,QAAQ,QAAQ,IAAI,WAAW,WAAW,OAAO,MAAM,QAAQ;CAE1E,OAAO,QAAQ,QAAQ,SAAS,OAAO,MAAM,GAAG,QAAQ,QAAQ,GAAG,QAAQ;AAC/E;AAEA,SAAS,cAAc,QAAQ,SAAS;CACpC,IAAI,OAAO,SAAS,OAAO,SAAS,GAAG,QAAQ,WAAW,CAAC;CAC3D,IAAI,SAAS,WACT,QAAQ;CACZ,OAAO,QAAQ,QAAQ,MAAM,QAAQ;AACzC;AAEA,SAAS,cAAc,OAAO,SAAS;CACnC,MAAM,QAAQ,MAAM,SAAS,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;CAC1C,MAAM,eAAe,QAAQ,YAAY,IAAI,MAAM;CACnD,MAAM,SAAS,MAAM;CACrB,OAAO,QAAQ,QAAQ,IAAI,SAAS,QAAQ,YAAY,EAAE,GAAG,SAAS,QAAQ;AAClF;AAGA,SAAS,aAAa,KAAK;CACvB,MAAM,SAAS,CAAC;CAChB,IAAI,SAAQ,UAAS;EACjB,OAAO,KAAK,KAAK;CACrB,CAAC;CACD,OAAO;AACX;AACA,SAAS,WAAW,KAAK,SAAS;CAC9B,IAAI,IAAI,SAAS,GACb,OAAO;CACX,QAAQ,YAAY;CACpB,OAAO,QAAQ,YAAY,aAAa,GAAG,GAAG,OAAO,EAAE;AAC3D;AAEA,MAAM,oCAAoB,IAAI,OAAO,mJACuC,GAAG;AAC/E,MAAM,mBAAmB;CACrB,MAAM;CACN,KAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM;CACN,KAAK;CACL,MAAM;AACV;AACA,MAAM,MAAM;AACZ,SAAS,OAAO,MAAM;CAClB,OAAQ,iBAAiB,SACrB,MAAM,OAAO,KAAK,WAAW,CAAC,CAAC,CAAC,SAAS,GAAG,IAAI,MAAM,EAAE;AAChE;AACA,SAAS,cAAc,QAAQ,SAAS;CACpC,IAAI,kBAAkB,KAAK,MAAM,GAC7B,SAAS,OAAO,QAAQ,mBAAmB,MAAM;CAErD,OAAO,QAAQ,QAAQ,IAAI,SAAS,QAAQ,QAAQ,WAAW,CAAC,EAAE,IAAI,QAAQ;AAClF;AAEA,SAAS,cAAc,OAAO;CAC1B,IAAI,iBAAiB,OAAO,WACxB,OAAO,MAAM,cAAc,UAAU,MAAM,YAAY,KAAK;CAEhE,OAAO,MAAM,SAAS;AAC1B;AAEA,MAAM,wBAAwB;AAE9B,SAAS,gBAAgB,QAAQ,SAAS;CACtC,MAAM,aAAa,OAAO,oBAAoB,MAAM;CACpD,MAAM,UAAU,OAAO,wBAAwB,OAAO,sBAAsB,MAAM,IAAI,CAAC;CACvF,IAAI,WAAW,WAAW,KAAK,QAAQ,WAAW,GAC9C,OAAO;CAEX,QAAQ,YAAY;CACpB,QAAQ,OAAO,QAAQ,QAAQ,CAAC;CAChC,IAAI,QAAQ,KAAK,SAAS,MAAM,GAC5B,OAAO;CAEX,QAAQ,KAAK,KAAK,MAAM;CACxB,MAAM,mBAAmB,YAAY,WAAW,KAAI,QAAO,CAAC,KAAK,OAAO,IAAI,CAAC,GAAG,SAAS,eAAe;CACxG,MAAM,iBAAiB,YAAY,QAAQ,KAAI,QAAO,CAAC,KAAK,OAAO,IAAI,CAAC,GAAG,SAAS,eAAe;CACnG,QAAQ,KAAK,IAAI;CACjB,IAAI,MAAM;CACV,IAAI,oBAAoB,gBACpB,MAAM;CAEV,OAAO,KAAK,mBAAmB,MAAM,eAAe;AACxD;AAEA,MAAM,cAAc,OAAO,WAAW,eAAe,OAAO,cAAc,OAAO,cAAc;AAC/F,SAAS,aAAa,OAAO,SAAS;CAClC,IAAI,OAAO;CACX,IAAI,eAAe,eAAe,OAC9B,OAAO,MAAM;CAEjB,OAAO,QAAQ,MAAM,YAAY;CAEjC,IAAI,CAAC,QAAQ,SAAS,UAClB,OAAO;CAEX,QAAQ,YAAY,KAAK;CACzB,OAAO,GAAG,OAAO,gBAAgB,OAAO,OAAO;AACnD;AAEA,SAAS,iBAAiB,MAAM,SAAS;CACrC,IAAI,KAAK,WAAW,GAChB,OAAO;CACX,QAAQ,YAAY;CACpB,OAAO,cAAc,YAAY,MAAM,OAAO,EAAE;AACpD;AAEA,MAAM,YAAY;CACd;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACJ;AACA,SAAS,cAAc,OAAO,SAAS;CACnC,MAAM,aAAa,OAAO,oBAAoB,KAAK,CAAC,CAAC,QAAO,QAAO,UAAU,QAAQ,GAAG,MAAM,EAAE;CAChG,MAAM,OAAO,MAAM;CACnB,QAAQ,YAAY,KAAK;CACzB,IAAI,UAAU;CACd,IAAI,OAAO,MAAM,YAAY,UACzB,UAAU,SAAS,MAAM,SAAS,QAAQ,QAAQ;MAGlD,WAAW,QAAQ,SAAS;CAEhC,UAAU,UAAU,KAAK,YAAY;CACrC,QAAQ,YAAY,QAAQ,SAAS;CACrC,QAAQ,OAAO,QAAQ,QAAQ,CAAC;CAChC,IAAI,QAAQ,KAAK,SAAS,KAAK,GAC3B,OAAO;CAEX,QAAQ,KAAK,KAAK,KAAK;CACvB,MAAM,mBAAmB,YAAY,WAAW,KAAI,QAAO,CAAC,KAAK,MAAM,IAAI,CAAC,GAAG,SAAS,eAAe;CACvG,OAAO,GAAG,OAAO,UAAU,mBAAmB,MAAM,iBAAiB,MAAM;AAC/E;AAEA,SAAS,iBAAiB,CAAC,KAAK,QAAQ,SAAS;CAC7C,QAAQ,YAAY;CACpB,IAAI,CAAC,OACD,OAAO,GAAG,QAAQ,QAAQ,OAAO,GAAG,GAAG,QAAQ;CAEnD,OAAO,GAAG,QAAQ,QAAQ,OAAO,GAAG,GAAG,QAAQ,EAAE,GAAG,QAAQ,QAAQ,IAAI,MAAM,IAAI,QAAQ;AAC9F;AACA,SAAS,sBAAsB,YAAY,SAAS;CAChD,OAAO,YAAY,YAAY,SAAS,aAAa,IAAI;AAC7D;AACA,SAAS,YAAY,MAAM,SAAS;CAChC,QAAQ,KAAK,UAAb;EACI,KAAK,GACD,OAAO,YAAY,MAAM,OAAO;EACpC,KAAK,GACD,OAAO,QAAQ,QAAQ,KAAK,MAAM,OAAO;EAC7C,SACI,OAAO,QAAQ,QAAQ,MAAM,OAAO;CAC5C;AACJ;AAEA,SAAS,YAAY,SAAS,SAAS;CACnC,MAAM,aAAa,QAAQ,kBAAkB;CAC7C,MAAM,OAAO,QAAQ,QAAQ,YAAY;CACzC,MAAM,OAAO,QAAQ,QAAQ,IAAI,QAAQ,SAAS;CAClD,MAAM,YAAY,QAAQ,QAAQ,KAAK,SAAS;CAChD,MAAM,OAAO,QAAQ,QAAQ,KAAK,KAAK,IAAI,SAAS;CACpD,QAAQ,YAAY,KAAK,SAAS,IAAI;CACtC,IAAI,mBAAmB;CACvB,IAAI,WAAW,SAAS,GAAG;EACvB,oBAAoB;EACpB,oBAAoB,YAAY,WAAW,KAAK,QAAQ,CAAC,KAAK,QAAQ,aAAa,GAAG,CAAC,CAAC,GAAG,SAAS,kBAAkB,GAAG;CAC7H;CACA,QAAQ,YAAY,iBAAiB;CACrC,MAAM,WAAW,QAAQ;CACzB,IAAI,WAAW,sBAAsB,QAAQ,UAAU,OAAO;CAC9D,IAAI,YAAY,SAAS,SAAS,UAC9B,WAAW,GAAG,UAAU,GAAG,QAAQ,SAAS,OAAO;CAEvD,OAAO,GAAG,OAAO,mBAAmB,YAAY,WAAW;AAC/D;AAQA,MAAM,cADmB,OAAO,WAAW,cAAc,OAAO,OAAO,QAAQ,aACxC,OAAO,IAAI,cAAc,IAAI;AACpE,MAAM,cAAc,OAAO,IAAI,4BAA4B;AAC3D,MAAM,iCAAiB,IAAI,QAAQ;AACnC,MAAM,eAAe,CAAC;AACtB,MAAM,eAAe;CACjB,YAAY,OAAO,YAAY,QAAQ,QAAQ,aAAa,WAAW;CACvE,OAAO,OAAO,YAAY,QAAQ,QAAQ,QAAQ,MAAM;CACxD,UAAU,OAAO,YAAY,QAAQ,QAAQ,OAAO,KAAK,GAAG,SAAS;CACrE,UAAU,OAAO,YAAY,QAAQ,QAAQ,OAAO,KAAK,GAAG,SAAS;CACrE,QAAQ;CACR,QAAQ;CACR,QAAQ;CACR,QAAQ;CACR,QAAQ;CACR,QAAQ;CACR,UAAU;CACV,UAAU;CACV,QAAQ;CAER,QAAQ;CACR,OAAO;CACP,MAAM;CACN,KAAK;CACL,KAAK;CACL,QAAQ;CACR,SAAS;CAET,UAAU,OAAO,YAAY,QAAQ,QAAQ,cAAc,SAAS;CACpE,UAAU,OAAO,YAAY,QAAQ,QAAQ,cAAc,SAAS;CACpE,WAAW;CACX,WAAW;CACX,YAAY;CACZ,mBAAmB;CACnB,YAAY;CACZ,aAAa;CACb,YAAY;CACZ,aAAa;CACb,cAAc;CACd,cAAc;CACd,iBAAiB;CACjB,gBAAgB;CAChB,mBAAmB;CACnB,OAAO;CACP,gBAAgB;CAChB,UAAU;AACd;AAEA,MAAM,iBAAiB,OAAO,SAAS,MAAM,cAAc;CACvD,IAAI,eAAe,SAAS,OAAO,MAAM,iBAAiB,YACtD,OAAO,MAAM,YAAY,CAAC,OAAO;CAErC,IAAI,eAAe,SAAS,OAAO,MAAM,iBAAiB,YACtD,OAAO,MAAM,YAAY,CAAC,QAAQ,OAAO,SAAS,SAAS;CAE/D,IAAI,aAAa,SAAS,OAAO,MAAM,YAAY,YAC/C,OAAO,MAAM,QAAQ,QAAQ,OAAO,OAAO;CAE/C,IAAI,iBAAiB,SAAS,eAAe,IAAI,MAAM,WAAW,GAC9D,OAAO,eAAe,IAAI,MAAM,WAAW,CAAC,CAAC,OAAO,OAAO;CAE/D,IAAI,aAAa,OACb,OAAO,aAAa,KAAK,CAAC,OAAO,OAAO;CAE5C,OAAO;AACX;AACA,MAAM,WAAW,OAAO,UAAU;AAElC,SAAS,UAAU,OAAO,OAAO,CAAC,GAAG;CACjC,MAAM,UAAU,iBAAiB,MAAM,SAAS;CAChD,MAAM,EAAE,kBAAkB;CAC1B,IAAI,OAAO,UAAU,OAAO,SAAS,OAAO;CAC5C,IAAI,SAAS,UACT,OAAO,SAAS,KAAK,KAAK,CAAC,CAAC,MAAM,GAAG,EAAE;CAG3C,IAAI,QAAQ,cACR,OAAO,aAAa,KAAK,CAAC,OAAO,OAAO;CAG5C,IAAI,iBAAiB,OAAO;EACxB,MAAM,SAAS,cAAc,OAAO,SAAS,MAAM,SAAS;EAC5D,IAAI,QAAQ;GACR,IAAI,OAAO,WAAW,UAClB,OAAO;GACX,OAAO,UAAU,QAAQ,OAAO;EACpC;CACJ;CACA,MAAM,QAAQ,QAAQ,OAAO,eAAe,KAAK,IAAI;CAErD,IAAI,UAAU,OAAO,aAAa,UAAU,MACxC,OAAO,gBAAgB,OAAO,OAAO;CAIzC,IAAI,SAAS,OAAO,gBAAgB,cAAc,iBAAiB,aAC/D,OAAO,YAAY,OAAO,OAAO;CAErC,IAAI,iBAAiB,OAAO;EAExB,IAAI,MAAM,gBAAgB,QACtB,OAAO,aAAa,OAAO,OAAO;EAGtC,OAAO,gBAAgB,OAAO,OAAO;CACzC;CAEA,IAAI,UAAU,OAAO,KAAK,GACtB,OAAO,gBAAgB,OAAO,OAAO;CAGzC,OAAO,QAAQ,QAAQ,OAAO,KAAK,GAAG,IAAI;AAC9C;AAEA,MAAM,EAAE,mBAAmB,eAAe,YAAY,WAAW,cAAc,uBAAuB;AACtG,MAAM,UAAU;CACf;CACA;CACA;CACA;CACA;CACA;AACD;AACA,SAAS,UAAU,QAAQ,WAAW,IAAI,EAAE,WAAW,YAAY,GAAG,YAAY,CAAC,GAAG;CACrF,MAAM,aAAa,aAAa;CAChC,IAAI;CAEJ,MAAM,WAAW,OAAO,eAAe,WAAW,6BAA6B,UAAU,IAAI;CAC7F,MAAM,UAAU,WAAW;EAC1B;EACA;EACA,uBAAuB,QAAQ;EAC/B;EACA;EACA;CACD,IAAI;CACJ,IAAI;EACH,SAAS,SAAS,QAAQ;GACzB;GACA,cAAc;GACd;GACA,GAAG;EACJ,CAAC;CACF,QAAQ;EACP,SAAS,SAAS,QAAQ;GACzB,YAAY;GACZ;GACA,cAAc;GACd;GACA,GAAG;EACJ,CAAC;CACF;CAEA,OAAO,OAAO,UAAU,cAAc,WAAW,IAAI,UAAU,QAAQ,KAAK,MAAM,KAAK,IAAI,UAAU,OAAO,gBAAgB,IAAI,CAAC,GAAG;EACnI;EACA;EACA,GAAG;CACJ,CAAC,IAAI;AACN;AACA,SAAS,6BAA6B,UAAU;CAC/C,MAAM,eAAe;CACrB,MAAM,eAAe;CACrB,QAAQ,SAAS;EAEhB,IAAI,KAAK,aAAa,cACrB,OAAO;EAGR,IAAI,KAAK,aAAa,gBAAgB,KAAK,SAC1C,IAAI;GACH,OAAO,CAAC,KAAK,QAAQ,QAAQ;EAC9B,QAAQ;GACP,OAAO;EACR;EAED,OAAO;CACR;AACD;AACA,MAAM,eAAe;AACrB,SAAS,WAAW,MAAM,UAAU,CAAC,GAAG;CACvC,MAAM,aAAa,MAAM,kBAAkB;EAC1C,IAAI,QAAQ,gBACX,OAAO,UAAU,MAAM,QAAW;GACjC,qBAAqB;GACrB,cAAc;EACf,CAAC;EAEF,OAAO,QAAQ,MAAM,aAAa;CACnC;CACA,IAAI,OAAO,KAAK,OAAO,UAAU;EAChC,MAAM,UAAU,CAAC;EACjB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAChC,QAAQ,KAAK,UAAU,KAAK,IAAI;GAC/B,OAAO;GACP,QAAQ;EACT,CAAC,CAAC;EAEH,OAAO,QAAQ,KAAK,GAAG;CACxB;CACA,MAAM,MAAM,KAAK;CACjB,IAAI,IAAI;CACR,MAAM,WAAW,KAAK;CACtB,IAAI,MAAM,OAAO,QAAQ,CAAC,CAAC,QAAQ,eAAe,MAAM;EACvD,IAAI,MAAM,MACT,OAAO;EAER,IAAI,KAAK,KACR,OAAO;EAER,QAAQ,GAAR;GACC,KAAK,MAAM;IACV,MAAM,QAAQ,KAAK;IACnB,IAAI,OAAO,UAAU,UACpB,OAAO,GAAG,MAAM,SAAS,EAAE;IAE5B,IAAI,OAAO,UAAU,YAAY,UAAU,KAAK,IAAI,QAAQ,GAC3D,OAAO;IAER,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM;KAChD,IAAI,OAAO,MAAM,aAAa,cAAc,MAAM,aAAa,OAAO,UAAU,UAC/E,OAAO,MAAM,SAAS;KAEvB,OAAO,UAAU,OAAO;MACvB,OAAO;MACP,QAAQ;KACT,CAAC;IACF;IACA,OAAO,OAAO,KAAK;GACpB;GACA,KAAK,MAAM;IACV,MAAM,QAAQ,KAAK;IACnB,IAAI,OAAO,UAAU,UACpB,OAAO,GAAG,MAAM,SAAS,EAAE;IAE5B,IAAI,OAAO,UAAU,UACpB,OAAO;IAER,OAAO,OAAO,KAAK,CAAC,CAAC,SAAS;GAC/B;GACA,KAAK,MAAM;IACV,MAAM,QAAQ,KAAK;IACnB,IAAI,OAAO,UAAU,UACpB,OAAO,GAAG,MAAM,SAAS,EAAE;IAE5B,OAAO,OAAO,SAAS,OAAO,KAAK,CAAC,CAAC,CAAC,SAAS;GAChD;GACA,KAAK,MAAM,OAAO,OAAO,WAAW,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS;GAChE,KAAK,MAAM,OAAO,UAAU,KAAK,MAAM;IACtC,YAAY;IACZ,WAAW;GACZ,CAAC;GACD,KAAK,MAAM,OAAO,UAAU,KAAK,IAAI;GACrC,KAAK;IACJ;IACA,OAAO;GAER,KAAK,MAAM,IAAI;IACd,OAAO,KAAK,UAAU,KAAK,IAAI;GAChC,SAAS,KAAK;IACb,MAAM,IAAI,IAAI;IACd,IAAI,EAAE,SAAS,oBAAoB,KAAK,EAAE,SAAS,mBAAmB,KAAK,EAAE,SAAS,eAAe,GACpG,OAAO;IAER,MAAM;GACP;GACA,SAAS,OAAO;EACjB;CACD,CAAC;CACD,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,IACzC,IAAI,MAAM,QAAQ,OAAO,MAAM,UAC9B,OAAO,IAAI,OAAO,MAAM,WAAW,EAAE,SAAS,IAAI;MAElD,OAAO,IAAI,UAAU,CAAC;CAGxB,OAAO;AACR;AACA,SAAS,OAAO,GAAG,MAAM;CACxB,OAAO,WAAW,IAAI;AACvB;AAIA,SAAS,QAAQ,KAAK,UAAU,CAAC,GAAG;CACnC,IAAI,QAAQ,aAAa,GACxB,QAAQ,WAAW,OAAO;CAE3B,OAAO,UAAU,KAAK,OAAO;AAC9B;AACA,SAAS,WAAW,KAAK,UAAU,CAAC,GAAG;CACtC,IAAI,OAAO,QAAQ,aAAa,aAC/B,QAAQ,WAAW;CAEpB,MAAM,MAAM,QAAQ,KAAK,OAAO;CAChC,MAAM,OAAO,OAAO,UAAU,SAAS,KAAK,GAAG;CAC/C,IAAI,QAAQ,YAAY,IAAI,UAAU,QAAQ,UAC7C,IAAI,SAAS,qBAAqB;EACjC,MAAM,KAAK;EACX,OAAO,CAAC,GAAG,OAAO,eAAe,cAAc,GAAG,KAAK;CACxD,OAAO,IAAI,SAAS,kBACnB,OAAO,WAAW,IAAI,OAAO;MACvB,IAAI,SAAS,mBAAmB;EACtC,MAAM,OAAO,OAAO,KAAK,GAAG;EAE5B,OAAO,aADM,KAAK,SAAS,IAAI,GAAG,KAAK,OAAO,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,SAAS,KAAK,KAAK,IAAI,EAC7D;CAC1B,OACC,OAAO;CAGT,OAAO;AACR"}

package/esm/node_modules/@vitest/utils/dist/error.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"error.mjs","names":[],"sources":["../../../../../../../../../../node_modules/@vitest/utils/dist/error.js"],"sourcesContent":["import { format } from '@vitest/pretty-format';\nimport { printDiffOrStringify, getDefaultFormatOptions } from './diff.js';\nimport { serializeValue } from './serialize.js';\nimport 'tinyrainbow';\nimport './display.js';\nimport './helpers.js';\nimport './constants.js';\n\nfunction processError(_err, diffOptions, seen = new WeakSet()) {\n\tif (!_err || typeof _err !== \"object\") {\n\t\treturn { message: String(_err) };\n\t}\n\tconst err = _err;\n\tif (err.showDiff || err.showDiff === undefined && err.expected !== undefined && err.actual !== undefined) {\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(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\") {\n\t\treturn format(value, getDefaultFormatOptions(options));\n\t}\n\treturn value;\n}\n\nexport { processError, serializeValue as serializeError };\n"],"x_google_ignoreList":[0],"mappings":";;;;;AAQA,SAAS,aAAa,MAAM,aAAa,uBAAO,IAAI,QAAQ,GAAG;CAC9D,IAAI,CAAC,QAAQ,OAAO,SAAS,UAC5B,OAAO,EAAE,SAAS,OAAO,IAAI,EAAE;CAEhC,MAAM,MAAM;CACZ,IAAI,IAAI,YAAY,IAAI,aAAa,UAAa,IAAI,aAAa,UAAa,IAAI,WAAW,QAAW;EACzG,MAAM,UAAU;GACf,GAAG;GACH,GAAG,IAAI;EACR;EACA,IAAI,OAAO,qBAAqB,IAAI,QAAQ,IAAI,UAAU,SAAS,GAAG;EACtE,IAAI,WAAW,cAAc,IAAI,UAAU,OAAO;EAClD,IAAI,SAAS,cAAc,IAAI,QAAQ,OAAO;CAC/C;CAGA,IAAI;EACH,IAAI,CAAC,KAAK,IAAI,GAAG,KAAK,OAAO,IAAI,UAAU,UAAU;GACpD,KAAK,IAAI,GAAG;GACZ,IAAI,QAAQ,aAAa,IAAI,OAAO,aAAa,IAAI;EACtD;CACD,QAAQ,CAAC;CACT,IAAI;EACH,OAAO,eAAe,GAAG;CAC1B,SAAS,GAAG;EACX,OAAO,+BAAe,IAAI,MAAM,oCAAoC,GAAG,QAAQ,yBAAyB,KAAK,SAAS,CAAC;CACxH;AACD;AACA,SAAS,cAAc,OAAO,SAAS;CACtC,IAAI,OAAO,UAAU,UACpB,OAAO,OAAO,OAAO,wBAAwB,OAAO,CAAC;CAEtD,OAAO;AACR"}

package/esm/node_modules/@vitest/utils/dist/helpers.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"helpers.mjs","names":[],"sources":["../../../../../../../../../../node_modules/@vitest/utils/dist/helpers.js"],"sourcesContent":["import { VALID_ID_PREFIX, NULL_BYTE_PLACEHOLDER } from './constants.js';\n\n// port from nanoid\n// https://github.com/ai/nanoid\nconst urlAlphabet = \"useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict\";\nfunction nanoid(size = 21) {\n\tlet id = \"\";\n\tlet i = size;\n\twhile (i--) {\n\t\tid += urlAlphabet[Math.random() * 64 | 0];\n\t}\n\treturn id;\n}\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* 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 err = new Error(message);\n\tconst stackTrace = err.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\tconst pass = types.includes(receivedType);\n\tif (!pass) {\n\t\tthrow new TypeError(`${name} value must be ${types.join(\" or \")}, received \"${receivedType}\"`);\n\t}\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) !== \"/\") {\n\t\treturn `${path}/`;\n\t}\n\treturn path;\n}\nfunction filterOutComments(s) {\n\tconst result = [];\n\tlet commentState = \"none\";\n\tfor (let i = 0; i < s.length; ++i) {\n\t\tif (commentState === \"singleline\") {\n\t\t\tif (s[i] === \"\\n\") {\n\t\t\t\tcommentState = \"none\";\n\t\t\t}\n\t\t} else if (commentState === \"multiline\") {\n\t\t\tif (s[i - 1] === \"*\" && s[i] === \"/\") {\n\t\t\t\tcommentState = \"none\";\n\t\t\t}\n\t\t} else if (commentState === \"none\") {\n\t\t\tif (s[i] === \"/\" && s[i + 1] === \"/\") {\n\t\t\t\tcommentState = \"singleline\";\n\t\t\t} else if (s[i] === \"/\" && s[i + 1] === \"*\") {\n\t\t\t\tcommentState = \"multiline\";\n\t\t\t\ti += 2;\n\t\t\t} else {\n\t\t\t\tresult.push(s[i]);\n\t\t\t}\n\t\t}\n\t}\n\treturn result.join(\"\");\n}\nconst bareImportRE = /^(?![a-z]:)[\\w@](?!.*:\\/\\/)/i;\nfunction isBareImport(id) {\n\treturn bareImportRE.test(id);\n}\nfunction toArray(array) {\n\tif (array === null || array === undefined) {\n\t\tarray = [];\n\t}\n\tif (Array.isArray(array)) {\n\t\treturn array;\n\t}\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 = new Set();\n\tif (isFinalObj(obj)) {\n\t\treturn [];\n\t}\n\tcollectOwnProperties(obj, ownProps);\n\treturn Array.from(ownProps);\n}\nconst defaultCloneOptions = { forceWritable: false };\nfunction deepClone(val, options = defaultCloneOptions) {\n\tconst seen = new WeakMap();\n\treturn clone(val, seen, options);\n}\nfunction clone(val, seen, options = defaultCloneOptions) {\n\tlet k, out;\n\tif (seen.has(val)) {\n\t\treturn seen.get(val);\n\t}\n\tif (Array.isArray(val)) {\n\t\tout = Array.from({ length: k = val.length });\n\t\tseen.set(val, out);\n\t\twhile (k--) {\n\t\t\tout[k] = clone(val[k], seen, options);\n\t\t}\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) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst cloned = clone(val[k], seen, options);\n\t\t\tif (options.forceWritable) {\n\t\t\t\tObject.defineProperty(out, k, {\n\t\t\t\t\tenumerable: descriptor.enumerable,\n\t\t\t\t\tconfigurable: true,\n\t\t\t\t\twritable: true,\n\t\t\t\t\tvalue: cloned\n\t\t\t\t});\n\t\t\t} else if (\"get\" in descriptor) {\n\t\t\t\tObject.defineProperty(out, k, {\n\t\t\t\t\t...descriptor,\n\t\t\t\t\tget() {\n\t\t\t\t\t\treturn cloned;\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\tObject.defineProperty(out, k, {\n\t\t\t\t\t...descriptor,\n\t\t\t\t\tvalue: cloned\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\treturn val;\n}\nfunction noop() {}\nfunction objectAttr(source, path, defaultValue = undefined) {\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 === undefined) {\n\t\t\treturn defaultValue;\n\t\t}\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\tconst isCharString = char === \"\\\"\" || char === \"'\" || char === \"`\";\n\t\tif (isCharString && beforeChar !== \"\\\\\") {\n\t\t\tif (inString === char) {\n\t\t\t\tinString = null;\n\t\t\t} else if (!inString) {\n\t\t\t\tinString = char;\n\t\t\t}\n\t\t}\n\t\tif (!inString) {\n\t\t\tif (char === \"(\") {\n\t\t\t\tstartedBracers++;\n\t\t\t}\n\t\t\tif (char === \")\") {\n\t\t\t\tendedBracers++;\n\t\t\t}\n\t\t}\n\t\tif (startedBracers && endedBracers && startedBracers === endedBracers) {\n\t\t\treturn charIndex;\n\t\t}\n\t}\n\treturn null;\n}\nfunction isNegativeNaN(val) {\n\tif (!Number.isNaN(val)) {\n\t\treturn false;\n\t}\n\tconst f64 = new Float64Array(1);\n\tf64[0] = val;\n\tconst u32 = new Uint32Array(f64.buffer);\n\tconst isNegative = u32[1] >>> 31 === 1;\n\treturn isNegative;\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) {\n\t\treturn `${i}st`;\n\t}\n\tif (j === 2 && k !== 12) {\n\t\treturn `${i}nd`;\n\t}\n\tif (j === 3 && k !== 13) {\n\t\treturn `${i}rd`;\n\t}\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) {\n\t\treturn target;\n\t}\n\tconst source = sources.shift();\n\tif (source === undefined) {\n\t\treturn target;\n\t}\n\tif (isMergeableObject(target) && isMergeableObject(source)) {\n\t\tObject.keys(source).forEach((key) => {\n\t\t\tconst _source = source;\n\t\t\tif (isMergeableObject(_source[key])) {\n\t\t\t\tif (!target[key]) {\n\t\t\t\t\ttarget[key] = {};\n\t\t\t\t}\n\t\t\t\tdeepMerge(target[key], _source[key]);\n\t\t\t} else {\n\t\t\t\ttarget[key] = _source[key];\n\t\t\t}\n\t\t});\n\t}\n\treturn deepMerge(target, ...sources);\n}\nfunction unique(array) {\n\treturn Array.from(new Set(array));\n}\n\nexport { assertTypes, cleanUrl, clone, createDefer, createSimpleStackTrace, deepClone, deepMerge, filterOutComments, getCallLastIndex, getOwnProperties, getType, isBareImport, isExternalUrl, isNegativeNaN, isObject, isPrimitive, nanoid, noop, notNullish, objectAttr, ordinal, shuffle, slash, splitFileAndPostfix, toArray, unique, unwrapId, withTrailingSlash, wrapId };\n"],"x_google_ignoreList":[0],"mappings":";;;;;;AAoCA,SAAS,uBAAuB,SAAS;CACxC,MAAM,EAAE,UAAU,uBAAuB,kBAAkB,MAAM,WAAW,CAAC;CAC7E,MAAM,QAAQ,MAAM;CACpB,MAAM,oBAAoB,MAAM;CAChC,MAAM,kBAAkB;CACxB,MAAM,qBAAqB,MAAM,EAAE;CAEnC,MAAM,aAAa,IADH,MAAM,OACD,CAAC,CAAC,SAAS;CAChC,MAAM,oBAAoB;CAC1B,MAAM,kBAAkB;CACxB,OAAO;AACR;AACA,SAAS,WAAW,GAAG;CACtB,OAAO,KAAK;AACb;AACA,SAAS,YAAY,OAAO,MAAM,OAAO;CACxC,MAAM,eAAe,OAAO;CAE5B,IAAI,CADS,MAAM,SAAS,YACpB,GACP,MAAM,IAAI,UAAU,GAAG,KAAK,iBAAiB,MAAM,KAAK,MAAM,EAAE,cAAc,aAAa,EAAE;AAE/F;AACA,SAAS,YAAY,OAAO;CAC3B,OAAO,UAAU,QAAQ,OAAO,UAAU,cAAc,OAAO,UAAU;AAC1E;AAqCA,SAAS,kBAAkB,GAAG;CAC7B,MAAM,SAAS,CAAC;CAChB,IAAI,eAAe;CACnB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,GAC/B,IAAI,iBAAiB,cACpB;MAAI,EAAE,OAAO,MACZ,eAAe;CAChB,OACM,IAAI,iBAAiB,aAC3B;MAAI,EAAE,IAAI,OAAO,OAAO,EAAE,OAAO,KAChC,eAAe;CAChB,OACM,IAAI,iBAAiB,QAC3B,IAAI,EAAE,OAAO,OAAO,EAAE,IAAI,OAAO,KAChC,eAAe;MACT,IAAI,EAAE,OAAO,OAAO,EAAE,IAAI,OAAO,KAAK;EAC5C,eAAe;EACf,KAAK;CACN,OACC,OAAO,KAAK,EAAE,EAAE;CAInB,OAAO,OAAO,KAAK,EAAE;AACtB;AAKA,SAAS,QAAQ,OAAO;CACvB,IAAI,UAAU,QAAQ,UAAU,QAC/B,QAAQ,CAAC;CAEV,IAAI,MAAM,QAAQ,KAAK,GACtB,OAAO;CAER,OAAO,CAAC,KAAK;AACd;AACA,SAAS,SAAS,MAAM;CACvB,OAAO,QAAQ,QAAQ,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,IAAI;AACvE;AACA,SAAS,WAAW,KAAK;CACxB,OAAO,QAAQ,OAAO,aAAa,QAAQ,SAAS,aAAa,QAAQ,OAAO;AACjF;AACA,SAAS,QAAQ,OAAO;CACvB,OAAO,OAAO,UAAU,SAAS,MAAM,KAAK,CAAC,CAAC,MAAM,GAAG,EAAE;AAC1D;AACA,SAAS,qBAAqB,KAAK,WAAW;CAC7C,MAAM,UAAU,OAAO,cAAc,aAAa,aAAa,QAAQ,UAAU,IAAI,GAAG;CACxF,OAAO,oBAAoB,GAAG,CAAC,CAAC,QAAQ,OAAO;CAC/C,OAAO,sBAAsB,GAAG,CAAC,CAAC,QAAQ,OAAO;AAClD;AACA,SAAS,iBAAiB,KAAK;CAC9B,MAAM,2BAAW,IAAI,IAAI;CACzB,IAAI,WAAW,GAAG,GACjB,OAAO,CAAC;CAET,qBAAqB,KAAK,QAAQ;CAClC,OAAO,MAAM,KAAK,QAAQ;AAC3B;AACA,MAAM,sBAAsB,EAAE,eAAe,MAAM;AACnD,SAAS,UAAU,KAAK,UAAU,qBAAqB;CAEtD,OAAO,MAAM,qBAAK,IADD,QACI,GAAG,OAAO;AAChC;AACA,SAAS,MAAM,KAAK,MAAM,UAAU,qBAAqB;CACxD,IAAI,GAAG;CACP,IAAI,KAAK,IAAI,GAAG,GACf,OAAO,KAAK,IAAI,GAAG;CAEpB,IAAI,MAAM,QAAQ,GAAG,GAAG;EACvB,MAAM,MAAM,KAAK,EAAE,QAAQ,IAAI,IAAI,OAAO,CAAC;EAC3C,KAAK,IAAI,KAAK,GAAG;EACjB,OAAO,KACN,IAAI,KAAK,MAAM,IAAI,IAAI,MAAM,OAAO;EAErC,OAAO;CACR;CACA,IAAI,OAAO,UAAU,SAAS,KAAK,GAAG,MAAM,mBAAmB;EAC9D,MAAM,OAAO,OAAO,OAAO,eAAe,GAAG,CAAC;EAC9C,KAAK,IAAI,KAAK,GAAG;EAEjB,MAAM,QAAQ,iBAAiB,GAAG;EAClC,KAAK,MAAM,KAAK,OAAO;GACtB,MAAM,aAAa,OAAO,yBAAyB,KAAK,CAAC;GACzD,IAAI,CAAC,YACJ;GAED,MAAM,SAAS,MAAM,IAAI,IAAI,MAAM,OAAO;GAC1C,IAAI,QAAQ,eACX,OAAO,eAAe,KAAK,GAAG;IAC7B,YAAY,WAAW;IACvB,cAAc;IACd,UAAU;IACV,OAAO;GACR,CAAC;QACK,IAAI,SAAS,YACnB,OAAO,eAAe,KAAK,GAAG;IAC7B,GAAG;IACH,MAAM;KACL,OAAO;IACR;GACD,CAAC;QAED,OAAO,eAAe,KAAK,GAAG;IAC7B,GAAG;IACH,OAAO;GACR,CAAC;EAEH;EACA,OAAO;CACR;CACA,OAAO;AACR;AACA,SAAS,OAAO,CAAC;AACjB,SAAS,WAAW,QAAQ,MAAM,eAAe,QAAW;CAE3D,MAAM,QAAQ,KAAK,QAAQ,cAAc,KAAK,CAAC,CAAC,MAAM,GAAG;CACzD,IAAI,SAAS;CACb,KAAK,MAAM,KAAK,OAAO;EACtB,SAAS,IAAI,OAAO,MAAM,CAAC,CAAC;EAC5B,IAAI,WAAW,QACd,OAAO;CAET;CACA,OAAO;AACR;AACA,SAAS,cAAc;CACtB,IAAI,UAAU;CACd,IAAI,SAAS;CACb,MAAM,IAAI,IAAI,SAAS,UAAU,YAAY;EAC5C,UAAU;EACV,SAAS;CACV,CAAC;CACD,EAAE,UAAU;CACZ,EAAE,SAAS;CACX,OAAO;AACR;;;;;;;;;;AAUA,SAAS,iBAAiB,MAAM;CAC/B,IAAI,YAAY;CAChB,IAAI,WAAW;CACf,IAAI,iBAAiB;CACrB,IAAI,eAAe;CACnB,IAAI,aAAa;CACjB,OAAO,aAAa,KAAK,QAAQ;EAChC,aAAa,KAAK;EAClB;EACA,MAAM,OAAO,KAAK;EAElB,KADqB,SAAS,QAAQ,SAAS,OAAO,SAAS,QAC3C,eAAe,MAClC;OAAI,aAAa,MAChB,WAAW;QACL,IAAI,CAAC,UACX,WAAW;EACZ;EAED,IAAI,CAAC,UAAU;GACd,IAAI,SAAS,KACZ;GAED,IAAI,SAAS,KACZ;EAEF;EACA,IAAI,kBAAkB,gBAAgB,mBAAmB,cACxD,OAAO;CAET;CACA,OAAO;AACR;AACA,SAAS,cAAc,KAAK;CAC3B,IAAI,CAAC,OAAO,MAAM,GAAG,GACpB,OAAO;CAER,MAAM,MAAM,IAAI,aAAa,CAAC;CAC9B,IAAI,KAAK;CAGT,OADmB,IADH,YAAY,IAAI,MACX,CAAC,CAAC,OAAO,OAAO;AAEtC;AAUA,SAAS,QAAQ,GAAG;CACnB,MAAM,IAAI,IAAI;CACd,MAAM,IAAI,IAAI;CACd,IAAI,MAAM,KAAK,MAAM,IACpB,OAAO,GAAG,EAAE;CAEb,IAAI,MAAM,KAAK,MAAM,IACpB,OAAO,GAAG,EAAE;CAEb,IAAI,MAAM,KAAK,MAAM,IACpB,OAAO,GAAG,EAAE;CAEb,OAAO,GAAG,EAAE;AACb;AA+BA,SAAS,OAAO,OAAO;CACtB,OAAO,MAAM,KAAK,IAAI,IAAI,KAAK,CAAC;AACjC"}

package/esm/node_modules/@vitest/utils/dist/offset.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"offset.mjs","names":[],"sources":["../../../../../../../../../../node_modules/@vitest/utils/dist/offset.js"],"sourcesContent":["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) {\n\t\treturn source.length;\n\t}\n\tfor (let i = 0; i < lineNumber - 1; i++) {\n\t\tstart += lines[i].length + nl;\n\t}\n\treturn start + columnNumber;\n}\nfunction offsetToLineNumber(source, offset) {\n\tif (offset > source.length) {\n\t\tthrow new Error(`offset is longer than source length! offset ${offset} > length ${source.length}`);\n\t}\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) {\n\t\t\tbreak;\n\t\t}\n\t\tcounted += lineLength;\n\t}\n\treturn line + 1;\n}\n\nexport { lineSplitRE, offsetToLineNumber, positionToOffset };\n"],"x_google_ignoreList":[0],"mappings":";AAAA,MAAM,cAAc;AACpB,SAAS,iBAAiB,QAAQ,YAAY,cAAc;CAC3D,MAAM,QAAQ,OAAO,MAAM,WAAW;CACtC,MAAM,KAAK,OAAO,KAAK,MAAM,IAAI,IAAI;CACrC,IAAI,QAAQ;CACZ,IAAI,aAAa,MAAM,QACtB,OAAO,OAAO;CAEf,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,GAAG,KACnC,SAAS,MAAM,EAAE,CAAC,SAAS;CAE5B,OAAO,QAAQ;AAChB;AACA,SAAS,mBAAmB,QAAQ,QAAQ;CAC3C,IAAI,SAAS,OAAO,QACnB,MAAM,IAAI,MAAM,+CAA+C,OAAO,YAAY,OAAO,QAAQ;CAElG,MAAM,QAAQ,OAAO,MAAM,WAAW;CACtC,MAAM,KAAK,OAAO,KAAK,MAAM,IAAI,IAAI;CACrC,IAAI,UAAU;CACd,IAAI,OAAO;CACX,OAAO,OAAO,MAAM,QAAQ,QAAQ;EACnC,MAAM,aAAa,MAAM,KAAK,CAAC,SAAS;EACxC,IAAI,UAAU,cAAc,QAC3B;EAED,WAAW;CACZ;CACA,OAAO,OAAO;AACf"}

package/esm/node_modules/@vitest/utils/dist/serialize.mjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"serialize.mjs","names":[],"sources":["../../../../../../../../../../node_modules/@vitest/utils/dist/serialize.js"],"sourcesContent":["const 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) {\n\t\treturn `<unserializable>: ${err.message}`;\n\t}\n\tif (typeof err === \"string\") {\n\t\treturn `<unserializable>: ${err}`;\n\t}\n\treturn \"<unserializable>\";\n}\n// https://developer.mozilla.org/en-US/docs/Web/API/Web_Workers_API/Structured_clone_algorithm\nfunction serializeValue(val, seen = new WeakMap()) {\n\tif (!val || typeof val === \"string\") {\n\t\treturn val;\n\t}\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\") {\n\t\t\t\tsafe(() => jsonValue.message ??= normalizeErrorMessage(val.message));\n\t\t\t}\n\t\t\tif (typeof val.stack === \"string\") {\n\t\t\t\tsafe(() => jsonValue.stack ??= val.stack);\n\t\t\t}\n\t\t\tif (typeof val.name === \"string\") {\n\t\t\t\tsafe(() => jsonValue.name ??= val.name);\n\t\t\t}\n\t\t\tif (val.cause != null) {\n\t\t\t\tsafe(() => jsonValue.cause ??= serializeValue(val.cause, seen));\n\t\t\t}\n\t\t}\n\t\treturn serializeValue(jsonValue, seen);\n\t}\n\tif (typeof val === \"function\") {\n\t\treturn `Function<${val.name || \"anonymous\"}>`;\n\t}\n\tif (typeof val === \"symbol\") {\n\t\treturn val.toString();\n\t}\n\tif (typeof val !== \"object\") {\n\t\treturn val;\n\t}\n\tif (typeof Buffer !== \"undefined\" && val instanceof Buffer) {\n\t\treturn `<Buffer(${val.length}) ...>`;\n\t}\n\tif (typeof Uint8Array !== \"undefined\" && val instanceof Uint8Array) {\n\t\treturn `<Uint8Array(${val.length}) ...>`;\n\t}\n\t// cannot serialize immutables as immutables\n\tif (isImmutable(val)) {\n\t\treturn serializeValue(val.toJSON(), seen);\n\t}\n\tif (val instanceof Promise || val.constructor && val.constructor.prototype === \"AsyncFunction\") {\n\t\treturn \"Promise\";\n\t}\n\tif (typeof Element !== \"undefined\" && val instanceof Element) {\n\t\treturn val.tagName;\n\t}\n\tif (typeof val.toJSON === \"function\") {\n\t\treturn serializeValue(val.toJSON(), seen);\n\t}\n\tif (seen.has(val)) {\n\t\treturn seen.get(val);\n\t}\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) {\n\t\t\t\t\treturn;\n\t\t\t\t}\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) {\n\t\t\tsafe(() => clone.message = normalizeErrorMessage(val.message));\n\t\t}\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\nexport { serializeValue };\n"],"x_google_ignoreList":[0],"mappings":";AAAA,MAAM,mBAAmB;AACzB,MAAM,uBAAuB;AAC7B,SAAS,YAAY,GAAG;CACvB,OAAO,MAAM,EAAE,yBAAyB,EAAE;AAC3C;AACA,MAAM,eAAe,OAAO,eAAe,CAAC,CAAC;AAC7C,SAAS,yBAAyB,KAAK;CACtC,IAAI,eAAe,OAClB,OAAO,qBAAqB,IAAI;CAEjC,IAAI,OAAO,QAAQ,UAClB,OAAO,qBAAqB;CAE7B,OAAO;AACR;AAEA,SAAS,eAAe,KAAK,uBAAO,IAAI,QAAQ,GAAG;CAClD,IAAI,CAAC,OAAO,OAAO,QAAQ,UAC1B,OAAO;CAER,IAAI,eAAe,SAAS,YAAY,OAAO,OAAO,IAAI,WAAW,YAAY;EAChF,MAAM,YAAY,IAAI,OAAO;EAC7B,IAAI,aAAa,cAAc,OAAO,OAAO,cAAc,UAAU;GACpE,IAAI,OAAO,IAAI,YAAY,UAC1B,WAAW,UAAU,YAAY,sBAAsB,IAAI,OAAO,CAAC;GAEpE,IAAI,OAAO,IAAI,UAAU,UACxB,WAAW,UAAU,UAAU,IAAI,KAAK;GAEzC,IAAI,OAAO,IAAI,SAAS,UACvB,WAAW,UAAU,SAAS,IAAI,IAAI;GAEvC,IAAI,IAAI,SAAS,MAChB,WAAW,UAAU,UAAU,eAAe,IAAI,OAAO,IAAI,CAAC;EAEhE;EACA,OAAO,eAAe,WAAW,IAAI;CACtC;CACA,IAAI,OAAO,QAAQ,YAClB,OAAO,YAAY,IAAI,QAAQ,YAAY;CAE5C,IAAI,OAAO,QAAQ,UAClB,OAAO,IAAI,SAAS;CAErB,IAAI,OAAO,QAAQ,UAClB,OAAO;CAER,IAAI,OAAO,WAAW,eAAe,eAAe,QACnD,OAAO,WAAW,IAAI,OAAO;CAE9B,IAAI,OAAO,eAAe,eAAe,eAAe,YACvD,OAAO,eAAe,IAAI,OAAO;CAGlC,IAAI,YAAY,GAAG,GAClB,OAAO,eAAe,IAAI,OAAO,GAAG,IAAI;CAEzC,IAAI,eAAe,WAAW,IAAI,eAAe,IAAI,YAAY,cAAc,iBAC9E,OAAO;CAER,IAAI,OAAO,YAAY,eAAe,eAAe,SACpD,OAAO,IAAI;CAEZ,IAAI,OAAO,IAAI,WAAW,YACzB,OAAO,eAAe,IAAI,OAAO,GAAG,IAAI;CAEzC,IAAI,KAAK,IAAI,GAAG,GACf,OAAO,KAAK,IAAI,GAAG;CAEpB,IAAI,MAAM,QAAQ,GAAG,GAAG;EAEvB,MAAM,QAAQ,IAAI,MAAM,IAAI,MAAM;EAClC,KAAK,IAAI,KAAK,KAAK;EACnB,IAAI,SAAS,GAAG,MAAM;GACrB,IAAI;IACH,MAAM,KAAK,eAAe,GAAG,IAAI;GAClC,SAAS,KAAK;IACb,MAAM,KAAK,yBAAyB,GAAG;GACxC;EACD,CAAC;EACD,OAAO;CACR,OAAO;EAGN,MAAM,QAAQ,OAAO,OAAO,IAAI;EAChC,KAAK,IAAI,KAAK,KAAK;EACnB,IAAI,MAAM;EACV,OAAO,OAAO,QAAQ,cAAc;GACnC,OAAO,oBAAoB,GAAG,CAAC,CAAC,SAAS,QAAQ;IAChD,IAAI,OAAO,OACV;IAED,IAAI;KACH,MAAM,OAAO,eAAe,IAAI,MAAM,IAAI;IAC3C,SAAS,KAAK;KAEb,OAAO,MAAM;KACb,MAAM,OAAO,yBAAyB,GAAG;IAC1C;GACD,CAAC;GACD,MAAM,OAAO,eAAe,GAAG;EAChC;EACA,IAAI,eAAe,OAClB,WAAW,MAAM,UAAU,sBAAsB,IAAI,OAAO,CAAC;EAE9D,OAAO;CACR;AACD;AACA,SAAS,KAAK,IAAI;CACjB,IAAI;EACH,OAAO,GAAG;CACX,QAAQ,CAAC;AACV;AACA,SAAS,sBAAsB,SAAS;CACvC,OAAO,QAAQ,QAAQ,8CAA8C,IAAI,CAAC,CAAC,QAAQ,0CAA0C,EAAE,CAAC,CAAC,QAAQ,kCAAkC,MAAM;AAClL"}