@adobe/ecs 0.0.0-stage → 0.1.0

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

@@ -0,0 +1,440 @@
+import { allocateArray, freeArray } from './arrays.js';
+/** Words an entry takes: its entity index, its archetype's id and its row. */
+export 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 const recordHash = 0;
+export const recordStart = 1;
+export const recordLength = 2;
+export const recordCapacity = 3;
+export const recordKey = 4;
+/** A freed bucket's capacity. */
+const freedCapacity = 0xFFFFFFFF;
+const minimumSlots = 16;
+/** Slots the table keeps for each bucket at least: it's at most half full. */
+const slotsPerBucket = 2;
+/** Whether `slots` slots hold `buckets` buckets. */
+export const slotsHold = (slots, buckets) => slotsPerBucket * buckets + 2 <= slots;
+export const createHashTable = (memory, words) => ({
+    memory,
+    words,
+    stride: recordKey + words,
+    slots: allocateArray(memory, Uint32Array, 2 * minimumSlots).fill(0),
+    records: allocateArray(memory, Uint32Array, 8 * (recordKey + words)),
+    ticks: allocateArray(memory, Float64Array, 8),
+    count: 0,
+    freed: [],
+    empty: 0,
+    cleared: 0,
+    entries: allocateArray(memory, Int32Array, 64 * entryWords),
+    used: 0,
+    garbage: 0,
+    bucketOf: allocateArray(memory, Int32Array, 64).fill(-1),
+    size: 0,
+    watched: new Map(),
+});
+/** Frees every array, once nothing reads the table again. */
+export const releaseHashTable = (table) => {
+    const { memory } = table;
+    for (const array of [table.slots, table.records, table.ticks, table.entries, table.bucketOf, ...table.watched.values()])
+        freeArray(memory, array);
+    table.watched.clear();
+};
+/** An array of `length` in the arena holding the first `used` elements of `array`, which is freed; the rest filled with `fill`. */
+const regrow = (memory, array, constructor, length, used, fill) => {
+    const grown = allocateArray(memory, constructor, length);
+    grown.set(array.subarray(0, used));
+    grown.fill(fill, used);
+    freeArray(memory, array);
+    return grown;
+};
+/** Grows what's by entity index to cover `length` indexes. */
+export const coverEntities = (table, length) => {
+    if (table.bucketOf.length >= length)
+        return;
+    table.bucketOf = regrow(table.memory, table.bucketOf, Int32Array, Math.max(length, 2 * table.bucketOf.length), table.bucketOf.length, -1);
+};
+/** Grows what's by bucket id to hold `count` buckets. */
+export const coverBuckets = (table, count) => {
+    const capacity = table.ticks.length;
+    if (capacity >= count)
+        return;
+    const length = Math.max(count, 2 * capacity);
+    const { memory, stride } = table;
+    table.records = regrow(memory, table.records, Uint32Array, length * stride, capacity * stride, 0);
+    table.ticks = regrow(memory, table.ticks, Float64Array, length, capacity, 0);
+    for (const [component, ticks] of table.watched)
+        table.watched.set(component, regrow(memory, ticks, Float64Array, length, capacity, 0));
+};
+/** A bucket's segment's first entry, length and capacity. */
+export const startOf = (table, bucket) => table.records[bucket * table.stride + recordStart];
+export const lengthOf = (table, bucket) => table.records[bucket * table.stride + recordLength];
+const capacityOf = (table, bucket) => table.records[bucket * table.stride + recordCapacity];
+const isFreed = (table, bucket) => capacityOf(table, bucket) === freedCapacity;
+/** Whether bucket `bucket`'s key is the `words` of `key` from `at`. */
+const sameKey = (table, bucket, key, at) => {
+    const { records, words } = table;
+    const base = bucket * table.stride + recordKey;
+    for (let k = 0; k < words; k++)
+        if (records[base + k] !== key[at + k])
+            return false;
+    return true;
+};
+/** The bucket of a key, by its hash, or -1 when none holds it. */
+export const findBucket = (table, key, at, hash) => {
+    const { slots } = table;
+    const mask = (slots.length >> 1) - 1;
+    for (let slot = hash & mask;; slot = (slot + 1) & mask) {
+        const found = slots[2 * slot + 1];
+        if (found === 0)
+            return -1;
+        if (slots[2 * slot] === hash && sameKey(table, found - 1, key, at))
+            return found - 1;
+    }
+};
+/** Places a bucket in the table by its hash; the table has a free slot. */
+export const place = (slots, bucket, hash) => {
+    const mask = (slots.length >> 1) - 1;
+    let slot = hash & mask;
+    while (slots[2 * slot + 1] !== 0)
+        slot = (slot + 1) & mask;
+    slots[2 * slot] = hash;
+    slots[2 * slot + 1] = bucket + 1;
+};
+/** Empties the table at a capacity for `buckets`. */
+export const rehash = (table, buckets) => {
+    let capacity = minimumSlots;
+    while (!slotsHold(capacity, buckets))
+        capacity *= 2;
+    if (2 * capacity !== table.slots.length) {
+        freeArray(table.memory, table.slots);
+        table.slots = allocateArray(table.memory, Uint32Array, 2 * capacity);
+    }
+    table.slots.fill(0);
+};
+/** Places every bucket not freed in the table again. */
+export const placeAll = (table) => {
+    const { records, stride } = table;
+    for (let bucket = 0; bucket < table.count; bucket++)
+        if (!isFreed(table, bucket))
+            place(table.slots, bucket, records[bucket * stride + recordHash]);
+};
+/** The bucket of a key, made empty when none holds it, with its tick at `tick`. */
+export const bucketFor = (table, key, at, hash, tick) => {
+    const found = findBucket(table, key, at, hash);
+    if (found >= 0)
+        return found;
+    const live = table.count - table.freed.length;
+    if (!slotsHold(table.slots.length >> 1, live + 1)) {
+        rehash(table, live + 1);
+        placeAll(table);
+    }
+    const bucket = table.freed.pop() ?? table.count++;
+    coverBuckets(table, table.count);
+    const { records, words, stride } = table;
+    const base = bucket * stride;
+    records[base + recordHash] = hash;
+    records[base + recordStart] = 0;
+    records[base + recordLength] = 0;
+    records[base + recordCapacity] = 0;
+    for (let k = 0; k < words; k++)
+        records[base + recordKey + k] = key[at + k];
+    table.ticks[bucket] = tick;
+    for (const ticks of table.watched.values())
+        ticks[bucket] = tick;
+    table.empty++;
+    place(table.slots, bucket, hash);
+    return bucket;
+};
+/** Spare slots a segment of `length` entries gets: an eighth, at least 4. */
+export const capacityFor = (length) => length + Math.max(4, length >> 3);
+/** A segment of `capacity` entries at the end of the buffer, growing it as needed; returns its first entry. */
+const allocateSegment = (table, capacity) => {
+    const start = table.used;
+    const needed = (start + capacity) * entryWords;
+    if (needed > table.entries.length) {
+        table.entries = regrow(table.memory, table.entries, Int32Array, Math.max(needed, 2 * table.entries.length), table.used * entryWords, 0);
+    }
+    table.used += capacity;
+    return start;
+};
+/** Gives a bucket room for `length` entries, moving its segment to the end of the buffer when it doesn't fit. */
+const reserve = (table, bucket, length) => {
+    const base = bucket * table.stride;
+    if (table.records[base + recordCapacity] >= length)
+        return;
+    const capacity = capacityFor(length);
+    const start = allocateSegment(table, capacity);
+    const { entries, records } = table;
+    const from = records[base + recordStart] * entryWords;
+    entries.copyWithin(start * entryWords, from, from + records[base + recordLength] * entryWords);
+    table.garbage += records[base + recordCapacity];
+    records[base + recordStart] = start;
+    records[base + recordCapacity] = capacity;
+};
+/**
+ * Moves `words` of entries, a multiple of `entryWords`, from `from` to `to` within one buffer: by hand, an entry a step,
+ * when few, which a native call would cost more than.
+ */
+const move = (entries, to, from, words) => {
+    if (words > 96) {
+        entries.copyWithin(to, from, from + words);
+        return;
+    }
+    if (to < from) {
+        for (let k = 0; k < words; k += 3) {
+            entries[to + k] = entries[from + k];
+            entries[to + k + 1] = entries[from + k + 1];
+            entries[to + k + 2] = entries[from + k + 2];
+        }
+    }
+    else {
+        for (let k = words - 3; k >= 0; k -= 3) {
+            entries[to + k + 2] = entries[from + k + 2];
+            entries[to + k + 1] = entries[from + k + 1];
+            entries[to + k] = entries[from + k];
+        }
+    }
+};
+/** Where entity index `index` is in a bucket, or where it would go, by binary search: `~position` when it isn't there. */
+export const positionIn = (table, bucket, index) => {
+    const { entries } = table;
+    const base = startOf(table, bucket);
+    let low = 0;
+    let high = lengthOf(table, bucket);
+    while (low < high) {
+        const middle = (low + high) >>> 1;
+        const at = entries[(base + middle) * entryWords];
+        if (at < index)
+            low = middle + 1;
+        else if (at > index)
+            high = middle;
+        else
+            return middle;
+    }
+    return ~low;
+};
+/** Updates where entity index `index` is: its archetype and row, in the bucket it's filed in. */
+export const relocate = (table, bucket, index, archetype, row) => {
+    const position = positionIn(table, bucket, index);
+    if (position < 0)
+        return;
+    const at = (startOf(table, bucket) + position) * entryWords;
+    table.entries[at + 1] = archetype;
+    table.entries[at + 2] = row;
+};
+/** Notes that a bucket gained or lost its last entry. */
+const countEmpty = (table, before, after) => {
+    if (before === 0 && after > 0)
+        table.empty--;
+    else if (before > 0 && after === 0)
+        table.empty++;
+};
+/** Removes entity index `index` from a bucket, stamping it. */
+export const removeEntry = (table, bucket, index, tick) => {
+    const position = positionIn(table, bucket, index);
+    if (position < 0)
+        return;
+    const record = bucket * table.stride;
+    const length = table.records[record + recordLength];
+    const base = table.records[record + recordStart] * entryWords;
+    move(table.entries, base + position * entryWords, base + (position + 1) * entryWords, (length - position - 1) * entryWords);
+    table.records[record + recordLength] = length - 1;
+    table.ticks[bucket] = tick;
+    table.size--;
+    countEmpty(table, length, length - 1);
+};
+/** Inserts entity index `index` at its archetype and row into a bucket, in entity order, stamping it. */
+export const insertEntry = (table, bucket, index, archetype, row, tick) => {
+    const record = bucket * table.stride;
+    const length = table.records[record + recordLength];
+    reserve(table, bucket, length + 1);
+    const found = positionIn(table, bucket, index);
+    const position = found < 0 ? ~found : found;
+    const base = table.records[record + recordStart] * entryWords;
+    const { entries } = table;
+    move(entries, base + (position + 1) * entryWords, base + position * entryWords, (length - position) * entryWords);
+    const at = base + position * entryWords;
+    entries[at] = index;
+    entries[at + 1] = archetype;
+    entries[at + 2] = row;
+    table.records[record + recordLength] = length + 1;
+    table.ticks[bucket] = tick;
+    table.size++;
+    countEmpty(table, length, length + 1);
+};
+/**
+ * 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 const mergeEntries = (table, bucket, removed, removedCount, added, addedCount, scratch, tick) => {
+    const record = bucket * table.stride;
+    const length = table.records[record + recordLength];
+    const result = length - removedCount + addedCount;
+    const base = table.records[record + recordStart] * entryWords;
+    // The bucket's current entries, copied out, merged back with the insertions, skipping the removals.
+    scratch.set(table.entries.subarray(base, base + length * entryWords));
+    reserve(table, bucket, result);
+    const target = table.entries;
+    let to = table.records[record + recordStart] * entryWords;
+    let r = 0;
+    let a = 0;
+    for (let k = 0; k < length; k++) {
+        const index = scratch[k * entryWords];
+        while (r < removedCount && removed[r] < index)
+            r++;
+        while (a < addedCount && added[a * entryWords] < index) {
+            target[to++] = added[a * entryWords];
+            target[to++] = added[a * entryWords + 1];
+            target[to++] = added[a * entryWords + 2];
+            a++;
+        }
+        if (r < removedCount && removed[r] === index) {
+            r++;
+            continue;
+        }
+        target[to++] = index;
+        target[to++] = scratch[k * entryWords + 1];
+        target[to++] = scratch[k * entryWords + 2];
+    }
+    for (; a < addedCount; a++) {
+        target[to++] = added[a * entryWords];
+        target[to++] = added[a * entryWords + 1];
+        target[to++] = added[a * entryWords + 2];
+    }
+    table.records[record + recordLength] = result;
+    table.ticks[bucket] = tick;
+    table.size += result - length;
+    countEmpty(table, length, result);
+};
+/**
+ * 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 const tidyHashTable = (table, tick) => {
+    const live = table.count - table.freed.length - table.empty;
+    if (table.empty > Math.max(64, live)) {
+        const { records, stride } = table;
+        for (let bucket = 0; bucket < table.count; bucket++) {
+            const base = bucket * stride;
+            if (records[base + recordCapacity] === freedCapacity || records[base + recordLength] > 0)
+                continue;
+            table.garbage += records[base + recordCapacity];
+            records[base + recordCapacity] = freedCapacity;
+            table.freed.push(bucket);
+        }
+        table.empty = 0;
+        table.cleared = tick;
+        rehash(table, live);
+        placeAll(table);
+    }
+    if (table.garbage > Math.max(1024, table.used - table.garbage))
+        compact(table);
+};
+/** Lays every bucket's segment out again, one after another, with their spare slots. */
+const compact = (table) => {
+    const { records, stride } = table;
+    let total = 0;
+    for (let bucket = 0; bucket < table.count; bucket++)
+        if (!isFreed(table, bucket))
+            total += capacityFor(records[bucket * stride + recordLength]);
+    const old = table.entries;
+    const entries = allocateArray(table.memory, Int32Array, Math.max(64, total) * entryWords);
+    let used = 0;
+    for (let bucket = 0; bucket < table.count; bucket++) {
+        if (isFreed(table, bucket))
+            continue;
+        const base = bucket * stride;
+        const length = records[base + recordLength];
+        const from = records[base + recordStart] * entryWords;
+        entries.set(old.subarray(from, from + length * entryWords), used * entryWords);
+        records[base + recordStart] = used;
+        records[base + recordCapacity] = capacityFor(length);
+        used += records[base + recordCapacity];
+    }
+    freeArray(table.memory, old);
+    table.entries = entries;
+    table.used = used;
+    table.garbage = 0;
+};
+/**
+ * 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 const loadHashTable = (table, count, entries, keys, hashes, bucketOfEntry, tick, entityCount) => {
+    const { words, stride } = table;
+    coverEntities(table, entityCount);
+    table.bucketOf.fill(-1);
+    // Sized for as many buckets as it last held, growing as more are found, so the table is as small as its keys need.
+    const expected = Math.min(count, Math.max(16, table.count - table.freed.length - table.empty));
+    table.count = 0;
+    table.freed.length = 0;
+    table.empty = 0;
+    table.cleared = tick;
+    table.size = count;
+    rehash(table, expected);
+    coverBuckets(table, expected);
+    for (let k = 0; k < count; k++) {
+        const hash = hashes[k];
+        let bucket = findBucket(table, keys, k * words, hash);
+        if (bucket < 0) {
+            if (!slotsHold(table.slots.length >> 1, table.count + 1)) {
+                rehash(table, 2 * (table.count + 1));
+                placeAll(table);
+            }
+            bucket = table.count++;
+            coverBuckets(table, table.count);
+            const base = bucket * stride;
+            table.records[base + recordHash] = hash;
+            table.records[base + recordLength] = 0;
+            table.records[base + recordCapacity] = 0;
+            for (let w = 0; w < words; w++)
+                table.records[base + recordKey + w] = keys[k * words + w];
+            place(table.slots, bucket, hash);
+        }
+        table.records[bucket * stride + recordLength]++;
+        bucketOfEntry[k] = bucket;
+    }
+    const { records } = table;
+    let used = 0;
+    for (let bucket = 0; bucket < table.count; bucket++) {
+        const base = bucket * stride;
+        records[base + recordStart] = used;
+        records[base + recordCapacity] = capacityFor(records[base + recordLength]);
+        used += records[base + recordCapacity];
+        records[base + recordLength] = 0;
+        table.ticks[bucket] = tick;
+        for (const ticks of table.watched.values())
+            ticks[bucket] = tick;
+    }
+    if (used * entryWords > table.entries.length) {
+        freeArray(table.memory, table.entries);
+        table.entries = allocateArray(table.memory, Int32Array, Math.max(64, used) * entryWords);
+    }
+    table.used = used;
+    table.garbage = 0;
+    const target = table.entries;
+    for (let k = 0; k < count; k++) {
+        const base = bucketOfEntry[k] * stride;
+        const at = (records[base + recordStart] + records[base + recordLength]++) * entryWords;
+        target[at] = entries[k * entryWords];
+        target[at + 1] = entries[k * entryWords + 1];
+        target[at + 2] = entries[k * entryWords + 2];
+        table.bucketOf[entries[k * entryWords]] = bucketOfEntry[k];
+    }
+};
+/** Starts keeping, by bucket, the newest tick a watched component may have changed in a row there, at `tick`. */
+export const watchHashComponent = (table, component, tick) => {
+    if (table.watched.has(component))
+        return;
+    table.watched.set(component, allocateArray(table.memory, Float64Array, table.ticks.length).fill(tick));
+};
+/** Stops keeping a watched component's ticks. */
+export const unwatchHashComponent = (table, component) => {
+    const ticks = table.watched.get(component);
+    if (ticks === undefined)
+        return;
+    freeArray(table.memory, ticks);
+    table.watched.delete(component);
+};
+//# sourceMappingURL=index-hash.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index-hash.js","sourceRoot":"","sources":["../../../src/implementation/world/index-hash.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAGvD,8EAA8E;AAC9E,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAAC;AAE5B,qHAAqH;AACrH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAAC;AAC5B,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAC;AAC7B,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAC;AAC9B,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC;AAChC,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,CAAC;AAE3B,iCAAiC;AACjC,MAAM,aAAa,GAAG,UAAU,CAAC;AAwCjC,MAAM,YAAY,GAAG,EAAE,CAAC;AAExB,8EAA8E;AAC9E,MAAM,cAAc,GAAG,CAAC,CAAC;AAEzB,oDAAoD;AACpD,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,KAAa,EAAE,OAAe,EAAW,EAAE,CAAC,cAAc,GAAG,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC;AAE5G,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,MAAc,EAAE,KAAa,EAAa,EAAE,CAAC,CAAC;IAC1E,MAAM;IACN,KAAK;IACL,MAAM,EAAE,SAAS,GAAG,KAAK;IACzB,KAAK,EAAE,aAAa,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACnE,OAAO,EAAE,aAAa,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,GAAG,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC;IACpE,KAAK,EAAE,aAAa,CAAC,MAAM,EAAE,YAAY,EAAE,CAAC,CAAC;IAC7C,KAAK,EAAE,CAAC;IACR,KAAK,EAAE,EAAE;IACT,KAAK,EAAE,CAAC;IACR,OAAO,EAAE,CAAC;IACV,OAAO,EAAE,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,GAAG,UAAU,CAAC;IAC3D,IAAI,EAAE,CAAC;IACP,OAAO,EAAE,CAAC;IACV,QAAQ,EAAE,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxD,IAAI,EAAE,CAAC;IACP,OAAO,EAAE,IAAI,GAAG,EAAE;CACrB,CAAC,CAAC;AAEH,6DAA6D;AAC7D,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,KAAgB,EAAQ,EAAE;IACvD,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;IACzB,KAAK,MAAM,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,QAAQ,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;QAAE,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAClJ,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;AAC1B,CAAC,CAAC;AAEF,mIAAmI;AACnI,MAAM,MAAM,GAAG,CAAoD,MAAc,EAAE,KAAQ,EAAE,WAAwH,EAAE,MAAc,EAAE,IAAY,EAAE,IAAY,EAAK,EAAE;IACpQ,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;IACzD,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IACnC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACvB,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACzB,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF,8DAA8D;AAC9D,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAgB,EAAE,MAAc,EAAQ,EAAE;IACpE,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,IAAI,MAAM;QAAE,OAAO;IAC5C,KAAK,CAAC,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;AAC9I,CAAC,CAAC;AAEF,yDAAyD;AACzD,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAgB,EAAE,KAAa,EAAQ,EAAE;IAClE,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;IACpC,IAAI,QAAQ,IAAI,KAAK;QAAE,OAAO;IAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC;IAC7C,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;IACjC,KAAK,CAAC,OAAO,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,EAAE,QAAQ,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC;IAClG,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,EAAE,YAAY,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;IAC7E,KAAK,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO;QAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;AAC3I,CAAC,CAAC;AAEF,6DAA6D;AAC7D,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,KAAe,EAAE,MAAc,EAAU,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC;AACvH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,KAAe,EAAE,MAAc,EAAU,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC;AACzH,MAAM,UAAU,GAAG,CAAC,KAAgB,EAAE,MAAc,EAAU,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,cAAc,CAAC,CAAC;AACvH,MAAM,OAAO,GAAG,CAAC,KAAgB,EAAE,MAAc,EAAW,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,aAAa,CAAC;AAE3G,uEAAuE;AACvE,MAAM,OAAO,GAAG,CAAC,KAAe,EAAE,MAAc,EAAE,GAAgB,EAAE,EAAU,EAAW,EAAE;IACvF,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;IACjC,MAAM,IAAI,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;QAAE,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IACpF,OAAO,IAAI,CAAC;AAChB,CAAC,CAAC;AAEF,kEAAkE;AAClE,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAe,EAAE,GAAgB,EAAE,EAAU,EAAE,IAAY,EAAU,EAAE;IAC9F,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;IACxB,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACrC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAI,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;QACtD,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;QAClC,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC;QAC3B,IAAI,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YAAE,OAAO,KAAK,GAAG,CAAC,CAAC;IACzF,CAAC;AACL,CAAC,CAAC;AAEF,2EAA2E;AAC3E,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,KAAkB,EAAE,MAAc,EAAE,IAAY,EAAQ,EAAE;IAC5E,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACrC,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;IACvB,OAAO,KAAK,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC;QAAE,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;IAC3D,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;IACvB,KAAK,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;AACrC,CAAC,CAAC;AAEF,qDAAqD;AACrD,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,KAAgB,EAAE,OAAe,EAAQ,EAAE;IAC9D,IAAI,QAAQ,GAAG,YAAY,CAAC;IAC5B,OAAO,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC;QAAE,QAAQ,IAAI,CAAC,CAAC;IACpD,IAAI,CAAC,GAAG,QAAQ,KAAK,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACtC,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QACrC,KAAK,CAAC,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC;IACzE,CAAC;IACD,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACxB,CAAC,CAAC;AAEF,wDAAwD;AACxD,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,KAAgB,EAAQ,EAAE;IAC/C,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;IAClC,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE;QAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC;YAAE,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,GAAG,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC;AACxJ,CAAC,CAAC;AAEF,mFAAmF;AACnF,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,KAAgB,EAAE,GAAgB,EAAE,EAAU,EAAE,IAAY,EAAE,IAAY,EAAU,EAAE;IAC5G,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;IAC/C,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;IAC9C,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC;QAChD,MAAM,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;QACxB,QAAQ,CAAC,KAAK,CAAC,CAAC;IACpB,CAAC;IACD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;IAClD,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IACjC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;IACzC,MAAM,IAAI,GAAG,MAAM,GAAG,MAAM,CAAC;IAC7B,OAAO,CAAC,IAAI,GAAG,UAAU,CAAC,GAAG,IAAI,CAAC;IAClC,OAAO,CAAC,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;IAChC,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IACjC,OAAO,CAAC,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;QAAE,OAAO,CAAC,IAAI,GAAG,SAAS,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAC5E,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAC3B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE;QAAE,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IACjE,KAAK,CAAC,KAAK,EAAE,CAAC;IACd,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IACjC,OAAO,MAAM,CAAC;AAClB,CAAC,CAAC;AAEF,6EAA6E;AAC7E,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,MAAc,EAAU,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC;AAEzF,+GAA+G;AAC/G,MAAM,eAAe,GAAG,CAAC,KAAgB,EAAE,QAAgB,EAAU,EAAE;IACnE,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC;IACzB,MAAM,MAAM,GAAG,CAAC,KAAK,GAAG,QAAQ,CAAC,GAAG,UAAU,CAAC;IAC/C,IAAI,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;QAChC,KAAK,CAAC,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,GAAG,UAAU,EAAE,CAAC,CAAC,CAAC;IAC5I,CAAC;IACD,KAAK,CAAC,IAAI,IAAI,QAAQ,CAAC;IACvB,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF,iHAAiH;AACjH,MAAM,OAAO,GAAG,CAAC,KAAgB,EAAE,MAAc,EAAE,MAAc,EAAQ,EAAE;IACvE,MAAM,IAAI,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IACnC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,GAAG,cAAc,CAAC,IAAI,MAAM;QAAE,OAAO;IAC3D,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IACrC,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC/C,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IACnC,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,GAAG,WAAW,CAAC,GAAG,UAAU,CAAC;IACtD,OAAO,CAAC,UAAU,CAAC,KAAK,GAAG,UAAU,EAAE,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC,GAAG,UAAU,CAAC,CAAC;IAC/F,KAAK,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,GAAG,cAAc,CAAC,CAAC;IAChD,OAAO,CAAC,IAAI,GAAG,WAAW,CAAC,GAAG,KAAK,CAAC;IACpC,OAAO,CAAC,IAAI,GAAG,cAAc,CAAC,GAAG,QAAQ,CAAC;AAC9C,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,IAAI,GAAG,CAAC,OAAmB,EAAE,EAAU,EAAE,IAAY,EAAE,KAAa,EAAQ,EAAE;IAChF,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;QACb,OAAO,CAAC,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC;QAC3C,OAAO;IACX,CAAC;IACD,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAChC,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YACpC,OAAO,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5C,OAAO,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC;IACL,CAAC;SACI,CAAC;QACF,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACrC,OAAO,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5C,OAAO,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5C,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QACxC,CAAC;IACL,CAAC;AACL,CAAC,CAAC;AAEF,0HAA0H;AAC1H,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAgB,EAAE,MAAc,EAAE,KAAa,EAAU,EAAE;IAClF,MAAM,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IAC1B,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACpC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACnC,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;QAChB,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC;QACjD,IAAI,EAAE,GAAG,KAAK;YAAE,GAAG,GAAG,MAAM,GAAG,CAAC,CAAC;aAC5B,IAAI,EAAE,GAAG,KAAK;YAAE,IAAI,GAAG,MAAM,CAAC;;YAC9B,OAAO,MAAM,CAAC;IACvB,CAAC;IACD,OAAO,CAAC,GAAG,CAAC;AAChB,CAAC,CAAC;AAEF,iGAAiG;AACjG,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,KAAgB,EAAE,MAAc,EAAE,KAAa,EAAE,SAAiB,EAAE,GAAW,EAAQ,EAAE;IAC9G,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAClD,IAAI,QAAQ,GAAG,CAAC;QAAE,OAAO;IACzB,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,UAAU,CAAC;IAC5D,KAAK,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;IAClC,KAAK,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;AAChC,CAAC,CAAC;AAEF,yDAAyD;AACzD,MAAM,UAAU,GAAG,CAAC,KAAgB,EAAE,MAAc,EAAE,KAAa,EAAQ,EAAE;IACzE,IAAI,MAAM,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC;QAAE,KAAK,CAAC,KAAK,EAAE,CAAC;SACxC,IAAI,MAAM,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC;QAAE,KAAK,CAAC,KAAK,EAAE,CAAC;AACtD,CAAC,CAAC;AAEF,+DAA+D;AAC/D,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAgB,EAAE,MAAc,EAAE,KAAa,EAAE,IAAY,EAAQ,EAAE;IAC/F,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAClD,IAAI,QAAQ,GAAG,CAAC;QAAE,OAAO;IACzB,MAAM,MAAM,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IACrC,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC;IACpD,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,UAAU,CAAC;IAC9D,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,GAAG,QAAQ,GAAG,UAAU,EAAE,IAAI,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,UAAU,EAAE,CAAC,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;IAC5H,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,YAAY,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;IAClD,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAC3B,KAAK,CAAC,IAAI,EAAE,CAAC;IACb,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;AAC1C,CAAC,CAAC;AAEF,yGAAyG;AACzG,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAgB,EAAE,MAAc,EAAE,KAAa,EAAE,SAAiB,EAAE,GAAW,EAAE,IAAY,EAAQ,EAAE;IAC/H,MAAM,MAAM,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IACrC,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC;IACpD,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC/C,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;IAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,UAAU,CAAC;IAC9D,MAAM,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IAC1B,IAAI,CAAC,OAAO,EAAE,IAAI,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,UAAU,EAAE,IAAI,GAAG,QAAQ,GAAG,UAAU,EAAE,CAAC,MAAM,GAAG,QAAQ,CAAC,GAAG,UAAU,CAAC,CAAC;IAClH,MAAM,EAAE,GAAG,IAAI,GAAG,QAAQ,GAAG,UAAU,CAAC;IACxC,OAAO,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;IACpB,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;IAC5B,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;IACtB,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,YAAY,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;IAClD,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAC3B,KAAK,CAAC,IAAI,EAAE,CAAC;IACb,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;AAC1C,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAgB,EAAE,MAAc,EAAE,OAAmB,EAAE,YAAoB,EAAE,KAAiB,EAAE,UAAkB,EAAE,OAAmB,EAAE,IAAY,EAAQ,EAAE;IACxL,MAAM,MAAM,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IACrC,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,MAAM,GAAG,YAAY,GAAG,UAAU,CAAC;IAClD,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,UAAU,CAAC;IAC9D,oGAAoG;IACpG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC;IACtE,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC;IAC7B,IAAI,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,UAAU,CAAC;IAC1D,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;QACtC,OAAO,CAAC,GAAG,YAAY,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK;YAAE,CAAC,EAAE,CAAC;QACnD,OAAO,CAAC,GAAG,UAAU,IAAI,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,KAAK,EAAE,CAAC;YACrD,MAAM,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;YACrC,MAAM,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC;YACzC,CAAC,EAAE,CAAC;QACR,CAAC;QACD,IAAI,CAAC,GAAG,YAAY,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;YAC3C,CAAC,EAAE,CAAC;YACJ,SAAS;QACb,CAAC;QACD,MAAM,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC;QACrB,MAAM,CAAC,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;QACrC,MAAM,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC;IAC7C,CAAC;IACD,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,YAAY,CAAC,GAAG,MAAM,CAAC;IAC9C,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAC3B,KAAK,CAAC,IAAI,IAAI,MAAM,GAAG,MAAM,CAAC;IAC9B,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AACtC,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAgB,EAAE,IAAY,EAAQ,EAAE;IAClE,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;IAC5D,IAAI,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;QACnC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;QAClC,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC;YAClD,MAAM,IAAI,GAAG,MAAM,GAAG,MAAM,CAAC;YAC7B,IAAI,OAAO,CAAC,IAAI,GAAG,cAAc,CAAC,KAAK,aAAa,IAAI,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC;gBAAE,SAAS;YACnG,KAAK,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,GAAG,cAAc,CAAC,CAAC;YAChD,OAAO,CAAC,IAAI,GAAG,cAAc,CAAC,GAAG,aAAa,CAAC;YAC/C,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7B,CAAC;QACD,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;QAChB,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC;QACrB,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACpB,QAAQ,CAAC,KAAK,CAAC,CAAC;IACpB,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC;QAAE,OAAO,CAAC,KAAK,CAAC,CAAC;AACnF,CAAC,CAAC;AAEF,wFAAwF;AACxF,MAAM,OAAO,GAAG,CAAC,KAAgB,EAAQ,EAAE;IACvC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;IAClC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE;QAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC;YAAE,KAAK,IAAI,WAAW,CAAC,OAAO,CAAC,MAAM,GAAG,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC;IAChJ,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC;IAC1B,MAAM,OAAO,GAAG,aAAa,CAAC,KAAK,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,GAAG,UAAU,CAAC,CAAC;IAC1F,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC;QAClD,IAAI,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC;YAAE,SAAS;QACrC,MAAM,IAAI,GAAG,MAAM,GAAG,MAAM,CAAC;QAC7B,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC,CAAC;QAC5C,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,GAAG,WAAW,CAAC,GAAG,UAAU,CAAC;QACtD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,GAAG,UAAU,CAAC,EAAE,IAAI,GAAG,UAAU,CAAC,CAAC;QAC/E,OAAO,CAAC,IAAI,GAAG,WAAW,CAAC,GAAG,IAAI,CAAC;QACnC,OAAO,CAAC,IAAI,GAAG,cAAc,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;QACrD,IAAI,IAAI,OAAO,CAAC,IAAI,GAAG,cAAc,CAAC,CAAC;IAC3C,CAAC;IACD,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC7B,KAAK,CAAC,OAAO,GAAG,OAAO,CAAC;IACxB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;IAClB,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC;AACtB,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAgB,EAAE,KAAa,EAAE,OAAmB,EAAE,IAAiB,EAAE,MAAmB,EAAE,aAAyB,EAAE,IAAY,EAAE,WAAmB,EAAQ,EAAE;IAC9L,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;IAChC,aAAa,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IAClC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACxB,mHAAmH;IACnH,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IAC/F,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;IAChB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACvB,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;IAChB,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC;IACrB,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC;IACnB,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IACxB,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC;QACtD,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACb,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;gBACvD,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;gBACrC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;YACD,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACvB,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,IAAI,GAAG,MAAM,GAAG,MAAM,CAAC;YAC7B,KAAK,CAAC,OAAO,CAAC,IAAI,GAAG,UAAU,CAAC,GAAG,IAAI,CAAC;YACxC,KAAK,CAAC,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;YACvC,KAAK,CAAC,OAAO,CAAC,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;gBAAE,KAAK,CAAC,OAAO,CAAC,IAAI,GAAG,SAAS,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;YAC1F,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACrC,CAAC;QACD,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,MAAM,GAAG,YAAY,CAAC,EAAE,CAAC;QAChD,aAAa,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;IAC9B,CAAC;IACD,MAAM,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IAC1B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,MAAM,GAAG,MAAM,CAAC;QAC7B,OAAO,CAAC,IAAI,GAAG,WAAW,CAAC,GAAG,IAAI,CAAC;QACnC,OAAO,CAAC,IAAI,GAAG,cAAc,CAAC,GAAG,WAAW,CAAC,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC;QAC3E,IAAI,IAAI,OAAO,CAAC,IAAI,GAAG,cAAc,CAAC,CAAC;QACvC,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;QACjC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;QAC3B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE;YAAE,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IACrE,CAAC;IACD,IAAI,IAAI,GAAG,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;QAC3C,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QACvC,KAAK,CAAC,OAAO,GAAG,aAAa,CAAC,KAAK,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC;IAC7F,CAAC;IACD,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;IAClB,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC;IAClB,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QACvC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,IAAI,GAAG,WAAW,CAAC,GAAG,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC;QACvF,MAAM,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;QACrC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC;QAC7C,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;AACL,CAAC,CAAC;AAEF,iHAAiH;AACjH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,KAAgB,EAAE,SAAiB,EAAE,IAAY,EAAQ,EAAE;IAC1F,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC;QAAE,OAAO;IACzC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,aAAa,CAAC,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AAC3G,CAAC,CAAC;AAEF,iDAAiD;AACjD,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,KAAgB,EAAE,SAAiB,EAAQ,EAAE;IAC9E,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC3C,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO;IAChC,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC/B,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;AACpC,CAAC,CAAC"}

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

@@ -0,0 +1,75 @@
+import { type Layout, type Leaf, type Scalar } from '../../interface/registry/layout.js';
+import type { Storage } from './archetype.js';
+/**
+ * How an index encodes its key into 32-bit words that compare and hash as values do: each struct leaf as one word, two
+ * for an f64, in an order-preserving form, so unsigned lexicographic word order is key order; an object part, or a
+ * string as the world's thread holds it, as the id its value is interned under; a constant part as nothing.
+ */
+export type KeyPart = {
+    readonly kind: "leaves";
+    readonly leaves: readonly Leaf[];
+    readonly words: number;
+    readonly first: number;
+} | {
+    readonly kind: "object";
+    readonly first: number;
+    readonly interned: Interned;
+} | {
+    readonly kind: "constant";
+    readonly first: number;
+};
+/** Values of one object part by the id they're interned under, with how many entries hold each. */
+export type Interned = {
+    readonly ids: Map<unknown, number>;
+    readonly values: unknown[];
+    readonly counts: number[];
+    readonly free: number[];
+};
+/** Each part of a key, by its layout, with the word it starts at; and the key's words in all. */
+export declare const keyPartsOf: (layouts: readonly Layout[]) => {
+    readonly parts: readonly KeyPart[];
+    readonly words: number;
+};
+/** An index's first key part whose keys only the world's thread keeps, by their values: an object or a string. */
+export declare const unsharedKeyOf: (key: readonly symbol[]) => {
+    readonly key: symbol;
+    readonly what: string;
+} | undefined;
+/** Words a part takes. */
+export declare const partWords: (part: KeyPart) => number;
+/** An f32's bits in order-preserving form: -0 as +0, every NaN last. */
+export declare const orderF32: (bits: number) => number;
+/** An f64's high and low words in order-preserving form, into `out[at]` and `out[at + 1]`. */
+export declare const orderF64: (high: number, low: number, out: Uint32Array, at: number) => void;
+/**
+ * Writes a row's key part, read from its storage, into `out` from `at`: leaves straight from the column's words, an
+ * object part as its value's interned id, interning it with `intern` when given, or the id of none when it isn't.
+ */
+export declare const encodeStored: (part: KeyPart, storage: Storage, row: number, out: Uint32Array, at: number, intern: boolean) => void;
+/** A leaf's value converted to its stored type, as a write stores it, encoded into `out` from `at`; returns the next word. */
+export declare const encodeScalar: (scalar: Scalar, value: unknown, out: Uint32Array, at: number) => number;
+/**
+ * Writes a key part given as a value, as a lookup's argument gives it, into `out` from `at`: converted to its leaves'
+ * stored types, and an object part as its value's interned id, or `missing` for a value nothing holds.
+ */
+export declare const encodeValue: (part: KeyPart, value: unknown, out: Uint32Array, at: number) => void;
+/** The id of an object part's value nothing holds: no entry has it. */
+export declare const missing = 4294967295;
+/** One fewer entry holds the value interned under `id`; with none, it's forgotten. */
+export declare const release: (part: KeyPart, id: number) => void;
+/** Interns an id once more, for an entry copied with its key. */
+export declare const retain: (part: KeyPart, id: number) => void;
+/** A multiply-xorshift hash of `count` words from `at`, the same on every thread. */
+export declare const hashWords: (words: Uint32Array, at: number, count: number) => number;
+/** Code points of two strings compared, as `@adobe/data` orders strings, never by locale. */
+export declare const compareStrings: (a: string, b: string) => number;
+/** Two values of an object part in order: strings by code point, anything else as equal. */
+export declare const compareObjects: (a: unknown, b: unknown) => number;
+/**
+ * Whether a world keeps an index as a sorted table: a sorted one, and one without a key, whose entities a sorted table
+ * keeps in entity order, an entity entering or leaving moving at most a block's entries.
+ */
+export declare const keptSorted: (declaration: {
+    readonly key: readonly unknown[];
+    readonly sorted?: boolean;
+}) => boolean;