@oasys/oecs 0.5.3 → 0.6.0

package/dist/extensions/reactive/index.development.js

@@ -1,215 +0,0 @@
-import { b as f, u as _ } from "../../kernel-Cz2Kxlwl.js";
-import { r as m, s as E, a as p, b as w } from "../../shallow-9S1pY_Iw.js";
-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(l, n, s, r = {}) {
-  const c = m(r.eq), a = {
-    ...r.access,
-    reads: [n, ...r.access?.reads ?? []]
-  }, h = r.grain ?? "entity", u = r.seedExisting ?? !0, b = new v(n), y = (o, i) => {
-    i.isDisabled(o) || (b._ctx = i, b._eid = o, c.set(o, s(b)));
-  };
-  let g;
-  return f(() => {
-    if (h === "column") {
-      const o = new R(n);
-      g = l.observe(n, {
-        granularity: "archetype",
-        onSet: (i) => {
-          o.bind(i);
-          const t = i.entityIds;
-          for (let e = 0; e < i.entityCount; e++)
-            o._row = e, o._eid = t[e], c.set(o._eid, s(o));
-        },
-        onAdd: (i, t) => y(i, t),
-        onRemove: (i) => c.delete(i),
-        // 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: (i) => c.delete(i),
-        onEnable: (i, t) => y(i, t),
-        access: a,
-        yieldExisting: u
-      });
-    } else
-      g = l.observe(n, {
-        granularity: "entity",
-        onSet: (o, i) => y(o, i),
-        onAdd: (o, i) => y(o, i),
-        onRemove: (o) => c.delete(o),
-        onDisable: (o) => c.delete(o),
-        onEnable: (o, i) => y(o, i),
-        access: a,
-        yieldExisting: u
-      });
-  }), { map: c, dispose: () => g.dispose() };
-}
-function q(l, n, s, r = {}) {
-  return A(l, n, (a) => {
-    const h = {};
-    for (let u = 0; u < s.length; u++) h[s[u]] = a.field(s[u]);
-    return h;
-  }, { ...r, eq: E });
-}
-function M(l, n, s, r = {}) {
-  const c = n, a = m(r.eq), h = {
-    ...r.access,
-    reads: [...c, ...r.access?.reads ?? []]
-  }, u = r.seedExisting ?? !0, b = new x(), y = (t, e) => {
-    for (let d = 0; d < c.length; d++) if (!t.hasComponent(e, c[d])) return !1;
-    return !0;
-  }, g = (t, e) => {
-    e.isDisabled(t) || y(e, t) && (b._ctx = e, b._eid = t, a.set(t, s(b)));
-  }, o = (t) => {
-    a.delete(t);
-  };
-  let i;
-  return f(() => {
-    i = c.map(
-      (t) => l.observe(t, {
-        granularity: "entity",
-        onSet: g,
-        onAdd: g,
-        onRemove: o,
-        // 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: o,
-        onEnable: g,
-        access: h,
-        yieldExisting: u
-      })
-    );
-  }), {
-    map: a,
-    dispose: () => {
-      for (let t = 0; t < i.length; t++) i[t].dispose();
-    }
-  };
-}
-function T(l, n, s, r, c = {}) {
-  const a = {};
-  for (let e = 0; e < r.length; e++) a[r[e]] = 0;
-  const [h, u] = c.into ?? p(a, c.eq), b = _(() => r.map((e) => h[e])), y = {
-    ...c.access,
-    reads: [n, ...c.access?.reads ?? []]
-  }, g = c.seedExisting ?? !0, o = (e) => {
-    for (let d = 0; d < r.length; d++) u[r[d]](e.getField(s, n, r[d]));
-  }, i = () => {
-    for (let e = 0; e < r.length; e++) u[r[e]](b[e]);
-  };
-  let t;
-  return f(() => {
-    t = l.observe(n, {
-      granularity: "entity",
-      onSet: (e, d) => {
-        e === s && o(d);
-      },
-      onAdd: (e, d) => {
-        e === s && !d.isDisabled(s) && o(d);
-      },
-      onRemove: (e) => {
-        e === s && i();
-      },
-      onDisable: (e) => {
-        e === s && i();
-      },
-      onEnable: (e, d) => {
-        e === s && o(d);
-      },
-      access: y,
-      yieldExisting: g
-    });
-  }), { struct: h, dispose: () => t.dispose() };
-}
-function C(l, n, s, r, c = {}) {
-  const a = c.into ?? w(new Array(r.length).fill(0), c.eq), h = _(() => a.snapshot());
-  if (c.into !== void 0 && h.length !== r.length)
-    throw new Error(
-      `syncSingletonToArray: into.length (${h.length}) must equal fields.length (${r.length})`
-    );
-  const u = {
-    ...c.access,
-    reads: [n, ...c.access?.reads ?? []]
-  }, b = c.seedExisting ?? !0, y = new Array(r.length), g = (t) => {
-    for (let e = 0; e < r.length; e++) y[e] = t.getField(s, n, r[e]);
-    a.reconcile(y);
-  }, o = () => a.reconcile(h);
-  let i;
-  return f(() => {
-    i = l.observe(n, {
-      granularity: "entity",
-      onSet: (t, e) => {
-        t === s && g(e);
-      },
-      onAdd: (t, e) => {
-        t === s && !e.isDisabled(s) && g(e);
-      },
-      onRemove: (t) => {
-        t === s && o();
-      },
-      onDisable: (t) => {
-        t === s && o();
-      },
-      onEnable: (t, e) => {
-        t === s && g(e);
-      },
-      access: u,
-      yieldExisting: b
-    });
-  }), { array: a, dispose: () => i.dispose() };
-}
-function F(l, n) {
-  f(() => l.update(n));
-}
-export {
-  F as batchedUpdate,
-  E as shallow,
-  A as syncComponentToMap,
-  q as syncFieldsToMap,
-  M as syncJoinToMap,
-  C as syncSingletonToArray,
-  T as syncSingletonToStruct
-};

package/dist/extensions/reactive/index.js

@@ -1,215 +0,0 @@
-import { b as f, u as _ } from "../../kernel-DgyrLFjW.js";
-import { r as m, s as E, a as p, b as w } from "../../shallow-DfnAm9vG.js";
-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(l, n, s, r = {}) {
-  const c = m(r.eq), a = {
-    ...r.access,
-    reads: [n, ...r.access?.reads ?? []]
-  }, h = r.grain ?? "entity", u = r.seedExisting ?? !0, b = new v(n), y = (o, i) => {
-    i.isDisabled(o) || (b._ctx = i, b._eid = o, c.set(o, s(b)));
-  };
-  let g;
-  return f(() => {
-    if (h === "column") {
-      const o = new R(n);
-      g = l.observe(n, {
-        granularity: "archetype",
-        onSet: (i) => {
-          o.bind(i);
-          const t = i.entityIds;
-          for (let e = 0; e < i.entityCount; e++)
-            o._row = e, o._eid = t[e], c.set(o._eid, s(o));
-        },
-        onAdd: (i, t) => y(i, t),
-        onRemove: (i) => c.delete(i),
-        // 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: (i) => c.delete(i),
-        onEnable: (i, t) => y(i, t),
-        access: a,
-        yieldExisting: u
-      });
-    } else
-      g = l.observe(n, {
-        granularity: "entity",
-        onSet: (o, i) => y(o, i),
-        onAdd: (o, i) => y(o, i),
-        onRemove: (o) => c.delete(o),
-        onDisable: (o) => c.delete(o),
-        onEnable: (o, i) => y(o, i),
-        access: a,
-        yieldExisting: u
-      });
-  }), { map: c, dispose: () => g.dispose() };
-}
-function q(l, n, s, r = {}) {
-  return A(l, n, (a) => {
-    const h = {};
-    for (let u = 0; u < s.length; u++) h[s[u]] = a.field(s[u]);
-    return h;
-  }, { ...r, eq: E });
-}
-function M(l, n, s, r = {}) {
-  const c = n, a = m(r.eq), h = {
-    ...r.access,
-    reads: [...c, ...r.access?.reads ?? []]
-  }, u = r.seedExisting ?? !0, b = new x(), y = (t, e) => {
-    for (let d = 0; d < c.length; d++) if (!t.hasComponent(e, c[d])) return !1;
-    return !0;
-  }, g = (t, e) => {
-    e.isDisabled(t) || y(e, t) && (b._ctx = e, b._eid = t, a.set(t, s(b)));
-  }, o = (t) => {
-    a.delete(t);
-  };
-  let i;
-  return f(() => {
-    i = c.map(
-      (t) => l.observe(t, {
-        granularity: "entity",
-        onSet: g,
-        onAdd: g,
-        onRemove: o,
-        // 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: o,
-        onEnable: g,
-        access: h,
-        yieldExisting: u
-      })
-    );
-  }), {
-    map: a,
-    dispose: () => {
-      for (let t = 0; t < i.length; t++) i[t].dispose();
-    }
-  };
-}
-function T(l, n, s, r, c = {}) {
-  const a = {};
-  for (let e = 0; e < r.length; e++) a[r[e]] = 0;
-  const [h, u] = c.into ?? p(a, c.eq), b = _(() => r.map((e) => h[e])), y = {
-    ...c.access,
-    reads: [n, ...c.access?.reads ?? []]
-  }, g = c.seedExisting ?? !0, o = (e) => {
-    for (let d = 0; d < r.length; d++) u[r[d]](e.getField(s, n, r[d]));
-  }, i = () => {
-    for (let e = 0; e < r.length; e++) u[r[e]](b[e]);
-  };
-  let t;
-  return f(() => {
-    t = l.observe(n, {
-      granularity: "entity",
-      onSet: (e, d) => {
-        e === s && o(d);
-      },
-      onAdd: (e, d) => {
-        e === s && !d.isDisabled(s) && o(d);
-      },
-      onRemove: (e) => {
-        e === s && i();
-      },
-      onDisable: (e) => {
-        e === s && i();
-      },
-      onEnable: (e, d) => {
-        e === s && o(d);
-      },
-      access: y,
-      yieldExisting: g
-    });
-  }), { struct: h, dispose: () => t.dispose() };
-}
-function C(l, n, s, r, c = {}) {
-  const a = c.into ?? w(new Array(r.length).fill(0), c.eq), h = _(() => a.snapshot());
-  if (c.into !== void 0 && h.length !== r.length)
-    throw new Error(
-      `syncSingletonToArray: into.length (${h.length}) must equal fields.length (${r.length})`
-    );
-  const u = {
-    ...c.access,
-    reads: [n, ...c.access?.reads ?? []]
-  }, b = c.seedExisting ?? !0, y = new Array(r.length), g = (t) => {
-    for (let e = 0; e < r.length; e++) y[e] = t.getField(s, n, r[e]);
-    a.reconcile(y);
-  }, o = () => a.reconcile(h);
-  let i;
-  return f(() => {
-    i = l.observe(n, {
-      granularity: "entity",
-      onSet: (t, e) => {
-        t === s && g(e);
-      },
-      onAdd: (t, e) => {
-        t === s && !e.isDisabled(s) && g(e);
-      },
-      onRemove: (t) => {
-        t === s && o();
-      },
-      onDisable: (t) => {
-        t === s && o();
-      },
-      onEnable: (t, e) => {
-        t === s && g(e);
-      },
-      access: u,
-      yieldExisting: b
-    });
-  }), { array: a, dispose: () => i.dispose() };
-}
-function F(l, n) {
-  f(() => l.update(n));
-}
-export {
-  F as batchedUpdate,
-  E as shallow,
-  A as syncComponentToMap,
-  q as syncFieldsToMap,
-  M as syncJoinToMap,
-  C as syncSingletonToArray,
-  T as syncSingletonToStruct
-};

package/dist/extensions/solid/index.cjs

@@ -1 +0,0 @@
-"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,set:(n,r)=>!1})}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.cts

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

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

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

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

@@ -1 +0,0 @@
-{"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.development.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("solid-js"),i=require("../../interop-T1HZ-Dpa.cjs");function l(e){const[t,o]=u.createSignal(e());return u.onCleanup(i.subscribe(e,s=>o(()=>s))),t}function c(e){return{keys:l(()=>e.keys()),cell:t=>l(()=>e.get(t))}}function f(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,set:(n,r)=>{throw new TypeError(`fromKernelStruct view is read-only: write through the kernel struct's setters (set.${String(r)}(value)), not the bridged view`)}})}function a(e){return l(()=>e.snapshot())}exports.fromKernel=l;exports.fromKernelArray=a;exports.fromKernelMap=c;exports.fromKernelStruct=f;

package/dist/extensions/solid/index.development.js

@@ -1,40 +0,0 @@
-import { createSignal as u, onCleanup as c } from "solid-js";
-import { s as f } from "../../interop-DqxleBo7.js";
-function i(e) {
-  const [t, o] = u(e());
-  return c(f(e, (s) => o(() => s))), t;
-}
-function g(e) {
-  return {
-    keys: i(() => e.keys()),
-    cell: (t) => i(() => e.get(t))
-  };
-}
-function h(e) {
-  const t = {}, o = Object.keys(e), s = new Set(o);
-  for (const n of o)
-    t[n] = i(() => 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,
-    // Read surface only (`Readonly<T>`, POLISH_AUDIT #8) — mirrors the kernel
-    // struct proxy's trap so a JS-side assignment fails loudly instead of
-    // sticking a non-reactive value on the hidden target.
-    set: (n, r) => {
-      throw new TypeError(
-        `fromKernelStruct view is read-only: write through the kernel struct's setters (set.${String(r)}(value)), not the bridged view`
-      );
-    }
-  });
-}
-function y(e) {
-  return i(() => e.snapshot());
-}
-export {
-  i as fromKernel,
-  y as fromKernelArray,
-  g as fromKernelMap,
-  h as fromKernelStruct
-};

package/dist/extensions/solid/index.js

@@ -1,36 +0,0 @@
-import { createSignal as u, onCleanup as c } from "solid-js";
-import { s as a } from "../../interop-CcY6ASQc.js";
-function f(e) {
-  const [t, o] = u(e());
-  return c(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,
-    // Read surface only (`Readonly<T>`, POLISH_AUDIT #8) — mirrors the kernel
-    // struct proxy's trap so a JS-side assignment fails loudly instead of
-    // sticking a non-reactive value on the hidden target.
-    set: (n, r) => !1
-  });
-}
-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.cts

@@ -1,45 +0,0 @@
-import { Accessor } from 'solid-js';
-import { ReactiveArray, ReactiveMap } from '../../reactive/index.cjs';
-/**
- * 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.
-     * Each call mints a FRESH bridge (subscription): call it once per row (bind
-     * the accessor in the row's scope), never inline it in a hot JSX expression
-     * that re-evaluates per render. */
-    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: Readonly<T>): Readonly<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

@@ -1,45 +0,0 @@
-import { Accessor } from 'solid-js';
-import { ReactiveArray, ReactiveMap } from '../../reactive/index.js';
-/**
- * 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.
-     * Each call mints a FRESH bridge (subscription): call it once per row (bind
-     * the accessor in the row's scope), never inline it in a hot JSX expression
-     * that re-evaluates per render. */
-    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: Readonly<T>): Readonly<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

@@ -1 +0,0 @@
-{"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,gBAAgB,CAAC;AAGjF;;;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;;;uCAGmC;IACnC,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,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAgCnF;AAED;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,CAEhF"}