numbl 0.4.12 → 0.4.14

package/dist-lib/lib.js

@@ -819,6 +819,114 @@ var valuesAreEqual = (a, b) => {
   }
 };
 
+// src/numbl-core/runtime/datetime-format.ts
+var MONTH_ABBR = [
+  "Jan",
+  "Feb",
+  "Mar",
+  "Apr",
+  "May",
+  "Jun",
+  "Jul",
+  "Aug",
+  "Sep",
+  "Oct",
+  "Nov",
+  "Dec"
+];
+var MONTH_FULL = [
+  "January",
+  "February",
+  "March",
+  "April",
+  "May",
+  "June",
+  "July",
+  "August",
+  "September",
+  "October",
+  "November",
+  "December"
+];
+function pad(n, width) {
+  return String(n).padStart(width, "0");
+}
+function formatDatetimePattern(pattern, year, month, day, hour, minute, second) {
+  const wholeSec = Math.floor(second);
+  const frac = second - wholeSec;
+  const monthIdx = Math.max(0, Math.min(11, Math.floor(month) - 1));
+  const formatToken = (c, n) => {
+    switch (c) {
+      case "y":
+      case "u":
+        if (n === 2) return pad(Math.floor(year) % 100, 2);
+        return pad(Math.floor(year), n);
+      case "M":
+        if (n === 1) return String(Math.floor(month));
+        if (n === 2) return pad(Math.floor(month), 2);
+        if (n === 3) return MONTH_ABBR[monthIdx];
+        return MONTH_FULL[monthIdx];
+      case "d":
+        return pad(Math.floor(day), n);
+      case "H":
+        return pad(Math.floor(hour), n);
+      case "h":
+        return pad(Math.floor(hour) % 12 || 12, n);
+      case "m":
+        return pad(Math.floor(minute), n);
+      case "s":
+        return pad(wholeSec, n);
+      case "S":
+        return pad(Math.floor(frac * Math.pow(10, n)), n);
+      case "a":
+        return hour < 12 ? "AM" : "PM";
+      default:
+        throw new RuntimeError(
+          `datetime: unsupported format token '${c.repeat(n)}' in '${pattern}'`
+        );
+    }
+  };
+  let out = "";
+  let i = 0;
+  while (i < pattern.length) {
+    const c = pattern[i];
+    if (c === "'") {
+      i++;
+      let lit = "";
+      let closed = false;
+      while (i < pattern.length) {
+        if (pattern[i] === "'") {
+          if (pattern[i + 1] === "'") {
+            lit += "'";
+            i += 2;
+            continue;
+          }
+          i++;
+          closed = true;
+          break;
+        }
+        lit += pattern[i++];
+      }
+      if (!closed && lit !== "")
+        throw new RuntimeError(
+          `datetime: unterminated quoted literal in format '${pattern}'`
+        );
+      out += lit === "" ? "'" : lit;
+      continue;
+    }
+    if (!/[a-zA-Z]/.test(c)) {
+      out += c;
+      i++;
+      continue;
+    }
+    let j = i;
+    while (j < pattern.length && pattern[j] === c) j++;
+    out += formatToken(c, j - i);
+    i = j;
+  }
+  return out;
+}
+
 // src/numbl-core/runtime/display.ts
 function displayValue(v) {
   if (isRuntimeNumber(v)) {
@@ -1093,6 +1201,13 @@ function formatDatetimeOrDuration(v) {
   if (v.className === "duration") return formatDurationInstance(v);
   return null;
 }
+function textField(v, name) {
+  const fv = v.fields.get(name);
+  if (fv === void 0) return null;
+  if (isRuntimeString(fv)) return fv;
+  if (isRuntimeChar(fv)) return fv.value;
+  return null;
+}
 function formatDatetimeInstance(v) {
   const year = numField(v, "Year");
   const month = numField(v, "Month");
@@ -1102,6 +1217,10 @@ function formatDatetimeInstance(v) {
   const second = numField(v, "Second");
   if (year === null || month === null || day === null || hour === null || minute === null || second === null)
     return null;
+  const fmt = textField(v, "Format");
+  if (fmt !== null && fmt !== "") {
+    return formatDatetimePattern(fmt, year, month, day, hour, minute, second);
+  }
   const mIdx = Math.max(0, Math.min(11, Math.floor(month) - 1));
   const mon = DATETIME_MONTH_ABBR[mIdx];
   const dd = String(Math.floor(day)).padStart(2, "0");
@@ -22321,8 +22440,8 @@ function sprintfFormat(fmt, args) {
               if (width > 0) {
                 const padChar = zeroPad ? "0" : " ";
                 const padLen = Math.max(0, width - sign.length - s.length);
-                const pad = padChar.repeat(padLen);
-                result += leftAlign ? sign + s + " ".repeat(padLen) : zeroPad ? sign + pad + s : pad + sign + s;
+                const pad2 = padChar.repeat(padLen);
+                result += leftAlign ? sign + s + " ".repeat(padLen) : zeroPad ? sign + pad2 + s : pad2 + sign + s;
               } else {
                 result += sign + s;
               }
@@ -25046,6 +25165,17 @@ function indexIntoRTValue(base, indices) {
         return base.elements[i];
       }
       if (isRuntimeTensor(idx)) {
+        if (idx._isLogical) {
+          const newElements2 = [];
+          for (let k = 0; k < idx.data.length; k++) {
+            if (idx.data[k] !== 0) {
+              if (k >= base.elements.length)
+                throw new RuntimeError("Index exceeds struct array bounds");
+              newElements2.push(base.elements[k]);
+            }
+          }
+          return RTV.structArray(base.fieldNames, newElements2);
+        }
         const newElements = [];
         for (let k = 0; k < idx.data.length; k++) {
           const i = Math.round(idx.data[k]) - 1;
@@ -38167,13 +38297,19 @@ registerIBuiltin({
   resolve: (argTypes) => {
     if (argTypes.length !== 1) return null;
     const a = argTypes[0];
-    if (a.kind !== "char" && a.kind !== "string" && a.kind !== "number" && a.kind !== "tensor" && a.kind !== "cell" && a.kind !== "unknown")
+    if (a.kind !== "char" && a.kind !== "string" && a.kind !== "number" && a.kind !== "tensor" && a.kind !== "cell" && a.kind !== "unknown" && // datetime/duration only — other classes keep their own char methods
+    // (or the generic "does not support these argument types" error).
+    !(a.kind === "class_instance" && (a.className === "datetime" || a.className === "duration")))
       return null;
     return {
       outputTypes: [{ kind: "char" }],
       apply: (args) => {
         const v = args[0];
         if (isRuntimeChar(v)) return v;
+        if (isRuntimeClassInstance(v)) {
+          const s = formatDatetimeOrDuration(v);
+          if (s !== null) return RTV.char(s);
+        }
         if (isRuntimeString(v)) return RTV.char(v);
         if (isRuntimeNumber(v))
           return RTV.char(String.fromCharCode(Math.round(v)));
@@ -40561,7 +40697,7 @@ defineBuiltin({
           const result = invComplexJS(A.data, A.imag, n);
           return RTV.tensor(result.re, [n, n], result.im);
         }
-        const bridge = getEffectiveBridge("inv");
+        const bridge = getEffectiveBridge("inv", "inv");
         return RTV.tensor(bridge.inv(toF64(A.data), n), [n, n]);
       }
     }
@@ -42908,6 +43044,16 @@ defineBuiltin({
           parseReshapeDims(args, 1);
           return v;
         }
+        if (isRuntimeCell(v)) {
+          const total = v.data.length;
+          const s = parseReshapeDims(args, total);
+          while (s.length > 2 && s[s.length - 1] === 1) s.pop();
+          if (s.length > 2)
+            throw new RuntimeError("reshape: cell arrays must be 2-D");
+          const nr = s[0];
+          const nc = s.length >= 2 ? s[1] : 1;
+          return RTV.cell(v.data.slice(), [nr, nc]);
+        }
         if (isRuntimeClassInstanceArray(v)) {
           const total = v.elements.length;
           const s = parseReshapeDims(args, total);
@@ -48654,6 +48800,32 @@ function datetimeFromUtcMs(ms) {
 function datetimeFromDatenum(dn) {
   return datetimeFromUtcMs((dn - MATLAB_EPOCH_DAYS) * 864e5);
 }
+function withTimeZoneFormat(dt, timeZone, format) {
+  if (timeZone === void 0 && format === void 0) return dt;
+  const fields = new Map(dt.fields);
+  if (timeZone !== void 0) fields.set("TimeZone", RTV.char(timeZone));
+  if (format !== void 0) fields.set("Format", RTV.char(format));
+  return new RuntimeClassInstance("datetime", fields, false);
+}
+function todayParts(offsetDays, utc) {
+  const now = /* @__PURE__ */ new Date();
+  if (utc) {
+    const d2 = new Date(
+      Date.UTC(
+        now.getUTCFullYear(),
+        now.getUTCMonth(),
+        now.getUTCDate() + offsetDays
+      )
+    );
+    return [d2.getUTCFullYear(), d2.getUTCMonth() + 1, d2.getUTCDate()];
+  }
+  const d = new Date(
+    now.getFullYear(),
+    now.getMonth(),
+    now.getDate() + offsetDays
+  );
+  return [d.getFullYear(), d.getMonth() + 1, d.getDate()];
+}
 function makeDuration(totalSeconds) {
   const fields = /* @__PURE__ */ new Map([
     ["Seconds", RTV.num(totalSeconds)]
@@ -48703,9 +48875,10 @@ registerIBuiltin({
       "t = datetime('now' | 'today' | 'yesterday' | 'tomorrow')",
       "t = datetime(Y, M, D)",
       "t = datetime(Y, M, D, H, MI, S)",
-      "t = datetime(X, 'ConvertFrom', dateType)"
+      "t = datetime(X, 'ConvertFrom', dateType)",
+      "t = datetime(..., 'TimeZone', tz, 'Format', fmt)"
     ],
-    description: "Create a datetime value. Supported dateType values for ConvertFrom: 'datenum', 'posixtime', 'excel', 'excel1904'."
+    description: "Create a datetime value. Supported dateType values for ConvertFrom: 'datenum', 'posixtime', 'excel', 'excel1904'. Trailing 'TimeZone' (only '', 'local', 'UTC') and 'Format' name-value pairs are supported; the Format pattern is used by char() and display."
   },
   resolve: () => ({
     outputTypes: [
@@ -48717,75 +48890,83 @@ registerIBuiltin({
       }
     ],
     apply: (args) => {
-      if (args.length === 0) {
-        return datetimeFromDate(/* @__PURE__ */ new Date());
+      let timeZone;
+      let format;
+      let positional = args;
+      while (positional.length >= 2) {
+        const name = argToString(positional[positional.length - 2]);
+        if (name === null) break;
+        const lc = name.toLowerCase();
+        if (lc !== "timezone" && lc !== "format") break;
+        const value = argToString(positional[positional.length - 1]);
+        if (value === null)
+          throw new RuntimeError(`datetime: ${name} value must be text`);
+        if (lc === "timezone") timeZone = value;
+        else format = value;
+        positional = positional.slice(0, -2);
+      }
+      const tzLc = timeZone?.toLowerCase();
+      if (tzLc !== void 0 && tzLc !== "" && tzLc !== "local" && tzLc !== "utc") {
+        throw new RuntimeError(
+          `datetime: unsupported TimeZone '${timeZone}' (supported: '', 'local', 'UTC')`
+        );
       }
-      if (args.length === 1) {
-        const s = argToString(args[0]);
+      const utc = tzLc === "utc";
+      const finish = (dt) => withTimeZoneFormat(dt, timeZone, format);
+      if (positional.length === 0) {
+        return finish(
+          utc ? datetimeFromUtcMs(Date.now()) : datetimeFromDate(/* @__PURE__ */ new Date())
+        );
+      }
+      if (positional.length === 1) {
+        const s = argToString(positional[0]);
         if (s !== null) {
-          const now = /* @__PURE__ */ new Date();
           const lc = s.toLowerCase();
-          if (lc === "now") return datetimeFromDate(now);
-          if (lc === "today") {
-            return makeDatetime(
-              now.getFullYear(),
-              now.getMonth() + 1,
-              now.getDate(),
-              0,
-              0,
-              0
+          if (lc === "now") {
+            return finish(
+              utc ? datetimeFromUtcMs(Date.now()) : datetimeFromDate(/* @__PURE__ */ new Date())
             );
           }
-          if (lc === "yesterday" || lc === "tomorrow") {
-            const d = new Date(
-              now.getFullYear(),
-              now.getMonth(),
-              now.getDate() + (lc === "tomorrow" ? 1 : -1)
-            );
-            return makeDatetime(
-              d.getFullYear(),
-              d.getMonth() + 1,
-              d.getDate(),
-              0,
-              0,
-              0
-            );
+          if (lc === "today" || lc === "yesterday" || lc === "tomorrow") {
+            const offset = lc === "tomorrow" ? 1 : lc === "yesterday" ? -1 : 0;
+            const [Y, M, D] = todayParts(offset, utc);
+            return finish(makeDatetime(Y, M, D, 0, 0, 0));
           }
           throw new RuntimeError(
             `datetime: unrecognized relative-day string '${s}'`
           );
         }
       }
-      if (args.length === 3) {
-        const flag = argToString(args[1]);
-        const kind = argToString(args[2]);
+      if (positional.length === 3) {
+        const flag = argToString(positional[1]);
+        const kind = argToString(positional[2]);
         if (flag !== null && flag.toLowerCase() === "convertfrom") {
           if (kind === null)
             throw new RuntimeError("datetime: dateType must be text");
-          const x = toNumber(args[0]);
+          const x = toNumber(positional[0]);
           const k = kind.toLowerCase();
-          if (k === "datenum") return datetimeFromDatenum(x);
-          if (k === "posixtime") return datetimeFromUtcMs(x * 1e3);
+          if (k === "datenum") return finish(datetimeFromDatenum(x));
+          if (k === "posixtime") return finish(datetimeFromUtcMs(x * 1e3));
           if (k === "excel") {
-            return datetimeFromUtcMs((x - 25569) * 864e5);
+            return finish(datetimeFromUtcMs((x - 25569) * 864e5));
           }
           if (k === "excel1904") {
-            return datetimeFromUtcMs((x - 24107) * 864e5);
+            return finish(datetimeFromUtcMs((x - 24107) * 864e5));
           }
           throw new RuntimeError(
             `datetime: unsupported ConvertFrom type '${kind}'`
           );
         }
       }
-      if (args.length === 3 || args.length === 6 || args.length === 7) {
-        const Y = toNumber(args[0]);
-        const M = toNumber(args[1]);
-        const D = toNumber(args[2]);
-        const H2 = args.length >= 6 ? toNumber(args[3]) : 0;
-        const MI = args.length >= 6 ? toNumber(args[4]) : 0;
-        const S = args.length >= 6 ? toNumber(args[5]) : 0;
-        const MS = args.length >= 7 ? toNumber(args[6]) : 0;
-        return makeDatetime(Y, M, D, H2, MI, S + MS / 1e3);
+      if (positional.length === 3 || positional.length === 6 || positional.length === 7) {
+        const Y = toNumber(positional[0]);
+        const M = toNumber(positional[1]);
+        const D = toNumber(positional[2]);
+        const H2 = positional.length >= 6 ? toNumber(positional[3]) : 0;
+        const MI = positional.length >= 6 ? toNumber(positional[4]) : 0;
+        const S = positional.length >= 6 ? toNumber(positional[5]) : 0;
+        const MS = positional.length >= 7 ? toNumber(positional[6]) : 0;
+        return finish(makeDatetime(Y, M, D, H2, MI, S + MS / 1e3));
       }
       throw new RuntimeError(
         `datetime: unsupported argument pattern (nargin=${args.length})`
@@ -56090,6 +56271,7 @@ var SPECIAL_BUILTIN_NAMES = [
   "copyfile",
   "fileattrib",
   "unzip",
+  "zip",
   "dir",
   "warning",
   "input",
@@ -57202,6 +57384,26 @@ function registerSpecialBuiltins(rt) {
     }
     return void 0;
   });
+  registerSpecial("zip", (nargout, args) => {
+    const io = requireFileIO();
+    if (!io.zip)
+      throw new RuntimeError("zip is not available in this environment");
+    const margs = args.map((a) => ensureRuntimeValue(a));
+    if (margs.length < 2)
+      throw new RuntimeError("zip requires at least 2 arguments");
+    let zipfilename = toString(margs[0]);
+    const base = zipfilename.split(/[/\\]/).pop() ?? zipfilename;
+    if (!base.includes(".")) zipfilename += ".zip";
+    const fnames = margs[1];
+    const filenames = isRuntimeCell(fnames) ? fnames.data.map((v) => toString(ensureRuntimeValue(v))) : [toString(fnames)];
+    const rootdir = margs.length >= 3 ? toString(margs[2]) : ".";
+    const entryNames = io.zip(zipfilename, filenames, rootdir);
+    if (nargout >= 1) {
+      const cellData = entryNames.map((f) => RTV.char(f));
+      return RTV.cell(cellData, [1, cellData.length]);
+    }
+    return void 0;
+  });
   registerSpecial("dir", (nargout, args) => {
     const io = requireFileIO();
     if (!io.listDir)
@@ -61069,8 +61271,8 @@ function padExtent(e, tight) {
     return [min2, max2];
   }
   if (tight) return [min2, max2];
-  const pad = (max2 - min2) * 0.05;
-  return [min2 - pad, max2 + pad];
+  const pad2 = (max2 - min2) * 0.05;
+  return [min2 - pad2, max2 + pad2];
 }
 function applyExplicit(auto, explicit) {
   if (!explicit) return auto;
@@ -65895,6 +66097,12 @@ function evalMember(expr, nargout) {
     }
   }
   const base = this.evalExpr(expr.base);
+  const baseRv = ensureRuntimeValue(base);
+  if (isRuntimeStructArray(baseRv) && baseRv.elements.length !== 1) {
+    return baseRv.elements.map(
+      (el) => ensureRuntimeValue(this.rt.getMember(el, expr.name))
+    );
+  }
   return this.rt.getMember(base, expr.name);
 }
 function tryExtractDottedName(expr) {
@@ -66106,12 +66314,31 @@ function evalCellLiteral(expr) {
     }
     return RTV.cell(elements2, [1, elements2.length]);
   }
-  const numRows = expr.rows.length;
-  const numCols = expr.rows[0].length;
+  const rowValues = expr.rows.map((row) => {
+    const vals = [];
+    for (const e of row) {
+      const v = this.evalExpr(e);
+      if (Array.isArray(v)) {
+        for (const elem of v) vals.push(ensureRuntimeValue(elem));
+      } else {
+        vals.push(ensureRuntimeValue(v));
+      }
+    }
+    return vals;
+  });
+  const numRows = rowValues.length;
+  const numCols = rowValues[0].length;
+  for (const rv of rowValues) {
+    if (rv.length !== numCols) {
+      throw new RuntimeError(
+        "Cell array rows must have the same number of columns"
+      );
+    }
+  }
   const elements = [];
   for (let c = 0; c < numCols; c++) {
     for (let r = 0; r < numRows; r++) {
-      elements.push(ensureRuntimeValue(this.evalExpr(expr.rows[r][c])));
+      elements.push(rowValues[r][c]);
     }
   }
   return RTV.cell(elements, [numRows, numCols]);
@@ -70586,8 +70813,8 @@ function mtoc2_sprintf_format(fmt, args) {
               if (width > 0) {
                 const padChar = zeroPad ? "0" : " ";
                 const padLen = Math.max(0, width - sign.length - s.length);
-                const pad = padChar.repeat(padLen);
-                result += leftAlign ? sign + s + " ".repeat(padLen) : zeroPad ? sign + pad + s : pad + sign + s;
+                const pad2 = padChar.repeat(padLen);
+                result += leftAlign ? sign + s + " ".repeat(padLen) : zeroPad ? sign + pad2 + s : pad2 + sign + s;
               } else {
                 result += sign + s;
               }
@@ -70689,6 +70916,24 @@ function mtoc2_sprintf_format(fmt, args) {
           case "t":
             result += "	";
             break;
+          case "r":
+            result += "\r";
+            break;
+          case "a":
+            result += "\x07";
+            break;
+          case "b":
+            result += "\b";
+            break;
+          case "f":
+            result += "\f";
+            break;
+          case "v":
+            result += "\v";
+            break;
+          case "0":
+            result += "\0";
+            break;
           case "\\":
             result += "\\";
             break;
@@ -70872,8 +71117,8 @@ function disp_complex_slice(re, im, offset, rows, cols) {
     for (let c = 0; c < cols; c++) {
       const idx = r + c * rows;
       const cell = cells[idx];
-      const pad = colWidths[c] - cell.length;
-      for (let i = 0; i < pad; i++) line += " ";
+      const pad2 = colWidths[c] - cell.length;
+      for (let i = 0; i < pad2; i++) line += " ";
       line += cell;
       if (c < cols - 1) line += "   ";
     }
@@ -72285,6 +72530,14 @@ function mtoc2_tensor_mtimes_real(a, b) {
       `mtoc2_tensor_mtimes_real: inner dimensions disagree (${k} vs ${k2})`
     );
   }
+  if (typeof $matmulAccel === "function") {
+    const accel = $matmulAccel(a.data, m, k, b.data, n);
+    if (accel) {
+      const acc = mtoc2_tensor_alloc(m, n);
+      acc.data.set(accel);
+      return acc;
+    }
+  }
   const r = mtoc2_tensor_alloc(m, n);
   for (let j = 0; j < n; j++) {
     for (let i = 0; i < m; i++) {
@@ -73458,7 +73711,7 @@ var JS_SNIPPETS = {
   "error_fmt.js": "// JS sibling of `error_fmt.h`. Format the message + arguments and\n// throw a runtime error. Mirrors numbl's `error(...)` behavior\n// (stderr + halt).\n//\n// The thrown error carries an `identifier` string property so a\n// `try / catch ME` arm in the interpreter can populate the `ME`\n// struct's `identifier` field. When the caller passes no identifier\n// (the common `error('msg')` form), it's the empty string.\n\n\nfunction mtoc2_error_fmt(fmt, ...args) {\n  const msg = mtoc2_sprintf_format(fmt, args);\n  // Numbl writes to stderr; in the JS host we route through the same\n  // `$write` channel by emitting a \"stderr\" sentinel prefix the host\n  // can split on. For now, throw \u2014 the CLI's runner formats the\n  // exception to stderr, matching the user-visible result.\n  const err = new Error(msg);\n  err.identifier = \"\";\n  throw err;\n}\n\nfunction mtoc2_error_fmt_id(identifier, fmt, ...args) {\n  const msg = mtoc2_sprintf_format(fmt, args);\n  const err = new Error(msg);\n  err.identifier = identifier;\n  throw err;\n}\n",
   "format_complex.js": '// JS sibling of `format_complex.h`. Format a scalar complex `{re, im}`\n// the way numbl\'s `formatComplex` does. Each component is rendered\n// through `mtoc2_format_double` so the scalar formatting stays in\n// lockstep with numbl\'s `formatNumber`.\n\n\nfunction mtoc2_format_complex(z) {\n  const re = z.re;\n  const im = z.im;\n  if (im === 0) return mtoc2_format_double(re);\n  if (re === 0) return mtoc2_format_double(im) + "i";\n  if (im < 0) {\n    return mtoc2_format_double(re) + " - " + mtoc2_format_double(-im) + "i";\n  }\n  return mtoc2_format_double(re) + " + " + mtoc2_format_double(im) + "i";\n}\n',
   "format_double.js": '// JS sibling of `format_double.h` \u2014 same numbl-compatible formatter,\n// in JS. Used by `emitJs` for the `disp` scalar path and (later) by\n// the interpreter via the re-export in `snippets.gen.ts`.\n\nfunction mtoc2_format_double(x) {\n  if (Number.isNaN(x)) return "NaN";\n  // MATLAB spells these Inf / -Inf (matches the interpreter\'s formatNumber).\n  if (x === Infinity) return "Inf";\n  if (x === -Infinity) return "-Inf";\n  if (x === 0) x = 0;\n  if (Math.abs(x) < 1e15 && x === Math.trunc(x)) return String(x);\n\n  const buf = x.toExponential(4);\n  const ePos = buf.indexOf("e");\n  if (ePos < 0) return buf;\n  const decExp = parseInt(buf.slice(ePos + 1), 10);\n\n  if (decExp < -6 || decExp >= 5) {\n    let mantissaEnd = ePos - 1;\n    while (mantissaEnd > 0 && buf[mantissaEnd] === "0") mantissaEnd--;\n    if (mantissaEnd >= 0 && buf[mantissaEnd] === ".") mantissaEnd--;\n    let expPart = buf.slice(ePos + 1);\n    let sign = "+";\n    if (expPart[0] === "+" || expPart[0] === "-") {\n      sign = expPart[0];\n      expPart = expPart.slice(1);\n    }\n    while (expPart.length > 1 && expPart[0] === "0") expPart = expPart.slice(1);\n    return buf.slice(0, mantissaEnd + 1) + "e" + sign + expPart;\n  }\n\n  let fracDigits = 4 - decExp;\n  if (fracDigits < 0) fracDigits = 0;\n  let s = x.toFixed(fracDigits);\n  if (s.includes(".")) {\n    while (s.endsWith("0")) s = s.slice(0, -1);\n    if (s.endsWith(".")) s = s.slice(0, -1);\n  }\n  return s;\n}\n',
-  "format_engine.js": '// JS sibling of `format_engine.h`. Numbl-compatible printf-style\n// formatter, ported from `numbl/src/numbl-core/helpers/string.ts`\'s\n// `sprintfFormat`. Shared by fprintf / sprintf / error / assert on\n// the JS side.\n//\n// Spec set: d i u f e E g G x X o s c %\n// Flags: - + 0 # space. Precision `.N`. Width digits. `*` consumes the\n// next numeric arg as a width.\n// Escapes interpreted AT FORMAT TIME: \\n \\t \\\\.\n// Numeric tensors flatten column-major into the scalar stream; the\n// format string cycles through args until consumed (with a "no arg\n// consumed this pass" guard against infinite output).\n\nfunction isTensor(v) {\n  return typeof v === "object" && v !== null && v.mtoc2Tag === "tensor";\n}\nfunction isChar(v) {\n  return typeof v === "object" && v !== null && v.mtoc2Tag === "char";\n}\n\nfunction toNumber(v) {\n  if (typeof v === "number") return v;\n  if (typeof v === "boolean") return v ? 1 : 0;\n  if (typeof v === "string") return Number(v);\n  if (isChar(v)) {\n    // Match the interpreter\'s toNumber (runtime/convert.ts): a single\n    // char yields its code point; a multi-char value has no scalar\n    // numeric form. `Number("A")` would wrongly give NaN.\n    if (v.value.length === 1) return v.value.charCodeAt(0);\n    throw new Error("Cannot convert multi-char to number");\n  }\n  if (isTensor(v) && v.data.length === 1) return v.data[0];\n  return Number(v);\n}\n\nfunction toString(v) {\n  if (typeof v === "string") return v;\n  if (typeof v === "number") return String(v);\n  if (typeof v === "boolean") return v ? "1" : "0";\n  if (isChar(v)) return v.value;\n  return String(v);\n}\n\nfunction numStr(n) {\n  if (n === Infinity) return "Inf";\n  if (n === -Infinity) return "-Inf";\n  if (Number.isNaN(n)) return "NaN";\n  if (n === 0) return "0";\n  const prec = 5;\n  const exp = Math.floor(Math.log10(Math.abs(n)));\n  let s;\n  if (exp < -4 || exp >= prec) {\n    s = n.toExponential(prec - 1);\n    const ePos = s.indexOf("e");\n    let mantissa = s.slice(0, ePos);\n    const expPart0 = s.slice(ePos);\n    if (mantissa.includes(".")) mantissa = mantissa.replace(/\\.?0+$/, "");\n    const expPart = expPart0.replace(/([eE][+-])(\\d)$/, "$1" + "0$2");\n    s = mantissa + expPart;\n  } else {\n    if (Number.isInteger(n)) return String(n);\n    s = n.toPrecision(prec);\n    if (s.includes(".")) s = s.replace(/\\.?0+$/, "");\n  }\n  return s;\n}\n\nfunction applyWidth(spec, str) {\n  const m = spec.match(/^%([-+ #]*)0?(\\d+)?/);\n  if (!m) return str;\n  const explicitFlags = m[1] || "";\n  const leftAlign = explicitFlags.includes("-");\n  const afterPercent = spec.slice(1);\n  const flagAndWidth = afterPercent.match(/^([-+ #]*)(0?)(\\d+)?/);\n  const zeroFlag = flagAndWidth ? flagAndWidth[2] === "0" : false;\n  const width = flagAndWidth && flagAndWidth[3] ? parseInt(flagAndWidth[3]) : 0;\n  if (width <= str.length) return str;\n  const zeroPad = !leftAlign && zeroFlag;\n  const padLen = width - str.length;\n  if (leftAlign) return str + " ".repeat(padLen);\n  if (zeroPad) {\n    if (str[0] === "-" || str[0] === "+") {\n      return str[0] + "0".repeat(padLen) + str.slice(1);\n    }\n    return "0".repeat(padLen) + str;\n  }\n  return " ".repeat(padLen) + str;\n}\n\nfunction mtoc2_sprintf_format(fmt, args) {\n  // Char literals (`\'foo\'`) come through wrapped as\n  // `{mtoc2Tag:"char", value:"..."}` to match the interpreter\'s\n  // RuntimeValue convention; unwrap so the format walker indexes\n  // a plain JS string.\n  if (isChar(fmt)) fmt = fmt.value;\n  // Flatten args column-major (tensors expand element-by-element).\n  const flat = [];\n  for (const arg of args) {\n    if (isTensor(arg)) {\n      for (let k = 0; k < arg.data.length; k++) flat.push(arg.data[k]);\n    } else {\n      flat.push(arg);\n    }\n  }\n\n  let result = "";\n  let argIdx = 0;\n\n  do {\n    const startArgIdx = argIdx;\n    let outOfArgs = false;\n    let i = 0;\n    while (i < fmt.length && !outOfArgs) {\n      if (fmt[i] === "%" && i + 1 < fmt.length) {\n        i++;\n        let spec = "%";\n        while (i < fmt.length && !"dfigeEsoxXuc%".includes(fmt[i])) {\n          if (fmt[i] === "*") {\n            if (argIdx >= flat.length) {\n              outOfArgs = true;\n              break;\n            }\n            spec += String(Math.round(toNumber(flat[argIdx++])));\n            i++;\n          } else {\n            spec += fmt[i];\n            i++;\n          }\n        }\n        if (outOfArgs) break;\n        if (i < fmt.length) {\n          const ch = fmt[i];\n          i++;\n          if (ch === "%") {\n            result += "%";\n          } else if (argIdx >= flat.length) {\n            outOfArgs = true;\n          } else if (ch === "d" || ch === "i" || ch === "u") {\n            const raw = toNumber(flat[argIdx++]);\n            const isInt = Number.isInteger(raw);\n            const canPrintAsInt = ch === "u" ? isInt && raw >= 0 : isInt;\n            if (!canPrintAsInt) {\n              let eStr = raw.toExponential(6);\n              eStr = eStr.replace(/e([+-])(\\d)$/, "e$1" + "0$2");\n              result += applyWidth(spec, eStr);\n            } else {\n              const n = raw;\n              const flags = spec.slice(1);\n              const hasPlus = flags.includes("+");\n              const leftAlign = flags.includes("-");\n              const widthMatch = spec.match(/^%[^0-9]*(\\d+)/);\n              const width = widthMatch ? parseInt(widthMatch[1]) : 0;\n              const zeroPad = !leftAlign && /^[-+ ]*0/.test(spec.slice(1));\n              const s = String(Math.abs(n));\n              const sign = n < 0 ? "-" : hasPlus ? "+" : "";\n              if (width > 0) {\n                const padChar = zeroPad ? "0" : " ";\n                const padLen = Math.max(0, width - sign.length - s.length);\n                const pad = padChar.repeat(padLen);\n                result += leftAlign\n                  ? sign + s + " ".repeat(padLen)\n                  : zeroPad\n                    ? sign + pad + s\n                    : pad + sign + s;\n              } else {\n                result += sign + s;\n              }\n            }\n          } else if (ch === "f") {\n            const n = toNumber(flat[argIdx++]);\n            if (!isFinite(n) || isNaN(n)) {\n              result += applyWidth(spec, numStr(n));\n            } else {\n              const fFlags = spec.slice(1);\n              const fHasPlus = fFlags.includes("+");\n              const precMatch = spec.match(/\\.(\\d+)/);\n              const prec = precMatch ? parseInt(precMatch[1]) : 6;\n              const formatted = n.toFixed(prec);\n              const fSign = n < 0 ? "" : fHasPlus ? "+" : "";\n              result += applyWidth(spec, fSign + formatted);\n            }\n          } else if (ch === "e" || ch === "E") {\n            const n = toNumber(flat[argIdx++]);\n            if (!isFinite(n) || isNaN(n)) {\n              result += applyWidth(spec, numStr(n));\n            } else {\n              const precMatch = spec.match(/\\.(\\d+)/);\n              const prec = precMatch ? parseInt(precMatch[1]) : 6;\n              let eStr = n.toExponential(prec);\n              eStr = eStr.replace(/e([+-])(\\d)$/, "e$1" + "0$2");\n              if (ch === "E") eStr = eStr.toUpperCase();\n              result += applyWidth(spec, eStr);\n            }\n          } else if (ch === "x" || ch === "X") {\n            const n = Math.round(toNumber(flat[argIdx++]));\n            let s = Math.abs(n).toString(16);\n            if (ch === "X") s = s.toUpperCase();\n            result += applyWidth(spec, s);\n          } else if (ch === "o") {\n            const n = Math.round(toNumber(flat[argIdx++]));\n            result += applyWidth(spec, Math.abs(n).toString(8));\n          } else if (ch === "g" || ch === "G") {\n            const gVal = toNumber(flat[argIdx++]);\n            if (!isFinite(gVal) || isNaN(gVal)) {\n              result += applyWidth(spec, numStr(gVal));\n            } else {\n              const precMatch = spec.match(/\\.(\\d+)/);\n              const gPrec = precMatch ? parseInt(precMatch[1]) : 6;\n              let gStr;\n              if (gVal === 0) {\n                gStr = "0";\n              } else {\n                const exp = Math.floor(Math.log10(Math.abs(gVal)));\n                if (exp < -4 || exp >= gPrec) {\n                  gStr = gVal.toExponential(gPrec - 1);\n                  const ePos = gStr.indexOf("e");\n                  let mantissa = gStr.slice(0, ePos);\n                  let expPart = gStr.slice(ePos);\n                  if (mantissa.includes(".")) {\n                    mantissa = mantissa.replace(/\\.?0+$/, "");\n                  }\n                  expPart = expPart.replace(/e([+-])(\\d)$/, "e$1" + "0$2");\n                  gStr = mantissa + expPart;\n                } else {\n                  gStr = gVal.toPrecision(gPrec);\n                  if (gStr.includes(".")) {\n                    gStr = gStr.replace(/\\.?0+$/, "");\n                  }\n                  if (gStr.includes("e")) {\n                    gStr = String(parseFloat(gStr));\n                  }\n                }\n              }\n              if (ch === "G") gStr = gStr.toUpperCase();\n              result += applyWidth(spec, gStr);\n            }\n          } else if (ch === "s") {\n            const sArg = flat[argIdx++];\n            // A numeric/logical argument to %s is a character code (MATLAB:\n            // sprintf(\'%s\', 65) -> \'A\').\n            const sVal =\n              typeof sArg === "number" || typeof sArg === "boolean"\n                ? String.fromCharCode(Math.round(toNumber(sArg)))\n                : toString(sArg);\n            const sFlags = spec.slice(1);\n            const sLeftAlign = sFlags.includes("-");\n            const sWidthMatch = spec.match(/^%[^0-9]*(\\d+)/);\n            const sWidth = sWidthMatch ? parseInt(sWidthMatch[1]) : 0;\n            if (sWidth > sVal.length) {\n              const sPad = " ".repeat(sWidth - sVal.length);\n              result += sLeftAlign ? sVal + sPad : sPad + sVal;\n            } else {\n              result += sVal;\n            }\n          } else if (ch === "c") {\n            result += String.fromCharCode(Math.round(toNumber(flat[argIdx++])));\n          } else {\n            result += spec + ch;\n            argIdx++;\n          }\n        }\n      } else if (fmt[i] === "\\\\" && i + 1 < fmt.length) {\n        i++;\n        switch (fmt[i]) {\n          case "n":\n            result += "\\n";\n            break;\n          case "t":\n            result += "\\t";\n            break;\n          case "\\\\":\n            result += "\\\\";\n            break;\n          default:\n            result += "\\\\" + fmt[i];\n        }\n        i++;\n      } else {\n        result += fmt[i];\n        i++;\n      }\n    }\n    if (argIdx === startArgIdx) break;\n  } while (argIdx < flat.length);\n\n  return result;\n}\n',
+  "format_engine.js": '// JS sibling of `format_engine.h`. Numbl-compatible printf-style\n// formatter, ported from `numbl/src/numbl-core/helpers/string.ts`\'s\n// `sprintfFormat`. Shared by fprintf / sprintf / error / assert on\n// the JS side.\n//\n// Spec set: d i u f e E g G x X o s c %\n// Flags: - + 0 # space. Precision `.N`. Width digits. `*` consumes the\n// next numeric arg as a width.\n// Escapes interpreted AT FORMAT TIME: \\n \\t \\r \\a \\b \\f \\v \\0 \\\\.\n// Numeric tensors flatten column-major into the scalar stream; the\n// format string cycles through args until consumed (with a "no arg\n// consumed this pass" guard against infinite output).\n\nfunction isTensor(v) {\n  return typeof v === "object" && v !== null && v.mtoc2Tag === "tensor";\n}\nfunction isChar(v) {\n  return typeof v === "object" && v !== null && v.mtoc2Tag === "char";\n}\n\nfunction toNumber(v) {\n  if (typeof v === "number") return v;\n  if (typeof v === "boolean") return v ? 1 : 0;\n  if (typeof v === "string") return Number(v);\n  if (isChar(v)) {\n    // Match the interpreter\'s toNumber (runtime/convert.ts): a single\n    // char yields its code point; a multi-char value has no scalar\n    // numeric form. `Number("A")` would wrongly give NaN.\n    if (v.value.length === 1) return v.value.charCodeAt(0);\n    throw new Error("Cannot convert multi-char to number");\n  }\n  if (isTensor(v) && v.data.length === 1) return v.data[0];\n  return Number(v);\n}\n\nfunction toString(v) {\n  if (typeof v === "string") return v;\n  if (typeof v === "number") return String(v);\n  if (typeof v === "boolean") return v ? "1" : "0";\n  if (isChar(v)) return v.value;\n  return String(v);\n}\n\nfunction numStr(n) {\n  if (n === Infinity) return "Inf";\n  if (n === -Infinity) return "-Inf";\n  if (Number.isNaN(n)) return "NaN";\n  if (n === 0) return "0";\n  const prec = 5;\n  const exp = Math.floor(Math.log10(Math.abs(n)));\n  let s;\n  if (exp < -4 || exp >= prec) {\n    s = n.toExponential(prec - 1);\n    const ePos = s.indexOf("e");\n    let mantissa = s.slice(0, ePos);\n    const expPart0 = s.slice(ePos);\n    if (mantissa.includes(".")) mantissa = mantissa.replace(/\\.?0+$/, "");\n    const expPart = expPart0.replace(/([eE][+-])(\\d)$/, "$1" + "0$2");\n    s = mantissa + expPart;\n  } else {\n    if (Number.isInteger(n)) return String(n);\n    s = n.toPrecision(prec);\n    if (s.includes(".")) s = s.replace(/\\.?0+$/, "");\n  }\n  return s;\n}\n\nfunction applyWidth(spec, str) {\n  const m = spec.match(/^%([-+ #]*)0?(\\d+)?/);\n  if (!m) return str;\n  const explicitFlags = m[1] || "";\n  const leftAlign = explicitFlags.includes("-");\n  const afterPercent = spec.slice(1);\n  const flagAndWidth = afterPercent.match(/^([-+ #]*)(0?)(\\d+)?/);\n  const zeroFlag = flagAndWidth ? flagAndWidth[2] === "0" : false;\n  const width = flagAndWidth && flagAndWidth[3] ? parseInt(flagAndWidth[3]) : 0;\n  if (width <= str.length) return str;\n  const zeroPad = !leftAlign && zeroFlag;\n  const padLen = width - str.length;\n  if (leftAlign) return str + " ".repeat(padLen);\n  if (zeroPad) {\n    if (str[0] === "-" || str[0] === "+") {\n      return str[0] + "0".repeat(padLen) + str.slice(1);\n    }\n    return "0".repeat(padLen) + str;\n  }\n  return " ".repeat(padLen) + str;\n}\n\nfunction mtoc2_sprintf_format(fmt, args) {\n  // Char literals (`\'foo\'`) come through wrapped as\n  // `{mtoc2Tag:"char", value:"..."}` to match the interpreter\'s\n  // RuntimeValue convention; unwrap so the format walker indexes\n  // a plain JS string.\n  if (isChar(fmt)) fmt = fmt.value;\n  // Flatten args column-major (tensors expand element-by-element).\n  const flat = [];\n  for (const arg of args) {\n    if (isTensor(arg)) {\n      for (let k = 0; k < arg.data.length; k++) flat.push(arg.data[k]);\n    } else {\n      flat.push(arg);\n    }\n  }\n\n  let result = "";\n  let argIdx = 0;\n\n  do {\n    const startArgIdx = argIdx;\n    let outOfArgs = false;\n    let i = 0;\n    while (i < fmt.length && !outOfArgs) {\n      if (fmt[i] === "%" && i + 1 < fmt.length) {\n        i++;\n        let spec = "%";\n        while (i < fmt.length && !"dfigeEsoxXuc%".includes(fmt[i])) {\n          if (fmt[i] === "*") {\n            if (argIdx >= flat.length) {\n              outOfArgs = true;\n              break;\n            }\n            spec += String(Math.round(toNumber(flat[argIdx++])));\n            i++;\n          } else {\n            spec += fmt[i];\n            i++;\n          }\n        }\n        if (outOfArgs) break;\n        if (i < fmt.length) {\n          const ch = fmt[i];\n          i++;\n          if (ch === "%") {\n            result += "%";\n          } else if (argIdx >= flat.length) {\n            outOfArgs = true;\n          } else if (ch === "d" || ch === "i" || ch === "u") {\n            const raw = toNumber(flat[argIdx++]);\n            const isInt = Number.isInteger(raw);\n            const canPrintAsInt = ch === "u" ? isInt && raw >= 0 : isInt;\n            if (!canPrintAsInt) {\n              let eStr = raw.toExponential(6);\n              eStr = eStr.replace(/e([+-])(\\d)$/, "e$1" + "0$2");\n              result += applyWidth(spec, eStr);\n            } else {\n              const n = raw;\n              const flags = spec.slice(1);\n              const hasPlus = flags.includes("+");\n              const leftAlign = flags.includes("-");\n              const widthMatch = spec.match(/^%[^0-9]*(\\d+)/);\n              const width = widthMatch ? parseInt(widthMatch[1]) : 0;\n              const zeroPad = !leftAlign && /^[-+ ]*0/.test(spec.slice(1));\n              const s = String(Math.abs(n));\n              const sign = n < 0 ? "-" : hasPlus ? "+" : "";\n              if (width > 0) {\n                const padChar = zeroPad ? "0" : " ";\n                const padLen = Math.max(0, width - sign.length - s.length);\n                const pad = padChar.repeat(padLen);\n                result += leftAlign\n                  ? sign + s + " ".repeat(padLen)\n                  : zeroPad\n                    ? sign + pad + s\n                    : pad + sign + s;\n              } else {\n                result += sign + s;\n              }\n            }\n          } else if (ch === "f") {\n            const n = toNumber(flat[argIdx++]);\n            if (!isFinite(n) || isNaN(n)) {\n              result += applyWidth(spec, numStr(n));\n            } else {\n              const fFlags = spec.slice(1);\n              const fHasPlus = fFlags.includes("+");\n              const precMatch = spec.match(/\\.(\\d+)/);\n              const prec = precMatch ? parseInt(precMatch[1]) : 6;\n              const formatted = n.toFixed(prec);\n              const fSign = n < 0 ? "" : fHasPlus ? "+" : "";\n              result += applyWidth(spec, fSign + formatted);\n            }\n          } else if (ch === "e" || ch === "E") {\n            const n = toNumber(flat[argIdx++]);\n            if (!isFinite(n) || isNaN(n)) {\n              result += applyWidth(spec, numStr(n));\n            } else {\n              const precMatch = spec.match(/\\.(\\d+)/);\n              const prec = precMatch ? parseInt(precMatch[1]) : 6;\n              let eStr = n.toExponential(prec);\n              eStr = eStr.replace(/e([+-])(\\d)$/, "e$1" + "0$2");\n              if (ch === "E") eStr = eStr.toUpperCase();\n              result += applyWidth(spec, eStr);\n            }\n          } else if (ch === "x" || ch === "X") {\n            const n = Math.round(toNumber(flat[argIdx++]));\n            let s = Math.abs(n).toString(16);\n            if (ch === "X") s = s.toUpperCase();\n            result += applyWidth(spec, s);\n          } else if (ch === "o") {\n            const n = Math.round(toNumber(flat[argIdx++]));\n            result += applyWidth(spec, Math.abs(n).toString(8));\n          } else if (ch === "g" || ch === "G") {\n            const gVal = toNumber(flat[argIdx++]);\n            if (!isFinite(gVal) || isNaN(gVal)) {\n              result += applyWidth(spec, numStr(gVal));\n            } else {\n              const precMatch = spec.match(/\\.(\\d+)/);\n              const gPrec = precMatch ? parseInt(precMatch[1]) : 6;\n              let gStr;\n              if (gVal === 0) {\n                gStr = "0";\n              } else {\n                const exp = Math.floor(Math.log10(Math.abs(gVal)));\n                if (exp < -4 || exp >= gPrec) {\n                  gStr = gVal.toExponential(gPrec - 1);\n                  const ePos = gStr.indexOf("e");\n                  let mantissa = gStr.slice(0, ePos);\n                  let expPart = gStr.slice(ePos);\n                  if (mantissa.includes(".")) {\n                    mantissa = mantissa.replace(/\\.?0+$/, "");\n                  }\n                  expPart = expPart.replace(/e([+-])(\\d)$/, "e$1" + "0$2");\n                  gStr = mantissa + expPart;\n                } else {\n                  gStr = gVal.toPrecision(gPrec);\n                  if (gStr.includes(".")) {\n                    gStr = gStr.replace(/\\.?0+$/, "");\n                  }\n                  if (gStr.includes("e")) {\n                    gStr = String(parseFloat(gStr));\n                  }\n                }\n              }\n              if (ch === "G") gStr = gStr.toUpperCase();\n              result += applyWidth(spec, gStr);\n            }\n          } else if (ch === "s") {\n            const sArg = flat[argIdx++];\n            // A numeric/logical argument to %s is a character code (MATLAB:\n            // sprintf(\'%s\', 65) -> \'A\').\n            const sVal =\n              typeof sArg === "number" || typeof sArg === "boolean"\n                ? String.fromCharCode(Math.round(toNumber(sArg)))\n                : toString(sArg);\n            const sFlags = spec.slice(1);\n            const sLeftAlign = sFlags.includes("-");\n            const sWidthMatch = spec.match(/^%[^0-9]*(\\d+)/);\n            const sWidth = sWidthMatch ? parseInt(sWidthMatch[1]) : 0;\n            if (sWidth > sVal.length) {\n              const sPad = " ".repeat(sWidth - sVal.length);\n              result += sLeftAlign ? sVal + sPad : sPad + sVal;\n            } else {\n              result += sVal;\n            }\n          } else if (ch === "c") {\n            result += String.fromCharCode(Math.round(toNumber(flat[argIdx++])));\n          } else {\n            result += spec + ch;\n            argIdx++;\n          }\n        }\n      } else if (fmt[i] === "\\\\" && i + 1 < fmt.length) {\n        i++;\n        switch (fmt[i]) {\n          case "n":\n            result += "\\n";\n            break;\n          case "t":\n            result += "\\t";\n            break;\n          case "r":\n            result += "\\r";\n            break;\n          case "a":\n            result += "\\x07";\n            break;\n          case "b":\n            result += "\\b";\n            break;\n          case "f":\n            result += "\\f";\n            break;\n          case "v":\n            result += "\\v";\n            break;\n          case "0":\n            result += "\\0";\n            break;\n          case "\\\\":\n            result += "\\\\";\n            break;\n          default:\n            result += "\\\\" + fmt[i];\n        }\n        i++;\n      } else {\n        result += fmt[i];\n        i++;\n      }\n    }\n    if (argIdx === startArgIdx) break;\n  } while (argIdx < flat.length);\n\n  return result;\n}\n',
   "fprintf.js": "// JS sibling of `fprintf.h`. Routes formatted output through\n// `mtoc2_sprintf_format` then writes via `$write` (the JS analog of\n// C's stdout). Numbl-compatible spec set & semantics.\n\n\nfunction mtoc2_fprintf(fmt, ...args) {\n  $write(mtoc2_sprintf_format(fmt, args));\n}\n",
   "sprintf.js": '// JS sibling of `sprintf.h`. Two output variants:\n//   - `mtoc2_sprintf_str(fmt, args)` returns the formatted text as a\n//     plain JS string (the equivalent of numbl\'s `String` kind).\n//   - `mtoc2_sprintf_char(fmt, args)` returns it as a `mtoc2_char_tensor_t`\n//     placeholder \u2014 we keep the JS shape as a `{mtoc2Tag: "char", value}`\n//     object so disp/length etc. dispatch correctly.\n\n\nfunction mtoc2_sprintf_str(fmt, ...args) {\n  return mtoc2_sprintf_format(fmt, args);\n}\n\nfunction mtoc2_sprintf_char(fmt, ...args) {\n  return { mtoc2Tag: "char", value: mtoc2_sprintf_format(fmt, args) };\n}\n',
   "warning_fmt.js": '// JS sibling of `warning_fmt.h`. Format the message and write\n// `Warning: <msg>\\n` via `$write`. Matches numbl\n// (`runtime/specialBuiltins.ts:190` \u2014 `rt.output("Warning: " + msg + "\\n")`).\n\n\nfunction mtoc2_warning_fmt(fmt, ...args) {\n  $write("Warning: " + mtoc2_sprintf_format(fmt, args) + "\\n");\n}\n\nfunction mtoc2_warning_fmt_id(_id, fmt, ...args) {\n  // The id is informational \u2014 numbl threads it to lastwarn state,\n  // which mtoc2 doesn\'t expose. Drop it here so the visible output\n  // matches the bare form.\n  $write("Warning: " + mtoc2_sprintf_format(fmt, args) + "\\n");\n}\n',
@@ -73496,7 +73749,7 @@ var JS_SNIPPETS = {
   "tensor_logspace.js": "// JS sibling of `tensor_logspace.h`. Build a 1\xD7n row tensor of n\n// logarithmically-spaced values from 10^a to 10^b. Byte-for-byte with\n// numbl's interpreter `logspace`, including the MATLAB special case\n// where an upper limit of exactly `pi` makes the last point `pi`.\n\n\nfunction mtoc2_tensor_logspace(a, b, n) {\n  if (n <= 0) return mtoc2_tensor_alloc(1, 0);\n  const isPi = b === Math.PI;\n  const endVal = isPi ? Math.PI : Math.pow(10, b);\n  const out = mtoc2_tensor_alloc(1, n);\n  if (n === 1) {\n    out.data[0] = endVal;\n    return out;\n  }\n  if (isPi) {\n    const logStart = Math.log10(Math.pow(10, a));\n    const logEnd = Math.log10(Math.PI);\n    for (let i = 0; i < n; i++) {\n      const t = logStart + ((logEnd - logStart) * i) / (n - 1);\n      out.data[i] = Math.pow(10, t);\n    }\n  } else {\n    for (let i = 0; i < n; i++) {\n      const t = a + ((b - a) * i) / (n - 1);\n      out.data[i] = Math.pow(10, t);\n    }\n  }\n  return out;\n}\n",
   "tensor_meshgrid.js": "// JS sibling of `tensor_meshgrid.h`. MATLAB-style coordinate grid.\n\n\nfunction numel(t) {\n  let n = 1;\n  for (const s of t.shape) n *= s;\n  return n;\n}\n\nfunction mtoc2_meshgrid_x(x, y) {\n  const M = numel(x);\n  const N = numel(y);\n  const X = mtoc2_tensor_alloc(N, M);\n  for (let j = 0; j < M; j++) {\n    const xj = x.data[j];\n    for (let i = 0; i < N; i++) X.data[i + j * N] = xj;\n  }\n  return X;\n}\n\nfunction mtoc2_meshgrid(x, y) {\n  const M = numel(x);\n  const N = numel(y);\n  const X = mtoc2_tensor_alloc(N, M);\n  const Y = mtoc2_tensor_alloc(N, M);\n  for (let j = 0; j < M; j++) {\n    const xj = x.data[j];\n    for (let i = 0; i < N; i++) {\n      X.data[i + j * N] = xj;\n      Y.data[i + j * N] = y.data[i];\n    }\n  }\n  return { X, Y };\n}\n\nfunction mtoc2_meshgrid_1arg(x) {\n  return mtoc2_meshgrid(x, x);\n}\n",
   "tensor_mtimes_complex.js": '// JS sibling of `tensor_mtimes_complex.h`. 2-D matrix multiplication\n// producing a complex result. Handles all three mixed cases\n// (complex \xD7 complex, complex \xD7 real, real \xD7 complex) by treating an\n// undefined imag lane as implicit zeros.\n\n\nfunction mtoc2_tensor_mtimes_complex_scalar(a, b) {\n  if (a.shape.length !== 2 || b.shape.length !== 2) {\n    throw new Error("mtoc2_tensor_mtimes_complex_scalar: inputs must be 2-D");\n  }\n  if (a.shape[0] !== 1 || b.shape[1] !== 1) {\n    throw new Error("mtoc2_tensor_mtimes_complex_scalar: requires 1\xD7k * k\xD71");\n  }\n  if (a.shape[1] !== b.shape[0]) {\n    throw new Error("mtoc2_tensor_mtimes_complex_scalar: inner-dim mismatch");\n  }\n  const k = a.shape[1];\n  const aim = a.imag;\n  const bim = b.imag;\n  let accR = 0;\n  let accI = 0;\n  for (let p = 0; p < k; p++) {\n    const ar = a.data[p];\n    const ai = aim !== undefined ? aim[p] : 0;\n    const br = b.data[p];\n    const bi = bim !== undefined ? bim[p] : 0;\n    accR += ar * br - ai * bi;\n    accI += ar * bi + ai * br;\n  }\n  return { re: accR, im: accI };\n}\n\nfunction mtoc2_tensor_mtimes_complex(a, b) {\n  if (a.shape.length !== 2 || b.shape.length !== 2) {\n    throw new Error("mtoc2_tensor_mtimes_complex: inputs must be 2-D");\n  }\n  const m = a.shape[0];\n  const k = a.shape[1];\n  const k2 = b.shape[0];\n  const n = b.shape[1];\n  if (k !== k2) {\n    throw new Error(\n      `mtoc2_tensor_mtimes_complex: inner-dim mismatch (${m}\xD7${k} * ${k2}\xD7${n})`\n    );\n  }\n  const out = mtoc2_tensor_alloc_complex(m, n);\n  const aim = a.imag;\n  const bim = b.imag;\n  for (let j = 0; j < n; j++) {\n    for (let i = 0; i < m; i++) {\n      let accR = 0;\n      let accI = 0;\n      for (let p = 0; p < k; p++) {\n        const ar = a.data[i + p * m];\n        const ai = aim !== undefined ? aim[i + p * m] : 0;\n        const br = b.data[p + j * k];\n        const bi = bim !== undefined ? bim[p + j * k] : 0;\n        accR += ar * br - ai * bi;\n        accI += ar * bi + ai * br;\n      }\n      out.data[i + j * m] = accR;\n      out.imag[i + j * m] = accI;\n    }\n  }\n  return out;\n}\n',
-  "tensor_mtimes_real.js": '// JS sibling of `tensor_mtimes_real.h`. Real 2-D matrix\n// multiplication A * B. Column-major in, column-major out.\n// `mtoc2_tensor_mtimes_real_scalar` mirrors the C 1\xD7k * k\xD71\n// inner-product path that returns a bare number instead of a\n// freshly-allocated 1\xD71 tensor.\n\n\nfunction mtoc2_tensor_mtimes_real(a, b) {\n  if (a.shape.length !== 2 || b.shape.length !== 2) {\n    throw new Error("mtoc2_tensor_mtimes_real: inputs must be 2-D");\n  }\n  const m = a.shape[0];\n  const k = a.shape[1];\n  const k2 = b.shape[0];\n  const n = b.shape[1];\n  if (k !== k2) {\n    throw new Error(\n      `mtoc2_tensor_mtimes_real: inner dimensions disagree (${k} vs ${k2})`\n    );\n  }\n  const r = mtoc2_tensor_alloc(m, n);\n  for (let j = 0; j < n; j++) {\n    for (let i = 0; i < m; i++) {\n      let s = 0;\n      for (let p = 0; p < k; p++) {\n        s += a.data[i + p * m] * b.data[p + j * k];\n      }\n      r.data[i + j * m] = s;\n    }\n  }\n  return r;\n}\n\nfunction mtoc2_tensor_mtimes_real_scalar(a, b) {\n  if (a.shape.length !== 2 || b.shape.length !== 2) {\n    throw new Error("mtoc2_tensor_mtimes_real_scalar: inputs must be 2-D");\n  }\n  // The translate-time type system has already proven a is 1\xD7k and b\n  // is k\xD71; this helper trusts that and just runs the inner product.\n  const k = a.shape[1];\n  let s = 0;\n  for (let p = 0; p < k; p++) {\n    s += a.data[p * a.shape[0]] * b.data[p];\n  }\n  return s;\n}\n',
+  "tensor_mtimes_real.js": '// JS sibling of `tensor_mtimes_real.h`. Real 2-D matrix\n// multiplication A * B. Column-major in, column-major out.\n// `mtoc2_tensor_mtimes_real_scalar` mirrors the C 1\xD7k * k\xD71\n// inner-product path that returns a bare number instead of a\n// freshly-allocated 1\xD71 tensor.\n\n\nfunction mtoc2_tensor_mtimes_real(a, b) {\n  if (a.shape.length !== 2 || b.shape.length !== 2) {\n    throw new Error("mtoc2_tensor_mtimes_real: inputs must be 2-D");\n  }\n  const m = a.shape[0];\n  const k = a.shape[1];\n  const k2 = b.shape[0];\n  const n = b.shape[1];\n  if (k !== k2) {\n    throw new Error(\n      `mtoc2_tensor_mtimes_real: inner dimensions disagree (${k} vs ${k2})`\n    );\n  }\n  // Optional WASM LAPACK accelerator. When a host installs `$matmulAccel`\n  // (browser worker, after loading a bridge), delegate the multiply; a\n  // falsy return means "declined" (too small / error) and we fall through\n  // to the JS loop below. `typeof` guard is safe even when unset.\n  if (typeof $matmulAccel === "function") {\n    const accel = $matmulAccel(a.data, m, k, b.data, n);\n    if (accel) {\n      const acc = mtoc2_tensor_alloc(m, n);\n      acc.data.set(accel);\n      return acc;\n    }\n  }\n  const r = mtoc2_tensor_alloc(m, n);\n  for (let j = 0; j < n; j++) {\n    for (let i = 0; i < m; i++) {\n      let s = 0;\n      for (let p = 0; p < k; p++) {\n        s += a.data[i + p * m] * b.data[p + j * k];\n      }\n      r.data[i + j * m] = s;\n    }\n  }\n  return r;\n}\n\nfunction mtoc2_tensor_mtimes_real_scalar(a, b) {\n  if (a.shape.length !== 2 || b.shape.length !== 2) {\n    throw new Error("mtoc2_tensor_mtimes_real_scalar: inputs must be 2-D");\n  }\n  // The translate-time type system has already proven a is 1\xD7k and b\n  // is k\xD71; this helper trusts that and just runs the inner product.\n  const k = a.shape[1];\n  let s = 0;\n  for (let p = 0; p < k; p++) {\n    s += a.data[p * a.shape[0]] * b.data[p];\n  }\n  return s;\n}\n',
   "tensor_norm.js": "// JS sibling of `tensor_norm.h`. Vector norms for real and complex\n// tensors. The complex variants tolerate a missing imag lane (real\n// tensor flowing through a complex-typed norm route) by treating it\n// as zero.\n\nfunction mtoc2_norm2_real(a) {\n  let acc = 0;\n  for (let i = 0; i < a.data.length; i++) {\n    const x = a.data[i];\n    acc += x * x;\n  }\n  return Math.sqrt(acc);\n}\n\nfunction mtoc2_norm2_complex(a) {\n  let acc = 0;\n  const im = a.imag;\n  for (let i = 0; i < a.data.length; i++) {\n    const re = a.data[i];\n    const imv = im !== undefined ? im[i] : 0;\n    acc += re * re + imv * imv;\n  }\n  return Math.sqrt(acc);\n}\n\nfunction mtoc2_norm_p_real(a, p) {\n  const n = a.data.length;\n  if (n === 0) return 0;\n  if (p === Infinity) {\n    let m = 0;\n    for (let i = 0; i < n; i++) {\n      const x = Math.abs(a.data[i]);\n      if (x > m) m = x;\n    }\n    return m;\n  }\n  if (p === -Infinity) {\n    let m = Math.abs(a.data[0]);\n    for (let i = 1; i < n; i++) {\n      const x = Math.abs(a.data[i]);\n      if (x < m) m = x;\n    }\n    return m;\n  }\n  if (p === 1) {\n    let acc = 0;\n    for (let i = 0; i < n; i++) acc += Math.abs(a.data[i]);\n    return acc;\n  }\n  if (p === 2) return mtoc2_norm2_real(a);\n  let acc = 0;\n  for (let i = 0; i < n; i++) acc += Math.pow(Math.abs(a.data[i]), p);\n  return Math.pow(acc, 1 / p);\n}\n\nfunction mtoc2_norm_p_complex(a, p) {\n  const n = a.data.length;\n  if (n === 0) return 0;\n  const im = a.imag;\n  const abs = i => {\n    const re = a.data[i];\n    const imv = im !== undefined ? im[i] : 0;\n    return Math.hypot(re, imv);\n  };\n  if (p === Infinity) {\n    let m = 0;\n    for (let i = 0; i < n; i++) {\n      const x = abs(i);\n      if (x > m) m = x;\n    }\n    return m;\n  }\n  if (p === -Infinity) {\n    let m = abs(0);\n    for (let i = 1; i < n; i++) {\n      const x = abs(i);\n      if (x < m) m = x;\n    }\n    return m;\n  }\n  if (p === 2) return mtoc2_norm2_complex(a);\n  if (p === 1) {\n    let acc = 0;\n    for (let i = 0; i < n; i++) acc += abs(i);\n    return acc;\n  }\n  let acc = 0;\n  for (let i = 0; i < n; i++) acc += Math.pow(abs(i), p);\n  return Math.pow(acc, 1 / p);\n}\n",
   "tensor_ones_nd.js": "// JS sibling of `tensor_ones_nd.h`. Fill the freshly-allocated\n// tensor with `1.0`.\n\n\nfunction mtoc2_tensor_ones_nd(ndim, dims) {\n  const t = mtoc2_tensor_alloc_nd(ndim, dims);\n  t.data.fill(1);\n  return t;\n}\n",
   "tensor_ones_square.js": "// JS sibling of `tensor_ones_square.h`. See `tensor_zeros_square.js`\n// for the rationale.\n\n\nfunction mtoc2_tensor_ones_square(n) {\n  return mtoc2_tensor_ones_nd(2, [n, n]);\n}\n",
@@ -82065,9 +82318,9 @@ function tileExact(src, padShape2, padReps) {
   }
   return out;
 }
-function padTo(arr, pad, len) {
+function padTo(arr, pad2, len) {
   const out = arr.slice();
-  while (out.length < len) out.push(pad);
+  while (out.length < len) out.push(pad2);
   return out;
 }
 function trimTrailingOnes(shape) {
@@ -93152,7 +93405,7 @@ var VirtualFileSystem = class {
 };
 
 // src/vfs/BrowserFileIOAdapter.ts
-import { unzipSync } from "fflate";
+import { unzipSync, zipSync } from "fflate";
 var TEXT_DECODER = new TextDecoder("utf-8");
 var TEXT_ENCODER = new TextEncoder();
 var READ_CHUNK_SIZE = 8192;
@@ -93470,6 +93723,57 @@ var BrowserFileIOAdapter = class {
     }
     return extracted;
   }
+  zip(zipfilename, filenames, rootDir) {
+    const root = this.vfs.normalizePath(rootDir);
+    const dest = this.vfs.normalizePath(zipfilename);
+    const entries = {};
+    const names = [];
+    const toEntryName = (abs2) => {
+      const prefix = root === "/" ? "/" : root + "/";
+      if (!abs2.startsWith(prefix)) return abs2.slice(abs2.lastIndexOf("/") + 1);
+      return abs2.slice(prefix.length);
+    };
+    const addFile = (abs2) => {
+      const name = toEntryName(abs2);
+      entries[name] = this.vfs.readFile(abs2);
+      names.push(name);
+    };
+    const addDir = (absDir) => {
+      for (const entry of this.vfs.listDir(absDir)) {
+        if (entry.name === "." || entry.name === "..") continue;
+        const abs2 = absDir + "/" + entry.name;
+        if (entry.isdir) addDir(abs2);
+        else addFile(abs2);
+      }
+    };
+    const addPath = (abs2) => {
+      const type = this.vfs.exists(abs2);
+      if (type === null) throw new Error(`zip: cannot find '${abs2}'`);
+      if (type === "dir") addDir(abs2);
+      else addFile(abs2);
+    };
+    for (const f of filenames) {
+      const p2 = f.replace(/\\/g, "/");
+      const abs2 = p2.startsWith("/") ? this.vfs.normalizePath(p2) : this.vfs.normalizePath(root + "/" + p2);
+      const last = p2.split("/").pop() ?? p2;
+      if (last.includes("*") || last.includes("?")) {
+        const lastSlash = abs2.lastIndexOf("/");
+        const dir = lastSlash > 0 ? abs2.slice(0, lastSlash) : "/";
+        const re = new RegExp(
+          "^" + last.replace(/[.+^${}()|[\]\\]/g, "\\$&").replace(/\*/g, ".*").replace(/\?/g, ".") + "$"
+        );
+        if (this.vfs.exists(dir) !== "dir") continue;
+        for (const entry of this.vfs.listDir(dir)) {
+          if (entry.name === "." || entry.name === "..") continue;
+          if (re.test(entry.name)) addPath(dir + "/" + entry.name);
+        }
+      } else {
+        addPath(abs2);
+      }
+    }
+    this.vfs.writeFile(dest, zipSync(entries));
+    return names;
+  }
   /** Get the VFS changes for syncing back to the main thread. */
   getChanges() {
     for (const [, entry] of this.openFiles) {
@@ -93552,21 +93856,30 @@ var BrowserFileIOAdapter = class {
     );
   }
   listDirRecursive(pattern) {
-    const idx = pattern.indexOf("**");
-    let baseDir = pattern.slice(0, idx);
+    const norm2 = pattern.replace(/\\/g, "/");
+    const idx = norm2.indexOf("**");
+    let baseDir = norm2.slice(0, idx);
     if (baseDir.endsWith("/")) baseDir = baseDir.slice(0, -1);
     if (!baseDir) baseDir = ".";
+    const absBase = this.vfs.normalizePath(baseDir);
+    if (this.vfs.exists(absBase) !== "dir") return [];
+    const suffix = norm2.slice(idx);
+    const DIRS = "\0";
+    const ANY = "
";
+    const re = new RegExp(
+      "^" + suffix.replace(/[.+^${}()|[\]\\]/g, "\\$&").replace(/\*\*\//g, DIRS).replace(/\*\*/g, ANY).replace(/\*/g, "[^/]*").replace(/\?/g, "[^/]").replace(new RegExp(DIRS, "g"), "(?:.*/)?").replace(new RegExp(ANY, "g"), ".*") + "$"
+    );
     const results = [];
-    const walkDir = (dir) => {
-      const entries = this.vfs.listDir(dir);
-      results.push(...entries);
-      for (const entry of entries) {
+    const walkDir = (dir, rel) => {
+      const relPrefix = rel ? rel + "/" : "";
+      for (const entry of this.vfs.listDir(dir)) {
+        if (re.test(relPrefix + entry.name)) results.push(entry);
         if (entry.isdir && entry.name !== "." && entry.name !== "..") {
-          walkDir(entry.folder + "/" + entry.name);
+          walkDir(entry.folder + "/" + entry.name, relPrefix + entry.name);
         }
       }
     };
-    walkDir(this.vfs.normalizePath(baseDir));
+    walkDir(absBase, "");
     return results;
   }
 };