@oasys/oecs 0.3.0 → 0.4.0

package/dist/interop-CT-REx0W.cjs

@@ -0,0 +1 @@
+"use strict";const n=require("./kernel-yWV3XnAb.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/interop-CcY6ASQc.js

@@ -0,0 +1,18 @@
+import { e as n, u } from "./kernel-DgyrLFjW.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/kernel-DgyrLFjW.js

@@ -0,0 +1,227 @@
+let l = null, v = 0, c = !1, I = 0;
+const a = [];
+let h, r = null;
+function f(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) {
+  r !== null && (r.owned ??= []).push(s);
+}
+function D(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 = O(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 O(s, e, i, t) {
+  const n = h;
+  return n !== void 0 ? (h = 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 = h, h = s, n;
+}
+function T(s) {
+  s.depsTail = void 0;
+}
+function g(s) {
+  const e = s.depsTail;
+  let i = e !== void 0 ? e.nextDep : s.deps;
+  for (; i !== void 0; ) i = p(i);
+}
+function S(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 b(s) {
+  for (let e = s.subs; e !== void 0; e = e.nextSub)
+    e.target.notify();
+}
+class w {
+  value;
+  eq;
+  version = 0;
+  subs = void 0;
+  subsTail = void 0;
+  constructor(e, i) {
+    this.value = e, this.eq = i;
+  }
+  refresh() {
+  }
+  get() {
+    return l !== null && D(this, l), this.value;
+  }
+  set(e) {
+    this.eq(this.value, e) || (this.value = e, this.version++, this.subs !== void 0 && (b(this), v === 0 && E()));
+  }
+}
+class N {
+  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 && !S(this))) return;
+    this.flags |= 1, f(this), T(this);
+    const e = l, i = r;
+    l = this, r = this;
+    try {
+      const t = this.fn();
+      (this.version === 0 || !this.eq(this.value, t)) && (this.value = t, this.version++);
+    } finally {
+      l = e, r = i, g(this), this.flags &= -2;
+    }
+  }
+  get() {
+    return this.flags & 1 ? this.value : (this.refresh(), l !== null && D(this, l), this.value);
+  }
+  notify() {
+    this.flags & 2 || (this.flags |= 6, b(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 y {
+  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, a.push(this));
+  }
+  run() {
+    if (this.flags & 8) return;
+    f(this), T(this);
+    const e = l, i = r;
+    l = this, r = this;
+    try {
+      this.fn();
+    } finally {
+      l = e, r = i, g(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 E() {
+  if (c) return;
+  c = !0;
+  const s = ++I;
+  let e = 0, i, t = !1;
+  try {
+    for (let n = 0; n < a.length; n++) {
+      const o = a[n];
+      if (o.flags &= -19, !(o.flags & 8) && S(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 {
+    a.length = 0, c = !1;
+  }
+  if (t) throw i;
+}
+function x(s, e = Object.is) {
+  const i = new w(s, e);
+  return [() => i.get(), (t) => i.set(t)];
+}
+function A(s, e = Object.is) {
+  const i = new N(s, e);
+  return d(i), () => i.get();
+}
+function U(s) {
+  const e = new y(s);
+  return d(e), e.run(), () => e.dispose();
+}
+function F(s) {
+  v++;
+  try {
+    s();
+  } finally {
+    --v === 0 && E();
+  }
+}
+function k(s) {
+  const e = l;
+  l = null;
+  try {
+    return s();
+  } finally {
+    l = e;
+  }
+}
+function P(s) {
+  const e = { cleanups: null, owned: null }, i = r;
+  r = e;
+  try {
+    return s(() => f(e));
+  } finally {
+    r = i;
+  }
+}
+function C(s) {
+  r !== null && (r.cleanups ??= []).push(s);
+}
+export {
+  F as b,
+  A as c,
+  U as e,
+  C as o,
+  P as r,
+  x as s,
+  k as u
+};

package/dist/kernel-yWV3XnAb.cjs

@@ -0,0 +1 @@
+"use strict";let l=null,v=0,c=!1,I=0;const a=[];let h,r=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){r!==null&&(r.owned??=[]).push(s)}function D(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=O(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 O(s,e,t,i){const n=h;return n!==void 0?(h=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=h,h=s,n}function T(s){s.depsTail=void 0}function g(s){const e=s.depsTail;let t=e!==void 0?e.nextDep:s.deps;for(;t!==void 0;)t=p(t)}function S(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 b(s){for(let e=s.subs;e!==void 0;e=e.nextSub)e.target.notify()}class w{value;eq;version=0;subs=void 0;subsTail=void 0;constructor(e,t){this.value=e,this.eq=t}refresh(){}get(){return l!==null&&D(this,l),this.value}set(e){this.eq(this.value,e)||(this.value=e,this.version++,this.subs!==void 0&&(b(this),v===0&&E()))}}class N{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&&!S(this)))return;this.flags|=1,f(this),T(this);const e=l,t=r;l=this,r=this;try{const i=this.fn();(this.version===0||!this.eq(this.value,i))&&(this.value=i,this.version++)}finally{l=e,r=t,g(this),this.flags&=-2}}get(){return this.flags&1?this.value:(this.refresh(),l!==null&&D(this,l),this.value)}notify(){this.flags&2||(this.flags|=6,b(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 y{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=l,t=r;l=this,r=this;try{this.fn()}finally{l=e,r=t,g(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 E(){if(c)return;c=!0;const s=++I;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)&&S(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,c=!1}if(i)throw t}function x(s,e=Object.is){const t=new w(s,e);return[()=>t.get(),i=>t.set(i)]}function A(s,e=Object.is){const t=new N(s,e);return d(t),()=>t.get()}function U(s){const e=new y(s);return d(e),e.run(),()=>e.dispose()}function k(s){v++;try{s()}finally{--v===0&&E()}}function F(s){const e=l;l=null;try{return s()}finally{l=e}}function C(s){const e={cleanups:null,owned:null},t=r;r=e;try{return s(()=>f(e))}finally{r=t}}function P(s){r!==null&&(r.cleanups??=[]).push(s)}exports.batch=k;exports.computed=A;exports.effect=U;exports.onCleanup=P;exports.root=C;exports.signal=x;exports.untrack=F;

package/dist/log/console_sink.d.ts

@@ -0,0 +1,4 @@
+import { LogSink } from './logger';
+/** A LogSink that writes each entry to stdout — for headless hosts (e.g. the server). */
+export declare const consoleSink: LogSink;
+//# sourceMappingURL=console_sink.d.ts.map

package/dist/log/console_sink.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"console_sink.d.ts","sourceRoot":"","sources":["../../src/log/console_sink.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAY,OAAO,EAAE,MAAM,UAAU,CAAC;AAElD,yFAAyF;AACzF,eAAO,MAAM,WAAW,EAAE,OAEzB,CAAC"}

package/dist/log/index.d.ts

@@ -0,0 +1,3 @@
+export { logger, LOG_CATEGORY, type LogEntry, type LogSink } from './logger';
+export { consoleSink } from './console_sink';
+//# sourceMappingURL=index.d.ts.map

package/dist/log/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/log/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,QAAQ,EAAE,KAAK,OAAO,EAAE,MAAM,UAAU,CAAC;AAC7E,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC"}

package/dist/log/logger.d.ts

@@ -0,0 +1,27 @@
+export declare enum LOG_CATEGORY {
+    ECS = "ECS"
+}
+export interface LogEntry {
+    readonly timestamp: number;
+    readonly wallTime: number;
+    readonly category: LOG_CATEGORY;
+    readonly message: string;
+}
+/** Notified with each new entry as it is logged. */
+export type LogSink = (entry: LogEntry) => void;
+declare class Logger {
+    private _entries;
+    private _capacity;
+    private readonly _sinks;
+    constructor(capacity?: number);
+    get capacity(): number;
+    setCapacity(value: number): void;
+    get entries(): readonly LogEntry[];
+    log(category: LOG_CATEGORY, message: string): void;
+    clear(): void;
+    /** Register a sink notified on every subsequent `log()`. Returns an unsubscribe fn. */
+    subscribe(sink: LogSink): () => void;
+}
+export declare const logger: Logger;
+export {};
+//# sourceMappingURL=logger.d.ts.map

package/dist/log/logger.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logger.d.ts","sourceRoot":"","sources":["../../src/log/logger.ts"],"names":[],"mappings":"AAQA,oBAAY,YAAY;IACvB,GAAG,QAAQ;CACX;AAED,MAAM,WAAW,QAAQ;IACxB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,YAAY,CAAC;IAChC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CACzB;AAED,oDAAoD;AACpD,MAAM,MAAM,OAAO,GAAG,CAAC,KAAK,EAAE,QAAQ,KAAK,IAAI,CAAC;AAIhD,cAAM,MAAM;IACX,OAAO,CAAC,QAAQ,CAAkB;IAClC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAA2B;gBAE/B,QAAQ,GAAE,MAAqB;IAIlD,IAAW,QAAQ,IAAI,MAAM,CAE5B;IAEM,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAOvC,IAAW,OAAO,IAAI,SAAS,QAAQ,EAAE,CAExC;IAEM,GAAG,CAAC,QAAQ,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI;IAkBlD,KAAK,IAAI,IAAI;IAIpB,uFAAuF;IAChF,SAAS,CAAC,IAAI,EAAE,OAAO,GAAG,MAAM,IAAI;CAM3C;AAID,eAAO,MAAM,MAAM,QAAe,CAAC"}

package/dist/primitives.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./topological_sort-WAT-VHb-.cjs");class s{_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 t=this._sparse[e],a=this._dense[this._dense.length-1];return this._dense[t]=a,this._sparse[a]=t,this._dense.pop(),!0}clear(){this._dense.length=0,this._sparse.length=0}[Symbol.iterator](){return this._dense[Symbol.iterator]()}}exports.BinaryHeap=r.BinaryHeap;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.SparseMap=r.SparseMap;exports.topologicalSort=r.topologicalSort;exports.SparseSet=s;

package/dist/primitives.d.ts

@@ -0,0 +1,18 @@
+/**
+ * `@oasys/oecs/primitives` — the general-purpose data-structure primitives the
+ * ECS is built on, surfaced for direct consumer use: a bit set, sparse set/map,
+ * growable typed arrays, a binary heap, and a topological sort.
+ *
+ * These are the low-level building blocks only; the ECS itself is the default
+ * `@oasys/oecs` entry. The internal assertion, brand, and error helpers under
+ * `src/type_primitives/` are intentionally NOT re-exported here.
+ *
+ * @module
+ */
+export { BitSet } from './type_primitives/bitset/bitset';
+export { SparseSet } from './type_primitives/sparse_set/sparse_set';
+export { SparseMap } from './type_primitives/sparse_map/sparse_map';
+export { GrowableTypedArray, GrowableFloat32Array, GrowableFloat64Array, GrowableInt8Array, GrowableInt16Array, GrowableInt32Array, GrowableUint8Array, GrowableUint16Array, GrowableUint32Array, type TypedArrayTag, type AnyTypedArray } from './type_primitives/typed_arrays/typed_arrays';
+export { BinaryHeap, type CompareFn } from './type_primitives/binary_heap/binary_heap';
+export { topologicalSort } from './type_primitives/topological_sort/topological_sort';
+//# sourceMappingURL=primitives.d.ts.map

package/dist/primitives.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"primitives.d.ts","sourceRoot":"","sources":["../src/primitives.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAE,MAAM,EAAE,MAAM,iCAAiC,CAAC;AACzD,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AACpE,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AACpE,OAAO,EACN,kBAAkB,EAClB,oBAAoB,EACpB,oBAAoB,EACpB,iBAAiB,EACjB,kBAAkB,EAClB,kBAAkB,EAClB,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EACnB,KAAK,aAAa,EAClB,KAAK,aAAa,EAClB,MAAM,6CAA6C,CAAC;AACrD,OAAO,EAAE,UAAU,EAAE,KAAK,SAAS,EAAE,MAAM,2CAA2C,CAAC;AACvF,OAAO,EAAE,eAAe,EAAE,MAAM,qDAAqD,CAAC"}

package/dist/primitives.js

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

package/dist/shared-BXSZnxx4.cjs

@@ -0,0 +1 @@
+"use strict";class n extends Error{constructor(a,t,r,o){super(a,o),this.requestedBytes=t,this.capBytes=r,this.name="StoreCapExceededError"}}class l 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: { heap: {} }`), which is backed by a plain ArrayBuffer and needs no SAB / no COOP+COEP. In Bun/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 h=e=>{if(typeof SharedArrayBuffer>"u")throw new l;return new SharedArrayBuffer(e)},f=64*1024;function d(e=256*1024*1024){if(e<=0||!Number.isInteger(e))throw new Error(`growable_sab_allocator: max_bytes must be a positive integer (got ${e})`);if(typeof SharedArrayBuffer>"u")throw new l;let a=null;const t=r=>{if(r>e)throw new n(`growable_sab_allocator: requested ${r} bytes exceeds the by-design max_bytes cap of ${e}. This is a hard ceiling with no grow-beyond-cap fallback (#380); a real workload stays ~16 MiB. Reaching it signals runaway entity/column growth upstream — diagnose that rather than raising the cap blindly.`,r,e);if(a===null){const o=SharedArrayBuffer;return a=new o(r,{maxByteLength:e}),a}return r>a.byteLength&&a.grow(r),a};return Object.defineProperty(t,"isInPlace",{value:!0,enumerable:!0}),t}function b(e=256*1024*1024){if(e<=0||!Number.isInteger(e))throw new Error(`heap_arraybuffer_allocator: max_bytes must be a positive integer (got ${e})`);let a=null;const t=r=>{if(r>e)throw new n(`heap_arraybuffer_allocator: requested ${r} bytes exceeds the by-design max_bytes cap of ${e}. This is a hard ceiling with no grow-beyond-cap fallback (#380); reaching it signals runaway entity/column growth upstream — diagnose that rather than raising the cap.`,r,e);if(a===null){const o=ArrayBuffer;return a=new o(r,{maxByteLength:e}),a}return r>a.byteLength&&a.resize(r),a};return Object.defineProperty(t,"isInPlace",{value:!0,enumerable:!0}),t}function w(e){if(!(e.buffer instanceof SharedArrayBuffer))throw new Error("wasm_memory_allocator: WebAssembly.Memory must be constructed with `shared: true` so its buffer is a SharedArrayBuffer");const a=()=>e.buffer,t=r=>{const o=e.buffer.byteLength;if(r<=o)return a();const s=Math.ceil((r-o)/f),u=i=>new n(`wasm_memory_allocator: memory.grow(${s}) failed (current=${o} bytes, requested=${r} bytes, maximum may be reached)`,r,null,{cause:i});let c;try{c=e.grow(s)}catch(i){throw u(i)}if(c===-1)throw u();return a()};return Object.defineProperty(t,"isInPlace",{value:!0,enumerable:!0}),t}exports.DEFAULT_SAB_ALLOCATOR=h;exports.SabUnavailableError=l;exports.StoreCapExceededError=n;exports.growableSabAllocator=d;exports.heapArraybufferAllocator=b;exports.wasmMemoryAllocator=w;

package/dist/shared-C678TAPY.js

@@ -0,0 +1,99 @@
+class i extends Error {
+  constructor(a, t, r, n) {
+    super(a, n), this.requestedBytes = t, this.capBytes = r, this.name = "StoreCapExceededError";
+  }
+}
+class c 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: { heap: {} }`), which is backed by a plain ArrayBuffer and needs no SAB / no COOP+COEP. In Bun/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 f = (e) => {
+  if (typeof SharedArrayBuffer > "u") throw new c();
+  return new SharedArrayBuffer(e);
+}, h = 64 * 1024;
+function d(e = 256 * 1024 * 1024) {
+  if (e <= 0 || !Number.isInteger(e))
+    throw new Error(
+      `growable_sab_allocator: max_bytes must be a positive integer (got ${e})`
+    );
+  if (typeof SharedArrayBuffer > "u") throw new c();
+  let a = null;
+  const t = (r) => {
+    if (r > e)
+      throw new i(
+        `growable_sab_allocator: requested ${r} bytes exceeds the by-design max_bytes cap of ${e}. This is a hard ceiling with no grow-beyond-cap fallback (#380); a real workload stays ~16 MiB. Reaching it signals runaway entity/column growth upstream — diagnose that rather than raising the cap blindly.`,
+        r,
+        e
+      );
+    if (a === null) {
+      const n = SharedArrayBuffer;
+      return a = new n(r, { maxByteLength: e }), a;
+    }
+    return r > a.byteLength && a.grow(r), a;
+  };
+  return Object.defineProperty(t, "isInPlace", { value: !0, enumerable: !0 }), t;
+}
+function b(e = 256 * 1024 * 1024) {
+  if (e <= 0 || !Number.isInteger(e))
+    throw new Error(
+      `heap_arraybuffer_allocator: max_bytes must be a positive integer (got ${e})`
+    );
+  let a = null;
+  const t = (r) => {
+    if (r > e)
+      throw new i(
+        `heap_arraybuffer_allocator: requested ${r} bytes exceeds the by-design max_bytes cap of ${e}. This is a hard ceiling with no grow-beyond-cap fallback (#380); reaching it signals runaway entity/column growth upstream — diagnose that rather than raising the cap.`,
+        r,
+        e
+      );
+    if (a === null) {
+      const n = ArrayBuffer;
+      return a = new n(r, { maxByteLength: e }), a;
+    }
+    return r > a.byteLength && a.resize(r), a;
+  };
+  return Object.defineProperty(t, "isInPlace", { value: !0, enumerable: !0 }), t;
+}
+function w(e) {
+  if (!(e.buffer instanceof SharedArrayBuffer))
+    throw new Error(
+      "wasm_memory_allocator: WebAssembly.Memory must be constructed with `shared: true` so its buffer is a SharedArrayBuffer"
+    );
+  const a = () => e.buffer, t = (r) => {
+    const n = e.buffer.byteLength;
+    if (r <= n)
+      return a();
+    const s = Math.ceil((r - n) / h), l = (o) => (
+      // The JS API doesn't expose the Memory's `maximum`, so the cap is
+      // reported as unknowable (`null`) — the caller declared it at
+      // `new WebAssembly.Memory({ maximum })` time.
+      new i(
+        `wasm_memory_allocator: memory.grow(${s}) failed (current=${n} bytes, requested=${r} bytes, maximum may be reached)`,
+        r,
+        null,
+        { cause: o }
+      )
+    );
+    let u;
+    try {
+      u = e.grow(s);
+    } catch (o) {
+      throw l(o);
+    }
+    if (u === -1)
+      throw l();
+    return a();
+  };
+  return Object.defineProperty(t, "isInPlace", { value: !0, enumerable: !0 }), t;
+}
+export {
+  f as D,
+  i as S,
+  c as a,
+  d as g,
+  b as h,
+  w
+};

package/dist/shared.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./shared-BXSZnxx4.cjs");exports.DEFAULT_SAB_ALLOCATOR=a.DEFAULT_SAB_ALLOCATOR;exports.SabUnavailableError=a.SabUnavailableError;exports.growableSabAllocator=a.growableSabAllocator;exports.wasmMemoryAllocator=a.wasmMemoryAllocator;

package/dist/shared.d.ts

@@ -0,0 +1,22 @@
+/**
+ * `@oasys/oecs/shared` — the opt-in SharedArrayBuffer / WASM profile.
+ *
+ * The default `@oasys/oecs` profile runs the column store over a plain
+ * resizable `ArrayBuffer` (no cross-origin isolation). This entry surfaces the
+ * `SharedArrayBuffer`-backed allocators for worlds that opt into worker offload
+ * or a WASM compute backend — construct with `new ECS({ memory: { shared: {} } })`,
+ * or pass one of these allocators through `memory: { allocator }`.
+ *
+ * **Requires cross-origin isolation (COOP/COEP) in browsers** — that's the
+ * whole reason it's a separate, opt-in profile.
+ *
+ * The WASM compute backend itself is NOT bundled here: oecs ships the
+ * `ComputeBackend` *seam* (`@oasys/oecs` → `attachBackend`) plus the
+ * cross-thread ring transport (`HostCommandDispatcher`). The worker entrypoint
+ * and the compiled WASM module are the consumer's to provide.
+ *
+ * @module
+ */
+export { growableSabAllocator, wasmMemoryAllocator, DEFAULT_SAB_ALLOCATOR, SabUnavailableError } from './core/store';
+export type { SharedMemoryArm } from './core/ecs/ecs_memory';
+//# sourceMappingURL=shared.d.ts.map

package/dist/shared.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shared.d.ts","sourceRoot":"","sources":["../src/shared.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,OAAO,EACN,oBAAoB,EACpB,mBAAmB,EACnB,qBAAqB,EACrB,mBAAmB,EACnB,MAAM,cAAc,CAAC;AACtB,YAAY,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC"}

package/dist/shared.js

@@ -0,0 +1,7 @@
+import { D as r, a as l, g as A, w as s } from "./shared-C678TAPY.js";
+export {
+  r as DEFAULT_SAB_ALLOCATOR,
+  l as SabUnavailableError,
+  A as growableSabAllocator,
+  s as wasmMemoryAllocator
+};