@adobe/ecs 0.0.0-stage → 0.2.0

package/dist/implementation/world/arrays.js

@@ -0,0 +1,34 @@
+// © 2026 Adobe. MIT License. See /LICENSE for details.
+import { viewsOf } from '../../interface/registry/layout.js';
+/** A typed array over a new arena block. Contents are unspecified. */
+export const allocateArray = (memory, constructor, length) => {
+    if (!memory.shared)
+        return new constructor(new ArrayBuffer(length * constructor.BYTES_PER_ELEMENT), 0, length);
+    // Allocate first: it may grow memory, which replaces `memory.buffer`.
+    const offset = memory.allocate(length * constructor.BYTES_PER_ELEMENT);
+    return new constructor(memory.memory.buffer, offset, length);
+};
+export const freeArray = (memory, array) => {
+    if (memory.shared)
+        memory.free(array.byteOffset, array.byteLength);
+};
+/** Moves the first `used` elements into a new block of `length` and frees the old one. */
+export const growArray = (memory, array, constructor, length, used) => {
+    const grown = allocateArray(memory, constructor, length);
+    grown.set(array.subarray(0, used));
+    freeArray(memory, array);
+    return grown;
+};
+/** Views of a new arena block of `bytes`, for one component's interleaved column. Contents are unspecified. */
+export const allocateViews = (memory, bytes) => {
+    if (!memory.shared)
+        return viewsOf(new ArrayBuffer(bytes), 0, bytes);
+    const offset = memory.allocate(bytes);
+    return viewsOf(memory.memory.buffer, offset, bytes);
+};
+export const freeViews = (memory, views) => freeArray(memory, views.u8);
+/** Views of no bytes, for components with nothing to store. */
+export const emptyViews = viewsOf(new ArrayBuffer(0), 0, 0);
+/** A kernel's column of a component an archetype lacks, optional in its system: empty, so its reads give undefined. */
+export const absentColumn = (layout, source) => source.kind === "field" && layout.kind === "linear" && source.leaf !== undefined ? emptyViews[layout.leaves[source.leaf].view] : emptyViews.f64;
+//# sourceMappingURL=arrays.js.map

package/dist/implementation/world/arrays.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrays.js","sourceRoot":"","sources":["../../../src/implementation/world/arrays.ts"],"names":[],"mappings":"AAAA,uDAAuD;AACvD,OAAO,EAAE,OAAO,EAA4C,MAAM,oCAAoC,CAAC;AAUvG,sEAAsE;AACtE,MAAM,CAAC,MAAM,aAAa,GAAG,CAAI,MAAc,EAAE,WAAgC,EAAE,MAAc,EAAK,EAAE;IACpG,IAAI,CAAC,MAAM,CAAC,MAAM;QAAE,OAAO,IAAI,WAAW,CAAC,IAAI,WAAW,CAAC,MAAM,GAAG,WAAW,CAAC,iBAAiB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;IAC/G,sEAAsE;IACtE,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,WAAW,CAAC,iBAAiB,CAAC,CAAC;IACvE,OAAO,IAAI,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AACjE,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,MAAc,EAAE,KAAW,EAAQ,EAAE;IAC3D,IAAI,MAAM,CAAC,MAAM;QAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;AACvE,CAAC,CAAC;AAEF,0FAA0F;AAC1F,MAAM,CAAC,MAAM,SAAS,GAAG,CACrB,MAAc,EAAE,KAAQ,EAAE,WAAgC,EAAE,MAAc,EAAE,IAAY,EACvF,EAAE;IACH,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;IACzD,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IACnC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACzB,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF,+GAA+G;AAC/G,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,MAAc,EAAE,KAAa,EAAS,EAAE;IAClE,IAAI,CAAC,MAAM,CAAC,MAAM;QAAE,OAAO,OAAO,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IACrE,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACtC,OAAO,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;AACxD,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,MAAc,EAAE,KAAY,EAAQ,EAAE,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;AAE7F,+DAA+D;AAC/D,MAAM,CAAC,MAAM,UAAU,GAAU,OAAO,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAEnE,uHAAuH;AACvH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,MAAc,EAAE,MAAyD,EAAc,EAAE,CAClH,MAAM,CAAC,IAAI,KAAK,OAAO,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC"}

package/dist/implementation/world/arrivals.d.ts

@@ -0,0 +1,52 @@
+import type { Memory } from './memory.js';
+/** The layout directory's header word holding the offset of the ring's control block, 0 before one is written. */
+export declare const arrivalsWord = 15;
+export declare const membershipWord = 3;
+/** The world's side of the ring: its control block and its entries, each a block of the memory when it's shared. */
+export type Arrivals = {
+    readonly control: Uint32Array;
+    readonly entries: Uint32Array;
+};
+/** The ring, allocated with the first arrival logged. */
+export declare const createArrivals: (memory: Memory) => Arrivals;
+/** Logs rows moving from archetype `from` into `to` at a sync point of `tick`. */
+export declare const logArrival: ({ control, entries }: Arrivals, from: number, to: number, tick: number) => void;
+/** Where a reader finds the ring: its control block in `control` from word `controlAt`, its entries likewise. */
+export type ArrivalsView = {
+    readonly control: Uint32Array;
+    readonly controlAt: number;
+    readonly entries: Uint32Array;
+    readonly entriesAt: number;
+};
+/** The world's thread's view of its ring. */
+export declare const viewOfArrivals: ({ control, entries }: Arrivals) => ArrivalsView;
+/** A joined thread's view of the ring whose control block is at byte `offset` of the memory `words` cover. */
+export declare const viewInMemory: (words: Uint32Array, offset: number) => ArrivalsView;
+/** How many times archetypes were reclaimed or reused, modulo 2^32: 0 before the ring is written. */
+export declare const membershipOf: (view: ArrivalsView | null) => number;
+/** The entries written so far, modulo 2^32, as a reader's cursor starts. */
+export declare const arrivalsPosition: (view: ArrivalsView | null) => number;
+/**
+ * What archetypes owe a system with points: by archetype id, the oldest point rows moved into it since its own point
+ * were last seen at, by the system's point of each archetype they came from, or its last run for a non-match's. A row
+ * is counted changed in its new archetype only if it changed after that, so moves among archetypes the system saw cost
+ * nothing, and a run reads its arrivals once, however many archetypes it goes over.
+ */
+export type Debts = {
+    /** The point an archetype's rows pass change filters after: its own, or older for rows moved in from elsewhere. */
+    readonly sinceOf: (id: number, point: number) => number;
+    /**
+     * Reads arrivals through tick `through`, of `archetypes` archetypes, its last run `latest`; once the ring overwrote
+     * some unread, every archetype owes the oldest of `oldest()`, the system's oldest point, and what any owed.
+     */
+    readonly read: (view: ArrivalsView | null, through: number, archetypes: number, latest: number, oldest: () => number) => void;
+    /** Clears what an archetype owed, as its system runs over it. */
+    readonly settle: (id: number) => void;
+    /** The oldest debt, for what any archetype's rows may pass since; Infinity for none. */
+    readonly oldest: () => number;
+};
+/**
+ * The debts of a system with points: `points` by match, and `matchOf` by archetype id, its match or -1, its runner's,
+ * read as they are. Starts reading the ring at entry `start`.
+ */
+export declare const createDebts: (points: readonly number[], matchOf: readonly number[], start: number) => Debts;

package/dist/implementation/world/arrivals.js

@@ -0,0 +1,146 @@
+// © 2026 Adobe. MIT License. See /LICENSE for details.
+import { allocateArray } from './arrays.js';
+// The arrivals ring: rows moving between archetypes, a pair of archetypes per block of rows a sync point moves, for
+// systems with `where` and change filters, which keep a point per archetype. A row moved from an archetype the system
+// skipped holds changes it never saw, so its new archetype owes them: its rows pass the system's change filters since
+// the point of the archetype they came from, as of the move (`createDebts`). Written by the world's thread at sync
+// points, while a system with points registered or a joined thread holds claims, and read by each such system as it
+// runs, on the world's thread or a joined one, which finds it by the layout directory's header.
+/** The layout directory's header word holding the offset of the ring's control block, 0 before one is written. */
+export const arrivalsWord = 15;
+/**
+ * The control block's words: the entries written, modulo 2^32, stored after each; the capacity; the entries' offset;
+ * and how many times archetypes were reclaimed or reused, modulo 2^32 (`reclaim.ts`), which a joined thread's systems
+ * check to find their matches again.
+ */
+const positionWord = 0;
+const capacityWord = 1;
+const entriesOffsetWord = 2;
+export const membershipWord = 3;
+const controlWords = 16;
+/** An entry: the archetype rows moved from, the one they moved to, and the sync's tick, low and high words. */
+const entryWords = 4;
+/** A power of two, its entries a block of 64 KiB. A system further behind owes, for every archetype, its oldest point. */
+const capacity = 4096;
+/** The ring, allocated with the first arrival logged. */
+export const createArrivals = (memory) => {
+    const entries = allocateArray(memory, Uint32Array, capacity * entryWords).fill(0);
+    const control = allocateArray(memory, Uint32Array, controlWords).fill(0);
+    control[capacityWord] = capacity;
+    control[entriesOffsetWord] = entries.byteOffset;
+    if (memory.shared)
+        Atomics.store(memory.header, arrivalsWord, control.byteOffset);
+    return { control, entries };
+};
+/** Logs rows moving from archetype `from` into `to` at a sync point of `tick`. */
+export const logArrival = ({ control, entries }, from, to, tick) => {
+    const position = control[positionWord];
+    const at = (position & (capacity - 1)) * entryWords;
+    entries[at] = from;
+    entries[at + 1] = to;
+    entries[at + 2] = tick % 0x100000000;
+    entries[at + 3] = Math.floor(tick / 0x100000000);
+    Atomics.store(control, positionWord, (position + 1) >>> 0);
+};
+/** The world's thread's view of its ring. */
+export const viewOfArrivals = ({ control, entries }) => ({ control, controlAt: 0, entries, entriesAt: 0 });
+/** A joined thread's view of the ring whose control block is at byte `offset` of the memory `words` cover. */
+export const viewInMemory = (words, offset) => {
+    const controlAt = offset >> 2;
+    return { control: words, controlAt, entries: words, entriesAt: words[controlAt + entriesOffsetWord] >> 2 };
+};
+/** How many times archetypes were reclaimed or reused, modulo 2^32: 0 before the ring is written. */
+export const membershipOf = (view) => view === null ? 0 : Atomics.load(view.control, view.controlAt + membershipWord);
+/** The entries written so far, modulo 2^32, as a reader's cursor starts. */
+export const arrivalsPosition = (view) => view === null ? 0 : Atomics.load(view.control, view.controlAt + positionWord);
+/**
+ * The debts of a system with points: `points` by match, and `matchOf` by archetype id, its match or -1, its runner's,
+ * read as they are. Starts reading the ring at entry `start`.
+ */
+export const createDebts = (points, matchOf, start) => {
+    /** By archetype id, Infinity for none. */
+    let owed = new Float64Array(64).fill(Infinity);
+    const ensure = (archetypes) => {
+        if (archetypes <= owed.length)
+            return;
+        let length = owed.length * 2;
+        while (length < archetypes)
+            length *= 2;
+        const grown = new Float64Array(length).fill(Infinity);
+        grown.set(owed);
+        owed = grown;
+    };
+    let cursor = start;
+    /**
+     * Once the ring overwrote unread entries, the oldest point as of then, which every archetype owes again at the next
+     * read too: entries skipped may be of syncs after the run's, whose rows that run's archetypes didn't have yet.
+     */
+    let floor = Infinity;
+    const oldestOwed = () => {
+        let oldest = Infinity;
+        for (let id = 0; id < owed.length; id++)
+            if (owed[id] < oldest)
+                oldest = owed[id];
+        return oldest;
+    };
+    const owe = (archetypes, point) => {
+        for (let id = 0; id < archetypes; id++)
+            if (point < owed[id])
+                owed[id] = point;
+    };
+    /** Reads entries from the cursor through `through`; false when the ring overwrote some unread, before or while. */
+    const readThrough = (view, through, latest) => {
+        const { control, controlAt, entries, entriesAt } = view;
+        const size = control[controlAt + capacityWord];
+        const pending = (Atomics.load(control, controlAt + positionWord) - cursor) >>> 0;
+        if (pending > size)
+            return false;
+        let read = 0;
+        let debts = owed;
+        const mask = size - 1;
+        for (; read < pending; read++) {
+            const at = entriesAt + ((cursor + read) & mask) * entryWords;
+            if (entries[at + 2] + entries[at + 3] * 0x100000000 > through)
+                break;
+            const from = entries[at];
+            const to = entries[at + 1];
+            if (from >= debts.length || to >= debts.length) {
+                ensure(Math.max(from, to) + 1);
+                debts = owed;
+            }
+            const m = matchOf[from];
+            let point = m >= 0 ? points[m] : latest;
+            if (debts[from] < point)
+                point = debts[from];
+            if (point < debts[to])
+                debts[to] = point;
+        }
+        if (((Atomics.load(control, controlAt + positionWord) - cursor) >>> 0) > size)
+            return false;
+        cursor = (cursor + read) >>> 0;
+        return true;
+    };
+    return {
+        sinceOf: (id, point) => id < owed.length && owed[id] < point ? owed[id] : point,
+        read: (view, through, archetypes, latest, oldest) => {
+            if (view === null)
+                return;
+            ensure(archetypes);
+            const skipped = floor;
+            floor = Infinity;
+            if (skipped !== Infinity)
+                owe(archetypes, skipped);
+            if (readThrough(view, through, latest))
+                return;
+            cursor = arrivalsPosition(view);
+            floor = Math.min(oldest(), oldestOwed(), skipped);
+            owe(archetypes, floor);
+        },
+        settle: id => {
+            if (id < owed.length)
+                owed[id] = Infinity;
+        },
+        oldest: oldestOwed,
+    };
+};
+//# sourceMappingURL=arrivals.js.map

package/dist/implementation/world/arrivals.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrivals.js","sourceRoot":"","sources":["../../../src/implementation/world/arrivals.ts"],"names":[],"mappings":"AAAA,uDAAuD;AACvD,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAG5C,oHAAoH;AACpH,sHAAsH;AACtH,sHAAsH;AACtH,mHAAmH;AACnH,oHAAoH;AACpH,gGAAgG;AAEhG,kHAAkH;AAClH,MAAM,CAAC,MAAM,YAAY,GAAG,EAAE,CAAC;AAC/B;;;;GAIG;AACH,MAAM,YAAY,GAAG,CAAC,CAAC;AACvB,MAAM,YAAY,GAAG,CAAC,CAAC;AACvB,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAC5B,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC;AAChC,MAAM,YAAY,GAAG,EAAE,CAAC;AACxB,+GAA+G;AAC/G,MAAM,UAAU,GAAG,CAAC,CAAC;AACrB,0HAA0H;AAC1H,MAAM,QAAQ,GAAG,IAAI,CAAC;AAKtB,yDAAyD;AACzD,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,MAAc,EAAY,EAAE;IACvD,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,EAAE,WAAW,EAAE,QAAQ,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClF,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzE,OAAO,CAAC,YAAY,CAAC,GAAG,QAAQ,CAAC;IACjC,OAAO,CAAC,iBAAiB,CAAC,GAAG,OAAO,CAAC,UAAU,CAAC;IAChD,IAAI,MAAM,CAAC,MAAM;QAAE,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,YAAY,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;IAClF,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;AAChC,CAAC,CAAC;AAEF,kFAAkF;AAClF,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,EAAE,OAAO,EAAE,OAAO,EAAY,EAAE,IAAY,EAAE,EAAU,EAAE,IAAY,EAAQ,EAAE;IACvG,MAAM,QAAQ,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;IACvC,MAAM,EAAE,GAAG,CAAC,QAAQ,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;IACpD,OAAO,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;IACnB,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IACrB,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,WAAW,CAAC;IACrC,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,WAAW,CAAC,CAAC;IACjD,OAAO,CAAC,KAAK,CAAC,OAAO,EAAE,YAAY,EAAE,CAAC,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AAC/D,CAAC,CAAC;AAKF,6CAA6C;AAC7C,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,EAAE,OAAO,EAAE,OAAO,EAAY,EAAgB,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;AAEnI,8GAA8G;AAC9G,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAkB,EAAE,MAAc,EAAgB,EAAE;IAC7E,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,CAAC;IAC9B,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,GAAG,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;AAC/G,CAAC,CAAC;AAEF,qGAAqG;AACrG,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,IAAyB,EAAU,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,GAAG,cAAc,CAAC,CAAC;AAEnJ,4EAA4E;AAC5E,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,IAAyB,EAAU,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,GAAG,YAAY,CAAC,CAAC;AAsBrJ;;;GAGG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,MAAyB,EAAE,OAA0B,EAAE,KAAa,EAAS,EAAE;IACvG,0CAA0C;IAC1C,IAAI,IAAI,GAAG,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,CAAC,UAAkB,EAAQ,EAAE;QACxC,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO;QACtC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC7B,OAAO,MAAM,GAAG,UAAU;YAAE,MAAM,IAAI,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChB,IAAI,GAAG,KAAK,CAAC;IACjB,CAAC,CAAC;IACF,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB;;;OAGG;IACH,IAAI,KAAK,GAAG,QAAQ,CAAC;IACrB,MAAM,UAAU,GAAG,GAAW,EAAE;QAC5B,IAAI,MAAM,GAAG,QAAQ,CAAC;QACtB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE;YAAE,IAAI,IAAI,CAAC,EAAE,CAAC,GAAG,MAAM;gBAAE,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;QAClF,OAAO,MAAM,CAAC;IAClB,CAAC,CAAC;IACF,MAAM,GAAG,GAAG,CAAC,UAAkB,EAAE,KAAa,EAAQ,EAAE;QACpD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,UAAU,EAAE,EAAE,EAAE;YAAE,IAAI,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC;gBAAE,IAAI,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;IACnF,CAAC,CAAC;IACF,mHAAmH;IACnH,MAAM,WAAW,GAAG,CAAC,IAAkB,EAAE,OAAe,EAAE,MAAc,EAAW,EAAE;QACjF,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC;QACxD,MAAM,IAAI,GAAG,OAAO,CAAC,SAAS,GAAG,YAAY,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,SAAS,GAAG,YAAY,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QACjF,IAAI,OAAO,GAAG,IAAI;YAAE,OAAO,KAAK,CAAC;QACjC,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;QACtB,OAAO,IAAI,GAAG,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;YAC5B,MAAM,EAAE,GAAG,SAAS,GAAG,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,UAAU,CAAC;YAC7D,IAAI,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,WAAW,GAAG,OAAO;gBAAE,MAAM;YACrE,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACzB,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAC3B,IAAI,IAAI,IAAI,KAAK,CAAC,MAAM,IAAI,EAAE,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;gBAC7C,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/B,KAAK,GAAG,IAAI,CAAC;YACjB,CAAC;YACD,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;YACxB,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACxC,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK;gBAAE,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YAC7C,IAAI,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC;gBAAE,KAAK,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;QAC7C,CAAC;QACD,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,SAAS,GAAG,YAAY,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI;YAAE,OAAO,KAAK,CAAC;QAC5F,MAAM,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC;IACF,OAAO;QACH,OAAO,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK;QAC/E,IAAI,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;YAChD,IAAI,IAAI,KAAK,IAAI;gBAAE,OAAO;YAC1B,MAAM,CAAC,UAAU,CAAC,CAAC;YACnB,MAAM,OAAO,GAAG,KAAK,CAAC;YACtB,KAAK,GAAG,QAAQ,CAAC;YACjB,IAAI,OAAO,KAAK,QAAQ;gBAAE,GAAG,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;YACnD,IAAI,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,CAAC;gBAAE,OAAO;YAC/C,MAAM,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAChC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,UAAU,EAAE,EAAE,OAAO,CAAC,CAAC;YAClD,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC3B,CAAC;QACD,MAAM,EAAE,EAAE,CAAC,EAAE;YACT,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM;gBAAE,IAAI,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;QAC9C,CAAC;QACD,MAAM,EAAE,UAAU;KACrB,CAAC;AACN,CAAC,CAAC"}

package/dist/implementation/world/attach-kernel.d.ts

@@ -0,0 +1,10 @@
+import type { System } from '../../interface/system/system.js';
+import type { KernelDescription } from './kernel.js';
+/**
+ * The compiler's only hook into the runtime: wraps each kernel system's `System.create` call. Throws for a kernel that
+ * doesn't match its declaration and schemas (`checkKernel`), and for a key that's a list, which a command names as one
+ * component only where its build couldn't read the name's module. A kernel the build only `tried`, for a system
+ * without a `kernel` flag, attaches only where it matches, and the system otherwise runs as written.
+ */
+export declare const attachKernel: <S extends System<unknown>>(system: S, description: KernelDescription, tried?: boolean) => S;
+export declare const kernelOf: (system: System<unknown>) => KernelDescription | undefined;

package/dist/implementation/world/attach-kernel.js

@@ -0,0 +1,30 @@
+// © 2026 Adobe. MIT License. See /LICENSE for details.
+import { definitionOf } from '../../interface/registry/index.js';
+import { unreadByKernel } from '../../interface/system/check.js';
+import { checkKernel, kernelMismatch } from './check-kernel.js';
+/** By the system `System.create` returned, so a lookup doesn't depend on which copy of the package defined it. */
+const kernels = new WeakMap();
+/**
+ * The compiler's only hook into the runtime: wraps each kernel system's `System.create` call. Throws for a kernel that
+ * doesn't match its declaration and schemas (`checkKernel`), and for a key that's a list, which a command names as one
+ * component only where its build couldn't read the name's module. A kernel the build only `tried`, for a system
+ * without a `kernel` flag, attaches only where it matches, and the system otherwise runs as written.
+ */
+export const attachKernel = (system, description, tried = false) => {
+    const listed = description.keys.some(key => Array.isArray(key));
+    const leaf = definitionOf(system);
+    if (tried) {
+        if (listed || leaf === undefined || leaf.kind === "composite" || unreadByKernel(leaf) !== null || kernelMismatch(leaf, description) !== null)
+            return system;
+        kernels.set(system, description);
+        return system;
+    }
+    if (listed)
+        throw new Error(`System "${system.name}" names a list of components where a command takes one component; its kernel's build couldn't read the list, so name it from a module the build reads, or as an array literal.`);
+    if (leaf !== undefined && leaf.kind !== "composite")
+        checkKernel(leaf, description);
+    kernels.set(system, description);
+    return system;
+};
+export const kernelOf = (system) => kernels.get(system);
+//# sourceMappingURL=attach-kernel.js.map

package/dist/implementation/world/attach-kernel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"attach-kernel.js","sourceRoot":"","sources":["../../../src/implementation/world/attach-kernel.ts"],"names":[],"mappings":"AAAA,uDAAuD;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,mCAAmC,CAAC;AAEjE,OAAO,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAC;AACjE,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAGhE,kHAAkH;AAClH,MAAM,OAAO,GAAG,IAAI,OAAO,EAAsC,CAAC;AAElE;;;;;GAKG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAA4B,MAAS,EAAE,WAA8B,EAAE,KAAK,GAAG,KAAK,EAAK,EAAE;IACnH,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;IAChE,MAAM,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IAClC,IAAI,KAAK,EAAE,CAAC;QACR,IAAI,MAAM,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,IAAI,cAAc,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,cAAc,CAAC,IAAI,EAAE,WAAW,CAAC,KAAK,IAAI;YAAE,OAAO,MAAM,CAAC;QAC5J,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QACjC,OAAO,MAAM,CAAC;IAClB,CAAC;IACD,IAAI,MAAM;QAAE,MAAM,IAAI,KAAK,CAAC,WAAW,MAAM,CAAC,IAAI,gLAAgL,CAAC,CAAC;IACpO,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW;QAAE,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IACpF,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IACjC,OAAO,MAAM,CAAC;AAClB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,MAAuB,EAAiC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC"}

package/dist/implementation/world/batches.d.ts

@@ -0,0 +1,18 @@
+import { type Archetype } from './archetype.js';
+import type { CommandBuffer } from './buffer.js';
+import { type SpawnBatch } from './staging.js';
+import { type State } from './state.js';
+/**
+ * The batch of main-thread spawns of exactly these components, with these shared values by component id, made on first
+ * use.
+ */
+export declare const batchOf: (state: State, ids: readonly number[], shared?: readonly (number | undefined)[]) => SpawnBatch;
+/** At a sync point, before the plan: commits and empties every main-thread batch. Returns the entities committed. */
+export declare const commitBatches: (state: State, tick: number, born: Map<number, number>, close: ((archetype: Archetype) => Archetype) | null) => number;
+/**
+ * Then, in merge order, the kernel spawns each queued buffer staged; their runner or worker empties the batches before
+ * staging into them again. Returns the entities committed.
+ */
+export declare const commitStaged: (state: State, queued: readonly {
+    readonly buffer: CommandBuffer;
+}[], tick: number, born: Map<number, number>, close: ((archetype: Archetype) => Archetype) | null) => number;

package/dist/implementation/world/batches.js

@@ -0,0 +1,208 @@
+// © 2026 Adobe. MIT License. See /LICENSE for details.
+import { ensureCapacity, noShared } from './archetype.js';
+import { indexOf } from './entities.js';
+import { blockShift, chunkShift } from './kernel.js';
+import { createBatch } from './staging.js';
+import { archetypeOf } from './state.js';
+import { gainsOf } from './structure.js';
+import { remoteError } from './remote.js';
+import { countChanged } from './layout-directory.js';
+import { logRange, logSet, startTag, tagOf } from './move-log.js';
+import { writeDefault } from './synchronize.js';
+import { writeString } from './strings.js';
+import { cacheShared, internShared } from './shared.js';
+/** Batches of at most this many rows commit element by element. */
+const smallCopy = 8;
+/**
+ * The batch of main-thread spawns of exactly these components, with these shared values by component id, made on first
+ * use.
+ */
+export const batchOf = (state, ids, shared = noShared) => {
+    const sorted = [...ids].sort((a, b) => a - b);
+    const key = shared === noShared ? sorted.join(",") : keyOf(sorted, shared);
+    let batch = state.batchByKey.get(key);
+    if (batch === undefined) {
+        batch = createBatch(state.layouts, ids, shared);
+        for (const column of batch.columns)
+            if (state.remote[column.id] !== undefined)
+                column.remote = remoteError(state, column.id).message;
+        state.batchByKey.set(key, batch);
+        state.batches.push(batch);
+        if (shared !== noShared)
+            letGoWith(state, batch, key);
+    }
+    return batch;
+};
+/** A batch's key: its sorted component ids, each shared one with the number of its value. */
+const keyOf = (sorted, shared) => sorted.map(id => shared[id] === undefined ? `${id}` : `${id}=${shared[id]}`).join(",");
+/**
+ * Lets go of a batch of shared values, keyed `key`, once any of them is dropped, so batches don't pile up as values
+ * come and go. A spawner still holding it revives it as it next spawns: its values are interned again and it's listed
+ * once more, with numbers that may be new.
+ */
+const letGoWith = (state, batch, key) => {
+    const held = batch.ids.flatMap(id => {
+        const number = batch.shared[id];
+        const values = state.shared[id];
+        return number === undefined || values === undefined ? [] : [{ id, values, value: values.values[number], number }];
+    });
+    const unregister = [];
+    const drop = () => {
+        for (const letGo of unregister)
+            letGo();
+        if (state.batchByKey.get(key) === batch)
+            state.batchByKey.delete(key);
+        const at = state.batches.indexOf(batch);
+        if (at >= 0)
+            state.batches.splice(at, 1);
+        batch.archetype = null;
+        batch.capacity = batch.count;
+        batch.revive = () => {
+            const shared = [];
+            for (const { id, values, value } of held)
+                shared[id] = internShared(values, value);
+            batch.shared = shared;
+            batch.capacity = batch.entities.length;
+            const again = keyOf(batch.ids, shared);
+            if (!state.batchByKey.has(again))
+                state.batchByKey.set(again, batch);
+            state.batches.push(batch);
+            letGoWith(state, batch, again);
+        };
+    };
+    for (const { values, number } of held)
+        unregister.push(cacheShared(values, number, drop));
+};
+/**
+ * A batch's archetype, found the first time it commits, and again once it was reclaimed or reused for other values
+ * (`reclaim.ts`), which its generation tells.
+ */
+const archetypeOfBatch = (state, batch) => {
+    const known = batch.archetype;
+    if (known !== null && !known.reclaimed && known.generation === batch.generation)
+        return known;
+    const archetype = archetypeOf(state, batch.ids, batch.shared);
+    batch.archetype = archetype;
+    batch.generation = archetype.generation;
+    return archetype;
+};
+/**
+ * Copies rows `first` to `first + n` of a batch into its archetype, or into its closure under `close` when rules or
+ * `within` apply, places their entities, writes the defaults of derived components the target gains, and stamps their
+ * ticks with the sync point's tick, as a commanded spawn would be. `born` records the first row each target gains.
+ */
+const commitRows = (state, batch, first, n, tick, born, close) => {
+    const spawned = archetypeOfBatch(state, batch);
+    const target = close === null ? spawned : close(spawned);
+    ensureCapacity(state.memory, target, target.count + n);
+    const start = target.count;
+    if (!born.has(target.id))
+        born.set(target.id, start);
+    if (close !== null) {
+        for (const id of gainsOf(state.structure, state.derived, null, target)) {
+            const storage = target.storageById[id];
+            if (storage !== undefined)
+                for (let row = start; row < start + n; row++)
+                    writeDefault(state, storage, row, tick);
+        }
+    }
+    // A few rows copy element by element: a subarray to copy from costs more than they do.
+    if (n <= smallCopy)
+        for (let i = 0; i < n; i++)
+            target.entities[start + i] = batch.entities[first + i];
+    else
+        target.entities.set(batch.entities.subarray(first, first + n), start);
+    if (target.logs !== null)
+        for (const log of target.logs)
+            logRange(log, target.id, start, n, batch.entities, first);
+    if (state.counting)
+        countChanged(state.counted, target);
+    for (const column of batch.columns) {
+        const storage = target.storageById[column.id];
+        if (storage === undefined)
+            continue;
+        if (column.layout.kind === "linear") {
+            const bytes = n * column.stride;
+            const from = first * column.stride;
+            const offset = start * column.stride;
+            if (n <= smallCopy)
+                for (let i = 0; i < bytes; i++)
+                    storage.views.u8[offset + i] = column.views.u8[from + i];
+            else
+                storage.views.u8.set(column.views.u8.subarray(from, from + bytes), offset);
+        }
+        else if (column.layout.kind === "object") {
+            if (storage.remote === null)
+                for (let i = 0; i < n; i++)
+                    storage.values[start + i] = column.values[first + i];
+            else {
+                // A joined thread's objects start at their starts there, as the rows' range says: a tag set otherwise.
+                const log = storage.remote;
+                const begin = log.starts[column.id];
+                for (let i = 0; i < n; i++) {
+                    const tag = Math.max(startTag, tagOf(column.values[first + i], begin));
+                    storage.tags[start + i] = tag;
+                    if (tag !== startTag)
+                        logSet(log, target.id, start + i, column.id, tag, true);
+                }
+            }
+            column.values.fill(undefined, first, first + n);
+        }
+        // Rows past the count hold no record, so nothing is let go.
+        else if (column.layout.kind === "string") {
+            for (let i = 0; i < n; i++)
+                writeString(storage, start + i, column.values[first + i]);
+            column.values.fill(undefined, first, first + n);
+        }
+        if (!storage.ticked)
+            continue;
+        storage.added.fill(tick, start, start + n);
+        if (storage.changed !== storage.added)
+            storage.changed.fill(tick, start, start + n);
+        // Ticks only increase, so the newest tick in each chunk and block the rows reach is this one.
+        storage.blockAdded.fill(tick, start >> blockShift, ((start + n - 1) >> blockShift) + 1);
+        if (storage.blockChanged !== storage.blockAdded)
+            storage.blockChanged.fill(tick, start >> blockShift, ((start + n - 1) >> blockShift) + 1);
+        storage.chunkAdded.fill(tick, start >> chunkShift, ((start + n - 1) >> chunkShift) + 1);
+        if (storage.chunkChanged !== storage.chunkAdded)
+            storage.chunkChanged.fill(tick, start >> chunkShift, ((start + n - 1) >> chunkShift) + 1);
+    }
+    const { entities } = state;
+    for (let i = 0; i < n; i++) {
+        const index = indexOf(batch.entities[first + i]);
+        entities.archetype[index] = target.id;
+        entities.row[index] = start + i;
+    }
+    target.count += n;
+    state.touched?.add(target);
+};
+/** At a sync point, before the plan: commits and empties every main-thread batch. Returns the entities committed. */
+export const commitBatches = (state, tick, born, close) => {
+    let committed = 0;
+    for (const batch of state.batches) {
+        const n = batch.count;
+        if (n === 0)
+            continue;
+        commitRows(state, batch, 0, n, tick, born, close);
+        batch.count = 0;
+        committed += n;
+    }
+    return committed;
+};
+/**
+ * Then, in merge order, the kernel spawns each queued buffer staged; their runner or worker empties the batches before
+ * staging into them again. Returns the entities committed.
+ */
+export const commitStaged = (state, queued, tick, born, close) => {
+    let committed = 0;
+    for (let b = 0; b < queued.length; b++) {
+        const { buffer } = queued[b];
+        for (let s = 0; s < buffer.stagedCount; s++) {
+            const { batch, start, end } = buffer.staged[s];
+            commitRows(state, batch, start, end - start, tick, born, close);
+            committed += end - start;
+        }
+    }
+    return committed;
+};
+//# sourceMappingURL=batches.js.map

package/dist/implementation/world/batches.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"batches.js","sourceRoot":"","sources":["../../../src/implementation/world/batches.ts"],"names":[],"mappings":"AAAA,uDAAuD;AACvD,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAkB,MAAM,gBAAgB,CAAC;AAE1E,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACxC,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACrD,OAAO,EAAE,WAAW,EAAmB,MAAM,cAAc,CAAC;AAC5D,OAAO,EAAE,WAAW,EAAc,MAAM,YAAY,CAAC;AACrD,OAAO,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AACzC,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAC3C,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAExD,mEAAmE;AACnE,MAAM,SAAS,GAAG,CAAC,CAAC;AAEpB;;;GAGG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,KAAY,EAAE,GAAsB,EAAE,SAA0C,QAAQ,EAAc,EAAE;IAC5H,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9C,MAAM,GAAG,GAAG,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC3E,IAAI,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACtC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACtB,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,OAAO,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;QAChD,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO;YAAE,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,SAAS;gBAAE,MAAM,CAAC,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC;QACrI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACjC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,MAAM,KAAK,QAAQ;YAAE,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF,6FAA6F;AAC7F,MAAM,KAAK,GAAG,CAAC,MAAyB,EAAE,MAAuC,EAAU,EAAE,CACzF,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAE3F;;;;GAIG;AACH,MAAM,SAAS,GAAG,CAAC,KAAY,EAAE,KAAiB,EAAE,GAAW,EAAQ,EAAE;IACrE,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;QAChC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAChC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAChC,OAAO,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;IACtH,CAAC,CAAC,CAAC;IACH,MAAM,UAAU,GAAmB,EAAE,CAAC;IACtC,MAAM,IAAI,GAAG,GAAS,EAAE;QACpB,KAAK,MAAM,KAAK,IAAI,UAAU;YAAE,KAAK,EAAE,CAAC;QACxC,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,KAAK;YAAE,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACtE,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,EAAE,IAAI,CAAC;YAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzC,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC;QACvB,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC;QAC7B,KAAK,CAAC,MAAM,GAAG,GAAG,EAAE;YAChB,MAAM,MAAM,GAA2B,EAAE,CAAC;YAC1C,KAAK,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,IAAI;gBAAE,MAAM,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACnF,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;YACtB,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;YACvC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YACvC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACrE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACnC,CAAC,CAAC;IACN,CAAC,CAAC;IACF,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,IAAI;QAAE,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;AAC9F,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,gBAAgB,GAAG,CAAC,KAAY,EAAE,KAAiB,EAAa,EAAE;IACpE,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC;IAC9B,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU;QAAE,OAAO,KAAK,CAAC;IAC9F,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9D,KAAK,CAAC,SAAS,GAAG,SAAS,CAAC;IAC5B,KAAK,CAAC,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC;IACxC,OAAO,SAAS,CAAC;AACrB,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,GAAG,CAAC,KAAY,EAAE,KAAiB,EAAE,KAAa,EAAE,CAAS,EAAE,IAAY,EAAE,IAAyB,EAAE,KAAmD,EAAQ,EAAE;IACjL,MAAM,OAAO,GAAG,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACzD,cAAc,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACvD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;IAC3B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IACrD,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACjB,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;YACrE,MAAM,OAAO,GAAG,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;YACvC,IAAI,OAAO,KAAK,SAAS;gBAAE,KAAK,IAAI,GAAG,GAAG,KAAK,EAAE,GAAG,GAAG,KAAK,GAAG,CAAC,EAAE,GAAG,EAAE;oBAAE,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QACrH,CAAC;IACL,CAAC;IACD,uFAAuF;IACvF,IAAI,CAAC,IAAI,SAAS;QAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;;QAClG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC3E,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI;QAAE,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI;YAAE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACnH,IAAI,KAAK,CAAC,QAAQ;QAAE,YAAY,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACxD,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAI,OAAO,KAAK,SAAS;YAAE,SAAS;QACpC,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;YAChC,MAAM,IAAI,GAAG,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;YACnC,MAAM,MAAM,GAAG,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;YACrC,IAAI,CAAC,IAAI,SAAS;gBAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;oBAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;;gBACxG,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;QACpF,CAAC;aACI,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACvC,IAAI,OAAO,CAAC,MAAM,KAAK,IAAI;gBAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;oBAAE,OAAO,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;iBACzG,CAAC;gBACF,uGAAuG;gBACvG,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC;gBAC3B,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;oBACvE,OAAO,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;oBAC9B,IAAI,GAAG,KAAK,QAAQ;wBAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;gBAClF,CAAC;YACL,CAAC;YACD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,4DAA4D;aACvD,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,WAAW,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YACtF,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,MAAM;YAAE,SAAS;QAC9B,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC3C,IAAI,OAAO,CAAC,OAAO,KAAK,OAAO,CAAC,KAAK;YAAE,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACpF,8FAA8F;QAC9F,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI,UAAU,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QACxF,IAAI,OAAO,CAAC,YAAY,KAAK,OAAO,CAAC,UAAU;YAAE,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI,UAAU,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3I,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI,UAAU,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QACxF,IAAI,OAAO,CAAC,YAAY,KAAK,OAAO,CAAC,UAAU;YAAE,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI,UAAU,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/I,CAAC;IACD,MAAM,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC;QACtC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;IACpC,CAAC;IACD,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC;IAClB,KAAK,CAAC,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC,CAAC;AAEF,qHAAqH;AACrH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAY,EAAE,IAAY,EAAE,IAAyB,EAAE,KAAmD,EAAU,EAAE;IAChJ,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAChC,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QACtB,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAClD,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;QAChB,SAAS,IAAI,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,SAAS,CAAC;AACrB,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAY,EAAE,MAAqD,EAAE,IAAY,EAAE,IAAyB,EAAE,KAAmD,EAAU,EAAE;IACtM,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC/C,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,GAAG,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAChE,SAAS,IAAI,GAAG,GAAG,KAAK,CAAC;QAC7B,CAAC;IACL,CAAC;IACD,OAAO,SAAS,CAAC;AACrB,CAAC,CAAC"}

package/dist/implementation/world/buffer.d.ts

@@ -0,0 +1,60 @@
+import { type Layout, type Views } from '../../interface/registry/layout.js';
+import type { KernelCommands } from './kernel.js';
+import type { Positional, SpawnBatch } from './staging.js';
+export declare const spawnCommand = 0;
+export declare const despawnCommand = 1;
+export declare const addCommand = 2;
+export declare const removeCommand = 3;
+/** Rows `start` to `end` of a kernel's spawn batch, committed in its buffer's place in merge order. */
+export type Staged = {
+    batch: SpawnBatch;
+    start: number;
+    end: number;
+};
+/**
+ * Commands as parallel arrays with explicit counts, reused between runs, so issuing a command allocates nothing.
+ * Command `c` names components `ids[starts[c]]` up to the next command's start, with `values` alongside (unused for
+ * `remove`). A buffer drained from a worker's command ring keeps its structs' values as bytes in the ring, in their
+ * storages' layout, at `offsets` into `bytes`. A kernel's spawns are staged in batches instead, and its buffer lists
+ * their rows in `staged`, which the sync point commits before any command.
+ */
+export type CommandBuffer = {
+    count: number;
+    kinds: Uint8Array;
+    /** By command: the list of components a list add or remove names, by its index among the world's lists, or -1. */
+    shapes: Int32Array;
+    entities: Float64Array;
+    starts: Int32Array;
+    /** Components named so far, across commands. */
+    named: number;
+    ids: Int32Array;
+    readonly values: unknown[];
+    /** For a drained buffer, where its values' bytes are; null for a buffer of values alone. */
+    bytes: Views | null;
+    /** With `bytes`, by component named: its value's first byte there, or -1 for a value in `values`. */
+    offsets: Int32Array;
+    /** The first `stagedCount` entries are this buffer's; the rest are kept for reuse. */
+    readonly staged: Staged[];
+    stagedCount: number;
+};
+export declare const createBuffer: (capacity?: number) => CommandBuffer;
+/** No commands; never written. */
+export declare const emptyBuffer: CommandBuffer;
+export declare const clearBuffer: (buffer: CommandBuffer) => void;
+/** Adds rows `start` to `end` of a batch to the buffer's staged spawns. */
+export declare const stage: (buffer: CommandBuffer, batch: SpawnBatch, start: number, end: number) => void;
+export declare const pushCommand: (buffer: CommandBuffer, kind: number, entity: number) => void;
+export declare const pushComponent: (buffer: CommandBuffer, id: number, value: unknown) => void;
+/** Component `k`'s value: as given, or decoded from its bytes. */
+export declare const valueAt: (buffer: CommandBuffer, k: number, layouts: readonly Layout[]) => unknown;
+/** Component `k`'s value as a reference, an entity: one f64 in its bytes. */
+export declare const referenceAt: (buffer: CommandBuffer, k: number) => number;
+export declare const endOf: (buffer: CommandBuffer, command: number) => number;
+/**
+ * Commands for a kernel, writing straight into a buffer: `ids` maps the kernel's key indexes to component ids, and
+ * `starts` to what each starts at, written for an `undefined` value. `target.buffer` may be replaced between calls.
+ * `spawners` stage the kernel's spawns, by spawn list.
+ */
+export declare const createKernelCommands: (target: {
+    readonly buffer: CommandBuffer;
+}, ids: readonly number[], starts: readonly unknown[], spawners: readonly Positional[]) => KernelCommands;