@oasys/oecs 0.5.2 → 0.5.3

package/dist/index.development.js

@@ -1,8 +1,8 @@
-import { v as wt, i as Et, S as D, a as _t, b as gt, c as yt, r as ce, d as le, e as $t, u as M, E as _, f as g, N as W, D as ue, g as b, h as m, U as T, j as Ce, k as Re, l as Ae, R as Oe, m as Ie, n as A, o as ot, I as Ut, p as It, q as de, s as Te, t as De, w as ke, x as mt, y as fe, z as Ft, A as pe, B as rt, C as _e, F as Tt, T as xe, G as Me, H as dt, J as Ne, K as Le, L as at, M as $e, O as Fe, P as Be, Q as Ge, V as qt, W as Pe, X as Vt, Y as He, Z as Ue, _ as qe, $, a0 as Ve, a1 as Wt, a2 as J, a3 as zt, a4 as We, a5 as Y, a6 as ct, a7 as ze, a8 as je, a9 as vt, aa as Ye, ab as Qe, ac as Ke, ad as k, ae as F, af as Xe, ag as Ze, ah as Je, ai as ts, aj as es, ak as ss } from "./internal-BMDgWZbt.js";
-import { as as Mn, aq as Nn, al as Ln, ap as $n, an as Fn, at as Bn, ar as Gn, am as Pn, ao as Hn } from "./internal-BMDgWZbt.js";
-import { h as ns, B as U, i as rs, j as is } from "./typed_arrays-BcXcnzB4.js";
-import { D as os, S as jt, g as hs } from "./shared-BU1Cd40h.js";
-import { a as qn } from "./shared-BU1Cd40h.js";
+import { v as wt, i as Et, S as D, a as _t, b as gt, c as yt, r as ce, d as le, e as $t, u as M, E as _, f as g, N as W, D as ue, g as b, h as m, U as T, j as Re, k as Ae, l as Oe, R as Ie, m as Te, n as A, o as ot, I as Ut, p as It, q as de, s as De, t as ke, w as xe, x as mt, y as fe, z as Ft, A as pe, B as rt, C as _e, F as Tt, T as Me, G as Ne, H as dt, J as Le, K as $e, L as at, M as Fe, O as Be, P as Ge, Q as Pe, V as qt, W as He, X as Vt, Y as Ue, Z as qe, _ as Ve, $, a0 as We, a1 as Wt, a2 as J, a3 as zt, a4 as ze, a5 as Y, a6 as ct, a7 as je, a8 as Ye, a9 as vt, aa as Qe, ab as Ke, ac as Xe, ad as k, ae as F, af as Ze, ag as Je, ah as ts, ai as es, aj as ss, ak as ns } from "./internal-C9jjL90H.js";
+import { as as Nn, aq as Ln, al as $n, ap as Fn, an as Bn, at as Gn, ar as Pn, am as Hn, ao as Un } from "./internal-C9jjL90H.js";
+import { h as rs, B as U, i as is, j as os } from "./typed_arrays-BcXcnzB4.js";
+import { D as hs, S as jt, g as as } from "./shared-DQKK0i-E.js";
+import { a as Vn } from "./shared-DQKK0i-E.js";
 const B = !0, ge = (a) => wt(
   a,
   Et,
@@ -15,7 +15,7 @@ function ye(a) {
   }));
   return Object.defineProperty(t, "id", { value: a, enumerable: !1 }), t;
 }
-function un(a, ...t) {
+function dn(a, ...t) {
   return { def: a, values: t[0] ?? Bt };
 }
 function K(a) {
@@ -29,11 +29,11 @@ class tt extends Error {
     super(t), this.name = "StoreRestoreError";
   }
 }
-function as(a) {
+function cs(a) {
   const t = a.view.getUint32(D.capacity, !0);
   return new Uint8Array(a.buffer, 0, t);
 }
-function cs(a, t = os) {
+function ls(a, t = hs) {
   const e = new DataView(a.buffer, a.byteOffset, a.byteLength);
   if (a.byteLength < _t)
     throw new tt(
@@ -69,12 +69,12 @@ function cs(a, t = os) {
     ) : h;
   }
 }
-const ls = (a) => wt(
+const us = (a) => wt(
   a,
   Et,
   "EventID must be a non-negative integer"
 );
-class us {
+class ds {
   fieldNames;
   columns;
   // any: type-erased storage — channel is stored in Map<number, EventChannel>, S is lost
@@ -117,13 +117,13 @@ class us {
       t[e].length = 0;
   }
 }
-function dn(a) {
+function fn(a) {
   return M(Symbol(a));
 }
-function fn(a) {
+function pn(a) {
   return M(Symbol(a));
 }
-class ds {
+class fs {
   // Parallel array indexed by EventID: each channel holds SoA columns + reader.
   channels = [];
   // IDs of channels emitted to since the last `clearEvents()`. An `emit*`
@@ -136,7 +136,7 @@ class ds {
   // callers via EventKey<F>
   keyMap = /* @__PURE__ */ new Map();
   registerEvent(t) {
-    const e = ls(this.count++), s = new us(t);
+    const e = us(this.count++), s = new ds(t);
     return this.channels.push(s), M(e);
   }
   emitEvent(t, e) {
@@ -192,7 +192,7 @@ class ds {
     return this.keyMap.has(t);
   }
 }
-class fs {
+class ps {
   map = /* @__PURE__ */ new Map();
   register(t, e) {
     if (this.map.has(t))
@@ -465,7 +465,7 @@ class Gt {
    * current SAB row capacity. (#171 §6.1.9 Phase 3) */
   growHandler = null;
   constructor(t, e, s, n = ue, r) {
-    if (this.id = t, this.mask = e, this._entityIds = new ns(n), s) {
+    if (this.id = t, this.mask = e, this._entityIds = new rs(n), s) {
       let i = 0;
       for (let o = 0; o < s.length; o++) {
         const h = s[o], c = h.componentId, l = new Array(h.fieldNames.length);
@@ -502,7 +502,7 @@ class Gt {
         `ColumnStore has no archetype ${r}`
       );
     const o = (c, l) => {
-      const u = i.columns.get(Ce(c, l));
+      const u = i.columns.get(Re(c, l));
       if (!u)
         throw new _(
           g.COMPONENT_NOT_REGISTERED,
@@ -609,7 +609,7 @@ class Gt {
     const s = this.enabledCount;
     if (s === t)
       return this.enabledCount = t + 1, t;
-    if (e === void 0) throw ps();
+    if (e === void 0) throw _s();
     if (this.swapRows(s, t), e !== void 0) {
       const n = this._entityIds.buf;
       e[b(n[t])] = t;
@@ -1198,7 +1198,7 @@ function et(a) {
     `${a} hit an archetype a live query iteration is visiting — immediate structural mutation mid-walk relocates rows under the iterator (entities get skipped or visited twice). Collect ids during the walk and mutate after it; inside a system use the deferred ctx.commands.`
   );
 }
-function ps() {
+function _s() {
   return new _(
     g.PARTITION_APPEND_NEEDS_ENTITY_ROW,
     "appending into a disabled-bearing archetype requires the entity_row map (to repoint the displaced disabled row). A Store append path is missing its entity_row argument."
@@ -1231,7 +1231,7 @@ const me = (a) => wt(
 function Xt(a) {
   return typeof a == "object" && !Array.isArray(a);
 }
-function _s(a) {
+function gs(a) {
   let t = st;
   a.spawns !== void 0 && a.spawns.length > 0 && (t = a.spawns.map((s) => Xt(s) ? s.defs : s));
   let e = st;
@@ -1255,7 +1255,7 @@ function _s(a) {
     relationWrites: a.relationWrites
   };
 }
-function gs(a) {
+function ys(a) {
   const t = a.queries;
   if (t === void 0 || a.exclusive === !0) return;
   const e = /* @__PURE__ */ new Set();
@@ -1284,26 +1284,26 @@ const xt = Object.freeze({
   sparseWrites: Object.freeze([]),
   relationReads: Object.freeze([]),
   relationWrites: Object.freeze([])
-}), ys = Symbol.dispose ?? Symbol.for("Symbol.dispose"), bt = (1 << 20) - 1;
-let ms = 0;
-function ws(a, t) {
+}), ms = Symbol.dispose ?? Symbol.for("Symbol.dispose"), bt = (1 << 20) - 1;
+let ws = 0;
+function Es(a, t) {
   const e = {
     ...xt,
     ...t,
-    id: me(ms++),
+    id: me(ws++),
     name: a,
-    fn: Es
+    fn: vs
   };
   return Object.freeze(e);
 }
-function Es() {
+function vs() {
 }
 function Zt(a) {
   const t = /* @__PURE__ */ new Set();
   if (a) for (let e = 0; e < a.length; e++) t.add(a[e].id);
   return t;
 }
-function vs(a) {
+function bs(a) {
   const t = (i, o) => i.cid - o.cid || i.id - o.id, e = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map();
   for (const i of a)
     e.set(i, []), s.set(i, 0);
@@ -1334,7 +1334,7 @@ function vs(a) {
   }
   return r;
 }
-class bs {
+class Ss {
   constructor(t, e) {
     this.store = t, this.ctx = e;
   }
@@ -1388,8 +1388,8 @@ class bs {
         g.OBSERVER_INVALID_CONFIG,
         "observe(): at least one of onAdd / onRemove / onDisable / onEnable / onSet is required"
       );
-    const o = e.access ?? {}, h = ws(
-      e.name ?? `observer(${Re(t) ?? s})`,
+    const o = e.access ?? {}, h = Es(
+      e.name ?? `observer(${Ae(t) ?? s})`,
       o
     ), c = {
       // Share one identity space with the descriptor (used only for the
@@ -1414,7 +1414,7 @@ class bs {
     let l = this.byCid.get(s);
     l === void 0 && (l = [], this.byCid.set(s, l)), l.push(c), this._topo = null, this._reconfigureComponent(s), c.yieldExisting && c.onAdd !== void 0 && this._yieldExisting(c);
     const u = () => this._dispose(c);
-    return { dispose: u, [ys]: u };
+    return { dispose: u, [ms]: u };
   }
   _dispose(t) {
     if (t.disposed) return;
@@ -1449,7 +1449,7 @@ class bs {
     );
   }
   getTopo() {
-    return this._topo === null && (this._topo = vs(this.entries)), this._topo;
+    return this._topo === null && (this._topo = bs(this.entries)), this._topo;
   }
   // =======================================================
   // Structural dispatch (onAdd / onRemove)
@@ -1600,7 +1600,7 @@ function ft(a, t, e, s) {
     }
   }
 }
-class Ss {
+class Cs {
   constructor(t) {
     this.host = t;
   }
@@ -1662,9 +1662,9 @@ class Ss {
         g.RELATION_MODE_INVALID,
         "register_relation: a relation cannot be both exclusive and multi-target"
       );
-    const n = !e, r = t?.onDeleteTarget ?? Ae, i = n ? this.host.pushSparseStore([Oe], ["f64"]) : this.host.pushSparseStore([], []), o = this.relations.length;
+    const n = !e, r = t?.onDeleteTarget ?? Oe, i = n ? this.host.pushSparseStore([Ie], ["f64"]) : this.host.pushSparseStore([], []), o = this.relations.length;
     return this.relations.push(
-      Ie(n, i, this.host.sparseStoreOf(i), r)
+      Te(n, i, this.host.sparseStoreOf(i), r)
     ), r !== "orphan" && (this._hasTargetCleanup = !0), M(o);
   }
   relationOf(t) {
@@ -2104,7 +2104,7 @@ class Ss {
     return s.get(t);
   }
 }
-class Cs {
+class Rs {
   /** SAB-backed per-slot generation counters — replanted on restore. */
   _generations;
   /** Single-slot view over the entity-index region's `length` header field —
@@ -2211,7 +2211,7 @@ class Cs {
   }
 }
 const Jt = 65536;
-class Rs {
+class As {
   // --- Deferred operation buffers ---
   // Flat parallel arrays: addIds[i], addDefs[i], addValues[i] describe one
   // deferred add. No per-operation object allocation. Public so the Store
@@ -2298,7 +2298,7 @@ function we(a, t) {
     const r = t[n], i = new Array(r.columns.length);
     for (let o = 0; o < r.columns.length; o++) {
       const h = r.columns[o];
-      e = Te(e, h.stride), i[o] = {
+      e = De(e, h.stride), i[o] = {
         componentId: h.componentId,
         fieldId: h.fieldId,
         typeTag: h.typeTag,
@@ -2315,15 +2315,18 @@ function we(a, t) {
       columns: i
     };
   }
-  if (e > De)
-    throw new ke(e);
+  if (e > ke)
+    throw new xe(e);
   return { descriptors: s, newTotal: e };
 }
 function Ee(a, t) {
   const e = a._allocator(t), s = e !== a.buffer ? new DataView(e) : a.view;
   return { grownBuffer: e, newView: s };
 }
-function As(a) {
+function ve(a) {
+  return a.buffer instanceof ArrayBuffer ? a.view.getUint32(D.capacity, !0) : a.buffer.byteLength;
+}
+function Os(a) {
   const t = {};
   for (let n = 0; n < mt.length; n++) {
     const r = mt[n], i = a.view.getUint32(D[r.headerOff], !0);
@@ -2346,7 +2349,7 @@ function As(a) {
   }
   return Ft(a) && a._reservedDescriptorBytes > 0 && (t.reservedDescriptorBytes = a._reservedDescriptorBytes), t;
 }
-function Os(a) {
+function Is(a) {
   const t = /* @__PURE__ */ new Map();
   for (let n = 0; n < mt.length; n++) {
     const r = mt[n], i = a.view.getUint32(D[r.headerOff], !0);
@@ -2361,7 +2364,7 @@ function Os(a) {
   }
   return { mechanism: t, consumer: e };
 }
-function Is(a, t) {
+function Ts(a, t) {
   for (const [e, s] of t.mechanism) {
     const n = a.view.getUint32(D[e], !0);
     new Uint8Array(a.buffer, n, s.byteLength).set(s);
@@ -2372,7 +2375,7 @@ function Is(a, t) {
     new Uint8Array(a.buffer, n, s.byteLength).set(s);
   }
 }
-function Ts(a, t) {
+function Ds(a, t) {
   const e = /* @__PURE__ */ new Map();
   for (const [s, n] of a.archetypes) {
     const r = t.get(s) ?? 0;
@@ -2386,7 +2389,7 @@ function Ts(a, t) {
   }
   return e;
 }
-function Ds(a, t) {
+function ks(a, t) {
   for (const [e, s] of t) {
     const n = a.archetypes.get(e);
     if (n === void 0)
@@ -2400,16 +2403,16 @@ function Ds(a, t) {
     }
   }
 }
-function ve(a, t, e, s) {
-  const n = a.view.getUint32(D.view_stamp, !0), r = Ts(a, e), i = Os(a), o = As(a), h = de(t, s, o);
-  Ds(h, r), Is(h, i);
+function be(a, t, e, s) {
+  const n = a.view.getUint32(D.view_stamp, !0), r = Ds(a, e), i = Is(a), o = Os(a), h = de(t, s, o);
+  ks(h, r), Ts(h, i);
   const c = n + 1 >>> 0;
   return h.view.setUint32(D.view_stamp, c, !0), { store: {
     ...h,
     header: { ...h.header, viewStamp: c }
   }, oldViewStamp: n, newViewStamp: c };
 }
-function ks(a, t, e) {
+function xs(a, t, e) {
   const s = new Array(t.length);
   for (let p = 0; p < t.length; p++) {
     const v = t[p], C = a.archetypes.get(v.archetypeId);
@@ -2420,7 +2423,7 @@ function ks(a, t, e) {
       columns: C.columnsInOrder
     };
   }
-  const { descriptors: n, newTotal: r } = we(a.buffer.byteLength, s), i = /* @__PURE__ */ new Map();
+  const { descriptors: n, newTotal: r } = we(ve(a), s), i = /* @__PURE__ */ new Map();
   for (let p = 0; p < n.length; p++)
     i.set(n[p].archetypeId, n[p]);
   const { grownBuffer: o, newView: h } = Ee(a, r), c = new Uint8Array(o);
@@ -2476,7 +2479,7 @@ class pt extends Error {
     super(t), this.name = "StoreGrowError";
   }
 }
-function xs(a, t, e) {
+function Ms(a, t, e) {
   const s = /* @__PURE__ */ new Map();
   for (let l = 0; l < t.archetypes.length; l++) {
     const u = t.archetypes[l];
@@ -2515,9 +2518,9 @@ function xs(a, t, e) {
   }
   if (e?.isInPlace === !0 && Ft(a) && a._allocator === e && r.length > 0) {
     const l = a.view.getUint32(D.layout_descriptor_off, !0);
-    return ks(a, r, l);
+    return xs(a, r, l);
   }
-  const { store: o, oldViewStamp: h, newViewStamp: c } = ve(
+  const { store: o, oldViewStamp: h, newViewStamp: c } = be(
     a,
     n,
     i,
@@ -2536,7 +2539,7 @@ class Q extends Error {
     super(t), this.name = "StoreExtendError";
   }
 }
-function Ms(a, t, e) {
+function Ns(a, t, e) {
   if (t.newArchetypes.length === 0)
     throw new Q("extend plan has no new archetypes; use grow_column_store for resizes");
   const s = /* @__PURE__ */ new Set();
@@ -2580,7 +2583,7 @@ function Ms(a, t, e) {
     for (let d = 0; d < t.newArchetypes.length; d++)
       u += Tt(t.newArchetypes[d].columns.length);
     if (l + u <= a._regionBytes)
-      return Ns(a, t.newArchetypes, c, l);
+      return Ls(a, t.newArchetypes, c, l);
   }
   const r = [];
   for (const [c, l] of a.archetypes)
@@ -2592,7 +2595,7 @@ function Ms(a, t, e) {
     });
   for (let c = 0; c < t.newArchetypes.length; c++)
     r.push(t.newArchetypes[c]);
-  const { store: i, oldViewStamp: o, newViewStamp: h } = ve(
+  const { store: i, oldViewStamp: o, newViewStamp: h } = be(
     a,
     r,
     n,
@@ -2600,7 +2603,7 @@ function Ms(a, t, e) {
   );
   return { store: i, oldViewStamp: o, newViewStamp: h, viewsPreserved: !1 };
 }
-function Ns(a, t, e, s) {
+function Ls(a, t, e, s) {
   const n = new Array(t.length);
   for (let E = 0; E < t.length; E++) {
     const p = t[E];
@@ -2612,12 +2615,12 @@ function Ns(a, t, e, s) {
         componentId: v.componentId,
         fieldId: v.fieldId,
         typeTag: v.typeTag,
-        stride: xe[v.typeTag]
+        stride: Me[v.typeTag]
       }))
     };
   }
   const { descriptors: r, newTotal: i } = we(
-    a.buffer.byteLength,
+    ve(a),
     n
   ), { grownBuffer: o, newView: h } = Ee(a, i);
   let c = e + s;
@@ -2656,7 +2659,7 @@ class x extends Error {
   }
 }
 const Z = 4;
-function Ls(a) {
+function $s(a) {
   const t = a.freeIndices.length, e = a.archetypeRows.length, s = Z * (4 + t + 1 + e * 3), n = new Uint8Array(s), r = new DataView(n.buffer);
   let i = 0;
   const o = (h) => {
@@ -2671,7 +2674,7 @@ function Ls(a) {
   }
   return n;
 }
-function $s(a) {
+function Fs(a) {
   const t = new DataView(a.buffer, a.byteOffset, a.byteLength), e = a.byteLength;
   let s = 0;
   const n = (f) => {
@@ -2696,11 +2699,11 @@ function $s(a) {
     );
   return { tick: i, entityHighWater: o, entityAliveCount: h, freeIndices: l, archetypeRows: d };
 }
-function Fs(a, t, e) {
+function Bs(a, t, e) {
   const s = Z * 5, n = new Uint8Array(s + a.length + t.length + e.length), r = new DataView(n.buffer);
   return r.setUint32(0, Mt, !0), r.setUint32(4, Nt, !0), r.setUint32(8, a.length, !0), r.setUint32(12, t.length, !0), r.setUint32(16, e.length, !0), n.set(a, s), n.set(t, s + a.length), n.set(e, s + a.length + t.length), n;
 }
-function Bs(a) {
+function Gs(a) {
   const t = Z * 5;
   if (a.byteLength < t)
     throw new x(
@@ -2728,7 +2731,7 @@ function Bs(a) {
     host: new Uint8Array(c, h + t + r + i, o)
   };
 }
-function Gs(a, t, e) {
+function Ps(a, t, e) {
   if (a.byteLength < _t)
     throw new x(
       `dense section too small: ${a.byteLength} bytes (SAB header needs ${_t})`
@@ -2749,7 +2752,7 @@ function Gs(a, t, e) {
       `dense layoutDescriptorOff ${i.layoutDescriptorOff} is outside the section (${a.byteLength} bytes)`
     );
   const o = i.entityIndexOff;
-  if (o < 0 || o + Me > a.byteLength)
+  if (o < 0 || o + Ne > a.byteLength)
     throw new x(
       `dense entityIndexOff ${o} is outside the section (${a.byteLength} bytes)`
     );
@@ -2780,7 +2783,7 @@ function Gs(a, t, e) {
       throw new x(
         `archetype-set mismatch: snapshot archetype ${u.archetypeId} is absent from the live world`
       );
-    if (!Ps(d.componentMask, u.componentMask))
+    if (!Hs(d.componentMask, u.componentMask))
       throw new x(
         `archetype ${u.archetypeId} component-mask mismatch between the live world and the snapshot (different component registration)`
       );
@@ -2796,12 +2799,12 @@ function Gs(a, t, e) {
         );
   }
 }
-function Ps(a, t) {
+function Hs(a, t) {
   if (a.length !== t.length) return !1;
   for (let e = 0; e < a.length; e++) if (a[e] !== t[e]) return !1;
   return !0;
 }
-class Hs {
+class Us {
   host;
   /** The allocator IS its own snapshot seam (H1 step 3): free-list copy on
    * capture; `setHighWater` + `restoreHostState` on mount. */
@@ -2819,7 +2822,7 @@ class Hs {
    * different orders snapshot byte-for-byte the same (#470). The reverse index
    * is derived and never serialized — `restoreSparse` rebuilds it. */
   snapshotSparse() {
-    const t = Ne(this.host.sparseStores()), e = Le(this.host.relationStores()), s = new Uint8Array(8 + t.length + e.length), n = new DataView(s.buffer);
+    const t = Le(this.host.sparseStores()), e = $e(this.host.relationStores()), s = new Uint8Array(8 + t.length + e.length), n = new DataView(s.buffer);
     return n.setUint32(0, t.length, !0), n.setUint32(4, e.length, !0), s.set(t, 8), s.set(e, 8 + t.length), s;
   }
   /** Repopulate the sparse stores from `snapshotSparse` bytes, replacing all
@@ -2842,7 +2845,7 @@ class Hs {
       throw new at(
         `sparse snapshot frame mismatch: header declares 8+${s}+${n}=${8 + s + n} bytes, buffer is ${t.byteLength}`
       );
-    $e(this.host.sparseStores(), t.subarray(8, 8 + s)), this.rebuildRelationIndices(t.subarray(8 + s, 8 + s + n));
+    Fe(this.host.sparseStores(), t.subarray(8, 8 + s)), this.rebuildRelationIndices(t.subarray(8 + s, 8 + s + n));
   }
   /** Rebuild every relation's derived side indices after the sparse stores have
    * been restored. `restoreRelations` resets all relations, rebuilds the multi
@@ -2852,7 +2855,7 @@ class Hs {
    * `(source index → target EntityID)`, which is exactly one reverse edge. */
   rebuildRelationIndices(t) {
     const e = this.host.generations(), s = (r) => ot(r, e[r]), n = this.host.relationStores();
-    Fe(n, t, s);
+    Be(n, t, s);
     for (let r = 0; r < n.length; r++) n[r].rebuildReverseFromForward(s);
   }
   /** Capture the full live world to one self-contained byte buffer that
@@ -2861,8 +2864,8 @@ class Hs {
    * relation bytes, and the host-side bookkeeping the SAB omits. */
   snapshot() {
     this.host.publishRowCounts();
-    const t = new Uint8Array(as(this.host.columnStore())), e = this.snapshotSparse(), s = Ls(this.collectHostState());
-    return Fs(t, e, s);
+    const t = new Uint8Array(cs(this.host.columnStore())), e = this.snapshotSparse(), s = $s(this.collectHostState());
+    return Bs(t, e, s);
   }
   /** Gather the host-side state a snapshot carries alongside the dense + sparse
    * bytes — see `snapshot()`. The free-list is copied (it's a live mutable). */
@@ -2888,13 +2891,13 @@ class Hs {
    * ticking. Fails closed on a malformed frame or a registration mismatch
    * BEFORE any live state is touched. */
   restoreInto(t) {
-    const e = Bs(t), s = $s(e.host);
-    Gs(
+    const e = Gs(t), s = Fs(e.host);
+    Ps(
       e.dense,
       this.host.columnStore().archetypes,
       this.host.entityIndexCapacity()
     ), this.assertSparseSectionMatches(e.sparse);
-    const n = cs(e.dense, this.host.bufferAllocator());
+    const n = ls(e.dense, this.host.bufferAllocator());
     this.host.mountRestoredDense(n), this.host.reconstructHostRows(s), this.allocator.restoreHostState(s.freeIndices, s.entityAliveCount), this.host.setTick(s.tick), this.host.invalidateQueryCaches(), this.restoreSparse(e.sparse);
   }
   /** Read-only validation of a `snapshotSparse` SECTION (the framed
@@ -2916,14 +2919,14 @@ class Hs {
       throw new at(
         `sparse snapshot frame mismatch: header declares 8+${s}+${n}=${8 + s + n} bytes, buffer is ${t.byteLength}`
       );
-    Be(this.host.sparseStores(), t.subarray(8, 8 + s));
+    Ge(this.host.sparseStores(), t.subarray(8, 8 + s));
   }
 }
-function be(a, t, e) {
+function Se(a, t, e) {
   const s = a.get(t);
   s !== void 0 ? s.push(e) : a.set(t, [e]);
 }
-class Us {
+class qs {
   /** All archetypes, indexed by `ArchetypeID` (ids are minted monotonically
    * and never removed). Store's flush loops hoist this array to a local. */
   archetypes = [];
@@ -3049,7 +3052,7 @@ class Us {
    * mask-allocating callers (`copyWithSet`, `copyWithClear`, etc.). */
   install(t, e, s, n) {
     const r = e.copy(), i = this.host.materialize(t, r, s);
-    this.archetypes.push(i), be(this.archetypeMap, n, t), e.forEach((o) => {
+    this.archetypes.push(i), Se(this.archetypeMap, n, t), e.forEach((o) => {
       const h = o;
       let c = this.componentIndex[h];
       if (c === void 0 && (c = [], this.componentIndex[h] = c), c.length > 0 && t <= c[c.length - 1])
@@ -3108,7 +3111,7 @@ function te(a, t, e, s) {
       n.push({
         componentId: h.componentId,
         fieldId: l,
-        typeTag: Ge[c[l]]
+        typeTag: Pe[c[l]]
       });
   }
   const r = t._words, i = new Array(qt);
@@ -3121,8 +3124,8 @@ function te(a, t, e, s) {
     columns: n
   };
 }
-const qs = [], ee = -1, St = new DataView(new ArrayBuffer(8)), se = 129, Vs = 7, Ct = -1;
-class Ws {
+const Vs = [], ee = -1, St = new DataView(new ArrayBuffer(8)), se = 129, Ws = 7, Ct = -1;
+class zs {
   // --- Entity ID management ---
   // Generational slot allocation (generations view, high-water, free-list,
   // alive count) lives in `EntityAllocator` (H1 step 3). `entityArchetype` /
@@ -3159,7 +3162,7 @@ class Ws {
   // --- Event channels ---
   // Channel array + key map + per-tick dirty list live in `EventRegistry`
   // (event_registry.ts, H1 step 2); the event methods below delegate.
-  events = new ds();
+  events = new fs();
   // --- Archetype management ---
   // Topology (archetype list, mask→id map, id counter, inverted component
   // index, edge resolution/creation) lives in `ArchetypeGraph` (H1 step 6).
@@ -3360,7 +3363,7 @@ class Ws {
     }
     let l;
     try {
-      l = xs(
+      l = Ms(
         this._columnStore,
         { archetypes: h },
         this._bufferAllocator
@@ -3409,12 +3412,12 @@ class Ws {
    * that pass `new Store(4)` keep working. */
   constructor(t) {
     const e = typeof t == "number" ? { initialCapacity: t } : t ?? {};
-    if (this.initialCapacity = e.initialCapacity ?? ue, this._bufferAllocator = e.bufferAllocator ?? hs(), this._bufferAllocator.isInPlace !== !0)
+    if (this.initialCapacity = e.initialCapacity ?? ue, this._bufferAllocator = e.bufferAllocator ?? as(), this._bufferAllocator.isInPlace !== !0)
       throw new _(
         g.INVALID_MEMORY_OPTIONS,
         "Store requires an in-place SAB allocator (ADR-0008): the flush loops keep writing through hoisted entity-index views across grows, so a non-in-place allocator (e.g. DEFAULT_SAB_ALLOCATOR) corrupts the entity→row mapping. Use growable_sab_allocator / wasm_memory_allocator; non-in-place allocators are snapshot/test sizing utilities only."
       );
-    this._capContext = e.capContext, this._onBufferResized = e.onBufferResized, this._entityIndexCapacity = e.entityIndexCapacity ?? Pe, this._regions = e.regions, this._bindingsRegionBytes = e.bindingsRegionBytes ?? 0, this._deterministic = e.deterministic ?? !1, this._deferred = new Rs(
+    this._capContext = e.capContext, this._onBufferResized = e.onBufferResized, this._entityIndexCapacity = e.entityIndexCapacity ?? He, this._regions = e.regions, this._bindingsRegionBytes = e.bindingsRegionBytes ?? 0, this._deterministic = e.deterministic ?? !1, this._deferred = new As(
       {
         applyAdds: () => this._flushAdds(),
         applyRemoves: () => this._flushRemoves(),
@@ -3425,7 +3428,7 @@ class Ws {
         structuralObserverHook: () => this._structuralObserverHook
       },
       this._obsEvents
-    ), this.relationService = new Ss({
+    ), this.relationService = new Cs({
       isAlive: (n) => this.isAlive(n),
       hasSparse: (n, r) => this.hasSparse(n, r),
       pushSparseStore: (n, r) => this._pushSparseStore(n, r),
@@ -3448,9 +3451,9 @@ class Ws {
     }), this._columnStore = de([], this._bufferAllocator, {
       reservedDescriptorBytes: 64 * 1024,
       entityIndexCapacity: this._entityIndexCapacity,
-      eventRingCapacitySlots: Ke,
-      commandRingCapacitySlots: Qe,
-      actionRingCapacitySlots: Ye,
+      eventRingCapacitySlots: Xe,
+      commandRingCapacitySlots: Ke,
+      actionRingCapacitySlots: Qe,
       regions: this._regions,
       bindingsRegionBytes: this._bindingsRegionBytes
     });
@@ -3459,7 +3462,7 @@ class Ws {
       this._columnStore.header.entityIndexOff,
       this._entityIndexCapacity
     );
-    this.entityArchetype = s.archetypes, this.entityRow = s.rows, this.entityAllocator = new Cs(
+    this.entityArchetype = s.archetypes, this.entityRow = s.rows, this.entityAllocator = new Rs(
       this._entityIndexCapacity,
       s.generations,
       new Uint32Array(
@@ -3467,7 +3470,7 @@ class Ws {
         this._columnStore.header.entityIndexOff + dt.length,
         1
       )
-    ), this._snapshots = new Hs(
+    ), this._snapshots = new Us(
       {
         sparseStores: () => this.sparseStores,
         relationStores: () => this.relationService.stores,
@@ -3488,7 +3491,7 @@ class Ws {
         }
       },
       this.entityAllocator
-    ), this.archGraph = new Us({
+    ), this.archGraph = new qs({
       componentMetas: () => this.componentMetas,
       initialCapacity: () => this.initialCapacity,
       extendStore: (n) => this._archExtendStoreWithNewSpecs(n),
@@ -3598,7 +3601,7 @@ class Ws {
    * view over exactly the region's span without re-reading the directory.
    * Re-fetch after a SAB grow (the offset/view may have moved). (#623) */
   regionHandle(t) {
-    const e = He(this._columnStore.view, t);
+    const e = Ue(this._columnStore.view, t);
     return e === null ? null : {
       buffer: this._columnStore.buffer,
       view: this._columnStore.view,
@@ -3660,7 +3663,7 @@ class Ws {
         e + rt.enabled_count,
         r.hasColumns ? r.enabledCount : 0,
         !0
-      ), e += Ue + i * qe;
+      ), e += qe + i * Ve;
     }
     this._rowCountsDirty = !1;
   }
@@ -3709,7 +3712,7 @@ class Ws {
    * target sets) is the determinism tax the flag gates. */
   stateHash() {
     this._requireDeterministic("state_hash()");
-    let t = Ve;
+    let t = We;
     const e = this.archGraph.archetypes;
     for (let r = 0; r < e.length; r++) {
       const i = e[r], o = i.id, h = i.length;
@@ -3816,7 +3819,7 @@ class Ws {
     }
     let n;
     try {
-      n = Ms(
+      n = Ns(
         this._columnStore,
         { newArchetypes: t, existing: e },
         this._bufferAllocator
@@ -4070,7 +4073,7 @@ class Ws {
    * well-formed handle pays two branches and nothing else (#778 measured).
    */
   isAlive(t) {
-    if (t < 0 || t > We) return !1;
+    if (t < 0 || t > ze) return !1;
     const e = zt(t);
     if (e === It) return !1;
     const s = b(t);
@@ -4365,8 +4368,8 @@ class Ws {
         if (Ht)
           N.moveEntityFromTag(O, j, p, i);
         else {
-          const Se = O.getEdge(R);
-          N.moveEntityFrom(O, j, p, Se.addMap, u, i);
+          const Ce = O.getEdge(R);
+          N.moveEntityFrom(O, j, p, Ce.addMap, u, i);
         }
         ht = L[0];
       } else
@@ -4460,7 +4463,7 @@ class Ws {
    * when nothing is dirty. Caller owns the returned array. */
   _takeDirty(t) {
     const e = this._dirtyLists[t];
-    if (e === void 0 || e.length === 0) return qs;
+    if (e === void 0 || e.length === 0) return Vs;
     this._dirtyLists[t] = [];
     const s = this._dirtyMarks[t];
     for (let n = 0; n < e.length; n++) s[e[n] & Y] = 0;
@@ -4532,7 +4535,7 @@ class Ws {
       trackDirty: !1
     });
     const o = ye(i);
-    return e !== void 0 && ze(o, e), o;
+    return e !== void 0 && je(o, e), o;
   }
   /** `'Pos' (component 5)` when the component was registered with a debug
    * name, else `component 5` — the label diagnostics interpolate. */
@@ -4584,7 +4587,7 @@ class Ws {
    * through `registerSparseComponent`, which guards first. */
   _pushSparseStore(t, e, s) {
     const n = this.sparseStores.length;
-    return this.sparseStores.push(new je(t, e)), this.sparseNames.push(s), M(n);
+    return this.sparseStores.push(new Ye(t, e)), this.sparseNames.push(s), M(n);
   }
   sparseStoreOf(t) {
     const e = t, s = this.sparseStores[e];
@@ -5010,7 +5013,7 @@ class Ws {
     let o = i;
     for (let d = 0; d < i; d++) {
       const f = e[d].def.id;
-      if (f >= se - 1 || i > Vs) {
+      if (f >= se - 1 || i > Ws) {
         o = Ct;
         break;
       }
@@ -5234,9 +5237,9 @@ class Ws {
     for (let c = 0; c < n.length; c++) {
       let l = n[c];
       if (l === 0) continue;
-      const u = c << is;
+      const u = c << os;
       for (; l !== 0; ) {
-        const d = l & -l >>> 0, f = u + (rs - Math.clz32(d));
+        const d = l & -l >>> 0, f = u + (is - Math.clz32(d));
         l ^= d;
         const w = this.archGraph.componentIndex[f];
         if (w === void 0 || w.length === 0) {
@@ -5316,7 +5319,7 @@ class Ws {
   // =======================================================
   // Resource storage — delegations to `ResourceRegistry` (resource_registry.ts)
   // =======================================================
-  resources = new fs();
+  resources = new ps();
   registerResource(t, e) {
     this.resources.register(t, e);
   }
@@ -5335,7 +5338,7 @@ class Ws {
     return this.resources.has(t);
   }
 }
-class zs {
+class js {
   store;
   /** @internal constructed by `ECS`. */
   constructor(t) {
@@ -5409,7 +5412,7 @@ class zs {
     return this.store.compactRelations();
   }
 }
-class js {
+class Ys {
   store;
   /** @internal constructed by `ECS`. */
   constructor(t) {
@@ -5445,7 +5448,7 @@ class js {
     return this.store.getEventReader(e);
   }
 }
-class Ys {
+class Qs {
   store;
   /** @internal constructed by `ECS`. */
   constructor(t) {
@@ -5479,7 +5482,7 @@ class Ys {
     return this.store.hasResource(t);
   }
 }
-class Qs {
+class Ks {
   store;
   /** @internal constructed by `ECS`. */
   constructor(t) {
@@ -5546,7 +5549,7 @@ function Lt(a, t) {
   const s = Object.create(e);
   return s._row = t, s;
 }
-class Ks {
+class Xs {
   // Query deduplication: hash(include, exclude, anyOf) → bucket of cache
   // entries. Multiple term sets can share a hash (collision), so each bucket
   // is an array; `findDedup` equality-checks masks within the bucket.
@@ -5594,10 +5597,10 @@ class Ks {
   }
   /** Record a freshly minted query under its dedup key. */
   addDedup(t, e) {
-    be(this.dedup, t, e);
+    Se(this.dedup, t, e);
   }
 }
-const re = Object.freeze([]), Xs = Object.freeze([]), ie = Object.freeze([]), Rt = Number.POSITIVE_INFINITY, At = 65536;
+const re = Object.freeze([]), Zs = Object.freeze([]), ie = Object.freeze([]), Rt = Number.POSITIVE_INFINITY, At = 65536;
 function nt(a, t) {
   if (a >= At || t >= At)
     throw new _(
@@ -5611,7 +5614,7 @@ function ut(a, t) {
     if (a[e] === t) return a;
   return [...a, t];
 }
-function Zs(a, t) {
+function Js(a, t) {
   for (let e = 0; e < a.length; e++)
     if (a[e] === t) return a;
   return [...a, t];
@@ -5621,7 +5624,7 @@ function oe(a, t) {
     if (a[e] === t) return a;
   return [...a, t];
 }
-class Js {
+class tn {
   /** @internal */
   _arch;
   /** @internal */
@@ -5705,7 +5708,7 @@ class H {
   // archetypes — there is no SoA span — so `forEach` rejects it, like a sparse
   // term); `accessCheck` validates `relationReads: [R]` at iteration time.
   _hierarchy;
-  constructor(t, e, s, n, r, i, o, h = re, c = re, l = Xs, u = !1, d = ie, f = ie, w = null) {
+  constructor(t, e, s, n, r, i, o, h = re, c = re, l = Zs, u = !1, d = ie, f = ie, w = null) {
     this._archetypes = t, this._defs = e, this._resolver = s, this._include = n, this._exclude = r, this._anyOf = i, this._id = o, this._sparseInclude = h, this._sparseExclude = c, this._optional = l, this._includeDisabled = u, this._relationIncludes = d, this._relationExcludes = f, this._hierarchy = w;
   }
   /** Guard the dense-only methods (`count` / `forEach` / `archetype_count`)
@@ -6120,7 +6123,7 @@ class H {
   _optionalOne(t) {
     const e = (this._id << 16 | t) >>> 0, s = this._resolver._caches.optionalSingle, n = s.get(e);
     if (n !== void 0) return n;
-    const r = this._deriveOptional(Zs(this._optional, t));
+    const r = this._deriveOptional(Js(this._optional, t));
     return s.set(e, r), r;
   }
   /** Build a derived query carrying new optional terms. Reuses this query's
@@ -6254,7 +6257,7 @@ class H {
    * column-group caches that actually matter for allocation live on the
    * `Archetype`, untouched. */
   _eachChunkInner(t) {
-    const e = new Js();
+    const e = new tn();
     e._tick = this._resolver._getCurrentTick();
     {
       this._assertDenseOnly("eachChunk"), m.enterOptionalScope(this._optional);
@@ -6477,7 +6480,7 @@ class H {
     return this._resolver._getLastRunTick();
   }
 }
-class tn {
+class en {
   constructor(t) {
     this._resolver = t;
   }
@@ -6487,7 +6490,7 @@ class tn {
     return this._resolver._resolveQuery(e, null, null, t);
   }
 }
-class en {
+class sn {
   constructor(t) {
     this.store = t;
   }
@@ -6542,9 +6545,9 @@ class en {
     return this.store.enableEntityDeferred(t), this.store._trace?.commandQueued("enable", t, null), this;
   }
 }
-class sn {
+class nn {
   constructor(t) {
-    this.store = t, this.commands = new en(t);
+    this.store = t, this.commands = new sn(t);
   }
   lastRunTick = 0;
   /** Deferred structural-command facade (§ctx.commands). */
@@ -6901,7 +6904,7 @@ function ae(a) {
     );
   return a;
 }
-function nn(a) {
+function rn(a) {
   if (!Number.isInteger(a) || a < 1)
     throw new _(
       g.INVALID_MAX_FIXED_STEPS,
@@ -6909,7 +6912,7 @@ function nn(a) {
     );
   return a;
 }
-class pn {
+class _n {
   store;
   schedule;
   ctx;
@@ -6951,7 +6954,7 @@ class pn {
   // All query-resolution caches — dedup + the shared composition maps — in
   // one owner (M2); see `QueryCache` in query.ts for keying/id-space notes.
   /** @internal Query-composition caches (QueryResolver seam) — not public API. */
-  _caches = new Ks();
+  _caches = new Xs();
   // --- SAB layout subscribers (e.g. a compute backend) ---
   // The engine publishes SAB-layout changes to whoever subscribed via
   // `onStoreLayoutPublished`. The engine has no knowledge of what the
@@ -6989,8 +6992,8 @@ class pn {
         he.has(n) || (t.onWarn ?? console.warn)(
           `ECSOptions: unknown option '${n}' ignored — known options: ${[...he].join(", ")}`
         );
-    const s = Xe(t?.memory);
-    this._memory = s, this.store = new Ws({
+    const s = Ze(t?.memory);
+    this._memory = s, this.store = new zs({
       initialCapacity: s.columnCapacity,
       bufferAllocator: s.allocator,
       entityIndexCapacity: s.entityIndexCapacity,
@@ -7007,10 +7010,10 @@ class pn {
       regions: t?.regions,
       bindingsRegionBytes: t?.bindingsRegionBytes,
       deterministic: t?.deterministic
-    }), this.schedule = new Ze(t?.onWarn), this.relations = new zs(this.store), this.events = new js(this.store), this.resources = new Ys(this.store), this.snapshots = new Qs(this.store), this.ctx = new sn(this.store), this._observers = new bs(this.store, this.ctx), this.store.setStructuralObserverHook((n) => this._observers.dispatchStructural(n)), this._fixedTimestep = ae(
-      t?.fixedTimestep ?? Je
-    ), this._maxFixedSteps = nn(
-      t?.maxFixedSteps ?? ts
+    }), this.schedule = new Je(t?.onWarn), this.relations = new js(this.store), this.events = new Ys(this.store), this.resources = new Qs(this.store), this.snapshots = new Ks(this.store), this.ctx = new nn(this.store), this._observers = new Ss(this.store, this.ctx), this.store.setStructuralObserverHook((n) => this._observers.dispatchStructural(n)), this._fixedTimestep = ae(
+      t?.fixedTimestep ?? ts
+    ), this._maxFixedSteps = rn(
+      t?.maxFixedSteps ?? es
     );
   }
   /** Batch variant of `regionHandle` for hosts wiring several consumer
@@ -7378,7 +7381,7 @@ class pn {
   }
   /** QueryResolver implementation — creates or retrieves a cached Query. */
   _resolveQuery(t, e, s, n) {
-    const r = t.hash(), i = e ? e.hash() : 0, o = s ? s.hash() : 0, h = r ^ Math.imul(i, es) ^ Math.imul(o, ss) | 0, c = this._caches.findDedup(h, t, e, s);
+    const r = t.hash(), i = e ? e.hash() : 0, o = s ? s.hash() : 0, h = r ^ Math.imul(i, ss) ^ Math.imul(o, ns) | 0, c = this._caches.findDedup(h, t, e, s);
     if (c !== void 0) return c.query;
     const l = this.store.registerQuery(t, e ?? void 0, s ?? void 0), u = new H(
       l,
@@ -7403,7 +7406,7 @@ class pn {
     let s;
     if (typeof t == "function")
       if (e !== void 0) {
-        const i = e(new tn(this)), o = this.ctx, h = t;
+        const i = e(new en(this)), o = this.ctx, h = t;
         s = { ...xt, fn: (c, l) => h(i, o, l) };
       } else {
         if (t.length >= 3)
@@ -7415,14 +7418,14 @@ class pn {
       }
     else
       s = t;
-    if (gs(s), s.fn === void 0 && s.backendHandle === void 0)
+    if (ys(s), s.fn === void 0 && s.backendHandle === void 0)
       throw new _(
         g.SYSTEM_FN_ARITY,
         `registerSystem: config${s.name ? ` '${s.name}'` : ""} has neither 'fn' nor 'backendHandle' — provide a system body, or a backend handle for backend execution`
       );
     const n = me(this.nextSystemId++), r = Object.freeze({
       ...s,
-      ..._s(s),
+      ...gs(s),
       id: n
     });
     return this.systems.add(r), r;
@@ -7472,7 +7475,7 @@ class pn {
    * `private` because the only caller is `startup()`; visible to tests via
    * the `archetype_count` delta on the public ECS facade. */
   prewarmArchetypes() {
-    const t = rn([...this.systems, ...this._observers.descriptors()]);
+    const t = on([...this.systems, ...this._observers.descriptors()]);
     t.length !== 0 && this.store.archCreateManyFromMasks(t);
   }
   /**
@@ -7728,7 +7731,7 @@ class pn {
   }
   // === END STORE PASS-THROUGH BAND ===
 }
-function rn(a) {
+function on(a) {
   const t = /* @__PURE__ */ new Map(), e = [], s = (o) => {
     const h = o.hash(), c = t.get(h);
     if (c !== void 0) {
@@ -7776,7 +7779,7 @@ function rn(a) {
   for (const o of t.values()) for (let h = 0; h < o.length; h++) i.push(o[h]);
   return i;
 }
-function _n(a, t) {
+function gn(a, t) {
   return typeof t == "object" && t !== null && console.warn(
     `runIfResourceEq('${a.description ?? "?"}'): 'expected' is an object — comparison is by reference identity (===), so the gate only fires when the resource is set to this exact instance. Prefer a primitive phase value.`
   ), {
@@ -7785,7 +7788,7 @@ function _n(a, t) {
     evaluate: (e) => e.getResource(a) === t
   };
 }
-function gn(a, t = 0) {
+function yn(a, t = 0) {
   if (!Number.isInteger(a) || a < 1)
     throw new _(
       g.INVALID_RUN_CONDITION,
@@ -7802,7 +7805,7 @@ function gn(a, t = 0) {
     evaluate: (s) => (s.ecsTick - e) % a === 0
   };
 }
-function yn(a) {
+function mn(a) {
   return {
     name: "runIfAnyMatch",
     reads: a._defs,
@@ -7818,31 +7821,31 @@ function Pt(a) {
     ...e.length > 0 ? { resourceReads: e } : {}
   };
 }
-function mn(a) {
+function wn(a) {
   return {
     name: `not(${a.name})`,
     ...Pt([a]),
     evaluate: (t) => !a.evaluate(t)
   };
 }
-function wn(...a) {
+function En(...a) {
   return {
     name: `allOf(${a.map((t) => t.name).join(", ")})`,
     ...Pt(a),
     evaluate: (t) => a.every((e) => e.evaluate(t))
   };
 }
-function En(...a) {
+function vn(...a) {
   return {
     name: `anyOf(${a.map((t) => t.name).join(", ")})`,
     ...Pt(a),
     evaluate: (t) => a.some((e) => e.evaluate(t))
   };
 }
-function on(a) {
+function hn(a) {
   return a.kind === "spawn" && a.onSpawned !== void 0 ? { kind: "spawn", components: a.components } : a;
 }
-class vn {
+class bn {
   /** Session seed, echoed into the produced {@link CommandLog}. */
   seed;
   _startup = [];
@@ -7863,7 +7866,7 @@ class vn {
     this._ticks.push({ tick: t, dt: e, commands: n }), this.sink = n;
   }
   record = (t) => {
-    this.sink.push(on(t));
+    this.sink.push(hn(t));
   };
   /** A live {@link CommandLog} view over the accumulated stream — not a copy.
    * Serialize it (which deep-copies through JSON) before mutating the world
@@ -7882,7 +7885,7 @@ class vn {
   }
 }
 const it = "__component_def";
-function bn(a) {
+function Sn(a) {
   return JSON.stringify(a, (t, e) => {
     if (typeof e == "function" && "id" in e)
       return { [it]: e.id };
@@ -7894,10 +7897,10 @@ function bn(a) {
     return e;
   });
 }
-function Sn(a) {
+function Cn(a) {
   return JSON.parse(a, (t, e) => e !== null && typeof e == "object" && it in e ? ye(ge(e[it])) : e);
 }
-function Cn(a, t, e, s) {
+function Rn(a, t, e, s) {
   for (const i of e.startup) t.push(i);
   a.startup();
   const n = s?.hash ?? a.snapshots.deterministic, r = [];
@@ -7910,7 +7913,7 @@ function Cn(a, t, e, s) {
 function Ot(a) {
   return a.name ?? `system#${a.id}`;
 }
-class Rn {
+class An {
   _frames = [];
   _current = null;
   tickBegin(t, e) {
@@ -7975,7 +7978,7 @@ function V(a, t) {
     );
   return t;
 }
-function hn(a) {
+function an(a) {
   if (!Number.isInteger(a) || a < 0)
     throw new _(
       g.INVALID_FRAME_STEP,
@@ -7983,7 +7986,7 @@ function hn(a) {
     );
   return a;
 }
-class An {
+class On {
   ecs;
   requestFrame;
   cancelFrame;
@@ -8018,7 +8021,7 @@ class An {
   }
   /** Advance several fixed-size frames, useful for replaying a paused sim. */
   stepFrames(t, e = this._fixedDt) {
-    hn(t);
+    an(t);
     const s = V("dt", e);
     for (let n = 0; n < t; n++) this.ecs.update(s);
   }
@@ -8052,65 +8055,65 @@ class An {
     this.lastTimestampMs = t, this.ecs.update(Math.min(V("dt", e), this._maxDt)), this.running && this.scheduleNextFrame();
   };
 }
-function On(a, t) {
+function In(a, t) {
   return a.relations.register({
     exclusive: !0,
     onDeleteTarget: t?.onDeleteTarget ?? "clear"
   });
 }
-function In(a, t) {
+function Tn(a, t) {
   return a.relations.register({
     exclusive: !0,
     onDeleteTarget: t?.onDeleteTarget ?? "delete"
   });
 }
-function Tn(a) {
+function Dn(a) {
   return M(Symbol(a));
 }
-const Dn = "0.5.2";
+const kn = "0.5.3";
 export {
-  Mn as ANY_RELATION,
+  Nn as ANY_RELATION,
   z as ChangedQuery,
-  Js as ChunkColumns,
-  en as Commands,
-  pn as ECS,
+  tn as ChunkColumns,
+  sn as Commands,
+  _n as ECS,
   _ as ECSError,
   x as ECSRestoreError,
   g as ECS_ERROR,
   Nt as ECS_SNAPSHOT_VERSION,
-  An as FrameStepper,
-  Rn as FrameTraceRecorder,
+  On as FrameStepper,
+  An as FrameTraceRecorder,
   Rt as HIERARCHY_UNBOUNDED,
-  Nn as HostCommandQueue,
-  vn as HostCommandRecorder,
+  Ln as HostCommandQueue,
+  bn as HostCommandRecorder,
   H as Query,
-  tn as QueryBuilder,
-  Ln as SCHEDULE,
-  qn as SabUnavailableError,
+  en as QueryBuilder,
+  $n as SCHEDULE,
+  Vn as SabUnavailableError,
   at as SparseRestoreError,
   tt as StoreRestoreError,
-  sn as SystemContext,
-  Dn as VERSION,
-  wn as allOf,
-  En as anyOf,
-  $n as applyHostCommand,
-  un as bundle,
-  Sn as deserializeCommandLog,
-  dn as eventKey,
+  nn as SystemContext,
+  kn as VERSION,
+  En as allOf,
+  vn as anyOf,
+  Fn as applyHostCommand,
+  dn as bundle,
+  Cn as deserializeCommandLog,
+  fn as eventKey,
   b as getEntityIndex,
-  Fn as installHostCommandSeam,
-  Bn as isEcsError,
-  mn as not,
-  In as registerChildOf,
-  On as registerIsA,
-  Cn as replayCommandLog,
-  Tn as resourceKey,
-  gn as runEveryNTicks,
-  yn as runIfAnyMatch,
-  _n as runIfResourceEq,
-  bn as serializeCommandLog,
-  fn as signalKey,
-  Gn as spawnEntry,
-  Pn as systemSet,
-  Hn as uninstallHostCommandSeam
+  Bn as installHostCommandSeam,
+  Gn as isEcsError,
+  wn as not,
+  Tn as registerChildOf,
+  In as registerIsA,
+  Rn as replayCommandLog,
+  Dn as resourceKey,
+  yn as runEveryNTicks,
+  mn as runIfAnyMatch,
+  gn as runIfResourceEq,
+  Sn as serializeCommandLog,
+  pn as signalKey,
+  Pn as spawnEntry,
+  Hn as systemSet,
+  Un as uninstallHostCommandSeam
 };