@oasys/oecs 0.3.1 → 0.4.0

package/dist/extensions/reactive/index.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("../../kernel-yWV3XnAb.cjs"),p=require("../../array-CxbPyiHO.cjs");function _(a,n){if(Object.is(a,n))return!0;const s=a,r=n,i=Object.keys(s);if(i.length!==Object.keys(r).length)return!1;for(let l=0;l<i.length;l++){const u=i[l];if(!Object.prototype.hasOwnProperty.call(r,u)||!Object.is(s[u],r[u]))return!1}return!0}class v{constructor(n){this.def=n}_ctx;_eid=0;get eid(){return this._eid}field(n){return this._ctx.getField(this._eid,this.def,n)}}class w{constructor(n){this.def=n}_eid=0;_row=0;cols=new Map;arch;bind(n){this.arch=n,this.cols.clear()}get eid(){return this._eid}field(n){let s=this.cols.get(n);return s===void 0&&(s=this.arch.getColumnRead(this.def,n),this.cols.set(n,s)),s[this._row]}}class E{_ctx;_eid=0;get eid(){return this._eid}field(n,s){return this._ctx.getField(this._eid,n,s)}}function m(a,n,s,r={}){const i=p.reactiveMap(r.eq),l={...r.access,reads:[n,...r.access?.reads??[]]},u=r.grain??"entity",d=r.seedExisting??!0,b=new v(n),h=(o,t)=>{t.isDisabled(o)||(b._ctx=t,b._eid=o,i.set(o,s(b)))};let g;return f.batch(()=>{if(u==="column"){const o=new w(n);g=a.observe(n,{granularity:"archetype",onSet:t=>{o.bind(t);const c=t.entityIds;for(let e=0;e<t.entityCount;e++)o._row=e,o._eid=c[e],i.set(o._eid,s(o))},onAdd:(t,c)=>h(t,c),onRemove:t=>i.delete(t),onDisable:t=>i.delete(t),onEnable:(t,c)=>h(t,c),access:l,yieldExisting:d})}else g=a.observe(n,{granularity:"entity",onSet:(o,t)=>h(o,t),onAdd:(o,t)=>h(o,t),onRemove:o=>i.delete(o),onDisable:o=>i.delete(o),onEnable:(o,t)=>h(o,t),access:l,yieldExisting:d})}),{map:i,dispose:()=>g.dispose()}}function S(a,n,s,r={}){return m(a,n,l=>{const u={};for(let d=0;d<s.length;d++)u[s[d]]=l.field(s[d]);return u},{...r,eq:_})}function R(a,n,s,r={}){const i=p.reactiveMap(r.eq),l={...r.access,reads:[...n,...r.access?.reads??[]]},u=r.seedExisting??!0,d=new E,b=(t,c)=>{for(let e=0;e<n.length;e++)if(!t.hasComponent(c,n[e]))return!1;return!0},h=(t,c)=>{c.isDisabled(t)||b(c,t)&&(d._ctx=c,d._eid=t,i.set(t,s(d)))},g=t=>{i.delete(t)};let o;return f.batch(()=>{o=n.map(t=>a.observe(t,{granularity:"entity",onSet:h,onAdd:h,onRemove:g,onDisable:g,onEnable:h,access:l,yieldExisting:u}))}),{map:i,dispose:()=>{for(let t=0;t<o.length;t++)o[t].dispose()}}}function T(a,n,s,r,i={}){const l={};for(let e=0;e<r.length;e++)l[r[e]]=0;const[u,d]=i.into??p.reactiveStruct(l),b=f.untrack(()=>r.map(e=>u[e])),h={...i.access,reads:[n,...i.access?.reads??[]]},g=i.seedExisting??!0,o=e=>{for(let y=0;y<r.length;y++)d[r[y]](e.getField(s,n,r[y]))},t=()=>{for(let e=0;e<r.length;e++)d[r[e]](b[e])};let c;return f.batch(()=>{c=a.observe(n,{granularity:"entity",onSet:(e,y)=>{e===s&&o(y)},onAdd:(e,y)=>{e===s&&!y.isDisabled(s)&&o(y)},onRemove:e=>{e===s&&t()},onDisable:e=>{e===s&&t()},onEnable:(e,y)=>{e===s&&o(y)},access:h,yieldExisting:g})}),{struct:u,dispose:()=>c.dispose()}}function x(a,n,s,r,i={}){const l=i.into??p.reactiveArray(new Array(r.length).fill(0),i.eq),u=f.untrack(()=>l.snapshot());if(i.into!==void 0&&u.length!==r.length)throw new Error(`syncSingletonToArray: into.length (${u.length}) must equal fields.length (${r.length})`);const d={...i.access,reads:[n,...i.access?.reads??[]]},b=i.seedExisting??!0,h=new Array(r.length),g=c=>{for(let e=0;e<r.length;e++)h[e]=c.getField(s,n,r[e]);l.reconcile(h)},o=()=>l.reconcile(u);let t;return f.batch(()=>{t=a.observe(n,{granularity:"entity",onSet:(c,e)=>{c===s&&g(e)},onAdd:(c,e)=>{c===s&&!e.isDisabled(s)&&g(e)},onRemove:c=>{c===s&&o()},onDisable:c=>{c===s&&o()},onEnable:(c,e)=>{c===s&&g(e)},access:d,yieldExisting:b})}),{array:l,dispose:()=>t.dispose()}}function A(a,n){f.batch(()=>a.update(n))}exports.batchedUpdate=A;exports.shallow=_;exports.syncComponentToMap=m;exports.syncFieldsToMap=S;exports.syncJoinToMap=R;exports.syncSingletonToArray=x;exports.syncSingletonToStruct=T;

package/dist/extensions/reactive/index.d.ts

@@ -0,0 +1,23 @@
+/**
+ * The production ECS→UI reactive bridge (#672 / ADR-0021).
+ *
+ * Drains the engine's own change detection (ADR-0013 component observers, riding
+ * the ADR-0012 per-row dirty list) into a `reactiveMap` — publishing O(changed),
+ * not O(all), each tick. Declarative selection + closure projection (the Bevy
+ * `ExtractComponent` / WatermelonDB `observeWithColumns` shape):
+ *   - `syncComponentToMap(def, project)` — one component, grain `"entity"`/`"column"`.
+ *   - `syncFieldsToMap(def, [fields])` — field-list sugar with auto `shallow` eq.
+ *   - `syncJoinToMap([defs], project)` — multi-component join (subscribes all defs).
+ *
+ * For singleton/ephemeral UI state (net status+latency, FPS/mem, wave timer), model
+ * it as a component on a reserved singleton entity and read it keyless via per-field
+ * channels (#687 / ADR-0024) — NOT a separate reactive-resource subsystem:
+ *   - `syncSingletonToStruct(def, eid, [fields])` — one singleton entity → `reactiveStruct`.
+ *   - `syncSingletonToArray(def, eid, [fields])` — one singleton entity → `reactiveArray` (ordered slots).
+ *
+ * The framework-agnostic counterpart to the Solid leaf: pair the map entry points
+ * with `@oasys/oecs/solid`'s `fromKernelMap`, the singleton struct with
+ * `fromKernelStruct`, and the singleton array with `fromKernelArray`, to render.
+ */
+export { syncComponentToMap, syncFieldsToMap, syncJoinToMap, syncSingletonToStruct, syncSingletonToArray, batchedUpdate, shallow, type Projection, type JoinProjection, type RowReader, type JoinReader, type SyncGrain, type EcsMapSync, type EcsMapSyncOptions, type SingletonStructSync, type SingletonSyncOptions, type SingletonArraySync, type SingletonArraySyncOptions } from './ecs_sync';
+//# sourceMappingURL=index.d.ts.map

package/dist/extensions/reactive/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/extensions/reactive/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,OAAO,EACN,kBAAkB,EAClB,eAAe,EACf,aAAa,EACb,qBAAqB,EACrB,oBAAoB,EACpB,aAAa,EACb,OAAO,EACP,KAAK,UAAU,EACf,KAAK,cAAc,EACnB,KAAK,SAAS,EACd,KAAK,UAAU,EACf,KAAK,SAAS,EACd,KAAK,UAAU,EACf,KAAK,iBAAiB,EACtB,KAAK,mBAAmB,EACxB,KAAK,oBAAoB,EACzB,KAAK,kBAAkB,EACvB,KAAK,yBAAyB,EAC9B,MAAM,YAAY,CAAC"}

package/dist/extensions/reactive/index.js

@@ -0,0 +1,225 @@
+import { b as f, u as _ } from "../../kernel-DgyrLFjW.js";
+import { r as p, a as m, b as E } from "../../array-uFR7Q8fU.js";
+function w(a, n) {
+  if (Object.is(a, n)) return !0;
+  const s = a, r = n, o = Object.keys(s);
+  if (o.length !== Object.keys(r).length) return !1;
+  for (let l = 0; l < o.length; l++) {
+    const u = o[l];
+    if (!Object.prototype.hasOwnProperty.call(r, u) || !Object.is(s[u], r[u])) return !1;
+  }
+  return !0;
+}
+class v {
+  constructor(n) {
+    this.def = n;
+  }
+  _ctx;
+  _eid = 0;
+  get eid() {
+    return this._eid;
+  }
+  field(n) {
+    return this._ctx.getField(this._eid, this.def, n);
+  }
+}
+class R {
+  constructor(n) {
+    this.def = n;
+  }
+  _eid = 0;
+  _row = 0;
+  cols = /* @__PURE__ */ new Map();
+  arch;
+  /** Bind to an archetype for one dispatch (drops the previous column cache). */
+  bind(n) {
+    this.arch = n, this.cols.clear();
+  }
+  get eid() {
+    return this._eid;
+  }
+  field(n) {
+    let s = this.cols.get(n);
+    return s === void 0 && (s = this.arch.getColumnRead(this.def, n), this.cols.set(n, s)), s[this._row];
+  }
+}
+class x {
+  _ctx;
+  _eid = 0;
+  get eid() {
+    return this._eid;
+  }
+  field(n, s) {
+    return this._ctx.getField(this._eid, n, s);
+  }
+}
+function A(a, n, s, r = {}) {
+  const o = p(r.eq), l = {
+    ...r.access,
+    reads: [n, ...r.access?.reads ?? []]
+  }, u = r.grain ?? "entity", d = r.seedExisting ?? !0, b = new v(n), h = (i, t) => {
+    t.isDisabled(i) || (b._ctx = t, b._eid = i, o.set(i, s(b)));
+  };
+  let g;
+  return f(() => {
+    if (u === "column") {
+      const i = new R(n);
+      g = a.observe(n, {
+        granularity: "archetype",
+        onSet: (t) => {
+          i.bind(t);
+          const c = t.entityIds;
+          for (let e = 0; e < t.entityCount; e++)
+            i._row = e, i._eid = c[e], o.set(i._eid, s(i));
+        },
+        onAdd: (t, c) => h(t, c),
+        onRemove: (t) => o.delete(t),
+        // Disable = soft remove from the channel; enable = re-add (#677). The
+        // column sweep is bounded by enabled rows, so a disabled row would never
+        // refresh — drop it on disable, republish on enable.
+        onDisable: (t) => o.delete(t),
+        onEnable: (t, c) => h(t, c),
+        access: l,
+        yieldExisting: d
+      });
+    } else
+      g = a.observe(n, {
+        granularity: "entity",
+        onSet: (i, t) => h(i, t),
+        onAdd: (i, t) => h(i, t),
+        onRemove: (i) => o.delete(i),
+        onDisable: (i) => o.delete(i),
+        onEnable: (i, t) => h(i, t),
+        access: l,
+        yieldExisting: d
+      });
+  }), { map: o, dispose: () => g.dispose() };
+}
+function j(a, n, s, r = {}) {
+  return A(a, n, (l) => {
+    const u = {};
+    for (let d = 0; d < s.length; d++) u[s[d]] = l.field(s[d]);
+    return u;
+  }, { ...r, eq: w });
+}
+function M(a, n, s, r = {}) {
+  const o = p(r.eq), l = {
+    ...r.access,
+    reads: [...n, ...r.access?.reads ?? []]
+  }, u = r.seedExisting ?? !0, d = new x(), b = (t, c) => {
+    for (let e = 0; e < n.length; e++) if (!t.hasComponent(c, n[e])) return !1;
+    return !0;
+  }, h = (t, c) => {
+    c.isDisabled(t) || b(c, t) && (d._ctx = c, d._eid = t, o.set(t, s(d)));
+  }, g = (t) => {
+    o.delete(t);
+  };
+  let i;
+  return f(() => {
+    i = n.map(
+      (t) => a.observe(t, {
+        granularity: "entity",
+        onSet: h,
+        onAdd: h,
+        onRemove: g,
+        // Disabling any joined component soft-removes the entity from the
+        // channel; enabling re-evaluates membership and republishes (#677). A
+        // disable fires once per carried joined component — `dropRow` is
+        // idempotent, and `publishIfMember` re-checks the full join.
+        onDisable: g,
+        onEnable: h,
+        access: l,
+        yieldExisting: u
+      })
+    );
+  }), {
+    map: o,
+    dispose: () => {
+      for (let t = 0; t < i.length; t++) i[t].dispose();
+    }
+  };
+}
+function O(a, n, s, r, o = {}) {
+  const l = {};
+  for (let e = 0; e < r.length; e++) l[r[e]] = 0;
+  const [u, d] = o.into ?? m(l), b = _(() => r.map((e) => u[e])), h = {
+    ...o.access,
+    reads: [n, ...o.access?.reads ?? []]
+  }, g = o.seedExisting ?? !0, i = (e) => {
+    for (let y = 0; y < r.length; y++) d[r[y]](e.getField(s, n, r[y]));
+  }, t = () => {
+    for (let e = 0; e < r.length; e++) d[r[e]](b[e]);
+  };
+  let c;
+  return f(() => {
+    c = a.observe(n, {
+      granularity: "entity",
+      onSet: (e, y) => {
+        e === s && i(y);
+      },
+      onAdd: (e, y) => {
+        e === s && !y.isDisabled(s) && i(y);
+      },
+      onRemove: (e) => {
+        e === s && t();
+      },
+      onDisable: (e) => {
+        e === s && t();
+      },
+      onEnable: (e, y) => {
+        e === s && i(y);
+      },
+      access: h,
+      yieldExisting: g
+    });
+  }), { struct: u, dispose: () => c.dispose() };
+}
+function T(a, n, s, r, o = {}) {
+  const l = o.into ?? E(new Array(r.length).fill(0), o.eq), u = _(() => l.snapshot());
+  if (o.into !== void 0 && u.length !== r.length)
+    throw new Error(
+      `syncSingletonToArray: into.length (${u.length}) must equal fields.length (${r.length})`
+    );
+  const d = {
+    ...o.access,
+    reads: [n, ...o.access?.reads ?? []]
+  }, b = o.seedExisting ?? !0, h = new Array(r.length), g = (c) => {
+    for (let e = 0; e < r.length; e++) h[e] = c.getField(s, n, r[e]);
+    l.reconcile(h);
+  }, i = () => l.reconcile(u);
+  let t;
+  return f(() => {
+    t = a.observe(n, {
+      granularity: "entity",
+      onSet: (c, e) => {
+        c === s && g(e);
+      },
+      onAdd: (c, e) => {
+        c === s && !e.isDisabled(s) && g(e);
+      },
+      onRemove: (c) => {
+        c === s && i();
+      },
+      onDisable: (c) => {
+        c === s && i();
+      },
+      onEnable: (c, e) => {
+        c === s && g(e);
+      },
+      access: d,
+      yieldExisting: b
+    });
+  }), { array: l, dispose: () => t.dispose() };
+}
+function k(a, n) {
+  f(() => a.update(n));
+}
+export {
+  k as batchedUpdate,
+  w as shallow,
+  A as syncComponentToMap,
+  j as syncFieldsToMap,
+  M as syncJoinToMap,
+  T as syncSingletonToArray,
+  O as syncSingletonToStruct
+};

package/dist/extensions/solid/index.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("solid-js"),c=require("../../interop-CT-REx0W.cjs");function l(e){const[t,o]=u.createSignal(e());return u.onCleanup(c.subscribe(e,s=>o(()=>s))),t}function f(e){return{keys:l(()=>e.keys()),cell:t=>l(()=>e.get(t))}}function i(e){const t={},o=Object.keys(e),s=new Set(o);for(const n of o)t[n]=l(()=>e[n]);return new Proxy({},{get:(n,r)=>s.has(r)?t[r]():Reflect.get(n,r),has:(n,r)=>s.has(r),ownKeys:()=>o,getOwnPropertyDescriptor:(n,r)=>s.has(r)?{get:()=>t[r](),enumerable:!0,configurable:!0}:void 0})}function a(e){return l(()=>e.snapshot())}exports.fromKernel=l;exports.fromKernelArray=a;exports.fromKernelMap=f;exports.fromKernelStruct=i;

package/dist/extensions/solid/index.d.ts

@@ -0,0 +1,6 @@
+/**
+ * `@oasys/oecs/solid` — the SolidJS adapter plugin for oecs's reactive
+ * kernel (`@oasys/oecs/reactive` / `../../core/reactive`, #646 / ADR-0021).
+ */
+export { fromKernel, fromKernelMap, fromKernelStruct, fromKernelArray, type KernelMapView } from './kernel_solid';
+//# sourceMappingURL=index.d.ts.map

package/dist/extensions/solid/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/extensions/solid/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EACN,UAAU,EACV,aAAa,EACb,gBAAgB,EAChB,eAAe,EACf,KAAK,aAAa,EAClB,MAAM,gBAAgB,CAAC"}

package/dist/extensions/solid/index.js

@@ -0,0 +1,32 @@
+import { createSignal as c, onCleanup as u } from "solid-js";
+import { s as a } from "../../interop-CcY6ASQc.js";
+function f(e) {
+  const [t, o] = c(e());
+  return u(a(e, (s) => o(() => s))), t;
+}
+function g(e) {
+  return {
+    keys: f(() => e.keys()),
+    cell: (t) => f(() => e.get(t))
+  };
+}
+function m(e) {
+  const t = {}, o = Object.keys(e), s = new Set(o);
+  for (const n of o)
+    t[n] = f(() => e[n]);
+  return new Proxy({}, {
+    get: (n, r) => s.has(r) ? t[r]() : Reflect.get(n, r),
+    has: (n, r) => s.has(r),
+    ownKeys: () => o,
+    getOwnPropertyDescriptor: (n, r) => s.has(r) ? { get: () => t[r](), enumerable: !0, configurable: !0 } : void 0
+  });
+}
+function y(e) {
+  return f(() => e.snapshot());
+}
+export {
+  f as fromKernel,
+  y as fromKernelArray,
+  g as fromKernelMap,
+  m as fromKernelStruct
+};

package/dist/extensions/solid/kernel_solid.d.ts

@@ -0,0 +1,42 @@
+import { Accessor } from 'solid-js';
+import { ReactiveArray, ReactiveMap } from '../../core/reactive';
+/**
+ * Mirror a kernel accessor into a Solid accessor. The returned accessor tracks in
+ * Solid; it updates once per coalesced kernel change and never on an equal write.
+ */
+export declare function fromKernel<T>(accessor: () => T): Accessor<T>;
+/** A kernel `reactiveMap` projected for a keyed Solid `<For>`. */
+export interface KernelMapView<K, V> {
+    /** The live key set — pass to a keyed Solid `<For each>`. Keyed on the id. */
+    readonly keys: Accessor<readonly K[]>;
+    /** A bridged value accessor for one key — read inside the `<For>` row. */
+    cell(key: K): Accessor<V | undefined>;
+}
+/**
+ * Bridge a kernel `reactiveMap` for keyed Solid rendering. `keys` drives a `<For>`
+ * (one row per entity, keyed on the stable id); `cell(id)` is that row's bridged
+ * value. Changing one entity wakes only its row; spawn/despawn add/remove one row.
+ */
+export declare function fromKernelMap<K, V>(map: ReactiveMap<K, V>): KernelMapView<K, V>;
+/**
+ * Bridge a kernel `reactiveStruct` proxy into a Solid-reactive proxy: reading
+ * `view.field` in a Solid scope tracks that field alone (one `fromKernel` per
+ * field), so a change to one field re-renders only its readers. Completes the
+ * `fromKernel` / `fromKernelMap` / `fromKernelStruct` trio — the read side for the
+ * singleton/ephemeral UI state `syncSingletonToStruct` publishes (ADR-0024). The
+ * field set is read once from the (enumerable) struct proxy; call inside a component
+ * or `root` so each field's `onCleanup` has an owner. The kernel struct's per-field
+ * `eq` and batching carry through `fromKernel` unchanged.
+ */
+export declare function fromKernelStruct<T extends object>(struct: T): T;
+/**
+ * Bridge a kernel `reactiveArray` into a Solid accessor of its snapshot, for a
+ * positional Solid `<Index each={view()}>`. `<Index>` (NOT `<For>`) is the match for
+ * an ordered slot list: it keys by position and hands each slot an accessor, so
+ * duplicate primitive values (e.g. empty army slots) don't alias and a slot change
+ * updates only that row. The snapshot is the array's coarse read (any slot change
+ * wakes it), but `<Index>` then diffs by position and touches only the changed
+ * index's DOM. Use `fromKernelMap` instead for an *entity* collection (keyed, `<For>`).
+ */
+export declare function fromKernelArray<T>(arr: ReactiveArray<T>): Accessor<readonly T[]>;
+//# sourceMappingURL=kernel_solid.d.ts.map

package/dist/extensions/solid/kernel_solid.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"kernel_solid.d.ts","sourceRoot":"","sources":["../../../src/extensions/solid/kernel_solid.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,OAAO,EAA2B,KAAK,QAAQ,EAAE,MAAM,UAAU,CAAC;AAClE,OAAO,EAAa,KAAK,aAAa,EAAE,KAAK,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAEtF;;;GAGG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAI5D;AAED,kEAAkE;AAClE,MAAM,WAAW,aAAa,CAAC,CAAC,EAAE,CAAC;IAClC,8EAA8E;IAC9E,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACtC,0EAA0E;IAC1E,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;CACtC;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAK/E;AAED;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAoB/D;AAED;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,CAEhF"}