@adobe/ecs 0.0.0-stage → 0.1.0

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

@@ -0,0 +1,64 @@
+import { recordBytes } from '../../interface/gpu/record.js';
+import type { Archetype, Storage } from './archetype.js';
+export { recordBytes };
+export declare const recordWords: number;
+/**
+ * A world's GPU state: a heap buffer holding the GPU copies of the storages GPU systems use, one buffer of 256-byte
+ * records, and the run's command encoder. Nothing here is exposed: render bodies get bind calls, not buffers, so
+ * both buffers can be replaced as they grow.
+ */
+export type GpuEngine = {
+    readonly device: GPUDevice;
+    /** Heap (read-only storage) at binding 0, a table record (uniform, dynamic offset) at binding 1. */
+    readonly renderLayout: GPUBindGroupLayout;
+    /** Heap (read-write storage) at binding 0, a parameter record (read-only storage, dynamic offset) at binding 1. */
+    readonly computeLayout: GPUBindGroupLayout;
+    readonly renderGroup: () => GPUBindGroup;
+    readonly computeGroup: () => GPUBindGroup;
+    /** The run's encoder, created on first use. */
+    readonly encoder: () => GPUCommandEncoder;
+    readonly submit: () => void;
+    /** Drops the run's encoder unsubmitted, after a body failed partway through recording. */
+    readonly discard: () => void;
+    /** The word address of a storage's GPU copy, uploading rows the CPU changed first, for a run at `tick`. */
+    readonly upload: (archetype: Archetype, storage: Storage, tick: number) => number;
+    /**
+     * The word address of a block for `key` holding the first `count` elements of `array`, written when `changed` or
+     * when the block moves, such as the row lists an `up` system's dispatches read.
+     */
+    readonly uploadIndexes: (key: string, array: Int32Array, count: number, changed: boolean) => number;
+    /** Writes a record for `key` (one per system and archetype) and returns its dynamic offset. */
+    readonly record: (key: string, words: Uint32Array) => number;
+    /** Frees the records and index blocks of keys starting with `prefix`, a system's, once nothing runs it again. */
+    readonly release: (prefix: string) => void;
+    /** For tests of what a world holds: how many records and index blocks it keeps. */
+    readonly records: () => number;
+    /** Marks every row of a storage changed on the CPU, for writes that may not stamp its chunks. */
+    readonly markCpuWrites: (archetype: Archetype, storage: Storage) => void;
+    readonly markGpuWrites: (archetype: Archetype, storage: Storage) => void;
+    /** Whether a storage has GPU writes the CPU hasn't seen. */
+    readonly isAhead: (storage: Storage) => boolean;
+    readonly anyAhead: () => boolean;
+    /** Copies GPU writes back into the CPU storages; every storage when `storages` is omitted. */
+    readonly readback: (storages?: readonly Storage[]) => Promise<void>;
+    /** Before a sync point: notes row counts, so the rows it only appends are uploaded alone. */
+    readonly beforeSync: () => void;
+    /** Once a sync point is planned: the archetypes whose existing rows it moves or writes, read back first and uploaded whole. */
+    readonly disturb: (disturbed: ReadonlySet<Archetype>) => void;
+    /** After a sync point: the archetypes it changed, whose new rows, or all rows if disturbed, are uploaded next. */
+    readonly touched: (archetypes: Iterable<Archetype>) => void;
+    /** Set once the device is lost; later runs that use the GPU reject with it, and readbacks keep the CPU's copies. */
+    readonly lost: () => string | null;
+    /** Records the first error a run's scopes report, for the next run to reject with. */
+    /** Keeps the first error of a run's GPU work, with the label of the system whose run submitted it. */
+    readonly reportErrors: (system: {
+        readonly name: string;
+    }, validation: Promise<GPUError | null>, memory: Promise<GPUError | null>) => void;
+    /** The recorded error, cleared. */
+    readonly takeError: () => {
+        readonly name: string;
+        readonly message: string;
+    } | null;
+    readonly destroy: () => void;
+};
+export declare const createGpu: (device: GPUDevice) => GpuEngine;

package/dist/implementation/world/gpu.js

@@ -0,0 +1,317 @@
+import { labelOfItem } from '../../interface/registry/index.js';
+import { layout } from '../../interface/gpu/layout.js';
+import { recordBytes } from '../../interface/gpu/record.js';
+import { chunkShift } from './kernel.js';
+export { recordBytes };
+export const recordWords = recordBytes / 4;
+/** Smallest heap block, and the alignment of every block. */
+const minimumBlockBytes = 256;
+const initialHeapBytes = 1 << 20;
+const sizeClass = (bytes) => Math.max(0, Math.ceil(Math.log2(Math.max(bytes, minimumBlockBytes) / minimumBlockBytes)));
+export const createGpu = (device) => {
+    const renderLayout = layout(device);
+    const computeLayout = device.createBindGroupLayout({
+        entries: [
+            { binding: 0, visibility: GPUShaderStage.COMPUTE, buffer: { type: "storage" } },
+            { binding: 1, visibility: GPUShaderStage.COMPUTE, buffer: { type: "read-only-storage", hasDynamicOffset: true, minBindingSize: recordBytes } },
+        ],
+    });
+    const heapUsage = GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC | GPUBufferUsage.COPY_DST;
+    const recordUsage = GPUBufferUsage.STORAGE | GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_SRC | GPUBufferUsage.COPY_DST;
+    let heap = device.createBuffer({ size: initialHeapBytes, usage: heapUsage });
+    let top = 0;
+    const freeBlocks = [];
+    let records = device.createBuffer({ size: 64 * recordBytes, usage: recordUsage });
+    const slots = new Map();
+    /** Record slots released, reused before new ones. */
+    const freeSlots = [];
+    let nextSlot = 0;
+    let groups = null;
+    let encoder = null;
+    let lostReason = null;
+    let recorded = null;
+    const residents = new Map();
+    const ahead = new Set();
+    void device.lost.then(info => { lostReason = info.message === "" ? info.reason : info.message; });
+    const bindGroups = () => groups ??= {
+        render: device.createBindGroup({ layout: renderLayout, entries: [{ binding: 0, resource: { buffer: heap } }, { binding: 1, resource: { buffer: records, size: recordBytes } }] }),
+        compute: device.createBindGroup({ layout: computeLayout, entries: [{ binding: 0, resource: { buffer: heap } }, { binding: 1, resource: { buffer: records, size: recordBytes } }] }),
+    };
+    const submit = () => {
+        if (encoder === null)
+            return;
+        device.queue.submit([encoder.finish()]);
+        encoder = null;
+    };
+    const limit = Math.min(device.limits.maxBufferSize, device.limits.maxStorageBufferBindingSize);
+    /** Replaces a buffer with one of `size` bytes holding its first `used` bytes. Work recorded so far is submitted first. */
+    const replace = (old, size, usage, used) => {
+        submit();
+        const grown = device.createBuffer({ size, usage });
+        if (used > 0) {
+            const copy = device.createCommandEncoder();
+            copy.copyBufferToBuffer(old, 0, grown, 0, used);
+            device.queue.submit([copy.finish()]);
+        }
+        old.destroy();
+        groups = null;
+        return grown;
+    };
+    const allocate = (bytes) => {
+        const size = sizeClass(bytes);
+        const reused = freeBlocks[size]?.pop();
+        if (reused !== undefined)
+            return reused;
+        const offset = top;
+        const end = top + minimumBlockBytes * 2 ** size;
+        if (end > heap.size) {
+            if (end > limit)
+                throw new Error(`The GPU copy of the world needs ${end} bytes, over this device's limit of ${limit}; request a higher maxBufferSize and maxStorageBufferBindingSize.`);
+            let next = heap.size;
+            while (next < end)
+                next *= 2;
+            heap = replace(heap, Math.min(next, limit), heapUsage, offset);
+        }
+        top = end;
+        return offset;
+    };
+    const residentOf = (archetype, storage) => {
+        let resident = residents.get(storage);
+        if (resident === undefined) {
+            const stride = storage.layout.kind === "linear" ? storage.layout.stride : 0;
+            resident = { storage, archetype, stride, offset: 0, bytes: 0, capacity: 0, dirtyLow: 0, dirtyHigh: 0, aheadLow: 0, aheadHigh: 0, uploaded: 0 };
+            residents.set(storage, resident);
+        }
+        if (resident.capacity < archetype.capacity) {
+            const bytes = Math.max(minimumBlockBytes, archetype.capacity * resident.stride);
+            const offset = allocate(bytes);
+            if (resident.bytes === 0) {
+                resident.dirtyLow = 0;
+                resident.dirtyHigh = archetype.count;
+            }
+            else {
+                // The old rows move on the GPU, where they may be newer than the CPU's; a buffer can't copy into itself.
+                submit();
+                const used = resident.capacity * resident.stride;
+                const scratch = device.createBuffer({ size: used, usage: GPUBufferUsage.COPY_SRC | GPUBufferUsage.COPY_DST });
+                const copy = device.createCommandEncoder();
+                copy.copyBufferToBuffer(heap, resident.offset, scratch, 0, used);
+                copy.copyBufferToBuffer(scratch, 0, heap, offset, used);
+                device.queue.submit([copy.finish()]);
+                scratch.destroy();
+                (freeBlocks[sizeClass(resident.bytes)] ??= []).push(resident.offset);
+            }
+            resident.offset = offset;
+            resident.bytes = bytes;
+            resident.capacity = archetype.capacity;
+        }
+        return resident;
+    };
+    /** Writes rows `low` to `high` of a storage into its GPU copy. */
+    const write = (resident, low, high) => {
+        // A queue write lands before work recorded but not yet submitted, which may read these rows.
+        submit();
+        const start = low * resident.stride;
+        device.queue.writeBuffer(heap, resident.offset + start, resident.storage.views.u8, start, (high - low) * resident.stride);
+    };
+    const upload = (archetype, storage, tick) => {
+        const resident = residentOf(archetype, storage);
+        const { count } = archetype;
+        const low = resident.dirtyLow;
+        const high = Math.min(resident.dirtyHigh, count);
+        // Rows the GPU wrote and the CPU hasn't read back are newer there, so only the dirty rows are written: CPU
+        // systems read them back before writing them, so nothing else changed.
+        if (storage.ticked && !ahead.has(resident)) {
+            // A write per run of adjacent chunks stamped since the last upload or holding dirty rows. Outside the dirty
+            // rows the CPU's rows are the GPU's, so writing whole chunks costs only bytes.
+            const { chunkChanged } = storage;
+            const { uploaded } = resident;
+            const chunks = (count + (1 << chunkShift) - 1) >> chunkShift;
+            const dirtyFirst = low < high ? low >> chunkShift : chunks;
+            const dirtyEnd = low < high ? ((high - 1) >> chunkShift) + 1 : 0;
+            let first = -1;
+            for (let chunk = 0; chunk < chunks; chunk++) {
+                if (chunkChanged[chunk] > uploaded || (chunk >= dirtyFirst && chunk < dirtyEnd)) {
+                    if (first < 0)
+                        first = chunk;
+                }
+                else if (first >= 0) {
+                    write(resident, first << chunkShift, chunk << chunkShift);
+                    first = -1;
+                }
+            }
+            if (first >= 0)
+                write(resident, first << chunkShift, count);
+        }
+        else if (low < high)
+            write(resident, low, high);
+        resident.dirtyLow = resident.dirtyHigh = 0;
+        resident.uploaded = tick;
+        return resident.offset / 4;
+    };
+    const indexBlocks = new Map();
+    const uploadIndexes = (key, array, count, changed) => {
+        const bytes = Math.max(minimumBlockBytes, count * 4);
+        let block = indexBlocks.get(key);
+        let write = changed;
+        if (block === undefined || block.bytes < bytes) {
+            if (block !== undefined)
+                (freeBlocks[sizeClass(block.bytes)] ??= []).push(block.offset);
+            block = { offset: allocate(bytes), bytes: minimumBlockBytes * 2 ** sizeClass(bytes) };
+            indexBlocks.set(key, block);
+            write = true;
+        }
+        if (write && count > 0) {
+            // A queue write lands before work recorded but not yet submitted, which may read the old lists.
+            submit();
+            device.queue.writeBuffer(heap, block.offset, array, 0, count);
+        }
+        return block.offset / 4;
+    };
+    const scratch = new Uint32Array(recordWords);
+    const record = (key, words) => {
+        let slot = slots.get(key);
+        if (slot === undefined) {
+            slot = freeSlots.pop() ?? nextSlot++;
+            // Records written earlier in this run may not be bound yet, so they move with the buffer.
+            if ((slot + 1) * recordBytes > records.size)
+                records = replace(records, records.size * 2, recordUsage, slot * recordBytes);
+            slots.set(key, slot);
+        }
+        scratch.fill(0);
+        scratch.set(words.subarray(0, recordWords));
+        device.queue.writeBuffer(records, slot * recordBytes, scratch);
+        return slot * recordBytes;
+    };
+    const release = (prefix) => {
+        for (const [key, slot] of slots) {
+            if (!key.startsWith(prefix))
+                continue;
+            slots.delete(key);
+            freeSlots.push(slot);
+        }
+        for (const [key, block] of indexBlocks) {
+            if (!key.startsWith(prefix))
+                continue;
+            indexBlocks.delete(key);
+            (freeBlocks[sizeClass(block.bytes)] ??= []).push(block.offset);
+        }
+    };
+    const markCpuWrites = (archetype, storage) => {
+        const resident = residents.get(storage);
+        if (resident === undefined)
+            return;
+        resident.dirtyLow = 0;
+        resident.dirtyHigh = Math.max(resident.dirtyHigh, archetype.count);
+    };
+    const markGpuWrites = (archetype, storage) => {
+        const resident = residents.get(storage);
+        if (resident === undefined)
+            return;
+        resident.aheadLow = 0;
+        resident.aheadHigh = Math.max(resident.aheadHigh, archetype.count);
+        ahead.add(resident);
+    };
+    const readback = async (storages) => {
+        // A lost device's copies are gone, so the CPU's last copies stand.
+        if (lostReason !== null) {
+            ahead.clear();
+            return;
+        }
+        const pending = storages === undefined ? [...ahead] : storages.flatMap(storage => {
+            const resident = residents.get(storage);
+            return resident !== undefined && ahead.has(resident) ? [resident] : [];
+        });
+        if (pending.length === 0)
+            return;
+        submit();
+        const copy = device.createCommandEncoder();
+        const staged = pending.map(resident => {
+            const start = resident.aheadLow * resident.stride;
+            const bytes = (resident.aheadHigh - resident.aheadLow) * resident.stride;
+            const staging = device.createBuffer({ size: Math.max(4, bytes), usage: GPUBufferUsage.MAP_READ | GPUBufferUsage.COPY_DST });
+            if (bytes > 0)
+                copy.copyBufferToBuffer(heap, resident.offset + start, staging, 0, bytes);
+            return { resident, staging, start, bytes };
+        });
+        device.queue.submit([copy.finish()]);
+        await Promise.all(staged.map(({ staging }) => staging.mapAsync(GPUMapMode.READ)));
+        for (const { resident, staging, start, bytes } of staged) {
+            if (bytes > 0)
+                resident.storage.views.u8.set(new Uint8Array(staging.getMappedRange(0, bytes)), start);
+            staging.destroy();
+            resident.aheadLow = resident.aheadHigh = 0;
+            ahead.delete(resident);
+        }
+    };
+    let disturbedNow = new Set();
+    /** Row counts of archetypes with GPU copies, before the sync point. */
+    const countsBefore = new Map();
+    const beforeSync = () => {
+        disturbedNow = new Set();
+        countsBefore.clear();
+        for (const resident of residents.values())
+            countsBefore.set(resident.archetype, resident.archetype.count);
+    };
+    const touched = (archetypes) => {
+        for (const archetype of archetypes) {
+            const from = disturbedNow.has(archetype) ? 0 : countsBefore.get(archetype) ?? 0;
+            for (const storage of archetype.storages) {
+                const resident = residents.get(storage);
+                if (resident === undefined || from >= archetype.count)
+                    continue;
+                // A disturbed archetype was read back whole, so every row is the CPU's; otherwise only the new ones are.
+                resident.dirtyLow = resident.dirtyHigh > resident.dirtyLow ? Math.min(resident.dirtyLow, from) : from;
+                resident.dirtyHigh = Math.max(resident.dirtyHigh, archetype.count);
+            }
+        }
+        disturbedNow = new Set();
+    };
+    return {
+        device,
+        renderLayout,
+        computeLayout,
+        renderGroup: () => bindGroups().render,
+        computeGroup: () => bindGroups().compute,
+        encoder: () => encoder ??= device.createCommandEncoder(),
+        submit,
+        discard: () => { encoder = null; },
+        upload,
+        uploadIndexes,
+        record,
+        release,
+        records: () => slots.size + indexBlocks.size,
+        markCpuWrites,
+        markGpuWrites,
+        isAhead: storage => {
+            const resident = residents.get(storage);
+            return resident !== undefined && ahead.has(resident);
+        },
+        anyAhead: () => ahead.size > 0,
+        readback,
+        beforeSync,
+        disturb: disturbed => { disturbedNow = disturbed; },
+        touched,
+        lost: () => lostReason,
+        reportErrors: (system, validation, memory) => {
+            void (async () => {
+                const [invalid, exhausted] = await Promise.all([validation, memory]);
+                if (invalid !== null)
+                    recorded ??= { name: labelOfItem(system), message: `validation: ${invalid.message}` };
+                else if (exhausted !== null)
+                    recorded ??= { name: labelOfItem(system), message: `out of memory: ${exhausted.message}` };
+            })();
+        },
+        takeError: () => {
+            const error = recorded;
+            recorded = null;
+            return error;
+        },
+        destroy: () => {
+            submit();
+            heap.destroy();
+            records.destroy();
+        },
+    };
+};
+//# sourceMappingURL=gpu.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"gpu.js","sourceRoot":"","sources":["../../../src/implementation/world/gpu.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,mCAAmC,CAAC;AAChE,OAAO,EAAE,MAAM,EAAE,MAAM,+BAA+B,CAAC;AACvD,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAE5D,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,EAAE,WAAW,EAAE,CAAC;AACvB,MAAM,CAAC,MAAM,WAAW,GAAG,WAAW,GAAG,CAAC,CAAC;AAE3C,6DAA6D;AAC7D,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAC9B,MAAM,gBAAgB,GAAG,CAAC,IAAI,EAAE,CAAC;AA6EjC,MAAM,SAAS,GAAG,CAAC,KAAa,EAAU,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,iBAAiB,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;AAEvI,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,MAAiB,EAAa,EAAE;IACtD,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IACpC,MAAM,aAAa,GAAG,MAAM,CAAC,qBAAqB,CAAC;QAC/C,OAAO,EAAE;YACL,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE;YAC/E,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,mBAAmB,EAAE,gBAAgB,EAAE,IAAI,EAAE,cAAc,EAAE,WAAW,EAAE,EAAE;SACjJ;KACJ,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,GAAG,cAAc,CAAC,QAAQ,GAAG,cAAc,CAAC,QAAQ,CAAC;IAC7F,MAAM,WAAW,GAAG,cAAc,CAAC,OAAO,GAAG,cAAc,CAAC,OAAO,GAAG,cAAc,CAAC,QAAQ,GAAG,cAAc,CAAC,QAAQ,CAAC;IACxH,IAAI,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;IAC7E,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,MAAM,UAAU,GAAe,EAAE,CAAC;IAClC,IAAI,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,EAAE,GAAG,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC;IAClF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,qDAAqD;IACrD,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,MAAM,GAA2D,IAAI,CAAC;IAC1E,IAAI,OAAO,GAA6B,IAAI,CAAC;IAC7C,IAAI,UAAU,GAAkB,IAAI,CAAC;IACrC,IAAI,QAAQ,GAA+D,IAAI,CAAC;IAChF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC/C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAY,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,UAAU,GAAG,IAAI,CAAC,OAAO,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAElG,MAAM,UAAU,GAAG,GAAoD,EAAE,CAAC,MAAM,KAAK;QACjF,MAAM,EAAE,MAAM,CAAC,eAAe,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE,CAAC,EAAE,CAAC;QACjL,OAAO,EAAE,MAAM,CAAC,eAAe,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE,CAAC,EAAE,CAAC;KACtL,CAAC;IAEF,MAAM,MAAM,GAAG,GAAS,EAAE;QACtB,IAAI,OAAO,KAAK,IAAI;YAAE,OAAO;QAC7B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACxC,OAAO,GAAG,IAAI,CAAC;IACnB,CAAC,CAAC;IAEF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,aAAa,EAAE,MAAM,CAAC,MAAM,CAAC,2BAA2B,CAAC,CAAC;IAE/F,0HAA0H;IAC1H,MAAM,OAAO,GAAG,CAAC,GAAc,EAAE,IAAY,EAAE,KAAa,EAAE,IAAY,EAAa,EAAE;QACrF,MAAM,EAAE,CAAC;QACT,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QACnD,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACX,MAAM,IAAI,GAAG,MAAM,CAAC,oBAAoB,EAAE,CAAC;YAC3C,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YAChD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,GAAG,CAAC,OAAO,EAAE,CAAC;QACd,MAAM,GAAG,IAAI,CAAC;QACd,OAAO,KAAK,CAAC;IACjB,CAAC,CAAC;IAEF,MAAM,QAAQ,GAAG,CAAC,KAAa,EAAU,EAAE;QACvC,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACvC,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,MAAM,CAAC;QACxC,MAAM,MAAM,GAAG,GAAG,CAAC;QACnB,MAAM,GAAG,GAAG,GAAG,GAAG,iBAAiB,GAAG,CAAC,IAAI,IAAI,CAAC;QAChD,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,IAAI,GAAG,GAAG,KAAK;gBAAE,MAAM,IAAI,KAAK,CAAC,mCAAmC,GAAG,uCAAuC,KAAK,mEAAmE,CAAC,CAAC;YACxL,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACrB,OAAO,IAAI,GAAG,GAAG;gBAAE,IAAI,IAAI,CAAC,CAAC;YAC7B,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QACnE,CAAC;QACD,GAAG,GAAG,GAAG,CAAC;QACV,OAAO,MAAM,CAAC;IAClB,CAAC,CAAC;IAEF,MAAM,UAAU,GAAG,CAAC,SAAoB,EAAE,OAAgB,EAAY,EAAE;QACpE,IAAI,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACtC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5E,QAAQ,GAAG,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;YAC/I,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QACrC,CAAC;QACD,IAAI,QAAQ,CAAC,QAAQ,GAAG,SAAS,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,SAAS,CAAC,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAChF,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,QAAQ,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;gBACvB,QAAQ,CAAC,QAAQ,GAAG,CAAC,CAAC;gBACtB,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC;YACzC,CAAC;iBACI,CAAC;gBACF,yGAAyG;gBACzG,MAAM,EAAE,CAAC;gBACT,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC;gBACjD,MAAM,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,cAAc,CAAC,QAAQ,GAAG,cAAc,CAAC,QAAQ,EAAE,CAAC,CAAC;gBAC9G,MAAM,IAAI,GAAG,MAAM,CAAC,oBAAoB,EAAE,CAAC;gBAC3C,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;gBACjE,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;gBACxD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBACrC,OAAO,CAAC,OAAO,EAAE,CAAC;gBAClB,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACzE,CAAC;YACD,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC;YACzB,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC;YACvB,QAAQ,CAAC,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;QAC3C,CAAC;QACD,OAAO,QAAQ,CAAC;IACpB,CAAC,CAAC;IAEF,kEAAkE;IAClE,MAAM,KAAK,GAAG,CAAC,QAAkB,EAAE,GAAW,EAAE,IAAY,EAAQ,EAAE;QAClE,6FAA6F;QAC7F,MAAM,EAAE,CAAC;QACT,MAAM,KAAK,GAAG,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC;QACpC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,MAAM,GAAG,KAAK,EAAE,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,GAAG,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC9H,CAAC,CAAC;IAEF,MAAM,MAAM,GAAG,CAAC,SAAoB,EAAE,OAAgB,EAAE,IAAY,EAAU,EAAE;QAC5E,MAAM,QAAQ,GAAG,UAAU,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAChD,MAAM,EAAE,KAAK,EAAE,GAAG,SAAS,CAAC;QAC5B,MAAM,GAAG,GAAG,QAAQ,CAAC,QAAQ,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QACjD,2GAA2G;QAC3G,uEAAuE;QACvE,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzC,4GAA4G;YAC5G,+EAA+E;YAC/E,MAAM,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC;YACjC,MAAM,EAAE,QAAQ,EAAE,GAAG,QAAQ,CAAC;YAC9B,MAAM,MAAM,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,UAAU,CAAC;YAC7D,MAAM,UAAU,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC;YAC3D,MAAM,QAAQ,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACjE,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;YACf,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;gBAC1C,IAAI,YAAY,CAAC,KAAK,CAAC,GAAG,QAAQ,IAAI,CAAC,KAAK,IAAI,UAAU,IAAI,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC;oBAC9E,IAAI,KAAK,GAAG,CAAC;wBAAE,KAAK,GAAG,KAAK,CAAC;gBACjC,CAAC;qBACI,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;oBAClB,KAAK,CAAC,QAAQ,EAAE,KAAK,IAAI,UAAU,EAAE,KAAK,IAAI,UAAU,CAAC,CAAC;oBAC1D,KAAK,GAAG,CAAC,CAAC,CAAC;gBACf,CAAC;YACL,CAAC;YACD,IAAI,KAAK,IAAI,CAAC;gBAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,IAAI,UAAU,EAAE,KAAK,CAAC,CAAC;QAChE,CAAC;aACI,IAAI,GAAG,GAAG,IAAI;YAAE,KAAK,CAAC,QAAQ,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QAChD,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,SAAS,GAAG,CAAC,CAAC;QAC3C,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC;QACzB,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IAC/B,CAAC,CAAC;IAEF,MAAM,WAAW,GAAG,IAAI,GAAG,EAA6C,CAAC;IACzE,MAAM,aAAa,GAAG,CAAC,GAAW,EAAE,KAAiB,EAAE,KAAa,EAAE,OAAgB,EAAU,EAAE;QAC9F,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACrD,IAAI,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,KAAK,GAAG,OAAO,CAAC;QACpB,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,KAAK,GAAG,KAAK,EAAE,CAAC;YAC7C,IAAI,KAAK,KAAK,SAAS;gBAAE,CAAC,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACxF,KAAK,GAAG,EAAE,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,iBAAiB,GAAG,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;YACtF,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC5B,KAAK,GAAG,IAAI,CAAC;QACjB,CAAC;QACD,IAAI,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACrB,gGAAgG;YAChG,MAAM,EAAE,CAAC;YACT,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAClE,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC5B,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,WAAW,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,CAAC,GAAW,EAAE,KAAkB,EAAU,EAAE;QACvD,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,IAAI,GAAG,SAAS,CAAC,GAAG,EAAE,IAAI,QAAQ,EAAE,CAAC;YACrC,0FAA0F;YAC1F,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,WAAW,GAAG,OAAO,CAAC,IAAI;gBAAE,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,WAAW,EAAE,IAAI,GAAG,WAAW,CAAC,CAAC;YAC3H,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACzB,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,OAAO,EAAE,IAAI,GAAG,WAAW,EAAE,OAAO,CAAC,CAAC;QAC/D,OAAO,IAAI,GAAG,WAAW,CAAC;IAC9B,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,CAAC,MAAc,EAAQ,EAAE;QACrC,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC;gBAAE,SAAS;YACtC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAClB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;QACD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;YACrC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC;gBAAE,SAAS;YACtC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACxB,CAAC,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACnE,CAAC;IACL,CAAC,CAAC;IAEF,MAAM,aAAa,GAAG,CAAC,SAAoB,EAAE,OAAgB,EAAQ,EAAE;QACnE,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO;QACnC,QAAQ,CAAC,QAAQ,GAAG,CAAC,CAAC;QACtB,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;IACvE,CAAC,CAAC;IAEF,MAAM,aAAa,GAAG,CAAC,SAAoB,EAAE,OAAgB,EAAQ,EAAE;QACnE,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO;QACnC,QAAQ,CAAC,QAAQ,GAAG,CAAC,CAAC;QACtB,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;QACnE,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACxB,CAAC,CAAC;IAEF,MAAM,QAAQ,GAAG,KAAK,EAAE,QAA6B,EAAiB,EAAE;QACpE,mEAAmE;QACnE,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;YACtB,KAAK,CAAC,KAAK,EAAE,CAAC;YACd,OAAO;QACX,CAAC;QACD,MAAM,OAAO,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;YAC7E,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACxC,OAAO,QAAQ,KAAK,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3E,CAAC,CAAC,CAAC;QACH,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QACjC,MAAM,EAAE,CAAC;QACT,MAAM,IAAI,GAAG,MAAM,CAAC,oBAAoB,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;YAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC;YAClD,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,SAAS,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;YACzE,MAAM,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,QAAQ,GAAG,cAAc,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC5H,IAAI,KAAK,GAAG,CAAC;gBAAE,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,MAAM,GAAG,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YACzF,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QAC/C,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACrC,MAAM,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClF,KAAK,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,MAAM,EAAE,CAAC;YACvD,IAAI,KAAK,GAAG,CAAC;gBAAE,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACtG,OAAO,CAAC,OAAO,EAAE,CAAC;YAClB,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,SAAS,GAAG,CAAC,CAAC;YAC3C,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC3B,CAAC;IACL,CAAC,CAAC;IAEF,IAAI,YAAY,GAA2B,IAAI,GAAG,EAAE,CAAC;IACrD,uEAAuE;IACvE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAqB,CAAC;IAClD,MAAM,UAAU,GAAG,GAAS,EAAE;QAC1B,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;QACzB,YAAY,CAAC,KAAK,EAAE,CAAC;QACrB,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,MAAM,EAAE;YAAE,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC9G,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,CAAC,UAA+B,EAAQ,EAAE;QACtD,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YAChF,KAAK,MAAM,OAAO,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;gBACvC,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACxC,IAAI,QAAQ,KAAK,SAAS,IAAI,IAAI,IAAI,SAAS,CAAC,KAAK;oBAAE,SAAS;gBAChE,yGAAyG;gBACzG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,SAAS,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;gBACtG,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;YACvE,CAAC;QACL,CAAC;QACD,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;IAC7B,CAAC,CAAC;IAEF,OAAO;QACH,MAAM;QACN,YAAY;QACZ,aAAa;QACb,WAAW,EAAE,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC,MAAM;QACtC,YAAY,EAAE,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC,OAAO;QACxC,OAAO,EAAE,GAAG,EAAE,CAAC,OAAO,KAAK,MAAM,CAAC,oBAAoB,EAAE;QACxD,MAAM;QACN,OAAO,EAAE,GAAG,EAAE,GAAG,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC;QAClC,MAAM;QACN,aAAa;QACb,MAAM;QACN,OAAO;QACP,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI;QAC5C,aAAa;QACb,aAAa;QACb,OAAO,EAAE,OAAO,CAAC,EAAE;YACf,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACxC,OAAO,QAAQ,KAAK,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACzD,CAAC;QACD,QAAQ,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC;QAC9B,QAAQ;QACR,UAAU;QACV,OAAO,EAAE,SAAS,CAAC,EAAE,GAAG,YAAY,GAAG,SAAS,CAAC,CAAC,CAAC;QACnD,OAAO;QACP,IAAI,EAAE,GAAG,EAAE,CAAC,UAAU;QACtB,YAAY,EAAE,CAAC,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE;YACzC,KAAK,CAAC,KAAK,IAAI,EAAE;gBACb,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC;gBACrE,IAAI,OAAO,KAAK,IAAI;oBAAE,QAAQ,KAAK,EAAE,IAAI,EAAE,WAAW,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,eAAe,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;qBACvG,IAAI,SAAS,KAAK,IAAI;oBAAE,QAAQ,KAAK,EAAE,IAAI,EAAE,WAAW,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,kBAAkB,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC;YAC5H,CAAC,CAAC,EAAE,CAAC;QACT,CAAC;QACD,SAAS,EAAE,GAAG,EAAE;YACZ,MAAM,KAAK,GAAG,QAAQ,CAAC;YACvB,QAAQ,GAAG,IAAI,CAAC;YAChB,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,EAAE,GAAG,EAAE;YACV,MAAM,EAAE,CAAC;YACT,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,OAAO,CAAC,OAAO,EAAE,CAAC;QACtB,CAAC;KACJ,CAAC;AACN,CAAC,CAAC"}

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

@@ -0,0 +1,21 @@
+/**
+ * The holders of each target for one reference component, as linked lists by entity index: holder index `h` is in
+ * the list of `indexOf(targets[h])`, after `next[h] - 1` and before `previous[h] - 1` (0 for none), and holds
+ * `targets[h]`, generation included, so a list never mixes a target's generations.
+ */
+export type Holders = {
+    first: Int32Array;
+    next: Int32Array;
+    previous: Int32Array;
+    targets: Float64Array;
+    holders: Float64Array;
+};
+export declare const createHolders: () => Holders;
+/** Grows the lists to cover entity indexes below `length`. */
+export declare const fitHolders: (lists: Holders, length: number) => void;
+/** Adds `holder` to the list of `target`. Each holder is in at most one list, so it must be unlinked first. */
+export declare const linkHolder: (lists: Holders, target: number, holder: number) => void;
+/** Removes `holder` from the list of `target`, if it's there. */
+export declare const unlinkHolder: (lists: Holders, target: number, holder: number) => void;
+/** Calls `each` with every holder of `target`. */
+export declare const forEachHolder: (lists: Holders, target: number, each: (holder: number) => void) => void;

package/dist/implementation/world/holders.js

@@ -0,0 +1,65 @@
+import { indexOf } from './entities.js';
+export const createHolders = () => ({ first: new Int32Array(0), next: new Int32Array(0), previous: new Int32Array(0), targets: new Float64Array(0), holders: new Float64Array(0) });
+const grownInt = (array, length) => {
+    if (array.length >= length)
+        return array;
+    const grown = new Int32Array(Math.max(length, 2 * array.length));
+    grown.set(array);
+    return grown;
+};
+const grownFloat = (array, length) => {
+    if (array.length >= length)
+        return array;
+    const grown = new Float64Array(Math.max(length, 2 * array.length));
+    grown.set(array);
+    return grown;
+};
+/** Grows the lists to cover entity indexes below `length`. */
+export const fitHolders = (lists, length) => {
+    if (lists.first.length >= length)
+        return;
+    lists.first = grownInt(lists.first, length);
+    lists.next = grownInt(lists.next, length);
+    lists.previous = grownInt(lists.previous, length);
+    lists.targets = grownFloat(lists.targets, length);
+    lists.holders = grownFloat(lists.holders, length);
+};
+/** Adds `holder` to the list of `target`. Each holder is in at most one list, so it must be unlinked first. */
+export const linkHolder = (lists, target, holder) => {
+    const at = indexOf(holder);
+    const into = indexOf(target);
+    const first = lists.first[into];
+    lists.next[at] = first;
+    lists.previous[at] = 0;
+    if (first !== 0)
+        lists.previous[first - 1] = at + 1;
+    lists.first[into] = at + 1;
+    lists.targets[at] = target;
+    lists.holders[at] = holder;
+};
+/** Removes `holder` from the list of `target`, if it's there. */
+export const unlinkHolder = (lists, target, holder) => {
+    const at = indexOf(holder);
+    if (at >= lists.first.length || lists.targets[at] !== target || lists.holders[at] !== holder)
+        return;
+    const previous = lists.previous[at];
+    const next = lists.next[at];
+    if (previous !== 0)
+        lists.next[previous - 1] = next;
+    else
+        lists.first[indexOf(target)] = next;
+    if (next !== 0)
+        lists.previous[next - 1] = previous;
+    lists.targets[at] = 0;
+};
+/** Calls `each` with every holder of `target`. */
+export const forEachHolder = (lists, target, each) => {
+    const into = indexOf(target);
+    if (into >= lists.first.length)
+        return;
+    for (let at = lists.first[into]; at !== 0; at = lists.next[at - 1]) {
+        if (lists.targets[at - 1] === target)
+            each(lists.holders[at - 1]);
+    }
+};
+//# sourceMappingURL=holders.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"holders.js","sourceRoot":"","sources":["../../../src/implementation/world/holders.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AASxC,MAAM,CAAC,MAAM,aAAa,GAAG,GAAY,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAE7L,MAAM,QAAQ,GAAG,CAAC,KAAiB,EAAE,MAAc,EAAc,EAAE;IAC/D,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,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,CAAC,KAAmB,EAAE,MAAc,EAAgB,EAAE;IACrE,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM;QAAE,OAAO,KAAK,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACnE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACjB,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF,8DAA8D;AAC9D,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAc,EAAE,MAAc,EAAQ,EAAE;IAC/D,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,MAAM;QAAE,OAAO;IACzC,KAAK,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC5C,KAAK,CAAC,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC1C,KAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAClD,KAAK,CAAC,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAClD,KAAK,CAAC,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;AACtD,CAAC,CAAC;AAEF,+GAA+G;AAC/G,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAc,EAAE,MAAc,EAAE,MAAc,EAAQ,EAAE;IAC/E,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAChC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;IACvB,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACvB,IAAI,KAAK,KAAK,CAAC;QAAE,KAAK,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACpD,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC3B,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC;IAC3B,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC;AAC/B,CAAC,CAAC;AAEF,iEAAiE;AACjE,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAc,EAAE,MAAc,EAAE,MAAc,EAAQ,EAAE;IACjF,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC3B,IAAI,EAAE,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,MAAM;QAAE,OAAO;IACrG,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IACpC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5B,IAAI,QAAQ,KAAK,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;;QAC/C,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC;IACzC,IAAI,IAAI,KAAK,CAAC;QAAE,KAAK,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC;IACpD,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;AAC1B,CAAC,CAAC;AAEF,kDAAkD;AAClD,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAc,EAAE,MAAc,EAAE,IAA8B,EAAQ,EAAE;IAClG,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC7B,IAAI,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM;QAAE,OAAO;IACvC,KAAK,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;QACjE,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,MAAM;YAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;AACL,CAAC,CAAC"}

package/dist/implementation/world/index-build.d.ts

@@ -0,0 +1,88 @@
+/** The kernel number of a build step's task: its phase as the archetype, its pieces or partitions as rows, its plan's address its scalar. */
+export declare const buildKernel = -2;
+/** Entity indexes a piece covers. */
+export declare const pieceEntities: number;
+/** Partitions of the slot table, each a contiguous range of slots, at most. */
+export declare const maximumPartitions = 256;
+export type Phase = "count" | "list" | "group" | "fill";
+/** Phases by number, as a task's archetype carries them. */
+export declare const phases: readonly Phase[];
+/** A leaf's stored type, as a number a plan carries. */
+export declare const scalarCodes: {
+    f32: number;
+    i32: number;
+    u32: number;
+    boolean: number;
+    f64: number;
+};
+/**
+ * A build's plan: byte offsets into the memory of what it reads and writes, and small arrays. `members` is by
+ * archetype id the archetype's slot among members, or -1; `columns` is by member slot and leaf the byte address of the
+ * leaf's column; each leaf has its code, unit stride and offset, and first key word.
+ */
+export type HashBuild = {
+    readonly entityArchetype: number;
+    readonly entityRow: number;
+    /** Entity indexes from 1 up to this are walked. */
+    readonly entityEnd: number;
+    readonly pieces: number;
+    readonly words: number;
+    readonly partitions: number;
+    /** A hash's partition: its slot, `hash & mask`, shifted right by this. */
+    readonly shift: number;
+    readonly mask: number;
+    /** By piece and partition: entries, then where the piece's entries of the partition go. */
+    readonly histogram: number;
+    /** By entry, grouped by partition and in entity order within each: entity index, archetype and row; key words; hash. */
+    readonly grouped: number;
+    readonly groupedKeys: number;
+    readonly groupedHashes: number;
+    /** By grouped position: its bucket within its partition. */
+    readonly local: number;
+    /** By partition: where its positions start (`partitions + 1`), its buckets, their capacity, those of more than one entry, where its buckets and segments start, and its overflowed buckets. */
+    readonly starts: number;
+    readonly buckets: number;
+    readonly capacity: number;
+    readonly crowded: number;
+    readonly bucketBase: number;
+    readonly capacityBase: number;
+    readonly overflowed: number;
+    /** By grouped position: each of its partition's buckets' first position and length, and those its slots overflowed. */
+    readonly first: number;
+    readonly lengths: number;
+    readonly overflow: number;
+    /** The table: slots, records and their stride, ticks by bucket, entries and bucket by entity. */
+    readonly slots: number;
+    readonly records: number;
+    readonly stride: number;
+    readonly ticks: number;
+    readonly table: number;
+    readonly bucketOf: number;
+    readonly tick: number;
+    /** Whether buckets are placed in their partitions' slots, or all by the world's thread once more were found than the slots hold. */
+    readonly placing: boolean;
+    readonly members: ArrayLike<number>;
+    readonly columns: ArrayLike<number>;
+    readonly leafCodes: ArrayLike<number>;
+    readonly leafStrides: ArrayLike<number>;
+    readonly leafOffsets: ArrayLike<number>;
+    readonly leafWords: ArrayLike<number>;
+    /** Watched components' ticks by bucket. */
+    readonly watched: ArrayLike<number>;
+};
+/** f64 words a plan takes. */
+export declare const planWords: (build: HashBuild) => number;
+/** Writes a plan into `f64` from word `at`. */
+export declare const writePlan: (f64: Float64Array, at: number, build: HashBuild) => void;
+/** A plan written at byte `address`, as `numbersOf` and `arraysOf` order it, its arrays views of the memory. */
+export declare const readPlan: (f64: Float64Array, address: number) => HashBuild;
+/** Views of the memory a step reads and writes through. */
+export type BuildViews = {
+    readonly u8: Uint8Array;
+    readonly u32: Uint32Array;
+    readonly i32: Int32Array;
+    readonly f64: Float64Array;
+};
+export declare const buildViews: (buffer: ArrayBufferLike) => BuildViews;
+/** Runs one phase of a build over pieces or partitions `from` to `to`. Each phase can run again over the same ones. */
+export declare const runBuildStep: (views: BuildViews, build: HashBuild, phase: Phase, from: number, to: number) => void;