@adobe/ecs 0.0.0-stage → 0.1.0

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

@@ -0,0 +1,174 @@
+import { allocateArray, freeArray } from './arrays.js';
+import { blockAt, blockBase, firstPosition } from './index-sorted.js';
+import { forEachPassingRange } from './ranges.js';
+// A system's rows in a sorted index's order (`order`): runs of consecutive entries of one matched archetype, in key
+// order and then entity order, each a list of rows, as `up`'s runs are.
+/** Below this share of the index passing a run's change filters, passing rows are found by their ticks and sorted by position; above it the index is scanned. */
+const sparseShare = 1 / 8;
+export const createOrdered = (memory) => {
+    let rows = new Int32Array(0);
+    /** By archetype id: its position in the matches, or -1. */
+    let owners = new Int32Array(0);
+    let matched = [];
+    let ownersFor = 0;
+    /** Positions in the index of the rows that pass, for sorting. */
+    let positions = new Int32Array(0);
+    /** Runs made so far, reused; and those of the last call. */
+    const made = [];
+    const runs = [];
+    let count = 0;
+    let written = 0;
+    /** Per owner: its filters and since for this call. */
+    const filters = [];
+    const sinces = [];
+    const ownersOf = (matches) => {
+        if (matched === matches && ownersFor === matches.length)
+            return owners;
+        let length = 0;
+        for (const archetype of matches)
+            length = Math.max(length, archetype.id + 1);
+        if (owners.length < length)
+            owners = new Int32Array(Math.max(length, 2 * owners.length));
+        owners.fill(-1);
+        matches.forEach((archetype, owner) => { owners[archetype.id] = owner; });
+        matched = matches;
+        ownersFor = matches.length;
+        return owners;
+    };
+    const fitRows = (length) => {
+        if (rows.length >= length)
+            return;
+        if (rows.length > 0)
+            freeArray(memory, rows);
+        rows = allocateArray(memory, Int32Array, Math.max(length, 2 * rows.length, 64));
+    };
+    /** Appends a row of `owner`, starting a run when the previous row's owner differs. */
+    const append = (owner, row) => {
+        if (count === 0 || made[count - 1].owner !== owner) {
+            const run = made[count] ??= { owner, parent: -1, rows, parents: rows, start: 0, end: 0 };
+            run.owner = owner;
+            run.rows = run.parents = rows;
+            run.start = run.end = written;
+            count++;
+        }
+        rows[written++] = row;
+        made[count - 1].end = written;
+    };
+    /** Whether a row of `owner` passes its archetype's filters. */
+    const passes = (owner, row) => {
+        const since = sinces[owner];
+        if (since < 0)
+            return true;
+        const found = filters[owner];
+        if (found.length === 0)
+            return true;
+        for (let k = 0; k < found.length; k++)
+            if (found[k].ticks[row] > since)
+                return true;
+        return false;
+    };
+    /** Every entry of the index, in order, whose archetype is matched and, when `filtered`, whose row passes. */
+    const scan = (sorted, slots, filtered) => {
+        const { order, lengths, entries, stride, words, blocks } = sorted;
+        for (let k = 0; k < blocks; k++) {
+            const block = order[k];
+            const base = blockBase(sorted, block);
+            for (let j = 0, length = lengths[block]; j < length; j++) {
+                const at = base + j * stride + words;
+                const archetype = entries[at + 1];
+                const owner = archetype < slots.length ? slots[archetype] : -1;
+                if (owner < 0)
+                    continue;
+                const row = entries[at + 2];
+                if (filtered && !passes(owner, row))
+                    continue;
+                append(owner, row);
+            }
+        }
+    };
+    /** The rows that pass, found by their ticks, sorted by their positions in the index; false when more pass than a scan costs. */
+    const gather = (sorted, matches, slots) => {
+        const most = Math.max(64, sorted.size * sparseShare);
+        let passed = 0;
+        if (positions.length < most)
+            positions = new Int32Array(Math.ceil(most));
+        let fits = true;
+        const { blockOf, positions: placed, entries, stride, words, lengths } = sorted;
+        matches.forEach((archetype, owner) => {
+            if (!fits || archetype.count === 0)
+                return;
+            forEachPassingRange(filters[owner], sinces[owner], 0, archetype.count, (start, end) => {
+                for (let row = start; row < end && fits; row++) {
+                    const entity = archetype.entities[row] >>> 0;
+                    const block = entity < blockOf.length ? blockOf[entity] : -1;
+                    if (block < 0)
+                        continue;
+                    if (passed >= most) {
+                        fits = false;
+                        return;
+                    }
+                    // Its offset in its block, by its entity index.
+                    const base = blockBase(sorted, block);
+                    let offset = 0;
+                    while (offset < lengths[block] && entries[base + offset * stride + words] !== entity)
+                        offset++;
+                    positions[passed++] = firstPosition(sorted, placed[block]) + offset;
+                }
+            });
+        });
+        if (!fits)
+            return false;
+        const sortedPositions = positions.subarray(0, passed).sort();
+        let k = -1;
+        let first = 0;
+        let length = 0;
+        let base = 0;
+        for (let n = 0; n < passed; n++) {
+            const position = sortedPositions[n];
+            if (k < 0 || position >= first + length) {
+                k = blockAt(sorted, position);
+                first = firstPosition(sorted, k);
+                length = lengths[sorted.order[k]];
+                base = blockBase(sorted, sorted.order[k]);
+            }
+            const at = base + (position - first) * stride + words;
+            const owner = slots[entries[at + 1]];
+            if (owner >= 0)
+                append(owner, entries[at + 2]);
+        }
+        return true;
+    };
+    return {
+        runs: (sorted, matches, passing) => {
+            count = 0;
+            written = 0;
+            const slots = ownersOf(matches);
+            fitRows(sorted.size);
+            let filtered = false;
+            if (passing !== null) {
+                for (let owner = 0; owner < matches.length; owner++) {
+                    filters[owner] = passing.filters(matches[owner]);
+                    sinces[owner] = passing.since(matches[owner]);
+                    if (sinces[owner] >= 0 && filters[owner].length > 0)
+                        filtered = true;
+                }
+            }
+            if (!filtered || !gather(sorted, matches, slots)) {
+                count = 0;
+                written = 0;
+                scan(sorted, slots, filtered);
+            }
+            for (let k = 0; k < count; k++)
+                runs[k] = made[k];
+            runs.length = count;
+            return runs;
+        },
+        owners: ownersOf,
+        release: () => {
+            if (rows.length > 0)
+                freeArray(memory, rows);
+            rows = new Int32Array(0);
+        },
+    };
+};
+//# sourceMappingURL=index-order.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index-order.js","sourceRoot":"","sources":["../../../src/implementation/world/index-order.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACvD,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAoB,MAAM,mBAAmB,CAAC;AAExF,OAAO,EAAE,mBAAmB,EAAe,MAAM,aAAa,CAAC;AAG/D,oHAAoH;AACpH,wEAAwE;AAExE,iKAAiK;AACjK,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC;AAkB1B,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,MAAc,EAAW,EAAE;IACrD,IAAI,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC7B,2DAA2D;IAC3D,IAAI,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,OAAO,GAAyB,EAAE,CAAC;IACvC,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,iEAAiE;IACjE,IAAI,SAAS,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAClC,4DAA4D;IAC5D,MAAM,IAAI,GAAiB,EAAE,CAAC;IAC9B,MAAM,IAAI,GAAiB,EAAE,CAAC;IAC9B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,sDAAsD;IACtD,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,MAAM,QAAQ,GAAG,CAAC,OAA6B,EAAc,EAAE;QAC3D,IAAI,OAAO,KAAK,OAAO,IAAI,SAAS,KAAK,OAAO,CAAC,MAAM;YAAE,OAAO,MAAM,CAAC;QACvE,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,SAAS,IAAI,OAAO;YAAE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7E,IAAI,MAAM,CAAC,MAAM,GAAG,MAAM;YAAE,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QACzF,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,OAAO,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,GAAG,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACzE,OAAO,GAAG,OAAO,CAAC;QAClB,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC;QAC3B,OAAO,MAAM,CAAC;IAClB,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,CAAC,MAAc,EAAQ,EAAE;QACrC,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM;YAAE,OAAO;QAClC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC7C,IAAI,GAAG,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC;IACpF,CAAC,CAAC;IAEF,sFAAsF;IACtF,MAAM,MAAM,GAAG,CAAC,KAAa,EAAE,GAAW,EAAQ,EAAE;QAChD,IAAI,KAAK,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;YACjD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YACzF,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;YAClB,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC;YAC9B,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG,OAAO,CAAC;YAC9B,KAAK,EAAE,CAAC;QACZ,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,GAAG,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,OAAO,CAAC;IAClC,CAAC,CAAC;IAEF,+DAA+D;IAC/D,MAAM,MAAM,GAAG,CAAC,KAAa,EAAE,GAAW,EAAW,EAAE;QACnD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAI,KAAK,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QAC3B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK;gBAAE,OAAO,IAAI,CAAC;QACpF,OAAO,KAAK,CAAC;IACjB,CAAC,CAAC;IAEF,6GAA6G;IAC7G,MAAM,IAAI,GAAG,CAAC,MAAmB,EAAE,KAAiB,EAAE,QAAiB,EAAQ,EAAE;QAC7E,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;QAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvD,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,GAAG,MAAM,GAAG,KAAK,CAAC;gBACrC,MAAM,SAAS,GAAG,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBAClC,MAAM,KAAK,GAAG,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/D,IAAI,KAAK,GAAG,CAAC;oBAAE,SAAS;gBACxB,MAAM,GAAG,GAAG,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBAC5B,IAAI,QAAQ,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC;oBAAE,SAAS;gBAC9C,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACvB,CAAC;QACL,CAAC;IACL,CAAC,CAAC;IAEF,gIAAgI;IAChI,MAAM,MAAM,GAAG,CAAC,MAAmB,EAAE,OAA6B,EAAE,KAAiB,EAAW,EAAE;QAC9F,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,GAAG,WAAW,CAAC,CAAC;QACrD,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,SAAS,CAAC,MAAM,GAAG,IAAI;YAAE,SAAS,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACzE,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC;QAC/E,OAAO,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE;YACjC,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,KAAK,KAAK,CAAC;gBAAE,OAAO;YAC3C,mBAAmB,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;gBAClF,KAAK,IAAI,GAAG,GAAG,KAAK,EAAE,GAAG,GAAG,GAAG,IAAI,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBAC7C,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBAC7C,MAAM,KAAK,GAAG,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC7D,IAAI,KAAK,GAAG,CAAC;wBAAE,SAAS;oBACxB,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;wBACjB,IAAI,GAAG,KAAK,CAAC;wBACb,OAAO;oBACX,CAAC;oBACD,gDAAgD;oBAChD,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;oBACtC,IAAI,MAAM,GAAG,CAAC,CAAC;oBACf,OAAO,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,IAAI,GAAG,MAAM,GAAG,MAAM,GAAG,KAAK,CAAC,KAAK,MAAM;wBAAE,MAAM,EAAE,CAAC;oBAC/F,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC;gBACxE,CAAC;YACL,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QACxB,MAAM,eAAe,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;QAC7D,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACX,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,CAAC,GAAG,CAAC,IAAI,QAAQ,IAAI,KAAK,GAAG,MAAM,EAAE,CAAC;gBACtC,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;gBAC9B,KAAK,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBACjC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClC,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9C,CAAC;YACD,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,MAAM,GAAG,KAAK,CAAC;YACtD,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,KAAK,IAAI,CAAC;gBAAE,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC;IAEF,OAAO;QACH,IAAI,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE;YAC/B,KAAK,GAAG,CAAC,CAAC;YACV,OAAO,GAAG,CAAC,CAAC;YACZ,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;YAChC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,QAAQ,GAAG,KAAK,CAAC;YACrB,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;gBACnB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;oBAClD,OAAO,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;oBACjD,MAAM,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC9C,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC;wBAAE,QAAQ,GAAG,IAAI,CAAC;gBACzE,CAAC;YACL,CAAC;YACD,IAAI,CAAC,QAAQ,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC/C,KAAK,GAAG,CAAC,CAAC;gBACV,OAAO,GAAG,CAAC,CAAC;gBACZ,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;YAClC,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;gBAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAClD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;YACpB,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,MAAM,EAAE,QAAQ;QAChB,OAAO,EAAE,GAAG,EAAE;YACV,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC7C,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC;KACJ,CAAC;AACN,CAAC,CAAC"}

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

@@ -0,0 +1,101 @@
+import type { TypedArray, View } from '../../interface/registry/layout.js';
+import type { WasmProbe } from './wasm.js';
+/**
+ * Where a lookup through an index finds its index's arrays: each an array and the element its first is at, so the
+ * world's thread reads the index's own arrays and other threads a view of the whole memory; and its counts and ticks.
+ * The fields follow the parameters WASM kernels take (`wasm.ts`, `indexParameterCount`).
+ */
+export type IndexSource = {
+    kind: "hash" | "sorted";
+    /** A hash index's slots, two words each, and their mask; its buckets' records; its entries; its buckets' ticks. */
+    slots: Uint32Array;
+    slotsBase: number;
+    mask: number;
+    records: Uint32Array;
+    recordsBase: number;
+    hashEntries: Int32Array;
+    hashEntriesBase: number;
+    ticks: Float64Array;
+    ticksBase: number;
+    /** A sorted index's fences, blocks in order, lengths, entries, Fenwick tree, entry count, tick tree and its leaves. */
+    fences: Uint32Array;
+    fencesBase: number;
+    blocks: number;
+    order: Int32Array;
+    orderBase: number;
+    lengths: Int32Array;
+    lengthsBase: number;
+    sortedEntries: Uint32Array;
+    sortedEntriesBase: number;
+    counts: Int32Array;
+    countsBase: number;
+    size: number;
+    tree: Float64Array;
+    treeBase: number;
+    leaves: number;
+    /** When a bucket or the last entry was dropped, the system's `lastRun`, and each watched component's ticks or tree. */
+    cleared: number;
+    since: number;
+    watched: Float64Array[];
+    watchedBases: number[];
+};
+export declare const createIndexSource: (kind: "hash" | "sorted") => IndexSource;
+/**
+ * Points a source at an index through the whole memory's views, from its parameters as a WASM kernel takes them:
+ * addresses in bytes, counts and ticks.
+ */
+export declare const sourceFromParameters: (source: IndexSource, memory: {
+    readonly u32: Uint32Array;
+    readonly i32: Int32Array;
+    readonly f64: Float64Array;
+}, parameters: readonly number[], at: number, watched: number) => void;
+/** A leaf bodies read of a lookup's rows: its component, the view it's stored through, its stride and offset in elements. */
+export type RowLeaf = {
+    readonly component: number;
+    readonly view: View;
+    readonly unitStride: number;
+    readonly unitOffset: number;
+    readonly boolean: boolean;
+};
+/** What a JS kernel's lookup through an index needs besides its source: its key's words, entry stride, probes and row leaves. */
+export type IndexReaderSetup = {
+    readonly kind: "hash" | "sorted";
+    readonly words: number;
+    readonly stride: number;
+    /** By probe of the kernel, its plan, or null for a probe of another lookup. */
+    readonly probes: readonly (WasmProbe | null)[];
+    readonly rowLeaves: readonly (RowLeaf | null)[];
+};
+/** An archetype as a reader reads its rows: its version, its entities, and a column's view, by component and view. */
+export type ReaderArchetype = {
+    readonly version: number;
+    readonly entities: Float64Array;
+    readonly column: (component: number, view: View) => TypedArray | undefined;
+};
+/**
+ * A handle a kernel's site holds, which its reader fills (`compile-kernel.ts`): a list's bucket, start and length, or
+ * runs and cursor; a row's archetype, row and whether it was found (`f`).
+ */
+type Handle = {
+    a: number;
+    b: number;
+    c: number;
+    d: number;
+    e: number;
+    f: number;
+    g: number;
+    h: number;
+};
+/** A lookup through an index as a JS kernel reads it: probes, lists' lengths, `changed` and rows, rows' leaves and entities. */
+export type IndexReader = {
+    readonly source: IndexSource;
+    readonly probe: (probe: number, list: Handle, first: Handle, a0?: number, a1?: number, a2?: number, a3?: number, a4?: number, a5?: number, a6?: number, a7?: number, a8?: number, a9?: number, a10?: number, a11?: number, a12?: number, a13?: number, a14?: number, a15?: number) => void;
+    readonly length: (list: Handle) => number;
+    readonly changed: (list: Handle) => boolean;
+    readonly row: (row: Handle, list: Handle, index: number) => void;
+    readonly leaf: (row: Handle, leaf: number) => number | boolean;
+    readonly entity: (row: Handle) => number;
+};
+/** A reader over `source`, reading rows through `archetypeAt`. */
+export declare const createIndexReader: (setup: IndexReaderSetup, source: IndexSource, archetypeAt: (id: number) => ReaderArchetype | undefined) => IndexReader;
+export {};

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

@@ -0,0 +1,341 @@
+import { encodeScalar } from './index-keys.js';
+/** Entries a sorted index's block holds at most (`index-sorted.ts`). */
+const blockEntries = 128;
+const none = new Uint32Array(0);
+export const createIndexSource = (kind) => ({
+    kind,
+    slots: none, slotsBase: 0, mask: 0, records: none, recordsBase: 0, hashEntries: new Int32Array(0), hashEntriesBase: 0, ticks: new Float64Array(0), ticksBase: 0,
+    fences: none, fencesBase: 0, blocks: 0, order: new Int32Array(0), orderBase: 0, lengths: new Int32Array(0), lengthsBase: 0,
+    sortedEntries: none, sortedEntriesBase: 0, counts: new Int32Array(0), countsBase: 0, size: 0, tree: new Float64Array(0), treeBase: 0, leaves: 0,
+    cleared: 0, since: -1, watched: [], watchedBases: [],
+});
+/**
+ * Points a source at an index through the whole memory's views, from its parameters as a WASM kernel takes them:
+ * addresses in bytes, counts and ticks.
+ */
+export const sourceFromParameters = (source, memory, parameters, at, watched) => {
+    const { u32, i32, f64 } = memory;
+    if (source.kind === "hash") {
+        source.slots = u32;
+        source.slotsBase = parameters[at] >>> 2;
+        source.mask = parameters[at + 1];
+        source.records = u32;
+        source.recordsBase = parameters[at + 2] >>> 2;
+        source.hashEntries = i32;
+        source.hashEntriesBase = parameters[at + 3] >>> 2;
+        source.ticks = f64;
+        source.ticksBase = parameters[at + 4] >>> 3;
+        source.cleared = parameters[at + 5];
+        source.since = parameters[at + 6];
+        source.watched.length = source.watchedBases.length = 0;
+        for (let k = 0; k < watched; k++) {
+            source.watched.push(f64);
+            source.watchedBases.push(parameters[at + 7 + k] >>> 3);
+        }
+        return;
+    }
+    source.fences = u32;
+    source.fencesBase = parameters[at] >>> 2;
+    source.blocks = parameters[at + 1];
+    source.order = i32;
+    source.orderBase = parameters[at + 2] >>> 2;
+    source.lengths = i32;
+    source.lengthsBase = parameters[at + 3] >>> 2;
+    source.sortedEntries = u32;
+    source.sortedEntriesBase = parameters[at + 4] >>> 2;
+    source.counts = i32;
+    source.countsBase = parameters[at + 5] >>> 2;
+    source.size = parameters[at + 6];
+    source.tree = f64;
+    source.treeBase = parameters[at + 7] >>> 3;
+    source.leaves = parameters[at + 8];
+    source.cleared = parameters[at + 9];
+    source.since = parameters[at + 10];
+    source.watched.length = source.watchedBases.length = 0;
+    for (let k = 0; k < watched; k++) {
+        source.watched.push(f64);
+        source.watchedBases.push(parameters[at + 11 + k] >>> 3);
+    }
+};
+/** A reader over `source`, reading rows through `archetypeAt`. */
+export const createIndexReader = (setup, source, archetypeAt) => {
+    const { words, stride } = setup;
+    const key = new Uint32Array(Math.max(1, words));
+    /** By archetype id: the version its views were found at, and each row leaf's view there. */
+    const views = [];
+    const versions = [];
+    const leafView = (archetype, leaf) => {
+        const found = archetypeAt(archetype);
+        if (found === undefined)
+            return undefined;
+        if (versions[archetype] !== found.version) {
+            versions[archetype] = found.version;
+            views[archetype] = setup.rowLeaves.map(row => row === null ? undefined : found.column(row.component, row.view));
+        }
+        return views[archetype]?.[leaf];
+    };
+    const encode = (values, targets, at) => {
+        let next = at;
+        for (const target of targets)
+            encodeScalar(target.scalar, values[next++], key, target.word);
+        return next;
+    };
+    /** The first position whose key's first `count` words are after the key's, or not before them (`bound` in `index-sorted.ts`). */
+    const bound = (count, after) => {
+        if (count === 0)
+            return after ? source.size : 0;
+        const { fences, fencesBase, order, orderBase, lengths, lengthsBase, sortedEntries, sortedEntriesBase } = source;
+        const passes = (array, base) => {
+            for (let k = 0; k < count; k++) {
+                const a = array[base + k];
+                const b = key[k];
+                if (a !== b)
+                    return a > b;
+            }
+            return !after;
+        };
+        let low = 0;
+        let high = source.blocks;
+        while (low < high) {
+            const middle = (low + high) >>> 1;
+            if (passes(fences, fencesBase + middle * (words + 1)))
+                high = middle;
+            else
+                low = middle + 1;
+        }
+        if (low >= source.blocks)
+            return source.size;
+        const k = low;
+        const block = order[orderBase + k];
+        const base = sortedEntriesBase + block * blockEntries * stride;
+        let first = 0;
+        let last = lengths[lengthsBase + block];
+        while (first < last) {
+            const middle = (first + last) >>> 1;
+            if (passes(sortedEntries, base + middle * stride))
+                last = middle;
+            else
+                first = middle + 1;
+        }
+        return prefix(k) + first;
+    };
+    const prefix = (k) => {
+        const { counts, countsBase } = source;
+        let sum = 0;
+        for (let node = k; node > 0; node -= node & -node)
+            sum += counts[countsBase + node];
+        return sum;
+    };
+    const blockAt = (position) => {
+        const { counts, countsBase, blocks } = source;
+        let k = 0;
+        let remaining = position;
+        let step = 1;
+        while (step * 2 <= blocks)
+            step *= 2;
+        for (; step > 0 && blocks > 0; step >>= 1) {
+            const next = k + step;
+            if (next <= blocks && counts[countsBase + next] <= remaining) {
+                k = next;
+                remaining -= counts[countsBase + next];
+            }
+        }
+        return k;
+    };
+    const treeNewer = (tree, base, low, high) => {
+        // The whole index: the tree's root.
+        if (low <= 0 && high >= source.size)
+            return tree[base + 1] > source.since;
+        const last = source.size - 1;
+        const from = blockAt(Math.min(last, Math.max(low - 1, 0)));
+        const to = blockAt(Math.min(last, high));
+        let maximum = 0;
+        for (let node = from + source.leaves, limit = to + source.leaves + 1; node < limit; node >>= 1, limit >>= 1) {
+            if ((node & 1) === 1)
+                maximum = Math.max(maximum, tree[base + node++]);
+            if ((limit & 1) === 1)
+                maximum = Math.max(maximum, tree[base + --limit]);
+        }
+        return maximum > source.since;
+    };
+    const runChanged = (low, high) => {
+        if (treeNewer(source.tree, source.treeBase, low, high))
+            return true;
+        for (let k = 0; k < source.watched.length; k++)
+            if (treeNewer(source.watched[k], source.watchedBases[k], low, high))
+                return true;
+        return false;
+    };
+    const length = (list) => source.kind === "hash" ? list.c : list.b - list.a + list.d - list.c;
+    const row = (target, list, index) => {
+        target.f = 0;
+        if (!(index >= 0 && index < length(list)))
+            return;
+        let position = Math.floor(index);
+        let archetype;
+        let found;
+        if (source.kind === "hash") {
+            const at = source.hashEntriesBase + (list.b + position) * 3;
+            archetype = source.hashEntries[at + 1];
+            found = source.hashEntries[at + 2];
+        }
+        else {
+            const first = list.b - list.a;
+            position = position < first ? list.a + position : list.c + position - first;
+            // The cursor: block position `e`, its first entry's position `g`, its length `h`.
+            if (!(position >= list.g && position < list.g + list.h)) {
+                list.e = blockAt(position);
+                list.g = prefix(list.e);
+                list.h = source.lengths[source.lengthsBase + source.order[source.orderBase + list.e]];
+            }
+            const block = source.order[source.orderBase + list.e];
+            const at = source.sortedEntriesBase + block * blockEntries * stride + (position - list.g) * stride;
+            archetype = source.sortedEntries[at + words + 1];
+            found = source.sortedEntries[at + words + 2];
+        }
+        target.a = archetype;
+        target.b = found;
+        target.f = 1;
+    };
+    /** A probe's values, copied from its arguments, reused. */
+    const values = [];
+    return {
+        source,
+        probe: (probe, list, first, a0 = NaN, a1 = NaN, a2 = NaN, a3 = NaN, a4 = NaN, a5 = NaN, a6 = NaN, a7 = NaN, a8 = NaN, a9 = NaN, a10 = NaN, a11 = NaN, a12 = NaN, a13 = NaN, a14 = NaN, a15 = NaN) => {
+            const plan = setup.probes[probe];
+            if (plan === null || plan === undefined)
+                return;
+            values[0] = a0;
+            values[1] = a1;
+            values[2] = a2;
+            values[3] = a3;
+            values[4] = a4;
+            values[5] = a5;
+            values[6] = a6;
+            values[7] = a7;
+            values[8] = a8;
+            values[9] = a9;
+            values[10] = a10;
+            values[11] = a11;
+            values[12] = a12;
+            values[13] = a13;
+            values[14] = a14;
+            values[15] = a15;
+            let next = encode(values, plan.values, 0);
+            if (source.kind === "hash") {
+                let hash = 0x811C9DC5;
+                for (let k = 0; k < words; k++) {
+                    hash = Math.imul(hash ^ key[k], 0x9E3779B1);
+                    hash ^= hash >>> 15;
+                }
+                hash = Math.imul(hash ^ (hash >>> 16), 0x85EBCA6B);
+                hash = Math.imul(hash ^ (hash >>> 13), 0xC2B2AE35);
+                hash = (hash ^ (hash >>> 16)) >>> 0;
+                const { slots, slotsBase, mask, records, recordsBase } = source;
+                const recordWords = stride;
+                let bucket = -1;
+                for (let slot = hash & mask;; slot = (slot + 1) & mask) {
+                    const filled = slots[slotsBase + 2 * slot + 1];
+                    if (filled === 0)
+                        break;
+                    if (slots[slotsBase + 2 * slot] !== hash)
+                        continue;
+                    const base = recordsBase + (filled - 1) * recordWords + 4;
+                    let same = true;
+                    for (let k = 0; k < words && same; k++)
+                        same = records[base + k] === key[k];
+                    if (same) {
+                        bucket = filled - 1;
+                        break;
+                    }
+                }
+                list.a = bucket;
+                list.b = bucket < 0 ? 0 : records[recordsBase + bucket * recordWords + 1];
+                list.c = bucket < 0 ? 0 : records[recordsBase + bucket * recordWords + 2];
+            }
+            else {
+                list.c = list.d = 0;
+                list.h = 0;
+                let low = bound(plan.prefixWords, false);
+                let high = bound(plan.prefixWords, true);
+                if (plan.comparisons !== null) {
+                    let unequalLow = -1;
+                    let unequalHigh = -1;
+                    for (const comparison of plan.comparisons) {
+                        next = encode(values, comparison.values, next);
+                        switch (comparison.operator) {
+                            case ">=":
+                                low = Math.max(low, bound(comparison.words, false));
+                                break;
+                            case ">":
+                                low = Math.max(low, bound(comparison.words, true));
+                                break;
+                            case "<":
+                                high = Math.min(high, bound(comparison.words, false));
+                                break;
+                            case "<=":
+                                high = Math.min(high, bound(comparison.words, true));
+                                break;
+                            case "==":
+                                low = Math.max(low, bound(comparison.words, false));
+                                high = Math.min(high, bound(comparison.words, true));
+                                break;
+                            case "!=":
+                                unequalLow = bound(comparison.words, false);
+                                unequalHigh = bound(comparison.words, true);
+                                break;
+                            default: break;
+                        }
+                    }
+                    if (high < low)
+                        high = low;
+                    if (unequalLow >= 0) {
+                        list.c = Math.max(low, Math.min(high, unequalHigh));
+                        list.d = high;
+                        high = Math.min(high, Math.max(low, unequalLow));
+                        if (list.c >= list.d)
+                            list.c = list.d = 0;
+                    }
+                }
+                list.a = low;
+                list.b = high;
+            }
+            row(first, list, 0);
+        },
+        length,
+        changed: list => {
+            const { since } = source;
+            if (source.kind === "hash") {
+                const bucket = list.a;
+                if (bucket < 0)
+                    return source.cleared > since;
+                if (source.ticks[source.ticksBase + bucket] > since)
+                    return true;
+                for (let k = 0; k < source.watched.length; k++)
+                    if (source.watched[k][source.watchedBases[k] + bucket] > since)
+                        return true;
+                return false;
+            }
+            if (source.blocks === 0)
+                return source.cleared > since;
+            return runChanged(list.a, list.b) || (list.d > list.c && runChanged(list.c, list.d));
+        },
+        row,
+        leaf: (target, leaf) => {
+            if (target.f !== 1)
+                return NaN;
+            const view = leafView(target.a, leaf);
+            const found = setup.rowLeaves[leaf];
+            if (view === undefined || found === null || found === undefined)
+                return NaN;
+            const value = view[target.b * found.unitStride + found.unitOffset];
+            return found.boolean ? value !== 0 : value;
+        },
+        entity: target => {
+            if (target.f !== 1)
+                return NaN;
+            return archetypeAt(target.a)?.entities[target.b] ?? NaN;
+        },
+    };
+};
+//# sourceMappingURL=index-readers.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index-readers.js","sourceRoot":"","sources":["../../../src/implementation/world/index-readers.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAG/C,wEAAwE;AACxE,MAAM,YAAY,GAAG,GAAG,CAAC;AA2BzB,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;AAEhC,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,IAAuB,EAAe,EAAE,CAAC,CAAC;IACxE,IAAI;IACJ,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC;IAC/J,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC;IAC1H,aAAa,EAAE,IAAI,EAAE,iBAAiB,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;IAC/I,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE;CACvD,CAAC,CAAC;AAEH;;;GAGG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,MAAmB,EAAE,MAA2F,EAAE,UAA6B,EAAE,EAAU,EAAE,OAAe,EAAQ,EAAE;IACvN,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,MAAM,CAAC;IACjC,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACzB,MAAM,CAAC,KAAK,GAAG,GAAG,CAAC;QAAC,MAAM,CAAC,SAAS,GAAG,UAAU,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QAAC,MAAM,CAAC,IAAI,GAAG,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAC9F,MAAM,CAAC,OAAO,GAAG,GAAG,CAAC;QAAC,MAAM,CAAC,WAAW,GAAG,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACpE,MAAM,CAAC,WAAW,GAAG,GAAG,CAAC;QAAC,MAAM,CAAC,eAAe,GAAG,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC5E,MAAM,CAAC,KAAK,GAAG,GAAG,CAAC;QAAC,MAAM,CAAC,SAAS,GAAG,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAChE,MAAM,CAAC,OAAO,GAAG,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAAC,MAAM,CAAC,KAAK,GAAG,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACvE,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;QACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAAC,CAAC;QACvH,OAAO;IACX,CAAC;IACD,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC;IAAC,MAAM,CAAC,UAAU,GAAG,UAAU,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;IAAC,MAAM,CAAC,MAAM,GAAG,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAClG,MAAM,CAAC,KAAK,GAAG,GAAG,CAAC;IAAC,MAAM,CAAC,SAAS,GAAG,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAChE,MAAM,CAAC,OAAO,GAAG,GAAG,CAAC;IAAC,MAAM,CAAC,WAAW,GAAG,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACpE,MAAM,CAAC,aAAa,GAAG,GAAG,CAAC;IAAC,MAAM,CAAC,iBAAiB,GAAG,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAChF,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC;IAAC,MAAM,CAAC,UAAU,GAAG,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAAC,MAAM,CAAC,IAAI,GAAG,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACpG,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC;IAAC,MAAM,CAAC,QAAQ,GAAG,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAAC,MAAM,CAAC,MAAM,GAAG,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAClG,MAAM,CAAC,OAAO,GAAG,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAAC,MAAM,CAAC,KAAK,GAAG,UAAU,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACxE,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;IACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAAC,CAAC;AAC5H,CAAC,CAAC;AAoCF,kEAAkE;AAClE,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,KAAuB,EAAE,MAAmB,EAAE,WAAwD,EAAe,EAAE;IACrJ,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;IAChC,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAChD,4FAA4F;IAC5F,MAAM,KAAK,GAAiC,EAAE,CAAC;IAC/C,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,QAAQ,GAAG,CAAC,SAAiB,EAAE,IAAY,EAA0B,EAAE;QACzE,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;QACrC,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC1C,IAAI,QAAQ,CAAC,SAAS,CAAC,KAAK,KAAK,CAAC,OAAO,EAAE,CAAC;YACxC,QAAQ,CAAC,SAAS,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;YACpC,KAAK,CAAC,SAAS,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACpH,CAAC;QACD,OAAO,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC;IACF,MAAM,MAAM,GAAG,CAAC,MAAyB,EAAE,OAAgC,EAAE,EAAU,EAAU,EAAE;QAC/F,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,KAAK,MAAM,MAAM,IAAI,OAAO;YAAE,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5F,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC;IACF,iIAAiI;IACjI,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,KAAc,EAAU,EAAE;QACpD,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,iBAAiB,EAAE,GAAG,MAAM,CAAC;QAChH,MAAM,MAAM,GAAG,CAAC,KAAkB,EAAE,IAAY,EAAW,EAAE;YACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBAC1B,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,IAAI,CAAC,KAAK,CAAC;oBAAE,OAAO,CAAC,GAAG,CAAC,CAAC;YAC9B,CAAC;YACD,OAAO,CAAC,KAAK,CAAC;QAClB,CAAC,CAAC;QACF,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;QACzB,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;YAChB,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,MAAM,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAAE,IAAI,GAAG,MAAM,CAAC;;gBAChE,GAAG,GAAG,MAAM,GAAG,CAAC,CAAC;QAC1B,CAAC;QACD,IAAI,GAAG,IAAI,MAAM,CAAC,MAAM;YAAE,OAAO,MAAM,CAAC,IAAI,CAAC;QAC7C,MAAM,CAAC,GAAG,GAAG,CAAC;QACd,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,iBAAiB,GAAG,KAAK,GAAG,YAAY,GAAG,MAAM,CAAC;QAC/D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,IAAI,GAAG,OAAO,CAAC,WAAW,GAAG,KAAK,CAAC,CAAC;QACxC,OAAO,KAAK,GAAG,IAAI,EAAE,CAAC;YAClB,MAAM,MAAM,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YACpC,IAAI,MAAM,CAAC,aAAa,EAAE,IAAI,GAAG,MAAM,GAAG,MAAM,CAAC;gBAAE,IAAI,GAAG,MAAM,CAAC;;gBAC5D,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IAC7B,CAAC,CAAC;IACF,MAAM,MAAM,GAAG,CAAC,CAAS,EAAU,EAAE;QACjC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC;QACtC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,IAAI,GAAG,CAAC,IAAI;YAAE,GAAG,IAAI,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;QACpF,OAAO,GAAG,CAAC;IACf,CAAC,CAAC;IACF,MAAM,OAAO,GAAG,CAAC,QAAgB,EAAU,EAAE;QACzC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;QAC9C,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,SAAS,GAAG,QAAQ,CAAC;QACzB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,OAAO,IAAI,GAAG,CAAC,IAAI,MAAM;YAAE,IAAI,IAAI,CAAC,CAAC;QACrC,OAAO,IAAI,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC;YACtB,IAAI,IAAI,IAAI,MAAM,IAAI,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC3D,CAAC,GAAG,IAAI,CAAC;gBACT,SAAS,IAAI,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;YAC3C,CAAC;QACL,CAAC;QACD,OAAO,CAAC,CAAC;IACb,CAAC,CAAC;IACF,MAAM,SAAS,GAAG,CAAC,IAAkB,EAAE,IAAY,EAAE,GAAW,EAAE,IAAY,EAAW,EAAE;QACvF,oCAAoC;QACpC,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,MAAM,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC;QAC1E,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;QAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3D,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QACzC,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,GAAG,EAAE,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,CAAC;YAC1G,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC;gBAAE,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC;YACvE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;gBAAE,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QAC7E,CAAC;QACD,OAAO,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC;IAClC,CAAC,CAAC;IACF,MAAM,UAAU,GAAG,CAAC,GAAW,EAAE,IAAY,EAAW,EAAE;QACtD,IAAI,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,QAAQ,EAAE,GAAG,EAAE,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;QACjI,OAAO,KAAK,CAAC;IACjB,CAAC,CAAC;IACF,MAAM,MAAM,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAC7G,MAAM,GAAG,GAAG,CAAC,MAAc,EAAE,IAAY,EAAE,KAAa,EAAQ,EAAE;QAC9D,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;QACb,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO;QAClD,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,SAAiB,CAAC;QACtB,IAAI,KAAa,CAAC;QAClB,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACzB,MAAM,EAAE,GAAG,MAAM,CAAC,eAAe,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC5D,SAAS,GAAG,MAAM,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACvC,KAAK,GAAG,MAAM,CAAC,WAAW,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACvC,CAAC;aACI,CAAC;YACF,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YAC9B,QAAQ,GAAG,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,GAAG,KAAK,CAAC;YAC5E,kFAAkF;YAClF,IAAI,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC,IAAI,QAAQ,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBACtD,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAC3B,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACxB,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1F,CAAC;YACD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,EAAE,GAAG,MAAM,CAAC,iBAAiB,GAAG,KAAK,GAAG,YAAY,GAAG,MAAM,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;YACnG,SAAS,GAAG,MAAM,CAAC,aAAa,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;YACjD,KAAK,GAAG,MAAM,CAAC,aAAa,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;QACjD,CAAC;QACD,MAAM,CAAC,CAAC,GAAG,SAAS,CAAC;QACrB,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC;QACjB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IACF,2DAA2D;IAC3D,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,OAAO;QACH,MAAM;QACN,KAAK,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE;YAChM,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACjC,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS;gBAAE,OAAO;YAChD,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAC/H,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAAC,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;YAAC,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;YAAC,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;YAAC,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;YAAC,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;YAAC,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;YAC3I,IAAI,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC1C,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACzB,IAAI,IAAI,GAAG,UAAU,CAAC;gBACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;oBAC5C,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;gBACxB,CAAC;gBACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;gBACnD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;gBACnD,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;gBACpC,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,MAAM,CAAC;gBAChE,MAAM,WAAW,GAAG,MAAM,CAAC;gBAC3B,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;gBAChB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAI,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;oBACtD,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;oBAC/C,IAAI,MAAM,KAAK,CAAC;wBAAE,MAAM;oBACxB,IAAI,KAAK,CAAC,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,IAAI;wBAAE,SAAS;oBACnD,MAAM,IAAI,GAAG,WAAW,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC;oBAC1D,IAAI,IAAI,GAAG,IAAI,CAAC;oBAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,IAAI,EAAE,CAAC,EAAE;wBAAE,IAAI,GAAG,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC5E,IAAI,IAAI,EAAE,CAAC;wBACP,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC;wBACpB,MAAM;oBACV,CAAC;gBACL,CAAC;gBACD,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;gBAChB,IAAI,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,GAAG,MAAM,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC;gBAC1E,IAAI,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,GAAG,MAAM,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC;YAC9E,CAAC;iBACI,CAAC;gBACF,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACpB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACX,IAAI,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;gBACzC,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;gBACzC,IAAI,IAAI,CAAC,WAAW,KAAK,IAAI,EAAE,CAAC;oBAC5B,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;oBACpB,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC;oBACrB,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;wBACxC,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;wBAC/C,QAAQ,UAAU,CAAC,QAAQ,EAAE,CAAC;4BAC1B,KAAK,IAAI;gCAAE,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;gCAAC,MAAM;4BACtE,KAAK,GAAG;gCAAE,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;gCAAC,MAAM;4BACpE,KAAK,GAAG;gCAAE,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;gCAAC,MAAM;4BACvE,KAAK,IAAI;gCAAE,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;gCAAC,MAAM;4BACvE,KAAK,IAAI;gCAAE,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;gCAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;gCAAC,MAAM;4BAC5H,KAAK,IAAI;gCAAE,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;gCAAC,WAAW,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gCAAC,MAAM;4BAC3G,OAAO,CAAC,CAAC,MAAM;wBACnB,CAAC;oBACL,CAAC;oBACD,IAAI,IAAI,GAAG,GAAG;wBAAE,IAAI,GAAG,GAAG,CAAC;oBAC3B,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;wBAClB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC;wBACpD,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;wBACd,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC;wBACjD,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;4BAAE,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;oBAC9C,CAAC;gBACL,CAAC;gBACD,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;gBACb,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;YAClB,CAAC;YACD,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QACxB,CAAC;QACD,MAAM;QACN,OAAO,EAAE,IAAI,CAAC,EAAE;YACZ,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;YACzB,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACzB,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;gBACtB,IAAI,MAAM,GAAG,CAAC;oBAAE,OAAO,MAAM,CAAC,OAAO,GAAG,KAAK,CAAC;gBAC9C,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,GAAG,MAAM,CAAC,GAAG,KAAK;oBAAE,OAAO,IAAI,CAAC;gBACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE;oBAAE,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,KAAK;wBAAE,OAAO,IAAI,CAAC;gBAC5H,OAAO,KAAK,CAAC;YACjB,CAAC;YACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,MAAM,CAAC,OAAO,GAAG,KAAK,CAAC;YACvD,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACzF,CAAC;QACD,GAAG;QACH,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE;YACnB,IAAI,MAAM,CAAC,CAAC,KAAK,CAAC;gBAAE,OAAO,GAAG,CAAC;YAC/B,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACtC,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,GAAG,CAAC;YAC5E,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;YACnE,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAC/C,CAAC;QACD,MAAM,EAAE,MAAM,CAAC,EAAE;YACb,IAAI,MAAM,CAAC,CAAC,KAAK,CAAC;gBAAE,OAAO,GAAG,CAAC;YAC/B,OAAO,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;QAC5D,CAAC;KACJ,CAAC;AACN,CAAC,CAAC"}