@volter/tabnode 0.5.45 → 0.5.47

package/dist/assets/{runtime-worker-CSaX_wiK.js → runtime-worker-4iI8R3l-.js}

@@ -8686,6 +8686,26 @@ function createFsBindings(Bytes = () => Buffer$9) {
           if (position === null || position === void 0 || position < 0) file.position = end + slice.length;
           return slice.length;
         }
+        if (typeof tree2.writeAtSync === "function") {
+          const at22 = position === null || position === void 0 || position < 0 ? file.position : position;
+          tree2.writeAtSync(file.path, slice, at22);
+          if (file.cached !== void 0 && slice.length > 0) {
+            const cached = file.cached;
+            const length2 = Math.max(cached.length, at22 + slice.length);
+            let room = file.room;
+            if (!room || cached.buffer !== room.buffer || cached.byteOffset !== 0 || room.byteLength < length2) {
+              room = new Uint8Array(Math.max(length2, cached.length * 2, 4096));
+              room.set(cached, 0);
+            } else if (at22 > cached.length) {
+              room.fill(0, cached.length, at22);
+            }
+            room.set(slice, at22);
+            file.cached = room.subarray(0, length2);
+            file.room = room;
+          }
+          if (position === null || position === void 0 || position < 0) file.position = at22 + slice.length;
+          return slice.length;
+        }
         const existing = file.cached ?? (tree2.existsSync(file.path) ? tree2.readFileSync(file.path) : new Uint8Array(0));
         const at3 = (file.flags & flagBits().append) !== 0 ? existing.length : position === null || position === void 0 || position < 0 ? file.position : position;
         const size = Math.max(existing.length, at3 + slice.length);
@@ -31445,6 +31465,8 @@ class VirtualFS {
     if (existed && existing.type === "file") {
       existing.content = content;
       existing.mtime = Date.now();
+      existing.room = void 0;
+      existing.lent = true;
     } else {
       parent.children.set(basename, {
         type: "file",
@@ -31730,6 +31752,7 @@ class VirtualFS {
     if (encoding === "utf8" || encoding === "utf-8") {
       return this.decoder.decode(content);
     }
+    node.lent = true;
     return content;
   }
   /**
@@ -31779,6 +31802,55 @@ class VirtualFS {
     this.notifyWatchers(normalized, "change");
     if ((_a3 = this.eventListeners.get("change")) == null ? void 0 : _a3.size) this.emit("change", normalized, this.decoder.decode(node.content));
   }
+  /**
+   * Bytes written into a file at `position`, as a disk takes them: a gap past
+   * the end reads as zeros, and the file grows in its own buffer as an append
+   * grows it. A database rewrites its log and its pages a page at a time;
+   * writing the whole file again for each page copied Postgres's 16 MB
+   * write-ahead log at every commit. A tree that keeps its files elsewhere
+   * (its own writeFileSync) is written through its own read and write unless
+   * it answers this itself.
+   */
+  writeAtSync(path2, data2, position) {
+    var _a3;
+    if (this.writeFileSync !== VirtualFS.prototype.writeFileSync) {
+      const existing = this.existsSync(path2) ? this.readFileSync(path2) : new Uint8Array(0);
+      if (data2.byteLength === 0 && this.existsSync(path2)) return;
+      const whole = new Uint8Array(Math.max(existing.byteLength, position + data2.byteLength));
+      whole.set(existing, 0);
+      whole.set(data2, position);
+      this.writeFileSync(path2, whole);
+      return;
+    }
+    const normalized = this.normalizePath(path2);
+    const node = this.getNode(normalized);
+    if (!node) {
+      const whole = new Uint8Array(position + data2.byteLength);
+      whole.set(data2, position);
+      this.writeFileSyncInternal(normalized, whole, true);
+      return;
+    }
+    if (node.type !== "file") throw createNodeError("EISDIR", "open", path2);
+    this.assertWritable(normalized, "open");
+    if (data2.byteLength === 0) return;
+    const current3 = node.content ?? new Uint8Array(0);
+    const length = Math.max(current3.byteLength, position + data2.byteLength);
+    const held = node;
+    let room = held.room;
+    if (!room || held.lent || current3.buffer !== room.buffer || current3.byteOffset !== 0 || room.byteLength < length) {
+      room = new Uint8Array(Math.max(length, current3.byteLength * 2, 4096));
+      room.set(current3, 0);
+      held.lent = false;
+    } else if (position > current3.byteLength) {
+      room.fill(0, current3.byteLength, position);
+    }
+    room.set(data2, position);
+    node.content = room.subarray(0, length);
+    node.room = room;
+    node.mtime = Date.now();
+    this.notifyWatchers(normalized, "change");
+    if ((_a3 = this.eventListeners.get("change")) == null ? void 0 : _a3.size) this.emit("change", normalized, this.decoder.decode(node.content));
+  }
   /**
    * Create directory, optionally with recursive parent creation
    */
@@ -75598,7 +75670,7 @@ const readlineModule = lazyModule("readline");
 lazyModule("readline/promises");
 const zlibModule = lazyModule("zlib");
 const PUNYCODE_SOURCE = "'use strict';\n\n/** Highest positive signed 32-bit float value */\nconst maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1\n\n/** Bootstring parameters */\nconst base = 36;\nconst tMin = 1;\nconst tMax = 26;\nconst skew = 38;\nconst damp = 700;\nconst initialBias = 72;\nconst initialN = 128; // 0x80\nconst delimiter = '-'; // '\\x2D'\n\n/** Regular expressions */\nconst regexPunycode = /^xn--/;\nconst regexNonASCII = /[^\\0-\\x7F]/; // Note: U+007F DEL is excluded too.\nconst regexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g; // RFC 3490 separators\n\n/** Error messages */\nconst errors = {\n	'overflow': 'Overflow: input needs wider integers to process',\n	'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n	'invalid-input': 'Invalid input'\n};\n\n/** Convenience shortcuts */\nconst baseMinusTMin = base - tMin;\nconst floor = Math.floor;\nconst stringFromCharCode = String.fromCharCode;\n\n/*--------------------------------------------------------------------------*/\n\n/**\n * A generic error utility function.\n * @private\n * @param {String} type The error type.\n * @returns {Error} Throws a `RangeError` with the applicable error message.\n */\nfunction error(type) {\n	throw new RangeError(errors[type]);\n}\n\n/**\n * A generic `Array#map` utility function.\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} callback The function that gets called for every array\n * item.\n * @returns {Array} A new array of values returned by the callback function.\n */\nfunction map(array, callback) {\n	const result = [];\n	let length = array.length;\n	while (length--) {\n		result[length] = callback(array[length]);\n	}\n	return result;\n}\n\n/**\n * A simple `Array#map`-like wrapper to work with domain name strings or email\n * addresses.\n * @private\n * @param {String} domain The domain name or email address.\n * @param {Function} callback The function that gets called for every\n * character.\n * @returns {String} A new string of characters returned by the callback\n * function.\n */\nfunction mapDomain(domain, callback) {\n	const parts = domain.split('@');\n	let result = '';\n	if (parts.length > 1) {\n		// In email addresses, only the domain name should be punycoded. Leave\n		// the local part (i.e. everything up to `@`) intact.\n		result = parts[0] + '@';\n		domain = parts[1];\n	}\n	// Avoid `split(regex)` for IE8 compatibility. See #17.\n	domain = domain.replace(regexSeparators, '\\x2E');\n	const labels = domain.split('.');\n	const encoded = map(labels, callback).join('.');\n	return result + encoded;\n}\n\n/**\n * Creates an array containing the numeric code points of each Unicode\n * character in the string. While JavaScript uses UCS-2 internally,\n * this function will convert a pair of surrogate halves (each of which\n * UCS-2 exposes as separate characters) into a single code point,\n * matching UTF-16.\n * @see `punycode.ucs2.encode`\n * @see <https://mathiasbynens.be/notes/javascript-encoding>\n * @memberOf punycode.ucs2\n * @name decode\n * @param {String} string The Unicode input string (UCS-2).\n * @returns {Array} The new array of code points.\n */\nfunction ucs2decode(string) {\n	const output = [];\n	let counter = 0;\n	const length = string.length;\n	while (counter < length) {\n		const value = string.charCodeAt(counter++);\n		if (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n			// It's a high surrogate, and there is a next character.\n			const extra = string.charCodeAt(counter++);\n			if ((extra & 0xFC00) == 0xDC00) { // Low surrogate.\n				output.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n			} else {\n				// It's an unmatched surrogate; only append this code unit, in case the\n				// next code unit is the high surrogate of a surrogate pair.\n				output.push(value);\n				counter--;\n			}\n		} else {\n			output.push(value);\n		}\n	}\n	return output;\n}\n\n/**\n * Creates a string based on an array of numeric code points.\n * @see `punycode.ucs2.decode`\n * @memberOf punycode.ucs2\n * @name encode\n * @param {Array} codePoints The array of numeric code points.\n * @returns {String} The new Unicode string (UCS-2).\n */\nconst ucs2encode = codePoints => String.fromCodePoint(...codePoints);\n\n/**\n * Converts a basic code point into a digit/integer.\n * @see `digitToBasic()`\n * @private\n * @param {Number} codePoint The basic numeric code point value.\n * @returns {Number} The numeric value of a basic code point (for use in\n * representing integers) in the range `0` to `base - 1`, or `base` if\n * the code point does not represent a value.\n */\nconst basicToDigit = function(codePoint) {\n	if (codePoint >= 0x30 && codePoint < 0x3A) {\n		return 26 + (codePoint - 0x30);\n	}\n	if (codePoint >= 0x41 && codePoint < 0x5B) {\n		return codePoint - 0x41;\n	}\n	if (codePoint >= 0x61 && codePoint < 0x7B) {\n		return codePoint - 0x61;\n	}\n	return base;\n};\n\n/**\n * Converts a digit/integer into a basic code point.\n * @see `basicToDigit()`\n * @private\n * @param {Number} digit The numeric value of a basic code point.\n * @returns {Number} The basic code point whose value (when used for\n * representing integers) is `digit`, which needs to be in the range\n * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n * used; else, the lowercase form is used. The behavior is undefined\n * if `flag` is non-zero and `digit` has no uppercase form.\n */\nconst digitToBasic = function(digit, flag) {\n	//  0..25 map to ASCII a..z or A..Z\n	// 26..35 map to ASCII 0..9\n	return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n};\n\n/**\n * Bias adaptation function as per section 3.4 of RFC 3492.\n * https://tools.ietf.org/html/rfc3492#section-3.4\n * @private\n */\nconst adapt = function(delta, numPoints, firstTime) {\n	let k = 0;\n	delta = firstTime ? floor(delta / damp) : delta >> 1;\n	delta += floor(delta / numPoints);\n	for (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n		delta = floor(delta / baseMinusTMin);\n	}\n	return floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n};\n\n/**\n * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n * symbols.\n * @memberOf punycode\n * @param {String} input The Punycode string of ASCII-only symbols.\n * @returns {String} The resulting string of Unicode symbols.\n */\nconst decode = function(input) {\n	// Don't use UCS-2.\n	const output = [];\n	const inputLength = input.length;\n	let i = 0;\n	let n = initialN;\n	let bias = initialBias;\n\n	// Handle the basic code points: let `basic` be the number of input code\n	// points before the last delimiter, or `0` if there is none, then copy\n	// the first basic code points to the output.\n\n	let basic = input.lastIndexOf(delimiter);\n	if (basic < 0) {\n		basic = 0;\n	}\n\n	for (let j = 0; j < basic; ++j) {\n		// if it's not a basic code point\n		if (input.charCodeAt(j) >= 0x80) {\n			error('not-basic');\n		}\n		output.push(input.charCodeAt(j));\n	}\n\n	// Main decoding loop: start just after the last delimiter if any basic code\n	// points were copied; start at the beginning otherwise.\n\n	for (let index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n		// `index` is the index of the next character to be consumed.\n		// Decode a generalized variable-length integer into `delta`,\n		// which gets added to `i`. The overflow checking is easier\n		// if we increase `i` as we go, then subtract off its starting\n		// value at the end to obtain `delta`.\n		const oldi = i;\n		for (let w = 1, k = base; /* no condition */; k += base) {\n\n			if (index >= inputLength) {\n				error('invalid-input');\n			}\n\n			const digit = basicToDigit(input.charCodeAt(index++));\n\n			if (digit >= base) {\n				error('invalid-input');\n			}\n			if (digit > floor((maxInt - i) / w)) {\n				error('overflow');\n			}\n\n			i += digit * w;\n			const t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n			if (digit < t) {\n				break;\n			}\n\n			const baseMinusT = base - t;\n			if (w > floor(maxInt / baseMinusT)) {\n				error('overflow');\n			}\n\n			w *= baseMinusT;\n\n		}\n\n		const out = output.length + 1;\n		bias = adapt(i - oldi, out, oldi == 0);\n\n		// `i` was supposed to wrap around from `out` to `0`,\n		// incrementing `n` each time, so we'll fix that now:\n		if (floor(i / out) > maxInt - n) {\n			error('overflow');\n		}\n\n		n += floor(i / out);\n		i %= out;\n\n		// Insert `n` at position `i` of the output.\n		output.splice(i++, 0, n);\n\n	}\n\n	return String.fromCodePoint(...output);\n};\n\n/**\n * Converts a string of Unicode symbols (e.g. a domain name label) to a\n * Punycode string of ASCII-only symbols.\n * @memberOf punycode\n * @param {String} input The string of Unicode symbols.\n * @returns {String} The resulting Punycode string of ASCII-only symbols.\n */\nconst encode = function(input) {\n	const output = [];\n\n	// Convert the input in UCS-2 to an array of Unicode code points.\n	input = ucs2decode(input);\n\n	// Cache the length.\n	const inputLength = input.length;\n\n	// Initialize the state.\n	let n = initialN;\n	let delta = 0;\n	let bias = initialBias;\n\n	// Handle the basic code points.\n	for (const currentValue of input) {\n		if (currentValue < 0x80) {\n			output.push(stringFromCharCode(currentValue));\n		}\n	}\n\n	const basicLength = output.length;\n	let handledCPCount = basicLength;\n\n	// `handledCPCount` is the number of code points that have been handled;\n	// `basicLength` is the number of basic code points.\n\n	// Finish the basic string with a delimiter unless it's empty.\n	if (basicLength) {\n		output.push(delimiter);\n	}\n\n	// Main encoding loop:\n	while (handledCPCount < inputLength) {\n\n		// All non-basic code points < n have been handled already. Find the next\n		// larger one:\n		let m = maxInt;\n		for (const currentValue of input) {\n			if (currentValue >= n && currentValue < m) {\n				m = currentValue;\n			}\n		}\n\n		// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,\n		// but guard against overflow.\n		const handledCPCountPlusOne = handledCPCount + 1;\n		if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n			error('overflow');\n		}\n\n		delta += (m - n) * handledCPCountPlusOne;\n		n = m;\n\n		for (const currentValue of input) {\n			if (currentValue < n && ++delta > maxInt) {\n				error('overflow');\n			}\n			if (currentValue === n) {\n				// Represent delta as a generalized variable-length integer.\n				let q = delta;\n				for (let k = base; /* no condition */; k += base) {\n					const t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n					if (q < t) {\n						break;\n					}\n					const qMinusT = q - t;\n					const baseMinusT = base - t;\n					output.push(\n						stringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n					);\n					q = floor(qMinusT / baseMinusT);\n				}\n\n				output.push(stringFromCharCode(digitToBasic(q, 0)));\n				bias = adapt(delta, handledCPCountPlusOne, handledCPCount === basicLength);\n				delta = 0;\n				++handledCPCount;\n			}\n		}\n\n		++delta;\n		++n;\n\n	}\n	return output.join('');\n};\n\n/**\n * Converts a Punycode string representing a domain name or an email address\n * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n * it doesn't matter if you call it on a string that has already been\n * converted to Unicode.\n * @memberOf punycode\n * @param {String} input The Punycoded domain name or email address to\n * convert to Unicode.\n * @returns {String} The Unicode representation of the given Punycode\n * string.\n */\nconst toUnicode = function(input) {\n	return mapDomain(input, function(string) {\n		return regexPunycode.test(string)\n			? decode(string.slice(4).toLowerCase())\n			: string;\n	});\n};\n\n/**\n * Converts a Unicode string representing a domain name or an email address to\n * Punycode. Only the non-ASCII parts of the domain name will be converted,\n * i.e. it doesn't matter if you call it with a domain that's already in\n * ASCII.\n * @memberOf punycode\n * @param {String} input The domain name or email address to convert, as a\n * Unicode string.\n * @returns {String} The Punycode representation of the given domain name or\n * email address.\n */\nconst toASCII = function(input) {\n	return mapDomain(input, function(string) {\n		return regexNonASCII.test(string)\n			? 'xn--' + encode(string)\n			: string;\n	});\n};\n\n/*--------------------------------------------------------------------------*/\n\n/** Define the public API */\nconst punycode = {\n	/**\n	 * A string representing the current Punycode.js version number.\n	 * @memberOf punycode\n	 * @type String\n	 */\n	'version': '2.3.1',\n	/**\n	 * An object of methods to convert from JavaScript's internal character\n	 * representation (UCS-2) to Unicode code points, and back.\n	 * @see <https://mathiasbynens.be/notes/javascript-encoding>\n	 * @memberOf punycode\n	 * @type Object\n	 */\n	'ucs2': {\n		'decode': ucs2decode,\n		'encode': ucs2encode\n	},\n	'decode': decode,\n	'encode': encode,\n	'toASCII': toASCII,\n	'toUnicode': toUnicode\n};\n\nmodule.exports = punycode;\n";
-const ESBUILD_WASM_VERSION = "0.20.0";
+const ESBUILD_WASM_VERSION = "0.28.2";
 const ROLLUP_BROWSER_VERSION = "4.63.1";
 const ESBUILD_WASM_BINARY_CDN = `https://unpkg.com/esbuild-wasm@${ESBUILD_WASM_VERSION}/esbuild.wasm`;
 const ESBUILD_WASM_BROWSER_CDN = `https://unpkg.com/esbuild-wasm@${ESBUILD_WASM_VERSION}/esm/browser.min.js`;
@@ -76487,7 +76559,7 @@ function buildSync(_options3) {
   throw new Error("buildSync is not available in browser. Use build() instead.");
 }
 function version() {
-  return "0.20.0";
+  return ESBUILD_WASM_VERSION;
 }
 async function context(options) {
   let disposed = false;
@@ -79994,10 +80066,28 @@ function createRequire(vfs2, fsShim, process2, currentDir, moduleCache, options,
     }
     return loadModule(resolved).exports;
   };
-  require2.resolve = (id2) => {
+  require2.resolve = (id2, options2) => {
     if (id2 === "fs" || id2 === "process" || id2.startsWith("node:") || builtinModules$1.includes(id2)) {
       return id2;
     }
+    if (options2 && options2.paths !== void 0) {
+      if (!Array.isArray(options2.paths)) {
+        throw Object.assign(new TypeError(`The property 'options.paths' must be an Array. Received ${String(options2.paths)}`), { code: "ERR_INVALID_ARG_VALUE" });
+      }
+      options2.paths.forEach((from, index2) => {
+        if (typeof from !== "string") throw Object.assign(new TypeError(`The "paths[${index2}]" argument must be of type string. Received ${typeof from}`), { code: "ERR_INVALID_ARG_TYPE" });
+      });
+      const requireStack = parentModule && typeof parentModule.filename === "string" ? [parentModule.filename] : [];
+      for (const from of options2.paths) {
+        try {
+          return resolveModule(id2, resolve(process2.cwd(), from));
+        } catch {
+        }
+      }
+      throw Object.assign(new Error(`Cannot find module '${id2}'${requireStack.length ? `
+Require stack:
+- ${requireStack.join("\n- ")}` : ""}`), { code: "MODULE_NOT_FOUND", requireStack });
+    }
     return resolveModule(id2, currentDir);
   };
   require2.cache = moduleCache;

package/dist/config/cdn.d.ts

@@ -3,9 +3,9 @@
  * other place: the versions the engine's `esbuild` and `rollup` doors are
  * written against.
  */
-export declare const ESBUILD_WASM_VERSION = "0.20.0";
+export declare const ESBUILD_WASM_VERSION = "0.28.2";
 export declare const ROLLUP_BROWSER_VERSION = "4.63.1";
-export declare const ESBUILD_WASM_ESM_CDN = "https://esm.sh/esbuild-wasm@0.20.0";
-export declare const ESBUILD_WASM_BINARY_CDN = "https://unpkg.com/esbuild-wasm@0.20.0/esbuild.wasm";
-export declare const ESBUILD_WASM_BROWSER_CDN = "https://unpkg.com/esbuild-wasm@0.20.0/esm/browser.min.js";
+export declare const ESBUILD_WASM_ESM_CDN = "https://esm.sh/esbuild-wasm@0.28.2";
+export declare const ESBUILD_WASM_BINARY_CDN = "https://unpkg.com/esbuild-wasm@0.28.2/esbuild.wasm";
+export declare const ESBUILD_WASM_BROWSER_CDN = "https://unpkg.com/esbuild-wasm@0.28.2/esm/browser.min.js";
 export declare const ROLLUP_BROWSER_CDN = "https://esm.sh/@rollup/browser@4.63.1";

package/dist/index.mjs

@@ -8814,6 +8814,26 @@ function createFsBindings(Bytes = () => Buffer$9) {
           if (position === null || position === void 0 || position < 0) file.position = end + slice.length;
           return slice.length;
         }
+        if (typeof tree2.writeAtSync === "function") {
+          const at22 = position === null || position === void 0 || position < 0 ? file.position : position;
+          tree2.writeAtSync(file.path, slice, at22);
+          if (file.cached !== void 0 && slice.length > 0) {
+            const cached = file.cached;
+            const length2 = Math.max(cached.length, at22 + slice.length);
+            let room = file.room;
+            if (!room || cached.buffer !== room.buffer || cached.byteOffset !== 0 || room.byteLength < length2) {
+              room = new Uint8Array(Math.max(length2, cached.length * 2, 4096));
+              room.set(cached, 0);
+            } else if (at22 > cached.length) {
+              room.fill(0, cached.length, at22);
+            }
+            room.set(slice, at22);
+            file.cached = room.subarray(0, length2);
+            file.room = room;
+          }
+          if (position === null || position === void 0 || position < 0) file.position = at22 + slice.length;
+          return slice.length;
+        }
         const existing = file.cached ?? (tree2.existsSync(file.path) ? tree2.readFileSync(file.path) : new Uint8Array(0));
         const at2 = (file.flags & flagBits().append) !== 0 ? existing.length : position === null || position === void 0 || position < 0 ? file.position : position;
         const size = Math.max(existing.length, at2 + slice.length);
@@ -31599,6 +31619,8 @@ class VirtualFS {
     if (existed && existing.type === "file") {
       existing.content = content;
       existing.mtime = Date.now();
+      existing.room = void 0;
+      existing.lent = true;
     } else {
       parent.children.set(basename2, {
         type: "file",
@@ -31884,6 +31906,7 @@ class VirtualFS {
     if (encoding === "utf8" || encoding === "utf-8") {
       return this.decoder.decode(content);
     }
+    node.lent = true;
     return content;
   }
   /**
@@ -31933,6 +31956,55 @@ class VirtualFS {
     this.notifyWatchers(normalized, "change");
     if ((_a2 = this.eventListeners.get("change")) == null ? void 0 : _a2.size) this.emit("change", normalized, this.decoder.decode(node.content));
   }
+  /**
+   * Bytes written into a file at `position`, as a disk takes them: a gap past
+   * the end reads as zeros, and the file grows in its own buffer as an append
+   * grows it. A database rewrites its log and its pages a page at a time;
+   * writing the whole file again for each page copied Postgres's 16 MB
+   * write-ahead log at every commit. A tree that keeps its files elsewhere
+   * (its own writeFileSync) is written through its own read and write unless
+   * it answers this itself.
+   */
+  writeAtSync(path2, data2, position) {
+    var _a2;
+    if (this.writeFileSync !== VirtualFS.prototype.writeFileSync) {
+      const existing = this.existsSync(path2) ? this.readFileSync(path2) : new Uint8Array(0);
+      if (data2.byteLength === 0 && this.existsSync(path2)) return;
+      const whole = new Uint8Array(Math.max(existing.byteLength, position + data2.byteLength));
+      whole.set(existing, 0);
+      whole.set(data2, position);
+      this.writeFileSync(path2, whole);
+      return;
+    }
+    const normalized = this.normalizePath(path2);
+    const node = this.getNode(normalized);
+    if (!node) {
+      const whole = new Uint8Array(position + data2.byteLength);
+      whole.set(data2, position);
+      this.writeFileSyncInternal(normalized, whole, true);
+      return;
+    }
+    if (node.type !== "file") throw createNodeError("EISDIR", "open", path2);
+    this.assertWritable(normalized, "open");
+    if (data2.byteLength === 0) return;
+    const current3 = node.content ?? new Uint8Array(0);
+    const length = Math.max(current3.byteLength, position + data2.byteLength);
+    const held = node;
+    let room = held.room;
+    if (!room || held.lent || current3.buffer !== room.buffer || current3.byteOffset !== 0 || room.byteLength < length) {
+      room = new Uint8Array(Math.max(length, current3.byteLength * 2, 4096));
+      room.set(current3, 0);
+      held.lent = false;
+    } else if (position > current3.byteLength) {
+      room.fill(0, current3.byteLength, position);
+    }
+    room.set(data2, position);
+    node.content = room.subarray(0, length);
+    node.room = room;
+    node.mtime = Date.now();
+    this.notifyWatchers(normalized, "change");
+    if ((_a2 = this.eventListeners.get("change")) == null ? void 0 : _a2.size) this.emit("change", normalized, this.decoder.decode(node.content));
+  }
   /**
    * Create directory, optionally with recursive parent creation
    */
@@ -35255,7 +35327,7 @@ const readlineModule = lazyModule("readline");
 lazyModule("readline/promises");
 const zlibModule = lazyModule("zlib");
 const PUNYCODE_SOURCE = "'use strict';\n\n/** Highest positive signed 32-bit float value */\nconst maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1\n\n/** Bootstring parameters */\nconst base = 36;\nconst tMin = 1;\nconst tMax = 26;\nconst skew = 38;\nconst damp = 700;\nconst initialBias = 72;\nconst initialN = 128; // 0x80\nconst delimiter = '-'; // '\\x2D'\n\n/** Regular expressions */\nconst regexPunycode = /^xn--/;\nconst regexNonASCII = /[^\\0-\\x7F]/; // Note: U+007F DEL is excluded too.\nconst regexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g; // RFC 3490 separators\n\n/** Error messages */\nconst errors = {\n	'overflow': 'Overflow: input needs wider integers to process',\n	'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n	'invalid-input': 'Invalid input'\n};\n\n/** Convenience shortcuts */\nconst baseMinusTMin = base - tMin;\nconst floor = Math.floor;\nconst stringFromCharCode = String.fromCharCode;\n\n/*--------------------------------------------------------------------------*/\n\n/**\n * A generic error utility function.\n * @private\n * @param {String} type The error type.\n * @returns {Error} Throws a `RangeError` with the applicable error message.\n */\nfunction error(type) {\n	throw new RangeError(errors[type]);\n}\n\n/**\n * A generic `Array#map` utility function.\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} callback The function that gets called for every array\n * item.\n * @returns {Array} A new array of values returned by the callback function.\n */\nfunction map(array, callback) {\n	const result = [];\n	let length = array.length;\n	while (length--) {\n		result[length] = callback(array[length]);\n	}\n	return result;\n}\n\n/**\n * A simple `Array#map`-like wrapper to work with domain name strings or email\n * addresses.\n * @private\n * @param {String} domain The domain name or email address.\n * @param {Function} callback The function that gets called for every\n * character.\n * @returns {String} A new string of characters returned by the callback\n * function.\n */\nfunction mapDomain(domain, callback) {\n	const parts = domain.split('@');\n	let result = '';\n	if (parts.length > 1) {\n		// In email addresses, only the domain name should be punycoded. Leave\n		// the local part (i.e. everything up to `@`) intact.\n		result = parts[0] + '@';\n		domain = parts[1];\n	}\n	// Avoid `split(regex)` for IE8 compatibility. See #17.\n	domain = domain.replace(regexSeparators, '\\x2E');\n	const labels = domain.split('.');\n	const encoded = map(labels, callback).join('.');\n	return result + encoded;\n}\n\n/**\n * Creates an array containing the numeric code points of each Unicode\n * character in the string. While JavaScript uses UCS-2 internally,\n * this function will convert a pair of surrogate halves (each of which\n * UCS-2 exposes as separate characters) into a single code point,\n * matching UTF-16.\n * @see `punycode.ucs2.encode`\n * @see <https://mathiasbynens.be/notes/javascript-encoding>\n * @memberOf punycode.ucs2\n * @name decode\n * @param {String} string The Unicode input string (UCS-2).\n * @returns {Array} The new array of code points.\n */\nfunction ucs2decode(string) {\n	const output = [];\n	let counter = 0;\n	const length = string.length;\n	while (counter < length) {\n		const value = string.charCodeAt(counter++);\n		if (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n			// It's a high surrogate, and there is a next character.\n			const extra = string.charCodeAt(counter++);\n			if ((extra & 0xFC00) == 0xDC00) { // Low surrogate.\n				output.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n			} else {\n				// It's an unmatched surrogate; only append this code unit, in case the\n				// next code unit is the high surrogate of a surrogate pair.\n				output.push(value);\n				counter--;\n			}\n		} else {\n			output.push(value);\n		}\n	}\n	return output;\n}\n\n/**\n * Creates a string based on an array of numeric code points.\n * @see `punycode.ucs2.decode`\n * @memberOf punycode.ucs2\n * @name encode\n * @param {Array} codePoints The array of numeric code points.\n * @returns {String} The new Unicode string (UCS-2).\n */\nconst ucs2encode = codePoints => String.fromCodePoint(...codePoints);\n\n/**\n * Converts a basic code point into a digit/integer.\n * @see `digitToBasic()`\n * @private\n * @param {Number} codePoint The basic numeric code point value.\n * @returns {Number} The numeric value of a basic code point (for use in\n * representing integers) in the range `0` to `base - 1`, or `base` if\n * the code point does not represent a value.\n */\nconst basicToDigit = function(codePoint) {\n	if (codePoint >= 0x30 && codePoint < 0x3A) {\n		return 26 + (codePoint - 0x30);\n	}\n	if (codePoint >= 0x41 && codePoint < 0x5B) {\n		return codePoint - 0x41;\n	}\n	if (codePoint >= 0x61 && codePoint < 0x7B) {\n		return codePoint - 0x61;\n	}\n	return base;\n};\n\n/**\n * Converts a digit/integer into a basic code point.\n * @see `basicToDigit()`\n * @private\n * @param {Number} digit The numeric value of a basic code point.\n * @returns {Number} The basic code point whose value (when used for\n * representing integers) is `digit`, which needs to be in the range\n * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n * used; else, the lowercase form is used. The behavior is undefined\n * if `flag` is non-zero and `digit` has no uppercase form.\n */\nconst digitToBasic = function(digit, flag) {\n	//  0..25 map to ASCII a..z or A..Z\n	// 26..35 map to ASCII 0..9\n	return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n};\n\n/**\n * Bias adaptation function as per section 3.4 of RFC 3492.\n * https://tools.ietf.org/html/rfc3492#section-3.4\n * @private\n */\nconst adapt = function(delta, numPoints, firstTime) {\n	let k = 0;\n	delta = firstTime ? floor(delta / damp) : delta >> 1;\n	delta += floor(delta / numPoints);\n	for (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n		delta = floor(delta / baseMinusTMin);\n	}\n	return floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n};\n\n/**\n * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n * symbols.\n * @memberOf punycode\n * @param {String} input The Punycode string of ASCII-only symbols.\n * @returns {String} The resulting string of Unicode symbols.\n */\nconst decode = function(input) {\n	// Don't use UCS-2.\n	const output = [];\n	const inputLength = input.length;\n	let i = 0;\n	let n = initialN;\n	let bias = initialBias;\n\n	// Handle the basic code points: let `basic` be the number of input code\n	// points before the last delimiter, or `0` if there is none, then copy\n	// the first basic code points to the output.\n\n	let basic = input.lastIndexOf(delimiter);\n	if (basic < 0) {\n		basic = 0;\n	}\n\n	for (let j = 0; j < basic; ++j) {\n		// if it's not a basic code point\n		if (input.charCodeAt(j) >= 0x80) {\n			error('not-basic');\n		}\n		output.push(input.charCodeAt(j));\n	}\n\n	// Main decoding loop: start just after the last delimiter if any basic code\n	// points were copied; start at the beginning otherwise.\n\n	for (let index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n		// `index` is the index of the next character to be consumed.\n		// Decode a generalized variable-length integer into `delta`,\n		// which gets added to `i`. The overflow checking is easier\n		// if we increase `i` as we go, then subtract off its starting\n		// value at the end to obtain `delta`.\n		const oldi = i;\n		for (let w = 1, k = base; /* no condition */; k += base) {\n\n			if (index >= inputLength) {\n				error('invalid-input');\n			}\n\n			const digit = basicToDigit(input.charCodeAt(index++));\n\n			if (digit >= base) {\n				error('invalid-input');\n			}\n			if (digit > floor((maxInt - i) / w)) {\n				error('overflow');\n			}\n\n			i += digit * w;\n			const t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n			if (digit < t) {\n				break;\n			}\n\n			const baseMinusT = base - t;\n			if (w > floor(maxInt / baseMinusT)) {\n				error('overflow');\n			}\n\n			w *= baseMinusT;\n\n		}\n\n		const out = output.length + 1;\n		bias = adapt(i - oldi, out, oldi == 0);\n\n		// `i` was supposed to wrap around from `out` to `0`,\n		// incrementing `n` each time, so we'll fix that now:\n		if (floor(i / out) > maxInt - n) {\n			error('overflow');\n		}\n\n		n += floor(i / out);\n		i %= out;\n\n		// Insert `n` at position `i` of the output.\n		output.splice(i++, 0, n);\n\n	}\n\n	return String.fromCodePoint(...output);\n};\n\n/**\n * Converts a string of Unicode symbols (e.g. a domain name label) to a\n * Punycode string of ASCII-only symbols.\n * @memberOf punycode\n * @param {String} input The string of Unicode symbols.\n * @returns {String} The resulting Punycode string of ASCII-only symbols.\n */\nconst encode = function(input) {\n	const output = [];\n\n	// Convert the input in UCS-2 to an array of Unicode code points.\n	input = ucs2decode(input);\n\n	// Cache the length.\n	const inputLength = input.length;\n\n	// Initialize the state.\n	let n = initialN;\n	let delta = 0;\n	let bias = initialBias;\n\n	// Handle the basic code points.\n	for (const currentValue of input) {\n		if (currentValue < 0x80) {\n			output.push(stringFromCharCode(currentValue));\n		}\n	}\n\n	const basicLength = output.length;\n	let handledCPCount = basicLength;\n\n	// `handledCPCount` is the number of code points that have been handled;\n	// `basicLength` is the number of basic code points.\n\n	// Finish the basic string with a delimiter unless it's empty.\n	if (basicLength) {\n		output.push(delimiter);\n	}\n\n	// Main encoding loop:\n	while (handledCPCount < inputLength) {\n\n		// All non-basic code points < n have been handled already. Find the next\n		// larger one:\n		let m = maxInt;\n		for (const currentValue of input) {\n			if (currentValue >= n && currentValue < m) {\n				m = currentValue;\n			}\n		}\n\n		// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,\n		// but guard against overflow.\n		const handledCPCountPlusOne = handledCPCount + 1;\n		if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n			error('overflow');\n		}\n\n		delta += (m - n) * handledCPCountPlusOne;\n		n = m;\n\n		for (const currentValue of input) {\n			if (currentValue < n && ++delta > maxInt) {\n				error('overflow');\n			}\n			if (currentValue === n) {\n				// Represent delta as a generalized variable-length integer.\n				let q = delta;\n				for (let k = base; /* no condition */; k += base) {\n					const t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n					if (q < t) {\n						break;\n					}\n					const qMinusT = q - t;\n					const baseMinusT = base - t;\n					output.push(\n						stringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n					);\n					q = floor(qMinusT / baseMinusT);\n				}\n\n				output.push(stringFromCharCode(digitToBasic(q, 0)));\n				bias = adapt(delta, handledCPCountPlusOne, handledCPCount === basicLength);\n				delta = 0;\n				++handledCPCount;\n			}\n		}\n\n		++delta;\n		++n;\n\n	}\n	return output.join('');\n};\n\n/**\n * Converts a Punycode string representing a domain name or an email address\n * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n * it doesn't matter if you call it on a string that has already been\n * converted to Unicode.\n * @memberOf punycode\n * @param {String} input The Punycoded domain name or email address to\n * convert to Unicode.\n * @returns {String} The Unicode representation of the given Punycode\n * string.\n */\nconst toUnicode = function(input) {\n	return mapDomain(input, function(string) {\n		return regexPunycode.test(string)\n			? decode(string.slice(4).toLowerCase())\n			: string;\n	});\n};\n\n/**\n * Converts a Unicode string representing a domain name or an email address to\n * Punycode. Only the non-ASCII parts of the domain name will be converted,\n * i.e. it doesn't matter if you call it with a domain that's already in\n * ASCII.\n * @memberOf punycode\n * @param {String} input The domain name or email address to convert, as a\n * Unicode string.\n * @returns {String} The Punycode representation of the given domain name or\n * email address.\n */\nconst toASCII = function(input) {\n	return mapDomain(input, function(string) {\n		return regexNonASCII.test(string)\n			? 'xn--' + encode(string)\n			: string;\n	});\n};\n\n/*--------------------------------------------------------------------------*/\n\n/** Define the public API */\nconst punycode = {\n	/**\n	 * A string representing the current Punycode.js version number.\n	 * @memberOf punycode\n	 * @type String\n	 */\n	'version': '2.3.1',\n	/**\n	 * An object of methods to convert from JavaScript's internal character\n	 * representation (UCS-2) to Unicode code points, and back.\n	 * @see <https://mathiasbynens.be/notes/javascript-encoding>\n	 * @memberOf punycode\n	 * @type Object\n	 */\n	'ucs2': {\n		'decode': ucs2decode,\n		'encode': ucs2encode\n	},\n	'decode': decode,\n	'encode': encode,\n	'toASCII': toASCII,\n	'toUnicode': toUnicode\n};\n\nmodule.exports = punycode;\n";
-const ESBUILD_WASM_VERSION = "0.20.0";
+const ESBUILD_WASM_VERSION = "0.28.2";
 const ROLLUP_BROWSER_VERSION = "4.63.1";
 const ESBUILD_WASM_ESM_CDN = `https://esm.sh/esbuild-wasm@${ESBUILD_WASM_VERSION}`;
 const ESBUILD_WASM_BINARY_CDN = `https://unpkg.com/esbuild-wasm@${ESBUILD_WASM_VERSION}/esbuild.wasm`;
@@ -36145,7 +36217,7 @@ function buildSync(_options2) {
   throw new Error("buildSync is not available in browser. Use build() instead.");
 }
 function version() {
-  return "0.20.0";
+  return ESBUILD_WASM_VERSION;
 }
 async function context(options) {
   let disposed = false;
@@ -39655,10 +39727,28 @@ function createRequire(vfs2, fsShim, process2, currentDir, moduleCache, options,
     }
     return loadModule(resolved).exports;
   };
-  require2.resolve = (id) => {
+  require2.resolve = (id, options2) => {
     if (id === "fs" || id === "process" || id.startsWith("node:") || builtinModules$1.includes(id)) {
       return id;
     }
+    if (options2 && options2.paths !== void 0) {
+      if (!Array.isArray(options2.paths)) {
+        throw Object.assign(new TypeError(`The property 'options.paths' must be an Array. Received ${String(options2.paths)}`), { code: "ERR_INVALID_ARG_VALUE" });
+      }
+      options2.paths.forEach((from, index2) => {
+        if (typeof from !== "string") throw Object.assign(new TypeError(`The "paths[${index2}]" argument must be of type string. Received ${typeof from}`), { code: "ERR_INVALID_ARG_TYPE" });
+      });
+      const requireStack = parentModule && typeof parentModule.filename === "string" ? [parentModule.filename] : [];
+      for (const from of options2.paths) {
+        try {
+          return resolveModule(id, resolve(process2.cwd(), from));
+        } catch {
+        }
+      }
+      throw Object.assign(new Error(`Cannot find module '${id}'${requireStack.length ? `
+Require stack:
+- ${requireStack.join("\n- ")}` : ""}`), { code: "MODULE_NOT_FOUND", requireStack });
+    }
     return resolveModule(id, currentDir);
   };
   require2.cache = moduleCache;
@@ -40338,7 +40428,7 @@ class WorkerRuntime {
     this.worker = new Worker(
       new URL(
         /* @vite-ignore */
-        "/assets/runtime-worker-CSaX_wiK.js",
+        "/assets/runtime-worker-4iI8R3l-.js",
         import.meta.url
       ),
       { type: "module" }

package/dist/virtual-fs.d.ts

@@ -204,6 +204,16 @@ export declare class VirtualFS {
      * read and write unless it answers appends itself.
      */
     appendFileSync(path: string, data: string | Uint8Array): void;
+    /**
+     * Bytes written into a file at `position`, as a disk takes them: a gap past
+     * the end reads as zeros, and the file grows in its own buffer as an append
+     * grows it. A database rewrites its log and its pages a page at a time;
+     * writing the whole file again for each page copied Postgres's 16 MB
+     * write-ahead log at every commit. A tree that keeps its files elsewhere
+     * (its own writeFileSync) is written through its own read and write unless
+     * it answers this itself.
+     */
+    writeAtSync(path: string, data: Uint8Array, position: number): void;
     /**
      * Create directory, optionally with recursive parent creation
      */

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@volter/tabnode",
-  "version": "0.5.45",
+  "version": "0.5.47",
   "description": "Node's own library, in a browser tab.",
   "type": "module",
   "license": "MIT",

package/src/config/cdn.ts

@@ -4,7 +4,16 @@
  * written against.
  */
 
-export const ESBUILD_WASM_VERSION = '0.20.0';
+// esbuild-wasm 0.20.0 is built with Go 1.20.12, whose wasm `IndexByte`
+// sign-extends the address `memchr` answers (golang/go#65571, fixed in Go 1.23
+// and backported to 1.21.13 and 1.22.6): once esbuild's heap passes 2 GiB of
+// linear memory, a search that finds its byte in a buffer above that line
+// answers about -4294967295, and esbuild panics slicing with it
+// (`slice bounds out of range [:-4294967295]` in the printer, and outside the
+// linker's recover in `validatePathTemplate`, which ends the service). A long
+// shared instance gets there: a Next application's host pack build did at 2.0
+// GiB on 0.20.0, and ran to the end on 0.28.2.
+export const ESBUILD_WASM_VERSION = '0.28.2';
 export const ROLLUP_BROWSER_VERSION = '4.63.1';
 
 export const ESBUILD_WASM_ESM_CDN = `https://esm.sh/esbuild-wasm@${ESBUILD_WASM_VERSION}`;

package/src/node-lib/binding/fs.ts

@@ -630,6 +630,30 @@ const fsBinding = {
         if (position === null || position === undefined || position < 0) file.position = end + slice.length;
         return slice.length;
       }
+      // A write elsewhere in the file goes where it lands, when the tree takes one: a database's page or log
+      // record costs its own bytes, not the file's (Postgres's commits wrote its whole 16 MB log again).
+      if (typeof (tree as { writeAtSync?: unknown }).writeAtSync === 'function') {
+        const at = position === null || position === undefined || position < 0 ? file.position : position;
+        (tree as { writeAtSync(path: string, data: Uint8Array, position: number): void }).writeAtSync(file.path, slice, at);
+        // This descriptor's copy takes the same bytes, in a buffer of its own with room, as an append's does: a
+        // read after the write is answered from it rather than by reading the whole file again.
+        if (file.cached !== undefined && slice.length > 0) {
+          const cached = file.cached;
+          const length = Math.max(cached.length, at + slice.length);
+          let room = file.room;
+          if (!room || cached.buffer !== room.buffer || cached.byteOffset !== 0 || room.byteLength < length) {
+            room = new Uint8Array(Math.max(length, cached.length * 2, 4096));
+            room.set(cached, 0);
+          } else if (at > cached.length) {
+            room.fill(0, cached.length, at);
+          }
+          room.set(slice, at);
+          file.cached = room.subarray(0, length);
+          file.room = room;
+        }
+        if (position === null || position === undefined || position < 0) file.position = at + slice.length;
+        return slice.length;
+      }
       const existing = file.cached ?? (tree.existsSync(file.path) ? tree.readFileSync(file.path) as Uint8Array : new Uint8Array(0));
       const at = (file.flags & flagBits().append) !== 0 ? existing.length
         : position === null || position === undefined || position < 0 ? file.position : position;

package/src/runtime.ts

@@ -2410,10 +2410,28 @@ function createRequire(
     return loadModule(resolved).exports;
   };
 
-  require.resolve = (id: string): string => {
+  require.resolve = (id: string, options?: { paths?: unknown }): string => {
     if (id === 'fs' || id === 'process' || id.startsWith('node:') || moduleShim.builtinModules.includes(id)) {
       return id;
     }
+    // Node's `options.paths`: each directory, in order, is where the lookup starts, as if the request came from a
+    // module there, and the first that resolves wins. The option was ignored and every lookup started at the caller,
+    // so a module installed in one tree could not find a package another tree holds (a World's injector resolving
+    // the application's own Prisma adapter from the application's directory). Node 12.
+    if (options && options.paths !== undefined) {
+      if (!Array.isArray(options.paths)) {
+        throw Object.assign(new TypeError(`The property 'options.paths' must be an Array. Received ${String(options.paths)}`), { code: 'ERR_INVALID_ARG_VALUE' });
+      }
+      options.paths.forEach((from, index) => {
+        if (typeof from !== 'string') throw Object.assign(new TypeError(`The "paths[${index}]" argument must be of type string. Received ${typeof from}`), { code: 'ERR_INVALID_ARG_TYPE' });
+      });
+      // A relative entry is the process's working directory's, as Node's Module._resolveFilename makes it.
+      const requireStack = parentModule && typeof parentModule.filename === 'string' ? [parentModule.filename] : [];
+      for (const from of options.paths as string[]) {
+        try { return resolveModule(id, pathShim.resolve(process.cwd(), from)); } catch { /* the next directory */ }
+      }
+      throw Object.assign(new Error(`Cannot find module '${id}'${requireStack.length ? `\nRequire stack:\n- ${requireStack.join('\n- ')}` : ''}`), { code: 'MODULE_NOT_FOUND', requireStack });
+    }
     return resolveModule(id, currentDir);
   };
 

package/src/shims/esbuild.ts

@@ -5,7 +5,7 @@
 
 import { heldWork } from '../host-globals';
 import type { VirtualFS } from '../virtual-fs';
-import { ESBUILD_WASM_BINARY_CDN, ESBUILD_WASM_BROWSER_CDN } from '../config/cdn';
+import { ESBUILD_WASM_BINARY_CDN, ESBUILD_WASM_BROWSER_CDN, ESBUILD_WASM_VERSION } from '../config/cdn';
 import { __nodeResolverFor } from '../node-resolver';
 
 /**
@@ -1605,7 +1605,7 @@ export function buildSync(_options: BuildOptions): BuildResult {
  * Get the esbuild version
  */
 export function version(): string {
-  return '0.20.0'; // Version of esbuild-wasm we're using
+  return ESBUILD_WASM_VERSION; // Version of esbuild-wasm we're using
 }
 
 // A build that named an output wrote nothing and Vite's own build, which

package/src/virtual-fs.ts

@@ -324,6 +324,9 @@ export class VirtualFS {
     if (existed && existing!.type === 'file') {
       existing!.content = content;
       existing!.mtime = Date.now();
+      // the caller's bytes, which it may still hold: never written in place
+      (existing as FSNode & { room?: Uint8Array; lent?: boolean }).room = undefined;
+      (existing as FSNode & { lent?: boolean }).lent = true;
     } else {
       parent.children!.set(basename, {
         type: 'file',
@@ -646,6 +649,10 @@ export class VirtualFS {
       return this.decoder.decode(content);
     }
 
+    // The bytes are handed out as they are, so a caller (a copy, a read
+    // stream's chunk) may hold them: a later write into the file does not
+    // change them in place (writeAtSync), it moves the file to bytes of its own.
+    (node as FSNode & { lent?: boolean }).lent = true;
     return content;
   }
 
@@ -698,6 +705,58 @@ export class VirtualFS {
     if (this.eventListeners.get('change')?.size) this.emit('change', normalized, this.decoder.decode(node.content));
   }
 
+  /**
+   * Bytes written into a file at `position`, as a disk takes them: a gap past
+   * the end reads as zeros, and the file grows in its own buffer as an append
+   * grows it. A database rewrites its log and its pages a page at a time;
+   * writing the whole file again for each page copied Postgres's 16 MB
+   * write-ahead log at every commit. A tree that keeps its files elsewhere
+   * (its own writeFileSync) is written through its own read and write unless
+   * it answers this itself.
+   */
+  writeAtSync(path: string, data: Uint8Array, position: number): void {
+    if (this.writeFileSync !== VirtualFS.prototype.writeFileSync) {
+      const existing = this.existsSync(path) ? this.readFileSync(path) as Uint8Array : new Uint8Array(0);
+      if (data.byteLength === 0 && this.existsSync(path)) return;
+      const whole = new Uint8Array(Math.max(existing.byteLength, position + data.byteLength));
+      whole.set(existing, 0);
+      whole.set(data, position);
+      this.writeFileSync(path, whole);
+      return;
+    }
+    const normalized = this.normalizePath(path);
+    const node = this.getNode(normalized);
+    if (!node) {
+      const whole = new Uint8Array(position + data.byteLength);
+      whole.set(data, position);
+      this.writeFileSyncInternal(normalized, whole, true);
+      return;
+    }
+    if (node.type !== 'file') throw createNodeError('EISDIR', 'open', path);
+    this.assertWritable(normalized, 'open');
+    // Node's write of no bytes changes nothing, past the end included
+    if (data.byteLength === 0) return;
+    const current = node.content ?? new Uint8Array(0);
+    const length = Math.max(current.byteLength, position + data.byteLength);
+    const held = node as FSNode & { room?: Uint8Array; lent?: boolean };
+    let room = held.room;
+    // Written in place only into bytes the file owns and nobody else holds: a copy made from the file
+    // (writeFileSync(dest, readFileSync(src))) or a read's result shares them, and would change with it.
+    if (!room || held.lent || current.buffer !== room.buffer || current.byteOffset !== 0 || room.byteLength < length) {
+      room = new Uint8Array(Math.max(length, current.byteLength * 2, 4096));
+      room.set(current, 0);
+      held.lent = false;
+    } else if (position > current.byteLength) {
+      room.fill(0, current.byteLength, position);
+    }
+    room.set(data, position);
+    node.content = room.subarray(0, length);
+    (node as FSNode & { room?: Uint8Array }).room = room;
+    node.mtime = Date.now();
+    this.notifyWatchers(normalized, 'change');
+    if (this.eventListeners.get('change')?.size) this.emit('change', normalized, this.decoder.decode(node.content));
+  }
+
   /**
    * Create directory, optionally with recursive parent creation
    */