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

package/build/relations/ReactiveReference.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"ReactiveReference.cjs","names":["lazyField","getMetadata","AbstractRelationImpl","#fieldName","#otherMeta","#state","getEmInternalApi","#loadPromise","#isLoaded","#isCached","isEntity","isLoaded","getField","sameEntity","maybeResolveReferenceToId","failNoId","failIfNewEntity","convertToLoadHint","toIdOf","deTagId","isCascadeDelete","RelationT","RelationU","ReferenceN","#rr","#loaded"],"sources":["../../src/relations/ReactiveReference.ts"],"sourcesContent":["import { type Entity } from \"../Entity.ts\";\nimport { type IdOf } from \"../EntityManager.ts\";\nimport { getField, setField } from \"../fields.ts\";\nimport {\n  type EntityMetadata,\n  type ManyToOneField,\n  type TaggedId,\n  deTagId,\n  ensureNotDeleted,\n  fail,\n  getEmInternalApi,\n  getInstanceData,\n  getMetadata,\n  isEntity,\n  isLoaded,\n  maybeResolveReferenceToId,\n  sameEntity,\n  toIdOf,\n} from \"../index.ts\";\nimport { type IsLoadedCachable } from \"../IsLoadedCache.ts\";\nimport { lazyField } from \"../newEntity.ts\";\nimport { type MaybeReactedEntity, type Reacted, type ReactiveHint, convertToLoadHint } from \"../reactiveHints.ts\";\nimport { AbstractRelationImpl, isCascadeDelete } from \"./AbstractRelationImpl.ts\";\nimport { failIfNewEntity, failNoId } from \"./ManyToOneReference.ts\";\nimport { type Reference } from \"./Reference.ts\";\nimport { ReferenceN } from \"./ReferenceSymbols.ts\";\nimport { RelationT, RelationU } from \"./RelationSymbols.ts\";\n\nexport interface ReactiveReference<T extends Entity, U extends Entity, N extends never | undefined> extends Reference<\n  T,\n  U,\n  N\n> {\n  isLoaded: boolean;\n  isSet: boolean;\n\n  load(opts?: { withDeleted?: boolean; forceReload?: true }): Promise<U | N>;\n\n  /**\n   * Returns the as-of-last-flush previously-calculated entity.\n   *\n   * This is useful if you have to purposefully avoid using the lambda to calc the latest entity,\n   * i.e. if you're in a test and want to watch a calculated entity change from some dummy entity\n   * to the new derived entity.\n   * */\n  fieldValue: U | N;\n\n  /** Returns the id of the current assigned entity, or a runtime error if either 1) unset or 2) set to a new entity that doesn't have an `id` yet. */\n  id: IdOf<U>;\n\n  /** Returns the id of the current assigned entity, undefined if unset, or a runtime error if set to a new entity. */\n  idIfSet: IdOf<U> | undefined;\n\n  idUntagged: string;\n\n  idUntaggedIfSet: string | undefined;\n}\n\nexport function hasReactiveReference<T extends Entity, U extends Entity, const H extends ReactiveHint<T>>(\n  hint: H,\n  fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U>,\n): ReactiveReference<T, U, never>;\nexport function hasReactiveReference<T extends Entity, U extends Entity, const H extends ReactiveHint<T>>(\n  hint: H,\n  fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U> | undefined,\n): ReactiveReference<T, U, undefined>;\n/** Creates a `ReactiveReference`. */\nexport function hasReactiveReference<\n  T extends Entity,\n  U extends Entity,\n  const H extends ReactiveHint<T>,\n  N extends never | undefined,\n>(hint: H, fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U> | N): ReactiveReference<T, U, N> {\n  return lazyField((entity: T, fieldName) => {\n    const m2o = getMetadata(entity).allFields[fieldName] as ManyToOneField;\n    return new ReactiveReferenceImpl<T, U, H, N>(entity, m2o, hint, fn);\n  });\n}\n\n/**\n * Implements ReactiveReferences.\n *\n * This is a bit trickier than ReactiveFields, because we have to differentiate our loaded\n * between:\n *\n * - our load hint is loaded, and we can directly calculate the referenced entity, or\n * - we've fetched the calculated/stored entity from the database, but not purposefully\n *   not re-calculating it (which would require fetching the load hint, which might be\n *   expensive, and defeat the point of having our field materialized in the database)\n *\n * Further, want to support all of:\n *\n * - When loaded & `.get` has been called, we cache the value\n *\n * - If a WIP mutation happens, we invalidate `.get` *but* if we check `.isLoaded`,\n *   we can return the live/updated value, without an `await`.\n *\n * - If a WIP mutation happens, we invalidate `.isLoaded`, and if we're *no longer loaded*,\n *   we want to keep returning the stale value (as asserted by the tests), but the next\n *   `load` / `populate` should load the graph & recalculate the value.\n */\nexport class ReactiveReferenceImpl<\n  T extends Entity,\n  U extends Entity,\n  H extends ReactiveHint<T>,\n  N extends never | undefined,\n>\n  extends AbstractRelationImpl<T, U>\n  implements ReactiveReference<T, U, N>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #otherMeta: EntityMetadata;\n  #state: RRState<U, N>;\n  // #isLoaded doesn't necessary care if we're ref-mode or full-mode, it's just\n  // whether a caller can call `.get` and not have it blow up.\n  #isLoaded: boolean | undefined = undefined;\n  #isCached: boolean = false;\n  #loadPromise: Promise<U | N> | undefined;\n\n  constructor(\n    entity: T,\n    field: ManyToOneField,\n    public reactiveHint: H,\n    private fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U> | N,\n  ) {\n    super(entity);\n    // Minimizing changes until the other PR lands...\n    this.#fieldName = field.fieldName as keyof T & string;\n    this.#otherMeta = field.otherMetadata();\n    this.#state = new RRUnloadedState<U, N>(this);\n    // We can be initialized with [entity | id | undefined], and if it's entity or id, then setImpl\n    // will set loaded appropriately; but if we're initialized undefined, then mark loaded here\n    if (entity.isNewEntity) {\n      // const isLoaded = isEntity(this.current()) ? true : undefined;\n    }\n    // If the property transformer is not enabled, then the RR will not be in the relations map because they are\n    // defined in the implementation file and not the codegen file.  So we should insert ourselves regardless.\n    (getInstanceData(entity).relations ??= {})[field.fieldName] = this;\n  }\n\n  async load(opts?: { withDeleted?: boolean; forceReload?: true }): Promise<U | N> {\n    ensureNotDeleted(this.entity, \"pending\");\n    const { loadHint } = this;\n    if (!this.isLoaded || opts?.forceReload) {\n      const { em } = this.entity;\n      // Just because we're not loaded, doesn't mean we necessarily need to load our full hint.\n      // We prefer to load only our previously-calculated/materialized value, and only load the\n      // full load hint if we need recalculated.\n      const maybeDirty = opts?.forceReload || getEmInternalApi(em).rm.isMaybePendingRecalc(this.entity, this.fieldName);\n      if (maybeDirty) {\n        return (this.#loadPromise ??= em\n          .populate(this.entity, { hint: loadHint, ...opts })\n          .then(() => {\n            this.#state = this.#state.enterRecalcMode(this);\n            this.#isLoaded = true;\n            getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n            // Go through `this.get` so that `setField` is called to set our latest value\n            this.#isCached = false;\n            return this.doGet(opts);\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n      } else {\n        // If we don't need a full recalc, just make sure we have the entity in memory\n        // ...ideally we would check `isSet` and whether the key was in the `instanceData`\n        const current = this.current();\n        if (isEntity(current) || current === undefined) {\n          this.#state = new RRRefState<U, N>(this, current as U | N | undefined);\n          this.#isLoaded = true;\n          getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n          return current as U | N;\n        } else {\n          return (this.#loadPromise ??= em\n            .load(this.#otherMeta.cstr, current)\n            .then((loaded) => {\n              this.#state = new RRRefState<U, N>(this, loaded);\n              this.#isLoaded = true;\n              getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n              return loaded;\n            })\n            .finally(() => {\n              this.#loadPromise = undefined;\n            }));\n        }\n      }\n    }\n    // The ReactiveField.load() always sets `#isCached = false`, but our assertion is that our\n    // IsLoadedCache/resetIsLoaded infra is good enough to \"see all invalidating mutations\",\n    // so we don't need this explicit reset.\n    // this.#isCached = false;\n    return this.doGet(opts);\n  }\n\n  get isLoaded(): boolean {\n    // If we've cached an isLoaded value, just use that, see https://github.com/joist-orm/joist-orm/issues/1166\n    if (this.#isLoaded !== undefined) return this.#isLoaded;\n    getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n    // If a WIP mutation has marked our field as potentially dirty, we need to be \"full\" loaded\n    const maybeDirty = getEmInternalApi(this.entity.em).rm.isMaybePendingRecalc(this.entity, this.fieldName);\n    if (maybeDirty) {\n      // If we're dirty, only being \"full\" loaded is good enough to recalc\n      this.#state = this.#state.enterRecalcMode(this);\n      this.#isLoaded = isLoaded(this.entity, this.loadHint);\n      this.#isCached = false;\n    } else {\n      // If we've had `.load` called before, assume we're still loaded\n      this.#isLoaded = this.#state.canReturnValue;\n    }\n    return this.#isLoaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#isLoaded = undefined;\n    this.#isCached = false;\n  }\n\n  private doGet(opts?: { withDeleted?: boolean }): U | N {\n    const { fn } = this;\n    ensureNotDeleted(this.entity, \"pending\");\n    // Fast pass if we've already calculated this (cache invalidation will happen on\n    // any mutation via #resetIsLoaded)..\n    if (this.#isCached) {\n      return this.filterDeleted(this.#state.doGet() as U | N, opts);\n    }\n    // Call isLoaded to probe the load hint, and get `#isLoaded` set, but still have\n    // our `if` check the raw `#isLoaded` to know if we should eval-latest or return `loaded`.\n    if (this.isLoaded && this.#state.kind === \"full\") {\n      const newValue = this.filterDeleted(fn(this.entity as any) as any, opts);\n      // It's cheap to set this every time we're called, i.e. even if it's not the\n      // official \"being called during em.flush\" update (...unless we're accessing it\n      // during the validate phase of `em.flush`, then skip it to avoid tripping up\n      // the \"cannot change entities during flush\" logic.)\n      if (!getEmInternalApi(this.entity.em).isValidating) {\n        this.setImpl(newValue);\n      }\n      this.#state = new RRFullState<U, N>(this, newValue);\n      this.#isCached = true;\n      getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n    } else if (this.#state.canReturnValue) {\n      // We're either in ref mode, or in full mode but not actually fully loaded,\n      // but in theory those states only get set after `.load()` / `.preload()` / import,\n      // so we should have some stored value, even if it's not fully up-to-date.\n      this.#isCached = true;\n      getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n    } else {\n      const noun = this.entity.isNewEntity ? \"derived\" : \"loaded\";\n      throw new Error(`${this.entity}.${this.fieldName} has not been ${noun} yet`);\n    }\n    return this.filterDeleted(this.#state.doGet() as U | N, opts);\n  }\n\n  get fieldValue(): U | N {\n    return getField(this.entity, this.fieldName);\n  }\n\n  get getWithDeleted(): U | N {\n    return this.doGet({ withDeleted: true });\n  }\n\n  get get(): U | N {\n    return this.doGet({ withDeleted: false });\n  }\n\n  set(_: U | N): void {\n    fail(`Cannot set ${this.entity}.${this.fieldName} ReactiveReference directly.`);\n  }\n\n  get isSet(): boolean {\n    return this.current() !== undefined;\n  }\n\n  // Internal method used by OneToManyCollection\n  setImpl(entity: U | N): void {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (sameEntity(entity, this.current({ withDeleted: true }))) {\n      return;\n    }\n    // Prefer to keep the id in our data hash, but if this is a new entity w/o an id, use the entity itself\n    setField(this.entity, this.fieldName, isEntity(entity) ? (entity.idTaggedMaybe ?? entity) : entity);\n  }\n\n  get isPreloaded(): boolean {\n    return !!this.maybeFindEntity();\n  }\n\n  preload(): void {\n    this.#state = new RRRefState<U, N>(this, this.maybeFindEntity());\n    this.#isLoaded = true;\n    this.#isCached = true;\n  }\n\n  private unload(): void {\n    this.#state = new RRUnloadedState<U, N>(this);\n    this.#isLoaded = false;\n    this.#isCached = false;\n    this.#loadPromise = undefined;\n  }\n\n  import(other: ReactiveReferenceImpl<T, U, H, N>, findEntity: (e: U) => U): void {\n    this.#state = other.#state.import(this, findEntity);\n    this.#isLoaded = true;\n    this.#isCached = true;\n  }\n\n  /** Returns the tagged id of the current value. */\n  get idTaggedMaybe(): TaggedId | N {\n    ensureNotDeleted(this.entity, \"pending\");\n    return maybeResolveReferenceToId(this.current()) as TaggedId | N;\n  }\n\n  get id(): IdOf<U> {\n    return this.idMaybe || failNoId(this.entity, this.fieldName, this.current());\n  }\n\n  get idUntagged(): string {\n    return this.idUntaggedMaybe || failNoId(this.entity, this.fieldName, this.current());\n  }\n\n  get idIfSet(): IdOf<U> | N | undefined {\n    return this.idMaybe || failIfNewEntity(this.entity, this.fieldName, this.current());\n  }\n\n  get idUntaggedIfSet(): string | undefined {\n    return this.idUntaggedMaybe || failIfNewEntity(this.entity, this.fieldName, this.current());\n  }\n\n  get loadHint(): any {\n    const meta = getMetadata(this.entity);\n    return (meta.config.__data.cachedReactiveLoadHints[this.fieldName] ??= convertToLoadHint(meta, this.reactiveHint));\n  }\n\n  // private impl\n\n  /** Returns the id of the current value. */\n  private get idMaybe(): IdOf<U> | undefined {\n    ensureNotDeleted(this.entity, \"pending\");\n    return toIdOf(this.otherMeta, this.idTaggedMaybe);\n  }\n\n  private get idUntaggedMaybe(): string | undefined {\n    return deTagId(this.otherMeta, this.idMaybe);\n  }\n\n  setFromOpts(_: U | IdOf<U> | N): void {\n    throw new Error(`ReactiveReference ${this.entity}.${this.fieldName} cannot be set via opts`);\n  }\n\n  maybeCascadeDelete(): void {\n    if (this.isCascadeDelete) {\n      const current = this.current({ withDeleted: true });\n      if (current !== undefined && typeof current !== \"string\") {\n        this.entity.em.delete(current as U);\n      }\n    }\n  }\n\n  async cleanupOnEntityDeleted(): Promise<void> {\n    // if we are going to delete this relation as well, then we don't need to clean it up\n    if (this.isCascadeDelete) return;\n    setField(this.entity, this.fieldName, undefined);\n    this.#state = new RRRefState<U, N>(this, undefined as N);\n    this.#isLoaded = false;\n    this.#isCached = false;\n    this.#loadPromise = undefined;\n  }\n\n  // We need to keep U in data[fieldName] to handle entities without an id assigned yet.\n  current(opts?: { withDeleted?: boolean }): U | string | N {\n    const current = getField(this.entity, this.fieldName);\n    if (current !== undefined && isEntity(current)) {\n      return this.filterDeleted(current as U, opts);\n    }\n    return current;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  public get otherMeta(): EntityMetadata<U> {\n    return (getMetadata(this.entity).allFields[this.#fieldName] as ManyToOneField).otherMetadata();\n  }\n\n  public get hasBeenSet(): boolean {\n    return true;\n  }\n\n  public toString(): string {\n    return `ReactiveReference(entity: ${this.entity}, hint: ${this.loadHint}, fieldName: ${this.fieldName}, otherMeta: {\n      this.otherMeta.type\n    }, id: ${this.id})`;\n  }\n\n  /**\n   * Removes pending-hard-delete (but not soft-deleted), unless explicitly asked for.\n   *\n   * Note that we leave soft-deleted entities b/c the call signature of a `book.author.get`\n   * very likely does not expect a soft-deleted entity to result in `undefined`.\n   *\n   * (Contrasted with `author.books.get` which is more intuitive to have soft-deleted\n   * entities filtered out, i.e. it doesn't fundamentally change the return type.)\n   */\n  private filterDeleted(entity: U | N, opts?: { withDeleted?: boolean }): U | N {\n    if (entity && (!opts || !opts.withDeleted) && entity.isDeletedEntity) {\n      return undefined!;\n    }\n    return entity;\n  }\n\n  private get isCascadeDelete(): boolean {\n    return isCascadeDelete(this, this.#fieldName);\n  }\n\n  /**\n   * Looks for an entity in `EntityManager`, b/c we may have it in memory even if\n   * our reference is not specifically loaded.\n   */\n  maybeFindEntity(): U | N {\n    // Check this.loaded first b/c a new entity won't have an id yet\n    if (this.#state.canReturnValue) {\n      const loaded = this.#state.doGet();\n      if (loaded !== undefined) {\n        return loaded;\n      }\n    }\n    const { idTaggedMaybe } = this;\n    return idTaggedMaybe !== undefined ? (this.entity.em.getEntity(idTaggedMaybe) as U | N) : (undefined as N);\n  }\n\n  [RelationT]: T = null!;\n  [RelationU]: U = null!;\n  [ReferenceN]: N = null!;\n}\n\n/** Type guard utility for determining if an entity field is a ReactiveReference. */\nexport function isReactiveReference(maybeReactiveRef: any): maybeReactiveRef is ReactiveReference<any, any, any> {\n  return maybeReactiveRef instanceof ReactiveReferenceImpl;\n}\n\ninterface RRState<U extends Entity, N extends never | undefined> {\n  readonly kind: \"unloaded\" | \"ref\" | \"full\";\n  readonly canReturnValue: boolean;\n  doGet(): U | N | undefined;\n  /**\n   * Switches from \"materialized ref value\" semantics to \"recalc from reactive graph when available\" semantics.\n   *\n   * This is synchronous because it does not mean the load hint is fully loaded yet. It only means this\n   * reference should now behave as recalc-capable: if `isLoaded(loadHint)` later reports true, `doGet`\n   * will recalculate from `fn(...)`; otherwise we keep returning the last known/stale value until `load()`\n   * populates the graph.\n   */\n  enterRecalcMode(target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N>;\n  import(target: ReactiveReferenceImpl<any, any, any, any>, findEntity: (e: U) => U): RRState<U, N>;\n}\n\nclass RRUnloadedState<U extends Entity, N extends never | undefined> implements RRState<U, N> {\n  readonly kind = \"unloaded\";\n  readonly canReturnValue = false;\n  #rr: ReactiveReferenceImpl<any, any, any, any>;\n\n  constructor(rr: ReactiveReferenceImpl<any, any, any, any>) {\n    this.#rr = rr;\n  }\n\n  doGet(): U | N | undefined {\n    throw new Error(`${this.#rr.entity}.${this.#rr.fieldName} was not loaded`);\n  }\n\n  enterRecalcMode(target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N> {\n    return new RRFullState<U, N>(target, undefined);\n  }\n\n  import(target: ReactiveReferenceImpl<any, any, any, any>, _findEntity: (e: U) => U): RRState<U, N> {\n    return new RRUnloadedState<U, N>(target);\n  }\n}\n\nclass RRRefState<U extends Entity, N extends never | undefined> implements RRState<U, N> {\n  readonly kind = \"ref\";\n  readonly canReturnValue = true;\n  #loaded: U | N | undefined;\n\n  constructor(_rr: ReactiveReferenceImpl<any, any, any, any>, loaded: U | N | undefined) {\n    this.#loaded = loaded;\n  }\n\n  doGet(): U | N | undefined {\n    return this.#loaded;\n  }\n\n  enterRecalcMode(target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N> {\n    return new RRFullState<U, N>(target, this.#loaded);\n  }\n\n  import(target: ReactiveReferenceImpl<any, any, any, any>, findEntity: (e: U) => U): RRState<U, N> {\n    return new RRRefState<U, N>(target, mapReactiveReferenceEntity(this.#loaded, findEntity));\n  }\n}\n\nclass RRFullState<U extends Entity, N extends never | undefined> implements RRState<U, N> {\n  readonly kind = \"full\";\n  readonly canReturnValue = true;\n  #loaded: U | N | undefined;\n\n  constructor(_rr: ReactiveReferenceImpl<any, any, any, any>, loaded: U | N | undefined) {\n    this.#loaded = loaded;\n  }\n\n  doGet(): U | N | undefined {\n    return this.#loaded;\n  }\n\n  enterRecalcMode(_target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N> {\n    return this;\n  }\n\n  import(target: ReactiveReferenceImpl<any, any, any, any>, findEntity: (e: U) => U): RRState<U, N> {\n    return new RRRefState<U, N>(target, mapReactiveReferenceEntity(this.#loaded, findEntity));\n  }\n}\n\nfunction mapReactiveReferenceEntity<U extends Entity, N extends never | undefined>(\n  entity: U | N | undefined,\n  findEntity: (e: U) => U,\n): U | N | undefined {\n  return isEntity(entity) ? findEntity(entity) : entity;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAmEA,SAAgB,qBAKd,MAAS,IAAsF;CAC/F,OAAOA,kBAAAA,WAAW,QAAW,cAAc;EACzC,MAAM,MAAMC,uBAAAA,YAAY,MAAM,CAAC,CAAC,UAAU;EAC1C,OAAO,IAAI,sBAAkC,QAAQ,KAAK,MAAM,EAAE;CACpE,CAAC;AACH;;;;;;;;;;;;;;;;;;;;;;;AAwBA,IAAa,wBAAb,cAMUC,uCAAAA,qBAEV;CAaW;CACC;CAbV;CACA;CACA;CAGA,YAAiC,KAAA;CACjC,YAAqB;CACrB;CAEA,YACE,QACA,OACA,cACA,IACA;EACA,MAAM,MAAM;EAHL,KAAA,eAAA;EACC,KAAA,KAAA;EAIR,KAAKC,aAAa,MAAM;EACxB,KAAKC,aAAa,MAAM,cAAc;EACtC,KAAKC,SAAS,IAAI,gBAAsB,IAAI;EAG5C,IAAI,OAAO,aAAa,CAExB;EAGA,CAAC,mBAAA,gBAAgB,MAAM,CAAC,CAAC,cAAc,CAAC,EAAA,CAAG,MAAM,aAAa;CAChE;CAEA,MAAM,KAAK,MAAsE;EAC/E,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,MAAM,EAAE,aAAa;EACrB,IAAI,CAAC,KAAK,YAAY,MAAM,aAAa;GACvC,MAAM,EAAE,OAAO,KAAK;GAKpB,IADmB,MAAM,eAAeC,sBAAAA,iBAAiB,EAAE,CAAC,CAAC,GAAG,qBAAqB,KAAK,QAAQ,KAAK,SAAS,GAE9G,OAAQ,KAAKC,iBAAiB,GAC3B,SAAS,KAAK,QAAQ;IAAE,MAAM;IAAU,GAAG;GAAK,CAAC,CAAC,CAClD,WAAW;IACV,KAAKF,SAAS,KAAKA,OAAO,gBAAgB,IAAI;IAC9C,KAAKG,YAAY;IACjB,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;IAEvD,KAAKC,YAAY;IACjB,OAAO,KAAK,MAAM,IAAI;GACxB,CAAC,CAAC,CACD,cAAc;IACb,KAAKF,eAAe,KAAA;GACtB,CAAC;QACE;IAGL,MAAM,UAAU,KAAK,QAAQ;IAC7B,IAAIG,eAAAA,SAAS,OAAO,KAAK,YAAY,KAAA,GAAW;KAC9C,KAAKL,SAAS,IAAI,WAAiB,MAAM,OAA4B;KACrE,KAAKG,YAAY;KACjB,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;KACvD,OAAO;IACT,OACE,OAAQ,KAAKD,iBAAiB,GAC3B,KAAK,KAAKH,WAAW,MAAM,OAAO,CAAC,CACnC,MAAM,WAAW;KAChB,KAAKC,SAAS,IAAI,WAAiB,MAAM,MAAM;KAC/C,KAAKG,YAAY;KACjB,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;KACvD,OAAO;IACT,CAAC,CAAC,CACD,cAAc;KACb,KAAKD,eAAe,KAAA;IACtB,CAAC;GAEP;EACF;EAKA,OAAO,KAAK,MAAM,IAAI;CACxB;CAEA,IAAI,WAAoB;EAEtB,IAAI,KAAKC,cAAc,KAAA,GAAW,OAAO,KAAKA;EAC9C,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;EAGvD,IADmBF,sBAAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,GAAG,qBAAqB,KAAK,QAAQ,KAAK,SACjF,GAAG;GAEd,KAAKD,SAAS,KAAKA,OAAO,gBAAgB,IAAI;GAC9C,KAAKG,YAAYG,kBAAAA,SAAS,KAAK,QAAQ,KAAK,QAAQ;GACpD,KAAKF,YAAY;EACnB,OAEE,KAAKD,YAAY,KAAKH,OAAO;EAE/B,OAAO,KAAKG;CACd;CAEA,gBAAsB;EACpB,KAAKA,YAAY,KAAA;EACjB,KAAKC,YAAY;CACnB;CAEA,MAAc,MAAyC;EACrD,MAAM,EAAE,OAAO;EACf,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EAGvC,IAAI,KAAKA,WACP,OAAO,KAAK,cAAc,KAAKJ,OAAO,MAAM,GAAY,IAAI;EAI9D,IAAI,KAAK,YAAY,KAAKA,OAAO,SAAS,QAAQ;GAChD,MAAM,WAAW,KAAK,cAAc,GAAG,KAAK,MAAa,GAAU,IAAI;GAKvE,IAAI,CAACC,sBAAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cACpC,KAAK,QAAQ,QAAQ;GAEvB,KAAKD,SAAS,IAAI,YAAkB,MAAM,QAAQ;GAClD,KAAKI,YAAY;GACjB,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;EACzD,OAAO,IAAI,KAAKJ,OAAO,gBAAgB;GAIrC,KAAKI,YAAY;GACjB,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;EACzD,OAAO;GACL,MAAM,OAAO,KAAK,OAAO,cAAc,YAAY;GACnD,MAAM,IAAI,MAAM,GAAG,KAAK,OAAO,GAAG,KAAK,UAAU,gBAAgB,KAAK,KAAK;EAC7E;EACA,OAAO,KAAK,cAAc,KAAKJ,OAAO,MAAM,GAAY,IAAI;CAC9D;CAEA,IAAI,aAAoB;EACtB,OAAOO,eAAAA,SAAS,KAAK,QAAQ,KAAK,SAAS;CAC7C;CAEA,IAAI,iBAAwB;EAC1B,OAAO,KAAK,MAAM,EAAE,aAAa,KAAK,CAAC;CACzC;CAEA,IAAI,MAAa;EACf,OAAO,KAAK,MAAM,EAAE,aAAa,MAAM,CAAC;CAC1C;CAEA,IAAI,GAAgB;EAClB,cAAA,KAAK,cAAc,KAAK,OAAO,GAAG,KAAK,UAAU,6BAA6B;CAChF;CAEA,IAAI,QAAiB;EACnB,OAAO,KAAK,QAAQ,MAAM,KAAA;CAC5B;CAGA,QAAQ,QAAqB;EAC3B,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAIC,sBAAAA,WAAW,QAAQ,KAAK,QAAQ,EAAE,aAAa,KAAK,CAAC,CAAC,GACxD;EAGF,eAAA,SAAS,KAAK,QAAQ,KAAK,WAAWH,eAAAA,SAAS,MAAM,IAAK,OAAO,iBAAiB,SAAU,MAAM;CACpG;CAEA,IAAI,cAAuB;EACzB,OAAO,CAAC,CAAC,KAAK,gBAAgB;CAChC;CAEA,UAAgB;EACd,KAAKL,SAAS,IAAI,WAAiB,MAAM,KAAK,gBAAgB,CAAC;EAC/D,KAAKG,YAAY;EACjB,KAAKC,YAAY;CACnB;CAEA,SAAuB;EACrB,KAAKJ,SAAS,IAAI,gBAAsB,IAAI;EAC5C,KAAKG,YAAY;EACjB,KAAKC,YAAY;EACjB,KAAKF,eAAe,KAAA;CACtB;CAEA,OAAO,OAA0C,YAA+B;EAC9E,KAAKF,SAAS,MAAMA,OAAO,OAAO,MAAM,UAAU;EAClD,KAAKG,YAAY;EACjB,KAAKC,YAAY;CACnB;;CAGA,IAAI,gBAA8B;EAChC,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,OAAOK,aAAAA,0BAA0B,KAAK,QAAQ,CAAC;CACjD;CAEA,IAAI,KAAc;EAChB,OAAO,KAAK,WAAWC,qCAAAA,SAAS,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CAC7E;CAEA,IAAI,aAAqB;EACvB,OAAO,KAAK,mBAAmBA,qCAAAA,SAAS,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CACrF;CAEA,IAAI,UAAmC;EACrC,OAAO,KAAK,WAAWC,qCAAAA,gBAAgB,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CACpF;CAEA,IAAI,kBAAsC;EACxC,OAAO,KAAK,mBAAmBA,qCAAAA,gBAAgB,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CAC5F;CAEA,IAAI,WAAgB;EAClB,MAAM,OAAOf,uBAAAA,YAAY,KAAK,MAAM;EACpC,OAAQ,KAAK,OAAO,OAAO,wBAAwB,KAAK,eAAegB,sBAAAA,kBAAkB,MAAM,KAAK,YAAY;CAClH;;CAKA,IAAY,UAA+B;EACzC,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,OAAOC,aAAAA,OAAO,KAAK,WAAW,KAAK,aAAa;CAClD;CAEA,IAAY,kBAAsC;EAChD,OAAOC,aAAAA,QAAQ,KAAK,WAAW,KAAK,OAAO;CAC7C;CAEA,YAAY,GAA0B;EACpC,MAAM,IAAI,MAAM,qBAAqB,KAAK,OAAO,GAAG,KAAK,UAAU,wBAAwB;CAC7F;CAEA,qBAA2B;EACzB,IAAI,KAAK,iBAAiB;GACxB,MAAM,UAAU,KAAK,QAAQ,EAAE,aAAa,KAAK,CAAC;GAClD,IAAI,YAAY,KAAA,KAAa,OAAO,YAAY,UAC9C,KAAK,OAAO,GAAG,OAAO,OAAY;EAEtC;CACF;CAEA,MAAM,yBAAwC;EAE5C,IAAI,KAAK,iBAAiB;EAC1B,eAAA,SAAS,KAAK,QAAQ,KAAK,WAAW,KAAA,CAAS;EAC/C,KAAKd,SAAS,IAAI,WAAiB,MAAM,KAAA,CAAc;EACvD,KAAKG,YAAY;EACjB,KAAKC,YAAY;EACjB,KAAKF,eAAe,KAAA;CACtB;CAGA,QAAQ,MAAkD;EACxD,MAAM,UAAUK,eAAAA,SAAS,KAAK,QAAQ,KAAK,SAAS;EACpD,IAAI,YAAY,KAAA,KAAaF,eAAAA,SAAS,OAAO,GAC3C,OAAO,KAAK,cAAc,SAAc,IAAI;EAE9C,OAAO;CACT;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKP;CACd;CAEA,IAAW,YAA+B;EACxC,OAAQF,uBAAAA,YAAY,KAAK,MAAM,CAAC,CAAC,UAAU,KAAKE,WAAW,CAAoB,cAAc;CAC/F;CAEA,IAAW,aAAsB;EAC/B,OAAO;CACT;CAEA,WAA0B;EACxB,OAAO,6BAA6B,KAAK,OAAO,UAAU,KAAK,SAAS,eAAe,KAAK,UAAU;;aAE7F,KAAK,GAAG;CACnB;;;;;;;;;;CAWA,cAAsB,QAAe,MAAyC;EAC5E,IAAI,WAAW,CAAC,QAAQ,CAAC,KAAK,gBAAgB,OAAO,iBACnD;EAEF,OAAO;CACT;CAEA,IAAY,kBAA2B;EACrC,OAAOiB,uCAAAA,gBAAgB,MAAM,KAAKjB,UAAU;CAC9C;;;;;CAMA,kBAAyB;EAEvB,IAAI,KAAKE,OAAO,gBAAgB;GAC9B,MAAM,SAAS,KAAKA,OAAO,MAAM;GACjC,IAAI,WAAW,KAAA,GACb,OAAO;EAEX;EACA,MAAM,EAAE,kBAAkB;EAC1B,OAAO,kBAAkB,KAAA,IAAa,KAAK,OAAO,GAAG,UAAU,aAAa,IAAe,KAAA;CAC7F;CAEA,CAACgB,kCAAAA,aAAgB;CACjB,CAACC,kCAAAA,aAAgB;CACjB,CAACC,mCAAAA,cAAiB;AACpB;;AAGA,SAAgB,oBAAoB,kBAA6E;CAC/G,OAAO,4BAA4B;AACrC;AAkBA,IAAM,kBAAN,MAAM,gBAAwF;CAC5F,OAAgB;CAChB,iBAA0B;CAC1B;CAEA,YAAY,IAA+C;EACzD,KAAKC,MAAM;CACb;CAEA,QAA2B;EACzB,MAAM,IAAI,MAAM,GAAG,KAAKA,IAAI,OAAO,GAAG,KAAKA,IAAI,UAAU,gBAAgB;CAC3E;CAEA,gBAAgB,QAAsE;EACpF,OAAO,IAAI,YAAkB,QAAQ,KAAA,CAAS;CAChD;CAEA,OAAO,QAAmD,aAAyC;EACjG,OAAO,IAAI,gBAAsB,MAAM;CACzC;AACF;AAEA,IAAM,aAAN,MAAM,WAAmF;CACvF,OAAgB;CAChB,iBAA0B;CAC1B;CAEA,YAAY,KAAgD,QAA2B;EACrF,KAAKC,UAAU;CACjB;CAEA,QAA2B;EACzB,OAAO,KAAKA;CACd;CAEA,gBAAgB,QAAsE;EACpF,OAAO,IAAI,YAAkB,QAAQ,KAAKA,OAAO;CACnD;CAEA,OAAO,QAAmD,YAAwC;EAChG,OAAO,IAAI,WAAiB,QAAQ,2BAA2B,KAAKA,SAAS,UAAU,CAAC;CAC1F;AACF;AAEA,IAAM,cAAN,MAA0F;CACxF,OAAgB;CAChB,iBAA0B;CAC1B;CAEA,YAAY,KAAgD,QAA2B;EACrF,KAAKA,UAAU;CACjB;CAEA,QAA2B;EACzB,OAAO,KAAKA;CACd;CAEA,gBAAgB,SAAuE;EACrF,OAAO;CACT;CAEA,OAAO,QAAmD,YAAwC;EAChG,OAAO,IAAI,WAAiB,QAAQ,2BAA2B,KAAKA,SAAS,UAAU,CAAC;CAC1F;AACF;AAEA,SAAS,2BACP,QACA,YACmB;CACnB,OAAOf,eAAAA,SAAS,MAAM,IAAI,WAAW,MAAM,IAAI;AACjD"}
+{"version":3,"file":"ReactiveReference.cjs","names":["lazyField","getMetadata","AbstractRelationImpl","#fieldName","#otherMeta","#state","getEmInternalApi","#loadPromise","#isLoaded","#isCached","isEntity","isLoaded","getField","sameEntity","maybeResolveReferenceToId","failNoId","failIfNewEntity","convertToLoadHint","toIdOf","deTagId","isCascadeDelete","RelationT","RelationU","ReferenceN","#rr","#loaded"],"sources":["../../src/relations/ReactiveReference.ts"],"sourcesContent":["import { type Entity } from \"../Entity.ts\";\nimport { type IdOf } from \"../EntityManager.ts\";\nimport { getField, setField } from \"../fields.ts\";\nimport {\n  type EntityMetadata,\n  type ManyToOneField,\n  type TaggedId,\n  deTagId,\n  ensureNotDeleted,\n  fail,\n  getEmInternalApi,\n  getInstanceData,\n  getMetadata,\n  isEntity,\n  isLoaded,\n  maybeResolveReferenceToId,\n  sameEntity,\n  toIdOf,\n} from \"../index.ts\";\nimport type { IsLoadedCachable } from \"../loading/IsLoadedCache.ts\";\nimport { lazyField } from \"../newEntity.ts\";\nimport {\n  type MaybeReactedEntity,\n  type Reacted,\n  type ReactiveHint,\n  convertToLoadHint,\n} from \"../reactivity/reactiveHints.ts\";\nimport { AbstractRelationImpl } from \"./AbstractRelationImpl.ts\";\nimport { isCascadeDelete } from \"./isCascadeDelete.ts\";\nimport { failIfNewEntity, failNoId } from \"./ManyToOneReference.ts\";\nimport { type Reference } from \"./Reference.ts\";\nimport { ReferenceN } from \"./ReferenceSymbols.ts\";\nimport { RelationT, RelationU } from \"./RelationSymbols.ts\";\n\nexport interface ReactiveReference<T extends Entity, U extends Entity, N extends never | undefined> extends Reference<\n  T,\n  U,\n  N\n> {\n  isLoaded: boolean;\n  isSet: boolean;\n\n  load(opts?: { withDeleted?: boolean; forceReload?: true }): Promise<U | N>;\n\n  /**\n   * Returns the as-of-last-flush previously-calculated entity.\n   *\n   * This is useful if you have to purposefully avoid using the lambda to calc the latest entity,\n   * i.e. if you're in a test and want to watch a calculated entity change from some dummy entity\n   * to the new derived entity.\n   * */\n  fieldValue: U | N;\n\n  /** Returns the id of the current assigned entity, or a runtime error if either 1) unset or 2) set to a new entity that doesn't have an `id` yet. */\n  id: IdOf<U>;\n\n  /** Returns the id of the current assigned entity, undefined if unset, or a runtime error if set to a new entity. */\n  idIfSet: IdOf<U> | undefined;\n\n  idUntagged: string;\n\n  idUntaggedIfSet: string | undefined;\n}\n\nexport function hasReactiveReference<T extends Entity, U extends Entity, const H extends ReactiveHint<T>>(\n  hint: H,\n  fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U>,\n): ReactiveReference<T, U, never>;\nexport function hasReactiveReference<T extends Entity, U extends Entity, const H extends ReactiveHint<T>>(\n  hint: H,\n  fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U> | undefined,\n): ReactiveReference<T, U, undefined>;\n/** Creates a `ReactiveReference`. */\nexport function hasReactiveReference<\n  T extends Entity,\n  U extends Entity,\n  const H extends ReactiveHint<T>,\n  N extends never | undefined,\n>(hint: H, fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U> | N): ReactiveReference<T, U, N> {\n  return lazyField((entity: T, fieldName) => {\n    const m2o = getMetadata(entity).allFields[fieldName] as ManyToOneField;\n    return new ReactiveReferenceImpl<T, U, H, N>(entity, m2o, hint, fn);\n  });\n}\n\n/**\n * Implements ReactiveReferences.\n *\n * This is a bit trickier than ReactiveFields, because we have to differentiate our loaded\n * between:\n *\n * - our load hint is loaded, and we can directly calculate the referenced entity, or\n * - we've fetched the calculated/stored entity from the database, but not purposefully\n *   not re-calculating it (which would require fetching the load hint, which might be\n *   expensive, and defeat the point of having our field materialized in the database)\n *\n * Further, want to support all of:\n *\n * - When loaded & `.get` has been called, we cache the value\n *\n * - If a WIP mutation happens, we invalidate `.get` *but* if we check `.isLoaded`,\n *   we can return the live/updated value, without an `await`.\n *\n * - If a WIP mutation happens, we invalidate `.isLoaded`, and if we're *no longer loaded*,\n *   we want to keep returning the stale value (as asserted by the tests), but the next\n *   `load` / `populate` should load the graph & recalculate the value.\n */\nexport class ReactiveReferenceImpl<\n  T extends Entity,\n  U extends Entity,\n  H extends ReactiveHint<T>,\n  N extends never | undefined,\n>\n  extends AbstractRelationImpl<T, U>\n  implements ReactiveReference<T, U, N>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #otherMeta: EntityMetadata;\n  #state: RRState<U, N>;\n  // #isLoaded doesn't necessary care if we're ref-mode or full-mode, it's just\n  // whether a caller can call `.get` and not have it blow up.\n  #isLoaded: boolean | undefined = undefined;\n  #isCached: boolean = false;\n  #loadPromise: Promise<U | N> | undefined;\n\n  constructor(\n    entity: T,\n    field: ManyToOneField,\n    public reactiveHint: H,\n    private fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U> | N,\n  ) {\n    super(entity);\n    // Minimizing changes until the other PR lands...\n    this.#fieldName = field.fieldName as keyof T & string;\n    this.#otherMeta = field.otherMetadata();\n    this.#state = new RRUnloadedState<U, N>(this);\n    // We can be initialized with [entity | id | undefined], and if it's entity or id, then setImpl\n    // will set loaded appropriately; but if we're initialized undefined, then mark loaded here\n    if (entity.isNewEntity) {\n      // const isLoaded = isEntity(this.current()) ? true : undefined;\n    }\n    // If the property transformer is not enabled, then the RR will not be in the relations map because they are\n    // defined in the implementation file and not the codegen file.  So we should insert ourselves regardless.\n    (getInstanceData(entity).relations ??= {})[field.fieldName] = this;\n  }\n\n  async load(opts?: { withDeleted?: boolean; forceReload?: true }): Promise<U | N> {\n    ensureNotDeleted(this.entity, \"pending\");\n    const { loadHint } = this;\n    if (!this.isLoaded || opts?.forceReload) {\n      const { em } = this.entity;\n      // Just because we're not loaded, doesn't mean we necessarily need to load our full hint.\n      // We prefer to load only our previously-calculated/materialized value, and only load the\n      // full load hint if we need recalculated.\n      const maybeDirty = opts?.forceReload || getEmInternalApi(em).rm.isMaybePendingRecalc(this.entity, this.fieldName);\n      if (maybeDirty) {\n        return (this.#loadPromise ??= em\n          .populate(this.entity, { hint: loadHint, ...opts })\n          .then(() => {\n            this.#state = this.#state.enterRecalcMode(this);\n            this.#isLoaded = true;\n            getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n            // Go through `this.get` so that `setField` is called to set our latest value\n            this.#isCached = false;\n            return this.doGet(opts);\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n      } else {\n        // If we don't need a full recalc, just make sure we have the entity in memory\n        // ...ideally we would check `isSet` and whether the key was in the `instanceData`\n        const current = this.current();\n        if (isEntity(current) || current === undefined) {\n          this.#state = new RRRefState<U, N>(this, current as U | N | undefined);\n          this.#isLoaded = true;\n          getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n          return current as U | N;\n        } else {\n          return (this.#loadPromise ??= em\n            .load(this.#otherMeta.cstr, current)\n            .then((loaded) => {\n              this.#state = new RRRefState<U, N>(this, loaded);\n              this.#isLoaded = true;\n              getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n              return loaded;\n            })\n            .finally(() => {\n              this.#loadPromise = undefined;\n            }));\n        }\n      }\n    }\n    // The ReactiveField.load() always sets `#isCached = false`, but our assertion is that our\n    // IsLoadedCache/resetIsLoaded infra is good enough to \"see all invalidating mutations\",\n    // so we don't need this explicit reset.\n    // this.#isCached = false;\n    return this.doGet(opts);\n  }\n\n  get isLoaded(): boolean {\n    // If we've cached an isLoaded value, just use that, see https://github.com/joist-orm/joist-orm/issues/1166\n    if (this.#isLoaded !== undefined) return this.#isLoaded;\n    getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n    // If a WIP mutation has marked our field as potentially dirty, we need to be \"full\" loaded\n    const maybeDirty = getEmInternalApi(this.entity.em).rm.isMaybePendingRecalc(this.entity, this.fieldName);\n    if (maybeDirty) {\n      // If we're dirty, only being \"full\" loaded is good enough to recalc\n      this.#state = this.#state.enterRecalcMode(this);\n      this.#isLoaded = isLoaded(this.entity, this.loadHint);\n      this.#isCached = false;\n    } else {\n      // If we've had `.load` called before, assume we're still loaded\n      this.#isLoaded = this.#state.canReturnValue;\n    }\n    return this.#isLoaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#isLoaded = undefined;\n    this.#isCached = false;\n  }\n\n  private doGet(opts?: { withDeleted?: boolean }): U | N {\n    const { fn } = this;\n    ensureNotDeleted(this.entity, \"pending\");\n    // Fast pass if we've already calculated this (cache invalidation will happen on\n    // any mutation via #resetIsLoaded)..\n    if (this.#isCached) {\n      return this.filterDeleted(this.#state.doGet() as U | N, opts);\n    }\n    // Call isLoaded to probe the load hint, and get `#isLoaded` set, but still have\n    // our `if` check the raw `#isLoaded` to know if we should eval-latest or return `loaded`.\n    if (this.isLoaded && this.#state.kind === \"full\") {\n      const newValue = this.filterDeleted(fn(this.entity as any) as any, opts);\n      // It's cheap to set this every time we're called, i.e. even if it's not the\n      // official \"being called during em.flush\" update (...unless we're accessing it\n      // during the validate phase of `em.flush`, then skip it to avoid tripping up\n      // the \"cannot change entities during flush\" logic.)\n      if (!getEmInternalApi(this.entity.em).isValidating) {\n        this.setImpl(newValue);\n      }\n      this.#state = new RRFullState<U, N>(this, newValue);\n      this.#isCached = true;\n      getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n    } else if (this.#state.canReturnValue) {\n      // We're either in ref mode, or in full mode but not actually fully loaded,\n      // but in theory those states only get set after `.load()` / `.preload()` / import,\n      // so we should have some stored value, even if it's not fully up-to-date.\n      this.#isCached = true;\n      getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n    } else {\n      const noun = this.entity.isNewEntity ? \"derived\" : \"loaded\";\n      throw new Error(`${this.entity}.${this.fieldName} has not been ${noun} yet`);\n    }\n    return this.filterDeleted(this.#state.doGet() as U | N, opts);\n  }\n\n  get fieldValue(): U | N {\n    return getField(this.entity, this.fieldName);\n  }\n\n  get getWithDeleted(): U | N {\n    return this.doGet({ withDeleted: true });\n  }\n\n  get get(): U | N {\n    return this.doGet({ withDeleted: false });\n  }\n\n  set(_: U | N): void {\n    fail(`Cannot set ${this.entity}.${this.fieldName} ReactiveReference directly.`);\n  }\n\n  get isSet(): boolean {\n    return this.current() !== undefined;\n  }\n\n  // Internal method used by OneToManyCollection\n  setImpl(entity: U | N): void {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (sameEntity(entity, this.current({ withDeleted: true }))) {\n      return;\n    }\n    // Prefer to keep the id in our data hash, but if this is a new entity w/o an id, use the entity itself\n    setField(this.entity, this.fieldName, isEntity(entity) ? (entity.idTaggedMaybe ?? entity) : entity);\n  }\n\n  get isPreloaded(): boolean {\n    return !!this.maybeFindEntity();\n  }\n\n  preload(): void {\n    this.#state = new RRRefState<U, N>(this, this.maybeFindEntity());\n    this.#isLoaded = true;\n    this.#isCached = true;\n  }\n\n  private unload(): void {\n    this.#state = new RRUnloadedState<U, N>(this);\n    this.#isLoaded = false;\n    this.#isCached = false;\n    this.#loadPromise = undefined;\n  }\n\n  import(other: ReactiveReferenceImpl<T, U, H, N>, findEntity: (e: U) => U): void {\n    this.#state = other.#state.import(this, findEntity);\n    this.#isLoaded = true;\n    this.#isCached = true;\n  }\n\n  /** Returns the tagged id of the current value. */\n  get idTaggedMaybe(): TaggedId | N {\n    ensureNotDeleted(this.entity, \"pending\");\n    return maybeResolveReferenceToId(this.current()) as TaggedId | N;\n  }\n\n  get id(): IdOf<U> {\n    return this.idMaybe || failNoId(this.entity, this.fieldName, this.current());\n  }\n\n  get idUntagged(): string {\n    return this.idUntaggedMaybe || failNoId(this.entity, this.fieldName, this.current());\n  }\n\n  get idIfSet(): IdOf<U> | N | undefined {\n    return this.idMaybe || failIfNewEntity(this.entity, this.fieldName, this.current());\n  }\n\n  get idUntaggedIfSet(): string | undefined {\n    return this.idUntaggedMaybe || failIfNewEntity(this.entity, this.fieldName, this.current());\n  }\n\n  get loadHint(): any {\n    const meta = getMetadata(this.entity);\n    return (meta.config.__data.cachedReactiveLoadHints[this.fieldName] ??= convertToLoadHint(meta, this.reactiveHint));\n  }\n\n  // private impl\n\n  /** Returns the id of the current value. */\n  private get idMaybe(): IdOf<U> | undefined {\n    ensureNotDeleted(this.entity, \"pending\");\n    return toIdOf(this.otherMeta, this.idTaggedMaybe);\n  }\n\n  private get idUntaggedMaybe(): string | undefined {\n    return deTagId(this.otherMeta, this.idMaybe);\n  }\n\n  setFromOpts(_: U | IdOf<U> | N): void {\n    throw new Error(`ReactiveReference ${this.entity}.${this.fieldName} cannot be set via opts`);\n  }\n\n  maybeCascadeDelete(): void {\n    if (this.isCascadeDelete) {\n      const current = this.current({ withDeleted: true });\n      if (current !== undefined && typeof current !== \"string\") {\n        this.entity.em.delete(current as U);\n      }\n    }\n  }\n\n  async cleanupOnEntityDeleted(): Promise<void> {\n    // if we are going to delete this relation as well, then we don't need to clean it up\n    if (this.isCascadeDelete) return;\n    setField(this.entity, this.fieldName, undefined);\n    this.#state = new RRRefState<U, N>(this, undefined as N);\n    this.#isLoaded = false;\n    this.#isCached = false;\n    this.#loadPromise = undefined;\n  }\n\n  // We need to keep U in data[fieldName] to handle entities without an id assigned yet.\n  current(opts?: { withDeleted?: boolean }): U | string | N {\n    const current = getField(this.entity, this.fieldName);\n    if (current !== undefined && isEntity(current)) {\n      return this.filterDeleted(current as U, opts);\n    }\n    return current;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  public get otherMeta(): EntityMetadata<U> {\n    return (getMetadata(this.entity).allFields[this.#fieldName] as ManyToOneField).otherMetadata();\n  }\n\n  public get hasBeenSet(): boolean {\n    return true;\n  }\n\n  public toString(): string {\n    return `ReactiveReference(entity: ${this.entity}, hint: ${this.loadHint}, fieldName: ${this.fieldName}, otherMeta: {\n      this.otherMeta.type\n    }, id: ${this.id})`;\n  }\n\n  /**\n   * Removes pending-hard-delete (but not soft-deleted), unless explicitly asked for.\n   *\n   * Note that we leave soft-deleted entities b/c the call signature of a `book.author.get`\n   * very likely does not expect a soft-deleted entity to result in `undefined`.\n   *\n   * (Contrasted with `author.books.get` which is more intuitive to have soft-deleted\n   * entities filtered out, i.e. it doesn't fundamentally change the return type.)\n   */\n  private filterDeleted(entity: U | N, opts?: { withDeleted?: boolean }): U | N {\n    if (entity && (!opts || !opts.withDeleted) && entity.isDeletedEntity) {\n      return undefined!;\n    }\n    return entity;\n  }\n\n  private get isCascadeDelete(): boolean {\n    return isCascadeDelete(this, this.#fieldName);\n  }\n\n  /**\n   * Looks for an entity in `EntityManager`, b/c we may have it in memory even if\n   * our reference is not specifically loaded.\n   */\n  maybeFindEntity(): U | N {\n    // Check this.loaded first b/c a new entity won't have an id yet\n    if (this.#state.canReturnValue) {\n      const loaded = this.#state.doGet();\n      if (loaded !== undefined) {\n        return loaded;\n      }\n    }\n    const { idTaggedMaybe } = this;\n    return idTaggedMaybe !== undefined ? (this.entity.em.getEntity(idTaggedMaybe) as U | N) : (undefined as N);\n  }\n\n  [RelationT]: T = null!;\n  [RelationU]: U = null!;\n  [ReferenceN]: N = null!;\n}\n\n/** Type guard utility for determining if an entity field is a ReactiveReference. */\nexport function isReactiveReference(maybeReactiveRef: any): maybeReactiveRef is ReactiveReference<any, any, any> {\n  return maybeReactiveRef instanceof ReactiveReferenceImpl;\n}\n\ninterface RRState<U extends Entity, N extends never | undefined> {\n  readonly kind: \"unloaded\" | \"ref\" | \"full\";\n  readonly canReturnValue: boolean;\n  doGet(): U | N | undefined;\n  /**\n   * Switches from \"materialized ref value\" semantics to \"recalc from reactive graph when available\" semantics.\n   *\n   * This is synchronous because it does not mean the load hint is fully loaded yet. It only means this\n   * reference should now behave as recalc-capable: if `isLoaded(loadHint)` later reports true, `doGet`\n   * will recalculate from `fn(...)`; otherwise we keep returning the last known/stale value until `load()`\n   * populates the graph.\n   */\n  enterRecalcMode(target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N>;\n  import(target: ReactiveReferenceImpl<any, any, any, any>, findEntity: (e: U) => U): RRState<U, N>;\n}\n\nclass RRUnloadedState<U extends Entity, N extends never | undefined> implements RRState<U, N> {\n  readonly kind = \"unloaded\";\n  readonly canReturnValue = false;\n  #rr: ReactiveReferenceImpl<any, any, any, any>;\n\n  constructor(rr: ReactiveReferenceImpl<any, any, any, any>) {\n    this.#rr = rr;\n  }\n\n  doGet(): U | N | undefined {\n    throw new Error(`${this.#rr.entity}.${this.#rr.fieldName} was not loaded`);\n  }\n\n  enterRecalcMode(target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N> {\n    return new RRFullState<U, N>(target, undefined);\n  }\n\n  import(target: ReactiveReferenceImpl<any, any, any, any>, _findEntity: (e: U) => U): RRState<U, N> {\n    return new RRUnloadedState<U, N>(target);\n  }\n}\n\nclass RRRefState<U extends Entity, N extends never | undefined> implements RRState<U, N> {\n  readonly kind = \"ref\";\n  readonly canReturnValue = true;\n  #loaded: U | N | undefined;\n\n  constructor(_rr: ReactiveReferenceImpl<any, any, any, any>, loaded: U | N | undefined) {\n    this.#loaded = loaded;\n  }\n\n  doGet(): U | N | undefined {\n    return this.#loaded;\n  }\n\n  enterRecalcMode(target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N> {\n    return new RRFullState<U, N>(target, this.#loaded);\n  }\n\n  import(target: ReactiveReferenceImpl<any, any, any, any>, findEntity: (e: U) => U): RRState<U, N> {\n    return new RRRefState<U, N>(target, mapReactiveReferenceEntity(this.#loaded, findEntity));\n  }\n}\n\nclass RRFullState<U extends Entity, N extends never | undefined> implements RRState<U, N> {\n  readonly kind = \"full\";\n  readonly canReturnValue = true;\n  #loaded: U | N | undefined;\n\n  constructor(_rr: ReactiveReferenceImpl<any, any, any, any>, loaded: U | N | undefined) {\n    this.#loaded = loaded;\n  }\n\n  doGet(): U | N | undefined {\n    return this.#loaded;\n  }\n\n  enterRecalcMode(_target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N> {\n    return this;\n  }\n\n  import(target: ReactiveReferenceImpl<any, any, any, any>, findEntity: (e: U) => U): RRState<U, N> {\n    return new RRRefState<U, N>(target, mapReactiveReferenceEntity(this.#loaded, findEntity));\n  }\n}\n\nfunction mapReactiveReferenceEntity<U extends Entity, N extends never | undefined>(\n  entity: U | N | undefined,\n  findEntity: (e: U) => U,\n): U | N | undefined {\n  return isEntity(entity) ? findEntity(entity) : entity;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAyEA,SAAgB,qBAKd,MAAS,IAAsF;CAC/F,OAAOA,kBAAAA,WAAW,QAAW,cAAc;EACzC,MAAM,MAAMC,uBAAAA,YAAY,MAAM,CAAC,CAAC,UAAU;EAC1C,OAAO,IAAI,sBAAkC,QAAQ,KAAK,MAAM,EAAE;CACpE,CAAC;AACH;;;;;;;;;;;;;;;;;;;;;;;AAwBA,IAAa,wBAAb,cAMUC,uCAAAA,qBAEV;CAaW;CACC;CAbV;CACA;CACA;CAGA,YAAiC,KAAA;CACjC,YAAqB;CACrB;CAEA,YACE,QACA,OACA,cACA,IACA;EACA,MAAM,MAAM;EAHL,KAAA,eAAA;EACC,KAAA,KAAA;EAIR,KAAKC,aAAa,MAAM;EACxB,KAAKC,aAAa,MAAM,cAAc;EACtC,KAAKC,SAAS,IAAI,gBAAsB,IAAI;EAG5C,IAAI,OAAO,aAAa,CAExB;EAGA,CAAC,mBAAA,gBAAgB,MAAM,CAAC,CAAC,cAAc,CAAC,EAAA,CAAG,MAAM,aAAa;CAChE;CAEA,MAAM,KAAK,MAAsE;EAC/E,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,MAAM,EAAE,aAAa;EACrB,IAAI,CAAC,KAAK,YAAY,MAAM,aAAa;GACvC,MAAM,EAAE,OAAO,KAAK;GAKpB,IADmB,MAAM,eAAeC,sBAAAA,iBAAiB,EAAE,CAAC,CAAC,GAAG,qBAAqB,KAAK,QAAQ,KAAK,SAAS,GAE9G,OAAQ,KAAKC,iBAAiB,GAC3B,SAAS,KAAK,QAAQ;IAAE,MAAM;IAAU,GAAG;GAAK,CAAC,CAAC,CAClD,WAAW;IACV,KAAKF,SAAS,KAAKA,OAAO,gBAAgB,IAAI;IAC9C,KAAKG,YAAY;IACjB,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;IAEvD,KAAKC,YAAY;IACjB,OAAO,KAAK,MAAM,IAAI;GACxB,CAAC,CAAC,CACD,cAAc;IACb,KAAKF,eAAe,KAAA;GACtB,CAAC;QACE;IAGL,MAAM,UAAU,KAAK,QAAQ;IAC7B,IAAIG,eAAAA,SAAS,OAAO,KAAK,YAAY,KAAA,GAAW;KAC9C,KAAKL,SAAS,IAAI,WAAiB,MAAM,OAA4B;KACrE,KAAKG,YAAY;KACjB,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;KACvD,OAAO;IACT,OACE,OAAQ,KAAKD,iBAAiB,GAC3B,KAAK,KAAKH,WAAW,MAAM,OAAO,CAAC,CACnC,MAAM,WAAW;KAChB,KAAKC,SAAS,IAAI,WAAiB,MAAM,MAAM;KAC/C,KAAKG,YAAY;KACjB,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;KACvD,OAAO;IACT,CAAC,CAAC,CACD,cAAc;KACb,KAAKD,eAAe,KAAA;IACtB,CAAC;GAEP;EACF;EAKA,OAAO,KAAK,MAAM,IAAI;CACxB;CAEA,IAAI,WAAoB;EAEtB,IAAI,KAAKC,cAAc,KAAA,GAAW,OAAO,KAAKA;EAC9C,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;EAGvD,IADmBF,sBAAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,GAAG,qBAAqB,KAAK,QAAQ,KAAK,SACjF,GAAG;GAEd,KAAKD,SAAS,KAAKA,OAAO,gBAAgB,IAAI;GAC9C,KAAKG,YAAYG,0BAAAA,SAAS,KAAK,QAAQ,KAAK,QAAQ;GACpD,KAAKF,YAAY;EACnB,OAEE,KAAKD,YAAY,KAAKH,OAAO;EAE/B,OAAO,KAAKG;CACd;CAEA,gBAAsB;EACpB,KAAKA,YAAY,KAAA;EACjB,KAAKC,YAAY;CACnB;CAEA,MAAc,MAAyC;EACrD,MAAM,EAAE,OAAO;EACf,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EAGvC,IAAI,KAAKA,WACP,OAAO,KAAK,cAAc,KAAKJ,OAAO,MAAM,GAAY,IAAI;EAI9D,IAAI,KAAK,YAAY,KAAKA,OAAO,SAAS,QAAQ;GAChD,MAAM,WAAW,KAAK,cAAc,GAAG,KAAK,MAAa,GAAU,IAAI;GAKvE,IAAI,CAACC,sBAAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cACpC,KAAK,QAAQ,QAAQ;GAEvB,KAAKD,SAAS,IAAI,YAAkB,MAAM,QAAQ;GAClD,KAAKI,YAAY;GACjB,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;EACzD,OAAO,IAAI,KAAKJ,OAAO,gBAAgB;GAIrC,KAAKI,YAAY;GACjB,sBAAA,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;EACzD,OAAO;GACL,MAAM,OAAO,KAAK,OAAO,cAAc,YAAY;GACnD,MAAM,IAAI,MAAM,GAAG,KAAK,OAAO,GAAG,KAAK,UAAU,gBAAgB,KAAK,KAAK;EAC7E;EACA,OAAO,KAAK,cAAc,KAAKJ,OAAO,MAAM,GAAY,IAAI;CAC9D;CAEA,IAAI,aAAoB;EACtB,OAAOO,eAAAA,SAAS,KAAK,QAAQ,KAAK,SAAS;CAC7C;CAEA,IAAI,iBAAwB;EAC1B,OAAO,KAAK,MAAM,EAAE,aAAa,KAAK,CAAC;CACzC;CAEA,IAAI,MAAa;EACf,OAAO,KAAK,MAAM,EAAE,aAAa,MAAM,CAAC;CAC1C;CAEA,IAAI,GAAgB;EAClB,cAAA,KAAK,cAAc,KAAK,OAAO,GAAG,KAAK,UAAU,6BAA6B;CAChF;CAEA,IAAI,QAAiB;EACnB,OAAO,KAAK,QAAQ,MAAM,KAAA;CAC5B;CAGA,QAAQ,QAAqB;EAC3B,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAIC,sBAAAA,WAAW,QAAQ,KAAK,QAAQ,EAAE,aAAa,KAAK,CAAC,CAAC,GACxD;EAGF,eAAA,SAAS,KAAK,QAAQ,KAAK,WAAWH,eAAAA,SAAS,MAAM,IAAK,OAAO,iBAAiB,SAAU,MAAM;CACpG;CAEA,IAAI,cAAuB;EACzB,OAAO,CAAC,CAAC,KAAK,gBAAgB;CAChC;CAEA,UAAgB;EACd,KAAKL,SAAS,IAAI,WAAiB,MAAM,KAAK,gBAAgB,CAAC;EAC/D,KAAKG,YAAY;EACjB,KAAKC,YAAY;CACnB;CAEA,SAAuB;EACrB,KAAKJ,SAAS,IAAI,gBAAsB,IAAI;EAC5C,KAAKG,YAAY;EACjB,KAAKC,YAAY;EACjB,KAAKF,eAAe,KAAA;CACtB;CAEA,OAAO,OAA0C,YAA+B;EAC9E,KAAKF,SAAS,MAAMA,OAAO,OAAO,MAAM,UAAU;EAClD,KAAKG,YAAY;EACjB,KAAKC,YAAY;CACnB;;CAGA,IAAI,gBAA8B;EAChC,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,OAAOK,aAAAA,0BAA0B,KAAK,QAAQ,CAAC;CACjD;CAEA,IAAI,KAAc;EAChB,OAAO,KAAK,WAAWC,qCAAAA,SAAS,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CAC7E;CAEA,IAAI,aAAqB;EACvB,OAAO,KAAK,mBAAmBA,qCAAAA,SAAS,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CACrF;CAEA,IAAI,UAAmC;EACrC,OAAO,KAAK,WAAWC,qCAAAA,gBAAgB,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CACpF;CAEA,IAAI,kBAAsC;EACxC,OAAO,KAAK,mBAAmBA,qCAAAA,gBAAgB,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CAC5F;CAEA,IAAI,WAAgB;EAClB,MAAM,OAAOf,uBAAAA,YAAY,KAAK,MAAM;EACpC,OAAQ,KAAK,OAAO,OAAO,wBAAwB,KAAK,eAAegB,iCAAAA,kBAAkB,MAAM,KAAK,YAAY;CAClH;;CAKA,IAAY,UAA+B;EACzC,cAAA,iBAAiB,KAAK,QAAQ,SAAS;EACvC,OAAOC,aAAAA,OAAO,KAAK,WAAW,KAAK,aAAa;CAClD;CAEA,IAAY,kBAAsC;EAChD,OAAOC,aAAAA,QAAQ,KAAK,WAAW,KAAK,OAAO;CAC7C;CAEA,YAAY,GAA0B;EACpC,MAAM,IAAI,MAAM,qBAAqB,KAAK,OAAO,GAAG,KAAK,UAAU,wBAAwB;CAC7F;CAEA,qBAA2B;EACzB,IAAI,KAAK,iBAAiB;GACxB,MAAM,UAAU,KAAK,QAAQ,EAAE,aAAa,KAAK,CAAC;GAClD,IAAI,YAAY,KAAA,KAAa,OAAO,YAAY,UAC9C,KAAK,OAAO,GAAG,OAAO,OAAY;EAEtC;CACF;CAEA,MAAM,yBAAwC;EAE5C,IAAI,KAAK,iBAAiB;EAC1B,eAAA,SAAS,KAAK,QAAQ,KAAK,WAAW,KAAA,CAAS;EAC/C,KAAKd,SAAS,IAAI,WAAiB,MAAM,KAAA,CAAc;EACvD,KAAKG,YAAY;EACjB,KAAKC,YAAY;EACjB,KAAKF,eAAe,KAAA;CACtB;CAGA,QAAQ,MAAkD;EACxD,MAAM,UAAUK,eAAAA,SAAS,KAAK,QAAQ,KAAK,SAAS;EACpD,IAAI,YAAY,KAAA,KAAaF,eAAAA,SAAS,OAAO,GAC3C,OAAO,KAAK,cAAc,SAAc,IAAI;EAE9C,OAAO;CACT;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKP;CACd;CAEA,IAAW,YAA+B;EACxC,OAAQF,uBAAAA,YAAY,KAAK,MAAM,CAAC,CAAC,UAAU,KAAKE,WAAW,CAAoB,cAAc;CAC/F;CAEA,IAAW,aAAsB;EAC/B,OAAO;CACT;CAEA,WAA0B;EACxB,OAAO,6BAA6B,KAAK,OAAO,UAAU,KAAK,SAAS,eAAe,KAAK,UAAU;;aAE7F,KAAK,GAAG;CACnB;;;;;;;;;;CAWA,cAAsB,QAAe,MAAyC;EAC5E,IAAI,WAAW,CAAC,QAAQ,CAAC,KAAK,gBAAgB,OAAO,iBACnD;EAEF,OAAO;CACT;CAEA,IAAY,kBAA2B;EACrC,OAAOiB,kCAAAA,gBAAgB,MAAM,KAAKjB,UAAU;CAC9C;;;;;CAMA,kBAAyB;EAEvB,IAAI,KAAKE,OAAO,gBAAgB;GAC9B,MAAM,SAAS,KAAKA,OAAO,MAAM;GACjC,IAAI,WAAW,KAAA,GACb,OAAO;EAEX;EACA,MAAM,EAAE,kBAAkB;EAC1B,OAAO,kBAAkB,KAAA,IAAa,KAAK,OAAO,GAAG,UAAU,aAAa,IAAe,KAAA;CAC7F;CAEA,CAACgB,kCAAAA,aAAgB;CACjB,CAACC,kCAAAA,aAAgB;CACjB,CAACC,mCAAAA,cAAiB;AACpB;;AAGA,SAAgB,oBAAoB,kBAA6E;CAC/G,OAAO,4BAA4B;AACrC;AAkBA,IAAM,kBAAN,MAAM,gBAAwF;CAC5F,OAAgB;CAChB,iBAA0B;CAC1B;CAEA,YAAY,IAA+C;EACzD,KAAKC,MAAM;CACb;CAEA,QAA2B;EACzB,MAAM,IAAI,MAAM,GAAG,KAAKA,IAAI,OAAO,GAAG,KAAKA,IAAI,UAAU,gBAAgB;CAC3E;CAEA,gBAAgB,QAAsE;EACpF,OAAO,IAAI,YAAkB,QAAQ,KAAA,CAAS;CAChD;CAEA,OAAO,QAAmD,aAAyC;EACjG,OAAO,IAAI,gBAAsB,MAAM;CACzC;AACF;AAEA,IAAM,aAAN,MAAM,WAAmF;CACvF,OAAgB;CAChB,iBAA0B;CAC1B;CAEA,YAAY,KAAgD,QAA2B;EACrF,KAAKC,UAAU;CACjB;CAEA,QAA2B;EACzB,OAAO,KAAKA;CACd;CAEA,gBAAgB,QAAsE;EACpF,OAAO,IAAI,YAAkB,QAAQ,KAAKA,OAAO;CACnD;CAEA,OAAO,QAAmD,YAAwC;EAChG,OAAO,IAAI,WAAiB,QAAQ,2BAA2B,KAAKA,SAAS,UAAU,CAAC;CAC1F;AACF;AAEA,IAAM,cAAN,MAA0F;CACxF,OAAgB;CAChB,iBAA0B;CAC1B;CAEA,YAAY,KAAgD,QAA2B;EACrF,KAAKA,UAAU;CACjB;CAEA,QAA2B;EACzB,OAAO,KAAKA;CACd;CAEA,gBAAgB,SAAuE;EACrF,OAAO;CACT;CAEA,OAAO,QAAmD,YAAwC;EAChG,OAAO,IAAI,WAAiB,QAAQ,2BAA2B,KAAKA,SAAS,UAAU,CAAC;CAC1F;AACF;AAEA,SAAS,2BACP,QACA,YACmB;CACnB,OAAOf,eAAAA,SAAS,MAAM,IAAI,WAAW,MAAM,IAAI;AACjD"}

package/build/relations/ReactiveReference.d.cts

@@ -2,8 +2,8 @@ import { AbstractRelationImpl } from "./AbstractRelationImpl.cjs";
 import { RelationT, RelationU } from "./RelationSymbols.cjs";
 import { ReferenceN } from "./ReferenceSymbols.cjs";
 import { Reference } from "./Reference.cjs";
-import { IsLoadedCachable } from "../IsLoadedCache.cjs";
-import { MaybeReactedEntity, Reacted, ReactiveHint } from "../reactiveHints.cjs";
+import { IsLoadedCachable } from "../loading/IsLoadedCache.cjs";
+import { MaybeReactedEntity, Reacted, ReactiveHint } from "../reactivity/reactiveHints.cjs";
 import { EntityMetadata, ManyToOneField } from "../EntityMetadata.cjs";
 import "../index.cjs";
 import { IdOf, TaggedId } from "../EntityManager.cjs";

package/build/relations/ReactiveReference.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"ReactiveReference.d.cts","names":[],"sources":["../../src/relations/ReactiveReference.ts"],"mappings":";;;;;;;;;;;UA4BiB,kBAAkB,UAAU,QAAQ,UAAU,QAAQ,qCAAqC,UAC1G,GACA,GACA;EAEA;EACA;EAEA,KAAK;IAAS;IAAuB;MAAuB,QAAQ,IAAI;;;;;;;;EASxE,YAAY,IAAI;;EAGhB,IAAI,KAAK;;EAGT,SAAS,KAAK;EAEd;EAEA;;iBAGc,qBAAqB,UAAU,QAAQ,UAAU,cAAc,UAAU,aAAa,IACpG,MAAM,GACN,KAAK,QAAQ,QAAQ,GAAG,OAAO,mBAAmB,KACjD,kBAAkB,GAAG;iBACR,qBAAqB,UAAU,QAAQ,UAAU,cAAc,UAAU,aAAa,IACpG,MAAM,GACN,KAAK,QAAQ,QAAQ,GAAG,OAAO,mBAAmB,iBACjD,kBAAkB,GAAG;;;;;;;;;;;;;;;;;;;;;;;cAoCX,sBACX,UAAU,QACV,UAAU,QACV,UAAU,aAAa,IACvB,qCAEQ,qBAAqB,GAAG,cACrB,kBAAkB,GAAG,GAAG,IAAI;;EAc9B,cAAc;UACb;EAJV,YACE,QAAQ,GACR,OAAO,gBACA,cAAc,GACb,KAAK,QAAQ,QAAQ,GAAG,OAAO,mBAAmB,KAAK;EAiB3D,KAAK;IAAS;IAAuB;MAAuB,QAAQ,IAAI;MAsD1E;EAkBJ;UAKQ;MAmCJ,cAAc,IAAI;MAIlB,kBAAkB,IAAI;MAItB,OAAO,IAAI;EAIf,IAAI,GAAG,IAAI;MAIP;EAKJ,QAAQ,QAAQ,IAAI;MAShB;EAIJ;UAMQ;EAOR,OAAO,OAAO,sBAAsB,GAAG,GAAG,GAAG,IAAI,aAAa,GAAG,MAAM;;MAOnE,iBAAiB,WAAW;MAK5B,MAAM,KAAK;MAIX;MAIA,WAAW,KAAK,KAAK;MAIrB;MAIA;;cAQQ;cAKA;EAIZ,YAAY,GAAG,IAAI,KAAK,KAAK;EAI7B;EASM,0BAA0B;EAWhC,QAAQ;IAAS;MAA0B,aAAa;MAQpD;MAIO,aAAa,eAAe;MAI5B;EAIJ;;;;;;;;;;UAeC;cAOI;;;;;EAQZ,mBAAmB,IAAI;GAYtB,YAAY;GACZ,YAAY;GACZ,aAAa;;;iBAIA,oBAAoB,wBAAwB,oBAAoB"}
+{"version":3,"file":"ReactiveReference.d.cts","names":[],"sources":["../../src/relations/ReactiveReference.ts"],"mappings":";;;;;;;;;;;UAkCiB,kBAAkB,UAAU,QAAQ,UAAU,QAAQ,qCAAqC,UAC1G,GACA,GACA;EAEA;EACA;EAEA,KAAK;IAAS;IAAuB;MAAuB,QAAQ,IAAI;;;;;;;;EASxE,YAAY,IAAI;;EAGhB,IAAI,KAAK;;EAGT,SAAS,KAAK;EAEd;EAEA;;iBAGc,qBAAqB,UAAU,QAAQ,UAAU,cAAc,UAAU,aAAa,IACpG,MAAM,GACN,KAAK,QAAQ,QAAQ,GAAG,OAAO,mBAAmB,KACjD,kBAAkB,GAAG;iBACR,qBAAqB,UAAU,QAAQ,UAAU,cAAc,UAAU,aAAa,IACpG,MAAM,GACN,KAAK,QAAQ,QAAQ,GAAG,OAAO,mBAAmB,iBACjD,kBAAkB,GAAG;;;;;;;;;;;;;;;;;;;;;;;cAoCX,sBACX,UAAU,QACV,UAAU,QACV,UAAU,aAAa,IACvB,qCAEQ,qBAAqB,GAAG,cACrB,kBAAkB,GAAG,GAAG,IAAI;;EAc9B,cAAc;UACb;EAJV,YACE,QAAQ,GACR,OAAO,gBACA,cAAc,GACb,KAAK,QAAQ,QAAQ,GAAG,OAAO,mBAAmB,KAAK;EAiB3D,KAAK;IAAS;IAAuB;MAAuB,QAAQ,IAAI;MAsD1E;EAkBJ;UAKQ;MAmCJ,cAAc,IAAI;MAIlB,kBAAkB,IAAI;MAItB,OAAO,IAAI;EAIf,IAAI,GAAG,IAAI;MAIP;EAKJ,QAAQ,QAAQ,IAAI;MAShB;EAIJ;UAMQ;EAOR,OAAO,OAAO,sBAAsB,GAAG,GAAG,GAAG,IAAI,aAAa,GAAG,MAAM;;MAOnE,iBAAiB,WAAW;MAK5B,MAAM,KAAK;MAIX;MAIA,WAAW,KAAK,KAAK;MAIrB;MAIA;;cAQQ;cAKA;EAIZ,YAAY,GAAG,IAAI,KAAK,KAAK;EAI7B;EASM,0BAA0B;EAWhC,QAAQ;IAAS;MAA0B,aAAa;MAQpD;MAIO,aAAa,eAAe;MAI5B;EAIJ;;;;;;;;;;UAeC;cAOI;;;;;EAQZ,mBAAmB,IAAI;GAYtB,YAAY;GACZ,YAAY;GACZ,aAAa;;;iBAIA,oBAAoB,wBAAwB,oBAAoB"}

package/build/relations/ReactiveReference.d.mts

@@ -2,8 +2,8 @@ import { AbstractRelationImpl } from "./AbstractRelationImpl.mjs";
 import { RelationT, RelationU } from "./RelationSymbols.mjs";
 import { ReferenceN } from "./ReferenceSymbols.mjs";
 import { Reference } from "./Reference.mjs";
-import { IsLoadedCachable } from "../IsLoadedCache.mjs";
-import { MaybeReactedEntity, Reacted, ReactiveHint } from "../reactiveHints.mjs";
+import { IsLoadedCachable } from "../loading/IsLoadedCache.mjs";
+import { MaybeReactedEntity, Reacted, ReactiveHint } from "../reactivity/reactiveHints.mjs";
 import { EntityMetadata, ManyToOneField } from "../EntityMetadata.mjs";
 import "../index.mjs";
 import { IdOf, TaggedId } from "../EntityManager.mjs";

package/build/relations/ReactiveReference.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"ReactiveReference.d.mts","names":[],"sources":["../../src/relations/ReactiveReference.ts"],"mappings":";;;;;;;;;;;UA4BiB,kBAAkB,UAAU,QAAQ,UAAU,QAAQ,qCAAqC,UAC1G,GACA,GACA;EAEA;EACA;EAEA,KAAK;IAAS;IAAuB;MAAuB,QAAQ,IAAI;;;;;;;;EASxE,YAAY,IAAI;;EAGhB,IAAI,KAAK;;EAGT,SAAS,KAAK;EAEd;EAEA;;iBAGc,qBAAqB,UAAU,QAAQ,UAAU,cAAc,UAAU,aAAa,IACpG,MAAM,GACN,KAAK,QAAQ,QAAQ,GAAG,OAAO,mBAAmB,KACjD,kBAAkB,GAAG;iBACR,qBAAqB,UAAU,QAAQ,UAAU,cAAc,UAAU,aAAa,IACpG,MAAM,GACN,KAAK,QAAQ,QAAQ,GAAG,OAAO,mBAAmB,iBACjD,kBAAkB,GAAG;;;;;;;;;;;;;;;;;;;;;;;cAoCX,sBACX,UAAU,QACV,UAAU,QACV,UAAU,aAAa,IACvB,qCAEQ,qBAAqB,GAAG,cACrB,kBAAkB,GAAG,GAAG,IAAI;;EAc9B,cAAc;UACb;EAJV,YACE,QAAQ,GACR,OAAO,gBACA,cAAc,GACb,KAAK,QAAQ,QAAQ,GAAG,OAAO,mBAAmB,KAAK;EAiB3D,KAAK;IAAS;IAAuB;MAAuB,QAAQ,IAAI;MAsD1E;EAkBJ;UAKQ;MAmCJ,cAAc,IAAI;MAIlB,kBAAkB,IAAI;MAItB,OAAO,IAAI;EAIf,IAAI,GAAG,IAAI;MAIP;EAKJ,QAAQ,QAAQ,IAAI;MAShB;EAIJ;UAMQ;EAOR,OAAO,OAAO,sBAAsB,GAAG,GAAG,GAAG,IAAI,aAAa,GAAG,MAAM;;MAOnE,iBAAiB,WAAW;MAK5B,MAAM,KAAK;MAIX;MAIA,WAAW,KAAK,KAAK;MAIrB;MAIA;;cAQQ;cAKA;EAIZ,YAAY,GAAG,IAAI,KAAK,KAAK;EAI7B;EASM,0BAA0B;EAWhC,QAAQ;IAAS;MAA0B,aAAa;MAQpD;MAIO,aAAa,eAAe;MAI5B;EAIJ;;;;;;;;;;UAeC;cAOI;;;;;EAQZ,mBAAmB,IAAI;GAYtB,YAAY;GACZ,YAAY;GACZ,aAAa;;;iBAIA,oBAAoB,wBAAwB,oBAAoB"}
+{"version":3,"file":"ReactiveReference.d.mts","names":[],"sources":["../../src/relations/ReactiveReference.ts"],"mappings":";;;;;;;;;;;UAkCiB,kBAAkB,UAAU,QAAQ,UAAU,QAAQ,qCAAqC,UAC1G,GACA,GACA;EAEA;EACA;EAEA,KAAK;IAAS;IAAuB;MAAuB,QAAQ,IAAI;;;;;;;;EASxE,YAAY,IAAI;;EAGhB,IAAI,KAAK;;EAGT,SAAS,KAAK;EAEd;EAEA;;iBAGc,qBAAqB,UAAU,QAAQ,UAAU,cAAc,UAAU,aAAa,IACpG,MAAM,GACN,KAAK,QAAQ,QAAQ,GAAG,OAAO,mBAAmB,KACjD,kBAAkB,GAAG;iBACR,qBAAqB,UAAU,QAAQ,UAAU,cAAc,UAAU,aAAa,IACpG,MAAM,GACN,KAAK,QAAQ,QAAQ,GAAG,OAAO,mBAAmB,iBACjD,kBAAkB,GAAG;;;;;;;;;;;;;;;;;;;;;;;cAoCX,sBACX,UAAU,QACV,UAAU,QACV,UAAU,aAAa,IACvB,qCAEQ,qBAAqB,GAAG,cACrB,kBAAkB,GAAG,GAAG,IAAI;;EAc9B,cAAc;UACb;EAJV,YACE,QAAQ,GACR,OAAO,gBACA,cAAc,GACb,KAAK,QAAQ,QAAQ,GAAG,OAAO,mBAAmB,KAAK;EAiB3D,KAAK;IAAS;IAAuB;MAAuB,QAAQ,IAAI;MAsD1E;EAkBJ;UAKQ;MAmCJ,cAAc,IAAI;MAIlB,kBAAkB,IAAI;MAItB,OAAO,IAAI;EAIf,IAAI,GAAG,IAAI;MAIP;EAKJ,QAAQ,QAAQ,IAAI;MAShB;EAIJ;UAMQ;EAOR,OAAO,OAAO,sBAAsB,GAAG,GAAG,GAAG,IAAI,aAAa,GAAG,MAAM;;MAOnE,iBAAiB,WAAW;MAK5B,MAAM,KAAK;MAIX;MAIA,WAAW,KAAK,KAAK;MAIrB;MAIA;;cAQQ;cAKA;EAIZ,YAAY,GAAG,IAAI,KAAK,KAAK;EAI7B;EASM,0BAA0B;EAWhC,QAAQ;IAAS;MAA0B,aAAa;MAQpD;MAIO,aAAa,eAAe;MAI5B;EAIJ;;;;;;;;;;UAeC;cAOI;;;;;EAQZ,mBAAmB,IAAI;GAYtB,YAAY;GACZ,YAAY;GACZ,aAAa;;;iBAIA,oBAAoB,wBAAwB,oBAAoB"}

package/build/relations/ReactiveReference.js

@@ -1,16 +1,16 @@
-import { lazyField } from "../newEntity.js";
-import { AbstractRelationImpl, isCascadeDelete } from "./AbstractRelationImpl.js";
+import { AbstractRelationImpl } from "./AbstractRelationImpl.js";
 import { RelationT, RelationU } from "./RelationSymbols.js";
 import { ReferenceN } from "./ReferenceSymbols.js";
+import { convertToLoadHint } from "../reactivity/reactiveHints.js";
+import { isLoaded } from "../loading/loadHints.js";
+import { getField, setField } from "../fields.js";
+import { deTagId, maybeResolveReferenceToId, toIdOf } from "../keys.js";
 import "./Reference.js";
-import "../IsLoadedCache.js";
+import { isCascadeDelete } from "./isCascadeDelete.js";
 import { failIfNewEntity, failNoId } from "./ManyToOneReference.js";
-import { deTagId, maybeResolveReferenceToId, toIdOf } from "../keys.js";
-import { getMetadata } from "../EntityMetadata.js";
-import { getField, setField } from "../fields.js";
-import { convertToLoadHint } from "../reactiveHints.js";
-import { isLoaded } from "../loadHints.js";
 import { fail } from "../utils.js";
+import { lazyField } from "../newEntity.js";
+import { getMetadata } from "../EntityMetadata.js";
 import { ensureNotDeleted } from "../index.js";
 import { getEmInternalApi, sameEntity } from "../EntityManager.js";
 import { isEntity } from "../Entity.js";

package/build/relations/ReactiveReference.js.map

@@ -1 +1 @@
-{"version":3,"file":"ReactiveReference.js","names":["#fieldName","#otherMeta","#state","#loadPromise","#isLoaded","#isCached","#rr","#loaded"],"sources":["../../src/relations/ReactiveReference.ts"],"sourcesContent":["import { type Entity } from \"../Entity.ts\";\nimport { type IdOf } from \"../EntityManager.ts\";\nimport { getField, setField } from \"../fields.ts\";\nimport {\n  type EntityMetadata,\n  type ManyToOneField,\n  type TaggedId,\n  deTagId,\n  ensureNotDeleted,\n  fail,\n  getEmInternalApi,\n  getInstanceData,\n  getMetadata,\n  isEntity,\n  isLoaded,\n  maybeResolveReferenceToId,\n  sameEntity,\n  toIdOf,\n} from \"../index.ts\";\nimport { type IsLoadedCachable } from \"../IsLoadedCache.ts\";\nimport { lazyField } from \"../newEntity.ts\";\nimport { type MaybeReactedEntity, type Reacted, type ReactiveHint, convertToLoadHint } from \"../reactiveHints.ts\";\nimport { AbstractRelationImpl, isCascadeDelete } from \"./AbstractRelationImpl.ts\";\nimport { failIfNewEntity, failNoId } from \"./ManyToOneReference.ts\";\nimport { type Reference } from \"./Reference.ts\";\nimport { ReferenceN } from \"./ReferenceSymbols.ts\";\nimport { RelationT, RelationU } from \"./RelationSymbols.ts\";\n\nexport interface ReactiveReference<T extends Entity, U extends Entity, N extends never | undefined> extends Reference<\n  T,\n  U,\n  N\n> {\n  isLoaded: boolean;\n  isSet: boolean;\n\n  load(opts?: { withDeleted?: boolean; forceReload?: true }): Promise<U | N>;\n\n  /**\n   * Returns the as-of-last-flush previously-calculated entity.\n   *\n   * This is useful if you have to purposefully avoid using the lambda to calc the latest entity,\n   * i.e. if you're in a test and want to watch a calculated entity change from some dummy entity\n   * to the new derived entity.\n   * */\n  fieldValue: U | N;\n\n  /** Returns the id of the current assigned entity, or a runtime error if either 1) unset or 2) set to a new entity that doesn't have an `id` yet. */\n  id: IdOf<U>;\n\n  /** Returns the id of the current assigned entity, undefined if unset, or a runtime error if set to a new entity. */\n  idIfSet: IdOf<U> | undefined;\n\n  idUntagged: string;\n\n  idUntaggedIfSet: string | undefined;\n}\n\nexport function hasReactiveReference<T extends Entity, U extends Entity, const H extends ReactiveHint<T>>(\n  hint: H,\n  fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U>,\n): ReactiveReference<T, U, never>;\nexport function hasReactiveReference<T extends Entity, U extends Entity, const H extends ReactiveHint<T>>(\n  hint: H,\n  fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U> | undefined,\n): ReactiveReference<T, U, undefined>;\n/** Creates a `ReactiveReference`. */\nexport function hasReactiveReference<\n  T extends Entity,\n  U extends Entity,\n  const H extends ReactiveHint<T>,\n  N extends never | undefined,\n>(hint: H, fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U> | N): ReactiveReference<T, U, N> {\n  return lazyField((entity: T, fieldName) => {\n    const m2o = getMetadata(entity).allFields[fieldName] as ManyToOneField;\n    return new ReactiveReferenceImpl<T, U, H, N>(entity, m2o, hint, fn);\n  });\n}\n\n/**\n * Implements ReactiveReferences.\n *\n * This is a bit trickier than ReactiveFields, because we have to differentiate our loaded\n * between:\n *\n * - our load hint is loaded, and we can directly calculate the referenced entity, or\n * - we've fetched the calculated/stored entity from the database, but not purposefully\n *   not re-calculating it (which would require fetching the load hint, which might be\n *   expensive, and defeat the point of having our field materialized in the database)\n *\n * Further, want to support all of:\n *\n * - When loaded & `.get` has been called, we cache the value\n *\n * - If a WIP mutation happens, we invalidate `.get` *but* if we check `.isLoaded`,\n *   we can return the live/updated value, without an `await`.\n *\n * - If a WIP mutation happens, we invalidate `.isLoaded`, and if we're *no longer loaded*,\n *   we want to keep returning the stale value (as asserted by the tests), but the next\n *   `load` / `populate` should load the graph & recalculate the value.\n */\nexport class ReactiveReferenceImpl<\n  T extends Entity,\n  U extends Entity,\n  H extends ReactiveHint<T>,\n  N extends never | undefined,\n>\n  extends AbstractRelationImpl<T, U>\n  implements ReactiveReference<T, U, N>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #otherMeta: EntityMetadata;\n  #state: RRState<U, N>;\n  // #isLoaded doesn't necessary care if we're ref-mode or full-mode, it's just\n  // whether a caller can call `.get` and not have it blow up.\n  #isLoaded: boolean | undefined = undefined;\n  #isCached: boolean = false;\n  #loadPromise: Promise<U | N> | undefined;\n\n  constructor(\n    entity: T,\n    field: ManyToOneField,\n    public reactiveHint: H,\n    private fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U> | N,\n  ) {\n    super(entity);\n    // Minimizing changes until the other PR lands...\n    this.#fieldName = field.fieldName as keyof T & string;\n    this.#otherMeta = field.otherMetadata();\n    this.#state = new RRUnloadedState<U, N>(this);\n    // We can be initialized with [entity | id | undefined], and if it's entity or id, then setImpl\n    // will set loaded appropriately; but if we're initialized undefined, then mark loaded here\n    if (entity.isNewEntity) {\n      // const isLoaded = isEntity(this.current()) ? true : undefined;\n    }\n    // If the property transformer is not enabled, then the RR will not be in the relations map because they are\n    // defined in the implementation file and not the codegen file.  So we should insert ourselves regardless.\n    (getInstanceData(entity).relations ??= {})[field.fieldName] = this;\n  }\n\n  async load(opts?: { withDeleted?: boolean; forceReload?: true }): Promise<U | N> {\n    ensureNotDeleted(this.entity, \"pending\");\n    const { loadHint } = this;\n    if (!this.isLoaded || opts?.forceReload) {\n      const { em } = this.entity;\n      // Just because we're not loaded, doesn't mean we necessarily need to load our full hint.\n      // We prefer to load only our previously-calculated/materialized value, and only load the\n      // full load hint if we need recalculated.\n      const maybeDirty = opts?.forceReload || getEmInternalApi(em).rm.isMaybePendingRecalc(this.entity, this.fieldName);\n      if (maybeDirty) {\n        return (this.#loadPromise ??= em\n          .populate(this.entity, { hint: loadHint, ...opts })\n          .then(() => {\n            this.#state = this.#state.enterRecalcMode(this);\n            this.#isLoaded = true;\n            getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n            // Go through `this.get` so that `setField` is called to set our latest value\n            this.#isCached = false;\n            return this.doGet(opts);\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n      } else {\n        // If we don't need a full recalc, just make sure we have the entity in memory\n        // ...ideally we would check `isSet` and whether the key was in the `instanceData`\n        const current = this.current();\n        if (isEntity(current) || current === undefined) {\n          this.#state = new RRRefState<U, N>(this, current as U | N | undefined);\n          this.#isLoaded = true;\n          getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n          return current as U | N;\n        } else {\n          return (this.#loadPromise ??= em\n            .load(this.#otherMeta.cstr, current)\n            .then((loaded) => {\n              this.#state = new RRRefState<U, N>(this, loaded);\n              this.#isLoaded = true;\n              getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n              return loaded;\n            })\n            .finally(() => {\n              this.#loadPromise = undefined;\n            }));\n        }\n      }\n    }\n    // The ReactiveField.load() always sets `#isCached = false`, but our assertion is that our\n    // IsLoadedCache/resetIsLoaded infra is good enough to \"see all invalidating mutations\",\n    // so we don't need this explicit reset.\n    // this.#isCached = false;\n    return this.doGet(opts);\n  }\n\n  get isLoaded(): boolean {\n    // If we've cached an isLoaded value, just use that, see https://github.com/joist-orm/joist-orm/issues/1166\n    if (this.#isLoaded !== undefined) return this.#isLoaded;\n    getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n    // If a WIP mutation has marked our field as potentially dirty, we need to be \"full\" loaded\n    const maybeDirty = getEmInternalApi(this.entity.em).rm.isMaybePendingRecalc(this.entity, this.fieldName);\n    if (maybeDirty) {\n      // If we're dirty, only being \"full\" loaded is good enough to recalc\n      this.#state = this.#state.enterRecalcMode(this);\n      this.#isLoaded = isLoaded(this.entity, this.loadHint);\n      this.#isCached = false;\n    } else {\n      // If we've had `.load` called before, assume we're still loaded\n      this.#isLoaded = this.#state.canReturnValue;\n    }\n    return this.#isLoaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#isLoaded = undefined;\n    this.#isCached = false;\n  }\n\n  private doGet(opts?: { withDeleted?: boolean }): U | N {\n    const { fn } = this;\n    ensureNotDeleted(this.entity, \"pending\");\n    // Fast pass if we've already calculated this (cache invalidation will happen on\n    // any mutation via #resetIsLoaded)..\n    if (this.#isCached) {\n      return this.filterDeleted(this.#state.doGet() as U | N, opts);\n    }\n    // Call isLoaded to probe the load hint, and get `#isLoaded` set, but still have\n    // our `if` check the raw `#isLoaded` to know if we should eval-latest or return `loaded`.\n    if (this.isLoaded && this.#state.kind === \"full\") {\n      const newValue = this.filterDeleted(fn(this.entity as any) as any, opts);\n      // It's cheap to set this every time we're called, i.e. even if it's not the\n      // official \"being called during em.flush\" update (...unless we're accessing it\n      // during the validate phase of `em.flush`, then skip it to avoid tripping up\n      // the \"cannot change entities during flush\" logic.)\n      if (!getEmInternalApi(this.entity.em).isValidating) {\n        this.setImpl(newValue);\n      }\n      this.#state = new RRFullState<U, N>(this, newValue);\n      this.#isCached = true;\n      getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n    } else if (this.#state.canReturnValue) {\n      // We're either in ref mode, or in full mode but not actually fully loaded,\n      // but in theory those states only get set after `.load()` / `.preload()` / import,\n      // so we should have some stored value, even if it's not fully up-to-date.\n      this.#isCached = true;\n      getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n    } else {\n      const noun = this.entity.isNewEntity ? \"derived\" : \"loaded\";\n      throw new Error(`${this.entity}.${this.fieldName} has not been ${noun} yet`);\n    }\n    return this.filterDeleted(this.#state.doGet() as U | N, opts);\n  }\n\n  get fieldValue(): U | N {\n    return getField(this.entity, this.fieldName);\n  }\n\n  get getWithDeleted(): U | N {\n    return this.doGet({ withDeleted: true });\n  }\n\n  get get(): U | N {\n    return this.doGet({ withDeleted: false });\n  }\n\n  set(_: U | N): void {\n    fail(`Cannot set ${this.entity}.${this.fieldName} ReactiveReference directly.`);\n  }\n\n  get isSet(): boolean {\n    return this.current() !== undefined;\n  }\n\n  // Internal method used by OneToManyCollection\n  setImpl(entity: U | N): void {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (sameEntity(entity, this.current({ withDeleted: true }))) {\n      return;\n    }\n    // Prefer to keep the id in our data hash, but if this is a new entity w/o an id, use the entity itself\n    setField(this.entity, this.fieldName, isEntity(entity) ? (entity.idTaggedMaybe ?? entity) : entity);\n  }\n\n  get isPreloaded(): boolean {\n    return !!this.maybeFindEntity();\n  }\n\n  preload(): void {\n    this.#state = new RRRefState<U, N>(this, this.maybeFindEntity());\n    this.#isLoaded = true;\n    this.#isCached = true;\n  }\n\n  private unload(): void {\n    this.#state = new RRUnloadedState<U, N>(this);\n    this.#isLoaded = false;\n    this.#isCached = false;\n    this.#loadPromise = undefined;\n  }\n\n  import(other: ReactiveReferenceImpl<T, U, H, N>, findEntity: (e: U) => U): void {\n    this.#state = other.#state.import(this, findEntity);\n    this.#isLoaded = true;\n    this.#isCached = true;\n  }\n\n  /** Returns the tagged id of the current value. */\n  get idTaggedMaybe(): TaggedId | N {\n    ensureNotDeleted(this.entity, \"pending\");\n    return maybeResolveReferenceToId(this.current()) as TaggedId | N;\n  }\n\n  get id(): IdOf<U> {\n    return this.idMaybe || failNoId(this.entity, this.fieldName, this.current());\n  }\n\n  get idUntagged(): string {\n    return this.idUntaggedMaybe || failNoId(this.entity, this.fieldName, this.current());\n  }\n\n  get idIfSet(): IdOf<U> | N | undefined {\n    return this.idMaybe || failIfNewEntity(this.entity, this.fieldName, this.current());\n  }\n\n  get idUntaggedIfSet(): string | undefined {\n    return this.idUntaggedMaybe || failIfNewEntity(this.entity, this.fieldName, this.current());\n  }\n\n  get loadHint(): any {\n    const meta = getMetadata(this.entity);\n    return (meta.config.__data.cachedReactiveLoadHints[this.fieldName] ??= convertToLoadHint(meta, this.reactiveHint));\n  }\n\n  // private impl\n\n  /** Returns the id of the current value. */\n  private get idMaybe(): IdOf<U> | undefined {\n    ensureNotDeleted(this.entity, \"pending\");\n    return toIdOf(this.otherMeta, this.idTaggedMaybe);\n  }\n\n  private get idUntaggedMaybe(): string | undefined {\n    return deTagId(this.otherMeta, this.idMaybe);\n  }\n\n  setFromOpts(_: U | IdOf<U> | N): void {\n    throw new Error(`ReactiveReference ${this.entity}.${this.fieldName} cannot be set via opts`);\n  }\n\n  maybeCascadeDelete(): void {\n    if (this.isCascadeDelete) {\n      const current = this.current({ withDeleted: true });\n      if (current !== undefined && typeof current !== \"string\") {\n        this.entity.em.delete(current as U);\n      }\n    }\n  }\n\n  async cleanupOnEntityDeleted(): Promise<void> {\n    // if we are going to delete this relation as well, then we don't need to clean it up\n    if (this.isCascadeDelete) return;\n    setField(this.entity, this.fieldName, undefined);\n    this.#state = new RRRefState<U, N>(this, undefined as N);\n    this.#isLoaded = false;\n    this.#isCached = false;\n    this.#loadPromise = undefined;\n  }\n\n  // We need to keep U in data[fieldName] to handle entities without an id assigned yet.\n  current(opts?: { withDeleted?: boolean }): U | string | N {\n    const current = getField(this.entity, this.fieldName);\n    if (current !== undefined && isEntity(current)) {\n      return this.filterDeleted(current as U, opts);\n    }\n    return current;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  public get otherMeta(): EntityMetadata<U> {\n    return (getMetadata(this.entity).allFields[this.#fieldName] as ManyToOneField).otherMetadata();\n  }\n\n  public get hasBeenSet(): boolean {\n    return true;\n  }\n\n  public toString(): string {\n    return `ReactiveReference(entity: ${this.entity}, hint: ${this.loadHint}, fieldName: ${this.fieldName}, otherMeta: {\n      this.otherMeta.type\n    }, id: ${this.id})`;\n  }\n\n  /**\n   * Removes pending-hard-delete (but not soft-deleted), unless explicitly asked for.\n   *\n   * Note that we leave soft-deleted entities b/c the call signature of a `book.author.get`\n   * very likely does not expect a soft-deleted entity to result in `undefined`.\n   *\n   * (Contrasted with `author.books.get` which is more intuitive to have soft-deleted\n   * entities filtered out, i.e. it doesn't fundamentally change the return type.)\n   */\n  private filterDeleted(entity: U | N, opts?: { withDeleted?: boolean }): U | N {\n    if (entity && (!opts || !opts.withDeleted) && entity.isDeletedEntity) {\n      return undefined!;\n    }\n    return entity;\n  }\n\n  private get isCascadeDelete(): boolean {\n    return isCascadeDelete(this, this.#fieldName);\n  }\n\n  /**\n   * Looks for an entity in `EntityManager`, b/c we may have it in memory even if\n   * our reference is not specifically loaded.\n   */\n  maybeFindEntity(): U | N {\n    // Check this.loaded first b/c a new entity won't have an id yet\n    if (this.#state.canReturnValue) {\n      const loaded = this.#state.doGet();\n      if (loaded !== undefined) {\n        return loaded;\n      }\n    }\n    const { idTaggedMaybe } = this;\n    return idTaggedMaybe !== undefined ? (this.entity.em.getEntity(idTaggedMaybe) as U | N) : (undefined as N);\n  }\n\n  [RelationT]: T = null!;\n  [RelationU]: U = null!;\n  [ReferenceN]: N = null!;\n}\n\n/** Type guard utility for determining if an entity field is a ReactiveReference. */\nexport function isReactiveReference(maybeReactiveRef: any): maybeReactiveRef is ReactiveReference<any, any, any> {\n  return maybeReactiveRef instanceof ReactiveReferenceImpl;\n}\n\ninterface RRState<U extends Entity, N extends never | undefined> {\n  readonly kind: \"unloaded\" | \"ref\" | \"full\";\n  readonly canReturnValue: boolean;\n  doGet(): U | N | undefined;\n  /**\n   * Switches from \"materialized ref value\" semantics to \"recalc from reactive graph when available\" semantics.\n   *\n   * This is synchronous because it does not mean the load hint is fully loaded yet. It only means this\n   * reference should now behave as recalc-capable: if `isLoaded(loadHint)` later reports true, `doGet`\n   * will recalculate from `fn(...)`; otherwise we keep returning the last known/stale value until `load()`\n   * populates the graph.\n   */\n  enterRecalcMode(target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N>;\n  import(target: ReactiveReferenceImpl<any, any, any, any>, findEntity: (e: U) => U): RRState<U, N>;\n}\n\nclass RRUnloadedState<U extends Entity, N extends never | undefined> implements RRState<U, N> {\n  readonly kind = \"unloaded\";\n  readonly canReturnValue = false;\n  #rr: ReactiveReferenceImpl<any, any, any, any>;\n\n  constructor(rr: ReactiveReferenceImpl<any, any, any, any>) {\n    this.#rr = rr;\n  }\n\n  doGet(): U | N | undefined {\n    throw new Error(`${this.#rr.entity}.${this.#rr.fieldName} was not loaded`);\n  }\n\n  enterRecalcMode(target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N> {\n    return new RRFullState<U, N>(target, undefined);\n  }\n\n  import(target: ReactiveReferenceImpl<any, any, any, any>, _findEntity: (e: U) => U): RRState<U, N> {\n    return new RRUnloadedState<U, N>(target);\n  }\n}\n\nclass RRRefState<U extends Entity, N extends never | undefined> implements RRState<U, N> {\n  readonly kind = \"ref\";\n  readonly canReturnValue = true;\n  #loaded: U | N | undefined;\n\n  constructor(_rr: ReactiveReferenceImpl<any, any, any, any>, loaded: U | N | undefined) {\n    this.#loaded = loaded;\n  }\n\n  doGet(): U | N | undefined {\n    return this.#loaded;\n  }\n\n  enterRecalcMode(target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N> {\n    return new RRFullState<U, N>(target, this.#loaded);\n  }\n\n  import(target: ReactiveReferenceImpl<any, any, any, any>, findEntity: (e: U) => U): RRState<U, N> {\n    return new RRRefState<U, N>(target, mapReactiveReferenceEntity(this.#loaded, findEntity));\n  }\n}\n\nclass RRFullState<U extends Entity, N extends never | undefined> implements RRState<U, N> {\n  readonly kind = \"full\";\n  readonly canReturnValue = true;\n  #loaded: U | N | undefined;\n\n  constructor(_rr: ReactiveReferenceImpl<any, any, any, any>, loaded: U | N | undefined) {\n    this.#loaded = loaded;\n  }\n\n  doGet(): U | N | undefined {\n    return this.#loaded;\n  }\n\n  enterRecalcMode(_target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N> {\n    return this;\n  }\n\n  import(target: ReactiveReferenceImpl<any, any, any, any>, findEntity: (e: U) => U): RRState<U, N> {\n    return new RRRefState<U, N>(target, mapReactiveReferenceEntity(this.#loaded, findEntity));\n  }\n}\n\nfunction mapReactiveReferenceEntity<U extends Entity, N extends never | undefined>(\n  entity: U | N | undefined,\n  findEntity: (e: U) => U,\n): U | N | undefined {\n  return isEntity(entity) ? findEntity(entity) : entity;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAmEA,SAAgB,qBAKd,MAAS,IAAsF;CAC/F,OAAO,WAAW,QAAW,cAAc;EACzC,MAAM,MAAM,YAAY,MAAM,CAAC,CAAC,UAAU;EAC1C,OAAO,IAAI,sBAAkC,QAAQ,KAAK,MAAM,EAAE;CACpE,CAAC;AACH;;;;;;;;;;;;;;;;;;;;;;;AAwBA,IAAa,wBAAb,cAMU,qBAEV;CAaW;CACC;CAbV;CACA;CACA;CAGA,YAAiC,KAAA;CACjC,YAAqB;CACrB;CAEA,YACE,QACA,OACA,cACA,IACA;EACA,MAAM,MAAM;EAHL,KAAA,eAAA;EACC,KAAA,KAAA;EAIR,KAAKA,aAAa,MAAM;EACxB,KAAKC,aAAa,MAAM,cAAc;EACtC,KAAKC,SAAS,IAAI,gBAAsB,IAAI;EAG5C,IAAI,OAAO,aAAa,CAExB;EAGA,CAAC,gBAAgB,MAAM,CAAC,CAAC,cAAc,CAAC,EAAA,CAAG,MAAM,aAAa;CAChE;CAEA,MAAM,KAAK,MAAsE;EAC/E,iBAAiB,KAAK,QAAQ,SAAS;EACvC,MAAM,EAAE,aAAa;EACrB,IAAI,CAAC,KAAK,YAAY,MAAM,aAAa;GACvC,MAAM,EAAE,OAAO,KAAK;GAKpB,IADmB,MAAM,eAAe,iBAAiB,EAAE,CAAC,CAAC,GAAG,qBAAqB,KAAK,QAAQ,KAAK,SAAS,GAE9G,OAAQ,KAAKC,iBAAiB,GAC3B,SAAS,KAAK,QAAQ;IAAE,MAAM;IAAU,GAAG;GAAK,CAAC,CAAC,CAClD,WAAW;IACV,KAAKD,SAAS,KAAKA,OAAO,gBAAgB,IAAI;IAC9C,KAAKE,YAAY;IACjB,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;IAEvD,KAAKC,YAAY;IACjB,OAAO,KAAK,MAAM,IAAI;GACxB,CAAC,CAAC,CACD,cAAc;IACb,KAAKF,eAAe,KAAA;GACtB,CAAC;QACE;IAGL,MAAM,UAAU,KAAK,QAAQ;IAC7B,IAAI,SAAS,OAAO,KAAK,YAAY,KAAA,GAAW;KAC9C,KAAKD,SAAS,IAAI,WAAiB,MAAM,OAA4B;KACrE,KAAKE,YAAY;KACjB,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;KACvD,OAAO;IACT,OACE,OAAQ,KAAKD,iBAAiB,GAC3B,KAAK,KAAKF,WAAW,MAAM,OAAO,CAAC,CACnC,MAAM,WAAW;KAChB,KAAKC,SAAS,IAAI,WAAiB,MAAM,MAAM;KAC/C,KAAKE,YAAY;KACjB,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;KACvD,OAAO;IACT,CAAC,CAAC,CACD,cAAc;KACb,KAAKD,eAAe,KAAA;IACtB,CAAC;GAEP;EACF;EAKA,OAAO,KAAK,MAAM,IAAI;CACxB;CAEA,IAAI,WAAoB;EAEtB,IAAI,KAAKC,cAAc,KAAA,GAAW,OAAO,KAAKA;EAC9C,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;EAGvD,IADmB,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,GAAG,qBAAqB,KAAK,QAAQ,KAAK,SACjF,GAAG;GAEd,KAAKF,SAAS,KAAKA,OAAO,gBAAgB,IAAI;GAC9C,KAAKE,YAAY,SAAS,KAAK,QAAQ,KAAK,QAAQ;GACpD,KAAKC,YAAY;EACnB,OAEE,KAAKD,YAAY,KAAKF,OAAO;EAE/B,OAAO,KAAKE;CACd;CAEA,gBAAsB;EACpB,KAAKA,YAAY,KAAA;EACjB,KAAKC,YAAY;CACnB;CAEA,MAAc,MAAyC;EACrD,MAAM,EAAE,OAAO;EACf,iBAAiB,KAAK,QAAQ,SAAS;EAGvC,IAAI,KAAKA,WACP,OAAO,KAAK,cAAc,KAAKH,OAAO,MAAM,GAAY,IAAI;EAI9D,IAAI,KAAK,YAAY,KAAKA,OAAO,SAAS,QAAQ;GAChD,MAAM,WAAW,KAAK,cAAc,GAAG,KAAK,MAAa,GAAU,IAAI;GAKvE,IAAI,CAAC,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cACpC,KAAK,QAAQ,QAAQ;GAEvB,KAAKA,SAAS,IAAI,YAAkB,MAAM,QAAQ;GAClD,KAAKG,YAAY;GACjB,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;EACzD,OAAO,IAAI,KAAKH,OAAO,gBAAgB;GAIrC,KAAKG,YAAY;GACjB,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;EACzD,OAAO;GACL,MAAM,OAAO,KAAK,OAAO,cAAc,YAAY;GACnD,MAAM,IAAI,MAAM,GAAG,KAAK,OAAO,GAAG,KAAK,UAAU,gBAAgB,KAAK,KAAK;EAC7E;EACA,OAAO,KAAK,cAAc,KAAKH,OAAO,MAAM,GAAY,IAAI;CAC9D;CAEA,IAAI,aAAoB;EACtB,OAAO,SAAS,KAAK,QAAQ,KAAK,SAAS;CAC7C;CAEA,IAAI,iBAAwB;EAC1B,OAAO,KAAK,MAAM,EAAE,aAAa,KAAK,CAAC;CACzC;CAEA,IAAI,MAAa;EACf,OAAO,KAAK,MAAM,EAAE,aAAa,MAAM,CAAC;CAC1C;CAEA,IAAI,GAAgB;EAClB,KAAK,cAAc,KAAK,OAAO,GAAG,KAAK,UAAU,6BAA6B;CAChF;CAEA,IAAI,QAAiB;EACnB,OAAO,KAAK,QAAQ,MAAM,KAAA;CAC5B;CAGA,QAAQ,QAAqB;EAC3B,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,WAAW,QAAQ,KAAK,QAAQ,EAAE,aAAa,KAAK,CAAC,CAAC,GACxD;EAGF,SAAS,KAAK,QAAQ,KAAK,WAAW,SAAS,MAAM,IAAK,OAAO,iBAAiB,SAAU,MAAM;CACpG;CAEA,IAAI,cAAuB;EACzB,OAAO,CAAC,CAAC,KAAK,gBAAgB;CAChC;CAEA,UAAgB;EACd,KAAKA,SAAS,IAAI,WAAiB,MAAM,KAAK,gBAAgB,CAAC;EAC/D,KAAKE,YAAY;EACjB,KAAKC,YAAY;CACnB;CAEA,SAAuB;EACrB,KAAKH,SAAS,IAAI,gBAAsB,IAAI;EAC5C,KAAKE,YAAY;EACjB,KAAKC,YAAY;EACjB,KAAKF,eAAe,KAAA;CACtB;CAEA,OAAO,OAA0C,YAA+B;EAC9E,KAAKD,SAAS,MAAMA,OAAO,OAAO,MAAM,UAAU;EAClD,KAAKE,YAAY;EACjB,KAAKC,YAAY;CACnB;;CAGA,IAAI,gBAA8B;EAChC,iBAAiB,KAAK,QAAQ,SAAS;EACvC,OAAO,0BAA0B,KAAK,QAAQ,CAAC;CACjD;CAEA,IAAI,KAAc;EAChB,OAAO,KAAK,WAAW,SAAS,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CAC7E;CAEA,IAAI,aAAqB;EACvB,OAAO,KAAK,mBAAmB,SAAS,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CACrF;CAEA,IAAI,UAAmC;EACrC,OAAO,KAAK,WAAW,gBAAgB,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CACpF;CAEA,IAAI,kBAAsC;EACxC,OAAO,KAAK,mBAAmB,gBAAgB,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CAC5F;CAEA,IAAI,WAAgB;EAClB,MAAM,OAAO,YAAY,KAAK,MAAM;EACpC,OAAQ,KAAK,OAAO,OAAO,wBAAwB,KAAK,eAAe,kBAAkB,MAAM,KAAK,YAAY;CAClH;;CAKA,IAAY,UAA+B;EACzC,iBAAiB,KAAK,QAAQ,SAAS;EACvC,OAAO,OAAO,KAAK,WAAW,KAAK,aAAa;CAClD;CAEA,IAAY,kBAAsC;EAChD,OAAO,QAAQ,KAAK,WAAW,KAAK,OAAO;CAC7C;CAEA,YAAY,GAA0B;EACpC,MAAM,IAAI,MAAM,qBAAqB,KAAK,OAAO,GAAG,KAAK,UAAU,wBAAwB;CAC7F;CAEA,qBAA2B;EACzB,IAAI,KAAK,iBAAiB;GACxB,MAAM,UAAU,KAAK,QAAQ,EAAE,aAAa,KAAK,CAAC;GAClD,IAAI,YAAY,KAAA,KAAa,OAAO,YAAY,UAC9C,KAAK,OAAO,GAAG,OAAO,OAAY;EAEtC;CACF;CAEA,MAAM,yBAAwC;EAE5C,IAAI,KAAK,iBAAiB;EAC1B,SAAS,KAAK,QAAQ,KAAK,WAAW,KAAA,CAAS;EAC/C,KAAKH,SAAS,IAAI,WAAiB,MAAM,KAAA,CAAc;EACvD,KAAKE,YAAY;EACjB,KAAKC,YAAY;EACjB,KAAKF,eAAe,KAAA;CACtB;CAGA,QAAQ,MAAkD;EACxD,MAAM,UAAU,SAAS,KAAK,QAAQ,KAAK,SAAS;EACpD,IAAI,YAAY,KAAA,KAAa,SAAS,OAAO,GAC3C,OAAO,KAAK,cAAc,SAAc,IAAI;EAE9C,OAAO;CACT;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKH;CACd;CAEA,IAAW,YAA+B;EACxC,OAAQ,YAAY,KAAK,MAAM,CAAC,CAAC,UAAU,KAAKA,WAAW,CAAoB,cAAc;CAC/F;CAEA,IAAW,aAAsB;EAC/B,OAAO;CACT;CAEA,WAA0B;EACxB,OAAO,6BAA6B,KAAK,OAAO,UAAU,KAAK,SAAS,eAAe,KAAK,UAAU;;aAE7F,KAAK,GAAG;CACnB;;;;;;;;;;CAWA,cAAsB,QAAe,MAAyC;EAC5E,IAAI,WAAW,CAAC,QAAQ,CAAC,KAAK,gBAAgB,OAAO,iBACnD;EAEF,OAAO;CACT;CAEA,IAAY,kBAA2B;EACrC,OAAO,gBAAgB,MAAM,KAAKA,UAAU;CAC9C;;;;;CAMA,kBAAyB;EAEvB,IAAI,KAAKE,OAAO,gBAAgB;GAC9B,MAAM,SAAS,KAAKA,OAAO,MAAM;GACjC,IAAI,WAAW,KAAA,GACb,OAAO;EAEX;EACA,MAAM,EAAE,kBAAkB;EAC1B,OAAO,kBAAkB,KAAA,IAAa,KAAK,OAAO,GAAG,UAAU,aAAa,IAAe,KAAA;CAC7F;CAEA,CAAC,aAAgB;CACjB,CAAC,aAAgB;CACjB,CAAC,cAAiB;AACpB;;AAGA,SAAgB,oBAAoB,kBAA6E;CAC/G,OAAO,4BAA4B;AACrC;AAkBA,IAAM,kBAAN,MAAM,gBAAwF;CAC5F,OAAgB;CAChB,iBAA0B;CAC1B;CAEA,YAAY,IAA+C;EACzD,KAAKI,MAAM;CACb;CAEA,QAA2B;EACzB,MAAM,IAAI,MAAM,GAAG,KAAKA,IAAI,OAAO,GAAG,KAAKA,IAAI,UAAU,gBAAgB;CAC3E;CAEA,gBAAgB,QAAsE;EACpF,OAAO,IAAI,YAAkB,QAAQ,KAAA,CAAS;CAChD;CAEA,OAAO,QAAmD,aAAyC;EACjG,OAAO,IAAI,gBAAsB,MAAM;CACzC;AACF;AAEA,IAAM,aAAN,MAAM,WAAmF;CACvF,OAAgB;CAChB,iBAA0B;CAC1B;CAEA,YAAY,KAAgD,QAA2B;EACrF,KAAKC,UAAU;CACjB;CAEA,QAA2B;EACzB,OAAO,KAAKA;CACd;CAEA,gBAAgB,QAAsE;EACpF,OAAO,IAAI,YAAkB,QAAQ,KAAKA,OAAO;CACnD;CAEA,OAAO,QAAmD,YAAwC;EAChG,OAAO,IAAI,WAAiB,QAAQ,2BAA2B,KAAKA,SAAS,UAAU,CAAC;CAC1F;AACF;AAEA,IAAM,cAAN,MAA0F;CACxF,OAAgB;CAChB,iBAA0B;CAC1B;CAEA,YAAY,KAAgD,QAA2B;EACrF,KAAKA,UAAU;CACjB;CAEA,QAA2B;EACzB,OAAO,KAAKA;CACd;CAEA,gBAAgB,SAAuE;EACrF,OAAO;CACT;CAEA,OAAO,QAAmD,YAAwC;EAChG,OAAO,IAAI,WAAiB,QAAQ,2BAA2B,KAAKA,SAAS,UAAU,CAAC;CAC1F;AACF;AAEA,SAAS,2BACP,QACA,YACmB;CACnB,OAAO,SAAS,MAAM,IAAI,WAAW,MAAM,IAAI;AACjD"}
+{"version":3,"file":"ReactiveReference.js","names":["#fieldName","#otherMeta","#state","#loadPromise","#isLoaded","#isCached","#rr","#loaded"],"sources":["../../src/relations/ReactiveReference.ts"],"sourcesContent":["import { type Entity } from \"../Entity.ts\";\nimport { type IdOf } from \"../EntityManager.ts\";\nimport { getField, setField } from \"../fields.ts\";\nimport {\n  type EntityMetadata,\n  type ManyToOneField,\n  type TaggedId,\n  deTagId,\n  ensureNotDeleted,\n  fail,\n  getEmInternalApi,\n  getInstanceData,\n  getMetadata,\n  isEntity,\n  isLoaded,\n  maybeResolveReferenceToId,\n  sameEntity,\n  toIdOf,\n} from \"../index.ts\";\nimport type { IsLoadedCachable } from \"../loading/IsLoadedCache.ts\";\nimport { lazyField } from \"../newEntity.ts\";\nimport {\n  type MaybeReactedEntity,\n  type Reacted,\n  type ReactiveHint,\n  convertToLoadHint,\n} from \"../reactivity/reactiveHints.ts\";\nimport { AbstractRelationImpl } from \"./AbstractRelationImpl.ts\";\nimport { isCascadeDelete } from \"./isCascadeDelete.ts\";\nimport { failIfNewEntity, failNoId } from \"./ManyToOneReference.ts\";\nimport { type Reference } from \"./Reference.ts\";\nimport { ReferenceN } from \"./ReferenceSymbols.ts\";\nimport { RelationT, RelationU } from \"./RelationSymbols.ts\";\n\nexport interface ReactiveReference<T extends Entity, U extends Entity, N extends never | undefined> extends Reference<\n  T,\n  U,\n  N\n> {\n  isLoaded: boolean;\n  isSet: boolean;\n\n  load(opts?: { withDeleted?: boolean; forceReload?: true }): Promise<U | N>;\n\n  /**\n   * Returns the as-of-last-flush previously-calculated entity.\n   *\n   * This is useful if you have to purposefully avoid using the lambda to calc the latest entity,\n   * i.e. if you're in a test and want to watch a calculated entity change from some dummy entity\n   * to the new derived entity.\n   * */\n  fieldValue: U | N;\n\n  /** Returns the id of the current assigned entity, or a runtime error if either 1) unset or 2) set to a new entity that doesn't have an `id` yet. */\n  id: IdOf<U>;\n\n  /** Returns the id of the current assigned entity, undefined if unset, or a runtime error if set to a new entity. */\n  idIfSet: IdOf<U> | undefined;\n\n  idUntagged: string;\n\n  idUntaggedIfSet: string | undefined;\n}\n\nexport function hasReactiveReference<T extends Entity, U extends Entity, const H extends ReactiveHint<T>>(\n  hint: H,\n  fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U>,\n): ReactiveReference<T, U, never>;\nexport function hasReactiveReference<T extends Entity, U extends Entity, const H extends ReactiveHint<T>>(\n  hint: H,\n  fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U> | undefined,\n): ReactiveReference<T, U, undefined>;\n/** Creates a `ReactiveReference`. */\nexport function hasReactiveReference<\n  T extends Entity,\n  U extends Entity,\n  const H extends ReactiveHint<T>,\n  N extends never | undefined,\n>(hint: H, fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U> | N): ReactiveReference<T, U, N> {\n  return lazyField((entity: T, fieldName) => {\n    const m2o = getMetadata(entity).allFields[fieldName] as ManyToOneField;\n    return new ReactiveReferenceImpl<T, U, H, N>(entity, m2o, hint, fn);\n  });\n}\n\n/**\n * Implements ReactiveReferences.\n *\n * This is a bit trickier than ReactiveFields, because we have to differentiate our loaded\n * between:\n *\n * - our load hint is loaded, and we can directly calculate the referenced entity, or\n * - we've fetched the calculated/stored entity from the database, but not purposefully\n *   not re-calculating it (which would require fetching the load hint, which might be\n *   expensive, and defeat the point of having our field materialized in the database)\n *\n * Further, want to support all of:\n *\n * - When loaded & `.get` has been called, we cache the value\n *\n * - If a WIP mutation happens, we invalidate `.get` *but* if we check `.isLoaded`,\n *   we can return the live/updated value, without an `await`.\n *\n * - If a WIP mutation happens, we invalidate `.isLoaded`, and if we're *no longer loaded*,\n *   we want to keep returning the stale value (as asserted by the tests), but the next\n *   `load` / `populate` should load the graph & recalculate the value.\n */\nexport class ReactiveReferenceImpl<\n  T extends Entity,\n  U extends Entity,\n  H extends ReactiveHint<T>,\n  N extends never | undefined,\n>\n  extends AbstractRelationImpl<T, U>\n  implements ReactiveReference<T, U, N>, IsLoadedCachable\n{\n  readonly #fieldName: keyof T & string;\n  readonly #otherMeta: EntityMetadata;\n  #state: RRState<U, N>;\n  // #isLoaded doesn't necessary care if we're ref-mode or full-mode, it's just\n  // whether a caller can call `.get` and not have it blow up.\n  #isLoaded: boolean | undefined = undefined;\n  #isCached: boolean = false;\n  #loadPromise: Promise<U | N> | undefined;\n\n  constructor(\n    entity: T,\n    field: ManyToOneField,\n    public reactiveHint: H,\n    private fn: (entity: Reacted<T, H>) => MaybeReactedEntity<U> | N,\n  ) {\n    super(entity);\n    // Minimizing changes until the other PR lands...\n    this.#fieldName = field.fieldName as keyof T & string;\n    this.#otherMeta = field.otherMetadata();\n    this.#state = new RRUnloadedState<U, N>(this);\n    // We can be initialized with [entity | id | undefined], and if it's entity or id, then setImpl\n    // will set loaded appropriately; but if we're initialized undefined, then mark loaded here\n    if (entity.isNewEntity) {\n      // const isLoaded = isEntity(this.current()) ? true : undefined;\n    }\n    // If the property transformer is not enabled, then the RR will not be in the relations map because they are\n    // defined in the implementation file and not the codegen file.  So we should insert ourselves regardless.\n    (getInstanceData(entity).relations ??= {})[field.fieldName] = this;\n  }\n\n  async load(opts?: { withDeleted?: boolean; forceReload?: true }): Promise<U | N> {\n    ensureNotDeleted(this.entity, \"pending\");\n    const { loadHint } = this;\n    if (!this.isLoaded || opts?.forceReload) {\n      const { em } = this.entity;\n      // Just because we're not loaded, doesn't mean we necessarily need to load our full hint.\n      // We prefer to load only our previously-calculated/materialized value, and only load the\n      // full load hint if we need recalculated.\n      const maybeDirty = opts?.forceReload || getEmInternalApi(em).rm.isMaybePendingRecalc(this.entity, this.fieldName);\n      if (maybeDirty) {\n        return (this.#loadPromise ??= em\n          .populate(this.entity, { hint: loadHint, ...opts })\n          .then(() => {\n            this.#state = this.#state.enterRecalcMode(this);\n            this.#isLoaded = true;\n            getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n            // Go through `this.get` so that `setField` is called to set our latest value\n            this.#isCached = false;\n            return this.doGet(opts);\n          })\n          .finally(() => {\n            this.#loadPromise = undefined;\n          }));\n      } else {\n        // If we don't need a full recalc, just make sure we have the entity in memory\n        // ...ideally we would check `isSet` and whether the key was in the `instanceData`\n        const current = this.current();\n        if (isEntity(current) || current === undefined) {\n          this.#state = new RRRefState<U, N>(this, current as U | N | undefined);\n          this.#isLoaded = true;\n          getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n          return current as U | N;\n        } else {\n          return (this.#loadPromise ??= em\n            .load(this.#otherMeta.cstr, current)\n            .then((loaded) => {\n              this.#state = new RRRefState<U, N>(this, loaded);\n              this.#isLoaded = true;\n              getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n              return loaded;\n            })\n            .finally(() => {\n              this.#loadPromise = undefined;\n            }));\n        }\n      }\n    }\n    // The ReactiveField.load() always sets `#isCached = false`, but our assertion is that our\n    // IsLoadedCache/resetIsLoaded infra is good enough to \"see all invalidating mutations\",\n    // so we don't need this explicit reset.\n    // this.#isCached = false;\n    return this.doGet(opts);\n  }\n\n  get isLoaded(): boolean {\n    // If we've cached an isLoaded value, just use that, see https://github.com/joist-orm/joist-orm/issues/1166\n    if (this.#isLoaded !== undefined) return this.#isLoaded;\n    getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n    // If a WIP mutation has marked our field as potentially dirty, we need to be \"full\" loaded\n    const maybeDirty = getEmInternalApi(this.entity.em).rm.isMaybePendingRecalc(this.entity, this.fieldName);\n    if (maybeDirty) {\n      // If we're dirty, only being \"full\" loaded is good enough to recalc\n      this.#state = this.#state.enterRecalcMode(this);\n      this.#isLoaded = isLoaded(this.entity, this.loadHint);\n      this.#isCached = false;\n    } else {\n      // If we've had `.load` called before, assume we're still loaded\n      this.#isLoaded = this.#state.canReturnValue;\n    }\n    return this.#isLoaded;\n  }\n\n  resetIsLoaded(): void {\n    this.#isLoaded = undefined;\n    this.#isCached = false;\n  }\n\n  private doGet(opts?: { withDeleted?: boolean }): U | N {\n    const { fn } = this;\n    ensureNotDeleted(this.entity, \"pending\");\n    // Fast pass if we've already calculated this (cache invalidation will happen on\n    // any mutation via #resetIsLoaded)..\n    if (this.#isCached) {\n      return this.filterDeleted(this.#state.doGet() as U | N, opts);\n    }\n    // Call isLoaded to probe the load hint, and get `#isLoaded` set, but still have\n    // our `if` check the raw `#isLoaded` to know if we should eval-latest or return `loaded`.\n    if (this.isLoaded && this.#state.kind === \"full\") {\n      const newValue = this.filterDeleted(fn(this.entity as any) as any, opts);\n      // It's cheap to set this every time we're called, i.e. even if it's not the\n      // official \"being called during em.flush\" update (...unless we're accessing it\n      // during the validate phase of `em.flush`, then skip it to avoid tripping up\n      // the \"cannot change entities during flush\" logic.)\n      if (!getEmInternalApi(this.entity.em).isValidating) {\n        this.setImpl(newValue);\n      }\n      this.#state = new RRFullState<U, N>(this, newValue);\n      this.#isCached = true;\n      getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n    } else if (this.#state.canReturnValue) {\n      // We're either in ref mode, or in full mode but not actually fully loaded,\n      // but in theory those states only get set after `.load()` / `.preload()` / import,\n      // so we should have some stored value, even if it's not fully up-to-date.\n      this.#isCached = true;\n      getEmInternalApi(this.entity.em).isLoadedCache.add(this);\n    } else {\n      const noun = this.entity.isNewEntity ? \"derived\" : \"loaded\";\n      throw new Error(`${this.entity}.${this.fieldName} has not been ${noun} yet`);\n    }\n    return this.filterDeleted(this.#state.doGet() as U | N, opts);\n  }\n\n  get fieldValue(): U | N {\n    return getField(this.entity, this.fieldName);\n  }\n\n  get getWithDeleted(): U | N {\n    return this.doGet({ withDeleted: true });\n  }\n\n  get get(): U | N {\n    return this.doGet({ withDeleted: false });\n  }\n\n  set(_: U | N): void {\n    fail(`Cannot set ${this.entity}.${this.fieldName} ReactiveReference directly.`);\n  }\n\n  get isSet(): boolean {\n    return this.current() !== undefined;\n  }\n\n  // Internal method used by OneToManyCollection\n  setImpl(entity: U | N): void {\n    ensureNotDeleted(this.entity, \"pending\");\n    if (sameEntity(entity, this.current({ withDeleted: true }))) {\n      return;\n    }\n    // Prefer to keep the id in our data hash, but if this is a new entity w/o an id, use the entity itself\n    setField(this.entity, this.fieldName, isEntity(entity) ? (entity.idTaggedMaybe ?? entity) : entity);\n  }\n\n  get isPreloaded(): boolean {\n    return !!this.maybeFindEntity();\n  }\n\n  preload(): void {\n    this.#state = new RRRefState<U, N>(this, this.maybeFindEntity());\n    this.#isLoaded = true;\n    this.#isCached = true;\n  }\n\n  private unload(): void {\n    this.#state = new RRUnloadedState<U, N>(this);\n    this.#isLoaded = false;\n    this.#isCached = false;\n    this.#loadPromise = undefined;\n  }\n\n  import(other: ReactiveReferenceImpl<T, U, H, N>, findEntity: (e: U) => U): void {\n    this.#state = other.#state.import(this, findEntity);\n    this.#isLoaded = true;\n    this.#isCached = true;\n  }\n\n  /** Returns the tagged id of the current value. */\n  get idTaggedMaybe(): TaggedId | N {\n    ensureNotDeleted(this.entity, \"pending\");\n    return maybeResolveReferenceToId(this.current()) as TaggedId | N;\n  }\n\n  get id(): IdOf<U> {\n    return this.idMaybe || failNoId(this.entity, this.fieldName, this.current());\n  }\n\n  get idUntagged(): string {\n    return this.idUntaggedMaybe || failNoId(this.entity, this.fieldName, this.current());\n  }\n\n  get idIfSet(): IdOf<U> | N | undefined {\n    return this.idMaybe || failIfNewEntity(this.entity, this.fieldName, this.current());\n  }\n\n  get idUntaggedIfSet(): string | undefined {\n    return this.idUntaggedMaybe || failIfNewEntity(this.entity, this.fieldName, this.current());\n  }\n\n  get loadHint(): any {\n    const meta = getMetadata(this.entity);\n    return (meta.config.__data.cachedReactiveLoadHints[this.fieldName] ??= convertToLoadHint(meta, this.reactiveHint));\n  }\n\n  // private impl\n\n  /** Returns the id of the current value. */\n  private get idMaybe(): IdOf<U> | undefined {\n    ensureNotDeleted(this.entity, \"pending\");\n    return toIdOf(this.otherMeta, this.idTaggedMaybe);\n  }\n\n  private get idUntaggedMaybe(): string | undefined {\n    return deTagId(this.otherMeta, this.idMaybe);\n  }\n\n  setFromOpts(_: U | IdOf<U> | N): void {\n    throw new Error(`ReactiveReference ${this.entity}.${this.fieldName} cannot be set via opts`);\n  }\n\n  maybeCascadeDelete(): void {\n    if (this.isCascadeDelete) {\n      const current = this.current({ withDeleted: true });\n      if (current !== undefined && typeof current !== \"string\") {\n        this.entity.em.delete(current as U);\n      }\n    }\n  }\n\n  async cleanupOnEntityDeleted(): Promise<void> {\n    // if we are going to delete this relation as well, then we don't need to clean it up\n    if (this.isCascadeDelete) return;\n    setField(this.entity, this.fieldName, undefined);\n    this.#state = new RRRefState<U, N>(this, undefined as N);\n    this.#isLoaded = false;\n    this.#isCached = false;\n    this.#loadPromise = undefined;\n  }\n\n  // We need to keep U in data[fieldName] to handle entities without an id assigned yet.\n  current(opts?: { withDeleted?: boolean }): U | string | N {\n    const current = getField(this.entity, this.fieldName);\n    if (current !== undefined && isEntity(current)) {\n      return this.filterDeleted(current as U, opts);\n    }\n    return current;\n  }\n\n  get fieldName(): string {\n    return this.#fieldName;\n  }\n\n  public get otherMeta(): EntityMetadata<U> {\n    return (getMetadata(this.entity).allFields[this.#fieldName] as ManyToOneField).otherMetadata();\n  }\n\n  public get hasBeenSet(): boolean {\n    return true;\n  }\n\n  public toString(): string {\n    return `ReactiveReference(entity: ${this.entity}, hint: ${this.loadHint}, fieldName: ${this.fieldName}, otherMeta: {\n      this.otherMeta.type\n    }, id: ${this.id})`;\n  }\n\n  /**\n   * Removes pending-hard-delete (but not soft-deleted), unless explicitly asked for.\n   *\n   * Note that we leave soft-deleted entities b/c the call signature of a `book.author.get`\n   * very likely does not expect a soft-deleted entity to result in `undefined`.\n   *\n   * (Contrasted with `author.books.get` which is more intuitive to have soft-deleted\n   * entities filtered out, i.e. it doesn't fundamentally change the return type.)\n   */\n  private filterDeleted(entity: U | N, opts?: { withDeleted?: boolean }): U | N {\n    if (entity && (!opts || !opts.withDeleted) && entity.isDeletedEntity) {\n      return undefined!;\n    }\n    return entity;\n  }\n\n  private get isCascadeDelete(): boolean {\n    return isCascadeDelete(this, this.#fieldName);\n  }\n\n  /**\n   * Looks for an entity in `EntityManager`, b/c we may have it in memory even if\n   * our reference is not specifically loaded.\n   */\n  maybeFindEntity(): U | N {\n    // Check this.loaded first b/c a new entity won't have an id yet\n    if (this.#state.canReturnValue) {\n      const loaded = this.#state.doGet();\n      if (loaded !== undefined) {\n        return loaded;\n      }\n    }\n    const { idTaggedMaybe } = this;\n    return idTaggedMaybe !== undefined ? (this.entity.em.getEntity(idTaggedMaybe) as U | N) : (undefined as N);\n  }\n\n  [RelationT]: T = null!;\n  [RelationU]: U = null!;\n  [ReferenceN]: N = null!;\n}\n\n/** Type guard utility for determining if an entity field is a ReactiveReference. */\nexport function isReactiveReference(maybeReactiveRef: any): maybeReactiveRef is ReactiveReference<any, any, any> {\n  return maybeReactiveRef instanceof ReactiveReferenceImpl;\n}\n\ninterface RRState<U extends Entity, N extends never | undefined> {\n  readonly kind: \"unloaded\" | \"ref\" | \"full\";\n  readonly canReturnValue: boolean;\n  doGet(): U | N | undefined;\n  /**\n   * Switches from \"materialized ref value\" semantics to \"recalc from reactive graph when available\" semantics.\n   *\n   * This is synchronous because it does not mean the load hint is fully loaded yet. It only means this\n   * reference should now behave as recalc-capable: if `isLoaded(loadHint)` later reports true, `doGet`\n   * will recalculate from `fn(...)`; otherwise we keep returning the last known/stale value until `load()`\n   * populates the graph.\n   */\n  enterRecalcMode(target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N>;\n  import(target: ReactiveReferenceImpl<any, any, any, any>, findEntity: (e: U) => U): RRState<U, N>;\n}\n\nclass RRUnloadedState<U extends Entity, N extends never | undefined> implements RRState<U, N> {\n  readonly kind = \"unloaded\";\n  readonly canReturnValue = false;\n  #rr: ReactiveReferenceImpl<any, any, any, any>;\n\n  constructor(rr: ReactiveReferenceImpl<any, any, any, any>) {\n    this.#rr = rr;\n  }\n\n  doGet(): U | N | undefined {\n    throw new Error(`${this.#rr.entity}.${this.#rr.fieldName} was not loaded`);\n  }\n\n  enterRecalcMode(target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N> {\n    return new RRFullState<U, N>(target, undefined);\n  }\n\n  import(target: ReactiveReferenceImpl<any, any, any, any>, _findEntity: (e: U) => U): RRState<U, N> {\n    return new RRUnloadedState<U, N>(target);\n  }\n}\n\nclass RRRefState<U extends Entity, N extends never | undefined> implements RRState<U, N> {\n  readonly kind = \"ref\";\n  readonly canReturnValue = true;\n  #loaded: U | N | undefined;\n\n  constructor(_rr: ReactiveReferenceImpl<any, any, any, any>, loaded: U | N | undefined) {\n    this.#loaded = loaded;\n  }\n\n  doGet(): U | N | undefined {\n    return this.#loaded;\n  }\n\n  enterRecalcMode(target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N> {\n    return new RRFullState<U, N>(target, this.#loaded);\n  }\n\n  import(target: ReactiveReferenceImpl<any, any, any, any>, findEntity: (e: U) => U): RRState<U, N> {\n    return new RRRefState<U, N>(target, mapReactiveReferenceEntity(this.#loaded, findEntity));\n  }\n}\n\nclass RRFullState<U extends Entity, N extends never | undefined> implements RRState<U, N> {\n  readonly kind = \"full\";\n  readonly canReturnValue = true;\n  #loaded: U | N | undefined;\n\n  constructor(_rr: ReactiveReferenceImpl<any, any, any, any>, loaded: U | N | undefined) {\n    this.#loaded = loaded;\n  }\n\n  doGet(): U | N | undefined {\n    return this.#loaded;\n  }\n\n  enterRecalcMode(_target: ReactiveReferenceImpl<any, any, any, any>): RRFullState<U, N> {\n    return this;\n  }\n\n  import(target: ReactiveReferenceImpl<any, any, any, any>, findEntity: (e: U) => U): RRState<U, N> {\n    return new RRRefState<U, N>(target, mapReactiveReferenceEntity(this.#loaded, findEntity));\n  }\n}\n\nfunction mapReactiveReferenceEntity<U extends Entity, N extends never | undefined>(\n  entity: U | N | undefined,\n  findEntity: (e: U) => U,\n): U | N | undefined {\n  return isEntity(entity) ? findEntity(entity) : entity;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAyEA,SAAgB,qBAKd,MAAS,IAAsF;CAC/F,OAAO,WAAW,QAAW,cAAc;EACzC,MAAM,MAAM,YAAY,MAAM,CAAC,CAAC,UAAU;EAC1C,OAAO,IAAI,sBAAkC,QAAQ,KAAK,MAAM,EAAE;CACpE,CAAC;AACH;;;;;;;;;;;;;;;;;;;;;;;AAwBA,IAAa,wBAAb,cAMU,qBAEV;CAaW;CACC;CAbV;CACA;CACA;CAGA,YAAiC,KAAA;CACjC,YAAqB;CACrB;CAEA,YACE,QACA,OACA,cACA,IACA;EACA,MAAM,MAAM;EAHL,KAAA,eAAA;EACC,KAAA,KAAA;EAIR,KAAKA,aAAa,MAAM;EACxB,KAAKC,aAAa,MAAM,cAAc;EACtC,KAAKC,SAAS,IAAI,gBAAsB,IAAI;EAG5C,IAAI,OAAO,aAAa,CAExB;EAGA,CAAC,gBAAgB,MAAM,CAAC,CAAC,cAAc,CAAC,EAAA,CAAG,MAAM,aAAa;CAChE;CAEA,MAAM,KAAK,MAAsE;EAC/E,iBAAiB,KAAK,QAAQ,SAAS;EACvC,MAAM,EAAE,aAAa;EACrB,IAAI,CAAC,KAAK,YAAY,MAAM,aAAa;GACvC,MAAM,EAAE,OAAO,KAAK;GAKpB,IADmB,MAAM,eAAe,iBAAiB,EAAE,CAAC,CAAC,GAAG,qBAAqB,KAAK,QAAQ,KAAK,SAAS,GAE9G,OAAQ,KAAKC,iBAAiB,GAC3B,SAAS,KAAK,QAAQ;IAAE,MAAM;IAAU,GAAG;GAAK,CAAC,CAAC,CAClD,WAAW;IACV,KAAKD,SAAS,KAAKA,OAAO,gBAAgB,IAAI;IAC9C,KAAKE,YAAY;IACjB,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;IAEvD,KAAKC,YAAY;IACjB,OAAO,KAAK,MAAM,IAAI;GACxB,CAAC,CAAC,CACD,cAAc;IACb,KAAKF,eAAe,KAAA;GACtB,CAAC;QACE;IAGL,MAAM,UAAU,KAAK,QAAQ;IAC7B,IAAI,SAAS,OAAO,KAAK,YAAY,KAAA,GAAW;KAC9C,KAAKD,SAAS,IAAI,WAAiB,MAAM,OAA4B;KACrE,KAAKE,YAAY;KACjB,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;KACvD,OAAO;IACT,OACE,OAAQ,KAAKD,iBAAiB,GAC3B,KAAK,KAAKF,WAAW,MAAM,OAAO,CAAC,CACnC,MAAM,WAAW;KAChB,KAAKC,SAAS,IAAI,WAAiB,MAAM,MAAM;KAC/C,KAAKE,YAAY;KACjB,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;KACvD,OAAO;IACT,CAAC,CAAC,CACD,cAAc;KACb,KAAKD,eAAe,KAAA;IACtB,CAAC;GAEP;EACF;EAKA,OAAO,KAAK,MAAM,IAAI;CACxB;CAEA,IAAI,WAAoB;EAEtB,IAAI,KAAKC,cAAc,KAAA,GAAW,OAAO,KAAKA;EAC9C,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;EAGvD,IADmB,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,GAAG,qBAAqB,KAAK,QAAQ,KAAK,SACjF,GAAG;GAEd,KAAKF,SAAS,KAAKA,OAAO,gBAAgB,IAAI;GAC9C,KAAKE,YAAY,SAAS,KAAK,QAAQ,KAAK,QAAQ;GACpD,KAAKC,YAAY;EACnB,OAEE,KAAKD,YAAY,KAAKF,OAAO;EAE/B,OAAO,KAAKE;CACd;CAEA,gBAAsB;EACpB,KAAKA,YAAY,KAAA;EACjB,KAAKC,YAAY;CACnB;CAEA,MAAc,MAAyC;EACrD,MAAM,EAAE,OAAO;EACf,iBAAiB,KAAK,QAAQ,SAAS;EAGvC,IAAI,KAAKA,WACP,OAAO,KAAK,cAAc,KAAKH,OAAO,MAAM,GAAY,IAAI;EAI9D,IAAI,KAAK,YAAY,KAAKA,OAAO,SAAS,QAAQ;GAChD,MAAM,WAAW,KAAK,cAAc,GAAG,KAAK,MAAa,GAAU,IAAI;GAKvE,IAAI,CAAC,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cACpC,KAAK,QAAQ,QAAQ;GAEvB,KAAKA,SAAS,IAAI,YAAkB,MAAM,QAAQ;GAClD,KAAKG,YAAY;GACjB,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;EACzD,OAAO,IAAI,KAAKH,OAAO,gBAAgB;GAIrC,KAAKG,YAAY;GACjB,iBAAiB,KAAK,OAAO,EAAE,CAAC,CAAC,cAAc,IAAI,IAAI;EACzD,OAAO;GACL,MAAM,OAAO,KAAK,OAAO,cAAc,YAAY;GACnD,MAAM,IAAI,MAAM,GAAG,KAAK,OAAO,GAAG,KAAK,UAAU,gBAAgB,KAAK,KAAK;EAC7E;EACA,OAAO,KAAK,cAAc,KAAKH,OAAO,MAAM,GAAY,IAAI;CAC9D;CAEA,IAAI,aAAoB;EACtB,OAAO,SAAS,KAAK,QAAQ,KAAK,SAAS;CAC7C;CAEA,IAAI,iBAAwB;EAC1B,OAAO,KAAK,MAAM,EAAE,aAAa,KAAK,CAAC;CACzC;CAEA,IAAI,MAAa;EACf,OAAO,KAAK,MAAM,EAAE,aAAa,MAAM,CAAC;CAC1C;CAEA,IAAI,GAAgB;EAClB,KAAK,cAAc,KAAK,OAAO,GAAG,KAAK,UAAU,6BAA6B;CAChF;CAEA,IAAI,QAAiB;EACnB,OAAO,KAAK,QAAQ,MAAM,KAAA;CAC5B;CAGA,QAAQ,QAAqB;EAC3B,iBAAiB,KAAK,QAAQ,SAAS;EACvC,IAAI,WAAW,QAAQ,KAAK,QAAQ,EAAE,aAAa,KAAK,CAAC,CAAC,GACxD;EAGF,SAAS,KAAK,QAAQ,KAAK,WAAW,SAAS,MAAM,IAAK,OAAO,iBAAiB,SAAU,MAAM;CACpG;CAEA,IAAI,cAAuB;EACzB,OAAO,CAAC,CAAC,KAAK,gBAAgB;CAChC;CAEA,UAAgB;EACd,KAAKA,SAAS,IAAI,WAAiB,MAAM,KAAK,gBAAgB,CAAC;EAC/D,KAAKE,YAAY;EACjB,KAAKC,YAAY;CACnB;CAEA,SAAuB;EACrB,KAAKH,SAAS,IAAI,gBAAsB,IAAI;EAC5C,KAAKE,YAAY;EACjB,KAAKC,YAAY;EACjB,KAAKF,eAAe,KAAA;CACtB;CAEA,OAAO,OAA0C,YAA+B;EAC9E,KAAKD,SAAS,MAAMA,OAAO,OAAO,MAAM,UAAU;EAClD,KAAKE,YAAY;EACjB,KAAKC,YAAY;CACnB;;CAGA,IAAI,gBAA8B;EAChC,iBAAiB,KAAK,QAAQ,SAAS;EACvC,OAAO,0BAA0B,KAAK,QAAQ,CAAC;CACjD;CAEA,IAAI,KAAc;EAChB,OAAO,KAAK,WAAW,SAAS,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CAC7E;CAEA,IAAI,aAAqB;EACvB,OAAO,KAAK,mBAAmB,SAAS,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CACrF;CAEA,IAAI,UAAmC;EACrC,OAAO,KAAK,WAAW,gBAAgB,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CACpF;CAEA,IAAI,kBAAsC;EACxC,OAAO,KAAK,mBAAmB,gBAAgB,KAAK,QAAQ,KAAK,WAAW,KAAK,QAAQ,CAAC;CAC5F;CAEA,IAAI,WAAgB;EAClB,MAAM,OAAO,YAAY,KAAK,MAAM;EACpC,OAAQ,KAAK,OAAO,OAAO,wBAAwB,KAAK,eAAe,kBAAkB,MAAM,KAAK,YAAY;CAClH;;CAKA,IAAY,UAA+B;EACzC,iBAAiB,KAAK,QAAQ,SAAS;EACvC,OAAO,OAAO,KAAK,WAAW,KAAK,aAAa;CAClD;CAEA,IAAY,kBAAsC;EAChD,OAAO,QAAQ,KAAK,WAAW,KAAK,OAAO;CAC7C;CAEA,YAAY,GAA0B;EACpC,MAAM,IAAI,MAAM,qBAAqB,KAAK,OAAO,GAAG,KAAK,UAAU,wBAAwB;CAC7F;CAEA,qBAA2B;EACzB,IAAI,KAAK,iBAAiB;GACxB,MAAM,UAAU,KAAK,QAAQ,EAAE,aAAa,KAAK,CAAC;GAClD,IAAI,YAAY,KAAA,KAAa,OAAO,YAAY,UAC9C,KAAK,OAAO,GAAG,OAAO,OAAY;EAEtC;CACF;CAEA,MAAM,yBAAwC;EAE5C,IAAI,KAAK,iBAAiB;EAC1B,SAAS,KAAK,QAAQ,KAAK,WAAW,KAAA,CAAS;EAC/C,KAAKH,SAAS,IAAI,WAAiB,MAAM,KAAA,CAAc;EACvD,KAAKE,YAAY;EACjB,KAAKC,YAAY;EACjB,KAAKF,eAAe,KAAA;CACtB;CAGA,QAAQ,MAAkD;EACxD,MAAM,UAAU,SAAS,KAAK,QAAQ,KAAK,SAAS;EACpD,IAAI,YAAY,KAAA,KAAa,SAAS,OAAO,GAC3C,OAAO,KAAK,cAAc,SAAc,IAAI;EAE9C,OAAO;CACT;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAKH;CACd;CAEA,IAAW,YAA+B;EACxC,OAAQ,YAAY,KAAK,MAAM,CAAC,CAAC,UAAU,KAAKA,WAAW,CAAoB,cAAc;CAC/F;CAEA,IAAW,aAAsB;EAC/B,OAAO;CACT;CAEA,WAA0B;EACxB,OAAO,6BAA6B,KAAK,OAAO,UAAU,KAAK,SAAS,eAAe,KAAK,UAAU;;aAE7F,KAAK,GAAG;CACnB;;;;;;;;;;CAWA,cAAsB,QAAe,MAAyC;EAC5E,IAAI,WAAW,CAAC,QAAQ,CAAC,KAAK,gBAAgB,OAAO,iBACnD;EAEF,OAAO;CACT;CAEA,IAAY,kBAA2B;EACrC,OAAO,gBAAgB,MAAM,KAAKA,UAAU;CAC9C;;;;;CAMA,kBAAyB;EAEvB,IAAI,KAAKE,OAAO,gBAAgB;GAC9B,MAAM,SAAS,KAAKA,OAAO,MAAM;GACjC,IAAI,WAAW,KAAA,GACb,OAAO;EAEX;EACA,MAAM,EAAE,kBAAkB;EAC1B,OAAO,kBAAkB,KAAA,IAAa,KAAK,OAAO,GAAG,UAAU,aAAa,IAAe,KAAA;CAC7F;CAEA,CAAC,aAAgB;CACjB,CAAC,aAAgB;CACjB,CAAC,cAAiB;AACpB;;AAGA,SAAgB,oBAAoB,kBAA6E;CAC/G,OAAO,4BAA4B;AACrC;AAkBA,IAAM,kBAAN,MAAM,gBAAwF;CAC5F,OAAgB;CAChB,iBAA0B;CAC1B;CAEA,YAAY,IAA+C;EACzD,KAAKI,MAAM;CACb;CAEA,QAA2B;EACzB,MAAM,IAAI,MAAM,GAAG,KAAKA,IAAI,OAAO,GAAG,KAAKA,IAAI,UAAU,gBAAgB;CAC3E;CAEA,gBAAgB,QAAsE;EACpF,OAAO,IAAI,YAAkB,QAAQ,KAAA,CAAS;CAChD;CAEA,OAAO,QAAmD,aAAyC;EACjG,OAAO,IAAI,gBAAsB,MAAM;CACzC;AACF;AAEA,IAAM,aAAN,MAAM,WAAmF;CACvF,OAAgB;CAChB,iBAA0B;CAC1B;CAEA,YAAY,KAAgD,QAA2B;EACrF,KAAKC,UAAU;CACjB;CAEA,QAA2B;EACzB,OAAO,KAAKA;CACd;CAEA,gBAAgB,QAAsE;EACpF,OAAO,IAAI,YAAkB,QAAQ,KAAKA,OAAO;CACnD;CAEA,OAAO,QAAmD,YAAwC;EAChG,OAAO,IAAI,WAAiB,QAAQ,2BAA2B,KAAKA,SAAS,UAAU,CAAC;CAC1F;AACF;AAEA,IAAM,cAAN,MAA0F;CACxF,OAAgB;CAChB,iBAA0B;CAC1B;CAEA,YAAY,KAAgD,QAA2B;EACrF,KAAKA,UAAU;CACjB;CAEA,QAA2B;EACzB,OAAO,KAAKA;CACd;CAEA,gBAAgB,SAAuE;EACrF,OAAO;CACT;CAEA,OAAO,QAAmD,YAAwC;EAChG,OAAO,IAAI,WAAiB,QAAQ,2BAA2B,KAAKA,SAAS,UAAU,CAAC;CAC1F;AACF;AAEA,SAAS,2BACP,QACA,YACmB;CACnB,OAAO,SAAS,MAAM,IAAI,WAAW,MAAM,IAAI;AACjD"}

package/build/relations/RecursiveCollection.cjs

@@ -1,18 +1,17 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const require_relations_Collection = require("./Collection.cjs");
-const require_newEntity = require("../newEntity.cjs");
 const require_relations_AbstractRelationImpl = require("./AbstractRelationImpl.cjs");
 const require_relations_RelationSymbols = require("./RelationSymbols.cjs");
-const require_relations_RecursiveCycleError = require("./RecursiveCycleError.cjs");
-const require_relations_Reference = require("./Reference.cjs");
-require("../IsLoadedCache.cjs");
-const require_relations_OneToOneReference = require("./OneToOneReference.cjs");
 const require_batchloaders_recursiveChildrenBatchLoader = require("../batchloaders/recursiveChildrenBatchLoader.cjs");
 const require_batchloaders_recursiveM2mBatchLoader = require("../batchloaders/recursiveM2mBatchLoader.cjs");
 const require_batchloaders_recursiveParentsBatchLoader = require("../batchloaders/recursiveParentsBatchLoader.cjs");
 require("./ReadOnlyCollection.cjs");
-const require_EntityMetadata = require("../EntityMetadata.cjs");
+const require_relations_RecursiveCycleError = require("./RecursiveCycleError.cjs");
+const require_relations_Reference = require("./Reference.cjs");
+const require_relations_OneToOneReference = require("./OneToOneReference.cjs");
 const require_utils = require("../utils.cjs");
+const require_newEntity = require("../newEntity.cjs");
+const require_EntityMetadata = require("../EntityMetadata.cjs");
 const require_index = require("../index.cjs");
 const require_EntityManager = require("../EntityManager.cjs");
 //#region src/relations/RecursiveCollection.ts

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,17 +1,16 @@
 import { isCollection, isLoadedCollection } from "./Collection.js";
-import { lazyField } from "../newEntity.js";
 import { AbstractRelationImpl } from "./AbstractRelationImpl.js";
 import { RelationT, RelationU } from "./RelationSymbols.js";
-import { RecursiveCycleError } from "./RecursiveCycleError.js";
-import { isLoadedReference, isReference } from "./Reference.js";
-import "../IsLoadedCache.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 { getMetadata } from "../EntityMetadata.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";
 import { ensureNotDeleted } from "../index.js";
 import { appendStack, getEmInternalApi } from "../EntityManager.js";
 //#region src/relations/RecursiveCollection.ts