@oasys/oecs 0.5.4 → 0.6.0

package/dist/internal-BoxWl4dG.js

@@ -1,2565 +0,0 @@
-import { D as st, h as j, w as Ne, g as rt } from "./shared-B4v0L1cw.js";
-import { S as ot, t as it } from "./topological_sort-DK6EjpWa.js";
-class Ye extends Error {
-  constructor(e, n, r) {
-    super(e), this.isOperational = n, this.context = r, this.name = this.constructor.name, Error.captureStackTrace(this, this.constructor);
-  }
-}
-var me = /* @__PURE__ */ ((t) => (t.ASSERTION_FAIL_CONDITION = "ASSERTION_FAIL_CONDITION", t.VALIDATION_FAIL_CONDITION = "VALIDATION_FAIL_CONDITION", t.ASSERTION_FAIL_NON_NULLABLE = "ASSERTION_FAIL_NON_NULLABLE", t.ASSERTION_FAIL_UNREACHABLE = "ASSERTION_FAIL_UNREACHABLE", t))(me || {});
-class Ve extends Ye {
-  constructor(e, n, r) {
-    super(n, !1, r), this.category = e;
-  }
-}
-const Rn = (t) => Number.isInteger(t) && t >= 0;
-function Dn(t, e, n) {
-  if (!e(t))
-    throw new Ve(
-      me.VALIDATION_FAIL_CONDITION,
-      `Expected value to meet validation: ${n}`
-    );
-  return t;
-}
-function On(t) {
-  return t;
-}
-function at(t, e) {
-  throw new Ve(
-    me.ASSERTION_FAIL_UNREACHABLE,
-    `Unhandled ${e}: ${String(t)}`
-  );
-}
-var y = /* @__PURE__ */ ((t) => (t.EID_MAX_INDEX_OVERFLOW = "EID_MAX_INDEX_OVERFLOW", t.EID_MAX_GEN_OVERFLOW = "EID_MAX_GEN_OVERFLOW", t.COMPONENT_NOT_REGISTERED = "COMPONENT_NOT_REGISTERED", t.COMPONENT_LIMIT_EXCEEDED = "COMPONENT_LIMIT_EXCEEDED", t.ENTITY_NOT_ALIVE = "ENTITY_NOT_ALIVE", t.CIRCULAR_SYSTEM_DEPENDENCY = "CIRCULAR_SYSTEM_DEPENDENCY", t.DUPLICATE_SYSTEM = "DUPLICATE_SYSTEM", t.ARCHETYPE_NOT_FOUND = "ARCHETYPE_NOT_FOUND", t.RESOURCE_NOT_REGISTERED = "RESOURCE_NOT_REGISTERED", t.RESOURCE_ALREADY_REGISTERED = "RESOURCE_ALREADY_REGISTERED", t.EVENT_ALREADY_REGISTERED = "EVENT_ALREADY_REGISTERED", t.EVENT_NOT_REGISTERED = "EVENT_NOT_REGISTERED", t.FIELD_NOT_REGISTERED = "FIELD_NOT_REGISTERED", t.RELATION_NOT_REGISTERED = "RELATION_NOT_REGISTERED", t.RELATION_MODE_INVALID = "RELATION_MODE_INVALID", t.RELATION_MODE_MISMATCH = "RELATION_MODE_MISMATCH", t.RELATION_CYCLE = "RELATION_CYCLE", t.SPARSE_CACHE_KEY_OVERFLOW = "SPARSE_CACHE_KEY_OVERFLOW", t.SPARSE_QUERY_DENSE_PATH = "SPARSE_QUERY_DENSE_PATH", t.HIERARCHY_ALREADY_SET = "HIERARCHY_ALREADY_SET", t.HIERARCHY_INVALID_MAX_DEPTH = "HIERARCHY_INVALID_MAX_DEPTH", t.OBSERVER_NON_CONVERGENT = "OBSERVER_NON_CONVERGENT", t.OBSERVER_INVALID_CONFIG = "OBSERVER_INVALID_CONFIG", t.OBSERVER_ONSET_EMIT = "OBSERVER_ONSET_EMIT", t.INVALID_FIXED_TIMESTEP = "INVALID_FIXED_TIMESTEP", t.INVALID_MAX_FIXED_STEPS = "INVALID_MAX_FIXED_STEPS", t.INVALID_RECORDER_SCHEDULE = "INVALID_RECORDER_SCHEDULE", t.EMPTY_ARCHETYPE_MATERIALIZE = "EMPTY_ARCHETYPE_MATERIALIZE", t.COMPONENT_INDEX_INVARIANT = "COMPONENT_INDEX_INVARIANT", t.ARCHETYPE_ROW_INVARIANT = "ARCHETYPE_ROW_INVARIANT", t.OPTIONAL_TERM_NOT_DECLARED = "OPTIONAL_TERM_NOT_DECLARED", t.QUERY_ACCESS_UNDECLARED = "QUERY_ACCESS_UNDECLARED", t.ACCESS_UNDECLARED = "ACCESS_UNDECLARED", t.QUERY_NOT_SINGLETON = "QUERY_NOT_SINGLETON", t.INVALID_RUN_CONDITION = "INVALID_RUN_CONDITION", t.SYSTEM_FN_ARITY = "SYSTEM_FN_ARITY", t.PARTITION_APPEND_NEEDS_ENTITY_ROW = "PARTITION_APPEND_NEEDS_ENTITY_ROW", t.PARTITION_BULK_INTO_DISABLED = "PARTITION_BULK_INTO_DISABLED", t.ENTITY_NOT_DISABLED = "ENTITY_NOT_DISABLED", t.STRUCTURAL_DURING_ITERATION = "STRUCTURAL_DURING_ITERATION", t.BACKEND_ALREADY_ATTACHED = "BACKEND_ALREADY_ATTACHED", t.DETERMINISM_DISABLED = "DETERMINISM_DISABLED", t.NON_DETERMINISTIC_COLUMN_TYPE = "NON_DETERMINISTIC_COLUMN_TYPE", t.INVALID_MEMORY_OPTIONS = "INVALID_MEMORY_OPTIONS", t.STORE_CAP_EXCEEDED = "STORE_CAP_EXCEEDED", t.REGION_NOT_DECLARED = "REGION_NOT_DECLARED", t.COMMAND_LOG_TAG_COLLISION = "COMMAND_LOG_TAG_COLLISION", t.INVALID_FRAME_STEP = "INVALID_FRAME_STEP", t))(y || {});
-class T extends Ye {
-  constructor(e, n, r) {
-    super(n ?? e, !0, r), this.category = e;
-  }
-}
-function Cn(t) {
-  return t instanceof T;
-}
-const bn = -1, vn = -1, Un = Object.freeze(/* @__PURE__ */ Object.create(null)), Ln = 2654435769, Mn = 1367130551, F = 1024, $n = 0, ct = 31, Pn = 1 / 60, xn = 4, dt = 0, z = 20, He = (1 << z) - 1, $ = He, lt = ct - z, oe = (1 << lt) - 1, Bn = oe, Fn = oe - 1, Re = oe << z | $, kn = (t, e) => {
-  {
-    if (t < 0 || t > $)
-      throw new T(y.EID_MAX_INDEX_OVERFLOW);
-    if (e < 0 || e > oe)
-      throw new T(y.EID_MAX_GEN_OVERFLOW);
-  }
-  return e << z | t;
-}, L = (t) => t & He, De = (t) => t >> z, Yn = (t, e, n) => new T(
-  y.ENTITY_NOT_ALIVE,
-  `${t}: entity ${e} (index ${L(e)}, generation ${De(
-    e
-  )}) is not alive${n ? ` — ${n}` : ""} (destroyed, never created, or a stale handle; guard with isAlive() first)`,
-  { entity: e, index: L(e), generation: De(e), op: t }
-), ge = /* @__PURE__ */ new WeakMap();
-function Vn(t, e) {
-  ge.set(t, e);
-}
-function Hn(t) {
-  return ge.get(t);
-}
-function ut(t) {
-  const e = ge.get(t);
-  return e !== void 0 ? `'${e}' (component ${t.id})` : `component ${t.id}`;
-}
-const ft = 827148627, ht = 0, ee = 4, _t = 52, m = {
-  magic: 0,
-  sim_abi_version: 4,
-  view_stamp: 8,
-  capacity: 12,
-  archetype_count: 16,
-  layout_descriptor_off: 20,
-  command_ring_off: 24,
-  action_ring_off: 28,
-  entity_index_off: 32,
-  event_ring_off: 36,
-  region_table_off: 40,
-  region_table_count: 44,
-  bindings_off: 48
-}, q = 12, M = {
-  region_id: 0,
-  byte_offset: 4,
-  byte_length: 8
-}, Ee = 16, O = {
-  component_id: 0,
-  field_id: 2,
-  type_tag: 4,
-  byte_off: 8,
-  stride: 12
-}, pe = 36, N = {
-  archetype_id: 0,
-  component_mask: 4,
-  row_count: 20,
-  row_capacity: 24,
-  column_count: 28,
-  enabled_count: 32
-};
-function mt(t, e) {
-  t.setUint32(m.magic, e.magic, !0), t.setUint32(m.sim_abi_version, e.simAbiVersion, !0), t.setUint32(m.view_stamp, e.viewStamp, !0), t.setUint32(m.capacity, e.capacity, !0), t.setUint32(m.archetype_count, e.archetypeCount, !0), t.setUint32(m.layout_descriptor_off, e.layoutDescriptorOff, !0), t.setUint32(m.command_ring_off, e.commandRingOff, !0), t.setUint32(m.action_ring_off, e.actionRingOff, !0), t.setUint32(m.entity_index_off, e.entityIndexOff, !0), t.setUint32(m.event_ring_off, e.eventRingOff, !0), t.setUint32(m.region_table_off, e.regionTableOff, !0), t.setUint32(m.region_table_count, e.regionTableCount, !0), t.setUint32(m.bindings_off, e.bindingsOff, !0);
-}
-function Gn(t) {
-  return {
-    magic: t.getUint32(m.magic, !0),
-    simAbiVersion: t.getUint32(m.sim_abi_version, !0),
-    viewStamp: t.getUint32(m.view_stamp, !0),
-    capacity: t.getUint32(m.capacity, !0),
-    archetypeCount: t.getUint32(m.archetype_count, !0),
-    layoutDescriptorOff: t.getUint32(m.layout_descriptor_off, !0),
-    commandRingOff: t.getUint32(m.command_ring_off, !0),
-    actionRingOff: t.getUint32(m.action_ring_off, !0),
-    entityIndexOff: t.getUint32(m.entity_index_off, !0),
-    eventRingOff: t.getUint32(m.event_ring_off, !0),
-    regionTableOff: t.getUint32(m.region_table_off, !0),
-    regionTableCount: t.getUint32(m.region_table_count, !0),
-    bindingsOff: t.getUint32(m.bindings_off, !0)
-  };
-}
-const E = {
-  u8: 0,
-  i8: 1,
-  u16: 2,
-  i16: 3,
-  u32: 4,
-  i32: 5,
-  f32: 6,
-  f64: 7
-}, Oe = Object.freeze({
-  [E.u8]: 1,
-  [E.i8]: 1,
-  [E.u16]: 2,
-  [E.i16]: 2,
-  [E.u32]: 4,
-  [E.i32]: 4,
-  [E.f32]: 4,
-  [E.f64]: 8
-}), Wn = {
-  u8: E.u8,
-  i8: E.i8,
-  u16: E.u16,
-  i16: E.i16,
-  u32: E.u32,
-  i32: E.i32,
-  f32: E.f32,
-  f64: E.f64
-};
-function gt(t, e, n) {
-  t.setUint16(e + O.component_id, n.componentId, !0), t.setUint16(e + O.field_id, n.fieldId, !0), t.setUint8(e + O.type_tag, n.typeTag), t.setUint32(e + O.byte_off, n.byteOff, !0), t.setUint16(e + O.stride, n.stride, !0);
-}
-function Et(t, e) {
-  return {
-    componentId: t.getUint16(e + O.component_id, !0),
-    fieldId: t.getUint16(e + O.field_id, !0),
-    typeTag: t.getUint8(e + O.type_tag),
-    byteOff: t.getUint32(e + O.byte_off, !0),
-    stride: t.getUint16(e + O.stride, !0)
-  };
-}
-const Xn = ee * 32;
-function Ge(t) {
-  return pe + t * Ee;
-}
-function pt(t, e, n) {
-  t.setUint32(e + N.archetype_id, n.archetypeId, !0);
-  for (let s = 0; s < ee; s++)
-    t.setUint32(
-      e + N.component_mask + s * 4,
-      n.componentMask[s] ?? 0,
-      !0
-    );
-  t.setUint32(e + N.row_count, n.rowCount, !0), t.setUint32(e + N.row_capacity, n.rowCapacity, !0), t.setUint32(e + N.column_count, n.columns.length, !0), t.setUint32(e + N.enabled_count, n.enabledCount, !0);
-  let r = e + pe;
-  for (let s = 0; s < n.columns.length; s++)
-    gt(t, r, n.columns[s]), r += Ee;
-  return r;
-}
-function yt(t, e) {
-  const n = t.getUint32(e + N.column_count, !0), r = new Array(n);
-  let s = e + pe;
-  for (let i = 0; i < n; i++)
-    r[i] = Et(t, s), s += Ee;
-  const o = new Array(ee);
-  for (let i = 0; i < ee; i++)
-    o[i] = t.getUint32(
-      e + N.component_mask + i * 4,
-      !0
-    );
-  return {
-    archetypeId: t.getUint32(e + N.archetype_id, !0),
-    componentMask: o,
-    rowCount: t.getUint32(e + N.row_count, !0),
-    rowCapacity: t.getUint32(e + N.row_capacity, !0),
-    enabledCount: t.getUint32(e + N.enabled_count, !0),
-    columns: r
-  };
-}
-function Tt(t, e, n) {
-  let r = e;
-  for (let s = 0; s < n.length; s++)
-    r = pt(t, r, n[s]);
-  return r;
-}
-function zn(t, e, n) {
-  const r = new Array(n);
-  let s = e;
-  for (let o = 0; o < n; o++) {
-    const i = yt(t, s);
-    r[o] = i, s += Ge(i.columns.length);
-  }
-  return r;
-}
-function At(t) {
-  let e = 0;
-  for (let n = 0; n < t.length; n++)
-    e += Ge(t[n].columns.length);
-  return e;
-}
-const We = 16, P = 16, qn = 256, C = {
-  write_head: 0,
-  read_head: 4,
-  capacity_slots: 8,
-  overflow_flag: 12
-}, ye = 0;
-function Ce(t) {
-  return We + t * P;
-}
-function It(t) {
-  return t > 0 && (t & t - 1) === 0;
-}
-class v extends Error {
-  constructor(e) {
-    super(e), this.name = "CommandRingError";
-  }
-}
-function wt(t, e, n) {
-  if (!It(n))
-    throw new v(
-      `command ring capacity_slots must be a positive power of two (got ${n})`
-    );
-  t.setUint32(e + C.write_head, 0, !0), t.setUint32(e + C.read_head, 0, !0), t.setUint32(e + C.capacity_slots, n, !0), t.setUint32(e + C.overflow_flag, 0, !0);
-}
-function St(t, e) {
-  return t.getUint32(e + C.write_head, !0);
-}
-function Nt(t, e) {
-  return t.getUint32(e + C.read_head, !0);
-}
-function Rt(t, e) {
-  return t.getUint32(e + C.capacity_slots, !0);
-}
-function Dt(t, e, n) {
-  if (n.byteLength !== P - 1)
-    throw new v(
-      `outPayload must be ${P - 1} bytes (got ${n.byteLength})`
-    );
-  const r = St(t, e), s = Nt(t, e);
-  if (r === s) return ye;
-  const o = Rt(t, e), i = s & o - 1, a = e + We + i * P, c = t.getUint8(a), d = new Uint8Array(t.buffer, a + 1, P - 1);
-  return n.set(d), t.setUint32(e + C.read_head, s + 1 >>> 0, !0), c;
-}
-function Ot(t, e, n) {
-  let r = 0;
-  const s = new Uint8Array(P - 1);
-  for (; ; ) {
-    const o = Dt(t, e, s);
-    if (o === ye) return r;
-    n(o, s.slice()), r++;
-  }
-}
-const ie = 16, R = 12, te = {
-  length: 0,
-  capacity: 4
-  // 8..16: pad to 16-byte alignment so the i32 arrays start aligned.
-}, U = 1 << 20;
-function be(t) {
-  if (t < 0 || !Number.isInteger(t))
-    throw new Xe(
-      `entity index capacity must be a non-negative integer (got ${t})`
-    );
-  return ie + t * R;
-}
-function Ct(t) {
-  return t + ie;
-}
-function bt(t, e) {
-  return t + ie + e * 4;
-}
-function vt(t, e) {
-  return t + ie + e * 8;
-}
-class Xe extends Error {
-  constructor(e) {
-    super(e), this.name = "EntityIndexError";
-  }
-}
-function Ut(t, e, n) {
-  if (n < 0 || !Number.isInteger(n))
-    throw new Xe(
-      `entity index capacity must be a non-negative integer (got ${n})`
-    );
-  t.setUint32(e + te.length, 0, !0), t.setUint32(e + te.capacity, n, !0);
-}
-function jn(t, e, n) {
-  return {
-    generations: new Int32Array(t, Ct(e), n),
-    archetypes: new Int32Array(t, bt(e, n), n),
-    rows: new Int32Array(t, vt(e, n), n)
-  };
-}
-const Lt = 16, Mt = 16, Kn = 256, Y = {
-  write_head: 0,
-  read_head: 4,
-  capacity_slots: 8,
-  overflow_flag: 12
-};
-function ve(t) {
-  return Lt + t * Mt;
-}
-function $t(t) {
-  return t > 0 && (t & t - 1) === 0;
-}
-class Pt extends Error {
-  constructor(e) {
-    super(e), this.name = "EventRingError";
-  }
-}
-function xt(t, e, n) {
-  if (!$t(n))
-    throw new Pt(
-      `event ring capacity_slots must be a positive power of two (got ${n})`
-    );
-  t.setUint32(e + Y.write_head, 0, !0), t.setUint32(e + Y.read_head, 0, !0), t.setUint32(e + Y.capacity_slots, n, !0), t.setUint32(e + Y.overflow_flag, 0, !0);
-}
-const Bt = 16, Ft = 16, Qn = 256, V = {
-  write_head: 0,
-  read_head: 4,
-  capacity_slots: 8,
-  overflow_flag: 12
-}, kt = V.write_head / 4, Yt = V.read_head / 4, Vt = V.capacity_slots / 4, Ht = V.overflow_flag / 4;
-function Gt(t, e) {
-  return new Int32Array(t.buffer, t.byteOffset + e, 4);
-}
-function Ue(t) {
-  return Bt + t * Ft;
-}
-function Wt(t) {
-  return t > 0 && (t & t - 1) === 0;
-}
-class Le extends Error {
-  constructor(e) {
-    super(e), this.name = "ActionRingError";
-  }
-}
-function Xt(t, e, n) {
-  if (!Wt(n))
-    throw new Le(
-      `action ring capacity_slots must be a positive power of two (got ${n})`
-    );
-  if ((t.byteOffset + e) % 4 !== 0)
-    throw new Le(
-      `action ring header must be 4-byte aligned for Atomics (view.byteOffset ${t.byteOffset} + ringOff ${e} is not a multiple of 4)`
-    );
-  const r = Gt(t, e);
-  Atomics.store(r, kt, 0), Atomics.store(r, Yt, 0), Atomics.store(r, Vt, n), Atomics.store(r, Ht, 0);
-}
-const K = [
-  {
-    name: "command_ring",
-    headerOff: "command_ring_off",
-    sizeFromOptions: (t) => t.commandRingCapacitySlots !== void 0 ? Ce(t.commandRingCapacitySlots) : 0,
-    init: (t, e, n) => wt(t, e, n.commandRingCapacitySlots),
-    regionBytes: (t, e) => Ce(t.getUint32(e + C.capacity_slots, !0)),
-    readOptions: (t, e, n) => {
-      n.commandRingCapacitySlots = t.getUint32(
-        e + C.capacity_slots,
-        !0
-      );
-    }
-  },
-  {
-    name: "entity_index",
-    headerOff: "entity_index_off",
-    sizeFromOptions: (t) => t.entityIndexCapacity !== void 0 ? be(t.entityIndexCapacity) : 0,
-    init: (t, e, n) => Ut(t, e, n.entityIndexCapacity),
-    regionBytes: (t, e) => be(t.getUint32(e + te.capacity, !0)),
-    readOptions: (t, e, n) => {
-      n.entityIndexCapacity = t.getUint32(e + te.capacity, !0);
-    }
-  },
-  {
-    name: "event_ring",
-    headerOff: "event_ring_off",
-    sizeFromOptions: (t) => t.eventRingCapacitySlots !== void 0 ? ve(t.eventRingCapacitySlots) : 0,
-    init: (t, e, n) => xt(t, e, n.eventRingCapacitySlots),
-    regionBytes: (t, e) => ve(t.getUint32(e + Y.capacity_slots, !0)),
-    readOptions: (t, e, n) => {
-      n.eventRingCapacitySlots = t.getUint32(
-        e + Y.capacity_slots,
-        !0
-      );
-    }
-  },
-  {
-    name: "action_ring",
-    headerOff: "action_ring_off",
-    sizeFromOptions: (t) => t.actionRingCapacitySlots !== void 0 ? Ue(t.actionRingCapacitySlots) : 0,
-    init: (t, e, n) => Xt(t, e, n.actionRingCapacitySlots),
-    regionBytes: (t, e) => Ue(t.getUint32(e + V.capacity_slots, !0)),
-    readOptions: (t, e, n) => {
-      n.actionRingCapacitySlots = t.getUint32(
-        e + V.capacity_slots,
-        !0
-      );
-    }
-  }
-];
-class J extends Error {
-  constructor(e) {
-    super(e), this.name = "RegionRegistryError";
-  }
-}
-function ze(t) {
-  return t * q;
-}
-function Te(t, e) {
-  const n = t.getUint32(m.region_table_count, !0);
-  if (e + ze(n) > t.byteLength)
-    throw new J(
-      `region table of ${n} entries at byte ${e} overruns the buffer (${t.byteLength} bytes)`
-    );
-  return n;
-}
-function zt(t) {
-  const e = /* @__PURE__ */ new Set();
-  for (let n = 0; n < t.length; n++) {
-    const r = t[n];
-    if (!Number.isInteger(r.id) || r.id <= 0)
-      throw new J(
-        `region "${r.name}" has invalid id ${r.id} — region ids must be positive integers (0 is the absent sentinel)`
-      );
-    if (e.has(r.id))
-      throw new J(
-        `duplicate region id ${r.id} (region "${r.name}") — ids must be distinct within a consumer's region set`
-      );
-    if (e.add(r.id), !Number.isInteger(r.bytes) || r.bytes <= 0)
-      throw new J(
-        `region "${r.name}" (id ${r.id}) has invalid byte size ${r.bytes} — must be a positive integer`
-      );
-  }
-}
-function qt(t, e, n) {
-  t.setUint32(e + M.region_id, n.regionId, !0), t.setUint32(e + M.byte_offset, n.byteOffset, !0), t.setUint32(e + M.byte_length, n.byteLength, !0);
-}
-function qe(t, e) {
-  return {
-    regionId: t.getUint32(e + M.region_id, !0),
-    byteOffset: t.getUint32(e + M.byte_offset, !0),
-    byteLength: t.getUint32(e + M.byte_length, !0)
-  };
-}
-function jt(t, e, n) {
-  for (let r = 0; r < n.length; r++)
-    qt(t, e + r * q, n[r]);
-}
-function Kt(t, e, n) {
-  const r = new Array(n);
-  for (let s = 0; s < n; s++)
-    r[s] = qe(t, e + s * q);
-  return r;
-}
-function Zn(t) {
-  const e = t.getUint32(m.region_table_off, !0);
-  if (e === 0) return [];
-  const n = Te(t, e);
-  return Kt(t, e, n);
-}
-function Jn(t, e) {
-  const n = t.getUint32(m.region_table_off, !0);
-  if (n === 0) return 0;
-  const r = Te(t, n);
-  for (let s = 0; s < r; s++) {
-    const o = n + s * q;
-    if (t.getUint32(o + M.region_id, !0) === e)
-      return t.getUint32(o + M.byte_offset, !0);
-  }
-  return 0;
-}
-function es(t, e) {
-  const n = t.getUint32(m.region_table_off, !0);
-  if (n === 0) return null;
-  const r = Te(t, n);
-  for (let s = 0; s < r; s++) {
-    const o = qe(t, n + s * q);
-    if (o.regionId === e) return o;
-  }
-  return null;
-}
-function Qt(t, e) {
-  return t << 16 | e;
-}
-const Ae = 2 ** 31;
-class je extends Error {
-  constructor(e) {
-    super(
-      `SAB column layout offset ${e} reaches or exceeds the 2³¹ (${Ae}-byte) ceiling. Past 2 GiB the signed-32-bit bitwise alignment math wraps to negative/misaligned offsets. This is a structural limit independent of the (default 256 MiB) allocator cap — a single SAB cannot back more than ~2 GiB of column data.`
-    ), this.name = "StoreLayoutOverflowError";
-  }
-}
-function Ke(t, e) {
-  if (t + e > Ae)
-    throw new je(t);
-  return t + (e - 1) & ~(e - 1);
-}
-function Zt(t, e, n, r) {
-  switch (e) {
-    case E.u8:
-      return new Uint8Array(t, n, r);
-    case E.i8:
-      return new Int8Array(t, n, r);
-    case E.u16:
-      return new Uint16Array(t, n, r);
-    case E.i16:
-      return new Int16Array(t, n, r);
-    case E.u32:
-      return new Uint32Array(t, n, r);
-    case E.i32:
-      return new Int32Array(t, n, r);
-    case E.f32:
-      return new Float32Array(t, n, r);
-    case E.f64:
-      return new Float64Array(t, n, r);
-  }
-}
-function Jt(t, e, n = 0) {
-  const s = At(
-    t.map((a) => ({
-      archetypeId: a.archetypeId,
-      componentMask: a.componentMask,
-      rowCount: 0,
-      enabledCount: 0,
-      rowCapacity: a.rowCapacity,
-      columns: a.columns.map((c) => ({
-        componentId: c.componentId,
-        fieldId: c.fieldId,
-        typeTag: c.typeTag,
-        byteOff: 0,
-        stride: Oe[c.typeTag]
-      }))
-    }))
-  ) + n;
-  let o = e + s;
-  const i = new Array(t.length);
-  for (let a = 0; a < t.length; a++) {
-    const c = t[a], d = new Array(c.columns.length);
-    for (let l = 0; l < c.columns.length; l++) {
-      const f = c.columns[l], h = Oe[f.typeTag];
-      o = Ke(o, h), d[l] = {
-        componentId: f.componentId,
-        fieldId: f.fieldId,
-        typeTag: f.typeTag,
-        byteOff: o,
-        stride: h
-      }, o += h * c.rowCapacity;
-    }
-    i[a] = {
-      archetypeId: c.archetypeId,
-      componentMask: c.componentMask,
-      rowCount: 0,
-      enabledCount: 0,
-      rowCapacity: c.rowCapacity,
-      columns: d
-    };
-  }
-  if (o > Ae)
-    throw new je(o);
-  return { descriptors: i, totalBytes: o, regionBytes: s };
-}
-function ts(t) {
-  const e = t;
-  return typeof e._regionBytes == "number" && typeof e._allocator == "function" && typeof e._reservedDescriptorBytes == "number";
-}
-function ns(t, e = st, n = {}) {
-  const r = {};
-  let s = _t;
-  for (let w = 0; w < K.length; w++) {
-    const b = K[w], G = b.sizeFromOptions(n);
-    r[b.headerOff] = G === 0 ? 0 : s, s += G;
-  }
-  const o = n.regions ?? [];
-  zt(o);
-  const i = o.length, a = i > 0 ? s : 0;
-  s += ze(i);
-  const c = new Array(i);
-  for (let w = 0; w < o.length; w++) {
-    const b = o[w];
-    c[w] = { regionId: b.id, byteOffset: s, byteLength: b.bytes }, s += b.bytes;
-  }
-  const d = n.bindingsRegionBytes ?? 0, l = d === 0 ? 0 : s;
-  s += d;
-  const f = s, { descriptors: h, totalBytes: g, regionBytes: p } = Jt(
-    t,
-    f,
-    n.reservedDescriptorBytes ?? 0
-  ), u = e(g), _ = new DataView(u), I = {
-    magic: ft,
-    simAbiVersion: ht,
-    viewStamp: 0,
-    capacity: g,
-    archetypeCount: t.length,
-    layoutDescriptorOff: f,
-    bindingsOff: l,
-    regionTableOff: a,
-    regionTableCount: i,
-    // `regionOffsets` stays keyed by the snake ABI field names (it also indexes
-    // `STORE_HEADER_OFFSETS`); map its 4 entries onto the camelCase header fields.
-    commandRingOff: r.command_ring_off,
-    entityIndexOff: r.entity_index_off,
-    eventRingOff: r.event_ring_off,
-    actionRingOff: r.action_ring_off
-  };
-  mt(_, I), d > 0 && new Uint8Array(u, l, d).fill(0);
-  for (let w = 0; w < K.length; w++) {
-    const b = K[w], G = r[b.headerOff];
-    G !== 0 && b.init(_, G, n);
-  }
-  a !== 0 && jt(_, a, c);
-  for (let w = 0; w < o.length; w++)
-    o[w].init(_, c[w].byteOffset);
-  Tt(_, f, h);
-  const B = en(u, h);
-  return {
-    buffer: u,
-    view: _,
-    header: I,
-    archetypes: B,
-    _regionBytes: p,
-    _allocator: e,
-    // Carry the headroom policy with the store so the realloc slow path
-    // (`optionsFromOld`) can re-reserve the same margin.
-    _reservedDescriptorBytes: n.reservedDescriptorBytes ?? 0
-  };
-}
-function en(t, e) {
-  const n = /* @__PURE__ */ new Map();
-  for (let r = 0; r < e.length; r++) {
-    const s = e[r], o = new Array(s.columns.length), i = /* @__PURE__ */ new Map();
-    for (let a = 0; a < s.columns.length; a++) {
-      const c = s.columns[a], d = {
-        componentId: c.componentId,
-        fieldId: c.fieldId,
-        typeTag: c.typeTag,
-        byteOff: c.byteOff,
-        stride: c.stride,
-        view: Zt(t, c.typeTag, c.byteOff, s.rowCapacity)
-      };
-      o[a] = d, i.set(Qt(c.componentId, c.fieldId), d);
-    }
-    n.set(s.archetypeId, {
-      archetypeId: s.archetypeId,
-      componentMask: s.componentMask,
-      rowCapacity: s.rowCapacity,
-      columns: i,
-      columnsInOrder: o
-    });
-  }
-  return n;
-}
-const tn = 2166136261, Qe = 16777619;
-function de(t, e) {
-  return t = (t ^ e & 255) >>> 0, Math.imul(t, Qe) >>> 0;
-}
-function ss(t, e) {
-  return t = (t ^ e >>> 0) >>> 0, Math.imul(t, Qe) >>> 0;
-}
-class rs {
-  /** entity index → field-value row (length = field count; `[]` for a tag). */
-  _data = new ot();
-  fieldNames;
-  fieldTypes;
-  fieldIndex;
-  constructor(e, n) {
-    this.fieldNames = e, this.fieldTypes = n;
-    const r = /* @__PURE__ */ Object.create(null);
-    for (let s = 0; s < e.length; s++) r[e[s]] = s;
-    this.fieldIndex = r;
-  }
-  /** Number of entities holding this sparse component. */
-  get size() {
-    return this._data.size;
-  }
-  /** Live entity indices that hold this component (dense, iteration order is
-   * SparseMap insertion/swap order — NOT canonical). Used by the hot query
-   * integration path; for the determinism surface use
-   * `canonicalIndices` instead. */
-  get indices() {
-    return this._data.keys;
-  }
-  /** Live entity indices in **canonical** (ascending) order — the determinism
-   * ordering for `stateHash` + snapshot/restore. The native
-   * `indices` getter is insertion/swap order and would make two worlds with
-   * identical contents reached by different add/remove histories diverge, so
-   * the cold determinism paths sort here. Allocates a sorted copy each call;
-   * never call it on the hot query path. Indices are 20-bit entity indices,
-   * so the subtraction comparator can't overflow. */
-  canonicalIndices() {
-    return this._data.keys.slice().sort((e, n) => e - n);
-  }
-  /** The field-value row for `index` (length = field count; `[]` for a tag),
-   * or `undefined` if `index` isn't a member. Read-only view for the
-   * determinism paths (`stateHash`, snapshot); mutate via `setField`. */
-  getRow(e) {
-    return this._data.get(e);
-  }
-  /** Drop all membership + data. Restore path only — `restoreSparseStores`
-   * repopulates a cleared store from snapshot bytes. */
-  clear() {
-    this._data.clear();
-  }
-  /** Insert the positional field-value `row` for `index`, taking ownership of
-   * the array. Restore path only; bypasses the name→index mapping `setRow`
-   * does, because snapshot bytes are already positional. */
-  setRawRow(e, n) {
-    this._data.set(e, n);
-  }
-  has(e) {
-    return this._data.has(e);
-  }
-  /** Insert or overwrite the row for `index`, building it from `values`.
-   * Fields absent from `values` default to 0; a tag stores `[]`. */
-  setRow(e, n) {
-    const r = this.fieldNames, s = new Array(r.length);
-    for (let o = 0; o < r.length; o++) {
-      const i = n[r[o]];
-      s[o] = i === void 0 ? 0 : i;
-    }
-    this._data.set(e, s);
-  }
-  /** Drop `index`'s membership + data. Returns whether it was present. */
-  remove(e) {
-    return this._data.delete(e);
-  }
-  /** Read one field, or `undefined` if `index` doesn't hold this component. */
-  getField(e, n) {
-    const r = this._data.get(e);
-    return r === void 0 ? void 0 : r[n];
-  }
-  /** Write one field. Returns `false` (no-op) if `index` isn't a member. */
-  setField(e, n, r) {
-    const s = this._data.get(e);
-    return s === void 0 ? !1 : (s[n] = r, !0);
-  }
-}
-class A extends Error {
-  constructor(e) {
-    super(e), this.name = "SparseRestoreError";
-  }
-}
-const Ie = 12, we = 4, H = 8;
-function Se(t, e) {
-  let n = tn;
-  const r = (s) => {
-    for (let o = 0; o < s.length; o++) n = de(n, s.charCodeAt(o));
-  };
-  for (let s = 0; s < t.length; s++)
-    r(t[s]), n = de(n, 31), r(e[s]), n = de(n, 30);
-  return n >>> 0;
-}
-function os(t) {
-  let e = 4;
-  for (let o = 0; o < t.length; o++) {
-    const i = t[o], a = i.fieldNames.length;
-    e += Ie + i.size * (we + a * H);
-  }
-  const n = new Uint8Array(e), r = new DataView(n.buffer);
-  let s = 0;
-  r.setUint32(s, t.length, !0), s += 4;
-  for (let o = 0; o < t.length; o++) {
-    const i = t[o], a = i.fieldNames.length, c = i.canonicalIndices();
-    r.setUint32(s, a, !0), s += 4, r.setUint32(s, Se(i.fieldNames, i.fieldTypes), !0), s += 4, r.setUint32(s, c.length, !0), s += 4;
-    for (let d = 0; d < c.length; d++) {
-      const l = c[d];
-      r.setUint32(s, l, !0), s += 4;
-      const f = i.getRow(l);
-      for (let h = 0; h < a; h++)
-        r.setFloat64(s, f[h], !0), s += H;
-    }
-  }
-  return n;
-}
-function is(t, e) {
-  const n = new DataView(e.buffer, e.byteOffset, e.byteLength), r = e.byteLength;
-  let s = 0;
-  const o = (a) => {
-    if (s + a > r)
-      throw new A(
-        `sparse snapshot truncated: need ${a} more bytes at offset ${s}, have ${r - s}`
-      );
-  };
-  o(4);
-  const i = n.getUint32(s, !0);
-  if (s += 4, i !== t.length)
-    throw new A(
-      `sparse store count mismatch: snapshot=${i}, registered=${t.length}`
-    );
-  for (let a = 0; a < t.length; a++) {
-    const c = t[a];
-    o(Ie);
-    const d = n.getUint32(s, !0);
-    s += 4;
-    const l = n.getUint32(s, !0);
-    s += 4;
-    const f = n.getUint32(s, !0);
-    if (s += 4, d !== c.fieldNames.length)
-      throw new A(
-        `sparse store ${a} field-count mismatch: snapshot=${d}, registered=${c.fieldNames.length}`
-      );
-    const h = Se(c.fieldNames, c.fieldTypes);
-    if (l !== h)
-      throw new A(
-        `sparse store ${a} schema identity mismatch: snapshot hash=${l}, registered=${h} (same field count, different field names/types — likely a registration-order divergence between the snapshot and restore worlds)`
-      );
-    c.clear();
-    for (let g = 0; g < f; g++) {
-      o(we + d * H);
-      const p = n.getUint32(s, !0);
-      if (s += 4, p > $)
-        throw new A(
-          `sparse store ${a} member ${g} entity index ${p} exceeds MAX_INDEX (${$})`
-        );
-      const u = new Array(d);
-      for (let _ = 0; _ < d; _++)
-        u[_] = n.getFloat64(s, !0), s += H;
-      c.setRawRow(p, u);
-    }
-  }
-  if (s !== r)
-    throw new A(
-      `sparse snapshot has ${r - s} trailing bytes after the last store (not a canonical encoding)`
-    );
-}
-function as(t, e) {
-  const n = new DataView(e.buffer, e.byteOffset, e.byteLength), r = e.byteLength;
-  let s = 0;
-  const o = (a) => {
-    if (s + a > r)
-      throw new A(
-        `sparse snapshot truncated: need ${a} more bytes at offset ${s}, have ${r - s}`
-      );
-  };
-  o(4);
-  const i = n.getUint32(s, !0);
-  if (s += 4, i !== t.length)
-    throw new A(
-      `sparse store count mismatch: snapshot=${i}, registered=${t.length}`
-    );
-  for (let a = 0; a < t.length; a++) {
-    const c = t[a];
-    o(Ie);
-    const d = n.getUint32(s, !0);
-    s += 4;
-    const l = n.getUint32(s, !0);
-    s += 4;
-    const f = n.getUint32(s, !0);
-    if (s += 4, d !== c.fieldNames.length)
-      throw new A(
-        `sparse store ${a} field-count mismatch: snapshot=${d}, registered=${c.fieldNames.length}`
-      );
-    const h = Se(c.fieldNames, c.fieldTypes);
-    if (l !== h)
-      throw new A(
-        `sparse store ${a} schema identity mismatch: snapshot hash=${l}, registered=${h} (same field count, different field names/types — likely a registration-order divergence between the snapshot and restore worlds)`
-      );
-    for (let g = 0; g < f; g++) {
-      o(we + d * H);
-      const p = n.getUint32(s, !0);
-      if (s += 4, p > $)
-        throw new A(
-          `sparse store ${a} member ${g} entity index ${p} exceeds MAX_INDEX (${$})`
-        );
-      s += d * H;
-    }
-  }
-  if (s !== r)
-    throw new A(
-      `sparse snapshot has ${r - s} trailing bytes after the last store (not a canonical encoding)`
-    );
-}
-const Me = 2147483647, cs = "orphan", nn = "target", sn = Object.freeze({});
-class Ze {
-  /** `true` → one target per source (target in the sparse field); `false` →
-   * a set of targets per source. The cardinality discriminant survives as a
-   * field because it is part of the snapshot header and the traversal/`targetOf`
-   * mode guards — but the forward *mechanics* are virtual, not branched on it. */
-  exclusive;
-  /** Backing sparse component def: `{ target: f64 }` when exclusive, a tag when
-   * multi. Carries membership (and the target, when exclusive). */
-  sparse;
-  /** Cleanup policy applied to this relation's sources when a target is
-   * destroyed. `orphan` (the default) is a no-op — the link dangles
-   * safely. `Store` reads this at destroy-flush off `sourcesOf`. */
-  onDeleteTarget;
-  /** The backing sparse store instance. Owned for registration/liveness by
-   * `Store`, but the relation drives the forward/membership rows on it directly
-   * — that is the cardinality interaction this class now encapsulates. */
-  _store;
-  /** target `EntityID` → set of source `EntityID`s. Keyed by the full id, not
-   * the index, so a recycled target slot can't alias a dead target's sources.
-   * An entry is dropped the moment its set empties (`unlinkReverse`). */
-  _reverse = /* @__PURE__ */ new Map();
-  constructor(e, n, r, s) {
-    this.exclusive = e, this.sparse = n, this._store = r, this.onDeleteTarget = s;
-  }
-  // --- shared reverse index (cardinality-agnostic) ---
-  /** Record that `src` points at `tgt` in the reverse index. */
-  linkReverse(e, n) {
-    let r = this._reverse.get(e);
-    r === void 0 && (r = /* @__PURE__ */ new Set(), this._reverse.set(e, r)), r.add(n);
-  }
-  /** Drop the `src → tgt` edge from the reverse index, removing the target's
-   * entry entirely once its last source is gone (so a dead-target key doesn't
-   * linger with an empty set). */
-  unlinkReverse(e, n) {
-    const r = this._reverse.get(e);
-    r !== void 0 && (r.delete(n), r.size === 0 && this._reverse.delete(e));
-  }
-  /** Drop every reverse-index entry whose **target** is no longer alive,
-   * returning the count dropped. The `orphan` policy intentionally
-   * leaves a destroyed target's reverse entry intact (the link dangles
-   * safely), so a long-lived source that orphan-points at a stream of
-   * short-lived targets and never re-targets/dies accumulates dead-target keys
-   * without bound. This is the reclaim primitive behind `Store.compactRelations`
-   * — a cold path the host calls at scene/snapshot boundaries. It is
-   * cardinality-free (reverse-index only), so it lives on the base unchanged.
-   *
-   * Pure index reclaim: the **forward** links (the exclusive sparse target
-   * field, the multi forward set) are left untouched, so `targetOf` /
-   * `targetsOf` still return the dangling dead handle exactly as `orphan`
-   * promises. The reverse index is derived, so dropping a dead-target entry
-   * changes nothing observable except `sourcesOf` on that dead handle (which
-   * goes from the dangling sources to `[]` — meaningless either way, the target
-   * is gone) and is faithfully rebuilt by snapshot/restore from the surviving
-   * forward links. Only the **target** role can leak here: a destroyed *source*
-   * is already unlinked from every reverse set by `purgeSource`, so a live
-   * target's set never holds a dead source. `isAlive` is supplied by `Store`,
-   * which owns entity liveness. Deleting during `Map` key iteration is
-   * well-defined — already-visited and not-yet-reached keys are unaffected. */
-  pruneDeadReverse(e) {
-    let n = 0;
-    for (const r of this._reverse.keys())
-      e(r) || (this._reverse.delete(r), n++);
-    return n;
-  }
-  /** Sources that point at `tgt`, ascending by id (deterministic, cold-path
-   * sort) — empty when none. */
-  sourcesOf(e) {
-    const n = this._reverse.get(e);
-    if (n === void 0 || n.size === 0) return [];
-    const r = new Array(n.size);
-    let s = 0;
-    return n.forEach((o) => {
-      r[s++] = o;
-    }), r.sort((o, i) => o - i), r;
-  }
-  /** Drop every derived side index — the reverse index and (for multi) the
-   * forward target sets. Restore path only (`restoreRelations`): the side
-   * indices are rebuilt from scratch, so they're cleared first to stay
-   * idempotent when restoring into a dirty world. The backing sparse store is
-   * cleared separately by `restoreSparseStores`. */
-  resetIndices() {
-    this._reverse.clear(), this._resetForward();
-  }
-}
-class rn extends Ze {
-  constructor(e, n, r) {
-    super(!0, e, n, r);
-  }
-  _resetForward() {
-  }
-  link(e, n) {
-    const r = L(e), s = this._store.getField(r, 0);
-    if (s !== void 0) {
-      if (s === n) return;
-      this.unlinkReverse(s, e);
-    }
-    this._store.setRow(r, { [nn]: n }), this.linkReverse(n, e);
-  }
-  unlink(e, n) {
-    const r = L(e), s = this._store.getField(r, 0);
-    s !== void 0 && (n !== void 0 && s !== n || (this.unlinkReverse(s, e), this._store.remove(r)));
-  }
-  purgeSource(e) {
-    const n = L(e), r = this._store.getField(n, 0);
-    r !== void 0 && this.unlinkReverse(r, e);
-  }
-  singleTarget(e) {
-    const n = this._store.getField(e, 0);
-    return n === void 0 ? void 0 : n;
-  }
-  targetsOf(e) {
-    const n = this._store.getField(e, 0);
-    return n === void 0 ? [] : [n];
-  }
-  has(e) {
-    return this._store.has(e);
-  }
-  forEachCanonicalTargetSet(e) {
-  }
-  forEachCanonicalPair(e, n) {
-    const r = this._store.canonicalIndices();
-    for (let s = 0; s < r.length; s++) {
-      const o = r[s];
-      n(e(o), this._store.getField(o, 0));
-    }
-  }
-  rebuildReverseFromForward(e) {
-    const n = this._store.indices;
-    for (let r = 0; r < n.length; r++) {
-      const s = n[r];
-      this.linkReverse(this._store.getField(s, 0), e(s));
-    }
-  }
-  restoreAddTarget() {
-    throw new A(
-      "exclusive relation has no multi forward sources to restore (snapshot header should have guarded this)"
-    );
-  }
-}
-class on extends Ze {
-  /** source entity **index** → set of target `EntityID`s. Keyed by source index
-   * so destroy-purge — which has the freed index — can drop it in O(1). An
-   * entry is removed the moment its set empties. */
-  _forward = /* @__PURE__ */ new Map();
-  constructor(e, n, r) {
-    super(!1, e, n, r);
-  }
-  _resetForward() {
-    this._forward.clear();
-  }
-  link(e, n) {
-    const r = L(e);
-    let s = this._forward.get(r);
-    s === void 0 && (s = /* @__PURE__ */ new Set(), this._forward.set(r, s), this._store.setRow(r, sn)), s.add(n), this.linkReverse(n, e);
-  }
-  unlink(e, n) {
-    const r = L(e), s = this._forward.get(r);
-    if (s !== void 0) {
-      if (n === void 0) {
-        this._forward.delete(r), s.forEach((o) => this.unlinkReverse(o, e)), this._store.remove(r);
-        return;
-      }
-      s.has(n) && (s.delete(n), this.unlinkReverse(n, e), s.size === 0 && (this._forward.delete(r), this._store.remove(r)));
-    }
-  }
-  purgeSource(e) {
-    const n = L(e), r = this._forward.get(n);
-    r !== void 0 && (this._forward.delete(n), r.forEach((s) => this.unlinkReverse(s, e)));
-  }
-  singleTarget() {
-  }
-  targetsOf(e) {
-    const n = this._forward.get(e);
-    if (n === void 0 || n.size === 0) return [];
-    const r = new Array(n.size);
-    let s = 0;
-    return n.forEach((o) => {
-      r[s++] = o;
-    }), r.sort((o, i) => o - i), r;
-  }
-  has(e) {
-    return this._store.has(e);
-  }
-  forEachCanonicalTargetSet(e) {
-    const n = Array.from(this._forward.keys()).sort((r, s) => r - s);
-    for (let r = 0; r < n.length; r++) {
-      const s = this.targetsOf(n[r]);
-      s.length !== 0 && e(n[r], s);
-    }
-  }
-  forEachCanonicalPair(e, n) {
-    this.forEachCanonicalTargetSet((r, s) => {
-      const o = e(r);
-      for (let i = 0; i < s.length; i++) n(o, s[i]);
-    });
-  }
-  rebuildReverseFromForward() {
-  }
-  restoreAddTarget(e, n, r) {
-    let s = this._forward.get(e);
-    s === void 0 && (s = /* @__PURE__ */ new Set(), this._forward.set(e, s)), s.add(n), this.linkReverse(n, r);
-  }
-}
-function ds(t, e, n, r) {
-  return t ? new rn(e, n, r) : new on(e, n, r);
-}
-const Je = 4, et = 4, tt = 8, ne = 8;
-function ls(t) {
-  const e = new Array(t.length);
-  let n = 4;
-  for (let i = 0; i < t.length; i++) {
-    n += Je;
-    const a = t[i];
-    if (a.exclusive) {
-      e[i] = null;
-      continue;
-    }
-    const c = [];
-    a.forEachCanonicalTargetSet((d, l) => c.push([d, l])), e[i] = c, n += et;
-    for (let d = 0; d < c.length; d++)
-      n += tt + c[d][1].length * ne;
-  }
-  const r = new Uint8Array(n), s = new DataView(r.buffer);
-  let o = 0;
-  s.setUint32(o, t.length, !0), o += 4;
-  for (let i = 0; i < t.length; i++) {
-    s.setUint32(o, t[i].exclusive ? 0 : 1, !0), o += 4;
-    const a = e[i];
-    if (a !== null) {
-      s.setUint32(o, a.length, !0), o += 4;
-      for (let c = 0; c < a.length; c++) {
-        const d = a[c][0], l = a[c][1];
-        s.setUint32(o, d, !0), o += 4, s.setUint32(o, l.length, !0), o += 4;
-        for (let f = 0; f < l.length; f++)
-          s.setFloat64(o, l[f], !0), o += ne;
-      }
-    }
-  }
-  return r;
-}
-function us(t, e, n) {
-  const r = new DataView(e.buffer, e.byteOffset, e.byteLength), s = e.byteLength;
-  let o = 0;
-  const i = (c) => {
-    if (o + c > s)
-      throw new A(
-        `relation snapshot truncated: need ${c} more bytes at offset ${o}, have ${s - o}`
-      );
-  };
-  for (let c = 0; c < t.length; c++) t[c].resetIndices();
-  i(4);
-  const a = r.getUint32(o, !0);
-  if (o += 4, a !== t.length)
-    throw new A(
-      `relation count mismatch: snapshot=${a}, registered=${t.length}`
-    );
-  for (let c = 0; c < t.length; c++) {
-    const d = t[c];
-    i(Je);
-    const l = r.getUint32(o, !0);
-    if (o += 4, l === 1 === d.exclusive)
-      throw new A(
-        `relation ${c} cardinality mismatch: snapshot ${l ? "multi" : "exclusive"}, registered ${d.exclusive ? "exclusive" : "multi"}`
-      );
-    if (d.exclusive) continue;
-    i(et);
-    const f = r.getUint32(o, !0);
-    o += 4;
-    for (let h = 0; h < f; h++) {
-      i(tt);
-      const g = r.getUint32(o, !0);
-      o += 4;
-      const p = r.getUint32(o, !0);
-      if (o += 4, g > $)
-        throw new A(
-          `relation ${c} source index ${g} exceeds MAX_INDEX (${$})`
-        );
-      i(p * ne);
-      const u = n(g);
-      for (let _ = 0; _ < p; _++) {
-        const I = r.getFloat64(o, !0);
-        o += ne;
-        const B = I;
-        if (!Number.isInteger(B) || B < 0 || B > Re)
-          throw new A(
-            `relation ${c} target ${B} is not a well-formed packed EntityID (expected an integer in [0, ${Re}])`
-          );
-        d.restoreAddTarget(g, I, u);
-      }
-    }
-  }
-  if (o !== s)
-    throw new A(
-      `relation snapshot has ${s - o} trailing bytes after the last relation (not a canonical encoding)`
-    );
-}
-const $e = /* @__PURE__ */ new WeakMap();
-function an(t) {
-  const e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set(), s = /* @__PURE__ */ new Set(), o = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Set(), d = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Set();
-  for (let u = 0; u < t.writes.length; u++) {
-    const _ = t.writes[u].id;
-    n.add(_), e.add(_), r.add(_);
-  }
-  for (let u = 0; u < t.reads.length; u++)
-    e.add(t.reads[u].id);
-  for (let u = 0; u < t.spawns.length; u++) {
-    const _ = t.spawns[u];
-    for (let I = 0; I < _.length; I++)
-      r.add(_[I].id);
-  }
-  for (let u = 0; u < t.transitions.length; u++) {
-    const _ = t.transitions[u];
-    if (_.add)
-      for (let I = 0; I < _.add.length; I++)
-        r.add(_.add[I].id);
-    if (_.remove)
-      for (let I = 0; I < _.remove.length; I++)
-        s.add(_.remove[I].id);
-  }
-  for (let u = 0; u < t.despawns.length; u++)
-    s.add(t.despawns[u].id);
-  for (let u = 0; u < t.resourceReads.length; u++)
-    o.add(t.resourceReads[u]);
-  for (let u = 0; u < t.resourceWrites.length; u++) {
-    const _ = t.resourceWrites[u];
-    i.add(_), o.add(_);
-  }
-  const f = t.sparseWrites;
-  if (f !== void 0)
-    for (let u = 0; u < f.length; u++) {
-      const _ = f[u];
-      c.add(_), a.add(_);
-    }
-  const h = t.sparseReads;
-  if (h !== void 0)
-    for (let u = 0; u < h.length; u++) a.add(h[u]);
-  const g = t.relationWrites;
-  if (g !== void 0)
-    for (let u = 0; u < g.length; u++) {
-      const _ = g[u];
-      l.add(_), d.add(_);
-    }
-  const p = t.relationReads;
-  if (p !== void 0)
-    for (let u = 0; u < p.length; u++)
-      d.add(p[u]);
-  return {
-    reads: e,
-    writes: n,
-    addAllowed: r,
-    removeAllowed: s,
-    hasDespawns: t.despawns.length > 0,
-    resourceReads: o,
-    resourceWrites: i,
-    sparseReads: a,
-    sparseWrites: c,
-    relationReads: d,
-    relationWrites: l
-  };
-}
-function cn(t) {
-  const e = $e.get(t);
-  if (e !== void 0) return e;
-  const n = an(t);
-  return $e.set(t, n), n;
-}
-const Pe = /* @__PURE__ */ new WeakMap();
-function dn(t) {
-  const e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set();
-  if (t.reads !== void 0)
-    for (let r = 0; r < t.reads.length; r++) e.add(t.reads[r].id);
-  if (t.resourceReads !== void 0)
-    for (let r = 0; r < t.resourceReads.length; r++)
-      n.add(t.resourceReads[r]);
-  return {
-    reads: e,
-    writes: /* @__PURE__ */ new Set(),
-    addAllowed: /* @__PURE__ */ new Set(),
-    removeAllowed: /* @__PURE__ */ new Set(),
-    hasDespawns: !1,
-    resourceReads: n,
-    resourceWrites: /* @__PURE__ */ new Set(),
-    sparseReads: /* @__PURE__ */ new Set(),
-    sparseWrites: /* @__PURE__ */ new Set(),
-    relationReads: /* @__PURE__ */ new Set(),
-    relationWrites: /* @__PURE__ */ new Set()
-  };
-}
-function ln(t) {
-  const e = Pe.get(t);
-  if (e !== void 0) return e;
-  const n = dn(t);
-  return Pe.set(t, n), n;
-}
-class un {
-  active = null;
-  sets = null;
-  // The label used in violation messages. Tracks `active` for a system span,
-  // but a run-condition span has no descriptor — only this name — so the
-  // failure helpers read the label here rather than off `active`.
-  activeName = null;
-  // An `exclusive` system has full world access: every check_* below
-  // passes for the whole span. Kept as an explicit flag (rather than leaving
-  // `sets` null) so `isActive()` stays truthful inside the span.
-  exclusive = !1;
-  enter(e) {
-    this.active = e, this.activeName = e.name ?? `system_${e.id}`, this.exclusive = e.exclusive === !0, this.sets = this.exclusive ? null : cn(e);
-  }
-  /** Open a reads-only span for a run condition. No descriptor — a
-   * condition can gate a whole SystemSet, so it isn't attributable to one
-   * system — just its declared reads/resource_reads and a name for diagnostics.
-   * Paired with `leave()`. */
-  enterCondition(e) {
-    this.active = null, this.activeName = e.name, this.sets = ln(e);
-  }
-  leave() {
-    this.active = null, this.activeName = null, this.sets = null, this.exclusive = !1;
-  }
-  isActive() {
-    return this.sets !== null || this.exclusive;
-  }
-  /** Current system descriptor, if any. Null during a run-condition span. */
-  current() {
-    return this.active;
-  }
-  checkRead(e) {
-    this.sets !== null && (this.sets.reads.has(e.id) || this.failComponent("read", e, "reads"));
-  }
-  checkWrite(e) {
-    this.sets !== null && (this.sets.writes.has(e.id) || this.failComponent("write", e, "writes"));
-  }
-  checkAdd(e) {
-    this.sets !== null && (this.sets.addAllowed.has(e.id) || this.failComponent("addComponent", e, "spawns / transitions.add / writes"));
-  }
-  checkRemove(e) {
-    this.sets !== null && (this.sets.removeAllowed.has(e.id) || this.failComponent("removeComponent", e, "despawns / transitions.remove"));
-  }
-  checkDestroy() {
-    if (this.sets === null || this.sets.hasDespawns) return;
-    const e = this.activeName;
-    throw new T(
-      y.ACCESS_UNDECLARED,
-      `system '${e}' called despawn but didn't declare any despawns — declare the components this system removes via despawn in its 'despawns'`,
-      { system: e, op: "despawn" }
-    );
-  }
-  checkResourceRead(e) {
-    if (this.sets === null) return;
-    const n = e;
-    this.sets.resourceReads.has(n) || this.failResource("read", e, "resourceReads");
-  }
-  checkResourceWrite(e) {
-    if (this.sets === null) return;
-    const n = e;
-    this.sets.resourceWrites.has(n) || this.failResource("write", e, "resourceWrites");
-  }
-  // --- Sparse component / relation checks ---
-  // Keyed against the dedicated sparse/relation sets, NOT the dense
-  // `reads`/`writes` sets — the id spaces are disjoint by construction (see
-  // file header). `def as unknown as number` recovers the SparseComponentID /
-  // RelationID the branded handle erases to at runtime.
-  checkSparseRead(e) {
-    if (this.sets === null) return;
-    const n = e;
-    this.sets.sparseReads.has(n) || this.failSparse("read", n, "sparseReads");
-  }
-  checkSparseWrite(e) {
-    if (this.sets === null) return;
-    const n = e;
-    this.sets.sparseWrites.has(n) || this.failSparse("write", n, "sparseWrites");
-  }
-  checkRelationRead(e) {
-    if (this.sets === null) return;
-    const n = e;
-    this.sets.relationReads.has(n) || this.failRelation("read", n, "relationReads");
-  }
-  checkRelationWrite(e) {
-    if (this.sets === null) return;
-    const n = e;
-    this.sets.relationWrites.has(n) || this.failRelation("write", n, "relationWrites");
-  }
-  /** A `(*, T)` wildcard (`Query.forEachRelatedTo`) reads every
-   * relation's reverse index, so it can't name a specific relation — it is
-   * authorised by the `ANY_RELATION` sentinel in `relationReads`. Honoured here
-   * exactly like a per-relation read, just keyed on the reserved sentinel id
-   * (which computeSets folds into `relationReads` like any other entry). */
-  checkRelationReadAny() {
-    this.sets !== null && (this.sets.relationReads.has(Me) || this.failRelation(
-      "(*, T) wildcard read",
-      Me,
-      "relationReads (as ANY_RELATION)"
-    ));
-  }
-  // --- Optional query-term scope ---
-  // `Query.forEach` and `ChangedQuery.forEach` push the iterating query's
-  // `_optional` term list for the span of the callback;
-  // `Archetype.getOptionalColumnRead` then verifies the fetched component was
-  // declared via `.optional(T)` — the term that authorizes the optional fetch.
-  // This is what makes the optional term *consumed* rather than decorative: like
-  // `reads:[T]` for required access, `.optional(T)` is the fetch's declaration,
-  // checked here in `DEV`. A stack (not a single slot) handles re-entrant /
-  // nested `forEach`. The optional scope is independent of the per-system
-  // `enter`/`leave` above — a host-side `ecs.query(...).forEach` outside any
-  // system still establishes one. No active scope ⇒ lenient: a manual
-  // `query.archetypes` walk can't be attributed to an optional declaration, so it
-  // isn't checked — mirroring the unchecked outside-of-system calls in the header.
-  //
-  // CAVEAT: the gate always attributes to the INNERMOST active
-  // `forEach`. If you nest `forEach` and call `getOptionalColumnRead` on an
-  // OUTER query's archetype inside the inner loop, it is checked against the inner
-  // query's terms (a false throw or false pass). Per-query attribution isn't worth
-  // the complexity for a dev-only assertion; iterate one query at a time, or read
-  // the outer span before entering the inner loop.
-  optionalScopes = [];
-  enterOptionalScope(e) {
-    this.optionalScopes.push(e);
-  }
-  leaveOptionalScope() {
-    this.optionalScopes.pop();
-  }
-  checkOptionalFetch(e) {
-    const n = this.optionalScopes.length;
-    if (n === 0) return;
-    const r = this.optionalScopes[n - 1], s = e.id;
-    for (let o = 0; o < r.length; o++)
-      if (r[o] === s) return;
-    throw new T(
-      y.OPTIONAL_TERM_NOT_DECLARED,
-      `getOptionalColumnRead fetched optional component ${s} but the iterating query didn't declare it — add .optional(component) to the query before fetching it`
-    );
-  }
-  failComponent(e, n, r) {
-    const s = this.activeName, o = ut(n);
-    throw new T(
-      y.ACCESS_UNDECLARED,
-      `system '${s}' performed ${e} on ${o} but didn't declare it — add it to '${r}' (see docs/api/systems.md)`,
-      { system: s, op: e, component: n.id }
-    );
-  }
-  failSparse(e, n, r) {
-    const s = this.activeName;
-    throw new T(
-      y.ACCESS_UNDECLARED,
-      `system '${s}' performed ${e} on sparse component ${n} but didn't declare it — add it to '${r}' (see docs/api/systems.md)`,
-      { system: s, op: e, sparse: n }
-    );
-  }
-  failRelation(e, n, r) {
-    const s = this.activeName;
-    throw new T(
-      y.ACCESS_UNDECLARED,
-      `system '${s}' performed ${e} on relation ${n} but didn't declare it — add it to '${r}' (see docs/api/systems.md)`,
-      { system: s, op: e, relation: n }
-    );
-  }
-  failResource(e, n, r) {
-    const s = this.activeName, o = n.description ?? "<unnamed>";
-    throw new T(
-      y.ACCESS_UNDECLARED,
-      `system '${s}' performed resource ${e} on '${o}' but didn't declare it — add the resource key to '${r}' (see docs/api/systems.md)`,
-      { system: s, op: e, resource: o }
-    );
-  }
-}
-const Q = new un(), fn = "/packages/engine/src/core/ecs/";
-class hn {
-  activeCache = null;
-  repoRootCache = null;
-  buf = /* @__PURE__ */ new Map();
-  callsiteCache = /* @__PURE__ */ new Map();
-  isActive() {
-    if (this.activeCache !== null) return this.activeCache;
-    const n = globalThis.process?.env?.VISUAL_INTEL_TRACE;
-    return this.activeCache = n === "1" || n === "true";
-  }
-  repoRoot() {
-    if (this.repoRootCache !== null) return this.repoRootCache;
-    const e = globalThis.process;
-    return this.repoRootCache = e?.cwd?.() ?? "";
-  }
-  resolveCallsite() {
-    return mn(
-      new Error().stack ?? null,
-      this.repoRoot(),
-      this.callsiteCache
-    );
-  }
-  record(e, n, r) {
-    const s = this.resolveCallsite();
-    if (!s) return;
-    const o = `${e}	${n}	${r}	${s}`;
-    this.buf.set(o, (this.buf.get(o) ?? 0) + 1);
-  }
-  recordEmit(e) {
-    this.record("ecs-events", "emit", e);
-  }
-  recordRead(e) {
-    this.record("ecs-events", "read", e);
-  }
-  recordResourceRead(e) {
-    this.record("resources", "read", e);
-  }
-  recordResourceWrite(e) {
-    this.record("resources", "write", e);
-  }
-  recordResourceRegister(e) {
-    this.record("resources", "register", e);
-  }
-  recordResourceRemove(e) {
-    this.record("resources", "remove", e);
-  }
-  recordSendAction(e) {
-    this.record("actions", "send_action", e);
-  }
-  recordHandleAction(e) {
-    this.record("actions", "handle_action", e);
-  }
-  snapshot() {
-    const e = {
-      "ecs-events": { emit: [], read: [] },
-      actions: { send_action: [], handle_action: [] },
-      resources: { read: [], write: [], register: [], remove: [] }
-    };
-    for (const [n, r] of this.buf.entries()) {
-      const [s, o, i, a] = n.split("	");
-      if (!s || !o || a === void 0) continue;
-      const d = { key: s === "actions" ? Number(i) : i, file: a, count: r }, f = e[s][o];
-      f && f.push(d);
-    }
-    for (const n of Object.values(e))
-      for (const r of Object.values(n))
-        r.sort((s, o) => {
-          if (s.file !== o.file) return s.file < o.file ? -1 : 1;
-          const i = String(s.key), a = String(o.key);
-          return i < a ? -1 : i > a ? 1 : 0;
-        });
-    return {
-      schemaVersion: 1,
-      capturedAt: (/* @__PURE__ */ new Date()).toISOString(),
-      channels: e
-    };
-  }
-  reset() {
-    this.buf.clear(), this.callsiteCache.clear(), this.activeCache = null, this.repoRootCache = null;
-  }
-}
-function _n(t) {
-  const e = /\(([^)]+):\d+:\d+\)\s*$/.exec(t);
-  if (e) return e[1] ?? null;
-  const n = /at\s+([^\s][^()]*?):\d+:\d+\s*$/.exec(t);
-  return n && (n[1] ?? "").trim() || null;
-}
-function mn(t, e, n) {
-  if (!t) return null;
-  const r = t.split(`
-`);
-  for (let s = 0; s < r.length; s++) {
-    const o = r[s], i = n?.get(o);
-    if (i !== void 0) {
-      if (i === null) continue;
-      return i;
-    }
-    const a = _n(o);
-    if (!a) {
-      n?.set(o, null);
-      continue;
-    }
-    if (a.includes(fn)) {
-      n?.set(o, null);
-      continue;
-    }
-    const c = gn(a, e);
-    return n?.set(o, c), c;
-  }
-  return null;
-}
-function gn(t, e) {
-  let n = t;
-  return n.startsWith("file://") && (n = n.slice(7)), e && n.startsWith(e + "/") && (n = n.slice(e.length + 1)), n.replace(/\\/g, "/");
-}
-const fs = new hn();
-var x = /* @__PURE__ */ ((t) => (t.PRE_STARTUP = "PRE_STARTUP", t.STARTUP = "STARTUP", t.POST_STARTUP = "POST_STARTUP", t.FIXED_UPDATE = "FIXED_UPDATE", t.PRE_UPDATE = "PRE_UPDATE", t.UPDATE = "UPDATE", t.POST_UPDATE = "POST_UPDATE", t))(x || {});
-const le = [
-  "PRE_STARTUP",
-  "STARTUP",
-  "POST_STARTUP"
-  /* POST_STARTUP */
-], ue = [
-  "PRE_UPDATE",
-  "UPDATE",
-  "POST_UPDATE"
-  /* POST_UPDATE */
-];
-function hs(t) {
-  return Object.freeze({ name: t });
-}
-function En(t) {
-  return !("fn" in t);
-}
-const X = Object.freeze([]);
-function fe(t) {
-  return t === void 0 ? X : Array.isArray(t) ? t : [t];
-}
-class _s {
-  labelSystems = /* @__PURE__ */ new Map();
-  // Sorted descriptors for a phase, paired with the `systemLastRun` slot of each
-  // — cached together so `runLabel` resolves both with the one `Map.get` it
-  // already paid, and the per-system lookup inside the loop is array indexing.
-  sortedCache = /* @__PURE__ */ new Map();
-  systemIndex = /* @__PURE__ */ new Map();
-  // Previous-run tick per scheduled system — a packed array, NOT a `Map` keyed
-  // on the descriptor. `runLabel` reads it and writes it back once per system
-  // per phase. A profile of a dispatch-bound schedule shows that those two `Map`
-  // operations, and not the system bodies, are where most of the phase loop goes
-  // — they hash an object identity twice for each system in each frame.
-  //
-  // Indexed by a SCHEDULE-LOCAL slot, not by `SystemDescriptor.id`. Ids come
-  // from a per-world counter, so two descriptors registered with two different
-  // worlds both get id 0 — scheduling them into a third world would alias them
-  // onto one slot and let the system that runs more often overwrite the other's
-  // last-run tick (silently widening its `changed()` window). Slots are handed
-  // out per Schedule, so identity comes from this schedule's own numbering.
-  systemLastRun = [];
-  // Descriptor → its `systemLastRun` slot. Consulted only by `addSystems` /
-  // `removeSystem`; the run loop never touches it (the slot travels in the
-  // phase plan).
-  //
-  // `removeSystem` MUST delete from this map. It is the only strong reference
-  // the Schedule keeps to a descriptor once its node is gone, and a descriptor
-  // closes over whatever its `fn` captured — leaving the entry behind pins that
-  // for the world's lifetime. (The `Map` this replaced was deleted on remove;
-  // forgetting to do the same here leaked every descriptor ever scheduled.)
-  lastRunSlots = /* @__PURE__ */ new Map();
-  // Slots freed by `removeSystem`, handed back out by `_assignLastRunSlot`.
-  // Without reuse the array would grow by one per `addSystems` call — unbounded
-  // under a workload that toggles systems on and off each frame.
-  freeLastRunSlots = [];
-  // Nesting depth of a drive (`runStartup` / `runUpdate` / `runFixedUpdate`).
-  // Non-zero means a phase plan is live and `runLabel`'s loop may still write
-  // `systemLastRun` through the `slots` array it captured, which is what makes
-  // recycling a freed slot unsafe right now — see `_assignLastRunSlot`.
-  _driveDepth = 0;
-  // Only systems carrying a run condition or set membership. The hot
-  // loop skips the per-system gate probe entirely when this is empty, so a
-  // schedule that uses no conditions runs byte-for-byte the original path.
-  gatedSystems = /* @__PURE__ */ new Map();
-  // Live set configuration, read at sort time (ordering) and run time
-  // (conditions) so `configureSet` is order-independent w.r.t. `addSystems`.
-  setConditions = /* @__PURE__ */ new Map();
-  setOrdering = /* @__PURE__ */ new Map();
-  nextInsertionOrder = 0;
-  // The opt-in compute backend, or null (the default — pure-TS). When
-  // set, a scheduled system carrying a `backendHandle` runs `backend.run(...)`
-  // instead of its `fn`. `null` is the byte-for-byte no-backend path: `runLabel`
-  // hoists this to a local and only reads `desc.backendHandle` when non-null,
-  // so a no-backend ECS never touches the routing field.
-  _backend = null;
-  /** Dev-diagnostic sink (`ECSOptions.onWarn`); defaults to `console.warn`.
-   * The only schedule diagnostic today is `warnDroppedEdge`. */
-  onWarn;
-  /** The `FIXED_UPDATE` node list, held directly for `hasFixedSystems`. */
-  _fixedNodes = [];
-  constructor(e) {
-    this.onWarn = e ?? ((n) => console.warn(n));
-    for (let n = 0; n < le.length; n++)
-      this.labelSystems.set(le[n], []);
-    this.labelSystems.set("FIXED_UPDATE", this._fixedNodes);
-    for (let n = 0; n < ue.length; n++)
-      this.labelSystems.set(ue[n], []);
-  }
-  addSystems(e, ...n) {
-    for (const r of n) {
-      const s = "system" in r, o = s ? r.system : r, i = s ? r.ordering : void 0, a = s ? fe(r.runIf) : X, c = s ? fe(r.set) : X;
-      if (this.systemIndex.has(o))
-        throw new T(
-          y.DUPLICATE_SYSTEM,
-          `System ${o.name ?? o.id} is already scheduled`
-        );
-      const d = {
-        descriptor: o,
-        insertionOrder: this.nextInsertionOrder++,
-        before: new Set(i?.before ?? []),
-        after: new Set(i?.after ?? []),
-        conditions: a,
-        sets: c
-      };
-      this.labelSystems.get(e).push(d), this.systemIndex.set(o, e), this._assignLastRunSlot(o), (a.length > 0 || c.length > 0) && this.gatedSystems.set(o, d), this.sortedCache.delete(e);
-    }
-  }
-  /**
-   * Configure a `SystemSet` — its shared run condition(s) and/or
-   * ordering, inherited by every member. Additive and order-independent w.r.t.
-   * `addSystems`: conditions accumulate (ANDed), ordering targets union, and
-   * a member added before or after this call picks the configuration up.
-   */
-  configureSet(e, n) {
-    const r = fe(n.runIf);
-    if (r.length > 0) {
-      const s = this.setConditions.get(e);
-      s === void 0 ? this.setConditions.set(e, [...r]) : s.push(...r);
-    }
-    if (n.before !== void 0 || n.after !== void 0) {
-      let s = this.setOrdering.get(e);
-      s === void 0 && (s = { before: /* @__PURE__ */ new Set(), after: /* @__PURE__ */ new Set() }, this.setOrdering.set(e, s));
-      for (const o of n.before ?? X) s.before.add(o);
-      for (const o of n.after ?? X) s.after.add(o);
-      this.sortedCache.clear();
-    }
-  }
-  removeSystem(e) {
-    const n = this.systemIndex.get(e);
-    if (n === void 0) return;
-    const r = this.labelSystems.get(n), s = r.findIndex((i) => i.descriptor === e);
-    if (s !== -1) {
-      const i = r.length - 1;
-      s !== i && (r[s] = r[i]), r.pop();
-      for (const a of r)
-        a.before.delete(e), a.after.delete(e);
-    }
-    this.systemIndex.delete(e);
-    const o = this.lastRunSlots.get(e);
-    o !== void 0 && (this.systemLastRun[o] = 0, this.lastRunSlots.delete(e), this.freeLastRunSlots.push(o)), this.gatedSystems.delete(e), this.sortedCache.clear();
-  }
-  /** Attach (or, with `null`, detach) the opt-in compute backend. Driven
-   * by `ECS.attachBackend`; routes any scheduled system carrying a
-   * `backendHandle` to `backend.run(handle)` in place of its `fn`. */
-  setBackend(e) {
-    this._backend = e;
-  }
-  // The three drive entry points each bracket their phases with `_driveDepth`,
-  // so `_assignLastRunSlot` will not recycle a `systemLastRun` slot that a phase
-  // plan captured by `runLabel`'s loop may still write to — see the guard there
-  // for the hazard it closes.
-  //
-  // Held across the WHOLE drive, not per phase: one `try`/`finally` per frame
-  // instead of one per phase (three, for an update). The difference is
-  // measurable on a dispatch-bound schedule, where the system bodies do almost
-  // no work. The wider window is also the more
-  // conservative one, and slots still recycle freely between frames — the only
-  // property `freeLastRunSlots` needs to stay bounded. Written out at each of
-  // the three sites rather than wrapped in a helper taking a callback, which
-  // would put a closure allocation and an indirect call on the per-frame path.
-  runStartup(e, n) {
-    this._driveDepth++;
-    try {
-      for (const r of le)
-        this.runLabel(r, e, dt, n);
-    } finally {
-      this._driveDepth--;
-    }
-  }
-  runUpdate(e, n, r) {
-    this._driveDepth++;
-    try {
-      for (const s of ue)
-        this.runLabel(s, e, n, r);
-    } finally {
-      this._driveDepth--;
-    }
-  }
-  runFixedUpdate(e, n, r) {
-    this._driveDepth++;
-    try {
-      this.runLabel("FIXED_UPDATE", e, n, r);
-    } finally {
-      this._driveDepth--;
-    }
-  }
-  hasFixedSystems() {
-    return this._fixedNodes.length > 0;
-  }
-  getAllSystems() {
-    const e = [];
-    for (const n of this.labelSystems.values())
-      for (const r of n)
-        e.push(r.descriptor);
-    return e;
-  }
-  hasSystem(e) {
-    return this.systemIndex.has(e);
-  }
-  /** Hand `descriptor` its `systemLastRun` slot, keeping the array packed (no
-   * holes ⇒ no undefined-check on the read in `runLabel`, which is the whole
-   * point of it not being a `Map`). Idempotent for a descriptor already in this
-   * schedule — `getSorted` re-asks for every system it sorts. A descriptor that
-   * was removed and re-added gets a *fresh* slot starting at tick 0, which is
-   * what the previous `Map`-based bookkeeping did (`delete` on remove, `set(…, 0)`
-   * on re-add). */
-  _assignLastRunSlot(e) {
-    let n = this.lastRunSlots.get(e);
-    if (n === void 0) {
-      const r = this._driveDepth === 0 ? this.freeLastRunSlots.pop() : void 0;
-      r !== void 0 ? (n = r, this.systemLastRun[n] = 0) : (n = this.systemLastRun.length, this.systemLastRun.push(0)), this.lastRunSlots.set(e, n);
-    }
-    return n;
-  }
-  clear() {
-    for (const e of this.labelSystems.values())
-      e.length = 0;
-    this.sortedCache.clear(), this.systemIndex.clear(), this._driveDepth === 0 ? this.systemLastRun.length = 0 : this.systemLastRun.fill(0), this.lastRunSlots.clear(), this.freeLastRunSlots.length = 0, this.gatedSystems.clear(), this.setConditions.clear(), this.setOrdering.clear();
-  }
-  runLabel(e, n, r, s) {
-    const o = this.getSorted(e), i = o.sorted, a = o.slots, c = this.gatedSystems.size > 0, d = this._backend, l = c ? /* @__PURE__ */ new Map() : void 0;
-    for (let f = 0; f < i.length; f++) {
-      const h = i[f];
-      if (c) {
-        const p = this.gatedSystems.get(h);
-        if (p !== void 0 && !this.shouldRun(p, n, l)) continue;
-      }
-      n.lastRunTick = this.systemLastRun[a[f]];
-      const g = d !== null ? h.backendHandle : void 0;
-      Q.enter(h), n._trace?.systemStart(h, e);
-      try {
-        g !== void 0 ? d.run(g) : h.fn?.(n, r);
-      } finally {
-        n._trace?.systemEnd(h), Q.leave();
-      }
-      this.systemLastRun[a[f]] = s;
-    }
-    n._trace?.flushBegin(e), n.flush(), n._trace?.flushEnd(e), n._trace?.phaseBoundary(e);
-  }
-  /**
-   * Whether a gated system runs this tick — the AND of its own conditions and
-   * every set it belongs to. A set's conditions are evaluated at most once per
-   * phase (memoized in `setVerdicts`) and the verdict gates every member of the
-   * set uniformly; a `configureSet` between phases is still honored because the
-   * memo lives only for a single `runLabel` pass. Short-circuits on the first
-   * `false`. The system's own conditions evaluate per system, in canonical order.
-   *
-   * SEMANTIC NOTE: this evaluates a set's conditions once-per-set-per-phase
-   * rather than once-per-member. Equivalent for pure RunConditions; observably
-   * different only if a set condition reads state mutated earlier in the SAME
-   * phase (resources write immediately). That is intentional — the set gates as a
-   * unit, so all its members share one verdict for the phase.
-   */
-  shouldRun(e, n, r) {
-    if (e.conditions.length > 0 && !this.evalConditions(e.conditions, n))
-      return !1;
-    for (let s = 0; s < e.sets.length; s++) {
-      const o = e.sets[s];
-      let i = r.get(o);
-      if (i === void 0) {
-        const a = this.setConditions.get(o);
-        i = a === void 0 || a.length === 0 ? !0 : this.evalConditions(a, n), r.set(o, i);
-      }
-      if (!i) return !1;
-    }
-    return !0;
-  }
-  /** Evaluate a condition list with AND semantics. Each predicate runs inside a
-   * reads-only `accessCheck` span (dev), so a condition that reads an
-   * undeclared resource — or attempts any mutation — throws. */
-  evalConditions(e, n) {
-    for (let r = 0; r < e.length; r++) {
-      const s = e[r];
-      Q.enterCondition(s);
-      let o;
-      try {
-        o = s.evaluate(n);
-      } finally {
-        Q.leave();
-      }
-      if (!o) return !1;
-    }
-    return !0;
-  }
-  getSorted(e) {
-    const n = this.sortedCache.get(e);
-    if (n !== void 0) return n;
-    const r = this.labelSystems.get(e), s = this.sortSystems(r, e), o = new Int32Array(s.length);
-    for (let a = 0; a < s.length; a++) o[a] = this._assignLastRunSlot(s[a]);
-    const i = { sorted: s, slots: o };
-    return this.sortedCache.set(e, i), i;
-  }
-  /**
-   * Delegates to the shared topologicalSort utility.
-   * Builds the dependency edge map from before/after constraints, then
-   * catches any cycle TypeError and re-throws as ECSError.
-   */
-  sortSystems(e, n) {
-    if (e.length === 0) return [];
-    const r = [], s = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Map();
-    for (const l of e) {
-      r.push(l.descriptor), s.set(l.descriptor, l.insertionOrder), o.add(l.descriptor);
-      for (let f = 0; f < l.sets.length; f++) {
-        const h = l.sets[f];
-        let g = i.get(h);
-        g === void 0 && (g = [], i.set(h, g)), g.push(l.descriptor);
-      }
-    }
-    const a = /* @__PURE__ */ new Map();
-    for (const l of e)
-      a.set(l.descriptor, []);
-    for (const l of e) {
-      this.resolveEdges(
-        l.descriptor,
-        l.before,
-        "before",
-        o,
-        i,
-        a,
-        n
-      ), this.resolveEdges(l.descriptor, l.after, "after", o, i, a, n);
-      for (let f = 0; f < l.sets.length; f++) {
-        const h = this.setOrdering.get(l.sets[f]);
-        h !== void 0 && (this.resolveEdges(
-          l.descriptor,
-          h.before,
-          "before",
-          o,
-          i,
-          a,
-          n
-        ), this.resolveEdges(
-          l.descriptor,
-          h.after,
-          "after",
-          o,
-          i,
-          a,
-          n
-        ));
-      }
-    }
-    const c = (l, f) => s.get(l) - s.get(f), d = (l) => l.name ?? `system_${l.id}`;
-    try {
-      return it(r, a, c, d);
-    } catch (l) {
-      throw l instanceof TypeError ? new T(
-        y.CIRCULAR_SYSTEM_DEPENDENCY,
-        `Circular system dependency detected in ${n}: ${l.message}`
-      ) : l;
-    }
-  }
-  /**
-   * Add the topo edges for one ordering list. For `"before"` the source
-   * runs before each target (edge source→target); for `"after"` it runs after
-   * each target (edge target→source). A `SystemSet` target expands to every
-   * member within this phase (self-edges skipped, so a member ordered against
-   * its own set is a no-op); a descriptor target absent from this phase is
-   * dropped — with a dev warning only for a concrete system, since a set
-   * legitimately expands to nothing when its members live in another phase.
-   */
-  resolveEdges(e, n, r, s, o, i, a) {
-    for (const c of n) {
-      if (En(c)) {
-        const d = o.get(c);
-        if (d === void 0) continue;
-        for (let l = 0; l < d.length; l++) {
-          const f = d[l];
-          f !== e && this.addDirectedEdge(e, f, r, i);
-        }
-        continue;
-      }
-      if (!s.has(c)) {
-        this.warnDroppedEdge(e, c, r, a);
-        continue;
-      }
-      this.addDirectedEdge(e, c, r, i);
-    }
-  }
-  /** Push one directed edge into the adjacency map. Both endpoints are known to
-   * be in this phase (callers guard), so `edges.get(...)` is non-null. */
-  addDirectedEdge(e, n, r, s) {
-    r === "before" ? s.get(e).push(n) : s.get(n).push(e);
-  }
-  /**
-   * Dev-only diagnostic for an ordering edge that was dropped during sort.
-   *
-   * Cross-label ordering is impossible by design (`nodeSet` is per-label), so
-   * a target registered in *another* phase is skipped silently — that's the
-   * intended isolation. But a target unknown to *every* phase is almost
-   * certainly a typo or a system that was never scheduled; without this warning
-   * the constraint vanishes and the system runs in insertion-order tiebreak as
-   * if unconstrained, with nothing to distinguish mistake from intent. Compiled
-   * out of production builds by the `DEV` guards at the call sites.
-   */
-  warnDroppedEdge(e, n, r, s) {
-    if (this.systemIndex.has(n)) return;
-    const o = (i) => i.name ?? `system_${i.id}`;
-    this.onWarn(
-      `Schedule[${s}]: \`${o(e)}\` declares \`${r}\` ordering against \`${o(n)}\`, which is not registered in any phase — the constraint is ignored. Check for a typo or a missing add_systems() call.`
-    );
-  }
-}
-const se = 1024, re = 1024 * se, xe = 64 * se, W = 256 * re, Be = 3, pn = 64, yn = 8, Fe = 4 * re, ke = (t) => 2 ** Math.ceil(Math.log2(Math.max(1, t))), Z = (t) => 2 ** Math.floor(Math.log2(Math.max(1, t))), k = (t, e, n) => Math.min(n, Math.max(e, t)), S = (t) => t >= re ? `${(t / re).toFixed(1)} MiB` : t >= se ? `${(t / se).toFixed(0)} KiB` : `${t} B`;
-function D(t, e) {
-  if (!Number.isInteger(e) || e <= 0)
-    throw new T(
-      y.INVALID_MEMORY_OPTIONS,
-      `memory.${t} must be a positive integer (got ${e})`
-    );
-}
-function ms(t) {
-  const e = ["budget", "maxBytes", "wasm", "allocator", "heap", "shared"].filter(
-    (s) => t !== void 0 && t[s] !== void 0
-  );
-  if (e.length > 1)
-    throw new T(
-      y.INVALID_MEMORY_OPTIONS,
-      `memory takes at most one of budget | maxBytes | wasm | allocator | heap | shared (got: ${e.join(", ")})`
-    );
-  const n = t?.columnCapacity;
-  if (n !== void 0 && D("columnCapacity", n), t?.budget !== void 0) {
-    const { entities: s } = t.budget, o = t.budget.archetypes ?? yn, i = t.budget.bytesPerEntity ?? pn;
-    if (D("budget.entities", s), D("budget.archetypes", o), D("budget.bytesPerEntity", i), s > 1 << 20)
-      throw new T(
-        y.INVALID_MEMORY_OPTIONS,
-        `memory.budget.entities=${s} exceeds the EntityID index space (1<<20 = ${1 << 20})`
-      );
-    const a = n ?? k(ke(Math.ceil(s / o)), 64, 1 << 20), c = k(ke(s * 2), 4096, 1 << 20), d = c * R, l = s * i * Be, f = Ke(
-      Math.max(d + l, Fe),
-      xe
-    );
-    return {
-      source: "budget",
-      allocator: j(f),
-      columnCapacity: a,
-      entityIndexCapacity: c,
-      capBytes: f,
-      intentLabel: `budget of ${s} entities`,
-      budgetEntities: s,
-      derivation: [
-        `columnCapacity = ${n !== void 0 ? `${a} (pinned)` : `pow2(${s}/${o} per archetype) = ${a}`}`,
-        `entityIndex = pow2(2 × ${s}) = ${c} slots × ${R} B = ${S(d)}`,
-        `columns = ${s} × ${i} B × ${Be} (double+holes headroom) = ${S(l)}`,
-        `cap = align64K(max(index + columns, ${S(Fe)} floor)) = ${S(f)}`
-      ],
-      wasmMemory: null
-    };
-  }
-  if (t?.maxBytes !== void 0) {
-    D("maxBytes", t.maxBytes);
-    const s = n ?? F, o = k(
-      Z(t.maxBytes / 4 / R),
-      4096,
-      U
-    );
-    return {
-      source: "maxBytes",
-      allocator: j(t.maxBytes),
-      columnCapacity: s,
-      entityIndexCapacity: o,
-      capBytes: t.maxBytes,
-      intentLabel: `explicit cap of ${S(t.maxBytes)}`,
-      budgetEntities: null,
-      derivation: [
-        `cap = ${S(t.maxBytes)} (caller-declared)`,
-        `columnCapacity = ${s} (${n !== void 0 ? "pinned" : "default"})`,
-        `entityIndex = floor_pow2(cap/4 ÷ ${R} B) = ${o} slots`
-      ],
-      wasmMemory: null
-    };
-  }
-  if (t?.wasm !== void 0) {
-    const s = t.wasm, o = n ?? F;
-    if (s.memory !== void 0) {
-      if (!(s.memory.buffer instanceof SharedArrayBuffer))
-        throw new T(
-          y.INVALID_MEMORY_OPTIONS,
-          "memory.wasm.memory must be constructed with `shared: true` — the SAB substrate requires a SharedArrayBuffer-backed WebAssembly.Memory"
-        );
-      return {
-        source: "wasm",
-        allocator: Ne(s.memory),
-        columnCapacity: o,
-        entityIndexCapacity: U,
-        // The JS API hides a Memory's `maximum`; the caller declared it.
-        capBytes: null,
-        intentLabel: "caller-supplied WebAssembly.Memory",
-        budgetEntities: null,
-        derivation: [
-          "backing = wasm_memory_allocator(memory) — zero-copy with the sim (is_in_place ✓)",
-          "cap = the Memory's own `maximum` (declared by the caller; not readable from JS)",
-          `columnCapacity = ${o} (${n !== void 0 ? "pinned" : "default"})`
-        ],
-        wasmMemory: s.memory
-      };
-    }
-    D("wasm.maximumPages", s.maximumPages);
-    const i = s.initialPages ?? Math.min(32, s.maximumPages);
-    if (D("wasm.initialPages", i), i > s.maximumPages)
-      throw new T(
-        y.INVALID_MEMORY_OPTIONS,
-        `memory.wasm.initialPages (${i}) exceeds maximumPages (${s.maximumPages})`
-      );
-    const a = new WebAssembly.Memory({
-      initial: i,
-      maximum: s.maximumPages,
-      shared: !0
-    }), c = s.maximumPages * xe, d = k(
-      Z(c / 4 / R),
-      4096,
-      U
-    );
-    return {
-      source: "wasm",
-      allocator: Ne(a),
-      columnCapacity: o,
-      entityIndexCapacity: d,
-      capBytes: c,
-      intentLabel: `engine-constructed WebAssembly.Memory (max ${s.maximumPages} pages)`,
-      budgetEntities: null,
-      derivation: [
-        `cap = ${s.maximumPages} pages × 64 KiB = ${S(c)} (Memory maximum)`,
-        `initial = ${i} pages (${s.initialPages !== void 0 ? "declared" : "default"})`,
-        `entityIndex = floor_pow2(cap/4 ÷ ${R} B) = ${d} slots`,
-        `columnCapacity = ${o} (${n !== void 0 ? "pinned" : "default"})`
-      ],
-      wasmMemory: a
-    };
-  }
-  if (t?.allocator !== void 0) {
-    if (t.allocator.isInPlace !== !0)
-      throw new T(
-        y.INVALID_MEMORY_OPTIONS,
-        "memory.allocator must declare `isInPlace: true`: a live Store's flush loops hoist entity-index views across grows, so a non-in-place allocator (e.g. DEFAULT_SAB_ALLOCATOR) corrupts the entity→row mapping. Use growableSabAllocator / wasmMemoryAllocator; non-in-place allocators are snapshot/test sizing only."
-      );
-    const s = n ?? F, o = t.capBytesHint;
-    return o !== void 0 && D("capBytesHint", o), {
-      source: "allocator",
-      allocator: t.allocator,
-      columnCapacity: s,
-      entityIndexCapacity: U,
-      capBytes: o ?? null,
-      intentLabel: o !== void 0 ? `custom in-place allocator (cap hint ${S(o)})` : "custom in-place allocator",
-      budgetEntities: null,
-      derivation: [
-        "backing = caller allocator (is_in_place ✓ checked at construction)",
-        o !== void 0 ? `cap = ${S(o)} (caller hint — diagnostics only; the allocator owns the real cap)` : "cap = allocator-owned (no hint)",
-        `columnCapacity = ${s} (${n !== void 0 ? "pinned" : "default"})`
-      ],
-      wasmMemory: null
-    };
-  }
-  if (t?.heap !== void 0) {
-    t.heap.maxBytes !== void 0 && D("heap.maxBytes", t.heap.maxBytes);
-    const s = t.heap.maxBytes ?? W, o = n ?? F, i = k(
-      Z(s / 4 / R),
-      4096,
-      U
-    );
-    return {
-      source: "heap",
-      allocator: j(s),
-      columnCapacity: o,
-      entityIndexCapacity: i,
-      capBytes: s,
-      intentLabel: `pure-TS heap backing (${S(s)} growable cap, no SharedArrayBuffer)`,
-      budgetEntities: null,
-      derivation: [
-        `backing = heap_arraybuffer_allocator(${S(s)}) — fixed ArrayBuffer reserved at the cap, no SAB / no COOP+COEP (is_in_place ✓)`,
-        "trade-off: no worker offload / no WASM backend (both need a transferable SharedArrayBuffer)",
-        `columnCapacity = ${o} (${n !== void 0 ? "pinned" : "default"})`,
-        `entityIndex = floor_pow2(cap/4 ÷ ${R} B) = ${i} slots`
-      ],
-      wasmMemory: null
-    };
-  }
-  if (t?.shared !== void 0) {
-    t.shared.maxBytes !== void 0 && D("shared.maxBytes", t.shared.maxBytes);
-    const s = t.shared.maxBytes ?? W, o = n ?? F, i = k(
-      Z(s / 4 / R),
-      4096,
-      U
-    );
-    return {
-      source: "shared",
-      allocator: rt(s),
-      columnCapacity: o,
-      entityIndexCapacity: i,
-      capBytes: s,
-      intentLabel: `shared SharedArrayBuffer backing (${S(s)} growable cap, needs COOP/COEP)`,
-      budgetEntities: null,
-      derivation: [
-        `backing = growable_sab_allocator(${S(s)}) — growable SharedArrayBuffer (is_in_place ✓); needs cross-origin isolation`,
-        "enables worker offload + a WASM compute backend (transferable SharedArrayBuffer)",
-        `columnCapacity = ${o} (${n !== void 0 ? "pinned" : "default"})`,
-        `entityIndex = floor_pow2(cap/4 ÷ ${R} B) = ${i} slots`
-      ],
-      wasmMemory: null
-    };
-  }
-  const r = n ?? F;
-  return {
-    source: "default",
-    allocator: j(),
-    columnCapacity: r,
-    entityIndexCapacity: U,
-    capBytes: W,
-    intentLabel: `default sizing (${S(W)} growable cap)`,
-    budgetEntities: null,
-    derivation: [
-      `cap = ${S(W)} (heap_arraybuffer_allocator default)`,
-      `columnCapacity = ${r} (${n !== void 0 ? "pinned" : "DEFAULT_COLUMN_CAPACITY"})`,
-      `entityIndex = ${U} slots (full EntityID space, ~12 MiB virtual)`
-    ],
-    wasmMemory: null
-  };
-}
-function gs(t, e) {
-  return { def: t, values: e };
-}
-function he(t, e) {
-  switch (e.kind) {
-    case "spawn": {
-      const n = t.commands.spawn();
-      for (const r of e.components)
-        t.commands.add(n, r.def, r.values);
-      return e.onSpawned?.(n), n;
-    }
-    case "despawn":
-      t.commands.despawn(e.eid);
-      return;
-    case "add_component":
-      t.commands.add(e.eid, e.def, e.values);
-      return;
-    case "remove_component":
-      t.commands.remove(e.eid, e.def);
-      return;
-    case "set_field":
-      if (!t.hasComponent(e.eid, e.def))
-        throw new T(
-          y.COMPONENT_NOT_REGISTERED,
-          `host set_field on entity ${e.eid} targets a component it does not have. If you added that component via a host command this same frame, the add is deferred to the phase flush while set_field is immediate — carry the value in add_component/spawnEntry instead of a separate set_field, or set it next frame. (host write seam)`
-        );
-      t.setField(e.eid, e.def, e.field, e.value);
-      return;
-    case "disable":
-      t.commands.disable(e.eid);
-      return;
-    case "enable":
-      t.commands.enable(e.eid);
-      return;
-    default:
-      return at(e, "HostCommand kind");
-  }
-}
-class Tn {
-  queued = [];
-  spawn(e, n) {
-    return this.queued.push({ kind: "spawn", components: e, onSpawned: n }), this;
-  }
-  despawn(e) {
-    return this.queued.push({ kind: "despawn", eid: e }), this;
-  }
-  /** Attach `def` (with complete `values`) to `entityId` (deferred to the
-   * drain). The namespaced-handle grammar — the queue is a commands buffer, so
-   * it drops the noun (`add`, not `addComponent`), matching `ctx.commands.add`
-   * and the queue's own bare `spawn`/`despawn`/`disable`/`enable`. Values are
-   * complete (transport carries explicit intent per field; see `spawnEntry`),
-   * unlike the authoring-side bundle sugar. */
-  add(e, n, r) {
-    return this.queued.push({ kind: "add_component", eid: e, def: n, values: r }), this;
-  }
-  /** Detach `def` from `entityId` (deferred to the drain). Bare `remove`
-   * matching `ctx.commands.remove` — see `add`. */
-  remove(e, n) {
-    return this.queued.push({ kind: "remove_component", eid: e, def: n }), this;
-  }
-  /** Set `field` of `def` on `entityId`. Applied IMMEDIATELY at the drain, unlike
-   * the deferred structural ops — so `def` must already be on `entityId`. Do NOT
-   * `add`/`spawn` `def` and `setField` it in the same frame: the add is
-   * still pending its flush when the immediate set runs (carry the value in
-   * `add`/`spawnEntry` instead). `applyHostCommand` throws an
-   * actionable error in `DEV` if you do. */
-  setField(e, n, r, s) {
-    return this.queued.push({ kind: "set_field", eid: e, def: n, field: r, value: s }), this;
-  }
-  disable(e) {
-    return this.queued.push({ kind: "disable", eid: e }), this;
-  }
-  enable(e) {
-    return this.queued.push({ kind: "enable", eid: e }), this;
-  }
-  /** Enqueue a pre-built command. The path for a SAB-ring codec, an editor's
-   * reified inverse, or a replay log — all of which produce `HostCommand` data
-   * directly rather than calling the typed sugar above. */
-  push(e) {
-    return this.queued.push(e), this;
-  }
-  /** Commands buffered but not yet applied. */
-  get pending() {
-    return this.queued.length;
-  }
-  /** Drop every buffered command without applying it — e.g. abandoning
-   * queued edits on a scene unload. Returns how many were dropped. Does not
-   * touch commands already drained into the world. */
-  clear() {
-    const e = this.queued.length;
-    return this.queued.length = 0, e;
-  }
-  /**
-   * Apply and clear every buffered command. Called by the blessed apply system
-   * inside its schedule span; not part of the host-facing surface. Returns the
-   * count applied.
-   *
-   * `tap`, when present, is invoked with each command in apply order just before
-   * it is applied — the record/replay hook ({@link HostCommandRecorder}). It is
-   * an OPT-IN observer: the tap-free path keeps the original tight loop, so an
-   * un-recorded drain pays nothing.
-   */
-  drain(e, n) {
-    const r = this.queued.length;
-    if (r === 0) return 0;
-    if (n === void 0)
-      for (let s = 0; s < r; s++) he(e, this.queued[s]);
-    else
-      for (let s = 0; s < r; s++) {
-        const o = this.queued[s];
-        n(o), he(e, o);
-      }
-    return this.queued.splice(0, r), r;
-  }
-}
-const nt = P - 1;
-function An(t) {
-  if (t === ye)
-    throw new v(
-      "cannot bind opCode 0 (reserved as the command-ring empty-slot marker)"
-    );
-  if (t < 0 || t > 255 || !Number.isInteger(t))
-    throw new v(`command opCode must be a u8 in [1, 255] (got ${t})`);
-}
-function ae(t) {
-  const e = new Uint8Array(nt);
-  return new DataView(e.buffer).setUint32(0, t, !0), e;
-}
-function ce(t) {
-  return new DataView(t.buffer, t.byteOffset, t.byteLength).getUint32(0, !0);
-}
-function Es(t, e) {
-  return {
-    encode(n) {
-      if (n.kind !== "set_field")
-        throw new v(
-          `ringSetFieldCodec encodes a "set_field" command (got "${n.kind}")`
-        );
-      const r = new Uint8Array(nt), s = new DataView(r.buffer);
-      return s.setUint32(0, n.eid, !0), s.setFloat64(4, n.value, !0), r;
-    },
-    decode(n) {
-      const r = new DataView(n.buffer, n.byteOffset, n.byteLength);
-      return {
-        kind: "set_field",
-        // boundary: branded-ID bridging — a decoded `u32` is an `EntityID` handle.
-        eid: r.getUint32(0, !0),
-        // schema-erased into the flat HostCommand union (the callable def is invariant in S).
-        def: t,
-        field: e,
-        value: r.getFloat64(4, !0)
-      };
-    }
-  };
-}
-function ps() {
-  return {
-    encode(t) {
-      if (t.kind !== "despawn")
-        throw new v(
-          `ringDespawnCodec encodes a "despawn" command (got "${t.kind}")`
-        );
-      return ae(t.eid);
-    },
-    decode: (t) => ({ kind: "despawn", eid: ce(t) })
-  };
-}
-function ys() {
-  return {
-    encode(t) {
-      if (t.kind !== "disable")
-        throw new v(
-          `ringDisableCodec encodes a "disable" command (got "${t.kind}")`
-        );
-      return ae(t.eid);
-    },
-    decode: (t) => ({ kind: "disable", eid: ce(t) })
-  };
-}
-function Ts() {
-  return {
-    encode(t) {
-      if (t.kind !== "enable")
-        throw new v(
-          `ringEnableCodec encodes an "enable" command (got "${t.kind}")`
-        );
-      return ae(t.eid);
-    },
-    decode: (t) => ({ kind: "enable", eid: ce(t) })
-  };
-}
-function As(t) {
-  return {
-    encode(e) {
-      if (e.kind !== "remove_component")
-        throw new v(
-          `ringRemoveComponentCodec encodes a "remove_component" command (got "${e.kind}")`
-        );
-      return ae(e.eid);
-    },
-    decode: (e) => ({ kind: "remove_component", eid: ce(e), def: t })
-  };
-}
-class Is {
-  appliers = /* @__PURE__ */ new Map();
-  /** Bind a raw ctx-aware applier to `opCode`. Re-binding replaces. */
-  on(e, n) {
-    return An(e), this.appliers.set(e, n), this;
-  }
-  /** Unbind `opCode`. Returns whether a binding was removed; subsequent
-   * slots carrying it hit the unknown-opcode path. */
-  off(e) {
-    return this.appliers.delete(e);
-  }
-  /** Bind a `HostCommand` codec to `opCode`: each matching slot is decoded and
-   * run through `applyHostCommand` — the SAME dispatch the typed queue uses.
-   * A drain-time `tap` (record/replay) sees the decoded command before it
-   * applies, so ring-sourced commands share one log with the typed transport. */
-  onCommand(e, n) {
-    return this.on(e, (r, s, o) => {
-      const i = n.decode(s);
-      o?.(i), he(r, i);
-    });
-  }
-  /** Drain every pending slot, dispatching each to its bound applier. Unbound
-   * opcodes are skipped (the read head still advances — matching
-   * `drainCommandRing` / `CommandDispatcher`). Returns slots drained. `tap`,
-   * when present, is forwarded to each applier as the record/replay hook;
-   * only `onCommand`-bound (generic `HostCommand`) opcodes surface to it. */
-  drain(e, n, r, s) {
-    return Ot(n, r, (o, i) => {
-      const a = this.appliers.get(o);
-      a !== void 0 && a(e, i, s);
-    });
-  }
-}
-const In = /* @__PURE__ */ new Set([
-  x.PRE_STARTUP,
-  x.STARTUP,
-  x.POST_STARTUP
-]), _e = /* @__PURE__ */ new WeakMap();
-function ws(t, e) {
-  const n = _e.get(e);
-  if (n === void 0) return !1;
-  for (const r of n) t.removeSystem(r);
-  return _e.delete(e), e.clear(), !0;
-}
-function Ss(t, e) {
-  const n = new Tn(), r = [];
-  _e.set(n, r);
-  const s = e?.name ?? "host_command_apply", o = e?.ring, i = e?.recorder, a = i?.record, c = e?.schedules ?? [x.PRE_STARTUP, x.PRE_UPDATE];
-  if (i !== void 0 && c.includes(x.FIXED_UPDATE))
-    throw new T(
-      y.INVALID_RECORDER_SCHEDULE,
-      "install_host_command_seam: a recorder cannot drain on SCHEDULE.FIXED_UPDATE — it would log the fixed-step dt instead of the host update(dt) and diverge on replay. Use a variable-update phase (PRE_UPDATE/UPDATE/POST_UPDATE)."
-    );
-  for (const d of c) {
-    const l = !In.has(d), f = t.registerSystem({
-      name: `${s}:${d}`,
-      // `reads`/`writes` are required by `SystemConfig` but empty here: the
-      // apply system declares nothing because it mutates components not known
-      // at registration. Full world access: the host may queue mutations to
-      // anything. The deferred-flush apply point is unchanged, so structural
-      // safety holds; `exclusive` only waives the DEV access check.
-      reads: [],
-      writes: [],
-      exclusive: !0,
-      fn: (h, g) => {
-        if (i !== void 0 && l && i.openTick(h.ecsTick, g), n.drain(h, a), o !== void 0) {
-          const p = t.columnStore, u = p.header.commandRingOff;
-          u !== 0 && o.drain(h, p.view, u, a);
-        }
-      }
-    });
-    t.addSystems(d, f), r.push(f);
-  }
-  return n;
-}
-export {
-  ss as $,
-  Jn as A,
-  N as B,
-  pt as C,
-  F as D,
-  T as E,
-  Ge as F,
-  ie as G,
-  te as H,
-  $n as I,
-  os as J,
-  ls as K,
-  A as L,
-  is as M,
-  vn as N,
-  us as O,
-  as as P,
-  Wn as Q,
-  nn as R,
-  m as S,
-  Oe as T,
-  bn as U,
-  ee as V,
-  U as W,
-  jn as X,
-  es as Y,
-  pe as Z,
-  Ee as _,
-  _t as a,
-  tn as a0,
-  Qe as a1,
-  Un as a2,
-  De as a3,
-  Re as a4,
-  He as a5,
-  Xn as a6,
-  Vn as a7,
-  rs as a8,
-  z as a9,
-  ps as aA,
-  ys as aB,
-  Ts as aC,
-  As as aD,
-  nt as aE,
-  $ as aF,
-  oe as aG,
-  Fn as aH,
-  Qn as aa,
-  qn as ab,
-  Kn as ac,
-  fs as ad,
-  ut as ae,
-  ms as af,
-  _s as ag,
-  Pn as ah,
-  xn as ai,
-  Ln as aj,
-  Mn as ak,
-  x as al,
-  hs as am,
-  Ss as an,
-  ws as ao,
-  he as ap,
-  Tn as aq,
-  gs as ar,
-  Me as as,
-  Cn as at,
-  W as au,
-  Be as av,
-  pn as aw,
-  yn as ax,
-  Is as ay,
-  Es as az,
-  ft as b,
-  ht as c,
-  zn as d,
-  en as e,
-  y as f,
-  L as g,
-  Q as h,
-  Rn as i,
-  Qt as j,
-  Hn as k,
-  cs as l,
-  ds as m,
-  Yn as n,
-  kn as o,
-  Bn as p,
-  ns as q,
-  Gn as r,
-  Ke as s,
-  Ae as t,
-  On as u,
-  Dn as v,
-  je as w,
-  K as x,
-  Zn as y,
-  ts as z
-};