joist-core 2.3.0-next.97 → 2.3.0-next.98

package/build/relations/RecursiveCollection.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"RecursiveCollection.cjs","names":["lazyField","AbstractRelationImpl","getMetadata","RelationT","RelationU","#fieldName","#m2oName","#otherFieldName","#loaded","#loadPromise","recursiveParentsBatchLoader","appendStack","RecursiveCycleError","isReference","isLoadedReference","#o2mName","recursiveChildrenBatchLoader","isCollection","isLoadedCollection","isOneToOneReference","isLoadedOneToOneReference","#m2mName","recursiveM2mBatchLoader","fail"],"sources":["../../src/relations/RecursiveCollection.ts"],"sourcesContent":["import { recursiveChildrenBatchLoader } from \"../batchloaders/recursiveChildrenBatchLoader.ts\";\nimport { recursiveM2mBatchLoader } from \"../batchloaders/recursiveM2mBatchLoader.ts\";\nimport { recursiveParentsBatchLoader } from \"../batchloaders/recursiveParentsBatchLoader.ts\";\nimport {\n  type Entity,\n  type EntityMetadata,\n  type ManyToManyField,\n  type Reference,\n  type Relation,\n  appendStack,\n  ensureNotDeleted,\n  fail,\n  getEmInternalApi,\n  getMetadata,\n  isCollection,\n  isLoadedCollection,\n  isLoadedOneToOneReference,\n  isLoadedReference,\n  isOneToOneReference,\n  isReference,\n} from \"../index.ts\";\nimport { type IsLoadedCachable } from \"../IsLoadedCache.ts\";\nimport { lazyField } from \"../newEntity.ts\";\nimport { AbstractRelationImpl } from \"./AbstractRelationImpl.ts\";\nimport { type ReadOnlyCollection } from \"./ReadOnlyCollection.ts\";\nimport { RecursiveCycleError } from \"./RecursiveCycleError.ts\";\nimport { RelationT, RelationU } from \"./RelationSymbols.ts\";\n\nexport { RecursiveCycleError };\n\n/**\n * An alias for creating `RecursiveParentsCollectionImpl`s.\n *\n * I.e. for `Author.mentor` (m2o fk), we can return `Author.mentorsRecursive` recursively looking up.\n */\nexport function hasRecursiveParents<T extends Entity, U extends Entity>(\n  m2oName: keyof T & string, // i.e. `author.mentor`\n  otherFieldName: keyof T & string, // i.e. `author.menteesRecursive`\n): ReadOnlyCollection<T, U> {\n  return lazyField((entity: T, fieldName) => {\n    return new RecursiveParentsCollectionImpl(entity, fieldName as keyof T & string, m2oName, otherFieldName);\n  });\n}\n\n/**\n * An alias for creating `RecursiveChildrenCollectionImpl`s.\n *\n * I.e. for `Author.mentees` (o2m), we can return `Author.menteesRecursive` recursively looking down.\n */\nexport function hasRecursiveChildren<T extends Entity, U extends Entity>(\n  o2mName: keyof T & string, // i.e. `author.mentees`\n  otherFieldName: keyof T & string, // i.e. `author.mentorsRecursive`\n): ReadOnlyCollection<T, U> {\n  return lazyField((entity: T, fieldName) => {\n    return new RecursiveChildrenCollectionImpl(entity, fieldName as keyof T & string, o2mName, otherFieldName);\n  });\n}\n\n/**\n * An alias for creating `RecursiveM2mCollectionImpl`s.\n *\n * I.e. for `User.parents` (m2m), we can return `User.parentsRecursive` recursively looking up through the m2m.\n * Or for `User.children` (m2m), we can return `User.childrenRecursive` recursively looking down.\n */\nexport function hasRecursiveM2m<T extends Entity, U extends Entity>(\n  m2mName: keyof T & string, // i.e. `user.parents` or `user.children`\n  otherFieldName: keyof T & string, // i.e. `user.childrenRecursive` or `user.parentsRecursive`\n): ReadOnlyCollection<T, U> {\n  return lazyField((entity: T, fieldName) => {\n    return new RecursiveM2mCollectionImpl(entity, fieldName as keyof T & string, m2mName, otherFieldName);\n  });\n}\n\n/**\n * A base class for the common methods between the parent & children recursive collections.\n *\n * We could probably move some of this into AbstractRelationImpl?\n */\nabstract class AbstractRecursiveCollectionImpl<T extends Entity, U extends Entity> extends AbstractRelationImpl<\n  T,\n  U[]\n> {\n  abstract fieldName: string;\n\n  get get(): U[] {\n    return this.filterDeleted(this.doGet(), { withDeleted: false });\n  }\n\n  get getWithDeleted(): U[] {\n    return this.filterDeleted(this.doGet(), { withDeleted: true });\n  }\n\n  setFromOpts(): void {\n    throw new Error(\"Method not implemented.\");\n  }\n\n  set(): void {\n    throw new Error(\"Method not implemented.\");\n  }\n\n  get isPreloaded(): boolean {\n    return false;\n  }\n\n  preload(): void {\n    throw new Error(\"Method not implemented.\");\n  }\n\n  cleanupOnEntityDeleted(): Promise<void> {\n    return Promise.resolve();\n  }\n\n  maybeCascadeDelete(): void {}\n\n  get meta(): EntityMetadata {\n    return getMetadata(this.entity);\n  }\n\n  abstract doGet(): U[];\n\n  /** Removes pending-hard-delete or soft-deleted entities, unless explicitly asked for. */\n  protected filterDeleted(entities: U[], opts?: { withDeleted?: boolean }): U[] {\n    return opts?.withDeleted === true\n      ? [...entities]\n      : entities.filter((e) => !e.isDeletedEntity && !(e as any).isSoftDeletedEntity);\n  }\n\n  [RelationT]: T = null!;\n  [RelationU]: U = null!;\n}\n\nexport class RecursiveParentsCollectionImpl<T extends Entity, U extends Entity>\n  extends AbstractRecursiveCollectionImpl<T, U>\n  implements ReadOnlyCollection<T, U>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #m2oName: keyof T & string;\n  readonly #otherFieldName: keyof T & string;\n  #loaded: boolean | undefined = undefined;\n  #loadPromise: Promise<void> | undefined;\n\n  constructor(entity: T, fieldName: keyof T & string, m2oName: keyof T & string, otherFieldName: keyof T & string) {\n    super(entity);\n    this.#fieldName = fieldName;\n    this.#m2oName = m2oName;\n    this.#otherFieldName = otherFieldName;\n  }\n\n  // opts is an internal parameter\n  async load(opts: { withDeleted?: boolean; forceReload?: boolean } = {}): Promise<readonly U[]> {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded || opts.forceReload) {\n      if (opts.forceReload) {\n        this.#loaded = undefined;\n      }\n      // If we have `[grandchild, newlyCreatedParent, existingGrandparent, ...more...]`, skip up to the\n      // `existingGrandparent`, because if we `.load(entity)` (i.e. where we are the `grandchild`) then\n      // recursiveParentsBatchLoader will try CTE query up from `grandchild[parent]`, but since that will\n      // be `newlyCreatedParent`, it doesn't have an id yet.\n      const entityToLoad = opts.forceReload ? this.entity : this.findUnloadedReference()?.entity;\n      if (entityToLoad && !entityToLoad.isNewEntity) {\n        await (this.#loadPromise ??= recursiveParentsBatchLoader(this.entity.em, this)\n          .load(entityToLoad)\n          .catch(function load(err) {\n            throw appendStack(err, new Error());\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n        // See if there are any WIP changes, i.e. new parents, that the ^ SQL query didn't know to load.\n        // We don't have to `while` loop this, because if parent itself has WIP changes above it, then\n        // its own `RecursiveParentsCollectionImpl.load` will load it, before returning to this method.\n        const unloadedParent = this.findUnloadedReference();\n        if (unloadedParent) {\n          await recursiveParentsBatchLoader(this.entity.em, this)\n            .load(unloadedParent.entity)\n            .catch(function load(err) {\n              throw appendStack(err, new Error());\n            });\n        }\n      }\n      this.#loaded = true;\n    }\n    return this.filterDeleted(this.doGet(), opts);\n  }\n\n  get isLoaded(): boolean {\n    if (this.#loaded !== undefined) return this.#loaded;\n    this.#loaded = this.findUnloadedReference() === undefined;\n    getEmInternalApi(this.entity.em).isLoadedCache.addNaive(this);\n    return this.#loaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#loaded = undefined;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  get m2oFieldName(): string {\n    return this.#m2oName;\n  }\n\n  get otherFieldName(): string {\n    return this.#otherFieldName;\n  }\n\n  get hasBeenSet(): boolean {\n    return false;\n  }\n\n  toString(): string {\n    return `RecursiveParentsCollectionImpl(entity: ${this.entity}, fieldName: ${this.fieldName})`;\n  }\n\n  doGet(): U[] {\n    ensureNotDeleted(this.entity, \"pending\");\n    const unloaded = this.findUnloadedReference();\n    if (unloaded) {\n      throw new Error(this.toString() + `.get was called but ${unloaded} was not loaded`);\n    }\n    const parents: U[] = [];\n    const visited = new Set<U>();\n    for (\n      let current = getLoadedReference(this.entity[this.#m2oName]);\n      current !== undefined;\n      current = getLoadedReference(current[this.#m2oName])\n    ) {\n      parents.push(current);\n      if (visited.has(current)) throw new RecursiveCycleError(this, [...visited, current]);\n      visited.add(current);\n    }\n    return parents;\n  }\n\n  private findUnloadedReference(): Reference<any, any, any> | undefined {\n    const visited = new Set<any>();\n    for (let current = this.entity; current !== undefined; current = getLoadedReference(current[this.#m2oName])) {\n      const relation = current[this.#m2oName];\n      if (isReference(relation) && !isLoadedReference(relation)) return relation;\n      if (visited.has(current)) throw new RecursiveCycleError(this, [...visited, current]);\n      visited.add(current);\n    }\n    return undefined;\n  }\n}\n\nexport class RecursiveChildrenCollectionImpl<T extends Entity, U extends Entity>\n  extends AbstractRecursiveCollectionImpl<T, U>\n  implements ReadOnlyCollection<T, U>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #o2mName: keyof T & string;\n  readonly #otherFieldName: keyof T & string;\n  #loaded: boolean | undefined = undefined;\n  #loadPromise: Promise<void> | undefined;\n\n  constructor(entity: T, fieldName: keyof T & string, o2mName: keyof T & string, otherFieldName: keyof T & string) {\n    super(entity);\n    this.#fieldName = fieldName;\n    this.#o2mName = o2mName;\n    this.#otherFieldName = otherFieldName;\n  }\n\n  // opts is an internal parameter\n  async load(opts: { withDeleted?: boolean; forceReload?: boolean } = {}): Promise<readonly U[]> {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded || opts.forceReload) {\n      if (opts.forceReload) {\n        this.#loaded = undefined;\n      }\n      if (!this.entity.isNewEntity) {\n        await (this.#loadPromise ??= recursiveChildrenBatchLoader(this.entity.em, this)\n          .load(this.entity)\n          .catch(function load(err) {\n            throw appendStack(err, new Error());\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n      }\n      const unloaded = this.findUnloadedCollections();\n      if (unloaded.length > 0) {\n        // Go through the entities own `fooRecursive` collection so that it's marked as loaded.\n        // We don't have to `while` loop this, because if they children themselves have any WIP\n        // changes, then their own `RecursiveChildrenCollectionImpl.load` will load them.\n        await Promise.all(unloaded.map((r) => (r.entity as any)[this.fieldName].load(opts)));\n      }\n      this.#loaded = true;\n    }\n    return this.filterDeleted(this.doGet(), opts);\n  }\n\n  get isLoaded(): boolean {\n    if (this.#loaded !== undefined) return this.#loaded;\n    this.#loaded = this.findUnloadedCollections().length === 0;\n    getEmInternalApi(this.entity.em).isLoadedCache.addNaive(this);\n    return this.#loaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#loaded = undefined;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  get o2mFieldName(): string {\n    return this.#o2mName;\n  }\n\n  get otherFieldName(): string {\n    return this.#otherFieldName;\n  }\n\n  get hasBeenSet(): boolean {\n    return false;\n  }\n\n  toString(): string {\n    return `RecursiveChildrenCollectionImpl(entity: ${this.entity}, fieldName: ${this.fieldName})`;\n  }\n\n  doGet(): U[] {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded) {\n      throw new Error(this.toString() + `.get was called but when not loaded`);\n    }\n    const children: U[] = [];\n    const visited = new Set<any>();\n    // Use a node+path combo to know which path caused the cycle\n    const todo: { relation: any; path: U[] }[] = [{ relation: this.entity[this.#o2mName], path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { relation, path } = todo.pop()!;\n      if (visited.has(relation)) throw new RecursiveCycleError(this, path);\n      visited.add(relation);\n      for (const child of getLoadedCollection(relation)) {\n        children.push(child);\n        todo.push({ relation: child[this.#o2mName], path: [...path, child] });\n      }\n    }\n    return children;\n  }\n\n  /** Finds any children/downstream o2m collections or o2o references. */\n  private findUnloadedCollections(): Relation<any, any>[] {\n    const visited = new Set<any>();\n    const unloaded: Relation<any, any>[] = [];\n    const todo: { relation: any; path: U[] }[] = [{ relation: this.entity[this.#o2mName], path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { relation, path } = todo.pop()!;\n      if (visited.has(relation)) throw new RecursiveCycleError(this, path);\n      visited.add(relation);\n      if (isCollection(relation) && !isLoadedCollection(relation)) {\n        unloaded.push(relation);\n      } else if (isOneToOneReference(relation) && !isLoadedOneToOneReference(relation)) {\n        unloaded.push(relation);\n      } else {\n        for (const child of getLoadedCollection(relation)) {\n          todo.push({ relation: child[this.#o2mName], path: [...path, child] });\n        }\n      }\n    }\n    return unloaded;\n  }\n}\n\nexport class RecursiveM2mCollectionImpl<T extends Entity, U extends Entity>\n  extends AbstractRecursiveCollectionImpl<T, U>\n  implements ReadOnlyCollection<T, U>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #m2mName: keyof T & string;\n  readonly #otherFieldName: keyof T & string;\n  #loaded: boolean | undefined = undefined;\n  #loadPromise: Promise<void> | undefined;\n\n  constructor(entity: T, fieldName: keyof T & string, m2mName: keyof T & string, otherFieldName: keyof T & string) {\n    super(entity);\n    this.#fieldName = fieldName;\n    this.#m2mName = m2mName;\n    this.#otherFieldName = otherFieldName;\n  }\n\n  // opts is an internal parameter\n  async load(opts: { withDeleted?: boolean; forceReload?: boolean } = {}): Promise<readonly U[]> {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded || opts.forceReload) {\n      if (opts.forceReload) {\n        this.#loaded = undefined;\n      }\n      if (!this.entity.isNewEntity) {\n        await (this.#loadPromise ??= recursiveM2mBatchLoader(this.entity.em, this)\n          .load(this.entity)\n          .catch(function load(err: any) {\n            throw appendStack(err, new Error());\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n      }\n      const unloaded = this.findUnloadedCollections();\n      if (unloaded.length > 0) {\n        // Go through the entity's own `fooRecursive` collection so that it's marked as loaded.\n        await Promise.all(unloaded.map((r) => (r.entity as any)[this.fieldName].load(opts)));\n      }\n      this.#loaded = true;\n    }\n    return this.filterDeleted(this.doGet(), opts);\n  }\n\n  get isLoaded(): boolean {\n    if (this.#loaded !== undefined) return this.#loaded;\n    this.#loaded = this.findUnloadedCollections().length === 0;\n    getEmInternalApi(this.entity.em).isLoadedCache.addNaive(this);\n    return this.#loaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#loaded = undefined;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  get m2mFieldName(): string {\n    return this.#m2mName;\n  }\n\n  get otherFieldName(): string {\n    return this.#otherFieldName;\n  }\n\n  get m2mField(): ManyToManyField {\n    return this.meta.allFields[this.#m2mName] as ManyToManyField;\n  }\n\n  get hasBeenSet(): boolean {\n    return false;\n  }\n\n  toString(): string {\n    return `RecursiveM2mCollectionImpl(entity: ${this.entity}, fieldName: ${this.fieldName})`;\n  }\n\n  doGet(): U[] {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded) {\n      throw new Error(this.toString() + `.get was called but when not loaded`);\n    }\n    const results: U[] = [];\n    // Track by entity to handle diamonds (same entity reachable via multiple paths)\n    const visited = new Set<any>();\n    visited.add(this.entity);\n    const todo: { entity: any; path: U[] }[] = [{ entity: this.entity, path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { entity: current, path } = todo.pop()!;\n      for (const other of getLoadedCollection(current[this.#m2mName])) {\n        if (visited.has(other)) {\n          // If we're reaching an entity we've already visited, and it's this.entity, that's a cycle\n          if (other === this.entity) throw new RecursiveCycleError(this, [...path, other]);\n          // Otherwise it's a diamond (reachable via multiple paths) — skip\n          continue;\n        }\n        visited.add(other);\n        results.push(other);\n        todo.push({ entity: other, path: [...path, other] });\n      }\n    }\n    return results;\n  }\n\n  /** Finds any m2m collections that are not yet loaded in the recursive tree. */\n  private findUnloadedCollections(): Relation<any, any>[] {\n    const visited = new Set<any>();\n    visited.add(this.entity);\n    const unloaded: Relation<any, any>[] = [];\n    const todo: { entity: any; path: U[] }[] = [{ entity: this.entity, path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { entity: current, path } = todo.pop()!;\n      const relation = current[this.#m2mName];\n      if (isCollection(relation) && !isLoadedCollection(relation)) {\n        unloaded.push(relation);\n      } else {\n        for (const other of getLoadedCollection(relation)) {\n          if (visited.has(other)) {\n            if (other === this.entity) throw new RecursiveCycleError(this, [...path, other]);\n            continue;\n          }\n          visited.add(other);\n          todo.push({ entity: other, path: [...path, other] });\n        }\n      }\n    }\n    return unloaded;\n  }\n}\n\nfunction getLoadedReference(relation: any): any {\n  return isLoadedReference(relation) ? relation.get : fail(`${relation} was not loaded`);\n}\n\nfunction getLoadedCollection(relation: any): any {\n  return isLoadedCollection(relation)\n    ? relation.get\n    : isLoadedOneToOneReference(relation)\n      ? relation.get\n        ? [relation.get]\n        : []\n      : fail(`${relation} was not loaded`);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AAmCA,SAAgB,oBACd,SACA,gBAC0B;CAC1B,OAAOA,kBAAAA,WAAW,QAAW,cAAc;EACzC,OAAO,IAAI,+BAA+B,QAAQ,WAA+B,SAAS,cAAc;CAC1G,CAAC;AACH;;;;;;AAOA,SAAgB,qBACd,SACA,gBAC0B;CAC1B,OAAOA,kBAAAA,WAAW,QAAW,cAAc;EACzC,OAAO,IAAI,gCAAgC,QAAQ,WAA+B,SAAS,cAAc;CAC3G,CAAC;AACH;;;;;;;AAQA,SAAgB,gBACd,SACA,gBAC0B;CAC1B,OAAOA,kBAAAA,WAAW,QAAW,cAAc;EACzC,OAAO,IAAI,2BAA2B,QAAQ,WAA+B,SAAS,cAAc;CACtG,CAAC;AACH;;;;;;AAOA,IAAe,kCAAf,cAA2FC,uCAAAA,qBAGzF;CAGA,IAAI,MAAW;EACb,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,EAAE,aAAa,MAAM,CAAC;CAChE;CAEA,IAAI,iBAAsB;EACxB,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,EAAE,aAAa,KAAK,CAAC;CAC/D;CAEA,cAAoB;EAClB,MAAM,IAAI,MAAM,yBAAyB;CAC3C;CAEA,MAAY;EACV,MAAM,IAAI,MAAM,yBAAyB;CAC3C;CAEA,IAAI,cAAuB;EACzB,OAAO;CACT;CAEA,UAAgB;EACd,MAAM,IAAI,MAAM,yBAAyB;CAC3C;CAEA,yBAAwC;EACtC,OAAO,QAAQ,QAAQ;CACzB;CAEA,qBAA2B,CAAC;CAE5B,IAAI,OAAuB;EACzB,OAAOC,uBAAAA,YAAY,KAAK,MAAM;CAChC;;CAKA,cAAwB,UAAe,MAAuC;EAC5E,OAAO,MAAM,gBAAgB,OACzB,CAAC,GAAG,QAAQ,IACZ,SAAS,QAAQ,MAAM,CAAC,EAAE,mBAAmB,CAAE,EAAU,mBAAmB;CAClF;CAEA,CAACC,kCAAAA,aAAgB;CACjB,CAACC,kCAAAA,aAAgB;AACnB;AAEA,IAAa,iCAAb,cACU,gCAEV;CACE;CACA;CACA;CACA,UAA+B,KAAA;CAC/B;CAEA,YAAY,QAAW,WAA6B,SAA2B,gBAAkC;EAC/G,MAAM,MAAM;EACZ,KAAKC,aAAa;EAClB,KAAKC,WAAW;EAChB,KAAKC,kBAAkB;CACzB;CAGA,MAAM,KAAK,OAAyD,CAAC,GAA0B;EAC7F,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,YAAY,KAAK,aAAa;GACtC,IAAI,KAAK,aACP,KAAKC,UAAU,KAAA;GAMjB,MAAM,eAAe,KAAK,cAAc,KAAK,SAAS,KAAK,sBAAsB,CAAC,EAAE;GACpF,IAAI,gBAAgB,CAAC,aAAa,aAAa;IAC7C,OAAO,KAAKC,iBAAiBC,iDAAAA,4BAA4B,KAAK,OAAO,IAAI,IAAI,CAAC,CAC3E,KAAK,YAAY,CAAC,CAClB,MAAM,SAAS,KAAK,KAAK;KACxB,MAAMC,sBAAAA,YAAY,qBAAK,IAAI,MAAM,CAAC;IACpC,CAAC,CAAC,CACD,cAAc;KACb,KAAKF,eAAe,KAAA;IACtB,CAAC;IAIH,MAAM,iBAAiB,KAAK,sBAAsB;IAClD,IAAI,gBACF,MAAMC,iDAAAA,4BAA4B,KAAK,OAAO,IAAI,IAAI,CAAC,CACpD,KAAK,eAAe,MAAM,CAAC,CAC3B,MAAM,SAAS,KAAK,KAAK;KACxB,MAAMC,sBAAAA,YAAY,qBAAK,IAAI,MAAM,CAAC;IACpC,CAAC;GAEP;GACA,KAAKH,UAAU;EACjB;EACA,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,IAAI;CAC9C;CAEA,IAAI,WAAoB;EACtB,IAAI,KAAKA,YAAY,KAAA,GAAW,OAAO,KAAKA;EAC5C,KAAKA,UAAU,KAAK,sBAAsB,MAAM,KAAA;EAChD,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,SAAS,IAAI;EAC5D,OAAO,KAAKA;CACd;CAEA,gBAAsB;EACpB,KAAKA,UAAU,KAAA;CACjB;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKH;CACd;CAEA,IAAI,eAAuB;EACzB,OAAO,KAAKC;CACd;CAEA,IAAI,iBAAyB;EAC3B,OAAO,KAAKC;CACd;CAEA,IAAI,aAAsB;EACxB,OAAO;CACT;CAEA,WAAmB;EACjB,OAAO,0CAA0C,KAAK,OAAO,eAAe,KAAK,UAAU;CAC7F;CAEA,QAAa;EACX,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,MAAM,WAAW,KAAK,sBAAsB;EAC5C,IAAI,UACF,MAAM,IAAI,MAAM,KAAK,SAAS,IAAI,uBAAuB,SAAS,gBAAgB;EAEpF,MAAM,UAAe,CAAC;EACtB,MAAM,0BAAU,IAAI,IAAO;EAC3B,KACE,IAAI,UAAU,mBAAmB,KAAK,OAAO,KAAKD,SAAS,GAC3D,YAAY,KAAA,GACZ,UAAU,mBAAmB,QAAQ,KAAKA,SAAS,GACnD;GACA,QAAQ,KAAK,OAAO;GACpB,IAAI,QAAQ,IAAI,OAAO,GAAG,MAAM,IAAIM,sCAAAA,oBAAoB,MAAM,CAAC,GAAG,SAAS,OAAO,CAAC;GACnF,QAAQ,IAAI,OAAO;EACrB;EACA,OAAO;CACT;CAEA,wBAAsE;EACpE,MAAM,0BAAU,IAAI,IAAS;EAC7B,KAAK,IAAI,UAAU,KAAK,QAAQ,YAAY,KAAA,GAAW,UAAU,mBAAmB,QAAQ,KAAKN,SAAS,GAAG;GAC3G,MAAM,WAAW,QAAQ,KAAKA;GAC9B,IAAIO,4BAAAA,YAAY,QAAQ,KAAK,CAACC,4BAAAA,kBAAkB,QAAQ,GAAG,OAAO;GAClE,IAAI,QAAQ,IAAI,OAAO,GAAG,MAAM,IAAIF,sCAAAA,oBAAoB,MAAM,CAAC,GAAG,SAAS,OAAO,CAAC;GACnF,QAAQ,IAAI,OAAO;EACrB;CAEF;AACF;AAEA,IAAa,kCAAb,cACU,gCAEV;CACE;CACA;CACA;CACA,UAA+B,KAAA;CAC/B;CAEA,YAAY,QAAW,WAA6B,SAA2B,gBAAkC;EAC/G,MAAM,MAAM;EACZ,KAAKP,aAAa;EAClB,KAAKU,WAAW;EAChB,KAAKR,kBAAkB;CACzB;CAGA,MAAM,KAAK,OAAyD,CAAC,GAA0B;EAC7F,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,YAAY,KAAK,aAAa;GACtC,IAAI,KAAK,aACP,KAAKC,UAAU,KAAA;GAEjB,IAAI,CAAC,KAAK,OAAO,aACf,OAAO,KAAKC,iBAAiBO,kDAAAA,6BAA6B,KAAK,OAAO,IAAI,IAAI,CAAC,CAC5E,KAAK,KAAK,MAAM,CAAC,CACjB,MAAM,SAAS,KAAK,KAAK;IACxB,MAAML,sBAAAA,YAAY,qBAAK,IAAI,MAAM,CAAC;GACpC,CAAC,CAAC,CACD,cAAc;IACb,KAAKF,eAAe,KAAA;GACtB,CAAC;GAEL,MAAM,WAAW,KAAK,wBAAwB;GAC9C,IAAI,SAAS,SAAS,GAIpB,MAAM,QAAQ,IAAI,SAAS,KAAK,MAAO,EAAE,OAAe,KAAK,UAAU,CAAC,KAAK,IAAI,CAAC,CAAC;GAErF,KAAKD,UAAU;EACjB;EACA,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,IAAI;CAC9C;CAEA,IAAI,WAAoB;EACtB,IAAI,KAAKA,YAAY,KAAA,GAAW,OAAO,KAAKA;EAC5C,KAAKA,UAAU,KAAK,wBAAwB,CAAC,CAAC,WAAW;EACzD,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,SAAS,IAAI;EAC5D,OAAO,KAAKA;CACd;CAEA,gBAAsB;EACpB,KAAKA,UAAU,KAAA;CACjB;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKH;CACd;CAEA,IAAI,eAAuB;EACzB,OAAO,KAAKU;CACd;CAEA,IAAI,iBAAyB;EAC3B,OAAO,KAAKR;CACd;CAEA,IAAI,aAAsB;EACxB,OAAO;CACT;CAEA,WAAmB;EACjB,OAAO,2CAA2C,KAAK,OAAO,eAAe,KAAK,UAAU;CAC9F;CAEA,QAAa;EACX,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,UACR,MAAM,IAAI,MAAM,KAAK,SAAS,IAAI,qCAAqC;EAEzE,MAAM,WAAgB,CAAC;EACvB,MAAM,0BAAU,IAAI,IAAS;EAE7B,MAAM,OAAuC,CAAC;GAAE,UAAU,KAAK,OAAO,KAAKQ;GAAW,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAClH,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,UAAU,SAAS,KAAK,IAAI;GACpC,IAAI,QAAQ,IAAI,QAAQ,GAAG,MAAM,IAAIH,sCAAAA,oBAAoB,MAAM,IAAI;GACnE,QAAQ,IAAI,QAAQ;GACpB,KAAK,MAAM,SAAS,oBAAoB,QAAQ,GAAG;IACjD,SAAS,KAAK,KAAK;IACnB,KAAK,KAAK;KAAE,UAAU,MAAM,KAAKG;KAAW,MAAM,CAAC,GAAG,MAAM,KAAK;IAAE,CAAC;GACtE;EACF;EACA,OAAO;CACT;;CAGA,0BAAwD;EACtD,MAAM,0BAAU,IAAI,IAAS;EAC7B,MAAM,WAAiC,CAAC;EACxC,MAAM,OAAuC,CAAC;GAAE,UAAU,KAAK,OAAO,KAAKA;GAAW,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAClH,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,UAAU,SAAS,KAAK,IAAI;GACpC,IAAI,QAAQ,IAAI,QAAQ,GAAG,MAAM,IAAIH,sCAAAA,oBAAoB,MAAM,IAAI;GACnE,QAAQ,IAAI,QAAQ;GACpB,IAAIK,6BAAAA,aAAa,QAAQ,KAAK,CAACC,6BAAAA,mBAAmB,QAAQ,GACxD,SAAS,KAAK,QAAQ;QACjB,IAAIC,oCAAAA,oBAAoB,QAAQ,KAAK,CAACC,oCAAAA,0BAA0B,QAAQ,GAC7E,SAAS,KAAK,QAAQ;QAEtB,KAAK,MAAM,SAAS,oBAAoB,QAAQ,GAC9C,KAAK,KAAK;IAAE,UAAU,MAAM,KAAKL;IAAW,MAAM,CAAC,GAAG,MAAM,KAAK;GAAE,CAAC;EAG1E;EACA,OAAO;CACT;AACF;AAEA,IAAa,6BAAb,cACU,gCAEV;CACE;CACA;CACA;CACA,UAA+B,KAAA;CAC/B;CAEA,YAAY,QAAW,WAA6B,SAA2B,gBAAkC;EAC/G,MAAM,MAAM;EACZ,KAAKV,aAAa;EAClB,KAAKgB,WAAW;EAChB,KAAKd,kBAAkB;CACzB;CAGA,MAAM,KAAK,OAAyD,CAAC,GAA0B;EAC7F,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,YAAY,KAAK,aAAa;GACtC,IAAI,KAAK,aACP,KAAKC,UAAU,KAAA;GAEjB,IAAI,CAAC,KAAK,OAAO,aACf,OAAO,KAAKC,iBAAiBa,6CAAAA,wBAAwB,KAAK,OAAO,IAAI,IAAI,CAAC,CACvE,KAAK,KAAK,MAAM,CAAC,CACjB,MAAM,SAAS,KAAK,KAAU;IAC7B,MAAMX,sBAAAA,YAAY,qBAAK,IAAI,MAAM,CAAC;GACpC,CAAC,CAAC,CACD,cAAc;IACb,KAAKF,eAAe,KAAA;GACtB,CAAC;GAEL,MAAM,WAAW,KAAK,wBAAwB;GAC9C,IAAI,SAAS,SAAS,GAEpB,MAAM,QAAQ,IAAI,SAAS,KAAK,MAAO,EAAE,OAAe,KAAK,UAAU,CAAC,KAAK,IAAI,CAAC,CAAC;GAErF,KAAKD,UAAU;EACjB;EACA,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,IAAI;CAC9C;CAEA,IAAI,WAAoB;EACtB,IAAI,KAAKA,YAAY,KAAA,GAAW,OAAO,KAAKA;EAC5C,KAAKA,UAAU,KAAK,wBAAwB,CAAC,CAAC,WAAW;EACzD,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,SAAS,IAAI;EAC5D,OAAO,KAAKA;CACd;CAEA,gBAAsB;EACpB,KAAKA,UAAU,KAAA;CACjB;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKH;CACd;CAEA,IAAI,eAAuB;EACzB,OAAO,KAAKgB;CACd;CAEA,IAAI,iBAAyB;EAC3B,OAAO,KAAKd;CACd;CAEA,IAAI,WAA4B;EAC9B,OAAO,KAAK,KAAK,UAAU,KAAKc;CAClC;CAEA,IAAI,aAAsB;EACxB,OAAO;CACT;CAEA,WAAmB;EACjB,OAAO,sCAAsC,KAAK,OAAO,eAAe,KAAK,UAAU;CACzF;CAEA,QAAa;EACX,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,UACR,MAAM,IAAI,MAAM,KAAK,SAAS,IAAI,qCAAqC;EAEzE,MAAM,UAAe,CAAC;EAEtB,MAAM,0BAAU,IAAI,IAAS;EAC7B,QAAQ,IAAI,KAAK,MAAM;EACvB,MAAM,OAAqC,CAAC;GAAE,QAAQ,KAAK;GAAQ,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAC/F,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,QAAQ,SAAS,SAAS,KAAK,IAAI;GAC3C,KAAK,MAAM,SAAS,oBAAoB,QAAQ,KAAKA,SAAS,GAAG;IAC/D,IAAI,QAAQ,IAAI,KAAK,GAAG;KAEtB,IAAI,UAAU,KAAK,QAAQ,MAAM,IAAIT,sCAAAA,oBAAoB,MAAM,CAAC,GAAG,MAAM,KAAK,CAAC;KAE/E;IACF;IACA,QAAQ,IAAI,KAAK;IACjB,QAAQ,KAAK,KAAK;IAClB,KAAK,KAAK;KAAE,QAAQ;KAAO,MAAM,CAAC,GAAG,MAAM,KAAK;IAAE,CAAC;GACrD;EACF;EACA,OAAO;CACT;;CAGA,0BAAwD;EACtD,MAAM,0BAAU,IAAI,IAAS;EAC7B,QAAQ,IAAI,KAAK,MAAM;EACvB,MAAM,WAAiC,CAAC;EACxC,MAAM,OAAqC,CAAC;GAAE,QAAQ,KAAK;GAAQ,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAC/F,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,QAAQ,SAAS,SAAS,KAAK,IAAI;GAC3C,MAAM,WAAW,QAAQ,KAAKS;GAC9B,IAAIJ,6BAAAA,aAAa,QAAQ,KAAK,CAACC,6BAAAA,mBAAmB,QAAQ,GACxD,SAAS,KAAK,QAAQ;QAEtB,KAAK,MAAM,SAAS,oBAAoB,QAAQ,GAAG;IACjD,IAAI,QAAQ,IAAI,KAAK,GAAG;KACtB,IAAI,UAAU,KAAK,QAAQ,MAAM,IAAIN,sCAAAA,oBAAoB,MAAM,CAAC,GAAG,MAAM,KAAK,CAAC;KAC/E;IACF;IACA,QAAQ,IAAI,KAAK;IACjB,KAAK,KAAK;KAAE,QAAQ;KAAO,MAAM,CAAC,GAAG,MAAM,KAAK;IAAE,CAAC;GACrD;EAEJ;EACA,OAAO;CACT;AACF;AAEA,SAAS,mBAAmB,UAAoB;CAC9C,OAAOE,4BAAAA,kBAAkB,QAAQ,IAAI,SAAS,MAAMS,cAAAA,KAAK,GAAG,SAAS,gBAAgB;AACvF;AAEA,SAAS,oBAAoB,UAAoB;CAC/C,OAAOL,6BAAAA,mBAAmB,QAAQ,IAC9B,SAAS,MACTE,oCAAAA,0BAA0B,QAAQ,IAChC,SAAS,MACP,CAAC,SAAS,GAAG,IACb,CAAC,IACHG,cAAAA,KAAK,GAAG,SAAS,gBAAgB;AACzC"}
+{"version":3,"file":"RecursiveCollection.cjs","names":["lazyField","AbstractRelationImpl","getMetadata","RelationT","RelationU","#fieldName","#m2oName","#otherFieldName","#loaded","#loadPromise","recursiveParentsBatchLoader","appendStack","RecursiveCycleError","isReference","isLoadedReference","#o2mName","recursiveChildrenBatchLoader","isCollection","isLoadedCollection","isOneToOneReference","isLoadedOneToOneReference","#m2mName","recursiveM2mBatchLoader","fail"],"sources":["../../src/relations/RecursiveCollection.ts"],"sourcesContent":["import { recursiveChildrenBatchLoader } from \"../batchloaders/recursiveChildrenBatchLoader.ts\";\nimport { recursiveM2mBatchLoader } from \"../batchloaders/recursiveM2mBatchLoader.ts\";\nimport { recursiveParentsBatchLoader } from \"../batchloaders/recursiveParentsBatchLoader.ts\";\nimport {\n  type Entity,\n  type EntityMetadata,\n  type ManyToManyField,\n  type Reference,\n  type Relation,\n  appendStack,\n  ensureNotDeleted,\n  fail,\n  getEmInternalApi,\n  getMetadata,\n  isCollection,\n  isLoadedCollection,\n  isLoadedOneToOneReference,\n  isLoadedReference,\n  isOneToOneReference,\n  isReference,\n} from \"../index.ts\";\nimport type { IsLoadedCachable } from \"../loading/IsLoadedCache.ts\";\nimport { lazyField } from \"../newEntity.ts\";\nimport { AbstractRelationImpl } from \"./AbstractRelationImpl.ts\";\nimport { type ReadOnlyCollection } from \"./ReadOnlyCollection.ts\";\nimport { RecursiveCycleError } from \"./RecursiveCycleError.ts\";\nimport { RelationT, RelationU } from \"./RelationSymbols.ts\";\n\nexport { RecursiveCycleError };\n\n/**\n * An alias for creating `RecursiveParentsCollectionImpl`s.\n *\n * I.e. for `Author.mentor` (m2o fk), we can return `Author.mentorsRecursive` recursively looking up.\n */\nexport function hasRecursiveParents<T extends Entity, U extends Entity>(\n  m2oName: keyof T & string, // i.e. `author.mentor`\n  otherFieldName: keyof T & string, // i.e. `author.menteesRecursive`\n): ReadOnlyCollection<T, U> {\n  return lazyField((entity: T, fieldName) => {\n    return new RecursiveParentsCollectionImpl(entity, fieldName as keyof T & string, m2oName, otherFieldName);\n  });\n}\n\n/**\n * An alias for creating `RecursiveChildrenCollectionImpl`s.\n *\n * I.e. for `Author.mentees` (o2m), we can return `Author.menteesRecursive` recursively looking down.\n */\nexport function hasRecursiveChildren<T extends Entity, U extends Entity>(\n  o2mName: keyof T & string, // i.e. `author.mentees`\n  otherFieldName: keyof T & string, // i.e. `author.mentorsRecursive`\n): ReadOnlyCollection<T, U> {\n  return lazyField((entity: T, fieldName) => {\n    return new RecursiveChildrenCollectionImpl(entity, fieldName as keyof T & string, o2mName, otherFieldName);\n  });\n}\n\n/**\n * An alias for creating `RecursiveM2mCollectionImpl`s.\n *\n * I.e. for `User.parents` (m2m), we can return `User.parentsRecursive` recursively looking up through the m2m.\n * Or for `User.children` (m2m), we can return `User.childrenRecursive` recursively looking down.\n */\nexport function hasRecursiveM2m<T extends Entity, U extends Entity>(\n  m2mName: keyof T & string, // i.e. `user.parents` or `user.children`\n  otherFieldName: keyof T & string, // i.e. `user.childrenRecursive` or `user.parentsRecursive`\n): ReadOnlyCollection<T, U> {\n  return lazyField((entity: T, fieldName) => {\n    return new RecursiveM2mCollectionImpl(entity, fieldName as keyof T & string, m2mName, otherFieldName);\n  });\n}\n\n/**\n * A base class for the common methods between the parent & children recursive collections.\n *\n * We could probably move some of this into AbstractRelationImpl?\n */\nabstract class AbstractRecursiveCollectionImpl<T extends Entity, U extends Entity> extends AbstractRelationImpl<\n  T,\n  U[]\n> {\n  abstract fieldName: string;\n\n  get get(): U[] {\n    return this.filterDeleted(this.doGet(), { withDeleted: false });\n  }\n\n  get getWithDeleted(): U[] {\n    return this.filterDeleted(this.doGet(), { withDeleted: true });\n  }\n\n  setFromOpts(): void {\n    throw new Error(\"Method not implemented.\");\n  }\n\n  set(): void {\n    throw new Error(\"Method not implemented.\");\n  }\n\n  get isPreloaded(): boolean {\n    return false;\n  }\n\n  preload(): void {\n    throw new Error(\"Method not implemented.\");\n  }\n\n  cleanupOnEntityDeleted(): Promise<void> {\n    return Promise.resolve();\n  }\n\n  maybeCascadeDelete(): void {}\n\n  get meta(): EntityMetadata {\n    return getMetadata(this.entity);\n  }\n\n  abstract doGet(): U[];\n\n  /** Removes pending-hard-delete or soft-deleted entities, unless explicitly asked for. */\n  protected filterDeleted(entities: U[], opts?: { withDeleted?: boolean }): U[] {\n    return opts?.withDeleted === true\n      ? [...entities]\n      : entities.filter((e) => !e.isDeletedEntity && !(e as any).isSoftDeletedEntity);\n  }\n\n  [RelationT]: T = null!;\n  [RelationU]: U = null!;\n}\n\nexport class RecursiveParentsCollectionImpl<T extends Entity, U extends Entity>\n  extends AbstractRecursiveCollectionImpl<T, U>\n  implements ReadOnlyCollection<T, U>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #m2oName: keyof T & string;\n  readonly #otherFieldName: keyof T & string;\n  #loaded: boolean | undefined = undefined;\n  #loadPromise: Promise<void> | undefined;\n\n  constructor(entity: T, fieldName: keyof T & string, m2oName: keyof T & string, otherFieldName: keyof T & string) {\n    super(entity);\n    this.#fieldName = fieldName;\n    this.#m2oName = m2oName;\n    this.#otherFieldName = otherFieldName;\n  }\n\n  // opts is an internal parameter\n  async load(opts: { withDeleted?: boolean; forceReload?: boolean } = {}): Promise<readonly U[]> {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded || opts.forceReload) {\n      if (opts.forceReload) {\n        this.#loaded = undefined;\n      }\n      // If we have `[grandchild, newlyCreatedParent, existingGrandparent, ...more...]`, skip up to the\n      // `existingGrandparent`, because if we `.load(entity)` (i.e. where we are the `grandchild`) then\n      // recursiveParentsBatchLoader will try CTE query up from `grandchild[parent]`, but since that will\n      // be `newlyCreatedParent`, it doesn't have an id yet.\n      const entityToLoad = opts.forceReload ? this.entity : this.findUnloadedReference()?.entity;\n      if (entityToLoad && !entityToLoad.isNewEntity) {\n        await (this.#loadPromise ??= recursiveParentsBatchLoader(this.entity.em, this)\n          .load(entityToLoad)\n          .catch(function load(err) {\n            throw appendStack(err, new Error());\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n        // See if there are any WIP changes, i.e. new parents, that the ^ SQL query didn't know to load.\n        // We don't have to `while` loop this, because if parent itself has WIP changes above it, then\n        // its own `RecursiveParentsCollectionImpl.load` will load it, before returning to this method.\n        const unloadedParent = this.findUnloadedReference();\n        if (unloadedParent) {\n          await recursiveParentsBatchLoader(this.entity.em, this)\n            .load(unloadedParent.entity)\n            .catch(function load(err) {\n              throw appendStack(err, new Error());\n            });\n        }\n      }\n      this.#loaded = true;\n    }\n    return this.filterDeleted(this.doGet(), opts);\n  }\n\n  get isLoaded(): boolean {\n    if (this.#loaded !== undefined) return this.#loaded;\n    this.#loaded = this.findUnloadedReference() === undefined;\n    getEmInternalApi(this.entity.em).isLoadedCache.addNaive(this);\n    return this.#loaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#loaded = undefined;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  get m2oFieldName(): string {\n    return this.#m2oName;\n  }\n\n  get otherFieldName(): string {\n    return this.#otherFieldName;\n  }\n\n  get hasBeenSet(): boolean {\n    return false;\n  }\n\n  toString(): string {\n    return `RecursiveParentsCollectionImpl(entity: ${this.entity}, fieldName: ${this.fieldName})`;\n  }\n\n  doGet(): U[] {\n    ensureNotDeleted(this.entity, \"pending\");\n    const unloaded = this.findUnloadedReference();\n    if (unloaded) {\n      throw new Error(this.toString() + `.get was called but ${unloaded} was not loaded`);\n    }\n    const parents: U[] = [];\n    const visited = new Set<U>();\n    for (\n      let current = getLoadedReference(this.entity[this.#m2oName]);\n      current !== undefined;\n      current = getLoadedReference(current[this.#m2oName])\n    ) {\n      parents.push(current);\n      if (visited.has(current)) throw new RecursiveCycleError(this, [...visited, current]);\n      visited.add(current);\n    }\n    return parents;\n  }\n\n  private findUnloadedReference(): Reference<any, any, any> | undefined {\n    const visited = new Set<any>();\n    for (let current = this.entity; current !== undefined; current = getLoadedReference(current[this.#m2oName])) {\n      const relation = current[this.#m2oName];\n      if (isReference(relation) && !isLoadedReference(relation)) return relation;\n      if (visited.has(current)) throw new RecursiveCycleError(this, [...visited, current]);\n      visited.add(current);\n    }\n    return undefined;\n  }\n}\n\nexport class RecursiveChildrenCollectionImpl<T extends Entity, U extends Entity>\n  extends AbstractRecursiveCollectionImpl<T, U>\n  implements ReadOnlyCollection<T, U>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #o2mName: keyof T & string;\n  readonly #otherFieldName: keyof T & string;\n  #loaded: boolean | undefined = undefined;\n  #loadPromise: Promise<void> | undefined;\n\n  constructor(entity: T, fieldName: keyof T & string, o2mName: keyof T & string, otherFieldName: keyof T & string) {\n    super(entity);\n    this.#fieldName = fieldName;\n    this.#o2mName = o2mName;\n    this.#otherFieldName = otherFieldName;\n  }\n\n  // opts is an internal parameter\n  async load(opts: { withDeleted?: boolean; forceReload?: boolean } = {}): Promise<readonly U[]> {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded || opts.forceReload) {\n      if (opts.forceReload) {\n        this.#loaded = undefined;\n      }\n      if (!this.entity.isNewEntity) {\n        await (this.#loadPromise ??= recursiveChildrenBatchLoader(this.entity.em, this)\n          .load(this.entity)\n          .catch(function load(err) {\n            throw appendStack(err, new Error());\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n      }\n      const unloaded = this.findUnloadedCollections();\n      if (unloaded.length > 0) {\n        // Go through the entities own `fooRecursive` collection so that it's marked as loaded.\n        // We don't have to `while` loop this, because if they children themselves have any WIP\n        // changes, then their own `RecursiveChildrenCollectionImpl.load` will load them.\n        await Promise.all(unloaded.map((r) => (r.entity as any)[this.fieldName].load(opts)));\n      }\n      this.#loaded = true;\n    }\n    return this.filterDeleted(this.doGet(), opts);\n  }\n\n  get isLoaded(): boolean {\n    if (this.#loaded !== undefined) return this.#loaded;\n    this.#loaded = this.findUnloadedCollections().length === 0;\n    getEmInternalApi(this.entity.em).isLoadedCache.addNaive(this);\n    return this.#loaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#loaded = undefined;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  get o2mFieldName(): string {\n    return this.#o2mName;\n  }\n\n  get otherFieldName(): string {\n    return this.#otherFieldName;\n  }\n\n  get hasBeenSet(): boolean {\n    return false;\n  }\n\n  toString(): string {\n    return `RecursiveChildrenCollectionImpl(entity: ${this.entity}, fieldName: ${this.fieldName})`;\n  }\n\n  doGet(): U[] {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded) {\n      throw new Error(this.toString() + `.get was called but when not loaded`);\n    }\n    const children: U[] = [];\n    const visited = new Set<any>();\n    // Use a node+path combo to know which path caused the cycle\n    const todo: { relation: any; path: U[] }[] = [{ relation: this.entity[this.#o2mName], path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { relation, path } = todo.pop()!;\n      if (visited.has(relation)) throw new RecursiveCycleError(this, path);\n      visited.add(relation);\n      for (const child of getLoadedCollection(relation)) {\n        children.push(child);\n        todo.push({ relation: child[this.#o2mName], path: [...path, child] });\n      }\n    }\n    return children;\n  }\n\n  /** Finds any children/downstream o2m collections or o2o references. */\n  private findUnloadedCollections(): Relation<any, any>[] {\n    const visited = new Set<any>();\n    const unloaded: Relation<any, any>[] = [];\n    const todo: { relation: any; path: U[] }[] = [{ relation: this.entity[this.#o2mName], path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { relation, path } = todo.pop()!;\n      if (visited.has(relation)) throw new RecursiveCycleError(this, path);\n      visited.add(relation);\n      if (isCollection(relation) && !isLoadedCollection(relation)) {\n        unloaded.push(relation);\n      } else if (isOneToOneReference(relation) && !isLoadedOneToOneReference(relation)) {\n        unloaded.push(relation);\n      } else {\n        for (const child of getLoadedCollection(relation)) {\n          todo.push({ relation: child[this.#o2mName], path: [...path, child] });\n        }\n      }\n    }\n    return unloaded;\n  }\n}\n\nexport class RecursiveM2mCollectionImpl<T extends Entity, U extends Entity>\n  extends AbstractRecursiveCollectionImpl<T, U>\n  implements ReadOnlyCollection<T, U>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #m2mName: keyof T & string;\n  readonly #otherFieldName: keyof T & string;\n  #loaded: boolean | undefined = undefined;\n  #loadPromise: Promise<void> | undefined;\n\n  constructor(entity: T, fieldName: keyof T & string, m2mName: keyof T & string, otherFieldName: keyof T & string) {\n    super(entity);\n    this.#fieldName = fieldName;\n    this.#m2mName = m2mName;\n    this.#otherFieldName = otherFieldName;\n  }\n\n  // opts is an internal parameter\n  async load(opts: { withDeleted?: boolean; forceReload?: boolean } = {}): Promise<readonly U[]> {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded || opts.forceReload) {\n      if (opts.forceReload) {\n        this.#loaded = undefined;\n      }\n      if (!this.entity.isNewEntity) {\n        await (this.#loadPromise ??= recursiveM2mBatchLoader(this.entity.em, this)\n          .load(this.entity)\n          .catch(function load(err: any) {\n            throw appendStack(err, new Error());\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n      }\n      const unloaded = this.findUnloadedCollections();\n      if (unloaded.length > 0) {\n        // Go through the entity's own `fooRecursive` collection so that it's marked as loaded.\n        await Promise.all(unloaded.map((r) => (r.entity as any)[this.fieldName].load(opts)));\n      }\n      this.#loaded = true;\n    }\n    return this.filterDeleted(this.doGet(), opts);\n  }\n\n  get isLoaded(): boolean {\n    if (this.#loaded !== undefined) return this.#loaded;\n    this.#loaded = this.findUnloadedCollections().length === 0;\n    getEmInternalApi(this.entity.em).isLoadedCache.addNaive(this);\n    return this.#loaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#loaded = undefined;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  get m2mFieldName(): string {\n    return this.#m2mName;\n  }\n\n  get otherFieldName(): string {\n    return this.#otherFieldName;\n  }\n\n  get m2mField(): ManyToManyField {\n    return this.meta.allFields[this.#m2mName] as ManyToManyField;\n  }\n\n  get hasBeenSet(): boolean {\n    return false;\n  }\n\n  toString(): string {\n    return `RecursiveM2mCollectionImpl(entity: ${this.entity}, fieldName: ${this.fieldName})`;\n  }\n\n  doGet(): U[] {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded) {\n      throw new Error(this.toString() + `.get was called but when not loaded`);\n    }\n    const results: U[] = [];\n    // Track by entity to handle diamonds (same entity reachable via multiple paths)\n    const visited = new Set<any>();\n    visited.add(this.entity);\n    const todo: { entity: any; path: U[] }[] = [{ entity: this.entity, path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { entity: current, path } = todo.pop()!;\n      for (const other of getLoadedCollection(current[this.#m2mName])) {\n        if (visited.has(other)) {\n          // If we're reaching an entity we've already visited, and it's this.entity, that's a cycle\n          if (other === this.entity) throw new RecursiveCycleError(this, [...path, other]);\n          // Otherwise it's a diamond (reachable via multiple paths) — skip\n          continue;\n        }\n        visited.add(other);\n        results.push(other);\n        todo.push({ entity: other, path: [...path, other] });\n      }\n    }\n    return results;\n  }\n\n  /** Finds any m2m collections that are not yet loaded in the recursive tree. */\n  private findUnloadedCollections(): Relation<any, any>[] {\n    const visited = new Set<any>();\n    visited.add(this.entity);\n    const unloaded: Relation<any, any>[] = [];\n    const todo: { entity: any; path: U[] }[] = [{ entity: this.entity, path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { entity: current, path } = todo.pop()!;\n      const relation = current[this.#m2mName];\n      if (isCollection(relation) && !isLoadedCollection(relation)) {\n        unloaded.push(relation);\n      } else {\n        for (const other of getLoadedCollection(relation)) {\n          if (visited.has(other)) {\n            if (other === this.entity) throw new RecursiveCycleError(this, [...path, other]);\n            continue;\n          }\n          visited.add(other);\n          todo.push({ entity: other, path: [...path, other] });\n        }\n      }\n    }\n    return unloaded;\n  }\n}\n\nfunction getLoadedReference(relation: any): any {\n  return isLoadedReference(relation) ? relation.get : fail(`${relation} was not loaded`);\n}\n\nfunction getLoadedCollection(relation: any): any {\n  return isLoadedCollection(relation)\n    ? relation.get\n    : isLoadedOneToOneReference(relation)\n      ? relation.get\n        ? [relation.get]\n        : []\n      : fail(`${relation} was not loaded`);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAmCA,SAAgB,oBACd,SACA,gBAC0B;CAC1B,OAAOA,kBAAAA,WAAW,QAAW,cAAc;EACzC,OAAO,IAAI,+BAA+B,QAAQ,WAA+B,SAAS,cAAc;CAC1G,CAAC;AACH;;;;;;AAOA,SAAgB,qBACd,SACA,gBAC0B;CAC1B,OAAOA,kBAAAA,WAAW,QAAW,cAAc;EACzC,OAAO,IAAI,gCAAgC,QAAQ,WAA+B,SAAS,cAAc;CAC3G,CAAC;AACH;;;;;;;AAQA,SAAgB,gBACd,SACA,gBAC0B;CAC1B,OAAOA,kBAAAA,WAAW,QAAW,cAAc;EACzC,OAAO,IAAI,2BAA2B,QAAQ,WAA+B,SAAS,cAAc;CACtG,CAAC;AACH;;;;;;AAOA,IAAe,kCAAf,cAA2FC,uCAAAA,qBAGzF;CAGA,IAAI,MAAW;EACb,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,EAAE,aAAa,MAAM,CAAC;CAChE;CAEA,IAAI,iBAAsB;EACxB,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,EAAE,aAAa,KAAK,CAAC;CAC/D;CAEA,cAAoB;EAClB,MAAM,IAAI,MAAM,yBAAyB;CAC3C;CAEA,MAAY;EACV,MAAM,IAAI,MAAM,yBAAyB;CAC3C;CAEA,IAAI,cAAuB;EACzB,OAAO;CACT;CAEA,UAAgB;EACd,MAAM,IAAI,MAAM,yBAAyB;CAC3C;CAEA,yBAAwC;EACtC,OAAO,QAAQ,QAAQ;CACzB;CAEA,qBAA2B,CAAC;CAE5B,IAAI,OAAuB;EACzB,OAAOC,uBAAAA,YAAY,KAAK,MAAM;CAChC;;CAKA,cAAwB,UAAe,MAAuC;EAC5E,OAAO,MAAM,gBAAgB,OACzB,CAAC,GAAG,QAAQ,IACZ,SAAS,QAAQ,MAAM,CAAC,EAAE,mBAAmB,CAAE,EAAU,mBAAmB;CAClF;CAEA,CAACC,kCAAAA,aAAgB;CACjB,CAACC,kCAAAA,aAAgB;AACnB;AAEA,IAAa,iCAAb,cACU,gCAEV;CACE;CACA;CACA;CACA,UAA+B,KAAA;CAC/B;CAEA,YAAY,QAAW,WAA6B,SAA2B,gBAAkC;EAC/G,MAAM,MAAM;EACZ,KAAKC,aAAa;EAClB,KAAKC,WAAW;EAChB,KAAKC,kBAAkB;CACzB;CAGA,MAAM,KAAK,OAAyD,CAAC,GAA0B;EAC7F,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,YAAY,KAAK,aAAa;GACtC,IAAI,KAAK,aACP,KAAKC,UAAU,KAAA;GAMjB,MAAM,eAAe,KAAK,cAAc,KAAK,SAAS,KAAK,sBAAsB,CAAC,EAAE;GACpF,IAAI,gBAAgB,CAAC,aAAa,aAAa;IAC7C,OAAO,KAAKC,iBAAiBC,iDAAAA,4BAA4B,KAAK,OAAO,IAAI,IAAI,CAAC,CAC3E,KAAK,YAAY,CAAC,CAClB,MAAM,SAAS,KAAK,KAAK;KACxB,MAAMC,sBAAAA,YAAY,qBAAK,IAAI,MAAM,CAAC;IACpC,CAAC,CAAC,CACD,cAAc;KACb,KAAKF,eAAe,KAAA;IACtB,CAAC;IAIH,MAAM,iBAAiB,KAAK,sBAAsB;IAClD,IAAI,gBACF,MAAMC,iDAAAA,4BAA4B,KAAK,OAAO,IAAI,IAAI,CAAC,CACpD,KAAK,eAAe,MAAM,CAAC,CAC3B,MAAM,SAAS,KAAK,KAAK;KACxB,MAAMC,sBAAAA,YAAY,qBAAK,IAAI,MAAM,CAAC;IACpC,CAAC;GAEP;GACA,KAAKH,UAAU;EACjB;EACA,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,IAAI;CAC9C;CAEA,IAAI,WAAoB;EACtB,IAAI,KAAKA,YAAY,KAAA,GAAW,OAAO,KAAKA;EAC5C,KAAKA,UAAU,KAAK,sBAAsB,MAAM,KAAA;EAChD,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,SAAS,IAAI;EAC5D,OAAO,KAAKA;CACd;CAEA,gBAAsB;EACpB,KAAKA,UAAU,KAAA;CACjB;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKH;CACd;CAEA,IAAI,eAAuB;EACzB,OAAO,KAAKC;CACd;CAEA,IAAI,iBAAyB;EAC3B,OAAO,KAAKC;CACd;CAEA,IAAI,aAAsB;EACxB,OAAO;CACT;CAEA,WAAmB;EACjB,OAAO,0CAA0C,KAAK,OAAO,eAAe,KAAK,UAAU;CAC7F;CAEA,QAAa;EACX,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,MAAM,WAAW,KAAK,sBAAsB;EAC5C,IAAI,UACF,MAAM,IAAI,MAAM,KAAK,SAAS,IAAI,uBAAuB,SAAS,gBAAgB;EAEpF,MAAM,UAAe,CAAC;EACtB,MAAM,0BAAU,IAAI,IAAO;EAC3B,KACE,IAAI,UAAU,mBAAmB,KAAK,OAAO,KAAKD,SAAS,GAC3D,YAAY,KAAA,GACZ,UAAU,mBAAmB,QAAQ,KAAKA,SAAS,GACnD;GACA,QAAQ,KAAK,OAAO;GACpB,IAAI,QAAQ,IAAI,OAAO,GAAG,MAAM,IAAIM,sCAAAA,oBAAoB,MAAM,CAAC,GAAG,SAAS,OAAO,CAAC;GACnF,QAAQ,IAAI,OAAO;EACrB;EACA,OAAO;CACT;CAEA,wBAAsE;EACpE,MAAM,0BAAU,IAAI,IAAS;EAC7B,KAAK,IAAI,UAAU,KAAK,QAAQ,YAAY,KAAA,GAAW,UAAU,mBAAmB,QAAQ,KAAKN,SAAS,GAAG;GAC3G,MAAM,WAAW,QAAQ,KAAKA;GAC9B,IAAIO,4BAAAA,YAAY,QAAQ,KAAK,CAACC,4BAAAA,kBAAkB,QAAQ,GAAG,OAAO;GAClE,IAAI,QAAQ,IAAI,OAAO,GAAG,MAAM,IAAIF,sCAAAA,oBAAoB,MAAM,CAAC,GAAG,SAAS,OAAO,CAAC;GACnF,QAAQ,IAAI,OAAO;EACrB;CAEF;AACF;AAEA,IAAa,kCAAb,cACU,gCAEV;CACE;CACA;CACA;CACA,UAA+B,KAAA;CAC/B;CAEA,YAAY,QAAW,WAA6B,SAA2B,gBAAkC;EAC/G,MAAM,MAAM;EACZ,KAAKP,aAAa;EAClB,KAAKU,WAAW;EAChB,KAAKR,kBAAkB;CACzB;CAGA,MAAM,KAAK,OAAyD,CAAC,GAA0B;EAC7F,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,YAAY,KAAK,aAAa;GACtC,IAAI,KAAK,aACP,KAAKC,UAAU,KAAA;GAEjB,IAAI,CAAC,KAAK,OAAO,aACf,OAAO,KAAKC,iBAAiBO,kDAAAA,6BAA6B,KAAK,OAAO,IAAI,IAAI,CAAC,CAC5E,KAAK,KAAK,MAAM,CAAC,CACjB,MAAM,SAAS,KAAK,KAAK;IACxB,MAAML,sBAAAA,YAAY,qBAAK,IAAI,MAAM,CAAC;GACpC,CAAC,CAAC,CACD,cAAc;IACb,KAAKF,eAAe,KAAA;GACtB,CAAC;GAEL,MAAM,WAAW,KAAK,wBAAwB;GAC9C,IAAI,SAAS,SAAS,GAIpB,MAAM,QAAQ,IAAI,SAAS,KAAK,MAAO,EAAE,OAAe,KAAK,UAAU,CAAC,KAAK,IAAI,CAAC,CAAC;GAErF,KAAKD,UAAU;EACjB;EACA,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,IAAI;CAC9C;CAEA,IAAI,WAAoB;EACtB,IAAI,KAAKA,YAAY,KAAA,GAAW,OAAO,KAAKA;EAC5C,KAAKA,UAAU,KAAK,wBAAwB,CAAC,CAAC,WAAW;EACzD,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,SAAS,IAAI;EAC5D,OAAO,KAAKA;CACd;CAEA,gBAAsB;EACpB,KAAKA,UAAU,KAAA;CACjB;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKH;CACd;CAEA,IAAI,eAAuB;EACzB,OAAO,KAAKU;CACd;CAEA,IAAI,iBAAyB;EAC3B,OAAO,KAAKR;CACd;CAEA,IAAI,aAAsB;EACxB,OAAO;CACT;CAEA,WAAmB;EACjB,OAAO,2CAA2C,KAAK,OAAO,eAAe,KAAK,UAAU;CAC9F;CAEA,QAAa;EACX,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,UACR,MAAM,IAAI,MAAM,KAAK,SAAS,IAAI,qCAAqC;EAEzE,MAAM,WAAgB,CAAC;EACvB,MAAM,0BAAU,IAAI,IAAS;EAE7B,MAAM,OAAuC,CAAC;GAAE,UAAU,KAAK,OAAO,KAAKQ;GAAW,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAClH,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,UAAU,SAAS,KAAK,IAAI;GACpC,IAAI,QAAQ,IAAI,QAAQ,GAAG,MAAM,IAAIH,sCAAAA,oBAAoB,MAAM,IAAI;GACnE,QAAQ,IAAI,QAAQ;GACpB,KAAK,MAAM,SAAS,oBAAoB,QAAQ,GAAG;IACjD,SAAS,KAAK,KAAK;IACnB,KAAK,KAAK;KAAE,UAAU,MAAM,KAAKG;KAAW,MAAM,CAAC,GAAG,MAAM,KAAK;IAAE,CAAC;GACtE;EACF;EACA,OAAO;CACT;;CAGA,0BAAwD;EACtD,MAAM,0BAAU,IAAI,IAAS;EAC7B,MAAM,WAAiC,CAAC;EACxC,MAAM,OAAuC,CAAC;GAAE,UAAU,KAAK,OAAO,KAAKA;GAAW,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAClH,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,UAAU,SAAS,KAAK,IAAI;GACpC,IAAI,QAAQ,IAAI,QAAQ,GAAG,MAAM,IAAIH,sCAAAA,oBAAoB,MAAM,IAAI;GACnE,QAAQ,IAAI,QAAQ;GACpB,IAAIK,6BAAAA,aAAa,QAAQ,KAAK,CAACC,6BAAAA,mBAAmB,QAAQ,GACxD,SAAS,KAAK,QAAQ;QACjB,IAAIC,oCAAAA,oBAAoB,QAAQ,KAAK,CAACC,oCAAAA,0BAA0B,QAAQ,GAC7E,SAAS,KAAK,QAAQ;QAEtB,KAAK,MAAM,SAAS,oBAAoB,QAAQ,GAC9C,KAAK,KAAK;IAAE,UAAU,MAAM,KAAKL;IAAW,MAAM,CAAC,GAAG,MAAM,KAAK;GAAE,CAAC;EAG1E;EACA,OAAO;CACT;AACF;AAEA,IAAa,6BAAb,cACU,gCAEV;CACE;CACA;CACA;CACA,UAA+B,KAAA;CAC/B;CAEA,YAAY,QAAW,WAA6B,SAA2B,gBAAkC;EAC/G,MAAM,MAAM;EACZ,KAAKV,aAAa;EAClB,KAAKgB,WAAW;EAChB,KAAKd,kBAAkB;CACzB;CAGA,MAAM,KAAK,OAAyD,CAAC,GAA0B;EAC7F,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,YAAY,KAAK,aAAa;GACtC,IAAI,KAAK,aACP,KAAKC,UAAU,KAAA;GAEjB,IAAI,CAAC,KAAK,OAAO,aACf,OAAO,KAAKC,iBAAiBa,6CAAAA,wBAAwB,KAAK,OAAO,IAAI,IAAI,CAAC,CACvE,KAAK,KAAK,MAAM,CAAC,CACjB,MAAM,SAAS,KAAK,KAAU;IAC7B,MAAMX,sBAAAA,YAAY,qBAAK,IAAI,MAAM,CAAC;GACpC,CAAC,CAAC,CACD,cAAc;IACb,KAAKF,eAAe,KAAA;GACtB,CAAC;GAEL,MAAM,WAAW,KAAK,wBAAwB;GAC9C,IAAI,SAAS,SAAS,GAEpB,MAAM,QAAQ,IAAI,SAAS,KAAK,MAAO,EAAE,OAAe,KAAK,UAAU,CAAC,KAAK,IAAI,CAAC,CAAC;GAErF,KAAKD,UAAU;EACjB;EACA,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,IAAI;CAC9C;CAEA,IAAI,WAAoB;EACtB,IAAI,KAAKA,YAAY,KAAA,GAAW,OAAO,KAAKA;EAC5C,KAAKA,UAAU,KAAK,wBAAwB,CAAC,CAAC,WAAW;EACzD,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,SAAS,IAAI;EAC5D,OAAO,KAAKA;CACd;CAEA,gBAAsB;EACpB,KAAKA,UAAU,KAAA;CACjB;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKH;CACd;CAEA,IAAI,eAAuB;EACzB,OAAO,KAAKgB;CACd;CAEA,IAAI,iBAAyB;EAC3B,OAAO,KAAKd;CACd;CAEA,IAAI,WAA4B;EAC9B,OAAO,KAAK,KAAK,UAAU,KAAKc;CAClC;CAEA,IAAI,aAAsB;EACxB,OAAO;CACT;CAEA,WAAmB;EACjB,OAAO,sCAAsC,KAAK,OAAO,eAAe,KAAK,UAAU;CACzF;CAEA,QAAa;EACX,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,UACR,MAAM,IAAI,MAAM,KAAK,SAAS,IAAI,qCAAqC;EAEzE,MAAM,UAAe,CAAC;EAEtB,MAAM,0BAAU,IAAI,IAAS;EAC7B,QAAQ,IAAI,KAAK,MAAM;EACvB,MAAM,OAAqC,CAAC;GAAE,QAAQ,KAAK;GAAQ,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAC/F,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,QAAQ,SAAS,SAAS,KAAK,IAAI;GAC3C,KAAK,MAAM,SAAS,oBAAoB,QAAQ,KAAKA,SAAS,GAAG;IAC/D,IAAI,QAAQ,IAAI,KAAK,GAAG;KAEtB,IAAI,UAAU,KAAK,QAAQ,MAAM,IAAIT,sCAAAA,oBAAoB,MAAM,CAAC,GAAG,MAAM,KAAK,CAAC;KAE/E;IACF;IACA,QAAQ,IAAI,KAAK;IACjB,QAAQ,KAAK,KAAK;IAClB,KAAK,KAAK;KAAE,QAAQ;KAAO,MAAM,CAAC,GAAG,MAAM,KAAK;IAAE,CAAC;GACrD;EACF;EACA,OAAO;CACT;;CAGA,0BAAwD;EACtD,MAAM,0BAAU,IAAI,IAAS;EAC7B,QAAQ,IAAI,KAAK,MAAM;EACvB,MAAM,WAAiC,CAAC;EACxC,MAAM,OAAqC,CAAC;GAAE,QAAQ,KAAK;GAAQ,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAC/F,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,QAAQ,SAAS,SAAS,KAAK,IAAI;GAC3C,MAAM,WAAW,QAAQ,KAAKS;GAC9B,IAAIJ,6BAAAA,aAAa,QAAQ,KAAK,CAACC,6BAAAA,mBAAmB,QAAQ,GACxD,SAAS,KAAK,QAAQ;QAEtB,KAAK,MAAM,SAAS,oBAAoB,QAAQ,GAAG;IACjD,IAAI,QAAQ,IAAI,KAAK,GAAG;KACtB,IAAI,UAAU,KAAK,QAAQ,MAAM,IAAIN,sCAAAA,oBAAoB,MAAM,CAAC,GAAG,MAAM,KAAK,CAAC;KAC/E;IACF;IACA,QAAQ,IAAI,KAAK;IACjB,KAAK,KAAK;KAAE,QAAQ;KAAO,MAAM,CAAC,GAAG,MAAM,KAAK;IAAE,CAAC;GACrD;EAEJ;EACA,OAAO;CACT;AACF;AAEA,SAAS,mBAAmB,UAAoB;CAC9C,OAAOE,4BAAAA,kBAAkB,QAAQ,IAAI,SAAS,MAAMS,cAAAA,KAAK,GAAG,SAAS,gBAAgB;AACvF;AAEA,SAAS,oBAAoB,UAAoB;CAC/C,OAAOL,6BAAAA,mBAAmB,QAAQ,IAC9B,SAAS,MACTE,oCAAAA,0BAA0B,QAAQ,IAChC,SAAS,MACP,CAAC,SAAS,GAAG,IACb,CAAC,IACHG,cAAAA,KAAK,GAAG,SAAS,gBAAgB;AACzC"}

package/build/relations/RecursiveCollection.d.cts

@@ -1,6 +1,6 @@
 import { AbstractRelationImpl } from "./AbstractRelationImpl.cjs";
 import { RelationT, RelationU } from "./RelationSymbols.cjs";
-import { IsLoadedCachable } from "../IsLoadedCache.cjs";
+import { IsLoadedCachable } from "../loading/IsLoadedCache.cjs";
 import { ReadOnlyCollection } from "./ReadOnlyCollection.cjs";
 import { RecursiveCycleError } from "./RecursiveCycleError.cjs";
 import { EntityMetadata, ManyToManyField } from "../EntityMetadata.cjs";

package/build/relations/RecursiveCollection.d.mts

@@ -1,6 +1,6 @@
 import { AbstractRelationImpl } from "./AbstractRelationImpl.mjs";
 import { RelationT, RelationU } from "./RelationSymbols.mjs";
-import { IsLoadedCachable } from "../IsLoadedCache.mjs";
+import { IsLoadedCachable } from "../loading/IsLoadedCache.mjs";
 import { ReadOnlyCollection } from "./ReadOnlyCollection.mjs";
 import { RecursiveCycleError } from "./RecursiveCycleError.mjs";
 import { EntityMetadata, ManyToManyField } from "../EntityMetadata.mjs";

package/build/relations/RecursiveCollection.js

@@ -1,14 +1,13 @@
 import { isCollection, isLoadedCollection } from "./Collection.js";
 import { AbstractRelationImpl } from "./AbstractRelationImpl.js";
 import { RelationT, RelationU } from "./RelationSymbols.js";
-import { RecursiveCycleError } from "./RecursiveCycleError.js";
-import "../IsLoadedCache.js";
-import { isLoadedReference, isReference } from "./Reference.js";
-import { isLoadedOneToOneReference, isOneToOneReference } from "./OneToOneReference.js";
 import { recursiveChildrenBatchLoader } from "../batchloaders/recursiveChildrenBatchLoader.js";
 import { recursiveM2mBatchLoader } from "../batchloaders/recursiveM2mBatchLoader.js";
 import { recursiveParentsBatchLoader } from "../batchloaders/recursiveParentsBatchLoader.js";
 import "./ReadOnlyCollection.js";
+import { RecursiveCycleError } from "./RecursiveCycleError.js";
+import { isLoadedReference, isReference } from "./Reference.js";
+import { isLoadedOneToOneReference, isOneToOneReference } from "./OneToOneReference.js";
 import { fail } from "../utils.js";
 import { lazyField } from "../newEntity.js";
 import { getMetadata } from "../EntityMetadata.js";

package/build/relations/RecursiveCollection.js.map

@@ -1 +1 @@
-{"version":3,"file":"RecursiveCollection.js","names":["#fieldName","#m2oName","#otherFieldName","#loaded","#loadPromise","#o2mName","#m2mName"],"sources":["../../src/relations/RecursiveCollection.ts"],"sourcesContent":["import { recursiveChildrenBatchLoader } from \"../batchloaders/recursiveChildrenBatchLoader.ts\";\nimport { recursiveM2mBatchLoader } from \"../batchloaders/recursiveM2mBatchLoader.ts\";\nimport { recursiveParentsBatchLoader } from \"../batchloaders/recursiveParentsBatchLoader.ts\";\nimport {\n  type Entity,\n  type EntityMetadata,\n  type ManyToManyField,\n  type Reference,\n  type Relation,\n  appendStack,\n  ensureNotDeleted,\n  fail,\n  getEmInternalApi,\n  getMetadata,\n  isCollection,\n  isLoadedCollection,\n  isLoadedOneToOneReference,\n  isLoadedReference,\n  isOneToOneReference,\n  isReference,\n} from \"../index.ts\";\nimport { type IsLoadedCachable } from \"../IsLoadedCache.ts\";\nimport { lazyField } from \"../newEntity.ts\";\nimport { AbstractRelationImpl } from \"./AbstractRelationImpl.ts\";\nimport { type ReadOnlyCollection } from \"./ReadOnlyCollection.ts\";\nimport { RecursiveCycleError } from \"./RecursiveCycleError.ts\";\nimport { RelationT, RelationU } from \"./RelationSymbols.ts\";\n\nexport { RecursiveCycleError };\n\n/**\n * An alias for creating `RecursiveParentsCollectionImpl`s.\n *\n * I.e. for `Author.mentor` (m2o fk), we can return `Author.mentorsRecursive` recursively looking up.\n */\nexport function hasRecursiveParents<T extends Entity, U extends Entity>(\n  m2oName: keyof T & string, // i.e. `author.mentor`\n  otherFieldName: keyof T & string, // i.e. `author.menteesRecursive`\n): ReadOnlyCollection<T, U> {\n  return lazyField((entity: T, fieldName) => {\n    return new RecursiveParentsCollectionImpl(entity, fieldName as keyof T & string, m2oName, otherFieldName);\n  });\n}\n\n/**\n * An alias for creating `RecursiveChildrenCollectionImpl`s.\n *\n * I.e. for `Author.mentees` (o2m), we can return `Author.menteesRecursive` recursively looking down.\n */\nexport function hasRecursiveChildren<T extends Entity, U extends Entity>(\n  o2mName: keyof T & string, // i.e. `author.mentees`\n  otherFieldName: keyof T & string, // i.e. `author.mentorsRecursive`\n): ReadOnlyCollection<T, U> {\n  return lazyField((entity: T, fieldName) => {\n    return new RecursiveChildrenCollectionImpl(entity, fieldName as keyof T & string, o2mName, otherFieldName);\n  });\n}\n\n/**\n * An alias for creating `RecursiveM2mCollectionImpl`s.\n *\n * I.e. for `User.parents` (m2m), we can return `User.parentsRecursive` recursively looking up through the m2m.\n * Or for `User.children` (m2m), we can return `User.childrenRecursive` recursively looking down.\n */\nexport function hasRecursiveM2m<T extends Entity, U extends Entity>(\n  m2mName: keyof T & string, // i.e. `user.parents` or `user.children`\n  otherFieldName: keyof T & string, // i.e. `user.childrenRecursive` or `user.parentsRecursive`\n): ReadOnlyCollection<T, U> {\n  return lazyField((entity: T, fieldName) => {\n    return new RecursiveM2mCollectionImpl(entity, fieldName as keyof T & string, m2mName, otherFieldName);\n  });\n}\n\n/**\n * A base class for the common methods between the parent & children recursive collections.\n *\n * We could probably move some of this into AbstractRelationImpl?\n */\nabstract class AbstractRecursiveCollectionImpl<T extends Entity, U extends Entity> extends AbstractRelationImpl<\n  T,\n  U[]\n> {\n  abstract fieldName: string;\n\n  get get(): U[] {\n    return this.filterDeleted(this.doGet(), { withDeleted: false });\n  }\n\n  get getWithDeleted(): U[] {\n    return this.filterDeleted(this.doGet(), { withDeleted: true });\n  }\n\n  setFromOpts(): void {\n    throw new Error(\"Method not implemented.\");\n  }\n\n  set(): void {\n    throw new Error(\"Method not implemented.\");\n  }\n\n  get isPreloaded(): boolean {\n    return false;\n  }\n\n  preload(): void {\n    throw new Error(\"Method not implemented.\");\n  }\n\n  cleanupOnEntityDeleted(): Promise<void> {\n    return Promise.resolve();\n  }\n\n  maybeCascadeDelete(): void {}\n\n  get meta(): EntityMetadata {\n    return getMetadata(this.entity);\n  }\n\n  abstract doGet(): U[];\n\n  /** Removes pending-hard-delete or soft-deleted entities, unless explicitly asked for. */\n  protected filterDeleted(entities: U[], opts?: { withDeleted?: boolean }): U[] {\n    return opts?.withDeleted === true\n      ? [...entities]\n      : entities.filter((e) => !e.isDeletedEntity && !(e as any).isSoftDeletedEntity);\n  }\n\n  [RelationT]: T = null!;\n  [RelationU]: U = null!;\n}\n\nexport class RecursiveParentsCollectionImpl<T extends Entity, U extends Entity>\n  extends AbstractRecursiveCollectionImpl<T, U>\n  implements ReadOnlyCollection<T, U>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #m2oName: keyof T & string;\n  readonly #otherFieldName: keyof T & string;\n  #loaded: boolean | undefined = undefined;\n  #loadPromise: Promise<void> | undefined;\n\n  constructor(entity: T, fieldName: keyof T & string, m2oName: keyof T & string, otherFieldName: keyof T & string) {\n    super(entity);\n    this.#fieldName = fieldName;\n    this.#m2oName = m2oName;\n    this.#otherFieldName = otherFieldName;\n  }\n\n  // opts is an internal parameter\n  async load(opts: { withDeleted?: boolean; forceReload?: boolean } = {}): Promise<readonly U[]> {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded || opts.forceReload) {\n      if (opts.forceReload) {\n        this.#loaded = undefined;\n      }\n      // If we have `[grandchild, newlyCreatedParent, existingGrandparent, ...more...]`, skip up to the\n      // `existingGrandparent`, because if we `.load(entity)` (i.e. where we are the `grandchild`) then\n      // recursiveParentsBatchLoader will try CTE query up from `grandchild[parent]`, but since that will\n      // be `newlyCreatedParent`, it doesn't have an id yet.\n      const entityToLoad = opts.forceReload ? this.entity : this.findUnloadedReference()?.entity;\n      if (entityToLoad && !entityToLoad.isNewEntity) {\n        await (this.#loadPromise ??= recursiveParentsBatchLoader(this.entity.em, this)\n          .load(entityToLoad)\n          .catch(function load(err) {\n            throw appendStack(err, new Error());\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n        // See if there are any WIP changes, i.e. new parents, that the ^ SQL query didn't know to load.\n        // We don't have to `while` loop this, because if parent itself has WIP changes above it, then\n        // its own `RecursiveParentsCollectionImpl.load` will load it, before returning to this method.\n        const unloadedParent = this.findUnloadedReference();\n        if (unloadedParent) {\n          await recursiveParentsBatchLoader(this.entity.em, this)\n            .load(unloadedParent.entity)\n            .catch(function load(err) {\n              throw appendStack(err, new Error());\n            });\n        }\n      }\n      this.#loaded = true;\n    }\n    return this.filterDeleted(this.doGet(), opts);\n  }\n\n  get isLoaded(): boolean {\n    if (this.#loaded !== undefined) return this.#loaded;\n    this.#loaded = this.findUnloadedReference() === undefined;\n    getEmInternalApi(this.entity.em).isLoadedCache.addNaive(this);\n    return this.#loaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#loaded = undefined;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  get m2oFieldName(): string {\n    return this.#m2oName;\n  }\n\n  get otherFieldName(): string {\n    return this.#otherFieldName;\n  }\n\n  get hasBeenSet(): boolean {\n    return false;\n  }\n\n  toString(): string {\n    return `RecursiveParentsCollectionImpl(entity: ${this.entity}, fieldName: ${this.fieldName})`;\n  }\n\n  doGet(): U[] {\n    ensureNotDeleted(this.entity, \"pending\");\n    const unloaded = this.findUnloadedReference();\n    if (unloaded) {\n      throw new Error(this.toString() + `.get was called but ${unloaded} was not loaded`);\n    }\n    const parents: U[] = [];\n    const visited = new Set<U>();\n    for (\n      let current = getLoadedReference(this.entity[this.#m2oName]);\n      current !== undefined;\n      current = getLoadedReference(current[this.#m2oName])\n    ) {\n      parents.push(current);\n      if (visited.has(current)) throw new RecursiveCycleError(this, [...visited, current]);\n      visited.add(current);\n    }\n    return parents;\n  }\n\n  private findUnloadedReference(): Reference<any, any, any> | undefined {\n    const visited = new Set<any>();\n    for (let current = this.entity; current !== undefined; current = getLoadedReference(current[this.#m2oName])) {\n      const relation = current[this.#m2oName];\n      if (isReference(relation) && !isLoadedReference(relation)) return relation;\n      if (visited.has(current)) throw new RecursiveCycleError(this, [...visited, current]);\n      visited.add(current);\n    }\n    return undefined;\n  }\n}\n\nexport class RecursiveChildrenCollectionImpl<T extends Entity, U extends Entity>\n  extends AbstractRecursiveCollectionImpl<T, U>\n  implements ReadOnlyCollection<T, U>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #o2mName: keyof T & string;\n  readonly #otherFieldName: keyof T & string;\n  #loaded: boolean | undefined = undefined;\n  #loadPromise: Promise<void> | undefined;\n\n  constructor(entity: T, fieldName: keyof T & string, o2mName: keyof T & string, otherFieldName: keyof T & string) {\n    super(entity);\n    this.#fieldName = fieldName;\n    this.#o2mName = o2mName;\n    this.#otherFieldName = otherFieldName;\n  }\n\n  // opts is an internal parameter\n  async load(opts: { withDeleted?: boolean; forceReload?: boolean } = {}): Promise<readonly U[]> {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded || opts.forceReload) {\n      if (opts.forceReload) {\n        this.#loaded = undefined;\n      }\n      if (!this.entity.isNewEntity) {\n        await (this.#loadPromise ??= recursiveChildrenBatchLoader(this.entity.em, this)\n          .load(this.entity)\n          .catch(function load(err) {\n            throw appendStack(err, new Error());\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n      }\n      const unloaded = this.findUnloadedCollections();\n      if (unloaded.length > 0) {\n        // Go through the entities own `fooRecursive` collection so that it's marked as loaded.\n        // We don't have to `while` loop this, because if they children themselves have any WIP\n        // changes, then their own `RecursiveChildrenCollectionImpl.load` will load them.\n        await Promise.all(unloaded.map((r) => (r.entity as any)[this.fieldName].load(opts)));\n      }\n      this.#loaded = true;\n    }\n    return this.filterDeleted(this.doGet(), opts);\n  }\n\n  get isLoaded(): boolean {\n    if (this.#loaded !== undefined) return this.#loaded;\n    this.#loaded = this.findUnloadedCollections().length === 0;\n    getEmInternalApi(this.entity.em).isLoadedCache.addNaive(this);\n    return this.#loaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#loaded = undefined;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  get o2mFieldName(): string {\n    return this.#o2mName;\n  }\n\n  get otherFieldName(): string {\n    return this.#otherFieldName;\n  }\n\n  get hasBeenSet(): boolean {\n    return false;\n  }\n\n  toString(): string {\n    return `RecursiveChildrenCollectionImpl(entity: ${this.entity}, fieldName: ${this.fieldName})`;\n  }\n\n  doGet(): U[] {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded) {\n      throw new Error(this.toString() + `.get was called but when not loaded`);\n    }\n    const children: U[] = [];\n    const visited = new Set<any>();\n    // Use a node+path combo to know which path caused the cycle\n    const todo: { relation: any; path: U[] }[] = [{ relation: this.entity[this.#o2mName], path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { relation, path } = todo.pop()!;\n      if (visited.has(relation)) throw new RecursiveCycleError(this, path);\n      visited.add(relation);\n      for (const child of getLoadedCollection(relation)) {\n        children.push(child);\n        todo.push({ relation: child[this.#o2mName], path: [...path, child] });\n      }\n    }\n    return children;\n  }\n\n  /** Finds any children/downstream o2m collections or o2o references. */\n  private findUnloadedCollections(): Relation<any, any>[] {\n    const visited = new Set<any>();\n    const unloaded: Relation<any, any>[] = [];\n    const todo: { relation: any; path: U[] }[] = [{ relation: this.entity[this.#o2mName], path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { relation, path } = todo.pop()!;\n      if (visited.has(relation)) throw new RecursiveCycleError(this, path);\n      visited.add(relation);\n      if (isCollection(relation) && !isLoadedCollection(relation)) {\n        unloaded.push(relation);\n      } else if (isOneToOneReference(relation) && !isLoadedOneToOneReference(relation)) {\n        unloaded.push(relation);\n      } else {\n        for (const child of getLoadedCollection(relation)) {\n          todo.push({ relation: child[this.#o2mName], path: [...path, child] });\n        }\n      }\n    }\n    return unloaded;\n  }\n}\n\nexport class RecursiveM2mCollectionImpl<T extends Entity, U extends Entity>\n  extends AbstractRecursiveCollectionImpl<T, U>\n  implements ReadOnlyCollection<T, U>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #m2mName: keyof T & string;\n  readonly #otherFieldName: keyof T & string;\n  #loaded: boolean | undefined = undefined;\n  #loadPromise: Promise<void> | undefined;\n\n  constructor(entity: T, fieldName: keyof T & string, m2mName: keyof T & string, otherFieldName: keyof T & string) {\n    super(entity);\n    this.#fieldName = fieldName;\n    this.#m2mName = m2mName;\n    this.#otherFieldName = otherFieldName;\n  }\n\n  // opts is an internal parameter\n  async load(opts: { withDeleted?: boolean; forceReload?: boolean } = {}): Promise<readonly U[]> {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded || opts.forceReload) {\n      if (opts.forceReload) {\n        this.#loaded = undefined;\n      }\n      if (!this.entity.isNewEntity) {\n        await (this.#loadPromise ??= recursiveM2mBatchLoader(this.entity.em, this)\n          .load(this.entity)\n          .catch(function load(err: any) {\n            throw appendStack(err, new Error());\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n      }\n      const unloaded = this.findUnloadedCollections();\n      if (unloaded.length > 0) {\n        // Go through the entity's own `fooRecursive` collection so that it's marked as loaded.\n        await Promise.all(unloaded.map((r) => (r.entity as any)[this.fieldName].load(opts)));\n      }\n      this.#loaded = true;\n    }\n    return this.filterDeleted(this.doGet(), opts);\n  }\n\n  get isLoaded(): boolean {\n    if (this.#loaded !== undefined) return this.#loaded;\n    this.#loaded = this.findUnloadedCollections().length === 0;\n    getEmInternalApi(this.entity.em).isLoadedCache.addNaive(this);\n    return this.#loaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#loaded = undefined;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  get m2mFieldName(): string {\n    return this.#m2mName;\n  }\n\n  get otherFieldName(): string {\n    return this.#otherFieldName;\n  }\n\n  get m2mField(): ManyToManyField {\n    return this.meta.allFields[this.#m2mName] as ManyToManyField;\n  }\n\n  get hasBeenSet(): boolean {\n    return false;\n  }\n\n  toString(): string {\n    return `RecursiveM2mCollectionImpl(entity: ${this.entity}, fieldName: ${this.fieldName})`;\n  }\n\n  doGet(): U[] {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded) {\n      throw new Error(this.toString() + `.get was called but when not loaded`);\n    }\n    const results: U[] = [];\n    // Track by entity to handle diamonds (same entity reachable via multiple paths)\n    const visited = new Set<any>();\n    visited.add(this.entity);\n    const todo: { entity: any; path: U[] }[] = [{ entity: this.entity, path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { entity: current, path } = todo.pop()!;\n      for (const other of getLoadedCollection(current[this.#m2mName])) {\n        if (visited.has(other)) {\n          // If we're reaching an entity we've already visited, and it's this.entity, that's a cycle\n          if (other === this.entity) throw new RecursiveCycleError(this, [...path, other]);\n          // Otherwise it's a diamond (reachable via multiple paths) — skip\n          continue;\n        }\n        visited.add(other);\n        results.push(other);\n        todo.push({ entity: other, path: [...path, other] });\n      }\n    }\n    return results;\n  }\n\n  /** Finds any m2m collections that are not yet loaded in the recursive tree. */\n  private findUnloadedCollections(): Relation<any, any>[] {\n    const visited = new Set<any>();\n    visited.add(this.entity);\n    const unloaded: Relation<any, any>[] = [];\n    const todo: { entity: any; path: U[] }[] = [{ entity: this.entity, path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { entity: current, path } = todo.pop()!;\n      const relation = current[this.#m2mName];\n      if (isCollection(relation) && !isLoadedCollection(relation)) {\n        unloaded.push(relation);\n      } else {\n        for (const other of getLoadedCollection(relation)) {\n          if (visited.has(other)) {\n            if (other === this.entity) throw new RecursiveCycleError(this, [...path, other]);\n            continue;\n          }\n          visited.add(other);\n          todo.push({ entity: other, path: [...path, other] });\n        }\n      }\n    }\n    return unloaded;\n  }\n}\n\nfunction getLoadedReference(relation: any): any {\n  return isLoadedReference(relation) ? relation.get : fail(`${relation} was not loaded`);\n}\n\nfunction getLoadedCollection(relation: any): any {\n  return isLoadedCollection(relation)\n    ? relation.get\n    : isLoadedOneToOneReference(relation)\n      ? relation.get\n        ? [relation.get]\n        : []\n      : fail(`${relation} was not loaded`);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAmCA,SAAgB,oBACd,SACA,gBAC0B;CAC1B,OAAO,WAAW,QAAW,cAAc;EACzC,OAAO,IAAI,+BAA+B,QAAQ,WAA+B,SAAS,cAAc;CAC1G,CAAC;AACH;;;;;;AAOA,SAAgB,qBACd,SACA,gBAC0B;CAC1B,OAAO,WAAW,QAAW,cAAc;EACzC,OAAO,IAAI,gCAAgC,QAAQ,WAA+B,SAAS,cAAc;CAC3G,CAAC;AACH;;;;;;;AAQA,SAAgB,gBACd,SACA,gBAC0B;CAC1B,OAAO,WAAW,QAAW,cAAc;EACzC,OAAO,IAAI,2BAA2B,QAAQ,WAA+B,SAAS,cAAc;CACtG,CAAC;AACH;;;;;;AAOA,IAAe,kCAAf,cAA2F,qBAGzF;CAGA,IAAI,MAAW;EACb,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,EAAE,aAAa,MAAM,CAAC;CAChE;CAEA,IAAI,iBAAsB;EACxB,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,EAAE,aAAa,KAAK,CAAC;CAC/D;CAEA,cAAoB;EAClB,MAAM,IAAI,MAAM,yBAAyB;CAC3C;CAEA,MAAY;EACV,MAAM,IAAI,MAAM,yBAAyB;CAC3C;CAEA,IAAI,cAAuB;EACzB,OAAO;CACT;CAEA,UAAgB;EACd,MAAM,IAAI,MAAM,yBAAyB;CAC3C;CAEA,yBAAwC;EACtC,OAAO,QAAQ,QAAQ;CACzB;CAEA,qBAA2B,CAAC;CAE5B,IAAI,OAAuB;EACzB,OAAO,YAAY,KAAK,MAAM;CAChC;;CAKA,cAAwB,UAAe,MAAuC;EAC5E,OAAO,MAAM,gBAAgB,OACzB,CAAC,GAAG,QAAQ,IACZ,SAAS,QAAQ,MAAM,CAAC,EAAE,mBAAmB,CAAE,EAAU,mBAAmB;CAClF;CAEA,CAAC,aAAgB;CACjB,CAAC,aAAgB;AACnB;AAEA,IAAa,iCAAb,cACU,gCAEV;CACE;CACA;CACA;CACA,UAA+B,KAAA;CAC/B;CAEA,YAAY,QAAW,WAA6B,SAA2B,gBAAkC;EAC/G,MAAM,MAAM;EACZ,KAAKA,aAAa;EAClB,KAAKC,WAAW;EAChB,KAAKC,kBAAkB;CACzB;CAGA,MAAM,KAAK,OAAyD,CAAC,GAA0B;EAC7F,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,YAAY,KAAK,aAAa;GACtC,IAAI,KAAK,aACP,KAAKC,UAAU,KAAA;GAMjB,MAAM,eAAe,KAAK,cAAc,KAAK,SAAS,KAAK,sBAAsB,CAAC,EAAE;GACpF,IAAI,gBAAgB,CAAC,aAAa,aAAa;IAC7C,OAAO,KAAKC,iBAAiB,4BAA4B,KAAK,OAAO,IAAI,IAAI,CAAC,CAC3E,KAAK,YAAY,CAAC,CAClB,MAAM,SAAS,KAAK,KAAK;KACxB,MAAM,YAAY,qBAAK,IAAI,MAAM,CAAC;IACpC,CAAC,CAAC,CACD,cAAc;KACb,KAAKA,eAAe,KAAA;IACtB,CAAC;IAIH,MAAM,iBAAiB,KAAK,sBAAsB;IAClD,IAAI,gBACF,MAAM,4BAA4B,KAAK,OAAO,IAAI,IAAI,CAAC,CACpD,KAAK,eAAe,MAAM,CAAC,CAC3B,MAAM,SAAS,KAAK,KAAK;KACxB,MAAM,YAAY,qBAAK,IAAI,MAAM,CAAC;IACpC,CAAC;GAEP;GACA,KAAKD,UAAU;EACjB;EACA,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,IAAI;CAC9C;CAEA,IAAI,WAAoB;EACtB,IAAI,KAAKA,YAAY,KAAA,GAAW,OAAO,KAAKA;EAC5C,KAAKA,UAAU,KAAK,sBAAsB,MAAM,KAAA;EAChD,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,SAAS,IAAI;EAC5D,OAAO,KAAKA;CACd;CAEA,gBAAsB;EACpB,KAAKA,UAAU,KAAA;CACjB;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKH;CACd;CAEA,IAAI,eAAuB;EACzB,OAAO,KAAKC;CACd;CAEA,IAAI,iBAAyB;EAC3B,OAAO,KAAKC;CACd;CAEA,IAAI,aAAsB;EACxB,OAAO;CACT;CAEA,WAAmB;EACjB,OAAO,0CAA0C,KAAK,OAAO,eAAe,KAAK,UAAU;CAC7F;CAEA,QAAa;EACX,iBAAiB,KAAK,QAAQ,SAAS;EACvC,MAAM,WAAW,KAAK,sBAAsB;EAC5C,IAAI,UACF,MAAM,IAAI,MAAM,KAAK,SAAS,IAAI,uBAAuB,SAAS,gBAAgB;EAEpF,MAAM,UAAe,CAAC;EACtB,MAAM,0BAAU,IAAI,IAAO;EAC3B,KACE,IAAI,UAAU,mBAAmB,KAAK,OAAO,KAAKD,SAAS,GAC3D,YAAY,KAAA,GACZ,UAAU,mBAAmB,QAAQ,KAAKA,SAAS,GACnD;GACA,QAAQ,KAAK,OAAO;GACpB,IAAI,QAAQ,IAAI,OAAO,GAAG,MAAM,IAAI,oBAAoB,MAAM,CAAC,GAAG,SAAS,OAAO,CAAC;GACnF,QAAQ,IAAI,OAAO;EACrB;EACA,OAAO;CACT;CAEA,wBAAsE;EACpE,MAAM,0BAAU,IAAI,IAAS;EAC7B,KAAK,IAAI,UAAU,KAAK,QAAQ,YAAY,KAAA,GAAW,UAAU,mBAAmB,QAAQ,KAAKA,SAAS,GAAG;GAC3G,MAAM,WAAW,QAAQ,KAAKA;GAC9B,IAAI,YAAY,QAAQ,KAAK,CAAC,kBAAkB,QAAQ,GAAG,OAAO;GAClE,IAAI,QAAQ,IAAI,OAAO,GAAG,MAAM,IAAI,oBAAoB,MAAM,CAAC,GAAG,SAAS,OAAO,CAAC;GACnF,QAAQ,IAAI,OAAO;EACrB;CAEF;AACF;AAEA,IAAa,kCAAb,cACU,gCAEV;CACE;CACA;CACA;CACA,UAA+B,KAAA;CAC/B;CAEA,YAAY,QAAW,WAA6B,SAA2B,gBAAkC;EAC/G,MAAM,MAAM;EACZ,KAAKD,aAAa;EAClB,KAAKK,WAAW;EAChB,KAAKH,kBAAkB;CACzB;CAGA,MAAM,KAAK,OAAyD,CAAC,GAA0B;EAC7F,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,YAAY,KAAK,aAAa;GACtC,IAAI,KAAK,aACP,KAAKC,UAAU,KAAA;GAEjB,IAAI,CAAC,KAAK,OAAO,aACf,OAAO,KAAKC,iBAAiB,6BAA6B,KAAK,OAAO,IAAI,IAAI,CAAC,CAC5E,KAAK,KAAK,MAAM,CAAC,CACjB,MAAM,SAAS,KAAK,KAAK;IACxB,MAAM,YAAY,qBAAK,IAAI,MAAM,CAAC;GACpC,CAAC,CAAC,CACD,cAAc;IACb,KAAKA,eAAe,KAAA;GACtB,CAAC;GAEL,MAAM,WAAW,KAAK,wBAAwB;GAC9C,IAAI,SAAS,SAAS,GAIpB,MAAM,QAAQ,IAAI,SAAS,KAAK,MAAO,EAAE,OAAe,KAAK,UAAU,CAAC,KAAK,IAAI,CAAC,CAAC;GAErF,KAAKD,UAAU;EACjB;EACA,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,IAAI;CAC9C;CAEA,IAAI,WAAoB;EACtB,IAAI,KAAKA,YAAY,KAAA,GAAW,OAAO,KAAKA;EAC5C,KAAKA,UAAU,KAAK,wBAAwB,CAAC,CAAC,WAAW;EACzD,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,SAAS,IAAI;EAC5D,OAAO,KAAKA;CACd;CAEA,gBAAsB;EACpB,KAAKA,UAAU,KAAA;CACjB;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKH;CACd;CAEA,IAAI,eAAuB;EACzB,OAAO,KAAKK;CACd;CAEA,IAAI,iBAAyB;EAC3B,OAAO,KAAKH;CACd;CAEA,IAAI,aAAsB;EACxB,OAAO;CACT;CAEA,WAAmB;EACjB,OAAO,2CAA2C,KAAK,OAAO,eAAe,KAAK,UAAU;CAC9F;CAEA,QAAa;EACX,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,UACR,MAAM,IAAI,MAAM,KAAK,SAAS,IAAI,qCAAqC;EAEzE,MAAM,WAAgB,CAAC;EACvB,MAAM,0BAAU,IAAI,IAAS;EAE7B,MAAM,OAAuC,CAAC;GAAE,UAAU,KAAK,OAAO,KAAKG;GAAW,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAClH,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,UAAU,SAAS,KAAK,IAAI;GACpC,IAAI,QAAQ,IAAI,QAAQ,GAAG,MAAM,IAAI,oBAAoB,MAAM,IAAI;GACnE,QAAQ,IAAI,QAAQ;GACpB,KAAK,MAAM,SAAS,oBAAoB,QAAQ,GAAG;IACjD,SAAS,KAAK,KAAK;IACnB,KAAK,KAAK;KAAE,UAAU,MAAM,KAAKA;KAAW,MAAM,CAAC,GAAG,MAAM,KAAK;IAAE,CAAC;GACtE;EACF;EACA,OAAO;CACT;;CAGA,0BAAwD;EACtD,MAAM,0BAAU,IAAI,IAAS;EAC7B,MAAM,WAAiC,CAAC;EACxC,MAAM,OAAuC,CAAC;GAAE,UAAU,KAAK,OAAO,KAAKA;GAAW,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAClH,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,UAAU,SAAS,KAAK,IAAI;GACpC,IAAI,QAAQ,IAAI,QAAQ,GAAG,MAAM,IAAI,oBAAoB,MAAM,IAAI;GACnE,QAAQ,IAAI,QAAQ;GACpB,IAAI,aAAa,QAAQ,KAAK,CAAC,mBAAmB,QAAQ,GACxD,SAAS,KAAK,QAAQ;QACjB,IAAI,oBAAoB,QAAQ,KAAK,CAAC,0BAA0B,QAAQ,GAC7E,SAAS,KAAK,QAAQ;QAEtB,KAAK,MAAM,SAAS,oBAAoB,QAAQ,GAC9C,KAAK,KAAK;IAAE,UAAU,MAAM,KAAKA;IAAW,MAAM,CAAC,GAAG,MAAM,KAAK;GAAE,CAAC;EAG1E;EACA,OAAO;CACT;AACF;AAEA,IAAa,6BAAb,cACU,gCAEV;CACE;CACA;CACA;CACA,UAA+B,KAAA;CAC/B;CAEA,YAAY,QAAW,WAA6B,SAA2B,gBAAkC;EAC/G,MAAM,MAAM;EACZ,KAAKL,aAAa;EAClB,KAAKM,WAAW;EAChB,KAAKJ,kBAAkB;CACzB;CAGA,MAAM,KAAK,OAAyD,CAAC,GAA0B;EAC7F,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,YAAY,KAAK,aAAa;GACtC,IAAI,KAAK,aACP,KAAKC,UAAU,KAAA;GAEjB,IAAI,CAAC,KAAK,OAAO,aACf,OAAO,KAAKC,iBAAiB,wBAAwB,KAAK,OAAO,IAAI,IAAI,CAAC,CACvE,KAAK,KAAK,MAAM,CAAC,CACjB,MAAM,SAAS,KAAK,KAAU;IAC7B,MAAM,YAAY,qBAAK,IAAI,MAAM,CAAC;GACpC,CAAC,CAAC,CACD,cAAc;IACb,KAAKA,eAAe,KAAA;GACtB,CAAC;GAEL,MAAM,WAAW,KAAK,wBAAwB;GAC9C,IAAI,SAAS,SAAS,GAEpB,MAAM,QAAQ,IAAI,SAAS,KAAK,MAAO,EAAE,OAAe,KAAK,UAAU,CAAC,KAAK,IAAI,CAAC,CAAC;GAErF,KAAKD,UAAU;EACjB;EACA,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,IAAI;CAC9C;CAEA,IAAI,WAAoB;EACtB,IAAI,KAAKA,YAAY,KAAA,GAAW,OAAO,KAAKA;EAC5C,KAAKA,UAAU,KAAK,wBAAwB,CAAC,CAAC,WAAW;EACzD,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,SAAS,IAAI;EAC5D,OAAO,KAAKA;CACd;CAEA,gBAAsB;EACpB,KAAKA,UAAU,KAAA;CACjB;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKH;CACd;CAEA,IAAI,eAAuB;EACzB,OAAO,KAAKM;CACd;CAEA,IAAI,iBAAyB;EAC3B,OAAO,KAAKJ;CACd;CAEA,IAAI,WAA4B;EAC9B,OAAO,KAAK,KAAK,UAAU,KAAKI;CAClC;CAEA,IAAI,aAAsB;EACxB,OAAO;CACT;CAEA,WAAmB;EACjB,OAAO,sCAAsC,KAAK,OAAO,eAAe,KAAK,UAAU;CACzF;CAEA,QAAa;EACX,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,UACR,MAAM,IAAI,MAAM,KAAK,SAAS,IAAI,qCAAqC;EAEzE,MAAM,UAAe,CAAC;EAEtB,MAAM,0BAAU,IAAI,IAAS;EAC7B,QAAQ,IAAI,KAAK,MAAM;EACvB,MAAM,OAAqC,CAAC;GAAE,QAAQ,KAAK;GAAQ,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAC/F,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,QAAQ,SAAS,SAAS,KAAK,IAAI;GAC3C,KAAK,MAAM,SAAS,oBAAoB,QAAQ,KAAKA,SAAS,GAAG;IAC/D,IAAI,QAAQ,IAAI,KAAK,GAAG;KAEtB,IAAI,UAAU,KAAK,QAAQ,MAAM,IAAI,oBAAoB,MAAM,CAAC,GAAG,MAAM,KAAK,CAAC;KAE/E;IACF;IACA,QAAQ,IAAI,KAAK;IACjB,QAAQ,KAAK,KAAK;IAClB,KAAK,KAAK;KAAE,QAAQ;KAAO,MAAM,CAAC,GAAG,MAAM,KAAK;IAAE,CAAC;GACrD;EACF;EACA,OAAO;CACT;;CAGA,0BAAwD;EACtD,MAAM,0BAAU,IAAI,IAAS;EAC7B,QAAQ,IAAI,KAAK,MAAM;EACvB,MAAM,WAAiC,CAAC;EACxC,MAAM,OAAqC,CAAC;GAAE,QAAQ,KAAK;GAAQ,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAC/F,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,QAAQ,SAAS,SAAS,KAAK,IAAI;GAC3C,MAAM,WAAW,QAAQ,KAAKA;GAC9B,IAAI,aAAa,QAAQ,KAAK,CAAC,mBAAmB,QAAQ,GACxD,SAAS,KAAK,QAAQ;QAEtB,KAAK,MAAM,SAAS,oBAAoB,QAAQ,GAAG;IACjD,IAAI,QAAQ,IAAI,KAAK,GAAG;KACtB,IAAI,UAAU,KAAK,QAAQ,MAAM,IAAI,oBAAoB,MAAM,CAAC,GAAG,MAAM,KAAK,CAAC;KAC/E;IACF;IACA,QAAQ,IAAI,KAAK;IACjB,KAAK,KAAK;KAAE,QAAQ;KAAO,MAAM,CAAC,GAAG,MAAM,KAAK;IAAE,CAAC;GACrD;EAEJ;EACA,OAAO;CACT;AACF;AAEA,SAAS,mBAAmB,UAAoB;CAC9C,OAAO,kBAAkB,QAAQ,IAAI,SAAS,MAAM,KAAK,GAAG,SAAS,gBAAgB;AACvF;AAEA,SAAS,oBAAoB,UAAoB;CAC/C,OAAO,mBAAmB,QAAQ,IAC9B,SAAS,MACT,0BAA0B,QAAQ,IAChC,SAAS,MACP,CAAC,SAAS,GAAG,IACb,CAAC,IACH,KAAK,GAAG,SAAS,gBAAgB;AACzC"}
+{"version":3,"file":"RecursiveCollection.js","names":["#fieldName","#m2oName","#otherFieldName","#loaded","#loadPromise","#o2mName","#m2mName"],"sources":["../../src/relations/RecursiveCollection.ts"],"sourcesContent":["import { recursiveChildrenBatchLoader } from \"../batchloaders/recursiveChildrenBatchLoader.ts\";\nimport { recursiveM2mBatchLoader } from \"../batchloaders/recursiveM2mBatchLoader.ts\";\nimport { recursiveParentsBatchLoader } from \"../batchloaders/recursiveParentsBatchLoader.ts\";\nimport {\n  type Entity,\n  type EntityMetadata,\n  type ManyToManyField,\n  type Reference,\n  type Relation,\n  appendStack,\n  ensureNotDeleted,\n  fail,\n  getEmInternalApi,\n  getMetadata,\n  isCollection,\n  isLoadedCollection,\n  isLoadedOneToOneReference,\n  isLoadedReference,\n  isOneToOneReference,\n  isReference,\n} from \"../index.ts\";\nimport type { IsLoadedCachable } from \"../loading/IsLoadedCache.ts\";\nimport { lazyField } from \"../newEntity.ts\";\nimport { AbstractRelationImpl } from \"./AbstractRelationImpl.ts\";\nimport { type ReadOnlyCollection } from \"./ReadOnlyCollection.ts\";\nimport { RecursiveCycleError } from \"./RecursiveCycleError.ts\";\nimport { RelationT, RelationU } from \"./RelationSymbols.ts\";\n\nexport { RecursiveCycleError };\n\n/**\n * An alias for creating `RecursiveParentsCollectionImpl`s.\n *\n * I.e. for `Author.mentor` (m2o fk), we can return `Author.mentorsRecursive` recursively looking up.\n */\nexport function hasRecursiveParents<T extends Entity, U extends Entity>(\n  m2oName: keyof T & string, // i.e. `author.mentor`\n  otherFieldName: keyof T & string, // i.e. `author.menteesRecursive`\n): ReadOnlyCollection<T, U> {\n  return lazyField((entity: T, fieldName) => {\n    return new RecursiveParentsCollectionImpl(entity, fieldName as keyof T & string, m2oName, otherFieldName);\n  });\n}\n\n/**\n * An alias for creating `RecursiveChildrenCollectionImpl`s.\n *\n * I.e. for `Author.mentees` (o2m), we can return `Author.menteesRecursive` recursively looking down.\n */\nexport function hasRecursiveChildren<T extends Entity, U extends Entity>(\n  o2mName: keyof T & string, // i.e. `author.mentees`\n  otherFieldName: keyof T & string, // i.e. `author.mentorsRecursive`\n): ReadOnlyCollection<T, U> {\n  return lazyField((entity: T, fieldName) => {\n    return new RecursiveChildrenCollectionImpl(entity, fieldName as keyof T & string, o2mName, otherFieldName);\n  });\n}\n\n/**\n * An alias for creating `RecursiveM2mCollectionImpl`s.\n *\n * I.e. for `User.parents` (m2m), we can return `User.parentsRecursive` recursively looking up through the m2m.\n * Or for `User.children` (m2m), we can return `User.childrenRecursive` recursively looking down.\n */\nexport function hasRecursiveM2m<T extends Entity, U extends Entity>(\n  m2mName: keyof T & string, // i.e. `user.parents` or `user.children`\n  otherFieldName: keyof T & string, // i.e. `user.childrenRecursive` or `user.parentsRecursive`\n): ReadOnlyCollection<T, U> {\n  return lazyField((entity: T, fieldName) => {\n    return new RecursiveM2mCollectionImpl(entity, fieldName as keyof T & string, m2mName, otherFieldName);\n  });\n}\n\n/**\n * A base class for the common methods between the parent & children recursive collections.\n *\n * We could probably move some of this into AbstractRelationImpl?\n */\nabstract class AbstractRecursiveCollectionImpl<T extends Entity, U extends Entity> extends AbstractRelationImpl<\n  T,\n  U[]\n> {\n  abstract fieldName: string;\n\n  get get(): U[] {\n    return this.filterDeleted(this.doGet(), { withDeleted: false });\n  }\n\n  get getWithDeleted(): U[] {\n    return this.filterDeleted(this.doGet(), { withDeleted: true });\n  }\n\n  setFromOpts(): void {\n    throw new Error(\"Method not implemented.\");\n  }\n\n  set(): void {\n    throw new Error(\"Method not implemented.\");\n  }\n\n  get isPreloaded(): boolean {\n    return false;\n  }\n\n  preload(): void {\n    throw new Error(\"Method not implemented.\");\n  }\n\n  cleanupOnEntityDeleted(): Promise<void> {\n    return Promise.resolve();\n  }\n\n  maybeCascadeDelete(): void {}\n\n  get meta(): EntityMetadata {\n    return getMetadata(this.entity);\n  }\n\n  abstract doGet(): U[];\n\n  /** Removes pending-hard-delete or soft-deleted entities, unless explicitly asked for. */\n  protected filterDeleted(entities: U[], opts?: { withDeleted?: boolean }): U[] {\n    return opts?.withDeleted === true\n      ? [...entities]\n      : entities.filter((e) => !e.isDeletedEntity && !(e as any).isSoftDeletedEntity);\n  }\n\n  [RelationT]: T = null!;\n  [RelationU]: U = null!;\n}\n\nexport class RecursiveParentsCollectionImpl<T extends Entity, U extends Entity>\n  extends AbstractRecursiveCollectionImpl<T, U>\n  implements ReadOnlyCollection<T, U>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #m2oName: keyof T & string;\n  readonly #otherFieldName: keyof T & string;\n  #loaded: boolean | undefined = undefined;\n  #loadPromise: Promise<void> | undefined;\n\n  constructor(entity: T, fieldName: keyof T & string, m2oName: keyof T & string, otherFieldName: keyof T & string) {\n    super(entity);\n    this.#fieldName = fieldName;\n    this.#m2oName = m2oName;\n    this.#otherFieldName = otherFieldName;\n  }\n\n  // opts is an internal parameter\n  async load(opts: { withDeleted?: boolean; forceReload?: boolean } = {}): Promise<readonly U[]> {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded || opts.forceReload) {\n      if (opts.forceReload) {\n        this.#loaded = undefined;\n      }\n      // If we have `[grandchild, newlyCreatedParent, existingGrandparent, ...more...]`, skip up to the\n      // `existingGrandparent`, because if we `.load(entity)` (i.e. where we are the `grandchild`) then\n      // recursiveParentsBatchLoader will try CTE query up from `grandchild[parent]`, but since that will\n      // be `newlyCreatedParent`, it doesn't have an id yet.\n      const entityToLoad = opts.forceReload ? this.entity : this.findUnloadedReference()?.entity;\n      if (entityToLoad && !entityToLoad.isNewEntity) {\n        await (this.#loadPromise ??= recursiveParentsBatchLoader(this.entity.em, this)\n          .load(entityToLoad)\n          .catch(function load(err) {\n            throw appendStack(err, new Error());\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n        // See if there are any WIP changes, i.e. new parents, that the ^ SQL query didn't know to load.\n        // We don't have to `while` loop this, because if parent itself has WIP changes above it, then\n        // its own `RecursiveParentsCollectionImpl.load` will load it, before returning to this method.\n        const unloadedParent = this.findUnloadedReference();\n        if (unloadedParent) {\n          await recursiveParentsBatchLoader(this.entity.em, this)\n            .load(unloadedParent.entity)\n            .catch(function load(err) {\n              throw appendStack(err, new Error());\n            });\n        }\n      }\n      this.#loaded = true;\n    }\n    return this.filterDeleted(this.doGet(), opts);\n  }\n\n  get isLoaded(): boolean {\n    if (this.#loaded !== undefined) return this.#loaded;\n    this.#loaded = this.findUnloadedReference() === undefined;\n    getEmInternalApi(this.entity.em).isLoadedCache.addNaive(this);\n    return this.#loaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#loaded = undefined;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  get m2oFieldName(): string {\n    return this.#m2oName;\n  }\n\n  get otherFieldName(): string {\n    return this.#otherFieldName;\n  }\n\n  get hasBeenSet(): boolean {\n    return false;\n  }\n\n  toString(): string {\n    return `RecursiveParentsCollectionImpl(entity: ${this.entity}, fieldName: ${this.fieldName})`;\n  }\n\n  doGet(): U[] {\n    ensureNotDeleted(this.entity, \"pending\");\n    const unloaded = this.findUnloadedReference();\n    if (unloaded) {\n      throw new Error(this.toString() + `.get was called but ${unloaded} was not loaded`);\n    }\n    const parents: U[] = [];\n    const visited = new Set<U>();\n    for (\n      let current = getLoadedReference(this.entity[this.#m2oName]);\n      current !== undefined;\n      current = getLoadedReference(current[this.#m2oName])\n    ) {\n      parents.push(current);\n      if (visited.has(current)) throw new RecursiveCycleError(this, [...visited, current]);\n      visited.add(current);\n    }\n    return parents;\n  }\n\n  private findUnloadedReference(): Reference<any, any, any> | undefined {\n    const visited = new Set<any>();\n    for (let current = this.entity; current !== undefined; current = getLoadedReference(current[this.#m2oName])) {\n      const relation = current[this.#m2oName];\n      if (isReference(relation) && !isLoadedReference(relation)) return relation;\n      if (visited.has(current)) throw new RecursiveCycleError(this, [...visited, current]);\n      visited.add(current);\n    }\n    return undefined;\n  }\n}\n\nexport class RecursiveChildrenCollectionImpl<T extends Entity, U extends Entity>\n  extends AbstractRecursiveCollectionImpl<T, U>\n  implements ReadOnlyCollection<T, U>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #o2mName: keyof T & string;\n  readonly #otherFieldName: keyof T & string;\n  #loaded: boolean | undefined = undefined;\n  #loadPromise: Promise<void> | undefined;\n\n  constructor(entity: T, fieldName: keyof T & string, o2mName: keyof T & string, otherFieldName: keyof T & string) {\n    super(entity);\n    this.#fieldName = fieldName;\n    this.#o2mName = o2mName;\n    this.#otherFieldName = otherFieldName;\n  }\n\n  // opts is an internal parameter\n  async load(opts: { withDeleted?: boolean; forceReload?: boolean } = {}): Promise<readonly U[]> {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded || opts.forceReload) {\n      if (opts.forceReload) {\n        this.#loaded = undefined;\n      }\n      if (!this.entity.isNewEntity) {\n        await (this.#loadPromise ??= recursiveChildrenBatchLoader(this.entity.em, this)\n          .load(this.entity)\n          .catch(function load(err) {\n            throw appendStack(err, new Error());\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n      }\n      const unloaded = this.findUnloadedCollections();\n      if (unloaded.length > 0) {\n        // Go through the entities own `fooRecursive` collection so that it's marked as loaded.\n        // We don't have to `while` loop this, because if they children themselves have any WIP\n        // changes, then their own `RecursiveChildrenCollectionImpl.load` will load them.\n        await Promise.all(unloaded.map((r) => (r.entity as any)[this.fieldName].load(opts)));\n      }\n      this.#loaded = true;\n    }\n    return this.filterDeleted(this.doGet(), opts);\n  }\n\n  get isLoaded(): boolean {\n    if (this.#loaded !== undefined) return this.#loaded;\n    this.#loaded = this.findUnloadedCollections().length === 0;\n    getEmInternalApi(this.entity.em).isLoadedCache.addNaive(this);\n    return this.#loaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#loaded = undefined;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  get o2mFieldName(): string {\n    return this.#o2mName;\n  }\n\n  get otherFieldName(): string {\n    return this.#otherFieldName;\n  }\n\n  get hasBeenSet(): boolean {\n    return false;\n  }\n\n  toString(): string {\n    return `RecursiveChildrenCollectionImpl(entity: ${this.entity}, fieldName: ${this.fieldName})`;\n  }\n\n  doGet(): U[] {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded) {\n      throw new Error(this.toString() + `.get was called but when not loaded`);\n    }\n    const children: U[] = [];\n    const visited = new Set<any>();\n    // Use a node+path combo to know which path caused the cycle\n    const todo: { relation: any; path: U[] }[] = [{ relation: this.entity[this.#o2mName], path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { relation, path } = todo.pop()!;\n      if (visited.has(relation)) throw new RecursiveCycleError(this, path);\n      visited.add(relation);\n      for (const child of getLoadedCollection(relation)) {\n        children.push(child);\n        todo.push({ relation: child[this.#o2mName], path: [...path, child] });\n      }\n    }\n    return children;\n  }\n\n  /** Finds any children/downstream o2m collections or o2o references. */\n  private findUnloadedCollections(): Relation<any, any>[] {\n    const visited = new Set<any>();\n    const unloaded: Relation<any, any>[] = [];\n    const todo: { relation: any; path: U[] }[] = [{ relation: this.entity[this.#o2mName], path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { relation, path } = todo.pop()!;\n      if (visited.has(relation)) throw new RecursiveCycleError(this, path);\n      visited.add(relation);\n      if (isCollection(relation) && !isLoadedCollection(relation)) {\n        unloaded.push(relation);\n      } else if (isOneToOneReference(relation) && !isLoadedOneToOneReference(relation)) {\n        unloaded.push(relation);\n      } else {\n        for (const child of getLoadedCollection(relation)) {\n          todo.push({ relation: child[this.#o2mName], path: [...path, child] });\n        }\n      }\n    }\n    return unloaded;\n  }\n}\n\nexport class RecursiveM2mCollectionImpl<T extends Entity, U extends Entity>\n  extends AbstractRecursiveCollectionImpl<T, U>\n  implements ReadOnlyCollection<T, U>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #m2mName: keyof T & string;\n  readonly #otherFieldName: keyof T & string;\n  #loaded: boolean | undefined = undefined;\n  #loadPromise: Promise<void> | undefined;\n\n  constructor(entity: T, fieldName: keyof T & string, m2mName: keyof T & string, otherFieldName: keyof T & string) {\n    super(entity);\n    this.#fieldName = fieldName;\n    this.#m2mName = m2mName;\n    this.#otherFieldName = otherFieldName;\n  }\n\n  // opts is an internal parameter\n  async load(opts: { withDeleted?: boolean; forceReload?: boolean } = {}): Promise<readonly U[]> {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded || opts.forceReload) {\n      if (opts.forceReload) {\n        this.#loaded = undefined;\n      }\n      if (!this.entity.isNewEntity) {\n        await (this.#loadPromise ??= recursiveM2mBatchLoader(this.entity.em, this)\n          .load(this.entity)\n          .catch(function load(err: any) {\n            throw appendStack(err, new Error());\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n      }\n      const unloaded = this.findUnloadedCollections();\n      if (unloaded.length > 0) {\n        // Go through the entity's own `fooRecursive` collection so that it's marked as loaded.\n        await Promise.all(unloaded.map((r) => (r.entity as any)[this.fieldName].load(opts)));\n      }\n      this.#loaded = true;\n    }\n    return this.filterDeleted(this.doGet(), opts);\n  }\n\n  get isLoaded(): boolean {\n    if (this.#loaded !== undefined) return this.#loaded;\n    this.#loaded = this.findUnloadedCollections().length === 0;\n    getEmInternalApi(this.entity.em).isLoadedCache.addNaive(this);\n    return this.#loaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#loaded = undefined;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  get m2mFieldName(): string {\n    return this.#m2mName;\n  }\n\n  get otherFieldName(): string {\n    return this.#otherFieldName;\n  }\n\n  get m2mField(): ManyToManyField {\n    return this.meta.allFields[this.#m2mName] as ManyToManyField;\n  }\n\n  get hasBeenSet(): boolean {\n    return false;\n  }\n\n  toString(): string {\n    return `RecursiveM2mCollectionImpl(entity: ${this.entity}, fieldName: ${this.fieldName})`;\n  }\n\n  doGet(): U[] {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (!this.isLoaded) {\n      throw new Error(this.toString() + `.get was called but when not loaded`);\n    }\n    const results: U[] = [];\n    // Track by entity to handle diamonds (same entity reachable via multiple paths)\n    const visited = new Set<any>();\n    visited.add(this.entity);\n    const todo: { entity: any; path: U[] }[] = [{ entity: this.entity, path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { entity: current, path } = todo.pop()!;\n      for (const other of getLoadedCollection(current[this.#m2mName])) {\n        if (visited.has(other)) {\n          // If we're reaching an entity we've already visited, and it's this.entity, that's a cycle\n          if (other === this.entity) throw new RecursiveCycleError(this, [...path, other]);\n          // Otherwise it's a diamond (reachable via multiple paths) — skip\n          continue;\n        }\n        visited.add(other);\n        results.push(other);\n        todo.push({ entity: other, path: [...path, other] });\n      }\n    }\n    return results;\n  }\n\n  /** Finds any m2m collections that are not yet loaded in the recursive tree. */\n  private findUnloadedCollections(): Relation<any, any>[] {\n    const visited = new Set<any>();\n    visited.add(this.entity);\n    const unloaded: Relation<any, any>[] = [];\n    const todo: { entity: any; path: U[] }[] = [{ entity: this.entity, path: [this.entity as any] }];\n    while (todo.length > 0) {\n      const { entity: current, path } = todo.pop()!;\n      const relation = current[this.#m2mName];\n      if (isCollection(relation) && !isLoadedCollection(relation)) {\n        unloaded.push(relation);\n      } else {\n        for (const other of getLoadedCollection(relation)) {\n          if (visited.has(other)) {\n            if (other === this.entity) throw new RecursiveCycleError(this, [...path, other]);\n            continue;\n          }\n          visited.add(other);\n          todo.push({ entity: other, path: [...path, other] });\n        }\n      }\n    }\n    return unloaded;\n  }\n}\n\nfunction getLoadedReference(relation: any): any {\n  return isLoadedReference(relation) ? relation.get : fail(`${relation} was not loaded`);\n}\n\nfunction getLoadedCollection(relation: any): any {\n  return isLoadedCollection(relation)\n    ? relation.get\n    : isLoadedOneToOneReference(relation)\n      ? relation.get\n        ? [relation.get]\n        : []\n      : fail(`${relation} was not loaded`);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAmCA,SAAgB,oBACd,SACA,gBAC0B;CAC1B,OAAO,WAAW,QAAW,cAAc;EACzC,OAAO,IAAI,+BAA+B,QAAQ,WAA+B,SAAS,cAAc;CAC1G,CAAC;AACH;;;;;;AAOA,SAAgB,qBACd,SACA,gBAC0B;CAC1B,OAAO,WAAW,QAAW,cAAc;EACzC,OAAO,IAAI,gCAAgC,QAAQ,WAA+B,SAAS,cAAc;CAC3G,CAAC;AACH;;;;;;;AAQA,SAAgB,gBACd,SACA,gBAC0B;CAC1B,OAAO,WAAW,QAAW,cAAc;EACzC,OAAO,IAAI,2BAA2B,QAAQ,WAA+B,SAAS,cAAc;CACtG,CAAC;AACH;;;;;;AAOA,IAAe,kCAAf,cAA2F,qBAGzF;CAGA,IAAI,MAAW;EACb,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,EAAE,aAAa,MAAM,CAAC;CAChE;CAEA,IAAI,iBAAsB;EACxB,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,EAAE,aAAa,KAAK,CAAC;CAC/D;CAEA,cAAoB;EAClB,MAAM,IAAI,MAAM,yBAAyB;CAC3C;CAEA,MAAY;EACV,MAAM,IAAI,MAAM,yBAAyB;CAC3C;CAEA,IAAI,cAAuB;EACzB,OAAO;CACT;CAEA,UAAgB;EACd,MAAM,IAAI,MAAM,yBAAyB;CAC3C;CAEA,yBAAwC;EACtC,OAAO,QAAQ,QAAQ;CACzB;CAEA,qBAA2B,CAAC;CAE5B,IAAI,OAAuB;EACzB,OAAO,YAAY,KAAK,MAAM;CAChC;;CAKA,cAAwB,UAAe,MAAuC;EAC5E,OAAO,MAAM,gBAAgB,OACzB,CAAC,GAAG,QAAQ,IACZ,SAAS,QAAQ,MAAM,CAAC,EAAE,mBAAmB,CAAE,EAAU,mBAAmB;CAClF;CAEA,CAAC,aAAgB;CACjB,CAAC,aAAgB;AACnB;AAEA,IAAa,iCAAb,cACU,gCAEV;CACE;CACA;CACA;CACA,UAA+B,KAAA;CAC/B;CAEA,YAAY,QAAW,WAA6B,SAA2B,gBAAkC;EAC/G,MAAM,MAAM;EACZ,KAAKA,aAAa;EAClB,KAAKC,WAAW;EAChB,KAAKC,kBAAkB;CACzB;CAGA,MAAM,KAAK,OAAyD,CAAC,GAA0B;EAC7F,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,YAAY,KAAK,aAAa;GACtC,IAAI,KAAK,aACP,KAAKC,UAAU,KAAA;GAMjB,MAAM,eAAe,KAAK,cAAc,KAAK,SAAS,KAAK,sBAAsB,CAAC,EAAE;GACpF,IAAI,gBAAgB,CAAC,aAAa,aAAa;IAC7C,OAAO,KAAKC,iBAAiB,4BAA4B,KAAK,OAAO,IAAI,IAAI,CAAC,CAC3E,KAAK,YAAY,CAAC,CAClB,MAAM,SAAS,KAAK,KAAK;KACxB,MAAM,YAAY,qBAAK,IAAI,MAAM,CAAC;IACpC,CAAC,CAAC,CACD,cAAc;KACb,KAAKA,eAAe,KAAA;IACtB,CAAC;IAIH,MAAM,iBAAiB,KAAK,sBAAsB;IAClD,IAAI,gBACF,MAAM,4BAA4B,KAAK,OAAO,IAAI,IAAI,CAAC,CACpD,KAAK,eAAe,MAAM,CAAC,CAC3B,MAAM,SAAS,KAAK,KAAK;KACxB,MAAM,YAAY,qBAAK,IAAI,MAAM,CAAC;IACpC,CAAC;GAEP;GACA,KAAKD,UAAU;EACjB;EACA,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,IAAI;CAC9C;CAEA,IAAI,WAAoB;EACtB,IAAI,KAAKA,YAAY,KAAA,GAAW,OAAO,KAAKA;EAC5C,KAAKA,UAAU,KAAK,sBAAsB,MAAM,KAAA;EAChD,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,SAAS,IAAI;EAC5D,OAAO,KAAKA;CACd;CAEA,gBAAsB;EACpB,KAAKA,UAAU,KAAA;CACjB;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKH;CACd;CAEA,IAAI,eAAuB;EACzB,OAAO,KAAKC;CACd;CAEA,IAAI,iBAAyB;EAC3B,OAAO,KAAKC;CACd;CAEA,IAAI,aAAsB;EACxB,OAAO;CACT;CAEA,WAAmB;EACjB,OAAO,0CAA0C,KAAK,OAAO,eAAe,KAAK,UAAU;CAC7F;CAEA,QAAa;EACX,iBAAiB,KAAK,QAAQ,SAAS;EACvC,MAAM,WAAW,KAAK,sBAAsB;EAC5C,IAAI,UACF,MAAM,IAAI,MAAM,KAAK,SAAS,IAAI,uBAAuB,SAAS,gBAAgB;EAEpF,MAAM,UAAe,CAAC;EACtB,MAAM,0BAAU,IAAI,IAAO;EAC3B,KACE,IAAI,UAAU,mBAAmB,KAAK,OAAO,KAAKD,SAAS,GAC3D,YAAY,KAAA,GACZ,UAAU,mBAAmB,QAAQ,KAAKA,SAAS,GACnD;GACA,QAAQ,KAAK,OAAO;GACpB,IAAI,QAAQ,IAAI,OAAO,GAAG,MAAM,IAAI,oBAAoB,MAAM,CAAC,GAAG,SAAS,OAAO,CAAC;GACnF,QAAQ,IAAI,OAAO;EACrB;EACA,OAAO;CACT;CAEA,wBAAsE;EACpE,MAAM,0BAAU,IAAI,IAAS;EAC7B,KAAK,IAAI,UAAU,KAAK,QAAQ,YAAY,KAAA,GAAW,UAAU,mBAAmB,QAAQ,KAAKA,SAAS,GAAG;GAC3G,MAAM,WAAW,QAAQ,KAAKA;GAC9B,IAAI,YAAY,QAAQ,KAAK,CAAC,kBAAkB,QAAQ,GAAG,OAAO;GAClE,IAAI,QAAQ,IAAI,OAAO,GAAG,MAAM,IAAI,oBAAoB,MAAM,CAAC,GAAG,SAAS,OAAO,CAAC;GACnF,QAAQ,IAAI,OAAO;EACrB;CAEF;AACF;AAEA,IAAa,kCAAb,cACU,gCAEV;CACE;CACA;CACA;CACA,UAA+B,KAAA;CAC/B;CAEA,YAAY,QAAW,WAA6B,SAA2B,gBAAkC;EAC/G,MAAM,MAAM;EACZ,KAAKD,aAAa;EAClB,KAAKK,WAAW;EAChB,KAAKH,kBAAkB;CACzB;CAGA,MAAM,KAAK,OAAyD,CAAC,GAA0B;EAC7F,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,YAAY,KAAK,aAAa;GACtC,IAAI,KAAK,aACP,KAAKC,UAAU,KAAA;GAEjB,IAAI,CAAC,KAAK,OAAO,aACf,OAAO,KAAKC,iBAAiB,6BAA6B,KAAK,OAAO,IAAI,IAAI,CAAC,CAC5E,KAAK,KAAK,MAAM,CAAC,CACjB,MAAM,SAAS,KAAK,KAAK;IACxB,MAAM,YAAY,qBAAK,IAAI,MAAM,CAAC;GACpC,CAAC,CAAC,CACD,cAAc;IACb,KAAKA,eAAe,KAAA;GACtB,CAAC;GAEL,MAAM,WAAW,KAAK,wBAAwB;GAC9C,IAAI,SAAS,SAAS,GAIpB,MAAM,QAAQ,IAAI,SAAS,KAAK,MAAO,EAAE,OAAe,KAAK,UAAU,CAAC,KAAK,IAAI,CAAC,CAAC;GAErF,KAAKD,UAAU;EACjB;EACA,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,IAAI;CAC9C;CAEA,IAAI,WAAoB;EACtB,IAAI,KAAKA,YAAY,KAAA,GAAW,OAAO,KAAKA;EAC5C,KAAKA,UAAU,KAAK,wBAAwB,CAAC,CAAC,WAAW;EACzD,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,SAAS,IAAI;EAC5D,OAAO,KAAKA;CACd;CAEA,gBAAsB;EACpB,KAAKA,UAAU,KAAA;CACjB;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKH;CACd;CAEA,IAAI,eAAuB;EACzB,OAAO,KAAKK;CACd;CAEA,IAAI,iBAAyB;EAC3B,OAAO,KAAKH;CACd;CAEA,IAAI,aAAsB;EACxB,OAAO;CACT;CAEA,WAAmB;EACjB,OAAO,2CAA2C,KAAK,OAAO,eAAe,KAAK,UAAU;CAC9F;CAEA,QAAa;EACX,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,UACR,MAAM,IAAI,MAAM,KAAK,SAAS,IAAI,qCAAqC;EAEzE,MAAM,WAAgB,CAAC;EACvB,MAAM,0BAAU,IAAI,IAAS;EAE7B,MAAM,OAAuC,CAAC;GAAE,UAAU,KAAK,OAAO,KAAKG;GAAW,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAClH,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,UAAU,SAAS,KAAK,IAAI;GACpC,IAAI,QAAQ,IAAI,QAAQ,GAAG,MAAM,IAAI,oBAAoB,MAAM,IAAI;GACnE,QAAQ,IAAI,QAAQ;GACpB,KAAK,MAAM,SAAS,oBAAoB,QAAQ,GAAG;IACjD,SAAS,KAAK,KAAK;IACnB,KAAK,KAAK;KAAE,UAAU,MAAM,KAAKA;KAAW,MAAM,CAAC,GAAG,MAAM,KAAK;IAAE,CAAC;GACtE;EACF;EACA,OAAO;CACT;;CAGA,0BAAwD;EACtD,MAAM,0BAAU,IAAI,IAAS;EAC7B,MAAM,WAAiC,CAAC;EACxC,MAAM,OAAuC,CAAC;GAAE,UAAU,KAAK,OAAO,KAAKA;GAAW,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAClH,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,UAAU,SAAS,KAAK,IAAI;GACpC,IAAI,QAAQ,IAAI,QAAQ,GAAG,MAAM,IAAI,oBAAoB,MAAM,IAAI;GACnE,QAAQ,IAAI,QAAQ;GACpB,IAAI,aAAa,QAAQ,KAAK,CAAC,mBAAmB,QAAQ,GACxD,SAAS,KAAK,QAAQ;QACjB,IAAI,oBAAoB,QAAQ,KAAK,CAAC,0BAA0B,QAAQ,GAC7E,SAAS,KAAK,QAAQ;QAEtB,KAAK,MAAM,SAAS,oBAAoB,QAAQ,GAC9C,KAAK,KAAK;IAAE,UAAU,MAAM,KAAKA;IAAW,MAAM,CAAC,GAAG,MAAM,KAAK;GAAE,CAAC;EAG1E;EACA,OAAO;CACT;AACF;AAEA,IAAa,6BAAb,cACU,gCAEV;CACE;CACA;CACA;CACA,UAA+B,KAAA;CAC/B;CAEA,YAAY,QAAW,WAA6B,SAA2B,gBAAkC;EAC/G,MAAM,MAAM;EACZ,KAAKL,aAAa;EAClB,KAAKM,WAAW;EAChB,KAAKJ,kBAAkB;CACzB;CAGA,MAAM,KAAK,OAAyD,CAAC,GAA0B;EAC7F,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,YAAY,KAAK,aAAa;GACtC,IAAI,KAAK,aACP,KAAKC,UAAU,KAAA;GAEjB,IAAI,CAAC,KAAK,OAAO,aACf,OAAO,KAAKC,iBAAiB,wBAAwB,KAAK,OAAO,IAAI,IAAI,CAAC,CACvE,KAAK,KAAK,MAAM,CAAC,CACjB,MAAM,SAAS,KAAK,KAAU;IAC7B,MAAM,YAAY,qBAAK,IAAI,MAAM,CAAC;GACpC,CAAC,CAAC,CACD,cAAc;IACb,KAAKA,eAAe,KAAA;GACtB,CAAC;GAEL,MAAM,WAAW,KAAK,wBAAwB;GAC9C,IAAI,SAAS,SAAS,GAEpB,MAAM,QAAQ,IAAI,SAAS,KAAK,MAAO,EAAE,OAAe,KAAK,UAAU,CAAC,KAAK,IAAI,CAAC,CAAC;GAErF,KAAKD,UAAU;EACjB;EACA,OAAO,KAAK,cAAc,KAAK,MAAM,GAAG,IAAI;CAC9C;CAEA,IAAI,WAAoB;EACtB,IAAI,KAAKA,YAAY,KAAA,GAAW,OAAO,KAAKA;EAC5C,KAAKA,UAAU,KAAK,wBAAwB,CAAC,CAAC,WAAW;EACzD,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,SAAS,IAAI;EAC5D,OAAO,KAAKA;CACd;CAEA,gBAAsB;EACpB,KAAKA,UAAU,KAAA;CACjB;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKH;CACd;CAEA,IAAI,eAAuB;EACzB,OAAO,KAAKM;CACd;CAEA,IAAI,iBAAyB;EAC3B,OAAO,KAAKJ;CACd;CAEA,IAAI,WAA4B;EAC9B,OAAO,KAAK,KAAK,UAAU,KAAKI;CAClC;CAEA,IAAI,aAAsB;EACxB,OAAO;CACT;CAEA,WAAmB;EACjB,OAAO,sCAAsC,KAAK,OAAO,eAAe,KAAK,UAAU;CACzF;CAEA,QAAa;EACX,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,CAAC,KAAK,UACR,MAAM,IAAI,MAAM,KAAK,SAAS,IAAI,qCAAqC;EAEzE,MAAM,UAAe,CAAC;EAEtB,MAAM,0BAAU,IAAI,IAAS;EAC7B,QAAQ,IAAI,KAAK,MAAM;EACvB,MAAM,OAAqC,CAAC;GAAE,QAAQ,KAAK;GAAQ,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAC/F,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,QAAQ,SAAS,SAAS,KAAK,IAAI;GAC3C,KAAK,MAAM,SAAS,oBAAoB,QAAQ,KAAKA,SAAS,GAAG;IAC/D,IAAI,QAAQ,IAAI,KAAK,GAAG;KAEtB,IAAI,UAAU,KAAK,QAAQ,MAAM,IAAI,oBAAoB,MAAM,CAAC,GAAG,MAAM,KAAK,CAAC;KAE/E;IACF;IACA,QAAQ,IAAI,KAAK;IACjB,QAAQ,KAAK,KAAK;IAClB,KAAK,KAAK;KAAE,QAAQ;KAAO,MAAM,CAAC,GAAG,MAAM,KAAK;IAAE,CAAC;GACrD;EACF;EACA,OAAO;CACT;;CAGA,0BAAwD;EACtD,MAAM,0BAAU,IAAI,IAAS;EAC7B,QAAQ,IAAI,KAAK,MAAM;EACvB,MAAM,WAAiC,CAAC;EACxC,MAAM,OAAqC,CAAC;GAAE,QAAQ,KAAK;GAAQ,MAAM,CAAC,KAAK,MAAa;EAAE,CAAC;EAC/F,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,EAAE,QAAQ,SAAS,SAAS,KAAK,IAAI;GAC3C,MAAM,WAAW,QAAQ,KAAKA;GAC9B,IAAI,aAAa,QAAQ,KAAK,CAAC,mBAAmB,QAAQ,GACxD,SAAS,KAAK,QAAQ;QAEtB,KAAK,MAAM,SAAS,oBAAoB,QAAQ,GAAG;IACjD,IAAI,QAAQ,IAAI,KAAK,GAAG;KACtB,IAAI,UAAU,KAAK,QAAQ,MAAM,IAAI,oBAAoB,MAAM,CAAC,GAAG,MAAM,KAAK,CAAC;KAC/E;IACF;IACA,QAAQ,IAAI,KAAK;IACjB,KAAK,KAAK;KAAE,QAAQ;KAAO,MAAM,CAAC,GAAG,MAAM,KAAK;IAAE,CAAC;GACrD;EAEJ;EACA,OAAO;CACT;AACF;AAEA,SAAS,mBAAmB,UAAoB;CAC9C,OAAO,kBAAkB,QAAQ,IAAI,SAAS,MAAM,KAAK,GAAG,SAAS,gBAAgB;AACvF;AAEA,SAAS,oBAAoB,UAAoB;CAC/C,OAAO,mBAAmB,QAAQ,IAC9B,SAAS,MACT,0BAA0B,QAAQ,IAChC,SAAS,MACP,CAAC,SAAS,GAAG,IACb,CAAC,IACH,KAAK,GAAG,SAAS,gBAAgB;AACzC"}

package/build/relations/Reference.cjs

@@ -1,9 +1,9 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const require_relations_ReferenceSymbols = require("./ReferenceSymbols.cjs");
+const require_relations_CustomReference = require("./CustomReference.cjs");
 const require_relations_ManyToOneReference = require("./ManyToOneReference.cjs");
 const require_relations_ReactiveReference = require("./ReactiveReference.cjs");
 const require_relations_OneToOneReference = require("./OneToOneReference.cjs");
-const require_relations_CustomReference = require("./CustomReference.cjs");
 const require_relations_PolymorphicReference = require("./PolymorphicReference.cjs");
 require("./index.cjs");
 require("../EntityManager.cjs");

package/build/relations/Reference.js

@@ -1,8 +1,8 @@
 import { ReferenceN } from "./ReferenceSymbols.js";
+import { CustomReference } from "./CustomReference.js";
 import { ManyToOneReferenceImpl } from "./ManyToOneReference.js";
 import { ReactiveReferenceImpl } from "./ReactiveReference.js";
 import { OneToOneReferenceImpl } from "./OneToOneReference.js";
-import { CustomReference } from "./CustomReference.js";
 import { PolymorphicReferenceImpl } from "./PolymorphicReference.js";
 import "./index.js";
 import "../EntityManager.js";

package/build/relations/hasAsyncMethod.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_loadHints = require("../loadHints.cjs");
+const require_loading_loadHints = require("../loading/loadHints.cjs");
 const require_newEntity = require("../newEntity.cjs");
 require("../Entity.cjs");
 //#region src/relations/hasAsyncMethod.ts
@@ -35,7 +35,7 @@ var AsyncMethodImpl = class {
 		return this.fn(this.#entity, ...args);
 	}
 	get isLoaded() {
-		return this.loaded || require_loadHints.isLoaded(this.#entity, this.#hint);
+		return this.loaded || require_loading_loadHints.isLoaded(this.#entity, this.#hint);
 	}
 	[AsyncMethodM];
 };

package/build/relations/hasAsyncMethod.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"hasAsyncMethod.cjs","names":["lazyField","#entity","#hint","isLoaded"],"sources":["../../src/relations/hasAsyncMethod.ts"],"sourcesContent":["import { type Entity } from \"../Entity.ts\";\nimport { type LoadHint, type Loaded, isLoaded } from \"../loadHints.ts\";\nimport { lazyField } from \"../newEntity.ts\";\n\nconst AsyncMethodM = Symbol();\nexport const AsyncMethodPopulateSecret = Symbol();\n\nexport interface AsyncMethod<T extends Entity, A extends unknown[], V> {\n  // To differentiate from AsyncProperties\n  [AsyncMethodM]: undefined;\n  isLoaded: boolean;\n  load(...args: A): Promise<V>;\n}\n\nexport interface LoadedMethod<T extends Entity, A extends unknown[], V> {\n  call(...args: A): V;\n}\n\nexport function hasAsyncMethod<T extends Entity, const H extends LoadHint<T>, A extends unknown[], V>(\n  loadHint: H,\n  fn: (entity: Loaded<T, H>, ...args: A) => V,\n): AsyncMethod<T, A, V> {\n  return lazyField((entity: T) => {\n    return new AsyncMethodImpl(entity, loadHint, fn);\n  });\n}\n\nexport class AsyncMethodImpl<T extends Entity, H extends LoadHint<T>, A extends unknown[], V> implements AsyncMethod<\n  T,\n  A,\n  V\n> {\n  private loaded = false;\n  private loadPromise: Promise<any> | undefined;\n\n  readonly #entity: T;\n  readonly #hint: H;\n  constructor(\n    entity: T,\n    hint: H,\n    private fn: (entity: Loaded<T, H>, ...args: A) => V,\n  ) {\n    this.#entity = entity;\n    this.#hint = hint;\n  }\n\n  /** Args might be either the user-provided args, or the populate `opts` if we're being preloaded. */\n  async load(...args: A): Promise<V> {\n    // Are we being called by `em.populate`? If so, we don't have the real args, so avoid invoking fn\n    const isPopulate = args && typeof args[0] === \"object\" && AsyncMethodPopulateSecret in (args as any)[0];\n    if (!this.loaded) {\n      this.loadPromise ??= this.#entity.em.populate(this.#entity, this.#hint!).then((loaded) => (this.loaded = true));\n      await this.loadPromise;\n    }\n    return isPopulate ? (undefined as any) : this.call(...args);\n  }\n\n  call(...args: A): V {\n    if (!this.isLoaded) {\n      throw new Error(\"hasAsyncMethod.call was called but not loaded\");\n    }\n    return this.fn(this.#entity as Loaded<T, H>, ...args);\n  }\n\n  get isLoaded() {\n    return this.loaded || isLoaded(this.#entity, this.#hint);\n  }\n\n  [AsyncMethodM]: undefined;\n}\n"],"mappings":";;;;;AAIA,MAAM,eAAe,OAAO;AAC5B,MAAa,4BAA4B,OAAO;AAahD,SAAgB,eACd,UACA,IACsB;CACtB,OAAOA,kBAAAA,WAAW,WAAc;EAC9B,OAAO,IAAI,gBAAgB,QAAQ,UAAU,EAAE;CACjD,CAAC;AACH;AAEA,IAAa,kBAAb,MAIE;CASU;CARV,SAAiB;CACjB;CAEA;CACA;CACA,YACE,QACA,MACA,IACA;EADQ,KAAA,KAAA;EAER,KAAKC,UAAU;EACf,KAAKC,QAAQ;CACf;;CAGA,MAAM,KAAK,GAAG,MAAqB;EAEjC,MAAM,aAAa,QAAQ,OAAO,KAAK,OAAO,YAAY,6BAA8B,KAAa;EACrG,IAAI,CAAC,KAAK,QAAQ;GAChB,KAAK,gBAAgB,KAAKD,QAAQ,GAAG,SAAS,KAAKA,SAAS,KAAKC,KAAM,CAAC,CAAC,MAAM,WAAY,KAAK,SAAS,IAAK;GAC9G,MAAM,KAAK;EACb;EACA,OAAO,aAAc,KAAA,IAAoB,KAAK,KAAK,GAAG,IAAI;CAC5D;CAEA,KAAK,GAAG,MAAY;EAClB,IAAI,CAAC,KAAK,UACR,MAAM,IAAI,MAAM,+CAA+C;EAEjE,OAAO,KAAK,GAAG,KAAKD,SAAyB,GAAG,IAAI;CACtD;CAEA,IAAI,WAAW;EACb,OAAO,KAAK,UAAUE,kBAAAA,SAAS,KAAKF,SAAS,KAAKC,KAAK;CACzD;CAEA,CAAC;AACH"}
+{"version":3,"file":"hasAsyncMethod.cjs","names":["lazyField","#entity","#hint","isLoaded"],"sources":["../../src/relations/hasAsyncMethod.ts"],"sourcesContent":["import { type Entity } from \"../Entity.ts\";\nimport { type LoadHint, type Loaded, isLoaded } from \"../loading/loadHints.ts\";\nimport { lazyField } from \"../newEntity.ts\";\n\nconst AsyncMethodM = Symbol();\nexport const AsyncMethodPopulateSecret = Symbol();\n\nexport interface AsyncMethod<T extends Entity, A extends unknown[], V> {\n  // To differentiate from AsyncProperties\n  [AsyncMethodM]: undefined;\n  isLoaded: boolean;\n  load(...args: A): Promise<V>;\n}\n\nexport interface LoadedMethod<T extends Entity, A extends unknown[], V> {\n  call(...args: A): V;\n}\n\nexport function hasAsyncMethod<T extends Entity, const H extends LoadHint<T>, A extends unknown[], V>(\n  loadHint: H,\n  fn: (entity: Loaded<T, H>, ...args: A) => V,\n): AsyncMethod<T, A, V> {\n  return lazyField((entity: T) => {\n    return new AsyncMethodImpl(entity, loadHint, fn);\n  });\n}\n\nexport class AsyncMethodImpl<T extends Entity, H extends LoadHint<T>, A extends unknown[], V> implements AsyncMethod<\n  T,\n  A,\n  V\n> {\n  private loaded = false;\n  private loadPromise: Promise<any> | undefined;\n\n  readonly #entity: T;\n  readonly #hint: H;\n  constructor(\n    entity: T,\n    hint: H,\n    private fn: (entity: Loaded<T, H>, ...args: A) => V,\n  ) {\n    this.#entity = entity;\n    this.#hint = hint;\n  }\n\n  /** Args might be either the user-provided args, or the populate `opts` if we're being preloaded. */\n  async load(...args: A): Promise<V> {\n    // Are we being called by `em.populate`? If so, we don't have the real args, so avoid invoking fn\n    const isPopulate = args && typeof args[0] === \"object\" && AsyncMethodPopulateSecret in (args as any)[0];\n    if (!this.loaded) {\n      this.loadPromise ??= this.#entity.em.populate(this.#entity, this.#hint!).then((loaded) => (this.loaded = true));\n      await this.loadPromise;\n    }\n    return isPopulate ? (undefined as any) : this.call(...args);\n  }\n\n  call(...args: A): V {\n    if (!this.isLoaded) {\n      throw new Error(\"hasAsyncMethod.call was called but not loaded\");\n    }\n    return this.fn(this.#entity as Loaded<T, H>, ...args);\n  }\n\n  get isLoaded() {\n    return this.loaded || isLoaded(this.#entity, this.#hint);\n  }\n\n  [AsyncMethodM]: undefined;\n}\n"],"mappings":";;;;;AAIA,MAAM,eAAe,OAAO;AAC5B,MAAa,4BAA4B,OAAO;AAahD,SAAgB,eACd,UACA,IACsB;CACtB,OAAOA,kBAAAA,WAAW,WAAc;EAC9B,OAAO,IAAI,gBAAgB,QAAQ,UAAU,EAAE;CACjD,CAAC;AACH;AAEA,IAAa,kBAAb,MAIE;CASU;CARV,SAAiB;CACjB;CAEA;CACA;CACA,YACE,QACA,MACA,IACA;EADQ,KAAA,KAAA;EAER,KAAKC,UAAU;EACf,KAAKC,QAAQ;CACf;;CAGA,MAAM,KAAK,GAAG,MAAqB;EAEjC,MAAM,aAAa,QAAQ,OAAO,KAAK,OAAO,YAAY,6BAA8B,KAAa;EACrG,IAAI,CAAC,KAAK,QAAQ;GAChB,KAAK,gBAAgB,KAAKD,QAAQ,GAAG,SAAS,KAAKA,SAAS,KAAKC,KAAM,CAAC,CAAC,MAAM,WAAY,KAAK,SAAS,IAAK;GAC9G,MAAM,KAAK;EACb;EACA,OAAO,aAAc,KAAA,IAAoB,KAAK,KAAK,GAAG,IAAI;CAC5D;CAEA,KAAK,GAAG,MAAY;EAClB,IAAI,CAAC,KAAK,UACR,MAAM,IAAI,MAAM,+CAA+C;EAEjE,OAAO,KAAK,GAAG,KAAKD,SAAyB,GAAG,IAAI;CACtD;CAEA,IAAI,WAAW;EACb,OAAO,KAAK,UAAUE,0BAAAA,SAAS,KAAKF,SAAS,KAAKC,KAAK;CACzD;CAEA,CAAC;AACH"}

package/build/relations/hasAsyncMethod.d.cts

@@ -1,4 +1,4 @@
-import { LoadHint, Loaded } from "../loadHints.cjs";
+import { LoadHint, Loaded } from "../loading/loadHints.cjs";
 import { Entity } from "../Entity.cjs";
 //#region src/relations/hasAsyncMethod.d.ts
 declare const AsyncMethodM: unique symbol;

package/build/relations/hasAsyncMethod.d.mts

@@ -1,4 +1,4 @@
-import { LoadHint, Loaded } from "../loadHints.mjs";
+import { LoadHint, Loaded } from "../loading/loadHints.mjs";
 import { Entity } from "../Entity.mjs";
 //#region src/relations/hasAsyncMethod.d.ts
 declare const AsyncMethodM: unique symbol;

package/build/relations/hasAsyncMethod.js

@@ -1,4 +1,4 @@
-import { isLoaded } from "../loadHints.js";
+import { isLoaded } from "../loading/loadHints.js";
 import { lazyField } from "../newEntity.js";
 import "../Entity.js";
 //#region src/relations/hasAsyncMethod.ts

package/build/relations/hasAsyncMethod.js.map

@@ -1 +1 @@
-{"version":3,"file":"hasAsyncMethod.js","names":["#entity","#hint"],"sources":["../../src/relations/hasAsyncMethod.ts"],"sourcesContent":["import { type Entity } from \"../Entity.ts\";\nimport { type LoadHint, type Loaded, isLoaded } from \"../loadHints.ts\";\nimport { lazyField } from \"../newEntity.ts\";\n\nconst AsyncMethodM = Symbol();\nexport const AsyncMethodPopulateSecret = Symbol();\n\nexport interface AsyncMethod<T extends Entity, A extends unknown[], V> {\n  // To differentiate from AsyncProperties\n  [AsyncMethodM]: undefined;\n  isLoaded: boolean;\n  load(...args: A): Promise<V>;\n}\n\nexport interface LoadedMethod<T extends Entity, A extends unknown[], V> {\n  call(...args: A): V;\n}\n\nexport function hasAsyncMethod<T extends Entity, const H extends LoadHint<T>, A extends unknown[], V>(\n  loadHint: H,\n  fn: (entity: Loaded<T, H>, ...args: A) => V,\n): AsyncMethod<T, A, V> {\n  return lazyField((entity: T) => {\n    return new AsyncMethodImpl(entity, loadHint, fn);\n  });\n}\n\nexport class AsyncMethodImpl<T extends Entity, H extends LoadHint<T>, A extends unknown[], V> implements AsyncMethod<\n  T,\n  A,\n  V\n> {\n  private loaded = false;\n  private loadPromise: Promise<any> | undefined;\n\n  readonly #entity: T;\n  readonly #hint: H;\n  constructor(\n    entity: T,\n    hint: H,\n    private fn: (entity: Loaded<T, H>, ...args: A) => V,\n  ) {\n    this.#entity = entity;\n    this.#hint = hint;\n  }\n\n  /** Args might be either the user-provided args, or the populate `opts` if we're being preloaded. */\n  async load(...args: A): Promise<V> {\n    // Are we being called by `em.populate`? If so, we don't have the real args, so avoid invoking fn\n    const isPopulate = args && typeof args[0] === \"object\" && AsyncMethodPopulateSecret in (args as any)[0];\n    if (!this.loaded) {\n      this.loadPromise ??= this.#entity.em.populate(this.#entity, this.#hint!).then((loaded) => (this.loaded = true));\n      await this.loadPromise;\n    }\n    return isPopulate ? (undefined as any) : this.call(...args);\n  }\n\n  call(...args: A): V {\n    if (!this.isLoaded) {\n      throw new Error(\"hasAsyncMethod.call was called but not loaded\");\n    }\n    return this.fn(this.#entity as Loaded<T, H>, ...args);\n  }\n\n  get isLoaded() {\n    return this.loaded || isLoaded(this.#entity, this.#hint);\n  }\n\n  [AsyncMethodM]: undefined;\n}\n"],"mappings":";;;;AAIA,MAAM,eAAe,OAAO;AAC5B,MAAa,4BAA4B,OAAO;AAahD,SAAgB,eACd,UACA,IACsB;CACtB,OAAO,WAAW,WAAc;EAC9B,OAAO,IAAI,gBAAgB,QAAQ,UAAU,EAAE;CACjD,CAAC;AACH;AAEA,IAAa,kBAAb,MAIE;CASU;CARV,SAAiB;CACjB;CAEA;CACA;CACA,YACE,QACA,MACA,IACA;EADQ,KAAA,KAAA;EAER,KAAKA,UAAU;EACf,KAAKC,QAAQ;CACf;;CAGA,MAAM,KAAK,GAAG,MAAqB;EAEjC,MAAM,aAAa,QAAQ,OAAO,KAAK,OAAO,YAAY,6BAA8B,KAAa;EACrG,IAAI,CAAC,KAAK,QAAQ;GAChB,KAAK,gBAAgB,KAAKD,QAAQ,GAAG,SAAS,KAAKA,SAAS,KAAKC,KAAM,CAAC,CAAC,MAAM,WAAY,KAAK,SAAS,IAAK;GAC9G,MAAM,KAAK;EACb;EACA,OAAO,aAAc,KAAA,IAAoB,KAAK,KAAK,GAAG,IAAI;CAC5D;CAEA,KAAK,GAAG,MAAY;EAClB,IAAI,CAAC,KAAK,UACR,MAAM,IAAI,MAAM,+CAA+C;EAEjE,OAAO,KAAK,GAAG,KAAKD,SAAyB,GAAG,IAAI;CACtD;CAEA,IAAI,WAAW;EACb,OAAO,KAAK,UAAU,SAAS,KAAKA,SAAS,KAAKC,KAAK;CACzD;CAEA,CAAC;AACH"}
+{"version":3,"file":"hasAsyncMethod.js","names":["#entity","#hint"],"sources":["../../src/relations/hasAsyncMethod.ts"],"sourcesContent":["import { type Entity } from \"../Entity.ts\";\nimport { type LoadHint, type Loaded, isLoaded } from \"../loading/loadHints.ts\";\nimport { lazyField } from \"../newEntity.ts\";\n\nconst AsyncMethodM = Symbol();\nexport const AsyncMethodPopulateSecret = Symbol();\n\nexport interface AsyncMethod<T extends Entity, A extends unknown[], V> {\n  // To differentiate from AsyncProperties\n  [AsyncMethodM]: undefined;\n  isLoaded: boolean;\n  load(...args: A): Promise<V>;\n}\n\nexport interface LoadedMethod<T extends Entity, A extends unknown[], V> {\n  call(...args: A): V;\n}\n\nexport function hasAsyncMethod<T extends Entity, const H extends LoadHint<T>, A extends unknown[], V>(\n  loadHint: H,\n  fn: (entity: Loaded<T, H>, ...args: A) => V,\n): AsyncMethod<T, A, V> {\n  return lazyField((entity: T) => {\n    return new AsyncMethodImpl(entity, loadHint, fn);\n  });\n}\n\nexport class AsyncMethodImpl<T extends Entity, H extends LoadHint<T>, A extends unknown[], V> implements AsyncMethod<\n  T,\n  A,\n  V\n> {\n  private loaded = false;\n  private loadPromise: Promise<any> | undefined;\n\n  readonly #entity: T;\n  readonly #hint: H;\n  constructor(\n    entity: T,\n    hint: H,\n    private fn: (entity: Loaded<T, H>, ...args: A) => V,\n  ) {\n    this.#entity = entity;\n    this.#hint = hint;\n  }\n\n  /** Args might be either the user-provided args, or the populate `opts` if we're being preloaded. */\n  async load(...args: A): Promise<V> {\n    // Are we being called by `em.populate`? If so, we don't have the real args, so avoid invoking fn\n    const isPopulate = args && typeof args[0] === \"object\" && AsyncMethodPopulateSecret in (args as any)[0];\n    if (!this.loaded) {\n      this.loadPromise ??= this.#entity.em.populate(this.#entity, this.#hint!).then((loaded) => (this.loaded = true));\n      await this.loadPromise;\n    }\n    return isPopulate ? (undefined as any) : this.call(...args);\n  }\n\n  call(...args: A): V {\n    if (!this.isLoaded) {\n      throw new Error(\"hasAsyncMethod.call was called but not loaded\");\n    }\n    return this.fn(this.#entity as Loaded<T, H>, ...args);\n  }\n\n  get isLoaded() {\n    return this.loaded || isLoaded(this.#entity, this.#hint);\n  }\n\n  [AsyncMethodM]: undefined;\n}\n"],"mappings":";;;;AAIA,MAAM,eAAe,OAAO;AAC5B,MAAa,4BAA4B,OAAO;AAahD,SAAgB,eACd,UACA,IACsB;CACtB,OAAO,WAAW,WAAc;EAC9B,OAAO,IAAI,gBAAgB,QAAQ,UAAU,EAAE;CACjD,CAAC;AACH;AAEA,IAAa,kBAAb,MAIE;CASU;CARV,SAAiB;CACjB;CAEA;CACA;CACA,YACE,QACA,MACA,IACA;EADQ,KAAA,KAAA;EAER,KAAKA,UAAU;EACf,KAAKC,QAAQ;CACf;;CAGA,MAAM,KAAK,GAAG,MAAqB;EAEjC,MAAM,aAAa,QAAQ,OAAO,KAAK,OAAO,YAAY,6BAA8B,KAAa;EACrG,IAAI,CAAC,KAAK,QAAQ;GAChB,KAAK,gBAAgB,KAAKD,QAAQ,GAAG,SAAS,KAAKA,SAAS,KAAKC,KAAM,CAAC,CAAC,MAAM,WAAY,KAAK,SAAS,IAAK;GAC9G,MAAM,KAAK;EACb;EACA,OAAO,aAAc,KAAA,IAAoB,KAAK,KAAK,GAAG,IAAI;CAC5D;CAEA,KAAK,GAAG,MAAY;EAClB,IAAI,CAAC,KAAK,UACR,MAAM,IAAI,MAAM,+CAA+C;EAEjE,OAAO,KAAK,GAAG,KAAKD,SAAyB,GAAG,IAAI;CACtD;CAEA,IAAI,WAAW;EACb,OAAO,KAAK,UAAU,SAAS,KAAKA,SAAS,KAAKC,KAAK;CACzD;CAEA,CAAC;AACH"}

package/build/relations/hasManyDerived.cjs

@@ -1,7 +1,7 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_loadHints = require("../loadHints.cjs");
-const require_newEntity = require("../newEntity.cjs");
 const require_relations_CustomCollection = require("./CustomCollection.cjs");
+const require_loading_loadHints = require("../loading/loadHints.cjs");
+const require_newEntity = require("../newEntity.cjs");
 require("../index.cjs");
 require("../Entity.cjs");
 //#region src/relations/hasManyDerived.ts
@@ -23,7 +23,7 @@ function hasManyDerived(loadHint, opts) {
 					...opts
 				});
 			},
-			isLoaded: () => require_loadHints.isLoaded(entity, loadHint),
+			isLoaded: () => require_loading_loadHints.isLoaded(entity, loadHint),
 			loadHint,
 			...rest
 		});

package/build/relations/hasManyDerived.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"hasManyDerived.cjs","names":["lazyField","CustomCollection","isLoaded"],"sources":["../../src/relations/hasManyDerived.ts"],"sourcesContent":["import { type Collection, isLoaded } from \"..//index.ts\";\nimport { type Entity } from \"../Entity.ts\";\nimport { type LoadHint, type Loaded } from \"../loadHints.ts\";\nimport { lazyField } from \"../newEntity.ts\";\nimport { CustomCollection } from \"./CustomCollection.ts\";\n\ntype HasManyDerivedOpts<T extends Entity, U extends Entity, H extends LoadHint<T>> = {\n  load?: (entity: T, opts: { forceReload?: boolean }) => Promise<any>;\n  get: (entity: Loaded<T, H>) => readonly U[];\n  set?: (entity: Loaded<T, H>, values: U[]) => void;\n  add?: (entity: Loaded<T, H>, value: U) => void;\n  remove?: (entity: Loaded<T, H>, value: U) => void;\n};\n\n/**\n * Creates a CustomCollection that can conditionally walk across references in the object graph.\n *\n * I.e. An Author \"has many reviews\" through the `author -> books -> reviews` relation.\n *\n * Because this is based on `CustomCollection`, it will work in populates, i.e. `em.populate(author, \"reviews\")`.\n */\nexport function hasManyDerived<T extends Entity, U extends Entity, H extends LoadHint<T>>(\n  loadHint: H,\n  opts: HasManyDerivedOpts<T, U, H>,\n): Collection<T, U> {\n  const { load, ...rest } = opts;\n  return lazyField((entity: T) => {\n    return new CustomCollection<T, U>(entity, {\n      load(entity, opts) {\n        if (load) {\n          return load(entity, opts);\n        } else {\n          return entity.em.populate(entity, { hint: loadHint, ...opts });\n        }\n      },\n      isLoaded: () => isLoaded(entity, loadHint),\n      loadHint,\n      ...(rest as any),\n    });\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;AAqBA,SAAgB,eACd,UACA,MACkB;CAClB,MAAM,EAAE,MAAM,GAAG,SAAS;CAC1B,OAAOA,kBAAAA,WAAW,WAAc;EAC9B,OAAO,IAAIC,mCAAAA,iBAAuB,QAAQ;GACxC,KAAK,QAAQ,MAAM;IACjB,IAAI,MACF,OAAO,KAAK,QAAQ,IAAI;SAExB,OAAO,OAAO,GAAG,SAAS,QAAQ;KAAE,MAAM;KAAU,GAAG;IAAK,CAAC;GAEjE;GACA,gBAAgBC,kBAAAA,SAAS,QAAQ,QAAQ;GACzC;GACA,GAAI;EACN,CAAC;CACH,CAAC;AACH"}
+{"version":3,"file":"hasManyDerived.cjs","names":["lazyField","CustomCollection","isLoaded"],"sources":["../../src/relations/hasManyDerived.ts"],"sourcesContent":["import { type Collection, isLoaded } from \"..//index.ts\";\nimport { type Entity } from \"../Entity.ts\";\nimport type { LoadHint, Loaded } from \"../loading/loadHints.ts\";\nimport { lazyField } from \"../newEntity.ts\";\nimport { CustomCollection } from \"./CustomCollection.ts\";\n\ntype HasManyDerivedOpts<T extends Entity, U extends Entity, H extends LoadHint<T>> = {\n  load?: (entity: T, opts: { forceReload?: boolean }) => Promise<any>;\n  get: (entity: Loaded<T, H>) => readonly U[];\n  set?: (entity: Loaded<T, H>, values: U[]) => void;\n  add?: (entity: Loaded<T, H>, value: U) => void;\n  remove?: (entity: Loaded<T, H>, value: U) => void;\n};\n\n/**\n * Creates a CustomCollection that can conditionally walk across references in the object graph.\n *\n * I.e. An Author \"has many reviews\" through the `author -> books -> reviews` relation.\n *\n * Because this is based on `CustomCollection`, it will work in populates, i.e. `em.populate(author, \"reviews\")`.\n */\nexport function hasManyDerived<T extends Entity, U extends Entity, H extends LoadHint<T>>(\n  loadHint: H,\n  opts: HasManyDerivedOpts<T, U, H>,\n): Collection<T, U> {\n  const { load, ...rest } = opts;\n  return lazyField((entity: T) => {\n    return new CustomCollection<T, U>(entity, {\n      load(entity, opts) {\n        if (load) {\n          return load(entity, opts);\n        } else {\n          return entity.em.populate(entity, { hint: loadHint, ...opts });\n        }\n      },\n      isLoaded: () => isLoaded(entity, loadHint),\n      loadHint,\n      ...(rest as any),\n    });\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;AAqBA,SAAgB,eACd,UACA,MACkB;CAClB,MAAM,EAAE,MAAM,GAAG,SAAS;CAC1B,OAAOA,kBAAAA,WAAW,WAAc;EAC9B,OAAO,IAAIC,mCAAAA,iBAAuB,QAAQ;GACxC,KAAK,QAAQ,MAAM;IACjB,IAAI,MACF,OAAO,KAAK,QAAQ,IAAI;SAExB,OAAO,OAAO,GAAG,SAAS,QAAQ;KAAE,MAAM;KAAU,GAAG;IAAK,CAAC;GAEjE;GACA,gBAAgBC,0BAAAA,SAAS,QAAQ,QAAQ;GACzC;GACA,GAAI;EACN,CAAC;CACH,CAAC;AACH"}

package/build/relations/hasManyDerived.d.cts

@@ -1,5 +1,5 @@
 import { Collection } from "./Collection.cjs";
-import { LoadHint, Loaded } from "../loadHints.cjs";
+import { LoadHint, Loaded } from "../loading/loadHints.cjs";
 import "../index.cjs";
 import { Entity } from "../Entity.cjs";
 //#region src/relations/hasManyDerived.d.ts

package/build/relations/hasManyDerived.d.mts

@@ -1,5 +1,5 @@
 import { Collection } from "./Collection.mjs";
-import { LoadHint, Loaded } from "../loadHints.mjs";
+import { LoadHint, Loaded } from "../loading/loadHints.mjs";
 import "../index.mjs";
 import { Entity } from "../Entity.mjs";
 //#region src/relations/hasManyDerived.d.ts

package/build/relations/hasManyDerived.js

@@ -1,6 +1,6 @@
-import { isLoaded } from "../loadHints.js";
-import { lazyField } from "../newEntity.js";
 import { CustomCollection } from "./CustomCollection.js";
+import { isLoaded } from "../loading/loadHints.js";
+import { lazyField } from "../newEntity.js";
 import "../index.js";
 import "../Entity.js";
 //#region src/relations/hasManyDerived.ts

package/build/relations/hasManyDerived.js.map

@@ -1 +1 @@
-{"version":3,"file":"hasManyDerived.js","names":[],"sources":["../../src/relations/hasManyDerived.ts"],"sourcesContent":["import { type Collection, isLoaded } from \"..//index.ts\";\nimport { type Entity } from \"../Entity.ts\";\nimport { type LoadHint, type Loaded } from \"../loadHints.ts\";\nimport { lazyField } from \"../newEntity.ts\";\nimport { CustomCollection } from \"./CustomCollection.ts\";\n\ntype HasManyDerivedOpts<T extends Entity, U extends Entity, H extends LoadHint<T>> = {\n  load?: (entity: T, opts: { forceReload?: boolean }) => Promise<any>;\n  get: (entity: Loaded<T, H>) => readonly U[];\n  set?: (entity: Loaded<T, H>, values: U[]) => void;\n  add?: (entity: Loaded<T, H>, value: U) => void;\n  remove?: (entity: Loaded<T, H>, value: U) => void;\n};\n\n/**\n * Creates a CustomCollection that can conditionally walk across references in the object graph.\n *\n * I.e. An Author \"has many reviews\" through the `author -> books -> reviews` relation.\n *\n * Because this is based on `CustomCollection`, it will work in populates, i.e. `em.populate(author, \"reviews\")`.\n */\nexport function hasManyDerived<T extends Entity, U extends Entity, H extends LoadHint<T>>(\n  loadHint: H,\n  opts: HasManyDerivedOpts<T, U, H>,\n): Collection<T, U> {\n  const { load, ...rest } = opts;\n  return lazyField((entity: T) => {\n    return new CustomCollection<T, U>(entity, {\n      load(entity, opts) {\n        if (load) {\n          return load(entity, opts);\n        } else {\n          return entity.em.populate(entity, { hint: loadHint, ...opts });\n        }\n      },\n      isLoaded: () => isLoaded(entity, loadHint),\n      loadHint,\n      ...(rest as any),\n    });\n  });\n}\n"],"mappings":";;;;;;;;;;;;;AAqBA,SAAgB,eACd,UACA,MACkB;CAClB,MAAM,EAAE,MAAM,GAAG,SAAS;CAC1B,OAAO,WAAW,WAAc;EAC9B,OAAO,IAAI,iBAAuB,QAAQ;GACxC,KAAK,QAAQ,MAAM;IACjB,IAAI,MACF,OAAO,KAAK,QAAQ,IAAI;SAExB,OAAO,OAAO,GAAG,SAAS,QAAQ;KAAE,MAAM;KAAU,GAAG;IAAK,CAAC;GAEjE;GACA,gBAAgB,SAAS,QAAQ,QAAQ;GACzC;GACA,GAAI;EACN,CAAC;CACH,CAAC;AACH"}
+{"version":3,"file":"hasManyDerived.js","names":[],"sources":["../../src/relations/hasManyDerived.ts"],"sourcesContent":["import { type Collection, isLoaded } from \"..//index.ts\";\nimport { type Entity } from \"../Entity.ts\";\nimport type { LoadHint, Loaded } from \"../loading/loadHints.ts\";\nimport { lazyField } from \"../newEntity.ts\";\nimport { CustomCollection } from \"./CustomCollection.ts\";\n\ntype HasManyDerivedOpts<T extends Entity, U extends Entity, H extends LoadHint<T>> = {\n  load?: (entity: T, opts: { forceReload?: boolean }) => Promise<any>;\n  get: (entity: Loaded<T, H>) => readonly U[];\n  set?: (entity: Loaded<T, H>, values: U[]) => void;\n  add?: (entity: Loaded<T, H>, value: U) => void;\n  remove?: (entity: Loaded<T, H>, value: U) => void;\n};\n\n/**\n * Creates a CustomCollection that can conditionally walk across references in the object graph.\n *\n * I.e. An Author \"has many reviews\" through the `author -> books -> reviews` relation.\n *\n * Because this is based on `CustomCollection`, it will work in populates, i.e. `em.populate(author, \"reviews\")`.\n */\nexport function hasManyDerived<T extends Entity, U extends Entity, H extends LoadHint<T>>(\n  loadHint: H,\n  opts: HasManyDerivedOpts<T, U, H>,\n): Collection<T, U> {\n  const { load, ...rest } = opts;\n  return lazyField((entity: T) => {\n    return new CustomCollection<T, U>(entity, {\n      load(entity, opts) {\n        if (load) {\n          return load(entity, opts);\n        } else {\n          return entity.em.populate(entity, { hint: loadHint, ...opts });\n        }\n      },\n      isLoaded: () => isLoaded(entity, loadHint),\n      loadHint,\n      ...(rest as any),\n    });\n  });\n}\n"],"mappings":";;;;;;;;;;;;;AAqBA,SAAgB,eACd,UACA,MACkB;CAClB,MAAM,EAAE,MAAM,GAAG,SAAS;CAC1B,OAAO,WAAW,WAAc;EAC9B,OAAO,IAAI,iBAAuB,QAAQ;GACxC,KAAK,QAAQ,MAAM;IACjB,IAAI,MACF,OAAO,KAAK,QAAQ,IAAI;SAExB,OAAO,OAAO,GAAG,SAAS,QAAQ;KAAE,MAAM;KAAU,GAAG;IAAK,CAAC;GAEjE;GACA,gBAAgB,SAAS,QAAQ,QAAQ;GACzC;GACA,GAAI;EACN,CAAC;CACH,CAAC;AACH"}

package/build/relations/hasManyThrough.cjs

@@ -1,8 +1,8 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_newEntity = require("../newEntity.cjs");
 const require_relations_CustomCollection = require("./CustomCollection.cjs");
+const require_newEntity = require("../newEntity.cjs");
 const require_EntityMetadata = require("../EntityMetadata.cjs");
-const require_loadLens = require("../loadLens.cjs");
+const require_loading_loadLens = require("../loading/loadLens.cjs");
 require("../index.cjs");
 //#region src/relations/hasManyThrough.ts
 /**
@@ -16,10 +16,10 @@ function hasManyThrough(lens) {
 	return require_newEntity.lazyField((entity) => {
 		const meta = require_EntityMetadata.getMetadata(entity);
 		return new require_relations_CustomCollection.CustomCollection(entity, {
-			load: (entity, opts) => require_loadLens.loadLens(entity, lens, opts),
-			get: () => require_loadLens.getLens(meta, entity, lens),
-			isLoaded: () => require_loadLens.isLensLoaded(entity, lens),
-			loadHint: () => require_loadLens.lensToLoadHint(lens)
+			load: (entity, opts) => require_loading_loadLens.loadLens(entity, lens, opts),
+			get: () => require_loading_loadLens.getLens(meta, entity, lens),
+			isLoaded: () => require_loading_loadLens.isLensLoaded(entity, lens),
+			loadHint: () => require_loading_loadLens.lensToLoadHint(lens)
 		});
 	});
 }

package/build/relations/hasManyThrough.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"hasManyThrough.cjs","names":["lazyField","getMetadata","CustomCollection","loadLens","getLens","isLensLoaded","lensToLoadHint"],"sources":["../../src/relations/hasManyThrough.ts"],"sourcesContent":["import {\n  type Collection,\n  CustomCollection,\n  type Entity,\n  type Lens,\n  getLens,\n  getMetadata,\n  isLensLoaded,\n  lensToLoadHint,\n  loadLens,\n} from \"../index.ts\";\nimport { lazyField } from \"../newEntity.ts\";\n\n/**\n * Creates a CustomCollection that will walk across references in the object graph.\n *\n * I.e. An Author \"has many reviews\" through the `author -> books -> reviews` relation.\n *\n * Because this is based on `CustomCollection`, it will work in populates, i.e. `em.populate(author, \"reviews\")`.\n */\nexport function hasManyThrough<T extends Entity, U extends Entity>(\n  lens: (lens: Lens<T>) => Lens<U, U[]>,\n): Collection<T, U> {\n  return lazyField((entity: T) => {\n    const meta = getMetadata(entity);\n    return new CustomCollection<T, U>(entity, {\n      load: (entity, opts) => loadLens(entity, lens, opts),\n      get: () => getLens(meta, entity, lens),\n      isLoaded: () => isLensLoaded(entity, lens),\n      loadHint: () => lensToLoadHint(lens),\n    });\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;AAoBA,SAAgB,eACd,MACkB;CAClB,OAAOA,kBAAAA,WAAW,WAAc;EAC9B,MAAM,OAAOC,uBAAAA,YAAY,MAAM;EAC/B,OAAO,IAAIC,mCAAAA,iBAAuB,QAAQ;GACxC,OAAO,QAAQ,SAASC,iBAAAA,SAAS,QAAQ,MAAM,IAAI;GACnD,WAAWC,iBAAAA,QAAQ,MAAM,QAAQ,IAAI;GACrC,gBAAgBC,iBAAAA,aAAa,QAAQ,IAAI;GACzC,gBAAgBC,iBAAAA,eAAe,IAAI;EACrC,CAAC;CACH,CAAC;AACH"}
+{"version":3,"file":"hasManyThrough.cjs","names":["lazyField","getMetadata","CustomCollection","loadLens","getLens","isLensLoaded","lensToLoadHint"],"sources":["../../src/relations/hasManyThrough.ts"],"sourcesContent":["import {\n  type Collection,\n  CustomCollection,\n  type Entity,\n  type Lens,\n  getLens,\n  getMetadata,\n  isLensLoaded,\n  lensToLoadHint,\n  loadLens,\n} from \"../index.ts\";\nimport { lazyField } from \"../newEntity.ts\";\n\n/**\n * Creates a CustomCollection that will walk across references in the object graph.\n *\n * I.e. An Author \"has many reviews\" through the `author -> books -> reviews` relation.\n *\n * Because this is based on `CustomCollection`, it will work in populates, i.e. `em.populate(author, \"reviews\")`.\n */\nexport function hasManyThrough<T extends Entity, U extends Entity>(\n  lens: (lens: Lens<T>) => Lens<U, U[]>,\n): Collection<T, U> {\n  return lazyField((entity: T) => {\n    const meta = getMetadata(entity);\n    return new CustomCollection<T, U>(entity, {\n      load: (entity, opts) => loadLens(entity, lens, opts),\n      get: () => getLens(meta, entity, lens),\n      isLoaded: () => isLensLoaded(entity, lens),\n      loadHint: () => lensToLoadHint(lens),\n    });\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;AAoBA,SAAgB,eACd,MACkB;CAClB,OAAOA,kBAAAA,WAAW,WAAc;EAC9B,MAAM,OAAOC,uBAAAA,YAAY,MAAM;EAC/B,OAAO,IAAIC,mCAAAA,iBAAuB,QAAQ;GACxC,OAAO,QAAQ,SAASC,yBAAAA,SAAS,QAAQ,MAAM,IAAI;GACnD,WAAWC,yBAAAA,QAAQ,MAAM,QAAQ,IAAI;GACrC,gBAAgBC,yBAAAA,aAAa,QAAQ,IAAI;GACzC,gBAAgBC,yBAAAA,eAAe,IAAI;EACrC,CAAC;CACH,CAAC;AACH"}

package/build/relations/hasManyThrough.d.cts

@@ -1,5 +1,5 @@
 import { Collection } from "./Collection.cjs";
-import { Lens } from "../loadLens.cjs";
+import { Lens } from "../loading/loadLens.cjs";
 import "../index.cjs";
 import { Entity } from "../Entity.cjs";
 //#region src/relations/hasManyThrough.d.ts

package/build/relations/hasManyThrough.d.mts

@@ -1,5 +1,5 @@
 import { Collection } from "./Collection.mjs";
-import { Lens } from "../loadLens.mjs";
+import { Lens } from "../loading/loadLens.mjs";
 import "../index.mjs";
 import { Entity } from "../Entity.mjs";
 //#region src/relations/hasManyThrough.d.ts

package/build/relations/hasManyThrough.js

@@ -1,7 +1,7 @@
-import { lazyField } from "../newEntity.js";
 import { CustomCollection } from "./CustomCollection.js";
+import { lazyField } from "../newEntity.js";
 import { getMetadata } from "../EntityMetadata.js";
-import { getLens, isLensLoaded, lensToLoadHint, loadLens } from "../loadLens.js";
+import { getLens, isLensLoaded, lensToLoadHint, loadLens } from "../loading/loadLens.js";
 import "../index.js";
 //#region src/relations/hasManyThrough.ts
 /**

package/build/relations/hasOneDerived.cjs

@@ -1,8 +1,8 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_relations_CustomReference = require("./CustomReference.cjs");
+const require_loading_loadHints = require("../loading/loadHints.cjs");
 require("./Reference.cjs");
-const require_loadHints = require("../loadHints.cjs");
 const require_newEntity = require("../newEntity.cjs");
-const require_relations_CustomReference = require("./CustomReference.cjs");
 require("../index.cjs");
 require("../Entity.cjs");
 //#region src/relations/hasOneDerived.ts
@@ -21,7 +21,7 @@ function hasOneDerived(loadHint, get) {
 				...opts
 			}),
 			get: () => get(entity),
-			isLoaded: () => require_loadHints.isLoaded(entity, loadHint),
+			isLoaded: () => require_loading_loadHints.isLoaded(entity, loadHint),
 			loadHint
 		});
 	});

package/build/relations/hasOneDerived.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"hasOneDerived.cjs","names":["lazyField","CustomReference","isLoaded"],"sources":["../../src/relations/hasOneDerived.ts"],"sourcesContent":["import { isLoaded } from \"..//index.ts\";\nimport { type Entity } from \"../Entity.ts\";\nimport { type LoadHint, type Loaded } from \"../loadHints.ts\";\nimport { lazyField } from \"../newEntity.ts\";\nimport { CustomReference } from \"./CustomReference.ts\";\nimport { type Reference } from \"./Reference.ts\";\n\n/**\n * Creates a CustomReference that can conditionally walk across references in the object graph.\n *\n * I.e. A BookReview \"has one author\" through the `review -> book -> author` relation.\n *\n * Because this is based on `CustomReference`, it will work in populates, i.e. `em.populate(review, \"author\")`.\n */\nexport function hasOneDerived<\n  T extends Entity,\n  U extends Entity,\n  N extends never | undefined,\n  V extends U | N,\n  const H extends LoadHint<T>,\n>(loadHint: H, get: (entity: Loaded<T, H>) => V): Reference<T, U, N> {\n  return lazyField((entity: T) => {\n    return new CustomReference<T, U, N>(entity, {\n      load: (entity, opts) => entity.em.populate(entity, { hint: loadHint, ...opts }),\n      get: () => get(entity as Loaded<T, H>),\n      isLoaded: () => isLoaded(entity, loadHint as LoadHint<T>),\n      loadHint,\n    });\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;;AAcA,SAAgB,cAMd,UAAa,KAAsD;CACnE,OAAOA,kBAAAA,WAAW,WAAc;EAC9B,OAAO,IAAIC,kCAAAA,gBAAyB,QAAQ;GAC1C,OAAO,QAAQ,SAAS,OAAO,GAAG,SAAS,QAAQ;IAAE,MAAM;IAAU,GAAG;GAAK,CAAC;GAC9E,WAAW,IAAI,MAAsB;GACrC,gBAAgBC,kBAAAA,SAAS,QAAQ,QAAuB;GACxD;EACF,CAAC;CACH,CAAC;AACH"}
+{"version":3,"file":"hasOneDerived.cjs","names":["lazyField","CustomReference","isLoaded"],"sources":["../../src/relations/hasOneDerived.ts"],"sourcesContent":["import { isLoaded } from \"..//index.ts\";\nimport { type Entity } from \"../Entity.ts\";\nimport type { LoadHint, Loaded } from \"../loading/loadHints.ts\";\nimport { lazyField } from \"../newEntity.ts\";\nimport { CustomReference } from \"./CustomReference.ts\";\nimport { type Reference } from \"./Reference.ts\";\n\n/**\n * Creates a CustomReference that can conditionally walk across references in the object graph.\n *\n * I.e. A BookReview \"has one author\" through the `review -> book -> author` relation.\n *\n * Because this is based on `CustomReference`, it will work in populates, i.e. `em.populate(review, \"author\")`.\n */\nexport function hasOneDerived<\n  T extends Entity,\n  U extends Entity,\n  N extends never | undefined,\n  V extends U | N,\n  const H extends LoadHint<T>,\n>(loadHint: H, get: (entity: Loaded<T, H>) => V): Reference<T, U, N> {\n  return lazyField((entity: T) => {\n    return new CustomReference<T, U, N>(entity, {\n      load: (entity, opts) => entity.em.populate(entity, { hint: loadHint, ...opts }),\n      get: () => get(entity as Loaded<T, H>),\n      isLoaded: () => isLoaded(entity, loadHint as LoadHint<T>),\n      loadHint,\n    });\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;;AAcA,SAAgB,cAMd,UAAa,KAAsD;CACnE,OAAOA,kBAAAA,WAAW,WAAc;EAC9B,OAAO,IAAIC,kCAAAA,gBAAyB,QAAQ;GAC1C,OAAO,QAAQ,SAAS,OAAO,GAAG,SAAS,QAAQ;IAAE,MAAM;IAAU,GAAG;GAAK,CAAC;GAC9E,WAAW,IAAI,MAAsB;GACrC,gBAAgBC,0BAAAA,SAAS,QAAQ,QAAuB;GACxD;EACF,CAAC;CACH,CAAC;AACH"}

package/build/relations/hasOneDerived.d.cts

@@ -1,5 +1,5 @@
 import { Reference } from "./Reference.cjs";
-import { LoadHint, Loaded } from "../loadHints.cjs";
+import { LoadHint, Loaded } from "../loading/loadHints.cjs";
 import { Entity } from "../Entity.cjs";
 //#region src/relations/hasOneDerived.d.ts
 /**

package/build/relations/hasOneDerived.d.mts

@@ -1,5 +1,5 @@
 import { Reference } from "./Reference.mjs";
-import { LoadHint, Loaded } from "../loadHints.mjs";
+import { LoadHint, Loaded } from "../loading/loadHints.mjs";
 import { Entity } from "../Entity.mjs";
 //#region src/relations/hasOneDerived.d.ts
 /**