@oasys/oecs 0.1.0 → 0.1.2

package/dist/index.js

@@ -1,37 +1,22 @@
-var F = Object.defineProperty;
-var X = (a, t, e) => t in a ? F(a, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : a[t] = e;
-var l = (a, t, e) => X(a, typeof t != "symbol" ? t + "" : t, e);
-class Y extends Error {
+class R extends Error {
   constructor(t, e, s) {
     super(t), this.is_operational = e, this.context = s, this.name = this.constructor.name, Error.captureStackTrace(this, this.constructor);
   }
 }
-var u = /* @__PURE__ */ ((a) => (a.EID_MAX_INDEX_OVERFLOW = "EID_MAX_INDEX_OVERFLOW", a.EID_MAX_GEN_OVERFLOW = "EID_MAX_GEN_OVERFLOW", a.COMPONENT_NOT_REGISTERED = "COMPONENT_NOT_REGISTERED", a.ENTITY_NOT_ALIVE = "ENTITY_NOT_ALIVE", a.CIRCULAR_SYSTEM_DEPENDENCY = "CIRCULAR_SYSTEM_DEPENDENCY", a.DUPLICATE_SYSTEM = "DUPLICATE_SYSTEM", a.ARCHETYPE_NOT_FOUND = "ARCHETYPE_NOT_FOUND", a))(u || {});
-class g extends Y {
+var q = /* @__PURE__ */ ((a) => (a.EID_MAX_INDEX_OVERFLOW = "EID_MAX_INDEX_OVERFLOW", a.EID_MAX_GEN_OVERFLOW = "EID_MAX_GEN_OVERFLOW", a.COMPONENT_NOT_REGISTERED = "COMPONENT_NOT_REGISTERED", a.ENTITY_NOT_ALIVE = "ENTITY_NOT_ALIVE", a.CIRCULAR_SYSTEM_DEPENDENCY = "CIRCULAR_SYSTEM_DEPENDENCY", a.DUPLICATE_SYSTEM = "DUPLICATE_SYSTEM", a.ARCHETYPE_NOT_FOUND = "ARCHETYPE_NOT_FOUND", a))(q || {});
+class Y extends R {
   constructor(t, e, s) {
     super(e ?? t, !0, s), this.category = t;
   }
 }
-var C = /* @__PURE__ */ ((a) => (a.ASSERTION_FAIL_CONDITION = "ASSERTION_FAIL_CONDITION", a.VALIDATION_FAIL_CONDITION = "VALIDATION_FAIL_CONDITION", a))(C || {});
-class G extends Y {
-  constructor(t, e, s) {
-    super(e, !1, s), this.category = t;
-  }
-}
-const P = (a) => Number.isInteger(a) && a >= 0;
 function b(a, t, e) {
-  if (process.env.NODE_ENV !== "production" && !t(a))
-    throw new G(
-      C.VALIDATION_FAIL_CONDITION,
-      `Expected value to meet validation: ${e}`
-    );
   return a;
 }
-const $ = 4;
-class T {
+const X = 4;
+class v {
+  _words;
   constructor(t) {
-    l(this, "_words");
-    this._words = t ?? new Array($).fill(0);
+    this._words = t ?? new Array(X).fill(0);
   }
   has(t) {
     const e = t >>> 5;
@@ -56,8 +41,8 @@ class T {
   contains(t) {
     const e = t._words, s = this._words, n = s.length;
     for (let r = 0; r < e.length; r++) {
-      const o = e[r];
-      if (o !== 0 && (r >= n || (s[r] & o) !== o))
+      const i = e[r];
+      if (i !== 0 && (r >= n || (s[r] & i) !== i))
         return !1;
     }
     return !0;
@@ -65,22 +50,22 @@ class T {
   equals(t) {
     const e = this._words, s = t._words, n = e.length > s.length ? e.length : s.length;
     for (let r = 0; r < n; r++) {
-      const o = r < e.length ? e[r] : 0, _ = r < s.length ? s[r] : 0;
-      if (o !== _) return !1;
+      const i = r < e.length ? e[r] : 0, _ = r < s.length ? s[r] : 0;
+      if (i !== _) return !1;
     }
     return !0;
   }
   copy() {
-    return new T(this._words.slice());
+    return new v(this._words.slice());
   }
   copy_with_set(t) {
     const e = t >>> 5, s = e + 1, n = this._words.length > s ? this._words.length : s, r = new Array(n).fill(0);
-    for (let o = 0; o < this._words.length; o++) r[o] = this._words[o];
-    return r[e] |= 1 << (t & 31), new T(r);
+    for (let i = 0; i < this._words.length; i++) r[i] = this._words[i];
+    return r[e] |= 1 << (t & 31), new v(r);
   }
   copy_with_clear(t) {
     const e = this._words.slice(), s = t >>> 5;
-    return s < e.length && (e[s] &= ~(1 << (t & 31))), new T(e);
+    return s < e.length && (e[s] &= ~(1 << (t & 31))), new v(e);
   }
   /** FNV-1a hash. Skips trailing zero words so differently-sized arrays with the same bits hash equally. */
   hash() {
@@ -100,8 +85,8 @@ class T {
       if (n === 0) continue;
       const r = s << 5;
       for (; n !== 0; ) {
-        const o = n & -n >>> 0, _ = 31 - Math.clz32(o);
-        t(r + _), n ^= o;
+        const i = n & -n >>> 0, _ = 31 - Math.clz32(i);
+        t(r + _), n ^= i;
       }
     }
   }
@@ -113,28 +98,16 @@ class T {
     this._words = s;
   }
 }
-const D = 20, S = (1 << D) - 1, z = S, W = 31 - D, k = (1 << W) - 1, B = (a, t) => {
-  if (process.env.NODE_ENV !== "production") {
-    if (a < 0 || a > z)
-      throw new g(u.EID_MAX_INDEX_OVERFLOW);
-    if (t < 0 || t > k)
-      throw new g(u.EID_MAX_GEN_OVERFLOW);
-  }
-  return t << D | a;
-}, m = (a) => a & S, R = (a) => a >> D, Q = (a) => b(
-  a,
-  P,
-  "ComponentID must be a non-negative integer"
-), K = (a) => b(
-  a,
-  P,
-  "EventID must be a non-negative integer"
+const A = 20, P = (1 << A) - 1, L = 31 - A, U = (1 << L) - 1, F = (a, t) => t << A | a, f = (a) => a & P, M = (a) => a >> A, z = (a) => b(
+  a
+), V = (a) => b(
+  a
 );
-class J {
+class C {
+  field_names;
+  columns;
+  reader;
   constructor(t) {
-    l(this, "field_names");
-    l(this, "columns");
-    l(this, "reader");
     this.field_names = t, this.columns = [];
     for (let s = 0; s < t.length; s++)
       this.columns.push([]);
@@ -160,36 +133,34 @@ class J {
       t[e].length = 0;
   }
 }
-const Z = (a) => b(
-  a,
-  P,
-  "ArchetypeID must be a non-negative integer"
+const G = (a) => b(
+  a
 );
-class H {
+class W {
+  id;
+  mask;
+  has_columns;
+  entity_ids = [];
+  length = 0;
+  edges = [];
+  // Sparse array indexed by ComponentID — undefined for absent components.
+  // Allows O(1) column group lookup by component.
+  column_groups = [];
+  // Dense list of ComponentIDs that have columns — used to iterate only
+  // data-bearing components in copy/add/remove operations.
+  _column_ids = [];
   constructor(t, e, s) {
-    l(this, "id");
-    l(this, "mask");
-    l(this, "has_columns");
-    l(this, "entity_ids", []);
-    l(this, "length", 0);
-    l(this, "edges", []);
-    // Sparse array indexed by ComponentID — undefined for absent components.
-    // Allows O(1) column group lookup by component.
-    l(this, "column_groups", []);
-    // Dense list of ComponentIDs that have columns — used to iterate only
-    // data-bearing components in copy/add/remove operations.
-    l(this, "_column_ids", []);
     if (this.id = t, this.mask = e, s)
       for (let n = 0; n < s.length; n++) {
-        const r = s[n], o = new Array(r.field_names.length);
+        const r = s[n], i = new Array(r.field_names.length);
         for (let h = 0; h < r.field_names.length; h++)
-          o[h] = [];
+          i[h] = [];
         const _ = /* @__PURE__ */ Object.create(null);
         for (let h = 0; h < r.field_names.length; h++)
-          _[r.field_names[h]] = o[h];
+          _[r.field_names[h]] = i[h];
         this.column_groups[r.component_id] = {
           layout: r,
-          columns: o,
+          columns: i,
           record: _
         }, this._column_ids.push(r.component_id);
       }
@@ -209,18 +180,7 @@ class H {
   }
   /** Get a single field's column. Valid data: indices 0..entity_count-1. */
   get_column(t, e) {
-    const s = this.column_groups[t];
-    if (process.env.NODE_ENV !== "production" && !s)
-      throw new g(
-        u.COMPONENT_NOT_REGISTERED,
-        `Component ${t} not in archetype ${this.id}`
-      );
-    const n = s.layout.field_index[e];
-    if (process.env.NODE_ENV !== "production" && n === void 0)
-      throw new g(
-        u.COMPONENT_NOT_REGISTERED,
-        `Field "${e}" does not exist on component`
-      );
+    const s = this.column_groups[t], n = s.layout.field_index[e];
     return s.columns[n];
   }
   /** Get all columns for a component as { fieldName: number[] }. */
@@ -232,8 +192,8 @@ class H {
     const n = this.column_groups[e];
     if (!n) return;
     const { field_names: r } = n.layout;
-    for (let o = 0; o < r.length; o++)
-      n.columns[o][t] = s[r[o]];
+    for (let i = 0; i < r.length; i++)
+      n.columns[i][t] = s[r[i]];
   }
   read_field(t, e, s) {
     const n = this.column_groups[e];
@@ -244,12 +204,12 @@ class H {
   /** Copy all shared component columns from source archetype at src_row into dst_row. */
   copy_shared_from(t, e, s) {
     const n = t.column_groups, r = this._column_ids;
-    for (let o = 0; o < r.length; o++) {
-      const _ = r[o], h = n[_];
+    for (let i = 0; i < r.length; i++) {
+      const _ = r[i], h = n[_];
       if (!h) continue;
-      const i = this.column_groups[_];
-      for (let c = 0; c < i.columns.length; c++)
-        i.columns[c][s] = h.columns[c][e];
+      const o = this.column_groups[_];
+      for (let c = 0; c < o.columns.length; c++)
+        o.columns[c][s] = h.columns[c][e];
     }
   }
   /**
@@ -262,8 +222,8 @@ class H {
     const s = this._column_ids;
     for (let n = 0; n < s.length; n++) {
       const r = this.column_groups[s[n]];
-      for (let o = 0; o < r.columns.length; o++)
-        r.columns[o].push(0);
+      for (let i = 0; i < r.columns.length; i++)
+        r.columns[i].push(0);
     }
     return this.length++, e;
   }
@@ -277,17 +237,17 @@ class H {
     let s = -1;
     const n = this._column_ids;
     if (t !== e) {
-      this.entity_ids[t] = this.entity_ids[e], s = m(this.entity_ids[t]);
+      this.entity_ids[t] = this.entity_ids[e], s = f(this.entity_ids[t]);
       for (let r = 0; r < n.length; r++) {
-        const o = this.column_groups[n[r]];
-        for (let _ = 0; _ < o.columns.length; _++)
-          o.columns[_][t] = o.columns[_][e], o.columns[_].pop();
+        const i = this.column_groups[n[r]];
+        for (let _ = 0; _ < i.columns.length; _++)
+          i.columns[_][t] = i.columns[_][e], i.columns[_].pop();
       }
     } else
       for (let r = 0; r < n.length; r++) {
-        const o = this.column_groups[n[r]];
-        for (let _ = 0; _ < o.columns.length; _++)
-          o.columns[_].pop();
+        const i = this.column_groups[n[r]];
+        for (let _ = 0; _ < i.columns.length; _++)
+          i.columns[_].pop();
       }
     return this.entity_ids.pop(), this.length--, s;
   }
@@ -300,7 +260,7 @@ class H {
   remove_entity_tag(t) {
     const e = this.length - 1;
     let s = -1;
-    return t !== e && (this.entity_ids[t] = this.entity_ids[e], s = m(this.entity_ids[t])), this.entity_ids.pop(), this.length--, s;
+    return t !== e && (this.entity_ids[t] = this.entity_ids[e], s = f(this.entity_ids[t])), this.entity_ids.pop(), this.length--, s;
   }
   get_edge(t) {
     return this.edges[t];
@@ -313,61 +273,56 @@ function j(a, t, e) {
   const s = a.get(t);
   s !== void 0 ? s.push(e) : a.set(t, [e]);
 }
-const w = -1, M = Object.freeze(/* @__PURE__ */ Object.create(null));
-class tt {
+const y = -1, S = Object.freeze(/* @__PURE__ */ Object.create(null));
+class $ {
+  // --- Entity ID management ---
+  // Generational slot allocator: entity_generations[index] holds the current
+  // generation for that slot. Free indices are recycled via a stack.
+  entity_generations = [];
+  entity_high_water = 0;
+  entity_free_indices = [];
+  entity_alive_count = 0;
+  // --- Component metadata ---
+  // Parallel array indexed by ComponentID: field_names and field_index
+  // for building archetype column layouts.
+  component_metas = [];
+  component_count = 0;
+  // --- Event channels ---
+  // Parallel array indexed by EventID: each channel holds SoA columns + reader.
+  event_channels = [];
+  event_count = 0;
+  // --- Archetype management ---
+  archetypes = [];
+  // Hash-bucketed lookup: BitSet.hash() → ArchetypeID[] for deduplication
+  archetype_map = /* @__PURE__ */ new Map();
+  next_archetype_id = 0;
+  // Inverted index: ComponentID → set of ArchetypeIDs containing that component.
+  // Used by get_matching_archetypes to start from the smallest set.
+  component_index = /* @__PURE__ */ new Map();
+  // Registered queries: the Store pushes newly-created archetypes into matching
+  // query result arrays, so queries are always up-to-date.
+  registered_queries = [];
+  empty_archetype_id;
+  // entity_index → ArchetypeID (UNASSIGNED = not in any archetype)
+  entity_archetype = [];
+  // entity_index → row within its archetype (UNASSIGNED = no row)
+  entity_row = [];
+  // --- Deferred operation buffers ---
+  // Flat parallel arrays: pending_add_ids[i], pending_add_defs[i], pending_add_values[i]
+  // describe one deferred add. No per-operation object allocation.
+  pending_destroy = [];
+  pending_add_ids = [];
+  pending_add_defs = [];
+  pending_add_values = [];
+  pending_remove_ids = [];
+  pending_remove_defs = [];
   constructor() {
-    // --- Entity ID management ---
-    // Generational slot allocator: entity_generations[index] holds the current
-    // generation for that slot. Free indices are recycled via a stack.
-    l(this, "entity_generations", []);
-    l(this, "entity_high_water", 0);
-    l(this, "entity_free_indices", []);
-    l(this, "entity_alive_count", 0);
-    // --- Component metadata ---
-    // Parallel array indexed by ComponentID: field_names and field_index
-    // for building archetype column layouts.
-    l(this, "component_metas", []);
-    l(this, "component_count", 0);
-    // --- Event channels ---
-    // Parallel array indexed by EventID: each channel holds SoA columns + reader.
-    l(this, "event_channels", []);
-    l(this, "event_count", 0);
-    // --- Archetype management ---
-    l(this, "archetypes", []);
-    // Hash-bucketed lookup: BitSet.hash() → ArchetypeID[] for deduplication
-    l(this, "archetype_map", /* @__PURE__ */ new Map());
-    l(this, "next_archetype_id", 0);
-    // Inverted index: ComponentID → set of ArchetypeIDs containing that component.
-    // Used by get_matching_archetypes to start from the smallest set.
-    l(this, "component_index", /* @__PURE__ */ new Map());
-    // Registered queries: the Store pushes newly-created archetypes into matching
-    // query result arrays, so queries are always up-to-date.
-    l(this, "registered_queries", []);
-    l(this, "empty_archetype_id");
-    // entity_index → ArchetypeID (UNASSIGNED = not in any archetype)
-    l(this, "entity_archetype", []);
-    // entity_index → row within its archetype (UNASSIGNED = no row)
-    l(this, "entity_row", []);
-    // --- Deferred operation buffers ---
-    // Flat parallel arrays: pending_add_ids[i], pending_add_defs[i], pending_add_values[i]
-    // describe one deferred add. No per-operation object allocation.
-    l(this, "pending_destroy", []);
-    l(this, "pending_add_ids", []);
-    l(this, "pending_add_defs", []);
-    l(this, "pending_add_values", []);
-    l(this, "pending_remove_ids", []);
-    l(this, "pending_remove_defs", []);
-    this.empty_archetype_id = this.arch_get_or_create_from_mask(new T());
+    this.empty_archetype_id = this.arch_get_or_create_from_mask(new v());
   }
   // =======================================================
   // Archetype graph
   // =======================================================
   arch_get(t) {
-    if (process.env.NODE_ENV !== "production" && (t < 0 || t >= this.archetypes.length))
-      throw new g(
-        u.ARCHETYPE_NOT_FOUND,
-        `Archetype with ID ${t} not found`
-      );
     return this.archetypes[t];
   }
   /**
@@ -381,25 +336,25 @@ class tt {
         if (this.archetypes[s[h]].mask.equals(t))
           return s[h];
     }
-    const n = Z(this.next_archetype_id++), r = [];
+    const n = G(this.next_archetype_id++), r = [];
     t.for_each((h) => {
-      const i = h, c = this.component_metas[i];
+      const o = h, c = this.component_metas[o];
       c && c.field_names.length > 0 && r.push({
-        component_id: i,
+        component_id: o,
         field_names: c.field_names,
         field_index: c.field_index
       });
     });
-    const o = new H(n, t, r);
-    this.archetypes.push(o), j(this.archetype_map, e, n), t.for_each((h) => {
-      const i = h;
-      let c = this.component_index.get(i);
-      c || (c = /* @__PURE__ */ new Set(), this.component_index.set(i, c)), c.add(n);
+    const i = new W(n, t, r);
+    this.archetypes.push(i), j(this.archetype_map, e, n), t.for_each((h) => {
+      const o = h;
+      let c = this.component_index.get(o);
+      c || (c = /* @__PURE__ */ new Set(), this.component_index.set(o, c)), c.add(n);
     });
     const _ = this.registered_queries;
     for (let h = 0; h < _.length; h++) {
-      const i = _[h];
-      o.matches(i.include_mask) && (!i.exclude_mask || !o.mask.overlaps(i.exclude_mask)) && (!i.any_of_mask || o.mask.overlaps(i.any_of_mask)) && i.result.push(o);
+      const o = _[h];
+      i.matches(o.include_mask) && (!o.exclude_mask || !i.mask.overlaps(o.exclude_mask)) && (!o.any_of_mask || i.mask.overlaps(o.any_of_mask)) && o.result.push(i);
     }
     return n;
   }
@@ -408,7 +363,7 @@ class tt {
     const s = this.arch_get(t);
     if (s.mask.has(e)) return t;
     const n = s.get_edge(e);
-    if ((n == null ? void 0 : n.add) != null) return n.add;
+    if (n?.add != null) return n.add;
     const r = this.arch_get_or_create_from_mask(
       s.mask.copy_with_set(e)
     );
@@ -419,7 +374,7 @@ class tt {
     const s = this.arch_get(t);
     if (!s.mask.has(e)) return t;
     const n = s.get_edge(e);
-    if ((n == null ? void 0 : n.remove) != null) return n.remove;
+    if (n?.remove != null) return n.remove;
     const r = this.arch_get_or_create_from_mask(
       s.mask.copy_with_clear(e)
     );
@@ -441,29 +396,25 @@ class tt {
   create_entity() {
     let t, e;
     this.entity_free_indices.length > 0 ? (t = this.entity_free_indices.pop(), e = this.entity_generations[t]) : (t = this.entity_high_water++, this.entity_generations[t] = 0, e = 0), this.entity_alive_count++;
-    const s = B(t, e);
-    return this.entity_archetype[t] = this.empty_archetype_id, this.entity_row[t] = w, s;
+    const s = F(t, e);
+    return this.entity_archetype[t] = this.empty_archetype_id, this.entity_row[t] = y, s;
   }
   /** Immediately destroy an entity, removing it from its archetype. */
   destroy_entity(t) {
-    if (!this.is_alive(t)) {
-      if (process.env.NODE_ENV !== "production") throw new g(u.ENTITY_NOT_ALIVE);
+    if (!this.is_alive(t))
       return;
+    const e = f(t), s = this.entity_row[e];
+    if (s !== y) {
+      const i = this.arch_get(this.entity_archetype[e]).remove_entity(s);
+      i !== -1 && (this.entity_row[i] = s);
     }
-    const e = m(t), s = this.entity_row[e];
-    if (s !== w) {
-      const o = this.arch_get(this.entity_archetype[e]).remove_entity(s);
-      o !== -1 && (this.entity_row[o] = s);
-    }
-    this.entity_archetype[e] = w, this.entity_row[e] = w;
-    const n = R(t);
-    if (process.env.NODE_ENV !== "production" && n >= k)
-      throw new g(u.EID_MAX_GEN_OVERFLOW);
-    this.entity_generations[e] = n + 1 & k, this.entity_free_indices.push(e), this.entity_alive_count--;
+    this.entity_archetype[e] = y, this.entity_row[e] = y;
+    const n = M(t);
+    this.entity_generations[e] = n + 1 & U, this.entity_free_indices.push(e), this.entity_alive_count--;
   }
   is_alive(t) {
-    const e = m(t);
-    return e < this.entity_high_water && this.entity_generations[e] === R(t);
+    const e = f(t);
+    return e < this.entity_high_water && this.entity_generations[e] === M(t);
   }
   get entity_count() {
     return this.entity_alive_count;
@@ -472,26 +423,22 @@ class tt {
   // Deferred destruction
   // =======================================================
   destroy_entity_deferred(t) {
-    if (process.env.NODE_ENV !== "production" && !this.is_alive(t))
-      throw new g(u.ENTITY_NOT_ALIVE);
     this.pending_destroy.push(t);
   }
   /** Flush all buffered entity destructions in batch. */
   flush_destroyed() {
     const t = this.pending_destroy;
     if (t.length === 0) return;
-    const e = this.entity_archetype, s = this.entity_row, n = this.entity_generations, r = this.archetypes, o = this.entity_high_water;
+    const e = this.entity_archetype, s = this.entity_row, n = this.entity_generations, r = this.archetypes, i = this.entity_high_water;
     for (let _ = 0; _ < t.length; _++) {
-      const h = t[_], i = h & S, c = h >> D;
-      if (i >= o || n[i] !== c) continue;
-      const d = s[i];
-      if (d !== w) {
-        const f = r[e[i]], p = f.has_columns ? f.remove_entity(d) : f.remove_entity_tag(d);
-        p !== -1 && (s[p] = d);
+      const h = t[_], o = h & P, c = h >> A;
+      if (o >= i || n[o] !== c) continue;
+      const l = s[o];
+      if (l !== y) {
+        const u = r[e[o]], d = u.has_columns ? u.remove_entity(l) : u.remove_entity_tag(l);
+        d !== -1 && (s[d] = l);
       }
-      if (e[i] = w, s[i] = w, process.env.NODE_ENV !== "production" && c >= k)
-        throw new g(u.EID_MAX_GEN_OVERFLOW);
-      n[i] = c + 1 & k, this.entity_free_indices.push(i), this.entity_alive_count--;
+      e[o] = y, s[o] = y, n[o] = c + 1 & U, this.entity_free_indices.push(o), this.entity_alive_count--;
     }
     t.length = 0;
   }
@@ -499,13 +446,9 @@ class tt {
     return this.pending_destroy.length;
   }
   add_component_deferred(t, e, s) {
-    if (process.env.NODE_ENV !== "production" && !this.is_alive(t))
-      throw new g(u.ENTITY_NOT_ALIVE);
-    this.pending_add_ids.push(t), this.pending_add_defs.push(e), this.pending_add_values.push(s ?? M);
+    this.pending_add_ids.push(t), this.pending_add_defs.push(e), this.pending_add_values.push(s ?? S);
   }
   remove_component_deferred(t, e) {
-    if (process.env.NODE_ENV !== "production" && !this.is_alive(t))
-      throw new g(u.ENTITY_NOT_ALIVE);
     this.pending_remove_ids.push(t), this.pending_remove_defs.push(e);
   }
   flush_structural() {
@@ -513,37 +456,37 @@ class tt {
   }
   /** Batch-apply all deferred component additions. */
   _flush_adds() {
-    const t = this.pending_add_ids, e = this.pending_add_defs, s = this.pending_add_values, n = t.length, r = this.entity_archetype, o = this.entity_row, _ = this.entity_generations, h = this.archetypes, i = this.component_metas, c = this.entity_high_water;
-    for (let d = 0; d < n; d++) {
-      const f = t[d], p = f & S, v = f >> D;
-      if (p >= c || _[p] !== v) continue;
-      const O = r[p], E = e[d], y = h[O];
-      if (y.mask.has(E)) {
-        i[E].field_names.length > 0 && y.write_fields(o[p], E, s[d]);
+    const t = this.pending_add_ids, e = this.pending_add_defs, s = this.pending_add_values, n = t.length, r = this.entity_archetype, i = this.entity_row, _ = this.entity_generations, h = this.archetypes, o = this.component_metas, c = this.entity_high_water;
+    for (let l = 0; l < n; l++) {
+      const u = t[l], d = u & P, p = u >> A;
+      if (d >= c || _[d] !== p) continue;
+      const x = r[d], m = e[l], g = h[x];
+      if (g.mask.has(m)) {
+        o[m].field_names.length > 0 && g.write_fields(i[d], m, s[l]);
         continue;
       }
-      const A = this.arch_resolve_add(O, E), N = h[A], I = o[p], x = !N.has_columns && !y.has_columns, V = x ? N.add_entity_tag(f) : N.add_entity(f);
-      if (I !== w) {
-        x || N.copy_shared_from(y, I, V);
-        const q = x ? y.remove_entity_tag(I) : y.remove_entity(I);
-        q !== -1 && (o[q] = I);
+      const E = this.arch_resolve_add(x, m), w = h[E], T = i[d], k = !w.has_columns && !g.has_columns, N = k ? w.add_entity_tag(u) : w.add_entity(u);
+      if (T !== y) {
+        k || w.copy_shared_from(g, T, N);
+        const I = k ? g.remove_entity_tag(T) : g.remove_entity(T);
+        I !== -1 && (i[I] = T);
       }
-      i[E].field_names.length > 0 && N.write_fields(V, E, s[d]), r[p] = A, o[p] = V;
+      o[m].field_names.length > 0 && w.write_fields(N, m, s[l]), r[d] = E, i[d] = N;
     }
     t.length = 0, e.length = 0, s.length = 0;
   }
   /** Batch-apply all deferred component removals. */
   _flush_removes() {
-    const t = this.pending_remove_ids, e = this.pending_remove_defs, s = t.length, n = this.entity_archetype, r = this.entity_row, o = this.entity_generations, _ = this.archetypes, h = this.entity_high_water;
-    for (let i = 0; i < s; i++) {
-      const c = t[i], d = c & S, f = c >> D;
-      if (d >= h || o[d] !== f) continue;
-      const p = n[d], v = e[i], O = _[p];
-      if (!O.mask.has(v)) continue;
-      const E = this.arch_resolve_remove(p, v), y = _[E], A = r[d], N = !y.has_columns && !O.has_columns, I = N ? y.add_entity_tag(c) : y.add_entity(c);
-      N || y.copy_shared_from(O, A, I);
-      const x = N ? O.remove_entity_tag(A) : O.remove_entity(A);
-      x !== -1 && (r[x] = A), n[d] = E, r[d] = I;
+    const t = this.pending_remove_ids, e = this.pending_remove_defs, s = t.length, n = this.entity_archetype, r = this.entity_row, i = this.entity_generations, _ = this.archetypes, h = this.entity_high_water;
+    for (let o = 0; o < s; o++) {
+      const c = t[o], l = c & P, u = c >> A;
+      if (l >= h || i[l] !== u) continue;
+      const d = n[l], p = e[o], x = _[d];
+      if (!x.mask.has(p)) continue;
+      const m = this.arch_resolve_remove(d, p), g = _[m], E = r[l], w = !g.has_columns && !x.has_columns, T = w ? g.add_entity_tag(c) : g.add_entity(c);
+      w || g.copy_shared_from(x, E, T);
+      const k = w ? x.remove_entity_tag(E) : x.remove_entity(E);
+      k !== -1 && (r[k] = E), n[l] = m, r[l] = T;
     }
     t.length = 0, e.length = 0;
   }
@@ -554,19 +497,17 @@ class tt {
   // Component registration
   // =======================================================
   register_component(t) {
-    const e = Q(this.component_count++), s = t, n = /* @__PURE__ */ Object.create(null);
+    const e = z(this.component_count++), s = t, n = /* @__PURE__ */ Object.create(null);
     for (let r = 0; r < s.length; r++)
       n[s[r]] = r;
     return this.component_metas.push({ field_names: s, field_index: n }), e;
   }
   add_component(t, e, s) {
-    if (!this.is_alive(t)) {
-      if (process.env.NODE_ENV !== "production") throw new g(u.ENTITY_NOT_ALIVE);
+    if (!this.is_alive(t))
       return;
-    }
-    const n = m(t), r = this.entity_archetype[n], o = this.arch_get(r);
-    if (o.has_component(e)) {
-      o.write_fields(
+    const n = f(t), r = this.entity_archetype[n], i = this.arch_get(r);
+    if (i.has_component(e)) {
+      i.write_fields(
         this.entity_row[n],
         e,
         s
@@ -576,11 +517,11 @@ class tt {
     const _ = this.arch_resolve_add(
       r,
       e
-    ), h = this.arch_get(_), i = this.entity_row[n], c = h.add_entity(t);
-    if (i !== w) {
-      h.copy_shared_from(o, i, c);
-      const d = o.remove_entity(i);
-      d !== -1 && (this.entity_row[d] = i);
+    ), h = this.arch_get(_), o = this.entity_row[n], c = h.add_entity(t);
+    if (o !== y) {
+      h.copy_shared_from(i, o, c);
+      const l = i.remove_entity(o);
+      l !== -1 && (this.entity_row[l] = o);
     }
     h.write_fields(
       c,
@@ -590,81 +531,73 @@ class tt {
   }
   /** Add multiple components in one transition (resolves final archetype, then moves once). */
   add_components(t, e) {
-    if (!this.is_alive(t)) {
-      if (process.env.NODE_ENV !== "production") throw new g(u.ENTITY_NOT_ALIVE);
+    if (!this.is_alive(t))
       return;
-    }
-    const s = m(t), n = this.entity_archetype[s];
+    const s = f(t), n = this.entity_archetype[s];
     let r = n;
-    for (let o = 0; o < e.length; o++)
+    for (let i = 0; i < e.length; i++)
       r = this.arch_resolve_add(
         r,
-        e[o].def
+        e[i].def
       );
     if (r !== n) {
-      const o = this.arch_get(n), _ = this.arch_get(r), h = this.entity_row[s], i = _.add_entity(t);
-      if (h !== w) {
-        _.copy_shared_from(o, h, i);
-        const c = o.remove_entity(h);
+      const i = this.arch_get(n), _ = this.arch_get(r), h = this.entity_row[s], o = _.add_entity(t);
+      if (h !== y) {
+        _.copy_shared_from(i, h, o);
+        const c = i.remove_entity(h);
         c !== -1 && (this.entity_row[c] = h);
       }
       for (let c = 0; c < e.length; c++)
         _.write_fields(
-          i,
+          o,
           e[c].def,
-          e[c].values ?? M
+          e[c].values ?? S
         );
-      this.entity_archetype[s] = r, this.entity_row[s] = i;
+      this.entity_archetype[s] = r, this.entity_row[s] = o;
     } else {
-      const o = this.arch_get(n), _ = this.entity_row[s];
+      const i = this.arch_get(n), _ = this.entity_row[s];
       for (let h = 0; h < e.length; h++)
-        o.write_fields(
+        i.write_fields(
           _,
           e[h].def,
-          e[h].values ?? M
+          e[h].values ?? S
         );
     }
   }
   remove_component(t, e) {
-    if (!this.is_alive(t)) {
-      if (process.env.NODE_ENV !== "production") throw new g(u.ENTITY_NOT_ALIVE);
+    if (!this.is_alive(t))
       return;
-    }
-    const s = m(t), n = this.entity_archetype[s], r = this.arch_get(n);
+    const s = f(t), n = this.entity_archetype[s], r = this.arch_get(n);
     if (!r.has_component(e)) return;
-    const o = this.arch_resolve_remove(
+    const i = this.arch_resolve_remove(
       n,
       e
-    ), _ = this.arch_get(o), h = this.entity_row[s], i = _.add_entity(t);
-    _.copy_shared_from(r, h, i);
+    ), _ = this.arch_get(i), h = this.entity_row[s], o = _.add_entity(t);
+    _.copy_shared_from(r, h, o);
     const c = r.remove_entity(h);
-    c !== -1 && (this.entity_row[c] = h), this.entity_archetype[s] = o, this.entity_row[s] = i;
+    c !== -1 && (this.entity_row[c] = h), this.entity_archetype[s] = i, this.entity_row[s] = o;
   }
   /** Remove multiple components in one transition (resolves final archetype, then moves once). */
   remove_components(t, e) {
-    if (!this.is_alive(t)) {
-      if (process.env.NODE_ENV !== "production") throw new g(u.ENTITY_NOT_ALIVE);
+    if (!this.is_alive(t))
       return;
-    }
-    const s = m(t), n = this.entity_archetype[s];
+    const s = f(t), n = this.entity_archetype[s];
     let r = n;
-    for (let d = 0; d < e.length; d++)
+    for (let l = 0; l < e.length; l++)
       r = this.arch_resolve_remove(
         r,
-        e[d]
+        e[l]
       );
     if (r === n) return;
-    const o = this.arch_get(n), _ = this.arch_get(r), h = this.entity_row[s], i = _.add_entity(t);
-    _.copy_shared_from(o, h, i);
-    const c = o.remove_entity(h);
-    c !== -1 && (this.entity_row[c] = h), this.entity_archetype[s] = r, this.entity_row[s] = i;
+    const i = this.arch_get(n), _ = this.arch_get(r), h = this.entity_row[s], o = _.add_entity(t);
+    _.copy_shared_from(i, h, o);
+    const c = i.remove_entity(h);
+    c !== -1 && (this.entity_row[c] = h), this.entity_archetype[s] = r, this.entity_row[s] = o;
   }
   has_component(t, e) {
-    if (!this.is_alive(t)) {
-      if (process.env.NODE_ENV !== "production") throw new g(u.ENTITY_NOT_ALIVE);
+    if (!this.is_alive(t))
       return !1;
-    }
-    const s = m(t);
+    const s = f(t);
     return this.arch_get(
       this.entity_archetype[s]
     ).has_component(e);
@@ -674,11 +607,11 @@ class tt {
   // =======================================================
   get_entity_archetype(t) {
     return this.arch_get(
-      this.entity_archetype[m(t)]
+      this.entity_archetype[f(t)]
     );
   }
   get_entity_row(t) {
-    return this.entity_row[m(t)];
+    return this.entity_row[f(t)];
   }
   // =======================================================
   // Query support
@@ -691,36 +624,36 @@ class tt {
   get_matching_archetypes(t, e, s) {
     const n = t._words;
     let r = !1;
-    for (let i = 0; i < n.length; i++)
-      if (n[i] !== 0) {
+    for (let o = 0; o < n.length; o++)
+      if (n[o] !== 0) {
         r = !0;
         break;
       }
     if (!r)
       return this.archetypes.filter(
-        (i) => (!e || !i.mask.overlaps(e)) && (!s || i.mask.overlaps(s))
+        (o) => (!e || !o.mask.overlaps(e)) && (!s || o.mask.overlaps(s))
       );
-    let o, _ = !1;
-    for (let i = 0; i < n.length; i++) {
-      let c = n[i];
+    let i, _ = !1;
+    for (let o = 0; o < n.length; o++) {
+      let c = n[o];
       if (c === 0) continue;
-      const d = i << 5;
+      const l = o << 5;
       for (; c !== 0; ) {
-        const f = c & -c >>> 0, p = d + (31 - Math.clz32(f));
-        c ^= f;
-        const v = this.component_index.get(p);
-        if (!v || v.size === 0) {
+        const u = c & -c >>> 0, d = l + (31 - Math.clz32(u));
+        c ^= u;
+        const p = this.component_index.get(d);
+        if (!p || p.size === 0) {
           _ = !0;
           break;
         }
-        (!o || v.size < o.size) && (o = v);
+        (!i || p.size < i.size) && (i = p);
       }
       if (_) break;
     }
-    if (_ || !o) return [];
+    if (_ || !i) return [];
     const h = [];
-    for (const i of o) {
-      const c = this.arch_get(i);
+    for (const o of i) {
+      const c = this.arch_get(o);
       c.matches(t) && (!e || !c.mask.overlaps(e)) && (!s || c.mask.overlaps(s)) && h.push(c);
     }
     return h;
@@ -749,7 +682,7 @@ class tt {
   // Event channels
   // =======================================================
   register_event(t) {
-    const e = K(this.event_count++), s = new J(t);
+    const e = V(this.event_count++), s = new C(t);
     return this.event_channels.push(s), e;
   }
   emit_event(t, e) {
@@ -767,44 +700,39 @@ class tt {
       t[e].clear();
   }
 }
-var et = /* @__PURE__ */ ((a) => (a.PRE_STARTUP = "PRE_STARTUP", a.STARTUP = "STARTUP", a.POST_STARTUP = "POST_STARTUP", a.PRE_UPDATE = "PRE_UPDATE", a.UPDATE = "UPDATE", a.POST_UPDATE = "POST_UPDATE", a))(et || {});
-const L = [
+var B = /* @__PURE__ */ ((a) => (a.PRE_STARTUP = "PRE_STARTUP", a.STARTUP = "STARTUP", a.POST_STARTUP = "POST_STARTUP", a.FIXED_UPDATE = "FIXED_UPDATE", a.PRE_UPDATE = "PRE_UPDATE", a.UPDATE = "UPDATE", a.POST_UPDATE = "POST_UPDATE", a))(B || {});
+const D = [
   "PRE_STARTUP",
   "STARTUP",
   "POST_STARTUP"
   /* POST_STARTUP */
-], U = [
+], O = [
   "PRE_UPDATE",
   "UPDATE",
   "POST_UPDATE"
   /* POST_UPDATE */
 ];
-class st {
+class Q {
+  label_systems = /* @__PURE__ */ new Map();
+  sorted_cache = /* @__PURE__ */ new Map();
+  system_index = /* @__PURE__ */ new Map();
+  next_insertion_order = 0;
   constructor() {
-    l(this, "label_systems", /* @__PURE__ */ new Map());
-    l(this, "sorted_cache", /* @__PURE__ */ new Map());
-    l(this, "system_index", /* @__PURE__ */ new Map());
-    l(this, "next_insertion_order", 0);
-    for (let t = 0; t < L.length; t++)
-      this.label_systems.set(L[t], []);
-    for (let t = 0; t < U.length; t++)
-      this.label_systems.set(U[t], []);
+    for (let t = 0; t < D.length; t++)
+      this.label_systems.set(D[t], []);
+    this.label_systems.set("FIXED_UPDATE", []);
+    for (let t = 0; t < O.length; t++)
+      this.label_systems.set(O[t], []);
   }
   add_systems(t, ...e) {
     for (const s of e) {
-      const n = "system" in s ? s.system : s, r = "system" in s ? s.ordering : void 0;
-      if (process.env.NODE_ENV !== "production" && this.system_index.has(n))
-        throw new g(
-          u.DUPLICATE_SYSTEM,
-          `System ${n.id} is already scheduled`
-        );
-      const o = {
+      const n = "system" in s ? s.system : s, r = "system" in s ? s.ordering : void 0, i = {
         descriptor: n,
         insertion_order: this.next_insertion_order++,
-        before: new Set((r == null ? void 0 : r.before) ?? []),
-        after: new Set((r == null ? void 0 : r.after) ?? [])
+        before: new Set(r?.before ?? []),
+        after: new Set(r?.after ?? [])
       };
-      this.label_systems.get(t).push(o), this.system_index.set(n, t), this.sorted_cache.delete(t);
+      this.label_systems.get(t).push(i), this.system_index.set(n, t), this.sorted_cache.delete(t);
     }
   }
   remove_system(t) {
@@ -814,19 +742,28 @@ class st {
     if (n !== -1) {
       const r = s.length - 1;
       n !== r && (s[n] = s[r]), s.pop();
-      for (const o of s)
-        o.before.delete(t), o.after.delete(t);
+      for (const i of s)
+        i.before.delete(t), i.after.delete(t);
     }
     this.system_index.delete(t), this.sorted_cache.delete(e);
   }
   run_startup(t) {
-    for (const e of L)
+    for (const e of D)
       this.run_label(e, t, 0);
   }
   run_update(t, e) {
-    for (const s of U)
+    for (const s of O)
       this.run_label(s, t, e);
   }
+  run_fixed_update(t, e) {
+    this.run_label("FIXED_UPDATE", t, e);
+  }
+  has_fixed_systems() {
+    return this.label_systems.get(
+      "FIXED_UPDATE"
+      /* FIXED_UPDATE */
+    ).length > 0;
+  }
   get_all_systems() {
     const t = [];
     for (const e of this.label_systems.values())
@@ -860,52 +797,52 @@ class st {
    */
   topological_sort(t, e) {
     if (t.length === 0) return [];
-    const s = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Set();
-    for (const i of t)
-      s.set(i.descriptor, /* @__PURE__ */ new Set()), n.set(i.descriptor, 0), r.set(i.descriptor, i.insertion_order), o.add(i.descriptor);
-    for (const i of t) {
-      for (const c of i.before)
-        o.has(c) && (s.get(i.descriptor).add(c), n.set(c, n.get(c) + 1));
-      for (const c of i.after)
-        o.has(c) && (s.get(c).add(i.descriptor), n.set(i.descriptor, n.get(i.descriptor) + 1));
+    const s = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Set();
+    for (const o of t)
+      s.set(o.descriptor, /* @__PURE__ */ new Set()), n.set(o.descriptor, 0), r.set(o.descriptor, o.insertion_order), i.add(o.descriptor);
+    for (const o of t) {
+      for (const c of o.before)
+        i.has(c) && (s.get(o.descriptor).add(c), n.set(c, n.get(c) + 1));
+      for (const c of o.after)
+        i.has(c) && (s.get(c).add(o.descriptor), n.set(o.descriptor, n.get(o.descriptor) + 1));
     }
     let _ = [];
-    for (const i of t)
-      n.get(i.descriptor) === 0 && _.push(i.descriptor);
-    _.sort((i, c) => r.get(c) - r.get(i));
+    for (const o of t)
+      n.get(o.descriptor) === 0 && _.push(o.descriptor);
+    _.sort((o, c) => r.get(c) - r.get(o));
     const h = [];
     for (; _.length > 0; ) {
-      const i = _.pop();
-      h.push(i);
-      for (const c of s.get(i)) {
-        const d = n.get(c) - 1;
-        n.set(c, d), d === 0 && _.push(c);
+      const o = _.pop();
+      h.push(o);
+      for (const c of s.get(o)) {
+        const l = n.get(c) - 1;
+        n.set(c, l), l === 0 && _.push(c);
       }
-      _.sort((c, d) => r.get(d) - r.get(c));
+      _.sort((c, l) => r.get(l) - r.get(c));
     }
     if (h.length !== t.length) {
-      const i = new Set(h), c = t.filter((d) => !i.has(d.descriptor)).map((d) => `system_${d.descriptor.id}`);
-      throw new g(
-        u.CIRCULAR_SYSTEM_DEPENDENCY,
+      const o = new Set(h), c = t.filter((l) => !o.has(l.descriptor)).map((l) => `system_${l.descriptor.id}`);
+      throw new Y(
+        q.CIRCULAR_SYSTEM_DEPENDENCY,
         `Circular system dependency detected in ${e}: [${c.join(", ")}]`
       );
     }
     return h;
   }
 }
-const nt = Object.freeze(/* @__PURE__ */ Object.create(null));
-class rt {
-  constructor(t, e, s, n, r, o) {
-    l(this, "_archetypes");
-    l(this, "_defs");
-    l(this, "_resolver");
-    l(this, "_include");
-    l(this, "_exclude");
-    l(this, "_any_of");
-    // Pre-allocated args buffer for each() — avoids allocating a new array per
-    // archetype. Holds [columnGroup0, columnGroup1, ..., entityCount].
-    l(this, "_args_buf");
-    this._archetypes = t, this._defs = e, this._resolver = s, this._include = n, this._exclude = r, this._any_of = o, this._args_buf = new Array(e.length + 1);
+const K = Object.freeze(/* @__PURE__ */ Object.create(null));
+class J {
+  _archetypes;
+  _defs;
+  _resolver;
+  _include;
+  _exclude;
+  _any_of;
+  // Pre-allocated args buffer for each() — avoids allocating a new array per
+  // archetype. Holds [columnGroup0, columnGroup1, ..., entityCount].
+  _args_buf;
+  constructor(t, e, s, n, r, i) {
+    this._archetypes = t, this._defs = e, this._resolver = s, this._include = n, this._exclude = r, this._any_of = i, this._args_buf = new Array(e.length + 1);
   }
   /** Number of matching archetypes (including empty ones). */
   get length() {
@@ -935,10 +872,10 @@ class rt {
   each(t) {
     const e = this._archetypes, s = this._defs, n = this._args_buf;
     for (let r = 0; r < e.length; r++) {
-      const o = e[r], _ = o.entity_count;
+      const i = e[r], _ = i.entity_count;
       if (_ !== 0) {
         for (let h = 0; h < s.length; h++)
-          n[h] = o.get_column_group(s[h]);
+          n[h] = i.get_column_group(s[h]);
         n[s.length] = _, t.apply(null, n);
       }
     }
@@ -957,7 +894,7 @@ class rt {
   }
   /** Exclude archetypes that have any of these components. */
   not(...t) {
-    const e = this._exclude ? this._exclude.copy() : new T();
+    const e = this._exclude ? this._exclude.copy() : new v();
     for (let s = 0; s < t.length; s++) e.set(t[s]);
     return this._resolver._resolve_query(
       this._include,
@@ -968,7 +905,7 @@ class rt {
   }
   /** Require at least one of these components. */
   or(...t) {
-    const e = this._any_of ? this._any_of.copy() : new T();
+    const e = this._any_of ? this._any_of.copy() : new v();
     for (let s = 0; s < t.length; s++) e.set(t[s]);
     return this._resolver._resolve_query(
       this._include,
@@ -978,19 +915,19 @@ class rt {
     );
   }
 }
-class ot {
+class Z {
   constructor(t) {
     this._resolver = t;
   }
   every(...t) {
-    const e = new T();
+    const e = new v();
     for (let s = 0; s < t.length; s++) e.set(t[s]);
     return this._resolver._resolve_query(e, null, null, t);
   }
 }
-class it {
+class H {
+  store;
   constructor(t) {
-    l(this, "store");
     this.store = t;
   }
   create_entity() {
@@ -1001,8 +938,8 @@ class it {
     return n.read_field(r, t, s);
   }
   set_field(t, e, s, n) {
-    const r = this.store.get_entity_archetype(e), o = this.store.get_entity_row(e), _ = r.get_column(t, s);
-    _[o] = n;
+    const r = this.store.get_entity_archetype(e), i = this.store.get_entity_row(e), _ = r.get_column(t, s);
+    _[i] = n;
   }
   /** Buffer an entity for deferred destruction (applied at phase flush). */
   destroy_entity(t) {
@@ -1012,7 +949,7 @@ class it {
     this.store.flush_destroyed();
   }
   add_component(t, e, s) {
-    return this.store.add_component_deferred(t, e, s ?? nt), this;
+    return this.store.add_component_deferred(t, e, s ?? K), this;
   }
   remove_component(t, e) {
     return this.store.remove_component_deferred(t, e), this;
@@ -1028,24 +965,35 @@ class it {
     return this.store.get_event_reader(t);
   }
 }
-const _t = (a) => b(
-  a,
-  P,
-  "SystemID must be a non-negative integer"
-), ct = Object.freeze(/* @__PURE__ */ Object.create(null));
-class at {
-  constructor() {
-    l(this, "store");
-    l(this, "schedule");
-    l(this, "ctx");
-    l(this, "systems", /* @__PURE__ */ new Set());
-    l(this, "next_system_id", 0);
-    // Query deduplication: hash(include, exclude, any_of) → bucket of cache entries.
-    // Multiple queries can share the same hash (collision), so each bucket is an array.
-    l(this, "query_cache", /* @__PURE__ */ new Map());
-    // Reusable BitSet for building query masks — avoids allocation per query() call
-    l(this, "scratch_mask", new T());
-    this.store = new tt(), this.schedule = new st(), this.ctx = new it(this.store);
+const tt = (a) => b(
+  a
+), et = Object.freeze(/* @__PURE__ */ Object.create(null));
+class st {
+  store;
+  schedule;
+  ctx;
+  systems = /* @__PURE__ */ new Set();
+  next_system_id = 0;
+  // Fixed timestep accumulator
+  _fixed_timestep;
+  _accumulator = 0;
+  _max_fixed_steps;
+  // Query deduplication: hash(include, exclude, any_of) → bucket of cache entries.
+  // Multiple queries can share the same hash (collision), so each bucket is an array.
+  query_cache = /* @__PURE__ */ new Map();
+  // Reusable BitSet for building query masks — avoids allocation per query() call
+  scratch_mask = new v();
+  constructor(t) {
+    this.store = new $(), this.schedule = new Q(), this.ctx = new H(this.store), this._fixed_timestep = t?.fixed_timestep ?? 1 / 60, this._max_fixed_steps = t?.max_fixed_steps ?? 4;
+  }
+  get fixed_timestep() {
+    return this._fixed_timestep;
+  }
+  set fixed_timestep(t) {
+    this._fixed_timestep = t;
+  }
+  get fixed_alpha() {
+    return this._accumulator / this._fixed_timestep;
   }
   register_component(t) {
     return this.store.register_component(t);
@@ -1072,7 +1020,7 @@ class at {
     return this.store.entity_count;
   }
   add_component(t, e, s) {
-    this.store.add_component(t, e, s ?? ct);
+    this.store.add_component(t, e, s ?? et);
   }
   add_components(t, e) {
     this.store.add_components(t, e);
@@ -1102,32 +1050,32 @@ class at {
   }
   /** QueryResolver implementation — creates or retrieves a cached Query. */
   _resolve_query(t, e, s, n) {
-    const r = t.hash(), o = e ? e.hash() : 0, _ = s ? s.hash() : 0, h = r ^ Math.imul(o, 2654435769) ^ Math.imul(_, 1367130551) | 0, i = this._find_cached(h, t, e, s);
-    if (i !== void 0) return i.query;
+    const r = t.hash(), i = e ? e.hash() : 0, _ = s ? s.hash() : 0, h = r ^ Math.imul(i, 2654435769) ^ Math.imul(_, 1367130551) | 0, o = this._find_cached(h, t, e, s);
+    if (o !== void 0) return o.query;
     const c = this.store.register_query(
       t,
       e ?? void 0,
       s ?? void 0
-    ), d = new rt(
+    ), l = new J(
       c,
       n,
       this,
       t.copy(),
-      (e == null ? void 0 : e.copy()) ?? null,
-      (s == null ? void 0 : s.copy()) ?? null
+      e?.copy() ?? null,
+      s?.copy() ?? null
     );
     return j(this.query_cache, h, {
       include_mask: t.copy(),
-      exclude_mask: (e == null ? void 0 : e.copy()) ?? null,
-      any_of_mask: (s == null ? void 0 : s.copy()) ?? null,
-      query: d
-    }), d;
+      exclude_mask: e?.copy() ?? null,
+      any_of_mask: s?.copy() ?? null,
+      query: l
+    }), l;
   }
   _find_cached(t, e, s, n) {
     const r = this.query_cache.get(t);
     if (r)
-      for (let o = 0; o < r.length; o++) {
-        const _ = r[o];
+      for (let i = 0; i < r.length; i++) {
+        const _ = r[i];
         if (!(!_.include_mask.equals(e) || !(s === null ? _.exclude_mask === null : _.exclude_mask !== null && _.exclude_mask.equals(s)) || !(n === null ? _.any_of_mask === null : _.any_of_mask !== null && _.any_of_mask.equals(n))))
           return _;
       }
@@ -1135,11 +1083,11 @@ class at {
   register_system(t, e) {
     let s;
     if (typeof t == "function") {
-      const o = e(new ot(this)), _ = this.ctx;
-      s = { fn: (h, i) => t(o, _, i) };
+      const i = e(new Z(this)), _ = this.ctx;
+      s = { fn: (h, o) => t(i, _, o) };
     } else
       s = t;
-    const n = _t(this.next_system_id++), r = Object.freeze(
+    const n = tt(this.next_system_id++), r = Object.freeze(
       Object.assign({ id: n }, s)
     );
     return this.systems.add(r), r;
@@ -1148,35 +1096,38 @@ class at {
     return this.schedule.add_systems(t, ...e), this;
   }
   remove_system(t) {
-    var e;
-    this.schedule.remove_system(t), (e = t.on_removed) == null || e.call(t), this.systems.delete(t);
+    this.schedule.remove_system(t), t.on_removed?.(), this.systems.delete(t);
   }
   get system_count() {
     return this.systems.size;
   }
   startup() {
-    var t;
-    for (const e of this.systems.values())
-      (t = e.on_added) == null || t.call(e, this.store);
+    for (const t of this.systems.values())
+      t.on_added?.(this.store);
     this.schedule.run_startup(this.ctx);
   }
   update(t) {
-    this.store.clear_events(), this.schedule.run_update(this.ctx, t);
+    if (this.store.clear_events(), this.schedule.has_fixed_systems()) {
+      this._accumulator += t;
+      const e = this._max_fixed_steps * this._fixed_timestep;
+      for (this._accumulator > e && (this._accumulator = e); this._accumulator >= this._fixed_timestep; )
+        this.schedule.run_fixed_update(this.ctx, this._fixed_timestep), this._accumulator -= this._fixed_timestep;
+    }
+    this.schedule.run_update(this.ctx, t);
   }
   flush() {
     this.ctx.flush();
   }
   dispose() {
-    var t, e;
-    for (const s of this.systems.values())
-      (t = s.dispose) == null || t.call(s), (e = s.on_removed) == null || e.call(s);
+    for (const t of this.systems.values())
+      t.dispose?.(), t.on_removed?.();
     this.systems.clear(), this.schedule.clear();
   }
 }
 export {
-  rt as Query,
-  ot as QueryBuilder,
-  et as SCHEDULE,
-  it as SystemContext,
-  at as World
+  J as Query,
+  Z as QueryBuilder,
+  B as SCHEDULE,
+  H as SystemContext,
+  st as World
 };