joist-core 2.4.0-next.4 → 2.4.0-next.41

package/build/IndexManager.cjs

@@ -3,6 +3,7 @@ const require_relations_Reference = require("./relations/Reference.cjs");
 require("./relations/index.cjs");
 const require_utils = require("./utils.cjs");
 const require_EntityMetadata = require("./EntityMetadata.cjs");
+const require_dataloaders_fastWhereFilterHash = require("./dataloaders/fastWhereFilterHash.cjs");
 const require_Entity = require("./Entity.cjs");
 //#region src/IndexManager.ts
 const emptySet = /* @__PURE__ */ new Set();
@@ -80,7 +81,7 @@ var IndexManager = class {
 			if (!entry) {
 				entry = {
 					field,
-					index: new FieldIndex(),
+					index: new FieldIndex(meta.columns[fieldName]?.isArray ?? false),
 					indexedCount: 0
 				};
 				indexes.set(fieldName, entry);
@@ -132,7 +133,12 @@ function getFieldValue(entity, fieldName, field) {
 * - relations not having loaded their instances yet
 */
 var FieldIndex = class {
+	isArray;
 	#valueToEntities = /* @__PURE__ */ new Map();
+	#arrayToEntities = /* @__PURE__ */ new Map();
+	constructor(isArray) {
+		this.isArray = isArray;
+	}
 	/** @return entities that have `value` as their current value for this field. */
 	get(value) {
 		if (require_Entity.isEntity(value) && value.idTaggedMaybe) {
@@ -142,6 +148,8 @@ var FieldIndex = class {
 			return matchId ?? matchInstance;
 		}
 		if (value === null) value = void 0;
+		const arrayKey = this.maybeArrayKey(value);
+		if (arrayKey !== void 0) return this.#arrayToEntities.get(arrayKey);
 		return this.#valueToEntities.get(value);
 	}
 	add(value, entity) {
@@ -153,17 +161,27 @@ var FieldIndex = class {
 		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);
+		const arrayKey = this.maybeArrayKey(value);
+		const index = arrayKey === void 0 ? this.#valueToEntities : this.#arrayToEntities;
+		const key = arrayKey ?? value;
+		const set = index.get(key) ?? /* @__PURE__ */ new Set();
+		if (set.size === 0) index.set(key, set);
 		set.add(entity);
 	}
 	doRemove(value, entity) {
-		const set = this.#valueToEntities.get(value);
+		const arrayKey = this.maybeArrayKey(value);
+		const index = arrayKey === void 0 ? this.#valueToEntities : this.#arrayToEntities;
+		const key = arrayKey ?? value;
+		const set = index.get(key);
 		if (set) {
 			set.delete(entity);
-			if (set.size === 0) this.#valueToEntities.delete(value);
+			if (set.size === 0) index.delete(key);
 		}
 	}
+	/** Preserves array order and element types, including bigint values that JSON cannot encode. */
+	maybeArrayKey(value) {
+		return this.isArray && Array.isArray(value) ? require_dataloaders_fastWhereFilterHash.fastWhereFilterHash(value) : void 0;
+	}
 };
 function intersectSets(set1, set2) {
 	const [smaller, larger] = set1.size <= set2.size ? [set1, set2] : [set2, set1];

package/build/IndexManager.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"IndexManager.cjs","names":["#indexes","groupBy","getMetadata","isLoadedReference","#valueToEntities","isEntity"],"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,GAAGC,cAAAA,QAAQ,WAAW,MAAMC,uBAAAA,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,KAAKF,SAAS,SAAS,GAAG;EAE9B,MAAM,OAAOE,uBAAAA,YAAY,MAAM;EAC/B,MAAM,eAAe,KAAKF,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,OAAOE,uBAAAA,YAAY,KAAK;EAC9B,MAAM,QAAQ,KAAKF,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,IAAIG,4BAAAA,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,IAAIE,eAAAA,SAAS,KAAK,KAAK,MAAM,eAAe;GAG1C,MAAM,UAAU,KAAKD,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,IAAIC,eAAAA,SAAS,KAAK,KAAK,MAAM,eAC3B,KAAK,MAAM,MAAM,eAAe,MAAM;EAExC,KAAK,MAAM,OAAO,MAAM;CAC1B;CAEA,OAAO,OAAY,QAAsB;EACvC,IAAIA,eAAAA,SAAS,KAAK,KAAK,MAAM,eAC3B,KAAK,SAAS,MAAM,eAAe,MAAM;EAE3C,KAAK,SAAS,OAAO,MAAM;CAC7B;CAEA,MAAc,OAAY,QAAsB;EAC9C,MAAM,MAAM,KAAKD,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"}
+{"version":3,"file":"IndexManager.cjs","names":["groupBy","getMetadata","isLoadedReference","isEntity","fastWhereFilterHash"],"sources":["../src/IndexManager.ts"],"sourcesContent":["import { fastWhereFilterHash } from \"src/dataloaders/fastWhereFilterHash.ts\";\nimport { 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(meta.columns[fieldName]?.isArray ?? false), 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  // Keep serialized arrays separate so their keys cannot collide with scalar string values.\n  readonly #arrayToEntities = new Map<string, Set<Entity>>();\n\n  constructor(private readonly isArray: boolean) {}\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    const arrayKey = this.maybeArrayKey(value);\n    if (arrayKey !== undefined) return this.#arrayToEntities.get(arrayKey);\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 arrayKey = this.maybeArrayKey(value);\n    const index = arrayKey === undefined ? this.#valueToEntities : this.#arrayToEntities;\n    const key = arrayKey ?? value;\n    const set = index.get(key) ?? new Set();\n    if (set.size === 0) index.set(key, set);\n    set.add(entity);\n  }\n\n  private doRemove(value: any, entity: Entity): void {\n    const arrayKey = this.maybeArrayKey(value);\n    const index = arrayKey === undefined ? this.#valueToEntities : this.#arrayToEntities;\n    const key = arrayKey ?? value;\n    const set = index.get(key);\n    if (set) {\n      set.delete(entity);\n      if (set.size === 0) {\n        index.delete(key);\n      }\n    }\n  }\n\n  /** Preserves array order and element types, including bigint values that JSON cannot encode. */\n  private maybeArrayKey(value: unknown): string | undefined {\n    return this.isArray && Array.isArray(value) ? fastWhereFilterHash(value) : undefined;\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":";;;;;;;;AAeA,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,KAAK,SAAS,IAAI,OAAO;CAClC;;CAGA,sBAAwC,MAAyB,UAAe,OAAqB;EACnG,MAAM,EAAE,YAAY;EACpB,IAAI,CAAC,KAAK,SAAS,IAAI,OAAO,GAC5B,KAAK,SAAS,IAAI,yBAAS,IAAI,IAAI,CAAC;EAGtC,MAAM,aAAa,OAAO,KAAK,KAAK;EACpC,MAAM,eAAe,KAAK,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,GAAGA,cAAAA,QAAQ,WAAW,MAAMC,uBAAAA,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,KAAK,SAAS,SAAS,GAAG;EAE9B,MAAM,OAAOA,uBAAAA,YAAY,MAAM;EAC/B,MAAM,eAAe,KAAK,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,KAAK,SAAS,IAAI,OAAO,GAC5B,MAAM,IAAI,MAAM,GAAG,KAAK,KAAK,gBAAgB;EAE/C,MAAM,eAAe,KAAK,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,KAAK,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,KAAK,QAAQ,UAAU,EAAE,WAAW,KAAK;KAAG,cAAc;IAAE;IACnG,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,OAAOA,uBAAAA,YAAY,KAAK;EAC9B,MAAM,QAAQ,KAAK,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,IAAIC,4BAAAA,kBAAkB,QAAQ,GAC5B,OAAO,SAAS;QACX,IAAI,SAAS,OAClB,OAAO,SAAS;QAEhB;EAEJ,SACE;CACJ;AACF;;;;;;;;AASA,IAAM,aAAN,MAAiB;CAKc;CAJ7B,mCAA4B,IAAI,IAA6B;CAE7D,mCAA4B,IAAI,IAAyB;CAEzD,YAAY,SAAmC;EAAlB,KAAA,UAAA;CAAmB;;CAGhD,IAAI,OAAqC;EACvC,IAAIC,eAAAA,SAAS,KAAK,KAAK,MAAM,eAAe;GAG1C,MAAM,UAAU,KAAK,iBAAiB,IAAI,MAAM,aAAa;GAE7D,MAAM,gBAAgB,KAAK,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,MAAM,WAAW,KAAK,cAAc,KAAK;EACzC,IAAI,aAAa,KAAA,GAAW,OAAO,KAAK,iBAAiB,IAAI,QAAQ;EACrE,OAAO,KAAK,iBAAiB,IAAI,KAAK;CACxC;CAEA,IAAI,OAAY,QAAsB;EAEpC,IAAIA,eAAAA,SAAS,KAAK,KAAK,MAAM,eAC3B,KAAK,MAAM,MAAM,eAAe,MAAM;EAExC,KAAK,MAAM,OAAO,MAAM;CAC1B;CAEA,OAAO,OAAY,QAAsB;EACvC,IAAIA,eAAAA,SAAS,KAAK,KAAK,MAAM,eAC3B,KAAK,SAAS,MAAM,eAAe,MAAM;EAE3C,KAAK,SAAS,OAAO,MAAM;CAC7B;CAEA,MAAc,OAAY,QAAsB;EAC9C,MAAM,WAAW,KAAK,cAAc,KAAK;EACzC,MAAM,QAAQ,aAAa,KAAA,IAAY,KAAK,mBAAmB,KAAK;EACpE,MAAM,MAAM,YAAY;EACxB,MAAM,MAAM,MAAM,IAAI,GAAG,qBAAK,IAAI,IAAI;EACtC,IAAI,IAAI,SAAS,GAAG,MAAM,IAAI,KAAK,GAAG;EACtC,IAAI,IAAI,MAAM;CAChB;CAEA,SAAiB,OAAY,QAAsB;EACjD,MAAM,WAAW,KAAK,cAAc,KAAK;EACzC,MAAM,QAAQ,aAAa,KAAA,IAAY,KAAK,mBAAmB,KAAK;EACpE,MAAM,MAAM,YAAY;EACxB,MAAM,MAAM,MAAM,IAAI,GAAG;EACzB,IAAI,KAAK;GACP,IAAI,OAAO,MAAM;GACjB,IAAI,IAAI,SAAS,GACf,MAAM,OAAO,GAAG;EAEpB;CACF;;CAGA,cAAsB,OAAoC;EACxD,OAAO,KAAK,WAAW,MAAM,QAAQ,KAAK,IAAIC,wCAAAA,oBAAoB,KAAK,IAAI,KAAA;CAC7E;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"}

package/build/IndexManager.d.cts

@@ -1,7 +1,7 @@
 import { EntityMetadata } from "./EntityMetadata.cjs";
 import { Entity } from "./Entity.cjs";
 //#region src/IndexManager.d.ts
-declare const indexThreshold = 500;
+export declare const indexThreshold = 500;
 /**
  * IndexManager provides field-based indexing for entity queries to avoid O(n) linear scans of `em.entities`.
  *
@@ -10,7 +10,7 @@ declare const indexThreshold = 500;
  * - Supports dual indexing for m2o/poly fields (by ID for saved, by instance for unsaved)
  * - Automatically maintains indexes when fields are updated via setField()
  */
-declare class IndexManager {
+export declare class IndexManager {
   #private;
   /** @return if we should index entities of this type/count. */
   shouldIndexType(entityCount: number): boolean;
@@ -32,5 +32,4 @@ declare class IndexManager {
   private indexUnindexedEntities;
 }
 //#endregion
-export { IndexManager, indexThreshold };
 //# sourceMappingURL=IndexManager.d.cts.map

package/build/IndexManager.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"IndexManager.d.cts","names":[],"sources":["../src/IndexManager.ts"],"mappings":";;;cAiBa;;;;;;;;;cAUA;;;EAIX,gBAAgB;;EAKhB,UAAU;;EAKV,sBAAsB,UAAU,QAAQ,MAAM,eAAe,IAAI,UAAU,KAAK;;EAsBhF,sBAAsB,QAAQ,QAAQ,mBAAmB,eAAe;;;;;;;EAqBxE,aAAa,UAAU,QAAQ,MAAM,eAAe,IAAI,UAAU,KAAK,aAAa,YAAY;UA0BxF;;UAuBA"}
+{"version":3,"file":"IndexManager.d.cts","names":[],"sources":["../src/IndexManager.ts"],"mappings":";;;qBAkBa;;;;;;;;;qBAUA;;;EAIX,gBAAgB;;EAKhB,UAAU;;EAKV,sBAAsB,UAAU,QAAQ,MAAM,eAAe,IAAI,UAAU,KAAK;;EAsBhF,sBAAsB,QAAQ,QAAQ,mBAAmB,eAAe;;;;;;;EAqBxE,aAAa,UAAU,QAAQ,MAAM,eAAe,IAAI,UAAU,KAAK,aAAa,YAAY;UA0BxF;;UAuBA"}

package/build/IndexManager.d.mts

@@ -1,7 +1,7 @@
 import { EntityMetadata } from "./EntityMetadata.mjs";
 import { Entity } from "./Entity.mjs";
 //#region src/IndexManager.d.ts
-declare const indexThreshold = 500;
+export declare const indexThreshold = 500;
 /**
  * IndexManager provides field-based indexing for entity queries to avoid O(n) linear scans of `em.entities`.
  *
@@ -10,7 +10,7 @@ declare const indexThreshold = 500;
  * - Supports dual indexing for m2o/poly fields (by ID for saved, by instance for unsaved)
  * - Automatically maintains indexes when fields are updated via setField()
  */
-declare class IndexManager {
+export declare class IndexManager {
   #private;
   /** @return if we should index entities of this type/count. */
   shouldIndexType(entityCount: number): boolean;
@@ -32,5 +32,4 @@ declare class IndexManager {
   private indexUnindexedEntities;
 }
 //#endregion
-export { IndexManager, indexThreshold };
 //# sourceMappingURL=IndexManager.d.mts.map

package/build/IndexManager.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"IndexManager.d.mts","names":[],"sources":["../src/IndexManager.ts"],"mappings":";;;cAiBa;;;;;;;;;cAUA;;;EAIX,gBAAgB;;EAKhB,UAAU;;EAKV,sBAAsB,UAAU,QAAQ,MAAM,eAAe,IAAI,UAAU,KAAK;;EAsBhF,sBAAsB,QAAQ,QAAQ,mBAAmB,eAAe;;;;;;;EAqBxE,aAAa,UAAU,QAAQ,MAAM,eAAe,IAAI,UAAU,KAAK,aAAa,YAAY;UA0BxF;;UAuBA"}
+{"version":3,"file":"IndexManager.d.mts","names":[],"sources":["../src/IndexManager.ts"],"mappings":";;;qBAkBa;;;;;;;;;qBAUA;;;EAIX,gBAAgB;;EAKhB,UAAU;;EAKV,sBAAsB,UAAU,QAAQ,MAAM,eAAe,IAAI,UAAU,KAAK;;EAsBhF,sBAAsB,QAAQ,QAAQ,mBAAmB,eAAe;;;;;;;EAqBxE,aAAa,UAAU,QAAQ,MAAM,eAAe,IAAI,UAAU,KAAK,aAAa,YAAY;UA0BxF;;UAuBA"}

package/build/IndexManager.js

@@ -2,6 +2,7 @@ import { isLoadedReference } from "./relations/Reference.js";
 import "./relations/index.js";
 import { groupBy } from "./utils.js";
 import { getMetadata } from "./EntityMetadata.js";
+import { fastWhereFilterHash } from "./dataloaders/fastWhereFilterHash.js";
 import { isEntity } from "./Entity.js";
 //#region src/IndexManager.ts
 const emptySet = /* @__PURE__ */ new Set();
@@ -79,7 +80,7 @@ var IndexManager = class {
 			if (!entry) {
 				entry = {
 					field,
-					index: new FieldIndex(),
+					index: new FieldIndex(meta.columns[fieldName]?.isArray ?? false),
 					indexedCount: 0
 				};
 				indexes.set(fieldName, entry);
@@ -131,7 +132,12 @@ function getFieldValue(entity, fieldName, field) {
 * - relations not having loaded their instances yet
 */
 var FieldIndex = class {
+	isArray;
 	#valueToEntities = /* @__PURE__ */ new Map();
+	#arrayToEntities = /* @__PURE__ */ new Map();
+	constructor(isArray) {
+		this.isArray = isArray;
+	}
 	/** @return entities that have `value` as their current value for this field. */
 	get(value) {
 		if (isEntity(value) && value.idTaggedMaybe) {
@@ -141,6 +147,8 @@ var FieldIndex = class {
 			return matchId ?? matchInstance;
 		}
 		if (value === null) value = void 0;
+		const arrayKey = this.maybeArrayKey(value);
+		if (arrayKey !== void 0) return this.#arrayToEntities.get(arrayKey);
 		return this.#valueToEntities.get(value);
 	}
 	add(value, entity) {
@@ -152,17 +160,27 @@ var FieldIndex = class {
 		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);
+		const arrayKey = this.maybeArrayKey(value);
+		const index = arrayKey === void 0 ? this.#valueToEntities : this.#arrayToEntities;
+		const key = arrayKey ?? value;
+		const set = index.get(key) ?? /* @__PURE__ */ new Set();
+		if (set.size === 0) index.set(key, set);
 		set.add(entity);
 	}
 	doRemove(value, entity) {
-		const set = this.#valueToEntities.get(value);
+		const arrayKey = this.maybeArrayKey(value);
+		const index = arrayKey === void 0 ? this.#valueToEntities : this.#arrayToEntities;
+		const key = arrayKey ?? value;
+		const set = index.get(key);
 		if (set) {
 			set.delete(entity);
-			if (set.size === 0) this.#valueToEntities.delete(value);
+			if (set.size === 0) index.delete(key);
 		}
 	}
+	/** Preserves array order and element types, including bigint values that JSON cannot encode. */
+	maybeArrayKey(value) {
+		return this.isArray && Array.isArray(value) ? fastWhereFilterHash(value) : void 0;
+	}
 };
 function intersectSets(set1, set2) {
 	const [smaller, larger] = set1.size <= set2.size ? [set1, set2] : [set2, set1];

package/build/IndexManager.js.map

@@ -1 +1 @@
-{"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"}
+{"version":3,"file":"IndexManager.js","names":[],"sources":["../src/IndexManager.ts"],"sourcesContent":["import { fastWhereFilterHash } from \"src/dataloaders/fastWhereFilterHash.ts\";\nimport { 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(meta.columns[fieldName]?.isArray ?? false), 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  // Keep serialized arrays separate so their keys cannot collide with scalar string values.\n  readonly #arrayToEntities = new Map<string, Set<Entity>>();\n\n  constructor(private readonly isArray: boolean) {}\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    const arrayKey = this.maybeArrayKey(value);\n    if (arrayKey !== undefined) return this.#arrayToEntities.get(arrayKey);\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 arrayKey = this.maybeArrayKey(value);\n    const index = arrayKey === undefined ? this.#valueToEntities : this.#arrayToEntities;\n    const key = arrayKey ?? value;\n    const set = index.get(key) ?? new Set();\n    if (set.size === 0) index.set(key, set);\n    set.add(entity);\n  }\n\n  private doRemove(value: any, entity: Entity): void {\n    const arrayKey = this.maybeArrayKey(value);\n    const index = arrayKey === undefined ? this.#valueToEntities : this.#arrayToEntities;\n    const key = arrayKey ?? value;\n    const set = index.get(key);\n    if (set) {\n      set.delete(entity);\n      if (set.size === 0) {\n        index.delete(key);\n      }\n    }\n  }\n\n  /** Preserves array order and element types, including bigint values that JSON cannot encode. */\n  private maybeArrayKey(value: unknown): string | undefined {\n    return this.isArray && Array.isArray(value) ? fastWhereFilterHash(value) : undefined;\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":";;;;;;;AAeA,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,KAAK,SAAS,IAAI,OAAO;CAClC;;CAGA,sBAAwC,MAAyB,UAAe,OAAqB;EACnG,MAAM,EAAE,YAAY;EACpB,IAAI,CAAC,KAAK,SAAS,IAAI,OAAO,GAC5B,KAAK,SAAS,IAAI,yBAAS,IAAI,IAAI,CAAC;EAGtC,MAAM,aAAa,OAAO,KAAK,KAAK;EACpC,MAAM,eAAe,KAAK,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,KAAK,SAAS,SAAS,GAAG;EAE9B,MAAM,OAAO,YAAY,MAAM;EAC/B,MAAM,eAAe,KAAK,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,KAAK,SAAS,IAAI,OAAO,GAC5B,MAAM,IAAI,MAAM,GAAG,KAAK,KAAK,gBAAgB;EAE/C,MAAM,eAAe,KAAK,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,KAAK,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,KAAK,QAAQ,UAAU,EAAE,WAAW,KAAK;KAAG,cAAc;IAAE;IACnG,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,KAAK,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;CAKc;CAJ7B,mCAA4B,IAAI,IAA6B;CAE7D,mCAA4B,IAAI,IAAyB;CAEzD,YAAY,SAAmC;EAAlB,KAAA,UAAA;CAAmB;;CAGhD,IAAI,OAAqC;EACvC,IAAI,SAAS,KAAK,KAAK,MAAM,eAAe;GAG1C,MAAM,UAAU,KAAK,iBAAiB,IAAI,MAAM,aAAa;GAE7D,MAAM,gBAAgB,KAAK,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,MAAM,WAAW,KAAK,cAAc,KAAK;EACzC,IAAI,aAAa,KAAA,GAAW,OAAO,KAAK,iBAAiB,IAAI,QAAQ;EACrE,OAAO,KAAK,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,WAAW,KAAK,cAAc,KAAK;EACzC,MAAM,QAAQ,aAAa,KAAA,IAAY,KAAK,mBAAmB,KAAK;EACpE,MAAM,MAAM,YAAY;EACxB,MAAM,MAAM,MAAM,IAAI,GAAG,qBAAK,IAAI,IAAI;EACtC,IAAI,IAAI,SAAS,GAAG,MAAM,IAAI,KAAK,GAAG;EACtC,IAAI,IAAI,MAAM;CAChB;CAEA,SAAiB,OAAY,QAAsB;EACjD,MAAM,WAAW,KAAK,cAAc,KAAK;EACzC,MAAM,QAAQ,aAAa,KAAA,IAAY,KAAK,mBAAmB,KAAK;EACpE,MAAM,MAAM,YAAY;EACxB,MAAM,MAAM,MAAM,IAAI,GAAG;EACzB,IAAI,KAAK;GACP,IAAI,OAAO,MAAM;GACjB,IAAI,IAAI,SAAS,GACf,MAAM,OAAO,GAAG;EAEpB;CACF;;CAGA,cAAsB,OAAoC;EACxD,OAAO,KAAK,WAAW,MAAM,QAAQ,KAAK,IAAI,oBAAoB,KAAK,IAAI,KAAA;CAC7E;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"}

package/build/InstanceData.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"InstanceData.cjs","names":["emptyRowData","#new","#flags","#deleted","#originalData","#referenceHistory","hasAnyKey"],"sources":["../src/InstanceData.ts"],"sourcesContent":["import { type Entity } from \"src/Entity.ts\";\nimport { type EntityManager, getEmInternalApi } from \"src/EntityManager.ts\";\nimport { type EntityMetadata } from \"src/EntityMetadata.ts\";\nimport { type RowData, emptyRowData } from \"src/RowData.ts\";\nimport { hasAnyKey } from \"src/utils.ts\";\n\n/** The `#orm` metadata field we track on each instance. */\nexport class InstanceData {\n  /** The entity this instance data belongs to. */\n  readonly entity: Entity;\n  /** All entities must be associated to an `EntityManager` to handle lazy loading/etc. */\n  readonly em: EntityManager;\n  /** A pointer to our entity type's metadata. */\n  readonly metadata: EntityMetadata;\n  /** A bag for our lazy-initialized relations, allocated on first relation access. */\n  relations: Record<any, any> | undefined = undefined;\n  /** The as-loaded database row, i.e. our `rowIndex`-th row within our query's `RowData` result. */\n  rowData: RowData = emptyRowData;\n  /** Our row's index within `rowData`; see {@link RowData}. */\n  rowIndex: number = 0;\n  /** The domain-value of fields, lazily converted (if needed) on read from the database columns. */\n  data: Record<string, any>;\n  /** A bag to keep the original values, allocated on first mutation (most entities are never mutated). */\n  #originalData: Record<any, any> | undefined = undefined;\n  /** Reference values that were set during this unit of work, allocated on first m2o/poly change. */\n  #referenceHistory: Record<string, any[]> | undefined = undefined;\n  /** A bag to keep the flushed-to-database values, only for AsyncReactiveField reactivity. */\n  flushedData: Record<any, any> | undefined;\n  /** Packs the new/deleted `Operation`s + isTouched into one slot; see the accessors below. */\n  #flags: number = 0;\n  /** The `a#1`, `a#2` index if we're an em.create-d entity. We never unset this, to keep ids stable across flushes. */\n  createId: string | undefined;\n  /** The zero-based order this entity was registered with its EntityManager. */\n  entityIndex: number = -1;\n\n  /** Whether our entity is new or not. */\n  get #new(): Operation | undefined {\n    const value = this.#flags & 0b11;\n    return value === 0 ? undefined : value;\n  }\n\n  set #new(op: Operation | undefined) {\n    this.#flags = (this.#flags & ~0b11) | (op ?? 0);\n  }\n\n  /**\n   * Whether our entity has been deleted or not.\n   *\n   * - `pending` means we've been marked for deletion via `em.delete` but not issued a `DELETE`\n   * - `flushed` means we've flushed a `DELETE` but `em.flush` hasn't fully completed yet, likely due to AsyncReactiveField calcs\n   * - `deleted` means we've been flushed and `em.flush` has completed\n   */\n  get #deleted(): Operation | undefined {\n    const value = (this.#flags >> 2) & 0b11;\n    return value === 0 ? undefined : value;\n  }\n\n  set #deleted(op: Operation | undefined) {\n    this.#flags = (this.#flags & ~0b1100) | ((op ?? 0) << 2);\n  }\n\n  /** Whether our entity should flush regardless of any other changes. */\n  get isTouched(): boolean {\n    return (this.#flags & 0b10000) !== 0;\n  }\n\n  set isTouched(value: boolean) {\n    this.#flags = value ? this.#flags | 0b10000 : this.#flags & ~0b10000;\n  }\n\n  /** Creates the `#orm` field. */\n  constructor(em: EntityManager, entity: Entity, metadata: EntityMetadata, isNew: boolean) {\n    this.entity = entity;\n    this.em = em;\n    this.metadata = metadata;\n    if (isNew) {\n      this.#new = Operation.Pending;\n      this.data = {};\n      this.flushedData = undefined;\n      if (em) this.markMaybePending();\n    } else {\n      this.#new = undefined;\n      this.data = {};\n      this.flushedData = undefined;\n    }\n  }\n\n  /**\n   * Returns the as-loaded value of `columnName`, i.e. `getColumn(\"rank\")`.\n   *\n   * This saves callers from knowing that `rowData`/`rowIndex` are a pair, but note it is\n   * a snapshot of the query that loaded us, and specifically:\n   *\n   * - The value is driver-level, i.e. numeric enum ids, untagged foreign keys, and temporals\n   *   as strings; use `getField` if you want the domain value, and\n   * - The value is not updated by `em.flush`, so after a flush it is the pre-flush value, and\n   * - New entities have no row, so every column is `undefined`.\n   */\n  getColumn(columnName: string): any {\n    return this.rowData.get(this.rowIndex, columnName);\n  }\n\n  /** If `em.flush` has detected a dirty RQF, reset our internal dirty state, w/o reseting our external-dirty state. */\n  resetForRqfLoop() {\n    this.flushedData = {};\n    if (this.#new === Operation.Pending) this.#new = Operation.Flushed;\n    if (this.#deleted === Operation.Pending) this.#deleted = Operation.Flushed;\n  }\n\n  resetAfterFlushed() {\n    this.#originalData = undefined;\n    this.#referenceHistory = undefined;\n    this.flushedData = undefined;\n    this.isTouched = false;\n    if (this.#new === Operation.Pending || this.#new === Operation.Flushed) {\n      this.#new = Operation.Complete;\n    }\n    if (this.#deleted === Operation.Pending || this.#deleted === Operation.Flushed) {\n      this.#deleted = Operation.Complete;\n    }\n    this.unmarkMaybePending();\n  }\n\n  /** Our public-facing `isNewEntity`. */\n  get isNewEntity(): boolean {\n    return this.#new !== undefined && this.#new !== Operation.Complete;\n  }\n\n  /** Our public-facing `isDeletedEntity`. */\n  get isDeletedEntity(): boolean {\n    return this.#deleted !== undefined;\n  }\n\n  /** The original values of mutated fields; a shared empty object until the entity is actually mutated. */\n  get originalData(): Record<any, any> {\n    return this.#originalData ?? emptyObject;\n  }\n\n  /** Our public-facing `isDirtyEntity`. */\n  get isDirtyEntity(): boolean {\n    return hasAnyKey(this.#originalData);\n  }\n\n  /** This is our internal \"is pending flush\", which is aware of RQF micro-flush loops. */\n  get pendingOperation(): \"insert\" | \"update\" | \"delete\" | \"none\" | \"created-then-deleted\" {\n    if (this.#deleted !== undefined) {\n      // Mark entities that were created and them immediately `em.delete`-d; granted this is\n      // probably rare, but we shouldn't run hooks or have the driver try and delete these.\n      // Note that we return them, instead of skipping entirely, so that fixupCreatedThenDeleted\n      // can later be called.\n      return this.#deleted === Operation.Pending && this.#new === Operation.Pending\n        ? \"created-then-deleted\"\n        : this.#deleted === Operation.Pending\n          ? \"delete\"\n          : \"none\";\n    } else if (this.#new === Operation.Pending) {\n      // Per ^, if `#new === flushed`, we fall through to check if micro-flush UPDATEs are required\n      return \"insert\";\n    } else if (this.flushedData) {\n      return hasAnyKey(this.flushedData) ? \"update\" : \"none\";\n    } else {\n      return this.isTouched || hasAnyKey(this.#originalData) ? \"update\" : \"none\";\n    }\n  }\n\n  get changedFields(): string[] {\n    return Object.keys(this.changedData);\n  }\n\n  /** The changed-fields bag (flushedData during RQF loops, else originalData) without allocating a keys array. */\n  get changedData(): Record<any, any> {\n    return this.flushedData ?? this.#originalData ?? emptyObject;\n  }\n\n  /** Called when an `em.load` tries to find the entity and it's just gone from the db. */\n  markDeletedBecauseNotFound(): void {\n    this.#deleted = Operation.Complete;\n  }\n\n  /** Called by `em.delete`, returns true if this is new information. */\n  markDeleted(): boolean {\n    if (this.#deleted === undefined) {\n      // Let any OneToManyCollection/ReactiveField/ReactiveReference.get caches know that they should recalc\n      // (i.e. their filterDeleted logic) by asserting the `deleteBook.author` field is changing.\n      for (const field of Object.values(this.metadata.allFields)) {\n        // We only do reference/collection fields and skip the primitives, b/c we assume something like\n        // `{ books: \"title\" }` doesn't need `resetIsLoaded(..., \"title\")` b/c the same hint will also\n        // be watching \"did books change\", and so get reset that way.\n        if (field.kind === \"m2o\" || field.kind === \"poly\" || field.kind === \"m2m\" || field.kind === \"m2mEnum\") {\n          getEmInternalApi(this.em).isLoadedCache.resetIsLoaded(this.entity, field.fieldName);\n        } else if (field.kind === \"primitive\" || field.kind === \"enum\" || field.kind === \"primaryKey\") {\n          // Any reactable watching these fields will also be watching reference/collection\n        } else if (field.kind === \"o2m\" || field.kind === \"o2o\") {\n          // Any reactable watching these actually gets triggered by the primary m2o/poly side changing\n        } else if (field.kind === \"lo2m\") {\n          // Doesn't support reactivity\n        } else {\n          throw new Error(`Unhandled field kind ${field}`);\n        }\n      }\n      this.#deleted = Operation.Pending;\n      this.markMaybePending();\n      return true;\n    }\n    return false;\n  }\n\n  fixupCreatedThenDeleted(): void {\n    // Ideally we could do this via `resetAfterFlushed`?\n    this.#deleted = Operation.Complete;\n    this.unmarkMaybePending();\n  }\n\n  /** Marks this entity as needing a flush even if no fields changed. */\n  markTouched(): void {\n    this.isTouched = true;\n    this.markMaybePending();\n  }\n\n  /** Marks a field as dirty with its pre-mutation value. */\n  markFieldDirty(fieldName: string, value: any): void {\n    (this.#originalData ??= {})[fieldName] = value;\n    this.markMaybePending();\n  }\n\n  /** Marks a reverted field as clean again. */\n  markFieldClean(fieldName: string): void {\n    if (this.#originalData) delete this.#originalData[fieldName];\n    this.markMaybePending();\n  }\n\n  /** Marks this entity as a possible flush candidate. */\n  markMaybePending(): void {\n    getEmInternalApi(this.em).markMaybePending(this.entity);\n  }\n\n  /** Removes this entity from the possible flush candidate set. */\n  private unmarkMaybePending(): void {\n    getEmInternalApi(this.em).unmarkMaybePending(this.entity);\n  }\n\n  /** Remembers a reference value that may need to be reverse-walked later. */\n  rememberReferenceValue(fieldName: string, value: any): void {\n    if (value === undefined) return;\n    const values = ((this.#referenceHistory ??= {})[fieldName] ??= []);\n    if (!values.includes(value)) values.push(value);\n  }\n\n  /** Returns reference values that may need to be reverse-walked later. */\n  getReferenceHistory(fieldName: string): readonly any[] {\n    return this.#referenceHistory?.[fieldName] ?? emptyArray;\n  }\n\n  get isDeletedAndFlushed(): boolean {\n    return this.#deleted === Operation.Complete;\n  }\n\n  /**\n   * Returns true if the entity is new or was new in this EM.\n   *\n   * This is primarily used for lazy-initializing relations, i.e. if:\n   *\n   * - A new `Author` is created\n   * - We `em.flush` the author to the database\n   * - Then `a1.books` is accessed for the first time\n   *\n   * We can have a high-confidence that `a1` has no books, because we just\n   * created it, so we can set the OneToManyCollection to loaded.\n   */\n  get isOrWasNew(): boolean {\n    // #new will be left as `complete`\n    return this.#new !== undefined;\n  }\n}\n\n/** An enum to track our insert/delete state progression. */\nenum Operation {\n  Pending = 1,\n  Flushed = 2,\n  Complete = 3,\n}\n\n/** A shared frozen bag for un-mutated entities; strict mode makes accidental writes throw. */\nconst emptyObject: Record<any, any> = Object.freeze({});\n\n/** A shared frozen array for fields with no remembered reference values. */\nconst emptyArray: readonly any[] = Object.freeze([]);\n"],"mappings":";;;;;;;;AAOA,IAAa,eAAb,MAA0B;;CAExB;;CAEA;;CAEA;;CAEA,YAA0C,KAAA;;CAE1C,UAAmBA,gBAAAA;;CAEnB,WAAmB;;CAEnB;;CAEA,gBAA8C,KAAA;;CAE9C,oBAAuD,KAAA;;CAEvD;;CAEA,SAAiB;;CAEjB;;CAEA,cAAsB;;CAGtB,IAAIC,OAA8B;EAChC,MAAM,QAAQ,KAAKC,SAAS;EAC5B,OAAO,UAAU,IAAI,KAAA,IAAY;CACnC;CAEA,IAAID,KAAK,IAA2B;EAClC,KAAKC,SAAU,KAAKA,SAAS,MAAU,MAAM;CAC/C;;;;;;;;CASA,IAAIC,WAAkC;EACpC,MAAM,QAAS,KAAKD,UAAU,IAAK;EACnC,OAAO,UAAU,IAAI,KAAA,IAAY;CACnC;CAEA,IAAIC,SAAS,IAA2B;EACtC,KAAKD,SAAU,KAAKA,SAAS,OAAa,MAAM,MAAM;CACxD;;CAGA,IAAI,YAAqB;EACvB,QAAQ,KAAKA,SAAS,QAAa;CACrC;CAEA,IAAI,UAAU,OAAgB;EAC5B,KAAKA,SAAS,QAAQ,KAAKA,SAAS,KAAU,KAAKA,SAAS;CAC9D;;CAGA,YAAY,IAAmB,QAAgB,UAA0B,OAAgB;EACvF,KAAK,SAAS;EACd,KAAK,KAAK;EACV,KAAK,WAAW;EAChB,IAAI,OAAO;GACT,KAAKD,OAAAA;GACL,KAAK,OAAO,CAAC;GACb,KAAK,cAAc,KAAA;GACnB,IAAI,IAAI,KAAK,iBAAiB;EAChC,OAAO;GACL,KAAKA,OAAO,KAAA;GACZ,KAAK,OAAO,CAAC;GACb,KAAK,cAAc,KAAA;EACrB;CACF;;;;;;;;;;;;CAaA,UAAU,YAAyB;EACjC,OAAO,KAAK,QAAQ,IAAI,KAAK,UAAU,UAAU;CACnD;;CAGA,kBAAkB;EAChB,KAAK,cAAc,CAAC;EACpB,IAAI,KAAKA,SAAAA,GAA4B,KAAKA,OAAAA;EAC1C,IAAI,KAAKE,aAAAA,GAAgC,KAAKA,WAAAA;CAChD;CAEA,oBAAoB;EAClB,KAAKC,gBAAgB,KAAA;EACrB,KAAKC,oBAAoB,KAAA;EACzB,KAAK,cAAc,KAAA;EACnB,KAAK,YAAY;EACjB,IAAI,KAAKJ,SAAAA,KAA8B,KAAKA,SAAAA,GAC1C,KAAKA,OAAAA;EAEP,IAAI,KAAKE,aAAAA,KAAkC,KAAKA,aAAAA,GAC9C,KAAKA,WAAAA;EAEP,KAAK,mBAAmB;CAC1B;;CAGA,IAAI,cAAuB;EACzB,OAAO,KAAKF,SAAS,KAAA,KAAa,KAAKA,SAAAA;CACzC;;CAGA,IAAI,kBAA2B;EAC7B,OAAO,KAAKE,aAAa,KAAA;CAC3B;;CAGA,IAAI,eAAiC;EACnC,OAAO,KAAKC,iBAAiB;CAC/B;;CAGA,IAAI,gBAAyB;EAC3B,OAAOE,cAAAA,UAAU,KAAKF,aAAa;CACrC;;CAGA,IAAI,mBAAqF;EACvF,IAAI,KAAKD,aAAa,KAAA,GAKpB,OAAO,KAAKA,aAAAA,KAAkC,KAAKF,SAAAA,IAC/C,yBACA,KAAKE,aAAAA,IACH,WACA;OACD,IAAI,KAAKF,SAAAA,GAEd,OAAO;OACF,IAAI,KAAK,aACd,OAAOK,cAAAA,UAAU,KAAK,WAAW,IAAI,WAAW;OAEhD,OAAO,KAAK,aAAaA,cAAAA,UAAU,KAAKF,aAAa,IAAI,WAAW;CAExE;CAEA,IAAI,gBAA0B;EAC5B,OAAO,OAAO,KAAK,KAAK,WAAW;CACrC;;CAGA,IAAI,cAAgC;EAClC,OAAO,KAAK,eAAe,KAAKA,iBAAiB;CACnD;;CAGA,6BAAmC;EACjC,KAAKD,WAAAA;CACP;;CAGA,cAAuB;EACrB,IAAI,KAAKA,aAAa,KAAA,GAAW;GAG/B,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,SAAS,SAAS,GAIvD,IAAI,MAAM,SAAS,SAAS,MAAM,SAAS,UAAU,MAAM,SAAS,SAAS,MAAM,SAAS,WAC1F,sBAAA,iBAAiB,KAAK,EAAE,CAAC,CAAC,cAAc,cAAc,KAAK,QAAQ,MAAM,SAAS;QAC7E,IAAI,MAAM,SAAS,eAAe,MAAM,SAAS,UAAU,MAAM,SAAS,cAAc,CAE/F,OAAO,IAAI,MAAM,SAAS,SAAS,MAAM,SAAS,OAAO,CAEzD,OAAO,IAAI,MAAM,SAAS,QAAQ,CAElC,OACE,MAAM,IAAI,MAAM,wBAAwB,OAAO;GAGnD,KAAKA,WAAAA;GACL,KAAK,iBAAiB;GACtB,OAAO;EACT;EACA,OAAO;CACT;CAEA,0BAAgC;EAE9B,KAAKA,WAAAA;EACL,KAAK,mBAAmB;CAC1B;;CAGA,cAAoB;EAClB,KAAK,YAAY;EACjB,KAAK,iBAAiB;CACxB;;CAGA,eAAe,WAAmB,OAAkB;EAClD,CAAC,KAAKC,kBAAkB,CAAC,EAAA,CAAG,aAAa;EACzC,KAAK,iBAAiB;CACxB;;CAGA,eAAe,WAAyB;EACtC,IAAI,KAAKA,eAAe,OAAO,KAAKA,cAAc;EAClD,KAAK,iBAAiB;CACxB;;CAGA,mBAAyB;EACvB,sBAAA,iBAAiB,KAAK,EAAE,CAAC,CAAC,iBAAiB,KAAK,MAAM;CACxD;;CAGA,qBAAmC;EACjC,sBAAA,iBAAiB,KAAK,EAAE,CAAC,CAAC,mBAAmB,KAAK,MAAM;CAC1D;;CAGA,uBAAuB,WAAmB,OAAkB;EAC1D,IAAI,UAAU,KAAA,GAAW;EACzB,MAAM,SAAU,CAAC,KAAKC,sBAAsB,CAAC,EAAA,CAAG,eAAe,CAAC;EAChE,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG,OAAO,KAAK,KAAK;CAChD;;CAGA,oBAAoB,WAAmC;EACrD,OAAO,KAAKA,oBAAoB,cAAc;CAChD;CAEA,IAAI,sBAA+B;EACjC,OAAO,KAAKF,aAAAA;CACd;;;;;;;;;;;;;CAcA,IAAI,aAAsB;EAExB,OAAO,KAAKF,SAAS,KAAA;CACvB;AACF;;AAUA,MAAM,cAAgC,OAAO,OAAO,CAAC,CAAC;;AAGtD,MAAM,aAA6B,OAAO,OAAO,CAAC,CAAC"}
+{"version":3,"file":"InstanceData.cjs","names":["emptyRowData","hasAnyKey"],"sources":["../src/InstanceData.ts"],"sourcesContent":["import { type Entity } from \"src/Entity.ts\";\nimport { type EntityManager, getEmInternalApi } from \"src/EntityManager.ts\";\nimport { type EntityMetadata } from \"src/EntityMetadata.ts\";\nimport { type RowData, emptyRowData } from \"src/RowData.ts\";\nimport { hasAnyKey } from \"src/utils.ts\";\n\n/** The `#orm` metadata field we track on each instance. */\nexport class InstanceData {\n  /** The entity this instance data belongs to. */\n  readonly entity: Entity;\n  /** All entities must be associated to an `EntityManager` to handle lazy loading/etc. */\n  readonly em: EntityManager;\n  /** A pointer to our entity type's metadata. */\n  readonly metadata: EntityMetadata;\n  /** A bag for our lazy-initialized relations, allocated on first relation access. */\n  relations: Record<any, any> | undefined = undefined;\n  /** The as-loaded database row, i.e. our `rowIndex`-th row within our query's `RowData` result. */\n  rowData: RowData = emptyRowData;\n  /** Our row's index within `rowData`; see {@link RowData}. */\n  rowIndex: number = 0;\n  /** The domain-value of fields, lazily converted (if needed) on read from the database columns. */\n  data: Record<string, any>;\n  /** A bag to keep the original values, allocated on first mutation (most entities are never mutated). */\n  #originalData: Record<any, any> | undefined = undefined;\n  /** Reference values that were set during this unit of work, allocated on first m2o/poly change. */\n  #referenceHistory: Record<string, any[]> | undefined = undefined;\n  /** A bag to keep the flushed-to-database values, only for AsyncReactiveField reactivity. */\n  flushedData: Record<any, any> | undefined;\n  /** Packs the new/deleted `Operation`s + isTouched into one slot; see the accessors below. */\n  #flags: number = 0;\n  /** The `a#1`, `a#2` index if we're an em.create-d entity. We never unset this, to keep ids stable across flushes. */\n  createId: string | undefined;\n  /** The zero-based order this entity was registered with its EntityManager. */\n  entityIndex: number = -1;\n\n  /** Whether our entity is new or not. */\n  get #new(): Operation | undefined {\n    const value = this.#flags & 0b11;\n    return value === 0 ? undefined : value;\n  }\n\n  set #new(op: Operation | undefined) {\n    this.#flags = (this.#flags & ~0b11) | (op ?? 0);\n  }\n\n  /**\n   * Whether our entity has been deleted or not.\n   *\n   * - `pending` means we've been marked for deletion via `em.delete` but not issued a `DELETE`\n   * - `flushed` means we've flushed a `DELETE` but `em.flush` hasn't fully completed yet, likely due to AsyncReactiveField calcs\n   * - `deleted` means we've been flushed and `em.flush` has completed\n   */\n  get #deleted(): Operation | undefined {\n    const value = (this.#flags >> 2) & 0b11;\n    return value === 0 ? undefined : value;\n  }\n\n  set #deleted(op: Operation | undefined) {\n    this.#flags = (this.#flags & ~0b1100) | ((op ?? 0) << 2);\n  }\n\n  /** Whether our entity should flush regardless of any other changes. */\n  get isTouched(): boolean {\n    return (this.#flags & 0b10000) !== 0;\n  }\n\n  set isTouched(value: boolean) {\n    this.#flags = value ? this.#flags | 0b10000 : this.#flags & ~0b10000;\n  }\n\n  /** Creates the `#orm` field. */\n  constructor(em: EntityManager, entity: Entity, metadata: EntityMetadata, isNew: boolean) {\n    this.entity = entity;\n    this.em = em;\n    this.metadata = metadata;\n    if (isNew) {\n      this.#new = Operation.Pending;\n      this.data = {};\n      this.flushedData = undefined;\n      if (em) this.markMaybePending();\n    } else {\n      this.#new = undefined;\n      this.data = {};\n      this.flushedData = undefined;\n    }\n  }\n\n  /**\n   * Returns the as-loaded value of `columnName`, i.e. `getColumn(\"rank\")`.\n   *\n   * This saves callers from knowing that `rowData`/`rowIndex` are a pair, but note it is\n   * a snapshot of the query that loaded us, and specifically:\n   *\n   * - The value is driver-level, i.e. numeric enum ids, untagged foreign keys, and temporals\n   *   as strings; use `getField` if you want the domain value, and\n   * - The value is not updated by `em.flush`, so after a flush it is the pre-flush value, and\n   * - New entities have no row, so every column is `undefined`.\n   */\n  getColumn(columnName: string): any {\n    return this.rowData.get(this.rowIndex, columnName);\n  }\n\n  /** If `em.flush` has detected a dirty RQF, reset our internal dirty state, w/o reseting our external-dirty state. */\n  resetForRqfLoop() {\n    this.flushedData = {};\n    if (this.#new === Operation.Pending) this.#new = Operation.Flushed;\n    if (this.#deleted === Operation.Pending) this.#deleted = Operation.Flushed;\n  }\n\n  resetAfterFlushed() {\n    this.#originalData = undefined;\n    this.#referenceHistory = undefined;\n    this.flushedData = undefined;\n    this.isTouched = false;\n    if (this.#new === Operation.Pending || this.#new === Operation.Flushed) {\n      this.#new = Operation.Complete;\n    }\n    if (this.#deleted === Operation.Pending || this.#deleted === Operation.Flushed) {\n      this.#deleted = Operation.Complete;\n    }\n    this.unmarkMaybePending();\n  }\n\n  /** Our public-facing `isNewEntity`. */\n  get isNewEntity(): boolean {\n    return this.#new !== undefined && this.#new !== Operation.Complete;\n  }\n\n  /** Our public-facing `isDeletedEntity`. */\n  get isDeletedEntity(): boolean {\n    return this.#deleted !== undefined;\n  }\n\n  /** The original values of mutated fields; a shared empty object until the entity is actually mutated. */\n  get originalData(): Record<any, any> {\n    return this.#originalData ?? emptyObject;\n  }\n\n  /** Our public-facing `isDirtyEntity`. */\n  get isDirtyEntity(): boolean {\n    return hasAnyKey(this.#originalData);\n  }\n\n  /** This is our internal \"is pending flush\", which is aware of RQF micro-flush loops. */\n  get pendingOperation(): \"insert\" | \"update\" | \"delete\" | \"none\" | \"created-then-deleted\" {\n    if (this.#deleted !== undefined) {\n      // Mark entities that were created and them immediately `em.delete`-d; granted this is\n      // probably rare, but we shouldn't run hooks or have the driver try and delete these.\n      // Note that we return them, instead of skipping entirely, so that fixupCreatedThenDeleted\n      // can later be called.\n      return this.#deleted === Operation.Pending && this.#new === Operation.Pending\n        ? \"created-then-deleted\"\n        : this.#deleted === Operation.Pending\n          ? \"delete\"\n          : \"none\";\n    } else if (this.#new === Operation.Pending) {\n      // Per ^, if `#new === flushed`, we fall through to check if micro-flush UPDATEs are required\n      return \"insert\";\n    } else if (this.flushedData) {\n      return hasAnyKey(this.flushedData) ? \"update\" : \"none\";\n    } else {\n      return this.isTouched || hasAnyKey(this.#originalData) ? \"update\" : \"none\";\n    }\n  }\n\n  get changedFields(): string[] {\n    return Object.keys(this.changedData);\n  }\n\n  /** The changed-fields bag (flushedData during RQF loops, else originalData) without allocating a keys array. */\n  get changedData(): Record<any, any> {\n    return this.flushedData ?? this.#originalData ?? emptyObject;\n  }\n\n  /** Called when an `em.load` tries to find the entity and it's just gone from the db. */\n  markDeletedBecauseNotFound(): void {\n    this.#deleted = Operation.Complete;\n  }\n\n  /** Called by `em.delete`, returns true if this is new information. */\n  markDeleted(): boolean {\n    if (this.#deleted === undefined) {\n      // Let any OneToManyCollection/ReactiveField/ReactiveReference.get caches know that they should recalc\n      // (i.e. their filterDeleted logic) by asserting the `deleteBook.author` field is changing.\n      for (const field of Object.values(this.metadata.allFields)) {\n        // We only do reference/collection fields and skip the primitives, b/c we assume something like\n        // `{ books: \"title\" }` doesn't need `resetIsLoaded(..., \"title\")` b/c the same hint will also\n        // be watching \"did books change\", and so get reset that way.\n        if (field.kind === \"m2o\" || field.kind === \"poly\" || field.kind === \"m2m\" || field.kind === \"m2mEnum\") {\n          getEmInternalApi(this.em).isLoadedCache.resetIsLoaded(this.entity, field.fieldName);\n        } else if (field.kind === \"primitive\" || field.kind === \"enum\" || field.kind === \"primaryKey\") {\n          // Any reactable watching these fields will also be watching reference/collection\n        } else if (field.kind === \"o2m\" || field.kind === \"o2o\") {\n          // Any reactable watching these actually gets triggered by the primary m2o/poly side changing\n        } else if (field.kind === \"lo2m\") {\n          // Doesn't support reactivity\n        } else {\n          throw new Error(`Unhandled field kind ${field}`);\n        }\n      }\n      this.#deleted = Operation.Pending;\n      this.markMaybePending();\n      return true;\n    }\n    return false;\n  }\n\n  fixupCreatedThenDeleted(): void {\n    // Ideally we could do this via `resetAfterFlushed`?\n    this.#deleted = Operation.Complete;\n    this.unmarkMaybePending();\n  }\n\n  /** Marks this entity as needing a flush even if no fields changed. */\n  markTouched(): void {\n    this.isTouched = true;\n    this.markMaybePending();\n  }\n\n  /** Marks a field as dirty with its pre-mutation value. */\n  markFieldDirty(fieldName: string, value: any): void {\n    (this.#originalData ??= {})[fieldName] = value;\n    this.markMaybePending();\n  }\n\n  /** Marks a reverted field as clean again. */\n  markFieldClean(fieldName: string): void {\n    if (this.#originalData) delete this.#originalData[fieldName];\n    this.markMaybePending();\n  }\n\n  /** Marks this entity as a possible flush candidate. */\n  markMaybePending(): void {\n    getEmInternalApi(this.em).markMaybePending(this.entity);\n  }\n\n  /** Removes this entity from the possible flush candidate set. */\n  private unmarkMaybePending(): void {\n    getEmInternalApi(this.em).unmarkMaybePending(this.entity);\n  }\n\n  /** Remembers a reference value that may need to be reverse-walked later. */\n  rememberReferenceValue(fieldName: string, value: any): void {\n    if (value === undefined) return;\n    const values = ((this.#referenceHistory ??= {})[fieldName] ??= []);\n    if (!values.includes(value)) values.push(value);\n  }\n\n  /** Returns reference values that may need to be reverse-walked later. */\n  getReferenceHistory(fieldName: string): readonly any[] {\n    return this.#referenceHistory?.[fieldName] ?? emptyArray;\n  }\n\n  get isDeletedAndFlushed(): boolean {\n    return this.#deleted === Operation.Complete;\n  }\n\n  /**\n   * Returns true if the entity is new or was new in this EM.\n   *\n   * This is primarily used for lazy-initializing relations, i.e. if:\n   *\n   * - A new `Author` is created\n   * - We `em.flush` the author to the database\n   * - Then `a1.books` is accessed for the first time\n   *\n   * We can have a high-confidence that `a1` has no books, because we just\n   * created it, so we can set the OneToManyCollection to loaded.\n   */\n  get isOrWasNew(): boolean {\n    // #new will be left as `complete`\n    return this.#new !== undefined;\n  }\n}\n\n/** An enum to track our insert/delete state progression. */\nenum Operation {\n  Pending = 1,\n  Flushed = 2,\n  Complete = 3,\n}\n\n/** A shared frozen bag for un-mutated entities; strict mode makes accidental writes throw. */\nconst emptyObject: Record<any, any> = Object.freeze({});\n\n/** A shared frozen array for fields with no remembered reference values. */\nconst emptyArray: readonly any[] = Object.freeze([]);\n"],"mappings":";;;;;;;;AAOA,IAAa,eAAb,MAA0B;;CAExB;;CAEA;;CAEA;;CAEA,YAA0C,KAAA;;CAE1C,UAAmBA,gBAAAA;;CAEnB,WAAmB;;CAEnB;;CAEA,gBAA8C,KAAA;;CAE9C,oBAAuD,KAAA;;CAEvD;;CAEA,SAAiB;;CAEjB;;CAEA,cAAsB;;CAGtB,IAAI,OAA8B;EAChC,MAAM,QAAQ,KAAK,SAAS;EAC5B,OAAO,UAAU,IAAI,KAAA,IAAY;CACnC;CAEA,IAAI,KAAK,IAA2B;EAClC,KAAK,SAAU,KAAK,SAAS,MAAU,MAAM;CAC/C;;;;;;;;CASA,IAAI,WAAkC;EACpC,MAAM,QAAS,KAAK,UAAU,IAAK;EACnC,OAAO,UAAU,IAAI,KAAA,IAAY;CACnC;CAEA,IAAI,SAAS,IAA2B;EACtC,KAAK,SAAU,KAAK,SAAS,OAAa,MAAM,MAAM;CACxD;;CAGA,IAAI,YAAqB;EACvB,QAAQ,KAAK,SAAS,QAAa;CACrC;CAEA,IAAI,UAAU,OAAgB;EAC5B,KAAK,SAAS,QAAQ,KAAK,SAAS,KAAU,KAAK,SAAS;CAC9D;;CAGA,YAAY,IAAmB,QAAgB,UAA0B,OAAgB;EACvF,KAAK,SAAS;EACd,KAAK,KAAK;EACV,KAAK,WAAW;EAChB,IAAI,OAAO;GACT,KAAK,OAAA;GACL,KAAK,OAAO,CAAC;GACb,KAAK,cAAc,KAAA;GACnB,IAAI,IAAI,KAAK,iBAAiB;EAChC,OAAO;GACL,KAAK,OAAO,KAAA;GACZ,KAAK,OAAO,CAAC;GACb,KAAK,cAAc,KAAA;EACrB;CACF;;;;;;;;;;;;CAaA,UAAU,YAAyB;EACjC,OAAO,KAAK,QAAQ,IAAI,KAAK,UAAU,UAAU;CACnD;;CAGA,kBAAkB;EAChB,KAAK,cAAc,CAAC;EACpB,IAAI,KAAK,SAAA,GAA4B,KAAK,OAAA;EAC1C,IAAI,KAAK,aAAA,GAAgC,KAAK,WAAA;CAChD;CAEA,oBAAoB;EAClB,KAAK,gBAAgB,KAAA;EACrB,KAAK,oBAAoB,KAAA;EACzB,KAAK,cAAc,KAAA;EACnB,KAAK,YAAY;EACjB,IAAI,KAAK,SAAA,KAA8B,KAAK,SAAA,GAC1C,KAAK,OAAA;EAEP,IAAI,KAAK,aAAA,KAAkC,KAAK,aAAA,GAC9C,KAAK,WAAA;EAEP,KAAK,mBAAmB;CAC1B;;CAGA,IAAI,cAAuB;EACzB,OAAO,KAAK,SAAS,KAAA,KAAa,KAAK,SAAA;CACzC;;CAGA,IAAI,kBAA2B;EAC7B,OAAO,KAAK,aAAa,KAAA;CAC3B;;CAGA,IAAI,eAAiC;EACnC,OAAO,KAAK,iBAAiB;CAC/B;;CAGA,IAAI,gBAAyB;EAC3B,OAAOC,cAAAA,UAAU,KAAK,aAAa;CACrC;;CAGA,IAAI,mBAAqF;EACvF,IAAI,KAAK,aAAa,KAAA,GAKpB,OAAO,KAAK,aAAA,KAAkC,KAAK,SAAA,IAC/C,yBACA,KAAK,aAAA,IACH,WACA;OACD,IAAI,KAAK,SAAA,GAEd,OAAO;OACF,IAAI,KAAK,aACd,OAAOA,cAAAA,UAAU,KAAK,WAAW,IAAI,WAAW;OAEhD,OAAO,KAAK,aAAaA,cAAAA,UAAU,KAAK,aAAa,IAAI,WAAW;CAExE;CAEA,IAAI,gBAA0B;EAC5B,OAAO,OAAO,KAAK,KAAK,WAAW;CACrC;;CAGA,IAAI,cAAgC;EAClC,OAAO,KAAK,eAAe,KAAK,iBAAiB;CACnD;;CAGA,6BAAmC;EACjC,KAAK,WAAA;CACP;;CAGA,cAAuB;EACrB,IAAI,KAAK,aAAa,KAAA,GAAW;GAG/B,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,SAAS,SAAS,GAIvD,IAAI,MAAM,SAAS,SAAS,MAAM,SAAS,UAAU,MAAM,SAAS,SAAS,MAAM,SAAS,WAC1F,sBAAA,iBAAiB,KAAK,EAAE,CAAC,CAAC,cAAc,cAAc,KAAK,QAAQ,MAAM,SAAS;QAC7E,IAAI,MAAM,SAAS,eAAe,MAAM,SAAS,UAAU,MAAM,SAAS,cAAc,CAE/F,OAAO,IAAI,MAAM,SAAS,SAAS,MAAM,SAAS,OAAO,CAEzD,OAAO,IAAI,MAAM,SAAS,QAAQ,CAElC,OACE,MAAM,IAAI,MAAM,wBAAwB,OAAO;GAGnD,KAAK,WAAA;GACL,KAAK,iBAAiB;GACtB,OAAO;EACT;EACA,OAAO;CACT;CAEA,0BAAgC;EAE9B,KAAK,WAAA;EACL,KAAK,mBAAmB;CAC1B;;CAGA,cAAoB;EAClB,KAAK,YAAY;EACjB,KAAK,iBAAiB;CACxB;;CAGA,eAAe,WAAmB,OAAkB;EAClD,CAAC,KAAK,kBAAkB,CAAC,EAAA,CAAG,aAAa;EACzC,KAAK,iBAAiB;CACxB;;CAGA,eAAe,WAAyB;EACtC,IAAI,KAAK,eAAe,OAAO,KAAK,cAAc;EAClD,KAAK,iBAAiB;CACxB;;CAGA,mBAAyB;EACvB,sBAAA,iBAAiB,KAAK,EAAE,CAAC,CAAC,iBAAiB,KAAK,MAAM;CACxD;;CAGA,qBAAmC;EACjC,sBAAA,iBAAiB,KAAK,EAAE,CAAC,CAAC,mBAAmB,KAAK,MAAM;CAC1D;;CAGA,uBAAuB,WAAmB,OAAkB;EAC1D,IAAI,UAAU,KAAA,GAAW;EACzB,MAAM,SAAU,CAAC,KAAK,sBAAsB,CAAC,EAAA,CAAG,eAAe,CAAC;EAChE,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG,OAAO,KAAK,KAAK;CAChD;;CAGA,oBAAoB,WAAmC;EACrD,OAAO,KAAK,oBAAoB,cAAc;CAChD;CAEA,IAAI,sBAA+B;EACjC,OAAO,KAAK,aAAA;CACd;;;;;;;;;;;;;CAcA,IAAI,aAAsB;EAExB,OAAO,KAAK,SAAS,KAAA;CACvB;AACF;;AAUA,MAAM,cAAgC,OAAO,OAAO,CAAC,CAAC;;AAGtD,MAAM,aAA6B,OAAO,OAAO,CAAC,CAAC"}

package/build/InstanceData.d.cts

@@ -4,7 +4,7 @@ import { EntityManager } from "./EntityManager.cjs";
 import { Entity } from "./Entity.cjs";
 //#region src/InstanceData.d.ts
 /** The `#orm` metadata field we track on each instance. */
-declare class InstanceData {
+export declare class InstanceData {
   #private;
   /** The entity this instance data belongs to. */
   readonly entity: Entity;
@@ -94,5 +94,4 @@ declare class InstanceData {
   get isOrWasNew(): boolean;
 }
 //#endregion
-export { InstanceData };
 //# sourceMappingURL=InstanceData.d.cts.map

package/build/InstanceData.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"InstanceData.d.cts","names":[],"sources":["../src/InstanceData.ts"],"mappings":";;;;;;cAOa;;;WAEF,QAAQ;;WAER,IAAI;;WAEJ,UAAU;;EAEnB,WAAW;;EAEX,SAAS;;EAET;;EAEA,MAAM;;EAMN,aAAa;;EAIb;;EAEA;;MA6BI;MAIA,UAAU;;EAKd,YAAY,IAAI,eAAe,QAAQ,QAAQ,UAAU,gBAAgB;;;;;;;;;;;;EA2BzE,UAAU;;EAKV;EAMA;;MAeI;;MAKA;;MAKA,gBAAgB;;MAKhB;;MAKA;MAqBA;;MAKA,eAAe;;EAKnB;;EAKA;EA2BA;;EAOA;;EAMA,eAAe,mBAAmB;;EAMlC,eAAe;;EAMf;;UAKQ;;EAKR,uBAAuB,mBAAmB;;EAO1C,oBAAoB;MAIhB;;;;;;;;;;;;;MAgBA"}
+{"version":3,"file":"InstanceData.d.cts","names":[],"sources":["../src/InstanceData.ts"],"mappings":";;;;;;qBAOa;;;WAEF,QAAQ;;WAER,IAAI;;WAEJ,UAAU;;EAEnB,WAAW;;EAEX,SAAS;;EAET;;EAEA,MAAM;;EAMN,aAAa;;EAIb;;EAEA;;MA6BI;MAIA,UAAU;;EAKd,YAAY,IAAI,eAAe,QAAQ,QAAQ,UAAU,gBAAgB;;;;;;;;;;;;EA2BzE,UAAU;;EAKV;EAMA;;MAeI;;MAKA;;MAKA,gBAAgB;;MAKhB;;MAKA;MAqBA;;MAKA,eAAe;;EAKnB;;EAKA;EA2BA;;EAOA;;EAMA,eAAe,mBAAmB;;EAMlC,eAAe;;EAMf;;UAKQ;;EAKR,uBAAuB,mBAAmB;;EAO1C,oBAAoB;MAIhB;;;;;;;;;;;;;MAgBA"}

package/build/InstanceData.d.mts

@@ -4,7 +4,7 @@ import { EntityManager } from "./EntityManager.mjs";
 import { Entity } from "./Entity.mjs";
 //#region src/InstanceData.d.ts
 /** The `#orm` metadata field we track on each instance. */
-declare class InstanceData {
+export declare class InstanceData {
   #private;
   /** The entity this instance data belongs to. */
   readonly entity: Entity;
@@ -94,5 +94,4 @@ declare class InstanceData {
   get isOrWasNew(): boolean;
 }
 //#endregion
-export { InstanceData };
 //# sourceMappingURL=InstanceData.d.mts.map

package/build/InstanceData.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"InstanceData.d.mts","names":[],"sources":["../src/InstanceData.ts"],"mappings":";;;;;;cAOa;;;WAEF,QAAQ;;WAER,IAAI;;WAEJ,UAAU;;EAEnB,WAAW;;EAEX,SAAS;;EAET;;EAEA,MAAM;;EAMN,aAAa;;EAIb;;EAEA;;MA6BI;MAIA,UAAU;;EAKd,YAAY,IAAI,eAAe,QAAQ,QAAQ,UAAU,gBAAgB;;;;;;;;;;;;EA2BzE,UAAU;;EAKV;EAMA;;MAeI;;MAKA;;MAKA,gBAAgB;;MAKhB;;MAKA;MAqBA;;MAKA,eAAe;;EAKnB;;EAKA;EA2BA;;EAOA;;EAMA,eAAe,mBAAmB;;EAMlC,eAAe;;EAMf;;UAKQ;;EAKR,uBAAuB,mBAAmB;;EAO1C,oBAAoB;MAIhB;;;;;;;;;;;;;MAgBA"}
+{"version":3,"file":"InstanceData.d.mts","names":[],"sources":["../src/InstanceData.ts"],"mappings":";;;;;;qBAOa;;;WAEF,QAAQ;;WAER,IAAI;;WAEJ,UAAU;;EAEnB,WAAW;;EAEX,SAAS;;EAET;;EAEA,MAAM;;EAMN,aAAa;;EAIb;;EAEA;;MA6BI;MAIA,UAAU;;EAKd,YAAY,IAAI,eAAe,QAAQ,QAAQ,UAAU,gBAAgB;;;;;;;;;;;;EA2BzE,UAAU;;EAKV;EAMA;;MAeI;;MAKA;;MAKA,gBAAgB;;MAKhB;;MAKA;MAqBA;;MAKA,eAAe;;EAKnB;;EAKA;EA2BA;;EAOA;;EAMA,eAAe,mBAAmB;;EAMlC,eAAe;;EAMf;;UAKQ;;EAKR,uBAAuB,mBAAmB;;EAO1C,oBAAoB;MAIhB;;;;;;;;;;;;;MAgBA"}

package/build/InstanceData.js.map

@@ -1 +1 @@
-{"version":3,"file":"InstanceData.js","names":["#new","#flags","#deleted","#originalData","#referenceHistory"],"sources":["../src/InstanceData.ts"],"sourcesContent":["import { type Entity } from \"src/Entity.ts\";\nimport { type EntityManager, getEmInternalApi } from \"src/EntityManager.ts\";\nimport { type EntityMetadata } from \"src/EntityMetadata.ts\";\nimport { type RowData, emptyRowData } from \"src/RowData.ts\";\nimport { hasAnyKey } from \"src/utils.ts\";\n\n/** The `#orm` metadata field we track on each instance. */\nexport class InstanceData {\n  /** The entity this instance data belongs to. */\n  readonly entity: Entity;\n  /** All entities must be associated to an `EntityManager` to handle lazy loading/etc. */\n  readonly em: EntityManager;\n  /** A pointer to our entity type's metadata. */\n  readonly metadata: EntityMetadata;\n  /** A bag for our lazy-initialized relations, allocated on first relation access. */\n  relations: Record<any, any> | undefined = undefined;\n  /** The as-loaded database row, i.e. our `rowIndex`-th row within our query's `RowData` result. */\n  rowData: RowData = emptyRowData;\n  /** Our row's index within `rowData`; see {@link RowData}. */\n  rowIndex: number = 0;\n  /** The domain-value of fields, lazily converted (if needed) on read from the database columns. */\n  data: Record<string, any>;\n  /** A bag to keep the original values, allocated on first mutation (most entities are never mutated). */\n  #originalData: Record<any, any> | undefined = undefined;\n  /** Reference values that were set during this unit of work, allocated on first m2o/poly change. */\n  #referenceHistory: Record<string, any[]> | undefined = undefined;\n  /** A bag to keep the flushed-to-database values, only for AsyncReactiveField reactivity. */\n  flushedData: Record<any, any> | undefined;\n  /** Packs the new/deleted `Operation`s + isTouched into one slot; see the accessors below. */\n  #flags: number = 0;\n  /** The `a#1`, `a#2` index if we're an em.create-d entity. We never unset this, to keep ids stable across flushes. */\n  createId: string | undefined;\n  /** The zero-based order this entity was registered with its EntityManager. */\n  entityIndex: number = -1;\n\n  /** Whether our entity is new or not. */\n  get #new(): Operation | undefined {\n    const value = this.#flags & 0b11;\n    return value === 0 ? undefined : value;\n  }\n\n  set #new(op: Operation | undefined) {\n    this.#flags = (this.#flags & ~0b11) | (op ?? 0);\n  }\n\n  /**\n   * Whether our entity has been deleted or not.\n   *\n   * - `pending` means we've been marked for deletion via `em.delete` but not issued a `DELETE`\n   * - `flushed` means we've flushed a `DELETE` but `em.flush` hasn't fully completed yet, likely due to AsyncReactiveField calcs\n   * - `deleted` means we've been flushed and `em.flush` has completed\n   */\n  get #deleted(): Operation | undefined {\n    const value = (this.#flags >> 2) & 0b11;\n    return value === 0 ? undefined : value;\n  }\n\n  set #deleted(op: Operation | undefined) {\n    this.#flags = (this.#flags & ~0b1100) | ((op ?? 0) << 2);\n  }\n\n  /** Whether our entity should flush regardless of any other changes. */\n  get isTouched(): boolean {\n    return (this.#flags & 0b10000) !== 0;\n  }\n\n  set isTouched(value: boolean) {\n    this.#flags = value ? this.#flags | 0b10000 : this.#flags & ~0b10000;\n  }\n\n  /** Creates the `#orm` field. */\n  constructor(em: EntityManager, entity: Entity, metadata: EntityMetadata, isNew: boolean) {\n    this.entity = entity;\n    this.em = em;\n    this.metadata = metadata;\n    if (isNew) {\n      this.#new = Operation.Pending;\n      this.data = {};\n      this.flushedData = undefined;\n      if (em) this.markMaybePending();\n    } else {\n      this.#new = undefined;\n      this.data = {};\n      this.flushedData = undefined;\n    }\n  }\n\n  /**\n   * Returns the as-loaded value of `columnName`, i.e. `getColumn(\"rank\")`.\n   *\n   * This saves callers from knowing that `rowData`/`rowIndex` are a pair, but note it is\n   * a snapshot of the query that loaded us, and specifically:\n   *\n   * - The value is driver-level, i.e. numeric enum ids, untagged foreign keys, and temporals\n   *   as strings; use `getField` if you want the domain value, and\n   * - The value is not updated by `em.flush`, so after a flush it is the pre-flush value, and\n   * - New entities have no row, so every column is `undefined`.\n   */\n  getColumn(columnName: string): any {\n    return this.rowData.get(this.rowIndex, columnName);\n  }\n\n  /** If `em.flush` has detected a dirty RQF, reset our internal dirty state, w/o reseting our external-dirty state. */\n  resetForRqfLoop() {\n    this.flushedData = {};\n    if (this.#new === Operation.Pending) this.#new = Operation.Flushed;\n    if (this.#deleted === Operation.Pending) this.#deleted = Operation.Flushed;\n  }\n\n  resetAfterFlushed() {\n    this.#originalData = undefined;\n    this.#referenceHistory = undefined;\n    this.flushedData = undefined;\n    this.isTouched = false;\n    if (this.#new === Operation.Pending || this.#new === Operation.Flushed) {\n      this.#new = Operation.Complete;\n    }\n    if (this.#deleted === Operation.Pending || this.#deleted === Operation.Flushed) {\n      this.#deleted = Operation.Complete;\n    }\n    this.unmarkMaybePending();\n  }\n\n  /** Our public-facing `isNewEntity`. */\n  get isNewEntity(): boolean {\n    return this.#new !== undefined && this.#new !== Operation.Complete;\n  }\n\n  /** Our public-facing `isDeletedEntity`. */\n  get isDeletedEntity(): boolean {\n    return this.#deleted !== undefined;\n  }\n\n  /** The original values of mutated fields; a shared empty object until the entity is actually mutated. */\n  get originalData(): Record<any, any> {\n    return this.#originalData ?? emptyObject;\n  }\n\n  /** Our public-facing `isDirtyEntity`. */\n  get isDirtyEntity(): boolean {\n    return hasAnyKey(this.#originalData);\n  }\n\n  /** This is our internal \"is pending flush\", which is aware of RQF micro-flush loops. */\n  get pendingOperation(): \"insert\" | \"update\" | \"delete\" | \"none\" | \"created-then-deleted\" {\n    if (this.#deleted !== undefined) {\n      // Mark entities that were created and them immediately `em.delete`-d; granted this is\n      // probably rare, but we shouldn't run hooks or have the driver try and delete these.\n      // Note that we return them, instead of skipping entirely, so that fixupCreatedThenDeleted\n      // can later be called.\n      return this.#deleted === Operation.Pending && this.#new === Operation.Pending\n        ? \"created-then-deleted\"\n        : this.#deleted === Operation.Pending\n          ? \"delete\"\n          : \"none\";\n    } else if (this.#new === Operation.Pending) {\n      // Per ^, if `#new === flushed`, we fall through to check if micro-flush UPDATEs are required\n      return \"insert\";\n    } else if (this.flushedData) {\n      return hasAnyKey(this.flushedData) ? \"update\" : \"none\";\n    } else {\n      return this.isTouched || hasAnyKey(this.#originalData) ? \"update\" : \"none\";\n    }\n  }\n\n  get changedFields(): string[] {\n    return Object.keys(this.changedData);\n  }\n\n  /** The changed-fields bag (flushedData during RQF loops, else originalData) without allocating a keys array. */\n  get changedData(): Record<any, any> {\n    return this.flushedData ?? this.#originalData ?? emptyObject;\n  }\n\n  /** Called when an `em.load` tries to find the entity and it's just gone from the db. */\n  markDeletedBecauseNotFound(): void {\n    this.#deleted = Operation.Complete;\n  }\n\n  /** Called by `em.delete`, returns true if this is new information. */\n  markDeleted(): boolean {\n    if (this.#deleted === undefined) {\n      // Let any OneToManyCollection/ReactiveField/ReactiveReference.get caches know that they should recalc\n      // (i.e. their filterDeleted logic) by asserting the `deleteBook.author` field is changing.\n      for (const field of Object.values(this.metadata.allFields)) {\n        // We only do reference/collection fields and skip the primitives, b/c we assume something like\n        // `{ books: \"title\" }` doesn't need `resetIsLoaded(..., \"title\")` b/c the same hint will also\n        // be watching \"did books change\", and so get reset that way.\n        if (field.kind === \"m2o\" || field.kind === \"poly\" || field.kind === \"m2m\" || field.kind === \"m2mEnum\") {\n          getEmInternalApi(this.em).isLoadedCache.resetIsLoaded(this.entity, field.fieldName);\n        } else if (field.kind === \"primitive\" || field.kind === \"enum\" || field.kind === \"primaryKey\") {\n          // Any reactable watching these fields will also be watching reference/collection\n        } else if (field.kind === \"o2m\" || field.kind === \"o2o\") {\n          // Any reactable watching these actually gets triggered by the primary m2o/poly side changing\n        } else if (field.kind === \"lo2m\") {\n          // Doesn't support reactivity\n        } else {\n          throw new Error(`Unhandled field kind ${field}`);\n        }\n      }\n      this.#deleted = Operation.Pending;\n      this.markMaybePending();\n      return true;\n    }\n    return false;\n  }\n\n  fixupCreatedThenDeleted(): void {\n    // Ideally we could do this via `resetAfterFlushed`?\n    this.#deleted = Operation.Complete;\n    this.unmarkMaybePending();\n  }\n\n  /** Marks this entity as needing a flush even if no fields changed. */\n  markTouched(): void {\n    this.isTouched = true;\n    this.markMaybePending();\n  }\n\n  /** Marks a field as dirty with its pre-mutation value. */\n  markFieldDirty(fieldName: string, value: any): void {\n    (this.#originalData ??= {})[fieldName] = value;\n    this.markMaybePending();\n  }\n\n  /** Marks a reverted field as clean again. */\n  markFieldClean(fieldName: string): void {\n    if (this.#originalData) delete this.#originalData[fieldName];\n    this.markMaybePending();\n  }\n\n  /** Marks this entity as a possible flush candidate. */\n  markMaybePending(): void {\n    getEmInternalApi(this.em).markMaybePending(this.entity);\n  }\n\n  /** Removes this entity from the possible flush candidate set. */\n  private unmarkMaybePending(): void {\n    getEmInternalApi(this.em).unmarkMaybePending(this.entity);\n  }\n\n  /** Remembers a reference value that may need to be reverse-walked later. */\n  rememberReferenceValue(fieldName: string, value: any): void {\n    if (value === undefined) return;\n    const values = ((this.#referenceHistory ??= {})[fieldName] ??= []);\n    if (!values.includes(value)) values.push(value);\n  }\n\n  /** Returns reference values that may need to be reverse-walked later. */\n  getReferenceHistory(fieldName: string): readonly any[] {\n    return this.#referenceHistory?.[fieldName] ?? emptyArray;\n  }\n\n  get isDeletedAndFlushed(): boolean {\n    return this.#deleted === Operation.Complete;\n  }\n\n  /**\n   * Returns true if the entity is new or was new in this EM.\n   *\n   * This is primarily used for lazy-initializing relations, i.e. if:\n   *\n   * - A new `Author` is created\n   * - We `em.flush` the author to the database\n   * - Then `a1.books` is accessed for the first time\n   *\n   * We can have a high-confidence that `a1` has no books, because we just\n   * created it, so we can set the OneToManyCollection to loaded.\n   */\n  get isOrWasNew(): boolean {\n    // #new will be left as `complete`\n    return this.#new !== undefined;\n  }\n}\n\n/** An enum to track our insert/delete state progression. */\nenum Operation {\n  Pending = 1,\n  Flushed = 2,\n  Complete = 3,\n}\n\n/** A shared frozen bag for un-mutated entities; strict mode makes accidental writes throw. */\nconst emptyObject: Record<any, any> = Object.freeze({});\n\n/** A shared frozen array for fields with no remembered reference values. */\nconst emptyArray: readonly any[] = Object.freeze([]);\n"],"mappings":";;;;;;;AAOA,IAAa,eAAb,MAA0B;;CAExB;;CAEA;;CAEA;;CAEA,YAA0C,KAAA;;CAE1C,UAAmB;;CAEnB,WAAmB;;CAEnB;;CAEA,gBAA8C,KAAA;;CAE9C,oBAAuD,KAAA;;CAEvD;;CAEA,SAAiB;;CAEjB;;CAEA,cAAsB;;CAGtB,IAAIA,OAA8B;EAChC,MAAM,QAAQ,KAAKC,SAAS;EAC5B,OAAO,UAAU,IAAI,KAAA,IAAY;CACnC;CAEA,IAAID,KAAK,IAA2B;EAClC,KAAKC,SAAU,KAAKA,SAAS,MAAU,MAAM;CAC/C;;;;;;;;CASA,IAAIC,WAAkC;EACpC,MAAM,QAAS,KAAKD,UAAU,IAAK;EACnC,OAAO,UAAU,IAAI,KAAA,IAAY;CACnC;CAEA,IAAIC,SAAS,IAA2B;EACtC,KAAKD,SAAU,KAAKA,SAAS,OAAa,MAAM,MAAM;CACxD;;CAGA,IAAI,YAAqB;EACvB,QAAQ,KAAKA,SAAS,QAAa;CACrC;CAEA,IAAI,UAAU,OAAgB;EAC5B,KAAKA,SAAS,QAAQ,KAAKA,SAAS,KAAU,KAAKA,SAAS;CAC9D;;CAGA,YAAY,IAAmB,QAAgB,UAA0B,OAAgB;EACvF,KAAK,SAAS;EACd,KAAK,KAAK;EACV,KAAK,WAAW;EAChB,IAAI,OAAO;GACT,KAAKD,OAAAA;GACL,KAAK,OAAO,CAAC;GACb,KAAK,cAAc,KAAA;GACnB,IAAI,IAAI,KAAK,iBAAiB;EAChC,OAAO;GACL,KAAKA,OAAO,KAAA;GACZ,KAAK,OAAO,CAAC;GACb,KAAK,cAAc,KAAA;EACrB;CACF;;;;;;;;;;;;CAaA,UAAU,YAAyB;EACjC,OAAO,KAAK,QAAQ,IAAI,KAAK,UAAU,UAAU;CACnD;;CAGA,kBAAkB;EAChB,KAAK,cAAc,CAAC;EACpB,IAAI,KAAKA,SAAAA,GAA4B,KAAKA,OAAAA;EAC1C,IAAI,KAAKE,aAAAA,GAAgC,KAAKA,WAAAA;CAChD;CAEA,oBAAoB;EAClB,KAAKC,gBAAgB,KAAA;EACrB,KAAKC,oBAAoB,KAAA;EACzB,KAAK,cAAc,KAAA;EACnB,KAAK,YAAY;EACjB,IAAI,KAAKJ,SAAAA,KAA8B,KAAKA,SAAAA,GAC1C,KAAKA,OAAAA;EAEP,IAAI,KAAKE,aAAAA,KAAkC,KAAKA,aAAAA,GAC9C,KAAKA,WAAAA;EAEP,KAAK,mBAAmB;CAC1B;;CAGA,IAAI,cAAuB;EACzB,OAAO,KAAKF,SAAS,KAAA,KAAa,KAAKA,SAAAA;CACzC;;CAGA,IAAI,kBAA2B;EAC7B,OAAO,KAAKE,aAAa,KAAA;CAC3B;;CAGA,IAAI,eAAiC;EACnC,OAAO,KAAKC,iBAAiB;CAC/B;;CAGA,IAAI,gBAAyB;EAC3B,OAAO,UAAU,KAAKA,aAAa;CACrC;;CAGA,IAAI,mBAAqF;EACvF,IAAI,KAAKD,aAAa,KAAA,GAKpB,OAAO,KAAKA,aAAAA,KAAkC,KAAKF,SAAAA,IAC/C,yBACA,KAAKE,aAAAA,IACH,WACA;OACD,IAAI,KAAKF,SAAAA,GAEd,OAAO;OACF,IAAI,KAAK,aACd,OAAO,UAAU,KAAK,WAAW,IAAI,WAAW;OAEhD,OAAO,KAAK,aAAa,UAAU,KAAKG,aAAa,IAAI,WAAW;CAExE;CAEA,IAAI,gBAA0B;EAC5B,OAAO,OAAO,KAAK,KAAK,WAAW;CACrC;;CAGA,IAAI,cAAgC;EAClC,OAAO,KAAK,eAAe,KAAKA,iBAAiB;CACnD;;CAGA,6BAAmC;EACjC,KAAKD,WAAAA;CACP;;CAGA,cAAuB;EACrB,IAAI,KAAKA,aAAa,KAAA,GAAW;GAG/B,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,SAAS,SAAS,GAIvD,IAAI,MAAM,SAAS,SAAS,MAAM,SAAS,UAAU,MAAM,SAAS,SAAS,MAAM,SAAS,WAC1F,iBAAiB,KAAK,EAAE,CAAC,CAAC,cAAc,cAAc,KAAK,QAAQ,MAAM,SAAS;QAC7E,IAAI,MAAM,SAAS,eAAe,MAAM,SAAS,UAAU,MAAM,SAAS,cAAc,CAE/F,OAAO,IAAI,MAAM,SAAS,SAAS,MAAM,SAAS,OAAO,CAEzD,OAAO,IAAI,MAAM,SAAS,QAAQ,CAElC,OACE,MAAM,IAAI,MAAM,wBAAwB,OAAO;GAGnD,KAAKA,WAAAA;GACL,KAAK,iBAAiB;GACtB,OAAO;EACT;EACA,OAAO;CACT;CAEA,0BAAgC;EAE9B,KAAKA,WAAAA;EACL,KAAK,mBAAmB;CAC1B;;CAGA,cAAoB;EAClB,KAAK,YAAY;EACjB,KAAK,iBAAiB;CACxB;;CAGA,eAAe,WAAmB,OAAkB;EAClD,CAAC,KAAKC,kBAAkB,CAAC,EAAA,CAAG,aAAa;EACzC,KAAK,iBAAiB;CACxB;;CAGA,eAAe,WAAyB;EACtC,IAAI,KAAKA,eAAe,OAAO,KAAKA,cAAc;EAClD,KAAK,iBAAiB;CACxB;;CAGA,mBAAyB;EACvB,iBAAiB,KAAK,EAAE,CAAC,CAAC,iBAAiB,KAAK,MAAM;CACxD;;CAGA,qBAAmC;EACjC,iBAAiB,KAAK,EAAE,CAAC,CAAC,mBAAmB,KAAK,MAAM;CAC1D;;CAGA,uBAAuB,WAAmB,OAAkB;EAC1D,IAAI,UAAU,KAAA,GAAW;EACzB,MAAM,SAAU,CAAC,KAAKC,sBAAsB,CAAC,EAAA,CAAG,eAAe,CAAC;EAChE,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG,OAAO,KAAK,KAAK;CAChD;;CAGA,oBAAoB,WAAmC;EACrD,OAAO,KAAKA,oBAAoB,cAAc;CAChD;CAEA,IAAI,sBAA+B;EACjC,OAAO,KAAKF,aAAAA;CACd;;;;;;;;;;;;;CAcA,IAAI,aAAsB;EAExB,OAAO,KAAKF,SAAS,KAAA;CACvB;AACF;;AAUA,MAAM,cAAgC,OAAO,OAAO,CAAC,CAAC;;AAGtD,MAAM,aAA6B,OAAO,OAAO,CAAC,CAAC"}
+{"version":3,"file":"InstanceData.js","names":[],"sources":["../src/InstanceData.ts"],"sourcesContent":["import { type Entity } from \"src/Entity.ts\";\nimport { type EntityManager, getEmInternalApi } from \"src/EntityManager.ts\";\nimport { type EntityMetadata } from \"src/EntityMetadata.ts\";\nimport { type RowData, emptyRowData } from \"src/RowData.ts\";\nimport { hasAnyKey } from \"src/utils.ts\";\n\n/** The `#orm` metadata field we track on each instance. */\nexport class InstanceData {\n  /** The entity this instance data belongs to. */\n  readonly entity: Entity;\n  /** All entities must be associated to an `EntityManager` to handle lazy loading/etc. */\n  readonly em: EntityManager;\n  /** A pointer to our entity type's metadata. */\n  readonly metadata: EntityMetadata;\n  /** A bag for our lazy-initialized relations, allocated on first relation access. */\n  relations: Record<any, any> | undefined = undefined;\n  /** The as-loaded database row, i.e. our `rowIndex`-th row within our query's `RowData` result. */\n  rowData: RowData = emptyRowData;\n  /** Our row's index within `rowData`; see {@link RowData}. */\n  rowIndex: number = 0;\n  /** The domain-value of fields, lazily converted (if needed) on read from the database columns. */\n  data: Record<string, any>;\n  /** A bag to keep the original values, allocated on first mutation (most entities are never mutated). */\n  #originalData: Record<any, any> | undefined = undefined;\n  /** Reference values that were set during this unit of work, allocated on first m2o/poly change. */\n  #referenceHistory: Record<string, any[]> | undefined = undefined;\n  /** A bag to keep the flushed-to-database values, only for AsyncReactiveField reactivity. */\n  flushedData: Record<any, any> | undefined;\n  /** Packs the new/deleted `Operation`s + isTouched into one slot; see the accessors below. */\n  #flags: number = 0;\n  /** The `a#1`, `a#2` index if we're an em.create-d entity. We never unset this, to keep ids stable across flushes. */\n  createId: string | undefined;\n  /** The zero-based order this entity was registered with its EntityManager. */\n  entityIndex: number = -1;\n\n  /** Whether our entity is new or not. */\n  get #new(): Operation | undefined {\n    const value = this.#flags & 0b11;\n    return value === 0 ? undefined : value;\n  }\n\n  set #new(op: Operation | undefined) {\n    this.#flags = (this.#flags & ~0b11) | (op ?? 0);\n  }\n\n  /**\n   * Whether our entity has been deleted or not.\n   *\n   * - `pending` means we've been marked for deletion via `em.delete` but not issued a `DELETE`\n   * - `flushed` means we've flushed a `DELETE` but `em.flush` hasn't fully completed yet, likely due to AsyncReactiveField calcs\n   * - `deleted` means we've been flushed and `em.flush` has completed\n   */\n  get #deleted(): Operation | undefined {\n    const value = (this.#flags >> 2) & 0b11;\n    return value === 0 ? undefined : value;\n  }\n\n  set #deleted(op: Operation | undefined) {\n    this.#flags = (this.#flags & ~0b1100) | ((op ?? 0) << 2);\n  }\n\n  /** Whether our entity should flush regardless of any other changes. */\n  get isTouched(): boolean {\n    return (this.#flags & 0b10000) !== 0;\n  }\n\n  set isTouched(value: boolean) {\n    this.#flags = value ? this.#flags | 0b10000 : this.#flags & ~0b10000;\n  }\n\n  /** Creates the `#orm` field. */\n  constructor(em: EntityManager, entity: Entity, metadata: EntityMetadata, isNew: boolean) {\n    this.entity = entity;\n    this.em = em;\n    this.metadata = metadata;\n    if (isNew) {\n      this.#new = Operation.Pending;\n      this.data = {};\n      this.flushedData = undefined;\n      if (em) this.markMaybePending();\n    } else {\n      this.#new = undefined;\n      this.data = {};\n      this.flushedData = undefined;\n    }\n  }\n\n  /**\n   * Returns the as-loaded value of `columnName`, i.e. `getColumn(\"rank\")`.\n   *\n   * This saves callers from knowing that `rowData`/`rowIndex` are a pair, but note it is\n   * a snapshot of the query that loaded us, and specifically:\n   *\n   * - The value is driver-level, i.e. numeric enum ids, untagged foreign keys, and temporals\n   *   as strings; use `getField` if you want the domain value, and\n   * - The value is not updated by `em.flush`, so after a flush it is the pre-flush value, and\n   * - New entities have no row, so every column is `undefined`.\n   */\n  getColumn(columnName: string): any {\n    return this.rowData.get(this.rowIndex, columnName);\n  }\n\n  /** If `em.flush` has detected a dirty RQF, reset our internal dirty state, w/o reseting our external-dirty state. */\n  resetForRqfLoop() {\n    this.flushedData = {};\n    if (this.#new === Operation.Pending) this.#new = Operation.Flushed;\n    if (this.#deleted === Operation.Pending) this.#deleted = Operation.Flushed;\n  }\n\n  resetAfterFlushed() {\n    this.#originalData = undefined;\n    this.#referenceHistory = undefined;\n    this.flushedData = undefined;\n    this.isTouched = false;\n    if (this.#new === Operation.Pending || this.#new === Operation.Flushed) {\n      this.#new = Operation.Complete;\n    }\n    if (this.#deleted === Operation.Pending || this.#deleted === Operation.Flushed) {\n      this.#deleted = Operation.Complete;\n    }\n    this.unmarkMaybePending();\n  }\n\n  /** Our public-facing `isNewEntity`. */\n  get isNewEntity(): boolean {\n    return this.#new !== undefined && this.#new !== Operation.Complete;\n  }\n\n  /** Our public-facing `isDeletedEntity`. */\n  get isDeletedEntity(): boolean {\n    return this.#deleted !== undefined;\n  }\n\n  /** The original values of mutated fields; a shared empty object until the entity is actually mutated. */\n  get originalData(): Record<any, any> {\n    return this.#originalData ?? emptyObject;\n  }\n\n  /** Our public-facing `isDirtyEntity`. */\n  get isDirtyEntity(): boolean {\n    return hasAnyKey(this.#originalData);\n  }\n\n  /** This is our internal \"is pending flush\", which is aware of RQF micro-flush loops. */\n  get pendingOperation(): \"insert\" | \"update\" | \"delete\" | \"none\" | \"created-then-deleted\" {\n    if (this.#deleted !== undefined) {\n      // Mark entities that were created and them immediately `em.delete`-d; granted this is\n      // probably rare, but we shouldn't run hooks or have the driver try and delete these.\n      // Note that we return them, instead of skipping entirely, so that fixupCreatedThenDeleted\n      // can later be called.\n      return this.#deleted === Operation.Pending && this.#new === Operation.Pending\n        ? \"created-then-deleted\"\n        : this.#deleted === Operation.Pending\n          ? \"delete\"\n          : \"none\";\n    } else if (this.#new === Operation.Pending) {\n      // Per ^, if `#new === flushed`, we fall through to check if micro-flush UPDATEs are required\n      return \"insert\";\n    } else if (this.flushedData) {\n      return hasAnyKey(this.flushedData) ? \"update\" : \"none\";\n    } else {\n      return this.isTouched || hasAnyKey(this.#originalData) ? \"update\" : \"none\";\n    }\n  }\n\n  get changedFields(): string[] {\n    return Object.keys(this.changedData);\n  }\n\n  /** The changed-fields bag (flushedData during RQF loops, else originalData) without allocating a keys array. */\n  get changedData(): Record<any, any> {\n    return this.flushedData ?? this.#originalData ?? emptyObject;\n  }\n\n  /** Called when an `em.load` tries to find the entity and it's just gone from the db. */\n  markDeletedBecauseNotFound(): void {\n    this.#deleted = Operation.Complete;\n  }\n\n  /** Called by `em.delete`, returns true if this is new information. */\n  markDeleted(): boolean {\n    if (this.#deleted === undefined) {\n      // Let any OneToManyCollection/ReactiveField/ReactiveReference.get caches know that they should recalc\n      // (i.e. their filterDeleted logic) by asserting the `deleteBook.author` field is changing.\n      for (const field of Object.values(this.metadata.allFields)) {\n        // We only do reference/collection fields and skip the primitives, b/c we assume something like\n        // `{ books: \"title\" }` doesn't need `resetIsLoaded(..., \"title\")` b/c the same hint will also\n        // be watching \"did books change\", and so get reset that way.\n        if (field.kind === \"m2o\" || field.kind === \"poly\" || field.kind === \"m2m\" || field.kind === \"m2mEnum\") {\n          getEmInternalApi(this.em).isLoadedCache.resetIsLoaded(this.entity, field.fieldName);\n        } else if (field.kind === \"primitive\" || field.kind === \"enum\" || field.kind === \"primaryKey\") {\n          // Any reactable watching these fields will also be watching reference/collection\n        } else if (field.kind === \"o2m\" || field.kind === \"o2o\") {\n          // Any reactable watching these actually gets triggered by the primary m2o/poly side changing\n        } else if (field.kind === \"lo2m\") {\n          // Doesn't support reactivity\n        } else {\n          throw new Error(`Unhandled field kind ${field}`);\n        }\n      }\n      this.#deleted = Operation.Pending;\n      this.markMaybePending();\n      return true;\n    }\n    return false;\n  }\n\n  fixupCreatedThenDeleted(): void {\n    // Ideally we could do this via `resetAfterFlushed`?\n    this.#deleted = Operation.Complete;\n    this.unmarkMaybePending();\n  }\n\n  /** Marks this entity as needing a flush even if no fields changed. */\n  markTouched(): void {\n    this.isTouched = true;\n    this.markMaybePending();\n  }\n\n  /** Marks a field as dirty with its pre-mutation value. */\n  markFieldDirty(fieldName: string, value: any): void {\n    (this.#originalData ??= {})[fieldName] = value;\n    this.markMaybePending();\n  }\n\n  /** Marks a reverted field as clean again. */\n  markFieldClean(fieldName: string): void {\n    if (this.#originalData) delete this.#originalData[fieldName];\n    this.markMaybePending();\n  }\n\n  /** Marks this entity as a possible flush candidate. */\n  markMaybePending(): void {\n    getEmInternalApi(this.em).markMaybePending(this.entity);\n  }\n\n  /** Removes this entity from the possible flush candidate set. */\n  private unmarkMaybePending(): void {\n    getEmInternalApi(this.em).unmarkMaybePending(this.entity);\n  }\n\n  /** Remembers a reference value that may need to be reverse-walked later. */\n  rememberReferenceValue(fieldName: string, value: any): void {\n    if (value === undefined) return;\n    const values = ((this.#referenceHistory ??= {})[fieldName] ??= []);\n    if (!values.includes(value)) values.push(value);\n  }\n\n  /** Returns reference values that may need to be reverse-walked later. */\n  getReferenceHistory(fieldName: string): readonly any[] {\n    return this.#referenceHistory?.[fieldName] ?? emptyArray;\n  }\n\n  get isDeletedAndFlushed(): boolean {\n    return this.#deleted === Operation.Complete;\n  }\n\n  /**\n   * Returns true if the entity is new or was new in this EM.\n   *\n   * This is primarily used for lazy-initializing relations, i.e. if:\n   *\n   * - A new `Author` is created\n   * - We `em.flush` the author to the database\n   * - Then `a1.books` is accessed for the first time\n   *\n   * We can have a high-confidence that `a1` has no books, because we just\n   * created it, so we can set the OneToManyCollection to loaded.\n   */\n  get isOrWasNew(): boolean {\n    // #new will be left as `complete`\n    return this.#new !== undefined;\n  }\n}\n\n/** An enum to track our insert/delete state progression. */\nenum Operation {\n  Pending = 1,\n  Flushed = 2,\n  Complete = 3,\n}\n\n/** A shared frozen bag for un-mutated entities; strict mode makes accidental writes throw. */\nconst emptyObject: Record<any, any> = Object.freeze({});\n\n/** A shared frozen array for fields with no remembered reference values. */\nconst emptyArray: readonly any[] = Object.freeze([]);\n"],"mappings":";;;;;;;AAOA,IAAa,eAAb,MAA0B;;CAExB;;CAEA;;CAEA;;CAEA,YAA0C,KAAA;;CAE1C,UAAmB;;CAEnB,WAAmB;;CAEnB;;CAEA,gBAA8C,KAAA;;CAE9C,oBAAuD,KAAA;;CAEvD;;CAEA,SAAiB;;CAEjB;;CAEA,cAAsB;;CAGtB,IAAI,OAA8B;EAChC,MAAM,QAAQ,KAAK,SAAS;EAC5B,OAAO,UAAU,IAAI,KAAA,IAAY;CACnC;CAEA,IAAI,KAAK,IAA2B;EAClC,KAAK,SAAU,KAAK,SAAS,MAAU,MAAM;CAC/C;;;;;;;;CASA,IAAI,WAAkC;EACpC,MAAM,QAAS,KAAK,UAAU,IAAK;EACnC,OAAO,UAAU,IAAI,KAAA,IAAY;CACnC;CAEA,IAAI,SAAS,IAA2B;EACtC,KAAK,SAAU,KAAK,SAAS,OAAa,MAAM,MAAM;CACxD;;CAGA,IAAI,YAAqB;EACvB,QAAQ,KAAK,SAAS,QAAa;CACrC;CAEA,IAAI,UAAU,OAAgB;EAC5B,KAAK,SAAS,QAAQ,KAAK,SAAS,KAAU,KAAK,SAAS;CAC9D;;CAGA,YAAY,IAAmB,QAAgB,UAA0B,OAAgB;EACvF,KAAK,SAAS;EACd,KAAK,KAAK;EACV,KAAK,WAAW;EAChB,IAAI,OAAO;GACT,KAAK,OAAA;GACL,KAAK,OAAO,CAAC;GACb,KAAK,cAAc,KAAA;GACnB,IAAI,IAAI,KAAK,iBAAiB;EAChC,OAAO;GACL,KAAK,OAAO,KAAA;GACZ,KAAK,OAAO,CAAC;GACb,KAAK,cAAc,KAAA;EACrB;CACF;;;;;;;;;;;;CAaA,UAAU,YAAyB;EACjC,OAAO,KAAK,QAAQ,IAAI,KAAK,UAAU,UAAU;CACnD;;CAGA,kBAAkB;EAChB,KAAK,cAAc,CAAC;EACpB,IAAI,KAAK,SAAA,GAA4B,KAAK,OAAA;EAC1C,IAAI,KAAK,aAAA,GAAgC,KAAK,WAAA;CAChD;CAEA,oBAAoB;EAClB,KAAK,gBAAgB,KAAA;EACrB,KAAK,oBAAoB,KAAA;EACzB,KAAK,cAAc,KAAA;EACnB,KAAK,YAAY;EACjB,IAAI,KAAK,SAAA,KAA8B,KAAK,SAAA,GAC1C,KAAK,OAAA;EAEP,IAAI,KAAK,aAAA,KAAkC,KAAK,aAAA,GAC9C,KAAK,WAAA;EAEP,KAAK,mBAAmB;CAC1B;;CAGA,IAAI,cAAuB;EACzB,OAAO,KAAK,SAAS,KAAA,KAAa,KAAK,SAAA;CACzC;;CAGA,IAAI,kBAA2B;EAC7B,OAAO,KAAK,aAAa,KAAA;CAC3B;;CAGA,IAAI,eAAiC;EACnC,OAAO,KAAK,iBAAiB;CAC/B;;CAGA,IAAI,gBAAyB;EAC3B,OAAO,UAAU,KAAK,aAAa;CACrC;;CAGA,IAAI,mBAAqF;EACvF,IAAI,KAAK,aAAa,KAAA,GAKpB,OAAO,KAAK,aAAA,KAAkC,KAAK,SAAA,IAC/C,yBACA,KAAK,aAAA,IACH,WACA;OACD,IAAI,KAAK,SAAA,GAEd,OAAO;OACF,IAAI,KAAK,aACd,OAAO,UAAU,KAAK,WAAW,IAAI,WAAW;OAEhD,OAAO,KAAK,aAAa,UAAU,KAAK,aAAa,IAAI,WAAW;CAExE;CAEA,IAAI,gBAA0B;EAC5B,OAAO,OAAO,KAAK,KAAK,WAAW;CACrC;;CAGA,IAAI,cAAgC;EAClC,OAAO,KAAK,eAAe,KAAK,iBAAiB;CACnD;;CAGA,6BAAmC;EACjC,KAAK,WAAA;CACP;;CAGA,cAAuB;EACrB,IAAI,KAAK,aAAa,KAAA,GAAW;GAG/B,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,SAAS,SAAS,GAIvD,IAAI,MAAM,SAAS,SAAS,MAAM,SAAS,UAAU,MAAM,SAAS,SAAS,MAAM,SAAS,WAC1F,iBAAiB,KAAK,EAAE,CAAC,CAAC,cAAc,cAAc,KAAK,QAAQ,MAAM,SAAS;QAC7E,IAAI,MAAM,SAAS,eAAe,MAAM,SAAS,UAAU,MAAM,SAAS,cAAc,CAE/F,OAAO,IAAI,MAAM,SAAS,SAAS,MAAM,SAAS,OAAO,CAEzD,OAAO,IAAI,MAAM,SAAS,QAAQ,CAElC,OACE,MAAM,IAAI,MAAM,wBAAwB,OAAO;GAGnD,KAAK,WAAA;GACL,KAAK,iBAAiB;GACtB,OAAO;EACT;EACA,OAAO;CACT;CAEA,0BAAgC;EAE9B,KAAK,WAAA;EACL,KAAK,mBAAmB;CAC1B;;CAGA,cAAoB;EAClB,KAAK,YAAY;EACjB,KAAK,iBAAiB;CACxB;;CAGA,eAAe,WAAmB,OAAkB;EAClD,CAAC,KAAK,kBAAkB,CAAC,EAAA,CAAG,aAAa;EACzC,KAAK,iBAAiB;CACxB;;CAGA,eAAe,WAAyB;EACtC,IAAI,KAAK,eAAe,OAAO,KAAK,cAAc;EAClD,KAAK,iBAAiB;CACxB;;CAGA,mBAAyB;EACvB,iBAAiB,KAAK,EAAE,CAAC,CAAC,iBAAiB,KAAK,MAAM;CACxD;;CAGA,qBAAmC;EACjC,iBAAiB,KAAK,EAAE,CAAC,CAAC,mBAAmB,KAAK,MAAM;CAC1D;;CAGA,uBAAuB,WAAmB,OAAkB;EAC1D,IAAI,UAAU,KAAA,GAAW;EACzB,MAAM,SAAU,CAAC,KAAK,sBAAsB,CAAC,EAAA,CAAG,eAAe,CAAC;EAChE,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG,OAAO,KAAK,KAAK;CAChD;;CAGA,oBAAoB,WAAmC;EACrD,OAAO,KAAK,oBAAoB,cAAc;CAChD;CAEA,IAAI,sBAA+B;EACjC,OAAO,KAAK,aAAA;CACd;;;;;;;;;;;;;CAcA,IAAI,aAAsB;EAExB,OAAO,KAAK,SAAS,KAAA;CACvB;AACF;;AAUA,MAAM,cAAgC,OAAO,OAAO,CAAC,CAAC;;AAGtD,MAAM,aAA6B,OAAO,OAAO,CAAC,CAAC"}

package/build/PluginManager.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"PluginManager.cjs","names":["isDefined","#pluginsByCallback","#plugins"],"sources":["../src/PluginManager.ts"],"sourcesContent":["import { type Entity } from \"src/Entity.ts\";\nimport { type EntityManager, type FindOperation, isDefined } from \"src/EntityManager.ts\";\nimport { type EntityMetadata } from \"src/EntityMetadata.ts\";\nimport type { JoinRowTodo, Todo } from \"src/flush/Todo.ts\";\nimport type { ParsedFindQuery } from \"src/queries/find/QueryParser.ts\";\nimport { type RowData } from \"src/RowData.ts\";\n\ninterface PluginMethods {\n  /**\n   * Called before a field value is retrieved from an entity via getField.\n   *\n   * @param entity The entity instance being accessed\n   * @param field The field name being retrieved\n   */\n  beforeGetField?(entity: Entity, field: string): void;\n  /**\n   * Called before a field value is set on an entity via setField.\n   *\n   * @param entity The entity instance being modified\n   * @param field The field name being set\n   * @param newValue The new value being assigned to the field\n   */\n  beforeSetField?(entity: Entity, field: string, newValue: any): void;\n  /**\n   * Called before a find operation is executed.\n   *\n   * @param meta Metadata for the entity type being queried\n   * @param operation The type of find operation being performed\n   * @param query The parsed query conditions\n   * @param settings Query settings including limit and offset\n   */\n  beforeFind?(\n    meta: EntityMetadata,\n    operation: FindOperation,\n    query: ParsedFindQuery,\n    settings: {\n      limit?: number;\n      offset?: number;\n      allowMultipleLeftJoins?: boolean;\n      optimizeJoinsToExists?: boolean;\n      pruneJoins?: boolean;\n      keepAliases?: string[];\n    },\n  ): void;\n  /**\n   * Called after a find operation has been executed to observe the raw database rows.\n   *\n   * The result is an observation-only {@link RowData} view — i.e. `rows.rowCount` for metrics,\n   * `rows.get(i, columnName)` for specific cells, or `rows.toRows()` to materialize POJO rows.\n   * For lazy results, cells decode on access, so a hook that only counts rows costs nothing;\n   * materializing via `toRows()` decodes every cell of every row. Mutating materialized rows is\n   * unsupported and is not guaranteed to affect entity hydration.\n   *\n   * @param meta Metadata for the entity type that was queried\n   * @param operation The type of find operation that was performed\n   * @param rows A read-only view of the raw database rows returned from the query\n   */\n  afterFind?(meta: EntityMetadata, operation: FindOperation, rows: RowData): void;\n\n  beforeValidate?(entities: readonly Entity[]): Promise<void> | void;\n\n  afterValidate?(entities: readonly Entity[]): Promise<void> | void;\n\n  afterWrite(entityTodos: Record<string, Todo>, joinRowTodos: Record<string, JoinRowTodo>): void;\n}\n\nconst syncPluginMethods = [\n  \"beforeGetField\",\n  \"beforeSetField\",\n  \"beforeFind\",\n  \"afterFind\",\n  \"afterWrite\",\n] as const satisfies readonly (keyof PluginMethods)[];\nconst asyncPluginMethods = [\"beforeValidate\", \"afterValidate\"] as const satisfies readonly (keyof PluginMethods)[];\nconst emsSymbol = Symbol(\"ems\");\n/**\n * Base class for plugins that hook into entity lifecycle events.\n *\n * Plugins can implement any of the PluginMethods to intercept entity operations\n * and are automatically registered with the EntityManager when added via PluginManager.\n */\nexport abstract class Plugin {\n  // We need to store the EntityManager references in a WeakRef array so that they can be garbage collected.  If we\n  // didn't do this, then multiple EMs with the same plugin instance could keep each other from being garbage collected.\n  [emsSymbol]: WeakRef<EntityManager>[] = [];\n\n  maybeCloneForNewEm(): this | undefined {\n    return undefined;\n  }\n\n  get ems(): readonly EntityManager[] {\n    return this[emsSymbol]\n      .values()\n      .map((wr) => wr.deref())\n      .filter(isDefined)\n      .toArray();\n  }\n}\n\nexport interface Plugin extends PluginMethods {}\n\n/**\n * Manages plugin lifecycle and dispatches plugin callbacks to registered plugins.\n *\n * The PluginManager optimizes callback dispatch by only creating dispatcher methods\n * for callbacks that have at least one registered plugin, making unused plugin hooks\n * zero-cost at runtime.\n */\nexport class PluginManager implements Required<PluginMethods> {\n  #plugins = new Set<Plugin>();\n  readonly #pluginsByCallback: Partial<Record<keyof Plugin, Plugin[]>> = {};\n  constructor(public readonly em: EntityManager) {}\n\n  /** Returns whether any registered plugin implements `method`, i.e. so callers can skip building its args. */\n  hasHook(method: keyof PluginMethods): boolean {\n    return this.#pluginsByCallback[method] !== undefined;\n  }\n\n  /**\n   * Registers a plugin with this EntityManager.\n   *\n   * Dynamically creates dispatcher methods for any plugin callbacks implemented by this plugin,\n   * enabling lazy initialization of only the hooks that are actually used.\n   *\n   * @throws Error if the plugin is already registered with another EntityManager\n   */\n  addPlugin(plugin: Plugin) {\n    if (this.#plugins.has(plugin)) return; // if we're already added, then we can just early exit\n    this.#plugins.add(plugin);\n    plugin[emsSymbol].push(new WeakRef(this.em));\n    for (const method of syncPluginMethods) {\n      if (method in plugin) {\n        (this.#pluginsByCallback[method] ??= []).push(plugin);\n        // As a performance optimization, we only create the actual implementation for each method on the plugin manager\n        // once we have at least one plugin using that method. This is to make it so any unused plugin methods are\n        // effectively no-ops when called from within the em.\n        if (!Object.hasOwn(this, method)) {\n          this[method] = function (this: PluginManager, ...args: any[]) {\n            for (const plugin of this.#pluginsByCallback[method]!) {\n              (plugin[method] as (...args: any[]) => unknown)(...args);\n            }\n          };\n        }\n      }\n    }\n    for (const method of asyncPluginMethods) {\n      if (method in plugin) {\n        (this.#pluginsByCallback[method] ??= []).push(plugin);\n        // Validate-phase plugin hooks are intentionally awaited without making hot-path hooks async.\n        if (!Object.hasOwn(this, method)) {\n          this[method] = async function (this: PluginManager, ...args: any[]) {\n            for (const plugin of this.#pluginsByCallback[method]!) {\n              await (plugin[method] as (...args: any[]) => Promise<void> | void)(...args);\n            }\n          };\n        }\n      }\n    }\n  }\n\n  get plugins(): readonly Plugin[] {\n    return [...this.#plugins];\n  }\n\n  cloneTo(other: PluginManager) {\n    this.#plugins\n      .values()\n      .map((plugin) => plugin.maybeCloneForNewEm())\n      .filter(isDefined)\n      .forEach((plugin) => other.addPlugin(plugin));\n  }\n\n  // Defined as no-op functions initially instead of using optional chaining for performance reasons, see:\n  // https://adventures.nodeland.dev/archive/noop-functions-vs-optional-chaining-a-performance/\n\n  beforeGetField(entity: Entity, field: string): void {}\n  beforeSetField(entity: Entity, field: string, newValue: any): void {}\n  beforeFind(\n    meta: EntityMetadata,\n    operation: FindOperation,\n    query: ParsedFindQuery,\n    settings: {\n      limit?: number;\n      offset?: number;\n      allowMultipleLeftJoins?: boolean;\n      optimizeJoinsToExists?: boolean;\n      pruneJoins?: boolean;\n      keepAliases?: string[];\n    },\n  ): void {}\n  afterFind(meta: EntityMetadata, operation: FindOperation, rows: RowData) {}\n  beforeValidate(entities: readonly Entity[]): Promise<void> | void {}\n  afterValidate(entities: readonly Entity[]): Promise<void> | void {}\n  afterWrite(entityTodos: Record<string, Todo>, joinRowTodos: Record<string, JoinRowTodo>): void {}\n}\n"],"mappings":";;;;;AAkEA,MAAM,oBAAoB;CACxB;CACA;CACA;CACA;CACA;AACF;AACA,MAAM,qBAAqB,CAAC,kBAAkB,eAAe;AAC7D,MAAM,YAAY,OAAO,KAAK;;;;;;;AAO9B,IAAsB,SAAtB,MAA6B;CAG3B,CAAC,aAAuC,CAAC;CAEzC,qBAAuC,CAEvC;CAEA,IAAI,MAAgC;EAClC,OAAO,KAAK,UAAU,CACnB,OAAO,CAAC,CACR,KAAK,OAAO,GAAG,MAAM,CAAC,CAAC,CACvB,OAAOA,sBAAAA,SAAS,CAAC,CACjB,QAAQ;CACb;AACF;;;;;;;;AAWA,IAAa,gBAAb,MAA8D;CAGhC;CAF5B,2BAAW,IAAI,IAAY;CAC3B,qBAAuE,CAAC;CACxE,YAAY,IAAmC;EAAnB,KAAA,KAAA;CAAoB;;CAGhD,QAAQ,QAAsC;EAC5C,OAAO,KAAKC,mBAAmB,YAAY,KAAA;CAC7C;;;;;;;;;CAUA,UAAU,QAAgB;EACxB,IAAI,KAAKC,SAAS,IAAI,MAAM,GAAG;EAC/B,KAAKA,SAAS,IAAI,MAAM;EACxB,OAAO,UAAU,CAAC,KAAK,IAAI,QAAQ,KAAK,EAAE,CAAC;EAC3C,KAAK,MAAM,UAAU,mBACnB,IAAI,UAAU,QAAQ;GACpB,CAAC,KAAKD,mBAAmB,YAAY,CAAC,EAAA,CAAG,KAAK,MAAM;GAIpD,IAAI,CAAC,OAAO,OAAO,MAAM,MAAM,GAC7B,KAAK,UAAU,SAA+B,GAAG,MAAa;IAC5D,KAAK,MAAM,UAAU,KAAKA,mBAAmB,SAC3C,OAAQ,OAAO,CAAiC,GAAG,IAAI;GAE3D;EAEJ;EAEF,KAAK,MAAM,UAAU,oBACnB,IAAI,UAAU,QAAQ;GACpB,CAAC,KAAKA,mBAAmB,YAAY,CAAC,EAAA,CAAG,KAAK,MAAM;GAEpD,IAAI,CAAC,OAAO,OAAO,MAAM,MAAM,GAC7B,KAAK,UAAU,eAAqC,GAAG,MAAa;IAClE,KAAK,MAAM,UAAU,KAAKA,mBAAmB,SAC3C,MAAO,OAAO,OAAO,CAA8C,GAAG,IAAI;GAE9E;EAEJ;CAEJ;CAEA,IAAI,UAA6B;EAC/B,OAAO,CAAC,GAAG,KAAKC,QAAQ;CAC1B;CAEA,QAAQ,OAAsB;EAC5B,KAAKA,SACF,OAAO,CAAC,CACR,KAAK,WAAW,OAAO,mBAAmB,CAAC,CAAC,CAC5C,OAAOF,sBAAAA,SAAS,CAAC,CACjB,SAAS,WAAW,MAAM,UAAU,MAAM,CAAC;CAChD;CAKA,eAAe,QAAgB,OAAqB,CAAC;CACrD,eAAe,QAAgB,OAAe,UAAqB,CAAC;CACpE,WACE,MACA,WACA,OACA,UAQM,CAAC;CACT,UAAU,MAAsB,WAA0B,MAAe,CAAC;CAC1E,eAAe,UAAmD,CAAC;CACnE,cAAc,UAAmD,CAAC;CAClE,WAAW,aAAmC,cAAiD,CAAC;AAClG"}
+{"version":3,"file":"PluginManager.cjs","names":["isDefined"],"sources":["../src/PluginManager.ts"],"sourcesContent":["import { type Entity } from \"src/Entity.ts\";\nimport { type EntityManager, type FindOperation, isDefined } from \"src/EntityManager.ts\";\nimport { type EntityMetadata } from \"src/EntityMetadata.ts\";\nimport type { JoinRowTodo, Todo } from \"src/flush/Todo.ts\";\nimport type { ParsedFindQuery } from \"src/queries/find/QueryParser.ts\";\nimport { type RowData } from \"src/RowData.ts\";\n\ninterface PluginMethods {\n  /**\n   * Called before a field value is retrieved from an entity via getField.\n   *\n   * @param entity The entity instance being accessed\n   * @param field The field name being retrieved\n   */\n  beforeGetField?(entity: Entity, field: string): void;\n  /**\n   * Called before a field value is set on an entity via setField.\n   *\n   * @param entity The entity instance being modified\n   * @param field The field name being set\n   * @param newValue The new value being assigned to the field\n   */\n  beforeSetField?(entity: Entity, field: string, newValue: any): void;\n  /**\n   * Called before a find operation is executed.\n   *\n   * @param meta Metadata for the entity type being queried\n   * @param operation The type of find operation being performed\n   * @param query The parsed query conditions\n   * @param settings Query settings including limit and offset\n   */\n  beforeFind?(\n    meta: EntityMetadata,\n    operation: FindOperation,\n    query: ParsedFindQuery,\n    settings: {\n      limit?: number;\n      offset?: number;\n      allowMultipleLeftJoins?: boolean;\n      optimizeJoinsToExists?: boolean;\n      pruneJoins?: boolean;\n      keepAliases?: string[];\n    },\n  ): void;\n  /**\n   * Called after a find operation has been executed to observe the raw database rows.\n   *\n   * The result is an observation-only {@link RowData} view — i.e. `rows.rowCount` for metrics,\n   * `rows.get(i, columnName)` for specific cells, or `rows.toRows()` to materialize POJO rows.\n   * For lazy results, cells decode on access, so a hook that only counts rows costs nothing;\n   * materializing via `toRows()` decodes every cell of every row. Mutating materialized rows is\n   * unsupported and is not guaranteed to affect entity hydration.\n   *\n   * @param meta Metadata for the entity type that was queried\n   * @param operation The type of find operation that was performed\n   * @param rows A read-only view of the raw database rows returned from the query\n   */\n  afterFind?(meta: EntityMetadata, operation: FindOperation, rows: RowData): void;\n\n  beforeValidate?(entities: readonly Entity[]): Promise<void> | void;\n\n  afterValidate?(entities: readonly Entity[]): Promise<void> | void;\n\n  afterWrite(entityTodos: Record<string, Todo>, joinRowTodos: Record<string, JoinRowTodo>): void;\n}\n\nconst syncPluginMethods = [\n  \"beforeGetField\",\n  \"beforeSetField\",\n  \"beforeFind\",\n  \"afterFind\",\n  \"afterWrite\",\n] as const satisfies readonly (keyof PluginMethods)[];\nconst asyncPluginMethods = [\"beforeValidate\", \"afterValidate\"] as const satisfies readonly (keyof PluginMethods)[];\nconst emsSymbol = Symbol(\"ems\");\n/**\n * Base class for plugins that hook into entity lifecycle events.\n *\n * Plugins can implement any of the PluginMethods to intercept entity operations\n * and are automatically registered with the EntityManager when added via PluginManager.\n */\nexport abstract class Plugin {\n  // We need to store the EntityManager references in a WeakRef array so that they can be garbage collected.  If we\n  // didn't do this, then multiple EMs with the same plugin instance could keep each other from being garbage collected.\n  [emsSymbol]: WeakRef<EntityManager>[] = [];\n\n  maybeCloneForNewEm(): this | undefined {\n    return undefined;\n  }\n\n  get ems(): readonly EntityManager[] {\n    return this[emsSymbol]\n      .values()\n      .map((wr) => wr.deref())\n      .filter(isDefined)\n      .toArray();\n  }\n}\n\nexport interface Plugin extends PluginMethods {}\n\n/**\n * Manages plugin lifecycle and dispatches plugin callbacks to registered plugins.\n *\n * The PluginManager optimizes callback dispatch by only creating dispatcher methods\n * for callbacks that have at least one registered plugin, making unused plugin hooks\n * zero-cost at runtime.\n */\nexport class PluginManager implements Required<PluginMethods> {\n  #plugins = new Set<Plugin>();\n  readonly #pluginsByCallback: Partial<Record<keyof Plugin, Plugin[]>> = {};\n  constructor(public readonly em: EntityManager) {}\n\n  /** Returns whether any registered plugin implements `method`, i.e. so callers can skip building its args. */\n  hasHook(method: keyof PluginMethods): boolean {\n    return this.#pluginsByCallback[method] !== undefined;\n  }\n\n  /**\n   * Registers a plugin with this EntityManager.\n   *\n   * Dynamically creates dispatcher methods for any plugin callbacks implemented by this plugin,\n   * enabling lazy initialization of only the hooks that are actually used.\n   *\n   * @throws Error if the plugin is already registered with another EntityManager\n   */\n  addPlugin(plugin: Plugin) {\n    if (this.#plugins.has(plugin)) return; // if we're already added, then we can just early exit\n    this.#plugins.add(plugin);\n    plugin[emsSymbol].push(new WeakRef(this.em));\n    for (const method of syncPluginMethods) {\n      if (method in plugin) {\n        (this.#pluginsByCallback[method] ??= []).push(plugin);\n        // As a performance optimization, we only create the actual implementation for each method on the plugin manager\n        // once we have at least one plugin using that method. This is to make it so any unused plugin methods are\n        // effectively no-ops when called from within the em.\n        if (!Object.hasOwn(this, method)) {\n          this[method] = function (this: PluginManager, ...args: any[]) {\n            for (const plugin of this.#pluginsByCallback[method]!) {\n              (plugin[method] as (...args: any[]) => unknown)(...args);\n            }\n          };\n        }\n      }\n    }\n    for (const method of asyncPluginMethods) {\n      if (method in plugin) {\n        (this.#pluginsByCallback[method] ??= []).push(plugin);\n        // Validate-phase plugin hooks are intentionally awaited without making hot-path hooks async.\n        if (!Object.hasOwn(this, method)) {\n          this[method] = async function (this: PluginManager, ...args: any[]) {\n            for (const plugin of this.#pluginsByCallback[method]!) {\n              await (plugin[method] as (...args: any[]) => Promise<void> | void)(...args);\n            }\n          };\n        }\n      }\n    }\n  }\n\n  get plugins(): readonly Plugin[] {\n    return [...this.#plugins];\n  }\n\n  cloneTo(other: PluginManager) {\n    this.#plugins\n      .values()\n      .map((plugin) => plugin.maybeCloneForNewEm())\n      .filter(isDefined)\n      .forEach((plugin) => other.addPlugin(plugin));\n  }\n\n  // Defined as no-op functions initially instead of using optional chaining for performance reasons, see:\n  // https://adventures.nodeland.dev/archive/noop-functions-vs-optional-chaining-a-performance/\n\n  beforeGetField(entity: Entity, field: string): void {}\n  beforeSetField(entity: Entity, field: string, newValue: any): void {}\n  beforeFind(\n    meta: EntityMetadata,\n    operation: FindOperation,\n    query: ParsedFindQuery,\n    settings: {\n      limit?: number;\n      offset?: number;\n      allowMultipleLeftJoins?: boolean;\n      optimizeJoinsToExists?: boolean;\n      pruneJoins?: boolean;\n      keepAliases?: string[];\n    },\n  ): void {}\n  afterFind(meta: EntityMetadata, operation: FindOperation, rows: RowData) {}\n  beforeValidate(entities: readonly Entity[]): Promise<void> | void {}\n  afterValidate(entities: readonly Entity[]): Promise<void> | void {}\n  afterWrite(entityTodos: Record<string, Todo>, joinRowTodos: Record<string, JoinRowTodo>): void {}\n}\n"],"mappings":";;;;;AAkEA,MAAM,oBAAoB;CACxB;CACA;CACA;CACA;CACA;AACF;AACA,MAAM,qBAAqB,CAAC,kBAAkB,eAAe;AAC7D,MAAM,YAAY,OAAO,KAAK;;;;;;;AAO9B,IAAsB,SAAtB,MAA6B;CAG3B,CAAC,aAAuC,CAAC;CAEzC,qBAAuC,CAEvC;CAEA,IAAI,MAAgC;EAClC,OAAO,KAAK,UAAU,CACnB,OAAO,CAAC,CACR,KAAK,OAAO,GAAG,MAAM,CAAC,CAAC,CACvB,OAAOA,sBAAAA,SAAS,CAAC,CACjB,QAAQ;CACb;AACF;;;;;;;;AAWA,IAAa,gBAAb,MAA8D;CAGhC;CAF5B,2BAAW,IAAI,IAAY;CAC3B,qBAAuE,CAAC;CACxE,YAAY,IAAmC;EAAnB,KAAA,KAAA;CAAoB;;CAGhD,QAAQ,QAAsC;EAC5C,OAAO,KAAK,mBAAmB,YAAY,KAAA;CAC7C;;;;;;;;;CAUA,UAAU,QAAgB;EACxB,IAAI,KAAK,SAAS,IAAI,MAAM,GAAG;EAC/B,KAAK,SAAS,IAAI,MAAM;EACxB,OAAO,UAAU,CAAC,KAAK,IAAI,QAAQ,KAAK,EAAE,CAAC;EAC3C,KAAK,MAAM,UAAU,mBACnB,IAAI,UAAU,QAAQ;GACpB,CAAC,KAAK,mBAAmB,YAAY,CAAC,EAAA,CAAG,KAAK,MAAM;GAIpD,IAAI,CAAC,OAAO,OAAO,MAAM,MAAM,GAC7B,KAAK,UAAU,SAA+B,GAAG,MAAa;IAC5D,KAAK,MAAM,UAAU,KAAK,mBAAmB,SAC3C,OAAQ,OAAO,CAAiC,GAAG,IAAI;GAE3D;EAEJ;EAEF,KAAK,MAAM,UAAU,oBACnB,IAAI,UAAU,QAAQ;GACpB,CAAC,KAAK,mBAAmB,YAAY,CAAC,EAAA,CAAG,KAAK,MAAM;GAEpD,IAAI,CAAC,OAAO,OAAO,MAAM,MAAM,GAC7B,KAAK,UAAU,eAAqC,GAAG,MAAa;IAClE,KAAK,MAAM,UAAU,KAAK,mBAAmB,SAC3C,MAAO,OAAO,OAAO,CAA8C,GAAG,IAAI;GAE9E;EAEJ;CAEJ;CAEA,IAAI,UAA6B;EAC/B,OAAO,CAAC,GAAG,KAAK,QAAQ;CAC1B;CAEA,QAAQ,OAAsB;EAC5B,KAAK,SACF,OAAO,CAAC,CACR,KAAK,WAAW,OAAO,mBAAmB,CAAC,CAAC,CAC5C,OAAOA,sBAAAA,SAAS,CAAC,CACjB,SAAS,WAAW,MAAM,UAAU,MAAM,CAAC;CAChD;CAKA,eAAe,QAAgB,OAAqB,CAAC;CACrD,eAAe,QAAgB,OAAe,UAAqB,CAAC;CACpE,WACE,MACA,WACA,OACA,UAQM,CAAC;CACT,UAAU,MAAsB,WAA0B,MAAe,CAAC;CAC1E,eAAe,UAAmD,CAAC;CACnE,cAAc,UAAmD,CAAC;CAClE,WAAW,aAAmC,cAAiD,CAAC;AAClG"}