diff options
| author | Joel Kronqvist <joel.h.kronqvist@gmail.com> | 2022-03-05 19:02:27 +0200 | 
|---|---|---|
| committer | Joel Kronqvist <joel.h.kronqvist@gmail.com> | 2022-03-05 19:02:27 +0200 | 
| commit | 5d309ff52cd399a6b71968a6b9a70c8ac0b98981 (patch) | |
| tree | 360f7eb50f956e2367ef38fa1fc6ac7ac5258042 /node_modules/@jridgewell/trace-mapping | |
| parent | b500a50f1b97d93c98b36ed9a980f8188d648147 (diff) | |
| download | LYLLRuoka-5d309ff52cd399a6b71968a6b9a70c8ac0b98981.tar.gz LYLLRuoka-5d309ff52cd399a6b71968a6b9a70c8ac0b98981.zip  | |
Added node_modules for the updating to work properly.
Diffstat (limited to 'node_modules/@jridgewell/trace-mapping')
13 files changed, 860 insertions, 0 deletions
diff --git a/node_modules/@jridgewell/trace-mapping/LICENSE b/node_modules/@jridgewell/trace-mapping/LICENSE new file mode 100644 index 0000000..37bb488 --- /dev/null +++ b/node_modules/@jridgewell/trace-mapping/LICENSE @@ -0,0 +1,19 @@ +Copyright 2022 Justin Ridgewell <justin@ridgewell.name> + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in +all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE +SOFTWARE. diff --git a/node_modules/@jridgewell/trace-mapping/README.md b/node_modules/@jridgewell/trace-mapping/README.md new file mode 100644 index 0000000..90aafc7 --- /dev/null +++ b/node_modules/@jridgewell/trace-mapping/README.md @@ -0,0 +1,77 @@ +# @jridgewell/trace-mapping + +> Trace the original position through a source map + +`trace-mapping` allows you to take the line and column of an output file and trace it to the +original location in the source file through a source map. + +You may already be familiar with the [`source-map`][source-map] package's `SourceMapConsumer`. This +provides the same `originalPositionFor` API, without requires WASM. + +## Installation + +```sh +npm install @jridgewell/trace-mapping +``` + +## Usage + +```typescript +import { TraceMap, originalPositionFor } from '@jridgewell/trace-mapping'; + +const tracer = new TraceMap({ +  version: 3, +  sources: ['input.js'], +  names: ['foo'], +  mappings: 'KAyCIA', +}); + +// Lines start at line 1, columns at column 0. +const traced = originalPositionFor(tracer, { line: 1, column: 5 }); +assert.deepEqual(traced, { +  source: 'input.js', +  line: 42, +  column: 4, +  name: 'foo', +}); +``` + +We also provide a lower level API to get the actual segment that matches our line and column. Unlike +`originalPositionFor`, `traceSegment` uses a 0-base for `line`: + +```typescript +import { originalPositionFor } from '@jridgewell/trace-mapping'; + +// line is 0-base. +const traced = traceSegment(tracer, /* line */ 0, /* column */ 5); + +// Segments are [outputColumn, sourcesIndex, sourceLine, sourceColumn, namesIndex] +// Again, line is 0-base and so is sourceLine +assert.deepEqual(traced, [5, 0, 41, 4, 0]); +``` + +## Benchmarks + +`trace-mapping` is the fastest source map tracing library, by a factor of 4-10x when +constructing/parsing source maps and another 6-10x when using `originalPositionFor` on an already +constructed instance. + +``` +node v16.13.2 + +trace-mapping: decoded JSON input x 7,224 ops/sec ±0.24% (99 runs sampled) +trace-mapping: encoded JSON input x 22,539 ops/sec ±0.17% (98 runs sampled) +trace-mapping: decoded Object input x 161,786 ops/sec ±0.11% (101 runs sampled) +trace-mapping: encoded Object input x 24,485 ops/sec ±0.10% (100 runs sampled) +source-map-js: encoded Object input x 6,195 ops/sec ±0.36% (100 runs sampled) +source-map:    encoded Object input x 2,602 ops/sec ±0.16% (100 runs sampled) +Fastest is trace-mapping: decoded Object input + +trace-mapping: decoded originalPositionFor x 19,860 ops/sec ±0.11% (101 runs sampled) +trace-mapping: encoded originalPositionFor x 19,250 ops/sec ±0.23% (100 runs sampled) +source-map-js: encoded originalPositionFor x 2,897 ops/sec ±0.09% (100 runs sampled) +source-map:    encoded originalPositionFor x 1,571 ops/sec ±0.10% (100 runs sampled) +Fastest is trace-mapping: decoded originalPositionFor +``` + +[source-map]: https://www.npmjs.com/package/source-map diff --git a/node_modules/@jridgewell/trace-mapping/dist/trace-mapping.mjs b/node_modules/@jridgewell/trace-mapping/dist/trace-mapping.mjs new file mode 100644 index 0000000..fd59d76 --- /dev/null +++ b/node_modules/@jridgewell/trace-mapping/dist/trace-mapping.mjs @@ -0,0 +1,269 @@ +import { decode, encode } from '@jridgewell/sourcemap-codec'; +import resolveUri from '@jridgewell/resolve-uri'; + +function resolve(input, base) { +    // The base is always treated as a directory, if it's not empty. +    // https://github.com/mozilla/source-map/blob/8cb3ee57/lib/util.js#L327 +    // https://github.com/chromium/chromium/blob/da4adbb3/third_party/blink/renderer/devtools/front_end/sdk/SourceMap.js#L400-L401 +    if (base && !base.endsWith('/')) +        base += '/'; +    return resolveUri(input, base); +} + +/** + * Removes everything after the last "/", but leaves the slash. + */ +function stripFilename(path) { +    if (!path) +        return ''; +    const index = path.lastIndexOf('/'); +    return path.slice(0, index + 1); +} + +function maybeSort(mappings, owned) { +    const unsortedIndex = nextUnsortedSegmentLine(mappings, 0); +    if (unsortedIndex === mappings.length) +        return mappings; +    // If we own the array (meaning we parsed it from JSON), then we're free to directly mutate it. If +    // not, we do not want to modify the consumer's input array. +    if (!owned) +        mappings = mappings.slice(); +    for (let i = unsortedIndex; i < mappings.length; i = nextUnsortedSegmentLine(mappings, i + 1)) { +        mappings[i] = sortSegments(mappings[i], owned); +    } +    return mappings; +} +function nextUnsortedSegmentLine(mappings, start) { +    for (let i = start; i < mappings.length; i++) { +        if (!isSorted(mappings[i])) +            return i; +    } +    return mappings.length; +} +function isSorted(line) { +    for (let j = 1; j < line.length; j++) { +        if (line[j][0] < line[j - 1][0]) { +            return false; +        } +    } +    return true; +} +function sortSegments(line, owned) { +    if (!owned) +        line = line.slice(); +    return line.sort(sortComparator); +} +function sortComparator(a, b) { +    return a[0] - b[0]; +} + +/** + * A binary search implementation that returns the index if a match is found. + * If no match is found, then the left-index (the index associated with the item that comes just + * before the desired index) is returned. To maintain proper sort order, a splice would happen at + * the next index: + * + * ```js + * const array = [1, 3]; + * const needle = 2; + * const index = binarySearch(array, needle, (item, needle) => item - needle); + * + * assert.equal(index, 0); + * array.splice(index + 1, 0, needle); + * assert.deepEqual(array, [1, 2, 3]); + * ``` + */ +function binarySearch(haystack, needle, low, high) { +    while (low <= high) { +        const mid = low + ((high - low) >> 1); +        const cmp = haystack[mid][0] - needle; +        if (cmp === 0) { +            return mid; +        } +        if (cmp < 0) { +            low = mid + 1; +        } +        else { +            high = mid - 1; +        } +    } +    return low - 1; +} +function memoizedState() { +    return { +        lastKey: -1, +        lastNeedle: -1, +        lastIndex: -1, +    }; +} +/** + * This overly complicated beast is just to record the last tested line/column and the resulting + * index, allowing us to skip a few tests if mappings are monotonically increasing. + */ +function memoizedBinarySearch(haystack, needle, state, key) { +    const { lastKey, lastNeedle, lastIndex } = state; +    let low = 0; +    let high = haystack.length - 1; +    if (key === lastKey) { +        if (needle === lastNeedle) { +            return lastIndex; +        } +        if (needle >= lastNeedle) { +            // lastIndex may be -1 if the previous needle was not found. +            low = Math.max(lastIndex, 0); +        } +        else { +            high = lastIndex; +        } +    } +    state.lastKey = key; +    state.lastNeedle = needle; +    return (state.lastIndex = binarySearch(haystack, needle, low, high)); +} + +const INVALID_MAPPING = Object.freeze({ +    source: null, +    line: null, +    column: null, +    name: null, +}); +/** + * Returns the encoded (VLQ string) form of the SourceMap's mappings field. + */ +let encodedMappings; +/** + * Returns the decoded (array of lines of segments) form of the SourceMap's mappings field. + */ +let decodedMappings; +/** + * A low-level API to find the segment associated with a generated line/column (think, from a + * stack trace). Line and column here are 0-based, unlike `originalPositionFor`. + */ +let traceSegment; +/** + * A higher-level API to find the source/line/column associated with a generated line/column + * (think, from a stack trace). Line is 1-based, but column is 0-based, due to legacy behavior in + * `source-map` library. + */ +let originalPositionFor; +/** + * Iterates each mapping in generated position order. + */ +let eachMapping; +/** + * A helper that skips sorting of the input map's mappings array, which can be expensive for larger + * maps. + */ +let presortedDecodedMap; +class TraceMap { +    constructor(map, mapUrl) { +        this._binarySearchMemo = memoizedState(); +        const isString = typeof map === 'string'; +        const parsed = isString ? JSON.parse(map) : map; +        const { version, file, names, sourceRoot, sources, sourcesContent } = parsed; +        this.version = version; +        this.file = file; +        this.names = names; +        this.sourceRoot = sourceRoot; +        this.sources = sources; +        this.sourcesContent = sourcesContent; +        if (sourceRoot || mapUrl) { +            const from = resolve(sourceRoot || '', stripFilename(mapUrl)); +            this.resolvedSources = sources.map((s) => resolve(s || '', from)); +        } +        else { +            this.resolvedSources = sources.map((s) => s || ''); +        } +        const { mappings } = parsed; +        if (typeof mappings === 'string') { +            this._encoded = mappings; +            this._decoded = decode(mappings); +        } +        else { +            this._encoded = undefined; +            this._decoded = maybeSort(mappings, isString); +        } +    } +} +(() => { +    encodedMappings = (map) => { +        var _a; +        return ((_a = map._encoded) !== null && _a !== void 0 ? _a : (map._encoded = encode(map._decoded))); +    }; +    decodedMappings = (map) => { +        return map._decoded; +    }; +    traceSegment = (map, line, column) => { +        const decoded = map._decoded; +        // It's common for parent source maps to have pointers to lines that have no +        // mapping (like a "//# sourceMappingURL=") at the end of the child file. +        if (line >= decoded.length) +            return null; +        const segments = decoded[line]; +        const index = memoizedBinarySearch(segments, column, map._binarySearchMemo, line); +        // we come before any mapped segment +        if (index < 0) +            return null; +        return segments[index]; +    }; +    originalPositionFor = (map, { line, column }) => { +        if (line < 1) +            throw new Error('`line` must be greater than 0 (lines start at line 1)'); +        if (column < 0) { +            throw new Error('`column` must be greater than or equal to 0 (columns start at column 0)'); +        } +        const segment = traceSegment(map, line - 1, column); +        if (segment == null) +            return INVALID_MAPPING; +        if (segment.length == 1) +            return INVALID_MAPPING; +        const { names, resolvedSources } = map; +        return { +            source: resolvedSources[segment[1]], +            line: segment[2] + 1, +            column: segment[3], +            name: segment.length === 5 ? names[segment[4]] : null, +        }; +    }; +    eachMapping = (map, cb) => { +        const decoded = map._decoded; +        const { names, resolvedSources } = map; +        for (let i = 0; i < decoded.length; i++) { +            const line = decoded[i]; +            for (let j = 0; j < line.length; j++) { +                const seg = line[j]; +                const generatedLine = i + 1; +                const generatedColumn = seg[0]; +                let source = null; +                let originalLine = null; +                let originalColumn = null; +                let name = null; +                if (seg.length !== 1) { +                    source = resolvedSources[seg[1]]; +                    originalLine = seg[2] + 1; +                    originalColumn = seg[3]; +                } +                if (seg.length === 5) +                    name = names[seg[4]]; +                cb({ +                    generatedLine, +                    generatedColumn, +                    source, +                    originalLine, +                    originalColumn, +                    name, +                }); +            } +        } +    }; +    presortedDecodedMap = (map, mapUrl) => { +        const clone = Object.assign({}, map); +        clone.mappings = []; +        const tracer = new TraceMap(clone, mapUrl); +        tracer._decoded = map.mappings; +        return tracer; +    }; +})(); + +export { TraceMap, decodedMappings, eachMapping, encodedMappings, originalPositionFor, presortedDecodedMap, traceSegment }; +//# sourceMappingURL=trace-mapping.mjs.map diff --git a/node_modules/@jridgewell/trace-mapping/dist/trace-mapping.mjs.map b/node_modules/@jridgewell/trace-mapping/dist/trace-mapping.mjs.map new file mode 100644 index 0000000..df14636 --- /dev/null +++ b/node_modules/@jridgewell/trace-mapping/dist/trace-mapping.mjs.map @@ -0,0 +1 @@ +{"version":3,"file":"trace-mapping.mjs","sources":["../../src/resolve.ts","../../src/strip-filename.ts","../../src/sort.ts","../../src/binary-search.ts","../../src/trace-mapping.ts"],"sourcesContent":[null,null,null,null,null],"names":[],"mappings":";;;SAEwB,OAAO,CAAC,KAAa,EAAE,IAAwB;;;;IAIrE,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,IAAI,IAAI,GAAG,CAAC;IAE7C,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AACjC;;ACTA;;;SAGwB,aAAa,CAAC,IAA+B;IACnE,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IACrB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACpC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;AAClC;;SCLwB,SAAS,CAC/B,QAA8B,EAC9B,KAAc;IAEd,MAAM,aAAa,GAAG,uBAAuB,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAC3D,IAAI,aAAa,KAAK,QAAQ,CAAC,MAAM;QAAE,OAAO,QAAQ,CAAC;;;IAIvD,IAAI,CAAC,KAAK;QAAE,QAAQ,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;IAExC,KAAK,IAAI,CAAC,GAAG,aAAa,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,uBAAuB,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE;QAC7F,QAAQ,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;KAChD;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,uBAAuB,CAAC,QAA8B,EAAE,KAAa;IAC5E,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC5C,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;KACtC;IACD,OAAO,QAAQ,CAAC,MAAM,CAAC;AACzB,CAAC;AAED,SAAS,QAAQ,CAAC,IAAwB;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;YAC/B,OAAO,KAAK,CAAC;SACd;KACF;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,YAAY,CAAC,IAAwB,EAAE,KAAc;IAC5D,IAAI,CAAC,KAAK;QAAE,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;IAChC,OAAO,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,cAAc,CAAC,CAAmB,EAAE,CAAmB;IAC9D,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACrB;;AClCA;;;;;;;;;;;;;;;;SAgBgB,YAAY,CAC1B,QAA4B,EAC5B,MAAc,EACd,GAAW,EACX,IAAY;IAEZ,OAAO,GAAG,IAAI,IAAI,EAAE;QAClB,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QAEtC,IAAI,GAAG,KAAK,CAAC,EAAE;YACb,OAAO,GAAG,CAAC;SACZ;QAED,IAAI,GAAG,GAAG,CAAC,EAAE;YACX,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;SACf;aAAM;YACL,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;SAChB;KACF;IAED,OAAO,GAAG,GAAG,CAAC,CAAC;AACjB,CAAC;SAEe,aAAa;IAC3B,OAAO;QACL,OAAO,EAAE,CAAC,CAAC;QACX,UAAU,EAAE,CAAC,CAAC;QACd,SAAS,EAAE,CAAC,CAAC;KACd,CAAC;AACJ,CAAC;AAED;;;;SAIgB,oBAAoB,CAClC,QAA4B,EAC5B,MAAc,EACd,KAAgB,EAChB,GAAW;IAEX,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,GAAG,KAAK,CAAC;IAEjD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IAC/B,IAAI,GAAG,KAAK,OAAO,EAAE;QACnB,IAAI,MAAM,KAAK,UAAU,EAAE;YACzB,OAAO,SAAS,CAAC;SAClB;QAED,IAAI,MAAM,IAAI,UAAU,EAAE;;YAExB,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;SAC9B;aAAM;YACL,IAAI,GAAG,SAAS,CAAC;SAClB;KACF;IACD,KAAK,CAAC,OAAO,GAAG,GAAG,CAAC;IACpB,KAAK,CAAC,UAAU,GAAG,MAAM,CAAC;IAE1B,QAAQ,KAAK,CAAC,SAAS,GAAG,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE;AACvE;;ACvDA,MAAM,eAAe,GAAmB,MAAM,CAAC,MAAM,CAAC;IACpD,MAAM,EAAE,IAAI;IACZ,IAAI,EAAE,IAAI;IACV,MAAM,EAAE,IAAI;IACZ,IAAI,EAAE,IAAI;CACX,CAAC,CAAC;AAEH;;;IAGW,gBAAiE;AAE5E;;;IAGW,gBAA2E;AAEtF;;;;IAIW,aAI4B;AAEvC;;;;;IAKW,oBAAyF;AAEpG;;;IAGW,YAAyE;AAEpF;;;;IAIW,oBAA0E;MAExE,QAAQ;IAcnB,YAAY,GAAmB,EAAE,MAAsB;QAF/C,sBAAiB,GAAG,aAAa,EAAE,CAAC;QAG1C,MAAM,QAAQ,GAAG,OAAO,GAAG,KAAK,QAAQ,CAAC;QACzC,MAAM,MAAM,GAAG,QAAQ,GAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAqC,GAAG,GAAG,CAAC;QAErF,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,cAAc,EAAE,GAAG,MAAM,CAAC;QAC7E,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QAErC,IAAI,UAAU,IAAI,MAAM,EAAE;YACxB,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,IAAI,EAAE,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;YAC9D,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;SACnE;aAAM;YACL,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;SACpD;QAED,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC;QAC5B,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE;YAChC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;YACzB,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;SAClC;aAAM;YACL,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;YAC1B,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;SAC/C;KACF;CAuFF;AArFC;IACE,eAAe,GAAG,CAAC,GAAG;;QACpB,cAAQ,GAAG,CAAC,QAAQ,oCAAZ,GAAG,CAAC,QAAQ,GAAK,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAE;KAChD,CAAC;IAEF,eAAe,GAAG,CAAC,GAAG;QACpB,OAAO,GAAG,CAAC,QAAQ,CAAC;KACrB,CAAC;IAEF,YAAY,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM;QAC/B,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,CAAC;;;QAI7B,IAAI,IAAI,IAAI,OAAO,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QAExC,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,oBAAoB,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;;QAGlF,IAAI,KAAK,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QAC3B,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC;KACxB,CAAC;IAEF,mBAAmB,GAAG,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE;QAC1C,IAAI,IAAI,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAC;QACvF,IAAI,MAAM,GAAG,CAAC,EAAE;YACd,MAAM,IAAI,KAAK,CAAC,yEAAyE,CAAC,CAAC;SAC5F;QAED,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;QACpD,IAAI,OAAO,IAAI,IAAI;YAAE,OAAO,eAAe,CAAC;QAC5C,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;YAAE,OAAO,eAAe,CAAC;QAEhD,MAAM,EAAE,KAAK,EAAE,eAAe,EAAE,GAAG,GAAG,CAAC;QACvC,OAAO;YACL,MAAM,EAAE,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;YACpB,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;YAClB,IAAI,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;SACtD,CAAC;KACH,CAAC;IAEF,WAAW,GAAG,CAAC,GAAG,EAAE,EAAE;QACpB,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,CAAC;QAC7B,MAAM,EAAE,KAAK,EAAE,eAAe,EAAE,GAAG,GAAG,CAAC;QAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACvC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACpC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAEpB,MAAM,aAAa,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC5B,MAAM,eAAe,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC/B,IAAI,MAAM,GAAG,IAAI,CAAC;gBAClB,IAAI,YAAY,GAAG,IAAI,CAAC;gBACxB,IAAI,cAAc,GAAG,IAAI,CAAC;gBAC1B,IAAI,IAAI,GAAG,IAAI,CAAC;gBAChB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE;oBACpB,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBACjC,YAAY,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBAC1B,cAAc,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;iBACzB;gBACD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;oBAAE,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAE3C,EAAE,CAAC;oBACD,aAAa;oBACb,eAAe;oBACf,MAAM;oBACN,YAAY;oBACZ,cAAc;oBACd,IAAI;iBACU,CAAC,CAAC;aACnB;SACF;KACF,CAAC;IAEF,mBAAmB,GAAG,CAAC,GAAG,EAAE,MAAM;QAChC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACrC,KAAK,CAAC,QAAQ,GAAG,EAAE,CAAC;QACpB,MAAM,MAAM,GAAG,IAAI,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC3C,MAAM,CAAC,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;QAC/B,OAAO,MAAM,CAAC;KACf,CAAC;AACJ,CAAC,GAAA;;;;"}
\ No newline at end of file diff --git a/node_modules/@jridgewell/trace-mapping/dist/trace-mapping.umd.js b/node_modules/@jridgewell/trace-mapping/dist/trace-mapping.umd.js new file mode 100644 index 0000000..19f8f26 --- /dev/null +++ b/node_modules/@jridgewell/trace-mapping/dist/trace-mapping.umd.js @@ -0,0 +1,280 @@ +(function (global, factory) { +    typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require('@jridgewell/sourcemap-codec'), require('@jridgewell/resolve-uri')) : +    typeof define === 'function' && define.amd ? define(['exports', '@jridgewell/sourcemap-codec', '@jridgewell/resolve-uri'], factory) : +    (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.traceMapping = {}, global.sourcemapCodec, global.resolveURI)); +})(this, (function (exports, sourcemapCodec, resolveUri) { 'use strict'; + +    function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; } + +    var resolveUri__default = /*#__PURE__*/_interopDefaultLegacy(resolveUri); + +    function resolve(input, base) { +        // The base is always treated as a directory, if it's not empty. +        // https://github.com/mozilla/source-map/blob/8cb3ee57/lib/util.js#L327 +        // https://github.com/chromium/chromium/blob/da4adbb3/third_party/blink/renderer/devtools/front_end/sdk/SourceMap.js#L400-L401 +        if (base && !base.endsWith('/')) +            base += '/'; +        return resolveUri__default["default"](input, base); +    } + +    /** +     * Removes everything after the last "/", but leaves the slash. +     */ +    function stripFilename(path) { +        if (!path) +            return ''; +        const index = path.lastIndexOf('/'); +        return path.slice(0, index + 1); +    } + +    function maybeSort(mappings, owned) { +        const unsortedIndex = nextUnsortedSegmentLine(mappings, 0); +        if (unsortedIndex === mappings.length) +            return mappings; +        // If we own the array (meaning we parsed it from JSON), then we're free to directly mutate it. If +        // not, we do not want to modify the consumer's input array. +        if (!owned) +            mappings = mappings.slice(); +        for (let i = unsortedIndex; i < mappings.length; i = nextUnsortedSegmentLine(mappings, i + 1)) { +            mappings[i] = sortSegments(mappings[i], owned); +        } +        return mappings; +    } +    function nextUnsortedSegmentLine(mappings, start) { +        for (let i = start; i < mappings.length; i++) { +            if (!isSorted(mappings[i])) +                return i; +        } +        return mappings.length; +    } +    function isSorted(line) { +        for (let j = 1; j < line.length; j++) { +            if (line[j][0] < line[j - 1][0]) { +                return false; +            } +        } +        return true; +    } +    function sortSegments(line, owned) { +        if (!owned) +            line = line.slice(); +        return line.sort(sortComparator); +    } +    function sortComparator(a, b) { +        return a[0] - b[0]; +    } + +    /** +     * A binary search implementation that returns the index if a match is found. +     * If no match is found, then the left-index (the index associated with the item that comes just +     * before the desired index) is returned. To maintain proper sort order, a splice would happen at +     * the next index: +     * +     * ```js +     * const array = [1, 3]; +     * const needle = 2; +     * const index = binarySearch(array, needle, (item, needle) => item - needle); +     * +     * assert.equal(index, 0); +     * array.splice(index + 1, 0, needle); +     * assert.deepEqual(array, [1, 2, 3]); +     * ``` +     */ +    function binarySearch(haystack, needle, low, high) { +        while (low <= high) { +            const mid = low + ((high - low) >> 1); +            const cmp = haystack[mid][0] - needle; +            if (cmp === 0) { +                return mid; +            } +            if (cmp < 0) { +                low = mid + 1; +            } +            else { +                high = mid - 1; +            } +        } +        return low - 1; +    } +    function memoizedState() { +        return { +            lastKey: -1, +            lastNeedle: -1, +            lastIndex: -1, +        }; +    } +    /** +     * This overly complicated beast is just to record the last tested line/column and the resulting +     * index, allowing us to skip a few tests if mappings are monotonically increasing. +     */ +    function memoizedBinarySearch(haystack, needle, state, key) { +        const { lastKey, lastNeedle, lastIndex } = state; +        let low = 0; +        let high = haystack.length - 1; +        if (key === lastKey) { +            if (needle === lastNeedle) { +                return lastIndex; +            } +            if (needle >= lastNeedle) { +                // lastIndex may be -1 if the previous needle was not found. +                low = Math.max(lastIndex, 0); +            } +            else { +                high = lastIndex; +            } +        } +        state.lastKey = key; +        state.lastNeedle = needle; +        return (state.lastIndex = binarySearch(haystack, needle, low, high)); +    } + +    const INVALID_MAPPING = Object.freeze({ +        source: null, +        line: null, +        column: null, +        name: null, +    }); +    /** +     * Returns the encoded (VLQ string) form of the SourceMap's mappings field. +     */ +    exports.encodedMappings = void 0; +    /** +     * Returns the decoded (array of lines of segments) form of the SourceMap's mappings field. +     */ +    exports.decodedMappings = void 0; +    /** +     * A low-level API to find the segment associated with a generated line/column (think, from a +     * stack trace). Line and column here are 0-based, unlike `originalPositionFor`. +     */ +    exports.traceSegment = void 0; +    /** +     * A higher-level API to find the source/line/column associated with a generated line/column +     * (think, from a stack trace). Line is 1-based, but column is 0-based, due to legacy behavior in +     * `source-map` library. +     */ +    exports.originalPositionFor = void 0; +    /** +     * Iterates each mapping in generated position order. +     */ +    exports.eachMapping = void 0; +    /** +     * A helper that skips sorting of the input map's mappings array, which can be expensive for larger +     * maps. +     */ +    exports.presortedDecodedMap = void 0; +    class TraceMap { +        constructor(map, mapUrl) { +            this._binarySearchMemo = memoizedState(); +            const isString = typeof map === 'string'; +            const parsed = isString ? JSON.parse(map) : map; +            const { version, file, names, sourceRoot, sources, sourcesContent } = parsed; +            this.version = version; +            this.file = file; +            this.names = names; +            this.sourceRoot = sourceRoot; +            this.sources = sources; +            this.sourcesContent = sourcesContent; +            if (sourceRoot || mapUrl) { +                const from = resolve(sourceRoot || '', stripFilename(mapUrl)); +                this.resolvedSources = sources.map((s) => resolve(s || '', from)); +            } +            else { +                this.resolvedSources = sources.map((s) => s || ''); +            } +            const { mappings } = parsed; +            if (typeof mappings === 'string') { +                this._encoded = mappings; +                this._decoded = sourcemapCodec.decode(mappings); +            } +            else { +                this._encoded = undefined; +                this._decoded = maybeSort(mappings, isString); +            } +        } +    } +    (() => { +        exports.encodedMappings = (map) => { +            var _a; +            return ((_a = map._encoded) !== null && _a !== void 0 ? _a : (map._encoded = sourcemapCodec.encode(map._decoded))); +        }; +        exports.decodedMappings = (map) => { +            return map._decoded; +        }; +        exports.traceSegment = (map, line, column) => { +            const decoded = map._decoded; +            // It's common for parent source maps to have pointers to lines that have no +            // mapping (like a "//# sourceMappingURL=") at the end of the child file. +            if (line >= decoded.length) +                return null; +            const segments = decoded[line]; +            const index = memoizedBinarySearch(segments, column, map._binarySearchMemo, line); +            // we come before any mapped segment +            if (index < 0) +                return null; +            return segments[index]; +        }; +        exports.originalPositionFor = (map, { line, column }) => { +            if (line < 1) +                throw new Error('`line` must be greater than 0 (lines start at line 1)'); +            if (column < 0) { +                throw new Error('`column` must be greater than or equal to 0 (columns start at column 0)'); +            } +            const segment = exports.traceSegment(map, line - 1, column); +            if (segment == null) +                return INVALID_MAPPING; +            if (segment.length == 1) +                return INVALID_MAPPING; +            const { names, resolvedSources } = map; +            return { +                source: resolvedSources[segment[1]], +                line: segment[2] + 1, +                column: segment[3], +                name: segment.length === 5 ? names[segment[4]] : null, +            }; +        }; +        exports.eachMapping = (map, cb) => { +            const decoded = map._decoded; +            const { names, resolvedSources } = map; +            for (let i = 0; i < decoded.length; i++) { +                const line = decoded[i]; +                for (let j = 0; j < line.length; j++) { +                    const seg = line[j]; +                    const generatedLine = i + 1; +                    const generatedColumn = seg[0]; +                    let source = null; +                    let originalLine = null; +                    let originalColumn = null; +                    let name = null; +                    if (seg.length !== 1) { +                        source = resolvedSources[seg[1]]; +                        originalLine = seg[2] + 1; +                        originalColumn = seg[3]; +                    } +                    if (seg.length === 5) +                        name = names[seg[4]]; +                    cb({ +                        generatedLine, +                        generatedColumn, +                        source, +                        originalLine, +                        originalColumn, +                        name, +                    }); +                } +            } +        }; +        exports.presortedDecodedMap = (map, mapUrl) => { +            const clone = Object.assign({}, map); +            clone.mappings = []; +            const tracer = new TraceMap(clone, mapUrl); +            tracer._decoded = map.mappings; +            return tracer; +        }; +    })(); + +    exports.TraceMap = TraceMap; + +    Object.defineProperty(exports, '__esModule', { value: true }); + +})); +//# sourceMappingURL=trace-mapping.umd.js.map diff --git a/node_modules/@jridgewell/trace-mapping/dist/trace-mapping.umd.js.map b/node_modules/@jridgewell/trace-mapping/dist/trace-mapping.umd.js.map new file mode 100644 index 0000000..02a91d9 --- /dev/null +++ b/node_modules/@jridgewell/trace-mapping/dist/trace-mapping.umd.js.map @@ -0,0 +1 @@ +{"version":3,"file":"trace-mapping.umd.js","sources":["../../src/resolve.ts","../../src/strip-filename.ts","../../src/sort.ts","../../src/binary-search.ts","../../src/trace-mapping.ts"],"sourcesContent":[null,null,null,null,null],"names":["resolveUri","encodedMappings","decodedMappings","traceSegment","originalPositionFor","eachMapping","presortedDecodedMap","decode","encode"],"mappings":";;;;;;;;;;aAEwB,OAAO,CAAC,KAAa,EAAE,IAAwB;;;;QAIrE,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;YAAE,IAAI,IAAI,GAAG,CAAC;QAE7C,OAAOA,8BAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACjC;;ICTA;;;aAGwB,aAAa,CAAC,IAA+B;QACnE,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACpC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAClC;;aCLwB,SAAS,CAC/B,QAA8B,EAC9B,KAAc;QAEd,MAAM,aAAa,GAAG,uBAAuB,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC3D,IAAI,aAAa,KAAK,QAAQ,CAAC,MAAM;YAAE,OAAO,QAAQ,CAAC;;;QAIvD,IAAI,CAAC,KAAK;YAAE,QAAQ,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;QAExC,KAAK,IAAI,CAAC,GAAG,aAAa,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,uBAAuB,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE;YAC7F,QAAQ,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;SAChD;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,SAAS,uBAAuB,CAAC,QAA8B,EAAE,KAAa;QAC5E,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5C,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC;SACtC;QACD,OAAO,QAAQ,CAAC,MAAM,CAAC;IACzB,CAAC;IAED,SAAS,QAAQ,CAAC,IAAwB;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;gBAC/B,OAAO,KAAK,CAAC;aACd;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,YAAY,CAAC,IAAwB,EAAE,KAAc;QAC5D,IAAI,CAAC,KAAK;YAAE,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAChC,OAAO,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IACnC,CAAC;IAED,SAAS,cAAc,CAAC,CAAmB,EAAE,CAAmB;QAC9D,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB;;IClCA;;;;;;;;;;;;;;;;aAgBgB,YAAY,CAC1B,QAA4B,EAC5B,MAAc,EACd,GAAW,EACX,IAAY;QAEZ,OAAO,GAAG,IAAI,IAAI,EAAE;YAClB,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC;YACtC,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;YAEtC,IAAI,GAAG,KAAK,CAAC,EAAE;gBACb,OAAO,GAAG,CAAC;aACZ;YAED,IAAI,GAAG,GAAG,CAAC,EAAE;gBACX,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;aACf;iBAAM;gBACL,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;aAChB;SACF;QAED,OAAO,GAAG,GAAG,CAAC,CAAC;IACjB,CAAC;aAEe,aAAa;QAC3B,OAAO;YACL,OAAO,EAAE,CAAC,CAAC;YACX,UAAU,EAAE,CAAC,CAAC;YACd,SAAS,EAAE,CAAC,CAAC;SACd,CAAC;IACJ,CAAC;IAED;;;;aAIgB,oBAAoB,CAClC,QAA4B,EAC5B,MAAc,EACd,KAAgB,EAChB,GAAW;QAEX,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,GAAG,KAAK,CAAC;QAEjD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/B,IAAI,GAAG,KAAK,OAAO,EAAE;YACnB,IAAI,MAAM,KAAK,UAAU,EAAE;gBACzB,OAAO,SAAS,CAAC;aAClB;YAED,IAAI,MAAM,IAAI,UAAU,EAAE;;gBAExB,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;aAC9B;iBAAM;gBACL,IAAI,GAAG,SAAS,CAAC;aAClB;SACF;QACD,KAAK,CAAC,OAAO,GAAG,GAAG,CAAC;QACpB,KAAK,CAAC,UAAU,GAAG,MAAM,CAAC;QAE1B,QAAQ,KAAK,CAAC,SAAS,GAAG,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE;IACvE;;ICvDA,MAAM,eAAe,GAAmB,MAAM,CAAC,MAAM,CAAC;QACpD,MAAM,EAAE,IAAI;QACZ,IAAI,EAAE,IAAI;QACV,MAAM,EAAE,IAAI;QACZ,IAAI,EAAE,IAAI;KACX,CAAC,CAAC;IAEH;;;AAGWC,qCAAiE;IAE5E;;;AAGWC,qCAA2E;IAEtF;;;;AAIWC,kCAI4B;IAEvC;;;;;AAKWC,yCAAyF;IAEpG;;;AAGWC,iCAAyE;IAEpF;;;;AAIWC,yCAA0E;UAExE,QAAQ;QAcnB,YAAY,GAAmB,EAAE,MAAsB;YAF/C,sBAAiB,GAAG,aAAa,EAAE,CAAC;YAG1C,MAAM,QAAQ,GAAG,OAAO,GAAG,KAAK,QAAQ,CAAC;YACzC,MAAM,MAAM,GAAG,QAAQ,GAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAqC,GAAG,GAAG,CAAC;YAErF,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,cAAc,EAAE,GAAG,MAAM,CAAC;YAC7E,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;YACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;YAC7B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;YACvB,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;YAErC,IAAI,UAAU,IAAI,MAAM,EAAE;gBACxB,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,IAAI,EAAE,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC9D,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;aACnE;iBAAM;gBACL,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;aACpD;YAED,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC;YAC5B,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE;gBAChC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;gBACzB,IAAI,CAAC,QAAQ,GAAGC,qBAAM,CAAC,QAAQ,CAAC,CAAC;aAClC;iBAAM;gBACL,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAC1B,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;aAC/C;SACF;KAuFF;IArFC;QACEN,uBAAe,GAAG,CAAC,GAAG;;YACpB,cAAQ,GAAG,CAAC,QAAQ,oCAAZ,GAAG,CAAC,QAAQ,GAAKO,qBAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAE;SAChD,CAAC;QAEFN,uBAAe,GAAG,CAAC,GAAG;YACpB,OAAO,GAAG,CAAC,QAAQ,CAAC;SACrB,CAAC;QAEFC,oBAAY,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM;YAC/B,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,CAAC;;;YAI7B,IAAI,IAAI,IAAI,OAAO,CAAC,MAAM;gBAAE,OAAO,IAAI,CAAC;YAExC,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,oBAAoB,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;;YAGlF,IAAI,KAAK,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC3B,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC;SACxB,CAAC;QAEFC,2BAAmB,GAAG,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE;YAC1C,IAAI,IAAI,GAAG,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAC;YACvF,IAAI,MAAM,GAAG,CAAC,EAAE;gBACd,MAAM,IAAI,KAAK,CAAC,yEAAyE,CAAC,CAAC;aAC5F;YAED,MAAM,OAAO,GAAGD,oBAAY,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;YACpD,IAAI,OAAO,IAAI,IAAI;gBAAE,OAAO,eAAe,CAAC;YAC5C,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;gBAAE,OAAO,eAAe,CAAC;YAEhD,MAAM,EAAE,KAAK,EAAE,eAAe,EAAE,GAAG,GAAG,CAAC;YACvC,OAAO;gBACL,MAAM,EAAE,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACnC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;gBACpB,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;gBAClB,IAAI,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;aACtD,CAAC;SACH,CAAC;QAEFE,mBAAW,GAAG,CAAC,GAAG,EAAE,EAAE;YACpB,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,CAAC;YAC7B,MAAM,EAAE,KAAK,EAAE,eAAe,EAAE,GAAG,GAAG,CAAC;YAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACvC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACpC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;oBAEpB,MAAM,aAAa,GAAG,CAAC,GAAG,CAAC,CAAC;oBAC5B,MAAM,eAAe,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC/B,IAAI,MAAM,GAAG,IAAI,CAAC;oBAClB,IAAI,YAAY,GAAG,IAAI,CAAC;oBACxB,IAAI,cAAc,GAAG,IAAI,CAAC;oBAC1B,IAAI,IAAI,GAAG,IAAI,CAAC;oBAChB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE;wBACpB,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;wBACjC,YAAY,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBAC1B,cAAc,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;qBACzB;oBACD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;wBAAE,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBAE3C,EAAE,CAAC;wBACD,aAAa;wBACb,eAAe;wBACf,MAAM;wBACN,YAAY;wBACZ,cAAc;wBACd,IAAI;qBACU,CAAC,CAAC;iBACnB;aACF;SACF,CAAC;QAEFC,2BAAmB,GAAG,CAAC,GAAG,EAAE,MAAM;YAChC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACrC,KAAK,CAAC,QAAQ,GAAG,EAAE,CAAC;YACpB,MAAM,MAAM,GAAG,IAAI,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAC3C,MAAM,CAAC,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;YAC/B,OAAO,MAAM,CAAC;SACf,CAAC;IACJ,CAAC,GAAA;;;;;;;;;;"}
\ No newline at end of file diff --git a/node_modules/@jridgewell/trace-mapping/dist/types/binary-search.d.ts b/node_modules/@jridgewell/trace-mapping/dist/types/binary-search.d.ts new file mode 100644 index 0000000..29f860e --- /dev/null +++ b/node_modules/@jridgewell/trace-mapping/dist/types/binary-search.d.ts @@ -0,0 +1,30 @@ +import type { SourceMapSegment } from './types'; +declare type MemoState = { +    lastKey: number; +    lastNeedle: number; +    lastIndex: number; +}; +/** + * A binary search implementation that returns the index if a match is found. + * If no match is found, then the left-index (the index associated with the item that comes just + * before the desired index) is returned. To maintain proper sort order, a splice would happen at + * the next index: + * + * ```js + * const array = [1, 3]; + * const needle = 2; + * const index = binarySearch(array, needle, (item, needle) => item - needle); + * + * assert.equal(index, 0); + * array.splice(index + 1, 0, needle); + * assert.deepEqual(array, [1, 2, 3]); + * ``` + */ +export declare function binarySearch(haystack: SourceMapSegment[], needle: number, low: number, high: number): number; +export declare function memoizedState(): MemoState; +/** + * This overly complicated beast is just to record the last tested line/column and the resulting + * index, allowing us to skip a few tests if mappings are monotonically increasing. + */ +export declare function memoizedBinarySearch(haystack: SourceMapSegment[], needle: number, state: MemoState, key: number): number; +export {}; diff --git a/node_modules/@jridgewell/trace-mapping/dist/types/resolve.d.ts b/node_modules/@jridgewell/trace-mapping/dist/types/resolve.d.ts new file mode 100644 index 0000000..cf7d4f8 --- /dev/null +++ b/node_modules/@jridgewell/trace-mapping/dist/types/resolve.d.ts @@ -0,0 +1 @@ +export default function resolve(input: string, base: string | undefined): string; diff --git a/node_modules/@jridgewell/trace-mapping/dist/types/sort.d.ts b/node_modules/@jridgewell/trace-mapping/dist/types/sort.d.ts new file mode 100644 index 0000000..bcc1395 --- /dev/null +++ b/node_modules/@jridgewell/trace-mapping/dist/types/sort.d.ts @@ -0,0 +1,2 @@ +import type { SourceMapSegment } from './types'; +export default function maybeSort(mappings: SourceMapSegment[][], owned: boolean): SourceMapSegment[][]; diff --git a/node_modules/@jridgewell/trace-mapping/dist/types/strip-filename.d.ts b/node_modules/@jridgewell/trace-mapping/dist/types/strip-filename.d.ts new file mode 100644 index 0000000..bead5c1 --- /dev/null +++ b/node_modules/@jridgewell/trace-mapping/dist/types/strip-filename.d.ts @@ -0,0 +1,4 @@ +/** + * Removes everything after the last "/", but leaves the slash. + */ +export default function stripFilename(path: string | undefined | null): string; diff --git a/node_modules/@jridgewell/trace-mapping/dist/types/trace-mapping.d.ts b/node_modules/@jridgewell/trace-mapping/dist/types/trace-mapping.d.ts new file mode 100644 index 0000000..b4dd953 --- /dev/null +++ b/node_modules/@jridgewell/trace-mapping/dist/types/trace-mapping.d.ts @@ -0,0 +1,43 @@ +import type { SourceMapV3, DecodedSourceMap, EncodedSourceMap, InvalidMapping, OriginalMapping, SourceMapSegment, SourceMapInput, Needle, SourceMap, EachMapping } from './types'; +export type { SourceMapSegment, SourceMapInput, DecodedSourceMap, EncodedSourceMap, InvalidMapping, OriginalMapping as Mapping, OriginalMapping, EachMapping, } from './types'; +/** + * Returns the encoded (VLQ string) form of the SourceMap's mappings field. + */ +export declare let encodedMappings: (map: TraceMap) => EncodedSourceMap['mappings']; +/** + * Returns the decoded (array of lines of segments) form of the SourceMap's mappings field. + */ +export declare let decodedMappings: (map: TraceMap) => Readonly<DecodedSourceMap['mappings']>; +/** + * A low-level API to find the segment associated with a generated line/column (think, from a + * stack trace). Line and column here are 0-based, unlike `originalPositionFor`. + */ +export declare let traceSegment: (map: TraceMap, line: number, column: number) => Readonly<SourceMapSegment> | null; +/** + * A higher-level API to find the source/line/column associated with a generated line/column + * (think, from a stack trace). Line is 1-based, but column is 0-based, due to legacy behavior in + * `source-map` library. + */ +export declare let originalPositionFor: (map: TraceMap, needle: Needle) => OriginalMapping | InvalidMapping; +/** + * Iterates each mapping in generated position order. + */ +export declare let eachMapping: (map: TraceMap, cb: (mapping: EachMapping) => void) => void; +/** + * A helper that skips sorting of the input map's mappings array, which can be expensive for larger + * maps. + */ +export declare let presortedDecodedMap: (map: DecodedSourceMap, mapUrl?: string) => TraceMap; +export declare class TraceMap implements SourceMap { +    version: SourceMapV3['version']; +    file: SourceMapV3['file']; +    names: SourceMapV3['names']; +    sourceRoot: SourceMapV3['sourceRoot']; +    sources: SourceMapV3['sources']; +    sourcesContent: SourceMapV3['sourcesContent']; +    resolvedSources: string[]; +    private _encoded; +    private _decoded; +    private _binarySearchMemo; +    constructor(map: SourceMapInput, mapUrl?: string | null); +} diff --git a/node_modules/@jridgewell/trace-mapping/dist/types/types.d.ts b/node_modules/@jridgewell/trace-mapping/dist/types/types.d.ts new file mode 100644 index 0000000..97adfbf --- /dev/null +++ b/node_modules/@jridgewell/trace-mapping/dist/types/types.d.ts @@ -0,0 +1,62 @@ +export interface SourceMapV3 { +    file?: string | null; +    names: string[]; +    sourceRoot?: string; +    sources: (string | null)[]; +    sourcesContent?: (string | null)[]; +    version: 3; +} +declare type Column = number; +declare type SourcesIndex = number; +declare type SourceLine = number; +declare type SourceColumn = number; +declare type NamesIndex = number; +export declare type SourceMapSegment = [Column] | [Column, SourcesIndex, SourceLine, SourceColumn] | [Column, SourcesIndex, SourceLine, SourceColumn, NamesIndex]; +export interface EncodedSourceMap extends SourceMapV3 { +    mappings: string; +} +export interface DecodedSourceMap extends SourceMapV3 { +    mappings: SourceMapSegment[][]; +} +export declare type OriginalMapping = { +    source: string | null; +    line: number; +    column: number; +    name: string | null; +}; +export declare type InvalidMapping = { +    source: null; +    line: null; +    column: null; +    name: null; +}; +export declare type SourceMapInput = string | EncodedSourceMap | DecodedSourceMap; +export declare type Needle = { +    line: number; +    column: number; +}; +export declare type EachMapping = { +    generatedLine: number; +    generatedColumn: number; +    source: null; +    originalLine: null; +    originalColumn: null; +    name: null; +} | { +    generatedLine: number; +    generatedColumn: number; +    source: string | null; +    originalLine: number; +    originalColumn: number; +    name: string | null; +}; +export declare abstract class SourceMap { +    version: SourceMapV3['version']; +    file: SourceMapV3['file']; +    names: SourceMapV3['names']; +    sourceRoot: SourceMapV3['sourceRoot']; +    sources: SourceMapV3['sources']; +    sourcesContent: SourceMapV3['sourcesContent']; +    resolvedSources: SourceMapV3['sources']; +} +export {}; diff --git a/node_modules/@jridgewell/trace-mapping/package.json b/node_modules/@jridgewell/trace-mapping/package.json new file mode 100644 index 0000000..4e51edd --- /dev/null +++ b/node_modules/@jridgewell/trace-mapping/package.json @@ -0,0 +1,71 @@ +{ +  "name": "@jridgewell/trace-mapping", +  "version": "0.3.4", +  "description": "Trace the original position through a source map", +  "keywords": [ +    "source", +    "map" +  ], +  "main": "dist/trace-mapping.umd.js", +  "module": "dist/trace-mapping.mjs", +  "typings": "dist/types/trace-mapping.d.ts", +  "files": [ +    "dist" +  ], +  "exports": { +    ".": { +      "browser": "./dist/trace-mapping.umd.js", +      "require": "./dist/trace-mapping.umd.js", +      "import": "./dist/trace-mapping.mjs" +    }, +    "./package.json": "./package.json" +  }, +  "author": "Justin Ridgewell <justin@ridgewell.name>", +  "repository": { +    "type": "git", +    "url": "git+https://github.com/jridgewell/trace-mapping.git" +  }, +  "license": "MIT", +  "scripts": { +    "benchmark": "run-s build:rollup benchmark:only", +    "benchmark:only": "node benchmark/index.mjs", +    "build": "run-s -n build:*", +    "build:rollup": "rollup -c rollup.config.js", +    "build:ts": "tsc --project tsconfig.build.json", +    "lint": "run-s -n lint:*", +    "lint:prettier": "npm run test:lint:prettier -- --write", +    "lint:ts": "npm run test:lint:ts -- --fix", +    "prebuild": "rm -rf dist", +    "prepublishOnly": "npm run preversion", +    "preversion": "run-s test build", +    "test": "run-s -n test:lint test:only", +    "test:debug": "ava debug", +    "test:lint": "run-s -n test:lint:*", +    "test:lint:prettier": "prettier --check '{src,test}/**/*.ts'", +    "test:lint:ts": "eslint '{src,test}/**/*.ts'", +    "test:only": "c8 ava", +    "test:watch": "ava --watch" +  }, +  "devDependencies": { +    "@rollup/plugin-typescript": "8.3.0", +    "@typescript-eslint/eslint-plugin": "5.10.0", +    "@typescript-eslint/parser": "5.10.0", +    "ava": "4.0.1", +    "benchmark": "2.1.4", +    "c8": "7.11.0", +    "esbuild": "0.14.14", +    "esbuild-node-loader": "0.6.4", +    "eslint": "8.7.0", +    "eslint-config-prettier": "8.3.0", +    "npm-run-all": "4.1.5", +    "prettier": "2.5.1", +    "rollup": "2.64.0", +    "source-map": "0.6.1", +    "source-map-js": "1.0.2", +    "typescript": "4.5.4" +  }, +  "dependencies": { +    "@jridgewell/resolve-uri": "^3.0.3", +    "@jridgewell/sourcemap-codec": "^1.4.10" +  } +}  | 
