@oasys/oecs 0.5.3 → 0.5.4

package/dist/core/ecs/schedule.d.cts

@@ -12,7 +12,7 @@ export declare enum SCHEDULE {
     POST_UPDATE = "POST_UPDATE"
 }
 /**
- * An opaque handle for a named group of systems (#576). A set carries a shared
+ * An opaque handle for a named group of systems. A set carries a shared
  * run condition and shared ordering that every member inherits. Sets are
  * identified by **object identity**, not by name — create one with
  * `systemSet(name)`, hold the handle, and reuse it across `addSystems`
@@ -22,13 +22,13 @@ export declare enum SCHEDULE {
 export interface SystemSet {
     readonly name: string;
 }
-/** Create a `SystemSet` handle (#576). Two calls with the same name are two
+/** Create a `SystemSet` handle. Two calls with the same name are two
  * distinct sets — keep the returned handle and pass it around. */
 export declare function systemSet(name: string): SystemSet;
 /** A `before`/`after` ordering target: either a concrete system or a whole set
  * (expanded to its members within the same phase at sort time). */
 export type SystemOrderingTarget = SystemDescriptor | SystemSet;
-/** Shared configuration applied to a `SystemSet` via `configureSet` (#576).
+/** Shared configuration applied to a `SystemSet` via `configureSet`.
  * Accumulates across calls — conditions AND together, ordering targets union. */
 export interface SystemSetConfig {
     /** Condition(s) every member is gated by (ANDed with each member's own). */
@@ -46,10 +46,10 @@ export interface SystemEntry {
     system: SystemDescriptor;
     ordering?: SystemOrdering;
     /** Run condition(s) gating just this system — ANDed with any set conditions
-     * it inherits (#576). A `false` verdict skips the body that tick. */
+     * it inherits. A `false` verdict skips the body that tick. */
     runIf?: RunCondition | readonly RunCondition[];
     /** Set membership — the system inherits each set's shared condition and
-     * ordering (#576). */
+     * ordering. */
     set?: SystemSet | readonly SystemSet[];
 }
 export declare class Schedule {
@@ -57,6 +57,9 @@ export declare class Schedule {
     private readonly sortedCache;
     private readonly systemIndex;
     private readonly systemLastRun;
+    private readonly lastRunSlots;
+    private readonly freeLastRunSlots;
+    private _driveDepth;
     private readonly gatedSystems;
     private readonly setConditions;
     private readonly setOrdering;
@@ -65,17 +68,19 @@ export declare class Schedule {
     /** Dev-diagnostic sink (`ECSOptions.onWarn`); defaults to `console.warn`.
      * The only schedule diagnostic today is `warnDroppedEdge`. */
     private readonly onWarn;
+    /** The `FIXED_UPDATE` node list, held directly for `hasFixedSystems`. */
+    private readonly _fixedNodes;
     constructor(onWarn?: (message: string) => void);
     addSystems(label: SCHEDULE, ...entries: (SystemDescriptor | SystemEntry)[]): void;
     /**
-     * Configure a `SystemSet` (#576) — its shared run condition(s) and/or
+     * 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(set: SystemSet, config: SystemSetConfig): void;
     removeSystem(system: SystemDescriptor): void;
-    /** Attach (or, with `null`, detach) the opt-in compute backend (#622). Driven
+    /** 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(backend: ComputeBackend | null): void;
@@ -85,6 +90,14 @@ export declare class Schedule {
     hasFixedSystems(): boolean;
     getAllSystems(): SystemDescriptor[];
     hasSystem(system: SystemDescriptor): boolean;
+    /** 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). */
+    private _assignLastRunSlot;
     clear(): void;
     private runLabel;
     /**
@@ -95,7 +108,7 @@ export declare class Schedule {
      * 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.
      *
-     * #731 SEMANTIC NOTE: this evaluates a set's conditions once-per-set-per-phase
+     * 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
@@ -114,7 +127,7 @@ export declare class Schedule {
      */
     private sortSystems;
     /**
-     * Add the topo edges for one ordering list (#576). For `"before"` the source
+     * 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

package/dist/core/ecs/schedule.d.ts

@@ -12,7 +12,7 @@ export declare enum SCHEDULE {
     POST_UPDATE = "POST_UPDATE"
 }
 /**
- * An opaque handle for a named group of systems (#576). A set carries a shared
+ * An opaque handle for a named group of systems. A set carries a shared
  * run condition and shared ordering that every member inherits. Sets are
  * identified by **object identity**, not by name — create one with
  * `systemSet(name)`, hold the handle, and reuse it across `addSystems`
@@ -22,13 +22,13 @@ export declare enum SCHEDULE {
 export interface SystemSet {
     readonly name: string;
 }
-/** Create a `SystemSet` handle (#576). Two calls with the same name are two
+/** Create a `SystemSet` handle. Two calls with the same name are two
  * distinct sets — keep the returned handle and pass it around. */
 export declare function systemSet(name: string): SystemSet;
 /** A `before`/`after` ordering target: either a concrete system or a whole set
  * (expanded to its members within the same phase at sort time). */
 export type SystemOrderingTarget = SystemDescriptor | SystemSet;
-/** Shared configuration applied to a `SystemSet` via `configureSet` (#576).
+/** Shared configuration applied to a `SystemSet` via `configureSet`.
  * Accumulates across calls — conditions AND together, ordering targets union. */
 export interface SystemSetConfig {
     /** Condition(s) every member is gated by (ANDed with each member's own). */
@@ -46,10 +46,10 @@ export interface SystemEntry {
     system: SystemDescriptor;
     ordering?: SystemOrdering;
     /** Run condition(s) gating just this system — ANDed with any set conditions
-     * it inherits (#576). A `false` verdict skips the body that tick. */
+     * it inherits. A `false` verdict skips the body that tick. */
     runIf?: RunCondition | readonly RunCondition[];
     /** Set membership — the system inherits each set's shared condition and
-     * ordering (#576). */
+     * ordering. */
     set?: SystemSet | readonly SystemSet[];
 }
 export declare class Schedule {
@@ -57,6 +57,9 @@ export declare class Schedule {
     private readonly sortedCache;
     private readonly systemIndex;
     private readonly systemLastRun;
+    private readonly lastRunSlots;
+    private readonly freeLastRunSlots;
+    private _driveDepth;
     private readonly gatedSystems;
     private readonly setConditions;
     private readonly setOrdering;
@@ -65,17 +68,19 @@ export declare class Schedule {
     /** Dev-diagnostic sink (`ECSOptions.onWarn`); defaults to `console.warn`.
      * The only schedule diagnostic today is `warnDroppedEdge`. */
     private readonly onWarn;
+    /** The `FIXED_UPDATE` node list, held directly for `hasFixedSystems`. */
+    private readonly _fixedNodes;
     constructor(onWarn?: (message: string) => void);
     addSystems(label: SCHEDULE, ...entries: (SystemDescriptor | SystemEntry)[]): void;
     /**
-     * Configure a `SystemSet` (#576) — its shared run condition(s) and/or
+     * 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(set: SystemSet, config: SystemSetConfig): void;
     removeSystem(system: SystemDescriptor): void;
-    /** Attach (or, with `null`, detach) the opt-in compute backend (#622). Driven
+    /** 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(backend: ComputeBackend | null): void;
@@ -85,6 +90,14 @@ export declare class Schedule {
     hasFixedSystems(): boolean;
     getAllSystems(): SystemDescriptor[];
     hasSystem(system: SystemDescriptor): boolean;
+    /** 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). */
+    private _assignLastRunSlot;
     clear(): void;
     private runLabel;
     /**
@@ -95,7 +108,7 @@ export declare class Schedule {
      * 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.
      *
-     * #731 SEMANTIC NOTE: this evaluates a set's conditions once-per-set-per-phase
+     * 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
@@ -114,7 +127,7 @@ export declare class Schedule {
      */
     private sortSystems;
     /**
-     * Add the topo edges for one ordering list (#576). For `"before"` the source
+     * 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

package/dist/core/ecs/schedule.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"schedule.d.ts","sourceRoot":"","sources":["../../../src/core/ecs/schedule.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KAmCK;AAGL,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAC7C,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,UAAU,CAAC;AACjD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACxD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAMpD,oBAAY,QAAQ;IACnB,WAAW,gBAAgB;IAC3B,OAAO,YAAY;IACnB,YAAY,iBAAiB;IAC7B,YAAY,iBAAiB;IAC7B,UAAU,eAAe;IACzB,MAAM,WAAW;IACjB,WAAW,gBAAgB;CAC3B;AAMD;;;;;;;GAOG;AACH,MAAM,WAAW,SAAS;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACtB;AAED;kEACkE;AAClE,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,CAEjD;AAED;mEACmE;AACnE,MAAM,MAAM,oBAAoB,GAAG,gBAAgB,GAAG,SAAS,CAAC;AAEhE;iFACiF;AACjF,MAAM,WAAW,eAAe;IAC/B,4EAA4E;IAC5E,KAAK,CAAC,EAAE,YAAY,GAAG,SAAS,YAAY,EAAE,CAAC;IAC/C,sDAAsD;IACtD,MAAM,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;IACzC,qDAAqD;IACrD,KAAK,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;CACxC;AAED,MAAM,WAAW,cAAc;IAC9B,MAAM,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;IACzC,KAAK,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;CACxC;AAED,MAAM,WAAW,WAAW;IAC3B,MAAM,EAAE,gBAAgB,CAAC;IACzB,QAAQ,CAAC,EAAE,cAAc,CAAC;IAC1B;yEACqE;IACrE,KAAK,CAAC,EAAE,YAAY,GAAG,SAAS,YAAY,EAAE,CAAC;IAC/C;0BACsB;IACtB,GAAG,CAAC,EAAE,SAAS,GAAG,SAAS,SAAS,EAAE,CAAC;CACvC;AA8BD,qBAAa,QAAQ;IACpB,OAAO,CAAC,QAAQ,CAAC,YAAY,CAA0C;IACvE,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAgD;IAC5E,OAAO,CAAC,QAAQ,CAAC,WAAW,CAA8C;IAC1E,OAAO,CAAC,QAAQ,CAAC,aAAa,CAA4C;IAI1E,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAgD;IAG7E,OAAO,CAAC,QAAQ,CAAC,aAAa,CAA6C;IAC3E,OAAO,CAAC,QAAQ,CAAC,WAAW,CAGd;IACd,OAAO,CAAC,kBAAkB,CAAK;IAM/B,OAAO,CAAC,QAAQ,CAA+B;IAE/C;kEAC8D;IAC9D,OAAO,CAAC,QAAQ,CAAC,MAAM,CAA4B;gBAEvC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,IAAI;IAWvC,UAAU,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,OAAO,EAAE,CAAC,gBAAgB,GAAG,WAAW,CAAC,EAAE,GAAG,IAAI;IAwCxF;;;;;OAKG;IACI,YAAY,CAAC,GAAG,EAAE,SAAS,EAAE,MAAM,EAAE,eAAe,GAAG,IAAI;IA0B3D,YAAY,CAAC,MAAM,EAAE,gBAAgB,GAAG,IAAI;IA+BnD;;wEAEoE;IAC7D,UAAU,CAAC,OAAO,EAAE,cAAc,GAAG,IAAI,GAAG,IAAI;IAIhD,UAAU,CAAC,GAAG,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAMlD,SAAS,CAAC,GAAG,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAMpE,cAAc,CAAC,GAAG,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAIvE,eAAe,IAAI,OAAO;IAK1B,aAAa,IAAI,gBAAgB,EAAE;IAUnC,SAAS,CAAC,MAAM,EAAE,gBAAgB,GAAG,OAAO;IAI5C,KAAK,IAAI,IAAI;IAYpB,OAAO,CAAC,QAAQ;IA6DhB;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,SAAS;IAwBjB;;kEAE8D;IAC9D,OAAO,CAAC,cAAc;IAetB,OAAO,CAAC,SAAS;IAWjB;;;;OAIG;IACH,OAAO,CAAC,WAAW;IA2FnB;;;;;;;;OAQG;IACH,OAAO,CAAC,YAAY;IA4BpB;4EACwE;IACxE,OAAO,CAAC,eAAe;IAevB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,eAAe;CAgBvB"}
+{"version":3,"file":"schedule.d.ts","sourceRoot":"","sources":["../../../src/core/ecs/schedule.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KAmCK;AAGL,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAC7C,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,UAAU,CAAC;AACjD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACxD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAMpD,oBAAY,QAAQ;IACnB,WAAW,gBAAgB;IAC3B,OAAO,YAAY;IACnB,YAAY,iBAAiB;IAC7B,YAAY,iBAAiB;IAC7B,UAAU,eAAe;IACzB,MAAM,WAAW;IACjB,WAAW,gBAAgB;CAC3B;AAMD;;;;;;;GAOG;AACH,MAAM,WAAW,SAAS;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACtB;AAED;kEACkE;AAClE,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,CAEjD;AAED;mEACmE;AACnE,MAAM,MAAM,oBAAoB,GAAG,gBAAgB,GAAG,SAAS,CAAC;AAEhE;iFACiF;AACjF,MAAM,WAAW,eAAe;IAC/B,4EAA4E;IAC5E,KAAK,CAAC,EAAE,YAAY,GAAG,SAAS,YAAY,EAAE,CAAC;IAC/C,sDAAsD;IACtD,MAAM,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;IACzC,qDAAqD;IACrD,KAAK,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;CACxC;AAED,MAAM,WAAW,cAAc;IAC9B,MAAM,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;IACzC,KAAK,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAC;CACxC;AAED,MAAM,WAAW,WAAW;IAC3B,MAAM,EAAE,gBAAgB,CAAC;IACzB,QAAQ,CAAC,EAAE,cAAc,CAAC;IAC1B;kEAC8D;IAC9D,KAAK,CAAC,EAAE,YAAY,GAAG,SAAS,YAAY,EAAE,CAAC;IAC/C;mBACe;IACf,GAAG,CAAC,EAAE,SAAS,GAAG,SAAS,SAAS,EAAE,CAAC;CACvC;AAqCD,qBAAa,QAAQ;IACpB,OAAO,CAAC,QAAQ,CAAC,YAAY,CAA0C;IAIvE,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAuC;IACnE,OAAO,CAAC,QAAQ,CAAC,WAAW,CAA8C;IAa1E,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAgB;IAU9C,OAAO,CAAC,QAAQ,CAAC,YAAY,CAA4C;IAIzE,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAgB;IAKjD,OAAO,CAAC,WAAW,CAAK;IAIxB,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAgD;IAG7E,OAAO,CAAC,QAAQ,CAAC,aAAa,CAA6C;IAC3E,OAAO,CAAC,QAAQ,CAAC,WAAW,CAGd;IACd,OAAO,CAAC,kBAAkB,CAAK;IAM/B,OAAO,CAAC,QAAQ,CAA+B;IAE/C;kEAC8D;IAC9D,OAAO,CAAC,QAAQ,CAAC,MAAM,CAA4B;IAEnD,yEAAyE;IACzE,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAoB;gBAEpC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,IAAI;IAWvC,UAAU,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,OAAO,EAAE,CAAC,gBAAgB,GAAG,WAAW,CAAC,EAAE,GAAG,IAAI;IAwCxF;;;;;OAKG;IACI,YAAY,CAAC,GAAG,EAAE,SAAS,EAAE,MAAM,EAAE,eAAe,GAAG,IAAI;IA0B3D,YAAY,CAAC,MAAM,EAAE,gBAAgB,GAAG,IAAI;IAqDnD;;wEAEoE;IAC7D,UAAU,CAAC,OAAO,EAAE,cAAc,GAAG,IAAI,GAAG,IAAI;IAkBhD,UAAU,CAAC,GAAG,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAWlD,SAAS,CAAC,GAAG,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAWpE,cAAc,CAAC,GAAG,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IASvE,eAAe,IAAI,OAAO;IAS1B,aAAa,IAAI,gBAAgB,EAAE;IAUnC,SAAS,CAAC,MAAM,EAAE,gBAAgB,GAAG,OAAO;IAInD;;;;;;qBAMiB;IACjB,OAAO,CAAC,kBAAkB;IAgCnB,KAAK,IAAI,IAAI;IA4BpB,OAAO,CAAC,QAAQ;IAqEhB;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,SAAS;IAwBjB;;kEAE8D;IAC9D,OAAO,CAAC,cAAc;IAetB,OAAO,CAAC,SAAS;IAcjB;;;;OAIG;IACH,OAAO,CAAC,WAAW;IA2FnB;;;;;;;;OAQG;IACH,OAAO,CAAC,YAAY;IA4BpB;4EACwE;IACxE,OAAO,CAAC,eAAe;IAevB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,eAAe;CAgBvB"}

package/dist/core/ecs/snapshot_service.d.cts

@@ -38,7 +38,7 @@ export interface SnapshotHost {
 }
 export declare class SnapshotService {
     private readonly host;
-    /** The allocator IS its own snapshot seam (H1 step 3): free-list copy on
+    /** The allocator IS its own snapshot seam: free-list copy on
      * capture; `setHighWater` + `restoreHostState` on mount. */
     private readonly allocator;
     constructor(host: SnapshotHost, allocator: EntityAllocator);
@@ -49,7 +49,7 @@ export declare class SnapshotService {
      * by the relation side data (`snapshotRelations` — multi forward target
      * sets, which live outside the sparse store). Both are written in canonical
      * entity-index order, so two worlds with identical contents inserted in
-     * different orders snapshot byte-for-byte the same (#470). The reverse index
+     * different orders snapshot byte-for-byte the same. The reverse index
      * is derived and never serialized — `restoreSparse` rebuilds it. */
     snapshotSparse(): Uint8Array;
     /** Repopulate the sparse stores from `snapshotSparse` bytes, replacing all
@@ -70,7 +70,7 @@ export declare class SnapshotService {
      * `(source index → target EntityID)`, which is exactly one reverse edge. */
     private rebuildRelationIndices;
     /** Capture the full live world to one self-contained byte buffer that
-     * `restoreInto` can mount back onto a live, ticking world (#789). Three
+     * `restoreInto` can mount back onto a live, ticking world. Three
      * sections (see `resume.ts`): the dense SAB column bytes, the sparse +
      * relation bytes, and the host-side bookkeeping the SAB omits. */
     snapshot(): Uint8Array;

package/dist/core/ecs/snapshot_service.d.ts

@@ -38,7 +38,7 @@ export interface SnapshotHost {
 }
 export declare class SnapshotService {
     private readonly host;
-    /** The allocator IS its own snapshot seam (H1 step 3): free-list copy on
+    /** The allocator IS its own snapshot seam: free-list copy on
      * capture; `setHighWater` + `restoreHostState` on mount. */
     private readonly allocator;
     constructor(host: SnapshotHost, allocator: EntityAllocator);
@@ -49,7 +49,7 @@ export declare class SnapshotService {
      * by the relation side data (`snapshotRelations` — multi forward target
      * sets, which live outside the sparse store). Both are written in canonical
      * entity-index order, so two worlds with identical contents inserted in
-     * different orders snapshot byte-for-byte the same (#470). The reverse index
+     * different orders snapshot byte-for-byte the same. The reverse index
      * is derived and never serialized — `restoreSparse` rebuilds it. */
     snapshotSparse(): Uint8Array;
     /** Repopulate the sparse stores from `snapshotSparse` bytes, replacing all
@@ -70,7 +70,7 @@ export declare class SnapshotService {
      * `(source index → target EntityID)`, which is exactly one reverse edge. */
     private rebuildRelationIndices;
     /** Capture the full live world to one self-contained byte buffer that
-     * `restoreInto` can mount back onto a live, ticking world (#789). Three
+     * `restoreInto` can mount back onto a live, ticking world. Three
      * sections (see `resume.ts`): the dense SAB column bytes, the sparse +
      * relation bytes, and the host-side bookkeeping the SAB omits. */
     snapshot(): Uint8Array;

package/dist/core/ecs/sparse_store.d.cts

@@ -25,11 +25,11 @@ export declare class SparseComponentStore {
     get size(): number;
     /** Live entity indices that hold this component (dense, iteration order is
      * SparseMap insertion/swap order — NOT canonical). Used by the hot query
-     * integration path (#469); for the determinism surface use
+     * integration path; for the determinism surface use
      * `canonicalIndices` instead. */
     get indices(): readonly number[];
     /** Live entity indices in **canonical** (ascending) order — the determinism
-     * ordering for `stateHash` + snapshot/restore (ADR-0011, #470). The native
+     * 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;
@@ -66,7 +66,7 @@ export declare class SparseRestoreError extends Error {
  * `snapshotColumnStore`). Members are emitted in canonical (ascending
  * entity-index) order so the bytes are independent of insertion / removal
  * history: two worlds with identical sparse contents reached by different
- * mutation orders serialize byte-for-byte the same (#470).
+ * mutation orders serialize byte-for-byte the same.
  *
  * Layout (all integers little-endian, to match the dense SAB snapshot and stay
  * architecture-independent):
@@ -84,7 +84,7 @@ export declare class SparseRestoreError extends Error {
  * `restoreSparseStores` can reject a snapshot whose shape doesn't match the
  * stores it's restoring into; `schemaHash` (a `schemaFingerprint` over the
  * field names + types) goes further and rejects a buffer whose shape matches
- * field-for-field but whose field **identity** doesn't (#494). */
+ * field-for-field but whose field **identity** doesn't. */
 export declare function snapshotSparseStores(stores: readonly SparseComponentStore[]): Uint8Array;
 /** Repopulate already-registered sparse stores from `snapshotSparseStores`
  * bytes, giving full-equality round-trip (membership + data). The `stores`
@@ -98,10 +98,10 @@ export declare function snapshotSparseStores(stores: readonly SparseComponentSto
  * or a truncated / over-long buffer) rather than silently corrupting state.
  * The index bound matters because the index keys a `SparseMap` whose backing
  * array grows to `index` length — an unvalidated crafted u32 (up to ~4.29e9)
- * would allocate multi-GB (#494). */
+ * would allocate multi-GB. */
 export declare function restoreSparseStores(stores: readonly SparseComponentStore[], bytes: Uint8Array): void;
 /** Read-only validation of a `snapshotSparseStores` buffer against the live
- * registry, WITHOUT mutating any store (#789). Mirrors `restoreSparseStores`'s
+ * registry, WITHOUT mutating any store. Mirrors `restoreSparseStores`'s
  * shape/field-identity/index-bounds/frame checks so `Store.restoreInto` can fail
  * closed on a sparse-registration mismatch BEFORE the dense mount overwrites live
  * column data. Throws `SparseRestoreError` on any mismatch / malformed buffer. */

package/dist/core/ecs/sparse_store.d.ts

@@ -25,11 +25,11 @@ export declare class SparseComponentStore {
     get size(): number;
     /** Live entity indices that hold this component (dense, iteration order is
      * SparseMap insertion/swap order — NOT canonical). Used by the hot query
-     * integration path (#469); for the determinism surface use
+     * integration path; for the determinism surface use
      * `canonicalIndices` instead. */
     get indices(): readonly number[];
     /** Live entity indices in **canonical** (ascending) order — the determinism
-     * ordering for `stateHash` + snapshot/restore (ADR-0011, #470). The native
+     * 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;
@@ -66,7 +66,7 @@ export declare class SparseRestoreError extends Error {
  * `snapshotColumnStore`). Members are emitted in canonical (ascending
  * entity-index) order so the bytes are independent of insertion / removal
  * history: two worlds with identical sparse contents reached by different
- * mutation orders serialize byte-for-byte the same (#470).
+ * mutation orders serialize byte-for-byte the same.
  *
  * Layout (all integers little-endian, to match the dense SAB snapshot and stay
  * architecture-independent):
@@ -84,7 +84,7 @@ export declare class SparseRestoreError extends Error {
  * `restoreSparseStores` can reject a snapshot whose shape doesn't match the
  * stores it's restoring into; `schemaHash` (a `schemaFingerprint` over the
  * field names + types) goes further and rejects a buffer whose shape matches
- * field-for-field but whose field **identity** doesn't (#494). */
+ * field-for-field but whose field **identity** doesn't. */
 export declare function snapshotSparseStores(stores: readonly SparseComponentStore[]): Uint8Array;
 /** Repopulate already-registered sparse stores from `snapshotSparseStores`
  * bytes, giving full-equality round-trip (membership + data). The `stores`
@@ -98,10 +98,10 @@ export declare function snapshotSparseStores(stores: readonly SparseComponentSto
  * or a truncated / over-long buffer) rather than silently corrupting state.
  * The index bound matters because the index keys a `SparseMap` whose backing
  * array grows to `index` length — an unvalidated crafted u32 (up to ~4.29e9)
- * would allocate multi-GB (#494). */
+ * would allocate multi-GB. */
 export declare function restoreSparseStores(stores: readonly SparseComponentStore[], bytes: Uint8Array): void;
 /** Read-only validation of a `snapshotSparseStores` buffer against the live
- * registry, WITHOUT mutating any store (#789). Mirrors `restoreSparseStores`'s
+ * registry, WITHOUT mutating any store. Mirrors `restoreSparseStores`'s
  * shape/field-identity/index-bounds/frame checks so `Store.restoreInto` can fail
  * closed on a sparse-registration mismatch BEFORE the dense mount overwrites live
  * column data. Throws `SparseRestoreError` on any mismatch / malformed buffer. */

package/dist/core/ecs/sparse_store.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sparse_store.d.ts","sourceRoot":"","sources":["../../../src/core/ecs/sparse_store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;KA0BK;AAEL,OAAO,EAAE,KAAK,EAAa,KAAK,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAE7E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAGnD;;2EAE2E;AAC3E,MAAM,MAAM,iBAAiB,GAAG,KAAK,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC;AAOrE,OAAO,CAAC,MAAM,cAAc,EAAE,OAAO,MAAM,CAAC;AAE5C,MAAM,MAAM,kBAAkB,CAAC,CAAC,SAAS,eAAe,GAAG,eAAe,IAAI,iBAAiB,GAAG;IACjG,QAAQ,CAAC,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;CAC7B,CAAC;AAEF;uEACuE;AACvE,MAAM,MAAM,cAAc,CAAC,CAAC,IAAI,CAAC,SAAS,kBAAkB,CAAC,MAAM,CAAC,SAAS,eAAe,CAAC,GAC1F,CAAC,GACD,KAAK,CAAC;AAET;;oCAEoC;AACpC,qBAAa,oBAAoB;IAChC,6EAA6E;IAC7E,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA6B;IACnD,SAAgB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrC,SAAgB,UAAU,EAAE,aAAa,EAAE,CAAC;IAC5C,SAAgB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBAEvC,UAAU,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,aAAa,EAAE;IAQ7D,wDAAwD;IACxD,IAAW,IAAI,IAAI,MAAM,CAExB;IAED;;;qCAGiC;IACjC,IAAW,OAAO,IAAI,SAAS,MAAM,EAAE,CAEtC;IAED;;;;;;uDAMmD;IAC5C,gBAAgB,IAAI,MAAM,EAAE;IAInC;;2EAEuE;IAChE,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,GAAG,SAAS;IAI3D;0DACsD;IAC/C,KAAK,IAAI,IAAI;IAIpB;;8DAE0D;IACnD,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,IAAI;IAI7C,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAIlC;sEACkE;IAC3D,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI;IAUlE,wEAAwE;IACjE,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAIrC,6EAA6E;IACtE,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAKpE,0EAA0E;IACnE,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO;CAMxE;AAED,qBAAa,kBAAmB,SAAQ,KAAK;gBAChC,OAAO,EAAE,MAAM;CAI3B;AAuCD;;;;;;;;;;;;;;;;;;;;;;;kEAuBkE;AAClE,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,SAAS,oBAAoB,EAAE,GAAG,UAAU,CAuCxF;AAED;;;;;;;;;;;;qCAYqC;AACrC,wBAAgB,mBAAmB,CAClC,MAAM,EAAE,SAAS,oBAAoB,EAAE,EACvC,KAAK,EAAE,UAAU,GACf,IAAI,CAkEN;AAED;;;;kFAIkF;AAClF,wBAAgB,oBAAoB,CACnC,MAAM,EAAE,SAAS,oBAAoB,EAAE,EACvC,KAAK,EAAE,UAAU,GACf,IAAI,CA4DN"}
+{"version":3,"file":"sparse_store.d.ts","sourceRoot":"","sources":["../../../src/core/ecs/sparse_store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;KA0BK;AAEL,OAAO,EAAE,KAAK,EAAa,KAAK,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAE7E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAGnD;;2EAE2E;AAC3E,MAAM,MAAM,iBAAiB,GAAG,KAAK,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC;AAOrE,OAAO,CAAC,MAAM,cAAc,EAAE,OAAO,MAAM,CAAC;AAE5C,MAAM,MAAM,kBAAkB,CAAC,CAAC,SAAS,eAAe,GAAG,eAAe,IAAI,iBAAiB,GAAG;IACjG,QAAQ,CAAC,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;CAC7B,CAAC;AAEF;uEACuE;AACvE,MAAM,MAAM,cAAc,CAAC,CAAC,IAAI,CAAC,SAAS,kBAAkB,CAAC,MAAM,CAAC,SAAS,eAAe,CAAC,GAC1F,CAAC,GACD,KAAK,CAAC;AAET;;oCAEoC;AACpC,qBAAa,oBAAoB;IAChC,6EAA6E;IAC7E,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA6B;IACnD,SAAgB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrC,SAAgB,UAAU,EAAE,aAAa,EAAE,CAAC;IAC5C,SAAgB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBAEvC,UAAU,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,aAAa,EAAE;IAQ7D,wDAAwD;IACxD,IAAW,IAAI,IAAI,MAAM,CAExB;IAED;;;qCAGiC;IACjC,IAAW,OAAO,IAAI,SAAS,MAAM,EAAE,CAEtC;IAED;;;;;;uDAMmD;IAC5C,gBAAgB,IAAI,MAAM,EAAE;IAInC;;2EAEuE;IAChE,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,GAAG,SAAS;IAI3D;0DACsD;IAC/C,KAAK,IAAI,IAAI;IAIpB;;8DAE0D;IACnD,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,IAAI;IAI7C,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAIlC;sEACkE;IAC3D,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI;IAUlE,wEAAwE;IACjE,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAIrC,6EAA6E;IACtE,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAKpE,0EAA0E;IACnE,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO;CAMxE;AAED,qBAAa,kBAAmB,SAAQ,KAAK;gBAChC,OAAO,EAAE,MAAM;CAI3B;AAuCD;;;;;;;;;;;;;;;;;;;;;;;2DAuB2D;AAC3D,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,SAAS,oBAAoB,EAAE,GAAG,UAAU,CAuCxF;AAED;;;;;;;;;;;;8BAY8B;AAC9B,wBAAgB,mBAAmB,CAClC,MAAM,EAAE,SAAS,oBAAoB,EAAE,EACvC,KAAK,EAAE,UAAU,GACf,IAAI,CAkEN;AAED;;;;kFAIkF;AAClF,wBAAgB,oBAAoB,CACnC,MAAM,EAAE,SAAS,oBAAoB,EAAE,EACvC,KAAK,EAAE,UAAU,GACf,IAAI,CA4DN"}