@adobe/ecs 0.0.0-stage → 0.1.0

package/dist/implementation/world/order.js

@@ -0,0 +1,323 @@
+import { allocateArray, freeArray } from './arrays.js';
+/** Spare slots a group gets when laid out: an eighth of its rows, at least this many. */
+const slack = 8;
+/** Grows an array to at least `length`, keeping its contents and filling the rest with `value`. */
+const extend = (array, length, value) => {
+    if (array.length >= length)
+        return array;
+    const grown = new Int32Array(Math.max(length, 2 * array.length));
+    grown.set(array);
+    grown.fill(value, array.length);
+    return grown;
+};
+/**
+ * The slots of an `up` order, kept in segments of one buffer, one per group, each with spare slots, so a change
+ * patches one group: a row moves within its group by binary search and a shift. Rows and parents' rows are in the
+ * arena, so WASM kernels and the GPU can address them.
+ */
+export const createOrder = (memory) => {
+    let rows = new Int32Array(0);
+    let parents = new Int32Array(0);
+    let entities = new Int32Array(0);
+    let size = 0;
+    let live = 0;
+    /** By group id: its first slot, rows, spare slots included, depth, archetype and parents' archetype. */
+    let starts = new Int32Array(0);
+    let lengths = new Int32Array(0);
+    let capacities = new Int32Array(0);
+    let depths = new Int32Array(0);
+    let owners = new Int32Array(0);
+    let parentKeys = new Int32Array(0);
+    let groups = 0;
+    /** Group ids in run order. */
+    let sorted = new Int32Array(0);
+    const byKey = new Map();
+    /** By entity index: its group, or -1, and its row there. */
+    let groupOf = new Int32Array(0);
+    let rowOf = new Int32Array(0);
+    let view = null;
+    /** Grows the slot arrays to `length`, keeping their contents. */
+    const reserve = (length) => {
+        if (rows.length >= length)
+            return;
+        const capacity = Math.max(length, 2 * rows.length);
+        const grownRows = allocateArray(memory, Int32Array, capacity);
+        const grownParents = allocateArray(memory, Int32Array, capacity);
+        grownRows.set(rows.subarray(0, size));
+        grownParents.set(parents.subarray(0, size));
+        if (rows.length > 0) {
+            freeArray(memory, rows);
+            freeArray(memory, parents);
+        }
+        rows = grownRows;
+        parents = grownParents;
+        entities = extend(entities, capacity, 0);
+    };
+    const growGroups = () => {
+        if (starts.length > groups)
+            return;
+        const capacity = Math.max(16, 2 * starts.length);
+        starts = extend(starts, capacity, 0);
+        lengths = extend(lengths, capacity, 0);
+        capacities = extend(capacities, capacity, 0);
+        depths = extend(depths, capacity, 0);
+        owners = extend(owners, capacity, 0);
+        parentKeys = extend(parentKeys, capacity, 0);
+        sorted = extend(sorted, capacity, 0);
+    };
+    const keyOf = (depth, owner, parent) => `${depth} ${owner} ${parent}`;
+    /** Whether group `a` runs before group `b`. */
+    const before = (a, b) => depths[a] !== depths[b] ? depths[a] < depths[b] : owners[a] !== owners[b] ? owners[a] < owners[b] : parentKeys[a] < parentKeys[b];
+    /** A new, empty group with `capacity` slots at the end of the buffer, placed in run order. */
+    const addGroup = (depth, owner, parent, capacity) => {
+        growGroups();
+        const id = groups++;
+        depths[id] = depth;
+        owners[id] = owner;
+        parentKeys[id] = parent;
+        lengths[id] = 0;
+        reserve(size + capacity);
+        starts[id] = size;
+        capacities[id] = capacity;
+        size += capacity;
+        let at = id;
+        while (at > 0 && before(id, sorted[at - 1])) {
+            sorted[at] = sorted[at - 1];
+            at--;
+        }
+        sorted[at] = id;
+        byKey.set(keyOf(depth, owner, parent), id);
+        return id;
+    };
+    /** Moves a full group to the end of the buffer with twice the slots. */
+    const relocate = (id) => {
+        const capacity = 2 * capacities[id] + slack;
+        reserve(size + capacity);
+        const from = starts[id];
+        rows.copyWithin(size, from, from + lengths[id]);
+        parents.copyWithin(size, from, from + lengths[id]);
+        entities.copyWithin(size, from, from + lengths[id]);
+        starts[id] = size;
+        capacities[id] = capacity;
+        size += capacity;
+    };
+    /** The slot of `index` in its group, found by its row. */
+    const slotOf = (id, index) => {
+        const row = rowOf[index];
+        let low = starts[id];
+        let high = low + lengths[id];
+        while (low < high) {
+            const middle = (low + high) >>> 1;
+            if (rows[middle] < row)
+                low = middle + 1;
+            else
+                high = middle;
+        }
+        // Rows are unique within a group once removals are done; an insertion pending may share one meanwhile.
+        while (entities[low] !== index)
+            low++;
+        return low;
+    };
+    const grow = (length) => {
+        groupOf = extend(groupOf, length, -1);
+        rowOf = extend(rowOf, length, 0);
+    };
+    /** Removes an entity's slot, if it has one. */
+    const remove = (index) => {
+        const id = index < groupOf.length ? groupOf[index] : -1;
+        if (id < 0)
+            return;
+        const slot = slotOf(id, index);
+        const end = starts[id] + lengths[id];
+        rows.copyWithin(slot, slot + 1, end);
+        parents.copyWithin(slot, slot + 1, end);
+        entities.copyWithin(slot, slot + 1, end);
+        lengths[id]--;
+        live--;
+        groupOf[index] = -1;
+        view = null;
+    };
+    /** Places an entity's row in its group, in storage order. */
+    const insert = (index, depth, owner, parent, row, parentRow) => {
+        grow(index + 1);
+        const id = byKey.get(keyOf(depth, owner, parent)) ?? addGroup(depth, owner, parent, slack);
+        if (lengths[id] === capacities[id])
+            relocate(id);
+        const start = starts[id];
+        const end = start + lengths[id];
+        let low = start;
+        let high = end;
+        while (low < high) {
+            const middle = (low + high) >>> 1;
+            if (rows[middle] < row)
+                low = middle + 1;
+            else
+                high = middle;
+        }
+        rows.copyWithin(low + 1, low, end);
+        parents.copyWithin(low + 1, low, end);
+        entities.copyWithin(low + 1, low, end);
+        rows[low] = row;
+        parents[low] = parentRow;
+        entities[low] = index;
+        lengths[id]++;
+        live++;
+        groupOf[index] = id;
+        rowOf[index] = row;
+        view = null;
+    };
+    /** Whether an entity's slot is in the group of this depth, archetype and parents' archetype, at this row. */
+    const isAt = (index, depth, owner, parent, row) => {
+        const id = index < groupOf.length ? groupOf[index] : -1;
+        return id >= 0 && rowOf[index] === row && depths[id] === depth && owners[id] === owner && parentKeys[id] === parent;
+    };
+    /** Sets an entity's parent's row, in place. */
+    const setParent = (index, parentRow) => {
+        const id = groupOf[index];
+        parents[slotOf(id, index)] = parentRow;
+    };
+    /** Lays the groups out again in run order, each with spare slots, dropping empty ones. */
+    const compact = () => {
+        const kept = [];
+        let total = 0;
+        for (let k = 0; k < groups; k++) {
+            const id = sorted[k];
+            if (lengths[id] === 0)
+                continue;
+            kept.push(id);
+            total += lengths[id] + spareFor(lengths[id]);
+        }
+        const toRows = allocateArray(memory, Int32Array, Math.max(total, 1));
+        const toParents = allocateArray(memory, Int32Array, Math.max(total, 1));
+        const toEntities = new Int32Array(Math.max(total, 1));
+        const toStarts = new Int32Array(Math.max(16, kept.length));
+        const toLengths = new Int32Array(toStarts.length);
+        const toCapacities = new Int32Array(toStarts.length);
+        const toDepths = new Int32Array(toStarts.length);
+        const toOwners = new Int32Array(toStarts.length);
+        const toParentKeys = new Int32Array(toStarts.length);
+        byKey.clear();
+        let at = 0;
+        kept.forEach((id, k) => {
+            const from = starts[id];
+            const length = lengths[id];
+            toRows.set(rows.subarray(from, from + length), at);
+            toParents.set(parents.subarray(from, from + length), at);
+            toEntities.set(entities.subarray(from, from + length), at);
+            for (let slot = at; slot < at + length; slot++)
+                groupOf[toEntities[slot]] = k;
+            toStarts[k] = at;
+            toLengths[k] = length;
+            toCapacities[k] = length + spareFor(length);
+            toDepths[k] = depths[id];
+            toOwners[k] = owners[id];
+            toParentKeys[k] = parentKeys[id];
+            byKey.set(keyOf(depths[id], owners[id], parentKeys[id]), k);
+            at += toCapacities[k];
+        });
+        if (rows.length > 0) {
+            freeArray(memory, rows);
+            freeArray(memory, parents);
+        }
+        rows = toRows;
+        parents = toParents;
+        entities = toEntities;
+        starts = toStarts;
+        lengths = toLengths;
+        capacities = toCapacities;
+        depths = toDepths;
+        owners = toOwners;
+        parentKeys = toParentKeys;
+        groups = kept.length;
+        sorted = new Int32Array(starts.length);
+        for (let k = 0; k < groups; k++)
+            sorted[k] = k;
+        size = at;
+        view = null;
+    };
+    /** Spare slots for a group of `length` rows. */
+    const spareFor = (length) => Math.max(slack, length >> 3);
+    /**
+     * Replaces every slot with groups laid out in run order, each with spare slots: slots `ends[k - 1]` (or 0) to
+     * `ends[k] - 1` of the given arrays are group `k`, of `groupDepths[k]`, `groupOwners[k]` and `groupParents[k]`.
+     */
+    const load = (count, groupRows, groupParentRows, groupEntities, ends, groupDepths, groupOwners, groupParents, entityCount) => {
+        const total = count === 0 ? 0 : ends[count - 1];
+        groups = 0;
+        size = 0;
+        byKey.clear();
+        reserve(total + count * slack + (total >> 3));
+        grow(entityCount);
+        groupOf.fill(-1);
+        const toRows = rows, toParents = parents, toEntities = entities, entityGroups = groupOf, entityRows = rowOf;
+        for (let k = 0; k < count; k++) {
+            growGroups();
+            const id = groups++;
+            const from = k === 0 ? 0 : ends[k - 1];
+            const length = ends[k] - from;
+            starts[id] = size;
+            lengths[id] = length;
+            capacities[id] = length + spareFor(length);
+            depths[id] = groupDepths[k];
+            owners[id] = groupOwners[k];
+            parentKeys[id] = groupParents[k];
+            sorted[id] = id;
+            byKey.set(keyOf(groupDepths[k], groupOwners[k], groupParents[k]), id);
+            toRows.set(groupRows.subarray(from, ends[k]), size);
+            toParents.set(groupParentRows.subarray(from, ends[k]), size);
+            toEntities.set(groupEntities.subarray(from, ends[k]), size);
+            for (let n = from; n < ends[k]; n++) {
+                entityGroups[groupEntities[n]] = id;
+                entityRows[groupEntities[n]] = groupRows[n];
+            }
+            size += capacities[id];
+        }
+        live = total;
+        view = null;
+    };
+    /** Compacts once unused slots outnumber the rows. */
+    const tidy = () => {
+        if (size > 2 * live + 1024)
+            compact();
+    };
+    /** The order as runs read it; a new object after any change, so the GPU knows to upload it again. */
+    const current = () => {
+        if (view !== null)
+            return view;
+        const groupStarts = new Int32Array(groups);
+        const groupEnds = new Int32Array(groups);
+        const groupDepths = new Int32Array(groups);
+        const groupOwners = new Int32Array(groups);
+        const groupParents = new Int32Array(groups);
+        let levels = 0;
+        for (let k = 0; k < groups; k++) {
+            const id = sorted[k];
+            groupStarts[k] = starts[id];
+            groupEnds[k] = starts[id] + lengths[id];
+            groupDepths[k] = depths[id];
+            groupOwners[k] = owners[id];
+            groupParents[k] = parentKeys[id];
+            levels = depths[id] + 1;
+        }
+        const depthGroups = new Int32Array(levels + 1);
+        for (let k = 0, depth = 0; depth <= levels; depth++) {
+            while (k < groups && groupDepths[k] < depth)
+                k++;
+            depthGroups[depth] = k;
+        }
+        view = { rows, parents, entities, size, groups, groupStarts, groupEnds, groupDepths, groupOwners, groupParents, depthGroups, levels };
+        return view;
+    };
+    /** Frees the slot arrays in the arena, once nothing runs the order again. */
+    const release = () => {
+        if (rows.length === 0)
+            return;
+        freeArray(memory, rows);
+        freeArray(memory, parents);
+        rows = parents = new Int32Array(0);
+        size = live = groups = 0;
+        view = null;
+    };
+    return { load, insert, remove, isAt, setParent, tidy, current, live: () => live, release };
+};
+//# sourceMappingURL=order.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"order.js","sourceRoot":"","sources":["../../../src/implementation/world/order.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAyBvD,yFAAyF;AACzF,MAAM,KAAK,GAAG,CAAC,CAAC;AAEhB,mGAAmG;AACnG,MAAM,MAAM,GAAG,CAAC,KAA8B,EAAE,MAAc,EAAE,KAAa,EAA2B,EAAE;IACtG,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM;QAAE,OAAO,KAAK,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACjE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACjB,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAChC,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,MAAc,EAAE,EAAE;IAC1C,IAAI,IAAI,GAAe,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IACzC,IAAI,OAAO,GAAe,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC5C,IAAI,QAAQ,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IACjC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,wGAAwG;IACxG,IAAI,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,OAAO,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAChC,IAAI,UAAU,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IACnC,IAAI,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,UAAU,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IACnC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,8BAA8B;IAC9B,IAAI,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,4DAA4D;IAC5D,IAAI,OAAO,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAChC,IAAI,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC9B,IAAI,IAAI,GAAiB,IAAI,CAAC;IAE9B,iEAAiE;IACjE,MAAM,OAAO,GAAG,CAAC,MAAc,EAAQ,EAAE;QACrC,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM;YAAE,OAAO;QAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;QAC9D,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;QACjE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QACtC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QAC5C,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClB,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACxB,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC/B,CAAC;QACD,IAAI,GAAG,SAAS,CAAC;QACjB,OAAO,GAAG,YAAY,CAAC;QACvB,QAAQ,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC;IAEF,MAAM,UAAU,GAAG,GAAS,EAAE;QAC1B,IAAI,MAAM,CAAC,MAAM,GAAG,MAAM;YAAE,OAAO;QACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QACjD,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QACrC,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QACvC,UAAU,GAAG,MAAM,CAAC,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QACrC,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QACrC,UAAU,GAAG,MAAM,CAAC,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC;IAEF,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,KAAa,EAAE,MAAc,EAAU,EAAE,CAAC,GAAG,KAAK,IAAI,KAAK,IAAI,MAAM,EAAE,CAAC;IAEtG,+CAA+C;IAC/C,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,CAAS,EAAW,EAAE,CAC7C,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAEtI,8FAA8F;IAC9F,MAAM,QAAQ,GAAG,CAAC,KAAa,EAAE,KAAa,EAAE,MAAc,EAAE,QAAgB,EAAU,EAAE;QACxF,UAAU,EAAE,CAAC;QACb,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;QACpB,MAAM,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;QACnB,MAAM,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;QACnB,UAAU,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC;QACxB,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QAChB,OAAO,CAAC,IAAI,GAAG,QAAQ,CAAC,CAAC;QACzB,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QAClB,UAAU,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;QAC1B,IAAI,IAAI,QAAQ,CAAC;QACjB,IAAI,EAAE,GAAG,EAAE,CAAC;QACZ,OAAO,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1C,MAAM,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAC5B,EAAE,EAAE,CAAC;QACT,CAAC;QACD,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QAChB,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;QAC3C,OAAO,EAAE,CAAC;IACd,CAAC,CAAC;IAEF,wEAAwE;IACxE,MAAM,QAAQ,GAAG,CAAC,EAAU,EAAQ,EAAE;QAClC,MAAM,QAAQ,GAAG,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;QAC5C,OAAO,CAAC,IAAI,GAAG,QAAQ,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACxB,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,OAAO,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,QAAQ,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QACpD,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QAClB,UAAU,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;QAC1B,IAAI,IAAI,QAAQ,CAAC;IACrB,CAAC,CAAC;IAEF,0DAA0D;IAC1D,MAAM,MAAM,GAAG,CAAC,EAAU,EAAE,KAAa,EAAU,EAAE;QACjD,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QACzB,IAAI,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACrB,IAAI,IAAI,GAAG,GAAG,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QAC7B,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;YAChB,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,GAAG;gBAAE,GAAG,GAAG,MAAM,GAAG,CAAC,CAAC;;gBACpC,IAAI,GAAG,MAAM,CAAC;QACvB,CAAC;QACD,uGAAuG;QACvG,OAAO,QAAQ,CAAC,GAAG,CAAC,KAAK,KAAK;YAAE,GAAG,EAAE,CAAC;QACtC,OAAO,GAAG,CAAC;IACf,CAAC,CAAC;IAEF,MAAM,IAAI,GAAG,CAAC,MAAc,EAAQ,EAAE;QAClC,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;QACtC,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC;IAEF,+CAA+C;IAC/C,MAAM,MAAM,GAAG,CAAC,KAAa,EAAQ,EAAE;QACnC,MAAM,EAAE,GAAG,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,IAAI,EAAE,GAAG,CAAC;YAAE,OAAO;QACnB,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QACrC,OAAO,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QACxC,QAAQ,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QACzC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;QACd,IAAI,EAAE,CAAC;QACP,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QACpB,IAAI,GAAG,IAAI,CAAC;IAChB,CAAC,CAAC;IAEF,6DAA6D;IAC7D,MAAM,MAAM,GAAG,CAAC,KAAa,EAAE,KAAa,EAAE,KAAa,EAAE,MAAc,EAAE,GAAW,EAAE,SAAiB,EAAQ,EAAE;QACjH,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAChB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,IAAI,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QAC3F,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,UAAU,CAAC,EAAE,CAAC;YAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;QACjD,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACzB,MAAM,GAAG,GAAG,KAAK,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,IAAI,IAAI,GAAG,GAAG,CAAC;QACf,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;YAChB,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,GAAG;gBAAE,GAAG,GAAG,MAAM,GAAG,CAAC,CAAC;;gBACpC,IAAI,GAAG,MAAM,CAAC;QACvB,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACnC,OAAO,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACtC,QAAQ,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;QAChB,OAAO,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACtB,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;QACd,IAAI,EAAE,CAAC;QACP,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QACpB,KAAK,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC;QACnB,IAAI,GAAG,IAAI,CAAC;IAChB,CAAC,CAAC;IAEF,6GAA6G;IAC7G,MAAM,IAAI,GAAG,CAAC,KAAa,EAAE,KAAa,EAAE,KAAa,EAAE,MAAc,EAAE,GAAW,EAAW,EAAE;QAC/F,MAAM,EAAE,GAAG,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,OAAO,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,MAAM,CAAC,EAAE,CAAC,KAAK,KAAK,IAAI,MAAM,CAAC,EAAE,CAAC,KAAK,KAAK,IAAI,UAAU,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;IACxH,CAAC,CAAC;IAEF,+CAA+C;IAC/C,MAAM,SAAS,GAAG,CAAC,KAAa,EAAE,SAAiB,EAAQ,EAAE;QACzD,MAAM,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;QAC1B,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,GAAG,SAAS,CAAC;IAC3C,CAAC,CAAC;IAEF,0FAA0F;IAC1F,MAAM,OAAO,GAAG,GAAS,EAAE;QACvB,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC;gBAAE,SAAS;YAChC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACd,KAAK,IAAI,OAAO,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,CAAC;QACD,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QACrE,MAAM,SAAS,GAAG,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QACxE,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QACtD,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QAC3D,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAClD,MAAM,YAAY,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACjD,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACjD,MAAM,YAAY,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACrD,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;YACnB,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;YACxB,MAAM,MAAM,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;YACnD,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;YACzD,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;YAC3D,KAAK,IAAI,IAAI,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,GAAG,MAAM,EAAE,IAAI,EAAE;gBAAE,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9E,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACjB,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;YACtB,YAAY,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC5C,QAAQ,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;YACzB,QAAQ,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;YACzB,YAAY,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;YACjC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5D,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QACH,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClB,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACxB,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC/B,CAAC;QACD,IAAI,GAAG,MAAM,CAAC;QACd,OAAO,GAAG,SAAS,CAAC;QACpB,QAAQ,GAAG,UAAU,CAAC;QACtB,MAAM,GAAG,QAAQ,CAAC;QAClB,OAAO,GAAG,SAAS,CAAC;QACpB,UAAU,GAAG,YAAY,CAAC;QAC1B,MAAM,GAAG,QAAQ,CAAC;QAClB,MAAM,GAAG,QAAQ,CAAC;QAClB,UAAU,GAAG,YAAY,CAAC;QAC1B,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QACrB,MAAM,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/C,IAAI,GAAG,EAAE,CAAC;QACV,IAAI,GAAG,IAAI,CAAC;IAChB,CAAC,CAAC;IAEF,gDAAgD;IAChD,MAAM,QAAQ,GAAG,CAAC,MAAc,EAAU,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC;IAE1E;;;OAGG;IACH,MAAM,IAAI,GAAG,CAAC,KAAa,EAAE,SAAqB,EAAE,eAA2B,EAAE,aAAyB,EAAE,IAAgB,EAAE,WAAuB,EAAE,WAAuB,EAAE,YAAwB,EAAE,WAAmB,EAAQ,EAAE;QACnO,MAAM,KAAK,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAChD,MAAM,GAAG,CAAC,CAAC;QACX,IAAI,GAAG,CAAC,CAAC;QACT,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,OAAO,CAAC,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC,WAAW,CAAC,CAAC;QAClB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,MAAM,GAAG,IAAI,EAAE,SAAS,GAAG,OAAO,EAAE,UAAU,GAAG,QAAQ,EAAE,YAAY,GAAG,OAAO,EAAE,UAAU,GAAG,KAAK,CAAC;QAC5G,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,UAAU,EAAE,CAAC;YACb,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YAC9B,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;YAClB,OAAO,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC;YACrB,UAAU,CAAC,EAAE,CAAC,GAAG,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC3C,MAAM,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YAC5B,UAAU,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YAChB,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACtE,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACpD,SAAS,CAAC,GAAG,CAAC,eAAe,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC7D,UAAU,CAAC,GAAG,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC5D,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,YAAY,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACpC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAChD,CAAC;YACD,IAAI,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,GAAG,KAAK,CAAC;QACb,IAAI,GAAG,IAAI,CAAC;IAChB,CAAC,CAAC;IAEF,qDAAqD;IACrD,MAAM,IAAI,GAAG,GAAS,EAAE;QACpB,IAAI,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI;YAAE,OAAO,EAAE,CAAC;IAC1C,CAAC,CAAC;IAEF,qGAAqG;IACrG,MAAM,OAAO,GAAG,GAAU,EAAE;QACxB,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC/B,MAAM,WAAW,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;QAC3C,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;QACzC,MAAM,WAAW,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;QAC3C,MAAM,WAAW,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;QAC3C,MAAM,YAAY,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACrB,WAAW,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;YAC5B,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACxC,WAAW,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;YAC5B,WAAW,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;YAC5B,YAAY,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;YACjC,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QAC5B,CAAC;QACD,MAAM,WAAW,GAAG,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YAClD,OAAO,CAAC,GAAG,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK;gBAAE,CAAC,EAAE,CAAC;YACjD,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,WAAW,EAAE,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC;QACtI,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC;IAEF,6EAA6E;IAC7E,MAAM,OAAO,GAAG,GAAS,EAAE;QACvB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC9B,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACxB,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC3B,IAAI,GAAG,OAAO,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,GAAG,IAAI,GAAG,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,GAAG,IAAI,CAAC;IAChB,CAAC,CAAC;IAEF,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC;AAC/F,CAAC,CAAC"}

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

@@ -0,0 +1,50 @@
+/**
+ * A sync point's plan: each touched entity's net change, as reusable parallel arrays rather than an object per entity.
+ * `to` is where it ends up; its values are command ranges, applied in issue order so later values win. Each world has
+ * its own, since a sync point can wait for the GPU between planning and applying.
+ */
+export type Plan = {
+    count: number;
+    /** Entries made by spawns; each consumed one reservation. */
+    spawned: number;
+    /** Commands that did nothing, since their entity wasn't alive. */
+    dropped: number;
+    entity: Float64Array<ArrayBuffer>;
+    /** Archetype id, or -1 for an entity spawned in this sync point. */
+    from: Int32Array<ArrayBuffer>;
+    to: Int32Array<ArrayBuffer>;
+    despawned: Uint8Array<ArrayBuffer>;
+    /** While applying: the row an entity leaves in `from`, kept current as rows swap into holes; -1 for none. */
+    row: Int32Array<ArrayBuffer>;
+    /** While applying: the pair of archetypes a moving entry is in, by index into the pairs; -1 for one staying. */
+    pair: Int32Array<ArrayBuffer>;
+    /** While applying: the pairs of source and target archetype entries move between, by key, with their entries in order. */
+    readonly pairs: Pairs;
+    /** The first command range: queued buffer, start and end. Most entities have one. */
+    buffer: Int32Array<ArrayBuffer>;
+    start: Int32Array<ArrayBuffer>;
+    end: Int32Array<ArrayBuffer>;
+    /** Further ranges, as buffer, start, end triples. */
+    readonly more: Map<number, number[]>;
+    /** Components removed and added again here, so their `added` tick is new although `from` had them. */
+    readonly fresh: Map<number, number[]>;
+    /** Where each entity index's entry is, or -1; reset after each sync point. */
+    slots: Int32Array;
+};
+/**
+ * Source and target archetype pairs, reused across sync points: `from[p]` (-1 for spawns) and `to[p]`, the number of
+ * entries moving between them, and where they start in `order`, which lists every moving entry by pair, in entry order.
+ * When each pair's entries are consecutive entries, as a system's spawns or moves from one archetype are, each pair
+ * starts at its first entry and `order` lists entries in order.
+ */
+export type Pairs = {
+    readonly byKey: Map<number, number>;
+    readonly from: number[];
+    readonly to: number[];
+    readonly count: number[];
+    readonly start: number[];
+    /** Entries that leave a row, which is removed after the pairs arrive. */
+    leaving: number;
+    order: Int32Array<ArrayBuffer>;
+};
+export declare const createPlan: () => Plan;

package/dist/implementation/world/plan.js

@@ -0,0 +1,20 @@
+const initialEntries = 64;
+export const createPlan = () => ({
+    count: 0,
+    spawned: 0,
+    dropped: 0,
+    entity: new Float64Array(initialEntries),
+    from: new Int32Array(initialEntries),
+    to: new Int32Array(initialEntries),
+    despawned: new Uint8Array(initialEntries),
+    row: new Int32Array(initialEntries),
+    pair: new Int32Array(initialEntries),
+    pairs: { byKey: new Map(), from: [], to: [], count: [], start: [], leaving: 0, order: new Int32Array(initialEntries) },
+    buffer: new Int32Array(initialEntries),
+    start: new Int32Array(initialEntries),
+    end: new Int32Array(initialEntries),
+    more: new Map(),
+    fresh: new Map(),
+    slots: new Int32Array(0),
+});
+//# sourceMappingURL=plan.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"plan.js","sourceRoot":"","sources":["../../../src/implementation/world/plan.ts"],"names":[],"mappings":"AAmDA,MAAM,cAAc,GAAG,EAAE,CAAC;AAE1B,MAAM,CAAC,MAAM,UAAU,GAAG,GAAS,EAAE,CAAC,CAAC;IACnC,KAAK,EAAE,CAAC;IACR,OAAO,EAAE,CAAC;IACV,OAAO,EAAE,CAAC;IACV,MAAM,EAAE,IAAI,YAAY,CAAC,cAAc,CAAC;IACxC,IAAI,EAAE,IAAI,UAAU,CAAC,cAAc,CAAC;IACpC,EAAE,EAAE,IAAI,UAAU,CAAC,cAAc,CAAC;IAClC,SAAS,EAAE,IAAI,UAAU,CAAC,cAAc,CAAC;IACzC,GAAG,EAAE,IAAI,UAAU,CAAC,cAAc,CAAC;IACnC,IAAI,EAAE,IAAI,UAAU,CAAC,cAAc,CAAC;IACpC,KAAK,EAAE,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,UAAU,CAAC,cAAc,CAAC,EAAE;IACtH,MAAM,EAAE,IAAI,UAAU,CAAC,cAAc,CAAC;IACtC,KAAK,EAAE,IAAI,UAAU,CAAC,cAAc,CAAC;IACrC,GAAG,EAAE,IAAI,UAAU,CAAC,cAAc,CAAC;IACnC,IAAI,EAAE,IAAI,GAAG,EAAE;IACf,KAAK,EAAE,IAAI,GAAG,EAAE;IAChB,KAAK,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC;CAC3B,CAAC,CAAC"}

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

@@ -0,0 +1,70 @@
+import { type CommandBuffer } from './buffer.js';
+import type { Memory } from './memory.js';
+import { type ToWorker } from './protocol.js';
+import type { Segment } from './command-ring.js';
+import type { WorkerPort } from './worker-platform.js';
+type Task = Extract<ToWorker, {
+    task: number;
+}>;
+type Request = Task extends infer T ? T extends Task ? Omit<T, "task"> : never : never;
+/**
+ * A task's commands, plus its error if it failed partway; what it issued before the error still applies. A message
+ * task's commands and spawns are its segment of its worker's command ring, which the world drains.
+ */
+export type TaskResult = {
+    readonly commands: CommandBuffer;
+    readonly segment?: Segment;
+    readonly error?: Error;
+    readonly kernels?: number;
+};
+/** A WASM kernel task: everything is a number, so it travels through shared memory instead of a message. */
+export type FastTask = {
+    readonly kernel: number;
+    readonly archetype: number;
+    readonly start: number;
+    readonly end: number;
+    readonly tick: number;
+    readonly lastRun: number;
+    readonly scalars: readonly number[];
+    /**
+     * The byte address of the task's first reduction partials, or -1 without reductions; they follow the scalars, and
+     * count against `maximumScalars`. A worker running claimed pieces folds piece `p` into the partials `p * partialBytes` past it.
+     */
+    readonly partials: number;
+    readonly partialBytes: number;
+};
+/**
+ * Workers sharing the world's memory, one per port. Messages to one worker are handled in the order they're posted.
+ * `claimed` tasks go through a ring in shared memory while workers wait on it in a window, which costs one message to
+ * open; a message, a broadcast or `close` ends the window, after the tasks already posted.
+ */
+export type Pool = {
+    readonly size: number;
+    readonly broadcast: (message: Exclude<ToWorker, {
+        task: number;
+    }>) => void;
+    /** Posts a task to one worker. Never rejects: a failed task or a dead worker resolves with an error. */
+    readonly request: (worker: number, message: Request) => Promise<TaskResult>;
+    /**
+     * Posts one task to each of `workers` workers from `first`, which claim `grain`-row pieces of the task's range:
+     * each from its own home range first, then from others' (`claims.ts`), so faster workers take more and a worker
+     * mapped to the same range each tier finds its rows in cache. With no room for claims, splits the range evenly.
+     */
+    readonly claimed: (first: number, workers: number, task: FastTask, grain: number) => Promise<TaskResult>[];
+    /** How many workers were posted a task since the last call, which starts the count again. */
+    readonly takePosted: () => number;
+    readonly close: () => void;
+    /**
+     * At a sync point, once its segments are drained and while no task runs: empties every command ring, growing each
+     * one a task overflowed to what its tasks needed.
+     */
+    readonly rewind: () => void;
+    /**
+     * Ends the workers, through their ports, then releases the pool's control state to the arena once every worker that waited on it has
+     * left its window, as each acknowledges a message. One that doesn't within `releaseTimeout`, or that died with a
+     * window open, may still touch it, so it's kept.
+     */
+    readonly terminate: () => Promise<void>;
+};
+export declare const createPool: (ports: readonly WorkerPort[], arena: Memory) => Pool;
+export {};