@adobe/ecs 0.1.0 → 0.2.0

package/dist/implementation/world/render-order.d.ts

@@ -0,0 +1,19 @@
+import type { RenderContext } from '../../interface/system/render.js';
+import type { Archetype } from './archetype.js';
+import type { GpuEngine } from './gpu.js';
+import type { Ordered } from './index-order.js';
+import type { WorldIndex } from './indexes.js';
+export type OrderedRender = {
+    /**
+     * Uploads what the run's one table reads; returns null, or the reason it can't be drawn: more matched archetypes
+     * and rows than an entry's 32 bits hold.
+     */
+    readonly prepare: (gpu: GpuEngine, matches: readonly Archetype[], tick: number) => string | null;
+    /** The body's context, once the work recorded before it is submitted. */
+    readonly context: (gpu: GpuEngine) => RenderContext;
+};
+/**
+ * `columns` are the accessors' component ids, in accessor order; `group` the bind group the shader declares; `key`
+ * the prefix of the runner's GPU records.
+ */
+export declare const createOrderedRender: (index: WorldIndex, ordered: Ordered, columns: readonly number[], group: number, key: string) => OrderedRender;

package/dist/implementation/world/render-order.js

@@ -0,0 +1,126 @@
+import { blockBase } from './index-sorted.js';
+/**
+ * `columns` are the accessors' component ids, in accessor order; `group` the bind group the shader declares; `key`
+ * the prefix of the runner's GPU records.
+ */
+export const createOrderedRender = (index, ordered, columns, group, key) => {
+    const width = columns.length;
+    const orderKey = `${key}order`;
+    const tablesKey = `${key}tables`;
+    const recordKey = `${key}ordered`;
+    let entries = new Int32Array(64);
+    let instances = 0;
+    let tables = new Int32Array(Math.max(1, width));
+    /** What the order block was last built from: the index's ticks, the matches, and the GPU it was written to. */
+    let builtChanged = -1;
+    let builtMoved = -1;
+    let builtMatches = -1;
+    let builtGpu = null;
+    let shift = 31;
+    const words = new Uint32Array(4);
+    let recorded = false;
+    const offsets = [0];
+    let bound = null;
+    const table = {
+        count: 0,
+        bind: pass => {
+            if (bound !== null)
+                pass.setBindGroup(group, bound.renderGroup(), offsets);
+        },
+    };
+    const list = [table];
+    let context = null;
+    /** Lists the index's entries of matched archetypes, in its order, as slot and row. */
+    const build = (matches) => {
+        const sorted = index.sorted;
+        instances = 0;
+        if (sorted === null)
+            return;
+        if (entries.length < sorted.size)
+            entries = new Int32Array(Math.max(sorted.size, 2 * entries.length));
+        const owners = ordered.owners(matches);
+        const known = owners.length;
+        const slotShift = shift;
+        const { order, lengths, stride, words: keyWords, blocks } = sorted;
+        const sortedEntries = sorted.entries;
+        for (let k = 0; k < blocks; k++) {
+            const block = order[k];
+            const base = blockBase(sorted, block) + keyWords;
+            for (let at = base, end = base + lengths[block] * stride; at < end; at += stride) {
+                const archetype = sortedEntries[at + 1];
+                const owner = archetype < known ? owners[archetype] : -1;
+                if (owner < 0)
+                    continue;
+                entries[instances++] = (owner << slotShift) | sortedEntries[at + 2];
+            }
+        }
+    };
+    const prepare = (gpu, matches, tick) => {
+        const slots = matches.length;
+        if (gpu !== builtGpu) {
+            builtGpu = gpu;
+            builtChanged = -1;
+            recorded = false;
+        }
+        // The tables block: every column's address, uploading rows the CPU changed first.
+        if (tables.length < slots * width) {
+            const grown = new Int32Array(Math.max(slots * width, 2 * tables.length));
+            grown.set(tables);
+            tables = grown;
+        }
+        let addressed = false;
+        let most = 0;
+        for (let slot = 0; slot < slots; slot++) {
+            const archetype = matches[slot];
+            const { count } = archetype;
+            if (count > most)
+                most = count;
+            for (let k = 0; k < width; k++) {
+                const storage = count === 0 ? undefined : archetype.storageById[columns[k]];
+                const address = storage === undefined ? 0 : gpu.upload(archetype, storage, tick);
+                const at = slot * width + k;
+                if (tables[at] !== address) {
+                    tables[at] = address;
+                    addressed = true;
+                }
+            }
+        }
+        if (slots !== builtMatches) {
+            // At least one bit of slot, so a row's mask is never 32 bits.
+            const slotBits = Math.max(1, Math.ceil(Math.log2(slots)));
+            shift = 32 - slotBits;
+            builtMatches = slots;
+            builtChanged = -1;
+        }
+        if (most > 2 ** shift)
+            return `with ${slots} matching archetypes an ordered table names at most ${2 ** shift} rows of each, and one holds ${most}`;
+        const rebuilt = index.changed !== builtChanged || index.moved !== builtMoved;
+        if (rebuilt) {
+            build(matches);
+            builtChanged = index.changed;
+            builtMoved = index.moved;
+        }
+        const orderAddress = gpu.uploadIndexes(orderKey, entries, instances, rebuilt);
+        const tablesAddress = gpu.uploadIndexes(tablesKey, tables, slots * width, addressed);
+        if (!recorded || words[0] !== instances || words[1] !== orderAddress || words[2] !== tablesAddress || words[3] !== shift) {
+            words[0] = instances;
+            words[1] = orderAddress;
+            words[2] = tablesAddress;
+            words[3] = shift;
+            offsets[0] = gpu.record(recordKey, words);
+            recorded = true;
+        }
+        bound = gpu;
+        table.count = instances;
+        return null;
+    };
+    const contextOf = (gpu) => {
+        if (context === null)
+            return context = { device: gpu.device, encoder: gpu.encoder(), tables: list };
+        context.device = gpu.device;
+        context.encoder = gpu.encoder();
+        return context;
+    };
+    return { prepare, context: contextOf };
+};
+//# sourceMappingURL=render-order.js.map

package/dist/implementation/world/render-order.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"render-order.js","sourceRoot":"","sources":["../../../src/implementation/world/render-order.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAwB9C;;;GAGG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,KAAiB,EAAE,OAAgB,EAAE,OAA0B,EAAE,KAAa,EAAE,GAAW,EAAiB,EAAE;IAC9I,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC;IAC7B,MAAM,QAAQ,GAAG,GAAG,GAAG,OAAO,CAAC;IAC/B,MAAM,SAAS,GAAG,GAAG,GAAG,QAAQ,CAAC;IACjC,MAAM,SAAS,GAAG,GAAG,GAAG,SAAS,CAAC;IAClC,IAAI,OAAO,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;IACjC,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAChD,+GAA+G;IAC/G,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;IACtB,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;IACpB,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;IACtB,IAAI,QAAQ,GAAqB,IAAI,CAAC;IACtC,IAAI,KAAK,GAAG,EAAE,CAAC;IACf,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IACjC,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,MAAM,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,KAAK,GAAqB,IAAI,CAAC;IACnC,MAAM,KAAK,GAAiB;QACxB,KAAK,EAAE,CAAC;QACR,IAAI,EAAE,IAAI,CAAC,EAAE;YACT,IAAI,KAAK,KAAK,IAAI;gBAAE,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,WAAW,EAAE,EAAE,OAAO,CAAC,CAAC;QAC/E,CAAC;KACJ,CAAC;IACF,MAAM,IAAI,GAA2B,CAAC,KAAK,CAAC,CAAC;IAC7C,IAAI,OAAO,GAA0B,IAAI,CAAC;IAE1C,sFAAsF;IACtF,MAAM,KAAK,GAAG,CAAC,OAA6B,EAAQ,EAAE;QAClD,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QAC5B,SAAS,GAAG,CAAC,CAAC;QACd,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO;QAC5B,IAAI,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC,IAAI;YAAE,OAAO,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;QACtG,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;QAC5B,MAAM,SAAS,GAAG,KAAK,CAAC;QACxB,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;QACnE,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,QAAQ,CAAC;YACjD,KAAK,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,GAAG,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,MAAM,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,IAAI,MAAM,EAAE,CAAC;gBAC/E,MAAM,SAAS,GAAG,aAAa,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACxC,MAAM,KAAK,GAAG,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzD,IAAI,KAAK,GAAG,CAAC;oBAAE,SAAS;gBACxB,OAAO,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,KAAK,IAAI,SAAS,CAAC,GAAG,aAAa,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACxE,CAAC;QACL,CAAC;IACL,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,CAAC,GAAc,EAAE,OAA6B,EAAE,IAAY,EAAiB,EAAE;QAC3F,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC;QAC7B,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;YACnB,QAAQ,GAAG,GAAG,CAAC;YACf,YAAY,GAAG,CAAC,CAAC,CAAC;YAClB,QAAQ,GAAG,KAAK,CAAC;QACrB,CAAC;QACD,kFAAkF;QAClF,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK,GAAG,KAAK,EAAE,CAAC;YAChC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACzE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClB,MAAM,GAAG,KAAK,CAAC;QACnB,CAAC;QACD,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;YACtC,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,EAAE,KAAK,EAAE,GAAG,SAAS,CAAC;YAC5B,IAAI,KAAK,GAAG,IAAI;gBAAE,IAAI,GAAG,KAAK,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,OAAO,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5E,MAAM,OAAO,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;gBACjF,MAAM,EAAE,GAAG,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC;gBAC5B,IAAI,MAAM,CAAC,EAAE,CAAC,KAAK,OAAO,EAAE,CAAC;oBACzB,MAAM,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC;oBACrB,SAAS,GAAG,IAAI,CAAC;gBACrB,CAAC;YACL,CAAC;QACL,CAAC;QACD,IAAI,KAAK,KAAK,YAAY,EAAE,CAAC;YACzB,8DAA8D;YAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1D,KAAK,GAAG,EAAE,GAAG,QAAQ,CAAC;YACtB,YAAY,GAAG,KAAK,CAAC;YACrB,YAAY,GAAG,CAAC,CAAC,CAAC;QACtB,CAAC;QACD,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK;YAAE,OAAO,QAAQ,KAAK,uDAAuD,CAAC,IAAI,KAAK,gCAAgC,IAAI,EAAE,CAAC;QACnJ,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,KAAK,YAAY,IAAI,KAAK,CAAC,KAAK,KAAK,UAAU,CAAC;QAC7E,IAAI,OAAO,EAAE,CAAC;YACV,KAAK,CAAC,OAAO,CAAC,CAAC;YACf,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC;YAC7B,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC;QAC7B,CAAC;QACD,MAAM,YAAY,GAAG,GAAG,CAAC,aAAa,CAAC,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QAC9E,MAAM,aAAa,GAAG,GAAG,CAAC,aAAa,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,GAAG,KAAK,EAAE,SAAS,CAAC,CAAC;QACrF,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,YAAY,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,aAAa,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;YACvH,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;YACrB,KAAK,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;YACxB,KAAK,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC;YACzB,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACjB,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YAC1C,QAAQ,GAAG,IAAI,CAAC;QACpB,CAAC;QACD,KAAK,GAAG,GAAG,CAAC;QACZ,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;QACxB,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC;IAEF,MAAM,SAAS,GAAG,CAAC,GAAc,EAAiB,EAAE;QAChD,IAAI,OAAO,KAAK,IAAI;YAAE,OAAO,OAAO,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QACpG,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;QAC5B,OAAO,CAAC,OAAO,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC;QAChC,OAAO,OAAO,CAAC;IACnB,CAAC,CAAC;IAEF,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;AAC3C,CAAC,CAAC"}

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

@@ -0,0 +1,3 @@
+import type { ComponentLists } from '../../interface/system/access.js';
+/** The components every entity a system's lists match has: what it reads, writes, has and filters on, but its optional ones. */
+export declare const requiredOf: (lists: ComponentLists | undefined) => readonly symbol[];

package/dist/implementation/world/required.js

@@ -0,0 +1,9 @@
+/** The components every entity a system's lists match has: what it reads, writes, has and filters on, but its optional ones. */
+export const requiredOf = (lists) => {
+    if (lists === undefined)
+        return [];
+    const { optional } = lists;
+    const all = new Set([...lists.read ?? [], ...lists.write ?? [], ...lists.has ?? [], ...lists.added ?? [], ...lists.changed ?? []]);
+    return optional === undefined ? [...all] : [...all].filter(key => !optional.includes(key));
+};
+//# sourceMappingURL=required.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"required.js","sourceRoot":"","sources":["../../../src/implementation/world/required.ts"],"names":[],"mappings":"AAGA,gIAAgI;AAChI,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAiC,EAAqB,EAAE;IAC/E,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACnC,MAAM,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IAC3B,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,IAAI,EAAE,EAAE,GAAG,KAAK,CAAC,KAAK,IAAI,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,EAAE,EAAE,GAAG,KAAK,CAAC,KAAK,IAAI,EAAE,EAAE,GAAG,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC;IACnI,OAAO,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;AAC/F,CAAC,CAAC"}

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

@@ -5,7 +5,10 @@ export type ResourceCell = {
     readonly storage: Storage;
     readonly row: number;
 };
-/** A resource's value before anything writes it: the one given at the world's creation, or its default. */
+/**
+ * A resource's value before anything writes it: the one given at the world's creation, or the start the world made
+ * for it, so a fresh `Map` or `Set` is one value however often it's read.
+ */
 export declare const initialOf: (state: State, key: Key) => unknown;
 /**
  * Adds any missing resources with their initial values, as their own sync point, between runs; commands that are

package/dist/implementation/world/resources.js

@@ -1,11 +1,14 @@
 import { indexOf, reserve } from './entities.js';
-import { defaultOf, idOf } from './state.js';
+import { idOf } from './state.js';
 import { synchronizeAlone } from './synchronize.js';
 import { addCommand, createBuffer, spawnCommand } from './buffer.js';
 import { pushValues } from './commands.js';
 import { labelOf } from '../../interface/registry/index.js';
-/** A resource's value before anything writes it: the one given at the world's creation, or its default. */
-export const initialOf = (state, key) => state.initial.has(key) ? state.initial.get(key) : defaultOf(key);
+/**
+ * A resource's value before anything writes it: the one given at the world's creation, or the start the world made
+ * for it, so a fresh `Map` or `Set` is one value however often it's read.
+ */
+export const initialOf = (state, key) => state.initial.has(key) ? state.initial.get(key) : state.starts[idOf(state, key)];
 /**
  * Adds any missing resources with their initial values, as their own sync point, between runs; commands that are
  * pending stay for the next run.

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

@@ -1 +1 @@
-{"version":3,"file":"resources.js","sourceRoot":"","sources":["../../../src/implementation/world/resources.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,IAAI,EAAwB,MAAM,YAAY,CAAC;AACnE,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AACrE,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC3C,OAAO,EAAE,OAAO,EAAE,MAAM,mCAAmC,CAAC;AAK5D,2GAA2G;AAC3G,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,KAAY,EAAE,GAAQ,EAAW,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;AAE/H;;;GAGG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,KAAY,EAAE,IAAmB,EAAQ,EAAE;IACvE,MAAM,KAAK,GAAG,KAAK,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IAC5E,MAAM,SAAS,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5F,MAAM,MAAM,GAA4B,EAAE,CAAC;IAC3C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC5B,6EAA6E;QAC7E,IAAI,SAAS,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI;YAAE,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACvI,CAAC;IACD,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IACjD,MAAM,MAAM,GAAG,YAAY,EAAE,CAAC;IAC9B,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACZ,KAAK,CAAC,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC/C,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;IAC1E,CAAC;SACI,CAAC;QACF,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;IACxE,CAAC;IACD,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AACpC,CAAC,CAAC;AAEF,4GAA4G;AAC5G,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAY,EAAE,GAAQ,EAAE,KAAc,EAAQ,EAAE;IACxE,IAAI,YAAY,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;QACzC,2EAA2E;QAC3E,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC9B,OAAO;IACX,CAAC;IACD,MAAM,MAAM,GAAG,YAAY,EAAE,CAAC;IAC9B,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC,cAAc,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;IAC9E,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AACpC,CAAC,CAAC;AAEF,mHAAmH;AACnH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAY,EAAE,GAAQ,EAA4B,EAAE;IAC7E,IAAI,KAAK,CAAC,cAAc,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IAC/C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;IACnG,OAAO,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;AAC3F,CAAC,CAAC;AAEF,mEAAmE;AACnE,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAY,EAAE,GAAQ,EAAgB,EAAE;IACjE,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IAC5C,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IACpE,MAAM,OAAO,GAAG,SAAS,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;IAC3D,IAAI,OAAO,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,aAAa,OAAO,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;IAC9F,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;AACvD,CAAC,CAAC"}
+{"version":3,"file":"resources.js","sourceRoot":"","sources":["../../../src/implementation/world/resources.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACjD,OAAO,EAAE,IAAI,EAAwB,MAAM,YAAY,CAAC;AACxD,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AACrE,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC3C,OAAO,EAAE,OAAO,EAAE,MAAM,mCAAmC,CAAC;AAK5D;;;GAGG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,KAAY,EAAE,GAAQ,EAAW,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;AAE/I;;;GAGG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,KAAY,EAAE,IAAmB,EAAQ,EAAE;IACvE,MAAM,KAAK,GAAG,KAAK,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IAC5E,MAAM,SAAS,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5F,MAAM,MAAM,GAA4B,EAAE,CAAC;IAC3C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC5B,6EAA6E;QAC7E,IAAI,SAAS,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI;YAAE,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACvI,CAAC;IACD,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IACjD,MAAM,MAAM,GAAG,YAAY,EAAE,CAAC;IAC9B,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACZ,KAAK,CAAC,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC/C,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;IAC1E,CAAC;SACI,CAAC;QACF,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;IACxE,CAAC;IACD,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AACpC,CAAC,CAAC;AAEF,4GAA4G;AAC5G,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAY,EAAE,GAAQ,EAAE,KAAc,EAAQ,EAAE;IACxE,IAAI,YAAY,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;QACzC,2EAA2E;QAC3E,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC9B,OAAO;IACX,CAAC;IACD,MAAM,MAAM,GAAG,YAAY,EAAE,CAAC;IAC9B,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC,cAAc,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;IAC9E,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AACpC,CAAC,CAAC;AAEF,mHAAmH;AACnH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAY,EAAE,GAAQ,EAA4B,EAAE;IAC7E,IAAI,KAAK,CAAC,cAAc,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IAC/C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;IACnG,OAAO,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;AAC3F,CAAC,CAAC;AAEF,mEAAmE;AACnE,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAY,EAAE,GAAQ,EAAgB,EAAE;IACjE,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IAC5C,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IACpE,MAAM,OAAO,GAAG,SAAS,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;IAC3D,IAAI,OAAO,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,aAAa,OAAO,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;IAC9F,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;AACvD,CAAC,CAAC"}

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

@@ -1,6 +1,6 @@
 import type { Entity } from '../../interface/entity/entity.js';
-import type { Declaration } from '../../interface/system/declaration.js';
-import type { SystemLookup } from '../../interface/system/access.js';
+import type { Resolved } from '../../interface/system/declaration.js';
+import type { SystemLookupLists } from '../../interface/system/access.js';
 import type { Commands } from '../../interface/system/commands.js';
 import type { Layout } from '../../interface/registry/layout.js';
 import { type Archetype, type Storage } from './archetype.js';
@@ -12,7 +12,7 @@ import type { WorldIndex } from './indexes.js';
  * What an accessor row reads and writes: a storage, or a joined thread's view of one. A joined thread's own objects
  * have `tags`, the world's tags of their rows, which a write marks as the thread's own value.
  */
-export type RowStorage = Pick<Storage, "layout" | "views" | "strings" | "values" | "write" | "ticked" | "added" | "changed" | "chunkAdded" | "chunkChanged" | "tags">;
+export type RowStorage = Pick<Storage, "layout" | "views" | "strings" | "values" | "write" | "ticked" | "added" | "changed" | "chunkAdded" | "chunkChanged" | "blockAdded" | "blockChanged" | "tags">;
 /** What a row binds to: an archetype, or a joined thread's view of one. */
 export type RowArchetype = {
     readonly id: number;
@@ -41,7 +41,12 @@ export type Row = {
     /** Points the row at another archetype's storages. Views are replaced only at sync points, so a binding lasts a pass. */
     readonly bind: (archetype: RowArchetype) => void;
 };
-export declare const createRow: (host: RowHost, archetype: RowArchetype, keys: readonly Key[], ids: readonly number[], writes: readonly Key[]) => Row;
+/**
+ * A row of an archetype's `keys`. `absent` is undefined for a member and, for an optional component, whether the
+ * archetype lacks it: one it lacks reads as `undefined` and assigning it fails its system, and one it has fails its
+ * system when assigned `undefined`.
+ */
+export declare const createRow: (host: RowHost, archetype: RowArchetype, keys: readonly Key[], ids: readonly number[], writes: readonly Key[], absent?: readonly (boolean | undefined)[]) => Row;
 /**
  * Makes read-only accessor rows for `keys` whose values share one hidden class: every value's own accessors are the
  * same functions, finding the row through the value. A body reading many rows at once, as a list's, sees one map.
@@ -57,9 +62,9 @@ export declare const parentBinder: (state: State, reads: readonly Key[]) => (arc
  * declares the same ones, so a body sees one row shape whichever system or archetype it runs over. A host's systems
  * run one at a time, so a binding lasts for one system's pass over one archetype. `idOfKey` gives each key's component.
  */
-export declare const rowBinderOf: <A extends RowArchetype>(host: RowHost, idOfKey: (key: Key) => number, reads: readonly Key[], writes: readonly Key[]) => (archetype: A) => Row;
+export declare const rowBinderOf: <A extends RowArchetype>(host: RowHost, idOfKey: (key: Key) => number, reads: readonly Key[], writes: readonly Key[], optional?: readonly Key[]) => (archetype: A) => Row;
 /** The accessor row binder for main-thread systems of a world. */
-export declare const rowBinder: (state: State, reads: readonly Key[], writes: readonly Key[]) => (archetype: Archetype) => Row;
+export declare const rowBinder: (state: State, reads: readonly Key[], writes: readonly Key[], optional?: readonly Key[]) => (archetype: Archetype) => Row;
 /** What a lookup by entity reading nothing gives every entity it finds. */
 export declare const emptyRow: object;
 /** A lookup by entity's row with `changed`: its `read` values by component, and `changed`. */
@@ -73,20 +78,19 @@ export declare const changedRowOf: (keys: readonly Key[]) => ChangedRow;
  * A lookup returning `read` values keyed by component, for main-thread systems: a new object each call, the shared
  * empty one for a lookup reading nothing, and with `changed` one row reused, its `changed` as of `since`.
  */
-export declare const createObjectLookup: (state: State, lookup: SystemLookup, since: Since) => (entity: Entity) => object | null;
+export declare const createObjectLookup: (state: State, lookup: SystemLookupLists, since: Since) => (entity: Entity) => object | null;
 /**
  * A lookup returning `read` values in declared order, for kernels: a new array each call, and with `changed` one array
  * reused, whether a component it watches may have changed after `since` last.
  */
-export declare const createArrayLookup: (state: State, lookup: SystemLookup, since: Since) => (entity: Entity) => readonly unknown[] | null;
+export declare const createArrayLookup: (state: State, lookup: SystemLookupLists, since: Since) => (entity: Entity) => readonly unknown[] | null;
 /**
- * A body's context: its resources, lookups, reductions, input and commands, each under its own key and present only
+ * A body's context: its resources, lookups, reductions and commands, each under its own key and present only
  * when declared. `bind` resolves the resources' cells for a run; `reduced[t]` holds the leaves of the fold into its
  * `t`th reduction target so far this run.
  */
 export type Context = {
     readonly value: {
-        input?: unknown;
         up?: unknown;
     };
     readonly bind: () => void;
@@ -99,10 +103,9 @@ export type Context = {
 type Extras = {
     readonly targets?: readonly ReductionTarget[];
     readonly commands?: Commands;
-    readonly input?: boolean;
     readonly indexes?: ReadonlyMap<string, WorldIndex>;
     readonly since?: Since;
 };
 /** Resource cells are resolved once per run: they move only at sync points. An unresolved resource throws on access. */
-export declare const createContext: (state: State, declaration: Pick<Declaration, "lookup" | "resources">, { targets, commands, input, indexes, since }?: Extras) => Context;
+export declare const createContext: (state: State, declaration: Pick<Resolved, "lookup" | "resources">, { targets, commands, indexes, since }?: Extras) => Context;
 export {};

package/dist/implementation/world/rows.js

@@ -4,11 +4,17 @@ import { readString, writeString } from './strings.js';
 import { indexOf, locate } from './entities.js';
 import { ownTag } from './move-log.js';
 import { resourceCell } from './resources.js';
+import { labelOf } from '../../interface/registry/names.js';
 import { idOf } from './state.js';
 import { combine, contributed, identityOf } from './reductions.js';
 import { createIndexLookup } from './index-lookups.js';
+/** A constant storage's value, a shared component's its archetype's, found once per binding. */
+const constantOf = (storage) => storage.layout.kind === "constant" ? storage.layout.value : undefined;
 /** Chosen once per component, so a read doesn't dispatch on the layout; tuples of f32 lanes are read as array literals. */
 const getterOf = (host, layout, slot, row) => {
+    // A shared component's value is the bound archetype's.
+    if (layout.kind === "constant" && layout.shared === true)
+        return () => slot.value;
     if (layout.kind === "constant") {
         const { value } = layout;
         return () => value;
@@ -40,6 +46,10 @@ const getterOf = (host, layout, slot, row) => {
         return () => slot.view[row.index * unitStride + unitOffset];
     return () => layout.read(slot.storage.views, row.index);
 };
+/** A shared component's setter, which fails its system: its value is its archetype's. */
+const sharedSetterOf = (key) => () => {
+    throw new Error(`"${labelOf(key)}" is shared: its value is its archetype's, so give it another with commands.add rather than assigning it.`);
+};
 const setterOf = (host, layout, slot, row) => {
     if (layout.kind === "constant")
         return () => stampChanged(slot.storage, row.index, host.tick);
@@ -96,10 +106,26 @@ const slotOf = (archetype, id) => {
     // A system matches only archetypes with every component it reads or writes.
     if (storage === undefined)
         throw new Error(`Archetype ${archetype.id} lacks component ${id}.`);
-    return { storage, view: viewOf(storage) };
+    return { storage, view: viewOf(storage), value: constantOf(storage) };
+};
+/** An optional component's getter where the archetype lacks it, and its setter, which fails its system. */
+const absentGetter = () => undefined;
+const absentSetterOf = (key) => () => {
+    throw new Error(`An entity lacks "${labelOf(key)}", optional in its system: add it with commands.add rather than assigning it.`);
 };
-export const createRow = (host, archetype, keys, ids, writes) => {
-    const slots = ids.map(id => slotOf(archetype, id));
+/** A present optional component's setter, which fails its system for `undefined`: that removes nothing. */
+const presentSetterOf = (key, set) => value => {
+    if (value === undefined)
+        throw new Error(`"${labelOf(key)}" was assigned undefined, which removes nothing: remove it with commands.remove.`);
+    set(value);
+};
+/**
+ * A row of an archetype's `keys`. `absent` is undefined for a member and, for an optional component, whether the
+ * archetype lacks it: one it lacks reads as `undefined` and assigning it fails its system, and one it has fails its
+ * system when assigned `undefined`.
+ */
+export const createRow = (host, archetype, keys, ids, writes, absent = []) => {
+    const slots = ids.map((id, i) => absent[i] === true ? undefined : slotOf(archetype, id));
     // Its own prototype gives the row its own root map. Rows built from `{}` share one, and defining an accessor with a
     // different getter than an existing transition's makes V8 switch the object to slow dictionary properties.
     const value = Object.create({});
@@ -110,18 +136,29 @@ export const createRow = (host, archetype, keys, ids, writes) => {
         bind: next => {
             row.entities = next.entities;
             for (let i = 0; i < ids.length; i++) {
-                const { storage, view } = slotOf(next, ids[i]);
-                slots[i].storage = storage;
-                slots[i].view = view;
+                const slot = slots[i];
+                if (slot === undefined)
+                    continue;
+                const { storage, view, value } = slotOf(next, ids[i]);
+                slot.storage = storage;
+                slot.view = view;
+                slot.value = value;
             }
         },
     };
     Object.defineProperty(value, "entity", { get: () => row.entities[row.index], enumerable: true });
     keys.forEach((key, i) => {
         const layout = host.layouts[ids[i]];
-        Object.defineProperty(value, key, {
-            get: getterOf(host, layout, slots[i], row),
-            set: writes.includes(key) ? setterOf(host, layout, slots[i], row) : undefined,
+        const slot = slots[i];
+        // A shared component is never assigned, whatever the build saw: assigning it fails its system, saying why.
+        const shared = layout.kind === "constant" && layout.shared === true;
+        Object.defineProperty(value, key, slot === undefined ? {
+            get: absentGetter,
+            set: shared ? sharedSetterOf(key) : writes.includes(key) ? absentSetterOf(key) : undefined,
+            enumerable: true,
+        } : {
+            get: getterOf(host, layout, slot, row),
+            set: shared ? sharedSetterOf(key) : !writes.includes(key) ? undefined : absent[i] === false ? presentSetterOf(key, setterOf(host, layout, slot, row)) : setterOf(host, layout, slot, row),
             enumerable: true,
         });
     });
@@ -131,6 +168,10 @@ export const createRow = (host, archetype, keys, ids, writes) => {
 const rowOfValue = Symbol("row");
 /** As `getterOf`, but one function for every row of a shape, finding its row and slot through the value. */
 const sharedGetterOf = (host, layout, i) => {
+    if (layout.kind === "constant" && layout.shared === true)
+        return function () {
+            return this[rowOfValue].slots[i].value;
+        };
     if (layout.kind === "constant") {
         const { value } = layout;
         return () => value;
@@ -198,9 +239,10 @@ export const sharedRows = (host, keys, ids) => {
             bind: next => {
                 row.entities = next.entities;
                 for (let i = 0; i < ids.length; i++) {
-                    const { storage, view } = slotOf(next, ids[i]);
+                    const { storage, view, value } = slotOf(next, ids[i]);
                     row.slots[i].storage = storage;
                     row.slots[i].view = view;
+                    row.slots[i].value = value;
                 }
             },
         };
@@ -231,15 +273,42 @@ export const parentBinder = (state, reads) => {
  * declares the same ones, so a body sees one row shape whichever system or archetype it runs over. A host's systems
  * run one at a time, so a binding lasts for one system's pass over one archetype. `idOfKey` gives each key's component.
  */
-export const rowBinderOf = (host, idOfKey, reads, writes) => {
+export const rowBinderOf = (host, idOfKey, reads, writes, optional = []) => {
     const keys = [...new Set([...reads, ...writes])];
     const ids = keys.map(idOfKey);
     const signature = keys.map((key, i) => writes.includes(key) ? `${ids[i]}w` : `${ids[i]}`).join(",");
+    /** The positions in `keys` of optional components, whose presence in an archetype picks its row. */
+    const optionals = keys.flatMap((key, i) => optional.includes(key) ? [i] : []);
+    if (optionals.length === 0)
+        return archetype => {
+            let row = host.rows.get(signature);
+            if (row === undefined) {
+                row = createRow(host, archetype, keys, ids, writes);
+                host.rows.set(signature, row);
+            }
+            else
+                row.bind(archetype);
+            return row;
+        };
+    // Each pattern of which optional components an archetype has is a row of its own, so no read checks per row. The
+    // pattern marks every key, `-` for a member and `0` or `1` for an optional one absent or present, so systems with
+    // the same keys but other optional ones never share a row.
+    const absent = keys.map(() => undefined);
     return archetype => {
-        let row = host.rows.get(signature);
+        let pattern = signature + "|";
+        for (let i = 0, next = 0; i < keys.length; i++) {
+            if (optionals[next] !== i) {
+                pattern += "-";
+                continue;
+            }
+            next++;
+            absent[i] = archetype.storageById[ids[i]] === undefined;
+            pattern += absent[i] ? "0" : "1";
+        }
+        let row = host.rows.get(pattern);
         if (row === undefined) {
-            row = createRow(host, archetype, keys, ids, writes);
-            host.rows.set(signature, row);
+            row = createRow(host, archetype, keys, ids, writes, [...absent]);
+            host.rows.set(pattern, row);
         }
         else
             row.bind(archetype);
@@ -247,7 +316,7 @@ export const rowBinderOf = (host, idOfKey, reads, writes) => {
     };
 };
 /** The accessor row binder for main-thread systems of a world. */
-export const rowBinder = (state, reads, writes) => rowBinderOf(state, key => idOf(state, key), reads, writes);
+export const rowBinder = (state, reads, writes, optional = []) => rowBinderOf(state, key => idOf(state, key), reads, writes, optional);
 /**
  * A lookup's matcher, with its component ids resolved once. `find` returns the row of a live entity that matches, or -1,
  * leaving its archetype in `archetype`.
@@ -257,6 +326,9 @@ const createMatcher = (state, lookup) => {
     const read = ids(lookup.read);
     const has = ids("has" in lookup ? lookup.has : undefined);
     const not = ids("not" in lookup ? lookup.not : undefined);
+    // What it reads but its optional components, which an entity it finds may lack.
+    const optional = ids("optional" in lookup ? lookup.optional : undefined);
+    const required = read.filter(id => !optional.includes(id));
     const matcher = {
         read,
         archetype: null,
@@ -268,8 +340,8 @@ const createMatcher = (state, lookup) => {
             if (archetype.resource)
                 return -1;
             const { storageById } = archetype;
-            for (let i = 0; i < read.length; i++)
-                if (storageById[read[i]] === undefined)
+            for (let i = 0; i < required.length; i++)
+                if (storageById[required[i]] === undefined)
                     return -1;
             for (let i = 0; i < has.length; i++)
                 if (storageById[has[i]] === undefined)
@@ -392,7 +464,7 @@ const never = { value: -1 };
 /** An object with its own prototype, so it gets its own root map, as rows do. */
 const own = () => Object.create({});
 /** Resource cells are resolved once per run: they move only at sync points. An unresolved resource throws on access. */
-export const createContext = (state, declaration, { targets = [], commands, input = false, indexes, since = never } = {}) => {
+export const createContext = (state, declaration, { targets = [], commands, indexes, since = never } = {}) => {
     const value = own();
     const { lookup, resources } = declaration;
     const names = Object.keys(lookup ?? {});
@@ -459,8 +531,6 @@ export const createContext = (state, declaration, { targets = [], commands, inpu
         });
         Object.defineProperty(value, "reduce", { value: reducers, enumerable: true });
     }
-    if (input)
-        value.input = undefined;
     if (commands !== undefined)
         Object.defineProperty(value, "commands", { value: commands, enumerable: true });
     const bind = () => {