@tianyio/quality-helper
Version:
A comprehensive quality helper tool for project scaffolding and management
1 lines • 1.04 MB
Source Map (JSON)
{"version":3,"file":"core-file-merger-CzI_IKXm.cjs","sources":["../../../node_modules/.pnpm/@jridgewell+sourcemap-codec@1.5.5/node_modules/@jridgewell/sourcemap-codec/dist/sourcemap-codec.umd.js","../../../node_modules/.pnpm/@jridgewell+resolve-uri@3.1.2/node_modules/@jridgewell/resolve-uri/dist/resolve-uri.umd.js","../../../node_modules/.pnpm/@jridgewell+trace-mapping@0.3.30/node_modules/@jridgewell/trace-mapping/dist/trace-mapping.umd.js","../../../node_modules/.pnpm/@jridgewell+gen-mapping@0.3.13/node_modules/@jridgewell/gen-mapping/dist/gen-mapping.umd.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/source-map.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/buffer.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/utils/shallowEqual.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/utils/deprecationWarning.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/generated/index.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/matchesPattern.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/buildMatchMemberExpression.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/react/isReactComponent.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/react/isCompatTag.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/isType.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/isPlaceholderType.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/is.js","../../../node_modules/.pnpm/@babel+helper-validator-identifier@7.27.1/node_modules/@babel/helper-validator-identifier/lib/identifier.js","../../../node_modules/.pnpm/@babel+helper-validator-identifier@7.27.1/node_modules/@babel/helper-validator-identifier/lib/keyword.js","../../../node_modules/.pnpm/@babel+helper-validator-identifier@7.27.1/node_modules/@babel/helper-validator-identifier/lib/index.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/isValidIdentifier.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/constants/index.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/definitions/utils.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/definitions/placeholders.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/definitions/deprecated-aliases.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/definitions/index.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/validate.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/builders/generated/lowercase.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/builders/generated/uppercase.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/builders/generated/index.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/utils/react/cleanJSXElementLiteralChild.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/builders/react/buildChildren.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/isNode.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/asserts/assertNode.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/asserts/generated/index.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/builders/flow/createTypeAnnotationBasedOnTypeof.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/modifications/flow/removeTypeDuplicates.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/builders/flow/createFlowUnionType.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/modifications/typescript/removeTypeDuplicates.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/builders/typescript/createTSUnionType.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/builders/productions.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/clone/cloneNode.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/clone/clone.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/clone/cloneDeep.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/clone/cloneDeepWithoutLoc.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/clone/cloneWithoutLoc.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/comments/addComments.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/comments/addComment.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/utils/inherit.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/comments/inheritInnerComments.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/comments/inheritLeadingComments.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/comments/inheritTrailingComments.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/comments/inheritsComments.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/comments/removeComments.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/constants/generated/index.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/converters/toBlock.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/converters/ensureBlock.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/converters/toIdentifier.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/converters/toBindingIdentifierName.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/converters/toComputedKey.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/converters/toExpression.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/traverse/traverseFast.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/modifications/removeProperties.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/modifications/removePropertiesDeep.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/converters/toKeyAlias.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/converters/toStatement.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/converters/valueToNode.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/modifications/appendToMemberExpression.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/modifications/inherits.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/modifications/prependToMemberExpression.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/retrievers/getAssignmentIdentifiers.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/retrievers/getBindingIdentifiers.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/retrievers/getOuterBindingIdentifiers.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/retrievers/getFunctionName.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/traverse/traverse.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/isBinding.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/isLet.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/isBlockScoped.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/isImmutable.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/isNodesEquivalent.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/isReferenced.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/isScope.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/isSpecifierDefault.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/isValidES3Identifier.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/validators/isVar.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/converters/gatherSequenceExpressions.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/converters/toSequenceExpression.js","../../../node_modules/.pnpm/@babel+types@7.28.4/node_modules/@babel/types/lib/index.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/node/whitespace.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/node/parentheses.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/node/index.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/token-map.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/generators/template-literals.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/generators/expressions.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/generators/statements.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/generators/classes.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/generators/methods.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/generators/modules.js","../../../node_modules/.pnpm/jsesc@3.1.0/node_modules/jsesc/jsesc.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/generators/types.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/generators/flow.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/generators/base.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/generators/jsx.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/generators/typescript.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/generators/index.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/generators/deprecated.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/printer.js","../../../node_modules/.pnpm/@babel+generator@7.28.3/node_modules/@babel/generator/lib/index.js","../src/core/FileMerger.ts"],"sourcesContent":["(function (global, factory) {\n if (typeof exports === 'object' && typeof module !== 'undefined') {\n factory(module);\n module.exports = def(module);\n } else if (typeof define === 'function' && define.amd) {\n define(['module'], function(mod) {\n factory.apply(this, arguments);\n mod.exports = def(mod);\n });\n } else {\n const mod = { exports: {} };\n factory(mod);\n global = typeof globalThis !== 'undefined' ? globalThis : global || self;\n global.sourcemapCodec = def(mod);\n }\n function def(m) { return 'default' in m.exports ? m.exports.default : m.exports; }\n})(this, (function (module) {\n\"use strict\";\nvar __defProp = Object.defineProperty;\nvar __getOwnPropDesc = Object.getOwnPropertyDescriptor;\nvar __getOwnPropNames = Object.getOwnPropertyNames;\nvar __hasOwnProp = Object.prototype.hasOwnProperty;\nvar __export = (target, all) => {\n for (var name in all)\n __defProp(target, name, { get: all[name], enumerable: true });\n};\nvar __copyProps = (to, from, except, desc) => {\n if (from && typeof from === \"object\" || typeof from === \"function\") {\n for (let key of __getOwnPropNames(from))\n if (!__hasOwnProp.call(to, key) && key !== except)\n __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });\n }\n return to;\n};\nvar __toCommonJS = (mod) => __copyProps(__defProp({}, \"__esModule\", { value: true }), mod);\n\n// src/sourcemap-codec.ts\nvar sourcemap_codec_exports = {};\n__export(sourcemap_codec_exports, {\n decode: () => decode,\n decodeGeneratedRanges: () => decodeGeneratedRanges,\n decodeOriginalScopes: () => decodeOriginalScopes,\n encode: () => encode,\n encodeGeneratedRanges: () => encodeGeneratedRanges,\n encodeOriginalScopes: () => encodeOriginalScopes\n});\nmodule.exports = __toCommonJS(sourcemap_codec_exports);\n\n// src/vlq.ts\nvar comma = \",\".charCodeAt(0);\nvar semicolon = \";\".charCodeAt(0);\nvar chars = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\nvar intToChar = new Uint8Array(64);\nvar charToInt = new Uint8Array(128);\nfor (let i = 0; i < chars.length; i++) {\n const c = chars.charCodeAt(i);\n intToChar[i] = c;\n charToInt[c] = i;\n}\nfunction decodeInteger(reader, relative) {\n let value = 0;\n let shift = 0;\n let integer = 0;\n do {\n const c = reader.next();\n integer = charToInt[c];\n value |= (integer & 31) << shift;\n shift += 5;\n } while (integer & 32);\n const shouldNegate = value & 1;\n value >>>= 1;\n if (shouldNegate) {\n value = -2147483648 | -value;\n }\n return relative + value;\n}\nfunction encodeInteger(builder, num, relative) {\n let delta = num - relative;\n delta = delta < 0 ? -delta << 1 | 1 : delta << 1;\n do {\n let clamped = delta & 31;\n delta >>>= 5;\n if (delta > 0) clamped |= 32;\n builder.write(intToChar[clamped]);\n } while (delta > 0);\n return num;\n}\nfunction hasMoreVlq(reader, max) {\n if (reader.pos >= max) return false;\n return reader.peek() !== comma;\n}\n\n// src/strings.ts\nvar bufLength = 1024 * 16;\nvar td = typeof TextDecoder !== \"undefined\" ? /* @__PURE__ */ new TextDecoder() : typeof Buffer !== \"undefined\" ? {\n decode(buf) {\n const out = Buffer.from(buf.buffer, buf.byteOffset, buf.byteLength);\n return out.toString();\n }\n} : {\n decode(buf) {\n let out = \"\";\n for (let i = 0; i < buf.length; i++) {\n out += String.fromCharCode(buf[i]);\n }\n return out;\n }\n};\nvar StringWriter = class {\n constructor() {\n this.pos = 0;\n this.out = \"\";\n this.buffer = new Uint8Array(bufLength);\n }\n write(v) {\n const { buffer } = this;\n buffer[this.pos++] = v;\n if (this.pos === bufLength) {\n this.out += td.decode(buffer);\n this.pos = 0;\n }\n }\n flush() {\n const { buffer, out, pos } = this;\n return pos > 0 ? out + td.decode(buffer.subarray(0, pos)) : out;\n }\n};\nvar StringReader = class {\n constructor(buffer) {\n this.pos = 0;\n this.buffer = buffer;\n }\n next() {\n return this.buffer.charCodeAt(this.pos++);\n }\n peek() {\n return this.buffer.charCodeAt(this.pos);\n }\n indexOf(char) {\n const { buffer, pos } = this;\n const idx = buffer.indexOf(char, pos);\n return idx === -1 ? buffer.length : idx;\n }\n};\n\n// src/scopes.ts\nvar EMPTY = [];\nfunction decodeOriginalScopes(input) {\n const { length } = input;\n const reader = new StringReader(input);\n const scopes = [];\n const stack = [];\n let line = 0;\n for (; reader.pos < length; reader.pos++) {\n line = decodeInteger(reader, line);\n const column = decodeInteger(reader, 0);\n if (!hasMoreVlq(reader, length)) {\n const last = stack.pop();\n last[2] = line;\n last[3] = column;\n continue;\n }\n const kind = decodeInteger(reader, 0);\n const fields = decodeInteger(reader, 0);\n const hasName = fields & 1;\n const scope = hasName ? [line, column, 0, 0, kind, decodeInteger(reader, 0)] : [line, column, 0, 0, kind];\n let vars = EMPTY;\n if (hasMoreVlq(reader, length)) {\n vars = [];\n do {\n const varsIndex = decodeInteger(reader, 0);\n vars.push(varsIndex);\n } while (hasMoreVlq(reader, length));\n }\n scope.vars = vars;\n scopes.push(scope);\n stack.push(scope);\n }\n return scopes;\n}\nfunction encodeOriginalScopes(scopes) {\n const writer = new StringWriter();\n for (let i = 0; i < scopes.length; ) {\n i = _encodeOriginalScopes(scopes, i, writer, [0]);\n }\n return writer.flush();\n}\nfunction _encodeOriginalScopes(scopes, index, writer, state) {\n const scope = scopes[index];\n const { 0: startLine, 1: startColumn, 2: endLine, 3: endColumn, 4: kind, vars } = scope;\n if (index > 0) writer.write(comma);\n state[0] = encodeInteger(writer, startLine, state[0]);\n encodeInteger(writer, startColumn, 0);\n encodeInteger(writer, kind, 0);\n const fields = scope.length === 6 ? 1 : 0;\n encodeInteger(writer, fields, 0);\n if (scope.length === 6) encodeInteger(writer, scope[5], 0);\n for (const v of vars) {\n encodeInteger(writer, v, 0);\n }\n for (index++; index < scopes.length; ) {\n const next = scopes[index];\n const { 0: l, 1: c } = next;\n if (l > endLine || l === endLine && c >= endColumn) {\n break;\n }\n index = _encodeOriginalScopes(scopes, index, writer, state);\n }\n writer.write(comma);\n state[0] = encodeInteger(writer, endLine, state[0]);\n encodeInteger(writer, endColumn, 0);\n return index;\n}\nfunction decodeGeneratedRanges(input) {\n const { length } = input;\n const reader = new StringReader(input);\n const ranges = [];\n const stack = [];\n let genLine = 0;\n let definitionSourcesIndex = 0;\n let definitionScopeIndex = 0;\n let callsiteSourcesIndex = 0;\n let callsiteLine = 0;\n let callsiteColumn = 0;\n let bindingLine = 0;\n let bindingColumn = 0;\n do {\n const semi = reader.indexOf(\";\");\n let genColumn = 0;\n for (; reader.pos < semi; reader.pos++) {\n genColumn = decodeInteger(reader, genColumn);\n if (!hasMoreVlq(reader, semi)) {\n const last = stack.pop();\n last[2] = genLine;\n last[3] = genColumn;\n continue;\n }\n const fields = decodeInteger(reader, 0);\n const hasDefinition = fields & 1;\n const hasCallsite = fields & 2;\n const hasScope = fields & 4;\n let callsite = null;\n let bindings = EMPTY;\n let range;\n if (hasDefinition) {\n const defSourcesIndex = decodeInteger(reader, definitionSourcesIndex);\n definitionScopeIndex = decodeInteger(\n reader,\n definitionSourcesIndex === defSourcesIndex ? definitionScopeIndex : 0\n );\n definitionSourcesIndex = defSourcesIndex;\n range = [genLine, genColumn, 0, 0, defSourcesIndex, definitionScopeIndex];\n } else {\n range = [genLine, genColumn, 0, 0];\n }\n range.isScope = !!hasScope;\n if (hasCallsite) {\n const prevCsi = callsiteSourcesIndex;\n const prevLine = callsiteLine;\n callsiteSourcesIndex = decodeInteger(reader, callsiteSourcesIndex);\n const sameSource = prevCsi === callsiteSourcesIndex;\n callsiteLine = decodeInteger(reader, sameSource ? callsiteLine : 0);\n callsiteColumn = decodeInteger(\n reader,\n sameSource && prevLine === callsiteLine ? callsiteColumn : 0\n );\n callsite = [callsiteSourcesIndex, callsiteLine, callsiteColumn];\n }\n range.callsite = callsite;\n if (hasMoreVlq(reader, semi)) {\n bindings = [];\n do {\n bindingLine = genLine;\n bindingColumn = genColumn;\n const expressionsCount = decodeInteger(reader, 0);\n let expressionRanges;\n if (expressionsCount < -1) {\n expressionRanges = [[decodeInteger(reader, 0)]];\n for (let i = -1; i > expressionsCount; i--) {\n const prevBl = bindingLine;\n bindingLine = decodeInteger(reader, bindingLine);\n bindingColumn = decodeInteger(reader, bindingLine === prevBl ? bindingColumn : 0);\n const expression = decodeInteger(reader, 0);\n expressionRanges.push([expression, bindingLine, bindingColumn]);\n }\n } else {\n expressionRanges = [[expressionsCount]];\n }\n bindings.push(expressionRanges);\n } while (hasMoreVlq(reader, semi));\n }\n range.bindings = bindings;\n ranges.push(range);\n stack.push(range);\n }\n genLine++;\n reader.pos = semi + 1;\n } while (reader.pos < length);\n return ranges;\n}\nfunction encodeGeneratedRanges(ranges) {\n if (ranges.length === 0) return \"\";\n const writer = new StringWriter();\n for (let i = 0; i < ranges.length; ) {\n i = _encodeGeneratedRanges(ranges, i, writer, [0, 0, 0, 0, 0, 0, 0]);\n }\n return writer.flush();\n}\nfunction _encodeGeneratedRanges(ranges, index, writer, state) {\n const range = ranges[index];\n const {\n 0: startLine,\n 1: startColumn,\n 2: endLine,\n 3: endColumn,\n isScope,\n callsite,\n bindings\n } = range;\n if (state[0] < startLine) {\n catchupLine(writer, state[0], startLine);\n state[0] = startLine;\n state[1] = 0;\n } else if (index > 0) {\n writer.write(comma);\n }\n state[1] = encodeInteger(writer, range[1], state[1]);\n const fields = (range.length === 6 ? 1 : 0) | (callsite ? 2 : 0) | (isScope ? 4 : 0);\n encodeInteger(writer, fields, 0);\n if (range.length === 6) {\n const { 4: sourcesIndex, 5: scopesIndex } = range;\n if (sourcesIndex !== state[2]) {\n state[3] = 0;\n }\n state[2] = encodeInteger(writer, sourcesIndex, state[2]);\n state[3] = encodeInteger(writer, scopesIndex, state[3]);\n }\n if (callsite) {\n const { 0: sourcesIndex, 1: callLine, 2: callColumn } = range.callsite;\n if (sourcesIndex !== state[4]) {\n state[5] = 0;\n state[6] = 0;\n } else if (callLine !== state[5]) {\n state[6] = 0;\n }\n state[4] = encodeInteger(writer, sourcesIndex, state[4]);\n state[5] = encodeInteger(writer, callLine, state[5]);\n state[6] = encodeInteger(writer, callColumn, state[6]);\n }\n if (bindings) {\n for (const binding of bindings) {\n if (binding.length > 1) encodeInteger(writer, -binding.length, 0);\n const expression = binding[0][0];\n encodeInteger(writer, expression, 0);\n let bindingStartLine = startLine;\n let bindingStartColumn = startColumn;\n for (let i = 1; i < binding.length; i++) {\n const expRange = binding[i];\n bindingStartLine = encodeInteger(writer, expRange[1], bindingStartLine);\n bindingStartColumn = encodeInteger(writer, expRange[2], bindingStartColumn);\n encodeInteger(writer, expRange[0], 0);\n }\n }\n }\n for (index++; index < ranges.length; ) {\n const next = ranges[index];\n const { 0: l, 1: c } = next;\n if (l > endLine || l === endLine && c >= endColumn) {\n break;\n }\n index = _encodeGeneratedRanges(ranges, index, writer, state);\n }\n if (state[0] < endLine) {\n catchupLine(writer, state[0], endLine);\n state[0] = endLine;\n state[1] = 0;\n } else {\n writer.write(comma);\n }\n state[1] = encodeInteger(writer, endColumn, state[1]);\n return index;\n}\nfunction catchupLine(writer, lastLine, line) {\n do {\n writer.write(semicolon);\n } while (++lastLine < line);\n}\n\n// src/sourcemap-codec.ts\nfunction decode(mappings) {\n const { length } = mappings;\n const reader = new StringReader(mappings);\n const decoded = [];\n let genColumn = 0;\n let sourcesIndex = 0;\n let sourceLine = 0;\n let sourceColumn = 0;\n let namesIndex = 0;\n do {\n const semi = reader.indexOf(\";\");\n const line = [];\n let sorted = true;\n let lastCol = 0;\n genColumn = 0;\n while (reader.pos < semi) {\n let seg;\n genColumn = decodeInteger(reader, genColumn);\n if (genColumn < lastCol) sorted = false;\n lastCol = genColumn;\n if (hasMoreVlq(reader, semi)) {\n sourcesIndex = decodeInteger(reader, sourcesIndex);\n sourceLine = decodeInteger(reader, sourceLine);\n sourceColumn = decodeInteger(reader, sourceColumn);\n if (hasMoreVlq(reader, semi)) {\n namesIndex = decodeInteger(reader, namesIndex);\n seg = [genColumn, sourcesIndex, sourceLine, sourceColumn, namesIndex];\n } else {\n seg = [genColumn, sourcesIndex, sourceLine, sourceColumn];\n }\n } else {\n seg = [genColumn];\n }\n line.push(seg);\n reader.pos++;\n }\n if (!sorted) sort(line);\n decoded.push(line);\n reader.pos = semi + 1;\n } while (reader.pos <= length);\n return decoded;\n}\nfunction sort(line) {\n line.sort(sortComparator);\n}\nfunction sortComparator(a, b) {\n return a[0] - b[0];\n}\nfunction encode(decoded) {\n const writer = new StringWriter();\n let sourcesIndex = 0;\n let sourceLine = 0;\n let sourceColumn = 0;\n let namesIndex = 0;\n for (let i = 0; i < decoded.length; i++) {\n const line = decoded[i];\n if (i > 0) writer.write(semicolon);\n if (line.length === 0) continue;\n let genColumn = 0;\n for (let j = 0; j < line.length; j++) {\n const segment = line[j];\n if (j > 0) writer.write(comma);\n genColumn = encodeInteger(writer, segment[0], genColumn);\n if (segment.length === 1) continue;\n sourcesIndex = encodeInteger(writer, segment[1], sourcesIndex);\n sourceLine = encodeInteger(writer, segment[2], sourceLine);\n sourceColumn = encodeInteger(writer, segment[3], sourceColumn);\n if (segment.length === 4) continue;\n namesIndex = encodeInteger(writer, segment[4], namesIndex);\n }\n }\n return writer.flush();\n}\n}));\n//# sourceMappingURL=sourcemap-codec.umd.js.map\n","(function (global, factory) {\n typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n typeof define === 'function' && define.amd ? define(factory) :\n (global = typeof globalThis !== 'undefined' ? globalThis : global || self, global.resolveURI = factory());\n})(this, (function () { 'use strict';\n\n // Matches the scheme of a URL, eg \"http://\"\n const 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 */\n const 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 */\n const fileRegex = /^file:(?:\\/\\/((?![a-z]:)[^/#?]*)?)?(\\/?[^#?]*)(\\?[^#]*)?(#.*)?/i;\n function isAbsoluteUrl(input) {\n return schemeRegex.test(input);\n }\n function isSchemeRelativeUrl(input) {\n return input.startsWith('//');\n }\n function isAbsolutePath(input) {\n return input.startsWith('/');\n }\n function isFileUrl(input) {\n return input.startsWith('file:');\n }\n function isRelative(input) {\n return /^[.?#]/.test(input);\n }\n function 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 }\n function 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 }\n function makeUrl(scheme, user, host, port, path, query, hash) {\n return {\n scheme,\n user,\n host,\n port,\n path,\n query,\n hash,\n type: 7 /* Absolute */,\n };\n }\n function parseUrl(input) {\n if (isSchemeRelativeUrl(input)) {\n const url = parseAbsoluteUrl('http:' + input);\n url.scheme = '';\n url.type = 6 /* SchemeRelative */;\n return url;\n }\n if (isAbsolutePath(input)) {\n const url = parseAbsoluteUrl('http://foo.com' + input);\n url.scheme = '';\n url.host = '';\n url.type = 5 /* AbsolutePath */;\n return url;\n }\n if (isFileUrl(input))\n return parseFileUrl(input);\n if (isAbsoluteUrl(input))\n return parseAbsoluteUrl(input);\n const url = parseAbsoluteUrl('http://foo.com/' + input);\n url.scheme = '';\n url.host = '';\n url.type = input\n ? input.startsWith('?')\n ? 3 /* Query */\n : input.startsWith('#')\n ? 2 /* Hash */\n : 4 /* RelativePath */\n : 1 /* Empty */;\n return url;\n }\n function 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 }\n function 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 */\n function normalizePath(url, type) {\n const rel = type <= 4 /* RelativePath */;\n const pieces = url.path.split('/');\n // We need to preserve the first piece always, so that we output a leading slash. The item at\n // pieces[0] is an empty string.\n let pointer = 1;\n // Positive is the number of real directories we've output, used for popping a parent directory.\n // Eg, \"foo/bar/..\" will have a positive 2, and we can decrement to be left with just \"foo\".\n let positive = 0;\n // We need to keep a trailing slash if we encounter an empty directory (eg, splitting \"foo/\" will\n // generate `[\"foo\", \"\"]` pieces). And, if we pop a parent directory. But once we encounter a\n // real directory, we won't need to append, unless the other conditions happen again.\n let addTrailingSlash = false;\n for (let i = 1; i < pieces.length; i++) {\n const piece = pieces[i];\n // An empty directory, could be a trailing slash, or just a double \"//\" in the path.\n if (!piece) {\n addTrailingSlash = true;\n continue;\n }\n // If we encounter a real directory, then we don't need to append anymore.\n addTrailingSlash = false;\n // A current directory, which we can always drop.\n if (piece === '.')\n continue;\n // A parent directory, we need to see if there are any real directories we can pop. Else, we\n // have an excess of parents, and we'll need to keep the \"..\".\n if (piece === '..') {\n if (positive) {\n addTrailingSlash = true;\n positive--;\n pointer--;\n }\n else if (rel) {\n // If we're in a relativePath, then we need to keep the excess parents. Else, in an absolute\n // URL, protocol relative URL, or an absolute path, we don't need to keep excess.\n pieces[pointer++] = piece;\n }\n continue;\n }\n // We've encountered a real directory. Move it to the next insertion pointer, which accounts for\n // any popped or dropped directories.\n pieces[pointer++] = piece;\n positive++;\n }\n let path = '';\n for (let i = 1; i < pointer; i++) {\n path += '/' + pieces[i];\n }\n if (!path || (addTrailingSlash && !path.endsWith('/..'))) {\n path += '/';\n }\n url.path = path;\n }\n /**\n * Attempts to resolve `input` URL/path relative to `base`.\n */\n function resolve(input, base) {\n if (!input && !base)\n return '';\n const url = parseUrl(input);\n let inputType = url.type;\n if (base && inputType !== 7 /* Absolute */) {\n const baseUrl = parseUrl(base);\n const baseType = baseUrl.type;\n switch (inputType) {\n case 1 /* Empty */:\n url.hash = baseUrl.hash;\n // fall through\n case 2 /* Hash */:\n url.query = baseUrl.query;\n // fall through\n case 3 /* Query */:\n case 4 /* RelativePath */:\n mergePaths(url, baseUrl);\n // fall through\n case 5 /* AbsolutePath */:\n // The host, user, and port are joined, you can't copy one without the others.\n url.user = baseUrl.user;\n url.host = baseUrl.host;\n url.port = baseUrl.port;\n // fall through\n case 6 /* SchemeRelative */:\n // The input doesn't have a schema at least, so we need to copy at least that over.\n url.scheme = baseUrl.scheme;\n }\n if (baseType > inputType)\n inputType = baseType;\n }\n normalizePath(url, inputType);\n const queryHash = url.query + url.hash;\n switch (inputType) {\n // This is impossible, because of the empty checks at the start of the function.\n // case UrlType.Empty:\n case 2 /* Hash */:\n case 3 /* Query */:\n return queryHash;\n case 4 /* RelativePath */: {\n // The first char is always a \"/\", and we need it to be relative.\n const path = url.path.slice(1);\n if (!path)\n return queryHash || '.';\n if (isRelative(base || input) && !isRelative(path)) {\n // If base started with a leading \".\", or there is no base and input started with a \".\",\n // then we need to ensure that the relative path starts with a \".\". We don't know if\n // relative starts with a \"..\", though, so check before prepending.\n return './' + path + queryHash;\n }\n return path + queryHash;\n }\n case 5 /* AbsolutePath */:\n return url.path + queryHash;\n default:\n return url.scheme + '//' + url.user + url.host + url.port + url.path + queryHash;\n }\n }\n\n return resolve;\n\n}));\n//# sourceMappingURL=resolve-uri.umd.js.map\n","(function (global, factory) {\n if (typeof exports === 'object' && typeof module !== 'undefined') {\n factory(module, require('@jridgewell/resolve-uri'), require('@jridgewell/sourcemap-codec'));\n module.exports = def(module);\n } else if (typeof define === 'function' && define.amd) {\n define(['module', '@jridgewell/resolve-uri', '@jridgewell/sourcemap-codec'], function(mod) {\n factory.apply(this, arguments);\n mod.exports = def(mod);\n });\n } else {\n const mod = { exports: {} };\n factory(mod, global.resolveURI, global.sourcemapCodec);\n global = typeof globalThis !== 'undefined' ? globalThis : global || self;\n global.traceMapping = def(mod);\n }\n function def(m) { return 'default' in m.exports ? m.exports.default : m.exports; }\n})(this, (function (module, require_resolveURI, require_sourcemapCodec) {\n\"use strict\";\nvar __create = Object.create;\nvar __defProp = Object.defineProperty;\nvar __getOwnPropDesc = Object.getOwnPropertyDescriptor;\nvar __getOwnPropNames = Object.getOwnPropertyNames;\nvar __getProtoOf = Object.getPrototypeOf;\nvar __hasOwnProp = Object.prototype.hasOwnProperty;\nvar __commonJS = (cb, mod) => function __require() {\n return mod || (0, cb[__getOwnPropNames(cb)[0]])((mod = { exports: {} }).exports, mod), mod.exports;\n};\nvar __export = (target, all) => {\n for (var name in all)\n __defProp(target, name, { get: all[name], enumerable: true });\n};\nvar __copyProps = (to, from, except, desc) => {\n if (from && typeof from === \"object\" || typeof from === \"function\") {\n for (let key of __getOwnPropNames(from))\n if (!__hasOwnProp.call(to, key) && key !== except)\n __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });\n }\n return to;\n};\nvar __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(\n // If the importer is in node compatibility mode or this is not an ESM\n // file that has been converted to a CommonJS file using a Babel-\n // compatible transform (i.e. \"__esModule\" has not been set), then set\n // \"default\" to the CommonJS \"module.exports\" for node compatibility.\n isNodeMode || !mod || !mod.__esModule ? __defProp(target, \"default\", { value: mod, enumerable: true }) : target,\n mod\n));\nvar __toCommonJS = (mod) => __copyProps(__defProp({}, \"__esModule\", { value: true }), mod);\n\n// umd:@jridgewell/sourcemap-codec\nvar require_sourcemap_codec = __commonJS({\n \"umd:@jridgewell/sourcemap-codec\"(exports, module2) {\n module2.exports = require_sourcemapCodec;\n }\n});\n\n// umd:@jridgewell/resolve-uri\nvar require_resolve_uri = __commonJS({\n \"umd:@jridgewell/resolve-uri\"(exports, module2) {\n module2.exports = require_resolveURI;\n }\n});\n\n// src/trace-mapping.ts\nvar trace_mapping_exports = {};\n__export(trace_mapping_exports, {\n AnyMap: () => FlattenMap,\n FlattenMap: () => FlattenMap,\n GREATEST_LOWER_BOUND: () => GREATEST_LOWER_BOUND,\n LEAST_UPPER_BOUND: () => LEAST_UPPER_BOUND,\n TraceMap: () => TraceMap,\n allGeneratedPositionsFor: () => allGeneratedPositionsFor,\n decodedMap: () => decodedMap,\n decodedMappings: () => decodedMappings,\n eachMapping: () => eachMapping,\n encodedMap: () => encodedMap,\n encodedMappings: () => encodedMappings,\n generatedPositionFor: () => generatedPositionFor,\n isIgnored: () => isIgnored,\n originalPositionFor: () => originalPositionFor,\n presortedDecodedMap: () => presortedDecodedMap,\n sourceContentFor: () => sourceContentFor,\n traceSegment: () => traceSegment\n});\nmodule.exports = __toCommonJS(trace_mapping_exports);\nvar import_sourcemap_codec = __toESM(require_sourcemap_codec());\n\n// src/resolve.ts\nvar import_resolve_uri = __toESM(require_resolve_uri());\n\n// src/strip-filename.ts\nfunction stripFilename(path) {\n if (!path) return \"\";\n const index = path.lastIndexOf(\"/\");\n return path.slice(0, index + 1);\n}\n\n// src/resolve.ts\nfunction resolver(mapUrl, sourceRoot) {\n const from = stripFilename(mapUrl);\n const prefix = sourceRoot ? sourceRoot + \"/\" : \"\";\n return (source) => (0, import_resolve_uri.default)(prefix + (source || \"\"), from);\n}\n\n// src/sourcemap-segment.ts\nvar COLUMN = 0;\nvar SOURCES_INDEX = 1;\nvar SOURCE_LINE = 2;\nvar SOURCE_COLUMN = 3;\nvar NAMES_INDEX = 4;\nvar REV_GENERATED_LINE = 1;\nvar REV_GENERATED_COLUMN = 2;\n\n// src/sort.ts\nfunction maybeSort(mappings, owned) {\n const unsortedIndex = nextUnsortedSegmentLine(mappings, 0);\n if (unsortedIndex === mappings.length) return mappings;\n if (!owned) mappings = mappings.slice();\n for (let i = unsortedIndex; i < mappings.length; i = nextUnsortedSegmentLine(mappings, i + 1)) {\n mappings[i] = sortSegments(mappings[i], owned);\n }\n return mappings;\n}\nfunction nextUnsortedSegmentLine(mappings, start) {\n for (let i = start; i < mappings.length; i++) {\n if (!isSorted(mappings[i])) return i;\n }\n return mappings.length;\n}\nfunction isSorted(line) {\n for (let j = 1; j < line.length; j++) {\n if (line[j][COLUMN] < line[j - 1][COLUMN]) {\n return false;\n }\n }\n return true;\n}\nfunction sortSegments(line, owned) {\n if (!owned) line = line.slice();\n return line.sort(sortComparator);\n}\nfunction sortComparator(a, b) {\n return a[COLUMN] - b[COLUMN];\n}\n\n// src/binary-search.ts\nvar found = false;\nfunction binarySearch(haystack, needle, low, high) {\n while (low <= high) {\n const mid = low + (high - low >> 1);\n const cmp = haystack[mid][COLUMN] - needle;\n if (cmp === 0) {\n found = true;\n return mid;\n }\n if (cmp < 0) {\n low = mid + 1;\n } else {\n high = mid - 1;\n }\n }\n found = false;\n return low - 1;\n}\nfunction upperBound(haystack, needle, index) {\n for (let i = index + 1; i < haystack.length; index = i++) {\n if (haystack[i][COLUMN] !== needle) break;\n }\n return index;\n}\nfunction lowerBound(haystack, needle, index) {\n for (let i = index - 1; i >= 0; index = i--) {\n if (haystack[i][COLUMN] !== needle) break;\n }\n return index;\n}\nfunction memoizedState() {\n return {\n lastKey: -1,\n lastNeedle: -1,\n lastIndex: -1\n };\n}\nfunction memoizedBinarySearch(haystack, needle, state, key) {\n const { lastKey, lastNeedle, lastIndex } = state;\n let low = 0;\n let high = haystack.length - 1;\n if (key === lastKey) {\n if (needle === lastNeedle) {\n found = lastIndex !== -1 && haystack[lastIndex][COLUMN] === needle;\n return lastIndex;\n }\n if (needle >= lastNeedle) {\n low = lastIndex === -1 ? 0 : lastIndex;\n } else {\n high = lastIndex;\n }\n }\n state.lastKey = key;\n state.lastNeedle = needle;\n return state.lastIndex = binarySearch(haystack, needle, low, high);\n}\n\n// src/by-source.ts\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) continue;\n const sourceIndex2 = seg[SOURCES_INDEX];\n const sourceLine = seg[SOURCE_LINE];\n const sourceColumn = seg[SOURCE_COLUMN];\n const originalSource = sources[sourceIndex2];\n const originalLine = originalSource[sourceLine] || (originalSource[sourceLine] = []);\n const memo = memos[sourceIndex2];\n let index = upperBound(\n originalLine,\n sourceColumn,\n memoizedBinarySearch(originalLine, sourceColumn, memo, sourceLine)\n );\n memo.lastIndex = ++index;\n insert(originalLine, index, [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}\nfunction buildNullArray() {\n return { __proto__: null };\n}\n\n// src/types.ts\nfunction parse(map) {\n return typeof map === \"string\" ? JSON.parse(map) : map;\n}\n\n// src/flatten-map.ts\nvar FlattenMap = function(map, mapUrl) {\n const parsed = parse(map);\n if (!(\"sections\" in parsed)) {\n return new TraceMap(parsed, mapUrl);\n }\n const mappings = [];\n const sources = [];\n const sourcesContent = [];\n const names = [];\n const ignoreList = [];\n recurse(\n parsed,\n mapUrl,\n mappings,\n sources,\n sourcesContent,\n names,\n ignoreList,\n 0,\n 0,\n Infinity,\n Infinity\n );\n const joined = {\n version: 3,\n file: parsed.file,\n names,\n sources,\n sourcesContent,\n mappings,\n ignoreList\n };\n return presortedDecodedMap(joined);\n};\nfunction recurse(input, mapUrl, mappings, sources, sourcesContent, names, ignoreList, lineOffset, columnOffset, stopLine, stopColumn) {\n const { sections } = input;\n for (let i = 0; i < sections.length; i++) {\n const { map, offset } = sections[i];\n let sl = stopLine;\n let sc = stopColumn;\n if (i + 1 < sections.length) {\n const nextOffset = sections[i + 1].offset;\n sl = Math.min(stopLine, lineOffset + nextOffset.line);\n if (sl === stopLine) {\n sc = Math.min(stopColumn, columnOffset + nextOffset.column);\n } else if (sl < stopLine) {\n sc = columnOffset + nextOffset.column;\n }\n }\n addSection(\n map,\n mapUrl,\n mappings,\n sources,\n sourcesContent,\n names,\n ignoreList,\n lineOffset + offset.line,\n columnOffset + offset.column,\n sl,\n sc\n );\n }\n}\nfunction addSection(input, mapUrl, mappings, sources, sourcesContent, names, ignoreList, lineOffset, columnOffset, stopLine, stopColumn) {\n const parsed = parse(input);\n if (\"sections\" in parsed) return recurse(...arguments);\n const map = new TraceMap(parsed, mapUrl);\n const sourcesOffset = sources.length;\n const namesOffset = names.length;\n const decoded = decodedMappings(map);\n const { resolvedSources, sourcesContent: contents, ignoreList: ignores } = map;\n append(sources, resolvedSources);\n append(names, map.names);\n if (contents) append(sourcesContent, contents);\n else for (let i = 0; i < resolvedSources.length; i++) sourcesContent.push(null);\n if (ignores) for (let i = 0; i < ignores.length; i++) ignoreList.push(ignores[i] + sourcesOffset);\n for (let i = 0; i < decoded.length; i++) {\n const lineI = lineOffset + i;\n if (lineI > stopLine) return;\n const out = getLine(mappings, lineI);\n const cOffset = i === 0 ? columnOffset : 0;\n const line = decoded[i];\n for (let j = 0; j < line.length; j++) {\n const seg = line[j];\n const column = cOffset + seg[COLUMN];\n if (lineI === stopLine && column >= stopColumn) return;\n if (seg.length === 1) {\n out.push([column]);\n continue;\n }\n const sourcesIndex = sourcesOffset + seg[SOURCES_INDEX];\n const sourceLine = seg[SOURCE_LINE];\n const sourceColumn = seg[SOURCE_COLUMN];\n out.push(\n seg.length === 4 ? [column, sourcesIndex, sourceLine, sourceColumn] : [column, sourcesIndex, sourceLine, sourceColumn, namesOffset + seg[NAMES_INDEX]]\n );\n }\n }\n}\nfunction append(arr, other) {\n for (let i = 0; i < other.length; i++) arr.push(other[i]);\n}\nfunction getLine(arr, index) {\n for (let i = arr.length; i <= index; i++) arr[i] = [];\n return arr[index];\n}\n\n// src/trace-mapping.ts\nvar LINE_GTR_ZERO = \"`line` must be greater than 0 (lines start at line 1)\";\nvar COL_GTR_EQ_ZERO = \"`column` must be greater than or equal to 0 (columns start at column 0)\";\nvar LEAST_UPPER_BOUND = -1;\nvar GREATEST_LOWER_BOUND = 1;\nvar TraceMap = class {\n constructor(map, mapUrl) {\n const isString = typeof map === \"string\";\n if (!isString && map._decodedMemo) return map;\n const parsed = parse(map);\n const { version, file, names, sourceRoot, sources, sourcesContent } = parsed;\n this.version = version;\n this.file = file;\n this.names = names || [];\n this.sourceRoot = sourceRoot;\n this.sources = sources;\n this.sourcesContent = sourcesContent;\n this.ignoreList = parsed.ignoreList || parsed.x_google_ignoreList || void 0;\n const resolve = resolver(mapUrl, sourceRoot);\n this.resolvedSources = sources.map(resolve);\n const { mappings } = parsed;\n if (typeof mappings === \"string\") {\n this._encoded = mappings;\n this._decoded = void 0;\n } else if (Array.isArray(mappings)) {\n this._encoded = void 0;\n this._decoded = maybeSort(mappings, isString);\n } else if (parsed.sections) {\n throw new Error(`TraceMap passed sectioned source map, please use FlattenMap export instead`);\n } else {\n th