npm - @nostrwatch/utils - Versions diffs - 0.2.0 - Mend

@nostrwatch/utils 0.2.0

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 (1169) hide show

package/dist/browser/node_modules/.pnpm/@vitest_utils@0.34.6/node_modules/@vitest/utils/dist/source-map.amd.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"source-map.amd.js","sources":["../../../../../../../../../../../node_modules/.pnpm/@vitest+utils@0.34.6/node_modules/@vitest/utils/dist/source-map.js"],"sourcesContent":["import { notNullish, isPrimitive } from './helpers.js';\n\nfunction normalizeWindowsPath(input = \"\") {\n if (!input || !input.includes(\"\\\\\")) {\n return input;\n }\n return input.replace(/\\\\/g, \"/\");\n}\nconst _IS_ABSOLUTE_RE = /^[/\\\\](?![/\\\\])|^[/\\\\]{2}(?!\\.)|^[A-Za-z]:[/\\\\]/;\nfunction cwd() {\n if (typeof process !== \"undefined\") {\n return process.cwd().replace(/\\\\/g, \"/\");\n }\n return \"/\";\n}\nconst resolve$2 = 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};\n\nconst comma = ','.charCodeAt(0);\nconst chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';\nconst intToChar = new Uint8Array(64); // 64 possible chars.\nconst charToInt = new Uint8Array(128); // z is 122 in ASCII\nfor (let i = 0; i < chars.length; i++) {\n const c = chars.charCodeAt(i);\n intToChar[i] = c;\n charToInt[c] = i;\n}\nfunction decode(mappings) {\n const state = new Int32Array(5);\n const decoded = [];\n let index = 0;\n do {\n const semi = indexOf(mappings, index);\n const line = [];\n let sorted = true;\n let lastCol = 0;\n state[0] = 0;\n for (let i = index; i < semi; i++) {\n let seg;\n i = decodeInteger(mappings, i, state, 0); // genColumn\n const col = state[0];\n if (col < lastCol)\n sorted = false;\n lastCol = col;\n if (hasMoreVlq(mappings, i, semi)) {\n i = decodeInteger(mappings, i, state, 1); // sourcesIndex\n i = decodeInteger(mappings, i, state, 2); // sourceLine\n i = decodeInteger(mappings, i, state, 3); // sourceColumn\n if (hasMoreVlq(mappings, i, semi)) {\n i = decodeInteger(mappings, i, state, 4); // namesIndex\n seg = [col, state[1], state[2], state[3], state[4]];\n }\n else {\n seg = [col, state[1], state[2], state[3]];\n }\n }\n else {\n seg = [col];\n }\n line.push(seg);\n }\n if (!sorted)\n sort(line);\n decoded.push(line);\n index = semi + 1;\n } while (index <= mappings.length);\n return decoded;\n}\nfunction indexOf(mappings, index) {\n const idx = mappings.indexOf(';', index);\n return idx === -1 ? mappings.length : idx;\n}\nfunction decodeInteger(mappings, pos, state, j) {\n let value = 0;\n let shift = 0;\n let integer = 0;\n do {\n const c = mappings.charCodeAt(pos++);\n integer = charToInt[c];\n value |= (integer & 31) << shift;\n shift += 5;\n } while (integer & 32);\n const shouldNegate = value & 1;\n value >>>= 1;\n if (shouldNegate) {\n value = -0x80000000 | -value;\n }\n state[j] += value;\n return pos;\n}\nfunction hasMoreVlq(mappings, i, length) {\n if (i >= length)\n return false;\n return mappings.charCodeAt(i) !== comma;\n}\nfunction sort(line) {\n line.sort(sortComparator$1);\n}\nfunction sortComparator$1(a, b) {\n return a[0] - b[0];\n}\n\n// Matches the scheme of a URL, eg \"http://\"\nconst schemeRegex = /^[\\w+.-]+:\\/\\//;\n/**\n * Matches the parts of a URL:\n * 1. Scheme, including \":\", guaranteed.\n * 2. User/password, including \"@\", optional.\n * 3. Host, guaranteed.\n * 4. Port, including \":\", optional.\n * 5. Path, including \"/\", optional.\n * 6. Query, including \"?\", optional.\n * 7. Hash, including \"#\", optional.\n */\nconst urlRegex = /^([\\w+.-]+:)\\/\\/([^@/#?]*@)?([^:/#?]*)(:\\d+)?(\\/[^#?]*)?(\\?[^#]*)?(#.*)?/;\n/**\n * File URLs are weird. They dont' need the regular `//` in the scheme, they may or may not start\n * with a leading `/`, they can have a domain (but only if they don't start with a Windows drive).\n *\n * 1. Host, optional.\n * 2. Path, which may include \"/\", guaranteed.\n * 3. Query, including \"?\", optional.\n * 4. Hash, including \"#\", optional.\n */\nconst fileRegex = /^file:(?:\\/\\/((?![a-z]:)[^/#?]*)?)?(\\/?[^#?]*)(\\?[^#]*)?(#.*)?/i;\nvar UrlType;\n(function (UrlType) {\n UrlType[UrlType[\"Empty\"] = 1] = \"Empty\";\n UrlType[UrlType[\"Hash\"] = 2] = \"Hash\";\n UrlType[UrlType[\"Query\"] = 3] = \"Query\";\n UrlType[UrlType[\"RelativePath\"] = 4] = \"RelativePath\";\n UrlType[UrlType[\"AbsolutePath\"] = 5] = \"AbsolutePath\";\n UrlType[UrlType[\"SchemeRelative\"] = 6] = \"SchemeRelative\";\n UrlType[UrlType[\"Absolute\"] = 7] = \"Absolute\";\n})(UrlType || (UrlType = {}));\nfunction isAbsoluteUrl(input) {\n return schemeRegex.test(input);\n}\nfunction isSchemeRelativeUrl(input) {\n return input.startsWith('//');\n}\nfunction isAbsolutePath(input) {\n return input.startsWith('/');\n}\nfunction isFileUrl(input) {\n return input.startsWith('file:');\n}\nfunction isRelative(input) {\n return /^[.?#]/.test(input);\n}\nfunction parseAbsoluteUrl(input) {\n const match = urlRegex.exec(input);\n return makeUrl(match[1], match[2] || '', match[3], match[4] || '', match[5] || '/', match[6] || '', match[7] || '');\n}\nfunction parseFileUrl(input) {\n const match = fileRegex.exec(input);\n const path = match[2];\n return makeUrl('file:', '', match[1] || '', '', isAbsolutePath(path) ? path : '/' + path, match[3] || '', match[4] || '');\n}\nfunction makeUrl(scheme, user, host, port, path, query, hash) {\n return {\n scheme,\n user,\n host,\n port,\n path,\n query,\n hash,\n type: UrlType.Absolute,\n };\n}\nfunction parseUrl(input) {\n if (isSchemeRelativeUrl(input)) {\n const url = parseAbsoluteUrl('http:' + input);\n url.scheme = '';\n url.type = UrlType.SchemeRelative;\n return url;\n }\n if (isAbsolutePath(input)) {\n const url = parseAbsoluteUrl('http://foo.com' + input);\n url.scheme = '';\n url.host = '';\n url.type = UrlType.AbsolutePath;\n return url;\n }\n if (isFileUrl(input))\n return parseFileUrl(input);\n if (isAbsoluteUrl(input))\n return parseAbsoluteUrl(input);\n const url = parseAbsoluteUrl('http://foo.com/' + input);\n url.scheme = '';\n url.host = '';\n url.type = input\n ? input.startsWith('?')\n ? UrlType.Query\n : input.startsWith('#')\n ? UrlType.Hash\n : UrlType.RelativePath\n : UrlType.Empty;\n return url;\n}\nfunction stripPathFilename(path) {\n // If a path ends with a parent directory \"..\", then it's a relative path with excess parent\n // paths. It's not a file, so we can't strip it.\n if (path.endsWith('/..'))\n return path;\n const index = path.lastIndexOf('/');\n return path.slice(0, index + 1);\n}\nfunction mergePaths(url, base) {\n normalizePath(base, base.type);\n // If the path is just a \"/\", then it was an empty path to begin with (remember, we're a relative\n // path).\n if (url.path === '/') {\n url.path = base.path;\n }\n else {\n // Resolution happens relative to the base path's directory, not the file.\n url.path = stripPathFilename(base.path) + url.path;\n }\n}\n/**\n * The path can have empty directories \"//\", unneeded parents \"foo/..\", or current directory\n * \"foo/.\". We need to normalize to a standard representation.\n */\nfunction normalizePath(url, type) {\n const rel = type <= UrlType.RelativePath;\n const pieces = url.path.split('/');\n // We need to preserve the first piece always, so that we output a leading slash. The item at\n // pieces[0] is an empty string.\n let pointer = 1;\n // Positive is the number of real directories we've output, used for popping a parent directory.\n // Eg, \"foo/bar/..\" will have a positive 2, and we can decrement to be left with just \"foo\".\n let positive = 0;\n // We need to keep a trailing slash if we encounter an empty directory (eg, splitting \"foo/\" will\n // generate `[\"foo\", \"\"]` pieces). And, if we pop a parent directory. But once we encounter a\n // real directory, we won't need to append, unless the other conditions happen again.\n let addTrailingSlash = false;\n for (let i = 1; i < pieces.length; i++) {\n const piece = pieces[i];\n // An empty directory, could be a trailing slash, or just a double \"//\" in the path.\n if (!piece) {\n addTrailingSlash = true;\n continue;\n }\n // If we encounter a real directory, then we don't need to append anymore.\n addTrailingSlash = false;\n // A current directory, which we can always drop.\n if (piece === '.')\n continue;\n // A parent directory, we need to see if there are any real directories we can pop. Else, we\n // have an excess of parents, and we'll need to keep the \"..\".\n if (piece === '..') {\n if (positive) {\n addTrailingSlash = true;\n positive--;\n pointer--;\n }\n else if (rel) {\n // If we're in a relativePath, then we need to keep the excess parents. Else, in an absolute\n // URL, protocol relative URL, or an absolute path, we don't need to keep excess.\n pieces[pointer++] = piece;\n }\n continue;\n }\n // We've encountered a real directory. Move it to the next insertion pointer, which accounts for\n // any popped or dropped directories.\n pieces[pointer++] = piece;\n positive++;\n }\n let path = '';\n for (let i = 1; i < pointer; i++) {\n path += '/' + pieces[i];\n }\n if (!path || (addTrailingSlash && !path.endsWith('/..'))) {\n path += '/';\n }\n url.path = path;\n}\n/**\n * Attempts to resolve `input` URL/path relative to `base`.\n */\nfunction resolve$1(input, base) {\n if (!input && !base)\n return '';\n const url = parseUrl(input);\n let inputType = url.type;\n if (base && inputType !== UrlType.Absolute) {\n const baseUrl = parseUrl(base);\n const baseType = baseUrl.type;\n switch (inputType) {\n case UrlType.Empty:\n url.hash = baseUrl.hash;\n // fall through\n case UrlType.Hash:\n url.query = baseUrl.query;\n // fall through\n case UrlType.Query:\n case UrlType.RelativePath:\n mergePaths(url, baseUrl);\n // fall through\n case UrlType.AbsolutePath:\n // The host, user, and port are joined, you can't copy one without the others.\n url.user = baseUrl.user;\n url.host = baseUrl.host;\n url.port = baseUrl.port;\n // fall through\n case UrlType.SchemeRelative:\n // The input doesn't have a schema at least, so we need to copy at least that over.\n url.scheme = baseUrl.scheme;\n }\n if (baseType > inputType)\n inputType = baseType;\n }\n normalizePath(url, inputType);\n const queryHash = url.query + url.hash;\n switch (inputType) {\n // This is impossible, because of the empty checks at the start of the function.\n // case UrlType.Empty:\n case UrlType.Hash:\n case UrlType.Query:\n return queryHash;\n case UrlType.RelativePath: {\n // The first char is always a \"/\", and we need it to be relative.\n const path = url.path.slice(1);\n if (!path)\n return queryHash || '.';\n if (isRelative(base || input) && !isRelative(path)) {\n // If base started with a leading \".\", or there is no base and input started with a \".\",\n // then we need to ensure that the relative path starts with a \".\". We don't know if\n // relative starts with a \"..\", though, so check before prepending.\n return './' + path + queryHash;\n }\n return path + queryHash;\n }\n case UrlType.AbsolutePath:\n return url.path + queryHash;\n default:\n return url.scheme + '//' + url.user + url.host + url.port + url.path + queryHash;\n }\n}\n\nfunction resolve(input, base) {\n // The base is always treated as a directory, if it's not empty.\n // https://github.com/mozilla/source-map/blob/8cb3ee57/lib/util.js#L327\n // https://github.com/chromium/chromium/blob/da4adbb3/third_party/blink/renderer/devtools/front_end/sdk/SourceMap.js#L400-L401\n if (base && !base.endsWith('/'))\n base += '/';\n return resolve$1(input, base);\n}\n\n/**\n * Removes everything after the last \"/\", but leaves the slash.\n */\nfunction stripFilename(path) {\n if (!path)\n return '';\n const index = path.lastIndexOf('/');\n return path.slice(0, index + 1);\n}\n\nconst COLUMN = 0;\nconst SOURCES_INDEX = 1;\nconst SOURCE_LINE = 2;\nconst SOURCE_COLUMN = 3;\nconst NAMES_INDEX = 4;\nconst REV_GENERATED_LINE = 1;\nconst REV_GENERATED_COLUMN = 2;\n\nfunction maybeSort(mappings, owned) {\n const unsortedIndex = nextUnsortedSegmentLine(mappings, 0);\n if (unsortedIndex === mappings.length)\n return mappings;\n // If we own the array (meaning we parsed it from JSON), then we're free to directly mutate it. If\n // not, we do not want to modify the consumer's input array.\n if (!owned)\n mappings = mappings.slice();\n for (let i = unsortedIndex; i < mappings.length; i = nextUnsortedSegmentLine(mappings, i + 1)) {\n mappings[i] = sortSegments(mappings[i], owned);\n }\n return mappings;\n}\nfunction nextUnsortedSegmentLine(mappings, start) {\n for (let i = start; i < mappings.length; i++) {\n if (!isSorted(mappings[i]))\n return i;\n }\n return mappings.length;\n}\nfunction isSorted(line) {\n for (let j = 1; j < line.length; j++) {\n if (line[j][COLUMN] < line[j - 1][COLUMN]) {\n return false;\n }\n }\n return true;\n}\nfunction sortSegments(line, owned) {\n if (!owned)\n line = line.slice();\n return line.sort(sortComparator);\n}\nfunction sortComparator(a, b) {\n return a[COLUMN] - b[COLUMN];\n}\n\nlet found = false;\n/**\n * A binary search implementation that returns the index if a match is found.\n * If no match is found, then the left-index (the index associated with the item that comes just\n * before the desired index) is returned. To maintain proper sort order, a splice would happen at\n * the next index:\n *\n * ```js\n * const array = [1, 3];\n * const needle = 2;\n * const index = binarySearch(array, needle, (item, needle) => item - needle);\n *\n * assert.equal(index, 0);\n * array.splice(index + 1, 0, needle);\n * assert.deepEqual(array, [1, 2, 3]);\n * ```\n */\nfunction binarySearch(haystack, needle, low, high) {\n while (low <= high) {\n const mid = low + ((high - low) >> 1);\n const cmp = haystack[mid][COLUMN] - needle;\n if (cmp === 0) {\n found = true;\n return mid;\n }\n if (cmp < 0) {\n low = mid + 1;\n }\n else {\n high = mid - 1;\n }\n }\n found = false;\n return low - 1;\n}\nfunction upperBound(haystack, needle, index) {\n for (let i = index + 1; i < haystack.length; index = i++) {\n if (haystack[i][COLUMN] !== needle)\n break;\n }\n return index;\n}\nfunction lowerBound(haystack, needle, index) {\n for (let i = index - 1; i >= 0; index = i--) {\n if (haystack[i][COLUMN] !== needle)\n break;\n }\n return index;\n}\nfunction memoizedState() {\n return {\n lastKey: -1,\n lastNeedle: -1,\n lastIndex: -1,\n };\n}\n/**\n * This overly complicated beast is just to record the last tested line/column and the resulting\n * index, allowing us to skip a few tests if mappings are monotonically increasing.\n */\nfunction memoizedBinarySearch(haystack, needle, state, key) {\n const { lastKey, lastNeedle, lastIndex } = state;\n let low = 0;\n let high = haystack.length - 1;\n if (key === lastKey) {\n if (needle === lastNeedle) {\n found = lastIndex !== -1 && haystack[lastIndex][COLUMN] === needle;\n return lastIndex;\n }\n if (needle >= lastNeedle) {\n // lastIndex may be -1 if the previous needle was not found.\n low = lastIndex === -1 ? 0 : lastIndex;\n }\n else {\n high = lastIndex;\n }\n }\n state.lastKey = key;\n state.lastNeedle = needle;\n return (state.lastIndex = binarySearch(haystack, needle, low, high));\n}\n\n// Rebuilds the original source files, with mappings that are ordered by source line/column instead\n// of generated line/column.\nfunction buildBySources(decoded, memos) {\n const sources = memos.map(buildNullArray);\n for (let i = 0; i < decoded.length; i++) {\n const line = decoded[i];\n for (let j = 0; j < line.length; j++) {\n const seg = line[j];\n if (seg.length === 1)\n continue;\n const sourceIndex = seg[SOURCES_INDEX];\n const sourceLine = seg[SOURCE_LINE];\n const sourceColumn = seg[SOURCE_COLUMN];\n const originalSource = sources[sourceIndex];\n const originalLine = (originalSource[sourceLine] || (originalSource[sourceLine] = []));\n const memo = memos[sourceIndex];\n // The binary search either found a match, or it found the left-index just before where the\n // segment should go. Either way, we want to insert after that. And there may be multiple\n // generated segments associated with an original location, so there may need to move several\n // indexes before we find where we need to insert.\n const index = upperBound(originalLine, sourceColumn, memoizedBinarySearch(originalLine, sourceColumn, memo, sourceLine));\n insert(originalLine, (memo.lastIndex = index + 1), [sourceColumn, i, seg[COLUMN]]);\n }\n }\n return sources;\n}\nfunction insert(array, index, value) {\n for (let i = array.length; i > index; i--) {\n array[i] = array[i - 1];\n }\n array[index] = value;\n}\n// Null arrays allow us to use ordered index keys without actually allocating contiguous memory like\n// a real array. We use a null-prototype object to avoid prototype pollution and deoptimizations.\n// Numeric properties on objects are magically sorted in ascending order by the engine regardless of\n// the insertion order. So, by setting any numeric keys, even out of order, we'll get ascending\n// order when iterating with for-in.\nfunction buildNullArray() {\n return { __proto__: null };\n}\n\nconst LINE_GTR_ZERO = '`line` must be greater than 0 (lines start at line 1)';\nconst COL_GTR_EQ_ZERO = '`column` must be greater than or equal to 0 (columns start at column 0)';\nconst LEAST_UPPER_BOUND = -1;\nconst GREATEST_LOWER_BOUND = 1;\n/**\n * Returns the decoded (array of lines of segments) form of the SourceMap's mappings field.\n */\nlet decodedMappings;\n/**\n * A higher-level API to find the source/line/column associated with a generated line/column\n * (think, from a stack trace). Line is 1-based, but column is 0-based, due to legacy behavior in\n * `source-map` library.\n */\nlet originalPositionFor;\n/**\n * Finds the generated line/column position of the provided source/line/column source position.\n */\nlet generatedPositionFor;\nclass TraceMap {\n constructor(map, mapUrl) {\n const isString = typeof map === 'string';\n if (!isString && map._decodedMemo)\n return map;\n const parsed = (isString ? JSON.parse(map) : map);\n const { version, file, names, sourceRoot, sources, sourcesContent } = parsed;\n this.version = version;\n this.file = file;\n this.names = names;\n this.sourceRoot = sourceRoot;\n this.sources = sources;\n this.sourcesContent = sourcesContent;\n const from = resolve(sourceRoot || '', stripFilename(mapUrl));\n this.resolvedSources = sources.map((s) => resolve(s || '', from));\n const { mappings } = parsed;\n if (typeof mappings === 'string') {\n this._encoded = mappings;\n this._decoded = undefined;\n }\n else {\n this._encoded = undefined;\n this._decoded = maybeSort(mappings, isString);\n }\n this._decodedMemo = memoizedState();\n this._bySources = undefined;\n this._bySourceMemos = undefined;\n }\n}\n(() => {\n decodedMappings = (map) => {\n return (map._decoded || (map._decoded = decode(map._encoded)));\n };\n originalPositionFor = (map, { line, column, bias }) => {\n line--;\n if (line < 0)\n throw new Error(LINE_GTR_ZERO);\n if (column < 0)\n throw new Error(COL_GTR_EQ_ZERO);\n const decoded = decodedMappings(map);\n // It's common for parent source maps to have pointers to lines that have no\n // mapping (like a \"//# sourceMappingURL=\") at the end of the child file.\n if (line >= decoded.length)\n return OMapping(null, null, null, null);\n const segments = decoded[line];\n const index = traceSegmentInternal(segments, map._decodedMemo, line, column, bias || GREATEST_LOWER_BOUND);\n if (index === -1)\n return OMapping(null, null, null, null);\n const segment = segments[index];\n if (segment.length === 1)\n return OMapping(null, null, null, null);\n const { names, resolvedSources } = map;\n return OMapping(resolvedSources[segment[SOURCES_INDEX]], segment[SOURCE_LINE] + 1, segment[SOURCE_COLUMN], segment.length === 5 ? names[segment[NAMES_INDEX]] : null);\n };\n generatedPositionFor = (map, { source, line, column, bias }) => {\n return generatedPosition(map, source, line, column, bias || GREATEST_LOWER_BOUND, false);\n };\n function generatedPosition(map, source, line, column, bias, all) {\n line--;\n if (line < 0)\n throw new Error(LINE_GTR_ZERO);\n if (column < 0)\n throw new Error(COL_GTR_EQ_ZERO);\n const { sources, resolvedSources } = map;\n let sourceIndex = sources.indexOf(source);\n if (sourceIndex === -1)\n sourceIndex = resolvedSources.indexOf(source);\n if (sourceIndex === -1)\n return all ? [] : GMapping(null, null);\n const generated = (map._bySources || (map._bySources = buildBySources(decodedMappings(map), (map._bySourceMemos = sources.map(memoizedState)))));\n const segments = generated[sourceIndex][line];\n if (segments == null)\n return all ? [] : GMapping(null, null);\n const memo = map._bySourceMemos[sourceIndex];\n if (all)\n return sliceGeneratedPositions(segments, memo, line, column, bias);\n const index = traceSegmentInternal(segments, memo, line, column, bias);\n if (index === -1)\n return GMapping(null, null);\n const segment = segments[index];\n return GMapping(segment[REV_GENERATED_LINE] + 1, segment[REV_GENERATED_COLUMN]);\n }\n})();\nfunction OMapping(source, line, column, name) {\n return { source, line, column, name };\n}\nfunction GMapping(line, column) {\n return { line, column };\n}\nfunction traceSegmentInternal(segments, memo, line, column, bias) {\n let index = memoizedBinarySearch(segments, column, memo, line);\n if (found) {\n index = (bias === LEAST_UPPER_BOUND ? upperBound : lowerBound)(segments, column, index);\n }\n else if (bias === LEAST_UPPER_BOUND)\n index++;\n if (index === -1 || index === segments.length)\n return -1;\n return index;\n}\nfunction sliceGeneratedPositions(segments, memo, line, column, bias) {\n let min = traceSegmentInternal(segments, memo, line, column, GREATEST_LOWER_BOUND);\n // We ignored the bias when tracing the segment so that we're guarnateed to find the first (in\n // insertion order) segment that matched. Even if we did respect the bias when tracing, we would\n // still need to call `lowerBound()` to find the first segment, which is slower than just looking\n // for the GREATEST_LOWER_BOUND to begin with. The only difference that matters for us is when the\n // binary search didn't match, in which case GREATEST_LOWER_BOUND just needs to increment to\n // match LEAST_UPPER_BOUND.\n if (!found && bias === LEAST_UPPER_BOUND)\n min++;\n if (min === -1 || min === segments.length)\n return [];\n // We may have found the segment that started at an earlier column. If this is the case, then we\n // need to slice all generated segments that match _that_ column, because all such segments span\n // to our desired column.\n const matchedColumn = found ? column : segments[min][COLUMN];\n // The binary search is not guaranteed to find the lower bound when a match wasn't found.\n if (!found)\n min = lowerBound(segments, matchedColumn, min);\n const max = upperBound(segments, matchedColumn, min);\n const result = [];\n for (; min <= max; min++) {\n const segment = segments[min];\n result.push(GMapping(segment[REV_GENERATED_LINE] + 1, segment[REV_GENERATED_COLUMN]));\n }\n return result;\n}\n\nconst CHROME_IE_STACK_REGEXP = /^\\s*at .*(\\S+:\\d+|\$native\$)/m;\nconst SAFARI_NATIVE_CODE_REGEXP = /^(eval@)?(\\[native code])?$/;\nconst stackIgnorePatterns = [\n \"node:internal\",\n /\\/packages\\/\\w+\\/dist\\//,\n /\\/@vitest\\/\\w+\\/dist\\//,\n \"/vitest/dist/\",\n \"/vitest/src/\",\n \"/vite-node/dist/\",\n \"/vite-node/src/\",\n \"/node_modules/chai/\",\n \"/node_modules/tinypool/\",\n \"/node_modules/tinyspy/\",\n \"/deps/chai.js\",\n /__vitest_browser__/\n];\nfunction extractLocation(urlLike) {\n if (!urlLike.includes(\":\"))\n return [urlLike];\n const regExp = /(.+?)(?::(\\d+))?(?::(\\d+))?$/;\n const parts = regExp.exec(urlLike.replace(/^\$|\$$/g, \"\"));\n if (!parts)\n return [urlLike];\n let url = parts[1];\n if (url.startsWith(\"http:\") || url.startsWith(\"https:\")) {\n const urlObj = new URL(url);\n url = urlObj.pathname;\n }\n if (url.startsWith(\"/@fs/\")) {\n url = url.slice(typeof process !== \"undefined\" && process.platform === \"win32\" ? 5 : 4);\n }\n return [url, parts[2] || void 0, parts[3] || void 0];\n}\nfunction parseSingleFFOrSafariStack(raw) {\n let line = raw.trim();\n if (SAFARI_NATIVE_CODE_REGEXP.test(line))\n return null;\n if (line.includes(\" > eval\"))\n line = line.replace(/ line (\\d+)(?: > eval line \\d+)* > eval:\\d+:\\d+/g, \":$1\");\n if (!line.includes(\"@\") && !line.includes(\":\"))\n return null;\n const functionNameRegex = /((.*\".+\"[^@]*)?[^@]*)(?:@)/;\n const matches = line.match(functionNameRegex);\n const functionName = matches && matches[1] ? matches[1] : void 0;\n const [url, lineNumber, columnNumber] = extractLocation(line.replace(functionNameRegex, \"\"));\n if (!url || !lineNumber || !columnNumber)\n return null;\n return {\n file: url,\n method: functionName || \"\",\n line: Number.parseInt(lineNumber),\n column: Number.parseInt(columnNumber)\n };\n}\nfunction parseSingleStack(raw) {\n const line = raw.trim();\n if (!CHROME_IE_STACK_REGEXP.test(line))\n return parseSingleFFOrSafariStack(line);\n return parseSingleV8Stack(line);\n}\nfunction parseSingleV8Stack(raw) {\n let line = raw.trim();\n if (!CHROME_IE_STACK_REGEXP.test(line))\n return null;\n if (line.includes(\"(eval \"))\n line = line.replace(/eval code/g, \"eval\").replace(/(\$eval at [^()]*)|(,.*$)/g, \"\");\n let sanitizedLine = line.replace(/^\\s+/, \"\").replace(/\\(eval code/g, \"(\").replace(/^.*?\\s+/, \"\");\n const location = sanitizedLine.match(/ (\\(.+\$$)/);\n sanitizedLine = location ? sanitizedLine.replace(location[0], \"\") : sanitizedLine;\n const [url, lineNumber, columnNumber] = extractLocation(location ? location[1] : sanitizedLine);\n let method = location && sanitizedLine || \"\";\n let file = url && [\"eval\", \"<anonymous>\"].includes(url) ? void 0 : url;\n if (!file || !lineNumber || !columnNumber)\n return null;\n if (method.startsWith(\"async \"))\n method = method.slice(6);\n if (file.startsWith(\"file://\"))\n file = file.slice(7);\n file = resolve$2(file);\n if (method)\n method = method.replace(/__vite_ssr_import_\\d+__\\./g, \"\");\n return {\n method,\n file,\n line: Number.parseInt(lineNumber),\n column: Number.parseInt(columnNumber)\n };\n}\nfunction parseStacktrace(stack, options = {}) {\n const { ignoreStackEntries = stackIgnorePatterns } = options;\n let stacks = !CHROME_IE_STACK_REGEXP.test(stack) ? parseFFOrSafariStackTrace(stack) : parseV8Stacktrace(stack);\n if (ignoreStackEntries.length)\n stacks = stacks.filter((stack2) => !ignoreStackEntries.some((p) => stack2.file.match(p)));\n return stacks.map((stack2) => {\n var _a;\n const map = (_a = options.getSourceMap) == null ? void 0 : _a.call(options, stack2.file);\n if (!map || typeof map !== \"object\" || !map.version)\n return stack2;\n const traceMap = new TraceMap(map);\n const { line, column } = originalPositionFor(traceMap, stack2);\n if (line != null && column != null)\n return { ...stack2, line, column };\n return stack2;\n });\n}\nfunction parseFFOrSafariStackTrace(stack) {\n return stack.split(\"\\n\").map((line) => parseSingleFFOrSafariStack(line)).filter(notNullish);\n}\nfunction parseV8Stacktrace(stack) {\n return stack.split(\"\\n\").map((line) => parseSingleV8Stack(line)).filter(notNullish);\n}\nfunction parseErrorStacktrace(e, options = {}) {\n if (!e || isPrimitive(e))\n return [];\n if (e.stacks)\n return e.stacks;\n const stackStr = e.stack || e.stackStr || \"\";\n const stackFrames = parseStacktrace(stackStr, options);\n e.stacks = stackFrames;\n return stackFrames;\n}\n\nexport { TraceMap, generatedPositionFor, originalPositionFor, parseErrorStacktrace, parseSingleFFOrSafariStack, parseSingleStack, parseSingleV8Stack, parseStacktrace };\n"],"names":["_IS_ABSOLUTE_RE","isAbsolute","p","test","chars","intToChar","Uint8Array","charToInt","i","c","charCodeAt","UrlType","CHROME_IE_STACK_REGEXP","SAFARI_NATIVE_CODE_REGEXP","extractLocation","urlLike","includes","parts","exec","replace","url","startsWith","URL","pathname","slice","process","platform","parseSingleFFOrSafariStack","raw","line","trim","functionNameRegex","matches","match","functionName","lineNumber","columnNumber","file","method","Number","parseInt","column","parseSingleV8Stack","sanitizedLine","location","arguments_","resolvedPath","resolvedAbsolute","index","map","argument","normalizeWindowsPath","input","length","path","cwd","normalizeString","allowAboveRoot","res","lastSegmentLength","lastSlash","dots","char","lastSlashIndex","lastIndexOf","resolve$2","parseSingleStack"],"mappings":"6CAQA,MAAMA,EAAkB,kDAoFxB,MAAMC,WAAa,SAASC,GAC1B,OAAOF,EAAgBG,KAAKD,EAC9B,EAGME,EAAQ,mEACRC,EAAY,IAAIC,WAAW,IAC3BC,EAAY,IAAID,WAAW,KACjC,IAAK,IAAIE,EAAI,EAAGA,EAAIJ,GAAcI,IAAK,CACnC,MAAMC,EAAIL,EAAMM,WAAWF,GAC3BH,EAAUG,GAAKC,EACfF,EAAUE,GAAKD,CACnB,CAmGA,IAAIG,GACJ,SAAWA,GACPA,EAAQA,EAAe,MAAI,GAAK,QAChCA,EAAQA,EAAc,KAAI,GAAK,OAC/BA,EAAQA,EAAe,MAAI,GAAK,QAChCA,EAAQA,EAAsB,aAAI,GAAK,eACvCA,EAAQA,EAAsB,aAAI,GAAK,eACvCA,EAAQA,EAAwB,eAAI,GAAK,iBACzCA,EAAQA,EAAkB,SAAI,GAAK,UACtC,CARD,CAQGA,IAAYA,EAAU,CAAA,IA6hBzB,MAAMC,EAAyB,iCACzBC,EAA4B,8BAelC,SAASC,gBAAgBC,GACvB,IAAKA,EAAQC,SAAS,KACpB,MAAO,CAACD,GACV,MACME,EADS,+BACMC,KAAKH,EAAQI,QAAQ,WAAY,KACtD,IAAKF,EACH,MAAO,CAACF,GACV,IAAIK,EAAMH,EAAM,GAChB,GAAIG,EAAIC,WAAW,UAAYD,EAAIC,WAAW,UAAW,CAEvDD,EADe,IAAIE,IAAIF,GACVG,QACjB,CAIE,OAHIH,EAAIC,WAAW,WACjBD,EAAMA,EAAII,MAAyB,oBAAZC,SAAgD,UAArBA,QAAQC,SAAuB,EAAI,IAEhF,CAACN,EAAKH,EAAM,SAAM,EAAQA,EAAM,SAAM,EAC/C,CACA,SAASU,2BAA2BC,GAClC,IAAIC,EAAOD,EAAIE,OACf,GAAIjB,EAA0BV,KAAK0B,GACjC,OAAO,KAGT,GAFIA,EAAKb,SAAS,aAChBa,EAAOA,EAAKV,QAAQ,mDAAoD,SACrEU,EAAKb,SAAS,OAASa,EAAKb,SAAS,KACxC,OAAO,KACT,MAAMe,EAAoB,6BACpBC,EAAUH,EAAKI,MAAMF,GACrBG,EAAeF,GAAWA,EAAQ,GAAKA,EAAQ,QAAK,GACnDZ,EAAKe,EAAYC,GAAgBtB,gBAAgBe,EAAKV,QAAQY,EAAmB,KACxF,OAAKX,GAAQe,GAAeC,EAErB,CACLC,KAAMjB,EACNkB,OAAQJ,GAAgB,GACxBL,KAAMU,OAAOC,SAASL,GACtBM,OAAQF,OAAOC,SAASJ,IALjB,IAOX,CAOA,SAASM,mBAAmBd,GAC1B,IAAIC,EAAOD,EAAIE,OACf,IAAKlB,EAAuBT,KAAK0B,GAC/B,OAAO,KACLA,EAAKb,SAAS,YAChBa,EAAOA,EAAKV,QAAQ,aAAc,QAAQA,QAAQ,6BAA8B,KAClF,IAAIwB,EAAgBd,EAAKV,QAAQ,OAAQ,IAAIA,QAAQ,eAAgB,KAAKA,QAAQ,UAAW,IAC7F,MAAMyB,EAAWD,EAAcV,MAAM,cACrCU,EAAgBC,EAAWD,EAAcxB,QAAQyB,EAAS,GAAI,IAAMD,EACpE,MAAOvB,EAAKe,EAAYC,GAAgBtB,gBAAgB8B,EAAWA,EAAS,GAAKD,GACjF,IAAIL,EAASM,GAAYD,GAAiB,GACtCN,EAAOjB,GAAO,CAAC,OAAQ,eAAeJ,SAASI,QAAO,EAASA,EACnE,OAAKiB,GAASF,GAAeC,GAEzBE,EAAOjB,WAAW,YACpBiB,EAASA,EAAOd,MAAM,IACpBa,EAAKhB,WAAW,aAClBgB,EAAOA,EAAKb,MAAM,IACpBa,EAhzBgB,YAAYQ,GAE5B,IAAIC,EAAe,GACfC,GAAmB,EACvB,IAAK,IAAIC,GAHTH,EAAaA,EAAWI,KAAKC,GAd/B,SAASC,qBAAqBC,EAAQ,IACpC,OAAKA,GAAUA,EAAMpC,SAAS,MAGvBoC,EAAMjC,QAAQ,MAAO,KAFnBiC,CAGX,CAS4CD,CAAqBD,MAGnCG,OAAS,EAAGL,QAAgBD,EAAkBC,IAAS,CACjF,MAAMM,EAAON,GAAS,EAAIH,EAAWG,GAVhB,oBAAZvB,QACFA,QAAQ8B,MAAMpC,QAAQ,MAAO,KAE/B,IAQAmC,GAAwB,IAAhBA,EAAKD,SAGlBP,EAAe,GAAGQ,KAAQR,IAC1BC,EAAmB9C,WAAWqD,GAClC,CAEE,OADAR,EAMF,SAASU,gBAAgBF,EAAMG,GAC7B,IAAIC,EAAM,GACNC,EAAoB,EACpBC,GAAc,EACdC,EAAO,EACPC,EAAO,KACX,IAAK,IAAId,EAAQ,EAAGA,GAASM,EAAKD,SAAUL,EAAO,CACjD,GAAIA,EAAQM,EAAKD,OACfS,EAAOR,EAAKN,OACP,IAAa,MAATc,EACT,MAEAA,EAAO,GACb,CACI,GAAa,MAATA,EAAc,CAChB,GAAIF,IAAcZ,EAAQ,GAAc,IAATa,QAAmB,GAAa,IAATA,EAAY,CAChE,GAAIH,EAAIL,OAAS,GAA2B,IAAtBM,GAAmD,MAAxBD,EAAIA,EAAIL,OAAS,IAAsC,MAAxBK,EAAIA,EAAIL,OAAS,GAAY,CAC3G,GAAIK,EAAIL,OAAS,EAAG,CAClB,MAAMU,EAAiBL,EAAIM,YAAY,MAChB,IAAnBD,GACFL,EAAM,GACNC,EAAoB,IAEpBD,EAAMA,EAAIlC,MAAM,EAAGuC,GACnBJ,EAAoBD,EAAIL,OAAS,EAAIK,EAAIM,YAAY,MAEvDJ,EAAYZ,EACZa,EAAO,EACP,QACZ,CAAiB,GAAIH,EAAIL,OAAS,EAAG,CACzBK,EAAM,GACNC,EAAoB,EACpBC,EAAYZ,EACZa,EAAO,EACP,QACZ,CACA,CACYJ,IACFC,GAAOA,EAAIL,OAAS,EAAI,MAAQ,KAChCM,EAAoB,EAE9B,MACYD,EAAIL,OAAS,EACfK,GAAO,IAAIJ,EAAK9B,MAAMoC,EAAY,EAAGZ,KAErCU,EAAMJ,EAAK9B,MAAMoC,EAAY,EAAGZ,GAElCW,EAAoBX,EAAQY,EAAY,EAE1CA,EAAYZ,EACZa,EAAO,CACR,KAAmB,MAATC,IAAyB,IAATD,IACvBA,EAEFA,GAAS,CAEf,CACE,OAAOH,CACT,CAhEiBF,CAAgBV,GAAeC,GAC1CA,IAAqB9C,WAAW6C,GAC3B,IAAIA,IAENA,EAAaO,OAAS,EAAIP,EAAe,GAClD,CA+xBSmB,CAAU5B,GACbC,IACFA,EAASA,EAAOnB,QAAQ,6BAA8B,KACjD,CACLmB,SACAD,OACAR,KAAMU,OAAOC,SAASL,GACtBM,OAAQF,OAAOC,SAASJ,KAZjB,IAcX,4EAjCA,SAAS8B,iBAAiBtC,GACxB,MAAMC,EAAOD,EAAIE,OACjB,OAAKlB,EAAuBT,KAAK0B,GAE1Ba,mBAAmBb,GADjBF,2BAA2BE,EAEtC","x_google_ignoreList":[0]}

package/dist/browser/node_modules/.pnpm/@vitest_utils@0.34.6/node_modules/@vitest/utils/dist/source-map.esm.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ const e=/^[/\\](?![/\\])\|^[/\\]{2}(?!\.)\|^[A-Za-z]:[/\\]/;const isAbsolute=function(t){return e.test(t)},t="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",n=new Uint8Array(64),l=new Uint8Array(128);for(let e=0;e<64;e++){const r=t.charCodeAt(e);n[e]=r,l[r]=e}var r;!function(e){e[e.Empty=1]="Empty",e[e.Hash=2]="Hash",e[e.Query=3]="Query",e[e.RelativePath=4]="RelativePath",e[e.AbsolutePath=5]="AbsolutePath",e[e.SchemeRelative=6]="SchemeRelative",e[e.Absolute=7]="Absolute"}(r\|\|(r={}));const a=/^\sat .(\S+:\d+\|$native$)/m,i=/^(eval@)?(\[native code])?$/;function extractLocation(e){if(!e.includes(":"))return[e];const t=/(.+?)(?::(\d+))?(?::(\d+))?$/.exec(e.replace(/^$\|$$/g,""));if(!t)return[e];let n=t[1];if(n.startsWith("http:")\|\|n.startsWith("https:")){n=new URL(n).pathname}return n.startsWith("/@fs/")&&(n=n.slice("undefined"!=typeof process&&"win32"===process.platform?5:4)),[n,t[2]\|\|void 0,t[3]\|\|void 0]}function parseSingleFFOrSafariStack(e){let t=e.trim();if(i.test(t))return null;if(t.includes(" > eval")&&(t=t.replace(/ line (\d+)(?: > eval line \d+)* > eval:\d+:\d+/g,":$1")),!t.includes("@")&&!t.includes(":"))return null;const n=/((.".+"[^@])?[^@])(?:@)/,l=t.match(n),r=l&&l[1]?l[1]:void 0,[a,s,c]=extractLocation(t.replace(n,""));return a&&s&&c?{file:a,method:r\|\|"",line:Number.parseInt(s),column:Number.parseInt(c)}:null}function parseSingleStack(e){const t=e.trim();return a.test(t)?parseSingleV8Stack(t):parseSingleFFOrSafariStack(t)}function parseSingleV8Stack(e){let t=e.trim();if(!a.test(t))return null;t.includes("(eval ")&&(t=t.replace(/eval code/g,"eval").replace(/($eval at [^()])\|(,.$)/g,""));let n=t.replace(/^\s+/,"").replace(/\(eval code/g,"(").replace(/^.?\s+/,"");const l=n.match(/ (\(.+$$)/);n=l?n.replace(l[0],""):n;const[r,i,s]=extractLocation(l?l[1]:n);let c=l&&n\|\|"",o=r&&["eval","<anonymous>"].includes(r)?void 0:r;return o&&i&&s?(c.startsWith("async ")&&(c=c.slice(6)),o.startsWith("file://")&&(o=o.slice(7)),o=function(...e){let t="",n=!1;for(let l=(e=e.map((e=>function normalizeWindowsPath(e=""){return e&&e.includes("\\")?e.replace(/\\/g,"/"):e}(e)))).length-1;l>=-1&&!n;l--){const r=l>=0?e[l]:"undefined"!=typeof process?process.cwd().replace(/\\/g,"/"):"/";r&&0!==r.length&&(t=`${r}/${t}`,n=isAbsolute(r))}return t=function normalizeString(e,t){let n="",l=0,r=-1,a=0,i=null;for(let s=0;s<=e.length;++s){if(s<e.length)i=e[s];else{if("/"===i)break;i="/"}if("/"===i){if(r===s-1\|\|1===a);else if(2===a){if(n.length<2\|\|2!==l\|\|"."!==n[n.length-1]\|\|"."!==n[n.length-2]){if(n.length>2){const e=n.lastIndexOf("/");-1===e?(n="",l=0):(n=n.slice(0,e),l=n.length-1-n.lastIndexOf("/")),r=s,a=0;continue}if(n.length>0){n="",l=0,r=s,a=0;continue}}t&&(n+=n.length>0?"/..":"..",l=2)}else n.length>0?n+=`/${e.slice(r+1,s)}`:n=e.slice(r+1,s),l=s-r-1;r=s,a=0}else"."===i&&-1!==a?++a:a=-1}return n}(t,!n),n&&!isAbsolute(t)?`/${t}`:t.length>0?t:"."}(o),c&&(c=c.replace(/__vite_ssr_import_\d+__\./g,"")),{method:c,file:o,line:Number.parseInt(i),column:Number.parseInt(s)}):null}export{parseSingleFFOrSafariStack,parseSingleStack,parseSingleV8Stack};
2	+ //# sourceMappingURL=source-map.esm.js.map

package/dist/browser/node_modules/.pnpm/@vitest_utils@0.34.6/node_modules/@vitest/utils/dist/source-map.esm.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"source-map.esm.js","sources":["../../../../../../../../../../../node_modules/.pnpm/@vitest+utils@0.34.6/node_modules/@vitest/utils/dist/source-map.js"],"sourcesContent":["import { notNullish, isPrimitive } from './helpers.js';\n\nfunction normalizeWindowsPath(input = \"\") {\n if (!input || !input.includes(\"\\\\\")) {\n return input;\n }\n return input.replace(/\\\\/g, \"/\");\n}\nconst _IS_ABSOLUTE_RE = /^[/\\\\](?![/\\\\])|^[/\\\\]{2}(?!\\.)|^[A-Za-z]:[/\\\\]/;\nfunction cwd() {\n if (typeof process !== \"undefined\") {\n return process.cwd().replace(/\\\\/g, \"/\");\n }\n return \"/\";\n}\nconst resolve$2 = 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};\n\nconst comma = ','.charCodeAt(0);\nconst chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';\nconst intToChar = new Uint8Array(64); // 64 possible chars.\nconst charToInt = new Uint8Array(128); // z is 122 in ASCII\nfor (let i = 0; i < chars.length; i++) {\n const c = chars.charCodeAt(i);\n intToChar[i] = c;\n charToInt[c] = i;\n}\nfunction decode(mappings) {\n const state = new Int32Array(5);\n const decoded = [];\n let index = 0;\n do {\n const semi = indexOf(mappings, index);\n const line = [];\n let sorted = true;\n let lastCol = 0;\n state[0] = 0;\n for (let i = index; i < semi; i++) {\n let seg;\n i = decodeInteger(mappings, i, state, 0); // genColumn\n const col = state[0];\n if (col < lastCol)\n sorted = false;\n lastCol = col;\n if (hasMoreVlq(mappings, i, semi)) {\n i = decodeInteger(mappings, i, state, 1); // sourcesIndex\n i = decodeInteger(mappings, i, state, 2); // sourceLine\n i = decodeInteger(mappings, i, state, 3); // sourceColumn\n if (hasMoreVlq(mappings, i, semi)) {\n i = decodeInteger(mappings, i, state, 4); // namesIndex\n seg = [col, state[1], state[2], state[3], state[4]];\n }\n else {\n seg = [col, state[1], state[2], state[3]];\n }\n }\n else {\n seg = [col];\n }\n line.push(seg);\n }\n if (!sorted)\n sort(line);\n decoded.push(line);\n index = semi + 1;\n } while (index <= mappings.length);\n return decoded;\n}\nfunction indexOf(mappings, index) {\n const idx = mappings.indexOf(';', index);\n return idx === -1 ? mappings.length : idx;\n}\nfunction decodeInteger(mappings, pos, state, j) {\n let value = 0;\n let shift = 0;\n let integer = 0;\n do {\n const c = mappings.charCodeAt(pos++);\n integer = charToInt[c];\n value |= (integer & 31) << shift;\n shift += 5;\n } while (integer & 32);\n const shouldNegate = value & 1;\n value >>>= 1;\n if (shouldNegate) {\n value = -0x80000000 | -value;\n }\n state[j] += value;\n return pos;\n}\nfunction hasMoreVlq(mappings, i, length) {\n if (i >= length)\n return false;\n return mappings.charCodeAt(i) !== comma;\n}\nfunction sort(line) {\n line.sort(sortComparator$1);\n}\nfunction sortComparator$1(a, b) {\n return a[0] - b[0];\n}\n\n// Matches the scheme of a URL, eg \"http://\"\nconst schemeRegex = /^[\\w+.-]+:\\/\\//;\n/**\n * Matches the parts of a URL:\n * 1. Scheme, including \":\", guaranteed.\n * 2. User/password, including \"@\", optional.\n * 3. Host, guaranteed.\n * 4. Port, including \":\", optional.\n * 5. Path, including \"/\", optional.\n * 6. Query, including \"?\", optional.\n * 7. Hash, including \"#\", optional.\n */\nconst urlRegex = /^([\\w+.-]+:)\\/\\/([^@/#?]*@)?([^:/#?]*)(:\\d+)?(\\/[^#?]*)?(\\?[^#]*)?(#.*)?/;\n/**\n * File URLs are weird. They dont' need the regular `//` in the scheme, they may or may not start\n * with a leading `/`, they can have a domain (but only if they don't start with a Windows drive).\n *\n * 1. Host, optional.\n * 2. Path, which may include \"/\", guaranteed.\n * 3. Query, including \"?\", optional.\n * 4. Hash, including \"#\", optional.\n */\nconst fileRegex = /^file:(?:\\/\\/((?![a-z]:)[^/#?]*)?)?(\\/?[^#?]*)(\\?[^#]*)?(#.*)?/i;\nvar UrlType;\n(function (UrlType) {\n UrlType[UrlType[\"Empty\"] = 1] = \"Empty\";\n UrlType[UrlType[\"Hash\"] = 2] = \"Hash\";\n UrlType[UrlType[\"Query\"] = 3] = \"Query\";\n UrlType[UrlType[\"RelativePath\"] = 4] = \"RelativePath\";\n UrlType[UrlType[\"AbsolutePath\"] = 5] = \"AbsolutePath\";\n UrlType[UrlType[\"SchemeRelative\"] = 6] = \"SchemeRelative\";\n UrlType[UrlType[\"Absolute\"] = 7] = \"Absolute\";\n})(UrlType || (UrlType = {}));\nfunction isAbsoluteUrl(input) {\n return schemeRegex.test(input);\n}\nfunction isSchemeRelativeUrl(input) {\n return input.startsWith('//');\n}\nfunction isAbsolutePath(input) {\n return input.startsWith('/');\n}\nfunction isFileUrl(input) {\n return input.startsWith('file:');\n}\nfunction isRelative(input) {\n return /^[.?#]/.test(input);\n}\nfunction parseAbsoluteUrl(input) {\n const match = urlRegex.exec(input);\n return makeUrl(match[1], match[2] || '', match[3], match[4] || '', match[5] || '/', match[6] || '', match[7] || '');\n}\nfunction parseFileUrl(input) {\n const match = fileRegex.exec(input);\n const path = match[2];\n return makeUrl('file:', '', match[1] || '', '', isAbsolutePath(path) ? path : '/' + path, match[3] || '', match[4] || '');\n}\nfunction makeUrl(scheme, user, host, port, path, query, hash) {\n return {\n scheme,\n user,\n host,\n port,\n path,\n query,\n hash,\n type: UrlType.Absolute,\n };\n}\nfunction parseUrl(input) {\n if (isSchemeRelativeUrl(input)) {\n const url = parseAbsoluteUrl('http:' + input);\n url.scheme = '';\n url.type = UrlType.SchemeRelative;\n return url;\n }\n if (isAbsolutePath(input)) {\n const url = parseAbsoluteUrl('http://foo.com' + input);\n url.scheme = '';\n url.host = '';\n url.type = UrlType.AbsolutePath;\n return url;\n }\n if (isFileUrl(input))\n return parseFileUrl(input);\n if (isAbsoluteUrl(input))\n return parseAbsoluteUrl(input);\n const url = parseAbsoluteUrl('http://foo.com/' + input);\n url.scheme = '';\n url.host = '';\n url.type = input\n ? input.startsWith('?')\n ? UrlType.Query\n : input.startsWith('#')\n ? UrlType.Hash\n : UrlType.RelativePath\n : UrlType.Empty;\n return url;\n}\nfunction stripPathFilename(path) {\n // If a path ends with a parent directory \"..\", then it's a relative path with excess parent\n // paths. It's not a file, so we can't strip it.\n if (path.endsWith('/..'))\n return path;\n const index = path.lastIndexOf('/');\n return path.slice(0, index + 1);\n}\nfunction mergePaths(url, base) {\n normalizePath(base, base.type);\n // If the path is just a \"/\", then it was an empty path to begin with (remember, we're a relative\n // path).\n if (url.path === '/') {\n url.path = base.path;\n }\n else {\n // Resolution happens relative to the base path's directory, not the file.\n url.path = stripPathFilename(base.path) + url.path;\n }\n}\n/**\n * The path can have empty directories \"//\", unneeded parents \"foo/..\", or current directory\n * \"foo/.\". We need to normalize to a standard representation.\n */\nfunction normalizePath(url, type) {\n const rel = type <= UrlType.RelativePath;\n const pieces = url.path.split('/');\n // We need to preserve the first piece always, so that we output a leading slash. The item at\n // pieces[0] is an empty string.\n let pointer = 1;\n // Positive is the number of real directories we've output, used for popping a parent directory.\n // Eg, \"foo/bar/..\" will have a positive 2, and we can decrement to be left with just \"foo\".\n let positive = 0;\n // We need to keep a trailing slash if we encounter an empty directory (eg, splitting \"foo/\" will\n // generate `[\"foo\", \"\"]` pieces). And, if we pop a parent directory. But once we encounter a\n // real directory, we won't need to append, unless the other conditions happen again.\n let addTrailingSlash = false;\n for (let i = 1; i < pieces.length; i++) {\n const piece = pieces[i];\n // An empty directory, could be a trailing slash, or just a double \"//\" in the path.\n if (!piece) {\n addTrailingSlash = true;\n continue;\n }\n // If we encounter a real directory, then we don't need to append anymore.\n addTrailingSlash = false;\n // A current directory, which we can always drop.\n if (piece === '.')\n continue;\n // A parent directory, we need to see if there are any real directories we can pop. Else, we\n // have an excess of parents, and we'll need to keep the \"..\".\n if (piece === '..') {\n if (positive) {\n addTrailingSlash = true;\n positive--;\n pointer--;\n }\n else if (rel) {\n // If we're in a relativePath, then we need to keep the excess parents. Else, in an absolute\n // URL, protocol relative URL, or an absolute path, we don't need to keep excess.\n pieces[pointer++] = piece;\n }\n continue;\n }\n // We've encountered a real directory. Move it to the next insertion pointer, which accounts for\n // any popped or dropped directories.\n pieces[pointer++] = piece;\n positive++;\n }\n let path = '';\n for (let i = 1; i < pointer; i++) {\n path += '/' + pieces[i];\n }\n if (!path || (addTrailingSlash && !path.endsWith('/..'))) {\n path += '/';\n }\n url.path = path;\n}\n/**\n * Attempts to resolve `input` URL/path relative to `base`.\n */\nfunction resolve$1(input, base) {\n if (!input && !base)\n return '';\n const url = parseUrl(input);\n let inputType = url.type;\n if (base && inputType !== UrlType.Absolute) {\n const baseUrl = parseUrl(base);\n const baseType = baseUrl.type;\n switch (inputType) {\n case UrlType.Empty:\n url.hash = baseUrl.hash;\n // fall through\n case UrlType.Hash:\n url.query = baseUrl.query;\n // fall through\n case UrlType.Query:\n case UrlType.RelativePath:\n mergePaths(url, baseUrl);\n // fall through\n case UrlType.AbsolutePath:\n // The host, user, and port are joined, you can't copy one without the others.\n url.user = baseUrl.user;\n url.host = baseUrl.host;\n url.port = baseUrl.port;\n // fall through\n case UrlType.SchemeRelative:\n // The input doesn't have a schema at least, so we need to copy at least that over.\n url.scheme = baseUrl.scheme;\n }\n if (baseType > inputType)\n inputType = baseType;\n }\n normalizePath(url, inputType);\n const queryHash = url.query + url.hash;\n switch (inputType) {\n // This is impossible, because of the empty checks at the start of the function.\n // case UrlType.Empty:\n case UrlType.Hash:\n case UrlType.Query:\n return queryHash;\n case UrlType.RelativePath: {\n // The first char is always a \"/\", and we need it to be relative.\n const path = url.path.slice(1);\n if (!path)\n return queryHash || '.';\n if (isRelative(base || input) && !isRelative(path)) {\n // If base started with a leading \".\", or there is no base and input started with a \".\",\n // then we need to ensure that the relative path starts with a \".\". We don't know if\n // relative starts with a \"..\", though, so check before prepending.\n return './' + path + queryHash;\n }\n return path + queryHash;\n }\n case UrlType.AbsolutePath:\n return url.path + queryHash;\n default:\n return url.scheme + '//' + url.user + url.host + url.port + url.path + queryHash;\n }\n}\n\nfunction resolve(input, base) {\n // The base is always treated as a directory, if it's not empty.\n // https://github.com/mozilla/source-map/blob/8cb3ee57/lib/util.js#L327\n // https://github.com/chromium/chromium/blob/da4adbb3/third_party/blink/renderer/devtools/front_end/sdk/SourceMap.js#L400-L401\n if (base && !base.endsWith('/'))\n base += '/';\n return resolve$1(input, base);\n}\n\n/**\n * Removes everything after the last \"/\", but leaves the slash.\n */\nfunction stripFilename(path) {\n if (!path)\n return '';\n const index = path.lastIndexOf('/');\n return path.slice(0, index + 1);\n}\n\nconst COLUMN = 0;\nconst SOURCES_INDEX = 1;\nconst SOURCE_LINE = 2;\nconst SOURCE_COLUMN = 3;\nconst NAMES_INDEX = 4;\nconst REV_GENERATED_LINE = 1;\nconst REV_GENERATED_COLUMN = 2;\n\nfunction maybeSort(mappings, owned) {\n const unsortedIndex = nextUnsortedSegmentLine(mappings, 0);\n if (unsortedIndex === mappings.length)\n return mappings;\n // If we own the array (meaning we parsed it from JSON), then we're free to directly mutate it. If\n // not, we do not want to modify the consumer's input array.\n if (!owned)\n mappings = mappings.slice();\n for (let i = unsortedIndex; i < mappings.length; i = nextUnsortedSegmentLine(mappings, i + 1)) {\n mappings[i] = sortSegments(mappings[i], owned);\n }\n return mappings;\n}\nfunction nextUnsortedSegmentLine(mappings, start) {\n for (let i = start; i < mappings.length; i++) {\n if (!isSorted(mappings[i]))\n return i;\n }\n return mappings.length;\n}\nfunction isSorted(line) {\n for (let j = 1; j < line.length; j++) {\n if (line[j][COLUMN] < line[j - 1][COLUMN]) {\n return false;\n }\n }\n return true;\n}\nfunction sortSegments(line, owned) {\n if (!owned)\n line = line.slice();\n return line.sort(sortComparator);\n}\nfunction sortComparator(a, b) {\n return a[COLUMN] - b[COLUMN];\n}\n\nlet found = false;\n/**\n * A binary search implementation that returns the index if a match is found.\n * If no match is found, then the left-index (the index associated with the item that comes just\n * before the desired index) is returned. To maintain proper sort order, a splice would happen at\n * the next index:\n *\n * ```js\n * const array = [1, 3];\n * const needle = 2;\n * const index = binarySearch(array, needle, (item, needle) => item - needle);\n *\n * assert.equal(index, 0);\n * array.splice(index + 1, 0, needle);\n * assert.deepEqual(array, [1, 2, 3]);\n * ```\n */\nfunction binarySearch(haystack, needle, low, high) {\n while (low <= high) {\n const mid = low + ((high - low) >> 1);\n const cmp = haystack[mid][COLUMN] - needle;\n if (cmp === 0) {\n found = true;\n return mid;\n }\n if (cmp < 0) {\n low = mid + 1;\n }\n else {\n high = mid - 1;\n }\n }\n found = false;\n return low - 1;\n}\nfunction upperBound(haystack, needle, index) {\n for (let i = index + 1; i < haystack.length; index = i++) {\n if (haystack[i][COLUMN] !== needle)\n break;\n }\n return index;\n}\nfunction lowerBound(haystack, needle, index) {\n for (let i = index - 1; i >= 0; index = i--) {\n if (haystack[i][COLUMN] !== needle)\n break;\n }\n return index;\n}\nfunction memoizedState() {\n return {\n lastKey: -1,\n lastNeedle: -1,\n lastIndex: -1,\n };\n}\n/**\n * This overly complicated beast is just to record the last tested line/column and the resulting\n * index, allowing us to skip a few tests if mappings are monotonically increasing.\n */\nfunction memoizedBinarySearch(haystack, needle, state, key) {\n const { lastKey, lastNeedle, lastIndex } = state;\n let low = 0;\n let high = haystack.length - 1;\n if (key === lastKey) {\n if (needle === lastNeedle) {\n found = lastIndex !== -1 && haystack[lastIndex][COLUMN] === needle;\n return lastIndex;\n }\n if (needle >= lastNeedle) {\n // lastIndex may be -1 if the previous needle was not found.\n low = lastIndex === -1 ? 0 : lastIndex;\n }\n else {\n high = lastIndex;\n }\n }\n state.lastKey = key;\n state.lastNeedle = needle;\n return (state.lastIndex = binarySearch(haystack, needle, low, high));\n}\n\n// Rebuilds the original source files, with mappings that are ordered by source line/column instead\n// of generated line/column.\nfunction buildBySources(decoded, memos) {\n const sources = memos.map(buildNullArray);\n for (let i = 0; i < decoded.length; i++) {\n const line = decoded[i];\n for (let j = 0; j < line.length; j++) {\n const seg = line[j];\n if (seg.length === 1)\n continue;\n const sourceIndex = seg[SOURCES_INDEX];\n const sourceLine = seg[SOURCE_LINE];\n const sourceColumn = seg[SOURCE_COLUMN];\n const originalSource = sources[sourceIndex];\n const originalLine = (originalSource[sourceLine] || (originalSource[sourceLine] = []));\n const memo = memos[sourceIndex];\n // The binary search either found a match, or it found the left-index just before where the\n // segment should go. Either way, we want to insert after that. And there may be multiple\n // generated segments associated with an original location, so there may need to move several\n // indexes before we find where we need to insert.\n const index = upperBound(originalLine, sourceColumn, memoizedBinarySearch(originalLine, sourceColumn, memo, sourceLine));\n insert(originalLine, (memo.lastIndex = index + 1), [sourceColumn, i, seg[COLUMN]]);\n }\n }\n return sources;\n}\nfunction insert(array, index, value) {\n for (let i = array.length; i > index; i--) {\n array[i] = array[i - 1];\n }\n array[index] = value;\n}\n// Null arrays allow us to use ordered index keys without actually allocating contiguous memory like\n// a real array. We use a null-prototype object to avoid prototype pollution and deoptimizations.\n// Numeric properties on objects are magically sorted in ascending order by the engine regardless of\n// the insertion order. So, by setting any numeric keys, even out of order, we'll get ascending\n// order when iterating with for-in.\nfunction buildNullArray() {\n return { __proto__: null };\n}\n\nconst LINE_GTR_ZERO = '`line` must be greater than 0 (lines start at line 1)';\nconst COL_GTR_EQ_ZERO = '`column` must be greater than or equal to 0 (columns start at column 0)';\nconst LEAST_UPPER_BOUND = -1;\nconst GREATEST_LOWER_BOUND = 1;\n/**\n * Returns the decoded (array of lines of segments) form of the SourceMap's mappings field.\n */\nlet decodedMappings;\n/**\n * A higher-level API to find the source/line/column associated with a generated line/column\n * (think, from a stack trace). Line is 1-based, but column is 0-based, due to legacy behavior in\n * `source-map` library.\n */\nlet originalPositionFor;\n/**\n * Finds the generated line/column position of the provided source/line/column source position.\n */\nlet generatedPositionFor;\nclass TraceMap {\n constructor(map, mapUrl) {\n const isString = typeof map === 'string';\n if (!isString && map._decodedMemo)\n return map;\n const parsed = (isString ? JSON.parse(map) : map);\n const { version, file, names, sourceRoot, sources, sourcesContent } = parsed;\n this.version = version;\n this.file = file;\n this.names = names;\n this.sourceRoot = sourceRoot;\n this.sources = sources;\n this.sourcesContent = sourcesContent;\n const from = resolve(sourceRoot || '', stripFilename(mapUrl));\n this.resolvedSources = sources.map((s) => resolve(s || '', from));\n const { mappings } = parsed;\n if (typeof mappings === 'string') {\n this._encoded = mappings;\n this._decoded = undefined;\n }\n else {\n this._encoded = undefined;\n this._decoded = maybeSort(mappings, isString);\n }\n this._decodedMemo = memoizedState();\n this._bySources = undefined;\n this._bySourceMemos = undefined;\n }\n}\n(() => {\n decodedMappings = (map) => {\n return (map._decoded || (map._decoded = decode(map._encoded)));\n };\n originalPositionFor = (map, { line, column, bias }) => {\n line--;\n if (line < 0)\n throw new Error(LINE_GTR_ZERO);\n if (column < 0)\n throw new Error(COL_GTR_EQ_ZERO);\n const decoded = decodedMappings(map);\n // It's common for parent source maps to have pointers to lines that have no\n // mapping (like a \"//# sourceMappingURL=\") at the end of the child file.\n if (line >= decoded.length)\n return OMapping(null, null, null, null);\n const segments = decoded[line];\n const index = traceSegmentInternal(segments, map._decodedMemo, line, column, bias || GREATEST_LOWER_BOUND);\n if (index === -1)\n return OMapping(null, null, null, null);\n const segment = segments[index];\n if (segment.length === 1)\n return OMapping(null, null, null, null);\n const { names, resolvedSources } = map;\n return OMapping(resolvedSources[segment[SOURCES_INDEX]], segment[SOURCE_LINE] + 1, segment[SOURCE_COLUMN], segment.length === 5 ? names[segment[NAMES_INDEX]] : null);\n };\n generatedPositionFor = (map, { source, line, column, bias }) => {\n return generatedPosition(map, source, line, column, bias || GREATEST_LOWER_BOUND, false);\n };\n function generatedPosition(map, source, line, column, bias, all) {\n line--;\n if (line < 0)\n throw new Error(LINE_GTR_ZERO);\n if (column < 0)\n throw new Error(COL_GTR_EQ_ZERO);\n const { sources, resolvedSources } = map;\n let sourceIndex = sources.indexOf(source);\n if (sourceIndex === -1)\n sourceIndex = resolvedSources.indexOf(source);\n if (sourceIndex === -1)\n return all ? [] : GMapping(null, null);\n const generated = (map._bySources || (map._bySources = buildBySources(decodedMappings(map), (map._bySourceMemos = sources.map(memoizedState)))));\n const segments = generated[sourceIndex][line];\n if (segments == null)\n return all ? [] : GMapping(null, null);\n const memo = map._bySourceMemos[sourceIndex];\n if (all)\n return sliceGeneratedPositions(segments, memo, line, column, bias);\n const index = traceSegmentInternal(segments, memo, line, column, bias);\n if (index === -1)\n return GMapping(null, null);\n const segment = segments[index];\n return GMapping(segment[REV_GENERATED_LINE] + 1, segment[REV_GENERATED_COLUMN]);\n }\n})();\nfunction OMapping(source, line, column, name) {\n return { source, line, column, name };\n}\nfunction GMapping(line, column) {\n return { line, column };\n}\nfunction traceSegmentInternal(segments, memo, line, column, bias) {\n let index = memoizedBinarySearch(segments, column, memo, line);\n if (found) {\n index = (bias === LEAST_UPPER_BOUND ? upperBound : lowerBound)(segments, column, index);\n }\n else if (bias === LEAST_UPPER_BOUND)\n index++;\n if (index === -1 || index === segments.length)\n return -1;\n return index;\n}\nfunction sliceGeneratedPositions(segments, memo, line, column, bias) {\n let min = traceSegmentInternal(segments, memo, line, column, GREATEST_LOWER_BOUND);\n // We ignored the bias when tracing the segment so that we're guarnateed to find the first (in\n // insertion order) segment that matched. Even if we did respect the bias when tracing, we would\n // still need to call `lowerBound()` to find the first segment, which is slower than just looking\n // for the GREATEST_LOWER_BOUND to begin with. The only difference that matters for us is when the\n // binary search didn't match, in which case GREATEST_LOWER_BOUND just needs to increment to\n // match LEAST_UPPER_BOUND.\n if (!found && bias === LEAST_UPPER_BOUND)\n min++;\n if (min === -1 || min === segments.length)\n return [];\n // We may have found the segment that started at an earlier column. If this is the case, then we\n // need to slice all generated segments that match _that_ column, because all such segments span\n // to our desired column.\n const matchedColumn = found ? column : segments[min][COLUMN];\n // The binary search is not guaranteed to find the lower bound when a match wasn't found.\n if (!found)\n min = lowerBound(segments, matchedColumn, min);\n const max = upperBound(segments, matchedColumn, min);\n const result = [];\n for (; min <= max; min++) {\n const segment = segments[min];\n result.push(GMapping(segment[REV_GENERATED_LINE] + 1, segment[REV_GENERATED_COLUMN]));\n }\n return result;\n}\n\nconst CHROME_IE_STACK_REGEXP = /^\\s*at .*(\\S+:\\d+|\$native\$)/m;\nconst SAFARI_NATIVE_CODE_REGEXP = /^(eval@)?(\\[native code])?$/;\nconst stackIgnorePatterns = [\n \"node:internal\",\n /\\/packages\\/\\w+\\/dist\\//,\n /\\/@vitest\\/\\w+\\/dist\\//,\n \"/vitest/dist/\",\n \"/vitest/src/\",\n \"/vite-node/dist/\",\n \"/vite-node/src/\",\n \"/node_modules/chai/\",\n \"/node_modules/tinypool/\",\n \"/node_modules/tinyspy/\",\n \"/deps/chai.js\",\n /__vitest_browser__/\n];\nfunction extractLocation(urlLike) {\n if (!urlLike.includes(\":\"))\n return [urlLike];\n const regExp = /(.+?)(?::(\\d+))?(?::(\\d+))?$/;\n const parts = regExp.exec(urlLike.replace(/^\$|\$$/g, \"\"));\n if (!parts)\n return [urlLike];\n let url = parts[1];\n if (url.startsWith(\"http:\") || url.startsWith(\"https:\")) {\n const urlObj = new URL(url);\n url = urlObj.pathname;\n }\n if (url.startsWith(\"/@fs/\")) {\n url = url.slice(typeof process !== \"undefined\" && process.platform === \"win32\" ? 5 : 4);\n }\n return [url, parts[2] || void 0, parts[3] || void 0];\n}\nfunction parseSingleFFOrSafariStack(raw) {\n let line = raw.trim();\n if (SAFARI_NATIVE_CODE_REGEXP.test(line))\n return null;\n if (line.includes(\" > eval\"))\n line = line.replace(/ line (\\d+)(?: > eval line \\d+)* > eval:\\d+:\\d+/g, \":$1\");\n if (!line.includes(\"@\") && !line.includes(\":\"))\n return null;\n const functionNameRegex = /((.*\".+\"[^@]*)?[^@]*)(?:@)/;\n const matches = line.match(functionNameRegex);\n const functionName = matches && matches[1] ? matches[1] : void 0;\n const [url, lineNumber, columnNumber] = extractLocation(line.replace(functionNameRegex, \"\"));\n if (!url || !lineNumber || !columnNumber)\n return null;\n return {\n file: url,\n method: functionName || \"\",\n line: Number.parseInt(lineNumber),\n column: Number.parseInt(columnNumber)\n };\n}\nfunction parseSingleStack(raw) {\n const line = raw.trim();\n if (!CHROME_IE_STACK_REGEXP.test(line))\n return parseSingleFFOrSafariStack(line);\n return parseSingleV8Stack(line);\n}\nfunction parseSingleV8Stack(raw) {\n let line = raw.trim();\n if (!CHROME_IE_STACK_REGEXP.test(line))\n return null;\n if (line.includes(\"(eval \"))\n line = line.replace(/eval code/g, \"eval\").replace(/(\$eval at [^()]*)|(,.*$)/g, \"\");\n let sanitizedLine = line.replace(/^\\s+/, \"\").replace(/\\(eval code/g, \"(\").replace(/^.*?\\s+/, \"\");\n const location = sanitizedLine.match(/ (\\(.+\$$)/);\n sanitizedLine = location ? sanitizedLine.replace(location[0], \"\") : sanitizedLine;\n const [url, lineNumber, columnNumber] = extractLocation(location ? location[1] : sanitizedLine);\n let method = location && sanitizedLine || \"\";\n let file = url && [\"eval\", \"<anonymous>\"].includes(url) ? void 0 : url;\n if (!file || !lineNumber || !columnNumber)\n return null;\n if (method.startsWith(\"async \"))\n method = method.slice(6);\n if (file.startsWith(\"file://\"))\n file = file.slice(7);\n file = resolve$2(file);\n if (method)\n method = method.replace(/__vite_ssr_import_\\d+__\\./g, \"\");\n return {\n method,\n file,\n line: Number.parseInt(lineNumber),\n column: Number.parseInt(columnNumber)\n };\n}\nfunction parseStacktrace(stack, options = {}) {\n const { ignoreStackEntries = stackIgnorePatterns } = options;\n let stacks = !CHROME_IE_STACK_REGEXP.test(stack) ? parseFFOrSafariStackTrace(stack) : parseV8Stacktrace(stack);\n if (ignoreStackEntries.length)\n stacks = stacks.filter((stack2) => !ignoreStackEntries.some((p) => stack2.file.match(p)));\n return stacks.map((stack2) => {\n var _a;\n const map = (_a = options.getSourceMap) == null ? void 0 : _a.call(options, stack2.file);\n if (!map || typeof map !== \"object\" || !map.version)\n return stack2;\n const traceMap = new TraceMap(map);\n const { line, column } = originalPositionFor(traceMap, stack2);\n if (line != null && column != null)\n return { ...stack2, line, column };\n return stack2;\n });\n}\nfunction parseFFOrSafariStackTrace(stack) {\n return stack.split(\"\\n\").map((line) => parseSingleFFOrSafariStack(line)).filter(notNullish);\n}\nfunction parseV8Stacktrace(stack) {\n return stack.split(\"\\n\").map((line) => parseSingleV8Stack(line)).filter(notNullish);\n}\nfunction parseErrorStacktrace(e, options = {}) {\n if (!e || isPrimitive(e))\n return [];\n if (e.stacks)\n return e.stacks;\n const stackStr = e.stack || e.stackStr || \"\";\n const stackFrames = parseStacktrace(stackStr, options);\n e.stacks = stackFrames;\n return stackFrames;\n}\n\nexport { TraceMap, generatedPositionFor, originalPositionFor, parseErrorStacktrace, parseSingleFFOrSafariStack, parseSingleStack, parseSingleV8Stack, parseStacktrace };\n"],"names":["_IS_ABSOLUTE_RE","isAbsolute","p","test","chars","intToChar","Uint8Array","charToInt","i","c","charCodeAt","UrlType","CHROME_IE_STACK_REGEXP","SAFARI_NATIVE_CODE_REGEXP","extractLocation","urlLike","includes","parts","exec","replace","url","startsWith","URL","pathname","slice","process","platform","parseSingleFFOrSafariStack","raw","line","trim","functionNameRegex","matches","match","functionName","lineNumber","columnNumber","file","method","Number","parseInt","column","parseSingleStack","parseSingleV8Stack","sanitizedLine","location","arguments_","resolvedPath","resolvedAbsolute","index","map","argument","normalizeWindowsPath","input","length","path","cwd","normalizeString","allowAboveRoot","res","lastSegmentLength","lastSlash","dots","char","lastSlashIndex","lastIndexOf","resolve$2"],"mappings":"AAQA,MAAMA,EAAkB,kDAoFxB,MAAMC,WAAa,SAASC,GAC1B,OAAOF,EAAgBG,KAAKD,EAC9B,EAGME,EAAQ,mEACRC,EAAY,IAAIC,WAAW,IAC3BC,EAAY,IAAID,WAAW,KACjC,IAAK,IAAIE,EAAI,EAAGA,EAAIJ,GAAcI,IAAK,CACnC,MAAMC,EAAIL,EAAMM,WAAWF,GAC3BH,EAAUG,GAAKC,EACfF,EAAUE,GAAKD,CACnB,CAmGA,IAAIG,GACJ,SAAWA,GACPA,EAAQA,EAAe,MAAI,GAAK,QAChCA,EAAQA,EAAc,KAAI,GAAK,OAC/BA,EAAQA,EAAe,MAAI,GAAK,QAChCA,EAAQA,EAAsB,aAAI,GAAK,eACvCA,EAAQA,EAAsB,aAAI,GAAK,eACvCA,EAAQA,EAAwB,eAAI,GAAK,iBACzCA,EAAQA,EAAkB,SAAI,GAAK,UACtC,CARD,CAQGA,IAAYA,EAAU,CAAA,IA6hBzB,MAAMC,EAAyB,iCACzBC,EAA4B,8BAelC,SAASC,gBAAgBC,GACvB,IAAKA,EAAQC,SAAS,KACpB,MAAO,CAACD,GACV,MACME,EADS,+BACMC,KAAKH,EAAQI,QAAQ,WAAY,KACtD,IAAKF,EACH,MAAO,CAACF,GACV,IAAIK,EAAMH,EAAM,GAChB,GAAIG,EAAIC,WAAW,UAAYD,EAAIC,WAAW,UAAW,CAEvDD,EADe,IAAIE,IAAIF,GACVG,QACjB,CAIE,OAHIH,EAAIC,WAAW,WACjBD,EAAMA,EAAII,MAAyB,oBAAZC,SAAgD,UAArBA,QAAQC,SAAuB,EAAI,IAEhF,CAACN,EAAKH,EAAM,SAAM,EAAQA,EAAM,SAAM,EAC/C,CACA,SAASU,2BAA2BC,GAClC,IAAIC,EAAOD,EAAIE,OACf,GAAIjB,EAA0BV,KAAK0B,GACjC,OAAO,KAGT,GAFIA,EAAKb,SAAS,aAChBa,EAAOA,EAAKV,QAAQ,mDAAoD,SACrEU,EAAKb,SAAS,OAASa,EAAKb,SAAS,KACxC,OAAO,KACT,MAAMe,EAAoB,6BACpBC,EAAUH,EAAKI,MAAMF,GACrBG,EAAeF,GAAWA,EAAQ,GAAKA,EAAQ,QAAK,GACnDZ,EAAKe,EAAYC,GAAgBtB,gBAAgBe,EAAKV,QAAQY,EAAmB,KACxF,OAAKX,GAAQe,GAAeC,EAErB,CACLC,KAAMjB,EACNkB,OAAQJ,GAAgB,GACxBL,KAAMU,OAAOC,SAASL,GACtBM,OAAQF,OAAOC,SAASJ,IALjB,IAOX,CACA,SAASM,iBAAiBd,GACxB,MAAMC,EAAOD,EAAIE,OACjB,OAAKlB,EAAuBT,KAAK0B,GAE1Bc,mBAAmBd,GADjBF,2BAA2BE,EAEtC,CACA,SAASc,mBAAmBf,GAC1B,IAAIC,EAAOD,EAAIE,OACf,IAAKlB,EAAuBT,KAAK0B,GAC/B,OAAO,KACLA,EAAKb,SAAS,YAChBa,EAAOA,EAAKV,QAAQ,aAAc,QAAQA,QAAQ,6BAA8B,KAClF,IAAIyB,EAAgBf,EAAKV,QAAQ,OAAQ,IAAIA,QAAQ,eAAgB,KAAKA,QAAQ,UAAW,IAC7F,MAAM0B,EAAWD,EAAcX,MAAM,cACrCW,EAAgBC,EAAWD,EAAczB,QAAQ0B,EAAS,GAAI,IAAMD,EACpE,MAAOxB,EAAKe,EAAYC,GAAgBtB,gBAAgB+B,EAAWA,EAAS,GAAKD,GACjF,IAAIN,EAASO,GAAYD,GAAiB,GACtCP,EAAOjB,GAAO,CAAC,OAAQ,eAAeJ,SAASI,QAAO,EAASA,EACnE,OAAKiB,GAASF,GAAeC,GAEzBE,EAAOjB,WAAW,YACpBiB,EAASA,EAAOd,MAAM,IACpBa,EAAKhB,WAAW,aAClBgB,EAAOA,EAAKb,MAAM,IACpBa,EAhzBgB,YAAYS,GAE5B,IAAIC,EAAe,GACfC,GAAmB,EACvB,IAAK,IAAIC,GAHTH,EAAaA,EAAWI,KAAKC,GAd/B,SAASC,qBAAqBC,EAAQ,IACpC,OAAKA,GAAUA,EAAMrC,SAAS,MAGvBqC,EAAMlC,QAAQ,MAAO,KAFnBkC,CAGX,CAS4CD,CAAqBD,MAGnCG,OAAS,EAAGL,QAAgBD,EAAkBC,IAAS,CACjF,MAAMM,EAAON,GAAS,EAAIH,EAAWG,GAVhB,oBAAZxB,QACFA,QAAQ+B,MAAMrC,QAAQ,MAAO,KAE/B,IAQAoC,GAAwB,IAAhBA,EAAKD,SAGlBP,EAAe,GAAGQ,KAAQR,IAC1BC,EAAmB/C,WAAWsD,GAClC,CAEE,OADAR,EAMF,SAASU,gBAAgBF,EAAMG,GAC7B,IAAIC,EAAM,GACNC,EAAoB,EACpBC,GAAc,EACdC,EAAO,EACPC,EAAO,KACX,IAAK,IAAId,EAAQ,EAAGA,GAASM,EAAKD,SAAUL,EAAO,CACjD,GAAIA,EAAQM,EAAKD,OACfS,EAAOR,EAAKN,OACP,IAAa,MAATc,EACT,MAEAA,EAAO,GACb,CACI,GAAa,MAATA,EAAc,CAChB,GAAIF,IAAcZ,EAAQ,GAAc,IAATa,QAAmB,GAAa,IAATA,EAAY,CAChE,GAAIH,EAAIL,OAAS,GAA2B,IAAtBM,GAAmD,MAAxBD,EAAIA,EAAIL,OAAS,IAAsC,MAAxBK,EAAIA,EAAIL,OAAS,GAAY,CAC3G,GAAIK,EAAIL,OAAS,EAAG,CAClB,MAAMU,EAAiBL,EAAIM,YAAY,MAChB,IAAnBD,GACFL,EAAM,GACNC,EAAoB,IAEpBD,EAAMA,EAAInC,MAAM,EAAGwC,GACnBJ,EAAoBD,EAAIL,OAAS,EAAIK,EAAIM,YAAY,MAEvDJ,EAAYZ,EACZa,EAAO,EACP,QACZ,CAAiB,GAAIH,EAAIL,OAAS,EAAG,CACzBK,EAAM,GACNC,EAAoB,EACpBC,EAAYZ,EACZa,EAAO,EACP,QACZ,CACA,CACYJ,IACFC,GAAOA,EAAIL,OAAS,EAAI,MAAQ,KAChCM,EAAoB,EAE9B,MACYD,EAAIL,OAAS,EACfK,GAAO,IAAIJ,EAAK/B,MAAMqC,EAAY,EAAGZ,KAErCU,EAAMJ,EAAK/B,MAAMqC,EAAY,EAAGZ,GAElCW,EAAoBX,EAAQY,EAAY,EAE1CA,EAAYZ,EACZa,EAAO,CACR,KAAmB,MAATC,IAAyB,IAATD,IACvBA,EAEFA,GAAS,CAEf,CACE,OAAOH,CACT,CAhEiBF,CAAgBV,GAAeC,GAC1CA,IAAqB/C,WAAW8C,GAC3B,IAAIA,IAENA,EAAaO,OAAS,EAAIP,EAAe,GAClD,CA+xBSmB,CAAU7B,GACbC,IACFA,EAASA,EAAOnB,QAAQ,6BAA8B,KACjD,CACLmB,SACAD,OACAR,KAAMU,OAAOC,SAASL,GACtBM,OAAQF,OAAOC,SAASJ,KAZjB,IAcX","x_google_ignoreList":[0]}

package/dist/browser/node_modules/.pnpm/ansi-styles@5.2.0/node_modules/ansi-styles/index.amd.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ define(["exports","../../../../../_virtual/index.amd6"],(function(e,r){"use strict";var o;r.__module.exports,e.__require=function requireAnsiStyles(){return o\|\|(o=1,function(e){const wrapAnsi256=(e=0)=>r=>`[${38+e};5;${r}m`,wrapAnsi16m=(e=0)=>(r,o,t)=>`[${38+e};2;${r};${o};${t}m`;Object.defineProperty(e,"exports",{enumerable:!0,get:function assembleStyles(){const e=new Map,r={modifier:{reset:[0,0],bold:[1,22],dim:[2,22],italic:[3,23],underline:[4,24],overline:[53,55],inverse:[7,27],hidden:[8,28],strikethrough:[9,29]},color:{black:[30,39],red:[31,39],green:[32,39],yellow:[33,39],blue:[34,39],magenta:[35,39],cyan:[36,39],white:[37,39],blackBright:[90,39],redBright:[91,39],greenBright:[92,39],yellowBright:[93,39],blueBright:[94,39],magentaBright:[95,39],cyanBright:[96,39],whiteBright:[97,39]},bgColor:{bgBlack:[40,49],bgRed:[41,49],bgGreen:[42,49],bgYellow:[43,49],bgBlue:[44,49],bgMagenta:[45,49],bgCyan:[46,49],bgWhite:[47,49],bgBlackBright:[100,49],bgRedBright:[101,49],bgGreenBright:[102,49],bgYellowBright:[103,49],bgBlueBright:[104,49],bgMagentaBright:[105,49],bgCyanBright:[106,49],bgWhiteBright:[107,49]}};r.color.gray=r.color.blackBright,r.bgColor.bgGray=r.bgColor.bgBlackBright,r.color.grey=r.color.blackBright,r.bgColor.bgGrey=r.bgColor.bgBlackBright;for(const[o,t]of Object.entries(r)){for(const[o,n]of Object.entries(t))r[o]={open:`[${n[0]}m`,close:`[${n[1]}m`},t[o]=r[o],e.set(n[0],n[1]);Object.defineProperty(r,o,{value:t,enumerable:!1})}return Object.defineProperty(r,"codes",{value:e,enumerable:!1}),r.color.close="[39m",r.bgColor.close="[49m",r.color.ansi256=wrapAnsi256(),r.color.ansi16m=wrapAnsi16m(),r.bgColor.ansi256=wrapAnsi256(10),r.bgColor.ansi16m=wrapAnsi16m(10),Object.defineProperties(r,{rgbToAnsi256:{value:(e,r,o)=>e===r&&r===o?e<8?16:e>248?231:Math.round((e-8)/24724)+232:16+36Math.round(e/2555)+6Math.round(r/2555)+Math.round(o/2555),enumerable:!1},hexToRgb:{value:e=>{const r=/(?<colorString>[a-f\d]{6}\|[a-f\d]{3})/i.exec(e.toString(16));if(!r)return[0,0,0];let{colorString:o}=r.groups;3===o.length&&(o=o.split("").map((e=>e+e)).join(""));const t=Number.parseInt(o,16);return[t>>16&255,t>>8&255,255&t]},enumerable:!1},hexToAnsi256:{value:e=>r.rgbToAnsi256(...r.hexToRgb(e)),enumerable:!1}}),r}})}(r.__module)),r.__module.exports}}));
2	+ //# sourceMappingURL=index.amd.js.map

package/dist/browser/node_modules/.pnpm/ansi-styles@5.2.0/node_modules/ansi-styles/index.amd.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"index.amd.js","sources":["../../../../../../../../../node_modules/.pnpm/ansi-styles@5.2.0/node_modules/ansi-styles/index.js"],"sourcesContent":["'use strict';\n\nconst ANSI_BACKGROUND_OFFSET = 10;\n\nconst wrapAnsi256 = (offset = 0) => code => `\\u001B[${38 + offset};5;${code}m`;\n\nconst wrapAnsi16m = (offset = 0) => (red, green, blue) => `\\u001B[${38 + offset};2;${red};${green};${blue}m`;\n\nfunction assembleStyles() {\n\tconst codes = new Map();\n\tconst styles = {\n\t\tmodifier: {\n\t\t\treset: [0, 0],\n\t\t\t// 21 isn't widely supported and 22 does the same thing\n\t\t\tbold: [1, 22],\n\t\t\tdim: [2, 22],\n\t\t\titalic: [3, 23],\n\t\t\tunderline: [4, 24],\n\t\t\toverline: [53, 55],\n\t\t\tinverse: [7, 27],\n\t\t\thidden: [8, 28],\n\t\t\tstrikethrough: [9, 29]\n\t\t},\n\t\tcolor: {\n\t\t\tblack: [30, 39],\n\t\t\tred: [31, 39],\n\t\t\tgreen: [32, 39],\n\t\t\tyellow: [33, 39],\n\t\t\tblue: [34, 39],\n\t\t\tmagenta: [35, 39],\n\t\t\tcyan: [36, 39],\n\t\t\twhite: [37, 39],\n\n\t\t\t// Bright color\n\t\t\tblackBright: [90, 39],\n\t\t\tredBright: [91, 39],\n\t\t\tgreenBright: [92, 39],\n\t\t\tyellowBright: [93, 39],\n\t\t\tblueBright: [94, 39],\n\t\t\tmagentaBright: [95, 39],\n\t\t\tcyanBright: [96, 39],\n\t\t\twhiteBright: [97, 39]\n\t\t},\n\t\tbgColor: {\n\t\t\tbgBlack: [40, 49],\n\t\t\tbgRed: [41, 49],\n\t\t\tbgGreen: [42, 49],\n\t\t\tbgYellow: [43, 49],\n\t\t\tbgBlue: [44, 49],\n\t\t\tbgMagenta: [45, 49],\n\t\t\tbgCyan: [46, 49],\n\t\t\tbgWhite: [47, 49],\n\n\t\t\t// Bright color\n\t\t\tbgBlackBright: [100, 49],\n\t\t\tbgRedBright: [101, 49],\n\t\t\tbgGreenBright: [102, 49],\n\t\t\tbgYellowBright: [103, 49],\n\t\t\tbgBlueBright: [104, 49],\n\t\t\tbgMagentaBright: [105, 49],\n\t\t\tbgCyanBright: [106, 49],\n\t\t\tbgWhiteBright: [107, 49]\n\t\t}\n\t};\n\n\t// Alias bright black as gray (and grey)\n\tstyles.color.gray = styles.color.blackBright;\n\tstyles.bgColor.bgGray = styles.bgColor.bgBlackBright;\n\tstyles.color.grey = styles.color.blackBright;\n\tstyles.bgColor.bgGrey = styles.bgColor.bgBlackBright;\n\n\tfor (const [groupName, group] of Object.entries(styles)) {\n\t\tfor (const [styleName, style] of Object.entries(group)) {\n\t\t\tstyles[styleName] = {\n\t\t\t\topen: `\\u001B[${style[0]}m`,\n\t\t\t\tclose: `\\u001B[${style[1]}m`\n\t\t\t};\n\n\t\t\tgroup[styleName] = styles[styleName];\n\n\t\t\tcodes.set(style[0], style[1]);\n\t\t}\n\n\t\tObject.defineProperty(styles, groupName, {\n\t\t\tvalue: group,\n\t\t\tenumerable: false\n\t\t});\n\t}\n\n\tObject.defineProperty(styles, 'codes', {\n\t\tvalue: codes,\n\t\tenumerable: false\n\t});\n\n\tstyles.color.close = '\\u001B[39m';\n\tstyles.bgColor.close = '\\u001B[49m';\n\n\tstyles.color.ansi256 = wrapAnsi256();\n\tstyles.color.ansi16m = wrapAnsi16m();\n\tstyles.bgColor.ansi256 = wrapAnsi256(ANSI_BACKGROUND_OFFSET);\n\tstyles.bgColor.ansi16m = wrapAnsi16m(ANSI_BACKGROUND_OFFSET);\n\n\t// From https://github.com/Qix-/color-convert/blob/3f0e0d4e92e235796ccb17f6e85c72094a651f49/conversions.js\n\tObject.defineProperties(styles, {\n\t\trgbToAnsi256: {\n\t\t\tvalue: (red, green, blue) => {\n\t\t\t\t// We use the extended greyscale palette here, with the exception of\n\t\t\t\t// black and white. normal palette only has 4 greyscale shades.\n\t\t\t\tif (red === green && green === blue) {\n\t\t\t\t\tif (red < 8) {\n\t\t\t\t\t\treturn 16;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (red > 248) {\n\t\t\t\t\t\treturn 231;\n\t\t\t\t\t}\n\n\t\t\t\t\treturn Math.round(((red - 8) / 247) * 24) + 232;\n\t\t\t\t}\n\n\t\t\t\treturn 16 +\n\t\t\t\t\t(36 * Math.round(red / 255 * 5)) +\n\t\t\t\t\t(6 * Math.round(green / 255 * 5)) +\n\t\t\t\t\tMath.round(blue / 255 * 5);\n\t\t\t},\n\t\t\tenumerable: false\n\t\t},\n\t\thexToRgb: {\n\t\t\tvalue: hex => {\n\t\t\t\tconst matches = /(?<colorString>[a-f\\d]{6}|[a-f\\d]{3})/i.exec(hex.toString(16));\n\t\t\t\tif (!matches) {\n\t\t\t\t\treturn [0, 0, 0];\n\t\t\t\t}\n\n\t\t\t\tlet {colorString} = matches.groups;\n\n\t\t\t\tif (colorString.length === 3) {\n\t\t\t\t\tcolorString = colorString.split('').map(character => character + character).join('');\n\t\t\t\t}\n\n\t\t\t\tconst integer = Number.parseInt(colorString, 16);\n\n\t\t\t\treturn [\n\t\t\t\t\t(integer >> 16) & 0xFF,\n\t\t\t\t\t(integer >> 8) & 0xFF,\n\t\t\t\t\tinteger & 0xFF\n\t\t\t\t];\n\t\t\t},\n\t\t\tenumerable: false\n\t\t},\n\t\thexToAnsi256: {\n\t\t\tvalue: hex => styles.rgbToAnsi256(...styles.hexToRgb(hex)),\n\t\t\tenumerable: false\n\t\t}\n\t});\n\n\treturn styles;\n}\n\n// Make the export immutable\nObject.defineProperty(module, 'exports', {\n\tenumerable: true,\n\tget: assembleStyles\n});\n"],"names":["wrapAnsi256","offset","code","wrapAnsi16m","red","green","blue","Object","defineProperty","module","enumerable","get","assembleStyles","codes","Map","styles","modifier","reset","bold","dim","italic","underline","overline","inverse","hidden","strikethrough","color","black","yellow","magenta","cyan","white","blackBright","redBright","greenBright","yellowBright","blueBright","magentaBright","cyanBright","whiteBright","bgColor","bgBlack","bgRed","bgGreen","bgYellow","bgBlue","bgMagenta","bgCyan","bgWhite","bgBlackBright","bgRedBright","bgGreenBright","bgYellowBright","bgBlueBright","bgMagentaBright","bgCyanBright","bgWhiteBright","gray","bgGray","grey","bgGrey","groupName","group","entries","styleName","style","open","close","set","value","ansi256","ansi16m","defineProperties","rgbToAnsi256","Math","round","hexToRgb","hex","matches","exec","toString","colorString","groups","length","split","map","character","join","integer","Number","parseInt","hexToAnsi256"],"mappings":"iLAEA,MAEMA,YAAc,CAACC,EAAS,IAAMC,GAAQ,KAAU,GAAKD,OAAYC,KAEjEC,YAAc,CAACF,EAAS,IAAM,CAACG,EAAKC,EAAOC,IAAS,KAAU,GAAKL,OAAYG,KAAOC,KAASC,KA0JrGC,OAAOC,eAAeC,EAAQ,UAAW,CACxCC,YAAY,EACZC,IA1JD,SAASC,iBACR,MAAMC,EAAQ,IAAIC,IACZC,EAAS,CACdC,SAAU,CACTC,MAAO,CAAC,EAAG,GAEXC,KAAM,CAAC,EAAG,IACVC,IAAK,CAAC,EAAG,IACTC,OAAQ,CAAC,EAAG,IACZC,UAAW,CAAC,EAAG,IACfC,SAAU,CAAC,GAAI,IACfC,QAAS,CAAC,EAAG,IACbC,OAAQ,CAAC,EAAG,IACZC,cAAe,CAAC,EAAG,KAEpBC,MAAO,CACNC,MAAO,CAAC,GAAI,IACZvB,IAAK,CAAC,GAAI,IACVC,MAAO,CAAC,GAAI,IACZuB,OAAQ,CAAC,GAAI,IACbtB,KAAM,CAAC,GAAI,IACXuB,QAAS,CAAC,GAAI,IACdC,KAAM,CAAC,GAAI,IACXC,MAAO,CAAC,GAAI,IAGZC,YAAa,CAAC,GAAI,IAClBC,UAAW,CAAC,GAAI,IAChBC,YAAa,CAAC,GAAI,IAClBC,aAAc,CAAC,GAAI,IACnBC,WAAY,CAAC,GAAI,IACjBC,cAAe,CAAC,GAAI,IACpBC,WAAY,CAAC,GAAI,IACjBC,YAAa,CAAC,GAAI,KAEnBC,QAAS,CACRC,QAAS,CAAC,GAAI,IACdC,MAAO,CAAC,GAAI,IACZC,QAAS,CAAC,GAAI,IACdC,SAAU,CAAC,GAAI,IACfC,OAAQ,CAAC,GAAI,IACbC,UAAW,CAAC,GAAI,IAChBC,OAAQ,CAAC,GAAI,IACbC,QAAS,CAAC,GAAI,IAGdC,cAAe,CAAC,IAAK,IACrBC,YAAa,CAAC,IAAK,IACnBC,cAAe,CAAC,IAAK,IACrBC,eAAgB,CAAC,IAAK,IACtBC,aAAc,CAAC,IAAK,IACpBC,gBAAiB,CAAC,IAAK,IACvBC,aAAc,CAAC,IAAK,IACpBC,cAAe,CAAC,IAAK,MAKvBzC,EAAOW,MAAM+B,KAAO1C,EAAOW,MAAMM,YACjCjB,EAAOyB,QAAQkB,OAAS3C,EAAOyB,QAAQS,cACvClC,EAAOW,MAAMiC,KAAO5C,EAAOW,MAAMM,YACjCjB,EAAOyB,QAAQoB,OAAS7C,EAAOyB,QAAQS,cAEvC,IAAK,MAAOY,EAAWC,KAAUvD,OAAOwD,QAAQhD,GAAS,CACxD,IAAK,MAAOiD,EAAWC,KAAU1D,OAAOwD,QAAQD,GAC/C/C,EAAOiD,GAAa,CACnBE,KAAM,KAAUD,EAAM,MACtBE,MAAO,KAAUF,EAAM,OAGxBH,EAAME,GAAajD,EAAOiD,GAE1BnD,EAAMuD,IAAIH,EAAM,GAAIA,EAAM,IAG3B1D,OAAOC,eAAeO,EAAQ8C,EAAW,CACxCQ,MAAOP,EACPpD,YAAY,GAEf,CAqEC,OAnEAH,OAAOC,eAAeO,EAAQ,QAAS,CACtCsD,MAAOxD,EACPH,YAAY,IAGbK,EAAOW,MAAMyC,MAAQ,QACrBpD,EAAOyB,QAAQ2B,MAAQ,QAEvBpD,EAAOW,MAAM4C,QAAUtE,cACvBe,EAAOW,MAAM6C,QAAUpE,cACvBY,EAAOyB,QAAQ8B,QAAUtE,YAjGK,IAkG9Be,EAAOyB,QAAQ+B,QAAUpE,YAlGK,IAqG9BI,OAAOiE,iBAAiBzD,EAAQ,CAC/B0D,aAAc,CACbJ,MAAO,CAACjE,EAAKC,EAAOC,IAGfF,IAAQC,GAASA,IAAUC,EAC1BF,EAAM,EACF,GAGJA,EAAM,IACF,IAGDsE,KAAKC,OAAQvE,EAAM,GAAK,IAAO,IAAM,IAGtC,GACL,GAAKsE,KAAKC,MAAMvE,EAAM,IAAM,GAC5B,EAAIsE,KAAKC,MAAMtE,EAAQ,IAAM,GAC9BqE,KAAKC,MAAMrE,EAAO,IAAM,GAE1BI,YAAY,GAEbkE,SAAU,CACTP,MAAOQ,IACN,MAAMC,EAAU,yCAAyCC,KAAKF,EAAIG,SAAS,KAC3E,IAAKF,EACJ,MAAO,CAAC,EAAG,EAAG,GAGf,IAAIG,YAACA,GAAeH,EAAQI,OAED,IAAvBD,EAAYE,SACfF,EAAcA,EAAYG,MAAM,IAAIC,KAAIC,GAAaA,EAAYA,IAAWC,KAAK,KAGlF,MAAMC,EAAUC,OAAOC,SAAST,EAAa,IAE7C,MAAO,CACLO,GAAW,GAAM,IACjBA,GAAW,EAAK,IACP,IAAVA,EACA,EAEF9E,YAAY,GAEbiF,aAAc,CACbtB,MAAOQ,GAAO9D,EAAO0D,gBAAgB1D,EAAO6D,SAASC,IACrDnE,YAAY,KAIPK,CACR","x_google_ignoreList":[0]}

package/dist/browser/node_modules/.pnpm/ansi-styles@5.2.0/node_modules/ansi-styles/index.esm.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ import{__module as e}from"../../../../../_virtual/index.esm6.js";var r;function requireAnsiStyles(){return r\|\|(r=1,function(e){const wrapAnsi256=(e=0)=>r=>`[${38+e};5;${r}m`,wrapAnsi16m=(e=0)=>(r,o,t)=>`[${38+e};2;${r};${o};${t}m`;Object.defineProperty(e,"exports",{enumerable:!0,get:function assembleStyles(){const e=new Map,r={modifier:{reset:[0,0],bold:[1,22],dim:[2,22],italic:[3,23],underline:[4,24],overline:[53,55],inverse:[7,27],hidden:[8,28],strikethrough:[9,29]},color:{black:[30,39],red:[31,39],green:[32,39],yellow:[33,39],blue:[34,39],magenta:[35,39],cyan:[36,39],white:[37,39],blackBright:[90,39],redBright:[91,39],greenBright:[92,39],yellowBright:[93,39],blueBright:[94,39],magentaBright:[95,39],cyanBright:[96,39],whiteBright:[97,39]},bgColor:{bgBlack:[40,49],bgRed:[41,49],bgGreen:[42,49],bgYellow:[43,49],bgBlue:[44,49],bgMagenta:[45,49],bgCyan:[46,49],bgWhite:[47,49],bgBlackBright:[100,49],bgRedBright:[101,49],bgGreenBright:[102,49],bgYellowBright:[103,49],bgBlueBright:[104,49],bgMagentaBright:[105,49],bgCyanBright:[106,49],bgWhiteBright:[107,49]}};r.color.gray=r.color.blackBright,r.bgColor.bgGray=r.bgColor.bgBlackBright,r.color.grey=r.color.blackBright,r.bgColor.bgGrey=r.bgColor.bgBlackBright;for(const[o,t]of Object.entries(r)){for(const[o,g]of Object.entries(t))r[o]={open:`[${g[0]}m`,close:`[${g[1]}m`},t[o]=r[o],e.set(g[0],g[1]);Object.defineProperty(r,o,{value:t,enumerable:!1})}return Object.defineProperty(r,"codes",{value:e,enumerable:!1}),r.color.close="[39m",r.bgColor.close="[49m",r.color.ansi256=wrapAnsi256(),r.color.ansi16m=wrapAnsi16m(),r.bgColor.ansi256=wrapAnsi256(10),r.bgColor.ansi16m=wrapAnsi16m(10),Object.defineProperties(r,{rgbToAnsi256:{value:(e,r,o)=>e===r&&r===o?e<8?16:e>248?231:Math.round((e-8)/24724)+232:16+36Math.round(e/2555)+6Math.round(r/2555)+Math.round(o/2555),enumerable:!1},hexToRgb:{value:e=>{const r=/(?<colorString>[a-f\d]{6}\|[a-f\d]{3})/i.exec(e.toString(16));if(!r)return[0,0,0];let{colorString:o}=r.groups;3===o.length&&(o=o.split("").map((e=>e+e)).join(""));const t=Number.parseInt(o,16);return[t>>16&255,t>>8&255,255&t]},enumerable:!1},hexToAnsi256:{value:e=>r.rgbToAnsi256(...r.hexToRgb(e)),enumerable:!1}}),r}})}(e)),e.exports}e.exports;export{requireAnsiStyles as __require};
2	+ //# sourceMappingURL=index.esm.js.map

package/dist/browser/node_modules/.pnpm/ansi-styles@5.2.0/node_modules/ansi-styles/index.esm.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"index.esm.js","sources":["../../../../../../../../../node_modules/.pnpm/ansi-styles@5.2.0/node_modules/ansi-styles/index.js"],"sourcesContent":["'use strict';\n\nconst ANSI_BACKGROUND_OFFSET = 10;\n\nconst wrapAnsi256 = (offset = 0) => code => `\\u001B[${38 + offset};5;${code}m`;\n\nconst wrapAnsi16m = (offset = 0) => (red, green, blue) => `\\u001B[${38 + offset};2;${red};${green};${blue}m`;\n\nfunction assembleStyles() {\n\tconst codes = new Map();\n\tconst styles = {\n\t\tmodifier: {\n\t\t\treset: [0, 0],\n\t\t\t// 21 isn't widely supported and 22 does the same thing\n\t\t\tbold: [1, 22],\n\t\t\tdim: [2, 22],\n\t\t\titalic: [3, 23],\n\t\t\tunderline: [4, 24],\n\t\t\toverline: [53, 55],\n\t\t\tinverse: [7, 27],\n\t\t\thidden: [8, 28],\n\t\t\tstrikethrough: [9, 29]\n\t\t},\n\t\tcolor: {\n\t\t\tblack: [30, 39],\n\t\t\tred: [31, 39],\n\t\t\tgreen: [32, 39],\n\t\t\tyellow: [33, 39],\n\t\t\tblue: [34, 39],\n\t\t\tmagenta: [35, 39],\n\t\t\tcyan: [36, 39],\n\t\t\twhite: [37, 39],\n\n\t\t\t// Bright color\n\t\t\tblackBright: [90, 39],\n\t\t\tredBright: [91, 39],\n\t\t\tgreenBright: [92, 39],\n\t\t\tyellowBright: [93, 39],\n\t\t\tblueBright: [94, 39],\n\t\t\tmagentaBright: [95, 39],\n\t\t\tcyanBright: [96, 39],\n\t\t\twhiteBright: [97, 39]\n\t\t},\n\t\tbgColor: {\n\t\t\tbgBlack: [40, 49],\n\t\t\tbgRed: [41, 49],\n\t\t\tbgGreen: [42, 49],\n\t\t\tbgYellow: [43, 49],\n\t\t\tbgBlue: [44, 49],\n\t\t\tbgMagenta: [45, 49],\n\t\t\tbgCyan: [46, 49],\n\t\t\tbgWhite: [47, 49],\n\n\t\t\t// Bright color\n\t\t\tbgBlackBright: [100, 49],\n\t\t\tbgRedBright: [101, 49],\n\t\t\tbgGreenBright: [102, 49],\n\t\t\tbgYellowBright: [103, 49],\n\t\t\tbgBlueBright: [104, 49],\n\t\t\tbgMagentaBright: [105, 49],\n\t\t\tbgCyanBright: [106, 49],\n\t\t\tbgWhiteBright: [107, 49]\n\t\t}\n\t};\n\n\t// Alias bright black as gray (and grey)\n\tstyles.color.gray = styles.color.blackBright;\n\tstyles.bgColor.bgGray = styles.bgColor.bgBlackBright;\n\tstyles.color.grey = styles.color.blackBright;\n\tstyles.bgColor.bgGrey = styles.bgColor.bgBlackBright;\n\n\tfor (const [groupName, group] of Object.entries(styles)) {\n\t\tfor (const [styleName, style] of Object.entries(group)) {\n\t\t\tstyles[styleName] = {\n\t\t\t\topen: `\\u001B[${style[0]}m`,\n\t\t\t\tclose: `\\u001B[${style[1]}m`\n\t\t\t};\n\n\t\t\tgroup[styleName] = styles[styleName];\n\n\t\t\tcodes.set(style[0], style[1]);\n\t\t}\n\n\t\tObject.defineProperty(styles, groupName, {\n\t\t\tvalue: group,\n\t\t\tenumerable: false\n\t\t});\n\t}\n\n\tObject.defineProperty(styles, 'codes', {\n\t\tvalue: codes,\n\t\tenumerable: false\n\t});\n\n\tstyles.color.close = '\\u001B[39m';\n\tstyles.bgColor.close = '\\u001B[49m';\n\n\tstyles.color.ansi256 = wrapAnsi256();\n\tstyles.color.ansi16m = wrapAnsi16m();\n\tstyles.bgColor.ansi256 = wrapAnsi256(ANSI_BACKGROUND_OFFSET);\n\tstyles.bgColor.ansi16m = wrapAnsi16m(ANSI_BACKGROUND_OFFSET);\n\n\t// From https://github.com/Qix-/color-convert/blob/3f0e0d4e92e235796ccb17f6e85c72094a651f49/conversions.js\n\tObject.defineProperties(styles, {\n\t\trgbToAnsi256: {\n\t\t\tvalue: (red, green, blue) => {\n\t\t\t\t// We use the extended greyscale palette here, with the exception of\n\t\t\t\t// black and white. normal palette only has 4 greyscale shades.\n\t\t\t\tif (red === green && green === blue) {\n\t\t\t\t\tif (red < 8) {\n\t\t\t\t\t\treturn 16;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (red > 248) {\n\t\t\t\t\t\treturn 231;\n\t\t\t\t\t}\n\n\t\t\t\t\treturn Math.round(((red - 8) / 247) * 24) + 232;\n\t\t\t\t}\n\n\t\t\t\treturn 16 +\n\t\t\t\t\t(36 * Math.round(red / 255 * 5)) +\n\t\t\t\t\t(6 * Math.round(green / 255 * 5)) +\n\t\t\t\t\tMath.round(blue / 255 * 5);\n\t\t\t},\n\t\t\tenumerable: false\n\t\t},\n\t\thexToRgb: {\n\t\t\tvalue: hex => {\n\t\t\t\tconst matches = /(?<colorString>[a-f\\d]{6}|[a-f\\d]{3})/i.exec(hex.toString(16));\n\t\t\t\tif (!matches) {\n\t\t\t\t\treturn [0, 0, 0];\n\t\t\t\t}\n\n\t\t\t\tlet {colorString} = matches.groups;\n\n\t\t\t\tif (colorString.length === 3) {\n\t\t\t\t\tcolorString = colorString.split('').map(character => character + character).join('');\n\t\t\t\t}\n\n\t\t\t\tconst integer = Number.parseInt(colorString, 16);\n\n\t\t\t\treturn [\n\t\t\t\t\t(integer >> 16) & 0xFF,\n\t\t\t\t\t(integer >> 8) & 0xFF,\n\t\t\t\t\tinteger & 0xFF\n\t\t\t\t];\n\t\t\t},\n\t\t\tenumerable: false\n\t\t},\n\t\thexToAnsi256: {\n\t\t\tvalue: hex => styles.rgbToAnsi256(...styles.hexToRgb(hex)),\n\t\t\tenumerable: false\n\t\t}\n\t});\n\n\treturn styles;\n}\n\n// Make the export immutable\nObject.defineProperty(module, 'exports', {\n\tenumerable: true,\n\tget: assembleStyles\n});\n"],"names":["wrapAnsi256","offset","code","wrapAnsi16m","red","green","blue","Object","defineProperty","module","enumerable","get","assembleStyles","codes","Map","styles","modifier","reset","bold","dim","italic","underline","overline","inverse","hidden","strikethrough","color","black","yellow","magenta","cyan","white","blackBright","redBright","greenBright","yellowBright","blueBright","magentaBright","cyanBright","whiteBright","bgColor","bgBlack","bgRed","bgGreen","bgYellow","bgBlue","bgMagenta","bgCyan","bgWhite","bgBlackBright","bgRedBright","bgGreenBright","bgYellowBright","bgBlueBright","bgMagentaBright","bgCyanBright","bgWhiteBright","gray","bgGray","grey","bgGrey","groupName","group","entries","styleName","style","open","close","set","value","ansi256","ansi16m","defineProperties","rgbToAnsi256","Math","round","hexToRgb","hex","matches","exec","toString","colorString","groups","length","split","map","character","join","integer","Number","parseInt","hexToAnsi256"],"mappings":"+HAEA,MAEMA,YAAc,CAACC,EAAS,IAAMC,GAAQ,KAAU,GAAKD,OAAYC,KAEjEC,YAAc,CAACF,EAAS,IAAM,CAACG,EAAKC,EAAOC,IAAS,KAAU,GAAKL,OAAYG,KAAOC,KAASC,KA0JrGC,OAAOC,eAAeC,EAAQ,UAAW,CACxCC,YAAY,EACZC,IA1JD,SAASC,iBACR,MAAMC,EAAQ,IAAIC,IACZC,EAAS,CACdC,SAAU,CACTC,MAAO,CAAC,EAAG,GAEXC,KAAM,CAAC,EAAG,IACVC,IAAK,CAAC,EAAG,IACTC,OAAQ,CAAC,EAAG,IACZC,UAAW,CAAC,EAAG,IACfC,SAAU,CAAC,GAAI,IACfC,QAAS,CAAC,EAAG,IACbC,OAAQ,CAAC,EAAG,IACZC,cAAe,CAAC,EAAG,KAEpBC,MAAO,CACNC,MAAO,CAAC,GAAI,IACZvB,IAAK,CAAC,GAAI,IACVC,MAAO,CAAC,GAAI,IACZuB,OAAQ,CAAC,GAAI,IACbtB,KAAM,CAAC,GAAI,IACXuB,QAAS,CAAC,GAAI,IACdC,KAAM,CAAC,GAAI,IACXC,MAAO,CAAC,GAAI,IAGZC,YAAa,CAAC,GAAI,IAClBC,UAAW,CAAC,GAAI,IAChBC,YAAa,CAAC,GAAI,IAClBC,aAAc,CAAC,GAAI,IACnBC,WAAY,CAAC,GAAI,IACjBC,cAAe,CAAC,GAAI,IACpBC,WAAY,CAAC,GAAI,IACjBC,YAAa,CAAC,GAAI,KAEnBC,QAAS,CACRC,QAAS,CAAC,GAAI,IACdC,MAAO,CAAC,GAAI,IACZC,QAAS,CAAC,GAAI,IACdC,SAAU,CAAC,GAAI,IACfC,OAAQ,CAAC,GAAI,IACbC,UAAW,CAAC,GAAI,IAChBC,OAAQ,CAAC,GAAI,IACbC,QAAS,CAAC,GAAI,IAGdC,cAAe,CAAC,IAAK,IACrBC,YAAa,CAAC,IAAK,IACnBC,cAAe,CAAC,IAAK,IACrBC,eAAgB,CAAC,IAAK,IACtBC,aAAc,CAAC,IAAK,IACpBC,gBAAiB,CAAC,IAAK,IACvBC,aAAc,CAAC,IAAK,IACpBC,cAAe,CAAC,IAAK,MAKvBzC,EAAOW,MAAM+B,KAAO1C,EAAOW,MAAMM,YACjCjB,EAAOyB,QAAQkB,OAAS3C,EAAOyB,QAAQS,cACvClC,EAAOW,MAAMiC,KAAO5C,EAAOW,MAAMM,YACjCjB,EAAOyB,QAAQoB,OAAS7C,EAAOyB,QAAQS,cAEvC,IAAK,MAAOY,EAAWC,KAAUvD,OAAOwD,QAAQhD,GAAS,CACxD,IAAK,MAAOiD,EAAWC,KAAU1D,OAAOwD,QAAQD,GAC/C/C,EAAOiD,GAAa,CACnBE,KAAM,KAAUD,EAAM,MACtBE,MAAO,KAAUF,EAAM,OAGxBH,EAAME,GAAajD,EAAOiD,GAE1BnD,EAAMuD,IAAIH,EAAM,GAAIA,EAAM,IAG3B1D,OAAOC,eAAeO,EAAQ8C,EAAW,CACxCQ,MAAOP,EACPpD,YAAY,GAEf,CAqEC,OAnEAH,OAAOC,eAAeO,EAAQ,QAAS,CACtCsD,MAAOxD,EACPH,YAAY,IAGbK,EAAOW,MAAMyC,MAAQ,QACrBpD,EAAOyB,QAAQ2B,MAAQ,QAEvBpD,EAAOW,MAAM4C,QAAUtE,cACvBe,EAAOW,MAAM6C,QAAUpE,cACvBY,EAAOyB,QAAQ8B,QAAUtE,YAjGK,IAkG9Be,EAAOyB,QAAQ+B,QAAUpE,YAlGK,IAqG9BI,OAAOiE,iBAAiBzD,EAAQ,CAC/B0D,aAAc,CACbJ,MAAO,CAACjE,EAAKC,EAAOC,IAGfF,IAAQC,GAASA,IAAUC,EAC1BF,EAAM,EACF,GAGJA,EAAM,IACF,IAGDsE,KAAKC,OAAQvE,EAAM,GAAK,IAAO,IAAM,IAGtC,GACL,GAAKsE,KAAKC,MAAMvE,EAAM,IAAM,GAC5B,EAAIsE,KAAKC,MAAMtE,EAAQ,IAAM,GAC9BqE,KAAKC,MAAMrE,EAAO,IAAM,GAE1BI,YAAY,GAEbkE,SAAU,CACTP,MAAOQ,IACN,MAAMC,EAAU,yCAAyCC,KAAKF,EAAIG,SAAS,KAC3E,IAAKF,EACJ,MAAO,CAAC,EAAG,EAAG,GAGf,IAAIG,YAACA,GAAeH,EAAQI,OAED,IAAvBD,EAAYE,SACfF,EAAcA,EAAYG,MAAM,IAAIC,KAAIC,GAAaA,EAAYA,IAAWC,KAAK,KAGlF,MAAMC,EAAUC,OAAOC,SAAST,EAAa,IAE7C,MAAO,CACLO,GAAW,GAAM,IACjBA,GAAW,EAAK,IACP,IAAVA,EACA,EAEF9E,YAAY,GAEbiF,aAAc,CACbtB,MAAOQ,GAAO9D,EAAO0D,gBAAgB1D,EAAO6D,SAASC,IACrDnE,YAAY,KAIPK,CACR","x_google_ignoreList":[0]}

package/dist/browser/node_modules/.pnpm/assertion-error@1.1.0/node_modules/assertion-error/index.amd.js ADDED Viewed

@@ -0,0 +1,30 @@
+define(["exports"],(function(r){"use strict";
+/*!
+   * assertion-error
+   * Copyright(c) 2013 Jake Luer <jake@qualiancy.com>
+   * MIT Licensed
+   */var t,e;r.__require=function requireAssertionError(){if(e)return t;
+/*!
+  	 * Return a function that will copy properties from
+  	 * one object to another excluding any originally
+  	 * listed. Returned function will create a new `{}`.
+  	 *
+  	 * @param {String} excluded properties ...
+  	 * @return {Function}
+  	 */
+function exclude(){var r=[].slice.call(arguments);function excludeProps(t,e){Object.keys(e).forEach((function(o){~r.indexOf(o)||(t[o]=e[o])}))}return function extendExclude(){for(var r=[].slice.call(arguments),t=0,e={};t<r.length;t++)excludeProps(e,r[t]);return e}}
+/*!
+  	 * Primary Exports
+  	 */function AssertionError(r,t,e){var o=exclude("name","message","stack","constructor","toJSON")(t||{});for(var s in this.message=r||"Unspecified AssertionError",this.showDiff=!1,o)this[s]=o[s];if(e=e||AssertionError,Error.captureStackTrace)Error.captureStackTrace(this,e);else try{throw new Error}catch(r){this.stack=r.stack}}
+/*!
+  	 * Inherit from Error.prototype
+  	 */return e=1,t=AssertionError,AssertionError.prototype=Object.create(Error.prototype),
+/*!
+  	 * Statically set name
+  	 */
+AssertionError.prototype.name="AssertionError",
+/*!
+  	 * Ensure correct constructor
+  	 */
+AssertionError.prototype.constructor=AssertionError,AssertionError.prototype.toJSON=function(r){var t=exclude("constructor","toJSON","stack")({name:this.name},this);return!1!==r&&this.stack&&(t.stack=this.stack),t},t}}));
+//# sourceMappingURL=index.amd.js.map

package/dist/browser/node_modules/.pnpm/assertion-error@1.1.0/node_modules/assertion-error/index.amd.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"index.amd.js","sources":["../../../../../../../../../node_modules/.pnpm/assertion-error@1.1.0/node_modules/assertion-error/index.js"],"sourcesContent":["/*!\n * assertion-error\n * Copyright(c) 2013 Jake Luer <jake@qualiancy.com>\n * MIT Licensed\n */\n\n/*!\n * Return a function that will copy properties from\n * one object to another excluding any originally\n * listed. Returned function will create a new `{}`.\n *\n * @param {String} excluded properties ...\n * @return {Function}\n */\n\nfunction exclude () {\n var excludes = [].slice.call(arguments);\n\n function excludeProps (res, obj) {\n Object.keys(obj).forEach(function (key) {\n if (!~excludes.indexOf(key)) res[key] = obj[key];\n });\n }\n\n return function extendExclude () {\n var args = [].slice.call(arguments)\n , i = 0\n , res = {};\n\n for (; i < args.length; i++) {\n excludeProps(res, args[i]);\n }\n\n return res;\n };\n};\n\n/*!\n * Primary Exports\n */\n\nmodule.exports = AssertionError;\n\n/**\n * ### AssertionError\n *\n * An extension of the JavaScript `Error` constructor for\n * assertion and validation scenarios.\n *\n * @param {String} message\n * @param {Object} properties to include (optional)\n * @param {callee} start stack function (optional)\n */\n\nfunction AssertionError (message, _props, ssf) {\n var extend = exclude('name', 'message', 'stack', 'constructor', 'toJSON')\n , props = extend(_props || {});\n\n // default values\n this.message = message || 'Unspecified AssertionError';\n this.showDiff = false;\n\n // copy from properties\n for (var key in props) {\n this[key] = props[key];\n }\n\n // capture stack trace\n ssf = ssf || AssertionError;\n if (Error.captureStackTrace) {\n Error.captureStackTrace(this, ssf);\n } else {\n try {\n throw new Error();\n } catch(e) {\n this.stack = e.stack;\n }\n }\n}\n\n/*!\n * Inherit from Error.prototype\n */\n\nAssertionError.prototype = Object.create(Error.prototype);\n\n/*!\n * Statically set name\n */\n\nAssertionError.prototype.name = 'AssertionError';\n\n/*!\n * Ensure correct constructor\n */\n\nAssertionError.prototype.constructor = AssertionError;\n\n/**\n * Allow errors to be converted to JSON for static transfer.\n *\n * @param {Boolean} include stack (default: `true`)\n * @return {Object} object that can be `JSON.stringify`\n */\n\nAssertionError.prototype.toJSON = function (stack) {\n var extend = exclude('constructor', 'toJSON', 'stack')\n , props = extend({ name: this.name }, this);\n\n // include stack if exists and not turned off\n if (false !== stack && this.stack) {\n props.stack = this.stack;\n }\n\n return props;\n};\n"],"names":["exclude","excludes","slice","call","arguments","excludeProps","res","obj","Object","keys","forEach","key","indexOf","extendExclude","args","i","length","AssertionError","message","_props","ssf","props","extend","this","showDiff","Error","captureStackTrace","e","stack","assertionError","prototype","create","name","constructor","toJSON"],"mappings":";;;;;;;;;;;;;;AAeA,SAASA,UACP,IAAIC,EAAW,GAAGC,MAAMC,KAAKC,WAE7B,SAASC,aAAcC,EAAKC,GAC1BC,OAAOC,KAAKF,GAAKG,SAAQ,SAAUC,IAC3BV,EAASW,QAAQD,KAAML,EAAIK,GAAOJ,EAAII,GAClD,GACA,CAEE,OAAO,SAASE,gBAKd,IAJA,IAAIC,EAAO,GAAGZ,MAAMC,KAAKC,WACrBW,EAAI,EACJT,EAAM,CAAE,EAELS,EAAID,EAAKE,OAAQD,IACtBV,aAAaC,EAAKQ,EAAKC,IAGzB,OAAOT,CACR;;;MAoBH,SAASW,eAAgBC,EAASC,EAAQC,GACxC,IACIC,EADSrB,QAAQ,OAAQ,UAAW,QAAS,cAAe,SACpDsB,CAAOH,GAAU,IAO7B,IAAK,IAAIR,KAJTY,KAAKL,QAAUA,GAAW,6BAC1BK,KAAKC,UAAW,EAGAH,EACdE,KAAKZ,GAAOU,EAAMV,GAKpB,GADAS,EAAMA,GAAOH,eACTQ,MAAMC,kBACRD,MAAMC,kBAAkBH,KAAMH,QAE9B,IACE,MAAM,IAAIK,KACX,CAAC,MAAME,GACNJ,KAAKK,MAAQD,EAAEC,KACrB,CAEA;;;iBArCAC,EAAiBZ,eA2CjBA,eAAea,UAAYtB,OAAOuB,OAAON,MAAMK;;;;AAM/Cb,eAAea,UAAUE,KAAO;;;;AAMhCf,eAAea,UAAUG,YAAchB,eASvCA,eAAea,UAAUI,OAAS,SAAUN,GAC1C,IACIP,EADSrB,QAAQ,cAAe,SAAU,QAClCsB,CAAO,CAAEU,KAAMT,KAAKS,MAAQT,MAOxC,OAJI,IAAUK,GAASL,KAAKK,QAC1BP,EAAMO,MAAQL,KAAKK,OAGdP,CACR","x_google_ignoreList":[0]}

package/dist/browser/node_modules/.pnpm/assertion-error@1.1.0/node_modules/assertion-error/index.esm.js ADDED Viewed

@@ -0,0 +1,30 @@
+/*!
+ * assertion-error
+ * Copyright(c) 2013 Jake Luer <jake@qualiancy.com>
+ * MIT Licensed
+ */
+var r,t;function requireAssertionError(){if(t)return r;
+/*!
+	 * Return a function that will copy properties from
+	 * one object to another excluding any originally
+	 * listed. Returned function will create a new `{}`.
+	 *
+	 * @param {String} excluded properties ...
+	 * @return {Function}
+	 */
+function exclude(){var r=[].slice.call(arguments);function excludeProps(t,e){Object.keys(e).forEach((function(o){~r.indexOf(o)||(t[o]=e[o])}))}return function extendExclude(){for(var r=[].slice.call(arguments),t=0,e={};t<r.length;t++)excludeProps(e,r[t]);return e}}
+/*!
+	 * Primary Exports
+	 */function AssertionError(r,t,e){var o=exclude("name","message","stack","constructor","toJSON")(t||{});for(var s in this.message=r||"Unspecified AssertionError",this.showDiff=!1,o)this[s]=o[s];if(e=e||AssertionError,Error.captureStackTrace)Error.captureStackTrace(this,e);else try{throw new Error}catch(r){this.stack=r.stack}}
+/*!
+	 * Inherit from Error.prototype
+	 */return t=1,r=AssertionError,AssertionError.prototype=Object.create(Error.prototype),
+/*!
+	 * Statically set name
+	 */
+AssertionError.prototype.name="AssertionError",
+/*!
+	 * Ensure correct constructor
+	 */
+AssertionError.prototype.constructor=AssertionError,AssertionError.prototype.toJSON=function(r){var t=exclude("constructor","toJSON","stack")({name:this.name},this);return!1!==r&&this.stack&&(t.stack=this.stack),t},r}export{requireAssertionError as __require};
+//# sourceMappingURL=index.esm.js.map

package/dist/browser/node_modules/.pnpm/assertion-error@1.1.0/node_modules/assertion-error/index.esm.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"index.esm.js","sources":["../../../../../../../../../node_modules/.pnpm/assertion-error@1.1.0/node_modules/assertion-error/index.js"],"sourcesContent":["/*!\n * assertion-error\n * Copyright(c) 2013 Jake Luer <jake@qualiancy.com>\n * MIT Licensed\n */\n\n/*!\n * Return a function that will copy properties from\n * one object to another excluding any originally\n * listed. Returned function will create a new `{}`.\n *\n * @param {String} excluded properties ...\n * @return {Function}\n */\n\nfunction exclude () {\n var excludes = [].slice.call(arguments);\n\n function excludeProps (res, obj) {\n Object.keys(obj).forEach(function (key) {\n if (!~excludes.indexOf(key)) res[key] = obj[key];\n });\n }\n\n return function extendExclude () {\n var args = [].slice.call(arguments)\n , i = 0\n , res = {};\n\n for (; i < args.length; i++) {\n excludeProps(res, args[i]);\n }\n\n return res;\n };\n};\n\n/*!\n * Primary Exports\n */\n\nmodule.exports = AssertionError;\n\n/**\n * ### AssertionError\n *\n * An extension of the JavaScript `Error` constructor for\n * assertion and validation scenarios.\n *\n * @param {String} message\n * @param {Object} properties to include (optional)\n * @param {callee} start stack function (optional)\n */\n\nfunction AssertionError (message, _props, ssf) {\n var extend = exclude('name', 'message', 'stack', 'constructor', 'toJSON')\n , props = extend(_props || {});\n\n // default values\n this.message = message || 'Unspecified AssertionError';\n this.showDiff = false;\n\n // copy from properties\n for (var key in props) {\n this[key] = props[key];\n }\n\n // capture stack trace\n ssf = ssf || AssertionError;\n if (Error.captureStackTrace) {\n Error.captureStackTrace(this, ssf);\n } else {\n try {\n throw new Error();\n } catch(e) {\n this.stack = e.stack;\n }\n }\n}\n\n/*!\n * Inherit from Error.prototype\n */\n\nAssertionError.prototype = Object.create(Error.prototype);\n\n/*!\n * Statically set name\n */\n\nAssertionError.prototype.name = 'AssertionError';\n\n/*!\n * Ensure correct constructor\n */\n\nAssertionError.prototype.constructor = AssertionError;\n\n/**\n * Allow errors to be converted to JSON for static transfer.\n *\n * @param {Boolean} include stack (default: `true`)\n * @return {Object} object that can be `JSON.stringify`\n */\n\nAssertionError.prototype.toJSON = function (stack) {\n var extend = exclude('constructor', 'toJSON', 'stack')\n , props = extend({ name: this.name }, this);\n\n // include stack if exists and not turned off\n if (false !== stack && this.stack) {\n props.stack = this.stack;\n }\n\n return props;\n};\n"],"names":["exclude","excludes","slice","call","arguments","excludeProps","res","obj","Object","keys","forEach","key","indexOf","extendExclude","args","i","length","AssertionError","message","_props","ssf","props","extend","this","showDiff","Error","captureStackTrace","e","stack","assertionError","prototype","create","name","constructor","toJSON"],"mappings":";;;;;;;;;;;;;;AAeA,SAASA,UACP,IAAIC,EAAW,GAAGC,MAAMC,KAAKC,WAE7B,SAASC,aAAcC,EAAKC,GAC1BC,OAAOC,KAAKF,GAAKG,SAAQ,SAAUC,IAC3BV,EAASW,QAAQD,KAAML,EAAIK,GAAOJ,EAAII,GAClD,GACA,CAEE,OAAO,SAASE,gBAKd,IAJA,IAAIC,EAAO,GAAGZ,MAAMC,KAAKC,WACrBW,EAAI,EACJT,EAAM,CAAE,EAELS,EAAID,EAAKE,OAAQD,IACtBV,aAAaC,EAAKQ,EAAKC,IAGzB,OAAOT,CACR;;;IAoBH,SAASW,eAAgBC,EAASC,EAAQC,GACxC,IACIC,EADSrB,QAAQ,OAAQ,UAAW,QAAS,cAAe,SACpDsB,CAAOH,GAAU,IAO7B,IAAK,IAAIR,KAJTY,KAAKL,QAAUA,GAAW,6BAC1BK,KAAKC,UAAW,EAGAH,EACdE,KAAKZ,GAAOU,EAAMV,GAKpB,GADAS,EAAMA,GAAOH,eACTQ,MAAMC,kBACRD,MAAMC,kBAAkBH,KAAMH,QAE9B,IACE,MAAM,IAAIK,KACX,CAAC,MAAME,GACNJ,KAAKK,MAAQD,EAAEC,KACrB,CAEA;;;eArCAC,EAAiBZ,eA2CjBA,eAAea,UAAYtB,OAAOuB,OAAON,MAAMK;;;;AAM/Cb,eAAea,UAAUE,KAAO;;;;AAMhCf,eAAea,UAAUG,YAAchB,eASvCA,eAAea,UAAUI,OAAS,SAAUN,GAC1C,IACIP,EADSrB,QAAQ,cAAe,SAAU,QAClCsB,CAAO,CAAEU,KAAMT,KAAKS,MAAQT,MAOxC,OAJI,IAAUK,GAASL,KAAKK,QAC1BP,EAAMO,MAAQL,KAAKK,OAGdP,CACR","x_google_ignoreList":[0]}

package/dist/browser/node_modules/.pnpm/chai@4.5.0/node_modules/chai/index.amd.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ define(["exports","../../../../../_virtual/index.amd"],(function(e,t){"use strict";const u=t.default.expect;t.default.version,t.default.Assertion,t.default.AssertionError;const s=t.default.util;t.default.config;const d=t.default.use;t.default.should;const l=t.default.assert;t.default.core,e.default=t.default,e.assert=l,e.expect=u,e.use=d,e.util=s,Object.defineProperty(e,"__esModule",{value:!0})}));
2	+ //# sourceMappingURL=index.amd.js.map

package/dist/browser/node_modules/.pnpm/chai@4.5.0/node_modules/chai/index.amd.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"index.amd.js","sources":["../../../../../../../../../node_modules/.pnpm/chai@4.5.0/node_modules/chai/index.mjs"],"sourcesContent":["import chai from './index.js';\n\nexport const expect = chai.expect;\nexport const version = chai.version;\nexport const Assertion = chai.Assertion;\nexport const AssertionError = chai.AssertionError;\nexport const util = chai.util;\nexport const config = chai.config;\nexport const use = chai.use;\nexport const should = chai.should;\nexport const assert = chai.assert;\nexport const core = chai.core;\n\nexport default chai;\n"],"names":["expect","chai","version","Assertion","AssertionError","util","config","use","should","assert","core"],"mappings":"mFAEa,MAAAA,EAASC,EAAAA,QAAKD,OACJC,EAAAA,QAAKC,QACHD,EAAAA,QAAKE,UACAF,EAAAA,QAAKG,eACtB,MAAAC,EAAOJ,EAAAA,QAAKI,KACHJ,EAAAA,QAAKK,OACd,MAAAC,EAAMN,EAAAA,QAAKM,IACFN,EAAAA,QAAKO,OACd,MAAAC,EAASR,EAAAA,QAAKQ,OACPR,EAAAA,QAAKS","x_google_ignoreList":[0]}

package/dist/browser/node_modules/.pnpm/chai@4.5.0/node_modules/chai/index.amd2.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ define(["exports","./lib/chai.amd"],(function(e,r){"use strict";var i,u;e.__require=function requireChai(){return u?i:(u=1,i=r.__require())}}));
2	+ //# sourceMappingURL=index.amd2.js.map

package/dist/browser/node_modules/.pnpm/chai@4.5.0/node_modules/chai/index.amd2.js.map ADDED Viewed

	@@ -0,0 +1 @@
1	+ {"version":3,"file":"index.amd2.js","sources":["../../../../../../../../../node_modules/.pnpm/chai@4.5.0/node_modules/chai/index.js"],"sourcesContent":["module.exports = require('./lib/chai');\n"],"names":["chai","require$$0"],"mappings":"2HAAAA,EAAiBC,EAAAA","x_google_ignoreList":[0]}

package/dist/browser/node_modules/.pnpm/chai@4.5.0/node_modules/chai/index.esm.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ import s from"../../../../../_virtual/index.esm.js";const o=s.expect;s.version,s.Assertion,s.AssertionError;const t=s.util;s.config;const e=s.use;s.should;const r=s.assert;s.core;export{r as assert,s as default,o as expect,e as use,t as util};
2	+ //# sourceMappingURL=index.esm.js.map

package/dist/browser/node_modules/.pnpm/chai@4.5.0/node_modules/chai/index.esm.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"index.esm.js","sources":["../../../../../../../../../node_modules/.pnpm/chai@4.5.0/node_modules/chai/index.mjs"],"sourcesContent":["import chai from './index.js';\n\nexport const expect = chai.expect;\nexport const version = chai.version;\nexport const Assertion = chai.Assertion;\nexport const AssertionError = chai.AssertionError;\nexport const util = chai.util;\nexport const config = chai.config;\nexport const use = chai.use;\nexport const should = chai.should;\nexport const assert = chai.assert;\nexport const core = chai.core;\n\nexport default chai;\n"],"names":["expect","chai","version","Assertion","AssertionError","util","config","use","should","assert","core"],"mappings":"oDAEY,MAACA,EAASC,EAAKD,OACJC,EAAKC,QACHD,EAAKE,UACAF,EAAKG,eACvB,MAACC,EAAOJ,EAAKI,KACHJ,EAAKK,OACf,MAACC,EAAMN,EAAKM,IACFN,EAAKO,OACf,MAACC,EAASR,EAAKQ,OACPR,EAAKS","x_google_ignoreList":[0]}

package/dist/browser/node_modules/.pnpm/chai@4.5.0/node_modules/chai/index.esm2.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ import{__require as r}from"./lib/chai.esm.js";var e,i;function requireChai(){return i?e:(i=1,e=r())}export{requireChai as __require};
2	+ //# sourceMappingURL=index.esm2.js.map

package/dist/browser/node_modules/.pnpm/chai@4.5.0/node_modules/chai/index.esm2.js.map ADDED Viewed

	@@ -0,0 +1 @@
1	+ {"version":3,"file":"index.esm2.js","sources":["../../../../../../../../../node_modules/.pnpm/chai@4.5.0/node_modules/chai/index.js"],"sourcesContent":["module.exports = require('./lib/chai');\n"],"names":["chai","require$$0"],"mappings":"6FAAAA,EAAiBC","x_google_ignoreList":[0]}

package/dist/browser/node_modules/.pnpm/chai@4.5.0/node_modules/chai/lib/chai/assertion.amd.js ADDED Viewed

@@ -0,0 +1,63 @@
+define(["exports","./config.amd"],(function(e,t){"use strict";
+/*!
+   * chai
+   * http://chaijs.com
+   * Copyright(c) 2011-2014 Jake Luer <jake@alogicalparadox.com>
+   * MIT Licensed
+   */var i,o;e.__require=function requireAssertion(){if(o)return i;o=1;var e=t.__require();return i=function(t,i){
+/*!
+  	   * Module dependencies.
+  	   */
+var o=t.AssertionError,s=i.flag;
+/*!
+  	   * Module export.
+  	   */
+/*!
+  	   * Assertion Constructor
+  	   *
+  	   * Creates object for chaining.
+  	   *
+  	   * `Assertion` objects contain metadata in the form of flags. Three flags can
+  	   * be assigned during instantiation by passing arguments to this constructor:
+  	   *
+  	   * - `object`: This flag contains the target of the assertion. For example, in
+  	   *   the assertion `expect(numKittens).to.equal(7);`, the `object` flag will
+  	   *   contain `numKittens` so that the `equal` assertion can reference it when
+  	   *   needed.
+  	   *
+  	   * - `message`: This flag contains an optional custom error message to be
+  	   *   prepended to the error message that's generated by the assertion when it
+  	   *   fails.
+  	   *
+  	   * - `ssfi`: This flag stands for "start stack function indicator". It
+  	   *   contains a function reference that serves as the starting point for
+  	   *   removing frames from the stack trace of the error that's created by the
+  	   *   assertion when it fails. The goal is to provide a cleaner stack trace to
+  	   *   end users by removing Chai's internal functions. Note that it only works
+  	   *   in environments that support `Error.captureStackTrace`, and only when
+  	   *   `Chai.config.includeStack` hasn't been set to `false`.
+  	   *
+  	   * - `lockSsfi`: This flag controls whether or not the given `ssfi` flag
+  	   *   should retain its current value, even as assertions are chained off of
+  	   *   this object. This is usually set to `true` when creating a new assertion
+  	   *   from within another assertion. It's also temporarily set to `true` before
+  	   *   an overwritten assertion gets called by the overwriting assertion.
+  	   *
+  	   * - `eql`: This flag contains the deepEqual function to be used by the assertion.
+  	   *
+  	   * @param {Mixed} obj target of the assertion
+  	   * @param {String} msg (optional) custom error message
+  	   * @param {Function} ssfi (optional) starting point for removing stack frames
+  	   * @param {Boolean} lockSsfi (optional) whether or not the ssfi flag is locked
+  	   * @api private
+  	   */
+function Assertion(t,o,r,n){return s(this,"ssfi",r||Assertion),s(this,"lockSsfi",n),s(this,"object",t),s(this,"message",o),s(this,"eql",e.deepEqual||i.eql),i.proxify(this)}t.Assertion=Assertion,Object.defineProperty(Assertion,"includeStack",{get:function(){return console.warn("Assertion.includeStack is deprecated, use chai.config.includeStack instead."),e.includeStack},set:function(t){console.warn("Assertion.includeStack is deprecated, use chai.config.includeStack instead."),e.includeStack=t}}),Object.defineProperty(Assertion,"showDiff",{get:function(){return console.warn("Assertion.showDiff is deprecated, use chai.config.showDiff instead."),e.showDiff},set:function(t){console.warn("Assertion.showDiff is deprecated, use chai.config.showDiff instead."),e.showDiff=t}}),Assertion.addProperty=function(e,t){i.addProperty(this.prototype,e,t)},Assertion.addMethod=function(e,t){i.addMethod(this.prototype,e,t)},Assertion.addChainableMethod=function(e,t,o){i.addChainableMethod(this.prototype,e,t,o)},Assertion.overwriteProperty=function(e,t){i.overwriteProperty(this.prototype,e,t)},Assertion.overwriteMethod=function(e,t){i.overwriteMethod(this.prototype,e,t)},Assertion.overwriteChainableMethod=function(e,t,o){i.overwriteChainableMethod(this.prototype,e,t,o)},Assertion.prototype.assert=function(t,r,n,c,a,f){var d=i.test(this,arguments);if(!1!==f&&(f=!0),void 0===c&&void 0===a&&(f=!1),!0!==e.showDiff&&(f=!1),!d){r=i.getMessage(this,arguments);var h={actual:i.getActual(this,arguments),expected:c,showDiff:f},u=i.getOperator(this,arguments);throw u&&(h.operator=u),new o(r,h,e.includeStack?this.assert:s(this,"ssfi"))}},
+/*!
+  	   * ### ._obj
+  	   *
+  	   * Quick reference to stored `actual` value for plugin developers.
+  	   *
+  	   * @api private
+  	   */
+Object.defineProperty(Assertion.prototype,"_obj",{get:function(){return s(this,"object")},set:function(e){s(this,"object",e)}})},i}}));
+//# sourceMappingURL=assertion.amd.js.map

package/dist/browser/node_modules/.pnpm/chai@4.5.0/node_modules/chai/lib/chai/assertion.amd.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"assertion.amd.js","sources":["../../../../../../../../../../../node_modules/.pnpm/chai@4.5.0/node_modules/chai/lib/chai/assertion.js"],"sourcesContent":["/*!\n * chai\n * http://chaijs.com\n * Copyright(c) 2011-2014 Jake Luer <jake@alogicalparadox.com>\n * MIT Licensed\n */\n\nvar config = require('./config');\n\nmodule.exports = function (_chai, util) {\n /*!\n * Module dependencies.\n */\n\n var AssertionError = _chai.AssertionError\n , flag = util.flag;\n\n /*!\n * Module export.\n */\n\n _chai.Assertion = Assertion;\n\n /*!\n * Assertion Constructor\n *\n * Creates object for chaining.\n *\n * `Assertion` objects contain metadata in the form of flags. Three flags can\n * be assigned during instantiation by passing arguments to this constructor:\n *\n * - `object`: This flag contains the target of the assertion. For example, in\n * the assertion `expect(numKittens).to.equal(7);`, the `object` flag will\n * contain `numKittens` so that the `equal` assertion can reference it when\n * needed.\n *\n * - `message`: This flag contains an optional custom error message to be\n * prepended to the error message that's generated by the assertion when it\n * fails.\n *\n * - `ssfi`: This flag stands for \"start stack function indicator\". It\n * contains a function reference that serves as the starting point for\n * removing frames from the stack trace of the error that's created by the\n * assertion when it fails. The goal is to provide a cleaner stack trace to\n * end users by removing Chai's internal functions. Note that it only works\n * in environments that support `Error.captureStackTrace`, and only when\n * `Chai.config.includeStack` hasn't been set to `false`.\n *\n * - `lockSsfi`: This flag controls whether or not the given `ssfi` flag\n * should retain its current value, even as assertions are chained off of\n * this object. This is usually set to `true` when creating a new assertion\n * from within another assertion. It's also temporarily set to `true` before\n * an overwritten assertion gets called by the overwriting assertion.\n *\n * - `eql`: This flag contains the deepEqual function to be used by the assertion.\n *\n * @param {Mixed} obj target of the assertion\n * @param {String} msg (optional) custom error message\n * @param {Function} ssfi (optional) starting point for removing stack frames\n * @param {Boolean} lockSsfi (optional) whether or not the ssfi flag is locked\n * @api private\n */\n\n function Assertion (obj, msg, ssfi, lockSsfi) {\n flag(this, 'ssfi', ssfi || Assertion);\n flag(this, 'lockSsfi', lockSsfi);\n flag(this, 'object', obj);\n flag(this, 'message', msg);\n flag(this, 'eql', config.deepEqual || util.eql);\n\n return util.proxify(this);\n }\n\n Object.defineProperty(Assertion, 'includeStack', {\n get: function() {\n console.warn('Assertion.includeStack is deprecated, use chai.config.includeStack instead.');\n return config.includeStack;\n },\n set: function(value) {\n console.warn('Assertion.includeStack is deprecated, use chai.config.includeStack instead.');\n config.includeStack = value;\n }\n });\n\n Object.defineProperty(Assertion, 'showDiff', {\n get: function() {\n console.warn('Assertion.showDiff is deprecated, use chai.config.showDiff instead.');\n return config.showDiff;\n },\n set: function(value) {\n console.warn('Assertion.showDiff is deprecated, use chai.config.showDiff instead.');\n config.showDiff = value;\n }\n });\n\n Assertion.addProperty = function (name, fn) {\n util.addProperty(this.prototype, name, fn);\n };\n\n Assertion.addMethod = function (name, fn) {\n util.addMethod(this.prototype, name, fn);\n };\n\n Assertion.addChainableMethod = function (name, fn, chainingBehavior) {\n util.addChainableMethod(this.prototype, name, fn, chainingBehavior);\n };\n\n Assertion.overwriteProperty = function (name, fn) {\n util.overwriteProperty(this.prototype, name, fn);\n };\n\n Assertion.overwriteMethod = function (name, fn) {\n util.overwriteMethod(this.prototype, name, fn);\n };\n\n Assertion.overwriteChainableMethod = function (name, fn, chainingBehavior) {\n util.overwriteChainableMethod(this.prototype, name, fn, chainingBehavior);\n };\n\n /**\n * ### .assert(expression, message, negateMessage, expected, actual, showDiff)\n *\n * Executes an expression and check expectations. Throws AssertionError for reporting if test doesn't pass.\n *\n * @name assert\n * @param {Philosophical} expression to be tested\n * @param {String|Function} message or function that returns message to display if expression fails\n * @param {String|Function} negatedMessage or function that returns negatedMessage to display if negated expression fails\n * @param {Mixed} expected value (remember to check for negation)\n * @param {Mixed} actual (optional) will default to `this.obj`\n * @param {Boolean} showDiff (optional) when set to `true`, assert will display a diff in addition to the message if expression fails\n * @api private\n */\n\n Assertion.prototype.assert = function (expr, msg, negateMsg, expected, _actual, showDiff) {\n var ok = util.test(this, arguments);\n if (false !== showDiff) showDiff = true;\n if (undefined === expected && undefined === _actual) showDiff = false;\n if (true !== config.showDiff) showDiff = false;\n\n if (!ok) {\n msg = util.getMessage(this, arguments);\n var actual = util.getActual(this, arguments);\n var assertionErrorObjectProperties = {\n actual: actual\n , expected: expected\n , showDiff: showDiff\n };\n\n var operator = util.getOperator(this, arguments);\n if (operator) {\n assertionErrorObjectProperties.operator = operator;\n }\n\n throw new AssertionError(\n msg,\n assertionErrorObjectProperties,\n (config.includeStack) ? this.assert : flag(this, 'ssfi'));\n }\n };\n\n /*!\n * ### ._obj\n *\n * Quick reference to stored `actual` value for plugin developers.\n *\n * @api private\n */\n\n Object.defineProperty(Assertion.prototype, '_obj',\n { get: function () {\n return flag(this, 'object');\n }\n , set: function (val) {\n flag(this, 'object', val);\n }\n });\n};\n"],"names":["config","require$$0","assertion","_chai","util","AssertionError","flag","Assertion","obj","msg","ssfi","lockSsfi","this","deepEqual","eql","proxify","Object","defineProperty","get","console","warn","includeStack","set","value","showDiff","addProperty","name","fn","prototype","addMethod","addChainableMethod","chainingBehavior","overwriteProperty","overwriteMethod","overwriteChainableMethod","assert","expr","negateMsg","expected","_actual","ok","test","arguments","undefined","getMessage","assertionErrorObjectProperties","actual","getActual","operator","getOperator","val"],"mappings":";;;;;;uEAOA,IAAIA,EAASC,EAAAA,mBAEbC,EAAiB,SAAUC,EAAOC;;;;AAKhC,IAAIC,EAAiBF,EAAME,eACvBC,EAAOF,EAAKE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgDhB,SAASC,UAAWC,EAAKC,EAAKC,EAAMC,GAOlC,OANAL,EAAKM,KAAM,OAAQF,GAAQH,WAC3BD,EAAKM,KAAM,WAAYD,GACvBL,EAAKM,KAAM,SAAUJ,GACrBF,EAAKM,KAAM,UAAWH,GACtBH,EAAKM,KAAM,MAAOZ,EAAOa,WAAaT,EAAKU,KAEpCV,EAAKW,QAAQH,KACxB,CAlDET,EAAMI,UAAYA,UAoDlBS,OAAOC,eAAeV,UAAW,eAAgB,CAC/CW,IAAK,WAEH,OADAC,QAAQC,KAAK,+EACNpB,EAAOqB,YACf,EACDC,IAAK,SAASC,GACZJ,QAAQC,KAAK,+EACbpB,EAAOqB,aAAeE,CAC5B,IAGEP,OAAOC,eAAeV,UAAW,WAAY,CAC3CW,IAAK,WAEH,OADAC,QAAQC,KAAK,uEACNpB,EAAOwB,QACf,EACDF,IAAK,SAASC,GACZJ,QAAQC,KAAK,uEACbpB,EAAOwB,SAAWD,CACxB,IAGEhB,UAAUkB,YAAc,SAAUC,EAAMC,GACtCvB,EAAKqB,YAAYb,KAAKgB,UAAWF,EAAMC,EACxC,EAEDpB,UAAUsB,UAAY,SAAUH,EAAMC,GACpCvB,EAAKyB,UAAUjB,KAAKgB,UAAWF,EAAMC,EACtC,EAEDpB,UAAUuB,mBAAqB,SAAUJ,EAAMC,EAAII,GACjD3B,EAAK0B,mBAAmBlB,KAAKgB,UAAWF,EAAMC,EAAII,EACnD,EAEDxB,UAAUyB,kBAAoB,SAAUN,EAAMC,GAC5CvB,EAAK4B,kBAAkBpB,KAAKgB,UAAWF,EAAMC,EAC9C,EAEDpB,UAAU0B,gBAAkB,SAAUP,EAAMC,GAC1CvB,EAAK6B,gBAAgBrB,KAAKgB,UAAWF,EAAMC,EAC5C,EAEDpB,UAAU2B,yBAA2B,SAAUR,EAAMC,EAAII,GACvD3B,EAAK8B,yBAAyBtB,KAAKgB,UAAWF,EAAMC,EAAII,EACzD,EAiBDxB,UAAUqB,UAAUO,OAAS,SAAUC,EAAM3B,EAAK4B,EAAWC,EAAUC,EAASf,GAC9E,IAAIgB,EAAKpC,EAAKqC,KAAK7B,KAAM8B,WAKzB,IAJI,IAAUlB,IAAUA,GAAW,QAC/BmB,IAAcL,QAAYK,IAAcJ,IAASf,GAAW,IAC5D,IAASxB,EAAOwB,WAAUA,GAAW,IAEpCgB,EAAI,CACP/B,EAAML,EAAKwC,WAAWhC,KAAM8B,WAC5B,IACIG,EAAiC,CACjCC,OAFS1C,EAAK2C,UAAUnC,KAAM8B,WAG9BJ,SAAUA,EACVd,SAAUA,GAGVwB,EAAW5C,EAAK6C,YAAYrC,KAAM8B,WAKtC,MAJIM,IACFH,EAA+BG,SAAWA,GAGtC,IAAI3C,EACRI,EACAoC,EACC7C,EAAmB,aAAIY,KAAKuB,OAAS7B,EAAKM,KAAM,QACzD,CACG;;;;;;;;AAUDI,OAAOC,eAAeV,UAAUqB,UAAW,OACzC,CAAEV,IAAK,WACH,OAAOZ,EAAKM,KAAM,SAC1B,EACMU,IAAK,SAAU4B,GACb5C,EAAKM,KAAM,SAAUsC,EAC7B,GAEC","x_google_ignoreList":[0]}

package/dist/browser/node_modules/.pnpm/chai@4.5.0/node_modules/chai/lib/chai/assertion.esm.js ADDED Viewed

@@ -0,0 +1,63 @@
+import{__require as e}from"./config.esm.js";
+/*!
+ * chai
+ * http://chaijs.com
+ * Copyright(c) 2011-2014 Jake Luer <jake@alogicalparadox.com>
+ * MIT Licensed
+ */var t,i;function requireAssertion(){if(i)return t;i=1;var o=e();return t=function(e,t){
+/*!
+	   * Module dependencies.
+	   */
+var i=e.AssertionError,s=t.flag;
+/*!
+	   * Module export.
+	   */
+/*!
+	   * Assertion Constructor
+	   *
+	   * Creates object for chaining.
+	   *
+	   * `Assertion` objects contain metadata in the form of flags. Three flags can
+	   * be assigned during instantiation by passing arguments to this constructor:
+	   *
+	   * - `object`: This flag contains the target of the assertion. For example, in
+	   *   the assertion `expect(numKittens).to.equal(7);`, the `object` flag will
+	   *   contain `numKittens` so that the `equal` assertion can reference it when
+	   *   needed.
+	   *
+	   * - `message`: This flag contains an optional custom error message to be
+	   *   prepended to the error message that's generated by the assertion when it
+	   *   fails.
+	   *
+	   * - `ssfi`: This flag stands for "start stack function indicator". It
+	   *   contains a function reference that serves as the starting point for
+	   *   removing frames from the stack trace of the error that's created by the
+	   *   assertion when it fails. The goal is to provide a cleaner stack trace to
+	   *   end users by removing Chai's internal functions. Note that it only works
+	   *   in environments that support `Error.captureStackTrace`, and only when
+	   *   `Chai.config.includeStack` hasn't been set to `false`.
+	   *
+	   * - `lockSsfi`: This flag controls whether or not the given `ssfi` flag
+	   *   should retain its current value, even as assertions are chained off of
+	   *   this object. This is usually set to `true` when creating a new assertion
+	   *   from within another assertion. It's also temporarily set to `true` before
+	   *   an overwritten assertion gets called by the overwriting assertion.
+	   *
+	   * - `eql`: This flag contains the deepEqual function to be used by the assertion.
+	   *
+	   * @param {Mixed} obj target of the assertion
+	   * @param {String} msg (optional) custom error message
+	   * @param {Function} ssfi (optional) starting point for removing stack frames
+	   * @param {Boolean} lockSsfi (optional) whether or not the ssfi flag is locked
+	   * @api private
+	   */
+function Assertion(e,i,r,n){return s(this,"ssfi",r||Assertion),s(this,"lockSsfi",n),s(this,"object",e),s(this,"message",i),s(this,"eql",o.deepEqual||t.eql),t.proxify(this)}e.Assertion=Assertion,Object.defineProperty(Assertion,"includeStack",{get:function(){return console.warn("Assertion.includeStack is deprecated, use chai.config.includeStack instead."),o.includeStack},set:function(e){console.warn("Assertion.includeStack is deprecated, use chai.config.includeStack instead."),o.includeStack=e}}),Object.defineProperty(Assertion,"showDiff",{get:function(){return console.warn("Assertion.showDiff is deprecated, use chai.config.showDiff instead."),o.showDiff},set:function(e){console.warn("Assertion.showDiff is deprecated, use chai.config.showDiff instead."),o.showDiff=e}}),Assertion.addProperty=function(e,i){t.addProperty(this.prototype,e,i)},Assertion.addMethod=function(e,i){t.addMethod(this.prototype,e,i)},Assertion.addChainableMethod=function(e,i,o){t.addChainableMethod(this.prototype,e,i,o)},Assertion.overwriteProperty=function(e,i){t.overwriteProperty(this.prototype,e,i)},Assertion.overwriteMethod=function(e,i){t.overwriteMethod(this.prototype,e,i)},Assertion.overwriteChainableMethod=function(e,i,o){t.overwriteChainableMethod(this.prototype,e,i,o)},Assertion.prototype.assert=function(e,r,n,c,a,f){var d=t.test(this,arguments);if(!1!==f&&(f=!0),void 0===c&&void 0===a&&(f=!1),!0!==o.showDiff&&(f=!1),!d){r=t.getMessage(this,arguments);var h={actual:t.getActual(this,arguments),expected:c,showDiff:f},u=t.getOperator(this,arguments);throw u&&(h.operator=u),new i(r,h,o.includeStack?this.assert:s(this,"ssfi"))}},
+/*!
+	   * ### ._obj
+	   *
+	   * Quick reference to stored `actual` value for plugin developers.
+	   *
+	   * @api private
+	   */
+Object.defineProperty(Assertion.prototype,"_obj",{get:function(){return s(this,"object")},set:function(e){s(this,"object",e)}})},t}export{requireAssertion as __require};
+//# sourceMappingURL=assertion.esm.js.map

package/dist/browser/node_modules/.pnpm/chai@4.5.0/node_modules/chai/lib/chai/assertion.esm.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"assertion.esm.js","sources":["../../../../../../../../../../../node_modules/.pnpm/chai@4.5.0/node_modules/chai/lib/chai/assertion.js"],"sourcesContent":["/*!\n * chai\n * http://chaijs.com\n * Copyright(c) 2011-2014 Jake Luer <jake@alogicalparadox.com>\n * MIT Licensed\n */\n\nvar config = require('./config');\n\nmodule.exports = function (_chai, util) {\n /*!\n * Module dependencies.\n */\n\n var AssertionError = _chai.AssertionError\n , flag = util.flag;\n\n /*!\n * Module export.\n */\n\n _chai.Assertion = Assertion;\n\n /*!\n * Assertion Constructor\n *\n * Creates object for chaining.\n *\n * `Assertion` objects contain metadata in the form of flags. Three flags can\n * be assigned during instantiation by passing arguments to this constructor:\n *\n * - `object`: This flag contains the target of the assertion. For example, in\n * the assertion `expect(numKittens).to.equal(7);`, the `object` flag will\n * contain `numKittens` so that the `equal` assertion can reference it when\n * needed.\n *\n * - `message`: This flag contains an optional custom error message to be\n * prepended to the error message that's generated by the assertion when it\n * fails.\n *\n * - `ssfi`: This flag stands for \"start stack function indicator\". It\n * contains a function reference that serves as the starting point for\n * removing frames from the stack trace of the error that's created by the\n * assertion when it fails. The goal is to provide a cleaner stack trace to\n * end users by removing Chai's internal functions. Note that it only works\n * in environments that support `Error.captureStackTrace`, and only when\n * `Chai.config.includeStack` hasn't been set to `false`.\n *\n * - `lockSsfi`: This flag controls whether or not the given `ssfi` flag\n * should retain its current value, even as assertions are chained off of\n * this object. This is usually set to `true` when creating a new assertion\n * from within another assertion. It's also temporarily set to `true` before\n * an overwritten assertion gets called by the overwriting assertion.\n *\n * - `eql`: This flag contains the deepEqual function to be used by the assertion.\n *\n * @param {Mixed} obj target of the assertion\n * @param {String} msg (optional) custom error message\n * @param {Function} ssfi (optional) starting point for removing stack frames\n * @param {Boolean} lockSsfi (optional) whether or not the ssfi flag is locked\n * @api private\n */\n\n function Assertion (obj, msg, ssfi, lockSsfi) {\n flag(this, 'ssfi', ssfi || Assertion);\n flag(this, 'lockSsfi', lockSsfi);\n flag(this, 'object', obj);\n flag(this, 'message', msg);\n flag(this, 'eql', config.deepEqual || util.eql);\n\n return util.proxify(this);\n }\n\n Object.defineProperty(Assertion, 'includeStack', {\n get: function() {\n console.warn('Assertion.includeStack is deprecated, use chai.config.includeStack instead.');\n return config.includeStack;\n },\n set: function(value) {\n console.warn('Assertion.includeStack is deprecated, use chai.config.includeStack instead.');\n config.includeStack = value;\n }\n });\n\n Object.defineProperty(Assertion, 'showDiff', {\n get: function() {\n console.warn('Assertion.showDiff is deprecated, use chai.config.showDiff instead.');\n return config.showDiff;\n },\n set: function(value) {\n console.warn('Assertion.showDiff is deprecated, use chai.config.showDiff instead.');\n config.showDiff = value;\n }\n });\n\n Assertion.addProperty = function (name, fn) {\n util.addProperty(this.prototype, name, fn);\n };\n\n Assertion.addMethod = function (name, fn) {\n util.addMethod(this.prototype, name, fn);\n };\n\n Assertion.addChainableMethod = function (name, fn, chainingBehavior) {\n util.addChainableMethod(this.prototype, name, fn, chainingBehavior);\n };\n\n Assertion.overwriteProperty = function (name, fn) {\n util.overwriteProperty(this.prototype, name, fn);\n };\n\n Assertion.overwriteMethod = function (name, fn) {\n util.overwriteMethod(this.prototype, name, fn);\n };\n\n Assertion.overwriteChainableMethod = function (name, fn, chainingBehavior) {\n util.overwriteChainableMethod(this.prototype, name, fn, chainingBehavior);\n };\n\n /**\n * ### .assert(expression, message, negateMessage, expected, actual, showDiff)\n *\n * Executes an expression and check expectations. Throws AssertionError for reporting if test doesn't pass.\n *\n * @name assert\n * @param {Philosophical} expression to be tested\n * @param {String|Function} message or function that returns message to display if expression fails\n * @param {String|Function} negatedMessage or function that returns negatedMessage to display if negated expression fails\n * @param {Mixed} expected value (remember to check for negation)\n * @param {Mixed} actual (optional) will default to `this.obj`\n * @param {Boolean} showDiff (optional) when set to `true`, assert will display a diff in addition to the message if expression fails\n * @api private\n */\n\n Assertion.prototype.assert = function (expr, msg, negateMsg, expected, _actual, showDiff) {\n var ok = util.test(this, arguments);\n if (false !== showDiff) showDiff = true;\n if (undefined === expected && undefined === _actual) showDiff = false;\n if (true !== config.showDiff) showDiff = false;\n\n if (!ok) {\n msg = util.getMessage(this, arguments);\n var actual = util.getActual(this, arguments);\n var assertionErrorObjectProperties = {\n actual: actual\n , expected: expected\n , showDiff: showDiff\n };\n\n var operator = util.getOperator(this, arguments);\n if (operator) {\n assertionErrorObjectProperties.operator = operator;\n }\n\n throw new AssertionError(\n msg,\n assertionErrorObjectProperties,\n (config.includeStack) ? this.assert : flag(this, 'ssfi'));\n }\n };\n\n /*!\n * ### ._obj\n *\n * Quick reference to stored `actual` value for plugin developers.\n *\n * @api private\n */\n\n Object.defineProperty(Assertion.prototype, '_obj',\n { get: function () {\n return flag(this, 'object');\n }\n , set: function (val) {\n flag(this, 'object', val);\n }\n });\n};\n"],"names":["config","require$$0","assertion","_chai","util","AssertionError","flag","Assertion","obj","msg","ssfi","lockSsfi","this","deepEqual","eql","proxify","Object","defineProperty","get","console","warn","includeStack","set","value","showDiff","addProperty","name","fn","prototype","addMethod","addChainableMethod","chainingBehavior","overwriteProperty","overwriteMethod","overwriteChainableMethod","assert","expr","negateMsg","expected","_actual","ok","test","arguments","undefined","getMessage","assertionErrorObjectProperties","actual","getActual","operator","getOperator","val"],"mappings":";;;;;;yDAOA,IAAIA,EAASC,WAEbC,EAAiB,SAAUC,EAAOC;;;;AAKhC,IAAIC,EAAiBF,EAAME,eACvBC,EAAOF,EAAKE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgDhB,SAASC,UAAWC,EAAKC,EAAKC,EAAMC,GAOlC,OANAL,EAAKM,KAAM,OAAQF,GAAQH,WAC3BD,EAAKM,KAAM,WAAYD,GACvBL,EAAKM,KAAM,SAAUJ,GACrBF,EAAKM,KAAM,UAAWH,GACtBH,EAAKM,KAAM,MAAOZ,EAAOa,WAAaT,EAAKU,KAEpCV,EAAKW,QAAQH,KACxB,CAlDET,EAAMI,UAAYA,UAoDlBS,OAAOC,eAAeV,UAAW,eAAgB,CAC/CW,IAAK,WAEH,OADAC,QAAQC,KAAK,+EACNpB,EAAOqB,YACf,EACDC,IAAK,SAASC,GACZJ,QAAQC,KAAK,+EACbpB,EAAOqB,aAAeE,CAC5B,IAGEP,OAAOC,eAAeV,UAAW,WAAY,CAC3CW,IAAK,WAEH,OADAC,QAAQC,KAAK,uEACNpB,EAAOwB,QACf,EACDF,IAAK,SAASC,GACZJ,QAAQC,KAAK,uEACbpB,EAAOwB,SAAWD,CACxB,IAGEhB,UAAUkB,YAAc,SAAUC,EAAMC,GACtCvB,EAAKqB,YAAYb,KAAKgB,UAAWF,EAAMC,EACxC,EAEDpB,UAAUsB,UAAY,SAAUH,EAAMC,GACpCvB,EAAKyB,UAAUjB,KAAKgB,UAAWF,EAAMC,EACtC,EAEDpB,UAAUuB,mBAAqB,SAAUJ,EAAMC,EAAII,GACjD3B,EAAK0B,mBAAmBlB,KAAKgB,UAAWF,EAAMC,EAAII,EACnD,EAEDxB,UAAUyB,kBAAoB,SAAUN,EAAMC,GAC5CvB,EAAK4B,kBAAkBpB,KAAKgB,UAAWF,EAAMC,EAC9C,EAEDpB,UAAU0B,gBAAkB,SAAUP,EAAMC,GAC1CvB,EAAK6B,gBAAgBrB,KAAKgB,UAAWF,EAAMC,EAC5C,EAEDpB,UAAU2B,yBAA2B,SAAUR,EAAMC,EAAII,GACvD3B,EAAK8B,yBAAyBtB,KAAKgB,UAAWF,EAAMC,EAAII,EACzD,EAiBDxB,UAAUqB,UAAUO,OAAS,SAAUC,EAAM3B,EAAK4B,EAAWC,EAAUC,EAASf,GAC9E,IAAIgB,EAAKpC,EAAKqC,KAAK7B,KAAM8B,WAKzB,IAJI,IAAUlB,IAAUA,GAAW,QAC/BmB,IAAcL,QAAYK,IAAcJ,IAASf,GAAW,IAC5D,IAASxB,EAAOwB,WAAUA,GAAW,IAEpCgB,EAAI,CACP/B,EAAML,EAAKwC,WAAWhC,KAAM8B,WAC5B,IACIG,EAAiC,CACjCC,OAFS1C,EAAK2C,UAAUnC,KAAM8B,WAG9BJ,SAAUA,EACVd,SAAUA,GAGVwB,EAAW5C,EAAK6C,YAAYrC,KAAM8B,WAKtC,MAJIM,IACFH,EAA+BG,SAAWA,GAGtC,IAAI3C,EACRI,EACAoC,EACC7C,EAAmB,aAAIY,KAAKuB,OAAS7B,EAAKM,KAAM,QACzD,CACG;;;;;;;;AAUDI,OAAOC,eAAeV,UAAUqB,UAAW,OACzC,CAAEV,IAAK,WACH,OAAOZ,EAAKM,KAAM,SAC1B,EACMU,IAAK,SAAU4B,GACb5C,EAAKM,KAAM,SAAUsC,EAC7B,GAEC","x_google_ignoreList":[0]}

package/dist/browser/node_modules/.pnpm/chai@4.5.0/node_modules/chai/lib/chai/config.amd.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ define(["exports"],(function(e){"use strict";var r,t;e.__require=function requireConfig(){return t?r:(t=1,r={includeStack:!1,showDiff:!0,truncateThreshold:40,useProxy:!0,proxyExcludedKeys:["then","catch","inspect","toJSON"],deepEqual:null})}}));
2	+ //# sourceMappingURL=config.amd.js.map