@oasys/oecs 0.5.2 → 0.5.3

package/dist/index.js

@@ -1,8 +1,8 @@
-import { v as dt, S as O, o as ht, p as at, q as ct, s as Jt, t as te, u as Ot, w as T, E as v, x as b, N as P, y as ee, z as w, U as I, A as pe, C as _e, F as ge, G as ye, I as me, j as J, J as Lt, R as Et, K as se, L as we, O as Ee, P as ve, Q as lt, T as ne, V as kt, W as re, X as ie, Y as vt, Z as be, _ as Ce, $ as it, a0 as Se, a1 as Re, a2 as et, a3 as Ie, a4 as Ae, a5 as Oe, a6 as ke, a7 as Nt, a8 as Te, a9 as Bt, aa as De, ab as ft, ac as xe, ad as Me, ae as M, af as Le, ag as Ft, ah as Y, k as $t, n as Ne, ai as V, aj as st, ak as Be, al as Fe, am as pt, an as $e, ao as Ge, ap as Pe, c as ut, r as Ue, aq as He, ar as Ve, as as qe, at as je, au as ze } from "./host_commands-BI8pEmjH.js";
-import { aC as bn, aA as Cn, av as Sn, az as Rn, ax as In, aD as An, aB as On, aw as kn, ay as Tn } from "./host_commands-BI8pEmjH.js";
-import { h as We, B as $, i as Ye, j as Qe } from "./typed_arrays-BcXcnzB4.js";
-import { D as Ke, S as Gt, g as Xe } from "./shared-BU1Cd40h.js";
-import { a as xn } from "./shared-BU1Cd40h.js";
+import { v as dt, S as O, o as ht, p as at, q as ct, s as Jt, t as te, u as Ot, w as T, E as v, x as b, N as P, y as ee, z as w, U as I, A as _e, C as ge, F as ye, G as me, I as we, j as J, J as Lt, R as Et, K as se, L as Ee, O as ve, P as be, Q as lt, T as ne, V as kt, W as re, X as ie, Y as vt, Z as Ce, _ as Se, $ as it, a0 as Re, a1 as Ie, a2 as et, a3 as Ae, a4 as Oe, a5 as ke, a6 as Te, a7 as Nt, a8 as De, a9 as Bt, aa as xe, ab as ft, ac as Me, ad as Le, ae as M, af as Ne, ag as Ft, ah as Y, k as $t, n as Be, ai as V, aj as st, ak as Fe, al as $e, am as pt, an as Ge, ao as Pe, ap as Ue, c as ut, r as He, aq as Ve, ar as qe, as as je, at as ze, au as We } from "./host_commands-3jyFfWNg.js";
+import { aC as Cn, aA as Sn, av as Rn, az as In, ax as An, aD as On, aB as kn, aw as Tn, ay as Dn } from "./host_commands-3jyFfWNg.js";
+import { h as Ye, B as $, i as Qe, j as Ke } from "./typed_arrays-BcXcnzB4.js";
+import { D as Xe, S as Gt, g as Ze } from "./shared-DQKK0i-E.js";
+import { a as Mn } from "./shared-DQKK0i-E.js";
 const L = !1, oe = (a) => dt(
   a
 ), Tt = Object.freeze({});
@@ -13,7 +13,7 @@ function he(a) {
   }));
   return Object.defineProperty(t, "id", { value: a, enumerable: !1 }), t;
 }
-function Js(a, ...t) {
+function tn(a, ...t) {
   return { def: a, values: t[0] ?? Tt };
 }
 function j(a) {
@@ -27,11 +27,11 @@ class Q extends Error {
     super(t), this.name = "StoreRestoreError";
   }
 }
-function Ze(a) {
+function Je(a) {
   const t = a.view.getUint32(O.capacity, !0);
   return new Uint8Array(a.buffer, 0, t);
 }
-function Je(a, t = Ke) {
+function ts(a, t = Xe) {
   const e = new DataView(a.buffer, a.byteOffset, a.byteLength);
   if (a.byteLength < ht)
     throw new Q(
@@ -67,10 +67,10 @@ function Je(a, t = Ke) {
     ) : h;
   }
 }
-const ts = (a) => dt(
+const es = (a) => dt(
   a
 );
-class es {
+class ss {
   fieldNames;
   columns;
   // any: type-erased storage — channel is stored in Map<number, EventChannel>, S is lost
@@ -107,13 +107,13 @@ class es {
       t[e].length = 0;
   }
 }
-function tn(a) {
+function en(a) {
   return T(Symbol(a));
 }
-function en(a) {
+function sn(a) {
   return T(Symbol(a));
 }
-class ss {
+class ns {
   // Parallel array indexed by EventID: each channel holds SoA columns + reader.
   channels = [];
   // IDs of channels emitted to since the last `clearEvents()`. An `emit*`
@@ -126,7 +126,7 @@ class ss {
   // callers via EventKey<F>
   keyMap = /* @__PURE__ */ new Map();
   registerEvent(t) {
-    const e = ts(this.count++), s = new es(t);
+    const e = es(this.count++), s = new ss(t);
     return this.channels.push(s), T(e);
   }
   emitEvent(t, e) {
@@ -182,7 +182,7 @@ class ss {
     return this.keyMap.has(t);
   }
 }
-class ns {
+class rs {
   map = /* @__PURE__ */ new Map();
   register(t, e) {
     if (this.map.has(t))
@@ -235,7 +235,7 @@ class nt extends Error {
     super(`BufferBackedColumn overflow: requested length ${e} exceeds capacity ${t}`), this.name = "StoreColumnOverflowError", this.capacity = t, this.requested = e;
   }
 }
-class rs {
+class is {
   _buf;
   _capacity;
   _len = 0;
@@ -453,7 +453,7 @@ class Dt {
    * current SAB row capacity. (#171 §6.1.9 Phase 3) */
   growHandler = null;
   constructor(t, e, s, n = ee, r) {
-    if (this.id = t, this.mask = e, this._entityIds = new We(n), s) {
+    if (this.id = t, this.mask = e, this._entityIds = new Ye(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);
@@ -490,13 +490,13 @@ class Dt {
         `ColumnStore has no archetype ${r}`
       );
     const o = (c, l) => {
-      const u = i.columns.get(pe(c, l));
+      const u = i.columns.get(_e(c, l));
       if (!u)
         throw new v(
           b.COMPONENT_NOT_REGISTERED,
           `ColumnStore archetype ${r} has no column for (${c}, ${l})`
         );
-      return new rs(u.view);
+      return new is(u.view);
     }, h = new Dt(t, e, s, i.rowCapacity, o);
     return h._storeArchetypeId = r, h;
   }
@@ -1118,7 +1118,7 @@ const ae = (a) => dt(
 function Ut(a) {
   return typeof a == "object" && !Array.isArray(a);
 }
-function is(a) {
+function os(a) {
   let t = K;
   a.spawns !== void 0 && a.spawns.length > 0 && (t = a.spawns.map((s) => Ut(s) ? s.defs : s));
   let e = K;
@@ -1154,26 +1154,26 @@ const St = Object.freeze({
   sparseWrites: Object.freeze([]),
   relationReads: Object.freeze([]),
   relationWrites: Object.freeze([])
-}), os = Symbol.dispose ?? Symbol.for("Symbol.dispose"), _t = (1 << 20) - 1;
-let hs = 0;
-function as(a, t) {
+}), hs = Symbol.dispose ?? Symbol.for("Symbol.dispose"), _t = (1 << 20) - 1;
+let as = 0;
+function cs(a, t) {
   const e = {
     ...St,
     ...t,
-    id: ae(hs++),
+    id: ae(as++),
     name: a,
-    fn: cs
+    fn: ls
   };
   return Object.freeze(e);
 }
-function cs() {
+function ls() {
 }
 function Ht(a) {
   const t = /* @__PURE__ */ new Set();
   if (a) for (let e = 0; e < a.length; e++) t.add(a[e].id);
   return t;
 }
-function ls(a) {
+function us(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);
@@ -1204,7 +1204,7 @@ function ls(a) {
   }
   return r;
 }
-class us {
+class ds {
   constructor(t, e) {
     this.store = t, this.ctx = e;
   }
@@ -1247,8 +1247,8 @@ class us {
     return t;
   }
   register(t, e) {
-    const s = t.id, n = e.granularity ?? "archetype", r = e.onSet !== void 0 && n === "entity", i = e.onSet !== void 0 && n !== "entity", o = e.access ?? {}, h = as(
-      e.name ?? `observer(${_e(t) ?? s})`,
+    const s = t.id, n = e.granularity ?? "archetype", r = e.onSet !== void 0 && n === "entity", i = e.onSet !== void 0 && n !== "entity", o = e.access ?? {}, h = cs(
+      e.name ?? `observer(${ge(t) ?? s})`,
       o
     ), c = {
       // Share one identity space with the descriptor (used only for the
@@ -1273,7 +1273,7 @@ class us {
     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, [os]: u };
+    return { dispose: u, [hs]: u };
   }
   _dispose(t) {
     if (t.disposed) return;
@@ -1308,7 +1308,7 @@ class us {
     );
   }
   getTopo() {
-    return this._topo === null && (this._topo = ls(this.entries)), this._topo;
+    return this._topo === null && (this._topo = us(this.entries)), this._topo;
   }
   // =======================================================
   // Structural dispatch (onAdd / onRemove)
@@ -1452,7 +1452,7 @@ function ot(a, t, e, s) {
     }
   }
 }
-class ds {
+class fs {
   constructor(t) {
     this.host = t;
   }
@@ -1514,9 +1514,9 @@ class ds {
         b.RELATION_MODE_INVALID,
         "register_relation: a relation cannot be both exclusive and multi-target"
       );
-    const n = !e, r = t?.onDeleteTarget ?? ge, i = n ? this.host.pushSparseStore([ye], ["f64"]) : this.host.pushSparseStore([], []), o = this.relations.length;
+    const n = !e, r = t?.onDeleteTarget ?? ye, i = n ? this.host.pushSparseStore([me], ["f64"]) : this.host.pushSparseStore([], []), o = this.relations.length;
     return this.relations.push(
-      me(n, i, this.host.sparseStoreOf(i), r)
+      we(n, i, this.host.sparseStoreOf(i), r)
     ), r !== "orphan" && (this._hasTargetCleanup = !0), T(o);
   }
   relationOf(t) {
@@ -1906,7 +1906,7 @@ class ds {
     return s.get(t);
   }
 }
-class fs {
+class ps {
   /** SAB-backed per-slot generation counters — replanted on restore. */
   _generations;
   /** Single-slot view over the entity-index region's `length` header field —
@@ -2013,7 +2013,7 @@ class fs {
   }
 }
 const Vt = 65536;
-class ps {
+class _s {
   // --- 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
@@ -2100,7 +2100,7 @@ function ce(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 = we(e, h.stride), i[o] = {
+      e = Ee(e, h.stride), i[o] = {
         componentId: h.componentId,
         fieldId: h.fieldId,
         typeTag: h.typeTag,
@@ -2117,15 +2117,18 @@ function ce(a, t) {
       columns: i
     };
   }
-  if (e > Ee)
-    throw new ve(e);
+  if (e > ve)
+    throw new be(e);
   return { descriptors: s, newTotal: e };
 }
 function le(a, t) {
   const e = a._allocator(t), s = e !== a.buffer ? new DataView(e) : a.view;
   return { grownBuffer: e, newView: s };
 }
-function _s(a) {
+function ue(a) {
+  return a.buffer instanceof ArrayBuffer ? a.view.getUint32(O.capacity, !0) : a.buffer.byteLength;
+}
+function gs(a) {
   const t = {};
   for (let n = 0; n < lt.length; n++) {
     const r = lt[n], i = a.view.getUint32(O[r.headerOff], !0);
@@ -2148,7 +2151,7 @@ function _s(a) {
   }
   return kt(a) && a._reservedDescriptorBytes > 0 && (t.reservedDescriptorBytes = a._reservedDescriptorBytes), t;
 }
-function gs(a) {
+function ys(a) {
   const t = /* @__PURE__ */ new Map();
   for (let n = 0; n < lt.length; n++) {
     const r = lt[n], i = a.view.getUint32(O[r.headerOff], !0);
@@ -2163,7 +2166,7 @@ function gs(a) {
   }
   return { mechanism: t, consumer: e };
 }
-function ys(a, t) {
+function ms(a, t) {
   for (const [e, s] of t.mechanism) {
     const n = a.view.getUint32(O[e], !0);
     new Uint8Array(a.buffer, n, s.byteLength).set(s);
@@ -2174,7 +2177,7 @@ function ys(a, t) {
     new Uint8Array(a.buffer, n, s.byteLength).set(s);
   }
 }
-function ms(a, t) {
+function ws(a, t) {
   const e = /* @__PURE__ */ new Map();
   for (const [s, n] of a.archetypes) {
     const r = t.get(s) ?? 0;
@@ -2188,7 +2191,7 @@ function ms(a, t) {
   }
   return e;
 }
-function ws(a, t) {
+function Es(a, t) {
   for (const [e, s] of t) {
     const n = a.archetypes.get(e);
     if (n === void 0)
@@ -2202,16 +2205,16 @@ function ws(a, t) {
     }
   }
 }
-function ue(a, t, e, s) {
-  const n = a.view.getUint32(O.view_stamp, !0), r = ms(a, e), i = gs(a), o = _s(a), h = se(t, s, o);
-  ws(h, r), ys(h, i);
+function de(a, t, e, s) {
+  const n = a.view.getUint32(O.view_stamp, !0), r = ws(a, e), i = ys(a), o = gs(a), h = se(t, s, o);
+  Es(h, r), ms(h, i);
   const c = n + 1 >>> 0;
   return h.view.setUint32(O.view_stamp, c, !0), { store: {
     ...h,
     header: { ...h.header, viewStamp: c }
   }, oldViewStamp: n, newViewStamp: c };
 }
-function Es(a, t, e) {
+function vs(a, t, e) {
   const s = new Array(t.length);
   for (let p = 0; p < t.length; p++) {
     const m = t[p], C = a.archetypes.get(m.archetypeId);
@@ -2222,7 +2225,7 @@ function Es(a, t, e) {
       columns: C.columnsInOrder
     };
   }
-  const { descriptors: n, newTotal: r } = ce(a.buffer.byteLength, s), i = /* @__PURE__ */ new Map();
+  const { descriptors: n, newTotal: r } = ce(ue(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 } = le(a, r), c = new Uint8Array(o);
@@ -2271,7 +2274,7 @@ class gt extends Error {
     super(t), this.name = "StoreGrowError";
   }
 }
-function vs(a, t, e) {
+function bs(a, t, e) {
   const s = /* @__PURE__ */ new Map();
   for (let l = 0; l < t.archetypes.length; l++) {
     const u = t.archetypes[l];
@@ -2310,9 +2313,9 @@ function vs(a, t, e) {
   }
   if (e?.isInPlace === !0 && kt(a) && a._allocator === e && r.length > 0) {
     const l = a.view.getUint32(O.layout_descriptor_off, !0);
-    return Es(a, r, l);
+    return vs(a, r, l);
   }
-  const { store: o, oldViewStamp: h, newViewStamp: c } = ue(
+  const { store: o, oldViewStamp: h, newViewStamp: c } = de(
     a,
     n,
     i,
@@ -2331,7 +2334,7 @@ class q extends Error {
     super(t), this.name = "StoreExtendError";
   }
 }
-function bs(a, t, e) {
+function Cs(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();
@@ -2375,7 +2378,7 @@ function bs(a, t, e) {
     for (let d = 0; d < t.newArchetypes.length; d++)
       u += vt(t.newArchetypes[d].columns.length);
     if (l + u <= a._regionBytes)
-      return Cs(a, t.newArchetypes, c, l);
+      return Ss(a, t.newArchetypes, c, l);
   }
   const r = [];
   for (const [c, l] of a.archetypes)
@@ -2387,7 +2390,7 @@ function bs(a, t, e) {
     });
   for (let c = 0; c < t.newArchetypes.length; c++)
     r.push(t.newArchetypes[c]);
-  const { store: i, oldViewStamp: o, newViewStamp: h } = ue(
+  const { store: i, oldViewStamp: o, newViewStamp: h } = de(
     a,
     r,
     n,
@@ -2395,7 +2398,7 @@ function bs(a, t, e) {
   );
   return { store: i, oldViewStamp: o, newViewStamp: h, viewsPreserved: !1 };
 }
-function Cs(a, t, e, s) {
+function Ss(a, t, e, s) {
   const n = new Array(t.length);
   for (let y = 0; y < t.length; y++) {
     const p = t[y];
@@ -2407,12 +2410,12 @@ function Cs(a, t, e, s) {
         componentId: m.componentId,
         fieldId: m.fieldId,
         typeTag: m.typeTag,
-        stride: be[m.typeTag]
+        stride: Ce[m.typeTag]
       }))
     };
   }
   const { descriptors: r, newTotal: i } = ce(
-    a.buffer.byteLength,
+    ue(a),
     n
   ), { grownBuffer: o, newView: h } = le(a, i);
   let c = e + s;
@@ -2451,7 +2454,7 @@ class k extends Error {
   }
 }
 const W = 4;
-function Ss(a) {
+function Rs(a) {
   const t = a.freeIndices.length, e = a.archetypeRows.length, s = W * (4 + t + 1 + e * 3), n = new Uint8Array(s), r = new DataView(n.buffer);
   let i = 0;
   const o = (h) => {
@@ -2466,7 +2469,7 @@ function Ss(a) {
   }
   return n;
 }
-function Rs(a) {
+function Is(a) {
   const t = new DataView(a.buffer, a.byteOffset, a.byteLength), e = a.byteLength;
   let s = 0;
   const n = (f) => {
@@ -2491,11 +2494,11 @@ function Rs(a) {
     );
   return { tick: i, entityHighWater: o, entityAliveCount: h, freeIndices: l, archetypeRows: d };
 }
-function Is(a, t, e) {
+function As(a, t, e) {
   const s = W * 5, n = new Uint8Array(s + a.length + t.length + e.length), r = new DataView(n.buffer);
   return r.setUint32(0, Rt, !0), r.setUint32(4, It, !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 As(a) {
+function Os(a) {
   const t = W * 5;
   if (a.byteLength < t)
     throw new k(
@@ -2523,7 +2526,7 @@ function As(a) {
     host: new Uint8Array(c, h + t + r + i, o)
   };
 }
-function Os(a, t, e) {
+function ks(a, t, e) {
   if (a.byteLength < ht)
     throw new k(
       `dense section too small: ${a.byteLength} bytes (SAB header needs ${ht})`
@@ -2544,7 +2547,7 @@ function Os(a, t, e) {
       `dense layoutDescriptorOff ${i.layoutDescriptorOff} is outside the section (${a.byteLength} bytes)`
     );
   const o = i.entityIndexOff;
-  if (o < 0 || o + Ce > a.byteLength)
+  if (o < 0 || o + Se > a.byteLength)
     throw new k(
       `dense entityIndexOff ${o} is outside the section (${a.byteLength} bytes)`
     );
@@ -2575,7 +2578,7 @@ function Os(a, t, e) {
       throw new k(
         `archetype-set mismatch: snapshot archetype ${u.archetypeId} is absent from the live world`
       );
-    if (!ks(d.componentMask, u.componentMask))
+    if (!Ts(d.componentMask, u.componentMask))
       throw new k(
         `archetype ${u.archetypeId} component-mask mismatch between the live world and the snapshot (different component registration)`
       );
@@ -2591,12 +2594,12 @@ function Os(a, t, e) {
         );
   }
 }
-function ks(a, t) {
+function Ts(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 Ts {
+class Ds {
   host;
   /** The allocator IS its own snapshot seam (H1 step 3): free-list copy on
    * capture; `setHighWater` + `restoreHostState` on mount. */
@@ -2614,7 +2617,7 @@ class Ts {
    * different orders snapshot byte-for-byte the same (#470). The reverse index
    * is derived and never serialized — `restoreSparse` rebuilds it. */
   snapshotSparse() {
-    const t = Se(this.host.sparseStores()), e = Re(this.host.relationStores()), s = new Uint8Array(8 + t.length + e.length), n = new DataView(s.buffer);
+    const t = Re(this.host.sparseStores()), e = Ie(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
@@ -2637,7 +2640,7 @@ class Ts {
       throw new et(
         `sparse snapshot frame mismatch: header declares 8+${s}+${n}=${8 + s + n} bytes, buffer is ${t.byteLength}`
       );
-    Ie(this.host.sparseStores(), t.subarray(8, 8 + s)), this.rebuildRelationIndices(t.subarray(8 + s, 8 + s + n));
+    Ae(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
@@ -2647,7 +2650,7 @@ class Ts {
    * `(source index → target EntityID)`, which is exactly one reverse edge. */
   rebuildRelationIndices(t) {
     const e = this.host.generations(), s = (r) => J(r, e[r]), n = this.host.relationStores();
-    Ae(n, t, s);
+    Oe(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
@@ -2656,8 +2659,8 @@ class Ts {
    * relation bytes, and the host-side bookkeeping the SAB omits. */
   snapshot() {
     this.host.publishRowCounts();
-    const t = new Uint8Array(Ze(this.host.columnStore())), e = this.snapshotSparse(), s = Ss(this.collectHostState());
-    return Is(t, e, s);
+    const t = new Uint8Array(Je(this.host.columnStore())), e = this.snapshotSparse(), s = Rs(this.collectHostState());
+    return As(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). */
@@ -2683,13 +2686,13 @@ class Ts {
    * ticking. Fails closed on a malformed frame or a registration mismatch
    * BEFORE any live state is touched. */
   restoreInto(t) {
-    const e = As(t), s = Rs(e.host);
-    Os(
+    const e = Os(t), s = Is(e.host);
+    ks(
       e.dense,
       this.host.columnStore().archetypes,
       this.host.entityIndexCapacity()
     ), this.assertSparseSectionMatches(e.sparse);
-    const n = Je(e.dense, this.host.bufferAllocator());
+    const n = ts(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
@@ -2711,14 +2714,14 @@ class Ts {
       throw new et(
         `sparse snapshot frame mismatch: header declares 8+${s}+${n}=${8 + s + n} bytes, buffer is ${t.byteLength}`
       );
-    Oe(this.host.sparseStores(), t.subarray(8, 8 + s));
+    ke(this.host.sparseStores(), t.subarray(8, 8 + s));
   }
 }
-function de(a, t, e) {
+function fe(a, t, e) {
   const s = a.get(t);
   s !== void 0 ? s.push(e) : a.set(t, [e]);
 }
-class Ds {
+class xs {
   /** All archetypes, indexed by `ArchetypeID` (ids are minted monotonically
    * and never removed). Store's flush loops hoist this array to a local. */
   archetypes = [];
@@ -2842,7 +2845,7 @@ class Ds {
    * 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), de(this.archetypeMap, n, t), e.forEach((o) => {
+    this.archetypes.push(i), fe(this.archetypeMap, n, t), e.forEach((o) => {
       const h = o;
       let c = this.componentIndex[h];
       c === void 0 && (c = [], this.componentIndex[h] = c), c.push(t);
@@ -2896,7 +2899,7 @@ function qt(a, t, e, s) {
       n.push({
         componentId: h.componentId,
         fieldId: l,
-        typeTag: ke[c[l]]
+        typeTag: Te[c[l]]
       });
   }
   const r = t._words, i = new Array(Nt);
@@ -2909,8 +2912,8 @@ function qt(a, t, e, s) {
     columns: n
   };
 }
-const xs = [], jt = -1, yt = new DataView(new ArrayBuffer(8)), zt = 129, Ms = 7, mt = -1;
-class Ls {
+const Ms = [], jt = -1, yt = new DataView(new ArrayBuffer(8)), zt = 129, Ls = 7, mt = -1;
+class Ns {
   // --- Entity ID management ---
   // Generational slot allocation (generations view, high-water, free-list,
   // alive count) lives in `EntityAllocator` (H1 step 3). `entityArchetype` /
@@ -2947,7 +2950,7 @@ class Ls {
   // --- 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 ss();
+  events = new ns();
   // --- Archetype management ---
   // Topology (archetype list, mask→id map, id counter, inverted component
   // index, edge resolution/creation) lives in `ArchetypeGraph` (H1 step 6).
@@ -3148,7 +3151,7 @@ class Ls {
     }
     let l;
     try {
-      l = vs(
+      l = bs(
         this._columnStore,
         { archetypes: h },
         this._bufferAllocator
@@ -3197,12 +3200,12 @@ class Ls {
    * that pass `new Store(4)` keep working. */
   constructor(t) {
     const e = typeof t == "number" ? { initialCapacity: t } : t ?? {};
-    if (this.initialCapacity = e.initialCapacity ?? ee, this._bufferAllocator = e.bufferAllocator ?? Xe(), this._bufferAllocator.isInPlace !== !0)
+    if (this.initialCapacity = e.initialCapacity ?? ee, this._bufferAllocator = e.bufferAllocator ?? Ze(), this._bufferAllocator.isInPlace !== !0)
       throw new v(
         b.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 ?? Te, this._regions = e.regions, this._bindingsRegionBytes = e.bindingsRegionBytes ?? 0, this._deterministic = e.deterministic ?? !1, this._deferred = new ps(
+    this._capContext = e.capContext, this._onBufferResized = e.onBufferResized, this._entityIndexCapacity = e.entityIndexCapacity ?? De, this._regions = e.regions, this._bindingsRegionBytes = e.bindingsRegionBytes ?? 0, this._deterministic = e.deterministic ?? !1, this._deferred = new _s(
       {
         applyAdds: () => this._flushAdds(),
         applyRemoves: () => this._flushRemoves(),
@@ -3213,7 +3216,7 @@ class Ls {
         structuralObserverHook: () => this._structuralObserverHook
       },
       this._obsEvents
-    ), this.relationService = new ds({
+    ), this.relationService = new fs({
       isAlive: (n) => this.isAlive(n),
       hasSparse: (n, r) => this.hasSparse(n, r),
       pushSparseStore: (n, r) => this._pushSparseStore(n, r),
@@ -3236,9 +3239,9 @@ class Ls {
     }), this._columnStore = se([], this._bufferAllocator, {
       reservedDescriptorBytes: 64 * 1024,
       entityIndexCapacity: this._entityIndexCapacity,
-      eventRingCapacitySlots: Pe,
-      commandRingCapacitySlots: Ge,
-      actionRingCapacitySlots: $e,
+      eventRingCapacitySlots: Ue,
+      commandRingCapacitySlots: Pe,
+      actionRingCapacitySlots: Ge,
       regions: this._regions,
       bindingsRegionBytes: this._bindingsRegionBytes
     });
@@ -3247,7 +3250,7 @@ class Ls {
       this._columnStore.header.entityIndexOff,
       this._entityIndexCapacity
     );
-    this.entityArchetype = s.archetypes, this.entityRow = s.rows, this.entityAllocator = new fs(
+    this.entityArchetype = s.archetypes, this.entityRow = s.rows, this.entityAllocator = new ps(
       this._entityIndexCapacity,
       s.generations,
       new Uint32Array(
@@ -3255,7 +3258,7 @@ class Ls {
         this._columnStore.header.entityIndexOff + it.length,
         1
       )
-    ), this._snapshots = new Ts(
+    ), this._snapshots = new Ds(
       {
         sparseStores: () => this.sparseStores,
         relationStores: () => this.relationService.stores,
@@ -3276,7 +3279,7 @@ class Ls {
         }
       },
       this.entityAllocator
-    ), this.archGraph = new Ds({
+    ), this.archGraph = new xs({
       componentMetas: () => this.componentMetas,
       initialCapacity: () => this.initialCapacity,
       extendStore: (n) => this._archExtendStoreWithNewSpecs(n),
@@ -3386,7 +3389,7 @@ class Ls {
    * 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 = De(this._columnStore.view, t);
+    const e = xe(this._columnStore.view, t);
     return e === null ? null : {
       buffer: this._columnStore.buffer,
       view: this._columnStore.view,
@@ -3438,7 +3441,7 @@ class Ls {
         e + ft.enabled_count,
         r.hasColumns ? r.enabledCount : 0,
         !0
-      ), e += xe + i * Me;
+      ), e += Me + i * Le;
     }
     this._rowCountsDirty = !1;
   }
@@ -3487,7 +3490,7 @@ class Ls {
    * target sets) is the determinism tax the flag gates. */
   stateHash() {
     this._requireDeterministic("state_hash()");
-    let t = Le;
+    let t = Ne;
     const e = this.archGraph.archetypes;
     for (let r = 0; r < e.length; r++) {
       const i = e[r], o = i.id, h = i.length;
@@ -3588,7 +3591,7 @@ class Ls {
     }
     let n;
     try {
-      n = bs(
+      n = Cs(
         this._columnStore,
         { newArchetypes: t, existing: e },
         this._bufferAllocator
@@ -3832,7 +3835,7 @@ class Ls {
    * well-formed handle pays two branches and nothing else (#778 measured).
    */
   isAlive(t) {
-    if (t < 0 || t > Ne) return !1;
+    if (t < 0 || t > Be) return !1;
     const e = $t(t);
     if (e === Et) return !1;
     const s = w(t);
@@ -4119,8 +4122,8 @@ class Ls {
         if (Mt)
           D.moveEntityFromTag(R, H, p, i);
         else {
-          const fe = R.getEdge(S);
-          D.moveEntityFrom(R, H, p, fe.addMap, u, i);
+          const pe = R.getEdge(S);
+          D.moveEntityFrom(R, H, p, pe.addMap, u, i);
         }
         tt = x[0];
       } else
@@ -4214,7 +4217,7 @@ class Ls {
    * when nothing is dirty. Caller owns the returned array. */
   _takeDirty(t) {
     const e = this._dirtyLists[t];
-    if (e === void 0 || e.length === 0) return xs;
+    if (e === void 0 || e.length === 0) return Ms;
     this._dirtyLists[t] = [];
     const s = this._dirtyMarks[t];
     for (let n = 0; n < e.length; n++) s[e[n] & V] = 0;
@@ -4286,7 +4289,7 @@ class Ls {
       trackDirty: !1
     });
     const o = he(i);
-    return e !== void 0 && Be(o, e), o;
+    return e !== void 0 && Fe(o, e), o;
   }
   /** `'Pos' (component 5)` when the component was registered with a debug
    * name, else `component 5` — the label diagnostics interpolate. */
@@ -4338,7 +4341,7 @@ class Ls {
    * through `registerSparseComponent`, which guards first. */
   _pushSparseStore(t, e, s) {
     const n = this.sparseStores.length;
-    return this.sparseStores.push(new Fe(t, e)), this.sparseNames.push(s), T(n);
+    return this.sparseStores.push(new $e(t, e)), this.sparseNames.push(s), T(n);
   }
   sparseStoreOf(t) {
     const e = t, s = this.sparseStores[e];
@@ -4716,7 +4719,7 @@ class Ls {
     let o = i;
     for (let d = 0; d < i; d++) {
       const f = e[d].def.id;
-      if (f >= zt - 1 || i > Ms) {
+      if (f >= zt - 1 || i > Ls) {
         o = mt;
         break;
       }
@@ -4940,9 +4943,9 @@ class Ls {
     for (let c = 0; c < n.length; c++) {
       let l = n[c];
       if (l === 0) continue;
-      const u = c << Qe;
+      const u = c << Ke;
       for (; l !== 0; ) {
-        const d = l & -l >>> 0, f = u + (Ye - Math.clz32(d));
+        const d = l & -l >>> 0, f = u + (Qe - Math.clz32(d));
         l ^= d;
         const g = this.archGraph.componentIndex[f];
         if (g === void 0 || g.length === 0) {
@@ -5022,7 +5025,7 @@ class Ls {
   // =======================================================
   // Resource storage — delegations to `ResourceRegistry` (resource_registry.ts)
   // =======================================================
-  resources = new ns();
+  resources = new rs();
   registerResource(t, e) {
     this.resources.register(t, e);
   }
@@ -5041,7 +5044,7 @@ class Ls {
     return this.resources.has(t);
   }
 }
-class Ns {
+class Bs {
   store;
   /** @internal constructed by `ECS`. */
   constructor(t) {
@@ -5115,7 +5118,7 @@ class Ns {
     return this.store.compactRelations();
   }
 }
-class Bs {
+class Fs {
   store;
   /** @internal constructed by `ECS`. */
   constructor(t) {
@@ -5149,7 +5152,7 @@ class Bs {
     return this.store.getEventReader(e);
   }
 }
-class Fs {
+class $s {
   store;
   /** @internal constructed by `ECS`. */
   constructor(t) {
@@ -5183,7 +5186,7 @@ class Fs {
     return this.store.hasResource(t);
   }
 }
-class $s {
+class Gs {
   store;
   /** @internal constructed by `ECS`. */
   constructor(t) {
@@ -5250,7 +5253,7 @@ function At(a, t) {
   const s = Object.create(e);
   return s._row = t, s;
 }
-class Gs {
+class Ps {
   // 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.
@@ -5298,10 +5301,10 @@ class Gs {
   }
   /** Record a freshly minted query under its dedup key. */
   addDedup(t, e) {
-    de(this.dedup, t, e);
+    fe(this.dedup, t, e);
   }
 }
-const Yt = Object.freeze([]), Ps = Object.freeze([]), Qt = Object.freeze([]), Kt = Number.POSITIVE_INFINITY;
+const Yt = Object.freeze([]), Us = Object.freeze([]), Qt = Object.freeze([]), Kt = Number.POSITIVE_INFINITY;
 function X(a, t) {
   return (a << 16 | t) >>> 0;
 }
@@ -5310,7 +5313,7 @@ function rt(a, t) {
     if (a[e] === t) return a;
   return [...a, t];
 }
-function Us(a, t) {
+function Hs(a, t) {
   for (let e = 0; e < a.length; e++)
     if (a[e] === t) return a;
   return [...a, t];
@@ -5320,7 +5323,7 @@ function Xt(a, t) {
     if (a[e] === t) return a;
   return [...a, t];
 }
-class Hs {
+class Vs {
   /** @internal */
   _arch;
   /** @internal */
@@ -5404,7 +5407,7 @@ class F {
   // 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 = Yt, c = Yt, l = Ps, u = !1, d = Qt, f = Qt, g = null) {
+  constructor(t, e, s, n, r, i, o, h = Yt, c = Yt, l = Us, u = !1, d = Qt, f = Qt, g = 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 = g;
   }
   /** Guard the dense-only methods (`count` / `forEach` / `archetype_count`)
@@ -5797,7 +5800,7 @@ class F {
   _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(Us(this._optional, t));
+    const r = this._deriveOptional(Hs(this._optional, t));
     return s.set(e, r), r;
   }
   /** Build a derived query carrying new optional terms. Reuses this query's
@@ -5916,7 +5919,7 @@ class F {
    * column-group caches that actually matter for allocation live on the
    * `Archetype`, untouched. */
   _eachChunkInner(t) {
-    const e = new Hs();
+    const e = new Vs();
     e._tick = this._resolver._getCurrentTick();
     const s = this._nonEmpty();
     for (let n = 0; n < s.length; n++)
@@ -6091,7 +6094,7 @@ class F {
     return this._resolver._getLastRunTick();
   }
 }
-class Vs {
+class qs {
   constructor(t) {
     this._resolver = t;
   }
@@ -6101,7 +6104,7 @@ class Vs {
     return this._resolver._resolveQuery(e, null, null, t);
   }
 }
-class qs {
+class js {
   constructor(t) {
     this.store = t;
   }
@@ -6154,9 +6157,9 @@ class qs {
     return this.store.enableEntityDeferred(t), this;
   }
 }
-class js {
+class zs {
   constructor(t) {
-    this.store = t, this.commands = new qs(t);
+    this.store = t, this.commands = new js(t);
   }
   lastRunTick = 0;
   /** Deferred structural-command facade (§ctx.commands). */
@@ -6453,7 +6456,7 @@ function Zt(a) {
     );
   return a;
 }
-function zs(a) {
+function Ws(a) {
   if (!Number.isInteger(a) || a < 1)
     throw new v(
       b.INVALID_MAX_FIXED_STEPS,
@@ -6461,7 +6464,7 @@ function zs(a) {
     );
   return a;
 }
-class sn {
+class nn {
   store;
   schedule;
   ctx;
@@ -6503,7 +6506,7 @@ class sn {
   // 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 Gs();
+  _caches = new Ps();
   // --- 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
@@ -6536,8 +6539,8 @@ class sn {
         b.INVALID_MEMORY_OPTIONS,
         "ECSOptions.initial_capacity / buffer_allocator were replaced by ECSOptions.memory: initial_capacity → memory.columnCapacity (or memory.budget); buffer_allocator → memory.wasm (WASM-backed) or memory.allocator (custom in-place)."
       );
-    const s = Ue(t?.memory);
-    this._memory = s, this.store = new Ls({
+    const s = He(t?.memory);
+    this._memory = s, this.store = new Ns({
       initialCapacity: s.columnCapacity,
       bufferAllocator: s.allocator,
       entityIndexCapacity: s.entityIndexCapacity,
@@ -6554,10 +6557,10 @@ class sn {
       regions: t?.regions,
       bindingsRegionBytes: t?.bindingsRegionBytes,
       deterministic: t?.deterministic
-    }), this.schedule = new He(t?.onWarn), this.relations = new Ns(this.store), this.events = new Bs(this.store), this.resources = new Fs(this.store), this.snapshots = new $s(this.store), this.ctx = new js(this.store), this._observers = new us(this.store, this.ctx), this.store.setStructuralObserverHook((n) => this._observers.dispatchStructural(n)), this._fixedTimestep = Zt(
-      t?.fixedTimestep ?? Ve
-    ), this._maxFixedSteps = zs(
-      t?.maxFixedSteps ?? qe
+    }), this.schedule = new Ve(t?.onWarn), this.relations = new Bs(this.store), this.events = new Fs(this.store), this.resources = new $s(this.store), this.snapshots = new Gs(this.store), this.ctx = new zs(this.store), this._observers = new ds(this.store, this.ctx), this.store.setStructuralObserverHook((n) => this._observers.dispatchStructural(n)), this._fixedTimestep = Zt(
+      t?.fixedTimestep ?? qe
+    ), this._maxFixedSteps = Ws(
+      t?.maxFixedSteps ?? je
     );
   }
   /** Batch variant of `regionHandle` for hosts wiring several consumer
@@ -6864,7 +6867,7 @@ class sn {
   }
   /** 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, je) ^ Math.imul(o, ze) | 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, ze) ^ Math.imul(o, We) | 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 F(
       l,
@@ -6889,7 +6892,7 @@ class sn {
     let s;
     if (typeof t == "function")
       if (e !== void 0) {
-        const i = e(new Vs(this)), o = this.ctx, h = t;
+        const i = e(new qs(this)), o = this.ctx, h = t;
         s = { ...St, fn: (c, l) => h(i, o, l) };
       } else
         s = { ...St, fn: t };
@@ -6897,7 +6900,7 @@ class sn {
       s = t;
     const n = ae(this.nextSystemId++), r = Object.freeze({
       ...s,
-      ...is(s),
+      ...os(s),
       id: n
     });
     return this.systems.add(r), r;
@@ -6943,7 +6946,7 @@ class sn {
    * `private` because the only caller is `startup()`; visible to tests via
    * the `archetype_count` delta on the public ECS facade. */
   prewarmArchetypes() {
-    const t = Ws([...this.systems, ...this._observers.descriptors()]);
+    const t = Ys([...this.systems, ...this._observers.descriptors()]);
     t.length !== 0 && this.store.archCreateManyFromMasks(t);
   }
   /**
@@ -7192,7 +7195,7 @@ class sn {
   }
   // === END STORE PASS-THROUGH BAND ===
 }
-function Ws(a) {
+function Ys(a) {
   const t = /* @__PURE__ */ new Map(), e = [], s = (o) => {
     const h = o.hash(), c = t.get(h);
     if (c !== void 0) {
@@ -7240,21 +7243,21 @@ function Ws(a) {
   for (const o of t.values()) for (let h = 0; h < o.length; h++) i.push(o[h]);
   return i;
 }
-function nn(a, t) {
+function rn(a, t) {
   return {
     name: `runIfResourceEq(${a.description ?? "?"})`,
     resourceReads: [a],
     evaluate: (e) => e.getResource(a) === t
   };
 }
-function rn(a, t = 0) {
+function on(a, t = 0) {
   const e = (t % a + a) % a;
   return {
     name: `runEveryNTicks(${a}${e !== 0 ? `, +${e}` : ""})`,
     evaluate: (s) => (s.ecsTick - e) % a === 0
   };
 }
-function on(a) {
+function hn(a) {
   return {
     name: "runIfAnyMatch",
     reads: a._defs,
@@ -7270,31 +7273,31 @@ function xt(a) {
     ...e.length > 0 ? { resourceReads: e } : {}
   };
 }
-function hn(a) {
+function an(a) {
   return {
     name: `not(${a.name})`,
     ...xt([a]),
     evaluate: (t) => !a.evaluate(t)
   };
 }
-function an(...a) {
+function cn(...a) {
   return {
     name: `allOf(${a.map((t) => t.name).join(", ")})`,
     ...xt(a),
     evaluate: (t) => a.every((e) => e.evaluate(t))
   };
 }
-function cn(...a) {
+function ln(...a) {
   return {
     name: `anyOf(${a.map((t) => t.name).join(", ")})`,
     ...xt(a),
     evaluate: (t) => a.some((e) => e.evaluate(t))
   };
 }
-function Ys(a) {
+function Qs(a) {
   return a.kind === "spawn" && a.onSpawned !== void 0 ? { kind: "spawn", components: a.components } : a;
 }
-class ln {
+class un {
   /** Session seed, echoed into the produced {@link CommandLog}. */
   seed;
   _startup = [];
@@ -7315,7 +7318,7 @@ class ln {
     this._ticks.push({ tick: t, dt: e, commands: n }), this.sink = n;
   }
   record = (t) => {
-    this.sink.push(Ys(t));
+    this.sink.push(Qs(t));
   };
   /** A live {@link CommandLog} view over the accumulated stream — not a copy.
    * Serialize it (which deep-copies through JSON) before mutating the world
@@ -7334,7 +7337,7 @@ class ln {
   }
 }
 const Z = "__component_def";
-function un(a) {
+function dn(a) {
   return JSON.stringify(a, (t, e) => {
     if (typeof e == "function" && "id" in e)
       return { [Z]: e.id };
@@ -7346,10 +7349,10 @@ function un(a) {
     return e;
   });
 }
-function dn(a) {
+function fn(a) {
   return JSON.parse(a, (t, e) => e !== null && typeof e == "object" && Z in e ? he(oe(e[Z])) : e);
 }
-function fn(a, t, e, s) {
+function pn(a, t, e, s) {
   for (const i of e.startup) t.push(i);
   a.startup();
   const n = s?.hash ?? a.snapshots.deterministic, r = [];
@@ -7362,7 +7365,7 @@ function fn(a, t, e, s) {
 function wt(a) {
   return a.name ?? `system#${a.id}`;
 }
-class pn {
+class _n {
   _frames = [];
   _current = null;
   tickBegin(t, e) {
@@ -7427,7 +7430,7 @@ function G(a, t) {
     );
   return t;
 }
-function Qs(a) {
+function Ks(a) {
   if (!Number.isInteger(a) || a < 0)
     throw new v(
       b.INVALID_FRAME_STEP,
@@ -7435,7 +7438,7 @@ function Qs(a) {
     );
   return a;
 }
-class _n {
+class gn {
   ecs;
   requestFrame;
   cancelFrame;
@@ -7470,7 +7473,7 @@ class _n {
   }
   /** Advance several fixed-size frames, useful for replaying a paused sim. */
   stepFrames(t, e = this._fixedDt) {
-    Qs(t);
+    Ks(t);
     const s = G("dt", e);
     for (let n = 0; n < t; n++) this.ecs.update(s);
   }
@@ -7504,65 +7507,65 @@ class _n {
     this.lastTimestampMs = t, this.ecs.update(Math.min(G("dt", e), this._maxDt)), this.running && this.scheduleNextFrame();
   };
 }
-function gn(a, t) {
+function yn(a, t) {
   return a.relations.register({
     exclusive: !0,
     onDeleteTarget: t?.onDeleteTarget ?? "clear"
   });
 }
-function yn(a, t) {
+function mn(a, t) {
   return a.relations.register({
     exclusive: !0,
     onDeleteTarget: t?.onDeleteTarget ?? "delete"
   });
 }
-function mn(a) {
+function wn(a) {
   return T(Symbol(a));
 }
-const wn = "0.5.2";
+const En = "0.5.3";
 export {
-  bn as ANY_RELATION,
+  Cn as ANY_RELATION,
   U as ChangedQuery,
-  Hs as ChunkColumns,
-  qs as Commands,
-  sn as ECS,
+  Vs as ChunkColumns,
+  js as Commands,
+  nn as ECS,
   v as ECSError,
   k as ECSRestoreError,
   b as ECS_ERROR,
   It as ECS_SNAPSHOT_VERSION,
-  _n as FrameStepper,
-  pn as FrameTraceRecorder,
+  gn as FrameStepper,
+  _n as FrameTraceRecorder,
   Kt as HIERARCHY_UNBOUNDED,
-  Cn as HostCommandQueue,
-  ln as HostCommandRecorder,
+  Sn as HostCommandQueue,
+  un as HostCommandRecorder,
   F as Query,
-  Vs as QueryBuilder,
-  Sn as SCHEDULE,
-  xn as SabUnavailableError,
+  qs as QueryBuilder,
+  Rn as SCHEDULE,
+  Mn as SabUnavailableError,
   et as SparseRestoreError,
   Q as StoreRestoreError,
-  js as SystemContext,
-  wn as VERSION,
-  an as allOf,
-  cn as anyOf,
-  Rn as applyHostCommand,
-  Js as bundle,
-  dn as deserializeCommandLog,
-  tn as eventKey,
+  zs as SystemContext,
+  En as VERSION,
+  cn as allOf,
+  ln as anyOf,
+  In as applyHostCommand,
+  tn as bundle,
+  fn as deserializeCommandLog,
+  en as eventKey,
   w as getEntityIndex,
-  In as installHostCommandSeam,
-  An as isEcsError,
-  hn as not,
-  yn as registerChildOf,
-  gn as registerIsA,
-  fn as replayCommandLog,
-  mn as resourceKey,
-  rn as runEveryNTicks,
-  on as runIfAnyMatch,
-  nn as runIfResourceEq,
-  un as serializeCommandLog,
-  en as signalKey,
-  On as spawnEntry,
-  kn as systemSet,
-  Tn as uninstallHostCommandSeam
+  An as installHostCommandSeam,
+  On as isEcsError,
+  an as not,
+  mn as registerChildOf,
+  yn as registerIsA,
+  pn as replayCommandLog,
+  wn as resourceKey,
+  on as runEveryNTicks,
+  hn as runIfAnyMatch,
+  rn as runIfResourceEq,
+  dn as serializeCommandLog,
+  sn as signalKey,
+  kn as spawnEntry,
+  Tn as systemSet,
+  Dn as uninstallHostCommandSeam
 };