@adobe/data 0.9.60 → 0.9.62

package/dist/ecs/database/index-registry/create-index.js

@@ -0,0 +1,539 @@
+// © 2026 Adobe. MIT License. See /LICENSE for details.
+// ============================================================================
+// Key serialization
+// ============================================================================
+/**
+ * Stable string serialization for a bucket key. Objects are key-sorted
+ * so `{a, b}` and `{b, a}` produce the same key. Used for the Map<string,
+ * Entity[]> bucket store.
+ */
+const serializeKey = (value) => {
+    if (value === null || typeof value !== "object") {
+        return JSON.stringify(value);
+    }
+    if (Array.isArray(value)) {
+        return `[${value.map(serializeKey).join(",")}]`;
+    }
+    const keys = Object.keys(value).sort();
+    let out = "{";
+    for (let i = 0; i < keys.length; i++) {
+        if (i > 0)
+            out += ",";
+        const k = keys[i];
+        out += JSON.stringify(k) + ":" + serializeKey(value[k]);
+    }
+    out += "}";
+    return out;
+};
+/**
+ * Fan-out: given a single raw key value (scalar / array / object with
+ * possibly-array slots), produce every bucket key value the entity should
+ * be filed under. Array at top level → one entry per element. Object
+ * with array-valued slots → cartesian product across them.
+ */
+const expandBucketKeys = (keyValue) => {
+    if (Array.isArray(keyValue))
+        return keyValue.length === 0 ? [] : keyValue;
+    if (keyValue !== null && typeof keyValue === "object") {
+        const entries = Object.entries(keyValue);
+        let acc = [{}];
+        for (const [k, v] of entries) {
+            const choices = Array.isArray(v) ? v : [v];
+            if (choices.length === 0)
+                return [];
+            const next = [];
+            for (const partial of acc) {
+                for (const choice of choices) {
+                    next.push({ ...partial, [k]: choice });
+                }
+            }
+            acc = next;
+        }
+        return acc;
+    }
+    return [keyValue];
+};
+const normalizeKey = (keyDecl, extraComponents) => {
+    // Bare column name
+    if (typeof keyDecl === "string") {
+        return {
+            readColumns: [keyDecl],
+            extractFromEntity: (values) => {
+                const v = values[keyDecl];
+                return v === undefined ? null : v;
+            },
+            extractFromLookup: (arg) => arg,
+        };
+    }
+    // String tuple
+    if (Array.isArray(keyDecl)) {
+        const cols = keyDecl;
+        return {
+            readColumns: cols,
+            extractFromEntity: (values) => {
+                const out = {};
+                for (const c of cols) {
+                    const v = values[c];
+                    if (v === undefined)
+                        return null;
+                    out[c] = v;
+                }
+                return out;
+            },
+            extractFromLookup: (arg) => arg,
+        };
+    }
+    // Function
+    if (typeof keyDecl === "function") {
+        return {
+            readColumns: extraComponents,
+            extractFromEntity: (values) => {
+                const args = extraComponents.map((c) => values[c]);
+                if (args.some((v) => v === undefined))
+                    return null;
+                const out = keyDecl(...args);
+                return out === undefined ? null : out;
+            },
+            extractFromLookup: (arg) => arg,
+        };
+    }
+    // Slot map
+    const slotEntries = Object.entries(keyDecl);
+    // Read set: identity-string columns + extra components for functions.
+    const reads = new Set();
+    for (const [, v] of slotEntries)
+        if (typeof v === "string")
+            reads.add(v);
+    for (const c of extraComponents)
+        reads.add(c);
+    return {
+        readColumns: [...reads],
+        extractFromEntity: (values) => {
+            const out = {};
+            for (const [slot, ext] of slotEntries) {
+                if (typeof ext === "string") {
+                    const v = values[ext];
+                    if (v === undefined)
+                        return null;
+                    out[slot] = v;
+                }
+                else {
+                    const args = extraComponents.map((c) => values[c]);
+                    if (args.some((v) => v === undefined))
+                        return null;
+                    const v = ext(...args);
+                    if (v === undefined)
+                        return null;
+                    out[slot] = v;
+                }
+            }
+            return out;
+        },
+        extractFromLookup: (arg) => arg,
+    };
+};
+const defaultCompare = (by) => (a, b) => {
+    for (const c of by) {
+        const va = a[c];
+        const vb = b[c];
+        if (va === vb)
+            continue;
+        if (va < vb)
+            return -1;
+        return 1;
+    }
+    return 0;
+};
+const normalizeOrder = (order) => {
+    const { by, compare } = order;
+    const cmp = compare ?? defaultCompare(by);
+    return {
+        readColumns: by,
+        snapshot: (values) => {
+            const out = {};
+            for (const c of by) {
+                const v = values[c];
+                if (v === undefined)
+                    return null;
+                out[c] = v;
+            }
+            return out;
+        },
+        compare: cmp,
+    };
+};
+export const createIndex = (state) => {
+    const unique = state.unique ?? false;
+    const extraComponents = state.components ?? [];
+    const keyEx = normalizeKey(state.key, extraComponents);
+    const orderEx = state.order ? normalizeOrder(state.order) : null;
+    const sorted = orderEx !== null;
+    // All columns the index touches (key reads + sort reads). Used by
+    // the store to walk only relevant archetypes when seeding.
+    const readColumns = (() => {
+        const set = new Set(keyEx.readColumns);
+        if (orderEx)
+            for (const c of orderEx.readColumns)
+                set.add(c);
+        return [...set];
+    })();
+    // Bucket payload:
+    //  - non-unique → Set<Entity>  (membership; O(1) add + delete + has)
+    //  - unique     → single Entity
+    // We use a Set rather than an Entity[] so single-entity writes are
+    // O(1) in bucket size — `arr.indexOf` + `splice` / `swap-pop` would
+    // make remove and bucket-change updates O(bucket.size), which can be
+    // O(archetype.rowCount) in pathological cases (many entities sharing
+    // one bucket key).
+    const buckets = new Map();
+    // The post-fan-out key value for each serialized bucket key. `findRange`
+    // reads this to apply per-bucket operator filters (find scans every
+    // bucket once and keeps the ones whose value matches the filter).
+    const bucketValueByKey = new Map();
+    // Reverse map: which serialized bucket keys each entity sits in.
+    const entityKeys = new Map();
+    // Sort cache, if sorted.
+    const sortCache = sorted ? new Map() : undefined;
+    // Cached sorted array per bucket — populated lazily by `find` /
+    // `findRange`, dropped on any write that touches the bucket. Lets
+    // repeated reads of the same bucket avoid re-materializing + re-sorting.
+    const sortedCache = sorted ? new Map() : undefined;
+    // Helpers ---------------------------------------------------------------
+    /** Enumerate (serialized-key, post-fan-out-value) pairs for an entity. */
+    const bucketEntriesFor = (values) => {
+        const raw = keyEx.extractFromEntity(values);
+        if (raw === null)
+            return [];
+        const expanded = expandBucketKeys(raw);
+        const out = [];
+        const seen = new Set();
+        for (const v of expanded) {
+            const s = serializeKey(v);
+            if (!seen.has(s)) {
+                seen.add(s);
+                out.push({ key: s, value: v });
+            }
+        }
+        return out;
+    };
+    /** Just the keys (used in many maintenance paths). */
+    const bucketKeysFor = (values) => bucketEntriesFor(values).map((e) => e.key);
+    const lookupKey = (arg) => serializeKey(keyEx.extractFromLookup(arg));
+    /** Comparator that reads each entity's snapshot from sortCache. */
+    const compareEntities = (a, b) => orderEx.compare(sortCache.get(a), sortCache.get(b));
+    /**
+     * Materialize a non-unique bucket as an `Entity[]`. For sorted indexes
+     * the result is cached and the cache is invalidated by writes — so
+     * repeated reads of the same bucket pay nothing after the first.
+     */
+    const materializeBucket = (key, set) => {
+        if (sorted) {
+            const cached = sortedCache.get(key);
+            if (cached !== undefined)
+                return cached;
+            const arr = [...set];
+            if (arr.length > 1)
+                arr.sort(compareEntities);
+            sortedCache.set(key, arr);
+            return arr;
+        }
+        return [...set];
+    };
+    const insertIntoBucket = (entity, key, value) => {
+        bucketValueByKey.set(key, value);
+        if (unique) {
+            const existing = buckets.get(key);
+            if (existing !== undefined && existing !== entity) {
+                throw new Error(`Unique index conflict on key ${key}: ` +
+                    `existing entity ${existing}, new entity ${entity}`);
+            }
+            buckets.set(key, entity);
+            return;
+        }
+        let set = buckets.get(key);
+        if (!set)
+            buckets.set(key, (set = new Set()));
+        set.add(entity);
+        if (sorted)
+            sortedCache.delete(key);
+    };
+    const removeFromBucket = (entity, key) => {
+        if (unique) {
+            buckets.delete(key);
+            bucketValueByKey.delete(key);
+            return;
+        }
+        const set = buckets.get(key);
+        if (!set)
+            return;
+        set.delete(entity);
+        if (sorted)
+            sortedCache.delete(key);
+        if (set.size === 0) {
+            buckets.delete(key);
+            bucketValueByKey.delete(key);
+        }
+    };
+    // Public methods --------------------------------------------------------
+    const add = (entity, values) => {
+        const entries = bucketEntriesFor(values);
+        if (entries.length === 0)
+            return;
+        if (unique) {
+            for (const { key } of entries) {
+                const existing = buckets.get(key);
+                if (existing !== undefined && existing !== entity) {
+                    throw new Error(`Unique index conflict on key ${key}: ` +
+                        `existing entity ${existing}, new entity ${entity}`);
+                }
+            }
+        }
+        if (sorted) {
+            const snap = orderEx.snapshot(values);
+            if (snap === null)
+                return;
+            sortCache.set(entity, snap);
+        }
+        for (const { key, value } of entries)
+            insertIntoBucket(entity, key, value);
+        entityKeys.set(entity, entries.map((e) => e.key));
+    };
+    const remove = (entity) => {
+        const keys = entityKeys.get(entity);
+        if (!keys)
+            return;
+        for (const k of keys)
+            removeFromBucket(entity, k);
+        entityKeys.delete(entity);
+        if (sorted)
+            sortCache.delete(entity);
+    };
+    const update = (entity, values) => {
+        const nextEntries = bucketEntriesFor(values);
+        const nextKeys = nextEntries.map((e) => e.key);
+        const prevKeys = entityKeys.get(entity) ?? [];
+        const nextSet = new Set(nextKeys);
+        const prevSet = new Set(prevKeys);
+        // Unique pre-check on new keys we don't already own.
+        if (unique) {
+            for (const k of nextKeys) {
+                if (prevSet.has(k))
+                    continue;
+                const existing = buckets.get(k);
+                if (existing !== undefined && existing !== entity) {
+                    throw new Error(`Unique index conflict on key ${k}: ` +
+                        `existing entity ${existing}, new entity ${entity}`);
+                }
+            }
+        }
+        // Same bucket set → only the per-entity sort snapshot may have
+        // changed. Refresh it and drop the sort cache so the next read
+        // re-sorts. No bucket scan up front — O(b) total.
+        const sameBuckets = nextKeys.length === prevKeys.length &&
+            nextKeys.every((k, i) => k === prevKeys[i]);
+        if (sameBuckets) {
+            if (!sorted)
+                return;
+            const newSnap = orderEx.snapshot(values);
+            if (newSnap === null) {
+                remove(entity);
+                return;
+            }
+            const oldSnap = sortCache.get(entity);
+            if (oldSnap !== undefined && orderEx.compare(oldSnap, newSnap) === 0)
+                return;
+            sortCache.set(entity, newSnap);
+            if (!unique)
+                for (const k of nextKeys)
+                    sortedCache.delete(k);
+            return;
+        }
+        // Bucket-set changed: drop the ones we left, refresh sort cache,
+        // insert into the new ones. insertIntoBucket marks new buckets dirty.
+        for (const k of prevKeys)
+            if (!nextSet.has(k))
+                removeFromBucket(entity, k);
+        if (sorted) {
+            if (nextEntries.length === 0)
+                sortCache.delete(entity);
+            else {
+                const snap = orderEx.snapshot(values);
+                if (snap === null) {
+                    remove(entity);
+                    return;
+                }
+                sortCache.set(entity, snap);
+            }
+        }
+        for (const { key, value } of nextEntries) {
+            if (!prevSet.has(key))
+                insertIntoBucket(entity, key, value);
+        }
+        if (nextKeys.length === 0)
+            entityKeys.delete(entity);
+        else
+            entityKeys.set(entity, nextKeys);
+    };
+    const clear = () => {
+        buckets.clear();
+        bucketValueByKey.clear();
+        entityKeys.clear();
+        if (sorted) {
+            sortCache.clear();
+            sortedCache.clear();
+        }
+    };
+    const find = (arg) => {
+        const k = lookupKey(arg);
+        const bucket = buckets.get(k);
+        if (bucket === undefined)
+            return [];
+        if (unique)
+            return [bucket];
+        // Materialize a fresh array on each call to keep the returned
+        // result independent of internal mutations. For sorted indexes
+        // the inner sorted array is cached and reused across reads until
+        // the next write to the bucket — so successive reads only pay
+        // the slice, not the sort.
+        return materializeBucket(k, bucket).slice();
+    };
+    // findRange supports the exact-match argument shape that `find` accepts,
+    // plus operator filters on the bucket key. Operators are
+    // ==, !=, <, <=, >, >=. For a scalar key (bare-string or function key),
+    // an operator object at the argument root applies to the scalar value.
+    // For an object key (tuple or slot map), each field can be either a
+    // value (equality) or an operator object.
+    //
+    // Implementation walks every bucket once. That cost is linear in the
+    // bucket count, but the alternative — maintaining a sorted index on the
+    // bucket key — is much heavier machinery for the same result on most
+    // workloads. The hot path for users is `find`, not `findRange`.
+    const isOperatorObject = (v) => {
+        if (v === null || typeof v !== "object" || Array.isArray(v))
+            return false;
+        const keys = Object.keys(v);
+        if (keys.length === 0)
+            return false;
+        for (const k of keys) {
+            if (k !== "==" && k !== "!=" && k !== "<" && k !== "<=" && k !== ">" && k !== ">=") {
+                return false;
+            }
+        }
+        return true;
+    };
+    const matchesOps = (value, ops) => {
+        for (const op in ops) {
+            const target = ops[op];
+            const v = value;
+            const t = target;
+            switch (op) {
+                case "==":
+                    if (!Object.is(v, t))
+                        return false;
+                    break;
+                case "!=":
+                    if (Object.is(v, t))
+                        return false;
+                    break;
+                case "<":
+                    if (!(v < t))
+                        return false;
+                    break;
+                case "<=":
+                    if (!(v <= t))
+                        return false;
+                    break;
+                case ">":
+                    if (!(v > t))
+                        return false;
+                    break;
+                case ">=":
+                    if (!(v >= t))
+                        return false;
+                    break;
+            }
+        }
+        return true;
+    };
+    const scalarKey = typeof state.key === "string" || typeof state.key === "function";
+    const matchesArg = (bucketValue, arg) => {
+        if (scalarKey) {
+            if (isOperatorObject(arg))
+                return matchesOps(bucketValue, arg);
+            return Object.is(bucketValue, arg);
+        }
+        if (arg === null || typeof arg !== "object" || Array.isArray(arg))
+            return false;
+        for (const field in arg) {
+            const condition = arg[field];
+            const fieldValue = bucketValue[field];
+            if (isOperatorObject(condition)) {
+                if (!matchesOps(fieldValue, condition))
+                    return false;
+            }
+            else if (!Object.is(fieldValue, condition)) {
+                return false;
+            }
+        }
+        return true;
+    };
+    const findRange = (arg) => {
+        const result = new Set();
+        for (const [key, bucketEntries] of buckets) {
+            const bucketValue = bucketValueByKey.get(key);
+            if (!matchesArg(bucketValue, arg))
+                continue;
+            if (unique) {
+                result.add(bucketEntries);
+                continue;
+            }
+            // For sorted indexes, materialize the (cached) sorted array
+            // so per-bucket order is consistent with `find` semantics.
+            // Cross-bucket order is still arbitrary (the outer Set).
+            const set = bucketEntries;
+            const ordered = sorted ? materializeBucket(key, set) : set;
+            for (const e of ordered)
+                result.add(e);
+        }
+        return [...result];
+    };
+    const get = (arg) => {
+        if (!unique) {
+            throw new Error("Database.Index.Handle.get is only available on unique indexes");
+        }
+        const k = lookupKey(arg);
+        const bucket = buckets.get(k);
+        return bucket === undefined ? null : bucket;
+    };
+    const checkUniqueAvailable = (values, excludeEntity) => {
+        if (!unique)
+            return null;
+        const keys = bucketKeysFor(values);
+        for (const k of keys) {
+            const existing = buckets.get(k);
+            if (existing === undefined)
+                continue;
+            if (excludeEntity !== null && existing === excludeEntity)
+                continue;
+            return existing;
+        }
+        return null;
+    };
+    return {
+        unique,
+        readColumns,
+        sorted,
+        key: state.key,
+        order: state.order,
+        add,
+        remove,
+        update,
+        clear,
+        get size() { return entityKeys.size; },
+        find,
+        findRange,
+        get: get,
+        checkUniqueAvailable,
+    };
+};
+//# sourceMappingURL=create-index.js.map

package/dist/ecs/database/index-registry/create-index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"create-index.js","sourceRoot":"","sources":["../../../../src/ecs/database/index-registry/create-index.ts"],"names":[],"mappings":"AAAA,uDAAuD;AAyCvD,+EAA+E;AAC/E,oBAAoB;AACpB,+EAA+E;AAE/E;;;;GAIG;AACH,MAAM,YAAY,GAAG,CAAC,KAAc,EAAU,EAAE;IAC5C,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9C,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IACpD,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAe,CAAC,CAAC,IAAI,EAAE,CAAC;IACjD,IAAI,GAAG,GAAG,GAAG,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,CAAC,GAAG,CAAC;YAAE,GAAG,IAAI,GAAG,CAAC;QACtB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,YAAY,CAAE,KAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC;IACD,GAAG,IAAI,GAAG,CAAC;IACX,OAAO,GAAG,CAAC;AACf,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,gBAAgB,GAAG,CAAC,QAAiB,EAAa,EAAE;IACtD,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;QAAE,OAAO,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;IAC1E,IAAI,QAAQ,KAAK,IAAI,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QACpD,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,QAAmC,CAAC,CAAC;QACpE,IAAI,GAAG,GAA8B,CAAC,EAAE,CAAC,CAAC;QAC1C,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;YAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,EAAE,CAAC;YACpC,MAAM,IAAI,GAA8B,EAAE,CAAC;YAC3C,KAAK,MAAM,OAAO,IAAI,GAAG,EAAE,CAAC;gBACxB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;oBAC3B,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;gBAC3C,CAAC;YACL,CAAC;YACD,GAAG,GAAG,IAAI,CAAC;QACf,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IACD,OAAO,CAAC,QAAQ,CAAC,CAAC;AACtB,CAAC,CAAC;AAoBF,MAAM,YAAY,GAAG,CACjB,OAAqB,EACrB,eAAkC,EACtB,EAAE;IACd,mBAAmB;IACnB,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;QAC9B,OAAO;YACH,WAAW,EAAE,CAAC,OAAO,CAAC;YACtB,iBAAiB,EAAE,CAAC,MAAM,EAAE,EAAE;gBAC1B,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;gBAC1B,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;YACD,iBAAiB,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG;SAClC,CAAC;IACN,CAAC;IACD,eAAe;IACf,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,OAA4B,CAAC;QAC1C,OAAO;YACH,WAAW,EAAE,IAAI;YACjB,iBAAiB,EAAE,CAAC,MAAM,EAAE,EAAE;gBAC1B,MAAM,GAAG,GAA4B,EAAE,CAAC;gBACxC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;oBACnB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;oBACpB,IAAI,CAAC,KAAK,SAAS;wBAAE,OAAO,IAAI,CAAC;oBACjC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACf,CAAC;gBACD,OAAO,GAAG,CAAC;YACf,CAAC;YACD,iBAAiB,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG;SAClC,CAAC;IACN,CAAC;IACD,WAAW;IACX,IAAI,OAAO,OAAO,KAAK,UAAU,EAAE,CAAC;QAChC,OAAO;YACH,WAAW,EAAE,eAAe;YAC5B,iBAAiB,EAAE,CAAC,MAAM,EAAE,EAAE;gBAC1B,MAAM,IAAI,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBACnD,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;oBAAE,OAAO,IAAI,CAAC;gBACnD,MAAM,GAAG,GAAI,OAAwC,CAAC,GAAG,IAAI,CAAC,CAAC;gBAC/D,OAAO,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;YAC1C,CAAC;YACD,iBAAiB,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG;SAClC,CAAC;IACN,CAAC;IACD,WAAW;IACX,MAAM,WAAW,GAAG,MAAM,CAAC,OAAO,CAAC,OAAiE,CAAC,CAAC;IACtG,sEAAsE;IACtE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,WAAW;QAAE,IAAI,OAAO,CAAC,KAAK,QAAQ;YAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzE,KAAK,MAAM,CAAC,IAAI,eAAe;QAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC9C,OAAO;QACH,WAAW,EAAE,CAAC,GAAG,KAAK,CAAC;QACvB,iBAAiB,EAAE,CAAC,MAAM,EAAE,EAAE;YAC1B,MAAM,GAAG,GAA4B,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,WAAW,EAAE,CAAC;gBACpC,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;oBAC1B,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;oBACtB,IAAI,CAAC,KAAK,SAAS;wBAAE,OAAO,IAAI,CAAC;oBACjC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAClB,CAAC;qBAAM,CAAC;oBACJ,MAAM,IAAI,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnD,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;wBAAE,OAAO,IAAI,CAAC;oBACnD,MAAM,CAAC,GAAI,GAAoC,CAAC,GAAG,IAAI,CAAC,CAAC;oBACzD,IAAI,CAAC,KAAK,SAAS;wBAAE,OAAO,IAAI,CAAC;oBACjC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAClB,CAAC;YACL,CAAC;YACD,OAAO,GAAG,CAAC;QACf,CAAC;QACD,iBAAiB,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG;KAClC,CAAC;AACN,CAAC,CAAC;AAcF,MAAM,cAAc,GAAG,CACnB,EAAqB,EAC+C,EAAE,CACtE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;IACL,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACjB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAQ,CAAC;QACvB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAQ,CAAC;QACvB,IAAI,EAAE,KAAK,EAAE;YAAE,SAAS;QACxB,IAAI,EAAE,GAAG,EAAE;YAAE,OAAO,CAAC,CAAC,CAAC;QACvB,OAAO,CAAC,CAAC;IACb,CAAC;IACD,OAAO,CAAC,CAAC;AACb,CAAC,CAAC;AAEN,MAAM,cAAc,GAAG,CAAC,KAAqB,EAAkB,EAAE;IAC7D,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IAC9B,MAAM,GAAG,GAAG,OAAO,IAAI,cAAc,CAAC,EAAE,CAAC,CAAC;IAC1C,OAAO;QACH,WAAW,EAAE,EAAE;QACf,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE;YACjB,MAAM,GAAG,GAA4B,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACjB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpB,IAAI,CAAC,KAAK,SAAS;oBAAE,OAAO,IAAI,CAAC;gBACjC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACf,CAAC;YACD,OAAO,GAAG,CAAC;QACf,CAAC;QACD,OAAO,EAAE,GAAG;KACf,CAAC;AACN,CAAC,CAAC;AA2CF,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAiB,EAAgB,EAAE;IAC3D,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC;IACrC,MAAM,eAAe,GAAG,KAAK,CAAC,UAAU,IAAI,EAAE,CAAC;IAC/C,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,EAAE,eAAe,CAAC,CAAC;IACvD,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACjE,MAAM,MAAM,GAAG,OAAO,KAAK,IAAI,CAAC;IAEhC,kEAAkE;IAClE,2DAA2D;IAC3D,MAAM,WAAW,GAAG,CAAC,GAAG,EAAE;QACtB,MAAM,GAAG,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,WAAW,CAAC,CAAC;QAC/C,IAAI,OAAO;YAAE,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,WAAW;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7D,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;IACpB,CAAC,CAAC,EAAE,CAAC;IAEL,kBAAkB;IAClB,qEAAqE;IACrE,gCAAgC;IAChC,mEAAmE;IACnE,oEAAoE;IACpE,qEAAqE;IACrE,qEAAqE;IACrE,mBAAmB;IACnB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgC,CAAC;IACxD,yEAAyE;IACzE,oEAAoE;IACpE,kEAAkE;IAClE,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAmB,CAAC;IACpD,iEAAiE;IACjE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,yBAAyB;IACzB,MAAM,SAAS,GAAyC,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,CAAE,SAAmB,CAAC;IAClG,gEAAgE;IAChE,kEAAkE;IAClE,yEAAyE;IACzE,MAAM,WAAW,GAA0B,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,CAAE,SAAmB,CAAC;IAErF,0EAA0E;IAE1E,0EAA0E;IAC1E,MAAM,gBAAgB,GAAG,CACrB,MAAyC,EACR,EAAE;QACnC,MAAM,GAAG,GAAG,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,GAAG,KAAK,IAAI;YAAE,OAAO,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,GAAG,GAAsC,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACf,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACZ,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YACnC,CAAC;QACL,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC,CAAC;IAEF,sDAAsD;IACtD,MAAM,aAAa,GAAG,CAAC,MAAyC,EAAY,EAAE,CAC1E,gBAAgB,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAE/C,MAAM,SAAS,GAAG,CAAC,GAAY,EAAU,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC;IAEvF,mEAAmE;IACnE,MAAM,eAAe,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CACrD,OAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;IAE3D;;;;OAIG;IACH,MAAM,iBAAiB,GAAG,CAAC,GAAW,EAAE,GAAgB,EAAY,EAAE;QAClE,IAAI,MAAM,EAAE,CAAC;YACT,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,MAAM,KAAK,SAAS;gBAAE,OAAO,MAAM,CAAC;YACxC,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;YACrB,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YAC9C,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC1B,OAAO,GAAG,CAAC;QACf,CAAC;QACD,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;IACpB,CAAC,CAAC;IAEF,MAAM,gBAAgB,GAAG,CAAC,MAAc,EAAE,GAAW,EAAE,KAAc,EAAQ,EAAE;QAC3E,gBAAgB,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACjC,IAAI,MAAM,EAAE,CAAC;YACT,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;gBAChD,MAAM,IAAI,KAAK,CACX,gCAAgC,GAAG,IAAI;oBACvC,mBAAmB,QAAQ,gBAAgB,MAAM,EAAE,CACtD,CAAC;YACN,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YACzB,OAAO;QACX,CAAC;QACD,IAAI,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAA4B,CAAC;QACtD,IAAI,CAAC,GAAG;YAAE,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;QAC9C,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAChB,IAAI,MAAM;YAAE,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACxC,CAAC,CAAC;IAEF,MAAM,gBAAgB,GAAG,CAAC,MAAc,EAAE,GAAW,EAAQ,EAAE;QAC3D,IAAI,MAAM,EAAE,CAAC;YACT,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACpB,gBAAgB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC7B,OAAO;QACX,CAAC;QACD,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAA4B,CAAC;QACxD,IAAI,CAAC,GAAG;YAAE,OAAO;QACjB,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACnB,IAAI,MAAM;YAAE,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACjB,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACpB,gBAAgB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjC,CAAC;IACL,CAAC,CAAC;IAEF,0EAA0E;IAE1E,MAAM,GAAG,GAAG,CAAC,MAAc,EAAE,MAAyC,EAAQ,EAAE;QAC5E,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QACjC,IAAI,MAAM,EAAE,CAAC;YACT,KAAK,MAAM,EAAE,GAAG,EAAE,IAAI,OAAO,EAAE,CAAC;gBAC5B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAClC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;oBAChD,MAAM,IAAI,KAAK,CACX,gCAAgC,GAAG,IAAI;wBACvC,mBAAmB,QAAQ,gBAAgB,MAAM,EAAE,CACtD,CAAC;gBACN,CAAC;YACL,CAAC;QACL,CAAC;QACD,IAAI,MAAM,EAAE,CAAC;YACT,MAAM,IAAI,GAAG,OAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACvC,IAAI,IAAI,KAAK,IAAI;gBAAE,OAAO;YAC1B,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAChC,CAAC;QACD,KAAK,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,OAAO;YAAE,gBAAgB,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAC3E,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC;IAEF,MAAM,MAAM,GAAG,CAAC,MAAc,EAAQ,EAAE;QACpC,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,gBAAgB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAClD,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC1B,IAAI,MAAM;YAAE,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC,CAAC;IAEF,MAAM,MAAM,GAAG,CAAC,MAAc,EAAE,MAAyC,EAAQ,EAAE;QAC/E,MAAM,WAAW,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAC7C,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/C,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;QAClC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;QAElC,qDAAqD;QACrD,IAAI,MAAM,EAAE,CAAC;YACT,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACvB,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAC7B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAChC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;oBAChD,MAAM,IAAI,KAAK,CACX,gCAAgC,CAAC,IAAI;wBACrC,mBAAmB,QAAQ,gBAAgB,MAAM,EAAE,CACtD,CAAC;gBACN,CAAC;YACL,CAAC;QACL,CAAC;QAED,+DAA+D;QAC/D,+DAA+D;QAC/D,kDAAkD;QAClD,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,KAAK,QAAQ,CAAC,MAAM;YACnD,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,IAAI,WAAW,EAAE,CAAC;YACd,IAAI,CAAC,MAAM;gBAAE,OAAO;YACpB,MAAM,OAAO,GAAG,OAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC1C,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;gBAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAAC,OAAO;YAAC,CAAC;YACjD,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,OAAO,KAAK,SAAS,IAAI,OAAQ,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC;gBAAE,OAAO;YAC9E,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YAC/B,IAAI,CAAC,MAAM;gBAAE,KAAK,MAAM,CAAC,IAAI,QAAQ;oBAAE,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7D,OAAO;QACX,CAAC;QAED,iEAAiE;QACjE,sEAAsE;QACtE,KAAK,MAAM,CAAC,IAAI,QAAQ;YAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,gBAAgB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC3E,IAAI,MAAM,EAAE,CAAC;YACT,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;iBAClD,CAAC;gBACF,MAAM,IAAI,GAAG,OAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;gBACvC,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;oBAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBAAC,OAAO;gBAAC,CAAC;gBAC9C,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAChC,CAAC;QACL,CAAC;QACD,KAAK,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,WAAW,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,gBAAgB,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;;YAChD,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC1C,CAAC,CAAC;IAEF,MAAM,KAAK,GAAG,GAAS,EAAE;QACrB,OAAO,CAAC,KAAK,EAAE,CAAC;QAChB,gBAAgB,CAAC,KAAK,EAAE,CAAC;QACzB,UAAU,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,MAAM,EAAE,CAAC;YACT,SAAS,CAAC,KAAK,EAAE,CAAC;YAClB,WAAW,CAAC,KAAK,EAAE,CAAC;QACxB,CAAC;IACL,CAAC,CAAC;IAEF,MAAM,IAAI,GAAG,CAAC,GAAY,EAAqB,EAAE;QAC7C,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,EAAE,CAAC;QACpC,IAAI,MAAM;YAAE,OAAO,CAAC,MAAgB,CAAC,CAAC;QACtC,8DAA8D;QAC9D,+DAA+D;QAC/D,iEAAiE;QACjE,8DAA8D;QAC9D,2BAA2B;QAC3B,OAAO,iBAAiB,CAAC,CAAC,EAAE,MAAqB,CAAC,CAAC,KAAK,EAAE,CAAC;IAC/D,CAAC,CAAC;IAEF,yEAAyE;IACzE,yDAAyD;IACzD,wEAAwE;IACxE,uEAAuE;IACvE,oEAAoE;IACpE,0CAA0C;IAC1C,EAAE;IACF,qEAAqE;IACrE,wEAAwE;IACxE,qEAAqE;IACrE,gEAAgE;IAChE,MAAM,gBAAgB,GAAG,CAAC,CAAU,EAAW,EAAE;QAC7C,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC1E,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAW,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACnB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACjF,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC;IAEF,MAAM,UAAU,GAAG,CAAC,KAAc,EAAE,GAA4B,EAAW,EAAE;QACzE,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACnB,MAAM,MAAM,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;YACvB,MAAM,CAAC,GAAG,KAAY,CAAC;YACvB,MAAM,CAAC,GAAG,MAAa,CAAC;YACxB,QAAQ,EAAE,EAAE,CAAC;gBACT,KAAK,IAAI;oBAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;wBAAE,OAAO,KAAK,CAAC;oBAAC,MAAM;gBACrD,KAAK,IAAI;oBAAE,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;wBAAE,OAAO,KAAK,CAAC;oBAAC,MAAM;gBACpD,KAAK,GAAG;oBAAG,IAAI,CAAC,CAAC,CAAC,GAAI,CAAC,CAAC;wBAAE,OAAO,KAAK,CAAC;oBAAC,MAAM;gBAC9C,KAAK,IAAI;oBAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;wBAAE,OAAO,KAAK,CAAC;oBAAC,MAAM;gBAC9C,KAAK,GAAG;oBAAG,IAAI,CAAC,CAAC,CAAC,GAAI,CAAC,CAAC;wBAAE,OAAO,KAAK,CAAC;oBAAC,MAAM;gBAC9C,KAAK,IAAI;oBAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;wBAAE,OAAO,KAAK,CAAC;oBAAC,MAAM;YAClD,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC;IAEF,MAAM,SAAS,GAAG,OAAO,KAAK,CAAC,GAAG,KAAK,QAAQ,IAAI,OAAO,KAAK,CAAC,GAAG,KAAK,UAAU,CAAC;IAEnF,MAAM,UAAU,GAAG,CAAC,WAAoB,EAAE,GAAY,EAAW,EAAE;QAC/D,IAAI,SAAS,EAAE,CAAC;YACZ,IAAI,gBAAgB,CAAC,GAAG,CAAC;gBAAE,OAAO,UAAU,CAAC,WAAW,EAAE,GAA8B,CAAC,CAAC;YAC1F,OAAO,MAAM,CAAC,EAAE,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;QACvC,CAAC;QACD,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAChF,KAAK,MAAM,KAAK,IAAI,GAA8B,EAAE,CAAC;YACjD,MAAM,SAAS,GAAI,GAA+B,CAAC,KAAK,CAAC,CAAC;YAC1D,MAAM,UAAU,GAAI,WAAuC,CAAC,KAAK,CAAC,CAAC;YACnE,IAAI,gBAAgB,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC9B,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,SAAoC,CAAC;oBAAE,OAAO,KAAK,CAAC;YACpF,CAAC;iBAAM,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,UAAU,EAAE,SAAS,CAAC,EAAE,CAAC;gBAC3C,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC;IAEF,MAAM,SAAS,GAAG,CAAC,GAAY,EAAqB,EAAE;QAClD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,KAAK,MAAM,CAAC,GAAG,EAAE,aAAa,CAAC,IAAI,OAAO,EAAE,CAAC;YACzC,MAAM,WAAW,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9C,IAAI,CAAC,UAAU,CAAC,WAAW,EAAE,GAAG,CAAC;gBAAE,SAAS;YAC5C,IAAI,MAAM,EAAE,CAAC;gBAAC,MAAM,CAAC,GAAG,CAAC,aAAuB,CAAC,CAAC;gBAAC,SAAS;YAAC,CAAC;YAC9D,4DAA4D;YAC5D,2DAA2D;YAC3D,yDAAyD;YACzD,MAAM,GAAG,GAAG,aAA4B,CAAC;YACzC,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;YAC3D,KAAK,MAAM,CAAC,IAAI,OAAO;gBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC;IACvB,CAAC,CAAC;IAEF,MAAM,GAAG,GAAG,CAAC,GAAY,EAAiB,EAAE;QACxC,IAAI,CAAC,MAAM,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,+DAA+D,CAAC,CAAC;QACrF,CAAC;QACD,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9B,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,MAAiB,CAAC;IAC5D,CAAC,CAAC;IAEF,MAAM,oBAAoB,GAAG,CACzB,MAAyC,EACzC,aAA4B,EACf,EAAE;QACf,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QACzB,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACnB,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,QAAQ,KAAK,SAAS;gBAAE,SAAS;YACrC,IAAI,aAAa,KAAK,IAAI,IAAI,QAAQ,KAAK,aAAa;gBAAE,SAAS;YACnE,OAAO,QAAkB,CAAC;QAC9B,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC;IAEF,OAAO;QACH,MAAM;QACN,WAAW;QACX,MAAM;QACN,GAAG,EAAE,KAAK,CAAC,GAAG;QACd,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,GAAG;QACH,MAAM;QACN,MAAM;QACN,KAAK;QACL,IAAI,IAAI,KAAK,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;QACtC,IAAI;QACJ,SAAS;QACT,GAAG,EAAE,GAA0B;QAC/B,oBAAoB;KACvB,CAAC;AACN,CAAC,CAAC"}

package/dist/ecs/database/index-registry/index.d.ts

@@ -0,0 +1,4 @@
+export { createIndex } from "./create-index.js";
+export type { IndexState, RuntimeIndex, IndexKeyDecl, IndexOrderDecl } from "./create-index.js";
+export { createIndexRegistry } from "./create-index-registry.js";
+export type { IndexRegistry, EntityReader, IndexDeclarationObject } from "./create-index-registry.js";

package/dist/ecs/database/index-registry/index.js

@@ -0,0 +1,4 @@
+// © 2026 Adobe. MIT License. See /LICENSE for details.
+export { createIndex } from "./create-index.js";
+export { createIndexRegistry } from "./create-index-registry.js";
+//# sourceMappingURL=index.js.map

package/dist/ecs/database/index-registry/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/ecs/database/index-registry/index.ts"],"names":[],"mappings":"AAAA,uDAAuD;AAEvD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAEhD,OAAO,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC"}

package/dist/ecs/database/index.d.ts

@@ -1,5 +1,6 @@
 export * from "./public/create-database.js";
 export * from "./public/observe-select-deep.js";
+export * from "./concurrency/index.js";
 export * from "./reconciling/create-reconciling-database.js";
 export * from "./reconciling/reconciling-database.js";
 export * from "./reconciling/reconciling-entry.js";

package/dist/ecs/database/index.js

@@ -1,6 +1,7 @@
 // © 2026 Adobe. MIT License. See /LICENSE for details.
 export * from "./public/create-database.js";
 export * from "./public/observe-select-deep.js";
+export * from "./concurrency/index.js";
 export * from "./reconciling/create-reconciling-database.js";
 export * from "./reconciling/reconciling-database.js";
 export * from "./reconciling/reconciling-entry.js";

package/dist/ecs/database/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/ecs/database/index.ts"],"names":[],"mappings":"AAAA,uDAAuD;AAEvD,cAAc,6BAA6B,CAAC;AAC5C,cAAc,iCAAiC,CAAC;AAChD,cAAc,8CAA8C,CAAC;AAC7D,cAAc,uCAAuC,CAAC;AACtD,cAAc,oCAAoC,CAAC;AACnD,cAAc,wCAAwC,CAAC;AACvD,cAAc,iCAAiC,CAAC;AAChD,cAAc,eAAe,CAAC;AAC9B,cAAc,8BAA8B,CAAC;AAC7C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,4BAA4B,CAAC;AAE3C,cAAc,sBAAsB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/ecs/database/index.ts"],"names":[],"mappings":"AAAA,uDAAuD;AAEvD,cAAc,6BAA6B,CAAC;AAC5C,cAAc,iCAAiC,CAAC;AAChD,cAAc,wBAAwB,CAAC;AACvC,cAAc,8CAA8C,CAAC;AAC7D,cAAc,uCAAuC,CAAC;AACtD,cAAc,oCAAoC,CAAC;AACnD,cAAc,wCAAwC,CAAC;AACvD,cAAc,iCAAiC,CAAC;AAChD,cAAc,eAAe,CAAC;AAC9B,cAAc,8BAA8B,CAAC;AAC7C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,4BAA4B,CAAC;AAE3C,cAAc,sBAAsB,CAAC"}

package/dist/ecs/database/observe-index-entities.d.ts

@@ -0,0 +1,26 @@
+import { Observe } from "../../observe/index.js";
+import { Entity } from "../entity/entity.js";
+import { TransactionResult } from "./transactional-store/transactional-store.js";
+/**
+ * Reactive counterpart to an index handle's `find`. Mirrors
+ * {@link observeSelectEntities}: the initial value is emitted synchronously on
+ * subscribe, and subsequent values are emitted on a microtask after any
+ * transaction whose changed components intersect the index's read columns —
+ * the same commit boundary every other observer in the database fires on.
+ *
+ * Why route through transactions rather than notifying inside the index's own
+ * `add` / `remove` / `update`: those run *during* a transaction body, once per
+ * mutated entity, before the transaction commits. Emitting there would fire
+ * observers mid-transaction against half-applied state and at a different
+ * cadence than `db.observe.select`. Recomputing `find(arg)` at the commit
+ * boundary instead coalesces a whole transaction into one emission and keeps
+ * index reactivity consistent with the rest of the system.
+ *
+ * Bucket precision ("don't emit when an unrelated bucket changed") falls out
+ * of comparing the freshly-recomputed entity sequence against the last emitted
+ * one: an unrelated change recomputes to an identical sequence and is
+ * suppressed, while a reorder *within* the observed bucket — the regression
+ * case the index `find` already handles but a `where`-only `observe.select`
+ * silently swallows — produces a different sequence and is emitted.
+ */
+export declare const observeIndexEntities: (observeTransactions: Observe<TransactionResult<any>>) => (find: (arg: unknown) => readonly Entity[], readColumns: readonly string[]) => (arg: unknown) => Observe<readonly Entity[]>;