@adobe/ecs 0.0.0-stage → 0.2.0

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

@@ -0,0 +1,191 @@
+import type { Layout, Views } from '../../interface/registry/layout.js';
+import type { Memory } from './memory.js';
+import { type MoveLog } from './move-log.js';
+import type { StringStore } from './strings.js';
+/** One component's storage in one archetype. Its views and ticks are replaced when the archetype grows. */
+export type Storage = {
+    readonly component: number;
+    /** A shared component's is replaced as its archetype is reused for other values (`reclaim.ts`). */
+    layout: Layout;
+    /**
+     * Views of the interleaved column, for a linear layout: row `r` is `layout.stride` bytes at `r * stride`. For a
+     * string, each row's handle of its record while records are kept, else 0, as in rows past the archetype's count.
+     */
+    views: Views;
+    /** For a string, the records its handles name; null otherwise. */
+    readonly strings: StringStore | null;
+    /** Values, for an object layout the world's thread fills, and a string's on the world's thread. */
+    readonly values: unknown[];
+    /** For an object layout a joined thread fills, its log, and each row's tag (`move-log.ts`) in place of its value. */
+    remote: MoveLog | null;
+    tags: Uint32Array;
+    /** How the sync point writes a value without a closure call: one of the `write` kinds, with its leaves' placement. */
+    readonly write: number;
+    readonly unitStride: number;
+    readonly unitOffset: number;
+    readonly lanes: number;
+    /** 32-bit words per element of a linear layout whose stride is a multiple of 4, which every GPU layout is; else 0. */
+    readonly words: number;
+    /**
+     * Whether this component keeps ticks: only once some system filters on its `added` or `changed`, and always for
+     * resources. Without them the tick arrays are empty and nothing stamps. Ticks are f64 so they never wrap.
+     */
+    ticked: boolean;
+    added: Float64Array;
+    changed: Float64Array;
+    /** The newest `added` and `changed` tick in each chunk of `2 ** chunkShift` rows, so change filters skip unchanged chunks. */
+    chunkAdded: Float64Array;
+    chunkChanged: Float64Array;
+    /**
+     * The newest `added` and `changed` tick in each block of `2 ** blockShift` rows, so change filters skip the
+     * unchanged blocks of a chunk that changed: a filter's scan costs what changed, not the chunk.
+     */
+    blockAdded: Float64Array;
+    blockChanged: Float64Array;
+    /**
+     * The newest tick at which every row may have changed, as a GPU kernel's writes do, so stamping them costs
+     * nothing per row: change filters pass the whole column when it's newer than their `lastRun`.
+     */
+    columnChanged: number;
+};
+/** Bytes after a column's last row, so a WASM kernel's 16-byte load of a row's leaves never reads past the column. */
+export declare const columnSlack = 16;
+/** Write kinds: a scalar of one view, or a tuple of `lanes` consecutive f32s, like a vec3; anything else uses `layout.write`. */
+export declare const writeF32 = 1;
+export declare const writeU32 = 2;
+export declare const writeI32 = 3;
+export declare const writeF64 = 4;
+export declare const writeF32Lanes = 5;
+export declare const writeGeneral = 0;
+export declare const writeOf: (layout: Layout) => {
+    readonly write: number;
+    readonly unitStride: number;
+    readonly unitOffset: number;
+    readonly lanes: number;
+};
+/** What stamping a row's ticks writes: a storage's, or a joined thread's view of one. */
+export type Stamped = Pick<Storage, "ticked" | "added" | "changed" | "chunkAdded" | "chunkChanged" | "blockAdded" | "blockChanged">;
+/**
+ * Stamps a row's `changed` tick, its block's and its chunk's. Ticks only increase, so theirs are the newest. Every
+ * writer stores the row, then the block, then the chunk, the reverse of the order filters read them, so a filter on
+ * another thread that finds a chunk newer finds its block and row newer too.
+ */
+export declare const stampChanged: (storage: Stamped, row: number, tick: number) => void;
+/**
+ * Raises the block and chunk ticks over rows `start` to `end - 1` to at least `tick`: for ticks written to those rows
+ * in bulk, or copied in from rows of other chunks.
+ */
+export declare const raiseRange: (chunks: Float64Array, blocks: Float64Array, start: number, end: number, tick: number) => void;
+/** A table of the entities that have exactly `components`, with exactly its shared values. Rows are dense: `0` to `count`. */
+export type Archetype = {
+    readonly id: number;
+    /** Sorted component ids. */
+    readonly components: readonly number[];
+    /**
+     * By component id, the number of the value it holds of each shared component (`shared.ts`), once for every row: its
+     * storage's layout holds the value. Empty without shared components.
+     */
+    shared: readonly (number | undefined)[];
+    /** By component id, the canonical text of each shared value it holds, which the layout directory carries to joined threads. */
+    texts: readonly (string | undefined)[];
+    /**
+     * Of one with shared values, reclaimed once empty and reused for others (`reclaim.ts`): its key in the world's
+     * lookup; whether it's reclaimed, waiting in its component set's pool; how many times it was reused; the sync point
+     * it was found empty at, by count, -1 while it isn't, and by tick; and the cached edges that lead to or from it, each
+     * cleared as it's reclaimed, null for none. Kept in place, not apart, so archetypes stay compact for runs.
+     */
+    key: string;
+    reclaimed: boolean;
+    generation: number;
+    emptiedAt: number;
+    emptiedTick: number;
+    edges: Edge[] | null;
+    /** By shared component id, then value number: the archetype with that value in place of its own, cached as moves first take it. */
+    readonly sharing: (Archetype | undefined)[][];
+    readonly storages: readonly Storage[];
+    readonly storageOf: ReadonlyMap<number, Storage>;
+    /** Storages by component id, for hot paths. */
+    readonly storageById: readonly (Storage | undefined)[];
+    /** The archetype with one more or one fewer component, by component id, cached as edges are first taken. */
+    readonly adding: (Archetype | undefined)[];
+    readonly removing: (Archetype | undefined)[];
+    /** For a move to another archetype: each component they share, as source and target storages. */
+    /** By target archetype id: the storages they share, as source and target pairs, flattened. */
+    readonly moves: (readonly Storage[] | undefined)[];
+    entities: Float64Array;
+    count: number;
+    capacity: number;
+    /** Holds the resource entity, so queries and systems never see it. */
+    readonly resource: boolean;
+    /** Whether a storage holds values as objects or strings, which a removed row must release. */
+    readonly objects: boolean;
+    /** Its storages of strings, whose records a removed row lets go. */
+    readonly strings: readonly Storage[];
+    /** The logs of the joined threads whose objects it holds, which its moves are appended to; null for none. */
+    logs: MoveLog[] | null;
+    /** Whether it's listed for the layout directory's next flush of counts. */
+    counted: boolean;
+    /** Incremented whenever arrays are replaced, so cached views can be refreshed. */
+    version: number;
+    /** How many times any of the world's archetypes' arrays were replaced, shared by them all. */
+    readonly replaced: {
+        count: number;
+    };
+    /** The world's archetypes created or bumped since the layout directory's last flush (`layout-directory.ts`). */
+    readonly bumped: Archetype[];
+    /** Whether this archetype is in `bumped`. */
+    listed: boolean;
+};
+/**
+ * A cached edge between two archetypes, one with shared values: `holder[key]` names its target, and holds `cleared`
+ * once either end is reclaimed. Kept in each end's `edges` holding it.
+ */
+export type Edge = {
+    readonly holder: object;
+    readonly key: PropertyKey;
+    readonly cleared: unknown;
+    readonly ends: readonly Archetype[];
+};
+/** Moves the version on once arrays are replaced, and lists the archetype for the layout directory's next flush. */
+export declare const bump: (archetype: Archetype) => void;
+/** An archetype without shared components holds no values: one empty list for them all. */
+export declare const noShared: readonly (number | undefined)[];
+/** Whether a storage's `changed` ticks are its `added` ticks: a constant's, whose value can't change, but a shared one's. */
+export declare const alias: (layout: Layout) => boolean;
+/**
+ * Starts keeping ticks for a storage, as if every row was added and changed at `tick`, so a system registered now sees
+ * every row on its first run, as it would had the ticks always been kept.
+ */
+export declare const startTicks: (memory: Memory, archetype: Archetype, storage: Storage, tick: number) => void;
+/**
+ * Creates an archetype, listed in `bumped` for the layout directory's next flush; storages of components a joined
+ * thread fills, by `remote`, hold their tags.
+ */
+export declare const createArchetype: (memory: Memory, strings: StringStore | null, id: number, components: readonly number[], layouts: readonly Layout[], resource: boolean, ticked: ReadonlySet<number>, bumped: Archetype[], replaced: {
+    count: number;
+}, remote: readonly (MoveLog | undefined)[], shared?: readonly (number | undefined)[], sharedLayouts?: readonly (Layout | undefined)[], texts?: readonly (string | undefined)[], key?: string) => Archetype;
+/**
+ * Lets go of an empty archetype's arrays, past what a new one holds: its columns, ticks and entities, each replaced
+ * by one of the first capacity, as when it was made. Its storages stay, so the edges that name them do.
+ */
+export declare const release: (memory: Memory, archetype: Archetype) => void;
+/** Grows once to fit `needed` rows, so a sync point adding many doesn't double over and over. */
+export declare const ensureCapacity: (memory: Memory, archetype: Archetype, needed: number) => void;
+/** Appends a row for `entity`, growing if full. Component values and ticks are left for the caller to write. */
+export declare const insertRow: (memory: Memory, archetype: Archetype, entity: number) => number;
+/** Copies one component's value, not its ticks, between rows of storages with the same layout. */
+export declare const copyValue: (from: Storage, fromRow: number, to: Storage, toRow: number) => void;
+/** Copies one component's value and ticks between rows of storages with the same layout. */
+export declare const copyCell: (from: Storage, fromRow: number, to: Storage, toRow: number) => void;
+/** Removes a row by moving the last row into it. Returns the moved entity, or -1 if the removed row was last. */
+export declare const swapRemove: (archetype: Archetype, row: number) => number;
+/**
+ * Gives a storage's objects to the joined thread `log` is for: its values are released, every row starting there at
+ * its start, and its tags are kept in their place. Allocates, so it runs only between runs.
+ */
+export declare const makeRemote: (memory: Memory, archetype: Archetype, storage: Storage, log: MoveLog) => void;
+/**
+ * Takes a storage's objects back from a joined thread that's gone: each row at the value its tag names, `null` or its
+ * start, since a slot's value was the thread's. Allocates, so it runs only between runs.
+ */
+export declare const makeLocal: (memory: Memory, archetype: Archetype, storage: Storage, start: unknown) => void;

package/dist/implementation/world/archetype.js

@@ -0,0 +1,402 @@
+import { allocateArray, allocateViews, emptyViews, freeArray, freeViews, growArray } from './arrays.js';
+import { blockShift, chunkShift } from './kernel.js';
+import { nullTag, startTag } from './move-log.js';
+/** Bytes after a column's last row, so a WASM kernel's 16-byte load of a row's leaves never reads past the column. */
+export const columnSlack = 16;
+/** Write kinds: a scalar of one view, or a tuple of `lanes` consecutive f32s, like a vec3; anything else uses `layout.write`. */
+export const writeF32 = 1;
+export const writeU32 = 2;
+export const writeI32 = 3;
+export const writeF64 = 4;
+export const writeF32Lanes = 5;
+export const writeGeneral = 0;
+export const writeOf = (layout) => {
+    const general = { write: writeGeneral, unitStride: 0, unitOffset: 0, lanes: 0 };
+    if (layout.kind !== "linear")
+        return general;
+    const [first] = layout.leaves;
+    if (first === undefined || layout.leaves.some(leaf => leaf.scalar === "boolean"))
+        return general;
+    if (layout.leaves.length === 1 && first.path.length === 0) {
+        const kinds = { f32: writeF32, u32: writeU32, i32: writeI32, f64: writeF64 };
+        return { write: kinds[first.view] ?? writeGeneral, unitStride: first.unitStride, unitOffset: first.unitOffset, lanes: 1 };
+    }
+    const lanes = layout.leaves.every((leaf, i) => leaf.view === "f32" && leaf.path.length === 1 && leaf.path[0] === i && leaf.unitStride === first.unitStride && leaf.unitOffset === first.unitOffset + i);
+    return lanes ? { write: writeF32Lanes, unitStride: first.unitStride, unitOffset: first.unitOffset, lanes: layout.leaves.length } : general;
+};
+/** Chunks covering `capacity` rows. */
+const chunksFor = (capacity) => Math.max(1, Math.ceil(capacity / 2 ** chunkShift));
+/** Blocks covering those chunks, so every row of a chunk has a block. */
+const blocksFor = (capacity) => chunksFor(capacity) << (chunkShift - blockShift);
+/**
+ * Stamps a row's `changed` tick, its block's and its chunk's. Ticks only increase, so theirs are the newest. Every
+ * writer stores the row, then the block, then the chunk, the reverse of the order filters read them, so a filter on
+ * another thread that finds a chunk newer finds its block and row newer too.
+ */
+export const stampChanged = (storage, row, tick) => {
+    if (!storage.ticked)
+        return;
+    storage.changed[row] = tick;
+    storage.blockChanged[row >> blockShift] = tick;
+    storage.chunkChanged[row >> chunkShift] = tick;
+};
+/**
+ * Raises the block and chunk ticks over rows `start` to `end - 1` to at least `tick`: for ticks written to those rows
+ * in bulk, or copied in from rows of other chunks.
+ */
+export const raiseRange = (chunks, blocks, start, end, tick) => {
+    if (start >= end)
+        return;
+    for (let block = start >> blockShift, last = (end - 1) >> blockShift; block <= last; block++)
+        if (blocks[block] < tick)
+            blocks[block] = tick;
+    for (let chunk = start >> chunkShift, last = (end - 1) >> chunkShift; chunk <= last; chunk++)
+        if (chunks[chunk] < tick)
+            chunks[chunk] = tick;
+};
+/** Moves the version on once arrays are replaced, and lists the archetype for the layout directory's next flush. */
+export const bump = (archetype) => {
+    archetype.version++;
+    archetype.replaced.count++;
+    if (archetype.listed)
+        return;
+    archetype.listed = true;
+    archetype.bumped.push(archetype);
+};
+const initialCapacity = 16;
+/** An archetype without shared components holds no values: one empty list for them all. */
+export const noShared = [];
+const noLayouts = [];
+const noTexts = [];
+/** The tick arrays of a storage without ticks. */
+const noTicks = new Float64Array(0);
+/** The tags of a storage whose values the world's thread holds. */
+const noTags = new Uint32Array(0);
+/** Whether a storage's `changed` ticks are its `added` ticks: a constant's, whose value can't change, but a shared one's. */
+export const alias = (layout) => layout.kind === "constant" && layout.shared !== true;
+/**
+ * Gives a storage tick arrays for `capacity` rows, every tick set to `tick`. A constant's value can't change, so its
+ * `changed` ticks are its `added` ticks: tags cost one tick per row. A shared component's value changes as its entity
+ * moves, so it keeps both.
+ */
+const allocateTicks = (memory, storage, capacity, tick) => {
+    storage.ticked = true;
+    storage.added = allocateArray(memory, Float64Array, capacity).fill(tick);
+    const aliased = alias(storage.layout);
+    storage.changed = aliased ? storage.added : allocateArray(memory, Float64Array, capacity).fill(tick);
+    storage.chunkAdded = allocateArray(memory, Float64Array, chunksFor(capacity)).fill(tick);
+    storage.chunkChanged = aliased ? storage.chunkAdded : allocateArray(memory, Float64Array, chunksFor(capacity)).fill(tick);
+    storage.blockAdded = allocateArray(memory, Float64Array, blocksFor(capacity)).fill(tick);
+    storage.blockChanged = aliased ? storage.blockAdded : allocateArray(memory, Float64Array, blocksFor(capacity)).fill(tick);
+};
+/** Views of a new column, for a linear layout's or a string's `capacity` rows; a string's handles start at 0. */
+const columnOf = (memory, layout, capacity) => {
+    if (layout.kind === "linear")
+        return allocateViews(memory, capacity * layout.stride + columnSlack);
+    if (layout.kind !== "string")
+        return emptyViews;
+    const views = allocateViews(memory, capacity * layout.stride + columnSlack);
+    views.u32.fill(0);
+    return views;
+};
+const createStorage = (memory, strings, component, layout, capacity, ticked) => {
+    const storage = {
+        component,
+        layout,
+        views: columnOf(memory, layout, capacity),
+        strings: layout.kind === "string" ? strings : null,
+        values: [],
+        ...writeOf(layout),
+        words: layout.kind === "linear" && (layout.stride & 3) === 0 ? layout.stride >> 2 : 0,
+        ticked: false,
+        added: noTicks,
+        changed: noTicks,
+        chunkAdded: noTicks,
+        chunkChanged: noTicks,
+        blockAdded: noTicks,
+        blockChanged: noTicks,
+        columnChanged: 0,
+        remote: null,
+        tags: noTags,
+    };
+    if (ticked)
+        allocateTicks(memory, storage, capacity, 0);
+    return storage;
+};
+/**
+ * Starts keeping ticks for a storage, as if every row was added and changed at `tick`, so a system registered now sees
+ * every row on its first run, as it would had the ticks always been kept.
+ */
+export const startTicks = (memory, archetype, storage, tick) => {
+    if (storage.ticked)
+        return;
+    allocateTicks(memory, storage, archetype.capacity, tick);
+    bump(archetype);
+};
+/**
+ * Creates an archetype, listed in `bumped` for the layout directory's next flush; storages of components a joined
+ * thread fills, by `remote`, hold their tags.
+ */
+export const createArchetype = (memory, strings, id, components, layouts, resource, ticked, bumped, replaced, remote, shared = noShared, sharedLayouts = noLayouts, texts = noTexts, key = "") => {
+    const storages = components.map(component => createStorage(memory, strings, component, sharedLayouts[component] ?? layouts[component], initialCapacity, resource || ticked.has(component)));
+    const storageById = [];
+    for (const storage of storages)
+        storageById[storage.component] = storage;
+    const archetype = {
+        id,
+        components,
+        shared,
+        texts,
+        key,
+        reclaimed: false,
+        generation: 0,
+        emptiedAt: -1,
+        emptiedTick: -1,
+        edges: null,
+        sharing: [],
+        storages,
+        storageOf: new Map(storages.map(storage => [storage.component, storage])),
+        storageById,
+        adding: [],
+        removing: [],
+        moves: [],
+        entities: allocateArray(memory, Float64Array, initialCapacity),
+        count: 0,
+        capacity: initialCapacity,
+        resource,
+        objects: storages.some(storage => storage.layout.kind === "object" || storage.layout.kind === "string"),
+        strings: storages.filter(storage => storage.layout.kind === "string"),
+        version: 0,
+        replaced,
+        bumped,
+        listed: true,
+        logs: null,
+        counted: false,
+    };
+    bumped.push(archetype);
+    for (const storage of storages) {
+        const log = remote[storage.component];
+        if (log !== undefined)
+            makeRemote(memory, archetype, storage, log);
+    }
+    return archetype;
+};
+const growViews = (memory, storage, capacity, count) => {
+    const { layout } = storage;
+    if (layout.kind !== "linear" && layout.kind !== "string")
+        return;
+    const grown = allocateViews(memory, capacity * layout.stride + columnSlack);
+    grown.u8.set(storage.views.u8.subarray(0, count * layout.stride));
+    if (layout.kind === "string")
+        grown.u32.fill(0, count);
+    freeViews(memory, storage.views);
+    storage.views = grown;
+};
+const grow = (memory, archetype, capacity = archetype.capacity * 2) => {
+    const { count } = archetype;
+    for (const storage of archetype.storages) {
+        growViews(memory, storage, capacity, count);
+        if (storage.remote !== null)
+            storage.tags = growArray(memory, storage.tags, Uint32Array, capacity, count);
+        if (!storage.ticked)
+            continue;
+        const shared = storage.changed === storage.added;
+        storage.added = growArray(memory, storage.added, Float64Array, capacity, count);
+        storage.changed = shared ? storage.added : growArray(memory, storage.changed, Float64Array, capacity, count);
+        const chunks = chunksFor(capacity);
+        if (chunks > storage.chunkAdded.length) {
+            const used = storage.chunkAdded.length;
+            storage.chunkAdded = growArray(memory, storage.chunkAdded, Float64Array, chunks, used).fill(0, used);
+            storage.chunkChanged = shared ? storage.chunkAdded : growArray(memory, storage.chunkChanged, Float64Array, chunks, used).fill(0, used);
+            const blocks = blocksFor(capacity);
+            const usedBlocks = storage.blockAdded.length;
+            storage.blockAdded = growArray(memory, storage.blockAdded, Float64Array, blocks, usedBlocks).fill(0, usedBlocks);
+            storage.blockChanged = shared ? storage.blockAdded : growArray(memory, storage.blockChanged, Float64Array, blocks, usedBlocks).fill(0, usedBlocks);
+        }
+    }
+    archetype.entities = growArray(memory, archetype.entities, Float64Array, capacity, count);
+    archetype.capacity = capacity;
+    bump(archetype);
+};
+/**
+ * Lets go of an empty archetype's arrays, past what a new one holds: its columns, ticks and entities, each replaced
+ * by one of the first capacity, as when it was made. Its storages stay, so the edges that name them do.
+ */
+export const release = (memory, archetype) => {
+    if (archetype.capacity <= initialCapacity)
+        return;
+    const capacity = initialCapacity;
+    for (const storage of archetype.storages) {
+        const { layout } = storage;
+        if (layout.kind === "linear" || layout.kind === "string") {
+            freeViews(memory, storage.views);
+            storage.views = columnOf(memory, layout, capacity);
+        }
+        if (storage.remote !== null) {
+            freeArray(memory, storage.tags);
+            storage.tags = allocateArray(memory, Uint32Array, capacity).fill(startTag);
+        }
+        storage.values.length = 0;
+        if (!storage.ticked)
+            continue;
+        const aliased = storage.changed === storage.added;
+        freeArray(memory, storage.added);
+        if (!aliased)
+            freeArray(memory, storage.changed);
+        freeArray(memory, storage.chunkAdded);
+        if (!aliased)
+            freeArray(memory, storage.chunkChanged);
+        freeArray(memory, storage.blockAdded);
+        if (!aliased)
+            freeArray(memory, storage.blockChanged);
+        // As it starts: new rows' ticks are written as they arrive.
+        storage.added = allocateArray(memory, Float64Array, capacity).fill(0);
+        storage.changed = aliased ? storage.added : allocateArray(memory, Float64Array, capacity).fill(0);
+        storage.chunkAdded = allocateArray(memory, Float64Array, chunksFor(capacity)).fill(0);
+        storage.chunkChanged = aliased ? storage.chunkAdded : allocateArray(memory, Float64Array, chunksFor(capacity)).fill(0);
+        storage.blockAdded = allocateArray(memory, Float64Array, blocksFor(capacity)).fill(0);
+        storage.blockChanged = aliased ? storage.blockAdded : allocateArray(memory, Float64Array, blocksFor(capacity)).fill(0);
+        storage.columnChanged = 0;
+    }
+    freeArray(memory, archetype.entities);
+    archetype.entities = allocateArray(memory, Float64Array, capacity);
+    archetype.capacity = capacity;
+    bump(archetype);
+};
+/** Grows once to fit `needed` rows, so a sync point adding many doesn't double over and over. */
+export const ensureCapacity = (memory, archetype, needed) => {
+    if (needed <= archetype.capacity)
+        return;
+    let capacity = archetype.capacity;
+    while (capacity < needed)
+        capacity *= 2;
+    grow(memory, archetype, capacity);
+};
+/** Appends a row for `entity`, growing if full. Component values and ticks are left for the caller to write. */
+export const insertRow = (memory, archetype, entity) => {
+    if (archetype.count === archetype.capacity)
+        grow(memory, archetype);
+    const row = archetype.count++;
+    archetype.entities[row] = entity;
+    return row;
+};
+/** Copies one element of `stride` bytes: by 32-bit words when it's a multiple of 4, which every GPU layout is. */
+const copyElement = (from, fromRow, to, toRow, stride) => {
+    if ((stride & 3) === 0) {
+        const words = stride >> 2;
+        const source = fromRow * words;
+        const target = toRow * words;
+        for (let i = 0; i < words; i++)
+            to.u32[target + i] = from.u32[source + i];
+        return;
+    }
+    const source = fromRow * stride;
+    const target = toRow * stride;
+    for (let i = 0; i < stride; i++)
+        to.u8[target + i] = from.u8[source + i];
+};
+/** Copies one component's value, not its ticks, between rows of storages with the same layout. */
+export const copyValue = (from, fromRow, to, toRow) => {
+    const { layout, words } = from;
+    if (words > 0) {
+        const source = from.views.u32;
+        const target = to.views.u32;
+        const s = fromRow * words;
+        const t = toRow * words;
+        for (let i = 0; i < words; i++)
+            target[t + i] = source[s + i];
+    }
+    else if (layout.kind === "linear")
+        copyElement(from.views, fromRow, to.views, toRow, layout.stride);
+    // A string's record goes with its value: its handle moves, and isn't let go.
+    else if (layout.kind === "string") {
+        to.views.u32[toRow] = from.views.u32[fromRow];
+        to.values[toRow] = from.values[fromRow];
+    }
+    else if (layout.kind === "object") {
+        if (to.remote === null)
+            to.values[toRow] = from.values[fromRow];
+        else
+            to.tags[toRow] = from.tags[fromRow];
+    }
+};
+/** Copies one component's value and ticks between rows of storages with the same layout. */
+export const copyCell = (from, fromRow, to, toRow) => {
+    copyValue(from, fromRow, to, toRow);
+    // A component keeps ticks in every archetype or in none.
+    if (!to.ticked)
+        return;
+    const added = from.added[fromRow];
+    const changed = from.changed[fromRow];
+    to.added[toRow] = added;
+    to.changed[toRow] = changed;
+    // A block's and a chunk's tick are the newest of their rows, so a row moving in can raise them.
+    const block = toRow >> blockShift;
+    if (added > to.blockAdded[block])
+        to.blockAdded[block] = added;
+    if (changed > to.blockChanged[block])
+        to.blockChanged[block] = changed;
+    const chunk = toRow >> chunkShift;
+    if (added > to.chunkAdded[chunk])
+        to.chunkAdded[chunk] = added;
+    if (changed > to.chunkChanged[chunk])
+        to.chunkChanged[chunk] = changed;
+};
+/** Removes a row by moving the last row into it. Returns the moved entity, or -1 if the removed row was last. */
+export const swapRemove = (archetype, row) => {
+    const last = --archetype.count;
+    if (row === last && !archetype.objects)
+        return -1;
+    const moved = row === last ? -1 : archetype.entities[last];
+    for (const storage of archetype.storages) {
+        if (moved !== -1)
+            copyCell(storage, last, storage, row);
+        if (storage.layout.kind === "object" && storage.remote === null)
+            storage.values[last] = undefined;
+        // A string's record went with the row's entity or was let go; the row past the count holds none.
+        else if (storage.layout.kind === "string") {
+            storage.values[last] = undefined;
+            storage.views.u32[last] = 0;
+        }
+    }
+    if (moved !== -1)
+        archetype.entities[row] = moved;
+    return moved;
+};
+/**
+ * Gives a storage's objects to the joined thread `log` is for: its values are released, every row starting there at
+ * its start, and its tags are kept in their place. Allocates, so it runs only between runs.
+ */
+export const makeRemote = (memory, archetype, storage, log) => {
+    storage.remote = log;
+    storage.tags = allocateArray(memory, Uint32Array, archetype.capacity).fill(startTag);
+    storage.values.length = 0;
+    if (archetype.logs === null)
+        archetype.logs = [log];
+    else if (!archetype.logs.includes(log))
+        archetype.logs.push(log);
+    if (!log.archetypes.includes(archetype))
+        log.archetypes.push(archetype);
+    bump(archetype);
+};
+/**
+ * Takes a storage's objects back from a joined thread that's gone: each row at the value its tag names, `null` or its
+ * start, since a slot's value was the thread's. Allocates, so it runs only between runs.
+ */
+export const makeLocal = (memory, archetype, storage, start) => {
+    const log = storage.remote;
+    if (log === null)
+        return;
+    for (let row = 0; row < archetype.count; row++)
+        storage.values[row] = storage.tags[row] === nullTag ? null : start;
+    freeArray(memory, storage.tags);
+    storage.tags = noTags;
+    storage.remote = null;
+    if (!archetype.storages.some(other => other.remote === log)) {
+        const logs = (archetype.logs ?? []).filter(other => other !== log);
+        archetype.logs = logs.length === 0 ? null : logs;
+        log.archetypes.splice(log.archetypes.indexOf(archetype), 1);
+    }
+    bump(archetype);
+};
+//# sourceMappingURL=archetype.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"archetype.js","sourceRoot":"","sources":["../../../src/implementation/world/archetype.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxG,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAErD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAgB,MAAM,eAAe,CAAC;AAkDhE,sHAAsH;AACtH,MAAM,CAAC,MAAM,WAAW,GAAG,EAAE,CAAC;AAE9B,iIAAiI;AACjI,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAC;AAC1B,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAC;AAC1B,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAC;AAC1B,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAC;AAC1B,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAC;AAC/B,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAC;AAE9B,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,MAAc,EAAgH,EAAE;IACpJ,MAAM,OAAO,GAAG,EAAE,KAAK,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IAChF,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,OAAO,CAAC;IAC7C,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IAC9B,IAAI,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC;QAAE,OAAO,OAAO,CAAC;IACjG,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxD,MAAM,KAAK,GAAwC,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC;QAClH,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,YAAY,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IAC9H,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IACxM,OAAO,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;AAC/I,CAAC,CAAC;AAEF,uCAAuC;AACvC,MAAM,SAAS,GAAG,CAAC,QAAgB,EAAU,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC;AACnG,yEAAyE;AACzE,MAAM,SAAS,GAAG,CAAC,QAAgB,EAAU,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,CAAC;AAKjG;;;;GAIG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,OAAgB,EAAE,GAAW,EAAE,IAAY,EAAQ,EAAE;IAC9E,IAAI,CAAC,OAAO,CAAC,MAAM;QAAE,OAAO;IAC5B,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;IAC5B,OAAO,CAAC,YAAY,CAAC,GAAG,IAAI,UAAU,CAAC,GAAG,IAAI,CAAC;IAC/C,OAAO,CAAC,YAAY,CAAC,GAAG,IAAI,UAAU,CAAC,GAAG,IAAI,CAAC;AACnD,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,MAAoB,EAAE,MAAoB,EAAE,KAAa,EAAE,GAAW,EAAE,IAAY,EAAQ,EAAE;IACrH,IAAI,KAAK,IAAI,GAAG;QAAE,OAAO;IACzB,KAAK,IAAI,KAAK,GAAG,KAAK,IAAI,UAAU,EAAE,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,UAAU,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,EAAE;QAAE,IAAI,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI;YAAE,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;IAC7I,KAAK,IAAI,KAAK,GAAG,KAAK,IAAI,UAAU,EAAE,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,UAAU,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,EAAE;QAAE,IAAI,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI;YAAE,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;AACjJ,CAAC,CAAC;AAmEF,oHAAoH;AACpH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,SAAoB,EAAQ,EAAE;IAC/C,SAAS,CAAC,OAAO,EAAE,CAAC;IACpB,SAAS,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IAC3B,IAAI,SAAS,CAAC,MAAM;QAAE,OAAO;IAC7B,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC;IACxB,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;AACrC,CAAC,CAAC;AAEF,MAAM,eAAe,GAAG,EAAE,CAAC;AAE3B,2FAA2F;AAC3F,MAAM,CAAC,MAAM,QAAQ,GAAoC,EAAE,CAAC;AAC5D,MAAM,SAAS,GAAoC,EAAE,CAAC;AACtD,MAAM,OAAO,GAAoC,EAAE,CAAC;AAEpD,kDAAkD;AAClD,MAAM,OAAO,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;AACpC,mEAAmE;AACnE,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;AAElC,6HAA6H;AAC7H,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,MAAc,EAAW,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC;AAEvG;;;;GAIG;AACH,MAAM,aAAa,GAAG,CAAC,MAAc,EAAE,OAAgB,EAAE,QAAgB,EAAE,IAAY,EAAQ,EAAE;IAC7F,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IACtB,OAAO,CAAC,KAAK,GAAG,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzE,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACtC,OAAO,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrG,OAAO,CAAC,UAAU,GAAG,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzF,OAAO,CAAC,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1H,OAAO,CAAC,UAAU,GAAG,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzF,OAAO,CAAC,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC9H,CAAC,CAAC;AAEF,iHAAiH;AACjH,MAAM,QAAQ,GAAG,CAAC,MAAc,EAAE,MAAc,EAAE,QAAgB,EAAS,EAAE;IACzE,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,aAAa,CAAC,MAAM,EAAE,QAAQ,GAAG,MAAM,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC;IACnG,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,UAAU,CAAC;IAChD,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,EAAE,QAAQ,GAAG,MAAM,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC;IAC5E,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF,MAAM,aAAa,GAAG,CAAC,MAAc,EAAE,OAA2B,EAAE,SAAiB,EAAE,MAAc,EAAE,QAAgB,EAAE,MAAe,EAAW,EAAE;IACjJ,MAAM,OAAO,GAAY;QACrB,SAAS;QACT,MAAM;QACN,KAAK,EAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC;QACzC,OAAO,EAAE,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QAClD,MAAM,EAAE,EAAE;QACV,GAAG,OAAO,CAAC,MAAM,CAAC;QAClB,KAAK,EAAE,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACrF,MAAM,EAAE,KAAK;QACb,KAAK,EAAE,OAAO;QACd,OAAO,EAAE,OAAO;QAChB,UAAU,EAAE,OAAO;QACnB,YAAY,EAAE,OAAO;QACrB,UAAU,EAAE,OAAO;QACnB,YAAY,EAAE,OAAO;QACrB,aAAa,EAAE,CAAC;QAChB,MAAM,EAAE,IAAI;QACZ,IAAI,EAAE,MAAM;KACf,CAAC;IACF,IAAI,MAAM;QAAE,aAAa,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;IACxD,OAAO,OAAO,CAAC;AACnB,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,MAAc,EAAE,SAAoB,EAAE,OAAgB,EAAE,IAAY,EAAQ,EAAE;IACrG,IAAI,OAAO,CAAC,MAAM;QAAE,OAAO;IAC3B,aAAa,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IACzD,IAAI,CAAC,SAAS,CAAC,CAAC;AACpB,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,MAAc,EAAE,OAA2B,EAAE,EAAU,EAAE,UAA6B,EAAE,OAA0B,EAAE,QAAiB,EAAE,MAA2B,EAAE,MAAmB,EAAE,QAA2B,EAAE,MAAwC,EAAE,SAA0C,QAAQ,EAAE,gBAAiD,SAAS,EAAE,QAAyC,OAAO,EAAE,GAAG,GAAG,EAAE,EAAa,EAAE;IACrd,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,aAAa,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,aAAa,CAAC,SAAS,CAAC,IAAI,OAAO,CAAC,SAAS,CAAC,EAAE,eAAe,EAAE,QAAQ,IAAI,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAC5L,MAAM,WAAW,GAA4B,EAAE,CAAC;IAChD,KAAK,MAAM,OAAO,IAAI,QAAQ;QAAE,WAAW,CAAC,OAAO,CAAC,SAAS,CAAC,GAAG,OAAO,CAAC;IACzE,MAAM,SAAS,GAAc;QACzB,EAAE;QACF,UAAU;QACV,MAAM;QACN,KAAK;QACL,GAAG;QACH,SAAS,EAAE,KAAK;QAChB,UAAU,EAAE,CAAC;QACb,SAAS,EAAE,CAAC,CAAC;QACb,WAAW,EAAE,CAAC,CAAC;QACf,KAAK,EAAE,IAAI;QACX,OAAO,EAAE,EAAE;QACX,QAAQ;QACR,SAAS,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;QACzE,WAAW;QACX,MAAM,EAAE,EAAE;QACV,QAAQ,EAAE,EAAE;QACZ,KAAK,EAAE,EAAE;QACT,QAAQ,EAAE,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,eAAe,CAAC;QAC9D,KAAK,EAAE,CAAC;QACR,QAAQ,EAAE,eAAe;QACzB,QAAQ;QACR,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC;QACvG,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC;QACrE,OAAO,EAAE,CAAC;QACV,QAAQ;QACR,MAAM;QACN,MAAM,EAAE,IAAI;QACZ,IAAI,EAAE,IAAI;QACV,OAAO,EAAE,KAAK;KACjB,CAAC;IACF,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACvB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACtC,IAAI,GAAG,KAAK,SAAS;YAAE,UAAU,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;IACvE,CAAC;IACD,OAAO,SAAS,CAAC;AACrB,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,CAAC,MAAc,EAAE,OAAgB,EAAE,QAAgB,EAAE,KAAa,EAAQ,EAAE;IAC1F,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;IAC3B,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO;IACjE,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,EAAE,QAAQ,GAAG,MAAM,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC;IAC5E,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAClE,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;QAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACvD,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;IACjC,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC;AAC1B,CAAC,CAAC;AAEF,MAAM,IAAI,GAAG,CAAC,MAAc,EAAE,SAAoB,EAAE,QAAQ,GAAG,SAAS,CAAC,QAAQ,GAAG,CAAC,EAAQ,EAAE;IAC3F,MAAM,EAAE,KAAK,EAAE,GAAG,SAAS,CAAC;IAC5B,KAAK,MAAM,OAAO,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;QACvC,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAC5C,IAAI,OAAO,CAAC,MAAM,KAAK,IAAI;YAAE,OAAO,CAAC,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAC1G,IAAI,CAAC,OAAO,CAAC,MAAM;YAAE,SAAS;QAC9B,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,KAAK,OAAO,CAAC,KAAK,CAAC;QACjD,OAAO,CAAC,KAAK,GAAG,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,EAAE,YAAY,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAChF,OAAO,CAAC,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAC7G,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;QACnC,IAAI,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC;YACvC,OAAO,CAAC,UAAU,GAAG,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,UAAU,EAAE,YAAY,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACrG,OAAO,CAAC,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,YAAY,EAAE,YAAY,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACvI,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;YACnC,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC;YAC7C,OAAO,CAAC,UAAU,GAAG,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,UAAU,EAAE,YAAY,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YACjH,OAAO,CAAC,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,YAAY,EAAE,YAAY,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QACvJ,CAAC;IACL,CAAC;IACD,SAAS,CAAC,QAAQ,GAAG,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,QAAQ,EAAE,YAAY,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC1F,SAAS,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC9B,IAAI,CAAC,SAAS,CAAC,CAAC;AACpB,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,MAAc,EAAE,SAAoB,EAAQ,EAAE;IAClE,IAAI,SAAS,CAAC,QAAQ,IAAI,eAAe;QAAE,OAAO;IAClD,MAAM,QAAQ,GAAG,eAAe,CAAC;IACjC,KAAK,MAAM,OAAO,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;QACvC,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;QAC3B,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACvD,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QACvD,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YAC1B,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;YAChC,OAAO,CAAC,IAAI,GAAG,aAAa,CAAC,MAAM,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/E,CAAC;QACD,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,OAAO,CAAC,MAAM;YAAE,SAAS;QAC9B,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,KAAK,OAAO,CAAC,KAAK,CAAC;QAClD,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,OAAO;YAAE,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;QACjD,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO;YAAE,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,YAAY,CAAC,CAAC;QACtD,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO;YAAE,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,YAAY,CAAC,CAAC;QACtD,4DAA4D;QAC5D,OAAO,CAAC,KAAK,GAAG,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtE,OAAO,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClG,OAAO,CAAC,UAAU,GAAG,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtF,OAAO,CAAC,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvH,OAAO,CAAC,UAAU,GAAG,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtF,OAAO,CAAC,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvH,OAAO,CAAC,aAAa,GAAG,CAAC,CAAC;IAC9B,CAAC;IACD,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC;IACtC,SAAS,CAAC,QAAQ,GAAG,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;IACnE,SAAS,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC9B,IAAI,CAAC,SAAS,CAAC,CAAC;AACpB,CAAC,CAAC;AAEF,iGAAiG;AACjG,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,MAAc,EAAE,SAAoB,EAAE,MAAc,EAAQ,EAAE;IACzF,IAAI,MAAM,IAAI,SAAS,CAAC,QAAQ;QAAE,OAAO;IACzC,IAAI,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;IAClC,OAAO,QAAQ,GAAG,MAAM;QAAE,QAAQ,IAAI,CAAC,CAAC;IACxC,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;AACtC,CAAC,CAAC;AAEF,gHAAgH;AAChH,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,MAAc,EAAE,SAAoB,EAAE,MAAc,EAAU,EAAE;IACtF,IAAI,SAAS,CAAC,KAAK,KAAK,SAAS,CAAC,QAAQ;QAAE,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACpE,MAAM,GAAG,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC;IAC9B,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;IACjC,OAAO,GAAG,CAAC;AACf,CAAC,CAAC;AAEF,kHAAkH;AAClH,MAAM,WAAW,GAAG,CAAC,IAAW,EAAE,OAAe,EAAE,EAAS,EAAE,KAAa,EAAE,MAAc,EAAQ,EAAE;IACjG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;QACrB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,OAAO,GAAG,KAAK,CAAC;QAC/B,MAAM,MAAM,GAAG,KAAK,GAAG,KAAK,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;YAAE,EAAE,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1E,OAAO;IACX,CAAC;IACD,MAAM,MAAM,GAAG,OAAO,GAAG,MAAM,CAAC;IAChC,MAAM,MAAM,GAAG,KAAK,GAAG,MAAM,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;QAAE,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC7E,CAAC,CAAC;AAEF,kGAAkG;AAClG,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,IAAa,EAAE,OAAe,EAAE,EAAW,EAAE,KAAa,EAAQ,EAAE;IAC1F,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;IAC/B,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACZ,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;QAC9B,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC;QAC5B,MAAM,CAAC,GAAG,OAAO,GAAG,KAAK,CAAC;QAC1B,MAAM,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClE,CAAC;SACI,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;QAAE,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;IACpG,6EAA6E;SACxE,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAChC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC9C,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC5C,CAAC;SACI,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAChC,IAAI,EAAE,CAAC,MAAM,KAAK,IAAI;YAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;;YAC3D,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7C,CAAC;AACL,CAAC,CAAC;AAEF,4FAA4F;AAC5F,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,IAAa,EAAE,OAAe,EAAE,EAAW,EAAE,KAAa,EAAQ,EAAE;IACzF,SAAS,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;IACpC,yDAAyD;IACzD,IAAI,CAAC,EAAE,CAAC,MAAM;QAAE,OAAO;IACvB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACtC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IACxB,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;IAC5B,gGAAgG;IAChG,MAAM,KAAK,GAAG,KAAK,IAAI,UAAU,CAAC;IAClC,IAAI,KAAK,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC;QAAE,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IAC/D,IAAI,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC;QAAE,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;IACvE,MAAM,KAAK,GAAG,KAAK,IAAI,UAAU,CAAC;IAClC,IAAI,KAAK,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC;QAAE,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IAC/D,IAAI,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC;QAAE,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;AAC3E,CAAC,CAAC;AAEF,iHAAiH;AACjH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,SAAoB,EAAE,GAAW,EAAU,EAAE;IACpE,MAAM,IAAI,GAAG,EAAE,SAAS,CAAC,KAAK,CAAC;IAC/B,IAAI,GAAG,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO;QAAE,OAAO,CAAC,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC3D,KAAK,MAAM,OAAO,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;QACvC,IAAI,KAAK,KAAK,CAAC,CAAC;YAAE,QAAQ,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;QACxD,IAAI,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,OAAO,CAAC,MAAM,KAAK,IAAI;YAAE,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;QAClG,iGAAiG;aAC5F,IAAI,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACxC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;YACjC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChC,CAAC;IACL,CAAC;IACD,IAAI,KAAK,KAAK,CAAC,CAAC;QAAE,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IAClD,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,MAAc,EAAE,SAAoB,EAAE,OAAgB,EAAE,GAAY,EAAQ,EAAE;IACrG,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC;IACrB,OAAO,CAAC,IAAI,GAAG,aAAa,CAAC,MAAM,EAAE,WAAW,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACrF,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1B,IAAI,SAAS,CAAC,IAAI,KAAK,IAAI;QAAE,SAAS,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;SAC/C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjE,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC;QAAE,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxE,IAAI,CAAC,SAAS,CAAC,CAAC;AACpB,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,MAAc,EAAE,SAAoB,EAAE,OAAgB,EAAE,KAAc,EAAQ,EAAE;IACtG,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC;IAC3B,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO;IACzB,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE;QAAE,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;IACnH,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAChC,OAAO,CAAC,IAAI,GAAG,MAAM,CAAC;IACtB,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IACtB,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,GAAG,CAAC,EAAE,CAAC;QAC1D,MAAM,IAAI,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC;QACnE,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACjD,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC;IAChE,CAAC;IACD,IAAI,CAAC,SAAS,CAAC,CAAC;AACpB,CAAC,CAAC"}

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

@@ -0,0 +1,29 @@
+import { type Layout, type TypedArray, type Views } from '../../interface/registry/layout.js';
+import type { Memory } from './memory.js';
+export type ArrayConstructor<T> = {
+    new (buffer: ArrayBufferLike, byteOffset: number, length: number): T;
+    readonly BYTES_PER_ELEMENT: number;
+};
+type View = {
+    readonly byteOffset: number;
+    readonly byteLength: number;
+};
+/** A typed array over a new arena block. Contents are unspecified. */
+export declare const allocateArray: <T>(memory: Memory, constructor: ArrayConstructor<T>, length: number) => T;
+export declare const freeArray: (memory: Memory, array: View) => void;
+/** Moves the first `used` elements into a new block of `length` and frees the old one. */
+export declare const growArray: <T extends View & {
+    set(source: ArrayLike<number>): void;
+    subarray(start: number, end: number): ArrayLike<number>;
+}>(memory: Memory, array: T, constructor: ArrayConstructor<T>, length: number, used: number) => T;
+/** Views of a new arena block of `bytes`, for one component's interleaved column. Contents are unspecified. */
+export declare const allocateViews: (memory: Memory, bytes: number) => Views;
+export declare const freeViews: (memory: Memory, views: Views) => void;
+/** Views of no bytes, for components with nothing to store. */
+export declare const emptyViews: Views;
+/** A kernel's column of a component an archetype lacks, optional in its system: empty, so its reads give undefined. */
+export declare const absentColumn: (layout: Layout, source: {
+    readonly kind: string;
+    readonly leaf?: number;
+}) => TypedArray;
+export {};