@lewismoten/gamemaker-sandbox-engine 0.0.0-stage → 3.3.0

package/dist/formats/fli.js

@@ -0,0 +1,340 @@
+import { PALETTE_SIZE as q } from "./palette.js";
+const J = 4096 * 4096, X = 44817, I = 44818, Q = 61946;
+function ot(e) {
+  const t = e[4] | e[5] << 8;
+  return t === X || t === I;
+}
+function st(e) {
+  if (e.length < 128) throw new Error("Not an FLI file: shorter than its 128-byte header");
+  const t = new DataView(e.buffer, e.byteOffset, e.byteLength), l = t.getUint16(4, !0);
+  if (l !== X && l !== I) throw new Error("Not an FLI file");
+  const c = t.getUint16(6, !0), i = t.getUint16(8, !0) || 320, o = t.getUint16(10, !0) || 200;
+  if (i * o > J) throw new Error(`FLI picture ${i} x ${o} is too large to open`);
+  let h = t.getUint16(16, !0);
+  l === I && (h = Math.round(t.getUint32(16, !0) * 70 / 1e3));
+  let u = l === I && t.getUint32(80, !0) || 128;
+  const n = [];
+  for (; u + 16 <= e.length && n.length <= c; ) {
+    const s = t.getUint32(u, !0), r = t.getUint16(u + 4, !0);
+    if (s < 16) break;
+    r === Q && n.push(u), u += s;
+  }
+  return { width: i, height: o, frameCount: c, speed: h, frames: n, bytes: e };
+}
+function lt(e) {
+  return { pixels: new Uint8Array(e.width * e.height), palette: new Uint8Array(q) };
+}
+function it(e, t, l) {
+  const c = e.frames[t];
+  if (c === void 0) return !1;
+  const i = e.bytes, o = new DataView(i.buffer, i.byteOffset, i.byteLength), h = o.getUint32(c, !0), u = o.getUint16(c + 6, !0), n = Math.min(i.length, c + h);
+  let s = c + 16, r = !1;
+  for (let g = 0; g < u && s + 6 <= n; g++) {
+    const f = o.getUint32(s, !0), d = o.getUint16(s + 4, !0), a = s + 6, w = Math.min(n, s + Math.max(f, 6));
+    switch (d) {
+      case 11:
+      // FLI_COLOR (0..63)
+      case 4:
+        W(i, a, l.palette, d === 4), r = !0;
+        break;
+      case 12:
+        b(i, a, w, e.width, l.pixels);
+        break;
+      case 7:
+        x(i, a, w, e.width, e.height, l.pixels);
+        break;
+      case 13:
+        l.pixels.fill(0);
+        break;
+      case 15:
+        Y(i, a, w, e.width, e.height, l.pixels);
+        break;
+      case 16:
+        l.pixels.set(i.subarray(a, Math.min(w, a + l.pixels.length)));
+        break;
+    }
+    if (f < 6) break;
+    s += f;
+  }
+  return r;
+}
+function W(e, t, l, c) {
+  const i = e[t] | e[t + 1] << 8;
+  t += 2;
+  let o = 0;
+  for (let h = 0; h < i; h++) {
+    o += e[t++];
+    let u = e[t++];
+    u === 0 && (u = 256);
+    for (let n = 0; n < u && o < 256; n++, o++)
+      for (let s = 0; s < 3; s++) {
+        const r = e[t++] ?? 0;
+        l[o * 3 + s] = c ? r >> 2 : r & 63;
+      }
+  }
+}
+function Y(e, t, l, c, i, o) {
+  for (let h = 0; h < i && t < l; h++) {
+    t++;
+    let u = 0;
+    const n = h * c;
+    for (; u < c && t < l; ) {
+      const s = e[t++] << 24 >> 24;
+      if (s >= 0) {
+        const r = e[t++];
+        for (let g = 0; g < s && u < c; g++) o[n + u++] = r;
+      } else
+        for (let r = 0; r < -s && u < c; r++) o[n + u++] = e[t++];
+    }
+  }
+}
+function b(e, t, l, c, i) {
+  let o = e[t] | e[t + 1] << 8;
+  const h = e[t + 2] | e[t + 3] << 8;
+  t += 4;
+  for (let u = 0; u < h && t < l; u++, o++) {
+    const n = e[t++];
+    let s = 0;
+    for (let r = 0; r < n && t < l; r++) {
+      s += e[t++];
+      const g = e[t++] << 24 >> 24, f = o * c;
+      if (g >= 0)
+        for (let d = 0; d < g; d++) i[f + s++] = e[t++];
+      else {
+        const d = e[t++];
+        for (let a = 0; a < -g; a++) i[f + s++] = d;
+      }
+    }
+  }
+}
+function x(e, t, l, c, i, o) {
+  let h = e[t] | e[t + 1] << 8;
+  t += 2;
+  let u = 0;
+  for (; h > 0 && t < l && u < i; ) {
+    let n = (e[t] | e[t + 1] << 8) << 16 >> 16;
+    if (t += 2, (n & 49152) === 49152) {
+      u -= n;
+      continue;
+    }
+    (n & 49152) === 32768 && (o[u * c + c - 1] = n & 255, n = (e[t] | e[t + 1] << 8) << 16 >> 16, t += 2);
+    let s = 0;
+    const r = u * c;
+    for (let g = 0; g < n && t < l; g++) {
+      s += e[t++];
+      const f = e[t++] << 24 >> 24;
+      if (f >= 0)
+        for (let d = 0; d < f; d++)
+          o[r + s++] = e[t++], o[r + s++] = e[t++];
+      else {
+        const d = e[t++], a = e[t++];
+        for (let w = 0; w < -f; w++)
+          o[r + s++] = d, o[r + s++] = a;
+      }
+    }
+    u++, h--;
+  }
+}
+function j(e, t, l, c) {
+  for (let i = l; i < c; i++) e.push(t[i]);
+}
+function v(e, t) {
+  for (let l = 0; l < t.length; l++) e.push(t[l]);
+}
+function T(e, t, l) {
+  const c = [];
+  for (let i = 0; i < l; i++) {
+    const o = i * t, h = [];
+    let u = 0, n = 0;
+    for (; n < t; ) {
+      let s = 1;
+      for (; n + s < t && s < 127 && e[o + n + s] === e[o + n]; ) s++;
+      if (s >= 3 || n + s >= t)
+        h.push(s, e[o + n]), n += s;
+      else {
+        let r = 0;
+        for (; n + r < t && r < 128 && !(n + r + 2 < t && e[o + n + r] === e[o + n + r + 1] && e[o + n + r] === e[o + n + r + 2]); ) r++;
+        h.push(256 - r & 255), j(h, e, o + n, o + n + r), n += r;
+      }
+      u++;
+    }
+    c.push(Math.min(255, u)), v(c, h);
+  }
+  return c;
+}
+const S = 16e3, H = 127;
+function M(e, t, l, c, i) {
+  const o = l * c, h = [0];
+  let u = 0, n = 0, s = 0;
+  for (; n < c; ) {
+    if (e[o + n] === t[o + n]) {
+      n++;
+      continue;
+    }
+    let r = n;
+    for (; r < c && r - n < 127 && (e[o + r] !== t[o + r] || r + 1 < c && e[o + r + 1] !== t[o + r + 1]); ) r++;
+    let g = n - s;
+    for (; g > 255; )
+      h.push(255, 0), u++, g -= 255;
+    const f = r - n;
+    let d = !0;
+    for (let a = o + n + 1; a < o + r; a++)
+      if (t[a] !== t[o + n]) {
+        d = !1;
+        break;
+      }
+    i && !d ? u += tt(t, o + n, o + r, g, h) : (d && f > 2 ? h.push(g, 256 - f & 255, t[o + n]) : (h.push(g, f), j(h, t, o + n, o + r)), u++), s = r, n = r;
+  }
+  return u > H ? i ? M(e, t, l, c, !1) : void 0 : (h[0] = u, h);
+}
+function K(e, t, l, c) {
+  let i = 0;
+  for (; i < c && P(e, t, i, l); ) i++;
+  if (i === c) return;
+  let o = c - 1;
+  for (; o > i && P(e, t, o, l); ) o--;
+  return [i, o];
+}
+const O = (e, t) => [e & 255, e >> 8, t & 255, t >> 8];
+function p(e, t, l, c, i = !1) {
+  const o = K(e, t, l, c);
+  if (!o) return [0, 0, 0, 0];
+  const [h, u] = o, n = O(h, u - h + 1);
+  for (let s = h; s <= u; s++) {
+    const r = M(e, t, s, l, i);
+    if (!r) return;
+    v(n, r);
+  }
+  return n;
+}
+function V(e, t, l, c, i) {
+  const o = K(e, t, l, c);
+  if (!o) return [y(12, [0, 0, 0, 0])];
+  const h = i - 6 - 1 - 4, u = [];
+  let n = [], s = 0, r = 0;
+  const g = () => {
+    for (; n.length && n[n.length - 1].length === 1 && n[n.length - 1][0] === 0; ) n.pop();
+    if (n.length) {
+      const f = O(r, n.length);
+      for (const d of n) v(f, d);
+      u.push(y(12, f));
+    }
+    n = [], s = 0;
+  };
+  for (let f = o[0]; f <= o[1]; f++) {
+    const d = P(e, t, f, l), a = d ? [0] : M(e, t, f, l, !1), w = d ? void 0 : M(e, t, f, l, !0), k = w && (!a || w.length < a.length) ? w : a;
+    if (!k) throw new Error(`FLI line ${f} needs more than ${H} packets`);
+    if (s + k.length > h && g(), !n.length) {
+      if (d) continue;
+      r = f;
+    }
+    n.push(k), s += k.length;
+  }
+  return g(), u;
+}
+function tt(e, t, l, c, i) {
+  let o = 0, h = t;
+  const u = (s) => {
+    s > h && (i.push(o ? 0 : c, s - h), j(i, e, h, s), o++);
+  };
+  let n = t;
+  for (; n < l; ) {
+    let s = 1;
+    for (; n + s < l && s < 127 && e[n + s] === e[n]; ) s++;
+    if (s >= 3)
+      u(n), i.push(o ? 0 : c, 256 - s & 255, e[n]), o++, n += s, h = n;
+    else
+      for (n += s; n - h > 127; )
+        u(h + 127), h += 127;
+  }
+  return u(l), o;
+}
+function P(e, t, l, c) {
+  for (let i = l * c, o = i + c; i < o; i++) if (e[i] !== t[i]) return !1;
+  return !0;
+}
+function y(e, t) {
+  let l = t.length + 6;
+  const c = l & 1;
+  l += c;
+  const i = [l & 255, l >> 8 & 255, l >> 16 & 255, l >>> 24, e & 255, e >> 8];
+  return v(i, t), c && i.push(0), i;
+}
+function et(e, t, l) {
+  const c = new Uint8Array(256);
+  for (let n = 0; n < e.length; n++) c[e[n]] = 1;
+  const i = (n) => c[n] === 1 && [0, 1, 2].some((s) => (t[n * 3 + s] & 63) !== l[n * 3 + s]), o = [];
+  let h = 0, u = 0;
+  for (let n = 0; n < 256; ) {
+    if (!i(n)) {
+      n++;
+      continue;
+    }
+    let s = n;
+    for (; s < 256 && s - n < 255 && i(s); ) s++;
+    o.push(n - u, s - n);
+    for (let r = n * 3; r < s * 3; r++)
+      o.push(t[r] & 63), l[r] = t[r] & 63;
+    h++, u = s, n = s;
+  }
+  return h ? [h & 255, h >> 8, ...o] : void 0;
+}
+function rt(e, t, l = {}) {
+  const c = l.width ?? 320, i = l.height ?? 200, o = !l.noLoopFrame, h = o ? [...e, e[0]] : e, u = l.palettes ? [...e.map((a, w) => l.palettes[w] ?? t), ...o ? [l.palettes[0] ?? t] : []] : void 0, n = new Uint8Array(768), s = h.map((a, w) => {
+    const k = [], A = u?.[w] ?? t;
+    if (l.sparsePalettes && w > 0) {
+      const L = et(a, A, n);
+      L && k.push(y(11, L));
+    } else if (w === 0 || u && u[w - 1].some((L, U) => U < 768 && (L & 63) !== (A[U] & 63))) {
+      const L = [1, 0, 0, 0];
+      for (let U = 0; U < 768; U++) L.push(A[U] & 63);
+      k.push(y(11, L));
+      for (let U = 0; U < 768; U++) n[U] = A[U] & 63;
+    }
+    const m = w > 0 ? h[w - 1] : void 0, C = m ? p(m, a, c, i, l.runs) : void 0, _ = C && C.length < 64e3 ? void 0 : T(a, c, i), D = C && (!_ || C.length < _.length) ? y(12, C) : y(15, _ ?? T(a, c, i));
+    if (D.length <= S) k.push(D);
+    else {
+      const L = V(
+        a.map((F) => F ^ 1),
+        a,
+        c,
+        i,
+        S
+      ), U = m ? V(m, a, c, i, S) : void 0, G = (F) => F.reduce((z, Z) => z + Z.length, 0), R = U && G(U) <= G(L) ? U : L, B = w === 0 || u && u[w - 1].every((F, z) => z >= 768 || (F & 63) === 0);
+      k.length && B ? k.splice(0, 0, ...R) : k.push(...R);
+    }
+    const N = k.flat(), E = N.length + 16, $ = [
+      E & 255,
+      E >> 8 & 255,
+      E >> 16 & 255,
+      E >>> 24,
+      250,
+      241,
+      k.length & 255,
+      k.length >> 8,
+      0,
+      0,
+      0,
+      0,
+      0,
+      0,
+      0,
+      0
+    ];
+    return v($, N), $;
+  }), r = 128 + s.reduce((a, w) => a + w.length, 0), g = new Uint8Array(r), f = new DataView(g.buffer);
+  f.setUint32(0, r, !0), f.setUint16(4, 44817, !0), f.setUint16(6, e.length, !0), f.setUint16(8, c, !0), f.setUint16(10, i, !0), f.setUint16(12, 8, !0), f.setUint16(16, l.speed ?? 5, !0);
+  let d = 128;
+  for (const a of s)
+    g.set(a, d), d += a.length;
+  return g;
+}
+export {
+  S as FLI_CHUNK_MAX,
+  J as FLI_MAX_PIXELS,
+  it as applyFliFrame,
+  rt as encodeFli,
+  ot as isFli,
+  lt as newFliCanvas,
+  st as parseFli
+};

package/dist/formats/fliFrames.js

@@ -0,0 +1,34 @@
+import { parseFli as h, newFliCanvas as p, applyFliFrame as u, encodeFli as d } from "./fli.js";
+const F = 128 << 20;
+function M(t) {
+  const e = h(t), o = p(e), n = [], r = Math.min(e.frameCount, e.frames.length);
+  if (r * e.width * e.height > F) throw new Error("FLI animation is too large to take apart");
+  for (let i = 0; i < r; i++)
+    u(e, i, o), n.push({ pixels: o.pixels.slice(), palette: o.palette.slice() });
+  return { width: e.width, height: e.height, speed: e.speed, frames: n };
+}
+function g(t) {
+  if (!t.frames.length) throw new Error("An animation needs at least one frame");
+  return d(
+    t.frames.map((e) => e.pixels),
+    t.frames[0].palette,
+    { width: t.width, height: t.height, speed: Math.max(0, Math.min(65535, Math.round(t.speed))), palettes: t.frames.map((e) => e.palette) }
+  );
+}
+function w(t, e, o, n, r) {
+  const i = new Uint8Array(n * r), f = Math.floor((n - e) / 2), m = Math.floor((r - o) / 2);
+  for (let s = 0; s < r; s++) {
+    const l = s - m;
+    if (!(l < 0 || l >= o))
+      for (let a = 0; a < n; a++) {
+        const c = a - f;
+        c >= 0 && c < e && (i[s * n + a] = t[l * e + c]);
+      }
+  }
+  return i;
+}
+export {
+  M as decodeFliFrames,
+  g as encodeFliFrames,
+  w as fitPicture
+};

package/dist/formats/fliLimits.js

@@ -0,0 +1,54 @@
+import { FLI_CHUNK_MAX as g, isFli as p, parseFli as k } from "./fli.js";
+const $ = /* @__PURE__ */ new Set([11, 12, 13, 15, 16]);
+function M(e) {
+  if (e.length < 128 || !p(e)) return [];
+  const t = k(e), i = new DataView(e.buffer, e.byteOffset, e.byteLength), h = [];
+  return t.frames.forEach((n, o) => {
+    const l = /* @__PURE__ */ new Set(), r = (c, s) => {
+      l.has(c) || (l.add(c), h.push({ kind: c, frame: o, value: s }));
+    }, u = Math.min(e.length, n + i.getUint32(n, !0));
+    let a = n + 16;
+    for (let c = 0; c < i.getUint16(n + 6, !0) && a + 6 <= u; c++) {
+      const s = i.getUint32(a, !0), f = i.getUint16(a + 4, !0);
+      if (s < 6) break;
+      if (s > g && r("big", s), f === 13) r("black", f);
+      else if (!$.has(f)) r("type", f);
+      else if (f === 12) {
+        const m = d(e, a + 6, Math.min(u, a + s));
+        m >= 128 && r("packets", m);
+      }
+      a += s;
+    }
+  }), h;
+}
+function d(e, t, i) {
+  if (t + 4 > i) return 0;
+  const h = e[t + 2] | e[t + 3] << 8;
+  let n = t + 4, o = 0;
+  for (let l = 0; l < h && n < i; l++) {
+    const r = e[n++];
+    o = Math.max(o, r);
+    for (let u = 0; u < r && n + 1 < i; u++) {
+      const a = e[n + 1] << 24 >> 24;
+      n += 2 + (a >= 0 ? a : 1);
+    }
+  }
+  return o;
+}
+function U(e) {
+  const t = e.frame === 0 ? "its first frame" : `frame ${e.frame + 1}`;
+  switch (e.kind) {
+    case "big":
+      return `a ${e.value.toLocaleString("en-US")}-byte chunk in ${t} (DOS reads ${g.toLocaleString("en-US")} safely)`;
+    case "packets":
+      return `a line of ${e.value} changes in ${t} (DOS reads 127 at most)`;
+    case "black":
+      return `an all-black chunk in ${t} (PLAYGAME crashes on it)`;
+    default:
+      return `a chunk of type ${e.value} in ${t} (PLAYGAME stops at it)`;
+  }
+}
+export {
+  U as describeFliFault,
+  M as fliFaults
+};

package/dist/formats/game.js

@@ -0,0 +1,198 @@
+import { Writer as F, Reader as G, cString as L } from "./binary.js";
+import { fromCp437 as B } from "../text/cp437.js";
+const w = 65535, O = 1, C = 2, M = 10, x = 20, y = 20, S = 20, H = 283, E = 256, T = 300, U = 8, Y = [
+  "Title graphic",
+  "Title song",
+  "Menu graphic",
+  "Menu song",
+  "Storyline graphic",
+  "Storyline song",
+  "Game instructions",
+  "Beginning credits",
+  "High score backdrop",
+  "Load game background",
+  "Save game background",
+  "Demo recording"
+], Z = ["Game won graphic", "Game won song", "Game lost graphic", "Game lost song"], K = [
+  "Palette",
+  "Map",
+  "Background block set",
+  "Monsters",
+  "Monster block set",
+  "Character",
+  "Character block set",
+  "Sound set",
+  "Sound Blaster music",
+  "Level intro graphic",
+  "Level exit graphic"
+], W = ["pal", "map", "bbl", "mon", "mbl", "chr", "cbl", "snd", "cmf", "graphic", "graphic"], j = ["graphic", "cmf", "graphic", "cmf", "graphic", "cmf", "graphic", "graphic", "graphic", "graphic", "graphic", "rec"], z = ["graphic", "cmf", "graphic", "cmf"], oe = ["gif", "bkd", "fli", "txt", "lst"];
+function $(e) {
+  return e[0] === 71 && e[1] === 77;
+}
+function N() {
+  return { toScene: w, from: { x: 0, y: 0 }, to: { x: 0, y: 0 } };
+}
+function _(e = w) {
+  return {
+    gametype: e,
+    pos: { x: 0, y: 0 },
+    scroll: { up: 255, down: 255, left: 255, right: 255, style: 0, xtra: new Uint8Array(11) },
+    numLinks: S,
+    desc: "",
+    files: new Array(y).fill(""),
+    links: Array.from({ length: S }, N)
+  };
+}
+function R() {
+  const e = new Uint8Array(E);
+  for (let t = 0; t < E - 6; t++) e[6 + t] = "RSD".charCodeAt(t % 3);
+  return e[0] = 71, e[1] = 77, e[2] = T & 255, e[3] = T >> 8, e[4] = 0, e[5] = U, e;
+}
+function ce(e = "My Game") {
+  const t = _(O);
+  t.desc = e.slice(0, x - 1), t.pos = { x: 157, y: 36 };
+  const s = _(C);
+  return s.desc = "Game Won", s.pos = { x: 157, y: 184 }, { version: T, header: R(), filesPerScene: y, linksPerScene: S, scenes: [t, s], converted: !1 };
+}
+function re(e) {
+  return $(e) ? q(e) : Q(e);
+}
+function q(e) {
+  const t = new G(e), s = t.bytesOf(E), i = s[2] | s[3] << 8, n = t.i16(), l = t.i16(), c = t.i16(), o = [];
+  for (let f = 0; f < n; f++) {
+    const g = t.u16(), d = { x: t.i16(), y: t.i16() }, k = { up: t.u8(), down: t.u8(), left: t.u8(), right: t.u8(), style: t.u8(), xtra: t.bytesOf(11) }, b = t.u8(), p = t.bytesOf(x), u = [];
+    for (let m = 0; m < y; m++) u.push(t.u16());
+    const r = [];
+    for (let m = 0; m < S; m++) r.push({ toScene: t.u16(), from: { x: t.i16(), y: t.i16() }, to: { x: t.i16(), y: t.i16() } });
+    o.push({ scene: { gametype: g, pos: d, scroll: k, numLinks: b, desc: L(p), descRaw: p, files: [], links: r }, offsets: u });
+  }
+  const h = t.u16(), a = t.bytesOf(h);
+  for (const { scene: f, offsets: g } of o)
+    f.files = g.map((d) => d === 0 || d >= a.length ? "" : L(a.subarray(d)));
+  return {
+    version: i,
+    header: s,
+    filesPerScene: l,
+    linksPerScene: c,
+    scenes: o.map((f) => f.scene),
+    pool: a,
+    poolOffsets: o.map((f) => f.offsets),
+    converted: !1
+  };
+}
+const v = 330, D = 20, J = [".pal", ".map", ".bbl", ".mon", ".mbl", ".chr", ".cbl", ".snd", ".cmf"];
+function Q(e) {
+  const t = Math.min(D, Math.floor(e.length / v)), s = [];
+  for (let i = 0; i < t; i++) {
+    const n = new G(e, i * v), l = n.u16(), c = n.i16(), o = n.i16(), h = n.cstr(15), a = [];
+    for (let r = 0; r < 9; r++) a.push(n.cstr(10).toLowerCase());
+    const f = [];
+    for (let r = 0; r < 20; r++) {
+      const m = n.i16(), A = n.i16(), P = n.i16(), V = n.i16(), X = n.i16();
+      f.push({ toScene: P === D ? w : P & 65535, from: { x: m, y: A }, to: { x: V, y: X } });
+    }
+    n.skip(3);
+    const g = n.u8(), d = n.u8(), k = n.u8(), b = n.u8(), p = _();
+    p.gametype = l === O || l === C || l === M ? l : w, p.pos = { x: c, y: o }, p.scroll = { up: g, down: d, left: k, right: b, style: 0, xtra: new Uint8Array(11) }, p.desc = h.slice(0, x), p.links = f;
+    const u = (r, m, A) => {
+      p.files[m] = a[r] ? a[r] + A : "";
+    };
+    if (i === 0)
+      u(0, 2, ".bkd"), u(1, 4, ".txt"), u(2, 6, ".txt"), u(3, 7, ".txt"), u(4, 3, ".cmf");
+    else if (i === 1)
+      u(0, 0, ".bkd"), u(3, 1, ".cmf");
+    else
+      for (let r = 0; r < 9; r++) u(r, r, J[r]);
+    s.push(p);
+  }
+  return { version: 0, header: R(), filesPerScene: y, linksPerScene: S, scenes: s, converted: !0 };
+}
+function ie(e) {
+  const t = new F(E + 6 + e.scenes.length * H + 512);
+  t.bytes(e.header, E), t.i16(e.scenes.length).i16(e.filesPerScene).i16(e.linksPerScene);
+  let s, i;
+  return e.pool && e.poolOffsets && e.poolOffsets.length === e.scenes.length && ee(e) ? (s = e.pool, i = e.poolOffsets) : { pool: s, offsets: i } = te(e.scenes), e.scenes.forEach((n, l) => {
+    t.u16(n.gametype).i16(n.pos.x).i16(n.pos.y), t.u8(n.scroll.up).u8(n.scroll.down).u8(n.scroll.left).u8(n.scroll.right).u8(n.scroll.style).bytes(n.scroll.xtra, 11), t.u8(n.numLinks), t.cstrOver(n.desc, n.descRaw, x);
+    for (let c = 0; c < y; c++) t.u16(i[l][c] ?? 0);
+    for (let c = 0; c < S; c++) {
+      const o = n.links[c] ?? N();
+      t.u16(o.toScene).i16(o.from.x).i16(o.from.y).i16(o.to.x).i16(o.to.y);
+    }
+  }), t.u16(s.length).bytes(s), t.toBytes();
+}
+function ee(e) {
+  const t = e.pool;
+  return e.scenes.every(
+    (s, i) => s.files.every((n, l) => {
+      const c = e.poolOffsets[i][l];
+      return (c === 0 || c >= t.length ? "" : L(t.subarray(c))) === n;
+    })
+  );
+}
+function te(e) {
+  const t = [0], s = /* @__PURE__ */ new Map(), i = e.map(
+    (n) => Array.from({ length: y }, (l, c) => {
+      const o = n.files[c] ?? "";
+      if (!o) return 0;
+      let h = s.get(o);
+      if (h === void 0) {
+        h = t.length, s.set(o, h);
+        for (let a = 0; a < o.length; a++) t.push(o.charCodeAt(a) & 255);
+        t.push(0);
+      }
+      return h;
+    })
+  );
+  return { pool: new Uint8Array(t), offsets: i };
+}
+function le(e) {
+  return B(e.scenes[0]?.desc ?? "").replace(/^[\s\u2500-\u259f]+|[\s\u2500-\u259f]+$/g, "");
+}
+function I(e) {
+  return e.gametype === O ? "start" : e.gametype === C ? "end" : e.gametype === M ? "adventure" : "unused";
+}
+function ae(e) {
+  switch (I(e)) {
+    case "start":
+      return Y;
+    case "end":
+      return Z;
+    default:
+      return K;
+  }
+}
+function fe(e) {
+  switch (I(e)) {
+    case "start":
+      return j;
+    case "end":
+      return z;
+    default:
+      return W;
+  }
+}
+export {
+  M as ADVTYPE,
+  W as ADV_EXTS,
+  K as ADV_FILES,
+  C as ENDTYPE,
+  Z as END_FILES,
+  T as GAM_VERSION,
+  oe as GRAPHIC_EXTS,
+  S as MAXSCENELINKS,
+  w as NOSCENE,
+  x as SCENEDESCLEN,
+  y as SCENEFILES,
+  O as STARTTYPE,
+  Y as START_FILES,
+  R as defaultHeader,
+  N as emptyLink,
+  _ as emptyScene,
+  ae as fileSlotsFor,
+  le as gameTitle,
+  ce as newGame,
+  re as parseGame,
+  I as sceneKind,
+  ie as serializeGame,
+  fe as slotExtensions
+};