vite 2.8.0-beta.3 → 2.8.0-beta.7

package/dist/node/chunks/{dep-a5ab6d86.js → dep-c9c9d3e5.js}

@@ -10,7 +10,7 @@ var require$$0$5 = require('url');
 var require$$1$3 = require('http');
 var require$$0$8 = require('stream');
 var require$$1 = require('os');
-var resolve$3 = require('resolve');
+var resolve$4 = require('resolve');
 var require$$0$6 = require('module');
 var perf_hooks = require('perf_hooks');
 var require$$1$4 = require('https');
@@ -50,7 +50,7 @@ var require$$0__default$5 = /*#__PURE__*/_interopDefaultLegacy(require$$0$5);
 var require$$1__default$2 = /*#__PURE__*/_interopDefaultLegacy(require$$1$3);
 var require$$0__default$2 = /*#__PURE__*/_interopDefaultLegacy(require$$0$8);
 var require$$1__default = /*#__PURE__*/_interopDefaultLegacy(require$$1);
-var resolve__default = /*#__PURE__*/_interopDefaultLegacy(resolve$3);
+var resolve__default = /*#__PURE__*/_interopDefaultLegacy(resolve$4);
 var require$$0__default$4 = /*#__PURE__*/_interopDefaultLegacy(require$$0$6);
 var require$$1__default$4 = /*#__PURE__*/_interopDefaultLegacy(require$$1$4);
 var require$$0__default$6 = /*#__PURE__*/_interopDefaultLegacy(require$$0$7);
@@ -1222,10 +1222,10 @@ const KNOWN_ASSET_TYPES = [
 const DEFAULT_ASSETS_RE = new RegExp(`\\.(` + KNOWN_ASSET_TYPES.join('|') + `)(\\?.*)?$`);
 const DEP_VERSION_RE = /[\?&](v=[\w\.-]+)\b/;
 
-var charToInteger$1 = {};
-var chars$2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';
-for (var i$3 = 0; i$3 < chars$2.length; i$3++) {
-    charToInteger$1[chars$2.charCodeAt(i$3)] = i$3;
+var charToInteger = {};
+var chars$1 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';
+for (var i$2 = 0; i$2 < chars$1.length; i$2++) {
+    charToInteger[chars$1.charCodeAt(i$2)] = i$2;
 }
 function decode(mappings) {
     var decoded = [];
@@ -1252,7 +1252,7 @@ function decode(mappings) {
             segment[0] = 0;
         }
         else {
-            var integer = charToInteger$1[c];
+            var integer = charToInteger[c];
             if (integer === undefined) {
                 throw new Error('Invalid character (' + String.fromCharCode(c) + ')');
             }
@@ -1293,7 +1293,7 @@ function segmentify(line, segment, j) {
     else if (j === 1)
         line.push([segment[0]]);
 }
-function encode$1(decoded) {
+function encode(decoded) {
     var sourceFileIndex = 0; // second field
     var sourceCodeLine = 0; // third field
     var sourceCodeColumn = 0; // fourth field
@@ -1309,19 +1309,19 @@ function encode$1(decoded) {
         var lineMappings = [];
         for (var _i = 0, line_1 = line; _i < line_1.length; _i++) {
             var segment = line_1[_i];
-            var segmentMappings = encodeInteger$1(segment[0] - generatedCodeColumn);
+            var segmentMappings = encodeInteger(segment[0] - generatedCodeColumn);
             generatedCodeColumn = segment[0];
             if (segment.length > 1) {
                 segmentMappings +=
-                    encodeInteger$1(segment[1] - sourceFileIndex) +
-                        encodeInteger$1(segment[2] - sourceCodeLine) +
-                        encodeInteger$1(segment[3] - sourceCodeColumn);
+                    encodeInteger(segment[1] - sourceFileIndex) +
+                        encodeInteger(segment[2] - sourceCodeLine) +
+                        encodeInteger(segment[3] - sourceCodeColumn);
                 sourceFileIndex = segment[1];
                 sourceCodeLine = segment[2];
                 sourceCodeColumn = segment[3];
             }
             if (segment.length === 5) {
-                segmentMappings += encodeInteger$1(segment[4] - nameIndex);
+                segmentMappings += encodeInteger(segment[4] - nameIndex);
                 nameIndex = segment[4];
             }
             lineMappings.push(segmentMappings);
@@ -1330,7 +1330,7 @@ function encode$1(decoded) {
     }
     return mappings;
 }
-function encodeInteger$1(num) {
+function encodeInteger(num) {
     var result = '';
     num = num < 0 ? (-num << 1) | 1 : num << 1;
     do {
@@ -1339,11 +1339,186 @@ function encodeInteger$1(num) {
         if (num > 0) {
             clamped |= 32;
         }
-        result += chars$2[clamped];
+        result += chars$1[clamped];
     } while (num > 0);
     return result;
 }
 
+// Matches the scheme of a URL, eg "http://"
+const schemeRegex = /^[\w+.-]+:\/\//;
+/**
+ * Matches the parts of a URL:
+ * 1. Scheme, including ":", guaranteed.
+ * 2. User/password, including "@", optional.
+ * 3. Host, guaranteed.
+ * 4. Port, including ":", optional.
+ * 5. Path, including "/", optional.
+ */
+const urlRegex = /^([\w+.-]+:)\/\/([^@]*@)?([^:/]*)(:\d+)?(\/[^#?]*)?/;
+function isAbsoluteUrl(input) {
+    return schemeRegex.test(input);
+}
+function isSchemeRelativeUrl(input) {
+    return input.startsWith('//');
+}
+function isAbsolutePath(input) {
+    return input.startsWith('/');
+}
+function parseAbsoluteUrl(input) {
+    const match = urlRegex.exec(input);
+    return {
+        scheme: match[1],
+        user: match[2] || '',
+        host: match[3],
+        port: match[4] || '',
+        path: match[5] || '/',
+        relativePath: false,
+    };
+}
+function parseUrl$2(input) {
+    if (isSchemeRelativeUrl(input)) {
+        const url = parseAbsoluteUrl('http:' + input);
+        url.scheme = '';
+        return url;
+    }
+    if (isAbsolutePath(input)) {
+        const url = parseAbsoluteUrl('http://foo.com' + input);
+        url.scheme = '';
+        url.host = '';
+        return url;
+    }
+    if (!isAbsoluteUrl(input)) {
+        const url = parseAbsoluteUrl('http://foo.com/' + input);
+        url.scheme = '';
+        url.host = '';
+        url.relativePath = true;
+        return url;
+    }
+    return parseAbsoluteUrl(input);
+}
+function stripPathFilename(path) {
+    // If a path ends with a parent directory "..", then it's a relative path with excess parent
+    // paths. It's not a file, so we can't strip it.
+    if (path.endsWith('/..'))
+        return path;
+    const index = path.lastIndexOf('/');
+    return path.slice(0, index + 1);
+}
+function mergePaths(url, base) {
+    // If we're not a relative path, then we're an absolute path, and it doesn't matter what base is.
+    if (!url.relativePath)
+        return;
+    normalizePath$5(base);
+    // If the path is just a "/", then it was an empty path to begin with (remember, we're a relative
+    // path).
+    if (url.path === '/') {
+        url.path = base.path;
+    }
+    else {
+        // Resolution happens relative to the base path's directory, not the file.
+        url.path = stripPathFilename(base.path) + url.path;
+    }
+    // If the base path is absolute, then our path is now absolute too.
+    url.relativePath = base.relativePath;
+}
+/**
+ * The path can have empty directories "//", unneeded parents "foo/..", or current directory
+ * "foo/.". We need to normalize to a standard representation.
+ */
+function normalizePath$5(url) {
+    const { relativePath } = url;
+    const pieces = url.path.split('/');
+    // We need to preserve the first piece always, so that we output a leading slash. The item at
+    // pieces[0] is an empty string.
+    let pointer = 1;
+    // Positive is the number of real directories we've output, used for popping a parent directory.
+    // Eg, "foo/bar/.." will have a positive 2, and we can decrement to be left with just "foo".
+    let positive = 0;
+    // We need to keep a trailing slash if we encounter an empty directory (eg, splitting "foo/" will
+    // generate `["foo", ""]` pieces). And, if we pop a parent directory. But once we encounter a
+    // real directory, we won't need to append, unless the other conditions happen again.
+    let addTrailingSlash = false;
+    for (let i = 1; i < pieces.length; i++) {
+        const piece = pieces[i];
+        // An empty directory, could be a trailing slash, or just a double "//" in the path.
+        if (!piece) {
+            addTrailingSlash = true;
+            continue;
+        }
+        // If we encounter a real directory, then we don't need to append anymore.
+        addTrailingSlash = false;
+        // A current directory, which we can always drop.
+        if (piece === '.')
+            continue;
+        // A parent directory, we need to see if there are any real directories we can pop. Else, we
+        // have an excess of parents, and we'll need to keep the "..".
+        if (piece === '..') {
+            if (positive) {
+                addTrailingSlash = true;
+                positive--;
+                pointer--;
+            }
+            else if (relativePath) {
+                // If we're in a relativePath, then we need to keep the excess parents. Else, in an absolute
+                // URL, protocol relative URL, or an absolute path, we don't need to keep excess.
+                pieces[pointer++] = piece;
+            }
+            continue;
+        }
+        // We've encountered a real directory. Move it to the next insertion pointer, which accounts for
+        // any popped or dropped directories.
+        pieces[pointer++] = piece;
+        positive++;
+    }
+    let path = '';
+    for (let i = 1; i < pointer; i++) {
+        path += '/' + pieces[i];
+    }
+    if (!path || (addTrailingSlash && !path.endsWith('/..'))) {
+        path += '/';
+    }
+    url.path = path;
+}
+/**
+ * Attempts to resolve `input` URL/path relative to `base`.
+ */
+function resolve$3(input, base) {
+    if (!input && !base)
+        return '';
+    const url = parseUrl$2(input);
+    // If we have a base, and the input isn't already an absolute URL, then we need to merge.
+    if (base && !url.scheme) {
+        const baseUrl = parseUrl$2(base);
+        url.scheme = baseUrl.scheme;
+        // If there's no host, then we were just a path.
+        if (!url.host || baseUrl.scheme === 'file:') {
+            // The host, user, and port are joined, you can't copy one without the others.
+            url.user = baseUrl.user;
+            url.host = baseUrl.host;
+            url.port = baseUrl.port;
+        }
+        mergePaths(url, baseUrl);
+    }
+    normalizePath$5(url);
+    // If the input (and base, if there was one) are both relative, then we need to output a relative.
+    if (url.relativePath) {
+        // The first char is always a "/".
+        const path = url.path.slice(1);
+        if (!path)
+            return '.';
+        // If base started with a leading ".", or there is no base and input started with a ".", then we
+        // need to ensure that the relative path starts with a ".". We don't know if relative starts
+        // with a "..", though, so check before prepending.
+        const keepRelative = (base || input).startsWith('.');
+        return !keepRelative || path.startsWith('.') ? path : './' + path;
+    }
+    // If there's no host (and no scheme/user/port), then we need to output an absolute path.
+    if (!url.scheme && !url.host)
+        return url.path;
+    // We're outputting either an absolute URL, or a protocol relative one.
+    return `${url.scheme}//${url.user}${url.host}${url.port}${url.path}`;
+}
+
 /**
  * Copyright 2019 The AMP HTML Authors. All Rights Reserved.
  *
@@ -1468,150 +1643,6 @@ class OriginalSource {
     }
 }
 
-/* istanbul ignore next */
-const Url$1 = (typeof URL !== 'undefined' ? URL : require('url').URL);
-// Matches "..", which must be preceeded by "/" or the start of the string, and
-// must be followed by a "/". We do not eat the following "/", so that the next
-// iteration can match on it.
-const parentRegex = /(^|\/)\.\.(?=\/|$)/g;
-function isAbsoluteUrl(url) {
-    try {
-        return !!new Url$1(url);
-    }
-    catch (e) {
-        return false;
-    }
-}
-/**
- * Creates a directory name that is guaranteed to not be in `str`.
- */
-function uniqInStr(str) {
-    let uniq = String(Math.random()).slice(2);
-    while (str.indexOf(uniq) > -1) {
-        /* istanbul ignore next */
-        uniq += uniq;
-    }
-    return uniq;
-}
-/**
- * Removes the filename from the path (everything trailing the last "/"). This
- * is only safe to call on a path, never call with an absolute or protocol
- * relative URL.
- */
-function stripPathFilename(path) {
-    path = normalizePath$5(path);
-    const index = path.lastIndexOf('/');
-    return path.slice(0, index + 1);
-}
-/**
- * Normalizes a protocol-relative URL, but keeps it protocol relative by
- * stripping out the protocl before returning it.
- */
-function normalizeProtocolRelative(input, absoluteBase) {
-    const { href, protocol } = new Url$1(input, absoluteBase);
-    return href.slice(protocol.length);
-}
-/**
- * Normalizes a simple path (one that has no ".."s, or is absolute so ".."s can
- * be normalized absolutely).
- */
-function normalizeSimplePath(input) {
-    const { href } = new Url$1(input, 'https://foo.com/');
-    return href.slice('https://foo.com/'.length);
-}
-/**
- * Normalizes a path, ensuring that excess ".."s are preserved for relative
- * paths in the output.
- *
- * If the input is absolute, this will return an absolutey normalized path, but
- * it will not have a leading "/".
- *
- * If the input has a leading "..", the output will have a leading "..".
- *
- * If the input has a leading ".", the output will not have a leading "."
- * unless there are too many ".."s, in which case there will be a leading "..".
- */
-function normalizePath$5(input) {
-    // If there are no ".."s, we can treat this as if it were an absolute path.
-    // The return won't be an absolute path, so it's easy.
-    if (!parentRegex.test(input))
-        return normalizeSimplePath(input);
-    // We already found one "..". Let's see how many there are.
-    let total = 1;
-    while (parentRegex.test(input))
-        total++;
-    // If there are ".."s, we need to prefix the the path with the same number of
-    // unique directories. This is to ensure that we "remember" how many parent
-    // directories we are accessing. Eg, "../../.." must keep 3, and "foo/../.."
-    // must keep 1.
-    const uniqDirectory = `z${uniqInStr(input)}/`;
-    // uniqDirectory is just a "z", followed by numbers, followed by a "/". So
-    // generating a runtime regex from it is safe. We'll use this search regex to
-    // strip out our uniq directory names and insert any needed ".."s.
-    const search = new RegExp(`^(?:${uniqDirectory})*`);
-    // Now we can resolve the total path. If there are excess ".."s, they will
-    // eliminate one or more of the unique directories we prefix with.
-    const relative = normalizeSimplePath(uniqDirectory.repeat(total) + input);
-    // We can now count the number of unique directories that were eliminated. If
-    // there were 3, and 1 was eliminated, we know we only need to add 1 "..". If
-    // 2 were eliminated, we need to insert 2 ".."s. If all 3 were eliminated,
-    // then we need 3, etc. This replace is guranteed to match (it may match 0 or
-    // more times), and we can count the total match to see how many were eliminated.
-    return relative.replace(search, (all) => {
-        const leftover = all.length / uniqDirectory.length;
-        return '../'.repeat(total - leftover);
-    });
-}
-/**
- * Attempts to resolve `input` URL relative to `base`.
- */
-function resolve$2(input, base) {
-    if (!base)
-        base = '';
-    // Absolute URLs are very easy to resolve right.
-    if (isAbsoluteUrl(input))
-        return new Url$1(input).href;
-    if (base) {
-        // Absolute URLs are easy...
-        if (isAbsoluteUrl(base))
-            return new Url$1(input, base).href;
-        // If base is protocol relative, we'll resolve with it but keep the result
-        // protocol relative.
-        if (base.startsWith('//'))
-            return normalizeProtocolRelative(input, `https:${base}`);
-    }
-    // Normalize input, but keep it protocol relative. We know base doesn't supply
-    // a protocol, because that would have been handled above.
-    if (input.startsWith('//'))
-        return normalizeProtocolRelative(input, 'https://foo.com/');
-    // We now know that base (if there is one) and input are paths. We've handled
-    // both absolute and protocol-relative variations above.
-    // Absolute paths don't need any special handling, because they cannot have
-    // extra "." or ".."s. That'll all be stripped away. Input takes priority here,
-    // because if input is an absolute path, base path won't affect it in any way.
-    if (input.startsWith('/'))
-        return '/' + normalizeSimplePath(input);
-    // Since input and base are paths, we need to join them to do any further
-    // processing. Paths are joined at the directory level, so we need to remove
-    // the base's filename before joining. We also know that input does not have a
-    // leading slash, and that the stripped base will have a trailing slash if
-    // there are any directories (or it'll be empty).
-    const joined = stripPathFilename(base) + input;
-    // If base is an absolute path, then input will be relative to it.
-    if (base.startsWith('/'))
-        return '/' + normalizeSimplePath(joined);
-    // We now know both base (if there is one) and input are relative paths.
-    const relative = normalizePath$5(joined);
-    // If base started with a leading ".", or there is no base and input started
-    // with a ".", then we need to ensure that the relative path starts with a
-    // ".". We don't know if relative starts with a "..", though, so check before
-    // prepending.
-    if ((base || input).startsWith('.') && !relative.startsWith('.')) {
-        return './' + relative;
-    }
-    return relative;
-}
-
 /**
  * Copyright 2019 The AMP HTML Authors. All Rights Reserved.
  *
@@ -1627,13 +1658,13 @@ function resolve$2(input, base) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-function resolve$1$1(input, base) {
+function resolve$2(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 resolve$2(input, base);
+    return resolve$3(input, base);
 }
 
 /**
@@ -1952,7 +1983,7 @@ function buildSourceMapTree(input, loader, relativeRoot) {
     const children = sources.map((sourceFile, i) => {
         // Each source file is loaded relative to the sourcemap's own sourceRoot,
         // which is itself relative to the sourcemap's parent.
-        const uri = resolve$1$1(sourceFile || '', resolve$1$1(sourceRoot || '', stripFilename(relativeRoot)));
+        const uri = resolve$2(sourceFile || '', resolve$2(sourceRoot || '', stripFilename(relativeRoot)));
         // Use the provided loader callback to retrieve the file's sourcemap.
         // TODO: We should eventually support async loading of sourcemap files.
         const sourceMap = loader(uri);
@@ -1999,7 +2030,7 @@ class SourceMap$1 {
         this.version = 3; // SourceMap spec says this should be first.
         if ('file' in map)
             this.file = map.file;
-        this.mappings = options.decodedMappings ? map.mappings : encode$1(map.mappings);
+        this.mappings = options.decodedMappings ? map.mappings : encode(map.mappings);
         this.names = map.names;
         // TODO: We first need to make all source URIs relative to the sourceRoot
         // before we can support a sourceRoot.
@@ -2059,7 +2090,7 @@ function unwrapId$1(id) {
     return id.startsWith(VALID_ID_PREFIX) ? id.slice(VALID_ID_PREFIX.length) : id;
 }
 const flattenId = (id) => id.replace(/(\s*>\s*)/g, '__').replace(/[\/\.]/g, '_');
-const normalizeId$1 = (id) => id.replace(/(\s*>\s*)/g, ' > ');
+const normalizeId = (id) => id.replace(/(\s*>\s*)/g, ' > ');
 //TODO: revisit later to see if the edge case that "compiling using node v12 code to be run in node v16 in the server" is what we intend to support.
 const builtins$2 = new Set([
     ...require$$0$6.builtinModules,
@@ -2827,62 +2858,6 @@ function throttle(fn) {
     };
 }
 
-var charToInteger = {};
-var chars$1 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';
-for (var i$2 = 0; i$2 < chars$1.length; i$2++) {
-    charToInteger[chars$1.charCodeAt(i$2)] = i$2;
-}
-function encode(decoded) {
-    var sourceFileIndex = 0; // second field
-    var sourceCodeLine = 0; // third field
-    var sourceCodeColumn = 0; // fourth field
-    var nameIndex = 0; // fifth field
-    var mappings = '';
-    for (var i = 0; i < decoded.length; i++) {
-        var line = decoded[i];
-        if (i > 0)
-            mappings += ';';
-        if (line.length === 0)
-            continue;
-        var generatedCodeColumn = 0; // first field
-        var lineMappings = [];
-        for (var _i = 0, line_1 = line; _i < line_1.length; _i++) {
-            var segment = line_1[_i];
-            var segmentMappings = encodeInteger(segment[0] - generatedCodeColumn);
-            generatedCodeColumn = segment[0];
-            if (segment.length > 1) {
-                segmentMappings +=
-                    encodeInteger(segment[1] - sourceFileIndex) +
-                        encodeInteger(segment[2] - sourceCodeLine) +
-                        encodeInteger(segment[3] - sourceCodeColumn);
-                sourceFileIndex = segment[1];
-                sourceCodeLine = segment[2];
-                sourceCodeColumn = segment[3];
-            }
-            if (segment.length === 5) {
-                segmentMappings += encodeInteger(segment[4] - nameIndex);
-                nameIndex = segment[4];
-            }
-            lineMappings.push(segmentMappings);
-        }
-        mappings += lineMappings.join(',');
-    }
-    return mappings;
-}
-function encodeInteger(num) {
-    var result = '';
-    num = num < 0 ? (-num << 1) | 1 : num << 1;
-    do {
-        var clamped = num & 31;
-        num >>>= 5;
-        if (num > 0) {
-            clamped |= 32;
-        }
-        result += chars$1[clamped];
-    } while (num > 0);
-    return result;
-}
-
 var BitSet = function BitSet(arg) {
 	this.bits = arg instanceof BitSet ? arg.bits.slice() : [];
 };
@@ -5358,12 +5333,12 @@ var toRegexRange_1 = toRegexRange$1;
  * Licensed under the MIT License.
  */
 
-const util$9 = require$$0__default$1;
+const util$6 = require$$0__default$1;
 const toRegexRange = toRegexRange_1;
 
 const isObject$1 = val => val !== null && typeof val === 'object' && !Array.isArray(val);
 
-const transform = toNumber => {
+const transform$1 = toNumber => {
   return value => toNumber === true ? Number(value) : String(value);
 };
 
@@ -5463,7 +5438,7 @@ const toRegex = (start, end, options) => {
 };
 
 const rangeError = (...args) => {
-  return new RangeError('Invalid range arguments: ' + util$9.inspect(...args));
+  return new RangeError('Invalid range arguments: ' + util$6.inspect(...args));
 };
 
 const invalidRange = (start, end, options) => {
@@ -5500,7 +5475,7 @@ const fillNumbers = (start, end, step = 1, options = {}) => {
   let padded = zeros(startString) || zeros(endString) || zeros(stepString);
   let maxLen = padded ? Math.max(startString.length, endString.length, stepString.length) : 0;
   let toNumber = padded === false && stringify$7(start, end, options) === false;
-  let format = options.transform || transform(toNumber);
+  let format = options.transform || transform$1(toNumber);
 
   if (options.toRegex && step === 1) {
     return toRange(toMaxLen(start, maxLen), toMaxLen(end, maxLen), true, options);
@@ -5685,7 +5660,7 @@ const append$1 = (queue = '', stash = '', enclose = false) => {
   return utils$g.flatten(result);
 };
 
-const expand$3 = (ast, options = {}) => {
+const expand$4 = (ast, options = {}) => {
   let rangeLimit = options.rangeLimit === void 0 ? 1000 : options.rangeLimit;
 
   let walk = (node, parent = {}) => {
@@ -5765,7 +5740,7 @@ const expand$3 = (ast, options = {}) => {
   return utils$g.flatten(walk(ast));
 };
 
-var expand_1 = expand$3;
+var expand_1$1 = expand$4;
 
 var constants$6 = {
   MAX_LENGTH: 1024 * 64,
@@ -6154,7 +6129,7 @@ var parse_1$2 = parse$m;
 
 const stringify$4 = stringify$8;
 const compile = compile_1;
-const expand$2 = expand_1;
+const expand$3 = expand_1$1;
 const parse$l = parse_1$2;
 
 /**
@@ -6274,7 +6249,7 @@ braces$2.expand = (input, options = {}) => {
     input = braces$2.parse(input, options);
   }
 
-  let result = expand$2(input, options);
+  let result = expand$3(input, options);
 
   // filter out empty strings if specified
   if (options.noempty === true) {
@@ -8376,7 +8351,7 @@ var picomatch_1 = picomatch$4;
 
 var picomatch$3 = picomatch_1;
 
-const util$8 = require$$0__default$1;
+const util$5 = require$$0__default$1;
 const braces$1 = braces_1;
 const picomatch$2 = picomatch$3;
 const utils$b = utils$f;
@@ -8563,7 +8538,7 @@ micromatch$1.not = (list, patterns, options = {}) => {
 
 micromatch$1.contains = (str, pattern, options) => {
   if (typeof str !== 'string') {
-    throw new TypeError(`Expected a string: "${util$8.inspect(str)}"`);
+    throw new TypeError(`Expected a string: "${util$5.inspect(str)}"`);
   }
 
   if (Array.isArray(pattern)) {
@@ -8709,7 +8684,7 @@ micromatch$1.every = (list, patterns, options) => {
 
 micromatch$1.all = (str, patterns, options) => {
   if (typeof str !== 'string') {
-    throw new TypeError(`Expected a string: "${util$8.inspect(str)}"`);
+    throw new TypeError(`Expected a string: "${util$5.inspect(str)}"`);
   }
 
   return [].concat(patterns).every(p => picomatch$2(p, options)(str));
@@ -8850,10 +8825,10 @@ const micromatch = micromatch_1;
 const GLOBSTAR$2 = '**';
 const ESCAPE_SYMBOL = '\\';
 const COMMON_GLOB_SYMBOLS_RE = /[*?]|^!/;
-const REGEX_CHARACTER_CLASS_SYMBOLS_RE = /\[.*]/;
-const REGEX_GROUP_SYMBOLS_RE = /(?:^|[^!*+?@])\(.*\|.*\)/;
-const GLOB_EXTENSION_SYMBOLS_RE = /[!*+?@]\(.*\)/;
-const BRACE_EXPANSIONS_SYMBOLS_RE = /{.*(?:,|\.\.).*}/;
+const REGEX_CHARACTER_CLASS_SYMBOLS_RE = /\[[^[]*]/;
+const REGEX_GROUP_SYMBOLS_RE = /(?:^|[^!*+?@])\([^(]*\|[^|]*\)/;
+const GLOB_EXTENSION_SYMBOLS_RE = /[!*+?@]\([^(]*\)/;
+const BRACE_EXPANSION_SEPARATORS_RE = /,|\.\./;
 function isStaticPattern(pattern, options = {}) {
     return !isDynamicPattern(pattern, options);
 }
@@ -8880,12 +8855,24 @@ function isDynamicPattern(pattern, options = {}) {
     if (options.extglob !== false && GLOB_EXTENSION_SYMBOLS_RE.test(pattern)) {
         return true;
     }
-    if (options.braceExpansion !== false && BRACE_EXPANSIONS_SYMBOLS_RE.test(pattern)) {
+    if (options.braceExpansion !== false && hasBraceExpansion(pattern)) {
         return true;
     }
     return false;
 }
 pattern$1.isDynamicPattern = isDynamicPattern;
+function hasBraceExpansion(pattern) {
+    const openingBraceIndex = pattern.indexOf('{');
+    if (openingBraceIndex === -1) {
+        return false;
+    }
+    const closingBraceIndex = pattern.indexOf('}', openingBraceIndex + 1);
+    if (closingBraceIndex === -1) {
+        return false;
+    }
+    const braceContent = pattern.slice(openingBraceIndex, closingBraceIndex);
+    return BRACE_EXPANSION_SEPARATORS_RE.test(braceContent);
+}
 function convertToPositivePattern(pattern) {
     return isNegativePattern(pattern) ? pattern.slice(1) : pattern;
 }
@@ -9272,6 +9259,29 @@ function convertPatternGroupToTask(base, positive, negative, dynamic) {
 }
 tasks.convertPatternGroupToTask = convertPatternGroupToTask;
 
+var patterns = {};
+
+Object.defineProperty(patterns, "__esModule", { value: true });
+patterns.removeDuplicateSlashes = patterns.transform = void 0;
+/**
+ * Matches a sequence of two or more consecutive slashes, excluding the first two slashes at the beginning of the string.
+ * The latter is due to the presence of the device path at the beginning of the UNC path.
+ * @todo rewrite to negative lookbehind with the next major release.
+ */
+const DOUBLE_SLASH_RE$1 = /(?!^)\/{2,}/g;
+function transform(patterns) {
+    return patterns.map((pattern) => removeDuplicateSlashes(pattern));
+}
+patterns.transform = transform;
+/**
+ * This package only works with forward slashes as a path separator.
+ * Because of this, we cannot use the standard `path.normalize` method, because on Windows platform it will use of backslashes.
+ */
+function removeDuplicateSlashes(pattern) {
+    return pattern.replace(DOUBLE_SLASH_RE$1, '/');
+}
+patterns.removeDuplicateSlashes = removeDuplicateSlashes;
+
 var async$6 = {};
 
 var stream$2 = {};
@@ -9834,8 +9844,8 @@ function fastqueue (context, worker, concurrency) {
 
   var self = {
     push: push,
-    drain: noop$3,
-    saturated: noop$3,
+    drain: noop$2,
+    saturated: noop$2,
     pause: pause,
     paused: false,
     concurrency: concurrency,
@@ -9845,7 +9855,7 @@ function fastqueue (context, worker, concurrency) {
     length: length,
     getQueue: getQueue,
     unshift: unshift,
-    empty: noop$3,
+    empty: noop$2,
     kill: kill,
     killAndDrain: killAndDrain,
     error: error
@@ -9904,7 +9914,7 @@ function fastqueue (context, worker, concurrency) {
     current.context = context;
     current.release = release;
     current.value = value;
-    current.callback = done || noop$3;
+    current.callback = done || noop$2;
     current.errorHandler = errorHandler;
 
     if (_running === self.concurrency || self.paused) {
@@ -9928,7 +9938,7 @@ function fastqueue (context, worker, concurrency) {
     current.context = context;
     current.release = release;
     current.value = value;
-    current.callback = done || noop$3;
+    current.callback = done || noop$2;
 
     if (_running === self.concurrency || self.paused) {
       if (queueHead) {
@@ -9972,14 +9982,14 @@ function fastqueue (context, worker, concurrency) {
   function kill () {
     queueHead = null;
     queueTail = null;
-    self.drain = noop$3;
+    self.drain = noop$2;
   }
 
   function killAndDrain () {
     queueHead = null;
     queueTail = null;
     self.drain();
-    self.drain = noop$3;
+    self.drain = noop$2;
   }
 
   function error (handler) {
@@ -9987,13 +9997,13 @@ function fastqueue (context, worker, concurrency) {
   }
 }
 
-function noop$3 () {}
+function noop$2 () {}
 
 function Task () {
   this.value = null;
-  this.callback = noop$3;
+  this.callback = noop$2;
   this.next = null;
-  this.release = noop$3;
+  this.release = noop$2;
   this.context = null;
   this.errorHandler = null;
 
@@ -10004,7 +10014,7 @@ function Task () {
     var errorHandler = self.errorHandler;
     var val = self.value;
     self.value = null;
-    self.callback = noop$3;
+    self.callback = noop$2;
     if (self.errorHandler) {
       errorHandler(err, val);
     }
@@ -10052,7 +10062,7 @@ function queueAsPromised (context, worker, concurrency) {
     // Let's fork the promise chain to
     // make the error bubble up to the user but
     // not lead to a unhandledRejection
-    p.catch(noop$3);
+    p.catch(noop$2);
 
     return p
   }
@@ -10071,7 +10081,7 @@ function queueAsPromised (context, worker, concurrency) {
     // Let's fork the promise chain to
     // make the error bubble up to the user but
     // not lead to a unhandledRejection
-    p.catch(noop$3);
+    p.catch(noop$2);
 
     return p
   }
@@ -10740,9 +10750,13 @@ class EntryFilter {
         const fullpath = utils$3.path.makeAbsolute(this._settings.cwd, entryPath);
         return utils$3.pattern.matchAny(fullpath, patternsRe);
     }
+    /**
+     * First, just trying to apply patterns to the path.
+     * Second, trying to apply patterns to the path with final slash.
+     */
     _isMatchToPatterns(entryPath, patternsRe) {
         const filepath = utils$3.path.removeLeadingDotSegment(entryPath);
-        return utils$3.pattern.matchAny(filepath, patternsRe);
+        return utils$3.pattern.matchAny(filepath, patternsRe) || utils$3.pattern.matchAny(filepath + '/', patternsRe);
     }
 }
 entry$1.default = EntryFilter;
@@ -11033,6 +11047,7 @@ exports.default = Settings;
 }(settings));
 
 const taskManager = tasks;
+const patternManager = patterns;
 const async_1 = async$6;
 const stream_1 = stream;
 const sync_1 = sync$5;
@@ -11066,7 +11081,7 @@ async function FastGlob(source, options) {
     FastGlob.stream = stream;
     function generateTasks(source, options) {
         assertPatternsInput(source);
-        const patterns = [].concat(source);
+        const patterns = patternManager.transform([].concat(source));
         const settings = new settings_1.default(options);
         return taskManager.generate(patterns, settings);
     }
@@ -11084,7 +11099,7 @@ async function FastGlob(source, options) {
     FastGlob.escapePath = escapePath;
 })(FastGlob || (FastGlob = {}));
 function getWorks(source, _Provider, options) {
-    const patterns = [].concat(source);
+    const patterns = patternManager.transform([].concat(source));
     const settings = new settings_1.default(options);
     const tasks = taskManager.generate(patterns, settings);
     const provider = new _Provider(settings);
@@ -18679,6 +18694,10 @@ function cssPostPlugin(config) {
             return null;
         },
         async generateBundle(opts, bundle) {
+            // @ts-ignore asset emits are skipped in legacy bundle
+            if (opts.__vite_skip_asset_emit__) {
+                return;
+            }
             // remove empty css chunks and their imports
             if (pureCssChunks.size) {
                 const emptyChunkFiles = [...pureCssChunks]
@@ -18853,7 +18872,7 @@ async function compileCSS(id, code, config, urlReplacer, atImportResolvers, serv
         replacer: urlReplacer
     }));
     if (isModule) {
-        postcssPlugins.unshift((await Promise.resolve().then(function () { return require('./dep-84e12b4e.js'); }).then(function (n) { return n.index; })).default({
+        postcssPlugins.unshift((await Promise.resolve().then(function () { return require('./dep-752d5fd3.js'); }).then(function (n) { return n.index; })).default({
             ...modulesOptions,
             getJSON(cssFileName, _modules, outputFileName) {
                 modules = _modules;
@@ -19313,7 +19332,7 @@ var unicode = {
 	ID_Continue: ID_Continue
 };
 
-var util$7 = {
+var util$4 = {
     isSpaceSeparator (c) {
         return typeof c === 'string' && unicode.Space_Separator.test(c)
     },
@@ -19480,7 +19499,7 @@ const lexStates = {
             return newToken('eof')
         }
 
-        if (util$7.isSpaceSeparator(c)) {
+        if (util$4.isSpaceSeparator(c)) {
             read();
             return
         }
@@ -19647,7 +19666,7 @@ const lexStates = {
             break
 
         default:
-            if (!util$7.isIdStartChar(u)) {
+            if (!util$4.isIdStartChar(u)) {
                 throw invalidIdentifier()
             }
 
@@ -19673,7 +19692,7 @@ const lexStates = {
             return
         }
 
-        if (util$7.isIdContinueChar(c)) {
+        if (util$4.isIdContinueChar(c)) {
             buffer += read();
             return
         }
@@ -19696,7 +19715,7 @@ const lexStates = {
             break
 
         default:
-            if (!util$7.isIdContinueChar(u)) {
+            if (!util$4.isIdContinueChar(u)) {
                 throw invalidIdentifier()
             }
 
@@ -19783,7 +19802,7 @@ const lexStates = {
             return
         }
 
-        if (util$7.isDigit(c)) {
+        if (util$4.isDigit(c)) {
             buffer += read();
             return
         }
@@ -19792,7 +19811,7 @@ const lexStates = {
     },
 
     decimalPointLeading () {
-        if (util$7.isDigit(c)) {
+        if (util$4.isDigit(c)) {
             buffer += read();
             lexState = 'decimalFraction';
             return
@@ -19810,7 +19829,7 @@ const lexStates = {
             return
         }
 
-        if (util$7.isDigit(c)) {
+        if (util$4.isDigit(c)) {
             buffer += read();
             lexState = 'decimalFraction';
             return
@@ -19828,7 +19847,7 @@ const lexStates = {
             return
         }
 
-        if (util$7.isDigit(c)) {
+        if (util$4.isDigit(c)) {
             buffer += read();
             return
         }
@@ -19845,7 +19864,7 @@ const lexStates = {
             return
         }
 
-        if (util$7.isDigit(c)) {
+        if (util$4.isDigit(c)) {
             buffer += read();
             lexState = 'decimalExponentInteger';
             return
@@ -19855,7 +19874,7 @@ const lexStates = {
     },
 
     decimalExponentSign () {
-        if (util$7.isDigit(c)) {
+        if (util$4.isDigit(c)) {
             buffer += read();
             lexState = 'decimalExponentInteger';
             return
@@ -19865,7 +19884,7 @@ const lexStates = {
     },
 
     decimalExponentInteger () {
-        if (util$7.isDigit(c)) {
+        if (util$4.isDigit(c)) {
             buffer += read();
             return
         }
@@ -19874,7 +19893,7 @@ const lexStates = {
     },
 
     hexadecimal () {
-        if (util$7.isHexDigit(c)) {
+        if (util$4.isHexDigit(c)) {
             buffer += read();
             lexState = 'hexadecimalInteger';
             return
@@ -19884,7 +19903,7 @@ const lexStates = {
     },
 
     hexadecimalInteger () {
-        if (util$7.isHexDigit(c)) {
+        if (util$4.isHexDigit(c)) {
             buffer += read();
             return
         }
@@ -19970,7 +19989,7 @@ const lexStates = {
             return
         }
 
-        if (util$7.isIdStartChar(c)) {
+        if (util$4.isIdStartChar(c)) {
             buffer += read();
             lexState = 'identifierName';
             return
@@ -20080,7 +20099,7 @@ function escape$1 () {
 
     case '0':
         read();
-        if (util$7.isDigit(peek())) {
+        if (util$4.isDigit(peek())) {
             throw invalidChar(read())
         }
 
@@ -20130,14 +20149,14 @@ function hexEscape () {
     let buffer = '';
     let c = peek();
 
-    if (!util$7.isHexDigit(c)) {
+    if (!util$4.isHexDigit(c)) {
         throw invalidChar(read())
     }
 
     buffer += read();
 
     c = peek();
-    if (!util$7.isHexDigit(c)) {
+    if (!util$4.isHexDigit(c)) {
         throw invalidChar(read())
     }
 
@@ -20152,7 +20171,7 @@ function unicodeEscape () {
 
     while (count-- > 0) {
         const c = peek();
-        if (!util$7.isHexDigit(c)) {
+        if (!util$4.isHexDigit(c)) {
             throw invalidChar(read())
         }
 
@@ -20567,7 +20586,7 @@ var stringify = function stringify (value, replacer, space) {
                 continue
 
             case '\0':
-                if (util$7.isDigit(value[i + 1])) {
+                if (util$4.isDigit(value[i + 1])) {
                     product += '\\x00';
                     continue
                 }
@@ -20644,12 +20663,12 @@ var stringify = function stringify (value, replacer, space) {
         }
 
         const firstChar = String.fromCodePoint(key.codePointAt(0));
-        if (!util$7.isIdStartChar(firstChar)) {
+        if (!util$4.isIdStartChar(firstChar)) {
             return quoteString(key)
         }
 
         for (let i = firstChar.length; i < key.length; i++) {
-            if (!util$7.isIdContinueChar(String.fromCodePoint(key.codePointAt(i)))) {
+            if (!util$4.isIdContinueChar(String.fromCodePoint(key.codePointAt(i)))) {
                 return quoteString(key)
             }
         }
@@ -21276,7 +21295,7 @@ const assetAttrsConfig = {
 const isAsyncScriptMap = new WeakMap();
 async function traverseHtml(html, filePath, visitor) {
     // lazy load compiler
-    const { parse, transform } = await Promise.resolve().then(function () { return require('./dep-6f0b746c.js'); }).then(function (n) { return n.compilerDom_cjs; });
+    const { parse, transform } = await Promise.resolve().then(function () { return require('./dep-9e561a04.js'); }).then(function (n) { return n.compilerDom_cjs; });
     // @vue/compiler-core doesn't like lowercase doctypes
     html = html.replace(/<!doctype\s/i, '<!DOCTYPE ');
     try {
@@ -21344,30 +21363,11 @@ function buildHtmlPlugin(config) {
         checkPublicFile(url, config);
     // Same reason with `htmlInlineProxyPlugin`
     isAsyncScriptMap.set(config, new Map());
-    const inputFiles = new Set();
     return {
         name: 'vite:build-html',
-        buildStart({ input }) {
-            isAsyncScriptMap.set(config, new Map());
-            let allInputs;
-            if (typeof input === 'string') {
-                allInputs = [input];
-            }
-            else if (Array.isArray(input)) {
-                allInputs = input;
-            }
-            else {
-                allInputs = Object.values(input);
-            }
-            for (const filename of allInputs) {
-                if (filename.endsWith('.html')) {
-                    inputFiles.add(normalizePath$4(filename));
-                }
-            }
-        },
         async transform(html, id) {
             var _a, _b;
-            if (inputFiles.has(id)) {
+            if (id.endsWith('.html')) {
                 const publicPath = `/${slash$1(path__default.relative(config.root, id))}`;
                 // pre-transform
                 html = await applyHtmlTransforms(html, preHooks, {
@@ -22014,14 +22014,13 @@ function stripBom(string) {
 }
 var POSIX_SEP_RE = new RegExp("\\" + path__default.posix.sep, "g");
 var NATIVE_SEP_RE = new RegExp("\\" + path__default.sep, "g");
-var PATTERN_REGEX_CACHE = new Map();
+var PATTERN_REGEX_CACHE = /* @__PURE__ */ new Map();
 var GLOB_ALL_PATTERN = `**/*`;
 var DEFAULT_EXTENSIONS = [".ts", ".tsx", ".mts", ".cts"];
 var DEFAULT_EXTENSIONS_RE_GROUP = `\\.(?:${DEFAULT_EXTENSIONS.map((ext) => ext.substring(1)).join("|")})`;
 new Function("path", "return import(path).then(m => m.default)");
 async function resolveTSConfig(filename) {
-  const basename = path__default.basename(filename);
-  if (basename !== "tsconfig.json") {
+  if (path__default.extname(filename) !== ".json") {
     return;
   }
   const tsconfig = path__default.resolve(filename);
@@ -22484,7 +22483,7 @@ const buildEsbuildPlugin = (config) => {
             const minify = config.build.minify === 'esbuild' &&
                 // Do not minify ES lib output since that would remove pure annotations
                 // and break tree-shaking
-                // https://github.com/vuejs/vue-next/issues/2860#issuecomment-926882793
+                // https://github.com/vuejs/core/issues/2860#issuecomment-926882793
                 !(config.build.lib && opts.format === 'es');
             if ((!target || target === 'esnext') && !minify) {
                 return null;
@@ -23683,7 +23682,7 @@ function expandTop(str) {
     str = '\\{\\}' + str.substr(2);
   }
 
-  return expand$1(escapeBraces(str), true).map(unescapeBraces);
+  return expand$2(escapeBraces(str), true).map(unescapeBraces);
 }
 
 function embrace(str) {
@@ -23700,7 +23699,7 @@ function gte(i, y) {
   return i >= y;
 }
 
-function expand$1(str, isTop) {
+function expand$2(str, isTop) {
   var expansions = [];
 
   var m = balanced('{', '}', str);
@@ -23714,7 +23713,7 @@ function expand$1(str, isTop) {
     // {a},b}
     if (m.post.match(/,.*\}/)) {
       str = m.pre + '{' + m.body + escClose + m.post;
-      return expand$1(str);
+      return expand$2(str);
     }
     return [str];
   }
@@ -23726,10 +23725,10 @@ function expand$1(str, isTop) {
     n = parseCommaParts(m.body);
     if (n.length === 1) {
       // x{{a,b}}y ==> x{a}y x{b}y
-      n = expand$1(n[0], false).map(embrace);
+      n = expand$2(n[0], false).map(embrace);
       if (n.length === 1) {
         var post = m.post.length
-          ? expand$1(m.post, false)
+          ? expand$2(m.post, false)
           : [''];
         return post.map(function(p) {
           return m.pre + n[0] + p;
@@ -23744,7 +23743,7 @@ function expand$1(str, isTop) {
   // no need to expand pre, since it is guaranteed to be free of brace-sets
   var pre = m.pre;
   var post = m.post.length
-    ? expand$1(m.post, false)
+    ? expand$2(m.post, false)
     : [''];
 
   var N;
@@ -23788,7 +23787,7 @@ function expand$1(str, isTop) {
       N.push(c);
     }
   } else {
-    N = concatMap(n, function(el) { return expand$1(el, false) });
+    N = concatMap(n, function(el) { return expand$2(el, false) });
   }
 
   for (var j = 0; j < N.length; j++) {
@@ -23811,7 +23810,7 @@ try {
 } catch (er) {}
 
 var GLOBSTAR$1 = minimatch$3.GLOBSTAR = Minimatch$1.GLOBSTAR = {};
-var expand = braceExpansion;
+var expand$1 = braceExpansion;
 
 var plTypes = {
   '!': { open: '(?:(?!(?:', close: '))[^/]*?)'},
@@ -24056,7 +24055,7 @@ function braceExpand (pattern, options) {
     return [pattern]
   }
 
-  return expand(pattern)
+  return expand$1(pattern)
 }
 
 // parse a component of the expanded set.
@@ -24758,10 +24757,10 @@ if (typeof Object.create === 'function') {
 }
 
 try {
-  var util$6 = require('util');
+  var util$3 = require('util');
   /* istanbul ignore next */
-  if (typeof util$6.inherits !== 'function') throw '';
-  inherits$1.exports = util$6.inherits;
+  if (typeof util$3.inherits !== 'function') throw '';
+  inherits$1.exports = util$3.inherits;
 } catch (e) {
   /* istanbul ignore next */
   inherits$1.exports = inherits_browser.exports;
@@ -27677,7 +27676,7 @@ function getRequireStringArg(node) {
 function hasDynamicModuleForPath(source, id, dynamicRequireModuleSet) {
   if (!/^(?:\.{0,2}[/\\]|[A-Za-z]:[/\\])/.test(source)) {
     try {
-      const resolvedPath = normalizePathSlashes(resolve$3.sync(source, { basedir: path$r.dirname(id) }));
+      const resolvedPath = normalizePathSlashes(resolve$4.sync(source, { basedir: path$r.dirname(id) }));
       if (dynamicRequireModuleSet.has(resolvedPath)) {
         return true;
       }
@@ -29528,10 +29527,6 @@ function resolveExports(pkg, key, options, targetWeb) {
     });
 }
 function resolveDeepImport(id, { webResolvedImports, setResolvedCache, getResolvedCache, dir, data }, targetWeb, options) {
-    // id might contain ?query
-    // e.g. when using `<style src="some-pkg/dist/style.css"></style>` in .vue file
-    // the id will be ./dist/style.css?vue&type=style&index=0&src=xxx&lang.css
-    id = id.split('?')[0];
     const cache = getResolvedCache(id, targetWeb);
     if (cache) {
         return cache;
@@ -35563,224 +35558,7 @@ function errorMiddleware(server, allowNext = false) {
     };
 }
 
-var sourceMapGenerator = {};
-
-var base64Vlq = {};
-
-var base64$1 = {};
-
-/* -*- Mode: js; js-indent-level: 2; -*- */
-
-/*
- * Copyright 2011 Mozilla Foundation and contributors
- * Licensed under the New BSD license. See LICENSE or:
- * http://opensource.org/licenses/BSD-3-Clause
- */
-
-var intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');
-
-/**
- * Encode an integer in the range of 0 to 63 to a single base 64 digit.
- */
-base64$1.encode = function (number) {
-  if (0 <= number && number < intToCharMap.length) {
-    return intToCharMap[number];
-  }
-  throw new TypeError("Must be between 0 and 63: " + number);
-};
-
-/**
- * Decode a single base 64 character code digit to an integer. Returns -1 on
- * failure.
- */
-base64$1.decode = function (charCode) {
-  var bigA = 65;     // 'A'
-  var bigZ = 90;     // 'Z'
-
-  var littleA = 97;  // 'a'
-  var littleZ = 122; // 'z'
-
-  var zero = 48;     // '0'
-  var nine = 57;     // '9'
-
-  var plus = 43;     // '+'
-  var slash = 47;    // '/'
-
-  var littleOffset = 26;
-  var numberOffset = 52;
-
-  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ
-  if (bigA <= charCode && charCode <= bigZ) {
-    return (charCode - bigA);
-  }
-
-  // 26 - 51: abcdefghijklmnopqrstuvwxyz
-  if (littleA <= charCode && charCode <= littleZ) {
-    return (charCode - littleA + littleOffset);
-  }
-
-  // 52 - 61: 0123456789
-  if (zero <= charCode && charCode <= nine) {
-    return (charCode - zero + numberOffset);
-  }
-
-  // 62: +
-  if (charCode == plus) {
-    return 62;
-  }
-
-  // 63: /
-  if (charCode == slash) {
-    return 63;
-  }
-
-  // Invalid base64 digit.
-  return -1;
-};
-
-/* -*- Mode: js; js-indent-level: 2; -*- */
-
-/*
- * Copyright 2011 Mozilla Foundation and contributors
- * Licensed under the New BSD license. See LICENSE or:
- * http://opensource.org/licenses/BSD-3-Clause
- *
- * Based on the Base 64 VLQ implementation in Closure Compiler:
- * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
- *
- * Copyright 2011 The Closure Compiler Authors. All rights reserved.
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- *
- *  * Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- *  * Redistributions in binary form must reproduce the above
- *    copyright notice, this list of conditions and the following
- *    disclaimer in the documentation and/or other materials provided
- *    with the distribution.
- *  * Neither the name of Google Inc. nor the names of its
- *    contributors may be used to endorse or promote products derived
- *    from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-var base64 = base64$1;
-
-// A single base 64 digit can contain 6 bits of data. For the base 64 variable
-// length quantities we use in the source map spec, the first bit is the sign,
-// the next four bits are the actual value, and the 6th bit is the
-// continuation bit. The continuation bit tells us whether there are more
-// digits in this value following this digit.
-//
-//   Continuation
-//   |    Sign
-//   |    |
-//   V    V
-//   101011
-
-var VLQ_BASE_SHIFT = 5;
-
-// binary: 100000
-var VLQ_BASE = 1 << VLQ_BASE_SHIFT;
-
-// binary: 011111
-var VLQ_BASE_MASK = VLQ_BASE - 1;
-
-// binary: 100000
-var VLQ_CONTINUATION_BIT = VLQ_BASE;
-
-/**
- * Converts from a two-complement value to a value where the sign bit is
- * placed in the least significant bit.  For example, as decimals:
- *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
- *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
- */
-function toVLQSigned(aValue) {
-  return aValue < 0
-    ? ((-aValue) << 1) + 1
-    : (aValue << 1) + 0;
-}
-
-/**
- * Converts to a two-complement value from a value where the sign bit is
- * placed in the least significant bit.  For example, as decimals:
- *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
- *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
- */
-function fromVLQSigned(aValue) {
-  var isNegative = (aValue & 1) === 1;
-  var shifted = aValue >> 1;
-  return isNegative
-    ? -shifted
-    : shifted;
-}
-
-/**
- * Returns the base 64 VLQ encoded value.
- */
-base64Vlq.encode = function base64VLQ_encode(aValue) {
-  var encoded = "";
-  var digit;
-
-  var vlq = toVLQSigned(aValue);
-
-  do {
-    digit = vlq & VLQ_BASE_MASK;
-    vlq >>>= VLQ_BASE_SHIFT;
-    if (vlq > 0) {
-      // There are still more digits in this value, so we must make sure the
-      // continuation bit is marked.
-      digit |= VLQ_CONTINUATION_BIT;
-    }
-    encoded += base64.encode(digit);
-  } while (vlq > 0);
-
-  return encoded;
-};
-
-/**
- * Decodes the next base 64 VLQ value from the given string and returns the
- * value and the rest of the string via the out parameter.
- */
-base64Vlq.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {
-  var strLen = aStr.length;
-  var result = 0;
-  var shift = 0;
-  var continuation, digit;
-
-  do {
-    if (aIndex >= strLen) {
-      throw new Error("Expected more digits in base 64 VLQ value.");
-    }
-
-    digit = base64.decode(aStr.charCodeAt(aIndex++));
-    if (digit === -1) {
-      throw new Error("Invalid base64 digit: " + aStr.charAt(aIndex - 1));
-    }
-
-    continuation = !!(digit & VLQ_CONTINUATION_BIT);
-    digit &= VLQ_BASE_MASK;
-    result = result + (digit << shift);
-    shift += VLQ_BASE_SHIFT;
-  } while (continuation);
-
-  aOutParam.value = fromVLQSigned(result);
-  aOutParam.rest = aIndex;
-};
-
-var util$5 = {};
+var util$2 = {};
 
 /* -*- Mode: js; js-indent-level: 2; -*- */
 
@@ -35852,6 +35630,43 @@ function urlGenerate(aParsedUrl) {
 }
 exports.urlGenerate = urlGenerate;
 
+var MAX_CACHED_INPUTS = 32;
+
+/**
+ * Takes some function `f(input) -> result` and returns a memoized version of
+ * `f`.
+ *
+ * We keep at most `MAX_CACHED_INPUTS` memoized results of `f` alive. The
+ * memoization is a dumb-simple, linear least-recently-used cache.
+ */
+function lruMemoize(f) {
+  var cache = [];
+
+  return function(input) {
+    for (var i = 0; i < cache.length; i++) {
+      if (cache[i].input === input) {
+        var temp = cache[0];
+        cache[0] = cache[i];
+        cache[i] = temp;
+        return cache[0].result;
+      }
+    }
+
+    var result = f(input);
+
+    cache.unshift({
+      input,
+      result,
+    });
+
+    if (cache.length > MAX_CACHED_INPUTS) {
+      cache.pop();
+    }
+
+    return result;
+  };
+}
+
 /**
  * Normalizes a path, or the path portion of a URL:
  *
@@ -35863,7 +35678,7 @@ exports.urlGenerate = urlGenerate;
  *
  * @param aPath The path or url to normalize.
  */
-function normalize(aPath) {
+var normalize = lruMemoize(function normalize(aPath) {
   var path = aPath;
   var url = urlParse(aPath);
   if (url) {
@@ -35873,8 +35688,25 @@ function normalize(aPath) {
     path = url.path;
   }
   var isAbsolute = exports.isAbsolute(path);
+  // Split the path into parts between `/` characters. This is much faster than
+  // using `.split(/\/+/g)`.
+  var parts = [];
+  var start = 0;
+  var i = 0;
+  while (true) {
+    start = i;
+    i = path.indexOf("/", start);
+    if (i === -1) {
+      parts.push(path.slice(start));
+      break;
+    } else {
+      parts.push(path.slice(start, i));
+      while (i < path.length && path[i] === "/") {
+        i++;
+      }
+    }
+  }
 
-  var parts = path.split(/\/+/);
   for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {
     part = parts[i];
     if (part === '.') {
@@ -35905,7 +35737,7 @@ function normalize(aPath) {
     return urlGenerate(url);
   }
   return path;
-}
+});
 exports.normalize = normalize;
 
 /**
@@ -36117,6 +35949,33 @@ function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
 }
 exports.compareByOriginalPositions = compareByOriginalPositions;
 
+function compareByOriginalPositionsNoSource(mappingA, mappingB, onlyCompareOriginal) {
+  var cmp;
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0 || onlyCompareOriginal) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByOriginalPositionsNoSource = compareByOriginalPositionsNoSource;
+
 /**
  * Comparator between two mappings with deflated source and name indices where
  * the generated positions are compared.
@@ -36156,6 +36015,31 @@ function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGene
 }
 exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
 
+function compareByGeneratedPositionsDeflatedNoLine(mappingA, mappingB, onlyCompareGenerated) {
+  var cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0 || onlyCompareGenerated) {
+    return cmp;
+  }
+
+  cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByGeneratedPositionsDeflatedNoLine = compareByGeneratedPositionsDeflatedNoLine;
+
 function strcmp(aStr1, aStr2) {
   if (aStr1 === aStr2) {
     return 0;
@@ -36272,644 +36156,7 @@ function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {
   return normalize(sourceURL);
 }
 exports.computeSourceURL = computeSourceURL;
-}(util$5));
-
-var arraySet = {};
-
-/* -*- Mode: js; js-indent-level: 2; -*- */
-
-/*
- * Copyright 2011 Mozilla Foundation and contributors
- * Licensed under the New BSD license. See LICENSE or:
- * http://opensource.org/licenses/BSD-3-Clause
- */
-
-var util$4 = util$5;
-var has = Object.prototype.hasOwnProperty;
-var hasNativeMap = typeof Map !== "undefined";
-
-/**
- * A data structure which is a combination of an array and a set. Adding a new
- * member is O(1), testing for membership is O(1), and finding the index of an
- * element is O(1). Removing elements from the set is not supported. Only
- * strings are supported for membership.
- */
-function ArraySet$2() {
-  this._array = [];
-  this._set = hasNativeMap ? new Map() : Object.create(null);
-}
-
-/**
- * Static method for creating ArraySet instances from an existing array.
- */
-ArraySet$2.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {
-  var set = new ArraySet$2();
-  for (var i = 0, len = aArray.length; i < len; i++) {
-    set.add(aArray[i], aAllowDuplicates);
-  }
-  return set;
-};
-
-/**
- * Return how many unique items are in this ArraySet. If duplicates have been
- * added, than those do not count towards the size.
- *
- * @returns Number
- */
-ArraySet$2.prototype.size = function ArraySet_size() {
-  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;
-};
-
-/**
- * Add the given string to this set.
- *
- * @param String aStr
- */
-ArraySet$2.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {
-  var sStr = hasNativeMap ? aStr : util$4.toSetString(aStr);
-  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);
-  var idx = this._array.length;
-  if (!isDuplicate || aAllowDuplicates) {
-    this._array.push(aStr);
-  }
-  if (!isDuplicate) {
-    if (hasNativeMap) {
-      this._set.set(aStr, idx);
-    } else {
-      this._set[sStr] = idx;
-    }
-  }
-};
-
-/**
- * Is the given string a member of this set?
- *
- * @param String aStr
- */
-ArraySet$2.prototype.has = function ArraySet_has(aStr) {
-  if (hasNativeMap) {
-    return this._set.has(aStr);
-  } else {
-    var sStr = util$4.toSetString(aStr);
-    return has.call(this._set, sStr);
-  }
-};
-
-/**
- * What is the index of the given string in the array?
- *
- * @param String aStr
- */
-ArraySet$2.prototype.indexOf = function ArraySet_indexOf(aStr) {
-  if (hasNativeMap) {
-    var idx = this._set.get(aStr);
-    if (idx >= 0) {
-        return idx;
-    }
-  } else {
-    var sStr = util$4.toSetString(aStr);
-    if (has.call(this._set, sStr)) {
-      return this._set[sStr];
-    }
-  }
-
-  throw new Error('"' + aStr + '" is not in the set.');
-};
-
-/**
- * What is the element at the given index?
- *
- * @param Number aIdx
- */
-ArraySet$2.prototype.at = function ArraySet_at(aIdx) {
-  if (aIdx >= 0 && aIdx < this._array.length) {
-    return this._array[aIdx];
-  }
-  throw new Error('No element indexed by ' + aIdx);
-};
-
-/**
- * Returns the array representation of this set (which has the proper indices
- * indicated by indexOf). Note that this is a copy of the internal array used
- * for storing the members so that no one can mess with internal state.
- */
-ArraySet$2.prototype.toArray = function ArraySet_toArray() {
-  return this._array.slice();
-};
-
-arraySet.ArraySet = ArraySet$2;
-
-var mappingList = {};
-
-/* -*- Mode: js; js-indent-level: 2; -*- */
-
-/*
- * Copyright 2014 Mozilla Foundation and contributors
- * Licensed under the New BSD license. See LICENSE or:
- * http://opensource.org/licenses/BSD-3-Clause
- */
-
-var util$3 = util$5;
-
-/**
- * Determine whether mappingB is after mappingA with respect to generated
- * position.
- */
-function generatedPositionAfter(mappingA, mappingB) {
-  // Optimized for most common case
-  var lineA = mappingA.generatedLine;
-  var lineB = mappingB.generatedLine;
-  var columnA = mappingA.generatedColumn;
-  var columnB = mappingB.generatedColumn;
-  return lineB > lineA || lineB == lineA && columnB >= columnA ||
-         util$3.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
-}
-
-/**
- * A data structure to provide a sorted view of accumulated mappings in a
- * performance conscious manner. It trades a neglibable overhead in general
- * case for a large speedup in case of mappings being added in order.
- */
-function MappingList$1() {
-  this._array = [];
-  this._sorted = true;
-  // Serves as infimum
-  this._last = {generatedLine: -1, generatedColumn: 0};
-}
-
-/**
- * Iterate through internal items. This method takes the same arguments that
- * `Array.prototype.forEach` takes.
- *
- * NOTE: The order of the mappings is NOT guaranteed.
- */
-MappingList$1.prototype.unsortedForEach =
-  function MappingList_forEach(aCallback, aThisArg) {
-    this._array.forEach(aCallback, aThisArg);
-  };
-
-/**
- * Add the given source mapping.
- *
- * @param Object aMapping
- */
-MappingList$1.prototype.add = function MappingList_add(aMapping) {
-  if (generatedPositionAfter(this._last, aMapping)) {
-    this._last = aMapping;
-    this._array.push(aMapping);
-  } else {
-    this._sorted = false;
-    this._array.push(aMapping);
-  }
-};
-
-/**
- * Returns the flat, sorted array of mappings. The mappings are sorted by
- * generated position.
- *
- * WARNING: This method returns internal data without copying, for
- * performance. The return value must NOT be mutated, and should be treated as
- * an immutable borrow. If you want to take ownership, you must make your own
- * copy.
- */
-MappingList$1.prototype.toArray = function MappingList_toArray() {
-  if (!this._sorted) {
-    this._array.sort(util$3.compareByGeneratedPositionsInflated);
-    this._sorted = true;
-  }
-  return this._array;
-};
-
-mappingList.MappingList = MappingList$1;
-
-/* -*- Mode: js; js-indent-level: 2; -*- */
-
-/*
- * Copyright 2011 Mozilla Foundation and contributors
- * Licensed under the New BSD license. See LICENSE or:
- * http://opensource.org/licenses/BSD-3-Clause
- */
-
-var base64VLQ$1 = base64Vlq;
-var util$2 = util$5;
-var ArraySet$1 = arraySet.ArraySet;
-var MappingList = mappingList.MappingList;
-
-/**
- * An instance of the SourceMapGenerator represents a source map which is
- * being built incrementally. You may pass an object with the following
- * properties:
- *
- *   - file: The filename of the generated source.
- *   - sourceRoot: A root for all relative URLs in this source map.
- */
-function SourceMapGenerator$1(aArgs) {
-  if (!aArgs) {
-    aArgs = {};
-  }
-  this._file = util$2.getArg(aArgs, 'file', null);
-  this._sourceRoot = util$2.getArg(aArgs, 'sourceRoot', null);
-  this._skipValidation = util$2.getArg(aArgs, 'skipValidation', false);
-  this._sources = new ArraySet$1();
-  this._names = new ArraySet$1();
-  this._mappings = new MappingList();
-  this._sourcesContents = null;
-}
-
-SourceMapGenerator$1.prototype._version = 3;
-
-/**
- * Creates a new SourceMapGenerator based on a SourceMapConsumer
- *
- * @param aSourceMapConsumer The SourceMap.
- */
-SourceMapGenerator$1.fromSourceMap =
-  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {
-    var sourceRoot = aSourceMapConsumer.sourceRoot;
-    var generator = new SourceMapGenerator$1({
-      file: aSourceMapConsumer.file,
-      sourceRoot: sourceRoot
-    });
-    aSourceMapConsumer.eachMapping(function (mapping) {
-      var newMapping = {
-        generated: {
-          line: mapping.generatedLine,
-          column: mapping.generatedColumn
-        }
-      };
-
-      if (mapping.source != null) {
-        newMapping.source = mapping.source;
-        if (sourceRoot != null) {
-          newMapping.source = util$2.relative(sourceRoot, newMapping.source);
-        }
-
-        newMapping.original = {
-          line: mapping.originalLine,
-          column: mapping.originalColumn
-        };
-
-        if (mapping.name != null) {
-          newMapping.name = mapping.name;
-        }
-      }
-
-      generator.addMapping(newMapping);
-    });
-    aSourceMapConsumer.sources.forEach(function (sourceFile) {
-      var sourceRelative = sourceFile;
-      if (sourceRoot !== null) {
-        sourceRelative = util$2.relative(sourceRoot, sourceFile);
-      }
-
-      if (!generator._sources.has(sourceRelative)) {
-        generator._sources.add(sourceRelative);
-      }
-
-      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
-      if (content != null) {
-        generator.setSourceContent(sourceFile, content);
-      }
-    });
-    return generator;
-  };
-
-/**
- * Add a single mapping from original source line and column to the generated
- * source's line and column for this source map being created. The mapping
- * object should have the following properties:
- *
- *   - generated: An object with the generated line and column positions.
- *   - original: An object with the original line and column positions.
- *   - source: The original source file (relative to the sourceRoot).
- *   - name: An optional original token name for this mapping.
- */
-SourceMapGenerator$1.prototype.addMapping =
-  function SourceMapGenerator_addMapping(aArgs) {
-    var generated = util$2.getArg(aArgs, 'generated');
-    var original = util$2.getArg(aArgs, 'original', null);
-    var source = util$2.getArg(aArgs, 'source', null);
-    var name = util$2.getArg(aArgs, 'name', null);
-
-    if (!this._skipValidation) {
-      this._validateMapping(generated, original, source, name);
-    }
-
-    if (source != null) {
-      source = String(source);
-      if (!this._sources.has(source)) {
-        this._sources.add(source);
-      }
-    }
-
-    if (name != null) {
-      name = String(name);
-      if (!this._names.has(name)) {
-        this._names.add(name);
-      }
-    }
-
-    this._mappings.add({
-      generatedLine: generated.line,
-      generatedColumn: generated.column,
-      originalLine: original != null && original.line,
-      originalColumn: original != null && original.column,
-      source: source,
-      name: name
-    });
-  };
-
-/**
- * Set the source content for a source file.
- */
-SourceMapGenerator$1.prototype.setSourceContent =
-  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {
-    var source = aSourceFile;
-    if (this._sourceRoot != null) {
-      source = util$2.relative(this._sourceRoot, source);
-    }
-
-    if (aSourceContent != null) {
-      // Add the source content to the _sourcesContents map.
-      // Create a new _sourcesContents map if the property is null.
-      if (!this._sourcesContents) {
-        this._sourcesContents = Object.create(null);
-      }
-      this._sourcesContents[util$2.toSetString(source)] = aSourceContent;
-    } else if (this._sourcesContents) {
-      // Remove the source file from the _sourcesContents map.
-      // If the _sourcesContents map is empty, set the property to null.
-      delete this._sourcesContents[util$2.toSetString(source)];
-      if (Object.keys(this._sourcesContents).length === 0) {
-        this._sourcesContents = null;
-      }
-    }
-  };
-
-/**
- * Applies the mappings of a sub-source-map for a specific source file to the
- * source map being generated. Each mapping to the supplied source file is
- * rewritten using the supplied source map. Note: The resolution for the
- * resulting mappings is the minimium of this map and the supplied map.
- *
- * @param aSourceMapConsumer The source map to be applied.
- * @param aSourceFile Optional. The filename of the source file.
- *        If omitted, SourceMapConsumer's file property will be used.
- * @param aSourceMapPath Optional. The dirname of the path to the source map
- *        to be applied. If relative, it is relative to the SourceMapConsumer.
- *        This parameter is needed when the two source maps aren't in the same
- *        directory, and the source map to be applied contains relative source
- *        paths. If so, those relative source paths need to be rewritten
- *        relative to the SourceMapGenerator.
- */
-SourceMapGenerator$1.prototype.applySourceMap =
-  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
-    var sourceFile = aSourceFile;
-    // If aSourceFile is omitted, we will use the file property of the SourceMap
-    if (aSourceFile == null) {
-      if (aSourceMapConsumer.file == null) {
-        throw new Error(
-          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +
-          'or the source map\'s "file" property. Both were omitted.'
-        );
-      }
-      sourceFile = aSourceMapConsumer.file;
-    }
-    var sourceRoot = this._sourceRoot;
-    // Make "sourceFile" relative if an absolute Url is passed.
-    if (sourceRoot != null) {
-      sourceFile = util$2.relative(sourceRoot, sourceFile);
-    }
-    // Applying the SourceMap can add and remove items from the sources and
-    // the names array.
-    var newSources = new ArraySet$1();
-    var newNames = new ArraySet$1();
-
-    // Find mappings for the "sourceFile"
-    this._mappings.unsortedForEach(function (mapping) {
-      if (mapping.source === sourceFile && mapping.originalLine != null) {
-        // Check if it can be mapped by the source map, then update the mapping.
-        var original = aSourceMapConsumer.originalPositionFor({
-          line: mapping.originalLine,
-          column: mapping.originalColumn
-        });
-        if (original.source != null) {
-          // Copy mapping
-          mapping.source = original.source;
-          if (aSourceMapPath != null) {
-            mapping.source = util$2.join(aSourceMapPath, mapping.source);
-          }
-          if (sourceRoot != null) {
-            mapping.source = util$2.relative(sourceRoot, mapping.source);
-          }
-          mapping.originalLine = original.line;
-          mapping.originalColumn = original.column;
-          if (original.name != null) {
-            mapping.name = original.name;
-          }
-        }
-      }
-
-      var source = mapping.source;
-      if (source != null && !newSources.has(source)) {
-        newSources.add(source);
-      }
-
-      var name = mapping.name;
-      if (name != null && !newNames.has(name)) {
-        newNames.add(name);
-      }
-
-    }, this);
-    this._sources = newSources;
-    this._names = newNames;
-
-    // Copy sourcesContents of applied map.
-    aSourceMapConsumer.sources.forEach(function (sourceFile) {
-      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
-      if (content != null) {
-        if (aSourceMapPath != null) {
-          sourceFile = util$2.join(aSourceMapPath, sourceFile);
-        }
-        if (sourceRoot != null) {
-          sourceFile = util$2.relative(sourceRoot, sourceFile);
-        }
-        this.setSourceContent(sourceFile, content);
-      }
-    }, this);
-  };
-
-/**
- * A mapping can have one of the three levels of data:
- *
- *   1. Just the generated position.
- *   2. The Generated position, original position, and original source.
- *   3. Generated and original position, original source, as well as a name
- *      token.
- *
- * To maintain consistency, we validate that any new mapping being added falls
- * in to one of these categories.
- */
-SourceMapGenerator$1.prototype._validateMapping =
-  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,
-                                              aName) {
-    // When aOriginal is truthy but has empty values for .line and .column,
-    // it is most likely a programmer error. In this case we throw a very
-    // specific error message to try to guide them the right way.
-    // For example: https://github.com/Polymer/polymer-bundler/pull/519
-    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {
-        throw new Error(
-            'original.line and original.column are not numbers -- you probably meant to omit ' +
-            'the original mapping entirely and only map the generated position. If so, pass ' +
-            'null for the original mapping instead of an object with empty or null values.'
-        );
-    }
-
-    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
-        && aGenerated.line > 0 && aGenerated.column >= 0
-        && !aOriginal && !aSource && !aName) {
-      // Case 1.
-      return;
-    }
-    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
-             && aOriginal && 'line' in aOriginal && 'column' in aOriginal
-             && aGenerated.line > 0 && aGenerated.column >= 0
-             && aOriginal.line > 0 && aOriginal.column >= 0
-             && aSource) {
-      // Cases 2 and 3.
-      return;
-    }
-    else {
-      throw new Error('Invalid mapping: ' + JSON.stringify({
-        generated: aGenerated,
-        source: aSource,
-        original: aOriginal,
-        name: aName
-      }));
-    }
-  };
-
-/**
- * Serialize the accumulated mappings in to the stream of base 64 VLQs
- * specified by the source map format.
- */
-SourceMapGenerator$1.prototype._serializeMappings =
-  function SourceMapGenerator_serializeMappings() {
-    var previousGeneratedColumn = 0;
-    var previousGeneratedLine = 1;
-    var previousOriginalColumn = 0;
-    var previousOriginalLine = 0;
-    var previousName = 0;
-    var previousSource = 0;
-    var result = '';
-    var next;
-    var mapping;
-    var nameIdx;
-    var sourceIdx;
-
-    var mappings = this._mappings.toArray();
-    for (var i = 0, len = mappings.length; i < len; i++) {
-      mapping = mappings[i];
-      next = '';
-
-      if (mapping.generatedLine !== previousGeneratedLine) {
-        previousGeneratedColumn = 0;
-        while (mapping.generatedLine !== previousGeneratedLine) {
-          next += ';';
-          previousGeneratedLine++;
-        }
-      }
-      else {
-        if (i > 0) {
-          if (!util$2.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {
-            continue;
-          }
-          next += ',';
-        }
-      }
-
-      next += base64VLQ$1.encode(mapping.generatedColumn
-                                 - previousGeneratedColumn);
-      previousGeneratedColumn = mapping.generatedColumn;
-
-      if (mapping.source != null) {
-        sourceIdx = this._sources.indexOf(mapping.source);
-        next += base64VLQ$1.encode(sourceIdx - previousSource);
-        previousSource = sourceIdx;
-
-        // lines are stored 0-based in SourceMap spec version 3
-        next += base64VLQ$1.encode(mapping.originalLine - 1
-                                   - previousOriginalLine);
-        previousOriginalLine = mapping.originalLine - 1;
-
-        next += base64VLQ$1.encode(mapping.originalColumn
-                                   - previousOriginalColumn);
-        previousOriginalColumn = mapping.originalColumn;
-
-        if (mapping.name != null) {
-          nameIdx = this._names.indexOf(mapping.name);
-          next += base64VLQ$1.encode(nameIdx - previousName);
-          previousName = nameIdx;
-        }
-      }
-
-      result += next;
-    }
-
-    return result;
-  };
-
-SourceMapGenerator$1.prototype._generateSourcesContent =
-  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {
-    return aSources.map(function (source) {
-      if (!this._sourcesContents) {
-        return null;
-      }
-      if (aSourceRoot != null) {
-        source = util$2.relative(aSourceRoot, source);
-      }
-      var key = util$2.toSetString(source);
-      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)
-        ? this._sourcesContents[key]
-        : null;
-    }, this);
-  };
-
-/**
- * Externalize the source map.
- */
-SourceMapGenerator$1.prototype.toJSON =
-  function SourceMapGenerator_toJSON() {
-    var map = {
-      version: this._version,
-      sources: this._sources.toArray(),
-      names: this._names.toArray(),
-      mappings: this._serializeMappings()
-    };
-    if (this._file != null) {
-      map.file = this._file;
-    }
-    if (this._sourceRoot != null) {
-      map.sourceRoot = this._sourceRoot;
-    }
-    if (this._sourcesContents) {
-      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
-    }
-
-    return map;
-  };
-
-/**
- * Render the source map being generated to a string.
- */
-SourceMapGenerator$1.prototype.toString =
-  function SourceMapGenerator_toString() {
-    return JSON.stringify(this.toJSON());
-  };
-
-sourceMapGenerator.SourceMapGenerator = SourceMapGenerator$1;
-
-var sourceMapConsumer = {};
+}(util$2));
 
 var binarySearch$1 = {};
 
@@ -37028,6 +36275,346 @@ exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
 };
 }(binarySearch$1));
 
+var arraySet = {};
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var util$1 = util$2;
+var has = Object.prototype.hasOwnProperty;
+var hasNativeMap = typeof Map !== "undefined";
+
+/**
+ * A data structure which is a combination of an array and a set. Adding a new
+ * member is O(1), testing for membership is O(1), and finding the index of an
+ * element is O(1). Removing elements from the set is not supported. Only
+ * strings are supported for membership.
+ */
+function ArraySet$1() {
+  this._array = [];
+  this._set = hasNativeMap ? new Map() : Object.create(null);
+}
+
+/**
+ * Static method for creating ArraySet instances from an existing array.
+ */
+ArraySet$1.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {
+  var set = new ArraySet$1();
+  for (var i = 0, len = aArray.length; i < len; i++) {
+    set.add(aArray[i], aAllowDuplicates);
+  }
+  return set;
+};
+
+/**
+ * Return how many unique items are in this ArraySet. If duplicates have been
+ * added, than those do not count towards the size.
+ *
+ * @returns Number
+ */
+ArraySet$1.prototype.size = function ArraySet_size() {
+  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;
+};
+
+/**
+ * Add the given string to this set.
+ *
+ * @param String aStr
+ */
+ArraySet$1.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {
+  var sStr = hasNativeMap ? aStr : util$1.toSetString(aStr);
+  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);
+  var idx = this._array.length;
+  if (!isDuplicate || aAllowDuplicates) {
+    this._array.push(aStr);
+  }
+  if (!isDuplicate) {
+    if (hasNativeMap) {
+      this._set.set(aStr, idx);
+    } else {
+      this._set[sStr] = idx;
+    }
+  }
+};
+
+/**
+ * Is the given string a member of this set?
+ *
+ * @param String aStr
+ */
+ArraySet$1.prototype.has = function ArraySet_has(aStr) {
+  if (hasNativeMap) {
+    return this._set.has(aStr);
+  } else {
+    var sStr = util$1.toSetString(aStr);
+    return has.call(this._set, sStr);
+  }
+};
+
+/**
+ * What is the index of the given string in the array?
+ *
+ * @param String aStr
+ */
+ArraySet$1.prototype.indexOf = function ArraySet_indexOf(aStr) {
+  if (hasNativeMap) {
+    var idx = this._set.get(aStr);
+    if (idx >= 0) {
+        return idx;
+    }
+  } else {
+    var sStr = util$1.toSetString(aStr);
+    if (has.call(this._set, sStr)) {
+      return this._set[sStr];
+    }
+  }
+
+  throw new Error('"' + aStr + '" is not in the set.');
+};
+
+/**
+ * What is the element at the given index?
+ *
+ * @param Number aIdx
+ */
+ArraySet$1.prototype.at = function ArraySet_at(aIdx) {
+  if (aIdx >= 0 && aIdx < this._array.length) {
+    return this._array[aIdx];
+  }
+  throw new Error('No element indexed by ' + aIdx);
+};
+
+/**
+ * Returns the array representation of this set (which has the proper indices
+ * indicated by indexOf). Note that this is a copy of the internal array used
+ * for storing the members so that no one can mess with internal state.
+ */
+ArraySet$1.prototype.toArray = function ArraySet_toArray() {
+  return this._array.slice();
+};
+
+arraySet.ArraySet = ArraySet$1;
+
+var base64Vlq = {};
+
+var base64$1 = {};
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');
+
+/**
+ * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+ */
+base64$1.encode = function (number) {
+  if (0 <= number && number < intToCharMap.length) {
+    return intToCharMap[number];
+  }
+  throw new TypeError("Must be between 0 and 63: " + number);
+};
+
+/**
+ * Decode a single base 64 character code digit to an integer. Returns -1 on
+ * failure.
+ */
+base64$1.decode = function (charCode) {
+  var bigA = 65;     // 'A'
+  var bigZ = 90;     // 'Z'
+
+  var littleA = 97;  // 'a'
+  var littleZ = 122; // 'z'
+
+  var zero = 48;     // '0'
+  var nine = 57;     // '9'
+
+  var plus = 43;     // '+'
+  var slash = 47;    // '/'
+
+  var littleOffset = 26;
+  var numberOffset = 52;
+
+  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ
+  if (bigA <= charCode && charCode <= bigZ) {
+    return (charCode - bigA);
+  }
+
+  // 26 - 51: abcdefghijklmnopqrstuvwxyz
+  if (littleA <= charCode && charCode <= littleZ) {
+    return (charCode - littleA + littleOffset);
+  }
+
+  // 52 - 61: 0123456789
+  if (zero <= charCode && charCode <= nine) {
+    return (charCode - zero + numberOffset);
+  }
+
+  // 62: +
+  if (charCode == plus) {
+    return 62;
+  }
+
+  // 63: /
+  if (charCode == slash) {
+    return 63;
+  }
+
+  // Invalid base64 digit.
+  return -1;
+};
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ *
+ * Based on the Base 64 VLQ implementation in Closure Compiler:
+ * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+ *
+ * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are
+ * met:
+ *
+ *  * Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ *  * Redistributions in binary form must reproduce the above
+ *    copyright notice, this list of conditions and the following
+ *    disclaimer in the documentation and/or other materials provided
+ *    with the distribution.
+ *  * Neither the name of Google Inc. nor the names of its
+ *    contributors may be used to endorse or promote products derived
+ *    from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+var base64 = base64$1;
+
+// A single base 64 digit can contain 6 bits of data. For the base 64 variable
+// length quantities we use in the source map spec, the first bit is the sign,
+// the next four bits are the actual value, and the 6th bit is the
+// continuation bit. The continuation bit tells us whether there are more
+// digits in this value following this digit.
+//
+//   Continuation
+//   |    Sign
+//   |    |
+//   V    V
+//   101011
+
+var VLQ_BASE_SHIFT = 5;
+
+// binary: 100000
+var VLQ_BASE = 1 << VLQ_BASE_SHIFT;
+
+// binary: 011111
+var VLQ_BASE_MASK = VLQ_BASE - 1;
+
+// binary: 100000
+var VLQ_CONTINUATION_BIT = VLQ_BASE;
+
+/**
+ * Converts from a two-complement value to a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+ *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+ */
+function toVLQSigned(aValue) {
+  return aValue < 0
+    ? ((-aValue) << 1) + 1
+    : (aValue << 1) + 0;
+}
+
+/**
+ * Converts to a two-complement value from a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+ *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+ */
+function fromVLQSigned(aValue) {
+  var isNegative = (aValue & 1) === 1;
+  var shifted = aValue >> 1;
+  return isNegative
+    ? -shifted
+    : shifted;
+}
+
+/**
+ * Returns the base 64 VLQ encoded value.
+ */
+base64Vlq.encode = function base64VLQ_encode(aValue) {
+  var encoded = "";
+  var digit;
+
+  var vlq = toVLQSigned(aValue);
+
+  do {
+    digit = vlq & VLQ_BASE_MASK;
+    vlq >>>= VLQ_BASE_SHIFT;
+    if (vlq > 0) {
+      // There are still more digits in this value, so we must make sure the
+      // continuation bit is marked.
+      digit |= VLQ_CONTINUATION_BIT;
+    }
+    encoded += base64.encode(digit);
+  } while (vlq > 0);
+
+  return encoded;
+};
+
+/**
+ * Decodes the next base 64 VLQ value from the given string and returns the
+ * value and the rest of the string via the out parameter.
+ */
+base64Vlq.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {
+  var strLen = aStr.length;
+  var result = 0;
+  var shift = 0;
+  var continuation, digit;
+
+  do {
+    if (aIndex >= strLen) {
+      throw new Error("Expected more digits in base 64 VLQ value.");
+    }
+
+    digit = base64.decode(aStr.charCodeAt(aIndex++));
+    if (digit === -1) {
+      throw new Error("Invalid base64 digit: " + aStr.charAt(aIndex - 1));
+    }
+
+    continuation = !!(digit & VLQ_CONTINUATION_BIT);
+    digit &= VLQ_BASE_MASK;
+    result = result + (digit << shift);
+    shift += VLQ_BASE_SHIFT;
+  } while (continuation);
+
+  aOutParam.value = fromVLQSigned(result);
+  aOutParam.rest = aIndex;
+};
+
 var quickSort$1 = {};
 
 /* -*- Mode: js; js-indent-level: 2; -*- */
@@ -37048,6 +36635,8 @@ var quickSort$1 = {};
 // sorting in C++. By using our own JS-implemented Quick Sort (below), we get
 // a ~3500ms mean speed-up in `bench/bench.html`.
 
+function SortTemplate(comparator) {
+
 /**
  * Swap the elements indexed by `x` and `y` in the array `ary`.
  *
@@ -37118,7 +36707,7 @@ function doQuickSort(ary, comparator, p, r) {
     //
     //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.
     for (var j = p; j < r; j++) {
-      if (comparator(ary[j], pivot) <= 0) {
+      if (comparator(ary[j], pivot, false) <= 0) {
         i += 1;
         swap(ary, i, j);
       }
@@ -37134,6 +36723,15 @@ function doQuickSort(ary, comparator, p, r) {
   }
 }
 
+  return doQuickSort;
+}
+
+function cloneSort(comparator) {
+  let template = SortTemplate.toString();
+  let templateFn = new Function(`return ${template}`)();
+  return templateFn(comparator);
+}
+
 /**
  * Sort the given array in-place with the given comparator function.
  *
@@ -37142,8 +36740,15 @@ function doQuickSort(ary, comparator, p, r) {
  * @param {function} comparator
  *        Function to use to compare two items.
  */
-quickSort$1.quickSort = function (ary, comparator) {
-  doQuickSort(ary, comparator, 0, ary.length - 1);
+
+let sortCache = new WeakMap();
+quickSort$1.quickSort = function (ary, comparator, start = 0) {
+  let doQuickSort = sortCache.get(comparator);
+  if (doQuickSort === void 0) {
+    doQuickSort = cloneSort(comparator);
+    sortCache.set(comparator, doQuickSort);
+  }
+  doQuickSort(ary, comparator, start, ary.length - 1);
 };
 
 /* -*- Mode: js; js-indent-level: 2; -*- */
@@ -37154,16 +36759,16 @@ quickSort$1.quickSort = function (ary, comparator) {
  * http://opensource.org/licenses/BSD-3-Clause
  */
 
-var util$1 = util$5;
+var util = util$2;
 var binarySearch = binarySearch$1;
 var ArraySet = arraySet.ArraySet;
 var base64VLQ = base64Vlq;
 var quickSort = quickSort$1.quickSort;
 
-function SourceMapConsumer$1(aSourceMap, aSourceMapURL) {
+function SourceMapConsumer(aSourceMap, aSourceMapURL) {
   var sourceMap = aSourceMap;
   if (typeof aSourceMap === 'string') {
-    sourceMap = util$1.parseSourceMapInput(aSourceMap);
+    sourceMap = util.parseSourceMapInput(aSourceMap);
   }
 
   return sourceMap.sections != null
@@ -37171,14 +36776,14 @@ function SourceMapConsumer$1(aSourceMap, aSourceMapURL) {
     : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);
 }
 
-SourceMapConsumer$1.fromSourceMap = function(aSourceMap, aSourceMapURL) {
+SourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {
   return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);
 };
 
 /**
  * The version of the source mapping spec that we are consuming.
  */
-SourceMapConsumer$1.prototype._version = 3;
+SourceMapConsumer.prototype._version = 3;
 
 // `__generatedMappings` and `__originalMappings` are arrays that hold the
 // parsed mapping coordinates from the source map's "mappings" attribute. They
@@ -37210,8 +36815,8 @@ SourceMapConsumer$1.prototype._version = 3;
 //
 // `_originalMappings` is ordered by the original positions.
 
-SourceMapConsumer$1.prototype.__generatedMappings = null;
-Object.defineProperty(SourceMapConsumer$1.prototype, '_generatedMappings', {
+SourceMapConsumer.prototype.__generatedMappings = null;
+Object.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {
   configurable: true,
   enumerable: true,
   get: function () {
@@ -37223,8 +36828,8 @@ Object.defineProperty(SourceMapConsumer$1.prototype, '_generatedMappings', {
   }
 });
 
-SourceMapConsumer$1.prototype.__originalMappings = null;
-Object.defineProperty(SourceMapConsumer$1.prototype, '_originalMappings', {
+SourceMapConsumer.prototype.__originalMappings = null;
+Object.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {
   configurable: true,
   enumerable: true,
   get: function () {
@@ -37236,7 +36841,7 @@ Object.defineProperty(SourceMapConsumer$1.prototype, '_originalMappings', {
   }
 });
 
-SourceMapConsumer$1.prototype._charIsMappingSeparator =
+SourceMapConsumer.prototype._charIsMappingSeparator =
   function SourceMapConsumer_charIsMappingSeparator(aStr, index) {
     var c = aStr.charAt(index);
     return c === ";" || c === ",";
@@ -37247,16 +36852,16 @@ SourceMapConsumer$1.prototype._charIsMappingSeparator =
  * query (the ordered arrays in the `this.__generatedMappings` and
  * `this.__originalMappings` properties).
  */
-SourceMapConsumer$1.prototype._parseMappings =
+SourceMapConsumer.prototype._parseMappings =
   function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
     throw new Error("Subclasses must implement _parseMappings");
   };
 
-SourceMapConsumer$1.GENERATED_ORDER = 1;
-SourceMapConsumer$1.ORIGINAL_ORDER = 2;
+SourceMapConsumer.GENERATED_ORDER = 1;
+SourceMapConsumer.ORIGINAL_ORDER = 2;
 
-SourceMapConsumer$1.GREATEST_LOWER_BOUND = 1;
-SourceMapConsumer$1.LEAST_UPPER_BOUND = 2;
+SourceMapConsumer.GREATEST_LOWER_BOUND = 1;
+SourceMapConsumer.LEAST_UPPER_BOUND = 2;
 
 /**
  * Iterate over each mapping between an original source/line/column and a
@@ -37274,17 +36879,17 @@ SourceMapConsumer$1.LEAST_UPPER_BOUND = 2;
  *        order or the original's source/line/column order, respectively. Defaults to
  *        `SourceMapConsumer.GENERATED_ORDER`.
  */
-SourceMapConsumer$1.prototype.eachMapping =
+SourceMapConsumer.prototype.eachMapping =
   function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {
     var context = aContext || null;
-    var order = aOrder || SourceMapConsumer$1.GENERATED_ORDER;
+    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;
 
     var mappings;
     switch (order) {
-    case SourceMapConsumer$1.GENERATED_ORDER:
+    case SourceMapConsumer.GENERATED_ORDER:
       mappings = this._generatedMappings;
       break;
-    case SourceMapConsumer$1.ORIGINAL_ORDER:
+    case SourceMapConsumer.ORIGINAL_ORDER:
       mappings = this._originalMappings;
       break;
     default:
@@ -37292,18 +36897,24 @@ SourceMapConsumer$1.prototype.eachMapping =
     }
 
     var sourceRoot = this.sourceRoot;
-    mappings.map(function (mapping) {
-      var source = mapping.source === null ? null : this._sources.at(mapping.source);
-      source = util$1.computeSourceURL(sourceRoot, source, this._sourceMapURL);
-      return {
+    var boundCallback = aCallback.bind(context);
+    var names = this._names;
+    var sources = this._sources;
+    var sourceMapURL = this._sourceMapURL;
+
+    for (var i = 0, n = mappings.length; i < n; i++) {
+      var mapping = mappings[i];
+      var source = mapping.source === null ? null : sources.at(mapping.source);
+      source = util.computeSourceURL(sourceRoot, source, sourceMapURL);
+      boundCallback({
         source: source,
         generatedLine: mapping.generatedLine,
         generatedColumn: mapping.generatedColumn,
         originalLine: mapping.originalLine,
         originalColumn: mapping.originalColumn,
-        name: mapping.name === null ? null : this._names.at(mapping.name)
-      };
-    }, this).forEach(aCallback, context);
+        name: mapping.name === null ? null : names.at(mapping.name)
+      });
+    }
   };
 
 /**
@@ -37328,18 +36939,18 @@ SourceMapConsumer$1.prototype.eachMapping =
  *   - column: The column number in the generated source, or null.
  *    The column number is 0-based.
  */
-SourceMapConsumer$1.prototype.allGeneratedPositionsFor =
+SourceMapConsumer.prototype.allGeneratedPositionsFor =
   function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {
-    var line = util$1.getArg(aArgs, 'line');
+    var line = util.getArg(aArgs, 'line');
 
     // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping
     // returns the index of the closest mapping less than the needle. By
     // setting needle.originalColumn to 0, we thus find the last mapping for
     // the given line, provided such a mapping exists.
     var needle = {
-      source: util$1.getArg(aArgs, 'source'),
+      source: util.getArg(aArgs, 'source'),
       originalLine: line,
-      originalColumn: util$1.getArg(aArgs, 'column', 0)
+      originalColumn: util.getArg(aArgs, 'column', 0)
     };
 
     needle.source = this._findSourceIndex(needle.source);
@@ -37353,7 +36964,7 @@ SourceMapConsumer$1.prototype.allGeneratedPositionsFor =
                                   this._originalMappings,
                                   "originalLine",
                                   "originalColumn",
-                                  util$1.compareByOriginalPositions,
+                                  util.compareByOriginalPositions,
                                   binarySearch.LEAST_UPPER_BOUND);
     if (index >= 0) {
       var mapping = this._originalMappings[index];
@@ -37367,9 +36978,9 @@ SourceMapConsumer$1.prototype.allGeneratedPositionsFor =
         // the line we found.
         while (mapping && mapping.originalLine === originalLine) {
           mappings.push({
-            line: util$1.getArg(mapping, 'generatedLine', null),
-            column: util$1.getArg(mapping, 'generatedColumn', null),
-            lastColumn: util$1.getArg(mapping, 'lastGeneratedColumn', null)
+            line: util.getArg(mapping, 'generatedLine', null),
+            column: util.getArg(mapping, 'generatedColumn', null),
+            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
           });
 
           mapping = this._originalMappings[++index];
@@ -37385,9 +36996,9 @@ SourceMapConsumer$1.prototype.allGeneratedPositionsFor =
                mapping.originalLine === line &&
                mapping.originalColumn == originalColumn) {
           mappings.push({
-            line: util$1.getArg(mapping, 'generatedLine', null),
-            column: util$1.getArg(mapping, 'generatedColumn', null),
-            lastColumn: util$1.getArg(mapping, 'lastGeneratedColumn', null)
+            line: util.getArg(mapping, 'generatedLine', null),
+            column: util.getArg(mapping, 'generatedColumn', null),
+            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
           });
 
           mapping = this._originalMappings[++index];
@@ -37398,7 +37009,7 @@ SourceMapConsumer$1.prototype.allGeneratedPositionsFor =
     return mappings;
   };
 
-sourceMapConsumer.SourceMapConsumer = SourceMapConsumer$1;
+var SourceMapConsumer_1 = SourceMapConsumer;
 
 /**
  * A BasicSourceMapConsumer instance represents a parsed source map which we can
@@ -37437,18 +37048,18 @@ sourceMapConsumer.SourceMapConsumer = SourceMapConsumer$1;
 function BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {
   var sourceMap = aSourceMap;
   if (typeof aSourceMap === 'string') {
-    sourceMap = util$1.parseSourceMapInput(aSourceMap);
+    sourceMap = util.parseSourceMapInput(aSourceMap);
   }
 
-  var version = util$1.getArg(sourceMap, 'version');
-  var sources = util$1.getArg(sourceMap, 'sources');
+  var version = util.getArg(sourceMap, 'version');
+  var sources = util.getArg(sourceMap, 'sources');
   // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which
   // requires the array) to play nice here.
-  var names = util$1.getArg(sourceMap, 'names', []);
-  var sourceRoot = util$1.getArg(sourceMap, 'sourceRoot', null);
-  var sourcesContent = util$1.getArg(sourceMap, 'sourcesContent', null);
-  var mappings = util$1.getArg(sourceMap, 'mappings');
-  var file = util$1.getArg(sourceMap, 'file', null);
+  var names = util.getArg(sourceMap, 'names', []);
+  var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);
+  var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);
+  var mappings = util.getArg(sourceMap, 'mappings');
+  var file = util.getArg(sourceMap, 'file', null);
 
   // Once again, Sass deviates from the spec and supplies the version as a
   // string rather than a number, so we use loose equality checking here.
@@ -37457,7 +37068,7 @@ function BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {
   }
 
   if (sourceRoot) {
-    sourceRoot = util$1.normalize(sourceRoot);
+    sourceRoot = util.normalize(sourceRoot);
   }
 
   sources = sources
@@ -37465,14 +37076,14 @@ function BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {
     // Some source maps produce relative source paths like "./foo.js" instead of
     // "foo.js".  Normalize these first so that future comparisons will succeed.
     // See bugzil.la/1090768.
-    .map(util$1.normalize)
+    .map(util.normalize)
     // Always ensure that absolute sources are internally stored relative to
     // the source root, if the source root is absolute. Not doing this would
     // be particularly problematic when the source root is a prefix of the
     // source (valid, but why??). See github issue #199 and bugzil.la/1188982.
     .map(function (source) {
-      return sourceRoot && util$1.isAbsolute(sourceRoot) && util$1.isAbsolute(source)
-        ? util$1.relative(sourceRoot, source)
+      return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)
+        ? util.relative(sourceRoot, source)
         : source;
     });
 
@@ -37484,7 +37095,7 @@ function BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {
   this._sources = ArraySet.fromArray(sources, true);
 
   this._absoluteSources = this._sources.toArray().map(function (s) {
-    return util$1.computeSourceURL(sourceRoot, s, aSourceMapURL);
+    return util.computeSourceURL(sourceRoot, s, aSourceMapURL);
   });
 
   this.sourceRoot = sourceRoot;
@@ -37494,8 +37105,8 @@ function BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {
   this.file = file;
 }
 
-BasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer$1.prototype);
-BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer$1;
+BasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;
 
 /**
  * Utility function to find the index of a source.  Returns -1 if not
@@ -37504,7 +37115,7 @@ BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer$1;
 BasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {
   var relativeSource = aSource;
   if (this.sourceRoot != null) {
-    relativeSource = util$1.relative(this.sourceRoot, relativeSource);
+    relativeSource = util.relative(this.sourceRoot, relativeSource);
   }
 
   if (this._sources.has(relativeSource)) {
@@ -37544,7 +37155,7 @@ BasicSourceMapConsumer.fromSourceMap =
     smc.file = aSourceMap._file;
     smc._sourceMapURL = aSourceMapURL;
     smc._absoluteSources = smc._sources.toArray().map(function (s) {
-      return util$1.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);
+      return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);
     });
 
     // Because we are modifying the entries (by converting string sources and
@@ -37577,7 +37188,7 @@ BasicSourceMapConsumer.fromSourceMap =
       destGeneratedMappings.push(destMapping);
     }
 
-    quickSort(smc.__originalMappings, util$1.compareByOriginalPositions);
+    quickSort(smc.__originalMappings, util.compareByOriginalPositions);
 
     return smc;
   };
@@ -37613,6 +37224,36 @@ function Mapping() {
  * query (the ordered arrays in the `this.__generatedMappings` and
  * `this.__originalMappings` properties).
  */
+
+const compareGenerated = util.compareByGeneratedPositionsDeflatedNoLine;
+function sortGenerated(array, start) {
+  let l = array.length;
+  let n = array.length - start;
+  if (n <= 1) {
+    return;
+  } else if (n == 2) {
+    let a = array[start];
+    let b = array[start + 1];
+    if (compareGenerated(a, b) > 0) {
+      array[start] = b;
+      array[start + 1] = a;
+    }
+  } else if (n < 20) {
+    for (let i = start; i < l; i++) {
+      for (let j = i; j > start; j--) {
+        let a = array[j - 1];
+        let b = array[j];
+        if (compareGenerated(a, b) <= 0) {
+          break;
+        }
+        array[j - 1] = b;
+        array[j] = a;
+      }
+    }
+  } else {
+    quickSort(array, compareGenerated, start);
+  }
+}
 BasicSourceMapConsumer.prototype._parseMappings =
   function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
     var generatedLine = 1;
@@ -37623,17 +37264,20 @@ BasicSourceMapConsumer.prototype._parseMappings =
     var previousName = 0;
     var length = aStr.length;
     var index = 0;
-    var cachedSegments = {};
     var temp = {};
     var originalMappings = [];
     var generatedMappings = [];
-    var mapping, str, segment, end, value;
+    var mapping, segment, end, value;
 
+    let subarrayStart = 0;
     while (index < length) {
       if (aStr.charAt(index) === ';') {
         generatedLine++;
         index++;
         previousGeneratedColumn = 0;
+
+        sortGenerated(generatedMappings, subarrayStart);
+        subarrayStart = generatedMappings.length;
       }
       else if (aStr.charAt(index) === ',') {
         index++;
@@ -37642,39 +37286,27 @@ BasicSourceMapConsumer.prototype._parseMappings =
         mapping = new Mapping();
         mapping.generatedLine = generatedLine;
 
-        // Because each offset is encoded relative to the previous one,
-        // many segments often have the same encoding. We can exploit this
-        // fact by caching the parsed variable length fields of each segment,
-        // allowing us to avoid a second parse if we encounter the same
-        // segment again.
         for (end = index; end < length; end++) {
           if (this._charIsMappingSeparator(aStr, end)) {
             break;
           }
         }
-        str = aStr.slice(index, end);
-
-        segment = cachedSegments[str];
-        if (segment) {
-          index += str.length;
-        } else {
-          segment = [];
-          while (index < end) {
-            base64VLQ.decode(aStr, index, temp);
-            value = temp.value;
-            index = temp.rest;
-            segment.push(value);
-          }
+        aStr.slice(index, end);
 
-          if (segment.length === 2) {
-            throw new Error('Found a source, but no line and column');
-          }
+        segment = [];
+        while (index < end) {
+          base64VLQ.decode(aStr, index, temp);
+          value = temp.value;
+          index = temp.rest;
+          segment.push(value);
+        }
 
-          if (segment.length === 3) {
-            throw new Error('Found a source and line, but no column');
-          }
+        if (segment.length === 2) {
+          throw new Error('Found a source, but no line and column');
+        }
 
-          cachedSegments[str] = segment;
+        if (segment.length === 3) {
+          throw new Error('Found a source and line, but no column');
         }
 
         // Generated column.
@@ -37705,16 +37337,27 @@ BasicSourceMapConsumer.prototype._parseMappings =
 
         generatedMappings.push(mapping);
         if (typeof mapping.originalLine === 'number') {
-          originalMappings.push(mapping);
+          let currentSource = mapping.source;
+          while (originalMappings.length <= currentSource) {
+            originalMappings.push(null);
+          }
+          if (originalMappings[currentSource] === null) {
+            originalMappings[currentSource] = [];
+          }
+          originalMappings[currentSource].push(mapping);
         }
       }
     }
 
-    quickSort(generatedMappings, util$1.compareByGeneratedPositionsDeflated);
+    sortGenerated(generatedMappings, subarrayStart);
     this.__generatedMappings = generatedMappings;
 
-    quickSort(originalMappings, util$1.compareByOriginalPositions);
-    this.__originalMappings = originalMappings;
+    for (var i = 0; i < originalMappings.length; i++) {
+      if (originalMappings[i] != null) {
+        quickSort(originalMappings[i], util.compareByOriginalPositionsNoSource);
+      }
+    }
+    this.__originalMappings = [].concat(...originalMappings);
   };
 
 /**
@@ -37795,8 +37438,8 @@ BasicSourceMapConsumer.prototype.computeColumnSpans =
 BasicSourceMapConsumer.prototype.originalPositionFor =
   function SourceMapConsumer_originalPositionFor(aArgs) {
     var needle = {
-      generatedLine: util$1.getArg(aArgs, 'line'),
-      generatedColumn: util$1.getArg(aArgs, 'column')
+      generatedLine: util.getArg(aArgs, 'line'),
+      generatedColumn: util.getArg(aArgs, 'column')
     };
 
     var index = this._findMapping(
@@ -37804,27 +37447,27 @@ BasicSourceMapConsumer.prototype.originalPositionFor =
       this._generatedMappings,
       "generatedLine",
       "generatedColumn",
-      util$1.compareByGeneratedPositionsDeflated,
-      util$1.getArg(aArgs, 'bias', SourceMapConsumer$1.GREATEST_LOWER_BOUND)
+      util.compareByGeneratedPositionsDeflated,
+      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
     );
 
     if (index >= 0) {
       var mapping = this._generatedMappings[index];
 
       if (mapping.generatedLine === needle.generatedLine) {
-        var source = util$1.getArg(mapping, 'source', null);
+        var source = util.getArg(mapping, 'source', null);
         if (source !== null) {
           source = this._sources.at(source);
-          source = util$1.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);
+          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);
         }
-        var name = util$1.getArg(mapping, 'name', null);
+        var name = util.getArg(mapping, 'name', null);
         if (name !== null) {
           name = this._names.at(name);
         }
         return {
           source: source,
-          line: util$1.getArg(mapping, 'originalLine', null),
-          column: util$1.getArg(mapping, 'originalColumn', null),
+          line: util.getArg(mapping, 'originalLine', null),
+          column: util.getArg(mapping, 'originalColumn', null),
           name: name
         };
       }
@@ -37869,12 +37512,12 @@ BasicSourceMapConsumer.prototype.sourceContentFor =
 
     var relativeSource = aSource;
     if (this.sourceRoot != null) {
-      relativeSource = util$1.relative(this.sourceRoot, relativeSource);
+      relativeSource = util.relative(this.sourceRoot, relativeSource);
     }
 
     var url;
     if (this.sourceRoot != null
-        && (url = util$1.urlParse(this.sourceRoot))) {
+        && (url = util.urlParse(this.sourceRoot))) {
       // XXX: file:// URIs and absolute paths lead to unexpected behavior for
       // many users. We can help them out when they expect file:// URIs to
       // behave like it would if they were running a local HTTP server. See
@@ -37928,7 +37571,7 @@ BasicSourceMapConsumer.prototype.sourceContentFor =
  */
 BasicSourceMapConsumer.prototype.generatedPositionFor =
   function SourceMapConsumer_generatedPositionFor(aArgs) {
-    var source = util$1.getArg(aArgs, 'source');
+    var source = util.getArg(aArgs, 'source');
     source = this._findSourceIndex(source);
     if (source < 0) {
       return {
@@ -37940,8 +37583,8 @@ BasicSourceMapConsumer.prototype.generatedPositionFor =
 
     var needle = {
       source: source,
-      originalLine: util$1.getArg(aArgs, 'line'),
-      originalColumn: util$1.getArg(aArgs, 'column')
+      originalLine: util.getArg(aArgs, 'line'),
+      originalColumn: util.getArg(aArgs, 'column')
     };
 
     var index = this._findMapping(
@@ -37949,8 +37592,8 @@ BasicSourceMapConsumer.prototype.generatedPositionFor =
       this._originalMappings,
       "originalLine",
       "originalColumn",
-      util$1.compareByOriginalPositions,
-      util$1.getArg(aArgs, 'bias', SourceMapConsumer$1.GREATEST_LOWER_BOUND)
+      util.compareByOriginalPositions,
+      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
     );
 
     if (index >= 0) {
@@ -37958,9 +37601,9 @@ BasicSourceMapConsumer.prototype.generatedPositionFor =
 
       if (mapping.source === needle.source) {
         return {
-          line: util$1.getArg(mapping, 'generatedLine', null),
-          column: util$1.getArg(mapping, 'generatedColumn', null),
-          lastColumn: util$1.getArg(mapping, 'lastGeneratedColumn', null)
+          line: util.getArg(mapping, 'generatedLine', null),
+          column: util.getArg(mapping, 'generatedColumn', null),
+          lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
         };
       }
     }
@@ -37972,8 +37615,6 @@ BasicSourceMapConsumer.prototype.generatedPositionFor =
     };
   };
 
-sourceMapConsumer.BasicSourceMapConsumer = BasicSourceMapConsumer;
-
 /**
  * An IndexedSourceMapConsumer instance represents a parsed source map which
  * we can query for information. It differs from BasicSourceMapConsumer in
@@ -38026,11 +37667,11 @@ sourceMapConsumer.BasicSourceMapConsumer = BasicSourceMapConsumer;
 function IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {
   var sourceMap = aSourceMap;
   if (typeof aSourceMap === 'string') {
-    sourceMap = util$1.parseSourceMapInput(aSourceMap);
+    sourceMap = util.parseSourceMapInput(aSourceMap);
   }
 
-  var version = util$1.getArg(sourceMap, 'version');
-  var sections = util$1.getArg(sourceMap, 'sections');
+  var version = util.getArg(sourceMap, 'version');
+  var sections = util.getArg(sourceMap, 'sections');
 
   if (version != this._version) {
     throw new Error('Unsupported version: ' + version);
@@ -38049,9 +37690,9 @@ function IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {
       // See https://github.com/mozilla/source-map/issues/16
       throw new Error('Support for url field in sections not implemented.');
     }
-    var offset = util$1.getArg(s, 'offset');
-    var offsetLine = util$1.getArg(offset, 'line');
-    var offsetColumn = util$1.getArg(offset, 'column');
+    var offset = util.getArg(s, 'offset');
+    var offsetLine = util.getArg(offset, 'line');
+    var offsetColumn = util.getArg(offset, 'column');
 
     if (offsetLine < lastOffset.line ||
         (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {
@@ -38066,13 +37707,13 @@ function IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {
         generatedLine: offsetLine + 1,
         generatedColumn: offsetColumn + 1
       },
-      consumer: new SourceMapConsumer$1(util$1.getArg(s, 'map'), aSourceMapURL)
+      consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)
     }
   });
 }
 
-IndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer$1.prototype);
-IndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer$1;
+IndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+IndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;
 
 /**
  * The version of the source mapping spec that we are consuming.
@@ -38116,8 +37757,8 @@ Object.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {
 IndexedSourceMapConsumer.prototype.originalPositionFor =
   function IndexedSourceMapConsumer_originalPositionFor(aArgs) {
     var needle = {
-      generatedLine: util$1.getArg(aArgs, 'line'),
-      generatedColumn: util$1.getArg(aArgs, 'column')
+      generatedLine: util.getArg(aArgs, 'line'),
+      generatedColumn: util.getArg(aArgs, 'column')
     };
 
     // Find the section containing the generated position we're trying to map
@@ -38213,7 +37854,7 @@ IndexedSourceMapConsumer.prototype.generatedPositionFor =
 
       // Only consider this section if the requested source is in the list of
       // sources of the consumer.
-      if (section.consumer._findSourceIndex(util$1.getArg(aArgs, 'source')) === -1) {
+      if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {
         continue;
       }
       var generatedPosition = section.consumer.generatedPositionFor(aArgs);
@@ -38252,7 +37893,7 @@ IndexedSourceMapConsumer.prototype._parseMappings =
         var mapping = sectionMappings[j];
 
         var source = section.consumer._sources.at(mapping.source);
-        source = util$1.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);
+        source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);
         this._sources.add(source);
         source = this._sources.indexOf(source);
 
@@ -38287,432 +37928,10 @@ IndexedSourceMapConsumer.prototype._parseMappings =
       }
     }
 
-    quickSort(this.__generatedMappings, util$1.compareByGeneratedPositionsDeflated);
-    quickSort(this.__originalMappings, util$1.compareByOriginalPositions);
+    quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);
+    quickSort(this.__originalMappings, util.compareByOriginalPositions);
   };
 
-sourceMapConsumer.IndexedSourceMapConsumer = IndexedSourceMapConsumer;
-
-/* -*- Mode: js; js-indent-level: 2; -*- */
-
-/*
- * Copyright 2011 Mozilla Foundation and contributors
- * Licensed under the New BSD license. See LICENSE or:
- * http://opensource.org/licenses/BSD-3-Clause
- */
-
-var SourceMapGenerator = sourceMapGenerator.SourceMapGenerator;
-var util = util$5;
-
-// Matches a Windows-style `\r\n` newline or a `\n` newline used by all other
-// operating systems these days (capturing the result).
-var REGEX_NEWLINE = /(\r?\n)/;
-
-// Newline character code for charCodeAt() comparisons
-var NEWLINE_CODE = 10;
-
-// Private symbol for identifying `SourceNode`s when multiple versions of
-// the source-map library are loaded. This MUST NOT CHANGE across
-// versions!
-var isSourceNode = "$$$isSourceNode$$$";
-
-/**
- * SourceNodes provide a way to abstract over interpolating/concatenating
- * snippets of generated JavaScript source code while maintaining the line and
- * column information associated with the original source code.
- *
- * @param aLine The original line number.
- * @param aColumn The original column number.
- * @param aSource The original source's filename.
- * @param aChunks Optional. An array of strings which are snippets of
- *        generated JS, or other SourceNodes.
- * @param aName The original identifier.
- */
-function SourceNode(aLine, aColumn, aSource, aChunks, aName) {
-  this.children = [];
-  this.sourceContents = {};
-  this.line = aLine == null ? null : aLine;
-  this.column = aColumn == null ? null : aColumn;
-  this.source = aSource == null ? null : aSource;
-  this.name = aName == null ? null : aName;
-  this[isSourceNode] = true;
-  if (aChunks != null) this.add(aChunks);
-}
-
-/**
- * Creates a SourceNode from generated code and a SourceMapConsumer.
- *
- * @param aGeneratedCode The generated code
- * @param aSourceMapConsumer The SourceMap for the generated code
- * @param aRelativePath Optional. The path that relative sources in the
- *        SourceMapConsumer should be relative to.
- */
-SourceNode.fromStringWithSourceMap =
-  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {
-    // The SourceNode we want to fill with the generated code
-    // and the SourceMap
-    var node = new SourceNode();
-
-    // All even indices of this array are one line of the generated code,
-    // while all odd indices are the newlines between two adjacent lines
-    // (since `REGEX_NEWLINE` captures its match).
-    // Processed fragments are accessed by calling `shiftNextLine`.
-    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);
-    var remainingLinesIndex = 0;
-    var shiftNextLine = function() {
-      var lineContents = getNextLine();
-      // The last line of a file might not have a newline.
-      var newLine = getNextLine() || "";
-      return lineContents + newLine;
-
-      function getNextLine() {
-        return remainingLinesIndex < remainingLines.length ?
-            remainingLines[remainingLinesIndex++] : undefined;
-      }
-    };
-
-    // We need to remember the position of "remainingLines"
-    var lastGeneratedLine = 1, lastGeneratedColumn = 0;
-
-    // The generate SourceNodes we need a code range.
-    // To extract it current and last mapping is used.
-    // Here we store the last mapping.
-    var lastMapping = null;
-
-    aSourceMapConsumer.eachMapping(function (mapping) {
-      if (lastMapping !== null) {
-        // We add the code from "lastMapping" to "mapping":
-        // First check if there is a new line in between.
-        if (lastGeneratedLine < mapping.generatedLine) {
-          // Associate first line with "lastMapping"
-          addMappingWithCode(lastMapping, shiftNextLine());
-          lastGeneratedLine++;
-          lastGeneratedColumn = 0;
-          // The remaining code is added without mapping
-        } else {
-          // There is no new line in between.
-          // Associate the code between "lastGeneratedColumn" and
-          // "mapping.generatedColumn" with "lastMapping"
-          var nextLine = remainingLines[remainingLinesIndex] || '';
-          var code = nextLine.substr(0, mapping.generatedColumn -
-                                        lastGeneratedColumn);
-          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -
-                                              lastGeneratedColumn);
-          lastGeneratedColumn = mapping.generatedColumn;
-          addMappingWithCode(lastMapping, code);
-          // No more remaining code, continue
-          lastMapping = mapping;
-          return;
-        }
-      }
-      // We add the generated code until the first mapping
-      // to the SourceNode without any mapping.
-      // Each line is added as separate string.
-      while (lastGeneratedLine < mapping.generatedLine) {
-        node.add(shiftNextLine());
-        lastGeneratedLine++;
-      }
-      if (lastGeneratedColumn < mapping.generatedColumn) {
-        var nextLine = remainingLines[remainingLinesIndex] || '';
-        node.add(nextLine.substr(0, mapping.generatedColumn));
-        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);
-        lastGeneratedColumn = mapping.generatedColumn;
-      }
-      lastMapping = mapping;
-    }, this);
-    // We have processed all mappings.
-    if (remainingLinesIndex < remainingLines.length) {
-      if (lastMapping) {
-        // Associate the remaining code in the current line with "lastMapping"
-        addMappingWithCode(lastMapping, shiftNextLine());
-      }
-      // and add the remaining lines without any mapping
-      node.add(remainingLines.splice(remainingLinesIndex).join(""));
-    }
-
-    // Copy sourcesContent into SourceNode
-    aSourceMapConsumer.sources.forEach(function (sourceFile) {
-      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
-      if (content != null) {
-        if (aRelativePath != null) {
-          sourceFile = util.join(aRelativePath, sourceFile);
-        }
-        node.setSourceContent(sourceFile, content);
-      }
-    });
-
-    return node;
-
-    function addMappingWithCode(mapping, code) {
-      if (mapping === null || mapping.source === undefined) {
-        node.add(code);
-      } else {
-        var source = aRelativePath
-          ? util.join(aRelativePath, mapping.source)
-          : mapping.source;
-        node.add(new SourceNode(mapping.originalLine,
-                                mapping.originalColumn,
-                                source,
-                                code,
-                                mapping.name));
-      }
-    }
-  };
-
-/**
- * Add a chunk of generated JS to this source node.
- *
- * @param aChunk A string snippet of generated JS code, another instance of
- *        SourceNode, or an array where each member is one of those things.
- */
-SourceNode.prototype.add = function SourceNode_add(aChunk) {
-  if (Array.isArray(aChunk)) {
-    aChunk.forEach(function (chunk) {
-      this.add(chunk);
-    }, this);
-  }
-  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
-    if (aChunk) {
-      this.children.push(aChunk);
-    }
-  }
-  else {
-    throw new TypeError(
-      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
-    );
-  }
-  return this;
-};
-
-/**
- * Add a chunk of generated JS to the beginning of this source node.
- *
- * @param aChunk A string snippet of generated JS code, another instance of
- *        SourceNode, or an array where each member is one of those things.
- */
-SourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {
-  if (Array.isArray(aChunk)) {
-    for (var i = aChunk.length-1; i >= 0; i--) {
-      this.prepend(aChunk[i]);
-    }
-  }
-  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
-    this.children.unshift(aChunk);
-  }
-  else {
-    throw new TypeError(
-      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
-    );
-  }
-  return this;
-};
-
-/**
- * Walk over the tree of JS snippets in this node and its children. The
- * walking function is called once for each snippet of JS and is passed that
- * snippet and the its original associated source's line/column location.
- *
- * @param aFn The traversal function.
- */
-SourceNode.prototype.walk = function SourceNode_walk(aFn) {
-  var chunk;
-  for (var i = 0, len = this.children.length; i < len; i++) {
-    chunk = this.children[i];
-    if (chunk[isSourceNode]) {
-      chunk.walk(aFn);
-    }
-    else {
-      if (chunk !== '') {
-        aFn(chunk, { source: this.source,
-                     line: this.line,
-                     column: this.column,
-                     name: this.name });
-      }
-    }
-  }
-};
-
-/**
- * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
- * each of `this.children`.
- *
- * @param aSep The separator.
- */
-SourceNode.prototype.join = function SourceNode_join(aSep) {
-  var newChildren;
-  var i;
-  var len = this.children.length;
-  if (len > 0) {
-    newChildren = [];
-    for (i = 0; i < len-1; i++) {
-      newChildren.push(this.children[i]);
-      newChildren.push(aSep);
-    }
-    newChildren.push(this.children[i]);
-    this.children = newChildren;
-  }
-  return this;
-};
-
-/**
- * Call String.prototype.replace on the very right-most source snippet. Useful
- * for trimming whitespace from the end of a source node, etc.
- *
- * @param aPattern The pattern to replace.
- * @param aReplacement The thing to replace the pattern with.
- */
-SourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {
-  var lastChild = this.children[this.children.length - 1];
-  if (lastChild[isSourceNode]) {
-    lastChild.replaceRight(aPattern, aReplacement);
-  }
-  else if (typeof lastChild === 'string') {
-    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);
-  }
-  else {
-    this.children.push(''.replace(aPattern, aReplacement));
-  }
-  return this;
-};
-
-/**
- * Set the source content for a source file. This will be added to the SourceMapGenerator
- * in the sourcesContent field.
- *
- * @param aSourceFile The filename of the source file
- * @param aSourceContent The content of the source file
- */
-SourceNode.prototype.setSourceContent =
-  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {
-    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;
-  };
-
-/**
- * Walk over the tree of SourceNodes. The walking function is called for each
- * source file content and is passed the filename and source content.
- *
- * @param aFn The traversal function.
- */
-SourceNode.prototype.walkSourceContents =
-  function SourceNode_walkSourceContents(aFn) {
-    for (var i = 0, len = this.children.length; i < len; i++) {
-      if (this.children[i][isSourceNode]) {
-        this.children[i].walkSourceContents(aFn);
-      }
-    }
-
-    var sources = Object.keys(this.sourceContents);
-    for (var i = 0, len = sources.length; i < len; i++) {
-      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);
-    }
-  };
-
-/**
- * Return the string representation of this source node. Walks over the tree
- * and concatenates all the various snippets together to one string.
- */
-SourceNode.prototype.toString = function SourceNode_toString() {
-  var str = "";
-  this.walk(function (chunk) {
-    str += chunk;
-  });
-  return str;
-};
-
-/**
- * Returns the string representation of this source node along with a source
- * map.
- */
-SourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {
-  var generated = {
-    code: "",
-    line: 1,
-    column: 0
-  };
-  var map = new SourceMapGenerator(aArgs);
-  var sourceMappingActive = false;
-  var lastOriginalSource = null;
-  var lastOriginalLine = null;
-  var lastOriginalColumn = null;
-  var lastOriginalName = null;
-  this.walk(function (chunk, original) {
-    generated.code += chunk;
-    if (original.source !== null
-        && original.line !== null
-        && original.column !== null) {
-      if(lastOriginalSource !== original.source
-         || lastOriginalLine !== original.line
-         || lastOriginalColumn !== original.column
-         || lastOriginalName !== original.name) {
-        map.addMapping({
-          source: original.source,
-          original: {
-            line: original.line,
-            column: original.column
-          },
-          generated: {
-            line: generated.line,
-            column: generated.column
-          },
-          name: original.name
-        });
-      }
-      lastOriginalSource = original.source;
-      lastOriginalLine = original.line;
-      lastOriginalColumn = original.column;
-      lastOriginalName = original.name;
-      sourceMappingActive = true;
-    } else if (sourceMappingActive) {
-      map.addMapping({
-        generated: {
-          line: generated.line,
-          column: generated.column
-        }
-      });
-      lastOriginalSource = null;
-      sourceMappingActive = false;
-    }
-    for (var idx = 0, length = chunk.length; idx < length; idx++) {
-      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {
-        generated.line++;
-        generated.column = 0;
-        // Mappings end at eol
-        if (idx + 1 === length) {
-          lastOriginalSource = null;
-          sourceMappingActive = false;
-        } else if (sourceMappingActive) {
-          map.addMapping({
-            source: original.source,
-            original: {
-              line: original.line,
-              column: original.column
-            },
-            generated: {
-              line: generated.line,
-              column: generated.column
-            },
-            name: original.name
-          });
-        }
-      } else {
-        generated.column++;
-      }
-    }
-  });
-  this.walkSourceContents(function (sourceFile, sourceContent) {
-    map.setSourceContent(sourceFile, sourceContent);
-  });
-
-  return { code: generated.code, map: map };
-};
-
-/*
- * Copyright 2009-2011 Mozilla Foundation and contributors
- * Licensed under the New BSD license. See LICENSE.txt or:
- * http://opensource.org/licenses/BSD-3-Clause
- */
-var SourceMapConsumer = sourceMapConsumer.SourceMapConsumer;
-
 /**
  * This file is refactored into TypeScript based on
  * https://github.com/preactjs/wmr/blob/main/packages/wmr/src/lib/rollup-plugin-container.js
@@ -38908,11 +38127,11 @@ async function createPluginContainer({ plugins, logger, root, build: { rollupOpt
             if (err.loc && ctx instanceof TransformContext) {
                 const rawSourceMap = ctx._getCombinedSourcemap();
                 if (rawSourceMap) {
-                    const consumer = new SourceMapConsumer(rawSourceMap);
+                    const consumer = new SourceMapConsumer_1(rawSourceMap);
                     const { source, line, column } = consumer.originalPositionFor({
                         line: Number(err.loc.line),
                         column: Number(err.loc.column),
-                        bias: SourceMapConsumer.GREATEST_LOWER_BOUND
+                        bias: SourceMapConsumer_1.GREATEST_LOWER_BOUND
                     });
                     if (source) {
                         err.loc = { file: source, line, column };
@@ -39605,8 +38824,7 @@ function loadFallbackPlugin() {
     };
 }
 
-function resolveBuildOptions(root, raw, isBuild) {
-    var _a;
+function resolveBuildOptions(raw) {
     const resolved = {
         target: 'modules',
         polyfillModulePreload: true,
@@ -39641,35 +38859,6 @@ function resolveBuildOptions(root, raw, isBuild) {
             ...raw === null || raw === void 0 ? void 0 : raw.dynamicImportVarsOptions
         }
     };
-    const resolve = (p) => p.startsWith('\0') ? p : path__default.resolve(root, p);
-    resolved.outDir = resolve(resolved.outDir);
-    let input;
-    if ((_a = raw === null || raw === void 0 ? void 0 : raw.rollupOptions) === null || _a === void 0 ? void 0 : _a.input) {
-        input = Array.isArray(raw.rollupOptions.input)
-            ? raw.rollupOptions.input.map((input) => resolve(input))
-            : typeof raw.rollupOptions.input === 'object'
-                ? Object.fromEntries(Object.entries(raw.rollupOptions.input).map(([key, value]) => [
-                    key,
-                    resolve(value)
-                ]))
-                : resolve(raw.rollupOptions.input);
-    }
-    else if ((raw === null || raw === void 0 ? void 0 : raw.lib) && isBuild) {
-        input = resolve(raw.lib.entry);
-    }
-    else if (typeof (raw === null || raw === void 0 ? void 0 : raw.ssr) === 'string') {
-        input = resolve(raw.ssr);
-    }
-    else if (isBuild) {
-        input = resolve('index.html');
-    }
-    if (!!(raw === null || raw === void 0 ? void 0 : raw.ssr) && typeof input === 'string' && input.endsWith('.html')) {
-        throw new Error(`rollupOptions.input should not be an html file when building for SSR. ` +
-            `Please specify a dedicated SSR entry.`);
-    }
-    if (input) {
-        resolved.rollupOptions.input = input;
-    }
     // handle special build targets
     if (resolved.target === 'modules') {
         // Support browserslist
@@ -39749,18 +38938,27 @@ async function build(inlineConfig = {}) {
     }
 }
 async function doBuild(inlineConfig = {}) {
-    var _a, _b, _c;
+    var _a, _b, _c, _d;
     const config = await resolveConfig(inlineConfig, 'build', 'production');
     const options = config.build;
-    const input = options.rollupOptions.input;
-    const outDir = options.outDir;
     const ssr = !!options.ssr;
     const libOptions = options.lib;
     config.logger.info(colors$1.cyan(`vite v${require('vite/package.json').version} ${colors$1.green(`building ${ssr ? `SSR bundle ` : ``}for ${config.mode}...`)}`));
+    const resolve = (p) => path__default.resolve(config.root, p);
+    const input = libOptions
+        ? resolve(libOptions.entry)
+        : typeof options.ssr === 'string'
+            ? resolve(options.ssr)
+            : ((_a = options.rollupOptions) === null || _a === void 0 ? void 0 : _a.input) || resolve('index.html');
+    if (ssr && typeof input === 'string' && input.endsWith('.html')) {
+        throw new Error(`rollupOptions.input should not be an html file when building for SSR. ` +
+            `Please specify a dedicated SSR entry.`);
+    }
+    const outDir = resolve(options.outDir);
     // inject ssr arg to plugin load/transform hooks
     const plugins = (ssr ? config.plugins.map((p) => injectSsrFlagToHooks(p)) : config.plugins);
     // inject ssrExternal if present
-    const userExternal = (_a = options.rollupOptions) === null || _a === void 0 ? void 0 : _a.external;
+    const userExternal = (_b = options.rollupOptions) === null || _b === void 0 ? void 0 : _b.external;
     let external = userExternal;
     if (ssr) {
         // see if we have cached deps data available
@@ -39779,6 +38977,7 @@ async function doBuild(inlineConfig = {}) {
     }
     const rollup = require('rollup');
     const rollupOptions = {
+        input,
         context: 'globalThis',
         preserveEntrySignatures: ssr
             ? 'allow-extension'
@@ -39841,7 +39040,7 @@ async function doBuild(inlineConfig = {}) {
             };
         };
         // resolve lib mode outputs
-        const outputs = resolveBuildOutputs((_b = options.rollupOptions) === null || _b === void 0 ? void 0 : _b.output, libOptions, config.logger);
+        const outputs = resolveBuildOutputs((_c = options.rollupOptions) === null || _c === void 0 ? void 0 : _c.output, libOptions, config.logger);
         // watch file changes with rollup
         if (config.build.watch) {
             config.logger.info(colors$1.cyan(`\nwatching for file changes...`));
@@ -39867,7 +39066,7 @@ async function doBuild(inlineConfig = {}) {
                         ignored: [
                             '**/node_modules/**',
                             '**/.git/**',
-                            ...(((_c = watcherOptions === null || watcherOptions === void 0 ? void 0 : watcherOptions.chokidar) === null || _c === void 0 ? void 0 : _c.ignored) || [])
+                            ...(((_d = watcherOptions === null || watcherOptions === void 0 ? void 0 : watcherOptions.chokidar) === null || _d === void 0 ? void 0 : _d.ignored) || [])
                         ]
                     }
                 }
@@ -44046,7 +43245,15 @@ async _handleSymlink(entry, directory, path, item) {
   if (!this.fsw.options.followSymlinks) {
     // watch symlink directly (don't follow) and detect changes
     this.fsw._incrReadyCount();
-    const linkPath = await fsrealpath(path);
+
+    let linkPath;
+    try {
+      linkPath = await fsrealpath(path);
+    } catch (e) {
+      this.fsw._emitReady();
+      return true;
+    }
+
     if (this.fsw.closed) return;
     if (dir.has(item)) {
       if (this.fsw._symlinkPaths.get(full) !== linkPath) {
@@ -45829,7 +45036,7 @@ async function getCertificate(cacheDir) {
         return content;
     }
     catch {
-        const content = (await Promise.resolve().then(function () { return require('./dep-885d4c21.js'); })).createCertificate();
+        const content = (await Promise.resolve().then(function () { return require('./dep-6a30742f.js'); })).createCertificate();
         fs$n.promises
             .mkdir(cacheDir, { recursive: true })
             .then(() => fs$n.promises.writeFile(cachePath, content))
@@ -46369,7 +45576,7 @@ class PerMessageDeflate$4 {
   /**
    * Compress data. Concurrency limited.
    *
-   * @param {Buffer} data Data to compress
+   * @param {(Buffer|String)} data Data to compress
    * @param {Boolean} fin Specifies whether or not this is the last fragment
    * @param {Function} callback Callback
    * @public
@@ -46451,7 +45658,7 @@ class PerMessageDeflate$4 {
   /**
    * Compress data.
    *
-   * @param {Buffer} data Data to compress
+   * @param {(Buffer|String)} data Data to compress
    * @param {Boolean} fin Specifies whether or not this is the last fragment
    * @param {Function} callback Callback
    * @private
@@ -47316,6 +46523,7 @@ const { EMPTY_BUFFER: EMPTY_BUFFER$1 } = constants;
 const { isValidStatusCode } = validation.exports;
 const { mask: applyMask, toBuffer: toBuffer$2 } = bufferUtil$1.exports;
 
+const kByteLength = Symbol('kByteLength');
 const maskBuffer = Buffer.alloc(4);
 
 /**
@@ -47351,7 +46559,7 @@ class Sender$1 {
   /**
    * Frames a piece of data according to the HyBi WebSocket protocol.
    *
-   * @param {Buffer} data The data to frame
+   * @param {(Buffer|String)} data The data to frame
    * @param {Object} options Options object
    * @param {Boolean} [options.fin=false] Specifies whether or not to set the
    *     FIN bit
@@ -47366,7 +46574,7 @@ class Sender$1 {
    *     modified
    * @param {Boolean} [options.rsv1=false] Specifies whether or not to set the
    *     RSV1 bit
-   * @return {Buffer[]} The framed data as a list of `Buffer` instances
+   * @return {(Buffer|String)[]} The framed data
    * @public
    */
   static frame(data, options) {
@@ -47385,22 +46593,37 @@ class Sender$1 {
       }
 
       skipMasking = (mask[0] | mask[1] | mask[2] | mask[3]) === 0;
-      if (options.readOnly && !skipMasking) merge = true;
-
       offset = 6;
     }
 
-    let payloadLength = data.length;
+    let dataLength;
 
-    if (data.length >= 65536) {
+    if (typeof data === 'string') {
+      if (
+        (!options.mask || skipMasking) &&
+        options[kByteLength] !== undefined
+      ) {
+        dataLength = options[kByteLength];
+      } else {
+        data = Buffer.from(data);
+        dataLength = data.length;
+      }
+    } else {
+      dataLength = data.length;
+      merge = options.mask && options.readOnly && !skipMasking;
+    }
+
+    let payloadLength = dataLength;
+
+    if (dataLength >= 65536) {
       offset += 8;
       payloadLength = 127;
-    } else if (data.length > 125) {
+    } else if (dataLength > 125) {
       offset += 2;
       payloadLength = 126;
     }
 
-    const target = Buffer.allocUnsafe(merge ? data.length + offset : offset);
+    const target = Buffer.allocUnsafe(merge ? dataLength + offset : offset);
 
     target[0] = options.fin ? options.opcode | 0x80 : options.opcode;
     if (options.rsv1) target[0] |= 0x40;
@@ -47408,10 +46631,10 @@ class Sender$1 {
     target[1] = payloadLength;
 
     if (payloadLength === 126) {
-      target.writeUInt16BE(data.length, 2);
+      target.writeUInt16BE(dataLength, 2);
     } else if (payloadLength === 127) {
       target[2] = target[3] = 0;
-      target.writeUIntBE(data.length, 4, 6);
+      target.writeUIntBE(dataLength, 4, 6);
     }
 
     if (!options.mask) return [target, data];
@@ -47425,11 +46648,11 @@ class Sender$1 {
     if (skipMasking) return [target, data];
 
     if (merge) {
-      applyMask(data, mask, target, offset, data.length);
+      applyMask(data, mask, target, offset, dataLength);
       return [target];
     }
 
-    applyMask(data, mask, data, 0, data.length);
+    applyMask(data, mask, data, 0, dataLength);
     return [target, data];
   }
 
@@ -47469,36 +46692,24 @@ class Sender$1 {
       }
     }
 
+    const options = {
+      [kByteLength]: buf.length,
+      fin: true,
+      generateMask: this._generateMask,
+      mask,
+      maskBuffer: this._maskBuffer,
+      opcode: 0x08,
+      readOnly: false,
+      rsv1: false
+    };
+
     if (this._deflating) {
-      this.enqueue([this.doClose, buf, mask, cb]);
+      this.enqueue([this.dispatch, buf, false, options, cb]);
     } else {
-      this.doClose(buf, mask, cb);
+      this.sendFrame(Sender$1.frame(buf, options), cb);
     }
   }
 
-  /**
-   * Frames and sends a close message.
-   *
-   * @param {Buffer} data The message to send
-   * @param {Boolean} [mask=false] Specifies whether or not to mask `data`
-   * @param {Function} [cb] Callback
-   * @private
-   */
-  doClose(data, mask, cb) {
-    this.sendFrame(
-      Sender$1.frame(data, {
-        fin: true,
-        rsv1: false,
-        opcode: 0x08,
-        mask,
-        maskBuffer: this._maskBuffer,
-        generateMask: this._generateMask,
-        readOnly: false
-      }),
-      cb
-    );
-  }
-
   /**
    * Sends a ping message to the other peer.
    *
@@ -47508,43 +46719,40 @@ class Sender$1 {
    * @public
    */
   ping(data, mask, cb) {
-    const buf = toBuffer$2(data);
+    let byteLength;
+    let readOnly;
 
-    if (buf.length > 125) {
+    if (typeof data === 'string') {
+      byteLength = Buffer.byteLength(data);
+      readOnly = false;
+    } else {
+      data = toBuffer$2(data);
+      byteLength = data.length;
+      readOnly = toBuffer$2.readOnly;
+    }
+
+    if (byteLength > 125) {
       throw new RangeError('The data size must not be greater than 125 bytes');
     }
 
+    const options = {
+      [kByteLength]: byteLength,
+      fin: true,
+      generateMask: this._generateMask,
+      mask,
+      maskBuffer: this._maskBuffer,
+      opcode: 0x09,
+      readOnly,
+      rsv1: false
+    };
+
     if (this._deflating) {
-      this.enqueue([this.doPing, buf, mask, toBuffer$2.readOnly, cb]);
+      this.enqueue([this.dispatch, data, false, options, cb]);
     } else {
-      this.doPing(buf, mask, toBuffer$2.readOnly, cb);
+      this.sendFrame(Sender$1.frame(data, options), cb);
     }
   }
 
-  /**
-   * Frames and sends a ping message.
-   *
-   * @param {Buffer} data The message to send
-   * @param {Boolean} [mask=false] Specifies whether or not to mask `data`
-   * @param {Boolean} [readOnly=false] Specifies whether `data` can be modified
-   * @param {Function} [cb] Callback
-   * @private
-   */
-  doPing(data, mask, readOnly, cb) {
-    this.sendFrame(
-      Sender$1.frame(data, {
-        fin: true,
-        rsv1: false,
-        opcode: 0x09,
-        mask,
-        maskBuffer: this._maskBuffer,
-        generateMask: this._generateMask,
-        readOnly
-      }),
-      cb
-    );
-  }
-
   /**
    * Sends a pong message to the other peer.
    *
@@ -47554,43 +46762,40 @@ class Sender$1 {
    * @public
    */
   pong(data, mask, cb) {
-    const buf = toBuffer$2(data);
+    let byteLength;
+    let readOnly;
 
-    if (buf.length > 125) {
+    if (typeof data === 'string') {
+      byteLength = Buffer.byteLength(data);
+      readOnly = false;
+    } else {
+      data = toBuffer$2(data);
+      byteLength = data.length;
+      readOnly = toBuffer$2.readOnly;
+    }
+
+    if (byteLength > 125) {
       throw new RangeError('The data size must not be greater than 125 bytes');
     }
 
+    const options = {
+      [kByteLength]: byteLength,
+      fin: true,
+      generateMask: this._generateMask,
+      mask,
+      maskBuffer: this._maskBuffer,
+      opcode: 0x0a,
+      readOnly,
+      rsv1: false
+    };
+
     if (this._deflating) {
-      this.enqueue([this.doPong, buf, mask, toBuffer$2.readOnly, cb]);
+      this.enqueue([this.dispatch, data, false, options, cb]);
     } else {
-      this.doPong(buf, mask, toBuffer$2.readOnly, cb);
+      this.sendFrame(Sender$1.frame(data, options), cb);
     }
   }
 
-  /**
-   * Frames and sends a pong message.
-   *
-   * @param {Buffer} data The message to send
-   * @param {Boolean} [mask=false] Specifies whether or not to mask `data`
-   * @param {Boolean} [readOnly=false] Specifies whether `data` can be modified
-   * @param {Function} [cb] Callback
-   * @private
-   */
-  doPong(data, mask, readOnly, cb) {
-    this.sendFrame(
-      Sender$1.frame(data, {
-        fin: true,
-        rsv1: false,
-        opcode: 0x0a,
-        mask,
-        maskBuffer: this._maskBuffer,
-        generateMask: this._generateMask,
-        readOnly
-      }),
-      cb
-    );
-  }
-
   /**
    * Sends a data message to the other peer.
    *
@@ -47608,11 +46813,22 @@ class Sender$1 {
    * @public
    */
   send(data, options, cb) {
-    const buf = toBuffer$2(data);
     const perMessageDeflate = this._extensions[PerMessageDeflate$2.extensionName];
     let opcode = options.binary ? 2 : 1;
     let rsv1 = options.compress;
 
+    let byteLength;
+    let readOnly;
+
+    if (typeof data === 'string') {
+      byteLength = Buffer.byteLength(data);
+      readOnly = false;
+    } else {
+      data = toBuffer$2(data);
+      byteLength = data.length;
+      readOnly = toBuffer$2.readOnly;
+    }
+
     if (this._firstFragment) {
       this._firstFragment = false;
       if (
@@ -47624,7 +46840,7 @@ class Sender$1 {
             : 'client_no_context_takeover'
         ]
       ) {
-        rsv1 = buf.length >= perMessageDeflate._threshold;
+        rsv1 = byteLength >= perMessageDeflate._threshold;
       }
       this._compress = rsv1;
     } else {
@@ -47636,30 +46852,32 @@ class Sender$1 {
 
     if (perMessageDeflate) {
       const opts = {
+        [kByteLength]: byteLength,
         fin: options.fin,
-        rsv1,
-        opcode,
+        generateMask: this._generateMask,
         mask: options.mask,
         maskBuffer: this._maskBuffer,
-        generateMask: this._generateMask,
-        readOnly: toBuffer$2.readOnly
+        opcode,
+        readOnly,
+        rsv1
       };
 
       if (this._deflating) {
-        this.enqueue([this.dispatch, buf, this._compress, opts, cb]);
+        this.enqueue([this.dispatch, data, this._compress, opts, cb]);
       } else {
-        this.dispatch(buf, this._compress, opts, cb);
+        this.dispatch(data, this._compress, opts, cb);
       }
     } else {
       this.sendFrame(
-        Sender$1.frame(buf, {
+        Sender$1.frame(data, {
+          [kByteLength]: byteLength,
           fin: options.fin,
-          rsv1: false,
-          opcode,
+          generateMask: this._generateMask,
           mask: options.mask,
           maskBuffer: this._maskBuffer,
-          generateMask: this._generateMask,
-          readOnly: toBuffer$2.readOnly
+          opcode,
+          readOnly,
+          rsv1: false
         }),
         cb
       );
@@ -47667,13 +46885,12 @@ class Sender$1 {
   }
 
   /**
-   * Dispatches a data message.
+   * Dispatches a message.
    *
-   * @param {Buffer} data The message to send
+   * @param {(Buffer|String)} data The message to send
    * @param {Boolean} [compress=false] Specifies whether or not to compress
    *     `data`
    * @param {Object} options Options object
-   * @param {Number} options.opcode The opcode
    * @param {Boolean} [options.fin=false] Specifies whether or not to set the
    *     FIN bit
    * @param {Function} [options.generateMask] The function used to generate the
@@ -47682,6 +46899,7 @@ class Sender$1 {
    *     `data`
    * @param {Buffer} [options.maskBuffer] The buffer used to store the masking
    *     key
+   * @param {Number} options.opcode The opcode
    * @param {Boolean} [options.readOnly=false] Specifies whether `data` can be
    *     modified
    * @param {Boolean} [options.rsv1=false] Specifies whether or not to set the
@@ -47697,7 +46915,7 @@ class Sender$1 {
 
     const perMessageDeflate = this._extensions[PerMessageDeflate$2.extensionName];
 
-    this._bufferedBytes += data.length;
+    this._bufferedBytes += options[kByteLength];
     this._deflating = true;
     perMessageDeflate.compress(data, options.fin, (_, buf) => {
       if (this._socket.destroyed) {
@@ -47708,7 +46926,8 @@ class Sender$1 {
         if (typeof cb === 'function') cb(err);
 
         for (let i = 0; i < this._queue.length; i++) {
-          const callback = this._queue[i][4];
+          const params = this._queue[i];
+          const callback = params[params.length - 1];
 
           if (typeof callback === 'function') callback(err);
         }
@@ -47716,7 +46935,7 @@ class Sender$1 {
         return;
       }
 
-      this._bufferedBytes -= data.length;
+      this._bufferedBytes -= options[kByteLength];
       this._deflating = false;
       options.readOnly = false;
       this.sendFrame(Sender$1.frame(buf, options), cb);
@@ -47733,7 +46952,7 @@ class Sender$1 {
     while (!this._deflating && this._queue.length) {
       const params = this._queue.shift();
 
-      this._bufferedBytes -= params[1].length;
+      this._bufferedBytes -= params[3][kByteLength];
       Reflect.apply(params[0], this, params.slice(1));
     }
   }
@@ -47745,7 +46964,7 @@ class Sender$1 {
    * @private
    */
   enqueue(params) {
-    this._bufferedBytes += params[1].length;
+    this._bufferedBytes += params[3][kByteLength];
     this._queue.push(params);
   }
 
@@ -48245,7 +47464,7 @@ const http$3 = require$$1__default$2;
 const net = require$$3__default;
 const tls = require$$4__default;
 const { randomBytes, createHash: createHash$1 } = require$$1__default$3;
-const { URL: URL$2 } = require$$0__default$5;
+const { URL: URL$1 } = require$$0__default$5;
 
 const PerMessageDeflate$1 = permessageDeflate;
 const Receiver = receiver;
@@ -48898,12 +48117,12 @@ function initAsClient(websocket, address, protocols, options) {
 
   let parsedUrl;
 
-  if (address instanceof URL$2) {
+  if (address instanceof URL$1) {
     parsedUrl = address;
     websocket._url = address.href;
   } else {
     try {
-      parsedUrl = new URL$2(address);
+      parsedUrl = new URL$1(address);
     } catch (e) {
       throw new SyntaxError(`Invalid URL: ${address}`);
     }
@@ -49037,7 +48256,7 @@ function initAsClient(websocket, address, protocols, options) {
       let addr;
 
       try {
-        addr = new URL$2(location, address);
+        addr = new URL$1(location, address);
       } catch (e) {
         const err = new SyntaxError(`Invalid URL: ${location}`);
         emitErrorAndClose(websocket, err);
@@ -50947,7 +50166,7 @@ var debug_1 = function () {
 };
 
 var url$1 = require$$0__default$5;
-var URL$1 = url$1.URL;
+var URL = url$1.URL;
 var http$1 = require$$1__default$2;
 var https$1 = require$$1__default$4;
 var Writable = require$$0__default$2.Writable;
@@ -51398,14 +50617,14 @@ function wrap(protocols) {
       if (typeof input === "string") {
         var urlStr = input;
         try {
-          input = urlToOptions(new URL$1(urlStr));
+          input = urlToOptions(new URL(urlStr));
         }
         catch (err) {
           /* istanbul ignore next */
           input = url$1.parse(urlStr);
         }
       }
-      else if (URL$1 && (input instanceof URL$1)) {
+      else if (URL && (input instanceof URL)) {
         input = urlToOptions(input);
       }
       else {
@@ -51447,7 +50666,7 @@ function wrap(protocols) {
 }
 
 /* istanbul ignore next */
-function noop$2() { /* empty */ }
+function noop$1() { /* empty */ }
 
 // from https://github.com/nodejs/node/blob/master/lib/internal/url.js
 function urlToOptions(urlObject) {
@@ -51503,7 +50722,7 @@ function abortRequest(request) {
   for (var e = 0; e < events.length; e++) {
     request.removeListener(events[e], eventHandlers[events[e]]);
   }
-  request.on("error", noop$2);
+  request.on("error", noop$1);
   request.abort();
 }
 
@@ -52963,7 +52182,7 @@ async function ssrTransform(code, inMap, url) {
                 // let binding used in a property shorthand
                 // { foo } -> { foo: __import_x__.foo }
                 // skip for destructuring patterns
-                if (!parent.inPattern ||
+                if (!isNodeInPatternWeakMap.get(parent) ||
                     isInDestructuringAssignment(parent, parentStack)) {
                     s.appendLeft(id.end, `: ${binding}`);
                 }
@@ -53014,6 +52233,7 @@ async function ssrTransform(code, inMap, url) {
         dynamicDeps: [...dynamicDeps]
     };
 }
+const isNodeInPatternWeakMap = new WeakMap();
 /**
  * Same logic from \@vue/compiler-core & \@vue/compiler-sfc
  * Except this is using acorn AST
@@ -53127,7 +52347,8 @@ function walk(root, { onIdentifier, onImportMeta, onDynamicImport }) {
                 });
             }
             else if (node.type === 'Property' && parent.type === 'ObjectPattern') {
-                node.inPattern = true;
+                // mark property in destructuring pattern
+                isNodeInPatternWeakMap.set(node, true);
             }
             else if (node.type === 'VariableDeclarator') {
                 const parentFunction = findParentFunction(parentStack);
@@ -53171,7 +52392,7 @@ function isRefIdentifier(id, parent, parentStack) {
     }
     // property key
     // this also covers object destructuring pattern
-    if (isStaticPropertyKey(id, parent) || parent.inPattern) {
+    if (isStaticPropertyKey(id, parent) || isNodeInPatternWeakMap.get(parent)) {
         return false;
     }
     // non-assignment array destructuring pattern
@@ -53300,7 +52521,7 @@ function parse$5(req) {
 	return req._parsedUrl = { pathname, search, query, raw };
 }
 
-const noop$1 = () => {};
+const noop = () => {};
 
 function isMatch(uri, arr) {
 	for (let i=0; i < arr.length; i++) {
@@ -53411,7 +52632,7 @@ function sirv (dir, opts={}) {
 	dir = path$r.resolve(dir || '.');
 
 	let isNotFound = opts.onNoMatch || is404;
-	let setHeaders = opts.setHeaders || noop$1;
+	let setHeaders = opts.setHeaders || noop;
 
 	let extensions = opts.extensions || ['html', 'htm'];
 	let gzips = opts.gzip && extensions.map(x => `${x}.gz`).concat('gz');
@@ -56482,7 +55703,7 @@ ssr) {
         for (const id of include) {
             // normalize 'foo   >bar` as 'foo > bar' to prevent same id being added
             // and for pretty printing
-            const normalizedId = normalizeId$1(id);
+            const normalizedId = normalizeId(id);
             if (!deps[normalizedId]) {
                 const entry = await resolve(id);
                 if (entry) {
@@ -56689,13 +55910,11 @@ function ssrRewriteStacktrace(stack, moduleGraph) {
             if (!rawSourceMap) {
                 return input;
             }
-            // In `source-map:v0.7.0+` this constructor returns a Promise...
-            // How can we make this block async?
-            const consumer = new SourceMapConsumer(rawSourceMap);
+            const consumer = new SourceMapConsumer_1(rawSourceMap);
             const pos = consumer.originalPositionFor({
                 line: Number(line) - offset,
                 column: Number(column),
-                bias: SourceMapConsumer.LEAST_UPPER_BOUND
+                bias: SourceMapConsumer_1.LEAST_UPPER_BOUND
             });
             if (!pos.source) {
                 return input;
@@ -56932,8 +56151,11 @@ async function nodeImport(id, importer, resolveOptions) {
     // When an ESM module imports an ESM dependency, this hook is *not* used.
     const unhookNodeResolve = hookNodeResolve((nodeResolve) => (id, parent, isMain, options) => {
         // Use the Vite resolver only for bare imports while skipping
-        // any built-in modules and binary modules.
-        if (!bareImportRE.test(id) || isBuiltin(id) || id.endsWith('.node')) {
+        // any absolute paths, built-in modules and binary modules.
+        if (!bareImportRE.test(id) ||
+            path__default.isAbsolute(id) ||
+            isBuiltin(id) ||
+            id.endsWith('.node')) {
             return nodeResolve(id, parent, isMain, options);
         }
         if (parent) {
@@ -57026,7 +56248,9 @@ function createMissingImporterRegisterFn(server) {
             const newData = (server._optimizeDepsMetadata = await optimizeDeps(server.config, true, false, newDeps, ssr));
             knownOptimized = newData.optimized;
             // update ssr externals
-            server._ssrExternals = resolveSSRExternal(server.config, Object.keys(knownOptimized));
+            if (ssr) {
+                server._ssrExternals = resolveSSRExternal(server.config, Object.keys(knownOptimized));
+            }
             logger.info(colors$1.green(`✨ dependencies updated, reloading page...`), {
                 timestamp: true
             });
@@ -57073,12 +56297,14 @@ function createMissingImporterRegisterFn(server) {
 const ROOT_FILES = [
     // '.git',
     // https://pnpm.js.org/workspaces/
-    'pnpm-workspace.yaml'
+    'pnpm-workspace.yaml',
     // https://rushjs.io/pages/advanced/config_files/
     // 'rush.json',
     // https://nx.dev/latest/react/getting-started/nx-setup
     // 'workspace.json',
-    // 'nx.json'
+    // 'nx.json',
+    // https://github.com/lerna/lerna#lernajson
+    'lerna.json'
 ];
 // npm: https://docs.npmjs.com/cli/v7/using-npm/workspaces#installing-workspaces
 // yarn: https://classic.yarnpkg.com/en/docs/workspaces/#toc-how-to-use-it
@@ -70264,7 +69490,6 @@ async function preview(inlineConfig) {
     };
 }
 
-const noop = () => null;
 function matches(pattern, importee) {
     if (pattern instanceof RegExp) {
         return pattern.test(importee);
@@ -70275,36 +69500,35 @@ function matches(pattern, importee) {
     if (importee === pattern) {
         return true;
     }
-    const importeeStartsWithKey = importee.indexOf(pattern) === 0;
-    const importeeHasSlashAfterKey = importee.substring(pattern.length)[0] === '/';
-    return importeeStartsWithKey && importeeHasSlashAfterKey;
+    // eslint-disable-next-line prefer-template
+    return importee.startsWith(pattern + '/');
 }
-function normalizeId(id) {
-    return id;
-}
-function getEntries({ entries }) {
+function getEntries({ entries, customResolver }) {
     if (!entries) {
         return [];
     }
+    const resolverFunctionFromOptions = resolveCustomResolver(customResolver);
     if (Array.isArray(entries)) {
-        return entries;
+        return entries.map((entry) => {
+            return {
+                find: entry.find,
+                replacement: entry.replacement,
+                resolverFunction: resolveCustomResolver(entry.customResolver) || resolverFunctionFromOptions
+            };
+        });
     }
     return Object.entries(entries).map(([key, value]) => {
-        return { find: key, replacement: value };
+        return { find: key, replacement: value, resolverFunction: resolverFunctionFromOptions };
     });
 }
-function getCustomResolver({ customResolver }, options) {
-    if (typeof customResolver === 'function') {
-        return customResolver;
-    }
-    if (customResolver && typeof customResolver.resolveId === 'function') {
-        return customResolver.resolveId;
-    }
-    if (typeof options.customResolver === 'function') {
-        return options.customResolver;
-    }
-    if (options.customResolver && typeof options.customResolver.resolveId === 'function') {
-        return options.customResolver.resolveId;
+function resolveCustomResolver(customResolver) {
+    if (customResolver) {
+        if (typeof customResolver === 'function') {
+            return customResolver;
+        }
+        if (typeof customResolver.resolveId === 'function') {
+            return customResolver.resolveId;
+        }
     }
     return null;
 }
@@ -70313,39 +69537,31 @@ function alias(options = {}) {
     if (entries.length === 0) {
         return {
             name: 'alias',
-            resolveId: noop
+            resolveId: () => null
         };
     }
     return {
         name: 'alias',
-        buildStart(inputOptions) {
-            return Promise.all([...entries, options].map(({ customResolver }) => customResolver &&
+        async buildStart(inputOptions) {
+            await Promise.all([...(Array.isArray(options.entries) ? options.entries : []), options].map(({ customResolver }) => customResolver &&
                 typeof customResolver === 'object' &&
                 typeof customResolver.buildStart === 'function' &&
-                customResolver.buildStart.call(this, inputOptions))).then(() => {
-                // enforce void return value
-            });
+                customResolver.buildStart.call(this, inputOptions)));
         },
         resolveId(importee, importer, resolveOptions) {
-            const importeeId = normalizeId(importee);
-            const importerId = normalizeId(importer);
+            if (!importer) {
+                return null;
+            }
             // First match is supposed to be the correct one
-            const matchedEntry = entries.find((entry) => matches(entry.find, importeeId));
-            if (!matchedEntry || !importerId) {
+            const matchedEntry = entries.find((entry) => matches(entry.find, importee));
+            if (!matchedEntry) {
                 return null;
             }
-            const updatedId = normalizeId(importeeId.replace(matchedEntry.find, matchedEntry.replacement));
-            const customResolver = getCustomResolver(matchedEntry, options);
-            if (customResolver) {
-                return customResolver.call(this, updatedId, importerId, resolveOptions);
+            const updatedId = importee.replace(matchedEntry.find, matchedEntry.replacement);
+            if (matchedEntry.resolverFunction) {
+                return matchedEntry.resolverFunction.call(this, updatedId, importer, resolveOptions);
             }
-            return this.resolve(updatedId, importer, Object.assign({ skipSelf: true }, resolveOptions)).then((resolved) => {
-                let finalResult = resolved;
-                if (!finalResult) {
-                    finalResult = { id: updatedId };
-                }
-                return finalResult;
-            });
+            return this.resolve(updatedId, importer, Object.assign({ skipSelf: true }, resolveOptions)).then((resolved) => resolved || { id: updatedId });
         }
     };
 }
@@ -71349,52 +70565,33 @@ async function resolvePlugins(config, prePlugins, normalPlugins, postPlugins) {
     ].filter(Boolean);
 }
 
-var main$1 = {};
-
-/* @flow */
-
-/*::
-
-type DotenvParseOptions = {
-  debug?: boolean
-}
-
-// keys and values from src
-type DotenvParseOutput = { [string]: string }
-
-type DotenvConfigOptions = {
-  path?: string, // path to .env file
-  encoding?: string, // encoding of .env file
-  debug?: string // turn on logging for debugging purposes
-}
-
-type DotenvConfigOutput = {
-  parsed?: DotenvParseOutput,
-  error?: Error
-}
-
-*/
+var main = {exports: {}};
 
 const fs = fs__default;
 const path = path__default;
 const os = require$$1__default;
 
-function log (message /*: string */) {
+function log (message) {
   console.log(`[dotenv][DEBUG] ${message}`);
 }
 
 const NEWLINE = '\n';
-const RE_INI_KEY_VAL = /^\s*([\w.-]+)\s*=\s*(.*)?\s*$/;
+const RE_INI_KEY_VAL = /^\s*([\w.-]+)\s*=\s*("[^"]*"|'[^']*'|.*?)(\s+#.*)?$/;
 const RE_NEWLINES = /\\n/g;
 const NEWLINES_MATCH = /\r\n|\n|\r/;
 
 // Parses src into an Object
-function parse (src /*: string | Buffer */, options /*: ?DotenvParseOptions */) /*: DotenvParseOutput */ {
+function parse (src, options) {
   const debug = Boolean(options && options.debug);
+  const multiline = Boolean(options && options.multiline);
   const obj = {};
 
   // convert Buffers before splitting into lines and processing
-  src.toString().split(NEWLINES_MATCH).forEach(function (line, idx) {
+  const lines = src.toString().split(NEWLINES_MATCH);
+
+  for (let idx = 0; idx < lines.length; idx++) {
+    let line = lines[idx];
+
     // matching "KEY' and 'VAL' in 'KEY=VAL'
     const keyValueArr = line.match(RE_INI_KEY_VAL);
     // matched?
@@ -71402,12 +70599,30 @@ function parse (src /*: string | Buffer */, options /*: ?DotenvParseOptions */)
       const key = keyValueArr[1];
       // default undefined or missing values to empty string
       let val = (keyValueArr[2] || '');
-      const end = val.length - 1;
+      let end = val.length - 1;
       const isDoubleQuoted = val[0] === '"' && val[end] === '"';
       const isSingleQuoted = val[0] === "'" && val[end] === "'";
 
+      const isMultilineDoubleQuoted = val[0] === '"' && val[end] !== '"';
+      const isMultilineSingleQuoted = val[0] === "'" && val[end] !== "'";
+
+      // if parsing line breaks and the value starts with a quote
+      if (multiline && (isMultilineDoubleQuoted || isMultilineSingleQuoted)) {
+        const quoteChar = isMultilineDoubleQuoted ? '"' : "'";
+
+        val = val.substring(1);
+
+        while (idx++ < lines.length - 1) {
+          line = lines[idx];
+          end = line.length - 1;
+          if (line[end] === quoteChar) {
+            val += NEWLINE + line.substring(0, end);
+            break
+          }
+          val += NEWLINE + line;
+        }
       // if single or double quoted, remove quotes
-      if (isSingleQuoted || isDoubleQuoted) {
+      } else if (isSingleQuoted || isDoubleQuoted) {
         val = val.substring(1, end);
 
         // if double quoted, expand newlines
@@ -71421,9 +70636,14 @@ function parse (src /*: string | Buffer */, options /*: ?DotenvParseOptions */)
 
       obj[key] = val;
     } else if (debug) {
-      log(`did not match key and value when parsing line ${idx + 1}: ${line}`);
+      const trimmedLine = line.trim();
+
+      // ignore empty and commented lines
+      if (trimmedLine.length && trimmedLine[0] !== '#') {
+        log(`Failed to match key and value when parsing line ${idx + 1}: ${line}`);
+      }
     }
-  });
+  }
 
   return obj
 }
@@ -71433,10 +70653,12 @@ function resolveHome (envPath) {
 }
 
 // Populates process.env from .env file
-function config (options /*: ?DotenvConfigOptions */) /*: DotenvConfigOutput */ {
+function config (options) {
   let dotenvPath = path.resolve(process.cwd(), '.env');
-  let encoding /*: string */ = 'utf8';
-  let debug = false;
+  let encoding = 'utf8';
+  const debug = Boolean(options && options.debug);
+  const override = Boolean(options && options.override);
+  const multiline = Boolean(options && options.multiline);
 
   if (options) {
     if (options.path != null) {
@@ -71445,76 +70667,109 @@ function config (options /*: ?DotenvConfigOptions */) /*: DotenvConfigOutput */
     if (options.encoding != null) {
       encoding = options.encoding;
     }
-    if (options.debug != null) {
-      debug = true;
-    }
   }
 
   try {
     // specifying an encoding returns a string instead of a buffer
-    const parsed = parse(fs.readFileSync(dotenvPath, { encoding }), { debug });
+    const parsed = DotenvModule.parse(fs.readFileSync(dotenvPath, { encoding }), { debug, multiline });
 
     Object.keys(parsed).forEach(function (key) {
       if (!Object.prototype.hasOwnProperty.call(process.env, key)) {
         process.env[key] = parsed[key];
-      } else if (debug) {
-        log(`"${key}" is already defined in \`process.env\` and will not be overwritten`);
+      } else {
+        if (override === true) {
+          process.env[key] = parsed[key];
+        }
+
+        if (debug) {
+          if (override === true) {
+            log(`"${key}" is already defined in \`process.env\` and WAS overwritten`);
+          } else {
+            log(`"${key}" is already defined in \`process.env\` and was NOT overwritten`);
+          }
+        }
       }
     });
 
     return { parsed }
   } catch (e) {
+    if (debug) {
+      log(`Failed to load ${dotenvPath} ${e.message}`);
+    }
+
     return { error: e }
   }
 }
 
-main$1.config = config;
-main$1.parse = parse;
+const DotenvModule = {
+  config,
+  parse
+};
 
-var dotenvExpand = function (config) {
-  // if ignoring process.env, use a blank object
-  var environment = config.ignoreProcessEnv ? {} : process.env;
+main.exports.config = DotenvModule.config;
+main.exports.parse = DotenvModule.parse;
+main.exports = DotenvModule;
+
+var dotenv = main.exports;
 
-  var interpolate = function (envValue) {
-    var matches = envValue.match(/(.?\${?(?:[a-zA-Z0-9_]+)?}?)/g) || [];
+function _interpolate (envValue, environment, config) {
+  const matches = envValue.match(/(.?\${*[\w]*(?::-)?[\w]*}*)/g) || [];
 
-    return matches.reduce(function (newEnv, match) {
-      var parts = /(.?)\${?([a-zA-Z0-9_]+)?}?/g.exec(match);
-      var prefix = parts[1];
+  return matches.reduce(function (newEnv, match, index) {
+    const parts = /(.?)\${*([\w]*(?::-)?[\w]*)?}*/g.exec(match);
+    if (!parts || parts.length === 0) {
+      return newEnv
+    }
 
-      var value, replacePart;
+    const prefix = parts[1];
 
-      if (prefix === '\\') {
-        replacePart = parts[0];
-        value = replacePart.replace('\\$', '$');
-      } else {
-        var key = parts[2];
-        replacePart = parts[0].substring(prefix.length);
-        // process.env value 'wins' over .env file's value
-        value = environment.hasOwnProperty(key) ? environment[key] : (config.parsed[key] || '');
+    let value, replacePart;
 
-        // Resolve recursive interpolations
-        value = interpolate(value);
+    if (prefix === '\\') {
+      replacePart = parts[0];
+      value = replacePart.replace('\\$', '$');
+    } else {
+      const keyParts = parts[2].split(':-');
+      const key = keyParts[0];
+      replacePart = parts[0].substring(prefix.length);
+      // process.env value 'wins' over .env file's value
+      value = Object.prototype.hasOwnProperty.call(environment, key)
+        ? environment[key]
+        : (config.parsed[key] || keyParts[1] || '');
+
+      // If the value is found, remove nested expansions.
+      if (keyParts.length > 1 && value) {
+        const replaceNested = matches[index + 1];
+        matches[index + 1] = '';
+
+        newEnv = newEnv.replace(replaceNested, '');
       }
+      // Resolve recursive interpolations
+      value = _interpolate(value, environment, config);
+    }
 
-      return newEnv.replace(replacePart, value)
-    }, envValue)
-  };
+    return newEnv.replace(replacePart, value)
+  }, envValue)
+}
 
-  for (var configKey in config.parsed) {
-    var value = environment.hasOwnProperty(configKey) ? environment[configKey] : config.parsed[configKey];
+function expand (config) {
+  // if ignoring process.env, use a blank object
+  const environment = config.ignoreProcessEnv ? {} : process.env;
 
-    config.parsed[configKey] = interpolate(value);
+  for (const configKey in config.parsed) {
+    const value = Object.prototype.hasOwnProperty.call(environment, configKey) ? environment[configKey] : config.parsed[configKey];
+
+    config.parsed[configKey] = _interpolate(value, environment, config);
   }
 
-  for (var processKey in config.parsed) {
+  for (const processKey in config.parsed) {
     environment[processKey] = config.parsed[processKey];
   }
 
   return config
-};
+}
 
-var main = dotenvExpand;
+var expand_1 = expand;
 
 const debug = createDebugger('vite:config');
 /**
@@ -71622,7 +70877,7 @@ async function resolveConfig(inlineConfig, command, defaultMode = 'development')
     }
     // resolve public base url
     const BASE_URL = resolveBaseUrl(config.base, command === 'build', logger);
-    const resolvedBuildOptions = resolveBuildOptions(resolvedRoot, config.build, command === 'build');
+    const resolvedBuildOptions = resolveBuildOptions(config.build);
     // resolve cache directory
     const pkgPath = lookupFile(resolvedRoot, [`package.json`], true /* pathOnly */);
     const cacheDir = config.cacheDir
@@ -72100,6 +71355,7 @@ async function loadConfigFromBundledFile(fileName, bundledCode) {
     return config;
 }
 function loadEnv(mode, envDir, prefixes = 'VITE_') {
+    var _a;
     if (mode === 'local') {
         throw new Error(`"local" cannot be used as a mode name because it conflicts with ` +
             `the .local postfix for .env files.`);
@@ -72123,11 +71379,11 @@ function loadEnv(mode, envDir, prefixes = 'VITE_') {
     for (const file of envFiles) {
         const path = lookupFile(envDir, [file], true);
         if (path) {
-            const parsed = main$1.parse(fs__default.readFileSync(path), {
-                debug: !!process.env.DEBUG || undefined
+            const parsed = dotenv.parse(fs__default.readFileSync(path), {
+                debug: ((_a = process.env.DEBUG) === null || _a === void 0 ? void 0 : _a.includes('vite:dotenv')) || undefined
             });
             // let environment variables use each other
-            main({
+            expand_1({
                 parsed,
                 // prevent process.env mutation
                 ignoreProcessEnv: true
@@ -72138,7 +71394,8 @@ function loadEnv(mode, envDir, prefixes = 'VITE_') {
                     env[key] === undefined) {
                     env[key] = value;
                 }
-                else if (key === 'NODE_ENV') {
+                else if (key === 'NODE_ENV' &&
+                    process.env.VITE_USER_NODE_ENV === undefined) {
                     // NODE_ENV override in .env file
                     process.env.VITE_USER_NODE_ENV = value;
                 }