llmz 0.6.0 → 0.6.1

package/dist/vm-BHo3ENPb.js

@@ -0,0 +1,3430 @@
+import { t as __commonJSMin } from "./rolldown-runtime-EAsCxrDo.js";
+import { B as isSymbol, I as isFunction, M as baseAssignValue, t as baseIteratee } from "./_baseIteratee-D5Jf7fip.js";
+import { t as baseForOwn } from "./_baseForOwn-D8-Dvy2A.js";
+import { t as cleanStackTrace } from "./stack-traces-BIE_5Xwf.js";
+import { a as InvalidCodeError, c as SnapshotSignal, n as CodeExecutionError, s as Signals, u as VMSignal } from "./errors-Cg1G0Awu.js";
+import { n as getQuickJSVariant } from "./quickjs-variant-BYhMBpwU.js";
+import MagicString from "magic-string";
+import { parse } from "acorn";
+import { newQuickJSWASMModuleFromVariant, shouldInterruptAfterDeadline } from "quickjs-emscripten-core";
+//#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseGt.js
+/**
+* The base implementation of `_.gt` which doesn't coerce arguments.
+*
+* @private
+* @param {*} value The value to compare.
+* @param {*} other The other value to compare.
+* @returns {boolean} Returns `true` if `value` is greater than `other`,
+*  else `false`.
+*/
+function baseGt(value, other) {
+	return value > other;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/mapValues.js
+/**
+* Creates an object with the same keys as `object` and values generated
+* by running each own enumerable string keyed property of `object` thru
+* `iteratee`. The iteratee is invoked with three arguments:
+* (value, key, object).
+*
+* @static
+* @memberOf _
+* @since 2.4.0
+* @category Object
+* @param {Object} object The object to iterate over.
+* @param {Function} [iteratee=_.identity] The function invoked per iteration.
+* @returns {Object} Returns the new mapped object.
+* @see _.mapKeys
+* @example
+*
+* var users = {
+*   'fred':    { 'user': 'fred',    'age': 40 },
+*   'pebbles': { 'user': 'pebbles', 'age': 1 }
+* };
+*
+* _.mapValues(users, function(o) { return o.age; });
+* // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
+*
+* // The `_.property` iteratee shorthand.
+* _.mapValues(users, 'age');
+* // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
+*/
+function mapValues(object, iteratee) {
+	var result = {};
+	iteratee = baseIteratee(iteratee, 3);
+	baseForOwn(object, function(value, key, object) {
+		baseAssignValue(result, key, iteratee(value, key, object));
+	});
+	return result;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseExtremum.js
+/**
+* The base implementation of methods like `_.max` and `_.min` which accepts a
+* `comparator` to determine the extremum value.
+*
+* @private
+* @param {Array} array The array to iterate over.
+* @param {Function} iteratee The iteratee invoked per iteration.
+* @param {Function} comparator The comparator used to compare values.
+* @returns {*} Returns the extremum value.
+*/
+function baseExtremum(array, iteratee, comparator) {
+	var index = -1, length = array.length;
+	while (++index < length) {
+		var value = array[index], current = iteratee(value);
+		if (current != null && (computed === void 0 ? current === current && !isSymbol(current) : comparator(current, computed))) var computed = current, result = value;
+	}
+	return result;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/maxBy.js
+/**
+* This method is like `_.max` except that it accepts `iteratee` which is
+* invoked for each element in `array` to generate the criterion by which
+* the value is ranked. The iteratee is invoked with one argument: (value).
+*
+* @static
+* @memberOf _
+* @since 4.0.0
+* @category Math
+* @param {Array} array The array to iterate over.
+* @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+* @returns {*} Returns the maximum value.
+* @example
+*
+* var objects = [{ 'n': 1 }, { 'n': 2 }];
+*
+* _.maxBy(objects, function(o) { return o.n; });
+* // => { 'n': 2 }
+*
+* // The `_.property` iteratee shorthand.
+* _.maxBy(objects, 'n');
+* // => { 'n': 2 }
+*/
+function maxBy(array, iteratee) {
+	return array && array.length ? baseExtremum(array, baseIteratee(iteratee, 2), baseGt) : void 0;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/source-map-js@1.2.1_patch_hash=0354139cbc5dbd66e1bc59167ff8e42d3a9a2169038a35f1b7b1b4b843e08a6c/node_modules/source-map-js/lib/base64.js
+var require_base64 = /* @__PURE__ */ __commonJSMin(((exports) => {
+	var intToCharMap = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".split("");
+	/**
+	* Encode an integer in the range of 0 to 63 to a single base 64 digit.
+	*/
+	exports.encode = function(number) {
+		if (0 <= number && number < intToCharMap.length) return intToCharMap[number];
+		throw new TypeError("Must be between 0 and 63: " + number);
+	};
+	/**
+	* Decode a single base 64 character code digit to an integer. Returns -1 on
+	* failure.
+	*/
+	exports.decode = function(charCode) {
+		var bigA = 65;
+		var bigZ = 90;
+		var littleA = 97;
+		var littleZ = 122;
+		var zero = 48;
+		var nine = 57;
+		var plus = 43;
+		var slash = 47;
+		var littleOffset = 26;
+		var numberOffset = 52;
+		if (bigA <= charCode && charCode <= bigZ) return charCode - bigA;
+		if (littleA <= charCode && charCode <= littleZ) return charCode - littleA + littleOffset;
+		if (zero <= charCode && charCode <= nine) return charCode - zero + numberOffset;
+		if (charCode == plus) return 62;
+		if (charCode == slash) return 63;
+		return -1;
+	};
+}));
+//#endregion
+//#region ../../node_modules/.pnpm/source-map-js@1.2.1_patch_hash=0354139cbc5dbd66e1bc59167ff8e42d3a9a2169038a35f1b7b1b4b843e08a6c/node_modules/source-map-js/lib/base64-vlq.js
+var require_base64_vlq = /* @__PURE__ */ __commonJSMin(((exports) => {
+	var base64 = require_base64();
+	var VLQ_BASE_SHIFT = 5;
+	var VLQ_BASE = 1 << VLQ_BASE_SHIFT;
+	var VLQ_BASE_MASK = VLQ_BASE - 1;
+	var VLQ_CONTINUATION_BIT = VLQ_BASE;
+	/**
+	* Converts from a two-complement value to a value where the sign bit is
+	* placed in the least significant bit.  For example, as decimals:
+	*   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+	*   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+	*/
+	function toVLQSigned(aValue) {
+		return aValue < 0 ? (-aValue << 1) + 1 : (aValue << 1) + 0;
+	}
+	/**
+	* Converts to a two-complement value from a value where the sign bit is
+	* placed in the least significant bit.  For example, as decimals:
+	*   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+	*   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+	*/
+	function fromVLQSigned(aValue) {
+		var isNegative = (aValue & 1) === 1;
+		var shifted = aValue >> 1;
+		return isNegative ? -shifted : shifted;
+	}
+	/**
+	* Returns the base 64 VLQ encoded value.
+	*/
+	exports.encode = function base64VLQ_encode(aValue) {
+		var encoded = "";
+		var digit;
+		var vlq = toVLQSigned(aValue);
+		do {
+			digit = vlq & VLQ_BASE_MASK;
+			vlq >>>= VLQ_BASE_SHIFT;
+			if (vlq > 0) digit |= VLQ_CONTINUATION_BIT;
+			encoded += base64.encode(digit);
+		} while (vlq > 0);
+		return encoded;
+	};
+	/**
+	* Decodes the next base 64 VLQ value from the given string and returns the
+	* value and the rest of the string via the out parameter.
+	*/
+	exports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {
+		var strLen = aStr.length;
+		var result = 0;
+		var shift = 0;
+		var continuation, digit;
+		do {
+			if (aIndex >= strLen) throw new Error("Expected more digits in base 64 VLQ value.");
+			digit = base64.decode(aStr.charCodeAt(aIndex++));
+			if (digit === -1) throw new Error("Invalid base64 digit: " + aStr.charAt(aIndex - 1));
+			continuation = !!(digit & VLQ_CONTINUATION_BIT);
+			digit &= VLQ_BASE_MASK;
+			result = result + (digit << shift);
+			shift += VLQ_BASE_SHIFT;
+		} while (continuation);
+		aOutParam.value = fromVLQSigned(result);
+		aOutParam.rest = aIndex;
+	};
+}));
+//#endregion
+//#region ../../node_modules/.pnpm/source-map-js@1.2.1_patch_hash=0354139cbc5dbd66e1bc59167ff8e42d3a9a2169038a35f1b7b1b4b843e08a6c/node_modules/source-map-js/lib/util.js
+var require_util = /* @__PURE__ */ __commonJSMin(((exports) => {
+	/**
+	* This is a helper function for getting values from parameter/options
+	* objects.
+	*
+	* @param args The object we are extracting values from
+	* @param name The name of the property we are getting.
+	* @param defaultValue An optional value to return if the property is missing
+	* from the object. If this is not specified and the property is missing, an
+	* error will be thrown.
+	*/
+	function getArg(aArgs, aName, aDefaultValue) {
+		if (aName in aArgs) return aArgs[aName];
+		else if (arguments.length === 3) return aDefaultValue;
+		else throw new Error("\"" + aName + "\" is a required argument.");
+	}
+	exports.getArg = getArg;
+	var urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;
+	var dataUrlRegexp = /^data:.+\,.+$/;
+	function urlParse(aUrl) {
+		var match = aUrl.match(urlRegexp);
+		if (!match) return null;
+		return {
+			scheme: match[1],
+			auth: match[2],
+			host: match[3],
+			port: match[4],
+			path: match[5]
+		};
+	}
+	exports.urlParse = urlParse;
+	function urlGenerate(aParsedUrl) {
+		var url = "";
+		if (aParsedUrl.scheme) url += aParsedUrl.scheme + ":";
+		url += "//";
+		if (aParsedUrl.auth) url += aParsedUrl.auth + "@";
+		if (aParsedUrl.host) url += aParsedUrl.host;
+		if (aParsedUrl.port) url += ":" + aParsedUrl.port;
+		if (aParsedUrl.path) url += aParsedUrl.path;
+		return url;
+	}
+	exports.urlGenerate = urlGenerate;
+	var MAX_CACHED_INPUTS = 32;
+	/**
+	* Takes some function `f(input) -> result` and returns a memoized version of
+	* `f`.
+	*
+	* We keep at most `MAX_CACHED_INPUTS` memoized results of `f` alive. The
+	* memoization is a dumb-simple, linear least-recently-used cache.
+	*/
+	function lruMemoize(f) {
+		var cache = [];
+		return function(input) {
+			for (var i = 0; i < cache.length; i++) if (cache[i].input === input) {
+				var temp = cache[0];
+				cache[0] = cache[i];
+				cache[i] = temp;
+				return cache[0].result;
+			}
+			var result = f(input);
+			cache.unshift({
+				input,
+				result
+			});
+			if (cache.length > MAX_CACHED_INPUTS) cache.pop();
+			return result;
+		};
+	}
+	/**
+	* Normalizes a path, or the path portion of a URL:
+	*
+	* - Replaces consecutive slashes with one slash.
+	* - Removes unnecessary '.' parts.
+	* - Removes unnecessary '<dir>/..' parts.
+	*
+	* Based on code in the Node.js 'path' core module.
+	*
+	* @param aPath The path or url to normalize.
+	*/
+	var normalize = lruMemoize(function normalize(aPath) {
+		var path = aPath;
+		var url = urlParse(aPath);
+		if (url) {
+			if (!url.path) return aPath;
+			path = url.path;
+		}
+		var isAbsolute = exports.isAbsolute(path);
+		var parts = [];
+		var start = 0;
+		var i = 0;
+		while (true) {
+			start = i;
+			i = path.indexOf("/", start);
+			if (i === -1) {
+				parts.push(path.slice(start));
+				break;
+			} else {
+				parts.push(path.slice(start, i));
+				while (i < path.length && path[i] === "/") i++;
+			}
+		}
+		for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {
+			part = parts[i];
+			if (part === ".") parts.splice(i, 1);
+			else if (part === "..") up++;
+			else if (up > 0) if (part === "") {
+				parts.splice(i + 1, up);
+				up = 0;
+			} else {
+				parts.splice(i, 2);
+				up--;
+			}
+		}
+		path = parts.join("/");
+		if (path === "") path = isAbsolute ? "/" : ".";
+		if (url) {
+			url.path = path;
+			return urlGenerate(url);
+		}
+		return path;
+	});
+	exports.normalize = normalize;
+	/**
+	* Joins two paths/URLs.
+	*
+	* @param aRoot The root path or URL.
+	* @param aPath The path or URL to be joined with the root.
+	*
+	* - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+	*   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+	*   first.
+	* - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+	*   is updated with the result and aRoot is returned. Otherwise the result
+	*   is returned.
+	*   - If aPath is absolute, the result is aPath.
+	*   - Otherwise the two paths are joined with a slash.
+	* - Joining for example 'http://' and 'www.example.com' is also supported.
+	*/
+	function join(aRoot, aPath) {
+		if (aRoot === "") aRoot = ".";
+		if (aPath === "") aPath = ".";
+		var aPathUrl = urlParse(aPath);
+		var aRootUrl = urlParse(aRoot);
+		if (aRootUrl) aRoot = aRootUrl.path || "/";
+		if (aPathUrl && !aPathUrl.scheme) {
+			if (aRootUrl) aPathUrl.scheme = aRootUrl.scheme;
+			return urlGenerate(aPathUrl);
+		}
+		if (aPathUrl || aPath.match(dataUrlRegexp)) return aPath;
+		if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {
+			aRootUrl.host = aPath;
+			return urlGenerate(aRootUrl);
+		}
+		var joined = aPath.charAt(0) === "/" ? aPath : normalize(aRoot.replace(/\/+$/, "") + "/" + aPath);
+		if (aRootUrl) {
+			aRootUrl.path = joined;
+			return urlGenerate(aRootUrl);
+		}
+		return joined;
+	}
+	exports.join = join;
+	exports.isAbsolute = function(aPath) {
+		return aPath.charAt(0) === "/" || urlRegexp.test(aPath);
+	};
+	/**
+	* Make a path relative to a URL or another path.
+	*
+	* @param aRoot The root path or URL.
+	* @param aPath The path or URL to be made relative to aRoot.
+	*/
+	function relative(aRoot, aPath) {
+		if (aRoot === "") aRoot = ".";
+		aRoot = aRoot.replace(/\/$/, "");
+		var level = 0;
+		while (aPath.indexOf(aRoot + "/") !== 0) {
+			var index = aRoot.lastIndexOf("/");
+			if (index < 0) return aPath;
+			aRoot = aRoot.slice(0, index);
+			if (aRoot.match(/^([^\/]+:\/)?\/*$/)) return aPath;
+			++level;
+		}
+		return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1);
+	}
+	exports.relative = relative;
+	var supportsNullProto = function() {
+		return !("__proto__" in Object.create(null));
+	}();
+	function identity(s) {
+		return s;
+	}
+	/**
+	* Because behavior goes wacky when you set `__proto__` on objects, we
+	* have to prefix all the strings in our set with an arbitrary character.
+	*
+	* See https://github.com/mozilla/source-map/pull/31 and
+	* https://github.com/mozilla/source-map/issues/30
+	*
+	* @param String aStr
+	*/
+	function toSetString(aStr) {
+		if (isProtoString(aStr)) return "$" + aStr;
+		return aStr;
+	}
+	exports.toSetString = supportsNullProto ? identity : toSetString;
+	function fromSetString(aStr) {
+		if (isProtoString(aStr)) return aStr.slice(1);
+		return aStr;
+	}
+	exports.fromSetString = supportsNullProto ? identity : fromSetString;
+	function isProtoString(s) {
+		if (!s) return false;
+		var length = s.length;
+		if (length < 9) return false;
+		if (s.charCodeAt(length - 1) !== 95 || s.charCodeAt(length - 2) !== 95 || s.charCodeAt(length - 3) !== 111 || s.charCodeAt(length - 4) !== 116 || s.charCodeAt(length - 5) !== 111 || s.charCodeAt(length - 6) !== 114 || s.charCodeAt(length - 7) !== 112 || s.charCodeAt(length - 8) !== 95 || s.charCodeAt(length - 9) !== 95) return false;
+		for (var i = length - 10; i >= 0; i--) if (s.charCodeAt(i) !== 36) return false;
+		return true;
+	}
+	/**
+	* Comparator between two mappings where the original positions are compared.
+	*
+	* Optionally pass in `true` as `onlyCompareGenerated` to consider two
+	* mappings with the same original source/line/column, but different generated
+	* line and column the same. Useful when searching for a mapping with a
+	* stubbed out mapping.
+	*/
+	function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
+		var cmp = strcmp(mappingA.source, mappingB.source);
+		if (cmp !== 0) return cmp;
+		cmp = mappingA.originalLine - mappingB.originalLine;
+		if (cmp !== 0) return cmp;
+		cmp = mappingA.originalColumn - mappingB.originalColumn;
+		if (cmp !== 0 || onlyCompareOriginal) return cmp;
+		cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+		if (cmp !== 0) return cmp;
+		cmp = mappingA.generatedLine - mappingB.generatedLine;
+		if (cmp !== 0) return cmp;
+		return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByOriginalPositions = compareByOriginalPositions;
+	function compareByOriginalPositionsNoSource(mappingA, mappingB, onlyCompareOriginal) {
+		var cmp = mappingA.originalLine - mappingB.originalLine;
+		if (cmp !== 0) return cmp;
+		cmp = mappingA.originalColumn - mappingB.originalColumn;
+		if (cmp !== 0 || onlyCompareOriginal) return cmp;
+		cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+		if (cmp !== 0) return cmp;
+		cmp = mappingA.generatedLine - mappingB.generatedLine;
+		if (cmp !== 0) return cmp;
+		return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByOriginalPositionsNoSource = compareByOriginalPositionsNoSource;
+	/**
+	* Comparator between two mappings with deflated source and name indices where
+	* the generated positions are compared.
+	*
+	* Optionally pass in `true` as `onlyCompareGenerated` to consider two
+	* mappings with the same generated line and column, but different
+	* source/name/original line and column the same. Useful when searching for a
+	* mapping with a stubbed out mapping.
+	*/
+	function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {
+		var cmp = mappingA.generatedLine - mappingB.generatedLine;
+		if (cmp !== 0) return cmp;
+		cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+		if (cmp !== 0 || onlyCompareGenerated) return cmp;
+		cmp = strcmp(mappingA.source, mappingB.source);
+		if (cmp !== 0) return cmp;
+		cmp = mappingA.originalLine - mappingB.originalLine;
+		if (cmp !== 0) return cmp;
+		cmp = mappingA.originalColumn - mappingB.originalColumn;
+		if (cmp !== 0) return cmp;
+		return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
+	function compareByGeneratedPositionsDeflatedNoLine(mappingA, mappingB, onlyCompareGenerated) {
+		var cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+		if (cmp !== 0 || onlyCompareGenerated) return cmp;
+		cmp = strcmp(mappingA.source, mappingB.source);
+		if (cmp !== 0) return cmp;
+		cmp = mappingA.originalLine - mappingB.originalLine;
+		if (cmp !== 0) return cmp;
+		cmp = mappingA.originalColumn - mappingB.originalColumn;
+		if (cmp !== 0) return cmp;
+		return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByGeneratedPositionsDeflatedNoLine = compareByGeneratedPositionsDeflatedNoLine;
+	function strcmp(aStr1, aStr2) {
+		if (aStr1 === aStr2) return 0;
+		if (aStr1 === null) return 1;
+		if (aStr2 === null) return -1;
+		if (aStr1 > aStr2) return 1;
+		return -1;
+	}
+	/**
+	* Comparator between two mappings with inflated source and name strings where
+	* the generated positions are compared.
+	*/
+	function compareByGeneratedPositionsInflated(mappingA, mappingB) {
+		var cmp = mappingA.generatedLine - mappingB.generatedLine;
+		if (cmp !== 0) return cmp;
+		cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+		if (cmp !== 0) return cmp;
+		cmp = strcmp(mappingA.source, mappingB.source);
+		if (cmp !== 0) return cmp;
+		cmp = mappingA.originalLine - mappingB.originalLine;
+		if (cmp !== 0) return cmp;
+		cmp = mappingA.originalColumn - mappingB.originalColumn;
+		if (cmp !== 0) return cmp;
+		return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;
+	/**
+	* Strip any JSON XSSI avoidance prefix from the string (as documented
+	* in the source maps specification), and then parse the string as
+	* JSON.
+	*/
+	function parseSourceMapInput(str) {
+		return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, ""));
+	}
+	exports.parseSourceMapInput = parseSourceMapInput;
+	/**
+	* Compute the URL of a source given the the source root, the source's
+	* URL, and the source map's URL.
+	*/
+	function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {
+		sourceURL = sourceURL || "";
+		if (sourceRoot) {
+			if (sourceRoot[sourceRoot.length - 1] !== "/" && sourceURL[0] !== "/") sourceRoot += "/";
+			sourceURL = sourceRoot + sourceURL;
+		}
+		if (sourceMapURL) {
+			var parsed = urlParse(sourceMapURL);
+			if (!parsed) throw new Error("sourceMapURL could not be parsed");
+			if (parsed.path) {
+				var index = parsed.path.lastIndexOf("/");
+				if (index >= 0) parsed.path = parsed.path.substring(0, index + 1);
+			}
+			sourceURL = join(urlGenerate(parsed), sourceURL);
+		}
+		return normalize(sourceURL);
+	}
+	exports.computeSourceURL = computeSourceURL;
+}));
+//#endregion
+//#region ../../node_modules/.pnpm/source-map-js@1.2.1_patch_hash=0354139cbc5dbd66e1bc59167ff8e42d3a9a2169038a35f1b7b1b4b843e08a6c/node_modules/source-map-js/lib/array-set.js
+var require_array_set = /* @__PURE__ */ __commonJSMin(((exports) => {
+	var util = require_util();
+	var has = Object.prototype.hasOwnProperty;
+	var hasNativeMap = typeof Map !== "undefined";
+	/**
+	* A data structure which is a combination of an array and a set. Adding a new
+	* member is O(1), testing for membership is O(1), and finding the index of an
+	* element is O(1). Removing elements from the set is not supported. Only
+	* strings are supported for membership.
+	*/
+	function ArraySet() {
+		this._array = [];
+		this._set = hasNativeMap ? /* @__PURE__ */ new Map() : Object.create(null);
+	}
+	/**
+	* Static method for creating ArraySet instances from an existing array.
+	*/
+	ArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {
+		var set = new ArraySet();
+		for (var i = 0, len = aArray.length; i < len; i++) set.add(aArray[i], aAllowDuplicates);
+		return set;
+	};
+	/**
+	* Return how many unique items are in this ArraySet. If duplicates have been
+	* added, than those do not count towards the size.
+	*
+	* @returns Number
+	*/
+	ArraySet.prototype.size = function ArraySet_size() {
+		return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;
+	};
+	/**
+	* Add the given string to this set.
+	*
+	* @param String aStr
+	*/
+	ArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {
+		var sStr = hasNativeMap ? aStr : util.toSetString(aStr);
+		var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);
+		var idx = this._array.length;
+		if (!isDuplicate || aAllowDuplicates) this._array.push(aStr);
+		if (!isDuplicate) if (hasNativeMap) this._set.set(aStr, idx);
+		else this._set[sStr] = idx;
+	};
+	/**
+	* Is the given string a member of this set?
+	*
+	* @param String aStr
+	*/
+	ArraySet.prototype.has = function ArraySet_has(aStr) {
+		if (hasNativeMap) return this._set.has(aStr);
+		else {
+			var sStr = util.toSetString(aStr);
+			return has.call(this._set, sStr);
+		}
+	};
+	/**
+	* What is the index of the given string in the array?
+	*
+	* @param String aStr
+	*/
+	ArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {
+		if (hasNativeMap) {
+			var idx = this._set.get(aStr);
+			if (idx >= 0) return idx;
+		} else {
+			var sStr = util.toSetString(aStr);
+			if (has.call(this._set, sStr)) return this._set[sStr];
+		}
+		throw new Error("\"" + aStr + "\" is not in the set.");
+	};
+	/**
+	* What is the element at the given index?
+	*
+	* @param Number aIdx
+	*/
+	ArraySet.prototype.at = function ArraySet_at(aIdx) {
+		if (aIdx >= 0 && aIdx < this._array.length) return this._array[aIdx];
+		throw new Error("No element indexed by " + aIdx);
+	};
+	/**
+	* Returns the array representation of this set (which has the proper indices
+	* indicated by indexOf). Note that this is a copy of the internal array used
+	* for storing the members so that no one can mess with internal state.
+	*/
+	ArraySet.prototype.toArray = function ArraySet_toArray() {
+		return this._array.slice();
+	};
+	exports.ArraySet = ArraySet;
+}));
+//#endregion
+//#region ../../node_modules/.pnpm/source-map-js@1.2.1_patch_hash=0354139cbc5dbd66e1bc59167ff8e42d3a9a2169038a35f1b7b1b4b843e08a6c/node_modules/source-map-js/lib/mapping-list.js
+var require_mapping_list = /* @__PURE__ */ __commonJSMin(((exports) => {
+	var util = require_util();
+	/**
+	* Determine whether mappingB is after mappingA with respect to generated
+	* position.
+	*/
+	function generatedPositionAfter(mappingA, mappingB) {
+		var lineA = mappingA.generatedLine;
+		var lineB = mappingB.generatedLine;
+		var columnA = mappingA.generatedColumn;
+		var columnB = mappingB.generatedColumn;
+		return lineB > lineA || lineB == lineA && columnB >= columnA || util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
+	}
+	/**
+	* A data structure to provide a sorted view of accumulated mappings in a
+	* performance conscious manner. It trades a neglibable overhead in general
+	* case for a large speedup in case of mappings being added in order.
+	*/
+	function MappingList() {
+		this._array = [];
+		this._sorted = true;
+		this._last = {
+			generatedLine: -1,
+			generatedColumn: 0
+		};
+	}
+	/**
+	* Iterate through internal items. This method takes the same arguments that
+	* `Array.prototype.forEach` takes.
+	*
+	* NOTE: The order of the mappings is NOT guaranteed.
+	*/
+	MappingList.prototype.unsortedForEach = function MappingList_forEach(aCallback, aThisArg) {
+		this._array.forEach(aCallback, aThisArg);
+	};
+	/**
+	* Add the given source mapping.
+	*
+	* @param Object aMapping
+	*/
+	MappingList.prototype.add = function MappingList_add(aMapping) {
+		if (generatedPositionAfter(this._last, aMapping)) {
+			this._last = aMapping;
+			this._array.push(aMapping);
+		} else {
+			this._sorted = false;
+			this._array.push(aMapping);
+		}
+	};
+	/**
+	* Returns the flat, sorted array of mappings. The mappings are sorted by
+	* generated position.
+	*
+	* WARNING: This method returns internal data without copying, for
+	* performance. The return value must NOT be mutated, and should be treated as
+	* an immutable borrow. If you want to take ownership, you must make your own
+	* copy.
+	*/
+	MappingList.prototype.toArray = function MappingList_toArray() {
+		if (!this._sorted) {
+			this._array.sort(util.compareByGeneratedPositionsInflated);
+			this._sorted = true;
+		}
+		return this._array;
+	};
+	exports.MappingList = MappingList;
+}));
+//#endregion
+//#region ../../node_modules/.pnpm/source-map-js@1.2.1_patch_hash=0354139cbc5dbd66e1bc59167ff8e42d3a9a2169038a35f1b7b1b4b843e08a6c/node_modules/source-map-js/lib/source-map-generator.js
+var require_source_map_generator = /* @__PURE__ */ __commonJSMin(((exports) => {
+	var base64VLQ = require_base64_vlq();
+	var util = require_util();
+	var ArraySet = require_array_set().ArraySet;
+	var MappingList = require_mapping_list().MappingList;
+	/**
+	* An instance of the SourceMapGenerator represents a source map which is
+	* being built incrementally. You may pass an object with the following
+	* properties:
+	*
+	*   - file: The filename of the generated source.
+	*   - sourceRoot: A root for all relative URLs in this source map.
+	*/
+	function SourceMapGenerator(aArgs) {
+		if (!aArgs) aArgs = {};
+		this._file = util.getArg(aArgs, "file", null);
+		this._sourceRoot = util.getArg(aArgs, "sourceRoot", null);
+		this._skipValidation = util.getArg(aArgs, "skipValidation", false);
+		this._ignoreInvalidMapping = util.getArg(aArgs, "ignoreInvalidMapping", false);
+		this._sources = new ArraySet();
+		this._names = new ArraySet();
+		this._mappings = new MappingList();
+		this._sourcesContents = null;
+	}
+	SourceMapGenerator.prototype._version = 3;
+	/**
+	* Creates a new SourceMapGenerator based on a SourceMapConsumer
+	*
+	* @param aSourceMapConsumer The SourceMap.
+	*/
+	SourceMapGenerator.fromSourceMap = function SourceMapGenerator_fromSourceMap(aSourceMapConsumer, generatorOps) {
+		var sourceRoot = aSourceMapConsumer.sourceRoot;
+		var generator = new SourceMapGenerator(Object.assign(generatorOps || {}, {
+			file: aSourceMapConsumer.file,
+			sourceRoot
+		}));
+		aSourceMapConsumer.eachMapping(function(mapping) {
+			var newMapping = { generated: {
+				line: mapping.generatedLine,
+				column: mapping.generatedColumn
+			} };
+			if (mapping.source != null) {
+				newMapping.source = mapping.source;
+				if (sourceRoot != null) newMapping.source = util.relative(sourceRoot, newMapping.source);
+				newMapping.original = {
+					line: mapping.originalLine,
+					column: mapping.originalColumn
+				};
+				if (mapping.name != null) newMapping.name = mapping.name;
+			}
+			generator.addMapping(newMapping);
+		});
+		aSourceMapConsumer.sources.forEach(function(sourceFile) {
+			var sourceRelative = sourceFile;
+			if (sourceRoot !== null) sourceRelative = util.relative(sourceRoot, sourceFile);
+			if (!generator._sources.has(sourceRelative)) generator._sources.add(sourceRelative);
+			var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+			if (content != null) generator.setSourceContent(sourceFile, content);
+		});
+		return generator;
+	};
+	/**
+	* Add a single mapping from original source line and column to the generated
+	* source's line and column for this source map being created. The mapping
+	* object should have the following properties:
+	*
+	*   - generated: An object with the generated line and column positions.
+	*   - original: An object with the original line and column positions.
+	*   - source: The original source file (relative to the sourceRoot).
+	*   - name: An optional original token name for this mapping.
+	*/
+	SourceMapGenerator.prototype.addMapping = function SourceMapGenerator_addMapping(aArgs) {
+		var generated = util.getArg(aArgs, "generated");
+		var original = util.getArg(aArgs, "original", null);
+		var source = util.getArg(aArgs, "source", null);
+		var name = util.getArg(aArgs, "name", null);
+		if (!this._skipValidation) {
+			if (this._validateMapping(generated, original, source, name) === false) return;
+		}
+		if (source != null) {
+			source = String(source);
+			if (!this._sources.has(source)) this._sources.add(source);
+		}
+		if (name != null) {
+			name = String(name);
+			if (!this._names.has(name)) this._names.add(name);
+		}
+		this._mappings.add({
+			generatedLine: generated.line,
+			generatedColumn: generated.column,
+			originalLine: original != null && original.line,
+			originalColumn: original != null && original.column,
+			source,
+			name
+		});
+	};
+	/**
+	* Set the source content for a source file.
+	*/
+	SourceMapGenerator.prototype.setSourceContent = function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {
+		var source = aSourceFile;
+		if (this._sourceRoot != null) source = util.relative(this._sourceRoot, source);
+		if (aSourceContent != null) {
+			if (!this._sourcesContents) this._sourcesContents = Object.create(null);
+			this._sourcesContents[util.toSetString(source)] = aSourceContent;
+		} else if (this._sourcesContents) {
+			delete this._sourcesContents[util.toSetString(source)];
+			if (Object.keys(this._sourcesContents).length === 0) this._sourcesContents = null;
+		}
+	};
+	/**
+	* Applies the mappings of a sub-source-map for a specific source file to the
+	* source map being generated. Each mapping to the supplied source file is
+	* rewritten using the supplied source map. Note: The resolution for the
+	* resulting mappings is the minimium of this map and the supplied map.
+	*
+	* @param aSourceMapConsumer The source map to be applied.
+	* @param aSourceFile Optional. The filename of the source file.
+	*        If omitted, SourceMapConsumer's file property will be used.
+	* @param aSourceMapPath Optional. The dirname of the path to the source map
+	*        to be applied. If relative, it is relative to the SourceMapConsumer.
+	*        This parameter is needed when the two source maps aren't in the same
+	*        directory, and the source map to be applied contains relative source
+	*        paths. If so, those relative source paths need to be rewritten
+	*        relative to the SourceMapGenerator.
+	*/
+	SourceMapGenerator.prototype.applySourceMap = function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
+		var sourceFile = aSourceFile;
+		if (aSourceFile == null) {
+			if (aSourceMapConsumer.file == null) throw new Error("SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, or the source map's \"file\" property. Both were omitted.");
+			sourceFile = aSourceMapConsumer.file;
+		}
+		var sourceRoot = this._sourceRoot;
+		if (sourceRoot != null) sourceFile = util.relative(sourceRoot, sourceFile);
+		var newSources = new ArraySet();
+		var newNames = new ArraySet();
+		this._mappings.unsortedForEach(function(mapping) {
+			if (mapping.source === sourceFile && mapping.originalLine != null) {
+				var original = aSourceMapConsumer.originalPositionFor({
+					line: mapping.originalLine,
+					column: mapping.originalColumn
+				});
+				if (original.source != null) {
+					mapping.source = original.source;
+					if (aSourceMapPath != null) mapping.source = util.join(aSourceMapPath, mapping.source);
+					if (sourceRoot != null) mapping.source = util.relative(sourceRoot, mapping.source);
+					mapping.originalLine = original.line;
+					mapping.originalColumn = original.column;
+					if (original.name != null) mapping.name = original.name;
+				}
+			}
+			var source = mapping.source;
+			if (source != null && !newSources.has(source)) newSources.add(source);
+			var name = mapping.name;
+			if (name != null && !newNames.has(name)) newNames.add(name);
+		}, this);
+		this._sources = newSources;
+		this._names = newNames;
+		aSourceMapConsumer.sources.forEach(function(sourceFile) {
+			var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+			if (content != null) {
+				if (aSourceMapPath != null) sourceFile = util.join(aSourceMapPath, sourceFile);
+				if (sourceRoot != null) sourceFile = util.relative(sourceRoot, sourceFile);
+				this.setSourceContent(sourceFile, content);
+			}
+		}, this);
+	};
+	/**
+	* A mapping can have one of the three levels of data:
+	*
+	*   1. Just the generated position.
+	*   2. The Generated position, original position, and original source.
+	*   3. Generated and original position, original source, as well as a name
+	*      token.
+	*
+	* To maintain consistency, we validate that any new mapping being added falls
+	* in to one of these categories.
+	*/
+	SourceMapGenerator.prototype._validateMapping = function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource, aName) {
+		if (aOriginal && typeof aOriginal.line !== "number" && typeof aOriginal.column !== "number") {
+			var message = "original.line and original.column are not numbers -- you probably meant to omit the original mapping entirely and only map the generated position. If so, pass null for the original mapping instead of an object with empty or null values.";
+			if (this._ignoreInvalidMapping) {
+				if (typeof console !== "undefined" && console.warn) console.warn(message);
+				return false;
+			} else throw new Error(message);
+		}
+		if (aGenerated && "line" in aGenerated && "column" in aGenerated && aGenerated.line > 0 && aGenerated.column >= 0 && !aOriginal && !aSource && !aName) return;
+		else if (aGenerated && "line" in aGenerated && "column" in aGenerated && aOriginal && "line" in aOriginal && "column" in aOriginal && aGenerated.line > 0 && aGenerated.column >= 0 && aOriginal.line > 0 && aOriginal.column >= 0 && aSource) return;
+		else {
+			var message = "Invalid mapping: " + JSON.stringify({
+				generated: aGenerated,
+				source: aSource,
+				original: aOriginal,
+				name: aName
+			});
+			if (this._ignoreInvalidMapping) {
+				if (typeof console !== "undefined" && console.warn) console.warn(message);
+				return false;
+			} else throw new Error(message);
+		}
+	};
+	/**
+	* Serialize the accumulated mappings in to the stream of base 64 VLQs
+	* specified by the source map format.
+	*/
+	SourceMapGenerator.prototype._serializeMappings = function SourceMapGenerator_serializeMappings() {
+		var previousGeneratedColumn = 0;
+		var previousGeneratedLine = 1;
+		var previousOriginalColumn = 0;
+		var previousOriginalLine = 0;
+		var previousName = 0;
+		var previousSource = 0;
+		var result = "";
+		var next;
+		var mapping;
+		var nameIdx;
+		var sourceIdx;
+		var mappings = this._mappings.toArray();
+		for (var i = 0, len = mappings.length; i < len; i++) {
+			mapping = mappings[i];
+			next = "";
+			if (mapping.generatedLine !== previousGeneratedLine) {
+				previousGeneratedColumn = 0;
+				while (mapping.generatedLine !== previousGeneratedLine) {
+					next += ";";
+					previousGeneratedLine++;
+				}
+			} else if (i > 0) {
+				if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) continue;
+				next += ",";
+			}
+			next += base64VLQ.encode(mapping.generatedColumn - previousGeneratedColumn);
+			previousGeneratedColumn = mapping.generatedColumn;
+			if (mapping.source != null) {
+				sourceIdx = this._sources.indexOf(mapping.source);
+				next += base64VLQ.encode(sourceIdx - previousSource);
+				previousSource = sourceIdx;
+				next += base64VLQ.encode(mapping.originalLine - 1 - previousOriginalLine);
+				previousOriginalLine = mapping.originalLine - 1;
+				next += base64VLQ.encode(mapping.originalColumn - previousOriginalColumn);
+				previousOriginalColumn = mapping.originalColumn;
+				if (mapping.name != null) {
+					nameIdx = this._names.indexOf(mapping.name);
+					next += base64VLQ.encode(nameIdx - previousName);
+					previousName = nameIdx;
+				}
+			}
+			result += next;
+		}
+		return result;
+	};
+	SourceMapGenerator.prototype._generateSourcesContent = function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {
+		return aSources.map(function(source) {
+			if (!this._sourcesContents) return null;
+			if (aSourceRoot != null) source = util.relative(aSourceRoot, source);
+			var key = util.toSetString(source);
+			return Object.prototype.hasOwnProperty.call(this._sourcesContents, key) ? this._sourcesContents[key] : null;
+		}, this);
+	};
+	/**
+	* Externalize the source map.
+	*/
+	SourceMapGenerator.prototype.toJSON = function SourceMapGenerator_toJSON() {
+		var map = {
+			version: this._version,
+			sources: this._sources.toArray(),
+			names: this._names.toArray(),
+			mappings: this._serializeMappings()
+		};
+		if (this._file != null) map.file = this._file;
+		if (this._sourceRoot != null) map.sourceRoot = this._sourceRoot;
+		if (this._sourcesContents) map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
+		return map;
+	};
+	/**
+	* Render the source map being generated to a string.
+	*/
+	SourceMapGenerator.prototype.toString = function SourceMapGenerator_toString() {
+		return JSON.stringify(this.toJSON());
+	};
+	exports.SourceMapGenerator = SourceMapGenerator;
+}));
+//#endregion
+//#region ../../node_modules/.pnpm/source-map-js@1.2.1_patch_hash=0354139cbc5dbd66e1bc59167ff8e42d3a9a2169038a35f1b7b1b4b843e08a6c/node_modules/source-map-js/lib/binary-search.js
+var require_binary_search = /* @__PURE__ */ __commonJSMin(((exports) => {
+	exports.GREATEST_LOWER_BOUND = 1;
+	exports.LEAST_UPPER_BOUND = 2;
+	/**
+	* Recursive implementation of binary search.
+	*
+	* @param aLow Indices here and lower do not contain the needle.
+	* @param aHigh Indices here and higher do not contain the needle.
+	* @param aNeedle The element being searched for.
+	* @param aHaystack The non-empty array being searched.
+	* @param aCompare Function which takes two elements and returns -1, 0, or 1.
+	* @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+	*     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+	*     closest element that is smaller than or greater than the one we are
+	*     searching for, respectively, if the exact element cannot be found.
+	*/
+	function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
+		var mid = Math.floor((aHigh - aLow) / 2) + aLow;
+		var cmp = aCompare(aNeedle, aHaystack[mid], true);
+		if (cmp === 0) return mid;
+		else if (cmp > 0) {
+			if (aHigh - mid > 1) return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);
+			if (aBias == exports.LEAST_UPPER_BOUND) return aHigh < aHaystack.length ? aHigh : -1;
+			else return mid;
+		} else {
+			if (mid - aLow > 1) return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);
+			if (aBias == exports.LEAST_UPPER_BOUND) return mid;
+			else return aLow < 0 ? -1 : aLow;
+		}
+	}
+	/**
+	* This is an implementation of binary search which will always try and return
+	* the index of the closest element if there is no exact hit. This is because
+	* mappings between original and generated line/col pairs are single points,
+	* and there is an implicit region between each of them, so a miss just means
+	* that you aren't on the very start of a region.
+	*
+	* @param aNeedle The element you are looking for.
+	* @param aHaystack The array that is being searched.
+	* @param aCompare A function which takes the needle and an element in the
+	*     array and returns -1, 0, or 1 depending on whether the needle is less
+	*     than, equal to, or greater than the element, respectively.
+	* @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+	*     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+	*     closest element that is smaller than or greater than the one we are
+	*     searching for, respectively, if the exact element cannot be found.
+	*     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+	*/
+	exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
+		if (aHaystack.length === 0) return -1;
+		var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack, aCompare, aBias || exports.GREATEST_LOWER_BOUND);
+		if (index < 0) return -1;
+		while (index - 1 >= 0) {
+			if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) break;
+			--index;
+		}
+		return index;
+	};
+}));
+//#endregion
+//#region ../../node_modules/.pnpm/source-map-js@1.2.1_patch_hash=0354139cbc5dbd66e1bc59167ff8e42d3a9a2169038a35f1b7b1b4b843e08a6c/node_modules/source-map-js/lib/quick-sort.js
+var require_quick_sort = /* @__PURE__ */ __commonJSMin(((exports) => {
+	function SortTemplate(comparator) {
+		/**
+		* Swap the elements indexed by `x` and `y` in the array `ary`.
+		*
+		* @param {Array} ary
+		*        The array.
+		* @param {Number} x
+		*        The index of the first item.
+		* @param {Number} y
+		*        The index of the second item.
+		*/
+		function swap(ary, x, y) {
+			var temp = ary[x];
+			ary[x] = ary[y];
+			ary[y] = temp;
+		}
+		/**
+		* Returns a random integer within the range `low .. high` inclusive.
+		*
+		* @param {Number} low
+		*        The lower bound on the range.
+		* @param {Number} high
+		*        The upper bound on the range.
+		*/
+		function randomIntInRange(low, high) {
+			return Math.round(low + Math.random() * (high - low));
+		}
+		/**
+		* The Quick Sort algorithm.
+		*
+		* @param {Array} ary
+		*        An array to sort.
+		* @param {function} comparator
+		*        Function to use to compare two items.
+		* @param {Number} p
+		*        Start index of the array
+		* @param {Number} r
+		*        End index of the array
+		*/
+		function doQuickSort(ary, comparator, p, r) {
+			if (p < r) {
+				var pivotIndex = randomIntInRange(p, r);
+				var i = p - 1;
+				swap(ary, pivotIndex, r);
+				var pivot = ary[r];
+				for (var j = p; j < r; j++) if (comparator(ary[j], pivot, false) <= 0) {
+					i += 1;
+					swap(ary, i, j);
+				}
+				swap(ary, i + 1, j);
+				var q = i + 1;
+				doQuickSort(ary, comparator, p, q - 1);
+				doQuickSort(ary, comparator, q + 1, r);
+			}
+		}
+		return doQuickSort;
+	}
+	function cloneSort(comparator) {
+		let templateFn = (...args) => SortTemplate(...args);
+		return templateFn(comparator);
+	}
+	/**
+	* Sort the given array in-place with the given comparator function.
+	*
+	* @param {Array} ary
+	*        An array to sort.
+	* @param {function} comparator
+	*        Function to use to compare two items.
+	*/
+	let sortCache = /* @__PURE__ */ new WeakMap();
+	exports.quickSort = function(ary, comparator, start = 0) {
+		let doQuickSort = sortCache.get(comparator);
+		if (doQuickSort === void 0) {
+			doQuickSort = cloneSort(comparator);
+			sortCache.set(comparator, doQuickSort);
+		}
+		doQuickSort(ary, comparator, start, ary.length - 1);
+	};
+}));
+//#endregion
+//#region ../../node_modules/.pnpm/source-map-js@1.2.1_patch_hash=0354139cbc5dbd66e1bc59167ff8e42d3a9a2169038a35f1b7b1b4b843e08a6c/node_modules/source-map-js/lib/source-map-consumer.js
+var require_source_map_consumer = /* @__PURE__ */ __commonJSMin(((exports) => {
+	var util = require_util();
+	var binarySearch = require_binary_search();
+	var ArraySet = require_array_set().ArraySet;
+	var base64VLQ = require_base64_vlq();
+	var quickSort = require_quick_sort().quickSort;
+	function SourceMapConsumer(aSourceMap, aSourceMapURL) {
+		var sourceMap = aSourceMap;
+		if (typeof aSourceMap === "string") sourceMap = util.parseSourceMapInput(aSourceMap);
+		return sourceMap.sections != null ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL) : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);
+	}
+	SourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {
+		return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);
+	};
+	/**
+	* The version of the source mapping spec that we are consuming.
+	*/
+	SourceMapConsumer.prototype._version = 3;
+	SourceMapConsumer.prototype.__generatedMappings = null;
+	Object.defineProperty(SourceMapConsumer.prototype, "_generatedMappings", {
+		configurable: true,
+		enumerable: true,
+		get: function() {
+			if (!this.__generatedMappings) this._parseMappings(this._mappings, this.sourceRoot);
+			return this.__generatedMappings;
+		}
+	});
+	SourceMapConsumer.prototype.__originalMappings = null;
+	Object.defineProperty(SourceMapConsumer.prototype, "_originalMappings", {
+		configurable: true,
+		enumerable: true,
+		get: function() {
+			if (!this.__originalMappings) this._parseMappings(this._mappings, this.sourceRoot);
+			return this.__originalMappings;
+		}
+	});
+	SourceMapConsumer.prototype._charIsMappingSeparator = function SourceMapConsumer_charIsMappingSeparator(aStr, index) {
+		var c = aStr.charAt(index);
+		return c === ";" || c === ",";
+	};
+	/**
+	* Parse the mappings in a string in to a data structure which we can easily
+	* query (the ordered arrays in the `this.__generatedMappings` and
+	* `this.__originalMappings` properties).
+	*/
+	SourceMapConsumer.prototype._parseMappings = function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+		throw new Error("Subclasses must implement _parseMappings");
+	};
+	SourceMapConsumer.GENERATED_ORDER = 1;
+	SourceMapConsumer.ORIGINAL_ORDER = 2;
+	SourceMapConsumer.GREATEST_LOWER_BOUND = 1;
+	SourceMapConsumer.LEAST_UPPER_BOUND = 2;
+	/**
+	* Iterate over each mapping between an original source/line/column and a
+	* generated line/column in this source map.
+	*
+	* @param Function aCallback
+	*        The function that is called with each mapping.
+	* @param Object aContext
+	*        Optional. If specified, this object will be the value of `this` every
+	*        time that `aCallback` is called.
+	* @param aOrder
+	*        Either `SourceMapConsumer.GENERATED_ORDER` or
+	*        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+	*        iterate over the mappings sorted by the generated file's line/column
+	*        order or the original's source/line/column order, respectively. Defaults to
+	*        `SourceMapConsumer.GENERATED_ORDER`.
+	*/
+	SourceMapConsumer.prototype.eachMapping = function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {
+		var context = aContext || null;
+		var order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+		var mappings;
+		switch (order) {
+			case SourceMapConsumer.GENERATED_ORDER:
+				mappings = this._generatedMappings;
+				break;
+			case SourceMapConsumer.ORIGINAL_ORDER:
+				mappings = this._originalMappings;
+				break;
+			default: throw new Error("Unknown order of iteration.");
+		}
+		var sourceRoot = this.sourceRoot;
+		var boundCallback = aCallback.bind(context);
+		var names = this._names;
+		var sources = this._sources;
+		var sourceMapURL = this._sourceMapURL;
+		for (var i = 0, n = mappings.length; i < n; i++) {
+			var mapping = mappings[i];
+			var source = mapping.source === null ? null : sources.at(mapping.source);
+			if (source !== null) source = util.computeSourceURL(sourceRoot, source, sourceMapURL);
+			boundCallback({
+				source,
+				generatedLine: mapping.generatedLine,
+				generatedColumn: mapping.generatedColumn,
+				originalLine: mapping.originalLine,
+				originalColumn: mapping.originalColumn,
+				name: mapping.name === null ? null : names.at(mapping.name)
+			});
+		}
+	};
+	/**
+	* Returns all generated line and column information for the original source,
+	* line, and column provided. If no column is provided, returns all mappings
+	* corresponding to a either the line we are searching for or the next
+	* closest line that has any mappings. Otherwise, returns all mappings
+	* corresponding to the given line and either the column we are searching for
+	* or the next closest column that has any offsets.
+	*
+	* The only argument is an object with the following properties:
+	*
+	*   - source: The filename of the original source.
+	*   - line: The line number in the original source.  The line number is 1-based.
+	*   - column: Optional. the column number in the original source.
+	*    The column number is 0-based.
+	*
+	* and an array of objects is returned, each with the following properties:
+	*
+	*   - line: The line number in the generated source, or null.  The
+	*    line number is 1-based.
+	*   - column: The column number in the generated source, or null.
+	*    The column number is 0-based.
+	*/
+	SourceMapConsumer.prototype.allGeneratedPositionsFor = function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {
+		var line = util.getArg(aArgs, "line");
+		var needle = {
+			source: util.getArg(aArgs, "source"),
+			originalLine: line,
+			originalColumn: util.getArg(aArgs, "column", 0)
+		};
+		needle.source = this._findSourceIndex(needle.source);
+		if (needle.source < 0) return [];
+		var mappings = [];
+		var index = this._findMapping(needle, this._originalMappings, "originalLine", "originalColumn", util.compareByOriginalPositions, binarySearch.LEAST_UPPER_BOUND);
+		if (index >= 0) {
+			var mapping = this._originalMappings[index];
+			if (aArgs.column === void 0) {
+				var originalLine = mapping.originalLine;
+				while (mapping && mapping.originalLine === originalLine) {
+					mappings.push({
+						line: util.getArg(mapping, "generatedLine", null),
+						column: util.getArg(mapping, "generatedColumn", null),
+						lastColumn: util.getArg(mapping, "lastGeneratedColumn", null)
+					});
+					mapping = this._originalMappings[++index];
+				}
+			} else {
+				var originalColumn = mapping.originalColumn;
+				while (mapping && mapping.originalLine === line && mapping.originalColumn == originalColumn) {
+					mappings.push({
+						line: util.getArg(mapping, "generatedLine", null),
+						column: util.getArg(mapping, "generatedColumn", null),
+						lastColumn: util.getArg(mapping, "lastGeneratedColumn", null)
+					});
+					mapping = this._originalMappings[++index];
+				}
+			}
+		}
+		return mappings;
+	};
+	exports.SourceMapConsumer = SourceMapConsumer;
+	/**
+	* A BasicSourceMapConsumer instance represents a parsed source map which we can
+	* query for information about the original file positions by giving it a file
+	* position in the generated source.
+	*
+	* The first parameter is the raw source map (either as a JSON string, or
+	* already parsed to an object). According to the spec, source maps have the
+	* following attributes:
+	*
+	*   - version: Which version of the source map spec this map is following.
+	*   - sources: An array of URLs to the original source files.
+	*   - names: An array of identifiers which can be referrenced by individual mappings.
+	*   - sourceRoot: Optional. The URL root from which all sources are relative.
+	*   - sourcesContent: Optional. An array of contents of the original source files.
+	*   - mappings: A string of base64 VLQs which contain the actual mappings.
+	*   - file: Optional. The generated file this source map is associated with.
+	*
+	* Here is an example source map, taken from the source map spec[0]:
+	*
+	*     {
+	*       version : 3,
+	*       file: "out.js",
+	*       sourceRoot : "",
+	*       sources: ["foo.js", "bar.js"],
+	*       names: ["src", "maps", "are", "fun"],
+	*       mappings: "AA,AB;;ABCDE;"
+	*     }
+	*
+	* The second parameter, if given, is a string whose value is the URL
+	* at which the source map was found.  This URL is used to compute the
+	* sources array.
+	*
+	* [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#
+	*/
+	function BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {
+		var sourceMap = aSourceMap;
+		if (typeof aSourceMap === "string") sourceMap = util.parseSourceMapInput(aSourceMap);
+		var version = util.getArg(sourceMap, "version");
+		var sources = util.getArg(sourceMap, "sources");
+		var names = util.getArg(sourceMap, "names", []);
+		var sourceRoot = util.getArg(sourceMap, "sourceRoot", null);
+		var sourcesContent = util.getArg(sourceMap, "sourcesContent", null);
+		var mappings = util.getArg(sourceMap, "mappings");
+		var file = util.getArg(sourceMap, "file", null);
+		if (version != this._version) throw new Error("Unsupported version: " + version);
+		if (sourceRoot) sourceRoot = util.normalize(sourceRoot);
+		sources = sources.map(String).map(util.normalize).map(function(source) {
+			return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source) ? util.relative(sourceRoot, source) : source;
+		});
+		this._names = ArraySet.fromArray(names.map(String), true);
+		this._sources = ArraySet.fromArray(sources, true);
+		this._absoluteSources = this._sources.toArray().map(function(s) {
+			return util.computeSourceURL(sourceRoot, s, aSourceMapURL);
+		});
+		this.sourceRoot = sourceRoot;
+		this.sourcesContent = sourcesContent;
+		this._mappings = mappings;
+		this._sourceMapURL = aSourceMapURL;
+		this.file = file;
+	}
+	BasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+	BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;
+	/**
+	* Utility function to find the index of a source.  Returns -1 if not
+	* found.
+	*/
+	BasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {
+		var relativeSource = aSource;
+		if (this.sourceRoot != null) relativeSource = util.relative(this.sourceRoot, relativeSource);
+		if (this._sources.has(relativeSource)) return this._sources.indexOf(relativeSource);
+		var i;
+		for (i = 0; i < this._absoluteSources.length; ++i) if (this._absoluteSources[i] == aSource) return i;
+		return -1;
+	};
+	/**
+	* Create a BasicSourceMapConsumer from a SourceMapGenerator.
+	*
+	* @param SourceMapGenerator aSourceMap
+	*        The source map that will be consumed.
+	* @param String aSourceMapURL
+	*        The URL at which the source map can be found (optional)
+	* @returns BasicSourceMapConsumer
+	*/
+	BasicSourceMapConsumer.fromSourceMap = function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {
+		var smc = Object.create(BasicSourceMapConsumer.prototype);
+		var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);
+		var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);
+		smc.sourceRoot = aSourceMap._sourceRoot;
+		smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(), smc.sourceRoot);
+		smc.file = aSourceMap._file;
+		smc._sourceMapURL = aSourceMapURL;
+		smc._absoluteSources = smc._sources.toArray().map(function(s) {
+			return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);
+		});
+		var generatedMappings = aSourceMap._mappings.toArray().slice();
+		var destGeneratedMappings = smc.__generatedMappings = [];
+		var destOriginalMappings = smc.__originalMappings = [];
+		for (var i = 0, length = generatedMappings.length; i < length; i++) {
+			var srcMapping = generatedMappings[i];
+			var destMapping = new Mapping();
+			destMapping.generatedLine = srcMapping.generatedLine;
+			destMapping.generatedColumn = srcMapping.generatedColumn;
+			if (srcMapping.source) {
+				destMapping.source = sources.indexOf(srcMapping.source);
+				destMapping.originalLine = srcMapping.originalLine;
+				destMapping.originalColumn = srcMapping.originalColumn;
+				if (srcMapping.name) destMapping.name = names.indexOf(srcMapping.name);
+				destOriginalMappings.push(destMapping);
+			}
+			destGeneratedMappings.push(destMapping);
+		}
+		quickSort(smc.__originalMappings, util.compareByOriginalPositions);
+		return smc;
+	};
+	/**
+	* The version of the source mapping spec that we are consuming.
+	*/
+	BasicSourceMapConsumer.prototype._version = 3;
+	/**
+	* The list of original sources.
+	*/
+	Object.defineProperty(BasicSourceMapConsumer.prototype, "sources", { get: function() {
+		return this._absoluteSources.slice();
+	} });
+	/**
+	* Provide the JIT with a nice shape / hidden class.
+	*/
+	function Mapping() {
+		this.generatedLine = 0;
+		this.generatedColumn = 0;
+		this.source = null;
+		this.originalLine = null;
+		this.originalColumn = null;
+		this.name = null;
+	}
+	/**
+	* Parse the mappings in a string in to a data structure which we can easily
+	* query (the ordered arrays in the `this.__generatedMappings` and
+	* `this.__originalMappings` properties).
+	*/
+	const compareGenerated = util.compareByGeneratedPositionsDeflatedNoLine;
+	function sortGenerated(array, start) {
+		let l = array.length;
+		let n = array.length - start;
+		if (n <= 1) return;
+		else if (n == 2) {
+			let a = array[start];
+			let b = array[start + 1];
+			if (compareGenerated(a, b) > 0) {
+				array[start] = b;
+				array[start + 1] = a;
+			}
+		} else if (n < 20) for (let i = start; i < l; i++) for (let j = i; j > start; j--) {
+			let a = array[j - 1];
+			let b = array[j];
+			if (compareGenerated(a, b) <= 0) break;
+			array[j - 1] = b;
+			array[j] = a;
+		}
+		else quickSort(array, compareGenerated, start);
+	}
+	BasicSourceMapConsumer.prototype._parseMappings = function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+		var generatedLine = 1;
+		var previousGeneratedColumn = 0;
+		var previousOriginalLine = 0;
+		var previousOriginalColumn = 0;
+		var previousSource = 0;
+		var previousName = 0;
+		var length = aStr.length;
+		var index = 0;
+		var temp = {};
+		var originalMappings = [];
+		var generatedMappings = [], mapping, segment, end, value;
+		let subarrayStart = 0;
+		while (index < length) if (aStr.charAt(index) === ";") {
+			generatedLine++;
+			index++;
+			previousGeneratedColumn = 0;
+			sortGenerated(generatedMappings, subarrayStart);
+			subarrayStart = generatedMappings.length;
+		} else if (aStr.charAt(index) === ",") index++;
+		else {
+			mapping = new Mapping();
+			mapping.generatedLine = generatedLine;
+			for (end = index; end < length; end++) if (this._charIsMappingSeparator(aStr, end)) break;
+			aStr.slice(index, end);
+			segment = [];
+			while (index < end) {
+				base64VLQ.decode(aStr, index, temp);
+				value = temp.value;
+				index = temp.rest;
+				segment.push(value);
+			}
+			if (segment.length === 2) throw new Error("Found a source, but no line and column");
+			if (segment.length === 3) throw new Error("Found a source and line, but no column");
+			mapping.generatedColumn = previousGeneratedColumn + segment[0];
+			previousGeneratedColumn = mapping.generatedColumn;
+			if (segment.length > 1) {
+				mapping.source = previousSource + segment[1];
+				previousSource += segment[1];
+				mapping.originalLine = previousOriginalLine + segment[2];
+				previousOriginalLine = mapping.originalLine;
+				mapping.originalLine += 1;
+				mapping.originalColumn = previousOriginalColumn + segment[3];
+				previousOriginalColumn = mapping.originalColumn;
+				if (segment.length > 4) {
+					mapping.name = previousName + segment[4];
+					previousName += segment[4];
+				}
+			}
+			generatedMappings.push(mapping);
+			if (typeof mapping.originalLine === "number") {
+				let currentSource = mapping.source;
+				while (originalMappings.length <= currentSource) originalMappings.push(null);
+				if (originalMappings[currentSource] === null) originalMappings[currentSource] = [];
+				originalMappings[currentSource].push(mapping);
+			}
+		}
+		sortGenerated(generatedMappings, subarrayStart);
+		this.__generatedMappings = generatedMappings;
+		for (var i = 0; i < originalMappings.length; i++) if (originalMappings[i] != null) quickSort(originalMappings[i], util.compareByOriginalPositionsNoSource);
+		this.__originalMappings = [].concat(...originalMappings);
+	};
+	/**
+	* Find the mapping that best matches the hypothetical "needle" mapping that
+	* we are searching for in the given "haystack" of mappings.
+	*/
+	BasicSourceMapConsumer.prototype._findMapping = function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName, aColumnName, aComparator, aBias) {
+		if (aNeedle[aLineName] <= 0) throw new TypeError("Line must be greater than or equal to 1, got " + aNeedle[aLineName]);
+		if (aNeedle[aColumnName] < 0) throw new TypeError("Column must be greater than or equal to 0, got " + aNeedle[aColumnName]);
+		return binarySearch.search(aNeedle, aMappings, aComparator, aBias);
+	};
+	/**
+	* Compute the last column for each generated mapping. The last column is
+	* inclusive.
+	*/
+	BasicSourceMapConsumer.prototype.computeColumnSpans = function SourceMapConsumer_computeColumnSpans() {
+		for (var index = 0; index < this._generatedMappings.length; ++index) {
+			var mapping = this._generatedMappings[index];
+			if (index + 1 < this._generatedMappings.length) {
+				var nextMapping = this._generatedMappings[index + 1];
+				if (mapping.generatedLine === nextMapping.generatedLine) {
+					mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;
+					continue;
+				}
+			}
+			mapping.lastGeneratedColumn = Infinity;
+		}
+	};
+	/**
+	* Returns the original source, line, and column information for the generated
+	* source's line and column positions provided. The only argument is an object
+	* with the following properties:
+	*
+	*   - line: The line number in the generated source.  The line number
+	*     is 1-based.
+	*   - column: The column number in the generated source.  The column
+	*     number is 0-based.
+	*   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+	*     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+	*     closest element that is smaller than or greater than the one we are
+	*     searching for, respectively, if the exact element cannot be found.
+	*     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+	*
+	* and an object is returned with the following properties:
+	*
+	*   - source: The original source file, or null.
+	*   - line: The line number in the original source, or null.  The
+	*     line number is 1-based.
+	*   - column: The column number in the original source, or null.  The
+	*     column number is 0-based.
+	*   - name: The original identifier, or null.
+	*/
+	BasicSourceMapConsumer.prototype.originalPositionFor = function SourceMapConsumer_originalPositionFor(aArgs) {
+		var needle = {
+			generatedLine: util.getArg(aArgs, "line"),
+			generatedColumn: util.getArg(aArgs, "column")
+		};
+		var index = this._findMapping(needle, this._generatedMappings, "generatedLine", "generatedColumn", util.compareByGeneratedPositionsDeflated, util.getArg(aArgs, "bias", SourceMapConsumer.GREATEST_LOWER_BOUND));
+		if (index >= 0) {
+			var mapping = this._generatedMappings[index];
+			if (mapping.generatedLine === needle.generatedLine) {
+				var source = util.getArg(mapping, "source", null);
+				if (source !== null) {
+					source = this._sources.at(source);
+					source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);
+				}
+				var name = util.getArg(mapping, "name", null);
+				if (name !== null) name = this._names.at(name);
+				return {
+					source,
+					line: util.getArg(mapping, "originalLine", null),
+					column: util.getArg(mapping, "originalColumn", null),
+					name
+				};
+			}
+		}
+		return {
+			source: null,
+			line: null,
+			column: null,
+			name: null
+		};
+	};
+	/**
+	* Return true if we have the source content for every source in the source
+	* map, false otherwise.
+	*/
+	BasicSourceMapConsumer.prototype.hasContentsOfAllSources = function BasicSourceMapConsumer_hasContentsOfAllSources() {
+		if (!this.sourcesContent) return false;
+		return this.sourcesContent.length >= this._sources.size() && !this.sourcesContent.some(function(sc) {
+			return sc == null;
+		});
+	};
+	/**
+	* Returns the original source content. The only argument is the url of the
+	* original source file. Returns null if no original source content is
+	* available.
+	*/
+	BasicSourceMapConsumer.prototype.sourceContentFor = function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+		if (!this.sourcesContent) return null;
+		var index = this._findSourceIndex(aSource);
+		if (index >= 0) return this.sourcesContent[index];
+		var relativeSource = aSource;
+		if (this.sourceRoot != null) relativeSource = util.relative(this.sourceRoot, relativeSource);
+		var url;
+		if (this.sourceRoot != null && (url = util.urlParse(this.sourceRoot))) {
+			var fileUriAbsPath = relativeSource.replace(/^file:\/\//, "");
+			if (url.scheme == "file" && this._sources.has(fileUriAbsPath)) return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)];
+			if ((!url.path || url.path == "/") && this._sources.has("/" + relativeSource)) return this.sourcesContent[this._sources.indexOf("/" + relativeSource)];
+		}
+		if (nullOnMissing) return null;
+		else throw new Error("\"" + relativeSource + "\" is not in the SourceMap.");
+	};
+	/**
+	* Returns the generated line and column information for the original source,
+	* line, and column positions provided. The only argument is an object with
+	* the following properties:
+	*
+	*   - source: The filename of the original source.
+	*   - line: The line number in the original source.  The line number
+	*     is 1-based.
+	*   - column: The column number in the original source.  The column
+	*     number is 0-based.
+	*   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+	*     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+	*     closest element that is smaller than or greater than the one we are
+	*     searching for, respectively, if the exact element cannot be found.
+	*     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+	*
+	* and an object is returned with the following properties:
+	*
+	*   - line: The line number in the generated source, or null.  The
+	*     line number is 1-based.
+	*   - column: The column number in the generated source, or null.
+	*     The column number is 0-based.
+	*/
+	BasicSourceMapConsumer.prototype.generatedPositionFor = function SourceMapConsumer_generatedPositionFor(aArgs) {
+		var source = util.getArg(aArgs, "source");
+		source = this._findSourceIndex(source);
+		if (source < 0) return {
+			line: null,
+			column: null,
+			lastColumn: null
+		};
+		var needle = {
+			source,
+			originalLine: util.getArg(aArgs, "line"),
+			originalColumn: util.getArg(aArgs, "column")
+		};
+		var index = this._findMapping(needle, this._originalMappings, "originalLine", "originalColumn", util.compareByOriginalPositions, util.getArg(aArgs, "bias", SourceMapConsumer.GREATEST_LOWER_BOUND));
+		if (index >= 0) {
+			var mapping = this._originalMappings[index];
+			if (mapping.source === needle.source) return {
+				line: util.getArg(mapping, "generatedLine", null),
+				column: util.getArg(mapping, "generatedColumn", null),
+				lastColumn: util.getArg(mapping, "lastGeneratedColumn", null)
+			};
+		}
+		return {
+			line: null,
+			column: null,
+			lastColumn: null
+		};
+	};
+	exports.BasicSourceMapConsumer = BasicSourceMapConsumer;
+	/**
+	* An IndexedSourceMapConsumer instance represents a parsed source map which
+	* we can query for information. It differs from BasicSourceMapConsumer in
+	* that it takes "indexed" source maps (i.e. ones with a "sections" field) as
+	* input.
+	*
+	* The first parameter is a raw source map (either as a JSON string, or already
+	* parsed to an object). According to the spec for indexed source maps, they
+	* have the following attributes:
+	*
+	*   - version: Which version of the source map spec this map is following.
+	*   - file: Optional. The generated file this source map is associated with.
+	*   - sections: A list of section definitions.
+	*
+	* Each value under the "sections" field has two fields:
+	*   - offset: The offset into the original specified at which this section
+	*       begins to apply, defined as an object with a "line" and "column"
+	*       field.
+	*   - map: A source map definition. This source map could also be indexed,
+	*       but doesn't have to be.
+	*
+	* Instead of the "map" field, it's also possible to have a "url" field
+	* specifying a URL to retrieve a source map from, but that's currently
+	* unsupported.
+	*
+	* Here's an example source map, taken from the source map spec[0], but
+	* modified to omit a section which uses the "url" field.
+	*
+	*  {
+	*    version : 3,
+	*    file: "app.js",
+	*    sections: [{
+	*      offset: {line:100, column:10},
+	*      map: {
+	*        version : 3,
+	*        file: "section.js",
+	*        sources: ["foo.js", "bar.js"],
+	*        names: ["src", "maps", "are", "fun"],
+	*        mappings: "AAAA,E;;ABCDE;"
+	*      }
+	*    }],
+	*  }
+	*
+	* The second parameter, if given, is a string whose value is the URL
+	* at which the source map was found.  This URL is used to compute the
+	* sources array.
+	*
+	* [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt
+	*/
+	function IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {
+		var sourceMap = aSourceMap;
+		if (typeof aSourceMap === "string") sourceMap = util.parseSourceMapInput(aSourceMap);
+		var version = util.getArg(sourceMap, "version");
+		var sections = util.getArg(sourceMap, "sections");
+		if (version != this._version) throw new Error("Unsupported version: " + version);
+		this._sources = new ArraySet();
+		this._names = new ArraySet();
+		var lastOffset = {
+			line: -1,
+			column: 0
+		};
+		this._sections = sections.map(function(s) {
+			if (s.url) throw new Error("Support for url field in sections not implemented.");
+			var offset = util.getArg(s, "offset");
+			var offsetLine = util.getArg(offset, "line");
+			var offsetColumn = util.getArg(offset, "column");
+			if (offsetLine < lastOffset.line || offsetLine === lastOffset.line && offsetColumn < lastOffset.column) throw new Error("Section offsets must be ordered and non-overlapping.");
+			lastOffset = offset;
+			return {
+				generatedOffset: {
+					generatedLine: offsetLine + 1,
+					generatedColumn: offsetColumn + 1
+				},
+				consumer: new SourceMapConsumer(util.getArg(s, "map"), aSourceMapURL)
+			};
+		});
+	}
+	IndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+	IndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;
+	/**
+	* The version of the source mapping spec that we are consuming.
+	*/
+	IndexedSourceMapConsumer.prototype._version = 3;
+	/**
+	* The list of original sources.
+	*/
+	Object.defineProperty(IndexedSourceMapConsumer.prototype, "sources", { get: function() {
+		var sources = [];
+		for (var i = 0; i < this._sections.length; i++) for (var j = 0; j < this._sections[i].consumer.sources.length; j++) sources.push(this._sections[i].consumer.sources[j]);
+		return sources;
+	} });
+	/**
+	* Returns the original source, line, and column information for the generated
+	* source's line and column positions provided. The only argument is an object
+	* with the following properties:
+	*
+	*   - line: The line number in the generated source.  The line number
+	*     is 1-based.
+	*   - column: The column number in the generated source.  The column
+	*     number is 0-based.
+	*
+	* and an object is returned with the following properties:
+	*
+	*   - source: The original source file, or null.
+	*   - line: The line number in the original source, or null.  The
+	*     line number is 1-based.
+	*   - column: The column number in the original source, or null.  The
+	*     column number is 0-based.
+	*   - name: The original identifier, or null.
+	*/
+	IndexedSourceMapConsumer.prototype.originalPositionFor = function IndexedSourceMapConsumer_originalPositionFor(aArgs) {
+		var needle = {
+			generatedLine: util.getArg(aArgs, "line"),
+			generatedColumn: util.getArg(aArgs, "column")
+		};
+		var sectionIndex = binarySearch.search(needle, this._sections, function(needle, section) {
+			var cmp = needle.generatedLine - section.generatedOffset.generatedLine;
+			if (cmp) return cmp;
+			return needle.generatedColumn - section.generatedOffset.generatedColumn;
+		});
+		var section = this._sections[sectionIndex];
+		if (!section) return {
+			source: null,
+			line: null,
+			column: null,
+			name: null
+		};
+		return section.consumer.originalPositionFor({
+			line: needle.generatedLine - (section.generatedOffset.generatedLine - 1),
+			column: needle.generatedColumn - (section.generatedOffset.generatedLine === needle.generatedLine ? section.generatedOffset.generatedColumn - 1 : 0),
+			bias: aArgs.bias
+		});
+	};
+	/**
+	* Return true if we have the source content for every source in the source
+	* map, false otherwise.
+	*/
+	IndexedSourceMapConsumer.prototype.hasContentsOfAllSources = function IndexedSourceMapConsumer_hasContentsOfAllSources() {
+		return this._sections.every(function(s) {
+			return s.consumer.hasContentsOfAllSources();
+		});
+	};
+	/**
+	* Returns the original source content. The only argument is the url of the
+	* original source file. Returns null if no original source content is
+	* available.
+	*/
+	IndexedSourceMapConsumer.prototype.sourceContentFor = function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+		for (var i = 0; i < this._sections.length; i++) {
+			var content = this._sections[i].consumer.sourceContentFor(aSource, true);
+			if (content || content === "") return content;
+		}
+		if (nullOnMissing) return null;
+		else throw new Error("\"" + aSource + "\" is not in the SourceMap.");
+	};
+	/**
+	* Returns the generated line and column information for the original source,
+	* line, and column positions provided. The only argument is an object with
+	* the following properties:
+	*
+	*   - source: The filename of the original source.
+	*   - line: The line number in the original source.  The line number
+	*     is 1-based.
+	*   - column: The column number in the original source.  The column
+	*     number is 0-based.
+	*
+	* and an object is returned with the following properties:
+	*
+	*   - line: The line number in the generated source, or null.  The
+	*     line number is 1-based. 
+	*   - column: The column number in the generated source, or null.
+	*     The column number is 0-based.
+	*/
+	IndexedSourceMapConsumer.prototype.generatedPositionFor = function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {
+		for (var i = 0; i < this._sections.length; i++) {
+			var section = this._sections[i];
+			if (section.consumer._findSourceIndex(util.getArg(aArgs, "source")) === -1) continue;
+			var generatedPosition = section.consumer.generatedPositionFor(aArgs);
+			if (generatedPosition) return {
+				line: generatedPosition.line + (section.generatedOffset.generatedLine - 1),
+				column: generatedPosition.column + (section.generatedOffset.generatedLine === generatedPosition.line ? section.generatedOffset.generatedColumn - 1 : 0)
+			};
+		}
+		return {
+			line: null,
+			column: null
+		};
+	};
+	/**
+	* Parse the mappings in a string in to a data structure which we can easily
+	* query (the ordered arrays in the `this.__generatedMappings` and
+	* `this.__originalMappings` properties).
+	*/
+	IndexedSourceMapConsumer.prototype._parseMappings = function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+		this.__generatedMappings = [];
+		this.__originalMappings = [];
+		for (var i = 0; i < this._sections.length; i++) {
+			var section = this._sections[i];
+			var sectionMappings = section.consumer._generatedMappings;
+			for (var j = 0; j < sectionMappings.length; j++) {
+				var mapping = sectionMappings[j];
+				var source = section.consumer._sources.at(mapping.source);
+				if (source !== null) source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);
+				this._sources.add(source);
+				source = this._sources.indexOf(source);
+				var name = null;
+				if (mapping.name) {
+					name = section.consumer._names.at(mapping.name);
+					this._names.add(name);
+					name = this._names.indexOf(name);
+				}
+				var adjustedMapping = {
+					source,
+					generatedLine: mapping.generatedLine + (section.generatedOffset.generatedLine - 1),
+					generatedColumn: mapping.generatedColumn + (section.generatedOffset.generatedLine === mapping.generatedLine ? section.generatedOffset.generatedColumn - 1 : 0),
+					originalLine: mapping.originalLine,
+					originalColumn: mapping.originalColumn,
+					name
+				};
+				this.__generatedMappings.push(adjustedMapping);
+				if (typeof adjustedMapping.originalLine === "number") this.__originalMappings.push(adjustedMapping);
+			}
+		}
+		quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);
+		quickSort(this.__originalMappings, util.compareByOriginalPositions);
+	};
+	exports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;
+}));
+//#endregion
+//#region ../../node_modules/.pnpm/source-map-js@1.2.1_patch_hash=0354139cbc5dbd66e1bc59167ff8e42d3a9a2169038a35f1b7b1b4b843e08a6c/node_modules/source-map-js/lib/source-node.js
+var require_source_node = /* @__PURE__ */ __commonJSMin(((exports) => {
+	var SourceMapGenerator = require_source_map_generator().SourceMapGenerator;
+	var util = require_util();
+	var REGEX_NEWLINE = /(\r?\n)/;
+	var NEWLINE_CODE = 10;
+	var isSourceNode = "$$$isSourceNode$$$";
+	/**
+	* SourceNodes provide a way to abstract over interpolating/concatenating
+	* snippets of generated JavaScript source code while maintaining the line and
+	* column information associated with the original source code.
+	*
+	* @param aLine The original line number.
+	* @param aColumn The original column number.
+	* @param aSource The original source's filename.
+	* @param aChunks Optional. An array of strings which are snippets of
+	*        generated JS, or other SourceNodes.
+	* @param aName The original identifier.
+	*/
+	function SourceNode(aLine, aColumn, aSource, aChunks, aName) {
+		this.children = [];
+		this.sourceContents = {};
+		this.line = aLine == null ? null : aLine;
+		this.column = aColumn == null ? null : aColumn;
+		this.source = aSource == null ? null : aSource;
+		this.name = aName == null ? null : aName;
+		this[isSourceNode] = true;
+		if (aChunks != null) this.add(aChunks);
+	}
+	/**
+	* Creates a SourceNode from generated code and a SourceMapConsumer.
+	*
+	* @param aGeneratedCode The generated code
+	* @param aSourceMapConsumer The SourceMap for the generated code
+	* @param aRelativePath Optional. The path that relative sources in the
+	*        SourceMapConsumer should be relative to.
+	*/
+	SourceNode.fromStringWithSourceMap = function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {
+		var node = new SourceNode();
+		var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);
+		var remainingLinesIndex = 0;
+		var shiftNextLine = function() {
+			return getNextLine() + (getNextLine() || "");
+			function getNextLine() {
+				return remainingLinesIndex < remainingLines.length ? remainingLines[remainingLinesIndex++] : void 0;
+			}
+		};
+		var lastGeneratedLine = 1, lastGeneratedColumn = 0;
+		var lastMapping = null;
+		aSourceMapConsumer.eachMapping(function(mapping) {
+			if (lastMapping !== null) if (lastGeneratedLine < mapping.generatedLine) {
+				addMappingWithCode(lastMapping, shiftNextLine());
+				lastGeneratedLine++;
+				lastGeneratedColumn = 0;
+			} else {
+				var nextLine = remainingLines[remainingLinesIndex] || "";
+				var code = nextLine.substr(0, mapping.generatedColumn - lastGeneratedColumn);
+				remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn - lastGeneratedColumn);
+				lastGeneratedColumn = mapping.generatedColumn;
+				addMappingWithCode(lastMapping, code);
+				lastMapping = mapping;
+				return;
+			}
+			while (lastGeneratedLine < mapping.generatedLine) {
+				node.add(shiftNextLine());
+				lastGeneratedLine++;
+			}
+			if (lastGeneratedColumn < mapping.generatedColumn) {
+				var nextLine = remainingLines[remainingLinesIndex] || "";
+				node.add(nextLine.substr(0, mapping.generatedColumn));
+				remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);
+				lastGeneratedColumn = mapping.generatedColumn;
+			}
+			lastMapping = mapping;
+		}, this);
+		if (remainingLinesIndex < remainingLines.length) {
+			if (lastMapping) addMappingWithCode(lastMapping, shiftNextLine());
+			node.add(remainingLines.splice(remainingLinesIndex).join(""));
+		}
+		aSourceMapConsumer.sources.forEach(function(sourceFile) {
+			var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+			if (content != null) {
+				if (aRelativePath != null) sourceFile = util.join(aRelativePath, sourceFile);
+				node.setSourceContent(sourceFile, content);
+			}
+		});
+		return node;
+		function addMappingWithCode(mapping, code) {
+			if (mapping === null || mapping.source === void 0) node.add(code);
+			else {
+				var source = aRelativePath ? util.join(aRelativePath, mapping.source) : mapping.source;
+				node.add(new SourceNode(mapping.originalLine, mapping.originalColumn, source, code, mapping.name));
+			}
+		}
+	};
+	/**
+	* Add a chunk of generated JS to this source node.
+	*
+	* @param aChunk A string snippet of generated JS code, another instance of
+	*        SourceNode, or an array where each member is one of those things.
+	*/
+	SourceNode.prototype.add = function SourceNode_add(aChunk) {
+		if (Array.isArray(aChunk)) aChunk.forEach(function(chunk) {
+			this.add(chunk);
+		}, this);
+		else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+			if (aChunk) this.children.push(aChunk);
+		} else throw new TypeError("Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk);
+		return this;
+	};
+	/**
+	* Add a chunk of generated JS to the beginning of this source node.
+	*
+	* @param aChunk A string snippet of generated JS code, another instance of
+	*        SourceNode, or an array where each member is one of those things.
+	*/
+	SourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {
+		if (Array.isArray(aChunk)) for (var i = aChunk.length - 1; i >= 0; i--) this.prepend(aChunk[i]);
+		else if (aChunk[isSourceNode] || typeof aChunk === "string") this.children.unshift(aChunk);
+		else throw new TypeError("Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk);
+		return this;
+	};
+	/**
+	* Walk over the tree of JS snippets in this node and its children. The
+	* walking function is called once for each snippet of JS and is passed that
+	* snippet and the its original associated source's line/column location.
+	*
+	* @param aFn The traversal function.
+	*/
+	SourceNode.prototype.walk = function SourceNode_walk(aFn) {
+		var chunk;
+		for (var i = 0, len = this.children.length; i < len; i++) {
+			chunk = this.children[i];
+			if (chunk[isSourceNode]) chunk.walk(aFn);
+			else if (chunk !== "") aFn(chunk, {
+				source: this.source,
+				line: this.line,
+				column: this.column,
+				name: this.name
+			});
+		}
+	};
+	/**
+	* Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
+	* each of `this.children`.
+	*
+	* @param aSep The separator.
+	*/
+	SourceNode.prototype.join = function SourceNode_join(aSep) {
+		var newChildren;
+		var i;
+		var len = this.children.length;
+		if (len > 0) {
+			newChildren = [];
+			for (i = 0; i < len - 1; i++) {
+				newChildren.push(this.children[i]);
+				newChildren.push(aSep);
+			}
+			newChildren.push(this.children[i]);
+			this.children = newChildren;
+		}
+		return this;
+	};
+	/**
+	* Call String.prototype.replace on the very right-most source snippet. Useful
+	* for trimming whitespace from the end of a source node, etc.
+	*
+	* @param aPattern The pattern to replace.
+	* @param aReplacement The thing to replace the pattern with.
+	*/
+	SourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {
+		var lastChild = this.children[this.children.length - 1];
+		if (lastChild[isSourceNode]) lastChild.replaceRight(aPattern, aReplacement);
+		else if (typeof lastChild === "string") this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);
+		else this.children.push("".replace(aPattern, aReplacement));
+		return this;
+	};
+	/**
+	* Set the source content for a source file. This will be added to the SourceMapGenerator
+	* in the sourcesContent field.
+	*
+	* @param aSourceFile The filename of the source file
+	* @param aSourceContent The content of the source file
+	*/
+	SourceNode.prototype.setSourceContent = function SourceNode_setSourceContent(aSourceFile, aSourceContent) {
+		this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;
+	};
+	/**
+	* Walk over the tree of SourceNodes. The walking function is called for each
+	* source file content and is passed the filename and source content.
+	*
+	* @param aFn The traversal function.
+	*/
+	SourceNode.prototype.walkSourceContents = function SourceNode_walkSourceContents(aFn) {
+		for (var i = 0, len = this.children.length; i < len; i++) if (this.children[i][isSourceNode]) this.children[i].walkSourceContents(aFn);
+		var sources = Object.keys(this.sourceContents);
+		for (var i = 0, len = sources.length; i < len; i++) aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);
+	};
+	/**
+	* Return the string representation of this source node. Walks over the tree
+	* and concatenates all the various snippets together to one string.
+	*/
+	SourceNode.prototype.toString = function SourceNode_toString() {
+		var str = "";
+		this.walk(function(chunk) {
+			str += chunk;
+		});
+		return str;
+	};
+	/**
+	* Returns the string representation of this source node along with a source
+	* map.
+	*/
+	SourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {
+		var generated = {
+			code: "",
+			line: 1,
+			column: 0
+		};
+		var map = new SourceMapGenerator(aArgs);
+		var sourceMappingActive = false;
+		var lastOriginalSource = null;
+		var lastOriginalLine = null;
+		var lastOriginalColumn = null;
+		var lastOriginalName = null;
+		this.walk(function(chunk, original) {
+			generated.code += chunk;
+			if (original.source !== null && original.line !== null && original.column !== null) {
+				if (lastOriginalSource !== original.source || lastOriginalLine !== original.line || lastOriginalColumn !== original.column || lastOriginalName !== original.name) map.addMapping({
+					source: original.source,
+					original: {
+						line: original.line,
+						column: original.column
+					},
+					generated: {
+						line: generated.line,
+						column: generated.column
+					},
+					name: original.name
+				});
+				lastOriginalSource = original.source;
+				lastOriginalLine = original.line;
+				lastOriginalColumn = original.column;
+				lastOriginalName = original.name;
+				sourceMappingActive = true;
+			} else if (sourceMappingActive) {
+				map.addMapping({ generated: {
+					line: generated.line,
+					column: generated.column
+				} });
+				lastOriginalSource = null;
+				sourceMappingActive = false;
+			}
+			for (var idx = 0, length = chunk.length; idx < length; idx++) if (chunk.charCodeAt(idx) === NEWLINE_CODE) {
+				generated.line++;
+				generated.column = 0;
+				if (idx + 1 === length) {
+					lastOriginalSource = null;
+					sourceMappingActive = false;
+				} else if (sourceMappingActive) map.addMapping({
+					source: original.source,
+					original: {
+						line: original.line,
+						column: original.column
+					},
+					generated: {
+						line: generated.line,
+						column: generated.column
+					},
+					name: original.name
+				});
+			} else generated.column++;
+		});
+		this.walkSourceContents(function(sourceFile, sourceContent) {
+			map.setSourceContent(sourceFile, sourceContent);
+		});
+		return {
+			code: generated.code,
+			map
+		};
+	};
+	exports.SourceNode = SourceNode;
+}));
+//#endregion
+//#region src/compiler/ast.ts
+var import_source_map = (/* @__PURE__ */ __commonJSMin(((exports) => {
+	exports.SourceMapGenerator = require_source_map_generator().SourceMapGenerator;
+	exports.SourceMapConsumer = require_source_map_consumer().SourceMapConsumer;
+	exports.SourceNode = require_source_node().SourceNode;
+})))();
+const TS_SMELL = /(^|[^:]):\s*(string|number|boolean|any|unknown|void)\b|\bas\s+(const\b|[A-Z])|\binterface\s+[A-Z]|^\s*type\s+[A-Z]|[a-zA-Z)\]]!\.|<(string|number|boolean)[,>]/m;
+function parseScript(code, opts) {
+	try {
+		return parse(code, {
+			ecmaVersion: "latest",
+			sourceType: "script",
+			locations: true,
+			allowReturnOutsideFunction: true,
+			allowAwaitOutsideFunction: true,
+			...opts,
+			onComment: opts === null || opts === void 0 ? void 0 : opts.comments
+		});
+	} catch (err) {
+		if (err instanceof SyntaxError && TS_SMELL.test(code)) err.message += ". The code must be plain JavaScript: do not use TypeScript syntax (type annotations, \"as\" casts, generics, interfaces or type aliases).";
+		throw err;
+	}
+}
+/**
+* Depth-first pre-order walk. `ancestors` is ordered outermost → innermost and
+* excludes `node` itself; `parent` is `ancestors[ancestors.length - 1]`.
+*/
+function walk(root, enter) {
+	const ancestors = [];
+	const visit = (node) => {
+		enter(node, ancestors[ancestors.length - 1] ?? null, ancestors);
+		ancestors.push(node);
+		for (const key of Object.keys(node)) {
+			if (key === "loc") continue;
+			const value = node[key];
+			if (Array.isArray(value)) {
+				for (const child of value) if (isNode(child)) visit(child);
+			} else if (isNode(value)) visit(value);
+		}
+		ancestors.pop();
+	};
+	visit(root);
+}
+const isNode = (value) => !!value && typeof value === "object" && typeof value.type === "string";
+const isStatementContainer = (node) => !!node && (node.type === "Program" || node.type === "BlockStatement" || node.type === "StaticBlock");
+/**
+* The statement that contains `node`: the outermost ancestor (or the node
+* itself) whose parent is a statement container.
+*/
+function enclosingStatement(node, ancestors) {
+	const chain = [...ancestors, node];
+	for (let i = chain.length - 1; i > 0; i--) if (isStatementContainer(chain[i - 1])) return chain[i];
+	return null;
+}
+/** The innermost node whose range contains [start, end] */
+function innermostContaining(ast, start, end) {
+	let best = null;
+	walk(ast, (node) => {
+		if (node.start <= start && node.end >= end) {
+			if (!best || node.start >= best.start && node.end <= best.end) best = node;
+		}
+	});
+	return best;
+}
+//#endregion
+//#region src/compiler/plugins/async-wrapper.ts
+const Open = "async function __fn__() {";
+const Close = "}";
+const USER_CODE_START_MARKER = "/* __LLMZ_USER_CODE_START__ */";
+const USER_CODE_END_MARKER = "/* __LLMZ_USER_CODE_END__ */";
+/**
+* Wraps user code in an async function so top-level `await` and `return` parse,
+* and so plugins can target the `__fn__` declaration. The wrapper is removed
+* after transformation — drivers re-wrap the bare statements themselves.
+*/
+const AsyncWrapper = {
+	preProcessing: (code) => {
+		return `"use strict";
+${Open}
+${USER_CODE_START_MARKER}
+${code}
+${USER_CODE_END_MARKER}
+${Close}
+`.trim();
+	},
+	postProcessing: (code) => {
+		code = code.slice(code.indexOf(Open) + 25);
+		code = code.slice(0, code.lastIndexOf(Close));
+		code = code.replace(USER_CODE_START_MARKER, "").replace(USER_CODE_END_MARKER, "");
+		return code.trimEnd();
+	}
+};
+//#endregion
+//#region src/compiler/plugins/line-tracking.ts
+const LineTrackingFnIdentifier = "__track__";
+const TRACKED_TYPES = /* @__PURE__ */ new Set([
+	"FunctionDeclaration",
+	"MethodDefinition",
+	"ReturnStatement",
+	"AwaitExpression",
+	"ForOfStatement",
+	"CallExpression",
+	"UnaryExpression",
+	"VariableDeclaration",
+	"AssignmentExpression"
+]);
+const SKIPPED_PARENT_TYPES = /* @__PURE__ */ new Set([
+	"ArrowFunctionExpression",
+	"Property",
+	"AwaitExpression",
+	"UnaryExpression",
+	"ReturnStatement",
+	"ForOfStatement",
+	"ForStatement",
+	"ForInStatement",
+	"VariableDeclaration",
+	"BinaryExpression",
+	"LogicalExpression"
+]);
+/**
+* Inserts a `__track__(<line>)` call before the statement containing each
+* tracked node — at most one per source line.
+*/
+function applyLineTracking(ctx) {
+	const trackedLines = /* @__PURE__ */ new Set();
+	walk(ctx.ast, (node, parent, ancestors) => {
+		if (!parent || !node.loc) return;
+		if (!TRACKED_TYPES.has(node.type) && parent.type !== "BlockStatement") return;
+		const line = node.loc.start.line;
+		if (trackedLines.has(line) || SKIPPED_PARENT_TYPES.has(parent.type)) return;
+		const statement = enclosingStatement(node, ancestors);
+		if (!statement) return;
+		trackedLines.add(line);
+		ctx.ms.appendLeft(statement.start, `${LineTrackingFnIdentifier}(${line});`);
+	});
+}
+//#endregion
+//#region src/compiler/plugins/replace-comment.ts
+const CommentFnIdentifier = "__comment__";
+const MARKER_TAGS = [USER_CODE_START_MARKER, USER_CODE_END_MARKER].map((m) => m.replace(/\/\*|\*\/|\s/g, ""));
+/** Blanks a range, keeping newlines so line numbers are preserved */
+const blank = (ctx, start, end) => {
+	ctx.ms.update(start, end, ctx.code.slice(start, end).replace(/[^\n]/g, " "));
+};
+/**
+* Replaces comments at statement position with `__comment__("<text>", <line>)`
+* calls so the agent's inline "thinking" comments show up as traces at runtime.
+* Comments inside expressions and the user-code markers are blanked; comments
+* inside instrumented tool-call ranges are left verbatim.
+*/
+function applyCommentReplacement(ctx, skipRanges) {
+	for (const comment of ctx.comments) {
+		const text = comment.value.trim();
+		if (MARKER_TAGS.some((tag) => text.includes(tag))) {
+			blank(ctx, comment.start, comment.end);
+			continue;
+		}
+		if (skipRanges.some(([start, end]) => comment.start >= start && comment.end <= end)) continue;
+		const container = innermostContaining(ctx.ast, comment.start, comment.end);
+		if (isStatementContainer(container)) {
+			const newlines = ctx.code.slice(comment.start, comment.end).replace(/[^\n]/g, "");
+			ctx.ms.update(comment.start, comment.end, `;${CommentFnIdentifier}(${JSON.stringify(text)}, ${comment.loc.start.line});${newlines}`);
+		} else blank(ctx, comment.start, comment.end);
+	}
+}
+//#endregion
+//#region src/compiler/plugins/return-async.ts
+/**
+* Plans the instrumentation of the last statement of the `__fn__` wrapper so
+* the generated code always returns an awaited value (the isolated VM cannot
+* return a pending Promise):
+* - `return expr` → `return await (expr)`
+* - a trailing `call()` / `await call()` statement → `return await (…)`
+*
+* The prefix must be applied before, and the suffix after, all other edits so
+* they wrap around the tool-call instrumentation.
+*/
+function planLastLineInstrumentation(ast) {
+	const fn = ast.body.find((node) => {
+		var _id;
+		return node.type === "FunctionDeclaration" && ((_id = node.id) === null || _id === void 0 ? void 0 : _id.name) === "__fn__";
+	});
+	if (!fn) return null;
+	const statements = fn.body.body;
+	const last = statements[statements.length - 1];
+	if (!last) return null;
+	if (last.type === "ReturnStatement") {
+		if (!last.argument) return null;
+		return {
+			prefixPos: last.argument.start,
+			prefix: "await (",
+			suffixPos: last.argument.end,
+			suffix: ")"
+		};
+	}
+	if (last.type === "ExpressionStatement" && (last.expression.type === "CallExpression" || last.expression.type === "AwaitExpression")) return {
+		prefixPos: last.expression.start,
+		prefix: "return await (",
+		suffixPos: last.expression.end,
+		suffix: ")"
+	};
+	return null;
+}
+//#endregion
+//#region src/compiler/plugins/track-tool-calls.ts
+const ToolCallTrackerFnIdentifier = "__toolc__";
+const ToolTrackerRetIdentifier = "__ret__";
+/**
+* Wraps every outermost call expression in an IIFE that reports
+* `__toolc__(<id>, "start" | "end", …)` events around the call:
+*
+*     const x = (() => {
+*       try {
+*         __toolc__(0, "start");
+*         const __ret__ = tool();
+*         __toolc__(0, "end", __ret__);
+*         return __ret__;
+*       } catch (err) { __toolc__(1, "end", err); throw new Error(err.message); }
+*     })()
+*
+* Calls assigned to a variable are registered in `calls` (keyed by the id used
+* in the catch clause — the id the runtime sees when a tool throws a
+* SnapshotSignal). Awaited calls get an async IIFE that awaits the call.
+*
+* Returns the wrapped source ranges so later passes can avoid editing inside.
+*/
+function applyToolCallTracking(ctx, calls) {
+	let callId = 0;
+	const wrappedRanges = [];
+	const src = ctx.code;
+	const sliceOf = (node) => src.slice(node.start, node.end);
+	const extractAssignment = (lval) => {
+		const source = sliceOf(lval);
+		if (lval.type === "Identifier") return {
+			type: "single",
+			left: source,
+			evalFn: `let ${source} = arguments[0]; return { ${source} };`
+		};
+		if (lval.type === "ArrayPattern") {
+			const elements = lval.elements.map((el) => el ? sliceOf(el) : "").join(", ");
+			return {
+				type: "array",
+				left: elements,
+				evalFn: `let [${elements}] = arguments[0] ?? []; return { ${elements} };`
+			};
+		}
+		if (lval.type === "ObjectPattern") return {
+			type: "object",
+			left: source,
+			evalFn: `let ${source} = arguments[0] ?? {}; return ${source};`
+		};
+		return {
+			type: "unsupported",
+			left: "",
+			evalFn: ""
+		};
+	};
+	walk(ctx.ast, (node, parent, ancestors) => {
+		if (node.type !== "CallExpression") return;
+		if (wrappedRanges.some(([start, end]) => node.start >= start && node.end <= end)) return;
+		if ((parent === null || parent === void 0 ? void 0 : parent.type) === "YieldExpression") return;
+		const declaration = [...ancestors].reverse().find((n) => n.type === "VariableDeclaration");
+		const assignment = [...ancestors].reverse().find((n) => n.type === "AssignmentExpression");
+		let lval = null;
+		if (declaration) {
+			var _;
+			lval = ((_ = declaration.declarations[0]) === null || _ === void 0 ? void 0 : _.id) ?? null;
+		}
+		if (assignment) lval = assignment.left;
+		const isAsync = (parent === null || parent === void 0 ? void 0 : parent.type) === "AwaitExpression";
+		const start = (id) => `${ToolCallTrackerFnIdentifier}(${id}, "start");`;
+		const end = (id, value) => `${ToolCallTrackerFnIdentifier}(${id}, "end", ${value});`;
+		const prefix = (id) => `(${isAsync ? "async " : ""}() => {try {${start(id)}const ${ToolTrackerRetIdentifier} = ${isAsync ? "await " : ""}`;
+		const successSuffix = (id) => `;${end(id, ToolTrackerRetIdentifier)}return ${ToolTrackerRetIdentifier};}`;
+		if (!lval) {
+			if (!sliceOf(node).trim().length) return;
+			const catchClause = ` catch (err) {${end(callId, "err")}const __newError = new Error(err.message);__newError.stack = err.stack + ("\\n" + __newError.stack);throw __newError;}})()`;
+			ctx.ms.appendLeft(node.start, prefix(callId));
+			ctx.ms.appendRight(node.end, successSuffix(callId) + catchClause);
+			wrappedRanges.push([node.start, node.end]);
+			callId++;
+			return;
+		}
+		const assign = extractAssignment(lval);
+		if (assign.type === "unsupported") return;
+		const tryId = callId;
+		callId++;
+		const callee = node.callee;
+		let object = "global";
+		let tool = callee.type === "Identifier" ? callee.name : sliceOf(callee);
+		if (callee.type === "MemberExpression") {
+			object = sliceOf(callee.object);
+			const property = callee.property;
+			tool = property.type === "Identifier" ? property.name : property.type === "Literal" ? String(property.value) : sliceOf(property);
+		}
+		const catchClause = ` catch (err) {${end(callId, "err")}throw new Error(err.message);}})()`;
+		ctx.ms.appendLeft(node.start, prefix(tryId));
+		ctx.ms.appendRight(node.end, successSuffix(tryId) + catchClause);
+		wrappedRanges.push([node.start, node.end]);
+		calls.set(callId, {
+			object,
+			tool,
+			assignment: assign
+		});
+	});
+	return wrappedRanges;
+}
+//#endregion
+//#region src/compiler/plugins/variable-extraction.ts
+const VariableTrackingFnIdentifier = "__var__";
+/**
+* Tracks user variables so the VM can read their values between iterations:
+* - after each variable declaration: `__var__("a", () => eval("a"));`
+* - at the top of function bodies, for their parameters
+*
+* The `eval` indirection captures the variable lazily in its own scope.
+*/
+function applyVariableTracking(ctx, variables) {
+	const trackerFor = (name) => {
+		if (name.startsWith("__")) return null;
+		variables.add(name);
+		return `${VariableTrackingFnIdentifier}(${JSON.stringify(name)}, () => eval(${JSON.stringify(name)}));`;
+	};
+	const track = (names) => names.map(trackerFor).filter((t) => !!t).join("");
+	const declaredNames = (id) => {
+		if (id.type === "Identifier") return [id.name];
+		if (id.type === "ObjectPattern") {
+			const names = [];
+			for (const prop of id.properties) {
+				if (prop.type !== "Property") continue;
+				if (prop.value.type === "Identifier") names.push(prop.value.name);
+				else if (prop.value.type === "ObjectPattern") names.push(...declaredNames(prop.value));
+				else if (prop.value.type === "AssignmentPattern" && prop.value.left.type === "Identifier") names.push(prop.value.left.name);
+			}
+			return names;
+		}
+		if (id.type === "ArrayPattern") {
+			const names = [];
+			for (const element of id.elements) {
+				if (!element) continue;
+				if (element.type === "Identifier") names.push(element.name);
+				else if (element.type === "RestElement" && element.argument.type === "Identifier") names.push(element.argument.name);
+				else if (element.type === "AssignmentPattern" && element.left.type === "Identifier") names.push(element.left.name);
+			}
+			return names;
+		}
+		return [];
+	};
+	const paramNames = (params) => {
+		const names = [];
+		for (const param of params) if (param.type === "Identifier") names.push(param.name);
+		else if (param.type === "AssignmentPattern" && param.left.type === "Identifier") names.push(param.left.name);
+		else if (param.type === "ObjectPattern") {
+			for (const prop of param.properties) if (prop.type === "Property" && prop.value.type === "Identifier") names.push(prop.value.name);
+		} else if (param.type === "ArrayPattern") {
+			for (const element of param.elements) if ((element === null || element === void 0 ? void 0 : element.type) === "Identifier") names.push(element.name);
+		}
+		return names;
+	};
+	walk(ctx.ast, (node, parent) => {
+		if (node.type === "VariableDeclaration") {
+			if (parent && (parent.type === "ForStatement" || parent.type === "ForInStatement" || parent.type === "ForOfStatement")) return;
+			const trackers = track(node.declarations.flatMap((d) => declaredNames(d.id)));
+			if (trackers) {
+				const semi = ctx.code[node.end - 1] === ";" ? "" : ";";
+				ctx.ms.appendRight(node.end, `${semi}${trackers}`);
+			}
+			return;
+		}
+		if (node.type === "FunctionDeclaration" || node.type === "ArrowFunctionExpression") {
+			const trackers = track(paramNames(node.params));
+			if (!trackers) return;
+			const body = node.body;
+			if (body.type === "BlockStatement") ctx.ms.appendRight(body.start + 1, trackers);
+			else {
+				ctx.ms.appendLeft(body.start, `{${trackers}return (`);
+				ctx.ms.appendRight(body.end, ");}");
+			}
+		}
+	});
+}
+//#endregion
+//#region src/compiler/compiler.ts
+const Identifiers = {
+	ConsoleObjIdentifier: "console",
+	LineTrackingFnIdentifier,
+	VariableTrackingFnIdentifier,
+	ToolCallTrackerFnIdentifier,
+	ToolTrackerRetIdentifier,
+	CommentFnIdentifier
+};
+const FUNCTION_TYPES = /* @__PURE__ */ new Set([
+	"FunctionDeclaration",
+	"FunctionExpression",
+	"ArrowFunctionExpression"
+]);
+/**
+* Whether the code contains a top-level `return` statement (one that would
+* return from the generated code itself, not from a nested function). Unlike a
+* regex, this ignores `return` inside comments, strings and nested functions.
+* Falls back to a word-boundary match if the code cannot be parsed.
+*/
+function hasTopLevelReturn(code) {
+	try {
+		const ast = parseScript(code);
+		let found = false;
+		walk(ast, (node, _parent, ancestors) => {
+			if (node.type === "ReturnStatement" && !ancestors.some((a) => FUNCTION_TYPES.has(a.type))) found = true;
+		});
+		return found;
+	} catch {
+		return /\breturn\b/.test(code);
+	}
+}
+/**
+* Compiles the agent's generated JavaScript for VM execution:
+*
+* 1. wraps it in an async `__fn__` so top-level `await`/`return` parse
+* 2. instruments it in a single parse + text-edit pass:
+*    line tracking, last-line return, tool-call tracking, comment tracing
+*    and variable tracking
+* 3. unwraps it — the VM drivers re-wrap the bare statements themselves
+*
+* All edits preserve line numbers 1:1 with the wrapped source, so positions
+* reported at runtime map straight back to the user code.
+*/
+function compile(code) {
+	const wrapped = AsyncWrapper.preProcessing(code);
+	const comments = [];
+	const ast = parseScript(wrapped, { comments });
+	const variables = /* @__PURE__ */ new Set();
+	const toolCalls = /* @__PURE__ */ new Map();
+	const lastLine = planLastLineInstrumentation(ast);
+	const msMarkers = new MagicString(wrapped);
+	if (lastLine) {
+		msMarkers.appendLeft(lastLine.prefixPos, lastLine.prefix);
+		msMarkers.appendRight(lastLine.suffixPos, lastLine.suffix);
+	}
+	const codeWithMarkers = msMarkers.toString();
+	const ms = new MagicString(wrapped);
+	const ctx = {
+		code: wrapped,
+		ms,
+		ast,
+		comments
+	};
+	applyLineTracking(ctx);
+	if (lastLine) ms.appendLeft(lastLine.prefixPos, lastLine.prefix);
+	applyCommentReplacement(ctx, applyToolCallTracking(ctx, toolCalls));
+	applyVariableTracking(ctx, variables);
+	if (lastLine) ms.appendRight(lastLine.suffixPos, lastLine.suffix);
+	return {
+		code: AsyncWrapper.postProcessing(ms.toString()),
+		codeWithMarkers,
+		map: ms.generateMap({
+			hires: true,
+			source: "<anonymous>"
+		}),
+		variables,
+		toolCalls
+	};
+}
+//#endregion
+//#region src/vm/errors.ts
+const handleErrorQuickJS = (err, code, _consumer, traces, variables, lines_executed, userCodeStartLine, currentToolCall) => {
+	err = Signals.maybeDeserializeError(err);
+	const lines = code.split("\n");
+	const stackTrace = err.stack || "";
+	const LINE_OFFSET = 1;
+	const regex = /<quickjs>:(\d+)/g;
+	const QUICKJS_WRAPPER_OFFSET = 9;
+	const matches = Array.from(stackTrace.matchAll(regex)).map((x) => {
+		const transformedCodeLine = Number(x[1]) - QUICKJS_WRAPPER_OFFSET;
+		const line = Math.max(1, transformedCodeLine - userCodeStartLine + 1);
+		const actualLine = lines[line - LINE_OFFSET] ?? "";
+		return {
+			line,
+			column: actualLine.length - actualLine.trimStart().length
+		};
+	});
+	if (matches.length === 0 && lines_executed.size > 0) {
+		const lastLine = Math.max(...Array.from(lines_executed.keys()));
+		const actualLine = lines[lastLine - LINE_OFFSET] ?? "";
+		const whiteSpacesCount = actualLine.length - actualLine.trimStart().length;
+		matches.push({
+			line: lastLine,
+			column: whiteSpacesCount
+		});
+	}
+	return formatError(err, lines, matches, traces, variables, lines_executed, currentToolCall, code);
+};
+const handleErrorNode = (err, code, consumer, traces, variables, _lines_executed, currentToolCall) => {
+	err = Signals.maybeDeserializeError(err);
+	const lines = code.split("\n");
+	const stackTrace = err.stack || "";
+	const LINE_OFFSET = 1;
+	const regex = /<anonymous>:(\d+):(\d+)/g;
+	const RUNTIME_TO_MAP_OFFSET = -1;
+	const WRAPPED_HEADER_LINES = 3;
+	const matches = [...stackTrace.matchAll(regex)].map((x) => {
+		const mapLine = Number(x[1]) + RUNTIME_TO_MAP_OFFSET;
+		const originalLine = consumer.originalPositionFor({
+			line: mapLine,
+			column: Number(x[2])
+		});
+		const line = (originalLine.line ?? mapLine) - WRAPPED_HEADER_LINES;
+		const actualLine = lines[line - LINE_OFFSET] ?? "";
+		const whiteSpacesCount = actualLine.length - actualLine.trimStart().length;
+		const minColumn = Math.max(whiteSpacesCount, originalLine.column);
+		return {
+			line,
+			column: Math.min(minColumn, Number(x[2]))
+		};
+	});
+	const { debugUserCode, truncatedCode } = buildDebugCode(lines, matches);
+	if (err instanceof VMSignal) {
+		err.stack = debugUserCode;
+		err.truncatedCode = truncatedCode;
+		err.variables = mapValues(variables, (getter) => isFunction(getter) ? getter() : getter);
+		err.toolCall = currentToolCall;
+		throw err;
+	} else {
+		var _matches$, _matches$2;
+		traces.push({
+			type: "code_execution_exception",
+			position: [((_matches$ = matches[0]) === null || _matches$ === void 0 ? void 0 : _matches$.line) ?? 0, ((_matches$2 = matches[0]) === null || _matches$2 === void 0 ? void 0 : _matches$2.column) ?? 0],
+			message: err.message,
+			stackTrace: debugUserCode,
+			started_at: Date.now()
+		});
+		throw new CodeExecutionError(err.message, code, debugUserCode);
+	}
+};
+const handleCatch = (err, traces, variables, lines_executed) => {
+	err = Signals.maybeDeserializeError(err);
+	return {
+		success: err instanceof VMSignal ? true : false,
+		variables: mapValues(variables, (getter) => isFunction(getter) ? getter() : getter),
+		error: err,
+		signal: err instanceof VMSignal ? err : void 0,
+		traces,
+		lines_executed: Array.from(lines_executed)
+	};
+};
+function buildDebugCode(lines, matches) {
+	var _maxBy;
+	const LINE_OFFSET = 1;
+	const lastLine = ((_maxBy = maxBy(matches, (x) => x.line ?? 0)) === null || _maxBy === void 0 ? void 0 : _maxBy.line) ?? 0;
+	let debugUserCode = "";
+	let truncatedCode = "";
+	let truncated = false;
+	const appendCode = (line) => {
+		debugUserCode += line;
+		if (!truncated) truncatedCode += line;
+	};
+	for (let i = 0; i < lines.length; i++) {
+		const VM_OFFSET = 2;
+		const DISPLAY_OFFSET = 0;
+		const line = lines[i];
+		const correctedStackLineIndex = i + LINE_OFFSET + VM_OFFSET;
+		const match = matches.find((x) => x.line + VM_OFFSET === correctedStackLineIndex);
+		const paddedLineNumber = String(correctedStackLineIndex - VM_OFFSET - DISPLAY_OFFSET).padStart(3, "0");
+		if (match) {
+			appendCode(`> ${paddedLineNumber} | ${line}\n`);
+			appendCode(`    ${" ".repeat(paddedLineNumber.length + match.column)}^^^^^^^^^^\n`);
+			if (match.line >= lastLine) truncated = true;
+		} else appendCode(`  ${paddedLineNumber} | ${line}\n`);
+	}
+	return {
+		debugUserCode: cleanStackTrace(debugUserCode).trim(),
+		truncatedCode: cleanStackTrace(truncatedCode).trim()
+	};
+}
+function formatError(err, lines, matches, traces, variables, lines_executed, currentToolCall, code) {
+	const { debugUserCode, truncatedCode } = buildDebugCode(lines, matches);
+	if (err instanceof VMSignal) {
+		const signalError = err;
+		signalError.stack = debugUserCode;
+		signalError.truncatedCode = truncatedCode;
+		signalError.variables = mapValues(variables, (getter) => isFunction(getter) ? getter() : getter);
+		signalError.toolCall = currentToolCall;
+		return {
+			success: true,
+			variables: mapValues(variables, (getter) => isFunction(getter) ? getter() : getter),
+			signal: err,
+			lines_executed: Array.from(lines_executed)
+		};
+	} else {
+		var _matches$3, _matches$4;
+		traces.push({
+			type: "code_execution_exception",
+			position: [((_matches$3 = matches[0]) === null || _matches$3 === void 0 ? void 0 : _matches$3.line) ?? 0, ((_matches$4 = matches[0]) === null || _matches$4 === void 0 ? void 0 : _matches$4.column) ?? 0],
+			message: err.message,
+			stackTrace: debugUserCode,
+			started_at: Date.now()
+		});
+		const codeError = new CodeExecutionError(err.message, code, debugUserCode);
+		const deserializedError = Signals.maybeDeserializeError(codeError);
+		return {
+			success: false,
+			variables: mapValues(variables, (getter) => isFunction(getter) ? getter() : getter),
+			error: deserializedError,
+			traces,
+			lines_executed: Array.from(lines_executed)
+		};
+	}
+}
+//#endregion
+//#region src/vm/instrument.ts
+const USER_CODE_MARKER_TAG_START = "__LLMZ_USER_CODE_START__";
+const USER_CODE_MARKER_TAG_END = "__LLMZ_USER_CODE_END__";
+const NO_TRACKING = [
+	Identifiers.CommentFnIdentifier,
+	Identifiers.ToolCallTrackerFnIdentifier,
+	Identifiers.ToolTrackerRetIdentifier,
+	Identifiers.VariableTrackingFnIdentifier,
+	Identifiers.ConsoleObjIdentifier
+];
+function instrumentContext(context, transformed, traces, variables, lines_executed, consumer, userCodeStartLine) {
+	const state = { currentToolCall: void 0 };
+	context[Identifiers.CommentFnIdentifier] = (comment, line) => {
+		if (comment.includes(USER_CODE_MARKER_TAG_START) || comment.includes(USER_CODE_MARKER_TAG_END)) return;
+		traces.push({
+			type: "comment",
+			comment,
+			line,
+			started_at: Date.now()
+		});
+	};
+	context[Identifiers.LineTrackingFnIdentifier] = (line) => {
+		const mappedLine = consumer.originalPositionFor({
+			line,
+			column: 0
+		}).line ?? line;
+		const userCodeLine = Math.max(1, mappedLine - userCodeStartLine);
+		lines_executed.set(userCodeLine, (lines_executed.get(userCodeLine) ?? 0) + 1);
+	};
+	context[Identifiers.VariableTrackingFnIdentifier] = (name, getter) => {
+		if (NO_TRACKING.includes(name)) return;
+		variables[name] = () => {
+			try {
+				const value = getter();
+				if (typeof value === "function") return "[[non-primitive]]";
+				return value;
+			} catch {
+				return "[[non-primitive]]";
+			}
+		};
+	};
+	context[Identifiers.ToolCallTrackerFnIdentifier] = (callId, type, outputOrError) => {
+		const temp = Signals.maybeDeserializeError(outputOrError === null || outputOrError === void 0 ? void 0 : outputOrError.message);
+		if (type === "end" && temp instanceof SnapshotSignal && (temp === null || temp === void 0 ? void 0 : temp.toolCall)) {
+			var _transformed$toolCall;
+			state.currentToolCall = {
+				...temp.toolCall,
+				assignment: (_transformed$toolCall = transformed.toolCalls.get(callId)) === null || _transformed$toolCall === void 0 ? void 0 : _transformed$toolCall.assignment
+			};
+		}
+	};
+	context[Identifiers.ConsoleObjIdentifier] = { log: (...args) => {
+		const message = args.shift();
+		traces.push({
+			type: "log",
+			message,
+			args,
+			started_at: Date.now()
+		});
+	} };
+	return state;
+}
+function findUserCodeStartLine(transformed) {
+	const markerLines = (transformed.codeWithMarkers || transformed.code).split("\n");
+	for (let i = 0; i < markerLines.length; i++) {
+		var _markerLines$i;
+		if ((_markerLines$i = markerLines[i]) === null || _markerLines$i === void 0 ? void 0 : _markerLines$i.includes("/* __LLMZ_USER_CODE_START__ */")) return i + 1;
+	}
+	return -1;
+}
+//#endregion
+//#region src/vm/drivers/node.ts
+var NodeDriver = class {
+	async execute(ctx) {
+		const { transformed, consumer, context, traces, code, lines_executed, variables } = ctx;
+		const state = instrumentContext(context, transformed, traces, variables, lines_executed, consumer, 0);
+		const AsyncFunction = async function() {}.constructor;
+		return await (async () => {
+			const descriptors = Object.getOwnPropertyDescriptors(context);
+			const topLevelProperties = Object.keys(descriptors).filter((x) => !NO_TRACKING.includes(x) && descriptors[x] && typeof descriptors[x].value !== "function" && typeof descriptors[x].value !== "object");
+			const __report = (name, value) => {
+				if (context[name] !== void 0 && context[name] !== value) context[name] = value;
+			};
+			context.__report = __report;
+			const reportAll = topLevelProperties.map((x) => `__report("${x}", ${x})`).join(";");
+			const wrapper = `"use strict"; try { ${`let __${Identifiers.LineTrackingFnIdentifier} = ${Identifiers.LineTrackingFnIdentifier}; ${Identifiers.LineTrackingFnIdentifier} = function(line) { ${reportAll}; __${Identifiers.LineTrackingFnIdentifier}(line);}`};${transformed.code} } finally { ${reportAll} };`;
+			return await AsyncFunction(...Object.keys(context), wrapper)(...Object.values(context));
+		})().then((res) => {
+			res = Signals.maybeDeserializeError(res);
+			return {
+				success: true,
+				variables: mapValues(variables, (getter) => isFunction(getter) ? getter() : getter),
+				signal: res instanceof VMSignal ? res : void 0,
+				lines_executed: Array.from(lines_executed),
+				return_value: res
+			};
+		}).catch((err) => handleErrorNode(err, code, consumer, traces, variables, lines_executed, state.currentToolCall)).catch((err) => handleCatch(err, traces, variables, lines_executed));
+	}
+};
+//#endregion
+//#region src/vm/drivers/quickjs.ts
+let _quickJSModule;
+let _loadedVariant;
+const loadQuickJSModule = () => {
+	const variant = getQuickJSVariant();
+	if (!_quickJSModule || _loadedVariant !== variant) {
+		_loadedVariant = variant;
+		_quickJSModule = newQuickJSWASMModuleFromVariant(variant);
+	}
+	return _quickJSModule;
+};
+var QuickJSDriver = class {
+	async execute(ctx) {
+		const { transformed, consumer, context, traces, signal, timeout, code, lines_executed, variables } = ctx;
+		const userCodeStartLine = findUserCodeStartLine(transformed);
+		const state = instrumentContext(context, transformed, traces, variables, lines_executed, consumer, userCodeStartLine);
+		const runtime = (await loadQuickJSModule()).newRuntime();
+		runtime.setMemoryLimit(134217728);
+		const timeoutHandler = shouldInterruptAfterDeadline(Date.now() + timeout);
+		runtime.setInterruptHandler(() => {
+			if (signal === null || signal === void 0 ? void 0 : signal.aborted) return true;
+			return timeoutHandler(runtime);
+		});
+		const vm = runtime.newContext();
+		const trackedProperties = /* @__PURE__ */ new Set();
+		const referenceProperties = /* @__PURE__ */ new Set();
+		const pendingPromises = [];
+		const toVmValue = (value) => {
+			if (typeof value === "string") return vm.newString(value);
+			else if (typeof value === "number") return vm.newNumber(value);
+			else if (typeof value === "boolean") return value ? vm.true : vm.false;
+			else if (value === null) return vm.null;
+			else if (value === void 0) return vm.undefined;
+			else if (Array.isArray(value)) {
+				const items = value.map((item) => {
+					if (typeof item === "string") return JSON.stringify(item);
+					else if (typeof item === "number" || typeof item === "boolean") return String(item);
+					else if (item === null) return "null";
+					else if (item === void 0) return "undefined";
+					else if (typeof item === "object") return JSON.stringify(item);
+					return "undefined";
+				});
+				const result = vm.evalCode(`[${items.join(",")}]`);
+				if ("error" in result) {
+					var _result$error;
+					(_result$error = result.error) === null || _result$error === void 0 || _result$error.dispose();
+					return vm.undefined;
+				}
+				return result.value;
+			} else if (typeof value === "object") {
+				const obj = vm.newObject();
+				for (const [k, v] of Object.entries(value)) if (typeof v !== "function") {
+					const propHandle = toVmValue(v);
+					vm.setProp(obj, k, propHandle);
+					disposeIfNeeded(propHandle);
+				}
+				return obj;
+			}
+			return vm.undefined;
+		};
+		const disposeIfNeeded = (handle) => {
+			if (handle !== vm.true && handle !== vm.false && handle !== vm.null && handle !== vm.undefined) handle.dispose();
+		};
+		const bridgeFunction = (fn, _fnName = "anonymous") => {
+			return (...argHandles) => {
+				const args = argHandles.map((h) => vm.dump(h));
+				try {
+					const result = fn(...args);
+					if (result && typeof result.then === "function") {
+						const promise = vm.newPromise();
+						pendingPromises.push({
+							hostPromise: result,
+							deferredPromise: promise
+						});
+						promise.settled.then(() => {
+							if (runtime.alive) runtime.executePendingJobs();
+						});
+						return promise.handle;
+					}
+					return toVmValue(result);
+				} catch (err) {
+					const serialized = err instanceof Error ? err.message : String(err);
+					throw new Error(serialized);
+				}
+			};
+		};
+		try {
+			bridgeContextToVM(context, vm, trackedProperties, referenceProperties, toVmValue, disposeIfNeeded, bridgeFunction);
+			setupVariableTrackingBridge(vm, variables);
+			const scriptCode = buildScriptCode(transformed.code);
+			const copyBackContextFromVM = () => {
+				for (const key of trackedProperties) {
+					if (referenceProperties.has(key)) continue;
+					try {
+						const valueResult = vm.evalCode(`globalThis['${key}']`);
+						const vmValue = vm.dump(valueResult.unwrap());
+						valueResult.unwrap().dispose();
+						try {
+							context[key] = vmValue;
+						} catch {}
+					} catch {}
+				}
+			};
+			const execResult = vm.evalCode(scriptCode, "<quickjs>");
+			if ("error" in execResult) {
+				if (execResult.error) {
+					const err = vm.dump(execResult.error);
+					execResult.error.dispose();
+					throw new Error((err === null || err === void 0 ? void 0 : err.message) || "Execution failed");
+				}
+				throw new Error("Execution failed");
+			}
+			execResult.value.dispose();
+			await this._pumpEventLoop(runtime, vm, pendingPromises, signal, toVmValue, disposeIfNeeded);
+			const errorResult = vm.evalCode("globalThis.__llmz_error");
+			const errorValue = vm.dump(errorResult.unwrap());
+			errorResult.unwrap().dispose();
+			if (signal === null || signal === void 0 ? void 0 : signal.aborted) {
+				const reason = signal.reason;
+				if (reason instanceof Error) throw reason;
+				throw new Error(reason ? String(reason) : "Execution was aborted");
+			}
+			if (errorValue !== null && errorValue !== "") {
+				try {
+					copyBackContextFromVM();
+				} catch {}
+				const errorStackResult = vm.evalCode("globalThis.__llmz_error_stack");
+				const errorStack = vm.dump(errorStackResult.unwrap()) || "";
+				errorStackResult.unwrap().dispose();
+				const deserializedError = Signals.maybeDeserializeError(errorValue);
+				if (deserializedError instanceof VMSignal) {
+					deserializedError.stack = errorStack;
+					throw deserializedError;
+				}
+				const error = new Error(errorValue);
+				error.stack = errorStack;
+				throw error;
+			}
+			copyBackContextFromVM();
+			const resultSetResult = vm.evalCode("globalThis.__llmz_result_set");
+			const resultSet = vm.dump(resultSetResult.unwrap());
+			resultSetResult.unwrap().dispose();
+			let returnValue = void 0;
+			if (resultSet) {
+				const resultResult = vm.evalCode("globalThis.__llmz_result");
+				returnValue = vm.dump(resultResult.unwrap());
+				resultResult.unwrap().dispose();
+			}
+			returnValue = Signals.maybeDeserializeError(returnValue);
+			return {
+				success: true,
+				variables: mapValues(variables, (getter) => isFunction(getter) ? getter() : getter),
+				signal: returnValue instanceof VMSignal ? returnValue : void 0,
+				lines_executed: Array.from(lines_executed),
+				return_value: returnValue
+			};
+		} catch (err) {
+			if (signal === null || signal === void 0 ? void 0 : signal.aborted) {
+				const reason = signal.reason;
+				const abortError = reason instanceof Error ? reason : new Error(reason ? String(reason) : "Execution was aborted");
+				return handleErrorQuickJS(abortError, code, consumer, traces, variables, lines_executed, userCodeStartLine, ctx.currentToolCall ?? state.currentToolCall);
+			}
+			await Promise.all(pendingPromises.map(async ({ hostPromise, deferredPromise }) => {
+				try {
+					const value = await hostPromise;
+					const vmValue = toVmValue(value);
+					deferredPromise.resolve(vmValue);
+					disposeIfNeeded(vmValue);
+				} catch (err2) {
+					const serialized = err2 instanceof Error ? err2.message : String(err2);
+					const errValue = vm.newString(serialized);
+					deferredPromise.reject(errValue);
+					errValue.dispose();
+				}
+			})).catch(() => {});
+			return handleErrorQuickJS(err, code, consumer, traces, variables, lines_executed, userCodeStartLine, ctx.currentToolCall ?? state.currentToolCall);
+		} finally {
+			try {
+				vm.dispose();
+			} catch {}
+			try {
+				runtime.dispose();
+			} catch {}
+		}
+	}
+	async _pumpEventLoop(runtime, vm, pendingPromises, signal, toVmValue, disposeIfNeeded) {
+		const maxIterations = 1e3;
+		let iteration = 0;
+		while (iteration < maxIterations) {
+			let hasJobs = false;
+			const maxJobs = 1e4;
+			for (let i = 0; i < maxJobs; i++) {
+				var _runtime$executePendi;
+				const pending = (_runtime$executePendi = runtime.executePendingJobs) === null || _runtime$executePendi === void 0 ? void 0 : _runtime$executePendi.call(runtime, -1);
+				if ((pending === void 0 ? 0 : pending.unwrap()) <= 0) break;
+				hasJobs = true;
+			}
+			const currentPromises = [...pendingPromises];
+			pendingPromises.length = 0;
+			if (currentPromises.length > 0) {
+				if (signal === null || signal === void 0 ? void 0 : signal.aborted) {
+					const reason = signal.reason;
+					const abortMessage = reason instanceof Error ? `${reason.name}: ${reason.message}` : reason ? String(reason) : "Execution was aborted";
+					for (const { deferredPromise } of currentPromises) {
+						const errValue = vm.newString(abortMessage);
+						deferredPromise.reject(errValue);
+						errValue.dispose();
+					}
+					runtime.executePendingJobs();
+					break;
+				}
+				let abortListener = null;
+				if (signal) {
+					abortListener = () => {
+						const reason = signal.reason;
+						const abortMessage = reason instanceof Error ? `${reason.name}: ${reason.message}` : reason ? String(reason) : "Execution was aborted";
+						for (const { deferredPromise } of currentPromises) {
+							const errValue = vm.newString(abortMessage);
+							deferredPromise.reject(errValue);
+							errValue.dispose();
+						}
+						runtime.executePendingJobs();
+					};
+					signal.addEventListener("abort", abortListener);
+				}
+				try {
+					await Promise.all(currentPromises.map(async ({ hostPromise, deferredPromise }) => {
+						if (signal === null || signal === void 0 ? void 0 : signal.aborted) return;
+						try {
+							const value = await hostPromise;
+							if (signal === null || signal === void 0 ? void 0 : signal.aborted) return;
+							const vmValue = toVmValue(value);
+							deferredPromise.resolve(vmValue);
+							disposeIfNeeded(vmValue);
+						} catch (err) {
+							if (signal === null || signal === void 0 ? void 0 : signal.aborted) return;
+							const serialized = err instanceof Error ? err.message : String(err);
+							const createErrorResult = vm.evalCode(`new Error(${JSON.stringify(serialized)})`);
+							if ("error" in createErrorResult) {
+								const errValue = vm.newString(serialized);
+								deferredPromise.reject(errValue);
+								errValue.dispose();
+							} else {
+								const errorHandle = createErrorResult.value;
+								deferredPromise.reject(errorHandle);
+								errorHandle.dispose();
+							}
+						}
+					}));
+				} finally {
+					if (signal && abortListener) signal.removeEventListener("abort", abortListener);
+				}
+				runtime.executePendingJobs();
+				if (signal === null || signal === void 0 ? void 0 : signal.aborted) break;
+			}
+			if (!hasJobs && pendingPromises.length === 0) break;
+			iteration++;
+		}
+		if (iteration >= maxIterations) throw new Error("Maximum event loop iterations exceeded");
+	}
+};
+function bridgeContextToVM(context, vm, trackedProperties, referenceProperties, toVmValue, disposeIfNeeded, bridgeFunction) {
+	for (const [key, value] of Object.entries(context)) {
+		const descriptor = Object.getOwnPropertyDescriptor(context, key);
+		if (descriptor && (descriptor.get || descriptor.set)) {
+			referenceProperties.add(key);
+			trackedProperties.add(key);
+			bridgeGetterSetter(vm, key, void 0, descriptor, context, toVmValue);
+			continue;
+		}
+		if (typeof value === "function") {
+			const fnHandle = vm.newFunction(key, bridgeFunction(value, key));
+			vm.setProp(vm.global, key, fnHandle);
+			fnHandle.dispose();
+		} else if (Array.isArray(value)) {
+			trackedProperties.add(key);
+			const arrayHandle = toVmValue(value);
+			vm.setProp(vm.global, key, arrayHandle);
+			disposeIfNeeded(arrayHandle);
+		} else if (typeof value === "object" && value !== null) {
+			trackedProperties.add(key);
+			const objHandle = vm.newObject();
+			const props = /* @__PURE__ */ new Set([...Object.keys(value), ...Object.getOwnPropertyNames(value)]);
+			const getterSetterProps = [];
+			for (const prop of props) {
+				const propDescriptor = Object.getOwnPropertyDescriptor(value, prop);
+				if (propDescriptor && (propDescriptor.get || propDescriptor.set)) {
+					referenceProperties.add(`${key}.${prop}`);
+					getterSetterProps.push({
+						prop,
+						descriptor: propDescriptor
+					});
+				} else if (typeof value[prop] === "function") {
+					const propFnHandle = vm.newFunction(prop, bridgeFunction(value[prop], `${key}.${prop}`));
+					vm.setProp(objHandle, prop, propFnHandle);
+					propFnHandle.dispose();
+				} else {
+					const propHandle = toVmValue(value[prop]);
+					vm.setProp(objHandle, prop, propHandle);
+					disposeIfNeeded(propHandle);
+				}
+			}
+			vm.setProp(vm.global, key, objHandle);
+			objHandle.dispose();
+			for (const { prop, descriptor } of getterSetterProps) bridgeGetterSetter(vm, key, prop, descriptor, context, toVmValue);
+			if (Object.isSealed(value)) {
+				var _sealResult$error;
+				const sealResult = vm.evalCode(`Object.seal(globalThis['${key}']);`);
+				if ("error" in sealResult) (_sealResult$error = sealResult.error) === null || _sealResult$error === void 0 || _sealResult$error.dispose();
+				else sealResult.value.dispose();
+			}
+			if (!Object.isExtensible(value)) {
+				var _preventResult$error;
+				const preventResult = vm.evalCode(`Object.preventExtensions(globalThis['${key}']);`);
+				if ("error" in preventResult) (_preventResult$error = preventResult.error) === null || _preventResult$error === void 0 || _preventResult$error.dispose();
+				else preventResult.value.dispose();
+			}
+		} else {
+			trackedProperties.add(key);
+			const valueHandle = toVmValue(value);
+			vm.setProp(vm.global, key, valueHandle);
+			disposeIfNeeded(valueHandle);
+		}
+	}
+}
+function bridgeGetterSetter(vm, key, prop, descriptor, context, toVmValue) {
+	var _result$error2;
+	const target = prop ? `${key}` : "globalThis";
+	const propName = prop ?? key;
+	const prefix = prop ? `${key}_${prop}` : key;
+	let getterCode = "undefined";
+	if (descriptor.get) {
+		const getterBridge = vm.newFunction(`get_${propName}`, () => {
+			try {
+				return toVmValue(prop ? context[key][prop] : context[key]);
+			} catch (err) {
+				throw new Error(err instanceof Error ? err.message : String(err));
+			}
+		});
+		const getterName = `__getter_${prefix}__`;
+		vm.setProp(vm.global, getterName, getterBridge);
+		getterBridge.dispose();
+		getterCode = getterName;
+	}
+	let setterCode = "undefined";
+	if (descriptor.set) {
+		const setterBridge = vm.newFunction(`set_${propName}`, (valueHandle) => {
+			try {
+				const jsValue = vm.dump(valueHandle);
+				if (prop) context[key][prop] = jsValue;
+				else context[key] = jsValue;
+				return vm.undefined;
+			} catch (err) {
+				throw new Error(err instanceof Error ? err.message : String(err));
+			}
+		});
+		const setterName = `__setter_${prefix}__`;
+		vm.setProp(vm.global, setterName, setterBridge);
+		setterBridge.dispose();
+		setterCode = setterName;
+	}
+	const definePropertyCode = `
+    Object.defineProperty(${target}, '${propName}', {
+      enumerable: true,
+      configurable: ${descriptor.configurable !== false},
+      get: ${getterCode},
+      set: ${setterCode}
+    });
+  `;
+	const result = vm.evalCode(definePropertyCode);
+	if ("error" in result) (_result$error2 = result.error) === null || _result$error2 === void 0 || _result$error2.dispose();
+	else result.value.dispose();
+}
+function setupVariableTrackingBridge(vm, variables) {
+	const varTrackFnHandle = vm.newFunction(Identifiers.VariableTrackingFnIdentifier, (nameHandle, getterHandle) => {
+		const name = vm.getString(nameHandle);
+		if (NO_TRACKING.includes(name)) return;
+		try {
+			const valueResult = vm.callFunction(getterHandle, vm.undefined);
+			if ("error" in valueResult) {
+				var _valueResult$error;
+				variables[name] = "[[non-primitive]]";
+				(_valueResult$error = valueResult.error) === null || _valueResult$error === void 0 || _valueResult$error.dispose();
+				return;
+			}
+			const value = vm.dump(valueResult.value);
+			valueResult.value.dispose();
+			if (typeof value === "function" || typeof value === "string" && value.includes("=>")) variables[name] = "[[non-primitive]]";
+			else variables[name] = value;
+		} catch {
+			variables[name] = "[[non-primitive]]";
+		}
+	});
+	vm.setProp(vm.global, Identifiers.VariableTrackingFnIdentifier, varTrackFnHandle);
+	varTrackFnHandle.dispose();
+}
+function buildScriptCode(transformedCode) {
+	return `
+"use strict";
+globalThis.__llmz_result = undefined;
+globalThis.__llmz_result_set = false;
+globalThis.__llmz_error = null;
+globalThis.__llmz_error_stack = null;
+
+(async () => {
+  try {
+    async function __fn__() {
+${transformedCode}
+    }
+
+    globalThis.__llmz_result = await __fn__();
+    globalThis.__llmz_result_set = true;
+  } catch (err) {
+    globalThis.__llmz_error = typeof err === 'string' ? err : String(err.message || err || '');
+    globalThis.__llmz_error_stack = '' + (err.stack || '');
+  }
+})();
+`.trim();
+}
+//#endregion
+//#region src/vm/index.ts
+const MAX_VM_EXECUTION_TIME = 6e4;
+const useQuickJS = () => {
+	var _process;
+	return typeof process === "undefined" || ((_process = process) === null || _process === void 0 || (_process = _process.env) === null || _process === void 0 ? void 0 : _process.USE_QUICKJS) !== "false";
+};
+const isWorkerd = () => {
+	var _navigator;
+	return typeof navigator !== "undefined" && ((_navigator = navigator) === null || _navigator === void 0 ? void 0 : _navigator.userAgent) === "Cloudflare-Workers";
+};
+/**
+* Pre-warms the VM so the first execution doesn't pay the QuickJS WASM
+* instantiation cost. Fire-and-forget: called as soon as the model starts
+* writing a `■run` block, so the module loads while the code is still being
+* generated. No-op when the QuickJS driver is disabled or already loaded.
+*/
+const warmupVM = () => {
+	if (useQuickJS()) loadQuickJSModule().catch(() => {});
+};
+async function runAsyncFunction(context, code, traces = [], signal = null, timeout = MAX_VM_EXECUTION_TIME) {
+	const transformed = (() => {
+		try {
+			return compile(code);
+		} catch (err) {
+			traces.push({
+				type: "invalid_code_exception",
+				message: (err === null || err === void 0 ? void 0 : err.message) ?? "Unknown error",
+				code,
+				started_at: Date.now()
+			});
+			throw new InvalidCodeError(err.message, code);
+		}
+	})();
+	const lines_executed = /* @__PURE__ */ new Map();
+	const variables = {};
+	const consumer = new import_source_map.SourceMapConsumer({
+		version: transformed.map.version.toString(),
+		mappings: transformed.map.mappings,
+		names: transformed.map.names,
+		sources: transformed.map.sources,
+		sourcesContent: [transformed.code],
+		file: transformed.map.file
+	});
+	context ??= {};
+	for (const name of Array.from(transformed.variables)) delete context[name];
+	let driver;
+	if (useQuickJS()) try {
+		driver = new QuickJSDriver();
+		return await driver.execute({
+			transformed,
+			consumer,
+			context,
+			traces,
+			signal,
+			timeout,
+			code,
+			lines_executed,
+			variables,
+			currentToolCall: void 0
+		});
+	} catch (quickjsError) {
+		const variant = getQuickJSVariant();
+		const debugInfo = {
+			error: (quickjsError === null || quickjsError === void 0 ? void 0 : quickjsError.message) || String(quickjsError),
+			errorStack: quickjsError === null || quickjsError === void 0 ? void 0 : quickjsError.stack,
+			wasmSource: variant._wasmSource,
+			wasmLoadedSuccessfully: variant._wasmLoadedSuccessfully,
+			wasmSize: variant._wasmSize,
+			wasmLoadError: variant._wasmLoadError,
+			nodeVersion: typeof process !== "undefined" && process.version ? process.version : "undefined",
+			platform: typeof process !== "undefined" && process.platform ? process.platform : "undefined"
+		};
+		if (isWorkerd()) {
+			console.error("QuickJS failed to load and the node driver is unavailable on Cloudflare Workers.");
+			console.error("Debug info:", JSON.stringify(debugInfo, null, 2));
+			if (quickjsError instanceof Error) {
+				quickjsError.debugInfo = debugInfo;
+				throw quickjsError;
+			}
+			throw new Error(`QuickJS failed to load on Cloudflare Workers: ${debugInfo.error}`);
+		}
+		console.warn("QuickJS failed to load, falling back to node driver.");
+		console.warn("Error:", (quickjsError === null || quickjsError === void 0 ? void 0 : quickjsError.message) || quickjsError);
+		console.warn("Debug info:", JSON.stringify(debugInfo, null, 2));
+	}
+	driver = new NodeDriver();
+	return await driver.execute({
+		transformed,
+		consumer,
+		context,
+		traces,
+		signal,
+		timeout,
+		code,
+		lines_executed,
+		variables,
+		currentToolCall: void 0
+	});
+}
+//#endregion
+export { runAsyncFunction, hasTopLevelReturn as t, warmupVM };