@adobe/ecs 0.0.0-stage → 0.1.0

package/dist/implementation/world/index-build.js

@@ -0,0 +1,404 @@
+import { capacityFor, entryWords, recordCapacity, recordHash, recordKey, recordLength, recordStart } from './index-hash.js';
+import { hashWords, orderF32, orderF64 } from './index-keys.js';
+// A hash index built again across the pool (design.md, "Indexes"): in steps over fixed pieces of entity indexes and
+// fixed partitions of the slot table, each step's pieces or partitions claimed by workers, so what's built doesn't
+// depend on how many there are or which ran what. A step reads its plan, and everything it reads and writes, in the
+// memory, so it travels through the pool's task rings as a task of `buildKernel`.
+/** 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 const buildKernel = -2;
+/** Entity indexes a piece covers. */
+export const pieceEntities = 1 << 15;
+/** Partitions of the slot table, each a contiguous range of slots, at most. */
+export const maximumPartitions = 256;
+/** Phases by number, as a task's archetype carries them. */
+export const phases = ["count", "list", "group", "fill"];
+/** A leaf's stored type, as a number a plan carries. */
+export const scalarCodes = { f32: 0, i32: 1, u32: 2, boolean: 3, f64: 4 };
+/** A plan's numbers, in the order it's written and read; its arrays follow, each its length then its elements. */
+const numbersOf = (build) => [
+    build.entityArchetype, build.entityRow, build.entityEnd, build.pieces, build.words, build.partitions, build.shift, build.mask, build.histogram, build.grouped, build.groupedKeys, build.groupedHashes, build.local, build.starts,
+    build.buckets, build.capacity, build.crowded, build.bucketBase, build.capacityBase, build.overflowed, build.first, build.lengths, build.overflow,
+    build.slots, build.records, build.stride, build.ticks, build.table, build.bucketOf, build.tick, build.placing ? 1 : 0,
+];
+const arraysOf = (build) => [build.members, build.columns, build.leafCodes, build.leafStrides, build.leafOffsets, build.leafWords, build.watched];
+/** f64 words a plan takes. */
+export const planWords = (build) => {
+    let words = numbersOf(build).length;
+    for (const array of arraysOf(build))
+        words += 1 + array.length;
+    return words;
+};
+/** Writes a plan into `f64` from word `at`. */
+export const writePlan = (f64, at, build) => {
+    let next = at;
+    for (const value of numbersOf(build))
+        f64[next++] = value;
+    for (const array of arraysOf(build)) {
+        f64[next++] = array.length;
+        for (let k = 0; k < array.length; k++)
+            f64[next++] = array[k];
+    }
+};
+/** A plan written at byte `address`, as `numbersOf` and `arraysOf` order it, its arrays views of the memory. */
+export const readPlan = (f64, address) => {
+    let next = address >> 3;
+    const number = () => f64[next++];
+    const array = () => {
+        const length = f64[next++];
+        next += length;
+        return f64.subarray(next - length, next);
+    };
+    return {
+        entityArchetype: number(), entityRow: number(), entityEnd: number(), pieces: number(), words: number(), partitions: number(), shift: number(),
+        mask: number(), histogram: number(), grouped: number(), groupedKeys: number(),
+        groupedHashes: number(), local: number(), starts: number(), buckets: number(), capacity: number(), crowded: number(), bucketBase: number(),
+        capacityBase: number(), overflowed: number(), first: number(), lengths: number(), overflow: number(), slots: number(), records: number(),
+        stride: number(), ticks: number(), table: number(), bucketOf: number(), tick: number(), placing: number() === 1,
+        members: array(), columns: array(), leafCodes: array(), leafStrides: array(), leafOffsets: array(), leafWords: array(), watched: array(),
+    };
+};
+export const buildViews = (buffer) => ({ u8: new Uint8Array(buffer), u32: new Uint32Array(buffer), i32: new Int32Array(buffer), f64: new Float64Array(buffer) });
+/** Scratch of the thread running steps: a piece's partition offsets, a partition's table of buckets, and its buckets' starts and fills. */
+const scratch = {
+    offsets: new Int32Array(maximumPartitions), table: new Int32Array(64), hashes: new Int32Array(64), firsts: new Int32Array(64), counts: new Int32Array(64),
+    starts: new Int32Array(64), fills: new Int32Array(64),
+};
+const ensure = (array, length) => array.length >= length ? array : new Int32Array(Math.max(length, 2 * array.length));
+/** Runs one phase of a build over pieces or partitions `from` to `to`. Each phase can run again over the same ones. */
+export const runBuildStep = (views, build, phase, from, to) => {
+    if (phase === "count" || phase === "list") {
+        const step = piecesOf(build);
+        if (phase === "count")
+            step.count(views, build, from, to, pair, orderF32, orderF64);
+        else
+            step.list(views, build, from, to, pair, orderF32, orderF64, scratch.offsets);
+    }
+    else if (phase === "group")
+        groupPartitions(views, build, from, to);
+    else
+        fillPartitions(views, build, from, to);
+};
+/** Words for an f64's encoding. */
+const pair = new Uint32Array(2);
+/**
+ * The statements reading a member's key words from its columns at `row`, `slot` its member slot, into locals `k0`,
+ * `k1`... in key order, and hashing them into `hash` as `hashWords` (`index-keys.ts`) does, for the plan's leaves.
+ */
+const keyStatements = (build) => {
+    const leaves = build.leafCodes.length;
+    const lines = [`const base = slot * ${leaves};`];
+    for (let leaf = 0; leaf < leaves; leaf++) {
+        const index = `row * ${build.leafStrides[leaf]} + ${build.leafOffsets[leaf]}`;
+        const word = build.leafWords[leaf];
+        lines.push(`const c${leaf} = columns[base + ${leaf}];`);
+        switch (build.leafCodes[leaf]) {
+            case 0:
+                lines.push(`const k${word} = orderF32(u32[(c${leaf} >> 2) + ${index}]);`);
+                break;
+            case 1:
+                lines.push(`const k${word} = (u32[(c${leaf} >> 2) + ${index}] ^ 0x80000000) >>> 0;`);
+                break;
+            case 2:
+                lines.push(`const k${word} = u32[(c${leaf} >> 2) + ${index}];`);
+                break;
+            case 3:
+                lines.push(`const k${word} = u8[c${leaf} + ${index}] === 0 ? 0 : 1;`);
+                break;
+            default: lines.push(`orderF64(u32[(c${leaf} >> 2) + 2 * (${index}) + 1], u32[(c${leaf} >> 2) + 2 * (${index})], pair, 0);`, `const k${word} = pair[0], k${word + 1} = pair[1];`);
+        }
+    }
+    lines.push("let hash = 0x811C9DC5;");
+    for (let w = 0; w < build.words; w++)
+        lines.push(`hash = Math.imul(hash ^ k${w}, 0x9E3779B1); hash ^= hash >>> 15;`);
+    lines.push("hash = Math.imul(hash ^ (hash >>> 16), 0x85EBCA6B); hash = Math.imul(hash ^ (hash >>> 13), 0xC2B2AE35); hash = (hash ^ (hash >>> 16)) >>> 0;");
+    return lines.join("\n");
+};
+/** The source of a piece's two steps, for one plan's leaves. */
+const pieceSource = (build) => {
+    const loop = (inner) => [
+        "const archetypes = build.entityArchetype >> 2, rows = build.entityRow >> 2, bucketOf = build.bucketOf >> 2;",
+        "const { members, columns, partitions, shift, mask } = build;",
+        "const known = members.length, histogram = build.histogram >> 2;",
+        "const grouped = build.grouped >> 2, groupedKeys = build.groupedKeys >> 2, groupedHashes = build.groupedHashes >> 2;",
+        "for (let piece = from; piece < to; piece++) {",
+        `const start = Math.max(1, piece * ${pieceEntities}), end = Math.min(build.entityEnd, (piece + 1) * ${pieceEntities});`,
+        "const counted = histogram + piece * partitions;",
+        ...inner,
+        "}",
+    ].join("\n");
+    const member = [
+        "const archetype = i32[archetypes + entity];",
+        "if (archetype < 0 || archetype >= known) continue;",
+        "const slot = members[archetype];",
+        "if (slot < 0) continue;",
+        "const row = u32[rows + entity];",
+        keyStatements(build),
+    ];
+    const count = loop([
+        "for (let q = 0; q < partitions; q++) i32[counted + q] = 0;",
+        "for (let entity = start; entity < end; entity++) {",
+        "i32[bucketOf + entity] = -1;",
+        ...member,
+        "i32[counted + ((hash & mask) >>> shift)]++;",
+        "}",
+    ]);
+    const list = loop([
+        "for (let q = 0; q < partitions; q++) offsets[q] = i32[counted + q];",
+        "for (let entity = start; entity < end; entity++) {",
+        ...member,
+        "const position = offsets[(hash & mask) >>> shift]++;",
+        "u32[groupedHashes + position] = hash;",
+        `const target = grouped + position * ${entryWords};`,
+        "i32[target] = entity; i32[target + 1] = archetype; i32[target + 2] = row;",
+        ...Array.from({ length: build.words }, (_, w) => `u32[groupedKeys + position * ${build.words} + ${w}] = k${w};`),
+        "}",
+    ]);
+    return [
+        "return {",
+        `count: ({ u8, u32, i32 }, build, from, to, pair, orderF32, orderF64) => {\n${count}\n},`,
+        `list: ({ u8, u32, i32 }, build, from, to, pair, orderF32, orderF64, offsets) => {\n${list}\n},`,
+        "};",
+    ].join("\n");
+};
+/** Whether code can be generated here; a content security policy without `'unsafe-eval'` forbids it. */
+let generating = true;
+/** Steps by the leaves and key words they're for. */
+const generated = new Map();
+/** The steps for a plan's leaves: generated for them, or loops over them where code can't be generated. */
+const piecesOf = (build) => {
+    if (!generating)
+        return genericSteps;
+    const signature = [build.words, ...Array.from(build.leafCodes), ...Array.from(build.leafStrides), ...Array.from(build.leafOffsets), ...Array.from(build.leafWords)].join(",");
+    const found = generated.get(signature);
+    if (found !== undefined)
+        return found;
+    try {
+        // The factory returns the steps its source makes, of `PieceSteps`'s shape.
+        const steps = new Function(pieceSource(build))();
+        generated.set(signature, steps);
+        return steps;
+    }
+    catch {
+        generating = false;
+        return genericSteps;
+    }
+};
+/** A member's key words into `key` from its columns at `row`, and their hash. */
+const keyOf = ({ u8, u32 }, build, slot, row, key) => {
+    const { columns, leafCodes, leafStrides, leafOffsets, leafWords, words } = build;
+    const leaves = leafCodes.length;
+    for (let leaf = 0; leaf < leaves; leaf++) {
+        const column = columns[slot * leaves + leaf];
+        const index = row * leafStrides[leaf] + leafOffsets[leaf];
+        const word = leafWords[leaf];
+        const code = leafCodes[leaf];
+        if (code === 2)
+            key[word] = u32[(column >> 2) + index];
+        else if (code === 1)
+            key[word] = (u32[(column >> 2) + index] ^ 0x80000000) >>> 0;
+        else if (code === 0)
+            key[word] = orderF32(u32[(column >> 2) + index]);
+        else if (code === 3)
+            key[word] = u8[column + index] === 0 ? 0 : 1;
+        else
+            orderF64(u32[(column >> 2) + 2 * index + 1], u32[(column >> 2) + 2 * index], key, word);
+    }
+    return hashWords(key, 0, words);
+};
+const genericKey = new Uint32Array(64);
+/** `count` for any leaves. */
+const genericCount = (views, build, from, to) => {
+    const { i32, u32 } = views;
+    const archetypes = build.entityArchetype >> 2;
+    const rows = build.entityRow >> 2;
+    const bucketOf = build.bucketOf >> 2;
+    const { members, partitions, shift, mask } = build;
+    const key = genericKey.length >= build.words ? genericKey : new Uint32Array(build.words);
+    for (let piece = from; piece < to; piece++) {
+        const counted = (build.histogram >> 2) + piece * partitions;
+        for (let q = 0; q < partitions; q++)
+            i32[counted + q] = 0;
+        for (let entity = Math.max(1, piece * pieceEntities), end = Math.min(build.entityEnd, (piece + 1) * pieceEntities); entity < end; entity++) {
+            i32[bucketOf + entity] = -1;
+            const archetype = i32[archetypes + entity];
+            if (archetype < 0 || archetype >= members.length || members[archetype] < 0)
+                continue;
+            const hash = keyOf(views, build, members[archetype], u32[rows + entity], key);
+            i32[counted + ((hash & mask) >>> shift)]++;
+        }
+    }
+};
+/** `list` for any leaves. */
+const genericList = (views, build, from, to, _pair, _orderF32, _orderF64, offsets) => {
+    const { i32, u32 } = views;
+    const archetypes = build.entityArchetype >> 2;
+    const rows = build.entityRow >> 2;
+    const { members, partitions, shift, mask, words } = build;
+    const grouped = build.grouped >> 2;
+    const groupedKeys = build.groupedKeys >> 2;
+    const groupedHashes = build.groupedHashes >> 2;
+    const key = genericKey.length >= words ? genericKey : new Uint32Array(words);
+    for (let piece = from; piece < to; piece++) {
+        const counted = (build.histogram >> 2) + piece * partitions;
+        for (let q = 0; q < partitions; q++)
+            offsets[q] = i32[counted + q];
+        for (let entity = Math.max(1, piece * pieceEntities), end = Math.min(build.entityEnd, (piece + 1) * pieceEntities); entity < end; entity++) {
+            const archetype = i32[archetypes + entity];
+            if (archetype < 0 || archetype >= members.length || members[archetype] < 0)
+                continue;
+            const row = u32[rows + entity];
+            const hash = keyOf(views, build, members[archetype], row, key);
+            const position = offsets[(hash & mask) >>> shift]++;
+            u32[groupedHashes + position] = hash;
+            i32[grouped + position * entryWords] = entity;
+            i32[grouped + position * entryWords + 1] = archetype;
+            i32[grouped + position * entryWords + 2] = row;
+            for (let w = 0; w < words; w++)
+                u32[groupedKeys + position * words + w] = key[w];
+        }
+    }
+};
+const genericSteps = { count: genericCount, list: genericList };
+/** Each partition's buckets, in order of their first entry: its positions' buckets there, each bucket's first position and length. */
+const groupPartitions = ({ u32, i32 }, build, from, to) => {
+    const { words } = build;
+    const starts = build.starts >> 2;
+    const local = build.local >> 2;
+    const keys = build.groupedKeys >> 2;
+    const hashes = build.groupedHashes >> 2;
+    const first = build.first >> 2;
+    const lengths = build.lengths >> 2;
+    for (let q = from; q < to; q++) {
+        const start = i32[starts + q];
+        const end = i32[starts + q + 1];
+        const entries = end - start;
+        let size = 16;
+        while (size < 2 * entries)
+            size *= 2;
+        // By slot: its bucket, or -1, and that bucket's hash; by bucket: its first position and length.
+        const table = scratch.table = ensure(scratch.table, size);
+        const slotHashes = scratch.hashes = ensure(scratch.hashes, size);
+        const firsts = scratch.firsts = ensure(scratch.firsts, entries);
+        const counts = scratch.counts = ensure(scratch.counts, entries);
+        table.fill(-1, 0, size);
+        const tableMask = size - 1;
+        let buckets = 0;
+        for (let position = start; position < end; position++) {
+            const hash = u32[hashes + position] | 0;
+            // A partition's hashes share their partition's bits, so its table probes by the rest.
+            let slot = (hash ^ (hash >>> 16)) & tableMask;
+            let bucket = -1;
+            for (;; slot = (slot + 1) & tableMask) {
+                const found = table[slot];
+                if (found < 0)
+                    break;
+                if (slotHashes[slot] !== hash)
+                    continue;
+                const other = firsts[found];
+                let same = true;
+                for (let w = 0; w < words && same; w++)
+                    same = u32[keys + other * words + w] === u32[keys + position * words + w];
+                if (same) {
+                    bucket = found;
+                    break;
+                }
+            }
+            if (bucket < 0) {
+                bucket = buckets++;
+                table[slot] = bucket;
+                slotHashes[slot] = hash;
+                firsts[bucket] = position;
+                counts[bucket] = 0;
+            }
+            i32[local + position] = bucket;
+            counts[bucket]++;
+        }
+        let capacity = 0;
+        let crowded = 0;
+        for (let bucket = 0; bucket < buckets; bucket++) {
+            const length = counts[bucket];
+            i32[first + start + bucket] = firsts[bucket];
+            i32[lengths + start + bucket] = length;
+            capacity += capacityFor(length);
+            if (length > 1)
+                crowded++;
+        }
+        i32[(build.buckets >> 2) + q] = buckets;
+        i32[(build.capacity >> 2) + q] = capacity;
+        i32[(build.crowded >> 2) + q] = crowded;
+    }
+};
+/**
+ * Each partition's buckets into the table, from where `bucketBase` and `capacityBase` say: records, ticks and slots
+ * within the partition's range, those past its end listed for the world's thread; and its entries into their buckets'
+ * segments, in entity order, with each entity's bucket.
+ */
+const fillPartitions = ({ u32, i32, f64 }, build, from, to) => {
+    const { words, stride, mask, shift, tick, watched, placing } = build;
+    const starts = build.starts >> 2;
+    const local = build.local >> 2;
+    const grouped = build.grouped >> 2;
+    const keys = build.groupedKeys >> 2;
+    const hashes = build.groupedHashes >> 2;
+    const first = build.first >> 2;
+    const lengths = build.lengths >> 2;
+    const records = build.records >> 2;
+    const slots = build.slots >> 2;
+    const ticks = build.ticks >> 3;
+    const table = build.table >> 2;
+    const bucketOf = build.bucketOf >> 2;
+    const overflow = build.overflow >> 2;
+    for (let q = from; q < to; q++) {
+        const start = i32[starts + q];
+        const end = i32[starts + q + 1];
+        const buckets = i32[(build.buckets >> 2) + q];
+        const base = i32[(build.bucketBase >> 2) + q];
+        let segment = i32[(build.capacityBase >> 2) + q];
+        const segments = scratch.starts = ensure(scratch.starts, buckets);
+        const fills = scratch.fills = ensure(scratch.fills, buckets);
+        const regionEnd = (q + 1) << shift;
+        let overflowed = 0;
+        for (let bucket = 0; bucket < buckets; bucket++) {
+            const id = base + bucket;
+            const length = i32[lengths + start + bucket];
+            const position = i32[first + start + bucket];
+            const hash = u32[hashes + position];
+            const record = records + id * stride;
+            u32[record + recordHash] = hash;
+            u32[record + recordStart] = segment;
+            u32[record + recordLength] = length;
+            u32[record + recordCapacity] = capacityFor(length);
+            for (let w = 0; w < words; w++)
+                u32[record + recordKey + w] = u32[keys + position * words + w];
+            segments[bucket] = segment;
+            fills[bucket] = 0;
+            segment += capacityFor(length);
+            f64[ticks + id] = tick;
+            for (let k = 0; k < watched.length; k++)
+                f64[(watched[k] >> 3) + id] = tick;
+            if (!placing)
+                continue;
+            let slot = hash & mask;
+            while (slot < regionEnd && u32[slots + 2 * slot + 1] !== 0)
+                slot++;
+            if (slot === regionEnd)
+                i32[overflow + start + overflowed++] = id;
+            else {
+                u32[slots + 2 * slot] = hash;
+                u32[slots + 2 * slot + 1] = id + 1;
+            }
+        }
+        i32[(build.overflowed >> 2) + q] = overflowed;
+        for (let position = start; position < end; position++) {
+            const bucket = i32[local + position];
+            const at = table + (segments[bucket] + fills[bucket]++) * entryWords;
+            const source = grouped + position * entryWords;
+            const entity = i32[source];
+            i32[at] = entity;
+            i32[at + 1] = i32[source + 1];
+            i32[at + 2] = i32[source + 2];
+            i32[bucketOf + entity] = base + bucket;
+        }
+    }
+};
+//# sourceMappingURL=index-build.js.map

package/dist/implementation/world/index-build.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index-build.js","sourceRoot":"","sources":["../../../src/implementation/world/index-build.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,cAAc,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC5H,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAEhE,oHAAoH;AACpH,mHAAmH;AACnH,oHAAoH;AACpH,kFAAkF;AAElF,6IAA6I;AAC7I,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAC,CAAC;AAC9B,qCAAqC;AACrC,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,IAAI,EAAE,CAAC;AACrC,+EAA+E;AAC/E,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAGrC,4DAA4D;AAC5D,MAAM,CAAC,MAAM,MAAM,GAAqB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;AAE3E,wDAAwD;AACxD,MAAM,CAAC,MAAM,WAAW,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAkD,CAAC;AA0D1H,kHAAkH;AAClH,MAAM,SAAS,GAAG,CAAC,KAAgB,EAAqB,EAAE,CAAC;IACvD,KAAK,CAAC,eAAe,EAAE,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,WAAW,EAAE,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM;IAChO,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,QAAQ;IAChJ,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CACxH,CAAC;AACF,MAAM,QAAQ,GAAG,CAAC,KAAgB,EAAgC,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,WAAW,EAAE,KAAK,CAAC,WAAW,EAAE,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;AAE3L,8BAA8B;AAC9B,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,KAAgB,EAAU,EAAE;IAClD,IAAI,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;IACpC,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,KAAK,CAAC;QAAE,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAC/D,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF,+CAA+C;AAC/C,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,GAAiB,EAAE,EAAU,EAAE,KAAgB,EAAQ,EAAE;IAC/E,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,KAAK,CAAC;QAAE,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC;IAC1D,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAClC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC;AACL,CAAC,CAAC;AAEF,gHAAgH;AAChH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,GAAiB,EAAE,OAAe,EAAa,EAAE;IACtE,IAAI,IAAI,GAAG,OAAO,IAAI,CAAC,CAAC;IACxB,MAAM,MAAM,GAAG,GAAW,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,GAAiB,EAAE;QAC7B,MAAM,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;QAC3B,IAAI,IAAI,MAAM,CAAC;QACf,OAAO,GAAG,CAAC,QAAQ,CAAC,IAAI,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC;IAC7C,CAAC,CAAC;IACF,OAAO;QACH,eAAe,EAAE,MAAM,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE;QAC7I,IAAI,EAAE,MAAM,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE;QAC7E,aAAa,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE;QAC1I,YAAY,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE;QACxI,MAAM,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC;QAC/G,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE;KAC3I,CAAC;AACN,CAAC,CAAC;AAKF,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,MAAuB,EAAc,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,IAAI,WAAW,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,IAAI,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AAE9L,2IAA2I;AAC3I,MAAM,OAAO,GAAkJ;IAC3J,OAAO,EAAE,IAAI,UAAU,CAAC,iBAAiB,CAAC,EAAE,KAAK,EAAE,IAAI,UAAU,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,UAAU,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,UAAU,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,UAAU,CAAC,EAAE,CAAC;IACzJ,MAAM,EAAE,IAAI,UAAU,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,UAAU,CAAC,EAAE,CAAC;CACxD,CAAC;AAEF,MAAM,MAAM,GAAG,CAAC,KAAiB,EAAE,MAAc,EAAc,EAAE,CAAC,KAAK,CAAC,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;AAEtJ,uHAAuH;AACvH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAiB,EAAE,KAAgB,EAAE,KAAY,EAAE,IAAY,EAAE,EAAU,EAAQ,EAAE;IAC9G,IAAI,KAAK,KAAK,OAAO,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;QACxC,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,KAAK,KAAK,OAAO;YAAE,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;;YAC/E,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;IACtF,CAAC;SACI,IAAI,KAAK,KAAK,OAAO;QAAE,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;;QAC/D,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;AAChD,CAAC,CAAC;AAEF,mCAAmC;AACnC,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;AAWhC;;;GAGG;AACH,MAAM,aAAa,GAAG,CAAC,KAAgB,EAAU,EAAE;IAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC;IACtC,MAAM,KAAK,GAAa,CAAC,uBAAuB,MAAM,GAAG,CAAC,CAAC;IAC3D,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,SAAS,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9E,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACnC,KAAK,CAAC,IAAI,CAAC,UAAU,IAAI,qBAAqB,IAAI,IAAI,CAAC,CAAC;QACxD,QAAQ,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,UAAU,IAAI,qBAAqB,IAAI,YAAY,KAAK,KAAK,CAAC,CAAC;gBAAC,MAAM;YACzF,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,UAAU,IAAI,aAAa,IAAI,YAAY,KAAK,wBAAwB,CAAC,CAAC;gBAAC,MAAM;YACpG,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,UAAU,IAAI,YAAY,IAAI,YAAY,KAAK,IAAI,CAAC,CAAC;gBAAC,MAAM;YAC/E,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,UAAU,IAAI,UAAU,IAAI,MAAM,KAAK,kBAAkB,CAAC,CAAC;gBAAC,MAAM;YACrF,OAAO,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,kBAAkB,IAAI,iBAAiB,KAAK,iBAAiB,IAAI,iBAAiB,KAAK,eAAe,EAAE,UAAU,IAAI,gBAAgB,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC;QACrL,CAAC;IACL,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE;QAAE,KAAK,CAAC,IAAI,CAAC,4BAA4B,CAAC,qCAAqC,CAAC,CAAC;IACrH,KAAK,CAAC,IAAI,CAAC,8IAA8I,CAAC,CAAC;IAC3J,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC5B,CAAC,CAAC;AAEF,gEAAgE;AAChE,MAAM,WAAW,GAAG,CAAC,KAAgB,EAAU,EAAE;IAC7C,MAAM,IAAI,GAAG,CAAC,KAAwB,EAAU,EAAE,CAAC;QAC/C,6GAA6G;QAC7G,8DAA8D;QAC9D,iEAAiE;QACjE,qHAAqH;QACrH,+CAA+C;QAC/C,qCAAqC,aAAa,oDAAoD,aAAa,IAAI;QACvH,iDAAiD;QACjD,GAAG,KAAK;QACR,GAAG;KACN,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACb,MAAM,MAAM,GAAG;QACX,6CAA6C;QAC7C,oDAAoD;QACpD,kCAAkC;QAClC,yBAAyB;QACzB,iCAAiC;QACjC,aAAa,CAAC,KAAK,CAAC;KACvB,CAAC;IACF,MAAM,KAAK,GAAG,IAAI,CAAC;QACf,4DAA4D;QAC5D,oDAAoD;QACpD,8BAA8B;QAC9B,GAAG,MAAM;QACT,6CAA6C;QAC7C,GAAG;KACN,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,IAAI,CAAC;QACd,qEAAqE;QACrE,oDAAoD;QACpD,GAAG,MAAM;QACT,sDAAsD;QACtD,uCAAuC;QACvC,uCAAuC,UAAU,GAAG;QACpD,2EAA2E;QAC3E,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gCAAgC,KAAK,CAAC,KAAK,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;QAChH,GAAG;KACN,CAAC,CAAC;IACH,OAAO;QACH,UAAU;QACV,8EAA8E,KAAK,MAAM;QACzF,sFAAsF,IAAI,MAAM;QAChG,IAAI;KACP,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACjB,CAAC,CAAC;AAEF,wGAAwG;AACxG,IAAI,UAAU,GAAG,IAAI,CAAC;AACtB,qDAAqD;AACrD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAsB,CAAC;AAEhD,2GAA2G;AAC3G,MAAM,QAAQ,GAAG,CAAC,KAAgB,EAAc,EAAE;IAC9C,IAAI,CAAC,UAAU;QAAE,OAAO,YAAY,CAAC;IACrC,MAAM,SAAS,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9K,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACvC,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACtC,IAAI,CAAC;QACD,2EAA2E;QAC3E,MAAM,KAAK,GAAe,IAAI,QAAQ,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;QAC7D,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAChC,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,MAAM,CAAC;QACH,UAAU,GAAG,KAAK,CAAC;QACnB,OAAO,YAAY,CAAC;IACxB,CAAC;AACL,CAAC,CAAC;AAEF,iFAAiF;AACjF,MAAM,KAAK,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAc,EAAE,KAAgB,EAAE,IAAY,EAAE,GAAW,EAAE,GAAgB,EAAU,EAAE;IAC7G,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;IACjF,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAChC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QACvC,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC,CAAC;QAC7C,MAAM,KAAK,GAAG,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QAC1D,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,IAAI,KAAK,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;aAClD,IAAI,IAAI,KAAK,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;aAC5E,IAAI,IAAI,KAAK,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;aACjE,IAAI,IAAI,KAAK,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;;YAC7D,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IACjG,CAAC;IACD,OAAO,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;AACpC,CAAC,CAAC;AAEF,MAAM,UAAU,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;AAEvC,8BAA8B;AAC9B,MAAM,YAAY,GAAwB,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE;IACjE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC;IAC3B,MAAM,UAAU,GAAG,KAAK,CAAC,eAAe,IAAI,CAAC,CAAC;IAC9C,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC;IACrC,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;IACnD,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACzF,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,UAAU,CAAC;QAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1D,KAAK,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,aAAa,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,EAAE,MAAM,GAAG,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC;YACzI,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5B,MAAM,SAAS,GAAG,GAAG,CAAC,UAAU,GAAG,MAAM,CAAC,CAAC;YAC3C,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC;gBAAE,SAAS;YACrF,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;YAC9E,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;QAC/C,CAAC;IACL,CAAC;AACL,CAAC,CAAC;AAEF,6BAA6B;AAC7B,MAAM,WAAW,GAAuB,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE;IACrG,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC;IAC3B,MAAM,UAAU,GAAG,KAAK,CAAC,eAAe,IAAI,CAAC,CAAC;IAC9C,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC;IAClC,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;IAC1D,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC;IACnC,MAAM,WAAW,GAAG,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC;IAC3C,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,IAAI,CAAC,CAAC;IAC/C,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;IAC7E,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,UAAU,CAAC;QAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE;YAAE,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QACnE,KAAK,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,aAAa,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,EAAE,MAAM,GAAG,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC;YACzI,MAAM,SAAS,GAAG,GAAG,CAAC,UAAU,GAAG,MAAM,CAAC,CAAC;YAC3C,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC;gBAAE,SAAS;YACrF,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC;YAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,SAAS,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YAC/D,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACpD,GAAG,CAAC,aAAa,GAAG,QAAQ,CAAC,GAAG,IAAI,CAAC;YACrC,GAAG,CAAC,OAAO,GAAG,QAAQ,GAAG,UAAU,CAAC,GAAG,MAAM,CAAC;YAC9C,GAAG,CAAC,OAAO,GAAG,QAAQ,GAAG,UAAU,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;YACrD,GAAG,CAAC,OAAO,GAAG,QAAQ,GAAG,UAAU,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;YAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;gBAAE,GAAG,CAAC,WAAW,GAAG,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACrF,CAAC;IACL,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,YAAY,GAAe,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;AAE5E,sIAAsI;AACtI,MAAM,eAAe,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAc,EAAE,KAAgB,EAAE,IAAY,EAAE,EAAU,EAAQ,EAAE;IACnG,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;IACxB,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,KAAK,CAAC,aAAa,IAAI,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IAC/B,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAChC,MAAM,OAAO,GAAG,GAAG,GAAG,KAAK,CAAC;QAC5B,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,OAAO,IAAI,GAAG,CAAC,GAAG,OAAO;YAAE,IAAI,IAAI,CAAC,CAAC;QACrC,gGAAgG;QAChG,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC1D,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACjE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAChE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACxB,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC;QAC3B,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,IAAI,QAAQ,GAAG,KAAK,EAAE,QAAQ,GAAG,GAAG,EAAE,QAAQ,EAAE,EAAE,CAAC;YACpD,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;YACxC,sFAAsF;YACtF,IAAI,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC;YAC9C,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;YAChB,QAAS,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC;gBACrC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC1B,IAAI,KAAK,GAAG,CAAC;oBAAE,MAAM;gBACrB,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,IAAI;oBAAE,SAAS;gBACxC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC5B,IAAI,IAAI,GAAG,IAAI,CAAC;gBAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,IAAI,EAAE,CAAC,EAAE;oBAAE,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,GAAG,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;gBAClH,IAAI,IAAI,EAAE,CAAC;oBACP,MAAM,GAAG,KAAK,CAAC;oBACf,MAAM;gBACV,CAAC;YACL,CAAC;YACD,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBACb,MAAM,GAAG,OAAO,EAAE,CAAC;gBACnB,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;gBACrB,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;gBACxB,MAAM,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC;gBAC1B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACvB,CAAC;YACD,GAAG,CAAC,KAAK,GAAG,QAAQ,CAAC,GAAG,MAAM,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QACrB,CAAC;QACD,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC;YAC9C,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;YAC9B,GAAG,CAAC,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;YAC7C,GAAG,CAAC,OAAO,GAAG,KAAK,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC;YACvC,QAAQ,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,IAAI,MAAM,GAAG,CAAC;gBAAE,OAAO,EAAE,CAAC;QAC9B,CAAC;QACD,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC;QACxC,GAAG,CAAC,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC;QAC1C,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC;IAC5C,CAAC;AACL,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,cAAc,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAc,EAAE,KAAgB,EAAE,IAAY,EAAE,EAAU,EAAQ,EAAE;IACvG,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IACrE,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IAC/B,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC;IACnC,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,KAAK,CAAC,aAAa,IAAI,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IAC/B,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC;IACrC,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAChC,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,IAAI,OAAO,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,YAAY,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAClE,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC7D,MAAM,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC;QACnC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC;YAC9C,MAAM,EAAE,GAAG,IAAI,GAAG,MAAM,CAAC;YACzB,MAAM,MAAM,GAAG,GAAG,CAAC,OAAO,GAAG,KAAK,GAAG,MAAM,CAAC,CAAC;YAC7C,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC,CAAC;YAC7C,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,OAAO,GAAG,EAAE,GAAG,MAAM,CAAC;YACrC,GAAG,CAAC,MAAM,GAAG,UAAU,CAAC,GAAG,IAAI,CAAC;YAChC,GAAG,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,OAAO,CAAC;YACpC,GAAG,CAAC,MAAM,GAAG,YAAY,CAAC,GAAG,MAAM,CAAC;YACpC,GAAG,CAAC,MAAM,GAAG,cAAc,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;gBAAE,GAAG,CAAC,MAAM,GAAG,SAAS,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,GAAG,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;YAC/F,QAAQ,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC;YAC3B,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAClB,OAAO,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;YAC/B,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;YAC5E,IAAI,CAAC,OAAO;gBAAE,SAAS;YACvB,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;YACvB,OAAO,IAAI,GAAG,SAAS,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC;gBAAE,IAAI,EAAE,CAAC;YACnE,IAAI,IAAI,KAAK,SAAS;gBAAE,GAAG,CAAC,QAAQ,GAAG,KAAK,GAAG,UAAU,EAAE,CAAC,GAAG,EAAE,CAAC;iBAC7D,CAAC;gBACF,GAAG,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;gBAC7B,GAAG,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACvC,CAAC;QACL,CAAC;QACD,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC;QAC9C,KAAK,IAAI,QAAQ,GAAG,KAAK,EAAE,QAAQ,GAAG,GAAG,EAAE,QAAQ,EAAE,EAAE,CAAC;YACpD,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC;YACrC,MAAM,EAAE,GAAG,KAAK,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC;YACrE,MAAM,MAAM,GAAG,OAAO,GAAG,QAAQ,GAAG,UAAU,CAAC;YAC/C,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3B,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC;YACjB,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9B,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9B,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;QAC3C,CAAC;IACL,CAAC;AACL,CAAC,CAAC"}

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

@@ -0,0 +1,99 @@
+import type { Memory } from './memory.js';
+/** Words an entry takes: its entity index, its archetype's id and its row. */
+export declare const entryWords = 3;
+/** A bucket record's words: its key's hash, its segment's first entry, length and capacity, then its key's words. */
+export declare const recordHash = 0;
+export declare const recordStart = 1;
+export declare const recordLength = 2;
+export declare const recordCapacity = 3;
+export declare const recordKey = 4;
+/**
+ * A hash index: an open-addressing table of buckets by key, linear probing, at most half full, each slot a key's hash
+ * and its bucket, so a probe reads one line until a hash matches; each bucket a record of its hash, segment and key,
+ * its segment of one entries buffer with spare slots holding its entries in entity order. Every array is in the arena,
+ * so other threads read it where the world's thread wrote it. By entity index, the bucket it's filed in, so its old
+ * bucket is found without its old key.
+ */
+export type HashTable = {
+    readonly memory: Memory;
+    /** Words of a key, and of a bucket's record. */
+    readonly words: number;
+    readonly stride: number;
+    /** By slot, two words: a bucket's hash and its id plus one, or 0 for none. */
+    slots: Uint32Array;
+    /** By bucket id: its record, and the tick an entity last entered, left or moved in it. */
+    records: Uint32Array;
+    ticks: Float64Array;
+    /** Bucket ids in use, the ones freed, and how many are empty but kept for their ticks. */
+    count: number;
+    readonly freed: number[];
+    empty: number;
+    /** The newest tick at which a bucket was dropped, which a key no bucket holds counts as changed at. */
+    cleared: number;
+    /** Entries, `entryWords` each; the words segments use, and those moved segments left behind. */
+    entries: Int32Array;
+    used: number;
+    garbage: number;
+    /** By entity index: its bucket, or -1. */
+    bucketOf: Int32Array;
+    /** Entries held. */
+    size: number;
+    /** By component a lookup watches: by bucket, the newest tick its value may have changed in a row there. */
+    readonly watched: Map<number, Float64Array>;
+};
+/** What lookups read of a hash table: on the world's thread the table, on a joined thread its views of it. */
+export type HashView = Pick<HashTable, "words" | "stride" | "slots" | "records" | "ticks" | "cleared" | "entries"> & {
+    readonly watched: ReadonlyMap<number, Float64Array>;
+};
+/** Whether `slots` slots hold `buckets` buckets. */
+export declare const slotsHold: (slots: number, buckets: number) => boolean;
+export declare const createHashTable: (memory: Memory, words: number) => HashTable;
+/** Frees every array, once nothing reads the table again. */
+export declare const releaseHashTable: (table: HashTable) => void;
+/** Grows what's by entity index to cover `length` indexes. */
+export declare const coverEntities: (table: HashTable, length: number) => void;
+/** Grows what's by bucket id to hold `count` buckets. */
+export declare const coverBuckets: (table: HashTable, count: number) => void;
+/** A bucket's segment's first entry, length and capacity. */
+export declare const startOf: (table: HashView, bucket: number) => number;
+export declare const lengthOf: (table: HashView, bucket: number) => number;
+/** The bucket of a key, by its hash, or -1 when none holds it. */
+export declare const findBucket: (table: HashView, key: Uint32Array, at: number, hash: number) => number;
+/** Places a bucket in the table by its hash; the table has a free slot. */
+export declare const place: (slots: Uint32Array, bucket: number, hash: number) => void;
+/** Empties the table at a capacity for `buckets`. */
+export declare const rehash: (table: HashTable, buckets: number) => void;
+/** Places every bucket not freed in the table again. */
+export declare const placeAll: (table: HashTable) => void;
+/** The bucket of a key, made empty when none holds it, with its tick at `tick`. */
+export declare const bucketFor: (table: HashTable, key: Uint32Array, at: number, hash: number, tick: number) => number;
+/** Spare slots a segment of `length` entries gets: an eighth, at least 4. */
+export declare const capacityFor: (length: number) => number;
+/** Where entity index `index` is in a bucket, or where it would go, by binary search: `~position` when it isn't there. */
+export declare const positionIn: (table: HashTable, bucket: number, index: number) => number;
+/** Updates where entity index `index` is: its archetype and row, in the bucket it's filed in. */
+export declare const relocate: (table: HashTable, bucket: number, index: number, archetype: number, row: number) => void;
+/** Removes entity index `index` from a bucket, stamping it. */
+export declare const removeEntry: (table: HashTable, bucket: number, index: number, tick: number) => void;
+/** Inserts entity index `index` at its archetype and row into a bucket, in entity order, stamping it. */
+export declare const insertEntry: (table: HashTable, bucket: number, index: number, archetype: number, row: number, tick: number) => void;
+/**
+ * Applies many removals and insertions to one bucket in one merge: `removed` entity indexes and `added` entries
+ * (`entryWords` each), both in entity order. Keeps the bucket's entries in entity order.
+ */
+export declare const mergeEntries: (table: HashTable, bucket: number, removed: Int32Array, removedCount: number, added: Int32Array, addedCount: number, scratch: Int32Array, tick: number) => void;
+/**
+ * Drops the empty buckets once they outnumber those holding entries, compacting the segments when moves left more
+ * garbage than live entries. A key whose bucket was dropped counts as changed at `tick`.
+ */
+export declare const tidyHashTable: (table: HashTable, tick: number) => void;
+/**
+ * Builds the table again from `count` entries in entity order: entity indexes, archetypes and rows (`entryWords` each
+ * in `entries`), and their keys' words and hashes, with `bucketOfEntry` for scratch. Every bucket's tick, and every
+ * watched tick, is `tick`.
+ */
+export declare const loadHashTable: (table: HashTable, count: number, entries: Int32Array, keys: Uint32Array, hashes: Uint32Array, bucketOfEntry: Int32Array, tick: number, entityCount: number) => void;
+/** Starts keeping, by bucket, the newest tick a watched component may have changed in a row there, at `tick`. */
+export declare const watchHashComponent: (table: HashTable, component: number, tick: number) => void;
+/** Stops keeping a watched component's ticks. */
+export declare const unwatchHashComponent: (table: HashTable, component: number) => void;