Minimal implementation of source-map specification described in:
npm i minimal-source-map
- parseBase64VLQSegment(string): given a Base 64 VLQ segment, e.g,,
ABCDfrom mappings, return 1,4 or 5 variable length array of integers.
- TODO: throw exceptions if wrong number of elements is returned.
- See: Proposed Format.
source, extract a comment of the format
Background and Rationale
- At HackIllinois 2019, Ben Coe suggested the idea of rewriting a lightweight Source Map for usage with Node. The current solutions have a couple of issues that we wanted to counter:
- Current source map is too large: it adds another chunk to Node
- Asynchronous: when exceptions are thrown, you only have one program loop to deal with what needs to happen before the program exits. Our rewrite is not async. Background on source mapping
- Minimized and combined files benefit performance, but the linked generated files are difficult to read and even worse to debug. Source maps ascertain where the original locations in the code are, but can give improper locations back to the user: for example, an exception can be thrown on "line 1:900," but the actual location was line 26:35.
- Source maps aid with debugging. There are also currently exisiting APIs, but they are insufficiently lightweight for efficient Node use. Therefore, we wanted to spike a barebones synchronous implementation.
- Worked based off of the Proposed Format. Began by creating a basic base64 encoding reader.
- Created a segment parser that would take in a segment and parsed it into individual values. This required reading the continuation and signage bits on each character of the segment.
- The least significant bit was the furthest left. In every segment, the first character is special because it has both a continuation and a signage bit. Following bits do not use the signage bit.
- The continuation bit is the first bit in the binary representation, and the last bit is the signage bit.
- Because following bits do not have the signage bit, the actual data contained by the character are the bits ignoring continuation.
- Continuation required shifting the segment: values are read from right to left, so the new value getting read in had to be shifted right 5 places before adding in the old value.
- A lot of the mathematics utilize bit wise binary comparisons: this allows us to determine the sign and the continuation bits in multiple instances
- Got source URL through some regex and following regulation standards.
- Currently: NPM Package Publication
- Work on exception handling and taking user to actual sources of error
- Implementing more tracing of locations
- Process more utilizing the source URL