joist-core 2.3.0-next.7 → 2.3.0-next.71

package/build/Tables.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Tables.js","names":[],"sources":["../src/Tables.ts"],"sourcesContent":["import { groupBy } from \"joist-utils\";\n\nimport { type Column } from \"./columns.ts\";\n// Load-order only: without this, the built cjs/esm module graph evaluates relations/* before their\n// base classes exist (\"Class extends value undefined\"); keep it even though no symbol is imported.\nimport \"./configure.ts\";\nimport { buildValueCondition } from \"./drivers/buildUtils.ts\";\nimport { type Entity } from \"./Entity.ts\";\nimport { type IdOf, type MaybeAbstractEntityConstructor, type TaggedId } from \"./EntityManager.ts\";\nimport {\n  type EntityMetadata,\n  type Field,\n  type LargeOneToManyField,\n  type ManyToManyField,\n  type OneToManyField,\n  type OneToOneField,\n  type PolymorphicField,\n  type PolymorphicFieldComponent,\n  getBaseAndSelfMetas,\n  getBaseMeta,\n  getBaseSelfAndSubMetas,\n  getMetadata,\n} from \"./EntityMetadata.ts\";\nimport {\n  BaseExpr,\n  type Expr,\n  type ExprContext,\n  type ExprLike,\n  type InnerJoin,\n  type LeftJoin,\n  type SqlFragment,\n  asNode,\n  deferredCondition,\n  isExpr,\n} from \"./Expr.ts\";\nimport { type ExpressionCondition, getConstructorFromTaggedId, maybeResolveReferenceToId } from \"./index.ts\";\nimport { toIdOf } from \"./keys.ts\";\nimport { kqDot } from \"./keywords.ts\";\nimport { type ParsedValueFilter, makeLike, mapToDb } from \"./QueryParser.ts\";\nimport { skipCondition } from \"./skipCondition.ts\";\nimport { type TypeInfo } from \"./TypeInfo.ts\";\nimport { type ColumnsOf, type FieldsOf, type TypeMap, type TypeNameOf } from \"./typeMap.ts\";\nimport { fail } from \"./utils.ts\";\n\n/** Creates physical column expressions and relationship joins for `T`. */\nexport function table<T extends Entity>(cstr: MaybeAbstractEntityConstructor<T>): Table<T>;\n/**\n * Creates a table with an explicit type-level name, i.e. `table(Author, \"m\")` for a self-join.\n *\n * The name is the table's source key in `em.query`: two bare `table(Author)`s share the key `\"Author\"`,\n * so a left-joined mentor would also mark the mentee's columns nullable; a named alias has its own key.\n */\nexport function table<T extends Entity, Name extends string>(\n  cstr: MaybeAbstractEntityConstructor<T>,\n  name: Name,\n): Table<T, Name>;\nexport function table<T extends Entity>(cstr: MaybeAbstractEntityConstructor<T>, _name?: string): Table<T, any> {\n  // The name only exists at the type level; the SQL alias is still assigned by the query parser\n  return newTableProxy(cstr);\n}\n\n/** Creates multiple physical table handles. */\nexport function tables<T extends readonly MaybeAbstractEntityConstructor<any>[]>(\n  ...type: T\n): { [P in keyof T]: T[P] extends MaybeAbstractEntityConstructor<infer E extends Entity> ? Table<E> : never } {\n  return type.map((t) => newTableProxy(t)) as any;\n}\n\n/**\n * The runtime management interface plus phantom type information for `em.query`.\n *\n * `__entity` lets `QueryRow` recover `T` for entity mode (you cannot `infer T` back out of a mapped\n * type), and `__name` is the table's source key (see `Expr`).\n */\nexport interface TableBrand<T, Name extends string> extends TableMgmt {\n  readonly __entity: T;\n  readonly __name: Name;\n}\n\n/**\n * A physical table for `T`: one expression per SQL column, with relationship names as join factories.\n * Selecting the table itself retains entity hydration; selecting columns returns decoded SQL values.\n *\n * Unlike an Alias, a Table is an explicit SQL source, not a place to bind in an em.find relationship\n * tree. I.e. with `a = table(Author)`, `{ from: a }` registers that handle in the query's scope.\n * Its columns already know their physical column and codec, but their SQL name still depends on the\n * query: the same Author handle might be `a` in one query and `a1` in a nested query.\n *\n * Each predicate occurrence renders through ExprContext.aliasFor using the current scope (or an\n * enclosing scope for a correlation). Rendering returns SQL, ordered bindings, and source references\n * together. A comparison records both sides' references; templates and subqueries carry their\n * references too. Join pruning follows these references and join dependencies, rather than guessing\n * which tables a SQL string mentions. It also accounts for select/order/group expressions and keep.\n *\n * I.e. if a joined Author is used only by `a.first_name.eq(name)`, supplying undefined removes that\n * predicate and lets the unused join prune. Both APIs share this undefined-condition pruning rule;\n * they differ in how they get the references: Alias resolves domain conditions against a relationship\n * tree, while Table renders SQL expressions against explicit sources. Neither caches SQL names on\n * the reusable handle or predicate, so one parse cannot overwrite another parse's bindings.\n *\n * `Name` is the table's type-level source key, defaulting to the entity's own type name, so a\n * LEFT-joined SmallPublisher does not make Publisher columns nullable. `table(Author, \"m\")`\n * gives a self-join table its own key.\n */\nexport type Table<T extends Entity, Name extends string = TableNameOf<T>> = {\n  readonly [tableMgmt]: TableBrand<T, Name>;\n} & {\n  [P in keyof ColumnsOf<T>]: P extends \"id\"\n    ? EntityColumn<T, never, Name>\n    : ColumnsOf<T>[P] extends { entity: infer U extends Entity; nullable: infer N }\n      ? ReferenceColumn<U, N extends true ? null : never, Name>\n      : ColumnsOf<T>[P] extends { type: infer V; nullable: infer N }\n        ? PrimitiveColumn<V, N extends true ? null : never, Name>\n        : never;\n} & {\n  [\n    P in keyof FieldsOf<T> as P extends keyof ColumnsOf<T>\n      ? never\n      : FieldsOf<T>[P] extends { kind: \"m2o\" | \"poly\" | \"o2m\" | \"lo2m\" | \"m2m\" | \"o2o\" }\n        ? P\n        : never\n  ]: FieldsOf<T>[P] extends { kind: \"m2o\"; type: infer U extends Entity; nullable: infer N }\n    ? ReferenceJoin<U, N extends undefined ? null : never>\n    : FieldsOf<T>[P] extends { kind: \"poly\"; type: infer U extends Entity; nullable: infer N }\n      ? PolyReference<U, N extends undefined ? null : never>\n      : FieldsOf<T>[P] extends { kind: \"o2m\" | \"lo2m\" | \"m2m\" | \"o2o\"; type: infer U extends Entity }\n        ? CollectionJoin<U>\n        : never;\n} & {\n  [\n    K in keyof TypeMap as TypeMap[K] extends {\n      entityType: infer U extends Entity & { __type: { 0: TypeNameOf<T>; 1: string } };\n    }\n      ? Uncapitalize<TypeNameOf<U> & string>\n      : never\n  ]: TypeMap[K] extends { entityType: infer U extends Entity } ? SubtypeJoin<U> : never;\n};\n\n/** Keeps explicit base and subtype sources independent, with generic entities untracked. */\ntype TableNameOf<T> = T extends { __type: { 0: string } } ? TypeNameOf<T> & string : string;\n\n/** A relationship join factory, without a selectable FK expression. */\nexport interface ReferenceJoin<U extends Entity, N extends null | never> {\n  as<A extends TableFor<U>>(other: A): [N] extends [never] ? InnerJoin<A> : LeftJoin<A>;\n  inner<A extends TableFor<U>>(other: A): InnerJoin<A>;\n  left<A extends TableFor<U>>(other: A): LeftJoin<A>;\n}\n\n/** Any table whose entity is (a subtype of) `U`, i.e. what a relation join factory accepts. */\nexport type TableFor<U> = { readonly [tableMgmt]: TableBrand<U, string> };\n\n/**\n * A collection relation (o2m/o2o/m2m) as a join factory: `a.books.as(b)` returns the same\n * `{ left: b, on: ... }` entry the expanded form writes, with the FK condition built from metadata, so\n * join-list inference, nullability, scope checking, and pruning are unchanged and both forms mix freely.\n *\n * `as` binds the joined alias, the same way em.find's `{ books: { as: b } }` does. The default is LEFT\n * (a collection may be empty, and a LEFT join never filters rows, so pruning it is always safe);\n * `.inner(b)` opts into filtering. An m2m entry carries a hidden second join through the join table,\n * which the parser expands; the pair prunes together.\n */\nexport interface CollectionJoin<U extends Entity> {\n  as<A extends TableFor<U>>(other: A): LeftJoin<A>;\n  inner<A extends TableFor<U>>(other: A): InnerJoin<A>;\n  left<A extends TableFor<U>>(other: A): LeftJoin<A>;\n}\n\n/** A named subtype join, defaulting to LEFT because a root row may belong to another subtype. */\ninterface SubtypeJoin<U extends Entity> extends CollectionJoin<U> {\n  <A extends TableFor<U>>(other: A): LeftJoin<A>;\n}\n\n/**\n * A physical FK column expression (`b.author_id` selects/compares the FK) plus a join factory\n * (`b.author_id.as(a)` joins). The default join kind follows physical column nullability:\n * a NOT NULL FK is INNER, a nullable one is LEFT, and the row type reflects it.\n */\nexport interface ReferenceColumn<U extends Entity, N extends null | never, Src extends string>\n  extends EntityColumn<U, N, Src>, ReferenceJoin<U, N> {}\n\n/**\n * A polymorphic reference: condition methods (each resolving the component column from the value), plus\n * a join factory that picks the component from the argument's entity, i.e. `c.parent.as(a)` joins\n * through `parent_author_id`, like an explicit join with `on: c.parent.eq(a.id)`.\n */\nexport interface PolyReference<U extends Entity, N extends null | never> extends ReferenceJoin<U, N> {\n  eq(value: U | TaggedId | ExprLike<IdOf<U> | null> | null | undefined): ExpressionCondition;\n  ne(value: U | TaggedId | ExprLike<IdOf<U> | null> | null | undefined): ExpressionCondition;\n  in(values: Array<U | TaggedId> | ExprLike<IdOf<U> | null> | undefined): ExpressionCondition;\n}\n\nexport interface PrimitiveColumn<V, N extends null | never, Src extends string = string> extends Expr<V | N, Src> {\n  eq(value: V | ExprLike<V | N> | N | undefined): ExpressionCondition;\n  ne(value: V | ExprLike<V | N> | N | undefined): ExpressionCondition;\n  in(values: readonly (V | null)[] | ExprLike<V | null> | undefined): ExpressionCondition;\n  nin(values: readonly (V | null)[] | ExprLike<V | null> | undefined): ExpressionCondition;\n  gt(value: V | ExprLike<V | N> | undefined): ExpressionCondition;\n  gte(value: V | ExprLike<V | N> | undefined): ExpressionCondition;\n  lt(value: V | ExprLike<V | N> | undefined): ExpressionCondition;\n  lte(value: V | ExprLike<V | N> | undefined): ExpressionCondition;\n  like(value: V | undefined): ExpressionCondition;\n  ilike(value: V | undefined): ExpressionCondition;\n  search(value: V | undefined): ExpressionCondition;\n  between(v1: V | undefined, v2: V | undefined): ExpressionCondition;\n  // need to move to ArrayColumn\n  // ...added the `string` to support jsonb contains like `WHERE profile @> '{\"age\": 25}'`\n  // Ideally this would go in a JsonbColumn\n  contains(value: string | V | PrimitiveColumn<V, any> | N | undefined): ExpressionCondition;\n  ncontains(value: string | V | PrimitiveColumn<V, any> | N | undefined): ExpressionCondition;\n  overlaps(value: V | PrimitiveColumn<V, any> | N | undefined): ExpressionCondition;\n  noverlaps(value: V | PrimitiveColumn<V, any> | N | undefined): ExpressionCondition;\n\n  /**\n   * Adds a JSON path existence condition, using the `@?` operator.\n   *\n   * Any values should be embedded directly within the `jsonPath`, because postgres does not\n   * support parameterized JSON path expressions. The entire `jsonPath` is treated as a parameter,\n   * so this is safe from SQL injection.\n   */\n  pathExists(jsonPath: string | undefined): ExpressionCondition;\n\n  /**\n   * Adds a JSON path predicate condition, using the `@@` operator.\n   *\n   * Any values should be embedded directly within the `jsonPath`, because postgres does not\n   * support parameterized JSON path expressions. The entire `jsonPath` is treated as a parameter,\n   * so this is safe from SQL injection.\n   */\n  pathIsTrue(jsonPath: string | undefined): ExpressionCondition;\n\n  /**\n   * Add `exp` to the query, which should include the operator & expression and any\n   * bound parameters (but not include the column name).\n   *\n   * We use knex-style placeholders, i.e. `?` and `\\\\?` to escape question marks, i.e.\n   *\n   * ```ts\n   * a.address.raw(\"@\\\\? ?\", ['$.street ? (@ == \"rr2\")'])`\n   * ```\n   */\n  raw(exp: string, bindings: readonly any[] | undefined): ExpressionCondition;\n}\n\nexport interface EntityColumn<T, N extends null | never = never, Src extends string = string> extends Expr<\n  IdOf<T> | N,\n  Src\n> {\n  eq(value: T | IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition;\n  ne(value: T | IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition;\n  // Adding `| null` for GraphQL support\n  in(value: readonly (T | IdOf<T> | null)[] | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition;\n  nin(value: readonly (T | IdOf<T> | null)[] | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition;\n  gt(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition;\n  gte(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition;\n  lt(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition;\n  lte(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition;\n  raw(exp: string, bindings: readonly any[] | undefined): ExpressionCondition;\n}\n\nexport const tableMgmt = Symbol(\"tableMgmt\");\n\nexport function getTableMgmt(table: TableFor<unknown>): TableMgmt {\n  return table[tableMgmt];\n}\n\n/** The identity SQL queries bind a table by, plus its original entity metadata. */\nexport interface TableMgmt {\n  tableName: string;\n  /**\n   * The metadata this table was created with, i.e. `table(TaskNew)` keeps `taskNewMeta`.\n   *\n   * It cannot be re-derived from `tableName`: STI subtypes share their base's table (`Task`, `TaskNew`,\n   * and `TaskOld` are all `tasks`), so a `getMetadataForTable(\"tasks\")` lookup can only return the base\n   * `Task`, and the alias would lose its subtype identity for explicit subtype joins and entity hydration.\n   */\n  meta: EntityMetadata;\n}\n\n/** Returns the metadata for the entity that `table` is bound to. */\nexport function getTableMetadata<T extends Entity>(table: TableFor<T>): EntityMetadata<T> {\n  const mgmt = table[tableMgmt];\n  return mgmt.meta as EntityMetadata<T>;\n}\n\nexport function newTableProxy<T extends Entity>(cstr: MaybeAbstractEntityConstructor<T>): Table<T> {\n  const meta = getMetadata(cstr);\n  // The identity SQL queries bind to a source, retaining STI subtype metadata.\n  const mgmt: TableMgmt = { tableName: meta.tableName, meta };\n  const subtypes = new Map(meta.subTypes.map((m) => [m.type[0].toLowerCase() + m.type.slice(1), m]));\n  const proxy: any = new Proxy(cstr, {\n    /** Create a physical column expression or a relation join factory. */\n    get(_, key: PropertyKey): any {\n      if (key === tableMgmt) {\n        return mgmt;\n      }\n      if (typeof key !== \"string\") return undefined;\n      const descriptor = Object.hasOwn(meta.columns, key) ? meta.columns[key] : undefined;\n      if (descriptor) {\n        return descriptor.idMetadata && key !== \"id\"\n          ? new EntityColumnImpl(meta, descriptor, mgmt)\n          : new PrimitiveColumnImpl(meta, descriptor, mgmt);\n      }\n      const subtype = subtypes.get(key);\n      if (subtype) {\n        const join = new SubtypeJoinImpl(proxy, subtype);\n        return Object.assign(join.as.bind(join), {\n          as: join.as.bind(join),\n          inner: join.inner.bind(join),\n          left: join.left.bind(join),\n        });\n      }\n      const field =\n        physicalRelation(meta, key) ?? fail(`No physical field ${key} on ${cstr.name}; join its base table explicitly`);\n      switch (field.kind) {\n        case \"m2o\":\n          return new ReferenceJoinImpl(new EntityColumnImpl(meta, field.serde.columns[0].column, mgmt));\n        case \"poly\":\n          return new PolyReferenceImpl(meta, mgmt, field);\n        case \"o2m\":\n        case \"o2o\":\n        case \"lo2m\":\n          return new OneToManyJoinImpl(proxy, field);\n        case \"m2m\":\n          return new ManyToManyJoinImpl(proxy, field);\n        default:\n          throw new Error(`Unsupported table field kind ${field.kind}`);\n      }\n    },\n\n    has(_, key) {\n      return (\n        key === tableMgmt ||\n        (typeof key === \"string\" &&\n          (Object.hasOwn(meta.columns, key) || !!physicalRelation(meta, key) || subtypes.has(key)))\n      );\n    },\n  });\n  return proxy;\n}\n\nexport function isTable(obj: unknown): obj is Table<any, any> {\n  // Oddly enough `typeof` will be a function b/c we are proxying the constructors\n  return typeof obj === \"function\" && tableMgmt in obj;\n}\n\n/**\n * A physical table column implements `Expr`: it renders as `alias.\"column\"`, decodes result\n * values through the column's shared scalar codec, and inherits aggregate methods from `BaseExpr`.\n */\nclass TableColumn extends BaseExpr {\n  public constructor(\n    readonly meta: EntityMetadata,\n    readonly column: Column,\n    readonly mgmt: TableMgmt,\n  ) {\n    super();\n  }\n\n  /** Author.id, Book.author_id, and Comment.parent_author_id use the same Author ID domain. */\n  get outputType(): TypeInfo | undefined {\n    return this.column.outputType;\n  }\n\n  get sqlNullable(): boolean | undefined {\n    return this.column.sqlNullable;\n  }\n\n  get sqlSource(): object {\n    return this.mgmt;\n  }\n\n  toSql(ctx: ExprContext): SqlFragment {\n    const alias = ctx.aliasFor(this.mgmt);\n    return { sql: kqDot(alias, this.column.columnName), bindings: [], refs: [alias] };\n  }\n\n  /** Decodes result-set values with public PK/FK ids, while hydration keeps internal tagged ids. */\n  decode(value: unknown): unknown {\n    if (value === null || value === undefined) return value;\n    const idMeta = this.idMetadata;\n    if (idMeta) return toIdOf(idMeta, this.column.mapFromDb(value) as TaggedId | undefined);\n    return this.column.mapFromDb(value);\n  }\n\n  encode(value: unknown): unknown {\n    return this.column.mapToDb(value);\n  }\n\n  /** Identifies the ID domain of a primary key, FK, or physical polymorphic component. */\n  get idMetadata(): EntityMetadata | undefined {\n    return this.column.idMetadata?.();\n  }\n\n  /** Encodes literals when the condition is created and renders with each query's aliases. */\n  addCondition(value: ParsedValueFilter<unknown>): ExpressionCondition {\n    const encoded = mapToDb(this.column, value);\n    return deferredCondition((ctx) => {\n      const left = this.toSql(ctx);\n      const [sql, bindings] = buildValueCondition(left.sql, encoded);\n      return { sql, bindings: [...left.bindings, ...bindings], refs: left.refs };\n    });\n  }\n\n  /** Renders raw operators against the same quoted column SQL as other expressions. */\n  protected addRawCondition(exp: string, bindings: readonly any[]): ExpressionCondition {\n    return deferredCondition((ctx) => {\n      const left = this.toSql(ctx);\n      return { sql: `${left.sql} ${exp}`, bindings: [...left.bindings, ...bindings], refs: left.refs };\n    });\n  }\n\n  /** Uses column filter conversions for literals and shared comparisons for expressions and null equality. */\n  protected compare(op: string, value: unknown): ExpressionCondition {\n    if (value === undefined || isExpr(value) || (value === null && (op === \"=\" || op === \"!=\"))) {\n      return super.compare(op, value);\n    }\n    // Primitive relational comparisons historically bind null through mapToDb.\n    const kind = ({ \"=\": \"eq\", \"!=\": \"ne\", \">\": \"gt\", \">=\": \"gte\", \"<\": \"lt\", \"<=\": \"lte\" } as const)[op];\n    if (!kind) return fail(`Invalid operator ${op}`);\n    return this.addCondition({ kind, value });\n  }\n\n  /**\n   * Compares this column to another expression.\n   *\n   * Table columns, aggregates, subquery columns, and `sql` templates use the expression context\n   * to render their complete SQL.\n   * Negated array operators wrap the complete comparison in NOT.\n   */\n  protected compareToExpr(op: string, value: ExprLike<any>, negate = false): ExpressionCondition {\n    if (negate) {\n      return deferredCondition((ctx) => {\n        const comparison = ctx.conditionToSql(this.compareToExpr(op, value))!;\n        return { ...comparison, sql: `NOT (${comparison.sql})` };\n      });\n    }\n    return super.compare(op, value);\n  }\n}\n\nclass PrimitiveColumnImpl<V, N extends null | never> extends TableColumn implements PrimitiveColumn<V, N> {\n  between(v1: V | undefined, v2: V | undefined): ExpressionCondition {\n    if (v1 === undefined || v2 === undefined) return skipCondition;\n    return this.addCondition({ kind: \"between\", value: [v1, v2] });\n  }\n\n  like(value: V | undefined): ExpressionCondition {\n    if (value === undefined) return skipCondition;\n    return this.addCondition({ kind: \"like\", value });\n  }\n\n  ilike(value: V | undefined): ExpressionCondition {\n    if (value === undefined) return skipCondition;\n    return this.addCondition({ kind: \"ilike\", value });\n  }\n\n  search(value: V | undefined): ExpressionCondition {\n    // Check !value so that empty strings are pruned\n    if (!value) return skipCondition;\n    return this.addCondition({ kind: \"ilike\", value: makeLike(value) });\n  }\n\n  in(values: readonly (V | null)[] | ExprLike<V | null> | undefined): ExpressionCondition {\n    if (values === undefined) return skipCondition;\n    if (isExpr(values)) return this.inList(\"IN\", values);\n    if (values.includes(null)) {\n      const isNull = this.addCondition({ kind: \"is-null\" });\n      const hasValue = this.addCondition({ kind: \"in\", value: values.filter((v) => v !== null) });\n      return { or: [isNull, hasValue] };\n    } else {\n      return this.addCondition({ kind: \"in\", value: values as V[] });\n    }\n  }\n\n  nin(values: readonly (V | null)[] | ExprLike<V | null> | undefined): ExpressionCondition {\n    if (values === undefined) return skipCondition;\n    if (isExpr(values)) return this.inList(\"NOT IN\", values);\n    return this.addCondition({ kind: \"nin\", value: values.filter((v) => v !== null) as V[] });\n  }\n\n  // V will already be an array\n  contains(v1: string | V | PrimitiveColumn<V, any> | N | undefined): ExpressionCondition {\n    if (v1 === undefined) return skipCondition;\n    if (isExpr(v1)) return this.compareToExpr(\"@>\", v1);\n    return this.addCondition({ kind: \"contains\", value: v1 as any });\n  }\n\n  // V will already be an array\n  ncontains(v1: string | V | PrimitiveColumn<V, any> | N | undefined): ExpressionCondition {\n    if (v1 === undefined) return skipCondition;\n    if (isExpr(v1)) return this.compareToExpr(\"@>\", v1, true);\n    return this.addCondition({ kind: \"ncontains\", value: v1 as any });\n  }\n\n  // V will already be an array\n  overlaps(v1: V | PrimitiveColumn<V, any> | N | undefined): ExpressionCondition {\n    if (v1 === undefined) return skipCondition;\n    if (isExpr(v1)) return this.compareToExpr(\"&&\", v1);\n    return this.addCondition({ kind: \"overlaps\", value: v1 as any });\n  }\n\n  noverlaps(v1: V | PrimitiveColumn<V, any> | N | undefined): ExpressionCondition {\n    if (v1 === undefined) return skipCondition;\n    if (isExpr(v1)) return this.compareToExpr(\"&&\", v1, true);\n    return this.addCondition({ kind: \"noverlaps\", value: v1 as any });\n  }\n\n  pathExists(jsonPath: string | undefined): ExpressionCondition {\n    if (jsonPath === undefined) return skipCondition;\n    return this.addCondition({ kind: \"jsonPathExists\", value: jsonPath });\n  }\n\n  pathIsTrue(jsonPath: string | undefined): ExpressionCondition {\n    if (jsonPath === undefined) return skipCondition;\n    return this.addCondition({ kind: \"jsonPathPredicate\", value: jsonPath });\n  }\n\n  raw(exp: string, bindings: readonly any[] | undefined): ExpressionCondition {\n    if (bindings === undefined) return skipCondition;\n    return this.addRawCondition(exp, bindings);\n  }\n}\n\nclass EntityColumnImpl<T> extends TableColumn implements EntityColumn<T> {\n  in(values: readonly (T | IdOf<T> | null)[] | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition {\n    if (values === undefined) {\n      return skipCondition;\n    } else if (values === null) {\n      throw new Error(\"Unsupported\");\n    } else if (isExpr(values)) {\n      return this.inList(\"IN\", values);\n    } else if (values.includes(null)) {\n      // Like `PrimitiveColumn.in`, split `[a1, null]` into `IS NULL OR IN (...)`\n      const isNull = this.addCondition({ kind: \"is-null\" });\n      const hasValue = this.addCondition({ kind: \"in\", value: values.filter((v) => v !== null) as any });\n      return { or: [isNull, hasValue] };\n    } else {\n      return this.addCondition({ kind: \"in\", value: values as any });\n    }\n  }\n\n  nin(values: readonly (T | IdOf<T> | null)[] | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition {\n    if (values === undefined) {\n      return skipCondition;\n    } else if (values === null) {\n      throw new Error(\"Unsupported\");\n    } else if (isExpr(values)) {\n      return this.inList(\"NOT IN\", values);\n    } else {\n      return this.addCondition({ kind: \"nin\", value: values.filter((v) => v !== null) as any });\n    }\n  }\n\n  gt(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition {\n    return this.compareId(\">\", \"gt\", value);\n  }\n\n  gte(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition {\n    return this.compareId(\">=\", \"gte\", value);\n  }\n\n  lt(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition {\n    return this.compareId(\"<\", \"lt\", value);\n  }\n\n  lte(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition {\n    return this.compareId(\"<=\", \"lte\", value);\n  }\n\n  raw(exp: string, bindings: readonly any[] | undefined): ExpressionCondition {\n    if (bindings === undefined) return skipCondition;\n    return this.addRawCondition(exp, bindings);\n  }\n\n  /** Joins `other` via this FK, INNER for a required reference and LEFT for a nullable one. */\n  as(other: object): object {\n    return this.joinEntry(this.sqlNullable === false ? \"inner\" : \"left\", other);\n  }\n\n  inner(other: object): object {\n    return this.joinEntry(\"inner\", other);\n  }\n\n  left(other: object): object {\n    return this.joinEntry(\"left\", other);\n  }\n\n  private joinEntry(kind: JoinKind, other: object): object {\n    return { [kind]: requireTable(other), on: this.eq(idColumnOf(other)) };\n  }\n\n  private compareId(op: string, kind: \"gt\" | \"gte\" | \"lt\" | \"lte\", value: unknown): ExpressionCondition {\n    if (value === undefined) return skipCondition;\n    if (value === null) throw new Error(\"Unsupported\");\n    if (isExpr(value)) return this.compareToExpr(op, value);\n    return this.addCondition({ kind, value: value as any });\n  }\n}\n\nclass PolyReferenceImpl<T extends Entity> {\n  public constructor(\n    private meta: EntityMetadata,\n    private mgmt: TableMgmt,\n    private field: PolymorphicField,\n  ) {}\n\n  /** Compares to a tagged id, an entity, or another table's id column, which picks the component (`c.parent.eq(a.id)`). */\n  eq(value: T | TaggedId | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition {\n    return this.addEqOrNe(\"eq\", value);\n  }\n\n  ne(value: T | TaggedId | ExprLike<IdOf<T> | null> | null | undefined): ExpressionCondition {\n    return this.addEqOrNe(\"ne\", value);\n  }\n\n  // We required tagged ids for polys\n  in(values: Array<T | TaggedId> | ExprLike<IdOf<T> | null> | undefined): ExpressionCondition {\n    if (values === undefined) return skipCondition;\n    if (isExpr(values)) return this.inSubquery(values);\n    // Split up the ids by constructor\n    const idsByConstructor = groupBy(values, (id) => getConstructorFromTaggedId(maybeResolveReferenceToId(id)!).name);\n    // Or together `parent_book_id in (1,2,3) OR parent_author_id IN (4,5,6)`\n    return {\n      or: Object.entries(idsByConstructor).map(([cstrName, ids]) => {\n        const comp =\n          this.field.components.find((p) => p.otherMetadata().cstr.name === cstrName) ??\n          fail(`No component for ${cstrName}`);\n        return this.componentColumn(comp).addCondition({ kind: \"in\", value: ids });\n      }),\n    };\n  }\n\n  /** Joins `other` via this poly's component for its entity, INNER when the poly is required. */\n  as(other: object): object {\n    return this.joinEntry(this.field.required ? \"inner\" : \"left\", other);\n  }\n\n  inner(other: object): object {\n    return this.joinEntry(\"inner\", other);\n  }\n\n  left(other: object): object {\n    return this.joinEntry(\"left\", other);\n  }\n\n  private joinEntry(kind: JoinKind, other: object): object {\n    return { [kind]: requireTable(other), on: this.eq(idColumnOf(other) as any) };\n  }\n\n  /**\n   * i.e. `c.parent.in(query({ from: a, ..., select: a.id }))`: like `eq` against a table column, the\n   * subquery's agreed ID domain picks the component, i.e. authors pick `parent_author_id`.\n   */\n  private inSubquery(values: ExprLike<any>): ExpressionCondition {\n    // Only actual subqueries expose this getter; importing query.ts would create a load-order cycle.\n    const selected = asNode(values).subquerySelect;\n    const outputType = selected?.outputType;\n    let otherMeta = outputType?.idMeta;\n    if (!otherMeta) {\n      // Ordinary reads can select an unknown key serde. Compounds validate codecs before exposing a select.\n      if (!outputType && selected instanceof TableColumn) {\n        otherMeta = selected.idMetadata;\n      }\n      if (!otherMeta) {\n        return fail(\n          selected instanceof TableColumn\n            ? `${this.field.fieldName} \\`in\\` needs an id or FK column, got ${selected.column.columnName}`\n            : `${this.field.fieldName} is polymorphic, so \\`in\\` needs a subquery selecting an id or FK column`,\n        );\n      }\n    }\n    const comp =\n      this.field.components.find((p) => getBaseAndSelfMetas(otherMeta).includes(p.otherMetadata())) ??\n      fail(`${this.field.fieldName} has no component for ${otherMeta.type}`);\n    return this.componentColumn(comp).in(values);\n  }\n\n  private addEqOrNe(\n    kind: \"eq\" | \"ne\",\n    value: T | TaggedId | ExprLike<IdOf<T> | null> | null | undefined,\n  ): ExpressionCondition {\n    if (value === undefined) {\n      return skipCondition;\n    } else if (value instanceof TableColumn) {\n      // Joining through the poly, i.e. `c.parent.eq(a.id)`: the other table column's ID domain picks the component\n      const otherMeta = value.idMetadata ?? fail(`${this.field.fieldName} needs an id or FK column`);\n      const comp =\n        this.field.components.find((p) => getBaseAndSelfMetas(otherMeta).includes(p.otherMetadata())) ??\n        fail(`${this.field.fieldName} has no component for ${otherMeta.type}`);\n      return this.componentColumn(comp)[kind](value);\n    } else if (isExpr(value)) {\n      return fail(\n        `${this.field.fieldName} is polymorphic, so it can only be compared to tagged ids or entity table columns`,\n      );\n    } else if (value === null) {\n      // We can AND each of the components as many conditions\n      const value = kind === \"eq\" ? ({ kind: \"is-null\" } as const) : ({ kind: \"not-null\" } as const);\n      return {\n        and: this.field.components.map((p) => this.componentColumn(p).addCondition(value)),\n      };\n    } else {\n      // If we have a value, we can find the component\n      const comp =\n        this.field.components.find(\n          (p) => p.otherMetadata().cstr === getConstructorFromTaggedId(maybeResolveReferenceToId(value) as string),\n        ) || fail(`Could not find component for ${value}`);\n      return this.componentColumn(comp)[kind](value);\n    }\n  }\n\n  /** Returns the physical FK expression for one polymorphic target. */\n  private componentColumn(comp: PolymorphicFieldComponent): EntityColumnImpl<T> {\n    const descriptor =\n      this.meta.columns[comp.columnName] ?? fail(`No physical column ${comp.columnName} on ${this.meta.type}`);\n    return new EntityColumnImpl<T>(this.meta, descriptor, this.mgmt);\n  }\n}\n\n/**\n * Marks a sugar join entry whose target is a *collection* (o2m/m2m), which filter soft-deletes like\n * em.find's \"collections filter out soft-deletes, but m2o/o2o references still return them\"; see\n * `QueryParser.addSoftDeleteCondition`'s call site. Reference joins and explicit joins are unmarked.\n */\nexport const collectionJoin: unique symbol = Symbol(\"joist.collectionJoin\");\n\n/** Marks a sugar m2m join entry (`a.tags.as(t)`) with its hidden join-table join; `parseQuery` expands it. */\nexport const m2mJoinTable: unique symbol = Symbol(\"joist.m2mJoinTable\");\n\nexport interface M2mJoinTable {\n  handle: JoinTableHandle;\n  on: ExpressionCondition;\n}\n\n/** The runtime identity of an m2m join table in a query, i.e. `authors_to_tags`; it has no entity. */\nexport class JoinTableHandle {\n  constructor(readonly joinTableName: string) {}\n}\n\ntype JoinKind = \"inner\" | \"left\";\n\n/**\n * The `as`/`inner`/`left` join factory for collection relations, i.e. `a.books.as(b)` joins with the\n * relation's default kind (LEFT: a collection may be empty) and `.inner`/`.left` override. m2o/poly\n * relations implement the same three methods on their join factories. Physical FKs such as\n * `b.author_id` are expressions that also expose a join factory.\n */\nabstract class CollectionJoinImpl {\n  as(other: object): object {\n    return this.joinEntry(\"left\", requireTable(other));\n  }\n\n  inner(other: object): object {\n    return this.joinEntry(\"inner\", requireTable(other));\n  }\n\n  left(other: object): object {\n    return this.joinEntry(\"left\", requireTable(other));\n  }\n\n  protected abstract joinEntry(kind: JoinKind, other: TableFor<Entity>): object;\n}\n\n/** Joins a named subtype explicitly; only STI subtype sugar adds a discriminator to its ON. */\nclass SubtypeJoinImpl extends CollectionJoinImpl {\n  constructor(\n    private proxy: TableFor<Entity>,\n    private subtype: EntityMetadata,\n  ) {\n    super();\n  }\n\n  protected joinEntry(kind: JoinKind, other: TableFor<Entity>): object {\n    if (getTableMetadata(other) !== this.subtype) {\n      return fail(`Expected table(${this.subtype.type}) for the explicit subtype join`);\n    }\n    const on = idColumnOf(this.proxy).eq(idColumnOf(other));\n    if (this.subtype.inheritanceType !== \"sti\" || this.subtype.stiDiscriminatorValue === undefined) {\n      return { [kind]: other, on };\n    }\n    const base = this.subtype.baseTypes.find((m) => m.stiDiscriminatorField !== undefined)!;\n    const columnName = base.fields[base.stiDiscriminatorField!].serde!.columns[0].columnName;\n    // Discriminator values are database enum ids, not domain enum values to pass through the field codec.\n    const discriminator = deferredCondition((ctx) => {\n      const alias = ctx.aliasFor(other[tableMgmt]);\n      return {\n        sql: `${kqDot(alias, columnName)} = ?`,\n        bindings: [this.subtype.stiDiscriminatorValue],\n        refs: [alias],\n      };\n    });\n    return { [kind]: other, on: { and: [on, discriminator] } };\n  }\n}\n\n/** An o2m/lo2m/o2o relation: the ON is the other side's FK (an m2o or a poly component) back to our id. */\nclass OneToManyJoinImpl extends CollectionJoinImpl {\n  constructor(\n    private proxy: any,\n    private field: OneToManyField | LargeOneToManyField | OneToOneField,\n  ) {\n    super();\n  }\n\n  protected joinEntry(kind: JoinKind, other: TableFor<Entity>): object {\n    const { field } = this;\n    const otherMeta = getTableMetadata(other);\n    const descriptor = otherMeta.columns[field.otherColumnName];\n    if (!descriptor) {\n      return fail(\n        `Cannot join ${getTableMetadata(this.proxy).type}.${field.fieldName} to ${otherMeta.type}: ` +\n          `${field.otherColumnName} is not physically present on ${otherMeta.tableName}; join the base table explicitly`,\n      );\n    }\n    const column = new EntityColumnImpl(otherMeta, descriptor, other[tableMgmt]);\n    const on = column.eq(this.proxy.id);\n    // Collections (o2m/lo2m) filter soft-deletes like em.find; o2o references resolve them\n    const filtered = field.kind === \"o2m\" ? field.softDeletes !== \"include\" : field.kind === \"lo2m\";\n    return { [kind]: other, on, [collectionJoin]: filtered };\n  }\n}\n\n/**\n * An m2m relation, i.e. `a.tags.as(t)`.\n *\n * The entry's own ON is `t.id = att.tag_id`, and the hidden `[m2mJoinTable]` half is\n * `att.author_id = a.id`; only the target's ON references the join table, so reference pruning keeps\n * or drops the pair together. Both are deferred conditions: the join table has no entity metadata, so\n * its alias only exists once the parser registers it.\n */\nclass ManyToManyJoinImpl extends CollectionJoinImpl {\n  constructor(\n    private proxy: any,\n    private field: ManyToManyField,\n  ) {\n    super();\n  }\n\n  protected joinEntry(kind: JoinKind, other: TableFor<Entity>): object {\n    const { joinTableName, columnNames } = this.field;\n    const [ourColumn, otherColumn] = columnNames;\n    const jt = new JoinTableHandle(joinTableName);\n    const ourId = idColumnOf(this.proxy);\n    const otherId = idColumnOf(other);\n    const jtOn = deferredCondition((ctx) => {\n      const jtAlias = ctx.aliasFor(jt);\n      const id = ourId.toSql(ctx);\n      return { sql: `${kqDot(jtAlias, ourColumn)} = ${id.sql}`, bindings: id.bindings, refs: id.refs };\n    });\n    const on = deferredCondition((ctx) => {\n      const jtAlias = ctx.aliasFor(jt);\n      const id = otherId.toSql(ctx);\n      return { sql: `${id.sql} = ${kqDot(jtAlias, otherColumn)}`, bindings: id.bindings, refs: [...id.refs, jtAlias] };\n    });\n    const filtered = this.field.softDeletes !== \"include\";\n    return {\n      [kind]: other,\n      on,\n      [collectionJoin]: filtered,\n      [m2mJoinTable]: { handle: jt, on: jtOn } satisfies M2mJoinTable,\n    };\n  }\n}\n\n/** Fails fast when a join factory is passed something other than a table. */\nfunction requireTable(other: object): TableFor<Entity> {\n  if (!isTable(other)) return fail(`Expected a table to join, got ${other}`);\n  return other;\n}\n\n/** The id column of a joined table, for building sugar ON conditions. */\nfunction idColumnOf(other: object): TableColumn {\n  return (other as any).id;\n}\n\n/** Keeps relation names join-only; physical FK columns retain expression methods. */\nclass ReferenceJoinImpl {\n  constructor(private column: EntityColumnImpl<unknown>) {}\n\n  as(other: object): object {\n    return this.column.sqlNullable === false ? this.column.inner(other) : this.column.left(other);\n  }\n\n  inner(other: object): object {\n    return this.column.inner(other);\n  }\n\n  left(other: object): object {\n    return this.column.left(other);\n  }\n}\n\n/** Identifies domain relationship keys exposed alongside physical columns. */\nfunction isRelation(field: Field | undefined): boolean {\n  return field !== undefined && [\"m2o\", \"poly\", \"o2m\", \"lo2m\", \"m2m\", \"o2o\"].includes(field.kind);\n}\n\n/** Resolves relationship sugar only from domain fields owned by this physical table. */\nfunction physicalRelation(meta: EntityMetadata, key: string): Field | undefined {\n  const owners = [meta, ...getBaseSelfAndSubMetas(getBaseMeta(meta))];\n  const owner = owners.find((owner) => owner.tableName === meta.tableName && Object.hasOwn(owner.fields, key));\n  const field = owner?.fields[key];\n  if (!isRelation(field)) return undefined;\n  // I.e. TaskNew.copiedFrom uses Task's original FK domain, not its specialized TaskNew target.\n  if (field?.kind === \"m2o\" || field?.kind === \"poly\") {\n    if (!field.serde.columns.every((binding) => meta.columns[binding.columnName] === binding.column)) return undefined;\n    return field.kind === \"poly\"\n      ? {\n          ...field,\n          components: field.components.map((component) => ({\n            column: component.column,\n            columnName: component.columnName,\n            otherFieldName: component.otherFieldName,\n            otherMetadata: component.column.idMetadata!,\n          })),\n        }\n      : field;\n  }\n  return field;\n}\n"],"mappings":";;;;;;;;;;;;;;;AAwDA,SAAgB,MAAwB,MAAyC,OAA+B;CAE9G,OAAO,cAAc,IAAI;AAC3B;;AAGA,SAAgB,OACd,GAAG,MACyG;CAC5G,OAAO,KAAK,KAAK,MAAM,cAAc,CAAC,CAAC;AACzC;AAiMA,MAAa,YAAY,OAAO,WAAW;AAE3C,SAAgB,aAAa,OAAqC;CAChE,OAAO,MAAM;AACf;;AAgBA,SAAgB,iBAAmC,OAAuC;CAExF,OADa,MAAM,UACR,CAAC;AACd;AAEA,SAAgB,cAAgC,MAAmD;CACjG,MAAM,OAAO,YAAY,IAAI;CAE7B,MAAM,OAAkB;EAAE,WAAW,KAAK;EAAW;CAAK;CAC1D,MAAM,WAAW,IAAI,IAAI,KAAK,SAAS,KAAK,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,YAAY,IAAI,EAAE,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACjG,MAAM,QAAa,IAAI,MAAM,MAAM;;EAEjC,IAAI,GAAG,KAAuB;GAC5B,IAAI,QAAQ,WACV,OAAO;GAET,IAAI,OAAO,QAAQ,UAAU,OAAO,KAAA;GACpC,MAAM,aAAa,OAAO,OAAO,KAAK,SAAS,GAAG,IAAI,KAAK,QAAQ,OAAO,KAAA;GAC1E,IAAI,YACF,OAAO,WAAW,cAAc,QAAQ,OACpC,IAAI,iBAAiB,MAAM,YAAY,IAAI,IAC3C,IAAI,oBAAoB,MAAM,YAAY,IAAI;GAEpD,MAAM,UAAU,SAAS,IAAI,GAAG;GAChC,IAAI,SAAS;IACX,MAAM,OAAO,IAAI,gBAAgB,OAAO,OAAO;IAC/C,OAAO,OAAO,OAAO,KAAK,GAAG,KAAK,IAAI,GAAG;KACvC,IAAI,KAAK,GAAG,KAAK,IAAI;KACrB,OAAO,KAAK,MAAM,KAAK,IAAI;KAC3B,MAAM,KAAK,KAAK,KAAK,IAAI;IAC3B,CAAC;GACH;GACA,MAAM,QACJ,iBAAiB,MAAM,GAAG,KAAK,KAAK,qBAAqB,IAAI,MAAM,KAAK,KAAK,iCAAiC;GAChH,QAAQ,MAAM,MAAd;IACE,KAAK,OACH,OAAO,IAAI,kBAAkB,IAAI,iBAAiB,MAAM,MAAM,MAAM,QAAQ,EAAE,CAAC,QAAQ,IAAI,CAAC;IAC9F,KAAK,QACH,OAAO,IAAI,kBAAkB,MAAM,MAAM,KAAK;IAChD,KAAK;IACL,KAAK;IACL,KAAK,QACH,OAAO,IAAI,kBAAkB,OAAO,KAAK;IAC3C,KAAK,OACH,OAAO,IAAI,mBAAmB,OAAO,KAAK;IAC5C,SACE,MAAM,IAAI,MAAM,gCAAgC,MAAM,MAAM;GAChE;EACF;EAEA,IAAI,GAAG,KAAK;GACV,OACE,QAAQ,aACP,OAAO,QAAQ,aACb,OAAO,OAAO,KAAK,SAAS,GAAG,KAAK,CAAC,CAAC,iBAAiB,MAAM,GAAG,KAAK,SAAS,IAAI,GAAG;EAE5F;CACF,CAAC;CACD,OAAO;AACT;AAEA,SAAgB,QAAQ,KAAsC;CAE5D,OAAO,OAAO,QAAQ,cAAc,aAAa;AACnD;;;;;AAMA,IAAM,cAAN,cAA0B,SAAS;CAEtB;CACA;CACA;CAHX,YACE,MACA,QACA,MACA;EACA,MAAM;EAJG,KAAA,OAAA;EACA,KAAA,SAAA;EACA,KAAA,OAAA;CAGX;;CAGA,IAAI,aAAmC;EACrC,OAAO,KAAK,OAAO;CACrB;CAEA,IAAI,cAAmC;EACrC,OAAO,KAAK,OAAO;CACrB;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAK;CACd;CAEA,MAAM,KAA+B;EACnC,MAAM,QAAQ,IAAI,SAAS,KAAK,IAAI;EACpC,OAAO;GAAE,KAAK,MAAM,OAAO,KAAK,OAAO,UAAU;GAAG,UAAU,CAAC;GAAG,MAAM,CAAC,KAAK;EAAE;CAClF;;CAGA,OAAO,OAAyB;EAC9B,IAAI,UAAU,QAAQ,UAAU,KAAA,GAAW,OAAO;EAClD,MAAM,SAAS,KAAK;EACpB,IAAI,QAAQ,OAAO,OAAO,QAAQ,KAAK,OAAO,UAAU,KAAK,CAAyB;EACtF,OAAO,KAAK,OAAO,UAAU,KAAK;CACpC;CAEA,OAAO,OAAyB;EAC9B,OAAO,KAAK,OAAO,QAAQ,KAAK;CAClC;;CAGA,IAAI,aAAyC;EAC3C,OAAO,KAAK,OAAO,aAAa;CAClC;;CAGA,aAAa,OAAwD;EACnE,MAAM,UAAU,QAAQ,KAAK,QAAQ,KAAK;EAC1C,OAAO,mBAAmB,QAAQ;GAChC,MAAM,OAAO,KAAK,MAAM,GAAG;GAC3B,MAAM,CAAC,KAAK,YAAY,oBAAoB,KAAK,KAAK,OAAO;GAC7D,OAAO;IAAE;IAAK,UAAU,CAAC,GAAG,KAAK,UAAU,GAAG,QAAQ;IAAG,MAAM,KAAK;GAAK;EAC3E,CAAC;CACH;;CAGA,gBAA0B,KAAa,UAA+C;EACpF,OAAO,mBAAmB,QAAQ;GAChC,MAAM,OAAO,KAAK,MAAM,GAAG;GAC3B,OAAO;IAAE,KAAK,GAAG,KAAK,IAAI,GAAG;IAAO,UAAU,CAAC,GAAG,KAAK,UAAU,GAAG,QAAQ;IAAG,MAAM,KAAK;GAAK;EACjG,CAAC;CACH;;CAGA,QAAkB,IAAY,OAAqC;EACjE,IAAI,UAAU,KAAA,KAAa,OAAO,KAAK,KAAM,UAAU,SAAS,OAAO,OAAO,OAAO,OACnF,OAAO,MAAM,QAAQ,IAAI,KAAK;EAGhC,MAAM,OAAQ;GAAE,KAAK;GAAM,MAAM;GAAM,KAAK;GAAM,MAAM;GAAO,KAAK;GAAM,MAAM;EAAM,EAAY;EAClG,IAAI,CAAC,MAAM,OAAO,KAAK,oBAAoB,IAAI;EAC/C,OAAO,KAAK,aAAa;GAAE;GAAM;EAAM,CAAC;CAC1C;;;;;;;;CASA,cAAwB,IAAY,OAAsB,SAAS,OAA4B;EAC7F,IAAI,QACF,OAAO,mBAAmB,QAAQ;GAChC,MAAM,aAAa,IAAI,eAAe,KAAK,cAAc,IAAI,KAAK,CAAC;GACnE,OAAO;IAAE,GAAG;IAAY,KAAK,QAAQ,WAAW,IAAI;GAAG;EACzD,CAAC;EAEH,OAAO,MAAM,QAAQ,IAAI,KAAK;CAChC;AACF;AAEA,IAAM,sBAAN,cAA6D,YAA6C;CACxG,QAAQ,IAAmB,IAAwC;EACjE,IAAI,OAAO,KAAA,KAAa,OAAO,KAAA,GAAW,OAAO;EACjD,OAAO,KAAK,aAAa;GAAE,MAAM;GAAW,OAAO,CAAC,IAAI,EAAE;EAAE,CAAC;CAC/D;CAEA,KAAK,OAA2C;EAC9C,IAAI,UAAU,KAAA,GAAW,OAAO;EAChC,OAAO,KAAK,aAAa;GAAE,MAAM;GAAQ;EAAM,CAAC;CAClD;CAEA,MAAM,OAA2C;EAC/C,IAAI,UAAU,KAAA,GAAW,OAAO;EAChC,OAAO,KAAK,aAAa;GAAE,MAAM;GAAS;EAAM,CAAC;CACnD;CAEA,OAAO,OAA2C;EAEhD,IAAI,CAAC,OAAO,OAAO;EACnB,OAAO,KAAK,aAAa;GAAE,MAAM;GAAS,OAAO,SAAS,KAAK;EAAE,CAAC;CACpE;CAEA,GAAG,QAAqF;EACtF,IAAI,WAAW,KAAA,GAAW,OAAO;EACjC,IAAI,OAAO,MAAM,GAAG,OAAO,KAAK,OAAO,MAAM,MAAM;EACnD,IAAI,OAAO,SAAS,IAAI,GAGtB,OAAO,EAAE,IAAI,CAFE,KAAK,aAAa,EAAE,MAAM,UAAU,CAEhC,GADF,KAAK,aAAa;GAAE,MAAM;GAAM,OAAO,OAAO,QAAQ,MAAM,MAAM,IAAI;EAAE,CAC5D,CAAC,EAAE;OAEhC,OAAO,KAAK,aAAa;GAAE,MAAM;GAAM,OAAO;EAAc,CAAC;CAEjE;CAEA,IAAI,QAAqF;EACvF,IAAI,WAAW,KAAA,GAAW,OAAO;EACjC,IAAI,OAAO,MAAM,GAAG,OAAO,KAAK,OAAO,UAAU,MAAM;EACvD,OAAO,KAAK,aAAa;GAAE,MAAM;GAAO,OAAO,OAAO,QAAQ,MAAM,MAAM,IAAI;EAAS,CAAC;CAC1F;CAGA,SAAS,IAA+E;EACtF,IAAI,OAAO,KAAA,GAAW,OAAO;EAC7B,IAAI,OAAO,EAAE,GAAG,OAAO,KAAK,cAAc,MAAM,EAAE;EAClD,OAAO,KAAK,aAAa;GAAE,MAAM;GAAY,OAAO;EAAU,CAAC;CACjE;CAGA,UAAU,IAA+E;EACvF,IAAI,OAAO,KAAA,GAAW,OAAO;EAC7B,IAAI,OAAO,EAAE,GAAG,OAAO,KAAK,cAAc,MAAM,IAAI,IAAI;EACxD,OAAO,KAAK,aAAa;GAAE,MAAM;GAAa,OAAO;EAAU,CAAC;CAClE;CAGA,SAAS,IAAsE;EAC7E,IAAI,OAAO,KAAA,GAAW,OAAO;EAC7B,IAAI,OAAO,EAAE,GAAG,OAAO,KAAK,cAAc,MAAM,EAAE;EAClD,OAAO,KAAK,aAAa;GAAE,MAAM;GAAY,OAAO;EAAU,CAAC;CACjE;CAEA,UAAU,IAAsE;EAC9E,IAAI,OAAO,KAAA,GAAW,OAAO;EAC7B,IAAI,OAAO,EAAE,GAAG,OAAO,KAAK,cAAc,MAAM,IAAI,IAAI;EACxD,OAAO,KAAK,aAAa;GAAE,MAAM;GAAa,OAAO;EAAU,CAAC;CAClE;CAEA,WAAW,UAAmD;EAC5D,IAAI,aAAa,KAAA,GAAW,OAAO;EACnC,OAAO,KAAK,aAAa;GAAE,MAAM;GAAkB,OAAO;EAAS,CAAC;CACtE;CAEA,WAAW,UAAmD;EAC5D,IAAI,aAAa,KAAA,GAAW,OAAO;EACnC,OAAO,KAAK,aAAa;GAAE,MAAM;GAAqB,OAAO;EAAS,CAAC;CACzE;CAEA,IAAI,KAAa,UAA2D;EAC1E,IAAI,aAAa,KAAA,GAAW,OAAO;EACnC,OAAO,KAAK,gBAAgB,KAAK,QAAQ;CAC3C;AACF;AAEA,IAAM,mBAAN,cAAkC,YAAuC;CACvE,GAAG,QAA4G;EAC7G,IAAI,WAAW,KAAA,GACb,OAAO;OACF,IAAI,WAAW,MACpB,MAAM,IAAI,MAAM,aAAa;OACxB,IAAI,OAAO,MAAM,GACtB,OAAO,KAAK,OAAO,MAAM,MAAM;OAC1B,IAAI,OAAO,SAAS,IAAI,GAI7B,OAAO,EAAE,IAAI,CAFE,KAAK,aAAa,EAAE,MAAM,UAAU,CAEhC,GADF,KAAK,aAAa;GAAE,MAAM;GAAM,OAAO,OAAO,QAAQ,MAAM,MAAM,IAAI;EAAS,CACnE,CAAC,EAAE;OAEhC,OAAO,KAAK,aAAa;GAAE,MAAM;GAAM,OAAO;EAAc,CAAC;CAEjE;CAEA,IAAI,QAA4G;EAC9G,IAAI,WAAW,KAAA,GACb,OAAO;OACF,IAAI,WAAW,MACpB,MAAM,IAAI,MAAM,aAAa;OACxB,IAAI,OAAO,MAAM,GACtB,OAAO,KAAK,OAAO,UAAU,MAAM;OAEnC,OAAO,KAAK,aAAa;GAAE,MAAM;GAAO,OAAO,OAAO,QAAQ,MAAM,MAAM,IAAI;EAAS,CAAC;CAE5F;CAEA,GAAG,OAAmF;EACpF,OAAO,KAAK,UAAU,KAAK,MAAM,KAAK;CACxC;CAEA,IAAI,OAAmF;EACrF,OAAO,KAAK,UAAU,MAAM,OAAO,KAAK;CAC1C;CAEA,GAAG,OAAmF;EACpF,OAAO,KAAK,UAAU,KAAK,MAAM,KAAK;CACxC;CAEA,IAAI,OAAmF;EACrF,OAAO,KAAK,UAAU,MAAM,OAAO,KAAK;CAC1C;CAEA,IAAI,KAAa,UAA2D;EAC1E,IAAI,aAAa,KAAA,GAAW,OAAO;EACnC,OAAO,KAAK,gBAAgB,KAAK,QAAQ;CAC3C;;CAGA,GAAG,OAAuB;EACxB,OAAO,KAAK,UAAU,KAAK,gBAAgB,QAAQ,UAAU,QAAQ,KAAK;CAC5E;CAEA,MAAM,OAAuB;EAC3B,OAAO,KAAK,UAAU,SAAS,KAAK;CACtC;CAEA,KAAK,OAAuB;EAC1B,OAAO,KAAK,UAAU,QAAQ,KAAK;CACrC;CAEA,UAAkB,MAAgB,OAAuB;EACvD,OAAO;IAAG,OAAO,aAAa,KAAK;GAAG,IAAI,KAAK,GAAG,WAAW,KAAK,CAAC;EAAE;CACvE;CAEA,UAAkB,IAAY,MAAmC,OAAqC;EACpG,IAAI,UAAU,KAAA,GAAW,OAAO;EAChC,IAAI,UAAU,MAAM,MAAM,IAAI,MAAM,aAAa;EACjD,IAAI,OAAO,KAAK,GAAG,OAAO,KAAK,cAAc,IAAI,KAAK;EACtD,OAAO,KAAK,aAAa;GAAE;GAAa;EAAa,CAAC;CACxD;AACF;AAEA,IAAM,oBAAN,MAA0C;CAE9B;CACA;CACA;CAHV,YACE,MACA,MACA,OACA;EAHQ,KAAA,OAAA;EACA,KAAA,OAAA;EACA,KAAA,QAAA;CACP;;CAGH,GAAG,OAAwF;EACzF,OAAO,KAAK,UAAU,MAAM,KAAK;CACnC;CAEA,GAAG,OAAwF;EACzF,OAAO,KAAK,UAAU,MAAM,KAAK;CACnC;CAGA,GAAG,QAAyF;EAC1F,IAAI,WAAW,KAAA,GAAW,OAAO;EACjC,IAAI,OAAO,MAAM,GAAG,OAAO,KAAK,WAAW,MAAM;EAEjD,MAAM,mBAAmB,QAAQ,SAAS,OAAO,2BAA2B,0BAA0B,EAAE,CAAE,CAAC,CAAC,IAAI;EAEhH,OAAO,EACL,IAAI,OAAO,QAAQ,gBAAgB,CAAC,CAAC,KAAK,CAAC,UAAU,SAAS;GAC5D,MAAM,OACJ,KAAK,MAAM,WAAW,MAAM,MAAM,EAAE,cAAc,CAAC,CAAC,KAAK,SAAS,QAAQ,KAC1E,KAAK,oBAAoB,UAAU;GACrC,OAAO,KAAK,gBAAgB,IAAI,CAAC,CAAC,aAAa;IAAE,MAAM;IAAM,OAAO;GAAI,CAAC;EAC3E,CAAC,EACH;CACF;;CAGA,GAAG,OAAuB;EACxB,OAAO,KAAK,UAAU,KAAK,MAAM,WAAW,UAAU,QAAQ,KAAK;CACrE;CAEA,MAAM,OAAuB;EAC3B,OAAO,KAAK,UAAU,SAAS,KAAK;CACtC;CAEA,KAAK,OAAuB;EAC1B,OAAO,KAAK,UAAU,QAAQ,KAAK;CACrC;CAEA,UAAkB,MAAgB,OAAuB;EACvD,OAAO;IAAG,OAAO,aAAa,KAAK;GAAG,IAAI,KAAK,GAAG,WAAW,KAAK,CAAQ;EAAE;CAC9E;;;;;CAMA,WAAmB,QAA4C;EAE7D,MAAM,WAAW,OAAO,MAAM,CAAC,CAAC;EAChC,MAAM,aAAa,UAAU;EAC7B,IAAI,YAAY,YAAY;EAC5B,IAAI,CAAC,WAAW;GAEd,IAAI,CAAC,cAAc,oBAAoB,aACrC,YAAY,SAAS;GAEvB,IAAI,CAAC,WACH,OAAO,KACL,oBAAoB,cAChB,GAAG,KAAK,MAAM,UAAU,wCAAwC,SAAS,OAAO,eAChF,GAAG,KAAK,MAAM,UAAU,yEAC9B;EAEJ;EACA,MAAM,OACJ,KAAK,MAAM,WAAW,MAAM,MAAM,oBAAoB,SAAS,CAAC,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC,KAC5F,KAAK,GAAG,KAAK,MAAM,UAAU,wBAAwB,UAAU,MAAM;EACvE,OAAO,KAAK,gBAAgB,IAAI,CAAC,CAAC,GAAG,MAAM;CAC7C;CAEA,UACE,MACA,OACqB;EACrB,IAAI,UAAU,KAAA,GACZ,OAAO;OACF,IAAI,iBAAiB,aAAa;GAEvC,MAAM,YAAY,MAAM,cAAc,KAAK,GAAG,KAAK,MAAM,UAAU,0BAA0B;GAC7F,MAAM,OACJ,KAAK,MAAM,WAAW,MAAM,MAAM,oBAAoB,SAAS,CAAC,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC,KAC5F,KAAK,GAAG,KAAK,MAAM,UAAU,wBAAwB,UAAU,MAAM;GACvE,OAAO,KAAK,gBAAgB,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK;EAC/C,OAAO,IAAI,OAAO,KAAK,GACrB,OAAO,KACL,GAAG,KAAK,MAAM,UAAU,kFAC1B;OACK,IAAI,UAAU,MAAM;GAEzB,MAAM,QAAQ,SAAS,OAAQ,EAAE,MAAM,UAAU,IAAe,EAAE,MAAM,WAAW;GACnF,OAAO,EACL,KAAK,KAAK,MAAM,WAAW,KAAK,MAAM,KAAK,gBAAgB,CAAC,CAAC,CAAC,aAAa,KAAK,CAAC,EACnF;EACF,OAAO;GAEL,MAAM,OACJ,KAAK,MAAM,WAAW,MACnB,MAAM,EAAE,cAAc,CAAC,CAAC,SAAS,2BAA2B,0BAA0B,KAAK,CAAW,CACzG,KAAK,KAAK,gCAAgC,OAAO;GACnD,OAAO,KAAK,gBAAgB,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK;EAC/C;CACF;;CAGA,gBAAwB,MAAsD;EAC5E,MAAM,aACJ,KAAK,KAAK,QAAQ,KAAK,eAAe,KAAK,sBAAsB,KAAK,WAAW,MAAM,KAAK,KAAK,MAAM;EACzG,OAAO,IAAI,iBAAoB,KAAK,MAAM,YAAY,KAAK,IAAI;CACjE;AACF;;;;;;AAOA,MAAa,iBAAgC,OAAO,sBAAsB;;AAG1E,MAAa,eAA8B,OAAO,oBAAoB;;AAQtE,IAAa,kBAAb,MAA6B;CACN;CAArB,YAAY,eAAgC;EAAvB,KAAA,gBAAA;CAAwB;AAC/C;;;;;;;AAUA,IAAe,qBAAf,MAAkC;CAChC,GAAG,OAAuB;EACxB,OAAO,KAAK,UAAU,QAAQ,aAAa,KAAK,CAAC;CACnD;CAEA,MAAM,OAAuB;EAC3B,OAAO,KAAK,UAAU,SAAS,aAAa,KAAK,CAAC;CACpD;CAEA,KAAK,OAAuB;EAC1B,OAAO,KAAK,UAAU,QAAQ,aAAa,KAAK,CAAC;CACnD;AAGF;;AAGA,IAAM,kBAAN,cAA8B,mBAAmB;CAErC;CACA;CAFV,YACE,OACA,SACA;EACA,MAAM;EAHE,KAAA,QAAA;EACA,KAAA,UAAA;CAGV;CAEA,UAAoB,MAAgB,OAAiC;EACnE,IAAI,iBAAiB,KAAK,MAAM,KAAK,SACnC,OAAO,KAAK,kBAAkB,KAAK,QAAQ,KAAK,gCAAgC;EAElF,MAAM,KAAK,WAAW,KAAK,KAAK,CAAC,CAAC,GAAG,WAAW,KAAK,CAAC;EACtD,IAAI,KAAK,QAAQ,oBAAoB,SAAS,KAAK,QAAQ,0BAA0B,KAAA,GACnF,OAAO;IAAG,OAAO;GAAO;EAAG;EAE7B,MAAM,OAAO,KAAK,QAAQ,UAAU,MAAM,MAAM,EAAE,0BAA0B,KAAA,CAAS;EACrF,MAAM,aAAa,KAAK,OAAO,KAAK,sBAAuB,CAAC,MAAO,QAAQ,EAAE,CAAC;EAE9E,MAAM,gBAAgB,mBAAmB,QAAQ;GAC/C,MAAM,QAAQ,IAAI,SAAS,MAAM,UAAU;GAC3C,OAAO;IACL,KAAK,GAAG,MAAM,OAAO,UAAU,EAAE;IACjC,UAAU,CAAC,KAAK,QAAQ,qBAAqB;IAC7C,MAAM,CAAC,KAAK;GACd;EACF,CAAC;EACD,OAAO;IAAG,OAAO;GAAO,IAAI,EAAE,KAAK,CAAC,IAAI,aAAa,EAAE;EAAE;CAC3D;AACF;;AAGA,IAAM,oBAAN,cAAgC,mBAAmB;CAEvC;CACA;CAFV,YACE,OACA,OACA;EACA,MAAM;EAHE,KAAA,QAAA;EACA,KAAA,QAAA;CAGV;CAEA,UAAoB,MAAgB,OAAiC;EACnE,MAAM,EAAE,UAAU;EAClB,MAAM,YAAY,iBAAiB,KAAK;EACxC,MAAM,aAAa,UAAU,QAAQ,MAAM;EAC3C,IAAI,CAAC,YACH,OAAO,KACL,eAAe,iBAAiB,KAAK,KAAK,CAAC,CAAC,KAAK,GAAG,MAAM,UAAU,MAAM,UAAU,KAAK,IACpF,MAAM,gBAAgB,gCAAgC,UAAU,UAAU,iCACjF;EAGF,MAAM,KAAK,IADQ,iBAAiB,WAAW,YAAY,MAAM,UACjD,CAAC,CAAC,GAAG,KAAK,MAAM,EAAE;EAElC,MAAM,WAAW,MAAM,SAAS,QAAQ,MAAM,gBAAgB,YAAY,MAAM,SAAS;EACzF,OAAO;IAAG,OAAO;GAAO;IAAK,iBAAiB;EAAS;CACzD;AACF;;;;;;;;;AAUA,IAAM,qBAAN,cAAiC,mBAAmB;CAExC;CACA;CAFV,YACE,OACA,OACA;EACA,MAAM;EAHE,KAAA,QAAA;EACA,KAAA,QAAA;CAGV;CAEA,UAAoB,MAAgB,OAAiC;EACnE,MAAM,EAAE,eAAe,gBAAgB,KAAK;EAC5C,MAAM,CAAC,WAAW,eAAe;EACjC,MAAM,KAAK,IAAI,gBAAgB,aAAa;EAC5C,MAAM,QAAQ,WAAW,KAAK,KAAK;EACnC,MAAM,UAAU,WAAW,KAAK;EAChC,MAAM,OAAO,mBAAmB,QAAQ;GACtC,MAAM,UAAU,IAAI,SAAS,EAAE;GAC/B,MAAM,KAAK,MAAM,MAAM,GAAG;GAC1B,OAAO;IAAE,KAAK,GAAG,MAAM,SAAS,SAAS,EAAE,KAAK,GAAG;IAAO,UAAU,GAAG;IAAU,MAAM,GAAG;GAAK;EACjG,CAAC;EACD,MAAM,KAAK,mBAAmB,QAAQ;GACpC,MAAM,UAAU,IAAI,SAAS,EAAE;GAC/B,MAAM,KAAK,QAAQ,MAAM,GAAG;GAC5B,OAAO;IAAE,KAAK,GAAG,GAAG,IAAI,KAAK,MAAM,SAAS,WAAW;IAAK,UAAU,GAAG;IAAU,MAAM,CAAC,GAAG,GAAG,MAAM,OAAO;GAAE;EACjH,CAAC;EACD,MAAM,WAAW,KAAK,MAAM,gBAAgB;EAC5C,OAAO;IACJ,OAAO;GACR;IACC,iBAAiB;IACjB,eAAe;IAAE,QAAQ;IAAI,IAAI;GAAK;EACzC;CACF;AACF;;AAGA,SAAS,aAAa,OAAiC;CACrD,IAAI,CAAC,QAAQ,KAAK,GAAG,OAAO,KAAK,iCAAiC,OAAO;CACzE,OAAO;AACT;;AAGA,SAAS,WAAW,OAA4B;CAC9C,OAAQ,MAAc;AACxB;;AAGA,IAAM,oBAAN,MAAwB;CACF;CAApB,YAAY,QAA2C;EAAnC,KAAA,SAAA;CAAoC;CAExD,GAAG,OAAuB;EACxB,OAAO,KAAK,OAAO,gBAAgB,QAAQ,KAAK,OAAO,MAAM,KAAK,IAAI,KAAK,OAAO,KAAK,KAAK;CAC9F;CAEA,MAAM,OAAuB;EAC3B,OAAO,KAAK,OAAO,MAAM,KAAK;CAChC;CAEA,KAAK,OAAuB;EAC1B,OAAO,KAAK,OAAO,KAAK,KAAK;CAC/B;AACF;;AAGA,SAAS,WAAW,OAAmC;CACrD,OAAO,UAAU,KAAA,KAAa;EAAC;EAAO;EAAQ;EAAO;EAAQ;EAAO;CAAK,CAAC,CAAC,SAAS,MAAM,IAAI;AAChG;;AAGA,SAAS,iBAAiB,MAAsB,KAAgC;CAG9E,MAAM,QADQ,CADE,MAAM,GAAG,uBAAuB,YAAY,IAAI,CAAC,CAC9C,CAAC,CAAC,MAAM,UAAU,MAAM,cAAc,KAAK,aAAa,OAAO,OAAO,MAAM,QAAQ,GAAG,CACxF,CAAC,EAAE,OAAO;CAC5B,IAAI,CAAC,WAAW,KAAK,GAAG,OAAO,KAAA;CAE/B,IAAI,OAAO,SAAS,SAAS,OAAO,SAAS,QAAQ;EACnD,IAAI,CAAC,MAAM,MAAM,QAAQ,OAAO,YAAY,KAAK,QAAQ,QAAQ,gBAAgB,QAAQ,MAAM,GAAG,OAAO,KAAA;EACzG,OAAO,MAAM,SAAS,SAClB;GACE,GAAG;GACH,YAAY,MAAM,WAAW,KAAK,eAAe;IAC/C,QAAQ,UAAU;IAClB,YAAY,UAAU;IACtB,gBAAgB,UAAU;IAC1B,eAAe,UAAU,OAAO;GAClC,EAAE;EACJ,IACA;CACN;CACA,OAAO;AACT"}

package/build/Todo.cjs

@@ -0,0 +1,73 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+require("./JoinRows.cjs");
+const require_EntityMetadata = require("./EntityMetadata.cjs");
+const require_utils = require("./utils.cjs");
+require("./Entity.cjs");
+const require_BaseEntity = require("./BaseEntity.cjs");
+//#region src/Todo.ts
+/** The operations for a given entity type, so they can be executed in bulk. */
+/** A group of insert/update/delete operations for a given entity. */
+var Todo = class {
+	metadata;
+	/** Groups `todos` by their base/subtype, currently only inserts. */
+	static groupInsertsByTypeAndSubType(todos) {
+		const map = /* @__PURE__ */ new Map();
+		for (const todoKey in todos) {
+			const todo = todos[todoKey];
+			if (todo.inserts.length === 0) continue;
+			if (todo.metadata.inheritanceType) for (const [meta, inserts] of require_utils.groupBy(todo.inserts, (e) => require_EntityMetadata.getMetadata(e))) map.set(meta, inserts);
+			else map.set(todo.metadata, todo.inserts);
+		}
+		return map;
+	}
+	inserts = [];
+	updates = [];
+	deletes = [];
+	constructor(metadata) {
+		this.metadata = metadata;
+	}
+};
+/**
+* Scans `entities` for new/updated entities and groups them by type (by base type if applicable).
+*/
+function createTodos(entities) {
+	const todos = {};
+	for (const entity of entities) {
+		const op = require_BaseEntity.getInstanceData(entity).pendingOperation;
+		if (op !== "none") {
+			const todo = getTodo(todos, entity);
+			switch (op) {
+				case "insert":
+					todo.inserts.push(entity);
+					break;
+				case "update":
+					todo.updates.push(entity);
+					break;
+				case "delete": todo.deletes.push(entity);
+			}
+		}
+	}
+	return todos;
+}
+/** getOrSets a `Todo` for `entity` in `todos`. */
+function getTodo(todos, entity) {
+	const meta = require_EntityMetadata.getMetadata(entity);
+	const maybeBase = meta.baseTypes[0] || meta;
+	return todos[maybeBase.type] ??= new Todo(maybeBase);
+}
+/** Given a list of `JoinRow`s for a given table, combine them into a single logical `JoinRowTodo`. */
+function combineJoinRows(joinRows) {
+	const todos = {};
+	for (const [joinTableName, rows] of Object.entries(joinRows)) {
+		const todo = rows.toTodo();
+		if (todo) todos[joinTableName] = todo;
+	}
+	return todos;
+}
+//#endregion
+exports.Todo = Todo;
+exports.combineJoinRows = combineJoinRows;
+exports.createTodos = createTodos;
+exports.getTodo = getTodo;
+
+//# sourceMappingURL=Todo.cjs.map

package/build/Todo.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Todo.cjs","names":["groupBy","getMetadata","getInstanceData"],"sources":["../src/Todo.ts"],"sourcesContent":["/** The operations for a given entity type, so they can be executed in bulk. */\nimport { getInstanceData } from \"./BaseEntity.ts\";\nimport { type Entity } from \"./Entity.ts\";\nimport { type EntityMetadata, getMetadata } from \"./EntityMetadata.ts\";\nimport { type JoinRow, type JoinRows, type ManyToManyLike } from \"./JoinRows.ts\";\nimport { groupBy } from \"./utils.ts\";\n\n/** A group of insert/update/delete operations for a given entity. */\nexport class Todo {\n  /** Groups `todos` by their base/subtype, currently only inserts. */\n  static groupInsertsByTypeAndSubType(todos: Record<string, Todo>): Map<EntityMetadata, Entity[]> {\n    const map = new Map<EntityMetadata, Entity[]>();\n    for (const todoKey in todos) {\n      const todo = todos[todoKey];\n      // Skip update/delete-only todos so hook loops don't allocate entries for empty insert lists\n      if (todo.inserts.length === 0) continue;\n      if (todo.metadata.inheritanceType) {\n        for (const [meta, inserts] of groupBy(todo.inserts, (e) => getMetadata(e))) {\n          map.set(meta, inserts);\n        }\n      } else {\n        map.set(todo.metadata, todo.inserts);\n      }\n    }\n    return map;\n  }\n\n  inserts: Entity[] = [];\n  updates: Entity[] = [];\n  deletes: Entity[] = [];\n\n  constructor(\n    /** The metadata for entities in this todo; it will be the base metadata for any subtypes. */\n    public metadata: EntityMetadata,\n  ) {}\n}\n\n/**\n * Scans `entities` for new/updated entities and groups them by type (by base type if applicable).\n */\nexport function createTodos(entities: Iterable<Entity>): Record<string, Todo> {\n  const todos: Record<string, Todo> = {};\n  for (const entity of entities) {\n    const op = getInstanceData(entity).pendingOperation;\n    if (op !== \"none\") {\n      const todo = getTodo(todos, entity);\n      switch (op) {\n        case \"insert\":\n          todo.inserts.push(entity);\n          break;\n        case \"update\":\n          todo.updates.push(entity);\n          break;\n        case \"delete\":\n          todo.deletes.push(entity);\n          break;\n      }\n    }\n  }\n  return todos;\n}\n\n/** getOrSets a `Todo` for `entity` in `todos`. */\nexport function getTodo(todos: Record<string, Todo>, entity: Entity): Todo {\n  const meta = getMetadata(entity);\n  // Always create todos around the base table, so that we get the best batching against it\n  const maybeBase = meta.baseTypes[0] || meta;\n  return (todos[maybeBase.type] ??= new Todo(maybeBase));\n}\n\nexport interface JoinRowTodo {\n  // Store the m2m reference (either side of the m2m, it doesn't matter which) to help tag/untag the foreign keys\n  m2m: ManyToManyLike;\n  newRows: JoinRow[];\n  deletedRows: JoinRow[];\n  resetAfterFlushed: () => void;\n  /** Resolves a join row's column to the int FK value to flush (an entity's id, or an enum's id). */\n  dbValue(row: JoinRow, columnName: string): number;\n  /** Whether a join row's column points at a not-yet-inserted entity (always false for enum columns). */\n  isNew(row: JoinRow, columnName: string): boolean;\n}\n\n/** Given a list of `JoinRow`s for a given table, combine them into a single logical `JoinRowTodo`. */\nexport function combineJoinRows(joinRows: Record<string, JoinRows>): Record<string, JoinRowTodo> {\n  const todos: Record<string, JoinRowTodo> = {};\n  for (const [joinTableName, rows] of Object.entries(joinRows)) {\n    const todo = rows.toTodo();\n    if (todo) todos[joinTableName] = todo;\n  }\n  return todos;\n}\n"],"mappings":";;;;;;;;;AAQA,IAAa,OAAb,MAAkB;CAyBP;;CAvBT,OAAO,6BAA6B,OAA4D;EAC9F,MAAM,sBAAM,IAAI,IAA8B;EAC9C,KAAK,MAAM,WAAW,OAAO;GAC3B,MAAM,OAAO,MAAM;GAEnB,IAAI,KAAK,QAAQ,WAAW,GAAG;GAC/B,IAAI,KAAK,SAAS,iBAChB,KAAK,MAAM,CAAC,MAAM,YAAYA,cAAAA,QAAQ,KAAK,UAAU,MAAMC,uBAAAA,YAAY,CAAC,CAAC,GACvE,IAAI,IAAI,MAAM,OAAO;QAGvB,IAAI,IAAI,KAAK,UAAU,KAAK,OAAO;EAEvC;EACA,OAAO;CACT;CAEA,UAAoB,CAAC;CACrB,UAAoB,CAAC;CACrB,UAAoB,CAAC;CAErB,YAEE,UACA;EADO,KAAA,WAAA;CACN;AACL;;;;AAKA,SAAgB,YAAY,UAAkD;CAC5E,MAAM,QAA8B,CAAC;CACrC,KAAK,MAAM,UAAU,UAAU;EAC7B,MAAM,KAAKC,mBAAAA,gBAAgB,MAAM,CAAC,CAAC;EACnC,IAAI,OAAO,QAAQ;GACjB,MAAM,OAAO,QAAQ,OAAO,MAAM;GAClC,QAAQ,IAAR;IACE,KAAK;KACH,KAAK,QAAQ,KAAK,MAAM;KACxB;IACF,KAAK;KACH,KAAK,QAAQ,KAAK,MAAM;KACxB;IACF,KAAK,UACH,KAAK,QAAQ,KAAK,MAAM;GAE5B;EACF;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,QAAQ,OAA6B,QAAsB;CACzE,MAAM,OAAOD,uBAAAA,YAAY,MAAM;CAE/B,MAAM,YAAY,KAAK,UAAU,MAAM;CACvC,OAAQ,MAAM,UAAU,UAAU,IAAI,KAAK,SAAS;AACtD;;AAeA,SAAgB,gBAAgB,UAAiE;CAC/F,MAAM,QAAqC,CAAC;CAC5C,KAAK,MAAM,CAAC,eAAe,SAAS,OAAO,QAAQ,QAAQ,GAAG;EAC5D,MAAM,OAAO,KAAK,OAAO;EACzB,IAAI,MAAM,MAAM,iBAAiB;CACnC;CACA,OAAO;AACT"}

package/build/Todo.d.cts

@@ -0,0 +1,38 @@
+import { JoinRow, JoinRows, ManyToManyLike } from "./JoinRows.cjs";
+import { EntityMetadata } from "./EntityMetadata.cjs";
+import { Entity } from "./Entity.cjs";
+//#region src/Todo.d.ts
+/** A group of insert/update/delete operations for a given entity. */
+declare class Todo {
+  /** The metadata for entities in this todo; it will be the base metadata for any subtypes. */
+  metadata: EntityMetadata;
+  /** Groups `todos` by their base/subtype, currently only inserts. */
+  static groupInsertsByTypeAndSubType(todos: Record<string, Todo>): Map<EntityMetadata, Entity[]>;
+  inserts: Entity[];
+  updates: Entity[];
+  deletes: Entity[];
+  constructor(
+  /** The metadata for entities in this todo; it will be the base metadata for any subtypes. */
+  metadata: EntityMetadata);
+}
+/**
+ * Scans `entities` for new/updated entities and groups them by type (by base type if applicable).
+ */
+declare function createTodos(entities: Iterable<Entity>): Record<string, Todo>;
+/** getOrSets a `Todo` for `entity` in `todos`. */
+declare function getTodo(todos: Record<string, Todo>, entity: Entity): Todo;
+interface JoinRowTodo {
+  m2m: ManyToManyLike;
+  newRows: JoinRow[];
+  deletedRows: JoinRow[];
+  resetAfterFlushed: () => void;
+  /** Resolves a join row's column to the int FK value to flush (an entity's id, or an enum's id). */
+  dbValue(row: JoinRow, columnName: string): number;
+  /** Whether a join row's column points at a not-yet-inserted entity (always false for enum columns). */
+  isNew(row: JoinRow, columnName: string): boolean;
+}
+/** Given a list of `JoinRow`s for a given table, combine them into a single logical `JoinRowTodo`. */
+declare function combineJoinRows(joinRows: Record<string, JoinRows>): Record<string, JoinRowTodo>;
+//#endregion
+export { JoinRowTodo, Todo, combineJoinRows, createTodos, getTodo };
+//# sourceMappingURL=Todo.d.cts.map

package/build/Todo.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Todo.d.cts","names":[],"sources":["../src/Todo.ts"],"mappings":";;;;;cAQa;;EAyBF,UAAU;;SAvBZ,6BAA6B,OAAO,eAAe,QAAQ,IAAI,gBAAgB;EAiBtF,SAAS;EACT,SAAS;EACT,SAAS;EAET,YAES;;EAAA,UAAU;;;;;iBAOL,YAAY,UAAU,SAAS,UAAU,eAAe;;iBAuBxD,QAAQ,OAAO,eAAe,OAAO,QAAQ,SAAS;UAOrD;EAEf,KAAK;EACL,SAAS;EACT,aAAa;EACb;;EAEA,QAAQ,KAAK,SAAS;;EAEtB,MAAM,KAAK,SAAS;;;iBAIN,gBAAgB,UAAU,eAAe,YAAY,eAAe"}

package/build/Todo.d.mts

@@ -0,0 +1,38 @@
+import { JoinRow, JoinRows, ManyToManyLike } from "./JoinRows.mjs";
+import { EntityMetadata } from "./EntityMetadata.mjs";
+import { Entity } from "./Entity.mjs";
+//#region src/Todo.d.ts
+/** A group of insert/update/delete operations for a given entity. */
+declare class Todo {
+  /** The metadata for entities in this todo; it will be the base metadata for any subtypes. */
+  metadata: EntityMetadata;
+  /** Groups `todos` by their base/subtype, currently only inserts. */
+  static groupInsertsByTypeAndSubType(todos: Record<string, Todo>): Map<EntityMetadata, Entity[]>;
+  inserts: Entity[];
+  updates: Entity[];
+  deletes: Entity[];
+  constructor(
+  /** The metadata for entities in this todo; it will be the base metadata for any subtypes. */
+  metadata: EntityMetadata);
+}
+/**
+ * Scans `entities` for new/updated entities and groups them by type (by base type if applicable).
+ */
+declare function createTodos(entities: Iterable<Entity>): Record<string, Todo>;
+/** getOrSets a `Todo` for `entity` in `todos`. */
+declare function getTodo(todos: Record<string, Todo>, entity: Entity): Todo;
+interface JoinRowTodo {
+  m2m: ManyToManyLike;
+  newRows: JoinRow[];
+  deletedRows: JoinRow[];
+  resetAfterFlushed: () => void;
+  /** Resolves a join row's column to the int FK value to flush (an entity's id, or an enum's id). */
+  dbValue(row: JoinRow, columnName: string): number;
+  /** Whether a join row's column points at a not-yet-inserted entity (always false for enum columns). */
+  isNew(row: JoinRow, columnName: string): boolean;
+}
+/** Given a list of `JoinRow`s for a given table, combine them into a single logical `JoinRowTodo`. */
+declare function combineJoinRows(joinRows: Record<string, JoinRows>): Record<string, JoinRowTodo>;
+//#endregion
+export { JoinRowTodo, Todo, combineJoinRows, createTodos, getTodo };
+//# sourceMappingURL=Todo.d.mts.map

package/build/Todo.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Todo.d.mts","names":[],"sources":["../src/Todo.ts"],"mappings":";;;;;cAQa;;EAyBF,UAAU;;SAvBZ,6BAA6B,OAAO,eAAe,QAAQ,IAAI,gBAAgB;EAiBtF,SAAS;EACT,SAAS;EACT,SAAS;EAET,YAES;;EAAA,UAAU;;;;;iBAOL,YAAY,UAAU,SAAS,UAAU,eAAe;;iBAuBxD,QAAQ,OAAO,eAAe,OAAO,QAAQ,SAAS;UAOrD;EAEf,KAAK;EACL,SAAS;EACT,aAAa;EACb;;EAEA,QAAQ,KAAK,SAAS;;EAEtB,MAAM,KAAK,SAAS;;;iBAIN,gBAAgB,UAAU,eAAe,YAAY,eAAe"}

package/build/Todo.js

@@ -1,73 +1,69 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Todo = void 0;
-exports.createTodos = createTodos;
-exports.getTodo = getTodo;
-exports.combineJoinRows = combineJoinRows;
+import "./JoinRows.js";
+import { getMetadata } from "./EntityMetadata.js";
+import { groupBy } from "./utils.js";
+import "./Entity.js";
+import { getInstanceData } from "./BaseEntity.js";
+//#region src/Todo.ts
 /** The operations for a given entity type, so they can be executed in bulk. */
-const BaseEntity_1 = require("./BaseEntity");
-const EntityMetadata_1 = require("./EntityMetadata");
-const utils_1 = require("./utils");
 /** A group of insert/update/delete operations for a given entity. */
-class Todo {
-    metadata;
-    /** Groups `todos` by their base/subtype, currently only inserts. */
-    static groupInsertsByTypeAndSubType(todos) {
-        return new Map(Object.values(todos).flatMap((todo) => {
-            return todo.metadata.inheritanceType
-                ? [...(0, utils_1.groupBy)(todo.inserts, (e) => (0, EntityMetadata_1.getMetadata)(e)).entries()]
-                : [[todo.metadata, todo.inserts]];
-        }));
-    }
-    inserts = [];
-    updates = [];
-    deletes = [];
-    constructor(
-    /** The metadata for entities in this todo; it will be the base metadata for any subtypes. */
-    metadata) {
-        this.metadata = metadata;
-    }
-}
-exports.Todo = Todo;
+var Todo = class {
+	metadata;
+	/** Groups `todos` by their base/subtype, currently only inserts. */
+	static groupInsertsByTypeAndSubType(todos) {
+		const map = /* @__PURE__ */ new Map();
+		for (const todoKey in todos) {
+			const todo = todos[todoKey];
+			if (todo.inserts.length === 0) continue;
+			if (todo.metadata.inheritanceType) for (const [meta, inserts] of groupBy(todo.inserts, (e) => getMetadata(e))) map.set(meta, inserts);
+			else map.set(todo.metadata, todo.inserts);
+		}
+		return map;
+	}
+	inserts = [];
+	updates = [];
+	deletes = [];
+	constructor(metadata) {
+		this.metadata = metadata;
+	}
+};
 /**
- * Scans `entities` for new/updated entities and groups them by type (by base type if applicable).
- */
+* Scans `entities` for new/updated entities and groups them by type (by base type if applicable).
+*/
 function createTodos(entities) {
-    const todos = {};
-    for (const entity of entities) {
-        const op = (0, BaseEntity_1.getInstanceData)(entity).pendingOperation;
-        if (op !== "none") {
-            const todo = getTodo(todos, entity);
-            switch (op) {
-                case "insert":
-                    todo.inserts.push(entity);
-                    break;
-                case "update":
-                    todo.updates.push(entity);
-                    break;
-                case "delete":
-                    todo.deletes.push(entity);
-                    break;
-            }
-        }
-    }
-    return todos;
+	const todos = {};
+	for (const entity of entities) {
+		const op = getInstanceData(entity).pendingOperation;
+		if (op !== "none") {
+			const todo = getTodo(todos, entity);
+			switch (op) {
+				case "insert":
+					todo.inserts.push(entity);
+					break;
+				case "update":
+					todo.updates.push(entity);
+					break;
+				case "delete": todo.deletes.push(entity);
+			}
+		}
+	}
+	return todos;
 }
 /** getOrSets a `Todo` for `entity` in `todos`. */
 function getTodo(todos, entity) {
-    const meta = (0, EntityMetadata_1.getMetadata)(entity);
-    // Always create todos around the base table, so that we get the best batching against it
-    const maybeBase = meta.baseTypes[0] || meta;
-    return (todos[maybeBase.type] ??= new Todo(maybeBase));
+	const meta = getMetadata(entity);
+	const maybeBase = meta.baseTypes[0] || meta;
+	return todos[maybeBase.type] ??= new Todo(maybeBase);
 }
 /** Given a list of `JoinRow`s for a given table, combine them into a single logical `JoinRowTodo`. */
 function combineJoinRows(joinRows) {
-    const todos = {};
-    for (const [joinTableName, rows] of Object.entries(joinRows)) {
-        const todo = rows.toTodo();
-        if (todo)
-            todos[joinTableName] = todo;
-    }
-    return todos;
+	const todos = {};
+	for (const [joinTableName, rows] of Object.entries(joinRows)) {
+		const todo = rows.toTodo();
+		if (todo) todos[joinTableName] = todo;
+	}
+	return todos;
 }
+//#endregion
+export { Todo, combineJoinRows, createTodos, getTodo };
+
 //# sourceMappingURL=Todo.js.map

package/build/Todo.js.map

@@ -1 +1 @@
-{"version":3,"file":"Todo.js","sourceRoot":"","sources":["../src/Todo.ts"],"names":[],"mappings":";;;AAiCA,kCAoBC;AAGD,0BAKC;AAeD,0CAOC;AAnFD,+EAA+E;AAC/E,6CAA+C;AAE/C,qDAA+D;AAE/D,mCAAkC;AAElC,qEAAqE;AACrE,MAAa,IAAI;IAkBN;IAjBT,oEAAoE;IACpE,MAAM,CAAC,4BAA4B,CAAC,KAA2B;QAC7D,OAAO,IAAI,GAAG,CACZ,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YACpC,OAAO,IAAI,CAAC,QAAQ,CAAC,eAAe;gBAClC,CAAC,CAAC,CAAC,GAAG,IAAA,eAAO,EAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,4BAAW,EAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC7D,CAAC,CAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,CAAW,CAAC;QACjD,CAAC,CAAC,CACH,CAAC;IACJ,CAAC;IAED,OAAO,GAAa,EAAE,CAAC;IACvB,OAAO,GAAa,EAAE,CAAC;IACvB,OAAO,GAAa,EAAE,CAAC;IAEvB;IACE,6FAA6F;IACtF,QAAwB;QAAxB,aAAQ,GAAR,QAAQ,CAAgB;IAC9B,CAAC;CACL;AApBD,oBAoBC;AAED;;GAEG;AACH,SAAgB,WAAW,CAAC,QAA2B;IACrD,MAAM,KAAK,GAAyB,EAAE,CAAC;IACvC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,IAAA,4BAAe,EAAC,MAAM,CAAC,CAAC,gBAAgB,CAAC;QACpD,IAAI,EAAE,KAAK,MAAM,EAAE,CAAC;YAClB,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YACpC,QAAQ,EAAE,EAAE,CAAC;gBACX,KAAK,QAAQ;oBACX,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC1B,MAAM;gBACR,KAAK,QAAQ;oBACX,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC1B,MAAM;gBACR,KAAK,QAAQ;oBACX,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC1B,MAAM;YACV,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,kDAAkD;AAClD,SAAgB,OAAO,CAAC,KAA2B,EAAE,MAAc;IACjE,MAAM,IAAI,GAAG,IAAA,4BAAW,EAAC,MAAM,CAAC,CAAC;IACjC,yFAAyF;IACzF,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;IAC5C,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;AACzD,CAAC;AAcD,sGAAsG;AACtG,SAAgB,eAAe,CAAC,QAAkC;IAChE,MAAM,KAAK,GAAgC,EAAE,CAAC;IAC9C,KAAK,MAAM,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,IAAI,IAAI;YAAE,KAAK,CAAC,aAAa,CAAC,GAAG,IAAI,CAAC;IACxC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC"}
+{"version":3,"file":"Todo.js","names":[],"sources":["../src/Todo.ts"],"sourcesContent":["/** The operations for a given entity type, so they can be executed in bulk. */\nimport { getInstanceData } from \"./BaseEntity.ts\";\nimport { type Entity } from \"./Entity.ts\";\nimport { type EntityMetadata, getMetadata } from \"./EntityMetadata.ts\";\nimport { type JoinRow, type JoinRows, type ManyToManyLike } from \"./JoinRows.ts\";\nimport { groupBy } from \"./utils.ts\";\n\n/** A group of insert/update/delete operations for a given entity. */\nexport class Todo {\n  /** Groups `todos` by their base/subtype, currently only inserts. */\n  static groupInsertsByTypeAndSubType(todos: Record<string, Todo>): Map<EntityMetadata, Entity[]> {\n    const map = new Map<EntityMetadata, Entity[]>();\n    for (const todoKey in todos) {\n      const todo = todos[todoKey];\n      // Skip update/delete-only todos so hook loops don't allocate entries for empty insert lists\n      if (todo.inserts.length === 0) continue;\n      if (todo.metadata.inheritanceType) {\n        for (const [meta, inserts] of groupBy(todo.inserts, (e) => getMetadata(e))) {\n          map.set(meta, inserts);\n        }\n      } else {\n        map.set(todo.metadata, todo.inserts);\n      }\n    }\n    return map;\n  }\n\n  inserts: Entity[] = [];\n  updates: Entity[] = [];\n  deletes: Entity[] = [];\n\n  constructor(\n    /** The metadata for entities in this todo; it will be the base metadata for any subtypes. */\n    public metadata: EntityMetadata,\n  ) {}\n}\n\n/**\n * Scans `entities` for new/updated entities and groups them by type (by base type if applicable).\n */\nexport function createTodos(entities: Iterable<Entity>): Record<string, Todo> {\n  const todos: Record<string, Todo> = {};\n  for (const entity of entities) {\n    const op = getInstanceData(entity).pendingOperation;\n    if (op !== \"none\") {\n      const todo = getTodo(todos, entity);\n      switch (op) {\n        case \"insert\":\n          todo.inserts.push(entity);\n          break;\n        case \"update\":\n          todo.updates.push(entity);\n          break;\n        case \"delete\":\n          todo.deletes.push(entity);\n          break;\n      }\n    }\n  }\n  return todos;\n}\n\n/** getOrSets a `Todo` for `entity` in `todos`. */\nexport function getTodo(todos: Record<string, Todo>, entity: Entity): Todo {\n  const meta = getMetadata(entity);\n  // Always create todos around the base table, so that we get the best batching against it\n  const maybeBase = meta.baseTypes[0] || meta;\n  return (todos[maybeBase.type] ??= new Todo(maybeBase));\n}\n\nexport interface JoinRowTodo {\n  // Store the m2m reference (either side of the m2m, it doesn't matter which) to help tag/untag the foreign keys\n  m2m: ManyToManyLike;\n  newRows: JoinRow[];\n  deletedRows: JoinRow[];\n  resetAfterFlushed: () => void;\n  /** Resolves a join row's column to the int FK value to flush (an entity's id, or an enum's id). */\n  dbValue(row: JoinRow, columnName: string): number;\n  /** Whether a join row's column points at a not-yet-inserted entity (always false for enum columns). */\n  isNew(row: JoinRow, columnName: string): boolean;\n}\n\n/** Given a list of `JoinRow`s for a given table, combine them into a single logical `JoinRowTodo`. */\nexport function combineJoinRows(joinRows: Record<string, JoinRows>): Record<string, JoinRowTodo> {\n  const todos: Record<string, JoinRowTodo> = {};\n  for (const [joinTableName, rows] of Object.entries(joinRows)) {\n    const todo = rows.toTodo();\n    if (todo) todos[joinTableName] = todo;\n  }\n  return todos;\n}\n"],"mappings":";;;;;;;;AAQA,IAAa,OAAb,MAAkB;CAyBP;;CAvBT,OAAO,6BAA6B,OAA4D;EAC9F,MAAM,sBAAM,IAAI,IAA8B;EAC9C,KAAK,MAAM,WAAW,OAAO;GAC3B,MAAM,OAAO,MAAM;GAEnB,IAAI,KAAK,QAAQ,WAAW,GAAG;GAC/B,IAAI,KAAK,SAAS,iBAChB,KAAK,MAAM,CAAC,MAAM,YAAY,QAAQ,KAAK,UAAU,MAAM,YAAY,CAAC,CAAC,GACvE,IAAI,IAAI,MAAM,OAAO;QAGvB,IAAI,IAAI,KAAK,UAAU,KAAK,OAAO;EAEvC;EACA,OAAO;CACT;CAEA,UAAoB,CAAC;CACrB,UAAoB,CAAC;CACrB,UAAoB,CAAC;CAErB,YAEE,UACA;EADO,KAAA,WAAA;CACN;AACL;;;;AAKA,SAAgB,YAAY,UAAkD;CAC5E,MAAM,QAA8B,CAAC;CACrC,KAAK,MAAM,UAAU,UAAU;EAC7B,MAAM,KAAK,gBAAgB,MAAM,CAAC,CAAC;EACnC,IAAI,OAAO,QAAQ;GACjB,MAAM,OAAO,QAAQ,OAAO,MAAM;GAClC,QAAQ,IAAR;IACE,KAAK;KACH,KAAK,QAAQ,KAAK,MAAM;KACxB;IACF,KAAK;KACH,KAAK,QAAQ,KAAK,MAAM;KACxB;IACF,KAAK,UACH,KAAK,QAAQ,KAAK,MAAM;GAE5B;EACF;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,QAAQ,OAA6B,QAAsB;CACzE,MAAM,OAAO,YAAY,MAAM;CAE/B,MAAM,YAAY,KAAK,UAAU,MAAM;CACvC,OAAQ,MAAM,UAAU,UAAU,IAAI,KAAK,SAAS;AACtD;;AAeA,SAAgB,gBAAgB,UAAiE;CAC/F,MAAM,QAAqC,CAAC;CAC5C,KAAK,MAAM,CAAC,eAAe,SAAS,OAAO,QAAQ,QAAQ,GAAG;EAC5D,MAAM,OAAO,KAAK,OAAO;EACzB,IAAI,MAAM,MAAM,iBAAiB;CACnC;CACA,OAAO;AACT"}

package/build/TypeInfo.cjs

@@ -0,0 +1,80 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+//#region src/TypeInfo.ts
+/**
+* Normalizes known PostgreSQL type synonyms without treating coercible types or user types as equal.
+* The output compatibility checks compare these names, so normalize only spellings of the same type.
+*
+* I.e. `integer` and `int` both mean `int4`; `integer[]` and `int4[]` also describe the same SQL type.
+* Keeping these spellings distinct would reject compatible outputs just because their serdes use
+* different names for the same representation.
+*
+* I.e. `int4` can be promoted to `int8`, but they are not synonyms: classic pg returns int4 as a number
+* and int8 as a string. Treating them as equal could admit a compound whose first operand's decoder
+* cannot handle the common SQL type. This function does not choose or apply a conversion.
+*
+* I.e. `citext` must stay distinct from `text`: they disagree on whether 'Alice' and 'alice' are equal,
+* which matters when a set operation compares rows. A user-defined `app.email` domain over text can
+* also impose constraints that text does not. Unknown names remain unchanged, including their schema
+* and quoting; neither coercibility nor a shared base type proves that their outputs are compatible.
+*/
+function canonicalDbType(dbType) {
+	if (dbType.endsWith("[]")) return `${canonicalDbType(dbType.slice(0, -2))}[]`;
+	switch (dbType) {
+		case "smallint": return "int2";
+		case "int":
+		case "integer": return "int4";
+		case "bigint": return "int8";
+		case "decimal": return "numeric";
+		case "real": return "float4";
+		case "double precision": return "float8";
+		case "boolean": return "bool";
+		case "character varying": return "varchar";
+		case "character": return "bpchar";
+		case "timestamp without time zone": return "timestamp";
+		case "timestamp with time zone": return "timestamptz";
+		case "time without time zone": return "time";
+		case "time with time zone": return "timetz";
+		default: return dbType;
+	}
+}
+const arrayDomains = /* @__PURE__ */ new Map();
+const arrayElementDbTypes = /* @__PURE__ */ new Set([
+	"bool",
+	"bytea",
+	"int2",
+	"int4",
+	"int8",
+	"float4",
+	"float8",
+	"numeric",
+	"text",
+	"varchar",
+	"bpchar",
+	"uuid",
+	"json",
+	"jsonb"
+]);
+/**
+* Describes elementwise conversion only for known physical array parsers and stable domain conversion.
+*
+* I.e. `a.id.arrayAgg()` wraps Author's tag and `idMeta` in its domain token, but has no scalar
+* `idMeta` of its own. Repeated expressions share the token; IDs of subtypes with a shared tag do not.
+* Native enum/citext, date/time, and nested SQL arrays remain unknown. Numeric elements can be numbers
+* in classic pg and strings in lazy binary reads, so a scalar string-only mapper is not sufficient.
+*/
+function arrayOutputType(outputType) {
+	if (!outputType?.arrayElementSafe || !arrayElementDbTypes.has(outputType.dbType)) return void 0;
+	let domains = arrayDomains.get(outputType.domain);
+	if (!domains) arrayDomains.set(outputType.domain, domains = /* @__PURE__ */ new Map());
+	let domain = domains.get(outputType.idMeta);
+	if (!domain) domains.set(outputType.idMeta, domain = Symbol("joist.arrayOutput"));
+	return {
+		dbType: `${outputType.dbType}[]`,
+		domain
+	};
+}
+//#endregion
+exports.arrayOutputType = arrayOutputType;
+exports.canonicalDbType = canonicalDbType;
+
+//# sourceMappingURL=TypeInfo.cjs.map

package/build/TypeInfo.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"TypeInfo.cjs","names":[],"sources":["../src/TypeInfo.ts"],"sourcesContent":["// Keep compatibility metadata a runtime leaf in both CJS and ESM builds.\nimport type { EntityMetadata } from \"./EntityMetadata.ts\";\n\n/**\n * Runtime proof that values can share scalar conversions.\n *\n * PostgreSQL compares projected SQL rows and chooses a common SQL type before Joist decodes them.\n * A compound uses one decoder per output column and retains an encoder for later comparisons and\n * coalesce fallbacks. TypeScript result types are erased, and equal SQL storage types do not imply\n * equal logical domains.\n *\n * I.e. Author.id and Book.author_id are compatible Author IDs despite having separate serdes, while\n * Book.id must not decode as an Author ID just because both use int4. Author.age and Author.age.sum()\n * both expose TypeScript numbers but produce int4 and int8 driver values. Enum, custom-mapper, and\n * JSON-schema domain tokens also prevent unrelated conversions from mixing.\n *\n * Compatibility requires exact equality of canonical `dbType`, `domain`, and `idMeta`. An absent\n * descriptor is unknown, not an identity codec. `idMeta` identifies scalar IDs only; arrays retain\n * their element domain separately so they cannot select a polymorphic IN component. Raw `sql<R>`\n * annotations supply no runtime evidence. This descriptor does not implement conversions.\n */\nexport interface TypeInfo {\n  dbType: string;\n  domain: unknown;\n  idMeta?: EntityMetadata;\n  /** Internal conversion proof, consistent for equal dbType/domain/idMeta; not another compatibility key. */\n  arrayElementSafe?: boolean;\n}\n\n/**\n * Normalizes known PostgreSQL type synonyms without treating coercible types or user types as equal.\n * The output compatibility checks compare these names, so normalize only spellings of the same type.\n *\n * I.e. `integer` and `int` both mean `int4`; `integer[]` and `int4[]` also describe the same SQL type.\n * Keeping these spellings distinct would reject compatible outputs just because their serdes use\n * different names for the same representation.\n *\n * I.e. `int4` can be promoted to `int8`, but they are not synonyms: classic pg returns int4 as a number\n * and int8 as a string. Treating them as equal could admit a compound whose first operand's decoder\n * cannot handle the common SQL type. This function does not choose or apply a conversion.\n *\n * I.e. `citext` must stay distinct from `text`: they disagree on whether 'Alice' and 'alice' are equal,\n * which matters when a set operation compares rows. A user-defined `app.email` domain over text can\n * also impose constraints that text does not. Unknown names remain unchanged, including their schema\n * and quoting; neither coercibility nor a shared base type proves that their outputs are compatible.\n */\nexport function canonicalDbType(dbType: string): string {\n  if (dbType.endsWith(\"[]\")) return `${canonicalDbType(dbType.slice(0, -2))}[]`;\n  switch (dbType) {\n    case \"smallint\":\n      return \"int2\";\n    case \"int\":\n    case \"integer\":\n      return \"int4\";\n    case \"bigint\":\n      return \"int8\";\n    case \"decimal\":\n      return \"numeric\";\n    case \"real\":\n      return \"float4\";\n    case \"double precision\":\n      return \"float8\";\n    case \"boolean\":\n      return \"bool\";\n    case \"character varying\":\n      return \"varchar\";\n    case \"character\":\n      return \"bpchar\";\n    case \"timestamp without time zone\":\n      return \"timestamp\";\n    case \"timestamp with time zone\":\n      return \"timestamptz\";\n    case \"time without time zone\":\n      return \"time\";\n    case \"time with time zone\":\n      return \"timetz\";\n    default:\n      return dbType;\n  }\n}\n\nconst arrayDomains = new Map<unknown, Map<EntityMetadata | undefined, symbol>>();\n\n// Both classic pg and lazy binary reads decode these physical arrays, not an unparsed array string.\nconst arrayElementDbTypes = new Set([\n  \"bool\",\n  \"bytea\",\n  \"int2\",\n  \"int4\",\n  \"int8\",\n  \"float4\",\n  \"float8\",\n  \"numeric\",\n  \"text\",\n  \"varchar\",\n  \"bpchar\",\n  \"uuid\",\n  \"json\",\n  \"jsonb\",\n]);\n\n/**\n * Describes elementwise conversion only for known physical array parsers and stable domain conversion.\n *\n * I.e. `a.id.arrayAgg()` wraps Author's tag and `idMeta` in its domain token, but has no scalar\n * `idMeta` of its own. Repeated expressions share the token; IDs of subtypes with a shared tag do not.\n * Native enum/citext, date/time, and nested SQL arrays remain unknown. Numeric elements can be numbers\n * in classic pg and strings in lazy binary reads, so a scalar string-only mapper is not sufficient.\n */\nexport function arrayOutputType(outputType: TypeInfo | undefined): TypeInfo | undefined {\n  if (!outputType?.arrayElementSafe || !arrayElementDbTypes.has(outputType.dbType)) return undefined;\n  let domains = arrayDomains.get(outputType.domain);\n  if (!domains) arrayDomains.set(outputType.domain, (domains = new Map()));\n  let domain = domains.get(outputType.idMeta);\n  if (!domain) domains.set(outputType.idMeta, (domain = Symbol(\"joist.arrayOutput\")));\n  return { dbType: `${outputType.dbType}[]`, domain };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AA8CA,SAAgB,gBAAgB,QAAwB;CACtD,IAAI,OAAO,SAAS,IAAI,GAAG,OAAO,GAAG,gBAAgB,OAAO,MAAM,GAAG,EAAE,CAAC,EAAE;CAC1E,QAAQ,QAAR;EACE,KAAK,YACH,OAAO;EACT,KAAK;EACL,KAAK,WACH,OAAO;EACT,KAAK,UACH,OAAO;EACT,KAAK,WACH,OAAO;EACT,KAAK,QACH,OAAO;EACT,KAAK,oBACH,OAAO;EACT,KAAK,WACH,OAAO;EACT,KAAK,qBACH,OAAO;EACT,KAAK,aACH,OAAO;EACT,KAAK,+BACH,OAAO;EACT,KAAK,4BACH,OAAO;EACT,KAAK,0BACH,OAAO;EACT,KAAK,uBACH,OAAO;EACT,SACE,OAAO;CACX;AACF;AAEA,MAAM,+BAAe,IAAI,IAAsD;AAG/E,MAAM,sCAAsB,IAAI,IAAI;CAClC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;;;;;;;;AAUD,SAAgB,gBAAgB,YAAwD;CACtF,IAAI,CAAC,YAAY,oBAAoB,CAAC,oBAAoB,IAAI,WAAW,MAAM,GAAG,OAAO,KAAA;CACzF,IAAI,UAAU,aAAa,IAAI,WAAW,MAAM;CAChD,IAAI,CAAC,SAAS,aAAa,IAAI,WAAW,QAAS,0BAAU,IAAI,IAAI,CAAE;CACvE,IAAI,SAAS,QAAQ,IAAI,WAAW,MAAM;CAC1C,IAAI,CAAC,QAAQ,QAAQ,IAAI,WAAW,QAAS,SAAS,OAAO,mBAAmB,CAAE;CAClF,OAAO;EAAE,QAAQ,GAAG,WAAW,OAAO;EAAK;CAAO;AACpD"}

package/build/TypeInfo.d.cts

@@ -0,0 +1,57 @@
+import { EntityMetadata } from "./EntityMetadata.cjs";
+//#region src/TypeInfo.d.ts
+/**
+ * Runtime proof that values can share scalar conversions.
+ *
+ * PostgreSQL compares projected SQL rows and chooses a common SQL type before Joist decodes them.
+ * A compound uses one decoder per output column and retains an encoder for later comparisons and
+ * coalesce fallbacks. TypeScript result types are erased, and equal SQL storage types do not imply
+ * equal logical domains.
+ *
+ * I.e. Author.id and Book.author_id are compatible Author IDs despite having separate serdes, while
+ * Book.id must not decode as an Author ID just because both use int4. Author.age and Author.age.sum()
+ * both expose TypeScript numbers but produce int4 and int8 driver values. Enum, custom-mapper, and
+ * JSON-schema domain tokens also prevent unrelated conversions from mixing.
+ *
+ * Compatibility requires exact equality of canonical `dbType`, `domain`, and `idMeta`. An absent
+ * descriptor is unknown, not an identity codec. `idMeta` identifies scalar IDs only; arrays retain
+ * their element domain separately so they cannot select a polymorphic IN component. Raw `sql<R>`
+ * annotations supply no runtime evidence. This descriptor does not implement conversions.
+ */
+interface TypeInfo {
+  dbType: string;
+  domain: unknown;
+  idMeta?: EntityMetadata;
+  /** Internal conversion proof, consistent for equal dbType/domain/idMeta; not another compatibility key. */
+  arrayElementSafe?: boolean;
+}
+/**
+ * Normalizes known PostgreSQL type synonyms without treating coercible types or user types as equal.
+ * The output compatibility checks compare these names, so normalize only spellings of the same type.
+ *
+ * I.e. `integer` and `int` both mean `int4`; `integer[]` and `int4[]` also describe the same SQL type.
+ * Keeping these spellings distinct would reject compatible outputs just because their serdes use
+ * different names for the same representation.
+ *
+ * I.e. `int4` can be promoted to `int8`, but they are not synonyms: classic pg returns int4 as a number
+ * and int8 as a string. Treating them as equal could admit a compound whose first operand's decoder
+ * cannot handle the common SQL type. This function does not choose or apply a conversion.
+ *
+ * I.e. `citext` must stay distinct from `text`: they disagree on whether 'Alice' and 'alice' are equal,
+ * which matters when a set operation compares rows. A user-defined `app.email` domain over text can
+ * also impose constraints that text does not. Unknown names remain unchanged, including their schema
+ * and quoting; neither coercibility nor a shared base type proves that their outputs are compatible.
+ */
+declare function canonicalDbType(dbType: string): string;
+/**
+ * Describes elementwise conversion only for known physical array parsers and stable domain conversion.
+ *
+ * I.e. `a.id.arrayAgg()` wraps Author's tag and `idMeta` in its domain token, but has no scalar
+ * `idMeta` of its own. Repeated expressions share the token; IDs of subtypes with a shared tag do not.
+ * Native enum/citext, date/time, and nested SQL arrays remain unknown. Numeric elements can be numbers
+ * in classic pg and strings in lazy binary reads, so a scalar string-only mapper is not sufficient.
+ */
+declare function arrayOutputType(outputType: TypeInfo | undefined): TypeInfo | undefined;
+//#endregion
+export { TypeInfo, arrayOutputType, canonicalDbType };
+//# sourceMappingURL=TypeInfo.d.cts.map

package/build/TypeInfo.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"TypeInfo.d.cts","names":[],"sources":["../src/TypeInfo.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;UAqBiB;EACf;EACA;EACA,SAAS;;EAET;;;;;;;;;;;;;;;;;;;iBAoBc,gBAAgB;;;;;;;;;iBA+DhB,gBAAgB,YAAY,uBAAuB"}