@adobe/ecs 0.0.0-stage → 0.1.0

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;

package/dist/implementation/world/buffer.js

@@ -0,0 +1,105 @@
+import { viewsOf } from '../../interface/registry/layout.js';
+export const spawnCommand = 0;
+export const despawnCommand = 1;
+export const addCommand = 2;
+export const removeCommand = 3;
+export const createBuffer = (capacity = 16) => ({
+    count: 0,
+    kinds: new Uint8Array(capacity),
+    shapes: new Int32Array(capacity),
+    entities: new Float64Array(capacity),
+    starts: new Int32Array(capacity),
+    named: 0,
+    ids: new Int32Array(capacity * 4),
+    values: [],
+    bytes: null,
+    offsets: new Int32Array(0),
+    staged: [],
+    stagedCount: 0,
+});
+/** No commands; never written. */
+export const emptyBuffer = createBuffer(0);
+export const clearBuffer = (buffer) => {
+    // Releases values for collection; the arrays keep their storage for the next run.
+    buffer.values.fill(undefined, 0, buffer.named);
+    buffer.bytes = null;
+    buffer.count = 0;
+    buffer.named = 0;
+    buffer.stagedCount = 0;
+};
+/** Adds rows `start` to `end` of a batch to the buffer's staged spawns. */
+export const stage = (buffer, batch, start, end) => {
+    const entry = buffer.staged[buffer.stagedCount];
+    if (entry === undefined)
+        buffer.staged.push({ batch, start, end });
+    else {
+        entry.batch = batch;
+        entry.start = start;
+        entry.end = end;
+    }
+    buffer.stagedCount++;
+};
+const grown = (array, create) => {
+    const larger = create(array.length * 2);
+    larger.set(array);
+    return larger;
+};
+/** Starts a command; name its components with `pushComponent` right after. */
+/** Room for more commands: outlined, so `pushCommand` stays small enough to inline into the systems issuing them. */
+const growCommands = (buffer) => {
+    buffer.kinds = grown(buffer.kinds, length => new Uint8Array(length));
+    buffer.shapes = grown(buffer.shapes, length => new Int32Array(length));
+    buffer.entities = grown(buffer.entities, length => new Float64Array(length));
+    buffer.starts = grown(buffer.starts, length => new Int32Array(length));
+};
+export const pushCommand = (buffer, kind, entity) => {
+    if (buffer.count === buffer.kinds.length)
+        growCommands(buffer);
+    buffer.kinds[buffer.count] = kind;
+    buffer.shapes[buffer.count] = -1;
+    buffer.entities[buffer.count] = entity;
+    buffer.starts[buffer.count] = buffer.named;
+    buffer.count++;
+};
+export const pushComponent = (buffer, id, value) => {
+    if (buffer.named === buffer.ids.length)
+        buffer.ids = grown(buffer.ids, length => new Int32Array(length));
+    buffer.ids[buffer.named] = id;
+    buffer.values[buffer.named] = value;
+    buffer.named++;
+};
+/** A component value read out of bytes in a general layout, copied to row 0 here first; grown for larger layouts. */
+let scratch = viewsOf(new ArrayBuffer(256), 0, 256);
+/** Component `k`'s value: as given, or decoded from its bytes. */
+export const valueAt = (buffer, k, layouts) => {
+    const { bytes } = buffer;
+    if (bytes === null || buffer.offsets[k] < 0)
+        return buffer.values[k];
+    const layout = layouts[buffer.ids[k]];
+    if (layout.kind !== "linear")
+        return undefined;
+    const { stride } = layout;
+    if (stride > scratch.u8.length)
+        scratch = viewsOf(new ArrayBuffer(stride * 2), 0, stride * 2);
+    const offset = buffer.offsets[k];
+    scratch.u8.set(bytes.u8.subarray(offset, offset + stride));
+    return layout.read(scratch, 0);
+};
+/** Component `k`'s value as a reference, an entity: one f64 in its bytes. */
+export const referenceAt = (buffer, k) => {
+    const { bytes } = buffer;
+    return bytes === null || buffer.offsets[k] < 0 ? Number(buffer.values[k]) : bytes.f64[buffer.offsets[k] >> 3];
+};
+export const endOf = (buffer, command) => command + 1 < buffer.count ? buffer.starts[command + 1] : buffer.named;
+/**
+ * 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 const createKernelCommands = (target, ids, starts, spawners) => ({
+    spawners,
+    begin: (kind, entity) => pushCommand(target.buffer, kind, entity),
+    value: (key, value) => pushComponent(target.buffer, ids[key], value === undefined ? starts[key] : value),
+    component: key => pushComponent(target.buffer, ids[key], undefined),
+});
+//# sourceMappingURL=buffer.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"buffer.js","sourceRoot":"","sources":["../../../src/implementation/world/buffer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAA2B,MAAM,oCAAoC,CAAC;AAItF,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAC;AAC9B,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC;AAChC,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAAC;AAC5B,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAC;AAgC/B,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,QAAQ,GAAG,EAAE,EAAiB,EAAE,CAAC,CAAC;IAC3D,KAAK,EAAE,CAAC;IACR,KAAK,EAAE,IAAI,UAAU,CAAC,QAAQ,CAAC;IAC/B,MAAM,EAAE,IAAI,UAAU,CAAC,QAAQ,CAAC;IAChC,QAAQ,EAAE,IAAI,YAAY,CAAC,QAAQ,CAAC;IACpC,MAAM,EAAE,IAAI,UAAU,CAAC,QAAQ,CAAC;IAChC,KAAK,EAAE,CAAC;IACR,GAAG,EAAE,IAAI,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC;IACjC,MAAM,EAAE,EAAE;IACV,KAAK,EAAE,IAAI;IACX,OAAO,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC;IAC1B,MAAM,EAAE,EAAE;IACV,WAAW,EAAE,CAAC;CACjB,CAAC,CAAC;AAEH,kCAAkC;AAClC,MAAM,CAAC,MAAM,WAAW,GAAkB,YAAY,CAAC,CAAC,CAAC,CAAC;AAE1D,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,MAAqB,EAAQ,EAAE;IACvD,kFAAkF;IAClF,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;IAC/C,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC;AAC3B,CAAC,CAAC;AAEF,2EAA2E;AAC3E,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,MAAqB,EAAE,KAAiB,EAAE,KAAa,EAAE,GAAW,EAAQ,EAAE;IAChG,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IAChD,IAAI,KAAK,KAAK,SAAS;QAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;SAC9D,CAAC;QACF,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;QACpB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;QACpB,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC;IACpB,CAAC;IACD,MAAM,CAAC,WAAW,EAAE,CAAC;AACzB,CAAC,CAAC;AAEF,MAAM,KAAK,GAAG,CAAmD,KAAQ,EAAE,MAA6B,EAAK,EAAE;IAC3G,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACxC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAClB,OAAO,MAAM,CAAC;AAClB,CAAC,CAAC;AAEF,8EAA8E;AAC9E,qHAAqH;AACrH,MAAM,YAAY,GAAG,CAAC,MAAqB,EAAQ,EAAE;IACjD,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;IACrE,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;IACvE,MAAM,CAAC,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7E,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;AAC3E,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,MAAqB,EAAE,IAAY,EAAE,MAAc,EAAQ,EAAE;IACrF,IAAI,MAAM,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,CAAC,MAAM;QAAE,YAAY,CAAC,MAAM,CAAC,CAAC;IAC/D,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;IAClC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACjC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;IACvC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC;IAC3C,MAAM,CAAC,KAAK,EAAE,CAAC;AACnB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,MAAqB,EAAE,EAAU,EAAE,KAAc,EAAQ,EAAE;IACrF,IAAI,MAAM,CAAC,KAAK,KAAK,MAAM,CAAC,GAAG,CAAC,MAAM;QAAE,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;IACzG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;IAC9B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IACpC,MAAM,CAAC,KAAK,EAAE,CAAC;AACnB,CAAC,CAAC;AAEF,qHAAqH;AACrH,IAAI,OAAO,GAAG,OAAO,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;AAEpD,kEAAkE;AAClE,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,MAAqB,EAAE,CAAS,EAAE,OAA0B,EAAW,EAAE;IAC7F,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;IACzB,IAAI,KAAK,KAAK,IAAI,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;QAAE,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACrE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAC;IAC/C,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;IAC1B,IAAI,MAAM,GAAG,OAAO,CAAC,EAAE,CAAC,MAAM;QAAE,OAAO,GAAG,OAAO,CAAC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;IAC9F,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjC,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;IAC3D,OAAO,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;AACnC,CAAC,CAAC;AAEF,6EAA6E;AAC7E,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,MAAqB,EAAE,CAAS,EAAU,EAAE;IACpE,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;IACzB,OAAO,KAAK,KAAK,IAAI,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAClH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,MAAqB,EAAE,OAAe,EAAU,EAAE,CACpE,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;AAE3E;;;;GAIG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,MAA0C,EAAE,GAAsB,EAAE,MAA0B,EAAE,QAA+B,EAAkB,EAAE,CAAC,CAAC;IACtL,QAAQ;IACR,KAAK,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC;IACjE,KAAK,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IACxG,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC;CACtE,CAAC,CAAC"}

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

@@ -0,0 +1,28 @@
+import type { Archetype } from './archetype.js';
+import { type State } from './state.js';
+import type { Queued } from './synchronize.js';
+/**
+ * A reference value written in this sync point: by spawn or add commands, or a batch spawn. `holder`, `component`
+ * and `target` triples, checked once the plan's despawns are known.
+ */
+export type Written = number[];
+/** The entry for a live entity, added unchanged if it has none; -1 for one that isn't alive or planned. */
+export type EntryOf = (entity: number) => number;
+/**
+ * Despawns the holders that own a reference to an entity that is despawned or never lives, and removes `weak`
+ * references to one, transitively, before rules close the plan. A holder acts only if its value once the plan applies
+ * names the target, so a reference pointed elsewhere in the same sync point is left alone.
+ */
+export declare const cascadeReferences: (state: State, queued: readonly Queued[], written: Written, entryOf: EntryOf) => void;
+/**
+ * The changes the plan makes to the holder index, read before it applies, while old and new values are both readable:
+ * `remove` and `add` as target, holder, component triples. A despawned target's holders each have a removal of their
+ * own, since every reference component despawns its holders or drops the reference.
+ */
+export type IndexChanges = {
+    readonly remove: number[];
+    readonly add: number[];
+};
+export declare const indexChangesOf: (state: State, queued: readonly Queued[], fromOf: (entry: number) => Archetype | null, bornRows: readonly (readonly [Archetype, number])[]) => IndexChanges;
+/** Applies index changes after the plan applies. */
+export declare const applyIndexChanges: (state: State, changes: IndexChanges) => void;

package/dist/implementation/world/cascade.js

@@ -0,0 +1,139 @@
+import { readCell } from './cells.js';
+import { indexOf, locate } from './entities.js';
+import { commandValue, isMissing } from './finalizers.js';
+import { createHolders, fitHolders, forEachHolder, linkHolder, unlinkHolder } from './holders.js';
+import { closureOf, owner } from './structure.js';
+import { archetypeOf, withoutComponent } from './state.js';
+/** The value an entity holds for `component` once the plan applies, or undefined if it won't hold one. */
+const finalValue = (state, queued, holder, component) => {
+    const { plan, entities, archetypes } = state;
+    const entry = plan.slots[indexOf(holder)] ?? -1;
+    if (entry >= 0 && plan.entity[entry] === holder) {
+        if (plan.despawned[entry] === 1 || archetypes[plan.to[entry]].storageById[component] === undefined)
+            return undefined;
+        const value = commandValue(state, queued, entry, component);
+        if (!isMissing(value))
+            return value;
+    }
+    const index = locate(entities, holder);
+    if (index < 0)
+        return undefined;
+    const storage = archetypes[entities.archetype[index]].storageById[component];
+    return storage === undefined ? undefined : readCell(storage, entities.row[index]);
+};
+/** Whether `target` is alive once the plan applies: live or spawned here, and not despawned. */
+const aliveAfter = (state, target) => {
+    const { plan, entities } = state;
+    const index = indexOf(target);
+    const entry = index < plan.slots.length ? plan.slots[index] : -1;
+    if (entry >= 0 && plan.entity[entry] === target)
+        return plan.despawned[entry] === 0;
+    return locate(entities, target) >= 0;
+};
+/**
+ * Despawns the holders that own a reference to an entity that is despawned or never lives, and removes `weak`
+ * references to one, transitively, before rules close the plan. A holder acts only if its value once the plan applies
+ * names the target, so a reference pointed elsewhere in the same sync point is left alone.
+ */
+export const cascadeReferences = (state, queued, written, entryOf) => {
+    const { plan, structure, archetypes } = state;
+    const despawned = [];
+    for (let entry = 0; entry < plan.count; entry++)
+        if (plan.despawned[entry] === 1)
+            despawned.push(plan.entity[entry]);
+    const act = (holder, component) => {
+        const entry = entryOf(holder);
+        if (entry < 0 || plan.despawned[entry] === 1)
+            return;
+        if (structure.references[component] === owner) {
+            plan.despawned[entry] = 1;
+            despawned.push(holder);
+            return;
+        }
+        const to = withoutComponent(state, archetypes[plan.to[entry]], component);
+        plan.to[entry] = closureOf(structure, state.derived, to, components => archetypeOf(state, components), archetypes).id;
+    };
+    let checked = 0;
+    for (let next = 0; next < despawned.length || checked < written.length;) {
+        for (; next < despawned.length; next++) {
+            const target = despawned[next];
+            for (const component of structure.referenceIds) {
+                const lists = structure.holders[component];
+                if (lists === undefined)
+                    continue;
+                forEachHolder(lists, target, holder => {
+                    if (finalValue(state, queued, holder, component) === target)
+                        act(holder, component);
+                });
+            }
+        }
+        // A reference written here to an entity that won't be alive is as dangling as one whose target despawns.
+        for (; checked < written.length; checked += 3) {
+            const holder = written[checked];
+            const component = written[checked + 1];
+            const target = written[checked + 2];
+            // `Entity.none` names no entity, so a reference to it isn't dangling.
+            if (target !== 0 && finalValue(state, queued, holder, component) === target && !aliveAfter(state, target))
+                act(holder, component);
+        }
+    }
+};
+export const indexChangesOf = (state, queued, fromOf, bornRows) => {
+    const { plan, structure, entities } = state;
+    const changes = { remove: [], add: [] };
+    for (let entry = 0; entry < plan.count; entry++) {
+        const holder = plan.entity[entry];
+        const from = fromOf(entry);
+        for (const component of structure.referenceIds) {
+            const storage = from?.storageById[component];
+            const before = storage === undefined ? undefined : readCell(storage, entities.row[indexOf(holder)]);
+            const after = plan.despawned[entry] === 1 ? undefined : finalValue(state, queued, holder, component);
+            if (before === after)
+                continue;
+            if (typeof before === "number" && before !== 0)
+                changes.remove.push(before, holder, component);
+            if (typeof after === "number" && after !== 0)
+                changes.add.push(after, holder, component);
+        }
+    }
+    // Batch spawns no command touched still hold the references they were spawned with. An entity is one f64.
+    const { slots } = plan;
+    for (const [archetype, first] of bornRows) {
+        for (const component of structure.referenceIds) {
+            const storage = archetype.storageById[component];
+            if (storage === undefined)
+                continue;
+            const { unitStride, unitOffset } = storage;
+            const values = storage.views.f64;
+            const rows = archetype.entities;
+            for (let row = first; row < archetype.count; row++) {
+                const holder = rows[row];
+                const index = indexOf(holder);
+                if (index < slots.length && slots[index] >= 0)
+                    continue;
+                const value = values[row * unitStride + unitOffset];
+                if (value !== 0)
+                    changes.add.push(value, holder, component);
+            }
+        }
+    }
+    return changes;
+};
+/** Applies index changes after the plan applies. */
+export const applyIndexChanges = (state, changes) => {
+    const { holders } = state.structure;
+    const { remove, add } = changes;
+    for (let c = 0; c < remove.length; c += 3) {
+        const lists = holders[remove[c + 2]];
+        if (lists !== undefined)
+            unlinkHolder(lists, remove[c], remove[c + 1]);
+    }
+    const length = state.entities.length;
+    for (let c = 0; c < add.length; c += 3) {
+        const component = add[c + 2];
+        const lists = holders[component] ??= createHolders();
+        fitHolders(lists, length);
+        linkHolder(lists, add[c], add[c + 1]);
+    }
+};
+//# sourceMappingURL=cascade.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cascade.js","sourceRoot":"","sources":["../../../src/implementation/world/cascade.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC1D,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,aAAa,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAClG,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAc,MAAM,YAAY,CAAC;AAYvE,0GAA0G;AAC1G,MAAM,UAAU,GAAG,CAAC,KAAY,EAAE,MAAyB,EAAE,MAAc,EAAE,SAAiB,EAAW,EAAE;IACvG,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,KAAK,CAAC;IAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAChD,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,MAAM,EAAE,CAAC;QAC9C,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACrH,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC5D,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;IACxC,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IACvC,IAAI,KAAK,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IAChC,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;IAC7E,OAAO,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;AACtF,CAAC,CAAC;AAEF,gGAAgG;AAChG,MAAM,UAAU,GAAG,CAAC,KAAY,EAAE,MAAc,EAAW,EAAE;IACzD,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IACjC,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACpF,OAAO,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;AACzC,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,KAAY,EAAE,MAAyB,EAAE,OAAgB,EAAE,OAAgB,EAAQ,EAAE;IACnH,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,KAAK,CAAC;IAC9C,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE;QAAE,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC;YAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IACrH,MAAM,GAAG,GAAG,CAAC,MAAc,EAAE,SAAiB,EAAQ,EAAE;QACpD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;QAC9B,IAAI,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC;YAAE,OAAO;QACrD,IAAI,SAAS,CAAC,UAAU,CAAC,SAAS,CAAC,KAAK,KAAK,EAAE,CAAC;YAC5C,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC1B,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,OAAO;QACX,CAAC;QACD,MAAM,EAAE,GAAG,gBAAgB,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QAC1E,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC,SAAS,EAAE,KAAK,CAAC,OAAO,EAAE,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,UAAU,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC;IAC1H,CAAC,CAAC;IACF,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,SAAS,CAAC,MAAM,IAAI,OAAO,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC;QACtE,OAAO,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;YAC/B,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,YAAY,EAAE,CAAC;gBAC7C,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC3C,IAAI,KAAK,KAAK,SAAS;oBAAE,SAAS;gBAClC,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE;oBAClC,IAAI,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,KAAK,MAAM;wBAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;gBACxF,CAAC,CAAC,CAAC;YACP,CAAC;QACL,CAAC;QACD,yGAAyG;QACzG,OAAO,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC;YAC5C,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;YAChC,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;YACvC,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;YACpC,sEAAsE;YACtE,IAAI,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,KAAK,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC;gBAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QACtI,CAAC;IACL,CAAC;AACL,CAAC,CAAC;AASF,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,KAAY,EAAE,MAAyB,EAAE,MAA2C,EAAE,QAAmD,EAAgB,EAAE;IACtL,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IAC5C,MAAM,OAAO,GAAiB,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;IACtD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC;QAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC3B,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,YAAY,EAAE,CAAC;YAC7C,MAAM,OAAO,GAAG,IAAI,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC;YAC7C,MAAM,MAAM,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACpG,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;YACrG,IAAI,MAAM,KAAK,KAAK;gBAAE,SAAS;YAC/B,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,CAAC;gBAAE,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;YAC/F,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,CAAC;gBAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;QAC7F,CAAC;IACL,CAAC;IACD,0GAA0G;IAC1G,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;IACvB,KAAK,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;QACxC,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,YAAY,EAAE,CAAC;YAC7C,MAAM,OAAO,GAAG,SAAS,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;YACjD,IAAI,OAAO,KAAK,SAAS;gBAAE,SAAS;YACpC,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC;YAC3C,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC;YACjC,MAAM,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC;YAChC,KAAK,IAAI,GAAG,GAAG,KAAK,EAAE,GAAG,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC;gBACjD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;gBACzB,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC9B,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;oBAAE,SAAS;gBACxD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,GAAG,UAAU,GAAG,UAAU,CAAC,CAAC;gBACpD,IAAI,KAAK,KAAK,CAAC;oBAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;YAChE,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,OAAO,CAAC;AACnB,CAAC,CAAC;AAEF,oDAAoD;AACpD,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,KAAY,EAAE,OAAqB,EAAQ,EAAE;IAC3E,MAAM,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC,SAAS,CAAC;IACpC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,OAAO,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,KAAK,KAAK,SAAS;YAAE,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3E,CAAC;IACD,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACrC,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC,KAAK,aAAa,EAAE,CAAC;QACrD,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC1B,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;AACL,CAAC,CAAC"}

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

@@ -0,0 +1,7 @@
+import type { Storage } from './archetype.js';
+/** Where a value is: a storage, or a joined thread's view of one. */
+export type Cell = Pick<Storage, "layout" | "views" | "values" | "strings">;
+/** A component value, copied out of linear storage. */
+export declare const readCell: (storage: Cell, row: number) => unknown;
+/** Replaces a component value. Doesn't touch ticks. */
+export declare const writeCell: (storage: Cell, row: number, value: unknown) => void;

package/dist/implementation/world/cells.js

@@ -0,0 +1,22 @@
+import { readString, writeString } from './strings.js';
+/** A component value, copied out of linear storage. */
+export const readCell = (storage, row) => {
+    const { layout } = storage;
+    switch (layout.kind) {
+        case "linear": return layout.read(storage.views, row);
+        case "string": return readString(storage, row);
+        case "object": return storage.values[row];
+        default: return layout.value;
+    }
+};
+/** Replaces a component value. Doesn't touch ticks. */
+export const writeCell = (storage, row, value) => {
+    const { layout } = storage;
+    if (layout.kind === "linear")
+        layout.write(storage.views, row, value);
+    else if (layout.kind === "string")
+        writeString(storage, row, value);
+    else if (layout.kind === "object")
+        storage.values[row] = value;
+};
+//# sourceMappingURL=cells.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cells.js","sourceRoot":"","sources":["../../../src/implementation/world/cells.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAKvD,uDAAuD;AACvD,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,OAAa,EAAE,GAAW,EAAW,EAAE;IAC5D,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;IAC3B,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ,CAAC,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACtD,KAAK,QAAQ,CAAC,CAAC,OAAO,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QAC/C,KAAK,QAAQ,CAAC,CAAC,OAAO,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1C,OAAO,CAAC,CAAC,OAAO,MAAM,CAAC,KAAK,CAAC;IACjC,CAAC;AACL,CAAC,CAAC;AAEF,uDAAuD;AACvD,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,OAAa,EAAE,GAAW,EAAE,KAAc,EAAQ,EAAE;IAC1E,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;IAC3B,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;QAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;SACjE,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;QAAE,WAAW,CAAC,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;SAC/D,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;AACnE,CAAC,CAAC"}

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

@@ -0,0 +1,10 @@
+import type { Leaf } from '../../interface/system/leaf.js';
+import type { KernelDescription } from './kernel.js';
+/**
+ * Checks a compiled kernel against its declaration and the registered schemas, which don't depend on a world, so
+ * registering the kernel rejects it where it's declared: every column, whole-value write, lookup, `up` read and
+ * reduction it uses is declared, and names scalar leaves of its component's schema, each spawn site names each of its
+ * components once, from its keys, and a tuple or struct a command or spawn gives goes to a component stored in linear
+ * memory. Throws with the first mismatch.
+ */
+export declare const checkKernel: (leaf: Leaf, description: KernelDescription) => void;

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

@@ -0,0 +1,102 @@
+import { declarationOf, labelOf, labelOfItem } from '../../interface/registry/index.js';
+import { layoutOf, samePath } from '../../interface/registry/layout.js';
+/**
+ * A key's layout, or null for one this copy of the package didn't register, as a library bundling its own copy
+ * registers its keys: a world binding the kernel checks those.
+ */
+const layoutOfKey = (key) => {
+    const declaration = declarationOf(key);
+    return declaration === undefined ? null : layoutOf(declaration.type);
+};
+/** Whether `path` names a scalar leaf of `layout`; true for an unknown layout. */
+const hasLeaf = (layout, path) => layout === null || (layout.kind === "linear" && layout.leaves.some(leaf => samePath(leaf.path, path)));
+/** Whether `leaves` are every scalar leaf of `layout`, each once; true for an unknown layout. */
+const exactly = (layout, leaves) => {
+    if (layout === null)
+        return true;
+    const own = layout.kind === "linear" ? layout.leaves : [];
+    return own.length === leaves.length && own.every(leaf => leaves.some(path => samePath(path, leaf.path)));
+};
+/**
+ * Checks a compiled kernel against its declaration and the registered schemas, which don't depend on a world, so
+ * registering the kernel rejects it where it's declared: every column, whole-value write, lookup, `up` read and
+ * reduction it uses is declared, and names scalar leaves of its component's schema, each spawn site names each of its
+ * components once, from its keys, and a tuple or struct a command or spawn gives goes to a component stored in linear
+ * memory. Throws with the first mismatch.
+ */
+export const checkKernel = (leaf, description) => {
+    const { lookup, components: query, resources, up, reduce } = leaf.declaration;
+    const fail = (message) => { throw new Error(`Kernel "${labelOfItem(leaf)}": ${message}`); };
+    const queried = new Set([...query?.read ?? [], ...query?.write ?? []]);
+    const written = new Set(query?.write);
+    // A condition in `is` is readable too, and the compiler lists it with the reads.
+    const readable = new Set([...resources?.read ?? [], ...resources?.is ?? []]);
+    for (const key of description.resources)
+        if (!readable.has(key))
+            fail(`reads resource "${labelOf(key)}", which isn't in resources.read.`);
+    for (const column of description.columns) {
+        if (column.kind === "entity")
+            continue;
+        if (!queried.has(column.component))
+            fail(`"${labelOf(column.component)}" isn't in its components' read or write.`);
+        if (column.kind === "changed" || column.kind === "chunks") {
+            if (!written.has(column.component))
+                fail(`writes "${labelOf(column.component)}", which isn't in its components' write.`);
+            continue;
+        }
+        const layout = layoutOfKey(column.component);
+        if (layout !== null && layout.kind !== "linear")
+            fail(`"${labelOf(column.component)}" isn't stored in linear memory.`);
+        if (!hasLeaf(layout, column.path))
+            fail(`"${labelOf(column.component)}" has no scalar at [${column.path.join(", ")}]; destructure tuples and structs or index their fields.`);
+    }
+    for (const shape of description.shapes) {
+        if (!written.has(shape.component))
+            fail(`writes "${labelOf(shape.component)}", which isn't in its components' write.`);
+        if (!exactly(layoutOfKey(shape.component), shape.leaves))
+            fail(`a whole-value write of "${labelOf(shape.component)}" doesn't match its schema.`);
+    }
+    for (const lookupName of description.lookups)
+        if (lookup?.[lookupName] === undefined)
+            fail(`unknown lookup "${lookupName}".`);
+    if ((description.up === true) !== (up !== undefined))
+        fail(description.up === true ? "reads up, which its declaration doesn't declare." : "its declaration declares up, which it doesn't read.");
+    const upReadable = new Set(up?.read);
+    for (const column of description.upColumns ?? []) {
+        if (column.kind !== "field" || !upReadable.has(column.component))
+            fail(`reads "${labelOf(column.kind === "field" ? column.component : column.kind)}" through up, which isn't in up.read.`);
+        if (column.kind !== "field")
+            continue;
+        const layout = layoutOfKey(column.component);
+        if (layout !== null && layout.kind !== "linear")
+            fail(`up reads "${labelOf(column.component)}", which isn't stored in linear memory.`);
+        if (!hasLeaf(layout, column.path))
+            fail(`"${labelOf(column.component)}" has no scalar at [${column.path.join(", ")}]; destructure tuples and structs or index their fields.`);
+    }
+    for (const reduced of description.reductions) {
+        if (Reflect.get(reduce ?? {}, reduced.resource) !== reduced.operator)
+            fail(`reduces "${labelOf(reduced.resource)}" with "${reduced.operator}", which its reduce doesn't declare.`);
+        if (!hasLeaf(layoutOfKey(reduced.resource), reduced.path))
+            fail(`contributes to "${labelOf(reduced.resource)}" at [${reduced.path.join(", ")}], which isn't a scalar of its value; destructure tuples and structs or build them.`);
+    }
+    for (const list of description.spawns) {
+        list.forEach((k, position) => {
+            if (!Number.isInteger(k) || k < 0 || k >= description.keys.length)
+                fail(`spawns a list naming component ${k} of its ${description.keys.length} keys.`);
+            if (list.findIndex(other => description.keys[other] === description.keys[k]) < position)
+                fail(`spawns a list naming "${labelOf(description.keys[k])}" twice.`);
+        });
+    }
+    for (const k of description.structuredValues) {
+        const key = description.keys[k];
+        const layout = key === undefined ? null : layoutOfKey(key);
+        if (layout !== null && layout.kind !== "linear")
+            fail(`gives "${labelOf(key)}" a tuple or struct, which only a component stored in linear memory takes.`);
+    }
+    for (const shape of description.reducedShapes) {
+        if (Reflect.get(reduce ?? {}, shape.component) === undefined || !exactly(layoutOfKey(shape.component), shape.leaves)) {
+            fail(`contributes a value to "${labelOf(shape.component)}" that doesn't match its schema.`);
+        }
+    }
+};
+//# sourceMappingURL=check-kernel.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"check-kernel.js","sourceRoot":"","sources":["../../../src/implementation/world/check-kernel.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,mCAAmC,CAAC;AACxF,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAA0B,MAAM,oCAAoC,CAAC;AAKhG;;;GAGG;AACH,MAAM,WAAW,GAAG,CAAC,GAAQ,EAAiB,EAAE;IAC5C,MAAM,WAAW,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;IACvC,OAAO,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;AACzE,CAAC,CAAC;AAEF,kFAAkF;AAClF,MAAM,OAAO,GAAG,CAAC,MAAqB,EAAE,IAAU,EAAW,EAAE,CAAC,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;AAEvK,iGAAiG;AACjG,MAAM,OAAO,GAAG,CAAC,MAAqB,EAAE,MAAuB,EAAW,EAAE;IACxE,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACjC,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1D,OAAO,GAAG,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAC7G,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,IAAU,EAAE,WAA8B,EAAQ,EAAE;IAC5E,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;IAC9E,MAAM,IAAI,GAAG,CAAC,OAAe,EAAS,EAAE,GAAG,MAAM,IAAI,KAAK,CAAC,WAAW,WAAW,CAAC,IAAI,CAAC,MAAM,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3G,MAAM,OAAO,GAAG,IAAI,GAAG,CAAM,CAAC,GAAG,KAAK,EAAE,IAAI,IAAI,EAAE,EAAE,GAAG,KAAK,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;IAC5E,MAAM,OAAO,GAAG,IAAI,GAAG,CAAM,KAAK,EAAE,KAAK,CAAC,CAAC;IAC3C,iFAAiF;IACjF,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAM,CAAC,GAAG,SAAS,EAAE,IAAI,IAAI,EAAE,EAAE,GAAG,SAAS,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAClF,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,SAAS;QAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,IAAI,CAAC,mBAAmB,OAAO,CAAC,GAAG,CAAC,mCAAmC,CAAC,CAAC;IAC1I,KAAK,MAAM,MAAM,IAAI,WAAW,CAAC,OAAO,EAAE,CAAC;QACvC,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;YAAE,SAAS;QACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC;YAAE,IAAI,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,2CAA2C,CAAC,CAAC;QACnH,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACxD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC;gBAAE,IAAI,CAAC,WAAW,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,0CAA0C,CAAC,CAAC;YACzH,SAAS;QACb,CAAC;QACD,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC7C,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;YAAE,IAAI,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,kCAAkC,CAAC,CAAC;QACvH,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,uBAAuB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,0DAA0D,CAAC,CAAC;IAClL,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;QACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC;YAAE,IAAI,CAAC,WAAW,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,0CAA0C,CAAC,CAAC;QACvH,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC;YAAE,IAAI,CAAC,2BAA2B,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,6BAA6B,CAAC,CAAC;IACrJ,CAAC;IACD,KAAK,MAAM,UAAU,IAAI,WAAW,CAAC,OAAO;QAAE,IAAI,MAAM,EAAE,CAAC,UAAU,CAAC,KAAK,SAAS;YAAE,IAAI,CAAC,mBAAmB,UAAU,IAAI,CAAC,CAAC;IAC9H,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,SAAS,CAAC;QAAE,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,kDAAkD,CAAC,CAAC,CAAC,qDAAqD,CAAC,CAAC;IACjM,MAAM,UAAU,GAAG,IAAI,GAAG,CAAM,EAAE,EAAE,IAAI,CAAC,CAAC;IAC1C,KAAK,MAAM,MAAM,IAAI,WAAW,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;QAC/C,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC;YAAE,IAAI,CAAC,UAAU,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,uCAAuC,CAAC,CAAC;QAC3L,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO;YAAE,SAAS;QACtC,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC7C,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;YAAE,IAAI,CAAC,aAAa,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,yCAAyC,CAAC,CAAC;QACvI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,uBAAuB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,0DAA0D,CAAC,CAAC;IAClL,CAAC;IACD,KAAK,MAAM,OAAO,IAAI,WAAW,CAAC,UAAU,EAAE,CAAC;QAC3C,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE,EAAE,OAAO,CAAC,QAAQ,CAAC,KAAK,OAAO,CAAC,QAAQ;YAAE,IAAI,CAAC,YAAY,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,OAAO,CAAC,QAAQ,sCAAsC,CAAC,CAAC;QACnL,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,mBAAmB,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,qFAAqF,CAAC,CAAC;IACvO,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE;YACzB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM;gBAAE,IAAI,CAAC,kCAAkC,CAAC,WAAW,WAAW,CAAC,IAAI,CAAC,MAAM,QAAQ,CAAC,CAAC;YACvJ,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ;gBAAE,IAAI,CAAC,yBAAyB,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QACnK,CAAC,CAAC,CAAC;IACP,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,gBAAgB,EAAE,CAAC;QAC3C,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,MAAM,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC3D,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;YAAE,IAAI,CAAC,UAAU,OAAO,CAAC,GAAG,CAAC,4EAA4E,CAAC,CAAC;IAC9J,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,aAAa,EAAE,CAAC;QAC5C,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE,EAAE,KAAK,CAAC,SAAS,CAAC,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;YACnH,IAAI,CAAC,2BAA2B,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,kCAAkC,CAAC,CAAC;QAChG,CAAC;IACL,CAAC;AACL,CAAC,CAAC"}

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

@@ -0,0 +1,13 @@
+/**
+ * Pieces of a claimed split, as a home range per participant: one Int32 per participant, each on its own cache line,
+ * holding its next piece (`front`, low 16 bits) and the end of its range (`back`, high 16 bits). An owner takes pieces
+ * from its front, in order, so it streams forward through rows it ran last tier; a participant whose range is empty
+ * steals from the back of the fullest other range, so owner and thief meet only at the end. Every change is one
+ * compare-and-swap of the whole word, so a piece is claimed exactly once.
+ */
+/** Split pieces into at most 32767, so a range's bounds fit its word. */
+export declare const maximumPieces = 32767;
+/** Gives each of `participants` an equal home range of `pieces`, in order. */
+export declare const startRanges: (words: Int32Array, participants: number, pieces: number) => void;
+/** Claims the next piece for participant `self`: its own front, else the back of the fullest other range; -1 once none are left. */
+export declare const claimPiece: (words: Int32Array, self: number, participants: number) => number;

package/dist/implementation/world/claims.js

@@ -0,0 +1,50 @@
+import { lineWords } from './protocol.js';
+/**
+ * Pieces of a claimed split, as a home range per participant: one Int32 per participant, each on its own cache line,
+ * holding its next piece (`front`, low 16 bits) and the end of its range (`back`, high 16 bits). An owner takes pieces
+ * from its front, in order, so it streams forward through rows it ran last tier; a participant whose range is empty
+ * steals from the back of the fullest other range, so owner and thief meet only at the end. Every change is one
+ * compare-and-swap of the whole word, so a piece is claimed exactly once.
+ */
+/** Split pieces into at most 32767, so a range's bounds fit its word. */
+export const maximumPieces = 0x7fff;
+const rangeWord = (front, back) => (back << 16) | front;
+/** Gives each of `participants` an equal home range of `pieces`, in order. */
+export const startRanges = (words, participants, pieces) => {
+    for (let i = 0; i < participants; i++) {
+        Atomics.store(words, i * lineWords, rangeWord(Math.floor(i * pieces / participants), Math.floor((i + 1) * pieces / participants)));
+    }
+};
+/** Claims the next piece for participant `self`: its own front, else the back of the fullest other range; -1 once none are left. */
+export const claimPiece = (words, self, participants) => {
+    for (;;) {
+        const own = Atomics.load(words, self * lineWords);
+        const front = own & 0xffff;
+        const back = own >>> 16;
+        if (front < back) {
+            if (Atomics.compareExchange(words, self * lineWords, own, rangeWord(front + 1, back)) === own)
+                return front;
+            continue;
+        }
+        let victim = -1;
+        let most = 0;
+        let word = 0;
+        for (let i = 0; i < participants; i++) {
+            if (i === self)
+                continue;
+            const other = Atomics.load(words, i * lineWords);
+            const left = (other >>> 16) - (other & 0xffff);
+            if (left > most) {
+                most = left;
+                victim = i;
+                word = other;
+            }
+        }
+        if (victim < 0)
+            return -1;
+        const last = (word >>> 16) - 1;
+        if (Atomics.compareExchange(words, victim * lineWords, word, rangeWord(word & 0xffff, last)) === word)
+            return last;
+    }
+};
+//# sourceMappingURL=claims.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"claims.js","sourceRoot":"","sources":["../../../src/implementation/world/claims.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAE1C;;;;;;GAMG;AAEH,yEAAyE;AACzE,MAAM,CAAC,MAAM,aAAa,GAAG,MAAM,CAAC;AAEpC,MAAM,SAAS,GAAG,CAAC,KAAa,EAAE,IAAY,EAAU,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC;AAEhF,8EAA8E;AAC9E,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAiB,EAAE,YAAoB,EAAE,MAAc,EAAQ,EAAE;IACzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,SAAS,EAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,GAAG,YAAY,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IACvI,CAAC;AACL,CAAC,CAAC;AAEF,oIAAoI;AACpI,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAiB,EAAE,IAAY,EAAE,YAAoB,EAAU,EAAE;IACxF,SAAS,CAAC;QACN,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,GAAG,SAAS,CAAC,CAAC;QAClD,MAAM,KAAK,GAAG,GAAG,GAAG,MAAM,CAAC;QAC3B,MAAM,IAAI,GAAG,GAAG,KAAK,EAAE,CAAC;QACxB,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC;YACf,IAAI,OAAO,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,GAAG,SAAS,EAAE,GAAG,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,GAAG;gBAAE,OAAO,KAAK,CAAC;YAC5G,SAAS;QACb,CAAC;QACD,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;QAChB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,KAAK,IAAI;gBAAE,SAAS;YACzB,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC;YACjD,MAAM,IAAI,GAAG,CAAC,KAAK,KAAK,EAAE,CAAC,GAAG,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC;YAC/C,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;gBACd,IAAI,GAAG,IAAI,CAAC;gBACZ,MAAM,GAAG,CAAC,CAAC;gBACX,IAAI,GAAG,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,IAAI,MAAM,GAAG,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC;QAC1B,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,OAAO,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;IACvH,CAAC;AACL,CAAC,CAAC"}

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

@@ -0,0 +1,12 @@
+/**
+ * Structural derivation: which components an archetype's entities have once rules and `within` are applied.
+ * Datalog with stratified negation over the components each entity has. A rule adds the components it derives where
+ * its query matches; a component declared within a host stays only while the host is present. Each stratum is a least
+ * fixed point, evaluated after every stratum it depends on, so the result is a pure function of the archetype.
+ */
+import type { Strata } from '../../interface/registry/strata.js';
+/**
+ * The sorted components an entity with `components` has once derived: derived components only where a rule derives
+ * them, and components within a host only where the host is.
+ */
+export declare const closedComponents: (components: readonly number[], derived: readonly boolean[], hosts: readonly number[], strata: Strata) => number[];