@oasys/oecs 0.5.4 → 0.6.0

package/dist/plugins/snapshots/resume.d.ts

@@ -0,0 +1,57 @@
+import { ECS_SNAPSHOT_VERSION, ArchetypeRowState, HostState } from '../../core/ecs/snapshot.js';
+import { ArchetypeViews } from '../../core/store/index.js';
+import { ECSRestoreError } from '../../core/ecs/utils/error.js';
+/** Magic for the combined world-snapshot frame (`"WRS0"` little-endian). Distinct
+ * from the SAB `STORE_MAGIC` so a bare dense snapshot fed to `restore` is
+ * rejected with a clear error instead of being mis-parsed as a combined frame. */
+export declare const WORLD_SNAPSHOT_MAGIC = 810766935;
+export { ECSRestoreError };
+export { ECS_SNAPSHOT_VERSION };
+export type { ArchetypeRowState, HostState };
+/** Serialize host-state to a self-contained little-endian byte buffer. Layout:
+ *
+ *   [u32 tick][u32 highWater][u32 alive_count]
+ *   [u32 freeCount][u32 free_index × freeCount]
+ *   [u32 archCount][(u32 id, u32 length, u32 enabled_count) × archCount]
+ */
+export declare function serializeHostState(hs: HostState): Uint8Array;
+/** Parse host-state bytes produced by `serializeHostState`. Throws
+ * `ECSRestoreError` on truncation or a trailing-byte (non-canonical) buffer. */
+export declare function parseHostState(bytes: Uint8Array): HostState;
+/** Assemble the combined world-snapshot frame from its three sections. Layout:
+ *
+ *   [u32 magic][u32 version][u32 denseLen][u32 sparseLen][u32 hostLen]
+ *   [dense][sparse][host]
+ */
+export declare function frameWorldSnapshot(dense: Uint8Array, sparse: Uint8Array, host: Uint8Array): Uint8Array;
+/** The three sections of a combined frame, as zero-copy subviews over `bytes`. */
+export interface WorldSnapshotSections {
+    readonly dense: Uint8Array;
+    readonly sparse: Uint8Array;
+    readonly host: Uint8Array;
+}
+/** Split a combined frame back into its sections. Validates magic, version, and
+ * an exact (no trailing bytes) frame. Throws `ECSRestoreError` otherwise. */
+export declare function unframeWorldSnapshot(bytes: Uint8Array): WorldSnapshotSections;
+/**
+ * Fail-closed registration guard, read **directly from the snapshot's dense
+ * bytes** so it can run before the dense backing is touched. `restore`
+ * builds the restored store through the live world's in-place allocator,
+ * which reuses the live backing buffer, so validating a
+ * *materialised* `ColumnStore` would already have overwritten live column data
+ * (the buffer is overwritten inside `restoreColumnStore`, before any post-build
+ * check could run). Parsing the descriptors off the raw `dense` `Uint8Array`
+ * keeps the check non-mutating, so a mismatch leaves the live world untouched.
+ *
+ * Asserts: the dense section's SAB magic and ABI, and that its archetype set,
+ * its per-archetype `componentMask` and its per-column
+ * `(componentId, fieldId, typeTag)`
+ * match the live store's exactly (so every live `Archetype.refreshViews` finds
+ * its region and no snapshot archetype is orphaned), and that the entity-index
+ * capacity matches (the region is sized once at construction). The archetype
+ * graph is rebuilt from registration code, not the snapshot (mirroring
+ * `restoreSparse`'s "registered in the same order" contract). Throws
+ * `ECSRestoreError` on any mismatch and malformed section.
+ */
+export declare function assertDenseMatchesLive(dense: Uint8Array, live: ReadonlyMap<number, ArchetypeViews>, liveEntityIndexCapacity: number): void;
+//# sourceMappingURL=resume.d.ts.map

package/dist/plugins/snapshots/resume.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resume.d.ts","sourceRoot":"","sources":["../../../src/plugins/snapshots/resume.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AAEH,OAAO,EACN,oBAAoB,EACpB,KAAK,iBAAiB,EACtB,KAAK,SAAS,EACd,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAaN,KAAK,cAAc,EACnB,MAAM,kBAAkB,CAAC;AAE1B;;kFAEkF;AAClF,eAAO,MAAM,oBAAoB,YAAa,CAAC;AAM/C,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAE,eAAe,EAAE,CAAC;AAI3B,OAAO,EAAE,oBAAoB,EAAE,CAAC;AAChC,YAAY,EAAE,iBAAiB,EAAE,SAAS,EAAE,CAAC;AAI7C;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,EAAE,EAAE,SAAS,GAAG,UAAU,CAwB5D;AAED;gFACgF;AAChF,wBAAgB,cAAc,CAAC,KAAK,EAAE,UAAU,GAAG,SAAS,CAqC3D;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CACjC,KAAK,EAAE,UAAU,EACjB,MAAM,EAAE,UAAU,EAClB,IAAI,EAAE,UAAU,GACd,UAAU,CAaZ;AAED,kFAAkF;AAClF,MAAM,WAAW,qBAAqB;IACrC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAC5B,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;CAC1B;AAED;6EAC6E;AAC7E,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,UAAU,GAAG,qBAAqB,CAuC7E;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,sBAAsB,CACrC,KAAK,EAAE,UAAU,EACjB,IAAI,EAAE,WAAW,CAAC,MAAM,EAAE,cAAc,CAAC,EACzC,uBAAuB,EAAE,MAAM,GAC7B,IAAI,CA4GN"}

package/dist/plugins/snapshots/snapshot_service.d.cts

@@ -0,0 +1,59 @@
+import { EntityAllocator } from '../../core/ecs/entity_allocator.cjs';
+import { SnapshotHooks, SnapshotHost } from '../../core/ecs/snapshot.cjs';
+export declare class SnapshotService implements SnapshotHooks {
+    private readonly _host;
+    /** The allocator is its own snapshot seam: a free-list copy on
+     * capture, `setHighWater` and `restoreHostState` on mount. */
+    private readonly _allocator;
+    constructor(host: SnapshotHost, allocator: EntityAllocator);
+    /** Serialize the sparse stores **and** relation side data to a self-contained
+     * byte buffer, the sparse half of a world snapshot (the dense half is the
+     * SAB snapshot). Two framed sections: the sparse stores (`snapshotSparseStores`,
+     * where the exclusive relation targets and the multi membership ride) followed
+     * 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. The reverse index
+     * is derived and never serialized, `restoreSparse` rebuilds it. */
+    snapshotSparse(): Uint8Array;
+    /** Repopulate the sparse stores from `snapshotSparse` bytes, replacing all
+     * current sparse data (full-equality round-trip of membership and data), then
+     * rebuild every relation's derived side indices: multi forward sets from the
+     * relation section, and the reverse index for both cardinalities (exclusive
+     * from the newly restored sparse target field, multi from the rebuilt forward
+     * sets). The sparse components and relations must already be registered in
+     * the same order, restore carries data, not the registration (which is
+     * code). Throws `SparseRestoreError` if the snapshot's shape, field identity,
+     * entity-index bounds, or frame length don't validate. */
+    restoreSparse(bytes: Uint8Array): void;
+    /** Rebuild every relation's derived side indices after the sparse stores have
+     * been restored. `restoreRelations` resets all relations, rebuilds the multi
+     * forward sets and their reverse edges from `relBytes`, and validates shape.
+     * The exclusive reverse index can't be carried in the bytes (it's derivable),
+     * so it's rebuilt here from the backing sparse store: every member row holds
+     * `(source index → target EntityID)`, which is exactly one reverse edge. */
+    private _rebuildRelationIndices;
+    /** Capture the full live world to one self-contained byte buffer that
+     * `restore` can mount back onto a live, ticking world. Three
+     * sections (see `resume.ts`): the dense SAB column bytes, the sparse and
+     * relation bytes, and the host-side bookkeeping the SAB omits. */
+    snapshot(): Uint8Array;
+    /** Gather the host-side state a snapshot carries alongside the dense and
+     * sparse bytes, see `snapshot()`. The free-list is copied, because it is a
+     * live mutable. */
+    private _collectHostState;
+    /** Mount a `snapshot()` buffer onto the live world and leave it ready to keep
+     * ticking. Fails closed on a malformed frame or a registration mismatch
+     * before any live state is touched. */
+    restore(bytes: Uint8Array): void;
+    /** Read-only validation of a `snapshotSparse` Section (the framed
+     * `[sparseLen][relLen][sparse][rel]` buffer) against the live registry, used
+     * by `restore` to fail closed on a sparse-registration mismatch before the
+     * dense mount commits. Mirrors `restoreSparse`'s frame check, then validates the
+     * sparse-stores sub-section without mutating. A relation-registration difference
+     * surfaces here too: every `registerRelation` adds a backing sparse store, so a
+     * differing relation set changes the sparse store count or its schema. Throws
+     * `SparseRestoreError` on a mismatch. */
+    private _assertSparseMatchesLive;
+}
+//# sourceMappingURL=snapshot_service.d.ts.map

package/dist/plugins/snapshots/snapshot_service.d.ts

@@ -0,0 +1,59 @@
+import { EntityAllocator } from '../../core/ecs/entity_allocator.js';
+import { SnapshotHooks, SnapshotHost } from '../../core/ecs/snapshot.js';
+export declare class SnapshotService implements SnapshotHooks {
+    private readonly _host;
+    /** The allocator is its own snapshot seam: a free-list copy on
+     * capture, `setHighWater` and `restoreHostState` on mount. */
+    private readonly _allocator;
+    constructor(host: SnapshotHost, allocator: EntityAllocator);
+    /** Serialize the sparse stores **and** relation side data to a self-contained
+     * byte buffer, the sparse half of a world snapshot (the dense half is the
+     * SAB snapshot). Two framed sections: the sparse stores (`snapshotSparseStores`,
+     * where the exclusive relation targets and the multi membership ride) followed
+     * 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. The reverse index
+     * is derived and never serialized, `restoreSparse` rebuilds it. */
+    snapshotSparse(): Uint8Array;
+    /** Repopulate the sparse stores from `snapshotSparse` bytes, replacing all
+     * current sparse data (full-equality round-trip of membership and data), then
+     * rebuild every relation's derived side indices: multi forward sets from the
+     * relation section, and the reverse index for both cardinalities (exclusive
+     * from the newly restored sparse target field, multi from the rebuilt forward
+     * sets). The sparse components and relations must already be registered in
+     * the same order, restore carries data, not the registration (which is
+     * code). Throws `SparseRestoreError` if the snapshot's shape, field identity,
+     * entity-index bounds, or frame length don't validate. */
+    restoreSparse(bytes: Uint8Array): void;
+    /** Rebuild every relation's derived side indices after the sparse stores have
+     * been restored. `restoreRelations` resets all relations, rebuilds the multi
+     * forward sets and their reverse edges from `relBytes`, and validates shape.
+     * The exclusive reverse index can't be carried in the bytes (it's derivable),
+     * so it's rebuilt here from the backing sparse store: every member row holds
+     * `(source index → target EntityID)`, which is exactly one reverse edge. */
+    private _rebuildRelationIndices;
+    /** Capture the full live world to one self-contained byte buffer that
+     * `restore` can mount back onto a live, ticking world. Three
+     * sections (see `resume.ts`): the dense SAB column bytes, the sparse and
+     * relation bytes, and the host-side bookkeeping the SAB omits. */
+    snapshot(): Uint8Array;
+    /** Gather the host-side state a snapshot carries alongside the dense and
+     * sparse bytes, see `snapshot()`. The free-list is copied, because it is a
+     * live mutable. */
+    private _collectHostState;
+    /** Mount a `snapshot()` buffer onto the live world and leave it ready to keep
+     * ticking. Fails closed on a malformed frame or a registration mismatch
+     * before any live state is touched. */
+    restore(bytes: Uint8Array): void;
+    /** Read-only validation of a `snapshotSparse` Section (the framed
+     * `[sparseLen][relLen][sparse][rel]` buffer) against the live registry, used
+     * by `restore` to fail closed on a sparse-registration mismatch before the
+     * dense mount commits. Mirrors `restoreSparse`'s frame check, then validates the
+     * sparse-stores sub-section without mutating. A relation-registration difference
+     * surfaces here too: every `registerRelation` adds a backing sparse store, so a
+     * differing relation set changes the sparse store count or its schema. Throws
+     * `SparseRestoreError` on a mismatch. */
+    private _assertSparseMatchesLive;
+}
+//# sourceMappingURL=snapshot_service.d.ts.map

package/dist/plugins/snapshots/snapshot_service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"snapshot_service.d.ts","sourceRoot":"","sources":["../../../src/plugins/snapshots/snapshot_service.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAIH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,iCAAiC,CAAC;AAOvE,OAAO,KAAK,EAGX,aAAa,EACb,YAAY,EACZ,MAAM,yBAAyB,CAAC;AAWjC,qBAAa,eAAgB,YAAW,aAAa;IACpD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAe;IACrC;kEAC8D;IAC9D,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAkB;gBAEjC,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,eAAe;IAK1D;;;;;;;;uEAQmE;IAC5D,cAAc,IAAI,UAAU;IAanC;;;;;;;;8DAQ0D;IACnD,aAAa,CAAC,KAAK,EAAE,UAAU,GAAG,IAAI;IAuB7C;;;;;gFAK4E;IAC5E,OAAO,CAAC,uBAAuB;IAW/B;;;sEAGkE;IAC3D,QAAQ,IAAI,UAAU;IAa7B;;uBAEmB;IACnB,OAAO,CAAC,iBAAiB;IAqBzB;;2CAEuC;IAChC,OAAO,CAAC,KAAK,EAAE,UAAU,GAAG,IAAI;IA+CvC;;;;;;;6CAOyC;IACzC,OAAO,CAAC,wBAAwB;CAgBhC"}

package/dist/plugins/snapshots.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const R=require("./relation_store-DQKSnxsm.cjs"),u=require("../index.cjs"),a=require("./abi-D3V-QUSf.cjs"),P=require("../internal.cjs");function F(t){return{magic:t.getUint32(a.STORE_HEADER_OFFSETS.magic,!0),simAbiVersion:t.getUint32(a.STORE_HEADER_OFFSETS.sim_abi_version,!0),viewStamp:t.getUint32(a.STORE_HEADER_OFFSETS.view_stamp,!0),capacity:t.getUint32(a.STORE_HEADER_OFFSETS.capacity,!0),archetypeCount:t.getUint32(a.STORE_HEADER_OFFSETS.archetype_count,!0),layoutDescriptorOff:t.getUint32(a.STORE_HEADER_OFFSETS.layout_descriptor_off,!0),commandRingOff:t.getUint32(a.STORE_HEADER_OFFSETS.command_ring_off,!0),actionRingOff:t.getUint32(a.STORE_HEADER_OFFSETS.action_ring_off,!0),entityIndexOff:t.getUint32(a.STORE_HEADER_OFFSETS.entity_index_off,!0),eventRingOff:t.getUint32(a.STORE_HEADER_OFFSETS.event_ring_off,!0),regionTableOff:t.getUint32(a.STORE_HEADER_OFFSETS.region_table_off,!0),regionTableCount:t.getUint32(a.STORE_HEADER_OFFSETS.region_table_count,!0),bindingsOff:t.getUint32(a.STORE_HEADER_OFFSETS.bindings_off,!0)}}const g={u8:0,i8:1,u16:2,i16:3,u32:4,i32:5,f32:6,f64:7},B=Object.freeze({[g.u8]:1,[g.i8]:1,[g.u16]:2,[g.i16]:2,[g.u32]:4,[g.i32]:4,[g.f32]:4,[g.f64]:8});function N(t,e,n){t.setUint16(e+a.COLUMN_DESCRIPTOR_OFFSETS.component_id,n.componentId,!0),t.setUint16(e+a.COLUMN_DESCRIPTOR_OFFSETS.field_id,n.fieldId,!0),t.setUint8(e+a.COLUMN_DESCRIPTOR_OFFSETS.type_tag,n.typeTag),t.setUint32(e+a.COLUMN_DESCRIPTOR_OFFSETS.byte_off,n.byteOff,!0),t.setUint16(e+a.COLUMN_DESCRIPTOR_OFFSETS.stride,n.stride,!0)}function M(t,e){return{componentId:t.getUint16(e+a.COLUMN_DESCRIPTOR_OFFSETS.component_id,!0),fieldId:t.getUint16(e+a.COLUMN_DESCRIPTOR_OFFSETS.field_id,!0),typeTag:t.getUint8(e+a.COLUMN_DESCRIPTOR_OFFSETS.type_tag),byteOff:t.getUint32(e+a.COLUMN_DESCRIPTOR_OFFSETS.byte_off,!0),stride:t.getUint16(e+a.COLUMN_DESCRIPTOR_OFFSETS.stride,!0)}}function Y(t,e=a.ARCHETYPE_DESCRIPTOR_HEADER_BYTES){return e+t*a.COLUMN_DESCRIPTOR_BYTES}function V(t,e,n){t.setUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.archetype_id,n.archetypeId,!0);for(let r=0;r<a.COMPONENT_MASK_WORDS;r++)t.setUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.component_mask+r*4,n.componentMask[r]??0,!0);t.setUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.row_count,n.rowCount,!0),t.setUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.row_capacity,n.rowCapacity,!0),t.setUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.column_count,n.columns.length,!0),t.setUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.enabled_count,n.enabledCount,!0),t.setUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.entity_ids_off,0,!0);let o=e+a.ARCHETYPE_DESCRIPTOR_HEADER_BYTES;for(let r=0;r<n.columns.length;r++)N(t,o,n.columns[r]),o+=a.COLUMN_DESCRIPTOR_BYTES;return o}function v(t,e,n=a.ARCHETYPE_DESCRIPTOR_HEADER_BYTES){const o=t.getUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.column_count,!0),r=new Array(o);let s=e+n;for(let i=0;i<o;i++)r[i]=M(t,s),s+=a.COLUMN_DESCRIPTOR_BYTES;const c=new Array(a.COMPONENT_MASK_WORDS);for(let i=0;i<a.COMPONENT_MASK_WORDS;i++)c[i]=t.getUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.component_mask+i*4,!0);return{archetypeId:t.getUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.archetype_id,!0),componentMask:c,rowCount:t.getUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.row_count,!0),rowCapacity:t.getUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.row_capacity,!0),enabledCount:t.getUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.enabled_count,!0),columns:r}}function x(t,e,n){let o=e;for(let r=0;r<n.length;r++)o=V(t,o,n[r]);return o}function C(t,e,n,o=a.ARCHETYPE_DESCRIPTOR_HEADER_BYTES){const r=new Array(n);let s=e;for(let c=0;c<n;c++){const i=v(t,s,o);r[c]=i,s+=Y(i.columns.length,o)}return r}class k extends Error{constructor(){super('SharedArrayBuffer is not available in this runtime. The chosen world backing is SAB-based and cannot start without it. In browsers this requires cross-origin isolation: serve the page with `Cross-Origin-Opener-Policy: same-origin` and `Cross-Origin-Embedder-Policy: require-corp` (or `credentialless`). Alternatively choose the pure-TS heap profile (`memory: { backing: "heap" }`), which is backed by a plain ArrayBuffer and needs no SAB and no COOP+COEP. In Bun or Node SAB is available unconditionally. If you see this there, the runtime is older than expected, or the global was shadowed.'),this.name="SabUnavailableError"}}const G=t=>{if(typeof SharedArrayBuffer>"u")throw new k;return new SharedArrayBuffer(t)},X=16,W={capacity:4};function q(t,e){return t<<16|e}const $=2**31;class z extends Error{constructor(e){super(`SAB column layout offset ${e} reaches or exceeds the 2³¹ (${$}-byte) ceiling. Past 2 GiB the signed-32-bit bitwise alignment math wraps to a negative or misaligned offset. This is a structural limit independent of the allocator cap, so a single store cannot back more than 2 GiB of column data.`),this.name="StoreLayoutOverflowError"}}function j(t,e){if(t+e>$)throw new z(t);return t+(e-1)&~(e-1)}function K(t,e,n,o,r){const s=e+o;switch(n){case g.u8:return new Uint8Array(t,s,r);case g.i8:return new Int8Array(t,s,r);case g.u16:return new Uint16Array(t,s,r);case g.i16:return new Int16Array(t,s,r);case g.u32:return new Uint32Array(t,s,r);case g.i32:return new Int32Array(t,s,r);case g.f32:return new Float32Array(t,s,r);case g.f64:return new Float64Array(t,s,r)}}const U=16;function J(t){if(!Number.isInteger(t)||t<0)throw new RangeError(`createColumnStore: storeBase must be an integer >= 0, got ${t}`);if(t%U!==0)throw new RangeError(`createColumnStore: storeBase must be a multiple of ${U}, got ${t}`)}function Q(t,e,n){const o=new Map;for(let r=0;r<n.length;r++){const s=n[r],c=new Array(s.columns.length),i=new Map;for(let h=0;h<s.columns.length;h++){const E=s.columns[h],S={componentId:E.componentId,fieldId:E.fieldId,typeTag:E.typeTag,byteOff:E.byteOff,stride:E.stride,view:K(t,e,E.typeTag,E.byteOff,s.rowCapacity)};c[h]=S,i.set(q(E.componentId,E.fieldId),S)}o.set(s.archetypeId,{archetypeId:s.archetypeId,componentMask:s.componentMask,rowCapacity:s.rowCapacity,columns:i,columnsInOrder:c})}return o}function Z(t){const e=t.view.getUint32(a.STORE_HEADER_OFFSETS.capacity,!0);return new Uint8Array(t.buffer,t.storeBase,e)}const tt=Math.max(...Object.values(B));function et(t){const e=a.ARCHETYPE_DESCRIPTOR_HEADER_BYTES-a.LEGACY_ARCHETYPE_DESCRIPTOR_HEADER_BYTES;return j(t*e,tt)}function rt(t){const e=new DataView(t.buffer,t.byteOffset,t.byteLength),n=e.getUint32(a.STORE_HEADER_OFFSETS.layout_descriptor_off,!0),o=e.getUint32(a.STORE_HEADER_OFFSETS.archetype_count,!0),r=et(o);if(r===0)return t;const s=C(e,n,o,a.LEGACY_ARCHETYPE_DESCRIPTOR_HEADER_BYTES),c=new Uint8Array(t.byteLength+r);c.set(t.subarray(0,n),0),c.set(t.subarray(n),n+r);const i=new DataView(c.buffer),h=s.map(S=>({...S,columns:S.columns.map(f=>({...f,byteOff:f.byteOff+r}))}));x(i,n,h);const E=e.getUint32(a.STORE_HEADER_OFFSETS.capacity,!0);return i.setUint32(a.STORE_HEADER_OFFSETS.capacity,E+r,!0),c}function nt(t,e=G,n={}){const o=n.storeBase??0;J(o);const r=new DataView(t.buffer,t.byteOffset,t.byteLength);if(t.byteLength<a.STORE_HEADER_BYTES)throw new u.StoreRestoreError(`snapshot too small: ${t.byteLength} bytes (header alone needs ${a.STORE_HEADER_BYTES})`);const s=r.getUint32(a.STORE_HEADER_OFFSETS.magic,!0);if(s!==a.STORE_MAGIC)throw new u.StoreRestoreError(`bad magic: 0x${s.toString(16).padStart(8,"0")} (expected 0x${a.STORE_MAGIC.toString(16).padStart(8,"0")})`);const c=r.getUint32(a.STORE_HEADER_OFFSETS.sim_abi_version,!0);if(c!==a.SIM_ABI_VERSION&&c!==a.LEGACY_ABSOLUTE_ABI_VERSION)throw new u.StoreRestoreError(`incompatible sim_abi_version: snapshot=${c}, build=${a.SIM_ABI_VERSION}`);const i=r.getUint32(a.STORE_HEADER_OFFSETS.layout_descriptor_off,!0);if(i>t.byteLength)throw new u.StoreRestoreError(`layout_descriptor_off ${i} is outside the snapshot (${t.byteLength} bytes)`);let h=t;if(c===a.LEGACY_ABSOLUTE_ABI_VERSION)try{h=rt(t)}catch(_){throw _ instanceof RangeError?new u.StoreRestoreError(`snapshot layout is corrupt or truncated: a version 0 descriptor reads past the ${t.byteLength}-byte span (${_.message})`):_}const E=e(o+h.byteLength);new Uint8Array(E,o,h.byteLength).set(h);const S=new DataView(E,o);S.setUint32(a.STORE_HEADER_OFFSETS.sim_abi_version,a.SIM_ABI_VERSION,!0);const f=F(S);if(f.layoutDescriptorOff<0||f.layoutDescriptorOff>h.byteLength)throw new u.StoreRestoreError(`layout_descriptor_off ${f.layoutDescriptorOff} is outside the snapshot (${h.byteLength} bytes)`);try{const _=C(S,f.layoutDescriptorOff,f.archetypeCount),l=Q(E,o,_);return{buffer:E,view:S,header:f,storeBase:o,archetypes:l}}catch(_){throw _ instanceof RangeError?new u.StoreRestoreError(`snapshot layout is corrupt or truncated: a descriptor offset or column extent reads past the ${h.byteLength}-byte span (${_.message})`):_}}const ot=2166136261,st=16777619;function w(t,e){return t=(t^e&255)>>>0,Math.imul(t,st)>>>0}const I=12,b=4,O=8;function D(t,e){let n=ot;const o=r=>{for(let s=0;s<r.length;s++)n=w(n,r.charCodeAt(s))};for(let r=0;r<t.length;r++)o(t[r]),n=w(n,31),o(e[r]),n=w(n,30);return n>>>0}function at(t){let e=4;for(let s=0;s<t.length;s++){const c=t[s],i=c.fieldNames.length;e+=I+c.size*(b+i*O)}const n=new Uint8Array(e),o=new DataView(n.buffer);let r=0;o.setUint32(r,t.length,!0),r+=4;for(let s=0;s<t.length;s++){const c=t[s],i=c.fieldNames.length,h=c.canonicalIndices();o.setUint32(r,i,!0),r+=4,o.setUint32(r,D(c.fieldNames,c.fieldTypes),!0),r+=4,o.setUint32(r,h.length,!0),r+=4;for(let E=0;E<h.length;E++){const S=h[E];o.setUint32(r,S,!0),r+=4;const f=c.getRow(S);for(let _=0;_<i;_++)o.setFloat64(r,f[_],!0),r+=O}}return n}function it(t,e){const n=new DataView(e.buffer,e.byteOffset,e.byteLength),o=e.byteLength;let r=0;const s=i=>{if(r+i>o)throw new u.SparseRestoreError(`sparse snapshot truncated: need ${i} more bytes at offset ${r}, have ${o-r}`)};s(4);const c=n.getUint32(r,!0);if(r+=4,c!==t.length)throw new u.SparseRestoreError(`sparse store count mismatch: snapshot=${c}, registered=${t.length}`);for(let i=0;i<t.length;i++){const h=t[i];s(I);const E=n.getUint32(r,!0);r+=4;const S=n.getUint32(r,!0);r+=4;const f=n.getUint32(r,!0);if(r+=4,E!==h.fieldNames.length)throw new u.SparseRestoreError(`sparse store ${i} field-count mismatch: snapshot=${E}, registered=${h.fieldNames.length}`);const _=D(h.fieldNames,h.fieldTypes);if(S!==_)throw new u.SparseRestoreError(`sparse store ${i} schema identity mismatch: snapshot hash=${S}, registered=${_} (same field count, different field names or types, likely a registration-order divergence between the snapshot and restore worlds)`);h.clear();for(let l=0;l<f;l++){s(b+E*O);const d=n.getUint32(r,!0);if(r+=4,d>R.MAX_INDEX)throw new u.SparseRestoreError(`sparse store ${i} member ${l} entity index ${d} exceeds MAX_INDEX (${R.MAX_INDEX})`);const p=new Array(E);for(let T=0;T<E;T++)p[T]=n.getFloat64(r,!0),r+=O;h.setRawRow(d,p)}}if(r!==o)throw new u.SparseRestoreError(`sparse snapshot has ${o-r} trailing bytes after the last store (not a canonical encoding)`)}function ct(t,e){const n=new DataView(e.buffer,e.byteOffset,e.byteLength),o=e.byteLength;let r=0;const s=i=>{if(r+i>o)throw new u.SparseRestoreError(`sparse snapshot truncated: need ${i} more bytes at offset ${r}, have ${o-r}`)};s(4);const c=n.getUint32(r,!0);if(r+=4,c!==t.length)throw new u.SparseRestoreError(`sparse store count mismatch: snapshot=${c}, registered=${t.length}`);for(let i=0;i<t.length;i++){const h=t[i];s(I);const E=n.getUint32(r,!0);r+=4;const S=n.getUint32(r,!0);r+=4;const f=n.getUint32(r,!0);if(r+=4,E!==h.fieldNames.length)throw new u.SparseRestoreError(`sparse store ${i} field-count mismatch: snapshot=${E}, registered=${h.fieldNames.length}`);const _=D(h.fieldNames,h.fieldTypes);if(S!==_)throw new u.SparseRestoreError(`sparse store ${i} schema identity mismatch: snapshot hash=${S}, registered=${_} (same field count, different field names or types, likely a registration-order divergence between the snapshot and restore worlds)`);for(let l=0;l<f;l++){s(b+E*O);const d=n.getUint32(r,!0);if(r+=4,d>R.MAX_INDEX)throw new u.SparseRestoreError(`sparse store ${i} member ${l} entity index ${d} exceeds MAX_INDEX (${R.MAX_INDEX})`);r+=E*O}}if(r!==o)throw new u.SparseRestoreError(`sparse snapshot has ${o-r} trailing bytes after the last store (not a canonical encoding)`)}const m=1,A=810766935,y=4;function ht(t){const e=t.freeIndices.length,n=t.archetypeRows.length,o=y*(4+e+1+n*3),r=new Uint8Array(o),s=new DataView(r.buffer);let c=0;const i=h=>{s.setUint32(c,h,!0),c+=y};i(t.tick),i(t.entityHighWater),i(t.entityAliveCount),i(e);for(let h=0;h<e;h++)i(t.freeIndices[h]);i(n);for(let h=0;h<n;h++){const E=t.archetypeRows[h];i(E.archetypeId),i(E.length),i(E.enabledCount)}return r}function Et(t){const e=new DataView(t.buffer,t.byteOffset,t.byteLength),n=t.byteLength;let o=0;const r=l=>{if(o+l>n)throw new u.ECSRestoreError(`host-state truncated: need ${l} more bytes at offset ${o}, have ${n-o}`)},s=()=>{r(y);const l=e.getUint32(o,!0);return o+=y,l},c=s(),i=s(),h=s(),E=s(),S=new Array(E);for(let l=0;l<E;l++)S[l]=s();const f=s(),_=new Array(f);for(let l=0;l<f;l++){const d=s(),p=s(),T=s();_[l]={archetypeId:d,length:p,enabledCount:T}}if(o!==n)throw new u.ECSRestoreError(`host-state has ${n-o} trailing bytes after the last archetype (not a canonical encoding)`);return{tick:c,entityHighWater:i,entityAliveCount:h,freeIndices:S,archetypeRows:_}}function ut(t,e,n){const o=y*5,r=new Uint8Array(o+t.length+e.length+n.length),s=new DataView(r.buffer);return s.setUint32(0,A,!0),s.setUint32(4,m,!0),s.setUint32(8,t.length,!0),s.setUint32(12,e.length,!0),s.setUint32(16,n.length,!0),r.set(t,o),r.set(e,o+t.length),r.set(n,o+t.length+e.length),r}function lt(t){const e=y*5;if(t.byteLength<e)throw new u.ECSRestoreError(`world snapshot too small: ${t.byteLength} bytes (frame header needs ${e})`);const n=new DataView(t.buffer,t.byteOffset,t.byteLength),o=n.getUint32(0,!0);if(o!==A)throw new u.ECSRestoreError(`bad world-snapshot magic: 0x${o.toString(16).padStart(8,"0")} (expected 0x${A.toString(16).padStart(8,"0")}). A bare dense (SAB) snapshot is not a combined world snapshot, pass the bytes from ECS.snapshot(), not columnStoreBytesView().`);const r=n.getUint32(4,!0);if(r!==m)throw new u.ECSRestoreError(`incompatible world-snapshot version: snapshot=${r}, build=${m}`);const s=n.getUint32(8,!0),c=n.getUint32(12,!0),i=n.getUint32(16,!0);if(e+s+c+i!==t.byteLength)throw new u.ECSRestoreError(`world-snapshot frame mismatch: header declares ${e}+${s}+${c}+${i}=${e+s+c+i} bytes, buffer is ${t.byteLength}`);const h=t.byteOffset,E=t.buffer;return{dense:new Uint8Array(E,h+e,s),sparse:new Uint8Array(E,h+e+s,c),host:new Uint8Array(E,h+e+s+c,i)}}function St(t,e,n){if(t.byteLength<a.STORE_HEADER_BYTES)throw new u.ECSRestoreError(`dense section too small: ${t.byteLength} bytes (SAB header needs ${a.STORE_HEADER_BYTES})`);const o=new DataView(t.buffer,t.byteOffset,t.byteLength),r=o.getUint32(a.STORE_HEADER_OFFSETS.magic,!0);if(r!==a.STORE_MAGIC)throw new u.ECSRestoreError(`dense section bad magic: 0x${r.toString(16).padStart(8,"0")} (expected SAB magic 0x${a.STORE_MAGIC.toString(16).padStart(8,"0")})`);const s=o.getUint32(a.STORE_HEADER_OFFSETS.sim_abi_version,!0);if(s!==a.SIM_ABI_VERSION&&s!==a.LEGACY_ABSOLUTE_ABI_VERSION)throw new u.ECSRestoreError(`dense section incompatible sim_abi_version: snapshot=${s}, build=${a.SIM_ABI_VERSION}`);const c=F(o);if(c.layoutDescriptorOff<0||c.layoutDescriptorOff>t.byteLength)throw new u.ECSRestoreError(`dense layoutDescriptorOff ${c.layoutDescriptorOff} is outside the section (${t.byteLength} bytes)`);const i=c.entityIndexOff;if(i<0||i+X>t.byteLength)throw new u.ECSRestoreError(`dense entityIndexOff ${i} is outside the section (${t.byteLength} bytes)`);const h=o.getUint32(i+W.capacity,!0);if(h!==n)throw new u.ECSRestoreError(`entity-index capacity mismatch: live=${n}, snapshot=${h}`);let E;try{E=C(o,c.layoutDescriptorOff,c.archetypeCount,s===a.LEGACY_ABSOLUTE_ABI_VERSION?a.LEGACY_ARCHETYPE_DESCRIPTOR_HEADER_BYTES:a.ARCHETYPE_DESCRIPTOR_HEADER_BYTES)}catch(S){throw S instanceof RangeError?new u.ECSRestoreError(`dense section layout is corrupt or truncated: a descriptor reads past the ${t.byteLength}-byte section (${S.message})`):S}if(e.size!==E.length)throw new u.ECSRestoreError(`archetype-set mismatch: the live world has ${e.size} SAB archetypes, the snapshot has ${E.length}. restore requires an identical archetype set. Prewarm the world so its archetype set is stable.`);for(let S=0;S<E.length;S++){const f=E[S],_=e.get(f.archetypeId);if(_===void 0)throw new u.ECSRestoreError(`archetype-set mismatch: snapshot archetype ${f.archetypeId} is absent from the live world`);if(!ft(_.componentMask,f.componentMask))throw new u.ECSRestoreError(`archetype ${f.archetypeId} component-mask mismatch between the live world and the snapshot (different component registration)`);const l=_.columnsInOrder,d=f.columns;if(l.length!==d.length)throw new u.ECSRestoreError(`archetype ${f.archetypeId} column-count mismatch: live=${l.length}, snapshot=${d.length}`);for(let p=0;p<l.length;p++)if(l[p].componentId!==d[p].componentId||l[p].fieldId!==d[p].fieldId||l[p].typeTag!==d[p].typeTag)throw new u.ECSRestoreError(`archetype ${f.archetypeId} column ${p} layout mismatch: live=(c${l[p].componentId},f${l[p].fieldId},t${l[p].typeTag}), snapshot=(c${d[p].componentId},f${d[p].fieldId},t${d[p].typeTag})`)}}function ft(t,e){if(t.length!==e.length)return!1;for(let n=0;n<t.length;n++)if(t[n]!==e[n])return!1;return!0}class _t{_host;_allocator;constructor(e,n){this._host=e,this._allocator=n}snapshotSparse(){const e=at(this._host.sparseStores()),n=R.snapshotRelations(this._host.relationStores()),o=new Uint8Array(8+e.length+n.length),r=new DataView(o.buffer);return r.setUint32(0,e.length,!0),r.setUint32(4,n.length,!0),o.set(e,8),o.set(n,8+e.length),o}restoreSparse(e){const n=new DataView(e.buffer,e.byteOffset,e.byteLength);if(e.byteLength<8)throw new u.SparseRestoreError(`sparse snapshot truncated: need 8 header bytes, have ${e.byteLength}`);const o=n.getUint32(0,!0),r=n.getUint32(4,!0);if(8+o+r!==e.byteLength)throw new u.SparseRestoreError(`sparse snapshot frame mismatch: header declares 8+${o}+${r}=${8+o+r} bytes, buffer is ${e.byteLength}`);it(this._host.sparseStores(),e.subarray(8,8+o)),this._rebuildRelationIndices(e.subarray(8+o,8+o+r))}_rebuildRelationIndices(e){const n=this._host.generations(),o=s=>R.createEntityId(s,n[s]),r=this._host.relationStores();R.restoreRelations(r,e,o);for(let s=0;s<r.length;s++)r[s].rebuildReverse(o)}snapshot(){this._host.publishRowCounts();const e=new Uint8Array(Z(this._host.columnStore())),n=this.snapshotSparse(),o=ht(this._collectHostState());return ut(e,n,o)}_collectHostState(){const e=[],n=this._host.archetypes();for(let o=0;o<n.length;o++){const r=n[o];r.isBufferBacked&&e.push({archetypeId:r.id,length:r.length,enabledCount:r.enabledCount})}return{tick:this._host.tick(),entityHighWater:this._allocator.highWater,entityAliveCount:this._allocator.aliveCount,freeIndices:this._allocator.snapshotFreeIndices(),archetypeRows:e}}restore(e){const n=lt(e),o=Et(n.host);St(n.dense,this._host.columnStore().archetypes,this._host.entityIndexCapacity()),this._assertSparseMatchesLive(n.sparse);const r=nt(n.dense,this._host.bufferAllocator(),{storeBase:this._host.columnStore().storeBase});this._host.mountRestoredDense(r),this._host.reconstructHostRows(o),this._allocator.restoreHostState(o.freeIndices,o.entityAliveCount),this._host.setTick(o.tick),this._host.invalidateCaches(),this.restoreSparse(n.sparse)}_assertSparseMatchesLive(e){const n=new DataView(e.buffer,e.byteOffset,e.byteLength);if(e.byteLength<8)throw new u.SparseRestoreError(`sparse snapshot truncated: need 8 header bytes, have ${e.byteLength}`);const o=n.getUint32(0,!0),r=n.getUint32(4,!0);if(8+o+r!==e.byteLength)throw new u.SparseRestoreError(`sparse snapshot frame mismatch: header declares 8+${o}+${r}=${8+o+r} bytes, buffer is ${e.byteLength}`);ct(this._host.sparseStores(),e.subarray(8,8+o))}}class L{_store;constructor(e){this._store=e}get deterministic(){return this._store.deterministic}stateHash(){return this._store.stateHash()}}for(const t of["capture","restore","captureSparse","restoreSparse"])L.prototype[t]=function(){throw P.pluginMissingError("snapshots",`ecs.snapshots.${t}`)};class H extends L{capture(){return this._store.snapshot()}restore(e){this._store.restore(e)}captureSparse(){return this._store.snapshotSparse()}restoreSparse(e){this._store.restoreSparse(e)}}function pt(){return{name:"snapshots",install(t){const e=t.store;return e.installSnapshots(new _t(e.snapshotHost(),e.entityAllocator)),{snapshots:new H(e)}}}}exports.ECSSnapshotsFull=H;exports.snapshots=pt;

package/dist/plugins/snapshots.d.cts

@@ -0,0 +1 @@
+export * from "./snapshots/index.cjs";

package/dist/plugins/snapshots.d.ts

@@ -0,0 +1 @@
+export * from "./snapshots/index.js";

package/dist/plugins/snapshots.development.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const R=require("./relation_store-RBhpcE28.cjs"),u=require("../index.development.cjs"),a=require("./abi-D3V-QUSf.cjs"),P=require("../internal.development.cjs");function F(t){return{magic:t.getUint32(a.STORE_HEADER_OFFSETS.magic,!0),simAbiVersion:t.getUint32(a.STORE_HEADER_OFFSETS.sim_abi_version,!0),viewStamp:t.getUint32(a.STORE_HEADER_OFFSETS.view_stamp,!0),capacity:t.getUint32(a.STORE_HEADER_OFFSETS.capacity,!0),archetypeCount:t.getUint32(a.STORE_HEADER_OFFSETS.archetype_count,!0),layoutDescriptorOff:t.getUint32(a.STORE_HEADER_OFFSETS.layout_descriptor_off,!0),commandRingOff:t.getUint32(a.STORE_HEADER_OFFSETS.command_ring_off,!0),actionRingOff:t.getUint32(a.STORE_HEADER_OFFSETS.action_ring_off,!0),entityIndexOff:t.getUint32(a.STORE_HEADER_OFFSETS.entity_index_off,!0),eventRingOff:t.getUint32(a.STORE_HEADER_OFFSETS.event_ring_off,!0),regionTableOff:t.getUint32(a.STORE_HEADER_OFFSETS.region_table_off,!0),regionTableCount:t.getUint32(a.STORE_HEADER_OFFSETS.region_table_count,!0),bindingsOff:t.getUint32(a.STORE_HEADER_OFFSETS.bindings_off,!0)}}const g={u8:0,i8:1,u16:2,i16:3,u32:4,i32:5,f32:6,f64:7},B=Object.freeze({[g.u8]:1,[g.i8]:1,[g.u16]:2,[g.i16]:2,[g.u32]:4,[g.i32]:4,[g.f32]:4,[g.f64]:8});function N(t,e,n){t.setUint16(e+a.COLUMN_DESCRIPTOR_OFFSETS.component_id,n.componentId,!0),t.setUint16(e+a.COLUMN_DESCRIPTOR_OFFSETS.field_id,n.fieldId,!0),t.setUint8(e+a.COLUMN_DESCRIPTOR_OFFSETS.type_tag,n.typeTag),t.setUint32(e+a.COLUMN_DESCRIPTOR_OFFSETS.byte_off,n.byteOff,!0),t.setUint16(e+a.COLUMN_DESCRIPTOR_OFFSETS.stride,n.stride,!0)}function M(t,e){return{componentId:t.getUint16(e+a.COLUMN_DESCRIPTOR_OFFSETS.component_id,!0),fieldId:t.getUint16(e+a.COLUMN_DESCRIPTOR_OFFSETS.field_id,!0),typeTag:t.getUint8(e+a.COLUMN_DESCRIPTOR_OFFSETS.type_tag),byteOff:t.getUint32(e+a.COLUMN_DESCRIPTOR_OFFSETS.byte_off,!0),stride:t.getUint16(e+a.COLUMN_DESCRIPTOR_OFFSETS.stride,!0)}}function Y(t,e=a.ARCHETYPE_DESCRIPTOR_HEADER_BYTES){return e+t*a.COLUMN_DESCRIPTOR_BYTES}function V(t,e,n){t.setUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.archetype_id,n.archetypeId,!0);for(let r=0;r<a.COMPONENT_MASK_WORDS;r++)t.setUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.component_mask+r*4,n.componentMask[r]??0,!0);t.setUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.row_count,n.rowCount,!0),t.setUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.row_capacity,n.rowCapacity,!0),t.setUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.column_count,n.columns.length,!0),t.setUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.enabled_count,n.enabledCount,!0),t.setUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.entity_ids_off,0,!0);let o=e+a.ARCHETYPE_DESCRIPTOR_HEADER_BYTES;for(let r=0;r<n.columns.length;r++)N(t,o,n.columns[r]),o+=a.COLUMN_DESCRIPTOR_BYTES;return o}function v(t,e,n=a.ARCHETYPE_DESCRIPTOR_HEADER_BYTES){const o=t.getUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.column_count,!0),r=new Array(o);let s=e+n;for(let i=0;i<o;i++)r[i]=M(t,s),s+=a.COLUMN_DESCRIPTOR_BYTES;const c=new Array(a.COMPONENT_MASK_WORDS);for(let i=0;i<a.COMPONENT_MASK_WORDS;i++)c[i]=t.getUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.component_mask+i*4,!0);return{archetypeId:t.getUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.archetype_id,!0),componentMask:c,rowCount:t.getUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.row_count,!0),rowCapacity:t.getUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.row_capacity,!0),enabledCount:t.getUint32(e+a.ARCHETYPE_DESCRIPTOR_OFFSETS.enabled_count,!0),columns:r}}function x(t,e,n){let o=e;for(let r=0;r<n.length;r++)o=V(t,o,n[r]);return o}function C(t,e,n,o=a.ARCHETYPE_DESCRIPTOR_HEADER_BYTES){const r=new Array(n);let s=e;for(let c=0;c<n;c++){const i=v(t,s,o);r[c]=i,s+=Y(i.columns.length,o)}return r}class k extends Error{constructor(){super('SharedArrayBuffer is not available in this runtime. The chosen world backing is SAB-based and cannot start without it. In browsers this requires cross-origin isolation: serve the page with `Cross-Origin-Opener-Policy: same-origin` and `Cross-Origin-Embedder-Policy: require-corp` (or `credentialless`). Alternatively choose the pure-TS heap profile (`memory: { backing: "heap" }`), which is backed by a plain ArrayBuffer and needs no SAB and no COOP+COEP. In Bun or Node SAB is available unconditionally. If you see this there, the runtime is older than expected, or the global was shadowed.'),this.name="SabUnavailableError"}}const G=t=>{if(typeof SharedArrayBuffer>"u")throw new k;return new SharedArrayBuffer(t)},X=16,W={capacity:4};function q(t,e){return t<<16|e}const $=2**31;class z extends Error{constructor(e){super(`SAB column layout offset ${e} reaches or exceeds the 2³¹ (${$}-byte) ceiling. Past 2 GiB the signed-32-bit bitwise alignment math wraps to a negative or misaligned offset. This is a structural limit independent of the allocator cap, so a single store cannot back more than 2 GiB of column data.`),this.name="StoreLayoutOverflowError"}}function j(t,e){if(t+e>$)throw new z(t);return t+(e-1)&~(e-1)}function K(t,e,n,o,r){const s=e+o;switch(n){case g.u8:return new Uint8Array(t,s,r);case g.i8:return new Int8Array(t,s,r);case g.u16:return new Uint16Array(t,s,r);case g.i16:return new Int16Array(t,s,r);case g.u32:return new Uint32Array(t,s,r);case g.i32:return new Int32Array(t,s,r);case g.f32:return new Float32Array(t,s,r);case g.f64:return new Float64Array(t,s,r)}}const U=16;function J(t){if(!Number.isInteger(t)||t<0)throw new RangeError(`createColumnStore: storeBase must be an integer >= 0, got ${t}`);if(t%U!==0)throw new RangeError(`createColumnStore: storeBase must be a multiple of ${U}, got ${t}`)}function Q(t,e,n){const o=new Map;for(let r=0;r<n.length;r++){const s=n[r],c=new Array(s.columns.length),i=new Map;for(let h=0;h<s.columns.length;h++){const E=s.columns[h],S={componentId:E.componentId,fieldId:E.fieldId,typeTag:E.typeTag,byteOff:E.byteOff,stride:E.stride,view:K(t,e,E.typeTag,E.byteOff,s.rowCapacity)};c[h]=S,i.set(q(E.componentId,E.fieldId),S)}o.set(s.archetypeId,{archetypeId:s.archetypeId,componentMask:s.componentMask,rowCapacity:s.rowCapacity,columns:i,columnsInOrder:c})}return o}function Z(t){const e=t.view.getUint32(a.STORE_HEADER_OFFSETS.capacity,!0);return new Uint8Array(t.buffer,t.storeBase,e)}const tt=Math.max(...Object.values(B));function et(t){const e=a.ARCHETYPE_DESCRIPTOR_HEADER_BYTES-a.LEGACY_ARCHETYPE_DESCRIPTOR_HEADER_BYTES;return j(t*e,tt)}function rt(t){const e=new DataView(t.buffer,t.byteOffset,t.byteLength),n=e.getUint32(a.STORE_HEADER_OFFSETS.layout_descriptor_off,!0),o=e.getUint32(a.STORE_HEADER_OFFSETS.archetype_count,!0),r=et(o);if(r===0)return t;const s=C(e,n,o,a.LEGACY_ARCHETYPE_DESCRIPTOR_HEADER_BYTES),c=new Uint8Array(t.byteLength+r);c.set(t.subarray(0,n),0),c.set(t.subarray(n),n+r);const i=new DataView(c.buffer),h=s.map(S=>({...S,columns:S.columns.map(f=>({...f,byteOff:f.byteOff+r}))}));x(i,n,h);const E=e.getUint32(a.STORE_HEADER_OFFSETS.capacity,!0);return i.setUint32(a.STORE_HEADER_OFFSETS.capacity,E+r,!0),c}function nt(t,e=G,n={}){const o=n.storeBase??0;J(o);const r=new DataView(t.buffer,t.byteOffset,t.byteLength);if(t.byteLength<a.STORE_HEADER_BYTES)throw new u.StoreRestoreError(`snapshot too small: ${t.byteLength} bytes (header alone needs ${a.STORE_HEADER_BYTES})`);const s=r.getUint32(a.STORE_HEADER_OFFSETS.magic,!0);if(s!==a.STORE_MAGIC)throw new u.StoreRestoreError(`bad magic: 0x${s.toString(16).padStart(8,"0")} (expected 0x${a.STORE_MAGIC.toString(16).padStart(8,"0")})`);const c=r.getUint32(a.STORE_HEADER_OFFSETS.sim_abi_version,!0);if(c!==a.SIM_ABI_VERSION&&c!==a.LEGACY_ABSOLUTE_ABI_VERSION)throw new u.StoreRestoreError(`incompatible sim_abi_version: snapshot=${c}, build=${a.SIM_ABI_VERSION}`);const i=r.getUint32(a.STORE_HEADER_OFFSETS.layout_descriptor_off,!0);if(i>t.byteLength)throw new u.StoreRestoreError(`layout_descriptor_off ${i} is outside the snapshot (${t.byteLength} bytes)`);let h=t;if(c===a.LEGACY_ABSOLUTE_ABI_VERSION)try{h=rt(t)}catch(_){throw _ instanceof RangeError?new u.StoreRestoreError(`snapshot layout is corrupt or truncated: a version 0 descriptor reads past the ${t.byteLength}-byte span (${_.message})`):_}const E=e(o+h.byteLength);new Uint8Array(E,o,h.byteLength).set(h);const S=new DataView(E,o);S.setUint32(a.STORE_HEADER_OFFSETS.sim_abi_version,a.SIM_ABI_VERSION,!0);const f=F(S);if(f.layoutDescriptorOff<0||f.layoutDescriptorOff>h.byteLength)throw new u.StoreRestoreError(`layout_descriptor_off ${f.layoutDescriptorOff} is outside the snapshot (${h.byteLength} bytes)`);try{const _=C(S,f.layoutDescriptorOff,f.archetypeCount),l=Q(E,o,_);return{buffer:E,view:S,header:f,storeBase:o,archetypes:l}}catch(_){throw _ instanceof RangeError?new u.StoreRestoreError(`snapshot layout is corrupt or truncated: a descriptor offset or column extent reads past the ${h.byteLength}-byte span (${_.message})`):_}}const ot=2166136261,st=16777619;function w(t,e){return t=(t^e&255)>>>0,Math.imul(t,st)>>>0}const I=12,b=4,O=8;function D(t,e){let n=ot;const o=r=>{for(let s=0;s<r.length;s++)n=w(n,r.charCodeAt(s))};for(let r=0;r<t.length;r++)o(t[r]),n=w(n,31),o(e[r]),n=w(n,30);return n>>>0}function at(t){let e=4;for(let s=0;s<t.length;s++){const c=t[s],i=c.fieldNames.length;e+=I+c.size*(b+i*O)}const n=new Uint8Array(e),o=new DataView(n.buffer);let r=0;o.setUint32(r,t.length,!0),r+=4;for(let s=0;s<t.length;s++){const c=t[s],i=c.fieldNames.length,h=c.canonicalIndices();o.setUint32(r,i,!0),r+=4,o.setUint32(r,D(c.fieldNames,c.fieldTypes),!0),r+=4,o.setUint32(r,h.length,!0),r+=4;for(let E=0;E<h.length;E++){const S=h[E];o.setUint32(r,S,!0),r+=4;const f=c.getRow(S);for(let _=0;_<i;_++)o.setFloat64(r,f[_],!0),r+=O}}return n}function it(t,e){const n=new DataView(e.buffer,e.byteOffset,e.byteLength),o=e.byteLength;let r=0;const s=i=>{if(r+i>o)throw new u.SparseRestoreError(`sparse snapshot truncated: need ${i} more bytes at offset ${r}, have ${o-r}`)};s(4);const c=n.getUint32(r,!0);if(r+=4,c!==t.length)throw new u.SparseRestoreError(`sparse store count mismatch: snapshot=${c}, registered=${t.length}`);for(let i=0;i<t.length;i++){const h=t[i];s(I);const E=n.getUint32(r,!0);r+=4;const S=n.getUint32(r,!0);r+=4;const f=n.getUint32(r,!0);if(r+=4,E!==h.fieldNames.length)throw new u.SparseRestoreError(`sparse store ${i} field-count mismatch: snapshot=${E}, registered=${h.fieldNames.length}`);const _=D(h.fieldNames,h.fieldTypes);if(S!==_)throw new u.SparseRestoreError(`sparse store ${i} schema identity mismatch: snapshot hash=${S}, registered=${_} (same field count, different field names or types, likely a registration-order divergence between the snapshot and restore worlds)`);h.clear();for(let l=0;l<f;l++){s(b+E*O);const d=n.getUint32(r,!0);if(r+=4,d>R.MAX_INDEX)throw new u.SparseRestoreError(`sparse store ${i} member ${l} entity index ${d} exceeds MAX_INDEX (${R.MAX_INDEX})`);const p=new Array(E);for(let T=0;T<E;T++)p[T]=n.getFloat64(r,!0),r+=O;h.setRawRow(d,p)}}if(r!==o)throw new u.SparseRestoreError(`sparse snapshot has ${o-r} trailing bytes after the last store (not a canonical encoding)`)}function ct(t,e){const n=new DataView(e.buffer,e.byteOffset,e.byteLength),o=e.byteLength;let r=0;const s=i=>{if(r+i>o)throw new u.SparseRestoreError(`sparse snapshot truncated: need ${i} more bytes at offset ${r}, have ${o-r}`)};s(4);const c=n.getUint32(r,!0);if(r+=4,c!==t.length)throw new u.SparseRestoreError(`sparse store count mismatch: snapshot=${c}, registered=${t.length}`);for(let i=0;i<t.length;i++){const h=t[i];s(I);const E=n.getUint32(r,!0);r+=4;const S=n.getUint32(r,!0);r+=4;const f=n.getUint32(r,!0);if(r+=4,E!==h.fieldNames.length)throw new u.SparseRestoreError(`sparse store ${i} field-count mismatch: snapshot=${E}, registered=${h.fieldNames.length}`);const _=D(h.fieldNames,h.fieldTypes);if(S!==_)throw new u.SparseRestoreError(`sparse store ${i} schema identity mismatch: snapshot hash=${S}, registered=${_} (same field count, different field names or types, likely a registration-order divergence between the snapshot and restore worlds)`);for(let l=0;l<f;l++){s(b+E*O);const d=n.getUint32(r,!0);if(r+=4,d>R.MAX_INDEX)throw new u.SparseRestoreError(`sparse store ${i} member ${l} entity index ${d} exceeds MAX_INDEX (${R.MAX_INDEX})`);r+=E*O}}if(r!==o)throw new u.SparseRestoreError(`sparse snapshot has ${o-r} trailing bytes after the last store (not a canonical encoding)`)}const m=1,A=810766935,y=4;function ht(t){const e=t.freeIndices.length,n=t.archetypeRows.length,o=y*(4+e+1+n*3),r=new Uint8Array(o),s=new DataView(r.buffer);let c=0;const i=h=>{s.setUint32(c,h,!0),c+=y};i(t.tick),i(t.entityHighWater),i(t.entityAliveCount),i(e);for(let h=0;h<e;h++)i(t.freeIndices[h]);i(n);for(let h=0;h<n;h++){const E=t.archetypeRows[h];i(E.archetypeId),i(E.length),i(E.enabledCount)}return r}function Et(t){const e=new DataView(t.buffer,t.byteOffset,t.byteLength),n=t.byteLength;let o=0;const r=l=>{if(o+l>n)throw new u.ECSRestoreError(`host-state truncated: need ${l} more bytes at offset ${o}, have ${n-o}`)},s=()=>{r(y);const l=e.getUint32(o,!0);return o+=y,l},c=s(),i=s(),h=s(),E=s(),S=new Array(E);for(let l=0;l<E;l++)S[l]=s();const f=s(),_=new Array(f);for(let l=0;l<f;l++){const d=s(),p=s(),T=s();_[l]={archetypeId:d,length:p,enabledCount:T}}if(o!==n)throw new u.ECSRestoreError(`host-state has ${n-o} trailing bytes after the last archetype (not a canonical encoding)`);return{tick:c,entityHighWater:i,entityAliveCount:h,freeIndices:S,archetypeRows:_}}function ut(t,e,n){const o=y*5,r=new Uint8Array(o+t.length+e.length+n.length),s=new DataView(r.buffer);return s.setUint32(0,A,!0),s.setUint32(4,m,!0),s.setUint32(8,t.length,!0),s.setUint32(12,e.length,!0),s.setUint32(16,n.length,!0),r.set(t,o),r.set(e,o+t.length),r.set(n,o+t.length+e.length),r}function lt(t){const e=y*5;if(t.byteLength<e)throw new u.ECSRestoreError(`world snapshot too small: ${t.byteLength} bytes (frame header needs ${e})`);const n=new DataView(t.buffer,t.byteOffset,t.byteLength),o=n.getUint32(0,!0);if(o!==A)throw new u.ECSRestoreError(`bad world-snapshot magic: 0x${o.toString(16).padStart(8,"0")} (expected 0x${A.toString(16).padStart(8,"0")}). A bare dense (SAB) snapshot is not a combined world snapshot, pass the bytes from ECS.snapshot(), not columnStoreBytesView().`);const r=n.getUint32(4,!0);if(r!==m)throw new u.ECSRestoreError(`incompatible world-snapshot version: snapshot=${r}, build=${m}`);const s=n.getUint32(8,!0),c=n.getUint32(12,!0),i=n.getUint32(16,!0);if(e+s+c+i!==t.byteLength)throw new u.ECSRestoreError(`world-snapshot frame mismatch: header declares ${e}+${s}+${c}+${i}=${e+s+c+i} bytes, buffer is ${t.byteLength}`);const h=t.byteOffset,E=t.buffer;return{dense:new Uint8Array(E,h+e,s),sparse:new Uint8Array(E,h+e+s,c),host:new Uint8Array(E,h+e+s+c,i)}}function St(t,e,n){if(t.byteLength<a.STORE_HEADER_BYTES)throw new u.ECSRestoreError(`dense section too small: ${t.byteLength} bytes (SAB header needs ${a.STORE_HEADER_BYTES})`);const o=new DataView(t.buffer,t.byteOffset,t.byteLength),r=o.getUint32(a.STORE_HEADER_OFFSETS.magic,!0);if(r!==a.STORE_MAGIC)throw new u.ECSRestoreError(`dense section bad magic: 0x${r.toString(16).padStart(8,"0")} (expected SAB magic 0x${a.STORE_MAGIC.toString(16).padStart(8,"0")})`);const s=o.getUint32(a.STORE_HEADER_OFFSETS.sim_abi_version,!0);if(s!==a.SIM_ABI_VERSION&&s!==a.LEGACY_ABSOLUTE_ABI_VERSION)throw new u.ECSRestoreError(`dense section incompatible sim_abi_version: snapshot=${s}, build=${a.SIM_ABI_VERSION}`);const c=F(o);if(c.layoutDescriptorOff<0||c.layoutDescriptorOff>t.byteLength)throw new u.ECSRestoreError(`dense layoutDescriptorOff ${c.layoutDescriptorOff} is outside the section (${t.byteLength} bytes)`);const i=c.entityIndexOff;if(i<0||i+X>t.byteLength)throw new u.ECSRestoreError(`dense entityIndexOff ${i} is outside the section (${t.byteLength} bytes)`);const h=o.getUint32(i+W.capacity,!0);if(h!==n)throw new u.ECSRestoreError(`entity-index capacity mismatch: live=${n}, snapshot=${h}`);let E;try{E=C(o,c.layoutDescriptorOff,c.archetypeCount,s===a.LEGACY_ABSOLUTE_ABI_VERSION?a.LEGACY_ARCHETYPE_DESCRIPTOR_HEADER_BYTES:a.ARCHETYPE_DESCRIPTOR_HEADER_BYTES)}catch(S){throw S instanceof RangeError?new u.ECSRestoreError(`dense section layout is corrupt or truncated: a descriptor reads past the ${t.byteLength}-byte section (${S.message})`):S}if(e.size!==E.length)throw new u.ECSRestoreError(`archetype-set mismatch: the live world has ${e.size} SAB archetypes, the snapshot has ${E.length}. restore requires an identical archetype set. Prewarm the world so its archetype set is stable.`);for(let S=0;S<E.length;S++){const f=E[S],_=e.get(f.archetypeId);if(_===void 0)throw new u.ECSRestoreError(`archetype-set mismatch: snapshot archetype ${f.archetypeId} is absent from the live world`);if(!ft(_.componentMask,f.componentMask))throw new u.ECSRestoreError(`archetype ${f.archetypeId} component-mask mismatch between the live world and the snapshot (different component registration)`);const l=_.columnsInOrder,d=f.columns;if(l.length!==d.length)throw new u.ECSRestoreError(`archetype ${f.archetypeId} column-count mismatch: live=${l.length}, snapshot=${d.length}`);for(let p=0;p<l.length;p++)if(l[p].componentId!==d[p].componentId||l[p].fieldId!==d[p].fieldId||l[p].typeTag!==d[p].typeTag)throw new u.ECSRestoreError(`archetype ${f.archetypeId} column ${p} layout mismatch: live=(c${l[p].componentId},f${l[p].fieldId},t${l[p].typeTag}), snapshot=(c${d[p].componentId},f${d[p].fieldId},t${d[p].typeTag})`)}}function ft(t,e){if(t.length!==e.length)return!1;for(let n=0;n<t.length;n++)if(t[n]!==e[n])return!1;return!0}class _t{_host;_allocator;constructor(e,n){this._host=e,this._allocator=n}snapshotSparse(){const e=at(this._host.sparseStores()),n=R.snapshotRelations(this._host.relationStores()),o=new Uint8Array(8+e.length+n.length),r=new DataView(o.buffer);return r.setUint32(0,e.length,!0),r.setUint32(4,n.length,!0),o.set(e,8),o.set(n,8+e.length),o}restoreSparse(e){const n=new DataView(e.buffer,e.byteOffset,e.byteLength);if(e.byteLength<8)throw new u.SparseRestoreError(`sparse snapshot truncated: need 8 header bytes, have ${e.byteLength}`);const o=n.getUint32(0,!0),r=n.getUint32(4,!0);if(8+o+r!==e.byteLength)throw new u.SparseRestoreError(`sparse snapshot frame mismatch: header declares 8+${o}+${r}=${8+o+r} bytes, buffer is ${e.byteLength}`);it(this._host.sparseStores(),e.subarray(8,8+o)),this._rebuildRelationIndices(e.subarray(8+o,8+o+r))}_rebuildRelationIndices(e){const n=this._host.generations(),o=s=>R.createEntityId(s,n[s]),r=this._host.relationStores();R.restoreRelations(r,e,o);for(let s=0;s<r.length;s++)r[s].rebuildReverse(o)}snapshot(){this._host.publishRowCounts();const e=new Uint8Array(Z(this._host.columnStore())),n=this.snapshotSparse(),o=ht(this._collectHostState());return ut(e,n,o)}_collectHostState(){const e=[],n=this._host.archetypes();for(let o=0;o<n.length;o++){const r=n[o];r.isBufferBacked&&e.push({archetypeId:r.id,length:r.length,enabledCount:r.enabledCount})}return{tick:this._host.tick(),entityHighWater:this._allocator.highWater,entityAliveCount:this._allocator.aliveCount,freeIndices:this._allocator.snapshotFreeIndices(),archetypeRows:e}}restore(e){const n=lt(e),o=Et(n.host);St(n.dense,this._host.columnStore().archetypes,this._host.entityIndexCapacity()),this._assertSparseMatchesLive(n.sparse);const r=nt(n.dense,this._host.bufferAllocator(),{storeBase:this._host.columnStore().storeBase});this._host.mountRestoredDense(r),this._host.reconstructHostRows(o),this._allocator.restoreHostState(o.freeIndices,o.entityAliveCount),this._host.setTick(o.tick),this._host.invalidateCaches(),this.restoreSparse(n.sparse)}_assertSparseMatchesLive(e){const n=new DataView(e.buffer,e.byteOffset,e.byteLength);if(e.byteLength<8)throw new u.SparseRestoreError(`sparse snapshot truncated: need 8 header bytes, have ${e.byteLength}`);const o=n.getUint32(0,!0),r=n.getUint32(4,!0);if(8+o+r!==e.byteLength)throw new u.SparseRestoreError(`sparse snapshot frame mismatch: header declares 8+${o}+${r}=${8+o+r} bytes, buffer is ${e.byteLength}`);ct(this._host.sparseStores(),e.subarray(8,8+o))}}class L{_store;constructor(e){this._store=e}get deterministic(){return this._store.deterministic}stateHash(){return this._store.stateHash()}}for(const t of["capture","restore","captureSparse","restoreSparse"])L.prototype[t]=function(){throw P.pluginMissingError("snapshots",`ecs.snapshots.${t}`)};class H extends L{capture(){return this._store.snapshot()}restore(e){this._store.restore(e)}captureSparse(){return this._store.snapshotSparse()}restoreSparse(e){this._store.restoreSparse(e)}}function pt(){return{name:"snapshots",install(t){const e=t.store;return e.installSnapshots(new _t(e.snapshotHost(),e.entityAllocator)),{snapshots:new H(e)}}}}exports.ECSSnapshotsFull=H;exports.snapshots=pt;