@parcel/utils 2.0.0-dev.1712 → 2.0.0-dev.1781

package/lib/index.js

@@ -2506,6 +2506,11 @@ function makeParserClass(Parser) {
             else if (this.atEndOfWord()) throw this.error(new TomlError('Incomplete number'));
             return this.returnNow();
         }
+        parseNoUnderHexOctBinLiteral() {
+            if (this.char === CHAR_LOWBAR || this.char === CHAR_PERIOD) throw this.error(new TomlError('Unexpected character, expected digit'));
+            else if (this.atEndOfWord()) throw this.error(new TomlError('Incomplete number'));
+            return this.returnNow();
+        }
         parseNumberFloat() {
             if (this.char === CHAR_LOWBAR) return this.call(this.parseNoUnder, this.parseNumberFloat);
             else if (isDigit(this.char)) this.consume();
@@ -2561,20 +2566,20 @@ function makeParserClass(Parser) {
         parseNumberBaseOrDateTime() {
             if (this.char === CHAR_b) {
                 this.consume();
-                return this.call(this.parseNoUnder, this.parseIntegerBin);
+                return this.call(this.parseNoUnderHexOctBinLiteral, this.parseIntegerBin);
             } else if (this.char === CHAR_o) {
                 this.consume();
-                return this.call(this.parseNoUnder, this.parseIntegerOct);
+                return this.call(this.parseNoUnderHexOctBinLiteral, this.parseIntegerOct);
             } else if (this.char === CHAR_x) {
                 this.consume();
-                return this.call(this.parseNoUnder, this.parseIntegerHex);
+                return this.call(this.parseNoUnderHexOctBinLiteral, this.parseIntegerHex);
             } else if (this.char === CHAR_PERIOD) return this.goto(this.parseNumberInteger);
             else if (isDigit(this.char)) return this.goto(this.parseDateTimeOnly);
             else return this.returnNow(Integer(this.state.buf));
         }
         parseIntegerHex() {
             if (isHexit(this.char)) this.consume();
-            else if (this.char === CHAR_LOWBAR) return this.call(this.parseNoUnder);
+            else if (this.char === CHAR_LOWBAR) return this.call(this.parseNoUnderHexOctBinLiteral);
             else {
                 const result = Integer(this.state.buf);
                 /* istanbul ignore if */ if (result.isNaN()) throw this.error(new TomlError('Invalid number'));
@@ -2583,7 +2588,7 @@ function makeParserClass(Parser) {
         }
         parseIntegerOct() {
             if (isOctit(this.char)) this.consume();
-            else if (this.char === CHAR_LOWBAR) return this.call(this.parseNoUnder);
+            else if (this.char === CHAR_LOWBAR) return this.call(this.parseNoUnderHexOctBinLiteral);
             else {
                 const result = Integer(this.state.buf);
                 /* istanbul ignore if */ if (result.isNaN()) throw this.error(new TomlError('Invalid number'));
@@ -2592,7 +2597,7 @@ function makeParserClass(Parser) {
         }
         parseIntegerBin() {
             if (isBit(this.char)) this.consume();
-            else if (this.char === CHAR_LOWBAR) return this.call(this.parseNoUnder);
+            else if (this.char === CHAR_LOWBAR) return this.call(this.parseNoUnderHexOctBinLiteral);
             else {
                 const result = Integer(this.state.buf);
                 /* istanbul ignore if */ if (result.isNaN()) throw this.error(new TomlError('Invalid number'));
@@ -2621,7 +2626,7 @@ function makeParserClass(Parser) {
                 this.state.result += '-' + this.state.buf;
                 this.state.buf = '';
                 return this.next(this.parseStartTimeHour);
-            } else if (this.atEndOfWord()) return this.return($juH0i(this.state.result + '-' + this.state.buf));
+            } else if (this.atEndOfWord()) return this.returnNow($juH0i(this.state.result + '-' + this.state.buf));
             else if (isDigit(this.char)) this.consume();
             else throw this.error(new TomlError('Incomplete datetime'));
         }
@@ -3404,16 +3409,6 @@ function $d3ba36a78a2cb705$var$stringifyComplexTable(prefix, indent, key, value)
 
 });
 
-parcelRegister("ff5ZV", function(module, exports) {
-'use strict';
-module.exports = function(Yallist) {
-    Yallist.prototype[Symbol.iterator] = function*() {
-        for(let walker = this.head; walker; walker = walker.next)yield walker.value;
-    };
-};
-
-});
-
 
 $parcel$export(module.exports, "countLines", () => $2dffa662028edb3d$export$2e2bcd8739ae039);
 $parcel$export(module.exports, "generateBuildMetrics", () => $4ada344be2626398$export$2e2bcd8739ae039);
@@ -3487,6 +3482,7 @@ $parcel$export(module.exports, "loadSourceMapUrl", () => $3d4b4a41954c6194$expor
 $parcel$export(module.exports, "loadSourceMap", () => $3d4b4a41954c6194$export$c500fecaca54de65);
 $parcel$export(module.exports, "remapSourceLocation", () => $3d4b4a41954c6194$export$2fed780245c466c1);
 $parcel$export(module.exports, "stripAnsi", () => (/*@__PURE__*/$parcel$interopDefault($c6e7686f671d96bd$exports)));
+$parcel$export(module.exports, "detectSVGOVersion", () => $898ec9690c913f83$export$d9e46360b4510851);
 function $2dffa662028edb3d$export$2e2bcd8739ae039(string, startIndex = 0) {
     let lines = 1;
     for(let i = startIndex; i < string.length; i++)if (string.charAt(i) === '\n') lines++;
@@ -15274,6 +15270,9 @@ var $e581af606dac1487$var$digestInfoValidator = {
                     name: 'DigestInfo.DigestAlgorithm.parameters',
                     tagClass: $e581af606dac1487$var$asn1.Class.UNIVERSAL,
                     type: $e581af606dac1487$var$asn1.Type.NULL,
+                    // captured only to check existence for md2 and md5
+                    capture: 'parameters',
+                    optional: true,
                     constructed: false
                 }
             ]
@@ -16027,6 +16026,10 @@ var $e581af606dac1487$var$digestInfoValidator = {
                     error.oid = oid;
                     throw error;
                 }
+                // special check for md2 and md5 that NULL parameters exist
+                if (oid === $ctKnW.oids.md2 || oid === $ctKnW.oids.md5) {
+                    if (!('parameters' in capture)) throw new Error("ASN.1 object does not contain a valid RSASSA-PKCS1-v1_5 DigestInfo value. Missing algorithm identifer NULL parameters.");
+                }
                 // compare the given digest to the decrypted one
                 return digest === capture.digest;
             }
@@ -29836,12 +29839,28 @@ var $5de4bfe78cb104cd$exports = {};
 Object.defineProperty($5de4bfe78cb104cd$exports, "__esModule", {
     value: true
 });
-$5de4bfe78cb104cd$exports.removeLeadingDotSegment = $5de4bfe78cb104cd$exports.escape = $5de4bfe78cb104cd$exports.makeAbsolute = $5de4bfe78cb104cd$exports.unixify = void 0;
+$5de4bfe78cb104cd$exports.convertPosixPathToPattern = $5de4bfe78cb104cd$exports.convertWindowsPathToPattern = $5de4bfe78cb104cd$exports.convertPathToPattern = $5de4bfe78cb104cd$exports.escapePosixPath = $5de4bfe78cb104cd$exports.escapeWindowsPath = $5de4bfe78cb104cd$exports.escape = $5de4bfe78cb104cd$exports.removeLeadingDotSegment = $5de4bfe78cb104cd$exports.makeAbsolute = $5de4bfe78cb104cd$exports.unixify = void 0;
+
 
+const $5de4bfe78cb104cd$var$IS_WINDOWS_PLATFORM = $houHs$os.platform() === 'win32';
 const $5de4bfe78cb104cd$var$LEADING_DOT_SEGMENT_CHARACTERS_COUNT = 2; // ./ or .\\
-const $5de4bfe78cb104cd$var$UNESCAPED_GLOB_SYMBOLS_RE = /(\\?)([()*?[\]{|}]|^!|[!+@](?=\())/g;
-/**
- * Designed to work only with simple paths: `dir\\file`.
+/**
+ * All non-escaped special characters.
+ * Posix: ()*?[]{|}, !+@ before (, ! at the beginning, \\ before non-special characters.
+ * Windows: (){}[], !+@ before (, ! at the beginning.
+ */ const $5de4bfe78cb104cd$var$POSIX_UNESCAPED_GLOB_SYMBOLS_RE = /(\\?)([()*?[\]{|}]|^!|[!+@](?=\()|\\(?![!()*+?@[\]{|}]))/g;
+const $5de4bfe78cb104cd$var$WINDOWS_UNESCAPED_GLOB_SYMBOLS_RE = /(\\?)([()[\]{}]|^!|[!+@](?=\())/g;
+/**
+ * The device path (\\.\ or \\?\).
+ * https://learn.microsoft.com/en-us/dotnet/standard/io/file-path-formats#dos-device-paths
+ */ const $5de4bfe78cb104cd$var$DOS_DEVICE_PATH_RE = /^\\\\([.?])/;
+/**
+ * All backslashes except those escaping special characters.
+ * Windows: !()+@{}
+ * https://learn.microsoft.com/en-us/windows/win32/fileio/naming-a-file#naming-conventions
+ */ const $5de4bfe78cb104cd$var$WINDOWS_BACKSLASHES_RE = /\\(?![!()+@[\]{}])/g;
+/**
+ * Designed to work only with simple paths: `dir\\file`.
  */ function $5de4bfe78cb104cd$var$unixify(filepath) {
     return filepath.replace(/\\/g, '/');
 }
@@ -29850,10 +29869,6 @@ function $5de4bfe78cb104cd$var$makeAbsolute(cwd, filepath) {
     return $houHs$path.resolve(cwd, filepath);
 }
 $5de4bfe78cb104cd$exports.makeAbsolute = $5de4bfe78cb104cd$var$makeAbsolute;
-function $5de4bfe78cb104cd$var$escape(pattern) {
-    return pattern.replace($5de4bfe78cb104cd$var$UNESCAPED_GLOB_SYMBOLS_RE, '\\$2');
-}
-$5de4bfe78cb104cd$exports.escape = $5de4bfe78cb104cd$var$escape;
 function $5de4bfe78cb104cd$var$removeLeadingDotSegment(entry) {
     // We do not use `startsWith` because this is 10x slower than current implementation for some cases.
     // eslint-disable-next-line @typescript-eslint/prefer-string-starts-ends-with
@@ -29864,6 +29879,24 @@ function $5de4bfe78cb104cd$var$removeLeadingDotSegment(entry) {
     return entry;
 }
 $5de4bfe78cb104cd$exports.removeLeadingDotSegment = $5de4bfe78cb104cd$var$removeLeadingDotSegment;
+$5de4bfe78cb104cd$exports.escape = $5de4bfe78cb104cd$var$IS_WINDOWS_PLATFORM ? $5de4bfe78cb104cd$var$escapeWindowsPath : $5de4bfe78cb104cd$var$escapePosixPath;
+function $5de4bfe78cb104cd$var$escapeWindowsPath(pattern) {
+    return pattern.replace($5de4bfe78cb104cd$var$WINDOWS_UNESCAPED_GLOB_SYMBOLS_RE, '\\$2');
+}
+$5de4bfe78cb104cd$exports.escapeWindowsPath = $5de4bfe78cb104cd$var$escapeWindowsPath;
+function $5de4bfe78cb104cd$var$escapePosixPath(pattern) {
+    return pattern.replace($5de4bfe78cb104cd$var$POSIX_UNESCAPED_GLOB_SYMBOLS_RE, '\\$2');
+}
+$5de4bfe78cb104cd$exports.escapePosixPath = $5de4bfe78cb104cd$var$escapePosixPath;
+$5de4bfe78cb104cd$exports.convertPathToPattern = $5de4bfe78cb104cd$var$IS_WINDOWS_PLATFORM ? $5de4bfe78cb104cd$var$convertWindowsPathToPattern : $5de4bfe78cb104cd$var$convertPosixPathToPattern;
+function $5de4bfe78cb104cd$var$convertWindowsPathToPattern(filepath) {
+    return $5de4bfe78cb104cd$var$escapeWindowsPath(filepath).replace($5de4bfe78cb104cd$var$DOS_DEVICE_PATH_RE, '//$1').replace($5de4bfe78cb104cd$var$WINDOWS_BACKSLASHES_RE, '/');
+}
+$5de4bfe78cb104cd$exports.convertWindowsPathToPattern = $5de4bfe78cb104cd$var$convertWindowsPathToPattern;
+function $5de4bfe78cb104cd$var$convertPosixPathToPattern(filepath) {
+    return $5de4bfe78cb104cd$var$escapePosixPath(filepath);
+}
+$5de4bfe78cb104cd$exports.convertPosixPathToPattern = $5de4bfe78cb104cd$var$convertPosixPathToPattern;
 
 
 $51df6bfca103aef8$exports.path = $5de4bfe78cb104cd$exports;
@@ -29872,7 +29905,7 @@ var $a1480222e26dd21e$exports = {};
 Object.defineProperty($a1480222e26dd21e$exports, "__esModule", {
     value: true
 });
-$a1480222e26dd21e$exports.matchAny = $a1480222e26dd21e$exports.convertPatternsToRe = $a1480222e26dd21e$exports.makeRe = $a1480222e26dd21e$exports.getPatternParts = $a1480222e26dd21e$exports.expandBraceExpansion = $a1480222e26dd21e$exports.expandPatternsWithBraceExpansion = $a1480222e26dd21e$exports.isAffectDepthOfReadingPattern = $a1480222e26dd21e$exports.endsWithSlashGlobStar = $a1480222e26dd21e$exports.hasGlobStar = $a1480222e26dd21e$exports.getBaseDirectory = $a1480222e26dd21e$exports.isPatternRelatedToParentDirectory = $a1480222e26dd21e$exports.getPatternsOutsideCurrentDirectory = $a1480222e26dd21e$exports.getPatternsInsideCurrentDirectory = $a1480222e26dd21e$exports.getPositivePatterns = $a1480222e26dd21e$exports.getNegativePatterns = $a1480222e26dd21e$exports.isPositivePattern = $a1480222e26dd21e$exports.isNegativePattern = $a1480222e26dd21e$exports.convertToNegativePattern = $a1480222e26dd21e$exports.convertToPositivePattern = $a1480222e26dd21e$exports.isDynamicPattern = $a1480222e26dd21e$exports.isStaticPattern = void 0;
+$a1480222e26dd21e$exports.removeDuplicateSlashes = $a1480222e26dd21e$exports.matchAny = $a1480222e26dd21e$exports.convertPatternsToRe = $a1480222e26dd21e$exports.makeRe = $a1480222e26dd21e$exports.getPatternParts = $a1480222e26dd21e$exports.expandBraceExpansion = $a1480222e26dd21e$exports.expandPatternsWithBraceExpansion = $a1480222e26dd21e$exports.isAffectDepthOfReadingPattern = $a1480222e26dd21e$exports.endsWithSlashGlobStar = $a1480222e26dd21e$exports.hasGlobStar = $a1480222e26dd21e$exports.getBaseDirectory = $a1480222e26dd21e$exports.isPatternRelatedToParentDirectory = $a1480222e26dd21e$exports.getPatternsOutsideCurrentDirectory = $a1480222e26dd21e$exports.getPatternsInsideCurrentDirectory = $a1480222e26dd21e$exports.getPositivePatterns = $a1480222e26dd21e$exports.getNegativePatterns = $a1480222e26dd21e$exports.isPositivePattern = $a1480222e26dd21e$exports.isNegativePattern = $a1480222e26dd21e$exports.convertToNegativePattern = $a1480222e26dd21e$exports.convertToPositivePattern = $a1480222e26dd21e$exports.isDynamicPattern = $a1480222e26dd21e$exports.isStaticPattern = void 0;
 
 var $61d87f3276971c3e$exports = {};
 'use strict';
@@ -31032,7 +31065,11 @@ $f30ff4896fda5c70$exports = (parcelRequire("6TnoJ"));
 
 
 var $7UcG9 = parcelRequire("7UcG9");
-const $00cf20914f274048$var$isEmptyString = (val)=>val === '' || val === './';
+const $00cf20914f274048$var$isEmptyString = (v)=>v === '' || v === './';
+const $00cf20914f274048$var$hasBraces = (v)=>{
+    const index = v.indexOf('{');
+    return index > -1 && v.indexOf('}', index) > -1;
+};
 /**
  * Returns an array of strings that match one or more glob patterns.
  *
@@ -31389,7 +31426,7 @@ const $00cf20914f274048$var$isEmptyString = (val)=>val === '' || val === './';
  * @api public
  */ $00cf20914f274048$var$micromatch.braces = (pattern, options)=>{
     if (typeof pattern !== 'string') throw new TypeError('Expected a string');
-    if (options && options.nobrace === true || !/\{.*\}/.test(pattern)) return [
+    if (options && options.nobrace === true || !$00cf20914f274048$var$hasBraces(pattern)) return [
         pattern
     ];
     return $5a424cf505ecaf3c$exports(pattern, options);
@@ -31405,7 +31442,9 @@ const $00cf20914f274048$var$isEmptyString = (val)=>val === '' || val === './';
 };
 /**
  * Expose micromatch
- */ $00cf20914f274048$exports = $00cf20914f274048$var$micromatch;
+ */ // exposed for tests
+$00cf20914f274048$var$micromatch.hasBraces = $00cf20914f274048$var$hasBraces;
+$00cf20914f274048$exports = $00cf20914f274048$var$micromatch;
 
 
 const $a1480222e26dd21e$var$GLOBSTAR = '**';
@@ -31415,19 +31454,23 @@ const $a1480222e26dd21e$var$REGEX_CHARACTER_CLASS_SYMBOLS_RE = /\[[^[]*]/;
 const $a1480222e26dd21e$var$REGEX_GROUP_SYMBOLS_RE = /(?:^|[^!*+?@])\([^(]*\|[^|]*\)/;
 const $a1480222e26dd21e$var$GLOB_EXTENSION_SYMBOLS_RE = /[!*+?@]\([^(]*\)/;
 const $a1480222e26dd21e$var$BRACE_EXPANSION_SEPARATORS_RE = /,|\.\./;
+/**
+ * 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.
+ */ const $a1480222e26dd21e$var$DOUBLE_SLASH_RE = /(?!^)\/{2,}/g;
 function $a1480222e26dd21e$var$isStaticPattern(pattern, options = {}) {
     return !$a1480222e26dd21e$var$isDynamicPattern(pattern, options);
 }
 $a1480222e26dd21e$exports.isStaticPattern = $a1480222e26dd21e$var$isStaticPattern;
 function $a1480222e26dd21e$var$isDynamicPattern(pattern, options = {}) {
-    /**
-     * A special case with an empty string is necessary for matching patterns that start with a forward slash.
-     * An empty string cannot be a dynamic pattern.
-     * For example, the pattern `/lib/*` will be spread into parts: '', 'lib', '*'.
+    /**
+     * A special case with an empty string is necessary for matching patterns that start with a forward slash.
+     * An empty string cannot be a dynamic pattern.
+     * For example, the pattern `/lib/*` will be spread into parts: '', 'lib', '*'.
      */ if (pattern === '') return false;
-    /**
-     * When the `caseSensitiveMatch` option is disabled, all patterns must be marked as dynamic, because we cannot check
-     * filepath directly (without read directory).
+    /**
+     * When the `caseSensitiveMatch` option is disabled, all patterns must be marked as dynamic, because we cannot check
+     * filepath directly (without read directory).
      */ if (options.caseSensitiveMatch === false || pattern.includes($a1480222e26dd21e$var$ESCAPE_SYMBOL)) return true;
     if ($a1480222e26dd21e$var$COMMON_GLOB_SYMBOLS_RE.test(pattern) || $a1480222e26dd21e$var$REGEX_CHARACTER_CLASS_SYMBOLS_RE.test(pattern) || $a1480222e26dd21e$var$REGEX_GROUP_SYMBOLS_RE.test(pattern)) return true;
     if (options.extglob !== false && $a1480222e26dd21e$var$GLOB_EXTENSION_SYMBOLS_RE.test(pattern)) return true;
@@ -31467,22 +31510,22 @@ function $a1480222e26dd21e$var$getPositivePatterns(patterns) {
     return patterns.filter($a1480222e26dd21e$var$isPositivePattern);
 }
 $a1480222e26dd21e$exports.getPositivePatterns = $a1480222e26dd21e$var$getPositivePatterns;
-/**
- * Returns patterns that can be applied inside the current directory.
- *
- * @example
- * // ['./*', '*', 'a/*']
- * getPatternsInsideCurrentDirectory(['./*', '*', 'a/*', '../*', './../*'])
+/**
+ * Returns patterns that can be applied inside the current directory.
+ *
+ * @example
+ * // ['./*', '*', 'a/*']
+ * getPatternsInsideCurrentDirectory(['./*', '*', 'a/*', '../*', './../*'])
  */ function $a1480222e26dd21e$var$getPatternsInsideCurrentDirectory(patterns) {
     return patterns.filter((pattern)=>!$a1480222e26dd21e$var$isPatternRelatedToParentDirectory(pattern));
 }
 $a1480222e26dd21e$exports.getPatternsInsideCurrentDirectory = $a1480222e26dd21e$var$getPatternsInsideCurrentDirectory;
-/**
- * Returns patterns to be expanded relative to (outside) the current directory.
- *
- * @example
- * // ['../*', './../*']
- * getPatternsInsideCurrentDirectory(['./*', '*', 'a/*', '../*', './../*'])
+/**
+ * Returns patterns to be expanded relative to (outside) the current directory.
+ *
+ * @example
+ * // ['../*', './../*']
+ * getPatternsInsideCurrentDirectory(['./*', '*', 'a/*', '../*', './../*'])
  */ function $a1480222e26dd21e$var$getPatternsOutsideCurrentDirectory(patterns) {
     return patterns.filter($a1480222e26dd21e$var$isPatternRelatedToParentDirectory);
 }
@@ -31517,25 +31560,33 @@ function $a1480222e26dd21e$var$expandPatternsWithBraceExpansion(patterns) {
 }
 $a1480222e26dd21e$exports.expandPatternsWithBraceExpansion = $a1480222e26dd21e$var$expandPatternsWithBraceExpansion;
 function $a1480222e26dd21e$var$expandBraceExpansion(pattern) {
-    return $00cf20914f274048$exports.braces(pattern, {
+    const patterns = $00cf20914f274048$exports.braces(pattern, {
         expand: true,
-        nodupes: true
+        nodupes: true,
+        keepEscaping: true
     });
+    /**
+     * Sort the patterns by length so that the same depth patterns are processed side by side.
+     * `a/{b,}/{c,}/*` – `['a///*', 'a/b//*', 'a//c/*', 'a/b/c/*']`
+     */ patterns.sort((a, b)=>a.length - b.length);
+    /**
+     * Micromatch can return an empty string in the case of patterns like `{a,}`.
+     */ return patterns.filter((pattern)=>pattern !== '');
 }
 $a1480222e26dd21e$exports.expandBraceExpansion = $a1480222e26dd21e$var$expandBraceExpansion;
 function $a1480222e26dd21e$var$getPatternParts(pattern, options) {
     let { parts: parts } = $00cf20914f274048$exports.scan(pattern, Object.assign(Object.assign({}, options), {
         parts: true
     }));
-    /**
-     * The scan method returns an empty array in some cases.
-     * See micromatch/picomatch#58 for more details.
+    /**
+     * The scan method returns an empty array in some cases.
+     * See micromatch/picomatch#58 for more details.
      */ if (parts.length === 0) parts = [
         pattern
     ];
-    /**
-     * The scan method does not return an empty part for the pattern with a forward slash.
-     * This is another part of micromatch/picomatch#58.
+    /**
+     * The scan method does not return an empty part for the pattern with a forward slash.
+     * This is another part of micromatch/picomatch#58.
      */ if (parts[0].startsWith('/')) {
         parts[0] = parts[0].slice(1);
         parts.unshift('');
@@ -31555,6 +31606,13 @@ function $a1480222e26dd21e$var$matchAny(entry, patternsRe) {
     return patternsRe.some((patternRe)=>patternRe.test(entry));
 }
 $a1480222e26dd21e$exports.matchAny = $a1480222e26dd21e$var$matchAny;
+/**
+ * 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 $a1480222e26dd21e$var$removeDuplicateSlashes(pattern) {
+    return pattern.replace($a1480222e26dd21e$var$DOUBLE_SLASH_RE, '/');
+}
+$a1480222e26dd21e$exports.removeDuplicateSlashes = $a1480222e26dd21e$var$removeDuplicateSlashes;
 
 
 $51df6bfca103aef8$exports.pattern = $a1480222e26dd21e$exports;
@@ -31689,9 +31747,11 @@ $bd079c5b262030e8$exports.isEmpty = $bd079c5b262030e8$var$isEmpty;
 $51df6bfca103aef8$exports.string = $bd079c5b262030e8$exports;
 
 
-function $4e7c1394e7ae525e$var$generate(patterns, settings) {
+function $4e7c1394e7ae525e$var$generate(input, settings) {
+    const patterns = $4e7c1394e7ae525e$var$processPatterns(input, settings);
+    const ignore = $4e7c1394e7ae525e$var$processPatterns(settings.ignore, settings);
     const positivePatterns = $4e7c1394e7ae525e$var$getPositivePatterns(patterns);
-    const negativePatterns = $4e7c1394e7ae525e$var$getNegativePatternsAsPositive(patterns, settings.ignore);
+    const negativePatterns = $4e7c1394e7ae525e$var$getNegativePatternsAsPositive(patterns, ignore);
     const staticPatterns = positivePatterns.filter((pattern)=>$51df6bfca103aef8$exports.pattern.isStaticPattern(pattern, settings));
     const dynamicPatterns = positivePatterns.filter((pattern)=>$51df6bfca103aef8$exports.pattern.isDynamicPattern(pattern, settings));
     const staticTasks = $4e7c1394e7ae525e$var$convertPatternsToTasks(staticPatterns, negativePatterns, /* dynamic */ false);
@@ -31699,11 +31759,32 @@ function $4e7c1394e7ae525e$var$generate(patterns, settings) {
     return staticTasks.concat(dynamicTasks);
 }
 $4e7c1394e7ae525e$exports.generate = $4e7c1394e7ae525e$var$generate;
-/**
- * Returns tasks grouped by basic pattern directories.
- *
- * Patterns that can be found inside (`./`) and outside (`../`) the current directory are handled separately.
- * This is necessary because directory traversal starts at the base directory and goes deeper.
+function $4e7c1394e7ae525e$var$processPatterns(input, settings) {
+    let patterns = input;
+    /**
+     * The original pattern like `{,*,**,a/*}` can lead to problems checking the depth when matching entry
+     * and some problems with the micromatch package (see fast-glob issues: #365, #394).
+     *
+     * To solve this problem, we expand all patterns containing brace expansion. This can lead to a slight slowdown
+     * in matching in the case of a large set of patterns after expansion.
+     */ if (settings.braceExpansion) patterns = $51df6bfca103aef8$exports.pattern.expandPatternsWithBraceExpansion(patterns);
+    /**
+     * If the `baseNameMatch` option is enabled, we must add globstar to patterns, so that they can be used
+     * at any nesting level.
+     *
+     * We do this here, because otherwise we have to complicate the filtering logic. For example, we need to change
+     * the pattern in the filter before creating a regular expression. There is no need to change the patterns
+     * in the application. Only on the input.
+     */ if (settings.baseNameMatch) patterns = patterns.map((pattern)=>pattern.includes('/') ? pattern : `**/${pattern}`);
+    /**
+     * This method also removes duplicate slashes that may have been in the pattern or formed as a result of expansion.
+     */ return patterns.map((pattern)=>$51df6bfca103aef8$exports.pattern.removeDuplicateSlashes(pattern));
+}
+/**
+ * Returns tasks grouped by basic pattern directories.
+ *
+ * Patterns that can be found inside (`./`) and outside (`../`) the current directory are handled separately.
+ * This is necessary because directory traversal starts at the base directory and goes deeper.
  */ function $4e7c1394e7ae525e$var$convertPatternsToTasks(positive, negative, dynamic) {
     const tasks = [];
     const patternsOutsideCurrentDirectory = $51df6bfca103aef8$exports.pattern.getPatternsOutsideCurrentDirectory(positive);
@@ -31711,9 +31792,9 @@ $4e7c1394e7ae525e$exports.generate = $4e7c1394e7ae525e$var$generate;
     const outsideCurrentDirectoryGroup = $4e7c1394e7ae525e$var$groupPatternsByBaseDirectory(patternsOutsideCurrentDirectory);
     const insideCurrentDirectoryGroup = $4e7c1394e7ae525e$var$groupPatternsByBaseDirectory(patternsInsideCurrentDirectory);
     tasks.push(...$4e7c1394e7ae525e$var$convertPatternGroupsToTasks(outsideCurrentDirectoryGroup, negative, dynamic));
-    /*
-     * For the sake of reducing future accesses to the file system, we merge all tasks within the current directory
-     * into a global task, if at least one pattern refers to the root (`.`). In this case, the global task covers the rest.
+    /*
+     * For the sake of reducing future accesses to the file system, we merge all tasks within the current directory
+     * into a global task, if at least one pattern refers to the root (`.`). In this case, the global task covers the rest.
      */ if ('.' in insideCurrentDirectoryGroup) tasks.push($4e7c1394e7ae525e$var$convertPatternGroupToTask('.', patternsInsideCurrentDirectory, negative, dynamic));
     else tasks.push(...$4e7c1394e7ae525e$var$convertPatternGroupsToTasks(insideCurrentDirectoryGroup, negative, dynamic));
     return tasks;
@@ -31759,30 +31840,6 @@ function $4e7c1394e7ae525e$var$convertPatternGroupToTask(base, positive, negativ
 $4e7c1394e7ae525e$exports.convertPatternGroupToTask = $4e7c1394e7ae525e$var$convertPatternGroupToTask;
 
 
-var $a992000eaa98f3bf$exports = {};
-"use strict";
-Object.defineProperty($a992000eaa98f3bf$exports, "__esModule", {
-    value: true
-});
-$a992000eaa98f3bf$exports.removeDuplicateSlashes = $a992000eaa98f3bf$exports.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 $a992000eaa98f3bf$var$DOUBLE_SLASH_RE = /(?!^)\/{2,}/g;
-function $a992000eaa98f3bf$var$transform(patterns) {
-    return patterns.map((pattern)=>$a992000eaa98f3bf$var$removeDuplicateSlashes(pattern));
-}
-$a992000eaa98f3bf$exports.transform = $a992000eaa98f3bf$var$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 $a992000eaa98f3bf$var$removeDuplicateSlashes(pattern) {
-    return pattern.replace($a992000eaa98f3bf$var$DOUBLE_SLASH_RE, '/');
-}
-$a992000eaa98f3bf$exports.removeDuplicateSlashes = $a992000eaa98f3bf$var$removeDuplicateSlashes;
-
-
 var $d5f482eed45d3ecd$exports = {};
 "use strict";
 Object.defineProperty($d5f482eed45d3ecd$exports, "__esModule", {
@@ -31949,10 +32006,17 @@ function $4c8e6850a1bebfbe$var$getSettings(settingsOrOptions = {}) {
 
 
 var $0d6c86794ef4c7c7$exports = {};
-$0d6c86794ef4c7c7$exports = $0d6c86794ef4c7c7$var$runParallel;
+/*! run-parallel. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */ $0d6c86794ef4c7c7$exports = $0d6c86794ef4c7c7$var$runParallel;
+var $61ec8239bfa07984$exports = {};
+/*! queue-microtask. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */ let $61ec8239bfa07984$var$promise;
+$61ec8239bfa07984$exports = typeof queueMicrotask === 'function' ? queueMicrotask.bind(typeof window !== 'undefined' ? window : $parcel$global) : (cb)=>($61ec8239bfa07984$var$promise || ($61ec8239bfa07984$var$promise = Promise.resolve())).then(cb).catch((err)=>setTimeout(()=>{
+            throw err;
+        }, 0));
+
+
 function $0d6c86794ef4c7c7$var$runParallel(tasks, cb) {
-    var results, pending, keys;
-    var isSync = true;
+    let results, pending, keys;
+    let isSync = true;
     if (Array.isArray(tasks)) {
         results = [];
         pending = tasks.length;
@@ -31966,7 +32030,7 @@ function $0d6c86794ef4c7c7$var$runParallel(tasks, cb) {
             if (cb) cb(err, results);
             cb = null;
         }
-        if (isSync) process.nextTick(end);
+        if (isSync) $61ec8239bfa07984$exports(end);
         else end();
     }
     function each(i, err, result) {
@@ -32296,31 +32360,46 @@ function $a7ad4ca5714a1988$var$reusify(Constructor) {
 $a7ad4ca5714a1988$exports = $a7ad4ca5714a1988$var$reusify;
 
 
-function $8f292469f9b1e0ce$var$fastqueue(context, worker, concurrency) {
+function $8f292469f9b1e0ce$var$fastqueue(context, worker, _concurrency) {
     if (typeof context === 'function') {
-        concurrency = worker;
+        _concurrency = worker;
         worker = context;
         context = null;
     }
+    if (!(_concurrency >= 1)) throw new Error('fastqueue concurrency must be equal to or greater than 1');
     var cache = $a7ad4ca5714a1988$exports($8f292469f9b1e0ce$var$Task);
     var queueHead = null;
     var queueTail = null;
     var _running = 0;
+    var errorHandler = null;
     var self = {
         push: push,
         drain: $8f292469f9b1e0ce$var$noop,
         saturated: $8f292469f9b1e0ce$var$noop,
         pause: pause,
         paused: false,
-        concurrency: concurrency,
+        get concurrency () {
+            return _concurrency;
+        },
+        set concurrency (value){
+            if (!(value >= 1)) throw new Error('fastqueue concurrency must be equal to or greater than 1');
+            _concurrency = value;
+            if (self.paused) return;
+            for(; queueHead && _running < _concurrency;){
+                _running++;
+                release();
+            }
+        },
         running: running,
         resume: resume,
         idle: idle,
         length: length,
+        getQueue: getQueue,
         unshift: unshift,
         empty: $8f292469f9b1e0ce$var$noop,
         kill: kill,
-        killAndDrain: killAndDrain
+        killAndDrain: killAndDrain,
+        error: error
     };
     return self;
     function running() {
@@ -32338,10 +32417,24 @@ function $8f292469f9b1e0ce$var$fastqueue(context, worker, concurrency) {
         }
         return counter;
     }
+    function getQueue() {
+        var current = queueHead;
+        var tasks = [];
+        while(current){
+            tasks.push(current.value);
+            current = current.next;
+        }
+        return tasks;
+    }
     function resume() {
         if (!self.paused) return;
         self.paused = false;
-        for(var i = 0; i < self.concurrency; i++){
+        if (queueHead === null) {
+            _running++;
+            release();
+            return;
+        }
+        for(; queueHead && _running < _concurrency;){
             _running++;
             release();
         }
@@ -32349,13 +32442,14 @@ function $8f292469f9b1e0ce$var$fastqueue(context, worker, concurrency) {
     function idle() {
         return _running === 0 && self.length() === 0;
     }
-    function push(value, done) {
+    function push(value1, done) {
         var current = cache.get();
         current.context = context;
         current.release = release;
-        current.value = value;
+        current.value = value1;
         current.callback = done || $8f292469f9b1e0ce$var$noop;
-        if (_running === self.concurrency || self.paused) {
+        current.errorHandler = errorHandler;
+        if (_running >= _concurrency || self.paused) {
             if (queueTail) {
                 queueTail.next = current;
                 queueTail = current;
@@ -32369,13 +32463,14 @@ function $8f292469f9b1e0ce$var$fastqueue(context, worker, concurrency) {
             worker.call(context, current.value, current.worked);
         }
     }
-    function unshift(value, done) {
+    function unshift(value1, done) {
         var current = cache.get();
         current.context = context;
         current.release = release;
-        current.value = value;
+        current.value = value1;
         current.callback = done || $8f292469f9b1e0ce$var$noop;
-        if (_running === self.concurrency || self.paused) {
+        current.errorHandler = errorHandler;
+        if (_running >= _concurrency || self.paused) {
             if (queueHead) {
                 current.next = queueHead;
                 queueHead = current;
@@ -32392,7 +32487,7 @@ function $8f292469f9b1e0ce$var$fastqueue(context, worker, concurrency) {
     function release(holder) {
         if (holder) cache.release(holder);
         var next = queueHead;
-        if (next) {
+        if (next && _running <= _concurrency) {
             if (!self.paused) {
                 if (queueTail === queueHead) queueTail = null;
                 queueHead = next.next;
@@ -32413,6 +32508,9 @@ function $8f292469f9b1e0ce$var$fastqueue(context, worker, concurrency) {
         self.drain();
         self.drain = $8f292469f9b1e0ce$var$noop;
     }
+    function error(handler) {
+        errorHandler = handler;
+    }
 }
 function $8f292469f9b1e0ce$var$noop() {}
 function $8f292469f9b1e0ce$var$Task() {
@@ -32421,16 +32519,85 @@ function $8f292469f9b1e0ce$var$Task() {
     this.next = null;
     this.release = $8f292469f9b1e0ce$var$noop;
     this.context = null;
+    this.errorHandler = null;
     var self = this;
     this.worked = function worked(err, result) {
         var callback = self.callback;
+        var errorHandler = self.errorHandler;
+        var val = self.value;
         self.value = null;
         self.callback = $8f292469f9b1e0ce$var$noop;
+        if (self.errorHandler) errorHandler(err, val);
         callback.call(self.context, err, result);
         self.release(self);
     };
 }
+function $8f292469f9b1e0ce$var$queueAsPromised(context, worker, _concurrency) {
+    if (typeof context === 'function') {
+        _concurrency = worker;
+        worker = context;
+        context = null;
+    }
+    function asyncWrapper(arg, cb) {
+        worker.call(this, arg).then(function(res) {
+            cb(null, res);
+        }, cb);
+    }
+    var queue = $8f292469f9b1e0ce$var$fastqueue(context, asyncWrapper, _concurrency);
+    var pushCb = queue.push;
+    var unshiftCb = queue.unshift;
+    queue.push = push;
+    queue.unshift = unshift;
+    queue.drained = drained;
+    return queue;
+    function push(value1) {
+        var p = new Promise(function(resolve, reject) {
+            pushCb(value1, function(err, result) {
+                if (err) {
+                    reject(err);
+                    return;
+                }
+                resolve(result);
+            });
+        });
+        // Let's fork the promise chain to
+        // make the error bubble up to the user but
+        // not lead to a unhandledRejection
+        p.catch($8f292469f9b1e0ce$var$noop);
+        return p;
+    }
+    function unshift(value1) {
+        var p = new Promise(function(resolve, reject) {
+            unshiftCb(value1, function(err, result) {
+                if (err) {
+                    reject(err);
+                    return;
+                }
+                resolve(result);
+            });
+        });
+        // Let's fork the promise chain to
+        // make the error bubble up to the user but
+        // not lead to a unhandledRejection
+        p.catch($8f292469f9b1e0ce$var$noop);
+        return p;
+    }
+    function drained() {
+        if (queue.idle()) return new Promise(function(resolve) {
+            resolve();
+        });
+        var previousDrain = queue.drain;
+        var p = new Promise(function(resolve) {
+            queue.drain = function() {
+                previousDrain();
+                resolve();
+            };
+        });
+        return p;
+    }
+}
 $8f292469f9b1e0ce$exports = $8f292469f9b1e0ce$var$fastqueue;
+$8f292469f9b1e0ce$exports.promise = $8f292469f9b1e0ce$var$queueAsPromised;
 
 
 var $76fb3934979f92a5$exports = {};
@@ -32897,11 +33064,7 @@ class $7d9735c4e337a8a3$var$Matcher {
         this._fillStorage();
     }
     _fillStorage() {
-        /**
-         * The original pattern may include `{,*,**,a/*}`, which will lead to problems with matching (unresolved level).
-         * So, before expand patterns with brace expansion into separated patterns.
-         */ const patterns = $51df6bfca103aef8$exports.pattern.expandPatternsWithBraceExpansion(this._patterns);
-        for (const pattern of patterns){
+        for (const pattern of this._patterns){
             const segments = this._getPatternSegments(pattern);
             const sections = this._splitSegmentsIntoSections(segments);
             this._storage.push({
@@ -32941,12 +33104,12 @@ class $504a6f29c6af5a30$var$PartialMatcher extends $7d9735c4e337a8a3$exports.def
         const patterns = this._storage.filter((info)=>!info.complete || info.segments.length > levels);
         for (const pattern of patterns){
             const section = pattern.sections[0];
-            /**
-             * In this case, the pattern has a globstar and we must read all directories unconditionally,
-             * but only if the level has reached the end of the first group.
-             *
-             * fixtures/{a,b}/**
-             *  ^ true/false  ^ always true
+            /**
+             * In this case, the pattern has a globstar and we must read all directories unconditionally,
+             * but only if the level has reached the end of the first group.
+             *
+             * fixtures/{a,b}/**
+             *  ^ true/false  ^ always true
             */ if (!pattern.complete && levels > section.length) return true;
             const match = parts.every((part, index)=>{
                 const segment = pattern.segments[index];
@@ -32987,8 +33150,8 @@ class $43d93e4c4fb70606$var$DeepFilter {
         return this._isSkippedByNegativePatterns(filepath, negativeRe);
     }
     _isSkippedByDeep(basePath, entryPath) {
-        /**
-         * Avoid unnecessary depth calculations when it doesn't matter.
+        /**
+         * Avoid unnecessary depth calculations when it doesn't matter.
          */ if (this._settings.deep === Infinity) return false;
         return this._getEntryLevel(basePath, entryPath) >= this._settings.deep;
     }
@@ -33025,24 +33188,26 @@ class $b326f718dda03c34$var$EntryFilter {
     }
     getFilter(positive, negative) {
         const positiveRe = $51df6bfca103aef8$exports.pattern.convertPatternsToRe(positive, this._micromatchOptions);
-        const negativeRe = $51df6bfca103aef8$exports.pattern.convertPatternsToRe(negative, this._micromatchOptions);
+        const negativeRe = $51df6bfca103aef8$exports.pattern.convertPatternsToRe(negative, Object.assign(Object.assign({}, this._micromatchOptions), {
+            dot: true
+        }));
         return (entry)=>this._filter(entry, positiveRe, negativeRe);
     }
     _filter(entry, positiveRe, negativeRe) {
-        if (this._settings.unique && this._isDuplicateEntry(entry)) return false;
+        const filepath = $51df6bfca103aef8$exports.path.removeLeadingDotSegment(entry.path);
+        if (this._settings.unique && this._isDuplicateEntry(filepath)) return false;
         if (this._onlyFileFilter(entry) || this._onlyDirectoryFilter(entry)) return false;
-        if (this._isSkippedByAbsoluteNegativePatterns(entry.path, negativeRe)) return false;
-        const filepath = this._settings.baseNameMatch ? entry.name : entry.path;
+        if (this._isSkippedByAbsoluteNegativePatterns(filepath, negativeRe)) return false;
         const isDirectory = entry.dirent.isDirectory();
-        const isMatched = this._isMatchToPatterns(filepath, positiveRe, isDirectory) && !this._isMatchToPatterns(entry.path, negativeRe, isDirectory);
-        if (this._settings.unique && isMatched) this._createIndexRecord(entry);
+        const isMatched = this._isMatchToPatterns(filepath, positiveRe, isDirectory) && !this._isMatchToPatterns(filepath, negativeRe, isDirectory);
+        if (this._settings.unique && isMatched) this._createIndexRecord(filepath);
         return isMatched;
     }
-    _isDuplicateEntry(entry) {
-        return this.index.has(entry.path);
+    _isDuplicateEntry(filepath) {
+        return this.index.has(filepath);
     }
-    _createIndexRecord(entry) {
-        this.index.set(entry.path, undefined);
+    _createIndexRecord(filepath) {
+        this.index.set(filepath, undefined);
     }
     _onlyFileFilter(entry) {
         return this._settings.onlyFiles && !entry.dirent.isFile();
@@ -33055,8 +33220,7 @@ class $b326f718dda03c34$var$EntryFilter {
         const fullpath = $51df6bfca103aef8$exports.path.makeAbsolute(this._settings.cwd, entryPath);
         return $51df6bfca103aef8$exports.pattern.matchAny(fullpath, patternsRe);
     }
-    _isMatchToPatterns(entryPath, patternsRe, isDirectory) {
-        const filepath = $51df6bfca103aef8$exports.path.removeLeadingDotSegment(entryPath);
+    _isMatchToPatterns(filepath, patternsRe, isDirectory) {
         // Trying to match files and directories by patterns.
         const isMatched = $51df6bfca103aef8$exports.pattern.matchAny(filepath, patternsRe);
         // A pattern with a trailling slash can be used for directory matching.
@@ -33288,9 +33452,9 @@ Object.defineProperty($bf5054003fcf818c$exports, "__esModule", {
 $bf5054003fcf818c$exports.DEFAULT_FILE_SYSTEM_ADAPTER = void 0;
 
 
-/**
- * The `os.cpus` method can return zero. We expect the number of cores to be greater than zero.
- * https://github.com/nodejs/node/blob/7faeddf23a98c53896f8b574a6e66589e8fb1eb8/lib/os.js#L106-L107
+/**
+ * The `os.cpus` method can return zero. We expect the number of cores to be greater than zero.
+ * https://github.com/nodejs/node/blob/7faeddf23a98c53896f8b574a6e66589e8fb1eb8/lib/os.js#L106-L107
  */ const $bf5054003fcf818c$var$CPU_COUNT = Math.max($houHs$os.cpus().length, 1);
 $bf5054003fcf818c$exports.DEFAULT_FILE_SYSTEM_ADAPTER = {
     lstat: $houHs$fs.lstat,
@@ -33326,6 +33490,8 @@ class $bf5054003fcf818c$var$Settings {
         this.unique = this._getValue(this._options.unique, true);
         if (this.onlyDirectories) this.onlyFiles = false;
         if (this.stats) this.objectMode = true;
+        // Remove the cast to the array in the next major (#404).
+        this.ignore = [].concat(this.ignore);
     }
     _getValue(option, value) {
         return option === undefined ? value : option;
@@ -33347,6 +33513,10 @@ async function $9166a0561447d9cc$var$FastGlob(source, options) {
 // https://github.com/typescript-eslint/typescript-eslint/issues/60
 // eslint-disable-next-line no-redeclare
 (function(FastGlob) {
+    FastGlob.glob = FastGlob;
+    FastGlob.globSync = sync;
+    FastGlob.globStream = stream;
+    FastGlob.async = FastGlob;
     function sync(source, options) {
         $9166a0561447d9cc$var$assertPatternsInput(source);
         const works = $9166a0561447d9cc$var$getWorks(source, $7d557658c028e930$exports.default, options);
@@ -33356,16 +33526,16 @@ async function $9166a0561447d9cc$var$FastGlob(source, options) {
     function stream(source, options) {
         $9166a0561447d9cc$var$assertPatternsInput(source);
         const works = $9166a0561447d9cc$var$getWorks(source, $f44fe1a517197b2c$exports.default, options);
-        /**
-         * The stream returned by the provider cannot work with an asynchronous iterator.
-         * To support asynchronous iterators, regardless of the number of tasks, we always multiplex streams.
-         * This affects performance (+25%). I don't see best solution right now.
+        /**
+         * The stream returned by the provider cannot work with an asynchronous iterator.
+         * To support asynchronous iterators, regardless of the number of tasks, we always multiplex streams.
+         * This affects performance (+25%). I don't see best solution right now.
          */ return $51df6bfca103aef8$exports.stream.merge(works);
     }
     FastGlob.stream = stream;
     function generateTasks(source, options) {
         $9166a0561447d9cc$var$assertPatternsInput(source);
-        const patterns = $a992000eaa98f3bf$exports.transform([].concat(source));
+        const patterns = [].concat(source);
         const settings = new $bf5054003fcf818c$exports.default(options);
         return $4e7c1394e7ae525e$exports.generate(patterns, settings);
     }
@@ -33381,9 +33551,40 @@ async function $9166a0561447d9cc$var$FastGlob(source, options) {
         return $51df6bfca103aef8$exports.path.escape(source);
     }
     FastGlob.escapePath = escapePath;
+    function convertPathToPattern(source) {
+        $9166a0561447d9cc$var$assertPatternsInput(source);
+        return $51df6bfca103aef8$exports.path.convertPathToPattern(source);
+    }
+    FastGlob.convertPathToPattern = convertPathToPattern;
+    let posix;
+    (function(posix) {
+        function escapePath(source) {
+            $9166a0561447d9cc$var$assertPatternsInput(source);
+            return $51df6bfca103aef8$exports.path.escapePosixPath(source);
+        }
+        posix.escapePath = escapePath;
+        function convertPathToPattern(source) {
+            $9166a0561447d9cc$var$assertPatternsInput(source);
+            return $51df6bfca103aef8$exports.path.convertPosixPathToPattern(source);
+        }
+        posix.convertPathToPattern = convertPathToPattern;
+    })(posix = FastGlob.posix || (FastGlob.posix = {}));
+    let win32;
+    (function(win32) {
+        function escapePath(source) {
+            $9166a0561447d9cc$var$assertPatternsInput(source);
+            return $51df6bfca103aef8$exports.path.escapeWindowsPath(source);
+        }
+        win32.escapePath = escapePath;
+        function convertPathToPattern(source) {
+            $9166a0561447d9cc$var$assertPatternsInput(source);
+            return $51df6bfca103aef8$exports.path.convertWindowsPathToPattern(source);
+        }
+        win32.convertPathToPattern = convertPathToPattern;
+    })(win32 = FastGlob.win32 || (FastGlob.win32 = {}));
 })($9166a0561447d9cc$var$FastGlob || ($9166a0561447d9cc$var$FastGlob = {}));
 function $9166a0561447d9cc$var$getWorks(source, _Provider, options) {
-    const patterns = $a992000eaa98f3bf$exports.transform([].concat(source));
+    const patterns = [].concat(source);
     const settings = new $bf5054003fcf818c$exports.default(options);
     const tasks = $4e7c1394e7ae525e$exports.generate(patterns, settings);
     const provider = new _Provider(settings);
@@ -33783,11 +33984,12 @@ function $7bda2fb2ffff63e7$var$supportsHyperlink(stream) {
     if ('FORCE_HYPERLINK' in env) return !(env.FORCE_HYPERLINK.length > 0 && parseInt(env.FORCE_HYPERLINK, 10) === 0);
     if ($211adde7638cc347$exports('no-hyperlink') || $211adde7638cc347$exports('no-hyperlinks') || $211adde7638cc347$exports('hyperlink=false') || $211adde7638cc347$exports('hyperlink=never')) return false;
     if ($211adde7638cc347$exports('hyperlink=true') || $211adde7638cc347$exports('hyperlink=always')) return true;
+    // Netlify does not run a TTY, it does not need `supportsColor` check
+    if ('NETLIFY' in env) return true;
     // If they specify no colors, they probably don't want hyperlinks.
     if (!$e79b7a51795d2321$exports.supportsColor(stream)) return false;
     if (stream && !stream.isTTY) return false;
     if (process.platform === 'win32') return false;
-    if ('NETLIFY' in env) return true;
     if ('CI' in env) return false;
     if ('TEAMCITY_VERSION' in env) return false;
     if ('TERM_PROGRAM' in env) {
@@ -33796,6 +33998,10 @@ function $7bda2fb2ffff63e7$var$supportsHyperlink(stream) {
             case 'iTerm.app':
                 if (version.major === 3) return version.minor >= 1;
                 return version.major > 3;
+            case 'WezTerm':
+                return version.major >= 20200620;
+            case 'vscode':
+                return version.major > 1 || version.major === 1 && version.minor >= 72;
         }
     }
     if ('VTE_VERSION' in env) {
@@ -35956,524 +36162,1205 @@ $9a7a296607515479$export$98e6a39c04603d36 = (parcelRequire("a5HPM"));
 $9a7a296607515479$export$fac44ee5b035f737 = (parcelRequire("ib1eJ"));
 
 
-var $15592b8231ef184c$exports = {};
-'use strict';
-var $1ba40dc599466f23$exports = {};
-'use strict';
-$1ba40dc599466f23$exports = $1ba40dc599466f23$var$Yallist;
-$1ba40dc599466f23$var$Yallist.Node = $1ba40dc599466f23$var$Node;
-$1ba40dc599466f23$var$Yallist.create = $1ba40dc599466f23$var$Yallist;
-function $1ba40dc599466f23$var$Yallist(list) {
-    var self = this;
-    if (!(self instanceof $1ba40dc599466f23$var$Yallist)) self = new $1ba40dc599466f23$var$Yallist();
-    self.tail = null;
-    self.head = null;
-    self.length = 0;
-    if (list && typeof list.forEach === 'function') list.forEach(function(item) {
-        self.push(item);
-    });
-    else if (arguments.length > 0) for(var i = 0, l = arguments.length; i < l; i++)self.push(arguments[i]);
-    return self;
-}
-$1ba40dc599466f23$var$Yallist.prototype.removeNode = function(node) {
-    if (node.list !== this) throw new Error('removing node which does not belong to this list');
-    var next = node.next;
-    var prev = node.prev;
-    if (next) next.prev = prev;
-    if (prev) prev.next = next;
-    if (node === this.head) this.head = next;
-    if (node === this.tail) this.tail = prev;
-    node.list.length--;
-    node.next = null;
-    node.prev = null;
-    node.list = null;
-    return next;
-};
-$1ba40dc599466f23$var$Yallist.prototype.unshiftNode = function(node) {
-    if (node === this.head) return;
-    if (node.list) node.list.removeNode(node);
-    var head = this.head;
-    node.list = this;
-    node.next = head;
-    if (head) head.prev = node;
-    this.head = node;
-    if (!this.tail) this.tail = node;
-    this.length++;
-};
-$1ba40dc599466f23$var$Yallist.prototype.pushNode = function(node) {
-    if (node === this.tail) return;
-    if (node.list) node.list.removeNode(node);
-    var tail = this.tail;
-    node.list = this;
-    node.prev = tail;
-    if (tail) tail.next = node;
-    this.tail = node;
-    if (!this.head) this.head = node;
-    this.length++;
-};
-$1ba40dc599466f23$var$Yallist.prototype.push = function() {
-    for(var i = 0, l = arguments.length; i < l; i++)$1ba40dc599466f23$var$push(this, arguments[i]);
-    return this.length;
-};
-$1ba40dc599466f23$var$Yallist.prototype.unshift = function() {
-    for(var i = 0, l = arguments.length; i < l; i++)$1ba40dc599466f23$var$unshift(this, arguments[i]);
-    return this.length;
-};
-$1ba40dc599466f23$var$Yallist.prototype.pop = function() {
-    if (!this.tail) return undefined;
-    var res = this.tail.value;
-    this.tail = this.tail.prev;
-    if (this.tail) this.tail.next = null;
-    else this.head = null;
-    this.length--;
-    return res;
-};
-$1ba40dc599466f23$var$Yallist.prototype.shift = function() {
-    if (!this.head) return undefined;
-    var res = this.head.value;
-    this.head = this.head.next;
-    if (this.head) this.head.prev = null;
-    else this.tail = null;
-    this.length--;
-    return res;
+/**
+ * @module LRUCache
+ */ const $34c2e4b61193a7f9$var$perf = typeof performance === 'object' && performance && typeof performance.now === 'function' ? performance : Date;
+const $34c2e4b61193a7f9$var$warned = new Set();
+/* c8 ignore start */ const $34c2e4b61193a7f9$var$PROCESS = typeof process === 'object' && !!process ? process : {};
+/* c8 ignore start */ const $34c2e4b61193a7f9$var$emitWarning = (msg, type, code, fn)=>{
+    typeof $34c2e4b61193a7f9$var$PROCESS.emitWarning === 'function' ? $34c2e4b61193a7f9$var$PROCESS.emitWarning(msg, type, code, fn) : console.error(`[${code}] ${type}: ${msg}`);
 };
-$1ba40dc599466f23$var$Yallist.prototype.forEach = function(fn, thisp) {
-    thisp = thisp || this;
-    for(var walker = this.head, i = 0; walker !== null; i++){
-        fn.call(thisp, walker.value, i, this);
-        walker = walker.next;
+let $34c2e4b61193a7f9$var$AC = globalThis.AbortController;
+let $34c2e4b61193a7f9$var$AS = globalThis.AbortSignal;
+/* c8 ignore start */ if (typeof $34c2e4b61193a7f9$var$AC === 'undefined') {
+    //@ts-ignore
+    $34c2e4b61193a7f9$var$AS = class AbortSignal {
+        onabort;
+        _onabort = [];
+        reason;
+        aborted = false;
+        addEventListener(_, fn) {
+            this._onabort.push(fn);
+        }
+    };
+    //@ts-ignore
+    $34c2e4b61193a7f9$var$AC = class AbortController {
+        constructor(){
+            warnACPolyfill();
+        }
+        signal = new $34c2e4b61193a7f9$var$AS();
+        abort(reason) {
+            if (this.signal.aborted) return;
+            //@ts-ignore
+            this.signal.reason = reason;
+            //@ts-ignore
+            this.signal.aborted = true;
+            //@ts-ignore
+            for (const fn of this.signal._onabort)fn(reason);
+            this.signal.onabort?.(reason);
+        }
+    };
+    let printACPolyfillWarning = $34c2e4b61193a7f9$var$PROCESS.env?.LRU_CACHE_IGNORE_AC_WARNING !== '1';
+    const warnACPolyfill = ()=>{
+        if (!printACPolyfillWarning) return;
+        printACPolyfillWarning = false;
+        $34c2e4b61193a7f9$var$emitWarning("AbortController is not defined. If using lru-cache in node 14, load an AbortController polyfill from the `node-abort-controller` package. A minimal polyfill is provided for use by LRUCache.fetch(), but it should not be relied upon in other contexts (eg, passing it to other APIs that use AbortController/AbortSignal might have undesirable effects). You may disable this with LRU_CACHE_IGNORE_AC_WARNING=1 in the env.", 'NO_ABORT_CONTROLLER', 'ENOTSUP', warnACPolyfill);
+    };
+}
+/* c8 ignore stop */ const $34c2e4b61193a7f9$var$shouldWarn = (code)=>!$34c2e4b61193a7f9$var$warned.has(code);
+const $34c2e4b61193a7f9$var$TYPE = Symbol('type');
+const $34c2e4b61193a7f9$var$isPosInt = (n)=>n && n === Math.floor(n) && n > 0 && isFinite(n);
+/* c8 ignore start */ // This is a little bit ridiculous, tbh.
+// The maximum array length is 2^32-1 or thereabouts on most JS impls.
+// And well before that point, you're caching the entire world, I mean,
+// that's ~32GB of just integers for the next/prev links, plus whatever
+// else to hold that many keys and values.  Just filling the memory with
+// zeroes at init time is brutal when you get that big.
+// But why not be complete?
+// Maybe in the future, these limits will have expanded.
+const $34c2e4b61193a7f9$var$getUintArray = (max)=>!$34c2e4b61193a7f9$var$isPosInt(max) ? null : max <= Math.pow(2, 8) ? Uint8Array : max <= Math.pow(2, 16) ? Uint16Array : max <= Math.pow(2, 32) ? Uint32Array : max <= Number.MAX_SAFE_INTEGER ? $34c2e4b61193a7f9$var$ZeroArray : null;
+/* c8 ignore stop */ class $34c2e4b61193a7f9$var$ZeroArray extends Array {
+    constructor(size){
+        super(size);
+        this.fill(0);
+    }
+}
+class $34c2e4b61193a7f9$var$Stack {
+    heap;
+    length;
+    // private constructor
+    static #constructing = false;
+    static create(max) {
+        const HeapCls = $34c2e4b61193a7f9$var$getUintArray(max);
+        if (!HeapCls) return [];
+        $34c2e4b61193a7f9$var$Stack.#constructing = true;
+        const s = new $34c2e4b61193a7f9$var$Stack(max, HeapCls);
+        $34c2e4b61193a7f9$var$Stack.#constructing = false;
+        return s;
+    }
+    constructor(max, HeapCls){
+        /* c8 ignore start */ if (!$34c2e4b61193a7f9$var$Stack.#constructing) throw new TypeError('instantiate Stack using Stack.create(n)');
+        /* c8 ignore stop */ this.heap = new HeapCls(max);
+        this.length = 0;
+    }
+    push(n) {
+        this.heap[this.length++] = n;
     }
-};
-$1ba40dc599466f23$var$Yallist.prototype.forEachReverse = function(fn, thisp) {
-    thisp = thisp || this;
-    for(var walker = this.tail, i = this.length - 1; walker !== null; i--){
-        fn.call(thisp, walker.value, i, this);
-        walker = walker.prev;
+    pop() {
+        return this.heap[--this.length];
     }
-};
-$1ba40dc599466f23$var$Yallist.prototype.get = function(n) {
-    for(var i = 0, walker = this.head; walker !== null && i < n; i++)// abort out of the list early if we hit a cycle
-    walker = walker.next;
-    if (i === n && walker !== null) return walker.value;
-};
-$1ba40dc599466f23$var$Yallist.prototype.getReverse = function(n) {
-    for(var i = 0, walker = this.tail; walker !== null && i < n; i++)// abort out of the list early if we hit a cycle
-    walker = walker.prev;
-    if (i === n && walker !== null) return walker.value;
-};
-$1ba40dc599466f23$var$Yallist.prototype.map = function(fn, thisp) {
-    thisp = thisp || this;
-    var res = new $1ba40dc599466f23$var$Yallist();
-    for(var walker = this.head; walker !== null;){
-        res.push(fn.call(thisp, walker.value, this));
-        walker = walker.next;
+}
+class $34c2e4b61193a7f9$export$182500e6725aad9a {
+    // options that cannot be changed without disaster
+    #max;
+    #maxSize;
+    #dispose;
+    #disposeAfter;
+    #fetchMethod;
+    #memoMethod;
+    /**
+     * {@link LRUCache.OptionsBase.ttl}
+     */ ttl;
+    /**
+     * {@link LRUCache.OptionsBase.ttlResolution}
+     */ ttlResolution;
+    /**
+     * {@link LRUCache.OptionsBase.ttlAutopurge}
+     */ ttlAutopurge;
+    /**
+     * {@link LRUCache.OptionsBase.updateAgeOnGet}
+     */ updateAgeOnGet;
+    /**
+     * {@link LRUCache.OptionsBase.updateAgeOnHas}
+     */ updateAgeOnHas;
+    /**
+     * {@link LRUCache.OptionsBase.allowStale}
+     */ allowStale;
+    /**
+     * {@link LRUCache.OptionsBase.noDisposeOnSet}
+     */ noDisposeOnSet;
+    /**
+     * {@link LRUCache.OptionsBase.noUpdateTTL}
+     */ noUpdateTTL;
+    /**
+     * {@link LRUCache.OptionsBase.maxEntrySize}
+     */ maxEntrySize;
+    /**
+     * {@link LRUCache.OptionsBase.sizeCalculation}
+     */ sizeCalculation;
+    /**
+     * {@link LRUCache.OptionsBase.noDeleteOnFetchRejection}
+     */ noDeleteOnFetchRejection;
+    /**
+     * {@link LRUCache.OptionsBase.noDeleteOnStaleGet}
+     */ noDeleteOnStaleGet;
+    /**
+     * {@link LRUCache.OptionsBase.allowStaleOnFetchAbort}
+     */ allowStaleOnFetchAbort;
+    /**
+     * {@link LRUCache.OptionsBase.allowStaleOnFetchRejection}
+     */ allowStaleOnFetchRejection;
+    /**
+     * {@link LRUCache.OptionsBase.ignoreFetchAbort}
+     */ ignoreFetchAbort;
+    // computed properties
+    #size;
+    #calculatedSize;
+    #keyMap;
+    #keyList;
+    #valList;
+    #next;
+    #prev;
+    #head;
+    #tail;
+    #free;
+    #disposed;
+    #sizes;
+    #starts;
+    #ttls;
+    #hasDispose;
+    #hasFetchMethod;
+    #hasDisposeAfter;
+    /**
+     * Do not call this method unless you need to inspect the
+     * inner workings of the cache.  If anything returned by this
+     * object is modified in any way, strange breakage may occur.
+     *
+     * These fields are private for a reason!
+     *
+     * @internal
+     */ static unsafeExposeInternals(c) {
+        return {
+            // properties
+            starts: c.#starts,
+            ttls: c.#ttls,
+            sizes: c.#sizes,
+            keyMap: c.#keyMap,
+            keyList: c.#keyList,
+            valList: c.#valList,
+            next: c.#next,
+            prev: c.#prev,
+            get head () {
+                return c.#head;
+            },
+            get tail () {
+                return c.#tail;
+            },
+            free: c.#free,
+            // methods
+            isBackgroundFetch: (p)=>c.#isBackgroundFetch(p),
+            backgroundFetch: (k, index, options, context)=>c.#backgroundFetch(k, index, options, context),
+            moveToTail: (index)=>c.#moveToTail(index),
+            indexes: (options)=>c.#indexes(options),
+            rindexes: (options)=>c.#rindexes(options),
+            isStale: (index)=>c.#isStale(index)
+        };
     }
-    return res;
-};
-$1ba40dc599466f23$var$Yallist.prototype.mapReverse = function(fn, thisp) {
-    thisp = thisp || this;
-    var res = new $1ba40dc599466f23$var$Yallist();
-    for(var walker = this.tail; walker !== null;){
-        res.push(fn.call(thisp, walker.value, this));
-        walker = walker.prev;
+    // Protected read-only members
+    /**
+     * {@link LRUCache.OptionsBase.max} (read-only)
+     */ get max() {
+        return this.#max;
     }
-    return res;
-};
-$1ba40dc599466f23$var$Yallist.prototype.reduce = function(fn, initial) {
-    var acc;
-    var walker = this.head;
-    if (arguments.length > 1) acc = initial;
-    else if (this.head) {
-        walker = this.head.next;
-        acc = this.head.value;
-    } else throw new TypeError('Reduce of empty list with no initial value');
-    for(var i = 0; walker !== null; i++){
-        acc = fn(acc, walker.value, i);
-        walker = walker.next;
-    }
-    return acc;
-};
-$1ba40dc599466f23$var$Yallist.prototype.reduceReverse = function(fn, initial) {
-    var acc;
-    var walker = this.tail;
-    if (arguments.length > 1) acc = initial;
-    else if (this.tail) {
-        walker = this.tail.prev;
-        acc = this.tail.value;
-    } else throw new TypeError('Reduce of empty list with no initial value');
-    for(var i = this.length - 1; walker !== null; i--){
-        acc = fn(acc, walker.value, i);
-        walker = walker.prev;
-    }
-    return acc;
-};
-$1ba40dc599466f23$var$Yallist.prototype.toArray = function() {
-    var arr = new Array(this.length);
-    for(var i = 0, walker = this.head; walker !== null; i++){
-        arr[i] = walker.value;
-        walker = walker.next;
+    /**
+     * {@link LRUCache.OptionsBase.maxSize} (read-only)
+     */ get maxSize() {
+        return this.#maxSize;
     }
-    return arr;
-};
-$1ba40dc599466f23$var$Yallist.prototype.toArrayReverse = function() {
-    var arr = new Array(this.length);
-    for(var i = 0, walker = this.tail; walker !== null; i++){
-        arr[i] = walker.value;
-        walker = walker.prev;
+    /**
+     * The total computed size of items in the cache (read-only)
+     */ get calculatedSize() {
+        return this.#calculatedSize;
     }
-    return arr;
-};
-$1ba40dc599466f23$var$Yallist.prototype.slice = function(from, to) {
-    to = to || this.length;
-    if (to < 0) to += this.length;
-    from = from || 0;
-    if (from < 0) from += this.length;
-    var ret = new $1ba40dc599466f23$var$Yallist();
-    if (to < from || to < 0) return ret;
-    if (from < 0) from = 0;
-    if (to > this.length) to = this.length;
-    for(var i = 0, walker = this.head; walker !== null && i < from; i++)walker = walker.next;
-    for(; walker !== null && i < to; i++, walker = walker.next)ret.push(walker.value);
-    return ret;
-};
-$1ba40dc599466f23$var$Yallist.prototype.sliceReverse = function(from, to) {
-    to = to || this.length;
-    if (to < 0) to += this.length;
-    from = from || 0;
-    if (from < 0) from += this.length;
-    var ret = new $1ba40dc599466f23$var$Yallist();
-    if (to < from || to < 0) return ret;
-    if (from < 0) from = 0;
-    if (to > this.length) to = this.length;
-    for(var i = this.length, walker = this.tail; walker !== null && i > to; i--)walker = walker.prev;
-    for(; walker !== null && i > from; i--, walker = walker.prev)ret.push(walker.value);
-    return ret;
-};
-$1ba40dc599466f23$var$Yallist.prototype.splice = function(start, deleteCount, ...nodes) {
-    if (start > this.length) start = this.length - 1;
-    if (start < 0) start = this.length + start;
-    for(var i = 0, walker = this.head; walker !== null && i < start; i++)walker = walker.next;
-    var ret = [];
-    for(var i = 0; walker && i < deleteCount; i++){
-        ret.push(walker.value);
-        walker = this.removeNode(walker);
+    /**
+     * The number of items stored in the cache (read-only)
+     */ get size() {
+        return this.#size;
     }
-    if (walker === null) walker = this.tail;
-    if (walker !== this.head && walker !== this.tail) walker = walker.prev;
-    for(var i = 0; i < nodes.length; i++)walker = $1ba40dc599466f23$var$insert(this, walker, nodes[i]);
-    return ret;
-};
-$1ba40dc599466f23$var$Yallist.prototype.reverse = function() {
-    var head = this.head;
-    var tail = this.tail;
-    for(var walker = head; walker !== null; walker = walker.prev){
-        var p = walker.prev;
-        walker.prev = walker.next;
-        walker.next = p;
+    /**
+     * {@link LRUCache.OptionsBase.fetchMethod} (read-only)
+     */ get fetchMethod() {
+        return this.#fetchMethod;
+    }
+    get memoMethod() {
+        return this.#memoMethod;
+    }
+    /**
+     * {@link LRUCache.OptionsBase.dispose} (read-only)
+     */ get dispose() {
+        return this.#dispose;
+    }
+    /**
+     * {@link LRUCache.OptionsBase.disposeAfter} (read-only)
+     */ get disposeAfter() {
+        return this.#disposeAfter;
     }
-    this.head = tail;
-    this.tail = head;
-    return this;
-};
-function $1ba40dc599466f23$var$insert(self, node, value) {
-    var inserted = node === self.head ? new $1ba40dc599466f23$var$Node(value, null, node, self) : new $1ba40dc599466f23$var$Node(value, node, node.next, self);
-    if (inserted.next === null) self.tail = inserted;
-    if (inserted.prev === null) self.head = inserted;
-    self.length++;
-    return inserted;
-}
-function $1ba40dc599466f23$var$push(self, item) {
-    self.tail = new $1ba40dc599466f23$var$Node(item, self.tail, null, self);
-    if (!self.head) self.head = self.tail;
-    self.length++;
-}
-function $1ba40dc599466f23$var$unshift(self, item) {
-    self.head = new $1ba40dc599466f23$var$Node(item, null, self.head, self);
-    if (!self.tail) self.tail = self.head;
-    self.length++;
-}
-function $1ba40dc599466f23$var$Node(value, prev, next, list) {
-    if (!(this instanceof $1ba40dc599466f23$var$Node)) return new $1ba40dc599466f23$var$Node(value, prev, next, list);
-    this.list = list;
-    this.value = value;
-    if (prev) {
-        prev.next = this;
-        this.prev = prev;
-    } else this.prev = null;
-    if (next) {
-        next.prev = this;
-        this.next = next;
-    } else this.next = null;
-}
-
-try {
-    // add if support for Symbol.iterator is present
-    (parcelRequire("ff5ZV"))($1ba40dc599466f23$var$Yallist);
-} catch (er) {}
-
-
-const $15592b8231ef184c$var$MAX = Symbol('max');
-const $15592b8231ef184c$var$LENGTH = Symbol('length');
-const $15592b8231ef184c$var$LENGTH_CALCULATOR = Symbol('lengthCalculator');
-const $15592b8231ef184c$var$ALLOW_STALE = Symbol('allowStale');
-const $15592b8231ef184c$var$MAX_AGE = Symbol('maxAge');
-const $15592b8231ef184c$var$DISPOSE = Symbol('dispose');
-const $15592b8231ef184c$var$NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet');
-const $15592b8231ef184c$var$LRU_LIST = Symbol('lruList');
-const $15592b8231ef184c$var$CACHE = Symbol('cache');
-const $15592b8231ef184c$var$UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet');
-const $15592b8231ef184c$var$naiveLength = ()=>1;
-// lruList is a yallist where the head is the youngest
-// item, and the tail is the oldest.  the list contains the Hit
-// objects as the entries.
-// Each Hit object has a reference to its Yallist.Node.  This
-// never changes.
-//
-// cache is a Map (or PseudoMap) that matches the keys to
-// the Yallist.Node object.
-class $15592b8231ef184c$var$LRUCache {
     constructor(options){
-        if (typeof options === 'number') options = {
-            max: options
-        };
-        if (!options) options = {};
-        if (options.max && (typeof options.max !== 'number' || options.max < 0)) throw new TypeError('max must be a non-negative number');
-        // Kind of weird to have a default max of Infinity, but oh well.
-        const max = this[$15592b8231ef184c$var$MAX] = options.max || Infinity;
-        const lc = options.length || $15592b8231ef184c$var$naiveLength;
-        this[$15592b8231ef184c$var$LENGTH_CALCULATOR] = typeof lc !== 'function' ? $15592b8231ef184c$var$naiveLength : lc;
-        this[$15592b8231ef184c$var$ALLOW_STALE] = options.stale || false;
-        if (options.maxAge && typeof options.maxAge !== 'number') throw new TypeError('maxAge must be a number');
-        this[$15592b8231ef184c$var$MAX_AGE] = options.maxAge || 0;
-        this[$15592b8231ef184c$var$DISPOSE] = options.dispose;
-        this[$15592b8231ef184c$var$NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false;
-        this[$15592b8231ef184c$var$UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false;
-        this.reset();
-    }
-    // resize the cache when the max changes.
-    set max(mL) {
-        if (typeof mL !== 'number' || mL < 0) throw new TypeError('max must be a non-negative number');
-        this[$15592b8231ef184c$var$MAX] = mL || Infinity;
-        $15592b8231ef184c$var$trim(this);
-    }
-    get max() {
-        return this[$15592b8231ef184c$var$MAX];
-    }
-    set allowStale(allowStale) {
-        this[$15592b8231ef184c$var$ALLOW_STALE] = !!allowStale;
-    }
-    get allowStale() {
-        return this[$15592b8231ef184c$var$ALLOW_STALE];
-    }
-    set maxAge(mA) {
-        if (typeof mA !== 'number') throw new TypeError('maxAge must be a non-negative number');
-        this[$15592b8231ef184c$var$MAX_AGE] = mA;
-        $15592b8231ef184c$var$trim(this);
-    }
-    get maxAge() {
-        return this[$15592b8231ef184c$var$MAX_AGE];
-    }
-    // resize the cache when the lengthCalculator changes.
-    set lengthCalculator(lC) {
-        if (typeof lC !== 'function') lC = $15592b8231ef184c$var$naiveLength;
-        if (lC !== this[$15592b8231ef184c$var$LENGTH_CALCULATOR]) {
-            this[$15592b8231ef184c$var$LENGTH_CALCULATOR] = lC;
-            this[$15592b8231ef184c$var$LENGTH] = 0;
-            this[$15592b8231ef184c$var$LRU_LIST].forEach((hit)=>{
-                hit.length = this[$15592b8231ef184c$var$LENGTH_CALCULATOR](hit.value, hit.key);
-                this[$15592b8231ef184c$var$LENGTH] += hit.length;
-            });
+        const { max: max = 0, ttl: ttl, ttlResolution: ttlResolution = 1, ttlAutopurge: ttlAutopurge, updateAgeOnGet: updateAgeOnGet, updateAgeOnHas: updateAgeOnHas, allowStale: allowStale, dispose: dispose, disposeAfter: disposeAfter, noDisposeOnSet: noDisposeOnSet, noUpdateTTL: noUpdateTTL, maxSize: maxSize = 0, maxEntrySize: maxEntrySize = 0, sizeCalculation: sizeCalculation, fetchMethod: fetchMethod, memoMethod: memoMethod, noDeleteOnFetchRejection: noDeleteOnFetchRejection, noDeleteOnStaleGet: noDeleteOnStaleGet, allowStaleOnFetchRejection: allowStaleOnFetchRejection, allowStaleOnFetchAbort: allowStaleOnFetchAbort, ignoreFetchAbort: ignoreFetchAbort } = options;
+        if (max !== 0 && !$34c2e4b61193a7f9$var$isPosInt(max)) throw new TypeError('max option must be a nonnegative integer');
+        const UintArray = max ? $34c2e4b61193a7f9$var$getUintArray(max) : Array;
+        if (!UintArray) throw new Error('invalid max value: ' + max);
+        this.#max = max;
+        this.#maxSize = maxSize;
+        this.maxEntrySize = maxEntrySize || this.#maxSize;
+        this.sizeCalculation = sizeCalculation;
+        if (this.sizeCalculation) {
+            if (!this.#maxSize && !this.maxEntrySize) throw new TypeError('cannot set sizeCalculation without setting maxSize or maxEntrySize');
+            if (typeof this.sizeCalculation !== 'function') throw new TypeError('sizeCalculation set to non-function');
+        }
+        if (memoMethod !== undefined && typeof memoMethod !== 'function') throw new TypeError('memoMethod must be a function if defined');
+        this.#memoMethod = memoMethod;
+        if (fetchMethod !== undefined && typeof fetchMethod !== 'function') throw new TypeError('fetchMethod must be a function if specified');
+        this.#fetchMethod = fetchMethod;
+        this.#hasFetchMethod = !!fetchMethod;
+        this.#keyMap = new Map();
+        this.#keyList = new Array(max).fill(undefined);
+        this.#valList = new Array(max).fill(undefined);
+        this.#next = new UintArray(max);
+        this.#prev = new UintArray(max);
+        this.#head = 0;
+        this.#tail = 0;
+        this.#free = $34c2e4b61193a7f9$var$Stack.create(max);
+        this.#size = 0;
+        this.#calculatedSize = 0;
+        if (typeof dispose === 'function') this.#dispose = dispose;
+        if (typeof disposeAfter === 'function') {
+            this.#disposeAfter = disposeAfter;
+            this.#disposed = [];
+        } else {
+            this.#disposeAfter = undefined;
+            this.#disposed = undefined;
+        }
+        this.#hasDispose = !!this.#dispose;
+        this.#hasDisposeAfter = !!this.#disposeAfter;
+        this.noDisposeOnSet = !!noDisposeOnSet;
+        this.noUpdateTTL = !!noUpdateTTL;
+        this.noDeleteOnFetchRejection = !!noDeleteOnFetchRejection;
+        this.allowStaleOnFetchRejection = !!allowStaleOnFetchRejection;
+        this.allowStaleOnFetchAbort = !!allowStaleOnFetchAbort;
+        this.ignoreFetchAbort = !!ignoreFetchAbort;
+        // NB: maxEntrySize is set to maxSize if it's set
+        if (this.maxEntrySize !== 0) {
+            if (this.#maxSize !== 0) {
+                if (!$34c2e4b61193a7f9$var$isPosInt(this.#maxSize)) throw new TypeError('maxSize must be a positive integer if specified');
+            }
+            if (!$34c2e4b61193a7f9$var$isPosInt(this.maxEntrySize)) throw new TypeError('maxEntrySize must be a positive integer if specified');
+            this.#initializeSizeTracking();
+        }
+        this.allowStale = !!allowStale;
+        this.noDeleteOnStaleGet = !!noDeleteOnStaleGet;
+        this.updateAgeOnGet = !!updateAgeOnGet;
+        this.updateAgeOnHas = !!updateAgeOnHas;
+        this.ttlResolution = $34c2e4b61193a7f9$var$isPosInt(ttlResolution) || ttlResolution === 0 ? ttlResolution : 1;
+        this.ttlAutopurge = !!ttlAutopurge;
+        this.ttl = ttl || 0;
+        if (this.ttl) {
+            if (!$34c2e4b61193a7f9$var$isPosInt(this.ttl)) throw new TypeError('ttl must be a positive integer if specified');
+            this.#initializeTTLTracking();
+        }
+        // do not allow completely unbounded caches
+        if (this.#max === 0 && this.ttl === 0 && this.#maxSize === 0) throw new TypeError('At least one of max, maxSize, or ttl is required');
+        if (!this.ttlAutopurge && !this.#max && !this.#maxSize) {
+            const code = 'LRU_CACHE_UNBOUNDED';
+            if ($34c2e4b61193a7f9$var$shouldWarn(code)) {
+                $34c2e4b61193a7f9$var$warned.add(code);
+                const msg = "TTL caching without ttlAutopurge, max, or maxSize can result in unbounded memory consumption.";
+                $34c2e4b61193a7f9$var$emitWarning(msg, 'UnboundedCacheWarning', code, $34c2e4b61193a7f9$export$182500e6725aad9a);
+            }
         }
-        $15592b8231ef184c$var$trim(this);
-    }
-    get lengthCalculator() {
-        return this[$15592b8231ef184c$var$LENGTH_CALCULATOR];
-    }
-    get length() {
-        return this[$15592b8231ef184c$var$LENGTH];
-    }
-    get itemCount() {
-        return this[$15592b8231ef184c$var$LRU_LIST].length;
-    }
-    rforEach(fn, thisp) {
-        thisp = thisp || this;
-        for(let walker = this[$15592b8231ef184c$var$LRU_LIST].tail; walker !== null;){
-            const prev = walker.prev;
-            $15592b8231ef184c$var$forEachStep(this, fn, walker, thisp);
-            walker = prev;
-        }
-    }
-    forEach(fn, thisp) {
-        thisp = thisp || this;
-        for(let walker = this[$15592b8231ef184c$var$LRU_LIST].head; walker !== null;){
-            const next = walker.next;
-            $15592b8231ef184c$var$forEachStep(this, fn, walker, thisp);
-            walker = next;
-        }
-    }
-    keys() {
-        return this[$15592b8231ef184c$var$LRU_LIST].toArray().map((k)=>k.key);
-    }
-    values() {
-        return this[$15592b8231ef184c$var$LRU_LIST].toArray().map((k)=>k.value);
-    }
-    reset() {
-        if (this[$15592b8231ef184c$var$DISPOSE] && this[$15592b8231ef184c$var$LRU_LIST] && this[$15592b8231ef184c$var$LRU_LIST].length) this[$15592b8231ef184c$var$LRU_LIST].forEach((hit)=>this[$15592b8231ef184c$var$DISPOSE](hit.key, hit.value));
-        this[$15592b8231ef184c$var$CACHE] = new Map() // hash of items by key
-        ;
-        this[$15592b8231ef184c$var$LRU_LIST] = new $1ba40dc599466f23$exports() // list of items in order of use recency
-        ;
-        this[$15592b8231ef184c$var$LENGTH] = 0 // length of items in the list
-        ;
-    }
-    dump() {
-        return this[$15592b8231ef184c$var$LRU_LIST].map((hit)=>$15592b8231ef184c$var$isStale(this, hit) ? false : {
-                k: hit.key,
-                v: hit.value,
-                e: hit.now + (hit.maxAge || 0)
-            }).toArray().filter((h)=>h);
-    }
-    dumpLru() {
-        return this[$15592b8231ef184c$var$LRU_LIST];
-    }
-    set(key, value, maxAge) {
-        maxAge = maxAge || this[$15592b8231ef184c$var$MAX_AGE];
-        if (maxAge && typeof maxAge !== 'number') throw new TypeError('maxAge must be a number');
-        const now = maxAge ? Date.now() : 0;
-        const len = this[$15592b8231ef184c$var$LENGTH_CALCULATOR](value, key);
-        if (this[$15592b8231ef184c$var$CACHE].has(key)) {
-            if (len > this[$15592b8231ef184c$var$MAX]) {
-                $15592b8231ef184c$var$del(this, this[$15592b8231ef184c$var$CACHE].get(key));
-                return false;
+    }
+    /**
+     * Return the number of ms left in the item's TTL. If item is not in cache,
+     * returns `0`. Returns `Infinity` if item is in cache without a defined TTL.
+     */ getRemainingTTL(key) {
+        return this.#keyMap.has(key) ? Infinity : 0;
+    }
+    #initializeTTLTracking() {
+        const ttls = new $34c2e4b61193a7f9$var$ZeroArray(this.#max);
+        const starts = new $34c2e4b61193a7f9$var$ZeroArray(this.#max);
+        this.#ttls = ttls;
+        this.#starts = starts;
+        this.#setItemTTL = (index, ttl, start = $34c2e4b61193a7f9$var$perf.now())=>{
+            starts[index] = ttl !== 0 ? start : 0;
+            ttls[index] = ttl;
+            if (ttl !== 0 && this.ttlAutopurge) {
+                const t = setTimeout(()=>{
+                    if (this.#isStale(index)) this.#delete(this.#keyList[index], 'expire');
+                }, ttl + 1);
+                // unref() not supported on all platforms
+                /* c8 ignore start */ if (t.unref) t.unref();
+            /* c8 ignore stop */ }
+        };
+        this.#updateItemAge = (index)=>{
+            starts[index] = ttls[index] !== 0 ? $34c2e4b61193a7f9$var$perf.now() : 0;
+        };
+        this.#statusTTL = (status, index)=>{
+            if (ttls[index]) {
+                const ttl = ttls[index];
+                const start = starts[index];
+                /* c8 ignore next */ if (!ttl || !start) return;
+                status.ttl = ttl;
+                status.start = start;
+                status.now = cachedNow || getNow();
+                const age = status.now - start;
+                status.remainingTTL = ttl - age;
             }
-            const node = this[$15592b8231ef184c$var$CACHE].get(key);
-            const item = node.value;
-            // dispose of the old one before overwriting
-            // split out into 2 ifs for better coverage tracking
-            if (this[$15592b8231ef184c$var$DISPOSE]) {
-                if (!this[$15592b8231ef184c$var$NO_DISPOSE_ON_SET]) this[$15592b8231ef184c$var$DISPOSE](key, item.value);
-            }
-            item.now = now;
-            item.maxAge = maxAge;
-            item.value = value;
-            this[$15592b8231ef184c$var$LENGTH] += len - item.length;
-            item.length = len;
-            this.get(key);
-            $15592b8231ef184c$var$trim(this);
-            return true;
+        };
+        // debounce calls to perf.now() to 1s so we're not hitting
+        // that costly call repeatedly.
+        let cachedNow = 0;
+        const getNow = ()=>{
+            const n = $34c2e4b61193a7f9$var$perf.now();
+            if (this.ttlResolution > 0) {
+                cachedNow = n;
+                const t = setTimeout(()=>cachedNow = 0, this.ttlResolution);
+                // not available on all platforms
+                /* c8 ignore start */ if (t.unref) t.unref();
+            /* c8 ignore stop */ }
+            return n;
+        };
+        this.getRemainingTTL = (key)=>{
+            const index = this.#keyMap.get(key);
+            if (index === undefined) return 0;
+            const ttl = ttls[index];
+            const start = starts[index];
+            if (!ttl || !start) return Infinity;
+            const age = (cachedNow || getNow()) - start;
+            return ttl - age;
+        };
+        this.#isStale = (index)=>{
+            const s = starts[index];
+            const t = ttls[index];
+            return !!t && !!s && (cachedNow || getNow()) - s > t;
+        };
+    }
+    // conditionally set private methods related to TTL
+    #updateItemAge = ()=>{};
+    #statusTTL = ()=>{};
+    #setItemTTL = ()=>{};
+    /* c8 ignore stop */ #isStale = ()=>false;
+    #initializeSizeTracking() {
+        const sizes = new $34c2e4b61193a7f9$var$ZeroArray(this.#max);
+        this.#calculatedSize = 0;
+        this.#sizes = sizes;
+        this.#removeItemSize = (index)=>{
+            this.#calculatedSize -= sizes[index];
+            sizes[index] = 0;
+        };
+        this.#requireSize = (k, v, size, sizeCalculation)=>{
+            // provisionally accept background fetches.
+            // actual value size will be checked when they return.
+            if (this.#isBackgroundFetch(v)) return 0;
+            if (!$34c2e4b61193a7f9$var$isPosInt(size)) {
+                if (sizeCalculation) {
+                    if (typeof sizeCalculation !== 'function') throw new TypeError('sizeCalculation must be a function');
+                    size = sizeCalculation(v, k);
+                    if (!$34c2e4b61193a7f9$var$isPosInt(size)) throw new TypeError('sizeCalculation return invalid (expect positive integer)');
+                } else throw new TypeError("invalid size value (must be positive integer). When maxSize or maxEntrySize is used, sizeCalculation or size must be set.");
+            }
+            return size;
+        };
+        this.#addItemSize = (index, size, status)=>{
+            sizes[index] = size;
+            if (this.#maxSize) {
+                const maxSize = this.#maxSize - sizes[index];
+                while(this.#calculatedSize > maxSize)this.#evict(true);
+            }
+            this.#calculatedSize += sizes[index];
+            if (status) {
+                status.entrySize = size;
+                status.totalCalculatedSize = this.#calculatedSize;
+            }
+        };
+    }
+    #removeItemSize = (_i)=>{};
+    #addItemSize = (_i, _s, _st)=>{};
+    #requireSize = (_k, _v, size, sizeCalculation)=>{
+        if (size || sizeCalculation) throw new TypeError('cannot set size without setting maxSize or maxEntrySize on cache');
+        return 0;
+    };
+    *#indexes({ allowStale: allowStale = this.allowStale } = {}) {
+        if (this.#size) for(let i = this.#tail;;){
+            if (!this.#isValidIndex(i)) break;
+            if (allowStale || !this.#isStale(i)) yield i;
+            if (i === this.#head) break;
+            else i = this.#prev[i];
         }
-        const hit = new $15592b8231ef184c$var$Entry(key, value, len, now, maxAge);
-        // oversized objects fall out of cache automatically.
-        if (hit.length > this[$15592b8231ef184c$var$MAX]) {
-            if (this[$15592b8231ef184c$var$DISPOSE]) this[$15592b8231ef184c$var$DISPOSE](key, value);
-            return false;
+    }
+    *#rindexes({ allowStale: allowStale = this.allowStale } = {}) {
+        if (this.#size) for(let i = this.#head;;){
+            if (!this.#isValidIndex(i)) break;
+            if (allowStale || !this.#isStale(i)) yield i;
+            if (i === this.#tail) break;
+            else i = this.#next[i];
         }
-        this[$15592b8231ef184c$var$LENGTH] += hit.length;
-        this[$15592b8231ef184c$var$LRU_LIST].unshift(hit);
-        this[$15592b8231ef184c$var$CACHE].set(key, this[$15592b8231ef184c$var$LRU_LIST].head);
-        $15592b8231ef184c$var$trim(this);
-        return true;
     }
-    has(key) {
-        if (!this[$15592b8231ef184c$var$CACHE].has(key)) return false;
-        const hit = this[$15592b8231ef184c$var$CACHE].get(key).value;
-        return !$15592b8231ef184c$var$isStale(this, hit);
+    #isValidIndex(index) {
+        return index !== undefined && this.#keyMap.get(this.#keyList[index]) === index;
     }
-    get(key) {
-        return $15592b8231ef184c$var$get(this, key, true);
+    /**
+     * Return a generator yielding `[key, value]` pairs,
+     * in order from most recently used to least recently used.
+     */ *entries() {
+        for (const i of this.#indexes())if (this.#valList[i] !== undefined && this.#keyList[i] !== undefined && !this.#isBackgroundFetch(this.#valList[i])) yield [
+            this.#keyList[i],
+            this.#valList[i]
+        ];
     }
-    peek(key) {
-        return $15592b8231ef184c$var$get(this, key, false);
+    /**
+     * Inverse order version of {@link LRUCache.entries}
+     *
+     * Return a generator yielding `[key, value]` pairs,
+     * in order from least recently used to most recently used.
+     */ *rentries() {
+        for (const i of this.#rindexes())if (this.#valList[i] !== undefined && this.#keyList[i] !== undefined && !this.#isBackgroundFetch(this.#valList[i])) yield [
+            this.#keyList[i],
+            this.#valList[i]
+        ];
     }
-    pop() {
-        const node = this[$15592b8231ef184c$var$LRU_LIST].tail;
-        if (!node) return null;
-        $15592b8231ef184c$var$del(this, node);
-        return node.value;
-    }
-    del(key) {
-        $15592b8231ef184c$var$del(this, this[$15592b8231ef184c$var$CACHE].get(key));
-    }
-    load(arr) {
-        // reset the cache
-        this.reset();
-        const now = Date.now();
-        // A previous serialized cache has the most recent items first
-        for(let l = arr.length - 1; l >= 0; l--){
-            const hit = arr[l];
-            const expiresAt = hit.e || 0;
-            if (expiresAt === 0) // the item was created without expiration in a non aged cache
-            this.set(hit.k, hit.v);
-            else {
-                const maxAge = expiresAt - now;
-                // dont add already expired items
-                if (maxAge > 0) this.set(hit.k, hit.v, maxAge);
+    /**
+     * Return a generator yielding the keys in the cache,
+     * in order from most recently used to least recently used.
+     */ *keys() {
+        for (const i of this.#indexes()){
+            const k = this.#keyList[i];
+            if (k !== undefined && !this.#isBackgroundFetch(this.#valList[i])) yield k;
+        }
+    }
+    /**
+     * Inverse order version of {@link LRUCache.keys}
+     *
+     * Return a generator yielding the keys in the cache,
+     * in order from least recently used to most recently used.
+     */ *rkeys() {
+        for (const i of this.#rindexes()){
+            const k = this.#keyList[i];
+            if (k !== undefined && !this.#isBackgroundFetch(this.#valList[i])) yield k;
+        }
+    }
+    /**
+     * Return a generator yielding the values in the cache,
+     * in order from most recently used to least recently used.
+     */ *values() {
+        for (const i of this.#indexes()){
+            const v = this.#valList[i];
+            if (v !== undefined && !this.#isBackgroundFetch(this.#valList[i])) yield this.#valList[i];
+        }
+    }
+    /**
+     * Inverse order version of {@link LRUCache.values}
+     *
+     * Return a generator yielding the values in the cache,
+     * in order from least recently used to most recently used.
+     */ *rvalues() {
+        for (const i of this.#rindexes()){
+            const v = this.#valList[i];
+            if (v !== undefined && !this.#isBackgroundFetch(this.#valList[i])) yield this.#valList[i];
+        }
+    }
+    /**
+     * Iterating over the cache itself yields the same results as
+     * {@link LRUCache.entries}
+     */ [Symbol.iterator]() {
+        return this.entries();
+    }
+    /**
+     * A String value that is used in the creation of the default string
+     * description of an object. Called by the built-in method
+     * `Object.prototype.toString`.
+     */ [Symbol.toStringTag] = 'LRUCache';
+    /**
+     * Find a value for which the supplied fn method returns a truthy value,
+     * similar to `Array.find()`. fn is called as `fn(value, key, cache)`.
+     */ find(fn, getOptions = {}) {
+        for (const i of this.#indexes()){
+            const v = this.#valList[i];
+            const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v;
+            if (value === undefined) continue;
+            if (fn(value, this.#keyList[i], this)) return this.get(this.#keyList[i], getOptions);
+        }
+    }
+    /**
+     * Call the supplied function on each item in the cache, in order from most
+     * recently used to least recently used.
+     *
+     * `fn` is called as `fn(value, key, cache)`.
+     *
+     * If `thisp` is provided, function will be called in the `this`-context of
+     * the provided object, or the cache if no `thisp` object is provided.
+     *
+     * Does not update age or recenty of use, or iterate over stale values.
+     */ forEach(fn, thisp = this) {
+        for (const i of this.#indexes()){
+            const v = this.#valList[i];
+            const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v;
+            if (value === undefined) continue;
+            fn.call(thisp, value, this.#keyList[i], this);
+        }
+    }
+    /**
+     * The same as {@link LRUCache.forEach} but items are iterated over in
+     * reverse order.  (ie, less recently used items are iterated over first.)
+     */ rforEach(fn, thisp = this) {
+        for (const i of this.#rindexes()){
+            const v = this.#valList[i];
+            const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v;
+            if (value === undefined) continue;
+            fn.call(thisp, value, this.#keyList[i], this);
+        }
+    }
+    /**
+     * Delete any stale entries. Returns true if anything was removed,
+     * false otherwise.
+     */ purgeStale() {
+        let deleted = false;
+        for (const i of this.#rindexes({
+            allowStale: true
+        }))if (this.#isStale(i)) {
+            this.#delete(this.#keyList[i], 'expire');
+            deleted = true;
+        }
+        return deleted;
+    }
+    /**
+     * Get the extended info about a given entry, to get its value, size, and
+     * TTL info simultaneously. Returns `undefined` if the key is not present.
+     *
+     * Unlike {@link LRUCache#dump}, which is designed to be portable and survive
+     * serialization, the `start` value is always the current timestamp, and the
+     * `ttl` is a calculated remaining time to live (negative if expired).
+     *
+     * Always returns stale values, if their info is found in the cache, so be
+     * sure to check for expirations (ie, a negative {@link LRUCache.Entry#ttl})
+     * if relevant.
+     */ info(key) {
+        const i = this.#keyMap.get(key);
+        if (i === undefined) return undefined;
+        const v = this.#valList[i];
+        const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v;
+        if (value === undefined) return undefined;
+        const entry = {
+            value: value
+        };
+        if (this.#ttls && this.#starts) {
+            const ttl = this.#ttls[i];
+            const start = this.#starts[i];
+            if (ttl && start) {
+                const remain = ttl - ($34c2e4b61193a7f9$var$perf.now() - start);
+                entry.ttl = remain;
+                entry.start = Date.now();
             }
         }
+        if (this.#sizes) entry.size = this.#sizes[i];
+        return entry;
     }
-    prune() {
-        this[$15592b8231ef184c$var$CACHE].forEach((value, key)=>$15592b8231ef184c$var$get(this, key, false));
+    /**
+     * Return an array of [key, {@link LRUCache.Entry}] tuples which can be
+     * passed to {@link LRLUCache#load}.
+     *
+     * The `start` fields are calculated relative to a portable `Date.now()`
+     * timestamp, even if `performance.now()` is available.
+     *
+     * Stale entries are always included in the `dump`, even if
+     * {@link LRUCache.OptionsBase.allowStale} is false.
+     *
+     * Note: this returns an actual array, not a generator, so it can be more
+     * easily passed around.
+     */ dump() {
+        const arr = [];
+        for (const i of this.#indexes({
+            allowStale: true
+        })){
+            const key = this.#keyList[i];
+            const v = this.#valList[i];
+            const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v;
+            if (value === undefined || key === undefined) continue;
+            const entry = {
+                value: value
+            };
+            if (this.#ttls && this.#starts) {
+                entry.ttl = this.#ttls[i];
+                // always dump the start relative to a portable timestamp
+                // it's ok for this to be a bit slow, it's a rare operation.
+                const age = $34c2e4b61193a7f9$var$perf.now() - this.#starts[i];
+                entry.start = Math.floor(Date.now() - age);
+            }
+            if (this.#sizes) entry.size = this.#sizes[i];
+            arr.unshift([
+                key,
+                entry
+            ]);
+        }
+        return arr;
     }
-}
-const $15592b8231ef184c$var$get = (self, key, doUse)=>{
-    const node = self[$15592b8231ef184c$var$CACHE].get(key);
-    if (node) {
-        const hit = node.value;
-        if ($15592b8231ef184c$var$isStale(self, hit)) {
-            $15592b8231ef184c$var$del(self, node);
-            if (!self[$15592b8231ef184c$var$ALLOW_STALE]) return undefined;
-        } else if (doUse) {
-            if (self[$15592b8231ef184c$var$UPDATE_AGE_ON_GET]) node.value.now = Date.now();
-            self[$15592b8231ef184c$var$LRU_LIST].unshiftNode(node);
+    /**
+     * Reset the cache and load in the items in entries in the order listed.
+     *
+     * The shape of the resulting cache may be different if the same options are
+     * not used in both caches.
+     *
+     * The `start` fields are assumed to be calculated relative to a portable
+     * `Date.now()` timestamp, even if `performance.now()` is available.
+     */ load(arr) {
+        this.clear();
+        for (const [key, entry] of arr){
+            if (entry.start) {
+                // entry.start is a portable timestamp, but we may be using
+                // node's performance.now(), so calculate the offset, so that
+                // we get the intended remaining TTL, no matter how long it's
+                // been on ice.
+                //
+                // it's ok for this to be a bit slow, it's a rare operation.
+                const age = Date.now() - entry.start;
+                entry.start = $34c2e4b61193a7f9$var$perf.now() - age;
+            }
+            this.set(key, entry.value, entry);
         }
-        return hit.value;
     }
-};
-const $15592b8231ef184c$var$isStale = (self, hit)=>{
-    if (!hit || !hit.maxAge && !self[$15592b8231ef184c$var$MAX_AGE]) return false;
-    const diff = Date.now() - hit.now;
-    return hit.maxAge ? diff > hit.maxAge : self[$15592b8231ef184c$var$MAX_AGE] && diff > self[$15592b8231ef184c$var$MAX_AGE];
-};
-const $15592b8231ef184c$var$trim = (self)=>{
-    if (self[$15592b8231ef184c$var$LENGTH] > self[$15592b8231ef184c$var$MAX]) for(let walker = self[$15592b8231ef184c$var$LRU_LIST].tail; self[$15592b8231ef184c$var$LENGTH] > self[$15592b8231ef184c$var$MAX] && walker !== null;){
-        // We know that we're about to delete this one, and also
-        // what the next least recently used key will be, so just
-        // go ahead and set it now.
-        const prev = walker.prev;
-        $15592b8231ef184c$var$del(self, walker);
-        walker = prev;
+    /**
+     * Add a value to the cache.
+     *
+     * Note: if `undefined` is specified as a value, this is an alias for
+     * {@link LRUCache#delete}
+     *
+     * Fields on the {@link LRUCache.SetOptions} options param will override
+     * their corresponding values in the constructor options for the scope
+     * of this single `set()` operation.
+     *
+     * If `start` is provided, then that will set the effective start
+     * time for the TTL calculation. Note that this must be a previous
+     * value of `performance.now()` if supported, or a previous value of
+     * `Date.now()` if not.
+     *
+     * Options object may also include `size`, which will prevent
+     * calling the `sizeCalculation` function and just use the specified
+     * number if it is a positive integer, and `noDisposeOnSet` which
+     * will prevent calling a `dispose` function in the case of
+     * overwrites.
+     *
+     * If the `size` (or return value of `sizeCalculation`) for a given
+     * entry is greater than `maxEntrySize`, then the item will not be
+     * added to the cache.
+     *
+     * Will update the recency of the entry.
+     *
+     * If the value is `undefined`, then this is an alias for
+     * `cache.delete(key)`. `undefined` is never stored in the cache.
+     */ set(k, v, setOptions = {}) {
+        if (v === undefined) {
+            this.delete(k);
+            return this;
+        }
+        const { ttl: ttl = this.ttl, start: start, noDisposeOnSet: noDisposeOnSet = this.noDisposeOnSet, sizeCalculation: sizeCalculation = this.sizeCalculation, status: status } = setOptions;
+        let { noUpdateTTL: noUpdateTTL = this.noUpdateTTL } = setOptions;
+        const size = this.#requireSize(k, v, setOptions.size || 0, sizeCalculation);
+        // if the item doesn't fit, don't do anything
+        // NB: maxEntrySize set to maxSize by default
+        if (this.maxEntrySize && size > this.maxEntrySize) {
+            if (status) {
+                status.set = 'miss';
+                status.maxEntrySizeExceeded = true;
+            }
+            // have to delete, in case something is there already.
+            this.#delete(k, 'set');
+            return this;
+        }
+        let index = this.#size === 0 ? undefined : this.#keyMap.get(k);
+        if (index === undefined) {
+            // addition
+            index = this.#size === 0 ? this.#tail : this.#free.length !== 0 ? this.#free.pop() : this.#size === this.#max ? this.#evict(false) : this.#size;
+            this.#keyList[index] = k;
+            this.#valList[index] = v;
+            this.#keyMap.set(k, index);
+            this.#next[this.#tail] = index;
+            this.#prev[index] = this.#tail;
+            this.#tail = index;
+            this.#size++;
+            this.#addItemSize(index, size, status);
+            if (status) status.set = 'add';
+            noUpdateTTL = false;
+        } else {
+            // update
+            this.#moveToTail(index);
+            const oldVal = this.#valList[index];
+            if (v !== oldVal) {
+                if (this.#hasFetchMethod && this.#isBackgroundFetch(oldVal)) {
+                    oldVal.__abortController.abort(new Error('replaced'));
+                    const { __staleWhileFetching: s } = oldVal;
+                    if (s !== undefined && !noDisposeOnSet) {
+                        if (this.#hasDispose) this.#dispose?.(s, k, 'set');
+                        if (this.#hasDisposeAfter) this.#disposed?.push([
+                            s,
+                            k,
+                            'set'
+                        ]);
+                    }
+                } else if (!noDisposeOnSet) {
+                    if (this.#hasDispose) this.#dispose?.(oldVal, k, 'set');
+                    if (this.#hasDisposeAfter) this.#disposed?.push([
+                        oldVal,
+                        k,
+                        'set'
+                    ]);
+                }
+                this.#removeItemSize(index);
+                this.#addItemSize(index, size, status);
+                this.#valList[index] = v;
+                if (status) {
+                    status.set = 'replace';
+                    const oldValue = oldVal && this.#isBackgroundFetch(oldVal) ? oldVal.__staleWhileFetching : oldVal;
+                    if (oldValue !== undefined) status.oldValue = oldValue;
+                }
+            } else if (status) status.set = 'update';
+        }
+        if (ttl !== 0 && !this.#ttls) this.#initializeTTLTracking();
+        if (this.#ttls) {
+            if (!noUpdateTTL) this.#setItemTTL(index, ttl, start);
+            if (status) this.#statusTTL(status, index);
+        }
+        if (!noDisposeOnSet && this.#hasDisposeAfter && this.#disposed) {
+            const dt = this.#disposed;
+            let task;
+            while(task = dt?.shift())this.#disposeAfter?.(...task);
+        }
+        return this;
     }
-};
-const $15592b8231ef184c$var$del = (self, node)=>{
-    if (node) {
-        const hit = node.value;
-        if (self[$15592b8231ef184c$var$DISPOSE]) self[$15592b8231ef184c$var$DISPOSE](hit.key, hit.value);
-        self[$15592b8231ef184c$var$LENGTH] -= hit.length;
-        self[$15592b8231ef184c$var$CACHE].delete(hit.key);
-        self[$15592b8231ef184c$var$LRU_LIST].removeNode(node);
+    /**
+     * Evict the least recently used item, returning its value or
+     * `undefined` if cache is empty.
+     */ pop() {
+        try {
+            while(this.#size){
+                const val = this.#valList[this.#head];
+                this.#evict(true);
+                if (this.#isBackgroundFetch(val)) {
+                    if (val.__staleWhileFetching) return val.__staleWhileFetching;
+                } else if (val !== undefined) return val;
+            }
+        } finally{
+            if (this.#hasDisposeAfter && this.#disposed) {
+                const dt = this.#disposed;
+                let task;
+                while(task = dt?.shift())this.#disposeAfter?.(...task);
+            }
+        }
     }
-};
-class $15592b8231ef184c$var$Entry {
-    constructor(key, value, length, now, maxAge){
-        this.key = key;
-        this.value = value;
-        this.length = length;
-        this.now = now;
-        this.maxAge = maxAge || 0;
+    #evict(free) {
+        const head = this.#head;
+        const k = this.#keyList[head];
+        const v = this.#valList[head];
+        if (this.#hasFetchMethod && this.#isBackgroundFetch(v)) v.__abortController.abort(new Error('evicted'));
+        else if (this.#hasDispose || this.#hasDisposeAfter) {
+            if (this.#hasDispose) this.#dispose?.(v, k, 'evict');
+            if (this.#hasDisposeAfter) this.#disposed?.push([
+                v,
+                k,
+                'evict'
+            ]);
+        }
+        this.#removeItemSize(head);
+        // if we aren't about to use the index, then null these out
+        if (free) {
+            this.#keyList[head] = undefined;
+            this.#valList[head] = undefined;
+            this.#free.push(head);
+        }
+        if (this.#size === 1) {
+            this.#head = this.#tail = 0;
+            this.#free.length = 0;
+        } else this.#head = this.#next[head];
+        this.#keyMap.delete(k);
+        this.#size--;
+        return head;
     }
-}
-const $15592b8231ef184c$var$forEachStep = (self, fn, node, thisp)=>{
-    let hit = node.value;
-    if ($15592b8231ef184c$var$isStale(self, hit)) {
-        $15592b8231ef184c$var$del(self, node);
-        if (!self[$15592b8231ef184c$var$ALLOW_STALE]) hit = undefined;
+    /**
+     * Check if a key is in the cache, without updating the recency of use.
+     * Will return false if the item is stale, even though it is technically
+     * in the cache.
+     *
+     * Check if a key is in the cache, without updating the recency of
+     * use. Age is updated if {@link LRUCache.OptionsBase.updateAgeOnHas} is set
+     * to `true` in either the options or the constructor.
+     *
+     * Will return `false` if the item is stale, even though it is technically in
+     * the cache. The difference can be determined (if it matters) by using a
+     * `status` argument, and inspecting the `has` field.
+     *
+     * Will not update item age unless
+     * {@link LRUCache.OptionsBase.updateAgeOnHas} is set.
+     */ has(k, hasOptions = {}) {
+        const { updateAgeOnHas: updateAgeOnHas = this.updateAgeOnHas, status: status } = hasOptions;
+        const index = this.#keyMap.get(k);
+        if (index !== undefined) {
+            const v = this.#valList[index];
+            if (this.#isBackgroundFetch(v) && v.__staleWhileFetching === undefined) return false;
+            if (!this.#isStale(index)) {
+                if (updateAgeOnHas) this.#updateItemAge(index);
+                if (status) {
+                    status.has = 'hit';
+                    this.#statusTTL(status, index);
+                }
+                return true;
+            } else if (status) {
+                status.has = 'stale';
+                this.#statusTTL(status, index);
+            }
+        } else if (status) status.has = 'miss';
+        return false;
     }
-    if (hit) fn.call(thisp, hit.value, hit.key, self);
-};
-$15592b8231ef184c$exports = $15592b8231ef184c$var$LRUCache;
+    /**
+     * Like {@link LRUCache#get} but doesn't update recency or delete stale
+     * items.
+     *
+     * Returns `undefined` if the item is stale, unless
+     * {@link LRUCache.OptionsBase.allowStale} is set.
+     */ peek(k, peekOptions = {}) {
+        const { allowStale: allowStale = this.allowStale } = peekOptions;
+        const index = this.#keyMap.get(k);
+        if (index === undefined || !allowStale && this.#isStale(index)) return;
+        const v = this.#valList[index];
+        // either stale and allowed, or forcing a refresh of non-stale value
+        return this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v;
+    }
+    #backgroundFetch(k, index, options, context) {
+        const v = index === undefined ? undefined : this.#valList[index];
+        if (this.#isBackgroundFetch(v)) return v;
+        const ac = new $34c2e4b61193a7f9$var$AC();
+        const { signal: signal } = options;
+        // when/if our AC signals, then stop listening to theirs.
+        signal?.addEventListener('abort', ()=>ac.abort(signal.reason), {
+            signal: ac.signal
+        });
+        const fetchOpts = {
+            signal: ac.signal,
+            options: options,
+            context: context
+        };
+        const cb = (v, updateCache = false)=>{
+            const { aborted: aborted } = ac.signal;
+            const ignoreAbort = options.ignoreFetchAbort && v !== undefined;
+            if (options.status) {
+                if (aborted && !updateCache) {
+                    options.status.fetchAborted = true;
+                    options.status.fetchError = ac.signal.reason;
+                    if (ignoreAbort) options.status.fetchAbortIgnored = true;
+                } else options.status.fetchResolved = true;
+            }
+            if (aborted && !ignoreAbort && !updateCache) return fetchFail(ac.signal.reason);
+            // either we didn't abort, and are still here, or we did, and ignored
+            const bf = p;
+            if (this.#valList[index] === p) {
+                if (v === undefined) {
+                    if (bf.__staleWhileFetching) this.#valList[index] = bf.__staleWhileFetching;
+                    else this.#delete(k, 'fetch');
+                } else {
+                    if (options.status) options.status.fetchUpdated = true;
+                    this.set(k, v, fetchOpts.options);
+                }
+            }
+            return v;
+        };
+        const eb = (er)=>{
+            if (options.status) {
+                options.status.fetchRejected = true;
+                options.status.fetchError = er;
+            }
+            return fetchFail(er);
+        };
+        const fetchFail = (er)=>{
+            const { aborted: aborted } = ac.signal;
+            const allowStaleAborted = aborted && options.allowStaleOnFetchAbort;
+            const allowStale = allowStaleAborted || options.allowStaleOnFetchRejection;
+            const noDelete = allowStale || options.noDeleteOnFetchRejection;
+            const bf = p;
+            if (this.#valList[index] === p) {
+                // if we allow stale on fetch rejections, then we need to ensure that
+                // the stale value is not removed from the cache when the fetch fails.
+                const del = !noDelete || bf.__staleWhileFetching === undefined;
+                if (del) this.#delete(k, 'fetch');
+                else if (!allowStaleAborted) // still replace the *promise* with the stale value,
+                // since we are done with the promise at this point.
+                // leave it untouched if we're still waiting for an
+                // aborted background fetch that hasn't yet returned.
+                this.#valList[index] = bf.__staleWhileFetching;
+            }
+            if (allowStale) {
+                if (options.status && bf.__staleWhileFetching !== undefined) options.status.returnedStale = true;
+                return bf.__staleWhileFetching;
+            } else if (bf.__returned === bf) throw er;
+        };
+        const pcall = (res, rej)=>{
+            const fmp = this.#fetchMethod?.(k, v, fetchOpts);
+            if (fmp && fmp instanceof Promise) fmp.then((v)=>res(v === undefined ? undefined : v), rej);
+            // ignored, we go until we finish, regardless.
+            // defer check until we are actually aborting,
+            // so fetchMethod can override.
+            ac.signal.addEventListener('abort', ()=>{
+                if (!options.ignoreFetchAbort || options.allowStaleOnFetchAbort) {
+                    res(undefined);
+                    // when it eventually resolves, update the cache.
+                    if (options.allowStaleOnFetchAbort) res = (v)=>cb(v, true);
+                }
+            });
+        };
+        if (options.status) options.status.fetchDispatched = true;
+        const p = new Promise(pcall).then(cb, eb);
+        const bf = Object.assign(p, {
+            __abortController: ac,
+            __staleWhileFetching: v,
+            __returned: undefined
+        });
+        if (index === undefined) {
+            // internal, don't expose status.
+            this.set(k, bf, {
+                ...fetchOpts.options,
+                status: undefined
+            });
+            index = this.#keyMap.get(k);
+        } else this.#valList[index] = bf;
+        return bf;
+    }
+    #isBackgroundFetch(p) {
+        if (!this.#hasFetchMethod) return false;
+        const b = p;
+        return !!b && b instanceof Promise && b.hasOwnProperty('__staleWhileFetching') && b.__abortController instanceof $34c2e4b61193a7f9$var$AC;
+    }
+    async fetch(k, fetchOptions = {}) {
+        const { allowStale: // get options
+        allowStale = this.allowStale, updateAgeOnGet: updateAgeOnGet = this.updateAgeOnGet, noDeleteOnStaleGet: noDeleteOnStaleGet = this.noDeleteOnStaleGet, ttl: // set options
+        ttl = this.ttl, noDisposeOnSet: noDisposeOnSet = this.noDisposeOnSet, size: size = 0, sizeCalculation: sizeCalculation = this.sizeCalculation, noUpdateTTL: noUpdateTTL = this.noUpdateTTL, noDeleteOnFetchRejection: // fetch exclusive options
+        noDeleteOnFetchRejection = this.noDeleteOnFetchRejection, allowStaleOnFetchRejection: allowStaleOnFetchRejection = this.allowStaleOnFetchRejection, ignoreFetchAbort: ignoreFetchAbort = this.ignoreFetchAbort, allowStaleOnFetchAbort: allowStaleOnFetchAbort = this.allowStaleOnFetchAbort, context: context, forceRefresh: forceRefresh = false, status: status, signal: signal } = fetchOptions;
+        if (!this.#hasFetchMethod) {
+            if (status) status.fetch = 'get';
+            return this.get(k, {
+                allowStale: allowStale,
+                updateAgeOnGet: updateAgeOnGet,
+                noDeleteOnStaleGet: noDeleteOnStaleGet,
+                status: status
+            });
+        }
+        const options = {
+            allowStale: allowStale,
+            updateAgeOnGet: updateAgeOnGet,
+            noDeleteOnStaleGet: noDeleteOnStaleGet,
+            ttl: ttl,
+            noDisposeOnSet: noDisposeOnSet,
+            size: size,
+            sizeCalculation: sizeCalculation,
+            noUpdateTTL: noUpdateTTL,
+            noDeleteOnFetchRejection: noDeleteOnFetchRejection,
+            allowStaleOnFetchRejection: allowStaleOnFetchRejection,
+            allowStaleOnFetchAbort: allowStaleOnFetchAbort,
+            ignoreFetchAbort: ignoreFetchAbort,
+            status: status,
+            signal: signal
+        };
+        let index = this.#keyMap.get(k);
+        if (index === undefined) {
+            if (status) status.fetch = 'miss';
+            const p = this.#backgroundFetch(k, index, options, context);
+            return p.__returned = p;
+        } else {
+            // in cache, maybe already fetching
+            const v = this.#valList[index];
+            if (this.#isBackgroundFetch(v)) {
+                const stale = allowStale && v.__staleWhileFetching !== undefined;
+                if (status) {
+                    status.fetch = 'inflight';
+                    if (stale) status.returnedStale = true;
+                }
+                return stale ? v.__staleWhileFetching : v.__returned = v;
+            }
+            // if we force a refresh, that means do NOT serve the cached value,
+            // unless we are already in the process of refreshing the cache.
+            const isStale = this.#isStale(index);
+            if (!forceRefresh && !isStale) {
+                if (status) status.fetch = 'hit';
+                this.#moveToTail(index);
+                if (updateAgeOnGet) this.#updateItemAge(index);
+                if (status) this.#statusTTL(status, index);
+                return v;
+            }
+            // ok, it is stale or a forced refresh, and not already fetching.
+            // refresh the cache.
+            const p = this.#backgroundFetch(k, index, options, context);
+            const hasStale = p.__staleWhileFetching !== undefined;
+            const staleVal = hasStale && allowStale;
+            if (status) {
+                status.fetch = isStale ? 'stale' : 'refresh';
+                if (staleVal && isStale) status.returnedStale = true;
+            }
+            return staleVal ? p.__staleWhileFetching : p.__returned = p;
+        }
+    }
+    async forceFetch(k, fetchOptions = {}) {
+        const v = await this.fetch(k, fetchOptions);
+        if (v === undefined) throw new Error('fetch() returned undefined');
+        return v;
+    }
+    memo(k, memoOptions = {}) {
+        const memoMethod = this.#memoMethod;
+        if (!memoMethod) throw new Error('no memoMethod provided to constructor');
+        const { context: context, forceRefresh: forceRefresh, ...options } = memoOptions;
+        const v = this.get(k, options);
+        if (!forceRefresh && v !== undefined) return v;
+        const vv = memoMethod(k, v, {
+            options: options,
+            context: context
+        });
+        this.set(k, vv, options);
+        return vv;
+    }
+    /**
+     * Return a value from the cache. Will update the recency of the cache
+     * entry found.
+     *
+     * If the key is not found, get() will return `undefined`.
+     */ get(k, getOptions = {}) {
+        const { allowStale: allowStale = this.allowStale, updateAgeOnGet: updateAgeOnGet = this.updateAgeOnGet, noDeleteOnStaleGet: noDeleteOnStaleGet = this.noDeleteOnStaleGet, status: status } = getOptions;
+        const index = this.#keyMap.get(k);
+        if (index !== undefined) {
+            const value = this.#valList[index];
+            const fetching = this.#isBackgroundFetch(value);
+            if (status) this.#statusTTL(status, index);
+            if (this.#isStale(index)) {
+                if (status) status.get = 'stale';
+                // delete only if not an in-flight background fetch
+                if (!fetching) {
+                    if (!noDeleteOnStaleGet) this.#delete(k, 'expire');
+                    if (status && allowStale) status.returnedStale = true;
+                    return allowStale ? value : undefined;
+                } else {
+                    if (status && allowStale && value.__staleWhileFetching !== undefined) status.returnedStale = true;
+                    return allowStale ? value.__staleWhileFetching : undefined;
+                }
+            } else {
+                if (status) status.get = 'hit';
+                // if we're currently fetching it, we don't actually have it yet
+                // it's not stale, which means this isn't a staleWhileRefetching.
+                // If it's not stale, and fetching, AND has a __staleWhileFetching
+                // value, then that means the user fetched with {forceRefresh:true},
+                // so it's safe to return that value.
+                if (fetching) return value.__staleWhileFetching;
+                this.#moveToTail(index);
+                if (updateAgeOnGet) this.#updateItemAge(index);
+                return value;
+            }
+        } else if (status) status.get = 'miss';
+    }
+    #connect(p, n) {
+        this.#prev[n] = p;
+        this.#next[p] = n;
+    }
+    #moveToTail(index) {
+        // if tail already, nothing to do
+        // if head, move head to next[index]
+        // else
+        //   move next[prev[index]] to next[index] (head has no prev)
+        //   move prev[next[index]] to prev[index]
+        // prev[index] = tail
+        // next[tail] = index
+        // tail = index
+        if (index !== this.#tail) {
+            if (index === this.#head) this.#head = this.#next[index];
+            else this.#connect(this.#prev[index], this.#next[index]);
+            this.#connect(this.#tail, index);
+            this.#tail = index;
+        }
+    }
+    /**
+     * Deletes a key out of the cache.
+     *
+     * Returns true if the key was deleted, false otherwise.
+     */ delete(k) {
+        return this.#delete(k, 'delete');
+    }
+    #delete(k, reason) {
+        let deleted = false;
+        if (this.#size !== 0) {
+            const index = this.#keyMap.get(k);
+            if (index !== undefined) {
+                deleted = true;
+                if (this.#size === 1) this.#clear(reason);
+                else {
+                    this.#removeItemSize(index);
+                    const v = this.#valList[index];
+                    if (this.#isBackgroundFetch(v)) v.__abortController.abort(new Error('deleted'));
+                    else if (this.#hasDispose || this.#hasDisposeAfter) {
+                        if (this.#hasDispose) this.#dispose?.(v, k, reason);
+                        if (this.#hasDisposeAfter) this.#disposed?.push([
+                            v,
+                            k,
+                            reason
+                        ]);
+                    }
+                    this.#keyMap.delete(k);
+                    this.#keyList[index] = undefined;
+                    this.#valList[index] = undefined;
+                    if (index === this.#tail) this.#tail = this.#prev[index];
+                    else if (index === this.#head) this.#head = this.#next[index];
+                    else {
+                        const pi = this.#prev[index];
+                        this.#next[pi] = this.#next[index];
+                        const ni = this.#next[index];
+                        this.#prev[ni] = this.#prev[index];
+                    }
+                    this.#size--;
+                    this.#free.push(index);
+                }
+            }
+        }
+        if (this.#hasDisposeAfter && this.#disposed?.length) {
+            const dt = this.#disposed;
+            let task;
+            while(task = dt?.shift())this.#disposeAfter?.(...task);
+        }
+        return deleted;
+    }
+    /**
+     * Clear the cache entirely, throwing away all values.
+     */ clear() {
+        return this.#clear('delete');
+    }
+    #clear(reason) {
+        for (const index of this.#rindexes({
+            allowStale: true
+        })){
+            const v = this.#valList[index];
+            if (this.#isBackgroundFetch(v)) v.__abortController.abort(new Error('deleted'));
+            else {
+                const k = this.#keyList[index];
+                if (this.#hasDispose) this.#dispose?.(v, k, reason);
+                if (this.#hasDisposeAfter) this.#disposed?.push([
+                    v,
+                    k,
+                    reason
+                ]);
+            }
+        }
+        this.#keyMap.clear();
+        this.#valList.fill(undefined);
+        this.#keyList.fill(undefined);
+        if (this.#ttls && this.#starts) {
+            this.#ttls.fill(0);
+            this.#starts.fill(0);
+        }
+        if (this.#sizes) this.#sizes.fill(0);
+        this.#head = 0;
+        this.#tail = 0;
+        this.#free.length = 0;
+        this.#calculatedSize = 0;
+        this.#size = 0;
+        if (this.#hasDisposeAfter && this.#disposed) {
+            const dt = this.#disposed;
+            let task;
+            while(task = dt?.shift())this.#disposeAfter?.(...task);
+        }
+    }
+}
 
 
-const $37dda638e06feff5$var$configCache = new (0, (/*@__PURE__*/$parcel$interopDefault($15592b8231ef184c$exports)))({
+const $37dda638e06feff5$var$configCache = new (0, $34c2e4b61193a7f9$export$182500e6725aad9a)({
     max: 500
 });
 const $37dda638e06feff5$var$resolveCache = new Map();
@@ -36520,7 +37407,7 @@ async function $37dda638e06feff5$export$c1a4367d4847eb06(fs, filepath, filenames
     return null;
 }
 $37dda638e06feff5$export$c1a4367d4847eb06.clear = ()=>{
-    $37dda638e06feff5$var$configCache.reset();
+    $37dda638e06feff5$var$configCache.clear();
     $37dda638e06feff5$var$resolveCache.clear();
 };
 async function $37dda638e06feff5$export$f5327b421858c8cd(fs, configFile, opts) {
@@ -37323,6 +38210,46 @@ $7865b56d1a966ce7$exports = ({ onlyFirst: onlyFirst = false } = {})=>{
 $c6e7686f671d96bd$exports = (string)=>typeof string === 'string' ? string.replace($7865b56d1a966ce7$exports(), '') : string;
 
 
+function $898ec9690c913f83$export$d9e46360b4510851(config) {
+    if (!config) return {
+        version: 3
+    };
+    // These options were removed in v2.
+    if (config.full != null || config.svg2js != null) return {
+        version: 2,
+        path: config.full != null ? '/full' : '/svg2js'
+    };
+    if (Array.isArray(config.plugins)) {
+        // Custom plugins in v2 had additional (required) fields that don't exist anymore.
+        let v2Plugin = config.plugins.findIndex((p)=>p?.type != null || p?.fn && p?.params != null);
+        if (v2Plugin !== -1) {
+            let field = config.plugins[v2Plugin].type != null ? 'type' : 'params';
+            return {
+                version: 2,
+                path: `/plugins/${v2Plugin}/${field}`
+            };
+        }
+        // the cleanupIDs plugin lost the prefix option in v3.
+        let cleanupIdsIndex = config.plugins.findIndex((p)=>p?.name === 'cleanupIDs');
+        let cleanupIDs = cleanupIdsIndex !== -1 ? config.plugins[cleanupIdsIndex] : null;
+        if (cleanupIDs?.params?.prefix != null) return {
+            version: 2,
+            path: `/plugins/${cleanupIdsIndex}/params/prefix`
+        };
+        // Automatically migrate some options from SVGO 2 config files.
+        config.plugins = config.plugins.filter((p)=>p?.active !== false);
+        for(let i = 0; i < config.plugins.length; i++){
+            let p = config.plugins[i];
+            if (p === 'cleanupIDs') config.plugins[i] = 'cleanupIds';
+            if (p?.name === 'cleanupIDs') config.plugins[i].name = 'cleanupIds';
+        }
+    }
+    return {
+        version: 3
+    };
+}
+
+
 
 
 //# sourceMappingURL=index.js.map