joist-core 2.3.0 → 2.4.0-next.2

package/build/IndexManager.js

@@ -1,225 +1,176 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.IndexManager = exports.indexThreshold = void 0;
-const Entity_1 = require("./Entity");
-const EntityMetadata_1 = require("./EntityMetadata");
-const relations_1 = require("./relations");
-const utils_1 = require("./utils");
-const emptySet = new Set();
-// The test reproducing a n^2 with n=500 went from 100ms to 50ms if indexed
-exports.indexThreshold = 500;
+import { isLoadedReference } from "./relations/Reference.js";
+import "./relations/index.js";
+import { groupBy } from "./utils.js";
+import { getMetadata } from "./EntityMetadata.js";
+import { isEntity } from "./Entity.js";
+//#region src/IndexManager.ts
+const emptySet = /* @__PURE__ */ new Set();
+const indexThreshold = 500;
 /**
- * IndexManager provides field-based indexing for entity queries to avoid O(n) linear scans of `em.entities`.
- *
- * Key features:
- * - Only indexes entity types with >1000 entities to avoid overhead for small datasets
- * - Supports dual indexing for m2o/poly fields (by ID for saved, by instance for unsaved)
- * - Automatically maintains indexes when fields are updated via setField()
- */
-class IndexManager {
-    #indexes = new Map();
-    /** @return if we should index entities of this type/count. */
-    shouldIndexType(entityCount) {
-        return entityCount >= exports.indexThreshold;
-    }
-    /** Visible for testing. */
-    isIndexed(tagName) {
-        return this.#indexes.has(tagName);
-    }
-    /** Enables indexing for an entity type and builds indexes for the requested fields. */
-    enableIndexingForType(meta, entities, where) {
-        const { tagName } = meta;
-        if (!this.#indexes.has(tagName)) {
-            this.#indexes.set(tagName, new Map());
-        }
-        const fieldNames = Object.keys(where);
-        const fieldIndexes = this.#indexes.get(tagName);
-        const missingFieldNames = fieldNames.filter((fieldName) => !fieldIndexes.has(fieldName));
-        if (missingFieldNames.length === 0)
-            return;
-        // If subtypes are involved, group by each subtype
-        if (meta.baseType || meta.subTypes.length > 0) {
-            [...(0, utils_1.groupBy)(entities, (e) => (0, EntityMetadata_1.getMetadata)(e)).entries()].forEach(([meta, entities]) => {
-                this.addEntitiesToIndex(meta, entities, missingFieldNames);
-            });
-        }
-        else {
-            this.addEntitiesToIndex(meta, entities, missingFieldNames);
-        }
-    }
-    /** Updates indexes when a field value changes. */
-    maybeUpdateFieldIndex(entity, fieldName, oldValue, newValue) {
-        // Fast return for the common case, which is no indexing
-        if (this.#indexes.size === 0)
-            return;
-        const meta = (0, EntityMetadata_1.getMetadata)(entity);
-        const fieldIndexes = this.#indexes.get(meta.tagName);
-        if (!fieldIndexes)
-            return; // Type not indexed
-        const fieldIndex = fieldIndexes.get(fieldName)?.index;
-        if (!fieldIndex)
-            return; // Field is not indexed
-        fieldIndex.remove(oldValue, entity);
-        fieldIndex.add(newValue, entity);
-    }
-    /**
-     * Finds entities matching the given where clause using indexes.
-     * Returns null if the type is not indexed (fallback to linear search).
-     */
-    findMatching(meta, entities, where) {
-        const { tagName } = meta;
-        if (!this.#indexes.has(tagName)) {
-            throw new Error(`${meta.type} is not indexed`);
-        }
-        const fieldIndexes = this.#indexes.get(tagName);
-        // Start with all entities of the 1st condition, then intersect (AND) each subsequent field in `where`
-        let candidates;
-        for (const [fieldName, value] of Object.entries(where)) {
-            this.indexUnindexedEntities(entities, fieldName);
-            const fieldCandidates = fieldIndexes.get(fieldName)?.index.get(value);
-            if (!candidates) {
-                candidates = fieldCandidates ?? emptySet; // This is the 1st clause
-            }
-            else {
-                candidates = fieldCandidates ? intersectSets(candidates, fieldCandidates) : emptySet;
-            }
-            // Early exit if no candidates remain
-            if (candidates.size === 0)
-                break;
-        }
-        if (candidates === undefined) {
-            throw new Error(`Expected where clause with at least one condition`);
-        }
-        return [...candidates];
-    }
-    // `entities` should all be of the exact same subtype
-    addEntitiesToIndex(meta, entities, fieldNames) {
-        const { tagName } = meta;
-        const indexes = this.#indexes.get(tagName);
-        // Iterate over each field so we can do a shared fieldIndex lookup
-        for (const fieldName of fieldNames) {
-            const field = meta.allFields[fieldName];
-            if (!field)
-                continue;
-            let entry = indexes.get(fieldName);
-            if (!entry) {
-                entry = { field, index: new FieldIndex(), indexedCount: 0 };
-                indexes.set(fieldName, entry);
-            }
-            for (const entity of entities) {
-                const value = getFieldValue(entity, fieldName, entry.field);
-                entry.index.add(value, entity);
-            }
-            entry.indexedCount = entities.length;
-        }
-    }
-    /** Lazily indexes newly-registered entities only for fields that are queried. */
-    indexUnindexedEntities(entities, fieldName) {
-        const first = entities[0];
-        if (first === undefined)
-            return;
-        const meta = (0, EntityMetadata_1.getMetadata)(first);
-        const entry = this.#indexes.get(meta.tagName)?.get(fieldName);
-        if (entry === undefined || entry.indexedCount === entities.length)
-            return;
-        for (let i = entry.indexedCount; i < entities.length; i++) {
-            const entity = entities[i];
-            const value = getFieldValue(entity, fieldName, entry.field);
-            entry.index.add(value, entity);
-        }
-        entry.indexedCount = entities.length;
-    }
-}
-exports.IndexManager = IndexManager;
-// Use the same field access pattern as entityMatches
+* IndexManager provides field-based indexing for entity queries to avoid O(n) linear scans of `em.entities`.
+*
+* Key features:
+* - Only indexes entity types with >1000 entities to avoid overhead for small datasets
+* - Supports dual indexing for m2o/poly fields (by ID for saved, by instance for unsaved)
+* - Automatically maintains indexes when fields are updated via setField()
+*/
+var IndexManager = class {
+	#indexes = /* @__PURE__ */ new Map();
+	/** @return if we should index entities of this type/count. */
+	shouldIndexType(entityCount) {
+		return entityCount >= 500;
+	}
+	/** Visible for testing. */
+	isIndexed(tagName) {
+		return this.#indexes.has(tagName);
+	}
+	/** Enables indexing for an entity type and builds indexes for the requested fields. */
+	enableIndexingForType(meta, entities, where) {
+		const { tagName } = meta;
+		if (!this.#indexes.has(tagName)) this.#indexes.set(tagName, /* @__PURE__ */ new Map());
+		const fieldNames = Object.keys(where);
+		const fieldIndexes = this.#indexes.get(tagName);
+		const missingFieldNames = fieldNames.filter((fieldName) => !fieldIndexes.has(fieldName));
+		if (missingFieldNames.length === 0) return;
+		if (meta.baseType || meta.subTypes.length > 0) [...groupBy(entities, (e) => getMetadata(e)).entries()].forEach(([meta, entities]) => {
+			this.addEntitiesToIndex(meta, entities, missingFieldNames);
+		});
+		else this.addEntitiesToIndex(meta, entities, missingFieldNames);
+	}
+	/** Updates indexes when a field value changes. */
+	maybeUpdateFieldIndex(entity, fieldName, oldValue, newValue) {
+		if (this.#indexes.size === 0) return;
+		const meta = getMetadata(entity);
+		const fieldIndexes = this.#indexes.get(meta.tagName);
+		if (!fieldIndexes) return;
+		const fieldIndex = fieldIndexes.get(fieldName)?.index;
+		if (!fieldIndex) return;
+		fieldIndex.remove(oldValue, entity);
+		fieldIndex.add(newValue, entity);
+	}
+	/**
+	* Finds entities matching the given where clause using indexes.
+	*
+	* Returns the raw candidate set (possibly a live internal index set, so do not mutate it);
+	* the caller applies its own subtype/deleted filtering while building the final array.
+	*/
+	findMatching(meta, entities, where) {
+		const { tagName } = meta;
+		if (!this.#indexes.has(tagName)) throw new Error(`${meta.type} is not indexed`);
+		const fieldIndexes = this.#indexes.get(tagName);
+		let candidates;
+		for (const [fieldName, value] of Object.entries(where)) {
+			this.indexUnindexedEntities(entities, fieldName);
+			const fieldCandidates = fieldIndexes.get(fieldName)?.index.get(value);
+			if (!candidates) candidates = fieldCandidates ?? emptySet;
+			else candidates = fieldCandidates ? intersectSets(candidates, fieldCandidates) : emptySet;
+			if (candidates.size === 0) break;
+		}
+		if (candidates === void 0) throw new Error(`Expected where clause with at least one condition`);
+		return candidates;
+	}
+	addEntitiesToIndex(meta, entities, fieldNames) {
+		const { tagName } = meta;
+		const indexes = this.#indexes.get(tagName);
+		for (const fieldName of fieldNames) {
+			const field = meta.allFields[fieldName];
+			if (!field) continue;
+			let entry = indexes.get(fieldName);
+			if (!entry) {
+				entry = {
+					field,
+					index: new FieldIndex(),
+					indexedCount: 0
+				};
+				indexes.set(fieldName, entry);
+			}
+			for (const entity of entities) {
+				if (entity.isDeletedEntity) continue;
+				const value = getFieldValue(entity, fieldName, entry.field);
+				entry.index.add(value, entity);
+			}
+			entry.indexedCount = entities.length;
+		}
+	}
+	/** Lazily indexes newly-registered entities only for fields that are queried. */
+	indexUnindexedEntities(entities, fieldName) {
+		const first = entities[0];
+		if (first === void 0) return;
+		const meta = getMetadata(first);
+		const entry = this.#indexes.get(meta.tagName)?.get(fieldName);
+		if (entry === void 0 || entry.indexedCount === entities.length) return;
+		for (let i = entry.indexedCount; i < entities.length; i++) {
+			const entity = entities[i];
+			if (entity.isDeletedEntity) continue;
+			const value = getFieldValue(entity, fieldName, entry.field);
+			entry.index.add(value, entity);
+		}
+		entry.indexedCount = entities.length;
+	}
+};
 function getFieldValue(entity, fieldName, field) {
-    const fn = fieldName;
-    switch (field.kind) {
-        case "primaryKey":
-            return entity.idTaggedMaybe;
-        case "enum":
-        case "primitive":
-            return entity[fn];
-        case "m2o":
-        case "poly":
-            const relation = entity[fn];
-            if ((0, relations_1.isLoadedReference)(relation)) {
-                return relation.get;
-            }
-            else if (relation.isSet) {
-                return relation.id;
-            }
-            else {
-                return undefined;
-            }
-        default:
-            return undefined;
-    }
+	const fn = fieldName;
+	switch (field.kind) {
+		case "primaryKey": return entity.idTaggedMaybe;
+		case "enum":
+		case "primitive": return entity[fn];
+		case "m2o":
+		case "poly":
+			const relation = entity[fn];
+			if (isLoadedReference(relation)) return relation.get;
+			else if (relation.isSet) return relation.id;
+			else return;
+		default: return;
+	}
 }
 /**
- * For a given field, like `firstName`, holds the reverse index of value `bob` -> entities `[a1, a2]`.
- *
- * This also handles indexes `Entity` values as both instances & IDs, to handle both:
- * - new/unpersisted entities not yet having IDs, and
- * - relations not having loaded their instances yet
- */
-class FieldIndex {
-    #valueToEntities = new Map();
-    /** @return entities that have `value` as their current value for this field. */
-    get(value) {
-        if ((0, Entity_1.isEntity)(value) && value.idTaggedMaybe) {
-            // If `value` is a persisted entity like `a:1`, and entities could have indexed their `author_id=a:1` field
-            // values as the unloaded "just an a:1 string id" value, before `a:1` was loaded into memory.
-            const matchId = this.#valueToEntities.get(value.idTaggedMaybe);
-            // But other entities could also have indexes `a:1` as an instance, so go ahead and check both
-            const matchInstance = this.#valueToEntities.get(value);
-            if (matchId && matchInstance) {
-                return new Set([...matchId, ...matchInstance]);
-            }
-            return matchId ?? matchInstance;
-        }
-        // Treat null and undefined as equivalent for unset relations
-        if (value === null)
-            value = undefined;
-        return this.#valueToEntities.get(value);
-    }
-    add(value, entity) {
-        // If this is an entity, store both the entity itself & its ID
-        if ((0, Entity_1.isEntity)(value) && value.idTaggedMaybe) {
-            this.doAdd(value.idTaggedMaybe, entity);
-        }
-        this.doAdd(value, entity);
-    }
-    remove(value, entity) {
-        if ((0, Entity_1.isEntity)(value) && value.idTaggedMaybe) {
-            this.doRemove(value.idTaggedMaybe, entity);
-        }
-        this.doRemove(value, entity);
-    }
-    doAdd(value, entity) {
-        const set = this.#valueToEntities.get(value) ?? new Set();
-        if (set.size === 0)
-            this.#valueToEntities.set(value, set);
-        set.add(entity);
-    }
-    doRemove(value, entity) {
-        const set = this.#valueToEntities.get(value);
-        if (set) {
-            set.delete(entity);
-            if (set.size === 0) {
-                this.#valueToEntities.delete(value);
-            }
-        }
-    }
-}
+* For a given field, like `firstName`, holds the reverse index of value `bob` -> entities `[a1, a2]`.
+*
+* This also handles indexes `Entity` values as both instances & IDs, to handle both:
+* - new/unpersisted entities not yet having IDs, and
+* - relations not having loaded their instances yet
+*/
+var FieldIndex = class {
+	#valueToEntities = /* @__PURE__ */ new Map();
+	/** @return entities that have `value` as their current value for this field. */
+	get(value) {
+		if (isEntity(value) && value.idTaggedMaybe) {
+			const matchId = this.#valueToEntities.get(value.idTaggedMaybe);
+			const matchInstance = this.#valueToEntities.get(value);
+			if (matchId && matchInstance) return /* @__PURE__ */ new Set([...matchId, ...matchInstance]);
+			return matchId ?? matchInstance;
+		}
+		if (value === null) value = void 0;
+		return this.#valueToEntities.get(value);
+	}
+	add(value, entity) {
+		if (isEntity(value) && value.idTaggedMaybe) this.doAdd(value.idTaggedMaybe, entity);
+		this.doAdd(value, entity);
+	}
+	remove(value, entity) {
+		if (isEntity(value) && value.idTaggedMaybe) this.doRemove(value.idTaggedMaybe, entity);
+		this.doRemove(value, entity);
+	}
+	doAdd(value, entity) {
+		const set = this.#valueToEntities.get(value) ?? /* @__PURE__ */ new Set();
+		if (set.size === 0) this.#valueToEntities.set(value, set);
+		set.add(entity);
+	}
+	doRemove(value, entity) {
+		const set = this.#valueToEntities.get(value);
+		if (set) {
+			set.delete(entity);
+			if (set.size === 0) this.#valueToEntities.delete(value);
+		}
+	}
+};
 function intersectSets(set1, set2) {
-    const [smaller, larger] = set1.size <= set2.size ? [set1, set2] : [set2, set1];
-    const result = new Set();
-    for (const item of smaller) {
-        if (larger.has(item)) {
-            result.add(item);
-        }
-    }
-    return result;
+	const [smaller, larger] = set1.size <= set2.size ? [set1, set2] : [set2, set1];
+	const result = /* @__PURE__ */ new Set();
+	for (const item of smaller) if (larger.has(item)) result.add(item);
+	return result;
 }
+//#endregion
+export { IndexManager, indexThreshold };
+
 //# sourceMappingURL=IndexManager.js.map

package/build/IndexManager.js.map

@@ -1 +1 @@
-{"version":3,"file":"IndexManager.js","sourceRoot":"","sources":["../src/IndexManager.ts"],"names":[],"mappings":";;;AAAA,qCAA4C;AAC5C,qDAA2E;AAC3E,2CAA0F;AAC1F,mCAAkC;AAWlC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;AAEnC,2EAA2E;AAC9D,QAAA,cAAc,GAAG,GAAG,CAAC;AAElC;;;;;;;GAOG;AACH,MAAa,YAAY;IACd,QAAQ,GAAoD,IAAI,GAAG,EAAE,CAAC;IAE/E,8DAA8D;IAC9D,eAAe,CAAC,WAAmB;QACjC,OAAO,WAAW,IAAI,sBAAc,CAAC;IACvC,CAAC;IAED,2BAA2B;IAC3B,SAAS,CAAC,OAAe;QACvB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAED,uFAAuF;IACvF,qBAAqB,CAAmB,IAAuB,EAAE,QAAa,EAAE,KAAa;QAC3F,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACxC,CAAC;QAED,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;QACjD,MAAM,iBAAiB,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;QACzF,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAE3C,kDAAkD;QAClD,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,CAAC,GAAG,IAAA,eAAO,EAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,4BAAW,EAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,EAAE;gBACnF,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;YAC7D,CAAC,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC;IAED,kDAAkD;IAClD,qBAAqB,CAAC,MAAc,EAAE,SAAiB,EAAE,QAAa,EAAE,QAAa;QACnF,wDAAwD;QACxD,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO;QAErC,MAAM,IAAI,GAAG,IAAA,4BAAW,EAAC,MAAM,CAAC,CAAC;QACjC,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACrD,IAAI,CAAC,YAAY;YAAE,OAAO,CAAC,mBAAmB;QAE9C,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC;QACtD,IAAI,CAAC,UAAU;YAAE,OAAO,CAAC,uBAAuB;QAEhD,UAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACpC,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IACnC,CAAC;IAED;;;OAGG;IACH,YAAY,CAAmB,IAAuB,EAAE,QAAa,EAAE,KAAU;QAC/E,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,iBAAiB,CAAC,CAAC;QACjD,CAAC;QACD,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;QACjD,sGAAsG;QACtG,IAAI,UAAmC,CAAC;QACxC,KAAK,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACvD,IAAI,CAAC,sBAAsB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YACjD,MAAM,eAAe,GAAG,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACtE,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,UAAU,GAAG,eAAe,IAAI,QAAQ,CAAC,CAAC,yBAAyB;YACrE,CAAC;iBAAM,CAAC;gBACN,UAAU,GAAG,eAAe,CAAC,CAAC,CAAC,aAAa,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;YACvF,CAAC;YACD,qCAAqC;YACrC,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC;gBAAE,MAAM;QACnC,CAAC;QACD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,CAAC,GAAG,UAAU,CAAQ,CAAC;IAChC,CAAC;IAED,qDAAqD;IAC7C,kBAAkB,CAAC,IAAoB,EAAE,QAAkB,EAAE,UAAoB;QACvF,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;QAC5C,kEAAkE;QAClE,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,IAAI,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACnC,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,KAAK,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,UAAU,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;gBAC5D,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YAChC,CAAC;YACD,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC9B,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,EAAE,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;gBAC5D,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YACjC,CAAC;YACD,KAAK,CAAC,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC;QACvC,CAAC;IACH,CAAC;IAED,iFAAiF;IACzE,sBAAsB,CAAmB,QAAa,EAAE,SAAiB;QAC/E,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO;QAEhC,MAAM,IAAI,GAAG,IAAA,4BAAW,EAAC,KAAK,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;QAC9D,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,YAAY,KAAK,QAAQ,CAAC,MAAM;YAAE,OAAO;QAE1E,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1D,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,EAAE,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;YAC5D,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACjC,CAAC;QACD,KAAK,CAAC,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC;IACvC,CAAC;CACF;AArHD,oCAqHC;AAED,qDAAqD;AACrD,SAAS,aAAa,CAAC,MAAc,EAAE,SAAiB,EAAE,KAAY;IACpE,MAAM,EAAE,GAAG,SAAyB,CAAC;IACrC,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,YAAY;YACf,OAAO,MAAM,CAAC,aAAa,CAAC;QAC9B,KAAK,MAAM,CAAC;QACZ,KAAK,WAAW;YACd,OAAQ,MAAc,CAAC,EAAE,CAAC,CAAC;QAC7B,KAAK,KAAK,CAAC;QACX,KAAK,MAAM;YACT,MAAM,QAAQ,GAAI,MAAc,CAAC,EAAE,CAEO,CAAC;YAC3C,IAAI,IAAA,6BAAiB,EAAC,QAAQ,CAAC,EAAE,CAAC;gBAChC,OAAO,QAAQ,CAAC,GAAG,CAAC;YACtB,CAAC;iBAAM,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;gBAC1B,OAAO,QAAQ,CAAC,EAAE,CAAC;YACrB,CAAC;iBAAM,CAAC;gBACN,OAAO,SAAS,CAAC;YACnB,CAAC;QACH;YACE,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU;IACL,gBAAgB,GAAG,IAAI,GAAG,EAA2B,CAAC;IAE/D,gFAAgF;IAChF,GAAG,CAAC,KAAU;QACZ,IAAI,IAAA,iBAAQ,EAAC,KAAK,CAAC,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YAC3C,2GAA2G;YAC3G,6FAA6F;YAC7F,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAC/D,8FAA8F;YAC9F,MAAM,aAAa,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACvD,IAAI,OAAO,IAAI,aAAa,EAAE,CAAC;gBAC7B,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC;YACjD,CAAC;YACD,OAAO,OAAO,IAAI,aAAa,CAAC;QAClC,CAAC;QACD,6DAA6D;QAC7D,IAAI,KAAK,KAAK,IAAI;YAAE,KAAK,GAAG,SAAS,CAAC;QACtC,OAAO,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IAED,GAAG,CAAC,KAAU,EAAE,MAAc;QAC5B,8DAA8D;QAC9D,IAAI,IAAA,iBAAQ,EAAC,KAAK,CAAC,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YAC3C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QAC1C,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,CAAC,KAAU,EAAE,MAAc;QAC/B,IAAI,IAAA,iBAAQ,EAAC,KAAK,CAAC,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YAC3C,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC/B,CAAC;IAEO,KAAK,CAAC,KAAU,EAAE,MAAc;QACtC,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QAC1D,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC1D,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAClB,CAAC;IAEO,QAAQ,CAAC,KAAU,EAAE,MAAc;QACzC,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC7C,IAAI,GAAG,EAAE,CAAC;YACR,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACnB,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAED,SAAS,aAAa,CAAI,IAAY,EAAE,IAAY;IAClD,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC/E,MAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}
+{"version":3,"file":"IndexManager.js","names":["#indexes","#valueToEntities"],"sources":["../src/IndexManager.ts"],"sourcesContent":["import { type Entity, isEntity } from \"src/Entity.ts\";\nimport { type EntityMetadata, type Field, getMetadata } from \"src/EntityMetadata.ts\";\nimport { type ManyToOneReference, type PolymorphicReference, isLoadedReference } from \"src/relations/index.ts\";\nimport { groupBy } from \"src/utils.ts\";\n\ntype FieldValue = any;\ntype FieldName = string;\ntype EntityTag = string;\ntype FieldIndexEntry = {\n  field: Field;\n  index: FieldIndex;\n  /** Tracks how far into the EM's list-per-tag array this field index has been lazily populated. */\n  indexedCount: number;\n};\nconst emptySet = new Set<Entity>();\n\n// The test reproducing a n^2 with n=500 went from 100ms to 50ms if indexed\nexport const indexThreshold = 500;\n\n/**\n * IndexManager provides field-based indexing for entity queries to avoid O(n) linear scans of `em.entities`.\n *\n * Key features:\n * - Only indexes entity types with >1000 entities to avoid overhead for small datasets\n * - Supports dual indexing for m2o/poly fields (by ID for saved, by instance for unsaved)\n * - Automatically maintains indexes when fields are updated via setField()\n */\nexport class IndexManager {\n  readonly #indexes: Map<EntityTag, Map<FieldName, FieldIndexEntry>> = new Map();\n\n  /** @return if we should index entities of this type/count. */\n  shouldIndexType(entityCount: number): boolean {\n    return entityCount >= indexThreshold;\n  }\n\n  /** Visible for testing. */\n  isIndexed(tagName: string): boolean {\n    return this.#indexes.has(tagName);\n  }\n\n  /** Enables indexing for an entity type and builds indexes for the requested fields. */\n  enableIndexingForType<T extends Entity>(meta: EntityMetadata<T>, entities: T[], where: object): void {\n    const { tagName } = meta;\n    if (!this.#indexes.has(tagName)) {\n      this.#indexes.set(tagName, new Map());\n    }\n\n    const fieldNames = Object.keys(where);\n    const fieldIndexes = this.#indexes.get(tagName)!;\n    const missingFieldNames = fieldNames.filter((fieldName) => !fieldIndexes.has(fieldName));\n    if (missingFieldNames.length === 0) return;\n\n    // If subtypes are involved, group by each subtype\n    if (meta.baseType || meta.subTypes.length > 0) {\n      [...groupBy(entities, (e) => getMetadata(e)).entries()].forEach(([meta, entities]) => {\n        this.addEntitiesToIndex(meta, entities, missingFieldNames);\n      });\n    } else {\n      this.addEntitiesToIndex(meta, entities, missingFieldNames);\n    }\n  }\n\n  /** Updates indexes when a field value changes. */\n  maybeUpdateFieldIndex(entity: Entity, fieldName: string, oldValue: any, newValue: any): void {\n    // Fast return for the common case, which is no indexing\n    if (this.#indexes.size === 0) return;\n\n    const meta = getMetadata(entity);\n    const fieldIndexes = this.#indexes.get(meta.tagName);\n    if (!fieldIndexes) return; // Type not indexed\n\n    const fieldIndex = fieldIndexes.get(fieldName)?.index;\n    if (!fieldIndex) return; // Field is not indexed\n\n    fieldIndex.remove(oldValue, entity);\n    fieldIndex.add(newValue, entity);\n  }\n\n  /**\n   * Finds entities matching the given where clause using indexes.\n   *\n   * Returns the raw candidate set (possibly a live internal index set, so do not mutate it);\n   * the caller applies its own subtype/deleted filtering while building the final array.\n   */\n  findMatching<T extends Entity>(meta: EntityMetadata<T>, entities: T[], where: any): ReadonlySet<T> {\n    const { tagName } = meta;\n    if (!this.#indexes.has(tagName)) {\n      throw new Error(`${meta.type} is not indexed`);\n    }\n    const fieldIndexes = this.#indexes.get(tagName)!;\n    // Start with all entities of the 1st condition, then intersect (AND) each subsequent field in `where`\n    let candidates: Set<Entity> | undefined;\n    for (const [fieldName, value] of Object.entries(where)) {\n      this.indexUnindexedEntities(entities, fieldName);\n      const fieldCandidates = fieldIndexes.get(fieldName)?.index.get(value);\n      if (!candidates) {\n        candidates = fieldCandidates ?? emptySet; // This is the 1st clause\n      } else {\n        candidates = fieldCandidates ? intersectSets(candidates, fieldCandidates) : emptySet;\n      }\n      // Early exit if no candidates remain\n      if (candidates.size === 0) break;\n    }\n    if (candidates === undefined) {\n      throw new Error(`Expected where clause with at least one condition`);\n    }\n    return candidates as unknown as ReadonlySet<T>;\n  }\n\n  // `entities` should all be of the exact same subtype\n  private addEntitiesToIndex(meta: EntityMetadata, entities: Entity[], fieldNames: string[]): void {\n    const { tagName } = meta;\n    const indexes = this.#indexes.get(tagName)!;\n    // Iterate over each field so we can do a shared fieldIndex lookup\n    for (const fieldName of fieldNames) {\n      const field = meta.allFields[fieldName];\n      if (!field) continue;\n      let entry = indexes.get(fieldName);\n      if (!entry) {\n        entry = { field, index: new FieldIndex(), indexedCount: 0 };\n        indexes.set(fieldName, entry);\n      }\n      for (const entity of entities) {\n        // Deleted entities never match, and reading a flushed one's relations throws\n        if (entity.isDeletedEntity) continue;\n        const value = getFieldValue(entity, fieldName, entry.field);\n        entry.index.add(value, entity);\n      }\n      entry.indexedCount = entities.length;\n    }\n  }\n\n  /** Lazily indexes newly-registered entities only for fields that are queried. */\n  private indexUnindexedEntities<T extends Entity>(entities: T[], fieldName: string): void {\n    const first = entities[0];\n    if (first === undefined) return;\n\n    const meta = getMetadata(first);\n    const entry = this.#indexes.get(meta.tagName)?.get(fieldName);\n    if (entry === undefined || entry.indexedCount === entities.length) return;\n\n    for (let i = entry.indexedCount; i < entities.length; i++) {\n      const entity = entities[i];\n      if (entity.isDeletedEntity) continue;\n      const value = getFieldValue(entity, fieldName, entry.field);\n      entry.index.add(value, entity);\n    }\n    entry.indexedCount = entities.length;\n  }\n}\n\n// Use the same field access pattern as entityMatches\nfunction getFieldValue(entity: Entity, fieldName: string, field: Field): any {\n  const fn = fieldName as keyof Entity;\n  switch (field.kind) {\n    case \"primaryKey\":\n      return entity.idTaggedMaybe;\n    case \"enum\":\n    case \"primitive\":\n      return (entity as any)[fn];\n    case \"m2o\":\n    case \"poly\":\n      const relation = (entity as any)[fn] as\n        | ManyToOneReference<Entity, any, any>\n        | PolymorphicReference<Entity, any, any>;\n      if (isLoadedReference(relation)) {\n        return relation.get;\n      } else if (relation.isSet) {\n        return relation.id;\n      } else {\n        return undefined;\n      }\n    default:\n      return undefined;\n  }\n}\n\n/**\n * For a given field, like `firstName`, holds the reverse index of value `bob` -> entities `[a1, a2]`.\n *\n * This also handles indexes `Entity` values as both instances & IDs, to handle both:\n * - new/unpersisted entities not yet having IDs, and\n * - relations not having loaded their instances yet\n */\nclass FieldIndex {\n  readonly #valueToEntities = new Map<FieldValue, Set<Entity>>();\n\n  /** @return entities that have `value` as their current value for this field. */\n  get(value: any): Set<Entity> | undefined {\n    if (isEntity(value) && value.idTaggedMaybe) {\n      // If `value` is a persisted entity like `a:1`, and entities could have indexed their `author_id=a:1` field\n      // values as the unloaded \"just an a:1 string id\" value, before `a:1` was loaded into memory.\n      const matchId = this.#valueToEntities.get(value.idTaggedMaybe);\n      // But other entities could also have indexes `a:1` as an instance, so go ahead and check both\n      const matchInstance = this.#valueToEntities.get(value);\n      if (matchId && matchInstance) {\n        return new Set([...matchId, ...matchInstance]);\n      }\n      return matchId ?? matchInstance;\n    }\n    // Treat null and undefined as equivalent for unset relations\n    if (value === null) value = undefined;\n    return this.#valueToEntities.get(value);\n  }\n\n  add(value: any, entity: Entity): void {\n    // If this is an entity, store both the entity itself & its ID\n    if (isEntity(value) && value.idTaggedMaybe) {\n      this.doAdd(value.idTaggedMaybe, entity);\n    }\n    this.doAdd(value, entity);\n  }\n\n  remove(value: any, entity: Entity): void {\n    if (isEntity(value) && value.idTaggedMaybe) {\n      this.doRemove(value.idTaggedMaybe, entity);\n    }\n    this.doRemove(value, entity);\n  }\n\n  private doAdd(value: any, entity: Entity): void {\n    const set = this.#valueToEntities.get(value) ?? new Set();\n    if (set.size === 0) this.#valueToEntities.set(value, set);\n    set.add(entity);\n  }\n\n  private doRemove(value: any, entity: Entity): void {\n    const set = this.#valueToEntities.get(value);\n    if (set) {\n      set.delete(entity);\n      if (set.size === 0) {\n        this.#valueToEntities.delete(value);\n      }\n    }\n  }\n}\n\nfunction intersectSets<T>(set1: Set<T>, set2: Set<T>): Set<T> {\n  const [smaller, larger] = set1.size <= set2.size ? [set1, set2] : [set2, set1];\n  const result = new Set<T>();\n  for (const item of smaller) {\n    if (larger.has(item)) {\n      result.add(item);\n    }\n  }\n  return result;\n}\n"],"mappings":";;;;;;AAcA,MAAM,2BAAW,IAAI,IAAY;AAGjC,MAAa,iBAAiB;;;;;;;;;AAU9B,IAAa,eAAb,MAA0B;CACxB,2BAAqE,IAAI,IAAI;;CAG7E,gBAAgB,aAA8B;EAC5C,OAAO,eAAA;CACT;;CAGA,UAAU,SAA0B;EAClC,OAAO,KAAKA,SAAS,IAAI,OAAO;CAClC;;CAGA,sBAAwC,MAAyB,UAAe,OAAqB;EACnG,MAAM,EAAE,YAAY;EACpB,IAAI,CAAC,KAAKA,SAAS,IAAI,OAAO,GAC5B,KAAKA,SAAS,IAAI,yBAAS,IAAI,IAAI,CAAC;EAGtC,MAAM,aAAa,OAAO,KAAK,KAAK;EACpC,MAAM,eAAe,KAAKA,SAAS,IAAI,OAAO;EAC9C,MAAM,oBAAoB,WAAW,QAAQ,cAAc,CAAC,aAAa,IAAI,SAAS,CAAC;EACvF,IAAI,kBAAkB,WAAW,GAAG;EAGpC,IAAI,KAAK,YAAY,KAAK,SAAS,SAAS,GAC1C,CAAC,GAAG,QAAQ,WAAW,MAAM,YAAY,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,cAAc;GACpF,KAAK,mBAAmB,MAAM,UAAU,iBAAiB;EAC3D,CAAC;OAED,KAAK,mBAAmB,MAAM,UAAU,iBAAiB;CAE7D;;CAGA,sBAAsB,QAAgB,WAAmB,UAAe,UAAqB;EAE3F,IAAI,KAAKA,SAAS,SAAS,GAAG;EAE9B,MAAM,OAAO,YAAY,MAAM;EAC/B,MAAM,eAAe,KAAKA,SAAS,IAAI,KAAK,OAAO;EACnD,IAAI,CAAC,cAAc;EAEnB,MAAM,aAAa,aAAa,IAAI,SAAS,CAAC,EAAE;EAChD,IAAI,CAAC,YAAY;EAEjB,WAAW,OAAO,UAAU,MAAM;EAClC,WAAW,IAAI,UAAU,MAAM;CACjC;;;;;;;CAQA,aAA+B,MAAyB,UAAe,OAA4B;EACjG,MAAM,EAAE,YAAY;EACpB,IAAI,CAAC,KAAKA,SAAS,IAAI,OAAO,GAC5B,MAAM,IAAI,MAAM,GAAG,KAAK,KAAK,gBAAgB;EAE/C,MAAM,eAAe,KAAKA,SAAS,IAAI,OAAO;EAE9C,IAAI;EACJ,KAAK,MAAM,CAAC,WAAW,UAAU,OAAO,QAAQ,KAAK,GAAG;GACtD,KAAK,uBAAuB,UAAU,SAAS;GAC/C,MAAM,kBAAkB,aAAa,IAAI,SAAS,CAAC,EAAE,MAAM,IAAI,KAAK;GACpE,IAAI,CAAC,YACH,aAAa,mBAAmB;QAEhC,aAAa,kBAAkB,cAAc,YAAY,eAAe,IAAI;GAG9E,IAAI,WAAW,SAAS,GAAG;EAC7B;EACA,IAAI,eAAe,KAAA,GACjB,MAAM,IAAI,MAAM,mDAAmD;EAErE,OAAO;CACT;CAGA,mBAA2B,MAAsB,UAAoB,YAA4B;EAC/F,MAAM,EAAE,YAAY;EACpB,MAAM,UAAU,KAAKA,SAAS,IAAI,OAAO;EAEzC,KAAK,MAAM,aAAa,YAAY;GAClC,MAAM,QAAQ,KAAK,UAAU;GAC7B,IAAI,CAAC,OAAO;GACZ,IAAI,QAAQ,QAAQ,IAAI,SAAS;GACjC,IAAI,CAAC,OAAO;IACV,QAAQ;KAAE;KAAO,OAAO,IAAI,WAAW;KAAG,cAAc;IAAE;IAC1D,QAAQ,IAAI,WAAW,KAAK;GAC9B;GACA,KAAK,MAAM,UAAU,UAAU;IAE7B,IAAI,OAAO,iBAAiB;IAC5B,MAAM,QAAQ,cAAc,QAAQ,WAAW,MAAM,KAAK;IAC1D,MAAM,MAAM,IAAI,OAAO,MAAM;GAC/B;GACA,MAAM,eAAe,SAAS;EAChC;CACF;;CAGA,uBAAiD,UAAe,WAAyB;EACvF,MAAM,QAAQ,SAAS;EACvB,IAAI,UAAU,KAAA,GAAW;EAEzB,MAAM,OAAO,YAAY,KAAK;EAC9B,MAAM,QAAQ,KAAKA,SAAS,IAAI,KAAK,OAAO,CAAC,EAAE,IAAI,SAAS;EAC5D,IAAI,UAAU,KAAA,KAAa,MAAM,iBAAiB,SAAS,QAAQ;EAEnE,KAAK,IAAI,IAAI,MAAM,cAAc,IAAI,SAAS,QAAQ,KAAK;GACzD,MAAM,SAAS,SAAS;GACxB,IAAI,OAAO,iBAAiB;GAC5B,MAAM,QAAQ,cAAc,QAAQ,WAAW,MAAM,KAAK;GAC1D,MAAM,MAAM,IAAI,OAAO,MAAM;EAC/B;EACA,MAAM,eAAe,SAAS;CAChC;AACF;AAGA,SAAS,cAAc,QAAgB,WAAmB,OAAmB;CAC3E,MAAM,KAAK;CACX,QAAQ,MAAM,MAAd;EACE,KAAK,cACH,OAAO,OAAO;EAChB,KAAK;EACL,KAAK,aACH,OAAQ,OAAe;EACzB,KAAK;EACL,KAAK;GACH,MAAM,WAAY,OAAe;GAGjC,IAAI,kBAAkB,QAAQ,GAC5B,OAAO,SAAS;QACX,IAAI,SAAS,OAClB,OAAO,SAAS;QAEhB;EAEJ,SACE;CACJ;AACF;;;;;;;;AASA,IAAM,aAAN,MAAiB;CACf,mCAA4B,IAAI,IAA6B;;CAG7D,IAAI,OAAqC;EACvC,IAAI,SAAS,KAAK,KAAK,MAAM,eAAe;GAG1C,MAAM,UAAU,KAAKC,iBAAiB,IAAI,MAAM,aAAa;GAE7D,MAAM,gBAAgB,KAAKA,iBAAiB,IAAI,KAAK;GACrD,IAAI,WAAW,eACb,uBAAO,IAAI,IAAI,CAAC,GAAG,SAAS,GAAG,aAAa,CAAC;GAE/C,OAAO,WAAW;EACpB;EAEA,IAAI,UAAU,MAAM,QAAQ,KAAA;EAC5B,OAAO,KAAKA,iBAAiB,IAAI,KAAK;CACxC;CAEA,IAAI,OAAY,QAAsB;EAEpC,IAAI,SAAS,KAAK,KAAK,MAAM,eAC3B,KAAK,MAAM,MAAM,eAAe,MAAM;EAExC,KAAK,MAAM,OAAO,MAAM;CAC1B;CAEA,OAAO,OAAY,QAAsB;EACvC,IAAI,SAAS,KAAK,KAAK,MAAM,eAC3B,KAAK,SAAS,MAAM,eAAe,MAAM;EAE3C,KAAK,SAAS,OAAO,MAAM;CAC7B;CAEA,MAAc,OAAY,QAAsB;EAC9C,MAAM,MAAM,KAAKA,iBAAiB,IAAI,KAAK,qBAAK,IAAI,IAAI;EACxD,IAAI,IAAI,SAAS,GAAG,KAAKA,iBAAiB,IAAI,OAAO,GAAG;EACxD,IAAI,IAAI,MAAM;CAChB;CAEA,SAAiB,OAAY,QAAsB;EACjD,MAAM,MAAM,KAAKA,iBAAiB,IAAI,KAAK;EAC3C,IAAI,KAAK;GACP,IAAI,OAAO,MAAM;GACjB,IAAI,IAAI,SAAS,GACf,KAAKA,iBAAiB,OAAO,KAAK;EAEtC;CACF;AACF;AAEA,SAAS,cAAiB,MAAc,MAAsB;CAC5D,MAAM,CAAC,SAAS,UAAU,KAAK,QAAQ,KAAK,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI;CAC7E,MAAM,yBAAS,IAAI,IAAO;CAC1B,KAAK,MAAM,QAAQ,SACjB,IAAI,OAAO,IAAI,IAAI,GACjB,OAAO,IAAI,IAAI;CAGnB,OAAO;AACT"}