@oasys/oecs 0.5.1 → 0.5.2

package/dist/internal-LiTSB_tG.cjs

@@ -0,0 +1,2 @@
+"use strict";const P=require("./shared-BymrGTyR.cjs"),We=require("./topological_sort-BDvEyb9W.cjs");class ze extends Error{constructor(e,n,r){super(e),this.isOperational=n,this.context=r,this.name=this.constructor.name,Error.captureStackTrace(this,this.constructor)}}var Se=(t=>(t.ASSERTION_FAIL_CONDITION="ASSERTION_FAIL_CONDITION",t.VALIDATION_FAIL_CONDITION="VALIDATION_FAIL_CONDITION",t.ASSERTION_FAIL_NON_NULLABLE="ASSERTION_FAIL_NON_NULLABLE",t.ASSERTION_FAIL_UNREACHABLE="ASSERTION_FAIL_UNREACHABLE",t))(Se||{});class qe extends ze{constructor(e,n,r){super(n,!1,r),this.category=e}}const Et=t=>Number.isInteger(t)&&t>=0;function mt(t,e,n){if(!e(t))throw new qe(Se.VALIDATION_FAIL_CONDITION,`Expected value to meet validation: ${n}`);return t}function gt(t){return t}function pt(t,e){throw new qe(Se.ASSERTION_FAIL_UNREACHABLE,`Unhandled ${e}: ${String(t)}`)}var p=(t=>(t.EID_MAX_INDEX_OVERFLOW="EID_MAX_INDEX_OVERFLOW",t.EID_MAX_GEN_OVERFLOW="EID_MAX_GEN_OVERFLOW",t.COMPONENT_NOT_REGISTERED="COMPONENT_NOT_REGISTERED",t.COMPONENT_LIMIT_EXCEEDED="COMPONENT_LIMIT_EXCEEDED",t.ENTITY_NOT_ALIVE="ENTITY_NOT_ALIVE",t.CIRCULAR_SYSTEM_DEPENDENCY="CIRCULAR_SYSTEM_DEPENDENCY",t.DUPLICATE_SYSTEM="DUPLICATE_SYSTEM",t.ARCHETYPE_NOT_FOUND="ARCHETYPE_NOT_FOUND",t.RESOURCE_NOT_REGISTERED="RESOURCE_NOT_REGISTERED",t.RESOURCE_ALREADY_REGISTERED="RESOURCE_ALREADY_REGISTERED",t.EVENT_ALREADY_REGISTERED="EVENT_ALREADY_REGISTERED",t.EVENT_NOT_REGISTERED="EVENT_NOT_REGISTERED",t.FIELD_NOT_REGISTERED="FIELD_NOT_REGISTERED",t.RELATION_NOT_REGISTERED="RELATION_NOT_REGISTERED",t.RELATION_MODE_INVALID="RELATION_MODE_INVALID",t.RELATION_MODE_MISMATCH="RELATION_MODE_MISMATCH",t.RELATION_CYCLE="RELATION_CYCLE",t.SPARSE_CACHE_KEY_OVERFLOW="SPARSE_CACHE_KEY_OVERFLOW",t.SPARSE_QUERY_DENSE_PATH="SPARSE_QUERY_DENSE_PATH",t.HIERARCHY_ALREADY_SET="HIERARCHY_ALREADY_SET",t.HIERARCHY_INVALID_MAX_DEPTH="HIERARCHY_INVALID_MAX_DEPTH",t.OBSERVER_NON_CONVERGENT="OBSERVER_NON_CONVERGENT",t.OBSERVER_INVALID_CONFIG="OBSERVER_INVALID_CONFIG",t.OBSERVER_ONSET_EMIT="OBSERVER_ONSET_EMIT",t.INVALID_FIXED_TIMESTEP="INVALID_FIXED_TIMESTEP",t.INVALID_MAX_FIXED_STEPS="INVALID_MAX_FIXED_STEPS",t.INVALID_RECORDER_SCHEDULE="INVALID_RECORDER_SCHEDULE",t.EMPTY_ARCHETYPE_MATERIALIZE="EMPTY_ARCHETYPE_MATERIALIZE",t.COMPONENT_INDEX_INVARIANT="COMPONENT_INDEX_INVARIANT",t.OPTIONAL_TERM_NOT_DECLARED="OPTIONAL_TERM_NOT_DECLARED",t.QUERY_ACCESS_UNDECLARED="QUERY_ACCESS_UNDECLARED",t.ACCESS_UNDECLARED="ACCESS_UNDECLARED",t.QUERY_NOT_SINGLETON="QUERY_NOT_SINGLETON",t.INVALID_RUN_CONDITION="INVALID_RUN_CONDITION",t.SYSTEM_FN_ARITY="SYSTEM_FN_ARITY",t.PARTITION_APPEND_NEEDS_ENTITY_ROW="PARTITION_APPEND_NEEDS_ENTITY_ROW",t.PARTITION_BULK_INTO_DISABLED="PARTITION_BULK_INTO_DISABLED",t.ENTITY_NOT_DISABLED="ENTITY_NOT_DISABLED",t.STRUCTURAL_DURING_ITERATION="STRUCTURAL_DURING_ITERATION",t.BACKEND_ALREADY_ATTACHED="BACKEND_ALREADY_ATTACHED",t.DETERMINISM_DISABLED="DETERMINISM_DISABLED",t.NON_DETERMINISTIC_COLUMN_TYPE="NON_DETERMINISTIC_COLUMN_TYPE",t.INVALID_MEMORY_OPTIONS="INVALID_MEMORY_OPTIONS",t.STORE_CAP_EXCEEDED="STORE_CAP_EXCEEDED",t.REGION_NOT_DECLARED="REGION_NOT_DECLARED",t.COMMAND_LOG_TAG_COLLISION="COMMAND_LOG_TAG_COLLISION",t.INVALID_FRAME_STEP="INVALID_FRAME_STEP",t))(p||{});class T extends ze{constructor(e,n,r){super(n??e,!0,r),this.category=e}}function Tt(t){return t instanceof T}const At=-1,yt=-1,It=Object.freeze(Object.create(null)),St=2654435769,wt=1367130551,F=1024,Nt=0,Rt=31,Dt=1/60,Ot=4,Ct=0,W=20,we=(1<<W)-1,L=we,bt=Rt-W,J=(1<<bt)-1,Ut=J,vt=J-1,ge=J<<W|L,Lt=(t,e)=>{{if(t<0||t>L)throw new T(p.EID_MAX_INDEX_OVERFLOW);if(e<0||e>J)throw new T(p.EID_MAX_GEN_OVERFLOW)}return e<<W|t},v=t=>t&we,pe=t=>t>>W,Mt=(t,e,n)=>new T(p.ENTITY_NOT_ALIVE,`${t}: entity ${e} (index ${v(e)}, generation ${pe(e)}) is not alive${n?` — ${n}`:""} (destroyed, never created, or a stale handle; guard with isAlive() first)`,{entity:e,index:v(e),generation:pe(e),op:t}),Ne=new WeakMap;function Pt(t,e){Ne.set(t,e)}function $t(t){return Ne.get(t)}function Ke(t){const e=Ne.get(t);return e!==void 0?`'${e}' (component ${t.id})`:`component ${t.id}`}const je=827148627,Qe=0,Q=4,Ze=52,E={magic:0,sim_abi_version:4,view_stamp:8,capacity:12,archetype_count:16,layout_descriptor_off:20,command_ring_off:24,action_ring_off:28,entity_index_off:32,event_ring_off:36,region_table_off:40,region_table_count:44,bindings_off:48},ee=12,$={region_id:0,byte_offset:4,byte_length:8},ce=16,O={component_id:0,field_id:2,type_tag:4,byte_off:8,stride:12},de=36,N={archetype_id:0,component_mask:4,row_count:20,row_capacity:24,column_count:28,enabled_count:32};function Bt(t,e){t.setUint32(E.magic,e.magic,!0),t.setUint32(E.sim_abi_version,e.simAbiVersion,!0),t.setUint32(E.view_stamp,e.viewStamp,!0),t.setUint32(E.capacity,e.capacity,!0),t.setUint32(E.archetype_count,e.archetypeCount,!0),t.setUint32(E.layout_descriptor_off,e.layoutDescriptorOff,!0),t.setUint32(E.command_ring_off,e.commandRingOff,!0),t.setUint32(E.action_ring_off,e.actionRingOff,!0),t.setUint32(E.entity_index_off,e.entityIndexOff,!0),t.setUint32(E.event_ring_off,e.eventRingOff,!0),t.setUint32(E.region_table_off,e.regionTableOff,!0),t.setUint32(E.region_table_count,e.regionTableCount,!0),t.setUint32(E.bindings_off,e.bindingsOff,!0)}function Ft(t){return{magic:t.getUint32(E.magic,!0),simAbiVersion:t.getUint32(E.sim_abi_version,!0),viewStamp:t.getUint32(E.view_stamp,!0),capacity:t.getUint32(E.capacity,!0),archetypeCount:t.getUint32(E.archetype_count,!0),layoutDescriptorOff:t.getUint32(E.layout_descriptor_off,!0),commandRingOff:t.getUint32(E.command_ring_off,!0),actionRingOff:t.getUint32(E.action_ring_off,!0),entityIndexOff:t.getUint32(E.entity_index_off,!0),eventRingOff:t.getUint32(E.event_ring_off,!0),regionTableOff:t.getUint32(E.region_table_off,!0),regionTableCount:t.getUint32(E.region_table_count,!0),bindingsOff:t.getUint32(E.bindings_off,!0)}}const g={u8:0,i8:1,u16:2,i16:3,u32:4,i32:5,f32:6,f64:7},Te=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}),xt={u8:g.u8,i8:g.i8,u16:g.u16,i16:g.i16,u32:g.u32,i32:g.i32,f32:g.f32,f64:g.f64};function Yt(t,e,n){t.setUint16(e+O.component_id,n.componentId,!0),t.setUint16(e+O.field_id,n.fieldId,!0),t.setUint8(e+O.type_tag,n.typeTag),t.setUint32(e+O.byte_off,n.byteOff,!0),t.setUint16(e+O.stride,n.stride,!0)}function kt(t,e){return{componentId:t.getUint16(e+O.component_id,!0),fieldId:t.getUint16(e+O.field_id,!0),typeTag:t.getUint8(e+O.type_tag),byteOff:t.getUint32(e+O.byte_off,!0),stride:t.getUint16(e+O.stride,!0)}}const Gt=Q*32;function Re(t){return de+t*ce}function Je(t,e,n){t.setUint32(e+N.archetype_id,n.archetypeId,!0);for(let s=0;s<Q;s++)t.setUint32(e+N.component_mask+s*4,n.componentMask[s]??0,!0);t.setUint32(e+N.row_count,n.rowCount,!0),t.setUint32(e+N.row_capacity,n.rowCapacity,!0),t.setUint32(e+N.column_count,n.columns.length,!0),t.setUint32(e+N.enabled_count,n.enabledCount,!0);let r=e+de;for(let s=0;s<n.columns.length;s++)Yt(t,r,n.columns[s]),r+=ce;return r}function Ht(t,e){const n=t.getUint32(e+N.column_count,!0),r=new Array(n);let s=e+de;for(let i=0;i<n;i++)r[i]=kt(t,s),s+=ce;const o=new Array(Q);for(let i=0;i<Q;i++)o[i]=t.getUint32(e+N.component_mask+i*4,!0);return{archetypeId:t.getUint32(e+N.archetype_id,!0),componentMask:o,rowCount:t.getUint32(e+N.row_count,!0),rowCapacity:t.getUint32(e+N.row_capacity,!0),enabledCount:t.getUint32(e+N.enabled_count,!0),columns:r}}function Vt(t,e,n){let r=e;for(let s=0;s<n.length;s++)r=Je(t,r,n[s]);return r}function Xt(t,e,n){const r=new Array(n);let s=e;for(let o=0;o<n;o++){const i=Ht(t,s);r[o]=i,s+=Re(i.columns.length)}return r}function Wt(t){let e=0;for(let n=0;n<t.length;n++)e+=Re(t[n].columns.length);return e}const et=16,x=16,zt=256,C={write_head:0,read_head:4,capacity_slots:8,overflow_flag:12},De=0;function $e(t){return et+t*x}function qt(t){return t>0&&(t&t-1)===0}class M extends Error{constructor(e){super(e),this.name="CommandRingError"}}function Kt(t,e,n){if(!qt(n))throw new M(`command ring capacity_slots must be a positive power of two (got ${n})`);t.setUint32(e+C.write_head,0,!0),t.setUint32(e+C.read_head,0,!0),t.setUint32(e+C.capacity_slots,n,!0),t.setUint32(e+C.overflow_flag,0,!0)}function jt(t,e){return t.getUint32(e+C.write_head,!0)}function Qt(t,e){return t.getUint32(e+C.read_head,!0)}function Zt(t,e){return t.getUint32(e+C.capacity_slots,!0)}function Jt(t,e,n){if(n.byteLength!==x-1)throw new M(`out_payload must be ${x-1} bytes (got ${n.byteLength})`);const r=jt(t,e),s=Qt(t,e);if(r===s)return De;const o=Zt(t,e),i=s&o-1,a=e+et+i*x,c=t.getUint8(a),l=new Uint8Array(t.buffer,a+1,x-1);return n.set(l),t.setUint32(e+C.read_head,s+1>>>0,!0),c}function en(t,e,n){let r=0;const s=new Uint8Array(x-1);for(;;){const o=Jt(t,e,s);if(o===De)return r;n(o,s.slice()),r++}}const te=16,R=12,Z={length:0,capacity:4},U=1<<20;function Be(t){if(t<0||!Number.isInteger(t))throw new tt(`entity_index capacity must be a non-negative integer (got ${t})`);return te+t*R}function tn(t){return t+te}function nn(t,e){return t+te+e*4}function sn(t,e){return t+te+e*8}class tt extends Error{constructor(e){super(e),this.name="EntityIndexError"}}function rn(t,e,n){if(n<0||!Number.isInteger(n))throw new tt(`entity_index capacity must be a non-negative integer (got ${n})`);t.setUint32(e+Z.length,0,!0),t.setUint32(e+Z.capacity,n,!0)}function on(t,e,n){return{generations:new Int32Array(t,tn(e),n),archetypes:new Int32Array(t,nn(e,n),n),rows:new Int32Array(t,sn(e,n),n)}}const an=16,cn=16,dn=256,H={write_head:0,read_head:4,capacity_slots:8,overflow_flag:12};function Fe(t){return an+t*cn}function ln(t){return t>0&&(t&t-1)===0}class un extends Error{constructor(e){super(e),this.name="EventRingError"}}function _n(t,e,n){if(!ln(n))throw new un(`event ring capacity_slots must be a positive power of two (got ${n})`);t.setUint32(e+H.write_head,0,!0),t.setUint32(e+H.read_head,0,!0),t.setUint32(e+H.capacity_slots,n,!0),t.setUint32(e+H.overflow_flag,0,!0)}const fn=16,hn=16,En=256,V={write_head:0,read_head:4,capacity_slots:8,overflow_flag:12},mn=V.write_head/4,gn=V.read_head/4,pn=V.capacity_slots/4,Tn=V.overflow_flag/4;function An(t,e){return new Int32Array(t.buffer,t.byteOffset+e,4)}function xe(t){return fn+t*hn}function yn(t){return t>0&&(t&t-1)===0}class Ye extends Error{constructor(e){super(e),this.name="ActionRingError"}}function In(t,e,n){if(!yn(n))throw new Ye(`action ring capacity_slots must be a positive power of two (got ${n})`);if((t.byteOffset+e)%4!==0)throw new Ye(`action ring header must be 4-byte aligned for Atomics (view.byteOffset ${t.byteOffset} + ring_off ${e} is not a multiple of 4)`);const r=An(t,e);Atomics.store(r,mn,0),Atomics.store(r,gn,0),Atomics.store(r,pn,n),Atomics.store(r,Tn,0)}const q=[{name:"command_ring",headerOff:"command_ring_off",sizeFromOptions:t=>t.commandRingCapacitySlots!==void 0?$e(t.commandRingCapacitySlots):0,init:(t,e,n)=>Kt(t,e,n.commandRingCapacitySlots),regionBytes:(t,e)=>$e(t.getUint32(e+C.capacity_slots,!0)),readOptions:(t,e,n)=>{n.commandRingCapacitySlots=t.getUint32(e+C.capacity_slots,!0)}},{name:"entity_index",headerOff:"entity_index_off",sizeFromOptions:t=>t.entityIndexCapacity!==void 0?Be(t.entityIndexCapacity):0,init:(t,e,n)=>rn(t,e,n.entityIndexCapacity),regionBytes:(t,e)=>Be(t.getUint32(e+Z.capacity,!0)),readOptions:(t,e,n)=>{n.entityIndexCapacity=t.getUint32(e+Z.capacity,!0)}},{name:"event_ring",headerOff:"event_ring_off",sizeFromOptions:t=>t.eventRingCapacitySlots!==void 0?Fe(t.eventRingCapacitySlots):0,init:(t,e,n)=>_n(t,e,n.eventRingCapacitySlots),regionBytes:(t,e)=>Fe(t.getUint32(e+H.capacity_slots,!0)),readOptions:(t,e,n)=>{n.eventRingCapacitySlots=t.getUint32(e+H.capacity_slots,!0)}},{name:"action_ring",headerOff:"action_ring_off",sizeFromOptions:t=>t.actionRingCapacitySlots!==void 0?xe(t.actionRingCapacitySlots):0,init:(t,e,n)=>In(t,e,n.actionRingCapacitySlots),regionBytes:(t,e)=>xe(t.getUint32(e+V.capacity_slots,!0)),readOptions:(t,e,n)=>{n.actionRingCapacitySlots=t.getUint32(e+V.capacity_slots,!0)}}];class se extends Error{constructor(e){super(e),this.name="RegionRegistryError"}}function nt(t){return t*ee}function Oe(t,e){const n=t.getUint32(E.region_table_count,!0);if(e+nt(n)>t.byteLength)throw new se(`region table of ${n} entries at byte ${e} overruns the buffer (${t.byteLength} bytes)`);return n}function Sn(t){const e=new Set;for(let n=0;n<t.length;n++){const r=t[n];if(!Number.isInteger(r.id)||r.id<=0)throw new se(`region "${r.name}" has invalid id ${r.id} — region ids must be positive integers (0 is the absent sentinel)`);if(e.has(r.id))throw new se(`duplicate region id ${r.id} (region "${r.name}") — ids must be distinct within a consumer's region set`);if(e.add(r.id),!Number.isInteger(r.bytes)||r.bytes<=0)throw new se(`region "${r.name}" (id ${r.id}) has invalid byte size ${r.bytes} — must be a positive integer`)}}function wn(t,e,n){t.setUint32(e+$.region_id,n.regionId,!0),t.setUint32(e+$.byte_offset,n.byteOffset,!0),t.setUint32(e+$.byte_length,n.byteLength,!0)}function st(t,e){return{regionId:t.getUint32(e+$.region_id,!0),byteOffset:t.getUint32(e+$.byte_offset,!0),byteLength:t.getUint32(e+$.byte_length,!0)}}function Nn(t,e,n){for(let r=0;r<n.length;r++)wn(t,e+r*ee,n[r])}function Rn(t,e,n){const r=new Array(n);for(let s=0;s<n;s++)r[s]=st(t,e+s*ee);return r}function Dn(t){const e=t.getUint32(E.region_table_off,!0);if(e===0)return[];const n=Oe(t,e);return Rn(t,e,n)}function On(t,e){const n=t.getUint32(E.region_table_off,!0);if(n===0)return 0;const r=Oe(t,n);for(let s=0;s<r;s++){const o=n+s*ee;if(t.getUint32(o+$.region_id,!0)===e)return t.getUint32(o+$.byte_offset,!0)}return 0}function Cn(t,e){const n=t.getUint32(E.region_table_off,!0);if(n===0)return null;const r=Oe(t,n);for(let s=0;s<r;s++){const o=st(t,n+s*ee);if(o.regionId===e)return o}return null}function rt(t,e){return t<<16|e}const le=2**31;class Ce extends Error{constructor(e){super(`SAB column layout offset ${e} reaches or exceeds the 2³¹ (${le}-byte) ceiling. Past 2 GiB the signed-32-bit bitwise alignment math wraps to negative/misaligned offsets. This is a structural limit independent of the (default 256 MiB) allocator cap — a single SAB cannot back more than ~2 GiB of column data (#382).`),this.name="StoreLayoutOverflowError"}}function be(t,e){if(t+e>le)throw new Ce(t);return t+(e-1)&~(e-1)}function bn(t,e,n,r){switch(e){case g.u8:return new Uint8Array(t,n,r);case g.i8:return new Int8Array(t,n,r);case g.u16:return new Uint16Array(t,n,r);case g.i16:return new Int16Array(t,n,r);case g.u32:return new Uint32Array(t,n,r);case g.i32:return new Int32Array(t,n,r);case g.f32:return new Float32Array(t,n,r);case g.f64:return new Float64Array(t,n,r)}}function Un(t,e,n=0){const s=Wt(t.map(a=>({archetypeId:a.archetypeId,componentMask:a.componentMask,rowCount:0,enabledCount:0,rowCapacity:a.rowCapacity,columns:a.columns.map(c=>({componentId:c.componentId,fieldId:c.fieldId,typeTag:c.typeTag,byteOff:0,stride:Te[c.typeTag]}))})))+n;let o=e+s;const i=new Array(t.length);for(let a=0;a<t.length;a++){const c=t[a],l=new Array(c.columns.length);for(let d=0;d<c.columns.length;d++){const _=c.columns[d],f=Te[_.typeTag];o=be(o,f),l[d]={componentId:_.componentId,fieldId:_.fieldId,typeTag:_.typeTag,byteOff:o,stride:f},o+=f*c.rowCapacity}i[a]={archetypeId:c.archetypeId,componentMask:c.componentMask,rowCount:0,enabledCount:0,rowCapacity:c.rowCapacity,columns:l}}if(o>le)throw new Ce(o);return{descriptors:i,totalBytes:o,regionBytes:s}}function vn(t){const e=t;return typeof e._regionBytes=="number"&&typeof e._allocator=="function"&&typeof e._reservedDescriptorBytes=="number"}function Ln(t,e=P.DEFAULT_SAB_ALLOCATOR,n={}){const r={};let s=Ze;for(let S=0;S<q.length;S++){const b=q[S],z=b.sizeFromOptions(n);r[b.headerOff]=z===0?0:s,s+=z}const o=n.regions??[];Sn(o);const i=o.length,a=i>0?s:0;s+=nt(i);const c=new Array(i);for(let S=0;S<o.length;S++){const b=o[S];c[S]={regionId:b.id,byteOffset:s,byteLength:b.bytes},s+=b.bytes}const l=n.bindingsRegionBytes??0,d=l===0?0:s;s+=l;const _=s,{descriptors:f,totalBytes:m,regionBytes:y}=Un(t,_,n.reservedDescriptorBytes??0),u=e(m),h=new DataView(u),I={magic:je,simAbiVersion:Qe,viewStamp:0,capacity:m,archetypeCount:t.length,layoutDescriptorOff:_,bindingsOff:d,regionTableOff:a,regionTableCount:i,commandRingOff:r.command_ring_off,entityIndexOff:r.entity_index_off,eventRingOff:r.event_ring_off,actionRingOff:r.action_ring_off};Bt(h,I),l>0&&new Uint8Array(u,d,l).fill(0);for(let S=0;S<q.length;S++){const b=q[S],z=r[b.headerOff];z!==0&&b.init(h,z,n)}a!==0&&Nn(h,a,c);for(let S=0;S<o.length;S++)o[S].init(h,c[S].byteOffset);Vt(h,_,f);const Y=ot(u,f);return{buffer:u,view:h,header:I,archetypes:Y,_regionBytes:y,_allocator:e,_reservedDescriptorBytes:n.reservedDescriptorBytes??0}}function ot(t,e){const n=new Map;for(let r=0;r<e.length;r++){const s=e[r],o=new Array(s.columns.length),i=new Map;for(let a=0;a<s.columns.length;a++){const c=s.columns[a],l={componentId:c.componentId,fieldId:c.fieldId,typeTag:c.typeTag,byteOff:c.byteOff,stride:c.stride,view:bn(t,c.typeTag,c.byteOff,s.rowCapacity)};o[a]=l,i.set(rt(c.componentId,c.fieldId),l)}n.set(s.archetypeId,{archetypeId:s.archetypeId,componentMask:s.componentMask,rowCapacity:s.rowCapacity,columns:i,columnsInOrder:o})}return n}const it=2166136261,Ue=16777619;function fe(t,e){return t=(t^e&255)>>>0,Math.imul(t,Ue)>>>0}function Mn(t,e){return t=(t^e>>>0)>>>0,Math.imul(t,Ue)>>>0}class Pn{_data=new We.SparseMap;fieldNames;fieldTypes;fieldIndex;constructor(e,n){this.fieldNames=e,this.fieldTypes=n;const r=Object.create(null);for(let s=0;s<e.length;s++)r[e[s]]=s;this.fieldIndex=r}get size(){return this._data.size}get indices(){return this._data.keys}canonicalIndices(){return this._data.keys.slice().sort((e,n)=>e-n)}getRow(e){return this._data.get(e)}clear(){this._data.clear()}setRawRow(e,n){this._data.set(e,n)}has(e){return this._data.has(e)}setRow(e,n){const r=this.fieldNames,s=new Array(r.length);for(let o=0;o<r.length;o++){const i=n[r[o]];s[o]=i===void 0?0:i}this._data.set(e,s)}remove(e){return this._data.delete(e)}getField(e,n){const r=this._data.get(e);return r===void 0?void 0:r[n]}setField(e,n,r){const s=this._data.get(e);return s===void 0?!1:(s[n]=r,!0)}}class A extends Error{constructor(e){super(e),this.name="SparseRestoreError"}}const ve=12,Le=4,X=8;function Me(t,e){let n=it;const r=s=>{for(let o=0;o<s.length;o++)n=fe(n,s.charCodeAt(o))};for(let s=0;s<t.length;s++)r(t[s]),n=fe(n,31),r(e[s]),n=fe(n,30);return n>>>0}function $n(t){let e=4;for(let o=0;o<t.length;o++){const i=t[o],a=i.fieldNames.length;e+=ve+i.size*(Le+a*X)}const n=new Uint8Array(e),r=new DataView(n.buffer);let s=0;r.setUint32(s,t.length,!0),s+=4;for(let o=0;o<t.length;o++){const i=t[o],a=i.fieldNames.length,c=i.canonicalIndices();r.setUint32(s,a,!0),s+=4,r.setUint32(s,Me(i.fieldNames,i.fieldTypes),!0),s+=4,r.setUint32(s,c.length,!0),s+=4;for(let l=0;l<c.length;l++){const d=c[l];r.setUint32(s,d,!0),s+=4;const _=i.getRow(d);for(let f=0;f<a;f++)r.setFloat64(s,_[f],!0),s+=X}}return n}function Bn(t,e){const n=new DataView(e.buffer,e.byteOffset,e.byteLength),r=e.byteLength;let s=0;const o=a=>{if(s+a>r)throw new A(`sparse snapshot truncated: need ${a} more bytes at offset ${s}, have ${r-s}`)};o(4);const i=n.getUint32(s,!0);if(s+=4,i!==t.length)throw new A(`sparse store count mismatch: snapshot=${i}, registered=${t.length}`);for(let a=0;a<t.length;a++){const c=t[a];o(ve);const l=n.getUint32(s,!0);s+=4;const d=n.getUint32(s,!0);s+=4;const _=n.getUint32(s,!0);if(s+=4,l!==c.fieldNames.length)throw new A(`sparse store ${a} field-count mismatch: snapshot=${l}, registered=${c.fieldNames.length}`);const f=Me(c.fieldNames,c.fieldTypes);if(d!==f)throw new A(`sparse store ${a} schema identity mismatch: snapshot hash=${d}, registered=${f} (same field count, different field names/types — likely a registration-order divergence between the snapshot and restore worlds)`);c.clear();for(let m=0;m<_;m++){o(Le+l*X);const y=n.getUint32(s,!0);if(s+=4,y>L)throw new A(`sparse store ${a} member ${m} entity index ${y} exceeds MAX_INDEX (${L})`);const u=new Array(l);for(let h=0;h<l;h++)u[h]=n.getFloat64(s,!0),s+=X;c.setRawRow(y,u)}}if(s!==r)throw new A(`sparse snapshot has ${r-s} trailing bytes after the last store (not a canonical encoding)`)}function Fn(t,e){const n=new DataView(e.buffer,e.byteOffset,e.byteLength),r=e.byteLength;let s=0;const o=a=>{if(s+a>r)throw new A(`sparse snapshot truncated: need ${a} more bytes at offset ${s}, have ${r-s}`)};o(4);const i=n.getUint32(s,!0);if(s+=4,i!==t.length)throw new A(`sparse store count mismatch: snapshot=${i}, registered=${t.length}`);for(let a=0;a<t.length;a++){const c=t[a];o(ve);const l=n.getUint32(s,!0);s+=4;const d=n.getUint32(s,!0);s+=4;const _=n.getUint32(s,!0);if(s+=4,l!==c.fieldNames.length)throw new A(`sparse store ${a} field-count mismatch: snapshot=${l}, registered=${c.fieldNames.length}`);const f=Me(c.fieldNames,c.fieldTypes);if(d!==f)throw new A(`sparse store ${a} schema identity mismatch: snapshot hash=${d}, registered=${f} (same field count, different field names/types — likely a registration-order divergence between the snapshot and restore worlds)`);for(let m=0;m<_;m++){o(Le+l*X);const y=n.getUint32(s,!0);if(s+=4,y>L)throw new A(`sparse store ${a} member ${m} entity index ${y} exceeds MAX_INDEX (${L})`);s+=l*X}}if(s!==r)throw new A(`sparse snapshot has ${r-s} trailing bytes after the last store (not a canonical encoding)`)}const Ae=2147483647,xn="orphan",at="target",Yn=Object.freeze({});class ct{exclusive;sparse;onDeleteTarget;_store;_reverse=new Map;constructor(e,n,r,s){this.exclusive=e,this.sparse=n,this._store=r,this.onDeleteTarget=s}linkReverse(e,n){let r=this._reverse.get(e);r===void 0&&(r=new Set,this._reverse.set(e,r)),r.add(n)}unlinkReverse(e,n){const r=this._reverse.get(e);r!==void 0&&(r.delete(n),r.size===0&&this._reverse.delete(e))}pruneDeadReverse(e){let n=0;for(const r of this._reverse.keys())e(r)||(this._reverse.delete(r),n++);return n}sourcesOf(e){const n=this._reverse.get(e);if(n===void 0||n.size===0)return[];const r=new Array(n.size);let s=0;return n.forEach(o=>{r[s++]=o}),r.sort((o,i)=>o-i),r}resetIndices(){this._reverse.clear(),this._resetForward()}}class kn extends ct{constructor(e,n,r){super(!0,e,n,r)}_resetForward(){}link(e,n){const r=v(e),s=this._store.getField(r,0);if(s!==void 0){if(s===n)return;this.unlinkReverse(s,e)}this._store.setRow(r,{[at]:n}),this.linkReverse(n,e)}unlink(e,n){const r=v(e),s=this._store.getField(r,0);s!==void 0&&(n!==void 0&&s!==n||(this.unlinkReverse(s,e),this._store.remove(r)))}purgeSource(e){const n=v(e),r=this._store.getField(n,0);r!==void 0&&this.unlinkReverse(r,e)}singleTarget(e){const n=this._store.getField(e,0);return n===void 0?void 0:n}targetsOf(e){const n=this._store.getField(e,0);return n===void 0?[]:[n]}has(e){return this._store.has(e)}forEachCanonicalTargetSet(e){}forEachCanonicalPair(e,n){const r=this._store.canonicalIndices();for(let s=0;s<r.length;s++){const o=r[s];n(e(o),this._store.getField(o,0))}}rebuildReverseFromForward(e){const n=this._store.indices;for(let r=0;r<n.length;r++){const s=n[r];this.linkReverse(this._store.getField(s,0),e(s))}}restoreAddTarget(){throw new A("exclusive relation has no multi forward sources to restore (snapshot header should have guarded this)")}}class Gn extends ct{_forward=new Map;constructor(e,n,r){super(!1,e,n,r)}_resetForward(){this._forward.clear()}link(e,n){const r=v(e);let s=this._forward.get(r);s===void 0&&(s=new Set,this._forward.set(r,s),this._store.setRow(r,Yn)),s.add(n),this.linkReverse(n,e)}unlink(e,n){const r=v(e),s=this._forward.get(r);if(s!==void 0){if(n===void 0){this._forward.delete(r),s.forEach(o=>this.unlinkReverse(o,e)),this._store.remove(r);return}s.has(n)&&(s.delete(n),this.unlinkReverse(n,e),s.size===0&&(this._forward.delete(r),this._store.remove(r)))}}purgeSource(e){const n=v(e),r=this._forward.get(n);r!==void 0&&(this._forward.delete(n),r.forEach(s=>this.unlinkReverse(s,e)))}singleTarget(){}targetsOf(e){const n=this._forward.get(e);if(n===void 0||n.size===0)return[];const r=new Array(n.size);let s=0;return n.forEach(o=>{r[s++]=o}),r.sort((o,i)=>o-i),r}has(e){return this._store.has(e)}forEachCanonicalTargetSet(e){const n=Array.from(this._forward.keys()).sort((r,s)=>r-s);for(let r=0;r<n.length;r++){const s=this.targetsOf(n[r]);s.length!==0&&e(n[r],s)}}forEachCanonicalPair(e,n){this.forEachCanonicalTargetSet((r,s)=>{const o=e(r);for(let i=0;i<s.length;i++)n(o,s[i])})}rebuildReverseFromForward(){}restoreAddTarget(e,n,r){let s=this._forward.get(e);s===void 0&&(s=new Set,this._forward.set(e,s)),s.add(n),this.linkReverse(n,r)}}function Hn(t,e,n,r){return t?new kn(e,n,r):new Gn(e,n,r)}const dt=4,lt=4,ut=8,re=8;function Vn(t){const e=new Array(t.length);let n=4;for(let i=0;i<t.length;i++){n+=dt;const a=t[i];if(a.exclusive){e[i]=null;continue}const c=[];a.forEachCanonicalTargetSet((l,d)=>c.push([l,d])),e[i]=c,n+=lt;for(let l=0;l<c.length;l++)n+=ut+c[l][1].length*re}const r=new Uint8Array(n),s=new DataView(r.buffer);let o=0;s.setUint32(o,t.length,!0),o+=4;for(let i=0;i<t.length;i++){s.setUint32(o,t[i].exclusive?0:1,!0),o+=4;const a=e[i];if(a!==null){s.setUint32(o,a.length,!0),o+=4;for(let c=0;c<a.length;c++){const l=a[c][0],d=a[c][1];s.setUint32(o,l,!0),o+=4,s.setUint32(o,d.length,!0),o+=4;for(let _=0;_<d.length;_++)s.setFloat64(o,d[_],!0),o+=re}}}return r}function Xn(t,e,n){const r=new DataView(e.buffer,e.byteOffset,e.byteLength),s=e.byteLength;let o=0;const i=c=>{if(o+c>s)throw new A(`relation snapshot truncated: need ${c} more bytes at offset ${o}, have ${s-o}`)};for(let c=0;c<t.length;c++)t[c].resetIndices();i(4);const a=r.getUint32(o,!0);if(o+=4,a!==t.length)throw new A(`relation count mismatch: snapshot=${a}, registered=${t.length}`);for(let c=0;c<t.length;c++){const l=t[c];i(dt);const d=r.getUint32(o,!0);if(o+=4,d===1===l.exclusive)throw new A(`relation ${c} cardinality mismatch: snapshot ${d?"multi":"exclusive"}, registered ${l.exclusive?"exclusive":"multi"}`);if(l.exclusive)continue;i(lt);const _=r.getUint32(o,!0);o+=4;for(let f=0;f<_;f++){i(ut);const m=r.getUint32(o,!0);o+=4;const y=r.getUint32(o,!0);if(o+=4,m>L)throw new A(`relation ${c} source index ${m} exceeds MAX_INDEX (${L})`);i(y*re);const u=n(m);for(let h=0;h<y;h++){const I=r.getFloat64(o,!0);o+=re;const Y=I;if(!Number.isInteger(Y)||Y<0||Y>ge)throw new A(`relation ${c} target ${Y} is not a well-formed packed EntityID (expected an integer in [0, ${ge}])`);l.restoreAddTarget(m,I,u)}}}if(o!==s)throw new A(`relation snapshot has ${s-o} trailing bytes after the last relation (not a canonical encoding)`)}const ke=new WeakMap;function Wn(t){const e=new Set,n=new Set,r=new Set,s=new Set,o=new Set,i=new Set,a=new Set,c=new Set,l=new Set,d=new Set;for(let u=0;u<t.writes.length;u++){const h=t.writes[u].id;n.add(h),e.add(h),r.add(h)}for(let u=0;u<t.reads.length;u++)e.add(t.reads[u].id);for(let u=0;u<t.spawns.length;u++){const h=t.spawns[u];for(let I=0;I<h.length;I++)r.add(h[I].id)}for(let u=0;u<t.transitions.length;u++){const h=t.transitions[u];if(h.add)for(let I=0;I<h.add.length;I++)r.add(h.add[I].id);if(h.remove)for(let I=0;I<h.remove.length;I++)s.add(h.remove[I].id)}for(let u=0;u<t.despawns.length;u++)s.add(t.despawns[u].id);for(let u=0;u<t.resourceReads.length;u++)o.add(t.resourceReads[u]);for(let u=0;u<t.resourceWrites.length;u++){const h=t.resourceWrites[u];i.add(h),o.add(h)}const _=t.sparseWrites;if(_!==void 0)for(let u=0;u<_.length;u++){const h=_[u];c.add(h),a.add(h)}const f=t.sparseReads;if(f!==void 0)for(let u=0;u<f.length;u++)a.add(f[u]);const m=t.relationWrites;if(m!==void 0)for(let u=0;u<m.length;u++){const h=m[u];d.add(h),l.add(h)}const y=t.relationReads;if(y!==void 0)for(let u=0;u<y.length;u++)l.add(y[u]);return{reads:e,writes:n,addAllowed:r,removeAllowed:s,hasDespawns:t.despawns.length>0,resourceReads:o,resourceWrites:i,sparseReads:a,sparseWrites:c,relationReads:l,relationWrites:d}}function zn(t){const e=ke.get(t);if(e!==void 0)return e;const n=Wn(t);return ke.set(t,n),n}const Ge=new WeakMap;function qn(t){const e=new Set,n=new Set;if(t.reads!==void 0)for(let r=0;r<t.reads.length;r++)e.add(t.reads[r].id);if(t.resourceReads!==void 0)for(let r=0;r<t.resourceReads.length;r++)n.add(t.resourceReads[r]);return{reads:e,writes:new Set,addAllowed:new Set,removeAllowed:new Set,hasDespawns:!1,resourceReads:n,resourceWrites:new Set,sparseReads:new Set,sparseWrites:new Set,relationReads:new Set,relationWrites:new Set}}function Kn(t){const e=Ge.get(t);if(e!==void 0)return e;const n=qn(t);return Ge.set(t,n),n}class jn{active=null;sets=null;activeName=null;exclusive=!1;enter(e){this.active=e,this.activeName=e.name??`system_${e.id}`,this.exclusive=e.exclusive===!0,this.sets=this.exclusive?null:zn(e)}enterCondition(e){this.active=null,this.activeName=e.name,this.sets=Kn(e)}leave(){this.active=null,this.activeName=null,this.sets=null,this.exclusive=!1}isActive(){return this.sets!==null||this.exclusive}current(){return this.active}checkRead(e){this.sets!==null&&(this.sets.reads.has(e.id)||this.failComponent("read",e,"reads"))}checkWrite(e){this.sets!==null&&(this.sets.writes.has(e.id)||this.failComponent("write",e,"writes"))}checkAdd(e){this.sets!==null&&(this.sets.addAllowed.has(e.id)||this.failComponent("addComponent",e,"spawns / transitions.add / writes"))}checkRemove(e){this.sets!==null&&(this.sets.removeAllowed.has(e.id)||this.failComponent("removeComponent",e,"despawns / transitions.remove"))}checkDestroy(){if(this.sets===null||this.sets.hasDespawns)return;const e=this.activeName;throw new T(p.ACCESS_UNDECLARED,`system '${e}' called despawn but didn't declare any despawns — declare the components this system removes via despawn in its 'despawns'`,{system:e,op:"despawn"})}checkResourceRead(e){if(this.sets===null)return;const n=e;this.sets.resourceReads.has(n)||this.failResource("read",e,"resourceReads")}checkResourceWrite(e){if(this.sets===null)return;const n=e;this.sets.resourceWrites.has(n)||this.failResource("write",e,"resourceWrites")}checkSparseRead(e){if(this.sets===null)return;const n=e;this.sets.sparseReads.has(n)||this.failSparse("read",n,"sparseReads")}checkSparseWrite(e){if(this.sets===null)return;const n=e;this.sets.sparseWrites.has(n)||this.failSparse("write",n,"sparseWrites")}checkRelationRead(e){if(this.sets===null)return;const n=e;this.sets.relationReads.has(n)||this.failRelation("read",n,"relationReads")}checkRelationWrite(e){if(this.sets===null)return;const n=e;this.sets.relationWrites.has(n)||this.failRelation("write",n,"relationWrites")}checkRelationReadAny(){this.sets!==null&&(this.sets.relationReads.has(Ae)||this.failRelation("(*, T) wildcard read",Ae,"relationReads (as ANY_RELATION)"))}optionalScopes=[];enterOptionalScope(e){this.optionalScopes.push(e)}leaveOptionalScope(){this.optionalScopes.pop()}checkOptionalFetch(e){const n=this.optionalScopes.length;if(n===0)return;const r=this.optionalScopes[n-1],s=e.id;for(let o=0;o<r.length;o++)if(r[o]===s)return;throw new T(p.OPTIONAL_TERM_NOT_DECLARED,`getOptionalColumnRead fetched optional component ${s} but the iterating query didn't declare it — add .optional(component) to the query before fetching it`)}failComponent(e,n,r){const s=this.activeName,o=Ke(n);throw new T(p.ACCESS_UNDECLARED,`system '${s}' performed ${e} on ${o} but didn't declare it — add it to '${r}' (see docs/api/systems.md)`,{system:s,op:e,component:n.id})}failSparse(e,n,r){const s=this.activeName;throw new T(p.ACCESS_UNDECLARED,`system '${s}' performed ${e} on sparse component ${n} but didn't declare it — add it to '${r}' (see docs/api/systems.md)`,{system:s,op:e,sparse:n})}failRelation(e,n,r){const s=this.activeName;throw new T(p.ACCESS_UNDECLARED,`system '${s}' performed ${e} on relation ${n} but didn't declare it — add it to '${r}' (see docs/api/systems.md)`,{system:s,op:e,relation:n})}failResource(e,n,r){const s=this.activeName,o=n.description??"<unnamed>";throw new T(p.ACCESS_UNDECLARED,`system '${s}' performed resource ${e} on '${o}' but didn't declare it — add the resource key to '${r}' (see docs/api/systems.md)`,{system:s,op:e,resource:o})}}const K=new jn,Qn="/packages/engine/src/core/ecs/";class Zn{activeCache=null;repoRootCache=null;buf=new Map;callsiteCache=new Map;isActive(){if(this.activeCache!==null)return this.activeCache;const n=globalThis.process?.env?.VISUAL_INTEL_TRACE;return this.activeCache=n==="1"||n==="true"}repoRoot(){if(this.repoRootCache!==null)return this.repoRootCache;const e=globalThis.process;return this.repoRootCache=e?.cwd?.()??""}resolveCallsite(){return es(new Error().stack??null,this.repoRoot(),this.callsiteCache)}record(e,n,r){const s=this.resolveCallsite();if(!s)return;const o=`${e}	${n}	${r}	${s}`;this.buf.set(o,(this.buf.get(o)??0)+1)}recordEmit(e){this.record("ecs-events","emit",e)}recordRead(e){this.record("ecs-events","read",e)}recordResourceRead(e){this.record("resources","read",e)}recordResourceWrite(e){this.record("resources","write",e)}recordResourceRegister(e){this.record("resources","register",e)}recordResourceRemove(e){this.record("resources","remove",e)}recordSendAction(e){this.record("actions","send_action",e)}recordHandleAction(e){this.record("actions","handle_action",e)}snapshot(){const e={"ecs-events":{emit:[],read:[]},actions:{send_action:[],handle_action:[]},resources:{read:[],write:[],register:[],remove:[]}};for(const[n,r]of this.buf.entries()){const[s,o,i,a]=n.split("	");if(!s||!o||a===void 0)continue;const l={key:s==="actions"?Number(i):i,file:a,count:r},_=e[s][o];_&&_.push(l)}for(const n of Object.values(e))for(const r of Object.values(n))r.sort((s,o)=>{if(s.file!==o.file)return s.file<o.file?-1:1;const i=String(s.key),a=String(o.key);return i<a?-1:i>a?1:0});return{schemaVersion:1,capturedAt:new Date().toISOString(),channels:e}}reset(){this.buf.clear(),this.callsiteCache.clear(),this.activeCache=null,this.repoRootCache=null}}function Jn(t){const e=/\(([^)]+):\d+:\d+\)\s*$/.exec(t);if(e)return e[1]??null;const n=/at\s+([^\s][^()]*?):\d+:\d+\s*$/.exec(t);return n&&(n[1]??"").trim()||null}function es(t,e,n){if(!t)return null;const r=t.split(`
+`);for(let s=0;s<r.length;s++){const o=r[s],i=n?.get(o);if(i!==void 0){if(i===null)continue;return i}const a=Jn(o);if(!a){n?.set(o,null);continue}if(a.includes(Qn)){n?.set(o,null);continue}const c=ts(a,e);return n?.set(o,c),c}return null}function ts(t,e){let n=t;return n.startsWith("file://")&&(n=n.slice(7)),e&&n.startsWith(e+"/")&&(n=n.slice(e.length+1)),n.replace(/\\/g,"/")}const ns=new Zn;var B=(t=>(t.PRE_STARTUP="PRE_STARTUP",t.STARTUP="STARTUP",t.POST_STARTUP="POST_STARTUP",t.FIXED_UPDATE="FIXED_UPDATE",t.PRE_UPDATE="PRE_UPDATE",t.UPDATE="UPDATE",t.POST_UPDATE="POST_UPDATE",t))(B||{});const he=["PRE_STARTUP","STARTUP","POST_STARTUP"],Ee=["PRE_UPDATE","UPDATE","POST_UPDATE"];function ss(t){return Object.freeze({name:t})}function rs(t){return!("fn"in t)}const j=Object.freeze([]);function me(t){return t===void 0?j:Array.isArray(t)?t:[t]}class os{labelSystems=new Map;sortedCache=new Map;systemIndex=new Map;systemLastRun=new Map;gatedSystems=new Map;setConditions=new Map;setOrdering=new Map;nextInsertionOrder=0;_backend=null;onWarn;constructor(e){this.onWarn=e??(n=>console.warn(n));for(let n=0;n<he.length;n++)this.labelSystems.set(he[n],[]);this.labelSystems.set("FIXED_UPDATE",[]);for(let n=0;n<Ee.length;n++)this.labelSystems.set(Ee[n],[])}addSystems(e,...n){for(const r of n){const s="system"in r,o=s?r.system:r,i=s?r.ordering:void 0,a=s?me(r.runIf):j,c=s?me(r.set):j;if(this.systemIndex.has(o))throw new T(p.DUPLICATE_SYSTEM,`System ${o.name??o.id} is already scheduled`);const l={descriptor:o,insertionOrder:this.nextInsertionOrder++,before:new Set(i?.before??[]),after:new Set(i?.after??[]),conditions:a,sets:c};this.labelSystems.get(e).push(l),this.systemIndex.set(o,e),this.systemLastRun.set(o,0),(a.length>0||c.length>0)&&this.gatedSystems.set(o,l),this.sortedCache.delete(e)}}configureSet(e,n){const r=me(n.runIf);if(r.length>0){const s=this.setConditions.get(e);s===void 0?this.setConditions.set(e,[...r]):s.push(...r)}if(n.before!==void 0||n.after!==void 0){let s=this.setOrdering.get(e);s===void 0&&(s={before:new Set,after:new Set},this.setOrdering.set(e,s));for(const o of n.before??j)s.before.add(o);for(const o of n.after??j)s.after.add(o);this.sortedCache.clear()}}removeSystem(e){const n=this.systemIndex.get(e);if(n===void 0)return;const r=this.labelSystems.get(n),s=r.findIndex(o=>o.descriptor===e);if(s!==-1){const o=r.length-1;s!==o&&(r[s]=r[o]),r.pop();for(const i of r)i.before.delete(e),i.after.delete(e)}this.systemIndex.delete(e),this.systemLastRun.delete(e),this.gatedSystems.delete(e),this.sortedCache.delete(n)}setBackend(e){this._backend=e}runStartup(e,n){for(const r of he)this.runLabel(r,e,Ct,n)}runUpdate(e,n,r){for(const s of Ee)this.runLabel(s,e,n,r)}runFixedUpdate(e,n,r){this.runLabel("FIXED_UPDATE",e,n,r)}hasFixedSystems(){return this.labelSystems.get("FIXED_UPDATE").length>0}getAllSystems(){const e=[];for(const n of this.labelSystems.values())for(const r of n)e.push(r.descriptor);return e}hasSystem(e){return this.systemIndex.has(e)}clear(){for(const e of this.labelSystems.values())e.length=0;this.sortedCache.clear(),this.systemIndex.clear(),this.systemLastRun.clear(),this.gatedSystems.clear(),this.setConditions.clear(),this.setOrdering.clear()}runLabel(e,n,r,s){const o=this.getSorted(e),i=this.gatedSystems.size>0,a=this._backend,c=i?new Map:void 0;for(let l=0;l<o.length;l++){const d=o[l];if(i){const f=this.gatedSystems.get(d);if(f!==void 0&&!this.shouldRun(f,n,c))continue}n.lastRunTick=this.systemLastRun.get(d)??0;const _=a!==null?d.backendHandle:void 0;K.enter(d),n._trace?.systemStart(d,e);try{_!==void 0?a.run(_):d.fn?.(n,r)}finally{n._trace?.systemEnd(d),K.leave()}this.systemLastRun.set(d,s)}n._trace?.flushBegin(e),n.flush(),n._trace?.flushEnd(e),n._trace?.phaseBoundary(e)}shouldRun(e,n,r){if(e.conditions.length>0&&!this.evalConditions(e.conditions,n))return!1;for(let s=0;s<e.sets.length;s++){const o=e.sets[s];let i=r.get(o);if(i===void 0){const a=this.setConditions.get(o);i=a===void 0||a.length===0?!0:this.evalConditions(a,n),r.set(o,i)}if(!i)return!1}return!0}evalConditions(e,n){for(let r=0;r<e.length;r++){const s=e[r];K.enterCondition(s);let o;try{o=s.evaluate(n)}finally{K.leave()}if(!o)return!1}return!0}getSorted(e){const n=this.sortedCache.get(e);if(n!==void 0)return n;const r=this.labelSystems.get(e),s=this.sortSystems(r,e);return this.sortedCache.set(e,s),s}sortSystems(e,n){if(e.length===0)return[];const r=[],s=new Map,o=new Set,i=new Map;for(const d of e){r.push(d.descriptor),s.set(d.descriptor,d.insertionOrder),o.add(d.descriptor);for(let _=0;_<d.sets.length;_++){const f=d.sets[_];let m=i.get(f);m===void 0&&(m=[],i.set(f,m)),m.push(d.descriptor)}}const a=new Map;for(const d of e)a.set(d.descriptor,[]);for(const d of e){this.resolveEdges(d.descriptor,d.before,"before",o,i,a,n),this.resolveEdges(d.descriptor,d.after,"after",o,i,a,n);for(let _=0;_<d.sets.length;_++){const f=this.setOrdering.get(d.sets[_]);f!==void 0&&(this.resolveEdges(d.descriptor,f.before,"before",o,i,a,n),this.resolveEdges(d.descriptor,f.after,"after",o,i,a,n))}}const c=(d,_)=>s.get(d)-s.get(_),l=d=>d.name??`system_${d.id}`;try{return We.topologicalSort(r,a,c,l)}catch(d){throw d instanceof TypeError?new T(p.CIRCULAR_SYSTEM_DEPENDENCY,`Circular system dependency detected in ${n}: ${d.message}`):d}}resolveEdges(e,n,r,s,o,i,a){for(const c of n){if(rs(c)){const l=o.get(c);if(l===void 0)continue;for(let d=0;d<l.length;d++){const _=l[d];_!==e&&this.addDirectedEdge(e,_,r,i)}continue}if(!s.has(c)){this.warnDroppedEdge(e,c,r,a);continue}this.addDirectedEdge(e,c,r,i)}}addDirectedEdge(e,n,r,s){r==="before"?s.get(e).push(n):s.get(n).push(e)}warnDroppedEdge(e,n,r,s){if(this.systemIndex.has(n))return;const o=i=>i.name??`system_${i.id}`;this.onWarn(`Schedule[${s}]: \`${o(e)}\` declares \`${r}\` ordering against \`${o(n)}\`, which is not registered in any phase — the constraint is ignored. Check for a typo or a missing add_systems() call.`)}}const oe=1024,ie=1024*oe,He=64*oe,G=256*ie,ye=3,_t=64,ft=8,Ve=4*ie,Xe=t=>2**Math.ceil(Math.log2(Math.max(1,t))),ne=t=>2**Math.floor(Math.log2(Math.max(1,t))),k=(t,e,n)=>Math.min(n,Math.max(e,t)),w=t=>t>=ie?`${(t/ie).toFixed(1)} MiB`:t>=oe?`${(t/oe).toFixed(0)} KiB`:`${t} B`;function D(t,e){if(!Number.isInteger(e)||e<=0)throw new T(p.INVALID_MEMORY_OPTIONS,`memory.${t} must be a positive integer (got ${e})`)}function is(t){const e=["budget","maxBytes","wasm","allocator","heap","shared"].filter(s=>t!==void 0&&t[s]!==void 0);if(e.length>1)throw new T(p.INVALID_MEMORY_OPTIONS,`memory takes at most one of budget | maxBytes | wasm | allocator | heap | shared (got: ${e.join(", ")})`);const n=t?.columnCapacity;if(n!==void 0&&D("column_capacity",n),t?.budget!==void 0){const{entities:s}=t.budget,o=t.budget.archetypes??ft,i=t.budget.bytesPerEntity??_t;if(D("budget.entities",s),D("budget.archetypes",o),D("budget.bytes_per_entity",i),s>1<<20)throw new T(p.INVALID_MEMORY_OPTIONS,`memory.budget.entities=${s} exceeds the EntityID index space (1<<20 = ${1<<20})`);const a=n??k(Xe(Math.ceil(s/o)),64,1<<20),c=k(Xe(s*2),4096,1<<20),l=c*R,d=s*i*ye,_=be(Math.max(l+d,Ve),He);return{source:"budget",allocator:P.heapArraybufferAllocator(_),columnCapacity:a,entityIndexCapacity:c,capBytes:_,intentLabel:`budget of ${s} entities`,budgetEntities:s,derivation:[`column_capacity = ${n!==void 0?`${a} (pinned)`:`pow2(${s}/${o} per archetype) = ${a}`}`,`entity_index = pow2(2 × ${s}) = ${c} slots × ${R} B = ${w(l)}`,`columns = ${s} × ${i} B × ${ye} (double+holes headroom) = ${w(d)}`,`cap = align64K(max(index + columns, ${w(Ve)} floor)) = ${w(_)}`],wasmMemory:null}}if(t?.maxBytes!==void 0){D("maxBytes",t.maxBytes);const s=n??F,o=k(ne(t.maxBytes/4/R),4096,U);return{source:"max_bytes",allocator:P.heapArraybufferAllocator(t.maxBytes),columnCapacity:s,entityIndexCapacity:o,capBytes:t.maxBytes,intentLabel:`explicit cap of ${w(t.maxBytes)}`,budgetEntities:null,derivation:[`cap = ${w(t.maxBytes)} (caller-declared)`,`column_capacity = ${s} (${n!==void 0?"pinned":"default"})`,`entity_index = floor_pow2(cap/4 ÷ ${R} B) = ${o} slots`],wasmMemory:null}}if(t?.wasm!==void 0){const s=t.wasm,o=n??F;if(s.memory!==void 0){if(!(s.memory.buffer instanceof SharedArrayBuffer))throw new T(p.INVALID_MEMORY_OPTIONS,"memory.wasm.memory must be constructed with `shared: true` — the SAB substrate requires a SharedArrayBuffer-backed WebAssembly.Memory (ADR-0004 / ADR-0018)");return{source:"wasm",allocator:P.wasmMemoryAllocator(s.memory),columnCapacity:o,entityIndexCapacity:U,capBytes:null,intentLabel:"caller-supplied WebAssembly.Memory",budgetEntities:null,derivation:["backing = wasm_memory_allocator(memory) — zero-copy with the sim (is_in_place ✓)","cap = the Memory's own `maximum` (declared by the caller; not readable from JS)",`column_capacity = ${o} (${n!==void 0?"pinned":"default"})`],wasmMemory:s.memory}}D("wasm.maximum_pages",s.maximumPages);const i=s.initialPages??Math.min(32,s.maximumPages);if(D("wasm.initial_pages",i),i>s.maximumPages)throw new T(p.INVALID_MEMORY_OPTIONS,`memory.wasm.initial_pages (${i}) exceeds maximum_pages (${s.maximumPages})`);const a=new WebAssembly.Memory({initial:i,maximum:s.maximumPages,shared:!0}),c=s.maximumPages*He,l=k(ne(c/4/R),4096,U);return{source:"wasm",allocator:P.wasmMemoryAllocator(a),columnCapacity:o,entityIndexCapacity:l,capBytes:c,intentLabel:`engine-constructed WebAssembly.Memory (max ${s.maximumPages} pages)`,budgetEntities:null,derivation:[`cap = ${s.maximumPages} pages × 64 KiB = ${w(c)} (Memory maximum)`,`initial = ${i} pages (${s.initialPages!==void 0?"declared":"default"})`,`entity_index = floor_pow2(cap/4 ÷ ${R} B) = ${l} slots`,`column_capacity = ${o} (${n!==void 0?"pinned":"default"})`],wasmMemory:a}}if(t?.allocator!==void 0){if(t.allocator.isInPlace!==!0)throw new T(p.INVALID_MEMORY_OPTIONS,"memory.allocator must declare `is_in_place: true` (ADR-0008): a live Store's flush loops hoist entity-index views across grows, so a non-in-place allocator (e.g. DEFAULT_SAB_ALLOCATOR) corrupts the entity→row mapping. Use growable_sab_allocator / wasm_memory_allocator; non-in-place allocators are snapshot/test sizing only.");const s=n??F,o=t.capBytesHint;return o!==void 0&&D("cap_bytes_hint",o),{source:"allocator",allocator:t.allocator,columnCapacity:s,entityIndexCapacity:U,capBytes:o??null,intentLabel:o!==void 0?`custom in-place allocator (cap hint ${w(o)})`:"custom in-place allocator",budgetEntities:null,derivation:["backing = caller allocator (is_in_place ✓ checked at construction)",o!==void 0?`cap = ${w(o)} (caller hint — diagnostics only; the allocator owns the real cap)`:"cap = allocator-owned (no hint)",`column_capacity = ${s} (${n!==void 0?"pinned":"default"})`],wasmMemory:null}}if(t?.heap!==void 0){t.heap.maxBytes!==void 0&&D("heap.maxBytes",t.heap.maxBytes);const s=t.heap.maxBytes??G,o=n??F,i=k(ne(s/4/R),4096,U);return{source:"heap",allocator:P.heapArraybufferAllocator(s),columnCapacity:o,entityIndexCapacity:i,capBytes:s,intentLabel:`pure-TS heap backing (${w(s)} growable cap, no SharedArrayBuffer)`,budgetEntities:null,derivation:[`backing = heap_arraybuffer_allocator(${w(s)}) — resizable ArrayBuffer, no SAB / no COOP+COEP (is_in_place ✓)`,"trade-off: no worker offload / no WASM backend (both need a transferable SharedArrayBuffer)",`column_capacity = ${o} (${n!==void 0?"pinned":"default"})`,`entity_index = floor_pow2(cap/4 ÷ ${R} B) = ${i} slots`],wasmMemory:null}}if(t?.shared!==void 0){t.shared.maxBytes!==void 0&&D("shared.maxBytes",t.shared.maxBytes);const s=t.shared.maxBytes??G,o=n??F,i=k(ne(s/4/R),4096,U);return{source:"shared",allocator:P.growableSabAllocator(s),columnCapacity:o,entityIndexCapacity:i,capBytes:s,intentLabel:`shared SharedArrayBuffer backing (${w(s)} growable cap, needs COOP/COEP)`,budgetEntities:null,derivation:[`backing = growable_sab_allocator(${w(s)}) — growable SharedArrayBuffer (is_in_place ✓); needs cross-origin isolation`,"enables worker offload + a WASM compute backend (transferable SharedArrayBuffer)",`column_capacity = ${o} (${n!==void 0?"pinned":"default"})`,`entity_index = floor_pow2(cap/4 ÷ ${R} B) = ${i} slots`],wasmMemory:null}}const r=n??F;return{source:"default",allocator:P.heapArraybufferAllocator(),columnCapacity:r,entityIndexCapacity:U,capBytes:G,intentLabel:`default sizing (${w(G)} growable cap)`,budgetEntities:null,derivation:[`cap = ${w(G)} (heap_arraybuffer_allocator default)`,`column_capacity = ${r} (${n!==void 0?"pinned":"DEFAULT_COLUMN_CAPACITY"})`,`entity_index = ${U} slots (full EntityID space, ~12 MiB virtual)`],wasmMemory:null}}function as(t,e){return{def:t,values:e}}function ae(t,e){switch(e.kind){case"spawn":{const n=t.commands.spawn();for(const r of e.components)t.commands.add(n,r.def,r.values);return e.onSpawned?.(n),n}case"despawn":t.commands.despawn(e.eid);return;case"add_component":t.commands.add(e.eid,e.def,e.values);return;case"remove_component":t.commands.remove(e.eid,e.def);return;case"set_field":if(!t.hasComponent(e.eid,e.def))throw new T(p.COMPONENT_NOT_REGISTERED,`host set_field on entity ${e.eid} targets a component it does not have. If you added that component via a host command this same frame, the add is deferred to the phase flush while set_field is immediate — carry the value in add_component/spawn_entry instead of a separate set_field, or set it next frame. (#681 host write seam)`);t.setField(e.eid,e.def,e.field,e.value);return;case"disable":t.commands.disable(e.eid);return;case"enable":t.commands.enable(e.eid);return;default:return pt(e,"HostCommand kind")}}class ht{queued=[];spawn(e,n){return this.queued.push({kind:"spawn",components:e,onSpawned:n}),this}despawn(e){return this.queued.push({kind:"despawn",eid:e}),this}add(e,n,r){return this.queued.push({kind:"add_component",eid:e,def:n,values:r}),this}remove(e,n){return this.queued.push({kind:"remove_component",eid:e,def:n}),this}setField(e,n,r,s){return this.queued.push({kind:"set_field",eid:e,def:n,field:r,value:s}),this}disable(e){return this.queued.push({kind:"disable",eid:e}),this}enable(e){return this.queued.push({kind:"enable",eid:e}),this}push(e){return this.queued.push(e),this}get pending(){return this.queued.length}clear(){const e=this.queued.length;return this.queued.length=0,e}drain(e,n){const r=this.queued.length;if(r===0)return 0;if(n===void 0)for(let s=0;s<r;s++)ae(e,this.queued[s]);else for(let s=0;s<r;s++){const o=this.queued[s];n(o),ae(e,o)}return this.queued.splice(0,r),r}}const Pe=x-1;function cs(t){if(t===De)throw new M("cannot bind op_code 0 (reserved as the command-ring empty-slot marker)");if(t<0||t>255||!Number.isInteger(t))throw new M(`command op_code must be a u8 in [1, 255] (got ${t})`)}function ue(t){const e=new Uint8Array(Pe);return new DataView(e.buffer).setUint32(0,t,!0),e}function _e(t){return new DataView(t.buffer,t.byteOffset,t.byteLength).getUint32(0,!0)}function ds(t,e){return{encode(n){if(n.kind!=="set_field")throw new M(`ringSetFieldCodec encodes a "set_field" command (got "${n.kind}")`);const r=new Uint8Array(Pe),s=new DataView(r.buffer);return s.setUint32(0,n.eid,!0),s.setFloat64(4,n.value,!0),r},decode(n){const r=new DataView(n.buffer,n.byteOffset,n.byteLength);return{kind:"set_field",eid:r.getUint32(0,!0),def:t,field:e,value:r.getFloat64(4,!0)}}}}function ls(){return{encode(t){if(t.kind!=="despawn")throw new M(`ring_despawn_codec encodes a "despawn" command (got "${t.kind}")`);return ue(t.eid)},decode:t=>({kind:"despawn",eid:_e(t)})}}function us(){return{encode(t){if(t.kind!=="disable")throw new M(`ring_disable_codec encodes a "disable" command (got "${t.kind}")`);return ue(t.eid)},decode:t=>({kind:"disable",eid:_e(t)})}}function _s(){return{encode(t){if(t.kind!=="enable")throw new M(`ring_enable_codec encodes an "enable" command (got "${t.kind}")`);return ue(t.eid)},decode:t=>({kind:"enable",eid:_e(t)})}}function fs(t){return{encode(e){if(e.kind!=="remove_component")throw new M(`ringRemoveComponentCodec encodes a "remove_component" command (got "${e.kind}")`);return ue(e.eid)},decode:e=>({kind:"remove_component",eid:_e(e),def:t})}}class hs{appliers=new Map;on(e,n){return cs(e),this.appliers.set(e,n),this}off(e){return this.appliers.delete(e)}onCommand(e,n){return this.on(e,(r,s,o)=>{const i=n.decode(s);o?.(i),ae(r,i)})}drain(e,n,r,s){return en(n,r,(o,i)=>{const a=this.appliers.get(o);a!==void 0&&a(e,i,s)})}}const Es=new Set([B.PRE_STARTUP,B.STARTUP,B.POST_STARTUP]),Ie=new WeakMap;function ms(t,e){const n=Ie.get(e);if(n===void 0)return!1;for(const r of n)t.removeSystem(r);return Ie.delete(e),e.clear(),!0}function gs(t,e){const n=new ht,r=[];Ie.set(n,r);const s=e?.name??"host_command_apply",o=e?.ring,i=e?.recorder,a=i?.record,c=e?.schedules??[B.PRE_STARTUP,B.PRE_UPDATE];if(i!==void 0&&c.includes(B.FIXED_UPDATE))throw new T(p.INVALID_RECORDER_SCHEDULE,"install_host_command_seam: a recorder cannot drain on SCHEDULE.FIXED_UPDATE — it would log the fixed-step dt instead of the host update(dt) and diverge on replay. Use a variable-update phase (PRE_UPDATE/UPDATE/POST_UPDATE).");for(const l of c){const d=!Es.has(l),_=t.registerSystem({name:`${s}:${l}`,reads:[],writes:[],exclusive:!0,fn:(f,m)=>{if(i!==void 0&&d&&i.openTick(f.ecsTick,m),n.drain(f,a),o!==void 0){const y=t.columnStore,u=y.header.commandRingOff;u!==0&&o.drain(f,y.view,u,a)}}});t.addSystems(l,_),r.push(_)}return n}exports.ACTION_RING_DEFAULT_CAPACITY_SLOTS=En;exports.ANY_RELATION=Ae;exports.ARCHETYPE_DESCRIPTOR_HEADER_BYTES=de;exports.ARCHETYPE_DESCRIPTOR_OFFSETS=N;exports.BUDGET_DEFAULT_ARCHETYPES=ft;exports.BUDGET_DEFAULT_BYTES_PER_ENTITY=_t;exports.BUDGET_GROWTH_HEADROOM=ye;exports.COLUMN_DESCRIPTOR_BYTES=ce;exports.COMMAND_RING_DEFAULT_CAPACITY_SLOTS=zt;exports.COMPONENT_MASK_WORDS=Q;exports.DEFAULT_COLUMN_CAPACITY=F;exports.DEFAULT_ECS_CAP_BYTES=G;exports.DEFAULT_FIXED_TIMESTEP=Dt;exports.DEFAULT_MAX_FIXED_STEPS=Ot;exports.DEFAULT_ON_DELETE_TARGET=xn;exports.ECSError=T;exports.ECS_ERROR=p;exports.EMPTY_VALUES=It;exports.ENTITY_INDEX_DEFAULT_CAPACITY=U;exports.ENTITY_INDEX_HEADER_BYTES=te;exports.ENTITY_INDEX_HEADER_OFFSETS=Z;exports.EVENT_RING_DEFAULT_CAPACITY_SLOTS=dn;exports.FNV1A_OFFSET_BASIS=it;exports.FNV1A_PRIME=Ue;exports.HASH_GOLDEN_RATIO=St;exports.HASH_SECONDARY_PRIME=wt;exports.HOST_COMMAND_PAYLOAD_BYTES=Pe;exports.HostCommandDispatcher=hs;exports.HostCommandQueue=ht;exports.INDEX_BITS=W;exports.INDEX_MASK=we;exports.INITIAL_GENERATION=Nt;exports.MAX_ENTITY_ID=ge;exports.MAX_GENERATION=J;exports.MAX_INDEX=L;exports.MAX_LIVE_GENERATION=vt;exports.NO_SWAP=yt;exports.RELATION_TARGET_FIELD=at;exports.RETIRED_GENERATION=Ut;exports.SCHEDULE=B;exports.SIM_ABI_VERSION=Qe;exports.STORE_DESCRIPTOR_COMPONENT_LIMIT=Gt;exports.STORE_HEADER_BYTES=Ze;exports.STORE_HEADER_OFFSETS=E;exports.STORE_MAGIC=je;exports.STORE_MAX_BYTE_OFFSET=le;exports.STORE_PREFIX_REGIONS=q;exports.Schedule=os;exports.SparseComponentStore=Pn;exports.SparseRestoreError=A;exports.StoreLayoutOverflowError=Ce;exports.TYPED_ARRAY_TAG_TO_TYPE_TAG=xt;exports.TYPE_TAG_STRIDE=Te;exports.UNASSIGNED=At;exports.accessCheck=K;exports.alignUp=be;exports.applyHostCommand=ae;exports.archetypeDescriptorBytes=Re;exports.buildArchetypeViews=ot;exports.buildEntityIndexViews=on;exports.columnKey=rt;exports.componentDebugName=$t;exports.componentLabel=Ke;exports.createColumnStore=Ln;exports.createEntityId=Lt;exports.dispatchTrace=ns;exports.entityNotAliveError=Mt;exports.findRegionEntry=Cn;exports.findRegionOffset=On;exports.fnv1aStepWord=Mn;exports.getEntityGeneration=pe;exports.getEntityIndex=v;exports.installHostCommandSeam=gs;exports.isColumnStoreInternal=vn;exports.isEcsError=Tt;exports.isNonNegativeInteger=Et;exports.makeRelationStore=Hn;exports.readHeaderRegionTable=Dn;exports.readLayoutDescriptorRegion=Xt;exports.readStoreHeader=Ft;exports.resolveECSMemory=is;exports.restoreRelations=Xn;exports.restoreSparseStores=Bn;exports.ringDespawnCodec=ls;exports.ringDisableCodec=us;exports.ringEnableCodec=_s;exports.ringRemoveComponentCodec=fs;exports.ringSetFieldCodec=ds;exports.setComponentDebugName=Pt;exports.snapshotRelations=Vn;exports.snapshotSparseStores=$n;exports.spawnEntry=as;exports.systemSet=ss;exports.uninstallHostCommandSeam=ms;exports.unsafeCast=gt;exports.validateAndCast=mt;exports.validateSparseStores=Fn;exports.writeArchetypeDescriptor=Je;

package/dist/internal.development.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./internal-LiTSB_tG.cjs");exports.BUDGET_DEFAULT_ARCHETYPES=e.BUDGET_DEFAULT_ARCHETYPES;exports.BUDGET_DEFAULT_BYTES_PER_ENTITY=e.BUDGET_DEFAULT_BYTES_PER_ENTITY;exports.BUDGET_GROWTH_HEADROOM=e.BUDGET_GROWTH_HEADROOM;exports.DEFAULT_ECS_CAP_BYTES=e.DEFAULT_ECS_CAP_BYTES;exports.HOST_COMMAND_PAYLOAD_BYTES=e.HOST_COMMAND_PAYLOAD_BYTES;exports.HostCommandDispatcher=e.HostCommandDispatcher;exports.MAX_ENTITY_ID=e.MAX_ENTITY_ID;exports.MAX_GENERATION=e.MAX_GENERATION;exports.MAX_INDEX=e.MAX_INDEX;exports.MAX_LIVE_GENERATION=e.MAX_LIVE_GENERATION;exports.RETIRED_GENERATION=e.RETIRED_GENERATION;exports.accessCheck=e.accessCheck;exports.createEntityId=e.createEntityId;exports.dispatchTrace=e.dispatchTrace;exports.getEntityGeneration=e.getEntityGeneration;exports.resolveECSMemory=e.resolveECSMemory;exports.ringDespawnCodec=e.ringDespawnCodec;exports.ringDisableCodec=e.ringDisableCodec;exports.ringEnableCodec=e.ringEnableCodec;exports.ringRemoveComponentCodec=e.ringRemoveComponentCodec;exports.ringSetFieldCodec=e.ringSetFieldCodec;

package/dist/internal.development.js

@@ -0,0 +1,24 @@
+import { ax as s, aw as e, av as T, au as _, aE as A, ay as o, a4 as D, aG as n, aF as C, aH as r, p as t, h as c, o as i, ad as d, a3 as I, af as N, aA as R, aB as G, aC as O, aD as M, az as S } from "./internal-BMDgWZbt.js";
+export {
+  s as BUDGET_DEFAULT_ARCHETYPES,
+  e as BUDGET_DEFAULT_BYTES_PER_ENTITY,
+  T as BUDGET_GROWTH_HEADROOM,
+  _ as DEFAULT_ECS_CAP_BYTES,
+  A as HOST_COMMAND_PAYLOAD_BYTES,
+  o as HostCommandDispatcher,
+  D as MAX_ENTITY_ID,
+  n as MAX_GENERATION,
+  C as MAX_INDEX,
+  r as MAX_LIVE_GENERATION,
+  t as RETIRED_GENERATION,
+  c as accessCheck,
+  i as createEntityId,
+  d as dispatchTrace,
+  I as getEntityGeneration,
+  N as resolveECSMemory,
+  R as ringDespawnCodec,
+  G as ringDisableCodec,
+  O as ringEnableCodec,
+  M as ringRemoveComponentCodec,
+  S as ringSetFieldCodec
+};

package/dist/interop-DqxleBo7.js

@@ -0,0 +1,18 @@
+import { e as n, u } from "./kernel-Cz2Kxlwl.js";
+function a(e, t) {
+  let r = !1;
+  return n(() => {
+    const s = e();
+    r ? u(() => t(s)) : r = !0;
+  });
+}
+function f(e) {
+  return {
+    subscribe: (t) => a(e, () => t()),
+    getSnapshot: e
+  };
+}
+export {
+  a as s,
+  f as t
+};

package/dist/interop-T1HZ-Dpa.cjs

@@ -0,0 +1 @@
+"use strict";const n=require("./kernel-sw7ScKWu.cjs");function u(e,t){let r=!1;return n.effect(()=>{const s=e();r?n.untrack(()=>t(s)):r=!0})}function i(e){return{subscribe:t=>u(e,()=>t()),getSnapshot:e}}exports.subscribe=u;exports.toExternalStore=i;

package/dist/kernel-Cz2Kxlwl.js

@@ -0,0 +1,240 @@
+let r = null, h = 0, d = !1, O = 0;
+const f = [];
+let c, l = null;
+function a(s) {
+  const e = s.owned;
+  if (e !== null) {
+    s.owned = null;
+    for (let t = e.length - 1; t >= 0; t--) e[t].dispose();
+  }
+  const i = s.cleanups;
+  if (i !== null) {
+    s.cleanups = null;
+    for (let t = i.length - 1; t >= 0; t--) i[t]();
+  }
+}
+function D(s) {
+  l !== null && (l.owned ??= []).push(s);
+}
+function b(s, e) {
+  const i = e.depsTail;
+  if (i !== void 0 && i.source === s) {
+    i.version = s.version;
+    return;
+  }
+  const t = i !== void 0 ? i.nextDep : e.deps;
+  if (t !== void 0 && t.source === s) {
+    t.version = s.version, e.depsTail = t;
+    return;
+  }
+  const n = N(s, e, i, t);
+  n.version = s.version, i !== void 0 ? i.nextDep = n : e.deps = n, t !== void 0 && (t.prevDep = n), e.depsTail = n, n.prevSub = s.subsTail, s.subsTail !== void 0 ? s.subsTail.nextSub = n : s.subs = n, s.subsTail = n;
+}
+function N(s, e, i, t) {
+  const n = c;
+  return n !== void 0 ? (c = n.nextDep, n.source = s, n.target = e, n.version = 0, n.prevDep = i, n.nextDep = t, n.prevSub = void 0, n.nextSub = void 0, n) : { source: s, target: e, version: 0, prevSub: void 0, nextSub: void 0, prevDep: i, nextDep: t };
+}
+function p(s) {
+  const { source: e, target: i, prevDep: t, nextDep: n, prevSub: o, nextSub: u } = s;
+  return t !== void 0 ? t.nextDep = n : i.deps = n, n !== void 0 && (n.prevDep = t), o !== void 0 ? o.nextSub = u : e.subs = u, u !== void 0 ? u.prevSub = o : e.subsTail = o, s.prevDep = void 0, s.prevSub = void 0, s.nextSub = void 0, s.nextDep = c, c = s, n;
+}
+function T(s) {
+  s.depsTail = void 0;
+}
+function S(s) {
+  const e = s.depsTail;
+  let i = e !== void 0 ? e.nextDep : s.deps;
+  for (; i !== void 0; ) i = p(i);
+}
+function g(s) {
+  for (let e = s.deps; e !== void 0; e = e.nextDep)
+    if (e.source.refresh(), e.version !== e.source.version) return !0;
+  return !1;
+}
+function E(s) {
+  for (let e = s.subs; e !== void 0; e = e.nextSub)
+    e.target.notify();
+}
+class y {
+  value;
+  eq;
+  version = 0;
+  subs = void 0;
+  subsTail = void 0;
+  constructor(e, i) {
+    this.value = e, this.eq = i;
+  }
+  refresh() {
+  }
+  get() {
+    return r !== null && b(this, r), this.value;
+  }
+  set(e) {
+    this.eq(this.value, e) || (this.value = e, this.version++, this.subs !== void 0 && (E(this), h === 0 && w()));
+  }
+}
+class x {
+  value;
+  // assigned by the first refresh, which always runs before any read
+  fn;
+  eq;
+  version = 0;
+  subs = void 0;
+  subsTail = void 0;
+  deps = void 0;
+  depsTail = void 0;
+  flags = 4;
+  cleanups = null;
+  owned = null;
+  constructor(e, i) {
+    this.fn = e, this.eq = i;
+  }
+  refresh() {
+    if (this.flags & 9 || (this.flags &= -3, !(this.flags & 4) && this.version !== 0) || (this.flags &= -5, this.version !== 0 && !g(this))) return;
+    this.flags |= 1, a(this), T(this);
+    const e = r, i = l;
+    r = this, l = this;
+    try {
+      const t = this.fn();
+      (this.version === 0 || !this.eq(this.value, t)) && (this.value = t, this.version++);
+    } finally {
+      r = e, l = i, S(this), this.flags &= -2;
+    }
+  }
+  get() {
+    return this.flags & 1 ? this.value : (this.refresh(), r !== null && b(this, r), this.value);
+  }
+  notify() {
+    this.flags & 2 || (this.flags |= 6, E(this));
+  }
+  dispose() {
+    if (this.flags & 8) return;
+    this.flags |= 8;
+    let e = this.deps;
+    for (; e !== void 0; ) e = p(e);
+    this.depsTail = void 0, a(this);
+  }
+}
+class A {
+  fn;
+  deps = void 0;
+  depsTail = void 0;
+  flags = 0;
+  lastFlush = 0;
+  // the flush generation this effect last ran in (cycle backstop)
+  cleanups = null;
+  owned = null;
+  constructor(e) {
+    this.fn = e;
+  }
+  notify() {
+    this.flags & 2 || (this.flags |= 18, f.push(this));
+  }
+  run() {
+    if (this.flags & 8) return;
+    a(this), T(this);
+    const e = r, i = l;
+    r = this, l = this;
+    try {
+      this.fn();
+    } finally {
+      r = e, l = i, S(this);
+    }
+  }
+  dispose() {
+    if (this.flags & 8) return;
+    this.flags |= 8;
+    let e = this.deps;
+    for (; e !== void 0; ) e = p(e);
+    this.depsTail = void 0, a(this);
+  }
+}
+function w() {
+  if (d) return;
+  d = !0;
+  const s = ++O;
+  let e = 0, i, t = !1;
+  try {
+    for (let n = 0; n < f.length; n++) {
+      const o = f[n];
+      if (o.flags &= -19, !(o.flags & 8) && g(o)) {
+        if (o.lastFlush === s && ++e > 1e5)
+          throw new Error(
+            "reactive flush did not settle after 100000 cascading re-runs (an effect likely writes a signal it depends on — a cycle)"
+          );
+        o.lastFlush = s;
+        try {
+          o.run();
+        } catch (u) {
+          t || (i = u, t = !0);
+        }
+      }
+    }
+  } finally {
+    f.length = 0, d = !1;
+  }
+  if (t) throw i;
+}
+function U(s, e = Object.is) {
+  const i = new y(s, e);
+  return [() => i.get(), (t) => i.set(t)];
+}
+function k(s, e = Object.is) {
+  l === null && I(
+    "computed() created outside an ownership scope is permanently subscribed and can never be disposed — create it under root() or inside an effect."
+  );
+  const i = new x(s, e);
+  return D(i), () => i.get();
+}
+function C(s) {
+  const e = new A(s);
+  return D(e), e.run(), () => e.dispose();
+}
+function F(s) {
+  h++;
+  try {
+    s();
+  } finally {
+    --h === 0 && w();
+  }
+}
+function P(s) {
+  const e = r;
+  r = null;
+  try {
+    return s();
+  } finally {
+    r = e;
+  }
+}
+function q(s) {
+  const e = { cleanups: null, owned: null }, i = l;
+  l = e;
+  try {
+    return s(() => a(e));
+  } finally {
+    l = i;
+  }
+}
+function G(s) {
+  if (l === null) {
+    I(
+      "onCleanup() called outside an ownership scope — the callback is dropped. Call it inside root(), an effect, or a computed."
+    );
+    return;
+  }
+  (l.cleanups ??= []).push(s);
+}
+const v = /* @__PURE__ */ new Set();
+function I(s) {
+  v.has(s) || (v.add(s), console.warn(`[oecs/reactive] ${s}`));
+}
+export {
+  F as b,
+  k as c,
+  C as e,
+  G as o,
+  q as r,
+  U as s,
+  P as u
+};

package/dist/kernel-sw7ScKWu.cjs

@@ -0,0 +1 @@
+"use strict";let r=null,h=0,d=!1,O=0;const a=[];let c,l=null;function f(s){const e=s.owned;if(e!==null){s.owned=null;for(let i=e.length-1;i>=0;i--)e[i].dispose()}const t=s.cleanups;if(t!==null){s.cleanups=null;for(let i=t.length-1;i>=0;i--)t[i]()}}function D(s){l!==null&&(l.owned??=[]).push(s)}function b(s,e){const t=e.depsTail;if(t!==void 0&&t.source===s){t.version=s.version;return}const i=t!==void 0?t.nextDep:e.deps;if(i!==void 0&&i.source===s){i.version=s.version,e.depsTail=i;return}const n=N(s,e,t,i);n.version=s.version,t!==void 0?t.nextDep=n:e.deps=n,i!==void 0&&(i.prevDep=n),e.depsTail=n,n.prevSub=s.subsTail,s.subsTail!==void 0?s.subsTail.nextSub=n:s.subs=n,s.subsTail=n}function N(s,e,t,i){const n=c;return n!==void 0?(c=n.nextDep,n.source=s,n.target=e,n.version=0,n.prevDep=t,n.nextDep=i,n.prevSub=void 0,n.nextSub=void 0,n):{source:s,target:e,version:0,prevSub:void 0,nextSub:void 0,prevDep:t,nextDep:i}}function p(s){const{source:e,target:t,prevDep:i,nextDep:n,prevSub:o,nextSub:u}=s;return i!==void 0?i.nextDep=n:t.deps=n,n!==void 0&&(n.prevDep=i),o!==void 0?o.nextSub=u:e.subs=u,u!==void 0?u.prevSub=o:e.subsTail=o,s.prevDep=void 0,s.prevSub=void 0,s.nextSub=void 0,s.nextDep=c,c=s,n}function T(s){s.depsTail=void 0}function S(s){const e=s.depsTail;let t=e!==void 0?e.nextDep:s.deps;for(;t!==void 0;)t=p(t)}function g(s){for(let e=s.deps;e!==void 0;e=e.nextDep)if(e.source.refresh(),e.version!==e.source.version)return!0;return!1}function E(s){for(let e=s.subs;e!==void 0;e=e.nextSub)e.target.notify()}class y{value;eq;version=0;subs=void 0;subsTail=void 0;constructor(e,t){this.value=e,this.eq=t}refresh(){}get(){return r!==null&&b(this,r),this.value}set(e){this.eq(this.value,e)||(this.value=e,this.version++,this.subs!==void 0&&(E(this),h===0&&w()))}}class x{value;fn;eq;version=0;subs=void 0;subsTail=void 0;deps=void 0;depsTail=void 0;flags=4;cleanups=null;owned=null;constructor(e,t){this.fn=e,this.eq=t}refresh(){if(this.flags&9||(this.flags&=-3,!(this.flags&4)&&this.version!==0)||(this.flags&=-5,this.version!==0&&!g(this)))return;this.flags|=1,f(this),T(this);const e=r,t=l;r=this,l=this;try{const i=this.fn();(this.version===0||!this.eq(this.value,i))&&(this.value=i,this.version++)}finally{r=e,l=t,S(this),this.flags&=-2}}get(){return this.flags&1?this.value:(this.refresh(),r!==null&&b(this,r),this.value)}notify(){this.flags&2||(this.flags|=6,E(this))}dispose(){if(this.flags&8)return;this.flags|=8;let e=this.deps;for(;e!==void 0;)e=p(e);this.depsTail=void 0,f(this)}}class A{fn;deps=void 0;depsTail=void 0;flags=0;lastFlush=0;cleanups=null;owned=null;constructor(e){this.fn=e}notify(){this.flags&2||(this.flags|=18,a.push(this))}run(){if(this.flags&8)return;f(this),T(this);const e=r,t=l;r=this,l=this;try{this.fn()}finally{r=e,l=t,S(this)}}dispose(){if(this.flags&8)return;this.flags|=8;let e=this.deps;for(;e!==void 0;)e=p(e);this.depsTail=void 0,f(this)}}function w(){if(d)return;d=!0;const s=++O;let e=0,t,i=!1;try{for(let n=0;n<a.length;n++){const o=a[n];if(o.flags&=-19,!(o.flags&8)&&g(o)){if(o.lastFlush===s&&++e>1e5)throw new Error("reactive flush did not settle after 100000 cascading re-runs (an effect likely writes a signal it depends on — a cycle)");o.lastFlush=s;try{o.run()}catch(u){i||(t=u,i=!0)}}}}finally{a.length=0,d=!1}if(i)throw t}function U(s,e=Object.is){const t=new y(s,e);return[()=>t.get(),i=>t.set(i)]}function k(s,e=Object.is){l===null&&I("computed() created outside an ownership scope is permanently subscribed and can never be disposed — create it under root() or inside an effect.");const t=new x(s,e);return D(t),()=>t.get()}function C(s){const e=new A(s);return D(e),e.run(),()=>e.dispose()}function F(s){h++;try{s()}finally{--h===0&&w()}}function P(s){const e=r;r=null;try{return s()}finally{r=e}}function q(s){const e={cleanups:null,owned:null},t=l;l=e;try{return s(()=>f(e))}finally{l=t}}function G(s){if(l===null){I("onCleanup() called outside an ownership scope — the callback is dropped. Call it inside root(), an effect, or a computed.");return}(l.cleanups??=[]).push(s)}const v=new Set;function I(s){v.has(s)||(v.add(s),console.warn(`[oecs/reactive] ${s}`))}exports.batch=F;exports.computed=k;exports.effect=C;exports.onCleanup=G;exports.root=q;exports.signal=U;exports.untrack=P;

package/dist/primitives.development.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./typed_arrays-D3NmwtCG.cjs"),t=require("./topological_sort-BDvEyb9W.cjs");class o{_dense=[];_sparse=[];get size(){return this._dense.length}get values(){return this._dense}has(e){return this._dense[this._sparse[e]]===e}add(e){this.has(e)||(this._sparse[e]=this._dense.length,this._dense.push(e))}delete(e){if(!this.has(e))return!1;const a=this._sparse[e],s=this._dense[this._dense.length-1];return this._dense[a]=s,this._sparse[s]=a,this._dense.pop(),!0}clear(){this._dense.length=0,this._sparse.length=0}[Symbol.iterator](){return this._dense[Symbol.iterator]()}}exports.BitSet=r.BitSet;exports.GrowableFloat32Array=r.GrowableFloat32Array;exports.GrowableFloat64Array=r.GrowableFloat64Array;exports.GrowableInt16Array=r.GrowableInt16Array;exports.GrowableInt32Array=r.GrowableInt32Array;exports.GrowableInt8Array=r.GrowableInt8Array;exports.GrowableTypedArray=r.GrowableTypedArray;exports.GrowableUint16Array=r.GrowableUint16Array;exports.GrowableUint32Array=r.GrowableUint32Array;exports.GrowableUint8Array=r.GrowableUint8Array;exports.BinaryHeap=t.BinaryHeap;exports.SparseMap=t.SparseMap;exports.topologicalSort=t.topologicalSort;exports.SparseSet=o;

package/dist/primitives.development.js

@@ -0,0 +1,45 @@
+import { B as h, a as o, b as l, d as p, e as _, c as d, G as b, g as u, h as w, f as G } from "./typed_arrays-BcXcnzB4.js";
+import { B as y, S as A, t as S } from "./topological_sort-DK6EjpWa.js";
+class a {
+  _dense = [];
+  _sparse = [];
+  get size() {
+    return this._dense.length;
+  }
+  get values() {
+    return this._dense;
+  }
+  has(e) {
+    return this._dense[this._sparse[e]] === e;
+  }
+  add(e) {
+    this.has(e) || (this._sparse[e] = this._dense.length, this._dense.push(e));
+  }
+  delete(e) {
+    if (!this.has(e)) return !1;
+    const s = this._sparse[e], r = this._dense[this._dense.length - 1];
+    return this._dense[s] = r, this._sparse[r] = s, this._dense.pop(), !0;
+  }
+  clear() {
+    this._dense.length = 0, this._sparse.length = 0;
+  }
+  [Symbol.iterator]() {
+    return this._dense[Symbol.iterator]();
+  }
+}
+export {
+  y as BinaryHeap,
+  h as BitSet,
+  o as GrowableFloat32Array,
+  l as GrowableFloat64Array,
+  p as GrowableInt16Array,
+  _ as GrowableInt32Array,
+  d as GrowableInt8Array,
+  b as GrowableTypedArray,
+  u as GrowableUint16Array,
+  w as GrowableUint32Array,
+  G as GrowableUint8Array,
+  A as SparseMap,
+  a as SparseSet,
+  S as topologicalSort
+};

package/dist/reactive/index.development.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("../kernel-sw7ScKWu.cjs"),t=require("../shallow-C5YmTbtb.cjs"),r=require("../interop-T1HZ-Dpa.cjs");exports.batch=e.batch;exports.computed=e.computed;exports.effect=e.effect;exports.onCleanup=e.onCleanup;exports.root=e.root;exports.signal=e.signal;exports.untrack=e.untrack;exports.reactiveArray=t.reactiveArray;exports.reactiveMap=t.reactiveMap;exports.reactiveStruct=t.reactiveStruct;exports.shallow=t.shallow;exports.subscribe=r.subscribe;exports.toExternalStore=r.toExternalStore;

package/dist/reactive/index.development.js

@@ -0,0 +1,18 @@
+import { b as r, c as e, e as t, o, r as c, s as p, u } from "../kernel-Cz2Kxlwl.js";
+import { b as f, r as i, a as l, s as n } from "../shallow-9S1pY_Iw.js";
+import { s as x, t as v } from "../interop-DqxleBo7.js";
+export {
+  r as batch,
+  e as computed,
+  t as effect,
+  o as onCleanup,
+  f as reactiveArray,
+  i as reactiveMap,
+  l as reactiveStruct,
+  c as root,
+  n as shallow,
+  p as signal,
+  x as subscribe,
+  v as toExternalStore,
+  u as untrack
+};

package/dist/shallow-9S1pY_Iw.js

@@ -0,0 +1,159 @@
+import { s as y, b as w, u as O } from "./kernel-Cz2Kxlwl.js";
+function j(p = Object.is) {
+  const i = /* @__PURE__ */ new Map(), [t, h] = y(0);
+  let l = 0;
+  const a = (s, n) => s !== void 0 && n !== void 0 ? p(s, n) : s === n;
+  return {
+    get(s) {
+      const n = i.get(s);
+      if (n !== void 0) return n[0]();
+      t();
+    },
+    set(s, n) {
+      n === void 0 && console.warn(
+        "reactiveMap.set(key, undefined): undefined is the absent sentinel — get(key) cannot distinguish it from an unset key; use delete(key) to remove."
+      );
+      const o = i.get(s);
+      o !== void 0 ? o[1](n) : (i.set(s, y(n, a)), h(++l));
+    },
+    delete(s) {
+      const n = i.get(s);
+      return n === void 0 ? !1 : (i.delete(s), w(() => {
+        n[1](void 0), h(++l);
+      }), !0);
+    },
+    has(s) {
+      return t(), i.has(s);
+    },
+    size() {
+      return t(), i.size;
+    },
+    keys() {
+      return t(), [...i.keys()];
+    }
+  };
+}
+function x(p, i = {}) {
+  const t = {}, h = {}, l = Object.keys(p), a = new Set(l);
+  for (const n of l) {
+    const [o, m] = y(
+      p[n],
+      i[n]
+    );
+    t[n] = o, h[n] = m;
+  }
+  return [new Proxy({}, {
+    // A field read subscribes; a NON-field key must not throw. `JSON.stringify`
+    // (`toJSON`), `await proxy` (`then`), `String(proxy)` (`Symbol.toPrimitive`)
+    // and `for..of` (`Symbol.iterator`) all probe keys that aren't fields — fall
+    // through to the (empty) target so they see the ordinary undefined/inherited
+    // value instead of calling `undefined()`. `fieldSet` (not `k in reads`) so
+    // inherited `toString`/`constructor` aren't mistaken for fields.
+    get: (n, o) => a.has(o) ? t[o]() : Reflect.get(n, o),
+    has: (n, o) => a.has(o),
+    // Enumerable without subscribing: enumeration calls `ownKeys` +
+    // `getOwnPropertyDescriptor`, never `get`, so `Object.keys(proxy)` returns
+    // the field set and tracks nothing. The descriptor is an ACCESSOR whose `get`
+    // reads the live signal, so `{...proxy}` / `Object.values(proxy)` /
+    // `Object.getOwnPropertyDescriptor(proxy, f).value` see the current value
+    // (a value-less descriptor would normalize to `value: undefined`). Non-field
+    // keys report no own descriptor. The target is the empty (extensible) object,
+    // so these configurable own keys satisfy the Proxy invariants.
+    ownKeys: () => l,
+    getOwnPropertyDescriptor: (n, o) => a.has(o) ? { get: () => t[o](), enumerable: !0, configurable: !0 } : void 0,
+    // Writes go through `set.field(v)` — the proxy is a READ surface, and its
+    // public type says so (`Readonly<T>`, POLISH_AUDIT #8). The trap backs the
+    // type for JS callers / policed casts: without it, a field assignment threw
+    // an opaque "Cannot redefine property" (the accessor descriptor above has no
+    // setter) and a TYPO'D field silently stuck on the hidden target as a
+    // non-reactive value.
+    set: (n, o) => {
+      throw new TypeError(
+        `reactiveStruct proxy is read-only: use set.${String(o)}(value) — the setters tuple returned alongside the proxy`
+      );
+    }
+  }), h];
+}
+const v = Symbol("reactiveArray.absent");
+function M(p = [], i = Object.is) {
+  const t = [], [h, l] = y(0);
+  let a = 0;
+  const s = (e, r) => e !== v && r !== v ? i(e, r) : e === r, n = (e) => y(e, s), o = (e) => O(t[e][0]);
+  for (const e of p) t.push(n(e));
+  function m(e) {
+    w(() => {
+      const r = t.length, f = e.length, g = f < r ? f : r;
+      for (let c = 0; c < g; c++) t[c][1](e[c]);
+      if (f > r) {
+        for (let c = r; c < f; c++) t.push(n(e[c]));
+        l(++a);
+      } else if (f < r) {
+        const c = t.splice(f);
+        for (let d = 0; d < c.length; d++) c[d][1](v);
+        l(++a);
+      }
+    });
+  }
+  return {
+    get(e) {
+      if (e >= 0 && e < t.length) {
+        const r = t[e][0]();
+        if (r !== v) return r;
+      }
+      h();
+    },
+    length() {
+      return h(), t.length;
+    },
+    snapshot() {
+      h();
+      const e = new Array(t.length);
+      for (let r = 0; r < t.length; r++) e[r] = t[r][0]();
+      return e;
+    },
+    set(e, r) {
+      e >= 0 && e < t.length ? t[e][1](r) : console.warn(
+        `reactiveArray.set(${e}): index out of range [0, ${t.length}); ignored. Use push / splice / reconcile to change length.`
+      );
+    },
+    push(e) {
+      t.push(n(e)), l(++a);
+    },
+    pop() {
+      const e = t.length;
+      if (e === 0) return;
+      const r = o(e - 1), [f] = t.splice(e - 1);
+      return w(() => {
+        f[1](v), l(++a);
+      }), r;
+    },
+    splice(e, r, ...f) {
+      const g = t.length, c = e < 0 ? Math.max(g + e, 0) : Math.min(e, g), d = r === void 0 ? g - c : Math.max(0, Math.min(r, g - c)), k = [];
+      for (let u = 0; u < d; u++) k.push(o(c + u));
+      const b = [];
+      for (let u = 0; u < c; u++) b.push(o(u));
+      for (let u = 0; u < f.length; u++) b.push(f[u]);
+      for (let u = c + d; u < g; u++) b.push(o(u));
+      return m(b), k;
+    },
+    reconcile(e) {
+      m(e);
+    }
+  };
+}
+function A(p, i) {
+  if (Object.is(p, i)) return !0;
+  const t = p, h = i, l = Object.keys(t);
+  if (l.length !== Object.keys(h).length) return !1;
+  for (let a = 0; a < l.length; a++) {
+    const s = l[a];
+    if (!Object.prototype.hasOwnProperty.call(h, s) || !Object.is(t[s], h[s])) return !1;
+  }
+  return !0;
+}
+export {
+  x as a,
+  M as b,
+  j as r,
+  A as s
+};