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

package/build/preloading/JsonAggregatePreloader.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"JsonAggregatePreloader.cjs","names":["partitionHint","AliasAssigner","getTables","kqDot","kq","canPreload","ConditionBuilder","fail","keyToNumber","keyToTaggedId","getMetadataForField","getMetadata","getEmInternalApi"],"sources":["../../src/preloading/JsonAggregatePreloader.ts"],"sourcesContent":["import { type Entity } from \"../Entity.ts\";\nimport { getEmInternalApi } from \"../EntityManager.ts\";\nimport { type EntityMetadata, type ManyToManyEnumField, getMetadata, getMetadataForField } from \"../EntityMetadata.ts\";\nimport { type EntityOrId, type HintNode } from \"../HintTree.ts\";\nimport { type ManyToManyLike } from \"../JoinRows.ts\";\nimport { keyToNumber, keyToTaggedId } from \"../keys.ts\";\nimport { type LoadHint, type NestedLoadHint } from \"../loadHints.ts\";\nimport { type JoinResult, type PreloadHydrator, type PreloadPlugin } from \"../plugins/PreloadPlugin.ts\";\nimport { ConditionBuilder } from \"../queries/ConditionBuilder.ts\";\nimport { type JoinTable, type LateralJoinTable, type ParsedFindQuery, getTables } from \"../queries/find/QueryParser.ts\";\nimport { AliasAssigner } from \"../queries/sql/AliasAssigner.ts\";\nimport { kq, kqDot } from \"../queries/sql/keywords.ts\";\nimport { type RowData } from \"../RowData.ts\";\nimport { fail } from \"../utils.ts\";\nimport { canPreload } from \"./canPreload.ts\";\nimport { partitionHint } from \"./partitionHint.ts\";\n\n/**\n * A PreloadPlugin implementation that uses `CROSS LATERAL JOIN` and `json_aggregate`\n * to preload/reduce a subtree of data while still being a single row of data.\n */\nexport class JsonAggregatePreloader implements PreloadPlugin {\n  partitionHint(\n    meta: EntityMetadata | undefined,\n    hint: LoadHint<any>,\n  ): [NestedLoadHint<any> | undefined, NestedLoadHint<any> | undefined] {\n    return partitionHint(meta, hint);\n  }\n\n  addPreloading<T extends Entity>(\n    meta: EntityMetadata,\n    root: HintNode<T>,\n    query: ParsedFindQuery,\n  ): PreloadHydrator | undefined {\n    const assigner = new AliasAssigner(query);\n\n    // Get the existing primary alias\n    const alias = getTables(query)[0].alias;\n    const joins = calcLateralJoins(assigner, { tree: root, alias, meta }, root, alias, meta);\n    // If there are no sql-based preload in the hints, just return\n    if (joins.length === 0) return undefined;\n\n    // Include the aggregate `_b1._ as _prequel`, `_c._ as _randomComment`\n    for (const { alias, relationAlias, join } of joins) {\n      query.selects.push({\n        sql: `${kqDot(alias, \"_\")} as ${kq(relationAlias)}`,\n        aliases: [alias],\n        bindings: [],\n      });\n      query.tables.push(join);\n    }\n\n    return (rows, entities) => {\n      for (let i = 0; i < entities.length; i++) {\n        const parent = entities[i];\n        for (const { relationAlias, hydrator } of joins) {\n          hydrator(parent, parent, readRowValue(rows, i, relationAlias) ?? []);\n        }\n      }\n    };\n  }\n\n  getPreloadJoins<T extends Entity>(meta: EntityMetadata, root: HintNode<T>, query: ParsedFindQuery): JoinResult[] {\n    const assigner = new AliasAssigner(query);\n\n    // Get the existing primary alias\n    const alias = getTables(query)[0].alias;\n    const joins = calcLateralJoins(assigner, { tree: root, alias, meta }, root, alias, meta);\n    // If there are no sql-based preload in the hints, just return\n\n    // Adapt our json aggregate joins to the higher-level JoinResult\n    return joins.map((join) => {\n      return {\n        selects: [{ value: kqDot(join.alias, \"_\"), as: join.relationAlias }],\n        join: join.join,\n        hydrator: (rows, entities) => {\n          for (let i = 0; i < entities.length; i++) {\n            const parent = entities[i];\n            join.hydrator(parent, parent, readRowValue(rows, i, join.relationAlias) ?? []);\n          }\n        },\n      };\n    });\n  }\n}\n\n/** Decodes an array-of-arrays of children entries, and stores them the `parent`'s relation. */\ntype AggregateJsonHydrator = (root: Entity, parent: Entity, arrays: unknown[][]) => void;\n\n/**\n * For a given hint tree `hint`, finds all SQL-able relations and preloads them.\n *\n * Specifically we use `json_agg` & `json_build_array` to `CROSS LATERAL JOIN`\n * children/grand children back as arbitrarily-deeply nested arrays, and then\n * stash the results in the `EntityManager` `joinLoadedRelations` cache, which\n * each join-instrumented relation will check before making its SQL calls.\n *\n * https://sqlfum.pt/?n=60&indent=2&spaces=1&simplify=1&align=0&case=lower&sql=c2VsZWN0IGEuaWQsIGIuXyBhcyBiLCBjMS5fIGFzIGMxLCBhMS5fIGFzIGExIGZyb20gYXV0aG9ycyBhIGNyb3NzIGpvaW4gbGF0ZXJhbCAoIHNlbGVjdCBqc29uX2FnZyhqc29uX2J1aWxkX2FycmF5KGIuaWQsIGIudGl0bGUsIGIuIm9yZGVyIiwgYi5kZWxldGVkX2F0LCBiLmNyZWF0ZWRfYXQsIGIudXBkYXRlZF9hdCwgYi5hdXRob3JfaWQsIGJyLl8pKSBhcyBfIGZyb20gYm9va3MgYiBjcm9zcyBqb2luIGxhdGVyYWwgKCBzZWxlY3QganNvbl9hZ2coanNvbl9idWlsZF9hcnJheShici5pZCwgYnIucmF0aW5nLCBici5pc19wdWJsaWMsIGJyLmlzX3Rlc3QsIGJyLmNyZWF0ZWRfYXQsIGJyLnVwZGF0ZWRfYXQsIGJyLmJvb2tfaWQsIGMuXykpIGFzIF8gZnJvbSBib29rX3Jldmlld3MgYnIgY3Jvc3Mgam9pbiBsYXRlcmFsICggc2VsZWN0IGpzb25fYWdnKGpzb25fYnVpbGRfYXJyYXkoYy5pZCwgYy50ZXh0LCBjLmNyZWF0ZWRfYXQsIGMudXBkYXRlZF9hdCwgYy51c2VyX2lkLCBjLnBhcmVudF9hdXRob3JfaWQsIGMucGFyZW50X2Jvb2tfaWQsIGMucGFyZW50X2Jvb2tfcmV2aWV3X2lkLCBjLnBhcmVudF9wdWJsaXNoZXJfaWQpKSBhcyBfIGZyb20gY29tbWVudHMgYyB3aGVyZSBjLnBhcmVudF9ib29rX3Jldmlld19pZCA9IGJyLmlkICkgYyB3aGVyZSBici5ib29rX2lkID0gYi5pZCApIGJyIHdoZXJlIGIuYXV0aG9yX2lkID0gYS5pZCApIGIgY3Jvc3Mgam9pbiBsYXRlcmFsICggc2VsZWN0IGpzb25fYWdnKGpzb25fYnVpbGRfYXJyYXkoYzEuaWQsIGMxLnRleHQsIGMxLmNyZWF0ZWRfYXQsIGMxLnVwZGF0ZWRfYXQsIGMxLnVzZXJfaWQsIGMxLnBhcmVudF9hdXRob3JfaWQsIGMxLnBhcmVudF9ib29rX2lkLCBjMS5wYXJlbnRfYm9va19yZXZpZXdfaWQsIGMxLnBhcmVudF9wdWJsaXNoZXJfaWQpKSBhcyBfIGZyb20gY29tbWVudHMgYzEgd2hlcmUgYzEucGFyZW50X2F1dGhvcl9pZCA9IGEuaWQgKSBjMSBjcm9zcyBqb2luIGxhdGVyYWwgKCBzZWxlY3QganNvbl9hZ2coanNvbl9idWlsZF9hcnJheShhMS5pZCwgYTEuZmlyc3RfbmFtZSwgYTEubGFzdF9uYW1lLCBhMS5zc24sIGExLmluaXRpYWxzLCBhMS5udW1iZXJfb2ZfYm9va3MsIGExLmJvb2tfY29tbWVudHMsIGExLmlzX3BvcHVsYXIsIGExLmFnZSwgYTEuZ3JhZHVhdGVkLCBhMS5uaWNrX25hbWVzLCBhMS53YXNfZXZlcl9wb3B1bGFyLCBhMS5hZGRyZXNzLCBhMS5idXNpbmVzc19hZGRyZXNzLCBhMS5xdW90ZXMsIGExLm51bWJlcl9vZl9hdG9tcywgYTEuZGVsZXRlZF9hdCwgYTEubnVtYmVyX29mX3B1YmxpY19yZXZpZXdzLCBhMS4ibnVtYmVyT2ZQdWJsaWNSZXZpZXdzMiIsIGExLnRhZ3Nfb2ZfYWxsX2Jvb2tzLCBhMS5jcmVhdGVkX2F0LCBhMS51cGRhdGVkX2F0LCBhMS5mYXZvcml0ZV9zaGFwZSwgYTEuZmF2b3JpdGVfY29sb3JzLCBhMS5tZW50b3JfaWQsIGExLmN1cnJlbnRfZHJhZnRfYm9va19pZCwgYTEuZmF2b3JpdGVfYm9va19pZCwgYTEucHVibGlzaGVyX2lkKSkgYXMgXyBmcm9tIGF1dGhvcnMgYTEgd2hlcmUgYTEuaWQgPSBhLm1lbnRvcl9pZCApIGExIHdoZXJlIGEuaWQgPSAxOw%3D%3D\n */\n\n/**\n * Given a `parent` like Author, and a hint of `{ books: ..., comments: ... }`, create `CROSS JOIN LATERAL`s\n * that will pull in the `books` & `comments` children.\n */\nfunction calcLateralJoins<I extends EntityOrId>(\n  assigner: AliasAssigner,\n  root: { tree: HintNode<I>; alias: string; meta: EntityMetadata },\n  tree: HintNode<I>,\n  parentAlias: string,\n  parentMeta: EntityMetadata,\n  pathPrefix: string = \"\",\n): AggregateJoinResult[] {\n  const results: AggregateJoinResult[] = [];\n\n  // Join in SQL-able hints from parent\n  Object.entries(tree.hints).forEach(([key, subTree]) => {\n    const field = parentMeta.allFields[key];\n    // AsyncProperties don't have fields, which is fine, skip for now...\n    if (field && canPreload(parentMeta, field)) {\n      // Enum m2ms have no \"other\" entity to join/hydrate; just aggregate the join table's enum ids.\n      if (field.kind === \"m2mEnum\") {\n        results.push(calcEnumLateralJoin(assigner, root, subTree, parentAlias, field, key, pathPrefix));\n        return;\n      }\n      const otherMeta = field.otherMetadata();\n      const otherField = otherMeta.allFields[field.otherFieldName];\n\n      // Short table alias for column refs inside the subquery, e.g. `_b1`\n      const otherAlias = `_${assigner.getAlias(otherMeta.tableName)}`;\n      // Readable path-based column alias for the outer AS clause, e.g. `_books_reviews`\n      const pathKey = key.toLowerCase();\n      const relationAlias = `_${assigner.getLiteralAlias(`${pathPrefix}${pathKey}`)}`;\n\n      // Do the recursion up-front, so we can work it into our own join/hydrator\n      const subJoins = calcLateralJoins(assigner, root, subTree, otherAlias, otherMeta, `${pathPrefix}${pathKey}_`);\n\n      // Get all fields with serdes and flatten out the columns, skipping `lazy` columns (fetched on-demand)\n      const columns = Object.values(otherMeta.allFields)\n        .filter((f) => f.serde && !(f.kind === \"primitive\" && f.lazy))\n        .flatMap((f) => f.serde!.columns);\n      const selects = [\n        ...columns.map((c) => kqDot(otherAlias, c.columnName)),\n        // We eventually need to handle parent types/subtypes here...\n        // Combine any grandchilden\n        ...subJoins.map((sb) => kqDot(sb.alias, \"_\")),\n      ];\n\n      const aliasMaybeSuffix = kq(`${parentAlias}${field.aliasSuffix}`);\n\n      const cb = new ConditionBuilder();\n      let m2mTable: JoinTable | undefined;\n      let m2mAlias: string | undefined;\n      if (otherField.kind === \"m2o\") {\n        cb.addRawCondition({\n          aliases: [otherAlias, parentAlias],\n          condition: `${kqDot(otherAlias, otherField.serde.columns[0].columnName)} = ${kqDot(parentAlias, \"id\")}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"poly\") {\n        // Get the component that points to us\n        // const comp = otherField.components.find((c) => getAllMetas(parentMeta).some((m) => m.cstr === c.otherMetadata().cstr)) ??\n        const comp =\n          otherField.components.find((c) => parentMeta.cstr === c.otherMetadata().cstr) ??\n          fail(`No component found for ${field.fieldName} -> ${otherField.fieldName}`);\n        cb.addRawCondition({\n          aliases: [otherAlias, parentAlias],\n          condition: `${kqDot(otherAlias, comp.columnName)} = ${kqDot(parentAlias, \"id\")}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"o2m\" || otherField.kind === \"lo2m\") {\n        cb.addRawCondition({\n          aliases: [otherAlias, aliasMaybeSuffix],\n          condition: `${kqDot(otherAlias, \"id\")} = ${aliasMaybeSuffix}.${kq(field.serde!.columns[0].columnName)}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"o2o\") {\n        cb.addRawCondition({\n          aliases: [otherAlias, aliasMaybeSuffix],\n          condition: `${kqDot(otherAlias, \"id\")} = ${aliasMaybeSuffix}.${kq(field.serde!.columns[0].columnName)}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"m2m\") {\n        m2mAlias = assigner.getAlias(otherField.joinTableName);\n        // Get the m2m row's id to track in JoinRows; id-less tables have no surrogate id.\n        if (otherField.hasJoinTableId) selects.unshift(kqDot(m2mAlias, \"id\"));\n        m2mTable = {\n          join: \"inner\",\n          table: otherField.joinTableName,\n          alias: m2mAlias,\n          col1: kqDot(parentAlias, \"id\"),\n          col2: kqDot(m2mAlias, otherField.columnNames[1]),\n        };\n        cb.addRawCondition({\n          aliases: [m2mAlias, otherAlias],\n          condition: `${kqDot(m2mAlias, otherField.columnNames[0])} = ${kqDot(otherAlias, \"id\")}`,\n          pruneable: true,\n        });\n      } else {\n        throw new Error(`Unsupported otherField.kind ${otherField.kind}`);\n      }\n\n      const needsSubSelect = subTree.entities.size !== root.tree.entities.size;\n      if (needsSubSelect) {\n        cb.addRawCondition({\n          aliases: [root.alias],\n          condition: `${kqDot(root.alias, \"id\")} = ANY(?)`,\n          bindings: [\n            [...subTree.entities]\n              .filter((e) => typeof e === \"string\" || !e.isNewEntity)\n              .map((e) => keyToNumber(root.meta, typeof e === \"string\" ? e : e.id)),\n          ],\n          pruneable: true,\n        });\n      }\n\n      // For m2m, order by the join-row's id so preloaded results match the order the lazy batch\n      // loader returns (which orders by join-row id). Id-less join tables have no surrogate id,\n      // so order by the other entity's FK column (matching the lazy loader & getOthers). Otherwise,\n      // order by the target entity's id.\n      const orderBy =\n        otherField.kind === \"m2m\" && !otherField.hasJoinTableId\n          ? `${kq(m2mAlias!)}.${kq(otherField.columnNames[0])}`\n          : `${kq(m2mAlias ?? otherAlias)}.id`;\n\n      const join: LateralJoinTable = {\n        join: \"lateral\",\n        alias: otherAlias,\n        // Do we need to say which alias we're coming from, to avoid having it pruned?\n        // ...maybe not because preloading is always on the primary table?\n        fromAlias: \"unset\",\n        table: otherMeta.tableName,\n        query: {\n          selects: [`json_agg(json_build_array(${selects.join(\", \")}) order by ${orderBy}) as _`],\n          tables: [\n            { join: \"primary\", table: otherMeta.tableName, alias: otherAlias },\n            ...(m2mTable ? [m2mTable] : []),\n            ...subJoins.map((sj) => sj.join),\n          ],\n          condition: cb.toExpressionFilter(),\n          orderBys: [],\n        },\n      };\n\n      // Pre-compute column names so we don't re-read them per entity\n      const columnNames = columns.map((c) => c.columnName);\n      // If we've snuck the m2m row id into the json array, ignore it (id-less tables have no id)\n      const m2mOffset = field.kind === \"m2m\" && field.hasJoinTableId ? 1 : 0;\n\n      const hydrator: AggregateJsonHydrator = (root, parent, arrays) => {\n        const { em } = root;\n\n        // If we had overlapping load hints, i.e. `author.books` for [a1, a2] and `author.comments` for [a1], and\n        // we're processing the arrays of comments, but for a root author like `a2` that didn't ask for our load\n        // hint, then skip it to keep the relation unloaded.\n        if (subTree.entitiesKind === \"instances\" && !subTree.entities.has(root as any)) return;\n        if (subTree.entitiesKind === \"ids\" && !subTree.entities.has(root.idTagged as any)) return;\n\n        // We get back an array of [[1, title], [2, title], [3, title]]\n        const children = arrays.map((array) => {\n          const taggedId = keyToTaggedId(otherMeta, array[m2mOffset] as any)!;\n          const row: Record<string, any> = {};\n          for (let i = 0; i < columns.length; i++) {\n            row[columnNames[i]] = columns[i].mapFromJsonAgg(array[m2mOffset + i]);\n          }\n          const entity =\n            em.findExistingInstance<Entity>(taggedId) ??\n            (em.hydrate(otherMeta.cstr, [row], { overwriteExisting: false }) as Entity[])[0];\n          // Tell the internal JoinRow booking-keeping about this m2m row\n          if (field.kind === \"m2m\") {\n            // TODO This `addExisting` needs to be pulled up, out of the `arrays.map`, so we can do a `loadRows`-ish\n            // call that passes all now-known m2m rows into JoinRows as a single list, so that it can mark any\n            // deleted-from-under-us m2m rows as deleted.\n            const m2m = (parent as any)[key];\n            getEmInternalApi(em)\n              .joinRows(m2m)\n              .addPreloadedRow(m2m, field.hasJoinTableId ? (array[0] as any) : undefined, parent, entity);\n          }\n          // Within each child, look for grandchildren\n          subJoins.forEach((sub, i) => {\n            // array[i] could be null if there are no grandchildren, but still call `sub` to\n            // process it so that we store the empty array into the em.joinLoadedRelations, to\n            // avoid the relation.load method later doing a SQL for rows we know are not there.\n            sub.hydrator(root, entity, (array[m2mOffset + columns.length + i] as any) ?? []);\n          });\n          return entity;\n        });\n        // Cache the entities so `.load`s will see them\n        getEmInternalApi(em).setPreloadedRelation(parent.idTagged, key, children);\n      };\n\n      results.push({ alias: otherAlias, relationAlias, join, hydrator });\n    }\n  });\n\n  return results;\n}\n\n/**\n * Builds the `CROSS JOIN LATERAL` that aggregates an enum-m2m join table (e.g. `publisher_logo_colors`)\n * into a json array of enum ids, e.g. `[[1], [3]]` (or `[[1, id], [3, id]]` for id-ful join tables).\n */\nfunction calcEnumLateralJoin<I extends EntityOrId>(\n  assigner: AliasAssigner,\n  root: { tree: HintNode<I>; alias: string; meta: EntityMetadata },\n  subTree: HintNode<I>,\n  parentAlias: string,\n  field: ManyToManyEnumField,\n  key: string,\n  pathPrefix: string,\n): AggregateJoinResult {\n  const [entityColumn, enumColumn] = field.columnNames;\n  const jtAlias = `_${assigner.getAlias(field.joinTableName)}`;\n  const relationAlias = `_${assigner.getLiteralAlias(`${pathPrefix}${key.toLowerCase()}`)}`;\n\n  const parts = [kqDot(jtAlias, enumColumn)];\n  if (field.hasJoinTableId) parts.push(kqDot(jtAlias, \"id\"));\n\n  const cb = new ConditionBuilder();\n  cb.addRawCondition({\n    aliases: [jtAlias, parentAlias],\n    condition: `${kqDot(jtAlias, entityColumn)} = ${kqDot(parentAlias, \"id\")}`,\n    pruneable: true,\n  });\n\n  const needsSubSelect = subTree.entities.size !== root.tree.entities.size;\n  if (needsSubSelect) {\n    cb.addRawCondition({\n      aliases: [root.alias],\n      condition: `${kqDot(root.alias, \"id\")} = ANY(?)`,\n      bindings: [\n        [...subTree.entities]\n          .filter((e) => typeof e === \"string\" || !e.isNewEntity)\n          .map((e) => keyToNumber(root.meta, typeof e === \"string\" ? e : e.id)),\n      ],\n      pruneable: true,\n    });\n  }\n\n  const orderBy = `${kq(jtAlias)}.${kq(field.hasJoinTableId ? \"id\" : enumColumn)}`;\n  const join: LateralJoinTable = {\n    join: \"lateral\",\n    alias: jtAlias,\n    fromAlias: \"unset\",\n    table: field.joinTableName,\n    query: {\n      selects: [`json_agg(json_build_array(${parts.join(\", \")}) order by ${orderBy}) as _`],\n      tables: [{ join: \"primary\", table: field.joinTableName, alias: jtAlias }],\n      condition: cb.toExpressionFilter(),\n      orderBys: [],\n    },\n  };\n\n  const hydrator: AggregateJsonHydrator = (root, parent, arrays) => {\n    const { em } = root;\n    if (subTree.entitiesKind === \"instances\" && !subTree.entities.has(root as any)) return;\n    if (subTree.entitiesKind === \"ids\" && !subTree.entities.has(root.idTagged as any)) return;\n    const like: ManyToManyLike = {\n      entity: parent,\n      joinTableName: field.joinTableName,\n      columnName: entityColumn,\n      otherColumnName: enumColumn,\n      fieldName: key,\n      meta: getMetadataForField(getMetadata(parent), key),\n      otherEnum: field.enumDetailType,\n      hasJoinTableId: field.hasJoinTableId,\n    };\n    const api = getEmInternalApi(em);\n    const joinRows = api.joinRows(like);\n    const codes: any[] = [];\n    for (const array of arrays) {\n      const enumId = array[0] as number;\n      joinRows.addPreloadedRow(like, field.hasJoinTableId ? (array[1] as number) : undefined, parent, enumId);\n      codes.push(field.enumDetailType.findById(enumId)!.code);\n    }\n    api.setPreloadedRelation(parent.idTagged, key, codes);\n  };\n\n  return { alias: jtAlias, relationAlias, join, hydrator };\n}\n\n/** A preload-loadable join for a given child, with potentially grand-child joins contained within it. */\ntype AggregateJoinResult = {\n  /** The short table alias used for column references inside the subquery, e.g. `_b1`. */\n  alias: string;\n  /** The readable relation-name alias used in the outer `AS` clause, e.g. `_prequel`. */\n  relationAlias: string;\n  /** The SQL for this child's lateral join, which itself might have recursive lateral joins. */\n  join: LateralJoinTable;\n  /** The hydrator for this child's lateral join, which itself might recursively hydrator subjoins. */\n  hydrator: AggregateJsonHydrator;\n};\n\n/** Reads one column from either classic POJO rows or a lazy `RowData` result. */\nfunction readRowValue(rows: any[] | RowData, rowIndex: number, columnName: string): any {\n  return Array.isArray(rows) ? rows[rowIndex][columnName] : rows.get(rowIndex, columnName);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAqBA,IAAa,yBAAb,MAA6D;CAC3D,cACE,MACA,MACoE;EACpE,OAAOA,iCAAAA,cAAc,MAAM,IAAI;CACjC;CAEA,cACE,MACA,MACA,OAC6B;EAC7B,MAAM,WAAW,IAAIC,kCAAAA,cAAc,KAAK;EAGxC,MAAM,QAAQC,iCAAAA,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;EAClC,MAAM,QAAQ,iBAAiB,UAAU;GAAE,MAAM;GAAM;GAAO;EAAK,GAAG,MAAM,OAAO,IAAI;EAEvF,IAAI,MAAM,WAAW,GAAG,OAAO,KAAA;EAG/B,KAAK,MAAM,EAAE,OAAO,eAAe,UAAU,OAAO;GAClD,MAAM,QAAQ,KAAK;IACjB,KAAK,GAAGC,6BAAAA,MAAM,OAAO,GAAG,EAAE,MAAMC,6BAAAA,GAAG,aAAa;IAChD,SAAS,CAAC,KAAK;IACf,UAAU,CAAC;GACb,CAAC;GACD,MAAM,OAAO,KAAK,IAAI;EACxB;EAEA,QAAQ,MAAM,aAAa;GACzB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;IACxC,MAAM,SAAS,SAAS;IACxB,KAAK,MAAM,EAAE,eAAe,cAAc,OACxC,SAAS,QAAQ,QAAQ,aAAa,MAAM,GAAG,aAAa,KAAK,CAAC,CAAC;GAEvE;EACF;CACF;CAEA,gBAAkC,MAAsB,MAAmB,OAAsC;EAC/G,MAAM,WAAW,IAAIH,kCAAAA,cAAc,KAAK;EAGxC,MAAM,QAAQC,iCAAAA,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;EAKlC,OAJc,iBAAiB,UAAU;GAAE,MAAM;GAAM;GAAO;EAAK,GAAG,MAAM,OAAO,IAIxE,CAAC,CAAC,KAAK,SAAS;GACzB,OAAO;IACL,SAAS,CAAC;KAAE,OAAOC,6BAAAA,MAAM,KAAK,OAAO,GAAG;KAAG,IAAI,KAAK;IAAc,CAAC;IACnE,MAAM,KAAK;IACX,WAAW,MAAM,aAAa;KAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;MACxC,MAAM,SAAS,SAAS;MACxB,KAAK,SAAS,QAAQ,QAAQ,aAAa,MAAM,GAAG,KAAK,aAAa,KAAK,CAAC,CAAC;KAC/E;IACF;GACF;EACF,CAAC;CACH;AACF;;;;;;;;;;;;;;;AAoBA,SAAS,iBACP,UACA,MACA,MACA,aACA,YACA,aAAqB,IACE;CACvB,MAAM,UAAiC,CAAC;CAGxC,OAAO,QAAQ,KAAK,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,aAAa;EACrD,MAAM,QAAQ,WAAW,UAAU;EAEnC,IAAI,SAASE,8BAAAA,WAAW,YAAY,KAAK,GAAG;GAE1C,IAAI,MAAM,SAAS,WAAW;IAC5B,QAAQ,KAAK,oBAAoB,UAAU,MAAM,SAAS,aAAa,OAAO,KAAK,UAAU,CAAC;IAC9F;GACF;GACA,MAAM,YAAY,MAAM,cAAc;GACtC,MAAM,aAAa,UAAU,UAAU,MAAM;GAG7C,MAAM,aAAa,IAAI,SAAS,SAAS,UAAU,SAAS;GAE5D,MAAM,UAAU,IAAI,YAAY;GAChC,MAAM,gBAAgB,IAAI,SAAS,gBAAgB,GAAG,aAAa,SAAS;GAG5E,MAAM,WAAW,iBAAiB,UAAU,MAAM,SAAS,YAAY,WAAW,GAAG,aAAa,QAAQ,EAAE;GAG5G,MAAM,UAAU,OAAO,OAAO,UAAU,SAAS,CAAC,CAC/C,QAAQ,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,eAAe,EAAE,KAAK,CAAC,CAC7D,SAAS,MAAM,EAAE,MAAO,OAAO;GAClC,MAAM,UAAU,CACd,GAAG,QAAQ,KAAK,MAAMF,6BAAAA,MAAM,YAAY,EAAE,UAAU,CAAC,GAGrD,GAAG,SAAS,KAAK,OAAOA,6BAAAA,MAAM,GAAG,OAAO,GAAG,CAAC,CAC9C;GAEA,MAAM,mBAAmBC,6BAAAA,GAAG,GAAG,cAAc,MAAM,aAAa;GAEhE,MAAM,KAAK,IAAIE,iCAAAA,iBAAiB;GAChC,IAAI;GACJ,IAAI;GACJ,IAAI,WAAW,SAAS,OACtB,GAAG,gBAAgB;IACjB,SAAS,CAAC,YAAY,WAAW;IACjC,WAAW,GAAGH,6BAAAA,MAAM,YAAY,WAAW,MAAM,QAAQ,EAAE,CAAC,UAAU,EAAE,KAAKA,6BAAAA,MAAM,aAAa,IAAI;IACpG,WAAW;GACb,CAAC;QACI,IAAI,WAAW,SAAS,QAAQ;IAGrC,MAAM,OACJ,WAAW,WAAW,MAAM,MAAM,WAAW,SAAS,EAAE,cAAc,CAAC,CAAC,IAAI,KAC5EI,cAAAA,KAAK,0BAA0B,MAAM,UAAU,MAAM,WAAW,WAAW;IAC7E,GAAG,gBAAgB;KACjB,SAAS,CAAC,YAAY,WAAW;KACjC,WAAW,GAAGJ,6BAAAA,MAAM,YAAY,KAAK,UAAU,EAAE,KAAKA,6BAAAA,MAAM,aAAa,IAAI;KAC7E,WAAW;IACb,CAAC;GACH,OAAO,IAAI,WAAW,SAAS,SAAS,WAAW,SAAS,QAC1D,GAAG,gBAAgB;IACjB,SAAS,CAAC,YAAY,gBAAgB;IACtC,WAAW,GAAGA,6BAAAA,MAAM,YAAY,IAAI,EAAE,KAAK,iBAAiB,GAAGC,6BAAAA,GAAG,MAAM,MAAO,QAAQ,EAAE,CAAC,UAAU;IACpG,WAAW;GACb,CAAC;QACI,IAAI,WAAW,SAAS,OAC7B,GAAG,gBAAgB;IACjB,SAAS,CAAC,YAAY,gBAAgB;IACtC,WAAW,GAAGD,6BAAAA,MAAM,YAAY,IAAI,EAAE,KAAK,iBAAiB,GAAGC,6BAAAA,GAAG,MAAM,MAAO,QAAQ,EAAE,CAAC,UAAU;IACpG,WAAW;GACb,CAAC;QACI,IAAI,WAAW,SAAS,OAAO;IACpC,WAAW,SAAS,SAAS,WAAW,aAAa;IAErD,IAAI,WAAW,gBAAgB,QAAQ,QAAQD,6BAAAA,MAAM,UAAU,IAAI,CAAC;IACpE,WAAW;KACT,MAAM;KACN,OAAO,WAAW;KAClB,OAAO;KACP,MAAMA,6BAAAA,MAAM,aAAa,IAAI;KAC7B,MAAMA,6BAAAA,MAAM,UAAU,WAAW,YAAY,EAAE;IACjD;IACA,GAAG,gBAAgB;KACjB,SAAS,CAAC,UAAU,UAAU;KAC9B,WAAW,GAAGA,6BAAAA,MAAM,UAAU,WAAW,YAAY,EAAE,EAAE,KAAKA,6BAAAA,MAAM,YAAY,IAAI;KACpF,WAAW;IACb,CAAC;GACH,OACE,MAAM,IAAI,MAAM,+BAA+B,WAAW,MAAM;GAIlE,IADuB,QAAQ,SAAS,SAAS,KAAK,KAAK,SAAS,MAElE,GAAG,gBAAgB;IACjB,SAAS,CAAC,KAAK,KAAK;IACpB,WAAW,GAAGA,6BAAAA,MAAM,KAAK,OAAO,IAAI,EAAE;IACtC,UAAU,CACR,CAAC,GAAG,QAAQ,QAAQ,CAAC,CAClB,QAAQ,MAAM,OAAO,MAAM,YAAY,CAAC,EAAE,WAAW,CAAC,CACtD,KAAK,MAAMK,aAAAA,YAAY,KAAK,MAAM,OAAO,MAAM,WAAW,IAAI,EAAE,EAAE,CAAC,CACxE;IACA,WAAW;GACb,CAAC;GAOH,MAAM,UACJ,WAAW,SAAS,SAAS,CAAC,WAAW,iBACrC,GAAGJ,6BAAAA,GAAG,QAAS,EAAE,GAAGA,6BAAAA,GAAG,WAAW,YAAY,EAAE,MAChD,GAAGA,6BAAAA,GAAG,YAAY,UAAU,EAAE;GAEpC,MAAM,OAAyB;IAC7B,MAAM;IACN,OAAO;IAGP,WAAW;IACX,OAAO,UAAU;IACjB,OAAO;KACL,SAAS,CAAC,6BAA6B,QAAQ,KAAK,IAAI,EAAE,aAAa,QAAQ,OAAO;KACtF,QAAQ;MACN;OAAE,MAAM;OAAW,OAAO,UAAU;OAAW,OAAO;MAAW;MACjE,GAAI,WAAW,CAAC,QAAQ,IAAI,CAAC;MAC7B,GAAG,SAAS,KAAK,OAAO,GAAG,IAAI;KACjC;KACA,WAAW,GAAG,mBAAmB;KACjC,UAAU,CAAC;IACb;GACF;GAGA,MAAM,cAAc,QAAQ,KAAK,MAAM,EAAE,UAAU;GAEnD,MAAM,YAAY,MAAM,SAAS,SAAS,MAAM,iBAAiB,IAAI;GAErE,MAAM,YAAmC,MAAM,QAAQ,WAAW;IAChE,MAAM,EAAE,OAAO;IAKf,IAAI,QAAQ,iBAAiB,eAAe,CAAC,QAAQ,SAAS,IAAI,IAAW,GAAG;IAChF,IAAI,QAAQ,iBAAiB,SAAS,CAAC,QAAQ,SAAS,IAAI,KAAK,QAAe,GAAG;IAGnF,MAAM,WAAW,OAAO,KAAK,UAAU;KACrC,MAAM,WAAWK,aAAAA,cAAc,WAAW,MAAM,UAAiB;KACjE,MAAM,MAA2B,CAAC;KAClC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,IAAI,YAAY,MAAM,QAAQ,EAAE,CAAC,eAAe,MAAM,YAAY,EAAE;KAEtE,MAAM,SACJ,GAAG,qBAA6B,QAAQ,KACvC,GAAG,QAAQ,UAAU,MAAM,CAAC,GAAG,GAAG,EAAE,mBAAmB,MAAM,CAAC,CAAC,CAAc;KAEhF,IAAI,MAAM,SAAS,OAAO;MAIxB,MAAM,MAAO,OAAe;MAC5B,sBAAA,iBAAiB,EAAE,CAAC,CACjB,SAAS,GAAG,CAAC,CACb,gBAAgB,KAAK,MAAM,iBAAkB,MAAM,KAAa,KAAA,GAAW,QAAQ,MAAM;KAC9F;KAEA,SAAS,SAAS,KAAK,MAAM;MAI3B,IAAI,SAAS,MAAM,QAAS,MAAM,YAAY,QAAQ,SAAS,MAAc,CAAC,CAAC;KACjF,CAAC;KACD,OAAO;IACT,CAAC;IAED,sBAAA,iBAAiB,EAAE,CAAC,CAAC,qBAAqB,OAAO,UAAU,KAAK,QAAQ;GAC1E;GAEA,QAAQ,KAAK;IAAE,OAAO;IAAY;IAAe;IAAM;GAAS,CAAC;EACnE;CACF,CAAC;CAED,OAAO;AACT;;;;;AAMA,SAAS,oBACP,UACA,MACA,SACA,aACA,OACA,KACA,YACqB;CACrB,MAAM,CAAC,cAAc,cAAc,MAAM;CACzC,MAAM,UAAU,IAAI,SAAS,SAAS,MAAM,aAAa;CACzD,MAAM,gBAAgB,IAAI,SAAS,gBAAgB,GAAG,aAAa,IAAI,YAAY,GAAG;CAEtF,MAAM,QAAQ,CAACN,6BAAAA,MAAM,SAAS,UAAU,CAAC;CACzC,IAAI,MAAM,gBAAgB,MAAM,KAAKA,6BAAAA,MAAM,SAAS,IAAI,CAAC;CAEzD,MAAM,KAAK,IAAIG,iCAAAA,iBAAiB;CAChC,GAAG,gBAAgB;EACjB,SAAS,CAAC,SAAS,WAAW;EAC9B,WAAW,GAAGH,6BAAAA,MAAM,SAAS,YAAY,EAAE,KAAKA,6BAAAA,MAAM,aAAa,IAAI;EACvE,WAAW;CACb,CAAC;CAGD,IADuB,QAAQ,SAAS,SAAS,KAAK,KAAK,SAAS,MAElE,GAAG,gBAAgB;EACjB,SAAS,CAAC,KAAK,KAAK;EACpB,WAAW,GAAGA,6BAAAA,MAAM,KAAK,OAAO,IAAI,EAAE;EACtC,UAAU,CACR,CAAC,GAAG,QAAQ,QAAQ,CAAC,CAClB,QAAQ,MAAM,OAAO,MAAM,YAAY,CAAC,EAAE,WAAW,CAAC,CACtD,KAAK,MAAMK,aAAAA,YAAY,KAAK,MAAM,OAAO,MAAM,WAAW,IAAI,EAAE,EAAE,CAAC,CACxE;EACA,WAAW;CACb,CAAC;CAGH,MAAM,UAAU,GAAGJ,6BAAAA,GAAG,OAAO,EAAE,GAAGA,6BAAAA,GAAG,MAAM,iBAAiB,OAAO,UAAU;CAC7E,MAAM,OAAyB;EAC7B,MAAM;EACN,OAAO;EACP,WAAW;EACX,OAAO,MAAM;EACb,OAAO;GACL,SAAS,CAAC,6BAA6B,MAAM,KAAK,IAAI,EAAE,aAAa,QAAQ,OAAO;GACpF,QAAQ,CAAC;IAAE,MAAM;IAAW,OAAO,MAAM;IAAe,OAAO;GAAQ,CAAC;GACxE,WAAW,GAAG,mBAAmB;GACjC,UAAU,CAAC;EACb;CACF;CAEA,MAAM,YAAmC,MAAM,QAAQ,WAAW;EAChE,MAAM,EAAE,OAAO;EACf,IAAI,QAAQ,iBAAiB,eAAe,CAAC,QAAQ,SAAS,IAAI,IAAW,GAAG;EAChF,IAAI,QAAQ,iBAAiB,SAAS,CAAC,QAAQ,SAAS,IAAI,KAAK,QAAe,GAAG;EACnF,MAAM,OAAuB;GAC3B,QAAQ;GACR,eAAe,MAAM;GACrB,YAAY;GACZ,iBAAiB;GACjB,WAAW;GACX,MAAMM,uBAAAA,oBAAoBC,uBAAAA,YAAY,MAAM,GAAG,GAAG;GAClD,WAAW,MAAM;GACjB,gBAAgB,MAAM;EACxB;EACA,MAAM,MAAMC,sBAAAA,iBAAiB,EAAE;EAC/B,MAAM,WAAW,IAAI,SAAS,IAAI;EAClC,MAAM,QAAe,CAAC;EACtB,KAAK,MAAM,SAAS,QAAQ;GAC1B,MAAM,SAAS,MAAM;GACrB,SAAS,gBAAgB,MAAM,MAAM,iBAAkB,MAAM,KAAgB,KAAA,GAAW,QAAQ,MAAM;GACtG,MAAM,KAAK,MAAM,eAAe,SAAS,MAAM,CAAC,CAAE,IAAI;EACxD;EACA,IAAI,qBAAqB,OAAO,UAAU,KAAK,KAAK;CACtD;CAEA,OAAO;EAAE,OAAO;EAAS;EAAe;EAAM;CAAS;AACzD;;AAeA,SAAS,aAAa,MAAuB,UAAkB,YAAyB;CACtF,OAAO,MAAM,QAAQ,IAAI,IAAI,KAAK,SAAS,CAAC,cAAc,KAAK,IAAI,UAAU,UAAU;AACzF"}
+{"version":3,"file":"JsonAggregatePreloader.cjs","names":["partitionHint","AliasAssigner","getTables","kqDot","kq","canPreload","ConditionBuilder","fail","keyToNumber","keyToTaggedId","getMetadataForField","getMetadata","getEmInternalApi"],"sources":["../../src/preloading/JsonAggregatePreloader.ts"],"sourcesContent":["import { type Entity } from \"src/Entity.ts\";\nimport { getEmInternalApi } from \"src/EntityManager.ts\";\nimport { type EntityMetadata, type ManyToManyEnumField, getMetadata, getMetadataForField } from \"src/EntityMetadata.ts\";\nimport type { ManyToManyLike } from \"src/flush/JoinRows.ts\";\nimport { keyToNumber, keyToTaggedId } from \"src/keys.ts\";\nimport type { EntityOrId, HintNode } from \"src/loading/HintTree.ts\";\nimport type { LoadHint, NestedLoadHint } from \"src/loading/loadHints.ts\";\nimport { type JoinResult, type PreloadHydrator, type PreloadPlugin } from \"src/plugins/PreloadPlugin.ts\";\nimport { canPreload } from \"src/preloading/canPreload.ts\";\nimport { partitionHint } from \"src/preloading/partitionHint.ts\";\nimport { ConditionBuilder } from \"src/queries/ConditionBuilder.ts\";\nimport {\n  type JoinTable,\n  type LateralJoinTable,\n  type ParsedFindQuery,\n  getTables,\n} from \"src/queries/find/QueryParser.ts\";\nimport { AliasAssigner } from \"src/queries/sql/AliasAssigner.ts\";\nimport { kq, kqDot } from \"src/queries/sql/keywords.ts\";\nimport { type RowData } from \"src/RowData.ts\";\nimport { fail } from \"src/utils.ts\";\n\n/**\n * A PreloadPlugin implementation that uses `CROSS LATERAL JOIN` and `json_aggregate`\n * to preload/reduce a subtree of data while still being a single row of data.\n */\nexport class JsonAggregatePreloader implements PreloadPlugin {\n  partitionHint(\n    meta: EntityMetadata | undefined,\n    hint: LoadHint<any>,\n  ): [NestedLoadHint<any> | undefined, NestedLoadHint<any> | undefined] {\n    return partitionHint(meta, hint);\n  }\n\n  addPreloading<T extends Entity>(\n    meta: EntityMetadata,\n    root: HintNode<T>,\n    query: ParsedFindQuery,\n  ): PreloadHydrator | undefined {\n    const assigner = new AliasAssigner(query);\n\n    // Get the existing primary alias\n    const alias = getTables(query)[0].alias;\n    const joins = calcLateralJoins(assigner, { tree: root, alias, meta }, root, alias, meta);\n    // If there are no sql-based preload in the hints, just return\n    if (joins.length === 0) return undefined;\n\n    // Include the aggregate `_b1._ as _prequel`, `_c._ as _randomComment`\n    for (const { alias, relationAlias, join } of joins) {\n      query.selects.push({\n        sql: `${kqDot(alias, \"_\")} as ${kq(relationAlias)}`,\n        aliases: [alias],\n        bindings: [],\n      });\n      query.tables.push(join);\n    }\n\n    return (rows, entities) => {\n      for (let i = 0; i < entities.length; i++) {\n        const parent = entities[i];\n        for (const { relationAlias, hydrator } of joins) {\n          hydrator(parent, parent, readRowValue(rows, i, relationAlias) ?? []);\n        }\n      }\n    };\n  }\n\n  getPreloadJoins<T extends Entity>(meta: EntityMetadata, root: HintNode<T>, query: ParsedFindQuery): JoinResult[] {\n    const assigner = new AliasAssigner(query);\n\n    // Get the existing primary alias\n    const alias = getTables(query)[0].alias;\n    const joins = calcLateralJoins(assigner, { tree: root, alias, meta }, root, alias, meta);\n    // If there are no sql-based preload in the hints, just return\n\n    // Adapt our json aggregate joins to the higher-level JoinResult\n    return joins.map((join) => {\n      return {\n        selects: [{ value: kqDot(join.alias, \"_\"), as: join.relationAlias }],\n        join: join.join,\n        hydrator: (rows, entities) => {\n          for (let i = 0; i < entities.length; i++) {\n            const parent = entities[i];\n            join.hydrator(parent, parent, readRowValue(rows, i, join.relationAlias) ?? []);\n          }\n        },\n      };\n    });\n  }\n}\n\n/** Decodes an array-of-arrays of children entries, and stores them the `parent`'s relation. */\ntype AggregateJsonHydrator = (root: Entity, parent: Entity, arrays: unknown[][]) => void;\n\n/**\n * For a given hint tree `hint`, finds all SQL-able relations and preloads them.\n *\n * Specifically we use `json_agg` & `json_build_array` to `CROSS LATERAL JOIN`\n * children/grand children back as arbitrarily-deeply nested arrays, and then\n * stash the results in the `EntityManager` `joinLoadedRelations` cache, which\n * each join-instrumented relation will check before making its SQL calls.\n *\n * https://sqlfum.pt/?n=60&indent=2&spaces=1&simplify=1&align=0&case=lower&sql=c2VsZWN0IGEuaWQsIGIuXyBhcyBiLCBjMS5fIGFzIGMxLCBhMS5fIGFzIGExIGZyb20gYXV0aG9ycyBhIGNyb3NzIGpvaW4gbGF0ZXJhbCAoIHNlbGVjdCBqc29uX2FnZyhqc29uX2J1aWxkX2FycmF5KGIuaWQsIGIudGl0bGUsIGIuIm9yZGVyIiwgYi5kZWxldGVkX2F0LCBiLmNyZWF0ZWRfYXQsIGIudXBkYXRlZF9hdCwgYi5hdXRob3JfaWQsIGJyLl8pKSBhcyBfIGZyb20gYm9va3MgYiBjcm9zcyBqb2luIGxhdGVyYWwgKCBzZWxlY3QganNvbl9hZ2coanNvbl9idWlsZF9hcnJheShici5pZCwgYnIucmF0aW5nLCBici5pc19wdWJsaWMsIGJyLmlzX3Rlc3QsIGJyLmNyZWF0ZWRfYXQsIGJyLnVwZGF0ZWRfYXQsIGJyLmJvb2tfaWQsIGMuXykpIGFzIF8gZnJvbSBib29rX3Jldmlld3MgYnIgY3Jvc3Mgam9pbiBsYXRlcmFsICggc2VsZWN0IGpzb25fYWdnKGpzb25fYnVpbGRfYXJyYXkoYy5pZCwgYy50ZXh0LCBjLmNyZWF0ZWRfYXQsIGMudXBkYXRlZF9hdCwgYy51c2VyX2lkLCBjLnBhcmVudF9hdXRob3JfaWQsIGMucGFyZW50X2Jvb2tfaWQsIGMucGFyZW50X2Jvb2tfcmV2aWV3X2lkLCBjLnBhcmVudF9wdWJsaXNoZXJfaWQpKSBhcyBfIGZyb20gY29tbWVudHMgYyB3aGVyZSBjLnBhcmVudF9ib29rX3Jldmlld19pZCA9IGJyLmlkICkgYyB3aGVyZSBici5ib29rX2lkID0gYi5pZCApIGJyIHdoZXJlIGIuYXV0aG9yX2lkID0gYS5pZCApIGIgY3Jvc3Mgam9pbiBsYXRlcmFsICggc2VsZWN0IGpzb25fYWdnKGpzb25fYnVpbGRfYXJyYXkoYzEuaWQsIGMxLnRleHQsIGMxLmNyZWF0ZWRfYXQsIGMxLnVwZGF0ZWRfYXQsIGMxLnVzZXJfaWQsIGMxLnBhcmVudF9hdXRob3JfaWQsIGMxLnBhcmVudF9ib29rX2lkLCBjMS5wYXJlbnRfYm9va19yZXZpZXdfaWQsIGMxLnBhcmVudF9wdWJsaXNoZXJfaWQpKSBhcyBfIGZyb20gY29tbWVudHMgYzEgd2hlcmUgYzEucGFyZW50X2F1dGhvcl9pZCA9IGEuaWQgKSBjMSBjcm9zcyBqb2luIGxhdGVyYWwgKCBzZWxlY3QganNvbl9hZ2coanNvbl9idWlsZF9hcnJheShhMS5pZCwgYTEuZmlyc3RfbmFtZSwgYTEubGFzdF9uYW1lLCBhMS5zc24sIGExLmluaXRpYWxzLCBhMS5udW1iZXJfb2ZfYm9va3MsIGExLmJvb2tfY29tbWVudHMsIGExLmlzX3BvcHVsYXIsIGExLmFnZSwgYTEuZ3JhZHVhdGVkLCBhMS5uaWNrX25hbWVzLCBhMS53YXNfZXZlcl9wb3B1bGFyLCBhMS5hZGRyZXNzLCBhMS5idXNpbmVzc19hZGRyZXNzLCBhMS5xdW90ZXMsIGExLm51bWJlcl9vZl9hdG9tcywgYTEuZGVsZXRlZF9hdCwgYTEubnVtYmVyX29mX3B1YmxpY19yZXZpZXdzLCBhMS4ibnVtYmVyT2ZQdWJsaWNSZXZpZXdzMiIsIGExLnRhZ3Nfb2ZfYWxsX2Jvb2tzLCBhMS5jcmVhdGVkX2F0LCBhMS51cGRhdGVkX2F0LCBhMS5mYXZvcml0ZV9zaGFwZSwgYTEuZmF2b3JpdGVfY29sb3JzLCBhMS5tZW50b3JfaWQsIGExLmN1cnJlbnRfZHJhZnRfYm9va19pZCwgYTEuZmF2b3JpdGVfYm9va19pZCwgYTEucHVibGlzaGVyX2lkKSkgYXMgXyBmcm9tIGF1dGhvcnMgYTEgd2hlcmUgYTEuaWQgPSBhLm1lbnRvcl9pZCApIGExIHdoZXJlIGEuaWQgPSAxOw%3D%3D\n */\n\n/**\n * Given a `parent` like Author, and a hint of `{ books: ..., comments: ... }`, create `CROSS JOIN LATERAL`s\n * that will pull in the `books` & `comments` children.\n */\nfunction calcLateralJoins<I extends EntityOrId>(\n  assigner: AliasAssigner,\n  root: { tree: HintNode<I>; alias: string; meta: EntityMetadata },\n  tree: HintNode<I>,\n  parentAlias: string,\n  parentMeta: EntityMetadata,\n  pathPrefix: string = \"\",\n): AggregateJoinResult[] {\n  const results: AggregateJoinResult[] = [];\n\n  // Join in SQL-able hints from parent\n  Object.entries(tree.hints).forEach(([key, subTree]) => {\n    const field = parentMeta.allFields[key];\n    // AsyncProperties don't have fields, which is fine, skip for now...\n    if (field && canPreload(parentMeta, field)) {\n      // Enum m2ms have no \"other\" entity to join/hydrate; just aggregate the join table's enum ids.\n      if (field.kind === \"m2mEnum\") {\n        results.push(calcEnumLateralJoin(assigner, root, subTree, parentAlias, field, key, pathPrefix));\n        return;\n      }\n      const otherMeta = field.otherMetadata();\n      const otherField = otherMeta.allFields[field.otherFieldName];\n\n      // Short table alias for column refs inside the subquery, e.g. `_b1`\n      const otherAlias = `_${assigner.getAlias(otherMeta.tableName)}`;\n      // Readable path-based column alias for the outer AS clause, e.g. `_books_reviews`\n      const pathKey = key.toLowerCase();\n      const relationAlias = `_${assigner.getLiteralAlias(`${pathPrefix}${pathKey}`)}`;\n\n      // Do the recursion up-front, so we can work it into our own join/hydrator\n      const subJoins = calcLateralJoins(assigner, root, subTree, otherAlias, otherMeta, `${pathPrefix}${pathKey}_`);\n\n      // Get all fields with serdes and flatten out the columns, skipping `lazy` columns (fetched on-demand)\n      const columns = Object.values(otherMeta.allFields)\n        .filter((f) => f.serde && !(f.kind === \"primitive\" && f.lazy))\n        .flatMap((f) => f.serde!.columns);\n      const selects = [\n        ...columns.map((c) => kqDot(otherAlias, c.columnName)),\n        // We eventually need to handle parent types/subtypes here...\n        // Combine any grandchilden\n        ...subJoins.map((sb) => kqDot(sb.alias, \"_\")),\n      ];\n\n      const aliasMaybeSuffix = kq(`${parentAlias}${field.aliasSuffix}`);\n\n      const cb = new ConditionBuilder();\n      let m2mTable: JoinTable | undefined;\n      let m2mAlias: string | undefined;\n      if (otherField.kind === \"m2o\") {\n        cb.addRawCondition({\n          aliases: [otherAlias, parentAlias],\n          condition: `${kqDot(otherAlias, otherField.serde.columns[0].columnName)} = ${kqDot(parentAlias, \"id\")}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"poly\") {\n        // Get the component that points to us\n        // const comp = otherField.components.find((c) => getAllMetas(parentMeta).some((m) => m.cstr === c.otherMetadata().cstr)) ??\n        const comp =\n          otherField.components.find((c) => parentMeta.cstr === c.otherMetadata().cstr) ??\n          fail(`No component found for ${field.fieldName} -> ${otherField.fieldName}`);\n        cb.addRawCondition({\n          aliases: [otherAlias, parentAlias],\n          condition: `${kqDot(otherAlias, comp.columnName)} = ${kqDot(parentAlias, \"id\")}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"o2m\" || otherField.kind === \"lo2m\") {\n        cb.addRawCondition({\n          aliases: [otherAlias, aliasMaybeSuffix],\n          condition: `${kqDot(otherAlias, \"id\")} = ${aliasMaybeSuffix}.${kq(field.serde!.columns[0].columnName)}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"o2o\") {\n        cb.addRawCondition({\n          aliases: [otherAlias, aliasMaybeSuffix],\n          condition: `${kqDot(otherAlias, \"id\")} = ${aliasMaybeSuffix}.${kq(field.serde!.columns[0].columnName)}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"m2m\") {\n        m2mAlias = assigner.getAlias(otherField.joinTableName);\n        // Get the m2m row's id to track in JoinRows; id-less tables have no surrogate id.\n        if (otherField.hasJoinTableId) selects.unshift(kqDot(m2mAlias, \"id\"));\n        m2mTable = {\n          join: \"inner\",\n          table: otherField.joinTableName,\n          alias: m2mAlias,\n          col1: kqDot(parentAlias, \"id\"),\n          col2: kqDot(m2mAlias, otherField.columnNames[1]),\n        };\n        cb.addRawCondition({\n          aliases: [m2mAlias, otherAlias],\n          condition: `${kqDot(m2mAlias, otherField.columnNames[0])} = ${kqDot(otherAlias, \"id\")}`,\n          pruneable: true,\n        });\n      } else {\n        throw new Error(`Unsupported otherField.kind ${otherField.kind}`);\n      }\n\n      const needsSubSelect = subTree.entities.size !== root.tree.entities.size;\n      if (needsSubSelect) {\n        cb.addRawCondition({\n          aliases: [root.alias],\n          condition: `${kqDot(root.alias, \"id\")} = ANY(?)`,\n          bindings: [\n            [...subTree.entities]\n              .filter((e) => typeof e === \"string\" || !e.isNewEntity)\n              .map((e) => keyToNumber(root.meta, typeof e === \"string\" ? e : e.id)),\n          ],\n          pruneable: true,\n        });\n      }\n\n      // For m2m, order by the join-row's id so preloaded results match the order the lazy batch\n      // loader returns (which orders by join-row id). Id-less join tables have no surrogate id,\n      // so order by the other entity's FK column (matching the lazy loader & getOthers). Otherwise,\n      // order by the target entity's id.\n      const orderBy =\n        otherField.kind === \"m2m\" && !otherField.hasJoinTableId\n          ? `${kq(m2mAlias!)}.${kq(otherField.columnNames[0])}`\n          : `${kq(m2mAlias ?? otherAlias)}.id`;\n\n      const join: LateralJoinTable = {\n        join: \"lateral\",\n        alias: otherAlias,\n        // Do we need to say which alias we're coming from, to avoid having it pruned?\n        // ...maybe not because preloading is always on the primary table?\n        fromAlias: \"unset\",\n        table: otherMeta.tableName,\n        query: {\n          selects: [`json_agg(json_build_array(${selects.join(\", \")}) order by ${orderBy}) as _`],\n          tables: [\n            { join: \"primary\", table: otherMeta.tableName, alias: otherAlias },\n            ...(m2mTable ? [m2mTable] : []),\n            ...subJoins.map((sj) => sj.join),\n          ],\n          condition: cb.toExpressionFilter(),\n          orderBys: [],\n        },\n      };\n\n      // Pre-compute column names so we don't re-read them per entity\n      const columnNames = columns.map((c) => c.columnName);\n      // If we've snuck the m2m row id into the json array, ignore it (id-less tables have no id)\n      const m2mOffset = field.kind === \"m2m\" && field.hasJoinTableId ? 1 : 0;\n\n      const hydrator: AggregateJsonHydrator = (root, parent, arrays) => {\n        const { em } = root;\n\n        // If we had overlapping load hints, i.e. `author.books` for [a1, a2] and `author.comments` for [a1], and\n        // we're processing the arrays of comments, but for a root author like `a2` that didn't ask for our load\n        // hint, then skip it to keep the relation unloaded.\n        if (subTree.entitiesKind === \"instances\" && !subTree.entities.has(root as any)) return;\n        if (subTree.entitiesKind === \"ids\" && !subTree.entities.has(root.idTagged as any)) return;\n\n        // We get back an array of [[1, title], [2, title], [3, title]]\n        const children = arrays.map((array) => {\n          const taggedId = keyToTaggedId(otherMeta, array[m2mOffset] as any)!;\n          const row: Record<string, any> = {};\n          for (let i = 0; i < columns.length; i++) {\n            row[columnNames[i]] = columns[i].mapFromJsonAgg(array[m2mOffset + i]);\n          }\n          const entity =\n            em.findExistingInstance<Entity>(taggedId) ??\n            (em.hydrate(otherMeta.cstr, [row], { overwriteExisting: false }) as Entity[])[0];\n          // Tell the internal JoinRow booking-keeping about this m2m row\n          if (field.kind === \"m2m\") {\n            // TODO This `addExisting` needs to be pulled up, out of the `arrays.map`, so we can do a `loadRows`-ish\n            // call that passes all now-known m2m rows into JoinRows as a single list, so that it can mark any\n            // deleted-from-under-us m2m rows as deleted.\n            const m2m = (parent as any)[key];\n            getEmInternalApi(em)\n              .joinRows(m2m)\n              .addPreloadedRow(m2m, field.hasJoinTableId ? (array[0] as any) : undefined, parent, entity);\n          }\n          // Within each child, look for grandchildren\n          subJoins.forEach((sub, i) => {\n            // array[i] could be null if there are no grandchildren, but still call `sub` to\n            // process it so that we store the empty array into the em.joinLoadedRelations, to\n            // avoid the relation.load method later doing a SQL for rows we know are not there.\n            sub.hydrator(root, entity, (array[m2mOffset + columns.length + i] as any) ?? []);\n          });\n          return entity;\n        });\n        // Cache the entities so `.load`s will see them\n        getEmInternalApi(em).setPreloadedRelation(parent.idTagged, key, children);\n      };\n\n      results.push({ alias: otherAlias, relationAlias, join, hydrator });\n    }\n  });\n\n  return results;\n}\n\n/**\n * Builds the `CROSS JOIN LATERAL` that aggregates an enum-m2m join table (e.g. `publisher_logo_colors`)\n * into a json array of enum ids, e.g. `[[1], [3]]` (or `[[1, id], [3, id]]` for id-ful join tables).\n */\nfunction calcEnumLateralJoin<I extends EntityOrId>(\n  assigner: AliasAssigner,\n  root: { tree: HintNode<I>; alias: string; meta: EntityMetadata },\n  subTree: HintNode<I>,\n  parentAlias: string,\n  field: ManyToManyEnumField,\n  key: string,\n  pathPrefix: string,\n): AggregateJoinResult {\n  const [entityColumn, enumColumn] = field.columnNames;\n  const jtAlias = `_${assigner.getAlias(field.joinTableName)}`;\n  const relationAlias = `_${assigner.getLiteralAlias(`${pathPrefix}${key.toLowerCase()}`)}`;\n\n  const parts = [kqDot(jtAlias, enumColumn)];\n  if (field.hasJoinTableId) parts.push(kqDot(jtAlias, \"id\"));\n\n  const cb = new ConditionBuilder();\n  cb.addRawCondition({\n    aliases: [jtAlias, parentAlias],\n    condition: `${kqDot(jtAlias, entityColumn)} = ${kqDot(parentAlias, \"id\")}`,\n    pruneable: true,\n  });\n\n  const needsSubSelect = subTree.entities.size !== root.tree.entities.size;\n  if (needsSubSelect) {\n    cb.addRawCondition({\n      aliases: [root.alias],\n      condition: `${kqDot(root.alias, \"id\")} = ANY(?)`,\n      bindings: [\n        [...subTree.entities]\n          .filter((e) => typeof e === \"string\" || !e.isNewEntity)\n          .map((e) => keyToNumber(root.meta, typeof e === \"string\" ? e : e.id)),\n      ],\n      pruneable: true,\n    });\n  }\n\n  const orderBy = `${kq(jtAlias)}.${kq(field.hasJoinTableId ? \"id\" : enumColumn)}`;\n  const join: LateralJoinTable = {\n    join: \"lateral\",\n    alias: jtAlias,\n    fromAlias: \"unset\",\n    table: field.joinTableName,\n    query: {\n      selects: [`json_agg(json_build_array(${parts.join(\", \")}) order by ${orderBy}) as _`],\n      tables: [{ join: \"primary\", table: field.joinTableName, alias: jtAlias }],\n      condition: cb.toExpressionFilter(),\n      orderBys: [],\n    },\n  };\n\n  const hydrator: AggregateJsonHydrator = (root, parent, arrays) => {\n    const { em } = root;\n    if (subTree.entitiesKind === \"instances\" && !subTree.entities.has(root as any)) return;\n    if (subTree.entitiesKind === \"ids\" && !subTree.entities.has(root.idTagged as any)) return;\n    const like: ManyToManyLike = {\n      entity: parent,\n      joinTableName: field.joinTableName,\n      columnName: entityColumn,\n      otherColumnName: enumColumn,\n      fieldName: key,\n      meta: getMetadataForField(getMetadata(parent), key),\n      otherEnum: field.enumDetailType,\n      hasJoinTableId: field.hasJoinTableId,\n    };\n    const api = getEmInternalApi(em);\n    const joinRows = api.joinRows(like);\n    const codes: any[] = [];\n    for (const array of arrays) {\n      const enumId = array[0] as number;\n      joinRows.addPreloadedRow(like, field.hasJoinTableId ? (array[1] as number) : undefined, parent, enumId);\n      codes.push(field.enumDetailType.findById(enumId)!.code);\n    }\n    api.setPreloadedRelation(parent.idTagged, key, codes);\n  };\n\n  return { alias: jtAlias, relationAlias, join, hydrator };\n}\n\n/** A preload-loadable join for a given child, with potentially grand-child joins contained within it. */\ntype AggregateJoinResult = {\n  /** The short table alias used for column references inside the subquery, e.g. `_b1`. */\n  alias: string;\n  /** The readable relation-name alias used in the outer `AS` clause, e.g. `_prequel`. */\n  relationAlias: string;\n  /** The SQL for this child's lateral join, which itself might have recursive lateral joins. */\n  join: LateralJoinTable;\n  /** The hydrator for this child's lateral join, which itself might recursively hydrator subjoins. */\n  hydrator: AggregateJsonHydrator;\n};\n\n/** Reads one column from either classic POJO rows or a lazy `RowData` result. */\nfunction readRowValue(rows: any[] | RowData, rowIndex: number, columnName: string): any {\n  return Array.isArray(rows) ? rows[rowIndex][columnName] : rows.get(rowIndex, columnName);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AA0BA,IAAa,yBAAb,MAA6D;CAC3D,cACE,MACA,MACoE;EACpE,OAAOA,iCAAAA,cAAc,MAAM,IAAI;CACjC;CAEA,cACE,MACA,MACA,OAC6B;EAC7B,MAAM,WAAW,IAAIC,kCAAAA,cAAc,KAAK;EAGxC,MAAM,QAAQC,iCAAAA,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;EAClC,MAAM,QAAQ,iBAAiB,UAAU;GAAE,MAAM;GAAM;GAAO;EAAK,GAAG,MAAM,OAAO,IAAI;EAEvF,IAAI,MAAM,WAAW,GAAG,OAAO,KAAA;EAG/B,KAAK,MAAM,EAAE,OAAO,eAAe,UAAU,OAAO;GAClD,MAAM,QAAQ,KAAK;IACjB,KAAK,GAAGC,6BAAAA,MAAM,OAAO,GAAG,EAAE,MAAMC,6BAAAA,GAAG,aAAa;IAChD,SAAS,CAAC,KAAK;IACf,UAAU,CAAC;GACb,CAAC;GACD,MAAM,OAAO,KAAK,IAAI;EACxB;EAEA,QAAQ,MAAM,aAAa;GACzB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;IACxC,MAAM,SAAS,SAAS;IACxB,KAAK,MAAM,EAAE,eAAe,cAAc,OACxC,SAAS,QAAQ,QAAQ,aAAa,MAAM,GAAG,aAAa,KAAK,CAAC,CAAC;GAEvE;EACF;CACF;CAEA,gBAAkC,MAAsB,MAAmB,OAAsC;EAC/G,MAAM,WAAW,IAAIH,kCAAAA,cAAc,KAAK;EAGxC,MAAM,QAAQC,iCAAAA,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;EAKlC,OAJc,iBAAiB,UAAU;GAAE,MAAM;GAAM;GAAO;EAAK,GAAG,MAAM,OAAO,IAIxE,CAAC,CAAC,KAAK,SAAS;GACzB,OAAO;IACL,SAAS,CAAC;KAAE,OAAOC,6BAAAA,MAAM,KAAK,OAAO,GAAG;KAAG,IAAI,KAAK;IAAc,CAAC;IACnE,MAAM,KAAK;IACX,WAAW,MAAM,aAAa;KAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;MACxC,MAAM,SAAS,SAAS;MACxB,KAAK,SAAS,QAAQ,QAAQ,aAAa,MAAM,GAAG,KAAK,aAAa,KAAK,CAAC,CAAC;KAC/E;IACF;GACF;EACF,CAAC;CACH;AACF;;;;;;;;;;;;;;;AAoBA,SAAS,iBACP,UACA,MACA,MACA,aACA,YACA,aAAqB,IACE;CACvB,MAAM,UAAiC,CAAC;CAGxC,OAAO,QAAQ,KAAK,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,aAAa;EACrD,MAAM,QAAQ,WAAW,UAAU;EAEnC,IAAI,SAASE,8BAAAA,WAAW,YAAY,KAAK,GAAG;GAE1C,IAAI,MAAM,SAAS,WAAW;IAC5B,QAAQ,KAAK,oBAAoB,UAAU,MAAM,SAAS,aAAa,OAAO,KAAK,UAAU,CAAC;IAC9F;GACF;GACA,MAAM,YAAY,MAAM,cAAc;GACtC,MAAM,aAAa,UAAU,UAAU,MAAM;GAG7C,MAAM,aAAa,IAAI,SAAS,SAAS,UAAU,SAAS;GAE5D,MAAM,UAAU,IAAI,YAAY;GAChC,MAAM,gBAAgB,IAAI,SAAS,gBAAgB,GAAG,aAAa,SAAS;GAG5E,MAAM,WAAW,iBAAiB,UAAU,MAAM,SAAS,YAAY,WAAW,GAAG,aAAa,QAAQ,EAAE;GAG5G,MAAM,UAAU,OAAO,OAAO,UAAU,SAAS,CAAC,CAC/C,QAAQ,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,eAAe,EAAE,KAAK,CAAC,CAC7D,SAAS,MAAM,EAAE,MAAO,OAAO;GAClC,MAAM,UAAU,CACd,GAAG,QAAQ,KAAK,MAAMF,6BAAAA,MAAM,YAAY,EAAE,UAAU,CAAC,GAGrD,GAAG,SAAS,KAAK,OAAOA,6BAAAA,MAAM,GAAG,OAAO,GAAG,CAAC,CAC9C;GAEA,MAAM,mBAAmBC,6BAAAA,GAAG,GAAG,cAAc,MAAM,aAAa;GAEhE,MAAM,KAAK,IAAIE,iCAAAA,iBAAiB;GAChC,IAAI;GACJ,IAAI;GACJ,IAAI,WAAW,SAAS,OACtB,GAAG,gBAAgB;IACjB,SAAS,CAAC,YAAY,WAAW;IACjC,WAAW,GAAGH,6BAAAA,MAAM,YAAY,WAAW,MAAM,QAAQ,EAAE,CAAC,UAAU,EAAE,KAAKA,6BAAAA,MAAM,aAAa,IAAI;IACpG,WAAW;GACb,CAAC;QACI,IAAI,WAAW,SAAS,QAAQ;IAGrC,MAAM,OACJ,WAAW,WAAW,MAAM,MAAM,WAAW,SAAS,EAAE,cAAc,CAAC,CAAC,IAAI,KAC5EI,cAAAA,KAAK,0BAA0B,MAAM,UAAU,MAAM,WAAW,WAAW;IAC7E,GAAG,gBAAgB;KACjB,SAAS,CAAC,YAAY,WAAW;KACjC,WAAW,GAAGJ,6BAAAA,MAAM,YAAY,KAAK,UAAU,EAAE,KAAKA,6BAAAA,MAAM,aAAa,IAAI;KAC7E,WAAW;IACb,CAAC;GACH,OAAO,IAAI,WAAW,SAAS,SAAS,WAAW,SAAS,QAC1D,GAAG,gBAAgB;IACjB,SAAS,CAAC,YAAY,gBAAgB;IACtC,WAAW,GAAGA,6BAAAA,MAAM,YAAY,IAAI,EAAE,KAAK,iBAAiB,GAAGC,6BAAAA,GAAG,MAAM,MAAO,QAAQ,EAAE,CAAC,UAAU;IACpG,WAAW;GACb,CAAC;QACI,IAAI,WAAW,SAAS,OAC7B,GAAG,gBAAgB;IACjB,SAAS,CAAC,YAAY,gBAAgB;IACtC,WAAW,GAAGD,6BAAAA,MAAM,YAAY,IAAI,EAAE,KAAK,iBAAiB,GAAGC,6BAAAA,GAAG,MAAM,MAAO,QAAQ,EAAE,CAAC,UAAU;IACpG,WAAW;GACb,CAAC;QACI,IAAI,WAAW,SAAS,OAAO;IACpC,WAAW,SAAS,SAAS,WAAW,aAAa;IAErD,IAAI,WAAW,gBAAgB,QAAQ,QAAQD,6BAAAA,MAAM,UAAU,IAAI,CAAC;IACpE,WAAW;KACT,MAAM;KACN,OAAO,WAAW;KAClB,OAAO;KACP,MAAMA,6BAAAA,MAAM,aAAa,IAAI;KAC7B,MAAMA,6BAAAA,MAAM,UAAU,WAAW,YAAY,EAAE;IACjD;IACA,GAAG,gBAAgB;KACjB,SAAS,CAAC,UAAU,UAAU;KAC9B,WAAW,GAAGA,6BAAAA,MAAM,UAAU,WAAW,YAAY,EAAE,EAAE,KAAKA,6BAAAA,MAAM,YAAY,IAAI;KACpF,WAAW;IACb,CAAC;GACH,OACE,MAAM,IAAI,MAAM,+BAA+B,WAAW,MAAM;GAIlE,IADuB,QAAQ,SAAS,SAAS,KAAK,KAAK,SAAS,MAElE,GAAG,gBAAgB;IACjB,SAAS,CAAC,KAAK,KAAK;IACpB,WAAW,GAAGA,6BAAAA,MAAM,KAAK,OAAO,IAAI,EAAE;IACtC,UAAU,CACR,CAAC,GAAG,QAAQ,QAAQ,CAAC,CAClB,QAAQ,MAAM,OAAO,MAAM,YAAY,CAAC,EAAE,WAAW,CAAC,CACtD,KAAK,MAAMK,aAAAA,YAAY,KAAK,MAAM,OAAO,MAAM,WAAW,IAAI,EAAE,EAAE,CAAC,CACxE;IACA,WAAW;GACb,CAAC;GAOH,MAAM,UACJ,WAAW,SAAS,SAAS,CAAC,WAAW,iBACrC,GAAGJ,6BAAAA,GAAG,QAAS,EAAE,GAAGA,6BAAAA,GAAG,WAAW,YAAY,EAAE,MAChD,GAAGA,6BAAAA,GAAG,YAAY,UAAU,EAAE;GAEpC,MAAM,OAAyB;IAC7B,MAAM;IACN,OAAO;IAGP,WAAW;IACX,OAAO,UAAU;IACjB,OAAO;KACL,SAAS,CAAC,6BAA6B,QAAQ,KAAK,IAAI,EAAE,aAAa,QAAQ,OAAO;KACtF,QAAQ;MACN;OAAE,MAAM;OAAW,OAAO,UAAU;OAAW,OAAO;MAAW;MACjE,GAAI,WAAW,CAAC,QAAQ,IAAI,CAAC;MAC7B,GAAG,SAAS,KAAK,OAAO,GAAG,IAAI;KACjC;KACA,WAAW,GAAG,mBAAmB;KACjC,UAAU,CAAC;IACb;GACF;GAGA,MAAM,cAAc,QAAQ,KAAK,MAAM,EAAE,UAAU;GAEnD,MAAM,YAAY,MAAM,SAAS,SAAS,MAAM,iBAAiB,IAAI;GAErE,MAAM,YAAmC,MAAM,QAAQ,WAAW;IAChE,MAAM,EAAE,OAAO;IAKf,IAAI,QAAQ,iBAAiB,eAAe,CAAC,QAAQ,SAAS,IAAI,IAAW,GAAG;IAChF,IAAI,QAAQ,iBAAiB,SAAS,CAAC,QAAQ,SAAS,IAAI,KAAK,QAAe,GAAG;IAGnF,MAAM,WAAW,OAAO,KAAK,UAAU;KACrC,MAAM,WAAWK,aAAAA,cAAc,WAAW,MAAM,UAAiB;KACjE,MAAM,MAA2B,CAAC;KAClC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,IAAI,YAAY,MAAM,QAAQ,EAAE,CAAC,eAAe,MAAM,YAAY,EAAE;KAEtE,MAAM,SACJ,GAAG,qBAA6B,QAAQ,KACvC,GAAG,QAAQ,UAAU,MAAM,CAAC,GAAG,GAAG,EAAE,mBAAmB,MAAM,CAAC,CAAC,CAAc;KAEhF,IAAI,MAAM,SAAS,OAAO;MAIxB,MAAM,MAAO,OAAe;MAC5B,sBAAA,iBAAiB,EAAE,CAAC,CACjB,SAAS,GAAG,CAAC,CACb,gBAAgB,KAAK,MAAM,iBAAkB,MAAM,KAAa,KAAA,GAAW,QAAQ,MAAM;KAC9F;KAEA,SAAS,SAAS,KAAK,MAAM;MAI3B,IAAI,SAAS,MAAM,QAAS,MAAM,YAAY,QAAQ,SAAS,MAAc,CAAC,CAAC;KACjF,CAAC;KACD,OAAO;IACT,CAAC;IAED,sBAAA,iBAAiB,EAAE,CAAC,CAAC,qBAAqB,OAAO,UAAU,KAAK,QAAQ;GAC1E;GAEA,QAAQ,KAAK;IAAE,OAAO;IAAY;IAAe;IAAM;GAAS,CAAC;EACnE;CACF,CAAC;CAED,OAAO;AACT;;;;;AAMA,SAAS,oBACP,UACA,MACA,SACA,aACA,OACA,KACA,YACqB;CACrB,MAAM,CAAC,cAAc,cAAc,MAAM;CACzC,MAAM,UAAU,IAAI,SAAS,SAAS,MAAM,aAAa;CACzD,MAAM,gBAAgB,IAAI,SAAS,gBAAgB,GAAG,aAAa,IAAI,YAAY,GAAG;CAEtF,MAAM,QAAQ,CAACN,6BAAAA,MAAM,SAAS,UAAU,CAAC;CACzC,IAAI,MAAM,gBAAgB,MAAM,KAAKA,6BAAAA,MAAM,SAAS,IAAI,CAAC;CAEzD,MAAM,KAAK,IAAIG,iCAAAA,iBAAiB;CAChC,GAAG,gBAAgB;EACjB,SAAS,CAAC,SAAS,WAAW;EAC9B,WAAW,GAAGH,6BAAAA,MAAM,SAAS,YAAY,EAAE,KAAKA,6BAAAA,MAAM,aAAa,IAAI;EACvE,WAAW;CACb,CAAC;CAGD,IADuB,QAAQ,SAAS,SAAS,KAAK,KAAK,SAAS,MAElE,GAAG,gBAAgB;EACjB,SAAS,CAAC,KAAK,KAAK;EACpB,WAAW,GAAGA,6BAAAA,MAAM,KAAK,OAAO,IAAI,EAAE;EACtC,UAAU,CACR,CAAC,GAAG,QAAQ,QAAQ,CAAC,CAClB,QAAQ,MAAM,OAAO,MAAM,YAAY,CAAC,EAAE,WAAW,CAAC,CACtD,KAAK,MAAMK,aAAAA,YAAY,KAAK,MAAM,OAAO,MAAM,WAAW,IAAI,EAAE,EAAE,CAAC,CACxE;EACA,WAAW;CACb,CAAC;CAGH,MAAM,UAAU,GAAGJ,6BAAAA,GAAG,OAAO,EAAE,GAAGA,6BAAAA,GAAG,MAAM,iBAAiB,OAAO,UAAU;CAC7E,MAAM,OAAyB;EAC7B,MAAM;EACN,OAAO;EACP,WAAW;EACX,OAAO,MAAM;EACb,OAAO;GACL,SAAS,CAAC,6BAA6B,MAAM,KAAK,IAAI,EAAE,aAAa,QAAQ,OAAO;GACpF,QAAQ,CAAC;IAAE,MAAM;IAAW,OAAO,MAAM;IAAe,OAAO;GAAQ,CAAC;GACxE,WAAW,GAAG,mBAAmB;GACjC,UAAU,CAAC;EACb;CACF;CAEA,MAAM,YAAmC,MAAM,QAAQ,WAAW;EAChE,MAAM,EAAE,OAAO;EACf,IAAI,QAAQ,iBAAiB,eAAe,CAAC,QAAQ,SAAS,IAAI,IAAW,GAAG;EAChF,IAAI,QAAQ,iBAAiB,SAAS,CAAC,QAAQ,SAAS,IAAI,KAAK,QAAe,GAAG;EACnF,MAAM,OAAuB;GAC3B,QAAQ;GACR,eAAe,MAAM;GACrB,YAAY;GACZ,iBAAiB;GACjB,WAAW;GACX,MAAMM,uBAAAA,oBAAoBC,uBAAAA,YAAY,MAAM,GAAG,GAAG;GAClD,WAAW,MAAM;GACjB,gBAAgB,MAAM;EACxB;EACA,MAAM,MAAMC,sBAAAA,iBAAiB,EAAE;EAC/B,MAAM,WAAW,IAAI,SAAS,IAAI;EAClC,MAAM,QAAe,CAAC;EACtB,KAAK,MAAM,SAAS,QAAQ;GAC1B,MAAM,SAAS,MAAM;GACrB,SAAS,gBAAgB,MAAM,MAAM,iBAAkB,MAAM,KAAgB,KAAA,GAAW,QAAQ,MAAM;GACtG,MAAM,KAAK,MAAM,eAAe,SAAS,MAAM,CAAC,CAAE,IAAI;EACxD;EACA,IAAI,qBAAqB,OAAO,UAAU,KAAK,KAAK;CACtD;CAEA,OAAO;EAAE,OAAO;EAAS;EAAe;EAAM;CAAS;AACzD;;AAeA,SAAS,aAAa,MAAuB,UAAkB,YAAyB;CACtF,OAAO,MAAM,QAAQ,IAAI,IAAI,KAAK,SAAS,CAAC,cAAc,KAAK,IAAI,UAAU,UAAU;AACzF"}

package/build/preloading/JsonAggregatePreloader.d.cts

@@ -1,7 +1,7 @@
 import { ParsedFindQuery } from "../queries/find/QueryParser.cjs";
-import { LoadHint, NestedLoadHint } from "../loadHints.cjs";
+import { LoadHint, NestedLoadHint } from "../loading/loadHints.cjs";
 import { EntityMetadata } from "../EntityMetadata.cjs";
-import { HintNode } from "../HintTree.cjs";
+import { HintNode } from "../loading/HintTree.cjs";
 import { JoinResult, PreloadHydrator, PreloadPlugin } from "../plugins/PreloadPlugin.cjs";
 import { Entity } from "../Entity.cjs";
 //#region src/preloading/JsonAggregatePreloader.d.ts

package/build/preloading/JsonAggregatePreloader.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"JsonAggregatePreloader.d.cts","names":[],"sources":["../../src/preloading/JsonAggregatePreloader.ts"],"mappings":";;;;;;;;;;;cAqBa,kCAAkC;EAC7C,cACE,MAAM,4BACN,MAAM,iBACJ,iCAAiC;EAIrC,cAAc,UAAU,QACtB,MAAM,gBACN,MAAM,SAAS,IACf,OAAO,kBACN;EA6BH,gBAAgB,UAAU,QAAQ,MAAM,gBAAgB,MAAM,SAAS,IAAI,OAAO,kBAAkB"}
+{"version":3,"file":"JsonAggregatePreloader.d.cts","names":[],"sources":["../../src/preloading/JsonAggregatePreloader.ts"],"mappings":";;;;;;;;;;;cA0Ba,kCAAkC;EAC7C,cACE,MAAM,4BACN,MAAM,iBACJ,iCAAiC;EAIrC,cAAc,UAAU,QACtB,MAAM,gBACN,MAAM,SAAS,IACf,OAAO,kBACN;EA6BH,gBAAgB,UAAU,QAAQ,MAAM,gBAAgB,MAAM,SAAS,IAAI,OAAO,kBAAkB"}

package/build/preloading/JsonAggregatePreloader.d.mts

@@ -1,7 +1,7 @@
 import { ParsedFindQuery } from "../queries/find/QueryParser.mjs";
-import { LoadHint, NestedLoadHint } from "../loadHints.mjs";
+import { LoadHint, NestedLoadHint } from "../loading/loadHints.mjs";
 import { EntityMetadata } from "../EntityMetadata.mjs";
-import { HintNode } from "../HintTree.mjs";
+import { HintNode } from "../loading/HintTree.mjs";
 import { JoinResult, PreloadHydrator, PreloadPlugin } from "../plugins/PreloadPlugin.mjs";
 import { Entity } from "../Entity.mjs";
 //#region src/preloading/JsonAggregatePreloader.d.ts

package/build/preloading/JsonAggregatePreloader.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"JsonAggregatePreloader.d.mts","names":[],"sources":["../../src/preloading/JsonAggregatePreloader.ts"],"mappings":";;;;;;;;;;;cAqBa,kCAAkC;EAC7C,cACE,MAAM,4BACN,MAAM,iBACJ,iCAAiC;EAIrC,cAAc,UAAU,QACtB,MAAM,gBACN,MAAM,SAAS,IACf,OAAO,kBACN;EA6BH,gBAAgB,UAAU,QAAQ,MAAM,gBAAgB,MAAM,SAAS,IAAI,OAAO,kBAAkB"}
+{"version":3,"file":"JsonAggregatePreloader.d.mts","names":[],"sources":["../../src/preloading/JsonAggregatePreloader.ts"],"mappings":";;;;;;;;;;;cA0Ba,kCAAkC;EAC7C,cACE,MAAM,4BACN,MAAM,iBACJ,iCAAiC;EAIrC,cAAc,UAAU,QACtB,MAAM,gBACN,MAAM,SAAS,IACf,OAAO,kBACN;EA6BH,gBAAgB,UAAU,QAAQ,MAAM,gBAAgB,MAAM,SAAS,IAAI,OAAO,kBAAkB"}

package/build/preloading/JsonAggregatePreloader.js

@@ -1,15 +1,12 @@
-import "../JoinRows.js";
+import { keyToNumber, keyToTaggedId } from "../keys.js";
 import { kq, kqDot } from "../queries/sql/keywords.js";
 import { ConditionBuilder } from "../queries/ConditionBuilder.js";
 import { getTables } from "../queries/find/QueryParser.js";
-import "../loadHints.js";
 import { fail } from "../utils.js";
-import { keyToNumber, keyToTaggedId } from "../keys.js";
 import { getMetadata, getMetadataForField } from "../EntityMetadata.js";
 import { canPreload } from "./canPreload.js";
 import { partitionHint } from "./partitionHint.js";
 import { AliasAssigner } from "../queries/sql/AliasAssigner.js";
-import "../HintTree.js";
 import "../plugins/PreloadPlugin.js";
 import { getEmInternalApi } from "../EntityManager.js";
 import "../Entity.js";

package/build/preloading/JsonAggregatePreloader.js.map

@@ -1 +1 @@
-{"version":3,"file":"JsonAggregatePreloader.js","names":[],"sources":["../../src/preloading/JsonAggregatePreloader.ts"],"sourcesContent":["import { type Entity } from \"../Entity.ts\";\nimport { getEmInternalApi } from \"../EntityManager.ts\";\nimport { type EntityMetadata, type ManyToManyEnumField, getMetadata, getMetadataForField } from \"../EntityMetadata.ts\";\nimport { type EntityOrId, type HintNode } from \"../HintTree.ts\";\nimport { type ManyToManyLike } from \"../JoinRows.ts\";\nimport { keyToNumber, keyToTaggedId } from \"../keys.ts\";\nimport { type LoadHint, type NestedLoadHint } from \"../loadHints.ts\";\nimport { type JoinResult, type PreloadHydrator, type PreloadPlugin } from \"../plugins/PreloadPlugin.ts\";\nimport { ConditionBuilder } from \"../queries/ConditionBuilder.ts\";\nimport { type JoinTable, type LateralJoinTable, type ParsedFindQuery, getTables } from \"../queries/find/QueryParser.ts\";\nimport { AliasAssigner } from \"../queries/sql/AliasAssigner.ts\";\nimport { kq, kqDot } from \"../queries/sql/keywords.ts\";\nimport { type RowData } from \"../RowData.ts\";\nimport { fail } from \"../utils.ts\";\nimport { canPreload } from \"./canPreload.ts\";\nimport { partitionHint } from \"./partitionHint.ts\";\n\n/**\n * A PreloadPlugin implementation that uses `CROSS LATERAL JOIN` and `json_aggregate`\n * to preload/reduce a subtree of data while still being a single row of data.\n */\nexport class JsonAggregatePreloader implements PreloadPlugin {\n  partitionHint(\n    meta: EntityMetadata | undefined,\n    hint: LoadHint<any>,\n  ): [NestedLoadHint<any> | undefined, NestedLoadHint<any> | undefined] {\n    return partitionHint(meta, hint);\n  }\n\n  addPreloading<T extends Entity>(\n    meta: EntityMetadata,\n    root: HintNode<T>,\n    query: ParsedFindQuery,\n  ): PreloadHydrator | undefined {\n    const assigner = new AliasAssigner(query);\n\n    // Get the existing primary alias\n    const alias = getTables(query)[0].alias;\n    const joins = calcLateralJoins(assigner, { tree: root, alias, meta }, root, alias, meta);\n    // If there are no sql-based preload in the hints, just return\n    if (joins.length === 0) return undefined;\n\n    // Include the aggregate `_b1._ as _prequel`, `_c._ as _randomComment`\n    for (const { alias, relationAlias, join } of joins) {\n      query.selects.push({\n        sql: `${kqDot(alias, \"_\")} as ${kq(relationAlias)}`,\n        aliases: [alias],\n        bindings: [],\n      });\n      query.tables.push(join);\n    }\n\n    return (rows, entities) => {\n      for (let i = 0; i < entities.length; i++) {\n        const parent = entities[i];\n        for (const { relationAlias, hydrator } of joins) {\n          hydrator(parent, parent, readRowValue(rows, i, relationAlias) ?? []);\n        }\n      }\n    };\n  }\n\n  getPreloadJoins<T extends Entity>(meta: EntityMetadata, root: HintNode<T>, query: ParsedFindQuery): JoinResult[] {\n    const assigner = new AliasAssigner(query);\n\n    // Get the existing primary alias\n    const alias = getTables(query)[0].alias;\n    const joins = calcLateralJoins(assigner, { tree: root, alias, meta }, root, alias, meta);\n    // If there are no sql-based preload in the hints, just return\n\n    // Adapt our json aggregate joins to the higher-level JoinResult\n    return joins.map((join) => {\n      return {\n        selects: [{ value: kqDot(join.alias, \"_\"), as: join.relationAlias }],\n        join: join.join,\n        hydrator: (rows, entities) => {\n          for (let i = 0; i < entities.length; i++) {\n            const parent = entities[i];\n            join.hydrator(parent, parent, readRowValue(rows, i, join.relationAlias) ?? []);\n          }\n        },\n      };\n    });\n  }\n}\n\n/** Decodes an array-of-arrays of children entries, and stores them the `parent`'s relation. */\ntype AggregateJsonHydrator = (root: Entity, parent: Entity, arrays: unknown[][]) => void;\n\n/**\n * For a given hint tree `hint`, finds all SQL-able relations and preloads them.\n *\n * Specifically we use `json_agg` & `json_build_array` to `CROSS LATERAL JOIN`\n * children/grand children back as arbitrarily-deeply nested arrays, and then\n * stash the results in the `EntityManager` `joinLoadedRelations` cache, which\n * each join-instrumented relation will check before making its SQL calls.\n *\n * https://sqlfum.pt/?n=60&indent=2&spaces=1&simplify=1&align=0&case=lower&sql=c2VsZWN0IGEuaWQsIGIuXyBhcyBiLCBjMS5fIGFzIGMxLCBhMS5fIGFzIGExIGZyb20gYXV0aG9ycyBhIGNyb3NzIGpvaW4gbGF0ZXJhbCAoIHNlbGVjdCBqc29uX2FnZyhqc29uX2J1aWxkX2FycmF5KGIuaWQsIGIudGl0bGUsIGIuIm9yZGVyIiwgYi5kZWxldGVkX2F0LCBiLmNyZWF0ZWRfYXQsIGIudXBkYXRlZF9hdCwgYi5hdXRob3JfaWQsIGJyLl8pKSBhcyBfIGZyb20gYm9va3MgYiBjcm9zcyBqb2luIGxhdGVyYWwgKCBzZWxlY3QganNvbl9hZ2coanNvbl9idWlsZF9hcnJheShici5pZCwgYnIucmF0aW5nLCBici5pc19wdWJsaWMsIGJyLmlzX3Rlc3QsIGJyLmNyZWF0ZWRfYXQsIGJyLnVwZGF0ZWRfYXQsIGJyLmJvb2tfaWQsIGMuXykpIGFzIF8gZnJvbSBib29rX3Jldmlld3MgYnIgY3Jvc3Mgam9pbiBsYXRlcmFsICggc2VsZWN0IGpzb25fYWdnKGpzb25fYnVpbGRfYXJyYXkoYy5pZCwgYy50ZXh0LCBjLmNyZWF0ZWRfYXQsIGMudXBkYXRlZF9hdCwgYy51c2VyX2lkLCBjLnBhcmVudF9hdXRob3JfaWQsIGMucGFyZW50X2Jvb2tfaWQsIGMucGFyZW50X2Jvb2tfcmV2aWV3X2lkLCBjLnBhcmVudF9wdWJsaXNoZXJfaWQpKSBhcyBfIGZyb20gY29tbWVudHMgYyB3aGVyZSBjLnBhcmVudF9ib29rX3Jldmlld19pZCA9IGJyLmlkICkgYyB3aGVyZSBici5ib29rX2lkID0gYi5pZCApIGJyIHdoZXJlIGIuYXV0aG9yX2lkID0gYS5pZCApIGIgY3Jvc3Mgam9pbiBsYXRlcmFsICggc2VsZWN0IGpzb25fYWdnKGpzb25fYnVpbGRfYXJyYXkoYzEuaWQsIGMxLnRleHQsIGMxLmNyZWF0ZWRfYXQsIGMxLnVwZGF0ZWRfYXQsIGMxLnVzZXJfaWQsIGMxLnBhcmVudF9hdXRob3JfaWQsIGMxLnBhcmVudF9ib29rX2lkLCBjMS5wYXJlbnRfYm9va19yZXZpZXdfaWQsIGMxLnBhcmVudF9wdWJsaXNoZXJfaWQpKSBhcyBfIGZyb20gY29tbWVudHMgYzEgd2hlcmUgYzEucGFyZW50X2F1dGhvcl9pZCA9IGEuaWQgKSBjMSBjcm9zcyBqb2luIGxhdGVyYWwgKCBzZWxlY3QganNvbl9hZ2coanNvbl9idWlsZF9hcnJheShhMS5pZCwgYTEuZmlyc3RfbmFtZSwgYTEubGFzdF9uYW1lLCBhMS5zc24sIGExLmluaXRpYWxzLCBhMS5udW1iZXJfb2ZfYm9va3MsIGExLmJvb2tfY29tbWVudHMsIGExLmlzX3BvcHVsYXIsIGExLmFnZSwgYTEuZ3JhZHVhdGVkLCBhMS5uaWNrX25hbWVzLCBhMS53YXNfZXZlcl9wb3B1bGFyLCBhMS5hZGRyZXNzLCBhMS5idXNpbmVzc19hZGRyZXNzLCBhMS5xdW90ZXMsIGExLm51bWJlcl9vZl9hdG9tcywgYTEuZGVsZXRlZF9hdCwgYTEubnVtYmVyX29mX3B1YmxpY19yZXZpZXdzLCBhMS4ibnVtYmVyT2ZQdWJsaWNSZXZpZXdzMiIsIGExLnRhZ3Nfb2ZfYWxsX2Jvb2tzLCBhMS5jcmVhdGVkX2F0LCBhMS51cGRhdGVkX2F0LCBhMS5mYXZvcml0ZV9zaGFwZSwgYTEuZmF2b3JpdGVfY29sb3JzLCBhMS5tZW50b3JfaWQsIGExLmN1cnJlbnRfZHJhZnRfYm9va19pZCwgYTEuZmF2b3JpdGVfYm9va19pZCwgYTEucHVibGlzaGVyX2lkKSkgYXMgXyBmcm9tIGF1dGhvcnMgYTEgd2hlcmUgYTEuaWQgPSBhLm1lbnRvcl9pZCApIGExIHdoZXJlIGEuaWQgPSAxOw%3D%3D\n */\n\n/**\n * Given a `parent` like Author, and a hint of `{ books: ..., comments: ... }`, create `CROSS JOIN LATERAL`s\n * that will pull in the `books` & `comments` children.\n */\nfunction calcLateralJoins<I extends EntityOrId>(\n  assigner: AliasAssigner,\n  root: { tree: HintNode<I>; alias: string; meta: EntityMetadata },\n  tree: HintNode<I>,\n  parentAlias: string,\n  parentMeta: EntityMetadata,\n  pathPrefix: string = \"\",\n): AggregateJoinResult[] {\n  const results: AggregateJoinResult[] = [];\n\n  // Join in SQL-able hints from parent\n  Object.entries(tree.hints).forEach(([key, subTree]) => {\n    const field = parentMeta.allFields[key];\n    // AsyncProperties don't have fields, which is fine, skip for now...\n    if (field && canPreload(parentMeta, field)) {\n      // Enum m2ms have no \"other\" entity to join/hydrate; just aggregate the join table's enum ids.\n      if (field.kind === \"m2mEnum\") {\n        results.push(calcEnumLateralJoin(assigner, root, subTree, parentAlias, field, key, pathPrefix));\n        return;\n      }\n      const otherMeta = field.otherMetadata();\n      const otherField = otherMeta.allFields[field.otherFieldName];\n\n      // Short table alias for column refs inside the subquery, e.g. `_b1`\n      const otherAlias = `_${assigner.getAlias(otherMeta.tableName)}`;\n      // Readable path-based column alias for the outer AS clause, e.g. `_books_reviews`\n      const pathKey = key.toLowerCase();\n      const relationAlias = `_${assigner.getLiteralAlias(`${pathPrefix}${pathKey}`)}`;\n\n      // Do the recursion up-front, so we can work it into our own join/hydrator\n      const subJoins = calcLateralJoins(assigner, root, subTree, otherAlias, otherMeta, `${pathPrefix}${pathKey}_`);\n\n      // Get all fields with serdes and flatten out the columns, skipping `lazy` columns (fetched on-demand)\n      const columns = Object.values(otherMeta.allFields)\n        .filter((f) => f.serde && !(f.kind === \"primitive\" && f.lazy))\n        .flatMap((f) => f.serde!.columns);\n      const selects = [\n        ...columns.map((c) => kqDot(otherAlias, c.columnName)),\n        // We eventually need to handle parent types/subtypes here...\n        // Combine any grandchilden\n        ...subJoins.map((sb) => kqDot(sb.alias, \"_\")),\n      ];\n\n      const aliasMaybeSuffix = kq(`${parentAlias}${field.aliasSuffix}`);\n\n      const cb = new ConditionBuilder();\n      let m2mTable: JoinTable | undefined;\n      let m2mAlias: string | undefined;\n      if (otherField.kind === \"m2o\") {\n        cb.addRawCondition({\n          aliases: [otherAlias, parentAlias],\n          condition: `${kqDot(otherAlias, otherField.serde.columns[0].columnName)} = ${kqDot(parentAlias, \"id\")}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"poly\") {\n        // Get the component that points to us\n        // const comp = otherField.components.find((c) => getAllMetas(parentMeta).some((m) => m.cstr === c.otherMetadata().cstr)) ??\n        const comp =\n          otherField.components.find((c) => parentMeta.cstr === c.otherMetadata().cstr) ??\n          fail(`No component found for ${field.fieldName} -> ${otherField.fieldName}`);\n        cb.addRawCondition({\n          aliases: [otherAlias, parentAlias],\n          condition: `${kqDot(otherAlias, comp.columnName)} = ${kqDot(parentAlias, \"id\")}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"o2m\" || otherField.kind === \"lo2m\") {\n        cb.addRawCondition({\n          aliases: [otherAlias, aliasMaybeSuffix],\n          condition: `${kqDot(otherAlias, \"id\")} = ${aliasMaybeSuffix}.${kq(field.serde!.columns[0].columnName)}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"o2o\") {\n        cb.addRawCondition({\n          aliases: [otherAlias, aliasMaybeSuffix],\n          condition: `${kqDot(otherAlias, \"id\")} = ${aliasMaybeSuffix}.${kq(field.serde!.columns[0].columnName)}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"m2m\") {\n        m2mAlias = assigner.getAlias(otherField.joinTableName);\n        // Get the m2m row's id to track in JoinRows; id-less tables have no surrogate id.\n        if (otherField.hasJoinTableId) selects.unshift(kqDot(m2mAlias, \"id\"));\n        m2mTable = {\n          join: \"inner\",\n          table: otherField.joinTableName,\n          alias: m2mAlias,\n          col1: kqDot(parentAlias, \"id\"),\n          col2: kqDot(m2mAlias, otherField.columnNames[1]),\n        };\n        cb.addRawCondition({\n          aliases: [m2mAlias, otherAlias],\n          condition: `${kqDot(m2mAlias, otherField.columnNames[0])} = ${kqDot(otherAlias, \"id\")}`,\n          pruneable: true,\n        });\n      } else {\n        throw new Error(`Unsupported otherField.kind ${otherField.kind}`);\n      }\n\n      const needsSubSelect = subTree.entities.size !== root.tree.entities.size;\n      if (needsSubSelect) {\n        cb.addRawCondition({\n          aliases: [root.alias],\n          condition: `${kqDot(root.alias, \"id\")} = ANY(?)`,\n          bindings: [\n            [...subTree.entities]\n              .filter((e) => typeof e === \"string\" || !e.isNewEntity)\n              .map((e) => keyToNumber(root.meta, typeof e === \"string\" ? e : e.id)),\n          ],\n          pruneable: true,\n        });\n      }\n\n      // For m2m, order by the join-row's id so preloaded results match the order the lazy batch\n      // loader returns (which orders by join-row id). Id-less join tables have no surrogate id,\n      // so order by the other entity's FK column (matching the lazy loader & getOthers). Otherwise,\n      // order by the target entity's id.\n      const orderBy =\n        otherField.kind === \"m2m\" && !otherField.hasJoinTableId\n          ? `${kq(m2mAlias!)}.${kq(otherField.columnNames[0])}`\n          : `${kq(m2mAlias ?? otherAlias)}.id`;\n\n      const join: LateralJoinTable = {\n        join: \"lateral\",\n        alias: otherAlias,\n        // Do we need to say which alias we're coming from, to avoid having it pruned?\n        // ...maybe not because preloading is always on the primary table?\n        fromAlias: \"unset\",\n        table: otherMeta.tableName,\n        query: {\n          selects: [`json_agg(json_build_array(${selects.join(\", \")}) order by ${orderBy}) as _`],\n          tables: [\n            { join: \"primary\", table: otherMeta.tableName, alias: otherAlias },\n            ...(m2mTable ? [m2mTable] : []),\n            ...subJoins.map((sj) => sj.join),\n          ],\n          condition: cb.toExpressionFilter(),\n          orderBys: [],\n        },\n      };\n\n      // Pre-compute column names so we don't re-read them per entity\n      const columnNames = columns.map((c) => c.columnName);\n      // If we've snuck the m2m row id into the json array, ignore it (id-less tables have no id)\n      const m2mOffset = field.kind === \"m2m\" && field.hasJoinTableId ? 1 : 0;\n\n      const hydrator: AggregateJsonHydrator = (root, parent, arrays) => {\n        const { em } = root;\n\n        // If we had overlapping load hints, i.e. `author.books` for [a1, a2] and `author.comments` for [a1], and\n        // we're processing the arrays of comments, but for a root author like `a2` that didn't ask for our load\n        // hint, then skip it to keep the relation unloaded.\n        if (subTree.entitiesKind === \"instances\" && !subTree.entities.has(root as any)) return;\n        if (subTree.entitiesKind === \"ids\" && !subTree.entities.has(root.idTagged as any)) return;\n\n        // We get back an array of [[1, title], [2, title], [3, title]]\n        const children = arrays.map((array) => {\n          const taggedId = keyToTaggedId(otherMeta, array[m2mOffset] as any)!;\n          const row: Record<string, any> = {};\n          for (let i = 0; i < columns.length; i++) {\n            row[columnNames[i]] = columns[i].mapFromJsonAgg(array[m2mOffset + i]);\n          }\n          const entity =\n            em.findExistingInstance<Entity>(taggedId) ??\n            (em.hydrate(otherMeta.cstr, [row], { overwriteExisting: false }) as Entity[])[0];\n          // Tell the internal JoinRow booking-keeping about this m2m row\n          if (field.kind === \"m2m\") {\n            // TODO This `addExisting` needs to be pulled up, out of the `arrays.map`, so we can do a `loadRows`-ish\n            // call that passes all now-known m2m rows into JoinRows as a single list, so that it can mark any\n            // deleted-from-under-us m2m rows as deleted.\n            const m2m = (parent as any)[key];\n            getEmInternalApi(em)\n              .joinRows(m2m)\n              .addPreloadedRow(m2m, field.hasJoinTableId ? (array[0] as any) : undefined, parent, entity);\n          }\n          // Within each child, look for grandchildren\n          subJoins.forEach((sub, i) => {\n            // array[i] could be null if there are no grandchildren, but still call `sub` to\n            // process it so that we store the empty array into the em.joinLoadedRelations, to\n            // avoid the relation.load method later doing a SQL for rows we know are not there.\n            sub.hydrator(root, entity, (array[m2mOffset + columns.length + i] as any) ?? []);\n          });\n          return entity;\n        });\n        // Cache the entities so `.load`s will see them\n        getEmInternalApi(em).setPreloadedRelation(parent.idTagged, key, children);\n      };\n\n      results.push({ alias: otherAlias, relationAlias, join, hydrator });\n    }\n  });\n\n  return results;\n}\n\n/**\n * Builds the `CROSS JOIN LATERAL` that aggregates an enum-m2m join table (e.g. `publisher_logo_colors`)\n * into a json array of enum ids, e.g. `[[1], [3]]` (or `[[1, id], [3, id]]` for id-ful join tables).\n */\nfunction calcEnumLateralJoin<I extends EntityOrId>(\n  assigner: AliasAssigner,\n  root: { tree: HintNode<I>; alias: string; meta: EntityMetadata },\n  subTree: HintNode<I>,\n  parentAlias: string,\n  field: ManyToManyEnumField,\n  key: string,\n  pathPrefix: string,\n): AggregateJoinResult {\n  const [entityColumn, enumColumn] = field.columnNames;\n  const jtAlias = `_${assigner.getAlias(field.joinTableName)}`;\n  const relationAlias = `_${assigner.getLiteralAlias(`${pathPrefix}${key.toLowerCase()}`)}`;\n\n  const parts = [kqDot(jtAlias, enumColumn)];\n  if (field.hasJoinTableId) parts.push(kqDot(jtAlias, \"id\"));\n\n  const cb = new ConditionBuilder();\n  cb.addRawCondition({\n    aliases: [jtAlias, parentAlias],\n    condition: `${kqDot(jtAlias, entityColumn)} = ${kqDot(parentAlias, \"id\")}`,\n    pruneable: true,\n  });\n\n  const needsSubSelect = subTree.entities.size !== root.tree.entities.size;\n  if (needsSubSelect) {\n    cb.addRawCondition({\n      aliases: [root.alias],\n      condition: `${kqDot(root.alias, \"id\")} = ANY(?)`,\n      bindings: [\n        [...subTree.entities]\n          .filter((e) => typeof e === \"string\" || !e.isNewEntity)\n          .map((e) => keyToNumber(root.meta, typeof e === \"string\" ? e : e.id)),\n      ],\n      pruneable: true,\n    });\n  }\n\n  const orderBy = `${kq(jtAlias)}.${kq(field.hasJoinTableId ? \"id\" : enumColumn)}`;\n  const join: LateralJoinTable = {\n    join: \"lateral\",\n    alias: jtAlias,\n    fromAlias: \"unset\",\n    table: field.joinTableName,\n    query: {\n      selects: [`json_agg(json_build_array(${parts.join(\", \")}) order by ${orderBy}) as _`],\n      tables: [{ join: \"primary\", table: field.joinTableName, alias: jtAlias }],\n      condition: cb.toExpressionFilter(),\n      orderBys: [],\n    },\n  };\n\n  const hydrator: AggregateJsonHydrator = (root, parent, arrays) => {\n    const { em } = root;\n    if (subTree.entitiesKind === \"instances\" && !subTree.entities.has(root as any)) return;\n    if (subTree.entitiesKind === \"ids\" && !subTree.entities.has(root.idTagged as any)) return;\n    const like: ManyToManyLike = {\n      entity: parent,\n      joinTableName: field.joinTableName,\n      columnName: entityColumn,\n      otherColumnName: enumColumn,\n      fieldName: key,\n      meta: getMetadataForField(getMetadata(parent), key),\n      otherEnum: field.enumDetailType,\n      hasJoinTableId: field.hasJoinTableId,\n    };\n    const api = getEmInternalApi(em);\n    const joinRows = api.joinRows(like);\n    const codes: any[] = [];\n    for (const array of arrays) {\n      const enumId = array[0] as number;\n      joinRows.addPreloadedRow(like, field.hasJoinTableId ? (array[1] as number) : undefined, parent, enumId);\n      codes.push(field.enumDetailType.findById(enumId)!.code);\n    }\n    api.setPreloadedRelation(parent.idTagged, key, codes);\n  };\n\n  return { alias: jtAlias, relationAlias, join, hydrator };\n}\n\n/** A preload-loadable join for a given child, with potentially grand-child joins contained within it. */\ntype AggregateJoinResult = {\n  /** The short table alias used for column references inside the subquery, e.g. `_b1`. */\n  alias: string;\n  /** The readable relation-name alias used in the outer `AS` clause, e.g. `_prequel`. */\n  relationAlias: string;\n  /** The SQL for this child's lateral join, which itself might have recursive lateral joins. */\n  join: LateralJoinTable;\n  /** The hydrator for this child's lateral join, which itself might recursively hydrator subjoins. */\n  hydrator: AggregateJsonHydrator;\n};\n\n/** Reads one column from either classic POJO rows or a lazy `RowData` result. */\nfunction readRowValue(rows: any[] | RowData, rowIndex: number, columnName: string): any {\n  return Array.isArray(rows) ? rows[rowIndex][columnName] : rows.get(rowIndex, columnName);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAqBA,IAAa,yBAAb,MAA6D;CAC3D,cACE,MACA,MACoE;EACpE,OAAO,cAAc,MAAM,IAAI;CACjC;CAEA,cACE,MACA,MACA,OAC6B;EAC7B,MAAM,WAAW,IAAI,cAAc,KAAK;EAGxC,MAAM,QAAQ,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;EAClC,MAAM,QAAQ,iBAAiB,UAAU;GAAE,MAAM;GAAM;GAAO;EAAK,GAAG,MAAM,OAAO,IAAI;EAEvF,IAAI,MAAM,WAAW,GAAG,OAAO,KAAA;EAG/B,KAAK,MAAM,EAAE,OAAO,eAAe,UAAU,OAAO;GAClD,MAAM,QAAQ,KAAK;IACjB,KAAK,GAAG,MAAM,OAAO,GAAG,EAAE,MAAM,GAAG,aAAa;IAChD,SAAS,CAAC,KAAK;IACf,UAAU,CAAC;GACb,CAAC;GACD,MAAM,OAAO,KAAK,IAAI;EACxB;EAEA,QAAQ,MAAM,aAAa;GACzB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;IACxC,MAAM,SAAS,SAAS;IACxB,KAAK,MAAM,EAAE,eAAe,cAAc,OACxC,SAAS,QAAQ,QAAQ,aAAa,MAAM,GAAG,aAAa,KAAK,CAAC,CAAC;GAEvE;EACF;CACF;CAEA,gBAAkC,MAAsB,MAAmB,OAAsC;EAC/G,MAAM,WAAW,IAAI,cAAc,KAAK;EAGxC,MAAM,QAAQ,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;EAKlC,OAJc,iBAAiB,UAAU;GAAE,MAAM;GAAM;GAAO;EAAK,GAAG,MAAM,OAAO,IAIxE,CAAC,CAAC,KAAK,SAAS;GACzB,OAAO;IACL,SAAS,CAAC;KAAE,OAAO,MAAM,KAAK,OAAO,GAAG;KAAG,IAAI,KAAK;IAAc,CAAC;IACnE,MAAM,KAAK;IACX,WAAW,MAAM,aAAa;KAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;MACxC,MAAM,SAAS,SAAS;MACxB,KAAK,SAAS,QAAQ,QAAQ,aAAa,MAAM,GAAG,KAAK,aAAa,KAAK,CAAC,CAAC;KAC/E;IACF;GACF;EACF,CAAC;CACH;AACF;;;;;;;;;;;;;;;AAoBA,SAAS,iBACP,UACA,MACA,MACA,aACA,YACA,aAAqB,IACE;CACvB,MAAM,UAAiC,CAAC;CAGxC,OAAO,QAAQ,KAAK,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,aAAa;EACrD,MAAM,QAAQ,WAAW,UAAU;EAEnC,IAAI,SAAS,WAAW,YAAY,KAAK,GAAG;GAE1C,IAAI,MAAM,SAAS,WAAW;IAC5B,QAAQ,KAAK,oBAAoB,UAAU,MAAM,SAAS,aAAa,OAAO,KAAK,UAAU,CAAC;IAC9F;GACF;GACA,MAAM,YAAY,MAAM,cAAc;GACtC,MAAM,aAAa,UAAU,UAAU,MAAM;GAG7C,MAAM,aAAa,IAAI,SAAS,SAAS,UAAU,SAAS;GAE5D,MAAM,UAAU,IAAI,YAAY;GAChC,MAAM,gBAAgB,IAAI,SAAS,gBAAgB,GAAG,aAAa,SAAS;GAG5E,MAAM,WAAW,iBAAiB,UAAU,MAAM,SAAS,YAAY,WAAW,GAAG,aAAa,QAAQ,EAAE;GAG5G,MAAM,UAAU,OAAO,OAAO,UAAU,SAAS,CAAC,CAC/C,QAAQ,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,eAAe,EAAE,KAAK,CAAC,CAC7D,SAAS,MAAM,EAAE,MAAO,OAAO;GAClC,MAAM,UAAU,CACd,GAAG,QAAQ,KAAK,MAAM,MAAM,YAAY,EAAE,UAAU,CAAC,GAGrD,GAAG,SAAS,KAAK,OAAO,MAAM,GAAG,OAAO,GAAG,CAAC,CAC9C;GAEA,MAAM,mBAAmB,GAAG,GAAG,cAAc,MAAM,aAAa;GAEhE,MAAM,KAAK,IAAI,iBAAiB;GAChC,IAAI;GACJ,IAAI;GACJ,IAAI,WAAW,SAAS,OACtB,GAAG,gBAAgB;IACjB,SAAS,CAAC,YAAY,WAAW;IACjC,WAAW,GAAG,MAAM,YAAY,WAAW,MAAM,QAAQ,EAAE,CAAC,UAAU,EAAE,KAAK,MAAM,aAAa,IAAI;IACpG,WAAW;GACb,CAAC;QACI,IAAI,WAAW,SAAS,QAAQ;IAGrC,MAAM,OACJ,WAAW,WAAW,MAAM,MAAM,WAAW,SAAS,EAAE,cAAc,CAAC,CAAC,IAAI,KAC5E,KAAK,0BAA0B,MAAM,UAAU,MAAM,WAAW,WAAW;IAC7E,GAAG,gBAAgB;KACjB,SAAS,CAAC,YAAY,WAAW;KACjC,WAAW,GAAG,MAAM,YAAY,KAAK,UAAU,EAAE,KAAK,MAAM,aAAa,IAAI;KAC7E,WAAW;IACb,CAAC;GACH,OAAO,IAAI,WAAW,SAAS,SAAS,WAAW,SAAS,QAC1D,GAAG,gBAAgB;IACjB,SAAS,CAAC,YAAY,gBAAgB;IACtC,WAAW,GAAG,MAAM,YAAY,IAAI,EAAE,KAAK,iBAAiB,GAAG,GAAG,MAAM,MAAO,QAAQ,EAAE,CAAC,UAAU;IACpG,WAAW;GACb,CAAC;QACI,IAAI,WAAW,SAAS,OAC7B,GAAG,gBAAgB;IACjB,SAAS,CAAC,YAAY,gBAAgB;IACtC,WAAW,GAAG,MAAM,YAAY,IAAI,EAAE,KAAK,iBAAiB,GAAG,GAAG,MAAM,MAAO,QAAQ,EAAE,CAAC,UAAU;IACpG,WAAW;GACb,CAAC;QACI,IAAI,WAAW,SAAS,OAAO;IACpC,WAAW,SAAS,SAAS,WAAW,aAAa;IAErD,IAAI,WAAW,gBAAgB,QAAQ,QAAQ,MAAM,UAAU,IAAI,CAAC;IACpE,WAAW;KACT,MAAM;KACN,OAAO,WAAW;KAClB,OAAO;KACP,MAAM,MAAM,aAAa,IAAI;KAC7B,MAAM,MAAM,UAAU,WAAW,YAAY,EAAE;IACjD;IACA,GAAG,gBAAgB;KACjB,SAAS,CAAC,UAAU,UAAU;KAC9B,WAAW,GAAG,MAAM,UAAU,WAAW,YAAY,EAAE,EAAE,KAAK,MAAM,YAAY,IAAI;KACpF,WAAW;IACb,CAAC;GACH,OACE,MAAM,IAAI,MAAM,+BAA+B,WAAW,MAAM;GAIlE,IADuB,QAAQ,SAAS,SAAS,KAAK,KAAK,SAAS,MAElE,GAAG,gBAAgB;IACjB,SAAS,CAAC,KAAK,KAAK;IACpB,WAAW,GAAG,MAAM,KAAK,OAAO,IAAI,EAAE;IACtC,UAAU,CACR,CAAC,GAAG,QAAQ,QAAQ,CAAC,CAClB,QAAQ,MAAM,OAAO,MAAM,YAAY,CAAC,EAAE,WAAW,CAAC,CACtD,KAAK,MAAM,YAAY,KAAK,MAAM,OAAO,MAAM,WAAW,IAAI,EAAE,EAAE,CAAC,CACxE;IACA,WAAW;GACb,CAAC;GAOH,MAAM,UACJ,WAAW,SAAS,SAAS,CAAC,WAAW,iBACrC,GAAG,GAAG,QAAS,EAAE,GAAG,GAAG,WAAW,YAAY,EAAE,MAChD,GAAG,GAAG,YAAY,UAAU,EAAE;GAEpC,MAAM,OAAyB;IAC7B,MAAM;IACN,OAAO;IAGP,WAAW;IACX,OAAO,UAAU;IACjB,OAAO;KACL,SAAS,CAAC,6BAA6B,QAAQ,KAAK,IAAI,EAAE,aAAa,QAAQ,OAAO;KACtF,QAAQ;MACN;OAAE,MAAM;OAAW,OAAO,UAAU;OAAW,OAAO;MAAW;MACjE,GAAI,WAAW,CAAC,QAAQ,IAAI,CAAC;MAC7B,GAAG,SAAS,KAAK,OAAO,GAAG,IAAI;KACjC;KACA,WAAW,GAAG,mBAAmB;KACjC,UAAU,CAAC;IACb;GACF;GAGA,MAAM,cAAc,QAAQ,KAAK,MAAM,EAAE,UAAU;GAEnD,MAAM,YAAY,MAAM,SAAS,SAAS,MAAM,iBAAiB,IAAI;GAErE,MAAM,YAAmC,MAAM,QAAQ,WAAW;IAChE,MAAM,EAAE,OAAO;IAKf,IAAI,QAAQ,iBAAiB,eAAe,CAAC,QAAQ,SAAS,IAAI,IAAW,GAAG;IAChF,IAAI,QAAQ,iBAAiB,SAAS,CAAC,QAAQ,SAAS,IAAI,KAAK,QAAe,GAAG;IAGnF,MAAM,WAAW,OAAO,KAAK,UAAU;KACrC,MAAM,WAAW,cAAc,WAAW,MAAM,UAAiB;KACjE,MAAM,MAA2B,CAAC;KAClC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,IAAI,YAAY,MAAM,QAAQ,EAAE,CAAC,eAAe,MAAM,YAAY,EAAE;KAEtE,MAAM,SACJ,GAAG,qBAA6B,QAAQ,KACvC,GAAG,QAAQ,UAAU,MAAM,CAAC,GAAG,GAAG,EAAE,mBAAmB,MAAM,CAAC,CAAC,CAAc;KAEhF,IAAI,MAAM,SAAS,OAAO;MAIxB,MAAM,MAAO,OAAe;MAC5B,iBAAiB,EAAE,CAAC,CACjB,SAAS,GAAG,CAAC,CACb,gBAAgB,KAAK,MAAM,iBAAkB,MAAM,KAAa,KAAA,GAAW,QAAQ,MAAM;KAC9F;KAEA,SAAS,SAAS,KAAK,MAAM;MAI3B,IAAI,SAAS,MAAM,QAAS,MAAM,YAAY,QAAQ,SAAS,MAAc,CAAC,CAAC;KACjF,CAAC;KACD,OAAO;IACT,CAAC;IAED,iBAAiB,EAAE,CAAC,CAAC,qBAAqB,OAAO,UAAU,KAAK,QAAQ;GAC1E;GAEA,QAAQ,KAAK;IAAE,OAAO;IAAY;IAAe;IAAM;GAAS,CAAC;EACnE;CACF,CAAC;CAED,OAAO;AACT;;;;;AAMA,SAAS,oBACP,UACA,MACA,SACA,aACA,OACA,KACA,YACqB;CACrB,MAAM,CAAC,cAAc,cAAc,MAAM;CACzC,MAAM,UAAU,IAAI,SAAS,SAAS,MAAM,aAAa;CACzD,MAAM,gBAAgB,IAAI,SAAS,gBAAgB,GAAG,aAAa,IAAI,YAAY,GAAG;CAEtF,MAAM,QAAQ,CAAC,MAAM,SAAS,UAAU,CAAC;CACzC,IAAI,MAAM,gBAAgB,MAAM,KAAK,MAAM,SAAS,IAAI,CAAC;CAEzD,MAAM,KAAK,IAAI,iBAAiB;CAChC,GAAG,gBAAgB;EACjB,SAAS,CAAC,SAAS,WAAW;EAC9B,WAAW,GAAG,MAAM,SAAS,YAAY,EAAE,KAAK,MAAM,aAAa,IAAI;EACvE,WAAW;CACb,CAAC;CAGD,IADuB,QAAQ,SAAS,SAAS,KAAK,KAAK,SAAS,MAElE,GAAG,gBAAgB;EACjB,SAAS,CAAC,KAAK,KAAK;EACpB,WAAW,GAAG,MAAM,KAAK,OAAO,IAAI,EAAE;EACtC,UAAU,CACR,CAAC,GAAG,QAAQ,QAAQ,CAAC,CAClB,QAAQ,MAAM,OAAO,MAAM,YAAY,CAAC,EAAE,WAAW,CAAC,CACtD,KAAK,MAAM,YAAY,KAAK,MAAM,OAAO,MAAM,WAAW,IAAI,EAAE,EAAE,CAAC,CACxE;EACA,WAAW;CACb,CAAC;CAGH,MAAM,UAAU,GAAG,GAAG,OAAO,EAAE,GAAG,GAAG,MAAM,iBAAiB,OAAO,UAAU;CAC7E,MAAM,OAAyB;EAC7B,MAAM;EACN,OAAO;EACP,WAAW;EACX,OAAO,MAAM;EACb,OAAO;GACL,SAAS,CAAC,6BAA6B,MAAM,KAAK,IAAI,EAAE,aAAa,QAAQ,OAAO;GACpF,QAAQ,CAAC;IAAE,MAAM;IAAW,OAAO,MAAM;IAAe,OAAO;GAAQ,CAAC;GACxE,WAAW,GAAG,mBAAmB;GACjC,UAAU,CAAC;EACb;CACF;CAEA,MAAM,YAAmC,MAAM,QAAQ,WAAW;EAChE,MAAM,EAAE,OAAO;EACf,IAAI,QAAQ,iBAAiB,eAAe,CAAC,QAAQ,SAAS,IAAI,IAAW,GAAG;EAChF,IAAI,QAAQ,iBAAiB,SAAS,CAAC,QAAQ,SAAS,IAAI,KAAK,QAAe,GAAG;EACnF,MAAM,OAAuB;GAC3B,QAAQ;GACR,eAAe,MAAM;GACrB,YAAY;GACZ,iBAAiB;GACjB,WAAW;GACX,MAAM,oBAAoB,YAAY,MAAM,GAAG,GAAG;GAClD,WAAW,MAAM;GACjB,gBAAgB,MAAM;EACxB;EACA,MAAM,MAAM,iBAAiB,EAAE;EAC/B,MAAM,WAAW,IAAI,SAAS,IAAI;EAClC,MAAM,QAAe,CAAC;EACtB,KAAK,MAAM,SAAS,QAAQ;GAC1B,MAAM,SAAS,MAAM;GACrB,SAAS,gBAAgB,MAAM,MAAM,iBAAkB,MAAM,KAAgB,KAAA,GAAW,QAAQ,MAAM;GACtG,MAAM,KAAK,MAAM,eAAe,SAAS,MAAM,CAAC,CAAE,IAAI;EACxD;EACA,IAAI,qBAAqB,OAAO,UAAU,KAAK,KAAK;CACtD;CAEA,OAAO;EAAE,OAAO;EAAS;EAAe;EAAM;CAAS;AACzD;;AAeA,SAAS,aAAa,MAAuB,UAAkB,YAAyB;CACtF,OAAO,MAAM,QAAQ,IAAI,IAAI,KAAK,SAAS,CAAC,cAAc,KAAK,IAAI,UAAU,UAAU;AACzF"}
+{"version":3,"file":"JsonAggregatePreloader.js","names":[],"sources":["../../src/preloading/JsonAggregatePreloader.ts"],"sourcesContent":["import { type Entity } from \"src/Entity.ts\";\nimport { getEmInternalApi } from \"src/EntityManager.ts\";\nimport { type EntityMetadata, type ManyToManyEnumField, getMetadata, getMetadataForField } from \"src/EntityMetadata.ts\";\nimport type { ManyToManyLike } from \"src/flush/JoinRows.ts\";\nimport { keyToNumber, keyToTaggedId } from \"src/keys.ts\";\nimport type { EntityOrId, HintNode } from \"src/loading/HintTree.ts\";\nimport type { LoadHint, NestedLoadHint } from \"src/loading/loadHints.ts\";\nimport { type JoinResult, type PreloadHydrator, type PreloadPlugin } from \"src/plugins/PreloadPlugin.ts\";\nimport { canPreload } from \"src/preloading/canPreload.ts\";\nimport { partitionHint } from \"src/preloading/partitionHint.ts\";\nimport { ConditionBuilder } from \"src/queries/ConditionBuilder.ts\";\nimport {\n  type JoinTable,\n  type LateralJoinTable,\n  type ParsedFindQuery,\n  getTables,\n} from \"src/queries/find/QueryParser.ts\";\nimport { AliasAssigner } from \"src/queries/sql/AliasAssigner.ts\";\nimport { kq, kqDot } from \"src/queries/sql/keywords.ts\";\nimport { type RowData } from \"src/RowData.ts\";\nimport { fail } from \"src/utils.ts\";\n\n/**\n * A PreloadPlugin implementation that uses `CROSS LATERAL JOIN` and `json_aggregate`\n * to preload/reduce a subtree of data while still being a single row of data.\n */\nexport class JsonAggregatePreloader implements PreloadPlugin {\n  partitionHint(\n    meta: EntityMetadata | undefined,\n    hint: LoadHint<any>,\n  ): [NestedLoadHint<any> | undefined, NestedLoadHint<any> | undefined] {\n    return partitionHint(meta, hint);\n  }\n\n  addPreloading<T extends Entity>(\n    meta: EntityMetadata,\n    root: HintNode<T>,\n    query: ParsedFindQuery,\n  ): PreloadHydrator | undefined {\n    const assigner = new AliasAssigner(query);\n\n    // Get the existing primary alias\n    const alias = getTables(query)[0].alias;\n    const joins = calcLateralJoins(assigner, { tree: root, alias, meta }, root, alias, meta);\n    // If there are no sql-based preload in the hints, just return\n    if (joins.length === 0) return undefined;\n\n    // Include the aggregate `_b1._ as _prequel`, `_c._ as _randomComment`\n    for (const { alias, relationAlias, join } of joins) {\n      query.selects.push({\n        sql: `${kqDot(alias, \"_\")} as ${kq(relationAlias)}`,\n        aliases: [alias],\n        bindings: [],\n      });\n      query.tables.push(join);\n    }\n\n    return (rows, entities) => {\n      for (let i = 0; i < entities.length; i++) {\n        const parent = entities[i];\n        for (const { relationAlias, hydrator } of joins) {\n          hydrator(parent, parent, readRowValue(rows, i, relationAlias) ?? []);\n        }\n      }\n    };\n  }\n\n  getPreloadJoins<T extends Entity>(meta: EntityMetadata, root: HintNode<T>, query: ParsedFindQuery): JoinResult[] {\n    const assigner = new AliasAssigner(query);\n\n    // Get the existing primary alias\n    const alias = getTables(query)[0].alias;\n    const joins = calcLateralJoins(assigner, { tree: root, alias, meta }, root, alias, meta);\n    // If there are no sql-based preload in the hints, just return\n\n    // Adapt our json aggregate joins to the higher-level JoinResult\n    return joins.map((join) => {\n      return {\n        selects: [{ value: kqDot(join.alias, \"_\"), as: join.relationAlias }],\n        join: join.join,\n        hydrator: (rows, entities) => {\n          for (let i = 0; i < entities.length; i++) {\n            const parent = entities[i];\n            join.hydrator(parent, parent, readRowValue(rows, i, join.relationAlias) ?? []);\n          }\n        },\n      };\n    });\n  }\n}\n\n/** Decodes an array-of-arrays of children entries, and stores them the `parent`'s relation. */\ntype AggregateJsonHydrator = (root: Entity, parent: Entity, arrays: unknown[][]) => void;\n\n/**\n * For a given hint tree `hint`, finds all SQL-able relations and preloads them.\n *\n * Specifically we use `json_agg` & `json_build_array` to `CROSS LATERAL JOIN`\n * children/grand children back as arbitrarily-deeply nested arrays, and then\n * stash the results in the `EntityManager` `joinLoadedRelations` cache, which\n * each join-instrumented relation will check before making its SQL calls.\n *\n * https://sqlfum.pt/?n=60&indent=2&spaces=1&simplify=1&align=0&case=lower&sql=c2VsZWN0IGEuaWQsIGIuXyBhcyBiLCBjMS5fIGFzIGMxLCBhMS5fIGFzIGExIGZyb20gYXV0aG9ycyBhIGNyb3NzIGpvaW4gbGF0ZXJhbCAoIHNlbGVjdCBqc29uX2FnZyhqc29uX2J1aWxkX2FycmF5KGIuaWQsIGIudGl0bGUsIGIuIm9yZGVyIiwgYi5kZWxldGVkX2F0LCBiLmNyZWF0ZWRfYXQsIGIudXBkYXRlZF9hdCwgYi5hdXRob3JfaWQsIGJyLl8pKSBhcyBfIGZyb20gYm9va3MgYiBjcm9zcyBqb2luIGxhdGVyYWwgKCBzZWxlY3QganNvbl9hZ2coanNvbl9idWlsZF9hcnJheShici5pZCwgYnIucmF0aW5nLCBici5pc19wdWJsaWMsIGJyLmlzX3Rlc3QsIGJyLmNyZWF0ZWRfYXQsIGJyLnVwZGF0ZWRfYXQsIGJyLmJvb2tfaWQsIGMuXykpIGFzIF8gZnJvbSBib29rX3Jldmlld3MgYnIgY3Jvc3Mgam9pbiBsYXRlcmFsICggc2VsZWN0IGpzb25fYWdnKGpzb25fYnVpbGRfYXJyYXkoYy5pZCwgYy50ZXh0LCBjLmNyZWF0ZWRfYXQsIGMudXBkYXRlZF9hdCwgYy51c2VyX2lkLCBjLnBhcmVudF9hdXRob3JfaWQsIGMucGFyZW50X2Jvb2tfaWQsIGMucGFyZW50X2Jvb2tfcmV2aWV3X2lkLCBjLnBhcmVudF9wdWJsaXNoZXJfaWQpKSBhcyBfIGZyb20gY29tbWVudHMgYyB3aGVyZSBjLnBhcmVudF9ib29rX3Jldmlld19pZCA9IGJyLmlkICkgYyB3aGVyZSBici5ib29rX2lkID0gYi5pZCApIGJyIHdoZXJlIGIuYXV0aG9yX2lkID0gYS5pZCApIGIgY3Jvc3Mgam9pbiBsYXRlcmFsICggc2VsZWN0IGpzb25fYWdnKGpzb25fYnVpbGRfYXJyYXkoYzEuaWQsIGMxLnRleHQsIGMxLmNyZWF0ZWRfYXQsIGMxLnVwZGF0ZWRfYXQsIGMxLnVzZXJfaWQsIGMxLnBhcmVudF9hdXRob3JfaWQsIGMxLnBhcmVudF9ib29rX2lkLCBjMS5wYXJlbnRfYm9va19yZXZpZXdfaWQsIGMxLnBhcmVudF9wdWJsaXNoZXJfaWQpKSBhcyBfIGZyb20gY29tbWVudHMgYzEgd2hlcmUgYzEucGFyZW50X2F1dGhvcl9pZCA9IGEuaWQgKSBjMSBjcm9zcyBqb2luIGxhdGVyYWwgKCBzZWxlY3QganNvbl9hZ2coanNvbl9idWlsZF9hcnJheShhMS5pZCwgYTEuZmlyc3RfbmFtZSwgYTEubGFzdF9uYW1lLCBhMS5zc24sIGExLmluaXRpYWxzLCBhMS5udW1iZXJfb2ZfYm9va3MsIGExLmJvb2tfY29tbWVudHMsIGExLmlzX3BvcHVsYXIsIGExLmFnZSwgYTEuZ3JhZHVhdGVkLCBhMS5uaWNrX25hbWVzLCBhMS53YXNfZXZlcl9wb3B1bGFyLCBhMS5hZGRyZXNzLCBhMS5idXNpbmVzc19hZGRyZXNzLCBhMS5xdW90ZXMsIGExLm51bWJlcl9vZl9hdG9tcywgYTEuZGVsZXRlZF9hdCwgYTEubnVtYmVyX29mX3B1YmxpY19yZXZpZXdzLCBhMS4ibnVtYmVyT2ZQdWJsaWNSZXZpZXdzMiIsIGExLnRhZ3Nfb2ZfYWxsX2Jvb2tzLCBhMS5jcmVhdGVkX2F0LCBhMS51cGRhdGVkX2F0LCBhMS5mYXZvcml0ZV9zaGFwZSwgYTEuZmF2b3JpdGVfY29sb3JzLCBhMS5tZW50b3JfaWQsIGExLmN1cnJlbnRfZHJhZnRfYm9va19pZCwgYTEuZmF2b3JpdGVfYm9va19pZCwgYTEucHVibGlzaGVyX2lkKSkgYXMgXyBmcm9tIGF1dGhvcnMgYTEgd2hlcmUgYTEuaWQgPSBhLm1lbnRvcl9pZCApIGExIHdoZXJlIGEuaWQgPSAxOw%3D%3D\n */\n\n/**\n * Given a `parent` like Author, and a hint of `{ books: ..., comments: ... }`, create `CROSS JOIN LATERAL`s\n * that will pull in the `books` & `comments` children.\n */\nfunction calcLateralJoins<I extends EntityOrId>(\n  assigner: AliasAssigner,\n  root: { tree: HintNode<I>; alias: string; meta: EntityMetadata },\n  tree: HintNode<I>,\n  parentAlias: string,\n  parentMeta: EntityMetadata,\n  pathPrefix: string = \"\",\n): AggregateJoinResult[] {\n  const results: AggregateJoinResult[] = [];\n\n  // Join in SQL-able hints from parent\n  Object.entries(tree.hints).forEach(([key, subTree]) => {\n    const field = parentMeta.allFields[key];\n    // AsyncProperties don't have fields, which is fine, skip for now...\n    if (field && canPreload(parentMeta, field)) {\n      // Enum m2ms have no \"other\" entity to join/hydrate; just aggregate the join table's enum ids.\n      if (field.kind === \"m2mEnum\") {\n        results.push(calcEnumLateralJoin(assigner, root, subTree, parentAlias, field, key, pathPrefix));\n        return;\n      }\n      const otherMeta = field.otherMetadata();\n      const otherField = otherMeta.allFields[field.otherFieldName];\n\n      // Short table alias for column refs inside the subquery, e.g. `_b1`\n      const otherAlias = `_${assigner.getAlias(otherMeta.tableName)}`;\n      // Readable path-based column alias for the outer AS clause, e.g. `_books_reviews`\n      const pathKey = key.toLowerCase();\n      const relationAlias = `_${assigner.getLiteralAlias(`${pathPrefix}${pathKey}`)}`;\n\n      // Do the recursion up-front, so we can work it into our own join/hydrator\n      const subJoins = calcLateralJoins(assigner, root, subTree, otherAlias, otherMeta, `${pathPrefix}${pathKey}_`);\n\n      // Get all fields with serdes and flatten out the columns, skipping `lazy` columns (fetched on-demand)\n      const columns = Object.values(otherMeta.allFields)\n        .filter((f) => f.serde && !(f.kind === \"primitive\" && f.lazy))\n        .flatMap((f) => f.serde!.columns);\n      const selects = [\n        ...columns.map((c) => kqDot(otherAlias, c.columnName)),\n        // We eventually need to handle parent types/subtypes here...\n        // Combine any grandchilden\n        ...subJoins.map((sb) => kqDot(sb.alias, \"_\")),\n      ];\n\n      const aliasMaybeSuffix = kq(`${parentAlias}${field.aliasSuffix}`);\n\n      const cb = new ConditionBuilder();\n      let m2mTable: JoinTable | undefined;\n      let m2mAlias: string | undefined;\n      if (otherField.kind === \"m2o\") {\n        cb.addRawCondition({\n          aliases: [otherAlias, parentAlias],\n          condition: `${kqDot(otherAlias, otherField.serde.columns[0].columnName)} = ${kqDot(parentAlias, \"id\")}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"poly\") {\n        // Get the component that points to us\n        // const comp = otherField.components.find((c) => getAllMetas(parentMeta).some((m) => m.cstr === c.otherMetadata().cstr)) ??\n        const comp =\n          otherField.components.find((c) => parentMeta.cstr === c.otherMetadata().cstr) ??\n          fail(`No component found for ${field.fieldName} -> ${otherField.fieldName}`);\n        cb.addRawCondition({\n          aliases: [otherAlias, parentAlias],\n          condition: `${kqDot(otherAlias, comp.columnName)} = ${kqDot(parentAlias, \"id\")}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"o2m\" || otherField.kind === \"lo2m\") {\n        cb.addRawCondition({\n          aliases: [otherAlias, aliasMaybeSuffix],\n          condition: `${kqDot(otherAlias, \"id\")} = ${aliasMaybeSuffix}.${kq(field.serde!.columns[0].columnName)}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"o2o\") {\n        cb.addRawCondition({\n          aliases: [otherAlias, aliasMaybeSuffix],\n          condition: `${kqDot(otherAlias, \"id\")} = ${aliasMaybeSuffix}.${kq(field.serde!.columns[0].columnName)}`,\n          pruneable: true,\n        });\n      } else if (otherField.kind === \"m2m\") {\n        m2mAlias = assigner.getAlias(otherField.joinTableName);\n        // Get the m2m row's id to track in JoinRows; id-less tables have no surrogate id.\n        if (otherField.hasJoinTableId) selects.unshift(kqDot(m2mAlias, \"id\"));\n        m2mTable = {\n          join: \"inner\",\n          table: otherField.joinTableName,\n          alias: m2mAlias,\n          col1: kqDot(parentAlias, \"id\"),\n          col2: kqDot(m2mAlias, otherField.columnNames[1]),\n        };\n        cb.addRawCondition({\n          aliases: [m2mAlias, otherAlias],\n          condition: `${kqDot(m2mAlias, otherField.columnNames[0])} = ${kqDot(otherAlias, \"id\")}`,\n          pruneable: true,\n        });\n      } else {\n        throw new Error(`Unsupported otherField.kind ${otherField.kind}`);\n      }\n\n      const needsSubSelect = subTree.entities.size !== root.tree.entities.size;\n      if (needsSubSelect) {\n        cb.addRawCondition({\n          aliases: [root.alias],\n          condition: `${kqDot(root.alias, \"id\")} = ANY(?)`,\n          bindings: [\n            [...subTree.entities]\n              .filter((e) => typeof e === \"string\" || !e.isNewEntity)\n              .map((e) => keyToNumber(root.meta, typeof e === \"string\" ? e : e.id)),\n          ],\n          pruneable: true,\n        });\n      }\n\n      // For m2m, order by the join-row's id so preloaded results match the order the lazy batch\n      // loader returns (which orders by join-row id). Id-less join tables have no surrogate id,\n      // so order by the other entity's FK column (matching the lazy loader & getOthers). Otherwise,\n      // order by the target entity's id.\n      const orderBy =\n        otherField.kind === \"m2m\" && !otherField.hasJoinTableId\n          ? `${kq(m2mAlias!)}.${kq(otherField.columnNames[0])}`\n          : `${kq(m2mAlias ?? otherAlias)}.id`;\n\n      const join: LateralJoinTable = {\n        join: \"lateral\",\n        alias: otherAlias,\n        // Do we need to say which alias we're coming from, to avoid having it pruned?\n        // ...maybe not because preloading is always on the primary table?\n        fromAlias: \"unset\",\n        table: otherMeta.tableName,\n        query: {\n          selects: [`json_agg(json_build_array(${selects.join(\", \")}) order by ${orderBy}) as _`],\n          tables: [\n            { join: \"primary\", table: otherMeta.tableName, alias: otherAlias },\n            ...(m2mTable ? [m2mTable] : []),\n            ...subJoins.map((sj) => sj.join),\n          ],\n          condition: cb.toExpressionFilter(),\n          orderBys: [],\n        },\n      };\n\n      // Pre-compute column names so we don't re-read them per entity\n      const columnNames = columns.map((c) => c.columnName);\n      // If we've snuck the m2m row id into the json array, ignore it (id-less tables have no id)\n      const m2mOffset = field.kind === \"m2m\" && field.hasJoinTableId ? 1 : 0;\n\n      const hydrator: AggregateJsonHydrator = (root, parent, arrays) => {\n        const { em } = root;\n\n        // If we had overlapping load hints, i.e. `author.books` for [a1, a2] and `author.comments` for [a1], and\n        // we're processing the arrays of comments, but for a root author like `a2` that didn't ask for our load\n        // hint, then skip it to keep the relation unloaded.\n        if (subTree.entitiesKind === \"instances\" && !subTree.entities.has(root as any)) return;\n        if (subTree.entitiesKind === \"ids\" && !subTree.entities.has(root.idTagged as any)) return;\n\n        // We get back an array of [[1, title], [2, title], [3, title]]\n        const children = arrays.map((array) => {\n          const taggedId = keyToTaggedId(otherMeta, array[m2mOffset] as any)!;\n          const row: Record<string, any> = {};\n          for (let i = 0; i < columns.length; i++) {\n            row[columnNames[i]] = columns[i].mapFromJsonAgg(array[m2mOffset + i]);\n          }\n          const entity =\n            em.findExistingInstance<Entity>(taggedId) ??\n            (em.hydrate(otherMeta.cstr, [row], { overwriteExisting: false }) as Entity[])[0];\n          // Tell the internal JoinRow booking-keeping about this m2m row\n          if (field.kind === \"m2m\") {\n            // TODO This `addExisting` needs to be pulled up, out of the `arrays.map`, so we can do a `loadRows`-ish\n            // call that passes all now-known m2m rows into JoinRows as a single list, so that it can mark any\n            // deleted-from-under-us m2m rows as deleted.\n            const m2m = (parent as any)[key];\n            getEmInternalApi(em)\n              .joinRows(m2m)\n              .addPreloadedRow(m2m, field.hasJoinTableId ? (array[0] as any) : undefined, parent, entity);\n          }\n          // Within each child, look for grandchildren\n          subJoins.forEach((sub, i) => {\n            // array[i] could be null if there are no grandchildren, but still call `sub` to\n            // process it so that we store the empty array into the em.joinLoadedRelations, to\n            // avoid the relation.load method later doing a SQL for rows we know are not there.\n            sub.hydrator(root, entity, (array[m2mOffset + columns.length + i] as any) ?? []);\n          });\n          return entity;\n        });\n        // Cache the entities so `.load`s will see them\n        getEmInternalApi(em).setPreloadedRelation(parent.idTagged, key, children);\n      };\n\n      results.push({ alias: otherAlias, relationAlias, join, hydrator });\n    }\n  });\n\n  return results;\n}\n\n/**\n * Builds the `CROSS JOIN LATERAL` that aggregates an enum-m2m join table (e.g. `publisher_logo_colors`)\n * into a json array of enum ids, e.g. `[[1], [3]]` (or `[[1, id], [3, id]]` for id-ful join tables).\n */\nfunction calcEnumLateralJoin<I extends EntityOrId>(\n  assigner: AliasAssigner,\n  root: { tree: HintNode<I>; alias: string; meta: EntityMetadata },\n  subTree: HintNode<I>,\n  parentAlias: string,\n  field: ManyToManyEnumField,\n  key: string,\n  pathPrefix: string,\n): AggregateJoinResult {\n  const [entityColumn, enumColumn] = field.columnNames;\n  const jtAlias = `_${assigner.getAlias(field.joinTableName)}`;\n  const relationAlias = `_${assigner.getLiteralAlias(`${pathPrefix}${key.toLowerCase()}`)}`;\n\n  const parts = [kqDot(jtAlias, enumColumn)];\n  if (field.hasJoinTableId) parts.push(kqDot(jtAlias, \"id\"));\n\n  const cb = new ConditionBuilder();\n  cb.addRawCondition({\n    aliases: [jtAlias, parentAlias],\n    condition: `${kqDot(jtAlias, entityColumn)} = ${kqDot(parentAlias, \"id\")}`,\n    pruneable: true,\n  });\n\n  const needsSubSelect = subTree.entities.size !== root.tree.entities.size;\n  if (needsSubSelect) {\n    cb.addRawCondition({\n      aliases: [root.alias],\n      condition: `${kqDot(root.alias, \"id\")} = ANY(?)`,\n      bindings: [\n        [...subTree.entities]\n          .filter((e) => typeof e === \"string\" || !e.isNewEntity)\n          .map((e) => keyToNumber(root.meta, typeof e === \"string\" ? e : e.id)),\n      ],\n      pruneable: true,\n    });\n  }\n\n  const orderBy = `${kq(jtAlias)}.${kq(field.hasJoinTableId ? \"id\" : enumColumn)}`;\n  const join: LateralJoinTable = {\n    join: \"lateral\",\n    alias: jtAlias,\n    fromAlias: \"unset\",\n    table: field.joinTableName,\n    query: {\n      selects: [`json_agg(json_build_array(${parts.join(\", \")}) order by ${orderBy}) as _`],\n      tables: [{ join: \"primary\", table: field.joinTableName, alias: jtAlias }],\n      condition: cb.toExpressionFilter(),\n      orderBys: [],\n    },\n  };\n\n  const hydrator: AggregateJsonHydrator = (root, parent, arrays) => {\n    const { em } = root;\n    if (subTree.entitiesKind === \"instances\" && !subTree.entities.has(root as any)) return;\n    if (subTree.entitiesKind === \"ids\" && !subTree.entities.has(root.idTagged as any)) return;\n    const like: ManyToManyLike = {\n      entity: parent,\n      joinTableName: field.joinTableName,\n      columnName: entityColumn,\n      otherColumnName: enumColumn,\n      fieldName: key,\n      meta: getMetadataForField(getMetadata(parent), key),\n      otherEnum: field.enumDetailType,\n      hasJoinTableId: field.hasJoinTableId,\n    };\n    const api = getEmInternalApi(em);\n    const joinRows = api.joinRows(like);\n    const codes: any[] = [];\n    for (const array of arrays) {\n      const enumId = array[0] as number;\n      joinRows.addPreloadedRow(like, field.hasJoinTableId ? (array[1] as number) : undefined, parent, enumId);\n      codes.push(field.enumDetailType.findById(enumId)!.code);\n    }\n    api.setPreloadedRelation(parent.idTagged, key, codes);\n  };\n\n  return { alias: jtAlias, relationAlias, join, hydrator };\n}\n\n/** A preload-loadable join for a given child, with potentially grand-child joins contained within it. */\ntype AggregateJoinResult = {\n  /** The short table alias used for column references inside the subquery, e.g. `_b1`. */\n  alias: string;\n  /** The readable relation-name alias used in the outer `AS` clause, e.g. `_prequel`. */\n  relationAlias: string;\n  /** The SQL for this child's lateral join, which itself might have recursive lateral joins. */\n  join: LateralJoinTable;\n  /** The hydrator for this child's lateral join, which itself might recursively hydrator subjoins. */\n  hydrator: AggregateJsonHydrator;\n};\n\n/** Reads one column from either classic POJO rows or a lazy `RowData` result. */\nfunction readRowValue(rows: any[] | RowData, rowIndex: number, columnName: string): any {\n  return Array.isArray(rows) ? rows[rowIndex][columnName] : rows.get(rowIndex, columnName);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AA0BA,IAAa,yBAAb,MAA6D;CAC3D,cACE,MACA,MACoE;EACpE,OAAO,cAAc,MAAM,IAAI;CACjC;CAEA,cACE,MACA,MACA,OAC6B;EAC7B,MAAM,WAAW,IAAI,cAAc,KAAK;EAGxC,MAAM,QAAQ,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;EAClC,MAAM,QAAQ,iBAAiB,UAAU;GAAE,MAAM;GAAM;GAAO;EAAK,GAAG,MAAM,OAAO,IAAI;EAEvF,IAAI,MAAM,WAAW,GAAG,OAAO,KAAA;EAG/B,KAAK,MAAM,EAAE,OAAO,eAAe,UAAU,OAAO;GAClD,MAAM,QAAQ,KAAK;IACjB,KAAK,GAAG,MAAM,OAAO,GAAG,EAAE,MAAM,GAAG,aAAa;IAChD,SAAS,CAAC,KAAK;IACf,UAAU,CAAC;GACb,CAAC;GACD,MAAM,OAAO,KAAK,IAAI;EACxB;EAEA,QAAQ,MAAM,aAAa;GACzB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;IACxC,MAAM,SAAS,SAAS;IACxB,KAAK,MAAM,EAAE,eAAe,cAAc,OACxC,SAAS,QAAQ,QAAQ,aAAa,MAAM,GAAG,aAAa,KAAK,CAAC,CAAC;GAEvE;EACF;CACF;CAEA,gBAAkC,MAAsB,MAAmB,OAAsC;EAC/G,MAAM,WAAW,IAAI,cAAc,KAAK;EAGxC,MAAM,QAAQ,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;EAKlC,OAJc,iBAAiB,UAAU;GAAE,MAAM;GAAM;GAAO;EAAK,GAAG,MAAM,OAAO,IAIxE,CAAC,CAAC,KAAK,SAAS;GACzB,OAAO;IACL,SAAS,CAAC;KAAE,OAAO,MAAM,KAAK,OAAO,GAAG;KAAG,IAAI,KAAK;IAAc,CAAC;IACnE,MAAM,KAAK;IACX,WAAW,MAAM,aAAa;KAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;MACxC,MAAM,SAAS,SAAS;MACxB,KAAK,SAAS,QAAQ,QAAQ,aAAa,MAAM,GAAG,KAAK,aAAa,KAAK,CAAC,CAAC;KAC/E;IACF;GACF;EACF,CAAC;CACH;AACF;;;;;;;;;;;;;;;AAoBA,SAAS,iBACP,UACA,MACA,MACA,aACA,YACA,aAAqB,IACE;CACvB,MAAM,UAAiC,CAAC;CAGxC,OAAO,QAAQ,KAAK,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,aAAa;EACrD,MAAM,QAAQ,WAAW,UAAU;EAEnC,IAAI,SAAS,WAAW,YAAY,KAAK,GAAG;GAE1C,IAAI,MAAM,SAAS,WAAW;IAC5B,QAAQ,KAAK,oBAAoB,UAAU,MAAM,SAAS,aAAa,OAAO,KAAK,UAAU,CAAC;IAC9F;GACF;GACA,MAAM,YAAY,MAAM,cAAc;GACtC,MAAM,aAAa,UAAU,UAAU,MAAM;GAG7C,MAAM,aAAa,IAAI,SAAS,SAAS,UAAU,SAAS;GAE5D,MAAM,UAAU,IAAI,YAAY;GAChC,MAAM,gBAAgB,IAAI,SAAS,gBAAgB,GAAG,aAAa,SAAS;GAG5E,MAAM,WAAW,iBAAiB,UAAU,MAAM,SAAS,YAAY,WAAW,GAAG,aAAa,QAAQ,EAAE;GAG5G,MAAM,UAAU,OAAO,OAAO,UAAU,SAAS,CAAC,CAC/C,QAAQ,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,eAAe,EAAE,KAAK,CAAC,CAC7D,SAAS,MAAM,EAAE,MAAO,OAAO;GAClC,MAAM,UAAU,CACd,GAAG,QAAQ,KAAK,MAAM,MAAM,YAAY,EAAE,UAAU,CAAC,GAGrD,GAAG,SAAS,KAAK,OAAO,MAAM,GAAG,OAAO,GAAG,CAAC,CAC9C;GAEA,MAAM,mBAAmB,GAAG,GAAG,cAAc,MAAM,aAAa;GAEhE,MAAM,KAAK,IAAI,iBAAiB;GAChC,IAAI;GACJ,IAAI;GACJ,IAAI,WAAW,SAAS,OACtB,GAAG,gBAAgB;IACjB,SAAS,CAAC,YAAY,WAAW;IACjC,WAAW,GAAG,MAAM,YAAY,WAAW,MAAM,QAAQ,EAAE,CAAC,UAAU,EAAE,KAAK,MAAM,aAAa,IAAI;IACpG,WAAW;GACb,CAAC;QACI,IAAI,WAAW,SAAS,QAAQ;IAGrC,MAAM,OACJ,WAAW,WAAW,MAAM,MAAM,WAAW,SAAS,EAAE,cAAc,CAAC,CAAC,IAAI,KAC5E,KAAK,0BAA0B,MAAM,UAAU,MAAM,WAAW,WAAW;IAC7E,GAAG,gBAAgB;KACjB,SAAS,CAAC,YAAY,WAAW;KACjC,WAAW,GAAG,MAAM,YAAY,KAAK,UAAU,EAAE,KAAK,MAAM,aAAa,IAAI;KAC7E,WAAW;IACb,CAAC;GACH,OAAO,IAAI,WAAW,SAAS,SAAS,WAAW,SAAS,QAC1D,GAAG,gBAAgB;IACjB,SAAS,CAAC,YAAY,gBAAgB;IACtC,WAAW,GAAG,MAAM,YAAY,IAAI,EAAE,KAAK,iBAAiB,GAAG,GAAG,MAAM,MAAO,QAAQ,EAAE,CAAC,UAAU;IACpG,WAAW;GACb,CAAC;QACI,IAAI,WAAW,SAAS,OAC7B,GAAG,gBAAgB;IACjB,SAAS,CAAC,YAAY,gBAAgB;IACtC,WAAW,GAAG,MAAM,YAAY,IAAI,EAAE,KAAK,iBAAiB,GAAG,GAAG,MAAM,MAAO,QAAQ,EAAE,CAAC,UAAU;IACpG,WAAW;GACb,CAAC;QACI,IAAI,WAAW,SAAS,OAAO;IACpC,WAAW,SAAS,SAAS,WAAW,aAAa;IAErD,IAAI,WAAW,gBAAgB,QAAQ,QAAQ,MAAM,UAAU,IAAI,CAAC;IACpE,WAAW;KACT,MAAM;KACN,OAAO,WAAW;KAClB,OAAO;KACP,MAAM,MAAM,aAAa,IAAI;KAC7B,MAAM,MAAM,UAAU,WAAW,YAAY,EAAE;IACjD;IACA,GAAG,gBAAgB;KACjB,SAAS,CAAC,UAAU,UAAU;KAC9B,WAAW,GAAG,MAAM,UAAU,WAAW,YAAY,EAAE,EAAE,KAAK,MAAM,YAAY,IAAI;KACpF,WAAW;IACb,CAAC;GACH,OACE,MAAM,IAAI,MAAM,+BAA+B,WAAW,MAAM;GAIlE,IADuB,QAAQ,SAAS,SAAS,KAAK,KAAK,SAAS,MAElE,GAAG,gBAAgB;IACjB,SAAS,CAAC,KAAK,KAAK;IACpB,WAAW,GAAG,MAAM,KAAK,OAAO,IAAI,EAAE;IACtC,UAAU,CACR,CAAC,GAAG,QAAQ,QAAQ,CAAC,CAClB,QAAQ,MAAM,OAAO,MAAM,YAAY,CAAC,EAAE,WAAW,CAAC,CACtD,KAAK,MAAM,YAAY,KAAK,MAAM,OAAO,MAAM,WAAW,IAAI,EAAE,EAAE,CAAC,CACxE;IACA,WAAW;GACb,CAAC;GAOH,MAAM,UACJ,WAAW,SAAS,SAAS,CAAC,WAAW,iBACrC,GAAG,GAAG,QAAS,EAAE,GAAG,GAAG,WAAW,YAAY,EAAE,MAChD,GAAG,GAAG,YAAY,UAAU,EAAE;GAEpC,MAAM,OAAyB;IAC7B,MAAM;IACN,OAAO;IAGP,WAAW;IACX,OAAO,UAAU;IACjB,OAAO;KACL,SAAS,CAAC,6BAA6B,QAAQ,KAAK,IAAI,EAAE,aAAa,QAAQ,OAAO;KACtF,QAAQ;MACN;OAAE,MAAM;OAAW,OAAO,UAAU;OAAW,OAAO;MAAW;MACjE,GAAI,WAAW,CAAC,QAAQ,IAAI,CAAC;MAC7B,GAAG,SAAS,KAAK,OAAO,GAAG,IAAI;KACjC;KACA,WAAW,GAAG,mBAAmB;KACjC,UAAU,CAAC;IACb;GACF;GAGA,MAAM,cAAc,QAAQ,KAAK,MAAM,EAAE,UAAU;GAEnD,MAAM,YAAY,MAAM,SAAS,SAAS,MAAM,iBAAiB,IAAI;GAErE,MAAM,YAAmC,MAAM,QAAQ,WAAW;IAChE,MAAM,EAAE,OAAO;IAKf,IAAI,QAAQ,iBAAiB,eAAe,CAAC,QAAQ,SAAS,IAAI,IAAW,GAAG;IAChF,IAAI,QAAQ,iBAAiB,SAAS,CAAC,QAAQ,SAAS,IAAI,KAAK,QAAe,GAAG;IAGnF,MAAM,WAAW,OAAO,KAAK,UAAU;KACrC,MAAM,WAAW,cAAc,WAAW,MAAM,UAAiB;KACjE,MAAM,MAA2B,CAAC;KAClC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,IAAI,YAAY,MAAM,QAAQ,EAAE,CAAC,eAAe,MAAM,YAAY,EAAE;KAEtE,MAAM,SACJ,GAAG,qBAA6B,QAAQ,KACvC,GAAG,QAAQ,UAAU,MAAM,CAAC,GAAG,GAAG,EAAE,mBAAmB,MAAM,CAAC,CAAC,CAAc;KAEhF,IAAI,MAAM,SAAS,OAAO;MAIxB,MAAM,MAAO,OAAe;MAC5B,iBAAiB,EAAE,CAAC,CACjB,SAAS,GAAG,CAAC,CACb,gBAAgB,KAAK,MAAM,iBAAkB,MAAM,KAAa,KAAA,GAAW,QAAQ,MAAM;KAC9F;KAEA,SAAS,SAAS,KAAK,MAAM;MAI3B,IAAI,SAAS,MAAM,QAAS,MAAM,YAAY,QAAQ,SAAS,MAAc,CAAC,CAAC;KACjF,CAAC;KACD,OAAO;IACT,CAAC;IAED,iBAAiB,EAAE,CAAC,CAAC,qBAAqB,OAAO,UAAU,KAAK,QAAQ;GAC1E;GAEA,QAAQ,KAAK;IAAE,OAAO;IAAY;IAAe;IAAM;GAAS,CAAC;EACnE;CACF,CAAC;CAED,OAAO;AACT;;;;;AAMA,SAAS,oBACP,UACA,MACA,SACA,aACA,OACA,KACA,YACqB;CACrB,MAAM,CAAC,cAAc,cAAc,MAAM;CACzC,MAAM,UAAU,IAAI,SAAS,SAAS,MAAM,aAAa;CACzD,MAAM,gBAAgB,IAAI,SAAS,gBAAgB,GAAG,aAAa,IAAI,YAAY,GAAG;CAEtF,MAAM,QAAQ,CAAC,MAAM,SAAS,UAAU,CAAC;CACzC,IAAI,MAAM,gBAAgB,MAAM,KAAK,MAAM,SAAS,IAAI,CAAC;CAEzD,MAAM,KAAK,IAAI,iBAAiB;CAChC,GAAG,gBAAgB;EACjB,SAAS,CAAC,SAAS,WAAW;EAC9B,WAAW,GAAG,MAAM,SAAS,YAAY,EAAE,KAAK,MAAM,aAAa,IAAI;EACvE,WAAW;CACb,CAAC;CAGD,IADuB,QAAQ,SAAS,SAAS,KAAK,KAAK,SAAS,MAElE,GAAG,gBAAgB;EACjB,SAAS,CAAC,KAAK,KAAK;EACpB,WAAW,GAAG,MAAM,KAAK,OAAO,IAAI,EAAE;EACtC,UAAU,CACR,CAAC,GAAG,QAAQ,QAAQ,CAAC,CAClB,QAAQ,MAAM,OAAO,MAAM,YAAY,CAAC,EAAE,WAAW,CAAC,CACtD,KAAK,MAAM,YAAY,KAAK,MAAM,OAAO,MAAM,WAAW,IAAI,EAAE,EAAE,CAAC,CACxE;EACA,WAAW;CACb,CAAC;CAGH,MAAM,UAAU,GAAG,GAAG,OAAO,EAAE,GAAG,GAAG,MAAM,iBAAiB,OAAO,UAAU;CAC7E,MAAM,OAAyB;EAC7B,MAAM;EACN,OAAO;EACP,WAAW;EACX,OAAO,MAAM;EACb,OAAO;GACL,SAAS,CAAC,6BAA6B,MAAM,KAAK,IAAI,EAAE,aAAa,QAAQ,OAAO;GACpF,QAAQ,CAAC;IAAE,MAAM;IAAW,OAAO,MAAM;IAAe,OAAO;GAAQ,CAAC;GACxE,WAAW,GAAG,mBAAmB;GACjC,UAAU,CAAC;EACb;CACF;CAEA,MAAM,YAAmC,MAAM,QAAQ,WAAW;EAChE,MAAM,EAAE,OAAO;EACf,IAAI,QAAQ,iBAAiB,eAAe,CAAC,QAAQ,SAAS,IAAI,IAAW,GAAG;EAChF,IAAI,QAAQ,iBAAiB,SAAS,CAAC,QAAQ,SAAS,IAAI,KAAK,QAAe,GAAG;EACnF,MAAM,OAAuB;GAC3B,QAAQ;GACR,eAAe,MAAM;GACrB,YAAY;GACZ,iBAAiB;GACjB,WAAW;GACX,MAAM,oBAAoB,YAAY,MAAM,GAAG,GAAG;GAClD,WAAW,MAAM;GACjB,gBAAgB,MAAM;EACxB;EACA,MAAM,MAAM,iBAAiB,EAAE;EAC/B,MAAM,WAAW,IAAI,SAAS,IAAI;EAClC,MAAM,QAAe,CAAC;EACtB,KAAK,MAAM,SAAS,QAAQ;GAC1B,MAAM,SAAS,MAAM;GACrB,SAAS,gBAAgB,MAAM,MAAM,iBAAkB,MAAM,KAAgB,KAAA,GAAW,QAAQ,MAAM;GACtG,MAAM,KAAK,MAAM,eAAe,SAAS,MAAM,CAAC,CAAE,IAAI;EACxD;EACA,IAAI,qBAAqB,OAAO,UAAU,KAAK,KAAK;CACtD;CAEA,OAAO;EAAE,OAAO;EAAS;EAAe;EAAM;CAAS;AACzD;;AAeA,SAAS,aAAa,MAAuB,UAAkB,YAAyB;CACtF,OAAO,MAAM,QAAQ,IAAI,IAAI,KAAK,SAAS,CAAC,cAAc,KAAK,IAAI,UAAU,UAAU;AACzF"}

package/build/preloading/canPreload.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"canPreload.cjs","names":[],"sources":["../../src/preloading/canPreload.ts"],"sourcesContent":["import {\n  type EntityMetadata,\n  type Field,\n  type ManyToManyEnumField,\n  type ManyToManyField,\n  type ManyToOneField,\n  type OneToManyField,\n  type OneToOneField,\n} from \"../EntityMetadata.ts\";\n\nexport function canPreload(\n  meta: EntityMetadata,\n  field: Field,\n): field is OneToManyField | ManyToOneField | ManyToManyField | ManyToManyEnumField | OneToOneField {\n  // Enum m2ms have no \"other\" entity table (the join target is an enum), so they're always preloadable.\n  if (field.kind === \"m2mEnum\") return true;\n  if (field.kind === \"o2m\" || field.kind === \"o2o\" || field.kind === \"m2o\" || field.kind === \"m2m\") {\n    const otherMeta = field.otherMetadata();\n    // We don't support preloading tables with inheritance yet\n    if (!!otherMeta.baseType || otherMeta.subTypes.length > 0) return false;\n    // If `otherField` is missing, this could be a large collection which currently can't be loaded...\n    const otherField = otherMeta.allFields[field.otherFieldName];\n    if (!otherField) return false;\n    // If otherField is a poly that points to a sub/base component, we don't support that yet\n    if (otherField.kind === \"poly\" && !otherField.components.some((c) => c.otherMetadata() === meta)) return false;\n    return true;\n  }\n  return false;\n}\n"],"mappings":";;;AAUA,SAAgB,WACd,MACA,OACkG;CAElG,IAAI,MAAM,SAAS,WAAW,OAAO;CACrC,IAAI,MAAM,SAAS,SAAS,MAAM,SAAS,SAAS,MAAM,SAAS,SAAS,MAAM,SAAS,OAAO;EAChG,MAAM,YAAY,MAAM,cAAc;EAEtC,IAAI,CAAC,CAAC,UAAU,YAAY,UAAU,SAAS,SAAS,GAAG,OAAO;EAElE,MAAM,aAAa,UAAU,UAAU,MAAM;EAC7C,IAAI,CAAC,YAAY,OAAO;EAExB,IAAI,WAAW,SAAS,UAAU,CAAC,WAAW,WAAW,MAAM,MAAM,EAAE,cAAc,MAAM,IAAI,GAAG,OAAO;EACzG,OAAO;CACT;CACA,OAAO;AACT"}
+{"version":3,"file":"canPreload.cjs","names":[],"sources":["../../src/preloading/canPreload.ts"],"sourcesContent":["import {\n  type EntityMetadata,\n  type Field,\n  type ManyToManyEnumField,\n  type ManyToManyField,\n  type ManyToOneField,\n  type OneToManyField,\n  type OneToOneField,\n} from \"src/EntityMetadata.ts\";\n\nexport function canPreload(\n  meta: EntityMetadata,\n  field: Field,\n): field is OneToManyField | ManyToOneField | ManyToManyField | ManyToManyEnumField | OneToOneField {\n  // Enum m2ms have no \"other\" entity table (the join target is an enum), so they're always preloadable.\n  if (field.kind === \"m2mEnum\") return true;\n  if (field.kind === \"o2m\" || field.kind === \"o2o\" || field.kind === \"m2o\" || field.kind === \"m2m\") {\n    const otherMeta = field.otherMetadata();\n    // We don't support preloading tables with inheritance yet\n    if (!!otherMeta.baseType || otherMeta.subTypes.length > 0) return false;\n    // If `otherField` is missing, this could be a large collection which currently can't be loaded...\n    const otherField = otherMeta.allFields[field.otherFieldName];\n    if (!otherField) return false;\n    // If otherField is a poly that points to a sub/base component, we don't support that yet\n    if (otherField.kind === \"poly\" && !otherField.components.some((c) => c.otherMetadata() === meta)) return false;\n    return true;\n  }\n  return false;\n}\n"],"mappings":";;;AAUA,SAAgB,WACd,MACA,OACkG;CAElG,IAAI,MAAM,SAAS,WAAW,OAAO;CACrC,IAAI,MAAM,SAAS,SAAS,MAAM,SAAS,SAAS,MAAM,SAAS,SAAS,MAAM,SAAS,OAAO;EAChG,MAAM,YAAY,MAAM,cAAc;EAEtC,IAAI,CAAC,CAAC,UAAU,YAAY,UAAU,SAAS,SAAS,GAAG,OAAO;EAElE,MAAM,aAAa,UAAU,UAAU,MAAM;EAC7C,IAAI,CAAC,YAAY,OAAO;EAExB,IAAI,WAAW,SAAS,UAAU,CAAC,WAAW,WAAW,MAAM,MAAM,EAAE,cAAc,MAAM,IAAI,GAAG,OAAO;EACzG,OAAO;CACT;CACA,OAAO;AACT"}

package/build/preloading/canPreload.js.map

@@ -1 +1 @@
-{"version":3,"file":"canPreload.js","names":[],"sources":["../../src/preloading/canPreload.ts"],"sourcesContent":["import {\n  type EntityMetadata,\n  type Field,\n  type ManyToManyEnumField,\n  type ManyToManyField,\n  type ManyToOneField,\n  type OneToManyField,\n  type OneToOneField,\n} from \"../EntityMetadata.ts\";\n\nexport function canPreload(\n  meta: EntityMetadata,\n  field: Field,\n): field is OneToManyField | ManyToOneField | ManyToManyField | ManyToManyEnumField | OneToOneField {\n  // Enum m2ms have no \"other\" entity table (the join target is an enum), so they're always preloadable.\n  if (field.kind === \"m2mEnum\") return true;\n  if (field.kind === \"o2m\" || field.kind === \"o2o\" || field.kind === \"m2o\" || field.kind === \"m2m\") {\n    const otherMeta = field.otherMetadata();\n    // We don't support preloading tables with inheritance yet\n    if (!!otherMeta.baseType || otherMeta.subTypes.length > 0) return false;\n    // If `otherField` is missing, this could be a large collection which currently can't be loaded...\n    const otherField = otherMeta.allFields[field.otherFieldName];\n    if (!otherField) return false;\n    // If otherField is a poly that points to a sub/base component, we don't support that yet\n    if (otherField.kind === \"poly\" && !otherField.components.some((c) => c.otherMetadata() === meta)) return false;\n    return true;\n  }\n  return false;\n}\n"],"mappings":";;AAUA,SAAgB,WACd,MACA,OACkG;CAElG,IAAI,MAAM,SAAS,WAAW,OAAO;CACrC,IAAI,MAAM,SAAS,SAAS,MAAM,SAAS,SAAS,MAAM,SAAS,SAAS,MAAM,SAAS,OAAO;EAChG,MAAM,YAAY,MAAM,cAAc;EAEtC,IAAI,CAAC,CAAC,UAAU,YAAY,UAAU,SAAS,SAAS,GAAG,OAAO;EAElE,MAAM,aAAa,UAAU,UAAU,MAAM;EAC7C,IAAI,CAAC,YAAY,OAAO;EAExB,IAAI,WAAW,SAAS,UAAU,CAAC,WAAW,WAAW,MAAM,MAAM,EAAE,cAAc,MAAM,IAAI,GAAG,OAAO;EACzG,OAAO;CACT;CACA,OAAO;AACT"}
+{"version":3,"file":"canPreload.js","names":[],"sources":["../../src/preloading/canPreload.ts"],"sourcesContent":["import {\n  type EntityMetadata,\n  type Field,\n  type ManyToManyEnumField,\n  type ManyToManyField,\n  type ManyToOneField,\n  type OneToManyField,\n  type OneToOneField,\n} from \"src/EntityMetadata.ts\";\n\nexport function canPreload(\n  meta: EntityMetadata,\n  field: Field,\n): field is OneToManyField | ManyToOneField | ManyToManyField | ManyToManyEnumField | OneToOneField {\n  // Enum m2ms have no \"other\" entity table (the join target is an enum), so they're always preloadable.\n  if (field.kind === \"m2mEnum\") return true;\n  if (field.kind === \"o2m\" || field.kind === \"o2o\" || field.kind === \"m2o\" || field.kind === \"m2m\") {\n    const otherMeta = field.otherMetadata();\n    // We don't support preloading tables with inheritance yet\n    if (!!otherMeta.baseType || otherMeta.subTypes.length > 0) return false;\n    // If `otherField` is missing, this could be a large collection which currently can't be loaded...\n    const otherField = otherMeta.allFields[field.otherFieldName];\n    if (!otherField) return false;\n    // If otherField is a poly that points to a sub/base component, we don't support that yet\n    if (otherField.kind === \"poly\" && !otherField.components.some((c) => c.otherMetadata() === meta)) return false;\n    return true;\n  }\n  return false;\n}\n"],"mappings":";;AAUA,SAAgB,WACd,MACA,OACkG;CAElG,IAAI,MAAM,SAAS,WAAW,OAAO;CACrC,IAAI,MAAM,SAAS,SAAS,MAAM,SAAS,SAAS,MAAM,SAAS,SAAS,MAAM,SAAS,OAAO;EAChG,MAAM,YAAY,MAAM,cAAc;EAEtC,IAAI,CAAC,CAAC,UAAU,YAAY,UAAU,SAAS,SAAS,GAAG,OAAO;EAElE,MAAM,aAAa,UAAU,UAAU,MAAM;EAC7C,IAAI,CAAC,YAAY,OAAO;EAExB,IAAI,WAAW,SAAS,UAAU,CAAC,WAAW,WAAW,MAAM,MAAM,EAAE,cAAc,MAAM,IAAI,GAAG,OAAO;EACzG,OAAO;CACT;CACA,OAAO;AACT"}

package/build/preloading/partitionHint.cjs

@@ -1,9 +1,8 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_relations_ReactiveReference = require("../relations/ReactiveReference.cjs");
 const require_normalizeHints = require("../normalizeHints.cjs");
-require("../loadHints.cjs");
-const require_getProperties = require("../getProperties.cjs");
+const require_relations_ReactiveReference = require("../relations/ReactiveReference.cjs");
 require("../relations/index.cjs");
+const require_getProperties = require("../getProperties.cjs");
 require("../EntityMetadata.cjs");
 const require_preloading_canPreload = require("./canPreload.cjs");
 //#region src/preloading/partitionHint.ts

package/build/preloading/partitionHint.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"partitionHint.cjs","names":["normalizeHint","canPreload","getProperties","ReactiveReferenceImpl","deepNormalizeHint"],"sources":["../../src/preloading/partitionHint.ts"],"sourcesContent":["import { type EntityMetadata } from \"../EntityMetadata.ts\";\nimport { getProperties } from \"../getProperties.ts\";\nimport { type LoadHint, type NestedLoadHint } from \"../loadHints.ts\";\nimport { deepNormalizeHint, normalizeHint } from \"../normalizeHints.ts\";\nimport { ReactiveReferenceImpl } from \"../relations/index.ts\";\nimport { canPreload } from \"./canPreload.ts\";\n\n/** Partitions a hint into SQL-able and non-SQL-able hints. */\nexport function partitionHint(\n  meta: EntityMetadata | undefined,\n  hint: LoadHint<any>,\n): [NestedLoadHint<any> | undefined, NestedLoadHint<any> | undefined] {\n  let sql: NestedLoadHint<any> | undefined = undefined;\n  let non: NestedLoadHint<any> | undefined = undefined;\n  for (const [key, subHint] of Object.entries(normalizeHint(hint))) {\n    const field = meta?.allFields[key];\n    if (field && canPreload(meta!, field)) {\n      if (field.kind === \"m2mEnum\") {\n        // Enum m2ms are a leaf relation (enum codes have no sub-hint to recurse into).\n        (sql ??= {})[key] ??= {};\n      } else {\n        const [_sql, _non] = partitionHint(field.otherMetadata(), subHint);\n        deepMerge(((sql ??= {})[key] ??= {}), _sql ?? {});\n        if (_non) deepMerge(((non ??= {})[key] ??= {}), _non);\n      }\n    } else {\n      // If this isn't a raw SQL relation, but it exposes a load-hint, inline that into our SQL.\n      // This will get the non-SQL relation's underlying SQL data preloaded.\n      const p = meta && getProperties(meta)[key];\n      if (p && p.loadHint) {\n        // Maybe we could have `PersistedAsyncReferenceImpl` internally/dynamically return us the right\n        // load hint, instead of special casing it like this? Like it could internally check \"needs calc?\"\n        if (p instanceof ReactiveReferenceImpl) {\n          // Instead of using p.loadHint, we'll just follow the FK in the database and go to the subHint\n          const [_sql, _non] = partitionHint(p.otherMeta, subHint);\n          deepMerge(((sql ??= {})[key] ??= {}), _sql ?? {});\n          if (_non) deepMerge(((non ??= {})[key] ??= {}), _non);\n          continue;\n        } else {\n          // It's not clear what to do with the subHint here, if anything--ideally it could stitch\n          // on top of load hint but only in the places that made sense. But we'd risk over-fetching.\n          // ...also we don't want to preload ReactiveField full hint vs. just using their\n          // calculated values.\n          // const [_sql, _non] = partitionHint(meta, p.loadHint);\n          // if (_sql) deepMerge((sql ??= {}), _sql);\n          // if (_non) deepMerge((non ??= {}), _non);\n        }\n      }\n      // Even if we did some SQL preloads, the subHint needs to go through the non-sql path.\n      deepMerge(((non ??= {})[key] ??= {}), deepNormalizeHint(subHint));\n    }\n  }\n  return [sql, non];\n}\n\nfunction deepMerge<T extends object>(a: T, b: T): void {\n  for (const [key, value] of Object.entries(b)) {\n    deepMerge(((a as any)[key] ??= {}), value);\n  }\n}\n"],"mappings":";;;;;;;;;;AAQA,SAAgB,cACd,MACA,MACoE;CACpE,IAAI,MAAuC,KAAA;CAC3C,IAAI,MAAuC,KAAA;CAC3C,KAAK,MAAM,CAAC,KAAK,YAAY,OAAO,QAAQA,uBAAAA,cAAc,IAAI,CAAC,GAAG;EAChE,MAAM,QAAQ,MAAM,UAAU;EAC9B,IAAI,SAASC,8BAAAA,WAAW,MAAO,KAAK,GAAG;GACrC,IAAI,MAAM,SAAS,WAEjB,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC;QAClB;IACL,MAAM,CAAC,MAAM,QAAQ,cAAc,MAAM,cAAc,GAAG,OAAO;IACjE,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,QAAQ,CAAC,CAAC;IAChD,IAAI,MAAM,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,IAAI;GACtD;EACF,OAAO;GAGL,MAAM,IAAI,QAAQC,sBAAAA,cAAc,IAAI,CAAC,CAAC;GACtC,IAAI,KAAK,EAAE,UAGL;QAAA,aAAaC,oCAAAA,uBAAuB;KAEtC,MAAM,CAAC,MAAM,QAAQ,cAAc,EAAE,WAAW,OAAO;KACvD,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,QAAQ,CAAC,CAAC;KAChD,IAAI,MAAM,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,IAAI;KACpD;IACF;;GAWF,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAIC,uBAAAA,kBAAkB,OAAO,CAAC;EAClE;CACF;CACA,OAAO,CAAC,KAAK,GAAG;AAClB;AAEA,SAAS,UAA4B,GAAM,GAAY;CACrD,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,CAAC,GACzC,UAAW,EAAW,SAAS,CAAC,GAAI,KAAK;AAE7C"}
+{"version":3,"file":"partitionHint.cjs","names":["normalizeHint","canPreload","getProperties","ReactiveReferenceImpl","deepNormalizeHint"],"sources":["../../src/preloading/partitionHint.ts"],"sourcesContent":["import { type EntityMetadata } from \"src/EntityMetadata.ts\";\nimport { getProperties } from \"src/getProperties.ts\";\nimport type { LoadHint, NestedLoadHint } from \"src/loading/loadHints.ts\";\nimport { deepNormalizeHint, normalizeHint } from \"src/normalizeHints.ts\";\nimport { canPreload } from \"src/preloading/canPreload.ts\";\nimport { ReactiveReferenceImpl } from \"src/relations/index.ts\";\n\n/** Partitions a hint into SQL-able and non-SQL-able hints. */\nexport function partitionHint(\n  meta: EntityMetadata | undefined,\n  hint: LoadHint<any>,\n): [NestedLoadHint<any> | undefined, NestedLoadHint<any> | undefined] {\n  let sql: NestedLoadHint<any> | undefined = undefined;\n  let non: NestedLoadHint<any> | undefined = undefined;\n  for (const [key, subHint] of Object.entries(normalizeHint(hint))) {\n    const field = meta?.allFields[key];\n    if (field && canPreload(meta!, field)) {\n      if (field.kind === \"m2mEnum\") {\n        // Enum m2ms are a leaf relation (enum codes have no sub-hint to recurse into).\n        (sql ??= {})[key] ??= {};\n      } else {\n        const [_sql, _non] = partitionHint(field.otherMetadata(), subHint);\n        deepMerge(((sql ??= {})[key] ??= {}), _sql ?? {});\n        if (_non) deepMerge(((non ??= {})[key] ??= {}), _non);\n      }\n    } else {\n      // If this isn't a raw SQL relation, but it exposes a load-hint, inline that into our SQL.\n      // This will get the non-SQL relation's underlying SQL data preloaded.\n      const p = meta && getProperties(meta)[key];\n      if (p && p.loadHint) {\n        // Maybe we could have `PersistedAsyncReferenceImpl` internally/dynamically return us the right\n        // load hint, instead of special casing it like this? Like it could internally check \"needs calc?\"\n        if (p instanceof ReactiveReferenceImpl) {\n          // Instead of using p.loadHint, we'll just follow the FK in the database and go to the subHint\n          const [_sql, _non] = partitionHint(p.otherMeta, subHint);\n          deepMerge(((sql ??= {})[key] ??= {}), _sql ?? {});\n          if (_non) deepMerge(((non ??= {})[key] ??= {}), _non);\n          continue;\n        } else {\n          // It's not clear what to do with the subHint here, if anything--ideally it could stitch\n          // on top of load hint but only in the places that made sense. But we'd risk over-fetching.\n          // ...also we don't want to preload ReactiveField full hint vs. just using their\n          // calculated values.\n          // const [_sql, _non] = partitionHint(meta, p.loadHint);\n          // if (_sql) deepMerge((sql ??= {}), _sql);\n          // if (_non) deepMerge((non ??= {}), _non);\n        }\n      }\n      // Even if we did some SQL preloads, the subHint needs to go through the non-sql path.\n      deepMerge(((non ??= {})[key] ??= {}), deepNormalizeHint(subHint));\n    }\n  }\n  return [sql, non];\n}\n\nfunction deepMerge<T extends object>(a: T, b: T): void {\n  for (const [key, value] of Object.entries(b)) {\n    deepMerge(((a as any)[key] ??= {}), value);\n  }\n}\n"],"mappings":";;;;;;;;;AAQA,SAAgB,cACd,MACA,MACoE;CACpE,IAAI,MAAuC,KAAA;CAC3C,IAAI,MAAuC,KAAA;CAC3C,KAAK,MAAM,CAAC,KAAK,YAAY,OAAO,QAAQA,uBAAAA,cAAc,IAAI,CAAC,GAAG;EAChE,MAAM,QAAQ,MAAM,UAAU;EAC9B,IAAI,SAASC,8BAAAA,WAAW,MAAO,KAAK,GAAG;GACrC,IAAI,MAAM,SAAS,WAEjB,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC;QAClB;IACL,MAAM,CAAC,MAAM,QAAQ,cAAc,MAAM,cAAc,GAAG,OAAO;IACjE,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,QAAQ,CAAC,CAAC;IAChD,IAAI,MAAM,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,IAAI;GACtD;EACF,OAAO;GAGL,MAAM,IAAI,QAAQC,sBAAAA,cAAc,IAAI,CAAC,CAAC;GACtC,IAAI,KAAK,EAAE,UAGL;QAAA,aAAaC,oCAAAA,uBAAuB;KAEtC,MAAM,CAAC,MAAM,QAAQ,cAAc,EAAE,WAAW,OAAO;KACvD,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,QAAQ,CAAC,CAAC;KAChD,IAAI,MAAM,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,IAAI;KACpD;IACF;;GAWF,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAIC,uBAAAA,kBAAkB,OAAO,CAAC;EAClE;CACF;CACA,OAAO,CAAC,KAAK,GAAG;AAClB;AAEA,SAAS,UAA4B,GAAM,GAAY;CACrD,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,CAAC,GACzC,UAAW,EAAW,SAAS,CAAC,GAAI,KAAK;AAE7C"}

package/build/preloading/partitionHint.d.cts

@@ -1,4 +1,4 @@
-import { LoadHint, NestedLoadHint } from "../loadHints.cjs";
+import { LoadHint, NestedLoadHint } from "../loading/loadHints.cjs";
 import { EntityMetadata } from "../EntityMetadata.cjs";
 //#region src/preloading/partitionHint.d.ts
 /** Partitions a hint into SQL-able and non-SQL-able hints. */

package/build/preloading/partitionHint.d.mts

@@ -1,4 +1,4 @@
-import { LoadHint, NestedLoadHint } from "../loadHints.mjs";
+import { LoadHint, NestedLoadHint } from "../loading/loadHints.mjs";
 import { EntityMetadata } from "../EntityMetadata.mjs";
 //#region src/preloading/partitionHint.d.ts
 /** Partitions a hint into SQL-able and non-SQL-able hints. */

package/build/preloading/partitionHint.js

@@ -1,8 +1,7 @@
-import { ReactiveReferenceImpl } from "../relations/ReactiveReference.js";
 import { deepNormalizeHint, normalizeHint } from "../normalizeHints.js";
-import "../loadHints.js";
-import { getProperties } from "../getProperties.js";
+import { ReactiveReferenceImpl } from "../relations/ReactiveReference.js";
 import "../relations/index.js";
+import { getProperties } from "../getProperties.js";
 import "../EntityMetadata.js";
 import { canPreload } from "./canPreload.js";
 //#region src/preloading/partitionHint.ts

package/build/preloading/partitionHint.js.map

@@ -1 +1 @@
-{"version":3,"file":"partitionHint.js","names":[],"sources":["../../src/preloading/partitionHint.ts"],"sourcesContent":["import { type EntityMetadata } from \"../EntityMetadata.ts\";\nimport { getProperties } from \"../getProperties.ts\";\nimport { type LoadHint, type NestedLoadHint } from \"../loadHints.ts\";\nimport { deepNormalizeHint, normalizeHint } from \"../normalizeHints.ts\";\nimport { ReactiveReferenceImpl } from \"../relations/index.ts\";\nimport { canPreload } from \"./canPreload.ts\";\n\n/** Partitions a hint into SQL-able and non-SQL-able hints. */\nexport function partitionHint(\n  meta: EntityMetadata | undefined,\n  hint: LoadHint<any>,\n): [NestedLoadHint<any> | undefined, NestedLoadHint<any> | undefined] {\n  let sql: NestedLoadHint<any> | undefined = undefined;\n  let non: NestedLoadHint<any> | undefined = undefined;\n  for (const [key, subHint] of Object.entries(normalizeHint(hint))) {\n    const field = meta?.allFields[key];\n    if (field && canPreload(meta!, field)) {\n      if (field.kind === \"m2mEnum\") {\n        // Enum m2ms are a leaf relation (enum codes have no sub-hint to recurse into).\n        (sql ??= {})[key] ??= {};\n      } else {\n        const [_sql, _non] = partitionHint(field.otherMetadata(), subHint);\n        deepMerge(((sql ??= {})[key] ??= {}), _sql ?? {});\n        if (_non) deepMerge(((non ??= {})[key] ??= {}), _non);\n      }\n    } else {\n      // If this isn't a raw SQL relation, but it exposes a load-hint, inline that into our SQL.\n      // This will get the non-SQL relation's underlying SQL data preloaded.\n      const p = meta && getProperties(meta)[key];\n      if (p && p.loadHint) {\n        // Maybe we could have `PersistedAsyncReferenceImpl` internally/dynamically return us the right\n        // load hint, instead of special casing it like this? Like it could internally check \"needs calc?\"\n        if (p instanceof ReactiveReferenceImpl) {\n          // Instead of using p.loadHint, we'll just follow the FK in the database and go to the subHint\n          const [_sql, _non] = partitionHint(p.otherMeta, subHint);\n          deepMerge(((sql ??= {})[key] ??= {}), _sql ?? {});\n          if (_non) deepMerge(((non ??= {})[key] ??= {}), _non);\n          continue;\n        } else {\n          // It's not clear what to do with the subHint here, if anything--ideally it could stitch\n          // on top of load hint but only in the places that made sense. But we'd risk over-fetching.\n          // ...also we don't want to preload ReactiveField full hint vs. just using their\n          // calculated values.\n          // const [_sql, _non] = partitionHint(meta, p.loadHint);\n          // if (_sql) deepMerge((sql ??= {}), _sql);\n          // if (_non) deepMerge((non ??= {}), _non);\n        }\n      }\n      // Even if we did some SQL preloads, the subHint needs to go through the non-sql path.\n      deepMerge(((non ??= {})[key] ??= {}), deepNormalizeHint(subHint));\n    }\n  }\n  return [sql, non];\n}\n\nfunction deepMerge<T extends object>(a: T, b: T): void {\n  for (const [key, value] of Object.entries(b)) {\n    deepMerge(((a as any)[key] ??= {}), value);\n  }\n}\n"],"mappings":";;;;;;;;;AAQA,SAAgB,cACd,MACA,MACoE;CACpE,IAAI,MAAuC,KAAA;CAC3C,IAAI,MAAuC,KAAA;CAC3C,KAAK,MAAM,CAAC,KAAK,YAAY,OAAO,QAAQ,cAAc,IAAI,CAAC,GAAG;EAChE,MAAM,QAAQ,MAAM,UAAU;EAC9B,IAAI,SAAS,WAAW,MAAO,KAAK,GAAG;GACrC,IAAI,MAAM,SAAS,WAEjB,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC;QAClB;IACL,MAAM,CAAC,MAAM,QAAQ,cAAc,MAAM,cAAc,GAAG,OAAO;IACjE,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,QAAQ,CAAC,CAAC;IAChD,IAAI,MAAM,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,IAAI;GACtD;EACF,OAAO;GAGL,MAAM,IAAI,QAAQ,cAAc,IAAI,CAAC,CAAC;GACtC,IAAI,KAAK,EAAE,UAGL;QAAA,aAAa,uBAAuB;KAEtC,MAAM,CAAC,MAAM,QAAQ,cAAc,EAAE,WAAW,OAAO;KACvD,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,QAAQ,CAAC,CAAC;KAChD,IAAI,MAAM,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,IAAI;KACpD;IACF;;GAWF,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,kBAAkB,OAAO,CAAC;EAClE;CACF;CACA,OAAO,CAAC,KAAK,GAAG;AAClB;AAEA,SAAS,UAA4B,GAAM,GAAY;CACrD,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,CAAC,GACzC,UAAW,EAAW,SAAS,CAAC,GAAI,KAAK;AAE7C"}
+{"version":3,"file":"partitionHint.js","names":[],"sources":["../../src/preloading/partitionHint.ts"],"sourcesContent":["import { type EntityMetadata } from \"src/EntityMetadata.ts\";\nimport { getProperties } from \"src/getProperties.ts\";\nimport type { LoadHint, NestedLoadHint } from \"src/loading/loadHints.ts\";\nimport { deepNormalizeHint, normalizeHint } from \"src/normalizeHints.ts\";\nimport { canPreload } from \"src/preloading/canPreload.ts\";\nimport { ReactiveReferenceImpl } from \"src/relations/index.ts\";\n\n/** Partitions a hint into SQL-able and non-SQL-able hints. */\nexport function partitionHint(\n  meta: EntityMetadata | undefined,\n  hint: LoadHint<any>,\n): [NestedLoadHint<any> | undefined, NestedLoadHint<any> | undefined] {\n  let sql: NestedLoadHint<any> | undefined = undefined;\n  let non: NestedLoadHint<any> | undefined = undefined;\n  for (const [key, subHint] of Object.entries(normalizeHint(hint))) {\n    const field = meta?.allFields[key];\n    if (field && canPreload(meta!, field)) {\n      if (field.kind === \"m2mEnum\") {\n        // Enum m2ms are a leaf relation (enum codes have no sub-hint to recurse into).\n        (sql ??= {})[key] ??= {};\n      } else {\n        const [_sql, _non] = partitionHint(field.otherMetadata(), subHint);\n        deepMerge(((sql ??= {})[key] ??= {}), _sql ?? {});\n        if (_non) deepMerge(((non ??= {})[key] ??= {}), _non);\n      }\n    } else {\n      // If this isn't a raw SQL relation, but it exposes a load-hint, inline that into our SQL.\n      // This will get the non-SQL relation's underlying SQL data preloaded.\n      const p = meta && getProperties(meta)[key];\n      if (p && p.loadHint) {\n        // Maybe we could have `PersistedAsyncReferenceImpl` internally/dynamically return us the right\n        // load hint, instead of special casing it like this? Like it could internally check \"needs calc?\"\n        if (p instanceof ReactiveReferenceImpl) {\n          // Instead of using p.loadHint, we'll just follow the FK in the database and go to the subHint\n          const [_sql, _non] = partitionHint(p.otherMeta, subHint);\n          deepMerge(((sql ??= {})[key] ??= {}), _sql ?? {});\n          if (_non) deepMerge(((non ??= {})[key] ??= {}), _non);\n          continue;\n        } else {\n          // It's not clear what to do with the subHint here, if anything--ideally it could stitch\n          // on top of load hint but only in the places that made sense. But we'd risk over-fetching.\n          // ...also we don't want to preload ReactiveField full hint vs. just using their\n          // calculated values.\n          // const [_sql, _non] = partitionHint(meta, p.loadHint);\n          // if (_sql) deepMerge((sql ??= {}), _sql);\n          // if (_non) deepMerge((non ??= {}), _non);\n        }\n      }\n      // Even if we did some SQL preloads, the subHint needs to go through the non-sql path.\n      deepMerge(((non ??= {})[key] ??= {}), deepNormalizeHint(subHint));\n    }\n  }\n  return [sql, non];\n}\n\nfunction deepMerge<T extends object>(a: T, b: T): void {\n  for (const [key, value] of Object.entries(b)) {\n    deepMerge(((a as any)[key] ??= {}), value);\n  }\n}\n"],"mappings":";;;;;;;;AAQA,SAAgB,cACd,MACA,MACoE;CACpE,IAAI,MAAuC,KAAA;CAC3C,IAAI,MAAuC,KAAA;CAC3C,KAAK,MAAM,CAAC,KAAK,YAAY,OAAO,QAAQ,cAAc,IAAI,CAAC,GAAG;EAChE,MAAM,QAAQ,MAAM,UAAU;EAC9B,IAAI,SAAS,WAAW,MAAO,KAAK,GAAG;GACrC,IAAI,MAAM,SAAS,WAEjB,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC;QAClB;IACL,MAAM,CAAC,MAAM,QAAQ,cAAc,MAAM,cAAc,GAAG,OAAO;IACjE,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,QAAQ,CAAC,CAAC;IAChD,IAAI,MAAM,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,IAAI;GACtD;EACF,OAAO;GAGL,MAAM,IAAI,QAAQ,cAAc,IAAI,CAAC,CAAC;GACtC,IAAI,KAAK,EAAE,UAGL;QAAA,aAAa,uBAAuB;KAEtC,MAAM,CAAC,MAAM,QAAQ,cAAc,EAAE,WAAW,OAAO;KACvD,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,QAAQ,CAAC,CAAC;KAChD,IAAI,MAAM,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,IAAI;KACpD;IACF;;GAWF,UAAW,CAAC,QAAQ,CAAC,EAAA,CAAG,SAAS,CAAC,GAAI,kBAAkB,OAAO,CAAC;EAClE;CACF;CACA,OAAO,CAAC,KAAK,GAAG;AAClB;AAEA,SAAS,UAA4B,GAAM,GAAY;CACrD,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,CAAC,GACzC,UAAW,EAAW,SAAS,CAAC,GAAI,KAAK;AAE7C"}

package/build/queries/ConditionBuilder.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"ConditionBuilder.cjs","names":["mapToDb","fail","partition","skipCondition","isDefined"],"sources":["../../src/queries/ConditionBuilder.ts"],"sourcesContent":["import type { Column } from \"../columns.ts\";\nimport { isDefined } from \"../EntityManager.ts\";\nimport { fail, partition } from \"../utils.ts\";\nimport type { ConditionGroup, ConditionInput } from \"./conditions.ts\";\nimport type {\n  ColumnCondition,\n  ParsedExpressionCondition,\n  ParsedExpressionFilter,\n  ParsedValueFilter,\n  RawCondition,\n} from \"./parsedConditions.ts\";\nimport { skipCondition } from \"./skipCondition.ts\";\nimport { mapToDb } from \"./valueFilters.ts\";\n\ntype PartialSome<T, K extends keyof T> = Omit<T, K> & Partial<Pick<T, K>>;\n\n/** Converts domain-level values like string ids/enums into their db equivalent. */\nexport class ConditionBuilder {\n  /** Simple, single-column conditions, which will be AND-d together. */\n  private conditions: (ColumnCondition | RawCondition)[] = [];\n  /** Complex expressions, which will also be AND-d together with `conditions`. */\n  private expressions: ParsedExpressionFilter[] = [];\n\n  /** Accepts a raw user-facing DSL filter, and parses it into a `ParsedExpressionFilter`. */\n  maybeAddExpression(expression: ConditionGroup<ConditionInput>): void {\n    const parsed = parseExpression(expression);\n    if (parsed) this.expressions.push(parsed);\n  }\n\n  /** Adds an already-db-level condition to the simple conditions list. */\n  addSimpleCondition(condition: ColumnCondition): void {\n    this.conditions.push(condition);\n  }\n\n  /** Adds an already-db-level condition to the simple conditions list. */\n  addRawCondition(condition: PartialSome<RawCondition, \"kind\" | \"bindings\">): void {\n    this.conditions.push({\n      kind: \"raw\",\n      bindings: [],\n      ...condition,\n    });\n  }\n\n  /** Adds an already-db-level expression to the expressions list. */\n  addParsedExpression(parsed: ParsedExpressionFilter): void {\n    this.expressions.push(parsed);\n  }\n\n  /**\n   * Adds a user-facing `ParsedValueFilter` to the inline conditions.\n   *\n   * Unless it's something like `in: [a1, null]`, in which case we split it into two `is-null` and `in` conditions.\n   */\n  addValueFilter(alias: string, column: Column, filter: ParsedValueFilter<any>): void {\n    if (filter.kind === \"in\" && filter.value.includes(null)) {\n      // If the filter contains a null, we need to split it into an `is-null` and `in` condition\n      const isNull = {\n        kind: \"column\",\n        alias,\n        column: column.columnName,\n        dbType: column.dbType,\n        cond: { kind: \"is-null\" },\n      } satisfies ColumnCondition;\n      const inValues = {\n        kind: \"column\",\n        alias,\n        column: column.columnName,\n        dbType: column.dbType,\n        cond: {\n          kind: \"in\",\n          // Filter out the nulls from the in condition\n          value: filter.value.filter((v) => v !== null).map((v) => column.mapToDb(v)),\n        },\n      } satisfies ColumnCondition;\n      // Now OR them back together\n      this.expressions.push({ kind: \"exp\", op: \"or\", conditions: [isNull, inValues] });\n    } else {\n      const cond = {\n        kind: \"column\",\n        alias,\n        column: column.columnName,\n        dbType: column.dbType,\n        // Rewrite the user-facing domain values to db values\n        cond: mapToDb(column, filter),\n      } satisfies ColumnCondition;\n      this.conditions.push(cond);\n    }\n  }\n\n  /** Combines our collected `conditions` and `expressions` into a single `ParsedExpressionFilter`. */\n  toExpressionFilter(): ParsedExpressionFilter | undefined {\n    const { expressions, conditions } = this;\n    const allSimple: ParsedExpressionCondition[] = [...conditions];\n    if (allSimple.length === 0 && expressions.length === 1) {\n      // If no inline conditions, and just 1 opt expression, just use that\n      return expressions[0];\n    } else if (expressions.length === 1 && expressions[0].op === \"and\") {\n      // Merge the 1 `AND` expression with the other simple conditions\n      return { kind: \"exp\", op: \"and\", conditions: [...allSimple, ...expressions[0].conditions] };\n    } else if (allSimple.length > 0 || expressions.length > 0) {\n      // Combine the conditions within the `em.find` join literal & the `conditions` as ANDs\n      return { kind: \"exp\", op: \"and\", conditions: [...allSimple, ...expressions] };\n    }\n    return undefined;\n  }\n}\n\n/** Parses user-facing `{ and: ... }` or `{ or: ... }` into a `ParsedExpressionFilter`. */\nfunction parseExpression(expression: ConditionGroup<ConditionInput>): ParsedExpressionFilter | undefined {\n  // Look for `{ and: [...] }` or `{ or: [...] }`\n  const [op, expressions] =\n    \"and\" in expression && expression.and\n      ? [\"and\" as const, expression.and]\n      : \"or\" in expression && expression.or\n        ? [\"or\" as const, expression.or]\n        : fail(`Invalid expression ${expression}`);\n  // Potentially recurse into nested expressions\n  const conditions = expressions.map((exp) => (exp && (\"and\" in exp || \"or\" in exp) ? parseExpression(exp) : exp));\n  const [skip, valid] = partition(conditions, (cond) => cond === undefined || cond === skipCondition);\n  if ((skip.length > 0 && expression.pruneIfUndefined === \"any\") || valid.length === 0) {\n    return undefined;\n  }\n  return { kind: \"exp\", op, conditions: valid.filter(isDefined) };\n}\n"],"mappings":";;;;;;;AAiBA,IAAa,mBAAb,MAA8B;;CAE5B,aAAyD,CAAC;;CAE1D,cAAgD,CAAC;;CAGjD,mBAAmB,YAAkD;EACnE,MAAM,SAAS,gBAAgB,UAAU;EACzC,IAAI,QAAQ,KAAK,YAAY,KAAK,MAAM;CAC1C;;CAGA,mBAAmB,WAAkC;EACnD,KAAK,WAAW,KAAK,SAAS;CAChC;;CAGA,gBAAgB,WAAiE;EAC/E,KAAK,WAAW,KAAK;GACnB,MAAM;GACN,UAAU,CAAC;GACX,GAAG;EACL,CAAC;CACH;;CAGA,oBAAoB,QAAsC;EACxD,KAAK,YAAY,KAAK,MAAM;CAC9B;;;;;;CAOA,eAAe,OAAe,QAAgB,QAAsC;EAClF,IAAI,OAAO,SAAS,QAAQ,OAAO,MAAM,SAAS,IAAI,GAAG;GAEvD,MAAM,SAAS;IACb,MAAM;IACN;IACA,QAAQ,OAAO;IACf,QAAQ,OAAO;IACf,MAAM,EAAE,MAAM,UAAU;GAC1B;GACA,MAAM,WAAW;IACf,MAAM;IACN;IACA,QAAQ,OAAO;IACf,QAAQ,OAAO;IACf,MAAM;KACJ,MAAM;KAEN,OAAO,OAAO,MAAM,QAAQ,MAAM,MAAM,IAAI,CAAC,CAAC,KAAK,MAAM,OAAO,QAAQ,CAAC,CAAC;IAC5E;GACF;GAEA,KAAK,YAAY,KAAK;IAAE,MAAM;IAAO,IAAI;IAAM,YAAY,CAAC,QAAQ,QAAQ;GAAE,CAAC;EACjF,OAAO;GACL,MAAM,OAAO;IACX,MAAM;IACN;IACA,QAAQ,OAAO;IACf,QAAQ,OAAO;IAEf,MAAMA,6BAAAA,QAAQ,QAAQ,MAAM;GAC9B;GACA,KAAK,WAAW,KAAK,IAAI;EAC3B;CACF;;CAGA,qBAAyD;EACvD,MAAM,EAAE,aAAa,eAAe;EACpC,MAAM,YAAyC,CAAC,GAAG,UAAU;EAC7D,IAAI,UAAU,WAAW,KAAK,YAAY,WAAW,GAEnD,OAAO,YAAY;OACd,IAAI,YAAY,WAAW,KAAK,YAAY,EAAE,CAAC,OAAO,OAE3D,OAAO;GAAE,MAAM;GAAO,IAAI;GAAO,YAAY,CAAC,GAAG,WAAW,GAAG,YAAY,EAAE,CAAC,UAAU;EAAE;OACrF,IAAI,UAAU,SAAS,KAAK,YAAY,SAAS,GAEtD,OAAO;GAAE,MAAM;GAAO,IAAI;GAAO,YAAY,CAAC,GAAG,WAAW,GAAG,WAAW;EAAE;CAGhF;AACF;;AAGA,SAAS,gBAAgB,YAAgF;CAEvG,MAAM,CAAC,IAAI,eACT,SAAS,cAAc,WAAW,MAC9B,CAAC,OAAgB,WAAW,GAAG,IAC/B,QAAQ,cAAc,WAAW,KAC/B,CAAC,MAAe,WAAW,EAAE,IAC7BC,cAAAA,KAAK,sBAAsB,YAAY;CAE/C,MAAM,aAAa,YAAY,KAAK,QAAS,QAAQ,SAAS,OAAO,QAAQ,OAAO,gBAAgB,GAAG,IAAI,GAAI;CAC/G,MAAM,CAAC,MAAM,SAASC,cAAAA,UAAU,aAAa,SAAS,SAAS,KAAA,KAAa,SAASC,8BAAAA,aAAa;CAClG,IAAK,KAAK,SAAS,KAAK,WAAW,qBAAqB,SAAU,MAAM,WAAW,GACjF;CAEF,OAAO;EAAE,MAAM;EAAO;EAAI,YAAY,MAAM,OAAOC,sBAAAA,SAAS;CAAE;AAChE"}
+{"version":3,"file":"ConditionBuilder.cjs","names":["mapToDb","fail","partition","skipCondition","isDefined"],"sources":["../../src/queries/ConditionBuilder.ts"],"sourcesContent":["import { isDefined } from \"src/EntityManager.ts\";\nimport type { ConditionGroup, ConditionInput } from \"src/queries/conditions.ts\";\nimport type {\n  ColumnCondition,\n  ParsedExpressionCondition,\n  ParsedExpressionFilter,\n  ParsedValueFilter,\n  RawCondition,\n} from \"src/queries/parsedConditions.ts\";\nimport { skipCondition } from \"src/queries/skipCondition.ts\";\nimport { mapToDb } from \"src/queries/valueFilters.ts\";\nimport type { Column } from \"src/serde/columns.ts\";\nimport { fail, partition } from \"src/utils.ts\";\n\ntype PartialSome<T, K extends keyof T> = Omit<T, K> & Partial<Pick<T, K>>;\n\n/** Converts domain-level values like string ids/enums into their db equivalent. */\nexport class ConditionBuilder {\n  /** Simple, single-column conditions, which will be AND-d together. */\n  private conditions: (ColumnCondition | RawCondition)[] = [];\n  /** Complex expressions, which will also be AND-d together with `conditions`. */\n  private expressions: ParsedExpressionFilter[] = [];\n\n  /** Accepts a raw user-facing DSL filter, and parses it into a `ParsedExpressionFilter`. */\n  maybeAddExpression(expression: ConditionGroup<ConditionInput>): void {\n    const parsed = parseExpression(expression);\n    if (parsed) this.expressions.push(parsed);\n  }\n\n  /** Adds an already-db-level condition to the simple conditions list. */\n  addSimpleCondition(condition: ColumnCondition): void {\n    this.conditions.push(condition);\n  }\n\n  /** Adds an already-db-level condition to the simple conditions list. */\n  addRawCondition(condition: PartialSome<RawCondition, \"kind\" | \"bindings\">): void {\n    this.conditions.push({\n      kind: \"raw\",\n      bindings: [],\n      ...condition,\n    });\n  }\n\n  /** Adds an already-db-level expression to the expressions list. */\n  addParsedExpression(parsed: ParsedExpressionFilter): void {\n    this.expressions.push(parsed);\n  }\n\n  /**\n   * Adds a user-facing `ParsedValueFilter` to the inline conditions.\n   *\n   * Unless it's something like `in: [a1, null]`, in which case we split it into two `is-null` and `in` conditions.\n   */\n  addValueFilter(alias: string, column: Column, filter: ParsedValueFilter<any>): void {\n    if (filter.kind === \"in\" && filter.value.includes(null)) {\n      // If the filter contains a null, we need to split it into an `is-null` and `in` condition\n      const isNull = {\n        kind: \"column\",\n        alias,\n        column: column.columnName,\n        dbType: column.dbType,\n        cond: { kind: \"is-null\" },\n      } satisfies ColumnCondition;\n      const inValues = {\n        kind: \"column\",\n        alias,\n        column: column.columnName,\n        dbType: column.dbType,\n        cond: {\n          kind: \"in\",\n          // Filter out the nulls from the in condition\n          value: filter.value.filter((v) => v !== null).map((v) => column.mapToDb(v)),\n        },\n      } satisfies ColumnCondition;\n      // Now OR them back together\n      this.expressions.push({ kind: \"exp\", op: \"or\", conditions: [isNull, inValues] });\n    } else {\n      const cond = {\n        kind: \"column\",\n        alias,\n        column: column.columnName,\n        dbType: column.dbType,\n        // Rewrite the user-facing domain values to db values\n        cond: mapToDb(column, filter),\n      } satisfies ColumnCondition;\n      this.conditions.push(cond);\n    }\n  }\n\n  /** Combines our collected `conditions` and `expressions` into a single `ParsedExpressionFilter`. */\n  toExpressionFilter(): ParsedExpressionFilter | undefined {\n    const { expressions, conditions } = this;\n    const allSimple: ParsedExpressionCondition[] = [...conditions];\n    if (allSimple.length === 0 && expressions.length === 1) {\n      // If no inline conditions, and just 1 opt expression, just use that\n      return expressions[0];\n    } else if (expressions.length === 1 && expressions[0].op === \"and\") {\n      // Merge the 1 `AND` expression with the other simple conditions\n      return { kind: \"exp\", op: \"and\", conditions: [...allSimple, ...expressions[0].conditions] };\n    } else if (allSimple.length > 0 || expressions.length > 0) {\n      // Combine the conditions within the `em.find` join literal & the `conditions` as ANDs\n      return { kind: \"exp\", op: \"and\", conditions: [...allSimple, ...expressions] };\n    }\n    return undefined;\n  }\n}\n\n/** Parses user-facing `{ and: ... }` or `{ or: ... }` into a `ParsedExpressionFilter`. */\nfunction parseExpression(expression: ConditionGroup<ConditionInput>): ParsedExpressionFilter | undefined {\n  // Look for `{ and: [...] }` or `{ or: [...] }`\n  const [op, expressions] =\n    \"and\" in expression && expression.and\n      ? [\"and\" as const, expression.and]\n      : \"or\" in expression && expression.or\n        ? [\"or\" as const, expression.or]\n        : fail(`Invalid expression ${expression}`);\n  // Potentially recurse into nested expressions\n  const conditions = expressions.map((exp) => (exp && (\"and\" in exp || \"or\" in exp) ? parseExpression(exp) : exp));\n  const [skip, valid] = partition(conditions, (cond) => cond === undefined || cond === skipCondition);\n  if ((skip.length > 0 && expression.pruneIfUndefined === \"any\") || valid.length === 0) {\n    return undefined;\n  }\n  return { kind: \"exp\", op, conditions: valid.filter(isDefined) };\n}\n"],"mappings":";;;;;;;AAiBA,IAAa,mBAAb,MAA8B;;CAE5B,aAAyD,CAAC;;CAE1D,cAAgD,CAAC;;CAGjD,mBAAmB,YAAkD;EACnE,MAAM,SAAS,gBAAgB,UAAU;EACzC,IAAI,QAAQ,KAAK,YAAY,KAAK,MAAM;CAC1C;;CAGA,mBAAmB,WAAkC;EACnD,KAAK,WAAW,KAAK,SAAS;CAChC;;CAGA,gBAAgB,WAAiE;EAC/E,KAAK,WAAW,KAAK;GACnB,MAAM;GACN,UAAU,CAAC;GACX,GAAG;EACL,CAAC;CACH;;CAGA,oBAAoB,QAAsC;EACxD,KAAK,YAAY,KAAK,MAAM;CAC9B;;;;;;CAOA,eAAe,OAAe,QAAgB,QAAsC;EAClF,IAAI,OAAO,SAAS,QAAQ,OAAO,MAAM,SAAS,IAAI,GAAG;GAEvD,MAAM,SAAS;IACb,MAAM;IACN;IACA,QAAQ,OAAO;IACf,QAAQ,OAAO;IACf,MAAM,EAAE,MAAM,UAAU;GAC1B;GACA,MAAM,WAAW;IACf,MAAM;IACN;IACA,QAAQ,OAAO;IACf,QAAQ,OAAO;IACf,MAAM;KACJ,MAAM;KAEN,OAAO,OAAO,MAAM,QAAQ,MAAM,MAAM,IAAI,CAAC,CAAC,KAAK,MAAM,OAAO,QAAQ,CAAC,CAAC;IAC5E;GACF;GAEA,KAAK,YAAY,KAAK;IAAE,MAAM;IAAO,IAAI;IAAM,YAAY,CAAC,QAAQ,QAAQ;GAAE,CAAC;EACjF,OAAO;GACL,MAAM,OAAO;IACX,MAAM;IACN;IACA,QAAQ,OAAO;IACf,QAAQ,OAAO;IAEf,MAAMA,6BAAAA,QAAQ,QAAQ,MAAM;GAC9B;GACA,KAAK,WAAW,KAAK,IAAI;EAC3B;CACF;;CAGA,qBAAyD;EACvD,MAAM,EAAE,aAAa,eAAe;EACpC,MAAM,YAAyC,CAAC,GAAG,UAAU;EAC7D,IAAI,UAAU,WAAW,KAAK,YAAY,WAAW,GAEnD,OAAO,YAAY;OACd,IAAI,YAAY,WAAW,KAAK,YAAY,EAAE,CAAC,OAAO,OAE3D,OAAO;GAAE,MAAM;GAAO,IAAI;GAAO,YAAY,CAAC,GAAG,WAAW,GAAG,YAAY,EAAE,CAAC,UAAU;EAAE;OACrF,IAAI,UAAU,SAAS,KAAK,YAAY,SAAS,GAEtD,OAAO;GAAE,MAAM;GAAO,IAAI;GAAO,YAAY,CAAC,GAAG,WAAW,GAAG,WAAW;EAAE;CAGhF;AACF;;AAGA,SAAS,gBAAgB,YAAgF;CAEvG,MAAM,CAAC,IAAI,eACT,SAAS,cAAc,WAAW,MAC9B,CAAC,OAAgB,WAAW,GAAG,IAC/B,QAAQ,cAAc,WAAW,KAC/B,CAAC,MAAe,WAAW,EAAE,IAC7BC,cAAAA,KAAK,sBAAsB,YAAY;CAE/C,MAAM,aAAa,YAAY,KAAK,QAAS,QAAQ,SAAS,OAAO,QAAQ,OAAO,gBAAgB,GAAG,IAAI,GAAI;CAC/G,MAAM,CAAC,MAAM,SAASC,cAAAA,UAAU,aAAa,SAAS,SAAS,KAAA,KAAa,SAASC,8BAAAA,aAAa;CAClG,IAAK,KAAK,SAAS,KAAK,WAAW,qBAAqB,SAAU,MAAM,WAAW,GACjF;CAEF,OAAO;EAAE,MAAM;EAAO;EAAI,YAAY,MAAM,OAAOC,sBAAAA,SAAS;CAAE;AAChE"}

package/build/queries/ConditionBuilder.d.cts

@@ -1,6 +1,6 @@
-import { Column } from "../columns.cjs";
 import { ColumnCondition, ParsedExpressionFilter, ParsedValueFilter, RawCondition } from "./parsedConditions.cjs";
 import { ConditionGroup, ConditionInput } from "./conditions.cjs";
+import { Column } from "../serde/columns.cjs";
 //#region src/queries/ConditionBuilder.d.ts
 type PartialSome<T, K extends keyof T> = Omit<T, K> & Partial<Pick<T, K>>;
 /** Converts domain-level values like string ids/enums into their db equivalent. */

package/build/queries/ConditionBuilder.d.mts

@@ -1,6 +1,6 @@
-import { Column } from "../columns.mjs";
 import { ColumnCondition, ParsedExpressionFilter, ParsedValueFilter, RawCondition } from "./parsedConditions.mjs";
 import { ConditionGroup, ConditionInput } from "./conditions.mjs";
+import { Column } from "../serde/columns.mjs";
 //#region src/queries/ConditionBuilder.d.ts
 type PartialSome<T, K extends keyof T> = Omit<T, K> & Partial<Pick<T, K>>;
 /** Converts domain-level values like string ids/enums into their db equivalent. */

package/build/queries/ConditionBuilder.js.map

@@ -1 +1 @@
-{"version":3,"file":"ConditionBuilder.js","names":[],"sources":["../../src/queries/ConditionBuilder.ts"],"sourcesContent":["import type { Column } from \"../columns.ts\";\nimport { isDefined } from \"../EntityManager.ts\";\nimport { fail, partition } from \"../utils.ts\";\nimport type { ConditionGroup, ConditionInput } from \"./conditions.ts\";\nimport type {\n  ColumnCondition,\n  ParsedExpressionCondition,\n  ParsedExpressionFilter,\n  ParsedValueFilter,\n  RawCondition,\n} from \"./parsedConditions.ts\";\nimport { skipCondition } from \"./skipCondition.ts\";\nimport { mapToDb } from \"./valueFilters.ts\";\n\ntype PartialSome<T, K extends keyof T> = Omit<T, K> & Partial<Pick<T, K>>;\n\n/** Converts domain-level values like string ids/enums into their db equivalent. */\nexport class ConditionBuilder {\n  /** Simple, single-column conditions, which will be AND-d together. */\n  private conditions: (ColumnCondition | RawCondition)[] = [];\n  /** Complex expressions, which will also be AND-d together with `conditions`. */\n  private expressions: ParsedExpressionFilter[] = [];\n\n  /** Accepts a raw user-facing DSL filter, and parses it into a `ParsedExpressionFilter`. */\n  maybeAddExpression(expression: ConditionGroup<ConditionInput>): void {\n    const parsed = parseExpression(expression);\n    if (parsed) this.expressions.push(parsed);\n  }\n\n  /** Adds an already-db-level condition to the simple conditions list. */\n  addSimpleCondition(condition: ColumnCondition): void {\n    this.conditions.push(condition);\n  }\n\n  /** Adds an already-db-level condition to the simple conditions list. */\n  addRawCondition(condition: PartialSome<RawCondition, \"kind\" | \"bindings\">): void {\n    this.conditions.push({\n      kind: \"raw\",\n      bindings: [],\n      ...condition,\n    });\n  }\n\n  /** Adds an already-db-level expression to the expressions list. */\n  addParsedExpression(parsed: ParsedExpressionFilter): void {\n    this.expressions.push(parsed);\n  }\n\n  /**\n   * Adds a user-facing `ParsedValueFilter` to the inline conditions.\n   *\n   * Unless it's something like `in: [a1, null]`, in which case we split it into two `is-null` and `in` conditions.\n   */\n  addValueFilter(alias: string, column: Column, filter: ParsedValueFilter<any>): void {\n    if (filter.kind === \"in\" && filter.value.includes(null)) {\n      // If the filter contains a null, we need to split it into an `is-null` and `in` condition\n      const isNull = {\n        kind: \"column\",\n        alias,\n        column: column.columnName,\n        dbType: column.dbType,\n        cond: { kind: \"is-null\" },\n      } satisfies ColumnCondition;\n      const inValues = {\n        kind: \"column\",\n        alias,\n        column: column.columnName,\n        dbType: column.dbType,\n        cond: {\n          kind: \"in\",\n          // Filter out the nulls from the in condition\n          value: filter.value.filter((v) => v !== null).map((v) => column.mapToDb(v)),\n        },\n      } satisfies ColumnCondition;\n      // Now OR them back together\n      this.expressions.push({ kind: \"exp\", op: \"or\", conditions: [isNull, inValues] });\n    } else {\n      const cond = {\n        kind: \"column\",\n        alias,\n        column: column.columnName,\n        dbType: column.dbType,\n        // Rewrite the user-facing domain values to db values\n        cond: mapToDb(column, filter),\n      } satisfies ColumnCondition;\n      this.conditions.push(cond);\n    }\n  }\n\n  /** Combines our collected `conditions` and `expressions` into a single `ParsedExpressionFilter`. */\n  toExpressionFilter(): ParsedExpressionFilter | undefined {\n    const { expressions, conditions } = this;\n    const allSimple: ParsedExpressionCondition[] = [...conditions];\n    if (allSimple.length === 0 && expressions.length === 1) {\n      // If no inline conditions, and just 1 opt expression, just use that\n      return expressions[0];\n    } else if (expressions.length === 1 && expressions[0].op === \"and\") {\n      // Merge the 1 `AND` expression with the other simple conditions\n      return { kind: \"exp\", op: \"and\", conditions: [...allSimple, ...expressions[0].conditions] };\n    } else if (allSimple.length > 0 || expressions.length > 0) {\n      // Combine the conditions within the `em.find` join literal & the `conditions` as ANDs\n      return { kind: \"exp\", op: \"and\", conditions: [...allSimple, ...expressions] };\n    }\n    return undefined;\n  }\n}\n\n/** Parses user-facing `{ and: ... }` or `{ or: ... }` into a `ParsedExpressionFilter`. */\nfunction parseExpression(expression: ConditionGroup<ConditionInput>): ParsedExpressionFilter | undefined {\n  // Look for `{ and: [...] }` or `{ or: [...] }`\n  const [op, expressions] =\n    \"and\" in expression && expression.and\n      ? [\"and\" as const, expression.and]\n      : \"or\" in expression && expression.or\n        ? [\"or\" as const, expression.or]\n        : fail(`Invalid expression ${expression}`);\n  // Potentially recurse into nested expressions\n  const conditions = expressions.map((exp) => (exp && (\"and\" in exp || \"or\" in exp) ? parseExpression(exp) : exp));\n  const [skip, valid] = partition(conditions, (cond) => cond === undefined || cond === skipCondition);\n  if ((skip.length > 0 && expression.pruneIfUndefined === \"any\") || valid.length === 0) {\n    return undefined;\n  }\n  return { kind: \"exp\", op, conditions: valid.filter(isDefined) };\n}\n"],"mappings":";;;;;;AAiBA,IAAa,mBAAb,MAA8B;;CAE5B,aAAyD,CAAC;;CAE1D,cAAgD,CAAC;;CAGjD,mBAAmB,YAAkD;EACnE,MAAM,SAAS,gBAAgB,UAAU;EACzC,IAAI,QAAQ,KAAK,YAAY,KAAK,MAAM;CAC1C;;CAGA,mBAAmB,WAAkC;EACnD,KAAK,WAAW,KAAK,SAAS;CAChC;;CAGA,gBAAgB,WAAiE;EAC/E,KAAK,WAAW,KAAK;GACnB,MAAM;GACN,UAAU,CAAC;GACX,GAAG;EACL,CAAC;CACH;;CAGA,oBAAoB,QAAsC;EACxD,KAAK,YAAY,KAAK,MAAM;CAC9B;;;;;;CAOA,eAAe,OAAe,QAAgB,QAAsC;EAClF,IAAI,OAAO,SAAS,QAAQ,OAAO,MAAM,SAAS,IAAI,GAAG;GAEvD,MAAM,SAAS;IACb,MAAM;IACN;IACA,QAAQ,OAAO;IACf,QAAQ,OAAO;IACf,MAAM,EAAE,MAAM,UAAU;GAC1B;GACA,MAAM,WAAW;IACf,MAAM;IACN;IACA,QAAQ,OAAO;IACf,QAAQ,OAAO;IACf,MAAM;KACJ,MAAM;KAEN,OAAO,OAAO,MAAM,QAAQ,MAAM,MAAM,IAAI,CAAC,CAAC,KAAK,MAAM,OAAO,QAAQ,CAAC,CAAC;IAC5E;GACF;GAEA,KAAK,YAAY,KAAK;IAAE,MAAM;IAAO,IAAI;IAAM,YAAY,CAAC,QAAQ,QAAQ;GAAE,CAAC;EACjF,OAAO;GACL,MAAM,OAAO;IACX,MAAM;IACN;IACA,QAAQ,OAAO;IACf,QAAQ,OAAO;IAEf,MAAM,QAAQ,QAAQ,MAAM;GAC9B;GACA,KAAK,WAAW,KAAK,IAAI;EAC3B;CACF;;CAGA,qBAAyD;EACvD,MAAM,EAAE,aAAa,eAAe;EACpC,MAAM,YAAyC,CAAC,GAAG,UAAU;EAC7D,IAAI,UAAU,WAAW,KAAK,YAAY,WAAW,GAEnD,OAAO,YAAY;OACd,IAAI,YAAY,WAAW,KAAK,YAAY,EAAE,CAAC,OAAO,OAE3D,OAAO;GAAE,MAAM;GAAO,IAAI;GAAO,YAAY,CAAC,GAAG,WAAW,GAAG,YAAY,EAAE,CAAC,UAAU;EAAE;OACrF,IAAI,UAAU,SAAS,KAAK,YAAY,SAAS,GAEtD,OAAO;GAAE,MAAM;GAAO,IAAI;GAAO,YAAY,CAAC,GAAG,WAAW,GAAG,WAAW;EAAE;CAGhF;AACF;;AAGA,SAAS,gBAAgB,YAAgF;CAEvG,MAAM,CAAC,IAAI,eACT,SAAS,cAAc,WAAW,MAC9B,CAAC,OAAgB,WAAW,GAAG,IAC/B,QAAQ,cAAc,WAAW,KAC/B,CAAC,MAAe,WAAW,EAAE,IAC7B,KAAK,sBAAsB,YAAY;CAE/C,MAAM,aAAa,YAAY,KAAK,QAAS,QAAQ,SAAS,OAAO,QAAQ,OAAO,gBAAgB,GAAG,IAAI,GAAI;CAC/G,MAAM,CAAC,MAAM,SAAS,UAAU,aAAa,SAAS,SAAS,KAAA,KAAa,SAAS,aAAa;CAClG,IAAK,KAAK,SAAS,KAAK,WAAW,qBAAqB,SAAU,MAAM,WAAW,GACjF;CAEF,OAAO;EAAE,MAAM;EAAO;EAAI,YAAY,MAAM,OAAO,SAAS;CAAE;AAChE"}
+{"version":3,"file":"ConditionBuilder.js","names":[],"sources":["../../src/queries/ConditionBuilder.ts"],"sourcesContent":["import { isDefined } from \"src/EntityManager.ts\";\nimport type { ConditionGroup, ConditionInput } from \"src/queries/conditions.ts\";\nimport type {\n  ColumnCondition,\n  ParsedExpressionCondition,\n  ParsedExpressionFilter,\n  ParsedValueFilter,\n  RawCondition,\n} from \"src/queries/parsedConditions.ts\";\nimport { skipCondition } from \"src/queries/skipCondition.ts\";\nimport { mapToDb } from \"src/queries/valueFilters.ts\";\nimport type { Column } from \"src/serde/columns.ts\";\nimport { fail, partition } from \"src/utils.ts\";\n\ntype PartialSome<T, K extends keyof T> = Omit<T, K> & Partial<Pick<T, K>>;\n\n/** Converts domain-level values like string ids/enums into their db equivalent. */\nexport class ConditionBuilder {\n  /** Simple, single-column conditions, which will be AND-d together. */\n  private conditions: (ColumnCondition | RawCondition)[] = [];\n  /** Complex expressions, which will also be AND-d together with `conditions`. */\n  private expressions: ParsedExpressionFilter[] = [];\n\n  /** Accepts a raw user-facing DSL filter, and parses it into a `ParsedExpressionFilter`. */\n  maybeAddExpression(expression: ConditionGroup<ConditionInput>): void {\n    const parsed = parseExpression(expression);\n    if (parsed) this.expressions.push(parsed);\n  }\n\n  /** Adds an already-db-level condition to the simple conditions list. */\n  addSimpleCondition(condition: ColumnCondition): void {\n    this.conditions.push(condition);\n  }\n\n  /** Adds an already-db-level condition to the simple conditions list. */\n  addRawCondition(condition: PartialSome<RawCondition, \"kind\" | \"bindings\">): void {\n    this.conditions.push({\n      kind: \"raw\",\n      bindings: [],\n      ...condition,\n    });\n  }\n\n  /** Adds an already-db-level expression to the expressions list. */\n  addParsedExpression(parsed: ParsedExpressionFilter): void {\n    this.expressions.push(parsed);\n  }\n\n  /**\n   * Adds a user-facing `ParsedValueFilter` to the inline conditions.\n   *\n   * Unless it's something like `in: [a1, null]`, in which case we split it into two `is-null` and `in` conditions.\n   */\n  addValueFilter(alias: string, column: Column, filter: ParsedValueFilter<any>): void {\n    if (filter.kind === \"in\" && filter.value.includes(null)) {\n      // If the filter contains a null, we need to split it into an `is-null` and `in` condition\n      const isNull = {\n        kind: \"column\",\n        alias,\n        column: column.columnName,\n        dbType: column.dbType,\n        cond: { kind: \"is-null\" },\n      } satisfies ColumnCondition;\n      const inValues = {\n        kind: \"column\",\n        alias,\n        column: column.columnName,\n        dbType: column.dbType,\n        cond: {\n          kind: \"in\",\n          // Filter out the nulls from the in condition\n          value: filter.value.filter((v) => v !== null).map((v) => column.mapToDb(v)),\n        },\n      } satisfies ColumnCondition;\n      // Now OR them back together\n      this.expressions.push({ kind: \"exp\", op: \"or\", conditions: [isNull, inValues] });\n    } else {\n      const cond = {\n        kind: \"column\",\n        alias,\n        column: column.columnName,\n        dbType: column.dbType,\n        // Rewrite the user-facing domain values to db values\n        cond: mapToDb(column, filter),\n      } satisfies ColumnCondition;\n      this.conditions.push(cond);\n    }\n  }\n\n  /** Combines our collected `conditions` and `expressions` into a single `ParsedExpressionFilter`. */\n  toExpressionFilter(): ParsedExpressionFilter | undefined {\n    const { expressions, conditions } = this;\n    const allSimple: ParsedExpressionCondition[] = [...conditions];\n    if (allSimple.length === 0 && expressions.length === 1) {\n      // If no inline conditions, and just 1 opt expression, just use that\n      return expressions[0];\n    } else if (expressions.length === 1 && expressions[0].op === \"and\") {\n      // Merge the 1 `AND` expression with the other simple conditions\n      return { kind: \"exp\", op: \"and\", conditions: [...allSimple, ...expressions[0].conditions] };\n    } else if (allSimple.length > 0 || expressions.length > 0) {\n      // Combine the conditions within the `em.find` join literal & the `conditions` as ANDs\n      return { kind: \"exp\", op: \"and\", conditions: [...allSimple, ...expressions] };\n    }\n    return undefined;\n  }\n}\n\n/** Parses user-facing `{ and: ... }` or `{ or: ... }` into a `ParsedExpressionFilter`. */\nfunction parseExpression(expression: ConditionGroup<ConditionInput>): ParsedExpressionFilter | undefined {\n  // Look for `{ and: [...] }` or `{ or: [...] }`\n  const [op, expressions] =\n    \"and\" in expression && expression.and\n      ? [\"and\" as const, expression.and]\n      : \"or\" in expression && expression.or\n        ? [\"or\" as const, expression.or]\n        : fail(`Invalid expression ${expression}`);\n  // Potentially recurse into nested expressions\n  const conditions = expressions.map((exp) => (exp && (\"and\" in exp || \"or\" in exp) ? parseExpression(exp) : exp));\n  const [skip, valid] = partition(conditions, (cond) => cond === undefined || cond === skipCondition);\n  if ((skip.length > 0 && expression.pruneIfUndefined === \"any\") || valid.length === 0) {\n    return undefined;\n  }\n  return { kind: \"exp\", op, conditions: valid.filter(isDefined) };\n}\n"],"mappings":";;;;;;AAiBA,IAAa,mBAAb,MAA8B;;CAE5B,aAAyD,CAAC;;CAE1D,cAAgD,CAAC;;CAGjD,mBAAmB,YAAkD;EACnE,MAAM,SAAS,gBAAgB,UAAU;EACzC,IAAI,QAAQ,KAAK,YAAY,KAAK,MAAM;CAC1C;;CAGA,mBAAmB,WAAkC;EACnD,KAAK,WAAW,KAAK,SAAS;CAChC;;CAGA,gBAAgB,WAAiE;EAC/E,KAAK,WAAW,KAAK;GACnB,MAAM;GACN,UAAU,CAAC;GACX,GAAG;EACL,CAAC;CACH;;CAGA,oBAAoB,QAAsC;EACxD,KAAK,YAAY,KAAK,MAAM;CAC9B;;;;;;CAOA,eAAe,OAAe,QAAgB,QAAsC;EAClF,IAAI,OAAO,SAAS,QAAQ,OAAO,MAAM,SAAS,IAAI,GAAG;GAEvD,MAAM,SAAS;IACb,MAAM;IACN;IACA,QAAQ,OAAO;IACf,QAAQ,OAAO;IACf,MAAM,EAAE,MAAM,UAAU;GAC1B;GACA,MAAM,WAAW;IACf,MAAM;IACN;IACA,QAAQ,OAAO;IACf,QAAQ,OAAO;IACf,MAAM;KACJ,MAAM;KAEN,OAAO,OAAO,MAAM,QAAQ,MAAM,MAAM,IAAI,CAAC,CAAC,KAAK,MAAM,OAAO,QAAQ,CAAC,CAAC;IAC5E;GACF;GAEA,KAAK,YAAY,KAAK;IAAE,MAAM;IAAO,IAAI;IAAM,YAAY,CAAC,QAAQ,QAAQ;GAAE,CAAC;EACjF,OAAO;GACL,MAAM,OAAO;IACX,MAAM;IACN;IACA,QAAQ,OAAO;IACf,QAAQ,OAAO;IAEf,MAAM,QAAQ,QAAQ,MAAM;GAC9B;GACA,KAAK,WAAW,KAAK,IAAI;EAC3B;CACF;;CAGA,qBAAyD;EACvD,MAAM,EAAE,aAAa,eAAe;EACpC,MAAM,YAAyC,CAAC,GAAG,UAAU;EAC7D,IAAI,UAAU,WAAW,KAAK,YAAY,WAAW,GAEnD,OAAO,YAAY;OACd,IAAI,YAAY,WAAW,KAAK,YAAY,EAAE,CAAC,OAAO,OAE3D,OAAO;GAAE,MAAM;GAAO,IAAI;GAAO,YAAY,CAAC,GAAG,WAAW,GAAG,YAAY,EAAE,CAAC,UAAU;EAAE;OACrF,IAAI,UAAU,SAAS,KAAK,YAAY,SAAS,GAEtD,OAAO;GAAE,MAAM;GAAO,IAAI;GAAO,YAAY,CAAC,GAAG,WAAW,GAAG,WAAW;EAAE;CAGhF;AACF;;AAGA,SAAS,gBAAgB,YAAgF;CAEvG,MAAM,CAAC,IAAI,eACT,SAAS,cAAc,WAAW,MAC9B,CAAC,OAAgB,WAAW,GAAG,IAC/B,QAAQ,cAAc,WAAW,KAC/B,CAAC,MAAe,WAAW,EAAE,IAC7B,KAAK,sBAAsB,YAAY;CAE/C,MAAM,aAAa,YAAY,KAAK,QAAS,QAAQ,SAAS,OAAO,QAAQ,OAAO,gBAAgB,GAAG,IAAI,GAAI;CAC/G,MAAM,CAAC,MAAM,SAAS,UAAU,aAAa,SAAS,SAAS,KAAA,KAAa,SAAS,aAAa;CAClG,IAAK,KAAK,SAAS,KAAK,WAAW,qBAAqB,SAAU,MAAM,WAAW,GACjF;CAEF,OAAO;EAAE,MAAM;EAAO;EAAI,YAAY,MAAM,OAAO,SAAS;CAAE;AAChE"}

package/build/queries/conditions.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"conditions.cjs","names":[],"sources":["../../src/queries/conditions.ts"],"sourcesContent":["import type { ColumnCondition, RawCondition } from \"./parsedConditions.ts\";\n\nexport const predicateBrand: unique symbol = Symbol(\"joist.predicate\");\n\n/** Combines conditions without tying AND/OR or optional-filter pruning to either public API. */\nexport type ConditionGroup<C> = AndCondition<C> | OrCondition<C>;\n\n/** Requires every surviving condition to match. */\nexport interface AndCondition<C> {\n  and: Array<C | undefined>;\n  or?: never;\n  pruneIfUndefined?: \"any\" | \"all\";\n}\n\n/** Requires at least one surviving condition to match. */\nexport interface OrCondition<C> {\n  or: Array<C | undefined>;\n  and?: never;\n  pruneIfUndefined?: \"any\" | \"all\";\n}\n\n/** Identifies which API can resolve a predicate's aliases. */\nexport interface PredicateBrand<K extends \"domain\" | \"sql\"> {\n  readonly [predicateBrand]: K;\n}\n\n/** A predicate built from alias(...) for em.find and scopes. */\nexport type DomainPredicate = (ColumnCondition | RawCondition) & PredicateBrand<\"domain\">;\n\n/** A predicate built from table(...), an SQL expression, or sql.condition. */\nexport type SqlPredicate = (ColumnCondition | RawCondition) & PredicateBrand<\"sql\">;\n\n/** Existing hand-written conditions remain an escape hatch, but cannot accept a foreign branded predicate. */\nexport type UnbrandedPredicate = (ColumnCondition | RawCondition) & { readonly [predicateBrand]?: never };\n\n/** SQL predicates and nested AND/OR groups, before query-specific clauses such as EXISTS are added. */\nexport type SqlCondition = AndCondition<SqlCondition> | OrCondition<SqlCondition> | SqlPredicate | UnbrandedPredicate;\n\n/** Unbranded compiler input shared by domain filtering and SQL queries after public API validation. */\nexport type ConditionInput =\n  | AndCondition<ConditionInput>\n  | OrCondition<ConditionInput>\n  | ColumnCondition\n  | RawCondition;\n\n/** Marks a newly created predicate without changing its enumerable SQL representation. */\nexport function brandPredicate<C extends object, K extends \"domain\" | \"sql\">(cond: C, kind: K): C & PredicateBrand<K> {\n  return Object.defineProperty(cond, predicateBrand, { value: kind, enumerable: false }) as C & PredicateBrand<K>;\n}\n"],"mappings":";;AAEA,MAAa,iBAAgC,OAAO,iBAAiB;;AA4CrE,SAAgB,eAA6D,MAAS,MAAgC;CACpH,OAAO,OAAO,eAAe,MAAM,gBAAgB;EAAE,OAAO;EAAM,YAAY;CAAM,CAAC;AACvF"}
+{"version":3,"file":"conditions.cjs","names":[],"sources":["../../src/queries/conditions.ts"],"sourcesContent":["import type { ColumnCondition, RawCondition } from \"src/queries/parsedConditions.ts\";\n\nexport const predicateBrand: unique symbol = Symbol(\"joist.predicate\");\n\n/** Combines conditions without tying AND/OR or optional-filter pruning to either public API. */\nexport type ConditionGroup<C> = AndCondition<C> | OrCondition<C>;\n\n/** Requires every surviving condition to match. */\nexport interface AndCondition<C> {\n  and: Array<C | undefined>;\n  or?: never;\n  pruneIfUndefined?: \"any\" | \"all\";\n}\n\n/** Requires at least one surviving condition to match. */\nexport interface OrCondition<C> {\n  or: Array<C | undefined>;\n  and?: never;\n  pruneIfUndefined?: \"any\" | \"all\";\n}\n\n/** Identifies which API can resolve a predicate's aliases. */\nexport interface PredicateBrand<K extends \"domain\" | \"sql\"> {\n  readonly [predicateBrand]: K;\n}\n\n/** A predicate built from alias(...) for em.find and scopes. */\nexport type DomainPredicate = (ColumnCondition | RawCondition) & PredicateBrand<\"domain\">;\n\n/** A predicate built from table(...), an SQL expression, or sql.condition. */\nexport type SqlPredicate = (ColumnCondition | RawCondition) & PredicateBrand<\"sql\">;\n\n/** Existing hand-written conditions remain an escape hatch, but cannot accept a foreign branded predicate. */\nexport type UnbrandedPredicate = (ColumnCondition | RawCondition) & { readonly [predicateBrand]?: never };\n\n/** SQL predicates and nested AND/OR groups, before query-specific clauses such as EXISTS are added. */\nexport type SqlCondition = AndCondition<SqlCondition> | OrCondition<SqlCondition> | SqlPredicate | UnbrandedPredicate;\n\n/** Unbranded compiler input shared by domain filtering and SQL queries after public API validation. */\nexport type ConditionInput =\n  | AndCondition<ConditionInput>\n  | OrCondition<ConditionInput>\n  | ColumnCondition\n  | RawCondition;\n\n/** Marks a newly created predicate without changing its enumerable SQL representation. */\nexport function brandPredicate<C extends object, K extends \"domain\" | \"sql\">(cond: C, kind: K): C & PredicateBrand<K> {\n  return Object.defineProperty(cond, predicateBrand, { value: kind, enumerable: false }) as C & PredicateBrand<K>;\n}\n"],"mappings":";;AAEA,MAAa,iBAAgC,OAAO,iBAAiB;;AA4CrE,SAAgB,eAA6D,MAAS,MAAgC;CACpH,OAAO,OAAO,eAAe,MAAM,gBAAgB;EAAE,OAAO;EAAM,YAAY;CAAM,CAAC;AACvF"}

package/build/queries/conditions.js.map

@@ -1 +1 @@
-{"version":3,"file":"conditions.js","names":[],"sources":["../../src/queries/conditions.ts"],"sourcesContent":["import type { ColumnCondition, RawCondition } from \"./parsedConditions.ts\";\n\nexport const predicateBrand: unique symbol = Symbol(\"joist.predicate\");\n\n/** Combines conditions without tying AND/OR or optional-filter pruning to either public API. */\nexport type ConditionGroup<C> = AndCondition<C> | OrCondition<C>;\n\n/** Requires every surviving condition to match. */\nexport interface AndCondition<C> {\n  and: Array<C | undefined>;\n  or?: never;\n  pruneIfUndefined?: \"any\" | \"all\";\n}\n\n/** Requires at least one surviving condition to match. */\nexport interface OrCondition<C> {\n  or: Array<C | undefined>;\n  and?: never;\n  pruneIfUndefined?: \"any\" | \"all\";\n}\n\n/** Identifies which API can resolve a predicate's aliases. */\nexport interface PredicateBrand<K extends \"domain\" | \"sql\"> {\n  readonly [predicateBrand]: K;\n}\n\n/** A predicate built from alias(...) for em.find and scopes. */\nexport type DomainPredicate = (ColumnCondition | RawCondition) & PredicateBrand<\"domain\">;\n\n/** A predicate built from table(...), an SQL expression, or sql.condition. */\nexport type SqlPredicate = (ColumnCondition | RawCondition) & PredicateBrand<\"sql\">;\n\n/** Existing hand-written conditions remain an escape hatch, but cannot accept a foreign branded predicate. */\nexport type UnbrandedPredicate = (ColumnCondition | RawCondition) & { readonly [predicateBrand]?: never };\n\n/** SQL predicates and nested AND/OR groups, before query-specific clauses such as EXISTS are added. */\nexport type SqlCondition = AndCondition<SqlCondition> | OrCondition<SqlCondition> | SqlPredicate | UnbrandedPredicate;\n\n/** Unbranded compiler input shared by domain filtering and SQL queries after public API validation. */\nexport type ConditionInput =\n  | AndCondition<ConditionInput>\n  | OrCondition<ConditionInput>\n  | ColumnCondition\n  | RawCondition;\n\n/** Marks a newly created predicate without changing its enumerable SQL representation. */\nexport function brandPredicate<C extends object, K extends \"domain\" | \"sql\">(cond: C, kind: K): C & PredicateBrand<K> {\n  return Object.defineProperty(cond, predicateBrand, { value: kind, enumerable: false }) as C & PredicateBrand<K>;\n}\n"],"mappings":";AAEA,MAAa,iBAAgC,OAAO,iBAAiB;;AA4CrE,SAAgB,eAA6D,MAAS,MAAgC;CACpH,OAAO,OAAO,eAAe,MAAM,gBAAgB;EAAE,OAAO;EAAM,YAAY;CAAM,CAAC;AACvF"}
+{"version":3,"file":"conditions.js","names":[],"sources":["../../src/queries/conditions.ts"],"sourcesContent":["import type { ColumnCondition, RawCondition } from \"src/queries/parsedConditions.ts\";\n\nexport const predicateBrand: unique symbol = Symbol(\"joist.predicate\");\n\n/** Combines conditions without tying AND/OR or optional-filter pruning to either public API. */\nexport type ConditionGroup<C> = AndCondition<C> | OrCondition<C>;\n\n/** Requires every surviving condition to match. */\nexport interface AndCondition<C> {\n  and: Array<C | undefined>;\n  or?: never;\n  pruneIfUndefined?: \"any\" | \"all\";\n}\n\n/** Requires at least one surviving condition to match. */\nexport interface OrCondition<C> {\n  or: Array<C | undefined>;\n  and?: never;\n  pruneIfUndefined?: \"any\" | \"all\";\n}\n\n/** Identifies which API can resolve a predicate's aliases. */\nexport interface PredicateBrand<K extends \"domain\" | \"sql\"> {\n  readonly [predicateBrand]: K;\n}\n\n/** A predicate built from alias(...) for em.find and scopes. */\nexport type DomainPredicate = (ColumnCondition | RawCondition) & PredicateBrand<\"domain\">;\n\n/** A predicate built from table(...), an SQL expression, or sql.condition. */\nexport type SqlPredicate = (ColumnCondition | RawCondition) & PredicateBrand<\"sql\">;\n\n/** Existing hand-written conditions remain an escape hatch, but cannot accept a foreign branded predicate. */\nexport type UnbrandedPredicate = (ColumnCondition | RawCondition) & { readonly [predicateBrand]?: never };\n\n/** SQL predicates and nested AND/OR groups, before query-specific clauses such as EXISTS are added. */\nexport type SqlCondition = AndCondition<SqlCondition> | OrCondition<SqlCondition> | SqlPredicate | UnbrandedPredicate;\n\n/** Unbranded compiler input shared by domain filtering and SQL queries after public API validation. */\nexport type ConditionInput =\n  | AndCondition<ConditionInput>\n  | OrCondition<ConditionInput>\n  | ColumnCondition\n  | RawCondition;\n\n/** Marks a newly created predicate without changing its enumerable SQL representation. */\nexport function brandPredicate<C extends object, K extends \"domain\" | \"sql\">(cond: C, kind: K): C & PredicateBrand<K> {\n  return Object.defineProperty(cond, predicateBrand, { value: kind, enumerable: false }) as C & PredicateBrand<K>;\n}\n"],"mappings":";AAEA,MAAa,iBAAgC,OAAO,iBAAiB;;AA4CrE,SAAgB,eAA6D,MAAS,MAAgC;CACpH,OAAO,OAAO,eAAe,MAAM,gBAAgB;EAAE,OAAO;EAAM,YAAY;CAAM,CAAC;AACvF"}