@aexhq/sdk 0.25.2 → 0.26.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/dist/cli.mjs CHANGED
@@ -1,4 +1,4 @@
1
- #!/usr/bin/env node
1
+ #!/usr/bin/env bun
2
2
  var __defProp = Object.defineProperty;
3
3
  var __export = (target, all) => {
4
4
  for (var name in all)
@@ -218,6 +218,7 @@ var terminalRunStatuses = new Set(TERMINAL_RUN_STATUSES);
218
218
 
219
219
  // ../contracts/dist/runtime-sizes.js
220
220
  var RUNTIME_SIZE_PRESETS = {
221
+ "shared-1x-128mb": { cpus: 1, memoryMb: 128 },
221
222
  "shared-1x-256mb": { cpus: 1, memoryMb: 256 },
222
223
  "shared-1x-512mb": { cpus: 1, memoryMb: 512 },
223
224
  "shared-1x-1gb": { cpus: 1, memoryMb: 1024 },
@@ -699,10 +700,10 @@ function parseRunRequestConfigPrompt(value) {
699
700
  }
700
701
  if (Array.isArray(value)) {
701
702
  const arr = [];
702
- for (let i = 0; i < value.length; i++) {
703
- const item = value[i];
703
+ for (let i2 = 0; i2 < value.length; i2++) {
704
+ const item = value[i2];
704
705
  if (typeof item !== "string" || item.length === 0) {
705
- throw new Error(`run request config prompt[${i}] must be a non-empty string`);
706
+ throw new Error(`run request config prompt[${i2}] must be a non-empty string`);
706
707
  }
707
708
  arr.push(item);
708
709
  }
@@ -1084,8 +1085,8 @@ function parseArchiveTextValues(path, text) {
1084
1085
  if (/\.(?:jsonl|ndjson)$/i.test(path)) {
1085
1086
  const values = [];
1086
1087
  const lines = text.split(/\r?\n/);
1087
- for (let i = 0; i < lines.length; i++) {
1088
- const line = lines[i];
1088
+ for (let i2 = 0; i2 < lines.length; i2++) {
1089
+ const line = lines[i2];
1089
1090
  if (!line?.trim()) {
1090
1091
  continue;
1091
1092
  }
@@ -1093,7 +1094,7 @@ function parseArchiveTextValues(path, text) {
1093
1094
  if (!parsed.ok) {
1094
1095
  return Object.freeze([]);
1095
1096
  }
1096
- values.push({ path: `$[${i}]`, value: parsed.value });
1097
+ values.push({ path: `$[${i2}]`, value: parsed.value });
1097
1098
  }
1098
1099
  return Object.freeze(values);
1099
1100
  }
@@ -1421,7 +1422,7 @@ __export(operations_exports, {
1421
1422
  whoami: () => whoami
1422
1423
  });
1423
1424
 
1424
- // ../../node_modules/.pnpm/fflate@0.8.3/node_modules/fflate/esm/index.mjs
1425
+ // ../../node_modules/.bun/fflate@0.8.3/node_modules/fflate/esm/index.mjs
1425
1426
  import { createRequire } from "module";
1426
1427
  var require2 = createRequire("/");
1427
1428
  var _a;
@@ -1508,13 +1509,13 @@ var fdeb = new u8([
1508
1509
  var clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);
1509
1510
  var freb = function(eb, start) {
1510
1511
  var b = new u16(31);
1511
- for (var i = 0; i < 31; ++i) {
1512
- b[i] = start += 1 << eb[i - 1];
1512
+ for (var i2 = 0; i2 < 31; ++i2) {
1513
+ b[i2] = start += 1 << eb[i2 - 1];
1513
1514
  }
1514
1515
  var r = new i32(b[30]);
1515
- for (var i = 1; i < 30; ++i) {
1516
- for (var j = b[i]; j < b[i + 1]; ++j) {
1517
- r[j] = j - b[i] << 5 | i;
1516
+ for (var i2 = 1; i2 < 30; ++i2) {
1517
+ for (var j = b[i2]; j < b[i2 + 1]; ++j) {
1518
+ r[j] = j - b[i2] << 5 | i2;
1518
1519
  }
1519
1520
  }
1520
1521
  return { b, r };
@@ -1537,25 +1538,25 @@ var x;
1537
1538
  var i;
1538
1539
  var hMap = (function(cd, mb, r) {
1539
1540
  var s = cd.length;
1540
- var i = 0;
1541
+ var i2 = 0;
1541
1542
  var l = new u16(mb);
1542
- for (; i < s; ++i) {
1543
- if (cd[i])
1544
- ++l[cd[i] - 1];
1543
+ for (; i2 < s; ++i2) {
1544
+ if (cd[i2])
1545
+ ++l[cd[i2] - 1];
1545
1546
  }
1546
1547
  var le = new u16(mb);
1547
- for (i = 1; i < mb; ++i) {
1548
- le[i] = le[i - 1] + l[i - 1] << 1;
1548
+ for (i2 = 1; i2 < mb; ++i2) {
1549
+ le[i2] = le[i2 - 1] + l[i2 - 1] << 1;
1549
1550
  }
1550
1551
  var co;
1551
1552
  if (r) {
1552
1553
  co = new u16(1 << mb);
1553
1554
  var rvb = 15 - mb;
1554
- for (i = 0; i < s; ++i) {
1555
- if (cd[i]) {
1556
- var sv = i << 4 | cd[i];
1557
- var r_1 = mb - cd[i];
1558
- var v = le[cd[i] - 1]++ << r_1;
1555
+ for (i2 = 0; i2 < s; ++i2) {
1556
+ if (cd[i2]) {
1557
+ var sv = i2 << 4 | cd[i2];
1558
+ var r_1 = mb - cd[i2];
1559
+ var v = le[cd[i2] - 1]++ << r_1;
1559
1560
  for (var m = v | (1 << r_1) - 1; v <= m; ++v) {
1560
1561
  co[rev[v] >> rvb] = sv;
1561
1562
  }
@@ -1563,9 +1564,9 @@ var hMap = (function(cd, mb, r) {
1563
1564
  }
1564
1565
  } else {
1565
1566
  co = new u16(s);
1566
- for (i = 0; i < s; ++i) {
1567
- if (cd[i]) {
1568
- co[i] = rev[le[cd[i] - 1]++] >> 15 - cd[i];
1567
+ for (i2 = 0; i2 < s; ++i2) {
1568
+ if (cd[i2]) {
1569
+ co[i2] = rev[le[cd[i2] - 1]++] >> 15 - cd[i2];
1569
1570
  }
1570
1571
  }
1571
1572
  }
@@ -1642,9 +1643,9 @@ var wbits16 = function(d, p, v) {
1642
1643
  };
1643
1644
  var hTree = function(d, mb) {
1644
1645
  var t = [];
1645
- for (var i = 0; i < d.length; ++i) {
1646
- if (d[i])
1647
- t.push({ s: i, f: d[i] });
1646
+ for (var i2 = 0; i2 < d.length; ++i2) {
1647
+ if (d[i2])
1648
+ t.push({ s: i2, f: d[i2] });
1648
1649
  }
1649
1650
  var s = t.length;
1650
1651
  var t2 = t.slice();
@@ -1659,28 +1660,28 @@ var hTree = function(d, mb) {
1659
1660
  return a.f - b.f;
1660
1661
  });
1661
1662
  t.push({ s: -1, f: 25001 });
1662
- var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;
1663
+ var l = t[0], r = t[1], i0 = 0, i1 = 1, i22 = 2;
1663
1664
  t[0] = { s: -1, f: l.f + r.f, l, r };
1664
1665
  while (i1 != s - 1) {
1665
- l = t[t[i0].f < t[i2].f ? i0++ : i2++];
1666
- r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];
1666
+ l = t[t[i0].f < t[i22].f ? i0++ : i22++];
1667
+ r = t[i0 != i1 && t[i0].f < t[i22].f ? i0++ : i22++];
1667
1668
  t[i1++] = { s: -1, f: l.f + r.f, l, r };
1668
1669
  }
1669
1670
  var maxSym = t2[0].s;
1670
- for (var i = 1; i < s; ++i) {
1671
- if (t2[i].s > maxSym)
1672
- maxSym = t2[i].s;
1671
+ for (var i2 = 1; i2 < s; ++i2) {
1672
+ if (t2[i2].s > maxSym)
1673
+ maxSym = t2[i2].s;
1673
1674
  }
1674
1675
  var tr = new u16(maxSym + 1);
1675
1676
  var mbt = ln(t[i1 - 1], tr, 0);
1676
1677
  if (mbt > mb) {
1677
- var i = 0, dt = 0;
1678
+ var i2 = 0, dt = 0;
1678
1679
  var lft = mbt - mb, cst = 1 << lft;
1679
1680
  t2.sort(function(a, b) {
1680
1681
  return tr[b.s] - tr[a.s] || a.f - b.f;
1681
1682
  });
1682
- for (; i < s; ++i) {
1683
- var i2_1 = t2[i].s;
1683
+ for (; i2 < s; ++i2) {
1684
+ var i2_1 = t2[i2].s;
1684
1685
  if (tr[i2_1] > mb) {
1685
1686
  dt += cst - (1 << mbt - tr[i2_1]);
1686
1687
  tr[i2_1] = mb;
@@ -1689,14 +1690,14 @@ var hTree = function(d, mb) {
1689
1690
  }
1690
1691
  dt >>= lft;
1691
1692
  while (dt > 0) {
1692
- var i2_2 = t2[i].s;
1693
+ var i2_2 = t2[i2].s;
1693
1694
  if (tr[i2_2] < mb)
1694
1695
  dt -= 1 << mb - tr[i2_2]++ - 1;
1695
1696
  else
1696
- ++i;
1697
+ ++i2;
1697
1698
  }
1698
- for (; i >= 0 && dt; --i) {
1699
- var i2_3 = t2[i].s;
1699
+ for (; i2 >= 0 && dt; --i2) {
1700
+ var i2_3 = t2[i2].s;
1700
1701
  if (tr[i2_3] == mb) {
1701
1702
  --tr[i2_3];
1702
1703
  ++dt;
@@ -1718,8 +1719,8 @@ var lc = function(c) {
1718
1719
  var w = function(v) {
1719
1720
  cl[cli++] = v;
1720
1721
  };
1721
- for (var i = 1; i <= s; ++i) {
1722
- if (c[i] == cln && i != s)
1722
+ for (var i2 = 1; i2 <= s; ++i2) {
1723
+ if (c[i2] == cln && i2 != s)
1723
1724
  ++cls;
1724
1725
  else {
1725
1726
  if (!cln && cls > 2) {
@@ -1739,15 +1740,15 @@ var lc = function(c) {
1739
1740
  while (cls--)
1740
1741
  w(cln);
1741
1742
  cls = 1;
1742
- cln = c[i];
1743
+ cln = c[i2];
1743
1744
  }
1744
1745
  }
1745
1746
  return { c: cl.subarray(0, cli), n: s };
1746
1747
  };
1747
1748
  var clen = function(cf, cl) {
1748
1749
  var l = 0;
1749
- for (var i = 0; i < cl.length; ++i)
1750
- l += cf[i] * cl[i];
1750
+ for (var i2 = 0; i2 < cl.length; ++i2)
1751
+ l += cf[i2] * cl[i2];
1751
1752
  return l;
1752
1753
  };
1753
1754
  var wfblk = function(out, pos, dat) {
@@ -1757,8 +1758,8 @@ var wfblk = function(out, pos, dat) {
1757
1758
  out[o + 1] = s >> 8;
1758
1759
  out[o + 2] = out[o] ^ 255;
1759
1760
  out[o + 3] = out[o + 1] ^ 255;
1760
- for (var i = 0; i < s; ++i)
1761
- out[o + i + 4] = dat[i];
1761
+ for (var i2 = 0; i2 < s; ++i2)
1762
+ out[o + i2 + 4] = dat[i2];
1762
1763
  return (o + 4 + s) * 8;
1763
1764
  };
1764
1765
  var wblk = function(dat, out, final, syms, lf, df, eb, li, bs, bl, p) {
@@ -1769,10 +1770,10 @@ var wblk = function(dat, out, final, syms, lf, df, eb, li, bs, bl, p) {
1769
1770
  var _c = lc(dlt), lclt = _c.c, nlc = _c.n;
1770
1771
  var _d = lc(ddt), lcdt = _d.c, ndc = _d.n;
1771
1772
  var lcfreq = new u16(19);
1772
- for (var i = 0; i < lclt.length; ++i)
1773
- ++lcfreq[lclt[i] & 31];
1774
- for (var i = 0; i < lcdt.length; ++i)
1775
- ++lcfreq[lcdt[i] & 31];
1773
+ for (var i2 = 0; i2 < lclt.length; ++i2)
1774
+ ++lcfreq[lclt[i2] & 31];
1775
+ for (var i2 = 0; i2 < lcdt.length; ++i2)
1776
+ ++lcfreq[lcdt[i2] & 31];
1776
1777
  var _e = hTree(lcfreq, 7), lct = _e.t, mlcb = _e.l;
1777
1778
  var nlcc = 19;
1778
1779
  for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)
@@ -1791,24 +1792,24 @@ var wblk = function(dat, out, final, syms, lf, df, eb, li, bs, bl, p) {
1791
1792
  wbits(out, p + 5, ndc - 1);
1792
1793
  wbits(out, p + 10, nlcc - 4);
1793
1794
  p += 14;
1794
- for (var i = 0; i < nlcc; ++i)
1795
- wbits(out, p + 3 * i, lct[clim[i]]);
1795
+ for (var i2 = 0; i2 < nlcc; ++i2)
1796
+ wbits(out, p + 3 * i2, lct[clim[i2]]);
1796
1797
  p += 3 * nlcc;
1797
1798
  var lcts = [lclt, lcdt];
1798
1799
  for (var it = 0; it < 2; ++it) {
1799
1800
  var clct = lcts[it];
1800
- for (var i = 0; i < clct.length; ++i) {
1801
- var len = clct[i] & 31;
1801
+ for (var i2 = 0; i2 < clct.length; ++i2) {
1802
+ var len = clct[i2] & 31;
1802
1803
  wbits(out, p, llm[len]), p += lct[len];
1803
1804
  if (len > 15)
1804
- wbits(out, p, clct[i] >> 5 & 127), p += clct[i] >> 12;
1805
+ wbits(out, p, clct[i2] >> 5 & 127), p += clct[i2] >> 12;
1805
1806
  }
1806
1807
  }
1807
1808
  } else {
1808
1809
  lm = flm, ll = flt, dm = fdm, dl = fdt;
1809
1810
  }
1810
- for (var i = 0; i < li; ++i) {
1811
- var sym = syms[i];
1811
+ for (var i2 = 0; i2 < li; ++i2) {
1812
+ var sym = syms[i2];
1812
1813
  if (sym > 255) {
1813
1814
  var len = sym >> 18 & 31;
1814
1815
  wbits16(out, p, lm[len + 257]), p += ll[len + 257];
@@ -1841,36 +1842,36 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
1841
1842
  var msk_1 = (1 << plvl) - 1;
1842
1843
  var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);
1843
1844
  var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;
1844
- var hsh = function(i2) {
1845
- return (dat[i2] ^ dat[i2 + 1] << bs1_1 ^ dat[i2 + 2] << bs2_1) & msk_1;
1845
+ var hsh = function(i3) {
1846
+ return (dat[i3] ^ dat[i3 + 1] << bs1_1 ^ dat[i3 + 2] << bs2_1) & msk_1;
1846
1847
  };
1847
1848
  var syms = new i32(25e3);
1848
1849
  var lf = new u16(288), df = new u16(32);
1849
- var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;
1850
- for (; i + 2 < s; ++i) {
1851
- var hv = hsh(i);
1852
- var imod = i & 32767, pimod = head[hv];
1850
+ var lc_1 = 0, eb = 0, i2 = st.i || 0, li = 0, wi = st.w || 0, bs = 0;
1851
+ for (; i2 + 2 < s; ++i2) {
1852
+ var hv = hsh(i2);
1853
+ var imod = i2 & 32767, pimod = head[hv];
1853
1854
  prev[imod] = pimod;
1854
1855
  head[hv] = imod;
1855
- if (wi <= i) {
1856
- var rem = s - i;
1856
+ if (wi <= i2) {
1857
+ var rem = s - i2;
1857
1858
  if ((lc_1 > 7e3 || li > 24576) && (rem > 423 || !lst)) {
1858
- pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);
1859
- li = lc_1 = eb = 0, bs = i;
1859
+ pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i2 - bs, pos);
1860
+ li = lc_1 = eb = 0, bs = i2;
1860
1861
  for (var j = 0; j < 286; ++j)
1861
1862
  lf[j] = 0;
1862
1863
  for (var j = 0; j < 30; ++j)
1863
1864
  df[j] = 0;
1864
1865
  }
1865
1866
  var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;
1866
- if (rem > 2 && hv == hsh(i - dif)) {
1867
+ if (rem > 2 && hv == hsh(i2 - dif)) {
1867
1868
  var maxn = Math.min(n, rem) - 1;
1868
- var maxd = Math.min(32767, i);
1869
+ var maxd = Math.min(32767, i2);
1869
1870
  var ml = Math.min(258, rem);
1870
1871
  while (dif <= maxd && --ch_1 && imod != pimod) {
1871
- if (dat[i + l] == dat[i + l - dif]) {
1872
+ if (dat[i2 + l] == dat[i2 + l - dif]) {
1872
1873
  var nl = 0;
1873
- for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)
1874
+ for (; nl < ml && dat[i2 + nl] == dat[i2 + nl - dif]; ++nl)
1874
1875
  ;
1875
1876
  if (nl > l) {
1876
1877
  l = nl, d = dif;
@@ -1879,7 +1880,7 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
1879
1880
  var mmd = Math.min(dif, nl - 2);
1880
1881
  var md = 0;
1881
1882
  for (var j = 0; j < mmd; ++j) {
1882
- var ti = i - dif + j & 32767;
1883
+ var ti = i2 - dif + j & 32767;
1883
1884
  var pti = prev[ti];
1884
1885
  var cd = ti - pti & 32767;
1885
1886
  if (cd > md)
@@ -1897,32 +1898,32 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
1897
1898
  eb += fleb[lin] + fdeb[din];
1898
1899
  ++lf[257 + lin];
1899
1900
  ++df[din];
1900
- wi = i + l;
1901
+ wi = i2 + l;
1901
1902
  ++lc_1;
1902
1903
  } else {
1903
- syms[li++] = dat[i];
1904
- ++lf[dat[i]];
1904
+ syms[li++] = dat[i2];
1905
+ ++lf[dat[i2]];
1905
1906
  }
1906
1907
  }
1907
1908
  }
1908
- for (i = Math.max(i, wi); i < s; ++i) {
1909
- syms[li++] = dat[i];
1910
- ++lf[dat[i]];
1909
+ for (i2 = Math.max(i2, wi); i2 < s; ++i2) {
1910
+ syms[li++] = dat[i2];
1911
+ ++lf[dat[i2]];
1911
1912
  }
1912
- pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);
1913
+ pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i2 - bs, pos);
1913
1914
  if (!lst) {
1914
1915
  st.r = pos & 7 | w[pos / 8 | 0] << 3;
1915
1916
  pos -= 7;
1916
- st.h = head, st.p = prev, st.i = i, st.w = wi;
1917
+ st.h = head, st.p = prev, st.i = i2, st.w = wi;
1917
1918
  }
1918
1919
  } else {
1919
- for (var i = st.w || 0; i < s + lst; i += 65535) {
1920
- var e = i + 65535;
1920
+ for (var i2 = st.w || 0; i2 < s + lst; i2 += 65535) {
1921
+ var e = i2 + 65535;
1921
1922
  if (e >= s) {
1922
1923
  w[pos / 8 | 0] = lst;
1923
1924
  e = s;
1924
1925
  }
1925
- pos = wfblk(w, pos + 1, dat.subarray(i, e));
1926
+ pos = wfblk(w, pos + 1, dat.subarray(i2, e));
1926
1927
  }
1927
1928
  st.i = s;
1928
1929
  }
@@ -1930,11 +1931,11 @@ var dflt = function(dat, lvl, plvl, pre, post, st) {
1930
1931
  };
1931
1932
  var crct = /* @__PURE__ */ (function() {
1932
1933
  var t = new Int32Array(256);
1933
- for (var i = 0; i < 256; ++i) {
1934
- var c = i, k = 9;
1934
+ for (var i2 = 0; i2 < 256; ++i2) {
1935
+ var c = i2, k = 9;
1935
1936
  while (--k)
1936
1937
  c = (c & 1 && -306674912) ^ c >>> 1;
1937
- t[i] = c;
1938
+ t[i2] = c;
1938
1939
  }
1939
1940
  return t;
1940
1941
  })();
@@ -1943,8 +1944,8 @@ var crc = function() {
1943
1944
  return {
1944
1945
  p: function(d) {
1945
1946
  var cr = c;
1946
- for (var i = 0; i < d.length; ++i)
1947
- cr = crct[cr & 255 ^ d[i]] ^ cr >>> 8;
1947
+ for (var i2 = 0; i2 < d.length; ++i2)
1948
+ cr = crct[cr & 255 ^ d[i2]] ^ cr >>> 8;
1948
1949
  c = cr;
1949
1950
  },
1950
1951
  d: function() {
@@ -2005,8 +2006,8 @@ try {
2005
2006
  function strToU8(str, latin1) {
2006
2007
  if (latin1) {
2007
2008
  var ar_1 = new u8(str.length);
2008
- for (var i = 0; i < str.length; ++i)
2009
- ar_1[i] = str.charCodeAt(i);
2009
+ for (var i2 = 0; i2 < str.length; ++i2)
2010
+ ar_1[i2] = str.charCodeAt(i2);
2010
2011
  return ar_1;
2011
2012
  }
2012
2013
  if (te)
@@ -2017,19 +2018,19 @@ function strToU8(str, latin1) {
2017
2018
  var w = function(v) {
2018
2019
  ar[ai++] = v;
2019
2020
  };
2020
- for (var i = 0; i < l; ++i) {
2021
+ for (var i2 = 0; i2 < l; ++i2) {
2021
2022
  if (ai + 5 > ar.length) {
2022
- var n = new u8(ai + 8 + (l - i << 1));
2023
+ var n = new u8(ai + 8 + (l - i2 << 1));
2023
2024
  n.set(ar);
2024
2025
  ar = n;
2025
2026
  }
2026
- var c = str.charCodeAt(i);
2027
+ var c = str.charCodeAt(i2);
2027
2028
  if (c < 128 || latin1)
2028
2029
  w(c);
2029
2030
  else if (c < 2048)
2030
2031
  w(192 | c >> 6), w(128 | c & 63);
2031
2032
  else if (c > 55295 && c < 57344)
2032
- c = 65536 + (c & 1023 << 10) | str.charCodeAt(++i) & 1023, w(240 | c >> 18), w(128 | c >> 12 & 63), w(128 | c >> 6 & 63), w(128 | c & 63);
2033
+ c = 65536 + (c & 1023 << 10) | str.charCodeAt(++i2) & 1023, w(240 | c >> 18), w(128 | c >> 12 & 63), w(128 | c >> 6 & 63), w(128 | c & 63);
2033
2034
  else
2034
2035
  w(224 | c >> 12), w(128 | c >> 6 & 63), w(128 | c & 63);
2035
2036
  }
@@ -2126,8 +2127,8 @@ function zipSync(data, opts) {
2126
2127
  tot += 76 + 2 * (s + exl) + (ms || 0) + l;
2127
2128
  }
2128
2129
  var out = new u8(tot + 22), oe = o, cdl = tot - o;
2129
- for (var i = 0; i < files.length; ++i) {
2130
- var f = files[i];
2130
+ for (var i2 = 0; i2 < files.length; ++i2) {
2131
+ var f = files[i2];
2131
2132
  wzh(out, f.o, f, f.f, f.u, f.c.length);
2132
2133
  var badd = 30 + f.f.length + exfl(f.extra);
2133
2134
  out.set(f.c, f.o + badd);
@@ -2835,21 +2836,21 @@ function parseCommonHostFlags(argv) {
2835
2836
  let aexUrl = null;
2836
2837
  let debug = false;
2837
2838
  const rest = [];
2838
- for (let i = 0; i < argv.length; i++) {
2839
- const arg = argv[i];
2839
+ for (let i2 = 0; i2 < argv.length; i2++) {
2840
+ const arg = argv[i2];
2840
2841
  if (arg === "--debug") {
2841
2842
  debug = true;
2842
2843
  continue;
2843
2844
  }
2844
2845
  if (arg === "--api-token") {
2845
- const v = argv[++i];
2846
+ const v = argv[++i2];
2846
2847
  if (v === void 0)
2847
2848
  return { ok: false, reason: "--api-token requires a value" };
2848
2849
  apiToken = v;
2849
2850
  continue;
2850
2851
  }
2851
2852
  if (arg === "--aex-url") {
2852
- const v = argv[++i];
2853
+ const v = argv[++i2];
2853
2854
  if (v === void 0)
2854
2855
  return { ok: false, reason: "--aex-url requires a value" };
2855
2856
  aexUrl = v;
@@ -2905,10 +2906,10 @@ function emitJsonError(io2, code, message, extra = {}) {
2905
2906
  function collectRepeatedKv(rest, flag) {
2906
2907
  const entries = {};
2907
2908
  const remaining = [];
2908
- for (let i = 0; i < rest.length; i++) {
2909
- const arg = rest[i];
2909
+ for (let i2 = 0; i2 < rest.length; i2++) {
2910
+ const arg = rest[i2];
2910
2911
  if (arg === flag) {
2911
- const kv = rest[++i];
2912
+ const kv = rest[++i2];
2912
2913
  if (kv === void 0) {
2913
2914
  return { entries, remaining, error: `${flag} requires a KEY=VALUE argument` };
2914
2915
  }
@@ -2926,10 +2927,10 @@ function collectRepeatedKv(rest, flag) {
2926
2927
  function collectRepeated(rest, flag) {
2927
2928
  const values = [];
2928
2929
  const remaining = [];
2929
- for (let i = 0; i < rest.length; i++) {
2930
- const arg = rest[i];
2930
+ for (let i2 = 0; i2 < rest.length; i2++) {
2931
+ const arg = rest[i2];
2931
2932
  if (arg === flag) {
2932
- const v = rest[++i];
2933
+ const v = rest[++i2];
2933
2934
  if (v === void 0) {
2934
2935
  return { values, remaining, error: `${flag} requires a value` };
2935
2936
  }
@@ -2943,10 +2944,10 @@ function collectRepeated(rest, flag) {
2943
2944
  function collectRepeatedKvList(rest, flag) {
2944
2945
  const entries = [];
2945
2946
  const remaining = [];
2946
- for (let i = 0; i < rest.length; i++) {
2947
- const arg = rest[i];
2947
+ for (let i2 = 0; i2 < rest.length; i2++) {
2948
+ const arg = rest[i2];
2948
2949
  if (arg === flag) {
2949
- const kv = rest[++i];
2950
+ const kv = rest[++i2];
2950
2951
  if (kv === void 0) {
2951
2952
  return { entries, remaining, error: `${flag} requires a KEY=VALUE argument` };
2952
2953
  }
@@ -2964,10 +2965,10 @@ function collectRepeatedKvList(rest, flag) {
2964
2965
  function takeFlagValue(rest, flag) {
2965
2966
  let value = null;
2966
2967
  const remaining = [];
2967
- for (let i = 0; i < rest.length; i++) {
2968
- const arg = rest[i];
2968
+ for (let i2 = 0; i2 < rest.length; i2++) {
2969
+ const arg = rest[i2];
2969
2970
  if (arg === flag) {
2970
- const v = rest[++i];
2971
+ const v = rest[++i2];
2971
2972
  if (v === void 0) {
2972
2973
  return { value, remaining, error: `${flag} requires a value` };
2973
2974
  }
@@ -3007,10 +3008,10 @@ function takeOptionFlag(rest, flag) {
3007
3008
  const remaining = [];
3008
3009
  let value;
3009
3010
  const prefix = `${flag}=`;
3010
- for (let i = 0; i < rest.length; i++) {
3011
- const arg = rest[i];
3011
+ for (let i2 = 0; i2 < rest.length; i2++) {
3012
+ const arg = rest[i2];
3012
3013
  if (arg === flag) {
3013
- const next = rest[++i];
3014
+ const next = rest[++i2];
3014
3015
  if (next !== void 0)
3015
3016
  value = next;
3016
3017
  continue;
@@ -3080,26 +3081,26 @@ function parseProxyFlags(rest) {
3080
3081
  let dataSpec = null;
3081
3082
  let responseMode = null;
3082
3083
  let showHelp = false;
3083
- for (let i = 0; i < rest.length; i++) {
3084
- const arg = rest[i];
3084
+ for (let i2 = 0; i2 < rest.length; i2++) {
3085
+ const arg = rest[i2];
3085
3086
  if (arg === "--help" || arg === "-h") {
3086
3087
  showHelp = true;
3087
3088
  continue;
3088
3089
  }
3089
3090
  if (arg === "--method") {
3090
- method = expect(rest, ++i, "--method");
3091
+ method = expect(rest, ++i2, "--method");
3091
3092
  continue;
3092
3093
  }
3093
3094
  if (arg === "--path") {
3094
- path = expect(rest, ++i, "--path");
3095
+ path = expect(rest, ++i2, "--path");
3095
3096
  continue;
3096
3097
  }
3097
3098
  if (arg === "--query") {
3098
- query = expect(rest, ++i, "--query");
3099
+ query = expect(rest, ++i2, "--query");
3099
3100
  continue;
3100
3101
  }
3101
3102
  if (arg === "--header") {
3102
- const kv = expect(rest, ++i, "--header");
3103
+ const kv = expect(rest, ++i2, "--header");
3103
3104
  const eq = kv.indexOf("=");
3104
3105
  if (eq <= 0)
3105
3106
  return { ok: false, reason: "--header must be in the form KEY=VALUE" };
@@ -3107,11 +3108,11 @@ function parseProxyFlags(rest) {
3107
3108
  continue;
3108
3109
  }
3109
3110
  if (arg === "--data") {
3110
- dataSpec = expect(rest, ++i, "--data");
3111
+ dataSpec = expect(rest, ++i2, "--data");
3111
3112
  continue;
3112
3113
  }
3113
3114
  if (arg === "--response-mode") {
3114
- responseMode = expect(rest, ++i, "--response-mode");
3115
+ responseMode = expect(rest, ++i2, "--response-mode");
3115
3116
  continue;
3116
3117
  }
3117
3118
  if (arg.startsWith("--")) {
@@ -3660,7 +3661,7 @@ async function runRunCmd(io2, argv) {
3660
3661
  let proxyEndpoints = runConfig.proxyEndpoints ?? [];
3661
3662
  if (proxyEndpointFlags.values.length > 0) {
3662
3663
  try {
3663
- proxyEndpoints = proxyEndpointFlags.values.map((raw, i) => parseJsonOrThrow(raw, `--proxy-endpoint[${i}]`));
3664
+ proxyEndpoints = proxyEndpointFlags.values.map((raw, i2) => parseJsonOrThrow(raw, `--proxy-endpoint[${i2}]`));
3664
3665
  } catch (err2) {
3665
3666
  io2.stderr(`${err2.message}
3666
3667
  `);
@@ -3734,8 +3735,8 @@ async function runRunCmd(io2, argv) {
3734
3735
  await sleep(2e3);
3735
3736
  try {
3736
3737
  const events = await operations_exports.listRunEvents(http, run.id);
3737
- for (let i = emittedEventCount; i < events.length; i++) {
3738
- io2.stdout(JSON.stringify(events[i]) + "\n");
3738
+ for (let i2 = emittedEventCount; i2 < events.length; i2++) {
3739
+ io2.stdout(JSON.stringify(events[i2]) + "\n");
3739
3740
  }
3740
3741
  emittedEventCount = events.length;
3741
3742
  } catch (err2) {
@@ -3814,16 +3815,16 @@ function stripMcpHeadersForParsing(input) {
3814
3815
  if (!Array.isArray(record.mcpServers)) {
3815
3816
  return { normalised: input, mcpHeaders };
3816
3817
  }
3817
- const stripped = record.mcpServers.map((entry, i) => {
3818
+ const stripped = record.mcpServers.map((entry, i2) => {
3818
3819
  if (!entry || typeof entry !== "object")
3819
3820
  return entry;
3820
3821
  const r = entry;
3821
3822
  if (r.headers && typeof r.headers === "object" && !Array.isArray(r.headers)) {
3822
- const name = typeof r.name === "string" ? r.name : `__index_${i}__`;
3823
+ const name = typeof r.name === "string" ? r.name : `__index_${i2}__`;
3823
3824
  const headerObj = {};
3824
3825
  for (const [k, v] of Object.entries(r.headers)) {
3825
3826
  if (typeof v !== "string") {
3826
- throw new Error(`mcpServers[${i}].headers["${k}"] must be a string`);
3827
+ throw new Error(`mcpServers[${i2}].headers["${k}"] must be a string`);
3827
3828
  }
3828
3829
  headerObj[k] = v;
3829
3830
  }
@@ -3956,7 +3957,7 @@ async function runSkillsUpload(io2, argv) {
3956
3957
  async function sha256Hex(bytes) {
3957
3958
  const subtle = globalThis.crypto?.subtle;
3958
3959
  if (!subtle)
3959
- throw new Error("aex skills upload: globalThis.crypto.subtle is required (Node 18+)");
3960
+ throw new Error("aex skills upload: globalThis.crypto.subtle is required (Bun or Node 18+)");
3960
3961
  const copy = new Uint8Array(bytes.byteLength);
3961
3962
  copy.set(bytes);
3962
3963
  const digest = await subtle.digest("SHA-256", copy.buffer);
@@ -1 +1 @@
1
- 731645495d2d705531e428f4e587cb0cbc7e3e3324e6fcdaa20154ef04572466 cli.mjs
1
+ d0dc68d74ec69d84d75b2e4399e8cff02ac5dda7ab34021bddb2125c83e00c1e cli.mjs
@@ -21,7 +21,7 @@ export async function fetchSkillArchive(url, opts = {}) {
21
21
  const fetchImpl = opts.fetch ?? globalThis.fetch;
22
22
  if (typeof fetchImpl !== "function") {
23
23
  throw new Error("Skill.fromUrl: global fetch is unavailable; pass args.fetch " +
24
- "(Node 18+ or a fetch-capable runtime is required)");
24
+ "(Bun, Node 18+, or a fetch-capable runtime is required)");
25
25
  }
26
26
  const bytes = await download(url, fetchImpl, opts.timeoutMs ?? DEFAULT_TIMEOUT_MS);
27
27
  if (opts.sha256) {
@@ -155,7 +155,7 @@ async function sha256Hex(bytes) {
155
155
  const subtle = globalThis.crypto?.subtle;
156
156
  if (!subtle) {
157
157
  throw new Error("Skill.fromUrl: globalThis.crypto.subtle is unavailable; " +
158
- "Node 18+ or a Web-Crypto-capable runtime is required");
158
+ "Bun, Node 18+, or a Web-Crypto-capable runtime is required");
159
159
  }
160
160
  const copy = new Uint8Array(bytes.byteLength);
161
161
  copy.set(bytes);